Cod sursa(job #1121936)
Utilizator | Data | 25 februarie 2014 14:54:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
long long n;
char x[2000002];
int main()
{ in>>n;
long long i,j,k=0;
for(i=2;i<=n;i++)
{if(x[i]==0){k++;
for(j=i*i;j<=n;j=j+i)
x[j]=1;}}
out<<k;
return 0;
}