X-Git-Url: https://ginac.de/CLN/cln.git//cln.git?a=blobdiff_plain;f=examples%2Flegendre.cc;h=c0e4b90a4ad90b3e52efb8ee7580a75385bdacc1;hb=f57f23a99a4ec8ded1faf4d61e0fb4fc6127419a;hp=6805767f7caca9dcd9212c9bd38e6a771e48736a;hpb=850abfde7f0d985ba01526c346bcd0d733562943;p=cln.git

diff --git a/examples/legendre.cc b/examples/legendre.cc
index 6805767..c0e4b90 100644
--- a/examples/legendre.cc
+++ b/examples/legendre.cc
@@ -10,6 +10,7 @@
 #include <cln/io.h>
 #include <stdlib.h>
 
+using namespace std;
 using namespace cln;
 
 // Computes the n-th Legendre polynomial in R[x], using the formula
@@ -54,21 +55,21 @@ const cl_UP_MI legendre (const cl_modint_ring& R, int n)
 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;
 }