Cod sursa(job #1964680)
Utilizator | Data | 13 aprilie 2017 16:56:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
int prim(int x){
if(x==1){
return 0;
}
for(int i=2; i*i<=x; ++i ){
if(x%i==0){
return 0;
}
}
return 1;
}
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n;
f>>n;
int cont=0;
for(int i=2; i<=n; ++i ){
if( prim(i)==1 ){
++cont;
}
}
g<<cont;
return 0;
}