Cod sursa(job #1010591)
Utilizator | Data | 15 octombrie 2013 12:31:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<iostream>
#include<fstream>
using namespace std;
int m(int n)
{
int i;
for(i=2;i<=n/2;i++)
if(n%i==0)
return 0;
return 1;
}
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,q=0;
f>>n;
for(i=2;i<=n;i++)
if(m(i))
q++;
g<<q;
g.close();
return 0;
}