낭만

#include using namespace std; pair p1,p2,p3; // point pair v1, v2; // vector int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> p1.first >> p1.second >> p2.first >> p2.second >> p3.first >> p3.second; v1.first = p2.first - p1.first; v1.second = p2.second - p1.second; v2.first = p3.first - p2.first; v2.second = p3.second - p2.second; // sin(theta) = |v1 x v2| / |v1||v2|, +면 -1, -면 1, 0이..

import sys T = int(input()) s = set() for _ in range(T): temp = sys.stdin.readline().strip().split() if len(temp) == 1: if temp[0] == "all": s = set([i for i in range(1, 21)]) else: s = set() else: action = temp[0] n = int(temp[1]) if action == 'add': s.add(int(n)) elif action == 'remove': s.discard(int(n)) elif action == 'check': if int(n) in s: print(1) else: print(0) elif action == 'toggle': ..

import sys if __name__ == '__main__': N = int(input()) arr = list(map(int, sys.stdin.readline().split())) ans = 0 min_lists = [] if N == 1: arr.sort() for i in range(5): ans += arr[i] else: min_lists.append(min(arr[0], arr[5])) min_lists.append(min(arr[1], arr[4])) min_lists.append(min(arr[2], arr[3])) min_lists.sort() min1 = min_lists[0] min2 = min_lists[1] min3 = min_lists[2] n1 = 4 * (N - 2) ..

import re import sys T = int(sys.stdin.readline()) results = [] for _ in range(T): sign = sys.stdin.readline().replace('\n', '') p = re.compile('(100+1+|01)+') m = p.fullmatch(sign) if m: results.append("YES") else: results.append("NO") for result in results: sys.stdout.write(str(result)+'\n')

import math import sys MIN, MAX = map(int, sys.stdin.readline().split()) answer = MAX-MIN+1 check = [False]*(MAX-MIN+1) i=2 while i*i