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