1796.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 1796 on 2005-03-26 at 18:56:59 */ 
#include <stdio.h>

int main()
{
    int card[50], stack[50];
    int n, r, p, c;
    int i, j, top;
    
    while(scanf("%d %d", &n, &r) == 2){
        if((n == 0) && (r == 0)){
            return 0;
        }else{
            for(i = 0; i < n; i++){
                card[i] = n - i;
            }    
            top = 0;
            for(i = 0; i < r; i++){
                scanf("%d %d", &p, &c);
                for(j = 0; j < p-1; j++){
                    stack[top++] = card[j];
                }
                for(j = 0; j < c; j++){
                    card[j] = card[p-1+j];
                }
                for(j = 0; top > 0; j++){
                    card[c+p-2-j] = stack[--top];
                }
            }
            printf("%d\n", card[0]);
        }
    }
    
    return 0;
}