Cod sursa(job #1234802)
Utilizator | Data | 28 septembrie 2014 00:33:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool com[999];
int n, i, j, nr=0;
int main()
{
fin>>n;
for(i=2; i<=n; i++)
{
if(com[i] == false)
{
nr++;
for(j=2*i; j<=n; j+=i)
{
com[i] = true;
}
}
}
fout<<nr;
return 0;
}