diff options
| author | Mohammad S Anwar <Mohammad.Anwar@yahoo.com> | 2021-10-13 19:31:22 +0100 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2021-10-13 19:31:22 +0100 |
| commit | 6f7a2e3cbbec44cc216c6d0e6a370f9ec60e3c84 (patch) | |
| tree | 0ac9f540650e975d68834fad4197928eda9c20f2 /challenge-134/abigail/java | |
| parent | ace3e8d314fab84624d1498c05d228e5ab6df16b (diff) | |
| parent | 8d2394c5f5968392ece3d6d73a5f98e267edf40f (diff) | |
| download | perlweeklychallenge-club-6f7a2e3cbbec44cc216c6d0e6a370f9ec60e3c84.tar.gz perlweeklychallenge-club-6f7a2e3cbbec44cc216c6d0e6a370f9ec60e3c84.tar.bz2 perlweeklychallenge-club-6f7a2e3cbbec44cc216c6d0e6a370f9ec60e3c84.zip | |
Merge pull request #5017 from Abigail/abigail/week-134
Abigail/week 134
Diffstat (limited to 'challenge-134/abigail/java')
| -rw-r--r-- | challenge-134/abigail/java/ch-1.java | 18 | ||||
| -rw-r--r-- | challenge-134/abigail/java/ch-2.java | 38 |
2 files changed, 56 insertions, 0 deletions
diff --git a/challenge-134/abigail/java/ch-1.java b/challenge-134/abigail/java/ch-1.java new file mode 100644 index 0000000000..84baa6d18f --- /dev/null +++ b/challenge-134/abigail/java/ch-1.java @@ -0,0 +1,18 @@ +// +// See ../README.md +// + +// +// 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 [] tails = {789, 798, 879, 897, 978}; + for (int i: tails) { + System . out . println (1023456000 + i); + } + } +} diff --git a/challenge-134/abigail/java/ch-2.java b/challenge-134/abigail/java/ch-2.java new file mode 100644 index 0000000000..91ed32973e --- /dev/null +++ b/challenge-134/abigail/java/ch-2.java @@ -0,0 +1,38 @@ +// +// See ../README.md +// + +// +// Run as: ln ch-2.java ch2.java; javac ch2.java; java ch2 < input-file +// + +import java.util.*; +import java.util.Hashtable; +import java.util.Map; + +public class ch2 { + public static void main (String [] args) { + Scanner scanner = new Scanner (System . in); + try { + while (true) { + int n = scanner . nextInt (); + int m = scanner . nextInt (); + + Map <Integer, Integer> seen = + new Hashtable <Integer, Integer> (); + + for (int i = 1; i <= n; i ++) { + for (int j = 1; j <= m; j ++) { + seen . put (i * j, 1); + } + } + System . out . println (seen . size ()); + } + } + catch (Exception e) { + // + // EOF + // + } + } +} |
