Cod sursa(job #831564)
Utilizator | Data | 8 decembrie 2012 19:11:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include<iostream.h>
#include<fstream.h>
int main(){
int N,i,m,d,s=0,nrp;
ifstream f1("ciur.in");
ofstream f2("ciur.out");
f1>>N;
for(i=2;i<=N;i++){
for(m=1;m<=i;m++){
d=i%m;
if(d==0)
s++;
}
if(s==2)
nrp++;
s=0;}
nrp++;
f2<<nrp;}