aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorAbigail <abigail@abigail.be>2021-03-23 19:26:22 +0100
committerAbigail <abigail@abigail.be>2021-03-23 19:26:22 +0100
commit5b1a28b0aec97758425a0c2c5c1d0616bdcddd29 (patch)
tree9214e1987458ff35611015177d9b1e7f2175b796
parenta872fa4b50f26a39937194f989437a27a7c2008a (diff)
downloadperlweeklychallenge-club-5b1a28b0aec97758425a0c2c5c1d0616bdcddd29.tar.gz
perlweeklychallenge-club-5b1a28b0aec97758425a0c2c5c1d0616bdcddd29.tar.bz2
perlweeklychallenge-club-5b1a28b0aec97758425a0c2c5c1d0616bdcddd29.zip
Pascal solution for week 105, part 1
-rw-r--r--challenge-105/abigail/README.md1
-rw-r--r--challenge-105/abigail/pascal/ch-1.p39
2 files changed, 40 insertions, 0 deletions
diff --git a/challenge-105/abigail/README.md b/challenge-105/abigail/README.md
index b45353bc37..b3f76aba43 100644
--- a/challenge-105/abigail/README.md
+++ b/challenge-105/abigail/README.md
@@ -23,6 +23,7 @@ Output: 2.02
* [Fortran](fortran/ch-1.f90)
* [Lua](lua/ch-1.lua)
* [Node.js](node/ch-1.js)
+* [Pascal](pascal/ch-1.p)
* [Perl](perl/ch-1.pl)
* [Python](python/ch-1.py)
* [Ruby](ruby/ch-1.rb)
diff --git a/challenge-105/abigail/pascal/ch-1.p b/challenge-105/abigail/pascal/ch-1.p
new file mode 100644
index 0000000000..49eee20c4f
--- /dev/null
+++ b/challenge-105/abigail/pascal/ch-1.p
@@ -0,0 +1,39 @@
+Program NthRoot;
+
+(* *)
+(* See ../README.md *)
+(* *)
+
+(* *)
+(* Run as: fpc -och-1.out ch-1.p; ./ch-1.out *)
+(* *)
+
+(* *)
+(* Input will consist of lines; each line will have two numbers, N and k, *)
+(* N > 0, k > 0. For each line of input, we output a line with the Nth *)
+(* root of k. *)
+(* *)
+(* We're not doing any input validations; we're assuming it's correct. *)
+(* *)
+
+(* *)
+(* To find the Nth root of a number k, we calculate: *)
+(* *)
+(* ln (k) *)
+(* ------ *)
+(* N *)
+(* exp *)
+(* *)
+(* 1/N *)
+(* which is equivalent to k *)
+(* *)
+
+var N, k: double;
+
+begin
+ while not eof () do
+ begin
+ readln (N, k);
+ writeln (exp (ln (k) / N) : 1 : 10);
+ end
+end.