Pagini recente » Cod sursa (job #1690027) | Cod sursa (job #2237711) | Cod sursa (job #1935142) | Cod sursa (job #2333183) | Cod sursa (job #2088434)
#include <iostream>
#include <fstream>
using namespace std;
int x[2000001],n,j,s;
//1 = nu e prim
//0 = e prim
int main()
{
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
fin>>n;
x[1]=1;
for(int i=4;i<=n;i+=2){
x[i] = 1;
}
for(int i=3;i<=n;i++){
if(x[i]==0){
j=i+i;
while(j<=n){
x[j]=1;
j+=i;
}
}
}
for(int i=1;i<=n;i++){
if(x[i]==0)s++;
}
fout<<s;
return 0;
}