Cod sursa(job #1602775)
Utilizator | Data | 16 februarie 2016 22:02:58 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
#define size 2000001
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
int i,j,n,k=0;
char v[size];
f>>n;
for(i=2; i<n; i++)
v[i]=1;
for(i=2; i<n; i++)
if(v[i])
{
k++;
for(j=2*i; j<n; j=j+i)
v[j]=0;
}
g << k;
return 0;
}