A. Maximum GCD
题意:
找到[1,n]中GCD最大的一对数的GCD
思路:
暴力秒A,直接输出N/2
代码附:
#pragma GCC optimize("Ofast","inline","-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2e5+10;
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int t,n;
cin>>t;
while(t--)
{
cin>>n;
cout<<n/2<<endl;
}
return 0;
}