7 124
订阅者
-324 小时
-217 天
-10930 天
帖子存档
+1
CTS 2PM SLOT ✅✅
SLOT-1
CONTACT FOR ANY EXAM HELP @MLCODER2
+2
HASHEDIN BY DELOITTE EXAM DONE SUCCESSFULLY ✅✅✅
ALL CODES ✅✅
Contact: @MLCDER2
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int p = sc.nextInt();
if (p <= 0 p > 100) {
System.out.println("Invalid number of rows. Exiting program.");
return;
}
int q = sc.nextInt();
if (q <= 0 q > 100) {
System.out.println("Invalid number of columns. Exiting program.");
return;
}
int[][] matrix = new int[p][q];
for (int i = 0; i < p; i++) {
for (int j = 0; j < q; j++) {
matrix[i][j] = sc.nextInt();
}
}
int C = sc.nextInt();
if (C < 1 || C > q) {
System.out.println("Invalid column number. Exiting program.");
return;
}
sc.close();
int minElement = Integer.MAX_VALUE;
int columnIndex = C - 1;
for (int i = 0; i < p; i++) {
minElement = Math.min(minElement, matrix[i][columnIndex]);
}
System.out.println("The minimum element in column " + C + " is: " + minElement);
}
}
#Matrix_Column_Minimum_Finder
package Learn.com;
import java.util.Scanner;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int L = sc.nextInt();
int U = sc.nextInt();
sc.close();
if (L < 0 U < L U > 100) {
System.out.println("Invalid input! Please ensure 0 <= L <= U <= 100");
return;
}
Map<Integer, Integer> freqMap = new HashMap<>();
for (int i = L; i <= U; i++) {
for (int j = i + 1; j <= U; j++) {
int diff = Math.abs(i - j);
freqMap.put(diff, freqMap.getOrDefault(diff, 0) + 1);
}
}
int maxFrequency = 0;
int mostFrequentDiff = 0;
for (Map.Entry<Integer, Integer> entry : freqMap.entrySet()) {
if (entry.getValue() > maxFrequency) {
maxFrequency = entry.getValue();
mostFrequentDiff = entry.getKey();
}
}
System.out.println("Marathon Winner: " + mostFrequentDiff + " minutes (occurring " + maxFrequency + " times)");
}
}
#Marthon_Winner_Finder
IBM OFFLINE CODING ✅✅
PYTHON 7/7 CASES PASSED ✅
JAVA 5/7 CASES PASSED WITH THE DRIVER CODE NOT CONFIGURED PROPERLY ✅
