Problem 22

Names scores

Problem 22

19 July 2002

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?

 

Answer:

871198282

 

#include "pub.h"
#include <fstream>
#include <vector>
#include <algorithm>
/*
 *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?
*/
void p22()
{
    ifstream file("D:\\study\\My_Program\\haa\\tt-build-Desktop-Release\\release\\names.txt");
    if (!file) {
        cerr << "can't open input file "<< endl;
        return;
    }
    char c;
    string name="";
    vector<string> names;
    int i=1;
    while (file.get(c)) {
        if(c=='"')
            continue;
        else if(c==','){
            names.push_back(name);
            name="";
        }
        else{
            name+=c;
        }
    }
    names.push_back(name);
    sort(names.begin(),names.end());
    long num_total=0;
    for(int i=0;i<names.size();++i){
        long num_sum=0;
        for(int j=0;j<names[i].length();j++)
            num_sum+=(names[i][j]-'A'+1);
        num_total+=num_sum*(i+1);
    }
    cout<<num_total<<endl;
}