Cod sursa(job #2501757)
Utilizator | Data | 30 noiembrie 2019 10:11:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
#define ll long long
#define x first
#define y second
#define pb push_back
using namespace std;
int main(){
ifstream fin;
fin.open("ciur.in");
ofstream fout;
fout.open("ciur.out");
ll n,i,j;
vector< ll> v ;
fin>>n;
v.pb(2);
for(i=3;i<=n;i++){
ll p=0;
for(j=0;j<v.size();j++){
if(i%v[j]==0) p=1;
}
if(p==0) v.pb(i);
}
fout<<v.size();
}