Cod sursa(job #585856)
Utilizator | Data | 30 aprilie 2011 12:16:34 | |
---|---|---|---|
Problema | NumMst | Scor | 24 |
Compilator | cpp | Status | done |
Runda | Algoritmiada 2011, Runda Finală, Clasele 10-12 | Marime | 0.3 kb |
#include <cstdio>
int n, a, s;
int main() {
freopen("nummst.in", "r", stdin);
freopen("nummst.out", "w", stdout);
int i, a;
scanf("%d\n", &n);
for(a = n / 2; a >= 2; --a)
if(n % a == 0)
break;
n /= a;
// printf("%d\n", n);
printf("%d %d\n", ((n + 1) / 2) * a, (n / 2) * a);
return 0;
}