Cod sursa(job #489135)
| Utilizator | Data | 1 octombrie 2010 12:47:44 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.26 kb |
#include<fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main ()
{
long int n,m,i,j,p;
in>>n;
m=1;
for(i=3;i<=n;i=i+2)
{p=0;
for(j=3;j<=i/2;j=j+2)
if(i%j==0)
{p=1;j=i;}
if(p==0)
m=m+1;
}
out<<m;}