A.挑战密室

Description

R组织的特工Dr. Kong 为了寻找丢失的超体元素，不幸陷入WTO密室。Dr. Kong必须尽快找到解锁密码逃离，否则几分钟之后，WTO密室即将爆炸。

 

Dr. Kong发现密室的墙上写了许多化学方程式中。化学方程式，也称为化学反应方程式，是用化学式表示物质化学反应的式子。化学方程式反映的是客观事实。因此书写化学方程式要遵守两个原则：一是必须以客观事实为基础；二是要遵守质量守恒定律。

化学方程式不仅表明了反应物、生成物和反应条件。同时，化学计量数代表了各反应物、生成物物质的量关系，通过相对分子质量或相对原子质量还可以表示各物质之间的质量关系，即各物质之间的质量比。对于气体反应物、生成物，还可以直接通过化学计量数得出体积比。例如：2NaOH+H₂SO₄=Na₂SO₄+2H₂O

 

经过多次试探、推理，Dr. Kong发现密码是4位数字，就隐藏在化学方程式等号后的第一个分子中，其分子量就可能是密码（若分子量不足4位，前面加0）。

好在Dr. Kong还记得墙上各化学方程式用到的化学元素的原子量如下：

 

N	C	O	Cl	S	H	Al	Ca	Zn	Na
14	12	16	35	32	2	27	40	65	23

 

你能帮Dr. Kong尽快找到密码吗？

Input

第一行： K    表示有K个化学方程式；

接下来有K行，每行为一个化学方程式

2≤K≤8  ，化学方程式的长度不超过50, 所有原子,分子的数量不超过9.小括号最多一层.

Output

对于每个化学方程式输出一行：即密码。

Sample Input

32C+O2=2CO2NaOH+H2SO4=Na2SO4+2H2OCa2CO3+H2O=Ca2(OH)2+CO2

Sample Output

005601420116

做的也是够够的，之前比赛的时候已经做出来，现在再回想时候，再做一遍，刚开始就没仔细看题直接就开始打。打了一会就是不对，仔细一看题目，原来是记错了，然后就重新打，题不是太难但是就是必须思路很清晰，我的代码虽然不是最简洁的但是我自己感觉理解着还是比较容易的。看来以后还得继续努力才行。

源代码：

#include<stdio.h>
#include<string.h>
int main()
{
	char s[1000];
	int T,n,i,j,y;
	scanf("%d",&T);
	getchar();
	while(T--)
	{
		int sum=0;
		gets(s);
		n=strlen(s);
		int e=0,ss=1;
		for(i=0;i<n;i++)
		{
			
			if(s[i]=='=')
			{
				e=i;
				ss=i;
			}
			if(e==ss&&s[i]=='+')
			{
				n=i;
				break;
			}
		}
		int x=0;
		for(i=e;i<n;i++)
		{
			int sum1=0,sum2=0;
			if(s[i]=='+')
				x=0;
			if((s[i]>='0'&&s[i]<='9')||x==1)
			{
				if(x==0)
				y=i;
				x=1;
				if(s[i]=='(')
				{
				for(j=i;j!=')';j++)
				{
					if(s[j]=='N'&&s[j+1]=='a'&&s[j+2]>='0'&&s[j+2]<='9')
					{sum1=sum1+23*(s[j+2]-'0');j=j+2;continue;}
					else if(s[j]=='N'&&s[j+1]=='a')
					{sum1=sum1+23;j=j+1;continue;}
					
					if(s[j]=='O'&&s[j+1]>='0'&&s[j+1]<='9')
					{sum1=sum1+16*(s[j+1]-'0');j=j+1;continue;}
					else if(s[j]=='O')
					{sum1=sum1+16;continue;}
					if(s[j]=='C'&&s[j+1]=='l'&&s[j+2]>='0'&&s[j+2]<='9')
					{sum1=sum1+35*(s[j+2]-'0');j=j+2;continue;}
					else if(s[j]=='C'&&s[j+1]=='l')
					{sum1=sum1+35;j=j+1;continue;}
					if(s[j]=='A'&&s[j+1]=='l'&&s[j+2]>='0'&&s[j+2]<='9')
					{sum1=sum1+27*(s[j+2]-'0');j=j+2;continue;}
					else if(s[j]=='A'&&s[j+1]=='l')
					{sum1=sum1+27;j=j+1;continue;}
					if(s[j]=='C'&&s[j+1]=='a'&&s[j+2]>='0'&&s[j+2]<='9')
					{sum1=sum1+40*(s[j+2]-'0');j=j+2;continue;}
					else if(s[j]=='C'&&s[j+1]=='a')
					{sum1=sum1+40;j=j+1;continue;}
					if(s[j]=='Z'&&s[j+1]=='n'&&s[j+2]>='0'&&s[j+2]<='9')
					{sum1=sum1+65*(s[j+2]-'0');j=j+2;continue;}
					else if(s[j]=='Z'&&s[j+1]=='n')
					{sum1=sum1+65;j=j+1;continue;}
					if(s[j]=='S'&&s[j+1]>='0'&&s[j+1]<='9')
					{sum1=sum1+32*(s[j+1]-'0');j=j+1;continue;}
					else if(s[j]=='S')
					{sum1=sum1+32;continue;}
					if(s[j]=='H'&&s[j+1]>='0'&&s[j+1]<='9')
					{sum=sum+2*(s[j+1]-'0');j=j+1;continue;}
					else if(s[j]=='H')
					{sum1=sum1+2;continue;}
					if(s[j]=='N'&&s[j+1]>='0'&&s[j+1]<='9')
					{sum=sum+14*(s[j+1]-'0');j=j+1;continue;}
					else if(s[j]=='N')
					{sum1=sum1+14;continue;}
					if(s[j]=='C'&&s[j+1]>='0'&&s[j+1]<='9')
					{sum1=sum1+12*(s[j+1]-'0');j=j+1;continue;}
					else if(s[j]=='C')
					{sum1=sum1+12;continue;}
				}
				i=j;
				}
			if(s[i]==')')
			{
				if(s[i+1]>='0'&&s[i+1]<='9')
				{
					sum=sum+(s[y]-'0')*sum1*(s[i]-'0');
				}
				else
				{
					sum=sum+sum1*(s[y]-'0');
				}
			}
			if(s[i]=='N'&&s[i+1]=='a'&&s[i+2]>='0'&&s[i+2]<='9')
			{sum=sum+23*(s[i+2]-'0')*(s[y]-'0');i=i+2;continue;}
			else if(s[i]=='N'&&s[i+1]=='a')
			{sum=sum+23*(s[y]-'0');i++;continue;}
			
			if(s[i]=='O'&&s[i+1]>='0'&&s[i+1]<='9')
			{sum=sum+16*(s[i+1]-'0')*(s[y]-'0');i=i+1;continue;}
			else if(s[i]=='O')
			{sum=sum+16*(s[y]-'0'); continue;}
			if(s[i]=='C'&&s[i+1]=='l'&&s[i+2]>='0'&&s[i+2]<='9')
			{sum=sum+35*(s[i+2]-'0')*(s[y]-'0');i=i+2;continue;}
			else if(s[i]=='C'&&s[i+1]=='l')
			{sum=sum+35;i=i+1*(s[y]-'0');continue;}
			if(s[i]=='A'&&s[i+1]=='l'&&s[i+2]>='0'&&s[i+2]<='9')
			{sum=sum+27*(s[i+2]-'0')*(s[y]-'0');i=i+2;continue;}
			else if(s[i]=='A'&&s[i+1]=='l')
			{sum=sum+27;i=i+1*(s[y]-'0');continue;}
			if(s[i]=='C'&&s[i+1]=='a'&&s[i+2]>='0'&&s[i+2]<='9')
			{sum=sum+40*(s[i+2]-'0')*(s[y]-'0');i=i+2;continue;}
			else if(s[i]=='C'&&s[i+1]=='a')
			{sum=sum+40;i=i+1*(s[y]-'0');continue;}
			if(s[i]=='Z'&&s[i+1]=='n'&&s[i+2]>='0'&&s[i+2]<='9')
			{sum=sum+65*(s[i+2]-'0')*(s[y]-'0');i=i+2;continue;}
			else if(s[i]=='Z'&&s[i+1]=='n')
			{sum=sum+65;i=i+1*(s[y]-'0');continue;}
			if(s[i]=='S'&&s[i+1]>='0'&&s[i+1]<='9')
			{sum=sum+32*(s[i+1]-'0')*(s[y]-'0');i=i+1;continue;}
			else if(s[i]=='S')
			{sum=sum+32*(s[y]-'0');continue; }
			if(s[i]=='H'&&s[i+1]>='0'&&s[i+1]<='9')
			{sum=sum+2*(s[i+1]-'0')*(s[y]-'0');i=i+1;continue;}
			else if(s[i]=='H')
			{sum=sum+2*(s[y]-'0');continue; }
			if(s[i]=='N'&&s[i+1]>='0'&&s[i+1]<='9')
			{sum=sum+14*(s[i+1]-'0')*(s[y]-'0');i=i+1;continue;}
			else if(s[i]=='N')
			{sum=sum+14*(s[y]-'0');continue; }
			if(s[i]=='C'&&s[i+1]>='0'&&s[i+1]<='9')
			{sum=sum+12*(s[i+1]-'0')*(s[y]-'0');i=i+1;continue;}
			else if(s[i]=='C')
			{sum=sum+12*(s[y]-'0');continue;}
			}
			else
			{


			if(s[i]=='(')
			{
				for(j=i+1;s[j]!=')';j++)
				{
					if(s[j]=='C'&&s[j+1]=='a'&&s[j+2]>='0'&&s[j+2]<='9')
					{sum1=sum1+40*(s[j+2]-'0');j=j+2;continue;}
					else if(s[j]=='C'&&s[j+1]=='a')
					{sum1=sum1+40;j=j+1;continue;}
					if(s[j]=='N'&&s[j+1]=='a'&&s[j+2]>='0'&&s[j+2]<='9')
					{sum1=sum1+23*(s[j+2]-'0');j=j+2;continue;}
					else if(s[j]=='N'&&s[j+1]=='a')
					{sum1=sum1+23;j=j+1;continue;}
				
					if(s[j]=='O'&&s[j+1]>='0'&&s[j+1]<='9')
					{sum1=sum1+16*(s[j+1]-'0');j=j+1;continue;}
					else if(s[j]=='O')
					{sum1=sum1+16;continue;}
					if(s[j]=='C'&&s[j+1]=='l'&&s[j+2]>='0'&&s[j+2]<='9')
					{sum1=sum1+35*(s[j+2]-'0');j=j+2;continue;}
					else if(s[j]=='C'&&s[j+1]=='l')
					{sum1=sum1+35;j=j+1;continue;}
					if(s[j]=='A'&&s[j+1]=='l'&&s[j+2]>='0'&&s[j+2]<='9')
					{sum1=sum1+27*(s[j+2]-'0');j=j+2;continue;}
					else if(s[j]=='A'&&s[j+1]=='l')
					{sum1=sum1+27;j=j+1;continue;}
					
					if(s[j]=='Z'&&s[j+1]=='n'&&s[j+2]>='0'&&s[j+2]<='9')
					{sum1=sum1+65*(s[j+2]-'0');j=j+2;continue;}
					else if(s[j]=='Z'&&s[j+1]=='n')
					{sum1=sum1+65;j=j+1;continue;}
					if(s[j]=='S'&&s[j+1]>='0'&&s[j+1]<='9')
					{sum1=sum1+32*(s[j+1]-'0');j=j+1;continue;}
					else if(s[j]=='S')
					{sum1=sum1+32;continue;}
					if(s[j]=='H'&&s[j+1]>='0'&&s[j+1]<='9')
					{sum=sum+2*(s[j+1]-'0');j=j+1;continue;}
					else if(s[j]=='H')
					{sum1=sum1+2;continue;}
					if(s[j]=='N'&&s[j+1]>='0'&&s[j+1]<='9')
					{sum=sum+14*(s[j+1]-'0');j=j+1;continue;}
					else if(s[j]=='N')
					{sum1=sum1+14;continue;}
					if(s[j]=='C'&&s[j+1]>='0'&&s[j+1]<='9')
					{sum1=sum1+12*(s[j+1]-'0');j=j+1;continue;}
					else if(s[j]=='C')
					{sum1=sum1+12;continue;}
				}
				i=j;
			}
			if(s[i]==')')
			{
				if(s[i+1]>='0'&&s[i+1]<='9')
				{
					sum=sum+sum1*(s[i+1]-'0');
				}
				else
				{
					sum=sum+sum1;
				}
			}
			if(s[i]=='C'&&s[i+1]=='a'&&s[i+2]>='0'&&s[i+2]<='9')
			{sum=sum+40*(s[i+2]-'0');i=i+2;continue;}
			else if(s[i]=='C'&&s[i+1]=='a')
			{sum=sum+40;i=i+1;continue;}
			if(s[i]=='N'&&s[i+1]=='a'&&s[i+2]>='0'&&s[i+2]<='9')
			{sum=sum+23*(s[i+2]-'0');i=i+2;continue;}
			else if(s[i]=='N'&&s[i+1]=='a')
			{sum=sum+23;i=i+1;continue;}
			
			if(s[i]=='O'&&s[i+1]>='0'&&s[i+1]<='9')
			{sum=sum+16*(s[i+1]-'0');i=i+1;continue;}
			else if(s[i]=='O')
			{sum=sum+16; continue;}
			if(s[i]=='C'&&s[i+1]=='l'&&s[i+2]>='0'&&s[i+2]<='9')
			{sum=sum+35*(s[i+2]-'0');i=i+2;continue;}
			else if(s[i]=='C'&&s[i+1]=='l')
			{sum=sum+35;i=i+1;continue;}
			if(s[i]=='A'&&s[i+1]=='l'&&s[i+2]>='0'&&s[i+2]<='9')
			{sum=sum+27*(s[i+2]-'0');i=i+2;continue;}
			else if(s[i]=='A'&&s[i+1]=='l')
			{sum=sum+27;i=i+1;continue;}
			
			if(s[i]=='Z'&&s[i+1]=='n'&&s[i+2]>='0'&&s[i+2]<='9')
			{sum=sum+65*(s[i+2]-'0');i=i+2;continue;}
			else if(s[i]=='Z'&&s[i+1]=='n')
			{sum=sum+65;i=i+1;continue;}
			if(s[i]=='S'&&s[i+1]>='0'&&s[i+1]<='9')
			{sum=sum+32*(s[i+1]-'0');i=i+1;continue;}
			else if(s[i]=='S')
			{sum=sum+32;continue; }
			if(s[i]=='H'&&s[i+1]>='0'&&s[i+1]<='9')
			{sum=sum+2*(s[i+1]-'0');i=i+1;continue;}
			else if(s[i]=='H')
			{sum=sum+2;continue; }
			if(s[i]=='N'&&s[i+1]>='0'&&s[i+1]<='9')
			{sum=sum+14*(s[i+1]-'0');i=i+1;continue;}
			else if(s[i]=='N')
			{sum=sum+14;continue; }
			if(s[i]=='C'&&s[i+1]>='0'&&s[i+1]<='9')
			{sum=sum+12*(s[i+1]-'0');i=i+1;continue;}
			else if(s[i]=='C')
			{sum=sum+12;continue;}
			}
		}
		printf("%04d\n",sum);
	}
	return 0;
}

代码好长，下次得尽量缩减。继续努力！