1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
|
/*******************************************************************************
gen_primes.cc, generates some constant numbers (arrays) of mpz_sprime.cc
This file is part of LibTMCG.
Copyright (C) 2018, 2019 Heiko Stamer <[email protected]>
LibTMCG is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
LibTMCG is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with LibTMCG; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*******************************************************************************/
#include <limits.h>
#include <cstdio>
#include <cassert>
#include <iostream>
#include <gmp.h>
int main
()
{
bool pp_flag = true;
unsigned long int b = 80000;
unsigned long int ps = 0, ls = 0, pp = 1, pp_max = 0;
mpz_t pp_check;
mpz_init_set_ui(pp_check, 1UL);
std::cout << "unsigned long int primes[] = {" << std::endl;
for (unsigned long int i = 3; i < b; i++)
{
bool prime = true;
for (unsigned long int j = 2; (j < i) && (j < b); j++)
{
if ((i % j) == 0)
{
prime = false;
break;
}
}
if (prime)
{
++ps;
std::cout << i << ", ";
if (++ls == 8)
{
std::cout << std::endl << "\t";
ls = 0;
}
if (pp_flag)
{
mpz_mul_ui(pp_check, pp_check, i);
if (mpz_cmp_ui(pp_check, ULONG_MAX) < 0)
{
pp *= i;
pp_max = ps;
}
else
pp_flag = false;
}
}
}
mpz_clear(pp_check);
std::cout << "0" << std::endl << "}; // PRIMES_SIZE = " << ps << std::endl;
ls = 0;
std::cout << "unsigned long int primes_m1d2[] = {" << std::endl;
for (unsigned long int i = 3; i < b; i++)
{
bool prime = true;
for (unsigned long int j = 2; (j < i) && (j < b); j++)
{
if ((i % j) == 0)
{
prime = false;
break;
}
}
if (prime)
{
std::cout << ((i - 1)/2) << ", ";
if (++ls == 8)
{
std::cout << std::endl << "\t";
ls = 0;
}
}
}
std::cout << "0" << std::endl << "};" << std::endl;
std::cout << "unsigned long int primes_product = " << pp << "UL; //" <<
" MAX_GCD_PRIME = " << pp_max << std::endl;
return 0;
}
|
