Cod sursa(job #480346)
Utilizator | Data | 27 august 2010 15:34:59 | |
---|---|---|---|
Problema | GFact | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.33 kb |
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<fstream>
#include<cmath>
using namespace std;
int is_prime(int N) {
for(int i = 2; i < sqrt(N); i++)
if(N % i == 0)
return 0;
return 1;
}
int P,Q;
int main() {
ifstream in("gfact.in");
ofstream out("gfact.out");
in >> P >> Q;
if(!is_prime(P))
for(;;);
}