Cod sursa(job #1517968)
Utilizator | Data | 5 noiembrie 2015 08:37:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<iostream>
#include<fstream>
#include<math.h>
using namespace std;
bool y [2000003];
int main ()
{
ifstream fin("ciur.in");
ofstream out("ciur.out");
int n;
int c=0;
fin>>n;
y[2]=1;
bool x=0;
for(int i=3;i<n;i+=2){
if(i%2==1){
for(int j=2;j<i;++j){
if(i%j==0&&y[j]==1){
x=1;break;}
}}else x=1;
if(x==0)c++;x=0;
}
out<<c;
}