solution of problem B, codeforces contest 728, Div 2, O(N^2) Time

Author: NirmalSilwal

Codeforces/livecontest/Round728Div2/B.java

@@ -0,0 +1,91 @@
+package livecontest.Round728Div2;
+
+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();
+int[] arr = sc.readArray(n);
+solveTask(arr);
+}
+
+out.close();
+}
+
+private static void solveTask(int[] arr) {
+int count = 0;
+
+for (int i = 0; i < arr.length; i++) {
+
+for (int j = i + 1; j < arr.length; j++) {
+
+int ci = i + 1, cj = j + 1;
+
+if ((arr[i] * arr[j]) == (ci + cj))
+count++;
+}
+}
+System.out.println(count);
+}
+
+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;
+}
+}
+}