mirror of
https://github.com/rn10950/RetroZilla.git
synced 2024-11-14 11:40:13 +01:00
75 lines
1.7 KiB
C
75 lines
1.7 KiB
C
/*
|
|
* Simple test driver for MPI library
|
|
*
|
|
* Test 7: Random and divisibility tests
|
|
*
|
|
* This Source Code Form is subject to the terms of the Mozilla Public
|
|
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <ctype.h>
|
|
#include <limits.h>
|
|
#include <time.h>
|
|
|
|
#define MP_IOFUNC 1
|
|
#include "mpi.h"
|
|
|
|
#include "mpprime.h"
|
|
|
|
int main(int argc, char *argv[])
|
|
{
|
|
mp_digit num;
|
|
mp_int a, b;
|
|
|
|
srand(time(NULL));
|
|
|
|
if(argc < 3) {
|
|
fprintf(stderr, "Usage: %s <a> <b>\n", argv[0]);
|
|
return 1;
|
|
}
|
|
|
|
printf("Test 7: Random & divisibility tests\n\n");
|
|
|
|
mp_init(&a);
|
|
mp_init(&b);
|
|
|
|
mp_read_radix(&a, argv[1], 10);
|
|
mp_read_radix(&b, argv[2], 10);
|
|
|
|
printf("a = "); mp_print(&a, stdout); fputc('\n', stdout);
|
|
printf("b = "); mp_print(&b, stdout); fputc('\n', stdout);
|
|
|
|
if(mpp_divis(&a, &b) == MP_YES)
|
|
printf("a is divisible by b\n");
|
|
else
|
|
printf("a is not divisible by b\n");
|
|
|
|
if(mpp_divis(&b, &a) == MP_YES)
|
|
printf("b is divisible by a\n");
|
|
else
|
|
printf("b is not divisible by a\n");
|
|
|
|
printf("\nb = mpp_random()\n");
|
|
mpp_random(&b);
|
|
printf("b = "); mp_print(&b, stdout); fputc('\n', stdout);
|
|
mpp_random(&b);
|
|
printf("b = "); mp_print(&b, stdout); fputc('\n', stdout);
|
|
mpp_random(&b);
|
|
printf("b = "); mp_print(&b, stdout); fputc('\n', stdout);
|
|
|
|
printf("\nTesting a for divisibility by first 170 primes\n");
|
|
num = 170;
|
|
if(mpp_divis_primes(&a, &num) == MP_YES)
|
|
printf("It is divisible by at least one of them\n");
|
|
else
|
|
printf("It is not divisible by any of them\n");
|
|
|
|
mp_clear(&b);
|
|
mp_clear(&a);
|
|
|
|
return 0;
|
|
}
|