Codeforces 1372B. Omkar and Last Class of Math Solution

  Solution in C++:

 ///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  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,i,f;
6. cin>>t;
7. while(t--)
8. {
9. f=0;
10. cin>>n;
11. if(n%2)
12. {
13. for(i=2; i*i<=n; i++)
14. {
15. if(n%i==0)
16. {
17. cout<<n/i<<" "<<n-(n/i)<<endl;
18. f=1;
19. break;
20. }
21. }
22. if(f==0)
23. cout<<"1 "<<n-1<<endl;
24. }
25. else
26. cout<<n/2<<" "<<n/2<<endl;
27. }
28. }