Cod sursa(job #1555399)
Utilizator | Data | 22 decembrie 2015 18:56:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
char v[2000001]={1,1};
int main()
{
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int i,j,n,cnt=0;
cin>>n;
for(i=2;i*i<=n;i++)
if(v[i]==0)
for(j=i;j*i<=n;j++)
v[i*j]=1;
for(i=1;i<=n;i++)
if(v[i]==0)
cnt++;
cout<<cnt;
return 0;
}