Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises) ABC

退役老年人的血崩CF。。。c++ A 水题less #include<bits/stdc++.h> using namespace std; int n; int main() { scanf("%d",&n); int x=n/2; while(1) { if(__gcd(x,n-x)==1) break;
相关文章
相关标签/搜索