zoj 2164 Hanafuda Shuffle

#include <iostream>#include <cstdlib>using namespace std;int main(void){ int N,R; int p[53],c[53]; int i,j; int card[53],now[53]; while(cin >> N >> R && (N + R)) {  for(i = 1;i <= R;++i)   cin >> p[i] >> c[i];  for(i = 1; i<= N;++i)   card[i] = now[i] = N - i +  1;  for(i = 1; i<= R;++i)  {   if(c[i] < N)   {    for(j = 1;j < p[i];++j)     card[j + c[i]] = now[j];    for(j = p[i];j < p[i] + c[i];++j)     card[j - p[i] + 1] = now[j];      }   for( j = 1;j <= N;++j) now[j] = card[j];  }  cout << card[1] << endl;   } return 0;}