Cod sursa(job #631575)
Utilizator | Stefan Lache StefanLache | Data | 8 noiembrie 2011 18:54:31 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int v[100],i,j,x,n,nr=0;
scanf("%d",&n);
for(i=1;i<=n-1;i++)
v[i]=i+1;
for(i=1;i<=n-1;i++)
if(v[i]!=0)
{
x=v[i];
for(j=i+x;j<=n-1;j+=x)
v[j]=0;
}
for(i=1;i<=n-1;i++)
if(v[i]!=0)
nr++;
printf("%d",nr);
return 0;
}