Cod sursa(job #586282)
Utilizator | Antohi Bogdan bog29 | Data | 30 aprilie 2011 14:21:43 |
---|---|---|---|
Problema | NumMst | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Algoritmiada 2011, Runda Finală, Clasele 10-12 | Marime | 0.41 kb |
#include<fstream>
#include<math.h>
using namespace std;
ifstream in("nummst.in");
ofstream out("nummst.out");
int n,m,d,ok,nr;
long long n1;
int main()
{
int i;
in>>n;
in.close();
m = sqrt((double)n);
ok = 0;
for(i=2; i<=m && !ok; i++)
if(n % i == 0)
{ nr = i;
ok = 1;
}
d = n/nr;
n1 = d*(nr-1);
out<<d<<" "<<n1;
out.close();
return 0;
}