Cod sursa(job #588142)
| Utilizator | Data | 7 mai 2011 00:44:07 | |
|---|---|---|---|
| Problema | NumMst | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.43 kb |
#include<fstream>
#include<cmath>
using namespace std;
ifstream f("nummst.in");
ofstream g("nummst.out");
int ok2;
int prim(int nr)
{int ok2;
ok2=1;
for(int k=2;k<=sqrt(nr);k++)
if(nr%k==0)
ok2=0;
return ok2;
}
int main()
{int n,i,j,ok=0;
f>>n;
if(prim(n)) {g<<(n-1)/2<<" "<<n-(n-1)/2;}
else{i=2;
while(!ok)
{
if(n%i==0)
{for(j=1;j<=i;j++)
g<<n/i<<" "; ok=1;}
i++;
}
}
return 0;
}
