首页 > 其他 > 详细

Project Euler:Problem 22 Names scores

时间:2015-06-02 09:30:16      阅读:148      评论:0      收藏:0      [点我收藏+]

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?



不知道为什么我输出的结果与标准答案相差1545,在输出结果中,COLIN对应的值也确实为49714,不知道程序哪里出了错(╯‵□′)╯︵┻━┻


#include <iostream>
#include<string>
#include <fstream>
#include <vector>
using namespace std;

void sort(vector<char *> &a)
{
	char *tmp;
	int n = a.size();
	int k,i,j;
	for (i = 0; i < n - 1; i++)
	{
		k = i;
		for (j = i + 1; j < n; j++)
		{
			if (strcmp(a[k], a[j])>0)
				k=j;
			if (k != i)
			{
				tmp = a[i];
				a[i] = a[k];
				a[k] = tmp;
			}
		}
	}
}

int main()
{
	ifstream input;
	input.open("names.txt");
	char s[46448];
	while (!input.eof())
		input >> s;
	input.close();
	vector<string> name;
	string tm;
	for (int i = 1; i <= 46446; i++)
	{
		if (s[i] >= 65 && s[i] <= 90 && s[i + 1] == '"')
		{
			tm = tm + s[i];
			name.push_back(tm);
			tm.clear();
		}
		else if (s[i] == ',' || s[i] == '"')
			continue;
		else
			tm = tm + s[i];
	}
	vector<char *>nm;
	for (int i = 0; i < name.size(); i++)
	{
		char *tmp;
		int l = name[i].length();
		tmp = new char[l+1];
		for (int j = 0; j < l; j++)
			tmp[j] = name[i][j];
		tmp[l] = '\0';
		nm.push_back(tmp);
	}

	sort(nm);
	//cout << nm.size() << endl;
	//ofstream output;
	//output.open("result.txt");
	unsigned long long res = 0;
	for (int i = 0; i < nm.size(); i++)
	{
		int tmp = 0;
		for (int j = 0; j < strlen(nm[i]); j++)
		{
			if (nm[i][j] != '\0')
				tmp += nm[i][j] - 'A' + 1;
			//output << nm[i][j];
		}
		
		tmp *= (i + 1);
		//output<<" "<<tmp << endl;
		res += tmp;
	}
	//output.close();
	cout << res << endl;
	system("pause");
	return 0;
}


Project Euler:Problem 22 Names scores

原文:http://blog.csdn.net/youb11/article/details/46316425

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!