Codeforces 1370A. Maximum GCD Solution

Solution in C++:
///**********ALLAH IS ALMIGHTY************///
///AH Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh

1. #include<bits/stdc++.h>
2. using namespace std;
3. int main()
4. {
5. int t,n;
6. cin>>t;
7. while(t--)
8. {
9. cin>>n;
10. cout<<n/2<<endl;
11. }
12. }