Cod sursa(job #1047887)
Utilizator | Data | 4 decembrie 2013 23:02:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include<fstream>
using namespace std;
long i,h,flag=1,x,q;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>x;
if(x==2)g<<'1';
else if(x>2)
{
q++;
for(i=3;i<=x;i=i+2)
{
if(i<5)cout<<'2';
else
{
for(h=5;(h*h<i)&&(flag==1);h=h+2)
{
if(i%h==0)flag=0;
if(h==0)flag=0;
}
if(flag==1)q++;
flag=1;
}
}
g<<q;
}
return 0;
}