Cod sursa(job #1117349)
Utilizator | Data | 23 februarie 2014 13:47:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int n,prim,nr=0;
in>>n;
for(int i=3;i<n;i=i+2)
{
int gasit=1;
for(int j=3;j*j<=n;j=j+2)
{
if(n%j==0)
gasit=0;
else
gasit=1;
}
if(gasit==1)
nr=nr+1;
}
out<<nr;
return 0;
}