Cod sursa(job #1627010)
Utilizator | Data | 3 martie 2016 13:33:20 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <stdio.h>
#include <stack>
using namespace std;
int n;
bool not_prime[2000001];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
int c=0;
for(int i=2;i<n;i++)
{
if(!not_prime[i])
{c++;
for(int j=i;j<n;j+=i)
not_prime[j]=true;
}
}
printf("%d",c);
}