Cod sursa(job #561167)
| Utilizator | Data | 18 martie 2011 22:45:25 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include<iostream>
#include<cstdio>
using namespace std;
int c[2000001];
/*void ciur(int n)
{
int i,j;
c[1]=true;
for(i=2;i*i<=n;i++)
{
if(!c[i])
for(j=i*i;j<=n;j+=i)
c[j]=true;
}
}*/
void ciur(int n)
{
int i,j;
for(i=2;i<=n;i++)
{
if(c[i]==0)
{
for(j=i;j<=n;j+=i)
c[j]++;
}
}
}
int main()
{
int n,i,s=0;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
cin>>n;
ciur(n);
for(i=1;i<=n;i++)
{
if(c[i]!=1)
s++;
}
cout<<s+1;
return 0;
}
