Codeforces Round #651 (Div. 2)ABCD题解

A. Maximum GCD题目连接 除以2便可ios #include<iostream> using namespace std; int main() { int n; int t; scanf("%d",&t); while(t--){ cin>>n; cout<<n/2<<endl; } return 0; } B. GCD Compression题目连接 题解:咱们

>>阅读原文<<