SSENI's

https://www.acmicpc.net/problem/2407 2407번: 조합 n과 m이 주어진다. (5 ≤ n ≤ 100, 5 ≤ m ≤ 100, m ≤ n) www.acmicpc.net 코드 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.math.BigInteger; import java.util.StringTokenizer; // 처음에 long 으로 해서 틀렸다. 틀린 케이스가 있겠다 싶어 // 100 50 을 조합 계산기로 돌린 값이랑 계산해보니 틀리더라. // long 보다 더 큰 자료형을 생각했다. BigInteger 는 알았는데 계산 방식은 찾아..

L = int(input()) L_list = [0] + sorted(list(map(int,input().split()))) N = int(input()) start = 0 if N in L_list: print(0) else: for i in L_list: if N > i: start = i + 1 else: end = i - 1 break print(end - start + (end - N) * (N - start))

#include #include using namespace std; int m, n, x, y; int g(int a, int b) { if (a % b == 0) return b; else return g(b, a % b); } int l(int a, int b) { return (a * b) / g(a, b); } int main() { ios_base::sync_with_stdio(0); cin.tie(0), cout.tie(0); int t; cin >> t; for (int i = 0; i > m >> n >> x >> y; int maxY = l(m, n); while (1) { if (x > maxY || (x - 1) % n + 1 == y) break; x..

#include #include using namespace std; int n = 0; int m = 0; string nums = ""; string s; int main() { ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0); cin >> s; for (int i = 0; i

#include using namespace std; int n; int cnt; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n; while (n >= 5) { cnt += n / 5; n /= 5; } cout > n; cout

#include using namespace std; int t, n; long long dp[101] = { 0 }; int main() { cin >> t; dp[1] = 1; dp[2] = 1; dp[3] = 1; for (int i = 4; i > n; cout

N = int(input()) f = 1 for i in range(1, N+1): f *= i f %= 1000000000000 while f % 10 == 0: f /= 10 print(int(f % 10))

def f(floor, num): flr = [i for i in range(1, num+1)] for i in range(floor): for j in range(1, num): flr[j] += flr[j-1] return flr[-1] t = int(input()) for _ in range(t): floor = int(input()) num = int(input()) print(f(floor, num))

import sys def prime(num): if num == 1: return False elif num == 2: return True for i in range(2, int(num**0.5)+1): if num % i == 0: return False return True m, n = map(int, sys.stdin.readline().split()) s = '' for i in range(m, n+1): if prime(i): s += (str(i) + '\n') print(s)

n = int(input()) arr = list(map(int, input().split())) def prime(num): if num == 1: return False elif num == 2: return True for i in range(2, num): if num % i == 0: return False return True cnt = 0 for a in arr: if prime(a): cnt += 1 print(cnt)

r,c,w = map(int, input().split()) dp = [[0 for col in range(50)] for row in range(50)] dp[1][1] = 1 for i in range(0,31): for j in range(0,i+1): if j==1 | j==i: dp[i][j] = 1 else: dp[i][j] = dp[i-1][j-1]+dp[i-1][j] ans = 0 for i in range(w): for j in range(i+1): ans += dp[r+i][c+j] print(ans)

from math import gcd def lcm(x, y): return x * y // gcd(x, y) n, m = map(int, input().split()) print(gcd(n, m)) print(lcm(n, m))

from math import factorial n, m = map(int, input().split()) print(factorial(n) // (factorial(n-m) * factorial(m)))

arr = [int(input()) % 42 for _ in range(10)] n = [] for i in range(len(arr)): if arr[i] not in n: n.append(arr[i]) print(len(n))

arr = list(map(int, input().split())) add = [pow(i,2) for i in arr] print(sum(add) % 10)

n = int(input()) L = [1] L += list(map(int, input().split())) L.sort() if (len(L)+1)%2 == 0: idx = (len(L)+1)//2 print(L[idx - 1] * L[idx]) else: idx = (len(L)+1)//2 + 1 print(L[idx - 1] * L[idx - 1])

import math t=int(input()) arr=[] for i in range(t): n,m=input().split() n,m=int(n),int(m) answer=math.factorial(m)//math.factorial(n)//math.factorial(m-n) print(answer)

import sys data_cnt = int(sys.stdin.readline()) for _ in range(data_cnt): a, b = map(int, sys.stdin.readline().split()) result = [(a ** i) % 10 for i in range(1,5)][(b % 4) -1] print(result if result != 0 else 10)

n = int(input()) m = int(input()) m1 = m // 100 m2 = (m // 10) % 10 m3 = m % 10 print(n * m3, n * m2, n * m1, (n * m3) + (n * m2 * 10) + (n * m1 * 100))

a,b,c = map(int, input().split()) x = int(input()) a += (x // 60) // 60 b += (x // 60) % 60 c += x % 60 if c >= 60: c %= 60 b += 1 if b >= 60: b %= 60 a += 1 if a >= 24: a %= 24 print(a,b,c)