Cod sursa(job #847384)
| Utilizator | Data | 3 ianuarie 2013 20:12:13 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
#include <math.h>
#define maxN 2000001
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int ciur[maxN];
int main()
{
int n,i;
f>>n;
// for(i=2;i<=n;i++)
//g<<ciur[i];
// g<<endl;
int cont=0;
for(i=2;i<=n;i++)
{ if(ciur[i]==0){ cont++;
for(int j=i+i;j<=n;j+=i)
ciur[j]=1;
}}
g<<cont;
return 0;
}
