Cod sursa(job #1290824)
Utilizator | Data | 11 decembrie 2014 20:08:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int N;
int x=0, ct=0, i, j;
fin>>N;
for(i=2; i<=N; i++)
{
for(j=1; j<=i; j++)
{
if(i%j==0)
{
ct++;
}
}
if(ct==2)
{
x++;
}
ct=0;
}
fout << x;
return 0;
}