Cod sursa(job #1832025)
Utilizator | Data | 19 decembrie 2016 12:13:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <stdio.h>
using namespace std;
int v[1002];
FILE *f,*g;
int main()
{ int n,i,s,p,t=0;;
f=fopen("ciur.in","r");
g=fopen("ciur.out","w");
fscanf(f,"%d",&n);
for(i=2;i<=n;i ++)
{
s=1;
p=2;
while(s<=n)
{
s=p*i;
v[s]=1;
p++;
}
}
for(i=2;i<=n;i++)
{
if(v[i]==0)
t++;
}
fprintf(g,"%d",t);
fclose(f);
fclose(g);
return 0;
}