Cod sursa(job #1468973)
Utilizator | Data | 7 august 2015 13:43:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
char c[2000001];
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 (c[i] == 0)
{
for (j = i*i; j <= n; j += i)
{
c[j] = 1;
}
}
}
for(i=2;i<n;i++)
{
if(c[i]==0)
cnt++;
}
cout<<cnt;
return 0;
}