Cod sursa(job #1108677)
Utilizator | Data | 15 februarie 2014 22:33:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int n,i,nr,s,j;
s=0;
in>>n;
for(i=1;i<=n;i++)
{
nr=0;
for(j=1;j<=i;j++)
{
if(i%j==0)
nr=nr+1;
}
if((nr==2)&&(i!=1))
s=s+1;
}
out<<s;
}