Cod sursa(job #2245239)
| Utilizator | Data | 24 septembrie 2018 21:18:48 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.74 kb |
/*#include<iostream>
#include<cmath>
using namespace std;
int ciur[1000001],nr,i,n,j,C,x;
int main()
{
nr=2000000;
ciur[0]=1;
ciur[1]=1;
for(i=2;i<=int(sqrt(nr));i++)
if(ciur[i]==0)
for(j=2;j<=nr/i;j++)
ciur[i*j]=1;
cin>>n;
for(i=2;i<=n;i++)
{
if(ciur[i]==0)
C++;
}
cout<<C;
return 0;
}*/
#include<iostream>
using namespace std;
int main()
{
int n=0,i=1,j=1,prim=0,c=0,contor=0;
cin>>n;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
if(i%j==0)
{
c++;
}
if(c==2)
{
contor++;
}
c=0;
}
cout<<contor;
}
