A - A+...+B Problem N, A, B = list(map(int, input().split())) if N==1 and A != B: print(0) elif N==1 and A == B: print(1) elif A > B: print(0) else: num_min = (N-1)*A + B num_max = A + (N-1) * B print(num_max - num_min + 1)

B - RGB Boxes #include <bits/stdc++.h> #define rep(i,n) for(int i=0; i<(n); ++i) #define repx(i,x,n) for(int i=x; i<(n); ++i) #define fixed_setprecision(n) fixed << setprecision((n)) #define execution_time(ti) printf("Execution Time: %.4lf sec\n", 1.0 * </bits/stdc++.h>…

C - Write and Erase #include <bits/stdc++.h> #define rep(i,n) for(int i=0; i<(n); ++i) #define repx(i,x,n) for(int i=x; i<(n); ++i) #define fixed_setprecision(n) fixed << setprecision((n)) #define execution_time(ti) printf("Execution Time: %.4lf sec\n", </bits/stdc++.h>…

C - Sentou #include <bits/stdc++.h> #define rep(i,n) for(int i=0; i<(n); ++i) #define repx(i,x,n) for(int i=x; i<(n); ++i) #define fixed_setprecision(n) fixed << setprecision((n)) #define execution_time(ti) printf("Execution Time: %.4lf sec\n", 1.0 * (cl</bits/stdc++.h>…

問題 8：最長共通部分列 (LCS) 問題