Cod sursa(job #1727958)
| Utilizator | Data | 11 iulie 2016 22:32:23 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <cstdio>
using namespace std;
int main()
{ int n;
FILE *f=fopen("ciur.in","r"),*g=fopen("ciur.out","w");
fscanf(f,"%d",&n);
int v[99999];
for(int i=1;i<=n;i++)
{
v[i]=i;
}
for(int i=4;i<=n;i=i+2)
{
v[i]=0;
}
for(int i=6;i<=n;i=i+3)
{
v[i]=0;
}
for(int i=10;i<=n;i=i+5)
{
v[i]=0;
}
int x=0;
for(int i=2;i<=n;i++)
{
if(v[i]>0) x++;
}
fprintf(g,"%d",x);
return 0;
}
