Cod sursa(job #586189)
| Utilizator | Data | 30 aprilie 2011 14:02:11 | |
|---|---|---|---|
| Problema | NumMst | Scor | 24 |
| Compilator | cpp | Status | done |
| Runda | Algoritmiada 2011, Runda Finală, Clasele 10-12 | Marime | 0.62 kb |
#include <algorithm>
#include <fstream>
using namespace std;
int N;
int main() {
ifstream fin( "nummst.in" );
ofstream fout( "nummst.out" );
int i, div, cnt;
fin >> N;
if( N % 2 == 0 ) {
fout << N / 2 << " " << N / 2;
}
else {
div = 1;
for( i = 2; i * i <= N; ++i )
if( N % i == 0 ) {
div = max( div, i );
div = max( div, N / i );
}
cnt = N / div;
fout << cnt / 2 * div << " " << (cnt / 2 + 1) * div;
}
fin.close();
fout.close();
return 0;
}
