aboutsummaryrefslogtreecommitdiff
path: root/challenge-153/abigail/java
diff options
context:
space:
mode:
authorMárton Polgár <37218286+2colours@users.noreply.github.com>2022-02-21 18:24:51 +0100
committerGitHub <noreply@github.com>2022-02-21 18:24:51 +0100
commit1b528a9e77709d3d6159c9bf4e8066a735049797 (patch)
tree47f1cc98c548411026748c99cd0997ff0988681a /challenge-153/abigail/java
parent1c39414e90bfa4093a8443f28c4d8e00a6809363 (diff)
parente1575d77a4181187d7a30e2ac0df6679f4e2bd43 (diff)
downloadperlweeklychallenge-club-1b528a9e77709d3d6159c9bf4e8066a735049797.tar.gz
perlweeklychallenge-club-1b528a9e77709d3d6159c9bf4e8066a735049797.tar.bz2
perlweeklychallenge-club-1b528a9e77709d3d6159c9bf4e8066a735049797.zip
Merge branch 'manwar:master' into branch-for-challenge-153
Diffstat (limited to 'challenge-153/abigail/java')
-rw-r--r--challenge-153/abigail/java/ch-1.java23
-rw-r--r--challenge-153/abigail/java/ch-2.java30
2 files changed, 53 insertions, 0 deletions
diff --git a/challenge-153/abigail/java/ch-1.java b/challenge-153/abigail/java/ch-1.java
new file mode 100644
index 0000000000..dd06f3b774
--- /dev/null
+++ b/challenge-153/abigail/java/ch-1.java
@@ -0,0 +1,23 @@
+//
+// See https://theweeklychallenge.org/blog/perl-weekly-challenge-153
+//
+
+//
+// Run as: ln ch-1.java ch1.java; javac ch1.java; java ch1
+//
+
+import java.util.*;
+
+public class ch1 {
+ public static void main (String [] args) {
+ int sum = 1;
+ int fac = 1;
+ System . out . printf ("%d", sum);
+ for (int n = 1; n <= 9; n ++) {
+ fac *= n;
+ sum += fac;
+ System . out . printf (" %d", sum);
+ }
+ System . out . printf ("\n");
+ }
+}
diff --git a/challenge-153/abigail/java/ch-2.java b/challenge-153/abigail/java/ch-2.java
new file mode 100644
index 0000000000..1fc60b7431
--- /dev/null
+++ b/challenge-153/abigail/java/ch-2.java
@@ -0,0 +1,30 @@
+//
+// See https://theweeklychallenge.org/blog/perl-weekly-challenge-153
+//
+
+//
+// Run as: ln ch-2.java ch2.java; javac ch2.java; java ch2 < input-file
+//
+
+import java.util.*;
+
+public class ch2 {
+ public static void main (String [] args) {
+ Scanner scanner = new Scanner (System . in);
+ int [] fac = new int [10];
+ fac [0] = 1;
+ for (int n = 1; n <= 9; n ++) {
+ fac [n] = n * fac [n - 1];
+ }
+ while (scanner . hasNextInt ()) {
+ int num = scanner . nextInt ();
+ int sum = 0;
+ int n = num;
+ while (n > 0) {
+ sum += fac [n % 10];
+ n /= 10;
+ }
+ System . out . printf ("%d\n", sum == num ? 1 : 0);
+ }
+ }
+}