Cod sursa(job #1061700)
Utilizator | Data | 20 decembrie 2013 10:12:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
long long n, i, j, k;
char v[2000001];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f >> n;
for( i=2; i*i<=n; i++ )
if(v[i]!=1)
for( j = i * i; j <= n; j+=i )
v[j]=1;
for( i = 2; i < n; i++ )
if( v[i] == 0 )
k++;
g << k;
f.close();
g.close();
return 0;
}