Cod sursa(job #1958550)
Utilizator | Data | 8 aprilie 2017 14:47:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.26 kb |
#include <fstream>
using namespace std;
int v[10000];
ifstream in("kdiv.in");
ofstream out("kdiv.out");
int main()
{int n,i,j,cnt=0;
in>>n;
for(i=2;i<=n;i++)
{if(v[i]==0)
{cnt++;
for(j=i*2;j<=n;j+=i)
v[j]=1;
}
}
out<<cnt;
return 0;
}