-
Notifications
You must be signed in to change notification settings - Fork 0
/
MyTemplate.java
100 lines (82 loc) · 3.94 KB
/
MyTemplate.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
import java.util.*;import java.io.*;import java.math.*;
//=============================================================================
//--------------------------Main-Class---------------------------------
//=============================================================================
public class A {
public static void process()throws IOException{
}
//=============================================================================
//--------------------------Dheeraj-Bhagchandani---------------------------------
//=============================================================================
static FastScanner sc;
static PrintWriter out;
public static void main(String[]args)throws IOException
{
boolean oj = true;
if(oj){sc=new FastScanner();out=new PrintWriter(System.out);}
else{sc=new FastScanner(100);out=new PrintWriter("output.txt");}
int t=1;
t = sc.nextInt();
while(t-->0) {process();}
out.flush();out.close();
}
static class Pair implements Comparable<Pair> {
int x, y;
Pair(int x, int y) {
this.x = x;
this.y = y;
}
@Override
public int compareTo(Pair o) {
return Integer.compare(this.x, o.x);
}
}
/////////////////////////////////////////////////////////////////////////////////////////////////////////
static void println(Object o){out.println(o);}
static void println(){out.println();}
static void print(Object o){out.print(o);}
static void pflush(Object o){out.println(o);out.flush();}
static int ceil(int x, int y) {return (x % y == 0 ? x / y : (x / y + 1));}
static long ceil(long x, long y) {return (x % y == 0 ? x / y : (x / y + 1));}
static int max(int x, int y) {return Math.max(x, y);}
static int min(int x, int y) {return Math.min(x, y);}
static int abs(int x) {return Math.abs(x);}
static long abs(long x) {return Math.abs(x);}
static int log2(int N) {int result = (int) (Math.log(N) / Math.log(2));return result;}
static long max(long x, long y) {return Math.max(x, y);}
static long min(long x, long y) {return Math.min(x, y);}
public static int gcd(int a, int b) {
BigInteger b1 = BigInteger.valueOf(a);BigInteger b2 = BigInteger.valueOf(b);
BigInteger gcd = b1.gcd(b2);return gcd.intValue();}
public static long gcd(long a, long b) {
BigInteger b1 = BigInteger.valueOf(a);BigInteger b2 = BigInteger.valueOf(b);
BigInteger gcd = b1.gcd(b2);return gcd.longValue();}
/////////////////////////////////////////////////////////////////////////////////////////////////////////
static class FastScanner{BufferedReader br; StringTokenizer st;
FastScanner()throws FileNotFoundException{
br=new BufferedReader(new InputStreamReader(System.in));}
FastScanner(int a)throws FileNotFoundException{
br = new BufferedReader(new FileReader("input.txt"));}
String next()throws IOException{
while (st == null || !st.hasMoreElements()) {try{
st = new StringTokenizer(br.readLine());}
catch (IOException e){ e.printStackTrace(); }}
return st.nextToken(); } int nextInt() throws IOException{
return Integer.parseInt(next());}
long nextLong() throws IOException
{return Long.parseLong(next());}
double nextDouble()throws IOException { return Double.parseDouble(next()); }
String nextLine() throws IOException{ String str = ""; try{
str = br.readLine();} catch (IOException e){
e.printStackTrace();} return str;}
int[] readArray(int n)throws IOException{int[]A=new int[n];
for(int i=0;i!=n;i++){A[i]=sc.nextInt();}return A;}
long[] readArrayLong(int n)throws IOException{long[]A=new long[n];
for(int i=0;i!=n;i++){A[i]=sc.nextLong();}return A;}}
static void ruffleSort(int[] a) {Random get = new Random();
for (int i = 0; i < a.length; i++) {int r = get.nextInt(a.length);
int temp = a[i];a[i] = a[r];a[r] = temp;}Arrays.sort(a);}
static void ruffleSort(long[] a) {Random get = new Random();
for (int i = 0; i < a.length; i++) {int r = get.nextInt(a.length);
long temp = a[i];a[i] = a[r];a[r] = temp;}Arrays.sort(a);}
}