SSENI's

#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..

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))

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)

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))

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])