NOIP2016_day1_No1玩具谜题
1 #include <iostream> 2 #include <cstdio> 3 using namespace std; 4 int main () 5 { 6 freopen("toy.in","r",stdin); 7 freopen("toy.out","w",stdout); 8 int n,m,i=0,ans=0,command_1,command_2; 9 scanf("%d%d",&n,&m); 10 int pan[n]; 11 char job[n][15]; 12 while(i<n) 13 { 14 scanf("%d%s",&pan[i],job[i]); 15 i++; 16 } 17 i=0; 18 while(i<m) 19 { 20 scanf("%d%d",&command_1,&command_2); 21 command_2=command_2%n; 22 if(pan[ans]==command_1) //顺时针走 23 { 24 ans-=command_2; 25 if(ans<=0) 26 ans+=n; 27 } 28 else //逆时针针走 29 { 30 ans+=command_2; 31 if(ans>=n) 32 ans-=n; 33 } 34 i++; 35 } 36 printf("%s",job[ans]); 37 }
题还是比较简单的,就不写解析了,在博客园这种地方也不敢装什么dalao
附题目链接
http://wenku.baidu.com/view/c58b2ffc9f3143323968011ca300a6c30d22f155.html?re=view