Cod sursa(job #882771)
Utilizator | Data | 19 februarie 2013 14:33:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int n, i, j, ct=0;
bool ciur[2000005];
int main()
{
cin>>n;
for(i=2;i<=n;i++)
if(ciur[i]==0)
{
ct++;
for(j=i+i;j<=n;j+=i)
ciur[j]=1;
}
cout<<ct;
cin.close();
cout.close();
return 0;
}