Cod sursa(job #2262400)
Utilizator | Data | 17 octombrie 2018 11:40:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
#define MAX 200000
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
int v[MAX],N;
void Vector(int N)
{
int i,k,j,ok=0;
for(i=2;i<=7;i++)
if(v[i]==0)
for(j=2;j*i<=N;j++)
v[i*j]=1;
for(i=2;i<=N;i++)
if(v[i]==0)
ok++;
g<<ok;
}
int main()
{f>>N;
Vector(N);
return 0;
}