Cod sursa(job #1620116)
Utilizator | Data | 28 februarie 2016 20:44:55 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int prim(int n)
{
int d=2,nd=0;
while(d*d<=n)
{
if(n%d==0)nd++;
d++;
}
if(nd==0)return 1;
return 0;
}
int main()
{
int n,cnt=0;
in>>n;
in.close();
for(int i=2;i<=n;i++)
if(prim(i)==1)
cnt++;
out<<cnt;
out.close();
return 0;
}