Cod sursa(job #665003)
Utilizator | Data | 21 ianuarie 2012 13:16:15 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n,x,nr,v[2000001];
int prim(int x)
{for(int d=2;d<x/2;d++)if(x%d==0)return 0;
return 1;
}
int main()
{in>>n;
while(x*6<n){if(prim(x*6-1))nr++;
if(prim(x*6+1))nr++;
x++;
}
out<<nr<<" ";
out.close();
return 0;
}