Cod sursa(job #2254366)
| Utilizator | Data | 5 octombrie 2018 10:28:45 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include<bits/stdc++.h>
using namespace std;
struct Ciur{
int ion;
bool vanea;
};
int main(){
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int n;
cin>>n;
Ciur a[n+1];
for(int i=1;i<=n;i++){
a[i].ion=i;
a[i].vanea=0;
}
a[1].vanea=1;
for(int i=2;i<=n;i++){
for(int j=i+1;j<=n+1;j++){
if(a[i].vanea==1)break;else
if(a[j].ion%a[i].ion==0)a[j].vanea=1;
}
}
int k=0;
for(int i=2;i<=n;i++)
if(a[i].vanea==0)k++;
cout<<k;
return 0;
}
