public class main { public static int main(int N, int[] S) { int m = S.length; int[][] dp = new int[m + 1][N + 1]; for (int i = 0; i <= m; i++) { dp[i][0] = 1; } for (int i = 1; i <= m; i++) { for (int j = 1; j <= N; j++) { if (S[i - 1] <= j) { dp[i][j] = dp[i][j - S[i - 1]] + dp[i - 1][j]; } else { dp[i][j] = dp[i - 1][j]; } } } return dp[m][N]; } public static void main(String[] args) { int N = 10; int[] S = {1, 2, 3}; int result = main(N, S); System.out.println(result); } } showing errror

public class Main { public static void main(String args[]) { int arr[] = {1, 2, 3}; int m = arr.length; int n = 10; System.out.println( countWays(arr, m, n)); } static long countWays(int S[], int m, int n) { long[] table = new long[n+1]; table[0] = 1; for (int i=0; i<m; i++) for (int j=S[i]; j<=n; j++) table[j] += table[j-S[i]]; return table[n]; } } i need 14 as output

public static void main(String[] args){  for (int i = 3; i <= 7; i++) {int num;if(i%2 == 0){num = 0;  for (int j = 1; j <= 4; j++)  {  System.out.print(num);  num = (num == 0)? 3 : 2;  }} else {num = 1;  for (int j = 1; j <= 3; j++){System.out.print(num);num = (num == 0)? 2 : 5;}  }  System.out.println();}}

import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int K = sc.nextInt(); int[] A = new int[N]; for (int i = 0; i < N; i++) { A[i] = sc.nextInt(); } Arrays.sort(A); int happyCount = 0; int j = 0; for (int i = 0; i < N; i++) { while (j < N && A[j] - A[i] < K) { j++; } if (j > i + 1) { happyCount++; } } System.out.println(happyCount); } } i need output as 5

#include <stdio.h>#include<stdlib.h>int main(){ int n; scanf("%d",&n); int a[n]; for(int i=0;i<n;i++){ scanf("%d",&a[i]); } int m=n/2;… printf("%d",a[j]); } for(int k=m;k<n;k++){ printf("%d",a[k]); } } }

#include<bits/stdc++.h> using namespace std; #define ll long long int #define f(n,m) for(int i=n; i<m; ++i) #define fj(n,m) for(int j=n; j<m; ++j) #define sp " " #define rf(n,m) for(int i=n-1; i>=m; --i) #define all(v) v.begin(),v.end() #define srt(nums) sort(nums.begin(), nums.end()); #define mx_e(nums) *max_element(nums.begin(), nums.end()) #define mn_e(nums) *min_element(nums.begin(), nums.end()) ll mod = (ll)1e9+7; vector<bool> sieve(ll n) { vector<bool> isPrime(n + 1, true); isPrime[0] = isPrime[1] = false; for (ll i = 2; i * i <= n; ++i) { if (isPrime[i]) { for (ll j = i * i; j <= n; j += i) { isPrime[j] = false; } } } return isPrime; } ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// // int help(int i, int j, vector<vector<int>>&grid){ // if(i<0 or j<0 or i) // } void solve(){ int n, m; cin >> n >> m; vector<string> arr(n); for (int i = 0; i < n; ++i) { cin >> arr[i]; } vector<vector<int>> dist(n, vector<int>(m, INT_MAX)); queue<pair<int, int>> q; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { if (arr[i][j] == '1') { dist[i][j] = 0; q.push({i, j}); } } } while (!q.empty()) { int x = q.front().first; int y = q.front().second; q.pop(); int offset[] = {0, -1, 0 ,1, 0}; for (int i = 0; i < 4; ++i) { int nx = x + offset[i]; int ny = y + offset[i+1]; if (nx >= 0 && nx < n && ny >= 0 && ny < m && dist[nx][ny] == INT_MAX) { dist[nx][ny] = dist[x][y] + 1; q.push({nx, ny}); } } } int ans = 0; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { ans = max(ans, dist[i][j]); } } cout << ans << endl; } int main(){ int t; cin >> t; while(t--){ solve(); } return 0; } check this code and correct it