Cod sursa(job #1324563)
Utilizator | Data | 22 ianuarie 2015 15:51:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<iostream>
#include<cstdio>
using namespace std;
int c[1001];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n,i,j,nr=0;
cin>>n;
for(i=2;i<=n;i++)
c[i]=1;
for(i=2;i<=n;i++)
{
if(c[i]!=0)
{
nr++;
for(j=i*i;j<=n;j+=i)
{
c[j]=0;
}
}
}
cout<<nr;
}