-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprimeNumbers.cpp
More file actions
360 lines (294 loc) · 10.1 KB
/
primeNumbers.cpp
File metadata and controls
360 lines (294 loc) · 10.1 KB
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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
#include <iostream>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <fstream>
#include <chrono>
#include <string>
#include <sstream>
#include <sys/resource.h> // for getrusage on Unix (Linux/macOS)
#include <mutex>
#include <thread>
#include <future>
size_t getMemoryUsageKB() {
#if defined(__unix__) || defined(__APPLE__)
struct rusage usage;
getrusage(RUSAGE_SELF, &usage);
// On macOS, ru_maxrss is in bytes; on Linux it's in kilobytes
#if defined(__APPLE__)
return usage.ru_maxrss / 1024; // Convert bytes to KB
#else
return usage.ru_maxrss; // Already in KB
#endif
#else
// Unsupported OS fallback
return 0;
#endif
}
constexpr long double EPS = 1e-15;
// Floating-point comparator for map
struct FloatCompare {
bool operator()(long double a, long double b) const {
return a < b - EPS;
}
};
// Our number representation
struct Number {
long long int two_e; // exponent of 2
long long int three_e; // exponent of 3
long long int five_e; // exponent of 5
Number(long long int a = 0, long long int b = 0, long long int c = 0) : two_e(a), three_e(b), five_e(c) {}
long double logValue() const {
static const long double LOG2 = std::logl(2.0L);
static const long double LOG3 = std::logl(3.0L);
static const long double LOG5 = std::logl(5.0L);
return two_e * LOG2 + three_e * LOG3 + five_e * LOG5;
}
long long actualValue() const {
unsigned long long result = unsigned(1ULL);
for (int i = 0; i < two_e; ++i) result *= unsigned(2ULL);
for (int i = 0; i < three_e; ++i) result *= unsigned(3ULL);
for (int i = 0; i < five_e; ++i) result *= unsigned(5ULL);
return result;
}
bool operator<(const Number& other) const {
return logValue() + EPS < other.logValue();
}
};
struct Compare {
bool operator()(const Number& a, const Number& b) const {
return a.logValue() > b.logValue(); // min-heap
}
};
void printPriorityQueue(std::priority_queue<Number, std::vector<Number>, Compare> pq) {
std::cout << "Peeking into the priority queue:\n";
while (!pq.empty()) {
std::cout << pq.top().actualValue() << " ";
pq.pop();
}
std::cout << "\n";
}
void printMap(std::map<long double, Number, FloatCompare> &result){
std::cout << "Peeking into the map:\n";
for (const auto& [logval, num] : result) {
std::cout << num.actualValue() << " ";
}
std::cout << "\n";
}
void solution(int n, bool verbose = false){
// Initialization
std::map<long double, Number, FloatCompare> result;
std::priority_queue<Number, std::vector<Number>, Compare> q;
Number start(0, 0, 0); // Represents the number 1
q.push(start);
result.insert({start.logValue(), start});
int count = 0;
Number current;
while (count < n) {
current = q.top();
q.pop();
count++;
Number next1 = Number(current.two_e + 1, current.three_e, current.five_e);
Number next2 = Number(current.two_e, current.three_e + 1, current.five_e);
Number next3 = Number(current.two_e, current.three_e, current.five_e + 1);
for (auto& next : {next1, next2, next3}) {
if (result.find(next.logValue()) == result.end()) {
q.push(next);
result.insert({next.logValue(), next});
}
}
}
if(verbose){
std::cout<<"Value: "<<current.actualValue()<<"\n";
std::cout<<"2^"<<current.two_e<<"*3^"<<current.three_e<<"*5^"<<current.five_e<<std::endl;
std::cout<<">ps: if Value<=0 , int has overflowed"<<std::endl;
}
}
Number answer=Number(0,0,0);
void dp(int & count, int &n, Number ¤t, std::set<long double> s){
if(count==n){
answer=current;
return;
}
if(s.find(current.logValue()) != s.end()){
return;
}
count++;
s.ins
1040C
ert(current.logValue());
Number next1 = Number(current.two_e + 1, current.three_e, current.five_e);
Number next2 = Number(current.two_e, current.three_e + 1, current.five_e);
Number next3 = Number(current.two_e, current.three_e, current.five_e + 1);
dp(count, n, next1, s);
dp(count, n, next2, s);
dp(count, n, next3, s);
}
void solution_dp(int n, bool verbose=false){
std::cout<<"hello";
Number current = Number(0,0,0);
int count=0;
std::set<long double> s;
dp(count, n, current, s);
current=answer;
if(verbose){
std::cout<<"Value: "<<current.actualValue()<<"\n";
std::cout<<"2^"<<current.two_e<<"*3^"<<current.three_e<<"*5^"<<current.five_e<<std::endl;
std::cout<<">ps: if Value<=0 , int has overflowed"<<std::endl;
}
}
void solution_set(int n, bool verbose=false){
std::set<Number> s;
std::priority_queue<Number, std::vector<Number>, Compare> q;
Number start(0, 0, 0); // Represents the number 1
q.push(start);
s.insert(start);
int count = 0;
Number current;
while (count < n) {
current = q.top();
q.pop();
count++;
Number next1 = Number(current.two_e + 1, current.three_e, current.five_e);
Number next2 = Number(current.two_e, current.three_e + 1, current.five_e);
Number next3 = Number(current.two_e, current.three_e, current.five_e + 1);
for (auto& next : {next1, next2, next3}) {
if (s.find(next) == s.end()) {
q.push(next);
s.insert(next);
}
}
}
if(verbose){
std::cout<<"Value: "<<current.actualValue()<<"\n";
std::cout<<"2^"<<current.two_e<<"*3^"<<current.three_e<<"*5^"<<current.five_e<<std::endl;
std::cout<<">ps: if Value<=0 , int has overflowed"<<std::endl;
}
}
void test() {
std::ofstream csv("performance_data.csv");
csv << "N,TimeConsumed(μs),MemoryUsed(KB)\n";
for (int n = 1; n <= 10000000; ++n) {
auto start = std::chrono::high_resolution_clock::now();
solution(n); // Call the algorithm
auto end = std::chrono::high_resolution_clock::now();
auto duration_ms = std::chrono::duration_cast<std::chrono::microseconds>(end - start).count();
size_t memory_kb = getMemoryUsageKB();
csv << n << "," << duration_ms << "," << memory_kb << "\n";
if (n % 1000 == 0) {
std::cout << "Completed N = " << n << "\n";
}
}
csv.close();
}
void test_dp() {
std::ofstream csv("dp_performance_data.csv");
csv << "N,TimeConsumed(μs),MemoryUsed(KB)\n";
for (int n = 1; n <= 10000000; ++n) {
auto start = std::chrono::high_resolution_clock::now();
solution_dp(n); // Call the algorithm
auto end = std::chrono::high_resolution_clock::now();
auto duration_ms = std::chrono::duration_cast<std::chrono::microseconds>(end - start).count();
size_t memory_kb = getMemoryUsageKB();
csv << n << "," << duration_ms << "," << memory_kb << "\n";
if (n % 1000 == 0) {
std::cout << "Completed N = " << n << "\n";
}
}
csv.close();
}
void test_set() {
std::ofstream csv("set_performance_data.csv");
csv << "N,TimeConsumed(μs),MemoryUsed(KB)\n";
for (int n = 1; n <= 10000000; ++n) {
auto start = std::chrono::high_resolution_clock::now();
solution_set(n); // Call the algorithm
auto end = std::chrono::high_resolution_clock::now();
auto duration_ms = std::chrono::duration_cast<std::chrono::microseconds>(end - start).count();
size_t memory_kb = getMemoryUsageKB();
csv << n << "," << duration_ms << "," << memory_kb << "\n";
if (n % 1000 == 0) {
std::cout << "Completed N = " << n << "\n";
}
}
csv.close();
}
int main() {
// std::cout << "Enter n: ";
// std::cin >> n;
// for 1500
// solution(2, true);
// for 100000
// solution(100000, true);
bool exit = false;
while(true){
int i=0;
std::cout<<"\n";
std::cout<<"==============MAIN MENU===================="<<std::endl;
std::cout<<"\n";
std::cout<<"> 1. find number at an index \n";
std::cout<<"> 2. generate dataset for map & priority queue algorithm \n";
std::cout<<"> 3. generate dataset for dp based algorithm \n";
std::cout<<"> 4. generate dataset for set & priority queue based algorithm \n";
std::cout<<"> 5. exit \n";
std::cout<<"\n";
std::cout<<">>> ";
std::cin>>i;
switch (i)
{
case 1:
int n, solutionType;
std::cout<<"\n";
std::cout<<"> Enter index no: ";
std::cin>> n;
std::cout<<"\n";
std::cout<<"> Select an algorithm: \n";
std::cout<<"\n";
std::cout<<"> 0. go back to main menu \n";
std::cout<<"> 1. main algorithm \n";
std::cout<<"> 2. dp algorithm \n";
std::cout<<"> 3. set algorithm \n";
std::cout<<"\n";
std::cout<<">>> ";
std::cin>> solutionType;
switch(solutionType)
{
case 1:
solution(n, true);
break;
case 2:
solution_dp(n, true);
break;
case 3:
solution_set(n, true);
break;
case 0:
break;
default:
std::cout<<"Please enter a valid input, going back to main menu..."<<std::endl;
break;
}
break;
case 2:
test();
break;
case 3:
test_dp();
break;
case 4:
test_set();
break;
case 5:
exit=true;
break;
default:
std::cout<<"Please give a valid input."<<std::endl;
break;
}
if(exit){
break;
}
}
std::cout<<"===========CODE EXECUTION COMLETED=============="<<std::endl;
return 0;
}