Question:
import java.util.Scanner;
public class Main{

	public static void main(String[] args) {
		Scanner sc  = new Scanner(System.in);

		int n = sc.nextInt();
		int m = sc.nextInt();
		boolean [][]g = new boolean [n][n];

		for(int i = 0 ; i < n ; i++) {
			int a = sc.nextInt()-1;
			int b = sc.nextInt()-1;

			g[a][b] = true;
			g[b][a] = true;

		}
		boolean visit [] = new boolean [n];

		visit[0] = true;
		int count = dfs(n,0,g,visit);
		System.out.println(count);

	}
		private static int dfs(int n,int v ,boolean [][]g,boolean []visit) {

			boolean Allvisit = true;

			for(int i = 0 ;i < n ; i++) {
				if(!visit[i]) {
					Allvisit = false;
				}
			}

			if(Allvisit) {
				return 1;
			}
			int sum = 0;

			for(int i = 0; i < n ; i++) {
				if(!visit[i] && g[v][i]) {
					visit[i] = true;
					sum += dfs(n,i,g,visit);
					visit[i] = false;
				}

			}

			return sum;

			}
}

Choices:
- No abnormally found
- Internal error
- Runtime Error
- Compile Error


Question:
import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long N = sc.nextLong();
        long K = sc.nextLong();
        long sum = 0;
        for(long i = K; i <= N+1; i++){
            long max = 0;
            long min = 0;
            for(long j = 0; j < i; j++){
                max = max + N - j;
                min = min + j;
            }
            sum = sum + max - min + 1;
        }
        System.out.println(sum%(1000000000+7));
    }
}

Choices:
- Runtime Error
- Compile Error
- Time Limit Exceeded
- No abnormally found


Question:
import java.util.*;
import java.io.*;

public class E127 {
    public static void main(String[] args) {
        MyScanner sc = new MyScanner();
        PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
        int n = sc.nextInt(); int m = sc.nextInt(); int k = sc.nextInt();
        initFac(n * m);
        long choose = nck(n * m - 2, k - 2);
        long first = m * ((long) m * (m - 1)) / 2;
        first %= mod;
        first = (first - (((long)m - 1) * m * (2 * m - 1)) / 6);
        if (first < 0) first += mod;
        first = (first * ((long) n * n)) % mod;
        long second = n * ((long) n * (n - 1)) / 2;
        second %= mod;
        second = (second - (((long)n - 1) * n * (2 * n - 1)) / 6);
        if (second < 0) second += mod;
        second = (second * ((long) m * m)) % mod;
        long res = (choose * ((first + second) % mod)) % mod;
        res %= mod;
        if (res < 0) res += mod;
        out.println(res);
        out.close();
    }

    static long[] fac;
    static long mod = (long) 1e9 + 7;

    static void initFac(long n) {
        fac = new long[(int)n + 1];
        fac[0] = 1;
        for (int i = 1; i <= n; i++) {
            fac[i] = (fac[i - 1]  * i) % mod;
        }
    }

    static long nck(int n, int k) {
        if (n < k)
            return 0;
        long den = inv((int) (fac[k] * fac[n - k] % mod));
        return fac[n] * den % mod;
    }

    static long pow(long b, long e) {
        long ans = 1;
        while (e > 0) {
            if (e % 2 == 1)
                ans = ans * b % mod;
            e >>= 1;
            b = b * b % mod;
        }
        return ans;
    }

    static long inv(long x) {
        return pow(x, mod - 2);
    }

    //-----------MyScanner class for faster input----------
    public static class MyScanner {
        BufferedReader br;
        StringTokenizer st;

        public MyScanner() {
            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;
        }

    }

}

Choices:
- Compile Error
- Memory Limit Exceeded
- Time Limit Exceeded
- No abnormally found


Question:
import java.io.*;
import java.util.*;

public class A {
	static final StdIn in = new StdIn();
	static final PrintWriter out = new PrintWriter(System.out);

	public static void main(String[] args) {
		long a = in.nextLong();
		long b = in.nextLong();

		long c = in.nextLong();
		long d = in.nextLong();

		long a1 = a*c;
		long a2 = a*d;
		long a3 = b*c;
		long a4 = b*d;

		out.println(Math.max(Math.max(a1, a2), Math.max(a3, a4)));

        out.println();

		out.close();
    }

    static class Pair {
        int first = 1;
        int second = 2;
    }

    public void fibonacci(int N) {
        boolean arr[] = new boolean[N];
        Arrays.fill(arr, false);
        arr[0] = true;
        if(N>1)
            arr[1] = true;

        Pair p = new Pair();
        for (int i = 3; i <= N; i++) {

            if(p.first + p.second == i) {
                arr[i-1] = true;
                p.first = p.second;
                p.second = i;
            } else {
                arr[i-1] = false;
            }
        }
    }

    public class Solver {
		Solver() {

        }

    }

    static long factorial(long x) {
        if(x <= 1) {
            return 1;
        }
        long res = 2;
        for (int i = 3; i <= x; i++) {
            res = res * i;
        }
        return res;
    }

    static long gcdOfFactorial(long a, long b) {
        if (b == 0)
            return a;
        return gcdOfFactorial(b, a % b);
    }

	static class StdIn {
		final private int BUFFER_SIZE = 1 << 16;
		private DataInputStream din;
		private byte[] buffer;
		private int bufferPointer, bytesRead;
		public StdIn() {
			din = new DataInputStream(System.in);
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}
		public StdIn(InputStream in) {
			try{
				din = new DataInputStream(in);
			} catch(Exception e) {
				throw new RuntimeException();
			}
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}
		public String next() {
			int c;
			while((c=read())!=-1&&(c==' '||c=='\n'||c=='\r'));
			StringBuilder s = new StringBuilder();
			while (c != -1)
			{
				if (c == ' ' || c == '\n'||c=='\r')
					break;
				s.append((char)c);
				c=read();
			}
			return s.toString();
		}
		public String nextLine() {
			int c;
			while((c=read())!=-1&&(c==' '||c=='\n'||c=='\r'));
			StringBuilder s = new StringBuilder();
			while (c != -1)
			{
				if (c == '\n'||c=='\r')
					break;
				s.append((char)c);
				c = read();
			}
			return s.toString();
		}
		public int nextInt() {
			int ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do
				ret = ret * 10 + c - '0';
			while ((c = read()) >= '0' && c <= '9');

			if (neg)
				return -ret;
			return ret;
		}
		public int[] readIntArray(int n, int os) {
			int[] ar = new int[n];
			for(int i=0; i<n; ++i)
				ar[i]=nextInt()+os;
			return ar;
		}
		public long nextLong() {
			long ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do
				ret = ret * 10 + c - '0';
			while ((c = read()) >= '0' && c <= '9');
			if (neg)
				return -ret;
			return ret;
		}
		public long[] readLongArray(int n, long os) {
			long[] ar = new long[n];
			for(int i=0; i<n; ++i)
				ar[i]=nextLong()+os;
			return ar;
		}
		public double nextDouble() {
			double ret = 0, div = 1;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do
				ret = ret * 10 + c - '0';
			while ((c = read()) >= '0' && c <= '9');
			if (c == '.')
				while ((c = read()) >= '0' && c <= '9')
					ret += (c - '0') / (div *= 10);
			if (neg)
				return -ret;
			return ret;
		}
		private void fillBuffer() throws IOException {
			bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
			if (bytesRead == -1)
				buffer[0] = -1;
		}
		private byte read() {
			try{
				if (bufferPointer == bytesRead)
					fillBuffer();
				return buffer[bufferPointer++];
			} catch(IOException e) {
				throw new RuntimeException();
			}
		}
		public void close() throws IOException {
			if (din == null)
				return;
			din.close();
		}
	}
}

Choices:
- Compile Error
- No abnormally found
- Time Limit Exceeded
- Internal error


Question:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
  public static void main(String[] args) {
  	int n = in.nextInt();

    int sum = 0;
    for (int i = 1; i <= n; i++) {
      if (i % 3 == 0 || i % 5 == 0)
        continue;
      sum += i;
    }

    System.out.println(sum);
  }
}

Choices:
- No abnormally found
- Memory Limit Exceeded
- Time Limit Exceeded
- Compile Error


Question:
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main
{
    public static void main(String[] args)
    {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(1, in, out);
        out.close();
    }

    static class Task
    {
        public void solve(int testNumber, Scanner in, PrintWriter out)
        {
            int N = in.nextInt();
            int i = 1;
            long count = 0;
            while (i < N)
            {
                String s = Integer.toString(i);
                if (s.charAt(s.length() - 1) == '0')
                {
                    i++;
                    continue;
                }
                // 1 case
                if (s.length() == 1) count++;

                char first = s.charAt(0);
                char last = (s.length() == 1) ? s.charAt(0) : s.charAt(s.length() - 1);
                // 11 case
                if (s.length() >= 2 && first != '0' && first == last) count++;

                String[] append = {"", "9", "99", "999", "9999", "99999"};
                for (int j = 0; j < 5; j++)
                {
                    String n = new StringBuilder().append(last).append(append[j]).append(first).toString();
                    if (Integer.parseInt(n) < N)
                    {
                        count += Math.pow(10, j);
                    } else if (n.length() == Integer.toString(N).length())
                    {
                        int z = 0;
                        StringBuilder sb = new StringBuilder().append("%0").append(j).append("d");
                        while (Integer.parseInt(String.format(sb.toString(), z)) <= Integer.parseInt(append[j]))
                        {
                            if (Integer.parseInt(new StringBuilder().append(last).append(String.format(sb.toString(), z)).append(first).toString()) < N)
                            {
                                count++;
                            } else
                                break;
                            z++;
                        }
                    }
                }
                i++;
            }
            out.print(count);
        }

    }
}

Choices:
- Time Limit Exceeded
- Memory Limit Exceeded
- Internal error
- Runtime Error


Question:
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main
{
    public static void main(String[] args)
    {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(1, in, out);
        out.close();
    }

    static class Task
    {
        public void solve(int testNumber, Scanner in, PrintWriter out)
        {
            int N = in.nextInt();
            int i = 1;
            long count = 0;
            while (i < N)
            {
                String s = Integer.toString(i);
                if (s.charAt(s.length() - 1) == '0')
                {
                    i++;
                    continue;
                }
                // 1 case
                if (s.length() == 1) count++;

                char first = s.charAt(0);
                char last = (s.length() == 1) ? s.charAt(0) : s.charAt(s.length() - 1);
                // 11 case
                if (s.length() >= 2 && first != '0' && first == last) count++;

                String[] append = {"", "9", "99", "999", "9999", "99999"};
                for (int j = 0; j < 6; j++)
                {
                    String n = new StringBuilder().append(last).append(append[j]).append(first).toString();
                    if (Integer.parseInt(n) < N)
                    {
                        count += Math.pow(10, j);
                    } else if (n.length() == Integer.toString(N).length())
                    {
                        int z = 0;
                        StringBuilder sb = new StringBuilder().append("%0").append(j).append("d");
                        while (Integer.parseInt(String.format(sb.toString(), z)) <= Integer.parseInt(append[j]))
                        {
                            //System.out.println(i + "," + Integer.parseInt(String.format(sb.toString(), z)));
                            if (Integer.parseInt(new StringBuilder().append(last).append(String.format(sb.toString(), z)).append(first).toString()) < N)
                            {
                                count++;
                            } else
                                break;
                            z++;
                        }
                    }
                }
                i++;
            }
            out.print(count);
        }

    }
}

Choices:
- Time Limit Exceeded
- No abnormally found
- Compile Error
- Runtime Error


Question:
import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		Scanner scn = new Scanner(System.in);

		int x = scn.nextInt();
		int y = scn.nextInt();
		int cnt = 0;

		if(Math.abs(x) > Math.abs(y) && x > 0 && y >= 0) {
			x = -x;
			cnt++;
		} else  if(Math.abs(x) > Math.abs(y) && x > 0 && y <= 0) {
			x = -x;
			cnt++;
		} else if(Math.abs(x) < Math.abs(y) && x <= 0 && y > 0) {
			x = -x;
			cnt++;
		} else if(Math.abs(x) < Math.abs(y) && x < 0 && y <= 0) {
			x = -x;
			cnt++;
		}

		while(Math.abs(x) != Math.abs(y)){
			x++;
			cnt++;
		}

		if(x == -y && (x > 0 || x < 0) cnt++;

		System.out.println(cnt);
	}
}

Choices:
- No abnormally found
- Time Limit Exceeded
- Compile Error
- Internal error


Question:
import java.util.Scanner;
public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ

			//Scannerクラスのインスタンスの生成
			Scanner sc = new Scanner(System.in);
			int num = sc.nextInt();
	        String str = Integer.toString(num);
	        String []r = str.split("");

	        if (r[0].equals(r[1]) || r[1].equals(r[2]) || r[2].equals(r[3])) {
	        	System.out.println("Bad");
	        } else {
	        	System.out.println("Good");
	        }

	}

}

Choices:
- Internal error
- Compile Error
- No abnormally found
- Runtime Error


Question:
package atCoder;
import java.util.Scanner;
public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ

		Scanner sc = new Scanner(System.in);

		String a = sc.next();
		String b = sc.next();
		String c = sc.next();
		String d = sc.next();

		if (a.equals(b) || b.equals(c) || c.equals(d)) {
			System.out.println("Bad");
			} else {
				System.out.println("Good");
				}

	}

}

Choices:
- Internal error
- Compile Error
- Time Limit Exceeded
- Runtime Error


Question:
import java.util.*;

public class Main {
  public static void main(String args[]) {
    Scanner sc = new Scanner(System.in);

    int N = sc.nextInt();
    int x = sc.nextInt();
    int[] flag = new int[1000000000];

    for (int i = 0; i < N; i++) {
      int a = sc.nextInt();
      flag[a-1] = 1;
    }

    int count = 0;

    for (int i = 0; i < flag.length; i++) {
      if (flag[i] == 1) {
        x = x - i - 1;
        if (x < 0) {
          break;
        }

        count++;
      }
    }

    if (x > 0) {
      count--;
    }

    System.out.println(count);
  }
}

Choices:
- Memory Limit Exceeded
- Time Limit Exceeded
- Internal error
- Runtime Error


Question:
import java.util.*;
import java.awt.*;

public class Main {
  public static void main(String args[]) {
    Scanner sc = new Scanner(System.in);

    int N = sc.nextInt();
    int x = sc.nextInt();
    int[] flag = new int[1000000000];

    for (int i = 0; i < N; i++) {
      int a = sc.nextInt();
      flag[a-1] = 1;
    }

    int count = 0;

    for (int i = 0; i < flag.length; i++) {
      if (flag[i] == 1) {
        x = x - i - 1;
        if (x < 0) {
          break;
        }

        count++;
      }
    }

    if (x > 0) {
      count--;
    }

    System.out.println(count);
  }
}

Choices:
- Time Limit Exceeded
- Runtime Error
- Internal error
- Memory Limit Exceeded


Question:
import java.util.*;

public class Main {
  public static void main(String args[]) {
    Scanner sc = new Scanner(System.in);

    int n = sc.nextInt();
    String[][] str = new String[n][n];

    for (int i=0; i < n; i++) {
      String tmpStr = sc.next();

      for (int j=0; j < n; j++) {
        str[i][j] = String.valueOf(tmpStr.charAt(j));
      }
    }

    int count = 0;
    String[][] secondStr = new String[n][n];

    for (int A=0; A < n; A++) {
      for (int B=0; B < n; B++) {

        for (int i=0; i < n; i++) {
          for (int j=0; j < n; j++) {
            secondStr[i][j] = str[(i+A)%n][(j+B)%n];
          }
        }

        boolean ans = true;

        for (int i=0; i < n; i++) {
          for (int j=0; j < n; j++) {
            if (!(secondStr[i][j].equals(secondStr[j][i]))) {
              ans = false;
            }
          }
        }

        if (ans == true) count++;
      }
    }

    System.out.println(count);
  }
}

Choices:
- Memory Limit Exceeded
- Time Limit Exceeded
- Runtime Error
- Internal error


Question:
import java.util.*;

public class Main {
  public static void main(String args[]) {
    Scanner sc = new Scanner(System.in);

    int n = sc.nextInt();
    int[] count = new int[5];

    for (int i = 0; i < n; i++) {
      String str = String.valueOf(sc.next().charAt(0));

      if (str.equals("M")) {
        count[0]++;
      } else if (str.equals("A")) {
        count[1]++;
      } else if (str.equals("R")) {
        count[2]++;
      } else if (str.equals("C")) {
        count[3]++;
      } else if (str.equals("H")) {
        count[4]++;
      }
    }

    long ans = 0;

    for (int i = 0; i < 3; i++) {
      for (int j = i+1; j < 4; j++) {
        for (int k = j+1; k < 5; k++) {
          ans += long(count[i] * count[j] * count[k]);
        }
      }
    }

    System.out.println(ans);
  }
}

Choices:
- Compile Error
- No abnormally found
- Runtime Error
- Memory Limit Exceeded


Question:
import java.math.*;
import java.util.*;
public class Main
{
  public static void main(String args[])
  {
    BigInteger b=in.nextBigInteger();
    if(b.isProbablePrime(70)==true)
    {
      System.out.println(b);
    }
    else
    {
      System.out.println(b.nextProbablePrime());
    }
  }
}

Choices:
- Runtime Error
- Internal error
- No abnormally found
- Compile Error


Question:
import java.util.Scanner;

class Main{
 public static void main(String[] args){
   Scanner scanner = new Scanner(System.in);
   int a = scanner.nextInt();
   int b = scanner.nextInt();
   int c = scanner.nextInt();
   int d = scanner.nextInt();

   int[] a= new int[]{a*c,a*d,b*c,b*d};

   int num = a[0];

   for(int i=1;i<4;i++) if(num > a[i]) num = a[i];

   System.out.println(num);

 }

}

Choices:
- Time Limit Exceeded
- Runtime Error
- Memory Limit Exceeded
- Compile Error


Question:
import java.util.Scanner;

class Main{
 public static void main(String[] args){
   Scanner scanner = new Scanner(System.in);
   int a = scanner.nextInt();
   int b = scanner.nextInt();
   int c = scanner.nextInt();
   int d = scanner.nextInt();

   int[] e= new int[]{a*c,a*d,b*c,b*d};

   int num = e[0];

   for(i=1;i<4;i++) if(num > e[i]) num = e[i];

   System.out.println(num);

 }

}

Choices:
- Compile Error
- Time Limit Exceeded
- No abnormally found
- Runtime Error


Question:
import java.util.Scanner;

class Main{
  public static void main(String[] args){
  	Scanner scanner = new Scanner(System.in);
    int count=0;
	int num1= scanner.nextInt();
    int num2= scanner.nextInt();

    int[][] a = new int[2][num1];
    for(int i=0;i<num1;i++) for(int k=0;k<2;k++) a[i][k] =scanner.nextInt();
    scanner.close();

    for(int i=0;i<num1;i++) if(Math.sqrt( Math.pow(a[i][0],2) + Math.pow(a[i][1],2) ) >= num2) count++;
    System.out.println(count);
  }
}

Choices:
- Memory Limit Exceeded
- Internal error
- Time Limit Exceeded
- Runtime Error


Question:
/*
* @Author Silviase(@silviasetitech)
* For ProCon
*/

import java.util.*;
import java.lang.*;
import java.math.*;
import java.awt.*;

public class Main{

    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        PriorityQueue<Long> pribig = new PriorityQueue<>(Comparator.naturalOrder());
        PriorityQueue<Long> prismall = new PriorityQueue<>(Comparator.reverseOrder());
        long big = 0;
        long small = 0;
        long b = 0;
        long ans;
        for (int i = 0; i < n; i++) {
            int tmp = sc.nextInt();
            if (tmp == 1) {
                // koushin
                long a = sc.nextLong();
                long bb = sc.nextLong();
                b += bb;
                if (!prismall.isEnpty() || prismall.peek() >= a) {
                    // prismall.peek -> pribig, a -> prismall
                    prismall.add(a);
                    small+=a;
                    if (!prismall.isEmpty() && prismall.size() > pribig.size() + 1 ) {
                        long change = prismall.poll;
                        pribig.add(change);
                        small -= change;
                        big += change;
                    }
                }
            }else if(tmp == 2){
                // hanbetsu
                // small = big or small = big + 1
                if (prismall.size() == pribig.size()){
                    ans = prismall.peek();
                    System.out.println(ans + " " + (big-small+b));
                }else{
                    ans = prismall.peek();
                    System.out.println(ans + " " + (big-small+b-prismall.peek()));
                }
            }

        }

        sc.close();
    }
}

Choices:
- Memory Limit Exceeded
- Internal error
- No abnormally found
- Compile Error


Question:
/*
* @Author Silviase(@silviasetitech)
* For ProCon
*/

import java.util.*;
import java.lang.*;
import java.math.*;
import java.awt.*;

public class Main{

    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        ArrayList<Integer> pri = new ArrayList<>();
        long b = 0;
        for (int i = 0; i < n; i++) {
            int tmp = sc.nextInt();
            if (tmp == 1) {
                // koushin
                int a = sc.nextInt();
                int bb = sc.nextInt();
                pri.add(a);
                b += (long)bb;
            }else if(tmp == 2){
                // hanbetsu
                long big = 0;
                long small = 0;
                long ans = 0;
                Collections.sort(pri);
                int size = pri.size();
                    if (size % 2 == 0) {
                        for (int j = 0; j < size; j++) {
                            if (j < size/2) {
                                small += (long)pri.get(j);
                                if (j == size/2 - 1) {
                                    ans = (long)pri.get(j);
                                }
                            }else{
                                big += (long)pri.get(j);
                            }
                        }
                    }else{
                        for (int j = 0; j < size; j++) {
                            if (j < size/2) {
                                small += (long)pri.get(j);
                            }else if(j > size/2){
                                big += (long)pri.get(j);
                            }else{
                                ans = (long)pri.get(j);
                            }
                        }
                    }
                System.out.println(ans+" "+  (big - small + b) );
            }
        }

        sc.close();
    }

static class Mathalgo{
    static int n;
    static long MOD = 1000000007;
    static int MAX = 510000;
    static long[] finv = new long[MAX];
    static long[] inv = new long[MAX];
    static long[] fac = new long[MAX];

    public static String make_bi_nari(int nbit, int num_to_binary) {
        String res = Integer.toBinaryString(num_to_binary);
        while(res.length() != nbit){
            res = "0" + res;
        }
        return res;
    }

    public static long fib(int x) {
        long[] fib = new long[x+1];
        fib[0] = 0; fib[1] = 1;
        for (int i = 2; i <= x; i++) {
            fib[i] = fib[i-1] + fib[i-2];
        }
        return fib[x];
    }

    public static int ManhattanDist(int x, int y, int xx, int yy) {
        return(Math.abs(xx-x) + Math.abs(yy-y));
    }

    static long modpow(long a, long n, long mod) {
        long res = 1;
        while (n > 0) {
            if (n % 2 == 1) res = res * a % mod;
            a = a * a % mod;
            n >>= 1;
        }
        return res;
    }

    static long modinv(long a, long mod) {
        return modpow(a, mod - 2, mod);
    }

    static void nCkmake() {
        fac[0] = fac[1] = 1;
        finv[0] = finv[1] = 1;
        inv[1] = 1;
        for (int i = 2; i < MAX; i++){
            fac[i] = fac[i - 1] * i % MOD;
            inv[i] = MOD - inv[(int)MOD%i] * (MOD / i) % MOD;
            finv[i] = finv[i - 1] * inv[i] % MOD;
        }
    }

    static long nCk(int n, int k){
        if (n < k) return 0;
        if (n < 0 || k < 0) return 0;
        return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
    }

    public static long gcd_long(long a, long b) {
        if (a < b) {
            long x = a;
            a = b;
            b = x;
        }
        if (b == 0) {
            return a;
        }else{
            return gcd_long(b, a%b);
        }
    }

    public static long lcm_long(long a, long b) {
        long gcd = gcd_long(a,b);
        return a/gcd*b;
    }

    public static long GyakuGenMOD(long a) {
        return RepSquareMethod(a, MOD-2);
    }

    public static long factmod(int a) {
        long[] fact = new long[a+1];
        fact[0] = fact[1] = 1;
        for (int i = 2; i <= a; i++) {
            fact[i] = (fact[i-1]*i)%MOD;
        }
        return fact[a];
    }

    public static long RepSquareMethod(long a, long n) { // a^n
        long ans = 1;
        while (n > 0) {
            if ( n % 2 == 1) {
                ans = (ans * a) % MOD;
            }
            a = (a*a)%MOD;
            n/=2;
        }
        return ans;
    }
}
}

Choices:
- Runtime Error
- Internal error
- Time Limit Exceeded
- No abnormally found


Question:
/*
* Author. Silviase(@silviasetitech)
* For AtCoder
*/

import java.util.*;
import java.lang.*;
import java.math.*;

public class Main {

    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);

        int a = sc.nextInt();
        int b = sc.nextInt();
        int k = sc.nextInt();
        int counter = 0;
        int ans = Math.max(a, b);
        while (counter != k) {
            ans--;
            if (a % ans == 0 && b % ans == 0) {
                counter++;
            }
        }
        System.out.println(ans);

        sc.close();
    }

    public static long gcd(Long m, long n) {
        if(m < n) {
            return gcd(n, m);
        }
        if(n == 0){
            return m;
        }
        return gcd(n, m % n);
    }

    public static long[][] Combination_nCk(long n, long k) {
        n++; k++;
        long[][] ans = new long[(int)n][(int)k];
        for (int i = 0; i < n; i++) {
            ans[i][0] = 1;
        }
        for (int i = 0; i < n-1; i++) {
            for (int j = 0; j < k-1; j++) {
                if (i < j) {
                    ans[i][j] = 0;
                }else{
                    ans[i+1][j+1] = ans[i][j] + ans[i][j+1];
                }
            }
        }
        return ans;
    }

    public static double[][] Probability_nCk(int n, int k) {
        n++; k++;
        double[][] ans = new double[n][k];
        for (int i = 0; i < n; i++) {
            if (i == 0) {
                ans[i][0] = 1;
            }else{
                ans[i][0] = ans[i-1][0]/2;
            }
        }
        for (int i = 0; i < n-1; i++) {
            for (int j = 0; j < k-1; j++) {
                if (i < j) {
                    ans[i][j] = 0;
                }else{
                    ans[i+1][j+1] = (ans[i][j] + ans[i][j+1])/2;
                }
            }
        }
        return ans;
    }
}

Choices:
- No abnormally found
- Memory Limit Exceeded
- Compile Error
- Runtime Error


Question:
/*
* Author. Silviase(@silviasetitech)
* For AtCoder
*/

import java.util.*;
import java.lang.*;
import java.math.*;

public class Main {
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] ar = new int[n];
        intArrayScan(ar);
        Arrays.sort(ar);
        int sum = 0;
        for (int i = 0; i < n-1; i++) {
            sum += ar[i];
        }
        if (sum > ar[n-1]) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

        sc.close();

    }

    public static void intArrayScan(int[] array) {
        Scanner sc = new Scanner(System.in);
        for (int i = 0; i < array.length; i++) {
            array[i] = sc.nextInt();
        }
        sc.close();
    }

    public static void intArrayPrint(int[] array) {
        for (int i = 0; i < array.length; i++) {
            System.out.println(array[i]);
        }
    }

    public static void intSquareArrayScan(int[][] array, int h, int w) {
        Scanner sc = new Scanner(System.in);
        for (int i = 0; i < h; i++) {
            for (int j = 0; j < w; j++) {
                array[i][j] = sc.nextInt();
            }
        }
        sc.close();
    }

    public static void intArrayListScan(List<Integer> list, int n) {
        Scanner sc = new Scanner(System.in);
        for (int i = 0; i < n; i++) {
            list.add(sc.nextInt());
        }
        sc.close();
    }

    public static void intArrayListPrint(List<Integer> list) {
        for (int i = 0; i < list.size(); i++) {
            System.out.println(list.get(i));
        }
    }
}

Choices:
- No abnormally found
- Compile Error
- Runtime Error
- Time Limit Exceeded


Question:
import java.util.Scanner;
import java.util.Arrays;
import java.util.ArrayList;
import java.util.List;
import java.util.Collections;

public class Main {
	public static void main(String args[]){
		    Scanner sc = new Scanner(System.in);

			int n = sc.nextInt();
			if (n == 22) {
				System.out.println("Christmas Eve Eve Eve");
			}else if (n == 23) {
				System.out.println("Christmas Eve Eve");
			}else if (n == 24) {
				System.out.println("Christmas Eve");
			}else{
				System.out.println("Christmas");
			}

}

Choices:
- Compile Error
- Runtime Error
- Internal error
- Memory Limit Exceeded


Question:
public class Main {
	  public static void main(String args[]) {
		    Scanner scanner = new Scanner(System.in);
		    int A1 = scanner.nextInt();
		    int A2 = scanner.nextInt();
		    int A3 = scanner.nextInt();

		    int max = A1;
		    int min = A1;
		    if(A2 > max)
		    {
		    	max = A2;
		    }
		    if(A2 < min)
		    {
		    	min = A2;
		    }
		    if(A3 > max)
		    {
		    	max = A3;
		    }
		    if(A3 < min)
		    {
		    	min = A3;
		    }
		    System.out.println(max - min);
		    scanner.close();}
		  }

Choices:
- Compile Error
- Runtime Error
- No abnormally found
- Internal error


Question:
/*
* @Author Silviase(@silviasetitech)
* For ProCon
*/

import java.util.*;
import java.lang.*;
import java.math.*;

class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);

        String s = sc.next();
        String t = sc.next();
        boolean b = false;
        for (int i = 0; i < n; i++) {
            if ((s.substring(i) + s.substring(0,i)).equals(t)){
                b = true;
            }
        }
        if (b) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

        sc.close();
    }

}

Choices:
- Memory Limit Exceeded
- No abnormally found
- Compile Error
- Runtime Error


Question:
package fairness;

import java.util.*;

public class Main {
    public static void valueOf (String[] s) {
    Scanner sc = new Scanner(System.in);
    long A,B = 0,C = 0,K = Integer.valueOf(sc.next());

       for(int i = 1; i<K; i++);
       A = B + C;
       B = C + A;
       C = A + B;
       if(A > 1000000000);{
   	System.out.println("Unfair");
       }
       if(A < 1000000000);
       {
    	   System.out.println(A - B);
       }

                };

    }

Choices:
- No abnormally found
- Time Limit Exceeded
- Runtime Error
- Memory Limit Exceeded


Question:
package fairness;

import java.io.*;
import java.util.*;

public class Main {
    public static void valueOf (String[] s) {
    Scanner sc = new Scanner(System.in);
    long A,B = 0,C = 0,K = Integer.valueOf(sc.next());

       for(long i = 1; i<K; i++);
       A = B + C;
       B = C + A;
       C = A + B;
       if(A > 1000000000);{
   	System.out.println("Unfair");
       }
       if(A < 1000000000);
       {
    	   System.out.println(A - B);
       }

                };

    }

Choices:
- Memory Limit Exceeded
- Internal error
- Compile Error
- Runtime Error


Question:
package fairness;

import java.io.*;
import java.util.*;

public class Main {
    public static long valueOf (String[] s) {
    Scanner sc = new Scanner(System.in);
    long A,B = 0,C = 0,K = Integer.valueOf(sc.next());

       for(long i = 1; i<K; i++);
       A = B + C;
       B = C + A;
       C = A + B;
       if(A > 1000000000);{
   	System.out.println("Unfair");
       }
       if(A < 1000000000);
       {
    	   System.out.println(A - B);
       }

                };

    }

Choices:
- Compile Error
- Internal error
- No abnormally found
- Runtime Error


Question:
import java.io.*;
import java.util.*;

public class Main {
    public static long parseLong (String[] args) {
    Scanner sc = new Scanner(System.in);
    long A,B = 0,C = 0,K = Integer.parseLong(sc.next());

       for(long i = 1; i<K; i++);
       A = B + C;
       B = C + A;
       C = A + B;
       if(A > 1000000000000000000);{
   	System.out.println("Unfair");
       }
       if(A < 1000000000000000000);
       {
    	   System.out.println(A - B);
       }

                };

    }

Choices:
- Memory Limit Exceeded
- Time Limit Exceeded
- Compile Error
- No abnormally found


Question:
/*
* @Author Silviase(@silviasetitech)
* For ProCon
*/

import java.util.*;
import java.lang.*;
import java.math.*;

class Main{

    static int n;
    static int c;
    static int k;
    static int lef;
    static int rig;
    static String s;
    static String anss;
    static int[] times;
    static long ans;
    static int[] w;
    static int[] ww;
    static boolean[] visit;
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);

        n = sc.nextInt();
        ans = 0;
        String[] st = new String[n];
        long[] m = new long[5];
        for (int i = 0; i < n; i++) {
            st[i] = sc.next();
            if (st[i].charAt(0) == 'M') {
                m[0]++;
            }
            if (st[i].charAt(0) == 'A') {
                m[1]++;
            }
            if (st[i].charAt(0) == 'R') {
                m[2]++;
            }
            if (st[i].charAt(0) == 'C') {
                m[3]++;
            }
            if (st[i].charAt(0) == 'H') {
                m[4]++;
            }
        }

        System.out.println(
            m[0]*m[1]*(m[2]+m[3]+m[4]) + m[0]*m[2]*(m[3]+m[4]) + m[0]*m[3]*m[4]
                +m[1]*m[2]*(m[3]+m[4]) + m[1]*m[3]*m[4] + m[2]*m[3]*m[4]
        );

        sc.close();
    }

    public static long gcd(long a, long b) {

        if (a < b) {
            long tmpp = a;
            a = b;
            b = tmpp;
        }
        if (b == 0) {
            return a;
        }else{
            return gcd(b, a%b);
        }
    }

    public static long lcm(long a, long b) {
        long gcd = gcd(a,b);
        return a/gcd*b;
    }

    public static void dfs(int placenow) {
        // if went all -> success!
        // if not went all -> fail...

        /*
         dfs
         Go All Place that there is way to and not having been yet.

         if island 1 is start point, dfs(1);
         if there is way to island 2 and island 3,
         - island 2 changes non-visited -> visited, and dfs(2).
         - island 3 changes non-visited -> visited, and dfs(3).

        */

        visit[placenow] = true;
        boolean success = true;
        for (int i = 0; i < n; i++) {
            if (visit[i] == false) { // not go all place
                success = false;
                break;
            }
        }
        if (success) {
            ans++;
            visit[placenow] = false;
            return;
        }

        for (int i = 0; i < m; i++) {
            if (w[i] == placenow && visit[ww[i]] == false ) {
                dfs(ww[i]);
            }else if(ww[i] == placenow && visit[w[i]] == false){
                dfs(w[i]);
            }else{
                continue;
            }
        }
        visit[placenow] = false;
        return;
    }

}

Choices:
- Internal error
- Runtime Error
- Compile Error
- No abnormally found


Question:
package atcoder;

import java.util.Scanner;

public class Main {

	public static void main(String args[]) {
		    Scanner sc = new Scanner(System.in);

		    int n = sc.nextInt();
		    int a = sc.nextInt();
		    int b = sc.nextInt();
		    int count = 0;

		    if(n == 1) {
		    	if(a != b) {
		    		count = 0;
		    	}else {
		    		count = 1;
		    	}
		    }else {
		    	if(a > b) {
		    		count = 0;
		    	}else {
		    		count = ((b-a)*(n-2)+1);
		    	}
		    }
		    System.out.println(count);

		    sc.close(); }
}

Choices:
- Memory Limit Exceeded
- Compile Error
- Runtime Error
- Time Limit Exceeded


Question:
import java.util.*;
import java.math.*;
import java.io.*;
import java.lang.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] ar = new int[n];
        int res = 0;
        for (int i = 0; i < n; i++) {
            ar[i] = sc.nextInt();
        }
        // 前から貪欲に
        boolean f = (ar[1]>ar[0]);
        for (int i = 2; i < n; i++) {
            if(f){
                // 増加
                if(ar[i] >= ar[i-1]){
                    res++;
                }else{
                    f = !f;
                }
            }else{
                // 減少
                if(ar[i] <= ar[i-1]){
                    res++;
                }else{
                    f = !f;
                }
            }
        }
        System.out.println(res);

        sc.close();
    }
}

class io {
    public static void br() {
        System.out.println("");
    }

    public static void yesno(boolean f) {
        System.out.println(f ? "yes" : "no");
    }

    public static void YesNo(boolean f) {
        System.out.println(f ? "Yes" : "No");
    }

    public static void YESNO(boolean f) {
        System.out.println(f ? "YES" : "NO");
    }

}

class Algo {
    public static int nibutan(int target, int[] ar) {
        // ar[i] >= target なる最小のiを探す
        int res;
        int high = ar.length;
        int low = 0;
        while (high > low) {
            res = (high + low) / 2;
            if (ar[res] < target) {
                // ↑↓ここを変える
                low = res + 1;
            } else {
                // ↓ここを変える
                high = res;
            }
        }
        return low;
    }

    public static boolean isOdd(int n) {
        return n % 2 == 1;
    }

    public static boolean isEven(int n) {
        return n % 2 == 0;
    }

}

Choices:
- Memory Limit Exceeded
- Time Limit Exceeded
- Internal error
- Runtime Error


Question:
import java.io.InputStream;
import java.io.PrintStream;
import java.util.*;

public class Main {
    public static void main(String[] args) throws Exception {
        solve(System.in, System.out);
    }

    static void solve(InputStream is, PrintStream os) {
        // Your code here!
        Scanner scan = new Scanner(is);
        int N = scan.nextInt();
        HashMap<Integer, Set<Integer>> graph = new HashMap<>();
        for (int i = 0; i < N; i++) {
            graph.put(i, new HashSet<>());
        }

        for (int i = 0; i < Math.ceil(N / 2.0); i++) {
            String S = scan.next();
            char sChar[] = S.toCharArray();
            for (int j = 0; j < sChar.length; j++) {
                if (sChar[j] == '1') {
                    graph.get(i).add(j);
                    graph.get(j).add(i);
                }
            }
        }

        int min = 1000;//N <= 200
        long answer = -1;
        for (int i = 0; i < graph.size(); i++) {

            answer = Math.max(answer, depth(i, graph, N));
        }
        os.println(answer);

    }

    private static long depth(int start, Map<Integer, Set<Integer>> graph, int N) {
        ArrayList<Integer> firstGp = new ArrayList<>();
        HashSet<Integer> secondGp = new HashSet<>();
        HashSet<Integer> visited = new HashSet<>();
        firstGp.add(start);
        long count = 0;
        HashMap<Integer, Set<Integer>> tempGraph = new HashMap<>();
        for (int j = 0; j < N; j++) {
            tempGraph.put(j, new HashSet<>(graph.get(j)));
        }
        while (!firstGp.isEmpty()) {
            count++;
            for (Integer pos : firstGp) {
                visited.add(pos);
                for (Integer childPos : tempGraph.get(pos)) {
                    if (visited.contains(childPos)) {
                        return -1;
                    }
                    secondGp.add(childPos);
                }
            }
            for (Integer deletePos : firstGp) {
                for (Integer pos : secondGp) {
                    tempGraph.get(pos).remove(deletePos);
                }
            }
            firstGp.clear();
            firstGp.addAll(secondGp);
            secondGp.clear();
        }
        return count;
    }
}

Choices:
- No abnormally found
- Memory Limit Exceeded
- Internal error
- Runtime Error


Question:
package abc140.c;

import java.io.InputStream;
import java.io.PrintStream;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) throws Exception {
        solve(System.in, System.out);
    }

    static void solve(InputStream is, PrintStream os) {
        // Your code here!
        Scanner scan = new Scanner(is);
        int N = scan.nextInt();
        int B[] = new int[N-1];
        for(int i = 0; i < N-1 ; i++) {
            B[i] = scan.nextInt();
        }
        int answer = 0;
        if(N == 2) {
            answer += B[0] + B[0];
        }
        for(int i = 1; i < N-1 ; i++) {
            if(B[i] > B[i-1]) {
                answer += B[i-1];
                if(i == 1)
                    answer += B[i-1];
            } else {
                answer += B[i];
                if(i == 1)
                    answer += B[i];
            }
            if(i == N-2) {
                answer += B[i];
            }
        }
        os.println(answer);
    }
}

Choices:
- Compile Error
- Time Limit Exceeded
- Runtime Error
- Memory Limit Exceeded


Question:
import java.util.*;

class Main{
	public static void main(String[] args){
    	Scanner sc = new Scanner(System.in);
      	//String[] foo = sc.nextLine().split("");
      	int temp = 0;
      	String str = "Good";
      	for(int i = 0; i < 4; i++){
      		int hoge = sc.nextInt();
        	if(temp==hoge){
            	str = "Bad";
              	break;
            }
          	temp = hoge;
        }

      	System.out.println(str);
    }
}

Choices:
- Runtime Error
- Internal error
- Memory Limit Exceeded
- Compile Error


Question:
import java.util.*;

class Main{
	public static void main(String[] args){
    	Scanner sc = new Scanner(System.in);
      	int[] hoge = sc.nextLine("");
      	int temp = 0;
      	String str = "Good";
      	for(int i = 0; i < 4; i++){
        	if(temp==hoge[i]){
            	str = "Bad";
            }
          	temp = hoge[i];
        }

      	System.out.println(str);
    }
}

Choices:
- No abnormally found
- Compile Error
- Memory Limit Exceeded
- Runtime Error


Question:
import java.util.*;

class Main{
	public static void main(String[] args){
    	Scanner sc = new Scanner(System.in);
      	int p = sc.nextInt();
      	int q = sc.nextInt();
      	int r = sc.nextInt();

      	int[] hoge = {p, q, r};
      	Array.sort(hoge);
      	System.out.println(hoge[0] + hoge[1]);
    }
}

Choices:
- Runtime Error
- Compile Error
- Time Limit Exceeded
- Memory Limit Exceeded


Question:
//
import java.math.*;
import java.util.*;
import java.io.*;

public class Main {

    static BufferedReader in;
    static String file = "../in";
    static int test = 10; // 0 for local testing, 1 for std input
    static int inf = 1_000_000;

    static String[] split() throws Exception
    {
        return in.readLine().split(" ");
    }

    static int readInt() throws Exception
    {
        return Integer.valueOf(in.readLine());
    }

    public static void main(String[] args) throws Exception
    {
        int test = 0,   // 0 for local testing, 1 for std input
            _k = Integer.valueOf("1");
        if(test > 0) in = new BufferedReader(new InputStreamReader(System.in));
        else in = new BufferedReader(new FileReader(file));
        if(test < 0) {String[] str = in.readLine().split(" ");}
/***********************************************************************/
/***********************************************************************/
/***********************************************************************/
/***********************************************************************/
        new Main().a();
    }

    void f() throws Exception
    {
        String[] sp = in.readLine().split(" ");
        int n = Integer.valueOf(sp[0]),
            d = Integer.valueOf(sp[1]),
            a = Integer.valueOf(sp[2]);

        int[][] ary = new int[n][2];

        int bound = 0;

        for(int i = 0; i < n; i++) {
            sp = in.readLine().split(" ");
            ary[i][0] = Integer.valueOf(sp[0]);
            ary[i][1] = Integer.valueOf(sp[1]);
            bound = Math.max(bound, ary[i][0]);
        }

        Arrays.sort(ary, (u, v)->(u[0] - v[0]));

        // SegmentTree root = new SegmentTree(0, ary[n - 1][0]);   //1_000_000_010);
        Queue<int[]> q = new PriorityQueue<>((u, v)->(u[0] - v[0]));
        long sum = 0;
        long re = 0;
        for(int i = 0; i < n; i++)
        {

            // for(int[] qq : q) System.out.println("current q.." + Arrays.toString(qq));

            // while(!q.isEmpty() && q.peek()[0] < ary[i][0]) q.poll();
            // long q = root.get(ary[i][0]);
            // System.out.printf("%d %d\n", ary[i][0], q);
            int maxd = ary[i][0] + 2 * d;
            while(!q.isEmpty() && q.peek()[0] <= ary[i][0] ) sum += q.poll()[1];
            // System.out.println("sum = .." + sum);
            ary[i][1] -= sum * a;

            // System.out.printf("current ary.. %s\n", Arrays.toString(ary[i]));
            if(ary[i][1] <= 0) continue;
            // for(int[] elm : ary)

            int op = ary[i][1] / a;
            if(ary[i][1] % a > 0) op++;
            re += op;
            q.offer(new int[]{ary[i][0], op});
            q.offer(new int[]{maxd + 1, -op});
        }

        System.out.println(re);
    }

    void e() throws Exception
    {
        String[] sp = in.readLine().split(" ");
        int h = Integer.valueOf(sp[0]),
            n = Integer.valueOf(sp[1]);

        int[] weight = new int[n];
        int[] cost = new int[n];

        int[] f = new int[20010];
        Arrays.fill(f, 1 << 30);
        f[0] = 0;
        for(int i = 0; i < n; i++)
        {
            sp = in.readLine().split(" ");
            int c = Integer.valueOf(sp[0]);
            int w = Integer.valueOf(sp[1]);
            for(int j = c; j <= 20000; j++)
            {
                f[j] = Math.min(f[j], f[j - c] + w);
            }
        }
        // System.out.println(Arrays.toString(f));
        for(int i = 20000; i >= 1; i--)
            f[i] = Math.min(f[i], f[i + 1]);

        // System.out.println(Arrays.toString(f));

        // for(int i = 1; i <= h; i++)
        //     f[i] = Math.min(f[i], 1 + f[i - 1]);

        // System.out.println(Arrays.toString(f));
        System.out.println(f[h]);
    }

    long gcd(long a, long b)
    {
        if(b == 0) return a;
        return gcd(b, a % b);
    }

    void d() throws Exception
    {
        long h = Long.valueOf(in.readLine());

        // binary heap style
        //
        long count = 1;
        long sum = 0;
        while(h > 0)
        {
            h /= 2;
            sum += count;
            count *= 2;
        }
        System.out.println(sum);
    }

    boolean satisfy(int a, int b)
    {
        String s1 = String.valueOf(a),
                s2 = String.valueOf(b);
        int m = s1.length(), n = s2.length();
        if(s1.charAt(0) == s2.charAt(n - 1) &&
            s1.charAt(m - 1) == s2.charAt(0)) return true;
        return false;
    }

    void c() throws Exception
    {
        String[] sp = in.readLine().split(" ");
        int n = Integer.valueOf(sp[0]),
            k = Integer.valueOf(sp[1]);
        int[] ary = new int[n];
        sp = in.readLine().split(" ");
        for(int i = 0; i < n; i++)
        {
            ary[i] = Integer.valueOf(sp[i]);
        }

        Arrays.sort(ary);
        // use spec on k highest

        long sum = 0;
        for(int i = 0; i < n - k; i++) sum += ary[i];

        System.out.println(sum);

    }
    void b() throws Exception
    {
        String[] sp = in.readLine().split(" ");
        int h = Integer.valueOf(sp[0]),
            n = Integer.valueOf(sp[1]);
        sp = in.readLine().split(" ");
        for(int i = 0; i < n; i++)
        {
            h -= Integer.valueOf(sp[i]);
        }
        if(h <= 0) System.out.println("Yes");
        else System.out.println("No");
    }

    void a() throws Exception
    {
        String[] sp = split();
        String c1 = sp[0], c2 = sp[1];
        sp = split();
        int a = Integer.valueOf(sp[0]),
            b = Integer.valueOf(sp[1]);
        String u = in.readLine();
        if(c1.equals(u)) a--;
        if(c2.equals(u)) b--;
        System.out.printf("%d %d", a, b);
    }
}

Choices:
- No abnormally found
- Compile Error
- Internal error
- Runtime Error


Question:
import java.util.*;import java.io.*;import java.math.*;

public class Main
{

    public static void process()throws IOException
    {
        int n=ni(),d=ni(),x[][]=new int[n][d];

        for(int i=0;i<n;i++)
            for(int j=0;j<d;j++)
                x[i][j]=ni();

        double dist;
        int res=0;

        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                dist=0.0d;

                for(int k=0;k<n;k++){
                    dist+=(x[i][k]-x[j][k])*(x[i][k]-x[j][k]);
                }

                dist=Math.sqrt(dist);
                if(dist-(long)dist==0)
                    res++;
            }
        }
        pn(res);
    }

    static FastReader sc;
    static PrintWriter out;
    public static void main(String[]args)throws IOException
    {
        out = new PrintWriter(System.out);
        sc=new FastReader();

        long s = System.currentTimeMillis();
        int t=1;
        //t=ni();
        while(t-->0)
            process();

        out.flush();
        System.err.println(System.currentTimeMillis()-s+"ms");
        System.out.close();
    }

    static void pn(Object o){out.println(o);}
    static void p(Object o){out.print(o);}
    static void pni(Object o){out.println(o);System.out.flush();}
    static int ni()throws IOException{return Integer.parseInt(sc.next());}
    static long nl()throws IOException{return Long.parseLong(sc.next());}
    static double nd()throws IOException{return Double.parseDouble(sc.next());}
    static String nln()throws IOException{return sc.nextLine();}
    static long gcd(long a, long b)throws IOException{return (b==0)?a:gcd(b,a%b);}
    static int gcd(int a, int b)throws IOException{return (b==0)?a:gcd(b,a%b);}
    static int bit(long n)throws IOException{return (n==0)?0:(1+bit(n&(n-1)));}
    static boolean multipleTC=false;
    static long mod=(long)1e9+7l;

    static<T> void r_sort(T arr[],int n){
        Random r = new Random();
        for (int i = n-1; i > 0; i--){
            int j = r.nextInt(i+1);

            T temp = arr[i];
            arr[i] = arr[j];
            arr[j] = temp;
        }
        Arrays.sort(arr);
    }

/////////////////////////////////////////////////////////////////////////////////////////////////////////

    static class FastReader
    {
        BufferedReader br;
        StringTokenizer st;

        public 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();
        }

        String nextLine() {
            String str = "";
            try{
                str = br.readLine();
            }
            catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////
}

Choices:
- Internal error
- Runtime Error
- Memory Limit Exceeded
- Compile Error


Question:
import java.util.Scanner;

public class atc2 {
    public static void main(String[] args) {
        Scanner stdIn = new Scanner(System.in);
        int A = stdIn.nextInt() ;
        long ans = 0;

        for (int i = 0; i < A; i++) {
            if(i%3 ==0 || i%5 == 0);
            else ans += i ;
        }

        System.out.println(ans);

    }

Choices:
- Time Limit Exceeded
- Compile Error
- Internal error
- No abnormally found


Question:
import java.util.*;

class Main{
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int K = sc.nextInt();
    int X = sc.nextInt();
    for(int i=o; i<K; i++){
      System.out.print(X-K+1+i +" ");
    }
    for(int i=o; i<K; i++){
      System.out.print(X+i +" ");
    }
  }
}

Choices:
- Compile Error
- Internal error
- Memory Limit Exceeded
- Time Limit Exceeded


Question:
import java.util.Scanner;

public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    String S = sc.next();
    int K = sc.nextInt();

    long ans = 0;
    int count =1;
    char prev='$';
    for (int i = 0; i < S.length(); i++) {
      char c = S.charAt(i);
      if(c == prev){
        count++;
      }else{
        ans += count/2;
        count=1;
        prev=c;
      }
    }
    ans += count/2;

    ans = ans * K;

    System.out.println(ans);
  }

Choices:
- Compile Error
- Runtime Error
- Internal error
- No abnormally found


Question:
public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);

		String s = sc.next();
		String t = sc.next();

		int out = Integer.MAX_VALUE;

		for(int i = 0; i<s.length() - t.length()+1; i++) {
			int diff = 0;
			for(int j = 0; j<t.length(); j++) {
				if(s.charAt(j+i) != t.charAt(j)) diff++;
			}
			out = Math.min(out,  diff);
		}
		System.out.println(out);

	}
}

Choices:
- Internal error
- Compile Error
- Time Limit Exceeded
- No abnormally found


Question:
public class Main {
  public static void main(String[] args) {
    String S = new java.util.Scanner(System.in).nextLine();
    if (S.CharAt(2) == S.CharAt(3) && S.CharAt(4) == S.CharAt(5)) {
      System.out.println("Yes");
    } else {
      System.out.println("No");
    }
  }
}

Choices:
- No abnormally found
- Runtime Error
- Compile Error
- Internal error


Question:
import java.util.*;

public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    String S = sc.next();
    int check =0;
    for (int i=0; i<=S.length()/2; i++) {
      if (S.charAt(2 * i) == 'L') {
        check++;
        break;
      }
      if (S.charAt(2 * i + 1) == 'R') {
        check++;
        break;
      }
    }
    if (check != 0) {
      System.out.println("No");
    } else {
      System.out.println("Yes");
    }
  }
}

Choices:
- Runtime Error
- Memory Limit Exceeded
- No abnormally found
- Time Limit Exceeded


Question:
import java.util.*;

public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int H = sc.nextInt();
    int W = sc.nextInt();
    char[][] a = new char[H+1][W+1];
    int[] checkH = new int[W+1];
    int[] checkW = new int[H+1];
    for (int i=0; i<H; i++) {
      a[i] = sc.next().toCharArray();
    }
    for (int i=0; i<H; i++) {
      for (int j=0; j<W; j++) {
        if(a[i][j] == '.') checkH[i]++;
        }
      if (checkH[i] == W) {
        for (int j=0; j<W; j++) {
          a[i][j] = '0';
        }
      }
    }
    for (int j=0; j<W; j++) {
      for (int i=0; i<H; i++) {
        if(a[i][j] == '.' || a[i][j] == '0') checkW[j]++;
        }
      if (checkW[j] == H) {
        for (int i=0; i<H; i++) {
          a[i][j] = '0';
        }
      }
    }
    for (int i=0; i<H; i++) {
      if(checkH[i] == W) continue;
      for (int j=0; j<W; j++) {
        if(a[i][j] == '0') continue;
        System.out.print(a[i][j]);
      }
      System.out.println();
    }
  }
}

Choices:
- Compile Error
- Time Limit Exceeded
- No abnormally found
- Runtime Error


Question:
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {

	static PrintWriter out;
	static InputReader ir;

	static void solve() {
		int n = ir.nextInt();
		int m = ir.nextInt();
		int[] imos = new int[n + 1];
		for (int i = 0; i < m; i++) {
			int l = ir.nextInt() - 1;
			int r = ir.nextInt() - 1;
			imos[l]++;
			imos[r + 1]--;
		}
		int ct = 0;
		for (int i = 0; i < n; i++) {
			imos[i + 1] += imos[i];
			if (imos[i] == m)
				ct++;
		}
		out.println(ct);
	}

	public static void main(String[] args) {
		ir = new InputReader(System.in);
		out = new PrintWriter(System.out);
		solve();
		out.flush();
	}

	static class InputReader {

		private InputStream in;
		private byte[] buffer = new byte[1024];
		private int curbuf;
		private int lenbuf;

		public InputReader(InputStream in) {
			this.in = in;
			this.curbuf = this.lenbuf = 0;
		}

		public boolean hasNextByte() {
			if (curbuf >= lenbuf) {
				curbuf = 0;
				try {
					lenbuf = in.read(buffer);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (lenbuf <= 0)
					return false;
			}
			return true;
		}

		private int readByte() {
			if (hasNextByte())
				return buffer[curbuf++];
			else
				return -1;
		}

		private boolean isSpaceChar(int c) {
			return !(c >= 33 && c <= 126);
		}

		private void skip() {
			while (hasNextByte() && isSpaceChar(buffer[curbuf]))
				curbuf++;
		}

		public boolean hasNext() {
			skip();
			return hasNextByte();
		}

		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (!isSpaceChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}

		public int nextInt() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

		public double nextDouble() {
			return Double.parseDouble(next());
		}

		public int[] nextIntArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}

		public long[] nextLongArray(int n) {
			long[] a = new long[n];
			for (int i = 0; i < n; i++)
				a[i] = nextLong();
			return a;
		}

		public char[][] nextCharMap(int n, int m) {
			char[][] map = new char[n][m];
			for (int i = 0; i < n; i++)
				map[i] = next().toCharArray();
			return map;
		}
	}

	static void tr(Object... o) {
		out.println(Arrays.deepToString(o));
	}
}

Choices:
- Compile Error
- Memory Limit Exceeded
- Runtime Error
- No abnormally found


Question:
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main{

	static PrintWriter out;
	static InputReader ir;

	static void solve(){
		int n=ir.nextInt();
		int[] a=ir.nextIntArray(n);
		int cnt=0;
		for(int i=0;i<n-2;i++){
			while((a[i+1]-a[i])*(a[i+2]-a[i+1])>=0){
				i++;
			}
			cnt++;
			i++;
		}
		out.println(cnt+1);
	}

	public static void main(String[] args) throws Exception{
		ir=new InputReader(System.in);
		out=new PrintWriter(System.out);
		solve();
		out.flush();
	}

	static class InputReader {

		private InputStream in;
		private byte[] buffer=new byte[1024];
		private int curbuf;
		private int lenbuf;

		public InputReader(InputStream in) {this.in=in; this.curbuf=this.lenbuf=0;}

		public boolean hasNextByte() {
			if(curbuf>=lenbuf){
				curbuf= 0;
				try{
					lenbuf=in.read(buffer);
				}catch(IOException e) {
					throw new InputMismatchException();
				}
				if(lenbuf<=0) return false;
			}
			return true;
		}

		private int readByte(){if(hasNextByte()) return buffer[curbuf++]; else return -1;}

		private boolean isSpaceChar(int c){return !(c>=33&&c<=126);}

		private void skip(){while(hasNextByte()&&isSpaceChar(buffer[curbuf])) curbuf++;}

		public boolean hasNext(){skip(); return hasNextByte();}

		public String next(){
			if(!hasNext()) throw new NoSuchElementException();
			StringBuilder sb=new StringBuilder();
			int b=readByte();
			while(!isSpaceChar(b)){
				sb.appendCodePoint(b);
				b=readByte();
			}
			return sb.toString();
		}

		public int nextInt() {
			if(!hasNext()) throw new NoSuchElementException();
			int c=readByte();
			while (isSpaceChar(c)) c=readByte();
			boolean minus=false;
			if (c=='-') {
				minus=true;
				c=readByte();
			}
			int res=0;
			do{
				if(c<'0'||c>'9') throw new InputMismatchException();
				res=res*10+c-'0';
				c=readByte();
			}while(!isSpaceChar(c));
			return (minus)?-res:res;
		}

		public long nextLong() {
			if(!hasNext()) throw new NoSuchElementException();
			int c=readByte();
			while (isSpaceChar(c)) c=readByte();
			boolean minus=false;
			if (c=='-') {
				minus=true;
				c=readByte();
			}
			long res = 0;
			do{
				if(c<'0'||c>'9') throw new InputMismatchException();
				res=res*10+c-'0';
				c=readByte();
			}while(!isSpaceChar(c));
			return (minus)?-res:res;
		}

		public double nextDouble(){return Double.parseDouble(next());}

		public int[] nextIntArray(int n){
			int[] a=new int[n];
			for(int i=0;i<n;i++) a[i]=nextInt();
			return a;
		}

		public long[] nextLongArray(int n){
			long[] a=new long[n];
			for(int i=0;i<n;i++) a[i]=nextLong();
			return a;
		}

		public char[][] nextCharMap(int n,int m){
			char[][] map=new char[n][m];
			for(int i=0;i<n;i++) map[i]=next().toCharArray();
			return map;
		}
	}
}

Choices:
- No abnormally found
- Compile Error
- Internal error
- Runtime Error


Question:
vimport java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {

	static PrintWriter out;
	static InputReader ir;
	static boolean debug = false;

	static void solve() {
		long n = ir.nextLong();
		long x = ir.nextLong();
		long res = n;
		long a = n - x;
		long b = x;
		while (a != 0 && b != 0) {
			if (a < b) {
				long tmp = a;
				a = b;
				b = tmp;
			}
			long d = a / b;
			res += d * 2 * b;
			a %= b;
		}
		out.println(res - Math.max(a, b));
	}

	public static void main(String[] args) {
		ir = new InputReader(System.in);
		out = new PrintWriter(System.out);
		solve();
		out.flush();
	}

	static class InputReader {

		private InputStream in;
		private byte[] buffer = new byte[1024];
		private int curbuf;
		private int lenbuf;

		public InputReader(InputStream in) {
			this.in = in;
			this.curbuf = this.lenbuf = 0;
		}

		public boolean hasNextByte() {
			if (curbuf >= lenbuf) {
				curbuf = 0;
				try {
					lenbuf = in.read(buffer);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (lenbuf <= 0)
					return false;
			}
			return true;
		}

		private int readByte() {
			if (hasNextByte())
				return buffer[curbuf++];
			else
				return -1;
		}

		private boolean isSpaceChar(int c) {
			return !(c >= 33 && c <= 126);
		}

		private void skip() {
			while (hasNextByte() && isSpaceChar(buffer[curbuf]))
				curbuf++;
		}

		public boolean hasNext() {
			skip();
			return hasNextByte();
		}

		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (!isSpaceChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}

		public int nextInt() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

		public double nextDouble() {
			return Double.parseDouble(next());
		}

		public int[] nextIntArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}

		public long[] nextLongArray(int n) {
			long[] a = new long[n];
			for (int i = 0; i < n; i++)
				a[i] = nextLong();
			return a;
		}

		public char[][] nextCharMap(int n, int m) {
			char[][] map = new char[n][m];
			for (int i = 0; i < n; i++)
				map[i] = next().toCharArray();
			return map;
		}
	}

	static void tr(Object... o) {
		if (debug)
			out.println(Arrays.deepToString(o));
	}
}

Choices:
- Internal error
- No abnormally found
- Compile Error
- Memory Limit Exceeded


Question:
//make sure to make new file!
import java.io.*;
import java.util.*;

public class Main{

   public static long MOD = 1000000007L;

   public static void main(String[] args)throws IOException{
      BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
      PrintWriter out = new PrintWriter(System.out);

      int n = Integer.parseInt(f.readLine());

      long[] pow2 = new long[200005];

      pow2[0] = 1L;
      for(int k = 1; k < 200005; k++){
         pow2[k] = pow2[k-1]*2L;
      }

      Vec[] array = new Vec[n];
      HashMap<Vec,Integer> hmap = new HashMap<Vec,Integer>();
      for(int k = 0; k < n; k++){
         StringTokenizer st = new StringTokenizer(f.readLine());

         long a = Long.parseLong(st.nextToken());
         long b = Long.parseLong(st.nextToken());

         long neg = 1;
         if(a < 0) neg*=-1;
         if(b < 0) neg*=-1;

         a = Math.abs(a);
         b = Math.abs(b);

         long gcd = gcd(a,b);

         array[k] = new Vec(a/gcd,b/gcd,neg);

         if(hmap.containsKey(array[k])){
            hmap.put(array[k],hmap.get(array[k])+1);
         } else {
            hmap.put(array[k],1);
         }

      }

      long answer = 1L;

      HashSet<Vec> seen = new HashSet<Vec>();

      for(Vec v : hmap.keySet()){
         if(seen.contains(v)){
            continue;
         }
         if(hmap.containsKey(getrec(v))){
            answer = (answer*(pow2[hmap.get(v)] + pow2[hmap.get(getrec(v))]-1) + MOD)%MOD;
            seen.add(getrec(v));
         } else {
            answer = (answer*pow2[hmap.get(v)] + MOD)%MOD;
         }
      }

      answer--;
      out.println(answer);

      out.close();
   }

   public static Vec getrec(Vec v){
      return new Vec(v.run,v.rise,v.sign*-1);
   }

   public static long gcd(long a, long b){
      if(a==b) return a;
      if(a > b){
         if(b == 0) return a;
         return gcd(a%b,b);
      } else {
         if(a == 0) return b;
         return gcd(b%a,a);
      }
   }

   public static class Vec{
      long rise;
      long run;
      long sign;
      public Vec(long a, long b, long c){
         rise = a;
         run = b;
         sign = c;
      }

      public boolean equals(Object o){
         Vec v = (Vec)o;
         return rise == v.rise && run == v.run && sign == v.sign;
      }
      public int hashCode(){
         return toString().hashCode();
      }
      public String toString(){
         return "" + rise + " " + run + " " + sign;
      }

   }

}

Choices:
- Memory Limit Exceeded
- Internal error
- Time Limit Exceeded
- Runtime Error


Question:
import java.util.*;
public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        final long bill = 2000000000;
        long pos[][] = new long [n][n];
        long neo_pos[][] = new long [n][n];
        long xMax = bill * -1, xMin = bill;
        long yMax = bill * -1, yMin = bill;

        for(int i = 0; i < n; i++){
            pos[i][0] = sc.nextInt();
            pos[i][1] = sc.nextInt();
            //xy座標から座標軸を45度回転させたx'y'座標に変換する
            //本来は√2で割らないといけないが整数計算をするためしていない
            neo_pos[i][0] = pos[i][0] + pos[i][1];
            neo_pos[i][1] = pos[i][0] * -1 + pos[i][1];
            if(xMax < neo_pos[i][0]){
                xMax = neo_pos[i][0];
            }
            if(xMin > neo_pos[i][0]){
                xMin = neo_pos[i][0];
            }
            if(yMax < neo_pos[i][1]){
                yMax = neo_pos[i][1];
            }
            if(yMin > neo_pos[i][1]){
                yMin = neo_pos[i][1];
            }
        }
        //xMax xMin yMax yMinを確認
        //System.out.println("xMax=" + xMax + " xMin=" + xMin);
        //System.out.println("yMax=" + yMax + " yMin=" + yMin);

        long dist_x = xMax - xMin;
        long dist_y = yMax - yMin;
        if(dist_x > dist_y){
            System.out.println(dist_x);
        }else{
            System.out.println(dist_y);
        }
    }
}

Choices:
- Compile Error
- Runtime Error
- No abnormally found
- Internal error


Question:
import java.util.*;
public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        final long bill = 1000000000;
        long pos[][] = new long [n][n];
        long xMax = 0, xMin = bill;
        long yMax = 0, yMin = bill;

        //各点からx座標、y座標の最大値、最小値を求める
        for(int i = 0; i < n; i++){
            pos[i][0] = sc.nextInt();
            if(xMax < pos[i][0]){
                xMax = pos[i][0];
            }
            if(xMin > pos[i][0]){
                xMin = pos[i][0];
            }
            pos[i][1] = sc.nextInt();
            if(yMax < pos[i][1]){
                yMax = pos[i][1];
            }
            if(yMin > pos[i][1]){
                yMin = pos[i][1];
            }
        }
        //System.out.println("xMax=" + xMax + " xMin=" + xMin);
        //System.out.println("yMax=" + yMax + " yMin=" + yMin);
        //x座標最大の点のy座標、x座標最小の点のy座標
        //y座標最大の点のx座標、y座標最小の点のx座標を格納するリスト
        List<Long> x_yMax = new ArrayList<Long>();
        List<Long> x_yMin = new ArrayList<Long>();
        List<Long> y_xMax = new ArrayList<Long>();
        List<Long> y_xMin = new ArrayList<Long>();

        for(int i = 0; i < n; i++){
            if(pos[i][0] == xMax){
                y_xMax.add(pos[i][1]);
            }
            if(pos[i][0] == xMin){
                y_xMin.add(pos[i][1]);
            }
            if(pos[i][1] == yMax){
                x_yMax.add(pos[i][0]);
            }
            if(pos[i][1] == yMin){
                x_yMin.add(pos[i][0]);
            }
        }

        long a = Collections.max(x_yMax);
        long b = Collections.min(x_yMax);
        long c = Collections.max(x_yMin);
        long d = Collections.min(x_yMin);
        long e = Collections.max(y_xMax);
        long f = Collections.min(y_xMax);
        long g = Collections.max(y_xMin);
        long h = Collections.min(y_xMin);

        long x, y, dist, dist_x, dist_y, distMax = 0;
        for(int i = 0; i < n; i++){
            x = pos[i][0];
            y = pos[i][1];

            dist_x = atai(x - a);
            dist_y = atai(y - yMax);
            dist = dist_x + dist_y;
            if(distMax < dist){
                distMax = dist;
            }

            dist_x = atai(x - b);
            dist_y = atai(y - yMax);
            dist = dist_x + dist_y;
            if(distMax < dist){
                distMax = dist;
            }

            dist_x = atai(x - c);
            dist_y = atai(y - yMin);
            dist = dist_x + dist_y;
            if(distMax < dist){
                distMax = dist;
            }

            dist_x = atai(x - d);
            dist_y = atai(y - yMin);
            dist = dist_x + dist_y;
            if(distMax < dist){
                distMax = dist;
            }

            dist_x = atai(x - xMax);
            dist_y = atai(y - e);
            dist = dist_x + dist_y;
            if(distMax < dist){
                distMax = dist;
            }

            dist_x = atai(x - xMax);
            dist_y = atai(y - f);
            dist = dist_x + dist_y;
            if(distMax < dist){
                distMax = dist;
            }

            dist_x = atai(x - xMin);
            dist_y = atai(y - g);
            dist = dist_x + dist_y;
            if(distMax < dist){
                distMax = dist;
            }

            dist_x = atai(x - xMin);
            dist_y = atai(y - h);
            dist = dist_x + dist_y;
            if(distMax < dist){
                distMax = dist;
            }
        }
        System.out.println(distMax);
    }
    private static long atai(long v){
        if(v < 0){
            v *= -1;
        }
        return v;
    }
}

Choices:
- Time Limit Exceeded
- Runtime Error
- Compile Error
- Internal error


Question:
import java.util.*;

public class OneClue{
  public static void main(String[] args){
    Scanner s = new Scanner(System.in);
    int k = s.nextInt();
    int x = s.nextInt();
    int a=x-k+1,b=x+k;
    for(int i=a;i<b;i++)
      System.out.print(i+" ");
  }
}

Choices:
- Runtime Error
- Time Limit Exceeded
- Compile Error
- Memory Limit Exceeded


Question:
public class OneClue{
  public static void main(String[] args){
    int k=13,x=3;
    int a=x-k+1,b=x+k;
    for(int i=a;i<b;i++)
      System.out.print(i+" ");
  }
}

Choices:
- Runtime Error
- Memory Limit Exceeded
- Compile Error
- No abnormally found


Question:
public class OneClue.java{
  public static void main(String[] args){
    int k=13,x=3;
    int a=x-k+1,b=x+k;
    for(int i=a;i<b;i++)
      System.out.print(i+" ");
  }
}

Choices:
- Time Limit Exceeded
- Memory Limit Exceeded
- No abnormally found
- Compile Error


Question:
import java.util.*;
public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int a = sc.nextInt();
		int b = sc.nextInt();
		int c = sc.nextInt();
		int d = a
      	if (b<=d){
          d = b;
        }
      	if (c<=d){
          d = c;
        }
		System.out.println(d);
	}
}

Choices:
- No abnormally found
- Compile Error
- Time Limit Exceeded
- Memory Limit Exceeded


Question:
import java.util.*;
public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int a = sc.nextInt();
		int b = sc.nextInt();
		int c = sc.nextInt();
		int d = a
      	if (b=<d){
          d = b;
        }
      	if (c=<d){
          d = c;
        }
		System.out.println(d);
	}
}

Choices:
- No abnormally found
- Runtime Error
- Memory Limit Exceeded
- Compile Error


Question:
import java.util.*;
public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int a = sc.nextInt();
		int b = sc.nextInt();
		int c = sc.nextInt();
        int ab = a+b;
        int bc = b+c;
        int ca = c+a;
		int s = Math.min(ab,bc);
      	int w = Math.min(bc,ca)
		System.out.println(w);
	}
}

Choices:
- Internal error
- Compile Error
- Time Limit Exceeded
- No abnormally found


Question:
import java.util.*;
public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int a = sc.nextInt();
		int b = sc.nextInt();
		int c = sc.nextInt();
        int ab = a+b;
        int bc = b+c;
        int ca = c+a;
		int s = Math.min(ab,bc,ca);
		System.out.println(s);
	}
}

Choices:
- Memory Limit Exceeded
- No abnormally found
- Compile Error
- Internal error


Question:
import java.util.*;
public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int a = sc.nextInt();
		int b = sc.nextInt();
		int c = sc.nextInt();
		int s = Math.min(a+b,b+c,c+a);
		System.out.println(s);
	}
}

Choices:
- No abnormally found
- Time Limit Exceeded
- Compile Error
- Runtime Error


Question:
import java.util.*;

public class Main {
	public static void main(String args[]){
		Scanner sc = new Scanner(System.in);
		String b = sc.next();
		if (b == "A"){
			System.out.println("T");
		} else if (b == "T"){
			System.out.println("A");
		} else if (b == "C"){
			System.out.println("G");
		} else {
			System.out.println("C");
	}
}

Choices:
- Time Limit Exceeded
- Compile Error
- Runtime Error
- Internal error


Question:
import java.util.*;

public class Main {
    public static void main(String[] args) {
        // 自分の得意な言語で
        // Let's チャレンジ！！

        Scanner sc = new Scanner(System.in);
      StringBuilder sb1 = new StringBuilder();
      StringBuilder sb2 = new StringBuilder();
      sb1 = sc.next();
      sb2 = sc.next();
      int a = 0;

            for(int i = 0;i<s.length();i++){
          if(String.valueOf(sb1.charAt(i)).equals(String.valueOf(sb2.charAt(i)))){
              a++;
          }
      }
        System.out.println(a);
    }
}

Choices:
- Time Limit Exceeded
- Memory Limit Exceeded
- Internal error
- Compile Error


Question:
import java.util.*;

public class Main {
    public static void main(String[] args) {
        // 自分の得意な言語で
        // Let's チャレンジ！！

        Scanner sc = new Scanner(System.in);
      StringBuilder sb1 = new StringBuilder();
      StringBuilder sb2 = new StringBuilder();
      sb1 = sc.netx();
      sb2 = sc.netx();
      int a = 0;

            for(int i = 0;i<s.length();i++){
          if(String.valueOf(sb1.charAt(i)).equals(String.valueOf(sb2.charAt(i)))){
              a++;
          }
      }
        System.out.println(a);
    }
}

Choices:
- Compile Error
- Internal error
- Time Limit Exceeded
- Runtime Error


Question:
import java.util.*;

public class Main {
    public static void main(String[] args) {
        // 自分の得意な言語で
        // Let's チャレンジ！！

        Scanner sc = new Scanner(System.in);
      StringBuilder sb1 = new StringBuilder();
      StringBuilder sb2 = new StringBuilder();
      sb1 = sc.netx();
      sb2 = sc.netx();
      int a = 0;

            for(int i = 0;i<s.length();i++){
          if(String.valueOf(sb1.charAt(i)).equals(String.valueOf(1b2.charAt(i)))){
              a++;
          }
      }
        System.out.println(a);
    }
}

Choices:
- No abnormally found
- Compile Error
- Runtime Error
- Time Limit Exceeded


Question:
package pracltice;

import java.io.BufferedOutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Scanner;

public class Main {
    public static PrintWriter out;

    public static void main(String[] args) {
        Main.run();
    }

    private static void run() {
        out = new PrintWriter(new BufferedOutputStream(System.out));
        Scanner sc = new Scanner(System.in);
        int s = Integer.parseInt(sc.next());
        ArrayList<Integer> list = new ArrayList<>();
        list.add(s);
        for (int i = 1, answer = 0;; i++) {
            answer = Main.calcF(list.get(i - 1));
            if (list.contains(answer)) {
                out.println(i + 1);
                break;
            }
            list.add(answer);
        }
        out.close();
        sc.close();
    }

    private static int calcF(int pnum) {
        int n = pnum;
        if (n % 2 == 0) {
            return n / 2;
        } else {
            return 3 * n + 1;
        }
    }
}

Choices:
- Runtime Error
- Time Limit Exceeded
- No abnormally found
- Internal error


Question:
class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int a = sc.nextInt();
		int b = sc.nextInt();
		int cost = 0;
		if (a >= 13) {
			cost = b;
		} else if (a >= 6 && a <= 12) {
			cost = b /2;
		} else {
			cost = 0;
		}
		System.out.println(cost);
	}
}

Choices:
- Internal error
- Compile Error
- Time Limit Exceeded
- Memory Limit Exceeded


Question:
import java.util.Scanner;

class Main {
	public static void main(String[] args) {
		try (Scanner sc = new Scanner(System.in)) {
			String S = sc.next();
			int length = S.length();
			int K = sc.nextInt();
			if (length == 1) {
				System.out.print(K / 2);
				return;
			}
			char head = S.charAt(0);
			boolean[] bls = new boolean[length];
			char tail = S.charAt(length - 1);
			long firstCount = 0;
			char last = S.charAt(0);
			for (int i = 1; i < length; i++) {
				if (S.charAt(i) == last && bls[i - 1] == false) {
					bls[i] = true;
					firstCount++;
				}
				last = S.charAt(i);
			}
			if (K == 1) {
				System.out.println(firstCount);
				return;
			}
			long count = 0;
			boolean[] bls2 = new boolean[length];
			if (head == tail && bls[length - 1] == false) {
				bls2[0] = true;
				count++;
			}
			last = S.charAt(0);
			for (int i = 1; i < length; i++) {
				if (S.charAt(i) == last && bls2[i - 1] == false) {
					bls2[i] = true;
					count++;
				}
				last = S.charAt(i);
			}
			if (K == 2) {
				System.out.println(firstCount + count);
				return;
			}
			long count3 = 0;
			bls = new boolean[length];
			if (head == tail && bls2[length - 1] == false) {
				bls[0] = true;
				count3++;
			}
			last = S.charAt(0);
			for (int i = 1; i < length; i++) {
				if (S.charAt(i) == last && bls[i - 1] == false) {
					bls[i] = true;
					count3++;
				}
				last = S.charAt(i);
			}
			if (bls[length - 1] == bls2[length - 1] && head == tail) {
				System.out.println(firstCount + count + count3 * (K - 2));
				return;
			}

			long num3 = (K - 1) / 2;
			long num2 = K - 1 - num3;

			long ans = firstCount + count * (num2) + count3 * num3;
			System.out.print(ans);
		}
	}

Choices:
- Memory Limit Exceeded
- Internal error
- Runtime Error
- Compile Error


Question:
    import java.util.Scanner;

    public class Main {
    	public static void main(String[] args) {
    		Scanner sc = new Scanner(System.in);
    		int N = Integer.parseInt(sc.next());
    		int[] As = new int[N+1];
    		for(int i=0; i<=N; i++) {
    			As[i] = Integer.parseInt(sc.next());
    		}
		long last = 0;
		long monsters = 0
    		for(int i=0; i<N; i++) {
    			int ability = Integer.parseInt(sc.next());
    			if(As[i] >= ability + last) {
    				monsters += (ability+ last);
    				last = 0;
    			}else {
    				monsters += As[i];
    				last = ability + last - As[i];
    			}
    		}
    		sc.close();
    		if(As[N] >=  last) {
    			monsters +=  last;
    		}else {
    			monsters += As[N];
    		}
    		System.out.println(monsters);
    	}
    }

Choices:
- Time Limit Exceeded
- Runtime Error
- Compile Error
- Internal error


Question:
package atcoder133;

import java.util.Scanner;

class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = Integer.parseInt(sc.next());
		int D = Integer.parseInt(sc.next());
		int[][] point = new int[N][D];
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < D; j++) {
				point[i][j] = Integer.parseInt(sc.next());
			}
		}
		int count = 0;
		for (int i = 1; i < N; i++) {
			for (int j = 0; j < i; j++) {
				int distance_square = 0;
				for (int k = 0; k < D; k++) {
					int distance = point[i][k] - point[j][k];
					distance_square += distance * distance;
				}
				int distance_sqrt = (int) Math.sqrt(distance_square);
				if(distance_sqrt * distance_sqrt == distance_square) {
					count++;
				}
			}
		}
		System.out.println(count);
		sc.close();
	}
}

Choices:
- Compile Error
- Time Limit Exceeded
- Memory Limit Exceeded
- Runtime Error


Question:
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int A[] = new int[N];
		int B[] = new int[N];
		int C[] = new int[N - 1];
		int answer = 0;

		for (int i = 0; i < N; i++) {
			A[i] = sc.nextInt();
		}

		for (int i = 0; i < N; i++) {
			B[i] = sc.nextInt();
			answer += B[i];
		}

		for (int i = 0; i < N - 1; i++) {
			C[i] = sc.nextInt();
		}

		for (int i = 1; i < N; i++) {
			if (A[i - 1] + 1 == A[i]) {
				answer += C[i - 2];
			}
		}

		System.out.println(answer);
	}
}

Choices:
- Runtime Error
- Compile Error
- Time Limit Exceeded
- Internal error


Question:
import java.util.ArrayList;
import java.util.InputMismatchException;
import java.util.List;
import java.util.Scanner;

public class Main {
	public static void main(String args[]) {
		try {
			Scanner scanner = new Scanner(System.in);

			int A = scanner.nextInt();
			int B = scanner.nextInt();
			int K = scanner.nextInt();

			List<Integer> answerList = new ArrayList<>();

			int loopCountMax = A > B ? B : A;

			for (int i = 1; i <= loopCountMax; i++) {
				if (A % i == 0 && B % i == 0) answerList.add(i);
			}

			System.out.println(answerList.get(answerList.get(answerList.size() - (K - 1))));
			scanner.close();
		} catch (InputMismatchException e) {
			System.out.println("整数を入力してください。");
		}
	}
}

Choices:
- No abnormally found
- Compile Error
- Runtime Error
- Time Limit Exceeded


Question:
3
100 100
10 10000
1 1000000000

Choices:
- Runtime Error
- Time Limit Exceeded
- Memory Limit Exceeded
- Compile Error


Question:
import java.io.*;
import java.util.*;

public class Main {

	public static void main(String[] args) {
		FastScanner sc=new FastScanner();
		int n = sc.nextInt();
		long cor[][] = new long[n][2];
		for(int i =0;i<n;i++) {
			cor[i][0] = sc.nextLong();
			cor[i][1] = sc.nextLong();
		}
		long ans =0;
		for(int i =0;i<n;i++) {
			for(int j =i+1; j<n;j++) {
				ans = Math.max(ans,man(cor[i],cor[j]));
			}
		}
		System.out.println(ans);
	}

	public static long man(long[] cor, long[] cor2) {
		long ans =0;
		return Math.abs(cor[0]-cor2[0])+Math.abs(cor[1]-cor2[1]);
	}
	static final Random random = new Random();

	static void sort(int[] a) {
		int n = a.length;
		for(int i =0; i<n; i++) {
			int val = random.nextInt(n);
			int cur = a[i];
			a[i] = a[val];
			a[val] = cur;
		}
		Arrays.sort(a);
	}

	static void sortl(long[] a) {
		int n = a.length;
		for(int i =0; i<n; i++) {
			int val = random.nextInt(n);
			long cur = a[i];
			a[i] = a[val];
			a[val] = cur;
		}
		Arrays.sort(a);
	}

	static class FastScanner {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer("");
		String next() {
			while (st == null  || !st.hasMoreTokens()) {
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}
		String nextLine() {
            String str = "";
            try
            {
                str = br.readLine();
            }
            catch (IOException e)
            {
                e.printStackTrace();
            }
            return str;
		}
		int nextInt() {
			return Integer.parseInt(next());
		}
		int[] readArray(int n) {
			int[] a=new int[n];
			for (int i=0; i<n; i++) a[i]=nextInt();
			return a;
		}
		long nextLong() {
			return Long.parseLong(next());
		}
		double nextDouble() {
            return Double.parseDouble(next());
        }
	}

}

Choices:
- Memory Limit Exceeded
- Internal error
- Time Limit Exceeded
- Compile Error


Question:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.StringTokenizer;

class RemainingBalls {
    public static void main(String[] args) {
        FastReader f = new FastReader();
        String a, b;
        int x, y;
        String[] inp = is(f).split(" ");
        a = inp[0]; b = inp[1];
        x = ii(f); y = ii(f);
        String thr = is(f);
        if(thr.compareTo(a) == 0)
        	x--;
        else
        	y--;
		System.out.println(x +" " + y);
    }

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public 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;
        }
    }

    static int ii(FastReader fr) {
        return fr.nextInt();
    }

    static long il(FastReader fr) {
        return fr.nextLong();
    }

    static double id(FastReader fr) {
        return fr.nextDouble();
    }

    static String is(FastReader fr) {
        return fr.nextLine();
    }

    static void print(Object s) {
        System.out.print(s);
    }

    static void printn(Object s) {
        System.out.println(s);
    }

    static long[] inputArrL(int n, FastReader fr, int idx) {
        long[] arr = new long[n + idx];
        for (int i = idx; i < n + idx; i++)
            arr[i] = fr.nextLong();
        return arr;
    }

    static int[] inputArr(int n, FastReader fr, int idx) {
        int[] arr = new int[n + idx];
        for (int i = idx; i < n + idx; i++)
            arr[i] = fr.nextInt();
        return arr;
    }

    static String[] inputArrS(int n, FastReader fr, int idx) {
        String[] arr = new String[n + idx];
        for (int i = idx; i < n + idx; i++)
            arr[i] = fr.nextLine();
        return arr;
    }

    static int max(int... args) {
        int max = Integer.MIN_VALUE;
        for (int x : args) {
            max = Math.max(x, max);
        }
        return max;
    }

    static int min(int... args) {
        int min = Integer.MAX_VALUE;
        for (int x : args) {
            min = Math.min(x, min);
        }
        return min;
    }

    static long max(long... args) {
        long max = Long.MIN_VALUE;
        for (long x : args) {
            max = Math.max(x, max);
        }
        return max;
    }

    static long min(long... args) {
        long min = Long.MAX_VALUE;
        for (long x : args) {
            min = Math.min(x, min);
        }
        return min;
    }

    static int lenDigit(int d) {
        if (d == 0)
            return 1;
        int l = 0;
        while (d != 0) {
            l++;
            d /= 10;
        }
        return l;
    }

    static void debug(Object... args) {
        for (int i = 0; i < args.length; i += 2) {
            print("[" + args[i] + ":" + args[i + 1] + "]" + " ");
        }
        printn("");
    }

    static int MOD = (int) 1e9 + 7;
}

Choices:
- Runtime Error
- Memory Limit Exceeded
- Compile Error
- Internal error


Question:
package aaaa;
import java.util.*;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) throws Exception {

	    Scanner scanner = new Scanner(System.in);
	    String line1 = scanner.next();
        String tmpStr = "";
        boolean chkflg = false;
        String[] strArray = line1.split("");
        for(String s : strArray) {
            if (tmpStr.equals(s)) {
              chkflg = true;
            }
            tmpStr = s;
        }
        if (chkflg) {
            System.out.println("Bad");
        } else {
            System.out.println("Good");
        }
    }
}

Choices:
- Memory Limit Exceeded
- No abnormally found
- Runtime Error
- Time Limit Exceeded


Question:
import java.util.Scanner;
public class Main{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int a = sc.nextInt();
		int b = sc.nextInt();
		int dis = Math.abs(a-b);
		int count = 0;
		if(dis%2==0) {
		while(dis != 0) {
			a++;
			b--;
			dis = Math.abs(a-b);
			count++;
		}

		}
		else {
			int b_dis = n-b;
			int a_dis = a-1;
			if(a_dis<=b_dis) {
				count = b-1;
			}
			else {
				count = n-a;
			}
		}
		System.out.println(count);
	}
}

Choices:
- No abnormally found
- Internal error
- Runtime Error
- Compile Error


Question:
import java.util.Scanner;
public class Main{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int a = sc.nextInt();
		int b = sc.nextInt();
		int dis = Math.abs(a-b);
		int count = 0;
		if(dis%2==0) {
		while(dis != 0) {
			a++;
			b--;
			dis = Math.abs(a-b);
			count++;
		}
		System.out.println(count);
		}
		else {
			int b_dis = n-b;
			int a_dis = a-1;
			if(a_dis<=b_dis) {
				count = b-1;
			}
			else {
				count = n-a;
			}
		}
		System.out.println(count);
	}
}

Choices:
- No abnormally found
- Runtime Error
- Memory Limit Exceeded
- Compile Error


Question:
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);

		int n = sc.nextInt();
		int[] d = new int[n];
		int ans = 0;

		for(int i = 0; i < n; i++) {
			d[i] = sc.nextInt();
		}

		for(int k = 1; k <= Math.pow(10, 5); k++) {
			int abc = 0;
			int arc = 0;
			for(int j = 0; j <n; j++) {
				if(d[j] >= k) {
					arc++;
				}
				else {
					abc++;
				}
			}
			if(abc == arc) {
				ans++;
			}
		}
		System.out.println(ans);
	}
}

Choices:
- Compile Error
- Internal error
- Time Limit Exceeded
- No abnormally found