목록브루트 포스 (1)

넘치게 채우기

[Educatinal Codeforces Round 173(Div.2)] - D. Problem about GCD

https://codeforces.com/contest/2043/problem/DEducational Codeforces Round 173(Div.2) - D. Problem about GCD문제 유형: 수학, 브루트 포스, 그리디시간 제한: 1초메모리 제한: 256MB 문제Given three integers l">l, r">r, and G">G, find two integers A">A and B">B (l≤A≤B≤r">l≤A≤B≤r) such that their greatest common divisor (GCD) equals G">G and the distance |A−B|">|A−B| is maximized.If there are multiple..
PS/Codeforces 2025. 1. 3. 14:14
이전 Prev 1 Next 다음