题解 | 神奇苹果桶

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int operateCount = in.nextInt();
        int[] operateType = new int[operateCount];
        int[] counts = new int[operateCount];
        for(int i =0;i<operateCount;i++){
            operateType[i] = in.nextInt();
            counts[i] = in.nextInt();
        }

        int result = 0;
        for(int i =0;i<operateCount;i++){
            switch(operateType[i]){
                case 1:
                    result+=counts[i];
                    break;
                 case 2:
                   result-=(result>=counts[i]?counts[i]:0);
                    break;
                 case 3:
				//不能整除需要加1
                    int take =result%counts[i]==0?result/counts[i]:result/counts[i]+1;
                    result-=take;
                    break;
            }
            //   System.out.println(result);
        }
        System.out.println(result);
    }
}