Cod sursa(job #1685734)
Utilizator | Data | 11 aprilie 2016 20:27:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
#define MAXN 2000005
int N;
char V[MAXN];
int main()
{
int i,ok=0;
f>>N;
for(i=2; i<=N; i++)
{
if(V[i]==1)
{
continue;
}
for(int j=i*2; j<=N; j=j+i)
{
V[j]=1;
}
ok++;
}
g<<ok;
}