Cod sursa(job #1954944)
Utilizator | Data | 5 aprilie 2017 19:00:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{int N,i,cnt=0,cnt1=0,d;
in>>N;
for(i=2;i<=N;i++)
{cnt1=0;
for(d=1;d<=i;d++)
{
if(i%d==0)
cnt1++;
}
if(cnt1==2)
cnt++;
}
out<<cnt;
return 0;
}