Cod sursa(job #1654051)
| Utilizator | Data | 16 martie 2016 19:46:01 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,c;
int prim(int x)
{
for(int i=2;i*i<=x;i++)
if(x%i==0) return 0;
return 1;
}
int main()
{
f>>n;
for(i=2;i<=n;i++)
if(prim(i)==1) c++;
g<<c;
f.close();
g.close();
return 0;
}
