본문 바로가기

Algorithms14

Count Consecutive Sums Example Input : 15 Output : 3 My answer: import java.util.*; class ConsecutiveSumCounter { public static void main(String[] args) { ConsecutiveSumCounter t = new ConsecutiveSumCounter(); Scanner kb = new Scanner(System.in); int n = kb.nextInt(); System.out.println(t.solution(n)); } int solution(int n) { int[] a = new int[n]; for(int i = 0; i < n; i++) { a[i] = i + 1; } int cnt = 0; for(int i = 0.. 2023. 12. 27.
Subarray Sum Example Input : 8 6 1 2 1 3 1 1 1 2 Output : 3 My answer: import java.util.*; class SubarraySumCounter { public static void main(String[] args) { SubarraySumCounter t = new SubarraySumCounter(); Scanner kb = new Scanner(System.in); int n = kb.nextInt(); int m = kb.nextInt(); int[] a = new int[n]; for(int i = 0; i < n; i++) { a[i] = kb.nextInt(); } System.out.println(t.solution(n,m,a)); } int sol.. 2023. 12. 25.
Matrix Analyzer Example Input : 5 2 3 1 7 3 4 1 9 6 8 5 5 2 4 4 6 5 2 6 7 8 4 2 2 2 Output : 4 My answer: import java.util.Scanner; class MatrixAnalyzer { public static void main(String[] args) { MatrixAnalyzer t = new MatrixAnalyzer(); Scanner kb = new Scanner(System.in); int n = kb.nextInt(); int[][] a = new int[n][n]; for(int i = 0; i < n; i++) { for(int j = 0; j < n; j++) { a[i][j] = kb.nextInt(); } } Syste.. 2023. 12. 21.
Array Analyzer Example Input : 5 5 3 7 2 3 3 7 1 6 1 7 2 5 3 4 4 3 6 4 1 8 7 3 5 2 Output : 10 My answer: import java.util.Scanner; class ArrayAnalyzer { public static void main(String[] args) { ArrayAnalyzer t = new ArrayAnalyzer(); Scanner kb = new Scanner(System.in); int n = kb.nextInt(); int[][] a = new int[n+2][n+2]; for(int i = 1; i 2023. 12. 19.