solution of problem B in Codechef Sept Starters 2021

Author: NirmalSilwal

Codechef/StartersSept2021/B.java

@@ -0,0 +1,94 @@
+package StartersSept2021;
+
+import java.io.PrintWriter;
+import java.io.BufferedReader;
+import java.io.InputStreamReader;
+import java.io.IOException;
+import java.util.StringTokenizer;
+
+public class B {
+
+	public static void main(String[] args) {
+
+		FastReader sc = new FastReader();
+		PrintWriter out = new PrintWriter(System.out);
+
+		int t = sc.nextInt();
+
+		for (int tt = 0; tt < t; tt++) {
+
+			int N = sc.nextInt(); // max tastiness, O TO N
+			int S = sc.nextInt(); // sum of T1 and T2
+
+			int ans = solveTask(N, S);
+			System.out.println(ans);
+		}
+		out.close();
+	}
+
+	private static int solveTask(int N, int S) {
+
+		int diff = 0;
+
+		for (int i = 0; i <= N; i++) {
+
+			int rest = S - i;
+
+			if (rest <= N && rest >= 0) {
+				diff = Math.abs(i - rest);
+			}
+		}
+
+		return diff;
+	}
+
+	static class FastReader {
+		BufferedReader br;
+		StringTokenizer st;
+
+		FastReader() {
+			br = new BufferedReader(new InputStreamReader(System.in));
+		}
+
+		String next() {
+			while (st == null || !st.hasMoreElements()) {
+				try {
+					st = new StringTokenizer(br.readLine());
+				} catch (IOException e) {
+					e.printStackTrace();
+				}
+			}
+			return st.nextToken();
+		}
+
+		int nextInt() {
+			return Integer.parseInt(next());
+		}
+
+		long nextLong() {
+			return Long.parseLong(next());
+		}
+
+		double nextDouble() {
+			return Double.parseDouble(next());
+		}
+
+		String nextLine() {
+			String str = "";
+			try {
+				str = br.readLine();
+			} catch (IOException e) {
+				e.printStackTrace();
+			}
+			return str;
+		}
+
+		int[] readArray(int n) {
+			int[] temparr = new int[n];
+			for (int i = 0; i < n; i++) {
+				temparr[i] = nextInt();
+			}
+			return temparr;
+		}
+	}
+}