Cod sursa(job #2339277)
Utilizator | Data | 8 februarie 2019 17:14:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main() {
ifstream input("ciur.in");
ofstream output("ciur.out");
bool verificare=true;
int k=1,i,prim[10000],j;
prim[1]=2;
int n;
input>>n;
for(i=3;i<=n;i=i+2)
{
for(j=1;j<=k;j++)
if(i % prim[j] == 0)
{
verificare=false;
break;
}
if(verificare==true){k++;prim[k]=i;}
verificare=true;
}
output<<k;
return 0;
}