NO DOC
#include <iostream>
#include <stdlib.h>
#include <givaro/givinteger.h>
#include <givaro/givintprime.h>
#include <givaro/givtimer.h>
int main(
int argc,
char** argv)
{
if (argc > 1) m = Integer(argv[1]);
{
Timer tim; tim.clear(); tim.start();
tim.stop();
std::cout <<
a << std::endl;
std::cerr << tim << std::endl;
}
{
Timer tim; tim.clear(); tim.start();
tim.stop();
if (
a) std::cout <<
"is " <<
p <<
"^" <<
a << std::endl;
else std::cout << "not a prime power" << std::endl;
std::cerr << tim << std::endl;
}
return 0;
}
IntFactorDom IP
Definition: ProbLucas.C:43
int main(int argc, char **argv)
Definition: benchmark-recint_exp.C:20
unsigned int isprimepower(Rep &, const Rep &) const
Definition: givintprime.C:184
Namespace in which the whole Givaro library resides.
Definition: all_field.C:23
int32_t isperfectpower(const Integer &)
Definition: gmp++_int_pow.C:26
MG & a
Definition: rmadd.h:143
a p
Definition: rmadd.h:147