Cod sursa(job #2539711)
Utilizator | Data | 6 februarie 2020 10:38:58 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[10005];int n;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
int main()
{
f>>n;
//0-prim
//1-neprim
v[0]=1;
v[1]=1;
long int cnt=0;
for(int i=2; i<=n; i++)
{
if(v[i]==0)
{
cnt++;
for(int j=i;j<=n;j=i+j)
{
v[j]=1;
}
}
}
g<<cnt;
return 0;
}