Cod sursa(job #504838)
Utilizator | Data | 28 noiembrie 2010 23:12:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<iostream>
#include<fstream>
#include<math.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
long long i,j,n,p,t;
int ciur(int x)
{
for(j=2;j*j<=x;j++)
if(x%j==0)return 0;
return 1;
}
int main()
{
f>>n;
for(i=2;i<=n;i++)
if(ciur(i))t++;
g<<t;
f.close();
g.close();
return 0;
}