NOIP2016_day1_No1玩具谜题

 #include <iostream>
 #include <cstdio>
 using namespace std;
 int main ()
 {
     freopen("toy.in","r",stdin);
     freopen("toy.out","w",stdout);
     int n,m,i=,ans=,command_1,command_2;
     scanf("%d%d",&n,&m);
     int pan[n];
     char job[n][];
     while(i<n)
     {
         scanf("%d%s",&pan[i],job[i]);
         i++;
     }
     i=;
     while(i<m)
     {
         scanf("%d%d",&command_1,&command_2);
         command_2=command_2%n;
         if(pan[ans]==command_1) //顺时针走
         {
             ans-=command_2;
             if(ans<=)
                 ans+=n;
         }
         else  //逆时针针走
         {
             ans+=command_2;
             if(ans>=n)
                 ans-=n;
         }
         i++;
     }
     printf("%s",job[ans]);
 }

题还是比较简单的，就不写解析了，在博客园这种地方也不敢装什么dalao

附题目链接

http://wenku.baidu.com/view/c58b2ffc9f3143323968011ca300a6c30d22f155.html?re=view