2577.txt

来自「北大ACM题目例程 详细的解答过程 程序实现 算法分析」· 文本 代码 · 共 42 行

Problem Id:2577  User Id:fzk 
Memory:28K  Time:15MS
Language:C++  Result:Accepted

Source 

#include"iostream.h"
int main()
{int m[1000];int r[10],i,time,d,s,h;
for(i=0;i<=999;i++)m[i]=0;
for(i=0;i<10;i++)r[i]=0;
i=0;
char a;
while(1)
{cin>>a;if(a=='0')cin>>a;if(a!='0')cin.putback(a); cin>>m[i];
if(cin.fail())break;
//if(m[i]==0)break;
i++;
}


i=0;time=0;
while(m[i]/100!=1)
{h=m[i]/100;s=m[i]%10;d=(m[i]%100)/10;
if(h==2)r[d]=s;
else if(h==3){r[d]+=s;r[d]%=1000;}
else if(h==4){r[d]*=s;r[d]%=1000;}
else if(h==5){r[d]=r[s];}
else if(h==6){r[d]+=r[s];r[d]%=1000;}
else if(h==7){r[d]*=r[s];r[d]%=1000;}
else if(h==8){r[d]=m[r[s]];}
else if(h==9){m[r[s]]=r[d];}
else if(h==0){if(r[s]!=0)i=r[d];else i++;}
time++;if(h)i++;
}
time++;
cout<<time<<endl;

return 1;
}