Cod sursa(job #795323)
Utilizator | Data | 8 octombrie 2012 11:59:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int N,d,i,j,nd;
f>>N;
nd=0;
for(i=1;i<=N;i++)
{
d=0;
for(j=1;j<=i;j++)
if(i%j==0)
d++;
if(d==2)
nd++;
}
g<<nd;
return 0;
}