Cod sursa(job #1076895)
| Utilizator | Data | 10 ianuarie 2014 18:18:05 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
char prim[2000005];
int N,ct=0;
int ciur(int N)
{
int i,j;
scanf("%d",&N);
for(i=2; i<=N; i++)
{
prim[i]=1;
}
for(i=2; i<=N; i++)
{
if(prim[i])
{
ct++;
for(j=i+i; j<=N; j+=i)
{
prim[j]=0;
}
}
}
printf("%d\n",ct);
}
int main()
{
fin>>N;
ciur(N);
return 0;
}
