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
|
// Copyright(c)'1994-2009 by The Givaro group
// This file is part of Givaro.
// Givaro is governed by the CeCILL-B license under French law
// and abiding by the rules of distribution of free software.
// see the COPYRIGHT file for more details.
/*! @file examples/Integer/ispower.C
* @ingroup examples
* @ingroup integers
* @example examples/Integer/ispower.C
* @brief NO DOC
*/
#include <iostream>
#include <stdlib.h>
#include <givaro/givinteger.h>
#include <givaro/givintprime.h>
#include <givaro/givtimer.h>
using namespace Givaro;
int main(int argc, char** argv)
{
Integer m, p;
if (argc > 1) m = Integer(argv[1]);
IntPrimeDom IP;
{
Timer tim; tim.clear(); tim.start();
int a = isperfectpower(m);
tim.stop();
std::cout << a << std::endl;
std::cerr << tim << std::endl;
}
{
Timer tim; tim.clear(); tim.start();
int a = (int)IP.isprimepower(p, m);
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;
}
/* -*- mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
// vim:sts=4:sw=4:ts=4:et:sr:cino=>s,f0,{0,g0,(0,\:0,t0,+0,=s
|
