-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathproblem 22
More file actions
50 lines (42 loc) · 1.47 KB
/
Copy pathproblem 22
File metadata and controls
50 lines (42 loc) · 1.47 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
/*
Using names.txt (right click and 'Save Link/Target As...'), a 46K text file containing over five-thousand first names, begin by sorting it into alphabetical order. Then working out the alphabetical value for each name, multiply this value by its alphabetical position in the list to obtain a name score.
For example, when the list is sorted into alphabetical order, COLIN, which is worth 3 + 15 + 12 + 9 + 14 = 53, is the 938th name in the list. So, COLIN would obtain a score of 938 × 53 = 49714.
What is the total of all the name scores in the file?
*/
#include<iostream>
#include<algorithm>
#include<fstream>
#include<string>
#include<vector>
#include<bits/stdc++.h>
#include<sstream>
using namespace std;
int name_scores(const string& name){
int sumof = 0;
int size = name.size();
char char_array[size];
strcpy(char_array , name.c_str());
for(int alpha = 0; alpha < size; alpha++){
sumof += char_array[alpha] - 64;
}
return sumof;
}
/*void remove_quote(stringstream & read , string & name){
name.erase(remove(name.begin() , name.end() , "\"") , name.end());
}*/
int main() {
ifstream read;
read.open("names.txt");
string name;
vector<string> names;
while(getline(read, name, ',')){
names.push_back(name.substr(1, name.size() - 2));
}
std::sort(names.begin(), names.end());
long total = 0;
for(int index = 0; index < names.size(); index++){
total = (index + 1) * name_scores(names[index]) + total;
}
cout << total << endl;
return 0;
}