Cod sursa(job #836897)
Utilizator | Data | 16 decembrie 2012 21:17:23 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
ifstream f1("ciur.in");
ofstream f2("ciur.out");
long long int n,i,s=0,nrp=0,m,d;
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;
}