• Feb 6, 2021 •Daedalus
0 likes • 1 view
import java.util.Scanner; /* In Heaven, the seed is tall and the oak small / It's input vital * "The al-Madinatian," verse 236-37 * tinyurl.com/17snqkfv * email answer to [email protected] **/ public class Main { public static void main(String args[]) { int x = 0; int a, c, m = 10000; Scanner in = new Scanner(System.in); System.out.println("Please enter a seed, maximum 3000000:"); x = in.nextInt(); System.out.println("Please input a number, maximum 29:"); a = in.nextInt(); System.out.println("Please input a number, maximum 999999:"); c = in.nextInt(); char menu = 'y'; while(menu != 'n') { x = (a*x + c) % m; System.out.println("The next number is " + x + "\nWould you like another? (y/n)"); menu = in.next().charAt(0); } } } //██╗ ░█████╗░███╗░░░███╗ ██████╗░░█████╗░███████╗██████╗░░█████╗░██╗░░░░░██╗░░░██╗░██████╗ //██║ ██╔══██╗████╗░████║ ██╔══██╗██╔══██╗██╔════╝██╔══██╗██╔══██╗██║░░░░░██║░░░██║██╔════╝ //██║ ███████║██╔████╔██║ ██║░░██║███████║█████╗░░██║░░██║███████║██║░░░░░██║░░░██║╚█████╗░ //██║ ██╔══██║██║╚██╔╝██║ ██║░░██║██╔══██║██╔══╝░░██║░░██║██╔══██║██║░░░░░██║░░░██║░╚═══██╗ //██║ ██║░░██║██║░╚═╝░██║ ██████╔╝██║░░██║███████╗██████╔╝██║░░██║███████╗╚██████╔╝██████╔╝ //╚═╝ ╚═╝░░╚═╝╚═╝░░░░░╚═╝ ╚═════╝░╚═╝░░╚═╝╚══════╝╚═════╝░╚═╝░░╚═╝╚══════╝░╚═════╝░╚═════╝░
• Nov 19, 2022 •CodeCatch
0 likes • 2 views
public class Factorial { public static void main(String[] args) { final int NUM_FACTS = 100; for(int i = 0; i < NUM_FACTS; i++) System.out.println( i + "! is " + factorial(i)); } public static int factorial(int n) { int result = 1; for(int i = 2; i <= n; i++) result *= i; return result; } }
• May 21, 2025 •AustinLeath
0 likes • 3 views
class main { public static boolean findDuplicates(int[] nums) { for(int i = 0; i < nums.length; i++) { for(int j = 0; j < i; j++) { if(nums[i] == nums[j]) { return true; } } } return false; } public static void main(String[] args) { int[] myArray = {1,3}; System.out.println(findDuplicates(myArray)); } }
• May 15, 2025 •AustinLeath
import java.util.Arrays; public class Main { public static int findMinNonCreatableSum(int[] coins) { // Sort the array Arrays.sort(coins); // Initialize max creatable sum int maxCreatable = 0; // Iterate through coins for (int coin : coins) { // If current coin is greater than maxCreatable + 1, // we found our answer if (coin > maxCreatable + 1) { return maxCreatable + 1; } // Add current coin to maxCreatable maxCreatable += coin; } // If we can create all sums up to maxCreatable, // the answer is maxCreatable + 1 return maxCreatable + 1; } public static void main(String[] args) { int[] coins = {2, 9, 1, 2, 7}; int result = findMinNonCreatableSum(coins); System.out.println("Smallest sum that cannot be created: " + result); } }
• Oct 15, 2022 •CodeCatch
public class Solution { public ListNode mergeTwoLists(ListNode l1, ListNode l2) { ListNode head = new ListNode(0); ListNode handler = head; while(l1 != null && l2 != null) { if (l1.val <= l2.val) { handler.next = l1; l1 = l1.next; } else { handler.next = l2; l2 = l2.next; } handler = handler.next; } if (l1 != null) { handler.next = l1; } else if (l2 != null) { handler.next = l2; } return head.next; } }
• Jan 31, 2023 •AustinLeath
public class UserService { private UserRepository userRepository; public UserService(UserRepository userRepository) { this.userRepository = userRepository; } public User getUserById(long id) { try { return userRepository.getUserById(id); } catch (Exception e) { // Log the exception here System.out.println("An error occurred while fetching the user: " + e.getMessage()); return null; } } } public class UserRepository { public User getUserById(long id) throws Exception { // Database query to fetch the user if (id < 0) { throw new Exception("Invalid user id"); } // Return the user object return new User(id, "John Doe"); } } public class User { private long id; private String name; public User(long id, String name) { this.id = id; this.name = name; } public long getId() { return id; } public String getName() { return name; } }