Cod sursa(job #1317877)
Utilizator | Data | 15 ianuarie 2015 12:25:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include<fstream>
#define NMAX 2000005
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
char prim[NMAX];
int n;
int i,j,nr=0;
void ciur()
{
for(i=2;i<n;i++)
{
if(prim[i]==0)
{
nr++;
for(j=i;j<=n;j+=i)
prim[j]=1;
}
}
}
int main()
{
f>>n;
ciur();
g<<nr;
return 0;
}