Cod sursa(job #1656767)
| Utilizator | Data | 19 martie 2016 19:26:52 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <stdio.h>
using namespace std;
int N, cnt;
char prim[2000005];
int main()
{
FILE *f =fopen("ciur.in","r");
FILE *f2=fopen("ciur.out","w");
fscanf(f,"%d",&N);
int i;
for (i=0;i<=N;i++)
prim[i]=1;
for (i=2;i<=N;i++)
{
if(prim[i]!=0)
{
cnt++;
int j;
for(j=2*i ;j<=N ;j+=i)
{
prim[j]=0;
}
}
}
fprintf(f2,"%d\n",cnt);
fclose(f);
fclose(f2);
}
