Loading...
Submission
# When Author Problem Language CPU Memory
20867 2024-06-13 00:18:36 AHAMMED_99 Game On Space Java 136 ms 40732 kb Wrong Answer - 4
Test Cases
# CPU Memory Points
1 102 ms 38748 kb 1 Accepted
2 102 ms 38728 kb 1 Accepted
3 136 ms 40732 kb 1 Accepted
4 102 ms 39148 kb 0 Wrong Answer
5 0 ms 0 kb 0 Skipped
6 0 ms 0 kb 0 Skipped
7 0 ms 0 kb 0 Skipped
8 0 ms 0 kb 0 Skipped
9 0 ms 0 kb 0 Skipped
10 0 ms 0 kb 0 Skipped
11 0 ms 0 kb 0 Skipped
12 0 ms 0 kb 0 Skipped
13 0 ms 0 kb 0 Skipped
14 0 ms 0 kb 0 Skipped
15 0 ms 0 kb 0 Skipped
16 0 ms 0 kb 0 Skipped
17 0 ms 0 kb 0 Skipped
18 0 ms 0 kb 0 Skipped
19 0 ms 0 kb 0 Skipped
20 0 ms 0 kb 0 Skipped
21 0 ms 0 kb 0 Skipped
22 0 ms 0 kb 0 Skipped
23 0 ms 0 kb 0 Skipped
24 0 ms 0 kb 0 Skipped
Source Code
  1. import java.util.*;
  2.  
  3. public class NWayLandGame {
  4. public static void main(String[] args) {
  5. Scanner scanner = new Scanner(System.in);
  6. int n = scanner.nextInt();
  7. long[] maxDistances = new long[n];
  8. for (int i = 0; i < n; i++) {
  9. maxDistances[i] = scanner.nextLong();
  10. }
  11. scanner.close();
  12.  
  13. // Check if Tajbin can win based on the maximum distances
  14. boolean tajbinWins = checkTajbinWin(maxDistances);
  15.  
  16. // Output the winner
  17. if (tajbinWins) {
  18. System.out.println("Tajbin");
  19. } else {
  20. System.out.println("Tanvir");
  21. }
  22. }
  23.  
  24. // Function to check if Tajbin can win based on the maximum distances
  25. private static boolean checkTajbinWin(long[] maxDistances) {
  26. // Check if the sum of maximum distances is odd
  27. long sum = 0;
  28. for (long distance : maxDistances) {
  29. sum += distance;
  30. }
  31. return sum % 2 != 0;
  32. }
  33. }
  34.