1372B Omkar and Last Class of Math codeofrces solution in cpp
by ujjal roy
#include<bits/stdc++.h>
using namespace std;
main()
{
int t,i,c;
cin>>t;
while(t--)
{
long long int n,a,b,r=0;
cin>>n;
if(n%2==0)
{
cout<<n/2<<" "<<n/2<<endl;
}
else
{
for(i=2;i*i<=n;i++)
{
if(n%i==0)
{
a=n/i;
b=n-a;
r=1;
break;
}
}
if(r==0) cout<<"1 "<<n-1<<endl;
else cout<<a<<" "<<b<<endl;
}
}
return 0;
}
0 Comments