From b5f389264a49dfc52e5f05d8ac97000da986c5b4 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Hatvani=20Tam=C3=A1s?= Date: Tue, 14 Apr 2026 09:02:25 +0200 Subject: [PATCH] deleted misc --- main.c | 16 ++-------------- 1 file changed, 2 insertions(+), 14 deletions(-) diff --git a/main.c b/main.c index 4a887c0..28bc1ff 100644 --- a/main.c +++ b/main.c @@ -188,17 +188,6 @@ uint64_t kinai_maradek_tetel(uint64_t *m, uint64_t d, prime_test_t *p, prime_tes euklidian_result_t y = euklidian_algorigthm_extended(Mp, Mq); // in the struct the x will mean the y1 and y will mean the y2 // if either of them is less a negative number shift them into postive range with with hte modulo - // y.x %= p->prime; - // if (y.x < 0) - // y.x += p->prime; - // - // y.y %= q->prime; - // if (y.y < 0) - // y.y += q->prime; - // - // unsigned __int128 s1 = (c1 * y.x * Mp) % M; - // unsigned __int128 s2 = (c2 * y.y * Mq) % M; - // return (s1 + s2) % M; uint64_t y1_pos; if (y.x < 0) { y1_pos = p->prime - (uint64_t)(-y.x % p->prime); @@ -263,8 +252,9 @@ int main() { printf("\n"); uint64_t m = 0; - printf("give input for m: \n"); + printf("give input for m: "); scanf("%ju", &m); + printf("\n"); srand(time(NULL)); @@ -280,8 +270,6 @@ int main() { pthread_join(thread_q, NULL); printf("\n"); - p.prime = 3000000019; - q.prime = 4000000007; printf("p: %u\n", p.prime); printf("q: %u\n", q.prime);