Cod sursa(job #1964735)
| Utilizator | Data | 13 aprilie 2017 17:22:57 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <iostream>
#include <fstream>
using namespace std;
int a[10001];
int pr[100001];
int prim(int x){
if(x==1){
return 1;
}
for(int i=2; i*i<=x; ++i ){
if(x%i==0){
return 1;
}
}
return 0;
pr[x]=prim(x);
}
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n;
f>>n;
int cont=0;
for(int i=2; i*i<=n; ++i ){
if(pr[i]==0){
for(int j=i+i; j<=n; j+=i ){
pr[j]=1;
}
}
}
for(int i=2; i<=n; ++i ){
if(pr[i]==0){
++cont;
}
}
g<<cont;
return 0;
}
