Cod sursa(job #2029324)
| Utilizator | Data | 29 septembrie 2017 20:42:46 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
#include <iostream>
#include <string.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int N;
in >> N;
int vec[2000001];
int val = 0;
memset(vec,0,sizeof(vec));
for(int i = 0; i < N; i++)
{
cout << vec[i] << ' ';
}
for(int i = 2; i <= N; i++)
{
if(vec[i] == 0) {
val++;
for(int j = i*2; j <= N; j += i)
vec[j] = 1;
}
}
out << val;
return 0;
}
