#include <cln/univpoly_rational.h>
#include <cln/univpoly_modint.h>
#include <cln/io.h>
-#include <stdlib.h>
+#include <cstdlib>
+using namespace std;
using namespace cln;
// Computes the n-th Legendre polynomial in R[x], using the formula
int main (int argc, char* argv[])
{
if (!(argc == 2 || argc == 3)) {
- fprint(stderr, "Usage: legendre n [m]\n");
+ cerr << "Usage: legendre n [m]" << endl;
exit(1);
}
int n = atoi(argv[1]);
if (!(n >= 0)) {
- fprint(stderr, "Usage: legendre n [m] with n >= 0\n");
+ cerr << "Usage: legendre n [m] with n >= 0" << endl;
exit(1);
}
if (argc == 2) {
cl_UP p = legendre(cl_RA_ring,n);
- fprint(stdout, p);
+ cout << p << endl;
} else {
cl_I m = argv[2];
cl_UP p = legendre(find_modint_ring(m),n);
- fprint(stdout, p);
+ cout << p << endl;
}
- fprint(stdout, "\n");
+ return 0;
}