洛谷 P1603 斯诺登的密码

最新推荐文章于 2024-07-04 09:05:33 发布

Zeolim

最新推荐文章于 2024-07-04 09:05:33 发布

阅读量511

点赞数

分类专栏：题目文章标签：洛谷 P1603 斯诺登的密码洛谷 P1603 斯诺登的密码

本文链接：https://blog.csdn.net/Zeolim/article/details/80948923

版权

题目专栏收录该内容

18 篇文章 0 订阅

订阅专栏

本文介绍了一种通过字符串转换为数值、排序及全排列来找出最小组合值的算法实现过程。该算法首先将输入的字符串根据预设的映射表转化为数值，并计算其平方后取模，接着对转化后的数值进行排序，再通过全排列找出所有可能的组合，最后通过比较输出最小值。

摘要由CSDN通过智能技术生成

1.打表

2.搜索并转换

3.排序

4.全排列所有组合

5.比较出最小值

6.输出

#include <iostream>
#include <algorithm>
using namespace std;

int trans(string s)
{
	long long ret = 0;
	
	for(int i = s.length(), ps = 10; i >= 0; i--, ps *= 10)
	{
		ret += ( (s[i] - '0') * ps ) / 10;
	}
	ret *= ret;
	ret %= 100;
	return ret;
}

int main()
{
	string rstr[22] = {"","one","two","three","four","five","six","seven","eight","nine","ten","eleven","twelve","thirteen","fourteen","fifteen","sixteen","seventeen","eighteen","nineteen","twenty"};
	string ustr[4] ={"","a","both","another"};
	string tstr[4] = {"","first","second","third"};
	string txt;
	
	int narr[10] = {0};
	int flag = 0;
	int tf = 0;
	
	while(cin>>txt && txt != ".")
	{
		if(txt != "0")
		{
			for(int i = 0; i < 22; i++)
			{
				if(rstr[i] == txt)
				{
					narr[tf++] = (i * i) % 100;
					goto quit;
				}
			}
			for(int i = 0; i < 4; i++)
			{
				if(ustr[i] == txt)
				{
					narr[tf++] = (i * i) % 100;
					goto quit;
				}
			}
			for(int i = 0; i < 4; i++)
			{
				if(tstr[i] == txt)
				{
					narr[tf++] = (i * i) % 100;
					goto quit;
				}
			}
		}
		quit:;
	}
	
	sort(narr, narr + tf);
	
	
	/*for(int i = 0; i < tf; i++)
		cout<<narr[i]<<' ';*/
		
	long long ans = 9999999999999;
	
	do
	{
		long long tans = 0;
		long long ps = 10;
		for(int i = 0; i < tf; i++)
		{
			int tmp = narr[i];
			tans += ( (tmp % 10) * ps ) / 10;
			ps *= 10;
			tans += ( ( (tmp / 10) % 10) * ps ) / 10;
			ps *= 10;
			//cout<<tans<<endl;
		}
		ans = min(ans, tans);
	}while(next_permutation(narr, narr + tf));
	
	cout<<ans<<endl;
	return 0;
}