Cod sursa(job #1566542)
Utilizator | Data | 12 ianuarie 2016 11:44:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <cstdio>
#include <climits>
#include <iostream>
using namespace std;
int n, nr;
char ciur[2000000];
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
for(int i=2; i<=n; i++)
{
if(ciur[i]==0) {
nr++;
for(int j=i; j<=n; j+=i)
ciur[j]=1;
}
}
printf("%d", nr);
return 0;
}