Cod sursa(job #2053406)
Utilizator | Data | 31 octombrie 2017 18:41:18 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
bool prim( int n){
int d,q=0;
for(d=2;d*d<=n;d++)
if(n%d==0)
q++;
if(q==0)
return 1;
else
return 0;
}
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int n,cnt=0,i=2;
in>>n;
while(i<=n){
if(prim(i)==1)
cnt++;
i++;}
out<<cnt;
return 0;
}