Cod sursa(job #1226479)
Utilizator | Data | 5 septembrie 2014 17:20:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
int N,c;
bool IsPrime(int a)
{
for(int i=2;i*i<=a; i++)
if(a%i==0)
return false;
return true;
}
int main()
{
ifstream fin("ciur.in");
fin>>N;
c=0;
for(int i=2;i<=N; i++)
if(IsPrime(i)==true)
c++;
ofstream fout("ciur.out");
fout<<c;
fin.close();
fout.close();
return 0;
}