#include #define rep(i,n) for(int i=0;i> M; for (int i=2; i<=1000001; i++) is_prime[i] = true; for (int i=2; i<=1000001; i++) { if (is_prime[i]) { if (M % i == 0) { cout << i << " " << M / i << endl; return 0; } for (int j=i*2; j<=1000001; j+=i) { is_prime[j] = false; } } } cout << 1 << " " << M << endl; }