Cod sursa(job #695478)
Utilizator | Data | 28 februarie 2012 12:37:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include<iostream>
#include<fstream>
using namespace std;
bool v[2000000];
int main()
{
ifstream g("ciur.in");
ofstream h("ciur.out");
int n,cont=1;
g>>n;
for(int i=3;i<=n;i+=2)
if(v[i]==0)
{
for(int j=3*i;j<=n;j+=2*i)
v[j]=1;
cont++;
}
h<<cont;
}