`
200830740306
  • 浏览: 105840 次
  • 性别: Icon_minigender_1
  • 来自: 广州
社区版块
存档分类
最新评论

poj1978

阅读更多
package easy;

import java.io.BufferedInputStream;
import java.util.LinkedList;
import java.util.Scanner;

/**
 *
 *poj1978
 *简单模拟
 * @author NC
 */
public class Poj1978 {

    public static void main(String[] args) {
        Scanner scan = new Scanner(new BufferedInputStream(System.in));
        while (scan.hasNext()) {
            int m = scan.nextInt();
            int n = scan.nextInt();
            if (m == 0 && n == 0) {
                break;
            }
            LinkedList<Integer> cards = new LinkedList<Integer>();
            for (int i = 1; i <= m; i++) {
                cards.addFirst(i);
            }
            for (int i = 0; i < n; i++) {
                int p = scan.nextInt();
                int c = scan.nextInt();
                LinkedList<Integer> lk = new LinkedList<Integer>();
                for (int j = 0; j < c; j++) {
                    int a = cards.remove(p - 1);
                    lk.addLast(a);
                }
                for (int j = 0; j < c; j++) {
                    int a = lk.removeLast();
                    cards.addFirst(a);
                }
            }
            System.out.println(cards.getFirst());
        }
    }
}


分享到:
评论

相关推荐

Global site tag (gtag.js) - Google Analytics