Cod sursa(job #897385)
Utilizator | Data | 27 februarie 2013 20:19:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
long long n, i, j, cnt=0;
double a[2000000];
int main()
{
ifstream cin("ciur.in");
ofstream cout("ciur.out");
cin>>n;
for(i=2; i<=n; i++)
{
if(a[i]==0)
{
cnt++;
}
for(j=i+i; j<=n; j=j+i)
a[j]=1;
}
cout<<cnt;
cin.close();
cout.close();
return 0;
}