{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\npublic class EdE {\n\n\tpublic static void main(String[] args) throws Exception{\n\t\tlong num = 1000000007;\n\n\t\t// TODO Auto-generated method stub\n \t\tBufferedReader bf = new BufferedReader(new InputStreamReader(System.in));\n \t\tPrintWriter out = new PrintWriter(System.out);\n \t\tint n = Integer.parseInt(bf.readLine());\n \t\tlong[] dp = new long[n+1];\n \t\tint[] isPrime = new int[n+1];\n\t\tArrays.fill(isPrime, 1);\n\t\tint[] mu = new int[n+1];\n\t\tArrays.fill(mu, 1);\n\t\tfor(int i = 2;i<=n;i++){\n\t\t\tif (isPrime[i] == 1){\n\t\t\t\tfor(int j = i;j<=n;j+=i){\n\t\t\t\t\tif (j > i)\n\t\t\t\t\t\tisPrime[j] = 0;\n\t\t\t\t\tif (j%(i*i) == 0)\n\t\t\t\t\t\tmu[j] = 0;\n\t\t\t\t\tmu[j] = -mu[j];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tlong sum = 0;\n\t\tfor(int i = 2;i<=n;i++){\n\t\t\tsum+=(((long)(0-mu[i])*((((long)(n/i))*power(n-n/i, num-2, num))%num))%num+num)%num;\n\t\t\tsum%=num;\n\t\t\t\n\t\t}\n\t\tsum+=1;\n\t\tsum%=num;\n \t\tout.println(sum);\n\t \t\t\n \t\tout.close();\n \t\t\n \t\t\n \t\t\n \t}\n\tpublic static long power(long x, long y, long mod){\n\t\tlong ans = 1;\n\t\twhile(y>0){\n\t\t\tif (y%2==1)\n\t\t\t\tans = (ans*x)%mod;\n\t\t\tx = (x*x)%mod;\n\t\t\ty/=2;\n\t\t}\n\t\treturn ans;\n\t}\n}\n \t\n \n//StringJoiner sj = new StringJoiner(\" \"); \n//sj.add(strings)\n//sj.toString() gives string of those stuff w spaces or whatever that sequence is\n\n \t\t\n \t\t\n \t\t\n \t\t\n\t\n\n", "lang_cluster": "Java", "tags": ["math", "dp", "probabilities", "number theory"], "code_uid": "10dc775cd9e42ba52f2d823e59b70d88", "src_uid": "ff810b16b6f41d57c1c8241ad960cba0", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class tr0 {\n\tstatic PrintWriter out;\n\tstatic StringBuilder sb;\n\tstatic final double EPS = 1e-9;\n\tstatic long mod = (int) 1e9 + 7;\n\tstatic int inf = (int) 1e9 + 2;\n\tstatic long[] fac;\n\tstatic int[] si;\n\tstatic ArrayList<Integer> primes;\n\tstatic TreeSet<Integer>[] ad;\n\tstatic ArrayList<pair>[] d;\n\tstatic edge[] ed;\n\tstatic boolean f;\n\tstatic int n,p;\n\tstatic int[]l,ch;\n\tstatic Boolean [][]memo;\n\tstatic Queue<Integer>[] can;\n\t\n\tpublic static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\tout = new PrintWriter(System.out);\n\t String s=sc.next();\n\t boolean is=false;\n\t int t=s.length();\n\t for(int i=1;i<s.length();i++)\n\t \tif(s.charAt(i)=='1')\n\t \t\tis=true;\n\t if(is) {\n\t \tout.print(t/2+t%2);\n\t }\n\t else {\n\t \tt--;\n\t \tout.print(t/2+t%2);\n\t }\n\t\tout.close();\n\t}\n \t// 1-based DS, OOP\n\tstatic class SegmentTree {\n\t\tint N; // the number of elements in the array as a power of 2 (i.e. after padding)\n\t\tint[] array, sTree, lazy;\n\t\tboolean[] isLeaf;\n\n\t\tSegmentTree(int[] in) {\n\t\t\tarray = in;\n\t\t\tN = in.length - 1;\n\t\t\tsTree = new int[N << 1]; // no. of nodes = 2*N - 1, we add one to cross out index zero\n\t\t\tlazy = new int[N << 1];\n\t\t\tisLeaf = new boolean[N << 1];\n\t\t\tArrays.fill(lazy, -1);\n\t\t\tbuild(1, 1, N);\n\t\t}\n\n\t\tvoid build(int node, int b, int e) // O(n)\n\t\t{\n\t\t\tif (b == e) {\n\t\t\t\tsTree[node] = array[b];\n\t\t\t\tisLeaf[node] = true;\n\t\t\t} else {\n\t\t\t\tint mid = b + e >> 1;\n\t\t\t\tbuild(node << 1, b, mid);\n\t\t\t\tbuild(node << 1 | 1, mid + 1, e);\n\t\t\t\tsTree[node] = (sTree[node << 1] + sTree[node << 1 | 1]) % 2010;\n\t\t\t}\n\t\t}\n\n\t\tvoid update_point(int index, int val) // O(log n)\n\t\t{\n\t\t\tindex += N - 1;\n\t\t\tsTree[index] += val;\n\t\t\twhile (index > 1) {\n\t\t\t\tindex >>= 1;\n\t\t\t\tsTree[index] = sTree[index << 1] + sTree[index << 1 | 1];\n\t\t\t}\n\t\t}\n\n\t\tvoid update_range(int i, int j, int val) // O(log n)\n\t\t{\n\t\t\tupdate_range(1, 1, N, i, j, val);\n\t\t}\n\n\t\tvoid update_range(int node, int b, int e, int i, int j, int val) {\n\t\t\tif (i > e || j < b)\n\t\t\t\treturn;\n\t\t\tif (b >= i && e <= j) {\n\t\t\t\tif (b == e) {\n\t\t\t\t\tsTree[node] = (sTree[node] * sTree[node]) % 2010;\n\t\t\t\t} else {\n\t\t\t\t\tsTree[node] = ((sTree[node] * sTree[node]) % 2010\n\t\t\t\t\t\t\t- (sTree[node << 1] * sTree[node << 1 | 1] * 2) % 2010 + 2010) % 2010;\n\t\t\t\t\tlazy[node] = 1;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tint mid = b + e >> 1;\n\t\t\t\tpropagate(node, b, mid, e);\n\t\t\t\tupdate_range(node << 1, b, mid, i, j, val);\n\t\t\t\tupdate_range(node << 1 | 1, mid + 1, e, i, j, val);\n\t\t\t\tsTree[node] = (sTree[node << 1] + sTree[node << 1 | 1]) % 2010;\n\t\t\t}\n\t\t}\n\n\t\tvoid propagate(int node, int b, int mid, int e) {\n\t\t\tif (lazy[node] == 1) {\n\t\t\t\tlazy[node << 1] = lazy[node];\n\t\t\t\tlazy[node << 1 | 1] = lazy[node];\n\t\t\t\tif (isLeaf[node << 1])\n\t\t\t\t\tsTree[node << 1] = sTree[node << 1] * sTree[node << 1] % 2010;\n\t\t\t\telse\n\t\t\t\t\tsTree[node << 1] = ((sTree[node << 1] * sTree[node << 1]) % 2010\n\t\t\t\t\t\t\t- (sTree[(node << 1) << 1] * sTree[(node << 1) << 1 | 1] * 2) % 2010 + 2010) % 2010;\n\t\t\t\tif (isLeaf[node << 1 | 1])\n\t\t\t\t\tsTree[node << 1 | 1] = sTree[node << 1 | 1] * sTree[node << 1 | 1] % 2010;\n\t\t\t\telse\n\t\t\t\t\tsTree[node << 1 | 1] = ((sTree[node << 1 | 1] * sTree[node << 1 | 1]) % 2010\n\t\t\t\t\t\t\t- (sTree[(node << 1 | 1) << 1] * sTree[(node << 1 | 1) << 1 | 1] * 2) % 2010 + 2010) % 2010;\n\t\t\t\tlazy[node] = -1;\n\t\t\t}\n\t\t}\n\n\t\tint query(int i, int j) {\n\t\t\treturn query(1, 1, N, i, j);\n\t\t}\n\n\t\tint query(int node, int b, int e, int i, int j) // O(log n)\n\t\t{\n\t\t\tif (i > e || j < b)\n\t\t\t\treturn 0;\n\t\t\tif (b >= i && e <= j)\n\t\t\t\treturn sTree[node];\n\t\t\tint mid = b + e >> 1;\n\t\t\tpropagate(node, b, mid, e);\n\t\t\tint q1 = query(node << 1, b, mid, i, j);\n\t\t\tint q2 = query(node << 1 | 1, mid + 1, e, i, j);\n\t\t\treturn (q1 + q2) % 2010;\n\n\t\t}\n\n\t}\n\n\tstatic Queue<Integer> k, k1;\n\tstatic boolean hg = false;\n\n\tstatic class Edge implements Comparable<Edge> {\n\t\tint node, cost;\n\n\t\tEdge(int a, int b) {\n\t\t\tnode = a;\n\t\t\tcost = b;\n\t\t}\n\n\t\tpublic int compareTo(Edge e) {\n\t\t\treturn cost - e.cost;\n\t\t}\n\t}\n\n\tstatic void ifCan(int i) {\n\t\tif (i == 6) {\n\t\t\thg = true;\n\t\t\tfor (int j : k)\n\t\t\t\tk1.add(j);\n\t\t\treturn;\n\t\t} else if (k.contains(i))\n\t\t\tifCan(i + 1);\n\t\telse {\n\t\t\tif (!hg) {\n\t\t\t\tfor (int p : can[i]) {\n\t\t\t\t\tif (!k.contains(p)) {\n\t\t\t\t\t\tk.add(i);\n\t\t\t\t\t\tk.add(p);\n\t\t\t\t\t\tifCan(i + 1);\n\t\t\t\t\t\tk.remove(i);\n\t\t\t\t\t\tk.remove(p);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tstatic class qu implements Comparable<qu> {\n\t\tint a;\n\t\tint b;\n\n\t\tqu(int a, int b) {\n\t\t\tthis.a = a;\n\t\t\tthis.b = b;\n\t\t}\n\n\t\tpublic String toString() {\n\t\t\treturn a + \" \" + b;\n\t\t}\n\n\t\t@Override\n\t\tpublic int compareTo(qu o) {\n\t\t\treturn b - o.b;\n\t\t}\n\t}\n\n\tstatic class pair {\n\t\tint to;\n\t\tint number;\n\n\t\tpair(int t, int n) {\n\t\t\tnumber = n;\n\t\t\tto = t;\n\t\t}\n\n\t\tpublic String toString() {\n\t\t\treturn to + \" \" + number;\n\t\t}\n\t}\n\n\tstatic boolean[] in;\n\n\t/*\n\t * static void mst() { Arrays.sort(ed); UnionFind uf=new UnionFind(n); for(int\n\t * i=0;i<m;i++) { edge w=ed[i]; if(!uf.union(w.from, w.to)) continue;\n\t * in[i]=true; } }\n\t */\n\tstatic class edge implements Comparable<edge> {\n\t\tint from;\n\t\tint to;\n\t\tint number;\n\n\t\tedge(int f, int t, int n) {\n\t\t\tfrom = f;\n\t\t\tto = t;\n\t\t\tnumber = n;\n\t\t}\n\n\t\tpublic String toString() {\n\t\t\treturn from + \" \" + to + \" \" + number;\n\t\t}\n\n\t\tpublic int compareTo(edge f) {\n\t\t\treturn number - f.number;\n\t\t}\n\t}\n\n\tstatic class seg implements Comparable<seg> {\n\t\tint a;\n\t\tint b;\n\n\t\tseg(int s, int e) {\n\t\t\ta = s;\n\t\t\tb = e;\n\t\t}\n\n\t\tpublic String toString() {\n\t\t\treturn a + \" \" + b;\n\t\t}\n\n\t\tpublic int compareTo(seg o) {\n\t\t\t// if(a==o.a)\n\t\t\treturn o.b - b;\n\t\t\t// return\n\t\t}\n\t}\n\n\tstatic long power(int i) {\n\t\t// if(i==0)\n\t\t// return 1;\n\t\tlong a = 1;\n\t\tfor (int k = 0; k < i; k++)\n\t\t\ta *= i;\n\t\treturn a;\n\t}\n\n\tstatic void seive() {\n\t\tsi = new int[1000001];\n\t\tprimes = new ArrayList<>();\n\t\tint N = 1000001;\n\t\tsi[1] = 1;\n\t\tfor (int i = 2; i < N; i++) {\n\t\t\tif (si[i] == 0) {\n\t\t\t\tsi[i] = i;\n\t\t\t\tprimes.add(i);\n\t\t\t}\n\t\t\tfor (int j = 0; j < primes.size() && primes.get(j) <= si[i] && (i * primes.get(j)) < N; j++)\n\t\t\t\tsi[primes.get(j) * i] = primes.get(j);\n\n\t\t}\n\t}\n\n\tstatic long inver(long x) {\n\t\tint a = (int) x;\n\t\tlong e = (mod - 2);\n\t\tlong res = 1;\n\t\twhile (e > 0) {\n\t\t\tif ((e & 1) == 1) {\n\t\t\t\t// System.out.println(res*a);\n\t\t\t\tres = (int) ((1l * res * a) % mod);\n\t\t\t}\n\t\t\ta = (int) ((1l * a * a) % mod);\n\t\t\te >>= 1;\n\t\t}\n\t\t// out.println(res+\" \"+x);\n\t\treturn res % mod;\n\t}\n\n\tstatic long fac(int n) {\n\t\tif (n == 0)\n\t\t\treturn fac[n] = 1;\n\t\tif (n == 1)\n\t\t\treturn fac[n] = 1;\n\t\tlong ans = 1;\n\t\tfor (int i = 1; i <= n; i++)\n\t\t\tfac[i] = ans = (i % mod * ans % mod) % mod;\n\t\treturn ans % mod;\n\t}\n\n\tstatic long gcd(long a, long b) {\n\n\t\tif (b == 0)\n\t\t\treturn a;\n\t\treturn gcd(b, a % b);\n\t}\n\n\tstatic class unionfind {\n\t\tint[] p;\n\t\tint[] size;\n\n\t\tunionfind(int n) {\n\t\t\tp = new int[n];\n\t\t\tsize = new int[n];\n\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tp[i] = i;\n\t\t\t}\n\t\t\tArrays.fill(size, 1);\n\t\t}\n\n\t\tint findSet(int v) {\n\t\t\tif (v == p[v])\n\t\t\t\treturn v;\n\t\t\treturn p[v] = findSet(p[v]);\n\t\t}\n\n\t\tboolean sameSet(int a, int b) {\n\t\t\ta = findSet(a);\n\t\t\tb = findSet(b);\n\t\t\tif (a == b)\n\t\t\t\treturn true;\n\t\t\treturn false;\n\t\t}\n\n\t\tint max() {\n\t\t\tint max = 0;\n\t\t\tfor (int i = 0; i < size.length; i++)\n\t\t\t\tif (size[i] > max)\n\t\t\t\t\tmax = size[i];\n\t\t\treturn max;\n\t\t}\n\n\t\tboolean combine(int a, int b) {\n\t\t\ta = findSet(a);\n\t\t\tb = findSet(b);\n\t\t\tif (a == b)\n\t\t\t\treturn true;\n\t\t\tif (size[a] > size[b]) {\n\t\t\t\tp[b] = a;\n\t\t\t\tsize[a] += size[b];\n\n\t\t\t} else {\n\t\t\t\tp[a] = b;\n\t\t\t\tsize[b] += size[a];\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tstatic class Scanner {\n\t\tStringTokenizer st;\n\t\tBufferedReader br;\n\n\t\tpublic Scanner(InputStream system) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(system));\n\t\t}\n\n\t\tpublic Scanner(String file) throws Exception {\n\t\t\tbr = new BufferedReader(new FileReader(file));\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\twhile (st == null || !st.hasMoreTokens())\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic String nextLine() throws IOException {\n\t\t\treturn br.readLine();\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic double nextDouble() throws IOException {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tpublic char nextChar() throws IOException {\n\t\t\treturn next().charAt(0);\n\t\t}\n\n\t\tpublic Long nextLong() throws IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic boolean ready() throws IOException {\n\t\t\treturn br.ready();\n\t\t}\n\n\t\tpublic void waitForInput() throws InterruptedException {\n\t\t\tThread.sleep(3000);\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["math"], "code_uid": "0976a0379f1b1f8638dafb837c80fe8e", "src_uid": "d8ca1c83b431466eff6054d3b422ab47", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.Scanner;\npublic class main {\n \n public static int [] mem;\n public static int a,b,c;\n \n public static void main(String[] args) {\n \n Scanner s= new Scanner(new BufferedReader(new InputStreamReader(System.in)));\n //BufferedReader n = new BufferedReader(new InputStreamReader(System.in));\n \n int valor=s.nextInt();\n a=s.nextInt();\n b=s.nextInt();\n c=s.nextInt();\n \n \n mem=new int [4001];\n for(int i=0;i<mem.length;i++){\n mem[i]=-10000;\n }\n mem[0]=0;\n for(int i = 1;i<mem.length;i++){\n if(i>=a && i>=b && i>=c){\n mem[i]= Math.max(1+mem[i-a], Math.max(1+mem[i-b],1+mem[i-c]));\n }\n else\n if(i>=a && i>=b)\n mem[i]= Math.max(1+mem[i-a],1+mem[i-b]);\n else\n if(i>=c && i>=b)\n mem[i]= Math.max(1+mem[i-c],1+mem[i-b]);\n else\n if(i>=a && i>=c)\n mem[i]= Math.max(1+mem[i-a],1+mem[i-c]);\n else\n if(i>=a)\n mem[i]= 1+mem[i-a];\n else\n if(i>=b)\n mem[i]= 1+mem[i-b];\n else\n if(i>=c)\n mem[i]= 1+mem[i-c];\n }\n System.out.println(mem[valor]);\n \n }\n \n}", "lang_cluster": "Java", "tags": ["brute force", "dp"], "code_uid": "ac23c04d91baaa5b4b8ba1c8aeff288a", "src_uid": "062a171cc3ea717ea95ede9d7a1c3a43", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "\timport java.io.IOException;\n\timport java.io.InputStream;\n\timport java.io.PrintWriter;\n\timport java.util.Arrays;\n\timport java.util.InputMismatchException;\n\t\n\tpublic class CF {\n\t\tstatic int mod, N; \n\t\tstatic int[] array;\n\t\tstatic long[][] memo;\n\t\tstatic int[] powpow;\n\t\tstatic int[][][] magic;\n\t\tpublic static void main(String[] args) {\n\t\t\tFasterScanner sc = new FasterScanner();\n\t\t\tPrintWriter out = new PrintWriter(System.out);\n\t\t\tchar[] str = sc.next().toCharArray();\n\t\t\tint pow = 1;\n\t\t\tmod = sc.nextInt();\n\t\t\tmagic = new int[20][10][mod];\n\t\t\tfor(int a=0;a<20;a++){\n\t\t\t\tfor(int b=0;b<10;b++)\n\t\t\t\t\tfor(int c=0;c<mod;c++)\n\t\t\t\t\t\tmagic[a][b][c]=(pow*b+c)%mod;\n\t\t\t\tpow*=10;\n\t\t\t\tpow%=mod;\n\t\t\t}\n\t\t\tN = str.length;\n\t\t\tarray = new int[N];\n\t\t\tint[] freq = new int[10];\n\t\t\tfor(int a=0;a<N;a++)\n\t\t\t\tfreq[array[a]=str[a]-'0']++;\n\t\t\tArrays.sort(array);\n\t\t\tmemo = new long[mod][1<<N];\n\t\t\tfor(int a=0;a<mod;a++)Arrays.fill(memo[a],-1);\n\t\t\tlong ways = DP(0,0);\n\t\t\tlong[] factorial = new long[20];\n\t\t\tfactorial[0]=1;\n\t\t\tlong bad = 1;\n\t\t\tfor(int a=1;a<20;a++)\n\t\t\t\tfactorial[a]=factorial[a-1]*a;\n\t\t//\tfor(int a=0;a<10;a++)\n\t\t//\t\tbad*=factorial[freq[a]];\n\t\t\tout.println(ways/bad);\n\t\t\tout.close();\n\t\t}\n\t\t\n\t\n\t\tprivate static long DP(int mask, int remain) {\n\t\t\tif(memo[remain][mask]!=-1)return memo[remain][mask];\n\t\t\tif(mask==(1<<N)-1)\n\t\t\t\treturn memo[remain][mask]=(remain==0?1L:0L);\n\t\t\tlong ans = 0;\n\t\t\tfor(int a=0;a<N;a++){\n\t\t\t\tif(((mask>>a)&1)==0){\n\t\t\t\t\tif(Integer.bitCount(mask)==0){\n\t\t\t\t\t\tif(array[a]==0)continue;\n\t\t\t\t\t}\n\t\t\t\t\tif(a>0&&(mask>>(a-1)&1)==0&&array[a]==array[a-1])continue;\n\t\t\t\t\tans+=DP(mask+(1<<a),(magic[N-Integer.bitCount(mask)-1][array[a]][remain]));\t\n\t\t\t\t//\tans+=DP(mask+(1<<a),(powpow[N-Integer.bitCount(mask)-1]*array[a]+remain)%mod);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn memo[remain][mask]=ans;\n\t\t}\n\t\n\t\tstatic boolean nextperm(int[] vals) {\n\t\t\tint N = vals.length;\n\t\t\tint K = -1;\n\t\t\tfor(int a=N-2;a>=0;a--){\n\t\t\t\tif(vals[a]<vals[a+1]){\n\t\t\t\t\tK=a;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(K==-1)return false;\n\t\t\tfor(int a=N-1;a>K;a--){\n\t\t\t\tif(vals[K]<vals[a]){\n\t\t\t\t\tswap(K,a,vals);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tint L = K+1;\n\t\t\tint R = N-1;\n\t\t\twhile(L<R){\n\t\t\t\tswap(L,R,vals);\n\t\t\t\tL++;\n\t\t\t\tR--;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\t\n\t\tpublic static void swap(int i, int j, int[] v) {\n\t\t\tint t = v[i];\n\t\t\tv[i] = v[j];\n\t\t\tv[j] = t;\n\t\t}\n\t\n\t\tstatic class FasterScanner {\n\t\t\tprivate InputStream stream;\n\t\t\tprivate byte[] buf = new byte[1024];\n\t\t\tprivate int curChar;\n\t\t\tprivate int numChars;\n\t\n\t\t\tpublic FasterScanner() {\n\t\t\t\tstream = System.in;\n\t\t\t\t// stream = new FileInputStream(new File(\"dec.in\"));\n\t\n\t\t\t}\n\t\n\t\t\tint read() {\n\t\t\t\tif (numChars == -1)\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tif (curChar >= numChars) {\n\t\t\t\t\tcurChar = 0;\n\t\t\t\t\ttry {\n\t\t\t\t\t\tnumChars = stream.read(buf);\n\t\t\t\t\t} catch (IOException e) {\n\t\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t\t}\n\t\t\t\t\tif (numChars <= 0)\n\t\t\t\t\t\treturn -1;\n\t\t\t\t}\n\t\t\t\treturn buf[curChar++];\n\t\t\t}\n\t\n\t\t\tboolean isSpaceChar(int c) {\n\t\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t\t}\n\t\n\t\t\tboolean isEndline(int c) {\n\t\t\t\treturn c == '\\n' || c == '\\r' || c == -1;\n\t\t\t}\n\t\n\t\t\tint nextInt() {\n\t\t\t\treturn Integer.parseInt(next());\n\t\t\t}\n\t\n\t\t\tlong nextLong() {\n\t\t\t\treturn Long.parseLong(next());\n\t\t\t}\n\t\n\t\t\tdouble nextDouble() {\n\t\t\t\treturn Double.parseDouble(next());\n\t\t\t}\n\t\n\t\t\tString next() {\n\t\t\t\tint c = read();\n\t\t\t\twhile (isSpaceChar(c))\n\t\t\t\t\tc = read();\n\t\t\t\tStringBuilder res = new StringBuilder();\n\t\t\t\tdo {\n\t\t\t\t\tres.appendCodePoint(c);\n\t\t\t\t\tc = read();\n\t\t\t\t} while (!isSpaceChar(c));\n\t\t\t\treturn res.toString();\n\t\t\t}\n\t\n\t\t\tString nextLine() {\n\t\t\t\tint c = read();\n\t\t\t\twhile (isEndline(c))\n\t\t\t\t\tc = read();\n\t\t\t\tStringBuilder res = new StringBuilder();\n\t\t\t\tdo {\n\t\t\t\t\tres.appendCodePoint(c);\n\t\t\t\t\tc = read();\n\t\t\t\t} while (!isEndline(c));\n\t\t\t\treturn res.toString();\n\t\t\t}\n\t\n\t\t}\n\t\n\t}", "lang_cluster": "Java", "tags": ["brute force", "dp", "combinatorics", "bitmasks", "number theory"], "code_uid": "28e4eee2c7ba5106e0ce6472f49cde0e", "src_uid": "5eb90c23ffa3794fdddc5670c0373829", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\n\npublic class A {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.next();\n\t\tint N = s.length();\n\t\tint max = -1;\n\t\tint LIM = 1000000;\n\t\tfor(int i=1; i<N-1; i++) {\n\t\t\tfor(int j=i+1; j<N; j++) {\n\t\t\t\tString a = s.substring(0, i);\n\t\t\t\tString b = s.substring(i, j);\n\t\t\t\tString c = s.substring(j);\n//\t\t\t\tSystem.out.println(a +\" \" + b +\" \" + c);\n\t\t\t\tif(a.length() > 1 && a.charAt(0) == '0')\n\t\t\t\t\tcontinue;\n\t\t\t\tif(b.length() > 1 && b.charAt(0) == '0')\n\t\t\t\t\tcontinue;\n\t\t\t\tif(c.length() > 1 && c.charAt(0) == '0')\n\t\t\t\t\tcontinue;\n\t\t\t\tif(a.length() > 8 || b.length() > 8 || c.length() > 8)\n\t\t\t\t\tcontinue;\n\t\t\t\tint x = Integer.parseInt(a);\n\t\t\t\tint y = Integer.parseInt(b);\n\t\t\t\tint z = Integer.parseInt(c);\n\t\t\t\tif(x > LIM || y > LIM || z > LIM)\n\t\t\t\t\tcontinue;\n\t\t\t\tmax = Math.max(max, x+y+z);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(max);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "8c86b34438ad0186fdfb3db33b762f28", "src_uid": "bf4e72636bd1998ad3d034ad72e63097", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Comparator;\nimport java.util.List;\n\npublic class CyclicPermutations { // Template for CF\n public static class ListComparator implements Comparator<List<Integer>> {\n\n @Override\n public int compare(List<Integer> l1, List<Integer> l2) {\n for (int i = 0; i < l1.size(); ++i) {\n if (l1.get(i).compareTo(l2.get(i)) != 0) {\n return l1.get(i).compareTo(l2.get(i));\n }\n }\n return 0;\n }\n }\n\n public static class Pair {\n int first;\n int second;\n\n public Pair(int first, int second) {\n this.first = first;\n this.second = second;\n }\n\n public int getFirst() {\n return first;\n }\n\n public int getSecond() {\n return second;\n }\n\n @Override\n public String toString() {\n return first + \" \" + second;\n }\n }\n\n public static void main(String[] args) throws IOException {\n // Check for int overflow!!!!\n // Should you use a long to store the sum or smthn?\n BufferedReader f = new BufferedReader(new InputStreamReader(System.in));\n PrintWriter out = new PrintWriter(System.out);\n\n long n = Integer.parseInt(f.readLine());\n long bad = 1;\n long mod = 1000000007;\n for (int j = 0; j < n - 1; j++) {\n bad *= 2;\n bad %= mod;\n }\n long prod = 1;\n for (long j = n; j > 0; j--) {\n prod *= j;\n prod %= mod;\n }\n if (prod - bad >= 0) {\n out.println(prod - bad);\n } else {\n out.println(mod + prod - bad);\n }\n out.close();\n }\n\n}", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics", "graphs"], "code_uid": "71892c88f54e862b73e338a2a8d0a4f7", "src_uid": "3dc1ee09016a25421ae371fa8005fce1", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\n\npublic class Solution {\n\n\tprivate static int res;\n\tprivate static int[] numberOfPrimeDivisor;\n\n\t/**\n\t * @param args\n\t */\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\t\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\t\n\t\tint[] plainNumber = new int [n];\n\t\tfor(int i=0;i<plainNumber.length;i++){\n\t\t\tplainNumber[i] = i+1;\n\t\t}\n\t\tplainNumber[0] = -1;\n\t\tgetNumbers(plainNumber);\n\t\tnumberOfPrimeDivisor = new int [ n ];\n\t\tint count = 0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tint a = getNumberOfPrimeDivisors(i+1);\n\t\t\tif(a==2){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\t\n\t\t\n\t\n\t\tSystem.out.println(count);\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t}\n\n\tprivate static int getNumberOfPrimeDivisors(int i) {\n\t\t\n\t\t\tList<Integer> factors = primeFactors(i);\n\t\t\tint count = 1;\n\t\t\tfor(int j=1;j<factors.size();j++){\n\t\t\t\tif(factors.get(j)!=factors.get(j-1)){\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\treturn count;\n\t\t\n\t}\n\n\t\n\t public static List<Integer> primeFactors(int number) {\n\t\t int n = number;\n\t\t List<Integer> factors = new ArrayList<Integer>();\n\t\t for (int i = 2; i <= n; i++) {\n\t\t while (n % i == 0) {\n\t\t factors.add(i);\n\t\t n /= i;\n\t\t }\n\t\t }\n\t\t return factors;\n\t\t }\n\t \n\tprivate static void getNumbers(int[] plainNumber) {\n\t\tfor(int i =2;i<plainNumber.length+1;i++){\n\t\t\tint a =2;\n\t\t\twhile(a*i<plainNumber.length){\n\t\t\t\tplainNumber[a*i-1] = -1;\n\t\t\t\ta++;\n\t\t\t}\n\t\t}\n\t\t\n\t\t\n\t}\n\n\t\n\n}\n", "lang_cluster": "Java", "tags": ["number theory"], "code_uid": "7a010124069e0008d8c0f1433529f0f9", "src_uid": "356666366625bc5358bc8b97c8d67bd5", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.HashSet;\nimport java.util.LinkedList;\nimport java.util.Queue;\nimport java.util.Scanner;\nimport java.util.Set;\n\npublic class Contest {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\ttry (Scanner scanner = new Scanner(System.in)) {\n\t\t\tint k = scanner.nextInt();\n\t\t\tscanner.nextLine();\n\t\t\tint MAX = 311;\n\t\t\t//Queue\n\t\t\t\n\t//\t\tint[][][] hash = new int[MAX][MAX][8];\n\t\t\tint[][] mask = new int[MAX][MAX];\n\n\t\t\tint[] dx = {1, 1, 0, -1, -1, -1, 0, 1};\n\t\t\tint[] dy = {0, -1, -1, -1, 0, 1, 1, 1};\n\t\t\t\n\t\t\tSet<Integer> curQueue = new HashSet<Integer>();\n\t\t//\thash[MAX/2][MAX/2][0] = 0;\n\t\t\tcurQueue.add(getStatus(MAX/2, MAX/2, 0));\n\t\t\t//curQueue.add();\n\t\t\tfor (int i = 1; i <= k; i++) {\n\t\t\t\tint next = scanner.nextInt();\n\t\t\t\tSet<Integer> newQueue = new HashSet<Integer>();\n\t\t\t\tfor (int cur : curQueue) {\n\t\t\t\t\tint curDirection = cur & 0x7;\n\t\t\t\t\tint curY = (cur >> 3) & 0x1FF;\n\t\t\t\t\tint curX = (cur >> 12) & 0x1FF;\n\t\t\t\t//\tif (hash[curX][curY][curDirection] < next) {\n\t\t\t//\t\t\thash[curX][curY][curDirection] = next;\n\t\t\t\t\t\tint j = 1;\n\t\t\t\t\t\twhile(true) {\n\t\t\t\t\t\t\tcurX += dx[curDirection];\n\t\t\t\t\t\t\tcurY += dy[curDirection];\n\t\t\t\t\t\t//\tSystem.out.println(curX);\n\t\t\t\t\t\t\tmask[curX][curY] = 1;\n\t\t\t\t\t\t\tif (j == next) {\n\t\t\t\t\t\t\t\tnewQueue.add(getStatus(curX, curY, (curDirection + 1) % 8));\n\t\t\t\t\t\t\t\tint newDir = (curDirection - 1) % 8;\n\t\t\t\t\t\t\t\tif (newDir < 0) newDir = 8 + newDir;\n\t\t\t\t\t\t\t\tnewQueue.add(getStatus(curX, curY, (newDir) % 8));\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t//\t\t\tif (hash[curX][curY][curDirection] < next - j) {\n\t\t\t\t//\t\t\t\thash[curX][curY][curDirection] = next - j;\n\t\t\t\t//\t\t\t} else break;\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tj++;\t\t\t\t\t\n\t\t\t\t\t\t}\n\t\t\t\t//\t}\t\n\t\t\t\t}\n//\t\t\t\twhile (!curQueue.isEmpty()) {\n//\t\t\t\t\t//int cur = curQueue.();\n//\t\t\t\t\tint curDirection = cur & 0x7;\n//\t\t\t\t\tint curY = (cur >> 3) & 0x1FF;\n//\t\t\t\t\tint curX = (cur >> 12) & 0x1FF;\n//\t\t\t\t\tif (hash[curX][curY][curDirection] < next) {\n//\t\t\t\t\t\thash[curX][curY][curDirection] = next;\n//\t\t\t\t\t\tint j = 1;\n//\t\t\t\t\t\twhile(true) {\n//\t\t\t\t\t\t\tcurX += dx[curDirection];\n//\t\t\t\t\t\t\tcurY += dy[curDirection];\n//\t\t\t\t\t\t//\tSystem.out.println(curX);\n//\t\t\t\t\t\t\tmask[curX][curY] = 1;\n//\t\t\t\t\t\t\tif (j == next) {\n//\t\t\t\t\t\t\t\tnewQueue.add(getStatus(curX, curY, (curDirection + 1) % 8));\n//\t\t\t\t\t\t\t\tint newDir = (curDirection - 1) % 8;\n//\t\t\t\t\t\t\t\tif (newDir < 0) newDir = 8 + newDir;\n//\t\t\t\t\t\t\t\tnewQueue.add(getStatus(curX, curY, (newDir) % 8));\n//\t\t\t\t\t\t\t\tbreak;\n//\t\t\t\t\t\t\t}\n//\t\t\t\t\t\t\tif (hash[curX][curY][curDirection] < next - j) {\n//\t\t\t\t\t\t\t\thash[curX][curY][curDirection] = next - j;\n//\t\t\t\t\t\t\t} else break;\t\t\t\t\t\t\t\n//\t\t\t\t\t\t\tj++;\t\t\t\t\t\n//\t\t\t\t\t\t}\n//\t\t\t\t\t}\t\t\t\t\t\n//\t\t\t\t}\n\t\t\t\tcurQueue = newQueue;\n\t\t\t}\n\t\t\t\n\t\t\tint res = 0;\n\t\t\tfor (int i = 0; i < MAX; i++) {\n\t\t\t\tfor (int j = 0; j < MAX; j++) {\n\t\t\t\t\tif (mask[i][j] == 1) res++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(res);\n//\t\t\tSystem.out.println(mask[299][299]);\n\t\t}\n\t}\n\t\n\tpublic static int getStatus(int x, int y, int direction) {\n\t\tint result = 0;\n\t\tresult = x;\n\t\tresult = (result << 9) | y;\n\t\tresult = (result << 3) | direction;\n\t\t//result = (result << 3) | value;\n\t\treturn result;\n\t}\n\t\n\t\n\t\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "brute force", "dp", "data structures", "implementation"], "code_uid": "d45a0aae1a149fe4fc2e496c6ef26b88", "src_uid": "a96bc7f93fe9d9d4b78018b49bbc68d9", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.BigInteger;\n\npublic class Main {\n static void solve(InputReader reader, OutputWriter writer)\n throws IOException {\n // Scanner scan = new Scanner(System.in);\n String a = reader.readLine();\n char c = a.charAt(0);\n String s = reader.readLine();\n char[] cc = { 'q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p', 'a',\n 's', 'd', 'f', 'g', 'h', 'j', 'k', 'l', ';', 'z', 'x', 'c',\n 'v', 'b', 'n', 'm', ',', '.', '/' };\n if(c == 'R'){\n for (int i = 0; i < s.length(); ++i){\n int index = 0;\n for (int k = 0; k < cc.length; ++k){\n if(s.charAt(i) == cc[k]){\n index = --k;\n // writer.println(index);\n break;\n }\n }\n if(i < s.length() - 1)\n writer.print(cc[index]);\n else\n writer.println(cc[index]);\n }\n }else{\n for (int i = 0; i < s.length(); ++i){\n int index = 0;\n for (int k = 0; k < cc.length; ++k){\n if(s.charAt(i) == cc[k]){\n index = ++k;\n break;\n }\n }\n if(i < s.length() - 1)\n writer.print(cc[index]);\n else\n writer.println(cc[index]);\n }\n }\n\n }\n\n public static void main(String[] args) throws Exception {\n InputReader reader = new InputReader(System.in);\n OutputWriter writer = new OutputWriter(System.out);\n try {\n solve(reader, writer);\n } catch (Exception e) {\n e.printStackTrace(System.out);\n } finally {\n writer.close();\n }\n }\n\n}\n\nclass InputReader extends BufferedReader {\n public InputReader(InputStream in) {\n super(new InputStreamReader(in));\n }\n}\n\nclass OutputWriter extends PrintWriter {\n public OutputWriter(PrintStream out) {\n super(new BufferedWriter(new OutputStreamWriter(out)));\n }\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "00733f0e929794c4b0f4b1772d4b9f9a", "src_uid": "df49c0c257903516767fdb8ac9c2bfd6", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class TheMonster {\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n\t\tString[] p = in.readLine().split(\" \");\n\t\tint a = Integer.parseInt(p[0]);\n\t\tlong b = Long.parseLong(p[1]);\n\t\t\n\t\tboolean aa = a % 2 == 0;\n\t\tboolean bb = b % 2 == 0;\n\t\t\n\t\tString[] q = in.readLine().split(\" \");\n\t\tint c = Integer.parseInt(q[0]);\n\t\tlong d = Long.parseLong(q[1]);\n\t\t\n\t\tboolean cc = c % 2 == 0;\n\t\tboolean dd = d % 2 == 0;\n\t\t\n\t\tif(!((!bb && aa && dd && cc)||(!dd&&cc&&bb&&aa))) {\n\t\t\twhile(b != d) {\n\t\t\t\tif(b < d) {\n\t\t\t\t\tb+=a;\n\t\t\t\t} else {\n\t\t\t\t\td+=c;\n\t\t\t\t}\n\t\t\t\tif(d > 10000000) {\n\t\t\t\t\tb = -1;\n\t\t\t\t\td = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(b);\n\t\t} else {\n\t\t\tSystem.out.println(-1);\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "number theory"], "code_uid": "1f8224994c32fe169828aa2e71242173", "src_uid": "158cb12d45f4ee3368b94b2b622693e7", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.math.BigInteger;\nimport java.util.*;\n\npublic class A {\n\n int n, k;\n int[][] memo;\n \n private int dp(int index, int sum) {\n if (index == n && sum == k)\n return 0;\n if (sum > k)\n return 1 << 29;\n if (index == n)\n return 1 << 29;\n if (memo[index][sum] != -1)\n return memo[index][sum];\n int res = 1 << 28;\n for (int i = 2; i <= 5; i++) {\n res = Math.min(res, ((i == 2) ? 1 : 0) + dp(index + 1, sum + i));\n }\n return memo[index][sum] = res;\n }\n\n private void solve() throws IOException {\n memo = new int[55][255];\n for (int[] a : memo) Arrays.fill(a, -1);\n n = nextInt();\n k = nextInt();\n pl(dp(0, 0));\n }\n\n public static void main(String[] args) {\n new A().run();\n }\n\n BufferedReader reader;\n StringTokenizer tokenizer;\n PrintWriter writer;\n\n public void run() {\n try {\n reader = new BufferedReader(new InputStreamReader(System.in));\n tokenizer = null;\n writer = new PrintWriter(System.out);\n solve();\n reader.close();\n writer.close();\n } catch (Exception e) {\n e.printStackTrace();\n System.exit(1);\n }\n }\n\n int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n BigInteger nextBigInteger() throws IOException {\n return new BigInteger(nextToken());\n }\n\n String nextToken() throws IOException {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n tokenizer = new StringTokenizer(reader.readLine());\n }\n return tokenizer.nextToken();\n }\n\n void p(Object... objects) {\n for (int i = 0; i < objects.length; i++) {\n if (i != 0)\n writer.print(' ');\n writer.flush();\n writer.print(objects[i]);\n writer.flush();\n }\n }\n\n void pl(Object... objects) {\n p(objects);\n writer.flush();\n writer.println();\n writer.flush();\n }\n\n int cc;\n\n void pf() {\n writer.printf(\"Case #%d: \", ++cc);\n writer.flush();\n }\n\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "ed41da3de3c85281052fc7d836db90db", "src_uid": "5a5e46042c3f18529a03cb5c868df7e8", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\n\nimport java.util.Scanner;\n\n\n\npublic class JavaApplication1 {\n\n \n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int[] a = new int[1001];\n for (int i=0; i<n; i++) {\n a[sc.nextInt()]=1;\n }\n sc.close();\n \n for (int i=1; i<=998; i++) {\n if (a[i]+a[i+1]+a[i+2]==3) {\n System.out.println(\"YES\");\n return;\n }\n }\n \n System.out.println(\"NO\");\n \n }\n \n}\n", "lang_cluster": "Java", "tags": ["brute force", "sortings", "implementation"], "code_uid": "80623c49c7e439078e340546d063a577", "src_uid": "d6c876a84c7b92141710be5d76536eab", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Scanner;\n\npublic class C {\n\n\n public static void main(String arg[]) {\n\n Scanner reader = new Scanner(System.in);\n\n long a = reader.nextLong();\n long b = reader.nextLong();\n\n System.out.println(f(a, b));\n\n }\n\n static long f(long a, long b) {\n\n if (a == 1)\n return b;\n if (b == 1)\n return a;\n\n if (a < b) {\n long t = a;\n a = b;\n b = t;\n }\n return a / b + f(b, a % b);\n }\n\n\n}\n", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "b6a290aca8a273a790e54ac57df78006", "src_uid": "792efb147f3668a84c866048361970f8", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class main {\n\tpublic static void main(String[] all) {\n\t\tScanner input = new Scanner(System.in);\n\t\tint t = input.nextInt();\n\t\twhile (t-- > 0) {\n\t\t\tint n = input.nextInt();\n\t\t\tString num = \"\"+n;\n\t\t\tn = n % 10;\n\t\t\tint sum = 0;\n\t\t\tfor (int i = 1; i < n; i++) sum += 10;\n\t\t\tfor (int i = 1; i < num.length()+1; i++) sum += i;\n\t\t\tSystem.out.println(sum);\n\t\t}\n\t\tinput.close();\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "7d187626cee8c001964570729283d6fa", "src_uid": "289a55128be89bb86a002d218d31b57f", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.BufferedWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class EE {\n private static BufferedReader in;\n private static StringTokenizer st;\n private static PrintWriter out;\n private static int mod;\n \n public static void main(String[] args) throws NumberFormatException, IOException {\n in = new BufferedReader(new InputStreamReader(System.in));\n st = new StringTokenizer(\"\");\n out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n int a = nextInt();\n int b = nextInt();\n int n = nextInt();\n long s1 = System.currentTimeMillis();\n mod = (int) (1e9+7);\n long fact = 1;\n for (long i = 1; i <= n; i++) {\n fact = (fact * i) % mod;\n }\n long factinverse[] = new long[n+1];\n factinverse[0] = 1;\n for (int i = 1; i <=n; i++) {\n long x = ModPow(i, mod - 2);\n factinverse[i] = (factinverse[i-1] * x) % mod;\n }\n long ans = 0;\n for (int i = 0; i <=n; i++) {\n int x = i*a +(n-i)*b;\n if(good(x, a, b)){\n long f2 = (factinverse[i] * factinverse[n-i]) % mod; \n ans = (ans + f2) % mod;\n }\n }\n ans = (ans * fact) % mod;\n long s2 = System.currentTimeMillis();\n// System.out.println((s2-s1)/1000.0);\n System.out.println(ans);\n }\n private static long ModPow(long a, int n) {\n long res = 1;\n while(n > 0){\n if((n & 1)== 1)\n res = (res * a) % mod;\n a = (a * a) % mod;\n n >>= 1;\n }\n return res;\n }\n private static boolean good(int x, int a, int b) {\n while(x > 0){\n int qol = x % 10;\n if(qol != a && qol!=b){\n return false;\n }\n x /= 10;\n }\n return true;\n }\n\n static String next() throws IOException{\n while(!st.hasMoreTokens()){\n st = new StringTokenizer(in.readLine());\n }\n return st.nextToken();\n }\n static int nextInt() throws NumberFormatException, IOException{\n return Integer.parseInt(next());\n }\n static long nextLong() throws NumberFormatException, IOException{\n return Long.parseLong(next());\n }\n \n static double nextDouble() throws NumberFormatException, IOException{\n return Double.parseDouble(next());\n }\n\n}", "lang_cluster": "Java", "tags": ["brute force", "combinatorics"], "code_uid": "e890a6f09a884cf0b4bc3e5e03a92b3c", "src_uid": "d3e3da5b6ba37c8ac5f22b18c140ce81", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.LinkedHashMap;\nimport java.util.Map;\n\npublic class Main {\n\tprivate static Object unexpected = null;\n\tprivate static final int mod = (int) 1E9 + 7;\n\tprivate static final int ibufsize = (1 << 15), obufsize = (1 << 14);\n\tprivate static int iNextByte, iNextIndex, iReadByteCount, oNextIndex;\n\tprivate static final byte ibuf[] = new byte[ibufsize], obuf[] = new byte[obufsize];\n\tprivate static InputStream is = System.in;\n\tprivate static OutputStream os = System.out;\n\n\tprivate Main() throws Exception {\n\t\tif (inFromFile) is = new FileInputStream(new File(\"\").getAbsolutePath() + \"/src/testdata/in.txt\");\n\t\tif (outToFile) os = new FileOutputStream(new File(\"\").getAbsolutePath() + \"/src/testdata/out.txt\");\n\t\tnextByte();\n\t\tsolve();\n\t\tis.close();\n\t\tflushOutBuf();\n\t}\n\n\tpublic static void main(String[] args) {\n\t\ttry {\n\t\t\tnew Main();\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}\n\n\tprivate boolean isDigit(int cp) {\n\t\treturn '0' <= cp && cp <= '9';\n\t}\n\n\tprivate boolean isLowercase(int cp) {\n\t\treturn 'a' <= cp && cp <= 'z';\n\t}\n\n\tprivate boolean isUppercase(int cp) {\n\t\treturn 'A' <= cp && cp <= 'Z';\n\t}\n\n\tprivate boolean isAlphabet(int cp) {\n\t\treturn ('a' <= cp && cp <= 'z') || ('A' <= cp && cp <= 'Z');\n\t}\n\n\tprivate boolean isAlphanumberic(char ch) {\n\t\treturn (ch >= '0' && ch <= '9') || (ch >= 'a' && ch <= 'z') || (ch >= 'A' || ch <= 'Z');\n\t}\n\n\tprivate boolean isWhitespace(int cp) {\n\t\treturn cp == ' ' || cp == '\\r' || cp == '\\n' || cp == '\\t';\n\t}\n\n\tprivate boolean isWordSeparator(int cp) {\n\t\treturn cp == ' ' || cp == '\\r' || cp == '\\n' || cp == '\\t';\n\t}\n\n\tprivate boolean isLineSeparator(int cp) {\n\t\treturn cp == '\\n' || cp == '\\r';\n\t}\n\n\tprivate boolean isUnexpected() {\n\t\treturn unexpected != null;\n\t}\n\n\tprivate Object setUnexpected(Object value) {\n\t\treturn (unexpected = value);\n\t}\n\n\tprivate boolean isNegative() throws IOException {\n\t\tboolean minus = false;\n\t\twhile (iNextByte == '+' || iNextByte == '-') {\n\t\t\tif (iNextByte == '-') minus = !minus;\n\t\t\tnextByte();\n\t\t}\n\t\treturn minus;\n\t}\n\n\tprivate int nextByte() throws IOException {\n\t\tif (iNextIndex >= iReadByteCount) {\n\t\t\tiReadByteCount = is.read(ibuf, 0, ibufsize);\n\t\t\tif (iReadByteCount == -1) return (iNextByte = -1);\n\t\t\tiNextIndex = 0;\n\t\t}\n\t\treturn (iNextByte = ibuf[iNextIndex++]);\n\t}\n\n\tprivate char nc() throws IOException {\n\t\treturn (char) nextByte();\n\t}\n\n\tprivate char[] nc(int n) throws IOException {\n\t\tchar a[] = new char[n];\n\t\tfor (int i = 0; i < n; ++i) a[i] = nc();\n\t\treturn a;\n\t}\n\n\tprivate char[][] nc(int r, int c) throws IOException {\n\t\tchar a[][] = new char[r][c];\n\t\tfor (int i = 0; i < r; ++i) a[i] = nc(c);\n\t\treturn a;\n\t}\n\n\tprivate int ni() throws IOException {\n\t\twhile (isWhitespace(iNextByte)) nextByte();\n\t\tint res = 0;\n\t\tboolean minus = isNegative();\n\t\tif (!isDigit(iNextByte)) return (int) setUnexpected(-1);\n\t\tdo {res = (res << 1) + (res << 3) + iNextByte - '0';} while (isDigit(nextByte()));\n\t\treturn minus ? -res : res;\n\t}\n\n\tprivate int[] ni(int n) throws IOException {\n\t\tint a[] = new int[n];\n\t\tfor (int i = 0; i < n; ++i) a[i] = ni();\n\t\treturn a;\n\t}\n\n\tprivate int[][] ni(int r, int c) throws IOException {\n\t\tint a[][] = new int[r][c];\n\t\tfor (int i = 0; i < r; ++i) a[i] = ni(c);\n\t\treturn a;\n\t}\n\n\tprivate long nl() throws IOException {\n\t\twhile (isWhitespace(iNextByte)) nextByte();\n\t\tlong res = 0;\n\t\tboolean minus = isNegative();\n\t\tif (!isDigit(iNextByte)) return (long) setUnexpected(-1);\n\t\tdo {res = (res << 1) + (res << 3) + iNextByte - '0';} while (isDigit(nextByte()));\n\t\treturn minus ? -res : res;\n\t}\n\n\tprivate long[] nl(int n) throws IOException {\n\t\tlong a[] = new long[n];\n\t\tfor (int i = 0; i < n; ++i) a[i] = nl();\n\t\treturn a;\n\t}\n\n\tprivate long[][] nl(int r, int c) throws IOException {\n\t\tlong a[][] = new long[r][c];\n\t\tfor (int i = 0; i < r; ++i) a[i] = nl(c);\n\t\treturn a;\n\t}\n\n\tprivate double nd() throws IOException {\n\t\twhile (isWhitespace(iNextByte)) nextByte();\n\t\tboolean minus = isNegative();\n\t\tif (!isDigit(iNextByte)) return (double) setUnexpected(-1.0);\n\t\tdouble decimal = 0, floating = 0, div = 1;\n\t\tdo {decimal = 10 * decimal + (iNextByte - '0');} while (isDigit(nextByte()));\n\t\tif (iNextByte == '.') while (isDigit(nextByte())) floating += (iNextByte - '0') / (div *= 10);\n\t\tdouble res = decimal + floating;\n\t\treturn minus ? -res : res;\n\t}\n\n\tprivate double[] nd(int n) throws IOException {\n\t\tdouble a[] = new double[n];\n\t\tfor (int i = 0; i < n; ++i) a[i] = nd();\n\t\treturn a;\n\t}\n\n\tprivate double[][] nd(int r, int c) throws IOException {\n\t\tdouble a[][] = new double[r][c];\n\t\tfor (int i = 0; i < r; ++i) a[i] = nd(c);\n\t\treturn a;\n\t}\n\n\tprivate String line() throws IOException {\n\t\twhile (isWhitespace(iNextByte)) nextByte();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile (iNextByte != -1 && !isLineSeparator(iNextByte)) {\n\t\t\tsb.append((char) iNextByte);\n\t\t\tnextByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tprivate String ns() throws IOException {\n\t\twhile (isWordSeparator(iNextByte)) nextByte();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile (iNextByte != -1 && !isWordSeparator(iNextByte)) {\n\t\t\tsb.append((char) iNextByte);\n\t\t\tnextByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tprivate String[] ns(int n) throws IOException {\n\t\tString a[] = new String[n];\n\t\tfor (int i = 0; i < n; ++i) a[i] = ns();\n\t\treturn a;\n\t}\n\n\tprivate String[][] ns(int r, int c) throws IOException {\n\t\tString a[][] = new String[r][c];\n\t\tfor (int i = 0; i < r; ++i) a[i] = ns(c);\n\t\treturn a;\n\t}\n\n\tprivate void flushOutBuf() {\n\t\tif (oNextIndex == 0) return;\n\t\ttry {\n\t\t\tos.write(obuf, 0, oNextIndex);\n\t\t\tos.flush();\n\t\t\toNextIndex = 0;\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}\n\n\tprivate void puts(String format, Object... args) {\n\t\tif (args != null) format = String.format(format, args);\n\t\tfor (int i = 0, n = format.length(); i < n; ++i) {\n\t\t\tobuf[oNextIndex++] = (byte) format.charAt(i);\n\t\t\tif (oNextIndex >= obufsize) flushOutBuf();\n\t\t}\n\t}\n\n\tprivate <T> void print(T ob) {\n\t\tputs(ob + \"\");\n\t}\n\n\tprivate void print(String format, Object... args) {\n\t\tputs(format, args);\n\t}\n\n\tprivate <T> void println(T ob) {\n\t\tputs(ob + \"\\n\");\n\t}\n\n\tprivate void println(String format, Object... args) {\n\t\tputs(format + \"\\n\", args);\n\t}\n\n\tprivate <T> void debug(T ob) {\n\t\tputs(\"\\u001B[31m\" + ob + \"\\u001B[0m\");\n\t}\n\n\tprivate <T> void debug(String format, Object... args) {\n\t\tputs(\"\\u001B[31m\" + format + \"\\u001B[0m\", args);\n\t}\n\n\tprivate <T> void debugln(T ob) {\n\t\tputs(\"\\u001B[31m\" + ob + \"\\u001B[0m\\n\");\n\t}\n\n\tprivate void debugln(String format, Object... args) {\n\t\tputs(\"\\u001B[31m\" + format + \"\\u001B[0m\\n\", args);\n\t}\n\n\tprivate void solve() throws Exception {\n\t\tchar a[] = ns().toCharArray();\n\t\tint hasOneBefore = 0, ans = 0;\n\t\tfor(int i = 0; i < a.length; ++i) {\n\t\t\tchar ch = a[i];\n\t\t\tif(a[i] == '1') {\n\t\t\t\thasOneBefore = 1;\n\t\t\t} else {\n\t\t\t\tans += hasOneBefore;\n\t\t\t}\n\t\t}\n\t\tprintln(ans >= 6? \"yes\":\"no\");\n\t}\n\n\tprivate static final boolean inFromFile = false, outToFile = false;\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "1f52146c049e3e38e8f410142b3f2166", "src_uid": "88364b8d71f2ce2b90bdfaa729eb92ca", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class button {\n\tpublic static void main(String args[]) throws Exception {\n\t\tScanner in;\n\t\ttry {\n\t\t\tin = new Scanner(new File(\"input23.txt\"));\n\t\t}\n\t\tcatch (Exception e) {\n\t\t\tin = new Scanner(System.in);\n\t\t}\n\t\tint n = in.nextInt(), m = in.nextInt(), count = 0;\n\t\twhile (m > n) {\n\t\t\tcount++;\n\t\t\tif (m % 2 == 1) {\n\t\t\t\tm++;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tm /= 2;\n\t\t\t}\n\t\t}\n\t\tcount += n - m;\n\t\tSystem.out.println(count);\n\t}\n}", "lang_cluster": "Java", "tags": ["dfs and similar", "shortest paths", "math", "graphs", "greedy", "implementation"], "code_uid": "249ae33a1b62c31b0af5e816139ace4e", "src_uid": "861f8edd2813d6d3a5ff7193a804486f", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n long n = in.nextLong();\n long part = 1 + (n-3)*3 + (n-4)*(n-3);\n p(part);\n }\n\n static void p(Object str){\n System.out.println(str);\n }\n}\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "f3a5dca82a33046e62c83ff6af95d730", "src_uid": "efa8e7901a3084d34cfb1a6b18067f2b", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\npublic class DashaandStairs {\n\n public static void main(String[]args){\n Scanner sc=new Scanner(System.in);\n int a=sc.nextInt();int b=sc.nextInt();\n if(a==0 && b==0)\n System.out.print(\"NO\");\n else\n if(a==b || a-b==1 || a-b==-1)\n System.out.print(\"YES\");\n else\n System.out.print(\"NO\");\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "constructive algorithms", "implementation"], "code_uid": "ade6f1b81c901928320f711d5cd5c8e6", "src_uid": "ec5e3b3f5ee6a13eaf01b9a9a66ff037", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.Scanner;\npublic class newYearAndHurry\n{\n /*\n public static void main(String[] args)\n {\n Scanner s1=new Scanner(System.in);\n int n=s1.nextInt();\n int k=s1.nextInt();\n int ans=0;\n int sum=5;\n int i=2;\n while(240-k>=sum)\n {\n sum+=5*i;\n i++;\n ans++;\n if(ans> n) \n ans=n;\n }\n System.out.println(ans);\n }*/\n public static void main(String[] args)\n {\n Scanner s1=new Scanner(System.in);\n int n=s1.nextInt();\n int k=s1.nextInt();\n int time=240-k;\n int ans=0;\n int start=1;\n int end=240;\n while(start<=end)\n { \n int middle=(start+end)/2;\n int sum= 5 * (middle) *(middle+1) / 2;\n if (time>=sum)\n {\n //System.out.println(sum);\n start=middle+1;\n ans=start;\n }\n else\n {\n end=middle-1;\n }\n }\n if (ans>n)\n ans=n+1;\n if (ans<=0)\n ans=1;\n System.out.println(ans-1);\n }\n\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "implementation", "binary search"], "code_uid": "e164a90d454299a07fe8e752bc3d4b13", "src_uid": "41e554bc323857be7b8483ee358a35e2", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "//package round30;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class B {\n\tprivate Scanner in;\n\tprivate PrintWriter out;\n//\tprivate String INPUT = \"31.12.18\\n01.01.01\";\n//\tprivate String INPUT = \"01.01.98\\n01.01.80\";\n//\tprivate String INPUT = \"29.02.96\\n29.02.04\";\n//\tprivate String INPUT = \"20.10.20\\n09.02.30\";\n//\tprivate String INPUT = \"01.03.74\\n29.02.56\";\n\tprivate String INPUT = \"\";\n\t\n\tpublic void solve()\n\t{\n\t\tString[] ds = in.next().split(\"\\\\.\");\n\t\tString[] db = in.next().split(\"\\\\.\");\n\t\t\n\t\tint dd = Integer.parseInt(ds[0]);\n\t\tint mm = Integer.parseInt(ds[1]);\n\t\tint yy = Integer.parseInt(ds[2]);\n\t\tint[] t = new int[3];\n\t\tfor(int i = 0;i < 3;i++)t[i] = Integer.parseInt(db[i]);\n\t\t\n\t\t/*\n\t\tif(yy < t[2] ||\n\t\t\t\t(yy == t[2] && mm < t[1]) ||\n\t\t\t\t(yy == t[2] && mm == t[1] && dd < t[0])){\n\t\t\tout.println(\"NO\");\n\t\t\treturn;\n\t\t}\n\t\t*/\n\t\t\n\t\tif(\ttest(dd, mm, yy, t[0], t[1], t[2]) ||\n\t\t\t\ttest(dd, mm, yy, t[0], t[2], t[1]) ||\n\t\t\t\ttest(dd, mm, yy, t[1], t[0], t[2]) ||\n\t\ttest(dd, mm, yy, t[1], t[2], t[0]) ||\n\t\ttest(dd, mm, yy, t[2], t[1], t[0]) ||\n\t\ttest(dd, mm, yy, t[2], t[0], t[1])){\n\t\t\tout.println(\"YES\");\n\t\t}else{\n\t\t\tout.println(\"NO\");\n\t\t}\n\t}\n\t\n\tpublic boolean test(int dd, int mm, int yy, int bd, int bm, int by)\n\t{\n\t\tif(yy < by + 18)return false;\n\t\tif(bm > 12)return false;\n\t\tif(bd > 31)return false;\n\t\t\n\t\tint[] md = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};\n\t\tif(by % 4 == 0)md[2]++;\n\t\t/*\n\t\tif(by % 4 != 0 && bm == 2 && bd == 29){\n\t\t\tbm = 3; bd = 1;\n\t\t}\n\t\t*/\n//\t\tif(yy % 4 != 0 && mm == 2 && dd == 29){\n//\t\t\tmm = 3; dd = 1;\n//\t\t}\n\t\tif(bd > md[bm])return false;\n\t\t\n\t\tif(yy > by + 18)return true;\n\t\tif(bm != mm)return mm > bm;\n\t\treturn dd >= bd;\n\t}\n\t\n\tpublic void run() throws Exception\n\t{\n\t\tin = INPUT.isEmpty() ? new Scanner(System.in) : new Scanner(INPUT);\n\t\tout = new PrintWriter(System.out);\n\n\t\tsolve();\n\t\tout.flush();\n\t}\n\t\n\t\n\tpublic static void main(String[] args) throws Exception\n\t{\n\t\tnew B().run();\n\t}\n\t\n\tprivate int ni() { return Integer.parseInt(in.next()); }\n\tprivate void tr(Object... o) { if(INPUT.length() != 0)System.out.println(o.length > 1 || o[0].getClass().isArray() ? Arrays.deepToString(o) : o[0]); }\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "2fd2c6c9a78eb80459f6fc89502dbc99", "src_uid": "5418c98fe362909f7b28f95225837d33", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\r\n\r\nimport java.io.*;\r\n\r\nimport java.util.*;\r\n\r\n/**\r\n *\r\n * @author eslam\r\n */\r\npublic class IceCave {\r\n\r\n static class Kattio extends PrintWriter {\r\n\r\n private BufferedReader r;\r\n private StringTokenizer st;\r\n // standard input\r\n\r\n public Kattio() {\r\n this(System.in, System.out);\r\n }\r\n\r\n public Kattio(InputStream i, OutputStream o) {\r\n super(o);\r\n r = new BufferedReader(new InputStreamReader(i));\r\n }\r\n // USACO-style file input\r\n\r\n public Kattio(String problemName) throws IOException {\r\n super(problemName + \".out\");\r\n r = new BufferedReader(new FileReader(problemName + \".in\"));\r\n }\r\n // returns null if no more input\r\n\r\n String nextLine() {\r\n String str = \"\";\r\n try {\r\n str = r.readLine();\r\n } catch (IOException e) {\r\n e.printStackTrace();\r\n }\r\n return str;\r\n }\r\n\r\n public String next() {\r\n try {\r\n while (st == null || !st.hasMoreTokens()) {\r\n st = new StringTokenizer(r.readLine());\r\n }\r\n return st.nextToken();\r\n } catch (Exception e) {\r\n }\r\n return null;\r\n }\r\n\r\n public int nextInt() {\r\n return Integer.parseInt(next());\r\n }\r\n\r\n public double nextDouble() {\r\n return Double.parseDouble(next());\r\n }\r\n\r\n public long nextLong() {\r\n return Long.parseLong(next());\r\n }\r\n }\r\n\r\n // Beginning of the solution\r\n static Kattio input = new Kattio();\r\n static BufferedWriter log = new BufferedWriter(new OutputStreamWriter(System.out));\r\n static ArrayList<ArrayList<Long>> powerSet = new ArrayList<>();\r\n static long mod = (long) (Math.pow(10, 9) + 7);\r\n static int dp[][];\r\n\r\n public static void main(String[] args) throws IOException {\r\n int n = input.nextInt();\r\n long w = input.nextLong();\r\n log.write(bfs(w, n) + \"\\n\");\r\n log.flush();\r\n }\r\n\r\n public static int bfs(long w, int n) {\r\n Queue<Long> q = new ArrayDeque<>();\r\n q.add(w);\r\n HashMap<Long, Integer> h = new HashMap<>();\r\n h.put(w, 0);\r\n int min = Integer.MAX_VALUE;\r\n while (!q.isEmpty()) {\r\n long s = q.poll();\r\n if (n == String.valueOf(s).length()) {\r\n return h.get(s);\r\n }\r\n TreeSet<Integer> t = new TreeSet<>();\r\n String e = s + \"\";\r\n for (int i = 0; i < e.length(); i++) {\r\n t.add(e.charAt(i) - '0');\r\n }\r\n for (Integer x : t) {\r\n long v = (long) x * s;\r\n if (String.valueOf(v).length() > n) {\r\n continue;\r\n }\r\n if (h.get(v) == null) {\r\n h.put(v, h.get(s) + 1);\r\n q.add(v);\r\n }\r\n }\r\n }\r\n return min == Integer.MAX_VALUE ? -1 : min;\r\n }\r\n\r\n public static int log2(long n) {\r\n int cnt = 0;\r\n while (n > 1) {\r\n n /= 2;\r\n cnt++;\r\n }\r\n return cnt;\r\n }\r\n\r\n public static int[] bfs(int node, ArrayList<Integer> a[]) {\r\n Queue<Integer> q = new LinkedList<>();\r\n q.add(node);\r\n int distances[] = new int[a.length];\r\n Arrays.fill(distances, -1);\r\n distances[node] = 0;\r\n while (!q.isEmpty()) {\r\n int parent = q.poll();\r\n ArrayList<Integer> nodes = a[parent];\r\n\r\n int cost = distances[parent];\r\n for (Integer node1 : nodes) {\r\n if (distances[node1] == -1) {\r\n\r\n q.add(node1);\r\n distances[node1] = cost + 1;\r\n }\r\n }\r\n }\r\n return distances;\r\n }\r\n\r\n public static int get(int n) {\r\n int sum = 0;\r\n while (n > 0) {\r\n sum += n % 10;\r\n n /= 10;\r\n }\r\n return sum;\r\n }\r\n\r\n public static long primeFactors(int n) {\r\n long sum = 1;\r\n while (n % 2 == 0) {\r\n sum *= 2l;\r\n n /= 2;\r\n }\r\n for (int i = 3; i <= Math.sqrt(n); i += 2) {\r\n while (n % i == 0) {\r\n sum *= (long) i;\r\n n /= i;\r\n }\r\n if (n < i) {\r\n break;\r\n }\r\n }\r\n if (n > 2) {\r\n sum *= n;\r\n }\r\n return sum;\r\n }\r\n\r\n public static ArrayList<Integer> printPrimeFactoriztion(int n) {\r\n ArrayList<Integer> a = new ArrayList<>();\r\n for (int i = 1; i < Math.sqrt(n) + 1; i++) {\r\n if (n % i == 0) {\r\n if (isPrime(i)) {\r\n a.add(i);\r\n n /= i;\r\n i = 0;\r\n } else if (isPrime(n / i)) {\r\n a.add(n / i);\r\n n = i;\r\n i = 0;\r\n }\r\n }\r\n }\r\n return a;\r\n }\r\n\r\n// end of solution\r\n public static void genrate(int ind, long[] a, ArrayList<Long> sub) {\r\n if (ind == a.length) {\r\n powerSet.add(sub);\r\n return;\r\n }\r\n ArrayList<Long> have = new ArrayList<>();\r\n ArrayList<Long> less = new ArrayList<>();\r\n for (int i = 0; i < sub.size(); i++) {\r\n have.add(sub.get(i));\r\n less.add(sub.get(i));\r\n }\r\n have.add(a[ind]);\r\n genrate(ind + 1, a, have);\r\n genrate(ind + 1, a, less);\r\n }\r\n\r\n public static long factorial(long n) {\r\n if (n <= 1) {\r\n return 1;\r\n }\r\n long t = n - 1;\r\n while (t > 1) {\r\n n *= t;\r\n t--;\r\n }\r\n return n;\r\n }\r\n\r\n public static boolean isPalindrome(int n) {\r\n int t = n;\r\n int ans = 0;\r\n while (t > 0) {\r\n ans = ans * 10 + t % 10;\r\n t /= 10;\r\n }\r\n return ans == n;\r\n\r\n }\r\n\r\n static class tri {\r\n\r\n int x, y, z;\r\n\r\n public tri(int x, int y, int z) {\r\n this.x = x;\r\n this.y = y;\r\n this.z = z;\r\n }\r\n\r\n }\r\n\r\n static boolean isPrime(long num) {\r\n if (num == 1) {\r\n return false;\r\n }\r\n if (num == 2) {\r\n return true;\r\n }\r\n if (num % 2 == 0) {\r\n return false;\r\n }\r\n if (num == 3) {\r\n return true;\r\n }\r\n for (int i = 3; i <= Math.sqrt(num) + 1; i += 2) {\r\n if (num % i == 0) {\r\n return false;\r\n }\r\n }\r\n return true;\r\n }\r\n\r\n public static void prefixSum(int[] a) {\r\n for (int i = 1; i < a.length; i++) {\r\n a[i] = a[i] + a[i - 1];\r\n }\r\n }\r\n\r\n public static void suffixSum(long[] a) {\r\n for (int i = a.length - 2; i > -1; i--) {\r\n a[i] = a[i] + a[i + 1];\r\n }\r\n }\r\n\r\n static long mod(long a, long b) {\r\n long r = a % b;\r\n return r < 0 ? r + b : r;\r\n }\r\n\r\n public static long binaryToDecimal(String w) {\r\n long r = 0;\r\n long l = 0;\r\n for (int i = w.length() - 1; i > -1; i--) {\r\n long x = (w.charAt(i) - '0') * (long) Math.pow(2, l);\r\n r = r + x;\r\n l++;\r\n }\r\n return r;\r\n }\r\n\r\n public static String decimalToBinary(long n) {\r\n String w = \"\";\r\n while (n > 0) {\r\n w = n % 2 + w;\r\n n /= 2;\r\n }\r\n return w;\r\n }\r\n\r\n public static boolean isSorted(int[] a) {\r\n for (int i = 0; i < a.length - 1; i++) {\r\n if (a[i] > a[i + 1]) {\r\n return false;\r\n }\r\n }\r\n return true;\r\n }\r\n\r\n public static void print(int a[]) throws IOException {\r\n for (int i = 0; i < a.length; i++) {\r\n log.write(a[i] + \" \");\r\n }\r\n log.write(\"\\n\");\r\n }\r\n\r\n public static void read(int[] a) {\r\n for (int i = 0; i < a.length; i++) {\r\n a[i] = input.nextInt();\r\n\r\n }\r\n }\r\n\r\n static class pair {\r\n\r\n long x;\r\n long y;\r\n\r\n public pair(long x, long y) {\r\n this.x = x;\r\n this.y = y;\r\n }\r\n\r\n @Override\r\n public String toString() {\r\n return x + \" \" + y;\r\n }\r\n }\r\n\r\n public static long LCM(long x, long y) {\r\n return x / GCD(x, y) * y;\r\n }\r\n\r\n public static long GCD(long x, long y) {\r\n if (y == 0) {\r\n return x;\r\n }\r\n return GCD(y, x % y);\r\n }\r\n\r\n public static void simplifyTheFraction(long a, long b) {\r\n long GCD = GCD(a, b);\r\n System.out.println(a / GCD + \" \" + b / GCD);\r\n\r\n }\r\n\r\n /**\r\n */ // class RedBlackNode\r\n static class RedBlackNode<T extends Comparable<T>> {\r\n\r\n /**\r\n * Possible color for this node\r\n */\r\n public static final int BLACK = 0;\r\n /**\r\n * Possible color for this node\r\n */\r\n public static final int RED = 1;\r\n // the key of each node\r\n public T key;\r\n\r\n /**\r\n * Parent of node\r\n */\r\n RedBlackNode<T> parent;\r\n /**\r\n * Left child\r\n */\r\n RedBlackNode<T> left;\r\n /**\r\n * Right child\r\n */\r\n RedBlackNode<T> right;\r\n // the number of elements to the left of each node\r\n public int numLeft = 0;\r\n // the number of elements to the right of each node\r\n public int numRight = 0;\r\n // the color of a node\r\n public int color;\r\n\r\n RedBlackNode() {\r\n color = BLACK;\r\n numLeft = 0;\r\n numRight = 0;\r\n parent = null;\r\n left = null;\r\n right = null;\r\n }\r\n\r\n // Constructor which sets key to the argument.\r\n RedBlackNode(T key) {\r\n this();\r\n this.key = key;\r\n }\r\n }// end class RedBlackNode\r\n\r\n static class RedBlackTree<T extends Comparable<T>> {\r\n\r\n // Root initialized to nil.\r\n private RedBlackNode<T> nil = new RedBlackNode<T>();\r\n private RedBlackNode<T> root = nil;\r\n\r\n public RedBlackTree() {\r\n root.left = nil;\r\n root.right = nil;\r\n root.parent = nil;\r\n }\r\n\r\n // @param: X, The node which the lefRotate is to be performed on.\r\n // Performs a leftRotate around X.\r\n private void leftRotate(RedBlackNode<T> x) {\r\n\r\n // Call leftRotateFixup() which updates the numLeft\r\n // and numRight values.\r\n leftRotateFixup(x);\r\n\r\n // Perform the left rotate as described in the algorithm\r\n // in the course text.\r\n RedBlackNode<T> y;\r\n y = x.right;\r\n x.right = y.left;\r\n\r\n // Check for existence of y.left and make pointer changes\r\n if (!isNil(y.left)) {\r\n y.left.parent = x;\r\n }\r\n y.parent = x.parent;\r\n\r\n // X's parent is nul\r\n if (isNil(x.parent)) {\r\n root = y;\r\n } // X is the left child of it's parent\r\n else if (x.parent.left == x) {\r\n x.parent.left = y;\r\n } // X is the right child of it's parent.\r\n else {\r\n x.parent.right = y;\r\n }\r\n\r\n // Finish of the leftRotate\r\n y.left = x;\r\n x.parent = y;\r\n }// end leftRotate(RedBlackNode X)\r\n\r\n // @param: X, The node which the leftRotate is to be performed on.\r\n // Updates the numLeft & numRight values affected by leftRotate.\r\n private void leftRotateFixup(RedBlackNode x) {\r\n\r\n // Case 1: Only X, X.right and X.right.right always are not nil.\r\n if (isNil(x.left) && isNil(x.right.left)) {\r\n x.numLeft = 0;\r\n x.numRight = 0;\r\n x.right.numLeft = 1;\r\n } // Case 2: X.right.left also exists in addition to Case 1\r\n else if (isNil(x.left) && !isNil(x.right.left)) {\r\n x.numLeft = 0;\r\n x.numRight = 1 + x.right.left.numLeft\r\n + x.right.left.numRight;\r\n x.right.numLeft = 2 + x.right.left.numLeft\r\n + x.right.left.numRight;\r\n } // Case 3: X.left also exists in addition to Case 1\r\n else if (!isNil(x.left) && isNil(x.right.left)) {\r\n x.numRight = 0;\r\n x.right.numLeft = 2 + x.left.numLeft + x.left.numRight;\r\n\r\n } // Case 4: X.left and X.right.left both exist in addtion to Case 1\r\n else {\r\n x.numRight = 1 + x.right.left.numLeft\r\n + x.right.left.numRight;\r\n x.right.numLeft = 3 + x.left.numLeft + x.left.numRight\r\n + x.right.left.numLeft + x.right.left.numRight;\r\n }\r\n\r\n }// end leftRotateFixup(RedBlackNode X)\r\n\r\n // @param: X, The node which the rightRotate is to be performed on.\r\n // Updates the numLeft and numRight values affected by the Rotate.\r\n private void rightRotate(RedBlackNode<T> y) {\r\n\r\n // Call rightRotateFixup to adjust numRight and numLeft values\r\n rightRotateFixup(y);\r\n\r\n // Perform the rotate as described in the course text.\r\n RedBlackNode<T> x = y.left;\r\n y.left = x.right;\r\n\r\n // Check for existence of X.right\r\n if (!isNil(x.right)) {\r\n x.right.parent = y;\r\n }\r\n x.parent = y.parent;\r\n\r\n // y.parent is nil\r\n if (isNil(y.parent)) {\r\n root = x;\r\n } // y is a right child of it's parent.\r\n else if (y.parent.right == y) {\r\n y.parent.right = x;\r\n } // y is a left child of it's parent.\r\n else {\r\n y.parent.left = x;\r\n }\r\n x.right = y;\r\n\r\n y.parent = x;\r\n\r\n }// end rightRotate(RedBlackNode y)\r\n\r\n // @param: y, the node around which the righRotate is to be performed.\r\n // Updates the numLeft and numRight values affected by the rotate\r\n private void rightRotateFixup(RedBlackNode y) {\r\n\r\n // Case 1: Only y, y.left and y.left.left exists.\r\n if (isNil(y.right) && isNil(y.left.right)) {\r\n y.numRight = 0;\r\n y.numLeft = 0;\r\n y.left.numRight = 1;\r\n } // Case 2: y.left.right also exists in addition to Case 1\r\n else if (isNil(y.right) && !isNil(y.left.right)) {\r\n y.numRight = 0;\r\n y.numLeft = 1 + y.left.right.numRight\r\n + y.left.right.numLeft;\r\n y.left.numRight = 2 + y.left.right.numRight\r\n + y.left.right.numLeft;\r\n } // Case 3: y.right also exists in addition to Case 1\r\n else if (!isNil(y.right) && isNil(y.left.right)) {\r\n y.numLeft = 0;\r\n y.left.numRight = 2 + y.right.numRight + y.right.numLeft;\r\n\r\n } // Case 4: y.right & y.left.right exist in addition to Case 1\r\n else {\r\n y.numLeft = 1 + y.left.right.numRight\r\n + y.left.right.numLeft;\r\n y.left.numRight = 3 + y.right.numRight\r\n + y.right.numLeft\r\n + y.left.right.numRight + y.left.right.numLeft;\r\n }\r\n\r\n }// end rightRotateFixup(RedBlackNode y)\r\n\r\n public void insert(T key) {\r\n insert(new RedBlackNode<T>(key));\r\n }\r\n\r\n // @param: z, the node to be inserted into the Tree rooted at root\r\n // Inserts z into the appropriate position in the RedBlackTree while\r\n // updating numLeft and numRight values.\r\n private void insert(RedBlackNode<T> z) {\r\n\r\n // Create a reference to root & initialize a node to nil\r\n RedBlackNode<T> y = nil;\r\n RedBlackNode<T> x = root;\r\n\r\n // While we haven't reached a the end of the tree keep\r\n // tryint to figure out where z should go\r\n while (!isNil(x)) {\r\n y = x;\r\n\r\n // if z.key is < than the current key, go left\r\n if (z.key.compareTo(x.key) < 0) {\r\n\r\n // Update X.numLeft as z is < than X\r\n x.numLeft++;\r\n x = x.left;\r\n } // else z.key >= X.key so go right.\r\n else {\r\n\r\n // Update X.numGreater as z is => X\r\n x.numRight++;\r\n x = x.right;\r\n }\r\n }\r\n // y will hold z's parent\r\n z.parent = y;\r\n\r\n // Depending on the value of y.key, put z as the left or\r\n // right child of y\r\n if (isNil(y)) {\r\n root = z;\r\n } else if (z.key.compareTo(y.key) < 0) {\r\n y.left = z;\r\n } else {\r\n y.right = z;\r\n }\r\n\r\n // Initialize z's children to nil and z's color to red\r\n z.left = nil;\r\n z.right = nil;\r\n z.color = RedBlackNode.RED;\r\n\r\n // Call insertFixup(z)\r\n insertFixup(z);\r\n\r\n }// end insert(RedBlackNode z)\r\n\r\n // @param: z, the node which was inserted and may have caused a violation\r\n // of the RedBlackTree properties\r\n // Fixes up the violation of the RedBlackTree properties that may have\r\n // been caused during insert(z)\r\n private void insertFixup(RedBlackNode<T> z) {\r\n\r\n RedBlackNode<T> y = nil;\r\n // While there is a violation of the RedBlackTree properties..\r\n while (z.parent.color == RedBlackNode.RED) {\r\n\r\n // If z's parent is the the left child of it's parent.\r\n if (z.parent == z.parent.parent.left) {\r\n\r\n // Initialize y to z 's cousin\r\n y = z.parent.parent.right;\r\n\r\n // Case 1: if y is red...recolor\r\n if (y.color == RedBlackNode.RED) {\r\n z.parent.color = RedBlackNode.BLACK;\r\n y.color = RedBlackNode.BLACK;\r\n z.parent.parent.color = RedBlackNode.RED;\r\n z = z.parent.parent;\r\n } // Case 2: if y is black & z is a right child\r\n else if (z == z.parent.right) {\r\n\r\n // leftRotaet around z's parent\r\n z = z.parent;\r\n leftRotate(z);\r\n } // Case 3: else y is black & z is a left child\r\n else {\r\n // recolor and rotate round z's grandpa\r\n z.parent.color = RedBlackNode.BLACK;\r\n z.parent.parent.color = RedBlackNode.RED;\r\n rightRotate(z.parent.parent);\r\n }\r\n } // If z's parent is the right child of it's parent.\r\n else {\r\n\r\n // Initialize y to z's cousin\r\n y = z.parent.parent.left;\r\n\r\n // Case 1: if y is red...recolor\r\n if (y.color == RedBlackNode.RED) {\r\n z.parent.color = RedBlackNode.BLACK;\r\n y.color = RedBlackNode.BLACK;\r\n z.parent.parent.color = RedBlackNode.RED;\r\n z = z.parent.parent;\r\n } // Case 2: if y is black and z is a left child\r\n else if (z == z.parent.left) {\r\n // rightRotate around z's parent\r\n z = z.parent;\r\n rightRotate(z);\r\n } // Case 3: if y is black and z is a right child\r\n else {\r\n // recolor and rotate around z's grandpa\r\n z.parent.color = RedBlackNode.BLACK;\r\n z.parent.parent.color = RedBlackNode.RED;\r\n leftRotate(z.parent.parent);\r\n }\r\n }\r\n }\r\n // Color root black at all times\r\n root.color = RedBlackNode.BLACK;\r\n\r\n }// end insertFixup(RedBlackNode z)\r\n\r\n // @param: node, a RedBlackNode\r\n // @param: node, the node with the smallest key rooted at node\r\n public RedBlackNode<T> treeMinimum(RedBlackNode<T> node) {\r\n\r\n // while there is a smaller key, keep going left\r\n while (!isNil(node.left)) {\r\n node = node.left;\r\n }\r\n return node;\r\n }// end treeMinimum(RedBlackNode node)\r\n\r\n // @param: X, a RedBlackNode whose successor we must find\r\n // @return: return's the node the with the next largest key\r\n // from X.key\r\n public RedBlackNode<T> treeSuccessor(RedBlackNode<T> x) {\r\n\r\n // if X.left is not nil, call treeMinimum(X.right) and\r\n // return it's value\r\n if (!isNil(x.left)) {\r\n return treeMinimum(x.right);\r\n }\r\n\r\n RedBlackNode<T> y = x.parent;\r\n\r\n // while X is it's parent's right child...\r\n while (!isNil(y) && x == y.right) {\r\n // Keep moving up in the tree\r\n x = y;\r\n y = y.parent;\r\n }\r\n // Return successor\r\n return y;\r\n }// end treeMinimum(RedBlackNode X)\r\n\r\n // @param: z, the RedBlackNode which is to be removed from the the tree\r\n // Remove's z from the RedBlackTree rooted at root\r\n public void remove(RedBlackNode<T> v) {\r\n\r\n RedBlackNode<T> z = search(v.key);\r\n\r\n // Declare variables\r\n RedBlackNode<T> x = nil;\r\n RedBlackNode<T> y = nil;\r\n\r\n // if either one of z's children is nil, then we must remove z\r\n if (isNil(z.left) || isNil(z.right)) {\r\n y = z;\r\n } // else we must remove the successor of z\r\n else {\r\n y = treeSuccessor(z);\r\n }\r\n\r\n // Let X be the left or right child of y (y can only have one child)\r\n if (!isNil(y.left)) {\r\n x = y.left;\r\n } else {\r\n x = y.right;\r\n }\r\n\r\n // link X's parent to y's parent\r\n x.parent = y.parent;\r\n\r\n // If y's parent is nil, then X is the root\r\n if (isNil(y.parent)) {\r\n root = x;\r\n } // else if y is a left child, set X to be y's left sibling\r\n else if (!isNil(y.parent.left) && y.parent.left == y) {\r\n y.parent.left = x;\r\n } // else if y is a right child, set X to be y's right sibling\r\n else if (!isNil(y.parent.right) && y.parent.right == y) {\r\n y.parent.right = x;\r\n }\r\n\r\n // if y != z, trasfer y's satellite data into z.\r\n if (y != z) {\r\n z.key = y.key;\r\n }\r\n\r\n // Update the numLeft and numRight numbers which might need\r\n // updating due to the deletion of z.key.\r\n fixNodeData(x, y);\r\n\r\n // If y's color is black, it is a violation of the\r\n // RedBlackTree properties so call removeFixup()\r\n if (y.color == RedBlackNode.BLACK) {\r\n removeFixup(x);\r\n }\r\n }// end remove(RedBlackNode z)\r\n\r\n // @param: y, the RedBlackNode which was actually deleted from the tree\r\n // @param: key, the value of the key that used to be in y\r\n private void fixNodeData(RedBlackNode<T> x, RedBlackNode<T> y) {\r\n\r\n // Initialize two variables which will help us traverse the tree\r\n RedBlackNode<T> current = nil;\r\n RedBlackNode<T> track = nil;\r\n\r\n // if X is nil, then we will start updating at y.parent\r\n // Set track to y, y.parent's child\r\n if (isNil(x)) {\r\n current = y.parent;\r\n track = y;\r\n } // if X is not nil, then we start updating at X.parent\r\n // Set track to X, X.parent's child\r\n else {\r\n current = x.parent;\r\n track = x;\r\n }\r\n\r\n // while we haven't reached the root\r\n while (!isNil(current)) {\r\n // if the node we deleted has a different key than\r\n // the current node\r\n if (y.key != current.key) {\r\n\r\n // if the node we deleted is greater than\r\n // current.key then decrement current.numRight\r\n if (y.key.compareTo(current.key) > 0) {\r\n current.numRight--;\r\n }\r\n\r\n // if the node we deleted is less than\r\n // current.key thendecrement current.numLeft\r\n if (y.key.compareTo(current.key) < 0) {\r\n current.numLeft--;\r\n }\r\n } // if the node we deleted has the same key as the\r\n // current node we are checking\r\n else {\r\n // the cases where the current node has any nil\r\n // children and update appropriately\r\n if (isNil(current.left)) {\r\n current.numLeft--;\r\n } else if (isNil(current.right)) {\r\n current.numRight--;\r\n } // the cases where current has two children and\r\n // we must determine whether track is it's left\r\n // or right child and update appropriately\r\n else if (track == current.right) {\r\n current.numRight--;\r\n } else if (track == current.left) {\r\n current.numLeft--;\r\n }\r\n }\r\n\r\n // update track and current\r\n track = current;\r\n current = current.parent;\r\n\r\n }\r\n\r\n }//end fixNodeData()\r\n\r\n // @param: X, the child of the deleted node from remove(RedBlackNode v)\r\n // Restores the Red Black properties that may have been violated during\r\n // the removal of a node in remove(RedBlackNode v)\r\n private void removeFixup(RedBlackNode<T> x) {\r\n\r\n RedBlackNode<T> w;\r\n\r\n // While we haven't fixed the tree completely...\r\n while (x != root && x.color == RedBlackNode.BLACK) {\r\n\r\n // if X is it's parent's left child\r\n if (x == x.parent.left) {\r\n\r\n // set w = X's sibling\r\n w = x.parent.right;\r\n\r\n // Case 1, w's color is red.\r\n if (w.color == RedBlackNode.RED) {\r\n w.color = RedBlackNode.BLACK;\r\n x.parent.color = RedBlackNode.RED;\r\n leftRotate(x.parent);\r\n w = x.parent.right;\r\n }\r\n\r\n // Case 2, both of w's children are black\r\n if (w.left.color == RedBlackNode.BLACK\r\n && w.right.color == RedBlackNode.BLACK) {\r\n w.color = RedBlackNode.RED;\r\n x = x.parent;\r\n } // Case 3 / Case 4\r\n else {\r\n // Case 3, w's right child is black\r\n if (w.right.color == RedBlackNode.BLACK) {\r\n w.left.color = RedBlackNode.BLACK;\r\n w.color = RedBlackNode.RED;\r\n rightRotate(w);\r\n w = x.parent.right;\r\n }\r\n // Case 4, w = black, w.right = red\r\n w.color = x.parent.color;\r\n x.parent.color = RedBlackNode.BLACK;\r\n w.right.color = RedBlackNode.BLACK;\r\n leftRotate(x.parent);\r\n x = root;\r\n }\r\n } // if X is it's parent's right child\r\n else {\r\n\r\n // set w to X's sibling\r\n w = x.parent.left;\r\n\r\n // Case 1, w's color is red\r\n if (w.color == RedBlackNode.RED) {\r\n w.color = RedBlackNode.BLACK;\r\n x.parent.color = RedBlackNode.RED;\r\n rightRotate(x.parent);\r\n w = x.parent.left;\r\n }\r\n\r\n // Case 2, both of w's children are black\r\n if (w.right.color == RedBlackNode.BLACK\r\n && w.left.color == RedBlackNode.BLACK) {\r\n w.color = RedBlackNode.RED;\r\n x = x.parent;\r\n } // Case 3 / Case 4\r\n else {\r\n // Case 3, w's left child is black\r\n if (w.left.color == RedBlackNode.BLACK) {\r\n w.right.color = RedBlackNode.BLACK;\r\n w.color = RedBlackNode.RED;\r\n leftRotate(w);\r\n w = x.parent.left;\r\n }\r\n\r\n // Case 4, w = black, and w.left = red\r\n w.color = x.parent.color;\r\n x.parent.color = RedBlackNode.BLACK;\r\n w.left.color = RedBlackNode.BLACK;\r\n rightRotate(x.parent);\r\n x = root;\r\n }\r\n }\r\n }// end while\r\n\r\n // set X to black to ensure there is no violation of\r\n // RedBlack tree Properties\r\n x.color = RedBlackNode.BLACK;\r\n }// end removeFixup(RedBlackNode X)\r\n\r\n // @param: key, the key whose node we want to search for\r\n // @return: returns a node with the key, key, if not found, returns null\r\n // Searches for a node with key k and returns the first such node, if no\r\n // such node is found returns null\r\n public RedBlackNode<T> search(T key) {\r\n\r\n // Initialize a pointer to the root to traverse the tree\r\n RedBlackNode<T> current = root;\r\n\r\n // While we haven't reached the end of the tree\r\n while (!isNil(current)) {\r\n\r\n // If we have found a node with a key equal to key\r\n if (current.key.equals(key)) // return that node and exit search(int)\r\n {\r\n return current;\r\n } // go left or right based on value of current and key\r\n else if (current.key.compareTo(key) < 0) {\r\n current = current.right;\r\n } // go left or right based on value of current and key\r\n else {\r\n current = current.left;\r\n }\r\n }\r\n\r\n // we have not found a node whose key is \"key\"\r\n return null;\r\n\r\n }// end search(int key)\r\n\r\n // @param: key, any Comparable object\r\n // @return: return's the number of elements greater than key\r\n public int numGreater(T key) {\r\n\r\n // Call findNumGreater(root, key) which will return the number\r\n // of nodes whose key is greater than key\r\n return findNumGreater(root, key);\r\n\r\n }// end numGreater(int key)\r\n\r\n // @param: key, any Comparable object\r\n // @return: return's teh number of elements smaller than key\r\n public int numSmaller(T key) {\r\n\r\n // Call findNumSmaller(root,key) which will return\r\n // the number of nodes whose key is greater than key\r\n return findNumSmaller(root, key);\r\n\r\n }// end numSmaller(int key)\r\n\r\n // @param: node, the root of the tree, the key who we must\r\n // compare other node key's to.\r\n // @return: the number of nodes greater than key.\r\n public int findNumGreater(RedBlackNode<T> node, T key) {\r\n\r\n // Base Case: if node is nil, return 0\r\n if (isNil(node)) {\r\n return 0;\r\n } // If key is less than node.key, all elements right of node are\r\n // greater than key, add this to our total and look to the left\r\n else if (key.compareTo(node.key) < 0) {\r\n return 1 + node.numRight + findNumGreater(node.left, key);\r\n } // If key is greater than node.key, then look to the right as\r\n // all elements to the left of node are smaller than key\r\n else {\r\n return findNumGreater(node.right, key);\r\n }\r\n\r\n }// end findNumGreater(RedBlackNode, int key)\r\n\r\n /**\r\n * Returns sorted list of keys greater than key. Size of list will not\r\n * exceed maxReturned\r\n *\r\n * @param key Key to search for\r\n * @param maxReturned Maximum number of results to return\r\n * @return List of keys greater than key. List may not exceed\r\n * maxReturned\r\n */\r\n public List<T> getGreaterThan(T key, Integer maxReturned) {\r\n List<T> list = new ArrayList<T>();\r\n getGreaterThan(root, key, list);\r\n return list.subList(0, Math.min(maxReturned, list.size()));\r\n }\r\n\r\n private void getGreaterThan(RedBlackNode<T> node, T key,\r\n List<T> list) {\r\n if (isNil(node)) {\r\n return;\r\n } else if (node.key.compareTo(key) > 0) {\r\n getGreaterThan(node.left, key, list);\r\n list.add(node.key);\r\n getGreaterThan(node.right, key, list);\r\n } else {\r\n getGreaterThan(node.right, key, list);\r\n }\r\n }\r\n\r\n // @param: node, the root of the tree, the key who we must compare other\r\n // node key's to.\r\n // @return: the number of nodes smaller than key.\r\n public int findNumSmaller(RedBlackNode<T> node, T key) {\r\n\r\n // Base Case: if node is nil, return 0\r\n if (isNil(node)) {\r\n return 0;\r\n } // If key is less than node.key, look to the left as all\r\n // elements on the right of node are greater than key\r\n else if (key.compareTo(node.key) <= 0) {\r\n return findNumSmaller(node.left, key);\r\n } // If key is larger than node.key, all elements to the left of\r\n // node are smaller than key, add this to our total and look\r\n // to the right.\r\n else {\r\n return 1 + node.numLeft + findNumSmaller(node.right, key);\r\n }\r\n\r\n }// end findNumSmaller(RedBlackNode nod, int key)\r\n\r\n // @param: node, the RedBlackNode we must check to see whether it's nil\r\n // @return: return's true of node is nil and false otherwise\r\n private boolean isNil(RedBlackNode node) {\r\n\r\n // return appropriate value\r\n return node == nil;\r\n\r\n }// end isNil(RedBlackNode node)\r\n\r\n // @return: return's the size of the tree\r\n // Return's the # of nodes including the root which the RedBlackTree\r\n // rooted at root has.\r\n public int size() {\r\n\r\n // Return the number of nodes to the root's left + the number of\r\n // nodes on the root's right + the root itself.\r\n return root.numLeft + root.numRight + 1;\r\n }// end size()\r\n\r\n }// end class RedBlackTree\r\n}\r\n", "lang_cluster": "Java", "tags": ["brute force", "dfs and similar", "shortest paths", "dp", "data structures"], "code_uid": "d0b812468628eed7db52d156447738a4", "src_uid": "cedcc3cee864bf8684148df93804d029", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class CollectingBeatsisFun {\n public static void main(String args[]) {\n Scanner scan = new Scanner(System.in); \n int n = scan.nextInt()*2;\n int[] a = new int[10];\n for (int i = 0; i < 4; i++) {\n String s = scan.next();\n for (int j = 0; j < 4; j++) {\n if(s.charAt(j)!='.'){ \n \n ++a[s.charAt(j)-'0'];\n }\n }\n }\n for (int i = 0; i < 10; i++) {\n if(a[i]>n){\n \n System.out.println(\"NO\");\n return ;\n }\n }\n \n System.out.println(\"YES\");\n }\n \n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "7a77875aee88ce8e72e1888e01a62ce2", "src_uid": "5fdaf8ee7763cb5815f49c0c38398f16", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class Main143A\n{\n static PrintWriter out=new PrintWriter(System.out);\n public static boolean check(int x,int y,int z,int p)\n {\n return x!=y&&z!=p&&x!=p&&y!=z&&x!=z&&y!=p;\n }\n \n \n public static void main(String[] args) throws IOException\n {\n Scanner sc=new Scanner(System.in);\n int r1=sc.nextInt();\n int r2=sc.nextInt();\n int c1=sc.nextInt();\n int c2=sc.nextInt();\n int d1=sc.nextInt();\n int d2=sc.nextInt();\n int x=0,y=0,z=0,p=0;\n boolean flag=false;\n for(x=1;x<=9;x++)\n {\n for(y=1;y<=9;y++)\n {\n for(z=1;z<=9;z++)\n {\n for(p=1;p<=9;p++)\n {\n if((x+y)==r1&&(x+z)==c1&&(y+p)==c2&&(z+p)==r2&&(x+p)==d1&&(y+z)==d2&&check(x,y,z,p))\n {\n flag=true;\n break;\n }\n }\n if(flag) break;\n }\n if(flag) break;\n }\n if(flag) break;\n }\n if(flag)\n {\n out.println(x+\" \"+y);\n out.println(z+\" \"+p);\n }\n else\n out.println(-1);\n out.flush();\n \n \n \n \n }\n static class Scanner\n {\n BufferedReader br;\n StringTokenizer tk=new StringTokenizer(\"\");\n public Scanner(InputStream is) \n {\n br=new BufferedReader(new InputStreamReader(is));\n }\n public int nextInt() throws IOException\n {\n if(tk.hasMoreTokens())\n return Integer.parseInt(tk.nextToken());\n tk=new StringTokenizer(br.readLine());\n return nextInt();\n }\n public long nextLong() throws IOException\n {\n if(tk.hasMoreTokens())\n return Long.parseLong(tk.nextToken());\n tk=new StringTokenizer(br.readLine());\n return nextLong();\n }\n public String next() throws IOException\n {\n if(tk.hasMoreTokens())\n return (tk.nextToken());\n tk=new StringTokenizer(br.readLine());\n return next();\n }\n public String nextLine() throws IOException\n {\n tk=new StringTokenizer(\"\");\n return br.readLine();\n }\n public double nextDouble() throws IOException\n {\n if(tk.hasMoreTokens())\n return Double.parseDouble(tk.nextToken());\n tk=new StringTokenizer(br.readLine());\n return nextDouble();\n }\n public char nextChar() throws IOException\n {\n if(tk.hasMoreTokens())\n return (tk.nextToken().charAt(0));\n tk=new StringTokenizer(br.readLine());\n return nextChar();\n }\n public int[] nextIntArray(int n) throws IOException\n {\n int a[]=new int[n];\n for(int i=0;i<n;i++)\n a[i]=nextInt();\n return a;\n }\n public long[] nextLongArray(int n) throws IOException\n {\n long a[]=new long[n];\n for(int i=0;i<n;i++)\n a[i]=nextLong();\n return a;\n }\n public int[] nextIntArrayOneBased(int n) throws IOException\n {\n int a[]=new int[n+1];\n for(int i=1;i<=n;i++)\n a[i]=nextInt();\n return a;\n }\n public long[] nextLongArrayOneBased(int n) throws IOException\n {\n long a[]=new long[n+1];\n for(int i=1;i<=n;i++)\n a[i]=nextLong();\n return a;\n }\n }\n}\n\n", "lang_cluster": "Java", "tags": ["brute force", "math"], "code_uid": "1736716e06c7336373546fe3f5b11cff", "src_uid": "6821f502f5b6ec95c505e5dd8f3cd5d3", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\n\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskB solver = new TaskB();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskB {\n private char[][] grid = new char[10][10];\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n for (int i = 0; i < 10; i++) {\n String s = in.readLine();\n for (int j = 0; j < 10; j++) {\n grid[i][j] = s.charAt(j);\n }\n }\n\n for (int i = 0; i < 10; i++)\n for (int j = 0; j < 10; j++)\n if (ok(i, j)) {\n out.print(\"YES\");\n return;\n }\n\n out.print(\"NO\");\n }\n\n private boolean isOk(int x, int y) {\n return x >= 0 && x < 10 && y >= 0 && y < 10;\n }\n\n private boolean okD1(int x, int y) {\n for (int i = 1; i <= 4; i++) {\n if (!isOk(x - i, y + i)) return false;\n }\n int cX = 0, cE = 0;\n for (int i = 0; i <= 4; i++) {\n if (grid[x - i][y + i] == 'X') cX++;\n if (grid[x - i][y + i] == '.') cE++;\n }\n return cX == 4 && cE == 1;\n }\n\n private boolean okD2(int x, int y) {\n for (int i = 1; i <= 4; i++) {\n if (!isOk(x + i, y + i)) return false;\n }\n int cX = 0, cE = 0;\n for (int i = 0; i <= 4; i++) {\n if (grid[x + i][y + i] == 'X') cX++;\n if (grid[x + i][y + i] == '.') cE++;\n }\n return cX == 4 && cE == 1;\n }\n\n private boolean okD3(int x, int y) {\n for (int i = 1; i <= 4; i++) {\n if (!isOk(x + i, y - i)) return false;\n }\n int cX = 0, cE = 0;\n for (int i = 0; i <= 4; i++) {\n if (grid[x + i][y - i] == 'X') cX++;\n if (grid[x + i][y - i] == '.') cE++;\n }\n return cX == 4 && cE == 1;\n }\n\n private boolean okD4(int x, int y) {\n for (int i = 1; i <= 4; i++) {\n if (!isOk(x - i, y - i)) return false;\n }\n int cX = 0, cE = 0;\n for (int i = 0; i <= 4; i++) {\n if (grid[x - i][y - i] == 'X') cX++;\n if (grid[x - i][y - i] == '.') cE++;\n }\n return cX == 4 && cE == 1;\n }\n\n private boolean okV1(int x, int y) {\n for (int i = 1; i <= 4; i++) {\n if (!isOk(x - i, y)) return false;\n }\n int cX = 0, cE = 0;\n for (int i = 0; i <= 4; i++) {\n if (grid[x - i][y] == 'X') cX++;\n if (grid[x - i][y] == '.') cE++;\n }\n return cX == 4 && cE == 1;\n }\n\n private boolean okV2(int x, int y) {\n for (int i = 1; i <= 4; i++) {\n if (!isOk(x + i, y)) return false;\n }\n int cX = 0, cE = 0;\n for (int i = 0; i <= 4; i++) {\n if (grid[x + i][y] == 'X') cX++;\n if (grid[x + i][y] == '.') cE++;\n }\n return cX == 4 && cE == 1;\n }\n\n private boolean okH1(int x, int y) {\n for (int i = 1; i <= 4; i++) {\n if (!isOk(x, y - i)) return false;\n }\n int cX = 0, cE = 0;\n for (int i = 0; i <= 4; i++) {\n if (grid[x][y - i] == 'X') cX++;\n if (grid[x][y - i] == '.') cE++;\n }\n return cX == 4 && cE == 1;\n }\n\n private boolean okH2(int x, int y) {\n for (int i = 1; i <= 4; i++) {\n if (!isOk(x, y + i)) return false;\n }\n int cX = 0, cE = 0;\n for (int i = 0; i <= 4; i++) {\n if (grid[x][y + i] == 'X') cX++;\n if (grid[x][y + i] == '.') cE++;\n }\n return cX == 4 && cE == 1;\n }\n\n private boolean ok(int x, int y) {\n return okD1(x, y) || okD2(x, y) || okD3(x, y) || okD4(x, y) || okV1(x, y) || okV2(x, y) || okH1(x, y) || okH2(x, y);\n }\n\n }\n\n static class InputReader extends BufferedReader {\n public InputReader(InputStream in) {\n super(new InputStreamReader(in));\n }\n\n\n public void close() {\n try {\n super.close();\n } catch (Exception e) {\n System.err.println(Arrays.toString(e.getStackTrace()));\n }\n }\n\n\n public String readLine() {\n String s = null;\n try {\n s = super.readLine();\n } catch (Exception e) {\n System.err.println(Arrays.toString(e.getStackTrace()));\n }\n return s;\n }\n\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "97af40a10eeec8a51a1e8c295baea872", "src_uid": "d5541028a2753c758322c440bdbf9ec6", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n/**\n * @author Alvex - GoldenReam1503@gmail.com\n * Time: 10:41:13 AM\n * Date: Nov 15, 2015\n */\npublic class _255A_Gregs_Workout\n{\n private static class Output\n {\n private final PrintWriter printer;\n public void printLine(Object...objects) \n {\n print(objects);\n printer.println();\n }\n public void print(Object...objects) \n {\n int i;\n for (i=0;i<objects.length;i++) \n {\n if (i!=0)\n printer.print(' ');\n printer.print(objects[i]);\n }\n }\n public Output(OutputStream outputStream)\n {\n printer= new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n public void flush()\n {\n printer.flush();\n }\n public void close()\n {\n printer.close();\n }\n }\n private static class Input\n {\n private InputStream stream;\n private byte Buffer[]=new byte[1024];\n private int curChar;\n private int numberChars;\n private SpaceCharFilter filter;\n public interface SpaceCharFilter \n {\n public boolean isSpaceChar(int ch);\n }\n public Input(InputStream stream)\n {\n this.stream=stream;\n }\n public static boolean isWhitespace(int c) \n {\n boolean flag=false;\n if(c==' '|| c=='\\n' || c=='\\r' || c=='\\t' || c==-1)\n flag=true;\n return flag;\n }\n public boolean isSpaceChar(int c) \n {\n if (filter != null)\n return filter.isSpaceChar(c);\n return isWhitespace(c);\n }\n public int read()\n {\n if (numberChars==-1)\n throw new InputMismatchException();\n if (curChar>=numberChars) \n {\n curChar = 0;\n try \n {\n numberChars = stream.read(Buffer);\n } \n catch (IOException e) \n {\n throw new InputMismatchException();\n }\n if (numberChars <= 0)\n return -1;\n }\n return Buffer[curChar++];\n }\n public int readInt() \n {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') \n {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do \n {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } \n while (!isSpaceChar(c));\n return res * sgn;\n }\n }\n public static void main(String[] args)\n { \n Input in=new Input(System.in);\n Output out=new Output(System.out);\n int n=in.readInt();\n int a[]=new int[n],i;\n Map<Integer, String> muscle=new LinkedHashMap<>();\n for(i=0;i<n;i++)\n a[i]=in.readInt();\n int chest=0;\n int biceps=0;\n int back=0;\n for(i=0;i<n;i+=3)\n chest+=a[i];\n for(i=1;i<n;i+=3)\n biceps+=a[i];\n for(i=2;i<n;i+=3)\n back+=a[i];\n muscle.put(chest, \"chest\");\n muscle.put(biceps, \"biceps\");\n muscle.put(back, \"back\");\n int max=0;\n if(chest>biceps)\n max=chest;\n else\n max=biceps;\n if(max<back)\n max=back;\n out.printLine(muscle.get(max));\n out.flush();\n out.close();\n }\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "d78baf6de3511be64441ae2b7b4cfedf", "src_uid": "579021de624c072f5e0393aae762117e", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\n\n\n\n\npublic class CODEF {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String s = sc.next();\n char[] c = s.toCharArray();\n\n boolean flag = false;\n int i = c.length -1;\n\n if(c.length >=10) {\n if (c[0] == 'C') {\n if (c[1] == 'O') {\n if (c[2] == 'D') {\n if (c[3] == 'E') {\n if (c[4] == 'F') {\n if (c[5] == 'O') {\n if (c[6] == 'R') {\n if (c[7] == 'C') {\n if (c[8] == 'E') {\n if (c[9] == 'S') {\n {flag = true;}\n }\n else if(c[i] == 'S'){\n {flag = true;}\n }\n }\n else if(c[i] == 'S' && c[i-1]=='E'){\n {flag = true;}\n }\n }\n else if(c[i] == 'S' && c[i-1]=='E'\n && c[i-2] == 'C'){\n {flag = true;}\n }\n }\n else if(c[i] == 'S' && c[i-1]=='E'\n && c[i-2] == 'C' && c[i-3] == 'R'){\n {flag = true;}\n }\n }\n else if(c[i] == 'S' && c[i-1]=='E'\n && c[i-2] == 'C' && c[i-3] == 'R'\n && c[i-4] == 'O'){\n {flag = true;}\n }\n }\n else if(c[i] == 'S' && c[i-1]=='E'\n && c[i-2] == 'C' && c[i-3] == 'R'\n && c[i-4] == 'O' && c[i -5] == 'F'){\n {flag = true;}\n }\n }\n else if(c[i] == 'S' && c[i-1]=='E'\n && c[i-2] == 'C' && c[i-3] == 'R'\n && c[i-4] == 'O' && c[i -5] == 'F'\n && c[i-6] == 'E'){\n {flag = true;}\n }\n }\n else if(c[i] == 'S' && c[i-1]=='E'\n && c[i-2] == 'C' && c[i-3] == 'R'\n && c[i-4] == 'O' && c[i -5] == 'F'\n && c[i-6] == 'E' && c[i-7] =='D'){\n {flag = true;}\n }\n }\n else if(c[i] == 'S' && c[i-1]=='E'\n && c[i-2] == 'C' && c[i-3] == 'R'\n && c[i-4] == 'O' && c[i-5] == 'F'\n && c[i-6] == 'E' && c[i-7] =='D'\n && c[i-8] == 'O'){\n {flag = true;}\n }\n }\n else if(c[i] == 'S' && c[i-1]=='E'\n && c[i-2] == 'C' && c[i-3] == 'R'\n && c[i-4] == 'O' && c[i-5] == 'F'\n && c[i-6] == 'E' && c[i-7] =='D'\n && c[i-8] == 'O' && c[i -9] == 'C'){\n {flag = true;}\n }\n }\n if(flag){\n System.out.println(\"YES\");\n }\n else{\n System.out.println(\"NO\");\n }\n \n\n\n\n\n\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "9074b3616c1f1e1b3c95350d0266a03b", "src_uid": "bda4b15827c94b526643dfefc4bc36e7", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// package CF1076;\n\nimport java.util.Scanner;\n\npublic class CF1076B {\n public static void main(String[] args) {\n Scanner s = new Scanner(System.in);\n long m = s.nextLong();\n long ans;\n if (m % 2 == 0) {\n ans = m / 2;\n } else {\n long p = primeFactors(m);\n ans = (m - p) / 2 + 1;\n }\n System.out.println(ans);\n }\n\n public static long primeFactors(long n) {\n // Print the number of 2s that divide n\n\n while (n % 2 == 0) {\n return 2;\n }\n\n // n must be odd at this point. So we can\n // skip one element (Note i = i +2)\n for (long i = 3; i <= Math.sqrt(n); i += 2) {\n // While i divides n, print i and divide n\n while (n % i == 0) {\n return i;\n }\n }\n\n // This condition is to handle the case whien\n // n is a prime number greater than 2\n if (n > 2)\n return n;\n\n return -1;\n }\n\n\n\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation", "number theory"], "code_uid": "516d94acd0456fe578d6b58f170cfa0e", "src_uid": "a1e80ddd97026835a84f91bac8eb21e6", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Scanner;\n\n//527A\npublic class asd {\n\n /**\n * @param args\n */\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n long a = in.nextLong();\n long b = in.nextLong();\n in.close();\n long s = 1;\n \n while(true){\n if(a==b){\n System.out.println(s);\n break;\n }\n \n if(a==1){\n System.out.println(b+s-1);\n break;\n }\n else if(b==1){\n System.out.println(a+s-1);\n break;\n }\n /*\n if(a<b){\n s++;\n b-=a;\n }\n else if(a>b){\n s++;\n a-=b;\n }\n */\n \n if(a<b){\n long k = b/a;\n s+=k;\n b-=(k*a);\n }\n else if(a>b){\n long k = a/b;\n s+=k;\n a-=(k*b);\n } \n \n if (a==0 || b==0){\n System.out.println(s-1);\n break;\n }\n }\n }\n\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "f268bb7f48cf28f9829648151d0220c4", "src_uid": "ce698a0eb3f5b82de58feb177ce43b83", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/**\n * recursion\n */\nimport java.util.*;\n\nimport javax.lang.model.util.ElementScanner6;\npublic class recursion {\nstatic boolean check(int t){\n String m=\"\"+t;\n HashSet<Character>H=new HashSet<>();\n for(char ch:m.toCharArray()){\n if(H.contains(ch)){\n return false;\n }\n else\n H.add(ch);\n }\n \n return true;\n}\n public static void main(String[] args) {\n //intitalise the matrix to the on state\n int a[][]={\n {1,1,1},\n {1,1,1},\n {1,1,1}\n };\n Scanner scan=new Scanner(System.in);\n int b[][]=new int[3][3];\n for(int i=0;i<3;++i){\n for(int j=0;j<3;++j){\n b[i][j]=scan.nextInt();\n }\n }\n //changing the states\n for(int i=0;i<3;++i){\n for(int j=0;j<3;++j){\n if(b[i][j]!=0){\n int temp=b[i][j];\n if(b[i][j]%2==1){\n if(a[i][j]==1){\n a[i][j]=0;\n }\n else\n a[i][j]=1;\n \n if(j+1<a[0].length){\n if(a[i][j+1]==1){\n a[i][j+1]=0;\n }\n else\n a[i][j+1]=1;\n }\n \n if(j-1>=0){\n if(a[i][j-1]==1){\n a[i][j-1]=0;\n }\n else\n a[i][j-1]=1;\n }\n \n \n if(i-1>=0){\n \n if(a[i-1][j]==1){\n a[i-1][j]=0;\n }\n else\n a[i-1][j]=1; \n }\n \n if(i+1<a.length){\n if(a[i+1][j]==1){\n a[i+1][j]=0;\n }\n else\n a[i+1][j]=1;\n }\n \n \n }\n \n }\n }\n }\n for(int i=0;i<3;++i){\n for(int j=0;j<3;++j){\n System.out.print(a[i][j]);\n }\n System.out.println();\n}\n \n }\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "3141a6f965b0259795a0bf662ec198b9", "src_uid": "b045abf40c75bb66a80fd6148ecc5bd6", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Scanner;\npublic class HelloWorld{\n\n public static void main(String []args){\n int inc=0;\n Scanner sc=new Scanner(System.in);\n int n=sc.nextInt();\n int k=sc.nextInt();\n int[] a=new int[n];\n for (int i=0;i<n;i++)\n {\n a[i]=sc.nextInt();\n }\n for(int i=0;i<n;i++)\n {\n if(a[i]>=a[k-1] && a[i]>0)\n inc++;\n }\n System.out.println(inc);\n }\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "0fb14de1cb5bdfb3e9b065c52dfc82d6", "src_uid": "193ec1226ffe07522caf63e84a7d007f", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "//package Codeforces.Div2A_107;\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\n/*\n * some cheeky quote\n */\n\npublic class Main\n{\n FastScanner in;\n PrintWriter out;\n\n public void solve() throws IOException\n {\n int people = in.nextInt();\n int totalBear = in.nextInt() * in.nextInt();\n int totalLimes = in.nextInt() * in.nextInt();\n int totalSalt = in.nextInt();\n\n int toastBear = in.nextInt();\n int totalToastBear = toastBear * people;\n int toastSalt = in.nextInt() * people;\n\n int count = 0;\n while (true)\n {\n if (totalBear < totalToastBear || totalSalt < toastSalt || totalLimes < people)\n {\n break;\n }\n totalBear -= totalToastBear;\n totalSalt -= toastSalt;\n totalLimes -= people;\n count++;\n }\n System.out.println(count);\n\n }\n\n public void run()\n {\n try\n {\n in = new FastScanner();\n out = new PrintWriter(System.out);\n\n solve();\n\n out.close();\n } catch (IOException e)\n {\n e.printStackTrace();\n }\n }\n\n class FastScanner\n {\n BufferedReader br;\n StringTokenizer st;\n\n FastScanner()\n {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n String next()\n {\n while (st == null || !st.hasMoreTokens())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e)\n {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt()\n {\n return Integer.parseInt(next());\n }\n }\n\n public static void main(String[] arg)\n {\n new Main().run();\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "add6c21992ba423c2fc31625f047d2e4", "src_uid": "67410b7d36b9d2e6a97ca5c7cff317c1", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n \npublic class Dubstep\n{\n public static void main(String[] args)\n {\n Scanner in = new Scanner(System.in);\n String s = in.next();\n String ss[] = s.split(\"WUB\");\n for(int i = 0;i<ss.length;i++)\n {\n System.out.print(ss[i]+\" \");\n }\n }\n}", "lang_cluster": "Java", "tags": ["strings"], "code_uid": "cb275a86e1dc4d8e3c75b41dc40f05c8", "src_uid": "edede580da1395fe459a480f6a0a548d", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.Scanner;\n\npublic class KeyRaces {\n public static void main(String[]args) {\n Scanner s = new Scanner(new BufferedReader(new InputStreamReader(System.in)));\n int n=s.nextInt(),v1=s.nextInt(),v2=s.nextInt(),t1=s.nextInt(),t2=s.nextInt();\n int scoreOne=(n*v1)+2*t1;\n int scoreTwo=(n*v2)+2*t2;\n if(scoreOne<scoreTwo)\n System.out.println(\"First\");\n else if(scoreTwo<scoreOne)\n System.out.println(\"Second\");\n else\n System.out.println(\"Friendship\");\n\n }\n }\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "0315683e7a91db84681fd44df87ce790", "src_uid": "10226b8efe9e3c473239d747b911a1ef", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Scanner;\n\n/**\n\t *\tProblem Solving\n\t *\tcreated on: Jun 16, 2016\n\t *\tAuthor : Amr Hendy\t \n*/\npublic class ProfessorGukiZRobot {\n\n\tpublic static void main(String[] args) {\n\t\tScanner input = new Scanner(System.in);\n\t\tint x1 = input.nextInt(); \n\t\tint y1 = input.nextInt();\n\t\tint x2 = input.nextInt();\n\t\tint y2 = input.nextInt();\n\t\tint radialSteps = Math.min(Math.abs(x2-x1), Math.abs(y2-y1));\n\t\tint total = radialSteps + (Math.abs(x2-x1) - radialSteps) + ((Math.abs(y2-y1) - radialSteps));\n\t\tSystem.out.println(total);\n\t\t \n\n\t}\n\t\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "d41d02744b35aa9c733812b0a339fba7", "src_uid": "a6e9405bc3d4847fe962446bc1c457b4", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.io.PrintStream;\nimport java.util.InputMismatchException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Nirav\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scan in = new Scan(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC {\n public void solve(int testNumber, Scan in, PrintWriter out) {\n long nuber = in.scanLong();\n String str = Long.toString(nuber);\n long length = (long) Math.log10(nuber) + 1;\n long totalbit = length;\n long combination = 0;\n while (length > 0) {\n combination = combination | (1 << (length - 1));\n length--;\n }\n long result = -1;\n while (combination > 0) {\n long totalones = 0;\n long ot = 0;\n for (int i = 0; i < totalbit; i++) {\n if ((combination & (1 << i)) != 0) {\n if (ot == 0 && str.charAt(i) == '0') {\n break;\n }\n ot = ot * 10 + str.charAt(i) - '0';\n totalones++;\n }\n }\n if (ot > 0 && Math.sqrt(ot) == (long) Math.sqrt(ot)) {\n if (result < totalones) {\n result = totalones;\n }\n }\n combination--;\n }\n if (result == -1) {\n totalbit = result - 1;\n }\n out.println(totalbit - result);\n\n }\n\n }\n\n static class Scan {\n private byte[] buf = new byte[1024];\n private int index;\n private InputStream in;\n private int total;\n\n public Scan() {\n in = System.in;\n }\n\n public Scan(InputStream inputStream) {\n in = inputStream;\n }\n\n public int scan() {\n if (total < 0) {\n return 0;\n }\n if (index >= total) {\n index = 0;\n try {\n total = in.read(buf);\n } catch (Exception e) {\n System.out.println(e);\n }\n if (total <= 0)\n return -1;\n\n }\n return buf[index++];\n }\n\n public long scanLong() {\n long lng = 0;\n int n = scan();\n while (isWhiteSpace(n))\n n = scan();\n int neg = 1;\n if (n == '-') {\n neg = -1;\n n = scan();\n }\n while (!isWhiteSpace(n) && n != '.') {\n if (n >= '0' && n <= '9') {\n lng *= 10;\n lng += n - '0';\n n = scan();\n } else throw new InputMismatchException();\n }\n if (n == '.') {\n n = scan();\n long temp = 1;\n while (!isWhiteSpace(n)) {\n if (n >= '0' && n <= '9') {\n temp /= 10;\n lng += (n - '0') * temp;\n n = scan();\n } else throw new InputMismatchException();\n }\n }\n return neg * lng;\n }\n\n private boolean isWhiteSpace(int n) {\n if (n == ' ' || n == '\\n' || n == '\\r' || n == '\\t' || n == -1)\n return true;\n return false;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["brute force", "math", "implementation"], "code_uid": "057fa4fb5b35fe0be7fbe89e8b7df535", "src_uid": "fa4b1de79708329bb85437e1413e13df", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\nimport java.math.*;\npublic class h {\n\tpublic static void main(String[] args){\n\t\tScanner br = new Scanner(System.in);\n\t\tlong n = br.nextInt();\n\t\tBigInteger temp = new BigInteger(\"1\");\n\t\ttemp = temp.multiply(BigInteger.valueOf(n));\n\t\ttemp = temp.multiply(BigInteger.valueOf(n-1));\n\t\ttemp = temp.multiply(BigInteger.valueOf(n-2));\n\t\ttemp = temp.multiply(BigInteger.valueOf(n-3));\n\t\ttemp = temp.multiply(BigInteger.valueOf(n-4));\n\t\ttemp = temp.multiply(temp);\n\t\ttemp = temp.divide(BigInteger.valueOf(2));\n\t\ttemp = temp.divide(BigInteger.valueOf(3));\n\t\ttemp = temp.divide(BigInteger.valueOf(4));\n\t\ttemp = temp.divide(BigInteger.valueOf(5));\n\t\t\n\t\t\n\t\tSystem.out.println(temp.longValue());\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "combinatorics"], "code_uid": "317f6e8894b02de8f3b8f425d467a955", "src_uid": "92db14325cd8aee06b502c12d2e3dd81", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "\nimport java.io.*;\nimport java.util.*;\n\npublic class DigitalRoot\n{\n\tpublic Scanner in = new Scanner(System.in);\n\tpublic PrintStream out = System.out;\n\n\tpublic int N;\n\t\n\tpublic void main()\n\t{\n\t\tN = in.nextInt();\n\t\t\n\t\tint x, y, z;\n\t\tlong res = 0;\n\t\t\n\t\tlong A, B, C;\n\t\tint a, b;\n\t\t\n\t\tfor(z=1;z<=9;++z) for(x=1;x<=9;++x) for(y=1;y<=9;++y) if(z == d(x*y))\n\t\t{\n\t\t\tC = count(9, z);\n\t\t\tA = count(9, x);\n\t\t\tB = count(9, y);\n\t\t\t\n\t\t\tres += A * B * C;\n\t\t\t\n\t\t\tfor(int k=0; k*9+x <=N;++k)\n\t\t\t{\n\t\t\t\ta = k*9*9 + 9*x;\n\t\t\t\tb = k*9*y + x*y;\n\t\t\t\tres -= count(a, b);\n\t\t\t}\n\t\t}\n\t\t\n\t\tout.println(res);\n\t}//end public void main()\n\n\tpublic int d(int x)\n\t{\n\t\tif(x%9 == 0) return 9;\n\t\treturn x%9;\n\t}\n\t\n\tpublic int count(int a, int b)\n\t{\n\t\tif(N < b) return 0;\n\t\treturn (N - b)/a + 1;\n\t}\n\t\n\tpublic static void main(String[] args)\n\t{\n\t\t(new DigitalRoot()).main();\n\t}\n}\n\n", "lang_cluster": "Java", "tags": ["number theory"], "code_uid": "796df857b86283788e24b2012c92191f", "src_uid": "fc133fe6353089a0ebee08dec919f608", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.PrintWriter;\nimport java.util.Scanner;\n\npublic class n148A {\n\n Scanner in;\n PrintWriter out;\n\n void solve() {\n int k = in.nextInt();\n int l = in.nextInt();\n int m = in.nextInt();\n int n = in.nextInt();\n int d = in.nextInt();\n boolean used[] = new boolean[1 + d];\n for (int i = 1; i <= d; i++) {\n if (i % k == 0 || i % l == 0 || i % m == 0 || i % n == 0) {\n used[i] = true;\n }\n }\n int kol = 0;\n for (int i = 1; i <= d; i++) {\n if (used[i]) {\n kol++;\n }\n }\n out.println(kol);\n }\n\n void run() {\n in = new Scanner(System.in);\n out = new PrintWriter(System.out);\n try {\n solve();\n } finally {\n out.close();\n }\n }\n\n public static void main(String[] args) {\n new n148A().run();\n\n }\n\n}\n", "lang_cluster": "Java", "tags": ["math", "constructive algorithms", "implementation"], "code_uid": "5574cb64ef75c7ec69922e9280296336", "src_uid": "46bfdec9bfc1e91bd2f5022f3d3c8ce7", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\n\npublic class Domino {\n\tstatic Scanner scn = new Scanner(System.in);\n\n\tpublic static void main(String[] args) {\n\n\t\thelper();\n\t}\n\n\tpublic static void helper() {\n\n\t\tint n = (int)input();\n\t\tint[][] arr = new int[n][2];\n\t\tint s1 = 0, s2 = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tarr[i][0] = (int)input();\n\t\t\tarr[i][1] = (int)input();\n\t\t\ts1 += arr[i][0];\n\t\t\ts2 += arr[i][1];\n\t\t}\n\n\t\tif ((s1 & 1) == 0 && (s2 & 1) == 0) {\n\t\t\tprint(0);\n\t\t\treturn;\n\t\t}\n\n\t\tif ((s1 & 1) == 1 && (s2 & 1) == 1) {\n\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (((arr[i][0] & 1) ^ (arr[i][1] & 1)) == 1) {\n\t\t\t\t\tprint(1);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tprint(-1);\n\n\t}\n\n\n\tpublic static long input() {\n\t\treturn scn.nextLong();\n\t}\n\n\tpublic static String input(int... var) {\n\t\treturn scn.next();\n\t}\n\n\tpublic static void TakeInput(int[] arr) {\n\t\tfor (int i = 0; i < arr.length; i++)\n\t\t\tarr[i] = (int)input();\n\t}\n\n\tpublic static void TakeInput(long[] arr) {\n\t\tfor (int i = 0; i < arr.length; i++)\n\t\t\tarr[i] = input();\n\t}\n\n\tpublic static void printArray(int[] arr) {\n\t\tfor (int val : arr)\n\t\t\tprint(val + \" \");\n\n\t\tprint(\"\\n\");\n\t}\n\n\tpublic static void printArray(long[] arr) {\n\t\tfor (long val : arr)\n\t\t\tprint(val + \" \");\n\n\t\tprint(\"\\n\");\n\t}\n\n\tpublic static <T> void print(T t) {\n\t\tSystem.out.print(t);\n\t}\n\tpublic static void print() {\n\t\tSystem.out.println();\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "0f68d2ecf2adfa24dbc8a8fd581a7fe5", "src_uid": "f9bc04aed2b84c7dd288749ac264bb43", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.Scanner;\n\npublic class contest17 {\n public static void main(String[] args) {\n try\n {\n Scanner s=new Scanner(System.in);\n int n=s.nextInt();\n int ans=0,min=0;\n int b[]=new int[n];\n int a[]=new int[n];\n for(int i=0;i<n;i++)\n {\n a[i]=s.nextInt();\n }\n min=a[2]-a[0];\n for(int i=0;i<n-2;i++)\n {\n b[i]=a[i+2]-a[i];\n if(b[i]<min)\n min=b[i];\n }\n \n for(int i=0;i<n;i++)\n {\n if(b[i]==min)\n {\n ans=i+1;\n }\n }\n for(int i=0;i<ans;i++)\n {\n b[i]=a[i];\n }\n for(int i=ans+1;i<n;i++)\n {\n b[i-1]=a[i];\n }\n min=0;\n for(int i=0;i<n-1;i++)\n {\n if(b[i+1]-b[i]>min)\n {\n min=b[i+1]-b[i];\n }\n }\n System.out.println(min);\n }\n catch(Exception e)\n {\n System.out.println(e.getMessage());\n }\n }\n \n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "implementation"], "code_uid": "d2fe016067c5455252a6ffdaed1ade9b", "src_uid": "8a8013f960814040ac4bf229a0bd5437", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.Console;\nimport java.util.Arrays;\nimport java.io.*;\nimport java.lang.Integer;\n\npublic class problemA {\n\t\n\tpublic static void main (String args[]) throws IOException {\n\n\t\tBufferedReader in;\n\n\t\tif (System.getProperty(\"ONLINE_JUDGE\") != null) {\n in = new BufferedReader(new InputStreamReader(System.in));\n } else {\n in = new BufferedReader(new FileReader(\"input.txt\"));\n }\n\n\n String numApplesString = in.readLine();\n int n = Integer.parseInt(numApplesString);\n String [] weights = in.readLine().split(\" \");\n in.close();\n\n int i = 0;\n int sum = 0;\n\n while (i < n) {\n \tsum += Integer.parseInt(weights[i]);\n \ti++;\n }\n\n if ((sum == n * 200) && (n % 2 == 1)) {\n \tSystem.out.println(\"NO\");\n }\n else if ((sum % 200 == 0 && n > 1)) {\n \tSystem.out.println(\"YES\");\n } else {\n \tSystem.out.println(\"NO\");\n }\n\n \n }\n\n\n}", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "8451804448509d30c65c44141e0a309a", "src_uid": "9679acef82356004e47b1118f8fc836a", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\npublic class password {\n\n public static void main (String[]args) {\n \tScanner sc=new Scanner(System.in);\n \tString x=sc.nextLine();\n \tboolean l=x.length()>=5;\n \tboolean E=false;\n \tboolean e=false;\n \tboolean d=false;\n \tif(l)\n \tfor(int i=0 ;i<x.length()&&(!E|!e|!d); i++)\n \t{\n \t\tif(x.charAt(i)>='a'&&x.charAt(i)<='z')\n \t\t\te=true;\n \t\telse\n \t\t if(x.charAt(i)>='A'&&x.charAt(i)<='Z')\n \t\t \tE=true;\n \t\t else\n \t\t \tif(x.charAt(i)>='0'&&x.charAt(i)<='9')\n \t\t \t\td=true;\n \t}\n System.out.print(l&E&e&d?\"Correct\":\"Too weak\");\n }\n\n\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "a8313b4228fd247af81aade86f3b6589", "src_uid": "42a964b01e269491975965860ec92be7", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class BigRecursion {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt(); int m = sc.nextInt();\n int[] a = new int[n];\n int[] b = new int[m];\n for(int i=0;i<n;i++){\n a[i] = sc.nextInt();\n }\n\n for(int i=0;i<m;i++){\n b[i] = sc.nextInt();\n }\n\n int ans = Integer.MAX_VALUE;\n for(int i=0;i<a.length;i++){\n for(int j=0;j<b.length;j++){\n String s = String.valueOf(a[i])+String.valueOf(b[j]);\n String ss = String.valueOf(b[j])+String.valueOf(a[i]);\n if(a[i]==b[j]){\n s = String.valueOf(a[i]);\n }\n ans = Math.min(Math.min(Integer.parseInt(s),Integer.parseInt(ss)),ans);\n }\n }\n System.out.println(ans);\n }\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "0dfd15b76bd7a511c29674df504a9884", "src_uid": "3a0c1b6d710fd8f0b6daf420255d76ee", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.Scanner;\nimport java.lang.*;\nimport java.io.*;\n\npublic class pb1\n{\n\tpublic static void main (String[] args)\n\t{\n\t\tScanner in = new Scanner(System.in);\n\n\t\tString s1,s2;\n\t\ts1 = in.nextLine();\n\t\ts1 = s1.toLowerCase();\n\t\ts1 = s1.replaceAll(\"\\\\s\", \"\");\n\n\t\tchar t1[] = s1.toCharArray();\n\t\tint c = 0;\n\t\ts2 = \"aeiouy\";\n\t\tchar t2[] = s2.toCharArray();\n\t\tint f = 0;\n\t\tfor(int i=0; i< 6; i++)\n\t\t{\n\t\t\tif(t1[s1.length()-2] == t2[i])\n\t\t\t{\n\t\t\t\tSystem.out.println(\"YES\");\n\t\t\t\tf = 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif( f == 0 )\n\t\t\tSystem.out.println(\"NO\");\n\t}\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "3703ebc2a3786c6092b4706ca6380b1e", "src_uid": "dea7eb04e086a4c1b3924eff255b9648", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import javax.swing.*;\nimport java.util.ArrayList;\nimport java.util.HashMap;\nimport java.util.Scanner;\n\npublic class t{\n static Scanner reader=new Scanner(System.in);\n\n public static void main(String[] args){\n\n int a =reader.nextInt(),b= reader.nextInt();\n int fw = 0 , d =0 , lw =0;\n for (int i=1;i<=6;i++){\n\n if(Math.abs(i-a)<Math.abs(i-b)){\n fw++;\n }else if (Math.abs(i-a)>Math.abs(i-b)){\n lw++;\n }else if(Math.abs(i-a)==Math.abs(i-b)){\n d++;\n }\n }\n System.out.println(fw +\" \"+d+\" \"+lw);\n\n\n\n\n }\n\n }", "lang_cluster": "Java", "tags": ["brute force"], "code_uid": "fa89e45e594cdc25c5bf1793ca9deea4", "src_uid": "504b8aae3a3abedf873a3b8b127c5dd8", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n static class Assertion {\n static void check(boolean e) {\n if (!e) {\n throw new Error();\n }\n }\n }\n\n // class Scanner {\n // StreamTokenizer in;\n //\n // Scanner(InputStream s) {\n // in = new StreamTokenizer(new BufferedReader(new InputStreamReader(s)));\n // in.resetSyntax();\n // in.whitespaceChars(0, 32);\n // in.wordChars(33, 255);\n // }\n //\n // String next() {\n // try {\n // in.nextToken();\n // return in.sval;\n // } catch (Exception e) {\n // throw new Error();\n // }\n // }\n //\n // int nextInt() {\n // return Integer.parseInt(next());\n // }\n //\n // long nextLong() {\n // return Long.parseLong(next());\n // }\n //\n // double nextDobule() {\n // return Double.parseDouble(next());\n // }\n // }\n\n Scanner in;\n PrintWriter out;\n\n void solve() {\n int nOld = in.nextInt();\n int nChilds = in.nextInt();\n if (nOld == 0 && nChilds>0) {\n out.println(\"Impossible\");\n } else {\n int min = 0;\n if (nOld >= nChilds) {\n min += nOld;\n } else {\n min += nOld + (nChilds - nOld);\n }\n int max = nOld + Math.max(0,nChilds - 1);\n out.println(min + \" \" + max);\n }\n }\n\n void run() {\n in = new Scanner(System.in);\n out = new PrintWriter(System.out);\n try {\n solve();\n } finally {\n out.close();\n }\n }\n\n public static void main(String[] args) {\n new Main().run();\n }\n}", "lang_cluster": "Java", "tags": ["math", "greedy"], "code_uid": "9c0f31328d02841025a7e0de96a40041", "src_uid": "1e865eda33afe09302bda9077d613763", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class Main {\n\n private static int m;\n private static int b;\n\n private static long sum(long x, long y) {\n return (x + 1) * (y + 1) * (x + y) / 2;\n }\n\n private static long y(long x) {\n return (long) (-(double) x / m + b);\n }\n\n private static long x(long y) {\n return m * (b - y);\n }\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n m = in.nextInt();\n b = in.nextInt();\n\n long max = 0;\n\n for (int y = 0; y <= b; ++y) {\n long s = sum(x(y), y);\n if (max < s)\n max = s;\n }\n\n System.out.println(max);\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math"], "code_uid": "9954f87306c7a0ba50aedae421889c9c", "src_uid": "9300f1c07dd36e0cf7e6cb7911df4cf2", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Scanner;\n\npublic class ExA {\npublic static void main(String[] args) {\n\t\t\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint r = scanner.nextInt();\n\t\tint g = scanner.nextInt();\n\t\tint b = scanner.nextInt();\n\t\t\n\t\tint counter = 30;\n\t\t\n\t\tif (r>=2){\n\t\t\tint n=r/2;\n\t\t\tint rem=r%2;\n\t\t\tif (rem==0){\n\t\t\t\tcounter+=(n-1)*3;\n\t\t\t\tg-=(n-1)*2;\n\t\t\t\tb-=(n-1)*2;\n\t\t\t}\n\t\t\telse if (rem==1){\n\t\t\t\tcounter+=n*3;\n\t\t\t\tg-=n*2;\n\t\t\t\tb-=n*2;\n\t\t\t}\n\t\t}\n\t\tif (g>0){\n\t\t\tcounter++;\n\t\t\tif (g>=3){\n\t\t\t\tint n=g/2;\n\t\t\t\tint rem=g%2;\n\t\t\t\tif (rem==0){\n\t\t\t\t\tcounter+=(n-1)*3;\n\t\t\t\t\tb-=(n-1)*2;\n\t\t\t\t}\n\t\t\t\telse if (rem==1){\n\t\t\t\t\tcounter+=n*3;\n\t\t\t\t\tb-=n*2;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (g<=0 && b>0){\n\t\t\tcounter++;\n\t\t}\n\t\tif (b>0) {\n\t\t\tcounter++;\n\t\t\tif (b>=3){\n\t\t\t\tint n=b/2;\n\t\t\t\tint rem=b%2;\n\t\t\t\tif (rem==0){\n\t\t\t\t\tcounter+=(n-1)*3;\n\t\t\t\t}\n\t\t\t\telse if (rem==1){\n\t\t\t\t\tcounter+=n*3;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(counter);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "greedy"], "code_uid": "eed924db4e4faffa5de82064966cf20d", "src_uid": "a45daac108076102da54e07e1e2a37d7", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Gravity_Flip {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tint arr[]=new int[n];\n\t\tfor(int i=0;i<n;i++)\n\t\t{\n\t\t\tarr[i]=sc.nextInt();\n\t\t}\n\t\tArrays.sort(arr);\n\t\tfor(int i=0;i<n;i++)\n\t\t{\n\t\t\tSystem.out.print(arr[i]+\" \");\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["sortings", "implementation", "greedy"], "code_uid": "b39de8e388296d3bf3f2b0b6dc7d051e", "src_uid": "ae20712265d4adf293e75d016b4b82d8", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.awt.Point;\nimport java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n\nimport static java.lang.Math.*;\n \npublic class Solution121A {\n \n final boolean ONLINE_JUDGE = System.getProperty(\"ONLINE_JUDGE\")!=null;\n BufferedReader in;\n PrintWriter out;\n StringTokenizer tok = new StringTokenizer(\"\");\n \n void init() throws FileNotFoundException{\n if (ONLINE_JUDGE){\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n }else{\n in = new BufferedReader(new FileReader(\"input.txt\"));\n out = new PrintWriter(\"output.txt\");\n }\n }\n \n String readString() throws IOException{\n while(!tok.hasMoreTokens()){\n tok = new StringTokenizer(in.readLine());\n }\n return tok.nextToken();\n }\n \n int readInt() throws IOException{\n return Integer.parseInt(readString());\n }\n \n long readLong() throws IOException{\n return Long.parseLong(readString());\n }\n \n double readDouble() throws IOException{\n return Double.parseDouble(readString());\n }\n \n public static void main(String[] args){\n new Solution121A().run();\n }\n \n public void run(){\n try{\n long t1 = System.currentTimeMillis();\n init();\n solve();\n out.close();\n long t2 = System.currentTimeMillis();\n System.err.println(\"Time = \"+(t2-t1));\n }catch (Exception e){\n e.printStackTrace(System.err);\n System.exit(-1);\n }\n }\n ArrayList<Long> happiens;\n \n int[] cur = {4,0,0,0,0,0,0,0,0};\n \n boolean Generate(){\n \tint c = 0;\n \tdo{\n \t\tif(cur[c] == 4){\n \t\t\tcur[c] = 7;\n \t\t\tString s = \"\";\n \t\t\tfor(int i = 8; i >= 0; i--){\n \t\t\t\ts += Integer.toString(cur[i]);\n \t\t\t}\n \t\t\thappiens.add(Long.parseLong(s));\n \t\t\treturn true;\n \t\t}\n \t\tif(cur[c] == 0){\n \t\t\tcur[c] = 4;\n \t\t\tString s = \"\";\n \t\t\tfor(int i = 8; i >= 0; i--){\n \t\t\t\ts += Integer.toString(cur[i]);\n \t\t\t}\n \t\t\thappiens.add(Long.parseLong(s));\n \t\t\treturn true;\n \t\t}\n \t\t\n \t\t\tcur[c] = 4;\n \t\t\tc++;\n \t\t\tif(c >= 9){\n \t\t\t\treturn false;\n \t\t\t\n \t\t}\n \t\t\n \t}while(true);\n }\n \n void solve() throws IOException{\n \tlong l = readInt();\n \tlong r = readInt();\n \thappiens = new ArrayList<Long>();\n \thappiens.add((long) 4);\n \tboolean c = true;\n \tdo{\n \t\tc = Generate();\n \t}while(c);\n \tlong max = Long.parseLong(\"4444444444\");\n \thappiens.add(max);\n \tlong summ = 0;\n \tint begin = 0, end = 0;\n \tfor(int i = 0; i < happiens.size(); i++){\n \t\tif(happiens.get(i) >= l){\n \t\t\tbegin = i;\n \t\t\tbreak;\n \t\t}\n \t}\n \tfor(int i = 0; i < happiens.size(); i++){\n \t\tif(happiens.get(i) >= r){\n \t\t\tend = i;\n \t\t\tbreak;\n \t\t}\n \t}\n \tif(begin == end){\n \t\tsumm = (r-l+1)*happiens.get(end);\n \t\tout.println(summ);\n \t\treturn;\n \t}\n \tlong curIndex = l;\n \tfor(int i = begin; i < end; i++){\n \t\tsumm += (happiens.get(i) - curIndex + 1)*happiens.get(i);\n \t\tcurIndex = happiens.get(i)+1;\n \t}\n \tsumm += (r-curIndex + 1)*happiens.get(end);\n \tout.println(summ);\n \t\n }\n \n int ModExp(int a, int n, int mod){\n \tint res = 1;\n \twhile (n!=0)\n \t\tif ((n & 1) != 0) {\n \t\t\tres = (res*a)%mod;\n \t\t\t--n;\n \t\t}\n \t\telse {\n \t\t\ta = (a*a)%mod;\n \t\t\tn >>= 1;\n \t\t}\n \treturn res;\n }\n \n \n static class Utils {\n \n private Utils() {}\n \n public static void mergeSort(int[] a) {\n mergeSort(a, 0, a.length - 1);\n }\n \n private static void mergeSort(int[] a, int leftIndex, int rightIndex) {\n final int MAGIC_VALUE = 50;\n if (leftIndex < rightIndex) {\n if (rightIndex - leftIndex <= MAGIC_VALUE) {\n insertionSort(a, leftIndex, rightIndex);\n } else {\n int middleIndex = (leftIndex + rightIndex) / 2;\n mergeSort(a, leftIndex, middleIndex);\n mergeSort(a, middleIndex + 1, rightIndex);\n merge(a, leftIndex, middleIndex, rightIndex);\n }\n }\n }\n \n private static void merge(int[] a, int leftIndex, int middleIndex, int rightIndex) {\n int length1 = middleIndex - leftIndex + 1;\n int length2 = rightIndex - middleIndex;\n int[] leftArray = new int[length1];\n int[] rightArray = new int[length2];\n System.arraycopy(a, leftIndex, leftArray, 0, length1);\n System.arraycopy(a, middleIndex + 1, rightArray, 0, length2);\n for (int k = leftIndex, i = 0, j = 0; k <= rightIndex; k++) {\n if (i == length1) {\n a[k] = rightArray[j++];\n } else if (j == length2) {\n a[k] = leftArray[i++];\n } else {\n a[k] = leftArray[i] <= rightArray[j] ? leftArray[i++] : rightArray[j++];\n }\n }\n }\n \n private static void insertionSort(int[] a, int leftIndex, int rightIndex) {\n for (int i = leftIndex + 1; i <= rightIndex; i++) {\n int current = a[i];\n int j = i - 1;\n while (j >= leftIndex && a[j] > current) {\n a[j + 1] = a[j];\n j--;\n }\n a[j + 1] = current;\n }\n } \n }\n \n \n \n boolean isPrime(int a){\n \tfor(int i = 2; i <= sqrt(a); i++)\n \t\tif(a % i == 0) return false;\n \treturn true;\n }\n \n static double distance(long x1, long y1, long x2, long y2){\n \treturn Math.sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));\n }\n \n static long gcd(long a, long b){\n \tif(min(a,b) == 0) return max(a,b);\n \treturn gcd(max(a, b) % min(a,b), min(a,b));\n }\n \n static long lcm(long a, long b){\n \treturn a * b /gcd(a, b);\n }\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "7aeb65184665c706c2a6da6180ed83ac", "src_uid": "8a45fe8956d3ac9d501f4a13b55638dd", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.Scanner;\n\npublic class BeautifulYear {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int year = scanner.nextInt();\n char q, w, e, r;\n q = w = e = r = 0;\n\n while (q == w || q == e || q == r || w == e || w == r || e == r) {\n String yearStr = Integer.toString(year+1);\n q = yearStr.charAt(0);\n w = yearStr.charAt(1);\n e = yearStr.charAt(2);\n r = yearStr.charAt(3);\n year++;\n }\n System.out.println(year);\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force"], "code_uid": "5a705db7b83a31a60a91953140fcf786", "src_uid": "d62dabfbec52675b7ed7b582ad133acd", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "\n// Working program using Reader Class \nimport java.io.DataInputStream;\nimport java.io.FileInputStream;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\nimport java.util.StringTokenizer;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.Scanner;\n\npublic class C {\n static Scanner sc = new Scanner(System.in);\n\n public static void main(String[] args) throws IOException {\n int t = 1;\n // t = sc.nextInt();\n while (t-- > 0) {\n solve();\n }\n }\n\n private static void solve() throws IOException {\n Reader sc = new Reader();\n int n=sc.nextInt();\n int x=sc.nextInt();\n int pos=sc.nextInt();\n int l=0;\n int h=n;\n int countless=x-1;\n long fact=1;\n int counthigh=n-x;\n while(l<h)\n {\n int mid=(l+h)/2;\n if(mid<pos)\n {\n l=mid+1;\n fact*=countless;\n fact%=(int)(1e9+7);\n countless--;\n }\n else\n if(mid>pos){\n h=mid;\n fact*=counthigh;\n counthigh--;\n fact%=(int)(1e9+7);\n }\n else{\n l=mid+1;\n }\n }\n if(l>0&&l-1==pos)\n {\n int bacha=countless+counthigh;\n while(bacha>0)\n {\n fact*=bacha;\n fact%=(int)(1e9+7);\n bacha--;\n }\n System.out.println(fact);\n return;\n }\n System.out.println(0);\n }\n\n static class Reader {\n final private int BUFFER_SIZE = 1 << 16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n\n public Reader() {\n din = new DataInputStream(System.in);\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public Reader(String file_name) throws IOException {\n din = new DataInputStream(new FileInputStream(file_name));\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public String readLine() throws IOException {\n byte[] buf = new byte[64]; // line length\n int cnt = 0, c;\n while ((c = read()) != -1) {\n if (c == '\\n')\n break;\n buf[cnt++] = (byte) c;\n }\n return new String(buf, 0, cnt);\n }\n\n public int nextInt() throws IOException {\n int ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n\n if (neg)\n return -ret;\n return ret;\n }\n\n public long nextLong() throws IOException {\n long ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n if (neg)\n return -ret;\n return ret;\n }\n\n public double nextDouble() throws IOException {\n double ret = 0, div = 1;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n\n if (c == '.') {\n while ((c = read()) >= '0' && c <= '9') {\n ret += (c - '0') / (div *= 10);\n }\n }\n\n if (neg)\n return -ret;\n return ret;\n }\n\n private void fillBuffer() throws IOException {\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1)\n buffer[0] = -1;\n }\n\n private byte read() throws IOException {\n if (bufferPointer == bytesRead)\n fillBuffer();\n return buffer[bufferPointer++];\n }\n\n public void close() throws IOException {\n if (din == null)\n return;\n din.close();\n }\n }\n}", "lang_cluster": "Java", "tags": ["binary search", "combinatorics"], "code_uid": "75c6ebeeaa547b24191d44148a077fa3", "src_uid": "24e2f10463f440affccc2755f4462d8a", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\npublic class plant{\npublic static long mod = 1000000007;\npublic static void main(String args[]) throws IOException{\nBufferedReader lector = new BufferedReader(new InputStreamReader(System.in));\nlong p = Long.parseLong(lector.readLine());\nif(p==0){\nSystem.out.println(\"1\");\nreturn;\n}\nlong pp = exp(2,p-1);\nlong res = (((pp)%mod)*((2*pp+1)%mod))%mod;\nSystem.out.println(res);\n}\npublic static long exp(long a,long b){\nif(b==0)return 1;\nif(b==1)return a;\nlong t = 0;\nif((b&1)==0)t = exp(a,b/2);\nreturn ((b&1)==0)?(t*t)%mod:(exp(a,b-1)*a)%mod;\n}\n}\n", "lang_cluster": "Java", "tags": ["math", "matrices", "dp", "number theory"], "code_uid": "3e47e17864a39f084c94e8905e048145", "src_uid": "782b819eb0bfc86d6f96f15ac09d5085", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n Task118D solver = new Task118D();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class Task118D {\n long mod = (long) 1e8;\n long dp[][][];\n\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n1 = in.nextInt();\n int n2 = in.nextInt();\n int k1 = in.nextInt();\n int k2 = in.nextInt();\n dp = new long[n1 + 1][n2 + 1][2];\n\n for (int i = 0; i <= n1; i++) {\n for (int j = 0; j <= n2; j++) {\n dp[i][j][0] = -1;\n dp[i][j][1] = -1;\n }\n }\n\n long ans = rec(n1, n2, 0, k1, k2) + rec(n1, n2, 1, k1, k2);\n ans %= mod;\n out.println(ans);\n }\n\n long rec(int n1, int n2, int turn, int k1, int k2) {\n if (dp[n1][n2][turn] != -1)\n return dp[n1][n2][turn];\n if (n1 == 0 && n2 == 0)\n return 1;\n if (turn == 0 && n1 == 0)\n return 0;\n if (turn == 1 && n2 == 0)\n return 0;\n\n long ans = 0;\n if (turn == 0) {\n for (int i = 1; i <= k1; i++) {\n if (n1 - i >= 0)\n ans += rec(n1 - i, n2, 1, k1, k2);\n }\n } else {\n for (int i = 1; i <= k2; i++) {\n if (n2 - i >= 0)\n ans += rec(n1, n2 - i, 0, k1, k2);\n }\n }\n ans %= mod;\n dp[n1][n2][turn] = ans;\n return ans;\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void println(long i) {\n writer.println(i);\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "4db1d74494eebd5fc11fbbdbbc12abc5", "src_uid": "63aabef26fe008e4c6fc9336eb038289", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n\n \n\n\npublic class Main\n{\n static class FastScanner {\n BufferedReader br;\n StringTokenizer st;\n\n FastScanner(InputStream f) {\n try {\n br = new BufferedReader(new InputStreamReader(f));\n } catch (Exception e) {\n e.printStackTrace();\n }\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n \n }\n public static void main(String args[])\n {\n InputStream in=System.in;\n // OutputStream out=System.out;\n FastScanner fs=new FastScanner(in);\n PrintWriter out=new PrintWriter(System.out);\n \n int arr[]=new int[6];\n for(int i=0;i<6;i++)\n arr[i]=fs.nextInt();\n long sum=0;\n long sum1=0;\n int tr=0;\n for(int i=0;i<6;i++)\n for(int j=i+1;j<6;j++)\n for(int k=j+1;k<6;k++)\n {sum=arr[i]+arr[j]+arr[k];\n sum1=0;\n for(int l=0;l<6;l++)\n if(l!=i&&l!=j&&l!=k)\n sum1=sum1+arr[l];\n if(sum1==sum)\n tr=1;\n\n\n }\n\nif(tr==1)\n out.println(\"YES\");\nelse \n out.println(\"NO\");\n\n // for(int i=0;i<n;i++)\n // System.out.println(arr[i]);\n out.close();\n }\n\n}", "lang_cluster": "Java", "tags": ["brute force"], "code_uid": "752b4aba740409bebc9bec5e8212eeb6", "src_uid": "2acf686862a34c337d1d2cbc0ac3fd11", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Scanner;\n\npublic class Main{\n\n public static void main(String[] args) {\n \n Scanner s = new Scanner(System.in);\n \n int n = s.nextInt();\n int a = s.nextInt();\n int b = s.nextInt(); \n if(a+b<n){\n System.out.println(b+1);\n }else{\n System.out.println(n-a);\n }\n }\n}", "lang_cluster": "Java", "tags": ["math"], "code_uid": "cb2a3a3f86d8ddc0e9cd0ad20e82b399", "src_uid": "51a072916bff600922a77da0c4582180", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.Collections;\nimport java.util.HashMap;\nimport java.util.PriorityQueue;\nimport java.util.Scanner;\n\npublic class card_game {\n\tpublic static void main(String args[]) {\n\t\tScanner scn = new Scanner(System.in);\n\t\tint x=scn.nextInt();\n\t\tint y=scn.nextInt();\n\t\tif(x==0 && y==0){\n\t\t\tSystem.out.println(0);\n\t\t}\n\t\telse if(y-x>0 && x+y>=0){\n\t\t\tint k=y-1;\n\t\t\tSystem.out.println(4*k+2);\n\t\t}\n\t\telse if(y-x>=0 && x+y<0){\n\t\t\tint k=Math.abs(x)-1;\n\t\t\tSystem.out.println(4*k+3);\n\t\t}\n\t\telse if(y-x<=0 && x+y-1>0){\n\t\t\tint k=x-1;\n\t\t\tSystem.out.println(4*k+1);\n\t\t}\n\t\telse if(y-x<0 && x+y-1<=0){\n\t\t\tint k=Math.abs(y);\n\t\t\tSystem.out.println(4*k);\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "geometry", "implementation"], "code_uid": "5aed97a5c645adcce4e0a602c7770d7f", "src_uid": "2fb2a129e01efc03cfc3ad91dac88382", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.util.Map.Entry;\nimport javax.swing.text.InternationalFormatter;\nimport java.math.*;\npublic class RATHOD \n{\n public static void main(String[] args) throws IOException\n { \n Reader sc=new Reader(); \n long n=sc.nextLong();\n long m=sc.nextLong();\n long min=-1;\n long req;\n req=(long) Math.ceil((n)/(2.0));\n long sol1,sol2;\n if(m>=req)\n {\n sol1=0;\n }\n else\n {\n if(n%2==0)\n sol1=(((n/2)-m)*2); \n else\n sol1=(((n/2)-m)*2+1); \n }\n long l=1;\n long r=n;\n long cn=0;\n while(l<=r)\n {\n long mid=(l+r)/2;\n //System.out.println(cn);\n if(((mid)*(mid-1))/2>m)\n r=mid-1;\n else\n {\n cn=mid;\n l=mid+1;\n }\n }\n //System.out.println(cn);\n if((cn*(cn-1))/2==m)\n sol2=n-cn;\n else\n sol2=n-cn-1;\n if(m==0)\n sol2=n;\n System.out.println(sol1+\" \"+sol2);\n \n }\n \n \n \n \n\t// _________________________TEMPLATE_____________________________________________________________\n\n\t// private static int gcd(int a, int b) {\n\t// if(a== 0)\n\t// return b;\n\t//\n\t// return gcd(b%a,a);\n\t// }\n\n\t// static class comp implements Comparator<pair> {\n\t//\n\t// @Override\n\t// public int compare(pair o1, pair o2) {\n\t// return o2.b - o1.b;\n\t// }\n\t//\n\t// }\n\n\tstatic class pair implements Comparable<pair> {\n\t\tint min;\n\t\tint max;\n\t\tint ans;\n\n\t\tpair(int a, int b) {\n\t\t\tmin = a;\n\t\t\tmax = b;\n\t\t}\n\n\t\t@Override\n\t\tpublic int compareTo(pair o) {\n\n\t\t\treturn (int) (this.min - o.max);\n\n\t\t}\n\t}\n\n\tpublic static class Reader {\n\t\tfinal private int BUFFER_SIZE = 1 << 16;\n\t\tprivate DataInputStream din;\n\t\tprivate byte[] buffer;\n\t\tprivate int bufferPointer, bytesRead;\n\n\t\tpublic Reader() {\n\t\t\tdin = new DataInputStream(System.in);\n\t\t\tbuffer = new byte[BUFFER_SIZE];\n\t\t\tbufferPointer = bytesRead = 0;\n\t\t}\n\n\t\tpublic Reader(String file_name) throws IOException {\n\t\t\tdin = new DataInputStream(new FileInputStream(file_name));\n\t\t\tbuffer = new byte[BUFFER_SIZE];\n\t\t\tbufferPointer = bytesRead = 0;\n\t\t}\n\n\t\tpublic String readLine() throws IOException {\n\t\t\tbyte[] buf = new byte[100000 + 1]; // line length\n\t\t\tint cnt = 0, c;\n\t\t\twhile ((c = read()) != -1) {\n\t\t\t\tif (c == '\\n')\n\t\t\t\t\tbreak;\n\t\t\t\tbuf[cnt++] = (byte) c;\n\t\t\t}\n\t\t\treturn new String(buf, 0, cnt);\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {\n\t\t\tint ret = 0;\n\t\t\tbyte c = read();\n\t\t\twhile (c <= ' ')\n\t\t\t\tc = read();\n\t\t\tboolean neg = (c == '-');\n\t\t\tif (neg)\n\t\t\t\tc = read();\n\t\t\tdo {\n\t\t\t\tret = ret * 10 + c - '0';\n\t\t\t} while ((c = read()) >= '0' && c <= '9');\n\n\t\t\tif (neg)\n\t\t\t\treturn -ret;\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic long nextLong() throws IOException {\n\t\t\tlong ret = 0;\n\t\t\tbyte c = read();\n\t\t\twhile (c <= ' ')\n\t\t\t\tc = read();\n\t\t\tboolean neg = (c == '-');\n\t\t\tif (neg)\n\t\t\t\tc = read();\n\t\t\tdo {\n\t\t\t\tret = ret * 10 + c - '0';\n\t\t\t} while ((c = read()) >= '0' && c <= '9');\n\t\t\tif (neg)\n\t\t\t\treturn -ret;\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic double nextDouble() throws IOException {\n\t\t\tdouble ret = 0, div = 1;\n\t\t\tbyte c = read();\n\t\t\twhile (c <= ' ')\n\t\t\t\tc = read();\n\t\t\tboolean neg = (c == '-');\n\t\t\tif (neg)\n\t\t\t\tc = read();\n\n\t\t\tdo {\n\t\t\t\tret = ret * 10 + c - '0';\n\t\t\t} while ((c = read()) >= '0' && c <= '9');\n\n\t\t\tif (c == '.') {\n\t\t\t\twhile ((c = read()) >= '0' && c <= '9') {\n\t\t\t\t\tret += (c - '0') / (div *= 10);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (neg)\n\t\t\t\treturn -ret;\n\t\t\treturn ret;\n\t\t}\n\n\t\tprivate void fillBuffer() throws IOException {\n\t\t\tbytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n\t\t\tif (bytesRead == -1)\n\t\t\t\tbuffer[0] = -1;\n\t\t}\n\n\t\tprivate byte read() throws IOException {\n\t\t\tif (bufferPointer == bytesRead)\n\t\t\t\tfillBuffer();\n\t\t\treturn buffer[bufferPointer++];\n\t\t}\n\n\t\tpublic void close() throws IOException {\n\t\t\tif (din == null)\n\t\t\t\treturn;\n\t\t\tdin.close();\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) throws IOException {\n\t\t\tint[] arr = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tarr[i] = nextInt();\n\t\t\t}\n\t\t\treturn arr;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) throws IOException {\n\t\t\tlong[] arr = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tarr[i] = nextLong();\n\t\t\t}\n\t\t\treturn arr;\n\t\t}\n\n\t\tpublic int[][] nextInt2DArray(int m, int n) throws IOException {\n\t\t\tint[][] arr = new int[m][n];\n\t\t\tfor (int i = 0; i < m; i++) {\n\t\t\t\tfor (int j = 0; j < n; j++)\n\t\t\t\t\tarr[i][j] = nextInt();\n\t\t\t}\n\t\t\treturn arr;\n\t\t}\n\n\t}\n\n}", "lang_cluster": "Java", "tags": ["constructive algorithms", "graphs"], "code_uid": "f1801d86b2702f3f677a9157543bbd26", "src_uid": "daf0dd781bf403f7c1bb668925caa64d", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.lang.reflect.Array;\nimport java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner input = new Scanner(System.in);\n int n = input.nextInt();\n int count = 0;\n HashMap<Integer,Integer> home = new HashMap<>();\n HashMap<Integer,Integer> guest= new HashMap<>();\n while (n > 0){\n int j = input.nextInt();\n int k = input.nextInt();\n home.put(j, home.getOrDefault(j, 0) + 1);\n guest.put(k, guest.getOrDefault(k, 0) + 1);\n n--;\n }\n for (Map.Entry<Integer,Integer> entry: home.entrySet()){\n count += entry.getValue() * guest.getOrDefault(entry.getKey(), 0);\n }\n\n\n System.out.println(count);\n input.close();\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force"], "code_uid": "846db46e416f29e7c59af18f69d17bd8", "src_uid": "745f81dcb4f23254bf6602f9f389771b", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class A\n{\n\n\tFastScanner in;\n\tPrintWriter out;\n\tint i = 0, j = 0;\n\n\n\tvoid solve() {\n\t\t/**************START**************/\n\t\tint sol1 = 0, sol2 = 0, sol3 = 0;\n\t\tint n = in.nextInt();\n\t\tint min1 = in.nextInt(), max1 = in.nextInt(), min2 = in.nextInt(), max2 = in.nextInt(), min3 = in.nextInt(), max3 = in.nextInt();\n\t\tn -= (min1+min2+min3);\n\t\tmax1 -= min1;\n\t\tmax2 -= min2;\n\t\tmax3 -= min3;\n\t\tif (max1 >= n)\n\t\t{\n\t\t\tsol1 = min1+n;\n\t\t\tsol2 = min2;\n\t\t\tsol3 = min3;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tsol1 = min1 + max1;\n\t\t\tn -= max1;\n\t\t\tif (max2 >= n)\n\t\t\t{\n\t\t\t\tsol2 = min2 + n;\n\t\t\t\tsol3 = min3;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tsol2 = min2 + max2;\n\t\t\t\tn -= max2;\n\t\t\t\tif (max3 >= n)\n\t\t\t\t{\n\t\t\t\t\tsol3 = min3 + n;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tsol3 = min3 + max3;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tout.println(sol1 + \" \" + sol2 + \" \" + sol3);\n\n\n\n\n\n\n\n\n\n\n\n\t\t/***************END***************/\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew A().runIO();\n\t}\n\n\tvoid runIO() {\n\t\tin = new FastScanner(System.in);\n\t\tout = new PrintWriter(System.out);\n\n\t\tsolve();\n\n\t\tout.close();\n\t}\n\n\tclass FastScanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tpublic FastScanner(File f) {\n\t\t\ttry {\n\t\t\t\tbr = new BufferedReader(new FileReader(f));\n\t\t\t} catch (FileNotFoundException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\n\t\tpublic FastScanner(InputStream f) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(f));\n\t\t}\n\n\t\tString next() {\n\t\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\t\tString s = null;\n\t\t\t\ttry {\n\t\t\t\t\ts = br.readLine();\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t\tif (s == null)\n\t\t\t\t\treturn null;\n\t\t\t\tst = new StringTokenizer(s);\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tboolean hasMoreTokens() {\n\t\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\t\tString s = null;\n\t\t\t\ttry {\n\t\t\t\t\ts = br.readLine();\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t\tif (s == null)\n\t\t\t\t\treturn false;\n\t\t\t\tst = new StringTokenizer(s);\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "greedy", "implementation"], "code_uid": "40df89c20da4fde1964472169b27073f", "src_uid": "3cd092b6507079518cf206deab21cf97", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/**\n * Created by Rukshar Alam on 10/12/2019.\n */\n\nimport java.util.*;\npublic class Coins1061A {\n public static void main(String[] args) {\n\n Scanner input = new Scanner(System.in);\n int n = input.nextInt();int s = input.nextInt();\n\n if(s<=n){\n System.out.println(\"1\");\n }\n else{\n int coins = s/n;\n if(s%n != 0)\n coins += 1;\n System.out.println(coins);\n }\n\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "greedy", "implementation"], "code_uid": "fc4b378772a90de53fca0896e63f3176", "src_uid": "04c067326ec897091c3dbcf4d134df96", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import javax.sound.midi.SysexMessage;\nimport java.util.Scanner;\n\npublic class Solution {\n public static void main ( String [] args ){\n Scanner s = new Scanner(System.in);\n int i=0,j=0;\n char[][] matrix = new char[4][4];\n for( i = 0 ;i < 4 ; i++){\n String ip = s.nextLine();\n for( j = 0 ; j < 4 ; j++){\n matrix[i][j]= ip.charAt(j);\n }\n }\n boolean ans=false;\n for( i = 0; i < 3 ; i++){\n int count=0;\n for(j=0;j<3;j++){\n count=0;\n if(matrix[i][j]=='#'){\n count+=1;\n }\n if(matrix[i][j+1]=='#'){\n count+=1;\n }\n if(matrix[i+1][j]=='#'){\n count+=1;\n }\n if(matrix[i+1][j+1]=='#'){\n count+=1;\n }\n if(count>=3){\n ans=true;\n break;\n }\n else{\n count=0;\n if(matrix[i][j]=='.'){\n count+=1;\n }\n if(matrix[i][j+1]=='.'){\n count+=1;\n }\n if(matrix[i+1][j]=='.'){\n count+=1;\n }\n if(matrix[i+1][j+1]=='.'){\n count+=1;\n }\n if(count>=3){\n ans=true;\n break;\n }\n }\n }\n }\n if(ans == true){\n System.out.println(\"YES\");\n }\n else {\n System.out.println(\"NO\");\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "928d63dee93693cf8bf8aca4fc8c65bd", "src_uid": "01b145e798bbdf0ca2ecc383676d79f3", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n\npublic class Moda {\n\n public static long abs(long a) {\n if(a < 0) a = -a;\n return a;\n }\n\n public static void main(String[] args) throws Exception {\n Scanner sc = new Scanner(System.in);\n long x = sc.nextLong();\n x %= 360;\n x = -x;\n if(x < 0)\n x += 360;\n int best = 360, k = -1;\n if (Math.min(x, 360 - x) < best) {\n best = (int) Math.min(x, 360 - x);\n k = 0;\n }\n for (int i = 1; i <= 3; ++i) {\n x += 90;\n x %= 360;\n if(Math.min(x, 360 - x) < best) {\n best = (int) Math.min(x, 360 - x);\n k = i;\n }\n }\n System.out.printf(\"%d\\n\", k);\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "geometry"], "code_uid": "c2f145acbefa9b8c2ef244ad6147ef4f", "src_uid": "509db9cb6156b692557ba874a09f150e", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\nimport java.io.*;\npublic class sol\n{\n public static void main(String[] args)\n {\n Scanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint k = sc.nextInt();\n\t\tint put=1,totalcandies=0,count=0;\n\t\twhile(n-->0)\n\t\t{\n\t\t if(totalcandies>k)\n\t\t {\n\t\t totalcandies--;count++;\n\t\t }\n\t\t else\n\t\t {\n\t\t totalcandies += put;\n\t\t put++;\n\t\t }\n\t\t}\n\t\tSystem.out.println(count);\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "binary search"], "code_uid": "d0a29d98c535fbae8907dceed59b5ca5", "src_uid": "17b5ec1c6263ef63c668c2b903db1d77", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "\n import java.util.Scanner;\n\npublic class football {\n\tpublic static String buscar(String n){\n\t\tString u=\"1111111\";\n\t\tString c=\"0000000\";\n\t\tfor (int i = 0; i < n.length()-6; i++) {\n\t\t\tString temp=n.substring(i, i+7);\n\t\t\tif(temp.equals(u)||temp.equals(c))\n\t\t\t\treturn \"YES\";\n\t\t}\n\t\treturn \"NO\";\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner (System.in);\n\t\tString n=sc.next();\n\t\tSystem.out.println(buscar(n));\n\t}\n}", "lang_cluster": "Java", "tags": ["strings", "implementation"], "code_uid": "84c74c8ac1989ff49baaa8dc4eda2eaa", "src_uid": "ed9a763362abc6ed40356731f1036b38", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n/**\n *\n * @author Bug\n */\npublic class PS {\n\n /**\n * @param args the command line arguments\n */\n public static void main(String[] args) {\n // TODO code application logic here\n int a;\n Scanner scn = new Scanner (System.in);\n a = scn.nextInt();\n \n if (a>2 && a< 101 && (a%2) ==0) {\n System.out.println(\"YES\");\n \n }else{\n System.out.println(\"NO\");\n }\n }\n \n}\n", "lang_cluster": "Java", "tags": ["brute force", "math"], "code_uid": "004db2ab59b40eb1f15c16b360447afe", "src_uid": "230a3c4d7090401e5fa3c6b9d994cdf2", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class Main {\n\t\tpublic static void main(String[] args)\n\t\t{\n\t\t\tint ans=0,K;boolean flag=false;\n\t\t\tint i,temp,j,k,L;String s;\n\t\t\tScanner cin =new Scanner(System.in);\n\t\t\ts=cin.nextLine();\n\t\t\tK=cin.nextInt();\n\t\t\tfor(i=1;i<=K;i++)\n\t\t\t\ts+='*';\n\t\t\tfor(i=0;i<s.length();i++)\n\t\t\t\tfor(j=i;j<s.length();j++)\n\t\t\t\t{\n\t\t\t\t\tif((j-i)%2==0)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\ttemp=i+j;flag=false;\n\t\t\t\t\tL=(j-i+1)/2;\n\t\t\t\t\tfor(k=i;k<=temp/2;k++)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(s.charAt(k)==s.charAt(k+L)||s.charAt(k)=='*'||s.charAt(k+L)=='*')\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\tflag=true;break;\n\t\t\t\t\t}\n\t\t\t\t\tif(flag==false)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(j-i+1>ans)\n\t\t\t\t\t\t\tans=j-i+1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tSystem.out.printf(\"%d\\n\",ans);\n\t\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "strings", "implementation"], "code_uid": "80bb04ae832e6a9dca8bd68cd5d9dccf", "src_uid": "bb65667b65ff069a9c0c9e8fe31da8ab", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class CF_919_B_PERFECT_NUMBER {\n\t\n\tstatic boolean isPerfect(int x)\n\t{\n\t\tint sum = 0;\n\t\tint temp = x;\n\t\twhile(temp!=0)\n\t\t{\n\t\t\tsum+= temp%10;\n\t\t\ttemp/=10;\n\t\t}\n\t\t\n\t\treturn sum == 10;\n\t}\n\n\tpublic static void main(String[] args) throws Exception{\n\t\tScanner sc = new Scanner(System.in);\n\t\tint k = sc.nextInt();\n\t\tint i = 0;\n\t\tint num = 18;\n\t\twhile(i<k)\n\t\t{\n\t\t\tnum++;\n\t\t\tif(isPerfect(num))\n\t\t\t\ti++;\n\t\t\t\n\t\t\t\n\t\t}\n\t\tSystem.out.println(num);\n\t\t\n\n\t}\n\t\n\tstatic class Scanner {\n\t\tBufferedReader bf;\n\t\tStringTokenizer st;\n\n\t\tpublic Scanner(InputStream i) {\n\t\t\tbf = new BufferedReader(new InputStreamReader(i));\n\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\twhile (st == null || !st.hasMoreTokens())\n\t\t\t\tst = new StringTokenizer(bf.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() throws NumberFormatException, IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic double nextDouble() throws IOException {\n\t\t\tString x = next();\n\t\t\tStringBuilder sb = new StringBuilder(\"0\");\n\t\t\tdouble res = 0, f = 1;\n\t\t\tboolean dec = false, neg = false;\n\t\t\tint start = 0;\n\t\t\tif (x.charAt(0) == '-') {\n\t\t\t\tneg = true;\n\t\t\t\tstart++;\n\t\t\t}\n\t\t\tfor (int i = start; i < x.length(); i++)\n\t\t\t\tif (x.charAt(i) == '.') {\n\t\t\t\t\tres = Long.parseLong(sb.toString());\n\t\t\t\t\tsb = new StringBuilder(\"0\");\n\t\t\t\t\tdec = true;\n\t\t\t\t} else {\n\t\t\t\t\tsb.append(x.charAt(i));\n\t\t\t\t\tif (dec)\n\t\t\t\t\t\tf *= 10;\n\t\t\t\t}\n\t\t\tres += Long.parseLong(sb.toString()) / f;\n\t\t\treturn res * (neg ? -1 : 1);\n\t\t}\n\n\t\tpublic long nextLong() throws NumberFormatException, IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["brute force", "dp", "binary search", "implementation", "number theory"], "code_uid": "4aa8f19bb4fa8729c70a008ebb5b8afe", "src_uid": "0a98a6a15e553ce11cb468d3330fc86a", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "\nimport java.util.Scanner;\n\n/**\n *\n * @author 1\n */\npublic class JavaApplication14 {\n\n /**\n * @param args the command line arguments\n */\n \n public static void main(String[] args) throws Exception{ \n new JavaApplication14().run();\n }\n public class Calc implements Runnable{\n public Calc (int x, int y){\n this.x = x;\n this.y = y;\n }\n public void run(){\n try{\n Thread.sleep(10);\n }catch(Exception e){}\n boolean flag;\n int res = 0;\n for(int i=x; i<y; i++){\n flag = true;\n for(int j=2; j*j<=i; j++){\n if(i%j == 0){\n flag = false;\n break;\n }\n }\n if(flag){\n res = i;\n }\n }\n }\n public int x;\n public int y;\n }\n \n void run(){\n int n,m,a;\n Scanner in = new Scanner(System.in);\n n=in.nextInt();\n m=in.nextInt();\n a=in.nextInt();\n n = n/a+((n%a>0)?1:0);\n m = m/a+((m%a>0)?1:0);\n System.out.println(((long)n)*((long)m));\n n = 8;\n m = 3000000/n;\n Calc cl[] = new Calc[n];\n Thread t[] = new Thread[n];\n for(int i=0; i<n; i++){\n cl[i] = new Calc(i*m, (i+1)*m);\n t[i] = new Thread(cl[i]);\n }\n for(int i=0; i<n; i++){\n t[i].start();\n }\n try{\n Thread.sleep(1200);\n }catch(Exception e){}\n boolean flag = true;\n while(flag){\n flag = false;\n for(int i=0; i<n; i++){\n if(t[i].getState() != Thread.State.TERMINATED){\n flag = true;\n try{\n Thread.sleep(30);\n }catch(Exception e){}\n break;\n }\n }\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "123b9f6d407446612de8ce8d125cf77a", "src_uid": "ef971874d8c4da37581336284b688517", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "/*\n * To change this template, choose Tools | Templates\n * and open the template in the editor.\n */\n\n\nimport java.util.*;\nimport java.math.*;\nimport java.io.*;\nimport java.lang.*;\n\npublic class Main {\n\n BufferedReader reader;\n StringTokenizer token;\n\n int boy;\n int girl;\n int pick;\n\n BigInteger[] bg = new BigInteger[32];\n public static void main(String[] args) throws IOException {\n Main ob = new Main();\n ob.run();\n System.exit(0);\n }\n\n public void run() throws IOException {\n reader = new BufferedReader(new InputStreamReader(System.in));\n token = new StringTokenizer(\"\");\n gen();\n boy = nextInt();\n girl = nextInt();\n pick = nextInt();\n\n //System.out.println(\"IN : \"+boy+\" \"+girl+\" \"+pick);\n BigInteger retval = BigInteger.ZERO;\n\n for(int nb=4; nb<=boy;++nb ){\n int ng = pick-nb;\n if( ng>=1 && ng <= girl){\n BigInteger tmp = NcR(boy,nb).multiply( NcR(girl,ng) );\n //System.out.println(nb+\" \"+tmp);\n retval = retval.add(tmp);\n }\n }\n\n \n System.out.println(retval);\n\n }\n public BigInteger NcR(int N, int R){\n BigInteger up = bg[N];\n BigInteger dn = bg[R].multiply( bg[N-R] );\n return up.divide(dn);\n }\n\n public void gen() throws IOException{\n bg[0] = BigInteger.ONE;\n for(int i=1;i<=30;++i){\n bg[i] = bg[i-1].multiply( BigInteger.valueOf( (long)i) );\n }\n }\n\n\n int nextInt() throws IOException{\n return Integer.parseInt( nextToken() );\n }\n\n String nextToken() throws IOException {\n while (token == null || !token.hasMoreTokens()) {\n String line = reader.readLine();\n token = new StringTokenizer(line);\n }\n return token.nextToken();\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "combinatorics"], "code_uid": "5421149c6e53326b2be974e995310730", "src_uid": "489e69c7a2fba5fac34e89d7388ed4b8", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\n\npublic class C {\n\tprivate static Scanner in;\n\t\n\tclass State {\n\t\tString s;\n\t\tint c;\n\t\t\n\t\tpublic State(String s, int c) {\n\t\t\tthis.s = s;\n\t\t\tthis.c = c;\n\t\t}\n\n\t\t@Override\n\t\tpublic int hashCode() {\n\t\t\treturn 13 * s.hashCode() + c;\n\t\t}\n\t\t\n\t\t@Override\n\t\tpublic boolean equals(Object obj) {\n\t\t\tState that = (State) obj;\n\t\t\treturn s.equals(that.s) && c == that.c;\n\t\t}\n\t\t\n\t\tboolean isTerminal() {\n\t\t\treturn s.length() == c;\n\t\t}\n\t\t\n\t\tState step(char n) {\n\t\t\tint c1 = c;\n\t\t\tString ss = s + n;\n\t\t\tfor (;;) {\n\t\t\t\tint cbest = c1;\n\t\t\t\tfor (String d : dna) {\n\t\t\t\t\tfor (int i = 0; i <= c1; i++) {\n\t\t\t\t\t\tif (ss.substring(i).startsWith(d)) {\n\t\t\t\t\t\t\tcbest = Math.max(cbest, i + d.length());\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (cbest == c1) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tc1 = cbest;\n\t\t\t}\n\t\t\tloop:\n\t\t\tfor (;;) {\n\t\t\t\tfor (String d : dna) {\n\t\t\t\t\tif (d.startsWith(ss)) {\n\t\t\t\t\t\tbreak loop;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tss = ss.substring(1);\n\t\t\t\tc1--;\n\t\t\t}\n\t\t\tif (c1 < 0) {\n\t\t\t\treturn null;\n\t\t\t}\n\t\t\treturn new State(ss, c1);\n\t\t}\n\t}\n\n\tString[] dna;\n\tHashMap<State, Integer> map = new HashMap<State, Integer>();\n\tint[][] nxt = new int[2000][4];\n\tboolean[] trm = new boolean[2000];\n\tchar[] ns = new char[]{'A', 'C', 'G', 'T'};\n\t\n\tpublic void run() {\n\t\tint n = in.nextInt();\n\t\tint m = in.nextInt();\n\t\tdna = new String[m];\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tdna[i] = in.next();\n\t\t}\n\t\tState s0 = new State(\"\", 0);\n\t\tdfs(s0);\n\t\tint k = map.size();\n\t\tint[][] a = new int[n + 1][k];\n\t\ta[0][0] = 1;\n\t\tfor (int len = 0; len < n; len++) {\n\t\t\tfor (int s = 0; s < k; s++) {\n\t\t\t\tint aa = a[len][s];\n\t\t\t\tif (aa == 0) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tfor (int i = 0; i < 4; i++) {\n\t\t\t\t\tint t = nxt[s][i];\n\t\t\t\t\tif (t < 0) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\ta[len + 1][t] = add(a[len + 1][t], aa);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint ans = 0;\n\t\tfor (int s = 0; s < k; s++) {\n\t\t\tif (trm[s]) {\n\t\t\t\tans = add(ans, a[n][s]);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\n\tfinal int MOD = 1000000009;\n\t\n\tprivate int add(int x, int y) {\n\t\tx += y;\n\t\tif (x >= MOD) {\n\t\t\tx -= MOD;\n\t\t}\n\t\treturn x;\n\t}\n\n\tprivate void dfs(State st) {\n\t\tif (map.containsKey(st)) {\n\t\t\treturn;\n\t\t}\n\t\tint v = map.size();\n\t\tmap.put(st, v);\n\t\ttrm[v] = st.isTerminal();\n\t\tfor (int i = 0; i < 4; i++) {\n\t\t\tState u = st.step(ns[i]);\n\t\t\tif (u == null) {\n\t\t\t\tnxt[v][i] = -1;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tdfs(u);\n\t\t\tnxt[v][i] = map.get(u);\n\t\t}\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tLocale.setDefault(Locale.US);\n\t\tin = new Scanner(System.in);\n\t\tnew C().run();\n\t\tin.close();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["strings", "dp", "trees"], "code_uid": "d0811f8e36e4a30ef6856d77daf84e6f", "src_uid": "3f053c07deaac55c2c51df6147080340", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\npublic final class code\n{\n static boolean lucky(int n)\n {\n while(n>0)\n {\n int d=n%10;\n if(d!=4 && d!=7)\n return false;\n n/=10;\n }\n return true;\n }\n public static void main(String[]args)\n {\n Scanner sc=new Scanner(System.in);\n int n=0;\n if(sc.hasNextInt())\n {\n n=sc.nextInt();\n }\n boolean flag=lucky(n);\n if(!flag)\n {\n for(int i=1;i<n;i++)\n {\n if(lucky(i) && n%i==0 )\n {\n flag=true;\n }\n }\n }\n if(flag)\n System.out.println(\"YES\");\n else\n System.out.println(\"NO\");\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "number theory"], "code_uid": "38e1326687e0929ddad1d1228fc5c18a", "src_uid": "78cf8bc7660dbd0602bf6e499bc6bb0d", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.BufferedWriter;\nimport java.io.FileReader;\nimport java.io.FileWriter;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\nimport java.util.StringTokenizer;\n\npublic class codeForces {\n\tpublic static void main(String [] args) throws Exception{\n\t\tBufferedReader f = new BufferedReader(new InputStreamReader(System.in));\n\t\tint [][] white = new int[64][2];\n\t\tint [][] black = new int[64][2];\n\t\tint countWhite = 0;\n\t\tint countBlack = 0;\n\t\tStringTokenizer st;\n\t\tfor(int x = 1; x <= 8; x++){\n\t\t\tst = new StringTokenizer(f.readLine());\n\t\t\tString tempy = st.nextToken();\n\t\t\tfor(int y = 1; y <=8;y++){\n\t\t\t\tchar temp = tempy.charAt(y - 1);\n\t\t\t\tif(temp == 'W'){\n\t\t\t\t\twhite[countWhite][0] = x;\n\t\t\t\t\twhite[countWhite][1] = y;\n\t\t\t\t\tcountWhite++;\n\t\t\t\t}\n\t\t\t\telse if(temp == 'B'){\n\t\t\t\t\tblack[countBlack][0] = x;\n\t\t\t\t\tblack[countBlack][1] = y;\n\t\t\t\t\tcountBlack++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tboolean go = false;\n\t\tint blackMin = Integer.MAX_VALUE;\n\t\tint whiteMin = Integer.MAX_VALUE;\n\t\tfor(int x = 0; x < countWhite; x++){\n\t\t\tgo = true;\n\t\t\tfor(int y = 0; y < countBlack; y++){\n\t\t\t\tif(white[x][1] == black[y][1] && white[x][0] > black[y][0]){\n\t\t\t\t\tgo = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(go && Math.abs(1 - white[x][0]) < whiteMin)\n\t\t\t\twhiteMin = Math.abs(1 - white[x][0]);\n\t\t}\n\t\tfor(int x = 0; x < countBlack; x++){\n\t\t\tgo = true;\n\t\t\tfor(int y = 0; y < countWhite; y++){\n\t\t\t\tif(black[x][1] == white[y][1] && black[x][0] < white[y][0]){\n\t\t\t\t\tgo = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(go && 8 - black[x][0] < blackMin){\n\t\t\t\tblackMin = 8 - black[x][0];\n\t\t\t}\n\t\t}\n\t\tif(whiteMin == blackMin || whiteMin < blackMin)\n\t\t\tSystem.out.print(\"A\");\n\t\telse\n\t\t\tSystem.out.print(\"B \");\n\t}\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "6b51c8f38fbdd78888eeda10dce6398b", "src_uid": "0ddc839e17dee20e1a954c1289de7fbd", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.*;\nimport java.util.StringTokenizer;\n\npublic class CFC {\n BufferedReader br;\n PrintWriter out;\n StringTokenizer st;\n boolean eof;\n final long MOD = 1000L * 1000L * 1000L + 7;\n\n void solve() throws IOException {\n int n = 24;\n int[] arr = nextIntArr(n);\n int[][] idx = {{1, 3, 5, 7, 9, 11, 22, 24},\n {2, 4, 6, 8, 10, 12, 21, 23},\n {13, 14, 5, 6, 17, 18, 21, 22},\n {15, 16, 7, 8, 19, 20, 23, 24},\n {1, 2, 18, 20, 12, 11, 15, 13},\n {3, 4, 17, 19, 10, 9, 16, 14}};\n\n for (int[] cand : idx) {\n int[] candArr = Arrays.copyOf(cand, cand.length);\n int[] fix = Arrays.copyOf(arr, arr.length);\n\n int[] left = shiftLeft(candArr);\n boolean flag = check(fix, candArr, left);\n if (flag) {\n out(\"YES\");\n return;\n }\n\n int[] right = shiftRight(candArr);\n flag = check(fix, candArr, right);\n if (flag) {\n out(\"YES\");\n return;\n }\n }\n\n out(\"NO\");\n }\n\n boolean check(int[] mat, int[] old, int[] index) {\n// for (int i = 0; i < old.length; i++) {\n// swap(mat, old[i] - 1, index[i] - 1);\n// }\n\n int[] newMat = Arrays.copyOf(mat, mat.length);\n for (int i = 0; i < old.length; i++) {\n newMat[index[i] - 1] = mat[old[i] - 1];\n }\n return isValid(newMat);\n }\n\n int[] shiftRight(int[] ind) {\n int[] res = new int[8];\n for (int i = 2; i < 8; i++) {\n res[i] = ind[i - 2];\n }\n\n res[0] = ind[6];\n res[1] = ind[7];\n return res;\n }\n\n int[] shiftLeft(int[] ind) {\n int[] res = new int[8];\n for (int i = 0; i < 6; i++) {\n res[i] = ind[i + 2];\n }\n res[6] = ind[0];\n res[7] = ind[1];\n return res;\n }\n\n boolean isValid(int[] arr) {\n for (int i = 0; i < 6; i++) {\n int cnt1 = arr[4 * i];\n for (int j = 1; j < 4; j++) {\n if (arr[4 * i + j] != cnt1) {\n return false;\n }\n }\n }\n\n return true;\n }\n\n void swap(int[] arr, int i, int j) {\n int tmp = arr[i];\n arr[i] = arr[j];\n arr[j] = tmp;\n }\n\n void shuffle(int[] a) {\n int n = a.length;\n for(int i = 0; i < n; i++) {\n int r = i + (int) (Math.random() * (n - i));\n int tmp = a[i];\n a[i] = a[r];\n a[r] = tmp;\n }\n }\n private void outln(Object o) {\n out.println(o);\n }\n private void out(Object o) {\n out.print(o);\n }\n public CFC() throws IOException {\n br = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n solve();\n out.close();\n }\n public static void main(String[] args) throws IOException {\n new CFC();\n }\n\n public long[] nextLongArr(int n) throws IOException{\n long[] res = new long[n];\n for(int i = 0; i < n; i++)\n res[i] = nextLong();\n return res;\n }\n public int[] nextIntArr(int n) throws IOException {\n int[] res = new int[n];\n for(int i = 0; i < n; i++)\n res[i] = nextInt();\n return res;\n }\n public String nextToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (Exception e) {\n eof = true;\n return null;\n }\n }\n return st.nextToken();\n }\n public String nextString() {\n try {\n return br.readLine();\n } catch (IOException e) {\n eof = true;\n return null;\n }\n }\n public int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n public long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n public double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "345d70bdaaaae976fc8e083149e8cad3", "src_uid": "881a820aa8184d9553278a0002a3b7c4", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/*\nIf you want to aim high, aim high\nDon't let that studying and grades consume you\nJust live life young\n******************************\nWhat do you think? What do you think?\n1st on Billboard, what do you think of it\nNext is a Grammy, what do you think of it\nHowever you think, I’m sorry, but shit, I have no fcking interest\n*******************************\nI'm standing on top of my Monopoly board\nThat means I'm on top of my game and it don't stop\ntil my hip don't hop anymore\nhttps://www.a2oj.com/Ladder16.html\n*******************************\n300iq as writer = Sad!\n*/\nimport java.util.*;\nimport java.io.*;\nimport java.math.*;\n\n public class x1174E\n {\n static long MOD = 1000000007L;\n public static void main(String hi[]) throws Exception\n {\n BufferedReader infile = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st = new StringTokenizer(infile.readLine());\n int N = Integer.parseInt(st.nextToken());\n long[][] dp = new long[20][2];\n base(dp, N);\n cnt = new long[20][2];\n for(int curr=0; (1<<curr) <= N; curr++)\n for(int b=1; b <= 3; b+=2)\n {\n int temp = (1<<curr)*b;\n cnt[curr][Math.max(b-2, 0)] = N/temp;\n }\n //iterative sad\n for(int i=2; i <= N; i++)\n {\n long[][] newdp = new long[20][2];\n for(int a=19; a >= 0; a--)\n for(int b=1; b >= 0; b--)\n {\n long res = 0L;\n if(cnt[a][b]-i >= 0)\n res = (dp[a][b]*(cnt[a][b]-i+1+MOD))%MOD;\n if(a+1 < 20)\n {\n res += (dp[a+1][b]*(cnt[a][b]-cnt[a+1][b]))%MOD;\n if(res >= MOD)\n res -= MOD;\n }\n if(b == 0)\n {\n res += (dp[a][1]*(cnt[a][0]-cnt[a][1]))%MOD;\n if(res >= MOD)\n res -= MOD;\n }\n newdp[a][b] = res;\n }\n dp = newdp;\n }\n System.out.println(dp[0][0]);\n }\n static long[][] cnt;\n public static void base(long[][] dp, int N)\n {\n int curr = 1;\n while((1<<curr) <= N)\n curr++;\n curr--;\n dp[curr][0] = 1L;\n int oth = 1<<(curr-1);\n oth *= 3;\n if(oth <= N)\n dp[curr-1][1] = 1L;\n }\n }", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics", "number theory"], "code_uid": "a412e8bf1e37cd3d74d78f106bfcdf8f", "src_uid": "b2d59b1279d891dba9372a52364bced2", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\n/**\n * @author Don Li\n */\npublic class Splits {\n void solve() {\n int n = in.nextInt();\n out.println((n >> 1) + 1);\n }\n \n public static void main(String[] args) {\n in = new FastScanner(new BufferedReader(new InputStreamReader(System.in)));\n out = new PrintWriter(System.out);\n new Splits().solve();\n out.close();\n }\n \n static FastScanner in;\n static PrintWriter out;\n \n static class FastScanner {\n BufferedReader in;\n StringTokenizer st;\n \n public FastScanner(BufferedReader in) {\n this.in = in;\n }\n \n public String nextToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(in.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n \n public int nextInt() {\n return Integer.parseInt(nextToken());\n }\n \n public long nextLong() {\n return Long.parseLong(nextToken());\n }\n \n public double nextDouble() {\n return Double.parseDouble(nextToken());\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "63f795c8206464583814573f1deeafcb", "src_uid": "5551742f6ab39fdac3930d866f439e3e", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner s = new Scanner(System.in);\n int a = s.nextInt();\n int b = s.nextInt();\n int t = a;\n while (a >= b) { int r = a % b; a = a / b; t += a; a += r; }\n System.out.println(t);\n }\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "b42fc5b3a5c0b7e12f0e0ac0f4b1b829", "src_uid": "a349094584d3fdc6b61e39bffe96dece", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class A {\n public static void solution(BufferedReader reader, PrintWriter out)\n throws IOException {\n In in = new In(reader);\n int a = in.nextInt(), b = in.nextInt(), c = in.nextInt();\n int cnt = 0;\n int n = a - 1;\n for (int i = 0; i < Math.min(b, c); i++) {\n n++;\n cnt += n * 2;\n }\n cnt += n * (Math.abs(b - c) - 1);\n out.println(cnt);\n }\n\n public static void main(String[] args) throws Exception {\n BufferedReader reader = new BufferedReader(new InputStreamReader(\n System.in));\n PrintWriter out = new PrintWriter(new BufferedWriter(\n new OutputStreamWriter(System.out)));\n solution(reader, out);\n out.close();\n }\n\n protected static class In {\n private BufferedReader reader;\n private StringTokenizer tokenizer = new StringTokenizer(\"\");\n\n public In(BufferedReader reader) {\n this.reader = reader;\n }\n\n public String next() throws IOException {\n while (!tokenizer.hasMoreTokens())\n tokenizer = new StringTokenizer(reader.readLine());\n return tokenizer.nextToken();\n }\n\n public int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n\n public long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "3ede8ac3e2640515613c6436af18b87e", "src_uid": "8ab25ed4955d978fe20f6872cb94b0da", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "\nimport java.util.Scanner;\npublic class JavaApplication71 {\n public static void main(String[] args) {\n //helpful mathe\n Scanner input =new Scanner(System.in);\n String s=input.next();\n int c1=0 ;int c2=0 ;int c3=0;\n String result=\"\";\n for(int i=0;i<s.length();i++){\n if(s.charAt(i)=='1'){\n c1++;\n }else if(s.charAt(i)=='2'){\n c2++;\n }else if(s.charAt(i)=='3'){\n c3++;\n }\n }\n for(int j=0;j<c1;j++){\n result=result+\"1+\";\n }\n for(int j=0;j<c2;j++){\n result=result+\"2+\";\n }\n for(int j=0;j<c3;j++){\n result=result+\"3+\";\n }\n result=result.substring(0, s.length());\n System.out.println(result);\n \n }\n}\n", "lang_cluster": "Java", "tags": ["sortings", "strings", "implementation", "greedy"], "code_uid": "0adb9483e415077e52179e76c3019740", "src_uid": "76c7312733ef9d8278521cf09d3ccbc8", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.lang.*;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\n/**\n *\n * @author Mido\n */\npublic class Test {\n\n /**\n * @param args the command\n */\n public static int weight(char c)\n {\n c=Character.toLowerCase(c);\n switch(c)\n {\n case 'q': return 9;\n case 'r': return 5;\n case 'b': return 3;\n case 'n': return 3;\n case 'p': return 1;\n case 'k':\n break;\n }\n return 0;\n }\n public static void main(String[] args) {\n int j,i,w,b;\n String ans;\n char c;\n String []a=new String[8];\n Scanner sc=new Scanner(System.in);\n w=b=0;\n for(i=0;i<8;i++) a[i]=sc.next();\n for(i=0;i<8;i++) \n {\n for(j=0;j<8;j++) \n {\n c=a[i].charAt(j);\n \n if(c!='.')\n {\n if(c>='a'&&c<='z')b+=weight(c);\n else w+=weight(c);\n }\n }\n }\n if(w>b)System.out.println(\"White\");\n else if(w<b)System.out.println(\"Black\");\n else System.out.println(\"Draw\");\n } \n\n \n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "824d21bb9f1105922324d6f8ad752cd6", "src_uid": "44bed0ca7a8fb42fb72c1584d39a4442", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\n/**\n * https://codeforces.com/contest/1081/problem/A\n *\n */\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner s = new Scanner(System.in);\n\t\tlong n = Long.parseLong(s.nextLine());\n\t\tlong x = n - 1;\n\t\twhile (true) {\n\t\t\tif (n < 2 || x < 2) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (n % x != 0) {\n\t\t\t\tn -= x;\n\t\t\t}\n\t\t\tx--;\n\t\t}\n\t\tSystem.out.println(n);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "constructive algorithms"], "code_uid": "3ed07410e54a8283842e6a5fb6f82755", "src_uid": "c30b372a9cc0df4948dca48ef4c5d80d", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\npublic class Q1064A\n{\n public static void main(String[] args)\n {\n int a[],max=0;\n Scanner sc=new Scanner(System.in);\n a=new int[3]; \n for(int i=0;i<3;i++)\n {\n a[i]=sc.nextInt();\n }\n for(int i=0;i<2;i++)\n {\n if(a[i]>a[i+1])\n {\n max=a[i+1];\n a[i+1]=a[i];\n a[i]=max;\n }\n }\n if(a[2]<(a[1]+a[0]))\n {\n System.out.println(0);\n }\n else\n {\n System.out.println((a[2]-(a[1]+a[0])+1));\n }\n sc.close();\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "geometry"], "code_uid": "fe3996f1655bbac3f6f0a01786139721", "src_uid": "3dc56bc08606a39dd9ca40a43c452f09", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class Main{\n \n public static void main(String args[])\n { \n Scanner sc=new Scanner(System.in);\n int n=sc.nextInt();\n HashMap<Integer,Integer> mp=new HashMap<Integer,Integer>();\n while(mp.get(n)==null)\n { \n mp.put(n, 1);\n n=n+1;\n while(n%10==0) n/=10;\n }\n System.out.println(mp.size()) ;\n \n\n\n }\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "ad81ca3035a6d3241a4a470ccac070e9", "src_uid": "055fbbde4b9ffd4473e6e716da6da899", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.IOException;\nimport java.io.OutputStreamWriter;\nimport java.io.BufferedWriter;\nimport java.util.InputMismatchException;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.Writer;\nimport java.math.BigInteger;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n TaskB2 solver = new TaskB2();\n solver.solve(1, in, out);\n out.close();\n }\n}\n\nclass TaskB2 {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n = in.readInt();\n int m = in.readInt();\n\n int[] dp = new int[n + 1];\n dp[0] = dp[1] = 1;\n\n for (int i = 2; i <= n; i++) {\n for (int j = 0; j < i; j++) {\n dp[i] += dp[j];\n }\n }\n\n int[] a = new int[n];\n boolean[] used = new boolean[n + 1];\n\n int add = 0;\n int last = 0;\n for (int i = 0; i < n; i++) {\n for (int j = last + 1; j <= n; j++) {\n if(used[j]) continue;\n\n int grt = 0;\n for (int k = j + 1; k <= n; k++) {\n if (!used[k]) grt++;\n }\n if (add + dp[grt] >= m) {\n a[i] = j;\n used[j] = true;\n last = j;\n break;\n } else {\n add += dp[grt];\n }\n }\n }\n\n for (int i = n - 1; i >= 0; i--) {\n if (a[i] == 0) {\n for (int j = 1; j <= n; j++) {\n if (!used[j]) {\n a[i] = j;\n used[j] = true;\n break;\n }\n }\n }\n }\n\n for (int i = 0; i < n; i++) {\n out.print(a[i] + \" \");\n }\n }\n}\n\nclass InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n}\n\nclass OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public void print(Object...objects) {\n for (int i = 0; i < objects.length; i++) {\n if (i != 0)\n writer.print(' ');\n writer.print(objects[i]);\n }\n }\n\n public void close() {\n writer.close();\n }\n\n}\n\n", "lang_cluster": "Java", "tags": ["brute force"], "code_uid": "9e0db1daf4eb33a79b10da3e1f32edad", "src_uid": "a8da7cbd9ddaec8e0468c6cce884e7a2", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.StringTokenizer;\n\n/**\n * Created by Alvin on 5/24/2016.\n */\n\npublic class Codeforces_round_335_div_2_MagicSpheres {\n public static void main(String[] args) {\n FScanner input = new FScanner();\n out = new PrintWriter(new BufferedOutputStream(System.out), true);\n int a = input.nextInt();\n int b = input.nextInt();\n int c = input.nextInt();\n int x = input.nextInt();\n int y = input.nextInt();\n int z = input.nextInt();\n int remainBalls = 0;\n if(a - x > 0) {\n remainBalls += (a - x) / 2;\n }\n\n if(b - y > 0) {\n remainBalls += (b - y) / 2;\n }\n if(c - z > 0) {\n remainBalls += (c - z) / 2;\n }\n if(a < x) {\n remainBalls -= (x - a);\n }\n if(b < y) {\n remainBalls -= (y - b);\n }\n if(c < z) {\n remainBalls -= (z - c);\n }\n if(remainBalls >= 0) {\n out.println(\"Yes\");\n } else {\n out.println(\"No\");\n }\n out.close();\n }\n\n public static PrintWriter out;\n\n public static class FScanner {\n BufferedReader br;\n StringTokenizer st;\n\n public FScanner() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n private String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "c4660c9f9b34b2f9be8953fb0ef2f6a7", "src_uid": "1db4ba9dc1000e26532bb73336cf12c3", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.lang.*;\npublic class Main{\n public static void main(String[] args){\n Scanner sc=new Scanner(System.in);\n long n=sc.nextLong();\n int k=sc.nextInt();\n int i=0;\n while(i!=k){\n if(n%10==0){\n while(n%10==0&&i!=k){\n n=n/10;\n i=i+1;\n }\n }\n else{\n while(n%10!=0&&n>0&&i!=k){\n n=n-1;\n i=i+1;\n }\n }\n }\n System.out.println(n);\n }\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "139485ae768e8a132fcce0388c523384", "src_uid": "064162604284ce252b88050b4174ba55", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class RaceTime2 {\n\tpublic static boolean clock (int h, int m, int s, int t1, int t2) {\n\t\tint t1_s = t1 * 5;\n\t\tif (t1_s >= 60)\n\t\t\tt1_s -= 60;\n\t\tboolean solution_s = false;\n\t\tint t2_s = t2 * 5;\n\t\tif (t2_s >= 60)\n\t\t\tt2_s -= 60;\n\t\twhile (t1_s != s) {\n\t\t\tif (t1_s == t2_s) {\n\t\t\t\tsolution_s = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tt1_s++;\n\t\t\tif (t1_s > 59)\n\t\t\t\tt1_s -= 60;\n\t\t}\n\t\tif (!solution_s)\n\t\t\treturn false;\n\n\t\tdouble t1_m = (double)t1 * (double)5;\n\t\tif (t1_m >= 60)\n\t\t\tt1_m -= 60;\n\t\tdouble m1 = (double)m;\n\t\tboolean solution_m = false;\n\t\tif (s > 0)\n\t\t\tm1 += 0.5;\n\t\tif (m1 >= 60)\n\t\t\tm1 -= 60;\n\t\tdouble t2_m = (double)t2 * (double)5;\n\t\tif (t2_m >= 60)\n\t\t\tt2_m -= 60;\n\t\twhile (t1_m != (double)m1) {\n\t\t\tif (t1_m == t2_m) {\n\t\t\t\tsolution_m = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tt1_m += 0.5;\n\t\t\tif (t1_m >= 60)\n\t\t\t\tt1_m -= 60;\n\t\t}\n\t\tif (!solution_m)\n\t\t\treturn false;\n\n\t\tdouble t1_h = (double)t1;\n\t\tdouble h1 = (double)h;\n boolean solution_h = false;\n if (m > 0 || s > 0)\n h1 += 0.5;\n\t\tif (h1 > 12)\n\t\t\th1 -= 12;\n while (t1_h != (double)h1) {\n if (t1_h == (double)t2) {\n solution_h = true;\n break;\n }\n t1_h += 0.5;\n if (t1_h > 12)\n t1_h -= 12;\n }\n if (!solution_h)\n return false;\n\t\treturn true;\n\t}\n\n\tpublic static boolean anti (int h, int m, int s, int t1, int t2) {\n int t1_s = t1 * 5;\n\t\tif (t1_s >= 60)\n\t\t\tt1_s -= 60;\n boolean solution_s = false;\n\t\tint t2_s = t2 * 5;\n\t\tif (t2_s >= 60)\n\t\t\tt2_s -= 60;\n while (t1_s != s) {\n if (t1_s == t2_s) {\n solution_s = true;\n break;\n }\n t1_s--;\n if (t1_s < 0)\n t1_s += 60;\n }\n if (!solution_s)\n return false;\n\n double t1_m = (double)t1 * (double)5;\n\t\tif (t1_m >= 60)\n\t\t\tt1_m -= 60;\n double m1 = (double)m;\n boolean solution_m = false;\n if (s > 0)\n m1 += 0.5;\n if (m1 >= 60)\n m1 -= 60;\n\t\tdouble t2_m = (double)t2 * (double)5;\n\t\tif (t2_m >= 60)\n\t\t\tt2_m -= 60;\n while (t1_m != (double)m1) {\n if (t1_m == t2_m) {\n solution_m = true;\n break;\n }\n t1_m -= 0.5;\n if (t1_m < 0)\n t1_m += 60;\n }\n if (!solution_m)\n return false;\n\n double t1_h = (double)t1;\n double h1 = (double)h;\n boolean solution_h = false;\n if (m > 0 || s > 0)\n h1 += 0.5;\n if (h1 > 12)\n h1 -= 12;\n while (t1_h != (double)h1) {\n if (t1_h == (double)t2) {\n\t solution_h = true;\n break;\n }\n t1_h -= 0.5;\n if (t1_h < 0.5)\n t1_h += 12;\n }\n if (!solution_h)\n return false;\n return true;\n }\n\n\tpublic static void main (String[] args) throws Exception {\n\t\tScanner sc = new Scanner (System.in);\n\t\tint h = sc.nextInt();\n\t\tint m = sc.nextInt();\n\t\tint s = sc.nextInt();\n\t\tint t1 = sc.nextInt();\n\t\tint t2 = sc.nextInt();\n\t\tif (clock (h, m, s, t1, t2) || anti (h, m, s, t1, t2)) {\n\t\t\tSystem.out.println (\"YES\");\n\t\t} else System.out.println (\"NO\");\n\t}\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "121d9a9b98001b7c0f37ddd0046677ad", "src_uid": "912c8f557a976bdedda728ba9f916c95", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n int k, c = 0, sum = 0, summ = 0;\n int[] A = new int[12];\n\n Scanner s = new Scanner(System.in);\n k = s.nextInt();\n s.nextLine();\n for (int i = 0; i < 12; i++) {\n A[i] = s.nextInt();\n }\n Arrays.sort(A);\n for (int x : A) {\n summ += x;\n }\n if (summ < k)\n System.out.println(-1);\n else {\n for (int i = 11; i >= 0; i--) {\n if (sum < k) {\n sum += A[i];\n c++;\n if(sum==k)\n {\n System.out.println(c);\n break;\n }\n } else {\n System.out.println(c);\n break;\n }\n }\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["sortings", "implementation", "greedy"], "code_uid": "3f8ea20ce0d65f8829ce13ab11e8a6f4", "src_uid": "59dfa7a4988375febc5dccc27aca90a8", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.lang.*;\nimport java.io.*;\n\n/* Name of the class has to be \"Main\" only if the class is public. */\n public class Codechef\n{\n\tpublic static void main (String[] args) throws java.lang.Exception\n\t{\n\t\t// your code goes here\n\t\tScanner s =new Scanner(System.in);\n\t\tint w1=s.nextInt();\n\t\tint h1=s.nextInt();\n\t\tint w2=s.nextInt();\n\t\tint h2=s.nextInt();\n\t\tint count=w1*2+(h1+h2)*2+4;\n\t\tSystem.out.println(count);\n\t}\n}", "lang_cluster": "Java", "tags": ["math"], "code_uid": "828bb373f549a7d538c2b7efcdadd5ba", "src_uid": "b5d44e0041053c996938aadd1b3865f6", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.lang.*;\nimport java.util.stream.*;\nimport java.util.stream.Collectors.*;\n\nimport static java.util.stream.Collectors.*;\n\npublic class codeforces {\n public static void main(String[] args) throws Exception {\n try {\n InputStreamReader isr = new InputStreamReader(System.in);\n BufferedReader br = new BufferedReader(isr); \n int len=Integer.parseInt(br.readLine());\n String inp=br.readLine();\n int count=0;\n StringBuffer naya = new StringBuffer(inp);\n while(naya.indexOf(\"xxx\")!=-1){\n int ndx=naya.indexOf(\"xxx\");\n naya.deleteCharAt(ndx);\n count++;\n }\n System.out.println(count);\n } catch (Exception e) {\n e.printStackTrace();\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["greedy", "strings"], "code_uid": "5edf86492908ea8592191bf4d74fb250", "src_uid": "8de14db41d0acee116bd5d8079cb2b02", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class PlateGame {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int a = in.nextInt();\n int b = in.nextInt();\n int r = in.nextInt();\n if (Math.min(a, b) < 2 * r) {\n System.out.println(\"Second\");\n } else {\n System.out.println(\"First\");\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "constructive algorithms", "games"], "code_uid": "b5bd4d802c2a55d2348a15bec5bc9e0a", "src_uid": "90b9ef939a13cf29715bc5bce26c9896", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Arrays;\nimport java.util.Scanner;\npublic class JavaApplication18 {\npublic static void main(String[] args) {\nScanner sc = new Scanner(System.in);\ndouble r=sc.nextInt();\ndouble x=sc.nextInt();\ndouble y=sc.nextInt();\ndouble x1=sc.nextInt();\ndouble y1=sc.nextInt();\n\n x=Math.abs(x-x1);\n y=Math.abs(y-y1);\ndouble ans=Math.sqrt((x*x+y*y))/(2*r);\n\nSystem.out.println((int)Math.ceil((ans)));\n\n\n}\n\n}\n", "lang_cluster": "Java", "tags": ["math", "geometry"], "code_uid": "c0a29632026d28615de3b9719d6905bc", "src_uid": "698da80c7d24252b57cca4e4f0ca7031", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Mainn {\n\tFastReader scn;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\n\tvoid solve() {\n\t\tint x = scn.nextInt(), y = scn.nextInt(), mod = (int) 1e9 + 7;\n\t\tif (y % x != 0) {\n\t\t\tout.println(0);\n\t\t\treturn;\n\t\t}\n\t\tint k = y / x;\n\n\t\tHashMap<Integer, Long> map = new HashMap<>();\n\t\tmap.put(1, 1L);\n\n\t\tout.println(func(k, map, mod));\n\t}\n\n\tlong func(int k, HashMap<Integer, Long> map, int mod) {\n\t\tif (map.containsKey(k)) {\n\t\t\treturn map.get(k);\n\t\t}\n\t\tlong rv = 1;\n\t\tfor (int i = 2; i * i <= k; i++) {\n\t\t\tif (k % i != 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\trv += func(i, map, mod);\n\t\t\tif (i * i != k) {\n\t\t\t\trv += func(k / i, map, mod);\n\t\t\t}\n\t\t}\n\t\t\n\t\trv %= mod;\n\t\trv = (power(2, k - 1, mod) - rv + mod) % mod;\n\t\tmap.put(k, rv);\n\n\t\treturn rv;\n\t}\n\n\tlong power(long a, long x, long mod) {\n\t\tif (x == 0) {\n\t\t\treturn 1;\n\t\t}\n\t\tlong p = power(a, x / 2, mod);\n\t\tp *= p;\n\t\tp %= mod;\n\t\tif (x % 2 == 1) {\n\t\t\tp *= a;\n\t\t\tp %= mod;\n\t\t}\n\t\treturn p;\n\t}\n\n\tvoid run() throws Exception {\n\t\tboolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\t\tout = new PrintWriter(System.out);\n\t\tscn = new FastReader(oj);\n\t\tlong time = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\tif (!oj) {\n\t\t\tSystem.out.println(Arrays.deepToString(new Object[] { System.currentTimeMillis() - time + \" ms\" }));\n\t\t}\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tnew Mainn().run();\n\t}\n\n\tclass FastReader {\n\t\tInputStream is;\n\n\t\tpublic FastReader(boolean onlineJudge) {\n\t\t\tis = onlineJudge ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\n\t\t}\n\n\t\tbyte[] inbuf = new byte[1024];\n\t\tpublic int lenbuf = 0, ptrbuf = 0;\n\n\t\tint readByte() {\n\t\t\tif (lenbuf == -1)\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tif (ptrbuf >= lenbuf) {\n\t\t\t\tptrbuf = 0;\n\t\t\t\ttry {\n\t\t\t\t\tlenbuf = is.read(inbuf);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (lenbuf <= 0)\n\t\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn inbuf[ptrbuf++];\n\t\t}\n\n\t\tboolean isSpaceChar(int c) {\n\t\t\treturn !(c >= 33 && c <= 126);\n\t\t}\n\n\t\tint skip() {\n\t\t\tint b;\n\t\t\twhile ((b = readByte()) != -1 && isSpaceChar(b))\n\t\t\t\t;\n\t\t\treturn b;\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tchar nextChar() {\n\t\t\treturn (char) skip();\n\t\t}\n\n\t\tString next() {\n\t\t\tint b = skip();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\twhile (!(isSpaceChar(b))) { // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n\n\t\tchar[] next(int n) {\n\t\t\tchar[] buf = new char[n];\n\t\t\tint b = skip(), p = 0;\n\t\t\twhile (p < n && !(isSpaceChar(b))) {\n\t\t\t\tbuf[p++] = (char) b;\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t\t}\n\n\t\tchar[][] nextMatrix(int n, int m) {\n\t\t\tchar[][] map = new char[n][];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tmap[i] = next(m);\n\t\t\treturn map;\n\t\t}\n\n\t\tint[] nextArray(int n) {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\n\t\tlong[] nextLongArray(int n) {\n\t\t\tlong[] a = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\n\t\tint nextInt() {\n\t\t\tint num = 0, b;\n\t\t\tboolean minus = false;\n\t\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t\t;\n\t\t\tif (b == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tb = readByte();\n\t\t\t}\n\n\t\t\twhile (true) {\n\t\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t\t} else {\n\t\t\t\t\treturn minus ? -num : num;\n\t\t\t\t}\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\tlong num = 0;\n\t\t\tint b;\n\t\t\tboolean minus = false;\n\t\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t\t;\n\t\t\tif (b == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tb = readByte();\n\t\t\t}\n\n\t\t\twhile (true) {\n\t\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t\t} else {\n\t\t\t\t\treturn minus ? -num : num;\n\t\t\t\t}\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t}\n\n\t\tint[] shuffle(int[] arr) {\n\t\t\tRandom r = new Random();\n\t\t\tfor (int i = 1, j; i < arr.length; i++) {\n\t\t\t\tj = r.nextInt(i);\n\t\t\t\tarr[i] = arr[i] ^ arr[j];\n\t\t\t\tarr[j] = arr[i] ^ arr[j];\n\t\t\t\tarr[i] = arr[i] ^ arr[j];\n\t\t\t}\n\t\t\treturn arr;\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics", "bitmasks", "number theory"], "code_uid": "69d5d1cfeab81cd864d9c4578e1a5bfa", "src_uid": "de7731ce03735b962ee033613192f7bc", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.util.*;\npublic class Main{\n public static void main(String []args)throws IOException{\n BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n BufferedWriter bw=new BufferedWriter(new OutputStreamWriter(System.out));\n //int t=Integer.parseInt(br.readLine());\n //while(t-- >0){\n\t\t\t//int n =Integer.parseInt(br.readLine());\n\t\t\tString inp[]=br.readLine().split(\" \");\n\t\t\tint m=Integer.parseInt(inp[0]),s=Integer.parseInt(inp[1]);\n\t\t\tif(s==0 && m==1){\n\t\t\t bw.write(\"0 0\");\n\t\t\t}\n\t\t\telse if(s==0 || s > 9*m){\n\t\t\t bw.write(\"-1 -1\");\n\t\t\t}\n\t\t\telse{\n\t\t\t String max=\"\",min=\"\";\n\t\t\t int temp=s;\n\t\t\t int i=0;\n\t\t\t for(;i<m;i++){\n\t\t\t if(temp>0){\n\t\t\t max+=Integer.toString(Math.min(9,temp));\n\t\t\t temp=temp-Math.min(9,temp);\n\t\t\t }\n\t\t\t else{\n\t\t\t max+=\"0\";\n\t\t\t }\n\t\t\t }\n\t\t\t \n\t\t\t temp=s;\n\t\t\t for(i=m-1;i>=0;i--){\n\t\t\t if(temp>9){\n\t\t\t min=\"9\"+min;\n\t\t\t temp=temp-9;\n\t\t\t }\n\t\t\t else if(i==0){\n\t\t\t min=Integer.toString(temp)+min;\n\t\t\t }\n\t\t\t else if(temp<10 && temp!=1){\n\t\t\t min=Integer.toString(temp-1)+min;\n\t\t\t temp=1;\n\t\t\t }\n\t\t\t else{\n\t\t\t min=\"0\"+min;\n\t\t\t }\n\t\t\t }\n\t\t\t bw.write(min+\" \"+max);\n\t\t\t}\n //}\n bw.flush();\n }\n}\n", "lang_cluster": "Java", "tags": ["greedy", "dp", "implementation"], "code_uid": "83293b7ca55698bbe704bf1bb7295d35", "src_uid": "75d062cece5a2402920d6706c655cad7", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\n\npublic class problem {\n static void solve() throws IOException {\n Reader in = new Reader();\n int n = in.nextInt();\n int k = in.nextInt();\n int a[] = new int[k];\n int countOdd = 0;\n int countEven = 0;\n int doubleRemain = 2 * n;\n int quadraticRemain = n;\n int totalQuad = 0;\n for (int i = 0; i < k; i++) {\n a[i] = in.nextInt();\n totalQuad += a[i] / 4;\n if (a[i] % 4 == 2) countEven++;\n if (a[i] % 4 == 1) countOdd++;\n if (a[i] % 4 == 3) {\n countOdd++;\n countEven++;\n }\n }\n int res;\n if (totalQuad > quadraticRemain) {\n countEven += 2 * (totalQuad - quadraticRemain);\n res = doubleRemain - countEven - countOdd;\n } else {\n quadraticRemain -= totalQuad;\n int min = Math.min(Math.min(quadraticRemain, countEven), countOdd);\n quadraticRemain -= min;\n countEven -= min;\n countOdd -= min;\n if (countEven == 0) doubleRemain += 2 * quadraticRemain;\n else if (countOdd == 0) {\n doubleRemain += 3 * (quadraticRemain / 2) + quadraticRemain % 2;\n }\n res = doubleRemain - countEven - countOdd;\n }\n\n System.out.println(res >= 0 ? \"YES\" : \"NO\");\n }\n\n public static void main(String[] args) throws IOException {\n new problem().solve();\n }\n\n static class Reader {\n\n final private int BUFFER_SIZE = 1 << 16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n\n public Reader() {\n din = new DataInputStream(System.in);\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public Reader(String file_name) throws IOException {\n din = new DataInputStream(new FileInputStream(file_name));\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public String readLine() throws IOException {\n byte[] buf = new byte[64]; // line length\n int cnt = 0, c;\n while ((c = read()) != -1) {\n if (c == '\\n') {\n break;\n }\n buf[cnt++] = (byte) c;\n }\n return new String(buf, 0, cnt);\n }\n\n public int nextInt() throws IOException {\n int ret = 0;\n byte c = read();\n while (c <= ' ') {\n c = read();\n }\n boolean neg = (c == '-');\n if (neg) {\n c = read();\n }\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n\n if (neg) {\n return -ret;\n }\n return ret;\n }\n\n public long nextLong() throws IOException {\n long ret = 0;\n byte c = read();\n while (c <= ' ') {\n c = read();\n }\n boolean neg = (c == '-');\n if (neg) {\n c = read();\n }\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n if (neg) {\n return -ret;\n }\n return ret;\n }\n\n public double nextDouble() throws IOException {\n double ret = 0, div = 1;\n byte c = read();\n while (c <= ' ') {\n c = read();\n }\n boolean neg = (c == '-');\n if (neg) {\n c = read();\n }\n\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n\n if (c == '.') {\n while ((c = read()) >= '0' && c <= '9') {\n ret += (c - '0') / (div *= 10);\n }\n }\n\n if (neg) {\n return -ret;\n }\n return ret;\n }\n\n private void fillBuffer() throws IOException {\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1) {\n buffer[0] = -1;\n }\n }\n\n private byte read() throws IOException {\n if (bufferPointer == bytesRead) {\n fillBuffer();\n }\n return buffer[bufferPointer++];\n }\n\n public void close() throws IOException {\n if (din == null) {\n return;\n }\n din.close();\n }\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "greedy", "implementation"], "code_uid": "f50a134da1e5c7c8d81c2632d0826ebd", "src_uid": "d1f88a97714d6c13309c88fcf7d86821", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\n\npublic class CodeForces {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n String str = scanner.nextLine();\n String res = \"NO\";\n for(char ch : str.toCharArray()) {\n if(ch == 'H' || ch == 'Q' || ch == '9')\n res = \"YES\";\n }\n System.out.println(res);\n }\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "2e83f9eed6da25d74cbf37f5e553e4b2", "src_uid": "1baf894c1c7d5aeea01129c7900d3c12", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.*;\nimport java.math.BigInteger;\nimport java.util.ArrayList;\nimport java.util.StringTokenizer;\n\npublic class Main {\n public static void main(String[] args) throws IOException {\n FastScanner in = new FastScanner();\n long Por = in.nextLong(), Kor = in.nextLong();\n BigInteger K = BigInteger.valueOf(Kor), P = BigInteger.valueOf(Por);\n\n K = K.multiply(BigInteger.valueOf(-1));\n ArrayList<Integer> data = new ArrayList<Integer>();\n BigInteger coef = BigInteger.ONE;\n while (P != BigInteger.ZERO) {\n int cur = 0;\n BigInteger absCo = coef.abs(), absP = P.abs(), absK = K.abs();\n while (absP.remainder(absCo) == BigInteger.ZERO && absP.divide(absCo).remainder(absK) != BigInteger.ZERO) {\n P = P.subtract(coef);\n absP = P.abs();\n cur++;\n }\n data.add(cur);\n coef = coef.multiply(K);\n }\n\n System.out.println(data.size());\n for (int i = 0; i < data.size(); i++) {\n System.out.print(data.get(i) + \" \");\n }\n System.out.println();\n }\n\n public static class FastScanner {\n BufferedReader br;\n StringTokenizer st;\n\n public FastScanner(String s) {\n try {\n br = new BufferedReader(new FileReader(s));\n } catch (FileNotFoundException e) {\n // TODO Auto-generated catch block\n e.printStackTrace();\n }\n }\n\n public FastScanner() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n String nextToken() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n // TODO Auto-generated catch block\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n String nextLine() {\n st = null;\n try {\n return br.readLine();\n } catch (IOException e) {\n // TODO Auto-generated catch block\n e.printStackTrace();\n }\n return null;\n }\n\n int nextInt() {\n return Integer.parseInt(nextToken());\n }\n\n long nextLong() {\n return Long.parseLong(nextToken());\n }\n\n double nextDouble() {\n return Double.parseDouble(nextToken());\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "4279501db94a421f7526f76cf18671c4", "src_uid": "f4dbaa8deb2bd5c054fe34bb83bc6cd5", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.BufferedWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.StringTokenizer;\nimport java.util.TreeMap;\n\n\npublic class A_349 {\n\n static StringTokenizer st;\n static BufferedReader br;\n static PrintWriter pw;\n public static void main(String[] args) throws IOException { \n \tbr = new BufferedReader(new InputStreamReader(System.in));\n pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out))); \n int n = nextInt();\n int first = 0, last = 0;\n for (int i = 1; i <= n; i++) {\n\t\t\tint k = nextInt();\n\t\t\tif(k==1){\n\t\t\t\tfirst = i;\n\t\t\t}\n\t\t\tif(k==n){\n\t\t\t\tlast = i;\n\t\t\t}\n\t\t}\n int res1 = Math.max(n-last, last-1);\n int res2 = Math.max(n-first, first-1);\n pw.println(Math.max(res1,res2));\n \n pw.close();\n }\n \n\n\tprivate static int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n private static long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n private static double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n private static String next() throws IOException {\n while (st==null || !st.hasMoreTokens())\n st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n}\nclass Point{\n\tdouble x;\n\tdouble y;\n\tPoint (double x, double y){\n\t\tthis.x=x;\n\t\tthis.y=y;\n\t}\n}", "lang_cluster": "Java", "tags": ["constructive algorithms", "implementation"], "code_uid": "1385abe996d20b1781d5bb9abb69f2ea", "src_uid": "1d2b81ce842f8c97656d96bddff4e8b4", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.Scanner;\n\npublic class Test2 {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n String s = in.next();\n char[] chars = s.toCharArray();\n boolean a = false;\n\n StringBuilder buf = new StringBuilder(s);\n\n for (int i = 1; i < s.length();i++) {\n if (Character.isUpperCase(chars[0])) {\n a = true;\n }\n }\n\n if (s.equals(buf.toString().toUpperCase())){\n System.out.print(buf.toString().toLowerCase());\n }\n else if (a = true ) {\n if (buf.substring(1).equals(buf.substring(1).toUpperCase()))\n System.out.print(buf.substring(0,1).toUpperCase()+buf.substring(1).toLowerCase());\n else\n System.out.print(s);\n }\n else System.out.print(s);\n }\n}", "lang_cluster": "Java", "tags": ["strings", "implementation"], "code_uid": "8f02e81394df90f2b9300a517c91a475", "src_uid": "db0eb44d8cd8f293da407ba3adee10cf", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\r\n\r\npublic class HelloWorld {\r\n static int mod = 998244353;\r\n public static void main(String[] args) {\r\n Scanner scan = new Scanner(System.in);\r\n long n = scan.nextLong();\r\n long m = scan.nextLong();\r\n int ans=0;\r\n for(int i=1; i<=n; i++){\r\n ans = add(ans, binPow((int)(m%mod), i));\r\n }\r\n long curr=1;\r\n int count=1;\r\n for(int i=1; i<=n; i++){\r\n if(curr>m)\r\n continue;\r\n if(isPrime(i))\r\n curr *= i;\r\n count = mul(count, (int)((m/curr)%mod));\r\n ans = sub(ans, count);\r\n }\r\n System.out.println(ans);\r\n }\r\n static boolean isPrime(long n){\r\n if(n<=1)\r\n return false;\r\n for(long i=2; i*i<=n; i++){\r\n if(n%i==0)\r\n return false;\r\n }\r\n return true;\r\n }\r\n static int binPow(int x, int y){\r\n int z=1;\r\n while(y!=0){\r\n if((y&1) != 0){\r\n z = mul(z, x);\r\n }\r\n x = mul(x, x);\r\n y >>= 1;\r\n }\r\n return z;\r\n }\r\n static int add(int x, int y){\r\n x += y;\r\n while(x >= mod) \r\n x -= mod;\r\n while(x < 0) \r\n x += mod;\r\n return x;\r\n } \r\n static int sub(int x, int y){\r\n return add(x, -y);\r\n } \r\n static int mul(int x, int y){\r\n return (int) ((x * 1l * y) % mod);\r\n }\r\n}", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics", "number theory"], "code_uid": "5df7a5a3d312cb11f75567990e370b8d", "src_uid": "0fdd91ed33431848614075ebe9d2ee68", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.Scanner;\n\n/**\n * @author avcbcoder last modified @23-Jun-2018 @10:09:41 PM 491 Div2 - TODO\n */\n\npublic class C_ {\n\tpublic static void main(String[] args) throws Exception {\n\t\t// solve(39259424579862572L, 1000000000000000000L);\n\t\t// solve(1, 43);\n\t\t// while (true)\n\t\tcalc(sc.nextLong());\n\t}\n\n\tprivate static long calc(long n) {\n\t\tlong lo = 1, hi = 1000000000000000001L;\n\t\t// minimize k i.e mid , if we got ans move to left\n\t\t// otherwise move to right\n\t\tlong min = Long.MAX_VALUE;\n\t\tArrayList<Long> ans = new ArrayList<>();\n\t\twhile (lo <= hi) {\n\t\t\tlong mid = (lo + hi) / 2;\n\t\t\tboolean curr = solve(mid, n);\n\t\t\tif (curr) {\n\t\t\t\tmin = Math.min(min, mid);\n\t\t\t\tans.add(mid);\n\t\t\t\thi = mid - 1;\n\t\t\t} else {\n\t\t\t\tlo = mid + 1;\n\t\t\t}\n\t\t}\n\t\t// Collections.sort(ans);\n\t\t// for (long l : ans) {\n\t\t// if (solve(l, n)) {\n\t\t// System.out.println(l);\n\t\t// return l;\n\t\t// }\n\t\t// }\n\t\tSystem.out.println(min);\n\t\treturn min;\n\t}\n\n\tprivate static boolean solve(long k, long n) {\n\t\tlong initial = n;\n\t\tlong v = 0, p = 0;// p is 10% and v is k\n\t\tlong i = 0;\n\t\twhile (n != 0) {\n\t\t\tif (i % 2 == 0) {\n\t\t\t\t// v\n\t\t\t\t// long eat;\n\t\t\t\t// if (n >= k) {\n\t\t\t\t// eat = k;\n\t\t\t\t// } else {\n\t\t\t\t// eat = n;\n\t\t\t\t// }\n\t\t\t\t// v += eat;\n\t\t\t\t// n -= eat;\n\t\t\t\tv += Math.min(n, k);\n\t\t\t\tn -= Math.min(n, k);\n\t\t\t} else {\n\t\t\t\t// p\n\t\t\t\tif (n >= 10) { // now he can eat\n\t\t\t\t\t// long eat = (long) (Math.floor((n * 1.0) / 10.0));\n\t\t\t\t\tlong eat = n / 10;\n\t\t\t\t\tn -= eat;\n\t\t\t\t\tp += eat;\n\t\t\t\t}\n\t\t\t}\n\t\t\ti++;\n\t\t}\n\t\t// double h=(initial * 1.0) / (2);\n\t\tif (v * 2 >= initial) {\n\t\t\treturn true;\n\t\t} else\n\t\t\treturn false;\n\t}\n\n\tpublic static InputStreamReader r = new InputStreamReader(System.in);\n\n\tpublic static BufferedReader br = new BufferedReader(r);\n\n\tpublic static Scanner sc = new Scanner(System.in);\n}\n", "lang_cluster": "Java", "tags": ["implementation", "binary search"], "code_uid": "ec3a233f0caa0a66a6534f8412a68ee5", "src_uid": "db1a50da538fa82038f8db6104d2ab93", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.HashSet;\n\npublic class main {\n public static void main(String[] args) {\n try\n {\n InputStreamReader converter = new InputStreamReader(System.in);\n BufferedReader reader = new BufferedReader(converter);\n String line= null;\n line = reader.readLine();\n HashSet<Character> map = new HashSet<Character>();\n for (int i=0;i<line.length();++i)\n {\n map.add(line.charAt(i));\n }\n if (map.size()%2==0)\n {\n System.out.print(\"CHAT WITH HER!\");\n }\n else\n {\n System.out.print(\"IGNORE HIM!\");\n }\n }\n catch(Exception e)\n {\n System.out.print(e);\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "strings", "implementation"], "code_uid": "e467b663f0adc342aa77ce7482a2e49a", "src_uid": "a8c14667b94b40da087501fd4bdd7818", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\npublic class Main\n{\n\tprivate List<Long> list=new ArrayList<>();\n\tpublic static void main(String args[])throws IOException\n\t{\n\t\tnew Main().run();\n\t}\n\tvoid run()throws IOException\n\t{\n\t\tBufferedReader in=new BufferedReader(new InputStreamReader(System.in));\n\t\tPrintWriter ob=new PrintWriter(System.out);\n\t\tgenerateSuperLuckyNumbers();\n\t\tCollections.sort(list,new Comparator<Long>(){\n\t\t\tpublic int compare(Long a,Long b)\n\t\t\t{\n\t\t\t\treturn a.compareTo(b);\n\t\t\t}\n\t\t});\n\t\tlong x=Integer.parseInt(in.readLine());\n\t\tfor(long i : list) {\n\t\t\tif (i>=x)\n\t\t\t\t{\n\t\t\t\t\tob.println(i);\n\t\t\t\t\tob.flush();\n\t\t\t\t\treturn;\n\t\t\t }\n\t\t}\n\t}\n\tvoid generateSuperLuckyNumbers()\n\t{\n\t\tfor(int i=1;i<=5;i++)\n\t\t\tgenerate(i,i,0L);\n\t}\n\tvoid generate(int four,int seven,long number)\n\t{\n\t\tif(four==0 && seven==0)\n\t\t{\n\t\t\tlist.add(number);\n\t\t\treturn;\n\t\t}\n\t\tif(four>0)\n\t\t\tgenerate(four-1,seven,(number*10)+4);\n\t\tif(seven>0)\n\t\t\tgenerate(four,seven-1,(number*10)+7);\n\t\t\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "binary search", "bitmasks"], "code_uid": "ee9182cb23b94671904af916a63d5abd", "src_uid": "77b5f83cdadf4b0743618a46b646a849", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class Contest {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong n = sc.nextLong();\n\t\tlong k = sc.nextLong();\n\t\tif (n+(n-1)<k) {\n\t\t\tSystem.out.println(0);\n\t\t}else if(n-1>=k) {\n\t\t\tSystem.out.println((k-1)/2);\n\t\t}else {\n\t\t\tlong min = Math.max(k-n, 1);\n\t\t\tlong max = k-min+1;\n\t\t\tSystem.out.println((max-min)/2);\n\t\t}\n\t}\n\n}", "lang_cluster": "Java", "tags": ["math"], "code_uid": "6924b304cbb221297c6159ea9e34174f", "src_uid": "98624ab2fcd2a50a75788a29e04999ad", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.math.BigInteger;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n public static void main(String [] args) {\n final FastScanner scanner = new FastScanner();\n int n = scanner.nextInt(), l = scanner.nextInt(), r = scanner.nextInt();\n System.out.println(min(n, l) + \" \" + max(n, r));\n }\n\n\n static int max(int n, int r) {\n int sum = 0;\n int start = 1, curr = 1, unique = 0;\n for (int i = 0; i < n; i++) {\n if (unique < r) {\n sum += start;\n curr = start;\n start *= 2;\n unique ++;\n } else {\n sum += curr;\n }\n// System.out.println(sum);\n }\n return sum;\n }\n\n static int min(int n, int l) {\n int start = 1;\n int sum = 0;\n for (int i = 0; i < l; i++) {\n sum += start;\n start *= 2;\n }\n\n for (int i = l; i < n; i++) {\n sum += 1;\n }\n return sum;\n }\n\n\n static class FastScanner {\n BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st=new StringTokenizer(\"\");\n String next() {\n while (!st.hasMoreTokens())\n try {\n st=new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n int[] readArray(int n) {\n int[] a=new int[n];\n for (int i=0; i<n; i++) a[i]=nextInt();\n return a;\n }\n long nextLong() {\n return Long.parseLong(next());\n }\n }\n}\n\n\n\n\n\n", "lang_cluster": "Java", "tags": ["math", "greedy"], "code_uid": "f371dcd4605eeeb120d2fe9431ee5cf6", "src_uid": "ce220726392fb0cacf0ec44a7490084a", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Scanner;\n\npublic class Nuts {\n\n\tprivate static int k;\n\tprivate static int a;\n\tprivate static int b;\n\tprivate static int v;\n\tprivate static int boxesNumber;\n\n\tpublic static void main(String[] args) {\n\n\t\tboxesNumber = 0;\n\n\t\tScanner scanner = new Scanner(System.in);\n\t\tString input = scanner.nextLine();\n\t\tString[] parts = input.split(\" \");\n\n\t\tk = Integer.parseInt(parts[0]);\n\t\ta = Integer.parseInt(parts[1]);\n\t\tb = Integer.parseInt(parts[2]);\n\t\tv = Integer.parseInt(parts[3]);\n\n\t\t/*---------------------------------*/\n\n\t\twhile (a > 0) {\n\t\t\tboxesNumber++;\n\t\t\tif (b > 0) {\n\t\t\t\ta -= v*(Math.min(b, k-1) + 1);\n\t\t\t\tb -= Math.min(b, k-1);\n\t\t\t} else {\n\t\t\t\ta -= v;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(boxesNumber);\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "greedy"], "code_uid": "b99c56d6f3718ab5e968f73693a52ea8", "src_uid": "7cff20b1c63a694baca69bdf4bdb2652", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\n\npublic class lolat {\n\tstatic int n;\n\n\tstatic long[][] memo;\n\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\twhile (in.hasNext()) {\n\t\t\tn = in.nextInt();\n\t\t\tint k = in.nextInt();\n\t\t\tmemo = new long[n + 1][k + 1];\n\t\t\tfor (int i = 0; i <= n; i++) {\n\t\t\t\tArrays.fill(memo[i], -1);\n\t\t\t}\n\t\t\tSystem.out\n\t\t\t\t\t.println(callRecusive(1, k) % 1000000007);\n\t\t}\n\t}\n\n\tprivate static long callRecusive(int num, int len) {\n\t\t// TODO Auto-generated method stub\n\t\tif (len == 0) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (memo[num][len] != -1)\n\t\t\treturn memo[num][len];\n\t\tlong s = 0;\n\t\tfor (int i = num; i <= n; i += num) {\n\t\t\ts += callRecusive(i, len - 1);\n\t\t}\n\t\treturn (memo[num][len] = s % 1000000007);\n\t}\n\n}", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "number theory"], "code_uid": "e6dc8fc661fa4c7afc0d426ef5206f34", "src_uid": "c8cbd155d9f20563d37537ef68dde5aa", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.math.BigInteger; \nimport java.util.*;\n\n//Mann Shah [ DAIICT ].\n//fast io\n\npublic class Main {\n\tstatic int mod = (int) (1e9+7);\n\tstatic InputReader in;\n static PrintWriter out;\n \n \n\tpublic static void main(String args[] ) {\n\t\t\t\n\t\tin = new InputReader(System.in);\n\t out = new PrintWriter(System.out);\n\t \n\t long t = in.nextLong();\n\t long s = in.nextLong();\n\t long x = in.nextLong();\n\t \n\t x -= t;\n\t if(x==0) {\n\t \t\tout.println(\"YES\");\n\t }\n\t else if(x<0) {\n\t \t\tout.println(\"NO\");\n\t }\n\t else {\n\t \tif(x<s) {\n\t \t\tout.println(\"NO\");\n\t \t}\n\t \telse {\n\t if(x%s==0 || x%s==1) {\n\t \t\tout.println(\"YES\");\n\t }\n\t else {\n\t \t\tout.println(\"NO\");\n\t }}}\n\n\t \n\t \n\t \t\t\n\t out.close();\n\t}\n\t\t\n/* TC space\n\n\n\n */\n\t\t\n\t\tstatic class InputReader\n\t {\n\n\t private final InputStream stream;\n\t private final byte[] buf = new byte[8192];\n\t private int curChar, snumChars;\n\t private SpaceCharFilter filter;\n\n\t public InputReader(InputStream stream)\n\t {\n\t this.stream = stream;\n\t }\n\n\t public int snext()\n\t {\n\t if (snumChars == -1)\n\t throw new InputMismatchException();\n\t if (curChar >= snumChars)\n\t {\n\t curChar = 0;\n\t try\n\t {\n\t snumChars = stream.read(buf);\n\t } catch (IOException e)\n\t {\n\t throw new InputMismatchException();\n\t }\n\t if (snumChars <= 0)\n\t return -1;\n\t }\n\t return buf[curChar++];\n\t }\n\n\t public int nextInt()\n\t {\n\t int c = snext();\n\t while (isSpaceChar(c))\n\t {\n\t c = snext();\n\t }\n\t int sgn = 1;\n\t if (c == '-')\n\t {\n\t sgn = -1;\n\t c = snext();\n\t }\n\t int res = 0;\n\t do\n\t {\n\t if (c < '0' || c > '9')\n\t throw new InputMismatchException();\n\t res *= 10;\n\t res += c - '0';\n\t c = snext();\n\t } while (!isSpaceChar(c));\n\t return res * sgn;\n\t }\n\n\t public long nextLong()\n\t {\n\t int c = snext();\n\t while (isSpaceChar(c))\n\t {\n\t c = snext();\n\t }\n\t int sgn = 1;\n\t if (c == '-')\n\t {\n\t sgn = -1;\n\t c = snext();\n\t }\n\t long res = 0;\n\t do\n\t {\n\t if (c < '0' || c > '9')\n\t throw new InputMismatchException();\n\t res *= 10;\n\t res += c - '0';\n\t c = snext();\n\t } while (!isSpaceChar(c));\n\t return res * sgn;\n\t }\n\n\t public int[] nextIntArray(int n)\n\t {\n\t int a[] = new int[n];\n\t for (int i = 0; i < n; i++)\n\t {\n\t a[i] = nextInt();\n\t }\n\t return a;\n\t }\n\n\t public long[] nextLongArray(int n)\n\t {\n\t long a[] = new long[n];\n\t for (int i = 0; i < n; i++)\n\t {\n\t a[i] = nextLong();\n\t }\n\t return a;\n\t }\n\t \n\t public ArrayList<Integer> nextArrayList(int n){\n\t \t\t\tArrayList<Integer> x = new ArrayList<Integer>();\n\t \t\t\tfor(int i=0;i<n;i++) {\n\t \t\t\t\tint v = in.nextInt();\n\t \t\t\t\tx.add(v);\n\t \t\t\t}\n\t \t\t\treturn x;\n\t }\n\n\t public String readString()\n\t {\n\t int c = snext();\n\t while (isSpaceChar(c))\n\t {\n\t c = snext();\n\t }\n\t StringBuilder res = new StringBuilder();\n\t do\n\t {\n\t res.appendCodePoint(c);\n\t c = snext();\n\t } while (!isSpaceChar(c));\n\t return res.toString();\n\t }\n\n\t public String nextLine()\n\t {\n\t int c = snext();\n\t while (isSpaceChar(c))\n\t c = snext();\n\t StringBuilder res = new StringBuilder();\n\t do\n\t {\n\t res.appendCodePoint(c);\n\t c = snext();\n\t } while (!isEndOfLine(c));\n\t return res.toString();\n\t }\n\n\t public boolean isSpaceChar(int c)\n\t {\n\t if (filter != null)\n\t return filter.isSpaceChar(c);\n\t return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t }\n\n\t private boolean isEndOfLine(int c)\n\t {\n\t return c == '\\n' || c == '\\r' || c == -1;\n\t }\n\n\t public interface SpaceCharFilter\n\t {\n\t public boolean isSpaceChar(int ch);\n\t }\n\n\t }\n\t\t\n}\n\n\n\n//Pair arr[] = new Pair[n]; \n//arr[0] = new Pair(10, 20); \n class Pair { \n int x; \n int y; \n \n // Constructor \npublic Pair(int x, int y) \n { \n this.x = x; \n this.y = y; \n } \n} \n// class Compare { \n//\t //void return by default.\n// static Pair[] compare(Pair arr[], int n) \n// { \n// // Comparator to sort the pair according to first element.\n// Arrays.sort(arr, new Comparator<Pair>() { \n// @Override public int compare(Pair p1, Pair p2) \n// { \n// return p1.x - p2.x; \n// } \n// }); \n// \n// \n// return arr;\n// /* for (int i = 0; i < n; i++) { \n// System.out.print(arr[i].x + \" \" + arr[i].y + \" \"); \n// } \n// System.out.println(); */\n// } \n//} \n\n\n\n\nclass couple implements Comparable<couple>\n{ int x,y;\n public couple(int m,int f) {\n \t x=m;\n \t y=f;\n }\n\tpublic int compareTo(couple o) {\n\t\t\n\t\t \n\t\treturn x-o.x;\n\t} \n}\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "f1fb2b087ebb5d32843e35a6208678a6", "src_uid": "3baf9d841ff7208c66f6de1b47b0f952", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Scanner;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n\tstatic Scanner in = new Scanner(System.in);\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st = new StringTokenizer(br.readLine());\n\t\tint n = Integer.parseInt(st.nextToken());\n\t\tint m = Integer.parseInt(st.nextToken());\n\t\tint k = Integer.parseInt(st.nextToken());\n\t\tint[] a = new int[n + 1];\n\t\tst = new StringTokenizer(br.readLine());\n\t\tfor (int i = 1; i <= n; i++)\n\t\t\ta[i] = Integer.parseInt(st.nextToken());\n\t\tint l = m, r = m;\n\t\twhile (l > 1) {\n\t\t\tl--;\n\t\t\tif (a[l] != 0 && a[l] <= k)\n\t\t\t\tbreak;\n\t\t}\n\t\twhile (r < n) {\n\t\t\tr++;\n\t\t\tif (a[r] != 0 && a[r] <= k)\n\t\t\t\tbreak;\n\t\t}\n\t\tint disL = -1, disR = -1;\n\t\tif (l == m || a[l] > k || a[l] == 0)\n\t\t\tdisL = 100;\n\t\telse {\n\t\t\tdisL = m - l;\n\t\t}\n\t\tif (r == m || a[r] > k || a[r] == 0)\n\t\t\tdisR = 100;\n\t\telse {\n\t\t\tdisR = r - m;\n\t\t}\n\n\t\tSystem.out.println(Math.min(disL, disR) * 10);\n\n\t}\n\n}", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "a68a94f9a03519be4134156400c84be6", "src_uid": "57860e9a5342a29257ce506063d37624", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class Factory{\n\n\tpublic static boolean productionWillStop(long a, long m){\n\t\tfor (int i = 0; i < 100000; i++) {\n\t\t\tif (a % m == 0){\n\t\t\t\tSystem.out.println(\"Yes\");\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\ta += a % m;\n\t\t}\n\t\tSystem.out.println(\"No\");\n\t\treturn false;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tlong a = in.nextLong();\n\t\tlong m = in.nextLong();\n\t\tproductionWillStop(a, m);\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "matrices", "implementation"], "code_uid": "d75f9d80095398686665a6f7a191f38c", "src_uid": "f726133018e2149ec57e113860ec498a", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "\n\nimport java.io.*;\nimport java.util.*;\nimport java.lang.*;\nimport static java.lang.Math.*;\n\npublic class Solution implements Runnable {\n \n\n public void solve() throws Exception {\n int r1 = sc.nextInt();\n int c1 = sc.nextInt();\n int r2 = sc.nextInt();\n int c2 = sc.nextInt();\n if(r1 == r2 && c1 == c2) out.print(0 + \" \");\n else if(r1 == r2 || c1 == c2) out.print(1 + \" \");\n else out.print(2 + \" \");\n if((r1 + c1) % 2 != (r2 + c2) % 2) out.print(0 + \" \");\n else if(abs(r1 - r2) == abs(c1 - c2)) out.print(1 + \" \");\n else out.print(2 + \" \");\n int count = 0;\n while(r1 != r2 || c1 != c2) {\n if(r1 != r2) {\n if(r1 > r2) r1--;\n else r1++;\n }\n if(c1 != c2) {\n if(c1 > c2) {\n c1--;\n }else c1++;\n } \n count ++;\n }\n out.println(count);\n out.flush();\n }\n \n static Throwable throwable;\n BufferedReader in;\n PrintWriter out;\n FastScanner sc;\n \n public static void main(String[] args) throws Throwable {\n Thread thread = new Thread(null, new Solution(), \"\", (1 << 26));\n thread.start();\n thread.join();\n if (Solution.throwable != null)\n throw throwable;\n }\n \n public void run() {\n try {\n// in = new BufferedReader(new InputStreamReader(new FileInputStream(\"game.in\")));\n// out = new PrintWriter(new FileWriter(\"game.out\"));\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n sc = new FastScanner(in);\n solve();\n } catch (Throwable throwable) {\n Solution.throwable = throwable;\n } finally {\n out.close();\n }\n }\n}\n\nclass FastScanner {\n BufferedReader reader;\n StringTokenizer strTok;\n \n FastScanner(BufferedReader reader) {\n this.reader = reader; \n }\n \n public String nextToken() throws Exception {\n while (strTok == null || !strTok.hasMoreTokens()) {\n strTok = new StringTokenizer(reader.readLine());\n }\n return strTok.nextToken(); \n }\n \n public int nextInt() throws Exception {\n return Integer.parseInt(nextToken());\n }\n \n public long nextLong() throws Exception {\n return Long.parseLong(nextToken());\n }\n \n public double nextDouble() throws Exception {\n return Double.parseDouble(nextToken());\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "graphs", "shortest paths"], "code_uid": "9d6462ad264c65349181d4d49bc2eff4", "src_uid": "7dbf58806db185f0fe70c00b60973f4b", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.Reader;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.HashMap;\nimport java.util.PriorityQueue;\nimport java.util.Scanner;\nimport java.util.StringTokenizer;\nimport java.util.TreeSet;\n\npublic class CFProblemC {\n\tstatic long mod;\n\n\tpublic static void main(String[] args) {\n\t\tFastScanner input = new FastScanner();\n\t\tmod = input.nextInt();\n\t\tint h1 = input.nextInt(); // start\n\t\tint a1 = input.nextInt(); // goal\n\t\tint x1 = input.nextInt(); // x1*h1+y1 -> h1\n\t\tint y1 = input.nextInt();\n\n\t\tint h2 = input.nextInt();\n\t\tint a2 = input.nextInt(); // goal\n\t\tint x2 = input.nextInt();\n\t\tint y2 = input.nextInt();\n\t\tArrayList<Long> values1 = evaluateTimes(h1, a1, x1, y1);\n\t\tArrayList<Long> values2 = evaluateTimes(h2, a2, x2, y2);\n\t\tint index1 = 0;\n\t\tint index2 = 0;\n\t\twhile (index1 < values1.size() && index2 < values2.size()) {\n\t\t\tif (values1.get(index1).equals(values2.get(index2))) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (values1.get(index1).compareTo(values2.get(index2)) < 0) {\n\t\t\t\tindex1++;\n\t\t\t} else {\n\t\t\t\tindex2++;\n\t\t\t}\n\t\t}\n\t\tif (values1.size() > 0 && values2.size() > 0 && index1 < values1.size()\n\t\t\t\t&& index2 < values2.size()\n\t\t\t\t&& values1.get(index1).equals(values2.get(index2))) {\n\t\t\tSystem.out.println(values1.get(index1));\n\t\t} else {\n\t\t\tSystem.out.println(-1);\n\t\t}\n\t}\n\n\tprivate static ArrayList<Long> evaluateTimes(long h1, long a1, long x1,\n\t\t\tlong y1) {\n\t\tlong start = h1;\n\t\tlong count = 0;\n\t\tArrayList<Long> output = new ArrayList<Long>();\n\t\twhile (count < 2 * mod + 2) {\n\t\t\tif (start == a1) {\n\t\t\t\toutput.add(count);\n\t\t\t}\n\t\t\tcount++;\n\t\t\tstart = (start * x1 + y1) % mod;\n\t\t}\n\t\tif (output.size() == 0) {\n\t\t\treturn output;\n\t\t} else {\n\t\t\tif (output.size() > 1) {\n\t\t\t\tlong diff = output.get(1) - output.get(0);\n\t\t\t\tlong startVal = output.get(output.size() - 1);\n\t\t\t\tfor (int a = 1; a < mod + .1 * mod; a++) {\n\t\t\t\t\toutput.add(startVal + diff * a);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn output;\n\t}\n\n\tpublic static class FastScanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tpublic FastScanner(Reader in) {\n\t\t\tbr = new BufferedReader(in);\n\t\t}\n\n\t\tpublic FastScanner() {\n\t\t\tthis(new InputStreamReader(System.in));\n\t\t}\n\n\t\tString next() {\n\t\t\twhile (st == null || !st.hasMoreElements()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\t// Slightly different from java.util.Scanner.nextLine(),\n\t\t// which returns any remaining characters in current line,\n\t\t// if any.\n\t\tString readNextLine() {\n\t\t\tString str = \"\";\n\t\t\ttry {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn str;\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "greedy", "number theory"], "code_uid": "6590f91316816be44b03a92f918da221", "src_uid": "7225266f663699ff7e16b726cadfe9ee", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class Test {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n double x = sc.nextDouble();\n double y = sc.nextDouble();\n double a = Math.max(x, y)-1;\n double w = (6-a)/6;\n if(w==0.5)\n System.out.println(\"1/2\");\n else if(w==1)\n System.out.println(\"1/1\");\n else if(w==0.3333333333333333)\n System.out.println(\"1/3\");\n else if(w==0.16666666666666666)\n System.out.println(\"1/6\");\n else if(w==0.6666666666666666)\n System.out.println(\"2/3\");\n else if(w==0.8333333333333334)\n System.out.println(\"5/6\");\n \n \n\n }\n\n}\n", "lang_cluster": "Java", "tags": ["math", "probabilities"], "code_uid": "ef2815d91ac4f3fc86c67f0b3b344014", "src_uid": "f97eb4ecffb6cbc8679f0c621fd59414", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\npublic class Main {\n\tpublic static void main(String[] args)throws IOException{\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString cad1 = br.readLine(), cad2 = br.readLine(), cero = \"011220\",uno = \"102102\",dos = \"220011\";\n\t\tint answer, mov = Integer.parseInt(cad1) % 6,pos = Integer.parseInt(cad2);\n\t\t\n\t\tif (pos == 0) {\n\t\t\tSystem.out.println(cero.charAt(mov));\n\t\t}else{\n\t\t\tif (pos == 1) {\n\t\t\t\tSystem.out.println(uno.charAt(mov));\n\t\t\t}else {\n\t\t\t\tSystem.out.println(dos.charAt(mov));\n\t\t\t}\n\t\t}\n\n\t}\n\n}\t", "lang_cluster": "Java", "tags": ["math", "constructive algorithms", "implementation"], "code_uid": "d42f24881396cfd71be158af990364db", "src_uid": "7853e03d520cd71571a6079cdfc4c4b0", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n\n Scanner sc = new Scanner(System.in);\n String s1 = sc.next();\n String s2 = sc.next();\n if (s1.compareToIgnoreCase(s2) > 0) System.out.println(1);\n if (s1.compareToIgnoreCase(s2) < 0) System.out.println(-1);\n if (s1.compareToIgnoreCase(s2) == 0) System.out.println(0);\n }\n}", "lang_cluster": "Java", "tags": ["strings", "implementation"], "code_uid": "ddf3ba6340d94fbb4aa30c73d107a0c0", "src_uid": "ffeae332696a901813677bd1033cf01e", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.StringTokenizer;\nimport java.io.BufferedReader;\nimport java.io.InputStream;\nimport java.io.FileReader;\nimport java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.HashSet;\nimport java.util.Set;\nimport java.math.BigInteger;\nimport java.util.List;\nimport java.util.ArrayList;\nimport java.util.Queue;\nimport java.util.PriorityQueue;\nimport java.util.InputMismatchException;\nimport java.io.OutputStream;\nimport java.io.BufferedWriter;\nimport java.io.OutputStreamWriter;\n//https://codeforces.com/problemset/problem/385/A\n//A. Bear and Raspberry\npublic class Problem385A\n{\n public static void main(String[] args) throws IOException\n {\n BufferedReader in=new BufferedReader(new InputStreamReader(System.in));\n PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n \n StringTokenizer dates=new StringTokenizer(in.readLine());\n int n=Integer.parseInt(dates.nextToken());\n int c=Integer.parseInt(dates.nextToken());\n dates=new StringTokenizer(in.readLine());\n int[] day=new int[n];\n int mayor=0;\n int i;\n int pos=0;\n for(i=0;i<n;i++)\n {\n \tday[i]=Integer.parseInt(dates.nextToken());\n \tif(i>0&&day[i-1]-day[i]-c>mayor)\n \t{\n \t\tmayor=day[i-1]-day[i]-c;\n \t\tpos=i;\n \t}\n }\n if(mayor<0)\n \tout.println(0);\n else\n \tout.println(mayor);\n out.close();\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "greedy", "implementation"], "code_uid": "0f509b5ca81ba631a96f5c2fc708ee57", "src_uid": "411539a86f2e94eb6386bb65c9eb9557", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class CodeforcesSubsequences {\n\n\tpublic static void main(String[] args) {\n FastScanner in = new FastScanner();\n PrintWriter out = new PrintWriter(System.out);\n long n = in.nextLong();\n char ch[] = \"codeforces\".toCharArray();\n int k = 2;\n long s = 1L;\n int f[] = new int[10];\n Arrays.fill(f, 1);\n while(s<n) {\n \tfor(int i=0;i<10;i++) {\n \t\ts = s/(k-1) * k;\n \t\tif(s<n) ++f[i];\n \t\telse {\n \t\t\t++f[i];break;\n \t\t}\n \t}\n \tif(s>=n) break;\n \tk++;\n }\n //out.println(k+\" \"+p);\n for(int i=0;i<10;i++) {\n \tfor(int j=0;j<f[i];j++) {\n \t\tout.print(ch[i]);\n \t}\n }\n out.flush();\n\t}\n\t\n\tstatic class FastScanner {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st = new StringTokenizer(\"\");\n\t\t\n\t\tString next() {\n\t\t\twhile(!st.hasMoreTokens())\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t}catch(IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\t\t\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\t\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\t\n\t\tint[] readArray(int n) {\n\t\t\tint a[] = new int[n];\n\t\t\tfor(int i=0;i<n;i++) a[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\t\t\n\t\tlong[] readArray(int n,long x) {\n\t\t\tlong a[] = new long[n];\n\t\t\tfor(int i=0;i<n;i++) a[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n\t\t\n\t}\n\t\n\tstatic boolean arrayEquals(char a[], char b[]) {\n\t\tint n = a.length;\n\t\tboolean verdict = true;\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tif(a[i]!=b[i]) {\n\t\t\t\tverdict = false;break;\n\t\t\t}\n\t\t}\n\t\treturn verdict;\n\t}\n\t\n\tstatic long lcm(long a, long b) {\n\t\treturn (a*b)/gcd(a,b);\n\t}\n\t\n\tstatic long gcd(long a, long b) {\n\t\tif(b==0) return a;\n\t\telse return gcd(b,a%b);\n\t}\n}\n\n\n\n\n\n\n", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "math", "greedy", "strings"], "code_uid": "cb168b3c12c5c118303d1d25c96041b1", "src_uid": "8001a7570766cadcc538217e941b3031", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class UnluckyTicket {\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n PrintWriter out = new PrintWriter(System.out);\n\n int n = in.nextInt();\n String number = in.next();\n\n char[] l = number.substring(0, n).toCharArray();\n char[] r = number.substring(n).toCharArray();\n\n boolean gt = true, lt = true;\n Arrays.sort(l); Arrays.sort(r);\n\n for (int i = 0; i < n; i++) {\n if (l[i] <= r[i]) gt = false;\n if (l[i] >= r[i]) lt = false;\n }\n out.println(gt || lt ? \"YES\" : \"NO\");\n out.close();\n }\n}\n", "lang_cluster": "Java", "tags": ["sortings", "greedy"], "code_uid": "30dbb752eed35df88a8d3edd0d63a50d", "src_uid": "e4419bca9d605dbd63f7884377e28769", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.Scanner;\n\npublic class PilesWithStones {\n public static void main(String[] args) {\n Scanner inp = new Scanner(System.in);\n int totalPiles = inp.nextInt();\n int firstVisitSum = 0;\n int secondVisitSum = 0;\n for(int i=0;i<totalPiles;i++) {\n int inpValue = inp.nextInt();\n firstVisitSum = firstVisitSum + inpValue;\n }\n for(int i=0;i<totalPiles;i++) {\n int inpValue = inp.nextInt();\n secondVisitSum = secondVisitSum + inpValue;\n }\n\n if (firstVisitSum>=secondVisitSum) {\n System.out.println(\"Yes\");\n } else {\n System.out.println(\"No\");\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "873d99887e3a431e3e274a0c7f827208", "src_uid": "e0ddac5c6d3671070860dda10d50c28a", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\n\npublic class Hexadecimal {\n\tpublic static void main(String[] args){\n\t\tScanner reader = new Scanner(System.in);\n\t\tint n = reader.nextInt();\n\t\tint cnt = 0;\n\t\tfor(int i = 1; i <= (1<<9); i++){\n\t\t\tif(Integer.parseInt(Integer.toString(i,2)) <= n)\n\t\t\t\tcnt++;\n\t\t}\n\t\tSystem.out.println(cnt);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "implementation"], "code_uid": "526e7b4fe4d929c36206a29e5f8def78", "src_uid": "64a842f9a41f85a83b7d65bfbe21b6cb", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedInputStream;\nimport java.io.InputStream;\nimport java.util.ArrayList;\nimport java.util.Collections;\n\npublic class Main {\n\n public static void main(String[] args) {\n ScanReader in=new ScanReader(System.in);\n int n = in.scanInt();\n int k = in.scanInt();\n String a=in.scanString();\n ArrayList<Character> array=new ArrayList<Character>();\n for(int i=0;i<n;i++){\n if(!array.contains(a.charAt(i))){\n array.add(a.charAt(i));\n }\n }\n Collections.sort(array);\n long ans=0;\n int t=1;\n boolean aa[]=new boolean[n];\n int count=0;\n for(int i=0;i<array.size();i++){\n\n if(!aa[i]) {\n count++;\n if(count<=k) {\n ans += (array.get(i) - 'a' + 1);\n }else{\n\n System.out.println(ans);\n return;\n }\n if(i+1<array.size() && (array.get(i+1)-array.get(i))<2){\n aa[i+1]=true;\n }\n }\n\n }\n if(count<k){\n System.out.println(\"-1\");\n return;\n }\n System.out.println(ans);\n\n }\n\n static class ScanReader {\n /**\n * @author Nirav\n */\n private byte[] buf = new byte[4 * 1024];\n private int INDEX;\n private BufferedInputStream in;\n private int TOTAL;\n\n public ScanReader(InputStream inputStream) {\n in = new BufferedInputStream(inputStream);\n }\n\n private int scan() {\n if (INDEX >= TOTAL) {\n INDEX = 0;\n try {\n TOTAL = in.read(buf);\n } catch (Exception e) {\n e.printStackTrace();\n }\n if (TOTAL <= 0) return -1;\n }\n return buf[INDEX++];\n }\n\n\n public String scanLine() {\n int c = scan();\n if (c == -1) return null;\n while (isWhiteSpace(c)) c = scan();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = scan();\n } while (c != '\\n' && c != -1);\n return res.toString();\n }\n\n public char scanChar() {\n int c = scan();\n while (isWhiteSpace(c)) c = scan();\n return (char) c;\n }\n\n\n public int scanInt() {\n int I = 0;\n int n = scan();\n while (isWhiteSpace(n)) n = scan();\n int neg = 1;\n if (n == '-') {\n neg = -1;\n n = scan();\n }\n while (!isWhiteSpace(n)) {\n if (n >= '0' && n <= '9') {\n I *= 10;\n I += n - '0';\n n = scan();\n }\n }\n return neg * I;\n }\n\n public String scanString() {\n int c = scan();\n while (isWhiteSpace(c)) c = scan();\n StringBuilder RESULT = new StringBuilder();\n do {\n RESULT.appendCodePoint(c);\n c = scan();\n } while (!isWhiteSpace(c));\n return RESULT.toString();\n }\n\n private boolean isWhiteSpace(int n) {\n if (n == ' ' || n == '\\n' || n == '\\r' || n == '\\t' || n == -1) return true;\n else return false;\n }\n\n public long scanLong() {\n long I = 0;\n int n = scan();\n while (isWhiteSpace(n)) n = scan();\n int neg = 1;\n if (n == '-') {\n neg = -1;\n n = scan();\n }\n while (!isWhiteSpace(n)) {\n if (n >= '0' && n <= '9') {\n I *= 10;\n I += n - '0';\n n = scan();\n }\n }\n return neg * I;\n }\n\n public void scanLong(long[] A) {\n for (int i = 0; i < A.length; i++) A[i] = scanLong();\n }\n\n public void scanInt(int[] A) {\n for (int i = 0; i < A.length; i++) A[i] = scanInt();\n }\n\n public double scanDouble() {\n int c = scan();\n while (isWhiteSpace(c)) c = scan();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = scan();\n }\n double RESULT = 0;\n while (!isWhiteSpace(c) && c != '.') {\n if (c == 'e' || c == 'E') {\n return RESULT * Math.pow(10, scanInt());\n }\n RESULT *= 10;\n RESULT += c - '0';\n c = scan();\n }\n if (c == '.') {\n c = scan();\n double m = 1;\n while (!isWhiteSpace(c)) {\n if (c == 'e' || c == 'E') {\n return RESULT * Math.pow(10, scanInt());\n }\n m /= 10;\n RESULT += (c - '0') * m;\n c = scan();\n }\n }\n return RESULT * sgn;\n }\n\n }\n}\n", "lang_cluster": "Java", "tags": ["sortings", "implementation", "greedy"], "code_uid": "8a8ccc23141cc4ca396b2dcf3a8f8b32", "src_uid": "56b13d313afef9dc6c6ba2758b5ea313", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n \npublic class exercise {\n\tstatic int a[]=new int [4];;\n\tpublic static void input() {\n\t\tScanner input=new Scanner(System.in);\n\t\tfor(int i=0;i<4;i++) {\n\t\t\ta[i]=input.nextInt();\n\t\t}\n\t\t\n\t}\n\t\n\tpublic static void sort(int x[]) {\n\t\tfor(int j=0;j<x.length;j++) {\n\t\t\tfor(int i=x.length-1;i>0;i--) {\n\t\t\t\tif(x[i]>x[i-1]) {\n\t\t\t\t\tint temp=x[i];\n\t\t\t\t\tx[i]=x[i-1];\n\t\t\t\t\tx[i-1]=temp;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tpublic static void main(String args[]) {\n\t\t\n\t\tinput();\n\t\tsort(a);\t\t\n\t\tif(a[0]>a[1]+a[2]+a[3])System.out.print(\"NO\");\n\t\telse if(a[0]==a[1]+a[2]+a[3])System.out.print(\"YES\");\n\t\telse if(a[0]<a[1]+a[2]+a[3]) {\n\t\t\tif(a[0]+a[3]>a[1]+a[2])System.out.print(\"NO\");\n\t\t\telse if(a[0]+a[3]<a[1]+a[2])System.out.print(\"NO\");\n\t\t\telse if(a[0]+a[3]==a[1]+a[2])System.out.print(\"YES\");\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "15e32b066540d016126119c61dac4a05", "src_uid": "5a623c49cf7effacfb58bc82f8eaff37", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.*;\nimport java.util.Collections;\nimport java.util.StringTokenizer;\n \npublic class Codeforces721A {\n \n\tpublic static void main(String[] args) {\n\t\tFastScanner sc=new FastScanner();\n\t\tint n = sc.nextInt();\n\t\tchar[] a = sc.next().toCharArray();\n\t\tint i = 0;\n\t\tArrayList<Integer> list = new ArrayList<>();\n\t\twhile(i < n) {\n\t\t\tint count = 0;\n\t\t\twhile(i < n && a[i] == 'B') {\n\t\t\t\tcount++;\n\t\t\t\ti++;\n\t\t\t}\n\t\t\tif(count != 0) {\n\t\t\t\tlist.add(count);\n\t\t\t}i++;\n\t\t}\n\t\tif(list.isEmpty())System.out.println(0);\n\t\telse {\n\t\t\tSystem.out.println(list.size());\n\t\t\tfor(int item : list) {\n\t\t\t\tSystem.out.print(item + \" \");\n\t\t\t}\n\t\t}\n\t\t\t\t\n\t}\n\t\n\tpublic void sort(int[] a) {\n\t\tArrayList<Integer> l=new ArrayList<>();\n\t\tfor (int i:a) l.add(i);\n\t\tCollections.sort(l);\n\t\tfor (int i=0; i<a.length; i++) a[i]=l.get(i);\n\t}\n\t\n\tstatic class FastScanner {\n\t\tBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st=new StringTokenizer(\"\");\n\t\t\n\t\tpublic String next() {\n\t\t\twhile (!st.hasMoreElements())\n\t\t\t\ttry {\n\t\t\t\t\tst=new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\t\t\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\t\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\t\n\t\tint[] readArray(int n) {\n\t\t\tint[] a=new int[n];\n\t\t\tfor (int i=0; i<n; i++) a[i]=nextInt();\n\t\t\treturn a;\n\t\t}\n\t}\n \n}\n\n\n\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "bf88647ba717ef213d886185dcf1ec58", "src_uid": "e4b3a2707ba080b93a152f4e6e983973", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "/**\n * Created by iainws on 27/06/15.\n */\n\nimport java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.InputStream;\n\npublic class KyoyaPhotoBooks {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReaderKyoyaPhotoBooks in = new InputReaderKyoyaPhotoBooks(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskKyoyaPhotoBooks solver = new TaskKyoyaPhotoBooks();\n solver.solve(1, in, out);\n out.close();\n }\n}\n\nclass TaskKyoyaPhotoBooks {\n public void solve(int taskNumber, InputReaderKyoyaPhotoBooks in, PrintWriter out) {\n String s = in.next();\n int cnt = 0;\n for(int i = 0; i <= s.length(); ++i){\n for(int j = 0; j < 26; ++j){\n cnt++;\n }\n }\n System.out.println(cnt - s.length());\n }\n}\n\nclass InputReaderKyoyaPhotoBooks {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReaderKyoyaPhotoBooks(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "strings"], "code_uid": "a148bda56338e5871c852e20c1f0a4f1", "src_uid": "556684d96d78264ad07c0cdd3b784bc9", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\tpublic static void main(String[] args) throws Exception {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tBufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out),8192*8);\n\t\tStringTokenizer s;\n\t\tSortedSet<Integer> ssx = new TreeSet<Integer>();\n\t\tSortedSet<Integer> ssy = new TreeSet<Integer>();\n\t\tIterator itx,ity;\n\t\tint x[],y[],t,midx,midy;\n\t\tx=new int[8];\n\t\ty=new int[8];\n\t\tboolean flag,fail=false;\n\t\tfor(t=0;t<8;t++) {\n\t\t\ts=new StringTokenizer(br.readLine());\n\t\t\tx[t]=Integer.parseInt(s.nextToken());\n\t\t\tssx.add(x[t]);\n\t\t\ty[t]=Integer.parseInt(s.nextToken());\n\t\t\tssy.add(y[t]);\n\t\t\tfor(int i=t-1;i>=0;i--) {\n\t\t\t\tif (x[i]==x[t]) \n\t\t\t\t\tif (y[i]==y[t]) {\n\t\t\t\t\t\tfail=true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t}\n\t\t\t\t\t\n\t\t\t\n\t\t}\n\t\tif (ssx.size() != 3 || ssy.size() != 3 || fail)\n\t\t\tbw.write(\"ugly\\n\");\n\t\telse {\n\t\t\titx=ssx.iterator();\n\t\t\tity=ssy.iterator();\n\t\t\titx.next();\n\t\t\tmidx=(Integer)itx.next();\n\t\t\tity.next();\n\t\t\tmidy=(Integer)ity.next();\n\t\t\tfor (t=0;t<8;t++)\n\t\t\t\tif (x[t]==midx && y[t]==midy)\n\t\t\t\t\tbreak;\n\t\t\tif (t<8) bw.write(\"ugly\\n\");\n\t\t\telse bw.write(\"respectable\\n\");\n\t\t}\n\t\tbw.flush();\n\t}\n}\n\n", "lang_cluster": "Java", "tags": ["sortings"], "code_uid": "37ca188c76ae308c2b0ca421116b562a", "src_uid": "f3c96123334534056f26b96f90886807", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\npublic class Solution {\n public static void main(String[] args)throws IOException{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n PrintWriter out = new PrintWriter(System.out,true);\n StringTokenizer st = new StringTokenizer(br.readLine());\n int n = Integer.parseInt(st.nextToken());\n int m = Integer.parseInt(st.nextToken());\n int count = 1,people=0;\n st = new StringTokenizer(br.readLine());\n int[] a = new int[n];\n for(int i =0;i<n;i++){\n a[i] = Integer.parseInt(st.nextToken());\n }\n for(int i =0;i<n;i++){\n if(people+a[i]<=m){\n people+=a[i];\n }\n else{\n count++;\n people= a[i];\n }\n \n }\n out.println(count);\n }\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "4028fb7b5a95118ba6cf70f327cb97be", "src_uid": "5c73d6e3770dff034d210cdd572ccf0f", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// package Ladder14;\n\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class CF388A {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int[] arr = new int[n];\n for (int i = 0; i < n; i++) {\n arr[i] = sc.nextInt();\n }\n Arrays.sort(arr);\n int s = 0;\n for(int i=0;i<n;i++){\n if(s * arr[i] + s <= i){\n s++;\n }\n }\n System.out.println(s);\n }\n}\n", "lang_cluster": "Java", "tags": ["sortings", "greedy"], "code_uid": "09c89d9fbe30cdb53bb370943b8476fb", "src_uid": "7c710ae68f27f140e7e03564492f7214", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Iterator;\nimport java.util.Set;\nimport java.util.StringTokenizer;\nimport java.util.TreeSet;\n\npublic class KSN {\n\n\tstatic PrintWriter out = new PrintWriter(System.out);\n\n\tstatic void input() throws IOException {\n\t\tReader.init(System.in);\n\t\tReader.delimiter = \" \";\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\t// TODO Auto-generated method stub\n\n\t\tinput();\n\t\tsolve();\n\t}\n\n\tstatic void solve() throws IOException {\n\n\t\tint n = Reader.nextInt();\n\t\tint a = Reader.nextInt();\n\n\t\tint ans = 1;\n\n\t\tif (a % 2 != 0)\n\t\t\tans += (a - 1) / 2;\n\n\t\telse\n\t\t\tans += (n - a) / 2;\n\n\t\tout.println(ans);\n\t\tout.flush();\n\t\tout.close();\n\n\t}\n\n\tstatic class Reader {\n\n\t\tstatic BufferedReader reader;\n\t\tstatic StringTokenizer tokenizer;\n\t\tstatic String delimiter = \" \";\n\n\t\tstatic void init(InputStream input) {\n\t\t\treader = new BufferedReader(new InputStreamReader(input));\n\t\t\ttokenizer = new StringTokenizer(\" \");\n\t\t}\n\n\t\tstatic String next() throws IOException {\n\t\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\n\t\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t\t}\n\t\t\treturn tokenizer.nextToken(delimiter);\n\t\t}\n\n\t\tstatic String nextLine() throws IOException {\n\t\t\treturn reader.readLine();\n\t\t}\n\n\t\tstatic char nextChar() throws IOException {\n\t\t\treturn (char) reader.read();\n\t\t}\n\n\t\tstatic int nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tstatic double nextDouble() throws IOException {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tstatic long nextLong() throws IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tstatic long[] nextLongArray(int n) throws IOException {\n\t\t\tlong[] arr = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tarr[i] = nextLong();\n\t\t\t}\n\n\t\t\treturn arr;\n\t\t}\n\n\t\tstatic int[] nextIntArray(int n) throws IOException {\n\t\t\tint[] arr = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tarr[i] = nextInt();\n\t\t\t}\n\t\t\treturn arr;\n\t\t}\n\n\t}\n\n}", "lang_cluster": "Java", "tags": ["math", "constructive algorithms"], "code_uid": "941ba7aa6a39aa8009752834c49d6497", "src_uid": "aa62dcdc47d0abbba7956284c1561de8", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.text.DecimalFormat;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.Comparator;\nimport java.util.StringTokenizer;\n\nimport static java.util.Comparator.reverseOrder;\n\npublic class Solutions {\n //SOLUTION BEGIN\n //Into the Hardware Mode\n void pre() throws Exception{}\n void solve(int TC) throws Exception {\n int n = ni();\n int[] coins = new int[]{100, 20, 10, 5, 1};\n int i = 0;\n int res = 0;\n while (i < coins.length){\n while (n >= coins[i]){\n n -= coins[i];\n res++;\n }\n i++;\n }\n p(res);\n p(\"\\n\");\n }\n\n\n //SOLUTION END\n void hold(boolean b)throws Exception{if(!b)throw new Exception(\"Hold right there, Sparky!\");}\n void exit(boolean b){if(!b)System.exit(0);}\n final long IINF = (long)1e15;\n final int INF = (int)1e9+2, MX = (int)2e6+5;\n DecimalFormat df = new DecimalFormat(\"0.00000000000\");\n double PI = 3.141592653589793238462643383279502884197169399, eps = 1e-8;\n static boolean multipleTC = true, memory = false, fileIO = false;\n FastReader in;PrintWriter out;\n void run() throws Exception{\n long ct = System.currentTimeMillis();\n if (fileIO) {\n in = new FastReader(\"\");\n out = new PrintWriter(\"\");\n } else {\n in = new FastReader();\n out = new PrintWriter(System.out);\n }\n //int T = (multipleTC) ? ni() : 1;\n pre();\n //for (int t = 1; t <= T; t++) solve(t);\n solve(0);\n out.flush();\n out.close();\n System.err.println(System.currentTimeMillis() - ct + \"ms\");\n }\n public static void main(String[] args) throws Exception{\n if(memory)new Thread(null, new Runnable() {public void run(){try{new Solutions().run();}catch(Exception e){e.printStackTrace();}}}, \"1\", 1 << 28).start();\n else new Solutions().run();\n }\n int[][] make(int n, int[] from, int[] to, int e, boolean f){\n int[][] g = new int[n][];int[]cnt = new int[n];\n for(int i = 0; i< e; i++){\n cnt[from[i]]++;\n if(f)cnt[to[i]]++;\n }\n for(int i = 0; i< n; i++)g[i] = new int[cnt[i]];\n for(int i = 0; i< e; i++){\n g[from[i]][--cnt[from[i]]] = to[i];\n if(f)g[to[i]][--cnt[to[i]]] = from[i];\n }\n return g;\n }\n int[][][] makeS(int n, int[] from, int[] to, boolean f){\n int[][][] g = new int[n][][];int[]cnt = new int[n];\n for(int i:from)cnt[i]++;if(f)for(int i:to)cnt[i]++;\n for(int i = 0; i< n; i++)g[i] = new int[cnt[i]][];\n for(int i = 0; i< from.length; i++){\n g[from[i]][--cnt[from[i]]] = new int[]{to[i], i};\n if(f)g[to[i]][--cnt[to[i]]] = new int[]{from[i], i};\n }\n return g;\n }\n int find(int[] set, int u){return set[u] = (set[u] == u?u:find(set, set[u]));}\n int digit(long s){int ans = 0;while(s>0){s/=10;ans++;}return ans;}\n long gcd(long a, long b){return (b==0)?a:gcd(b,a%b);}\n int gcd(int a, int b){return (b==0)?a:gcd(b,a%b);}\n int bit(long n){return (n==0)?0:(1+bit(n&(n-1)));}\n void p(Object o){out.print(o);}\n void pn(Object o){out.println(o);}\n void pni(Object o){out.println(o);out.flush();}\n String n()throws Exception{return in.next();}\n String nln()throws Exception{return in.nextLine();}\n int ni()throws Exception{return Integer.parseInt(in.next());}\n long nl()throws Exception{return Long.parseLong(in.next());}\n double nd()throws Exception{return Double.parseDouble(in.next());}\n\n class FastReader{\n BufferedReader br;\n StringTokenizer st;\n public FastReader(){\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n public FastReader(String s) throws Exception{\n br = new BufferedReader(new FileReader(s));\n }\n\n String next() throws Exception{\n while (st == null || !st.hasMoreElements()){\n try{\n st = new StringTokenizer(br.readLine());\n }catch (IOException e){\n throw new Exception(e.toString());\n }\n }\n return st.nextToken();\n }\n\n String nextLine() throws Exception{\n String str;\n try{\n str = br.readLine();\n }catch (IOException e){\n throw new Exception(e.toString());\n }\n return str;\n }\n }\n}", "lang_cluster": "Java", "tags": ["greedy", "dp"], "code_uid": "0bc3f1b1469be1ff806766845ea7e670", "src_uid": "8e81ad7110552c20297f08ad3e5f8ddc", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.math.BigInteger;\nimport java.math.RoundingMode;\nimport java.text.DecimalFormat;\nimport java.util.*;\nimport java.util.regex.Matcher;\nimport java.util.regex.Pattern;\n\nimport javax.net.ssl.SSLContext;\n\npublic class Main\n{ \n static long mod=(long)(1e+9) + 7; \n static int[] sieve;static int ans=0;\n static ArrayList<Integer> primes;\n \n \n public static double area(int x1, int y1, int x2, int y2,int x3, int y3)\n {\n return Math.abs((x1 * (y2 - y3) + x2 * (y3 - y1) + x3 * (y1 - y2)) / 2.0);\n }\n\n\npublic static int ch(square cor[], int x, int y)\n{\n int x1 = cor[0].x, y1 = cor[0].y, x2 = cor[1].x, y2 = cor[1].y;\n int x3 = cor[2].x, y3 = cor[2].y, x4 = cor[3].x, y4 = cor[3].y;\n\n double a = area(x1, y1, x2, y2, x3, y3) + area(x1, y1, x4, y4, x3, y3);\n \n double p = area(x, y, x1, y1, x2, y2);\n double q = area(x, y, x2, y2, x3, y3);\n double r = area(x, y, x3, y3, x4, y4);\n double s = area(x, y, x1, y1, x4, y4);\n\n if(a==(p+q+r+s)) return 1;\n return 0;\n }\n\n static class square\n {\n\t int x;int y;\n }\n \n public static void main(String[] args) throws java.lang.Exception\n {\t \t\n\t fast s = new fast();\n\t PrintWriter out=new PrintWriter(System.out);\n\t Scanner sc=new Scanner(System.in);\n\t StringBuilder final_ans = new StringBuilder(); \n\t \n\t square a[]=new square[4];\n\t square b[]=new square[4];\n\t \n\t for(int i=0;i<4;i++)\n\t {\n\t \t a[i]=new square();\n\t \t a[i].x=s.nextInt();\n\t \t a[i].y=s.nextInt();\n\t }\n\t \n\t for(int i=0;i<4;i++)\n\t {\n\t \t b[i]=new square();\n\t \t b[i].x=s.nextInt();\n\t \t b[i].y=s.nextInt();\n\t }\n\t \t\t\n\t for(int i = -100 ; i <= 100 ; i++)\n\t {\n\t \t\tfor(int j = -100 ; j <= 100 ; j++)\n\t \t\t{\n\t \t\t\tif(ch(a, i, j)==1 && ch(b, i, j)==1)\n\t \t\t\t{\n\t \t\t\t\tSystem.out.println(\"YES\");\n\t \t\t\t\treturn ;\n\t \t\t\t}\n\t \t\t}\n\t \t }\n\t \n\t System.out.println(\"NO\");\n }\n \n \n\n static class fast {\n\t\tprivate InputStream i;\n\t\tprivate byte[] buf = new byte[1024];\n\t\tprivate int curChar;\n\t\tprivate int numChars;\n\t\t\n\t\tpublic static void division(char ch[],int divisor)\n\t\t {\n\t\t\t int div=Character.getNumericValue(ch[0]); int mul=10;int remainder=0;\n\t\t\t StringBuilder quotient=new StringBuilder(\"\");\n\t\t\t for(int i=1;i<ch.length;i++)\n\t\t\t {\n\t\t\t\t div=div*mul+Character.getNumericValue(ch[i]);\t\n\t\t\t\t if(div<divisor) {quotient.append(\"0\");continue;}\n\t\t\t\t quotient.append(div/divisor);\n\t\t\t\t div=div%divisor;mul=10;\n\t\t\t\t \n\t\t\t } \n\t\t\t remainder=div;\n\t\t\t while(quotient.charAt(0)=='0')quotient.deleteCharAt(0);\t \n\t\t\t System.out.println(quotient+\" \"+remainder);\t \n\t\t }\n\t\t\n\t\tpublic static void sieve(int size)\n\t\t{\n\t\t\tsieve=new int[size+1];\n\t\t\tprimes=new ArrayList<Integer>();\n\t\t\tsieve[1]=1;\n\t\t\tfor(int i=2;i<=Math.sqrt(size);i++)\n\t\t\t{\n\t\t\t\tif(sieve[i]==0)\n\t\t\t\t {\n\t\t\t\t\tfor(int j=i*i;j<size;j+=i) sieve[j]=1;\n\t\t\t\t }\n\t\t\t}\n\t\t\t\n\t\t\tfor(int i=2;i<=size;i++)\n\t\t\t{\n\t\t\t\tif(sieve[i]==0) primes.add(i);\n\t\t\t}\n\t\t}\n\t\tpublic static long pow(long n, int b, long MOD)\n\t\t {\n\t\t long x=1;long y=n; \n\t\t while(b > 0)\n\t\t {\n\t\t if(b%2 == 1)\n\t\t {\n\t\t x=x*y;\n\t\t if(x>MOD) x=x%(MOD);\n\t\t }\n\t\t y = y*y;\n\t\t if(y>MOD) y=y%(MOD); \n\t\t b >>= 1;\n\t\t }\n\t\t return x;\n\t\t }\n\n\t\t\n\t\t public static int lower(Integer[] a,int start,int end,int key)\n\t\t {\n\t\t\t int mid=(start+end)>>1;\n\t\t\t if(start==end && a[mid]<key) {return -1;}\n\t\t\t if(start>end) return -1;\n\n\t\t\t if(a[mid]>=key && (((mid-1)>=0 && a[mid-1]<key) || (mid-1)==0)) return mid;\n\t\t\t else if(a[mid]== key && (mid-1)>=0 && a[mid-1]==key) return lower(a,start,mid-1,key); \n\t\t\t else if(key>a[mid]) return lower(a,mid+1,end,key);\n\t\t\t else return lower(a,start,mid-1,key);\n\t\t}\n\t\t \n\t\t public static int upper(Integer a[],int start,int end,int key)\n\t\t {\n\t\t\t int mid=(start+end)>>1;\n\t\t\t if(start==end && a[mid]>key) {return -1;}\n\t\t\t if(start>end) return -1;\n\n\t\t\t if(a[mid]<=key && (((mid+1)<a.length && a[mid+1]>key) || (mid+1)==a.length)) return mid;\n\t\t\t else if(a[mid]== key && (mid+1)<a.length && a[mid+1]==key) return upper(a,mid+1,end,key); \n\t\t\t else if(key>=a[mid]) return upper(a,mid+1,end,key);\n\t\t\t else return upper(a,start,mid-1,key);\n\t\t} \n\t\t \n\t\tpublic int gcd(int a,int b)\n\t\t{\n\t\t\tif(a==0) return b;\n\t\t\treturn gcd(b%a,a);\n\t\t}\n\t\tpublic fast() {\n\t\t\tthis(System.in);\n\t\t}\n\t\tpublic fast(InputStream is) {\n\t\t\ti = is;\n\t\t}\n\t\tpublic int read() {\n\t\t\tif (numChars == -1)\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tif (curChar >= numChars) {\n\t\t\t\tcurChar = 0;\n\t\t\t\ttry {\n\t\t\t\t\tnumChars = i.read(buf);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (numChars <= 0)\n\t\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn buf[curChar++];\n\t\t}\n\t\tpublic String nextLine() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo {\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t} while (!isEndOfLine(c));\n\t\t\treturn res.toString();\n\t\t}\n\t\tpublic String nextString() {\n \t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo {\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res.toString();\n\t\t}\n\t\tpublic long nextLong() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-') {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res * sgn;\n\t\t}\n\t\tpublic int nextInt() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-') {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res * sgn;\n\t\t}\n\t\tpublic boolean isSpaceChar(int c) {\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n\t\tpublic boolean isEndOfLine(int c) {\n\t\t\treturn c == '\\n' || c == '\\r' || c == -1;\n\t\t}\n\n\t}\t\n}\n \n \n \n \n\n\n\n", "lang_cluster": "Java", "tags": ["brute force"], "code_uid": "2bb1d00412870040e0e385038dc89327", "src_uid": "f6a3dd8b3bab58ff66055c61ddfdf06a", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\npublic class DoubleCola {\n\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner (System.in) ;\n\t\twhile (sc.hasNext())\n\t\t{\n\t\t\tint n = sc.nextInt() ;\n\t\t\tint m = 5 ;\n\t\t\tint counter = 1 ;\n\t\t\tString s =\"\" ;\n\t\tif (n < 5) {\n\t\t\tif (n == 1) {\n\t\t\t\ts = \"Sheldon\" ;\n\t\t\t}else{\n\t\t\t\tif (n == 2) {\n\t\t\t\t\ts = \"Leonard\" ;\n\t\t\t\t}else{\n\t\t\t\t\tif (n == 3) {\n\t\t\t\t\t\ts = \"Penny\" ;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tif (n == 4) s = \"Rajesh\" ;\n\t\t\t\t\t\telse{\n\t\t\t\t\t\t\ts = \"Howard \" ;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}else{\n\t\t\tfor (int i = 0; n > m*counter; i++) {\n\t\t\t\tn -= m*counter ;\n\t\t\t\t//System.out.println(m +\" * \" + counter + \" = \" +n);\n\t\t\t\tcounter *= 2 ;\n\t\t\t}\n\t\t\t/**\n\t\t\tif (counter == 2) counter = 1;\n\t\t\telse{\n\t\t\t\tif (counter != 1) counter -= 2 ;\n\t\t\t//\telse counter -- ;\n\t\t\t}\n\t\t\t*/\n\t\t\tint help = 0 ;\n\t\t\tfor (int i = 1; n > counter && counter != 0; i++) {\n\t\t\t\tn -= counter ;\n\t\t\t\thelp = i ;\n\t\t\t}\n\t\t\tif (help == 0) {\n\t\t\t\ts = \"Sheldon\" ;\n\t\t\t}else{\n\t\t\t\tif (help == 1) {\n\t\t\t\t\ts = \"Leonard\" ;\n\t\t\t\t}else{\n\t\t\t\t\tif (help == 2) {\n\t\t\t\t\t\ts = \"Penny\" ;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tif (help == 3 ) s = \"Rajesh \" ;\n\t\t\t\t\t\telse s = \"Howard\" ;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (counter == 0) s = \"Sheldon\" ;\n\t\t }\n\t\t\tSystem.out.println(s);\n\t\t}\n\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "2748b5d98b02fd596a29fde290d14bdc", "src_uid": "023b169765e81d896cdc1184e5a82b22", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "\nimport java.io.*;\nimport java.util.*;\nimport static java.lang.Math.*;\n\npublic class BetaRound70_C implements Runnable {\n\n final boolean ONLINE_JUDGE = System.getProperty(\"ONLINE_JUDGE\") != null;\n BufferedReader in;\n PrintWriter out;\n StringTokenizer tok = new StringTokenizer(\"\");\n\n void init() throws IOException {\n if (ONLINE_JUDGE) {\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n } else {\n in = new BufferedReader(new FileReader(\"input.txt\"));\n out = new PrintWriter(\"output.txt\");\n }\n }\n\n String readString() throws IOException {\n while (!tok.hasMoreTokens()) {\n tok = new StringTokenizer(in.readLine());\n }\n return tok.nextToken();\n }\n\n int readInt() throws IOException {\n return Integer.parseInt(readString());\n }\n\n @Override\n public void run() {\n try {\n long t1 = System.currentTimeMillis();\n init();\n Locale.setDefault(Locale.US);\n solve();\n out.close();\n long t2 = System.currentTimeMillis();\n System.err.println(\"Time = \" + (t2 - t1));\n } catch (Exception e) {\n e.printStackTrace(System.err);\n System.exit(-1);\n }\n }\n\n public static void main(String[] args) {\n new Thread(new BetaRound70_C()).start();\n }\n \n void solve() throws IOException {\n long m = readInt();\n long n = readInt();\n long k = readInt();\n if (m % 2 == 0) {\n out.print(\"Marsel\");\n return;\n }\n if (n == 1) {\n out.print(\"Marsel\");\n return;\n }\n// boolean[] p = new boolean[1000*100+1];\n// Arrays.fill(p, true);\n// p[0]=p[1]=false;\n// for (long i = 2; i <= 1000*100; i++) {\n// if (p[(int)i]) {\n// for (long j = i*i; j <= 1000*100; j+=i) {\n// p[(int)j] = false;\n// }\n// }\n// }\n \n boolean prime = true;\n for (int i = 2; i*i <= n; i++) {\n if (n%i==0) {\n if (n/i < k) {\n out.print(\"Marsel\");\n return;\n }\n prime = false;\n break;\n }\n }\n \n if (prime) {\n if (k == 1) {\n out.print(\"Timur\");\n return;\n } else {\n out.print(\"Marsel\");\n return;\n }\n }\n \n out.print(\"Timur\");\n// if (n % 2 == 0) {\n// out.print(\"Timur\");\n// return;\n// } else {\n// out.print(\"Marsel\");\n// return;\n// }\n }\n \n}\n", "lang_cluster": "Java", "tags": ["dp", "number theory", "games"], "code_uid": "862cbb30a8a48c0cd3857afb4deaaae5", "src_uid": "4a3767011ddac874efa021fff7c94432", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tScanner sc = new Scanner(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\n\t\tint a = sc.nextInt(), b = sc.nextInt();\n\t\tchar[] s = sc.next().toCharArray();\n\t\tint Tx = 0, Ty = 0;\n\t\tfor(char c: s)\n\t\t\tif(c == 'U')\n\t\t\t\t++Ty;\n\t\t\telse if(c == 'D')\n\t\t\t\t--Ty;\n\t\t\telse if(c == 'R')\n\t\t\t\t++Tx;\n\t\t\telse\n\t\t\t\t--Tx;\n\t\tint px = 0, py = 0;\n\t\tboolean yes = check(a, b, Tx, Ty, px, py);\n\t\tfor(char c: s)\n\t\t{\n\t\t\tif(c == 'U')\n\t\t\t\t++py;\n\t\t\telse if(c == 'D')\n\t\t\t\t--py;\n\t\t\telse if(c == 'R')\n\t\t\t\t++px;\n\t\t\telse\n\t\t\t\t--px;\n\t\t\tyes |= check(a, b, Tx, Ty, px, py);\n\t\t}\n\t\tout.println(yes ? \"Yes\" : \"No\");\n\t\tout.flush();\n\t\tout.close();\n\t}\n\t\n\tstatic boolean check(int a, int b, int tx, int ty, int px, int py)\n\t{\n\t\tint lx = check(a - px, tx), ly = check(b - py, ty);\n\t\tif(lx == -2 || ly == -2)\n\t\t\treturn false;\n\t\treturn lx == -1 || ly == -1 || lx == ly;\n\t}\n\t\n\tstatic int check(int c, int t)\n\t{\n\t\tif(t == 0)\n\t\t\treturn c == 0 ? -1 : -2;\n\t\treturn 1l * c * t >= 0 && c % t == 0 ? c / t : -2;\n\t}\n\t\n\tstatic class Scanner \n\t{\n\t\tStringTokenizer st;\n\t\tBufferedReader br;\n\n\t\tpublic Scanner(InputStream s){\tbr = new BufferedReader(new InputStreamReader(s));}\n\n\t\tpublic String next() throws IOException \n\t\t{\n\t\t\twhile (st == null || !st.hasMoreTokens()) \n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {return Integer.parseInt(next());}\n\n\t\tpublic long nextLong() throws IOException {return Long.parseLong(next());}\n\n\t\tpublic String nextLine() throws IOException {return br.readLine();}\n\n\t\tpublic double nextDouble() throws IOException { return Double.parseDouble(next()); }\n\n\t\tpublic boolean ready() throws IOException {return br.ready();} \n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation", "binary search"], "code_uid": "ac8f355dc4dc7cab24077371672cbef3", "src_uid": "5d6212e28c7942e9ff4d096938b782bf", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/*\n * Author- Naitik Dodia\n * BTech 3rd Year DAIICT\n */\n \nimport java.io.*;\n\nimport java.math.*;\nimport java.util.*;\nimport javax.print.attribute.SetOfIntegerSyntax;\n \npublic class Solution {\n\tprivate static InputStream stream;\n\tprivate static byte[] buf = new byte[1024];\n\tprivate static int curChar;\n\tprivate static int numChars;\n\tprivate static SpaceCharFilter filter;\n\tprivate static PrintWriter pw;\n\tprivate static long count = 0,mod=1000000007;\n\tprivate static TreeSet<Integer>ts[]=new TreeSet[200000];\n \n\tpublic static void main(String args[]) throws Exception {\n\t\tInputReader(System.in);\n\t\tpw = new PrintWriter(System.out);\n\t\tsoln();\n\t\tpw.close();\n\t}\n\tprivate static boolean visited[];\n\tprivate static int par[];\n\tprivate static LinkedList<Integer>[] adj;\n\tprivate static void dfs(int start,int root) {\n\t\tvisited[start]=true;\n\t\tpar[start]=root;\n\t\tfor(int i:adj[start]) {\n\t\t\tif(!visited[i]) {\n\t\t\t\tdfs(i,start);\n\t\t\t}\n\t\t}\n\t}\n\tprivate static void soln(){\n\t\tint a=nextInt(),b=nextInt(),x=nextInt(),y=nextInt(),z=nextInt();\n\t\tlong ans=0;\n\t\tif((long)a<2*(long)x) {\n\t\t\tans+=2*(long)x-a;\n\t\t\ta=0;\n\t\t\t//pw.println(\"1 \"+ans);\n\t\t}else {\n\t\t\ta=a-2*x;\n\t\t}\n\t\tif((long)b<3*(long)z) {\n\t\t\tans+=3*(long)z-b;\n\t\t\tb=0;\n\t\t\t//pw.println(\"2 \"+ans);\n\t\t}else {\n\t\t\tb=b-3*z;\n\t\t}\n\t\tif(a<b) {\n\t\t\ty=y-a>0?y-a:0;\n\t\t\tb=b-a;\n\t\t\ta=0;\n\t\t}else {\n\t\t\ty=y-b>0?y-b:0;\n\t\t\tb=a-b;\n\t\t\ta=0;\n\t\t}\n\t\tif(y>b) {\n\t\t\tans+=b+2*(y-b);\n\t\t\t//pw.println(\"3 \"+ans);\n\t\t}else{\n\t\t\tans+=y;\n\t\t\t//pw.println(ans);\n\t\t}\n\t\tpw.println(ans);\n\t}\n\t\n\tpublic static int bfsPair(int[][] arr,boolean[][] visited,int x1,int y1,int x2,int y2) {\n\t\tQueue<Pair> q=new LinkedList<Pair>();\n\t\tvisited[x1][y1]=true;\n\t\tint level = 1;\n\t\tint increamenter=0;\n\t\tif(x1-1>=0)\n\t\tif(arr[x1-1][y1]==1) increamenter++;\n\t\tif(y1-1>=0)\n\t\tif(arr[x1][y1-1]==1) increamenter++;\n\t\tif(y1+1<arr[1].length)\n\t\tif(arr[x1][y1+1]==1) increamenter++;\n\t\tif(x1+1<arr.length)\n\t\tif(arr[x1+1][y1]==1) increamenter++;\n\t\t\n\t\tq.add(new Pair(x1,y1));\n\t\tint i=0;\n\t\twhile(!q.isEmpty()) {\n\t\t\tPair p=q.poll();\n\t\t\t//increamenter--;\n\t\t\tint x=p.idx,y=p.val;\n\t\t\tif(x-1>=0 && y>=0 && x-1<arr.length && y<arr[1].length) {\n\t\t\t\tif(!visited[x-1][y] && arr[x-1][y]==1)\n\t\t\t\tq.add(new Pair(x-1,y));\n\t\t\t\tvisited[x-1][y]=true;\n\t\t\t}\n\t\t\tif(x>=0 && y-1>=0 && x<arr.length && y-1<arr[1].length) {\n\t\t\t\tif(!visited[x][y-1] && arr[x][y-1]==1)\n\t\t\t\tq.add(new Pair(x,y-1));\n\t\t\t\tvisited[x][y-1]=true;\n\t\t\t}\n\t\t\tif(x>=0 && y+1>=0 && x<arr.length && y+1<arr[1].length) {\n\t\t\t\tif(!visited[x][y+1] && arr[x][y+1]==1)\n\t\t\t\tq.add(new Pair(x,y+1));\n\t\t\t\tvisited[x][y+1]=true;\n\t\t\t}\n\t\t\tif(x+1>=0 && y>=0 && x+1<arr.length && y<arr[1].length) {\n\t\t\t\tif(!visited[x+1][y] && arr[x+1][y]==1)\n\t\t\t\tq.add(new Pair(x+1,y));\n\t\t\t\tvisited[x+1][y]=true;\n\t\t\t}\n\t\t\tif(x==x2 && y==y2) return level;//pw.println(x+\" \"+y+\" \"+level+\" \"+increamenter);\n\t\t\tif(increamenter==0) {\n\t\t\t\tlevel++;\n\t\t\t\tincreamenter=q.size();\n\t\t\t\t\n\t\t\t}\n\t\t\tincreamenter--;\n\t\t}\n\t\treturn -1;\n\t}\n\t\n\tpublic static void bfs(ArrayList<Integer>[] gp, int s,boolean[] visited,int[] dist){\n\t\tQueue<Integer> qu=new LinkedList<Integer>();\n\t\tint level = 1;\n\t\tint increamenter;\n\t\tif(gp[s]!=null)\n\t\tincreamenter=gp[s].size()+1;\n\t\telse return;\n\t\tvisited[s]=true;\n\t\tqu.add(s);\n\t\twhile(!qu.isEmpty()){\n\t\t\tint temp=qu.poll();\n\t\t\t//visited[temp]=true;\n\t\t\tincreamenter--;\n\t\t\tdist[temp]=level*6;\n\t\t\tfor(int i=0;i<gp[temp].size();i++){\n\t\t\t\tif(!visited[gp[temp].get(i)]){\n\t\t\t\t\t//increamenter--;\n\t\t\t\t\t//pw.println(increamenter);\n\t\t\t\t\tvisited[gp[temp].get(i)]=true;\n\t\t\t\t\tqu.add(gp[temp].get(i));\n\t\t\t\t\t//dist[gp[temp].get(i)]=level*6;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(increamenter==0){\n\t\t\t\tlevel++;\n\t\t\t\tincreamenter=qu.size();\n\t\t\t\t//pw.println(\"increamenter change at: \"+qu.size()+\"with level\"+level);\n\t\t\t}\n\t\t\t\n\t\t}\n\t}\n\tstatic int maxSubArraySum(int a[])\n {\n int size = a.length;\n int max_so_far = Integer.MIN_VALUE, max_ending_here = 0;\n \n for (int i = 0; i < size; i++)\n {\n max_ending_here = max_ending_here + a[i];\n if (max_so_far < max_ending_here)\n max_so_far = max_ending_here;\n if (max_ending_here < 0)\n max_ending_here = 0;\n }\n return max_so_far;\n }\n\tpublic static ArrayList<Integer> allprime(int n){\n\t\tArrayList<Integer> arr=new ArrayList<Integer>();\n\t\tarr.add(2);\n\t\tfor(int i=3;i<n;i=i+2){\n\t\t\tint flag=0;\n\t\t\tfor(int j=0;j<arr.size();j++){\n\t\t\t\tif(i%arr.get(j)==0) {flag=1;break;}\n\t\t\t}\n\t\t\tif(flag==0) arr.add(i);\n\t\t}\n\t\treturn arr;\n\t}\n\tpublic static int fact(int n){\n\t\tint ans=1;\n\t\tfor(int i=1;i<=n;i++) ans=(ans*i)%1000000007;\n\t\treturn ans;\n\t}\n\tstatic class Pair implements Comparable<Pair>{\n\t\t \n\t\tint idx,val;\n\t\tPair(int idx,int val){\n\t\t\tthis.idx=idx;\n\t\t\tthis.val=val;\n\t\t}\n\t\t@Override\n\t\tpublic int compareTo(Pair o) {\n\t\t\t// TODO Auto-generated method stub\n\t\t//\tSort in increasing order\n \n\t\t\n\t\t\tif(o.val<val){\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\tif(o.val==val){\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\telse{\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t}\t\t\n\t\t@Override\n\t\tpublic String toString(){\n\t\t\treturn \"idx: \"+Integer.toString(idx)+\" val: \"+Integer.toString(val);\n\t\t}\n\t}\n\tpublic static long gcd(long x, long y) {\n\t\tif (x % y == 0)\n\t\t\treturn y;\n\t\telse\n\t\t\treturn gcd(y, x % y);\n\t}\n\tprivate static int BinarySearch(int a[], int low, int high, int target) {\n\t\tif (low > high)\n\t\t\treturn -1;\n\t\tint mid = low + (high - low) / 2;\n\t\tif (a[mid] == target)\n\t\t\treturn mid;\n\t\tif (a[mid] > target)\n\t\t\thigh = mid - 1;\n\t\tif (a[mid] < target)\n\t\t\tlow = mid + 1;\n\t\treturn BinarySearch(a, low, high, target);\n\t}\n\t\n\tpublic static String reverseString(String s) {\n\t\tStringBuilder sb = new StringBuilder(s);\n\t\tsb.reverse();\n\t\treturn (sb.toString());\n\t}\n\tpublic static long pow(long n, long p, long m) {\n\t\tlong result = 1;\n\t\tif (p == 0)\n\t\t\treturn 1;\n\t\tif (p == 1)\n\t\t\treturn n;\n\t\twhile (p != 0) {\n\t\t\tif (p % 2 == 1)\n\t\t\t\tresult *= n;\n\t\t\tif (result >= m)\n\t\t\t\tresult %= m;\n\t\t\tp >>= 1;\n\t\t\tn *= n;\n\t\t\tif (n >= m)\n\t\t\t\tn %= m;\n\t\t}\n\t\treturn result;\n\t}\n\tpublic static long pow(long n, long p) {\n\t\tlong result = 1;\n\t\tif (p == 0)\n\t\t\treturn 1;\n\t\tif (p == 1)\n\t\t\treturn n;\n\t\twhile (p != 0) {\n\t\t\tif (p % 2 == 1)\n\t\t\t\tresult *= n;\n\t\t\tp >>= 1;\n\t\t\tn *= n;\n\t\t}\n\t\treturn result;\n\t}\n\tpublic static int[] radixSort(int[] f) {\n\t\tint[] to = new int[f.length];\n\t\t{\n\t\t\tint[] b = new int[65537];\n\t\t\tfor (int i = 0; i < f.length; i++)\n\t\t\t\tb[1 + (f[i] & 0xffff)]++;\n\t\t\tfor (int i = 1; i <= 65536; i++)\n\t\t\t\tb[i] += b[i - 1];\n\t\t\tfor (int i = 0; i < f.length; i++)\n\t\t\t\tto[b[f[i] & 0xffff]++] = f[i];\n\t\t\tint[] d = f;\n\t\t\tf = to;\n\t\t\tto = d;\n\t\t}\n\t\t{\n\t\t\tint[] b = new int[65537];\n\t\t\tfor (int i = 0; i < f.length; i++)\n\t\t\t\tb[1 + (f[i] >>> 16)]++;\n\t\t\tfor (int i = 1; i <= 65536; i++)\n\t\t\t\tb[i] += b[i - 1];\n\t\t\tfor (int i = 0; i < f.length; i++)\n\t\t\t\tto[b[f[i] >>> 16]++] = f[i];\n\t\t\tint[] d = f;\n\t\t\tf = to;\n\t\t\tto = d;\n\t\t}\n\t\treturn f;\n\t}\n\tpublic static int nextPowerOf2(final int a) {\n\t\tint b = 1;\n\t\twhile (b < a) {\n\t\t\tb = b << 1;\n\t\t}\n\t\treturn b;\n\t}\n\tpublic static boolean PointInTriangle(int p1, int p2, int p3, int p4, int p5, int p6, int p7, int p8) {\n\t\tint s = p2 * p5 - p1 * p6 + (p6 - p2) * p7 + (p1 - p5) * p8;\n\t\tint t = p1 * p4 - p2 * p3 + (p2 - p4) * p7 + (p3 - p1) * p8;\n \n\t\tif ((s < 0) != (t < 0))\n\t\t\treturn false;\n \n\t\tint A = -p4 * p5 + p2 * (p5 - p3) + p1 * (p4 - p6) + p3 * p6;\n\t\tif (A < 0.0) {\n\t\t\ts = -s;\n\t\t\tt = -t;\n\t\t\tA = -A;\n\t\t}\n\t\treturn s > 0 && t > 0 && (s + t) <= A;\n\t}\n\tpublic static float area(int x1, int y1, int x2, int y2, int x3, int y3) {\n\t\treturn (float) Math.abs((x1 * (y2 - y3) + x2 * (y3 - y1) + x3 * (y1 - y2)) / 2.0);\n\t}\n \n\tpublic static boolean isPrime(int n) {\n\t\t// Corner cases\n\t\tif (n <= 1)\n\t\t\treturn false;\n\t\tif (n <= 3)\n\t\t\treturn true;\n \n\t\t// This is checked so that we can skip \n\t\t// middle five numbers in below loop\n\t\tif (n % 2 == 0 || n % 3 == 0)\n\t\t\treturn false;\n \n\t\tfor (int i = 5; i * i <= n; i = i + 6)\n\t\t\tif (n % i == 0 || n % (i + 2) == 0)\n\t\t\t\treturn false;\n \n\t\treturn true;\n\t}\n \n\t//merge Sort\n \n\tstatic long sort(int a[])\n\t{ int n=a.length;\n\t\tint b[]=new int[n];\t\n\t\treturn mergeSort(a,b,0,n-1);}\n\tstatic long mergeSort(int a[],int b[],long left,long right)\n\t{ long c=0;if(left<right)\n\t { long mid=left+(right-left)/2;\n\t\t c= mergeSort(a,b,left,mid);\n\t\t c+=mergeSort(a,b,mid+1,right);\n\t\t c+=merge(a,b,left,mid+1,right); }\t\n\t\treturn c;\t }\n\tstatic long merge(int a[],int b[],long left,long mid,long right)\n\t{long c=0;int i=(int)left;int j=(int)mid; int k=(int)left;\n\twhile(i<=(int)mid-1&&j<=(int)right)\n\t{ if(a[i]>a[j]) {b[k++]=a[i++]; }\n\telse\t{ b[k++]=a[j++];c+=mid-i;}}\n\twhile (i <= (int)mid - 1) b[k++] = a[i++]; \n\twhile (j <= (int)right) b[k++] = a[j++];\n\tfor (i=(int)left; i <= (int)right; i++) \n\t\ta[i] = b[i]; return c; }\n\n\t// To Get Input\n\t// Some Buffer Methods\n \n\tpublic static void InputReader(InputStream stream1) {\n\t\tstream = stream1;\n\t}\n \n\tprivate static boolean isWhitespace(int c) {\n\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t}\n \n\tprivate static boolean isEndOfLine(int c) {\n\t\treturn c == '\\n' || c == '\\r' || c == -1;\n\t}\n \n\tprivate static int read() {\n\t\tif (numChars == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (curChar >= numChars) {\n\t\t\tcurChar = 0;\n\t\t\ttry {\n\t\t\t\tnumChars = stream.read(buf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (numChars <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buf[curChar++];\n\t}\n \n\tprivate static int nextInt() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tint res = 0;\n\t\tdo {\n\t\t\tif (c < '0' || c > '9')\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n \n\tprivate static long nextLong() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tlong res = 0;\n\t\tdo {\n\t\t\tif (c < '0' || c > '9')\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n \n\tprivate static String nextToken() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tStringBuilder res = new StringBuilder();\n\t\tdo {\n\t\t\tres.appendCodePoint(c);\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res.toString();\n\t}\n \n\tprivate static String nextLine() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tStringBuilder res = new StringBuilder();\n\t\tdo {\n\t\t\tres.appendCodePoint(c);\n\t\t\tc = read();\n\t\t} while (!isEndOfLine(c));\n\t\treturn res.toString();\n\t}\n \n\tprivate static int[] nextIntArray(int n) {\n\t\tint[] arr = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tarr[i] = nextInt();\n\t\t}\n\t\treturn arr;\n\t}\n \n\tprivate static int[][] next2dArray(int n, int m) {\n\t\tint[][] arr = new int[n][m];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tarr[i][j] = nextInt();\n\t\t\t}\n\t\t}\n\t\treturn arr;\n\t}\n \n\tprivate static long[] nextLongArray(int n) {\n\t\tlong[] arr = new long[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tarr[i] = nextLong();\n\t\t}\n\t\treturn arr;\n\t}\n \n\tprivate static void pArray(int[] arr) {\n\t\tfor (int i = 0; i < arr.length; i++) {\n\t\t\tpw.print(arr[i] + \" \");\n\t\t}\n\t\tpw.println();\n\t\treturn;\n\t}\n \n\tprivate static void pArray(long[] arr) {\n\t\tfor (int i = 0; i < arr.length; i++) {\n\t\t\tpw.print(arr[i] + \" \");\n\t\t}\n\t\tpw.println();\n\t\treturn;\n\t}\n \n\tprivate static void pArray(boolean[] arr) {\n\t\tfor (int i = 0; i < arr.length; i++) {\n\t\t\tpw.print(arr[i] + \" \");\n\t\t}\n\t\tpw.println();\n\t\treturn;\n\t}\n \n\tprivate static boolean isSpaceChar(int c) {\n\t\tif (filter != null)\n\t\t\treturn filter.isSpaceChar(c);\n\t\treturn isWhitespace(c);\n\t}\n \n\tprivate interface SpaceCharFilter {\n\t\tpublic boolean isSpaceChar(int ch);\n\t}\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "66acc67c05b74a5b88746e850c36ef0e", "src_uid": "35202a4601a03d25e18dda1539c5beba", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class File1{\n\tpublic static void main(String[] args){\n\t\tScanner in = new Scanner(System.in);\n\t\tint n = in.nextInt();\n\t\tint x1 = in.nextInt();\n\t\tint y1 = in.nextInt();\n\t\tint x2 = in.nextInt();\n\t\tint y2 = in.nextInt();\n\t\tif(x1==0&&x2==0)\n\t\t\tSystem.out.println(Math.abs(y2-y1));\n\t\telse if(x1==0&&x2==n)\n\t\t\tSystem.out.println(n+Math.min(y1+y2,2*n-y1-y2));\n\t\telse if(x1==0&&y2==0)\n\t\t\tSystem.out.println(y1+x2);\n\t\telse if(x1==0&&y2==n)\n\t\t\tSystem.out.println(n-y1+x2);\n\t\telse if(x1==n&&x2==n)\n\t\t\tSystem.out.println(Math.abs(y2-y1));\n\t\telse if(x1==n&&x2==0)\n\t\t\tSystem.out.println(n+Math.min(y1+y2, 2*n-y1-y2));\n\t\telse if(x1==n&&y2==0)\n\t\t\tSystem.out.println(n-x2+y1);\n\t\telse if(x1==n&&y2==n)\n\t\t\tSystem.out.println(2*n-y1-x2);\n\t\telse if(y1==0&&y2==0)\n\t\t\tSystem.out.println(Math.abs(x2-x1));\n\t\telse if(y1==0&&y2==n)\n\t\t\tSystem.out.println(n+Math.min(x1+x2,2*n-x1-x2));\n\t\telse if(y1==0&&x2==0)\n\t\t\tSystem.out.println(y2+x1);\n\t\telse if(y1==0&&x2==n)\n\t\t\tSystem.out.println(n-x1+y2);\n\t\telse if(x2==0)\n\t\t\tSystem.out.println(n-y2+x1);\n\t\telse if(x2==n)\n\t\t\tSystem.out.println(2*n-y2-x1);\n\t\telse if(y2==n)\n\t\t\tSystem.out.println(Math.abs(x2-x1));\n\t\telse System.out.println(n+Math.min(2*n-x1-x2,x1+x2));\n\t}\n}", "lang_cluster": "Java", "tags": ["dfs and similar", "greedy", "implementation"], "code_uid": "d05fe9395b4d22aac41a3f6b02b9d29e", "src_uid": "685fe16c217b5b71eafdb4198822250e", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.StringTokenizer;\n\npublic class A {\n\n public static void main(String[] args) throws Exception {\n Scanner sc = new Scanner(System.in);\n PrintWriter out = new PrintWriter(System.out);\n int n = sc.nextInt();\n char[] a = sc.next().toCharArray();\n List<Character> list = new ArrayList<>();\n for (char c : a) list.add(c);\n while (true) {\n int max = 0, maxIdx = -1;\n for (int i = 0; i < list.size(); i++) {\n if ((i > 0 && list.get(i) == list.get(i - 1) + 1 || i < list.size() - 1 && list.get(i) == list.get(i + 1) + 1) && list.get(i) > max) {\n max = list.get(i);\n maxIdx = i;\n }\n }\n if (maxIdx == -1) break;\n List<Character> newList = new ArrayList<>();\n for (int i = 0; i < list.size(); i++) {\n if (i != maxIdx) {\n newList.add(list.get(i));\n }\n }\n list = newList;\n }\n out.println(a.length - list.size());\n out.flush();\n out.close();\n }\n\n static class Scanner\n {\n StringTokenizer st;\n BufferedReader br;\n\n public Scanner(InputStream system) {br = new BufferedReader(new InputStreamReader(system));}\n public Scanner(String file) throws Exception {br = new BufferedReader(new FileReader(file));}\n public String next() throws IOException\n {\n while (st == null || !st.hasMoreTokens()) st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n public String nextLine()throws IOException{return br.readLine();}\n public int nextInt() throws IOException {return Integer.parseInt(next());}\n public double nextDouble() throws IOException {return Double.parseDouble(next());}\n public char nextChar()throws IOException{return next().charAt(0);}\n public Long nextLong()throws IOException{return Long.parseLong(next());}\n public boolean ready() throws IOException{return br.ready();}\n public void waitForInput() throws InterruptedException {Thread.sleep(3000);}\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "greedy", "strings", "constructive algorithms"], "code_uid": "6322ebb0db9b4718b97c3b5378e8975c", "src_uid": "9ce37bc2d361f5bb8a0568fb479b8a38", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java .util.Scanner ;\nimport java.util.*;\nimport java.math.BigInteger;\nimport java.nio.IntBuffer;\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\n//import java.io.OutputStreamReader;\nimport java.io.PrintWriter;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\nimport java.lang.Math;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.InputMismatchException;\n\n\npublic class cf2{\n public static void main(final String[] args) throws IOException { \n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter w = new PrintWriter(outputStream);\n\n int n =in.nextInt();\n if(n>=0){\n System.out.println(n);\n }\n else {\n int lastd=n%10;\n if(lastd==0){\n String str =Integer.toString(n);\n int m=str.length();\n str=str.substring(0, m-2)+str.substring(m-1);\n int a=Integer.parseInt(str);\n System.out.println(a);\n }\n else {\n String str=Integer.toString(n);\n int m=str.length();\n String x=str.substring(m-2,m-1);\n int g=Integer.parseInt(x);\n String y=str.substring(m-1);\n int h=Integer.parseInt(y);\n\n if(g<h){\n str=str.substring(0, m-1);\n System.out.println(str);\n }\n else{\n str=str.substring(0,m-2)+str.substring(m-1);\n System.out.println(str);\n }\n }\n }\n }\n}\n \nclass InputReader {\n private final InputStream stream;\n private final byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n private final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n public InputReader(final InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (final IOException e) {\n throw new InputMismatchException();\n }\n\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (final IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n\n public int nextInt() {\n int c = read();\n\n while (isSpaceChar(c))\n c = read();\n\n int sgn = 1;\n\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n\n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n\n return res * sgn;\n }\n\n public long nextLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public double nextDouble() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n\n public String readString() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n final StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n\n return res.toString();\n }\n\n public boolean isSpaceChar(final int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public String next() {\n return readString();\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n}\n\n", "lang_cluster": "Java", "tags": ["implementation", "number theory"], "code_uid": "84d8d106bda73d4b143cf7456cbb407c", "src_uid": "4b0a8798a6d53351226d4f06e3356b1e", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package yahia;\nimport java.util.*;\npublic class lm {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();ArrayList<Integer>x=new ArrayList<>();for (int i=0;i<n;++i)x.add(sc.nextInt());Collections.sort(x);ArrayList<Integer>x2=new ArrayList<>();\n\t\tif (n==1) {System.out.println(0);return;}\n\t\tif (x.size()==2) {if((x.get(1)-x.get(0))%2==0)System.out.println((x.get(1)-x.get(0))/2);else System.out.println((x.get(1)-x.get(0)));return;}\n\t\tboolean f=true;\n\t\tSet<Integer> x1 = new HashSet<>(x);\n\t\tx.clear();\n\t\tx.addAll(x1);\n\t\t//System.out.println(x1);\n\t\tfor (int i:x1) {\n\t\t\tx2.add(i);\n\t\t}\n\t\tCollections.sort(x2);\n\t\tif (x1.size()==1) {System.out.println(0);return;}\n\t\tif (x1.size()>3) {System.out.println(-1);return;}\n\t\tif (x1.size()==2) {if((x2.get(1)-x2.get(0))%2==0)System.out.println((x2.get(1)-x2.get(0))/2);else System.out.println((x2.get(1)-x2.get(0)));return;}\n\t\tif (x2.get(1)-x2.get(0)==x2.get(2)-x2.get(1))System.out.println(x2.get(2)-x2.get(1));else System.out.println(-1);\n\t}\n}", "lang_cluster": "Java", "tags": ["math"], "code_uid": "fd9d203ef701cd330ab65a0ac5b34709", "src_uid": "d486a88939c132848a7efdf257b9b066", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\n\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner kb = new Scanner(System.in);\n\t\tint a1 = kb.nextInt();\n\t\tint b1 = kb.nextInt();\n\t\tint c1 = kb.nextInt();\n\t\tint a2 = kb.nextInt();\n\t\tint b2 = kb.nextInt();\n\t\tint c2 = kb.nextInt();\n\t\tint D = a1*b2-a2*b1;\n\t\tif((a1==0&&b1==0&&c1!=0)||(a2==0&&b2==0&&c2!=0))System.out.println(0);\n\t\telse if((a1==0&&b1==0&&c1==0)||(a2==0&&b2==0&&c2==0))System.out.println(-1);\n\t\telse if(D!=0)System.out.println(1);\n\t\telse if(a1*c2==a2*c1&&b1*c2==b2*c1)System.out.println(-1);\n\t\telse System.out.println(0);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "08e2395dbf0531fc0621c00790e91eaf", "src_uid": "c8e869cb17550e888733551c749f2e1a", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//Author-Vishal Burman\n\nimport java.io.*;\nimport java.util.*;\npublic class testClass_codeforces{\n public static void main(String[] args) throws IOException {\n Reader sc = new Reader();\n PrintWriter out = new PrintWriter(System.out, true);\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n ArrayList<String> list=new ArrayList<>();\n int flag=0;\n String str0=\"WBWBWBWB\";\n String str1=\"BWBWBWBW\";\n for(int i=0;i<8;i++){\n String str=br.readLine();\n if(i%2==0){\n if(str.equals(str0))\n flag=0;\n else{\n if(alternate(str))\n flag=0;\n else{\n flag=1;\n break;\n }\n }\n }\n else{\n if(str.equals(str1))\n flag=0;\n else{\n if(alternate(str))\n flag=0;\n else{\n flag=1;\n break;\n }\n }\n }\n }\n if(flag==0)\n out.println(\"YES\");\n else\n out.println(\"NO\");\n out.flush();\n }\n public static boolean alternate(String x){\n int flag=0;\n char let1=x.charAt(0);\n for(int i=1;i<x.length();i++){\n if(x.charAt(i)!=x.charAt(i-1))\n continue;\n else\n return false;\n }\n return true;\n }\n}\nclass Reader {\n final private int BUFFER_SIZE = 1 << 16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n\n public Reader() {\n din = new DataInputStream(System.in);\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public Reader(String file_name) throws IOException {\n din = new DataInputStream(new FileInputStream(file_name));\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public String readLine() throws IOException {\n byte[] buf = new byte[256]; // line length\n int cnt = 0, c;\n while ((c = read()) != -1) {\n if (c == '\\n')\n break;\n buf[cnt++] = (byte) c;\n }\n return new String(buf, 0, cnt);\n }\n\n public int nextInt() throws IOException {\n int ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n\n if (neg)\n return -ret;\n return ret;\n }\n\n public long nextLong() throws IOException {\n long ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n if (neg)\n return -ret;\n return ret;\n }\n\n public double nextDouble() throws IOException {\n double ret = 0, div = 1;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n\n if (c == '.') {\n while ((c = read()) >= '0' && c <= '9') {\n ret += (c - '0') / (div *= 10);\n }\n }\n\n if (neg)\n return -ret;\n return ret;\n }\n\n private void fillBuffer() throws IOException {\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1)\n buffer[0] = -1;\n }\n\n private byte read() throws IOException {\n if (bufferPointer == bytesRead)\n fillBuffer();\n return buffer[bufferPointer++];\n }\n\n public void close() throws IOException {\n if (din == null)\n return;\n din.close();\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "strings"], "code_uid": "d058363f7b8ce97368b228495666687b", "src_uid": "ca65e023be092b2ce25599f52acc1a67", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class Mohsen{\n public static void main(String[] args){\n Scanner console = new Scanner(System.in);\n long n = console.nextLong(), m=console.nextLong(), a=console.nextLong(), b=console.nextLong();\n System.out.println(Math.min((n % m)*b, (m - (n % m))*a));\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "bcd6ff29c291291b293ec71e89effe04", "src_uid": "c05d753b35545176ad468b99ff13aa39", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.StringTokenizer;\n\n/**\n * Created by peacefrog on 11/9/15.\n * Time : 10:22 PM\n */\n\npublic class TavasAndSaDDas299B {\n\tfinal boolean ONLINE_JUDGE = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tPrintWriter out;\n\tlong timeBegin, timeEnd;\n\n\tpublic void runIO() throws IOException {\n\t\ttimeBegin = System.currentTimeMillis();\n\n\t\tInputStream inputStream;\n\t\tOutputStream outputStream;\n\n\n\t\tif (ONLINE_JUDGE) {\n\t\t\tinputStream = System.in;\n\t\t\tReader.init(inputStream);\n\t\t\toutputStream = System.out;\n\n\t\t\tout = new PrintWriter(outputStream);\n\n\t\t} else {\n\t\t\tinputStream = new FileInputStream(\"/home/peacefrog/Dropbox/IdeaProjects/Problem Solving/input\");\n\t\t\tReader.init(inputStream);\n\t\t\tout = new PrintWriter(\"output.txt\");\n\t\t}\n\n\t\tsolve();\n\n\t\tout.flush();\n\t\tout.close();\n\t\ttimeEnd = System.currentTimeMillis();\n\n\t\tSystem.err.println(\"Time = \" + (timeEnd - timeBegin));\n\n\t}\n\n\t/*\n\t * Start Solution Here\n\t */\n\n\tprivate void solve() throws IOException {\n\t\tlong n = Reader.nextLong(); //This Variable default in Code Templete\n\t\tArrayList<Long> lucky = new ArrayList<>();\n\n\t\tArrayList<Long> temp = new ArrayList<>();\n\n\t\ttemp.add(4L);\n\t\ttemp.add(7L);\n\n\t\twhile (!temp.isEmpty())\n\t\t{\n\t\t\tlong top = temp.remove(0);\n\t\t\tif (top <= 1E9)\n\t\t\t{\n\t\t\t\tlucky.add(top);\n\t\t\t\ttemp.add(top*10+4);\n\t\t\t\ttemp.add(top*10+7);\n\t\t\t}\n\t\t}\n\n\t\tCollections.sort(lucky);\n\t\tSystem.out.println(lucky.indexOf(n)+1);\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\n\t\tnew TavasAndSaDDas299B().runIO();\n\t}\n\n\tstatic class Reader {\n\t\tstatic BufferedReader reader;\n\t\tstatic StringTokenizer tokenizer;\n\n\t\t/**\n\t\t * call this method to initialize reader for InputStream\n\t\t */\n\t\tstatic void init(InputStream input) {\n\t\t\treader = new BufferedReader(new InputStreamReader(input));\n\t\t\ttokenizer = new StringTokenizer(\"\");\n\t\t}\n\n\t\t/**\n\t\t * get next word\n\t\t */\n\t\tstatic String next() {\n\t\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tokenizer.nextToken();\n\t\t}\n\n\t\tstatic String nextLine() {\n\t\t\ttry {\n\t\t\t\treturn reader.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn \"\";\n\t\t}\n\n\t\tstatic int nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tstatic long nextLong() throws IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tstatic double nextDouble() throws IOException {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t}\n\n}\n\n", "lang_cluster": "Java", "tags": ["brute force", "implementation", "combinatorics", "bitmasks"], "code_uid": "4dcc57e78d6fced03fa52b92068e1e89", "src_uid": "6a10bfe8b3da9c11167e136b3c6fb2a3", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class VityaInTheCountryside {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int daysObservedCount = Integer.parseInt(scanner.nextLine().split(\"\\\\r?\\\\n\")[0]);\n String[] observedCycleStringArray = scanner.nextLine().split(\" \");\n\n\n if (observedCycleStringArray[daysObservedCount - 1].equals(\"0\")) {\n System.out.println(\"UP\");\n return;\n }\n\n if (observedCycleStringArray[daysObservedCount - 1].equals(\"15\")) {\n System.out.println(\"DOWN\");\n return;\n }\n\n if (daysObservedCount <= 1) {\n System.out.println(\"-1\");\n return;\n }\n\n int lastMoonCycle = Integer.parseInt(observedCycleStringArray[daysObservedCount - 1]);\n int cycleBeforeLastMoonCycle = Integer.parseInt(observedCycleStringArray[daysObservedCount - 2]);\n\n String output = lastMoonCycle > cycleBeforeLastMoonCycle ? \"UP\" : \"DOWN\";\n System.out.println(output);\n }\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "3fb6c77ef7cab84f968de88494fbf50f", "src_uid": "8330d9fea8d50a79741507b878da0a75", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.PrintWriter;\nimport java.util.Scanner;\n\n/**\n * Created by Timur on 10.11.2016.\n */\npublic class _610A {\n public static void main(String args[]) {\n Scanner in = new Scanner(System.in);\n PrintWriter out = new PrintWriter(System.out);\n int n = in.nextInt();\n if(n%2==1)\n out.print(0);\n else\n out.print((n+2)/4 - 1);\n\n out.close();\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "combinatorics"], "code_uid": "3fe55871a2382244837044d6593dd28c", "src_uid": "32b59d23f71800bc29da74a3fe2e2b37", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\npublic class HangDepTroai {\n public static void main(String[] args){\n Scanner input = new Scanner(System.in);\n int a = input.nextInt();\n int b = input.nextInt();\n int c = input.nextInt();\n int d=0;\n if(a<=0 || c>=11){\n System.out.println(\"Error\");\n }\n else if(b>a && b>c && ( a==1 && c==1)){\n d = b+a+c;\n System.out.println(d); \n } \n else if(c==1 && b>a){\n d = a*(b+c);\n System.out.println(d);\n }\n else if(c>a && c>b && ( a==1 && b==1)){\n d = c*(a+b);\n System.out.println(d);\n }\n else if(a==1 && b>c){\n d = c*(a+b);\n System.out.println(d);\n } \n else if(a>1 && a==c && b==1){\n d = c*(a+b);\n System.out.println(d);\n }\n else if(a>b && a>c &&( b==1|| c==1)){\n d = a*(b+c);\n System.out.println(d);\n }\n else if(a>b && a>c && ( b>1 || c>1 )){\n d = a*b*c;\n System.out.println(d);\n }\n else if(b>a && b>c && ( a==1 || c==1)){\n d = b*(a+c);\n System.out.println(d); \n }\n else if(b>a && b>c && ( a>1 || c>1)){\n d = a*b*c;\n System.out.println(d);\n }\n else if(c>a && c>b && ( a==1 || b==1)){\n d = c*(a+b);\n System.out.println(d);\n }\n else if(c>a && c>b && ( a>1 || b>1 )){\n d = a*b*c;\n System.out.println(d);\n }\n else if(a==1 && b==1 && c==1){\n d = a+b+c;\n System.out.println(d);\n }\n else if(a==b && b==c && c==a){\n d = a*b*c;\n System.out.println(d);\n }\n else if(c==1 && b>a){\n d = a*(b+c);\n System.out.println(d);\n }\n }\n}\n\n\n ", "lang_cluster": "Java", "tags": ["brute force", "math"], "code_uid": "03bef186657fd0e674e1c31fca956cfd", "src_uid": "1cad9e4797ca2d80a12276b5a790ef27", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.math.*;\nimport java.util.*;\npublic class TheGreatJuliaCalendarEZ {\n\tpublic static void main(String[] args) { \n\t\tFastScanner I = new FastScanner(); //Input\n\t\tOutPut O = new OutPut(); //Output\n\t\tint N = I.nextInt();\n\t\tlong[] dp = new long[N+1];\n\t\tfor (int i = 1; i<= N; i++) {\n\t\t\tint cur = i;\n\t\t\tdp[i]=(int)(1e7);\n\t\t\twhile (cur>0) {\n\t\t\t\tint dig = cur%10;\n\t\t\t\tdp[i]=min(dp[i],dp[i-dig]+1);\n\t\t\t\tcur/=10;\n\t\t\t}\n\t\t}\n\t\tO.pln(dp[N]);\n//O.pln(ans);\n\t}\n\tpublic static long min(long a, long b) {return Math.min(a,b);}\n\tpublic static long max(long a, long b) {return Math.max(a,b);}\n\tpublic static long abs(long x, long y) {return Math.abs(x-y);}\n\tpublic static long ceil(long num, long den) {long ans = num/den; if (num%den!=0) \n\tans++; return ans;}\n\tpublic static long GCD(long a, long b) {\n\t\tif (a==0||b==0) return max(a,b);\n\t\treturn GCD(max(a,b),max(a,b)%min(a,b));\n\t}\n\tpublic static long FastExp(long base, long exp, long mod) {\n\t\tlong ans=1;\n\t\twhile (exp>0) {\n\t\t\tif (exp%2==1) ans*=base;\n\t\t\texp/=2;\n\t\t\tbase*=base;\n\t\t\tbase%=mod;\n\t\t\tans%=mod;\n\t\t}\n\t\treturn ans;\n\t}\n\tpublic static long ModInv(long num,long mod) {return FastExp(num,mod-2,mod);}\n\tpublic static int pop(long x) { //Returns number of bits within a number\n\t\tint cnt = 0;\n\t\twhile (x>0) {\n\t\t\tif (x%2==1) cnt++;\n\t\t\tx/=2;\n\t\t}\n\t\treturn cnt;\n\t}\n\tstatic class FastScanner {\n\t\tBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st=new StringTokenizer(\"\");\n\t\tString next() {\n\t\t\twhile (!st.hasMoreTokens())\n\t\t\t\ttry {\n\t\t\t\t\tst=new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\t\tint nextInt() {return Integer.parseInt(next());}\n\t\tlong nextLong() {return Long.parseLong(next());};\n\t\tdouble nextDouble() {return Double.parseDouble(next());}\n\t}\n\tstatic class OutPut{\n\t\tPrintWriter w = new PrintWriter(System.out);\n\t\tvoid pln(double x) {w.println(x);w.flush();}\n\t\tvoid pln(boolean x) {w.println(x);w.flush();}\n\t\tvoid pln(int x) {w.println(x);w.flush();}\n\t\tvoid pln(long x) {w.println(x);w.flush();}\n\t\tvoid pln(String x) {w.println(x);w.flush();}\n\t\tvoid pln(char x) {w.println(x);w.flush();}\n\t\tvoid pln(StringBuilder x) {w.println(x);w.flush();}\n\t\tvoid pln(BigInteger x) {w.println(x);w.flush();}\n\t\tvoid p(int x) {w.print(x);w.flush();}\n\t\tvoid p(long x) {w.print(x);w.flush();}\n\t\tvoid p(String x) {w.print(x);w.flush();}\n\t\tvoid p(char x) {w.print(x);w.flush();}\n\t\tvoid p(StringBuilder x) {w.print(x);w.flush();}\n\t\tvoid p(BigInteger x) {w.print(x);w.flush();}\n\t\tvoid p(double x) {w.print(x);w.flush();}\n\t\tvoid p(boolean x) {w.print(x);w.flush();}\n\t}\n}\n\n", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "66b1a25002ccce3171dee5296af685ad", "src_uid": "fc5765b9bd18dc7555fa76e91530c036", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main\n{\n\tpublic static BufferedReader reader;\n\tpublic static StringTokenizer in;\n\tpublic static PrintWriter out;\n\tpublic static final double EPS = 1e-9;\n\t\n\tpublic static void main(String[] args) throws IOException \n\t{\n\t\treader = new BufferedReader(new InputStreamReader(System.in));\n\t\tin = new StringTokenizer(\"\");\n\t\tout = new PrintWriter(System.out);\n\n\t\tint n = nextInt(), R = nextInt(), r = nextInt();\n\t\t\n\t\tif(n == 1)\n\t\t\tout.print(r > R ? \"NO\" : \"YES\");\n\t\telse\n\t\t{\n\t\t\tdouble a = (R - r) * Math.sin(Math.PI / n);\n\t\t\tout.print(r - EPS > a ? \"NO\" : \"YES\");\n\t\t}\n\t\tout.close();\n\t}\n\n\tpublic static void get() throws IOException\n\t{\n\t\twhile(!in.hasMoreTokens()) in = new StringTokenizer(reader.readLine());\n\t}\n\t\n\tpublic static int nextInt() throws IOException\n\t{\n\t\tget();\n\t\treturn Integer.parseInt(in.nextToken());\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "geometry"], "code_uid": "dd6076bb4b86e136adc4c93e76a48ab2", "src_uid": "2fedbfccd893cde8f2fab2b5bf6fb6f6", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class Main\n{\n static int MOD = 1000000007;\n static int dfac[],fac[],inv[];\n \n public static void generateInv(int maxn)\n {\n inv = new int[maxn+1];\n inv[1] = 1;\n for (int i = 2;i <= maxn;++i)\n inv[i] = (int)((long) inv[MOD%i] * (MOD - MOD/i) % MOD); \n }\n \n public static int A(int n,int r)\n {\n return (int)((long)fac[n] * dfac[n-r] % MOD);\n }\n \n public static int quickPow(int x,int n)\n {\n long ans = 1;\n for (;n != 0;n >>= 1)\n {\n if ((n & 1) != 0) ans = ans * x % MOD;\n x = (int)((long) x * x % MOD);\n }\n return (int)ans;\n }\n \n public static int eat(int len,int k,int w)\n {\n long ret = A(k,len);\n int delta = len - (w - 1);\n if (delta >= 0)\n {\n ret = ret * A(k-delta,len-delta) % MOD;\n }\n else\n {\n ret = ret * A(k,len) % MOD;\n ret = ret * quickPow(k,w-1-len) % MOD;\n }\n return (int)ret;\n }\n \n public static int fuck(int k,int w,boolean inclusive)\n {\n long ret = 0;\n for (int i = inclusive ? 1 : 2;i <= k;++i)\n ret = (ret + eat(i,k,w)) % MOD;\n return (int)ret;\n }\n \n public static int gao(int k,int w)\n {\n fac = new int[k+1];\n dfac = new int[k+1];\n fac[0] = 1;\n for (int i = 1;i <= k;++i)\n fac[i] = (int)((long)fac[i-1] * i % MOD);\n generateInv(k);\n dfac[0] = 1;\n for (int i = 1;i <= k;++i)\n dfac[i] = (int)((long)dfac[i-1] * inv[i] % MOD);\n return ( (fuck(k,w+1,true) - fuck(k,w,false) ) % MOD + MOD) % MOD;\n }\n \n public static void main(String args[])\n {\n Scanner cin = new Scanner(System.in);\n int k = cin.nextInt(), w = cin.nextInt();\n System.out.println(gao(k,w));\n }\n}", "lang_cluster": "Java", "tags": ["combinatorics"], "code_uid": "5b89496e07fd80a0fe11c67f873fe2a0", "src_uid": "b715f0fdc83ec539eb3ae2b0371ee130", "difficulty": 3000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Random;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n\tstatic int MOD = 1000 * 1000 * 1000 + 7;\n\n\tpublic static void shuffleArray(int[] arr) {\n\t\tint n = arr.length;\n\t\tRandom rnd = new Random();\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tint tmp = arr[i];\n\t\t\tint randomPos = i + rnd.nextInt(n - i);\n\t\t\tarr[i] = arr[randomPos];\n\t\t\tarr[randomPos] = tmp;\n\t\t}\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tsolve3(in, out);\n\t\tout.close();\n\t\tSystem.exit(0);\n\t}\n\n\tstatic class Pair implements Comparable<Pair> {\n\t\tint x;\n\t\tint y;\n\n\t\tPair(int x, int y) {\n\t\t\tthis.x = x;\n\t\t\tthis.y = y;\n\t\t}\n\n\t\t@Override\n\t\tpublic int compareTo(Pair o) {\n\t\t\tint comp = Integer.compare(x, o.x);\n\t\t\tint comp2 = Integer.compare(y, o.y);\n\t\t\tif (comp != 0) {\n\t\t\t\treturn comp;\n\t\t\t} else {\n\t\t\t\treturn comp2;\n\t\t\t}\n\t\t}\n\n\t}\n\n\tprivate static void solve3(InputReader in, PrintWriter out) {\n\t\tint a = in.nextInt();\n\t\tint b = in.nextInt();\n\t\tint[][] dp = new int[201][201];\n\t\tfor (int sum = 2; sum <= 200; sum++) {\n\t\t\tfor (int i = 1; i <= sum; i++) {\n\t\t\t\tint j = sum - i;\n\n\t\t\t\tif (i - 2 >= 0 && j > 0) {\n\t\t\t\t\tdp[i][j] = Math.max(dp[i][j], dp[i - 2][j + 1] + 1);\n\t\t\t\t}\n\t\t\t\tif (j - 2 >= 0 && i > 0) {\n\t\t\t\t\tdp[i][j] = Math.max(dp[i][j], dp[i + 1][j - 2] + 1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tout.print(dp[a][b]);\n\t}\n\n\tprivate static void solve2(InputReader in, PrintWriter out) {\n\t\tint n = in.nextInt();\n\t\tint[] tab = new int[1002];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint curr = in.nextInt();\n\t\t\ttab[curr]++;\n\t\t}\n\t\tint res = 0;\n\t\tint all = 0;\n\t\tfor (int i = 1000; i >= 1; i--) {\n\t\t\tres += Math.min(tab[i], all);\n\t\t\tall += tab[i];\n\t\t}\n\n\t\tout.print(res);\n\t}\n\n\tprivate static void solve(InputReader in, PrintWriter out) {\n\n\t\tint n = in.nextInt();\n\t\tlong a = in.nextInt();\n\t\tlong b = in.nextInt();\n\t\tlong T = in.nextLong();\n\t\tchar[] s = in.next().toCharArray();\n\t\tlong[] right = new long[n];\n\t\tlong[] left = new long[n];\n\t\tright[0] = 1 + (s[0] == 'w' ? b : 0);\n\t\tleft[0] = 0;\n\n\t\tfor (int i = 1; i < n; i++) {\n\t\t\tlong changeCost = (s[i] == 'w' ? b : 0);\n\t\t\tright[i] = right[i - 1] + a + changeCost + 1;\n\t\t}\n\t\tfor (int i = 1; i < n; i++) {\n\t\t\tint pos = n - i;\n\t\t\tlong changeCost = (s[pos] == 'w' ? b : 0);\n\t\t\tleft[pos] = left[(pos + 1) % n] + a + changeCost + 1;\n\t\t}\n\n\t\tlong best = 0;\n\t\tint bestL = n - 1;\n\t\tfor (int i = n - 1; i >= 0; i--) { // right\n\t\t\tlong time = right[i];\n\t\t\tif (time <= T) {\n\t\t\t\tbest = Math.max(best, i + 1);\n\t\t\t\tlong rem = T - time;\n\t\t\t\trem -= a * i; // back time\n\t\t\t\twhile (bestL > i && rem >= left[bestL]) {\n\t\t\t\t\tbest = Math.max(best, i + 1 + (n - bestL));\n\t\t\t\t\tbestL--;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tchar[] tmp = new char[s.length];\n\t\ttmp[0] = s[0];\n\t\tfor (int i = 1; i < n; i++) {\n\t\t\ttmp[i] = s[n - i];\n\t\t}\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ts[i] = tmp[i];\n\t\t}\n\n\t\t// **** left\n\t\tright = new long[n];\n\t\tleft = new long[n];\n\t\tright[0] = 1 + (s[0] == 'w' ? b : 0);\n\t\tleft[0] = 0;\n\n\t\tfor (int i = 1; i < n; i++) {\n\t\t\tlong changeCost = (s[i] == 'w' ? b : 0);\n\t\t\tright[i] = right[i - 1] + a + changeCost + 1;\n\t\t}\n\t\tfor (int i = 1; i < n; i++) {\n\t\t\tint pos = n - i;\n\t\t\tlong changeCost = (s[pos] == 'w' ? b : 0);\n\t\t\tleft[pos] = left[(pos + 1) % n] + a + changeCost + 1;\n\t\t}\n\n\t\tbestL = n - 1;\n\t\tfor (int i = n - 1; i >= 0; i--) { // right\n\t\t\tlong time = right[i];\n\t\t\tif (time <= T) {\n\t\t\t\tbest = Math.max(best, i + 1);\n\t\t\t\tlong rem = T - time;\n\t\t\t\trem -= a * i; // back time\n\t\t\t\twhile (bestL > i && rem >= left[bestL]) {\n\t\t\t\t\tbest = Math.max(best, i + 1 + (n - bestL));\n\t\t\t\t\tbestL--;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tout.print(best);\n\t}\n\n\t/*\n\t * \n\t */\n\t// --------------------------------------------------------\n\tstatic class InputReader {\n\t\tpublic BufferedReader reader;\n\t\tpublic StringTokenizer tokenizer;\n\n\t\tpublic InputReader(InputStream stream) {\n\t\t\treader = new BufferedReader(new InputStreamReader(stream), 32768);\n\t\t\ttokenizer = null;\n\t\t}\n\n\t\tpublic String next() {\n\t\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tokenizer.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tpublic String nextLine() {\n\t\t\tString str = \"\";\n\t\t\ttry {\n\t\t\t\tstr = reader.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\n\t\t\treturn str;\n\t\t}\n\t}\n\n}", "lang_cluster": "Java", "tags": ["math", "greedy", "dp", "implementation"], "code_uid": "34389e3c9fcdbe5eb4186f4a9e7fe9b3", "src_uid": "ba0f9f5f0ad4786b9274c829be587961", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.util.Arrays;\n\nimport java.util.StringTokenizer;\n\n\npublic class Codeforces {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskA solve = new TaskA();\n solve.solve(1, in, out);\n out.close();\n }\n static class TaskA {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.nextInt();\n int m = in.nextInt();\n \n int arr[] = new int[m];\n \n \n for(int i = 0; i < m; ++i) {\n arr[i] = in.nextInt();\n }\n \n Arrays.sort(arr);\n \n int minimum = Integer.MAX_VALUE;\n \n if(m > n) {\n n--;\n for(int i = 0; i < m - n; ++i) {\n minimum = Math.min(minimum, arr[i + n] - arr[i]);\n }\n } else if(m==n) {\n minimum = Math.min(minimum, arr[n-1] - arr[0]);\n } else {\n for(int j = 0; j < n-1; ++j) {\n minimum = Math.min(minimum, arr[j + n-1] - arr[j]);\n }\n }\n \n \n \n out.println(minimum);\n \n }\n \n private static String reverse(String word) {\n String out = \"\";\n for(int i = word.length() -1; i >= 0; i--) {\n out += word.charAt(i);\n }\n return out;\n }\n }\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n \n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n \n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n \n public int nextInt() {\n return Integer.parseInt(next());\n }\n \n public double nextDouble() {\n return Double.parseDouble(next());\n }\n \n }\n}", "lang_cluster": "Java", "tags": ["greedy"], "code_uid": "7b85dda143faaff1d617d80a59ab905c", "src_uid": "7830aabb0663e645d54004063746e47f", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.math.BigInteger;\nimport java.time.LocalDate;\nimport java.time.YearMonth;\nimport java.time.format.DateTimeFormatter;\nimport java.time.temporal.ChronoUnit;\nimport java.util.*;\n\npublic class Main {\n static boolean local = false;\n static FReader sc;\n static PrintWriter pw;\n\n public static void main(String args[]) throws FileNotFoundException {\n if (args.length != 0) {\n local = true;\n sc = new FReader(\"/Users/qjex/prj/jolymp/src/input.txt\");\n try {\n pw = new PrintWriter(new FileOutputStream(\"/Users/qjex/prj/jolymp/src/output.txt\"), false);\n } catch (Exception e) {\n e.printStackTrace();\n }\n } else {\n sc = new FReader(System.in);\n pw = new PrintWriter(System.out);\n }\n solve();\n pw.close();\n sc.close();\n }\n\n public static void solve() {\n String a = sc.next(), b = sc.next();\n DateTimeFormatter formatter = DateTimeFormatter.ofPattern(\"yyyy:MM:dd\");\n LocalDate l = LocalDate.parse(a, formatter);\n LocalDate r = LocalDate.parse(b, formatter);\n pw.println(Math.abs(ChronoUnit.DAYS.between(l, r)));\n\n }\n\n}\n\nclass FReader {\n BufferedReader br;\n StringTokenizer st;\n\n FReader(String file) {\n try {\n br = new BufferedReader(new FileReader(file));\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n st = new StringTokenizer(\"\");\n }\n\n\n FReader(InputStream is) {\n br = new BufferedReader(new InputStreamReader(is));\n st = new StringTokenizer(\"\");\n }\n\n String next() {\n try {\n while (!st.hasMoreElements()) {\n st = new StringTokenizer(br.readLine());\n }\n } catch (Exception e) {\n e.printStackTrace();\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n BigInteger nextBigInteger(){ return new BigInteger(next()); }\n\n public void close() {\n try {\n br.close();\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n}\n\nclass Pair implements Comparable<Pair> {\n\n public int first;\n public int second;\n\n public Pair(int first, int second) {\n this.first = first;\n this.second = second;\n }\n\n @Override\n public int compareTo(Pair pairInt) {\n if (first > pairInt.first) return 1;\n if (first < pairInt.first) return -1;\n if (second > pairInt.second) return 1;\n return second == pairInt.second ? 0 : -1;\n }\n\n @Override\n public boolean equals(Object obj) {\n return obj instanceof Pair && compareTo((Pair) obj) == 0;\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "a942ec3c9338efec65b21b5a0c957f8b", "src_uid": "bdf99d78dc291758fa09ec133fff1e9c", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "//I have given up the treatment-_-||\nimport java.util.*;\nimport java.math.*;\npublic class a{\n\tpublic static int pp[][] = new int[10][3];\n\tpublic static int mat[][] = new int[5][5];\n\tpublic static int n;\n\tpublic static void main(String[] args){\n\t\tn=3;\n\t\tScanner cin = new Scanner(System.in);\n\t\twhile(cin.hasNext()){\n\t\t\tfor(int i=1;i<=n;i++){\n\t\t\t\tpp[i][1]=cin.nextInt();\n\t\t\t\tpp[i][2]=cin.nextInt();\n\t\t\t}\n\t\t\tgetmat();\n\t\t\tint ans=5;\n\t\t\tif(pp[1][1]==pp[2][1]&&pp[2][1]==pp[3][1]){\n\t\t\t\tans=1;\n\t\t\t}\n\t\t\tif(pp[1][2]==pp[2][2]&&pp[2][2]==pp[3][2]){\n\t\t\t\tans=1;\n\t\t\t}\n\t\t\tif(ans==1){\n\t\t\t\tSystem.out.println(ans);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tans=3;\n\t\t\tfor(int i=1;i<=3&&ans>2;i++){\n\t\t\t\tfor(int j=1;j<=3&&ans>2;j++){\n\t\t\t\t\tif(i==j) continue;\n\t\t\t\t\tfor(int k=1;k<=3&&ans>2;k++){\n\t\t\t\t\t\tif(k==i||k==j) continue;\n\t\t\t\t\t\tif(gao(i,j,k)){\n\t\t\t\t\t\t\tans=2;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t\tcin.close();\n\t}\n\tpublic static void getmat(){\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tmat[i][i]=0;\n\t\t\tfor(int j=i+1;j<=n;j++){\n\t\t\t\tint step=getstep(i,j);\n\t\t\t\tmat[i][j]=mat[j][i]=step;\n\t\t\t}\n\t\t}\n\t\treturn;\n\t}\n\tpublic static int getstep(int x,int y){\n\t\tint ret=0;\n\t\tif(pp[x][1]!=pp[y][1]) ret++;\n\t\tif(pp[x][2]!=pp[y][2]) ret++;\n\t\treturn ret;\n\t}\n\tpublic static boolean gao(int x,int y,int z){\n\t\tif(pp[x][1]>=pp[y][1]&&pp[x][1]>=pp[z][1]&&pp[y][2]==pp[z][2]){\n\t\t\treturn true;\n\t\t}\n\t\tif(pp[x][1]<=pp[y][1]&&pp[x][1]<=pp[z][1]&&pp[y][2]==pp[z][2]){\n\t\t\treturn true;\n\t\t}\n\t\tif(pp[x][2]>=pp[y][2]&&pp[x][2]>=pp[z][2]&&pp[y][1]==pp[z][1]){\n\t\t\treturn true;\n\t\t}\n\t\tif(pp[x][2]<=pp[y][2]&&pp[x][2]<=pp[z][2]&&pp[y][1]==pp[z][1]){\n\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n}", "lang_cluster": "Java", "tags": ["constructive algorithms", "implementation"], "code_uid": "d890c8474ee3550a65e5f6dada1d33f0", "src_uid": "36fe960550e59b046202b5811343590d", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.math.*;\nimport java.util.*;\nimport java.util.stream.*;\n\n@SuppressWarnings(\"unchecked\")\npublic class P910B {\n\n int n;\n TreeMap<Integer, Integer> m;\n\n void use(int l) {\n Integer pl = m.ceilingKey(l);\n\n int c = m.get(pl) - 1;\n if (c > 0) {\n m.put(pl, c);\n } else {\n m.remove(pl);\n }\n\n if (pl != l) {\n m.put(pl - l, m.getOrDefault(pl - l, 0) + 1);\n }\n }\n\n public void run() throws Exception {\n n = nextInt();\n int a = nextInt(), b = nextInt(), k = Integer.MAX_VALUE;\n \n for (int mm = (1 << 6) - 1; mm > 0; mm--) {\n if (Integer.bitCount(mm) != 2) { continue; }\n\n m = new TreeMap();\n m.put(n, 6);\n for (int mi = 1 << 5; mi > 0; mi >>= 1) {\n if ((mm & mi) == 0) {\n use(a);\n } else {\n use(b);\n }\n }\n\n k = Math.min(k, 6 - m.getOrDefault(n, 0));\n }\n\n println(k);\n }\n\n public static void main(String... args) throws Exception {\n br = new BufferedReader(new InputStreamReader(System.in));\n pw = new PrintWriter(new BufferedOutputStream(System.out));\n new P910B().run();\n br.close();\n pw.close();\n System.err.println(\"\\n[Time : \" + (System.currentTimeMillis() - startTime) + \" ms]\");\n }\n\n static long startTime = System.currentTimeMillis();\n static BufferedReader br;\n static PrintWriter pw;\n StringTokenizer stok;\n\n String nextToken() throws IOException {\n while (stok == null || !stok.hasMoreTokens()) {\n String s = br.readLine();\n if (s == null) { return null; }\n stok = new StringTokenizer(s);\n }\n return stok.nextToken();\n }\n\n void print(byte b) { print(\"\" + b); }\n void print(int i) { print(\"\" + i); }\n void print(long l) { print(\"\" + l); }\n void print(double d) { print(\"\" + d); }\n void print(char c) { print(\"\" + c); }\n void print(Object o) {\n if (o instanceof int[]) { print(Arrays.toString((int [])o));\n } else if (o instanceof long[]) { print(Arrays.toString((long [])o));\n } else if (o instanceof char[]) { print(Arrays.toString((char [])o));\n } else if (o instanceof byte[]) { print(Arrays.toString((byte [])o));\n } else if (o instanceof short[]) { print(Arrays.toString((short [])o));\n } else if (o instanceof boolean[]) { print(Arrays.toString((boolean [])o));\n } else if (o instanceof float[]) { print(Arrays.toString((float [])o));\n } else if (o instanceof double[]) { print(Arrays.toString((double [])o));\n } else if (o instanceof Object[]) { print(Arrays.toString((Object [])o));\n } else { print(\"\" + o); }\n }\n void print(String s) { pw.print(s); }\n void println() { println(\"\"); }\n void println(byte b) { println(\"\" + b); }\n void println(int i) { println(\"\" + i); }\n void println(long l) { println(\"\" + l); }\n void println(double d) { println(\"\" + d); }\n void println(char c) { println(\"\" + c); }\n void println(Object o) { print(o); println(); }\n void println(String s) { pw.println(s); }\n int nextInt() throws IOException { return Integer.parseInt(nextToken()); }\n long nextLong() throws IOException { return Long.parseLong(nextToken()); }\n double nextDouble() throws IOException { return Double.parseDouble(nextToken()); }\n char nextChar() throws IOException { return (char) (br.read()); }\n String next() throws IOException { return nextToken(); }\n String nextLine() throws IOException { return br.readLine(); }\n int [] readInt(int size) throws IOException {\n int [] array = new int [size];\n for (int i = 0; i < size; i++) { array[i] = nextInt(); }\n return array;\n }\n long [] readLong(int size) throws IOException {\n long [] array = new long [size];\n for (int i = 0; i < size; i++) { array[i] = nextLong(); }\n return array;\n }\n double [] readDouble(int size) throws IOException {\n double [] array = new double [size];\n for (int i = 0; i < size; i++) { array[i] = nextDouble(); }\n return array;\n }\n String [] readLines(int size) throws IOException {\n String [] array = new String [size];\n for (int i = 0; i < size; i++) { array[i] = nextLine(); }\n return array;\n }\n\n int gcd(int a, int b) {\n if (a == 0) return Math.abs(b); if (b == 0) return Math.abs(a);\n a = Math.abs(a); b = Math.abs(b);\n int az = Integer.numberOfTrailingZeros(a), bz = Integer.numberOfTrailingZeros(b);\n a >>>= az; b >>>= bz;\n while (a != b) {\n if (a > b) { a -= b; a >>>= Integer.numberOfTrailingZeros(a); }\n else { b -= a; b >>>= Integer.numberOfTrailingZeros(b); }\n }\n return (a << Math.min(az, bz));\n }\n\n long gcd(long a, long b) {\n if (a == 0) return Math.abs(b); if (b == 0) return Math.abs(a);\n a = Math.abs(a); b = Math.abs(b);\n int az = Long.numberOfTrailingZeros(a), bz = Long.numberOfTrailingZeros(b);\n a >>>= az; b >>>= bz;\n while (a != b) {\n if (a > b) { a -= b; a >>>= Long.numberOfTrailingZeros(a); }\n else { b -= a; b >>>= Long.numberOfTrailingZeros(b); }\n }\n return (a << Math.min(az, bz));\n }\n}", "lang_cluster": "Java", "tags": ["greedy", "implementation"], "code_uid": "ea35a4437607f70cd48efecb2b60c485", "src_uid": "1a50fe39e18f86adac790093e195979a", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\n\npublic class Main {\n \n public static String Sleep(int hh,int mm,int hh2 ,int mm2){\n int hhout,mmout;\n \n \n if(hh<hh2&&mm<mm2){\n hhout=23-(hh2-hh);\n \n \n }\n else\n if(hh<hh2)hhout=24-(hh2-hh);\n else\n if(hh==hh2&&mm<mm2)hhout=23;\n else\n if(hh>hh2&&mm<mm2){\n hh2=hh2+1;\n hhout=hh-hh2;\n }\n else\n hhout=hh-hh2;\n\n \n \n if(mm<mm2){\n mmout=(60-mm2)+mm;\n \n }\n else\n mmout=mm-mm2;\n \n \n String outmin=mmout+\"\";\n if(outmin.length()==1)outmin=\"0\"+outmin;\n String outhours=hhout+\"\";\n if(outhours.length()==1)outhours=\"0\"+outhours;\n \n return outhours+\":\"+outmin;\n\n }\n \n\n public static void main(String[] args) throws IOException {\n BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));\n String[] test= bf.readLine().split(\":\");\n\n int hh = Integer.parseInt(test[0]);\n int mm = Integer.parseInt(test[1]);\n \n String[] test2= bf.readLine().split(\":\");\n\n int hh2 = Integer.parseInt(test2[0]);\n int mm2 = Integer.parseInt(test2[1]);\n \n \n //Test Using the values from the buffer zeft:\n System.out.println(Sleep(hh,mm,hh2,mm2));\n \n \n\n \n \n }\n \n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "57ebd0bd4d549ebaac0363da9013394e", "src_uid": "595c4a628c261104c8eedad767e85775", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\npublic class train\n{\n\tpublic static void main(String[] Args)\n\t{\n\t\tScanner p = new Scanner(System.in);\n\t\tint n=p.nextInt();\n\t\tint me=p.nextInt();\n\t\tint tt=p.nextInt();\n\t\tScanner pp=new Scanner(System.in);\n\t\tString r=p.nextLine();\n\t\tString move=p.nextLine();\n\t\tString Schedule= p.nextLine();\n\t\tchar minute[]= new char[Schedule.length()];\n\t\tint ttmove=0;\n\t\tif(move.charAt(3)=='h')\n\t\t{\n\t\t\tttmove=-1;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tttmove=1;\n\t\t}\n\t\tint c=0;\n\t\twhile((c<Schedule.length())&&(me!=tt))\n\t\t{\n\t\t\tif(Schedule.charAt(c)=='0')\n\t\t\t{\n\t\t\t\tif(me>tt)\n\t\t\t\t{\n\t\t\t\t\tif(me!=n)\n\t\t\t\t\t{\n\t\t\t\t\t\tme++;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tif((me-1)!=tt)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif(me!=1)\n\t\t\t\t\t{\n\t\t\t\t\t\tme--;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\t;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tif((ttmove==1)&&(tt!=1))\n\t\t\t\t{\n\t\t\t\t\tme=tt-1;\n\t\t\t\t}\n\t\t\t\telse if((ttmove==1)&&(tt==1))\n\t\t\t\t{\n\t\t\t\t\tme=1;\n\t\t\t\t}\n\t\t\t\telse if((ttmove==-1)&&(tt!=n))\n\t\t\t\t{\n\t\t\t\t\tme=tt+1;\n\t\t\t\t}\n\t\t\t\telse if((ttmove==-1)&&(tt==n))\n\t\t\t\t{\n\t\t\t\t\tme=n;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tme+=ttmove;\n\t\t\t\t}\n\t\t\t}\n\t\t\tc++;\n\t\t\ttt+=ttmove;\n\t\t\tif(tt==n)\n\t\t\t{\n\t\t\t\tttmove=-1;\n\t\t\t}\n\t\t\telse if(tt==1)\n\t\t\t{\n\t\t\t\tttmove=1;\n\t\t\t}\n\t\t}\n\t\tif(c==Schedule.length())\n\t\t{\n\t\t\tSystem.out.println(\"Stowaway\");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tSystem.out.println(\"Controller \"+c);\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["greedy", "dp", "games"], "code_uid": "9e7820109a696c3d2f09bfe313122fd4", "src_uid": "2222ce16926fdc697384add731819f75", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/*\nIf you want to aim high, aim high\nDon't let that studying and grades consume you\nJust live life young\n******************************\nIf I'm the sun, you're the moon\nBecause when I go up, you go down\n*******************************\n*/\nimport java.util.*;\nimport java.io.*;\nimport java.math.*;\n\n public class x1097D\n {\n static long MOD = 1000000007L;\n public static void main(String omkar[]) throws Exception\n {\n //BufferedReader infile = new BufferedReader(new FileReader(\"cowdate.in\"));\n BufferedReader infile = new BufferedReader(new InputStreamReader(System.in)); \n StringTokenizer st = new StringTokenizer(infile.readLine());\n long N = Long.parseLong(st.nextToken());\n int T = Integer.parseInt(st.nextToken());\n long P = 1L;\n long Q = 1L;\n long top = N;\n if(N <= 1000)\n for(long p=2; p <= top; p++)\n {\n int cnt = 0;\n if(N%p != 0)\n continue;\n while(N%p == 0)\n {\n cnt++;\n N /= p;\n }\n long[] pow = new long[cnt+1];\n pow[0] = 1L;\n for(int i=1; i <= cnt; i++)\n pow[i] = (pow[i-1]*p)%MOD;\n long[][] dp = new long[cnt+1][T+1];\n for(int i=0; i <= cnt; i++)\n dp[i][0] = pow[i];\n for(int t=1; t <= T; t++)\n {\n long sum = 0L;\n for(int i=0; i <= cnt; i++)\n {\n sum = (sum+dp[i][t-1])%MOD;\n dp[i][t] = (sum*power(i+1, MOD-2, MOD))%MOD; \n }\n }\n long num = dp[cnt][T];\n //long denom = power(cnt+1, T, MOD);\n P = (P*num)%MOD;\n //Q = (Q*denom)%MOD;\n }\n else\n {\n for(long p=2; p*p <= top; p++)\n {\n int cnt = 0;\n if(N%p != 0)\n continue;\n while(N%p == 0)\n {\n cnt++;\n N /= p;\n }\n long[] pow = new long[cnt+1];\n pow[0] = 1L;\n for(int i=1; i <= cnt; i++)\n pow[i] = (pow[i-1]*p)%MOD;\n long[][] dp = new long[cnt+1][T+1];\n for(int i=0; i <= cnt; i++)\n dp[i][0] = pow[i];\n for(int t=1; t <= T; t++)\n {\n long sum = 0L;\n for(int i=0; i <= cnt; i++)\n {\n sum = (sum+dp[i][t-1])%MOD;\n dp[i][t] = (sum*power(i+1, MOD-2, MOD))%MOD; \n }\n }\n long num = dp[cnt][T];\n //long denom = power(cnt+1, T, MOD);\n P = (P*num)%MOD;\n //Q = (Q*denom)%MOD;\n }\n if(N > 1)\n {\n int cnt = 1;\n //if(N%p != 0)\n // continue;\n //while(N%p == 0)\n //{\n // cnt++;\n // N /= p;\n //}\n long p = N;\n long[] pow = new long[cnt+1];\n pow[0] = 1L;\n for(int i=1; i <= cnt; i++)\n pow[i] = (pow[i-1]*p)%MOD;\n long[][] dp = new long[cnt+1][T+1];\n for(int i=0; i <= cnt; i++)\n dp[i][0] = pow[i];\n for(int t=1; t <= T; t++)\n {\n long sum = 0L;\n for(int i=0; i <= cnt; i++)\n {\n sum = (sum+dp[i][t-1])%MOD;\n dp[i][t] = (sum*power(i+1, MOD-2, MOD))%MOD; \n }\n }\n long num = dp[cnt][T];\n //long denom = power(cnt+1, T, MOD);\n P = (P*num)%MOD;\n\n }\n }\n long res = (P*power(Q, MOD-2, MOD))%MOD;\n System.out.println((P+MOD)%MOD);\n }\n public static long power(long x, long y, long p) \n { \n long res = 1L; \n x = x % p; \n while (y > 0) \n { \n if((y & 1)==1) \n res = (res * x) % p; \n y = y >> 1; \n x = (x * x) % p; \n } \n return res; \n }\n }", "lang_cluster": "Java", "tags": ["math", "dp", "probabilities", "number theory"], "code_uid": "9cf4d8f087da1bc987f7162e9295a0ba", "src_uid": "dc466d9c24b7dcb37c0e99337b4124d2", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Date {\n\n\t\n\n\tpublic static void main(String[] args) {\n\n\t\t\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n\t\tfinal int x;\n\t\tfinal int y;\n\t\tfinal int steps;\n\t\ttry {\n\t\t\tString first = br.readLine();\n\t\t\tString[] suh = first.split(\" \");\n\t\t\tx = Integer.parseInt(suh[0]);\n\t\t\ty = Integer.parseInt(suh[1]);\n\t\t\tsteps = Integer.parseInt(suh[2]);\n\t\t\tSolver sol = new Solver();\n\n\t\t\tsol.solve(x, y, steps);\n\n\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}\n\n}\n\nclass Solver {\n\n\tpublic void solve(int x, int y, int stps) {\t\n\t\tint minSteps = Math.abs(x) + Math.abs(y);\n\n\t\tif ((minSteps - stps) % 2 == 0 && minSteps <= stps)\n\t\t{\n\t\t\tSystem.out.println(\"Yes\");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tSystem.out.println(\"No\");\n\t\t}\n\t\t\n\t}\n\n}", "lang_cluster": "Java", "tags": ["math"], "code_uid": "eea32ae4fa61f7dd4f4b28a94de448d0", "src_uid": "9a955ce0775018ff4e5825700c13ed36", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.BufferedReader;\nimport java.io.FileNotFoundException;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.LinkedList;\nimport java.util.Queue;\nimport java.util.Random;\nimport java.util.StringTokenizer;\n\npublic class C {\n\n\tstatic StringBuilder decToTer(int x) {\n\t\tStringBuilder ret = new StringBuilder();\n\t\twhile (x > 0) {\n\n\t\t\tint cur = x % 3;\n\t\t\tret.append(cur);\n\t\t\tx /= 3;\n\t\t}\n\n\t\treturn (ret.reverse());\n\t}\n\n\tstatic int terToDec(StringBuilder x) {\n\t\tint ret = 0;\n\t\tfor (int i = x.length() - 1; i >= 0; i--) {\n\t\t\tret += (Integer.parseInt(x.charAt(i) + \"\") * Math.pow(3, x.length() - i - 1));\n\t\t}\n\t\treturn ret;\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\tStringBuilder A = decToTer(a);\n\t\tStringBuilder C = decToTer(c);\n\t\twhile (A.length() < C.length())\n\t\t\tA.insert(0, \"0\");\n\t\twhile (C.length() < A.length())\n\t\t\tC.insert(0, \"0\");\n\t\tStringBuilder B = new StringBuilder();\n\t\tfor (int i = 0; i < A.length(); i++) {\n\t\t\tfor (int k = 0; k < 3; k++) {\n\t\t\t\tif ((Integer.parseInt(A.charAt(i) + \"\") + k) % 3 == (Integer.parseInt(C.charAt(i) + \"\"))) {\n\t\t\t\t\tB.append(k);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(terToDec(B));\n\n\t}\n\n\tstatic class Scanner {\n\t\tStringTokenizer st;\n\t\tBufferedReader br;\n\n\t\tpublic Scanner(InputStream s) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(s));\n\t\t}\n\n\t\tpublic Scanner(String f) throws FileNotFoundException {\n\t\t\tbr = new BufferedReader(new FileReader(f));\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\twhile (st == null || !st.hasMoreTokens())\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic long nextLong() throws IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic String nextLine() throws IOException {\n\t\t\treturn br.readLine();\n\t\t}\n\n\t\tpublic double nextDouble() throws IOException {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tpublic boolean ready() throws IOException {\n\t\t\treturn br.ready();\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) throws IOException {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic int[] nextIntArray1(int n) throws IOException {\n\t\t\tint[] a = new int[n + 1];\n\t\t\tfor (int i = 1; i <= n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic int[] nextIntArraySorted(int n) throws IOException {\n\t\t\tint[] a = nextIntArray(n);\n\t\t\tRandom r = new Random();\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tint j = i + r.nextInt(n - i);\n\t\t\t\tint t = a[i];\n\t\t\t\ta[i] = a[j];\n\t\t\t\ta[j] = t;\n\t\t\t}\n\t\t\tArrays.sort(a);\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) throws IOException {\n\t\t\tlong[] a = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic long[] nextLongArray1(int n) throws IOException {\n\t\t\tlong[] a = new long[n + 1];\n\t\t\tfor (int i = 1; i <= n; i++)\n\t\t\t\ta[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic long[] nextLongArraySorted(int n) throws IOException {\n\t\t\tlong[] a = nextLongArray(n);\n\t\t\tRandom r = new Random();\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tint j = i + r.nextInt(n - i);\n\t\t\t\tlong t = a[i];\n\t\t\t\ta[i] = a[j];\n\t\t\t\ta[j] = t;\n\t\t\t}\n\t\t\tArrays.sort(a);\n\t\t\treturn a;\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "df9a76b1533980a2ffe4593ec38b6a56", "src_uid": "5fb635d52ddccf6a4d5103805da02a88", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main4 {\n static MyScanner sc;\n\n public static void main(String[] args) {\n sc = new MyScanner();\n out = new PrintWriter(new BufferedOutputStream(System.out));\n\n// unitTests();\n\n //Ciel and Flowers\n solution();\n }\n\n private static void unitTests() {\n startTest(0, 0, 0, 0);\n startTest(0, 2, 2, 0);\n startTest(0, 0, 3, 1);\n startTest(0, 3, 3, 2);\n startTest(1, 3, 3, 2);\n startTest(1, 4, 4, 3);\n startTest(1, 1, 1, 1);\n startTest(2, 2, 2, 2);\n startTest(2, 4, 4, 3);\n startTest(4, 4, 4, 4);\n startTest(14, 14, 14, 14);\n }\n\n private static void startTest(long r, long g, long b, long count) {\n long bouketsCount = solutionWithParams(r, g, b);\n if (bouketsCount != count) {\n long bouketsCount2 = solutionWithParams(r, g, b);\n }\n }\n\n private static void solution() {\n long r = sc.nextLong();\n long g = sc.nextLong();\n long b = sc.nextLong();\n\n long bouketsCount = solutionWithParams(r, g, b);\n\n out.println(bouketsCount);\n out.close();\n\n }\n\n private static long solutionWithParams(long r, long g, long b) {\n long bouketsCount = 0;\n\n long minCount = r > g ? g : r;\n minCount = minCount > b ? b : minCount;\n\n long countToCut = minCount;\n if (countToCut > 2) {\n countToCut = 2;\n }\n\n minCount -= countToCut;\n if (minCount < 0) {\n minCount = 0;\n }\n\n long threeCeil = minCount - minCount % 3;\n bouketsCount += threeCeil;\n\n r -= threeCeil;\n g -= threeCeil;\n b -= threeCeil;\n\n if (r > 2 + countToCut) {\n long rThreeCeil = (r - countToCut) / 3;\n bouketsCount += rThreeCeil;\n r -= 3 * rThreeCeil;\n }\n\n if (g > 2 + countToCut) {\n long gThreeCeil = (g - countToCut) / 3;\n bouketsCount += gThreeCeil;\n g -= 3 * gThreeCeil;\n }\n\n if (b > 2 + countToCut) {\n long bThreeCeil = (b - countToCut) / 3;\n bouketsCount += bThreeCeil;\n b -= 3 * bThreeCeil;\n }\n\n while (r > countToCut && b > countToCut && g > countToCut) {\n bouketsCount++;\n r--;\n g--;\n b--;\n }\n\n //now all values are [2..4]\n if (r + g + b >= 10) {//442\n bouketsCount += 3;\n } else if (countToCut > 1) {\n bouketsCount += 2;\n } else if (countToCut > 0 && r + g + b >= 7) {\n bouketsCount += 2;\n } else if (countToCut > 0) {\n bouketsCount += 1;\n }\n\n return bouketsCount;\n }\n\n //-----------PrintWriter for faster output---------------------------------\n public static PrintWriter out;\n\n //-----------MyScanner class for faster input----------\n public static class MyScanner {\n BufferedReader br;\n StringTokenizer st;\n\n public MyScanner() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n\n String nextString(int length) {\n String str = \"\";\n try {\n char[] buff = new char[length];\n br.read(buff);\n str = new String(buff);\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n\n }\n //--------------------------------------------------------\n}\n", "lang_cluster": "Java", "tags": ["math", "combinatorics"], "code_uid": "3337657952056ab89b6a3a4832e69ce4", "src_uid": "acddc9b0db312b363910a84bd4f14d8e", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.lang.*;\nimport java.io.*;\npublic class fence\n{\n public static void main (String[] args) throws java.lang.Exception\n\t{\n\n Scanner sc =new Scanner(System.in);\n\tint t=0;\n\tt=sc.nextInt();\nint s=t,y=t;\n int w=0;int e=-1;\n\t\t int r=0;\n\t\t while(s>0)\n\t\t {\n\t\t r=s%10;\n\t\t w=w+r;\n\t\t s=s/10;\n\t\t }\n\t\t if(w%4==0)\n\t\t {\n\t\t System.out.println(t);\n\n\t\t }\n\t\t else\n\t\t {\n\n\t\t while(e==-1)\n\t\t {\n\n\t\t y++;\n\t\t int u=y;\n\t\t w=0;\n\t\t while(u>0)\n\t\t {\n\n\t\t w=w+u%10;\n\t\t u=u/10;\n }\n\n\t\t if(w%4==0)\n\t\t {\n\t\t System.out.println(y);\n\t\t e=0;\n\t\t break;\n\t\t }\n\t\t }\n\t\t }\n\t}\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "51adc98d0fb50a2cedda160a97ca137d", "src_uid": "bb6fb9516b2c55d1ee47a30d423562d7", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.BigInteger;\npublic class Tester {\n\tpublic static void main(String args[])\n\t{\n\t\tInputReader in = new InputReader(System.in);\n\t\tOutputStream outputStream = System.out;\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tString s=in.next();\n\t\tint i,j;\n\t\tchar arr[]=s.toCharArray();\n\t\tchar arr1[]=new char[s.length()];\n\t\tfor(i=0;i<arr.length;)\n\t\t{\n\t\t\tif(arr[i]=='/')\n\t\t\t{\n\t\t\t\tfor(i=i+1;i<arr.length;i++)\n\t\t\t\t{\n\t\t\t\t\tif(arr[i]=='/')\n\t\t\t\t\t\tarr[i]='.';\n\t\t\t\t\telse\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t\ti++;\n\t\t}\n\t\tint count=0;\n\t\tfor(i=0;i<arr.length;i++)\n\t\t{\n\t\t\tif(arr[i]!='.')\n\t\t\t{\n\t\t\t\tarr1[count]=arr[i];\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif(count==1)\n\t\t\tout.print(arr1[0]);\n\t\telse\n\t\t{\n\t\t\tif(arr1[count-1]=='/')\n\t\t\t\tarr1[count-1]='.';\n\t\t\tfor(i=0;i<count;i++)\n\t\t\t{\n\t\t\t\tif(arr1[i]!='.')\n\t\t\t\t{\n\t\t\t\t\tout.print(arr1[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tout.close();\n\t}\n\tstatic class Pair implements Comparable<Pair>\n\t{\n\t\t//Iterator it = h.entrySet().iterator();\n//\t while (it.hasNext()) {\n//\t Map.Entry pair = (Map.Entry)it.next();\n//\t // System.out.println(pair.getKey() + \" = \" + pair.getValue());\n//\t it.remove(); // avoids a ConcurrentModificationException\n//\t }\n\t\tprivate int first;\n\t\tprivate int index;\n\t\t//private long second;;\n\n\t\tpublic Pair(int i, int j) \n\t\t{ \n\t\t\tthis.first = i;\n\t\t\tthis.index = j;\n\t\t}\n\t\tpublic int getFirst() { return first; }\n\t\t//public long getSecond() { return second; }\n\t\tpublic int getIndex() { return index ;}\n\t\tpublic void setFirst(int k) { this.first=k ; }\n\t\tpublic void setIndex(int k) { this.index=k ;}\n\t\t//public void setSecond(long k) { this.second=k ;}\n\t\t@Override\n\t\tpublic int compareTo(Pair o) \n\t\t{\n\t\t\treturn Integer.compare(o.first,this.first);\n\t\t}\n\t}\n\tstatic class InputReader {\n\t\tpublic BufferedReader reader;\n\t\tpublic StringTokenizer tokenizer;\n\n\t\tpublic InputReader(InputStream inputstream) {\n\t\t\treader = new BufferedReader(new InputStreamReader(inputstream));\n\t\t\ttokenizer = null;\n\t\t}\n\n\t\tpublic String nextLine(){\n\t\t\tString fullLine=null;\n\t\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\tfullLine=reader.readLine();\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t\treturn fullLine;\n\t\t\t}\n\t\t\treturn fullLine;\n\t\t}\n\t\tpublic String next() {\n\t\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tokenizer.nextToken();\n\t\t}\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "8e717bce93d518684d84601ec43dfcff", "src_uid": "6c2e658ac3c3d6b0569dd373806fa031", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\n\n\npublic class PrimesOnInterval{\n\n\tstatic boolean[] isPrime;\n\tpublic static void sieve()\n\t{\n\t\tisPrime = new boolean[1000005];\n\t\tArrays.fill(isPrime, true);\n\t\tisPrime[0] = isPrime[1] = false;\n\n\t\tfor (int i = 2; i < isPrime.length; i++) {\n\t\t\tif(!isPrime[i])\n\t\t\t\tcontinue;\n\t\t\tfor (int j = i * 2; j < isPrime.length; j += i) \n\t\t\t\tisPrime[j] = false;\n\t\t}\n\n\t}\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st = new StringTokenizer(br.readLine());\n\t\tint a = Integer.parseInt(st.nextToken());\n\t\tint b = Integer.parseInt(st.nextToken());\n\t\tint k = Integer.parseInt(st.nextToken());\n\t\tsieve();\n\t\tint count = 0;\n\t\tint idx = a;\n\t\twhile(count < k && idx <= b)\n\t\t{\n\t\t\tif(isPrime[idx++])\n\t\t\t\tcount++;\n\t\t}\n\t\tif(count != k)\n\t\t{\n\t\t\tSystem.out.println(-1);\n\t\t\treturn;\n\t\t}\n\n\t\tint minL = idx - a;\n\t\tint end = idx;\n\t\tint i = a;\n\t\tfor (; i <= b && end <= b; i++, end++) \n\t\t{\n\t\t\twhile(i <= b && i <= end && !isPrime[i])i++;\n\t\t\twhile(end <= b && !isPrime[end])end++;\n\t\t\t\n\t\t\tminL = Math.max(minL, end - i);\n\t\t}\n\t\tSystem.out.println(minL);\n\t}\n}", "lang_cluster": "Java", "tags": ["two pointers", "binary search", "number theory"], "code_uid": "85f127ec4fa7e3081f629a4c0d6332b8", "src_uid": "3e1751a2990134f2132d743afe02a10e", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedInputStream;\nimport java.io.BufferedOutputStream;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\nimport java.lang.Math.*;\n\n\n\npublic class Main {\n\n public static void main(String[] args) {\n // TODO Auto-generated method stub\n Scanner cin = new Scanner(new BufferedInputStream(System.in));\n PrintWriter cout = new PrintWriter(new BufferedOutputStream(System.out));\n Task work = new Task(cin, cout);\n work.solve();\n cout.flush();\n }\n\n}\nclass Task{\n Scanner cin;\n PrintWriter cout;\n final int maxn = 400005;\n final int MOD = 1000000007;\n int []dp = new int[maxn];\n int r, g;\n public Task(Scanner cin, PrintWriter cout) { \n // TODO Auto-generated constructor stub \n this.cin = cin;\n this.cout = cout;\n r = cin.nextInt();\n g = cin.nextInt();\n }\n public void read() {\n r = cin.nextInt();\n g = cin.nextInt();\n }\n int GetHeight(){\n for (int i = 1; ; i++){\n if (i * (i + 1) / 2 > r + g){\n return i-1;\n }\n }\n }\n public void solve(){\n int h = GetHeight();\n int res = 0;\n dp[0] = 1;\n for (int i = 1; i <= h; i++){\n for (int j = r; j >= 0; j--){\n dp[i+j] = (dp[i+j] + dp[j]) % MOD;\n }\n }\n for (int i = Math.max(h*(h+1)/2 - g, 0); i <= r; i++){\n res = (res + dp[i]) % MOD;\n }\n cout.println(res);\n } \n}", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "8962f53592b7ebd86a935a8f39bf35e2", "src_uid": "34b6286350e3531c1fbda6b0c184addc", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\nimport javax.tools.ToolProvider;\n\n\n\npublic class knapsack {\n\tstatic int a[];\t\n\tstatic int n;\n\tstatic int memo[][];\n\t\n\t\n\n\tpublic static void main(String[] args) throws IOException {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc=new Scanner(System.in);\n\t\tlong n=sc.nextLong();\n\t\tint count=1;\n\t\t\n\t\twhile(n-count>0) {\n\t\t\tn-=count;\n\t\t\tcount++;\n\t\t}\n\t\tSystem.out.println(n);\n\t}\n\t\n\n\t\n\t\n\tstatic class Scanner {\n\n BufferedReader br;\n StringTokenizer st;\n\n Scanner(InputStream system) {\n br = new BufferedReader(new InputStreamReader(system));\n }\n\n String next() throws IOException {\n while (st == null || !st.hasMoreTokens())\n st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n\n int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n\n long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n\n\t}\n\n}\n\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "69e7dbc3df04f5ff8edd2e2053c42c9f", "src_uid": "1db5631847085815461c617854b08ee5", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\nimport java.math.BigInteger;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.HashMap;\nimport java.util.Iterator;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Scanner;\nimport java.util.Set;\nimport java.util.Stack;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n \n public static Scanner input = new Scanner(System.in);\n\n public static void main(String[] args)\n throws IOException {\n\n // BufferedReader buffer=new BufferedReader(new InputStreamReader(System.in));\n // String str;\n// while((str=buffer.readLine())!=null){\n PrintWriter writer = new PrintWriter(new OutputStreamWriter(System.out));\n//while(input.hasNextLine()){\n // Scanner sc=new Scanner(System.in);\n int t=input.nextInt();\n int r=input.nextInt();\n writer.println(Math.min((t+r)/3, Math.min(t, r)));\n writer.flush();\n\n }}", "lang_cluster": "Java", "tags": ["math", "greedy", "implementation", "number theory"], "code_uid": "8677c0e4e561b87d91bad7e3c86fbf64", "src_uid": "0718c6afe52cd232a5e942052527f31b", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.Scanner;\n\npublic class kFactorization_797A {\n\tpublic static boolean prime(int n) {\n\t\tif(n==1)\n\t\t\treturn false;\n\t\tif(n==2)\n\t\t\treturn true;\n\t\tfor(int i=2;i<n;i++)\n\t\t\tif(n%i==0)\n\t\t\t\treturn false;\n\t\treturn true;\n\t}\npublic static void main(String[] args) {\n\tScanner sc=new Scanner(System.in);\n\tint n=sc.nextInt();\n\tint k=sc.nextInt();\n\tint []res=new int[k];\n\tint c=0;\n\tint p=1;\n \n\t\twhile(p<n) {\n\t\t\tif(prime(p) && n%p==0) {\n\t\t\t\tres[c++]=p;\n\t\t\t n=n/p;\n\t\t }\n\t\t\telse\n\t\t p+=1;\n\t\t\tif(c==k-1) {\n\t\t\t\tres[c++]=n;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(prime(n)) {\n\t\t\t\tres[c++]=n;\n\t\t\t break;\n\t\t}\n\t\t \n\t\t}\n\t\tif(c==k) {\n\t\t\tfor(int i=0;i<c;i++)\n\t\t\t\tSystem.out.print(res[i]+\" \");\n\t\t\t\tSystem.out.println();\n\t\t\t\n\t\t}\n\t\telse\n\t\t\tSystem.out.println(-1);\n\t\t\n\t\t\n\t\n\t\t\n\t\n\t\t\n\t\t\n\t\n}\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation", "number theory"], "code_uid": "150c7039a64720c2078ec8335c2a0c4b", "src_uid": "bd0bc809d52e0a17da07ccfd450a4d79", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\npublic class Solution {\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint x = scan.nextInt();\n\t\tint y = scan.nextInt();\n\t\tint z = scan.nextInt();\n\t\tint a = scan.nextInt();\n\t\tint b = scan.nextInt();\n\t\tint c = scan.nextInt();\n\t\tString result = \"YES\";\n\t\tif(x > a) {\n\t\t\tresult = \"NO\";\n\t\t} else {\n\t\t\ta -= x;\n\t\t\tif(y > a + b) {\n\t\t\t\tresult = \"NO\";\n\t\t\t} else {\n\t\t\t\tint k = a + b - y;\n\t\t\t\tif(z > k + c) {\n\t\t\t\t\tresult = \"NO\";\n\t\t\t\t} \n\t\t\t}\n\t\t}\n\t\tSystem.out.println(result);\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "greedy", "implementation"], "code_uid": "3c07c266e8830de67233712270aff2ca", "src_uid": "d54201591f7284da5e9ce18984439f4e", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "//package school3;\n\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n\npublic class A {\n\tScanner in;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t\tMap<String, Integer> map = new HashMap<String, Integer>();\n\t\tString[] x = {\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"};\n\t\tfor(int i = 0;i < x.length;i++){\n\t\t\tmap.put(x[i], i);\n\t\t}\n\t\t\n\t\tString mon = in.next();\n\t\tint n = ni();\n\t\tout.println(x[(map.get(mon) + n) % 12]);\n\t}\n\t\n\tvoid run() throws Exception\n\t{\n\t\tin = INPUT.isEmpty() ? new Scanner(System.in) : new Scanner(INPUT);\n\t\tout = new PrintWriter(System.out);\n\n\t\tsolve();\n\t\tout.flush();\n\t}\n\t\n\t\n\tpublic static void main(String[] args) throws Exception\n\t{\n\t\tnew A().run();\n\t}\n\t\n\tint ni() { return Integer.parseInt(in.next()); }\n\tvoid tr(Object... o) { if(INPUT.length() != 0)System.out.println(o.length > 1 || o[0].getClass().isArray() ? Arrays.deepToString(o) : o[0]); }\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "634d8a72a76356b6be6efc425cb6ce5b", "src_uid": "a307b402b20554ce177a73db07170691", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class may16 {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner s=new Scanner(System.in);\n\t\t//System.out.println(\"enter n\");\n\t\tint n=s.nextInt();\n\t\tint count=n;\n\t\tfor(int i=1; i<=n-1; i++)\n\t\t{\n\t\t\tcount=count + (n-i)*i;\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "359026e9f744c144f0626b786b54caf1", "src_uid": "6df251ac8bf27427a24bc23d64cb9884", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\npublic class Main { \n public static void main(String[] args)\n { \n int n = new Scanner (System.in).nextInt() ; int c = 0 ; int sum = 1 ; \n for (int i=1 ; sum<=n ; i++)\n { \n c++;\n sum+=i;\n n-=sum; \n }\n System.out.println(c); \n }\n} ", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "d7ee1471325c1de6f4187766284f8779", "src_uid": "873a12edffc57a127fdfb1c65d43bdb0", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\n \npublic class Main {\n \n public static void main(String[] args) throws IOException{\n Scanner sc = new Scanner(System.in);//new File(\"input.txt\"));\n PrintWriter pw = new PrintWriter(System.out);//new File(\"output.txt\"));\n int n = sc.nextInt();\n int x = n;\n int m = 0;\n while (x > 0)\n {\n x /= 10;\n m++;\n }\n long ans = (long)n*m + m - 1;\n long k = 1;\n for (int i = 0; i < m-1; i++)\n {\n k *= 10;\n ans -=k;\n }\n pw.println(ans);\n pw.close();\n }\n}", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "43ffa8e3b810949576dc4c05e488a0ba", "src_uid": "4e652ccb40632bf4b9dd95b9f8ae1ec9", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\npublic class Test2\n{\n\tpublic static void main(String args[])\n\t{\n\t\tScanner in = new Scanner(System.in);\n\t\t\n\t long n = in.nextInt();\n\t \n\t \n\t \n\t \n\t long a = (n%100000)/10000;\n\t long b = (n%10000)/1000;\n\t long c = (n%1000)/100;\n\t long d = (n%100)/10;\n\t long e = n%100%10;\n\t \n\t long res = a*10000 + c*1000 + e*100 + d*10 + b;\n\t \n\t long result1 = ((res%100000)*(res%100000))%100000;\n\t long result2 = (((result1%100000)*(result1%100000)*((res%100000)%100000)%100000))%100000;\n\t \n\t a = (result2%100000)/10000;\n\t b = (result2%10000)/1000;\n\t c = (result2%1000)/100;\n\t d = (result2%100)/10;\n\t e = result2%100%10;\n\t \n\t\tSystem.out.println(a+\"\"+b+\"\"+c+\"\"+d+\"\"+e);\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "519659371bf80bec4f067092137a81e0", "src_uid": "51b1c216948663fff721c28d131bf18f", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastScanner in = new FastScanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n D solver = new D();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class D {\n public void solve(int testNumber, FastScanner in, PrintWriter out) {\n long n = in.ni(), k = in.ni();\n long a = in.ni(), b = in.ni();\n long nk = n * k;\n long x = Long.MAX_VALUE;\n long y = 0;\n for (int i = 0; i <= n + 2; i++) {\n long l = a + b + k * i;\n long ans = nk / IntegerUtils.gcd(nk, l);\n x = Math.min(x, ans);\n y = Math.max(y, ans);\n\n l = a - b + k * i;\n if (l > 0) {\n ans = nk / IntegerUtils.gcd(nk, l);\n x = Math.min(x, ans);\n y = Math.max(y, ans);\n }\n\n l = b - a + k * i;\n if (l > 0) {\n ans = nk / IntegerUtils.gcd(nk, l);\n x = Math.min(x, ans);\n y = Math.max(y, ans);\n }\n\n l = -a - b + k * i;\n if (l > 0) {\n ans = nk / IntegerUtils.gcd(nk, l);\n x = Math.min(x, ans);\n y = Math.max(y, ans);\n }\n }\n out.print(x + \" \" + y);\n }\n\n }\n\n static class FastScanner {\n private BufferedReader in;\n private StringTokenizer st;\n\n public FastScanner(InputStream stream) {\n in = new BufferedReader(new InputStreamReader(stream));\n }\n\n public String ns() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n String rl = in.readLine();\n if (rl == null) {\n return null;\n }\n st = new StringTokenizer(rl);\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return st.nextToken();\n }\n\n public int ni() {\n return Integer.parseInt(ns());\n }\n\n }\n\n static class IntegerUtils {\n public static long gcd(long a, long b) {\n while (b != 0) {\n long t = b;\n b = a % b;\n a = t;\n }\n return a;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "implementation", "number theory"], "code_uid": "bcb585dce1352fad2fccafdbe51bf422", "src_uid": "5bb4adff1b332f43144047955eefba0c", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\npublic class Main\n{\n\tpublic static void main(String[] args)throws IOException {\n\t BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n BufferedWriter bw=new BufferedWriter(new OutputStreamWriter(System.out));\n int n=Integer.parseInt(br.readLine());\n int[][] arr=new int[n][n];\n int sum=0;\n for(int i=0;i<n;i++)\n {\n String[] str=br.readLine().split(\" \");\n for(int j=0;j<n;j++)\n {\n arr[i][j]=Integer.parseInt(str[j]);\n if(i==j)\n sum+=arr[i][j];\n if(i+j==n-1)\n sum+=arr[i][j];\n }\n }\n for(int i=0;i<n;i++)\n {\n sum+=arr[n/2][i];\n sum+=arr[i][n/2];\n }\n sum=sum-(3*arr[n/2][n/2]);\n bw.write(sum+\"\\n\");\n\t bw.flush();\n\t}\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "7952e62947cf85599c02c5bf053c0a18", "src_uid": "5ebfad36e56d30c58945c5800139b880", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.IOException;\nimport java.util.HashSet;\nimport java.util.Scanner;\nimport java.util.Set;\n\npublic class lab864B {\n public static void main(String args[]) throws IOException {\n Scanner in = new Scanner(System.in);\n while (in.hasNext()) {\n int n = in.nextInt();\n String arr = in.next();\n String s[] = arr.split(\"[A-Z]\");\n Set set = new HashSet();\n int min = 0;\n for (int i = 0; i < s.length; i++) {\n for (int b = 0; b < s[i].length(); b++) {\n set.add(s[i].charAt(b));\n }\n if (set.size() > min) {\n min = set.size();\n }\n set.clear();\n }\n System.out.println(min);\n }\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "strings", "implementation"], "code_uid": "a25c3ca6bb10846a2182e8d83c17619c", "src_uid": "567ce65f87d2fb922b0f7e0957fbada3", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.lang.*;\n\npublic class Solution{\n public static void main(String []args){\n long d1,d2,d3,dis1,dis2,dis3,dis4;\n Scanner scan=new Scanner(System.in);\n d1=scan.nextInt();\n d2=scan.nextInt();\n d3=scan.nextInt();\n dis1=d1+d2+d3;\n dis2=d1+d3+d3+d1;\n dis3=d2+d3+d3+d2;\n dis4=d1+d1+d2+d2;\n System.out.println(Math.min(dis1,Math.min(dis2,Math.min(dis3,dis4))));\n }\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "14e860a869389eb594baab15b0ad0aed", "src_uid": "26cd7954a21866dbb2824d725473673e", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.HashSet;\nimport java.util.Scanner;\nimport java.util.Set;\n\npublic class Dummy {\n public static void main(String args[]) {\n Scanner in = new Scanner(System.in);\n //variable\n int t = in.nextInt();\n int n,k,d;\n int ans[] = new int[t];\n\n //variable\n for (int i=0; i<t; i++) {\n\n n = in.nextInt();\n int tv[] = new int[n];\n Set<Integer> s = new HashSet<Integer>();\n k = in.nextInt();\n d = in.nextInt();\n ans[i] = k;\n for (int j = 0; j < n; j++) {\n tv[j] = in.nextInt();\n }\n for (int j = 0; j < n; j++) {\n for (int z = 0; z < d; z++) {\n if (j+z<n){\n s.add(tv[j + z]);\n }\n }\n //System.out.println(\"set size=\" +s.size());\n if (s.size() < ans[i]) {\n ans[i] = s.size();\n }\n s.clear();\n if (j+d>=n){\n break;\n }\n }\n\n }\n for (int i=0; i<t; i++){\n System.out.println(ans[i]);\n }\n\n\n }\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "d4e413ac5a6b81b672e34be11938993b", "src_uid": "56da4ec7cd849c4330d188d8c9bd6094", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\npublic class A70 {\n\tpublic static void main(String args[]){\n\n\t\tScanner in = new Scanner(System.in);\n\n\t\tint n = in.nextInt();\n\t\t\n\t\tif (n==0) System.out.println(\"1\");\n\t\telse{\n\t\t\tint sum = 1;\n\t\t\twhile(n>1){\n\t\t\t\tsum=sum*3%1000003;\n\t\t\t\tn--;\n\t\t\t}\n\t\t\tSystem.out.println(sum);\n\t\t}\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "0ad03af2f6af24c1382804a17f5ba5c3", "src_uid": "1a335a9638523ca0315282a67e18eec7", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\n\npublic class C304C {\n \n static Vector<Vector<Integer>> hash1 = new Vector() , hash2 = new Vector();\n \n public static void main(String[] args) {\n \n Scanner in = new Scanner(System.in);\n int n = in.nextInt();\n int k = in.nextInt();\n \n Vector<Integer> v1 = new Vector<Integer>() , v2 = new Vector();\n for(int i = 0;i < k;i ++)v1.add(in.nextInt());\n \n k = in.nextInt();\n \n for(int i = 0;i < k;i ++)v2.add(in.nextInt());\n \n /*if(v1.size() != v2.size()){\n System.out.println(-1);\n return;\n }*/\n \n hash1.add(v1); hash2.add(v2);\n \n int sum = 0;\n while(true){\n if(v1.get(0) > v2.get(0)){\n v1.add(v2.remove(0)); v1.add(v1.remove(0));\n }else{\n v2.add(v1.remove(0)); v2.add(v2.remove(0));\n }\n \n sum ++;\n if(v1.size() == 0 || v2.size() == 0)break;\n \n if(sum > 200000){\n System.out.println(-1);\n return ;\n }\n \n }\n \n System.out.println(sum + \" \" + (v1.size() == 0?2:1));\n }\n\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "brute force", "games"], "code_uid": "c0fd50f642adffc7b5705b9ee8eb8fbd", "src_uid": "f587b1867754e6958c3d7e0fe368ec6e", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\n \npublic class Solution{\n \n public static void main(String args[]){\n \n Scanner scan = new Scanner(System.in);\n \n int limar = scan.nextInt();\n int bob = scan.nextInt();\n int years = 0;\n while(limar<=bob){\n years++;\n limar=limar*3;\n bob=bob*2;\n }\n System.out.println(years);\n }\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "b23f44483bdcc3d6b24126517bec844c", "src_uid": "a1583b07a9d093e887f73cc5c29e444a", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\n\n\n\n\n\n\n \npublic class ne {\n\tstatic class Reader1 {\n\t static BufferedReader reader;\n\t static StringTokenizer tokenizer;\n\n\t /** call this method to initialize reader for InputStream */\n\t static void init(InputStream input) {\n\t reader = new BufferedReader(\n\t new InputStreamReader(input) );\n\t tokenizer = new StringTokenizer(\"\");\n\t }\n\n\t /** get next word */\n\t static String next() throws IOException {\n\t while ( ! tokenizer.hasMoreTokens() ) {\n\t //TODO add check for eof if necessary\n\t tokenizer = new StringTokenizer(\n\t reader.readLine() );\n\t }\n\t return tokenizer.nextToken();\n\t }\n\n\t static int nextInt() throws IOException {\n\t return Integer.parseInt( next() );\n\t }\n\t\t\n\t static double nextDouble() throws IOException {\n\t return Double.parseDouble( next() );\n\t }\n\t static float nextFloat() throws IOException {\n\t return Float.parseFloat( next() );\n\t }\n\t static long nextLong() throws IOException {\n\t return Long.parseLong( next() );\n\t }}\npublic static void main(String[] args) throws IOException{\n\t\t\n\n\t\tReader1.init(System.in);\n\t\tint n=Reader1.nextInt();\n\t\tint m=Reader1.nextInt();\n\t\tint[] a= new int[m+n];\n\t\tfor(int i=0;i<m+n;i++)\n\t\t\ta[i]=-1;\n\t\tint m1=m;\n\t\tint n1=n;\n\t\tn1--;\n\t\t//Starting with n=1 and m=0\n\t\ta[0]=1;\n\t\tfor(int i=1;i<m+n;i++)\n\t\t{\n\t\t\t\t\tif(i%2==0)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(a[i-1]==1)\n\t\t\t\t\t\t\t{if(n1>0)\n\t\t\t\t\t\t\t\t{a[i]=1;n1--;}\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\t{a[i]=0;m1--;}}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif(m1>0)\n\t\t\t\t\t\t\t{a[i]=0;m1--;}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\t{a[i]=1;n1--;}}\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tif(a[i-1]==1)\n\t\t\t\t\t\t\t{if(m1>0)\n\t\t\t\t\t\t\t\t{a[i]=0;m1--;}\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\t{a[i]=1;n1--;}}\n\t\t\t\t\t\t\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\t{if(a[i-1]==0)\n\t\t\t\t\t\t\t{if(n1>0)\n\t\t\t\t\t\t\t\t{a[i]=1;n1--;}\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\t{a[i]=0;m1--;}}}\n\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n}\t\n\t\t//n\n//\t\tfor(int i=0;i<m+n;i++)\n//\t\t\tSystem.out.print(a[i]+\" \");\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\tint count=0;\n\t\tfor(int i=0;i<m+n-1;i++)\n\t\t{\n\t\t\tif((a[i]^a[i+1])==0)\n\t\t\t\tcount++;\n\t\t\t\n\t\t\t\n\t\t}\n\t\t m1=m;\n\t\tn1=n;\n\t\t//m-0\n\t\ta[0]=0;\n\t\tm1--;\n\t\tfor(int i=1;i<m+n;i++)\n\t\t{\n\t\t\t\t\tif(i%2==0)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(a[i-1]==1)\n\t\t\t\t\t\t\t{if(n1>0)\n\t\t\t\t\t\t\t\t{a[i]=1;n1--;}\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\t{a[i]=0;m1--;}}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif(m1>0)\n\t\t\t\t\t\t\t{a[i]=0;m1--;}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\t{a[i]=1;n1--;}}\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tif(a[i-1]==1)\n\t\t\t\t\t\t\t{if(m1>0)\n\t\t\t\t\t\t\t\t{a[i]=0;m1--;}\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\t{a[i]=1;n1--;}}\n\t\t\t\t\t\t\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\t{if(a[i-1]==0)\n\t\t\t\t\t\t\t{if(n1>0)\n\t\t\t\t\t\t\t\t{a[i]=1;n1--;}\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\t{a[i]=0;m1--;}}}\n\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n}\tint count1=0;\n\t\tfor(int i=0;i<m+n-1;i++)\n\t\t{\n\t\t\tif((a[i]^a[i+1])==0)\n\t\t\t\tcount1++;\n\t\t\t\n\t\t\t\n\t\t}\n\t\t\n\t\t//m\n//\t\t\t\tfor(int i=0;i<m+n;i++)\n//\t\t\t\t\tSystem.out.print(a[i]+\" \");\n\t\t\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\tint count2=0;\n\t\tif(count1>count)\n\t\t\tcount2=count1;\n\t\telse\n\t\t\tcount2=count;\n\t\tint k=m+n-1-count2;\n\t\tSystem.out.println(count2+\" \"+ k);\n\t\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\t\n}\n\n}//5 5 ans should be 0 9 \n// 5 4 ans should be 1 7\n", "lang_cluster": "Java", "tags": ["greedy", "implementation", "games"], "code_uid": "c52d1f27ee834ace0e30ea86cc9330bb", "src_uid": "c8378e6fcaab30d15469a55419f38b39", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.math.*;\nimport java.io.*;\n\n\npublic class q_3 {\n static Scanner sc;\n\n public static void main(String[] args){\n sc = new Scanner(System.in);\n int n = getInt();\n int[] arr = new int[n/2];\n for(int i=0 ; i<n/2 ; i++){\n arr[i] = getInt()-1;\n }\n Arrays.sort(arr);\n // all black\n int c= 0;\n long bb = 0l;\n for(int i=0 ; i<n/2 ; i++ , c+=2){\n bb+=Math.abs(arr[i]-c);\n }\n long ww = 0l;\n c = 1;\n for(int i=0 ; i<n/2 ; i++ , c+=2){\n ww+=(Math.abs(arr[i] - c));\n }\n System.out.println(Math.min(bb,ww));\n\n }\n\n\n\n\n\n public static int getInt(){\n return sc.nextInt();\n }\n\n public static String getString(){\n return sc.next();\n }\n\n public static String nextLine(){\n return sc.nextLine();\n }\n\n public static long nextLong(){\n return sc.nextLong();\n }\n\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "949a0c9c1579764f4c2e3037181d96ed", "src_uid": "0efe9afd8e6be9e00f7949be93f0ca1a", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\npublic class BearAndFindingCriminal {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint a = sc.nextInt();\n\t\tint crim = 0;\n\t\tsc.nextLine();\n\t\tint city [] = new int [n+1];\n\t\tfor (int i = 1; i <= n; i++) {\n\t\t\tcity[i] = sc.nextInt();\n\t\t}\n\t\tif (city[a] == 1) {\n\t\t\tcrim++;\n\t\t}\n\t\tif (n/2 >= a) {\n\t\t\tfor (int i = 2*a; i <= n; i++) {\n\t\t\t\tif (city[i] == 1) {\n\t\t\t\t\tcrim++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int i = a + 1; i < 2*a; i++) {\n\t\t\t\tif (city[i] == 1 && city[i] == city[2*a - i]) {\n\t\t\t\t\tcrim += 2;\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tfor (int i = 1; i < 2*a-n; i++) {\n\t\t\t\tif (city[i] == 1) {\n\t\t\t\t\tcrim++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int i = a + 1; i <= n; i++) {\n\t\t\t\tif (city[i] == 1 && city[i] == city[2*a - i]) {\n\t\t\t\t\tcrim += 2;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(crim);}\n\t}", "lang_cluster": "Java", "tags": ["constructive algorithms", "implementation"], "code_uid": "63be2ef9adb293a326e25d433bc5b3cf", "src_uid": "4840d571d4ce6e1096bb678b6c100ae5", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package round491;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class E {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t\tlong n = nl();\n\t\tint m = Long.toString(n).length();\n\t\tint[] f = new int[10];\n\t\tfor(char c : Long.toString(n).toCharArray()){\n\t\t\tf[c-'0']++;\n\t\t}\n\t\t\n\t\tint M = 1;\n\t\tfor(int i = 0;i < 10;i++){\n\t\t\tf[i]++;\n\t\t\tM *= f[i];\n\t\t}\n\t\t\n\t\tlong[] dp = new long[M];\n\t\tdp[0] = 1;\n\t\tlong ans = 0;\n\t\tfor(int k = 1;k <= m;k++){\n\t\t\tlong[] ndp = new long[M];\n\t\t\t\n\t\t\tint[] b = new int[10];\n\t\t\tint id = 0;\n\t\t\tdo{\n\t\t\t\tfor(int j = 0;j <= 9;j++){\n\t\t\t\t\tif(b[j] + 1 < f[j]){\n\t\t\t\t\t\tb[j]++;\n\t\t\t\t\t\tif(j >= 1){\n\t\t\t\t\t\t\tboolean ok = true;\n\t\t\t\t\t\t\tfor(int t = 0;t < 10;t++){\n\t\t\t\t\t\t\t\tif(f[t] == 1 || b[t] >= 1){\n\t\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\t\tok = false;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif(ok)ans += dp[id];\n\t\t\t\t\t\t}\n\t\t\t\t\t\tndp[(int)encInc(b, f)] += dp[id];\n\t\t\t\t\t\tb[j]--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tid++;\n\t\t\t}while(inc(b, f));\n\t\t\tdp = ndp;\n\t\t}\n\t\tout.println(ans);\n\t}\n\npublic static boolean inc(int[] b, int[] a)\n{\n\tfor(int i = b.length-1;i >= 0;i--){\n\t\tif(++b[i] < a[i])return true;\n\t\tb[i] = 0;\n\t}\n\treturn false;\n}\n\n\t\n\tpublic static long encInc(int[] a, int[] lim)\n\t{\n\t\tlong code = 0;\n\t\tfor(int i = 0;i < a.length;i++){\n\t\t\tcode = code * lim[i] + a[i];\n\t\t}\n\t\treturn code;\n\t}\n\t\n\tpublic static int[] decInc(long code, int[] lim)\n\t{\n\t\tint n = lim.length;\n\t\tint[] a = new int[n];\n\t\tfor(int i = n-1;i >= 0;i--){\n\t\t\ta[i] = (int)(code % lim[i]);\n\t\t\tcode /= lim[i];\n\t\t}\n\t\treturn a;\n\t}\n\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new E().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "combinatorics"], "code_uid": "920e77876e5f299a3257b41dc5f00ed9", "src_uid": "7f4e533f49b73cc2b96b4c56847295f2", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\n\npublic class Smile {\n\tstatic Scanner in;\n\tstatic PrintWriter out;\t\n\n\tpublic static void main(String[] args) {\n\t\tin = new Scanner(System.in);\n\t\tout = new PrintWriter(System.out);\n\t\tint n = in.nextInt();\n\t\tint d = in.nextInt();\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta[i] = in.nextInt();\n\t\t}\n\t\tArrays.sort(a);\n\t\tint m = in.nextInt();\n\t\tint temp = Math.min(n, m);\n\t\tint ans = 0;\n\t\tfor (int i = 0; i < temp; i++) {\n\t\t\tans += a[i];\n\t\t}\n\t\tif (m > temp) {\n\t\t\tans = ans - d * (m - temp);\n\t\t}\n\t\tout.println(ans);\n\t\tout.close();\n}\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "7842150647279e0f0bb3271db25a12ed", "src_uid": "5c21e2dd658825580522af525142397d", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main{\n\npublic static int[] res;\npublic static int cont;\n\npublic static void main(String [] args) throws Exception{\nBufferedReader entrada = new BufferedReader(new InputStreamReader(System.in));\nint n=Integer.parseInt(entrada.readLine());\nres= new int[n];\ncont=0;\ns(n);\nStringBuilder sb = new StringBuilder();\nsb.append(n+\" \");\nfor(int i=0;i<cont;i++)\nsb.append(res[i]+\" \");\nSystem.out.println(sb.toString().trim());\n}\n\npublic static void s(int n){\n for(int i=n-1;i>=1;i--)\n if(n%i==0){\n res[cont++]=i;\n s(i);\n return;\n }\n}\n\n}", "lang_cluster": "Java", "tags": ["greedy"], "code_uid": "94f78cb24101eb09b5c15ef27918a57d", "src_uid": "2fc946bb72f56b6d86eabfaf60f9fa63", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class A{\n \n public static void main(String args[]){\n Scanner s=new Scanner(System.in);\n int n=s.nextInt();\n int a[]=new int[n];\n for(int i=0;i<n;i++)\n a[i]=s.nextInt();\n int sm=0;\n Arrays.sort(a);\n for(int i=0;i<n-1;i+=2)\n sm+=a[i+1]-a[i];\n System.out.println(sm);\n }\n}", "lang_cluster": "Java", "tags": ["sortings"], "code_uid": "e14358902ee815140dec3552fc5d4140", "src_uid": "55485fe203a114374f0aae93006278d3", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\n\npublic class EightEightEightB {\n byte inputCommNum;\n int answer = 0;\n String commands;\n\n public static void main (String[] args) {\n EightEightEightB c = new EightEightEightB();\n c.readParams();\n c.solve();\n\n System.out.println(c.getAnswer());\n }\n\n private void solve() {\n int ls = 0;\n int rs = 0;\n int us = 0;\n int ds = 0;\n for (byte i = 0; i < commands.length(); i++) {\n char c = commands.charAt(i);\n switch (c) {\n case 'U':\n us++;\n break;\n case 'D':\n ds++;\n break;\n case 'L':\n ls++;\n break;\n case 'R':\n rs++;\n break;\n default:\n break;\n }\n }\n if (ls == 0 || rs == 0) {\n answer = 2 * Math.min(us, ds);\n } else if (us == 0 || rs == 0) {\n answer = 2 * Math.min(ls, rs);\n } else {\n answer = (byte) (2 * (Math.min(ls, rs) + Math.min(us, ds)));\n }\n }\n\n private void readParams() {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n try {\n inputCommNum = Byte.parseByte(br.readLine());\n commands = br.readLine();\n } catch (IOException e) {\n return;\n }\n }\n\n public int getAnswer() {\n return answer;\n }\n\n}\n", "lang_cluster": "Java", "tags": ["greedy"], "code_uid": "b23c012be217b9775f85d1ec66183cc3", "src_uid": "b9fa2bb8001bd064ede531a5281cfd8a", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n public static void main(String args[]) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader inputReader = new InputReader(inputStream);\n PrintWriter printWriter = new PrintWriter(outputStream);\n TaskSolver solver = new TaskSolver(inputReader, printWriter);\n solver.solve();\n printWriter.close();\n }\n}\n\nclass TaskSolver {\n private InputReader in;\n private PrintWriter out;\n\n public TaskSolver(InputReader inputReader, PrintWriter printWriter) {\n in = inputReader;\n out = printWriter;\n }\n\n public void solve() {\n int a = in.nextInt();\n int b = in.nextInt();\n int m = in.nextInt();\n int r0 = in.nextInt();\n int[] r = new int[ (int) 1e+6];\n int[] check = new int[ (int) 1e+6];\n Arrays.fill(check, -1);\n r[0] = (a * r0 + b) % m;\n check[r[0]] = 0;\n int res = 0;\n for (int i = 1; ; i++) {\n r[i] = (a * r[i - 1] + b) % m;\n if (check[r[i]] == -1) {\n check[r[i]] = i;\n } else {\n res = i - check[r[i]];\n break;\n }\n }\n out.print(res);\n }\n}\n\nclass InputReader {\n private BufferedReader reader;\n private StringTokenizer tokenizer;\n\n public InputReader(InputStream inputStream) {\n reader = new BufferedReader(new InputStreamReader(inputStream));\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n}\n", "lang_cluster": "Java", "tags": ["implementation", "number theory"], "code_uid": "cf3553d38ae3939fe0f19340d40dbe3d", "src_uid": "9137197ee1b781cd5cc77c46f50b9012", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.StreamTokenizer;\nimport java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.List;\nimport java.util.Set;\nimport java.util.TreeSet;\n\npublic class Main {\n\t\n\tprivate static StreamTokenizer inputReader = new StreamTokenizer(\n\t\t\tnew BufferedReader(new InputStreamReader(System.in)));\n\t\n\tpublic static int nextInt() {\n\t\tint a = -1;\n\t\ttry {\n\t\t\tinputReader.nextToken();\n\t\t\ta = (int) inputReader.nval;\n\t\t} catch (Exception e) {\n\t\t}\n\t\treturn a;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tint n = nextInt();\n\t\t\n\t\tint[] xs = new int[n];\n\t\tint[] ys = new int[n];\n\t\t\n\t\tint minX = Integer.MAX_VALUE;\n\t\tint maxX = Integer.MIN_VALUE;\n\t\tint minY = Integer.MAX_VALUE;\n\t\tint maxY = Integer.MIN_VALUE;\n\t\t\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint x = nextInt();\n\t\t\tint y = nextInt();\n\t\t\t\n\t\t\tif (x < minX) {\n\t\t\t\tminX = x;\n\t\t\t}\n\t\t\t\n\t\t\tif (x > maxX) {\n\t\t\t\tmaxX = x;\n\t\t\t}\n\t\t\t\n\t\t\tif (y < minY) {\n\t\t\t\tminY = y;\n\t\t\t}\n\t\t\t\n\t\t\tif (y > maxY) {\n\t\t\t\tmaxY = y;\n\t\t\t}\t\n\t\t}\n\t\t\n\t\tint diffX = maxX - minX;\n\t\tint diffY = maxY - minY;\n\t\t\n\t\tint area = diffX * diffY;\n\t\t\n\t\tif (area == 0) {\n\t\t\tSystem.out.println(-1);\n\t\t} else {\n\t\t\tSystem.out.println(Math.abs(area));\n\t\t}\n\t\t\n\t\t\n\t}\n\t\n\tprivate static class Pair implements Comparable<Pair>{\n\t\tint x;\n\t\tint y;\n\t\t\n\t\tpublic Pair(int x, int y) {\n\t\t\tthis.x = x;\n\t\t\tthis.y = y;\n\t\t}\n\n\t\t@Override\n\t\tpublic int compareTo(Pair other) {\n\t\t\tif (this.x != other.x) {\n\t\t\t\treturn Integer.compare(this.x, other.x);\n\t\t\t}\n\t\t\t\n\t\t\treturn Integer.compare(this.y, other.y);\n\t\t}\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["geometry", "implementation"], "code_uid": "e9ceb088f490428f34912c7c686c2912", "src_uid": "ba49b6c001bb472635f14ec62233210e", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Bisoye\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scanner in = new Scanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n APaintTheNumbers solver = new APaintTheNumbers();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class APaintTheNumbers {\n public void solve(int testNumber, Scanner in, PrintWriter out) {\n\n int n = in.nextInt();\n\n int[] A = new int[n];\n for (int i = 0; i < n; i++) {\n int c = in.nextInt();\n\n A[i] = c;\n }\n\n Arrays.sort(A);\n\n boolean rem[] = new boolean[n];\n int count = 0;\n for (int i = 0; i < n; i++) {\n if (rem[i]) continue;\n for (int j = i; j < n; j++) {\n if (rem[j]) continue;\n if (A[j] % A[i] == 0) {\n rem[j] = true;\n }\n }\n count++;\n }\n out.println(count);\n\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "greedy", "implementation"], "code_uid": "cb53fe61ee0fbfed9010184f7f3b81f4", "src_uid": "63d9b7416aa96129c57d20ec6145e0cd", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\n\npublic class WhereDoITurn227A\n{\n public static void main(String[] args) \n {\n // Set up scanner\n Scanner sc = new Scanner(System.in); \n // System.out.println(\"Enter xa\");\n long xa = sc.nextLong();\n // System.out.println(\"Enter ya\");\n long ya = sc.nextLong();\n \n // System.out.println(\"Enter xb\");\n long xb = sc.nextLong();\n // System.out.println(\"Enter yb\");\n long yb = sc.nextLong();\n \n // System.out.println(\"Enter xc\");\n long xc = sc.nextLong();\n // System.out.println(\"Enter yc\");\n long yc = sc.nextLong();\n \n if (xa==xb && ya<yb)\n {\n if (yb<yc)\n {\n System.out.println(\"TOWARDS\");\n return;\n }\n else if (xb<xc)\n {\n System.out.println(\"RIGHT\");\n return;\n }\n else\n {\n System.out.println(\"LEFT\");\n return;\n }\n }\n \n if (xa==xb && ya>yb)\n {\n if (yb>yc)\n {\n System.out.println(\"TOWARDS\");\n return;\n }\n else if (xb<xc)\n {\n System.out.println(\"LEFT\");\n return;\n }\n else\n {\n System.out.println(\"RIGHT\");\n return;\n }\n }\n \n if (xa<xb && ya==yb)\n {\n if (xb<xc)\n {\n System.out.println(\"TOWARDS\");\n return;\n }\n else if (yb>yc)\n {\n System.out.println(\"RIGHT\");\n return;\n }\n else\n {\n System.out.println(\"LEFT\");\n return;\n }\n }\n \n if (xa>xb && ya==yb)\n {\n if (xb>xc)\n {\n System.out.println(\"TOWARDS\");\n return;\n }\n else if (yb>yc)\n {\n System.out.println(\"LEFT\");\n return;\n }\n else\n {\n System.out.println(\"RIGHT\");\n return;\n }\n }\n \n if (xa<xb && ya<yb)\n {\n if (xb<xc && yb<yc)\n {\n System.out.println(\"TOWARDS\");\n return;\n }\n else if (xb<xc)\n {\n System.out.println(\"RIGHT\");\n return;\n }\n else\n {\n System.out.println(\"LEFT\");\n return;\n }\n }\n \n if (xa<xb && ya>yb)\n {\n if (xb<xc && yb>yc)\n {\n System.out.println(\"TOWARDS\");\n return;\n }\n else if (xb<xc)\n {\n System.out.println(\"LEFT\");\n return;\n }\n else\n {\n System.out.println(\"RIGHT\");\n return;\n }\n }\n \n if (xa>xb && ya<yb)\n {\n if (xb>xc && yb<yc)\n {\n System.out.println(\"TOWARDS\");\n return;\n }\n else if (xb>xc)\n {\n System.out.println(\"LEFT\");\n return;\n }\n else\n {\n System.out.println(\"RIGHT\");\n return;\n }\n }\n \n if (xa>xb && ya>yb)\n {\n if (xb>xc && yb>yc)\n {\n System.out.println(\"TOWARDS\");\n return;\n }\n else if (xb>xc)\n {\n System.out.println(\"RIGHT\");\n return;\n }\n else\n {\n System.out.println(\"LEFT\");\n return;\n }\n }\n }\n}\n \n ", "lang_cluster": "Java", "tags": ["geometry"], "code_uid": "e49b7e65bb285cd586e71bb378fe704c", "src_uid": "f6e132d1969863e9f28c87e5a44c2b69", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class B734 {\n public static void main(String [] args) {\n Scanner sc = new Scanner(System.in);\n int [] array = new int[4];\n int result = 0;\n\n for (int i = 0; i < 4; i++) {\n array[i] = sc.nextInt();\n }\n\n int tfx = Math.min(array[0],Math.min(array[2],array[3]));\n int tt = Math.min(array[0], array[1]);\n\n if (tfx == array[0]) {\n result = tfx * 256;\n } else {\n if (tfx == 0) {\n result = tt * 32;\n } else {\n if (tt >= array[0] - tfx) {\n result = tfx * 256 + ((array[0] - tfx) * 32);\n } else {\n result = tfx * 256 + tt * 32;\n }\n }\n }\n\n System.out.println(result);\n\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "greedy", "implementation", "brute force"], "code_uid": "c3d2ddd004358e1f4a19925e96038091", "src_uid": "082b31cc156a7ba1e0a982f07ecc207e", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.Scanner;\n\npublic class CalculatingFunction {\n\n\tpublic static void main(String[] args) {\n\t\ttry {\n\t\t\tScanner scan=new Scanner(System.in);\n\t\t\tlong n=scan.nextLong();\n\t\t\tlong res=0;\n\t\t\tif(n%2==0)\n\t\t\t{\n\t\t\t\tres=n/2;\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\telse {\n\t\t\t\tres=(n/2)-n;\n\t\t\t}\n\t\t\tSystem.out.println(res);\n\t\t} catch (Exception e) {\n\t\t\t// TODO: handle exception\n\t\t}\n\t\t\n\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "d9bf64d0016b4c030bda1438a92e9fef", "src_uid": "689e7876048ee4eb7479e838c981f068", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.Scanner;\n\npublic class A59 {\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n\n String str = scan.next();\n int upper = 0;\n int lower = 0;\n for(int i = 0; i < str.length(); i++) {\n char c = str.charAt(i);\n if(Character.toLowerCase(c) == c) {\n lower++;\n } else {\n upper++;\n }\n }\n\n String output = (upper > lower) ? str.toUpperCase() : str.toLowerCase();\n System.out.println(output);\n }\n}\n", "lang_cluster": "Java", "tags": ["strings", "implementation"], "code_uid": "8f52e080344aebabd52d456dc6ac3350", "src_uid": "b432dfa66bae2b542342f0b42c0a2598", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "\nimport java.util.Scanner;\n\npublic class champion {\n\tstatic long n, m, k;\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tn = scan.nextLong();\n\t\tm = scan.nextLong();\n\t\tk = scan.nextLong();\n\t\tlong low = 1;\n\t\tlong high = n * (m+1);\n\t\t\n\t\twhile(low < high) {\n\t\t\tlong x = (high+low) >> 1;\n\t\t\tif(works(x)) {\n\t\t\t\tlow = x+1;\n\t\t\t} else {\n\t\t\t\thigh = x;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(high-1);\n\t\t\n\t}\n\t\n\tpublic static boolean works(long attempt) {\n\t\tlong num = 0;\n\t attempt--;\n\t for(int i=1; i<=n; ++i) {\n\t \tnum += Math.min(m, attempt/i);\n\t }\n\t return num < k;\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "binary search"], "code_uid": "972c33fcb58683376442c2606eb3992c", "src_uid": "13a918eca30799b240ceb9de47507a26", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\npublic class cheaptravel {\npublic static void main (String[]args)\n{\n\tScanner sc = new Scanner (System.in);\n\tint annplan = sc.nextInt();//a\n\tint mtickplan = sc.nextInt();//b\n\tint onetickp = sc.nextInt();//c\n\tint mtickp = sc.nextInt();//d\n\tint a1=annplan/mtickplan;\n\tint a2=a1*mtickplan;\n\tint a3=annplan-a2;\n\tint price=0;\n\tif(mtickp==(onetickp*mtickplan))//\n\t\tprice=onetickp*annplan;\n\tif((onetickp*(a1+a3))<((a1*mtickp)))\n\t{\nprice=onetickp*annplan;\n\t}\n\tif(mtickp<(onetickp*mtickplan) && mtickp<onetickp)\n\t{\n\t\tprice=(a1+a3)*mtickp;\n\t}\n\t\tif(mtickp<(onetickp*mtickplan) && onetickp<mtickp)\n\t\t{\n\t\t\tprice=a1*mtickp;\n\t\t\tprice+=a3*onetickp;\n\t\t}\n\t\t\tif(mtickp>(onetickp*mtickplan) && onetickp<mtickp)\n\t\t\t{\n\t\t\t\tprice=(a2+a3)*onetickp;\n\t\t\t}\n\t\t\t\tif((mtickplan>annplan)&&(mtickp<(onetickp*annplan)))\n\t\t\t\t\t\t{\n\t\t\t\t\tprice=mtickp;\n\t\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\t\tif(mtickp<onetickp)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tprice=a1*mtickp;\n\t\t\t\t if(a3>0&&a3<mtickplan)\n\t\t\t\t \tprice+=mtickp;\n\t\t\t\t \t\tif (a3>0&&a3>mtickplan)\n\t\t\t\t \t\t{\n\t\t\t\t \t\t\twhile(a3 >mtickplan)\n\t\t\t\t \t\t\t{\n\t\t\t\t \t\t\t\tprice+=mtickp;\n\t\t\t\t \t\t\t\ta3-=mtickplan;\n\t\t\t\t \t\t\t}\n\t\t\t\t \t\t\tprice+=mtickp;\n\t\t\t\t \t\t}\n\t\t\t\t \t\t\t\n\t\t\t\t\t\t}\n\t\t\t\t\t//else\n\t\t\t\t\t\tif(mtickp==onetickp)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tprice=a1*mtickp;\n\t\t\t\t\t\t\tif(a3>0&&a3<mtickplan)\n\t\t\t\t \tprice+=mtickp;\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\tif (a3>0&&a3>mtickplan)\n\t\t \t\t{\n\t\t \t\t\twhile(a3 >mtickplan)\n\t\t \t\t\t{\n\t\t \t\t\t\tprice+=mtickp;\n\t\t \t\t\t\ta3-=mtickplan;\n\t\t \t\t\t}\n\t\t \t\t\tprice+=mtickp;\n\t\t \t\t}\n\t\t\t\t\t\t}\nSystem.out.print(price);\t\n}\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "da17213d176f1ae6fc2c6ab0261e29c9", "src_uid": "faa343ad6028c5a069857a38fa19bb24", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.io.OutputStream;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\nimport java.io.BufferedOutputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Kattio in = new Kattio(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskAA solver = new TaskAA();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskAA {\n public void solve(int testNumber, Kattio in, PrintWriter out) {\n int n = in.nextInt();\n int m = in.nextInt();\n\n int[] ans = new int[n + 1];\n for (int i = 0; i < m; ++i) {\n int x = in.nextInt();\n for (int j = x; j <= n; ++j) {\n if (ans[j] != 0) break;\n ans[j] = x;\n }\n }\n\n for (int i = 1; i <= n; ++i)\n out.print(ans[i] + \" \");\n }\n\n }\n\n static class Kattio extends PrintWriter {\n private BufferedReader r;\n private String line;\n private StringTokenizer st;\n private String token;\n\n public Kattio(InputStream i) {\n super(new BufferedOutputStream(System.out));\n r = new BufferedReader(new InputStreamReader(i));\n }\n\n public Kattio(InputStream i, OutputStream o) {\n super(new BufferedOutputStream(o));\n r = new BufferedReader(new InputStreamReader(i));\n }\n\n public int nextInt() {\n return Integer.parseInt(nextToken());\n }\n\n private String peekToken() {\n if (token == null)\n try {\n while (st == null || !st.hasMoreTokens()) {\n line = r.readLine();\n if (line == null) return null;\n st = new StringTokenizer(line);\n }\n token = st.nextToken();\n } catch (IOException e) {\n }\n return token;\n }\n\n private String nextToken() {\n String ans = peekToken();\n token = null;\n return ans;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "0d08556fdac02861bbec2bcd7001d392", "src_uid": "2e44c8aabab7ef7b06bbab8719a8d863", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Problem_50A {\n\n\tstatic public void main(String[] args) throws java.lang.Exception{\n\t\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n\t\t\n\t\tString[] temp = in.readLine().split(\" \");\n\t\tint M = Integer.parseInt(temp[0]);\n\t\tint N = Integer.parseInt(temp[1]);\n\t\t\n\t\tint area = M * N;\n\t\t\n\t\tif(area == 1){\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tSystem.out.println(area / 2);\n\t\treturn;\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "greedy"], "code_uid": "a740b44f2360432d797fafbc6d6c491c", "src_uid": "e840e7bfe83764bee6186fcf92a1b5cd", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "// A : Is your horseshoe on the other hoof?\n\nimport java.util.Scanner;\n\npublic class A {\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int cnt = 0;\n boolean f;\n int[] values = new int[4];\n for (int i = 0; i < 4; i++) {\n values[i] = in.nextInt();\n f = false;\n for (int j = 0; j < i; j++) {\n if (values[i] == values[j]) {\n f = true;\n }\n }\n if (f) {\n cnt++;\n }\n }\n System.out.println(cnt);\n }\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "c02d2174255a8875c037d585de129b03", "src_uid": "38c4864937e57b35d3cce272f655e20f", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.*;\n\npublic class cod {\n\n static int INFINITY = 2000000000;\n\n public static void main(String[] args) throws IOException {\n br = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n sc = new StringTokenizer(\"\");\n\n int array[] = new int[10];\n\n String line = br.readLine();\n String str[] = line.split(\" \");\n\n int num[] = new int[str.length];\n\n for (int i = 0; i < num.length; i++) {\n num[i] = Integer.parseInt(str[i]);\n }\n\n for (int i = 0; i < num.length; i++) {\n array[num[i]]++;\n }\n\n boolean legs = false;\n for (int i = 1; i < array.length; i++) {\n if (array[i] >= 4) {\n legs = true;\n array[i] -=4;\n break;\n }\n }\n\n if (!legs) {\n System.out.println(\"Alien\");\n } else {\n boolean elep=false;\n for (int i = 1; i < array.length; i++) {\n if (array[i] == 2) {\n System.out.println(\"Elephant\");\n elep=true;\n }\n }\n if(!elep){\n System.out.println(\"Bear\");\n }\n }\n\n }// end Main.\n\n static BufferedReader br;\n static StringTokenizer sc;\n static PrintWriter out;\n\n static String nxtTok() throws IOException {\n while (!sc.hasMoreTokens()) {\n String s = br.readLine();\n if (s == null)\n return null;\n sc = new StringTokenizer(s.trim());\n }\n return sc.nextToken();\n }\n\n static int nxtInt() throws IOException {\n return Integer.parseInt(nxtTok());\n }\n\n static long nxtLng() throws IOException {\n return Long.parseLong(nxtTok());\n }\n\n static double nxtDbl() throws IOException {\n return Double.parseDouble(nxtTok());\n }\n\n static int[] nxtIntArr(int n) throws IOException {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = nxtInt();\n return a;\n }\n\n static long[] nxtLngArr(int n) throws IOException {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nxtLng();\n return a;\n }\n\n static char[] nxtCharArr() throws IOException {\n return nxtTok().toCharArray();\n }\n\n}// end class\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "012fc68c3157c6812d4097a99935acfc", "src_uid": "43308fa25e8578fd9f25328e715d4dd6", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\n\n\npublic class CodeForce {\n\t\n\t\n\t\n\t\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringBuilder sb = new StringBuilder();\n\t//\tint t=Integer.parseInt(br.readLine());\n\t\t\n\t//\twhile(t-->0)\n\tString[] sr=br.readLine().split(\" \");\n\tint n=Integer.parseInt(sr[0]);\n\tint a=Integer.parseInt(sr[1]);\n\tint b=Integer.parseInt(sr[2]);\n\tint temp=Math.min(a, b);\n\tint temp1=Math.max(a, b);\n\ta=temp;\n\tb=temp1;\n\tint l=(int)(Math.log(n)/Math.log(2));\n\tQueue<Integer>q=new LinkedList<Integer>();\n\tQueue<Integer>st1=new LinkedList<Integer>();\n\tint count=2;\n\t\n\tif(n==2)\n\t{\n\t\tSystem.out.println(\"Final!\");\n\t\treturn;\n\t}\n\t\n\tfor(int i=1;i<=n;i=i+2)\n\t{\n\t\tif(i==a&&i+1==b)\n\t{System.out.println(\"1\");\n\t\treturn;}\n\t\tif(i==a||i+1==a)\n\t\t\tq.add(a);\n\t\t\n\t\telse if(i==b||i+1==b)\n\t\t\tq.add(b);\n\t\t\n\t\telse\n\t\t\tq.add(i+1);\n\t\t\n\t\t\t\n\t}\n\n\t\n\t\n\t\n\t\n\t\n\twhile(true)\n\t{\n\t\tif(st1.isEmpty())\n\t{\n\t\t\twhile(!q.isEmpty())\n\t{\n\t\t\tint x=q.poll();\n\t int y=q.poll();\n\t if(x==a&&y==b)\n\t\t{if(count==l)\n\t\t\tSystem.out.println(\"Final!\");\n\t\telse System.out.println(count);\n\t\t\treturn;}\n\t\t\tif(x==a||y==a)\n\t\t\t\tst1.add(a);\n\t\t\t\n\t\t\telse if(x==b||y==b)\n\t\t\t\tst1.add(b);\n\t\t\t\n\t\t\telse\n\t\t\t\tst1.add(y);\n\t\t\n\t}\n\t}\n\telse if(q.isEmpty())\n\t{\n\t\twhile(!st1.isEmpty())\n\t\t{\n\t\tint x=st1.poll();\n\t int y=st1.poll();\n\t if(x==a&&y==b)\n\t {if(count==l)\n\t\t\tSystem.out.println(\"Final!\");\n\t\telse System.out.println(count);\n\t\t\treturn;}\n\t\t\tif(x==a||y==a)\n\t\t\t\tq.add(a);\n\t\t\t\n\t\t\telse if(x==b||y==b)\n\t\t\t\tq.add(b);\n\t\t\t\n\t\t\telse\n\t\t\t\tq.add(y);\n\t\t\n\t}}\n\t\tcount++;\n\t}\n\t\t\n\t\n\n\n\n\n\t\n\t\t\n\t\t\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\t\t\t}}", "lang_cluster": "Java", "tags": ["constructive algorithms", "implementation"], "code_uid": "d7ba340e792f157b48f18d5ff187f867", "src_uid": "a753bfa7bde157e108f34a28240f441f", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.ArrayList;\n\nimport java.util.Scanner;\n\npublic class Duplicateelement {\n\n\n public static void main(String[] args) {\n Scanner input=new Scanner(System.in);\n int n,c=0;\n int c1=0;\n n=input.nextInt();\n String s;\n s=input.next();\n for (int i = 0; i < s.length(); i++) {\n if(s.charAt(i)=='0'){\n \n c1++;\n }else{\n c++;\n }\n }\n if(c>0){\n System.out.print(\"1\");\n }\n \n for (int i = 0; i < c1; i++) {\n System.out.print(\"0\");\n }\n \n \n }\n \n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "d1685c369faf2932785dd91e9a03f1c4", "src_uid": "ac244791f8b648d672ed3de32ce0074d", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n/*\n * \tHeart beats fast\n * \t\tColors and promises\n * \t\t\tHow to be brave\n * \t\t\t\tHow can I love when I am afraid to fall...\n */\npublic class Main \n{\n\tpublic static void main(String[] args)\n\t{\n\t\tlong n=ni(),m=ni();\n\t\tlong k=nl();\n\t\tif(k<n)\n\t\t{\n\t\t\tpr((k+1)+\" \"+1);\n\t\t}\n\t\telse if(k<n+m-1)\n\t\t{\n\t\t\tpr(n+\" \"+(k-n+2));\n\t\t}\n\t\telse if(k==n+m-1)\n\t\t{\n\t\t\tpr((n-1)+\" \"+m);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tlong te=k-n-m+1;\n\t\t\tn--;\n\t\t\tm--;\n\t\t\tif((n-te/m)%2==1)\n\t\t\tpr((n-te/m)+\" \"+(m+1-te%m));\n\t\t\telse\n\t\t\t\tpr(n-te/m+\" \"+(te%m+2));\n\t\t}\n\t\tSystem.out.print(output);\n\t}\n\t\n\t\n\t///////////////////////////////////////////\n\t///////////////////////////////////////////\n\t///template from here\n\tstatic final long mod=1000000007;\n\tstatic final double eps=1e-8;\n\tstatic final long inf=100000000000000000L;\n\tstatic Reader in=new Reader();\n\tstatic StringBuilder output=new StringBuilder();\n\tstatic Random rn=new Random();\n\t//output functions////////////////\n\tstatic void pr(Object a){output.append(a+\"\\n\");}\n\tstatic void pr(){output.append(\"\\n\");}\n\tstatic void p(Object a){output.append(a);}\n\tstatic void pra(int[]a){for(int i:a)output.append(i+\" \");output.append(\"\\n\");}\n\tstatic void pra(long[]a){for(long i:a)output.append(i+\" \");output.append(\"\\n\");}\n\tstatic void pra(String[]a){for(String i:a)output.append(i+\" \");output.append(\"\\n\");}\n\tstatic void pra(double[]a){for(double i:a)output.append(i+\" \");output.append(\"\\n\");}\n\tstatic void sop(Object a){System.out.println(a);}\n\tstatic void flush(){System.out.println(output);output=new StringBuilder();}\n\t//////////////////////////////////\n\t//input functions/////////////////\n\tstatic int ni(){return in.nextInt();}\n\tstatic long nl(){return Long.parseLong(in.next());}\n\tstatic String ns(){return in.next();}\n\tstatic double nd(){return Double.parseDouble(in.next());}\n\tstatic int[] nia(int n){int a[]=new int[n];for(int i=0; i<n; i++)a[i]=ni();return a;}\n\tstatic int[] pnia(int n){int a[]=new int[n+1];for(int i=1; i<=n; i++)a[i]=ni();return a;}\n\tstatic long[] nla(int n){long a[]=new long[n];for(int i=0; i<n; i++)a[i]=nl();return a;}\n\tstatic String[] nsa(int n){String a[]=new String[n];for(int i=0; i<n; i++)a[i]=ns();return a;}\n\tstatic double[] nda(int n){double a[]=new double[n];for(int i=0; i<n; i++)a[i]=nd();return a;}\n\t//////////////////////////////////\n\t//some utility functions\n\tstatic void psort(Integer[][] a)\n\t{\n\t\tArrays.sort(a, new Comparator<Integer[]>()\n\t\t{\n\t\t\t@Override\n\t\t\tpublic int compare(Integer[]a,Integer[]b)\n\t\t\t{\n\t\t\t\tif(a[0]>b[0])\n\t\t\t\t\treturn 1;\n\t\t\t\telse if(b[0]>a[1])\n\t\t\t\t\treturn -1;\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t});\n\t}\n\tstatic String pr(String a, long b)\n\t{\n\t\tString c=\"\";\n\t\twhile(b>0)\n\t\t{\n\t\t\tif(b%2==1)\n\t\t\t\tc=c.concat(a);\n\t\t\ta=a.concat(a);\n\t\t\tb>>=1;\n\t\t}\n\t\treturn c;\n\t}\n\tstatic long powm(long a, long b, long m)\n\t{\n\t\tlong an=1;\n\t\tlong c=a;\n\t\twhile(b>0)\n\t\t{\n\t\t\tif(b%2==1)\n\t\t\t\tan=(an*c)%m;\n\t\t\tc=(c*c)%m;\n\t\t\tb>>=1;\n\t\t}\n\t\treturn an;\n\t}\n\tstatic int gcd(int a, int b)\n\t{\n\t\tif(b==0)\n\t\t\treturn a;\n\t\telse\n\t\t\treturn gcd(b, a%b);\n\t}\n\t/////////////////////////\n\tstatic class Reader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n public Reader() {\n reader = new BufferedReader(new InputStreamReader(System.in), 32768);\n tokenizer = null;\n }\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n public int nextInt() {\n return Integer.parseInt(next());\n }\n public long nextLong() {\n \treturn Long.parseLong(next());\n }\n public double nextDouble() {\n \treturn Double.parseDouble(next());\n }\n }\n}", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "097ae1970bb685eed44e3ebff04a1204", "src_uid": "e88bb7621c7124c54e75109a00f96301", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "//package Codeforces;\n\nimport java.util.Scanner;\n\npublic class FafaAndCompany {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner in = new Scanner(System.in);\n\t\tint n = in.nextInt();\n\t\tint m = n;\n\t\tint count = 0;\n\t\t\n\t\tif(n==2) {\n\t\t\tSystem.out.println(1);\n\t\t\treturn;\n\t\t}\n\t\tfor(int i=2;i<n;i++) {\n\t\t\tm-=i;\n\t\t\tif(n%m==0) count++;\n\t\t\tm = n;\n\t\t}\n\t\t\n\t\tSystem.out.println(count);\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "2d0b6e6fe75ddeb7835ad583a1e05d4c", "src_uid": "89f6c1659e5addbf909eddedb785d894", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.lang.*;\npublic class Main {\n\n static int[] arr ;\n static int[] index;\n static int[] ans ;\n\n public static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n String a = sc.next();\n String b = sc.next();\n int la = a.length(), lb = b.length();\n arr = new int[la];\n index = new int[10];\n ans = new int[la];\n long A = Long.parseLong(a);\n //System.out.println(A);\n long B = Long.parseLong(b);\n /*if(A==B) {\n System.out.println(A);\n return;\n }*/\n for (int i = 0; i < la; i++, A /= 10) {\n arr[i] = (int)(A % 10);\n //System.out.println(arr[i]);\n index[arr[i]]++;\n }\n int pos = 0;\n boolean flag=false, match = true;\n if (la < lb) {\n rev_order(0);\n\n for (int i = 0; i < la; i++) {\n System.out.print(ans[i]);\n }\n //System.out.println(Arrays.toString(ans));\n }\n\n else if (la == lb) {\n int i;\n label:\n for (i = 0; i < lb; i++) {\n int temp = Character.getNumericValue(b.charAt(i));\n //System.out.println(temp);\n if (!match) break label;\n flag = false;\n for (int j = temp; j >= 0; j--) {\n if (index[j] > 0) {\n ans[i] = j;\n index[j]--;\n flag = true;\n if (j < temp) {\n match = false;\n }\n break;\n }\n }\n if (!flag) {\n break label;\n }\n }\n\n if (!match && i < lb) {\n rev_order(i);\n }\n\n else if(!flag){\n //System.out.println(i);\n for(i--; i>=0; i--){\n int t = hasLt(i);\n if(t==0) {\n rev_order(i+1);\n break;\n }\n }\n }\n\n for (int x = 0; x < la; x++) {\n System.out.print(ans[x]);\n }\n\n }\n //System.out.println(Arrays.toString(ans));\n }\n\n\n static void rev_order(int n){\n int p=n;\n for(int i=9;i>=0;i--){\n for(int j=index[i];j>0;j--){\n ans[p++]=i;\n }\n }\n }\n\n static int hasLt(int n){\n int temp=ans[n];\n index[ans[n]]++;\n // System.out.println(n+\" \"+temp+\" \"+index[ans[n]]+\" \"+index[temp-1]);\n for (int i = temp - 1; i >= 0; i--) {\n if (index[i] > 0) {\n ans[n] = i;\n index[i]--;\n return 0;\n }\n }\n return -1;\n }\n}\n", "lang_cluster": "Java", "tags": ["greedy", "dp"], "code_uid": "9c00fd8b44638df7669ecaa8d206243d", "src_uid": "bc31a1d4a02a0011eb9f5c754501cd44", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class Main {\n FastScanner in;\n PrintWriter out;\n \n public void solve() throws IOException {\n int a = in.nextInt(), n = in.nextInt();\n int m = a + n;\n int[] f = new int[m];\n int[] c = new int[m];\n for(int k = 2; k < m; k++)\n if(f[k] == 0) {\n long s = 1l * k * k;\n if(s < m)\n for(int i = (int)s; i < m; i += k)\n f[i] = k;\n f[k] = k;\n }\n c[1] = 1;\n for(int k = 2; k < m; k++) {\n int p = f[k];\n int r = c[k / p];\n if(k % (1l * p * p * r) == 0) \n c[k] = p * p * r;\n else\n c[k] = r;\n }\n long ans = 0;\n for(int i = a; i < m; i++) {\n ans += i / c[i];\n }\n out.println(ans);\n }\n\n public void run() {\n try {\n// in = new FastScanner(new File(\".in\"));\n// out = new PrintWriter(new File(\".out\"));\n \n in = new FastScanner(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n \n solve();\n\n out.close();\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n\n class FastScanner {\n BufferedReader br;\n StringTokenizer st;\n\n FastScanner(InputStreamReader f) {\n try {\n br = new BufferedReader(f);\n } catch (Exception e) {\n e.printStackTrace();\n }\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n }\n\n public static void main(String[] arg) {\n new Main().run();\n }\n}", "lang_cluster": "Java", "tags": ["number theory"], "code_uid": "8bd9581c4253f442d7556c7713737359", "src_uid": "915081861e391958dce6ee2a117abd4e", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\npublic class DataRecovery{\n public static void main(String[] argv) throws Exception{\n BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n String[] words=br.readLine().trim().split(\" \");\n int n=Integer.parseInt(words[0]), m=Integer.parseInt(words[1]), min=Integer.parseInt(words[2]), max=Integer.parseInt(words[3]);\n int cur;\n words=br.readLine().trim().split(\" \");\n int aMax=Integer.parseInt(words[0]), aMin=Integer.parseInt(words[0]);\n for(int i=1; i<m; i++){\n cur=Integer.parseInt(words[i]);\n if(cur>aMax){\n aMax=cur;\n }\n if(cur<aMin){\n aMin=cur;\n }\n }\n if(aMin<min || aMax>max){\n System.out.println(\"Incorrect\");\n }else if(aMin==min && aMax==max){\n System.out.println(\"Correct\");\n }else if((aMin==min || aMax==max) && n-m>=1){\n System.out.println(\"Correct\");\n }else if(n-m>=2){\n System.out.println(\"Correct\");\n }else{ \n System.out.println(\"Incorrect\");\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "f3d13eaa11fe6b86c62ef5e8875cc808", "src_uid": "99f9cdc85010bd89434f39b78f15b65e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.IOException;\nimport java.io.OutputStreamWriter;\nimport java.util.Arrays;\nimport java.io.BufferedWriter;\nimport java.util.InputMismatchException;\nimport java.util.ArrayList;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.Writer;\nimport java.math.BigInteger;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Crash\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tOutputWriter out = new OutputWriter(outputStream);\n\t\tTaskD solver = new TaskD();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskD {\n\tprivate static final int modulo = 1000000007;\n\tprivate int[] calc(int a, int b) {\n\t\treturn new int[] {1 + a / 2 + b / 2, (a + 1) / 2 + (b + 1) / 2};\n\t}\n\tpublic void solve(int testNumber, InputReader in, OutputWriter out) {\n\t\tint w = in.readInt();\n\t\tint h = in.readInt();\n\t\tlong ans = 0;\n\t\tfor (int i = 0; i < 2; i ++)\n\t\t\tfor (int j = 0; j < 2; j ++) {\n\t\t\t\tint[] cx = calc(i, w - i);\n\t\t\t\tint[] cy = calc(j, h - j);\n\t\t\t\tlong tmp = 0;\n\t\t\t\ttmp = (tmp + (long)cx[0] * cy[0] * (w + 1) * (h + 1)) % modulo;\n\t\t\t\ttmp = (tmp + (long)cx[0] * cy[1] * cx[0] * (h + 1)) % modulo;\n\t\t\t\ttmp = (tmp + (long)cx[1] * cy[0] * (w + 1) * cy[0]) % modulo;\n\t\t\t\ttmp = (tmp + (long)cx[1] * cy[1] * cx[0] * cy[0]) % modulo;\n\t\t\t\ttmp = (tmp + (long)cx[1] * cy[1] * cx[1] * cy[1]) % modulo;\n\t\t\t\tans = (ans + tmp * ((w - i) / 2 + 1) * ((h - j) / 2 + 1)) % modulo;\n\t\t\t}\n\t\tans = (ans - (w + 1) * (h + 1)) % modulo;\n\t\tans = (ans - (long)(w + 1) * (h + 1) * ((w + 1) * (h + 1) - 1) * 3) % modulo;\n\t\tans = (ans - (long)(w + 1) * (h + 1) * h * (h - 1)) % modulo;\n\t\tans = (ans - (long)(h + 1) * (w + 1) * w * (w - 1)) % modulo;\n\t\tfor (int i = 1; i <= w; i ++)\n\t\t\tfor (int j = 1; j <= h; j ++) {\n\t\t\t\tint t = NumberTheory.gcd(i, j) - 1;\n\t\t\t\tans = (ans - (long)(w - i + 1) * (h - j + 1) % modulo * t * 12) % modulo;\n\t\t\t}\n\t\tans = (ans + modulo) % modulo;\n\t\tout.printLine(ans);\n\t}\n}\n\nclass InputReader {\n\tprivate InputStream stream;\n\tprivate byte[] buf = new byte[1000];\n\tprivate int curChar;\n\tprivate int numChars;\n\n\tpublic InputReader(InputStream stream) {\n\t\tthis.stream = stream;\n\t}\n\n\tprivate int read() {\n\t\tif (numChars == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (curChar >= numChars) {\n\t\t\tcurChar = 0;\n\t\t\ttry {\n\t\t\t\tnumChars = stream.read(buf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (numChars <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buf[curChar++];\n\t}\n\n\tpublic int readInt() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tint res = 0;\n\t\tdo {\n\t\t\tif (c < '0' || c > '9')\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n\n\tprivate boolean isSpaceChar(int c) {\n\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t}\n}\n\nclass OutputWriter {\n\tprivate final PrintWriter writer;\n\n\tpublic OutputWriter(OutputStream outputStream) {\n\t\twriter = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n\t}\n\n\tpublic OutputWriter(Writer writer) {\n\t\tthis.writer = new PrintWriter(writer);\n\t}\n\n\tpublic void print(Object...objects) {\n\t\tfor (int i = 0; i < objects.length; i++) {\n\t\t\tif (i != 0)\n\t\t\t\twriter.print(' ');\n\t\t\twriter.print(objects[i]);\n\t\t}\n\t}\n\n\tpublic void printLine(Object...objects) {\n\t\tprint(objects);\n\t\twriter.println();\n\t}\n\n\tpublic void close() {\n\t\twriter.close();\n\t}\n}\n\nclass NumberTheory {\n\tprivate NumberTheory() {\n\t}\n\n\tpublic static int gcd(int m, int n) {\n\t\tif (m == 0) return n;\n\t\twhile (n > 0) {\n\t\t\tint r = m % n;\n\t\t\tm = n;\n\t\t\tn = r;\n\t\t}\n\t\treturn m;\n\t}\n\n\t}\n\n", "lang_cluster": "Java", "tags": ["math", "geometry"], "code_uid": "26a92ab3962c78aac09988da79cbe333", "src_uid": "984788e4b4925c15c9c6f31e42f2f8fa", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.math.BigDecimal;\nimport java.math.BigInteger;\nimport java.text.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint t[] = new int[4];\n\t\tfor (int i = 0; i < 4; i++) {\n\t\t\tt[i] = sc.nextInt();\n\t\t}\n\t\tArrays.sort(t);\n\t\tif(t[0]+t[1]>t[2]||t[1]+t[2]>t[3]) System.out.println(\"TRIANGLE\");\n\t\telse if(t[0]+t[1]==t[2]||t[1]+t[2]==t[3]) System.out.println(\"SEGMENT\");\n\t\telse System.out.println(\"IMPOSSIBLE\");\n\t}\n\n}", "lang_cluster": "Java", "tags": ["brute force", "geometry"], "code_uid": "c2b1b83bb2c4254d1cbd52dd8929adc8", "src_uid": "8f5df9a41e6e100aa65b9fc1d26e447a", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class Solution\n{\n public static void main(String[] args)\n {\n Scanner sc=new Scanner(System.in);\n long n,k,h;\n n=sc.nextLong();\n k=sc.nextLong();\n if((n&1)==1)\n h=(n/2)+1;\n else\n h=n/2;\n if(k<=h)\n {\n System.out.println(k*2-1);\n }\n else\n {\n System.out.println((k-h)*2);\n }\n }\n}", "lang_cluster": "Java", "tags": ["math"], "code_uid": "ea0b4b7428ae3ffde2768a2080924f32", "src_uid": "1f8056884db00ad8294a7cc0be75fe97", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Scanner;\n\n\npublic class p266B {\n\n\t/**\n\t * @param args\n\t */\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint n, t;\n\t\tn = in.nextInt();\n\t\tt = in.nextInt();\n\t\tString s = in.next();\n\t\tfor(int i = 0; i<t; i++){\n\t\t\tStringBuilder a = new StringBuilder();\n\t\t\tfor(int j = 0; j<s.length(); j++)\n\t\t\t\tif(j < s.length()-1 && s.charAt(j) == 'B' && s.charAt(j+1) == 'G'){\n\t\t\t\t\tj++;\n\t\t\t\t\ta.append(\"GB\");\n\t\t\t\t}else a.append(s.charAt(j));\n\t\t\ts = a.toString();\n\t\t}\n\t\tSystem.out.println(s);\n\t\tin.close();\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["constructive algorithms", "implementation", "shortest paths", "graph matchings"], "code_uid": "bc26d0d65c2d9c3d423b43f85c4e4fc4", "src_uid": "964ed316c6e6715120039b0219cc653a", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "/**\n * Created with IntelliJ IDEA.\n * User: Venky\n * If you don't understand this code,\n * you should be flipping burgers instead.\n */\nimport java.io.*;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n static void solve() throws IOException {\n long l = nextLong();\n long r = nextLong();\n if(l == r)\n {\n out.println(\"0\");\n return;\n }\n String binaryL = Long.toBinaryString(l);\n StringBuffer binaryR = new StringBuffer(Long.toBinaryString(r));\n if(binaryL.length() != binaryR.length())\n {\n for(int i=0;i<binaryR.length();i++)\n binaryR.setCharAt(i, '1');\n out.println(Long.parseLong(binaryR.toString(), 2));\n return;\n }\n int index = 0;\n for(int i=1;i<binaryR.length();i++)\n {\n if(binaryR.charAt(i) == '1' && binaryL.charAt(i) == '0')\n {\n index = i;\n break;\n }\n }\n for(int i=0;i<binaryR.length();i++)\n {\n if(i >= index)\n binaryR.setCharAt(i, '1');\n else\n binaryR.setCharAt(i, '0');\n }\n long ans = Long.parseLong(binaryR.toString(), 2);\n out.println(ans);\n }\n\n static BufferedReader br;\n static StringTokenizer st;\n static PrintWriter out;\n\n public static void main(String[] args) throws IOException {\n InputStream input = System.in;\n PrintStream output = System.out;\n br = new BufferedReader(new InputStreamReader(input));\n out = new PrintWriter(output);\n solve();\n out.close();\n }\n\n static long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n static double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n static int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n static String nextToken() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n String line = br.readLine();\n if (line == null) {\n return null;\n }\n st = new StringTokenizer(line);\n }\n return st.nextToken();\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "dp", "bitmasks", "greedy", "implementation"], "code_uid": "60e6b542fadb178cc3fc8397371ccfee", "src_uid": "d90e99d539b16590c17328d79a5921e0", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/*\n * To change this license header, choose License Headers in Project Properties.\n * To change this template file, choose Tools | Templates\n * and open the template in the editor.\n */\nimport java.util.*;\nimport java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n/**\n *\n * @author Admin\n */\npublic class Cf371A {\n\n /**\n * @param args the command line arguments\n */\n public static void main(String[] args) throws IOException {\n // TODO code application logic here\n BufferedReader scan = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st = new StringTokenizer(scan.readLine());\n long l1 = Long.parseLong(st.nextToken());\n long r1 = Long.parseLong(st.nextToken());\n long l2 = Long.parseLong(st.nextToken());\n long r2 = Long.parseLong(st.nextToken());\n long k = Long.parseLong(st.nextToken());\n long l = Math.max(l1, l2);\n long r = Math.min(r1, r2);\n if(l>r) System.out.println(\"0\");\n\telse{\n \tif(k>=l && k<=r) System.out.println(r-l);\n \telse System.out.println(r-l+1);\n\t}\n }\n \n}", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "64781cdb1368bf56496b62af30fae1e8", "src_uid": "9a74b3b0e9f3a351f2136842e9565a82", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class ProblemR {\n\n\tpublic static void main(String[] args) {\n\t\tInputReader in = new InputReader();\n\t\tPrintWriter out = new PrintWriter(System.out);\n\n\t\tnew ProblemR().solve(in, out);\n\n\t\tout.close();\n\t}\n\n\tpublic void solve(InputReader in, PrintWriter out) {\n\t\tlong n = in.nextLong();\n\n\t\tn = n - n / 2 - n / 3 - n / 5 - n / 7 + n / 6 + n / 10 + n / 14 + n / 15 + n / 21 + n / 35 - n / (2 * 3 * 5) - n / (2 * 3 * 7) - n / (2 * 5 * 7) - n\n\t\t\t\t/ (3 * 5 * 7) + n / (2 * 3 * 5 * 7);\n\n\t\tout.println(n);\n\t}\n\n\tstatic class InputReader {\n\t\tpublic BufferedReader br;\n\t\tpublic StringTokenizer st;\n\n\t\tpublic InputReader() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tpublic String next() {\n\t\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tString nextLine() {\n\t\t\tString str = \"\";\n\t\t\ttry {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn str;\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "fdf22a057477fe1b293e2fc0e3294b03", "src_uid": "e392be5411ffccc1df50e65ec1f5c589", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Scanner;\n\npublic class A104 {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tn = n - 10;\n\t\tif (n == 10) {\n\t\t\tSystem.out.println(\"15\");\n\t\t} else {\n\t\t\tif ((n <= 11) && (n >= 1)) {\n\t\t\t\tSystem.out.println(\"4\");\n\t\t\t} else {\n\t\t\t\tSystem.out.println(\"0\");\n\t\t\t}\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "d1c806fb61fcd191efd1c909b999a656", "src_uid": "5802f52caff6015f21b80872274ab16c", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "\nimport java.io.PrintWriter;\nimport java.util.HashSet;\nimport java.util.Queue;\nimport java.util.Scanner;\nimport java.util.Set;\nimport java.util.concurrent.LinkedBlockingQueue;\n\npublic class C214 {\n int n;\n boolean room[][];\n boolean dep[][];\n int num[];\n int idx[];\n boolean visited[];\n int ans = Integer.MAX_VALUE;\n Set<Integer> zeros;\n static int [][] pay;\n static {\n pay = new int[3][3];\n for( int i =0; i<3 ; i ++){\n pay[i][i] = 0;\n pay[i][(i+1)%3] = 1;\n pay[i][(i+2)%3] = 2;\n }\n }\n\n public void solve(Scanner cin , PrintWriter cout ){\n n = cin.nextInt();\n room = new boolean[3][n];\n dep = new boolean[n][n];\n num = new int[n];\n idx = new int[n];\n visited = new boolean[n];\n for( int i=0 ;i <n ; i ++){\n idx[i] = cin.nextInt()-1;\n room[idx[i]][i] = true;\n }\n\n zeros = new HashSet<Integer>();\n for( int i= 0;i <n ; i ++){\n int k = cin.nextInt();\n num[i] = k;\n if( k ==0) {\n zeros.add(i);\n }\n for( int j=0;j <k ; j ++){\n int pre = cin.nextInt() - 1;\n dep[pre][i] = true;\n }\n }\n for( int r = 0; r < 3 ; r ++) {\n Set<Integer> bak_zeros = new HashSet<Integer>(zeros);\n visited = new boolean[n];\n int [] bak_num = new int[n];\n for( int i=0;i<n;i++){\n bak_num [i] = num[i];\n }\n search(r,0);\n zeros = bak_zeros;\n num = bak_num;\n }\n cout.println(ans);\n }\n\n private void search(int r,int cost){\n if( cost >= ans)\n return;\n if( zeros.size() == 0 ){\n if( cost < ans ) {\n ans = cost;\n }\n return;\n }\n Queue<Integer> zs = new LinkedBlockingQueue<Integer>();\n Set<Integer> bak_zeros = new HashSet<Integer>();\n \n for( int zero : zeros){\n if( idx[zero] == r) {\n zs.add(zero);\n bak_zeros.add(zero);\n }\n }\n while(!zs.isEmpty()) {\n int now = zs.poll();\n zeros.remove(now);\n cost ++ ;\n visited[now] = true;\n for( int i=0 ;i < n ; i ++) {\n if( !visited[i] && dep[now][i] && num[i] > 0) {\n num[i] -- ;\n if( num[i] == 0) {\n if( idx[i] == r ) {\n zs.add(i);\n } else{\n zeros.add(i);\n }\n }\n }\n }\n }\n if( zeros.size() == 0 ){\n if( cost < ans ) {\n ans = cost;\n }\n return ;\n }\n search((r+1)%3,cost + pay[r][(r+1)%3]);\n }\n\n public static void main (String [] args){\n C214 solution = new C214();\n Scanner cin = new Scanner(System.in);\n PrintWriter cout = new PrintWriter(System.out);\n solution.solve(cin, cout);\n cin.close();\n cout.close();\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "greedy"], "code_uid": "36b98975075f68c5eb5b0cf28733675f", "src_uid": "be42e213ff43e303e475d77a9560367f", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.lang.reflect.Array;\nimport java.util.*;\n\npublic class Main {\n\n\n public static int[] pref_f(String s) {\n int n = s.length();\n int[] pf = new int[n];\n for(int i = 1; i < n; i++){\n int j = pf[i-1];\n while (j > 0 && s.charAt(i) != s.charAt(j)){\n j = pf[j-1];\n }\n if (s.charAt(i) == s.charAt(j)) j++;\n pf[i] = j;\n }\n return pf;\n }\n\n public static void shortestPaths(List<Edge>[] edges, int s, int[] d, int[] pred) {\n Arrays.fill(pred, -1);\n Arrays.fill(d, Integer.MAX_VALUE);\n d[s] = 0;\n PriorityQueue<Long> q = new PriorityQueue<>();\n q.add((long) s);\n while (!q.isEmpty()) {\n long cur = q.remove();\n int curu = (int) cur;\n if (cur >>> 32 != d[curu])\n continue;\n for (Edge e : edges[curu]) {\n int v = e.t;\n int nprio = d[curu] + e.cost;\n if (d[v] > nprio) {\n d[v] = nprio;\n pred[v] = curu;\n q.add(((long) nprio << 32) + v);\n }\n }\n }\n }\n\n public static class Edge {\n int t;\n int cost;\n\n public Edge(int t, int cost) {\n this.t = t;\n this.cost = cost;\n }\n }\n\n\n public static void main(String[] args) throws IOException {\n FastScanner in = new FastScanner(System.in);\n FastPrinter out = new FastPrinter(System.out);\n //FastScanner in = new FastScanner(new InputStreamReader(new FileInputStream(new File(\"strings.in\"))));\n //FastPrinter out = new FastPrinter(new OutputStreamWriter(new FileOutputStream(new File(\"strings.out\"))));\n ArrayList<Integer> list = new ArrayList<>();\n int n = in.nextInt();\n int[] mas = new int[1000000];\n for(int i = 2; i < 1000000; i++){\n if(mas[i] == 0){\n list.add(i);\n long k = (long)i * (long)i;\n while (k < 1000000){\n mas[(int)k] = 1;\n k += i;\n }\n }\n }\n int r = n-1;\n int max = 0;\n for(int i = 0; i < list.size(); i++){\n if(list.get(i) > n) break;\n if(n % list.get(i) == 0){\n max = list.get(i);\n }\n }\n int l = (n-max) + 1;\n\n max = r;\n for(int i = l; i <= r; i++){\n if(mas[i] == 0) continue;\n int k1 = 0;\n int k2 = i;\n for(int j = 0; j < list.size(); j++){\n int p = list.get(j);\n\n if((long)p * p > k2) break;\n\n if(k2 % p == 0){\n k1 = p;\n while (k2 % p == 0) k2 /= p;\n }\n\n if(k2 == p) {k1 = 1; break;}\n }\n if(k2 > k1) k1 = k2;\n if((i - k1 + 1) < max) max = (i - k1 + 1);\n }\n System.out.println(max);\n out.close();\n }\n}\n\nclass FastPrinter {\n private final PrintWriter writer;\n\n public FastPrinter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public FastPrinter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void println(long i) {\n writer.println(i);\n }\n\n public void println(double d) {\n writer.println(d);\n }\n\n public void println(String s) {\n writer.println(s);\n }\n\n public void println(String format, Object... args) {\n println(String.format(format, args));\n }\n\n public void println() {\n writer.println();\n }\n\n public void print(long i) {\n writer.print(i);\n }\n\n public void print(char c) {\n writer.print(c);\n }\n\n public void print(double d) {\n writer.print(d);\n }\n\n public void print(String s) {\n writer.print(s);\n }\n\n public void print(String format, Object... args) {\n print(String.format(format, args));\n }\n\n public void flush() {\n writer.flush();\n }\n}\n\nclass FastScanner {\n\n private BufferedReader reader;\n private StringTokenizer st;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private SpaceCharFilter filter;\n\n public FastScanner(InputStream stream) {\n this.reader = new BufferedReader(new InputStreamReader(stream));\n this.st = new StringTokenizer(\"\");\n }\n\n public FastScanner(InputStreamReader stream) {\n this.reader = new BufferedReader(stream);\n this.st = new StringTokenizer(\"\");\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public String next() {\n while (!st.hasMoreTokens()) {\n st = new StringTokenizer(readLine());\n }\n return st.nextToken();\n }\n\n public String nextLine() {\n st = new StringTokenizer(\"\");\n return readLine();\n }\n\n public String tryNextLine() {\n st = new StringTokenizer(\"\");\n return tryReadLine();\n }\n\n private String readLine() {\n String line = tryReadLine();\n if (line == null) throw new InputMismatchException();\n return line;\n }\n\n private String tryReadLine() {\n try {\n return reader.readLine();\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n }\n\n public int[] nextIntArray(int size) {\n int[] array = new int[size];\n for (int i = 0; i < size; i++)\n array[i] = nextInt();\n return array;\n }\n\n public int[][] nextIntTable(int rowCount, int columnCount) {\n int[][] table = new int[rowCount][];\n for (int i = 0; i < rowCount; i++)\n table[i] = nextIntArray(columnCount);\n return table;\n }\n\n public long[] nextLongArray(int size) {\n long[] array = new long[size];\n for (int i = 0; i < size; i++)\n array[i] = nextLong();\n return array;\n }\n\n public long[][] nextLongTable(int rowCount, int columnCount) {\n long[][] table = new long[rowCount][];\n for (int i = 0; i < rowCount; i++)\n table[i] = nextLongArray(columnCount);\n return table;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\t' || isEOL(c);\n }\n\n public static boolean isEOL(int c) {\n return c == '\\n' || c == '\\r' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "c3e83bb855717b683fac3ce3f9c5afe9", "src_uid": "43ff6a223c68551eff793ba170110438", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author ky112233\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scanner in = new Scanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n ALoveA solver = new ALoveA();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class ALoveA {\n public void solve(int testNumber, Scanner in, PrintWriter out) {\n String str = in.next();\n int n = str.length();\n int cnt = 0;\n for (int i = 0; i < n; i++) {\n if (str.charAt(i) == 'a') cnt++;\n }\n out.println(Math.min(n, 2 * cnt - 1));\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["strings", "implementation"], "code_uid": "7e47c3680ca01fa75790df75d8e01815", "src_uid": "84cb9ad2ae3ba7e912920d7feb4f6219", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedWriter;\nimport java.util.InputMismatchException;\nimport java.io.InputStream;\nimport java.util.NoSuchElementException;\nimport java.io.OutputStreamWriter;\nimport java.math.BigInteger;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.Writer;\nimport java.io.IOException;\nimport java.util.*;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Árysson Cavalcanti\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n TaskE solver = new TaskE();\n solver.solve(1, in, out);\n out.close();\n }\n}\n\nclass TaskE {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n=in.readInt(), ret=n, x=n;\n for (int y=1; y<=n; y++) {\n if (1L*x*x+1L*y*y>1L*n*n) x--;\n while (1L*x*x+1L*y*y>1L*n*n) {\n x--;\n ret++;\n }\n }\n ret=n==0?1:4*ret;\n out.printLine(ret);\n }\n}\n\nclass InputReader {\n private boolean finished = false;\n\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public int peek() {\n if (numChars == -1)\n return -1;\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n return -1;\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar];\n }\n \n public int readInt() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public long readLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n \n public String readString() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n if (Character.isValidCodePoint(c))\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n private String readLine0() {\n StringBuilder buf = new StringBuilder();\n int c = read();\n while (c != '\\n' && c != -1) {\n if (c != '\\r')\n buf.appendCodePoint(c);\n c = read();\n }\n return buf.toString();\n }\n\n public String readLine() {\n String s = readLine0();\n while (s.trim().length() == 0)\n s = readLine0();\n return s;\n }\n \n String readLine(boolean ignoreEmptyLines) {\n if (ignoreEmptyLines)\n return readLine();\n else\n return readLine0();\n }\n\n public BigInteger readBigInteger() {\n try {\n return new BigInteger(readString());\n } catch (NumberFormatException e) {\n throw new InputMismatchException();\n }\n }\n\n public char readCharacter() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n return (char) c;\n }\n \n public double readDouble() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, readInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, readInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n\n public boolean isExhausted() {\n int value;\n while (isSpaceChar(value = peek()) && value != -1)\n read();\n return value == -1;\n }\n \n public String next() {\n return readString();\n }\n\n public SpaceCharFilter getFilter() {\n return filter;\n }\n\n public void setFilter(SpaceCharFilter filter) {\n this.filter = filter;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n}\n\nclass OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void print(char[] array) {\n writer.print(array);\n }\n\n public void print(Object...objects) {\n for (int i = 0; i < objects.length; i++) {\n if (i != 0)\n writer.print(' ');\n writer.print(objects[i]);\n }\n }\n\n public void print(int[] array) {\n for (int i = 0; i < array.length; i++) {\n if (i != 0)\n writer.print(' ');\n writer.print(array[i]);\n }\n }\n\n public void print(long[] array) {\n for (int i = 0; i < array.length; i++) {\n if (i != 0)\n writer.print(' ');\n writer.print(array[i]);\n }\n }\n \n public void printLine(int[] array) {\n print(array);\n writer.println();\n }\n\n public void printLine(long[] array) {\n print(array);\n writer.println();\n }\n\n public void printLine() {\n writer.println();\n }\n\n public void printLine(Object...objects) {\n print(objects);\n writer.println();\n }\n\n public void print(char i) {\n writer.print(i);\n }\n\n public void printLine(char i) {\n writer.println(i);\n }\n \n public void printLine(char[] array) {\n writer.println(array);\n }\n\n public void printFormat(String format, Object...objects) {\n writer.printf(format, objects);\n }\n\n public void close() {\n writer.close();\n }\n\n public void flush() {\n writer.flush();\n }\n\n public void print(long i) {\n writer.print(i);\n }\n\n public void printLine(long i) {\n writer.println(i);\n }\n\n public void print(int i) {\n writer.print(i);\n }\n\n public void printLine(int i) {\n writer.println(i);\n }\n}", "lang_cluster": "Java", "tags": ["math"], "code_uid": "7e175b2eee10aa4461b720fdb787e299", "src_uid": "d87ce09acb8401e910ca6ef3529566f4", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\n/**\n * @author: Mehul Raheja\n */\nimport java.util.*;\nimport java.io.*;\n\npublic class E {\n\n /*\n Runtime = O()\n */\n static int N, M, K;\n static String s;\n static StringTokenizer st;\n static int[] d;\n\n static long ans = 0;\n static long[] pre;\n \n static void dis(long N) {\n //System.out.println(N);\n if(N == 1){\n return;\n }\n long x = ((long)((Math.log(N-0.1))/Math.log(2)));\n //System.out.println(x);\n long low = (long)Math.pow(2, x);\n //System.out.println(low);\n ans += low;\n ans += pre[(int)x];\n dis(N-low);\n }\n\n public static void main(String[] args) throws Exception {\n pre = new long[50];\n pre[0] = 0;\n for (int i = 1; i < 50; i++) {\n pre[i] = pre[i-1] * 2 + (long)Math.pow(2, i-1);\n }\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n long N = Long.parseLong(br.readLine());\n dis(N);\n System.out.println(ans);\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "dp", "bitmasks", "graphs", "implementation"], "code_uid": "7410b2f8fdded242734afc9658f37f49", "src_uid": "a98f0d924ea52cafe0048f213f075891", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.Scanner;\n\n/**\n *\n * @author Alex\n */\npublic class PanoramixsPrediction {\n\n \n public static void main(String[] args) {\n Scanner in=new Scanner(System.in);\n int n=in.nextInt();\n int m=in.nextInt();\n int nextprime = 0;\n int i;\n switch (n) {\n case 2:\n nextprime=3;\n break;\n case 3:\n nextprime=5;\n break;\n default:\n for(i=n+2;i<50;i+=2){\n if(nextprime(i)){\n nextprime=i;\n break;\n }\n } break;\n }\n if(nextprime==m){\n System.out.println(\"YES\");\n }else{\n System.out.println(\"NO\");\n }\n }\n public static boolean nextprime(int x){\n int j;\n boolean status=true;\n if(x%2==0){\n return false;\n }else{\n for(j=3;j<=Math.sqrt(x);j+=2){\n if(x%j==0){\n status=false;\n break; \n }\n }\n \n }\n return status;\n }\n \n}", "lang_cluster": "Java", "tags": ["brute force"], "code_uid": "9a570b74cee53b2f4fdd92ed6467ef6a", "src_uid": "9d52ff51d747bb59aa463b6358258865", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\r\nimport java.io.*;\r\n\r\npublic class B{\r\n\tpublic static void main(String[] args)\r\n\t{\r\n\t\tFastScanner fs = new FastScanner();\r\n\t\tPrintWriter out = new PrintWriter(System.out);\r\n\t\tint n = fs.nextInt(); int mod = fs.nextInt();\r\n\t\tlong[] dp = new long[n+1];\r\n\t\tdp[1] = 1;long sum = 1;\r\n\t\tfor(int i=2;i<=n;i++)\r\n\t\t{\r\n\t\t dp[i] = sum;\r\n\t\t for(int left=2,right;left<=i;left=right+1)\r\n\t\t {\r\n\t\t right = (i/(i/left));\r\n\t\t dp[i] = (dp[i] + ((right-left+1)*dp[i/left])%mod)%mod;\r\n\t\t }\r\n\t\t sum = (sum+dp[i])%mod;\r\n\t\t}\r\n\t\tout.println(dp[n]);\r\n\t\tout.close();\t\t\r\n\t}\r\n\tstatic class FastScanner {\r\n\t\tBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\r\n\t\tStringTokenizer st=new StringTokenizer(\"\");\r\n\t\tString next() {\r\n\t\t\twhile (!st.hasMoreTokens())\r\n\t\t\t\ttry {\r\n\t\t\t\t\tst=new StringTokenizer(br.readLine());\r\n\t\t\t\t} catch (IOException e) {\r\n\t\t\t\t\te.printStackTrace();\r\n\t\t\t\t}\r\n\t\t\treturn st.nextToken();\r\n\t\t}\r\n\t\t\r\n\t\tint nextInt() {\r\n\t\t\treturn Integer.parseInt(next());\r\n\t\t}\r\n\t\tint[] readArray(int n) {\r\n\t\t\tint[] a=new int[n];\r\n\t\t\tfor (int i=0; i<n; i++) a[i]=nextInt();\r\n\t\t\treturn a;\r\n\t\t}\r\n\t\tlong nextLong() {\r\n\t\t\treturn Long.parseLong(next());\r\n\t\t}\r\n\t}\r\n\tpublic static int[] sort(int[] arr)\r\n\t{\r\n\t\tList<Integer> temp = new ArrayList();\r\n\t\tfor(int i:arr)temp.add(i);\r\n\t\tCollections.sort(temp);\r\n\t\tint start = 0;\r\n\t\tfor(int i:temp)arr[start++]=i;\r\n\t\treturn arr;\r\n\t}\r\n\tpublic static String rev(String str)\r\n\t{\r\n\t\tchar[] arr = str.toCharArray();\r\n\t\tchar[] ret = new char[arr.length];\r\n\t\tint start = arr.length-1;\r\n\t\tfor(char i:arr)ret[start--] = i;\r\n\t\tString ret1 = \"\";\r\n\t\tfor(char ch:ret)ret1+=ch;\r\n\t\treturn ret1;\r\n\t}\r\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "data structures", "number theory"], "code_uid": "9b3fd0295230cb6c7bca4fe6211c6aa8", "src_uid": "a524aa54e83fd0223489a19531bf0e79", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\npublic class Main\n{\n\tpublic static void main(String[] args) {\n\t Scanner sc=new Scanner(System.in);\n\t int n=sc.nextInt(),k=sc.nextInt();\n\t Vector<Integer> v=new Vector<>();\n\t for(int i=2;i<=n;i++){\n\t if(prime(i))v.add(i);\n\t }\n\t Set<Integer> set=new HashSet<>();\n\t for(int i=0;i<v.size()-1;i++){\n\t set.add(v.get(i)+v.get(i+1)+1);\n\t }\n\t for(Integer i:v){\n\t if(set.contains(i))k--;\n\t }\n\t if(k<=0)System.out.println(\"YES\");\n\t else System.out.println(\"NO\");\n\t}\n\t\n\tstatic boolean prime(int n){\n\t if(n==2)return true;\n\t if(n%2==0)return false;\n\t for(int i=3;i*i<=n;i+=2){\n\t if(n%i==0)return false;\n\t }\n\t return true;\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "number theory"], "code_uid": "f5323d7969c09a4e0abf71cfd04fb55a", "src_uid": "afd2b818ed3e2a931da9d682f6ad660d", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "//package test;\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class OK_GOOGLE {\n\tprivate static StringTokenizer st;\n\tprivate static BufferedReader in;\n\tprivate static PrintWriter pw;\n\t\n\tpublic static void main(String[] args) throws IOException {\n\tin = new BufferedReader(new InputStreamReader(System.in));\n\tpw = new PrintWriter(new OutputStreamWriter(System.out));\n\tint a = nextInt(), b = nextInt(), c = nextInt();\n\tif(a > b && c >= 0 || a < b && c <= 0){\n\t\tpw.print(\"NO\");\n\t\tpw.close();\n\t\treturn;\n\t}\n\tif(b - a == 0 || (b - a) % c == 0) {\n\t\tpw.println(\"YES\");\n\t}else{\n\t\tpw.print(\"NO\");\n\t}\n\tin.close();\n\tpw.close();\n\t}\n\n\tprivate static long nextLong() throws IOException {\n\t\treturn Long.parseLong(next());\n\t}\n\n\tprivate static double nextDouble() throws IOException {\n\t\treturn Double.parseDouble(next());\n\t}\n\n\tprivate static int nextInt() throws IOException {\n\t\treturn Integer.parseInt(next());\n\t}\n\n\tprivate static String next() throws IOException {\n\t\twhile (st == null || !st.hasMoreTokens())\n\t\t\tst = new StringTokenizer(in.readLine());\n\t\treturn st.nextToken();\n\t}\n\n}\n\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "1fd9b06b851d9627b9e9e0527843e963", "src_uid": "9edf42c20ddf22a251b84553d7305a7d", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class C\n{\n public static void main(String[] strings) throws IOException\n {\n Scanner in = new Scanner(System.in);\n long c = in.nextInt();\n long hr = in.nextInt();\n long hb = in.nextInt();\n long wr = in.nextInt();\n long wb = in.nextInt();\n\n long res = Math.max(solve(c, hr, hb, wr, wb), solve(c, hb, hr, wb, wr));\n\n\n System.out.println(res);\n\n }\n\n private static long solve(long c, long hr, long hb, long wr, long wb)\n {\n long res = 0;\n long calc;\n for(int use = 0 ; use <= 1000000 + 13 ; use++)\n if(use*wr <= c)\n {\n calc = use*hr + ((c-use*wr)/wb)*hb;\n if(calc > res)\n res = calc;\n }\n\n return res;\n }\n}", "lang_cluster": "Java", "tags": ["math", "greedy", "brute force"], "code_uid": "0458735c2877d0e00f6c19d294624ed4", "src_uid": "eb052ca12ca293479992680581452399", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.InputStream;\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n static Reader x;\n\n public Main(){\n x=new Reader();\n x.init(System.in);\n }\n\n public static void main(String[] args) throws IOException {\n Main o = new Main();\n\t // write your code here\n long n = x.nextInt();\n long k = x.nextInt();\n long A = x.nextInt();\n long B = x.nextInt();\n long count = dontcry(n,k,A,B,0);\n System.out.println(count);\n }\n\n public static long dontcry(long n, long k, long A, long B, long count){\n if(n==1)\n return count;\n else{\n if(k==1 || n<k){\n count+=(n-1)*A;\n n=1;\n }\n else if(n>k && n%k!=0){\n count+=(n%k)*A;\n n=n-(n%k);\n }\n else if(n%k==0){\n if(B<(n-(n/k))*A){\n count+=B;\n n=n/k;\n }\n else{\n count+=(n-1)*A;\n n=1;\n }\n }\n return dontcry(n, k, A, B, count);\n }\n }\n}\n\n/** Class for buffered reading int and double values */\nclass Reader {\n static BufferedReader reader;\n static StringTokenizer tokenizer;\n\n /** call this method to initialize reader for InputStream */\n static void init(InputStream input) {\n reader = new BufferedReader(\n new InputStreamReader(input) );\n tokenizer = new StringTokenizer(\"\");\n }\n\n /** get next word */\n static String next() throws IOException {\n while ( ! tokenizer.hasMoreTokens() ) {\n //TODO add check for eof if necessary\n tokenizer = new StringTokenizer(\n reader.readLine() );\n }\n return tokenizer.nextToken();\n }\n\n static int nextInt() throws IOException {\n return Integer.parseInt( next() );\n }\n\n static double nextDouble() throws IOException {\n return Double.parseDouble( next() );\n }\n}\n", "lang_cluster": "Java", "tags": ["greedy", "dp"], "code_uid": "5ce5f18a5d64bcac2ded9357fbd3832d", "src_uid": "f838fae7c98bf51cfa0b9bd158650b10", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.Writer;\nimport java.util.InputMismatchException;\n\n\npublic class temp{\n\n\tpublic static void main(String[] args) {\n\t\tInputReader in = new InputReader(System.in);\n\t\tOutputWriter out = new OutputWriter(System.out);\n\t\tint n = in.readInt();\n\t\tint m = in.readInt();\n\t\tif(n == 1 || n == 3 || n == 5 || n == 7 || n == 8 || n == 10 || n == 12 ){\n\t\t\tif(m > 5){\n\t\t\t\tSystem.out.println(6);\n\t\t\t}else{\n\t\t\t\tSystem.out.println(5);\n\t\t\t}\n\t\t}else if(n == 2){\n\t\t\tif(m != 1){\n\t\t\t\tSystem.out.println(5);\n\t\t\t}else{\n\t\t\t\tSystem.out.println(4);\n\t\t\t}\n\t\t}else{\n\t\t\tif(m > 6){\n\t\t\t\tSystem.out.println(6);\n\t\t\t}else{\n\t\t\t\tSystem.out.println(5);\n\t\t\t}\n\t\t}\n\t\t\n\t\t\n\t\tout.close();\n\t}\n\n\nprivate static class InputReader {\n\t\tprivate InputStream stream;\n\t\tprivate byte[] buf = new byte[1024];\n\t\tprivate int curChar;\n\t\tprivate int numChars;\n \n\t\tpublic InputReader(InputStream stream) {\n\t\t\tthis.stream = stream;\n\t\t}\n \n\t\tpublic int read() {\n\t\t\tif (numChars == -1)\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tif (curChar >= numChars) {\n\t\t\t\tcurChar = 0;\n\t\t\t\ttry {\n\t\t\t\t\tnumChars = stream.read(buf);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (numChars <= 0)\n\t\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn buf[curChar++];\n\t\t}\n \n\t\tpublic long readLong() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tlong sgn = 1;\n\t\t\tif (c == '-') {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res * sgn;\n\t\t}\n \n\t\tpublic int readInt() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-') {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res * sgn;\n\t\t}\n \n\t\tpublic String readString() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tStringBuffer res = new StringBuffer();\n\t\t\tdo {\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res.toString();\n\t\t}\n \n\t\tstatic boolean isSpaceChar(int c) {\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n \n\t\tpublic String next() {\n\t\t\treturn readString();\n\t\t}\n\t}\n \n\tprivate static class OutputWriter {\n\t\tprivate final PrintWriter writer;\n \n\t\tpublic OutputWriter(OutputStream outputStream) {\n\t\t\twriter = new PrintWriter(outputStream);\n\t\t}\n \n\t\tpublic OutputWriter(Writer writer) {\n\t\t\tthis.writer = new PrintWriter(writer);\n\t\t}\n \n\t\tpublic void print(Object... objects) {\n\t\t\tfor (int i = 0; i < objects.length; i++) {\n\t\t\t\tif (i != 0)\n\t\t\t\t\twriter.print(' ');\n\t\t\t\twriter.print(objects[i]);\n\t\t\t}\n\t\t}\n \n\t\tpublic void printLine(Object... objects) {\n\t\t\tprint(objects);\n\t\t\twriter.println();\n\t\t}\n \n\t\tpublic void close() {\n\t\t\twriter.close();\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "bb44284f18190c689420ee915aa2562d", "src_uid": "5b969b6f564df6f71e23d4adfb2ded74", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\npublic class DigitSequence \n{\n\tpublic static void main(String[] args) \n\t{\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tString s=\"\";\n\t\tint i=1;\n\t\tString s1=String.valueOf(i);\n\t\twhile(s.length()<=n)\n\t\t{\n\t\t\ts=s+s1;\n\t\t\ti++;\n\t\t\ts1=String.valueOf(i);\n\t\t}\n\t\t//System.out.println(s);\n\t\tSystem.out.println(s.charAt(n-1));\n\t}\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "5d97349cd570956ef421d684a07fae28", "src_uid": "1503d761dd4e129fb7c423da390544ff", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/**\n * Created by Kratos-Pavilion on 04-03-2018.\n *\n * @author Kratos-Pavilion\n * @Date 04-03-2018\n */\nimport java.util.Scanner;\nimport java.util.Arrays;\n\npublic class Subset {\n public static void main(String[] args) throws Exception {\n\n Scanner d = new Scanner(System.in);\n int n = d.nextInt();\n int dia = d.nextInt();\n int c = 0, count = 0;\n int arr[] = new int[n];\n\n for (int i = 0; i < n; i++) {\n arr[i] = d.nextInt();\n }\n Arrays.sort(arr);\n for (int i = 0; i < n; i++) {\n for (int j = i; j < n; j++) {\n if ((arr[j] - arr[i]) <= dia)\n c++;\n }\n count = Math.max(count, c);\n c = 0;\n }\n\n\n System.out.println(n-count);\n\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "sortings", "greedy"], "code_uid": "c561ca9e7298f2104b58808c85f1c1ef", "src_uid": "6bcb324c072f796f4d50bafea5f624b2", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.math.BigInteger;\nimport java.util.Scanner;\n\n\npublic class A {\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n String n, m;\n n= in.next();\n m= in.next();\n \n BigInteger aux = new BigInteger(\"3\");\n //aux = aux.pow(Integer.parseInt(n));\n aux=aux.modPow(new BigInteger(n), new BigInteger(m));\n //aux=aux.subtract(BigInteger.ONE).mod(new BigInteger(m));\n if(aux.toString().equals(\"0\")){\n aux= new BigInteger(m);\n }\n aux = aux.subtract(BigInteger.ONE);\n System.out.println(aux);\n \n }\n\n}\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "a62868755237b0373599e14da468364d", "src_uid": "c62ad7c7d1ea7aec058d99223c57d33c", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class CodeChef {\n\n\tpublic static void main(String[] args) throws IOException,NumberFormatException{\n\t\ttry {\n\t\t\tFastScanner sc=new FastScanner();\n\t\t\tString s=sc.next();\n\t\t\tint num1=Integer.parseInt(s.substring(0,2));\n\t\t\tint num2=Integer.parseInt(s.substring(3));\n\t\t\tint q=num1;\n\t\t\tint temp=palindrome(num1);\n\t\t\t\n\t\t\t\tif(num1>=0&&num1<5)\n\t\t\t\t{ if(num2>=palindrome(num1))\n\t\t\t\t System.out.println(\"0\"+(num1+1)+\":\"+palindrome(num1+1));\n\t\t\t\t else \n \tSystem.out.println(\"0\"+(num1)+\":\"+palindrome(num1));\t\n\t\t\t\t}\n\t\t\t\telse if(num1==10) {\n\t\t\t\t\tif(num2>=palindrome(num1))\n\t\t\t\t\t\tSystem.out.println((num1+1)+\":\"+palindrome(num1+1));\n\t\t\t\t\telse\n\t\t\t\t\t\tSystem.out.println(num1+\":0\"+palindrome(num1));\n\t\t\t\t}\n\t\t\t\telse if(num1==20) {\n\t\t\t\t\tif(num2>=palindrome(num1))\n\t\t\t\t\t\tSystem.out.println((num1+1)+\":\"+palindrome(num1+1));\n\t\t\t\t\telse\n\t\t\t\t\t\tSystem.out.println(num1+\":0\"+palindrome(num1));\n\t\t\t\t}\n\t\t\t\telse if((num1>10&&num1<15)||(num1>20&&num1<=22)){\n\t\t\t\t\t if(num2>=palindrome(num1))\n\t\t\t\t\t\tSystem.out.println((num1+1)+\":\"+palindrome(num1+1));\n\t\t\t\t\t else\n\t\t\t\t\t\tSystem.out.println(num1+\":\"+palindrome(num1));\n\t\t\t\t\t\n\t\t\t\t\t} \n\t\t\t\t\telse {\n\t\t\t\t\t\tif(num1>=6&&num1<=9) {\n\t\t\t\t\t\t\tSystem.out.println(\"10:01\");\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if(num1==5) {\n\t\t\t\t\t\t\tif(num2>=palindrome(num1)) {\n\t\t\t\t\t\t\t\tSystem.out.println(\"10:01\");\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse {\n\t\t\t\t\t\t\t\tSystem.out.println(\"05:50\");\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if(num1==15) {\n\t\t\t\t\t\t\tif(num2>=palindrome(num1)) {\n\t\t\t\t\t\t\t\tSystem.out.println(\"20:02\");\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse {\n\t\t\t\t\t\t\t\tSystem.out.println(\"15:51\");\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if(num1>=16&&num1<=19) {\n\t\t\t\t\t\t\tSystem.out.println(\"20:02\");\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if(num1==23) {\n\t\t\t\t\t\t\tif(num2>=palindrome(num1)) {\n\t\t\t\t\t\t\t\tSystem.out.println(\"00:00\");\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse {\n\t\t\t\t\t\t\t\tSystem.out.println(\"23:32\");\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn ;\n\t\t}\n\n\t}\n\tpublic static int palindrome(int n) {\n\t\tint temp=n%10;\n\t\tn=n/10;\n\t\ttemp=(n%10)+(temp*10);\n\t\treturn temp;\n\t}\n\tpublic static class FastScanner {\n\t\tBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st=new StringTokenizer(\"\");\n\t\tString next() {\n\t\t\twhile (!st.hasMoreTokens())\n\t\t\t\ttry { \n st=new StringTokenizer(br.readLine());\t\t\t\t \n } catch (IOException e) {}\n\t\t\treturn st.nextToken();\n\t\t}\n\t\t\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\t\n\t}\n}\n", "lang_cluster": "Java", "tags": ["strings", "implementation"], "code_uid": "51c0186bb899cfb1d804bf57058bde48", "src_uid": "158eae916daa3e0162d4eac0426fa87f", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.IOException;\n\n\npublic class Translation {\n\n\t\n//\t\n//\tpublic static void main(String[] args) throws IOException {\n//\t\t//FastReader fr=new FastReader();\n//\t\t\n//\t\t//StringBuffer str1=new StringBuffer(fr.nextLine());\n//\t\tjava.io.BufferedReader br=new java.io.BufferedReader(new java.io.InputStreamReader(System.in));\n//\t\tStringBuffer str1=new StringBuffer(br.readLine());\n//\t\tString str2=br.readLine();\n//\t\t\n//\t\t\n//\t\tstr1.reverse();\n//\t\t//System.out.println(str1);\n//\t\tSystem.out.println(str1.toString().equals(str2)?\"YES\":\"NO\");\n// \n//\t}\n\t\n public String translate(String a, String b) {\n String yes = \"YES\";\n String no = \"NO\";\n if (!b.equals(new StringBuffer(a).reverse().toString())) {\n return \"NO\";\n } else {\n return \"YES\";\n \n }\n }\n \n public static void main(String[] args) throws IOException {\n Translation m = new Translation();\n String a ,b;\n java.io.BufferedReader r = new java.io.BufferedReader(new java.io.InputStreamReader(System.in));\n a = r.readLine();\n b=r.readLine();\n System.out.println(m.translate(a,b));\n }\n}\n", "lang_cluster": "Java", "tags": ["strings", "implementation"], "code_uid": "6d04c5bbac1583afc143bb50f62ad90c", "src_uid": "35a4be326690b58bf9add547fb63a5a5", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.lang.reflect.Field;\nimport java.math.BigInteger;\nimport java.util.*;\n\npublic class codeforces implements Runnable {\n\n private BufferedReader br = null;\n private PrintWriter pw = null;\n private StringTokenizer stk = new StringTokenizer(\"\");\n\n public static void main(String[] args) {\n new Thread(new codeforces()).run();\n }\n\n public void run() { /*\n * try { // br = new BufferedReader(new\n * FileReader(\"input.txt\")); pw = new\n * PrintWriter(\"output.txt\"); } catch\n * (FileNotFoundException e) { e.printStackTrace(); }\n */\n br = new BufferedReader(new InputStreamReader(System.in));\n pw = new PrintWriter(new OutputStreamWriter(System.out));\n solver();\n pw.close();\n\n }\n\n private void nline() {\n try {\n if (!stk.hasMoreTokens())\n stk = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n throw new RuntimeException(\"KaVaBUnGO!!!\", e);\n }\n }\n\n private String nstr() {\n while (!stk.hasMoreTokens())\n nline();\n return stk.nextToken();\n }\n\n private int ni() {\n return Integer.valueOf(nstr());\n\n }\n\n private double nd() {\n return Double.valueOf(nstr());\n\n }\n\n String nextLine() {\n try {\n return br.readLine();\n } catch (IOException e) {\n }\n return null;\n }\n\n class Line {\n Line() {\n this.max = Integer.MIN_VALUE;\n this.min = Integer.MAX_VALUE;\n }\n\n void checkMax(int i) {\n max = Math.max(i, max);\n }\n\n void checkMin(int i) {\n min = Math.min(i, min);\n }\n\n int max, min;\n }\n\n class Point {\n int x, y;\n\n Point(int x, int y) {\n this.x = x;\n this.y = y;\n }\n }\n\n private void solver() {\n int n = ni()+1, p = 0;\n for(int i=0; i<n-1;i++)p+=ni();\n int a = (int)Math.ceil(p/((float)n));\n int b = (int)Math.ceil((p+5)/(float)n);\n System.out.println(5-b+a);\n\n }\n\n private BigInteger nbi() {\n return new BigInteger(nstr());\n }\n\n void exit() {\n\n System.exit(0);\n }\n}", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "1e7e13a25b3c1462ebf5bebb3d2670fe", "src_uid": "ff6b3fd358c758324c19a26283ab96a4", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class UnimodalArray {\n\n public static String check(int[] arr) {\n \n int number;\n int temp;\n\n int end = arr.length;\n int i = 1;\n\n while (i < end && arr[i-1] < arr[i]) {\n i++;\n }\n while(i < end && arr[i-1] == arr[i]){\n i++;\n }\n \n while(i < end && arr[i-1] > arr[i]){\n i++;\n }\n \n if(i == end)\n return \"YES\";\n else\n return \"NO\";\n }\n \n public static void main(String[] args) {\n \n int l ;\n Scanner s = new Scanner(System.in);\n l = s.nextInt();\n int[] arr = new int[l];\n \n \n for(int i= 0; i< l;i++){\n arr[i] = s.nextInt();\n }\n System.out.println(UnimodalArray.check(arr));\n \n }\n\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "06db63c4694e0ba59c18206cac487373", "src_uid": "5482ed8ad02ac32d28c3888299bf3658", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class A211 {\n\n public void solve() throws IOException {\n\n Scanner sc = new Scanner(System.in);\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n PrintWriter pw = new PrintWriter(System.out);\n\n char[] n = sc.nextLine().toCharArray();\n\n String s[] = new String[10];\n s[0] = \"O-|-OOOO\";\n s[1] = \"O-|O-OOO\";\n s[2] = \"O-|OO-OO\";\n s[3] = \"O-|OOO-O\";\n s[4] = \"O-|OOOO-\";\n s[5] = \"-O|-OOOO\";\n s[6] = \"-O|O-OOO\";\n s[7] = \"-O|OO-OO\";\n s[8] = \"-O|OOO-O\";\n s[9] = \"-O|OOOO-\";\n\n for (int i = n.length - 1; i >= 0; i--) {\n System.out.println(s[n[i]-48]);\n }\n\n\n }\n\n public static void main(String[] args) throws IOException {\n new A211().solve();\n\n }\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "7f78d738785bee574ccfc3b7a50d7da2", "src_uid": "c2e3aced0bc76b6484360563355d23a7", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class F {\n\n public static void main(String[] args) {\n\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt(), k = sc.nextInt();\n char s[] = sc.next().toCharArray();\n String t = sc.next();\n char first = t.charAt(0);\n char second = t.charAt(1);\n\n int dp[][][] = new int[n+1][n+1][k+1];\n for(int i = 0; i < dp.length; i++)\n for(int x = 0; x < dp[0].length; x++)\n Arrays.fill(dp[i][x], Integer.MIN_VALUE);\n dp[0][0][0] = 0;\n\n int ans = 0;\n for(int i = 1; i <= n; i++)\n for(int c = 0; c <= i; c++) {\n for(int op = 0; op <= k; op++) {\n\n// System.out.printf(\"[start] i = %d, count = %d, op = %d -> %d\\n\", i, c, op, dp[i][c][op]);\n char cur = s[i-1];\n int e1 = cur == first ? 1 : 0;\n int e2 = cur == second ? c : 0;\n int same = first == second ? 1 : 0;\n int e12 = same == 1 && cur == first ? 1 : 0;\n// // we put 'first'\n if(c > 0 && op > 0)\n dp[i][c][op] = Math.max(dp[i][c][op], dp[i-1][c-1][op-1]);\n\n // then we put 'second'\n if(op > 0 && c - same >= 0)\n dp[i][c][op] = Math.max(dp[i][c][op], dp[i-1][c - same][op-1] + c - same);\n\n // or we leave it as it is\n if(c - e1 >= 0)\n dp[i][c][op] = Math.max(dp[i][c][op], dp[i-1][c - e1][op] + e2 - e12);\n\n// System.out.printf(\"[end] i = %d, count = %d, op = %d -> %d\\n\\n\", i, c, op, dp[i][c][op]);\n }\n }\n\n for(int x = 0; x <= n; x++)\n for(int op = 0; op <= k; op++) {\n int occ = dp[n][x][op];\n ans = Math.max(ans, occ);\n }\n System.out.println(ans);\n }\n}\n", "lang_cluster": "Java", "tags": ["strings", "dp"], "code_uid": "faa8afbfa13f8e4ca20e2b96fc265c2c", "src_uid": "9c700390ac13942cbde7c3428965b18a", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\n/**\n * Created by s326lab on 18/11/2017.\n * http://codeforces.com/problemset/problem/876/A\n */\npublic class TripForMeal {\n private Scanner read = new Scanner(System.in);\n\n public static void main(String[] args) {\n TripForMeal p = new TripForMeal();\n byte eatVisit = p.readByte();\n byte a = p.readByte();\n byte b = p.readByte();\n byte c = p.readByte();\n int answer = p.tripForMeal(eatVisit, a, b, c);\n System.out.println(answer);\n }\n\n private int tripForMeal(byte n, byte a, byte b, byte c) {\n int result = 0;\n byte count = 0;\n if(n != 1)\n {\n if(a < b)\n {\n result += a;\n count = a;\n }\n else\n {\n result+= b;\n count = b;\n }\n }\n\n n-=1;\n\n while(n > 1)\n {\n n--;\n if(count == a)\n {\n if(a < c)\n {\n result += a;\n }\n else\n {\n result+= c;\n count = c;\n }\n\n }\n else if (count == b)\n {\n if(b < c)\n {\n result+=b;\n }\n else\n {\n result+= c;\n count = c;\n }\n }\n else if (count == c)\n {\n if(c < b)\n {\n result+=c;\n }\n else\n {\n result+= b;\n }\n\n }\n\n }\n return result;\n }//tripForMeal\n\n\n private byte readByte() {\n byte result = 0;\n try {\n while (result > 100 | result < 1) {\n result = Byte.parseByte(read.nextLine());\n if (result > 100 || result < 1) {\n System.out.println(\"Enter the value again.\");\n }\n }\n } catch (NumberFormatException e) {\n e.printStackTrace();\n }\n return result;\n }//readByte\n\n}//class\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "da8f6b89582a2972ab7f988ae6a39fb8", "src_uid": "6058529f0144c853e9e17ed7c661fc50", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class FindAmir\n{\n public static void main(String args[])\n {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int cnt = 0;\n for(int i=1;i!=(n/2+n%2);++i)\n cnt++;\n System.out.println(cnt);\n }\n}\n", "lang_cluster": "Java", "tags": ["constructive algorithms"], "code_uid": "2d796fd0dab50044bdacc4145cc71fe2", "src_uid": "dfe9446431325c73e88b58ba204d0e47", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n \npublic class Main\n{\n \n static class InputReader {\n\n\t\tprivate final InputStream stream;\n\t\tprivate final byte[] buf = new byte[8192];\n\t\tprivate int curChar, snumChars;\n\n\t\tpublic InputReader(InputStream st) {\n\t\t\tthis.stream = st;\n\t\t}\n\n\t\tpublic int read() {\n\t\t\tif (snumChars == -1)\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tif (curChar >= snumChars) {\n\t\t\t\tcurChar = 0;\n\t\t\t\ttry {\n\t\t\t\t\tsnumChars = stream.read(buf);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (snumChars <= 0)\n\t\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn buf[curChar++];\n\t\t}\n\n\t\tpublic int ni() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c)) {\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-') {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo {\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res * sgn;\n\t\t}\n\n\t\tpublic long nl() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c)) {\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-') {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo {\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res * sgn;\n\t\t}\n\n\t\tpublic int[] nia(int n) {\n\t\t\tint a[] = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\ta[i] = ni();\n\t\t\t}\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic String rs() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c)) {\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo {\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tpublic String nextLine() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo {\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t} while (!isEndOfLine(c));\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tpublic boolean isSpaceChar(int c) {\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n\n\t\tprivate boolean isEndOfLine(int c) {\n\t\t\treturn c == '\\n' || c == '\\r' || c == -1;\n\t\t}\n\n\t}\n\n\t\n\n\n\n public static void main(String[] args)\n {\n \n InputReader sc = new InputReader(System.in);\n PrintWriter w = new PrintWriter(System.out);\n int n = sc.ni();\n int k = sc.ni();\n int sum = 0;\n for(int i=1;i<=n;i++)\n {\n sum += sc.ni();\n }\n \n int c = 0;\n if(2*sum >= n*(2*k -1))\n {\n w.println(\"0\");\n \n }\n else\n w.println(2*k*n-n-2*sum);\n \n /*\n int x = sc.ni();\n int y = sc.ni();\n String [][]arr = new String[x+2][y+2];\n for(int i=1;i<=x;i++)\n {\n for(int j=1;j<=y;j++)\n {\n arr[i][j] = sc.rs();\n }\n }\n int c = 0;\n for(int i=1;i<=x;i++)\n {\n for(int j=1;j<=y;j++)\n {\n if(arr[i][j].equals(\"S\"))\n {\n if(arr[i-1][j].equals(\"W\") ||arr[i+1][j].equals(\"W\")||arr[i][j-1].equals(\"W\")||arr[i][j+1].equals(\"W\"))\n c++;\n }\n }\n }\n if(c != 0)\n w.println(\"No\");\n else\n {\n for(int i=1;i<=x;i++)\n {\n for(int j=1;j<=y;j++)\n {\n if(arr[i][j].equals(\"S\"))\n {\n if(arr[i-1][j].equals(\".\"))\n arr[i-1][j].replace(\".\",\"D\");\n \n if(arr[i+1][j].equals(\".\"))\n arr[i+1][j].replace(\".\",\"D\");\n \n if(arr[i][j+1].equals(\".\"))\n arr[i][j+1].replace(\".\",\"D\");\n \n if(arr[i][j-1].equals(\".\"))\n arr[i][j-1].replace(\".\",\"D\");\n \n \n }\n }\n }\n w.println(\"Yes\");\n \n for(int i=1;i<=x;i++)\n {\n for(int j=1;j<=y;j++)\n {\n w.print(arr[i][j]);\n \n }\n w.println();\n }\n }\n \n */\n \n \n /*\n 118B\n int x = sc.ni();\n int res = x*2;\n String [][]arr = new String[res+ 1][res+1];\n \n for(int i=0;i<=x*2;i++)\n {\n for(int j=x-i;j<=x+i;j++)\n {\n if(j <= x)\n arr[i][j] = ips(i+j-x);\n else\n arr[i][j] = ips(2*x -i - j);\n \n }\n \n }\n for(int i=0;i<=x*2;i++)\n {\n for(int j=0;j<=x*2;j++)\n {\n w.print(arr[i][j] + \" \");\n \n }\n w.println();\n }\n */\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n w.close();\n \n\n \n } \n /*\n static boolean is(int p,int x,int y)\n {\n int flag = 0;\n \n for(int j=2;j<=p;j++)\n {\n if(x % j == 0)\n {\n flag = 1;\n break;\n }\n else \n continue;\n \n }\n \n if(flag == 1)\n return false;\n else\n return true;\n \n }\n */\n static int binarysearch(int []arr,int p,int n)\n {\n \n int st = 0;\n int end = n-1;\n int mid = (st + end)/2;\n int temp = 0;\n while(st < end)\n { \n mid = (st + end)/2;\n \n if(p > arr[mid])\n {\n st = mid+1;\n \n }\n else if(p < arr[mid])\n {\n end = mid;\n \n }\n else if(p == arr[mid])\n {\n temp = mid;\n break;\n }\n \n \n \n }\n if(st == end)\n temp = st;\n \n return temp;\n }\n \n \n static class Student\n {\n \n int floor;\n int time;\n Student(int floor,int time)\n {\n this.floor = floor;\n this.time = time;\n \n \n }\n \n }\n static int lis(int arr[],int n)\n {\n int lis[] = new int[n];\n int i,j,max = 0;\n \n /* Initialize LIS values for all indexes */\n for ( i = 0; i < n; i++ )\n lis[i] = 1;\n \n /* Compute optimized LIS values in bottom up manner */\n for ( i = 1; i < n; i++ )\n for ( j = 0; j < i; j++ ) \n if ( arr[i] > arr[j] && lis[i] <= lis[j])\n lis[i]++;\n \n /* Pick maximum of all LIS values */\n for ( i = 0; i < n; i++ )\n if ( max < lis[i] )\n max = lis[i];\n \n return max;\n }\n \n \n public static int ip(String s){\n\t\treturn Integer.parseInt(s);\n\t}\n\t public static String ips(int s){\n\t\treturn Integer.toString(s);\n\t}\n\t\n \n\t\t\t\t\t \n}\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "09ef144153327d93537a11cb99a0567b", "src_uid": "f22267bf3fad0bf342ecf4c27ad3a900", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.util.InputMismatchException;\n\npublic class problemB1 {\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tScan in = new Scan(System.in);\n\t\tint n = in.scanInt();\n\t\tint[] freq = new int[6];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfreq[in.scanInt()]++;\n\t\t}\n\t\tdouble res = 0;\n\n\t\tfor (int i = 0; i < freq.length; i++) {\n\t\t\tres += (freq[i] * i);\n\t\t}\n\t\tint count = 0;\n\t\tdouble f = res / n;\n\t\tif (f >= 4.50) {\n\t\t\tSystem.out.println(0);\n\t\t} else {\n\t\t\twhile (freq[2] != 0) {\n\t\t\t\tres += 3;\n\t\t\t\tcount++;\n\t\t\t\tf = res / n;\n\t\t\t\tif (f >= 4.50) {\n\t\t\t\t\tSystem.out.println(count);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tfreq[2]--;\n\t\t\t}\n\n\t\t\twhile (freq[3] != 0) {\n\t\t\t\tres += 2;\n\t\t\t\tcount++;\n\t\t\t\tf = res / n;\n\t\t\t\tif (f >= 4.50) {\n\t\t\t\t\tSystem.out.println(count);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tfreq[3]--;\n\t\t\t}\n\n\t\t\twhile (freq[4] != 0) {\n\t\t\t\tres += 1;\n\t\t\t\tcount++;\n\t\t\t\tf = res / n;\n\t\t\t\tif (f >= 4.50) {\n\t\t\t\t\tSystem.out.println(count);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tfreq[4]--;\n\t\t\t}\n\t\t}\n\t}\n\n\tstatic class Scan {\n\t\tprivate InputStream in;\n\t\tprivate byte[] buf = new byte[1024 * 1024];\n\t\tprivate int index;\n\t\tprivate int total;\n\n\t\tpublic Scan(InputStream in) {\n\t\t\tthis.in = in;\n\t\t}\n\n\t\tpublic int scan() throws IOException {\n\t\t\tif (total < 0)\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tif (index >= total) {\n\t\t\t\tindex = 0;\n\t\t\t\ttotal = in.read(buf);\n\t\t\t\tif (total <= 0)\n\t\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn buf[index++];\n\t\t}\n\n\t\tpublic int scanInt() throws IOException {\n\t\t\tint integer = 0;\n\t\t\tint n = scan();\n\t\t\twhile (isWhiteSpace(n))\n\t\t\t\tn = scan();\n\t\t\tint neg = 1;\n\t\t\tif (n == '-') {\n\t\t\t\tneg = -1;\n\t\t\t\tn = scan();\n\t\t\t}\n\t\t\twhile (!isWhiteSpace(n)) {\n\t\t\t\tif (n >= '0' && n <= '9') {\n\t\t\t\t\tinteger *= 10;\n\t\t\t\t\tinteger += n - '0';\n\t\t\t\t\tn = scan();\n\t\t\t\t} else\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\treturn neg * integer;\n\t\t}\n\n\t\tpublic long scanLong() throws IOException {\n\t\t\tlong integer = 0;\n\t\t\tint n = scan();\n\t\t\twhile (isWhiteSpace(n))\n\t\t\t\tn = scan();\n\t\t\tint neg = 1;\n\t\t\tif (n == '-') {\n\t\t\t\tneg = -1;\n\t\t\t\tn = scan();\n\t\t\t}\n\t\t\twhile (!isWhiteSpace(n)) {\n\t\t\t\tif (n >= '0' && n <= '9') {\n\t\t\t\t\tinteger *= 10;\n\t\t\t\t\tinteger += n - '0';\n\t\t\t\t\tn = scan();\n\t\t\t\t} else\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\treturn neg * integer;\n\t\t}\n\n\t\tpublic double scanDouble() throws IOException {\n\t\t\tdouble doub = 0;\n\t\t\tint n = scan();\n\t\t\twhile (isWhiteSpace(n))\n\t\t\t\tn = scan();\n\t\t\tint neg = 1;\n\t\t\tif (n == '-') {\n\t\t\t\tneg = -1;\n\t\t\t\tn = scan();\n\t\t\t}\n\t\t\twhile (!isWhiteSpace(n) && n != '.') {\n\t\t\t\tif (n >= '0' && n <= '9') {\n\t\t\t\t\tdoub *= 10;\n\t\t\t\t\tdoub += n - '0';\n\t\t\t\t\tn = scan();\n\t\t\t\t} else\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (n == '.') {\n\t\t\t\tn = scan();\n\t\t\t\tdouble temp = 1;\n\t\t\t\twhile (!isWhiteSpace(n)) {\n\t\t\t\t\tif (n >= '0' && n <= '9') {\n\t\t\t\t\t\ttemp /= 10;\n\t\t\t\t\t\tdoub += (n - '0') * temp;\n\t\t\t\t\t\tn = scan();\n\t\t\t\t\t} else\n\t\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn doub * neg;\n\t\t}\n\n\t\tpublic String scanString() throws IOException {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tint n = scan();\n\t\t\twhile (isWhiteSpace(n))\n\t\t\t\tn = scan();\n\t\t\twhile (!isWhiteSpace(n)) {\n\t\t\t\tsb.append((char) n);\n\t\t\t\tn = scan();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n\n\t\tprivate boolean isWhiteSpace(int n) {\n\t\t\tif (n == ' ' || n == '\\n' || n == '\\r' || n == '\\t' || n == -1)\n\t\t\t\treturn true;\n\t\t\treturn false;\n\t\t}\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["sortings", "greedy"], "code_uid": "aa1189f98e64a0edf0bb415e0353b252", "src_uid": "715608282b27a0a25b66f08574a6d5bd", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.*;\nimport java.util.StringTokenizer;\n\npublic class CF837_E_VasyasFunction {\n\n private static final long gcd(long a, long b) {\n return b == 0 ? a : gcd(b, a % b);\n }\n\n private static long f(long a, long b) {\n if (b == 0)\n return 0;\n long g = gcd(a, b);\n long min = Long.MAX_VALUE, divisor = g;\n for (long d = 1; d * d <= a; d++) {\n if (a % d == 0) {\n if (d > g && d % g == 0) {\n long x = (b % d) / g;\n if (min > x) {\n min = x;\n divisor = d;\n }\n }\n long otherDivisors = a / d;\n if (otherDivisors > g && otherDivisors % g == 0) {\n long x = (b % otherDivisors) / g;\n if (min > x) {\n min = x;\n divisor = otherDivisors;\n }\n }\n }\n }\n return divisor == g ? b / g : min + f(a, b - g * min);\n }\n\n public static void main(String[] args) throws IOException {\n MyScanner sc = new MyScanner(System.in);\n PrintWriter out = new PrintWriter(System.out);\n out.println(f(sc.nextLong(), sc.nextLong()));\n out.flush();\n out.close();\n }\n\n private static class MyScanner {\n StringTokenizer st;\n BufferedReader br;\n\n public MyScanner(InputStream s) {\n br = new BufferedReader(new InputStreamReader(s));\n }\n\n public MyScanner(String filename) throws IOException {\n br = new BufferedReader(new FileReader(new File(filename)));\n }\n\n public String next() throws IOException {\n while (st == null || !st.hasMoreTokens())\n st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n\n public int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n public long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n public String nextLine() throws IOException {\n return br.readLine();\n }\n\n public double nextDouble() throws IOException {\n String x = next();\n StringBuilder sb = new StringBuilder(\"0\");\n double res = 0, f = 1;\n boolean dec = false, neg = false;\n int start = 0;\n if (x.charAt(0) == '-') {\n neg = true;\n start++;\n }\n for (int i = start; i < x.length(); i++)\n if (x.charAt(i) == '.') {\n res = Long.parseLong(sb.toString());\n sb = new StringBuilder(\"0\");\n dec = true;\n } else {\n sb.append(x.charAt(i));\n if (dec)\n f *= 10;\n }\n res += Long.parseLong(sb.toString()) / f;\n return res * (neg ? -1 : 1);\n }\n\n public boolean ready() throws IOException {\n return br.ready();\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation", "binary search"], "code_uid": "a34b2604d5f1a0d0474adde2972a313d", "src_uid": "ea92cd905e9725e7fcb87b9ed4f64c2e", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "//package CodeforcesProject;\n\nimport java.io.*;\nimport java.lang.*;\nimport java.util.*;\nimport java.util.function.BiFunction;\n\npublic class Main extends IO {\n\n public static void main(String[] args) throws Exception {\n int g = readInt();\n int sh = readInt();\n int j = readInt();\n int p = readInt();\n int priceFirst = readInt();\n int priceSecond = readInt();\n long answer = 0;\n if (priceFirst <= priceSecond){\n answer = Math.min(Math.min(sh, j), p);\n p -= answer;\n answer *= priceSecond;\n answer += (Math.min(p, g) * priceFirst);\n }\n else{\n answer = Math.min(g, p);\n p -= answer;\n answer *= priceFirst;\n answer += (Math.min(Math.min(sh, j), p) * priceSecond);\n }\n System.out.println(answer);\n }\n}\n\nclass math {\n\n protected static int remains = 0x989687;\n\n protected static int gcd(int a, int b) { // NOD\n if (b == 0) {\n return a;\n }\n return gcd(b, a % b);\n }\n\n protected static long gcd(long a, long b) {\n if (b == 0) {\n return a;\n }\n return gcd(b, a % b);\n }\n\n protected static float gcd(float a, float b) {\n if (b == 0) {\n return a;\n }\n return gcd(b, a % b);\n }\n\n protected static double gcd(double a, double b) {\n if (b == 0) {\n return a;\n }\n return gcd(b, a % b);\n }\n\n protected static double lcm(double a, double b) { // NOK\n return a / gcd(a, b) * b;\n }\n\n protected static float lcm(float a, float b) { // NOK\n return a / gcd(a, b) * b;\n }\n\n protected static int lcm(int a, int b) { // NOK\n return a / gcd(a, b) * b;\n }\n\n protected static long lcm(long a, long b) {\n return a / gcd(a, b) * b;\n }\n\n protected static double log(double value, int base) {\n return Math.log(value) / Math.log(base);\n }\n\n protected static long factorial(int number) {\n if (number < 0) {\n return 0;\n }\n return solveFactorial(number);\n }\n\n private static long solveFactorial(int number) {\n if (number > 0) {\n return solveFactorial(number - 1) * number;\n }\n return 1;\n }\n}\n\nclass Int implements Comparable<Integer> {\n\n protected int value;\n\n Int(int value) {\n this.value = value;\n }\n\n @Override\n public int compareTo(Integer o) {\n return (this.value < o) ? -1 : ((this.value == o) ? 0 : 1);\n }\n\n @Override\n public boolean equals(Object obj) {\n if (obj instanceof Integer) {\n return value == (Integer) obj;\n }\n return false;\n }\n\n @Override\n public int hashCode() {\n return value;\n }\n\n @Override\n protected void finalize() throws Throwable {\n super.finalize();\n }\n}\n\nclass Fraction<T extends Number> extends Pair {\n\n private Fraction(T dividend, T divider) {\n super(dividend, divider);\n reduce();\n }\n\n protected static <T extends Number> Fraction<T> createFraction(T dividend, T divider) {\n return new Fraction<>(dividend, divider);\n }\n\n protected void reduce() {\n if (getFirstElement() instanceof Integer) {\n Integer Dividend = (Integer) getFirstElement();\n Integer Divider = (Integer) getSecondElement();\n int gcd = math.gcd(Dividend, Divider);\n setFirst(Dividend / gcd);\n setSecond(Divider / gcd);\n } else if (getFirstElement() instanceof Long) {\n Long Dividend = (Long) getFirstElement();\n Long Divider = (Long) getSecondElement();\n long gcd = math.gcd(Dividend, Divider);\n setFirst(Dividend / gcd);\n setSecond(Divider / gcd);\n } else if (getFirstElement() instanceof Float) {\n Float Dividend = (Float) getFirstElement();\n Float Divider = (Float) getSecondElement();\n float gcd = math.gcd(Dividend, Divider);\n setFirst(Dividend / gcd);\n setSecond(Divider / gcd);\n } else if (getFirstElement() instanceof Double) {\n Double Dividend = (Double) getFirstElement();\n Double Divider = (Double) getSecondElement();\n double gcd = math.gcd(Dividend, Divider);\n setFirst(Dividend / gcd);\n setSecond(Divider / gcd);\n }\n }\n\n protected void addWithoutReturn(Fraction number) throws UnsupportedOperationException {\n add(number, 0);\n }\n\n private Fraction add(Fraction number, int function) throws UnsupportedOperationException {\n if (getFirstElement() instanceof Integer && number.getFirstElement() instanceof Integer) {\n Integer Dividend = (Integer) getFirstElement();\n Integer Divider = (Integer) getSecondElement();\n Integer Dividend1 = (Integer) number.getFirstElement();\n Integer Divider1 = (Integer) number.getSecondElement();\n Integer lcm = math.lcm(Divider, Divider1);\n if (function == 0) {\n setFirst((lcm / Divider) * Dividend + (lcm / Divider1) * Dividend1);\n setSecond(lcm);\n reduce();\n return null;\n }\n Fraction result = Fraction.createFraction((lcm / Divider) * Dividend + (lcm / Divider1) * Dividend1, lcm);\n result.reduce();\n return result;\n\n } else if (getFirstElement() instanceof Long && number.getFirstElement() instanceof Long) {\n Long Dividend = (Long) getFirstElement();\n Long Divider = (Long) getSecondElement();\n Long Dividend1 = (Long) number.getFirstElement();\n Long Divider1 = (Long) number.getSecondElement();\n Long lcm = math.lcm(Divider, Divider1);\n if (function == 0) {\n setFirst((lcm / Divider) * Dividend + (lcm / Divider1) * Dividend1);\n setSecond(lcm);\n reduce();\n return null;\n }\n Fraction result = Fraction.createFraction((lcm / Divider) * Dividend + (lcm / Divider1) * Dividend1, lcm);\n result.reduce();\n return result;\n } else if (getFirstElement() instanceof Float && number.getFirstElement() instanceof Float) {\n Float Dividend = (Float) getFirstElement();\n Float Divider = (Float) getSecondElement();\n Float Dividend1 = (Float) number.getFirstElement();\n Float Divider1 = (Float) number.getSecondElement();\n Float lcm = math.lcm(Divider, Divider1);\n if (function == 0) {\n setFirst((lcm / Divider) * Dividend + (lcm / Divider1) * Dividend1);\n setSecond(lcm);\n reduce();\n return null;\n }\n Fraction result = Fraction.createFraction((lcm / Divider) * Dividend + (lcm / Divider1) * Dividend1, lcm);\n result.reduce();\n return result;\n } else if (getFirstElement() instanceof Double && number.getFirstElement() instanceof Double) {\n Double Dividend = (Double) getFirstElement();\n Double Divider = (Double) getSecondElement();\n Double Dividend1 = (Double) number.getFirstElement();\n Double Divider1 = (Double) number.getSecondElement();\n Double lcm = math.lcm(Divider, Divider1);\n if (function == 0) {\n setFirst((lcm / Divider) * Dividend + (lcm / Divider1) * Dividend1);\n setSecond(lcm);\n reduce();\n return null;\n }\n Fraction result = Fraction.createFraction((lcm / Divider) * Dividend + (lcm / Divider1) * Dividend1, lcm);\n result.reduce();\n return result;\n } else {\n throw new UnsupportedOperationException();\n }\n }\n\n protected Fraction addWithReturn(Fraction number) {\n return add(number, 1);\n }\n\n protected void multiplyWithoutReturn(Fraction number) throws UnsupportedOperationException {\n multiply(number, 0);\n }\n\n protected Fraction multiplyWithReturn(Fraction number) throws UnsupportedOperationException {\n return multiply(number, 1);\n }\n\n private Fraction multiply(Fraction number, int function) throws UnsupportedOperationException {\n if (getFirstElement() instanceof Integer && number.getFirstElement() instanceof Integer) {\n Integer first = (Integer) getFirstElement() * (Integer) number.getFirstElement();\n Integer second = (Integer) getSecondElement() * (Integer) number.getSecondElement();\n if (function == 0) {\n setFirst(first);\n setSecond(second);\n reduce();\n return null;\n }\n Fraction answer = Fraction.createFraction(first, second);\n answer.reduce();\n return answer;\n } else if (getFirstElement() instanceof Long && number.getFirstElement() instanceof Long) {\n Long first = (Long) getFirstElement() * (Long) number.getFirstElement();\n Long second = (Long) getSecondElement() * (Long) number.getSecondElement();\n if (function == 0) {\n setFirst(first);\n setSecond(second);\n reduce();\n return null;\n }\n Fraction answer = Fraction.createFraction(first, second);\n answer.reduce();\n return answer;\n\n } else if (getFirstElement() instanceof Float && number.getFirstElement() instanceof Float) {\n Float first = (Float) getFirstElement() * (Float) number.getFirstElement();\n Float second = (Float) getSecondElement() * (Float) number.getSecondElement();\n if (function == 0) {\n setFirst(first);\n setSecond(second);\n reduce();\n return null;\n }\n Fraction answer = Fraction.createFraction(first, second);\n answer.reduce();\n return answer;\n } else if (getFirstElement() instanceof Double && number.getFirstElement() instanceof Double) {\n Double first = (Double) getFirstElement() * (Double) number.getFirstElement();\n Double second = (Double) getSecondElement() * (Double) number.getSecondElement();\n if (function == 0) {\n setFirst(first);\n setSecond(second);\n reduce();\n return null;\n }\n Fraction answer = Fraction.createFraction(first, second);\n answer.reduce();\n return answer;\n } else {\n throw new UnsupportedOperationException();\n }\n }\n}\n\nclass Pair<T, T1> implements Cloneable {\n\n private T first;\n private T1 second;\n\n Pair(T obj, T1 obj1) {\n first = obj;\n second = obj1;\n }\n\n protected static <T, T1> Pair<T, T1> createPair(T element, T1 element1) {\n return new Pair<>(element, element1);\n }\n\n protected T getFirstElement() {\n return first;\n }\n\n protected T1 getSecondElement() {\n return second;\n }\n\n protected void setFirst(T element) {\n first = element;\n }\n\n protected void setSecond(T1 element) {\n second = element;\n }\n\n @Override\n public boolean equals(Object obj) {\n if (!(obj instanceof Pair)) {\n return false;\n }\n Pair pair = (Pair) obj;\n return first.equals(pair.first) && second.equals(pair.second);\n }\n\n @Override\n public int hashCode() {\n int hashCode = 1;\n hashCode = 31 * hashCode + (first == null ? 0 : first.hashCode());\n return 31 * hashCode + (second == null ? 0 : second.hashCode());\n }\n\n @Override\n public Object clone() {\n return Pair.createPair(first, second);\n }\n}\n\nclass Graph {\n\n private int[][] base;\n private boolean[] used;\n private int quantity;\n private Integer[] ancestor;\n\n public int[][] getBase() {\n return base.clone();\n }\n\n public boolean[] getUsed() {\n return used.clone();\n }\n\n public int getQuantity() {\n return quantity;\n }\n\n public Integer[] getAncestor() {\n return ancestor.clone();\n }\n\n public void setBase(int[][] base) {\n this.base = base;\n }\n\n protected void start(int length) {\n used = new boolean[length];\n ancestor = new Integer[length];\n Arrays.fill(ancestor, -1);\n quantity = 0;\n }\n\n\n protected void edgesMatrixToDefault(int length, int quantity, boolean readConsole, int[][] value) throws Exception {\n base = new int[length][];\n List<ArrayList<Integer>> inputBase = new ArrayList<>();\n for (int i = 0; i < length; i++) {\n inputBase.add(new ArrayList<>());\n }\n for (int i = 0; i < quantity; i++) {\n int[] input = readConsole ? IO.readArrayInt(\" \") : value[i];\n inputBase.get(input[0] - 1).add(input[1] - 1);\n //inputBase.get(input[0] - 1).add(input[2]); // price\n inputBase.get(input[1] - 1).add(input[0] - 1);\n //inputBase.get(input[1] - 1).add(input[2]); // price\n }\n for (int i = 0; i < length; i++) {\n base[i] = inputBase.get(i).stream().mapToInt(Integer::intValue).toArray();\n }\n start(length);\n }\n\n protected void adjacencyMatrixToDefault(int length, int not, boolean readConsole, int[][] value) throws Exception {\n this.base = new int[length][];\n List<Integer> buffer = new ArrayList<>();\n for (int i = 0; i < length; i++) {\n int[] InputArray = readConsole ? IO.readArrayInt(\" \") : value[i];\n for (int index = 0; index < length; index++) {\n if (i != index && InputArray[index] != not) {\n buffer.add(index);\n // buffer.add(InputArray[index]); // price\n }\n }\n this.base[i] = buffer.stream().mapToInt(Integer::intValue).toArray();\n buffer.clear();\n }\n start(length);\n }\n\n protected void dfs(int position) throws Exception {\n used[position] = true;\n quantity++;\n int next;\n for (int index = 0; index < base[position].length; index++) {\n next = base[position][index];\n if (!used[next]) {\n ancestor[next] = position;\n dfs(next);\n } /*else {\n if (next != ancestor[position]) { // if cycle\n throw new Exception();\n }\n }*/\n }\n }\n\n protected int dijkstra(int start, int stop, int size) {\n start--;\n stop--;\n int[] dist = new int[size];\n for (int i = 0; i < size; i++) {\n if (i != start) {\n dist[i] = Integer.MAX_VALUE;\n }\n ancestor[i] = start;\n }\n\n Queue<int[]> queue = new PriorityQueue<>(Comparator.comparingInt((int[] ints) -> ints[1]));\n queue.add(new int[]{start, 0});\n int position;\n int[] getQueue;\n while (queue.size() != 0) {\n getQueue = queue.poll();\n position = getQueue[0];\n if (getQueue[1] > dist[position]) {\n continue;\n }\n for (int index = 0; index < this.base[position].length; index += 2) {\n if (dist[position] + this.base[position][index + 1] < dist[this.base[position][index]] && !this.used[this.base[position][index]]) {\n dist[this.base[position][index]] = dist[position] + this.base[position][index + 1];\n this.ancestor[this.base[position][index]] = position;\n queue.add(new int[]{this.base[position][index], dist[this.base[position][index]]});\n }\n }\n used[position] = true;\n }\n return dist[stop] == Integer.MAX_VALUE ? -1 : dist[stop];\n }\n\n protected static boolean solveFloydWarshall(int[][] base, int length, int not) {\n for (int k = 0; k < length; k++) {\n for (int i = 0; i < length; i++) {\n for (int j = 0; j < length; j++) {\n if (base[i][k] == not || base[k][j] == not) {\n continue;\n }\n int total = base[i][k] + base[k][j];\n if (base[i][j] != not) {\n base[i][j] = Math.min(base[i][j], total);\n } else {\n base[i][j] = total;\n }\n }\n }\n }\n for (int index = 0; index < length; index++) {\n if (base[index][index] != 0) { // if cycle\n return false;\n }\n }\n return true;\n }\n\n protected static Pair<Long, int[][]> solveKruskal(int[][] edgesMatrix, final int countVertex, final int indexSort) {\n int[][] answer = new int[countVertex - 1][2];\n long sum = 0;\n Arrays.sort(edgesMatrix, Comparator.comparingInt(value -> value[indexSort]));\n SystemOfDisjointSets dsu = new SystemOfDisjointSets(countVertex);\n for (int i = 0; i < countVertex; i++) {\n dsu.makeSet(i);\n }\n int index = 0;\n for (int[] value : edgesMatrix) {\n if (dsu.mergeSets(value[0], value[1])) {\n sum += value[indexSort];\n answer[index] = new int[]{value[0], value[1]};\n index++;\n }\n }\n if (index < countVertex - 1) {\n return Pair.createPair(null, null);\n }\n return Pair.createPair(sum, answer);\n }\n\n static class SegmentTree {\n\n private int[] segmentArray;\n private BiFunction<Integer, Integer, Integer> function;\n\n protected void setSegmentArray(int[] segmentArray) {\n this.segmentArray = segmentArray;\n }\n\n protected int[] getSegmentArray() {\n return segmentArray.clone();\n }\n\n protected void setFunction(BiFunction<Integer, Integer, Integer> function) {\n this.function = function;\n }\n\n protected BiFunction<Integer, Integer, Integer> getFunction() {\n return function;\n }\n\n SegmentTree() {\n\n }\n\n SegmentTree(int[] startBase, int neutral, BiFunction<Integer, Integer, Integer> function) {\n this.function = function;\n int length = startBase.length;\n int[] base;\n if ((length & (length - 1)) != 0) {\n int pow = 0;\n while (length > 0) {\n length >>= 1;\n pow++;\n }\n pow--;\n base = new int[2 << pow];\n System.arraycopy(startBase, 0, base, 0, startBase.length);\n Arrays.fill(base, startBase.length, base.length, neutral);\n\n } else {\n base = startBase;\n }\n segmentArray = new int[base.length << 1]; // maybe * 4\n Arrays.fill(segmentArray, neutral);\n inDepth(base, 1, 0, base.length - 1);\n }\n\n private void inDepth(int[] base, int position, int low, int high) {\n if (low == high) {\n segmentArray[position] = base[low];\n } else {\n int mid = (low + high) >> 1;\n inDepth(base, position << 1, low, mid);\n inDepth(base, (position << 1) + 1, mid + 1, high);\n segmentArray[position] = function.apply(segmentArray[position << 1], segmentArray[(position << 1) + 1]);\n }\n }\n\n protected int getValue(int left, int right, int neutral) {\n return findValue(1, 0, ((segmentArray.length) >> 1) - 1, left, right, neutral);\n }\n\n private int findValue(int position, int low, int high, int left, int right, int neutral) {\n if (left > right) {\n return neutral;\n }\n if (left == low && right == high) {\n return segmentArray[position];\n }\n int mid = (low + high) >> 1;\n return function.apply(findValue(position << 1, low, mid, left, Math.min(right, mid), neutral),\n findValue((position << 1) + 1, mid + 1, high, Math.max(left, mid + 1), right, neutral));\n }\n\n protected void replaceValue(int index, int value) {\n update(1, 0, (segmentArray.length >> 1) - 1, index, value);\n }\n\n private void update(int position, int low, int high, int index, int value) {\n if (low == high) {\n segmentArray[position] = value;\n } else {\n int mid = (low + high) >> 1;\n if (index <= mid) {\n update(position << 1, low, mid, index, value);\n } else {\n update((position << 1) + 1, mid + 1, high, index, value);\n }\n segmentArray[position] = function.apply(segmentArray[position << 1], segmentArray[(position << 1) + 1]);\n }\n }\n }\n\n static class SegmentTreeGeneric<T> {\n\n private Object[] segmentArray;\n private BiFunction<T, T, T> function;\n\n protected void setSegmentArray(T[] segmentArray) {\n this.segmentArray = segmentArray;\n }\n\n protected Object getSegmentArray() {\n return segmentArray.clone();\n }\n\n protected void setFunction(BiFunction<T, T, T> function) {\n this.function = function;\n }\n\n protected BiFunction<T, T, T> getFunction() {\n return function;\n }\n\n SegmentTreeGeneric() {\n\n }\n\n SegmentTreeGeneric(T[] startBase, T neutral, BiFunction<T, T, T> function) {\n this.function = function;\n int length = startBase.length;\n Object[] base;\n if ((length & (length - 1)) != 0) {\n int pow = 0;\n while (length > 0) {\n length >>= 1;\n pow++;\n }\n pow--;\n base = new Object[2 << pow];\n System.arraycopy(startBase, 0, base, 0, startBase.length);\n Arrays.fill(base, startBase.length, base.length, neutral);\n\n } else {\n base = startBase;\n }\n segmentArray = new Object[base.length << 1]; // maybe * 4\n Arrays.fill(segmentArray, neutral);\n inDepth(base, 1, 0, base.length - 1);\n }\n\n private void inDepth(Object[] base, int position, int low, int high) {\n if (low == high) {\n segmentArray[position] = base[low];\n } else {\n int mid = (low + high) >> 1;\n inDepth(base, position << 1, low, mid);\n inDepth(base, (position << 1) + 1, mid + 1, high);\n segmentArray[position] = function.apply((T) segmentArray[position << 1], (T) segmentArray[(position << 1) + 1]);\n }\n }\n\n protected T getValue(int left, int right, T neutral) {\n return findValue(1, 0, ((segmentArray.length) >> 1) - 1, left, right, neutral);\n }\n\n private T findValue(int position, int low, int high, int left, int right, T neutral) {\n if (left > right) {\n return neutral;\n }\n if (left == low && right == high) {\n return (T) segmentArray[position];\n }\n int mid = (low + high) >> 1;\n return function.apply(findValue(position << 1, low, mid, left, Math.min(right, mid), neutral),\n findValue((position << 1) + 1, mid + 1, high, Math.max(left, mid + 1), right, neutral));\n }\n\n protected void replaceValue(int index, T value) {\n update(1, 0, (segmentArray.length >> 1) - 1, index, value);\n }\n\n private void update(int position, int low, int high, int index, T value) {\n if (low == high) {\n segmentArray[position] = value;\n } else {\n int mid = (low + high) >> 1;\n if (index <= mid) {\n update(position << 1, low, mid, index, value);\n } else {\n update((position << 1) + 1, mid + 1, high, index, value);\n }\n segmentArray[position] = function.apply((T) segmentArray[position << 1], (T) segmentArray[(position << 1) + 1]);\n }\n }\n }\n}\n\nclass SystemOfDisjointSets {\n\n private int[] rank;\n private int[] ancestor;\n\n SystemOfDisjointSets(int size) {\n this.rank = new int[size];\n this.ancestor = new int[size];\n }\n\n protected void makeSet(int value) {\n ancestor[value] = value;\n rank[value] = 0;\n }\n\n protected int findSet(int value) {\n if (value == ancestor[value]) {\n return value;\n }\n return ancestor[value] = findSet(ancestor[value]);\n }\n\n protected boolean mergeSets(int first, int second) {\n first = findSet(first);\n second = findSet(second);\n if (first != second) {\n if (rank[first] < rank[second]) {\n int number = first;\n first = second;\n second = number;\n }\n ancestor[second] = first;\n if (rank[first] == rank[second]) {\n rank[first]++;\n }\n return true;\n }\n return false;\n }\n}\n\ninterface Array {\n void useArray(int[] a);\n}\n\ninterface Method {\n void use();\n}\n\nclass FastSort {\n\n protected static int[] sort(int[] array, int ShellHeapMergeMyInsertionSort) {\n sort(array, ShellHeapMergeMyInsertionSort, array.length);\n return array;\n }\n\n protected static int[] sortClone(int[] array, int ShellHeapMergeMyInsertionSort) {\n int[] base = array.clone();\n sort(base, ShellHeapMergeMyInsertionSort, array.length);\n return base;\n }\n\n private static void sort(int[] array, int ShellHeapMergeMyInsertionSort, int length) {\n if (ShellHeapMergeMyInsertionSort < 0 || ShellHeapMergeMyInsertionSort > 4) {\n Random random = new Random();\n ShellHeapMergeMyInsertionSort = random.nextInt(4);\n }\n if (ShellHeapMergeMyInsertionSort == 0) {\n ShellSort(array);\n } else if (ShellHeapMergeMyInsertionSort == 1) {\n HeapSort(array);\n } else if (ShellHeapMergeMyInsertionSort == 2) {\n MergeSort(array, 0, length - 1);\n } else if (ShellHeapMergeMyInsertionSort == 3) {\n straightMergeSort(array, length);\n } else if (ShellHeapMergeMyInsertionSort == 4) {\n insertionSort(array);\n }\n }\n\n private static void straightMergeSort(int[] array, int size) {\n if (size == 0) {\n return;\n }\n int length = (size >> 1) + ((size % 2) == 0 ? 0 : 1);\n Integer[][] ZeroBuffer = new Integer[length + length % 2][2];\n Integer[][] FirstBuffer = new Integer[0][0];\n for (int index = 0; index < length; index++) {\n int ArrayIndex = index << 1;\n int NextArrayIndex = (index << 1) + 1;\n if (NextArrayIndex < size) {\n if (array[ArrayIndex] > array[NextArrayIndex]) {\n ZeroBuffer[index][0] = array[NextArrayIndex];\n ZeroBuffer[index][1] = array[ArrayIndex];\n } else {\n ZeroBuffer[index][0] = array[ArrayIndex];\n ZeroBuffer[index][1] = array[NextArrayIndex];\n }\n } else {\n ZeroBuffer[index][0] = array[ArrayIndex];\n }\n }\n boolean position = false;\n int pointer0, pointer, pointer1, number = 4, NewPointer, count;\n Integer[][] NewBuffer;\n Integer[][] OldBuffer;\n length = (size >> 2) + ((size % 4) == 0 ? 0 : 1);\n while (true) {\n pointer0 = 0;\n count = (number >> 1) - 1;\n if (!position) {\n FirstBuffer = new Integer[length + length % 2][number];\n NewBuffer = FirstBuffer;\n OldBuffer = ZeroBuffer;\n } else {\n ZeroBuffer = new Integer[length + length % 2][number];\n NewBuffer = ZeroBuffer;\n OldBuffer = FirstBuffer;\n }\n for (int i = 0; i < length; i++) {\n pointer = 0;\n pointer1 = 0;\n NewPointer = pointer0 + 1;\n if (length == 1) {\n for (int g = 0; g < size; g++) {\n if (pointer > count || OldBuffer[pointer0][pointer] == null) {\n array[g] = OldBuffer[NewPointer][pointer1];\n pointer1++;\n } else if (pointer1 > count || OldBuffer[NewPointer][pointer1] == null) {\n if (OldBuffer[pointer0][pointer] == null) {\n continue;\n }\n array[g] = OldBuffer[pointer0][pointer];\n pointer++;\n } else if (OldBuffer[pointer0][pointer] >= OldBuffer[NewPointer][pointer1]) {\n array[g] = OldBuffer[NewPointer][pointer1];\n pointer1++;\n } else {\n array[g] = OldBuffer[pointer0][pointer];\n pointer++;\n }\n }\n return;\n }\n for (int g = 0; g < number; g++) {\n if (pointer > count || OldBuffer[pointer0][pointer] == null) {\n if (OldBuffer[NewPointer][pointer1] == null) {\n continue;\n }\n NewBuffer[i][g] = OldBuffer[NewPointer][pointer1];\n pointer1++;\n } else if (pointer1 > count || OldBuffer[NewPointer][pointer1] == null) {\n if (OldBuffer[pointer0][pointer] == null) {\n continue;\n }\n NewBuffer[i][g] = OldBuffer[pointer0][pointer];\n pointer++;\n } else if (OldBuffer[pointer0][pointer] >= OldBuffer[NewPointer][pointer1]) {\n NewBuffer[i][g] = OldBuffer[NewPointer][pointer1];\n pointer1++;\n } else {\n NewBuffer[i][g] = OldBuffer[pointer0][pointer];\n pointer++;\n }\n }\n pointer0 += 2;\n }\n position = !position;\n length = (length >> 1) + length % 2;\n number <<= 1;\n }\n }\n\n private static void ShellSort(int[] array) {\n int j;\n for (int gap = (array.length >> 1); gap > 0; gap >>= 1) {\n for (int i = gap; i < array.length; i++) {\n int temp = array[i];\n for (j = i; j >= gap && array[j - gap] > temp; j -= gap) {\n array[j] = array[j - gap];\n }\n array[j] = temp;\n }\n }\n }\n\n private static void HeapSort(int[] array) {\n for (int i = (array.length >> 1) - 1; i >= 0; i--)\n shiftDown(array, i, array.length);\n for (int i = array.length - 1; i > 0; i--) {\n swap(array, 0, i);\n shiftDown(array, 0, i);\n }\n }\n\n private static void shiftDown(int[] array, int i, int n) {\n int child;\n int tmp;\n for (tmp = array[i]; leftChild(i) < n; i = child) {\n child = leftChild(i);\n if (child != n - 1 && (array[child] < array[child + 1]))\n child++;\n if (tmp < array[child])\n array[i] = array[child];\n else\n break;\n }\n array[i] = tmp;\n }\n\n private static int leftChild(int i) {\n return (i << 1) + 1;\n }\n\n private static void swap(int[] array, int i, int j) {\n int temp = array[i];\n array[i] = array[j];\n array[j] = temp;\n }\n\n private static void MergeSort(int[] array, int low, int high) {\n if (low < high) {\n int mid = (low + high) >> 1;\n MergeSort(array, low, mid);\n MergeSort(array, mid + 1, high);\n merge(array, low, mid, high);\n }\n }\n\n private static void merge(int[] array, int low, int mid, int high) {\n int n = high - low + 1;\n int[] Temp = new int[n];\n int i = low, j = mid + 1;\n int k = 0;\n while (i <= mid || j <= high) {\n if (i > mid)\n Temp[k++] = array[j++];\n else if (j > high)\n Temp[k++] = array[i++];\n else if (array[i] < array[j])\n Temp[k++] = array[i++];\n else\n Temp[k++] = array[j++];\n }\n for (j = 0; j < n; j++)\n array[low + j] = Temp[j];\n }\n\n private static void insertionSort(int[] elements) {\n for (int i = 1; i < elements.length; i++) {\n int key = elements[i];\n int j = i - 1;\n while (j >= 0 && key < elements[j]) {\n elements[j + 1] = elements[j];\n j--;\n }\n elements[j + 1] = key;\n }\n }\n}\n\nclass IO {\n\n private static BufferedReader read;\n private static boolean fileInput = false;\n private static BufferedWriter write;\n private static boolean fileOutput = false;\n\n public static void setFileInput(boolean fileInput) {\n IO.fileInput = fileInput;\n }\n\n public static void setFileOutput(boolean fileOutput) {\n IO.fileOutput = fileOutput;\n }\n\n private static void startInput() {\n try {\n read = new BufferedReader(fileInput ? new FileReader(\"input.txt\") : new InputStreamReader(System.in));\n } catch (Exception error) {\n }\n }\n\n private static void startOutput() {\n try {\n write = new BufferedWriter(fileOutput ? new FileWriter(\"output.txt\") : new OutputStreamWriter(System.out));\n } catch (Exception error) {\n }\n }\n\n protected static int readInt() throws Exception {\n if (read == null) {\n startInput();\n }\n return Integer.parseInt(read.readLine());\n }\n\n protected static long readLong() throws Exception {\n if (read == null) {\n startInput();\n }\n return Long.parseLong(read.readLine());\n }\n\n protected static String readString() throws Exception {\n if (read == null) {\n startInput();\n }\n return read.readLine();\n }\n\n protected static int[] readArrayInt(String split) throws Exception {\n if (read == null) {\n startInput();\n }\n return Arrays.stream(read.readLine().split(split)).mapToInt(Integer::parseInt).toArray();\n }\n\n protected static long[] readArrayLong(String split) throws Exception {\n if (read == null) {\n startInput();\n }\n return Arrays.stream(read.readLine().split(split)).mapToLong(Long::parseLong).toArray();\n }\n\n protected static String[] readArrayString(String split) throws Exception {\n if (read == null) {\n startInput();\n }\n return read.readLine().split(split);\n }\n\n protected static void writeArray(int[] array, String split, boolean enter) {\n if (write == null) {\n startOutput();\n }\n try {\n int length = array.length;\n for (int index = 0; index < length; index++) {\n write.write(Integer.toString(array[index]));\n if (index + 1 != length) {\n write.write(split);\n }\n }\n if (enter) {\n writeEnter();\n }\n } catch (Exception error) {\n }\n }\n\n protected static void writeArray(Integer[] array, String split, boolean enter) {\n if (write == null) {\n startOutput();\n }\n try {\n int length = array.length;\n for (int index = 0; index < length; index++) {\n write.write(Integer.toString(array[index]));\n if (index + 1 != length) {\n write.write(split);\n }\n }\n if (enter) {\n writeEnter();\n }\n } catch (Exception error) {\n }\n }\n\n protected static void writeArray(Int[] array, String split, boolean enter) {\n if (write == null) {\n startOutput();\n }\n try {\n int length = array.length;\n for (int index = 0; index < length; index++) {\n write.write(Integer.toString(array[index].value));\n if (index + 1 != length) {\n write.write(split);\n }\n }\n if (enter) {\n writeEnter();\n }\n } catch (Exception error) {\n }\n }\n\n protected static void writeArray(long[] array, String split, boolean enter) {\n if (write == null) {\n startOutput();\n }\n try {\n int length = array.length;\n for (int index = 0; index < length; index++) {\n write.write(Long.toString(array[index]));\n if (index + 1 != length) {\n write.write(split);\n }\n }\n if (enter) {\n writeEnter();\n }\n } catch (Exception error) {\n }\n }\n\n protected static void writeArray(Long[] array, String split, boolean enter) {\n if (write == null) {\n startOutput();\n }\n try {\n int length = array.length;\n for (int index = 0; index < length; index++) {\n write.write(Long.toString(array[index]));\n if (index + 1 != length) {\n write.write(split);\n }\n }\n if (enter) {\n writeEnter();\n }\n } catch (Exception error) {\n }\n }\n\n public static void writeArray(String[] array, String split, boolean enter) {\n if (write == null) {\n startOutput();\n }\n try {\n int length = array.length;\n for (int index = 0; index < length; index++) {\n write.write(array[index]);\n if (index + 1 != length) {\n write.write(split);\n }\n }\n if (enter) {\n writeEnter();\n }\n } catch (Exception ignored) {\n }\n }\n\n protected static void writeArray(boolean[] array, String split, boolean enter) {\n if (write == null) {\n startOutput();\n }\n try {\n int length = array.length;\n for (int index = 0; index < length; index++) {\n write.write(Boolean.toString(array[index]));\n if (index + 1 != length) {\n write.write(split);\n }\n }\n if (enter) {\n writeEnter();\n }\n } catch (Exception ignored) {\n }\n }\n\n protected static void writeInt(int number, String end) {\n if (write == null) {\n startOutput();\n }\n try {\n write.write(Integer.toString(number));\n write.write(end);\n } catch (Exception ignored) {\n }\n }\n\n protected static void writeInt(Integer number, String end) {\n if (write == null) {\n startOutput();\n }\n try {\n write.write(Integer.toString(number));\n write.write(end);\n } catch (Exception ignored) {\n }\n }\n\n protected static void writeLong(long number, String end) {\n if (write == null) {\n startOutput();\n }\n try {\n write.write(Long.toString(number));\n write.write(end);\n } catch (Exception ignored) {\n }\n }\n\n protected static void writeLong(Long number, String end) {\n if (write == null) {\n startOutput();\n }\n try {\n write.write(Long.toString(number));\n write.write(end);\n } catch (Exception ignored) {\n }\n }\n\n protected static void writeString(String word, String end) {\n if (write == null) {\n startOutput();\n }\n try {\n write.write(word);\n write.write(end);\n } catch (Exception ignored) {\n }\n }\n\n protected static void writeBoolean(boolean value, String end) {\n if (write == null) {\n startOutput();\n }\n try {\n write.write(value ? \"true\" : \"false\");\n write.write(end);\n } catch (Exception ignored) {\n }\n }\n\n protected static void writeBoolean(Boolean value, String end) {\n if (write == null) {\n startOutput();\n }\n try {\n write.write(value ? \"true\" : \"false\");\n write.write(end);\n } catch (Exception ignored) {\n }\n }\n\n protected static void writeChar(char word, String end) {\n if (write == null) {\n startOutput();\n }\n try {\n write.write(word);\n write.write(end);\n } catch (Exception ignored) {\n }\n }\n\n protected static void writeChar(Character word, String end) {\n if (write == null) {\n startOutput();\n }\n try {\n write.write(word);\n write.write(end);\n } catch (Exception ignored) {\n }\n }\n\n\n protected static void writeEnter() {\n if (write == null) {\n startOutput();\n }\n try {\n write.newLine();\n } catch (Exception ignored) {\n }\n }\n\n protected static void print(boolean exit) throws Exception {\n if (exit) {\n print();\n } else {\n write.flush();\n }\n }\n\n protected static void print() throws Exception {\n if (write == null) {\n return;\n }\n write.flush();\n if (read != null) {\n read.close();\n }\n write.close();\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "greedy", "brute force"], "code_uid": "da3e29f65fd48c67ca239903b0209c38", "src_uid": "84d9e7e9c9541d997e6573edb421ae0a", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author yousuf\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskA solver = new TaskA();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskA {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n\n int n = in.nextInt();\n int k = in.nextInt();\n\n long b = 1;\n for (int i = 1; i <= k; i++) {\n b *= 10;\n }\n\n out.println(IntegerUtils.lcm(n, b));\n\n }\n\n }\n\n static class IntegerUtils {\n public static long gcd(long a, long b) {\n long t;\n while (b != 0) {\n t = b;\n b = a % b;\n a = t;\n }\n\n return a;\n }\n\n public static long lcm(long a, long b) {\n return a * (b / gcd(a, b));\n }\n\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n // reader = new BufferedReader(new FileReader(\"input.txt\"));\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "a449ec60ac5f5b6e54cc1b13e7306379", "src_uid": "73566d4d9f20f7bbf71bc06bc9a4e9f3", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Scanner;\nimport java.util.HashSet;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner s = new Scanner(System.in);\n String w = s.nextLine().trim().toLowerCase();\n StringBuffer sb = new StringBuffer();\n HashSet<Character> vowels = new HashSet<Character>();\n vowels.add('a');\n vowels.add('e');\n vowels.add('i');\n vowels.add('o');\n vowels.add('u');\n vowels.add('y');\n for (char c : w.toCharArray()) {\n if (vowels.contains(c)) continue;\n sb.append('.');\n sb.append(c);\n }\n System.out.println(sb.toString());\n }\n}\n", "lang_cluster": "Java", "tags": ["strings", "implementation"], "code_uid": "90b4ccc5e08fa5fa14b6dd934594e051", "src_uid": "db9520e85b3e9186dd3a09ff8d1e8c1b", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class Main{\n\n public static void main(String[] args){\n Scanner in=new Scanner(System.in);\n int n,m,k,x,y,z;\n n=in.nextInt();\n m=in.nextInt();\n k=in.nextInt();\n x=k/2+k%2;\n y=x/m + ((x%m==0)?0:1);\n z=(x%m==0)?m:x%m;\n System.out.println(y +\" \"+ z +\" \"+((k%2==0)?\"R\":\"L\"));\n\n\n }\n}", "lang_cluster": "Java", "tags": ["math", "constructive algorithms"], "code_uid": "ecf824ac8f0ec58e866df05749463bf8", "src_uid": "d6929926b44c2d5b1a8e6b7f965ca1bb", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class LearnJava{\n\n public static void main(String[] args){\n int n, count=0;\n double k;\n Scanner scan = new Scanner(System.in);\n n = scan.nextInt();\n for(int i=1; i<=n; i++){\n for(int j=i; j<=n; j++){\n k = Math.sqrt(i*i + j*j);\n if(k==(int)k && k<=n)\n count++;\n }\n }\n System.out.print(count);\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "math"], "code_uid": "6425b8465c1aa430b66a6a71b285e5a7", "src_uid": "36a211f7814e77339eb81dc132e115e1", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "//package codeforces;\n\nimport java.io.BufferedReader;\nimport java.io.File;\nimport java.io.FileNotFoundException;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.StreamTokenizer;\nimport java.util.ArrayList;\n\npublic class CodeForces {\n\n ArrayList<Integer> num = new ArrayList<Integer>();\n\n private boolean search(int value, int begin, int end) {\n if (end - begin < 3) {\n if (num.get(begin) == value || num.get(end) == value) {\n return (true);\n } else {\n return (false);\n }\n } else {\n int middle = (end - begin) / 2 + begin;\n if (num.get(middle) == value) {\n return (true);\n } else {\n if (num.get(middle) < value) {\n return (search(value, middle + 1, end));\n } else {\n return (search(value, begin, middle - 1));\n }\n }\n }\n }\n\n public void run() throws IOException {\n MyScanner sc = new MyScanner(System.in);\n int n = sc.nextInt();\n int i = 1;\n boolean greater = false;\n while (!greater) {\n long number = i * (i + 1) / 2;\n if (number >= n) {\n greater = true;\n } else {\n num.add((int) number);\n }\n i++;\n }\n boolean exist = false;\n for (i = 0; i < num.size(); i++) {\n if (search(n - num.get(i), 0, num.size() - 1)) {\n exist = true;\n break;\n }\n }\n if (exist) {\n System.out.println(\"YES\");\n } else {\n System.out.println(\"NO\");\n }\n }\n\n public static void main(String[] args) throws FileNotFoundException, IOException {\n CodeForces cf = new CodeForces();\n cf.run();\n }\n}\n\nclass MyScanner {\n\n private StreamTokenizer st;\n\n public MyScanner(InputStream is) {\n st = new StreamTokenizer(is);\n }\n\n public MyScanner(File f) throws FileNotFoundException {\n BufferedReader in = new BufferedReader(new FileReader(f));\n st = new StreamTokenizer(in);\n }\n\n public int nextInt() throws IOException {\n st.nextToken();\n return ((int) st.nval);\n }\n\n public double nextDouble() throws IOException {\n st.nextToken();\n return (st.nval);\n }\n\n public String nextString() throws IOException {\n st.nextToken();\n return (st.sval);\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "implementation", "binary search"], "code_uid": "5167299b15d43b01757b66b8d26dcdc9", "src_uid": "245ec0831cd817714a4e5c531bffd099", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class B {\n\n\t\n\tpublic static void main(String[] args) throws IOException{\n\t\tFastScanner sc = new FastScanner();\n//\t\tint yo = sc.nextInt();\n//\t\twhile(yo-->0) {\n//\t\t}\n\t\t\n\t\tint n = sc.nextInt();\n\t\tint m = sc.nextInt();\n\t\t\n\t\tchar[][] arr = new char[n][m];\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tString s = sc.next();\n\t\t\tfor(int j = 0; j < m; j++) {\n\t\t\t\tarr[i][j] = s.charAt(j);\n\t\t\t}\n\t\t}\n\t\t\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tfor(int j = 0; j < m; j++) {\n\t\t\t\tif(arr[i][j] == 'W') {\n\t\t\t\t\tcount += helper(arr,i,j);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n\t\n\n\n\tprivate static int helper(char[][] arr, int i, int j) {\n\t\tint row = arr.length;\n\t\tint col = arr[0].length;\n\t\t\n\t\tint count = 0;\n\n\t\tif(i-1 >= 0 && arr[i-1][j] == 'P') {\n\t\t\tarr[i-1][j] = '.';\n\t\t\tcount++;\n\t\t\treturn count;\n\t\t}\n\t\t\n\t\tif(j-1 >= 0 && arr[i][j-1] == 'P') {\n\t\t\tarr[i][j-1] = '.';\n\t\t\tcount++;\n\t\t\treturn count;\n\t\t}\n\t\t\n\t\tif(i+1 < row && arr[i+1][j] == 'P') {\n\t\t\tarr[i+1][j] = '.';\n\t\t\tcount++;\n\t\t\treturn count;\n\t\t}\n\t\t\n\t\tif(j+1 < col && arr[i][j+1] == 'P') {\n\t\t\tarr[i][j+1] = '.';\n\t\t\tcount++;\n\t\t}\n\t\t\n\t\treturn count;\n\t}\n\n\n\n\tstatic int mod = 1000000007;\n\t\n\tstatic long pow(int a, int b) {\n\t\tif(b == 0) {\n\t\t\treturn 1;\n\t\t}\n\t\tif(b == 1) {\n\t\t\treturn a;\n\t\t}\n\t\tif(b%2 == 0) {\n\t\t\tlong ans = pow(a,b/2);\n\t\t\treturn ans*ans;\n\t\t}\n\t\telse {\n\t\t\tlong ans = pow(a,(b-1)/2);\n\t\t\treturn a * ans * ans;\n\t\t}\n\t\t\n\t}\n\t\n\tstatic class FastScanner {\n\t\tBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st=new StringTokenizer(\"\");\n\t\tString next() {\n\t\t\twhile (!st.hasMoreTokens())\n\t\t\t\ttry {\n\t\t\t\t\tst=new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\t\t\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\tint[] readArray(int n) {\n\t\t\tint[] a=new int[n];\n\t\t\tfor (int i=0; i<n; i++) a[i]=nextInt();\n\t\t\treturn a;\n\t\t}\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t}\n\t\n\tstatic int gcd(int a, int b) {\n\t\treturn a%b == 0 ? b : gcd(b,a%b);\n\t}\n\t\n\tstatic boolean[] sieve(int n) {\n\t\t\n\t\tboolean isPrime[] = new boolean[n+1];\n\t\tfor(int i = 2; i <= n; i++) {\n\t\t\tif(isPrime[i]) continue;\n\t\t\tfor(int j = 2*i; j <= n; j+=i) {\n\t\t\t\tisPrime[j] = true;\n\t\t\t}\n\t\t\n\t\t}\n\t\treturn isPrime;\n\t\t\n\t}\n\t\n//\tFor Input.txt and Output.txt\n\t\n//\tFileInputStream in = new FileInputStream(\"input.txt\");\n//\tFileOutputStream out = new FileOutputStream(\"output.txt\");\n//\tPrintWriter pw = new PrintWriter(out);\n//\tScanner sc = new Scanner(in);\n\t\n// \tsc.nextLine() \n\t\n\n}\n", "lang_cluster": "Java", "tags": ["greedy", "implementation"], "code_uid": "2aed18a263da1c5a46d1e6c389f3fada", "src_uid": "969b24ed98d916184821b2b2f8fd3aac", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class test2\n{\n\tstatic long dp[][];\n\t\n\t static long mod = 1000000007;\n\t static long pow(long a , long b , long c)\n\t {\n\t\t \n\t\t if(b==0)\n\t\t\t return 1;\n\t\t \n\t\t long ans = pow(a,b/2,c);\n\t\t if(b%2 == 0)\n\t\t\t return ans*ans%c;\n\t\t \n\t\t return ans*ans%c*a%c;\n\t }\n\t \n\t static long modInverse(long a , long b)\n\t {\n\t\t return pow(a,b-2,mod);\n\t }\n\t \n\t \n\t static long fact[];\n\t \n\t static long ways(int pos , int space , int arr[] , int n)\n\t {\n\t\t if(space < 0)\n\t\t\t return 0;\n\t\t \n\t\t if(pos == arr.length)\n\t\t {\n\t\t\t if(space == 0)\n\t\t\t\t return 1;\n\t\t\t \n\t\t\t return 0;\n\t\t }\n\t\t \n\t\t if(space < arr[pos])\n\t\t\t return 0;\n\t\t \n\t\t if(dp[pos][space] != -1)\n\t\t\t return dp[pos][space];\n\t\t \n\t\t dp[pos][space] = 0;\n\t\t for(int i = arr[pos] ; i <= n ; i++)\n\t\t {\n\t\t\t if(pos == 0)\n\t\t\t {\n\t\t\t\t if(i > 0)\n\t\t\t\t\t dp[pos][space] += modInverse(fact[i-1],mod)*modInverse(i,mod)%mod*modInverse(n,mod)%mod*(n-i)%mod*ways(pos+1,space-i,arr,n)%mod;\n\t\t\t\t \n\t\t\t\t else\n\t\t\t\t\t dp[pos][space] = ways(pos+1,space,arr,n);\n\t\t\t }\n\t\t\t \n\t\t\t else\n\t\t\t\t dp[pos][space] += modInverse(fact[i],mod)*ways(pos+1,space-i,arr,n);\n\t\t\t \n\t\t\t dp[pos][space] %= mod;\n\t\t }\n\t\t return dp[pos][space];\n\t }\n\tpublic static void main(String []args)\n\t{\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tfact = new long[n+1];\n\t\tfact[0] = 1;\n\t\tfor(long i = 1 ; i <= n ; i++)\n\t\t{\n\t\t\tfact[(int)i] = fact[(int)i-1]*i%mod;\n\t\t}\n\t\t\n\t\tint arr[] = new int[10];\n\t\tfor(int i = 0 ; i <= 9 ;i++)\n\t\t{\n\t\t\tarr[i] = sc.nextInt();\n\t\t}\n\tdp = new long[10][n+1];\n\tfor(int i = 0; i <= 9 ; i++)\n\t{\n\t\tfor(int j = 0 ; j <= n ; j++)\n\t\t{\n\t\tdp[i][j] = -1;\t\n\t\t}\n\t}\n\tlong ans = 0;\n\tfor(int i = 1 ; i <= n ; i++)\n\t{\n\t\tans += fact[i]*ways(0,i,arr,i)%mod;\n\t\tans %= mod;\n\t}\n\t\n\t\n\tans %= mod;\n\tSystem.out.println(ans);\n\t}\n}", "lang_cluster": "Java", "tags": ["dp", "combinatorics"], "code_uid": "964074366d089354f847f17f1681042b", "src_uid": "c1b5169a5c3b1bd4a2f1df1069ee7755", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.FileInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class C_436\n{\n\n\tInputStream is;\n\tPrintWriter out;\n\tint n;\n\t// long a[];\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tlong a;\n\tlong b;\n\tlong f;\n\tlong k;\n\tlong count;\n\n\tvoid solve()\n\t{\n\t\ta = nl();\n\t\tb = nl();\n\t\tf = nl();\n\t\tk = nl();\n\t\tif (check())\n\t\t{\n\t\t\tout.println(count);\n\t\t} else\n\t\t{\n\t\t\tout.println(-1);\n\t\t}\n\t}\n\n\tboolean check()\n\t{\n\t\tboolean flag = true;\n\t\tcount = 0;\n\t\tlong petrol = b;\n\t\tfor (int i = 1; i <= k; i++)\n\t\t{\n\t\t\tif (i == k)\n\t\t\t{\n\t\t\t\tif (i % 2 == 1)\n\t\t\t\t{\n\t\t\t\t\tpetrol = petrol - f;\n\t\t\t\t\tif (petrol < 0)\n\t\t\t\t\t{\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t\tif (petrol < a - f)\n\t\t\t\t\t{\n\t\t\t\t\t\tpetrol = b;\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t\tpetrol -= a - f;\n\t\t\t\t\tif (petrol < 0)\n\t\t\t\t\t{\n\t\t\t\t\t\treturn false;\n\n\t\t\t\t\t}\n\t\t\t\t} else\n\t\t\t\t{\n\t\t\t\t\tpetrol -= a - f;\n\t\t\t\t\tif (petrol < 0)\n\t\t\t\t\t{\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t\tif (petrol < (f))\n\t\t\t\t\t{\n\t\t\t\t\t\tpetrol = b;\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t\tpetrol -= f;\n\t\t\t\t\tif (petrol < 0)\n\t\t\t\t\t{\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else\n\t\t\t{\n\t\t\t\tif (i % 2 == 1)\n\t\t\t\t{\n\n\t\t\t\t\tpetrol = petrol - f;\n\t\t\t\t\t// tr(petrol, \" ++ \", i, count);\n\t\t\t\t\tif (petrol < 0)\n\t\t\t\t\t{\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t\tif (petrol < 2 * (a - f))\n\t\t\t\t\t{\n\t\t\t\t\t\tpetrol = b;\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t\tpetrol -= a - f;\n\t\t\t\t\t// tr(petrol, \" -- \", i, count);\n\t\t\t\t} else\n\t\t\t\t{\n\t\t\t\t\tpetrol -= a - f;\n\t\t\t\t\t// tr(petrol, \" ++ \", i, count);\n\t\t\t\t\tif (petrol < 0)\n\t\t\t\t\t{\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t\tif (petrol < 2 * (f))\n\t\t\t\t\t{\n\t\t\t\t\t\tpetrol = b;\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t\tpetrol -= f;\n\t\t\t\t\t// tr(petrol, \" -- \", i, count);\n\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn true;\n\n\t}\n\n\tvoid run() throws Exception\n\t{\n\t\tString INPUT = \"C:\\\\Users\\\\Admin\\\\Desktop\\\\input.txt\";\n\t\tis = oj ? System.in : new FileInputStream(INPUT);\n\t\tout = new PrintWriter(System.out);\n\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis() - s + \"ms\");\n\t}\n\n\tpublic static void main(String[] args) throws Exception\n\t{\n\t\tnew Thread(null, new Runnable()\n\t\t{\n\t\t\tpublic void run()\n\t\t\t{\n\t\t\t\ttry\n\t\t\t\t{\n\t\t\t\t\tnew C_436().run();\n\t\t\t\t} catch (Exception e)\n\t\t\t\t{\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t}, \"1\", 1 << 26).start();\n\t}\n\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\n\tprivate int readByte()\n\t{\n\t\tif (lenbuf == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (ptrbuf >= lenbuf)\n\t\t{\n\t\t\tptrbuf = 0;\n\t\t\ttry\n\t\t\t{\n\t\t\t\tlenbuf = is.read(inbuf);\n\t\t\t} catch (IOException e)\n\t\t\t{\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (lenbuf <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\n\tprivate boolean isSpaceChar(int c)\n\t{\n\t\treturn !(c >= 33 && c <= 126);\n\t}\n\n\tprivate int skip()\n\t{\n\t\tint b;\n\t\twhile ((b = readByte()) != -1 && isSpaceChar(b))\n\t\t\t;\n\t\treturn b;\n\t}\n\n\tprivate double nd()\n\t{\n\t\treturn Double.parseDouble(ns());\n\t}\n\n\tprivate char nc()\n\t{\n\t\treturn (char) skip();\n\t}\n\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile (!(isSpaceChar(b)))\n\t\t{ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile (p < n && !(isSpaceChar(b)))\n\t\t{\n\t\t\tbuf[p++] = (char) b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tmap[i] = ns(m);\n\t\treturn map;\n\t}\n\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = ni();\n\t\treturn a;\n\t}\n\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-')\n\t\t{\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\n\t\twhile (true)\n\t\t{\n\t\t\tif (b >= '0' && b <= '9')\n\t\t\t{\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t} else\n\t\t\t{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-')\n\t\t{\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\n\t\twhile (true)\n\t\t{\n\t\t\tif (b >= '0' && b <= '9')\n\t\t\t{\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t} else\n\t\t\t{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tprivate void tr(Object... o)\n\t{\n\t\tif (!oj)\n\t\t\tSystem.out.println(Arrays.deepToString(o));\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["math", "greedy", "implementation"], "code_uid": "6ab28d01d88059810304b7b14dd76f7b", "src_uid": "283aff24320c6518e8518d4b045e1eca", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.Scanner;\n\npublic class CoveredPath {\n\n public static void main(String[] args) \n {\n Scanner scanner = new Scanner(System.in);\n int fV = scanner.nextInt();\n int sV = scanner.nextInt();\n int t = scanner.nextInt();\n int d = scanner.nextInt();\n \n System.out.println(Path(fV,sV,t,d));\n \n }\n \n static int Path(int F,int S,int t,int d)\n {\n int Distance = F;\n for (int i = 1; i < t-1; i++) \n {\n Distance += Math.min(F + i*d , S + (t-1)*d - i*d);\n }\n \n Distance += S;\n \n return Distance;\n }\n \n \n \n}\n", "lang_cluster": "Java", "tags": ["math", "greedy", "dp"], "code_uid": "8b761f61178d8aa428b1404b2eda230f", "src_uid": "9246aa2f506fcbcb47ad24793d09f2cf", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class test {\n\n\t\n\tpublic static void main(String[] args) throws IOException {\n\t\t// TODO Auto-generated method stub\n\t\tReader.init(System.in);\n\t\tint n=Reader.nextInt();\n\t\tint m=Reader.nextInt();\n\t\t\n\t\tint humans=n-m;\n\t\tif(m==0) {\n\t\t\tSystem.out.println(1);\n\t\t}\n\t\telse {\n\t\t\tSystem.out.println(Math.min(m, humans));\n\t\t}\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\n\n\n}\n}\n\n\n\n\n\nclass Reader {\n static BufferedReader reader;\n static StringTokenizer tokenizer;\n \n /** call this method to initialize reader for InputStream */\n static void init(InputStream input) {\n reader = new BufferedReader(\n new InputStreamReader(input) );\n tokenizer = new StringTokenizer(\"\");\n }\n \n /** get next word */\n static String next() throws IOException {\n while ( ! tokenizer.hasMoreTokens() ) {\n //TODO add check for eof if necessary\n tokenizer = new StringTokenizer(\n reader.readLine() );\n }\n return tokenizer.nextToken();\n }\n static int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\t\n static double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "greedy"], "code_uid": "df990f54b3b9f38c364a0917032edfe1", "src_uid": "c05d0a9cabe04d8fb48c76d2ce033648", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n\tprivate static class Vipechka {\n\t\tint remains_a;\n\t\tint need_b;\n\t\tint testo_c;\n\t\tint cost_d;\n\n\t\tpublic Vipechka(int remains_a, int need_b, int testo_c, int cost_d) {\n\t\t\tthis.remains_a = remains_a;\n\t\t\tthis.need_b = need_b;\n\t\t\tthis.testo_c = testo_c;\n\t\t\tthis.cost_d = cost_d;\n\t\t}\n\t}\n\n\tpublic static int[][] dp = new int[1001][12];\n\n\tpublic static void main(String[] args) throws NumberFormatException,\n\t\t\tIOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString[] parts = br.readLine().split(\"\\\\s+\");\n\t\tint n = Integer.parseInt(parts[0]);\n\t\tint m = Integer.parseInt(parts[1]);\n\t\tint c = Integer.parseInt(parts[2]);\n\t\tint d = Integer.parseInt(parts[3]);\n\t\tVipechka[] vipArr = new Vipechka[m + 1];\n\t\tvipArr[0] = new Vipechka(0, 0, c, d);\n\t\tfor (int i = 1; i <= m; i++) {\n\t\t\tparts = br.readLine().split(\"\\\\s+\");\n\t\t\tVipechka vip = new Vipechka(Integer.parseInt(parts[0]),\n\t\t\t\t\tInteger.parseInt(parts[1]), Integer.parseInt(parts[2]),\n\t\t\t\t\tInteger.parseInt(parts[3]));\n\t\t\tvipArr[i] = vip;\n\t\t}\n\n\t\t// dpMine(n, vipArr);\n\t\tfor (int testo = 0; testo <= n; testo++) {\n\t\t\tfor (int i = 0; i < vipArr.length; i++) {\n\t\t\t\tint nachinkiEnoughFor = vipArr[i].need_b == 0 ? Integer.MAX_VALUE\n\t\t\t\t\t\t: vipArr[i].remains_a / vipArr[i].need_b;\n\t\t\t\tint testaEnoughFor = testo / vipArr[i].testo_c;\n\t\t\t\tint maxCanBacke = Math.min(nachinkiEnoughFor, testaEnoughFor);\n\t\t\t\tfor (int k = 0; k <= maxCanBacke; k++) {\n\t\t\t\t\tint restTesto = testo - k * vipArr[i].testo_c;\n\t\t\t\t\tif (restTesto < 0)\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tint getMoney = (i - 1 >= 0 ? dp[restTesto][i - 1] : 0) + k\n\t\t\t\t\t\t\t* vipArr[i].cost_d;\n\t\t\t\t\tif (dp[testo][i] < getMoney)\n\t\t\t\t\t\tdp[testo][i] = getMoney;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// int max = Integer.MIN_VALUE;\n\t\t// for (int i = 0; i < vipArr.length; i++) {\n\t\t// int currMoney = dp[n][i];\n\t\t// if (max < currMoney)\n\t\t// max = currMoney;\n\t\t// }\n\t\tSystem.out.println(dp[n][m]);\n\t}\n\n\tprivate static void dpMine(int n, Vipechka[] vipArr) {\n\t\tfor (int testo = 1; testo <= n; testo++) {\n\t\t\tfor (int i = 0; i < vipArr.length; i++) {\n\t\t\t\tint nachinkiEnoughFor = vipArr[i].need_b == 0 ? Integer.MAX_VALUE\n\t\t\t\t\t\t: vipArr[i].remains_a / vipArr[i].need_b;\n\t\t\t\tint testaEnoughFor = testo / vipArr[i].testo_c;\n\t\t\t\tint maxCanBacke = Math.min(nachinkiEnoughFor, testaEnoughFor);\n\t\t\t\tint currMaxMoney = Integer.MIN_VALUE;\n\t\t\t\tfor (int canBake = 0; canBake <= maxCanBacke; canBake++) {\n\t\t\t\t\tint currMoney = canBake * vipArr[i].cost_d;\n\t\t\t\t\tint currMoneyTmp = currMoney;\n\t\t\t\t\tfor (int j = 0; j < i; j++) {\n\t\t\t\t\t\tif (testo - canBake * vipArr[i].testo_c > 0) {\n\t\t\t\t\t\t\tif (currMoney\n\t\t\t\t\t\t\t\t\t+ dp[testo - canBake * vipArr[i].testo_c][j] > currMoneyTmp) {\n\t\t\t\t\t\t\t\tcurrMoneyTmp = currMoney\n\t\t\t\t\t\t\t\t\t\t+ dp[testo - canBake\n\t\t\t\t\t\t\t\t\t\t\t\t* vipArr[i].testo_c][j];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (currMoneyTmp > currMaxMoney)\n\t\t\t\t\t\tcurrMaxMoney = currMoneyTmp;\n\t\t\t\t}\n\t\t\t\tdp[testo][i] = currMaxMoney;\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic static int solve(Vipechka[] vip, int testo, int currIdx) {\n\t\tif (currIdx >= vip.length)\n\t\t\treturn 0;\n\t\tif (currIdx == 0) {\n\t\t\tint nachinkiEnoughFor = vip[currIdx].need_b == 0 ? Integer.MAX_VALUE\n\t\t\t\t\t: vip[currIdx].remains_a / vip[currIdx].need_b;\n\t\t\tint testaEnoughFor = testo / vip[currIdx].testo_c;\n\t\t\tint maxCanBacke = Math.min(nachinkiEnoughFor, testaEnoughFor);\n\t\t\treturn maxCanBacke * vip[currIdx].cost_d;\n\t\t}\n\t\tint max = Integer.MIN_VALUE;\n\t\tfor (int i = 0; i < currIdx; i++) {\n\t\t\tint nachinkiEnoughFor = vip[currIdx].need_b == 0 ? Integer.MAX_VALUE\n\t\t\t\t\t: vip[currIdx].remains_a / vip[currIdx].need_b;\n\t\t\tint testaEnoughFor = testo / vip[currIdx].testo_c;\n\t\t\tint maxCanBacke = Math.min(nachinkiEnoughFor, testaEnoughFor);\n\t\t\tfor (int j = 0; j <= maxCanBacke; j++) {\n\t\t\t\tint currMoney = j * vip[currIdx].cost_d;\n\t\t\t\tint adjustMoney = dp[testo - j * vip[currIdx].testo_c][i];\n\t\t\t\tif (adjustMoney == 0) {\n\t\t\t\t\tadjustMoney = solve(vip, testo - j * vip[currIdx].testo_c,\n\t\t\t\t\t\t\ti);\n\t\t\t\t\tdp[testo - j * vip[currIdx].testo_c][i] = adjustMoney;\n\t\t\t\t}\n\t\t\t\tcurrMoney += adjustMoney;\n\t\t\t\tif (max < currMoney)\n\t\t\t\t\tmax = currMoney;\n\t\t\t}\n\t\t}\n\t\treturn max;\n\t}\n}", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "b684d4e62195adec74def35bdcbd9f1f", "src_uid": "4e166b8b44427b1227e0f811161d3a6f", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package yahia;\nimport java.io.PrintWriter;\nimport java.util.*;public class Main {public static void main (String []args) {Scanner sc =new Scanner (System.in);PrintWriter pw =new PrintWriter(System.out);\nString w =sc.next();char [] x =w.toCharArray();int a =x.length;String j =\"\";\nif (a<=2) System.out.println(w);\nelse if (a%2==1) {\n j=x[a/2]+\"\"+x[a/2+1];\n int i =(a/2-1);int s=a/2+2;\n while (i>=0||s<a) {\n \t j=j+x[i];--i;\n \t if (s<a) {\n \t\t j=j+x[s];++s;\n \t }\n }\n System.out.println(j);\n}\nelse {\n\tj=j+x[a/2-1]+x[a/2];\n\tint i =(a-2)/2 -1;int s =a/2+1;\n\twhile (i>0||s<a) {\n\t\tif (i>=0) {\n\t\t\tj=j+x[i];\n\t\t\t--i;\n\t\t}\n\t\tj=j+x[s];++s;\n\t}\n\tSystem.out.println(j);\n\n}}}\n ", "lang_cluster": "Java", "tags": ["strings", "implementation"], "code_uid": "4ba225b08692d99eea492a65396064a8", "src_uid": "992ae43e66f1808f19c86b1def1f6b41", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import jdk.swing.interop.SwingInterOpUtils;\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\n\npublic class prac1 {\n public static void main(String[] args) throws IOException {\n BufferedReader br =new BufferedReader(new InputStreamReader(System.in));\n int n=Integer.parseInt(br.readLine());\n String a=br.readLine();\n// System.out.println(a);\n if(n==0)\n {\n System.out.println(\"NO\");\n }\n else\n {\n int count=0;\n for(int i=1;i<n;i++)\n {\n// System.out.println(\"iter: \"+(i+1));\n if(a.charAt(i)==a.charAt(i-1))\n continue;\n// System.out.println(\"wrong\");\n if(a.charAt(i)=='F')\n count++;\n else\n count--;\n }\n if(count>0)\n System.out.println(\"YES\");\n else\n System.out.println(\"NO\");\n }\n\n\n\n }\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "d46d8ca6cf5d69bd38d127ffb72a5879", "src_uid": "ab8a2070ea758d118b3c09ee165d9517", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/**\n * \n */\n\n\n // @author Winry Rockbell\n import java.util.Scanner;\n \npublic class HelloWorld {\n\n\t/**\n\t * @param args\n\t */\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\tint n,k,d;\n\tlong mod=1000000007;\n\tScanner in = new Scanner(System.in);\n\tn=in.nextInt();\n\tk=in.nextInt();\n\td=in.nextInt();\n\tlong dp[]=new long[101];\n\tlong dp1[]=new long[101];\n\tdp[0]=1;dp1[0]=1;\n\tdp[1]=1;dp1[1]=1;\n\tfor(int i=1;i<=n;i++)\n\t{dp[i]=0;\n\t\tfor(int j=1;j<d;j++)\n\t\t{\n\t\t\tif(i-j>=0)\n\t\t\t\tdp[i]+=dp[i-j];\n\t\t\tdp[i]=dp[i]%mod;\n\t\t}\n\t}\n\tfor(int i=1;i<=n;i++)\n\t{dp1[i]=0;\n\t\tfor(int j=1;j<=k;j++)\n\t\t{\n\t\t\tif(i-j>=0)\n\t\t\t\tdp1[i]+=dp1[i-j];\n\t\t\tdp1[i]=dp1[i]%mod;\n\t\t}\n\t}\n\tlong ki=dp1[n]-dp[n];\n\tif(ki<0)\n\t\tki=ki+mod;\n\tif(n==0)\n\t\tki=0;\n\tSystem.out.println(\"\"+ki);\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["dp", "implementation", "trees"], "code_uid": "dcb6ceb616c3113ed2ae28bcd4b31507", "src_uid": "894a58c9bba5eba11b843c5c5ca0025d", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/**\n * \n */\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\n/**\n * @author Rachna\n *\n */\npublic class MagicForest {\n\n\t/**\n\t * @param args\n\t * @throws IOException\n\t * @throws NumberFormatException\n\t */\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tint count = 0;\n\n\t\tfor (int i = 1; i <= n; i++) {\n\n\t\t\tfor (int j = i + 1; j <= n; j++) {\n\t\t\t\t\n\t\t\t\tint k = i ^ j;\n\t\t\t\tif (k <= n && i+j > k && k >=j) {\n\t\t\t\t\tcount++;\n }\n\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(count);\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["brute force"], "code_uid": "0cd1a718cd6b7c68da5710bc640bb64a", "src_uid": "838f2e75fdff0f13f002c0dfff0b2e8d", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.lang.reflect.Array;\nimport java.util.*;\nimport java.util.logging.StreamHandler;\n\npublic class Second {\n\tstatic Scanner in; static int next() throws Exception {return in.nextInt();};\n//\tstatic StreamTokenizer in; static int next() throws Exception {in.nextToken(); return (int) in.nval;}\n//\tstatic BufferedReader in;\n\tstatic PrintWriter out;\n\n static long count(long x, long k) {\n long sum = 0, d = 1;\n for (;d <= x;d *= k) sum += x/d;\n return(sum);\n }\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tin = new Scanner(System.in);\n//\t\tin = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));\n//\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\n long n = next(), k = next();\n long min = 0;\n long max = 1000000000;\n\n while (max - min!=1) {\n if (count((max+min)/2,k) >= n) {\n max = (max+min)/2;\n } else min = (max+min)/2;\n }\n\n out.println(max);\n\n out.println();\n\t\tout.close();\n\t}\n}", "lang_cluster": "Java", "tags": ["implementation", "binary search"], "code_uid": "02e817cfe84351bddd2a4ed17cef35ad", "src_uid": "41dfc86d341082dd96e089ac5433dc04", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": " //package Contest553;\n\nimport java.io.PrintWriter;\nimport java.util.Scanner;\n\npublic class mainF {\n public static Scanner enter = new Scanner(System.in);\n public static PrintWriter out = new PrintWriter(System.out);\n public static void main(String[] args) {\n long mod=(long)1e9+7;\n int n=enter.nextInt();\n long s=enter.nextLong();\n int[] arr=new int[n];\n int m=0;\n long CON=n*(n-1)/2;\n CON=bin_pow(CON,mod-2,mod);\n for (int i = 0; i <n ; i++) {\n arr[i]=enter.nextInt();\n m+=arr[i];\n }\n int f_k=0;\n for (int i = 0; i <n-m ; i++) {\n f_k+=arr[i];\n }\n int k=n-m;\n f_k=n-m-f_k;\n /*if(m<n-m){//Если нулей больше чем единиц\n k=m;\n f_k=n-m-f_k;\n m=n-m;\n }*/\n //f_k- кол-во нулей в первой части то есть это начальное состояние причём кол-во нулей меньше кол-ва единиц\n long[][] CM=new long[k+1][k+1];\n for (int i = Math.max(0,k-m); i <CM.length ; i++) {\n CM[i][i]=(1-(long)(i*(m-k+i)+(k-i)*(k-i))*CON);\n if(i<k) CM[i][i+1]=(long)(k-i)*(k-i)*CON;\n if(i>0)CM[i][i-1]=(long)i*(m-k+i)*CON;\n }\n MATRIX_mod(CM,mod);\n CM=bin_pow(CM,s,mod);\n System.out.println((CM[f_k][k]+mod)%mod);\n\n\n\n }\n public static long bin_pow(long a,long b, long mod){//a^b %mod\n long ans=1;\n while(b!=0){\n if((b&1)==1) ans*=a;\n a*=a;\n ans%=mod;\n a%=mod;\n b>>=1;\n }\n return ans;\n }\n\n public static long[][] bin_pow(long[][] a,long b, long mod){//a^b %mod\n long[][] ans=new long[a.length][a.length];\n for (int i = 0; i <ans.length ; i++) ans[i][i]=1;\n while(b!=0){\n if((b&1)==1) ans=MATRIX_mult(ans,a);\n a=MATRIX_mult(a,a);\n MATRIX_mod(ans,mod);\n MATRIX_mod(a,mod);\n b>>=1;\n }\n return ans;\n }\n public static long[][] MATRIX_mult(long[][] a, long[][] b) { //b не меняем a=a*b;\n long[][] c=new long[a.length][a.length];\n for (int i = 0; i <a.length ; i++) {\n for (int j = 0; j <a.length ; j++) {\n for (int k = 0; k <a.length ; k++) {\n c[i][j]+=a[i][k]*b[k][j];\n c[i][j]%=(long)(1e9+7);\n }\n }\n }\n return c;\n }\n public static void MATRIX_mod(long[][] a, long mod){\n for (int i = 0; i <a.length ; i++) {\n for (int j = 0; j <a.length ; j++) {\n a[i][j]%=mod;\n }\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["probabilities", "matrices", "dp", "combinatorics"], "code_uid": "95afc907a60bd817ed116879add4388f", "src_uid": "77f28d155a632ceaabd9f5a9d846461a", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*; import java.lang.*; import java.io.*;\npublic class Metro {\n\n public static void main(String args[]){\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n int c = sc.nextInt(); int diff =0;\n long sum = 0;\n sum += c*2;\n int min = Math.min(a,b);\n sum +=min*2+1;\nif((a-b)==0)\nsum -=1;\n System.out.println(sum);\n }\n}\n", "lang_cluster": "Java", "tags": ["greedy"], "code_uid": "49ffb8ac411ad3323df08cdd253779af", "src_uid": "609f131325c13213aedcf8d55fc3ed77", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\npublic class c {\npublic static void main(String[] args)\n{\n Scanner input = new Scanner(System.in);\n int n = input.nextInt(), a = input.nextInt()-1, b = input.nextInt()-1, k = input.nextInt();\n int[] dp = new int[n];\n dp[a] = 1;\n for(int i = 0; i<k; i++)\n {\n int[] csum = csum(dp);\n //System.out.println(Arrays.toString(dp));\n int[] next = new int[n];\n for(int j = 0; j<n; j++)\n {\n if(j == b) continue;\n int min = -1, max = -1;\n if(j < b)\n {\n min = 0;\n max = (j+b-1)/2;\n }\n else\n {\n max = n-1;\n min = (j+b)/2+1;\n }\n //int maxDist = Math.abs(b - j) - 1;\n //int min = Math.max(0, j - maxDist);\n //int max = Math.min(n-1, j + maxDist);\n //System.out.println(j+\" \"+min+\" \"+max+\" \"+query(csum, min, max)+\" \"+dp[j]);\n int nn = query(csum, min, max) - dp[j];\n if(nn < 0) nn += mod;\n next[j] = nn;\n }\n dp = next;\n }\n //System.out.println(Arrays.toString(dp));\n System.out.println(csum(dp)[n-1]);\n}\nstatic int[] csum(int[] a)\n{\n int n = a.length;\n int[] res = new int[n];\n res[0] = a[0];\n for(int i = 1; i<n; i++) res[i] = (a[i] + res[i-1])%mod;\n return res;\n}\nstatic int query(int[] csum, int a, int b)\n{\n int res = csum[b];\n if(a > 0) res -= csum[a-1];\n if(res < 0) res += mod;\n return res;\n}\nstatic int mod = 1000000007;\n}\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics"], "code_uid": "ecdeaf94baf9e81f03572f434f1ac003", "src_uid": "142b06ed43b3473513995de995e19fc3", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.*;\n\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int m = sc.nextInt();\n int cnt = 0;\n for(int i=0; i<=1000; ++i) {\n for(int j=0; j<=1000; ++j) {\n if(i*i+j==n&&i+j*j==m) cnt++;\n }\n }\n System.out.println(cnt);\n }\n}", "lang_cluster": "Java", "tags": ["brute force"], "code_uid": "c324166109db8706687ed2cd19fc0af3", "src_uid": "03caf4ddf07c1783e42e9f9085cc6efd", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n \n \n \n \npublic class Main {\n\t int \tgetint(BufferedReader sc) throws java.lang.Exception\n\t\t\t{\n\t\t//\t String ss=sc.readLine();\n\t\t \tint a= Integer.parseInt(sc.readLine());\n\t\t \treturn a;\n\t\t\t}\n\t\t ArrayList<Integer> getlistint(BufferedReader sc) throws java.lang.Exception\n\t\t {\n\t\t\t ArrayList<Integer> res=new ArrayList<>();\n\t\t\t \n\t\t\t String s=sc.readLine();\n\t\t\t String[] ss=s.split(\" \");\n\t\t\t\n\t\t\t for(int i=0;i<ss.length;i++)\n\t\t\t {\n\t\t\t\t// String ss=sc.readLine();\n\t\t\t \tint a=Integer.valueOf(ss[i]);\n\t\t\t \tres.add(a);\n\t\t\t }\n\t\t \n\t\t\t return res;\n\t\t }\n\t\t ArrayList<Float> getlistfl(BufferedReader sc) throws java.lang.Exception\n\t\t {\n\t\t\t ArrayList<Float> res=new ArrayList<>();\n\t\t\t \n\t\t\t String s=sc.readLine();\n\t\t\t String[] ss=s.split(\" \");\n\t\t\t\n\t\t\t for(int i=0;i<ss.length;i++)\n\t\t\t {\n\t\t\t\t// String ss=sc.readLine();\n\t\t\t \tfloat a=Float.valueOf(ss[i]);\n\t\t\t \tres.add(a);\n\t\t\t }\n\t\t \n\t\t\t return res;\n\t\t }\n\t\t ArrayList<Long> getlist(BufferedReader sc) throws java.lang.Exception\n\t\t {\n\t\t\t ArrayList<Long> res=new ArrayList<>();\n\t\t\t \n\t\t\t String s=sc.readLine();\n\t\t\t String[] ss=s.split(\" \");\n\t\t\t\n\t\t\t for(int i=0;i<ss.length;i++)\n\t\t\t {\n\t\t\t\t// String ss=sc.readLine();\n\t\t\t \tlong a=Long.valueOf(ss[i]);\n\t\t\t \tres.add(a);\n\t\t\t }\n\t\t \n\t\t\t return res;\n\t\t }\n\t\t ArrayList<Character> getlistchar(BufferedReader sc) throws java.lang.Exception\n\t\t {\n\t\t\t ArrayList<Character> res=new ArrayList<>();\n\t\t\t \n\t\t\t String s=sc.readLine();\n\t\t\t// String[] ss=s.split(\" \");\n\t\t\t\n\t\t\t for(int i=0;i<s.length();i++)\n\t\t\t {\n\t\t\t\t// String ss=sc.readLine();\n\t\t\t \t//char[] a=ss[i].toCharArray();\n\t\t\t \tres.add(s.charAt(i));\n\t\t\t }\n\t\t \n\t\t\t return res;\n\t\t }\n\n\t\t static int n;\n\t\t static int b[];\n\t\t static StringBuffer ans = new StringBuffer(\"\");\n\t\t static BufferedReader bf;\n\t\t static class pair{\n\t\t int a,b;\n\t\t pair(int a,int b){\n\t\t this.a =a;\n\t\t this.b =b;\n\t\t }\n\t\t }private static StringBuilder result = new StringBuilder();\n\n\t\t \n\t\t public static void main(String[] args) throws Exception \n\t\t {\n\t\t \tMain pra=new Main();\n\t\t \t//Scanner sc = new Scanner(System.in);\n\t\t // int tc;\n\t\t \tBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\t\t //\tScanner in=new Scanner(System.in);\n\t\t\t // long t=Long.parseLong(br.readLine());\n\t\t \tint max=Integer.MAX_VALUE;\n\t\t \tint res=0;\n\t\t\t int t=1;\n\t\t\t while(t-->0){\n\t\t\t //\tint num=Integer.parseInt(br.readLine());\n\t\t\t \tArrayList<Integer> p=pra.getlistint(br);\n\t\t\t \tArrayList<Integer> p1=pra.getlistint(br);\n\t\t\t \t\n\t\t\t \tint sum=0;\n\t\t\t \t\n\t\t\t \tfor(int i=0;i<p1.size();i++)\n\t\t\t \t{\n\t\t\t \t\tsum+=p1.get(i);\n\t\t\t \t}\n\t\t\t \tint res1=p.get(1)-sum;\n\t\t\t \tif(sum+10*(p.get(0)-1)>p.get(1))\n\t\t\t \t{\n\t\t\t \t\tSystem.out.println(\"-1\");\n\t\t\t \t}else\n\t\t\t \t{\n\t\t\t \t\tSystem.out.println(res1/5);\n\t\t\t \t}\n\t\t\t \t\n\t\t\t \n\t\t//\t System.out.println(ress);\n\t\t\t }\n\t\t \n\t\t }\n \n}", "lang_cluster": "Java", "tags": ["greedy", "implementation"], "code_uid": "eff91b1e06c6cbb4ee80403f31bede73", "src_uid": "b16f5f5c4eeed2a3700506003e8ea8ea", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.IOException;\nimport java.io.OutputStreamWriter;\nimport java.io.BufferedWriter;\nimport java.util.InputMismatchException;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.NoSuchElementException;\nimport java.io.Writer;\nimport java.math.BigInteger;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Alex\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tOutputWriter out = new OutputWriter(outputStream);\n\t\tTaskB solver = new TaskB();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskB {\n public void solve(int testNumber, InputReader in, OutputWriter out){\n\t int velocityprincess = in.ri(), velocitydragon = in.ri(), thoursheadstart = in.ri(), fhoursstraightening = in.ri(), cmilestotravel = in.ri();\n\t double t = -(1.0* thoursheadstart * velocitydragon) / (velocityprincess - velocitydragon);\n\t double distanceprincess = velocityprincess * t;\n\t if (distanceprincess >= cmilestotravel || velocityprincess >= velocitydragon){\n\t\t out.print(0);\n\t\t return;\n\t }\n\t for(int i = 0; i < 10000000; i++) {\n\t\t t += (-2 * distanceprincess - velocitydragon * fhoursstraightening) / (velocityprincess - velocitydragon);\n\t\t distanceprincess = t * velocityprincess;\n\t\t if(distanceprincess >= cmilestotravel){\n\t\t\t out.print(i + 1);\n\t\t\t return;\n\t\t }\n\t }\n }\n}\n\nclass InputReader {\n\tprivate InputStream stream;\n\tprivate byte[] buf = new byte[1024];\n\tprivate int curChar;\n\tprivate int numChars;\n\tprivate SpaceCharFilter filter;\n\n\tpublic InputReader(InputStream stream) {\n\t\tthis.stream = stream;\n\t}\n\n\tpublic int read() {\n\t\tif (numChars == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (curChar >= numChars) {\n\t\t\tcurChar = 0;\n\t\t\ttry {\n\t\t\t\tnumChars = stream.read(buf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (numChars <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buf[curChar++];\n\t}\n\tpublic int ri(){\n\t\treturn readInt();\n\t}\n\n\tpublic int readInt() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tint res = 0;\n\t\tdo {\n\t\t\tif (c < '0' || c > '9')\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n\tpublic boolean isSpaceChar(int c) {\n\t\tif (filter != null)\n\t\t\treturn filter.isSpaceChar(c);\n\t\treturn isWhitespace(c);\n\t}\n\n\tpublic static boolean isWhitespace(int c) {\n\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t}\n\tpublic interface SpaceCharFilter {\n\t\tpublic boolean isSpaceChar(int ch);\n\t}\n}\n\nclass OutputWriter {\n\tprivate final PrintWriter writer;\n\n\tpublic OutputWriter(OutputStream outputStream) {\n\t\twriter = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n\t}\n\tpublic void close() {\n\t\twriter.close();\n\t}\n\tpublic void print(int i) {\n\t\twriter.print(i);\n\t}\n}\n\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "61775b7c84eb5b517f8058a0c8b19e8d", "src_uid": "c9c03666278acec35f0e273691fe0fff", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedOutputStream;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.*;\n\n/**\n * Created by vlad on 22.03.16.\n */\npublic class problemB {\n\n public void solution(Scanner in, PrintWriter out) {\n int n = in.nextInt();\n int k = in.nextInt();\n if (n == 0) {\n out.println(0);\n return;\n }\n int i = 0;\n int ans = 0;\n while (n > 0 && k > 0) {\n if (n % 10 != 0) {\n ans++;\n } else {\n k--;\n }\n i++;\n n /= 10;\n }\n\n if (k != 0) {\n out.println(i - 1);\n } else {\n out.println(ans);\n }\n }\n\n public static void main(String args[]) {\n Scanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));\n PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));\n\n new problemB().solution(in, out);\n\n in.close();\n out.close();\n }\n\n}", "lang_cluster": "Java", "tags": ["brute force", "greedy"], "code_uid": "8100ecbe371bb6f9946122f52e0acb20", "src_uid": "7a8890417aa48c2b93b559ca118853f9", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.BigInteger;\n\npublic class ProbE implements Runnable{\n\n\tprivate static InputStream stream;\n\tprivate static byte[] buf = new byte[1024];\n\tprivate static int curChar;\n\tprivate static int numChars;\n\tprivate static SpaceCharFilter filter;\n\tprivate static PrintWriter pw;\n\tprivate static int mod = (int)1e9+7;\n\t\n\tprivate static void soln(){\n\t\tString s = nextLine();\n\t\tHashSet<String> hs = new HashSet<String>();\n\t\ths.add(s);\n\t\tString temp = s;\n\t\tfor\t(int i=0;i<s.length();i++){\n//\t\t\tSystem.out.println(temp);\n\t\t\tStringBuilder s1 = new StringBuilder(\"\");\n\t\t\ts1.append(temp.charAt(temp.length()-1));\n//\t\t\tSystem.out.println(\"asd \"+s1);\n\t\t\ts1.append(temp.substring(0,temp.length()-1));\n//\t\t\tSystem.out.println(s1);\n\t\t\ttemp = s1.toString();\n\t\t\ths.add(temp);\n\t\t}\n//\t\tpw.println(hs);\n\t\tpw.println(hs.size());\n\t\t\n\t}\n\n\tpublic void run (){\n\t\tsoln();\n\t}\n\n\tpublic static void main(String[] args) throws InterruptedException{\n\t\tInputReader(System.in);\n\t\tpw = new PrintWriter(System.out);\n\t\tThread t = new Thread(null, new ProbE(), \"ProbD\", 1<<28);\n\t\tt.start();\n\t\tt.join();\n\t\tpw.close();\n\t}\n\n\n\t// To Get Input\n\t// Some Buffer Methods\n\n\tpublic static void InputReader(InputStream stream1) {\n\t\tstream = stream1;\n\t}\n\n\tprivate static boolean isWhitespace(int c) {\n\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t}\n\n\tprivate static boolean isEndOfLine(int c) {\n\t\treturn c == '\\n' || c == '\\r' || c == -1;\n\t}\n\n\tprivate static int read() {\n\t\tif (numChars == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (curChar >= numChars) {\n\t\t\tcurChar = 0;\n\t\t\ttry {\n\t\t\t\tnumChars = stream.read(buf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (numChars <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buf[curChar++];\n\t}\n\n\tprivate static int nextInt() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tint res = 0;\n\t\tdo {\n\t\t\tif (c < '0' || c > '9')\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n \n\tprivate static long nextLong() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tlong res = 0;\n\t\tdo {\n\t\t\tif (c < '0' || c > '9')\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n \n\tprivate static String nextToken() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tStringBuilder res = new StringBuilder();\n\t\tdo {\n\t\t\tres.appendCodePoint(c);\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res.toString();\n\t}\n \n\tprivate static String nextLine() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tStringBuilder res = new StringBuilder();\n\t\tdo {\n\t\t\tres.appendCodePoint(c);\n\t\t\tc = read();\n\t\t} while (!isEndOfLine(c));\n\t\treturn res.toString();\n\t}\n\n\tprivate static int[] nextIntArray(int n) {\n\t\tint[] arr = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tarr[i] = nextInt();\n\t\t}\n\t\treturn arr;\n\t}\n\t \n\tprivate static long[] nextLongArray(int n) {\n\t\tlong[] arr = new long[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tarr[i] = nextLong();\n\t\t}\n\t\treturn arr;\n\t}\n\n\tprivate static void pArray(int[] arr){\n\t\tfor (int i=0; i<arr.length; i++) {\n\t\t\tSystem.out.print(arr[i] + \" \");\n\t\t}\n\t\tSystem.out.println();\n\t\treturn;\n\t}\n\n\tprivate static void pArray(long[] arr){\n\t\tfor (int i=0; i<arr.length; i++) {\n\t\t\tSystem.out.print(arr[i] + \" \");\n\t\t}\n\t\tSystem.out.println();\n\t\treturn;\t\t\n\t}\n\n\tprivate static boolean isSpaceChar(int c) {\n\t\tif (filter != null)\n\t\t\treturn filter.isSpaceChar(c);\n\t\treturn isWhitespace(c);\n\t}\n \n\tprivate interface SpaceCharFilter {\n\t\tpublic boolean isSpaceChar(int ch);\n\t}\n\n}", "lang_cluster": "Java", "tags": ["strings", "implementation"], "code_uid": "e846b3eac52a6e2198c30f88a9e5a31a", "src_uid": "8909ac99ed4ab2ee4d681ec864c7831e", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "\nimport java.util.Scanner;\n\npublic class Main{\n\n\tpublic static void main(String[] args) \n\t{\n\t\tScanner scan = new Scanner(System.in);\n\t\tlong n = scan.nextInt(), m = scan.nextInt();\n\t\tlong x = power((power(2,m,1000000007))-1, n, 1000000007);\n\t\tSystem.out.println(x);\n\t}\n\tstatic long power(long x, long y, long p) \n { \n // Initialize result \n long res = 1; \n \n // Update x if it is more \n // than or equal to p \n x = x % p; \n \n if (x == 0) return 0; // In case x is divisible by p; \n \n while (y > 0) \n { \n // If y is odd, multiply x \n // with result \n if((y & 1)==1) \n res = (res * x) % p; \n \n // y must be even now \n // y = y / 2 \n y = y >> 1; \n x = (x * x) % p; \n } \n return res; \n } \n \n\n}\n", "lang_cluster": "Java", "tags": ["math", "combinatorics"], "code_uid": "0949630df34196dd1811b6ae3ca9403b", "src_uid": "71029e5bf085b0f5f39d1835eb801891", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n\n String[] line = scan.nextLine().split(\" \");\n int n1 = Integer.parseInt(line[0]);\n int n2 = Integer.parseInt(line[1]);\n int k1 = Integer.parseInt(line[2]);\n int k2 = Integer.parseInt(line[3]);\n\n boolean firstPlayerTurn = true;\n\n while (true) {\n if (firstPlayerTurn) {\n if (n1 == 0) {\n System.out.println(\"Second\");\n return;\n } else {\n n1--;\n }\n } else {\n if (n2 == 0) {\n System.out.println(\"First\");\n return;\n } else {\n n2--;\n }\n }\n\n firstPlayerTurn = !firstPlayerTurn;\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "constructive algorithms"], "code_uid": "707dd5b6dd22a7a93bdc4d754cc4ad0d", "src_uid": "aed24ebab3ed9fd1741eea8e4200f86b", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.util.InputMismatchException;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.Reader;\nimport java.io.Writer;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Niyaz Nigmatullin\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tFastScanner in = new FastScanner(inputStream);\n\t\tFastPrinter out = new FastPrinter(outputStream);\n\t\tTaskA solver = new TaskA();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskA {\n\n final int MOD = 1000000007;\n\n public void solve(int testNumber, FastScanner in, FastPrinter out) {\n char[] c = in.next().toCharArray();\n int n = c.length;\n long ans = 0;\n long t = 1;\n for (int i = 0; i + 1 < n; i++) t = t * 2 % MOD;\n for (int i = 0; i < n; i++) {\n if (c[i] == '0') continue;\n long cur = t;\n for (int j = i + 1; j < n; j++) cur = cur * 2 % MOD;\n ans = (ans + cur) % MOD;\n }\n out.println(ans);\n }\n}\n\nclass FastScanner extends BufferedReader {\n\n public FastScanner(InputStream is) {\n super(new InputStreamReader(is));\n }\n\n public int read() {\n try {\n int ret = super.read();\n// if (isEOF && ret < 0) {\n// throw new InputMismatchException();\n// }\n// isEOF = ret == -1;\n return ret;\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n }\n\n public String next() {\n StringBuilder sb = new StringBuilder();\n int c = read();\n while (isWhiteSpace(c)) {\n c = read();\n }\n if (c < 0) {\n return null;\n }\n while (c >= 0 && !isWhiteSpace(c)) {\n sb.appendCodePoint(c);\n c = read();\n }\n return sb.toString();\n }\n\n static boolean isWhiteSpace(int c) {\n return c >= 0 && c <= 32;\n }\n\n public String readLine() {\n try {\n return super.readLine();\n } catch (IOException e) {\n return null;\n }\n }\n\n }\n\nclass FastPrinter extends PrintWriter {\n\n public FastPrinter(OutputStream out) {\n super(out);\n }\n\n public FastPrinter(Writer out) {\n super(out);\n }\n\n\n}\n\n", "lang_cluster": "Java", "tags": ["math", "combinatorics"], "code_uid": "4ac1d478bbdff8e2f280ce8cbf6b81f9", "src_uid": "89b51a31e00424edd1385f2120028b9d", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.*;\nimport java.io.*;\n\npublic class FriendsandPresents {\n\n\tstatic long cnt1;\n\tstatic long cnt2;\n\tstatic long x;\n\tstatic long y;\n\t\n\tpublic static void main(String[] args) throws IOException, FileNotFoundException {\n\t\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n\t\t//BufferedReader in = new BufferedReader(new FileReader(\"FriendsandPresents\"));\n\n\t\tStringTokenizer st = new StringTokenizer(in.readLine());\n\t\tcnt1 = Integer.parseInt(st.nextToken());\n\t\tcnt2 = Integer.parseInt(st.nextToken());\n\t\tx = Integer.parseInt(st.nextToken());\n\t\ty = Integer.parseInt(st.nextToken());\n\t\t\n\t\tlong min = 1;\n\t\tlong max = (long)(1e10);\n\t\twhile (min < max) {\n\t\t\tlong middle = (min +max)/2;\n\t\t\tif (check(middle)) {\n\t\t\t\tmax = middle;\t\n\t\t\t}\n\t\t\telse min = middle+1;\n\t\t}\n\t\t\n\t\tSystem.out.println(min);\n\t\t\n\t}\n\t\n\tpublic static boolean check(long num) {\n\t\tlong divnone = num - (num/x + num/y - num/(x*y));\n\t\tlong divy = num/y - num/(x*y);\n\t\tlong divx = num/x - num/(x*y);\n\t\tlong c1_left = cnt1 - divy;\n\t\tif (c1_left<0) c1_left=0;\n\t\tlong c2_left = cnt2 - divx;\n\t\tif (c2_left<0) c2_left=0;\n\t\treturn c2_left + c1_left <= divnone;\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "binary search"], "code_uid": "92bda087c7dea12c7c8fca2b61f1f498", "src_uid": "ff3c39b759a049580a6e96c66c904fdc", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "\nimport java.util.Scanner;\n\n\n\npublic class DeclinedFinalist {\n\n\tpublic static void main(String[] args) {\n\t\t/*\n\t\t * first convert input string to integer value\n\t\t * for this problem is n array lenght and array itself\n\t\t */\n\t\tScanner sc = new Scanner(System.in);\n\t\tString str1 = sc.nextLine();\n\t\tString str2 = sc.nextLine();\n\t\tsc.close();\n\t\t\n\t\t/*\n\t\t * first argument evaluation\n\t\t */\n\t\tint K = 0;\n\t\ttry {\n\t\t\tK = Integer.valueOf(str1);\n\t\t} catch (Exception e) {\n\t\t\tSystem.err.println(\"Not valid input!\");\n\t\t}\n\t\t\n\t\tif((K < 1) | (K > 25)) {\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tint[] arr = stringTointArray(str2, 1, 1000000);\n\t\t\n\t\t/*\n\t\t * actual algorithm (after filtering data)\n\t\t */\n\t\t\n\t\tint max_finalist = 25;\n\t\t\n\t\tfor (int i = 0; i < (arr.length); i++) {\n\t\t\tif (arr[i] == 1000000) {\n\t\t\t\tSystem.out.println((1000000 - 25));\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif(arr[i] > max_finalist) {\n\t\t\t\tmax_finalist = arr[i];\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println((max_finalist - 25));\n\t\t\n\t}\n\t\n\t/**\n\t * Method convert string to integer array in range min to max\n\t * @param in\tinput string\n\t * @param min\tminimal integer value of array element\n\t * @param max\tmaximal integer value of array element\n\t * @return\t\tarray of integer created from string\n\t */\n\tprivate static int[] stringTointArray(String in, int min, int max) {\n\t\tString[] str_arr = in.split(\" \");\n\t\tint[] out = new int[str_arr.length];\n\t\t\n\t\ttry {\n\t\t\tfor (int i = 0; i < out.length; i++) {\n\t\t\t\tout[i] = Integer.valueOf(str_arr[i]);\n\t\t\t\tif ((out[i] < min) | (out[i] > max)) {\n\t\t\t\t\tSystem.err.println(\"Input data out of range!\");\n\t\t\t\t\treturn null;\n\t\t\t\t}\n\t\t\t}\n\t\t} catch (Exception e) {\n\t\t\tSystem.err.println(\"Wrong input data!\");\n\t\t\treturn null;\n\t\t}\n\t\t\n\t\treturn out;\n\t}\n\t\n\t\n}\n", "lang_cluster": "Java", "tags": ["greedy", "implementation"], "code_uid": "94a8bd18a1ffe0d6565aecd66e8493d0", "src_uid": "ef657588b4f2fe8b2ff5f8edc0ab8afd", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.lang.*;\nimport java.io.*;\n \npublic class Main\n{\n\t//Fast IO class\n static class FastReader \n { \n BufferedReader br; \n StringTokenizer st; \n public FastReader() \n { \n \tboolean env=System.getProperty(\"ONLINE_JUDGE\") != null;\n \tif(!env) {\n \t\ttry {\n\t\t\t\t\tbr=new BufferedReader(new FileReader(\"src\\\\input.txt\"));\n\t\t\t\t} catch (FileNotFoundException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n \t}\n \telse {\n \t\tbr = new BufferedReader(new\n InputStreamReader(System.in)); \n \t}\n } \n String next() \n { \n while (st == null || !st.hasMoreElements()) \n { \n try\n { \n st = new StringTokenizer(br.readLine()); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n } \n return st.nextToken(); \n } \n int nextInt() \n { \n return Integer.parseInt(next()); \n } \n long nextLong() \n { \n return Long.parseLong(next()); \n } \n double nextDouble() \n { \n return Double.parseDouble(next()); \n } \n String nextLine() \n { \n String str = \"\"; \n try\n { \n str = br.readLine(); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n return str; \n } \n } \n static long MOD=1000000000+7;\n //Euclidean Algorithm\n static long gcd(long A,long B){\n if(B==0) return A;\n return gcd(B,A%B);\n }\n //Modular Exponentiation\n static long fastExpo(long x,long n){\n if(n==0) return 1;\n if((n&1)==0) return fastExpo((x*x)%MOD,n/2)%MOD;\n return ((x%MOD)*fastExpo((x*x)%MOD,(n-1)/2))%MOD;\n }\n //Prime Number Algorithm\n static boolean isPrime(long n){\n if(n<=1) return false;\n if(n<=3) return true;\n if(n%2==0 || n%3==0) return false;\n for(int i=5;i*i<=n;i+=6)\n if(n%i==0 || n%(i+2)==0) return false;\n return true;\n }\n //Sieve of eratosthenes\n static int[] findPrimes(int n){\n boolean isPrime[]=new boolean[n+1];\n ArrayList<Integer> a=new ArrayList<>();\n int result[];\n Arrays.fill(isPrime,true);\n isPrime[0]=false;\n isPrime[1]=false;\n for(int i=2;i*i<=n;++i)\n if(isPrime[i]==true)\n for(int j=i*i;j<=n;j+=i) isPrime[j]=false;\n for(int i=0;i<=n;i++) if(isPrime[i]==true) a.add(i);\n result=new int[a.size()];\n for(int i=0;i<a.size();i++) result[i]=a.get(i);\n return result;\n } \n // Pair\n static class pair{\n \tdouble x,y;\n \tpair(double a,double b){\n \t\tthis.x=a;\n \t\tthis.y=b;\n \t}\n \tpublic boolean equals(Object obj) {\n \t\tif(obj == null || obj.getClass()!= this.getClass()) \n return false;\n pair p = (pair) obj;\n return (this.x==p.x && this.y==p.y);\n }\n \tpublic int hashCode() {\n return Objects.hash(x, y);\n }\n }\n //Main function(The main code starts from here)\n public static void main (String[] args) throws java.lang.Exception\n {\n FastReader sc=new FastReader();\n \tint test=1;\n while(test-->0) {\n \tlong n=sc.nextLong();\n \tArrayList<Long> a=new ArrayList<>();\n \tfor(long i=2;i*i<=n;i++) {\n \t\tif(n%i==0) {\n \t\t\tif(i*i==n) a.add(i);\n \t\t\telse {\n \t\t\t\ta.add(i);\n \t\t\t\ta.add(n/i);\n \t\t\t}\n \t\t}\n \t}\n \tlong ans=0;\n \ta.add(n);\n \tfor(Long x: a) ans=gcd(ans,x);\n \tSystem.out.println(ans);\n }\n }\n}", "lang_cluster": "Java", "tags": ["number theory"], "code_uid": "e27f0d67b4d3bbc3661f2dab4972435f", "src_uid": "f553e89e267c223fd5acf0dd2bc1706b", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\n\t\tString line = scanner.nextLine();\n\n\t\tBigInteger n = new BigInteger(line);\n\t\tBigInteger b2 = new BigInteger(\"2\");\n\t\t\n\t\tBigInteger soma = n.multiply(n).add(n).divide(b2).mod(b2);\n\t\t\n\t\tscanner.close();\n\t\t\n\t\tSystem.out.println(soma.intValue());\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "20518e592f2b2ca7fe3a5087aee739be", "src_uid": "fa163c5b619d3892e33e1fb9c22043a9", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.awt.geom.*;\nimport java.io.*;\nimport java.math.*;\nimport java.util.*;\nimport java.util.regex.*;\nimport static java.lang.Math.*;\npublic class A {\n\n public A() throws Exception {\n int k = in.nextInt();\n int b = in.nextInt();\n int n = in.nextInt();\n int t = in.nextInt();\n\n long cur = 1;\n for (int i=0; i<n; i++) {\n cur = cur*k+b;\n if (cur>t) {\n System.out.println(n-i); \n break;\n }\n }\n if (cur<=t) {\n System.out.println(0); \n }\n }\n\n Scanner in = new Scanner(System.in);\n public static void main(String[] args) throws Exception { // {{{\n new A();\n } // }}}\n public static void debug(Object... arr) { // {{{\n System.err.println(Arrays.deepToString(arr));\n } // }}}\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "e46cb8aca905b29c2a80d13e3d1db9d0", "src_uid": "e2357a1f54757bce77dce625772e4f18", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n \npublic class Main {\n\tpublic static void main(String args[]) {new Main().work();}\n\t\n\tScanner in = new Scanner(System.in);\n\tPrintWriter out = new PrintWriter(System.out);\n\tvoid work() {\t\t\n\t\tint n=in.nextInt();\n\t\tString str=in.next();\n\t\tlong[][] dp=new long[n][n];\n\t\tout.println(dfs(str,0,n-1,dp));\n\t\tout.flush();\n\t}\n\t\n\tlong dfs(String str,int s,int e,long[][] dp){\n\t if(s>e) return 0;\n\t if(dp[s][e]>0) return dp[s][e];\n\t dp[s][e]=1+dfs(str,s+1,e,dp);\n for(int i=s+1;i<=e;i++){\n if(str.charAt(i)==str.charAt(s)){\n dp[s][e]=Math.min(dfs(str,s+1,i-1,dp)+dfs(str,i,e,dp),dp[s][e]);\n }\n }\t \n return dp[s][e];\n\t}\n}", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "9f36dc29c2b6ccfdbfdfae7ae01c0cee", "src_uid": "516a89f4d1ae867fc1151becd92471e6", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.time.Year;\nimport java.util.Scanner;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author programajor\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scanner in = new Scanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskB solver = new TaskB();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskB {\n public void solve(int testNumber, Scanner in, PrintWriter out) {\n long y = in.nextLong();\n double count = 0;\n boolean isYearLeap = Year.isLeap(y);\n long next = y + 1;\n while (true) {\n boolean isCurrLeap = Year.isLeap(next);\n if (isCurrLeap) {\n count += 2;\n } else {\n count += 1;\n }\n next++;\n if (count % 7 == 0 && isCurrLeap == isYearLeap) {\n break;\n }\n }\n out.print(next - 1);\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "d261e147447e28b227f4c4922a32217b", "src_uid": "565bbd09f79eb7bfe2f2da46647af0f2", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.PriorityQueue;\n\npublic class A {\n\tpublic static void main(String args[])throws Exception {\n\t\tBufferedReader input = new BufferedReader(\n\t\t\t\tnew InputStreamReader(System.in));\n\t\t\n\t\tString[] tokens = input.readLine().split(\" \");\n\t\tint n = Integer.parseInt(tokens[0]);\n\n\t\ttokens = input.readLine().split(\" \");\n\t\tint orig = Integer.parseInt(tokens[0]);\n\t\tPriorityQueue<Integer> q = new PriorityQueue<Integer>(1,new A.reverseCompare());\n\t\t\n\t\tint bribes = 0;\n\t\tfor(int i=1;i<n;i++)\n\t\t\tq.add(Integer.parseInt(tokens[i]));\n\n\t\twhile(true) {\n\t\t\tint x = q.poll();\n\t\t\t\n\t\t\tif(x>=orig) {\n\t\t\t\tq.add(x-1);\n\t\t\t\torig++;\n\t\t\t}\n\t\t\telse\n\t\t\t\tbreak;\n\t\t\t\n\t\t\tbribes++;\n\t\t}\n\t\tSystem.out.println(bribes);\n\t}\n\t\n\tpublic static class reverseCompare implements Comparator<Integer>{\n\n\t\t@Override\n\t\tpublic int compare(Integer arg0, Integer arg1) {\n\t\t\tif(arg0 > arg1)\n\t\t\t\treturn -1;\n\t\t\tif(arg0 < arg1)\n\t\t\t\treturn 1;\n\t\t\treturn 0;\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["greedy", "implementation"], "code_uid": "58197011add8a3eae5f6d8d5c098d759", "src_uid": "aa8fabf7c817dfd3d585b96a07bb7f58", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.math.*;\nimport java.util.*;\n\npublic class Main {\n \n static final double eps = 1e-8;\n static int mod = 1000 * 1000 * 1000 + 9;\n static int n, m; \n \n \n public static void main(String[] args) throws IOException {\n try {\n String s = sc.next();\n String ans = \"\";\n if(s.charAt(0) == 'f')\n {\n ans += \"ftp://\";\n s = s.substring(3);\n }\n else\n {\n ans += \"http://\";\n s = s.substring(4);\n }\n int pos;\n if(s.charAt(0) == 'r')\n {\n pos = s.substring(1).indexOf(\"ru\") + 1;\n \n }\n else\n pos = s.indexOf(\"ru\");\n ans += s.substring(0, pos);\n ans += \".ru\";\n if(pos + 2 < s.length())\n ans += \"/\" + s.substring(pos + 2);\n pw.println(ans);\n }\n finally {\n pw.close();\n }\n }\n\n\n static Scanner sc = new Scanner(System.in);\n static PrintWriter pw = new PrintWriter(System.out);\n static StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));\n static BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));\n static StringTokenizer st ;\n static int nextInt() throws IOException {\n in.nextToken();\n return (int) in.nval;\n }\n static long nextLong() throws IOException {\n in.nextToken();\n return (long) in.nval;\n }\n static double nextDouble() throws IOException {\n in.nextToken();\n return in.nval;\n }\n static String next() throws IOException {\n in.nextToken();\n return in.sval;\n }\n static void outArray(int[] O) {\n for(int i = 0; i < O.length - 1; i++)\n pw.print(O[i] + \" \");\n pw.println(O[O.length - 1]);\n }\n static void exit(Object arg)\n {\n pw.println(arg);\n pw.flush();\n System.exit(0);\n }\n}", "lang_cluster": "Java", "tags": ["strings", "implementation"], "code_uid": "14c946fd9c5ad6cfd092e8a19176bbbf", "src_uid": "4c999b7854a8a08960b6501a90b3bba3", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class BearAndFiveCards {\n\tpublic static BufferedReader f = new BufferedReader(new InputStreamReader(System.in));\n\tpublic static StringTokenizer st;\n\t\n\tpublic static void main(String[] args) throws IOException {\n\t\tint[] a = intArray(5);\n\t\tint sum = 0;\n\t\tfor (int x : a)\n\t\t\tsum += x;\n\t\tint min = sum;\n\t\tfor (int i = 0; i < 5; i++) {\n\t\t\tint count = 0;\n\t\t\tfor (int j = 0; j < 5; j++)\n\t\t\t\tif (a[j] == a[i])\n\t\t\t\t\tcount++;\n\t\t\tif (count > 3)\n\t\t\t\tcount = 3;\n\t\t\tif (count != 1)\n\t\t\t\tmin = Math.min(min, sum - count*a[i]);\n\t\t}\n\t\t\n\t\tSystem.out.println(min);\n\t}\n\t\n\tpublic static String nextLine() throws IOException {\n\t\treturn f.readLine();\n\t}\n\t\n\tpublic static String nextString() throws IOException {\n\t\twhile (st == null || !st.hasMoreTokens())\n\t\t\tst = new StringTokenizer(f.readLine());\n\t\treturn st.nextToken();\n\t}\n\t\n\tpublic static int nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextString());\n\t}\n\t\n\tpublic static long nextLong() throws IOException {\n\t\treturn Long.parseLong(nextString());\n\t}\n\t\n\tpublic static int[] intArray(int n) throws IOException {\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = nextInt();\n\t\treturn a;\n\t}\n}", "lang_cluster": "Java", "tags": ["constructive algorithms", "implementation"], "code_uid": "26be5bedd164b77e2f92e075f7ff9512", "src_uid": "a9c17ce5fd5f39ffd70917127ce3408a", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.BufferedWriter;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\n/**\n * Built using CHelper plug-in Actual solution is at the top\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputReader in = new InputReader(System.in);\n\t\tPrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)), true);\n\t\tTaskB solver = new TaskB();\n\t\tsolver.solve(1, in, out);\n\t\tout.flush();\n\t\tout.close();\n\t}\n}\n\nclass Pair {\n\tint first;\n\tint second;\n\n\tPair(int first, int second) {\n\t\tthis.first = first;\n\t\tthis.second = second;\n\t}\n}\n\nclass TaskB {\n\n\tpublic void solve(int testNumber, InputReader in, PrintWriter pw) {\n\t\tint x1 = in.nextInt();\n\t\tint y1 = in.nextInt();\n\t\tlong sum = 0;\n\t\tfor (int i = x1; i <= y1; i++) {\n\t\t\tlong sum1 = 0;\n\t\t\tint temp = i;\n\t\t\twhile (temp > 0) {\n\t\t\t\tint rem = temp % 10;\n\t\t\t\ttemp /= 10;\n\t\t\t\tsum1 += getInt(rem);\n\t\t\t}\n\t\t\tsum += sum1;\n\t\t}\n\t\tpw.println(sum);\n\t}\n\n\tpublic int getInt(int num) {\n\t\tint ret = -1;\n\t\tswitch (num) {\n\t\tcase 0:\n\t\t\tret = 6;\n\t\t\tbreak;\n\t\tcase 1:\n\t\t\tret = 2;\n\t\t\tbreak;\n\t\tcase 2:\n\t\t\tret = 5;\n\t\t\tbreak;\n\t\tcase 3:\n\t\t\tret = 5;\n\t\t\tbreak;\n\t\tcase 4:\n\t\t\tret = 4;\n\t\t\tbreak;\n\t\tcase 5:\n\t\t\tret = 5;\n\t\t\tbreak;\n\t\tcase 6:\n\t\t\tret = 6;\n\t\t\tbreak;\n\t\tcase 7:\n\t\t\tret = 3;\n\t\t\tbreak;\n\t\tcase 8:\n\t\t\tret = 7;\n\t\t\tbreak;\n\t\tcase 9:\n\t\t\tret = 6;\n\t\t\tbreak;\n\t\t}\n\t\treturn ret;\n\t}\n\n\tpublic int isPow(long num) {\n\t\tint count = 0;\n\t\twhile (num > 0) {\n\t\t\tnum /= 2;\n\t\t\tcount++;\n\t\t}\n\t\treturn count;\n\t}\n}\n\nclass InputReader {\n\tBufferedReader br;\n\tStringTokenizer st;\n\n\tpublic InputReader(InputStream in) {\n\t\tbr = new BufferedReader(new InputStreamReader(in));\n\t\tst = null;\n\t}\n\n\tpublic String next() {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tpublic int nextInt() {\n\t\treturn Integer.parseInt(next());\n\t}\n\n\tpublic long nextLong() {\n\t\treturn Long.parseLong(next());\n\t}\n\n\tpublic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "cc65f17796f755be11fc64554be9ec84", "src_uid": "1193de6f80a9feee8522a404d16425b9", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "\nimport java.util.Map;\nimport java.util.Scanner;\nimport java.util.TreeMap;\n\npublic class A106 {\n\tpublic static void main (String args[]){\n\t\tScanner in = new Scanner(System.in);\n\t\tchar hokm = in.next().charAt(0);\n\t\tchar[] a = in.next().toCharArray();\n\t\tchar[] b = in.next().toCharArray();\n\t\tMap<Character, Integer> m = new TreeMap<Character, Integer>();\n\t\tm.put('6', 6);m.put('7', 7);m.put('8', 8);m.put('9', 9);m.put('T',10);\n\t\tm.put('J', 11);m.put('Q', 12);m.put('K', 13);m.put('A', 14);\n\t\tif(a[1]==b[1]){\n\t\t\tif(m.get(a[0])>m.get(b[0]))\n\t\t\t\tSystem.out.println(\"YES\");\n\t\t\telse\n\t\t\t\tSystem.out.println(\"NO\");\n\t\t}\n\t\telse {\n\t\t\tif(a[1]==hokm)\n\t\t\t\tSystem.out.println(\"YES\");\n\t\t\telse if(b[1]==hokm)\n\t\t\t\tSystem.out.println(\"NO\");\n\t\t\telse\n\t\t\t\tSystem.out.println(\"NO\");\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "a5674f123788837b19569837997dd4a0", "src_uid": "da13bd5a335c7f81c5a963b030655c26", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class P2 {\n\tstatic int find (long x) {\n\t\tif (x < 2)\n\t\t\treturn 0;\n\t\tint bc = 0, zc = 0, zp = -1;\n\t\tlong b = x;\n\t\twhile (b > 0) {\n\t\t\tbc++;\n\t\t\tif ((b & 1) == 0) {\n\t\t\t\tzc++;\n\t\t\t\tzp = bc;\n\t\t\t}\n\t\t\tb >>= 1;\n\t\t}\n\t\tlong p = 0;\n\t\tif (zc == 0)\n\t\t\tp = x - 1;\n\t\telse if (zc == 1)\n\t\t\tp = x;\n\t\telse {\n\t\t\tfor (int i = 1; i < bc - zp; i++) {\n\t\t\t\tp = p << 1;\n\t\t\t\tp = p | 1;\n\t\t\t}\n\t\t\tp = p << 1;\n\t\t\tfor (int i = 0; i < zp; i++) {\n\t\t\t\tp = p << 1;\n\t\t\t\tp = p | 1;\n\t\t\t}\n\t\t\tif ((p & (p + 1)) == 0)\n\t\t\t\tp--;\n\t\t}\n\t\tbc = 0;\n\t\tzp = -1;\n\t\tb = p;\n\t\twhile (b > 0) {\n\t\t\tbc++;\n\t\t\tif ((b & 1) == 0)\n\t\t\t\tzp = bc;\n\t\t\tb >>= 1;\n\t\t}\n\t\tint ans = 0;\n\t\tfor (int i = 2; i < bc; i++)\n\t\t\tans += (i - 1);\n\t\tans += (bc - zp);\n\t\treturn ans;\n\t}\n\tpublic static void main (String[] args) {\n\t\tScanner sc = new Scanner (System.in);\n\t\tPrintStream op = System.out;\n\t\tlong a = sc.nextLong();\n\t\tlong b = sc.nextLong();\n\t\tif (a > b) {\n\t\t\tlong t = a;\n\t\t\ta = b;\n\t\t\tb = t;\n\t\t}\n\t\tint av = find (a - 1);\n\t\tint bv = find (b);\n\t\top.println(bv - av);\n\t\tsc.close();\n\t\top.close();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "implementation", "bitmasks"], "code_uid": "536969ad580de2a80af1be2f84085aa2", "src_uid": "581f61b1f50313bf4c75833cefd4d022", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\npublic class task\n{\n\tpublic static void main(String[] Args)\n\t{\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt(),a[]=new int[7],i,sum=0,ze=6;\n\t\tfor (i=0;i!=7;++i)\n\t\t{\n\t\t\ta[i]=sc.nextInt();\n\t\t\tsum+=a[i];\n\t\t\tif (a[i]!=0)\n\t\t\t\tze=i;\n\t\t}\n\t\tn=n%sum;\n\t\tif (n!=0)\n\t\t\tfor (i=0;i!=7 && n>0;++i)\n\t\t\t\tn-=a[i];\n\t\telse\n\t\t\ti=ze+1;\t\t\n\t\tSystem.out.println(i);\n\t}\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "8e26758bd997ce9804f8d5955f0b48f7", "src_uid": "007a779d966e2e9219789d6d9da7002c", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n \npublic class A1 {\n \n public static void main(String[] args) throws IOException {\n PrintWriter out = new PrintWriter(System.out);\n sc = new StringTokenizer(br.readLine());\n char[] s = nxtCharArr();\n boolean[] a = new boolean[10];\n int q = 0;\n for (int i = 0; i < s.length; i++) {\n if (s[i] == '?')\n q++;\n else if (s[i] >= 'A' && s[i] <= 'J')\n a[s[i] - 'A'] = true;\n }\n long ans = 1;\n if (s[0] == '?') {\n ans *= 9;\n q--;\n }\n while (q-- > 0)\n ans *= 10;\n int c = 0;\n for (int i = 0; i < a.length; i++)\n c += a[i] ? 1 : 0;\n int st = 10;\n if (s[0] >= 'A' && s[0] <= 'J') {\n ans *= 9;\n c--;\n st--;\n }\n while (c-- > 0)\n ans *= st--;\n out.println(ans);\n br.close();\n out.close();\n }\n \n static BufferedReader br = new BufferedReader(new InputStreamReader(\n System.in));\n \n static StringTokenizer sc;\n \n static String nxtTok() throws IOException {\n while (!sc.hasMoreTokens()) {\n String s = br.readLine();\n if (s == null)\n return null;\n sc = new StringTokenizer(s.trim());\n }\n return sc.nextToken();\n }\n \n static int nxtInt() throws IOException {\n return Integer.parseInt(nxtTok());\n }\n \n static long nxtLng() throws IOException {\n return Long.parseLong(nxtTok());\n }\n \n static double nxtDbl() throws IOException {\n return Double.parseDouble(nxtTok());\n }\n \n static int[] nxtIntArr(int n) throws IOException {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = nxtInt();\n return a;\n }\n \n static long[] nxtLngArr(int n) throws IOException {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nxtLng();\n return a;\n }\n \n static char[] nxtCharArr() throws IOException {\n return nxtTok().toCharArray();\n }\n}", "lang_cluster": "Java", "tags": ["greedy"], "code_uid": "65c2483b707bb0facba1ec507a2d789e", "src_uid": "d3c10d1b1a17ad018359e2dab80d2b82", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "\nimport static java.util.Arrays.*;\nimport static java.lang.Math.*;\nimport java.util.*;\nimport java.io.*;\n\npublic class Main implements Runnable\n{\n\tpublic static void main(String [] args) throws IOException\n\t{\n\t\tnew Thread(null, new Main(), \"\", 1 << 20).start();\n\t}\n\t\n\tString file = \"input\";\n\tBufferedReader input;\n\tPrintWriter out;\n\t\n\tpublic void run() \n\t{\n\t\ttry\n\t\t{\n\t\t\t//input = new BufferedReader(new FileReader(file + \".in\"));\n\t\t\tinput = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(new BufferedOutputStream(System.out));\n\t\t\tsolve();\n\t\t\tout.close();\n\t\t}\n\t\tcatch(Exception e)\n\t\t{\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(1);\n\t\t}\n\t}\n\tlong[][][] dp = new long[36][36][36];\n\tvoid solve() throws IOException\n\t{\n\t\tStringTokenizer st = tokens();\n\t\tint n = nextInt(st), H = nextInt(st);\n\t\tthis.H = H;\n\t\tfor(long[][] t1 : dp) for(long[] t2 : t1) fill(t2, -1);\n\t\tlong res = 0;\n\t\tfor(int i = 1; i <= n; i++) \n\t\t\tfor(int h = H; h <= n; h++)\n\t\t\t{\n\t\t\t\tres += get(i - 1, n - i, h - 1);\n\t\t\t\t//print(i - 1, n - i, h - 1, get(i - 1, n - i, h - 1));\n\t\t\t}\n\t\tout.println(res);\n\t}\n\tint H;\n\tlong get(int left, int right, int h)\n\t{\n\t\tif(h == 0)\n\t\t{\n\t\t\tif(left == 0 && right == 0) return 1;\n\t\t\treturn 0;\n\t\t}\n\t\tif(dp[left][right][h] != -1) return dp[left][right][h];\n\t\t\n\t\tif(h > max(left, right))\n\t\t{\n\t\t\tdp[left][right][h] = 0;\n\t\t\treturn 0;\n\t\t}\t\n\t\tlong res = 0;\n\t\tif(left > 0 && right > 0)\n\t\t{\n\t\t\tfor(int i = 0; i < left; i++)\n\t\t\t\tfor(int j = 0; j < right; j++)\n\t\t\t\t{\n\t\t\t\t\tfor(int k = 0; k <= h - 2; k++)\n\t\t\t\t\t{\n\t\t\t\t\t\tres += get(i, left - i - 1, k) * get(j, right - j - 1, h - 1);\n\t\t\t\t\t\tres += get(i, left - i - 1, h - 1) * get(j, right - j - 1, k);\t\n\t\t\t\t\t}\n\t\t\t\t\tres += get(i, left - i - 1, h - 1) * get(j, right - j - 1, h - 1);\n\t\t\t\t}\n\t\t\t\n\t\t}\n\t\tif(left > 0 && right == 0)\n\t\t{\n\t\t\tfor(int i = 0; i < left; i++) res += get(i, left - i - 1, h - 1);\n\t\t}\n\t\tif(right > 0 && left == 0)\n\t\t{\n\t\t\tfor(int i = 0; i < right; i++) res += get(i, right - i - 1, h - 1);\n\t\t}\n\t\t//print(left, right, h, res);\n\t\treturn dp[left][right][h] = res;\n\t}\n\n\tStringTokenizer tokens() throws IOException\n\t{\n\t\treturn new StringTokenizer(input.readLine());\n\t}\n\t\n\tString next(StringTokenizer st)\n\t{\n\t\treturn st.nextToken();\n\t}\n\t\n\tint nextInt() throws IOException\n\t{\n\t\treturn Integer.parseInt(input.readLine());\n\t}\n\t\n\tint nextInt(StringTokenizer st)\n\t{\n\t\treturn Integer.parseInt(st.nextToken());\n\t}\n\t\n\tdouble nextDouble() throws IOException\n\t{\n\t\treturn Double.parseDouble(input.readLine());\n\t}\n\t\n\tdouble nextDouble(StringTokenizer st)\n\t{\n\t\treturn Double.parseDouble(st.nextToken());\n\t}\n\t\n\tvoid print(Object... o)\n\t{\n\t\tout.println(deepToString(o));\n\t}\n}", "lang_cluster": "Java", "tags": ["divide and conquer", "dp", "combinatorics"], "code_uid": "f3655497f0cf8811769e0117811cf41a", "src_uid": "faf12a603d0c27f8be6bf6b02531a931", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.lang.*;\nimport java.util.*;\nimport java.io.*;\npublic class test\n{ \n \n Scanner sc=new Scanner(System.in);\n PrintWriter pr=new PrintWriter(System.out,true);\n public static void main(String... args) \n {\n test c=new test();\n c.prop();\n }\n public void prop() \n {\n int n,a,x=0,b,c ;\n n=sc.nextInt();\n a=sc.nextInt();\n if(a>15)\n x=15 ;\n for (int i=1;i<n ;++i) {\n b=sc.nextInt();\n c=b-a ;\n if(c>15 && x==0)\n x=a+15 ;\n a=b ; \n } \n \n c=90-a ;\n if(c>15 && x==0)\n x=a+15 ;\n else if(x==0)\n x=90 ; \n pr.println(x);\n \n }\n \n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "65f067da91aa018f7ccd620ba548934b", "src_uid": "5031b15e220f0ff6cc1dd3731ecdbf27", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.Scanner;\n\n\npublic class CodeLab {\n\n\tpublic static void main(String[] args) {\n\tScanner sc=new Scanner(System.in);\n\tint n=sc.nextInt();\n\tint m=sc.nextInt();\n\tint maxIndex=1;\n\tint max=(int) Math.ceil(sc.nextInt()*1.0/m);\n\t\n\tfor(int i=1;i<n;i++) {\n\t\tint x=sc.nextInt();\n\t\tif(Math.ceil(x*1.0/m)>=max) {\n\t\t\tmax=(int) Math.ceil(x*1.0/m);\n\t\t\tmaxIndex=i+1;\n\t\t}\n\t}\n\tSystem.out.println(maxIndex);\n\t\n\t\n\t\n\t\n\t\n\tsc.close();\n\t}\n\t\n\t\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "3e1406a21bae63042a6eba5cd60c2dc5", "src_uid": "c0ef1e4d7df360c5c1e52bc6f16ca87c", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class Main implements Runnable {\n\n\tprivate void solve() throws IOException {\n\t\tchar[] s = next().toCharArray();\n\t\tint n = s.length;\n\t\tint ans = 0;\n\t\tint k = 0;\n\t\tchar last = '?';\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tif (last == '?' || s[i] == last) {\n\t\t\t\t++k;\n\t\t\t\tlast = s[i];\n\t\t\t\tif (k == 5) {\n\t\t\t\t\tlast = '?';\n\t\t\t\t\tk = 0;\n\t\t\t\t\t++ans;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tk = 1;\n\t\t\t\tlast = s[i];\n\t\t\t\t++ans;\n\t\t\t}\n\t\t}\n\t\tif (k != 0) ++ans;\n\t\tout.println(ans);\n\t}\n\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(next());\n\t}\n\n\tlong nextLong() throws IOException {\n\t\treturn Long.parseLong(next());\n\t}\n\n\tdouble nextDouble() throws IOException {\n\t\treturn Double.parseDouble(next());\n\t}\n\n\tString next() throws IOException {\n\t\twhile (!st.hasMoreTokens()) {\n\t\t\tString line = in.readLine();\n\t\t\tif (line == null) return null;\n\t\t\teat(line);\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Thread(null, new Main(), \"Main\", 1 << 28).start();\n\t}\n\n\tprivate BufferedReader in;\n\tprivate PrintWriter out;\n\tprivate StringTokenizer st;\n\n\t@Override\n\tpublic void run() {\n\t\ttry {\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(System.out);\n\t\t\teat(\"\");\n\t\t\tsolve();\n\t\t\tin.close();\n\t\t\tout.close();\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(566);\n\t\t}\n\t}\n\n\tprivate void eat(String s) {\n\t\tst = new StringTokenizer(s);\n\t}\n\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "41422ebf2dfadbb884f5e7a8cb7f9f24", "src_uid": "5257f6b50f5a610a17c35a47b3a0da11", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\npublic class MainB {\n\n\n\t\n\tpublic static void B () throws IOException {\n\t\tMyScanner sc = new MyScanner(System.in);\n\t\tPrintWriter pw = new PrintWriter(System.out);\n\t\tStringTokenizer st;\n\t\t\n\t\tst = new StringTokenizer(sc.nextLine(),\":\");\n\t\tint h = Integer.parseInt(st.nextToken());\n\t\tint m = Integer.parseInt(st.nextToken());\n\t\t\n\t\tint inc = sc.nextInt();\n\t\tint incH = (inc/60)%24;\n\t\tint incM = inc%60;\n\t\n\t\tif (incM + m >= 60){\n\t\t\tm = incM + m - 60;\n\t\t\t//if(incH == 0)\n\t\t\t\tincH += 1;\n\t\t\tif (h + incH > 23){\n\t\t\t\th = incH + h - 24;\n\t\t\t}\n\t\t\telse {\n\t\t\t\th = h + incH;\n\t\t\t}\n\t\t}\n\t\t\n\t\telse {\n\t\t\tm = incM + m;\n\t\t\tif (h + incH > 23){\n\t\t\t\th = incH + h - 24;\n\t\t\t}\n\t\t\telse\n\t\t\t\th = h + incH;\n\t\t}\n\t\t//System.out.println(m%100);\n\t\tString hour = \"\";\n\t\tString min = \"\";\n\t\tif ( (h / 10)%10 == 0)\n\t\t\thour = \"0\" + h % 10;\n\t\telse\n\t\t\thour = \"\" + h;\n\t\t\n\t\tif ( (m / 10)% 10 == 0)\n\t\t\tmin = \"0\" + m;\n\t\telse\n\t\t\tmin = \"\" + m;\n\t\tpw.println(hour + \":\" +min);\n\t\tpw.close();\n\t}\n\t\n\n\t\n\tpublic static void main(String[] args) throws IOException {\n\t\n\t\t\n\t\tB();\n\t\t\n\t}\n\n\tstatic class MyScanner {\n\t\tStringTokenizer st;\n\t\tBufferedReader br;\n\n\t\tpublic MyScanner(InputStream s) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(s));\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\twhile (st == null || !st.hasMoreTokens())\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic long nextLong() throws IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic String nextLine() throws IOException {\n\t\t\treturn br.readLine();\n\t\t}\n\n\t\tpublic double nextDouble() throws IOException {\n\t\t\tString x = next();\n\t\t\tStringBuilder sb = new StringBuilder(\"0\");\n\t\t\tdouble res = 0, f = 1;\n\t\t\tboolean dec = false, neg = false;\n\t\t\tint start = 0;\n\t\t\tif (x.charAt(0) == '-') {\n\t\t\t\tneg = true;\n\t\t\t\tstart++;\n\t\t\t}\n\t\t\tfor (int i = start; i < x.length(); i++)\n\t\t\t\tif (x.charAt(i) == '.') {\n\t\t\t\t\tres = Long.parseLong(sb.toString());\n\t\t\t\t\tsb = new StringBuilder(\"0\");\n\t\t\t\t\tdec = true;\n\t\t\t\t} else {\n\t\t\t\t\tsb.append(x.charAt(i));\n\t\t\t\t\tif (dec)\n\t\t\t\t\t\tf *= 10;\n\t\t\t\t}\n\t\t\tres += Long.parseLong(sb.toString()) / f;\n\t\t\treturn res * (neg ? -1 : 1);\n\t\t}\n\n\t\tpublic boolean ready() throws IOException {\n\t\t\treturn br.ready();\n\t\t}\n\n\t}\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "6e8b6e47511d85bd48c9970c3fccd8da", "src_uid": "20c2d9da12d6b88f300977d74287a15d", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "\nimport java.util.Scanner;\n\n\npublic class a {\n\tpublic static void main(String[] args) {\n\t\tScanner input = new Scanner(System.in);\n\t\tlong value = input.nextLong();\n\t\tint ans = 0;\n\t\tfor(int i = 1; i <= 100 ; i++){\n\t\t\tans = i;\n\t\n\t\t\tvalue++;\n\t\t\tString a = value + \"\";\n\t\t\tif((a).toString().contains(\"8\"))\n\t\t\t\tbreak;\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t\t\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force"], "code_uid": "a614b6d4ae21341ce76161e0fa11b4d1", "src_uid": "4e57740be015963c190e0bfe1ab74cb9", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.Scanner;\n\npublic class test011 {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint x = sc.nextInt();\n\t\tint y = sc.nextInt();\n\t\tif (y == 1 && x != 0 || y == 0) {\n\t\t\tSystem.out.println(\"NO\");\n\t\t\treturn;\n\t\t}\n\t\tint tmp = x - y + 1;\n\t\tif (tmp >= 0 && tmp % 2 == 0) {\n\t\t\tSystem.out.println(\"YES\");\n\t\t} else {\n\t\t\tSystem.out.println(\"NO\");\n\t\t}\n\n\t}\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "f8ca2febfd0202a0a740cb351d60926d", "src_uid": "1527171297a0b9c5adf356a549f313b9", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.List;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\nimport java.util.ArrayList;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tFastScanner in = new FastScanner(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskA solver = new TaskA();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\n\tstatic class TaskA {\n\t\tpublic void solve(int testNumber, FastScanner in, PrintWriter out) {\n\t\t\tint n = in.nextInt();\n\t\t\tint m = in.nextInt();\n\t\t\tint sz1 = getDigits(n - 1, -1).length;\n\t\t\tint sz2 = getDigits(m - 1, -1).length;\n\t\t\tif (sz1 + sz2 > 7) {\n\t\t\t\tout.println(0);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tint ans = 0;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tint[] c = new int[7];\n\t\t\t\tfor (int d : getDigits(i, sz1)) {\n\t\t\t\t\t++c[d];\n\t\t\t\t}\n\t\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\t\tint[] tmp = getDigits(j, sz2);\n\t\t\t\t\tfor (int d : tmp) {\n\t\t\t\t\t\t++c[d];\n\t\t\t\t\t}\n\t\t\t\t\tboolean ok = true;\n\t\t\t\t\tfor (int k = 0; k < c.length; k++) {\n\t\t\t\t\t\tif (c[k] > 1) {\n\t\t\t\t\t\t\tok = false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (ok) {\n\t\t\t\t\t\t++ans;\n\t\t\t\t\t}\n\t\t\t\t\tfor (int d : tmp) {\n\t\t\t\t\t\t--c[d];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tout.println(ans);\n\t\t}\n\n\t\tprivate int[] getDigits(int x, int sz) {\n\t\t\tif (sz < 0 && x == 0) {\n\t\t\t\treturn new int[]{0};\n\t\t\t}\n\t\t\tList<Integer> res = new ArrayList<>();\n\t\t\twhile (x > 0) {\n\t\t\t\tres.add(x % 7);\n\t\t\t\tx /= 7;\n\t\t\t}\n\t\t\twhile (res.size() < sz) {\n\t\t\t\tres.add(0);\n\t\t\t}\n\t\t\tint[] r = new int[res.size()];\n\t\t\tfor (int i = 0; i < res.size(); i++) {\n\t\t\t\tr[i] = res.get(i);\n\t\t\t}\n\t\t\treturn r;\n\t\t}\n\n\t}\n\n\tstatic class FastScanner {\n\t\tprivate BufferedReader in;\n\t\tprivate StringTokenizer st;\n\n\t\tpublic FastScanner(InputStream stream) {\n\t\t\tin = new BufferedReader(new InputStreamReader(stream));\n\t\t}\n\n\t\tpublic String next() {\n\t\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\tString rl = in.readLine();\n\t\t\t\t\tif (rl == null) {\n\t\t\t\t\t\treturn null;\n\t\t\t\t\t}\n\t\t\t\t\tst = new StringTokenizer(rl);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t}\n}\n\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "combinatorics"], "code_uid": "52de8e2677dcd4f32d639bf08c79473c", "src_uid": "0930c75f57dd88a858ba7bb0f11f1b1c", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskA solver = new TaskA();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskA {\n// class values{\n// double val;\n// long x1;\n// long x2;\n//\n// values(double val, long x1, long x2) {\n// this.val = val;\n// this.x1 = x1;\n// this.x2 = x2;\n// }\n// }\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n long t1 = in.nextInt();\n long t2 = in.nextInt();\n long x1 = in.nextInt(),x2 = in.nextInt();\n long t0 = in.nextInt();\n if (t1 == t2){\n out.print(x1+\" \"+x2);return;\n }\n double res = Double.MAX_VALUE;\n long y2 = 0,y1 = 0;\n\n// ArrayList<values> arrayList = new ArrayList<>();\n here: for (long i = x1; i > -1; --i) {\n long left = -1;\n long right = x2 + 1;\n while (right - left > 1){\n long mid = right + left;\n mid >>= 1L;\n long mul = t2*mid + t1*i;\n double d = (double)mul;\n d /= (mid + i);\n if (mid + i == 0)d = 0;\n\n if (Double.valueOf(d).compareTo(Double.valueOf(t0)) >= 0)right = mid;\n else left = mid;\n }\n double pk = t2*right + t1*i;\n pk /= (right + i);\n if (Double.compare(pk,t0) < 0 || right > x2)continue here;\n// while (right + 1 <= x2){\n// double gk = t2*(right + 1) + t1*i;\n// gk /= (right + 1 + i);\n// if (Double.compare(pk,gk) == 0)right++;\n// else{\n// arrayList.add(new values(pk,i,right));\n// continue here;\n// }\n// }\n if (i == 0)right = x2;\n// arrayList.add(new values(pk,i,right));\n if (Double.compare(pk,res) <= 0){\n if (Double.compare(pk,res) == 0){\n if (right + i > y1 + y2){\n y1 = i;\n y2 = right;\n }\n continue;\n }\n else {\n res = pk;\n y1 = i;\n y2 = right;\n }\n }\n }\n out.print(y1+\" \"+y2+\"\\n\");\n }\n}\n\nclass InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream));\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "binary search"], "code_uid": "19268a56afaefd6a725b31abdd9a29a4", "src_uid": "87a500829c1935ded3ef6e4e47096b9f", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class pBinary {\n InputStream is;\n PrintWriter pw;\n String INPUT = \"\";\n long L_INF = (1L << 60L);\n\n void solve() {\n int n = ni(), p = ni(), m;\n int x = 1;\n for (int i = 1; i < 32; i++) {\n n = n - p;\n if (n <= 0)\n break;\n if (check(n, i)) {\n pw.println(i);\n return;\n }\n }\n pw.println(-1);\n }\n\n private boolean check(int n, int x) {\n int c = 0,nn=n;\n while (n > 0) {\n int p = (int) (Math.log(n) /\n Math.log(2));\n n -= (int) Math.pow(2, p);\n c++;\n }\n return c <= x && x<=nn;\n }\n\n void run() throws Exception {\n //\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n is = System.in;\n pw = new PrintWriter(System.out);\n\n long s = System.currentTimeMillis();\n // int t = ni();\n // while (t-- > 0)\n solve();\n pw.flush();\n tr(System.currentTimeMillis() - s + \"ms\");\n }\n\n public static void main(String[] args) throws Exception {\n new pBinary().run();\n }\n\n private byte[] inbuf = new byte[1024];\n private int lenbuf = 0, ptrbuf = 0;\n\n private int readByte() {\n if (lenbuf == -1) throw new InputMismatchException();\n if (ptrbuf >= lenbuf) {\n ptrbuf = 0;\n try {\n lenbuf = is.read(inbuf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (lenbuf <= 0) return -1;\n }\n return inbuf[ptrbuf++];\n }\n\n private boolean isSpaceChar(int c) {\n return !(c >= 33 && c <= 126);\n }\n\n private int skip() {\n int b;\n while ((b = readByte()) != -1 && isSpaceChar(b)) ;\n return b;\n }\n\n private double nd() {\n return Double.parseDouble(ns());\n }\n\n private char nc() {\n return (char) skip();\n }\n\n private String ns() {\n int b = skip();\n StringBuilder sb = new StringBuilder();\n while (!(isSpaceChar(b))) { // when nextLine, (isSpaceChar(b) && b != ' ')\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n private char[] ns(int n) {\n char[] buf = new char[n];\n int b = skip(), p = 0;\n while (p < n && !(isSpaceChar(b))) {\n buf[p++] = (char) b;\n b = readByte();\n }\n return n == p ? buf : Arrays.copyOf(buf, p);\n }\n\n private char[][] nm(int n, int m) {\n char[][] map = new char[n][];\n for (int i = 0; i < n; i++) map[i] = ns(m);\n return map;\n }\n\n private int[] na(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) a[i] = ni();\n return a;\n }\n\n private int ni() {\n int num = 0, b;\n boolean minus = false;\n while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')) ;\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n\n while (true) {\n if (b >= '0' && b <= '9') {\n num = num * 10 + (b - '0');\n } else {\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n private long nl() {\n long num = 0;\n int b;\n boolean minus = false;\n while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')) ;\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n\n while (true) {\n if (b >= '0' && b <= '9') {\n num = num * 10 + (b - '0');\n } else {\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n private boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\n private void tr(Object... o) {\n if (!oj) System.out.println(Arrays.deepToString(o));\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "bitmasks"], "code_uid": "ddecbdb7a63e2203602a6ab5618b7e97", "src_uid": "9e86d87ce5a75c6a982894af84eb4ba8", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\npublic class slime\n{\n public static void main(String args[])\n {\n Scanner s= new Scanner(System.in);\n int n= s.nextInt();\n int c=2;\n int i=1, k=0, j;\n int a[]= new int[n];\n a[0]= 1;\n while(c<=n)\n {\n a[i]=1;\n j=i;\n while(j>0)\n {\n if(a[j]==a[j-1])\n {\n a[j-1]++;\n if(j!=i)\n i--;\n j--;\n }\n else\n {\n if(j==i)\n i++;\n break;\n }\n }\n c++;\n \n }\n for(k=0; k<i; k++)\n {\n System.out.print(a[k]);\n System.out.print(\" \");\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "92415fe0ecbcf667f7e135b4fc2e7f6b", "src_uid": "757cd804aba01dc4bc108cb0722f68dc", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.Scanner;\n\n\npublic class JavaApplication34 {\n\n \n public static void main(String[] args) {\n Scanner sc=new Scanner(System.in);\n int n=sc.nextInt();\n System.out.println(n/2*3);\n }} \n \n \n \n \n\n", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "5c0f34292b44aac8f8c4085d63b5ea14", "src_uid": "031e53952e76cff8fdc0988bb0d3239c", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\npublic class Homgo\n{\npublic static void main(String[] args)\n{\nString s1=new String();\nString s2=new String();\nScanner in=new Scanner(System.in);\n\nHashMap <String,Integer> a = new HashMap <String,Integer> ();\ns1=in.next();\nint i;\nfor (i=0;i<10;i++)\n{\ns2=in.next();\na.put(s2,i);\n}\n\nfor (i=0;i<s1.length();i=i+10)\nSystem.out.print(a.get(s1.substring(i,i+10)));\n\n}\n}", "lang_cluster": "Java", "tags": ["strings", "implementation"], "code_uid": "8d848b867896928448f24a22e2ae792c", "src_uid": "0f4f7ca388dd1b2192436c67f9ac74d9", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Scanner;\nimport java.io.BufferedInputStream;\nimport java.util.Set;\nimport java.util.HashSet;\n\npublic class A { //Codeforces Round #44 - X\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(new BufferedInputStream(System.in));\n\t\t\n\t\tint num = sc.nextInt();\n\t\tSet<Integer> trigNumbers = new HashSet<Integer>();\n\t\tfor (int i = 1; i <= 1000 ; i++) {\n\t\t\tint newNum = (i * (i + 1)) / 2;\n\t\t\ttrigNumbers.add(newNum);\n\t\t}\n\t\t\n\t\tif(trigNumbers.contains(num)) {\n\t\t\tSystem.out.println(\"YES\");\n\t\t} else {\n\t\t\tSystem.out.println(\"NO\");\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "math"], "code_uid": "fb7ab1870b6b3d44c8af0b0bea35a4e8", "src_uid": "587d4775dbd6a41fc9e4b81f71da7301", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "//package SBU_ACM;\n\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n\nimport javax.management.modelmbean.ModelMBean;\n\npublic class eleven {\n\tpublic static ArrayList<Long> nums = new ArrayList<Long>();\n\tpublic static long MOD = 1000000007;\n\tpublic static void main(String[] args)\n\t{\n\t\tScanner input = new Scanner(System.in);\n\t\t\n\t\tlong x = input.nextLong();\n\t\tlong y = input.nextLong();\n\t\t\n\t\tlong n = input.nextLong();\n\t\t\n\t\tif(n % 6 == 1)\n\t\t\tSystem.out.println((x + MOD) % MOD);\n\t\tif(n % 6 == 2)\n\t\t\tSystem.out.println((y + MOD) % MOD);\n\t\tif(n % 6 == 3)\n\t\t\tSystem.out.println((y - x + 3 * MOD) % MOD);\n\t\tif(n % 6 == 4)\n\t\t\tSystem.out.println((-x + MOD) % MOD);\n\t\tif(n % 6 == 5)\n\t\t\tSystem.out.println((-y + MOD) % MOD);\n\t\tif(n % 6 == 0)\n\t\t\tSystem.out.println((-y + x + 3 * MOD) % MOD);\n\t\t\n\t\t\n\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "884e2b96d0bd8ab4f4823fccef2edd18", "src_uid": "2ff85140e3f19c90e587ce459d64338b", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "\nimport java.util.Scanner;\n\n/**\n ** Created by Alik on 10/23/2015.\n */\npublic class Problem_546A {\n public static void main(String[] args){\n Scanner in = new Scanner(System.in);\n int price = in.nextInt();\n int money = in.nextInt();\n int amount = in.nextInt();\n int sum = 0, result;\n\n for (int i = 1; i <= amount; i++){\n sum += price*i;\n }\n result = sum-money;\n if (result <= 0)\n result = 0;\n System.out.print(result);\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "implementation"], "code_uid": "9bf07ebe8978ff061fcb58e8d3f96ad6", "src_uid": "e87d9798107734a885fd8263e1431347", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package javaapplication1;\n/*\n * To change this license header, choose License Headers in Project Properties.\n * To change this template file, choose Tools | Templates\n * and open the template in the editor.\n */\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Set;\npublic class Main {\n public static void main(String[] args) throws IOException{\n BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n PrintWriter pw=new PrintWriter(new PrintStream(System.out));\n String zero=br.readLine();\n String x=br.readLine();\n List<String>L=new ArrayList<>();\n String res=\"o\";\n for (int i = 0; i < 51; i++) {\n res+=\"go\";\n L.add(res);\n }\n for (int i = L.size()-1; i >-1; --i) {\n x=x.replaceAll(L.get(i), \"***\");\n }\n System.out.println(x);\n }\n \n}", "lang_cluster": "Java", "tags": ["strings", "implementation"], "code_uid": "21548275e178373e6e7ad32c6e206f07", "src_uid": "619665bed79ecf77b083251fe6fe7eb3", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Locale;\nimport java.util.StringTokenizer;\n\npublic class Main implements Runnable {\n\n\tprivate void solve() throws IOException {\n\t\tlong n = nextLong();\n\t\tlong h = (long) Math.sqrt(n)+1;\n\t\tlong l = (long) (Math.sqrt(n+6561)-81)-1;\t\t\n\t\tlong ans = -1;\n\t\tfor( long i = l ; i <= h; ++i){\n\t\t\tif( f(i) == n ){\t\t\t\t\n\t\t\t\tans = i;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tout.println(ans);\n\t}\n\n\tprivate long f(long i) {\n\t\treturn i*i+sum(i)*i;\n\t}\n\n\tprivate long sum(long i) {\n\t\tlong ret = 0;\n\t\twhile( i >0 ){\n\t\t\tret += i%10;\n\t\t\ti/=10;\n\t\t}\n\t\treturn ret;\n\t}\n\n\t// private long f(long m) {\n\t//\n\t// return m * m + sum(m) - n;\n\t// }\n\t//\n\t// private long sum(long m) {\n\t// long ret = 0;\n\t// while (m > 0) {\n\t// ret += m % 10;\n\t// m /= 10;\n\t// }\n\t// return ret;\n\t// }\n\n\tint nextInt() throws NumberFormatException, IOException {\n\t\treturn Integer.parseInt(next());\n\t}\n\n\tlong nextLong() throws NumberFormatException, IOException {\n\t\treturn Long.parseLong(next());\n\t}\n\n\tdouble nextDouble() throws NumberFormatException, IOException {\n\t\treturn Double.parseDouble(next());\n\t}\n\n\tString next() throws IOException {\n\t\twhile (!st.hasMoreTokens()) {\n\t\t\tString line = in.readLine();\n\t\t\tif (line == null) {\n\t\t\t\treturn null;\n\t\t\t}\n\t\t\teat(line);\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tprivate void eat(String s) {\n\t\tst = new StringTokenizer(s);\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Thread(null, new Main(), \"Main\", 1 << 26).start();\n\t}\n\n\tprivate BufferedReader in;\n\tprivate PrintWriter out;\n\tprivate StringTokenizer st;\n\n\tpublic void run() {\n\t\ttry {\n\t\t\tLocale.setDefault(Locale.ENGLISH);\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(System.out);\n\t\t\t// in = new BufferedReader(new FileReader(file + \".in\"));\n\t\t\t// out = new PrintWriter(file + \".out\");\n\t\t\teat(\"\");\n\t\t\tsolve();\n\t\t\tin.close();\n\t\t\tout.close();\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "binary search"], "code_uid": "9cf56c4239e1863d0ac59071a57cc520", "src_uid": "e1070ad4383f27399d31b8d0e87def59", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.Scanner;\n\npublic class MikePalindrome {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tString s;\n\t\tScanner sc = new Scanner(System.in);\n\t\ts= sc.next();\n\t\tif(s.length()==1) {\n\t\t\tSystem.out.println(\"YES\");\n\t\t\treturn;\n\t\t}\n\t\tboolean palindrome = true;\n\t\t int cnt = 1;\n\t\t for (int i = 0; i < s.length() / 2; i++) {\n\t\t if (s.charAt(i) != s.charAt(s.length() - 1 - i)) {\n\t\t if (cnt > 0) {\n\t\t cnt--;\n\t\t } else {\n\t\t palindrome = false;\n\t\t break;\n\t\t }\n\t\t }\n\t\t }\n\t\t if (s.length() % 2 == 1 && cnt == 1) {\n\t\t cnt--;\n\t\t }\n\t\t if (palindrome && cnt == 0) {\n\t\t System.out.println(\"YES\");\n\t\t } else {\n\t\t\t System.out.println(\"NO\");\n\t\t }\n\t\t\n\t}\n\t\n\n}\n", "lang_cluster": "Java", "tags": ["brute force", "strings", "constructive algorithms"], "code_uid": "fef68f1cd35fcdcc2ce83ff968563cfe", "src_uid": "fe74313abcf381f6c5b7b2057adaaa52", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class AlexRhombus{\n\n\n\tpublic static void main(String[] args) {\n\t\t\n\t\tScanner input = new Scanner(System.in);\n\n\t\tint n = input.nextInt();\n\t\tint sum = 1 ;\n\n\t\tfor (int i = 0 ; i<n ; i++){\n\n\t\t\tsum = sum + 4*i ;\n\t\t}\n\t\tSystem.out.println(sum);\n\n\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "dp", "implementation"], "code_uid": "577f443d1176b41e1f11df734fc65fdd", "src_uid": "758d342c1badde6d0b4db81285be780c", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.lang.Math.*;\n\npublic class MainA {\n\n\tpublic static int mod = 20000;\n\tpublic static long[] val;\n\tpublic static long[] arr;\n\tstatic int max = (int) 1e9 + 7;\n\n\tpublic static void main(String[] args) {\n\n\t\tInputReader in = new InputReader(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tlong n=in.nextLong();\n\t\tlong l=in.nextLong();\n\t\tlong r=in.nextLong();\n\t\tlong ans=0;\n\t\tint log=0;\n\t\tlong c[]=new long[52];\n\t\tc[0]=1;\n\t\tfor(int i=1;i< 52;i++)\n\t\t{\n\t\t\tc[i]=2*c[i-1];\n\t\t\tif(n < c[i])\n\t\t\t{\n\t\t\t\tlog=i-1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\t\n\t\t\n\t\tlong a[]=new long[log+1];\n\t\tlong f=n,la=0;\n\t\tfor(int i=log;i>=0;i--)\n\t\t{\n\t\t\t\n\t\t\ta[i]=n%2;\n\t\t\tif(i==0)\n\t\t\t{\n\t\t\t\tf=n;\n\t\t\t\tla=n;\n\t\t\t\t\n\t\t\t}\n\t\t\tn=n/2;\n\t\t\t//out.println(n);\n\t\t}\n\t\t//debug(a);\n\t\t//out.println(f+\" \"+la);\n\t\tfor(long i=l;i<=r;i++)\n\t\t{\n\t\t\tif(i%4==0)\n\t\t\t{\n\t\t\t\tlong b=4;\n\t\t\t\tfor(int j=2;j<=log;j++)\n\t\t\t\t{\n\t\t\t\t\t\n\t\t\t\t\tif((i/b)%2==1)\n\t\t\t\t\t{\n\t\t\t\t\t\tans+=a[j];\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tb=b*2;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if(i%4==1)\n\t\t\t{\n\t\t\t\tif(f==1)ans+=1;\n\t\t\t}\n\t\t\telse if(i%4==2)\n\t\t\t{\n\t\t\t\tif(a[1]==1)ans+=1;\n\t\t\t}\n\t\t\telse if(i%4==3)\n\t\t\t{\n\t\t\t\tif(la==1)ans+=1;\n\t\t\t}\n\t\t}\n\t\t\n\t\tout.println(ans);\n\t\tout.close();\n\t}\n\n\t\n\n\tpublic static void debug(Object... o) {\n\t\tSystem.out.println(Arrays.deepToString(o));\n\t}\n\n\tpublic static boolean isPal(String s) {\n\t\tfor (int i = 0, j = s.length() - 1; i <= j; i++, j--) {\n\t\t\tif (s.charAt(i) != s.charAt(j))\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\n\tpublic static String rev(String s) {\n\t\tStringBuilder sb = new StringBuilder(s);\n\t\tsb.reverse();\n\t\treturn sb.toString();\n\t}\n\n\tpublic static long gcd(long x, long y) {\n\t\tif (y == 0)\n\t\t\treturn x;\n\t\tif (x % y == 0)\n\t\t\treturn y;\n\t\telse\n\t\t\treturn gcd(y, x % y);\n\t}\n\n\tpublic static int gcd(int x, int y) {\n\t\tif (x % y == 0)\n\t\t\treturn y;\n\t\telse\n\t\t\treturn gcd(y, x % y);\n\t}\n\n\tpublic static long gcdExtended(long a, long b, long[] x) {\n\n\t\tif (a == 0) {\n\t\t\tx[0] = 0;\n\t\t\tx[1] = 1;\n\t\t\treturn b;\n\t\t}\n\t\tlong[] y = new long[2];\n\t\tlong gcd = gcdExtended(b % a, a, y);\n\n\t\tx[0] = y[1] - (b / a) * y[0];\n\t\tx[1] = y[0];\n\n\t\treturn gcd;\n\t}\n\n\tpublic static int abs(int a, int b) {\n\t\treturn (int) Math.abs(a - b);\n\t}\n\n\tpublic static long abs(long a, long b) {\n\t\treturn (long) Math.abs(a - b);\n\t}\n\n\tpublic static int max(int a, int b) {\n\t\tif (a > b)\n\t\t\treturn a;\n\t\telse\n\t\t\treturn b;\n\t}\n\n\tpublic static int min(int a, int b) {\n\t\tif (a > b)\n\t\t\treturn b;\n\t\telse\n\t\t\treturn a;\n\t}\n\n\tpublic static long max(long a, long b) {\n\t\tif (a > b)\n\t\t\treturn a;\n\t\telse\n\t\t\treturn b;\n\t}\n\n\tpublic static long min(long a, long b) {\n\t\tif (a > b)\n\t\t\treturn b;\n\t\telse\n\t\t\treturn a;\n\t}\n\n\tpublic static long[][] mul(long a[][], long b[][]) {\n\t\tlong c[][] = new long[2][2];\n\t\tc[0][0] = a[0][0] * b[0][0] + a[0][1] * b[1][0];\n\t\tc[0][1] = a[0][0] * b[0][1] + a[0][1] * b[1][1];\n\t\tc[1][0] = a[1][0] * b[0][0] + a[1][1] * b[1][0];\n\t\tc[1][1] = a[1][0] * b[0][1] + a[1][1] * b[1][1];\n\n\t\treturn c;\n\t}\n\n\tpublic static long[][] pow(long n[][], long p, long m) {\n\t\tlong result[][] = new long[2][2];\n\t\tresult[0][0] = 1;\n\t\tresult[0][1] = 0;\n\t\tresult[1][0] = 0;\n\t\tresult[1][1] = 1;\n\n\t\tif (p == 0)\n\t\t\treturn result;\n\t\tif (p == 1)\n\t\t\treturn n;\n\t\twhile (p != 0) {\n\t\t\tif (p % 2 == 1)\n\t\t\t\tresult = mul(result, n);\n\t\t\t//System.out.println(result[0][0]);\n\t\t\tfor (int i = 0; i < 2; i++) {\n\t\t\t\tfor (int j = 0; j < 2; j++) {\n\t\t\t\t\tif (result[i][j] >= m)\n\t\t\t\t\t\tresult[i][j] %= m;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tp >>= 1;\n\t\t\tn = mul(n, n);\n\t\t\t// System.out.println(1+\" \"+n[0][0]+\" \"+n[0][1]+\" \"+n[1][0]+\" \"+n[1][1]);\n\t\t\tfor (int i = 0; i < 2; i++) {\n\t\t\t\tfor (int j = 0; j < 2; j++) {\n\t\t\t\t\tif (n[i][j] >= m)\n\t\t\t\t\t\tn[i][j] %= m;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static long pow(long n, long p) {\n\t\tlong result = 1;\n\t\tif (p == 0)\n\t\t\treturn 1;\n\t\tif (p == 1)\n\t\t\treturn n;\n\t\twhile (p != 0) {\n\t\t\tif (p % 2 == 1)\n\t\t\t\tresult *= n;\n\t\t\tp >>= 1;\n\t\t\tn *= n;\n\t\t}\n\t\treturn result;\n\t}\n\n\tstatic class InputReader {\n\n\t\tprivate final InputStream stream;\n\t\tprivate final byte[] buf = new byte[8192];\n\t\tprivate int curChar, snumChars;\n\t\tprivate SpaceCharFilter filter;\n\n\t\tpublic InputReader(InputStream stream) {\n\t\t\tthis.stream = stream;\n\t\t}\n\n\t\tpublic int snext() {\n\t\t\tif (snumChars == -1)\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tif (curChar >= snumChars) {\n\t\t\t\tcurChar = 0;\n\t\t\t\ttry {\n\t\t\t\t\tsnumChars = stream.read(buf);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (snumChars <= 0)\n\t\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn buf[curChar++];\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\tint c = snext();\n\t\t\twhile (isSpaceChar(c)) {\n\t\t\t\tc = snext();\n\t\t\t}\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-') {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = snext();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = snext();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res * sgn;\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\tint c = snext();\n\t\t\twhile (isSpaceChar(c)) {\n\t\t\t\tc = snext();\n\t\t\t}\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-') {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = snext();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = snext();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res * sgn;\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint a[] = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\ta[i] = nextInt();\n\t\t\t}\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong a[] = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\ta[i] = nextInt();\n\t\t\t}\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic String readString() {\n\t\t\tint c = snext();\n\t\t\twhile (isSpaceChar(c)) {\n\t\t\t\tc = snext();\n\t\t\t}\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo {\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = snext();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tpublic String nextLine() {\n\t\t\tint c = snext();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = snext();\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo {\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = snext();\n\t\t\t} while (!isEndOfLine(c));\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tpublic boolean isSpaceChar(int c) {\n\t\t\tif (filter != null)\n\t\t\t\treturn filter.isSpaceChar(c);\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n\n\t\tprivate boolean isEndOfLine(int c) {\n\t\t\treturn c == '\\n' || c == '\\r' || c == -1;\n\t\t}\n\n\t\tpublic interface SpaceCharFilter {\n\t\t\tpublic boolean isSpaceChar(int ch);\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["dfs and similar", "divide and conquer", "constructive algorithms"], "code_uid": "c25a08d3223019159901ea2cadee3bc0", "src_uid": "3ac61b1f8deee7911b1055c243f5eb6a", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.Scanner;\n\npublic class ImBoredWithLife {\n public static void main(String[]args) {\n Scanner s = new Scanner(new BufferedReader(new InputStreamReader(System.in)));\n int n=s.nextInt();\n int m=s.nextInt();\n int mi=Math.min(n,m);\n System.out.println(factorial(mi));\n }\n\n private static int factorial(int n) {\n if(n==1)\n return 1;\n else\n return n*factorial(n-1);\n }\n\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation", "number theory"], "code_uid": "7db01ca1ab77733de23e1896d2a1aa90", "src_uid": "7bf30ceb24b66d91382e97767f9feeb6", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws FileNotFoundException {\n ConsoleIO io = new ConsoleIO(new InputStreamReader(System.in), new PrintWriter(System.out));\n\n// String fileName = \"C-small-attempt0\";\n// ConsoleIO io = new ConsoleIO(new FileReader(\"D:\\\\Dropbox\\\\code\\\\practice\\\\jb\\\\src\\\\\" + fileName + \".in\"), new PrintWriter(new File(\"D:\\\\Dropbox\\\\code\\\\practice\\\\jb\\\\src\\\\\" + fileName + \".out\")));\n\n new Main(io).solve();\n// new Main(io).solveLocal();\n\n io.close();\n }\n\n ConsoleIO io;\n\n Main(ConsoleIO io) {\n this.io = io;\n }\n\n ConsoleIO opt;\n\n Main(ConsoleIO io, ConsoleIO opt) {\n this.io = io;\n this.opt = opt;\n }\n\n List<List<Integer>> gr = new ArrayList<>();\n\n long MOD = 1_000_000_007;\n\n class Box{\n public Box(char color, int count, int idx){\n this.color = color == 'R' ? 0 : (color == 'G' ? 1 : 2);\n this.count = count;\n this.idx = idx;\n }\n public int color;\n public int count;\n public int idx;\n }\n\n public void solve() {\n int[] l = io.readIntArray();\n int n = l[0];\n int s = l[1] - 1;\n int k = l[2];\n int[] num = io.readIntArray();\n char[] col = io.readLine().toCharArray();\n Box[] all = new Box[n];\n int sum = 0;\n for(int i = 0;i<n;i++){\n all[i] = new Box(col[i], num[i], i);\n sum += num[i];\n }\n int maxCount = Math.max(k, sum);\n Arrays.sort(all, Comparator.comparingInt(a -> a.count));\n int[][] min = new int[n][maxCount+1];\n for(int i = 0;i<n;i++)\n for(int j = 0;j<=maxCount;j++)\n min[i][j] = Integer.MAX_VALUE / 3;\n for(int i = 0;i<n;i++) {\n Box b = all[i];\n min[i][b.count] = Math.min(min[i][b.count], Math.abs(s - b.idx));\n for (int j = 0; j < i; j++)\n if (b.count > all[j].count && b.color != all[j].color) {\n for (int c = b.count; c <= maxCount; c++) {\n min[i][c] = Math.min(min[i][c], min[j][c - b.count] + Math.abs(b.idx - all[j].idx));\n }\n }\n }\n int res = Integer.MAX_VALUE/3;\n for(int i = 0;i<n;i++)\n for(int j = k; j<=maxCount;j++)\n res = Math.min(res, min[i][j]);\n io.writeLine((res==Integer.MAX_VALUE/3?-1:res)+\"\");\n }\n\n}\n\n\nclass ConsoleIO {\n\n BufferedReader br;\n PrintWriter out;\n public ConsoleIO(Reader reader, PrintWriter writer){br = new BufferedReader(reader);out = writer;}\n public void flush(){this.out.flush();}\n public void close(){this.out.close();}\n public void writeLine(String s) {this.out.println(s);}\n public void writeInt(int a) {this.out.print(a);this.out.print(' ');}\n public void writeWord(String s){\n this.out.print(s);\n }\n public void writeIntArray(int[] a, int k, String separator) {\n StringBuilder sb = new StringBuilder();\n for (int i = 0; i < k; i++) {\n if (i > 0) sb.append(separator);\n sb.append(a[i]);\n }\n this.writeLine(sb.toString());\n }\n public int read(char[] buf, int len){try {return br.read(buf,0,len);}catch (Exception ex){ return -1; }}\n public String readLine() {try {return br.readLine();}catch (Exception ex){ return \"\";}}\n public long[] readLongArray() {\n String[]n=this.readLine().trim().split(\"\\\\s+\");long[]r=new long[n.length];\n for(int i=0;i<n.length;i++)r[i]=Long.parseLong(n[i]);\n return r;\n }\n public int[] readIntArray() {\n String[]n=this.readLine().trim().split(\"\\\\s+\");int[]r=new int[n.length];\n for(int i=0;i<n.length;i++)r[i]=Integer.parseInt(n[i]);\n return r;\n }\n public int[] readIntArray(int n) {\n int[] res = new int[n];\n char[] all = this.readLine().toCharArray();\n int cur = 0;boolean have = false;\n int k = 0;\n boolean neg = false;\n for(int i = 0;i<all.length;i++){\n if(all[i]>='0' && all[i]<='9'){\n cur = cur*10+all[i]-'0';\n have = true;\n }else if(all[i]=='-') {\n neg = true;\n }\n else if(have){\n res[k++] = neg?-cur:cur;\n cur = 0;\n have = false;\n neg = false;\n }\n }\n if(have)res[k++] = neg?-cur:cur;\n return res;\n }\n public int ri() {\n try {\n int r = 0;\n boolean start = false;\n boolean neg = false;\n while (true) {\n int c = br.read();\n if (c >= '0' && c <= '9') {\n r = r * 10 + c - '0';\n start = true;\n } else if (!start && c == '-') {\n start = true;\n neg = true;\n } else if (start || c == -1) return neg ? -r : r;\n }\n } catch (Exception ex) {\n return -1;\n }\n }\n public long readLong() {\n try {\n long r = 0;\n boolean start = false;\n boolean neg = false;\n while (true) {\n int c = br.read();\n if (c >= '0' && c <= '9') {\n r = r * 10 + c - '0';\n start = true;\n } else if (!start && c == '-') {\n start = true;\n neg = true;\n } else if (start || c == -1) return neg ? -r : r;\n }\n } catch (Exception ex) {\n return -1;\n }\n }\n public String readWord() {\n try {\n boolean start = false;\n StringBuilder sb = new StringBuilder();\n while (true) {\n int c = br.read();\n if (c!= ' ' && c!= '\\r' && c!='\\n' && c!='\\t') {\n sb.append((char)c);\n start = true;\n } else if (start || c == -1) return sb.toString();\n }\n } catch (Exception ex) {\n return \"\";\n }\n }\n public char readSymbol() {\n try {\n while (true) {\n int c = br.read();\n if (c != ' ' && c != '\\r' && c != '\\n' && c != '\\t') {\n return (char) c;\n }\n }\n } catch (Exception ex) {\n return 0;\n }\n }\n//public char readChar(){try {return (char)br.read();}catch (Exception ex){ return 0; }}\n}\nclass Pair {\n public Pair(int a, int b) {this.a = a;this.b = b;}\n public int a;\n public int b;\n}\nclass PairLL {\n public PairLL(long a, long b) {this.a = a;this.b = b;}\n public long a;\n public long b;\n}\nclass Triple {\n public Triple(int a, int b, int c) {this.a = a;this.b = b;this.c = c;}\n public int a;\n public int b;\n public int c;\n}\n", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "8a8a114f81e9925c61c48a19aeebc433", "src_uid": "a95e54a7e38cc0d61b39e4a01a6f8d3f", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.lang.Math;\npublic class AbstractionInJava{\n public static void main(String args[]){\n Scanner sc=new Scanner(System.in);\n int n=sc.nextInt();\n int m=sc.nextInt();\n int o=sc.nextInt();\n\n double a=Math.sqrt((n*m)/o);\n double b=Math.sqrt((n*o)/m);\n\n double c=Math.sqrt((m*o)/n);\n\n System.out.print((int)(a+b+c)*4);\n\n\n }}\n\n\n \n", "lang_cluster": "Java", "tags": ["brute force", "math", "geometry"], "code_uid": "5b9a3a573b23f4b2bf9aac0471661d41", "src_uid": "c0a3290be3b87f3a232ec19d4639fefc", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\n/**\n * Created by IntelliJ IDEA.\n * User: mihai\n * Date: 2/3/12\n * Time: 10:46 PM\n */\npublic class problemD {\n private static final long MOD = 1000000007;\n \n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N, M, K;\n N = sc.nextInt();\n M = sc.nextInt();\n K = sc.nextInt();\n \n if (K == 1 || K > N) System.out.println(pow(M, N));\n else if (K == N) System.out.println(pow(M, (N + 1) / 2));\n else if (K % 2 == 0) System.out.println(M);\n else System.out.println(M * M);\n \n }\n\n private static int pow(long x, long y) {\n int[] put = new int[128];\n int k = 0;\n while (y != 0) {\n put[k++] = (int)y % 2;\n y /= 2;\n }\n\n long res = x;\n for (int i = k - 2; i >= 0; i--) {\n if (put[i] == 1) {\n res *= res;\n res %= MOD;\n res *= x;\n res %= MOD;\n } else {\n res *= res;\n res %= MOD;\n }\n }\n\n return (int)res;\n }\n}\n", "lang_cluster": "Java", "tags": ["dsu", "math", "combinatorics", "graphs"], "code_uid": "1ae3f37b8411288da9595890db5ff189", "src_uid": "1f9107e8d1d8aebb1f4a1707a6cdeb6d", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\nimport java.awt.geom.*;\n\npublic class TvSet {\n public static long gcd(long a, long b) {\n if (a == 1 || b == 1)\n return 1;\n if (a % b == 0)\n return b;\n return gcd(b, a % b);\n }\n\n public static void main(String[] args) {\n MyScanner sc = new MyScanner();\n long a = sc.nl(), b = sc.nl(), x = sc.nl(), y = sc.nl();\n long hcf = gcd(x, y);\n x /= hcf;\n y /= hcf;\n long v1 = a / x;\n long v2 = b / y;\n System.out.println(Math.min(v1, v2));\n }\n\n /////////// TEMPLATE FROM HERE /////////////////\n private static class MyScanner {\n BufferedReader br;\n StringTokenizer st;\n\n public MyScanner() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int ni() {\n return Integer.parseInt(next());\n }\n\n float nf() {\n return Float.parseFloat(next());\n }\n\n long nl() {\n return Long.parseLong(next());\n }\n\n double nd() {\n return Double.parseDouble(next());\n }\n\n String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n }\n}", "lang_cluster": "Java", "tags": ["math"], "code_uid": "1f315f1a668f446aca28b30ffec624af", "src_uid": "907ac56260e84dbb6d98a271bcb2d62d", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.math.BigDecimal;\nimport java.util.*;\n\npublic class Main {\n\n public static boolean common2 = false;\n public static long total = 0, v2 = 0, d = 0, t = 0;\n public static long[][] dp = new long[1000][2000];\n\n public static void main(String[] args) throws IOException {\n Map<Integer, String> map = new HashMap<Integer, String>();\n map.put(0, \"zero\");\n map.put(1, \"one\");\n map.put(2, \"two\");\n map.put(3, \"three\");\n map.put(4, \"four\");\n map.put(5, \"five\");\n map.put(6, \"six\");\n map.put(7, \"seven\");\n map.put(8, \"eight\");\n map.put(9, \"nine\");\n map.put(10, \"ten\");\n map.put(11, \"eleven\");\n map.put(12, \"twelve\");\n map.put(13, \"thirteen\");\n map.put(14, \"fourteen\");\n map.put(15, \"fifteen\");\n map.put(16, \"sixteen\");\n map.put(17, \"seventeen\");\n map.put(18, \"eighteen\");\n map.put(19, \"nineteen\");\n map.put(20, \"twenty\");\n map.put(30, \"thirty\");\n map.put(40, \"forty\");\n map.put(50, \"fifty\");\n map.put(60, \"sixty\");\n map.put(70, \"seventy\");\n map.put(80, \"eighty\");\n map.put(90, \"ninety\");\n int i, j;\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n if (n <= 20) {\n System.out.println(map.get(n));\n } else {\n int m = n % 10;\n int n1 = n - m;\n StringBuilder strB = new StringBuilder(\"\");\n if (m != 0) {\n System.out.println(map.get(n1) + \"-\" + map.get(m));\n } else {\n System.out.println(map.get(n1));\n }\n }\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "860268c6e6e0fb78be03c8273bac414e", "src_uid": "a49ca177b2f1f9d5341462a38a25d8b7", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import jdk.swing.interop.SwingInterOpUtils;\n\nimport java.util.Scanner;\n\npublic class cp {\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n int k = 0, l = 0, count = 0;\n\n\n int ar[][] = new int[5][5];\n\n for (int i = 0; i < 5; i++) {\n for (int j = 0; j < 5; j++) {\n ar[i][j] = scan.nextInt();\n if (ar[i][j] == 1) {\n k = i;\n l = j;\n }\n }\n }\n\n for (int i = 0; i < 5; i++) {\n if (k != 2) {\n\n\n if (k > 2) {\n k--;\n } else {\n k++;\n }\n\n count = count + 1;\n\n }\n if (l != 2) {\n {\n if (l > 2) {\n l--;\n } else {\n l++;\n }\n }\n count = count + 1;\n }\n\n\n\n else if (k == 2 && l == 2)\n break;\n\n\n }\n\n\n System.out.println(count);\n\n}\n}\n\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "0b964e9e575411182e0b90d07a3f91cb", "src_uid": "8ba7cedc3f6ae478a0bb3f902440c8e9", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\npublic class Main\n{\n\tpublic static void main (String[]args) throws IOException\n\t{\n\t\tScanner read = new Scanner (System.in);\n\t\tString x = read.next();\n\t\tString ans=\"\";\n\t\tfor (int i=0;i<x.length();i++)\n\t\t{\n\t\t\tif (x.charAt(i)=='.')\n\t\t\t\tans+=\"1100\";\n\t\t\tif (x.charAt(i)==',')\n\t\t\t\tans+=\"1101\";\n\t\t\tif (x.charAt(i)=='>')\n\t\t\t\tans+=\"1000\";\n\t\t\tif (x.charAt(i)=='<')\n\t\t\t\tans+=\"1001\";\n\t\t\tif (x.charAt(i)=='[')\n\t\t\t\tans+=\"1110\";\n\t\t\tif (x.charAt(i)==']')\n\t\t\t\tans+=\"1111\";\n\t\t\tif (x.charAt(i)=='+')\n\t\t\t\tans+=\"1010\";\n\t\t\tif (x.charAt(i)=='-')\n\t\t\t\tans+=\"1011\";\n\n\t\t}\n\t\tBigInteger br = new BigInteger(ans,2);\n\t\tSystem.out.println(br.mod(new BigInteger(\"1000003\")));\n\t}\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "28a399f485154f94d158b715803be269", "src_uid": "04fc8dfb856056f35d296402ad1b2da1", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\n/**\n *\n * @author arabtech\n */\npublic class PetyaAndSquare {\n\n /**\n * @param args the command line arguments\n */\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int x,y,size;\n size=sc.nextInt();\n x=sc.nextInt();\n y=sc.nextInt();\n if(((2*x)==size||(2*(x-1)==size))&&((2*y)==size||(2*(y-1)==size))){\n System.out.println(\"NO\");\n }\n else{\n System.out.println(\"YES\"); \n }\n }\n \n}\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "8e9868ec53e14c5cbdda5c75369ff15d", "src_uid": "dc891d57bcdad3108dcb4ccf9c798789", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.math.BigInteger;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author lebegio\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n MyReader in = new MyReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskB solver = new TaskB();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskB {\n public void solve(int testNumber, MyReader in, PrintWriter out) {\n String str = in.next();\n long n = Long.parseLong(str.substring(0, str.length() - 1));\n char ch = str.charAt(str.length() - 1);\n int poz = getPoz(ch);\n BigInteger time = BigInteger.ZERO;\n if (n % 4 != 0) time = BigInteger.valueOf(n / 4).multiply(BigInteger.valueOf(16));\n else time = BigInteger.valueOf((n - 1) / 4).multiply(BigInteger.valueOf(16));\n\n if (n % 4 == 0) {\n time = time.add(BigInteger.valueOf(poz + 7));\n } else if (n % 4 == 1) {\n time = time.add(BigInteger.valueOf(poz));\n } else if (n % 4 == 2) {\n time = time.add(BigInteger.valueOf(poz + 7));\n } else if (n % 4 == 3) {\n time = time.add(BigInteger.valueOf(poz));\n }\n out.println(time);\n }\n\n int getPoz(char ch) {\n switch (ch) {\n case 'a':\n return 4;\n case 'b':\n return 5;\n case 'c':\n return 6;\n case 'd':\n return 3;\n case 'e':\n return 2;\n case 'f':\n return 1;\n }\n return -1;\n }\n\n }\n\n static class MyReader {\n private BufferedReader buffReader;\n private StringTokenizer strTokenizer;\n private static final int SIZE = 32768;\n\n public MyReader(InputStream inputStream) {\n buffReader = new BufferedReader(new InputStreamReader(inputStream), SIZE);\n }\n\n public String next() {\n if (strTokenizer == null || !strTokenizer.hasMoreTokens()) {\n try {\n strTokenizer = new StringTokenizer(buffReader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return strTokenizer.nextToken();\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "0dd0a58ea5441f41acf39d06e518d7af", "src_uid": "069d0cb9b7c798a81007fb5b63fa0f45", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\nimport java.math.*;\nimport java.io.*;\n\npublic class Main\n\t{\n\t/*\n\t * Simple bitmask code for boolean isset, int set and int clr\n\t */\n\tpublic static boolean isset(int n,int i) //returns 1 if the ith bit (from left) of n is set\n\t\t{\n\t\treturn ((n>>i)&1)==1;\n\t\t}\n\tpublic static void main(String args[]) throws IOException\n\t\t{\n\t\tInputReader in=new InputReader(System.in);\n\t\tPrintWriter out=new PrintWriter(System.out);\n\t\tint n=in.readInt();\n\t\tRectangle R[]=new Rectangle[n];\n\t\tfor(int i=0;i<n;i++)\n\t\t\tR[i]=new Rectangle(in.readInt(),in.readInt(),in.readInt(),in.readInt());\n\t\t\n\t\tfor(int i=(1<<n)-1;i<(1<<n);i++)\n\t\t\t{\n\t\t\tLinkedList<Rectangle> L=new LinkedList<Rectangle>();\n\t\t\tfor(int j=0;j<n;j++)\n\t\t\t\t{\n\t\t\t\tif(isset(i,j))\n\t\t\t\t\tL.add(R[j]);\n\t\t\t\t}\n\t\t\tint num=L.size();\n\t\t\tRectangle RT[]=new Rectangle[num];\n\t\t\tfor(int j=0;j<num;j++)\n\t\t\t\tRT[j]=L.pollFirst();\n\t\t\tif(check(RT))\n\t\t\t\t{\n\t\t\t\tSystem.out.println(\"YES\");\n\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\tSystem.out.println(\"NO\");\n\t\tout.close();\n\t\t}\n\t\n\tprivate static boolean check(Rectangle[] RT)\n\t\t{\n\t\t/*System.out.println(\"For \");\n\t\tfor(Rectangle r:RT)\n\t\t\tSystem.out.println(\"\\t\"+r.x1+\" \"+r.y1+\" \"+r.x2+\" \"+r.y2);*/\n\t\tlong totArea=0;\n\t\tfor(Rectangle r:RT)\n\t\t\ttotArea+=(r.x2-r.x1)*(r.y2-r.y1);\n\t\tint upperCornerIndex=-1,lowerCornerIndex=-1;\n\t\tint N=RT.length;\n\t\t\n\t\t//upper right\n\t\tfor(int i=0;i<N;i++)\n\t\t\t{\n\t\t\tboolean valid=true;\n\t\t\tfor(int j=0;j<N;j++)\n\t\t\t\t{\n\t\t\t\tif(RT[i].x2>=RT[j].x2&&RT[i].y2>=RT[j].y2)\n\t\t\t\t\tcontinue;\n\t\t\t\telse\n\t\t\t\t\tvalid=false;\n\t\t\t\t}\n\t\t\tif(valid)\n\t\t\t\tupperCornerIndex=i;\n\t\t\t}\n\t\t\n\t\t//bottom left\n\t\tfor(int i=0;i<N;i++)\n\t\t\t{\n\t\t\tboolean valid=true;\n\t\t\tfor(int j=0;j<N;j++)\n\t\t\t\t{\n\t\t\t\tif(RT[i].x1<=RT[j].x1&&RT[i].y1<=RT[j].y1)\n\t\t\t\t\tcontinue;\n\t\t\t\telse\n\t\t\t\t\tvalid=false;\n\t\t\t\t}\n\t\t\tif(valid)\n\t\t\t\tlowerCornerIndex=i;\n\t\t\t}\n\t\tif(upperCornerIndex==-1||lowerCornerIndex==-1)\n\t\t\treturn false;\n\t\t//System.out.println(\"\\tIndices: \"+upperCornerIndex+\" \"+lowerCornerIndex);\n\t\tlong yLen=RT[upperCornerIndex].y2-RT[lowerCornerIndex].y1;\n\t\tlong xLen=RT[upperCornerIndex].x2-RT[lowerCornerIndex].x1;\n\t\tif(xLen != yLen)\n\t\t\treturn false;\n\t\tif(xLen*yLen!=totArea)\n\t\t\treturn false;\n\t\t/*System.out.println(\"True for \");\n\t\tfor(Rectangle r:RT)\n\t\t\tSystem.out.println(\"\\t\"+r.x1+\" \"+r.y1+\" \"+r.x2+\" \"+r.y2);*/\n\t\treturn true;\n\t\t}\n\t}\n\nclass Rectangle\n\t{\n\tlong x1,y1,x2,y2;\n\n\tpublic Rectangle(int x1,int y1,int x2,int y2)\n\t\t{\n\t\tthis.x1=x1;\n\t\tthis.y1=y1;\n\t\tthis.x2=x2;\n\t\tthis.y2=y2;\n\t\t}\n\t\n\t}\nclass InputReader\n\t{\n\tprivate InputStream stream;\n\tprivate byte[] buf=new byte[1024];\n\tprivate int curChar;\n\tprivate int numChars;\n\tprivate SpaceCharFilter filter;\n\n\tpublic InputReader(InputStream stream)\n\t\t{\n\t\tthis.stream=stream;\n\t\t}\n\n\tpublic int read()\n\t\t{\n\t\tif(numChars==-1)\n\t\t\tthrow new InputMismatchException();\n\t\tif(curChar>=numChars)\n\t\t\t{\n\t\t\tcurChar=0;\n\t\t\ttry\n\t\t\t\t{\n\t\t\t\tnumChars=stream.read(buf);\n\t\t\t\t} catch (IOException e)\n\t\t\t\t{\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\tif(numChars<=0)\n\t\t\t\treturn -1;\n\t\t\t}\n\t\treturn buf[curChar++];\n\t\t}\n\n\tpublic int readInt()\n\t\t{\n\t\tint c=read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc=read();\n\t\tint sgn=1;\n\t\tif(c=='-')\n\t\t\t{\n\t\t\tsgn=-1;\n\t\t\tc=read();\n\t\t\t}\n\t\tint res=0;\n\t\tdo\n\t\t\t{\n\t\t\tif(c<'0'||c>'9')\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tres*=10;\n\t\t\tres+=c-'0';\n\t\t\tc=read();\n\t\t\t} while (!isSpaceChar(c));\n\t\treturn res*sgn;\n\t\t}\n\n\tpublic boolean isSpaceChar(int c)\n\t\t{\n\t\tif(filter!=null)\n\t\t\treturn filter.isSpaceChar(c);\n\t\treturn isWhitespace(c);\n\t\t}\n\n\tpublic static boolean isWhitespace(int c)\n\t\t{\n\t\treturn c==' '||c=='\\n'||c=='\\r'||c=='\\t'||c==-1;\n\t\t}\n\n\tpublic char readCharacter()\n\t\t{\n\t\tint c=read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc=read();\n\t\treturn (char) c;\n\t\t}\n\n\tpublic interface SpaceCharFilter\n\t\t{\n\t\tpublic boolean isSpaceChar(int ch);\n\t\t}\n\t}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "c8486ab24d854d51b12bea51f496164b", "src_uid": "f63fc2d97fd88273241fce206cc217f2", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) throws Exception {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n// InputReader in = new InputReader(new FileInputStream(\"/home/ahmad/Desktop/input.txt\"));\n PrintWriter out = new PrintWriter(outputStream);\n Main m = new Main();\n m.solve(in, out);\n out.close();\n }\n\n public void solve(InputReader in, PrintWriter out) {\n\n long n = in.nextLong();\n if (n == 0) {\n System.out.println(0);\n return;\n }\n ++n;\n if (n % 2 == 0) {\n System.out.println((n) / 2);\n } else {\n System.out.println(n);\n }\n\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) throws Exception {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public InputReader(File stream) throws Exception {\n reader = new BufferedReader(new FileReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n }\n}\n\n\n\n\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "39bb9b71f5731d1216257257ea0fe4a9", "src_uid": "236177ff30dafe68295b5d33dc501828", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class GoldenPlate {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int width = sc.nextInt();\n int length = sc.nextInt();\n int glidedRings = sc.nextInt();\n int totalGlidedRings = 0;\n\n for(int i = 1; i <= glidedRings; i++) {\n totalGlidedRings += 2 * (width - 4 * (i - 1) - 2) + 2 * (length - 4 * (i - 1));\n }\n\n System.out.print(totalGlidedRings);\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "3760cf5eb86e91769d45b4aa4b7d2638", "src_uid": "2c98d59917337cb321d76f72a1b3c057", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n/*\n * \tHeart beats fast\n * \t\tColors and promises\n * \t\t\tHow to be brave\n * \t\t\t\tHow can I love when I am afraid to fall...\n */\npublic class Main \n{\n\tstatic final long mod=1000000007;\n\tstatic final double eps=1e-8;\n\tstatic final long inf=100000000000000000L;\n\tstatic final boolean debug=true;\n\tstatic Reader in=new Reader();\n\tpublic static void main(String[] args) throws IOException\n\t{\n\t\tlong fibo[]=new long[100];\n\t\tfibo[0]=1;\n\t\tfibo[1]=2;\n\t\tfor(int i=2; i<100;i++)\n\t\t\tfibo[i]=fibo[i-1]+fibo[i-2];\n\t\tint x=ni(),y=ni();\n\t\tint j=0;\n\t\tfor(;j<100; j++)\n\t\t\tif(x<=fibo[j]*(y-1)+1)\n\t\t\t\tbreak;\n\t\tpr(j+2);\n\t\tSystem.out.println(ans);\n\t}\n\tstatic StringBuilder ans=new StringBuilder();\n\tstatic long powm(long a, long b, long m)\n\t{\n\t\tlong an=1;\n\t\tlong c=a;\n\t\twhile(b>0)\n\t\t{\n\t\t\tif(b%2==1)\n\t\t\t\tan=(an*c)%m;\n\t\t\tc=(c*c)%m;\n\t\t\tb>>=1;\n\t\t}\n\t\treturn an;\n\t}\n\tstatic void pd(){if(debug)ans.append(\"hola\");}\n\tstatic void pd(Object a){if(debug)ans.append(a+\"\\n\");}\n\tstatic void pr(Object a){ans.append(a+\"\\n\");}\n\tstatic void pr(){ans.append(\"\\n\");}\n\tstatic void p(Object a){ans.append(a);}\n\tstatic int ni(){return in.nextInt();}\n\tstatic long nl(){return in.nextLong();}\n\tstatic String ns(){return in.next();}\n\tstatic double nd(){return in.nextDouble();}\n\tstatic String pr(String a, long b)\n\t{\n\t\tString c=\"\";\n\t\twhile(b>0)\n\t\t{\n\t\t\tif(b%2==1)\n\t\t\t\tc=c.concat(a);\n\t\t\ta=a.concat(a);\n\t\t\tb>>=1;\n\t\t}\n\t\treturn c;\n\t}\n\tstatic class Reader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n public Reader() {\n reader = new BufferedReader(new InputStreamReader(System.in), 32768);\n tokenizer = null;\n }\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n public int nextInt() {\n return Integer.parseInt(next());\n }\n public long nextLong() {\n \treturn Long.parseLong(next());\n }\n public double nextDouble() {\n \treturn Double.parseDouble(next());\n }\n }\n}", "lang_cluster": "Java", "tags": ["math", "greedy"], "code_uid": "335b6e3d5e86ee58b202eeda27a264be", "src_uid": "8edf64f5838b19f9a8b19a14977f5615", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class C {\n\tFastReader scn;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\n\tvoid solve() {\n\t\tint n = scn.nextInt();\n\t\tchar[] arr = scn.next().toCharArray();\n\t\tint sum = 0;\n\t\tboolean allZero = true;\n\t\tfor(char ch : arr) {\n\t\t\tsum += ch - '0';\n\t\t\tif(ch != '0') {\n\t\t\t\tallZero = false;\n\t\t\t}\n\t\t}\n\t\tif(allZero) {\n\t\t\tout.println(\"YES\");\n\t\t\treturn;\n\t\t}\n\t\tboolean yes = false;\n\t\tfor (int i = 0; i < sum; i++) {\n\t\t\tboolean fail = false;\n\t\t\tint curr = 0;\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tint val = curr + arr[j] - '0';\n\t\t\t\tif (val > i) {\n\t\t\t\t\tfail = true;\n\t\t\t\t\tbreak;\n\t\t\t\t} else {\n\t\t\t\t\tcurr += arr[j] - '0';\n\t\t\t\t\tj++;\n\t\t\t\t\twhile(j < n && arr[j] == '0') {\n\t\t\t\t\t\tj++;\n\t\t\t\t\t}\n\t\t\t\t\tj--;\n\t\t\t\t\tif(curr == i) {\n\t\t\t\t\t\tcurr = 0;\n\t\t\t\t\t} else if(j == n - 1) {\n\t\t\t\t\t\tfail = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!fail) {\n\t\t\t\tyes = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif (yes) {\n\t\t\tout.println(\"YES\");\n\t\t} else {\n\t\t\tout.println(\"NO\");\n\t\t}\n\t}\n\n\tvoid run() throws Exception {\n\t\tlong time = System.currentTimeMillis();\n\t\tboolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\t\tout = new PrintWriter(System.out);\n\t\tscn = new FastReader(oj);\n\t\tsolve();\n\t\tout.flush();\n\t\tif (!oj) {\n\t\t\tSystem.out.println(Arrays.deepToString(new Object[] { System.currentTimeMillis() - time + \" ms\" }));\n\t\t}\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tnew C().run();\n\t}\n\n\tclass FastReader {\n\t\tInputStream is;\n\n\t\tpublic FastReader(boolean onlineJudge) {\n\t\t\tis = onlineJudge ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\t}\n\n\t\tbyte[] inbuf = new byte[1024];\n\t\tpublic int lenbuf = 0, ptrbuf = 0;\n\n\t\tint readByte() {\n\t\t\tif (lenbuf == -1)\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tif (ptrbuf >= lenbuf) {\n\t\t\t\tptrbuf = 0;\n\t\t\t\ttry {\n\t\t\t\t\tlenbuf = is.read(inbuf);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (lenbuf <= 0)\n\t\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn inbuf[ptrbuf++];\n\t\t}\n\n\t\tboolean isSpaceChar(int c) {\n\t\t\treturn !(c >= 33 && c <= 126);\n\t\t}\n\n\t\tint skip() {\n\t\t\tint b;\n\t\t\twhile ((b = readByte()) != -1 && isSpaceChar(b))\n\t\t\t\t;\n\t\t\treturn b;\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tchar nextChar() {\n\t\t\treturn (char) skip();\n\t\t}\n\n\t\tString next() {\n\t\t\tint b = skip();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\twhile (!(isSpaceChar(b))) { // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n\n\t\tString nextLine() {\n\t\t\tint b = skip();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\twhile ((!isSpaceChar(b) || b == ' ')) { // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n\n\t\tchar[] next(int n) {\n\t\t\tchar[] buf = new char[n];\n\t\t\tint b = skip(), p = 0;\n\t\t\twhile (p < n && !(isSpaceChar(b))) {\n\t\t\t\tbuf[p++] = (char) b;\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t\t}\n\n\t\tint nextInt() {\n\t\t\tint num = 0, b;\n\t\t\tboolean minus = false;\n\t\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t\t;\n\t\t\tif (b == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tb = readByte();\n\t\t\t}\n\n\t\t\twhile (true) {\n\t\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t\t} else {\n\t\t\t\t\treturn minus ? -num : num;\n\t\t\t\t}\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\tlong num = 0;\n\t\t\tint b;\n\t\t\tboolean minus = false;\n\t\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t\t;\n\t\t\tif (b == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tb = readByte();\n\t\t\t}\n\n\t\t\twhile (true) {\n\t\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t\t} else {\n\t\t\t\t\treturn minus ? -num : num;\n\t\t\t\t}\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t}\n\n\t\tchar[][] nextMatrix(int n, int m) {\n\t\t\tchar[][] map = new char[n][];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tmap[i] = next(m);\n\t\t\treturn map;\n\t\t}\n\n\t\tint[] nextIntArray(int n) {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\n\t\tlong[] nextLongArray(int n) {\n\t\t\tlong[] a = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n\n\t\tint[][] next2DInt(int n, int m) {\n\t\t\tint[][] arr = new int[n][];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tarr[i] = nextIntArray(m);\n\t\t\t}\n\t\t\treturn arr;\n\t\t}\n\n\t\tlong[][] next2DLong(int n, int m) {\n\t\t\tlong[][] arr = new long[n][];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tarr[i] = nextLongArray(m);\n\t\t\t}\n\t\t\treturn arr;\n\t\t}\n\n\t\tint[] shuffle(int[] arr) {\n\t\t\tRandom r = new Random();\n\t\t\tfor (int i = 1, j; i < arr.length; i++) {\n\t\t\t\tj = r.nextInt(i);\n\t\t\t\tarr[i] = arr[i] ^ arr[j];\n\t\t\t\tarr[j] = arr[i] ^ arr[j];\n\t\t\t\tarr[i] = arr[i] ^ arr[j];\n\t\t\t}\n\t\t\treturn arr;\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "7df9339686e7816bf06b886cb45bcea1", "src_uid": "410296a01b97a0a39b6683569c84d56c", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class ProblemC {\n static final long MOD = 1000000007;\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint l = sc.nextInt();\n\t\tint r = sc.nextInt();\n\t\tsc.close();\n\t\tlong[][] dp = new long[n + 1][3];\n\t\tint []k = new int[3];\n\t\tfor(int i = 0; i < 3; i++) {\n\t\t\tk[i] = (r - i + 3) / 3 - (l - i + 2) / 3;\n\t\t}\n\t\tdp[1][0] = k[0];\n\t\tdp[1][1] = k[1];\n\t\tdp[1][2] = k[2];\n\t\tfor(int i = 2; i <= n; i++) {\n\t\t\tdp[i][0] = dp[i-1][0] * k[0] + dp[i-1][1] * k[2] + dp[i-1][2] * k[1];\n\t\t\tdp[i][1] = dp[i-1][0] * k[1] + dp[i-1][1] * k[0] + dp[i-1][2] * k[2];\n\t\t\tdp[i][2] = dp[i-1][0] * k[2] + dp[i-1][1] * k[1] + dp[i-1][2] * k[0];\n\t\t\tdp[i][0] %= MOD;\n\t\t\tdp[i][1] %= MOD;\n\t\t\tdp[i][2] %= MOD;\n\t\t}\n\t\tSystem.out.println(dp[n][0]);\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics"], "code_uid": "c536ac3142b005aa509ef38e6f2f1a59", "src_uid": "4c4852df62fccb0a19ad8bc41145de61", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Scanner;\n\n/**\n * @author artyom\n */\npublic class Tetrahedron {\n\tprivate static final int MOD = 1_000_000_007;\n\n\tpublic static void main(String args[]) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint[] dp = new int[]{1, 1, 1, 0};\n\t\tfor (int i = 1; i < n; i++) {\n\t\t\tint t0 = (dp[1] + dp[2]) % MOD + dp[3];\n\t\t\tint t1 = (dp[0] + dp[2]) % MOD + dp[3];\n\t\t\tint t2 = (dp[0] + dp[1]) % MOD + dp[3];\n\t\t\tint t3 = (dp[0] + dp[1]) % MOD + dp[2];\n\t\t\tdp[0] = t0 % MOD;\n\t\t\tdp[1] = t1 % MOD;\n\t\t\tdp[2] = t2 % MOD;\n\t\t\tdp[3] = t3 % MOD;\n\t\t}\n\t\tSystem.out.println(dp[3]);\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "matrices", "dp"], "code_uid": "a2724f10d573f257c38a82c28db7b589", "src_uid": "77627cc366a22e38da412c3231ac91a8", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\npublic class Tshirt_Hunt {\n\tpublic static void main(String a[]){\n\t\tScanner s = new Scanner(System.in);\n\t\tint p = s.nextInt();\n\t\tint x = s.nextInt();\n\t\tint y = s.nextInt();\n\t\tint successful_hack = 0;\n\t\tboolean found = false;\n\t\tint k =0;\n\t\tint x1 = x;\n\t\twhile(x1 >= y){\n\t\t\tfound = got_Tshirt(x1,p);\n\t\t\tif(found){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tx1 = x1-50;\n\t\t}\n\t\tif(found == false){\n\t\t\twhile(true){\n\t\t\t\tx = x+50;\n\t\t\t\tk++;\n\t\t\t\tfound = got_Tshirt(x,p);\n\t\t\t\tif(found){\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(k%2 !=0){\n\t\t\t\tk = k+1;\n\t\t\t\tsuccessful_hack = k/2;\n\t\t\t}else{\n\t\t\t\tsuccessful_hack = k/2;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(successful_hack);\n\t}\t\n\t\t\n\tpublic static boolean got_Tshirt(int s,int p){\n\t\tboolean lucky = false;\n\t\tList<Integer> store = new ArrayList();\n\t\tint i = (s/50) % 475;\n\t\tfor(int j=1;j<26;j++){\n\t\t\ti = (i * 96 + 42) % 475;\n\t\t\tstore.add(26 + i);\n\t\t}\n\n\t\tlucky = store.contains(p);\n\t\treturn lucky;\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "3117227e12639094e4f455c9aed00649", "src_uid": "c9c22e03c70a94a745b451fc79e112fd", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "\n\n\n\n\n\n\n\n\n\nimport java.util.Scanner;\n\npublic class Main\n{\n public static void main(String args[])\n {\n\t Scanner s=new Scanner(System.in);\n\t int n=s.nextInt(),k=n;\n\t int m=s.nextInt();\n\t\n\t if(n>=m)\n\t {\n\t\t while(k>=m)\n\t\t {\n\t\t\t int x= k/m;\n\t\t\t k=k-x*m+x;\n\t\t\t n=n+x;\n\t\t }\n\t\t System.out.print(n);\n\t }\n\t else\n\t {\n\t\t System.out.print(n);\n\t }\n\t \n }\n \n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "implementation"], "code_uid": "f37b6ad4a7b56b28c9baba425f6cda27", "src_uid": "42b25b7335ec01794fbb1d4086aa9dd0", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.BufferedWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class A {\n private static BufferedReader in;\n private static StringTokenizer st;\n private static PrintWriter out;\n \n public static void main(String[] args) throws NumberFormatException, IOException {\n in = new BufferedReader(new InputStreamReader(System.in));\n st = new StringTokenizer(\"\");\n out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n int n = nextInt();\n int k = nextInt();\n int cnt = 0;\n while(k >= n){\n cnt++;\n if(k % n == 0) {\n// System.out.println(n + \" \" + k);\n k/=n;\n }else{\n System.out.println(\"NO\");\n return;\n }\n }\n if(k != 1){\n System.out.println(\"NO\");\n }else{\n System.out.println(\"YES\");\n System.out.println(cnt-1);\n }\n }\n \n\n static String next() throws IOException{\n while(!st.hasMoreTokens()){\n st = new StringTokenizer(in.readLine());\n }\n return st.nextToken();\n }\n static int nextInt() throws NumberFormatException, IOException{\n return Integer.parseInt(next());\n }\n static long nextLong() throws NumberFormatException, IOException{\n return Long.parseLong(next());\n }\n \n static double nextDouble() throws NumberFormatException, IOException{\n return Double.parseDouble(next());\n }\n\n}\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "ac584f957b09e0402327e447855268f6", "src_uid": "8ce89b754aa4080e7c3b2c3b10f4be46", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "\n\nimport java.io.*;\nimport java.util.*;\nimport java.math.*;\n\npublic class Main\n{\n\tBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\tStringTokenizer tokenizer=null;\n\t\n\tpublic static void main(String[] args) throws IOException\n\t{\n\t\tnew Main().execute();\n\t}\n\t\n\tvoid debug(Object...os)\n\t{\n\t\tSystem.out.println(Arrays.deepToString(os));\n\t}\n\t\n\tint ni() throws IOException\n\t{\n\t\treturn Integer.parseInt(ns());\n\t}\n\t\n\tlong nl() throws IOException \n\t{\n\t\treturn Long.parseLong(ns());\n\t}\n\t\n\tdouble nd() throws IOException \n\t{\n\t\treturn Double.parseDouble(ns());\n\t}\n\t\t\n\tString ns() throws IOException \n\t{\n\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) \n\t\t\ttokenizer = new StringTokenizer(br.readLine());\n\t\treturn tokenizer.nextToken();\n\t}\n\t\n\tString nline() throws IOException\n\t{\n\t\ttokenizer=null;\n\t\treturn br.readLine();\n\t}\n\t\t\n\t\n\n\t//Main Code starts Here\n\tint totalCases, testNum;\t\n\t\n\n\tvoid execute() throws IOException\n\t{\n\t\ttotalCases = 1;\n\t\tfor(testNum = 1; testNum <= totalCases; testNum++)\n\t\t{\n\t\t\tif(!input())\n\t\t\t\tbreak;\n\t\t\tsolve();\n\t\t}\n\t}\n\n\tvoid solve() throws IOException\n\t{\n\t\tint a = ni();\n\t\tint b = ni();\n\t\tint ans = a;\n\t\tfor(int i = a+1;;i++)\n\t\t{\n\t\t\tif(lucky(i) == b)\n\t\t\t{\n\t\t\t\tans = i;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t\t\n\t\t\n\t}\n\t\n\tint lucky(int a)\n\t{\n\t\tString s = String.valueOf(a);\n\t\tString f = \"0\";\n\t\tint n = s.length();\n\t\tfor(int i = 0;i<n;i++)\n\t\t{\n\t\t\tchar temp = s.charAt(i);\n\t\t\tif(temp == '4' || temp == '7')\n\t\t\t{\n\t\t\t\tf = f+temp;\n\t\t\t}\n\t\t}\n\t\treturn Integer.valueOf(f);\n\t}\n\t\t\n\t\t\n\t\n\tboolean input() throws IOException\n\t{\n\t\t\n\t\treturn true;\n\t}\n\n\n}\n\n\n", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "e93dc63a3cacc1c2deb805b540ef0360", "src_uid": "e5e4ea7a5bf785e059e10407b25d73fb", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// https://codeforces.com/problemset/problem/893/A\n\nimport java.util.Scanner;\n\npublic class Solution {\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner read = new Scanner(System.in);\n\t\t\n\t\tint n = read.nextInt();\n\t\t\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\ta[i] = read.nextInt();\n\t\t}\n\t\t\n\t\tif (a[0] == 3) {\n\t\t\tSystem.out.println(\"NO\");\n\t\t}\n\t\telse if (n == 1) {\n\t\t\tSystem.out.println(\"YES\");\n\t\t}\n\t\telse {\n\t\t\tint playerOne = a[0];\n\t\t\tint playerTwo = 3;\n\t\t\tint spectator = (a[0] == 1) ? 2 : 1;\n\n\t\t\tString result = \"YES\";\n\t\t\tfor (int i = 1; i < n; ++i) {\n\t\t\t\tif (spectator == a[i]) {\n\t\t\t\t\tresult = \"NO\";\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tplayerOne = a[i];\n\t\t\t\tplayerTwo = spectator;\n\t\t\t\tspectator = 6 - playerOne - playerTwo;\n\t\t\t}\n\t\t\t\n\t\t\tSystem.out.println(result);\n\t\t}\n\t\t\n\t\t// Close scanner\n\t\tread.close();\n\t}\n\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "20ac21656b79deb310f890ba7fe75d12", "src_uid": "6c7ab07abdf157c24be92f49fd1d8d87", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tnew Main();\n\t}\n\n\tpublic Main(){\n\t\t\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tsc.nextLine();\n\t\tString line = sc.nextLine();\n\t\t\n\t\tArrayList<Integer> temp = new ArrayList<Integer>();\n\t\t\n\t\tfor(int i = 0; i < line.length(); i++){\n\t\t\tint digit = Integer.parseInt(Character.toString(line.charAt(i)));\n\t\t\n\t\t\tint[] a = getSpecial(digit);\n\t\t\tfor(int q : a){\n\t\t\t\ttemp.add(q);\n\t\t\t}\n\t\t\n\t\t}\n\t\t\n\t\tCollections.sort(temp);\n\t\t\n\t\tString lol = \"\";\n\t\tfor(int i = temp.size()-1; i > -1; i--){\n\t\t\tlol += Integer.toString(temp.get(i));\n\t\t}\n\t\t\n\t\tSystem.out.println(lol);\n\t\t\n\t\t\n\t}\n\t\n\tpublic int[] getSpecial(int i) {\n\t\tswitch (i) {\n\t\tcase 0:\n\t\tcase 1:\n\t\t\treturn new int[] {};\n\t\tcase 2:\n\t\t\treturn new int[] { 2 };\n\t\tcase 3:\n\t\t\treturn new int[] { 3 };\n\t\tcase 4:\n\t\t\treturn new int[] { 3, 2, 2 };\n\t\tcase 5:\n\t\t\treturn new int[] { 5 };\n\t\tcase 6:\n\t\t\treturn new int[] { 5, 3 };\n\t\tcase 7:\n\t\t\treturn new int[] { 7 };\n\t\tcase 8:\n\t\t\treturn new int[] { 7, 2, 2, 2 };\n\t\tcase 9:\n\t\t\treturn new int[] { 7, 3, 3, 2 };\n\t\tdefault:\n\t\t\treturn null;\n\t\t}\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["math", "sortings", "greedy"], "code_uid": "2fb40864fbebfb70e53d9f067780a387", "src_uid": "60dbfc7a65702ae8bd4a587db1e06398", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.OptionalInt;\n/* * */\n\npublic class _127_A implements Runnable{\n public static void main(String[] args) {\n\t new Thread(null, new _127_A(),\"Main\",1<<27).start();\n }\n @Override\n public void run() {\n FastReader fd = new FastReader(System.in);\n PrintWriter out = new PrintWriter(System.out);\n String data = fd.next();\n int maxAscii = data.chars().max().getAsInt();\n for(int i = 0; i < data.length(); i++){\n if(data.charAt(i) == maxAscii){ out.print((char) maxAscii); }\n }\n out.println();\n out.close();\n }\n\n //Helper functions\n static void getArray(int[] data, boolean isSorted, FastReader fd){\n for(int i = 0; i < data.length; i++){ data[i] = fd.nextInt(); }\n if(isSorted) Arrays.sort(data);\n }\n static int gcd(int a, int b) {\n if (a == 0)\n return b;\n return gcd(b % a, a);\n }\n\n static int lcm(int a, int b) {\n return (a*b)/gcd(a, b);\n }\n\n static boolean checkDistinct(int next){// check all digits are distinct.\n\n String process = String.valueOf(next);\n for(int i = 0;i < process.length()-1; i++){\n String character = String.valueOf(process.charAt(i));\n if(process.substring(i+1).contains(character)){ return false; }\n }\n return true;\n }\n\n static int limit = (int) 1e7 + 1;\n static int[] facts = new int[limit];\n static void sieve() { // Store the minimum prime factors of 1 to LIMIT\n facts[1] = 1;\n for (int i = 2; i < limit; i++) {\n if (i % 2 == 0 && i > 2) {\n facts[i] = 2;\n } else {\n facts[i] = i;\n }\n }\n for (int i = 3; i * i < limit; i++) {\n if (facts[i] == i) {\n for (int j = i * i; j < limit; j += i)\n if (facts[j] == j)\n facts[j] = i;\n }\n }\n }\n static class FastReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private SpaceCharFilter filter;\n private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n public FastReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars==-1)\n throw new InputMismatchException();\n\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n }\n catch (IOException e) {\n throw new InputMismatchException();\n }\n\n if(numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n }\n catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n public int nextInt() {\n int c = read();\n\n while(isSpaceChar(c))\n c = read();\n\n int sgn = 1;\n\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n\n int res = 0;\n do {\n if(c<'0'||c>'9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n\n return res * sgn;\n }\n\n public long nextLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public double nextDouble() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n\n public String readString() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n }\n while (!isSpaceChar(c));\n\n return res.toString();\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public String next() {\n return readString();\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "binary search", "bitmasks", "greedy", "strings", "implementation"], "code_uid": "2d3c71a075fc438b5102e5e8cf7329d0", "src_uid": "9a40e9b122962a1f83b74ddee6246a40", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.math.*;\nimport java.util.*;\nimport java.util.stream.*;\n\n@SuppressWarnings(\"unchecked\")\npublic class P887B {\n\n public void run() throws Exception {\n int n = nextInt(), c [][] = new int [n][];\n for (int i = 0; i < n; c[i] = readInt(6), i++);\n\n BitSet nums = new BitSet();\n for (int i = 0; i < n; i++) {\n for (int ii = 0; ii < 6; ii++) {\n nums.set(c[i][ii]);\n \n if (n >= 2) {\n for (int j = 0; j < n; j++) {\n if (j != i) {\n for (int jj = 0; jj < 6; jj++) {\n nums.set(c[i][ii] * 10 + c[j][jj]);\n\n if (n >= 3) {\n for (int k = 0; k < n; k++) {\n if ((k != i) && (k != j)) {\n for (int kk = 0; kk < 6; kk++) {\n nums.set(c[i][ii] * 100 + c[j][jj] * 10 + c[k][kk]);\n }\n }\n }\n }\n }\n }\n }\n }\n }\n }\n\n println(nums.nextClearBit(1) - 1);\n }\n\n public static void main(String... args) throws Exception {\n br = new BufferedReader(new InputStreamReader(System.in));\n pw = new PrintWriter(new BufferedOutputStream(System.out));\n new P887B().run();\n br.close();\n pw.close();\n System.err.println(\"\\n[Time : \" + (System.currentTimeMillis() - startTime) + \" ms]\");\n }\n\n static long startTime = System.currentTimeMillis();\n static BufferedReader br;\n static PrintWriter pw;\n StringTokenizer stok;\n\n String nextToken() throws IOException {\n while (stok == null || !stok.hasMoreTokens()) {\n String s = br.readLine();\n if (s == null) { return null; }\n stok = new StringTokenizer(s);\n }\n return stok.nextToken();\n }\n\n void print(byte b) { print(\"\" + b); }\n void print(int i) { print(\"\" + i); }\n void print(long l) { print(\"\" + l); }\n void print(double d) { print(\"\" + d); }\n void print(char c) { print(\"\" + c); }\n void print(Object o) {\n if (o instanceof int[]) { print(Arrays.toString((int [])o));\n } else if (o instanceof long[]) { print(Arrays.toString((long [])o));\n } else if (o instanceof char[]) { print(Arrays.toString((char [])o));\n } else if (o instanceof byte[]) { print(Arrays.toString((byte [])o));\n } else if (o instanceof short[]) { print(Arrays.toString((short [])o));\n } else if (o instanceof boolean[]) { print(Arrays.toString((boolean [])o));\n } else if (o instanceof float[]) { print(Arrays.toString((float [])o));\n } else if (o instanceof double[]) { print(Arrays.toString((double [])o));\n } else if (o instanceof Object[]) { print(Arrays.toString((Object [])o));\n } else { print(\"\" + o); }\n }\n void print(String s) { pw.print(s); }\n void println() { println(\"\"); }\n void println(byte b) { println(\"\" + b); }\n void println(int i) { println(\"\" + i); }\n void println(long l) { println(\"\" + l); }\n void println(double d) { println(\"\" + d); }\n void println(char c) { println(\"\" + c); }\n void println(Object o) { print(o); println(); }\n void println(String s) { pw.println(s); }\n int nextInt() throws IOException { return Integer.parseInt(nextToken()); }\n long nextLong() throws IOException { return Long.parseLong(nextToken()); }\n double nextDouble() throws IOException { return Double.parseDouble(nextToken()); }\n char nextChar() throws IOException { return (char) (br.read()); }\n String next() throws IOException { return nextToken(); }\n String nextLine() throws IOException { return br.readLine(); }\n int [] readInt(int size) throws IOException {\n int [] array = new int [size];\n for (int i = 0; i < size; i++) { array[i] = nextInt(); }\n return array;\n }\n long [] readLong(int size) throws IOException {\n long [] array = new long [size];\n for (int i = 0; i < size; i++) { array[i] = nextLong(); }\n return array;\n }\n double [] readDouble(int size) throws IOException {\n double [] array = new double [size];\n for (int i = 0; i < size; i++) { array[i] = nextDouble(); }\n return array;\n }\n String [] readLines(int size) throws IOException {\n String [] array = new String [size];\n for (int i = 0; i < size; i++) { array[i] = nextLine(); }\n return array;\n }\n\n int gcd(int a, int b) {\n if (a == 0) return Math.abs(b); if (b == 0) return Math.abs(a);\n a = Math.abs(a); b = Math.abs(b);\n int az = Integer.numberOfTrailingZeros(a), bz = Integer.numberOfTrailingZeros(b);\n a >>>= az; b >>>= bz;\n while (a != b) {\n if (a > b) { a -= b; a >>>= Integer.numberOfTrailingZeros(a); }\n else { b -= a; b >>>= Integer.numberOfTrailingZeros(b); }\n }\n return (a << Math.min(az, bz));\n }\n\n long gcd(long a, long b) {\n if (a == 0) return Math.abs(b); if (b == 0) return Math.abs(a);\n a = Math.abs(a); b = Math.abs(b);\n int az = Long.numberOfTrailingZeros(a), bz = Long.numberOfTrailingZeros(b);\n a >>>= az; b >>>= bz;\n while (a != b) {\n if (a > b) { a -= b; a >>>= Long.numberOfTrailingZeros(a); }\n else { b -= a; b >>>= Long.numberOfTrailingZeros(b); }\n }\n return (a << Math.min(az, bz));\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "5e93412cfc4b00e2544cfd97f9200663", "src_uid": "20aa53bffdfd47b4e853091ee6b11a4b", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\n\t\tPrintWriter pw=new PrintWriter(System.out);\n\t\twhile(sc.hasNext()){\n\t\t\tlong n=sc.nextLong();\n\t\t\tlong m=sc.nextLong();\n\t\t\tlong k=sc.nextLong();\n\t\t\tlong mod=1000000007;\n\t\t\tlong res=1;\n\t\t\tlong a=n-1;\n\t\t\tlong base=2;\n\t\t\twhile(a>0){\n\t\t\t\tif(a%2!=0)res=(res%mod*base)%mod;\n\t\t\t\ta/=2;\n\t\t\t\tbase=(base*base)%mod;\n\t\t\t}\n\t\t\ta=m-1;\n\t\t\tbase=res;\n\t\t\tres=1;\n\t\t\twhile(a>0){\n\t\t\t\tif(a%2!=0)res=(res%mod*base)%mod;\n\t\t\t\ta/=2;\n\t\t\t\tbase=(base*base)%mod;\n\t\t\t}\n\t\t\tif((n&1)!=(m&1)&&k==-1)res=0;\n\t\t\tpw.println(res);\n\t\t\tpw.flush();\n\t\t}\n\n\t}\n}\n\nclass FastScanner {\n\tBufferedReader br;\n\tStringTokenizer st;\n\n\tpublic FastScanner() {\n\t\ttry {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in),32768);\n\t\t\tst = new StringTokenizer(\"\");\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}\n\n\tpublic boolean hasNext() {\n\t\twhile (!st.hasMoreTokens()) {\n\t\t\tString line = nextLine();\n\t\t\tif (line == null) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tst = new StringTokenizer(line);\n\t\t}\n\t\treturn true;\n\t}\n\n\tpublic String next() {\n\t\twhile(!st.hasMoreTokens()){\n\t\t\tst=new StringTokenizer(nextLine());\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tpublic int nextInt() {\n\t\treturn Integer.parseInt(next());\n\t}\n\n\tpublic long nextLong() {\n\t\treturn Long.parseLong(next());\n\t}\n\n\tpublic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n\n\tpublic String nextLine() {\n\t\tString line = \"\";\n\t\ttry {\n\t\t\tline = br.readLine();\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t\treturn line;\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "constructive algorithms", "combinatorics", "number theory"], "code_uid": "9cab495ee00d1c3b4eebd04176c604b4", "src_uid": "6b9eff690fae14725885cbc891ff7243", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.math.*;\nimport java.util.*;\n \npublic class practice {\n\tstatic class Reader \n { \n final private int BUFFER_SIZE = 1 << 16; \n private DataInputStream din; \n private byte[] buffer; \n private int bufferPointer, bytesRead; \n \n public Reader() \n { \n din = new DataInputStream(System.in); \n buffer = new byte[BUFFER_SIZE]; \n bufferPointer = bytesRead = 0; \n } \n \n public Reader(String file_name) throws IOException \n { \n din = new DataInputStream(new FileInputStream(file_name)); \n buffer = new byte[BUFFER_SIZE]; \n bufferPointer = bytesRead = 0; \n } \n \n public String readLine() throws IOException \n { \n byte[] buf = new byte[100001]; // line length \n int cnt = 0, c; \n while ((c = read()) != -1) \n { \n if (c == '\\n') \n break; \n buf[cnt++] = (byte) c; \n } \n return new String(buf, 0, cnt); \n } \n \n public int nextInt() throws IOException \n { \n int ret = 0; \n byte c = read(); \n while (c <= ' ') \n c = read(); \n boolean neg = (c == '-'); \n if (neg) \n c = read(); \n do\n { \n ret = ret * 10 + c - '0'; \n } while ((c = read()) >= '0' && c <= '9'); \n \n if (neg) \n return -ret; \n return ret; \n } \n \n public long nextLong() throws IOException \n { \n long ret = 0; \n byte c = read(); \n while (c <= ' ') \n c = read(); \n boolean neg = (c == '-'); \n if (neg) \n c = read(); \n do { \n ret = ret * 10 + c - '0'; \n } \n while ((c = read()) >= '0' && c <= '9'); \n if (neg) \n return -ret; \n return ret; \n } \n \n public double nextDouble() throws IOException \n { \n double ret = 0, div = 1; \n byte c = read(); \n while (c <= ' ') \n c = read(); \n boolean neg = (c == '-'); \n if (neg) \n c = read(); \n \n do { \n ret = ret * 10 + c - '0'; \n } \n while ((c = read()) >= '0' && c <= '9'); \n \n if (c == '.') \n { \n while ((c = read()) >= '0' && c <= '9') \n { \n ret += (c - '0') / (div *= 10); \n } \n } \n \n if (neg) \n return -ret; \n return ret; \n } \n \n private void fillBuffer() throws IOException \n { \n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE); \n if (bytesRead == -1) \n buffer[0] = -1; \n } \n \n private byte read() throws IOException \n { \n if (bufferPointer == bytesRead) \n fillBuffer(); \n return buffer[bufferPointer++]; \n } \n \n public void close() throws IOException \n { \n if (din == null) \n return; \n din.close(); \n } \n }\n\tpublic static void debug(int[][] arr) {\n\t\tint r = arr.length;\n\t\tint c = arr[0].length;\n\t\tint i,j;\n\t\tfor(i=0;i<r;++i) {\n\t\t\tfor(j=0;j<c;++j) System.err.print(arr[i][j]+\" \");\n\t\t\tSystem.err.println();\n\t\t}\n\t}\n\tpublic static void debug(long[][] arr) {\n\t\tint r = arr.length;\n\t\tint c = arr[0].length;\n\t\tint i,j;\n\t\tfor(i=0;i<r;++i) {\n\t\t\tfor(j=0;j<c;++j) System.err.print(arr[i][j]+\" \");\n\t\t\tSystem.err.println();\n\t\t}\n\t}\n\tpublic static void debug(int ...var) {\n\t\tfor(int i:var) System.err.print(i+\" \");\n\t\tSystem.err.println();\n\t}\n\tpublic static void debug(String ...var) {\n\t\tfor(String i:var) System.err.print(i+\" \");\n\t\tSystem.err.println();\n\t}\n\tpublic static void debug(double ...var) {\n\t\tfor(double i:var) System.err.print(i+\" \");\n\t\tSystem.err.println();\n\t}\n\t\n\tpublic static void debug(long ...var) {\n\t\tfor(long i:var) System.err.print(i+\" \");\n\t\tSystem.err.println();\n\t}\n\n public static void main(String args[]) throws Exception{\n //Reader scan = new Reader();\n //be careful of readLine() length of string;\n Scanner scan = new Scanner(System.in);\n\t\t//scan.useDelimiter(\"\"); // for reading character by character\n\n int[] colors = new int[26];\n int n = scan.nextInt();\n int k = scan.nextInt();\n String s = scan.next();\n for(int i=0;i<n;++i) {\n char c = s.charAt(i);\n int index = c-'a';\n ++colors[index];\n if(colors[index]>k) {\n System.out.println(\"NO\");\n return;\n }\n }\n System.out.println(\"YES\");\n scan.close();\n\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "31e914e21fdf25f68521d443fd4684e7", "src_uid": "ceb3807aaffef60bcdbcc9a17a1391be", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// practice with rainboy\nimport java.io.*;\nimport java.util.*;\n\npublic class CF571A extends PrintWriter {\n\tCF571A() { super(System.out, true); }\n\tScanner sc = new Scanner(System.in);\n\tpublic static void main(String[] $) {\n\t\tCF571A o = new CF571A(); o.main(); o.flush();\n\t}\n\n\tlong count2(int h) {\n\t\treturn h % 2 == 1 ? (long) (h + 1) / 2 * ((h + 1) / 2 + 1)\n\t\t\t: (long) (h / 2 + 1) * (h / 2 + 1);\n\t}\n\tlong count1(int h, int r) {\n\t\treturn count2(h) - (r >= h ? 0 : count2(h - 1 - r));\n\t}\n\tlong count(int h, int k, int r) {\n\t\treturn count1(h, r) - (k == 0 ? 0 : count1(k - 1, r));\n\t}\n\tlong solve(int a, int b, int c, int h) {\n\t\tif (a + 1 > b + c + h)\n\t\t\treturn 0;\n\t\tint k = a + 1 <= b + c ? 0 : a + 1 - (b + c);\n\t\tint l = 1 - a - (c - b);\n\t\tint r = a - 1 - (c - b);\n\t\tif (l >= 0)\n\t\t\treturn count(h, k, r) - (l == 0 ? 0 : count(h, k, l - 1));\n\t\tif (r <= 0) {\n\t\t\tr = -r; l = -l;\n\t\t\treturn count(h, k, l) - (r == 0 ? 0 : count(h, k, r - 1));\n\t\t}\n\t\treturn count(h, k, -l) + count(h, k, r) - count(h, k, 0);\n\t}\n\tvoid main() {\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\tint l = sc.nextInt();\n\t\tlong ans = 0;\n\t\tfor (int l_ = 0; l_ <= l; l_++)\n\t\t\tans += solve(a + l_, b, c, l - l_);\n\t\tprintln(ans);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation", "combinatorics"], "code_uid": "2f7fc79569d58ca9bd56d35551440db0", "src_uid": "185ff90a8b0ae0e2b75605f772589410", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class C implements Runnable{\n \n BufferedReader in;\n PrintWriter out;\n StringTokenizer Tokenizer;\n \n private void solve() throws IOException{\n int n = NextInt();\n long res = 1000000000;\n res*=1000000;\n long es1 = n;\n es1 = (es1+1)*9;\n for(int i = (int)Math.cbrt(n); i>0; i--)\n if (n%i == 0){\n int m = n/i;\n for(int j = (int)Math.sqrt(m); j>=i; j--)\n if(m%j==0){\n int k = m/j;\n if (k<j) continue;\n long res1 = i+1;\n res1 = res1*(j+2);\n res1 = res1*(k+2);\n res1-=n;\n if (res1<res) res = res1;\n }\n }\n out.print(res);\n out.print(\" \");\n out.println(es1-n);\n }\n \n public static String removeCharAt(String s, int pos) {\n StringBuffer buf = new StringBuffer( s.length() - 1 );\n buf.append( s.substring(0,pos) ).append( s.substring(pos+1) );\n return buf.toString();\n }\n \n public void run(){\n try{\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n solve();\n in.close();\n out.close();\n } catch (Exception e){\n System.out.println(e.getMessage());\n }\n }\n \n int NextInt() throws IOException{\n return Integer.parseInt(NextToken());\n }\n \n long NextLong() throws IOException{\n return Long.parseLong(NextToken());\n }\n \n double NextDouble() throws IOException{\n return Double.parseDouble(NextToken());\n }\n String str(int x){\n return Integer.toString(x);\n }\n \n String NextToken() throws IOException{\n while(Tokenizer == null || !Tokenizer.hasMoreTokens()){\n Tokenizer = new StringTokenizer(in.readLine());\n }\n return Tokenizer.nextToken();\n }\n \n public static void main(String[] args){\n new C().run();\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "9ce3137892edc93b337617a75f6b6d81", "src_uid": "2468eead8acc5b8f5ddc51bfa2bd4fb7", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author El-Bishoy\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n Task_random_1 solver = new Task_random_1();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class Task_random_1 {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n\n int x = in.nextInt(), y = in.nextInt();\n\n //check if good root print black// else continue the code\n\n\n double ff = (Math.pow(x, 2) + Math.pow(y, 2));\n double h = Math.sqrt(ff);\n int g = (int) Math.sqrt(ff);\n\n if (h == g) {\n out.println(\"black\");\n return;\n }\n\n boolean even = false;\n if (g % 2 == 0)\n even = true;\n\n if ((x > 0 && y > 0) || (x < 0 && y < 0)) {\n //q1,3 starts with white\n if (!even) out.println(\"white\");\n else out.println(\"black\");\n }\n else if ((x > 0 && y < 0) || (x < 0 && y > 0)) {\n //q2,4\n if (even) out.println(\"white\");\n else out.println(\"black\");\n }\n\n else {\n out.println(\"black\");\n }\n\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void print(Object... objects) {\n for (int i = 0; i < objects.length; i++) {\n if (i != 0) {\n writer.print(' ');\n }\n writer.print(objects[i]);\n }\n }\n\n public void println(Object... objects) {\n print(objects);\n writer.println();\n }\n\n public void close() {\n writer.close();\n }\n\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "geometry", "constructive algorithms", "implementation"], "code_uid": "318752f5978cea93fda785bd5c83baae", "src_uid": "8c92aac1bef5822848a136a1328346c6", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.awt.Point;\nimport java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n\nimport static java.lang.Math.*;\n\npublic class AC {\n \n //solve by Fdg (it's good solve)\n \n int [][][][] d;\n int l;\n char [] c ;\n public void solve() throws IOException {\n \n c = in.readLine().toCharArray();\n int n = readInt();\n l = c.length;\n d = new int [202][l+2][n+2][2]; \n for (int i =0; i<202;i++){\n for (int j =0; j<l+2;j++){\n for(int k = 0; k<n+2; k++){\n for (int q = 0; q<2; q++){\n d[i][j][k][q] = -1;\n }\n }\n }\n }\n out.print(rec(100,0,n,0));\n }\n \n int rec (int pos,int step,int left,int cource ){\n \n if(d[pos][step][left][cource]!=-1) {\n return d[pos][step][left][cource];\n }\n if (step==l){\n if ((left&1)>0){\n return 0;\n }\n return abs(pos-100);\n }\n int way=0;\n if (cource==0){\n way++;\n }\n else way--; \n int ans = 0;\n if (c[step]=='F'){\n ans = max(ans,rec(pos+way,step+1,left,cource));\n }\n if (c[step] == 'T'){\n ans = max(ans,rec(pos,step+1,left,cource^1));\n }\n if (left>0){\n if (c[step]=='F'){\n ans = max(ans,rec(pos,step+1,left-1,cource^1));\n }\n if (c[step]=='T'){\n ans = max(ans,rec(pos+way,step+1,left-1,cource));\n }\n }\n return d[pos][step][left][cource] = ans;\n \n \n }\n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n // ===========================================================================\n final boolean ONLINE_JUDGE = System.getProperty(\"ONLINE_JUDGE\") != null;\n BufferedReader in;\n PrintWriter out;\n StringTokenizer tok = new StringTokenizer(\"\");\n\n void init() throws FileNotFoundException {\n if (ONLINE_JUDGE) {\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n } else {\n in = new BufferedReader(new FileReader(\"input.txt\"));\n out = new PrintWriter(\"output.txt\");\n }\n }\n\n String readString() throws IOException {\n while (!tok.hasMoreTokens()) {\n tok = new StringTokenizer(in.readLine());\n }\n return tok.nextToken();\n }\n\n int readInt() throws IOException {\n return Integer.parseInt(readString());\n }\n\n long readLong() throws IOException {\n return Long.parseLong(readString());\n }\n\n double readDouble() throws IOException {\n return Double.parseDouble(readString());\n }\n\n public static void main(String[] args) {\n new AC().run();\n }\n\n public void run() {\n try {\n long t1 = System.currentTimeMillis();\n init();\n solve();\n out.close();\n long t2 = System.currentTimeMillis();\n System.err.println(\"Time = \" + (t2 - t1));\n } catch (Exception e) {\n e.printStackTrace(System.err);\n System.exit(-1);\n }\n }\n\n}", "lang_cluster": "Java", "tags": ["dp", "implementation"], "code_uid": "9ed642b1b80be254a1c7da80c14a9ece", "src_uid": "4a54971eb22e62b1d9e6b72f05ae361d", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.util.Arrays;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.math.BigInteger;\nimport java.io.InputStream;\n\n\npublic class A123 {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n CodeA123 solver = new CodeA123();\n solver.solve(1, in, out);\n out.close();\n }\n}\n\nclass CodeA123\n{\npublic void solve(int testNumber, InputReader in, PrintWriter out)\n{\n\tint d=in.nextInt();\n\tint s=in.nextInt();\n\tint t=in.nextInt();\n\tint D=d*t;\n\tint T=0;\n\tif(D%s==0)\n\t{\n\t\tT=D/s;\n\t}\n\telse\n\t{\n\t\tT=D/s+1;\n\t}\n\tout.println(T-t);\n}\n\n}\n\n\n\n\n\n\nclass InputReader {\n private BufferedReader reader;\n private StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream));\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\tpublic void inputShuffleArrayInt(int arr[])\n\t{\n\t\tint l=arr.length;\n\t\tfor(int i=0;i<l;i++)\n\t\t{\n\t\t\tif(i%2==0)\n\t\t\t{\n\t\t\t\tarr[i/2]=nextInt();\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tarr[l-((i+1)/2)]=nextInt();\n\t\t\t}\n\t\t}\n\t}\n\n }", "lang_cluster": "Java", "tags": ["brute force", "math", "binary search"], "code_uid": "6a2aa32cfa15348efa8990c106f55083", "src_uid": "7dd098ec3ad5b29ad681787173eba341", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.*;\nimport java.util.List.*;\n\npublic class Test {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\t//ApplicationContext con = new ClassPathXmlApplicationContext(\"bean.xml\");\n\t\tFastReader reader = new FastReader();\n\t\tint n = reader.nextInt();\n\t\tSet<Integer> set = new HashSet<Integer>();\n\t\t\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint a = reader.nextInt();\n\t\t\tif(a!=0){\n\t\t\t\tset.add(a);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(set.size());\n\t\t\n\t}\n\n}\nclass FastReader {\n\n BufferedReader br;\n StringTokenizer st;\n\n public FastReader() {\n br = new BufferedReader(new InputStreamReader(System.in));\n\n }\n\n public String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n}\n", "lang_cluster": "Java", "tags": ["sortings", "implementation"], "code_uid": "1cf89ed8a0c8ad869afd742c8eaab087", "src_uid": "3b520c15ea9a11b16129da30dcfb5161", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n\n static MyScanner sc;\n private static PrintWriter out;\n static long M2 = 1_000_000_000L + 7;\n\n private static HashMap<Long, Long>[] mods;\n\n public static void main(String[] s) throws Exception {\n StringBuilder stringBuilder = new StringBuilder();\n if (stringBuilder.length() == 0) {\n sc = new MyScanner(System.in);\n } else {\n sc = new MyScanner(new BufferedReader(new StringReader(stringBuilder.toString())));\n }\n\n out = new PrintWriter(new OutputStreamWriter(System.out));\n\n initData();\n solve();\n out.flush();\n }\n\n private static void initData() {\n\n\n }\n\n static long[] fact = new long[5001];\n\n static {\n fact[0] = 1;\n for (int i = 1; i < fact.length; i++) {\n fact[i] = (fact[i - 1] * i) % 998_244_353;\n }\n }\n\n private static void solve() throws IOException {\n int n1 = sc.nextInt();\n int n2 = sc.nextInt();\n int n3 = sc.nextInt();\n long[][] r1 = new long[5001][5001];\n for (int i = 0; i < r1.length; i++) {\n r1[i][0] = 1;\n for (int k = 1; k <= i; k++) {\n r1[i][k] = r1[i - 1][k] + r1[i - 1][k - 1];\n r1[i][k] %= 998_244_353;\n }\n }\n\n long res = 1;\n res *= mm(n1, n2, r1);\n res %= 998_244_353;\n res *= mm(n1, n3, r1);\n res %= 998_244_353;\n res *= mm(n3, n2, r1);\n out.println(res % 998_244_353);\n }\n\n private static long mm(int n1, int n3, long[][] r1) {\n long res = 0;\n for (int i = 0; i <= Math.min(n1, n3); i++) {\n long cur = r1[n3][i] * r1[n1][i];\n cur %= 998_244_353;\n cur *= fact[i];\n cur %= 998_244_353;\n res += cur;\n res %= 998_244_353;\n }\n return res;\n }\n\n private static boolean solve(int n, int p, int p1, int i) {\n return false;\n }\n\n\n private static boolean isset(long i, int k) {\n return (i & (1 << k)) > 0;\n }\n\n private static void solveT() throws IOException {\n int t = sc.nextInt();\n while (t-- > 0) {\n solve();\n }\n }\n\n\n private static long gcd(long l, long l1) {\n if (l > l1) return gcd(l1, l);\n if (l == 0) return l1;\n return gcd(l1 % l, l);\n }\n\n private static long pow(long a, long b, long m) {\n if (b == 0) return 1;\n if (b == 1) return a;\n long pp = pow(a, b / 2, m);\n pp *= pp;\n pp %= m;\n return (pp * (b % 2 == 0 ? 1 : a)) % m;\n }\n\n\n static class MyScanner {\n BufferedReader br;\n StringTokenizer st;\n\n MyScanner(BufferedReader br) {\n this.br = br;\n }\n\n public MyScanner(InputStream in) {\n this(new BufferedReader(new InputStreamReader(in)));\n }\n\n void findToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n }\n\n String next() {\n findToken();\n return st.nextToken();\n }\n\n Integer[] nab(int n) {\n Integer[] k = new Integer[n];\n for (int i = 0; i < n; i++) {\n k[i] = sc.fi();\n }\n return k;\n }\n\n int[] na(int n) {\n int[] k = new int[n];\n for (int i = 0; i < n; i++) {\n k[i] = sc.fi();\n }\n return k;\n }\n\n long[] nl(int n) {\n long[] k = new long[n];\n for (int i = 0; i < n; i++) {\n k[i] = sc.nextLong();\n }\n return k;\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n int fi() {\n String t = next();\n int cur = 0;\n boolean n = t.charAt(0) == '-';\n for (int a = n ? 1 : 0; a < t.length(); a++) {\n cur = cur * 10 + t.charAt(a) - '0';\n }\n return n ? -cur : cur;\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n }\n\n\n}", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics"], "code_uid": "0bd34ad06643b157c72493b0f8264e36", "src_uid": "b6dc5533fbf285d5ef4cf60ef6300383", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\n\n\n\npublic class Main {\n\n \n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String s = sc.next();\n int ans = 0;\n int a = 1;\n for(int i=0;i<s.length();i++){\n if(s.charAt(i)=='A'||s.charAt(i)=='E'||s.charAt(i)=='I'||s.charAt(i)=='O'||s.charAt(i)=='U'||s.charAt(i)=='Y'){\n ans = Math.max(a, ans);\n a=1;\n }else{\n a++;\n }\n }\n ans = Math.max(a, ans);\n System.out.println(ans);\n }\n\n \n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "f89924c080c3e94601688ccb7012c0e2", "src_uid": "1fc7e939cdeb015fe31f3cf1c0982fee", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\tboolean eof;\n\n\tpublic String nextToken() {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (Exception e) {\n\t\t\t\teof = true;\n\t\t\t\treturn \"-1\";\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tpublic int nextInt() {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tBufferedReader br;\n\tStringTokenizer st;\n\tPrintWriter out;\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\n\tvoid run() {\n\t\ttry {\n\t\t\ttry {\n\t\t\t\tFile f = new File(\"input.txt\");\n\t\t\t\tif (f.exists()) {\n\t\t\t\t\tbr = new BufferedReader(new FileReader(\"input.txt\"));\n\t\t\t\t\tout = new PrintWriter(new FileWriter(\"output.txt\"));\n\t\t\t\t} else {\n\t\t\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t\t\t\tout = new PrintWriter(new OutputStreamWriter(System.out));\n\t\t\t\t}\n\t\t\t} catch (Throwable e) {\n\t\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t\t\tout = new PrintWriter(new OutputStreamWriter(System.out));\n\t\t\t}\n\n\t\t\tsolve();\n\t\t\tbr.close();\n\t\t\tout.close();\n\t\t} catch (Throwable e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(1);\n\t\t}\n\t}\n\n\tvoid solve() {\n\t\tint n = nextInt();\n\t\tlong[] a = new long[] { 1, 18, 1800, 670320, 734832000, 890786230,\n\t\t\t\t695720788, 150347555 };\n\t\tif (n % 2 == 0){\n\t\t\tout.print(0);\n\t\t}else{\n\t\t\tout.print(a[n / 2]);\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "bitmasks", "meet-in-the-middle", "implementation"], "code_uid": "b3bc8ef70235126f882ce6056f559a97", "src_uid": "a6a804ce23bc48ec825c17d64ac0bb69", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class ETry implements Runnable {\n\n BufferedReader in;\n PrintWriter out;\n StringTokenizer tok;\n\n public static void main(String[] args) {\n new ETry().run();\n }\n\n @Override\n public void run() {\n try {\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n \n Locale.setDefault(Locale.US);\n tok = new StringTokenizer(\"\");\n solve();\n in.close();\n out.close();\n } catch (Throwable t) {\n t.printStackTrace(System.err);\n System.exit(-1);\n }\n }\n\n String readString() throws IOException {\n while (!tok.hasMoreTokens()) {\n tok = new StringTokenizer(in.readLine());\n }\n return tok.nextToken();\n }\n\n int readInt() throws IOException {\n return Integer.parseInt(readString());\n }\n\n long readLong() throws IOException {\n return Long.parseLong(readString());\n }\n\n double readDouble() throws IOException {\n return Double.parseDouble(readString());\n }\n\n\n // solution\n\n class Point {\n long x, y;\n int i;\n\n public Point(long x, long y, int i) {\n this.x = x;\n this.y = y;\n this.i = i;\n }\n\n @Override\n public String toString() {\n return String.format(\"[(%d %d) %d]\", x, y, i);\n }\n\n }\n\n class PointComparator implements Comparator<Point> {\n Point root;\n\n public PointComparator(Point root) {\n this.root = root;\n }\n\n @Override\n public int compare(Point a, Point b) {\n long wp = (a.x - root.x) * (b.y - root.y) - (a.y - root.y) * (b.x - root.x);\n if (wp < 0)\n return -1;\n if (wp > 0)\n return 1;\n return 0;\n }\n\n }\n\n int n;\n List<Integer>[] graph;\n int[] size;\n int[] parent;\n Point[] points;\n int[] ans;\n\n void solve() throws IOException {\n n = readInt();\n // читаем граф\n graph = new List[n];\n for (int i = 0; i < n; i++) {\n graph[i] = new ArrayList<Integer>();\n }\n for (int i = 0; i < n - 1; i++) {\n int x = readInt() - 1;\n int y = readInt() - 1;\n graph[x].add(y);\n graph[y].add(x);\n }\n \n // читаем точки\n points = new Point[n];\n for (int i = 0; i < n; i++) {\n points[i] = new Point(readLong(), readLong(), i);\n }\n\n // подвешиваем дерево и \n size = new int[n];\n parent = new int[n];\n dfs(0, -1);\n \n // считаем ответ\n ans = new int[n];\n Arrays.fill(ans, -1);\n \n // ищем самый левый\n int rootIndex = 0;\n for (int i = 1; i < n; i++) {\n if (points[i].x < points[rootIndex].x || points[i].x == points[rootIndex].x\n && points[i].y < points[rootIndex].y) {\n rootIndex = i;\n }\n }\n \n // ставим самый левый первым\n Point tmp = points[0];\n points[0] = points[rootIndex];\n points[rootIndex] = tmp;\n \n \n // считаем\n rec(0, 0, n - 1);\n \n // ответ\n for (int i = 0; i < n; i++) {\n if (ans[i] == -1) {\n throw new RuntimeException(\"Answer is wrong\");\n }\n }\n for (int i = 0; i < n; i++) {\n out.print(ans[i] + 1);\n if (i == n - 1) {\n out.println();\n } else {\n out.print(\" \");\n }\n }\n }\n\n private void rec(int x, int left, int right) {\n ans[points[left].i] = x;\n Arrays.sort(points, left + 1, right + 1, new PointComparator(points[left]));\n int i = left + 1;\n for (int y : graph[x]) {\n if (y != parent[x]) {\n rec(y, i, i + size[y] - 1);\n i += size[y];\n }\n }\n }\n\n private void dfs(int x, int p) {\n parent[x] = p;\n size[x] = 1;\n for (int y : graph[x]) {\n if (y != p) {\n dfs(y, x);\n size[x] += size[y];\n }\n }\n }\n\n}", "lang_cluster": "Java", "tags": ["dfs and similar", "geometry", "constructive algorithms", "trees"], "code_uid": "e12fb768c20be6fa6878352fae2e7be6", "src_uid": "d65e91dc274c6659cfdb50bc8b8020ba", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Scanner;\n\n\npublic class A {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n char[][][] cs = new char[20][8][8];\n for(int i = 0; i < 8; i++) {\n cs[0][i] = sc.next().toCharArray();\n }\n \n for(int i = 0; i < 19; i++) {\n for(int y = 0; y < 8; y++)\n for(int x = 0; x < 8; x++)\n if(cs[i][y][x] == 'M')\n for(int dy = -1; dy <= 1; dy++)\n for(int dx = -1; dx <= 1; dx++) {\n final int xx = x+dx;\n final int yy = y+dy;\n if(0 <= xx && xx < 8 && 0 <= yy && yy < 8 && cs[i][yy][xx] != 'S')\n cs[i+1][yy][xx] = 'M';\n }\n \n for(int y = 6; y >= 0; y--)\n for(int x = 0; x < 8; x++)\n if(cs[i][y][x] == 'S')\n cs[i+1][y+1][x] = 'S';\n }\n \n String res = \"LOSE\";\n for(int y = 0; y < 8; y++)\n for(int x = 0; x < 8; x++)\n if(cs[19][y][x] == 'M')\n res = \"WIN\";\n System.out.println(res);\n }\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar"], "code_uid": "23c07196a3057d2b6a0b28493025fef1", "src_uid": "f47e4ab041288ba9567c19930eb9a090", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.IOException;\nimport java.io.OutputStreamWriter;\nimport java.io.BufferedWriter;\nimport java.util.InputMismatchException;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.NoSuchElementException;\nimport java.io.Writer;\nimport java.math.BigInteger;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Egor Kulikov (egor@egork.net)\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tOutputWriter out = new OutputWriter(outputStream);\n\t\tTaskA solver = new TaskA();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskA {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n\t\tlong price = in.readLong();\n\t\twhile (price % 3 == 0 && price != 0)\n\t\t\tprice /= 3;\n\t\tlong answer = price / 3 + 1;\n\t\tout.printLine(answer);\n }\n}\n\nclass InputReader {\n\n\tprivate InputStream stream;\n\tprivate byte[] buf = new byte[1024];\n\tprivate int curChar;\n\tprivate int numChars;\n\tprivate SpaceCharFilter filter;\n\n\tpublic InputReader(InputStream stream) {\n\t\tthis.stream = stream;\n\t}\n\n\tpublic int read() {\n\t\tif (numChars == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (curChar >= numChars) {\n\t\t\tcurChar = 0;\n\t\t\ttry {\n\t\t\t\tnumChars = stream.read(buf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (numChars <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buf[curChar++];\n\t}\n\n\tpublic long readLong() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tlong res = 0;\n\t\tdo {\n\t\t\tif (c < '0' || c > '9')\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n\n\tpublic boolean isSpaceChar(int c) {\n\t\tif (filter != null)\n\t\t\treturn filter.isSpaceChar(c);\n\t\treturn isWhitespace(c);\n\t}\n\n\tpublic static boolean isWhitespace(int c) {\n\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t}\n\n\tpublic interface SpaceCharFilter {\n\t\tpublic boolean isSpaceChar(int ch);\n\t}\n}\n\nclass OutputWriter {\n\tprivate final PrintWriter writer;\n\n\tpublic OutputWriter(OutputStream outputStream) {\n\t\twriter = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n\t}\n\n\tpublic OutputWriter(Writer writer) {\n\t\tthis.writer = new PrintWriter(writer);\n\t}\n\n\tpublic void print(Object...objects) {\n\t\tfor (int i = 0; i < objects.length; i++) {\n\t\t\tif (i != 0)\n\t\t\t\twriter.print(' ');\n\t\t\twriter.print(objects[i]);\n\t\t}\n\t}\n\n public void printLine(Object...objects) {\n\t\tprint(objects);\n\t\twriter.println();\n\t}\n\n\tpublic void close() {\n\t\twriter.close();\n\t}\n\n\t}\n\n", "lang_cluster": "Java", "tags": ["greedy"], "code_uid": "9dcc55c72b8b8c9785b7513781aa5c7c", "src_uid": "7e7b59f2112fd200ee03255c0c230ebd", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//import java.util.Arrays;\nimport java.math.BigInteger;\nimport java.util.Scanner;\npublic class A682\n{\n public static void main(String[] args)\n {\n Scanner sc=new Scanner(System.in);\n BigInteger ans=new BigInteger(\"0\");\n int n=sc.nextInt();\n int m=sc.nextInt();\n int[] arr=new int[5];\n for(int i=1;i<=m;i++)\n arr[i%5]++;\n //System.out.println(Arrays.toString(arr));\n for(int i=1;i<=n;i++)\n {\n if(i%5==0)\n ans=ans.add(BigInteger.valueOf(arr[0]));\n else\n ans=ans.add(BigInteger.valueOf(arr[5-i%5]));\n }\n System.out.println(ans);\n sc.close();\n }\n}", "lang_cluster": "Java", "tags": ["math", "constructive algorithms", "number theory"], "code_uid": "23572616099094120f58c8bff7a933b1", "src_uid": "df0879635b59e141c839d9599abd77d2", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.IOException; \nimport java.io.InputStream; \nimport java.io.PrintWriter; \nimport java.util.*; \n \n\npublic class d{\n\n\tstatic class Pos{\n\t\tint i,j;\n\t\tPos(int i, int j){this.i=i;this.j=j;}\n\t}\n\tstatic class Node{\n\t\tint i,j,k,l,c;\n\t\tNode(int i,int j,int k,int l,int c){this.i=i;this.j=j;this.k=k;this.l=l;this.c=c;}\n\t}\n\n\tstatic void solve(){\n\t\tint n = ni();\n\t\tint[][][][] dis = new int[n][n][3][n*n+1];\n\t\tPos[] pos =new Pos[n*n];\n\t\tfor(int i=0;i<n;++i)for(int j=0;j<n;++j)pos[ni()-1] = new Pos(i, j);\n\t\tfor(int i=0;i<n;++i)for(int j=0;j<n;++j)for(int k=0;k<3;++k)for(int l=0;l<=n*n;++l)dis[i][j][k][l]=Integer.MAX_VALUE;\n\t\tPriorityQueue<Node> que = new PriorityQueue<>((a,b)->a.c-b.c);\n\t\tfor(int k=0;k<3;++k){\n\t\t\tdis[pos[0].i][pos[0].j][k][1]=0;\n\t\t\tque.add(new Node(pos[0].i, pos[0].j, k, 1, 0));\n\t\t}\n\t\tList<Integer> movex[] = new List[3];\n\t\tList<Integer> movey[] = new List[3];\n\t\tmovex[0] = Arrays.asList(-2,-2,-1,-1,1,1,2,2);\n\t\tmovey[0] = Arrays.asList(1,-1,2,-2,2,-2,1,-1);\n\t\tfor(int i=1;i<3;++i){\n\t\t\tmovex[i]=new ArrayList<>();\n\t\t\tmovey[i]=new ArrayList<>();\n\t\t}\n\t\tfor(int i=1;i<=n;++i){\n\t\t\tmovex[1].add(i);movex[1].add(-i);\n\t\t\tmovey[1].add(0);movey[1].add(0);\n\t\t\tmovex[1].add(0);movex[1].add(0);\n\t\t\tmovey[1].add(i);movey[1].add(-i);\n\n\t\t\tmovex[2].add(i);movex[2].add(-i);\n\t\t\tmovey[2].add(i);movey[2].add(-i);\n\t\t\tmovex[2].add(i);movex[2].add(-i);\n\t\t\tmovey[2].add(-i);movey[2].add(i);\n\t\t}\n\t\twhile(!que.isEmpty()){\n\t\t\tNode node = que.poll();\n\t\t\tif(node.c > dis[node.i][node.j][node.k][node.l])continue;\n\t\t\tint i=node.i, j=node.j, k=node.k, l=node.l;\n\t\t\tif(l==n*n){\n\t\t\t\tout.println(node.c/1000+\" \"+node.c%1000);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tfor(int kk=0;kk<3;++kk){\n\t\t\t\tif(kk==k)continue;\n\t\t\t\tif(dis[i][j][kk][l] > dis[i][j][k][l]+1001){\n\t\t\t\t\tdis[i][j][kk][l]=dis[i][j][k][l]+1001;\n\t\t\t\t\tque.add(new Node(i, j, kk, l, dis[i][j][kk][l]));\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int x=0;x<movex[k].size();++x){\n\t\t\t\tint dx = movex[k].get(x);\n\t\t\t\tint dy = movey[k].get(x);\n\n\t\t\t\tif(inrange(i+dy, j+dx, n, n)){\n\t\t\t\t\tint ll = l;\n\t\t\t\t\tif(pos[l].i==i+dy && pos[l].j==j+dx)++ll;\n\t\t\t\t\tif(dis[i+dy][j+dx][k][ll]>dis[i][j][k][l]+1000){\n\t\t\t\t\t\tdis[i+dy][j+dx][k][ll]=dis[i][j][k][l]+1000;\n\t\t\t\t\t\tque.add(new Node(i+dy, j+dx, k, ll, dis[i+dy][j+dx][k][ll]));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\n\n\t} \n \n \n \n \n\t public static void main(String[] args){ \n\t\t solve(); \n\t\t out.flush(); \n\t } \n\t private static InputStream in = System.in; \n\t private static PrintWriter out = new PrintWriter(System.out); \n \n\t static boolean inrange(int y, int x, int h, int w){ \n\t\t return y>=0 && y<h && x>=0 && x<w; \n\t } \n\t @SuppressWarnings(\"unchecked\") \n\t static<T extends Comparable> int lower_bound(List<T> list, T key){ \n\t\t int lower=-1;int upper=list.size(); \n\t\t while(upper - lower>1){ \n\t\t int center =(upper+lower)/2; \n\t\t if(list.get(center).compareTo(key)>=0)upper=center; \n\t\t else lower=center; \n\t\t } \n\t\t return upper; \n\t } \n\t @SuppressWarnings(\"unchecked\") \n\t static <T extends Comparable> int upper_bound(List<T> list, T key){ \n\t\t int lower=-1;int upper=list.size(); \n\t\t while(upper-lower >1){ \n\t\t int center=(upper+lower)/2; \n\t\t if(list.get(center).compareTo(key)>0)upper=center; \n\t\t else lower=center; \n\t\t } \n\t\t return upper; \n\t } \n\t @SuppressWarnings(\"unchecked\") \n\t static <T extends Comparable> boolean next_permutation(List<T> list){ \n\t\t int lastIndex = list.size()-2; \n\t\t while(lastIndex>=0 && list.get(lastIndex).compareTo(list.get(lastIndex+1))>=0)--lastIndex; \n\t\t if(lastIndex<0)return false; \n\t\t int swapIndex = list.size()-1; \n\t\t while(list.get(lastIndex).compareTo(list.get(swapIndex))>=0)swapIndex--; \n\t\t T tmp = list.get(lastIndex); \n\t\t list.set(lastIndex++, list.get(swapIndex)); \n\t\t list.set(swapIndex, tmp); \n\t\t swapIndex = list.size()-1; \n\t\t while(lastIndex<swapIndex){ \n\t\t tmp = list.get(lastIndex); \n\t\t list.set(lastIndex, list.get(swapIndex)); \n\t\t list.set(swapIndex, tmp); \n\t\t ++lastIndex;--swapIndex; \n\t\t } \n\t\t return true; \n\t } \n\t private static final byte[] buffer = new byte[1<<15]; \n\t private static int ptr = 0; \n\t private static int buflen = 0; \n\t private static boolean hasNextByte(){ \n\t\t if(ptr<buflen)return true; \n\t\t ptr = 0; \n\t\t try{ \n\t\t\t buflen = in.read(buffer); \n\t\t } catch (IOException e){ \n\t\t\t e.printStackTrace(); \n\t\t } \n\t\t return buflen>0; \n\t } \n\t private static int readByte(){ if(hasNextByte()) return buffer[ptr++]; else return -1;} \n\t private static boolean isSpaceChar(int c){ return !(33<=c && c<=126);} \n\t private static int skip(){int res; while((res=readByte())!=-1 && isSpaceChar(res)); return res;} \n \n\t private static double nd(){ return Double.parseDouble(ns()); } \n\t private static char nc(){ return (char)skip(); } \n\t private static String ns(){ \n\t\t StringBuilder sb = new StringBuilder(); \n\t\t for(int b=skip();!isSpaceChar(b);b=readByte())sb.append((char)b); \n\t\t return sb.toString(); \n\t } \n\t private static int[] nia(int n){ \n\t\t int[] res = new int[n]; \n\t\t for(int i=0;i<n;++i)res[i]=ni(); \n\t\t return res; \n\t } \n\t private static long[] nla(int n){ \n\t\t long[] res = new long[n]; \n\t\t for(int i=0;i<n;++i)res[i]=nl(); \n\t\t return res; \n\t } \n\t private static int ni(){ \n\t\t int res=0,b; \n\t\t boolean minus=false; \n\t\t while((b=readByte())!=-1 && !((b>='0'&&b<='9') || b=='-')); \n\t\t if(b=='-'){ \n\t\t\t minus=true; \n\t\t\t b=readByte(); \n\t\t } \n\t\t for(;'0'<=b&&b<='9';b=readByte())res=res*10+(b-'0'); \n\t\t return minus ? -res:res; \n\t } \n\t private static long nl(){ \n\t\t long res=0,b; \n\t\t boolean minus=false; \n\t\t while((b=readByte())!=-1 && !((b>='0'&&b<='9') || b=='-')); \n\t\t if(b=='-'){ \n\t\t\t minus=true; \n\t\t\t b=readByte(); \n\t\t } \n\t\t for(;'0'<=b&&b<='9';b=readByte())res=res*10+(b-'0'); \n\t\t return minus ? -res:res; \n\t} \n} \n\n", "lang_cluster": "Java", "tags": ["dfs and similar", "dp", "shortest paths"], "code_uid": "9b815f9e68a3e9d8224d9882d0a8ab46", "src_uid": "5fe44b6cd804e0766a0e993eca1846cd", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Roy\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n D1DominoEasyVersion solver = new D1DominoEasyVersion();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class D1DominoEasyVersion {\n private boolean found;\n\n private void solveEvenXEvenMatrix(int dominoes) {\n //~ if the matrix is: even x even\n //~ then it is enough to check the number of dominoes are even or not\n if (dominoes % 2 == 0) found = true;\n }\n\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int tc = in.readInteger();\n for (int cs = 1; cs <= tc; ++cs) {\n int n = in.readInteger();\n int m = in.readInteger();\n int k = in.readInteger();\n\n found = false;\n if (n % 2 == 0 && m % 2 == 0) {//~ even x even matrix\n solveEvenXEvenMatrix(k);\n } else if (n % 2 == 0 && m % 2 == 1) {//~ even x odd matrix\n int maxPossibleHorizons = (m * n) / 2 - (n / 2);\n\n if (k <= maxPossibleHorizons) {//~ k should not be > maxPossibleHorizons\n solveEvenXEvenMatrix(k);\n }\n } else if (n % 2 == 1 && m % 2 == 0) { //~ odd x even matrix\n int leastHorizons = m / 2;\n if (k >= leastHorizons) {\n int restHorizons = k - leastHorizons;\n solveEvenXEvenMatrix(restHorizons);\n }\n }\n if (found) out.printLine(\"YES\");\n else out.printLine(\"NO\");\n }\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int readInteger() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void print(Object... objects) {\n for (int i = 0; i < objects.length; i++) {\n if (i != 0) {\n writer.print(' ');\n }\n writer.print(objects[i]);\n }\n }\n\n public void printLine(Object... objects) {\n this.print(objects);\n writer.println();\n }\n\n public void close() {\n writer.flush();\n writer.close();\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "constructive algorithms"], "code_uid": "59ca7fbbf32da42055962b09af50c1a6", "src_uid": "4d0c0cc8faca62eb6384f8135b30feb8", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\nimport java.lang.*;\n \n //@Manan Parmar\n\npublic class Solution2 implements Runnable {\n\n\n public void run() {\n \n InputReader sc = new InputReader(System.in);\n PrintWriter out = new PrintWriter(System.out);\n \n int y=sc.nextInt(),b=sc.nextInt(),r=sc.nextInt();\n if(y<=b&&y<r)\n {\n if(r-y>1&&b-y>=1)\n out.println(y+(y+1)+(y+2));\n else\n out.println((y-1)+y+(y+1));\n }\n else if(b<=y&&b<r)\n {\n out.println((b-1)+b+(b+1));\n }\n else\n {\n out.println((r-2)+(r-1)+(r));\n }\n \n\n out.close();\n }\n \n\n//========================================================================\n\n \n\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private SpaceCharFilter filter;\n private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n \n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n \n public int read() {\n if (numChars==-1)\n throw new InputMismatchException();\n \n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n }\n catch (IOException e) {\n throw new InputMismatchException();\n }\n \n if(numChars <= 0) \n return -1;\n }\n return buf[curChar++];\n }\n \n public String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n }\n catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n public int nextInt() {\n int c = read();\n \n while(isSpaceChar(c))\n c = read();\n \n int sgn = 1;\n \n if (c == '-') {\n sgn = -1;\n c = read();\n }\n \n int res = 0;\n do {\n if(c<'0'||c>'9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n \n return res * sgn;\n }\n \n public long nextLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n \n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n return res * sgn;\n }\n \n public double nextDouble() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n \n public String readString() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n }\n while (!isSpaceChar(c));\n \n return res.toString();\n }\n \n public boolean isSpaceChar(int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n \n public String next() {\n return readString();\n }\n \n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n }\n\n public static void main(String args[]) throws Exception {\n new Thread(null, new Solution2(),\"Main\",1<<27).start();\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "implementation"], "code_uid": "1bfc274b9d8f7b52b45af907d8a9dd35", "src_uid": "03ac8efe10de17590e1ae151a7bae1a5", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.Scanner;\n\n/**\n *\n * @author LittleBird\n */\npublic class Main {\n\n public static void main(String[] args) {\n Scanner cin = new Scanner(System.in);\n\n int n = cin.nextInt();\n int k = cin.nextInt();\n\n String cell = cin.next();\n\n\n int tPos = 0, pPos = 0;\n for (int i = 0; i < cell.length(); i++) {\n\n if (cell.charAt(i) == 'T') {\n tPos = i;\n }\n if (cell.charAt(i) == 'G') {\n pPos = i;\n }\n }\n \n\n int minv = Math.min(tPos, pPos);\n boolean flag = true;\n while (flag) {\n minv += k;\n if (minv >= n) {\n break;\n }\n if (cell.charAt(minv) == '#') {\n break;\n }\n if (cell.charAt(minv) == 'T' || cell.charAt(minv) == 'G') {\n flag = false;\n }\n }\n if (flag) {\n System.out.println(\"NO\");\n } else {\n System.out.println(\"YES\");\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["strings", "implementation"], "code_uid": "bdc32e6e0883c86387a6c5b4a20cf327", "src_uid": "189a9b5ce669bdb04b9d371d74a5dd41", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.BigInteger;\n\npublic class Main\n{\n\tstatic long mod=1000000007,m;\n\tstatic long[] a,b;\n\tpublic static void main(String[] args) throws IOException\n\t{\n\t\tFastReader in=new FastReader();\n\t\tPrintWriter pw=new PrintWriter(System.out);\n\t\tlong n=in.nextLong();\n\t\tif(n==1)\n\t\t\tpw.println(1);\n\t\telse\n\t\t{\n\t\t\tlong ans=0;\n\t\t\tfor(long i=1;i*i<=n;i++)\n\t\t\t{\n\t\t\t\tif(n%i==0)\n\t\t\t\t\tans+=2;\n\t\t\t\tif(i*i==n)\n\t\t\t\t\tans--;\n\t\t\t}\n\t\t\tpw.println(ans);\n\t\t}\n\t\tpw.flush();\n\t}\n}\n\nclass pair<A,B>\n{\n\tA f;\n\tB s;\n\n\tpublic pair(A a,B b)\n\t{\n\t\tf=a;\n\t\ts=b;\n\t}\n}\n\nclass FastReader\n{\n\tBufferedReader br;\n\tStringTokenizer st;\n \n\tpublic FastReader()\n\t{\n\t\tbr=new BufferedReader(new InputStreamReader(System.in));\n\t}\n \n\tpublic String next() throws IOException\n\t{\n\t\tif(st==null || !st.hasMoreElements())\n\t\t{\n\t\t\tst=new StringTokenizer(br.readLine());\n\t\t}\n\t\treturn st.nextToken();\n\t}\n \n\tpublic int nextInt() throws IOException\n\t{\n\t\treturn Integer.parseInt(next());\n\t}\n \n\tpublic long nextLong() throws IOException\n\t{\n\t\treturn Long.parseLong(next());\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "7eb3cfdcacf912a49312c49415d92f9f", "src_uid": "7fc9e7d7e25ab97d8ebc10ed8ae38fd1", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\n/**\n * @author OleGG\n */\npublic class Task92A {\n public int chips(int n, int m) {\n m %= n * (n + 1) / 2;\n for (int i = 1; i <= m; ++i) {\n m -= i;\n }\n return m;\n }\n\n public static void main(String[] args) throws Throwable {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int m = sc.nextInt();\n System.out.println(new Task92A().chips(n, m));\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "84f726fad0b8cd94884d7c2b2c6112f4", "src_uid": "5dd5ee90606d37cae5926eb8b8d250bb", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\nimport static java.lang.Math.*;\n\npublic class ProblemA_62 {\n \n final boolean ONLINE_JUDGE=System.getProperty(\"ONLINE_JUDGE\")!=null;\n BufferedReader in;\n PrintWriter out;\n StringTokenizer tok=new StringTokenizer(\"\");\n \n void init() throws FileNotFoundException{\n if (ONLINE_JUDGE){\n in=new BufferedReader(new InputStreamReader(System.in));\n out =new PrintWriter(System.out);\n }\n else{\n in = new BufferedReader(new FileReader(\"input.txt\"));\n out = new PrintWriter(\"output.txt\");\n }\n }\n \n String readString() throws IOException{\n while(!tok.hasMoreTokens()){\n tok=new StringTokenizer(in.readLine());\n }\n return tok.nextToken();\n }\n \n int readInt() throws IOException{\n return Integer.parseInt(readString());\n }\n \n public static void main(String[] args){\n new ProblemA_62().run();\n }\n \n public void run(){\n try{\n long t1=System.currentTimeMillis();\n init();\n solve();\n out.close();\n long t2=System.currentTimeMillis();\n System.err.println(\"Time = \"+(t2-t1));\n }catch (Exception e){\n e.printStackTrace(System.err);\n System.exit(-1);\n }\n }\n \npublic class Permutation {\n \n int[] a;\n int n;\n \n public Permutation(int n){\n this.n=n;\n a=new int[n];\n for (int i=0; i<n; i++){\n a[i]=i;\n }\n }\n \n public boolean nextPermutation(){ //Пишется с do{}while(nextPermutation(a));\n int i=n-1;\n for (i=n-2; i>=0; i--){\n if (a[i]<a[i+1]){\n break;\n }\n }\n if (i==-1){\n return false;\n }\n int jMin=i+1;\n for (int j=n-1; j>i; j--){\n if (a[i]<a[j]&&a[j]<a[jMin]){\n jMin=j;\n }\n }\n swap(i, jMin);\n for (int j=1; j<=(n-i)/2; j++){\n swap(i+j, n-j);\n }\n return true;\n }\n \n \n public int get(int i){\n return a[i];\n }\n \n void swap(int i, int j){\n int r=a[i];\n a[i]=a[j];\n a[j]=r;\n }\n }\n \n void solve() throws IOException{\n Permutation per;\n int[] p = new int[4];\n for (int i = 0; i < 4; i++){\n p[i] = readInt();\n }\n int a = readInt();\n int b = readInt();\n int count = 0;\n for (int x = a; x <= b; x++){\n per = new Permutation(4);\n int pr = 0;\n do{\n int p1 = p[per.get(0)];\n int p2 = p[per.get(1)];\n int p3 = p[per.get(2)];\n int p4 = p[per.get(3)];\n if (x % p1 % p2 % p3 % p4 == x){\n pr++;\n }\n }while(per.nextPermutation());\n if (pr >= 7){\n count++;\n }\n }\n out.print(count);\n } \n}", "lang_cluster": "Java", "tags": ["implementation", "number theory"], "code_uid": "0fa03ef16cf7168354d54a93a8b63e36", "src_uid": "63b9dc70e6ad83d89a487ffebe007b0a", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n\tprivate void solve() throws IOException{\n\t\tInputStreamReader isr = new InputStreamReader(System.in);\n\t\tBufferedReader br = new BufferedReader(isr);\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tbyte[] pairs = new byte[n];\n\t\tStringTokenizer st = new StringTokenizer(br.readLine(), \" \");\n\t\tint stay = 0;\n\t\t\n\t\t//input\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tpairs[i] = Byte.parseByte(st.nextToken());\n\t\t\t\n\t\tif(n > 1){\n\t\t\tif(pairs[0] != 0)\n\t\t\t\tif(pairs[0] != 0 || pairs[1] != 0) stay++;\n\t\t\tfor(int i = 1; i < n-1; i++){\n\t\t\t\tif(pairs[i] == 0){\n\t\t\t\t\tif(pairs[i-1] != 0 && pairs[i+1] != 0) stay++;\n\t\t\t\t}else{\n\t\t\t\t\tstay++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(pairs[n-1] != 0) stay++;\n\t\t}else{\n\t\t\tif(pairs[0] == 1) stay++;\n\t\t}\n\t\t\n\t\tSystem.out.println(stay);\n\t}\n\t\n\tpublic static void main(String[] args) throws IOException{\n\t\tMain m = new Main();\n\t\tm.solve();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "131e0df6eafba94d661185320a1a8377", "src_uid": "2896aadda9e7a317d33315f91d1ca64d", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\n\npublic class Main {\n\n\tBufferedReader in;\n\tStringTokenizer str = null;\n\tPrintWriter out;\n\t\n\tprivate String next() throws Exception{\n\t\twhile (str == null || !str.hasMoreElements())\n\t\t\tstr = new StringTokenizer(in.readLine());\n\t\treturn str.nextToken();\n\t}\n\t\n\tprivate int nextInt() throws Exception{\n\t\treturn Integer.parseInt(next());\n\t}\n\t\n\tprivate long nextLong() throws Exception{\n\t\treturn Long.parseLong(next());\n\t}\n\t\n\tprivate double nextDouble() throws Exception{\n\t\treturn Double.parseDouble(next());\n\t}\n\n\tfinal long oo = Long.MAX_VALUE;\n\t\n\tpublic void run() throws Exception{\n\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\tlong t = nextLong(), w = nextLong(), b = nextLong();\n\t\tif (t < Math.min(w, b) || w == b)\t{\n\t\t\tout.println(\"1/1\");\n\t\t\tout.close();\n\t\t\treturn;\n\t\t}\n\n\t\tlong gcd = gcd(w, b);\n\t\tBigInteger lcm = new BigInteger(\"\" + w).divide(new BigInteger(\"\" + gcd)).multiply(new BigInteger(\"\" + b));\n\t\t// long lcm = w / gcd * b;\n\t\t// System.out.println(\"lcm = \" + lcm);\n\n\t\t// long num = (t / lcm - 1) * Math.min(w, b);\n\t\tBigInteger bigT = new BigInteger(\"\" + t);\n\t\tBigInteger step = new BigInteger(\"\" + Math.min(w, b));\n\t\tBigInteger num = ((bigT.divide(lcm)).subtract(BigInteger.ONE)).multiply(step);\n\t\tnum = num.add(step.subtract(BigInteger.ONE));\n\t\t// num += Math.min(w, b) - 1;\n\n\t\t// if (bigT.mod(lcm).longValue() != 0) {\n\t\t\tBigInteger l = bigT.divide(lcm).multiply(lcm);\n\t\t\tBigInteger left = bigT.subtract(l).add(BigInteger.ONE);\n\t\t\tif (step.compareTo(left) > 0) {\n\t\t\t\tnum = num.add(left);\n\t\t\t}else {\n\t\t\t\tnum = num.add(step);\n\t\t\t}\n\t\t// }\n\t\t// if (t % lcm != 0) {\n\t\t// \tlong l = (t / lcm) * lcm;\n\t\t// \tlong left = t - l + 1;\n\t\t// \tnum += Math.min(Math.min(w, b), left);\n\t\t// }\n\t\tlong nn = num.longValue();\n\t\tgcd = gcd(nn, t);\n\t\tnn /= gcd;\n\t\tt /= gcd;\n\n\t\tout.println(nn + \"/\" + t);\n\t\tout.close();\n\t}\n\n\tprivate long gcd(long a, long b) {\n\t\treturn (b == 0) ? a : gcd(b, a % b);\n\t}\n\t\t\n\tpublic static void main(String[] args) throws Exception{\n\t\tnew Main().run();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "1cf524906ffeb42ca7e19c9ad860935f", "src_uid": "7a1d8ca25bce0073c4eb5297b94501b5", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.IOException;\nimport java.io.OutputStreamWriter;\nimport java.io.BufferedWriter;\nimport java.util.InputMismatchException;\nimport java.util.Comparator;\nimport java.io.OutputStream;\nimport java.util.ArrayDeque;\nimport java.io.PrintWriter;\nimport java.util.NoSuchElementException;\nimport java.io.Writer;\nimport java.util.Queue;\nimport java.math.BigInteger;\nimport java.util.Collection;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Nguyen Trung Hieu - vuondenthanhcong11@gmail.com\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n TaskA solver = new TaskA();\n solver.solve(1, in, out);\n out.close();\n }\n}\n\nclass TaskA {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n long x = in.readLong();\n long y = in.readLong();\n long m = in.readLong();\n\n if (x >= m || y >= m) {\n out.printLine(0);\n return;\n }\n\n if (x <= 0 && y <= 0) {\n out.printLine(-1);\n return;\n }\n\n long answer = 0;\n\n if (x < 0) {\n answer += (Math.abs(x) + y) / y;\n x = x + answer * y;\n }\n\n if (y < 0) {\n answer += (Math.abs(y) + x) / x;\n y = y + answer * x;\n }\n\n Queue<Pair<Long, Long>> pairQueue = new ArrayDeque<Pair<Long, Long>>();\n\n pairQueue.add(Pair.makePair(x, y));\n\n while (true) {\n Pair<Long, Long>[] temp = new Pair[pairQueue.size()];\n pairQueue.toArray(temp);\n pairQueue = new ArrayDeque<Pair<Long, Long>>();\n for (Pair<Long, Long> cur : temp) {\n if (cur.first >= m || cur.second >= m) {\n out.printLine(answer);\n return;\n }\n if (cur.first > 0 && cur.first >= cur.second)\n pairQueue.add(Pair.makePair(cur.first, cur.first + cur.second));\n if (cur.second > 0 && cur.second >= cur.first)\n pairQueue.add(Pair.makePair(cur.first + cur.second, cur.second));\n }\n answer++;\n }\n }\n}\n\nclass InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public long readLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n\n}\n\nclass OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void print(Object...objects) {\n for (int i = 0; i < objects.length; i++) {\n if (i != 0)\n writer.print(' ');\n writer.print(objects[i]);\n }\n }\n\n public void printLine(Object...objects) {\n print(objects);\n writer.println();\n }\n\n public void close() {\n writer.close();\n }\n\n}\n\nclass Pair<U, V> implements Comparable<Pair<U, V>> {\n\n public final U first;\n public final V second;\n\n public static<U, V> Pair<U, V> makePair(U first, V second) {\n return new Pair<U, V>(first, second);\n }\n\n public Pair(U first, V second) {\n this.first = first;\n this.second = second;\n }\n\n public boolean equals(Object o) {\n if (this == o) return true;\n if (o == null || getClass() != o.getClass()) return false;\n\n Pair pair = (Pair) o;\n\n return !(first != null ? !first.equals(pair.first) : pair.first != null) && !(second != null ? !second.equals(pair.second) : pair.second != null);\n\n }\n\n public int hashCode() {\n int result = first != null ? first.hashCode() : 0;\n result = 31 * result + (second != null ? second.hashCode() : 0);\n return result;\n }\n\n public String toString() {\n return \"(\" + first + \",\" + second + \")\";\n }\n\n public int compareTo(Pair<U, V> o) {\n int value = ((Comparable<U>)first).compareTo(o.first);\n if (value != 0)\n return value;\n return ((Comparable<V>)second).compareTo(o.second);\n }\n}\n\n", "lang_cluster": "Java", "tags": ["brute force"], "code_uid": "e6a996f3f117eb0a9b6f9109921aa8e2", "src_uid": "82026a3c3d9a6bda2e2ac6e14979d821", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.IOException;\nimport java.util.Scanner;\n\npublic class Main\n{\n\n\tstatic Scanner in = new Scanner(System.in);\n\n\tpublic static void main(String[] args) throws IOException\n\t{\n\n\t\tlong n = in.nextLong();\n\t\tlong s = in.nextLong();\n\t\tlong minNum = getMin(s);\n\t\t//System.out.println(\"minNum==\" + minNum);\n\t\tif (n < minNum)\n\t\t\tSystem.out.println(0);\n\t\telse\n\t\t{\n\t\t\tSystem.out.println(n - minNum + 1);\n\t\t}\n\n\t}\n\n\tstatic long getMin(long s)\n\t{\n\t\tlong ans = (s / 9) * 9;\n\t\tif (ans != s)\n\t\t\tans += 9;\n\n\t\tans = ans - ans % 10 + 10;\n\t\twhile (true)\n\t\t{\n\t\t\tif (ans - getStringSum(ans) >= s)\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tans += 10;\n\t\t}\n\t\treturn ans;\n\t}\n\n\tstatic int getStringSum(long s)\n\t{\n\t\tint sum = 0;\n\t\twhile (s != 0)\n\t\t{\n\t\t\tsum += s % 10;\n\t\t\ts = s / 10;\n\t\t}\n\t\treturn sum;\n\t}\n\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "binary search"], "code_uid": "8c8b5e630016fb60f3b7dd9e82d3f930", "src_uid": "9704e2ac6a158d5ced8fd1dc1edb356b", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.HashMap;\n\n\npublic class CF_218_2_B {\n static HashMap<Integer, Integer> weights = new HashMap<>();\n static int ans = 1 << 30;\n \n public static void main(String[] args) throws Exception {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n String[] line = br.readLine().split(\"\\\\s\");\n int a = Integer.parseInt(line[0]);\n int b = Integer.parseInt(line[1]);\n \n f(a, 0);\n f2(b, 0);\n if (ans == 1 << 30)\n System.out.println(-1);\n else\n System.out.println(ans);\n }\n \n static void f(int a, int d) {\n if (weights.containsKey(a))\n return;\n \n weights.put(a, d);\n\n if (a % 2 == 0)\n f(a / 2, d + 1);\n if (a % 3 == 0)\n f(a / 3, d + 1);\n if (a % 5 == 0)\n f(a / 5, d + 1);\n }\n \n static void f2(int b, int d) {\n if (weights.containsKey(b)) {\n ans = Math.min(ans, d + weights.get(b));\n return;\n }\n\n if (b % 2 == 0)\n f2(b / 2, d + 1);\n if (b % 3 == 0)\n f2(b / 3, d + 1);\n if (b % 5 == 0)\n f2(b / 5, d + 1);\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "8631ce025a14feb4a9a62d88ce0e949e", "src_uid": "75a97f4d85d50ea0e1af0d46f7565b49", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\npublic class substring\n{\npublic static void main(String[] args)\n{\nScanner input = new Scanner(System.in);\nString s = input.nextLine();\nBoolean found = false;\nint i = s.length();\nwhile(found==false)\n{\ni--;\nArrayList<String> sub = new ArrayList<String>();\nfor(int j = 0; j <= s.length() - i; j++)\n{\nif(sub.contains(s.substring(j, j+i)))\nfound = true;\nelse\nsub.add(s.substring(j, j+i));\n}\n\n}\nSystem.out.println(i);\n}\n}", "lang_cluster": "Java", "tags": ["brute force", "greedy"], "code_uid": "67e9dfa56073999d4e7d995d68128865", "src_uid": "13b5cf94f2fabd053375a5ccf3fd44c7", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class vasyaTheHipster {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint a = scan.nextInt(), b = scan.nextInt();\n\t\tif (a > b) {\n\t\t\tSystem.out.print(b + \" \");\n\t\t\ta -= b;\n\t\t\ta /= 2;\n\t\t\tSystem.out.print(a + \" \");\n\t\t} else {\n\t\t\tSystem.out.print(a + \" \");\n\t\t\tb -= a;\n\t\t\tb /= 2;\n\t\t\tSystem.out.print(b + \" \");\n\t\t}\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "8e45a34af7ce8c29ec9225ec3c1745e5", "src_uid": "775766790e91e539c1cfaa5030e5b955", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.lang.reflect.Array;\nimport java.util.*;\nimport java.math.*;\nimport java.lang.*;\n\npublic class TaskB implements Runnable {\n boolean prime[] = new boolean[100001];\n void sieveOfEratosthenes(int n) {\n for (int i = 0; i < n; i++)\n prime[i] = true;\n for (int p = 2; p * p <= n; p++) {\n if (prime[p] == true) {\n for (int i = p * p; i <= n; i += p)\n prime[i] = false;\n }\n }\n }\n public void run() {\n InputReader c = new InputReader(System.in);\n PrintWriter w = new PrintWriter(System.out);\n int n=c.nextInt();\n int k=c.nextInt();\n int ans;\n k = Math.min(k,n-k+1);\n System.out.println(k+n*3-1);\n w.close();\n }\n\n public static void sortbyColumn(int arr[][], int col)\n {\n\n Arrays.sort(arr, new Comparator<int[]>()\n {\n public int compare(int[] o1, int[] o2){\n return(Integer.valueOf(o1[col]).compareTo(o2[col]));\n }\n });\n\n }\n class Graph{\n private final int v;\n private List<List<Integer>> adj;\n Graph(int v){\n this.v = v;\n adj = new ArrayList<>(v);\n for(int i=0;i<v;i++){\n adj.add(new LinkedList<>());\n }\n }\n private void addEdge(int a,int b){\n adj.get(a).add(b);\n }\n private boolean isCyclic()\n {\n boolean[] visited = new boolean[v];\n boolean[] recStack = new boolean[v];\n for (int i = 0; i < v; i++)\n if (isCyclicUtil(i, visited, recStack))\n return true;\n\n return false;\n }\n private boolean isCyclicUtil(int i, boolean[] visited, boolean[] recStack)\n {\n if (recStack[i])\n return true;\n if (visited[i])\n return false;\n visited[i] = true;\n recStack[i] = true;\n List<Integer> children = adj.get(i);\n for (Integer c: children)\n if (isCyclicUtil(c, visited, recStack))\n return true;\n recStack[i] = false;\n return false;\n }\n }\n static long gcd(long a, long b)\n {\n if (b == 0)\n return a;\n return gcd(b, a % b);\n }\n public static class DJSet {\n public int[] upper;\n\n public DJSet(int n) {\n upper = new int[n];\n Arrays.fill(upper, -1);\n }\n\n public int root(int x) {\n return upper[x] < 0 ? x : (upper[x] = root(upper[x]));\n }\n\n public boolean equiv(int x, int y) {\n return root(x) == root(y);\n }\n\n public boolean union(int x, int y) {\n x = root(x);\n y = root(y);\n if (x != y) {\n if (upper[y] < upper[x]) {\n int d = x;\n x = y;\n y = d;\n }\n upper[x] += upper[y];\n upper[y] = x;\n }\n return x == y;\n }\n }\n public static int[] radixSort(int[] f)\n {\n int[] to = new int[f.length];\n {\n int[] b = new int[65537];\n for(int i = 0;i < f.length;i++)b[1+(f[i]&0xffff)]++;\n for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];\n for(int i = 0;i < f.length;i++)to[b[f[i]&0xffff]++] = f[i];\n int[] d = f; f = to;to = d;\n }\n {\n int[] b = new int[65537];\n for(int i = 0;i < f.length;i++)b[1+(f[i]>>>16)]++;\n for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];\n for(int i = 0;i < f.length;i++)to[b[f[i]>>>16]++] = f[i];\n int[] d = f; f = to;to = d;\n }\n return f;\n }\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private SpaceCharFilter filter;\n private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars==-1)\n throw new InputMismatchException();\n\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n }\n catch (IOException e) {\n throw new InputMismatchException();\n }\n\n if(numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n }\n catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n public int nextInt() {\n int c = read();\n\n while(isSpaceChar(c))\n c = read();\n\n int sgn = 1;\n\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n\n int res = 0;\n do {\n if(c<'0'||c>'9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n\n return res * sgn;\n }\n\n public long nextLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public double nextDouble() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n\n public String readString() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n }\n while (!isSpaceChar(c));\n\n return res.toString();\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public String next() {\n return readString();\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n }\n public static void main(String args[]) throws Exception {\n new Thread(null, new TaskB(),\"TaskB\",1<<26).start();\n }\n}", "lang_cluster": "Java", "tags": ["math", "constructive algorithms"], "code_uid": "4ec59483d7f6a012739ea0c7d9c8338a", "src_uid": "24b02afe8d86314ec5f75a00c72af514", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\n\nimport java.io.FileInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.nio.charset.Charset;\nimport java.util.Arrays;\n\npublic class CF1161C {\n public static void main(String[] args) throws Exception {\n boolean local = System.getProperty(\"ONLINE_JUDGE\") == null;\n boolean async = false;\n\n Charset charset = Charset.forName(\"ascii\");\n\n FastIO io = local ? new FastIO(new FileInputStream(\"D:\\\\DATABASE\\\\TESTCASE\\\\Code.in\"), System.out, charset) : new FastIO(System.in, System.out, charset);\n Task task = new Task(io, new Debug(local));\n\n if (async) {\n Thread t = new Thread(null, task, \"dalt\", 1 << 27);\n t.setPriority(Thread.MAX_PRIORITY);\n t.start();\n t.join();\n } else {\n task.run();\n }\n\n if (local) {\n io.cache.append(\"\\n\\n--memory -- \\n\" + ((Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory()) >> 20) + \"M\");\n }\n\n io.flush();\n }\n\n public static class Task implements Runnable {\n final FastIO io;\n final Debug debug;\n int inf = (int) 1e8;\n int mod = (int) 1e9 + 7;\n\n public int mod(int val) {\n val %= mod;\n if (val < 0) {\n val += mod;\n }\n return val;\n }\n\n public int mod(long val) {\n val %= mod;\n if (val < 0) {\n val += mod;\n }\n return (int) val;\n }\n\n int bitAt(int x, int i) {\n return (x >> i) & 1;\n }\n\n int bitAt(long x, int i) {\n return (int) ((x >> i) & 1);\n }\n\n public Task(FastIO io, Debug debug) {\n this.io = io;\n this.debug = debug;\n }\n\n @Override\n public void run() {\n solve();\n }\n\n public void solve() {\n int n = io.readInt();\n int m = 50;\n int cnt = 0;\n for (int i = 0; i < n; i++) {\n int v = io.readInt();\n if (m > v) {\n m = v;\n cnt = 0;\n }\n if (m == v) {\n cnt++;\n }\n }\n\n if (cnt > n / 2) {\n io.cache.append(\"Bob\");\n } else {\n io.cache.append(\"Alice\");\n }\n }\n }\n\n public static class FastIO {\n public final StringBuilder cache = new StringBuilder();\n private final InputStream is;\n private final OutputStream os;\n private final Charset charset;\n private StringBuilder defaultStringBuf = new StringBuilder(1 << 8);\n private byte[] buf = new byte[1 << 13];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastIO(InputStream is, OutputStream os, Charset charset) {\n this.is = is;\n this.os = os;\n this.charset = charset;\n }\n\n public FastIO(InputStream is, OutputStream os) {\n this(is, os, Charset.forName(\"ascii\"));\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public int readInt() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n public long readLong() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n long val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n public double readDouble() {\n boolean sign = true;\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+';\n next = read();\n }\n\n long val = 0;\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n if (next != '.') {\n return sign ? val : -val;\n }\n next = read();\n long radix = 1;\n long point = 0;\n while (next >= '0' && next <= '9') {\n point = point * 10 + next - '0';\n radix = radix * 10;\n next = read();\n }\n double result = val + (double) point / radix;\n return sign ? result : -result;\n }\n\n public String readString(StringBuilder builder) {\n skipBlank();\n\n while (next > 32) {\n builder.append((char) next);\n next = read();\n }\n\n return builder.toString();\n }\n\n public String readString() {\n defaultStringBuf.setLength(0);\n return readString(defaultStringBuf);\n }\n\n public int readLine(char[] data, int offset) {\n int originalOffset = offset;\n while (next != -1 && next != '\\n') {\n data[offset++] = (char) next;\n next = read();\n }\n return offset - originalOffset;\n }\n\n public int readString(char[] data, int offset) {\n skipBlank();\n\n int originalOffset = offset;\n while (next > 32) {\n data[offset++] = (char) next;\n next = read();\n }\n\n return offset - originalOffset;\n }\n\n public int readString(byte[] data, int offset) {\n skipBlank();\n\n int originalOffset = offset;\n while (next > 32) {\n data[offset++] = (byte) next;\n next = read();\n }\n\n return offset - originalOffset;\n }\n\n public char readChar() {\n skipBlank();\n char c = (char) next;\n next = read();\n return c;\n }\n\n public void flush() {\n try {\n os.write(cache.toString().getBytes(charset));\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n\n public boolean hasMore() {\n skipBlank();\n return next != -1;\n }\n }\n\n public static class Debug {\n private boolean allowDebug;\n\n public Debug(boolean allowDebug) {\n this.allowDebug = allowDebug;\n }\n\n public void assertTrue(boolean flag) {\n if (!allowDebug) {\n return;\n }\n if (!flag) {\n fail();\n }\n }\n\n public void fail() {\n throw new RuntimeException();\n }\n\n public void assertFalse(boolean flag) {\n if (!allowDebug) {\n return;\n }\n if (flag) {\n fail();\n }\n }\n\n private void outputName(String name) {\n System.out.print(name + \" = \");\n }\n\n public void debug(String name, int x) {\n if (!allowDebug) {\n return;\n }\n\n outputName(name);\n System.out.println(\"\" + x);\n }\n\n public void debug(String name, long x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(\"\" + x);\n }\n\n public void debug(String name, double x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(\"\" + x);\n }\n\n public void debug(String name, int[] x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(Arrays.toString(x));\n }\n\n public void debug(String name, long[] x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(Arrays.toString(x));\n }\n\n public void debug(String name, double[] x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(Arrays.toString(x));\n }\n\n public void debug(String name, Object x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(\"\" + x);\n }\n\n public void debug(String name, Object... x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(Arrays.deepToString(x));\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["games"], "code_uid": "170288955029e353f67b95c3f90a845a", "src_uid": "4b9cf82967aa8441e9af3db3101161e9", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\n\npublic class P912B {\n public static void main(String[] args) {\n Scanner input = new Scanner(System.in);\n\n long n = input.nextLong();\n long k = input.nextLong();\n\n long ans = Long.highestOneBit(n);\n System.out.println(k == 1 ? n : (ans - 1) | (ans));\n }\n}\n", "lang_cluster": "Java", "tags": ["constructive algorithms", "number theory", "bitmasks"], "code_uid": "43b2537b31502ed43bc436b7bacf5258", "src_uid": "16bc089f5ef6b68bebe8eda6ead2eab9", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": " import java.util.HashSet;\n import java.util.Scanner;\n import java.util.Set;\n\n public class Main {\n\n public static void main(String[] args) {\n\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n String str = sc.next();\n StringBuilder sb = new StringBuilder(str);\n for (int i = 0; i < str.length(); i++)\n sb.setCharAt(i, Character.toLowerCase(str.charAt(i)));\n str = sb.toString();\n Set<Character> letters = new HashSet<Character>();\n for (int i = 0; i < n ; i++) {\n letters.add(str.charAt(i));\n }\n if(letters.size()==26)\n System.out.println(\"YES\");\n else\n System.out.println(\"NO\");\n }\n }", "lang_cluster": "Java", "tags": ["strings", "implementation"], "code_uid": "a10782722bc4559c3dad9b64e80bc0a2", "src_uid": "f13eba0a0fb86e20495d218fc4ad532d", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\n\npublic class _v11 {\n\n public static void main(String args[]){\n\n PrintWriter out = new PrintWriter(System.out);\n Reader in = new Reader();\n long k = in.nextLong();\n long a = in.nextLong();\n long b = in.nextLong();\n if(a<b){\n long temp = a;\n a = b;\n b = temp;\n }\n long ans = a/k + b/k;\n\n if(ans == 0 || (a-(k*(a/k)) != 0 && b/k == 0)){\n ans = -1;\n }\n out.println(ans);\n out.flush();\n out.close();\n }\n static class Reader {\n\n private InputStream mIs;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n\n public Reader() {\n this(System.in);\n }\n\n public Reader(InputStream is) {\n mIs = is;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = mIs.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public String nextLine() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isEndOfLine(c));\n return res.toString();\n }\n\n public String next() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n double nextDouble()\n {\n return Double.parseDouble(next());\n }\n\n public long nextLong() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public int nextInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public boolean isEndOfLine(int c) {\n return c == '\\n' || c == '\\r' || c == -1;\n }\n\n }\n\n}\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "bc05cd36361ca261402621e9fa33fe82", "src_uid": "6e3b8193d1ca1a1d449dc7a4ad45b8f2", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Scanner;\n\npublic class Codeforce1 {\n\n public static void main(String[] args) {\n Scanner reader = new Scanner(System.in);\n int n = reader.nextInt();\n \n int res=(int)n/3;\n if (n%3==1 || n%3==2){\n res=(res*2)+1;\n }\n else{\n res=res*2;\n }\n System.out.print(res);\n }\n}", "lang_cluster": "Java", "tags": ["math"], "code_uid": "fa08ed5ccdf28ce86bbe5610d7681bef", "src_uid": "a993069e35b35ae158d35d6fe166aaef", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.regex.Pattern;\n\npublic class Solution {\n\n\tprivate static boolean check(String s) {\n\t\tif (s.split(\"@\").length != 2)\n\t\t\treturn false;\n\t\t\n\t\tif (s.charAt(0) == '@' || s.charAt(s.length() - 1) == '@')\n\t\t\treturn false;\n\n\t\tString username = s.split(\"@\")[0];\n\t\tString remains = s.split(\"@\")[1];\n\n\t\tif (remains.split(\"/\").length > 2)\n\t\t\treturn false;\n\t\tif (remains.charAt(remains.length() - 1) == '/')\n\t\t\treturn false;\n\t\t\n\t\tString hostname = remains.split(\"/\")[0];\n\n\t\tif (hostname.length() < 1 || hostname.length() > 32)\n\t\t\treturn false;\n\n\t\tPattern p = Pattern.compile(\"[A-Za-z0-9_]{1,16}\");\n\n\t\tString[] temp_hp = hostname.split(\"\\\\.\");\n\n\t\tint cnt = temp_hp.length + (hostname.charAt(0) == '.' ? 1 : 0)\n\t\t\t\t+ (hostname.charAt(hostname.length() - 1) == '.' ? 1 : 0);\n\n\t\tString[] host_parts = new String[cnt];\n\t\tArrays.fill(host_parts, \"\");\n\t\tfor (int i = 0; i < temp_hp.length; ++i)\n\t\t\thost_parts[i] = temp_hp[i];\n\n\t\t// System.err.println(\"hostname = \" + hostname);\n\t\t// System.err.println(\"host_parts.length = \" + host_parts.length);\n\n\t\tif (!p.matcher(username).matches())\n\t\t\treturn false;\n\n\t\tfor (String hp : host_parts)\n\t\t\tif (!p.matcher(hp).matches())\n\t\t\t\treturn false;\n\n\t\tif (remains.split(\"/\").length == 2) {\n\t\t\tString resourse = remains.split(\"/\")[1];\n\t\t\treturn p.matcher(resourse).matches();\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString s = br.readLine();\n\t\tif (check(s))\n\t\t\tSystem.out.println(\"YES\");\n\t\telse\n\t\t\tSystem.out.println(\"NO\");\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["strings", "implementation"], "code_uid": "261a5bc9db2791184508fa9fa5b27f4f", "src_uid": "2a68157e327f92415067f127feb31e24", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.math.BigInteger;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.PriorityQueue;\nimport java.util.Random;\nimport java.util.StringTokenizer;\n/*\n 4\n1 3 2 0\n */\npublic class A {\n\n\tpublic static void main(String[] args) throws IOException {\n\n\t\tFastScanner sc = new FastScanner();\n\t\tint n = sc.nextInt();\n\t\tint arr[] = sc.readArray(n);\n\t\tint dp[][] = new int[n+1][3];\n\t\tif(arr[0] == 1 || arr[0] == 3) {\n\t\t\tdp[0][1] = 1;\n\t\t}\n\t\tif(arr[0] == 2 || arr[0] == 3) {\n\t\t\tdp[0][2] = 1;\n\t\t}\n\t\tfor(int i=1; i<n; i++) {\n\t\t\tdp[i][0] = max(dp[i-1][0],max(dp[i-1][1],dp[i-1][2]));\n\t\t\tdp[i][1] = max(dp[i-1][0],dp[i-1][2]);\n\t\t\tdp[i][2] = max(dp[i-1][0],dp[i-1][1]);\n\t\t\tif(arr[i] == 1 || arr[i] == 3) {\n\t\t\t\tdp[i][1]++;\n\t\t\t}\n\t\t\tif(arr[i] == 2 || arr[i] == 3) {\n\t\t\t\tdp[i][2]++;\n\t\t\t}\n\t\t}\n\t\tint max = 0;\n\t\tmax = max(dp[n-1][0],max(dp[n-1][1],dp[n-1][2]));\n\t\tSystem.out.println(n-max);\n\t\t\n\t\t\n\t\n\n\t}\n\n\tstatic class FastScanner {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st = new StringTokenizer(\"\");\n\n\t\tString next() {\n\t\t\twhile (!st.hasMoreTokens())\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tint[] readArray(int n) {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\n\t\tlong[] readArrayLong(int n) {\n\t\t\tlong[] a = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tString nextLine() {\n\t\t\tString str = \"\";\n\t\t\ttry {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn str;\n\t\t}\n\t}\n\n\tstatic int ceil(int x, int y) {\n\t\treturn (x % y == 0 ? x / y : (x / y + 1));\n\t}\n\n\tstatic long ceil(long x, long y) {\n\t\treturn (x % y == 0 ? x / y : (x / y + 1));\n\t}\n\n\tstatic int max(int x, int y) {\n\t\treturn Math.max(x, y);\n\t}\n\n\tstatic int min(int x, int y) {\n\t\treturn Math.min(x, y);\n\t}\n\n\tstatic long max(long x, long y) {\n\t\treturn Math.max(x, y);\n\t}\n\n\tstatic long min(long x, long y) {\n\t\treturn Math.min(x, y);\n\t}\n\n\tstatic int min(int a[]) {\n\t\tint x = 1_000_000_00_9;\n\t\tfor (int i = 0; i < a.length; i++)\n\t\t\tx = min(x, a[i]);\n\t\treturn x;\n\t}\n\n\tstatic int max(int a[]) {\n\t\tint x = -1_000_000_00_9;\n\t\tfor (int i = 0; i < a.length; i++)\n\t\t\tx = max(x, a[i]);\n\t\treturn x;\n\t}\n\n\tstatic long min(long a[]) {\n\t\tlong x = (long) 3e18;\n\t\tfor (int i = 0; i < a.length; i++)\n\t\t\tx = min(x, a[i]);\n\t\treturn x;\n\t}\n\n\tstatic long max(long a[]) {\n\t\tlong x = -(long) 3e18;\n\t\tfor (int i = 0; i < a.length; i++)\n\t\t\tx = max(x, a[i]);\n\t\treturn x;\n\t}\n\n\tstatic int power(int x, int y) {\n\t\tint res = 1;\n\t\twhile (y > 0) {\n\t\t\tif (y % 2 == 1)\n\t\t\t\tres = (res * x);\n\t\t\ty >>= 1;\n\t\t\tx = (x * x);\n\t\t}\n\t\treturn res;\n\t}\n\n\tstatic long power(long x, long y) {\n\t\tlong res = 1;\n\t\twhile (y > 0) {\n\t\t\tif (y % 2 == 1)\n\t\t\t\tres = (res * x);\n\t\t\ty >>= 1;\n\t\t\tx = (x * x);\n\t\t}\n\t\treturn res;\n\t}\n\n\tstatic void intsort(int[] a) {\n\t\tList<Integer> temp = new ArrayList<Integer>();\n\t\tfor (int i = 0; i < a.length; i++)\n\t\t\ttemp.add(a[i]);\n\t\tCollections.sort(temp);\n\t\tfor (int i = 0; i < a.length; i++)\n\t\t\ta[i] = temp.get(i);\n\t}\n\n\tstatic void longsort(long[] a) {\n\t\tList<Long> temp = new ArrayList<Long>();\n\t\tfor (int i = 0; i < a.length; i++)\n\t\t\ttemp.add(a[i]);\n\t\tCollections.sort(temp);\n\t\tfor (int i = 0; i < a.length; i++)\n\t\t\ta[i] = temp.get(i);\n\t}\n\n\tstatic void reverseintsort(int[] a) {\n\t\tList<Integer> temp = new ArrayList<Integer>();\n\t\tfor (int i = 0; i < a.length; i++)\n\t\t\ttemp.add(a[i]);\n\t\tCollections.sort(temp);\n\t\tCollections.reverseOrder();\n\t\tfor (int i = 0; i < a.length; i++)\n\t\t\ta[i] = temp.get(i);\n\t}\n\n\tstatic void reverselongsort(long[] a) {\n\t\tList<Long> temp = new ArrayList<Long>();\n\t\tfor (int i = 0; i < a.length; i++)\n\t\t\ttemp.add(a[i]);\n\t\tCollections.sort(temp);\n\t\tCollections.reverseOrder();\n\t\tfor (int i = 0; i < a.length; i++)\n\t\t\ta[i] = temp.get(i);\n\t}\n\n\tstatic class longpair implements Comparable<longpair> {\n\t\tlong x, y;\n\n\t\tlongpair(long x, long y) {\n\t\t\tthis.x = x;\n\t\t\tthis.y = y;\n\t\t}\n\n\t\tpublic int compareTo(longpair p) {\n\t\t\treturn Long.compare(this.x, p.x);\n\t\t}\n\t}\n\n\tstatic class intpair implements Comparable<intpair> {\n\t\tint x, y;\n\n\t\tintpair(int x, int y) {\n\t\t\tthis.x = x;\n\t\t\tthis.y = y;\n\t\t}\n\n\t\t@Override\n\t\tpublic int compareTo(intpair o) {\n\t\t\treturn Integer.compare(this.x, o.x);\n\t\t}\n\n\t\t//\t\ta = new pair [n];\n\t\t//\t\ta[i] = new pair(coo,cost);\n\n\t}\n\n\tpublic static int gcd(int a, int b) {\n\t\tBigInteger b1 = BigInteger.valueOf(a);\n\t\tBigInteger b2 = BigInteger.valueOf(b);\n\t\tBigInteger gcd = b1.gcd(b2);\n\t\treturn gcd.intValue();\n\t}\n\n\tpublic static long gcd(long a, long b) {\n\t\tBigInteger b1 = BigInteger.valueOf(a);\n\t\tBigInteger b2 = BigInteger.valueOf(b);\n\t\tBigInteger gcd = b1.gcd(b2);\n\t\treturn gcd.longValue();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "dp"], "code_uid": "6743ba98078a6531c6a903ae7e47031c", "src_uid": "08f1ba79ced688958695a7cfcfdda035", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.Scanner;\n\npublic class SimpleMolecules {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt(), b = sc.nextInt(), c = sc.nextInt();\n\t\tint sum = a + b + c;\n\t\tif ((sum & 1) != 0)\n\t\t\tSystem.out.println(\"Impossible\");\n\t\telse {\n\t\t\tsum >>= 1;\n\t\t\tint x = sum - a;\n\t\t\tint y = sum - b;\n\t\t\tint z = sum - c;\n\t\t\tif(x >= 0 && y >= 0 && z >= 0)\n\t\t\t\tSystem.out.printf(\"%d %d %d\\n\", z, x, y);\n\t\t\telse\n\t\t\t\tSystem.out.println(\"Impossible\");\n\t\t}\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "graphs"], "code_uid": "a2b4d7e6dda98082894ac8d36e4dc52b", "src_uid": "b3b986fddc3770fed64b878fa42ab1bc", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.lang.reflect.Array;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\nimport java.util.TreeSet;\n\npublic class A1008 {\n public static void main(String [] args) /*throws Exception*/ {\n InputStream inputReader = System.in;\n OutputStream outputReader = System.out;\n InputReader in = new InputReader(inputReader);//new InputReader(new FileInputStream(new File(\"input.txt\")));new InputReader(inputReader);\n PrintWriter out = new PrintWriter(outputReader);//new PrintWriter(new FileOutputStream(new File(\"output.txt\")));\n Algorithm solver = new Algorithm();\n solver.solve(in, out);\n out.close();\n }\n}\n\nclass Algorithm {\n void solve(InputReader ir, PrintWriter pw) {\n\n int x = ir.nextInt(), k = ir.nextInt();\n int min = Integer.MAX_VALUE;\n\n for (int i = 1; i < k; i++) {\n int f = Integer.MAX_VALUE, q = x / i;\n\n if (x % i == 0) f = q * k + i;\n\n min = Math.min(f, min);\n }\n\n pw.print(min);\n\n }\n\n private static void mergeSort(int[] array) {\n if(array.length == 1)\n return;\n int[] first = new int[array.length / 2];\n int[] second = new int[array.length - first.length];\n System.arraycopy(array, 0, first, 0, first.length);\n System.arraycopy(array, first.length, second, 0, second.length);\n\n mergeSort(first);\n mergeSort(second);\n\n merge(first, second, array);\n }\n\n private static void merge(int[] first, int[] second, int[] result) {\n int iFirst = 0;\n int iSecond = 0;\n int j = 0;\n\n while (iFirst < first.length && iSecond < second.length) {\n if (first[iFirst] < second[iSecond]) {\n result[j] = first[iFirst];\n iFirst++;\n }\n else {\n result[j] = second[iSecond];\n iSecond++;\n }\n j++;\n }\n System.arraycopy(first, iFirst, result, j, first.length - iFirst);\n System.arraycopy(second, iSecond, result, j, second.length - iSecond);\n }\n\n}\n\nclass InputReader {\n private BufferedReader reader;\n private StringTokenizer tokenizer;\n\n InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n String nextLine(){\n String fullLine;\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n fullLine = reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n return fullLine;\n }\n return null;\n }\n\n String [] toArray() {\n return nextLine().split(\" \");\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n double nextDouble() {\n return Double.parseDouble(next());\n }\n long nextLong() {\n return Long.parseLong(next());\n }\n\n}", "lang_cluster": "Java", "tags": ["math"], "code_uid": "34778861922e3098156e4cdb24dde93f", "src_uid": "ed0ebc1e484fcaea875355b5b7944c57", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.StringTokenizer;\n\n\npublic class Main {\n\n public static void main(String[] args) throws IOException {\n Scanner sc = new Scanner(System.in);\n PrintWriter out = new PrintWriter(System.out);\n long m = sc.nextLong();\n long lo = 0;\n long hi = (long) 1e16;\n long ans = -1;\n while (lo <= hi) {\n long mid = (lo + hi) /2;\n long ways = getNumberofways(mid);\n if (ways == m) ans = mid;\n if (ways >= m) hi=mid-1;\n else lo = mid+1;\n }\n out.println(ans);\n out.close();\n out.flush();\n }\n\n static long getNumberofways(long n) {\n long cnt = 0;\n for (long k = 2; 1l * k * k * k <= n; k++) {\n long mult = 1l * k * k * k;\n cnt += n / mult;\n }\n return cnt;\n }\n\n\n static class Scanner {\n StringTokenizer st;\n BufferedReader br;\n\n public Scanner(InputStream system) {\n br = new BufferedReader(new InputStreamReader(system));\n }\n\n\n public String next() throws IOException {\n while (st == null || !st.hasMoreTokens()) st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n\n public String nextLine() throws IOException {\n return br.readLine();\n }\n\n public int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n\n public char nextChar() throws IOException {\n return next().charAt(0);\n }\n\n public Long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n public boolean ready() throws IOException {\n return br.ready();\n }\n\n\n public int[] nextIntArray(int n) throws IOException {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = nextInt();\n return a;\n }\n\n public long[] nextLongArray(int n) throws IOException {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nextLong();\n return a;\n }\n\n\n public Integer[] nextIntegerArray(int n) throws IOException {\n Integer[] a = new Integer[n];\n for (int i = 0; i < n; i++)\n a[i] = nextInt();\n return a;\n }\n\n public double[] nextDoubleArray(int n) throws IOException {\n double[] ans = new double[n];\n for (int i = 0; i < n; i++)\n ans[i] = nextDouble();\n return ans;\n }\n\n public short nextShort() throws IOException {\n return Short.parseShort(next());\n }\n\n }\n\n}", "lang_cluster": "Java", "tags": ["math", "binary search", "combinatorics"], "code_uid": "c2c07d3accf8cb9bd0bf1194c788f274", "src_uid": "602deaad5c66e264997249457d555129", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "\nimport java.util.*;\nimport java.util.Collections;\n\npublic class LifewithoutZeroes\n{\n\tpublic static void main(String args[])\n\t{\n\t\t\n\t\tScanner sc=new Scanner(System.in);\n\n\t\tint a,b,i;\n\t\tint ans,ans1;\n\t\tString s,p,t=\"\",m=\"\",k=\"\",l=\"\";\n\n\t\ta=sc.nextInt();\n\t\tb=sc.nextInt();\n\t\tans=a+b;\n\t\tk=Integer.toString(ans);\n\t\tfor(i=0;i<k.length();i++) {\n\t\t\tif(k.charAt(i)!='0')\n\t\t\t\tl=l+k.charAt(i);\n\t\t}\n\t\tans=Integer.parseInt(l);\n\t\t\n\t\ts=Integer.toString(a);\n\t\tp=Integer.toString(b);\n\t\t\n\t\tfor(i=0;i<s.length();i++) {\n\t\t\tif(s.charAt(i)!='0')\n\t\t\t\tt=t+s.charAt(i);\n\t\t}\n\t\tfor(i=0;i<p.length();i++) {\n\t\t\tif(p.charAt(i)!='0')\n\t\t\t\tm=m+p.charAt(i);\n\t\t}\n\t\t\n\t\tans1=Integer.parseInt(t)+Integer.parseInt(m);\n\t\t\n\t\tif(ans==ans1)\n\t\tSystem.out.println(\"YES\");\n\t\telse\n\t\t\tSystem.out.println(\"NO\");\n\n\t\tsc.close();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "ce2312f0021923f089d2cdf46f36c5da", "src_uid": "ac6971f4feea0662d82da8e0862031ad", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class A {\n\n\tprivate void solve() throws IOException {\n\t\tchar[] c = nextToken().toCharArray();\n\t\tint[] a = new int[6];\n\t\tfor (int i = 0; i < 6; i++) {\n\t\t\ta[i] = c[i];\n\t\t}\n\t\tint res = generateCubes(a);\n\t\tout.println(res);\n\t}\n\n\tstatic boolean nextPermutation(int[] p) {\n\t\tfor (int i = p.length - 2; i >= 0; --i) {\n\t\t\tif (p[i] >= p[i + 1]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tint j = i + 1;\n\t\t\twhile (j + 1 < p.length && p[j + 1] > p[i]) {\n\t\t\t\tj++;\n\t\t\t}\n\t\t\tint t = p[i];\n\t\t\tp[i] = p[j];\n\t\t\tp[j] = t;\n\t\t\tArrays.sort(p, i + 1, p.length);\n\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n\n\tstatic int generateCubes(int[] alphabet) {\n\t\tCube[] allcubes = generateCubes();\n\t\tArrays.sort(alphabet);\n\n\t\tHashSet<Cube> visited = new HashSet<A.Cube>();\n\t\tint res = 0;\n\t\tint[] a1 = new int[6];\n\t\tdo {\n\t\t\tboolean ok = true;\n\t\t\tfor (Cube c : allcubes) {\n\t\t\t\tfor (int i = 0; i < 6; i++) {\n\t\t\t\t\ta1[c.a[i]] = alphabet[i];\n\t\t\t\t}\n\t\t\t\tCube c1 = new Cube(a1);\n\t\t\t\tif (visited.contains(c1)) {\n\t\t\t\t\tok = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (ok) {\n\t\t\t\tres++;\n\t\t\t\tvisited.add(new Cube(alphabet.clone()));\n\t\t\t}\n\t\t} while (nextPermutation(alphabet));\n\t\treturn res;\n\t}\n\n\tstatic Cube[] generateCubes() {\n\t\tCube start = new Cube(new int[] { 0, 1, 2, 3, 4, 5 });\n\t\tQueue<Cube> q = new ArrayDeque<A.Cube>();\n\t\tHashSet<Cube> visited = new HashSet<A.Cube>();\n\t\tq.add(start);\n\t\tvisited.add(start);\n\t\twhile (!q.isEmpty()) {\n\t\t\tCube u = q.poll();\n\t\t\tfor (Cube v : new Cube[] { u.rotate1(), u.rotate2(), u.rotate3() }) {\n\t\t\t\tif (!visited.contains(v)) {\n\t\t\t\t\tvisited.add(v);\n\t\t\t\t\tq.add(v);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn (Cube[]) visited.toArray(new Cube[visited.size()]);\n\t}\n\n\tstatic class Cube {\n\t\t@Override\n\t\tpublic int hashCode() {\n\t\t\tfinal int prime = 31;\n\t\t\tint result = 1;\n\t\t\tresult = prime * result + Arrays.hashCode(a);\n\t\t\treturn result;\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean equals(Object obj) {\n\t\t\tif (this == obj)\n\t\t\t\treturn true;\n\t\t\tif (obj == null)\n\t\t\t\treturn false;\n\t\t\tif (getClass() != obj.getClass())\n\t\t\t\treturn false;\n\t\t\tCube other = (Cube) obj;\n\t\t\tif (!Arrays.equals(a, other.a))\n\t\t\t\treturn false;\n\t\t\treturn true;\n\t\t}\n\n\t\tint[] a;\n\n\t\tpublic Cube(int[] a) {\n\t\t\tthis.a = a;\n\t\t}\n\n\t\tCube rotate1() {\n\t\t\tint[] a1 = a.clone();\n\t\t\ta1[0] = a[5];\n\t\t\ta1[5] = a[1];\n\t\t\ta1[1] = a[4];\n\t\t\ta1[4] = a[0];\n\t\t\treturn new Cube(a1);\n\t\t}\n\n\t\tCube rotate2() {\n\t\t\tint[] a1 = a.clone();\n\t\t\ta1[0] = a[3];\n\t\t\ta1[3] = a[1];\n\t\t\ta1[1] = a[2];\n\t\t\ta1[2] = a[0];\n\t\t\treturn new Cube(a1);\n\t\t}\n\n\t\tCube rotate3() {\n\t\t\tint[] a1 = a.clone();\n\t\t\ta1[4] = a[3];\n\t\t\ta1[3] = a[5];\n\t\t\ta1[5] = a[2];\n\t\t\ta1[2] = a[4];\n\t\t\treturn new Cube(a1);\n\t\t}\n\n\t}\n\n\tpublic static void main(String[] args) {\n\t\ttry {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(System.out);\n\t\t\tnew A().solve();\n\t\t\tout.close();\n\t\t} catch (Throwable e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(239);\n\t\t}\n\t}\n\n\tstatic BufferedReader br;\n\tstatic StringTokenizer st;\n\tstatic PrintWriter out;\n\n\tstatic String nextToken() throws IOException {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\tString line = br.readLine();\n\t\t\tif (line == null) {\n\t\t\t\treturn null;\n\t\t\t}\n\t\t\tst = new StringTokenizer(line);\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tstatic int nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tstatic long nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tstatic double nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "21ebcccc02a973c00976ce80a097e7b6", "src_uid": "8176c709c774fa87ca0e45a5a502a409", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.lang.reflect.Array;\nimport java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scanner in = new Scanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n Task solver = new Task();\n solver.solve(in, out);\n out.close();\n }\n}\n\nclass Task {\n\n // static int MAX = 1000001;\n// List<List<Integer>> g = new ArrayList<>();\n// int n;\n// char[] s;\n\n public void solve(Scanner in, PrintWriter out) {\n int t = in.nextInt();\n int l = in.nextInt();\n int r = in.nextInt();\n\n long[] a = new long[r + 1];\n boolean[] prime = new boolean[r + 1];\n Arrays.fill(prime, true);\n prime[0] = prime[1] = false;\n for (int i = 2; i <= r; i++) {\n if (prime[i]) {\n if ((long)i * i <= (long)r) {\n for (long j = (long)i*i; j <= r; j+=i) {\n prime[(int)j] = false;\n }\n }\n }\n }\n\n\n List<Integer> pr = new ArrayList<>();\n for (int i = 2; i <= r; i++) {\n if (prime[i]) {\n pr.add(i);\n a[i] = (long) i * (i - 1) / 2;\n } else {\n for (Integer p : pr) {\n if (i % p == 0) {\n int p1 = i / p;\n int max = Math.max(p, p1);\n int min = Math.min(p, p1);\n a[i] = a[min] * max + a[max];\n break;\n }\n }\n }\n }\n\n long tt[] = new long[r];\n tt[0] = 1;\n long temp = 1;\n for (int i = 1; i <= r - l; i++) {\n temp *= (long)t;\n temp %= 1000000007;\n tt[i] = temp;\n }\n\n long res = 0;\n for (int i = 0; i <= r - l; i++) {\n res += (tt[i] * (a[i + l] % 1000000007)) % 1000000007;\n res %= 1000000007;\n }\n\n System.out.println(res);\n }\n\n\n}\n\nclass Utils {\n\n public static int binarySearch(int[] a, int key) {\n int s = 0;\n int f = a.length;\n while (f > s) {\n int mid = (s + f) / 2;\n if (a[mid] > key) {\n f = mid - 1;\n } else if (a[mid] <= key) {\n s = mid + 1;\n }\n }\n return -1;\n }\n\n public static long gcd(long a, long b) {\n return b != 0 ? gcd(b, a % b) : a;\n }\n\n public static long lcm(long a, long b) {\n return a / gcd(a, b) * b;\n }\n\n static List<Integer> prime(int number) {\n List<Integer> a = new ArrayList<>();\n for (int i = 2; i * i <= number; i++) {\n if (number % i == 0) {\n a.add(i);\n number /= i;\n i = 1;\n }\n }\n a.add(number);\n return a;\n }\n}\n\nclass Pair<T, U> {\n public T a;\n public U b;\n\n public Pair(T a, U b) {\n this.a = a;\n this.b = b;\n }\n\n @Override\n public boolean equals(Object o) {\n if (this == o) return true;\n if (o == null || getClass() != o.getClass()) return false;\n\n Pair<?, ?> pair = (Pair<?, ?>) o;\n\n if (a != null ? !a.equals(pair.a) : pair.a != null) return false;\n return b != null ? b.equals(pair.b) : pair.b == null;\n }\n\n @Override\n public int hashCode() {\n int result = a != null ? a.hashCode() : 0;\n result = 31 * result + (b != null ? b.hashCode() : 0);\n return result;\n }\n}\n\n\nclass Vect {\n public int a;\n public int b;\n\n public Vect(int a, int b) {\n this.a = a;\n this.b = b;\n }\n\n @Override\n public boolean equals(Object o) {\n if (this == o) return true;\n if (o == null || getClass() != o.getClass()) return false;\n\n Vect vect = (Vect) o;\n\n if (a != vect.a) return false;\n return b == vect.b;\n }\n\n @Override\n public int hashCode() {\n int result = a;\n result = 31 * result + b;\n return result;\n }\n}\n\nclass Tri {\n public int a;\n public int b;\n public int c;\n\n public Tri(int a, int b, int c) {\n this.a = a;\n this.b = b;\n this.c = c;\n }\n\n @Override\n public boolean equals(Object o) {\n if (this == o) return true;\n if (o == null || getClass() != o.getClass()) return false;\n\n Tri tri = (Tri) o;\n\n if (a != tri.a) return false;\n return b == tri.b;\n }\n\n @Override\n public int hashCode() {\n int result = a;\n result = 31 * result + b;\n return result;\n }\n}\n\nclass Triple<T, U, P> {\n public T a;\n public U b;\n public P c;\n\n public Triple(T a, U b, P c) {\n this.a = a;\n this.b = b;\n this.c = c;\n }\n\n @Override\n public boolean equals(Object o) {\n if (this == o) return true;\n if (o == null || getClass() != o.getClass()) return false;\n\n Triple<?, ?, ?> triple = (Triple<?, ?, ?>) o;\n\n if (a != null ? !a.equals(triple.a) : triple.a != null) return false;\n return b != null ? b.equals(triple.b) : triple.b == null;\n }\n\n @Override\n public int hashCode() {\n int result = a != null ? a.hashCode() : 0;\n result = 31 * result + (b != null ? b.hashCode() : 0);\n return result;\n }\n}\n\n\nclass Scanner {\n BufferedReader in;\n StringTokenizer tok;\n\n public Scanner(InputStream in) {\n this.in = new BufferedReader(new InputStreamReader(in));\n tok = new StringTokenizer(\"\");\n }\n\n private String tryReadNextLine() {\n try {\n return in.readLine();\n } catch (Exception e) {\n throw new InputMismatchException();\n }\n }\n\n public String nextToken() {\n while (!tok.hasMoreTokens()) {\n tok = new StringTokenizer(next());\n }\n return tok.nextToken();\n }\n\n public String next() {\n String newLine = tryReadNextLine();\n if (newLine == null)\n throw new InputMismatchException();\n return newLine;\n }\n\n public int nextInt() {\n return Integer.parseInt(nextToken());\n }\n\n public long nextLong() {\n return Long.parseLong(nextToken());\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "greedy", "number theory"], "code_uid": "823fdd6e279520128bc90a932064d2c2", "src_uid": "c9d45dac4a22f8f452d98d05eca2e79b", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\nimport java.lang.reflect.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tOutputWriter out = new OutputWriter(outputStream);\n\t\tTask solver = new TaskC();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\ninterface Task {\n\tpublic void solve(int testNumber, InputReader in, OutputWriter out);\n}\n\nclass TaskA implements Task {\n\n\tpublic void solve(int testNumber, InputReader in, OutputWriter out) {\n\t\tint n=in.readInt();\n\t\twhile (n-->0) {\n\t\t\tint a=in.readInt(), b=in.readInt();\n\t\t\tout.printLine(gcd(a, b));\n\t\t}\n\t}\n\t\n\tint gcd(int a, int b) {\n\t\treturn b==0?0:a/b+gcd(b, a%b);\n\t}\n\n}\n\nclass TaskB implements Task {\n\t\n\tboolean[] vis;\n\tint[] arr;\n\tList<Long> div;\n\tboolean[] sieve;\n\t\n\tpublic void solve(int testNumber, InputReader in, OutputWriter out) {\n\t\tint n=in.readInt(), m=in.readInt();\n\t\tarr=new int[n+1];\n\t\tvis=new boolean[n+1];\n\t\tsieve=IntegerUtils.generatePrimalityTable(n+1);\n\t\twhile (m-->0) {\n\t\t\tchar c=in.readCharacter();\n\t\t\tint x=in.readInt();\n\t\t\tdiv=IntegerUtils.getDivisors(x);\n\t\t\tif (c=='+') {\n\t\t\t\tif (vis[x]) {\n\t\t\t\t\tout.printLine(\"Already on\");\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tboolean val=true;\n\t\t\t\tfor (long y: div) if (sieve[(int)y] && arr[(int)y]>0) {\n\t\t\t\t\tval=false;\n\t\t\t\t\tout.printLine(\"Conflict with\", arr[(int)y]);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif (!val) continue;\n\t\t\t\tout.printLine(\"Success\");\n\t\t\t\tvis[x]=true;\n\t\t\t\tfor (long y: div) if (sieve[(int)y]) arr[(int)y]=x;\n\t\t\t}\n\t\t\telse if (vis[x]) {\n\t\t\t\tout.printLine(\"Success\");\n\t\t\t\tvis[x]=false;\n\t\t\t\tfor (long y: div) arr[(int)y]=0;\n\t\t\t}\n\t\t\telse out.printLine(\"Already off\");\n\t\t}\n\t}\n\n}\n\nclass TaskC implements Task {\n\n\tpublic void solve(int testNumber, InputReader in, OutputWriter out) {\n\t\tint a=in.readInt(), b=in.readInt();\n\t\tlong l=IntegerUtils.lcm(a, b);\n\t\tif (Math.abs(l/a-l/b)<=1) out.printLine(\"Equal\");\n\t\telse out.printLine(a<b?\"Dasha\":\"Masha\");\n\t}\n\n}\n\nclass TaskD implements Task {\n\n\tpublic void solve(int testNumber, InputReader in, OutputWriter out) {\n\t\tint n=in.readInt(), m=in.readInt();\n\t\t\n\t}\n}\n\nclass TaskE implements Task {\n\n\tpublic void solve(int testNumber, InputReader in, OutputWriter out) {\n\n\t}\n\n}\n\nclass TaskF implements Task {\n\n\tpublic void solve(int testNumber, InputReader in, OutputWriter out) {\n\n\t}\n\n}\n\nclass TaskG implements Task {\n\t\n\tpublic void solve(int testNumber, InputReader in, OutputWriter out) {\n\n\t}\n\t\n}\n\nclass OutputWriter {\n\tprivate final PrintWriter writer;\n\n\tpublic OutputWriter(OutputStream outputStream) {\n\t\twriter = new PrintWriter(new BufferedWriter(new OutputStreamWriter(\n\t\t\t\toutputStream)));\n\t}\n\n\tpublic OutputWriter(Writer writer) {\n\t\tthis.writer = new PrintWriter(writer);\n\t}\n\n\tpublic void print(char[] array) {\n\t\twriter.print(array);\n\t}\n\n\tpublic void print(Object... objects) {\n\t\tfor (int i = 0; i < objects.length; i++) {\n\t\t\tif (i != 0)\n\t\t\t\twriter.print(' ');\n\t\t\twriter.print(objects[i]);\n\t\t}\n\t}\n\n\tpublic void print(int[] array) {\n\t\tfor (int i = 0; i < array.length; i++) {\n\t\t\tif (i != 0)\n\t\t\t\twriter.print(' ');\n\t\t\twriter.print(array[i]);\n\t\t}\n\t}\n\n\tpublic void print(long[] array) {\n\t\tfor (int i = 0; i < array.length; i++) {\n\t\t\tif (i != 0)\n\t\t\t\twriter.print(' ');\n\t\t\twriter.print(array[i]);\n\t\t}\n\t}\n\n\tpublic void print(Collection<Integer> collection) {\n\t\tboolean first = true;\n\t\tfor (int value : collection) {\n\t\t\tif (first)\n\t\t\t\tfirst = false;\n\t\t\telse\n\t\t\t\twriter.print(' ');\n\t\t\twriter.print(value);\n\t\t}\n\t}\n\n\tpublic void printLine(int[] array) {\n\t\tprint(array);\n\t\twriter.println();\n\t}\n\n\tpublic void printLine(long[] array) {\n\t\tprint(array);\n\t\twriter.println();\n\t}\n\n\tpublic void printLine(Collection<Integer> collection) {\n\t\tprint(collection);\n\t\twriter.println();\n\t}\n\n\tpublic void printLine() {\n\t\twriter.println();\n\t}\n\n\tpublic void printLine(Object... objects) {\n\t\tprint(objects);\n\t\twriter.println();\n\t}\n\n\tpublic void print(char i) {\n\t\twriter.print(i);\n\t}\n\n\tpublic void printLine(char i) {\n\t\twriter.println(i);\n\t}\n\n\tpublic void printLine(char[] array) {\n\t\twriter.println(array);\n\t}\n\n\tpublic void printFormat(String format, Object... objects) {\n\t\twriter.printf(format, objects);\n\t}\n\n\tpublic void close() {\n\t\twriter.close();\n\t}\n\n\tpublic void flush() {\n\t\twriter.flush();\n\t}\n\n\tpublic void print(long i) {\n\t\twriter.print(i);\n\t}\n\n\tpublic void printLine(long i) {\n\t\twriter.println(i);\n\t}\n\n\tpublic void print(int i) {\n\t\twriter.print(i);\n\t}\n\n\tpublic void printLine(int i) {\n\t\twriter.println(i);\n\t}\n}\n\nclass InputReader {\n\tprivate boolean finished = false;\n\n\tprivate InputStream stream;\n\tprivate byte[] buf = new byte[1024];\n\tprivate int curChar;\n\tprivate int numChars;\n\tprivate SpaceCharFilter filter;\n\n\tpublic InputReader(InputStream stream) {\n\t\tthis.stream = stream;\n\t}\n\n\tpublic int read() {\n\t\tif (numChars == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (curChar >= numChars) {\n\t\t\tcurChar = 0;\n\t\t\ttry {\n\t\t\t\tnumChars = stream.read(buf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (numChars <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buf[curChar++];\n\t}\n\n\tpublic int peek() {\n\t\tif (numChars == -1)\n\t\t\treturn -1;\n\t\tif (curChar >= numChars) {\n\t\t\tcurChar = 0;\n\t\t\ttry {\n\t\t\t\tnumChars = stream.read(buf);\n\t\t\t} catch (IOException e) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tif (numChars <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buf[curChar];\n\t}\n\n\tpublic int readInt() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tint res = 0;\n\t\tdo {\n\t\t\tif (c < '0' || c > '9')\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n\n\tpublic long readLong() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tlong res = 0;\n\t\tdo {\n\t\t\tif (c < '0' || c > '9')\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n\n\tpublic String readString() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tStringBuilder res = new StringBuilder();\n\t\tdo {\n\t\t\tif (Character.isValidCodePoint(c))\n\t\t\t\tres.appendCodePoint(c);\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res.toString();\n\t}\n\n\tpublic boolean isSpaceChar(int c) {\n\t\tif (filter != null)\n\t\t\treturn filter.isSpaceChar(c);\n\t\treturn isWhitespace(c);\n\t}\n\n\tpublic static boolean isWhitespace(int c) {\n\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t}\n\n\tprivate String readLine0() {\n\t\tStringBuilder buf = new StringBuilder();\n\t\tint c = read();\n\t\twhile (c != '\\n' && c != -1) {\n\t\t\tif (c != '\\r')\n\t\t\t\tbuf.appendCodePoint(c);\n\t\t\tc = read();\n\t\t}\n\t\treturn buf.toString();\n\t}\n\n\tpublic String readLine() {\n\t\tString s = readLine0();\n\t\twhile (s.trim().length() == 0)\n\t\t\ts = readLine0();\n\t\treturn s;\n\t}\n\n\tpublic String readLine(boolean ignoreEmptyLines) {\n\t\tif (ignoreEmptyLines)\n\t\t\treturn readLine();\n\t\telse\n\t\t\treturn readLine0();\n\t}\n\n\tpublic BigInteger readBigInteger() {\n\t\ttry {\n\t\t\treturn new BigInteger(readString());\n\t\t} catch (NumberFormatException e) {\n\t\t\tthrow new InputMismatchException();\n\t\t}\n\t}\n\n\tpublic char readCharacter() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\treturn (char) c;\n\t}\n\n\tpublic double readDouble() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tdouble res = 0;\n\t\twhile (!isSpaceChar(c) && c != '.') {\n\t\t\tif (c == 'e' || c == 'E')\n\t\t\t\treturn res * Math.pow(10, readInt());\n\t\t\tif (c < '0' || c > '9')\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t}\n\t\tif (c == '.') {\n\t\t\tc = read();\n\t\t\tdouble m = 1;\n\t\t\twhile (!isSpaceChar(c)) {\n\t\t\t\tif (c == 'e' || c == 'E')\n\t\t\t\t\treturn res * Math.pow(10, readInt());\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tm /= 10;\n\t\t\t\tres += (c - '0') * m;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t}\n\t\treturn res * sgn;\n\t}\n\n\tpublic boolean isExhausted() {\n\t\tint value;\n\t\twhile (isSpaceChar(value = peek()) && value != -1)\n\t\t\tread();\n\t\treturn value == -1;\n\t}\n\n\tpublic String next() {\n\t\treturn readString();\n\t}\n\n\tpublic SpaceCharFilter getFilter() {\n\t\treturn filter;\n\t}\n\n\tpublic void setFilter(SpaceCharFilter filter) {\n\t\tthis.filter = filter;\n\t}\n\n\tpublic interface SpaceCharFilter {\n\t\tpublic boolean isSpaceChar(int ch);\n\t}\n}\n\nclass IOUtils {\n\tpublic static Pair<Integer, Integer> readIntPair(InputReader in) {\n\t\tint first = in.readInt();\n\t\tint second = in.readInt();\n\t\treturn Pair.makePair(first, second);\n\t}\n\n\tpublic static Pair<Long, Long> readLongPair(InputReader in) {\n\t\tlong first = in.readLong();\n\t\tlong second = in.readLong();\n\t\treturn Pair.makePair(first, second);\n\t}\n\n\tpublic static int[] readIntArray(InputReader in, int size) {\n\t\tint[] array = new int[size];\n\t\tfor (int i = 0; i < size; i++)\n\t\t\tarray[i] = in.readInt();\n\t\treturn array;\n\t}\n\n\tpublic static long[] readLongArray(InputReader in, int size) {\n\t\tlong[] array = new long[size];\n\t\tfor (int i = 0; i < size; i++)\n\t\t\tarray[i] = in.readLong();\n\t\treturn array;\n\t}\n\n\tpublic static double[] readDoubleArray(InputReader in, int size) {\n\t\tdouble[] array = new double[size];\n\t\tfor (int i = 0; i < size; i++)\n\t\t\tarray[i] = in.readDouble();\n\t\treturn array;\n\t}\n\n\tpublic static String[] readStringArray(InputReader in, int size) {\n\t\tString[] array = new String[size];\n\t\tfor (int i = 0; i < size; i++)\n\t\t\tarray[i] = in.readString();\n\t\treturn array;\n\t}\n\n\tpublic static char[] readCharArray(InputReader in, int size) {\n\t\tchar[] array = new char[size];\n\t\tfor (int i = 0; i < size; i++)\n\t\t\tarray[i] = in.readCharacter();\n\t\treturn array;\n\t}\n\n\tpublic static Pair<Integer, Integer>[] readIntPairArray(InputReader in,\n\t\t\tint size) {\n\t\t@SuppressWarnings({ \"unchecked\" })\n\t\tPair<Integer, Integer>[] result = new Pair[size];\n\t\tfor (int i = 0; i < size; i++)\n\t\t\tresult[i] = readIntPair(in);\n\t\treturn result;\n\t}\n\n\tpublic static Pair<Long, Long>[] readLongPairArray(InputReader in, int size) {\n\t\t@SuppressWarnings({ \"unchecked\" })\n\t\tPair<Long, Long>[] result = new Pair[size];\n\t\tfor (int i = 0; i < size; i++)\n\t\t\tresult[i] = readLongPair(in);\n\t\treturn result;\n\t}\n\n\tpublic static void readIntArrays(InputReader in, int[]... arrays) {\n\t\tfor (int i = 0; i < arrays[0].length; i++) {\n\t\t\tfor (int j = 0; j < arrays.length; j++)\n\t\t\t\tarrays[j][i] = in.readInt();\n\t\t}\n\t}\n\n\tpublic static void readLongArrays(InputReader in, long[]... arrays) {\n\t\tfor (int i = 0; i < arrays[0].length; i++) {\n\t\t\tfor (int j = 0; j < arrays.length; j++)\n\t\t\t\tarrays[j][i] = in.readLong();\n\t\t}\n\t}\n\n\tpublic static void readDoubleArrays(InputReader in, double[]... arrays) {\n\t\tfor (int i = 0; i < arrays[0].length; i++) {\n\t\t\tfor (int j = 0; j < arrays.length; j++)\n\t\t\t\tarrays[j][i] = in.readDouble();\n\t\t}\n\t}\n\n\tpublic static char[][] readTable(InputReader in, int rowCount,\n\t\t\tint columnCount) {\n\t\tchar[][] table = new char[rowCount][];\n\t\tfor (int i = 0; i < rowCount; i++)\n\t\t\ttable[i] = readCharArray(in, columnCount);\n\t\treturn table;\n\t}\n\n\tpublic static int[][] readIntTable(InputReader in, int rowCount,\n\t\t\tint columnCount) {\n\t\tint[][] table = new int[rowCount][];\n\t\tfor (int i = 0; i < rowCount; i++)\n\t\t\ttable[i] = readIntArray(in, columnCount);\n\t\treturn table;\n\t}\n\n\tpublic static double[][] readDoubleTable(InputReader in, int rowCount,\n\t\t\tint columnCount) {\n\t\tdouble[][] table = new double[rowCount][];\n\t\tfor (int i = 0; i < rowCount; i++)\n\t\t\ttable[i] = readDoubleArray(in, columnCount);\n\t\treturn table;\n\t}\n\n\tpublic static long[][] readLongTable(InputReader in, int rowCount,\n\t\t\tint columnCount) {\n\t\tlong[][] table = new long[rowCount][];\n\t\tfor (int i = 0; i < rowCount; i++)\n\t\t\ttable[i] = readLongArray(in, columnCount);\n\t\treturn table;\n\t}\n\n\tpublic static String[][] readStringTable(InputReader in, int rowCount,\n\t\t\tint columnCount) {\n\t\tString[][] table = new String[rowCount][];\n\t\tfor (int i = 0; i < rowCount; i++)\n\t\t\ttable[i] = readStringArray(in, columnCount);\n\t\treturn table;\n\t}\n\n\tpublic static String readText(InputReader in) {\n\t\tStringBuilder result = new StringBuilder();\n\t\twhile (true) {\n\t\t\tint character = in.read();\n\t\t\tif (character == '\\r')\n\t\t\t\tcontinue;\n\t\t\tif (character == -1)\n\t\t\t\tbreak;\n\t\t\tresult.append((char) character);\n\t\t}\n\t\treturn result.toString();\n\t}\n\n\tpublic static void readStringArrays(InputReader in, String[]... arrays) {\n\t\tfor (int i = 0; i < arrays[0].length; i++) {\n\t\t\tfor (int j = 0; j < arrays.length; j++)\n\t\t\t\tarrays[j][i] = in.readString();\n\t\t}\n\t}\n\n\tpublic static void printTable(OutputWriter out, char[][] table) {\n\t\tfor (char[] row : table)\n\t\t\tout.printLine(new String(row));\n\t}\n}\n\nclass ArrayUtils {\n\tprivate static int[] tempInt = new int[0];\n\tprivate static long[] tempLong = new long[0];\n\n\tpublic static Integer[] generateOrder(int size) {\n\t\tInteger[] order = new Integer[size];\n\t\tfor (int i = 0; i < size; i++)\n\t\t\torder[i] = i;\n\t\treturn order;\n\t}\n\n\tpublic static void fill(short[][] array, short value) {\n\t\tfor (short[] row : array)\n\t\t\tArrays.fill(row, value);\n\t}\n\n\tpublic static void fill(long[][] array, long value) {\n\t\tfor (long[] row : array)\n\t\t\tArrays.fill(row, value);\n\t}\n\n\tpublic static void fill(double[][] array, double value) {\n\t\tfor (double[] row : array)\n\t\t\tArrays.fill(row, value);\n\t}\n\n\tpublic static void fill(double[][][] array, double value) {\n\t\tfor (double[][] row : array)\n\t\t\tfill(row, value);\n\t}\n\n\tpublic static void fill(double[][][][] array, double value) {\n\t\tfor (double[][][] row : array)\n\t\t\tfill(row, value);\n\t}\n\n\tpublic static void fill(double[][][][][] array, double value) {\n\t\tfor (double[][][][] row : array)\n\t\t\tfill(row, value);\n\t}\n\n\tpublic static void fill(long[][][] array, long value) {\n\t\tfor (long[][] row : array)\n\t\t\tfill(row, value);\n\t}\n\n\tpublic static void fill(long[][][][] array, long value) {\n\t\tfor (long[][][] row : array)\n\t\t\tfill(row, value);\n\t}\n\n\tpublic static void fill(long[][][][][] array, long value) {\n\t\tfor (long[][][][] row : array)\n\t\t\tfill(row, value);\n\t}\n\n\tpublic static void fillColumn(long[][] array, int index, long value) {\n\t\tfor (long[] row : array)\n\t\t\trow[index] = value;\n\t}\n\n\tpublic static void fillColumn(int[][] array, int index, int value) {\n\t\tfor (int[] row : array)\n\t\t\trow[index] = value;\n\t}\n\n\tpublic static void fill(int[][] array, int value) {\n\t\tfor (int[] row : array)\n\t\t\tArrays.fill(row, value);\n\t}\n\n\tpublic static void fill(boolean[][] array, boolean value) {\n\t\tfor (boolean[] row : array)\n\t\t\tArrays.fill(row, value);\n\t}\n\n\tpublic static void fill(boolean[][][] array, boolean value) {\n\t\tfor (boolean[][] row : array)\n\t\t\tfill(row, value);\n\t}\n\n\tpublic static long sumArray(int[] array) {\n\t\tlong result = 0;\n\t\tfor (int element : array)\n\t\t\tresult += element;\n\t\treturn result;\n\t}\n\n\tpublic static int[] range(int from, int to) {\n\t\tint[] result = new int[Math.max(from, to) - Math.min(from, to) + 1];\n\t\tint index = 0;\n\t\tif (to > from) {\n\t\t\tfor (int i = from; i <= to; i++)\n\t\t\t\tresult[index++] = i;\n\t\t} else {\n\t\t\tfor (int i = from; i >= to; i--)\n\t\t\t\tresult[index++] = i;\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static void fill(int[][][] array, int value) {\n\t\tfor (int[][] subArray : array)\n\t\t\tfill(subArray, value);\n\t}\n\n\tpublic static void fill(short[][][] array, short value) {\n\t\tfor (short[][] subArray : array)\n\t\t\tfill(subArray, value);\n\t}\n\n\tpublic static void fill(int[][][][] array, int value) {\n\t\tfor (int[][][] subArray : array)\n\t\t\tfill(subArray, value);\n\t}\n\n\tpublic static void fill(short[][][][] array, short value) {\n\t\tfor (short[][][] subArray : array)\n\t\t\tfill(subArray, value);\n\t}\n\n\tpublic static void fill(int[][][][][] array, int value) {\n\t\tfor (int[][][][] subArray : array)\n\t\t\tfill(subArray, value);\n\t}\n\n\tpublic static void fill(short[][][][][] array, short value) {\n\t\tfor (short[][][][] subArray : array)\n\t\t\tfill(subArray, value);\n\t}\n\n\tpublic static void fill(int[][][][][][] array, int value) {\n\t\tfor (int[][][][][] subArray : array)\n\t\t\tfill(subArray, value);\n\t}\n\n\tpublic static void fill(short[][][][][][] array, short value) {\n\t\tfor (short[][][][][] subArray : array)\n\t\t\tfill(subArray, value);\n\t}\n\n\tpublic static void fill(int[][][][][][][] array, int value) {\n\t\tfor (int[][][][][][] subArray : array)\n\t\t\tfill(subArray, value);\n\t}\n\n\tpublic static void fill(short[][][][][][][] array, short value) {\n\t\tfor (short[][][][][][] subArray : array)\n\t\t\tfill(subArray, value);\n\t}\n\n\tpublic static Integer[] order(int size, Comparator<Integer> comparator) {\n\t\tInteger[] order = generateOrder(size);\n\t\tArrays.sort(order, comparator);\n\t\treturn order;\n\t}\n\n\tpublic static <T> void fill(T[][] array, T value) {\n\t\tfor (T[] row : array)\n\t\t\tArrays.fill(row, value);\n\t}\n\n\tpublic static void fill(char[][] array, char value) {\n\t\tfor (char[] row : array)\n\t\t\tArrays.fill(row, value);\n\t}\n\n\tpublic static void fill(byte[][] array, byte value) {\n\t\tfor (byte[] row : array)\n\t\t\tArrays.fill(row, value);\n\t}\n\n\tpublic static void fill(byte[][][] array, byte value) {\n\t\tfor (byte[][] row : array)\n\t\t\tfill(row, value);\n\t}\n\n\tpublic static void fill(byte[][][][] array, byte value) {\n\t\tfor (byte[][][] row : array)\n\t\t\tfill(row, value);\n\t}\n\n\tpublic static long multiply(int[] first, int[] second) {\n\t\tlong result = 0;\n\t\tfor (int i = 0; i < first.length; i++)\n\t\t\tresult += (long) first[i] * second[i];\n\t\treturn result;\n\t}\n\n\tpublic static int[] createOrder(int size) {\n\t\tint[] order = new int[size];\n\t\tfor (int i = 0; i < size; i++)\n\t\t\torder[i] = i;\n\t\treturn order;\n\t}\n\n\tpublic static int[] sort(int[] array, IntComparator comparator) {\n\t\treturn sort(array, 0, array.length, comparator);\n\t}\n\n\tpublic static int[] sort(int[] array, int from, int to,\n\t\t\tIntComparator comparator) {\n\t\tInteger[] intArray = new Integer[to - from];\n\t\tfor (int i = from; i < to; i++)\n\t\t\tintArray[i - from] = array[i];\n\t\tArrays.sort(intArray, comparator);\n\t\tfor (int i=from; i<to; i++) array[i]=intArray[i-from];\n\t\treturn array;\n\t}\n\n\tprivate static void ensureCapacityInt(int size) {\n\t\tif (tempInt.length >= size)\n\t\t\treturn;\n\t\tsize = Math.max(size, tempInt.length << 1);\n\t\ttempInt = new int[size];\n\t}\n\n\tprivate static void ensureCapacityLong(int size) {\n\t\tif (tempLong.length >= size)\n\t\t\treturn;\n\t\tsize = Math.max(size, tempLong.length << 1);\n\t\ttempLong = new long[size];\n\t}\n\n\tprivate static void sortImpl(int[] array, int from, int to, int[] temp,\n\t\t\tint fromTemp, int toTemp, IntComparator comparator) {\n\t\tif (to - from <= 1)\n\t\t\treturn;\n\t\tint middle = (to - from) >> 1;\n\t\tint tempMiddle = fromTemp + middle;\n\t\tsortImpl(temp, fromTemp, tempMiddle, array, from, from + middle,\n\t\t\t\tcomparator);\n\t\tsortImpl(temp, tempMiddle, toTemp, array, from + middle, to, comparator);\n\t\tint index = from;\n\t\tint index1 = fromTemp;\n\t\tint index2 = tempMiddle;\n\t\twhile (index1 < tempMiddle && index2 < toTemp) {\n\t\t\tif (comparator.compare(temp[index1], temp[index2]) <= 0)\n\t\t\t\tarray[index++] = temp[index1++];\n\t\t\telse\n\t\t\t\tarray[index++] = temp[index2++];\n\t\t}\n\t\tif (index1 != tempMiddle)\n\t\t\tSystem.arraycopy(temp, index1, array, index, tempMiddle - index1);\n\t\tif (index2 != toTemp)\n\t\t\tSystem.arraycopy(temp, index2, array, index, toTemp - index2);\n\t}\n\n\tpublic static int[] order(final int[] array) {\n\t\treturn sort(createOrder(array.length), new IntComparator() {\n\t\t\tpublic int compare(Integer first, Integer second) {\n\t\t\t\tif (array[first] < array[second])\n\t\t\t\t\treturn -1;\n\t\t\t\tif (array[first] > array[second])\n\t\t\t\t\treturn 1;\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t});\n\t}\n\n\tpublic static int[] order(final long[] array) {\n\t\treturn sort(createOrder(array.length), new IntComparator() {\n\t\t\tpublic int compare(Integer first, Integer second) {\n\t\t\t\tif (array[first] < array[second])\n\t\t\t\t\treturn -1;\n\t\t\t\tif (array[first] > array[second])\n\t\t\t\t\treturn 1;\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t});\n\t}\n\n\tpublic static int[] unique(int[] array) {\n\t\treturn unique(array, 0, array.length);\n\t}\n\n\tpublic static int[] unique(int[] array, int from, int to) {\n\t\tif (from == to)\n\t\t\treturn new int[0];\n\t\tint count = 1;\n\t\tfor (int i = from + 1; i < to; i++) {\n\t\t\tif (array[i] != array[i - 1])\n\t\t\t\tcount++;\n\t\t}\n\t\tint[] result = new int[count];\n\t\tresult[0] = array[from];\n\t\tint index = 1;\n\t\tfor (int i = from + 1; i < to; i++) {\n\t\t\tif (array[i] != array[i - 1])\n\t\t\t\tresult[index++] = array[i];\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static char[] unique(char[] array) {\n\t\treturn unique(array, 0, array.length);\n\t}\n\n\tpublic static char[] unique(char[] array, int from, int to) {\n\t\tif (from == to)\n\t\t\treturn new char[0];\n\t\tint count = 1;\n\t\tfor (int i = from + 1; i < to; i++) {\n\t\t\tif (array[i] != array[i - 1])\n\t\t\t\tcount++;\n\t\t}\n\t\tchar[] result = new char[count];\n\t\tresult[0] = array[from];\n\t\tint index = 1;\n\t\tfor (int i = from + 1; i < to; i++) {\n\t\t\tif (array[i] != array[i - 1])\n\t\t\t\tresult[index++] = array[i];\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static int maxElement(int[] array) {\n\t\treturn maxElement(array, 0, array.length);\n\t}\n\n\tpublic static int maxElement(int[] array, int from, int to) {\n\t\tint result = Integer.MIN_VALUE;\n\t\tfor (int i = from; i < to; i++)\n\t\t\tresult = Math.max(result, array[i]);\n\t\treturn result;\n\t}\n\n\tpublic static int[] order(final double[] array) {\n\t\treturn sort(createOrder(array.length), new IntComparator() {\n\t\t\tpublic int compare(Integer first, Integer second) {\n\t\t\t\treturn Double.compare(array[first], array[second]);\n\t\t\t}\n\t\t});\n\t}\n\n\tpublic static int[] reversePermutation(int[] permutation) {\n\t\tint[] result = new int[permutation.length];\n\t\tfor (int i = 0; i < permutation.length; i++)\n\t\t\tresult[permutation[i]] = i;\n\t\treturn result;\n\t}\n\n\tpublic static void reverse(int[] array) {\n\t\tfor (int i = 0, j = array.length - 1; i < j; i++, j--) {\n\t\t\tint temp = array[i];\n\t\t\tarray[i] = array[j];\n\t\t\tarray[j] = temp;\n\t\t}\n\t}\n\n\tpublic static void reverse(char[] array) {\n\t\tfor (int i = 0, j = array.length - 1; i < j; i++, j--) {\n\t\t\tchar temp = array[i];\n\t\t\tarray[i] = array[j];\n\t\t\tarray[j] = temp;\n\t\t}\n\t}\n\n\tprivate static long maxElement(long[] array, int from, int to) {\n\t\tlong result = Long.MIN_VALUE;\n\t\tfor (int i = from; i < to; i++)\n\t\t\tresult = Math.max(result, array[i]);\n\t\treturn result;\n\t}\n\n\tpublic static int minPosition(int[] array) {\n\t\treturn minPosition(array, 0, array.length);\n\t}\n\n\tpublic static int maxPosition(int[] array) {\n\t\treturn maxPosition(array, 0, array.length);\n\t}\n\n\tpublic static int minPosition(int[] array, int from, int to) {\n\t\tif (from >= to)\n\t\t\treturn -1;\n\t\tint min = array[from];\n\t\tint result = from;\n\t\tfor (int i = from + 1; i < to; i++) {\n\t\t\tif (array[i] < min) {\n\t\t\t\tmin = array[i];\n\t\t\t\tresult = i;\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static int maxPosition(int[] array, int from, int to) {\n\t\tif (from >= to)\n\t\t\treturn -1;\n\t\tint max = array[from];\n\t\tint result = from;\n\t\tfor (int i = from + 1; i < to; i++) {\n\t\t\tif (array[i] > max) {\n\t\t\t\tmax = array[i];\n\t\t\t\tresult = i;\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static int[] multiplyPermutations(int[] first, int[] second) {\n\t\tint count = first.length;\n\t\tint[] result = new int[count];\n\t\tfor (int i = 0; i < count; i++) {\n\t\t\tresult[i] = first[second[i]];\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static int[] compress(int[]... arrays) {\n\t\tint totalLength = 0;\n\t\tfor (int[] array : arrays)\n\t\t\ttotalLength += array.length;\n\t\tint[] all = new int[totalLength];\n\t\tint delta = 0;\n\t\tfor (int[] array : arrays) {\n\t\t\tSystem.arraycopy(array, 0, all, delta, array.length);\n\t\t\tdelta += array.length;\n\t\t}\n\t\tsort(all, IntComparator.DEFAULT);\n\t\tall = unique(all);\n\t\tfor (int[] array : arrays) {\n\t\t\tfor (int i = 0; i < array.length; i++)\n\t\t\t\tarray[i] = Arrays.binarySearch(all, array[i]);\n\t\t}\n\t\treturn all;\n\t}\n\n\tpublic static int minElement(int[] array) {\n\t\treturn array[minPosition(array)];\n\t}\n\n\tpublic static long[] partialSums(int[] array) {\n\t\tlong[] result = new long[array.length + 1];\n\t\tfor (int i = 0; i < array.length; i++)\n\t\t\tresult[i + 1] = result[i] + array[i];\n\t\treturn result;\n\t}\n\n\tpublic static void orderBy(int[] base, int[]... arrays) {\n\t\tint[] order = ArrayUtils.order(base);\n\t\torder(order, base);\n\t\tfor (int[] array : arrays)\n\t\t\torder(order, array);\n\t}\n\n\tpublic static void orderBy(long[] base, long[]... arrays) {\n\t\tint[] order = ArrayUtils.order(base);\n\t\torder(order, base);\n\t\tfor (long[] array : arrays)\n\t\t\torder(order, array);\n\t}\n\n\tpublic static void order(int[] order, int[] array) {\n\t\tensureCapacityInt(order.length);\n\t\tfor (int i = 0; i < order.length; i++)\n\t\t\ttempInt[i] = array[order[i]];\n\t\tSystem.arraycopy(tempInt, 0, array, 0, array.length);\n\t}\n\n\tpublic static void order(int[] order, long[] array) {\n\t\tensureCapacityLong(order.length);\n\t\tfor (int i = 0; i < order.length; i++)\n\t\t\ttempLong[i] = array[order[i]];\n\t\tSystem.arraycopy(tempLong, 0, array, 0, array.length);\n\t}\n\n\tpublic static long[] asLong(int[] array) {\n\t\tlong[] result = new long[array.length];\n\t\tfor (int i = 0; i < array.length; i++)\n\t\t\tresult[i] = array[i];\n\t\treturn result;\n\t}\n\n\tpublic static int count(int[] array, int value) {\n\t\tint result = 0;\n\t\tfor (int i : array) {\n\t\t\tif (i == value)\n\t\t\t\tresult++;\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static int count(char[] array, char value) {\n\t\tint result = 0;\n\t\tfor (char i : array) {\n\t\t\tif (i == value)\n\t\t\t\tresult++;\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static int count(boolean[] array, boolean value) {\n\t\tint result = 0;\n\t\tfor (boolean i : array) {\n\t\t\tif (i == value)\n\t\t\t\tresult++;\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static int[] merge(int[] first, int[] second) {\n\t\tint[] result = new int[first.length + second.length];\n\t\tint firstIndex = 0;\n\t\tint secondIndex = 0;\n\t\tint index = 0;\n\t\twhile (firstIndex < first.length && secondIndex < second.length) {\n\t\t\tif (first[firstIndex] < second[secondIndex])\n\t\t\t\tresult[index++] = first[firstIndex++];\n\t\t\telse\n\t\t\t\tresult[index++] = second[secondIndex++];\n\t\t}\n\t\tSystem.arraycopy(first, firstIndex, result, index, first.length\n\t\t\t\t- firstIndex);\n\t\tSystem.arraycopy(second, secondIndex, result, index, second.length\n\t\t\t\t- secondIndex);\n\t\treturn result;\n\t}\n\n\tpublic static boolean nextPermutation(int[] array) {\n\t\treturn nextPermutation(array, IntComparator.DEFAULT);\n\t}\n\n\tprivate static boolean nextPermutation(int[] array, IntComparator comparator) {\n\t\tint size = array.length;\n\t\tint last = array[size - 1];\n\t\tfor (int i = size - 2; i >= 0; i--) {\n\t\t\tint current = array[i];\n\t\t\tif (comparator.compare(last, current) > 0) {\n\t\t\t\tfor (int j = size - 1; j > i; j--) {\n\t\t\t\t\tif (comparator.compare(array[j], current) > 0) {\n\t\t\t\t\t\tswap(array, i, j);\n\t\t\t\t\t\tinPlaceReverse(array, i + 1, size);\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tlast = current;\n\t\t}\n\t\treturn false;\n\t}\n\n\tprivate static void inPlaceReverse(int[] array, int first, int second) {\n\t\tfor (int i = first, j = second - 1; i < j; i++, j--)\n\t\t\tswap(array, i, j);\n\t}\n\n\tprivate static void swap(int[] array, int first, int second) {\n\t\tif (first == second)\n\t\t\treturn;\n\t\tint temp = array[first];\n\t\tarray[first] = array[second];\n\t\tarray[second] = temp;\n\t}\n\n\tpublic static <V> void reverse(V[] array) {\n\t\tfor (int i = 0, j = array.length - 1; i < j; i++, j--) {\n\t\t\tV temp = array[i];\n\t\t\tarray[i] = array[j];\n\t\t\tarray[j] = temp;\n\t\t}\n\t}\n\n\tpublic static IntComparator compareBy(final int[]... arrays) {\n\t\treturn new IntComparator() {\n\t\t\tpublic int compare(Integer first, Integer second) {\n\t\t\t\tfor (int[] array : arrays) {\n\t\t\t\t\tif (array[first] != array[second])\n\t\t\t\t\t\treturn Integer.compare(array[first], array[second]);\n\t\t\t\t}\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t};\n\t}\n\n\tpublic static long minElement(long[] array) {\n\t\treturn array[minPosition(array)];\n\t}\n\n\tpublic static long maxElement(long[] array) {\n\t\treturn array[maxPosition(array)];\n\t}\n\n\tpublic static int minPosition(long[] array) {\n\t\treturn minPosition(array, 0, array.length);\n\t}\n\n\tpublic static int maxPosition(long[] array) {\n\t\treturn maxPosition(array, 0, array.length);\n\t}\n\n\tpublic static int minPosition(long[] array, int from, int to) {\n\t\tif (from >= to)\n\t\t\treturn -1;\n\t\tlong min = array[from];\n\t\tint result = from;\n\t\tfor (int i = from + 1; i < to; i++) {\n\t\t\tif (array[i] < min) {\n\t\t\t\tmin = array[i];\n\t\t\t\tresult = i;\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static int maxPosition(long[] array, int from, int to) {\n\t\tif (from >= to)\n\t\t\treturn -1;\n\t\tlong max = array[from];\n\t\tint result = from;\n\t\tfor (int i = from + 1; i < to; i++) {\n\t\t\tif (array[i] > max) {\n\t\t\t\tmax = array[i];\n\t\t\t\tresult = i;\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static int[] createArray(int count, int value) {\n\t\tint[] array = new int[count];\n\t\tArrays.fill(array, value);\n\t\treturn array;\n\t}\n\n\tpublic static long[] createArray(int count, long value) {\n\t\tlong[] array = new long[count];\n\t\tArrays.fill(array, value);\n\t\treturn array;\n\t}\n\n\tpublic static double[] createArray(int count, double value) {\n\t\tdouble[] array = new double[count];\n\t\tArrays.fill(array, value);\n\t\treturn array;\n\t}\n\n\tpublic static boolean[] createArray(int count, boolean value) {\n\t\tboolean[] array = new boolean[count];\n\t\tArrays.fill(array, value);\n\t\treturn array;\n\t}\n\n\tpublic static char[] createArray(int count, char value) {\n\t\tchar[] array = new char[count];\n\t\tArrays.fill(array, value);\n\t\treturn array;\n\t}\n\n\tpublic static <T> T[] createArray(int count, T value) {\n\t\t@SuppressWarnings(\"unchecked\")\n\t\tT[] array = (T[]) Array.newInstance(value.getClass(), count);\n\t\tArrays.fill(array, value);\n\t\treturn array;\n\t}\n}\n\nclass Graph {\n\tpublic static final int REMOVED_BIT = 0;\n\n\tprotected int vertexCount;\n\tprotected int edgeCount;\n\n\tprivate int[] firstOutbound;\n\tprivate int[] firstInbound;\n\n\tprivate Edge[] edges;\n\tprivate int[] nextInbound;\n\tprivate int[] nextOutbound;\n\tprivate int[] from;\n\tprivate int[] to;\n\tprivate long[] weight;\n\tprivate long[] capacity;\n\tprivate int[] reverseEdge;\n\tprivate int[] flags;\n\n\tpublic Graph(int vertexCount) {\n\t\tthis(vertexCount, vertexCount);\n\t}\n\n\tpublic Graph(int vertexCount, int edgeCapacity) {\n\t\tthis.vertexCount = vertexCount;\n\t\tfirstOutbound = new int[vertexCount];\n\t\tArrays.fill(firstOutbound, -1);\n\n\t\tfrom = new int[edgeCapacity];\n\t\tto = new int[edgeCapacity];\n\t\tnextOutbound = new int[edgeCapacity];\n\t\tflags = new int[edgeCapacity];\n\t}\n\n\tpublic static Graph createGraph(int vertexCount, int[] from, int[] to) {\n\t\tGraph graph = new Graph(vertexCount, from.length);\n\t\tfor (int i = 0; i < from.length; i++)\n\t\t\tgraph.addSimpleEdge(from[i], to[i]);\n\t\treturn graph;\n\t}\n\n\tpublic static Graph createWeightedGraph(int vertexCount, int[] from,\n\t\t\tint[] to, long[] weight) {\n\t\tGraph graph = new Graph(vertexCount, from.length);\n\t\tfor (int i = 0; i < from.length; i++)\n\t\t\tgraph.addWeightedEdge(from[i], to[i], weight[i]);\n\t\treturn graph;\n\t}\n\n\tpublic static Graph createFlowGraph(int vertexCount, int[] from, int[] to,\n\t\t\tlong[] capacity) {\n\t\tGraph graph = new Graph(vertexCount, from.length * 2);\n\t\tfor (int i = 0; i < from.length; i++)\n\t\t\tgraph.addFlowEdge(from[i], to[i], capacity[i]);\n\t\treturn graph;\n\t}\n\n\tpublic static Graph createFlowWeightedGraph(int vertexCount, int[] from,\n\t\t\tint[] to, long[] weight, long[] capacity) {\n\t\tGraph graph = new Graph(vertexCount, from.length * 2);\n\t\tfor (int i = 0; i < from.length; i++)\n\t\t\tgraph.addFlowWeightedEdge(from[i], to[i], weight[i], capacity[i]);\n\t\treturn graph;\n\t}\n\n\tpublic static Graph createTree(int[] parent) {\n\t\tGraph graph = new Graph(parent.length + 1, parent.length);\n\t\tfor (int i = 0; i < parent.length; i++)\n\t\t\tgraph.addSimpleEdge(parent[i], i + 1);\n\t\treturn graph;\n\t}\n\n\tpublic int addEdge(int fromID, int toID, long weight, long capacity,\n\t\t\tint reverseEdge) {\n\t\tensureEdgeCapacity(edgeCount + 1);\n\t\tif (firstOutbound[fromID] != -1)\n\t\t\tnextOutbound[edgeCount] = firstOutbound[fromID];\n\t\telse\n\t\t\tnextOutbound[edgeCount] = -1;\n\t\tfirstOutbound[fromID] = edgeCount;\n\t\tif (firstInbound != null) {\n\t\t\tif (firstInbound[toID] != -1)\n\t\t\t\tnextInbound[edgeCount] = firstInbound[toID];\n\t\t\telse\n\t\t\t\tnextInbound[edgeCount] = -1;\n\t\t\tfirstInbound[toID] = edgeCount;\n\t\t}\n\t\tthis.from[edgeCount] = fromID;\n\t\tthis.to[edgeCount] = toID;\n\t\tif (capacity != 0) {\n\t\t\tif (this.capacity == null)\n\t\t\t\tthis.capacity = new long[from.length];\n\t\t\tthis.capacity[edgeCount] = capacity;\n\t\t}\n\t\tif (weight != 0) {\n\t\t\tif (this.weight == null)\n\t\t\t\tthis.weight = new long[from.length];\n\t\t\tthis.weight[edgeCount] = weight;\n\t\t}\n\t\tif (reverseEdge != -1) {\n\t\t\tif (this.reverseEdge == null) {\n\t\t\t\tthis.reverseEdge = new int[from.length];\n\t\t\t\tArrays.fill(this.reverseEdge, 0, edgeCount, -1);\n\t\t\t}\n\t\t\tthis.reverseEdge[edgeCount] = reverseEdge;\n\t\t}\n\t\tif (edges != null)\n\t\t\tedges[edgeCount] = createEdge(edgeCount);\n\t\treturn edgeCount++;\n\t}\n\n\tprotected final GraphEdge createEdge(int id) {\n\t\treturn new GraphEdge(id);\n\t}\n\n\tpublic final int addFlowWeightedEdge(int from, int to, long weight,\n\t\t\tlong capacity) {\n\t\tif (capacity == 0) {\n\t\t\treturn addEdge(from, to, weight, 0, -1);\n\t\t} else {\n\t\t\tint lastEdgeCount = edgeCount;\n\t\t\taddEdge(to, from, -weight, 0, lastEdgeCount + entriesPerEdge());\n\t\t\treturn addEdge(from, to, weight, capacity, lastEdgeCount);\n\t\t}\n\t}\n\n\tprotected int entriesPerEdge() {\n\t\treturn 1;\n\t}\n\n\tpublic final int addFlowEdge(int from, int to, long capacity) {\n\t\treturn addFlowWeightedEdge(from, to, 0, capacity);\n\t}\n\n\tpublic final int addWeightedEdge(int from, int to, long weight) {\n\t\treturn addFlowWeightedEdge(from, to, weight, 0);\n\t}\n\n\tpublic final int addSimpleEdge(int from, int to) {\n\t\treturn addWeightedEdge(from, to, 0);\n\t}\n\n\tpublic final int vertexCount() {\n\t\treturn vertexCount;\n\t}\n\n\tpublic final int edgeCount() {\n\t\treturn edgeCount;\n\t}\n\n\tprotected final int edgeCapacity() {\n\t\treturn from.length;\n\t}\n\n\tpublic final Edge edge(int id) {\n\t\tinitEdges();\n\t\treturn edges[id];\n\t}\n\n\tpublic final int firstOutbound(int vertex) {\n\t\tint id = firstOutbound[vertex];\n\t\twhile (id != -1 && isRemoved(id))\n\t\t\tid = nextOutbound[id];\n\t\treturn id;\n\t}\n\n\tpublic final int nextOutbound(int id) {\n\t\tid = nextOutbound[id];\n\t\twhile (id != -1 && isRemoved(id))\n\t\t\tid = nextOutbound[id];\n\t\treturn id;\n\t}\n\n\tpublic final int firstInbound(int vertex) {\n\t\tinitInbound();\n\t\tint id = firstInbound[vertex];\n\t\twhile (id != -1 && isRemoved(id))\n\t\t\tid = nextInbound[id];\n\t\treturn id;\n\t}\n\n\tpublic final int nextInbound(int id) {\n\t\tinitInbound();\n\t\tid = nextInbound[id];\n\t\twhile (id != -1 && isRemoved(id))\n\t\t\tid = nextInbound[id];\n\t\treturn id;\n\t}\n\n\tpublic final int source(int id) {\n\t\treturn from[id];\n\t}\n\n\tpublic final int destination(int id) {\n\t\treturn to[id];\n\t}\n\n\tpublic final long weight(int id) {\n\t\tif (weight == null)\n\t\t\treturn 0;\n\t\treturn weight[id];\n\t}\n\n\tpublic final long capacity(int id) {\n\t\tif (capacity == null)\n\t\t\treturn 0;\n\t\treturn capacity[id];\n\t}\n\n\tpublic final long flow(int id) {\n\t\tif (reverseEdge == null)\n\t\t\treturn 0;\n\t\treturn capacity[reverseEdge[id]];\n\t}\n\n\tpublic final void pushFlow(int id, long flow) {\n\t\tif (flow == 0)\n\t\t\treturn;\n\t\tif (flow > 0) {\n\t\t\tif (capacity(id) < flow)\n\t\t\t\tthrow new IllegalArgumentException(\"Not enough capacity\");\n\t\t} else {\n\t\t\tif (flow(id) < -flow)\n\t\t\t\tthrow new IllegalArgumentException(\"Not enough capacity\");\n\t\t}\n\t\tcapacity[id] -= flow;\n\t\tcapacity[reverseEdge[id]] += flow;\n\t}\n\n\tpublic int transposed(int id) {\n\t\treturn -1;\n\t}\n\n\tpublic final int reverse(int id) {\n\t\tif (reverseEdge == null)\n\t\t\treturn -1;\n\t\treturn reverseEdge[id];\n\t}\n\n\tpublic final void addVertices(int count) {\n\t\tensureVertexCapacity(vertexCount + count);\n\t\tArrays.fill(firstOutbound, vertexCount, vertexCount + count, -1);\n\t\tif (firstInbound != null)\n\t\t\tArrays.fill(firstInbound, vertexCount, vertexCount + count, -1);\n\t\tvertexCount += count;\n\t}\n\n\tprotected final void initEdges() {\n\t\tif (edges == null) {\n\t\t\tedges = new Edge[from.length];\n\t\t\tfor (int i = 0; i < edgeCount; i++)\n\t\t\t\tedges[i] = createEdge(i);\n\t\t}\n\t}\n\n\tpublic final void removeVertex(int vertex) {\n\t\tint id = firstOutbound[vertex];\n\t\twhile (id != -1) {\n\t\t\tremoveEdge(id);\n\t\t\tid = nextOutbound[id];\n\t\t}\n\t\tinitInbound();\n\t\tid = firstInbound[vertex];\n\t\twhile (id != -1) {\n\t\t\tremoveEdge(id);\n\t\t\tid = nextInbound[id];\n\t\t}\n\t}\n\n\tprivate void initInbound() {\n\t\tif (firstInbound == null) {\n\t\t\tfirstInbound = new int[firstOutbound.length];\n\t\t\tArrays.fill(firstInbound, 0, vertexCount, -1);\n\t\t\tnextInbound = new int[from.length];\n\t\t\tfor (int i = 0; i < edgeCount; i++) {\n\t\t\t\tnextInbound[i] = firstInbound[to[i]];\n\t\t\t\tfirstInbound[to[i]] = i;\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic final boolean flag(int id, int bit) {\n\t\treturn (flags[id] >> bit & 1) != 0;\n\t}\n\n\tpublic final void setFlag(int id, int bit) {\n\t\tflags[id] |= 1 << bit;\n\t}\n\n\tpublic final void removeFlag(int id, int bit) {\n\t\tflags[id] &= -1 - (1 << bit);\n\t}\n\n\tpublic final void removeEdge(int id) {\n\t\tsetFlag(id, REMOVED_BIT);\n\t}\n\n\tpublic final void restoreEdge(int id) {\n\t\tremoveFlag(id, REMOVED_BIT);\n\t}\n\n\tpublic final boolean isRemoved(int id) {\n\t\treturn flag(id, REMOVED_BIT);\n\t}\n\n\tpublic final Iterable<Edge> outbound(final int id) {\n\t\tinitEdges();\n\t\treturn new Iterable<Edge>() {\n\t\t\tpublic Iterator<Edge> iterator() {\n\t\t\t\treturn new EdgeIterator(id, firstOutbound, nextOutbound);\n\t\t\t}\n\t\t};\n\t}\n\n\tpublic final Iterable<Edge> inbound(final int id) {\n\t\tinitEdges();\n\t\tinitInbound();\n\t\treturn new Iterable<Edge>() {\n\t\t\tpublic Iterator<Edge> iterator() {\n\t\t\t\treturn new EdgeIterator(id, firstInbound, nextInbound);\n\t\t\t}\n\t\t};\n\t}\n\n\tprotected void ensureEdgeCapacity(int size) {\n\t\tif (from.length < size) {\n\t\t\tint newSize = Math.max(size, 2 * from.length);\n\t\t\tif (edges != null)\n\t\t\t\tedges = resize(edges, newSize);\n\t\t\tfrom = resize(from, newSize);\n\t\t\tto = resize(to, newSize);\n\t\t\tnextOutbound = resize(nextOutbound, newSize);\n\t\t\tif (nextInbound != null)\n\t\t\t\tnextInbound = resize(nextInbound, newSize);\n\t\t\tif (weight != null)\n\t\t\t\tweight = resize(weight, newSize);\n\t\t\tif (capacity != null)\n\t\t\t\tcapacity = resize(capacity, newSize);\n\t\t\tif (reverseEdge != null)\n\t\t\t\treverseEdge = resize(reverseEdge, newSize);\n\t\t\tflags = resize(flags, newSize);\n\t\t}\n\t}\n\n\tprivate void ensureVertexCapacity(int size) {\n\t\tif (firstOutbound.length < size) {\n\t\t\tint newSize = Math.max(size, 2 * from.length);\n\t\t\tfirstOutbound = resize(firstOutbound, newSize);\n\t\t\tif (firstInbound != null)\n\t\t\t\tfirstInbound = resize(firstInbound, newSize);\n\t\t}\n\t}\n\n\tprotected final int[] resize(int[] array, int size) {\n\t\tint[] newArray = new int[size];\n\t\tSystem.arraycopy(array, 0, newArray, 0, array.length);\n\t\treturn newArray;\n\t}\n\n\tprivate long[] resize(long[] array, int size) {\n\t\tlong[] newArray = new long[size];\n\t\tSystem.arraycopy(array, 0, newArray, 0, array.length);\n\t\treturn newArray;\n\t}\n\n\tprivate Edge[] resize(Edge[] array, int size) {\n\t\tEdge[] newArray = new Edge[size];\n\t\tSystem.arraycopy(array, 0, newArray, 0, array.length);\n\t\treturn newArray;\n\t}\n\n\tpublic final boolean isSparse() {\n\t\treturn vertexCount == 0 || edgeCount * 20 / vertexCount <= vertexCount;\n\t}\n\n\tprotected class GraphEdge implements Edge {\n\t\tprotected int id;\n\n\t\tprotected GraphEdge(int id) {\n\t\t\tthis.id = id;\n\t\t}\n\n\t\tpublic int getSource() {\n\t\t\treturn source(id);\n\t\t}\n\n\t\tpublic int getDestination() {\n\t\t\treturn destination(id);\n\t\t}\n\n\t\tpublic long getWeight() {\n\t\t\treturn weight(id);\n\t\t}\n\n\t\tpublic long getCapacity() {\n\t\t\treturn capacity(id);\n\t\t}\n\n\t\tpublic long getFlow() {\n\t\t\treturn flow(id);\n\t\t}\n\n\t\tpublic void pushFlow(long flow) {\n\t\t\tGraph.this.pushFlow(id, flow);\n\t\t}\n\n\t\tpublic boolean getFlag(int bit) {\n\t\t\treturn flag(id, bit);\n\t\t}\n\n\t\tpublic void setFlag(int bit) {\n\t\t\tGraph.this.setFlag(id, bit);\n\t\t}\n\n\t\tpublic void removeFlag(int bit) {\n\t\t\tGraph.this.removeFlag(id, bit);\n\t\t}\n\n\t\tpublic int getTransposedID() {\n\t\t\treturn transposed(id);\n\t\t}\n\n\t\tpublic Edge getTransposedEdge() {\n\t\t\tint reverseID = getTransposedID();\n\t\t\tif (reverseID == -1)\n\t\t\t\treturn null;\n\t\t\tinitEdges();\n\t\t\treturn edge(reverseID);\n\t\t}\n\n\t\tpublic int getReverseID() {\n\t\t\treturn reverse(id);\n\t\t}\n\n\t\tpublic Edge getReverseEdge() {\n\t\t\tint reverseID = getReverseID();\n\t\t\tif (reverseID == -1)\n\t\t\t\treturn null;\n\t\t\tinitEdges();\n\t\t\treturn edge(reverseID);\n\t\t}\n\n\t\tpublic int getID() {\n\t\t\treturn id;\n\t\t}\n\n\t\tpublic void remove() {\n\t\t\tremoveEdge(id);\n\t\t}\n\n\t\tpublic void restore() {\n\t\t\trestoreEdge(id);\n\t\t}\n\t}\n\n\tpublic class EdgeIterator implements Iterator<Edge> {\n\t\tprivate int edgeID;\n\t\tprivate final int[] next;\n\t\tprivate int lastID = -1;\n\n\t\tpublic EdgeIterator(int id, int[] first, int[] next) {\n\t\t\tthis.next = next;\n\t\t\tedgeID = nextEdge(first[id]);\n\t\t}\n\n\t\tprivate int nextEdge(int id) {\n\t\t\twhile (id != -1 && isRemoved(id))\n\t\t\t\tid = next[id];\n\t\t\treturn id;\n\t\t}\n\n\t\tpublic boolean hasNext() {\n\t\t\treturn edgeID != -1;\n\t\t}\n\n\t\tpublic Edge next() {\n\t\t\tif (edgeID == -1)\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tlastID = edgeID;\n\t\t\tedgeID = nextEdge(next[lastID]);\n\t\t\treturn edges[lastID];\n\t\t}\n\n\t\tpublic void remove() {\n\t\t\tif (lastID == -1)\n\t\t\t\tthrow new IllegalStateException();\n\t\t\tremoveEdge(lastID);\n\t\t\tlastID = -1;\n\t\t}\n\t}\n\n}\n\nclass MiscUtils {\n\tpublic static final int[] DX4 = { 1, 0, -1, 0 };\n\tpublic static final int[] DY4 = { 0, -1, 0, 1 };\n\tpublic static final int[] DX8 = { 1, 1, 1, 0, -1, -1, -1, 0 };\n\tpublic static final int[] DY8 = { -1, 0, 1, 1, 1, 0, -1, -1 };\n\tpublic static final int[] DX_KNIGHT = { 2, 1, -1, -2, -2, -1, 1, 2 };\n\tpublic static final int[] DY_KNIGHT = { 1, 2, 2, 1, -1, -2, -2, -1 };\n\n\tprivate static final String[] ROMAN_TOKENS = { \"M\", \"CM\", \"D\", \"CD\", \"C\",\n\t\t\t\"XC\", \"L\", \"XL\", \"X\", \"IX\", \"V\", \"IV\", \"I\" };\n\tprivate static final int[] ROMAN_VALUES = { 1000, 900, 500, 400, 100, 90,\n\t\t\t50, 40, 10, 9, 5, 4, 1 };\n\n\tpublic static long josephProblem(long n, int k) {\n\t\tif (n == 1)\n\t\t\treturn 0;\n\t\tif (k == 1)\n\t\t\treturn n - 1;\n\t\tif (k > n)\n\t\t\treturn (josephProblem(n - 1, k) + k) % n;\n\t\tlong count = n / k;\n\t\tlong result = josephProblem(n - count, k);\n\t\tresult -= n % k;\n\t\tif (result < 0)\n\t\t\tresult += n;\n\t\telse\n\t\t\tresult += result / (k - 1);\n\t\treturn result;\n\t}\n\n\tpublic static boolean isValidCell(int row, int column, int rowCount,\n\t\t\tint columnCount) {\n\t\treturn row >= 0 && row < rowCount && column >= 0\n\t\t\t\t&& column < columnCount;\n\t}\n\n\tpublic static List<Integer> getPath(int[] last, int destination) {\n\t\tList<Integer> path = new ArrayList<Integer>();\n\t\twhile (destination != -1) {\n\t\t\tpath.add(destination);\n\t\t\tdestination = last[destination];\n\t\t}\n\t\tinPlaceReverse(path);\n\t\treturn path;\n\t}\n\n\tprivate static void inPlaceReverse(List<Integer> list) {\n\t\tfor (int i = 0, j = list.size() - 1; i < j; i++, j--)\n\t\t\tswap(list, i, j);\n\t}\n\n\tprivate static void swap(List<Integer> list, int first, int second) {\n\t\tif (first == second)\n\t\t\treturn;\n\t\tint temp = list.get(first);\n\t\tlist.set(first, list.get(second));\n\t\tlist.set(second, temp);\n\t}\n\n\tpublic static List<Integer> getPath(int[][] lastIndex,\n\t\t\tint[][] lastPathNumber, int destination, int pathNumber) {\n\t\tList<Integer> path = new ArrayList<Integer>();\n\t\twhile (destination != -1 || pathNumber != 0) {\n\t\t\tpath.add(destination);\n\t\t\tint nextDestination = lastIndex[destination][pathNumber];\n\t\t\tpathNumber = lastPathNumber[destination][pathNumber];\n\t\t\tdestination = nextDestination;\n\t\t}\n\t\tinPlaceReverse(path);\n\t\treturn path;\n\t}\n\n\tpublic static long maximalRectangleSum(long[][] array) {\n\t\tint n = array.length;\n\t\tint m = array[0].length;\n\t\tlong[][] partialSums = new long[n + 1][m + 1];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tlong rowSum = 0;\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\trowSum += array[i][j];\n\t\t\t\tpartialSums[i + 1][j + 1] = partialSums[i][j + 1] + rowSum;\n\t\t\t}\n\t\t}\n\t\tlong result = Long.MIN_VALUE;\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tfor (int j = i; j < m; j++) {\n\t\t\t\tlong minPartialSum = 0;\n\t\t\t\tfor (int k = 1; k <= n; k++) {\n\t\t\t\t\tlong current = partialSums[k][j + 1] - partialSums[k][i];\n\t\t\t\t\tresult = Math.max(result, current - minPartialSum);\n\t\t\t\t\tminPartialSum = Math.min(minPartialSum, current);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static int parseIP(String ip) {\n\t\tString[] components = ip.split(\"[.]\");\n\t\tint result = 0;\n\t\tfor (int i = 0; i < 4; i++)\n\t\t\tresult += (1 << (24 - 8 * i)) * Integer.parseInt(components[i]);\n\t\treturn result;\n\t}\n\n\tpublic static String buildIP(int mask) {\n\t\tStringBuilder result = new StringBuilder();\n\t\tfor (int i = 0; i < 4; i++) {\n\t\t\tif (i != 0)\n\t\t\t\tresult.append('.');\n\t\t\tresult.append(mask >> (24 - 8 * i) & 255);\n\t\t}\n\t\treturn result.toString();\n\t}\n\n\tpublic static long binarySearch(long from, long to,\n\t\t\tFunction<Long, Boolean> function) {\n\t\twhile (from < to) {\n\t\t\tlong argument = from + (to - from) / 2;\n\t\t\tif (function.value(argument))\n\t\t\t\tto = argument;\n\t\t\telse\n\t\t\t\tfrom = argument + 1;\n\t\t}\n\t\treturn from;\n\t}\n\n\tpublic static <T> boolean equals(T first, T second) {\n\t\treturn first == null && second == null || first != null\n\t\t\t\t&& first.equals(second);\n\t}\n\n\tpublic static boolean isVowel(char ch) {\n\t\tch = Character.toUpperCase(ch);\n\t\treturn ch == 'A' || ch == 'E' || ch == 'I' || ch == 'O' || ch == 'U'\n\t\t\t\t|| ch == 'Y';\n\t}\n\n\tpublic static boolean isStrictVowel(char ch) {\n\t\tch = Character.toUpperCase(ch);\n\t\treturn ch == 'A' || ch == 'E' || ch == 'I' || ch == 'O' || ch == 'U';\n\t}\n\n\tpublic static String convertToRoman(int number) {\n\t\tStringBuilder result = new StringBuilder();\n\t\tfor (int i = 0; i < ROMAN_TOKENS.length; i++) {\n\t\t\twhile (number >= ROMAN_VALUES[i]) {\n\t\t\t\tnumber -= ROMAN_VALUES[i];\n\t\t\t\tresult.append(ROMAN_TOKENS[i]);\n\t\t\t}\n\t\t}\n\t\treturn result.toString();\n\t}\n\n\tpublic static int convertFromRoman(String number) {\n\t\tint result = 0;\n\t\tfor (int i = 0; i < ROMAN_TOKENS.length; i++) {\n\t\t\twhile (number.startsWith(ROMAN_TOKENS[i])) {\n\t\t\t\tnumber = number.substring(ROMAN_TOKENS[i].length());\n\t\t\t\tresult += ROMAN_VALUES[i];\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static int distance(int x1, int y1, int x2, int y2) {\n\t\tint dx = x1 - x2;\n\t\tint dy = y1 - y2;\n\t\treturn dx * dx + dy * dy;\n\t}\n\n\tpublic static <T extends Comparable<T>> T min(T first, T second) {\n\t\tif (first.compareTo(second) <= 0)\n\t\t\treturn first;\n\t\treturn second;\n\t}\n\n\tpublic static <T extends Comparable<T>> T max(T first, T second) {\n\t\tif (first.compareTo(second) <= 0)\n\t\t\treturn second;\n\t\treturn first;\n\t}\n\n\tpublic static void decreaseByOne(int[]... arrays) {\n\t\tfor (int[] array : arrays) {\n\t\t\tfor (int i = 0; i < array.length; i++)\n\t\t\t\tarray[i]--;\n\t\t}\n\t}\n\n\tpublic static int[] getIntArray(String s) {\n\t\tString[] tokens = s.split(\" \");\n\t\tint[] result = new int[tokens.length];\n\t\tfor (int i = 0; i < result.length; i++)\n\t\t\tresult[i] = Integer.parseInt(tokens[i]);\n\t\treturn result;\n\t}\n}\n\nclass IntegerUtils {\n\tpublic static long gcd(long a, long b) {\n\t\ta = Math.abs(a);\n\t\tb = Math.abs(b);\n\t\twhile (b != 0) {\n\t\t\tlong temp = a % b;\n\t\t\ta = b;\n\t\t\tb = temp;\n\t\t}\n\t\treturn a;\n\t}\n\n\tpublic static int gcd(int a, int b) {\n\t\ta = Math.abs(a);\n\t\tb = Math.abs(b);\n\t\twhile (b != 0) {\n\t\t\tint temp = a % b;\n\t\t\ta = b;\n\t\t\tb = temp;\n\t\t}\n\t\treturn a;\n\t}\n\n\tpublic static int[] generatePrimes(int upTo) {\n\t\tint[] isPrime = generateBitPrimalityTable(upTo);\n\t\tList<Integer> primes = new ArrayList<Integer>();\n\t\tfor (int i = 0; i < upTo; i++) {\n\t\t\tif ((isPrime[i >> 5] >>> (i & 31) & 1) == 1)\n\t\t\t\tprimes.add(i);\n\t\t}\n\t\tint[] array = new int[primes.size()];\n\t\tfor (int i = 0; i < array.length; i++)\n\t\t\tarray[i] = primes.get(i);\n\t\treturn array;\n\t}\n\n\tpublic static boolean[] generatePrimalityTable(int upTo) {\n\t\tboolean[] isPrime = new boolean[upTo];\n\t\tif (upTo < 2)\n\t\t\treturn isPrime;\n\t\tArrays.fill(isPrime, true);\n\t\tisPrime[0] = isPrime[1] = false;\n\t\tfor (int i = 2; i * i < upTo; i++) {\n\t\t\tif (isPrime[i]) {\n\t\t\t\tfor (int j = i * i; j < upTo; j += i)\n\t\t\t\t\tisPrime[j] = false;\n\t\t\t}\n\t\t}\n\t\treturn isPrime;\n\t}\n\n\tpublic static int[] generateBitPrimalityTable(int upTo) {\n\t\tint[] isPrime = new int[(upTo + 31) >> 5];\n\t\tif (upTo < 2)\n\t\t\treturn isPrime;\n\t\tArrays.fill(isPrime, -1);\n\t\tisPrime[0] &= -4;\n\t\tfor (int i = 2; i * i < upTo; i++) {\n\t\t\tif ((isPrime[i >> 5] >>> (i & 31) & 1) == 1) {\n\t\t\t\tfor (int j = i * i; j < upTo; j += i)\n\t\t\t\t\tisPrime[j >> 5] &= -1 - (1 << (j & 31));\n\t\t\t}\n\t\t}\n\t\treturn isPrime;\n\t}\n\n\tpublic static int[] generateDivisorTable(int upTo) {\n\t\tint[] divisor = new int[upTo];\n\t\tfor (int i = 1; i < upTo; i++)\n\t\t\tdivisor[i] = i;\n\t\tfor (int i = 2; i * i < upTo; i++) {\n\t\t\tif (divisor[i] == i) {\n\t\t\t\tfor (int j = i * i; j < upTo; j += i)\n\t\t\t\t\tdivisor[j] = i;\n\t\t\t}\n\t\t}\n\t\treturn divisor;\n\t}\n\n\tpublic static long powerInFactorial(long n, long p) {\n\t\tlong result = 0;\n\t\twhile (n != 0) {\n\t\t\tresult += n /= p;\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static int sumDigits(CharSequence number) {\n\t\tint result = 0;\n\t\tfor (int i = number.length() - 1; i >= 0; i--)\n\t\t\tresult += digitValue(number.charAt(i));\n\t\treturn result;\n\t}\n\n\tpublic static int digitValue(char digit) {\n\t\tif (Character.isDigit(digit))\n\t\t\treturn digit - '0';\n\t\tif (Character.isUpperCase(digit))\n\t\t\treturn digit + 10 - 'A';\n\t\treturn digit + 10 - 'a';\n\t}\n\n\tpublic static int longCompare(long a, long b) {\n\t\tif (a < b)\n\t\t\treturn -1;\n\t\tif (a > b)\n\t\t\treturn 1;\n\t\treturn 0;\n\t}\n\n\tpublic static long[][] generateBinomialCoefficients(int n) {\n\t\tlong[][] result = new long[n + 1][n + 1];\n\t\tfor (int i = 0; i <= n; i++) {\n\t\t\tresult[i][0] = 1;\n\t\t\tfor (int j = 1; j <= i; j++)\n\t\t\t\tresult[i][j] = result[i - 1][j - 1] + result[i - 1][j];\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static long[][] generateBinomialCoefficients(int n, long module) {\n\t\tlong[][] result = new long[n + 1][n + 1];\n\t\tif (module == 1)\n\t\t\treturn result;\n\t\tfor (int i = 0; i <= n; i++) {\n\t\t\tresult[i][0] = 1;\n\t\t\tfor (int j = 1; j <= i; j++) {\n\t\t\t\tresult[i][j] = result[i - 1][j - 1] + result[i - 1][j];\n\t\t\t\tif (result[i][j] >= module)\n\t\t\t\t\tresult[i][j] -= module;\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static long[] generateBinomialRow(int n, long module) {\n\t\tlong[] result = generateReverse(n + 1, module);\n\t\tresult[0] = 1;\n\t\tfor (int i = 1; i <= n; i++)\n\t\t\tresult[i] = result[i - 1] * (n - i + 1) % module * result[i]\n\t\t\t\t\t% module;\n\t\treturn result;\n\t}\n\n\tpublic static int[] representationInBase(long number, int base) {\n\t\tlong basePower = base;\n\t\tint exponent = 1;\n\t\twhile (number >= basePower) {\n\t\t\tbasePower *= base;\n\t\t\texponent++;\n\t\t}\n\t\tint[] representation = new int[exponent];\n\t\tfor (int i = 0; i < exponent; i++) {\n\t\t\tbasePower /= base;\n\t\t\trepresentation[i] = (int) (number / basePower);\n\t\t\tnumber %= basePower;\n\t\t}\n\t\treturn representation;\n\t}\n\n\tpublic static int trueDivide(int a, int b) {\n\t\treturn (a - trueMod(a, b)) / b;\n\t}\n\n\tpublic static long trueDivide(long a, long b) {\n\t\treturn (a - trueMod(a, b)) / b;\n\t}\n\n\tpublic static int trueMod(int a, int b) {\n\t\ta %= b;\n\t\ta += b;\n\t\ta %= b;\n\t\treturn a;\n\t}\n\n\tpublic static long trueMod(long a, long b) {\n\t\ta %= b;\n\t\ta += b;\n\t\ta %= b;\n\t\treturn a;\n\t}\n\n\tpublic static long factorial(int n) {\n\t\tlong result = 1;\n\t\tfor (int i = 2; i <= n; i++)\n\t\t\tresult *= i;\n\t\treturn result;\n\t}\n\n\tpublic static long factorial(int n, long mod) {\n\t\tlong result = 1;\n\t\tfor (int i = 2; i <= n; i++)\n\t\t\tresult = result * i % mod;\n\t\treturn result % mod;\n\t}\n\n\tpublic static List<Pair<Long, Integer>> factorize(long number) {\n\t\tList<Pair<Long, Integer>> result = new ArrayList<Pair<Long, Integer>>();\n\t\tfor (long i = 2; i * i <= number; i++) {\n\t\t\tif (number % i == 0) {\n\t\t\t\tint power = 0;\n\t\t\t\tdo {\n\t\t\t\t\tpower++;\n\t\t\t\t\tnumber /= i;\n\t\t\t\t} while (number % i == 0);\n\t\t\t\tresult.add(Pair.makePair(i, power));\n\t\t\t}\n\t\t}\n\t\tif (number != 1)\n\t\t\tresult.add(Pair.makePair(number, 1));\n\t\treturn result;\n\t}\n\n\tpublic static List<Long> getDivisors(long number) {\n\t\tList<Pair<Long, Integer>> primeDivisors = factorize(number);\n\t\treturn getDivisorsImpl(primeDivisors, 0, 1, new ArrayList<Long>());\n\t}\n\n\tprivate static List<Long> getDivisorsImpl(\n\t\t\tList<Pair<Long, Integer>> primeDivisors, int index, long current,\n\t\t\tList<Long> result) {\n\t\tif (index == primeDivisors.size()) {\n\t\t\tresult.add(current);\n\t\t\treturn result;\n\t\t}\n\t\tlong p = primeDivisors.get(index).first;\n\t\tint power = primeDivisors.get(index).second;\n\t\tfor (int i = 0; i <= power; i++) {\n\t\t\tgetDivisorsImpl(primeDivisors, index + 1, current, result);\n\t\t\tcurrent *= p;\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static long power(long base, long exponent) {\n\t\tif (exponent == 0)\n\t\t\treturn 1;\n\t\tlong result = power(base, exponent >> 1);\n\t\tresult = result * result;\n\t\tif ((exponent & 1) != 0)\n\t\t\tresult = result * base;\n\t\treturn result;\n\t}\n\n\tpublic static long power(long base, long exponent, long mod) {\n\t\tif (base >= mod)\n\t\t\tbase %= mod;\n\t\tif (exponent == 0)\n\t\t\treturn 1 % mod;\n\t\tlong result = power(base, exponent >> 1, mod);\n\t\tresult = result * result % mod;\n\t\tif ((exponent & 1) != 0)\n\t\t\tresult = result * base % mod;\n\t\treturn result;\n\t}\n\n\tpublic static long lcm(long a, long b) {\n\t\treturn a / gcd(a, b) * b;\n\t}\n\n\tpublic static long[] generateFibonacci(long upTo) {\n\t\tint count = 0;\n\t\tlong last = 0;\n\t\tlong current = 1;\n\t\twhile (current <= upTo) {\n\t\t\tlong next = last + current;\n\t\t\tlast = current;\n\t\t\tcurrent = next;\n\t\t\tcount++;\n\t\t}\n\t\treturn generateFibonacci(count, -1);\n\t}\n\n\tpublic static long[] generateFibonacci(int count, long module) {\n\t\tlong[] result = new long[count];\n\t\tif (module == -1) {\n\t\t\tif (count != 0)\n\t\t\t\tresult[0] = 1;\n\t\t\tif (count > 1)\n\t\t\t\tresult[1] = 1;\n\t\t\tfor (int i = 2; i < count; i++)\n\t\t\t\tresult[i] = result[i - 1] + result[i - 2];\n\t\t} else {\n\t\t\tif (count != 0)\n\t\t\t\tresult[0] = 1 % module;\n\t\t\tif (count > 1)\n\t\t\t\tresult[1] = 1 % module;\n\t\t\tfor (int i = 2; i < count; i++)\n\t\t\t\tresult[i] = (result[i - 1] + result[i - 2]) % module;\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static long[] generateHappy(int digits) {\n\t\tlong[] happy = new long[(1 << (digits + 1)) - 2];\n\t\thappy[0] = 4;\n\t\thappy[1] = 7;\n\t\tint first = 0;\n\t\tint last = 2;\n\t\tfor (int i = 2; i <= digits; i++) {\n\t\t\tfor (int j = 0; j < last - first; j++) {\n\t\t\t\thappy[last + 2 * j] = 10 * happy[first + j] + 4;\n\t\t\t\thappy[last + 2 * j + 1] = 10 * happy[first + j] + 7;\n\t\t\t}\n\t\t\tint next = last + 2 * (last - first);\n\t\t\tfirst = last;\n\t\t\tlast = next;\n\t\t}\n\t\treturn happy;\n\t}\n\n\tpublic static long[] generateFactorial(int count, long module) {\n\t\tlong[] result = new long[count];\n\t\tif (module == -1) {\n\t\t\tif (count != 0)\n\t\t\t\tresult[0] = 1;\n\t\t\tfor (int i = 1; i < count; i++)\n\t\t\t\tresult[i] = result[i - 1] * i;\n\t\t} else {\n\t\t\tif (count != 0)\n\t\t\t\tresult[0] = 1 % module;\n\t\t\tfor (int i = 1; i < count; i++)\n\t\t\t\tresult[i] = (result[i - 1] * i) % module;\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static long reverse(long number, long module) {\n\t\treturn power(number, module - 2, module);\n\t}\n\n\tpublic static boolean isPrime(long number) {\n\t\tif (number < 2)\n\t\t\treturn false;\n\t\tfor (long i = 2; i * i <= number; i++) {\n\t\t\tif (number % i == 0)\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\n\tpublic static long[] generateReverse(int upTo, long module) {\n\t\tlong[] result = new long[upTo];\n\t\tif (upTo > 1)\n\t\t\tresult[1] = 1;\n\t\tfor (int i = 2; i < upTo; i++)\n\t\t\tresult[i] = (module - module / i * result[((int) (module % i))]\n\t\t\t\t\t% module)\n\t\t\t\t\t% module;\n\t\treturn result;\n\t}\n\n\tpublic static long[] generateReverseFactorials(int upTo, long module) {\n\t\tlong[] result = generateReverse(upTo, module);\n\t\tif (upTo > 0)\n\t\t\tresult[0] = 1;\n\t\tfor (int i = 1; i < upTo; i++)\n\t\t\tresult[i] = result[i] * result[i - 1] % module;\n\t\treturn result;\n\t}\n\n\tpublic static long[] generatePowers(long base, int count, long mod) {\n\t\tlong[] result = new long[count];\n\t\tif (count != 0)\n\t\t\tresult[0] = 1 % mod;\n\t\tfor (int i = 1; i < count; i++)\n\t\t\tresult[i] = result[i - 1] * base % mod;\n\t\treturn result;\n\t}\n\n\tpublic static long nextPrime(long from) {\n\t\tif (from <= 2)\n\t\t\treturn 2;\n\t\tfrom += 1 - (from & 1);\n\t\twhile (!isPrime(from))\n\t\t\tfrom += 2;\n\t\treturn from;\n\t}\n\n\tpublic static long binomialCoefficient(int n, int m, long mod) {\n\t\tif (m < 0 || m > n)\n\t\t\treturn 0;\n\t\tif (2 * m > n)\n\t\t\tm = n - m;\n\t\tlong result = 1;\n\t\tfor (int i = n - m + 1; i <= n; i++)\n\t\t\tresult = result * i % mod;\n\t\treturn result\n\t\t\t\t* BigInteger.valueOf(factorial(m, mod))\n\t\t\t\t\t\t.modInverse(BigInteger.valueOf(mod)).longValue() % mod;\n\t}\n\n\tpublic static boolean isSquare(long number) {\n\t\tlong sqrt = Math.round(Math.sqrt(number));\n\t\treturn sqrt * sqrt == number;\n\t}\n\n\tpublic static long findCommon(long aRemainder, long aMod, long bRemainder,\n\t\t\tlong bMod) {\n\t\tlong modGCD = gcd(aMod, bMod);\n\t\tlong gcdRemainder = aRemainder % modGCD;\n\t\tif (gcdRemainder != bRemainder % modGCD)\n\t\t\treturn -1;\n\t\taMod /= modGCD;\n\t\taRemainder /= modGCD;\n\t\tbMod /= modGCD;\n\t\tbRemainder /= modGCD;\n\t\tlong aReverse = BigInteger.valueOf(aMod)\n\t\t\t\t.modInverse(BigInteger.valueOf(bMod)).longValue();\n\t\tlong bReverse = BigInteger.valueOf(bMod)\n\t\t\t\t.modInverse(BigInteger.valueOf(aMod)).longValue();\n\t\tlong mod = aMod * bMod;\n\t\treturn (bReverse * aRemainder % mod * bMod + aReverse * bRemainder\n\t\t\t\t% mod * aMod)\n\t\t\t\t% mod * modGCD + gcdRemainder;\n\t}\n\n\tpublic static long[] generatePowers(long base, long maxValue) {\n\t\tif (maxValue <= 0)\n\t\t\treturn new long[0];\n\t\tint size = 1;\n\t\tlong current = 1;\n\t\twhile (maxValue / base >= current) {\n\t\t\tcurrent *= base;\n\t\t\tsize++;\n\t\t}\n\t\treturn generatePowers(base, size, Long.MAX_VALUE);\n\t}\n}\n\ninterface IntComparator extends Comparator<Integer> {\n\tpublic static final IntComparator DEFAULT = new IntComparator() {\n\t\tpublic int compare(Integer first, Integer second) {\n\t\t\tif (first < second)\n\t\t\t\treturn -1;\n\t\t\tif (first > second)\n\t\t\t\treturn 1;\n\t\t\treturn 0;\n\t\t}\n\t};\n\n\tpublic static final IntComparator REVERSE = new IntComparator() {\n\t\tpublic int compare(Integer first, Integer second) {\n\t\t\tif (first < second)\n\t\t\t\treturn 1;\n\t\t\tif (first > second)\n\t\t\t\treturn -1;\n\t\t\treturn 0;\n\t\t}\n\t};\n\n\tpublic int compare(Integer first, Integer second);\n}\n\nclass BidirectionalGraph extends Graph {\n\tpublic int[] transposedEdge;\n\n\tpublic BidirectionalGraph(int vertexCount) {\n\t\tthis(vertexCount, vertexCount);\n\t}\n\n\tpublic BidirectionalGraph(int vertexCount, int edgeCapacity) {\n\t\tsuper(vertexCount, 2 * edgeCapacity);\n\t\ttransposedEdge = new int[2 * edgeCapacity];\n\t}\n\n\tpublic static BidirectionalGraph createGraph(int vertexCount, int[] from,\n\t\t\tint[] to) {\n\t\tBidirectionalGraph graph = new BidirectionalGraph(vertexCount,\n\t\t\t\tfrom.length);\n\t\tfor (int i = 0; i < from.length; i++)\n\t\t\tgraph.addSimpleEdge(from[i], to[i]);\n\t\treturn graph;\n\t}\n\n\tpublic static BidirectionalGraph createWeightedGraph(int vertexCount,\n\t\t\tint[] from, int[] to, long[] weight) {\n\t\tBidirectionalGraph graph = new BidirectionalGraph(vertexCount,\n\t\t\t\tfrom.length);\n\t\tfor (int i = 0; i < from.length; i++)\n\t\t\tgraph.addWeightedEdge(from[i], to[i], weight[i]);\n\t\treturn graph;\n\t}\n\n\tpublic static BidirectionalGraph createFlowGraph(int vertexCount,\n\t\t\tint[] from, int[] to, long[] capacity) {\n\t\tBidirectionalGraph graph = new BidirectionalGraph(vertexCount,\n\t\t\t\tfrom.length * 2);\n\t\tfor (int i = 0; i < from.length; i++)\n\t\t\tgraph.addFlowEdge(from[i], to[i], capacity[i]);\n\t\treturn graph;\n\t}\n\n\tpublic static BidirectionalGraph createFlowWeightedGraph(int vertexCount,\n\t\t\tint[] from, int[] to, long[] weight, long[] capacity) {\n\t\tBidirectionalGraph graph = new BidirectionalGraph(vertexCount,\n\t\t\t\tfrom.length * 2);\n\t\tfor (int i = 0; i < from.length; i++)\n\t\t\tgraph.addFlowWeightedEdge(from[i], to[i], weight[i], capacity[i]);\n\t\treturn graph;\n\t}\n\n\t@Override\n\tpublic int addEdge(int fromID, int toID, long weight, long capacity,\n\t\t\tint reverseEdge) {\n\t\tint lastEdgeCount = edgeCount;\n\t\tsuper.addEdge(fromID, toID, weight, capacity, reverseEdge);\n\t\tsuper.addEdge(toID, fromID, weight, capacity, reverseEdge == -1 ? -1\n\t\t\t\t: reverseEdge + 1);\n\t\tthis.transposedEdge[lastEdgeCount] = lastEdgeCount + 1;\n\t\tthis.transposedEdge[lastEdgeCount + 1] = lastEdgeCount;\n\t\treturn lastEdgeCount;\n\t}\n\n\t@Override\n\tprotected int entriesPerEdge() {\n\t\treturn 2;\n\t}\n\n\t@Override\n\tpublic final int transposed(int id) {\n\t\treturn transposedEdge[id];\n\t}\n\n\t@Override\n\tprotected void ensureEdgeCapacity(int size) {\n\t\tif (size > edgeCapacity()) {\n\t\t\tsuper.ensureEdgeCapacity(size);\n\t\t\ttransposedEdge = resize(transposedEdge, edgeCapacity());\n\t\t}\n\t}\n}\n\nclass Pair<U, V> implements Comparable<Pair<U, V>> {\n\tpublic final U first;\n\tpublic final V second;\n\n\tpublic static <U, V> Pair<U, V> makePair(U first, V second) {\n\t\treturn new Pair<U, V>(first, second);\n\t}\n\n\tprivate Pair(U first, V second) {\n\t\tthis.first = first;\n\t\tthis.second = second;\n\t}\n\n\t@Override\n\tpublic boolean equals(Object o) {\n\t\tif (this == o)\n\t\t\treturn true;\n\t\tif (o == null || getClass() != o.getClass())\n\t\t\treturn false;\n\n\t\tPair pair = (Pair) o;\n\n\t\treturn !(first != null ? !first.equals(pair.first) : pair.first != null)\n\t\t\t\t&& !(second != null ? !second.equals(pair.second)\n\t\t\t\t\t\t: pair.second != null);\n\n\t}\n\n\t@Override\n\tpublic int hashCode() {\n\t\tint result = first != null ? first.hashCode() : 0;\n\t\tresult = 31 * result + (second != null ? second.hashCode() : 0);\n\t\treturn result;\n\t}\n\n\tpublic Pair<V, U> swap() {\n\t\treturn makePair(second, first);\n\t}\n\n\t@Override\n\tpublic String toString() {\n\t\treturn \"(\" + first + \",\" + second + \")\";\n\t}\n\n\t@SuppressWarnings({ \"unchecked\" })\n\tpublic int compareTo(Pair<U, V> o) {\n\t\tint value = ((Comparable<U>) first).compareTo(o.first);\n\t\tif (value != 0)\n\t\t\treturn value;\n\t\treturn ((Comparable<V>) second).compareTo(o.second);\n\t}\n}\n\ninterface Edge {\n\tpublic int getSource();\n\n\tpublic int getDestination();\n\n\tpublic long getWeight();\n\n\tpublic long getCapacity();\n\n\tpublic long getFlow();\n\n\tpublic void pushFlow(long flow);\n\n\tpublic boolean getFlag(int bit);\n\n\tpublic void setFlag(int bit);\n\n\tpublic void removeFlag(int bit);\n\n\tpublic int getTransposedID();\n\n\tpublic Edge getTransposedEdge();\n\n\tpublic int getReverseID();\n\n\tpublic Edge getReverseEdge();\n\n\tpublic int getID();\n\n\tpublic void remove();\n\n\tpublic void restore();\n}\n\ninterface Function<A, V> {\n\tpublic abstract V value(A argument);\n}", "lang_cluster": "Java", "tags": ["math", "implementation", "number theory"], "code_uid": "b80a4f1d1c666e5495dbdf94feef2160", "src_uid": "06eb66df61ff5d61d678bbb3bb6553cc", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class B {\n public static void main(String[] args) throws Exception {\n new B().solve();\n // new FileInputStream(new File(\"input.txt\")),\n // new PrintStream(new FileOutputStream(new File(\"output.txt\"))));\n }\n\n void solve() throws IOException {\n BufferedReader in = new BufferedReader(new\n InputStreamReader(System.in));\n Scanner sc = new Scanner(System.in);\n String[] sp;\n\n long x = sc.nextInt();\n long y = sc.nextInt();\n long n = sc.nextInt();\n long na = Integer.MAX_VALUE;\n long nb = 1;\n long ra, rb = ra = 0;\n for (long b = 1; b <= n; b++) {\n long _a = b * x / y;\n for (int i = 0; i < 2; i++) {\n long a = _a + i;\n long naa = Math.abs(a * y - b * x);\n long nbb = b * y;\n if ((na * nbb > naa * nb && (double) naa * nb < Long.MAX_VALUE) || na / 100 * nbb > naa / 100 * nbb) {\n na = naa;\n nb = nbb;\n ra = a;\n rb = b;\n }\n }\n }\n\n System.out.println(ra + \"/\" + rb);\n }\n}\n\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n", "lang_cluster": "Java", "tags": ["two pointers", "implementation", "brute force"], "code_uid": "62bd2af80fb27650a2874e18b7691269", "src_uid": "827bc6f120aff6a6f04271bc84e863ee", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.Scanner;\n\npublic class HungryStudentProblem {\n public static void main(String[] args) {\n Scanner s = new Scanner(System.in);\n int n = s.nextInt();\n for(int i = 0; i < n; i++) {\n int x = s.nextInt();\n int one = 0, two = 0;\n label:\n for(int j = 0; j <= x / 3 + 1; j++) {\n for(int k = 0; k <= x / 7 + 1; k++) {\n if(3 * j + 7 * k == x) {\n one = j;\n two = k;\n break label;\n }\n }\n }\n if(3 * one + 7 * two == x) System.out.println(\"YES\");\n else System.out.println(\"NO\");\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["greedy", "implementation"], "code_uid": "25a45527f2d35e5a5080d52740fc7925", "src_uid": "cfd1182be98fb5f0c426f8b68e48d452", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*; \nimport java.util.*;\n \npublic class Main {\n\t\n static class FastScanner\n { \n BufferedReader br; \n StringTokenizer st; \n \n public FastScanner() \n { \n br = new BufferedReader(new\n InputStreamReader(System.in)); \n } \n \n String next() \n { \n while (st == null || !st.hasMoreElements()) \n { \n try\n { \n st = new StringTokenizer(br.readLine()); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n } \n return st.nextToken(); \n } \n \n int nextInt() \n { \n return Integer.parseInt(next()); \n } \n \n long nextLong() \n { \n return Long.parseLong(next()); \n } \n \n double nextDouble() \n { \n return Double.parseDouble(next()); \n } \n \n String nextLine() \n { \n String str = \"\"; \n try\n { \n str = br.readLine(); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n return str; \n } \n } \n \n public static void main(String[] args) throws IOException {\n FastScanner sc=new FastScanner();\n int N = sc.nextInt();\n int C = sc.nextInt();\n int[] p = new int[N];\n for (int i = 0; i < N; i++)\n \tp[i] = sc.nextInt();\n int[] t = new int[N];\n for (int i = 0; i < N; i++)\n \tt[i] = sc.nextInt();\n \n int score1 = 0;\n int time1 = 0;\n for (int i = 0; i < N; i++) {\n \ttime1 += t[i];\n \tscore1 += Math.max(0, p[i] - C*time1);\n }\n \n int score2 = 0;\n int time2 = 0;\n for (int i = N-1; i >= 0; i--) {\n \ttime2 += t[i];\n \tscore2 += Math.max(0, p[i] - C*time2);\n }\n \n if (score1 > score2) {\n \tSystem.out.println(\"Limak\");\n } else if (score2 > score1) {\n \tSystem.out.println(\"Radewoosh\");\n } else {\n \tSystem.out.println(\"Tie\");\n }\n }\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "157187619064b9eccbab14fdc7c5a71b", "src_uid": "8c704de75ab85f9e2c04a926143c8b4a", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\npublic class MartianClock {\n\tpublic static void main(String[] args){\n\t\tScanner reader = new Scanner(System.in);\n\t\tString in = reader.next();\n\t\tStringTokenizer st = new StringTokenizer(in, \":\");\n\t\tString a = st.nextToken();\n\t\tString b = st.nextToken();\n\t\t\n\t\tLinkedList<Integer> q = new LinkedList<Integer>();\n\t\t//try all bases!\n\t\tfor(int i = 2; i <= 70; i++){\n\t\t\ttry{\n\t\t\t\tint A = parseInt(a,i);\n\t\t\t\tint B = parseInt(b,i);\n\t\t\t\tif(A <= 23 && B <= 59)\n\t\t\t\t\tq.add(i);\n\t\t\t}catch(Exception e){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\t\t\n\t\tif(q.size() == 0){\n\t\t\tSystem.out.println(0);\n\t\t}else if(q.getLast() == 70){\n\t\t\tSystem.out.println(-1);\n\t\t}else{\n\t\t\twhile(!q.isEmpty())\n\t\t\t\tSystem.out.print(q.remove() + \" \");\n\t\t\tSystem.out.println();\n\t\t}\n\t}\n\t\n\tpublic static int parseInt(String a, int b){\n\t\tif(b < 36)\n\t\t\treturn Integer.parseInt(a,b);\n\t\tint sum = 0;\n\t\tfor(int i = 0; i < a.length(); i++){\n\t\t\tsum *= b;\n\t\t\tsum += a.charAt(i)>='A'?(a.charAt(i)-'A'+10):(a.charAt(i)-'0');\n\t\t}\n\t\treturn sum;\n\t}\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "496abf470d016e6db028ebb025d814ce", "src_uid": "c02dfe5b8d9da2818a99c3afbe7a5293", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.text.DecimalFormat;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.Hashtable;\nimport java.util.LinkedList;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.PriorityQueue;\nimport java.util.Queue;\nimport java.util.Scanner;\nimport java.util.Set;\nimport java.util.TreeSet;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.InputStream;\nimport java.math.BigDecimal;\nimport java.math.BigInteger;\n\npublic class palin {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tScanner scan = new Scanner(System.in);\n\t\tTaskC solver = new TaskC();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskC {\n\tpublic void solve(int testNumber, InputReader in, PrintWriter out) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt(), a[] = new int[n], max = 0;\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\ta[i] = scan.nextInt();\n\t\t}\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\tfor (int j = i; j < a.length; j++) {\n\t\t\t\tmax = Math.max(max, count(i, j, a));\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(max);\n\t}\n\n\tpublic static int count(int x, int y, int a[]) {\n\t\tint c = 0, co = 0;\n\t\tfor (int i = x; i <= y; i++) {\n\t\t\tif (a[i] == 0) {\n\t\t\t\tc++;\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\tif (a[i] == 1 && i < x || a[i] == 1 && i > y) {\n\t\t\t\tco++;\n\t\t\t}\n\t\t}\n\t\treturn co + c;\n\t}\n}\n\nclass InputReader {\n\tBufferedReader br;\n\tStringTokenizer st;\n\n\tpublic InputReader(InputStream in) {\n\t\tbr = new BufferedReader(new InputStreamReader(in));\n\t\tst = null;\n\t}\n\n\tpublic String next() {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tpublic int nextInt() {\n\t\treturn Integer.parseInt(next());\n\t}\n\n\tpublic long nextLong() {\n\t\treturn Long.parseLong(next());\n\t}\n\n\tpublic float nextFloat() {\n\t\treturn Float.parseFloat(next());\n\t}\n\n\tpublic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "dp", "implementation"], "code_uid": "84b9de7678b5deb91f099823190e8a92", "src_uid": "9b543e07e805fe1dd8fa869d5d7c8b99", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedInputStream;\nimport java.io.IOException;\nimport java.io.PrintWriter;\nimport java.math.BigInteger;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.Comparator;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.InputMismatchException;\nimport java.util.LinkedList;\nimport java.util.Map.Entry;\nimport java.util.Queue;\nimport java.util.Random;\nimport java.util.Set;\nimport java.util.SortedSet;\nimport java.util.Stack;\nimport java.util.TreeMap;\nimport java.util.TreeSet;\n\npublic class Main\n{\t\n\t/********************************************** a list of common variables **********************************************/\n\t\n\tprivate MyScanner scan = new MyScanner();\n\tprivate PrintWriter out = new PrintWriter(System.out);\n\tprivate final double PI = Math.acos(-1.0);\n\tprivate final int SIZEN = (int)(1e6);\n\tprivate final int MOD = (int)(1e9 + 7);\n\tprivate int n;\n\tprivate int k;\n\tprivate long s;\n\tprivate int m;\n\tprivate long[] a;\n\tprivate long[] f;\n\tprivate long ans;\n\tprivate HashMap<Long, Long>[] hm;\n\t\n\tpublic void dfs1(int p, int step, long sum)\n\t{\n\t\tif(sum > s)\n\t\t{\n\t\t\treturn;\n\t\t}\n\t\thm[step].put(sum, hm[step].containsKey(sum) ? hm[step].get(sum) + 1 : 1);\n\t\tif(p >= m)\n\t\t{\n\t\t\treturn;\n\t\t}\n\t\tfor(int i = p;i < m;++i)\n\t\t{\n\t\t\tif(sum + a[i] <= s)\n\t\t\t{\n\t\t\t\tdfs1(i + 1, step, sum + a[i]);\n\t\t\t}\n\t\t\tif(sum + f[i] <= s && step < k)\n\t\t\t{\n\t\t\t\tdfs1(i + 1, step + 1, sum + f[i]);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tpublic void dfs2(int p, int step, long sum)\n\t{\n\t\tif(sum > s)\n\t\t{\n\t\t\treturn;\n\t\t}\n\t\tfor(int i = 0;i <= k - step;++i)\n\t\t{\n\t\t\tans += hm[i].containsKey(s - sum) ? hm[i].get(s - sum) : 0;\n\t\t}\n\t\tif(p >= n)\n\t\t{\n\t\t\treturn;\n\t\t}\n\t\tfor(int i = p;i < n;++i)\n\t\t{\n\t\t\tif(sum + a[i] <= s)\n\t\t\t{\n\t\t\t\tdfs2(i + 1, step, sum + a[i]);\n\t\t\t}\n\t\t\tif(sum + f[i] <= s && step < k)\n\t\t\t{\n\t\t\t\tdfs2(i + 1, step + 1, sum + f[i]);\n\t\t\t}\n\t\t}\t\t\n\t}\n\t\n\tpublic void foo()\n\t{\n\t\tn = scan.nextInt();\n\t\tk = scan.nextInt();\n\t\ts = scan.nextLong();\n\t\ta = new long[n];\n\t\tf = new long[n];\n\t\tfor(int i = 0;i < n;++i)\n\t\t{\n\t\t\ta[i] = scan.nextLong();\n\t\t\tf[i] = 1;\n\t\t\tfor(int j = 1;j <= a[i];++j)\n\t\t\t{\n\t\t\t\tf[i] *= j;\n\t\t\t\tif(f[i] > s)\n\t\t\t\t{\n\t\t\t\t\tf[i] = s + 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tm = n / 2;\n\t\thm = new HashMap[k + 1];\n\t\tfor(int i = 0;i <= k;++i)\n\t\t{\n\t\t\thm[i] = new HashMap<Long, Long>();\n\t\t}\n\t\tdfs1(0, 0, 0);\n\t\tans = 0;\n\t\tdfs2(m, 0, 0);\n\t\tout.println(ans);\n\t}\n\n\tpublic static void main(String[] args)\n\t{\n\t\tMain m = new Main();\n\t\tm.foo();\n\t\tm.out.close();\n\t}\n\t\n\t/********************************************** a list of common algorithms **********************************************/\n\t\n\t/**\n\t * KMP match, i.e. kmpMatch(\"abcd\", \"bcd\") = 1, kmpMatch(\"abcd\", \"bfcd\") = -1.\n\t * \n\t * @param\tt\tString to match.\n\t * @param\tp\tString to be matched.\n\t * @return\tif can match, first index; otherwise -1.\n\t */\n\tpublic int kmpMatch(char[] t, char[] p)\n\t{\n\t\tint n = t.length;\n\t\tint m = p.length;\n\t\tint[] next = new int[m + 1];\n\t\tnext[0] = -1;\n\t\tint j = -1;\n\t\tfor(int i = 1;i < m;++i)\n\t\t{\n\t\t\twhile(j >= 0 && p[i] != p[j + 1])\n\t\t\t{\n\t\t\t\tj = next[j];\n\t\t\t}\n\t\t\tif(p[i] == p[j + 1])\n\t\t\t{\n\t\t\t\t++j;\n\t\t\t}\n\t\t\tnext[i] = j;\n\t\t}\n\t\tj = -1;\n\t\tfor(int i = 0;i < n;++i)\n\t\t{\n\t\t\twhile(j >= 0 && t[i] != p[j + 1])\n\t\t\t{\n\t\t\t\tj = next[j];\n\t\t\t}\n\t\t\tif(t[i] == p[j + 1])\n\t\t\t{\n\t\t\t\t++j;\n\t\t\t}\n\t\t\tif(j == m - 1)\n\t\t\t{\n\t\t\t\treturn i - m + 1;\n\t\t\t}\n\t\t}\n\t\treturn -1;\n\t}\n\n\t/**\n\t * Get greatest common divisor\n\t * @param\ta\tan argument\n\t * @param\tb\tanother argument\n\t * @return\tgreatest common divisor\n\t */\n\tpublic int gcd(int a, int b)\n\t{\n\t\treturn 0 == b ? a : gcd(b, a % b);\n\t}\n\t\n\t/**\n\t * Get the minimum distance from a point to a segment (not a line) \n\t * @param\tx\tx coordinate of the point\n\t * @param\ty\ty coordinate of the point\n\t * @param\tx1\tx coordinate of one point of the segment\n\t * @param \ty1\ty coordinate of one point of the segment\n\t * @param \tx2\tx coordinate of another point of the segment\n\t * @param \ty2\ty coordinate of another point of the segment\n\t * @return\tthe minimum distance from point (x, y) to segment (x1, y1)-(x2, y2)\n\t */\n\tpublic double ptToSeg(double x, double y, double x1, double y1, double x2, double y2)\n\t{\n\t\tdouble cross = (x2 - x1) * (x - x1) + (y2 - y1) * (y - y1);\n\t\tif(cross <= 0)\n\t\t{\n\t\t\treturn (x - x1) * (x - x1) + (y - y1) * (y - y1);\n\t\t}\n\t\tdouble d = (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1);\n\t\tif(cross >= d) \n\t\t{\n\t\t\treturn (x - x2) * (x - x2) + (y - y2) * (y - y2);\n\t\t}\n\t\tdouble r = cross / d;\n\t\tdouble px = x1 + (x2 - x1) * r;\n\t\tdouble py = y1 + (y2 - y1) * r;\n\t\treturn (x - px) * (x - px) + (y - py) * (y - py);\n\t}\n\t\n\tclass MyScanner\n\t{\n\t private byte[] buf = new byte[1024];\n\t private int curChar;\n\t private int numChars;\n\t BufferedInputStream bis = new BufferedInputStream(System.in);\n\n\t public int read() \n\t {\n\t if (-1 == numChars)\n\t {\n\t \tthrow new InputMismatchException();\n\t }\n\t if (curChar >= numChars)\n\t {\n\t curChar = 0;\n\t try \n\t {\n\t numChars = bis.read(buf);\n\t }\n\t catch (IOException e)\n\t {\n\t throw new InputMismatchException();\n\t }\n\t if (numChars <= 0)\n\t {\n\t \treturn -1;\n\t }\n\t }\n\t return buf[curChar++];\n\t }\n\n\t public int nextInt() \n\t {\n\t int c = read();\n\t while (isSpaceChar(c))\n\t {\n\t \tc = read();\n\t }\n\t int sgn = 1;\n\t if (c == '-') \n\t {\n\t sgn = -1;\n\t c = read();\n\t }\n\t int res = 0;\n\t do \n\t {\n\t if (c < '0' || c > '9')\n\t {\n\t \tthrow new InputMismatchException();\n\t }\n\t res *= 10;\n\t res += c - '0';\n\t c = read();\n\t } while (!isSpaceChar(c));\n\t return res * sgn;\n\t }\n\t \n\t public long nextLong() \n\t {\n\t \tint c = read();\n\t \twhile (isSpaceChar(c))\n\t \t{\n\t \t\tc = read();\n\t \t}\n\t \tint sgn = 1;\n\t \tif (c == '-') \n\t \t{\n\t \t\tsgn = -1;\n\t \t\tc = read();\n\t \t}\n\t \tlong res = 0;\n\t \tdo \n\t \t{\n\t \t\tif (c < '0' || c > '9')\n\t \t\t{\n\t \t\t\tthrow new InputMismatchException();\n\t \t\t}\n\t \t\tres *= 10;\n\t \t\tres += c - '0';\n\t \t\tc = read();\n\t \t} while (!isSpaceChar(c));\n\t \treturn res * sgn;\n\t }\n\t \n\t public double nextDouble() \n\t {\n\t int c = read();\n\t while (isSpaceChar(c))\n\t {\n\t \tc = read();\n\t }\n\t int sgn = 1;\n\t if (c == '-')\n\t {\n\t sgn = -1;\n\t c = read();\n\t }\n\t double res = 0;\n\t while (!isSpaceChar(c) && c != '.') \n\t {\n\t if (c == 'e' || c == 'E')\n\t {\n\t \treturn res * Math.pow(10, nextInt());\n\t }\n\t if (c < '0' || c > '9')\n\t {\n\t \tthrow new InputMismatchException();\n\t }\n\t res *= 10;\n\t res += c & 15;\n\t c = read();\n\t }\n\t if (c == '.') \n\t {\n\t c = read();\n\t double m = 1;\n\t while (!isSpaceChar(c)) \n\t {\n\t if (c == 'e' || c == 'E')\n\t {\n\t \treturn res * Math.pow(10, nextInt());\n\t }\n\t if (c < '0' || c > '9')\n\t {\n\t \tthrow new InputMismatchException();\n\t }\n\t m /= 10;\n\t res += (c & 15) * m;\n\t c = read();\n\t }\n\t }\n\t return res * sgn;\n\t }\n\t \n\t public String next()\n\t {\n\t int c = read();\n\t while (isSpaceChar(c))\n\t {\n\t \tc = read();\n\t }\n\t StringBuilder res = new StringBuilder();\n\t do \n\t {\n\t res.appendCodePoint(c);\n\t c = read();\n\t } while (!isSpaceChar(c));\n\t return res.toString();\n\t }\n\n\t private boolean isSpaceChar(int c) \n\t {\n\t return ' ' == c || '\\n' == c || '\\r' == c || '\\t' == c || -1 == c;\n\t }\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "binary search", "bitmasks", "meet-in-the-middle"], "code_uid": "d05973986a559ae8c51f9424f77d748d", "src_uid": "2821a11066dffc7e8f6a60a8751cea37", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.StringTokenizer;\n\npublic class JavaApplication1 {\nLong a,b;\n private void solution() throws IOException {\n a = in.nextLong();\n b = in.nextLong();\n rec( a, b);\n out.println(a + \" \" + b);\n }\n \n private void rec( Long a, Long b){\n if(a==0 || b==0) {\n this.a = a;\n this.b = b;\n return;\n }\n else if(a >= 2*b) rec((a)%(b*2), b);\n else if(b >= 2*a) rec(a, b%(2*a));\n else{\n this.a = a;\n this.b = b;\n }\n }\n private void run() throws IOException {\n in = new Scanner(System.in);\n out = new PrintWriter(System.out);\n solution();\n in.close();\n out.close();\n }\n\n private Scanner in;\n private PrintWriter out;\n\n public static void main(String[] args) throws IOException {\n new JavaApplication1().run();\n }\n\n private class Scanner {\n \n BufferedReader br;\n StringTokenizer st;\n\n private Scanner(InputStream is) {\n br = new BufferedReader(new InputStreamReader(is));\n }\n\n private String next() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return st.nextToken();\n }\n\n private Integer nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n private Long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n private Double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n\n private void close() throws IOException {\n st = null;\n br.close();\n }\n }\n}", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "ec3e5eb38c8d1e583df9a258ff988b6f", "src_uid": "1f505e430eb930ea2b495ab531274114", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class P3 {\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner input = new Scanner(System.in);\n\t\tString form = \"\";\n\t\tint nb = 0;\n\t\tint ns = 0;\n\t\tint nc = 0;\n\t\tint pb = 0;\n\t\tint ps = 0;\n\t\tint pc = 0;\n\t\tlong r = 0;\n\t\t\n if (input.hasNext()) { \t\t \t\t\n \t\tform = input.next();\n \t\tnb = input.nextInt();\n \t\tns = input.nextInt();\n \t\tnc = input.nextInt();\n \t\tpb = input.nextInt();\n \t\tps = input.nextInt();\n \t\tpc = input.nextInt();\n \t\tr = input.nextLong();\n } \n int b = 0; \n int s = 0;\n int c = 0;\n \n for(int i = 0; i < form.length(); i++){\n \tchar aux = form.charAt(i);\n \tif(aux == 'B') b++;\n \tif(aux == 'C') c++;\n \tif(aux == 'S') s++;\n }\n \n long min = 0;\n long max = (long) Math.pow(10, 14); \n \n \n while(min + 1 < max){\n \tlong aux = (min + max)/2;\n \t\n \tlong total_b = (aux*b > nb)? (aux*b-nb)*pb : 0;\n \tlong total_s = (aux*s > ns)? (aux*s-ns)*ps : 0;\n \tlong total_c = (aux*c > nc)? (aux*c-nc)*pc : 0;\n \t\n \tlong total = total_b + total_s + total_c;\n \tif(total <= r){\n \t\tmin = aux;\n \t} else {\n \t\tmax = aux;\n \t}\n \t\n }\n System.out.println(min);\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "binary search"], "code_uid": "f23c8145d17ecd9aa69cfe1bc9ed97f0", "src_uid": "8126a4232188ae7de8e5a7aedea1a97e", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\nimport java.util.Arrays;\n\npublic class SampleA497\n{\n\n\tpublic static void main(String[] args)\n\t{\tScanner s = new Scanner(System.in);\n // int n = s.nextInt();\n // int m = s.nextInt();\n \n int i=0,sum=0,j=0,temp=0,h=0,r=0,t=0;\n String s1 = s.next();\n // System.out.println(s1.length());\n int len = s1.length();\n if(s1.charAt(len-1)!='a' && s1.charAt(len-1)!='e' && s1.charAt(len-1)!='i' && s1.charAt(len-1)!='o' && s1.charAt(len-1)!='u' && s1.charAt(len-1)!='n'){\n h=1;\n }\n else{\n for(i=0;i<len-1;i++){\n char l = s1.charAt(i);\n char y = s1.charAt(i+1);\n t=0;\n if(l !='a' && l !='e' && l !='i' && l !='o' && l !='u' ){\n t=1;\n h++;\n // System.out.println(l);\n }\n if(t==1){\n if(y =='a' || y =='e' || y =='i' || y =='o' || y =='u' || l =='n'){\n r++; \n }else{\n\n }\n }\n // System.out.println(l);\n }\n }\n // System.out.println(h);\n // System.out.println(r);\n if(h==r ){\n System.out.println(\"YES\");\n }else{\n System.out.println(\"NO\");\n }\n \n\t}\n}\n", "lang_cluster": "Java", "tags": ["strings", "implementation"], "code_uid": "34890939df6126027a5cd1e09aa4e8c6", "src_uid": "a83144ba7d4906b7692456f27b0ef7d4", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\npublic final class Round431 {\n\t\tpublic static void main(String args[]){\n\t\t\tScanner sc = new Scanner(System.in);\n\t\t\tlong ax = sc.nextInt();\n\t\t\tlong ay = sc.nextInt();\n\t\t\tlong bx = sc.nextInt();\n\t\t\tlong by = sc.nextInt();\n\t\t\tlong cx = sc.nextInt();\n\t\t\tlong cy = sc.nextInt();\n\t\t\t//float c=(cx*cx)+(cy*cy);\n\t\t\tlong a=(ax-bx)*(ax-bx)+(ay-by)*(ay-by);\n\t\t\tlong b=(bx-cx)*(bx-cx)+(by-cy)*(by-cy);\n \n//\t\t\tSystem.out.println(a+\" \"+b+\" \"+c);\n//\t\t\tfloat p=(b-a)/2;\n//\t\t\tfloat q=(b-c)/2;\n//\t\t\tfloat X=(q-p*(by-ay))/(ax-cx);\n//\t\t\tfloat Y=p-X*(bx-ax);\n//\t\t\tSystem.out.println(X+\" \"+Y);\n//\t\t\tfloat m1m2 = ((ay-Y)*(cy-Y)*(by-Y))/((ax-X)*(cx-X)*(bx-X));\n//\t\t\tSystem.out.println(m1m2);\n\t\t\tif(a==b && ((by-ay)*(cx-bx)!=(cy-by)*(bx-ax)))\n\t\t\t\t\tSystem.out.println(\"Yes\");\n\t\t\t\n\t\t\telse\n\t\t\t\t\tSystem.out.println(\"No\");\n\t\t\tsc.close();\n\t\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "geometry"], "code_uid": "59cb0b9dcb81203f491f553e6e2e0fe6", "src_uid": "05ec6ec3e9ffcc0e856dc0d461e6eeab", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport static java.lang.Math.*;\nimport java.io.File;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.*;\n\npublic class CodeforcesMonitor implements Runnable {\n public static final String taskname = \"A\";\n BufferedReader in;\n PrintWriter out;\n StringTokenizer tok;\n\n public static void main(String[] args) {\n new Thread(new CodeforcesMonitor()).start();\n }\n \n int gcd(int x, int y) {\n if(y == 0) return x;\n return gcd(y, x % y);\n }\n\n void solve() throws IOException {\n int a, b, x, y;\n a = nextInt();\n b = nextInt();\n x = nextInt();\n y = nextInt();\n int d = gcd(x, y);\n x /= d;\n y /= d;\n int m = a / x;\n int n = b / y;\n int k = Math.min(m, n);\n out.println(x * k + \" \" + y * k);\n }\n\n @Override\n public void run() {\n try {\n in = new BufferedReader(new InputStreamReader(System.in));\n // in = new BufferedReader(new FileReader(new File(taskname + \".in\")));\n out = new PrintWriter(System.out);\n // out = new PrintWriter(new File(taskname + \".out\"));\n solve();\n out.flush();\n out.close();\n in.close();\n } catch (IOException e) {\n // TODO Auto-generated catch block\n e.printStackTrace();\n }\n\n }\n\n String nextLine() throws IOException {\n tok = null;\n return in.readLine();\n }\n\n double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n String nextToken() throws IOException {\n while (tok == null || !tok.hasMoreTokens()) {\n tok = new StringTokenizer(in.readLine());\n }\n return tok.nextToken();\n }\n\n}\n", "lang_cluster": "Java", "tags": ["binary search", "number theory"], "code_uid": "4715cd6cfe3d1fa7bbd7a2096fe7aabd", "src_uid": "97999cd7c6de79a4e39f56a41ff59e7a", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.Scanner;\n\npublic class MainClass \n{\n\n\tpublic static void main(String[] args)\n\t{\n\t\tboolean win=false;\n\t\tScanner in=new Scanner(System.in);\n\t\tString[] str=new String[4];\n\t\tfor(int i=0;i<4;i++)\n\t\t{\n\t\t\tstr[i]=in.nextLine();\n\t\t}\n\t\tif(!win)\n\t\t{\n\t\tfor(int i=0;i<4;i++)\n\t\t{\n\t\t\tfor(int g=0;g<2;g++)\n\t\t\t{\n\t\t\t\tif(str[i].charAt(g)=='x'&&str[i].charAt(g+1)=='x'&&str[i].charAt(g+2)=='.')\n\t\t\t\t{\n\t\t\t\t\twin=true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(str[i].charAt(g)=='.'&&str[i].charAt(g+1)=='x'&&str[i].charAt(g+2)=='x')\n\t\t\t\t{\n\t\t\t\t\twin=true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(str[i].charAt(g)=='x'&&str[i].charAt(g+1)=='.'&&str[i].charAt(g+2)=='x')\n\t\t\t\t{\n\t\t\t\t\twin=true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t}\n\t\tif(!win)\n\t\t{\n\t\tfor(int i=0;i<2;i++)\n\t\t{\n\t\t\tfor(int g=0;g<4;g++)\n\t\t\t{\n\t\t\t\tif(str[i].charAt(g)=='x'&&str[i+1].charAt(g)=='x'&&str[i+2].charAt(g)=='.')\n\t\t\t\t{\n\t\t\t\t\twin=true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(str[i].charAt(g)=='.'&&str[i+1].charAt(g)=='x'&&str[i+2].charAt(g)=='x')\n\t\t\t\t{\n\t\t\t\t\twin=true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(str[i].charAt(g)=='x'&&str[i+1].charAt(g)=='.'&&str[i+2].charAt(g)=='x')\n\t\t\t\t{\n\t\t\t\t\twin=true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t}\n\t\tif(!win){\n\t\t\tfor(int i=0;i<2;i++)\n\t\t\t{\n\t\t\t\tfor(int g=0;g<2;g++)\n\t\t\t\t{\n\t\t\t\t\tif(str[i].charAt(g)=='x'&&str[i+1].charAt(g+1)=='x'&&str[i+2].charAt(g+2)=='.')\n\t\t\t\t\t{\n\t\t\t\t\t\twin=true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tif(str[i].charAt(g)=='.'&&str[i+1].charAt(g+1)=='x'&&str[i+2].charAt(g+2)=='x')\n\t\t\t\t\t{\n\t\t\t\t\t\twin=true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tif(str[i].charAt(g)=='x'&&str[i+1].charAt(g+1)=='.'&&str[i+2].charAt(g+2)=='x')\n\t\t\t\t\t{\n\t\t\t\t\t\twin=true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(!win){\n\t\t\tfor(int i=0;i<2;i++)\n\t\t\t{\n\t\t\t\tfor(int g=0;g<2;g++)\n\t\t\t\t{\n\t\t\t\t\tif(str[i].charAt(g+2)=='x'&&str[i+1].charAt(g+1)=='x'&&str[i+2].charAt(g)=='.')\n\t\t\t\t\t{\n\t\t\t\t\t\twin=true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tif(str[i].charAt(g+2)=='.'&&str[i+1].charAt(g+1)=='x'&&str[i+2].charAt(g)=='x')\n\t\t\t\t\t{\n\t\t\t\t\t\twin=true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tif(str[i].charAt(g+2)=='x'&&str[i+1].charAt(g+1)=='.'&&str[i+2].charAt(g)=='x')\n\t\t\t\t\t{\n\t\t\t\t\t\twin=true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(!win){\n\t\t\tSystem.out.println(\"NO\");\n\t\t}else{\n\t\t\tSystem.out.println(\"YES\");\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "bcb170aa57ccc10599917bc78a2ca9ea", "src_uid": "ca4a77fe9718b8bd0b3cc3d956e22917", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Scanner;\nimport java.io.OutputStream;\nimport java.io.IOException;\nimport java.util.Arrays;\nimport java.io.PrintWriter;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author codeKNIGHT\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tScanner in = new Scanner(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskC solver = new TaskC();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskC {\n\tpublic void solve(int testNumber, Scanner in, PrintWriter out) {\n int n=in.nextInt(),m=in.nextInt(),k=in.nextInt(),i,j,x,y,max=0;\n String s;\n int a[][][]=new int[n][m][3];\n for(i=0;i<n;i++)\n {\n s=in.next();\n for(j=0;j<m;j++)\n {\n a[i][j][0]=in.nextInt();\n a[i][j][1]=in.nextInt();\n a[i][j][2]=in.nextInt();\n }\n }\n for(i=0;i<n;i++)\n {\n for(j=0;j<n;j++)\n {\n if(i==j)\n continue;\n items profit[]=new items[m];\n for(x=0;x<m;x++)\n {\n profit[x]=new items(a[j][x][1]-a[i][x][0],x);\n }\n Arrays.sort(profit);\n\n int t=k,count=0,number;\n x=0;\n while(t>0&&x<m)\n {\n number=Math.min(a[i][profit[x].index][2],t);\n if(profit[x].p<=0)\n break;\n count+=profit[x].p*number;\n x++;\n t-=number;\n }\n if(count>max)\n max=count;\n\n\n }\n }\n out.println(max);\n\t}\n class items implements Comparable<items>\n {\n int index,p;\n public items(int p,int index)\n {\n this.p=p;\n this.index=index;\n }\n public int compareTo(items a)\n {\n if(a.p>this.p)\n return 1;\n return -1;\n }\n }\n}\n\n", "lang_cluster": "Java", "tags": ["greedy", "games", "graph matchings"], "code_uid": "4f95463b68aec5a0a1094694c74d14a8", "src_uid": "7419c4268a9815282fadca6581f28ec1", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "\nimport java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class a_66 {\n\n public void run(){\n Scanner sc = new Scanner(System.in);\n \n String s = sc.next();\n BigInteger n = new BigInteger(s);\n \n if( n.compareTo(BigInteger.valueOf(-128)) >= 0 && n.compareTo(BigInteger.valueOf(127)) <= 0)\n System.out.println(\"byte\");\n else if( n.compareTo(BigInteger.valueOf(-32768)) >= 0 && n.compareTo(BigInteger.valueOf(32767)) <= 0 )\n System.out.println(\"short\");\n else if ( n.compareTo(BigInteger.valueOf(-2147483648)) >= 0 && n.compareTo(BigInteger.valueOf(2147483647)) <= 0 )\n System.out.println(\"int\");\n else if ( n.compareTo(BigInteger.valueOf(-9223372036854775808L)) >= 0 && n.compareTo(BigInteger.valueOf(9223372036854775807L)) <= 0 )\n System.out.println(\"long\");\n else\n System.out.println(\"BigInteger\");\n }\n \n \n public static void main(String args[]){\n new a_66().run();\n }\n \n}\n", "lang_cluster": "Java", "tags": ["strings", "implementation"], "code_uid": "6ad7b4d3a3d43a187eda21244d2dfa61", "src_uid": "33041f1832fa7f641e37c4c638ab08a1", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class A741 {\n\n\tpublic static void main(String[] args){\n\t\t\n\t\tint n;\n\t\t\n\t\tA741 ob=new A741();\n\t\t\n\t\tScanner scan=new Scanner(System.in);\n\t\t\n\t\tn=scan.nextInt();\n\t\t\n\t\tint[] arr= new int[n];\n\t\t\n\t\t\n\t\t\n\t\tfor(int i=0;i<n;i++){\n\t\t\tarr[i]=scan.nextInt();\t\t\n\t\t}\n\t\t\n\t\tboolean[] tv=new boolean[n];\n\t\n\t\tint i=0;\n\t\tint max=1;\n\t\n\t\t\n\t\tfor(;i<n;i++){\n\t\t\tif(!tv[i]){\n\t\t\t\t\n\t\t\t\tArrayList<Integer> al=new ArrayList<>();\n\t\t\t\t\n\t\t\t\tal.add(i+1);\n\t\t\t\tint res=0;\n\t\t\t\t\n\t\t\t\t\n\t\t\t\twhile(!tv[i]){\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t \n\t\t\t\t\tal.add(arr[i]);\n\t\t\t\t\ttv[i]=true;\n\t\t\t\t\ti=arr[i]-1;\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(al.get(0)==al.get(al.size()-1))\n\t\t\t\t{\n\t\t\t\t\tres=al.size()-1;\n\t\t\t\t\t\n\t\t\t\t\tif(res%2==0)\n\t\t\t\t\t\tres/=2;\n\t\t\t\t\t\n\t\t\t\t\tmax=ob.lcm(max,res);\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\telse {\n\t\t\t\t\n\t\t\t\t\tSystem.out.println(\"-1\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\n\t\t\t}\n\t\t\t\t\n\t\t}\n\t\t\n\t\tSystem.out.println(max);\n\t}\n\t\n\tint lcm(int a,int b){\n\t\t\n\t\tint min,max;\n\t\t\n\t\tif(a>b)\n\t\t{\n\t\tmax=a;\n\t\tmin=b;\n\t\t}\n\t\telse\n\t\t{\n\t\tmax=b;\n\t\tmin=a;\n\t\t}\n\t\t \n\t\t/*\n\t\tTo find the maximum and minimum numbers, you can also use\n\t\tint max=a>b?a:b;\n\t\tint min=a<b?a:b;\n\t\t*/\n\t\t int x,lcm=1;\n\t\t \n\t\tfor(int i=1;i<=min;i++)\n\t\t {\n\t\t x=max*i; //finding multiples of the maximum number\n\t\t if(x%min==0) //Finding the multiple of maximum number which is divisible by the minimum number.\n\t\t {\n\t\t lcm=x; //making the 1st multiple of maximum number as lcm, which is divisible by the minimum number\n\t\t break; //exiting from the loop, as we don’t need anymore checking after getting the LCM\n\t\t }\n\t\t }\n\t\treturn lcm;\n}\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "math"], "code_uid": "1f5537581d7ee1e94960b1f836f59fc8", "src_uid": "149221131a978298ac56b58438df46c9", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\npublic class Solution\n{\n\tstatic Scanner sc = new Scanner(System.in);\n\tpublic static int solve()\n\t{\n\t\tint n = sc.nextInt(), pos = 0;\n\n\t\tfor(int i=0;i<n;i++)\n\t\t\tpos += Math.abs(sc.nextInt());\n\n\t\treturn pos;\n\t}\n\n\tpublic static void main(String args[])\n\t{\n\t\tSystem.out.println(solve());\n\t}\n}", "lang_cluster": "Java", "tags": ["greedy"], "code_uid": "6c8330abb727d609990a9ae31b024a34", "src_uid": "4b5d14833f9b51bfd336cc0e661243a5", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskD solver = new TaskD();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskD {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int x = in.nextInt();\n int y = in.nextInt();\n int z = in.nextInt();\n int x1 = in.nextInt();\n int y1 = in.nextInt();\n int z1 = in.nextInt();\n\n int a1 = in.nextInt();\n int a2 = in.nextInt();\n int a3 = in.nextInt();\n int a4 = in.nextInt();\n int a5 = in.nextInt();\n int a6 = in.nextInt();\n\n int sum = 0;\n if (y < 0) {\n sum += a1;\n }\n if (y > y1) {\n sum += a2;\n }\n if (z < 0) {\n sum += a3;\n }\n if (z > z1) {\n sum += a4;\n }\n if (x < 0) {\n sum += a5;\n }\n if (x > x1) {\n sum += a6;\n }\n out.println(sum);\n }\n\n }\n\n static class InputReader {\n private BufferedReader reader;\n private StringTokenizer stt;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream));\n }\n\n public String nextLine() {\n try {\n return reader.readLine();\n } catch (IOException e) {\n return null;\n }\n }\n\n public String next() {\n while (stt == null || !stt.hasMoreTokens()) {\n stt = new StringTokenizer(nextLine());\n }\n return stt.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["brute force", "geometry"], "code_uid": "812ce5ad17c171b25e60804fb159062d", "src_uid": "c7889a8f64c57cf7be4df870f68f749e", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\npublic class B {\n\n\tpublic static void main(String[] args) {\n\t\tInputReader in = new InputReader(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tB solver = new B();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\n\t}\n\n\tpublic void solve(int testNumber, InputReader in, PrintWriter out) {\n\n\t\tint n = in.nextInt();\n\t\tfloat t = in.nextInt();\n\t\t\n\t\tfloat[][] dp = new float[n + 1][n + 1];\n\t\t\n\t\tdp[0][0] = t;\n\t\tint count = 0;\n\t\t\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tfor(int j = 0; j <= i; j++) {\n\t\t\t\tfloat X = dp[i][j];\n\t\t\t\tif(X >= 1) {\n\t\t\t\t\tcount++;\n\t\t\t\t\t// dp[i][j] = 1;\n\t\t\t\t\tX -= 1;\n\t\t\t\t\tdp[i + 1][j] += X/2;\n\t\t\t\t\tdp[i + 1][j + 1] += X/2;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t}\n\t\t\n\t\tout.println(count);\n\t\t\n\t\t\n\t}\n\t\n\tstatic class InputReader {\n\t\tpublic BufferedReader reader;\n\t\tpublic StringTokenizer tokenizer;\n\n\t\tpublic InputReader(InputStream stream) {\n\t\t\treader = new BufferedReader(new InputStreamReader(stream), 32768);\n\t\t\ttokenizer = null;\n\t\t}\n\n\t\tpublic String next() {\n\t\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tokenizer.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "c036d226d8ae7ef559833e3dbf8db4dc", "src_uid": "b2b49b7f6e3279d435766085958fb69d", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class GuessTheTree {\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\tboolean eof;\n\n\tboolean solve() throws IOException {\n\t\tint n = nextInt();\n\t\tint initN = n;\n\t\tList<Integer> szList = new ArrayList<>();\n\t\tint leaves = 0;\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint x = nextInt();\n\t\t\tif (x == 1) {\n\t\t\t\tleaves++;\n\t\t\t} else {\n\t\t\t\tszList.add(x);\n\t\t\t}\n\t\t}\n\n\t\tn = szList.size();\n\n\t\tif (leaves <= n) {\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\tif (n == 0) {\n\t\t\treturn true;\n\t\t}\n\n\t\tCollections.sort(szList);\n\t\tCollections.reverse(szList);\n\n\t\tint[] sz = new int[n];\n\t\tfor (int i = 0; i < sz.length; i++) {\n\t\t\tsz[i] = szList.get(i);\n\t\t}\n\n\t\tif (sz[0] != initN) {\n\t\t\treturn false;\n\t\t}\n\n\t\tint[] maskCnt = new int[1 << n];\n\t\tint[] maskSum = new int[1 << n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tmaskCnt[1 << i] = 1;\n\t\t\tmaskSum[1 << i] = sz[i];\n\t\t}\n\n\t\tfor (int mask = 1; mask < (1 << n); mask++) {\n\t\t\tint low = Integer.lowestOneBit(mask);\n\t\t\tmaskCnt[mask] = maskCnt[low] + maskCnt[mask ^ low];\n\t\t\tmaskSum[mask] = maskSum[low] + maskSum[mask ^ low];\n\t\t}\n\n\t\tboolean[][][] dp = new boolean[n + 1][leaves + 1][1 << n];\n\t\t// current node, unassigned leaves, unassigned nodes\n\n\t\tfinal int ALL = (1 << n) - 1;\n\n\t\tdp[0][leaves][ALL ^ 1] = true;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j <= leaves; j++) {\n\t\t\t\tfor (int mask = 0; mask < (1 << n); mask++) {\n\t\t\t\t\tif (!dp[i][j][mask] || test(mask, i)) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tfor (int sub = mask; ; sub = (sub - 1) & mask) {\n\t\t\t\t\t\tint leavesHere = sz[i] - 1 - maskSum[sub];\n\t\t\t\t\t\tif (leavesHere >= 0 && leavesHere <= j\n\t\t\t\t\t\t\t\t&& leavesHere + maskCnt[sub] >= 2) {\n\t\t\t\t\t\t\tdp[i + 1][j - leavesHere][mask ^ sub] = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (sub == 0) {\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn dp[n][0][0];\n\n\t}\n\n\tstatic boolean test(int mask, int i) {\n\t\treturn ((mask >> i) & 1) == 1;\n\t}\n\n\tvoid inp() throws IOException {\n\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\tout.println(solve() ? \"YES\" : \"NO\");\n\t\tout.close();\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew GuessTheTree().inp();\n\t}\n\n\tString nextToken() {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (Exception e) {\n\t\t\t\teof = true;\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tString nextString() {\n\t\ttry {\n\t\t\treturn br.readLine();\n\t\t} catch (IOException e) {\n\t\t\teof = true;\n\t\t\treturn null;\n\t\t}\n\t}\n\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n}\n", "lang_cluster": "Java", "tags": ["constructive algorithms", "dp", "bitmasks", "greedy", "trees"], "code_uid": "26ca7bb1100db192134f90a2e50ab98c", "src_uid": "ed0925cfaee961a3ceebd13b3c96a15a", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "\n\nimport java.io.*;\n\n/**\n * Created by DELL on 14-Nov-15.1 0\n */\npublic class Hopscotch\n{\n public static void main(String ar[])\n {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n\n BufferedReader in = new BufferedReader(new InputStreamReader(inputStream));\n PrintWriter out = new PrintWriter(outputStream);\n\n Hopscotch demo = new Hopscotch();\n demo.solve(in, out);\n\n out.close();\n }\n\n public void solve(BufferedReader in, PrintWriter out)\n {\n try\n {\n String tokens[] = in.readLine().split(\" \");\n int side = Integer.parseInt(tokens[0]);\n int x = Integer.parseInt(tokens[1]);\n int y = Integer.parseInt(tokens[2]);\n out.println(taskB(side, x, y));\n } catch (IOException e)\n {\n e.printStackTrace();\n }\n }\n\n public long taskB(int side, int x, int y)\n {\n if (x == side || x == -side || y % side == 0)\n {\n return -1;\n }\n long yAbove = 0;\n long yBelow = 0;\n long iteration = 0;\n long stone = 0;\n while (true)\n {\n iteration++;\n stone = (iteration == 1 || iteration % 2 == 0) ? stone + 1 : stone + 2;\n yBelow = yAbove;\n yAbove += side;\n if ((y > yBelow && y < yAbove))\n {\n if (iteration == 1 || iteration % 2 == 0)\n {\n if (x < side / 2.0 && x > -side / 2.0)\n {\n return stone;\n }\n }\n else\n {\n if (x == 0)\n {\n return -1;\n }\n else if (x < side && x > 0)\n {\n return stone;\n }\n else if (x > -side && x < 0)\n {\n return stone - 1;\n }\n }\n }\n else if ((y < yBelow && y < yAbove) || y == yBelow || y == yAbove)\n {\n return -1;\n }\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "geometry"], "code_uid": "8a55c0610d3847b2b5f21fa570b69bea", "src_uid": "cf48ff6ba3e77ba5d4afccb8f775fb02", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner cin=new Scanner(System.in);\n\t\twhile(cin.hasNextInt()){\n\t\t\tBigInteger res1,res2,base,b1,b2;\n\t\t\tint n1,n2,i;\n\t\t\tBigInteger num1[]=new BigInteger[15];\n\t\t\tBigInteger num2[]=new BigInteger[15];\n\t\t\tn1=cin.nextInt();\n\t\t\tb1=cin.nextBigInteger();\n\t\t\tbase=new BigInteger(\"1\");\n\t\t\tres1=new BigInteger(\"0\");\n\t\t\tfor(i=0;i<n1;i++){\n\t\t\t\tnum1[i]=cin.nextBigInteger();\n\t\t\t}\n\t\t\tfor(i=n1-1;i>=0;i--){\n\t\t\t\tres1=res1.add(base.multiply(num1[i]));\n\t\t\t\tbase=base.multiply(b1);\n\t\t\t}\n\t\t\tn2=cin.nextInt();\n\t\t\tb2=cin.nextBigInteger();\n\t\t\tbase=new BigInteger(\"1\");\n\t\t\tres2=new BigInteger(\"0\");\n\t\t\tfor(i=0;i<n2;i++){\n\t\t\t\tnum2[i]=cin.nextBigInteger();\n\t\t\t}\n\t\t\tfor(i=n2-1;i>=0;i--){\n\t\t\t\tres2=res2.add(base.multiply(num2[i]));\n\t\t\t\tbase=base.multiply(b2);\n\t\t\t}\n\t\t\tif(res1.compareTo(res2)==0) System.out.println(\"=\");\n\t\t\telse if(res1.compareTo(res2)<0) System.out.println(\"<\");\n\t\t\telse System.out.println(\">\");\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "8a9c50ed52ff33efb367bac1d4342c8b", "src_uid": "d6ab5f75a7bee28f0af2bf168a0b2e67", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n \n public class Solution{\n \n public static void main(String args[]){\n \n Scanner sc = new Scanner(System.in);\n \n int n = sc.nextInt();\n String abc=sc.nextLine();\n String str = sc.nextLine();\n \n char ch[] = str.toCharArray();\n int arr[] = new int[ch.length];\n int vrr[] = new int[3];\n for(int i=0;i<ch.length;i++){\n \n \n if(ch[i]=='B'){\n \n arr[i] = 1;\n vrr[arr[i]-1]++;\n }\n \n if(ch[i]=='R') {\n \t\n \tarr[i] = 3;vrr[arr[i]-1]++;\n }\n \n \n if(ch[i]=='G') {\n \t\n \tarr[i] = 2;vrr[arr[i]-1]++;\n }\n \n \n }\n \n if(n!=1){\n \n int c[] = new int[3];\n \n Arrays.fill(c,0);\n int sum=0 , f=0;\n \n \n \n \n for(int i=0;i<ch.length;i++){\n \n for(int j=0;j<ch.length;j++){\n \n sum = 0;\n if(i==j) {\n \tcontinue;\n }\n \n if(i!=j){\n \n sum = arr[j]^arr[i];\n // System.out.println(\"xor is \"+sum);\n if(sum==0) {\n \t \n \t c[arr[i]-1]++;\n \t \n \t // System.out.println(\" c[\"+(arr[i]-1)+\"] is \"+c[arr[i]-1]); \n \t \n }\n else {\n c[sum-1]++;\n \n // System.out.println(\" c[\"+(sum-1)+\"] is \"+c[sum-1]);\n }\n }\n \n \n if(c[0]>0 && c[1]>0 && c[2]>0) {\n \t\n \tf = 3;\n \tbreak;\n \t\n }\n }\n \n \n if((c[0]>0 && c[1]>0 && c[2]==0 ) || (c[0]==0 && c[1]>0 && c[2]>0 ) || (c[0]>0 && c[1]==0 && c[2]>0 ) ) {\n \t\n \tf = 2;\n \t\n \t\n }\n \n }\n \n int cc=0 ,mm=-1;;\n if(f==2) {\n \t \n \t if( vrr[0]>=2) {\n \t\t System.out.print(\"GR\");\n \t\t cc = -1;\n }\n \t \n \t \n \t if( vrr[1]>=2 && cc!=-1) {\n \t\t System.out.print(\"BR\"); \n \t\t cc=-1;\n }\n \t \n \t if( vrr[2]>=2 && cc!=-1) {\n \t\t System.out.print(\"BG\");\n }\n \t \n \t mm=0; \n }\n \n if(mm==-1) {\n \n \n for(int i=0;i<3;i++) {\n \t \n \t \n \t if(c[i]>0 && i==0) {\n \t\t System.out.print(\"B\");\n \t }\n \t \n \t if(c[i]>0 && i==1) {\n \t\t System.out.print(\"G\");\n \t }\n \n \t if(c[i]>0 && i==2) {\n \t\t System.out.print(\"R\");\n \t }\n \n \n }\n \n \n \n }\n \n \n \n }\n else{\n System.out.println(str);\n }\n \n \n }\n}", "lang_cluster": "Java", "tags": ["math", "dp", "constructive algorithms"], "code_uid": "648ceffeace3624a9a17605828f60b32", "src_uid": "4cedd3b70d793bc8ed4a93fc5a827f8f", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class E_1228 {\n\n static int n;\n static long k;\n static long[][] dp;\n static long[] kPow;\n static long[] k1Pow;\n static long[][] C;\n static long mod = (long) (1e9 + 7);\n\n static void prec() {\n kPow = new long[n + 1];\n k1Pow = new long[n + 1];\n kPow[0] = 1;\n k1Pow[0] = 1;\n for (int i = 1; i <= n; i++) {\n kPow[i] = (kPow[i - 1] * k) % mod;\n k1Pow[i] = (k1Pow[i - 1] * (k - 1)) % mod;\n }\n\n C = new long[n + 1][n + 1];\n C[0][0] = 1;\n for (int i = 1; i <= n; i++) {\n C[i][0] = C[i][i] = 1;\n for (int j = 1; j < i; j++) {\n C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod;\n }\n }\n }\n\n static long mod(long x) {\n x %= mod;\n if (x < 0) x += mod;\n return x;\n }\n\n static void solve(FastReader in, PrintWriter out) {\n n = in.nextInt();\n k = in.nextInt();\n\n prec();\n\n dp = new long[n + 1][n + 1];\n dp[0][0] = 1;\n for (int r = 1; r <= n; r++) {\n dp[r][0] = dp[r - 1][0] * mod(kPow[n] - k1Pow[n]) % mod;\n }\n for (int c = 1; c <= n; c++) {\n dp[1][c] = kPow[n - c];\n }\n\n for (int r = 2; r <= n; r++) {\n for (int c = 1; c <= n; c++) {\n dp[r][c] = k1Pow[c] * mod(kPow[n - c] - k1Pow[n - c]) % mod * dp[r - 1][c] % mod;\n for (int c0 = 1; c0 <= c; c0++) {\n dp[r][c] = (dp[r][c] + kPow[n - c] * C[c][c0] % mod * k1Pow[c - c0] % mod * dp[r - 1][c - c0] % mod) % mod;\n }\n }\n }\n\n out.println(dp[n][n]);\n }\n\n public static void main(String[] args) {\n FastReader in = new FastReader(System.in);\n// FastReader in = new FastReader(new FileInputStream(\"input.txt\"));\n PrintWriter out = new PrintWriter(System.out);\n// PrintWriter out = new PrintWriter(new FileOutputStream(\"output.txt\"));\n\n\n int q = 1;\n\n while (q-- > 0)\n solve(in, out);\n\n out.close();\n }\n\n static class FastReader {\n BufferedReader br;\n StringTokenizer st;\n\n FastReader(InputStream is) {\n br = new BufferedReader(new InputStreamReader(is));\n }\n\n Integer nextInt() {\n return Integer.parseInt(next());\n }\n\n Long nextLong() {\n return Long.parseLong(next());\n }\n\n Double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(nextLine());\n }\n return st.nextToken();\n }\n\n String nextLine() {\n String s = \"\";\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return s;\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics"], "code_uid": "ee1747a61bf7f904d542a97e337192cd", "src_uid": "f67173c973c6f83e88bc0ddb0b9bfa93", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader; \nimport java.io.IOException; \nimport java.io.InputStreamReader; \nimport java.util.*; \nimport java.util.StringTokenizer; \nimport java.io.PrintWriter;\nimport java.io.*;\nimport java.lang.*;\npublic class Ideone\n{ \n static class FastReader \n { \n BufferedReader br; \n StringTokenizer st; \n \n public FastReader() \n { \n br = new BufferedReader(new\n InputStreamReader(System.in)); \n } \n \n String next() \n { \n while (st == null || !st.hasMoreElements()) \n { \n try\n { \n st = new StringTokenizer(br.readLine()); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n } \n return st.nextToken(); \n } \n \n int nextInt() \n { \n return Integer.parseInt(next()); \n } \n \n long nextLong() \n { \n return Long.parseLong(next()); \n } \n \n double nextDouble() \n { \n return Double.parseDouble(next()); \n } \n \n String nextLine() \n { \n String str = \"\"; \n try\n { \n str = br.readLine(); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n return str; \n } \n }\n static class aksh \n{\n \n int x, y;\n public aksh(int a, int b) \n {\n x = a;\n y = b;\n }\n}\nstatic long power(long x,long y) \n{ \n long res = 1; // Initialize result \n \n // Update x if it is more than or \n // equal to p \n \n while (y > 0) \n { \n // If y is odd, multiply x with result \n if (y%2==1) \n res = (res*x); \n \n // y must be even now \n y = y>>1; // y = y/2 \n x = (x*x); \n } \n return res; \n} \n\n public static void main (String[] args) throws java.lang.Exception\n {\n // your code goes here\n FastReader sc=new FastReader();\n String s=sc.next();\n String t=sc.next();\n int ans=Integer.MIN_VALUE;\n for(int i=0;i<s.length();i++)\n {\n for(int j=i;j<s.length();j++)\n {\n int pos=0;\n for(int k=0;k<s.length();k++)\n {\n if(i<=k && k<= j)\n continue;\n\n if(pos<t.length() && s.charAt(k)==t.charAt(pos))\n pos++;\n }\n\n if(pos==t.length())\n ans=Math.max(ans,j-i+1);\n }\n }\n System.out.println(Math.max(ans,0));\n\n\n }\n} ", "lang_cluster": "Java", "tags": ["greedy", "implementation"], "code_uid": "8418ac22c1974490ae3c5606478f732a", "src_uid": "0fd33e1bdfd6c91feb3bf00a2461603f", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\npublic class Main {\n public static long mod= (long) (1e9 +7);\n public static void main(String args[]){\n InputReader s= new InputReader(System.in);\n OutputStream outputStream= System.out;\n PrintWriter out= new PrintWriter(outputStream);\n int n= s.nextInt();\n //out.print(Integer.toString(123,16));\n int sum=0;\n for(int i=2;i<n;i++){\n int y=n;\n for(int j=0;;j++){\n int x= y%i;\n sum= sum+ x;\n y= y/i;\n if(y==0){\n break;\n }\n }\n //out.println(sum);\n }\n //out.println(sum);\n int div= gcd(sum,n-2);\n out.println((sum/div)+\"/\"+((n-2)/div));\n out.close();\n }\n public static int sumDigits(String x){\n int sum= 0;\n for(int i=0;i<x.length();i++){\n sum= sum+ x.charAt(i)-48;\n }\n return sum;\n \n }\n static class InputReader {\n\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n \n public InputReader(InputStream inputstream) {\n reader = new BufferedReader(new InputStreamReader(inputstream));\n tokenizer = null;\n }\n \n public String nextLine(){\n String fullLine=null;\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n fullLine=reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n return fullLine;\n }\n return fullLine;\n }\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n public long nextLong() {\n return Long.parseLong(next());\n }\n public int nextInt() {\n return Integer.parseInt(next());\n }\n }\n public static int gcd(int number1, int number2) { \n if(number2 == 0){\n return number1;\n } \n return gcd(number2, number1%number2); \n }\n public static int combinations(int n,int r){\n if(n==r) return 1;\n if(r==1) return n;\n if(r==0) return 1;\n return combinations(n-1,r)+ combinations(n-1,r-1);\n }\n\n public static int expo(int a, int b){\n if (b==1)\n return a;\n if (b==2)\n return a*a;\n\n if (b%2==0){\n return expo(expo(a,b/2),2);\n }\n else{\n return a*expo(expo(a,(b-1)/2),2);\n }\n }\n \n public static void sieve(int N){\n int arr[]= new int[N+1];\n for(int i=2;i<Math.sqrt(N);i++){\n if(arr[i]==0){\n for(int j= i*i;j<= N;j= j+i){\n arr[j]=1;\n }\n }\n }\n // All the i for which arr[i]==0 are prime numbers.\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "b96f7a949bf8e1fb9824686883f837f9", "src_uid": "1366732dddecba26db232d6ca8f35fdc", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class a617 {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint x = sc.nextInt();\n\t\tint steps = 0;\n\t\tif (x%5 == 0) {\n\t\t\tsteps += (int)Math.floor(x/5);\n\t\t}else{\n\t\t\tsteps += (int)Math.floor(x/5) + 1;\n\t\t}\n\t\tSystem.out.println(steps);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "5d3e6a941c08e113395a8312573077a8", "src_uid": "4b3d65b1b593829e92c852be213922b6", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Arrays;\nimport java.util.Scanner;\n\n/*\n1 2 1000\n\n2 2 1000\n\n5 3 1103\n\n999 99 1000000000\n\n */\n\npublic class d {\n\n\tstatic int n;\n\tstatic int k;\n\tstatic int m;\n\t\n\tstatic long[][] memo;\n\t\n\tpublic static void main(String[] args) \n\t{\n\t\tScanner in = new Scanner(System.in);\n\t\t\n\t\tn = in.nextInt();\n\t\tk = in.nextInt();\n\t\tm = in.nextInt();\n\t\tin.close();\n\t\t\n\t\tmemo = new long[n+1][k];\n\t\tfor(int curr = 0; curr < memo.length; ++curr)\n\t\t{\n\t\t\tArrays.fill(memo[curr], -1);\n\t\t}\n\t\t\n\t\tSystem.out.println(go(1, 0, 1));\n\t}\n\t\n\tstatic long go(int place, int mod, int tens)\n\t{\n\t\tif(place == n+1) return 0;\n\t\t\n\t\tif(memo[place][mod] != -1)\n\t\t\treturn memo[place][mod];\n\t\t\n\t\tlong ret = 0;\n\t\t\n\t\tfor(int curr = place == n?1:0; curr < 10; ++curr)\n\t\t{\n\t\t\tint nmod = (mod + curr*tens) %k;\n\t\t\t\n\t\t\tif(curr != 0 && nmod == 0)\n\t\t\t{\n\t\t\t\t//System.out.print(place +\" \" +curr +\" \" +mod +\" \");\n\t\t\t\tlong r = 1;\n\t\t\t\tfor(int loc = place+1; loc < n; ++loc)\n\t\t\t\t{\n\t\t\t\t\tr = (r*10)%m;\n\t\t\t\t}\n\t\t\t\tif(place != n)\n\t\t\t\t{\n\t\t\t\t\tr = (r*9)%m;\n\t\t\t\t}\n\t\t\t\t//System.out.println(r);\n\t\t\t\tret = (ret + r)%m;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tret = (ret + go(place+1, nmod, (tens*10)%k))%m;\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn memo[place][mod] = ret;\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dp", "implementation"], "code_uid": "72134c02ea0fdf85f5b5c1e00d08576e", "src_uid": "656bf8df1e79499aa2ab2c28712851f0", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Scanner;\n\n/**\n * http://codeforces.com/problemset/problem/465/A\n * \n */\npublic class A {\n\n public static void main(String[] args) {\n new A().doJob();\n }\n\n private void doJob() {\n try (Scanner scanner = new Scanner(System.in)) {\n int n = scanner.nextInt();\n char[] array = scanner.next().toCharArray();\n int count = 0;\n for (int i = 0; i < n; i++) {\n count++;\n if (array[i] == '0') {\n break;\n }\n }\n System.out.println(count);\n }\n }\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "85efe6ff1bd2789cd175e6cdf0c4f823", "src_uid": "54cb2e987f2cc06c02c7638ea879a1ab", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\n\n\npublic class CFProblemC {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner input = new Scanner(System.in);\n\t\tlong sum = input.nextLong();\n\t\tlong xOr = input.nextLong();\n\t\tlong xOrCpy = xOr;\n\t\tlong sumCpy = sum;\n\t\tlong[] xOrBool = new long[60];\n//\t\tlong[] xOrSum = new long[60];\n\t\tint a = 59;\n\t\twhile(xOr > 0){\n\t\t\txOrBool[a] = (xOr%2);\n\t\t\ta--;\n\t\t\txOr /= 2;\n\t\t}\n//\t\ta = 0;\n//\t\twhile(sum > 0){\n//\t\t\txOrSum[a] = (sum%2);\n//\t\t\ta++;\n//\t\t\tsum /= 2;\n//\t\t}\n\t\t\n\t\tlong decisions = 0;\n\t\t\n\t\tfor(int b = 0; b < 60; b++){\n//\t\t\tSystem.out.println(sum);\n\t\t\tif(xOrBool[b] == 1L){\n\t\t\t\tdecisions++;\n\t\t\t\tsum -= (long)(Math.pow(2, 59-b)+.5);\n\t\t\t}\n\t\t\telse{\n\t\t\t\tif(sum >= (long)(Math.pow(2, 60-b)+.5)){\n\t\t\t\t\tsum -= (long)(Math.pow(2, 60-b)+.5);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n//\t\tSystem.out.println(sum);\n\t\tint zeroValid = (xOrCpy == sumCpy)?2:0 ;\n\t\n\t\tif(sum == 0){\n\t\t\tSystem.out.println((long)(Math.pow(2L, decisions)+.5)-zeroValid);\n\t\t}\n\t\telse{\n\t\t\tSystem.out.println(0);\n\t\t}\n\t\t\n\t\t\n//\t\tfor(int b = 0; b < 60; b++){\n//\t\t\t\n//\t\t}\n\t\t\n\t\t\n\t\t\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["math", "dp"], "code_uid": "fdcf39b66f3de4a21ba1efa094aa4489", "src_uid": "18410980789b14c128dd6adfa501aea5", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/*\n * To change this license header, choose License Headers in Project Properties.\n * To change this template file, choose Tools | Templates\n * and open the template in the editor.\n */\n\n\n/**\n *\n * @author Centrino\n */\nimport java.util.*;\npublic class JavaCourse {\n\n /**\n * @param args the command line arguments\n */\n public static void main(String[] args) {\n Scanner sc = new Scanner (System.in);\n int x = sc.nextInt();\n int count =0; int z=0,c=0;\n int i,r=x;\n boolean f =true;\n while(Math.sqrt(x)==(int)Math.sqrt(x)&&x>1){\n x =(int) Math.sqrt(x);count++;\n } \n for ( i =(int) Math.sqrt(x); i>1; i--) {\n z = i*i;\n while(x%(z)==0){\n count++;\n x /= i;\n f=false;\n } \n } \n if(f)\n System.out.println(x+\" \"+(count)); \n else\n System.out.println(x+\" \"+(count+1)); \n }\n}\n", "lang_cluster": "Java", "tags": ["math", "greedy", "number theory"], "code_uid": "3b889652cc4ecc0abac12f07939f8afb", "src_uid": "212cda3d9d611cd45332bb10b80f0b56", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.UncheckedIOException;\nimport java.io.Closeable;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.math.BigInteger;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) throws Exception {\n Thread thread = new Thread(null, new TaskAdapter(), \"\", 1 << 29);\n thread.start();\n thread.join();\n }\n\n static class TaskAdapter implements Runnable {\n @Override\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastInput in = new FastInput(inputStream);\n FastOutput out = new FastOutput(outputStream);\n DRadioTowers solver = new DRadioTowers();\n solver.solve(1, in, out);\n out.close();\n }\n }\n\n static class DRadioTowers {\n int mod = 998244353;\n Combination comb = new Combination((int) 1e6, mod);\n CachedPow pow = new CachedPow(2, mod);\n\n public void solve(int testNumber, FastInput in, FastOutput out) {\n int n = in.ri();\n long prob = 0;\n for (int i = 1; i <= n; i++) {\n if ((n - i) % 2 != 0) {\n continue;\n }\n int m = (n - i) / 2;\n long way = comb.combination(m + i - 1, i - 1);\n prob += way * pow.inverse(n) % mod;\n }\n prob %= mod;\n out.println(prob);\n }\n\n }\n\n static class Combination implements IntCombination {\n final Factorial factorial;\n int modVal;\n\n public Combination(Factorial factorial) {\n this.factorial = factorial;\n this.modVal = factorial.getMod();\n }\n\n public Combination(int limit, int mod) {\n this(new Factorial(limit, mod));\n }\n\n public int combination(int m, int n) {\n if (n > m || n < 0) {\n return 0;\n }\n return (int) ((long) factorial.fact(m) * factorial.invFact(n) % modVal * factorial.invFact(m - n) % modVal);\n }\n\n }\n\n static class FastOutput implements AutoCloseable, Closeable, Appendable {\n private static final int THRESHOLD = 1 << 13;\n private final Writer os;\n private StringBuilder cache = new StringBuilder(THRESHOLD * 2);\n\n public FastOutput append(CharSequence csq) {\n cache.append(csq);\n return this;\n }\n\n public FastOutput append(CharSequence csq, int start, int end) {\n cache.append(csq, start, end);\n return this;\n }\n\n private void afterWrite() {\n if (cache.length() < THRESHOLD) {\n return;\n }\n flush();\n }\n\n public FastOutput(Writer os) {\n this.os = os;\n }\n\n public FastOutput(OutputStream os) {\n this(new OutputStreamWriter(os));\n }\n\n public FastOutput append(char c) {\n cache.append(c);\n afterWrite();\n return this;\n }\n\n public FastOutput append(long c) {\n cache.append(c);\n afterWrite();\n return this;\n }\n\n public FastOutput append(String c) {\n cache.append(c);\n afterWrite();\n return this;\n }\n\n public FastOutput println(long c) {\n return append(c).println();\n }\n\n public FastOutput println() {\n return append(System.lineSeparator());\n }\n\n public FastOutput flush() {\n try {\n os.append(cache);\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n return this;\n }\n\n public void close() {\n flush();\n try {\n os.close();\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n\n public String toString() {\n return cache.toString();\n }\n\n }\n\n static class FastInput {\n private final InputStream is;\n private byte[] buf = new byte[1 << 13];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastInput(InputStream is) {\n this.is = is;\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n bufLen = -1;\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public int ri() {\n return readInt();\n }\n\n public int readInt() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n }\n\n static class DigitUtils {\n private DigitUtils() {\n }\n\n public static int negate(int x, int mod) {\n return x == 0 ? 0 : mod - x;\n }\n\n }\n\n static class Factorial {\n int[] fact;\n int[] inv;\n int mod;\n\n public int getMod() {\n return mod;\n }\n\n public Factorial(int[] fact, int[] inv, int mod) {\n this.mod = mod;\n this.fact = fact;\n this.inv = inv;\n fact[0] = inv[0] = 1;\n int n = Math.min(fact.length, mod);\n for (int i = 1; i < n; i++) {\n fact[i] = i;\n fact[i] = (int) ((long) fact[i] * fact[i - 1] % mod);\n }\n inv[n - 1] = BigInteger.valueOf(fact[n - 1]).modInverse(BigInteger.valueOf(mod)).intValue();\n for (int i = n - 2; i >= 1; i--) {\n inv[i] = (int) ((long) inv[i + 1] * (i + 1) % mod);\n }\n }\n\n public Factorial(int limit, int mod) {\n this(new int[limit + 1], new int[limit + 1], mod);\n }\n\n public int fact(int n) {\n return fact[n];\n }\n\n public int invFact(int n) {\n return inv[n];\n }\n\n }\n\n static interface IntCombination {\n }\n\n static class CachedPow {\n private int[] first;\n private int[] second;\n private int mod;\n private int powMod;\n private static int step = 16;\n private static int limit = 1 << step;\n private static int mask = limit - 1;\n\n public CachedPow(int x, int mod) {\n this.mod = mod;\n this.powMod = mod - 1;\n first = new int[limit];\n second = new int[Integer.MAX_VALUE / limit + 1];\n first[0] = 1;\n for (int i = 1; i < first.length; i++) {\n first[i] = (int) ((long) x * first[i - 1] % mod);\n }\n second[0] = 1;\n long step = (long) x * first[first.length - 1] % mod;\n for (int i = 1; i < second.length; i++) {\n second[i] = (int) (second[i - 1] * step % mod);\n }\n }\n\n public int pow(int exp) {\n return (int) ((long) first[exp & mask] * second[exp >> step] % mod);\n }\n\n public int inverse(int exp) {\n return pow(DigitUtils.negate(exp, powMod));\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics"], "code_uid": "c67c91de1f7f5b4d09b8e0d672525d38", "src_uid": "cec37432956bb0a1ce62a0188fe2d805", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\n/**\n *\n * @author Antonio \"Teo\" Alurralde\n */\npublic class Main {\n public static void main(String[] args) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n int m = Integer.parseInt(br.readLine());\n int bs = n;\n int sum = 0;\n int max = 0;\n int a, min;\n while(n-->0) {\n a = Integer.parseInt(br.readLine());\n sum += a;\n max = Math.max(max, a);\n }\n min = Math.max((sum+m)/bs + ((sum+m)%bs>0?1:0), max);\n System.out.printf(\"%d %d\", min, max + m);\n }\n}\n", "lang_cluster": "Java", "tags": ["implementation", "binary search"], "code_uid": "067e7142d6221287c515c36188b6e4b1", "src_uid": "78f696bd954c9f0f9bb502e515d85a8d", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Scanner;\n\npublic class D {\n\tfinal long MOD = (long)(1e9+7);\n\tlong p,k;\n\tvoid readInput() throws NumberFormatException, IOException{\n\t\t//BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tScanner sc = new Scanner(System.in);\n\t\tp = sc.nextLong();\n\t\tk = sc.nextLong();\n\t}\n\t\n\tpublic static long powmod(long a, long x, long n){\n\t\tlong res = 1;\n\t\ta = a % n;\n\t\twhile(x>0){\n\t\t\tif ( x % 2 == 1)\n\t\t\t\tres = (res*a) %n;\n\t\t\ta = (a*a) %n;\n\t\t\tx = x >> 1;\n\t\t}\n\t\treturn res;\n\t}\t\n\t\n\tvoid solve(){\n\t\tlong ssol = 0;\n\t\tif (k==0)\n\t\t\tssol = powmod(p, p-1, MOD);\n\t\telse if (k==1)\n\t\t\tssol = powmod(p, p, MOD);\t\t\n\t\telse {\t\t\n\t\t\tint ord = 1;\n\t\t\tlong q = k;\n\t\t\twhile(q!=1)\n\t\t\t{\n\t\t\t\tq = (q*k) % p;\n\t\t\t\tif (q<0) q+= p;\n\t\t\t\tord++;\n\t\t\t}\n\t\t\tssol = powmod(p, (p-1)/ord, MOD);\t\t\n\t\t}\t\t\n\t\tSystem.out.println(ssol);\n\t}\n\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\t\tD a = new D();\n\t\ta.readInput();\n\t\ta.solve();\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["dsu", "math", "combinatorics", "number theory"], "code_uid": "6248d9acd8833a7509763376f19281dd", "src_uid": "580bf65af24fb7f08250ddbc4ca67e0e", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class Main {\n\tpublic static void main(String args[]) {new Main().run();}\n\n\tFastReader in = new FastReader();\n\tPrintWriter out = new PrintWriter(System.out);\n\tvoid run(){\n\t\twork();\n\t\tout.flush();\n\t}\n\tlong mod=1000000007;\n\tlong gcd(long a,long b) {\n\t\treturn b==0?a:gcd(b,a%b);\n\t}\n\tvoid work() {\n\t\tint n=in.nextInt();\n\t\tint m=in.nextInt();\n\t\tlong r1=2,r0=2;\n\t\tfor(int i=1;i<n;i++) {\n\t\t\tlong t=r1+r0;\n\t\t\tr0=r1;\n\t\t\tr1=t%mod;\n\t\t}\n\t\tlong c1=2,c0=2;\n\t\tfor(int i=1;i<m;i++) {\n\t\t\tlong t=c1+c0;\n\t\t\tc0=c1;\n\t\t\tc1=t%mod;\n\t\t}\n\t\tlong ret=(c1+r1-2)%mod;\n\t\tif(ret<0) {\n\t\t\tret+=mod;\n\t\t}\n\t\tout.println(ret);\n\t}\n\t\n\tprivate int find(int v,Node node,int l,int r) {\n\t\tif(l==r)return l;\n\t\tint m=(l+r)/2;\n\t\tif(node.lNode.cnt>=v) {\n\t\t\treturn find(v,node.lNode,l,m);\n\t\t}else {\n\t\t\treturn find(v-node.lNode.cnt,node.rNode,m+1,r);\n\t\t}\n\t}\n\tprivate void insert(int v, Node node, int l, int r) {\n\t\tnode.cnt++;\n\t\tif(l==r)return;\n\t\tif(node.lNode==null)node.lNode=new Node(0);\n\t\tif(node.rNode==null)node.rNode=new Node(0);\n\t\tint m=(l+r)/2;\n\t\tif(v<=m) {\n\t\t\tinsert(v,node.lNode,l,m);\n\t\t}else {\n\t\t\tinsert(v,node.rNode,m+1,r);\n\t\t}\n\t}\n\n\tclass Node{\n\t\tNode lNode;\n\t\tNode rNode;\n\t\tint cnt;\n\t\tNode(int c){\n\t\t\tcnt=c;\n\t\t}\n\t}\n}\n\n\n\nclass FastReader\n{\n\tBufferedReader br;\n\tStringTokenizer st;\n\n\tpublic FastReader()\n\t{\n\t\tbr=new BufferedReader(new InputStreamReader(System.in));\n\t}\n\n\tpublic String next() \n\t{\n\t\tif(st==null || !st.hasMoreElements())\n\t\t{\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tpublic int nextInt() \n\t{\n\t\treturn Integer.parseInt(next());\n\t}\n\n\tpublic long nextLong()\n\t{\n\t\treturn Long.parseLong(next());\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics"], "code_uid": "0acfe094a43f87a9b7fde790627e30aa", "src_uid": "0f1ab296cbe0952faa904f2bebe0567b", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\nimport java.io.*;\npublic class codeforces {\n public static void main(String[] args) throws Exception {\n Scanner in=new Scanner(System.in);\n int A=in.nextInt();\n int B=in.nextInt();\n int C=in.nextInt();\n int N=in.nextInt();\n int k=N-(A+B-C);\n if(k<1 || C>A || C>B)\n System.out.println(\"-1\");\n else{\n System.out.println(k);\n }\n \n in.close();\n return;\n }\n}\n\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "a15d3a9248cc01445c05def0e9e1826e", "src_uid": "959d56affbe2ff5dd999a7e8729f60ce", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.Scanner;\nimport java.util.StringTokenizer;\n\npublic class B {\n\tpublic static void main(String args[]) throws Exception{\n\t\tlong w = readLong();\n\t\tlong m = readLong();\n\t\tlong k = readLong();\n\t\tw /= k;\n\t\tlong ans = 0;\n\t\twhile(true){\n\t\t\tint s = Long.toString(m).length();\n\t\t\tlong numb = (long) Math.pow(10, s);\n\t\t\tlong a = numb-m;\n\t\t\tif(a*s < w){\n\t\t\t\tw -= a*s;\n\t\t\t\tm = numb;\n\t\t\t\tans += a;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tans+= (w/(s));\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\tstatic BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));\n\tstatic StringTokenizer st = new StringTokenizer(\" \");\n\tstatic String readString() throws Exception{\n\t\twhile(!st.hasMoreTokens()){\n\t\t\tst = new StringTokenizer(stdin.readLine());\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\tstatic int readInt() throws Exception {\n\t\treturn Integer.parseInt(readString());\n\t}\n\tstatic long readLong() throws Exception {\n\t\treturn Long.parseLong(readString());\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation", "binary search"], "code_uid": "8bc886b7f36e5117a79a8e791aaec399", "src_uid": "8ef8a09e33d38a2d7f023316bc38b6ea", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/* package whatever; // don't place package name! */\n\nimport java.util.*;\nimport java.lang.*;\nimport java.io.*;\n\n/* Name of the class has to be \"Main\" only if the class is public. */\npublic class Ideone\n{ \n\tpublic static void main (String[] args) throws java.lang.Exception\n\t{\n\t\t// your code goes here\n\t\tMyScanner sc = new MyScanner();\n long n = sc.nextLong();\n long a = sc.nextLong();\n long b = sc.nextLong();\n long p = sc.nextLong();\n long q = sc.nextLong();\n long LCD = a * b / GCD(a, b);\n //System.out.println(a * b + \" \" + GCD(a,b));\n //System.out.println(LCD);\n long res = (n / a) * p + (n / b) * q;\n if (p > q){\n res -= q * (n / LCD);\n }else{\n res -= p * (n / LCD);\n }\n System.out.println(res);\n\t}\n\n public static long GCD(long a, long b){\n while (a > 0){\n long t = a;\n a = b % a;\n b = t;\n }\n return b;\n }\n\t //-----------PrintWriter for faster output---------------------------------\n public static PrintWriter out;\n \n //-----------MyScanner class for faster input----------\n public static class MyScanner {\n BufferedReader br;\n StringTokenizer st;\n \n public MyScanner() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n \n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n \n int nextInt() {\n return Integer.parseInt(next());\n }\n \n long nextLong() {\n return Long.parseLong(next());\n }\n \n double nextDouble() {\n return Double.parseDouble(next());\n }\n \n String nextLine(){\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n\n }\n}", "lang_cluster": "Java", "tags": ["math", "implementation", "number theory"], "code_uid": "846d27e72665be1d9bdbfe5e2bcf850a", "src_uid": "35d8a9f0d5b5ab22929ec050b55ec769", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n\npublic class Template implements Runnable {\n\n BufferedReader in;\n PrintWriter out;\n StringTokenizer tok = new StringTokenizer(\"\");\n\n void init() throws FileNotFoundException {\n try {\n in = new BufferedReader(new FileReader(\"input.txt\"));\n out = new PrintWriter(\"output.txt\");\n } catch (Exception e) {\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n }\n }\n\n String readString() throws IOException {\n while (!tok.hasMoreTokens()) {\n try {\n tok = new StringTokenizer(in.readLine(), \" :\");\n } catch (Exception e) {\n return null;\n }\n }\n return tok.nextToken();\n }\n\n int readInt() throws IOException {\n return Integer.parseInt(readString());\n }\n\n int[] readIntArray(int size) throws IOException {\n int[] res = new int[size];\n for (int i = 0; i < size; i++) {\n res[i] = readInt();\n }\n return res;\n }\n\n long readLong() throws IOException {\n return Long.parseLong(readString());\n }\n\n double readDouble() throws IOException {\n return Double.parseDouble(readString());\n }\n\n <T> List<T>[] createGraphList(int size) {\n List<T>[] list = new List[size];\n for (int i = 0; i < size; i++) {\n list[i] = new ArrayList<>();\n }\n return list;\n }\n\n public static void main(String[] args) {\n new Template().run();\n // new Thread(null, new Template(), \"\", 1l * 200 * 1024 * 1024).start();\n }\n\n long timeBegin, timeEnd;\n\n void time() {\n timeEnd = System.currentTimeMillis();\n System.err.println(\"Time = \" + (timeEnd - timeBegin));\n }\n\n long memoryTotal, memoryFree;\n\n void memory() {\n memoryFree = Runtime.getRuntime().freeMemory();\n System.err.println(\"Memory = \" + ((memoryTotal - memoryFree) >> 10)\n + \" KB\");\n }\n\n public void run() {\n try {\n timeBegin = System.currentTimeMillis();\n memoryTotal = Runtime.getRuntime().freeMemory();\n init();\n solve();\n out.close();\n if (System.getProperty(\"ONLINE_JUDGE\") == null) {\n time();\n memory();\n }\n } catch (Exception e) {\n e.printStackTrace();\n System.exit(-1);\n }\n }\n\n void solve() throws IOException {\n int n = readInt();\n int m = readInt();\n int all = readInt();\n int k = readInt();\n boolean[][] alt = new boolean[n][m];\n while (all-- > 0) {\n alt[readInt() - 1][readInt() - 1] = true;\n }\n int ans = 0;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n for (int i1 = i; i1 < n; i1++) {\n for (int j1 = j; j1 < m; j1++) {\n int cnt = 0;\n for (int ii = i; ii <= i1; ii++) {\n for (int jj = j; jj <= j1; jj++) {\n if (alt[ii][jj]) cnt++;\n }\n }\n if (cnt >= k) {\n ans++;\n }\n }\n }\n }\n }\n out.println(ans);\n\n }\n\n\n}", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "a7e0d97402bb3683d88beef9d8dbbf11", "src_uid": "9c766881f6415e2f53fb43b61f8f40b4", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/**\n * @(#)Game.java\n *\n *\n * @author \n * @version 1.00 2016/8/24\n */\n\nimport java.util.Scanner;\npublic class Game {\n\tpublic static void main(String[] args){\n\t\tScanner mch = new Scanner(System.in);\n\t\tlong a = mch.nextLong();\n\t\ta = a%2;\n\t\tSystem.out.print(2-a);\n\t}\n \n \n \n}", "lang_cluster": "Java", "tags": ["math", "games"], "code_uid": "7ed0b7b2b8b473e8ca3659de58dfc189", "src_uid": "816ec4cd9736f3113333ef05405b8e81", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\npublic class JavaApplication2 {\n public static void main(String[] args) {\n char []a,s;\n Scanner f=new Scanner(System.in);\n String g;\n g=f.next();\n a=new char[g.length()];\n for(int i=0;i<g.length();i++)\n a[i]=g.charAt(i);\n s=new char[4];\n for(int i=0;i<4;i++)\n s[i]=a[i];\n int i=4;\n while(s[0]=='!')\n {s[0]=a[i];\n i+=4;}\n i=5;\n while(s[1]=='!')\n {s[1]=a[i];\n i+=4;}\n i=6;\n while(s[2]=='!')\n {s[2]=a[i];\n i+=4;}\n i=7;\n while(s[3]=='!')\n {s[3]=a[i];\n i+=4;} \n int k[]=new int[4];\n for(int x=0;x<4;x++)\n k[x]=0;\n for(i=0;i<g.length();i+=4)\n if(a[i]!=s[0]) \n k[0]++;\n for(i=1;i<g.length();i+=4)\n if(a[i]!=s[1]) \n k[1]++;\n for(i=2;i<g.length();i+=4)\n if(a[i]!=s[2]) \n k[2]++;\n for(i=3;i<g.length();i+=4)\n if(a[i]!=s[3]) \n k[3]++;\n \n for(i=0;i<4;i++)\n if(s[i]=='R')\n System.out.print(k[i]+\" \");\n for(i=0;i<4;i++)\n if(s[i]=='B')\n System.out.print(k[i]+\" \");\n for(i=0;i<4;i++)\n if(s[i]=='Y')\n System.out.print(k[i]+\" \");\n for(i=0;i<4;i++)\n if(s[i]=='G')\n System.out.print(k[i]); }\n \n \n}\n", "lang_cluster": "Java", "tags": ["brute force", "implementation", "number theory"], "code_uid": "04af77fc3a01933f6c24ec490f09aff3", "src_uid": "64fc6e9b458a9ece8ad70a8c72126b33", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class helloWorld \n{\n\tpublic static void main(String[] args) \n\t{\t\t\n\t\tScanner in = new Scanner(System.in);\n\t\tString str = in.next();\n\t\tint n = Integer.parseInt( str.substring(0, 2) );\n\t\tint m = Integer.parseInt( str.substring(3, 5) );\n\t\tint ans = 0;\n\n\t\t\n\t\tfor(int i = n; i < 24; i++) {\n\t\t\tint a = (i%10) * 10 + i/10;\n\t\t\tif(a < 60 && (i != n || a >= m)) {\n\t\t\t\tans = (i-n)*60 + a-m; \n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(n == 23 && m > 32)\n\t\t\tans = 60 - m;\n\t\t\n\t\tSystem.out.println(ans);\n\n\t\tin.close();\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "a4a7e785874e3a8ca6b2eb230b3c27ce", "src_uid": "3ad3b8b700f6f34b3a53fdb63af351a5", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class CodeForces {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint n = in.nextInt();\n\t\tif (n < 0) {\n\t\t\tn = -n;\n\t\t}\n\n\t\tint next = 1;\n\n\t\twhile (n > 0 || n % 2 == -1) {\n\t\t\tn -= next;\n\t\t\t++next;\n\t\t}\n\n\t\tSystem.out.println(next - 1);\n\t\tin.close();\n\t}\n}", "lang_cluster": "Java", "tags": ["math"], "code_uid": "f6f76fb1e4d000ab2cd670f44f370771", "src_uid": "18644c9df41b9960594fdca27f1d2fec", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.lang.reflect.Array;\nimport java.util.*;\n\npublic class Main implements Runnable {\n\n\n long m = (int)1e9+7;\n PrintWriter w;\n ArrayList<Integer> prime;\n boolean is_prime[];\n InputReader c;\n public void run() {\n c = new InputReader(System.in);\n w = new PrintWriter(System.out);\n\n int n = c.nextInt();\n int m = c.nextInt();\n\n int[] seq = scanArrayI(n);\n int[] fin = scanArrayI(m);\n \n for(int i = 0; i < n; i++){\n for(int j = 0; j < m; j++){\n if(seq[i] == fin[j]){\n w.print(fin[j] + \" \");\n }\n }\n }\n w.close();\n }\n\n private String removeSpaces(int[] a){\n\n StringBuffer s = new StringBuffer();\n\n for(int i = 0; i < 26; i++){\n\n s.append(a[i] + \"\");\n\n }\n return s.toString();\n }\n\n\n\n\n static long gcd(long a, long b) {\n if (b == 0)\n return a;\n return gcd(b, a % b);\n }\n void sieve(int n) {\n is_prime = new boolean[n+10];\n prime = new ArrayList<>();\n for(int i=2;i<=n;i++)\n is_prime[i] = true;\n\n for (int i = 2; i <= n; ++i) {\n if (is_prime[i]) prime.add(i);\n for (int j = 0; j < prime.size () && i * prime.get(j) < n; ++j) {\n is_prime[i * prime.get(j)] = false;\n if (i % prime.get(j) == 0) break;\n }\n }\n }\n public static void sortbyColumn(int arr[][], int col){\n Arrays.sort(arr, new Comparator<int[]>()\n {\n public int compare(int[] o1, int[] o2){\n return(Integer.valueOf(o1[col]).compareTo(o2[col]));\n }\n });\n\n }\n public static class DJSet {\n public int[] upper;\n\n public DJSet(int n) {\n upper = new int[n];\n Arrays.fill(upper, -1);\n }\n\n public int root(int x) {\n return upper[x] < 0 ? x : (upper[x] = root(upper[x]));\n }\n\n public boolean equiv(int x, int y) {\n return root(x) == root(y);\n }\n\n public boolean union(int x, int y) {\n x = root(x);\n y = root(y);\n if (x != y) {\n if (upper[y] < upper[x]) {\n int d = x;\n x = y;\n y = d;\n }\n upper[x] += upper[y];\n upper[y] = x;\n }\n return x == y;\n }\n }\n public static int[] radixSort(int[] f) {\n int[] to = new int[f.length];\n {\n int[] b = new int[65537];\n for(int i = 0;i < f.length;i++)b[1+(f[i]&0xffff)]++;\n for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];\n for(int i = 0;i < f.length;i++)to[b[f[i]&0xffff]++] = f[i];\n int[] d = f; f = to;to = d;\n }\n {\n int[] b = new int[65537];\n for(int i = 0;i < f.length;i++)b[1+(f[i]>>>16)]++;\n for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];\n for(int i = 0;i < f.length;i++)to[b[f[i]>>>16]++] = f[i];\n int[] d = f; f = to;to = d;\n }\n return f;\n }\n public void printArray(int[] a){\n for(int i=0;i<a.length;i++)\n w.print(a[i]+\" \");\n w.println();\n }\n public int[] scanArrayI(int n){\n int a[] = new int[n];\n for(int i=0;i<n;i++)\n a[i] = c.nextInt();\n return a;\n }\n public long[] scanArrayL(int n){\n long a[] = new long[n];\n for(int i=0;i<n;i++)\n a[i] = c.nextLong();\n return a;\n }\n public void printArray(long[] a){\n for(int i=0;i<a.length;i++)\n w.print(a[i]+\" \");\n w.println();\n }\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private SpaceCharFilter filter;\n private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars==-1)\n throw new InputMismatchException();\n\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n }\n catch (IOException e) {\n throw new InputMismatchException();\n }\n\n if(numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n }\n catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n public int nextInt() {\n int c = read();\n\n while(isSpaceChar(c))\n c = read();\n\n int sgn = 1;\n\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n\n int res = 0;\n do {\n if(c<'0'||c>'9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n\n return res * sgn;\n }\n\n public long nextLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public double nextDouble() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n\n public String readString() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n }\n while (!isSpaceChar(c));\n\n return res.toString();\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public String next() {\n return readString();\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n }\n public static void main(String args[]) throws Exception {\n new Thread(null, new Main(),\"Main\",1<<26).start();\n }\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "a1e1d88308ea08b7a3d29b500f46c96f", "src_uid": "f9044a4b4c3a0c2751217d9b31cd0c72", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.*;\nimport java.util.*;\nimport java.math.*;\nimport static java.lang.Math.*;\nimport static java.lang.Integer.parseInt;\nimport static java.lang.Long.parseLong;\nimport static java.lang.Double.parseDouble;\nimport static java.lang.String.*;\n \npublic class Main {\n \n public static void main(String[] args) throws IOException {\n BufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n StringBuilder out = new StringBuilder();\n StringTokenizer tk;\n \n String s = in.readLine();\n int x=101,y=101;\n int [][] v = new int[205][205];\n v[x][y] = 1;\n \n for(int i=0; i<s.length(); i++) {\n if(s.charAt(i)=='L') y--;\n else if(s.charAt(i)=='R') y++;\n else if(s.charAt(i)=='U') x++;\n else x--;\n \n if(v[x][y]!=0 || (v[x][y+1]!=0 && s.charAt(i)!='L') || (v[x][y-1]!=0 && s.charAt(i)!='R') || (v[x+1][y]!=0 && s.charAt(i)!='D') || (v[x-1][y]!=0 && s.charAt(i)!='U')) {\n //System.out.println(i+\" \"+v[x-1][y]+\" \"+x+\" , \"+y);\n System.out.println(\"BUG\");\n return;\n }\n v[x][y] = i+2;\n }\n \n if(((x+1==101 && y==101) || (x-1==101 && y==101) || (x==101 && y+1==101) || (x==101 && y-1==101)) && s.length()>1) System.out.println(\"BUG\");\n else System.out.println(\"OK\");\n }\n \n} \n", "lang_cluster": "Java", "tags": ["constructive algorithms", "implementation", "graphs"], "code_uid": "4d5dc4a33e8ed9f686a5eb8cb3b097dd", "src_uid": "bb7805cc9d1cc907b64371b209c564b3", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "\nimport java.util.*;\n\n\npublic class Main {\n\t\n\tstatic int[] dp=new int[20000];\n\tstatic int[][] grid=new int[4][4];\n\tstatic int same(int pos, int dir)\n\t{\n\t\tint cross=0, circle=0;\n\t\tif (dir==1)\n\t\t{\n\t\t\tfor (int i=0; i<3; i++)\n\t\t\t\tif (grid[pos][i]==0)\n\t\t\t\t\treturn 0;\n\t\t\t\telse if (grid[pos][i]==1)\n\t\t\t\t\tcross++;\n\t\t\t\telse \n\t\t\t\t\tcircle++;\n\t\t\tif (cross==3)\n\t\t\t\treturn 1;\n\t\t\tif (circle==3)\n\t\t\t\treturn 2;\n\t\t\treturn 0;\n\t\t}\n\t\telse if (dir==2)\n\t\t{\n\t\t\tfor (int i=0; i<3; i++)\n\t\t\t\tif (grid[i][pos]==0)\n\t\t\t\t\treturn 0;\n\t\t\t\telse if (grid[i][pos]==1)\n\t\t\t\t\tcross++;\n\t\t\t\telse \n\t\t\t\t\tcircle++;\n\t\t\tif (cross==3)\n\t\t\t\treturn 1;\n\t\t\tif (circle==3)\n\t\t\t\treturn 2;\n\t\t\treturn 0;\n\t\t}\n\t\telse if (dir==3)\n\t\t{\n\t\t\tfor (int i=0; i<3; i++)\n\t\t\t\tif (grid[i][i]==0)\n\t\t\t\t\treturn 0;\n\t\t\t\telse if (grid[i][i]==1)\n\t\t\t\t\tcross++;\n\t\t\t\telse \n\t\t\t\t\tcircle++;\n\t\t\tif (cross==3)\n\t\t\t\treturn 1;\n\t\t\tif (circle==3)\n\t\t\t\treturn 2;\n\t\t\treturn 0;\n\t\t}\n\t\telse if (dir==4)\n\t\t{\n\t\t\tfor (int i=0; i<3; i++)\n\t\t\t\tif (grid[i][2-i]==0)\n\t\t\t\t\treturn 0;\n\t\t\t\telse if (grid[i][2-i]==1)\n\t\t\t\t\tcross++;\n\t\t\t\telse \n\t\t\t\t\tcircle++;\n\t\t\tif (cross==3)\n\t\t\t\treturn 1;\n\t\t\tif (circle==3)\n\t\t\t\treturn 2;\n\t\t\treturn 0;\n\t\t}\n\t\treturn 0;\n\t}\n\tstatic int win()\n\t{\n\t\tfor (int i=0; i<3; i++)\n\t\t{\n\t\t\tint temp=same(i, 1);\n\t\t\tif (temp>0)\n\t\t\t\treturn temp;\n\t\t\ttemp=same(i, 2);\n\t\t\tif (temp>0)\n\t\t\t\treturn temp;\n\t\t}\n\t\tint temp=same(0, 3);\n\t\tif (temp>0)\n\t\t\treturn temp;\n\t\ttemp=same(0, 4);\n\t\tif (temp>0)\n\t\t\treturn temp;\n\t\treturn 0;\n\t}\n\t\n\tstatic void fill(int cnt, int next)\n\t{\n\t\tif (dp[cnt]>0)\n\t\t\treturn;\n\t\tint temp=win();\n\t\tif (temp>0)\n\t\t{\n\t\t\tdp[cnt]=temp+2;\n\t\t\treturn;\n\t\t}\n\t\telse\n\t\t\tdp[cnt]=next;\n\t\t/*\n\t\tif (cnt==7)\n\t\t\tSystem.out.println(cnt+\" \"+next);\n\t\t*/\n\t\tint flag=1;\n\t\tint tag=0;\n\t\tfor (int i=0; i<3; i++)\n\t\t\tfor (int j=0; j<3; j++)\n\t\t\t{\n\t\t\t\tif (grid[i][j]==0)\n\t\t\t\t{\n\t\t\t\t\tgrid[i][j]=next;\n\t\t\t\t\tfill(cnt+flag*next, 3-next);\n\t\t\t\t\tgrid[i][j]=0;\n\t\t\t\t\ttag=1;\n\t\t\t\t}\n\t\t\t\tflag*=3;\n\t\t\t}\n\t\tif (tag==0)\n\t\t\tdp[cnt]=5;\n\t\t\t\n\t}\n\t\n\tpublic static void main(String[] args)\n\t{\n\t\t\n\t\tScanner cin=new Scanner(System.in);\n\t\tString temp;\n\t\t\n\t\tfor (int i=0; i<3; i++)\n\t\t\tfor (int j=0; j<3; j++)\n\t\t\t\tgrid[i][j]=0;\n\t\tfill(0, 1);\n\t\t\n\t\tint flag=1, cnt=0;\n\t\tfor (int i=0; i<3; i++)\n\t\t{\n\t\t\ttemp=cin.next();\n\t\t\tfor (int j=0; j<3; j++)\n\t\t\t{\n\t\t\t\tif (temp.charAt(j)=='X')\n\t\t\t\t\tcnt+=flag;\n\t\t\t\telse if (temp.charAt(j)=='0')\n\t\t\t\t\tcnt+=2*flag;\n\t\t\t\tflag*=3;\n\t\t\t}\n\t\t}\n\t//\tSystem.out.println(cnt);\n\t\tif (dp[cnt]==0)\n\t\t\tSystem.out.println(\"illegal\");\n\t\telse if (dp[cnt]==1)\n\t\t\tSystem.out.println(\"first\");\n\t\telse if (dp[cnt]==2)\n\t\t\tSystem.out.println(\"second\");\n\t\telse if (dp[cnt]==3)\n\t\t\tSystem.out.println(\"the first player won\");\n\t\telse if (dp[cnt]==4)\n\t\t\tSystem.out.println(\"the second player won\");\n\t\telse if (dp[cnt]==5)\n\t\t\tSystem.out.println(\"draw\");\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["brute force", "implementation", "games"], "code_uid": "c741a4455d90c7ba147bddcaee1e9f7e", "src_uid": "892680e26369325fb00d15543a96192c", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n CGourmetCat solver = new CGourmetCat();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class CGourmetCat {\n public void solve(int testNumber, InputReader sc, OutputWriter out) {\n long aa = sc.nextLong();\n long bb = sc.nextLong();\n long cc = sc.nextLong();\n long ans = 0;\n for (int i = 1; i <= 7; i++) {\n long x = aa / 3;\n long y = bb / 2;\n long z = cc / 2;\n long min = Math.min(Math.min(x, y), z);\n long div = min;\n long a = aa - div * 3;\n long b = bb - div * 2;\n long c = cc - div * 2;\n long day = (long) i;\n long spent = div * 7;\n long food = a + b + c;\n while (food > 0) {\n long curr = day % 7;\n if (curr == 0)\n curr = 7;\n if (curr == 1 || curr == 2 || curr == 5) {\n if (a == 0)\n break;\n a--;\n } else if (curr == 3 || curr == 7) {\n if (b == 0)\n break;\n b--;\n } else {\n if (c == 0)\n break;\n c--;\n }\n day++;\n spent++;\n food--;\n }\n if (spent > ans)\n ans = spent;\n }\n out.println(ans);\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void println(long i) {\n writer.println(i);\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public long nextLong() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "2662f251102ef4623d5b90eb5841ee92", "src_uid": "e17df52cc0615585e4f8f2d31d2daafb", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class comp {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint sum = 0;\n\t\tboolean flag1 = true;\n\t\tboolean flag2 = true;\n\t\tboolean flag3 = true;\n\t\tboolean flag4 = true;\n\t\tboolean flag5 = true;\n\t\tboolean flag6 = true;\n\t\tboolean flag7 = true;\n\t\tboolean flag8 = true;\n\n\t\tfor (int i = 0; i < 8; i++) {\n\n\t\t\tString s = sc.nextLine();\n\t\t\tboolean flag = true;\n\t\t\tfor (int k = 0; k < 8 && flag == true; k++) {\n\t\t\t\tif (s.charAt(k) != 'B') {\n\t\t\t\t\tflag = false;\n\t\t\t\t}\n\t\t\t\tif (s.charAt(k) == 'B' && k == 7) {\n\t\t\t\t\tsum++;\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\tfor (int j = 1; j <= 8; j++) {\n\t\t\t\tif (s.charAt((j - 1)) != 'B') {\n\t\t\t\t\tif (j == 1) {\n\t\t\t\t\t\tflag1 = false;\n\t\t\t\t\t} else if (j == 2) {\n\t\t\t\t\t\tflag2 = false;\n\t\t\t\t\t} else if (j == 3) {\n\t\t\t\t\t\tflag3 = false;\n\t\t\t\t\t} else if (j == 4) {\n\t\t\t\t\t\tflag4 = false;\n\t\t\t\t\t} else if (j == 5) {\n\t\t\t\t\t\tflag5 = false;\n\t\t\t\t\t} else if (j == 6) {\n\t\t\t\t\t\tflag6 = false;\n\t\t\t\t\t} else if (j == 7) {\n\t\t\t\t\t\tflag7 = false;\n\t\t\t\t\t} else if (j == 8) {\n\t\t\t\t\t\tflag8 = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\t\tif (flag1 == true) {\n\t\t\tsum++;\n\t\t}\n\t\tif (flag2 == true) {\n\t\t\tsum++;\n\t\t}\n\t\tif (flag3 == true) {\n\t\t\tsum++;\n\t\t}\n\t\tif (flag4 == true) {\n\t\t\tsum++;\n\t\t}\n\n\t\tif (flag5 == true) {\n\t\t\tsum++;\n\t\t}\n\t\tif (flag6 == true) {\n\t\t\tsum++;\n\t\t}\n\t\tif (flag7 == true) {\n\t\t\tsum++;\n\t\t}\n\t\tif (flag8 == true) {\n\t\t\tsum++;\n\t\t}\n\t\tif (sum == 16) {\n\t\t\tSystem.out.println(8);\n\t\t} else {\n\t\t\tSystem.out.println(sum);\n\t\t}\n\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms"], "code_uid": "df0d036dfee972fb96adf5362c2a187e", "src_uid": "8b6ae2190413b23f47e2958a7d4e7bc0", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\nimport java.lang.*;\npublic class Main\n{\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t String s = sc.next();\n\t int n = s.length();\n\t int c1 = 0;\n\t int c2 = 0;\n\t char c[] = s.toCharArray();\n\t for(int i=0;i<n-1;i++){\n\t if(c[i]=='V'&&c[i+1]=='K'){\n\t c1++;\n\t c[i]='a';\n\t c[i+1]='b';\n\t i++;\n\t }\n\t }\n\t for(int i=0;i<n-1;i++){\n\t if((c[i]=='V'&&c[i+1]=='V')||(c[i]=='K'&&c[i+1]=='K')){\n\t c2++;\n\t break;\n\t }\n\t }\n\t if(c2==0) System.out.println(c1);\n\t else System.out.println(c1+1);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force"], "code_uid": "880c8bf7607bc8fc75b331caba5a84ac", "src_uid": "578bae0fe6634882227ac371ebb38fc9", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Scanner;\n\npublic class Chess {\n\tstatic int[] shift = { -1, 2, 1, 2, -2, 1, 2, 1, -2, -1, 2, -1, 1, -2, -1,\n\t\t\t-2 };\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tboolean[][] board = new boolean[8][8];\n\t\tString rook = sc.next();\n\t\tint row = rook.charAt(0) - 'a';\n\t\tint col = rook.charAt(1) - '0' - 1;\n\t\tfor (int i = 0; i < 8; i++)\n\t\t\tboard[row][i] = true;\n\t\tfor (int i = 0; i < 8; i++)\n\t\t\tboard[i][col] = true;\n\n\t\tString knight = sc.next();\n\t\tint row1 = knight.charAt(0) - 'a';\n\t\tint col1 = knight.charAt(1) - '0' - 1;\n\t\tboard[row1][col1] = true;\n\t\tfor (int i = 0; i < shift.length - 1; i += 2) {\n\t\t\tint dx = row1 + shift[i];\n\t\t\tint dy = col1 + shift[i + 1];\n\t\t\tif (dx >= 0 && dx < 8 && dy < 8 && dy >= 0)\n\t\t\t\tboard[dx][dy] = true;\n\t\t}\n\t\tint counter = 0;\n\t\tfor (int i = 0; i < 8; i++)\n\t\t\tfor (int j = 0; j < 8; j++)\n\t\t\t\tif (!board[i][j] && check(board, i, j, row, col))\n\t\t\t\t\tcounter++;\n\n\t\tSystem.out.println(counter);\n\n\t}\n\n\tprivate static boolean check(boolean[][] board, int x, int y, int row,\n\t\t\tint col) {\n\t\tfor (int i = 0; i < shift.length - 1; i += 2) {\n\t\t\tint dx = x + shift[i];\n\t\t\tint dy = y + shift[i + 1];\n\t\t\tif (dx == row && dy == col)\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "implementation"], "code_uid": "2ceed1a18e0468554101eab98e6cc714", "src_uid": "073023c6b72ce923df2afd6130719cfc", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.lang.*;\nimport java.util.regex.*;\npublic class Myclass {\n\tstatic long a[]=new long [10000];\n\tstatic long power(long n,long m)\n\t{\n\t\tlong ans=1,x=2;\n\t\twhile(n>0)\n\t\t{\n\t\t\tif(n%2==1)\n\t\t\t{\n\t\t\t\tans=ans*x;\n\t\t\t\tn--;\n\t\t\t}\n\t\t\tif(x>m && n>0)\n\t\t\t\treturn -1;\n\t\t\t//System.out.println(ans);\n\t\t\tx=x*x;\n\t\t\tn/=2;\n\t\t}\n\t\t//System.out.println(ans);\n\t\treturn m%ans;\n\t}\n\tpublic static void main(String[] args) {\n\t\t\n\t\tInputReader in = new InputReader(System.in);\n\t\tPrintWriter pw = new PrintWriter(System.out);\n\t\tlong n=in.nextLong();\n\t\tlong m=in.nextLong();\n\t\tif(m/2<n)\n\t\t{\n\t\t\tpw.print(m);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tlong ans=power(n,m);\n\t\t\tif(ans==-1)\n\t\t\t\tpw.print(m);\n\t\t\telse\n\t\t\t\tpw.println(ans);\n\t\t}\n\t\tpw.flush();\n\t\tpw.close();\n\t\t\n\t\t\n\t\t\n\t}\n\t\tprivate static pair r(long l) {\n\t\t// TODO Auto-generated method stub\n\t\treturn null;\n\t}\n\t\tstatic class InputReader \n\t\t{\n\t\tprivate final InputStream stream;\n\t\tprivate final byte[] buf = new byte[8192];\n\t\tprivate int curChar, snumChars;\n\t\tprivate SpaceCharFilter filter;\n\n\t\tpublic InputReader(InputStream stream) \n\t\t{\n\t\t\tthis.stream = stream;\n\t\t}\n\t\tpublic int snext() \n\t\t{\n\t\t\tif (snumChars == -1)\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tif (curChar >= snumChars) \n\t\t\t{\n\t\t\t\tcurChar = 0;\n\t\t\t\ttry \n\t\t\t\t{\n\t\t\t\t\tsnumChars = stream.read(buf);\n\t\t\t\t} \n\t\t\t\tcatch (IOException e) \n\t\t\t\t{\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (snumChars <= 0)\n\t\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn buf[curChar++];\n\t\t}\n\n\t\tpublic int nextInt() \n\t {\n\t\t\tint c = snext();\n\t\t\twhile (isSpaceChar(c)) \n\t\t\t{\n\t\t\t\tc = snext();\n\t\t\t}\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-')\n\t\t {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = snext();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo \n\t\t\t{\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = snext();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res * sgn;\n\t\t}\n\n\t\tpublic long nextLong()\n\t {\n\t\t\tint c = snext();\n\t\t\twhile (isSpaceChar(c)) \n\t\t\t{\n\t\t\t\tc = snext();\n\t\t\t}\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-') \n\t\t\t{\n\t\t\t\tsgn = -1;\n\t\t\t\tc = snext();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo \n\t\t\t{\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = snext();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res * sgn;\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) \n\t\t{\n\t\t\tint a[] = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) \n\t\t\t{\n\t\t\t\ta[i] = nextInt();\n\t\t\t}\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic String readString()\n\t {\n\t\t\tint c = snext();\n\t\t\twhile (isSpaceChar(c)) \n\t\t\t{\n\t\t\t\tc = snext();\n\t\t\t}\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo \n\t\t\t{\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = snext();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tpublic String nextLine() \n\t\t{\n\t\t\tint c = snext();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = snext();\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo \n\t\t\t{\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = snext();\n\t\t\t} while (!isEndOfLine(c));\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tpublic boolean isSpaceChar(int c) \n\t\t{\n\t\t\tif (filter != null)\n\t\t\t\treturn filter.isSpaceChar(c);\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n\n\t\tprivate boolean isEndOfLine(int c) \n\t\t{\n\t\t\treturn c == '\\n' || c == '\\r' || c == -1;\n\t\t}\n\n\t\tpublic interface SpaceCharFilter\n\t {\n\t\t\tpublic boolean isSpaceChar(int ch);\n\t\t}\n\t}\n\t\tpublic static long mod = 1000000007;\n\t\tpublic static int d;\n\t\tpublic static int p;\n\t\tpublic static int q;\n\t\t\n\t\tpublic static int[] suffle(int[] a,Random gen)\n\t\t{\n\t\t\tint n = a.length;\n\t\t\tfor(int i=0;i<n;i++)\n\t\t\t{\n\t\t\t\tint ind = gen.nextInt(n-i)+i;\n\t\t\t\tint temp = a[ind];\n\t\t\t\ta[ind] = a[i];\n\t\t\t\ta[i] = temp;\n\t\t\t}\n\t\t\treturn a;\n\t\t}\n\t\t\n\t\tpublic static void swap(int a, int b){\n\t\t\tint temp = a;\n\t\t\ta = b;\n\t\t\tb = temp;\n\t\t}\n\t\t\n\t\tpublic static HashSet<Integer> primeFactorization(int n)\n\t\t{\n\t\t\tHashSet<Integer> a =new HashSet<Integer>();\n\t\t\tfor(int i=2;i*i<=n;i++)\n\t\t\t{\n\t\t\t\twhile(n%i==0)\n\t\t\t\t{\n\t\t\t\t\ta.add(i);\n\t\t\t\t\tn/=i;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(n!=1)\n\t\t\t\ta.add(n);\n\t\t\treturn a;\n\t\t}\n\t\t\n\t\tpublic static void sieve(boolean[] isPrime,int n)\n\t\t{\n\t\t\tfor(int i=1;i<n;i++)\n\t\t\t\tisPrime[i] = true;\n\t\t\t\n\t\t\tisPrime[0] = false;\n\t\t\tisPrime[1] = false;\n\t\t\t\n\t\t\tfor(int i=2;i*i<n;i++)\n\t\t\t{\n\t\t\t\tif(isPrime[i] == true)\n\t\t\t\t{\n\t\t\t\t\tfor(int j=(2*i);j<n;j+=i)\n\t\t\t\t\t\tisPrime[j] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tpublic static int GCD(int a,int b)\n\t\t{\n\t\t\tif(b==0)\n\t\t\t\treturn a;\n\t\t\telse\n\t\t\t\treturn GCD(b,a%b);\n\t\t}\n\t\t\n\t\tpublic static long GCD(long a,long b)\n\t\t{\n\t\t\tif(b==0)\n\t\t\t\treturn a;\n\t\t\telse\n\t\t\t\treturn GCD(b,a%b);\n\t\t}\n\t\t\n\t\tpublic static void extendedEuclid(int A,int B)\n\t\t{\n\t\t\tif(B==0)\n\t\t\t{\n\t\t\t\td = A;\n\t\t\t\tp = 1 ;\n\t\t\t\tq = 0;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\textendedEuclid(B, A%B);\n\t\t\t\tint temp = p;\n\t\t\t\tp = q;\n\t\t\t\tq = temp - (A/B)*q;\n\t\t\t}\n\t\t}\n\t\t\n\t\tpublic static long LCM(long a,long b)\n\t\t{\n\t\t\treturn (a*b)/GCD(a,b);\n\t\t}\n\t\t\n\t\tpublic static int LCM(int a,int b)\n\t\t{\n\t\t\treturn (a*b)/GCD(a,b);\n\t\t}\n\t\t\n\t\tpublic static int binaryExponentiation(int x,int n)\n\t\t{\n\t\t int result=1;\n\t\t while(n>0)\n\t\t {\n\t\t if(n % 2 ==1)\n\t\t result=result * x;\n\t\t x=x*x;\n\t\t n=n/2;\n\t\t }\n\t\t return result;\n\t\t}\n\t\t\n\t\tpublic static long binaryExponentiation(long x,long n)\n\t\t{\n\t\t long result=1;\n\t\t while(n>0)\n\t\t {\n\t\t if(n % 2 ==1)\n\t\t result=result * x;\n\t\t x=x*x;\n\t\t n=n/2;\n\t\t }\n\t\t return result;\n\t\t}\n\t\t\n\t\tpublic static int modularExponentiation(int x,int n,int M)\n\t\t{\n\t\t int result=1;\n\t\t while(n>0)\n\t\t {\n\t\t if(n % 2 ==1)\n\t\t result=(result * x)%M;\n\t\t x=(x*x)%M;\n\t\t n=n/2;\n\t\t }\n\t\t return result;\n\t\t}\n\t\t\n\t\tpublic static long modularExponentiation(long x,long n,long M)\n\t\t{\n\t\t long result=1;\n\t\t while(n>0)\n\t\t {\n\t\t if(n % 2 ==1)\n\t\t result=(result * x)%M;\n\t\t x=(x*x)%M;\n\t\t n=n/2;\n\t\t }\n\t\t return result;\n\t\t}\n\t\t\n\t\tpublic static int modInverse(int A,int M)\n\t\t{\n\t\t return modularExponentiation(A,M-2,M);\n\t\t}\n\t\t\n\t\tpublic static long modInverse(long A,long M)\n\t\t{\n\t\t return modularExponentiation(A,M-2,M);\n\t\t}\n\t\t\n\t\tpublic static boolean isPrime(int n)\n\t\t{\n\t\t \n\t\t if (n <= 1) return false;\n\t\t if (n <= 3) return true;\n\t\t \n\t\t if (n%2 == 0 || n%3 == 0) \n\t\t \treturn false;\n\t\t \n\t\t for (int i=5; i*i<=n; i=i+6)\n\t\t {\n\t\t if (n%i == 0 || n%(i+2) == 0)\n\t\t return false;\n\t\t }\n\t\t \n\t\t return true;\n\t\t}\n\t\t\n\t\tstatic class pair implements Comparable<pair>\n\t\t{\n\t\t\tLong x, y;\n\t\t\tpair(long x,long y)\n\t\t\t{\n\t\t\t\tthis.x=x;\n\t\t\t\tthis.y=y;\n\t\t\t}\n\t\t\t\n\t\t\tpublic int compareTo(pair o) {\n\t\t\t\tint result = x.compareTo(o.x);\n\t\t\t\tif(result==0)\n\t\t\t\t\tresult = y.compareTo(o.y);\n\t\t\t\t\n\t\t\t\treturn result;\n\t\t\t} \n\t\t\t\n\t\t\tpublic String toString()\n\t\t\t{\n\t\t\t\treturn x+\" \"+y;\n\t\t\t}\n\t\t\t\n\t\t\tpublic boolean equals(Object o)\n\t\t\t{\n\t\t\t\tif (o instanceof pair)\n\t\t\t {\n\t\t\t\t\tpair p = (pair)o;\n\t\t\t\t\treturn p.x == x && p.y == y ;\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\t\n\t\t\tpublic int hashCode()\n\t\t\t{\n\t\t\t\treturn new Long(x).hashCode()*31 + new Long(y).hashCode();\n\t\t\t}\n\t\t}\n}\n\t", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "46d13dc3f73579eadeab2bcae8b5dfcb", "src_uid": "c649052b549126e600691931b512022f", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Main {\n\tstatic class Reader\n {\n final private int BUFFER_SIZE = 1 << 16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n \n public Reader()\n {\n din = new DataInputStream(System.in);\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n \n public Reader(String file_name) throws IOException\n {\n din = new DataInputStream(new FileInputStream(file_name));\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n \n public String readLine() throws IOException\n {\n byte[] buf = new byte[64]; // line length\n int cnt = 0, c;\n while ((c = read()) != -1)\n {\n if (c == '\\n')\n break;\n buf[cnt++] = (byte) c;\n }\n return new String(buf, 0, cnt);\n }\n \n public int nextInt() throws IOException\n {\n int ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do\n {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n \n if (neg)\n return -ret;\n return ret;\n }\n \n public long nextLong() throws IOException\n {\n long ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n if (neg)\n return -ret;\n return ret;\n }\n \n public double nextDouble() throws IOException\n {\n double ret = 0, div = 1;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n \n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n \n if (c == '.')\n {\n while ((c = read()) >= '0' && c <= '9')\n {\n ret += (c - '0') / (div *= 10);\n }\n }\n \n if (neg)\n return -ret;\n return ret;\n }\n \n private void fillBuffer() throws IOException\n {\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1)\n buffer[0] = -1;\n }\n \n private byte read() throws IOException\n {\n if (bufferPointer == bytesRead)\n fillBuffer();\n return buffer[bufferPointer++];\n }\n \n public void close() throws IOException\n {\n if (din == null)\n return;\n din.close();\n }\n }\n\t\n\tstatic class time implements Comparable<time>{\n\t\tint l,r;\n\t\ttime(int x,int y){\n\t\t\tl=x;\n\t\t\tr=y;\n\t\t}\n\t\t@Override\n\t\tpublic int compareTo(time ob){\n\t\t\tint diff = this.l-ob.l;\n\t\t\tif(diff!=0)\n\t\t\t\treturn diff;\n\t\t\treturn this.r-ob.r;\n\t\t}\n\t}\n\tpublic static void main(String args[])throws IOException{\n\t\tReader in=new Reader();\n\t\tlong n=in.nextLong();\n\t\tlong m=in.nextLong();\n\t\tif(m>=n){\n\t\t\tSystem.out.println(n);\n\t\t\tSystem.exit(0);\n\t\t}\n\t\tn -= m;\n\t\tlong l = 0, r = (long)2e9;\n\t\twhile (l < r) {\n\t\t\tlong med = (l + r) / 2;\n\t\t\tlong val = med * (med+1) / 2;\n\t\t\tif (val >= n) {\n\t\t\t\tr = med;\n\t\t\t} else {\n\t\t\t\tl = med+1;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(l+m);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "binary search"], "code_uid": "a4ee1c4b9f3dfe95fe600e7a2628cc30", "src_uid": "3b585ea852ffc41034ef6804b6aebbd8", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\npublic class icpc\n{\n public static void main(String[] args) throws IOException\n {\n Reader in = new Reader();\n //BufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n long l = in.nextLong();\n long r = in.nextLong();\n System.out.println(giveAns(r) - giveAns(l - 1));\n }\n public static long giveAns(long x)\n {\n int numOfDigits = Long.toString(x).length();\n long ans = 0L;\n for (int i=2;i<numOfDigits;i++)\n ans += 9L * (long)Math.pow(10, i - 2);\n if (numOfDigits > 1)\n ans += 9;\n if (numOfDigits == 1)\n ans += x;\n else\n {\n int firstDigit = Long.toString(x).charAt(0) - '0';\n int lastDigit = Long.toString(x).charAt(numOfDigits - 1) - '0';\n ans += (firstDigit - 1) * (long)Math.pow(10, numOfDigits - 2);\n String s = Long.toString(x);\n for (int j=1;j<numOfDigits - 1;j++)\n {\n long val = 1L;\n int digit = s.charAt(j) - '0';\n val *= (1L * digit * (long)Math.pow(10, numOfDigits - j - 2));\n ans += val;\n }\n if (firstDigit <= lastDigit)\n ans++;\n }\n return ans;\n }\n}\nclass DSU\n{\n int[] parent;\n int[] size;\n //Pass number of total nodes as parameter to the constructor\n DSU(int n)\n {\n this.parent = new int[n];\n this.size = new int[n];\n Arrays.fill(parent, -1);\n }\n\n public void makeSet(int v)\n {\n parent[v] = v;\n size[v] = 1;\n }\n\n public int findSet(int v)\n {\n if (v == parent[v]) return v;\n return parent[v] = findSet(parent[v]);\n }\n\n public void unionSets(int a, int b)\n {\n a = findSet(a);\n b = findSet(b);\n if (a != b)\n {\n if (size[a] < size[b])\n {\n int temp = a;\n a = b;\n b = temp;\n }\n parent[b] = a;\n size[a] += size[b];\n }\n }\n}\nclass FastFourierTransform\n{\n private void fft(double[] a, double[] b, boolean invert)\n {\n int count = a.length;\n for (int i = 1, j = 0; i < count; i++)\n {\n int bit = count >> 1;\n for (; j >= bit; bit >>= 1)\n j -= bit;\n j += bit;\n if (i < j)\n {\n double temp = a[i];\n a[i] = a[j];\n a[j] = temp;\n temp = b[i];\n b[i] = b[j];\n b[j] = temp;\n }\n }\n for (int len = 2; len <= count; len <<= 1)\n {\n int halfLen = len >> 1;\n double angle = 2 * Math.PI / len;\n if (invert)\n angle = -angle;\n double wLenA = Math.cos(angle);\n double wLenB = Math.sin(angle);\n for (int i = 0; i < count; i += len)\n {\n double wA = 1;\n double wB = 0;\n for (int j = 0; j < halfLen; j++)\n {\n double uA = a[i + j];\n double uB = b[i + j];\n double vA = a[i + j + halfLen] * wA - b[i + j + halfLen] * wB;\n double vB = a[i + j + halfLen] * wB + b[i + j + halfLen] * wA;\n a[i + j] = uA + vA;\n b[i + j] = uB + vB;\n a[i + j + halfLen] = uA - vA;\n b[i + j + halfLen] = uB - vB;\n double nextWA = wA * wLenA - wB * wLenB;\n wB = wA * wLenB + wB * wLenA;\n wA = nextWA;\n }\n }\n }\n if (invert)\n {\n for (int i = 0; i < count; i++)\n {\n a[i] /= count;\n b[i] /= count;\n }\n }\n }\n\n public long[] multiply(long[] a, long[] b)\n {\n int resultSize = Integer.highestOneBit(Math.max(a.length, b.length) - 1) << 2;\n resultSize = Math.max(resultSize, 1);\n double[] aReal = new double[resultSize];\n double[] aImaginary = new double[resultSize];\n double[] bReal = new double[resultSize];\n double[] bImaginary = new double[resultSize];\n for (int i = 0; i < a.length; i++)\n aReal[i] = a[i];\n for (int i = 0; i < b.length; i++)\n bReal[i] = b[i];\n fft(aReal, aImaginary, false);\n fft(bReal, bImaginary, false);\n for (int i = 0; i < resultSize; i++)\n {\n double real = aReal[i] * bReal[i] - aImaginary[i] * bImaginary[i];\n aImaginary[i] = aImaginary[i] * bReal[i] + bImaginary[i] * aReal[i];\n aReal[i] = real;\n }\n fft(aReal, aImaginary, true);\n long[] result = new long[resultSize];\n for (int i = 0; i < resultSize; i++)\n result[i] = Math.round(aReal[i]);\n return result;\n }\n}\nclass NumberTheory\n{\n public boolean isPrime(long n)\n {\n if(n < 2)\n return false;\n for(long x = 2;x * x <= n;x++)\n {\n if(n % x == 0)\n return false;\n }\n return true;\n }\n public ArrayList<Long> primeFactorisation(long n)\n {\n ArrayList<Long> f = new ArrayList<>();\n for(long x=2;x * x <= n;x++)\n {\n while(n % x == 0)\n {\n f.add(x);\n n /= x;\n }\n }\n if(n > 1)\n f.add(n);\n return f;\n }\n public int[] sieveOfEratosthenes(int n)\n {\n //Returns an array with the smallest prime factor for each number and primes marked as 0\n int[] sieve = new int[n + 1];\n for(int x=2;x * x <= n;x++)\n {\n if(sieve[x] != 0)\n continue;\n for(int u=x*x;u<=n;u+=x)\n {\n if(sieve[u] == 0)\n {\n sieve[u] = x;\n }\n }\n }\n return sieve;\n }\n public long gcd(long a, long b)\n {\n if(b == 0)\n return a;\n return gcd(b, a % b);\n }\n public long phi(long n)\n {\n double result = n;\n\n for(long p=2;p*p<=n;p++)\n {\n if(n % p == 0)\n {\n while (n % p == 0)\n n /= p;\n result *= (1.0 - (1.0 / (double)p));\n }\n }\n if(n > 1)\n result *= (1.0 - (1.0 / (double)n));\n return (long)result;\n }\n public Name extendedEuclid(long a, long b)\n {\n if(b == 0)\n return new Name(a, 1, 0);\n Name n1 = extendedEuclid(b, a % b);\n Name n2 = new Name(n1.d, n1.y, n1.x - (long)Math.floor((double)a / b) * n1.y);\n return n2;\n }\n public long modularExponentiation(long a, long b, long n)\n {\n long d = 1L;\n String bString = Long.toBinaryString(b);\n for(int i=0;i<bString.length();i++)\n {\n d = (d * d) % n;\n if(bString.charAt(i) == '1')\n d = (d * a) % n;\n }\n return d;\n }\n}\nclass Name\n{\n long d;\n long x;\n long y;\n\n public Name(long d, long x, long y)\n {\n this.d = d;\n this.x = x;\n this.y = y;\n }\n}\nclass SuffixArray\n{\n int ALPHABET_SZ = 256, N;\n int[] T, lcp, sa, sa2, rank, tmp, c;\n\n public SuffixArray(String str)\n {\n this(toIntArray(str));\n }\n\n private static int[] toIntArray(String s)\n {\n int[] text = new int[s.length()];\n for (int i = 0; i < s.length(); i++) text[i] = s.charAt(i);\n return text;\n }\n\n public SuffixArray(int[] text)\n {\n T = text;\n N = text.length;\n sa = new int[N];\n sa2 = new int[N];\n rank = new int[N];\n c = new int[Math.max(ALPHABET_SZ, N)];\n construct();\n kasai();\n }\n\n private void construct()\n {\n int i, p, r;\n for (i = 0; i < N; ++i) c[rank[i] = T[i]]++;\n for (i = 1; i < ALPHABET_SZ; ++i) c[i] += c[i - 1];\n for (i = N - 1; i >= 0; --i) sa[--c[T[i]]] = i;\n for (p = 1; p < N; p <<= 1)\n {\n for (r = 0, i = N - p; i < N; ++i) sa2[r++] = i;\n for (i = 0; i < N; ++i) if (sa[i] >= p) sa2[r++] = sa[i] - p;\n Arrays.fill(c, 0, ALPHABET_SZ, 0);\n for (i = 0; i < N; ++i) c[rank[i]]++;\n for (i = 1; i < ALPHABET_SZ; ++i) c[i] += c[i - 1];\n for (i = N - 1; i >= 0; --i) sa[--c[rank[sa2[i]]]] = sa2[i];\n for (sa2[sa[0]] = r = 0, i = 1; i < N; ++i)\n {\n if (!(rank[sa[i - 1]] == rank[sa[i]]\n && sa[i - 1] + p < N\n && sa[i] + p < N\n && rank[sa[i - 1] + p] == rank[sa[i] + p])) r++;\n sa2[sa[i]] = r;\n }\n tmp = rank;\n rank = sa2;\n sa2 = tmp;\n if (r == N - 1) break;\n ALPHABET_SZ = r + 1;\n }\n }\n\n private void kasai()\n {\n lcp = new int[N];\n int[] inv = new int[N];\n for (int i = 0; i < N; i++) inv[sa[i]] = i;\n for (int i = 0, len = 0; i < N; i++)\n {\n if (inv[i] > 0)\n {\n int k = sa[inv[i] - 1];\n while ((i + len < N) && (k + len < N) && T[i + len] == T[k + len]) len++;\n lcp[inv[i] - 1] = len;\n if (len > 0) len--;\n }\n }\n }\n}\nclass ZAlgorithm\n{\n public int[] calculateZ(char input[])\n {\n int Z[] = new int[input.length];\n int left = 0;\n int right = 0;\n for(int k = 1; k < input.length; k++) {\n if(k > right) {\n left = right = k;\n while(right < input.length && input[right] == input[right - left]) {\n right++;\n }\n Z[k] = right - left;\n right--;\n } else {\n //we are operating inside box\n int k1 = k - left;\n //if value does not stretches till right bound then just copy it.\n if(Z[k1] < right - k + 1) {\n Z[k] = Z[k1];\n } else { //otherwise try to see if there are more matches.\n left = k;\n while(right < input.length && input[right] == input[right - left]) {\n right++;\n }\n Z[k] = right - left;\n right--;\n }\n }\n }\n return Z;\n }\n public ArrayList<Integer> matchPattern(char text[], char pattern[])\n {\n char newString[] = new char[text.length + pattern.length + 1];\n int i = 0;\n for(char ch : pattern) {\n newString[i] = ch;\n i++;\n }\n newString[i] = '$';\n i++;\n for(char ch : text) {\n newString[i] = ch;\n i++;\n }\n ArrayList<Integer> result = new ArrayList<>();\n int Z[] = calculateZ(newString);\n\n for(i = 0; i < Z.length ; i++) {\n if(Z[i] == pattern.length) {\n result.add(i - pattern.length - 1);\n }\n }\n return result;\n }\n}\nclass KMPAlgorithm\n{\n public int[] computeTemporalArray(char[] pattern)\n {\n int[] lps = new int[pattern.length];\n\n int index = 0;\n for(int i=1;i<pattern.length;)\n {\n if(pattern[i] == pattern[index])\n {\n lps[i] = index + 1;\n index++;\n i++;\n }\n else\n {\n if(index != 0)\n {\n index = lps[index - 1];\n }\n else\n {\n lps[i] = 0;\n i++;\n }\n }\n }\n return lps;\n }\n\n public ArrayList<Integer> KMPMatcher(char[] text, char[] pattern)\n {\n int[] lps = computeTemporalArray(pattern);\n\n int j = 0;\n int i = 0;\n int n = text.length;\n int m = pattern.length;\n ArrayList<Integer> indices = new ArrayList<>();\n while(i < n)\n {\n if(pattern[j] == text[i])\n {\n i++;\n j++;\n }\n if(j == m)\n {\n indices.add(i - j);\n j = lps[j - 1];\n }\n else if(i < n && pattern[j] != text[i])\n {\n if(j != 0)\n j = lps[j - 1];\n else\n i = i + 1;\n }\n }\n return indices;\n }\n}\nclass Hashing\n{\n public long[] computePowers(long p, int n, long m)\n {\n long[] powers = new long[n];\n powers[0] = 1;\n for(int i=1;i<n;i++)\n {\n powers[i] = (powers[i - 1] * p) % m;\n }\n return powers;\n }\n public long computeHash(String s)\n {\n long p = 31;\n long m = 1_000_000_009;\n long hashValue = 0L;\n long[] powers = computePowers(p, s.length(), m);\n for(int i=0;i<s.length();i++)\n {\n char ch = s.charAt(i);\n hashValue = (hashValue + (ch - 'a' + 1) * powers[i]) % m;\n }\n return hashValue;\n }\n}\nclass BasicFunctions\n{\n public long min(long[] A)\n {\n long min = Long.MAX_VALUE;\n for(int i=0;i<A.length;i++)\n {\n min = Math.min(min, A[i]);\n }\n return min;\n }\n public long max(long[] A)\n {\n long max = Long.MAX_VALUE;\n for(int i=0;i<A.length;i++)\n {\n max = Math.max(max, A[i]);\n }\n return max;\n }\n}\nclass MergeSortInt\n{\n // Merges two subarrays of arr[].\n // First subarray is arr[l..m]\n // Second subarray is arr[m+1..r]\n void merge(int arr[], int l, int m, int r) {\n // Find sizes of two subarrays to be merged\n int n1 = m - l + 1;\n int n2 = r - m;\n\n /* Create temp arrays */\n int L[] = new int[n1];\n int R[] = new int[n2];\n\n /*Copy data to temp arrays*/\n for (int i = 0; i < n1; ++i)\n L[i] = arr[l + i];\n for (int j = 0; j < n2; ++j)\n R[j] = arr[m + 1 + j];\n\n\n /* Merge the temp arrays */\n\n // Initial indexes of first and second subarrays\n int i = 0, j = 0;\n\n // Initial index of merged subarry array\n int k = l;\n while (i < n1 && j < n2) {\n if (L[i] <= R[j]) {\n arr[k] = L[i];\n i++;\n } else {\n arr[k] = R[j];\n j++;\n }\n k++;\n }\n\n /* Copy remaining elements of L[] if any */\n while (i < n1) {\n arr[k] = L[i];\n i++;\n k++;\n }\n\n /* Copy remaining elements of R[] if any */\n while (j < n2) {\n arr[k] = R[j];\n j++;\n k++;\n }\n }\n\n // Main function that sorts arr[l..r] using\n // merge()\n void sort(int arr[], int l, int r) {\n if (l < r) {\n // Find the middle point\n int m = (l + r) / 2;\n\n // Sort first and second halves\n sort(arr, l, m);\n sort(arr, m + 1, r);\n\n // Merge the sorted halves\n merge(arr, l, m, r);\n }\n }\n\n}\nclass MergeSortLong\n{\n // Merges two subarrays of arr[].\n // First subarray is arr[l..m]\n // Second subarray is arr[m+1..r]\n void merge(long arr[], int l, int m, int r) {\n // Find sizes of two subarrays to be merged\n int n1 = m - l + 1;\n int n2 = r - m;\n\n /* Create temp arrays */\n long L[] = new long[n1];\n long R[] = new long[n2];\n\n /*Copy data to temp arrays*/\n for (int i = 0; i < n1; ++i)\n L[i] = arr[l + i];\n for (int j = 0; j < n2; ++j)\n R[j] = arr[m + 1 + j];\n\n\n /* Merge the temp arrays */\n\n // Initial indexes of first and second subarrays\n int i = 0, j = 0;\n\n // Initial index of merged subarry array\n int k = l;\n while (i < n1 && j < n2) {\n if (L[i] <= R[j]) {\n arr[k] = L[i];\n i++;\n } else {\n arr[k] = R[j];\n j++;\n }\n k++;\n }\n\n /* Copy remaining elements of L[] if any */\n while (i < n1) {\n arr[k] = L[i];\n i++;\n k++;\n }\n\n /* Copy remaining elements of R[] if any */\n while (j < n2) {\n arr[k] = R[j];\n j++;\n k++;\n }\n }\n\n // Main function that sorts arr[l..r] using\n // merge()\n void sort(long arr[], int l, int r) {\n if (l < r) {\n // Find the middle point\n int m = (l + r) / 2;\n\n // Sort first and second halves\n sort(arr, l, m);\n sort(arr, m + 1, r);\n\n // Merge the sorted halves\n merge(arr, l, m, r);\n }\n }\n}\nclass Node\n{\n\n int x;\n int y;\n\n public Node(int x, int y)\n {\n this.x = x;\n this.y = y;\n }\n\n @Override\n public boolean equals(Object ob)\n {\n if(ob == null)\n return false;\n if(!(ob instanceof Node))\n return false;\n if(ob == this)\n return true;\n Node obj = (Node)ob;\n if(this.x == obj.x && this.y == obj.y)\n return true;\n return false;\n }\n\n @Override\n public int hashCode()\n {\n return (int)this.x;\n }\n}\nclass Reader\n{\n final private int BUFFER_SIZE = 1 << 16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n\n public Reader()\n {\n din = new DataInputStream(System.in);\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public Reader(String file_name) throws IOException\n {\n din = new DataInputStream(new FileInputStream(file_name));\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public String readLine() throws IOException\n {\n byte[] buf = new byte[64]; // line length\n int cnt = 0, c;\n while ((c = read()) != -1)\n {\n if (c == '\\n')\n break;\n buf[cnt++] = (byte) c;\n }\n return new String(buf, 0, cnt);\n }\n\n public int nextInt() throws IOException\n {\n int ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do\n {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n\n if (neg)\n return -ret;\n return ret;\n }\n\n public long nextLong() throws IOException\n {\n long ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n if (neg)\n return -ret;\n return ret;\n }\n\n public double nextDouble() throws IOException\n {\n double ret = 0, div = 1;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n\n if (c == '.')\n {\n while ((c = read()) >= '0' && c <= '9')\n {\n ret += (c - '0') / (div *= 10);\n }\n }\n\n if (neg)\n return -ret;\n return ret;\n }\n\n private void fillBuffer() throws IOException\n {\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1)\n buffer[0] = -1;\n }\n\n private byte read() throws IOException\n {\n if (bufferPointer == bytesRead)\n fillBuffer();\n return buffer[bufferPointer++];\n }\n\n public void close() throws IOException\n {\n if (din == null)\n return;\n din.close();\n }\n}\nclass FenwickTree\n{\n public void update(long[] fenwickTree,long delta,int index)\n {\n index += 1;\n while(index < fenwickTree.length)\n {\n fenwickTree[index] += delta;\n index = index + (index & (-index));\n }\n }\n public long prefixSum(long[] fenwickTree,int index)\n {\n long sum = 0L;\n index += 1;\n while(index > 0)\n {\n sum += fenwickTree[index];\n index -= (index & (-index));\n }\n return sum;\n }\n}\nclass SegmentTree\n{\n public int nextPowerOfTwo(int num)\n {\n if(num == 0)\n return 1;\n if(num > 0 && (num & (num - 1)) == 0)\n return num;\n while((num &(num - 1)) > 0)\n {\n num = num & (num - 1);\n }\n return num << 1;\n }\n public int[] createSegmentTree(int[] input)\n {\n int np2 = nextPowerOfTwo(input.length);\n int[] segmentTree = new int[np2 * 2 - 1];\n\n for(int i=0;i<segmentTree.length;i++)\n segmentTree[i] = Integer.MIN_VALUE;\n\n constructSegmentTree(segmentTree,input,0,input.length-1,0);\n return segmentTree;\n\n }\n private void constructSegmentTree(int[] segmentTree,int[] input,int low,int high,int pos)\n {\n if(low == high)\n {\n segmentTree[pos] = input[low];\n return;\n }\n int mid = (low + high)/ 2;\n constructSegmentTree(segmentTree,input,low,mid,2*pos + 1);\n constructSegmentTree(segmentTree,input,mid+1,high,2*pos + 2);\n segmentTree[pos] = Math.max(segmentTree[2*pos + 1],segmentTree[2*pos + 2]);\n }\n public int rangeMinimumQuery(int []segmentTree,int qlow,int qhigh,int len)\n {\n return rangeMinimumQuery(segmentTree,0,len-1,qlow,qhigh,0);\n }\n private int rangeMinimumQuery(int segmentTree[],int low,int high,int qlow,int qhigh,int pos)\n {\n if(qlow <= low && qhigh >= high){\n return segmentTree[pos];\n }\n if(qlow > high || qhigh < low){\n return Integer.MIN_VALUE;\n }\n int mid = (low+high)/2;\n return Math.max(rangeMinimumQuery(segmentTree, low, mid, qlow, qhigh, 2 * pos + 1),\n rangeMinimumQuery(segmentTree, mid + 1, high, qlow, qhigh, 2 * pos + 2));\n }\n}\nclass Trie\n{\n\n private class TrieNode\n {\n Map<Character, TrieNode> children;\n boolean endOfWord;\n public TrieNode()\n {\n children = new HashMap<>();\n endOfWord = false;\n }\n }\n\n private final TrieNode root;\n public Trie()\n {\n root = new TrieNode();\n }\n\n public void insert(String word)\n {\n TrieNode current = root;\n for (int i = 0; i < word.length(); i++)\n {\n char ch = word.charAt(i);\n TrieNode node = current.children.get(ch);\n if (node == null)\n {\n node = new TrieNode();\n current.children.put(ch, node);\n }\n current = node;\n }\n current.endOfWord = true;\n }\n\n public boolean search(String word)\n {\n TrieNode current = root;\n for (int i = 0; i < word.length(); i++)\n {\n char ch = word.charAt(i);\n TrieNode node = current.children.get(ch);\n if (node == null)\n {\n return false;\n }\n current = node;\n }\n return current.endOfWord;\n }\n\n public void delete(String word)\n {\n delete(root, word, 0);\n }\n\n private boolean delete(TrieNode current, String word, int index)\n {\n if (index == word.length())\n {\n if (!current.endOfWord)\n {\n return false;\n }\n current.endOfWord = false;\n return current.children.size() == 0;\n }\n char ch = word.charAt(index);\n TrieNode node = current.children.get(ch);\n if (node == null)\n {\n return false;\n }\n boolean shouldDeleteCurrentNode = delete(node, word, index + 1);\n\n if (shouldDeleteCurrentNode)\n {\n current.children.remove(ch);\n return current.children.size() == 0;\n }\n return false;\n }\n}\nclass SegmentTreeLazy\n{\n public int nextPowerOfTwo(int num)\n {\n if(num == 0)\n return 1;\n if(num > 0 && (num & (num - 1)) == 0)\n return num;\n while((num &(num - 1)) > 0)\n {\n num = num & (num - 1);\n }\n return num << 1;\n }\n\n public int[] createSegmentTree(int input[])\n {\n int nextPowOfTwo = nextPowerOfTwo(input.length);\n int segmentTree[] = new int[nextPowOfTwo*2 -1];\n\n for(int i=0; i < segmentTree.length; i++){\n segmentTree[i] = Integer.MAX_VALUE;\n }\n constructMinSegmentTree(segmentTree, input, 0, input.length - 1, 0);\n return segmentTree;\n }\n\n private void constructMinSegmentTree(int segmentTree[], int input[], int low, int high,int pos)\n {\n if(low == high)\n {\n segmentTree[pos] = input[low];\n return;\n }\n int mid = (low + high)/2;\n constructMinSegmentTree(segmentTree, input, low, mid, 2 * pos + 1);\n constructMinSegmentTree(segmentTree, input, mid + 1, high, 2 * pos + 2);\n segmentTree[pos] = Math.min(segmentTree[2*pos+1], segmentTree[2*pos+2]);\n }\n\n public void updateSegmentTreeRangeLazy(int input[], int segmentTree[], int lazy[], int startRange, int endRange, int delta)\n {\n updateSegmentTreeRangeLazy(segmentTree, lazy, startRange, endRange, delta, 0, input.length - 1, 0);\n }\n\n private void updateSegmentTreeRangeLazy(int segmentTree[], int lazy[], int startRange, int endRange, int delta, int low, int high, int pos)\n {\n if(low > high)\n {\n return;\n }\n if (lazy[pos] != 0)\n {\n segmentTree[pos] += lazy[pos];\n if (low != high)\n {\n lazy[2 * pos + 1] += lazy[pos];\n lazy[2 * pos + 2] += lazy[pos];\n }\n lazy[pos] = 0;\n }\n\n if(startRange > high || endRange < low)\n {\n return;\n }\n\n if(startRange <= low && endRange >= high)\n {\n segmentTree[pos] += delta;\n if(low != high) {\n lazy[2*pos + 1] += delta;\n lazy[2*pos + 2] += delta;\n }\n return;\n }\n\n int mid = (low + high)/2;\n updateSegmentTreeRangeLazy(segmentTree, lazy, startRange, endRange, delta, low, mid, 2*pos+1);\n updateSegmentTreeRangeLazy(segmentTree, lazy, startRange, endRange, delta, mid+1, high, 2*pos+2);\n segmentTree[pos] = Math.min(segmentTree[2*pos + 1], segmentTree[2*pos + 2]);\n }\n\n public int rangeMinimumQueryLazy(int segmentTree[], int lazy[], int qlow, int qhigh, int len)\n {\n return rangeMinimumQueryLazy(segmentTree, lazy, qlow, qhigh, 0, len - 1, 0);\n }\n\n private int rangeMinimumQueryLazy(int segmentTree[], int lazy[], int qlow, int qhigh, int low, int high, int pos)\n {\n if(low > high)\n {\n return Integer.MAX_VALUE;\n }\n if (lazy[pos] != 0)\n {\n segmentTree[pos] += lazy[pos];\n if (low != high)\n {\n lazy[2 * pos + 1] += lazy[pos];\n lazy[2 * pos + 2] += lazy[pos];\n }\n lazy[pos] = 0;\n }\n\n if(qlow > high || qhigh < low)\n {\n return Integer.MAX_VALUE;\n }\n\n if(qlow <= low && qhigh >= high)\n {\n return segmentTree[pos];\n }\n\n int mid = (low+high)/2;\n return Math.min(rangeMinimumQueryLazy(segmentTree, lazy, qlow, qhigh, low, mid, 2 * pos + 1), rangeMinimumQueryLazy(segmentTree, lazy, qlow, qhigh, mid + 1, high, 2 * pos + 2));\n }\n}", "lang_cluster": "Java", "tags": ["binary search", "dp", "combinatorics"], "code_uid": "ff695da93888df1b821f8a34023f3dc1", "src_uid": "9642368dc4ffe2fc6fe6438c7406c1bd", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n long n = in.nl();\n long[] dp = new long[100000];\n dp[0] = 1;\n dp[1] = 2;\n for (int i = 1; ; ++i) {\n dp[i + 1] = dp[i] + dp[i - 1];\n if (dp[i + 1] > n) {\n out.println(i);\n return;\n }\n }\n }\n\n }\n\n static class InputReader {\n BufferedReader br;\n StringTokenizer st;\n\n public InputReader(InputStream inputStream) {\n br = new BufferedReader(new InputStreamReader(inputStream));\n }\n\n public String n() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n throw new RuntimeException();\n }\n }\n return st.nextToken();\n }\n\n public long nl() {\n return Long.parseLong(n());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "greedy", "constructive algorithms", "combinatorics"], "code_uid": "6a0d1eb9624df9d033a594c3f0734b5e", "src_uid": "3d3432b4f7c6a3b901161fa24b415b14", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.Scanner;\n\npublic class cake {\n\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner (System.in);\n\t\tint n = in.nextInt();\n\t\tint t = in.nextInt();\n\t\tint k = in.nextInt();\n\t\tint d = in.nextInt();\n\t\tint time1 = (d/t+1)*k;\n\t\tn = n - time1;\n\t\tif(n>0) {\n\t\t\tSystem.out.println(\"yes\");\n\t\t}else {\n\t\t\tSystem.out.println(\"no\");\n\t\t}\n\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "bd639825689eb16acb2f793ae7c84df7", "src_uid": "32c866d3d394e269724b4930df5e4407", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main\n{\n public static void main(String[] args) throws IOException\n {\n new Main().run();\n }\n\n StreamTokenizer in;\n PrintWriter out;\n\n int nextInt() throws IOException\n {\n in.nextToken();\n return (int)in.nval;\n }\n\n void run() throws IOException\n {\n in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));\n out = new PrintWriter(new OutputStreamWriter(System.out));\n solve();\n out.flush();\n }\n\n void solve() throws IOException\n {\n int n=6;\n int mas[]= new int[n];\n for (int i=0; i<n; i++){\n mas[i]=nextInt();\n }\n\n if ((mas[1]==0)&&(mas[0]==0)&&(mas[2]==0)&&(mas[3]==0)&&(mas[4]==0)&&(mas[5]==0)){\n out.print(\"Hermione\");\n return;\n }\n\n if (mas[3]==0){out.print(\"Hermione\"); return; }\n if (mas[2]==0){out.print(\"Ron\"); return; }\n if (mas[1]==0){out.print(\"Hermione\"); return; }\n if (mas[0]==0){out.print(\"Ron\"); return; }\n if (mas[5]==0){out.print(\"Hermione\"); return; }\n if (mas[4]==0){out.print(\"Ron\"); return; }\n \n \n if ((mas[0]!=0)&&(mas[1]!=0)&&(mas[2]!=0)&&(mas[3]!=0)&&(mas[4]!=0)&&(mas[5]!=0)){\n if (mas[0]*mas[2]*mas[4]>=mas[1]*mas[3]*mas[5]){\n out.print(\"Hermione\");\n }\n else{out.print(\"Ron\");}\n }\n }\n}", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "d26cc5733e7e67d4214d38e977b30a7d", "src_uid": "44d608de3e1447f89070e707ba550150", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\npublic class Solution {\n\n\tpublic static void print(int n)\n\t{\n\t\tif(n == 1)\n\t\t\tSystem.out.println('A');\n\t\telse if(n == 2)\n\t\t\tSystem.out.println('B');\n\t\telse if(n == 3)\n\t\t\tSystem.out.println('C');\n\t\telse\n\t\t\tSystem.out.println('D');\n\t}\n\tpublic static void main(String[] args) throws IOException{\n\t\t// TODO Auto-generated method stub\n\t\tString A, B, C, D;\n\t\tInputStreamReader reader = new InputStreamReader(System.in);\n\t\tBufferedReader input = new BufferedReader(reader);\n\t\tA = input.readLine();\n\t\tB = input.readLine();\n\t\tC = input.readLine();\n\t\tD = input.readLine();\n\t\tint a[] = new int[4];\n\t\ta[0] = A.length() - 2;\n\t\ta[1] = B.length() - 2;\n\t\ta[2] = C.length() - 2;\n\t\ta[3] = D.length() - 2;\n\t\tint temp;\n\t\tfor(int i = 0; i < 4; i++)\n\t\t\tfor(int j = i; j < 4; j++)\n\t\t\t\tif(a[i] > a[j])\n\t\t\t\t{\n\t\t\t\t\ttemp = a[i];\n\t\t\t\t\ta[i] = a[j];\n\t\t\t\t\ta[j] = temp;\n\t\t\t\t}\n//\t\tfor(int i = 0; i < 4; i++)\n//\t\t\tSystem.out.print(a[i]);\n\t\tif((a[0]*2 <= a[1] || a[2]*2 <= a[3]) && !(2*a[0] <= a[1] && 2*a[2] <= a[3]))\n\t\t{\n\t\t\tif(a[0]*2 > a[1])\n\t\t\t\ta[0] = a[3];\n\t\t\tif(A.length() - 2 == a[0])\n\t\t\t\tprint(1);\n\t\t\telse if(B.length()-2 == a[0])\n\t\t\t\tprint(2);\n\t\t\telse if(C.length() - 2== a[0])\n\t\t\t\tprint(3);\n\t\t\telse\n\t\t\t\tprint(4);\n\t\t\treturn;\n\t\t}\n\t\tprint(3);\n\t\t\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "48a4d982445e7db94556e9491112ef3e", "src_uid": "30725e340dc07f552f0cce359af226a4", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class Snowball_1099A {\n\tpublic static void main(String[] args) {\n\t\tScanner input = new Scanner(System.in);\n\t\tint w = input.nextInt(), h = input.nextInt();\n\t\tint u1 = input.nextInt(), d1 = input.nextInt();\n\t\tint u2 = input.nextInt(), d2 = input.nextInt();\n\t\tfor (int i = h; i > 0; i--) {\n\t\t\tw += i;\n\t\t\tif (i == d1)\n\t\t\t\tw -= u1;\n\t\t\telse if (i == d2)\n\t\t\t\tw -= u2;\n\t\t\tif (w < 0)\n\t\t\t\tw = 0;\n\t\t}\n\t\tSystem.out.println(w);\n\t\tinput.close();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "ebb30cb07b503ae9466a3d9661e379ab", "src_uid": "084a12eb3a708b43b880734f3ee51374", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "//package com.baba;\n\nimport java.util.Scanner;\n\npublic class Main {\n static char[] result = {'+', '-', '0', '?'};\n\n public static void main(String[] args) {\n Scanner s = new Scanner(System.in);\n int x = s.nextInt();\n int y = s.nextInt();\n int z = s.nextInt();\n System.out.println(result[solve(x + z, y) == solve(x, y + z) ? solve(x, y) : 3]);\n }\n\n static int solve(int x, int y) {\n return x == y ? 2 : x < y ? 1 : 0;\n }\n}", "lang_cluster": "Java", "tags": ["greedy"], "code_uid": "7eba2eec839d4dbd4f3f1c312ad2c12b", "src_uid": "66398694a4a142b4a4e709d059aca0fa", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\npublic class MainClass\n{\n public static void main(String[] args) throws IOException\n {\n Reader in = new Reader();\n long a = in.nextLong();\n long b = in.nextLong();\n boolean ff = true;\n ArrayList<Long> B = new ArrayList<>();\n B.add(b);\n while (b > a)\n {\n if (b % 2 == 0L)\n {\n b /= 2L;\n if (b < a)\n {\n ff = false;\n break;\n }\n B.add(b);\n }\n else if (b % 10 == 1L)\n {\n b = (b - 1L) / 10L;\n if (b < a)\n {\n ff = false;\n break;\n }\n else\n {\n B.add(b);\n }\n }\n else\n {\n ff = false;\n break;\n }\n }\n StringBuilder stringBuilder = new StringBuilder();\n if (ff)\n {\n Collections.reverse(B);\n stringBuilder.append(\"YES\\n\").append(B.size()).append(\"\\n\");\n for (long i: B) stringBuilder.append(i).append(\" \");\n }\n else\n stringBuilder.append(\"NO\\n\");\n System.out.println(stringBuilder);\n }\n}\nclass Reader\n{\n final private int BUFFER_SIZE = 1 << 16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n\n public Reader()\n {\n din = new DataInputStream(System.in);\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public Reader(String file_name) throws IOException\n {\n din = new DataInputStream(new FileInputStream(file_name));\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public String readLine() throws IOException\n {\n byte[] buf = new byte[64]; // line length\n int cnt = 0, c;\n while ((c = read()) != -1)\n {\n if (c == '\\n')\n break;\n buf[cnt++] = (byte) c;\n }\n return new String(buf, 0, cnt);\n }\n\n public int nextInt() throws IOException\n {\n int ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do\n {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n\n if (neg)\n return -ret;\n return ret;\n }\n\n public long nextLong() throws IOException\n {\n long ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n if (neg)\n return -ret;\n return ret;\n }\n\n public double nextDouble() throws IOException\n {\n double ret = 0, div = 1;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n\n if (c == '.')\n {\n while ((c = read()) >= '0' && c <= '9')\n {\n ret += (c - '0') / (div *= 10);\n }\n }\n\n if (neg)\n return -ret;\n return ret;\n }\n\n private void fillBuffer() throws IOException\n {\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1)\n buffer[0] = -1;\n }\n\n private byte read() throws IOException\n {\n if (bufferPointer == bytesRead)\n fillBuffer();\n return buffer[bufferPointer++];\n }\n\n public void close() throws IOException\n {\n if (din == null)\n return;\n din.close();\n }\n}", "lang_cluster": "Java", "tags": ["dfs and similar", "math", "brute force"], "code_uid": "1bbc3cbbc23bda94c31c861f3de2318b", "src_uid": "fc3adb1a9a7f1122b567b4d8afd7b3f3", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\n/**\n * Created by aksinha on 2/1/2017.\n */\npublic class Multiplication {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int a = in.nextInt();\n int b = in.nextInt();\n int c = in.nextInt();\n int a1 = in.nextInt();\n int b1 = in.nextInt();\n int c1 = in.nextInt();\n\n if (a1 == a){\n System.out.println(\"YES\");\n }\n else if (b1 == b){\n System.out.println(\"YES\");\n }\n else if (c1 == c){\n System.out.println(\"YES\");\n }\n else\n System.out.println(\"NO\");\n }\n}", "lang_cluster": "Java", "tags": ["math"], "code_uid": "7708c7bfa56647bebe2d2acc7c4b6d99", "src_uid": "91c9dbbceb467d5fd420e92c2919ecb6", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class TheNewYearMeetingFriends {\n \n public static void main(String[] args) {\n Scanner kbd = new Scanner(System.in);\n int a = kbd.nextInt();\n int b = kbd.nextInt();\n int c = kbd.nextInt();\n int min = Math.min(a, Math.min(b,c));\n int max = Math.max(a,Math.max(b,c));\n System.out.println(max-min);\n }\n}", "lang_cluster": "Java", "tags": ["math", "sortings", "implementation"], "code_uid": "bc1cd2abf77aefd1d3715f5fd0746baf", "src_uid": "7bffa6e8d2d21bbb3b7f4aec109b3319", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class LuckySubstring {\n\n public static void main(String[] args) throws NumberFormatException,\n IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n String num = br.readLine().trim();\n int count4 = 0, count7 = 0;\n if (num.substring(0, 1).equals(\"0\"))\n num = num.substring(1, num.length());\n for (int i = 0; i < num.length(); i++) {\n if (num.charAt(i) == '7')\n count7++;\n else if (num.charAt(i) == '4')\n count4++;\n }\n if (count4 == 0 && count7 == 0)\n System.out.println(-1);\n else if (count4 >= count7)\n System.out.println(4);\n else\n System.out.println(7);\n }\n\n}\n", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "d9557f2fe985bb24ca4ed59be31061dd", "src_uid": "639b8b8d0dc42df46b139f0aeb3a7a0a", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Scanner;\npublic class Main{\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner kb = new Scanner(System.in);\n\t\tint rows = kb.nextInt();\n\t\tint columns = kb.nextInt();\n\t\tkb.nextLine();\n\t\tint[][] distances = new int[rows * columns][rows * columns];\n\t\tfor (int i = 0; i < rows * columns; i++) {\n\t\t\tArrays.fill(distances[i], 10000);\n\t\t}\n\t\tfor (int i = 0; i < rows * columns; i++) {\n\t\t\tdistances[i][i] = 0;\n\t\t}\n\t\tString rowLine = kb.nextLine();\n\t\tchar[] rowLinesplit = rowLine.toCharArray();\n\t\tfor (int i = 0; i < rows; i++) {\n\t\t\tif (rowLinesplit[i] == '<') {\n\t\t\t\tfor (int j = columns - 1; j > 0; j --) {\n\t\t\t\t\tint from = i * columns + j;\n\t\t\t\t\tint to = i * columns + j - 1;\n\t\t\t\t\tdistances[from][to] = 1;\n\t\t\t\t}\n\t\t\t} else if (rowLinesplit[i] == '>') {\n\t\t\t\tfor (int j = 0; j < columns - 1; j++) {\n\t\t\t\t\tint from = i * columns + j;\n\t\t\t\t\tint to = i * columns + j + 1;\n\t\t\t\t\tdistances[from][to] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tString columnLine = kb.nextLine();\n\t\tchar[] columnLineSplit = columnLine.toCharArray();\n\t\tfor (int i = 0; i < columns; i++) {\n\t\t\tif (columnLineSplit[i] == 'v') {\n\t\t\t\tfor (int j = 0; j < rows - 1; j++) {\n\t\t\t\t\tint from = j * columns + i;\n\t\t\t\t\tint to = (j + 1) * columns + i;\n\t\t\t\t\tdistances[from][to] = 1;\n\t\t\t\t}\n\t\t\t} else if (columnLineSplit[i] == '^') {\n\t\t\t\tfor (int j = rows - 1; j > 0; j--) {\n\t\t\t\t\tint from = j * columns + i;\n\t\t\t\t\tint to = (j - 1) * columns + i;\n\t\t\t\t\tdistances[from][to] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor (int k = 0; k < rows * columns; k++) {\n\t\t\tfor (int i = 0; i < rows * columns; i++) {\n\t\t\t\tfor (int j = 0; j < rows * columns; j++) {\n\t\t\t\t\tdistances[i][j] = Math.min(distances[i][j], distances[i][k] + distances[k][j]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < rows * columns; i++) {\n\t\t\tfor (int j = 0; j < rows * columns; j++) {\n\t\t\t\tif (distances[i][j] == 10000) {\n\t\t\t\t\tSystem.out.println(\"NO\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(\"YES\");\n\t}\n\n}\n\n ", "lang_cluster": "Java", "tags": ["dfs and similar", "implementation", "graphs", "brute force"], "code_uid": "7991e2dc5559d7ae28f522dcd9b3393b", "src_uid": "eab5c84c9658eb32f5614cd2497541cf", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.math.BigDecimal;\nimport java.util.Scanner;\npublic class Test2 {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString in =sc.nextLine();\n\t\tBigDecimal x = new BigDecimal(in);\n\t\t//System.out.println(x);\n\t\tSystem.out.println(x.stripTrailingZeros().toPlainString());\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "strings", "implementation"], "code_uid": "7064510c092786810d63bfa60f4d38f8", "src_uid": "a79358099f08f3ec50c013d47d910eef", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package GeneralProblems;\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\npublic class PIERULES {\n\tstatic int [] elm;\n\tstatic int memo[][][];\n\tpublic static void dp(int idx, int turn) {\n\t\tif(idx==elm.length) {\n\t\t\tmemo[idx][turn][turn]=0;\n\t\t\tmemo[idx][turn][1-turn]=0;\n\t\t\treturn; \n\t\t}\n\t\tif(memo[idx][turn][0]!=-1)\n\t\t\treturn;\n\t\tdp(idx+1,turn);\n\t\tdp(idx+1,1-turn);\n\t\t//first case i leave it and give it to the other player\n\t\tint sc1 = memo[idx+1][turn][turn], sc2 = memo[idx+1][turn][1-turn]+elm[idx];\n\t\tint sc11 = memo[idx+1][1-turn][turn]+elm[idx], sc21 = memo[idx+1][1-turn][1-turn];\n\t\tif(sc1>sc11) {\n\t\t\tmemo[idx][turn][turn]= sc1;\n\t\t\tmemo[idx][turn][1-turn]=sc2;\n\t\t}else {\n\t\t\tmemo[idx][turn][turn]= sc11;\n\t\t\tmemo[idx][turn][1-turn]=sc21;\n\t\t}\t\n\t\t\n\t\t}\npublic static void main(String[] args) throws IOException{\n\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n\tint n = Integer.parseInt(in.readLine());\n\telm = new int[n];\n\tStringTokenizer st= new StringTokenizer(in.readLine());\n\tfor (int i = 0; i < elm.length; i++) {\n\t\telm[i]=Integer.parseInt(st.nextToken());\n\t}\n\tmemo =new int[n+1][2][2];\n\tfor (int i = 0; i < memo.length; i++) {\n\t\tfor (int j = 0; j < memo[0].length; j++) {\n\t\t\tArrays.fill(memo[i][j],-1);\n\t\t}\n\t}\n\tdp(0,0);\n\tSystem.out.println(memo[0][0][1]+\" \"+memo[0][0][0]);\n\t\n}\n}\n", "lang_cluster": "Java", "tags": ["dp", "games"], "code_uid": "4e24b13da9b2f8244f447c26b15395ab", "src_uid": "414540223db9d4cfcec6a973179a0216", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Scanner;\n\n\npublic class ProblemA {\n\n /**\n * @param args\n */\n public static void main(String[] args) {\n ProblemA problem = new ProblemA();\n problem.solve();\n }\n\n private void solve() {\n Scanner sc = new Scanner(System.in);\n String s1 = sc.next();\n String s2 = sc.next();\n String s3 = sc.next();\n if (win(s1, s2, s3)) {\n System.out.println(\"F\");\n } else if (win(s2, s1, s3)) {\n System.out.println(\"M\");\n } else if (win(s3, s1, s2)) {\n System.out.println(\"S\");\n } else {\n System.out.println(\"?\");\n }\n }\n\n private boolean win(String s1, String s2, String s3) {\n if (!s2.equals(s3)) {\n return false;\n }\n if (s1.equals(\"rock\") && s2.equals(\"scissors\")) {\n return true;\n }\n if (s1.equals(\"scissors\") && s2.equals(\"paper\")) {\n return true;\n }\n if (s1.equals(\"paper\") && s2.equals(\"rock\")) {\n return true;\n }\n return false;\n }\n\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "0acc24d33849c3f9fb36e9306d0e718d", "src_uid": "072c7d29a1b338609a72ab6b73988282", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskB solver = new TaskB();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\n\tstatic class TaskB {\n\t\tpublic void solve(int testNumber, InputReader in, PrintWriter out) {\n\t\t\tint n = in.nextInt();\n\t\t\tint k = in.nextInt();\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\ta[i] = i;\n\t\t\t}\n\t\t\tfor (int i = 0; i < Math.min(k, n / 2); i++) {\n\t\t\t\tint t = a[i];\n\t\t\t\ta[i] = a[n - 1 - i];\n\t\t\t\ta[n - 1 - i] = t;\n\t\t\t}\n\t\t\tlong res = inversions(a, 0, n);\n\t\t\tout.println(res);\n\t\t}\n\n\t\tstatic long inversions(int[] a, int low, int high) {\n\t\t\tif (high - low < 2)\n\t\t\t\treturn 0;\n\t\t\tint mid = (low + high) >>> 1;\n\t\t\tlong res = inversions(a, low, mid) + inversions(a, mid, high);\n\t\t\tint[] b = Arrays.copyOfRange(a, low, mid);\n\t\t\tfor (int i = low, j = mid, k = 0; k < b.length; i++)\n\t\t\t\tif (j == high || b[k] <= a[j]) {\n\t\t\t\t\ta[i] = b[k++];\n\t\t\t\t} else {\n\t\t\t\t\ta[i] = a[j++];\n\t\t\t\t\tres += b.length - k;\n\t\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t}\n\n\tstatic class InputReader {\n\t\tfinal InputStream is;\n\t\tfinal byte[] buf = new byte[1024];\n\t\tint pos;\n\t\tint size;\n\n\t\tpublic InputReader(InputStream is) {\n\t\t\tthis.is = is;\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\tint c = read();\n\t\t\twhile (isWhitespace(c))\n\t\t\t\tc = read();\n\t\t\tint sign = 1;\n\t\t\tif (c == '-') {\n\t\t\t\tsign = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = read();\n\t\t\t} while (!isWhitespace(c));\n\t\t\treturn res * sign;\n\t\t}\n\n\t\tint read() {\n\t\t\tif (size == -1)\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tif (pos >= size) {\n\t\t\t\tpos = 0;\n\t\t\t\ttry {\n\t\t\t\t\tsize = is.read(buf);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (size <= 0)\n\t\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn buf[pos++] & 255;\n\t\t}\n\n\t\tstatic boolean isWhitespace(int c) {\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n\n\t}\n}\n\n", "lang_cluster": "Java", "tags": ["math", "greedy"], "code_uid": "fcdc25ab163e698d147936528ea57358", "src_uid": "ea36ca0a3c336424d5b7e1b4c56947b0", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\n\npublic class Test{\n\n \n public static void main(String[] args) {\n \n int []a = new int[5];\n int sum=0;\n Scanner in = new Scanner(System.in);\n \n for(int i =0; i <5; i++)\n {\n a[i] = in.nextInt();\n sum = sum +a[i];\n }\n \n if (sum%5!=0||sum==0)\n System.out.println(\"-1\");\n else\n System.out.println(sum/5);\n \n }\n \n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "6798202740fdf5e4c512cb9c3b7c7116", "src_uid": "af1ec6a6fc1f2360506fc8a34e3dcd20", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class A\n{\n public static void main(String[] args)\n {\n Scanner scanner = new Scanner(System.in);\n int n = scanner.nextInt();\n if (n % 2 == 1) System.out.println(0);\n else System.out.println((int) Math.pow(2, n / 2));\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "dp"], "code_uid": "a0925c1fe0a95dfb9c2edb41f3b4ee64", "src_uid": "4b7ff467ed5907e32fd529fb39b708db", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// package PCS;\n\nimport java.util.Scanner;\n\npublic class RegularBracketSequence {\n public static void main(String[] args) {\n Scanner reader = new Scanner(System.in);\n \n int c1 = reader.nextInt();\n int c2 = reader.nextInt();\n int c3 = reader.nextInt();\n int c4 = reader.nextInt();\n System.out.println(((c3 < 1 || c1 > 0) && c1 == c4) ? \"1\" : \"0\");\n }\n}\n", "lang_cluster": "Java", "tags": ["greedy", "implementation"], "code_uid": "5f51555982731060111793deb985582d", "src_uid": "b99578086043537297d374dc01eeb6f8", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.lang.*;\nimport java.io.*;\nimport java.math.BigDecimal;\n\npublic class R136B {\n public static void main (String[] args) throws java.lang.Exception {\n InputReader in = new InputReader(System.in);\n PrintWriter w = new PrintWriter(System.out);\n int x = in.nextInt(), ans = 0;\n for (int i = 1; i <= Math.sqrt(x); i++) {\n if (x % i == 0) {\n if (hasCommon(x, i))\n ans++;\n if (x / i != i && hasCommon(x, x / i) )\n ans++;\n }\n }\n w.println(ans);\n\n\n\n w.close();\n }\n static boolean hasCommon(int x, int y) {\n HashSet<Integer> hs = new HashSet<>();\n while (x > 0) {\n hs.add(x % 10);\n x /= 10;\n }\n while (y > 0) {\n if (hs.contains(y % 10))\n return true;\n y /= 10;\n }\n return false;\n }\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1)\n throw new UnknownError();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new UnknownError();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public int peek() {\n if (numChars == -1)\n return -1;\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n return -1;\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar];\n }\n\n public void skip(int x) {\n while (x-- > 0)\n read();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public String nextString() {\n return next();\n }\n\n public String next() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuffer res = new StringBuffer();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n\n return res.toString();\n }\n\n public String nextLine() {\n StringBuffer buf = new StringBuffer();\n int c = read();\n while (c != '\\n' && c != -1) {\n if (c != '\\r')\n buf.appendCodePoint(c);\n c = read();\n }\n return buf.toString();\n }\n\n public double nextDouble() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n public int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = nextInt();\n return a;\n }\n public long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nextLong();\n return a;\n }\n public boolean hasNext() {\n int value;\n while (isSpaceChar(value = peek()) && value != -1)\n read();\n return value != -1;\n }\n\n private boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n }\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "11b0db0d1ba7119b2bd0a06d92919c1b", "src_uid": "ada94770281765f54ab264b4a1ef766e", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n\npublic class C\n{\n\tString line;\n\tStringTokenizer inputParser;\n\tBufferedReader is;\n\tFileInputStream fstream;\n\tDataInputStream in;\n\tString FInput=\"\";\n\t\n\t\n\tvoid openInput(String file)\n\t{\n\n\t\tif(file==null)is = new BufferedReader(new InputStreamReader(System.in));//stdin\n\t\telse\n\t\t{\n\t\t\ttry{\n\t\t\n\t\t\t\t\n\t\t\tfstream = new FileInputStream(file);\n\t\t\tin = new DataInputStream(fstream);\n\t\t\tis = new BufferedReader(new InputStreamReader(in));\n\t\t\t}catch(Exception e)\n\t\t\t{\n\t\t\t\tSystem.err.println(e);\n\t\t\t}\n\t\t}\n\n\t}\n\t\n\tvoid readNextLine()\n\t{\n\t\ttry {\n\t\t\tline = is.readLine();\n\t\t\tinputParser = new StringTokenizer(line, \" \");\n\t\t\t//System.err.println(\"Input: \" + line);\n\t\t} catch (IOException e) {\n\t\t\tSystem.err.println(\"Unexpected IO ERROR: \" + e);\n\t\t}\t\n\t\t\n\t}\n\t\n\tint NextInt()\n\t{\n\t\tString n = inputParser.nextToken();\n\t\tint val = Integer.parseInt(n);\n\t\t\n\t\t//System.out.println(\"I read this number: \" + val);\n\t\treturn val;\n\t}\n\t\n\tString NextString()\n\t{\n\t\tString n = inputParser.nextToken();\n\t\treturn n;\n\t}\n\t\n\tvoid closeInput()\n\t{\n\t\ttry {\n\t\t\tis.close();\n\t\t} catch (IOException e) {\n\t\t\tSystem.err.println(\"Unexpected IO ERROR: \" + e);\n\t\t}\n\t\t\t\n\t}\n\t\n\tpublic void readFInput()\n\t{\n\t\tfor(;;)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\treadNextLine();\n\t\t\t\tFInput+=line+\" \";\n\t\t\t}\n\t\t\tcatch(Exception e)\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tinputParser = new StringTokenizer(FInput, \" \");\n\t}\n\t\n\tlong NextLong()\n {\n String n = inputParser.nextToken();\n \n long val = Long.parseLong(n);\n \n return val;\n }\n\t\n\tpublic static void main(String [] argv)\n\t{\n\t\tString filePath=null;\n\t\tif(argv.length>0)filePath=argv[0];\n\t\tnew C(filePath);\n\t}\n\n\t\n\tpublic C(String inputFile)\n\t{\n\t\topenInput(inputFile);\n\t\t\n\t\treadNextLine();\n\t\tint x1=NextInt();\n\t\tint y1=NextInt();\n\t\tint r1=NextInt();\n\t\tint R1=NextInt();\n\t\treadNextLine();\n\t\tint x2=NextInt();\n\t\tint y2=NextInt();\n\t\tint r2=NextInt();\n\t\tint R2=NextInt();\n\t\t\n\t\tint ret=0;\n\t\tdouble d=Math.sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));\n\t\tif(r1<=d-r2&&r1<=d-R2||(r1>=d+r2&&r1>=d+R2)||(r1+d<=r2&&r1+d<=R2))ret++;\n\t\tif(R1<=d-r2&&R1<=d-R2||(R1>=d+r2&&R1>=d+R2)||(R1+d<=r2&&R1+d<=R2))ret++;\n\t\tif(r2<=d-r1&&r2<=d-R1||(r2>=d+r1&&r2>=d+R1)||(r2+d<=r1&&r2+d<=R1))ret++;\n\t\tif(R2<=d-r1&&R2<=d-R1||(R2>=d+r1&&R2>=d+R1)||(R2+d<=r1&&R2+d<=R1))ret++;\n\t\t\n\t\tSystem.out.println(ret);\n closeInput();\t\t\n\t}\n\n\n\n}\n\n", "lang_cluster": "Java", "tags": ["geometry"], "code_uid": "189be421a0f13065985b6d42ef38488f", "src_uid": "4c2865e4742a29460ca64860740b84f4", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/**\r\n * check out my youtube channel sh0rkyboy\r\n * https://tinyurl.com/zdxe2y4z\r\n * I do screencasts, solutions, and other fun stuff in the future\r\n */\r\n\r\nimport java.util.*;\r\nimport java.io.*;\r\nimport static java.lang.Math.min;\r\nimport static java.lang.Math.abs;\r\nimport static java.lang.Math.max;\r\npublic class EdA {\r\n\tstatic long[] mods = {1000000007, 998244353, 1000000009};\r\n\tstatic long mod = mods[1];\r\n\tpublic static MyScanner sc;\r\n public static PrintWriter out;\r\n static long[] fact;\r\n static long[] inv;\r\n static long[][] power;\r\n\tpublic static long inv(long n){\r\n\t\treturn power(n, mod-2);\r\n\t}\r\n\tpublic static void fact(int n){\r\n\t\tfact = new long[n+1];\r\n\t\tfact[0] = 1;\r\n\t\tfor(int j = 1;j<=n;j++){\r\n\t\t\tfact[j] = (fact[j-1]*(long)j)%mod; \r\n\t\t}\r\n\t}\r\n\tpublic static long binom(int n, int k){\r\n\t\tlong prod = fact[n];\r\n\t\tprod*=inv(fact[n-k]);\r\n\t\tprod%=mod;\r\n\t\tprod*=inv(fact[k]);\r\n\t\tprod%=mod;\r\n\t\treturn prod;\t\r\n\t}\r\n\tpublic static void main(String[] largewang) throws Exception{\r\n\t\t// TODO Auto-generated method stub\r\n \t\tsc = new MyScanner();\r\n \t\tout = new PrintWriter(System.out);\r\n \t\t\tint n = sc.nextInt();\r\n \t\t\tint x = sc.nextInt();\r\n \t\t\tlong[][] dp = new long[n+1][x+1];\r\n \t\t\tlong[][] binom = new long[501][501];\r\n \t\t\t\r\n \t\t\tpower = new long[501][501];\r\n \t\t\tfor(int j = 1;j<=500;j++){\r\n \t\t\t\tfor(int k = 0;k<=j;k++){\r\n \t\t\t\t\tpower[j][k] = power(j, k);\r\n \t\t\t\t}\r\n \t\t\t}\r\n \t\t\tfor(int j = 1;j<=x;j++)\r\n \t\t\t\tdp[1][j] = j;\r\n \t\t\tfact(500);\r\n \t\t\tfor(int j = 1;j<=500;j++){\r\n \t\t\t\tfor(int k = 0;k<=j;k++){\r\n \t\t\t\t\tbinom[j][k] = binom(j, k);\r\n \t\t\t\t}\r\n \t\t\t}\r\n \t\t\tfor(int j = 2;j<=n;j++){\r\n \t\t\t\tfor(int k = 1;k<=x;k++){\r\n \t\t\t\t\tfor(int l = 0;l<=j-1;l++){\r\n \t\t\t\t\t\tif (k >= j-1){\r\n \t\t\t\t\t\t\tlong prod = dp[j-l][k-(j-1)]*power[j-1][l];\r\n \t\t\t\t\t\t\tprod %= mod;\r\n \t\t\t\t\t\t\tprod *= binom[j][l];\r\n \t\t\t\t\t\t\tprod %= mod;\r\n \t\t\t\t\t\t\tdp[j][k] += prod;\r\n \t\t\t\t\t\t\twhile (dp[j][k] >= mod)\r\n \t\t\t\t\t\t\t\tdp[j][k] -= mod;\r\n \t\t\t\t\t\t}\r\n \t\t\t\t\t}\r\n \t\t\t\t}\r\n \t\t\t}\r\n \t\t\tlong ans = power(x, n) - dp[n][x];\r\n \t\t\tans %= mod;\r\n \t\t\tans += mod;\r\n \t\t\tans %= mod;\r\n \t\t\tout.println(ans);\r\n \t\t\r\n \t\tout.close();\r\n \t\t\r\n \t}\r\n\t\r\n\tpublic static void sort(int[] array){\r\n\t\tArrayList<Integer> copy = new ArrayList<>();\r\n\t\tfor (int i : array)\r\n\t\t\tcopy.add(i);\r\n\t\tCollections.sort(copy);\r\n\t\tfor(int i = 0;i<array.length;i++)\r\n\t\t\tarray[i] = copy.get(i);\r\n\t}\r\n\tstatic String[] readArrayString(int n){\r\n\t\tString[] array = new String[n];\r\n\t\tfor(int j =0 ;j<n;j++)\r\n\t\t\tarray[j] = sc.next();\r\n\t\treturn array;\r\n\t}\r\n\tstatic int[] readArrayInt(int n){\r\n \tint[] array = new int[n];\r\n \tfor(int j = 0;j<n;j++)\r\n \t\tarray[j] = sc.nextInt();\r\n \treturn array;\r\n }\r\n\tstatic int[] readArrayInt1(int n){\r\n\t\tint[] array = new int[n+1];\r\n\t\tfor(int j = 1;j<=n;j++){\r\n\t\t\tarray[j] = sc.nextInt();\r\n\t\t}\r\n\t\treturn array;\r\n\t}\r\n\tstatic long[] readArrayLong(int n){\r\n\t\tlong[] array = new long[n];\r\n\t\tfor(int j =0 ;j<n;j++)\r\n\t\t\tarray[j] = sc.nextLong();\r\n\t\treturn array;\r\n\t}\r\n\tstatic double[] readArrayDouble(int n){\r\n\t\tdouble[] array = new double[n];\r\n\t\tfor(int j =0 ;j<n;j++)\r\n\t\t\tarray[j] = sc.nextDouble();\r\n\t\treturn array;\r\n\t}\r\n\tstatic int minIndex(int[] array){\r\n\t\tint minValue = Integer.MAX_VALUE;\r\n\t\tint minIndex = -1;\r\n\t\tfor(int j = 0;j<array.length;j++){\r\n\t\t\tif (array[j] < minValue){\r\n\t\t\t\tminValue = array[j];\r\n\t\t\t\tminIndex = j;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn minIndex;\r\n\t}\r\n\tstatic int minIndex(long[] array){\r\n\t\tlong minValue = Long.MAX_VALUE;\r\n\t\tint minIndex = -1;\r\n\t\tfor(int j = 0;j<array.length;j++){\r\n\t\t\tif (array[j] < minValue){\r\n\t\t\t\tminValue = array[j];\r\n\t\t\t\tminIndex = j;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn minIndex;\r\n\t}\r\n\tstatic int minIndex(double[] array){\r\n\t\tdouble minValue = Double.MAX_VALUE;\r\n\t\tint minIndex = -1;\r\n\t\tfor(int j = 0;j<array.length;j++){\r\n\t\t\tif (array[j] < minValue){\r\n\t\t\t\tminValue = array[j];\r\n\t\t\t\tminIndex = j;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn minIndex;\r\n\t}\r\n\tstatic long power(long x, long y){\r\n\t\tif (y == 0)\r\n\t\t\treturn 1;\r\n\t\tif (y%2 == 1)\r\n\t\t\treturn (x*power(x, y-1))%mod;\r\n\t\treturn power((x*x)%mod, y/2)%mod;\r\n\t}\r\n\tstatic void verdict(boolean a){\r\n out.println(a ? \"YES\" : \"NO\");\r\n }\r\n public static class MyScanner {\r\n BufferedReader br;\r\n StringTokenizer st;\r\n public MyScanner() {\r\n br = new BufferedReader(new InputStreamReader(System.in));\r\n }\r\n String next() { \r\n while (st == null || !st.hasMoreElements()) {\r\n try {\r\n st = new StringTokenizer(br.readLine());\r\n } \r\n catch (IOException e) {\r\n e.printStackTrace();\r\n }\r\n }\r\n return st.nextToken();\r\n }\r\n int nextInt() {\r\n return Integer.parseInt(next());\r\n }\r\n long nextLong() {\r\n return Long.parseLong(next());\r\n }\r\n double nextDouble() {\r\n return Double.parseDouble(next());\r\n }\r\n String nextLine() {\r\n String str = \"\";\r\n try{\r\n str = br.readLine();\r\n } \r\n catch (IOException e) {\r\n e.printStackTrace();\r\n }\r\n return str;\r\n }\r\n \r\n }\t\r\n}\r\n\r\n//StringJoiner sj = new StringJoiner(\" \"); \r\n//sj.add(strings)\r\n//sj.toString() gives string of those stuff w spaces or whatever that sequence is", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics"], "code_uid": "e192a03f21f8c5d4763d686099274364", "src_uid": "1908d1c8c6b122a4c6633a7af094f17f", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.Scanner;\n\npublic class EvenOddGame_959A {\n public static void main(String[] args) {\n Scanner s = new Scanner(System.in);\n int n = s.nextInt();\n if(n%2==0){\n System.out.println(\"Mahmoud\");\n }\n else{\n System.out.println(\"Ehab\");\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "games"], "code_uid": "8cf788542a082647c4c781ba5a20a5d8", "src_uid": "5e74750f44142624e6da41d4b35beb9a", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.StringTokenizer;\nimport java.math.BigInteger;\nimport java.io.BufferedWriter;\nimport java.io.File;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\n\n\npublic class A {\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedInputStream inputStream = new BufferedInputStream(System.in);\n\t\tBufferedOutputStream outputStream = new BufferedOutputStream(System.out);\n\t\tScanner in = new Scanner(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\t\n\t\tchar bus[][] = new char[][] {\n\t\t\t\t\"+------------------------+\".toCharArray(),\n\t\t\t\t\"|#.#.#.#.#.#.#.#.#.#.#.|D|)\".toCharArray(),\n\t\t\t\t\"|#.#.#.#.#.#.#.#.#.#.#.|.|\".toCharArray(),\n\t\t\t\t\"|#.......................|\".toCharArray(),\n\t\t\t\t\"|#.#.#.#.#.#.#.#.#.#.#.|.|)\".toCharArray(),\n\t\t\t\t\"+------------------------+\".toCharArray()\n\t\t};\n\t\tint n = in.nextInt();\n\t\tint lim = Math.min(n,4);\n\t\tfor (int i = 0; i < lim; i++) {\n\t\t\tbus[i+1][1] = 'O';\n\t\t}\n\t\t\n\t\tint rSeq[] = new int[]{1,2,4};\n\t\tint col = 3;\n\t\tfor (int i = 4,r = 0; i < n; i++,r++) {\n\t\t\tbus[rSeq[r%3]][col] = 'O';\n\t\t\tif(r%3 == 2)\n\t\t\t\tcol+=2;\n\t\t}\n\t\t\n\t\tfor (int i = 0; i < bus.length; i++) {\n\t\t\tfor (int j = 0; j < bus[i].length; j++) {\n\t\t\t\tout.append(bus[i][j]);\n\t\t\t}\n//\t\t\tif(i != bus.length -1)\n\t\t\t\tout.append(\"\\n\");\n\t\t}\t\t\n\t\tout.close();\n\t\t\n\t}\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "f4fa1ef04692de1f21b74248a5642f28", "src_uid": "075f83248f6d4d012e0ca1547fc67993", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\npublic class Chloeandthesequence {\n\n\tpublic static void main(String[] args) throws IOException{\n\t\t\tBufferedReader b = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tString [] l = b.readLine().split(\" \");\n\t\t\tlong x = Integer.parseInt(l[0]);\n\t\t\tlong y = Long.parseLong(l[1]);\n\t\t\tlong s = 1;\n\t\t\tfor(int i = 1 ; i < x;i++)\n\t\t\t s = s*2+1;\n\t\t\tlong m =1;\n\t\t\tlong lo = 1;\n\t\t\tlong hi = s;\n\t\t\tlong target= x;\n\t\t\t//System.out.println(s);\n\t\t\twhile(lo<hi){\n\t\t\t\t\n\t\t\t\tm = (lo+hi)/2;\n\t\t\t\tif(y<m){\n\t\t\t\t\thi = m-1;\n\t\t\t\t\ttarget--;\n\t\t\t\t}else if(y>m){\n\t\t\t\t\tlo = m+1;\n\t\t\t\t\ttarget--;\n\t\t\t\t}else{\n\t\t\t\t break;\n\t\t\t\t}\n\t\t\t\t//System.out.println(target+\" \"+y+\" \"+m);\n\t\t\t}\n\t\t\tSystem.out.println(target);\n\t\t\t\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["constructive algorithms", "binary search", "implementation", "bitmasks"], "code_uid": "e947493471f0d7e9cc64b60b411b7f45", "src_uid": "0af400ea8e25b1a36adec4cc08912b71", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.IOException;\nimport java.util.StringTokenizer;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskC solver = new TaskC();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskC {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n long n = in.nextInt();\n if (n == 1) {\n out.println(1);\n } else if (n == 2) {\n out.println(2);\n } else {\n long ans = 0;\n int lower = (int) (n <= 100 ? 1 : n - 100);\n for (int i = lower; i <= n; i++) {\n for (int j = lower; j <= n; j++) {\n for (int k = lower; k <= n; k++) {\n ans = Math.max(lcm(lcm(i, j), k), ans);\n }\n }\n }\n out.println(ans);\n }\n }\n\n public long gcd(long x, long y) {\n return y == 0 ? x : gcd(y, x % y);\n }\n\n public long lcm(long x, long y) {\n return x * y / gcd(x, y);\n }\n}\n\nclass InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n}\n\n", "lang_cluster": "Java", "tags": ["greedy", "number theory"], "code_uid": "bc24b172e25c72b445cf4690dd25a746", "src_uid": "25e5afcdf246ee35c9cef2fcbdd4566e", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\npublic class main {\n\tInputStream is;\n\tPrintWriter out;\n\tstatic long mod=pow(10,9)+7;\n\tint dx[]= {0,0,1,-1},dy[]={+1,-1,0,0};\n\tvoid solve()\n\t{\n\t\tlong l=ni();\n\t\tlong r=ni();\n\t\tlong x=ni();\n\t\tlong y=ni();\n\t\tif(y%x!=0) {\n\t\t\tout.print(0);\n\t\t\treturn;\n\t\t}\n\t\tlong filter=y/x;\n\t\tlong count=0;\n\t\tfor(int i=1;i*i<=filter;i++)\n\t\t{\n\t\t\tif(filter%i==0) {\n\t\t\t\tif((filter/i)!=i) {\n\t\t\t\t\tlong gcd=gcd(filter/i,i);\n\t\t\t\t\tif(gcd!=1)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tif(i*x>=l&&i*x<=r&&(filter/i)*x>=l&&(filter/i)*x<=r)\n\t\t\t\t\t\tcount+=2;\n\t\t\t\t}\n\t\t\t\telse if(i==1&&i*x>=l&&i*x<=r)\n\t\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tout.println(count);\n\t}\n\tint bsdown(ArrayList<Integer> al,int l) {\n\t\tint low=0,high=al.size()-1,ans=-1;\n\t\twhile(low<=high) {\n\t\t\tint mid=low+(high-low)/2;\n\t\t\tif(al.get(mid)<=l) {\n\t\t\t\tlow=mid+1;\n\t\t\t\tans=mid;\n\t\t\t}else\n\t\t\t\thigh=mid-1;\t\t\t\n\t\t}\n\t\treturn ans;\n\t}\n\tArrayList<Integer>al [];\n\tvoid take(int n,int m)\n\t{\n\t\tal=new ArrayList[n];\n\t\tfor(int i=0;i<n;i++)\n\t\t\tal[i]=new ArrayList<Integer>();\n\t\tfor(int i=0;i<m;i++)\n\t\t{\n\t\t\tint x=ni()-1;\n\t\t\tint y=ni()-1;\n\t\t\tal[x].add(y);\n\t\t\tal[y].add(x);\n\t\t\t\n\t\t}\n\t}\n\tint arr[][];\n\tint small[];\n\tvoid pre(int n)\n\t{\n\t\tsmall=new int[n+1];\n\t\tfor(int i=2;i*i<=n;i++)\n\t\t{\n\t\t\tfor(int j=i;j*i<=n;j++)\n\t\t\t{\n\t\t\t\tif(small[i*j]==0)\n\t\t\t\t\tsmall[i*j]=i;\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<=n;i++)\n\t\t{\n\t\t\tif(small[i]==0)\n\t\t\t\tsmall[i]=i;\n\t\t}\n\t}\n\tpublic static int count(long x)\n\t{\n\t\tint num=0;\n\t\twhile(x!=0)\n\t\t{\n\t\t\tx=x&(x-1);\n\t\t\tnum++;\n\t\t}\n\t\treturn num;\n\t}\n\tstatic long d, x, y;\n\tvoid extendedEuclid(long A, long B) {\n\t if(B == 0) {\n\t d = A;\n\t x = 1;\n\t y = 0;\n\t }\n\t else {\n\t extendedEuclid(B, A%B);\n\t long temp = x;\n\t x = y;\n\t y = temp - (A/B)*y;\n\t }\n\t}\n\tlong modInverse(long A,long M) //A and M are coprime\n\t{\n\t extendedEuclid(A,M);\n\t return (x%M+M)%M; //x may be negative\n\t}\n\tpublic static void mergeSort(int[] arr, int l ,int r){\n\t\tif((r-l)>=1){\n\t\t\tint mid = (l+r)/2;\n\t\t\tmergeSort(arr,l,mid);\n\t\t\tmergeSort(arr,mid+1,r);\n\t\t\tmerge(arr,l,r,mid);\n\t\t}\n\t}\n\tpublic static void merge(int arr[], int l, int r, int mid){\n\t\tint n1 = (mid-l+1), n2 = (r-mid);\n\t\tint left[] = new int[n1];\n\t\tint right[] = new int[n2];\n\t\tfor(int i =0 ;i<n1;i++) left[i] = arr[l+i];\n\t\tfor(int i =0 ;i<n2;i++) right[i] = arr[mid+1+i];\n\t\tint i =0, j =0, k = l;\n\t\twhile(i<n1 && j<n2){\n\t\t\tif(left[i]>right[j]){\n\t\t\t\tarr[k++] = right[j++];\n\t\t\t}\n\t\t\telse{\n\t\t\t\tarr[k++] = left[i++];\n\t\t\t}\n\t\t}\n\t\twhile(i<n1) arr[k++] = left[i++];\n\t\twhile(j<n2) arr[k++] = right[j++];\n\t}\n\tpublic static void mergeSort(long[] arr, int l ,int r){\n\t\tif((r-l)>=1){\n\t\t\tint mid = (l+r)/2;\n\t\t\tmergeSort(arr,l,mid);\n\t\t\tmergeSort(arr,mid+1,r);\n\t\t\tmerge(arr,l,r,mid);\n\t\t}\n\t}\n\tpublic static void merge(long arr[], int l, int r, int mid){\n\t\tint n1 = (mid-l+1), n2 = (r-mid);\n\t\tlong left[] = new long[n1];\n\t\tlong right[] = new long[n2];\n\t\tfor(int i =0 ;i<n1;i++) left[i] = arr[l+i];\n\t\tfor(int i =0 ;i<n2;i++) right[i] = arr[mid+1+i];\n\t\tint i =0, j =0, k = l;\n\t\twhile(i<n1 && j<n2){\n\t\t\tif(left[i]>right[j]){\n\t\t\t\tarr[k++] = right[j++];\n\t\t\t}\n\t\t\telse{\n\t\t\t\tarr[k++] = left[i++];\n\t\t\t}\n\t\t}\n\t\twhile(i<n1) arr[k++] = left[i++];\n\t\twhile(j<n2) arr[k++] = right[j++];\n\t}\n\t static class Pair implements Comparable<Pair>{\n\t\t \n\t long x;\n\t long y,k;\n\t int i,h;\n\t String s;\n\t\tPair (long x,long y,int i){\n\t\t\tthis.x=x;\n\t\t\tthis.y=y;\n\t\t\tthis.i=i;\n\t\t}\n\t \n\t\tpublic int compareTo(Pair o) {\n\t\t\tif(this.x!=o.x)\n\t\t\t\treturn Long.compare(this.x,o.x);\n\t\t\treturn Long.compare(this.y,o.y);\n\t\t}\n\t\tpublic boolean equals(Object o) {\n\t\t\tif (o instanceof Pair) {\n\t\t\t\tPair p = (Pair)o;\n\t\t\t\treturn p.x == x && p.y == y;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t\tpublic int hashCode() {\n\t\t\treturn new Long(x).hashCode()*31 + new Long(y).hashCode() ;\n\t\t}\n\t \n\t \n\t @Override\n\t public String toString() {\n\t return \"(\"+x + \" \" + y +\" \"+k+\" \"+i+\" )\";\n\t }\n\t \n\t } \n\t \n\t public static boolean isPal(String s){\n\t for(int i=0, j=s.length()-1;i<=j;i++,j--){\n\t if(s.charAt(i)!=s.charAt(j)) return false;\n\t }\n\t return true;\n\t }\n\t public static String rev(String s){\n\t\t\tStringBuilder sb=new StringBuilder(s);\n\t\t\tsb.reverse();\n\t\t\treturn sb.toString();\n\t }\n\t \n\t public static long gcd(long x,long y){\n\t\tif(x%y==0)\n\t\t\treturn y;\n\t\telse\n\t\t\treturn gcd(y,x%y);\n\t }\n\t \n\t public static int gcd(int x,int y){\n\t \tif(y==0) \n\t \t\treturn x; \n\t \treturn gcd(y,x%y);\n\t }\n\t \n\t public static long gcdExtended(long a,long b,long[] x){\n\t \n\t if(a==0){\n\t x[0]=0;\n\t x[1]=1;\n\t return b;\n\t }\n\t long[] y=new long[2];\n\t long gcd=gcdExtended(b%a, a, y);\n\t \n\t x[0]=y[1]-(b/a)*y[0];\n\t x[1]=y[0];\n\t \n\t return gcd;\n\t }\n\t \n\t public static int abs(int a,int b){\n\t\treturn (int)Math.abs(a-b);\n\t }\n\t \n\t public static long abs(long a,long b){\n\t\treturn (long)Math.abs(a-b);\n\t }\n\t \n\t public static int max(int a,int b){\n\t\tif(a>b)\n\t\t\treturn a;\n\t\telse\n\t\t\treturn b;\n\t }\n\t \n\t public static int min(int a,int b){\n\t\tif(a>b)\n\t\t\treturn b;\n\t\telse \n\t\t\treturn a;\n\t }\n\t \n\t public static long max(long a,long b){\n\t\tif(a>b)\n\t\t\treturn a;\n\t\telse\n\t\t\treturn b;\n\t }\n\t \n\t public static long min(long a,long b){\n\t\tif(a>b)\n\t\t\treturn b;\n\t\telse \n\t\t\treturn a;\n\t }\n\t \n\t public static long pow(long n,long p,long m){\n\t\t long result = 1;\n\t\t if(p==0)\n\t\t return 1;\n\t\tif (p==1)\n\t\t return n;\n\t\twhile(p!=0)\n\t\t{\n\t\t if(p%2==1)\n\t\t result *= n;\n\t\t if(result>=m)\n\t\t result%=m;\n\t\t p >>=1;\n\t\t n*=n;\n\t\t if(n>=m)\n\t\t n%=m;\n\t\t}\n\t\treturn result;\n\t }\n\t \n\t public static long pow(long n,long p){\n\t\tlong result = 1;\n\t\t if(p==0)\n\t\t return 1;\n\t\tif (p==1)\n\t\t return n;\n\t\twhile(p!=0)\n\t\t{\n\t\t if(p%2==1)\n\t\t result *= n;\t \n\t\t p >>=1;\n\t\t n*=n;\t \n\t\t}\n\t\treturn result;\n\t }\n\t public static void debug(Object... o) {\n\t\t\tSystem.out.println(Arrays.deepToString(o));\n\t\t}\n\t void run() throws Exception {\n\t\t\tis = System.in;\n\t\t\tout = new PrintWriter(System.out);\n\t\t\tsolve();\n\t\t\tout.flush();\n\t\t}\n\t \n\t public static void main(String[] args) throws Exception {\n\t\t\tnew Thread(null, new Runnable() {\n\t\t\t\tpublic void run() {\n\t\t\t\t\ttry {\n\t\t\t\t\t\tnew main().run();\n\t\t\t\t\t} catch (Exception e) {\n\t\t\t\t\t\te.printStackTrace();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}, \"1\", 1 << 26).start();\n\n\t\t}\n\t private byte[] inbuf = new byte[1024];\n\t\tpublic int lenbuf = 0, ptrbuf = 0;\n\t \n\t\tprivate int readByte() {\n\t\t\tif (lenbuf == -1)\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tif (ptrbuf >= lenbuf) {\n\t\t\t\tptrbuf = 0;\n\t\t\t\ttry {\n\t\t\t\t\tlenbuf = is.read(inbuf);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (lenbuf <= 0)\n\t\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn inbuf[ptrbuf++];\n\t\t}\n\t \n\t\tprivate boolean isSpaceChar(int c) {\n\t\t\treturn !(c >= 33 && c <= 126);\n\t\t}\n\t \n\t\tprivate int skip() {\n\t\t\tint b;\n\t\t\twhile ((b = readByte()) != -1 && isSpaceChar(b));\n\t\t\treturn b;\n\t\t}\n\t \n\t\tprivate double nd() {\n\t\t\treturn Double.parseDouble(ns());\n\t\t}\n\t \n\t\tprivate char nc() {\n\t\t\treturn (char) skip();\n\t\t}\n\t \n\t\tprivate String ns() {\n\t\t\tint b = skip();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\twhile (!(isSpaceChar(b))) { // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n\t \n\t\tprivate char[] ns(int n) {\n\t\t\tchar[] buf = new char[n];\n\t\t\tint b = skip(), p = 0;\n\t\t\twhile (p < n && !(isSpaceChar(b))) {\n\t\t\t\tbuf[p++] = (char) b;\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t\t}\n\t \n\t\tprivate char[][] nm(int n, int m) {\n\t\t\tchar[][] map = new char[n][];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tmap[i] = ns(m);\n\t\t\treturn map;\n\t\t}\n\t \n\t\tprivate int[] na(int n) {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = ni();\n\t\t\treturn a;\n\t\t}\n\t\t\n\t\tprivate long[] nl(int n) {\n\t\t\tlong[] a = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nl();\n\t\t\treturn a;\n\t\t}\n\t\t\n\t\tprivate int ni() {\n\t\t\tint num = 0, b;\n\t\t\tboolean minus = false;\n\t\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t\t;\n\t\t\tif (b == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tb = readByte();\n\t\t\t}\n\t \n\t\t\twhile (true) {\n\t\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t\t} else {\n\t\t\t\t\treturn minus ? -num : num;\n\t\t\t\t}\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t}\n\t \n\t\tprivate long nl() {\n\t\t\tlong num = 0;\n\t\t\tint b;\n\t\t\tboolean minus = false;\n\t\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t\t;\n\t\t\tif (b == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tb = readByte();\n\t\t\t}\n\t \n\t\t\twhile (true) {\n\t\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t\t} else {\n\t\t\t\t\treturn minus ? -num : num;\n\t\t\t\t}\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t}\n\t \n}", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "17410a5caa6659169550914b74c3e785", "src_uid": "d37dde5841116352c9b37538631d0b15", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "\n// @author Sanzhar\nimport java.awt.Point;\nimport java.io.*;\nimport java.util.*;\n\npublic class Template {\n\n BufferedReader in;\n PrintWriter out;\n StringTokenizer st;\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(in.readLine());\n } catch (Exception e) {\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public void run() throws Exception {\n //in = new BufferedReader(new FileReader(\"input.txt\"));\n //out = new PrintWriter(new FileWriter(\"output.txt\"));\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n solve();\n out.flush();\n out.close();\n in.close();\n }\n long mod = 1000000007;\n\n long binpow(long a, long x) {\n long res = 1;\n while (x > 0) {\n if (x % 2 == 1) {\n res *= a;\n res %= mod;\n x--;\n } else {\n a *= a;\n a %= mod;\n x /= 2;\n }\n }\n return res % mod;\n }\n\n public void solve() throws Exception {\n int[] m = {2, 3, 5, 7, 13, 17, 19, 31, 61, 89, 107, 127, 521, 607, 1279, 2203, 2281,\n 3217, 4253, 4423, 9689, 9941, 11213, 19937, 21701, 23209, 44497, 86243, 110503, 132049, 216091, 756839, 859433, 1257787, 1398269, 2976221, 3021377, 6972593, 13466917, 20996011};\n int n = nextInt() - 1;\n int t = m[n] - 1;\n long ans = (binpow(2, (long) t) - 1 + mod) % mod;\n out.println(ans);\n }\n\n public static void main(String[] args) throws Exception {\n new Template().run();\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "c8c844df457e01f0645e3460db99e71a", "src_uid": "c2cbc35012c6ff7ab0d6899e6015e4e7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args)\n\t{\n\t\tScanner s=new Scanner(System.in);\n\t\t\n\t\tlong m=1000000007;\n\t\t\n\t\tlong x=s.nextLong();\n\t\tlong n=s.nextLong();\n\t\t\n\t\tboolean[] prime=new boolean[500001];\n\t\t\n\t\tseive(prime,500000);\n\t\t\n\t\tArrayList<Long> list=new ArrayList<>();\n\t\t\n\t\tfor(long i=2;i<=500000;i++)\n\t\t{\n\t\t\tif(prime[(int)i]&&x%i==0)\n\t\t\t{\n\t\t\t\tlist.add(i);\n\t\t\t\t\n\t\t\t\twhile(x%i==0)\n\t\t\t\t{\n\t\t\t\t\tx=x/i;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tif(x!=1)\n\t\tlist.add(x);\n\t\t\n\t\t//System.out.println(list);\n\t\t\n\t\tlong ans=1;\n\t\t\n\t\t\n\t\t\n\t\tfor(int i=0;i<list.size();i++)\n\t\t{\n\t\t\tlong count=0;\n\t\t\t\n\t\t\tfor(long j=list.get(i);j<=n;j=j*list.get(i))\n\t\t\t{\n\t\t\t\tcount=count+(n/j);\n\t\t\t\tif(Long.MAX_VALUE/j<list.get(i))\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\tans=(ans%m*power(list.get(i),count,m))%m;\n\t\t\t\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t\t\n\t}\n\t\n\tpublic static long power(long a,long b,long m)\n\t{\n\t\tlong res=1;\n\t\t\n\t\twhile(b>0)\n\t\t{\n\t\t\tif(b%2!=0)\n\t\t\t{\n\t\t\t\tres=(res%m*a%m)%m;\n\t\t\t}\n\t\t\t\n\t\t\tb=b/2;\n\t\t\ta=(a%m*a%m)%m;\n\t\t}\n\t\t\n\t\treturn res;\n\t}\n\t\n\tpublic static void seive(boolean[] prime,int n)\n\t{\n\t\tArrays.fill(prime,true);\n\t\t\n\t\tprime[0]=false;\n\t\tprime[1]=false;\n\t\t\n\t\tfor(int i=2;i<=Math.sqrt(n);i++)\n\t\t{\n\t\t\tif(prime[i])\n\t\t\t{\n\t\t\t\tfor(int j=i*i;j<=n;j=j+i)\n\t\t\t\t{\n\t\t\t\t\tprime[j]=false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n}", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "9a80d716547932a52bf995033180bdc9", "src_uid": "04610fbaa746c083dda30e21fa6e1a0c", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.util.HashSet;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n TaskA solver = new TaskA();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskA {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n = in.readInt();\n int k = in.readInt();\n int[] a = IOUtils.readIntArray(in, n);\n MiscUtils.decreaseByOne(a);\n HashSet<Integer> library = new HashSet<>();\n int res = 0;\n for (int want = 0; want < n; want++) {\n if (library.contains(a[want])) continue;\n res++;\n if (library.size() == k) {\n int other = -1, far = -1;\n for (int book : library) {\n int dist = n;\n for (int i = want + 1; i < n; i++) {\n if (a[i] == book) {\n dist = i;\n break;\n }\n }\n if (dist > far) {\n far = dist;\n other = book;\n }\n }\n library.remove(other);\n }\n library.add(a[want]);\n }\n out.printLine(res);\n }\n }\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void printLine(int i) {\n writer.println(i);\n }\n }\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n }\n static class IOUtils {\n public static int[] readIntArray(InputReader in, int size) {\n int[] array = new int[size];\n for (int i = 0; i < size; i++) {\n array[i] = in.readInt();\n }\n return array;\n }\n }\n static class MiscUtils {\n public static void decreaseByOne(int[]... arrays) {\n for (int[] array : arrays) {\n for (int i = 0; i < array.length; i++) {\n array[i]--;\n }\n }\n }\n }\n}\n\n", "lang_cluster": "Java", "tags": ["greedy"], "code_uid": "0e39e40e80b6e68b4bb4cf6111b06c5b", "src_uid": "956228e31679caa9952b216e010f9773", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\npublic class mohammad\n{\n public static void main (String[]args)\n {\n Scanner U = new Scanner (System.in);\n int n = U.nextInt();\n int[] a = new int[n];\n int[] b = new int[n];\n for( int i=0 ; i<n ; i++)\n a[i] = U.nextInt();\n for( int j=0 ; j<n ; j++)\n for( int i=0 ; i<n ; i++)\n if(a[i]==a[j])\n b[j]++;\n Arrays.sort(b);\n if(b[n-1]==0||b[n-1]==1)\n System.out.println(1);\n else\n System.out.println(b[n-1]);\n }\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "04f480a2acdd2b5d53aac4e3a1a4e671", "src_uid": "f30329023e84b4c50b1b118dc98ae73c", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\n\npublic class IQ {\n\tpublic static void main(String[] args) throws Exception {\n\t\tScanner in = new Scanner(System.in);\n\t\tString[] arr = in.nextLine().split(\" \");\n\t\tint[] ints = new int[4];\n\t\tfor(int i = 0; i < arr.length; i++) {\n\t\t\tints[i] = Integer.parseInt(arr[i]);\n\t\t}\n\t\tif(ints[1] * 2 == ints[0] + ints[2] && ints[2] * 2 == ints[1] + ints[3]) {\n\t\t\tSystem.out.println(ints[3] * 2 - ints[2]);\n\t\t} else {\n\t\t\tif(ints[1] * ints[1] == ints[0] * ints[2] && ints[2] * ints[2] == ints[1] * ints[3]) {\n\t\t\t\tdouble a = (double) ints[3] * ints[3] / ints[2];\n\t\t\t\tif(Math.round(a) != a) System.out.println(42);\n\t\t\t\telse System.out.println((int) Math.round(a));\n\t\t\t} else {\n\t\t\t\tSystem.out.println(\"42\");\n\t\t\t}\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "e45ec98fb6b1107eeb0ef9f3c00cf77c", "src_uid": "68a9508d49fec672f9c61766d6051047", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\npublic class Main{\n static int MOD=(int)1e9+7;\n\tpublic static void main (String[] args) {\n\t Scanner sc=new Scanner(System.in);\n\t String s=sc.next();\n\t String t=sc.next();\n\t int a=0,b=0;\n\t while(a<s.length()&&b<t.length()){\n\t if(s.charAt(a)==t.charAt(b)){a++;b++;}\n\t else a++;\n\t if(b==t.length()){System.out.println(\"automaton\");return;}\n\t }\n\t if(s.indexOf(t)!=-1){\n\t System.out.println(\"automaton\");\n\t }else{\n\t int cnt1[]=new int[256];\n\t int cnt2[]=new int[256];\n\t boolean valid=true;\n\t for(int i=0;i<s.length();i++)cnt1[s.charAt(i)-'a']++;\n\t for(int i=0;i<t.length();i++)cnt2[t.charAt(i)-'a']++;\n\t for(int i=0;i<256;i++)if(cnt1[i]<cnt2[i]){\n\t valid=false;break;\n\t }\n\t if(valid&&s.length()>t.length())System.out.println(\"both\");\n\t else if(valid&&s.length()==t.length())System.out.println(\"array\");\n\t else System.out.println(\"need tree\");\n\t }\n\t}\n}", "lang_cluster": "Java", "tags": ["strings", "implementation"], "code_uid": "cde0f5c7e6c363ea4a50866163475276", "src_uid": "edb9d51e009a59a340d7d589bb335c14", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "\nimport java.io.*;\nimport java.util.StringTokenizer;\n\npublic class B146 {\n\n public static void main(String[] args) throws IOException {\n new B146().run();\n }\n\n private void solve() throws IOException {\n int a = nextInt();\n int b = nextInt();\n int c = nextInt();\n\n long result = 0;\n\n cache = new int[a * b * c + 1];\n\n for (int i = 1; i <= a; i++)\n for (int j = 1; j <= b; j++)\n for (int k = 1; k <= c; k++)\n result += countD(i * j * k);\n\n out.print(result);\n }\n\n //70 70 70 = 14425864\n int[] cache;\n\n long countD(int n) {\n int result = 0;\n if (cache[n] != 0) return cache[n];\n for (int i = 1; i * i <= n; i++)\n {\n if (n % i == 0)\n {\n result++;\n if (i != n / i)\n {\n result++;\n }\n }\n }\n cache[n] = result;\n return result;\n }\n\n private PrintWriter out;\n private StringTokenizer st;\n private BufferedReader in;\n\n void run() {\n out = new PrintWriter(new OutputStreamWriter(System.out));\n in = new BufferedReader(new InputStreamReader(System.in));\n try\n {\n solve();\n } catch (Throwable e)\n {\n e.printStackTrace();\n } finally\n {\n try\n {\n in.close();\n out.close();\n } catch (IOException e)\n {\n e.printStackTrace();\n }\n }\n }\n\n private int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n private String next() throws IOException {\n while (st == null || !st.hasMoreTokens())\n {\n st = new StringTokenizer(in.readLine());\n }\n return st.nextToken();\n }\n}\n", "lang_cluster": "Java", "tags": ["implementation", "number theory"], "code_uid": "1ecca4486a13eaf2bb2f114ca7d02a25", "src_uid": "4fdd4027dd9cd688fcc70e1076c9b401", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 17", "source_code": "import java.util.*;\r\npublic class Test1 {\r\n\r\n\tpublic static void main(String[] args) {\r\n\t\t\r\n\t\tScanner sc = new Scanner(System.in);\r\n\t\tint t = sc.nextInt();\r\n\t\twhile(t-->0) {\r\n\t\t\tint ind = sc.nextInt();\r\n\t\t\tint[] arr = new int[3];\r\n\t\t\tarr[0] = sc.nextInt();\r\n\t\t\tarr[1] = sc.nextInt();\r\n\t\t\tarr[2] = sc.nextInt();\r\n\t\t\tint count = 1;\r\n\t\t\t\r\n\t\t\twhile(arr[ind-1] != 0) {\r\n\t\t\t\tind = arr[ind-1];\r\n\t\t\t\tcount++;\r\n\t\t\t}\r\n\t\t\t\t\r\n\t\t\tif(count == 3) \r\n\t\t\t\tSystem.out.println(\"YES\");\r\n\t\t\telse\r\n\t\t\t\tSystem.out.println(\"NO\");\r\n\t\t\t\r\n\t\t}\r\n\t}\r\n}", "lang_cluster": "Java", "tags": ["brute force", "greedy", "implementation", "math"], "code_uid": "6acec510339a87e53e7315d3c5c8ea90", "src_uid": "5cd113a30bbbb93d8620a483d4da0349", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.awt.Point;\nimport java.io.*;\nimport java.util.*;\npublic class Contest1 {\n\tstatic PrintWriter out;\n\tstatic ArrayList<Integer> primes;\n\tstatic int p;\n\tpublic static void main(String[] args) throws Exception {\n\t\t// TODO Auto-generated method stub\n\t\tout = new PrintWriter(System.out);\n\t\tScanner sc = new Scanner(System.in);\n\t\tp = sc.nextInt();\n\t\tint cnt = 0;\n\t\tmo:for(int i=1;i<p;i++) {\n\t\t\tint tmp = 1;\n\t\t\tfor(int j=1;j<p;j++) {\n\t\t\t\ttmp = (tmp*i)%p;\n\t\t\t\tif(tmp%p == 1 && j < p-1)\n\t\t\t\t\tcontinue mo;\n\t\t\t}\n\t\t\tif(tmp%p == 1)\n\t\t\t\tcnt++;\n\t\t}\n\t\tout.println(cnt);\n\t\tout.flush();\n\t}\n\tstatic int pow(int n, int m) {\n\t\tif(m == 0) return 1;\n\t\tif(m == 1) return n;\n\t\tint ans = n;\n\t\tif(m%2 == 0) {\n\t\t\tint tmp = pow(ans,m/2);\n\t\t\tans = tmp*tmp;\n\t\t}else {\n\t\t\tint tmp = pow(ans,--m);\n\t\t\tans = n*tmp;\n\t\t}\n\t\treturn ans;\n\t}\n\tstatic boolean isPrime(long n) {\n\t\tfor(long i=2;i*i<=n;i++) {\n\t\t\tif(n%i == 0)\n\t\t\t\treturn false;\n\t\t}\n\t\treturn n>1;\n\t}\n\tstatic void sieveLinear(int N)\n\t{\n\t\tprimes = new ArrayList<Integer>();\n\t\tint[] lp = new int[N + 1];\t\t\t\t\t\t\t\t//lp[i] = least prime divisor of i\n\t\tfor(int i = 2; i <= N; ++i)\n\t\t{\n\t\t\tif(lp[i] == 0)\n\t\t\t{\n\t\t\t\tprimes.add(i);\n\t\t\t\tlp[i] = i;\n\t\t\t}\n\t\t\tint curLP = lp[i];\n\t\t\tfor(int p: primes)\n\t\t\t\tif(p > curLP || p * i > N)\n\t\t\t\t\tbreak;\n\t\t\t\telse\n\t\t\t\t\tlp[p * i] = i;\n\t\t}\n\t}\n\tstatic int gcd(int a,int b) {\n\t\tif(a == 0)\n\t\t\treturn b;\n\t\treturn gcd(b % a,a);\n\t}\n\tstatic class Pair extends Point implements Comparable<Pair>\n\t{\n\t\tpublic Pair(int x, int y) {\n\t\t\tsuper(x,y);\n\t\t}\n\t\t@Override\n\t\tpublic int compareTo(Pair o) {\n\t\t\t// TODO Auto-generated method stub\n\t\t\tif(x == o.x)\n\t\t\t\treturn y-o.y;\n\t\t\treturn x-o.x;\n\t\t}\n\t\t\n\t}\n\n\t\n\tstatic class Scanner {\n\t\tStringTokenizer st;\n\t\tBufferedReader br;\n\n\t\tpublic Scanner(InputStream system) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(system));\n\t\t}\n\n\t\tpublic Scanner(String file) throws Exception {\n\t\t\tbr = new BufferedReader(new FileReader(file));\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\twhile (st == null || !st.hasMoreTokens())\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic String nextLine() throws IOException {\n\t\t\treturn br.readLine();\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic double nextDouble() throws IOException {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tpublic char nextChar() throws IOException {\n\t\t\treturn next().charAt(0);\n\t\t}\n\n\t\tpublic Long nextLong() throws IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic boolean ready() throws IOException {\n\t\t\treturn br.ready();\n\t\t}\n\n\t\tpublic void waitForInput() throws InterruptedException {\n\t\t\tThread.sleep(3000);\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation", "number theory"], "code_uid": "270760c3051fea3d67185698f5720149", "src_uid": "3bed682b6813f1ddb54410218c233cff", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.lang.Math;\n\npublic class solve\n{\n\t// Read a String from the standard input using Scanner\n\t// public static void main(String[] args)\n\t// {\n\t// \tScanner scanner = new Scanner(System.in);\n\t// \tArrayList<Integer> nums = new ArrayList<Integer>();\n\t// \tfor(String tok : scanner.nextLine().split(\" \")){\n\t// \t\tnums.add(Integer.parseInt(tok));\n\n\t// \t}\n\n\t// \tSystem.out.println(nums);\n\t// \tscanner.close();\n\t\t\n\t// }\n\tpublic static void fun(String s){\n\n\t\tchar c = s.charAt(0);\n\t\tchar num = s.charAt(1);\n\n\t\tint ret = 8;\n\t\tboolean flag = false;\n\t\tif(c == 'a' || c == 'h'){\n\t\t\tret -= 3;\n\t\t\tflag = true;\n\t\t}\n\n\t\tif(num == '1' || num == '8'){\n\t\t\tif(flag){\n\t\t\t\tret -= 2;\n\t\t\t}else{\n\t\t\t\tret -= 3;\n\t\t\t}\n\n\t\t}\n\t\tSystem.out.println(ret);\n\t}\n\t\t\n\tpublic static void main(String[] args){\t\n\n\n\t\tFastReader fr = new FastReader();\n\t\tString s = fr.nextLine();\n\t\tfun(s);\n\n\t}\n\n\n\tstatic class FastReader \n\t{ \n\t BufferedReader br; \n\t StringTokenizer st; \n \n\t public FastReader() {\n\t \tbr = new BufferedReader(new\n\t InputStreamReader(System.in)); \n\t }\n\t String next() { \n\t while (st == null || !st.hasMoreElements()) { \n\t try{ \n\t st = new StringTokenizer(br.readLine()); \n\t } \n\t catch (IOException e) { \n\t e.printStackTrace(); \n\t } \n\t } \n\t return st.nextToken(); \n\t } \n\t int nextInt() { \n\t return Integer.parseInt(next()); \n\t } \n\t long nextLong() { \n\t return Long.parseLong(next()); \n\t } \n\t double nextDouble() { \n\t return Double.parseDouble(next()); \n\t } \n\t String nextLine() { \n\t String str = \"\"; \n\t try{ \n\t str = br.readLine(); \n\t } \n\t catch (IOException e) { \n\t e.printStackTrace(); \n\t } \n\t return str; \n\t } \n\t} \n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "7fe659b472e632e88be1de6fa77b99c5", "src_uid": "6994331ca6282669cbb7138eb7e55e01", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class C911 {\n\tpublic static void main(String arsg[]) {\n\t\tScanner skan = new Scanner(System.in);\n\t\tint k1=skan.nextInt(),k2=skan.nextInt(),k3=skan.nextInt();\n\t\tif (k1==1||k2==1||k3==1) {\n\t\t\tSystem.out.println(\"YES\");\n\t\t\treturn;\n\t\t}else if (k1==3&&k2==3&&k3==3) {System.out.println(\"YES\");\n\t\t}else if ((k1==2&&k2==2)||(k1==2&&k3==2)||(k2==2&&k3==2)) {System.out.println(\"YES\");\n\t\t}else if ((k1==4&&k2==4&&k3==2)||(k1==4&&k3==4&&k2==2)||(k2==4&&k3==4&&k1==2)||(k2==4&&k1==4&&k3==2)||(k3==4&&k1==4&&k2==2)||(k3==4&&k2==4&&k1==2)) {System.out.println(\"YES\");\n\t\t}else {System.out.println(\"NO\");\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms"], "code_uid": "fcfd4d48b8b12dcdd955b251743aa975", "src_uid": "df48af9f5e68cb6efc1214f7138accf9", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//Code by Sounak, IIEST\nimport java.io.*;\nimport java.math.*;\nimport java.util.*;\nimport java.util.Arrays;\npublic class Test1{\n public static void main(String args[])throws IOException{\n FastReader sc = new FastReader();\n StringBuilder sb = new StringBuilder();\n int n=sc.nextInt();\n int sum=(n/2+1)*((int)Math.ceil(n/2.0));\n System.out.println(sum);\n }\n}\n\nclass FastReader {\n BufferedReader br;\n StringTokenizer st;\n \n public FastReader() { br = new BufferedReader(new InputStreamReader(System.in)); }\n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n int nextInt() { return Integer.parseInt(next()); }\n long nextLong() { return Long.parseLong(next()); }\n double nextDouble() { return Double.parseDouble(next()); }\n String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n}", "lang_cluster": "Java", "tags": ["math", "constructive algorithms"], "code_uid": "2fcc36b4a4a582bb30f3f5115707a2ce", "src_uid": "f8af5dfcf841a7f105ac4c144eb51319", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/*\n╭╮╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╭╮╱╱╱╱╭╮╱╱╱╱╱╱╱╱╱╱╱╱╱╱╭╮╱╱╱╱╱╱╱╱╱╱╱╭╮╱╱╭╮╱╱╱╱╱╱╱╱╭╮╱╱╱╱╭╮╱╱╱╱╱╱╱╱╱╱╱╱╭╮╱╱╱╱╱╱╱╱╱╱╱╱╭━╮\n┃┃╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱┃┃╱╱╱╭╯╰╮╱╱╱╱╱╱╱╱╱╱╱╱╱┃┃╱╱╱╱╱╱╱╱╱╱╱┃┃╱╱┃┃╱╱╱╱╱╱╱╱┃┃╱╱╱╭╯╰╮╱╱╱╱╱╱╱╱╱╱╱┃┃╱╱╱╱╱╱╱╱╱╱╱╱┃╭╯\n┃┃╱╱╭━━┳╮╭┳━━╮╭╮╭╮╭┫╰━┳━┻╮╭╯╭╮╱╭┳━━┳╮╭╮╭━╯┣━━╮╭━━┳━╮╭━╯┃╭━╯┣━━╮╭╮╭╮╭┫╰━┳━┻╮╭╯╭╮╱╭┳━━┳╮╭╮┃┃╭━━┳╮╭┳━━╮╱╭╯╰┳━━┳━━┳╮╭┳━━╮\n┃┃╱╭┫╭╮┃╰╯┃┃━┫┃╰╯╰╯┃╭╮┃╭╮┃┃╱┃┃╱┃┃╭╮┃┃┃┃┃╭╮┃╭╮┃┃╭╮┃╭╮┫╭╮┃┃╭╮┃╭╮┃┃╰╯╰╯┃╭╮┃╭╮┃┃╱┃┃╱┃┃╭╮┃┃┃┃┃┃┃╭╮┃╰╯┃┃━┫╱╰╮╭┫╭╮┃╭━┫┃┃┃━━┫\n┃╰━╯┃╰╯┣╮╭┫┃━┫╰╮╭╮╭┫┃┃┃╭╮┃╰╮┃╰━╯┃╰╯┃╰╯┃┃╰╯┃╰╯┃┃╭╮┃┃┃┃╰╯┃┃╰╯┃╰╯┃╰╮╭╮╭┫┃┃┃╭╮┃╰╮┃╰━╯┃╰╯┃╰╯┃┃╰┫╰╯┣╮╭┫┃━╋┳┳┫┃┃╰╯┃╰━┫╰╯┣━━┃\n╰━━━┻━━╯╰╯╰━━╯╱╰╯╰╯╰╯╰┻╯╰┻━╯╰━╮╭┻━━┻━━╯╰━━┻━━╯╰╯╰┻╯╰┻━━╯╰━━┻━━╯╱╰╯╰╯╰╯╰┻╯╰┻━╯╰━╮╭┻━━┻━━╯╰━┻━━╯╰╯╰━━┻┻┻┻╯╰━━┻━━┻━━┻━━╯\n╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╭━╯┃╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╭━╯┃\n╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╰━━╯╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╰━━╯\n╱╱╱╱╱╱╱╱╭╮╱╱╱╱╱╱╭╮╱╱╱╱╱╭╮╱╭╮╱╱╱╱╱╱╱╱╱╭╮╱╱╱╱╱╱╱╱╭╮╱╭━╮╱╱╱╱╱╱╱╱╱╱╭╮╱╱╱╱╭╮╱╱╱╱╱╱╱╭╮╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╭╮╭╮\n╱╱╱╱╱╱╱╭╯╰╮╱╱╱╱╱┃┃╱╱╱╱╭╯╰╮┃┃╱╱╱╱╱╱╱╱╱┃┃╱╱╱╱╱╱╱╱┃┃╱┃╭╯╱╱╱╱╱╱╱╱╱╭╯╰╮╱╱╱┃┃╱╱╱╱╱╱╭╯╰╮╱╱╱╱╱╱╱╱╱╱╱╱╱╱╭╯╰┫┃\n╭━━┳━╮╱╰╮╭╋━━┳━━┫┃╭╮╭━┻╮╭╯┃╰━┳━━┳━╮╭━╯┃╭━━┳━╮╭━╯┃╭╯╰┳━━┳━┳━━┳━┻╮╭╯╭━━┫╰━┳━━┳╮┣╮╭╯╭━━┳╮╭┳━━┳━┳╮╱┣╮╭┫╰━┳┳━╮╭━━╮\n┃╭╮┃╭╮╮╱┃┃┃╭╮┃━━┫╰╯╯┃╭╮┃┃╱┃╭╮┃╭╮┃╭╮┫╭╮┃┃╭╮┃╭╮┫╭╮┃╰╮╭┫╭╮┃╭┫╭╮┃╭╮┃┃╱┃╭╮┃╭╮┃╭╮┃┃┃┃┃╱┃┃━┫╰╯┃┃━┫╭┫┃╱┃┃┃┃╭╮┣┫╭╮┫╭╮┃\n┃╰╯┃┃┃┃╱┃╰┫╭╮┣━━┃╭╮╮┃╭╮┃╰╮┃┃┃┃╭╮┃┃┃┃╰╯┃┃╭╮┃┃┃┃╰╯┃╱┃┃┃╰╯┃┃┃╰╯┃╰╯┃╰╮┃╭╮┃╰╯┃╰╯┃╰╯┃╰╮┃┃━╋╮╭┫┃━┫┃┃╰━╯┃╰┫┃┃┃┃┃┃┃╰╯┣┳┳╮\n╰━━┻╯╰╯╱╰━┻╯╰┻━━┻╯╰╯╰╯╰┻━╯╰╯╰┻╯╰┻╯╰┻━━╯╰╯╰┻╯╰┻━━╯╱╰╯╰━━┻╯╰━╮┣━━┻━╯╰╯╰┻━━┻━━┻━━┻━╯╰━━╯╰╯╰━━┻╯╰━╮╭┻━┻╯╰┻┻╯╰┻━╮┣┻┻╯\n╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╭━╯┃╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╭━╯┃╱╱╱╱╱╱╱╱╱╭━╯┃\n╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╰━━╯╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╱╰━━╯╱╱╱╱╱╱╱╱╱╰━━╯\n*/\nimport java.util.*;\nimport java.math.*;\n\npublic class Ekalavya {\n\t\n\tpublic static void main(String[] args) {\n\t\t\n\t\tScanner in = new Scanner(System.in);\n\t\t\n\t\tchar[] ch = in.next().toCharArray();\n\t\t\n\t\tint k = in.nextInt();\n\t\t\n\t\tfor (int i = 0; i < ch.length; i++) {\n\t\t\t\n\t\t\tint idx = -1;\n\t\t\tchar max = ch[i];\n\t\t\t\n\t\t\tfor (int j = i + 1; j < ch.length; j++) {\n\t\t\t\t\n\t\t\t\tif (ch[j] > max && j - i <= k) {\n\t\t\t\t\tmax = ch[j];\n\t\t\t\t\tidx = j;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\tif (idx != -1) {\n\t\t\t\t\n\t\t\t\tk -= (idx - i);\n\t\t\t\t\n\t\t\t\tfor (int j = idx; j > i; j--) {\n\t\t\t\t\tchar temp = ch[j];\n\t\t\t\t\tch[j] = ch[j - 1];\n\t\t\t\t\tch[j - 1] = temp;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t}\n\t\t\n\t\tfor (int i = 0; i < ch.length; i++) {\n\t\t\tSystem.out.print(ch[i]);\n\t\t}\n\t\t\n\t\tSystem.out.println();\n\t\t\n\t\t\n\t}\n\t\n}\n\n", "lang_cluster": "Java", "tags": ["greedy"], "code_uid": "cb091a217215ae950790fec704271162", "src_uid": "e56f6c343167745821f0b18dcf0d0cde", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "\nimport java.math.*;\nimport java.io.*;\nimport java.util.*;\n/* Jai Shree Ram */\npublic class JAVA {\n\n\n\tstatic int gcd(int a, int b) \n { \n if (b == 0) \n return a; \n return gcd(b, a % b); \n }\n\tpublic static int func(int a , int b , int n)\n\t{\n\t\tint x = 1;\n\t\tint count = 1;\n\t\twhile(true)\n\t\t{\n\t\t\tif(count % 2 != 0)\n\t\t\t{\n\t\t\t\tint q = gcd(a , n);\n\t\t\t\tn = n - q;\n\t\t\t\tif(n < 0)\n\t\t\t\t{\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t\tcount++;\n\t\t\t\tx = 0;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\n\t\t\t\tint q = gcd(b , n);\n\t\t\t\tn = n - q;\n\t\t\t\tif(n < 0)\n\t\t\t\t{\n\t\t\t\t\treturn 1;\n\t\t\t\t}\n\t\t\t\tcount++;\n\t\t\t\tx = 1;\n\t\t\t}\n\t\t\tif(n == 0)\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\treturn x;\n\t}\n\n\n\tpublic static void main (String[] args) throws Exception\n\t {\n\t \tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t \t//Scanner sc = new Scanner(System.in);\n\t \t\n\t \tString str[] = br.readLine().trim().split(\" \");\n\t \tint a = Integer.parseInt(str[0]);\n\t \tint b = Integer.parseInt(str[1]);\n\t \tint n = Integer.parseInt(str[2]);\n\t \tSystem.out.println(func(a , b , n));\n\t }\n\n}\n\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "857f5bb7dc6668962002d8a09a1e8d5e", "src_uid": "0bd6fbb6b0a2e7e5f080a70553149ac2", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Scanner ;\npublic class B_259_Little_Elephant_and_Magic_Square {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner (System.in);\n\t\tint [] z = new int [9];\n\t\tint m =0 ;\n\t\tfor(int i = 0;i<z.length;i++){\n\t\t\tz[i]=in.nextInt();\n\t\t\tm+=z[i];\n\t\t}\n\t\tm/=2;\n\t\tz[0]=m-(z[1]+z[2]);\n\t\tz[4]=m-(z[3]+z[5]);\n\t\tz[8]=m-(z[7]+z[6]);\n\t\tfor(int i =0 ;i<z.length;i+=3)\n\t\t\tSystem.out.println(z[i]+\" \"+z[i+1]+\" \"+z[i+2]);\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "0af09fc46eb4bafaa352bb9ff303054c", "src_uid": "0c42eafb73d1e30f168958a06a0f9bca", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n/**\n *\n * @author alanl\n */\npublic class Main{\n static BufferedReader input = new BufferedReader(new InputStreamReader(System.in));\n static StringTokenizer st;\n static PrintWriter pr = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n public static void main(String[] args) throws IOException{\n long a = readLong(), b = readLong(), diff = b-a, sub = b, sub1 = diff;\n boolean zero = false;\n int cur = 0;\n while(cur<10 && sub1>0){\n sub--;\n sub1--;\n if(sub1==0)break;\n cur++;\n if(sub<1)break;\n if(sub%5==0){\n zero = true;\n break;\n }\n }\n if(zero){\n println(0);\n return;\n }\n else{\n String[]val = Long.toString(b).split(\"\");\n int cnt = Integer.parseInt(val[val.length-1]);\n long ans = 1;\n while(cnt>=0&&diff>0){\n ans*=cnt;\n cnt--;\n diff--;\n }\n val = Long.toString(ans).split(\"\");\n println(val[val.length-1]);\n }\n }\n static String next () throws IOException {\n while (st == null || !st.hasMoreTokens())\n st = new StringTokenizer(input.readLine().trim());\n return st.nextToken();\n }\n static long readLong () throws IOException {\n return Long.parseLong(next());\n }\n static int readInt () throws IOException {\n return Integer.parseInt(next());\n }\n static double readDouble () throws IOException {\n return Double.parseDouble(next());\n }\n static char readChar () throws IOException {\n return next().charAt(0);\n }\n static String readLine () throws IOException {\n return input.readLine().trim();\n }\n static void print(Object b) {\n System.out.print(b);\n }\n static void println(Object b) {\n System.out.println(b);\n }\n static void println() {\n System.out.println();\n }\n}\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "3713d8d2ef2850a4a44bbf9d5f77fe3f", "src_uid": "2ed5a7a6176ed9b0bda1de21aad13d60", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.util.regex.Matcher;\nimport java.util.regex.Pattern;\nimport java.util.stream.Collector;\nimport java.util.stream.Collectors;\n\n\npublic class Main {\n public static void main(String[] args) {\n\n File file = new File(\"in.txt\");\n InputStream inputStream = null;\n// try {inputStream= new FileInputStream(file);} catch (FileNotFoundException ex){return;};\n inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskB solver = new TaskB();\n solver.solve(1, in, out);\n out.close();\n }\n}\n\n\n\n\n\nclass TaskB {\n\n private Map<Integer,Boolean> cache;\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n Integer n = in.nextInt();\n for (int a = 0; a <= n; a += 1234567) {\n for (int b = 0; a + b <= n; b += 123456) {\n if (n >= (a+b) && ((n - a - b) % 1234) == 0) {\n out.println(\"YES\");\n return;\n }\n }\n }\n out.println(\"NO\");\n return;\n }\n\n\n\n\n\n}\n\n\nclass InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public String nextLine(){\n try {\n return reader.readLine();\n } catch (IOException e){\n throw new RuntimeException(e);\n }\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n public long nextLong() { return Long.parseLong(next()); }\n\n}\n\n\n\nclass Pair<F, S> {\n public final F first;\n public final S second;\n\n\n\n\n public Pair(F first, S second) {\n this.first = first;\n this.second = second;\n }\n\n @Override\n public boolean equals(Object o) {\n if (!(o instanceof Pair)) {\n return false;\n }\n Pair<?, ?> p = (Pair<?, ?>) o;\n return Objects.equals(p.first, first) && Objects.equals(p.second, second);\n }\n\n @Override\n public int hashCode() {\n return (first == null ? 0 : first.hashCode()) ^ (second == null ? 0 : second.hashCode());\n }\n\n @Override\n public String toString() {\n return \"(\" + first + \", \" + second + ')';\n }\n}", "lang_cluster": "Java", "tags": ["brute force"], "code_uid": "d51c3c74d9f12271794c2aceb072a274", "src_uid": "72d7e422a865cc1f85108500bdf2adf2", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Scanner;\n\npublic class A {\n\n public static void main(String[] args) {\n Scanner s = new Scanner(System.in);\n \n StringBuffer c = new StringBuffer(s.nextLine());\n StringBuffer d = new StringBuffer(s.nextLine());\n \n int j = 0;\n for(int i = 0 ; i < d.length() ; i++){\n \n if(c.charAt(j) == d.charAt(i)){\n \n j++;\n }\n }\n \n System.out.println(j+1);\n \n }\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "26847c995c9f8ec418b41b823e7f606f", "src_uid": "f5a907d6d35390b1fb11c8ce247d0252", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\npublic class Stringcheck\n{\n public static void main(String[] args)throws IOException \n {\n \tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st = new StringTokenizer(br.readLine());\n\t\tint n=Integer.parseInt(st.nextToken());\n\t\tint k=Integer.parseInt(st.nextToken());\n\t\tint c=0;\n\t\tSystem.out.print(k*((int)Math.ceil(n/k)+1));\n }\n}", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "c67eda49d151319aef018567833b8a47", "src_uid": "75f3835c969c871a609b978e04476542", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.math.BigInteger;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\t\npublic class Solution \n{\n\tstatic final int MOD = 1000000007;\n\t\n\tpublic static void main(String[] args) throws Exception\n\t{\n\t\tScanner sc = new Scanner(System.in);\n\t\tint i , j;\n\t\tint T = 1;//sc.nextInt();\n\t\touter : for(int tc = 1; tc <= T; tc++)\n\t\t{\n\t\t\tint A[][] = new int[6][2];\n\t\t\tfor(i = 0; i < 6; i++)\n\t\t\t{\n\t\t\t\tA[i][0] = sc.nextInt();\n\t\t\t\tA[i][1] = sc.nextInt();\n\t\t\t}\n\t\t\tSystem.out.println(solve(A) ? \"YES\" : \"NO\");\n\t\t}\n\t\tsc.close();\n }\n\t\n\tstatic boolean solve(int A[][])\n\t{\n\t\tlong a = area(A[0][0] , A[1][0] , A[0][1] , A[1][1]);\n\t\t\n\t\tint x1 = Math.max(A[0][0] , A[2][0]);\n\t\tint y1 = Math.max(A[0][1] , A[2][1]);\n\t\t\n\t\tint x2 = Math.min(A[1][0] , A[3][0]);\n\t\tint y2 = Math.min(A[1][1] , A[3][1]);\n\t\t\n\t\tlong a1 = area(x1 , x2 , y1 , y2);\n\t\tif(x1 > x2 || y1 > y2)\n\t\t\ta1 = 0;\n\t\t\n\t\tint x3 = Math.max(A[0][0] , A[4][0]);\n\t\tint y3 = Math.max(A[0][1] , A[4][1]);\n\t\t\n\t\tint x4 = Math.min(A[1][0] , A[5][0]);\n\t\tint y4 = Math.min(A[1][1] , A[5][1]);\n\t\t\n\t\tlong a2 = area(x3 , x4 , y3 , y4);\n\t\tif(x3 > x4 || y3 > y4)\n\t\t\ta2 = 0;\n\t\t\n\t\tx1 = Math.max(x1 , x3);\n\t\ty1 = Math.max(y1 , y3);\n\t\t\n\t\tx2 = Math.min(x2 , x4);\n\t\ty2 = Math.min(y2 , y4);\n\t\t\n\t\tlong a3 = area(x1 , x2 , y1 , y2);\n\t\tif(x1 > x2 || y1 > y2)\n\t\t\ta3 = 0;\n\t\t\n\t\tif(a > a1 + a2 - a3)\n\t\t\treturn true;\n\t\treturn false;\n\t}\n\t\n\tstatic long area(int x1 , int x2 , int y1 , int y2)\n\t{\n\t\treturn (1L * Math.abs(x1-x2) * Math.abs(y1-y2));\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "geometry"], "code_uid": "dda4a32731f2173cb254a1e813ad6f48", "src_uid": "05c90c1d75d76a522241af6bb6af7781", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*; //PrintWriter\nimport java.math.*; //BigInteger, BigDecimal\nimport java.util.*; //StringTokenizer, ArrayList\n\n\npublic class R287_Div2_C\n{\t\n\tFastReader in;\n\tPrintWriter out;\n\t\n\tpublic static void main(String[] args) {\n\t\tnew R287_Div2_C().run();\n\t}\n\t\n\tvoid run()\n\t{\t\t\n\t\tin = new FastReader(System.in);\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.close();\n\t}\n\t\n\tvoid solve()\n\t{\n\t\tint h = in.nextInt();\n\t\tlong n = in.nextLong();\n\n\t\tlong tot = 0;\n\t\tlong max = 1L << h;\n\t\tint cnt = 0;\n\t\twhile (max >= 1)\n\t\t{\t\t\t\n\t\t\tif (cnt % 2 == 0)\n\t\t\t{\n\t\t\t\tif (n > max / 2)\n\t\t\t\t\ttot += max;\n\t\t\t\telse {tot++; cnt++;}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tif (n <= max / 2)\n\t\t\t\t\ttot += (max);\n\t\t\t\telse {tot++; cnt++;}\n\t\t\t}\t\t\t\n\t\t\tmax /= 2;\n\t\t\tif (n > max) n -= max;\n\t\t}\n\n\t\tout.println(tot - 1);\t\t\n\t}\n\n\t//-----------------------------------------------------\n\tvoid runWithFiles() {\n\t\tin = new FastReader(new File(\"input.txt\"));\n\t\ttry {\n\t\t\tout = new PrintWriter(new File(\"output.txt\"));\n\t\t} \n\t\tcatch (FileNotFoundException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t\tsolve();\n\t\tout.close();\n\t}\n\t\n\tclass FastReader\n\t{\n\t BufferedReader br;\n\t StringTokenizer tokenizer;\n\t \n\t public FastReader(InputStream stream)\n\t {\n\t br = new BufferedReader(new InputStreamReader(stream));\n\t tokenizer = null;\n\t }\n\t\tpublic FastReader(File f) {\n\t\t\ttry {\n\t\t\t\tbr = new BufferedReader(new FileReader(f));\n\t\t\t\ttokenizer = null;\n\t\t\t}\n\t\t\tcatch (FileNotFoundException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\t \n\t private String next() {\n\t while (tokenizer == null || !tokenizer.hasMoreTokens())\n\t try {\n\t \ttokenizer = new StringTokenizer(br.readLine());\n\t }\n\t catch (IOException e) {\n\t throw new RuntimeException(e);\n\t }\n\t return tokenizer.nextToken();\n\t }\n\t\tpublic String nextLine() {\n\t\t\ttry\t{\n\t\t\t\treturn br.readLine();\n\t\t\t}\n\t\t\tcatch(Exception e) {\n\t\t\t\tthrow(new RuntimeException());\n\t\t\t}\n\t\t}\n\n\t int nextInt() {\n\t return Integer.parseInt(next());\n\t }\n\t long nextLong() {\n\t return Long.parseLong(next());\n\t }\n\t double nextDouble() {\n\t return Double.parseDouble(next());\n\t }\t \n\t BigInteger nextBigInteger() {\n\t return new BigInteger(next());\n\t }\n\t BigDecimal nextBigDecimal() {\n\t return new BigDecimal(next());\n\t }\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation", "trees"], "code_uid": "af6fbac09016a64e8c5a06661afdacd6", "src_uid": "3dc25ccb394e2d5ceddc6b3a26cb5781", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.stream.IntStream;\nimport java.util.stream.Stream;\nimport java.util.StringTokenizer;\nimport java.util.Scanner;\nimport java.io.BufferedReader;\nimport java.util.stream.Collectors;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scanner in = new Scanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n ProblemAABlendOfSpringtime solver = new ProblemAABlendOfSpringtime();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class ProblemAABlendOfSpringtime {\n public void solve(int testNumber, Scanner in, PrintWriter out) {\n String s = in.next();\n\n if (s.length() < 3) {\n out.println(\"No\");\n return;\n }\n\n for (int i = 0; i + 2 < s.length(); i++) {\n /*String subString = s.substring(i, i + 3);\n char[] charArray = subString.toCharArray();\n Arrays.sort(charArray);\n String sortedSubString = String.valueOf(charArray);*/\n String sortedSubString = String.join(\"\", s.substring(i, i + 3)\n .chars()\n .sorted()\n .mapToObj(c -> String.valueOf((char) c))\n .collect(Collectors.toCollection(ArrayList::new)));\n if (\"ABC\".equals(sortedSubString)) {\n out.println(\"Yes\");\n return;\n }\n }\n\n out.println(\"No\");\n }\n\n }\n\n static class InputReader {\n BufferedReader br;\n StringTokenizer st;\n\n public InputReader(InputStream inputStream) {\n br = new BufferedReader(new InputStreamReader(inputStream));\n st = new StringTokenizer(\"\");\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["strings", "implementation"], "code_uid": "ad6b98b0f2766ee651212fba29755119", "src_uid": "ba6ff507384570152118e2ab322dd11f", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.Scanner;\npublic class a {\n\n\t\n\t\n\t public static void main(String [] args){\n\n\t\t \n\t Scanner sc=new Scanner(System.in);\n\t\t int x=sc.nextInt();\n\tint a=0;\n\t\t while(x>0){\n\t\t\ta+=x%2;\n\t\t\tx/=2;\n\t\t }\n\t\t System.out.println(a);\n}\n}", "lang_cluster": "Java", "tags": ["bitmasks"], "code_uid": "ed44be444e876617a42bd3579db044a2", "src_uid": "03e4482d53a059134676f431be4c16d2", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package que_a;\n\nimport java.io.*;\nimport java.util.*;\nimport java.math.*;\n\npublic class utkarsh {\n\n InputStream is;\n PrintWriter out;\n \n long mod = (long) (1e9 + 7), inf = (long) (3e18);\n \n void solve() { // n = (i *(p-1) + j)\n int a = ni(), b = ni(), p = ni();\n long x = nl(); mod = p;\n long inva = mp(a, p-2);\n long y = b;\n long ans = 0;\n for(int j = 1; j < p; j++) {\n y = y * inva % mod;\n long i = (j - y + p) % p;\n long n = i * (p-1) + j;\n if(n <= x) {\n ans += (x - n) / (p * (p - 1L)) + 1;\n }\n }\n out.println(ans);\n }\n \n long mp(long b, long e) {\n long r = 1;\n while(e > 0) {\n if((e&1) == 1) r = (r * b) % mod;\n b = (b * b) % mod;\n e >>= 1;\n }\n return r;\n }\n\n //---------- I/O Template ----------\n \n public static void main(String[] args) { new utkarsh().run(); }\n void run() { \n is = System.in;\n out = new PrintWriter(System.out);\n solve();\n out.flush();\n }\n \n byte input[] = new byte[1024];\n int len = 0, ptr = 0;\n \n int readByte() { \n if(ptr >= len) { ptr = 0; \n try { len = is.read(input); } \n catch(IOException e) { throw new InputMismatchException(); } \n if(len <= 0) { return -1; } \n } return input[ptr++];\n }\n boolean isSpaceChar(int c) { return !( c >= 33 && c <= 126 ); }\n int skip() { \n int b = readByte(); \n while(b != -1 && isSpaceChar(b)) { b = readByte(); } \n return b;\n }\n \n char nc() { return (char)skip(); }\n String ns() { \n int b = skip(); \n StringBuilder sb = new StringBuilder(); \n while(!isSpaceChar(b)) { sb.appendCodePoint(b); b = readByte(); } \n return sb.toString();\n }\n String nLine() { \n int b = skip(); \n StringBuilder sb = new StringBuilder(); \n while( !(isSpaceChar(b) && b != ' ') ) { sb.appendCodePoint(b); b = readByte(); } \n return sb.toString();\n }\n int ni() { \n int n = 0, b = readByte(); \n boolean minus = false; \n while(b != -1 && !( (b >= '0' && b <= '9') || b == '-')) { b = readByte(); } \n if(b == '-') { minus = true; b = readByte(); } \n if(b == -1) { return -1; } //no input \n while(b >= '0' && b <= '9') { n = n * 10 + (b - '0'); b = readByte(); } \n return minus ? -n : n;\n }\n long nl() { \n long n = 0L; int b = readByte(); \n boolean minus = false; \n while(b != -1 && !( (b >= '0' && b <= '9') || b == '-')) { b = readByte(); } \n if(b == '-') { minus = true; b = readByte(); } \n while(b >= '0' && b <= '9') { n = n * 10 + (b - '0'); b = readByte(); } \n return minus ? -n : n;\n }\n\n double nd() { return Double.parseDouble(ns()); }\n float nf() { return Float.parseFloat(ns()); }\n int[] na(int n) { \n int a[] = new int[n]; \n for(int i = 0; i < n; i++) { a[i] = ni(); } \n return a;\n }\n char[] ns(int n) { \n char c[] = new char[n]; \n int i, b = skip(); \n for(i = 0; i < n; i++) { \n if(isSpaceChar(b)) { break; } \n c[i] = (char)b; b = readByte(); \n } return i == n ? c : Arrays.copyOf(c,i);\n }\n}", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "2f4e160d660a4fbe6c578a372e95e6fe", "src_uid": "4b9f470e5889da29affae6376f6c9f6a", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.Scanner;\n\n/**\n *\n * @author Raed\n */\npublic class EboneyAndIvory {\n\n /**\n * @param args the command line arguments\n */\n public static void main(String[] args) {\n // TODO code application logic here\n \n Scanner input = new Scanner(System.in);\n \n int a = input.nextInt();\n int b = input.nextInt();\n int c = input.nextInt();\n \n if(b<a){\n \n int temp = a;\n a=b;\n b=temp;\n }\n \n boolean found=false;\n \n if(c%a==0 || c%b==0){\n \n found=true;\n System.out.println(\"YES\");\n }\n \n if(!found){\n int n = (int)Math.floor((double)c/a);\n \n int a2=a;\n for( int i=0;i<n;i++){\n \n int mid = c-a2;\n if(mid%b ==0){\n \n System.out.println(\"YES\");\n found=true;\n break;\n }\n a2=a*(i+1);\n }}\n \n if(!found){\n \n int m = (int)Math.floor((double)c/b);\n int b2=b;\n for( int i=0;i<m;i++){\n \n int mid = c-b2;\n if(mid%a ==0){\n \n System.out.println(\"YES\");\n found=true;\n break;\n }\n b2=b*(i+1);\n }\n \n }\n if(!found){\n System.out.println(\"NO\");\n }\n \n }\n \n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "number theory"], "code_uid": "aa3450d4a06d531892c0d2ceb6cad151", "src_uid": "e66ecb0021a34042885442b336f3d911", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\nimport java.lang.*;\n \nimport static java.lang.Math.*;\n\npublic class Main implements Runnable {\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private SpaceCharFilter filter;\n private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n \n public int read() {\n if (numChars==-1) \n throw new InputMismatchException();\n \n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n }\n catch (IOException e) {\n throw new InputMismatchException();\n }\n \n if(numChars <= 0) \n return -1;\n }\n return buf[curChar++];\n }\n \n public String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n }\n catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n public int nextInt() {\n int c = read();\n \n while(isSpaceChar(c)) \n c = read();\n \n int sgn = 1;\n \n if (c == '-') {\n sgn = -1;\n c = read();\n }\n \n int res = 0;\n do {\n if(c<'0'||c>'9') \n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c)); \n \n return res * sgn;\n }\n \n public long nextLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n \n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n return res * sgn;\n }\n \n public double nextDouble() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n \n public String readString() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } \n while (!isSpaceChar(c));\n \n return res.toString();\n }\n \n public boolean isSpaceChar(int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n \n public String next() {\n return readString();\n }\n \n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n }\n public static void main(String args[]) throws Exception {\n new Thread(null, new Main(),\"Main\",1<<26).start();\n }\n long checkIntersection(long l1, long r1, long l2, long r2) {\n if(l2 > r1 || l1 > r2)\n return 0;\n return min(r1, r2) - max(l1, l2) + 1L;\n }\n long gcd(long a, long b) {\n if(b == 0)\n return a;\n\n return gcd(b, a % b);\n }\n public void run() {\n InputReader sc = new InputReader(System.in);\n PrintWriter w = new PrintWriter(System.out);\n\n long la = sc.nextLong();\n long ra = sc.nextLong();\n long ta = sc.nextLong();\n\n long lb = sc.nextLong();\n long rb = sc.nextLong();\n long tb = sc.nextLong();\n\n if(lb > la) {\n long tempL = la;\n long tempR = ra;\n long tempT = ta;\n\n la = lb;\n ra = rb;\n ta = tb;\n\n lb = tempL;\n rb = tempR;\n tb = tempT;\n }\n\n long ans = 0;\n if(la == lb) {\n ans = min(ra, rb) - la + 1L;\n }\n else if((la - lb) % gcd(ta, tb) == 0) {\n ans = min(ra - la + 1L, rb - lb + 1L);\n }\n else {\n long step1 = ((la - lb) / gcd(ta, tb)) * gcd(ta, tb);\n long lb1 = lb + step1;\n long rb1 = rb + step1;\n\n ans = max(ans, checkIntersection(lb1, rb1, la, ra));\n\n long step2 = step1 + gcd(ta, tb);\n long lb2 = lb + step2;\n long rb2 = rb + step2;\n\n ans = max(ans, checkIntersection(lb2, rb2, la, ra));\n } \n\n w.print(ans);\n\n w.close();\n }\n}", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "6c0211b3964b877369bb0cee2c79152b", "src_uid": "faa75751c05c3ff919ddd148c6784910", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.HashSet;\nimport java.io.FilterInputStream;\nimport java.io.BufferedInputStream;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Jenish\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n ScanReader in = new ScanReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n CGarland solver = new CGarland();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class CGarland {\n int[] arr;\n int n;\n long[][][][] dp;\n\n long findIT(int index, int odd, int even, int parity) {\n if (odd < 0) return Integer.MAX_VALUE / 2;\n if (even < 0) return Integer.MAX_VALUE / 2;\n if (index == n) return 0;\n\n if (dp[index][odd][even][parity] != -1) return dp[index][odd][even][parity];\n if (arr[index] != 0) {\n int pp = (arr[index] % 2) == parity ? 0 : 1;\n return dp[index][odd][even][parity] = pp + findIT(index + 1, odd, even, arr[index] % 2);\n } else {\n long ans = Integer.MAX_VALUE / 2;\n {\n int pp = (0) == parity ? 0 : 1;\n ans = Math.min(ans, pp + findIT(index + 1, odd, even - 1, 0));\n }\n {\n int pp = (1) == parity ? 0 : 1;\n ans = Math.min(ans, pp + findIT(index + 1, odd - 1, even, 1));\n }\n return dp[index][odd][even][parity] = ans;\n }\n\n }\n\n public void solve(int testNumber, ScanReader in, PrintWriter out) {\n n = in.scanInt();\n arr = new int[n];\n in.scanInt(arr);\n boolean done[] = new boolean[n + 1];\n HashSet<Integer> remaining = new HashSet<>();\n\n\n for (int i = 0; i < n; i++) if (arr[i] != 0) done[arr[i]] = true;\n for (int i = 1; i <= n; i++) if (!done[i]) remaining.add(i);\n\n\n {\n dp = new long[n + 5][n + 5][n + 5][2];\n for (int i = 0; i < n + 5; i++) {\n for (int j = 0; j < n + 5; j++) {\n for (int k = 0; k < n + 5; k++) {\n dp[i][j][k][0] = dp[i][j][k][1] = -1;\n }\n }\n }\n }\n\n int even = 0;\n int odd = 0;\n for (int e : remaining) {\n if (e % 2 == 0) even++;\n else odd++;\n }\n\n\n long ans;\n if (arr[0] == 0) {\n ans = Math.min(findIT(1, odd, even - 1, 0), findIT(1, odd - 1, even, 1));\n } else {\n ans = findIT(1, odd, even, arr[0] % 2);\n }\n\n\n out.println(ans);\n }\n\n }\n\n static class ScanReader {\n private byte[] buf = new byte[4 * 1024];\n private int INDEX;\n private BufferedInputStream in;\n private int TOTAL;\n\n public ScanReader(InputStream inputStream) {\n in = new BufferedInputStream(inputStream);\n }\n\n private int scan() {\n if (INDEX >= TOTAL) {\n INDEX = 0;\n try {\n TOTAL = in.read(buf);\n } catch (Exception e) {\n e.printStackTrace();\n }\n if (TOTAL <= 0) return -1;\n }\n return buf[INDEX++];\n }\n\n public int scanInt() {\n int I = 0;\n int n = scan();\n while (isWhiteSpace(n)) n = scan();\n int neg = 1;\n if (n == '-') {\n neg = -1;\n n = scan();\n }\n while (!isWhiteSpace(n)) {\n if (n >= '0' && n <= '9') {\n I *= 10;\n I += n - '0';\n n = scan();\n }\n }\n return neg * I;\n }\n\n private boolean isWhiteSpace(int n) {\n if (n == ' ' || n == '\\n' || n == '\\r' || n == '\\t' || n == -1) return true;\n else return false;\n }\n\n public void scanInt(int[] A) {\n for (int i = 0; i < A.length; i++) A[i] = scanInt();\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "00c8d1774db6809648fa0b914e9d28b7", "src_uid": "90db6b6548512acfc3da162144169dba", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\r\nimport java.util.*;\r\n\r\n\r\n\r\nimport java.math.*;\r\npublic class Solution{\r\n\tpublic static void main(String[] args) {\r\n\t TaskA solver = new TaskA();\r\n\t initFac(1000001);\r\n\t \r\n//\t int t = in.nextInt();\r\n//\t for (int i = 1; i <= t ; i++) {\r\n//\t solver.solve(i, in, out);\r\n//\t } \r\n//\t \r\n\t solver.solve(1, in, out); \r\n\t \r\n\t out.flush();\r\n\t out.close();\r\n\t }\r\n\tstatic ArrayList<Integer>[] graph ;static int[]child;static long k; static int m;\r\n\t static class TaskA {\r\n\t public void solve(int testNumber, InputReader in, PrintWriter out) {\r\n\t \t k= in.nextLong();\r\n\t \t long pow=fpow(2,k,Long.MAX_VALUE)-2;\r\n\t \t long num=fpow(4L,pow,mod)%mod;\r\n\t \t num*=6L;\r\n\t \t num%=mod;\r\n\t \t println(num);\r\n\t }\r\n\t }\r\n\t static int min(int x,int y) {\r\n\t\t return Math.min(x, y);\r\n\t }\r\n\t \r\n\t static int max(int x,int y) {\r\n\t\t return Math.max(x, y);\r\n\t }\r\n\t \r\n\t static long min(long x,long y) {\r\n\t\t return Math.min(x, y);\r\n\t }\r\n\t static long max(long x,long y) {\r\n\t\t return Math.max(x, y);\r\n\t }\r\n\t static int abs(int x,int y) {\r\n\t\t return Math.abs(x-y);\r\n\t }\r\n\t static long abs(long x,long y) {\r\n\t\t return Math.abs(x-y);\r\n\t }\r\n\t static void Eularianbfs(int v,int[]cur,int k,ArrayList<Integer>path) {\r\n\t\t while (cur[v] < k) {\r\n\t\t int u = cur[v]++;\r\n\t\t Eularianbfs(u,cur,k,path);\r\n\t\t path.add(u);\r\n\t\t }\r\n\t}\r\n\r\n\t static long fpow(long b, long x, long mod) {\r\n\t if (x == 0) return 1;\r\n\t if (x == 1) return b;\r\n\t if (x % 2 == 0) return fpow(b * b % mod, x / 2, mod) % mod;\r\n\t \r\n\t return b * fpow(b * b % mod, x / 2, mod) % mod;\r\n\t }\r\n\t static long[] fac;\r\n\t static long mod = 1_000_000_007;\r\n\t static void initFac(long n) {\r\n\t fac = new long[(int)n + 1];\r\n\t fac[0] = 1;\r\n\t for (int i = 1; i <= n; i++) {\r\n\t fac[i] = (fac[i - 1] * i) % mod;\r\n\t }\r\n\t }\r\n\t static int count(char []arr,char x) {\r\n\t\t int c=0;\r\n\t\t for(int i=0;i<arr.length;i++) {\r\n\t\t\t if(arr[i]==x) {\r\n\t\t\t\t c++;\r\n\t\t\t }\r\n\t\t }\r\n\t\t return c;\r\n\t }\r\n\t static int count(int []arr,int x) {\r\n\t\t int c=0;\r\n\t\t for(int i=0;i<arr.length;i++) {\r\n\t\t\t if(arr[i]==x) {\r\n\t\t\t\t c++;\r\n\t\t\t }\r\n\t\t }\r\n\t\t return c;\r\n\t }\r\n\t static boolean[]seive(int n){\r\n\t\t\tboolean[]b=new boolean[n+1];\r\n\t\t\t for (int i = 2; i <= n; i++)\r\n\t\t b[i] = true;\r\n\t\t\t \r\n\t\t\tfor(int i=2;i*i<=n;i++) {\r\n\t\t\t\tif(b[i]) {\r\n\t\t\t\t\tfor(int j=i*i;j<=n;j+=i) {\r\n\t\t\t\t\t\tb[j]=false;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\treturn b;\r\n\t\t}\r\n\t static int[] query(int l,int r) {\r\n\t\t\tSystem.out.println(\"? \"+l+\" \"+r);\r\n\t\t\tSystem.out.print (\"\\n\");System.out.flush();\r\n\t\t\tint[]arr=new int[r-l+1];\r\n\t\t\tfor(int i=0;i<r-l+1;i++) {\r\n\t\t\t\tarr[i]=in.nextInt();\r\n\t\t\t}\r\n\t\t\treturn arr;\r\n\t\t}\r\n\r\n\t static long[]presum(long[]arr){\r\n\t\t int n= arr.length;\r\n\t\t long[]pre=new long[n];\r\n\t\t for(int i=0;i<n;i++) {\r\n\t\t\t if(i>0) {\r\n\t\t\t\t pre[i]=pre[i-1];\r\n\t\t\t }\r\n\t\t\t pre[i]+=arr[i];\r\n\t\t }\r\n\t\t return pre;\r\n\t }\r\n\t static int max(int[]arr) {\r\n\t\t int max=Integer.MIN_VALUE;\r\n\t\t for(int i=0;i<arr.length;i++) {\r\n\t\t\t max=Math.max(max, arr[i]);\r\n\t\t }\r\n\t\t return max;\r\n\t }\r\n\t static int min(int[]arr) {\r\n\t\t int min=Integer.MAX_VALUE;\r\n\t\t for(int i=0;i<arr.length;i++) {\r\n\t\t\t min=Math.min(min, arr[i]);\r\n\t\t }\r\n\t\t return min;\r\n\t }\r\n\t static int ceil(int a,int b) {\r\n\t\t int ans=a/b;if(a%b!=0) {\r\n\t\t\t ans++;\r\n\t\t }\r\n\t\t return ans;\r\n\t }\r\n\t\r\n\t\r\n\tstatic long sum(int[]arr) {\r\n\t\tlong s=0;\r\n\t\tfor(int x:arr) {\r\n\t\t\ts+=x;\r\n\t\t}\r\n\t\treturn s;\r\n\t}\r\n\tstatic long sum(long[]arr) {\r\n\t\tlong s=0;\r\n\t\tfor(long x:arr) {\r\n\t\t\ts+=x;\r\n\t\t}\r\n\t\treturn s;\r\n\t}\r\n\t static int gcd(int a, int b)\r\n\t {\r\n\t if (b == 0)\r\n\t return a;\r\n\t return gcd(b, a % b);\r\n\t }\r\n\t static void sort(int[] a) {\r\n\t ArrayList<Integer> q = new ArrayList<>();\r\n\t for (int i : a) q.add(i);\r\n\t Collections.sort(q);\r\n\t for (int i = 0; i < a.length; i++) a[i] = q.get(i);\r\n\t }\r\n\t static void sort(long[] a) {\r\n\t ArrayList<Long> q = new ArrayList<>();\r\n\t for (long i : a) q.add(i);\r\n\t Collections.sort(q);\r\n\t for (int i = 0; i < a.length; i++) a[i] = q.get(i);\r\n\t }\r\n\t static void println(int[][]arr) {\r\n\t\t for(int i=0;i<arr.length;i++) {\r\n\t\t\t for(int j=0;j<arr[0].length;j++) {\r\n\t\t\t\t print(arr[i][j]+\" \");\r\n\t\t\t }\r\n\t\t\t print(\"\\n\");\r\n\t\t }\r\n\t }\r\n\t static void println(long[][]arr) {\r\n\t\t for(int i=0;i<arr.length;i++) {\r\n\t\t\t for(int j=0;j<arr[0].length;j++) {\r\n\t\t\t\t print(arr[i][j]+\" \");\r\n\t\t\t }\r\n\t\t\t print(\"\\n\");\r\n\t\t }\r\n\t }\r\n\t static void println(int[]arr){\r\n\t\t for(int i=0;i<arr.length;i++) {\r\n\t\t\t print(arr[i]+\" \");\r\n\t\t }\r\n\t\t print(\"\\n\");\r\n\t }\r\n\t static void println(long[]arr){\r\n\t\t for(int i=0;i<arr.length;i++) {\r\n\t\t\t print(arr[i]+\" \");\r\n\t\t }\r\n\t\t print(\"\\n\");\r\n\t }\r\n\t static void println(char x) {\r\n\t\t out.println(x);\r\n\t }\r\n\t static long[]input(long n){\r\n\t\t long[]arr=new long[(int)n];\r\n\t\t for(int i=0;i<n;i++) {\r\n\t\t\t arr[i]=in.nextInt();\r\n\t\t }\r\n\t\t return arr;\r\n\t }\r\n\t static int[]input(int n){\r\n\t\t int[]arr=new int[n];\r\n\t\t for(int i=0;i<n;i++) {\r\n\t\t\t arr[i]=in.nextInt();\r\n\t\t }\r\n\t\t return arr;\r\n\t }\r\n\t static Character Char(int x) {\r\n\t\t\t return Character.toString((char)x).charAt(0);\r\n\t }\r\n\t static int[]input(){\r\n\t\t int n= in.nextInt();\r\n\t\t int[]arr=new int[(int)n];\r\n\t\t for(int i=0;i<n;i++) {\r\n\t\t\t arr[i]=in.nextInt();\r\n\t\t }\r\n\t\t return arr;\r\n\t }\r\n\t////////////////////////////////////////////////////////\r\n\t static class Pair implements Comparable<Pair>{\r\n\t\t int first;\r\n\t\t int second;int third;\r\n\t\t Pair(int x, int y)\r\n\t\t {\r\n\t\t this.first = x;\r\n\t\t this.second = y;\r\n\t\t \r\n\t\t }\r\n\t\t public int compareTo(Pair p) {\r\n\t\t \treturn Integer.compare(second, p.second);\r\n\t\t }\r\n\t\t}\r\n\t static void sortS(Pair arr[])\r\n\t {\r\n\t Arrays.sort(arr, new Comparator<Pair>() {\r\n\t @Override public int compare(Pair p1, Pair p2)\r\n\t {\r\n\t \tif(p1.second==p2.second) {return p1.first-p2.first;}\r\n\t return (p1.second - p2.second); \r\n\t \r\n\t }\r\n\t });\r\n\t }\r\n\t static void sortF(Pair arr[])\r\n\t {\r\n\t Arrays.sort(arr, new Comparator<Pair>() {\r\n\t @Override public int compare(Pair p1, Pair p2)\r\n\t {\r\n\t \tif(p1.first==p2.first) {return p1.second-p2.second;}\r\n\t return (p1.first - p2.first); \r\n\t }\r\n\t });\r\n\t }\r\n\r\n /////////////////////////////////////////////////////////////\r\n\tstatic InputStream inputStream = System.in;\r\n static OutputStream outputStream = System.out;\r\n static InputReader in = new InputReader(inputStream);\r\n static PrintWriter out = new PrintWriter(outputStream);\r\n static void println(long c) {\r\n \tout.println(c);\r\n }\r\n static void print(long c) {\r\n \tout.print(c);\r\n }\r\n static void print(int c) {\r\n\t\t out.print(c);\r\n\t }\r\n\t static void println(int x) {\r\n\t\t out.println(x);\r\n\t }\r\n\t static void print(String s) {\r\n\t\t out.print(s);\r\n\t }\r\n\t static void println(String s) {\r\n\t\t out.println(s);\r\n\t }\r\n\t static void println(boolean b) {\r\n\t\t out.println(b);\r\n\t }\r\n\r\n static class InputReader {\r\n public BufferedReader reader;\r\n public StringTokenizer tokenizer;\r\n\r\n public InputReader(InputStream stream) {\r\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\r\n tokenizer = null;\r\n }\r\n\r\n public String next() {\r\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\r\n try {\r\n tokenizer = new StringTokenizer(reader.readLine());\r\n } catch (IOException e) {\r\n throw new RuntimeException(e);\r\n }\r\n }\r\n return tokenizer.nextToken();\r\n }\r\n\r\n public int nextInt() {\r\n return Integer.parseInt(next());\r\n }\r\n public long nextLong() {\r\n \t return Long.parseLong(next());\r\n }\r\n }\r\n}", "lang_cluster": "Java", "tags": ["math", "combinatorics"], "code_uid": "2790dad402154064e0b25239eeab394c", "src_uid": "5144b9b281ea4087d8334d91c3c8bda4", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class BusGame {\n public enum Player {\n Ciel {\n @Override\n public Player nextPlayer() {\n return Hanako;\n }\n },\n Hanako {\n @Override \n public Player nextPlayer() {\n return Ciel;\n }\n };\n\n public abstract Player nextPlayer();\n }\n\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int hundredsCount = scanner.nextInt();\n int tensCount = scanner.nextInt();\n\n int hundreds = 100 * hundredsCount;\n int tens = 10 * tensCount;\n\n Player currentPlayer = Player.Ciel;\n Player currentWinner = Player.Hanako;\n\n boolean isLastTurn = false;\n\n do {\n int remainingAmount = 220;\n\n switch (currentPlayer) {\n case Ciel:\n \n if (hundreds >= 200) {\n remainingAmount = remainingAmount - 200;\n hundreds = hundreds - 200;\n } else if (hundreds >= 100) {\n remainingAmount = remainingAmount - 100;\n hundreds = hundreds - 100;\n }\n\n if (tens - remainingAmount >= 0) {\n tens = tens - remainingAmount;\n remainingAmount = 0;\n }\n \n break;\n\n case Hanako:\n if (tens >= 220) {\n remainingAmount = 0;\n tens = tens - 220;\n } else if ( hundreds >= 100 && tens >= 120 ) {\n hundreds = hundreds - 100;\n tens = tens - 120;\n remainingAmount = 0;\n } else if ( hundreds >= 200 && tens >= 20 ) {\n hundreds = hundreds - 200;\n tens = tens - 20;\n remainingAmount = 0;\n }\n\n break;\n }\n\n\n if (remainingAmount == 0) {\n currentWinner = currentPlayer;\n currentPlayer = currentPlayer.nextPlayer();\n remainingAmount = 220;\n isLastTurn = false;\n } else {\n isLastTurn = true;\n }\n\n\n } while( !isLastTurn );\n\n System.out.println(currentWinner.toString());\n }\n}", "lang_cluster": "Java", "tags": ["greedy"], "code_uid": "6ade1b8ed24e73cb22db1169b3af9c2d", "src_uid": "8ffee18bbc4bb281027f91193002b7f5", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\n\npublic class C {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tMap<String, Integer> X = new HashMap<String, Integer>();\n\t\tint ber = -1;\n\t\tfinal int[] points = new int[4];\n\t\tfinal int[] scored = new int[4];\n\t\tfinal int[] let_in = new int[4];\n\t\tfinal int[] count = new int[4];\n\t\tfinal String[] names = new String[4];\n\t\tfor(int i=0; i<5; i++) {\n\t\t\tString t1 = in.next();\n\t\t\tString t2 = in.next();\n\t\t\tString[] scores = in.next().split(\":\");\n\t\t\t\n\t\t\tif(!X.containsKey(t1)) X.put(t1, X.size());\n\t\t\tif(!X.containsKey(t2)) X.put(t2, X.size());\n\t\t\tint x1 = X.get(t1);\n\t\t\tint x2 = X.get(t2);\n\t\t\tnames[x1] = t1;\n\t\t\tnames[x2] = t2;\n\t\t\tif(t1.equals(\"BERLAND\")) ber = x1;\n\t\t\tif(t2.equals(\"BERLAND\")) ber = x2;\n\t\t\tint s1 = Integer.parseInt(scores[0]);\n\t\t\tint s2 = Integer.parseInt(scores[1]);\n\t\t\t\n\t\t\tcount[x1]++; count[x2]++;\n\t\t\tif(s1 > s2) { points[x1]+=3; }\n\t\t\telse if(s1 == s2) { points[x1]++; points[x2]++; }\n\t\t\telse { points[x2]+=3; }\n\t\t\tscored[x1] += s1; scored[x2]+=s2;\n\t\t\tlet_in[x1] += s2; let_in[x2]+=s1;\n\t\t\t//System.out.println(t1+\" \"+t2+\" \"+x1+\" \"+x2+\" \"+Arrays.toString(points));\n\t\t}\n\t\tint opp = -1;\n\t\tfor(int i=0; i<4; i++)\n\t\t\tif(count[i]==2 && i!=ber)\n\t\t\t\topp = i;\n\t\t\n\t\tboolean ok = false;\n\t\tint best_x = 10000;\n\t\tint best_y = 0;\n\t\tpoints[ber]+=3;\n\t\tfor(int x=0; x<100; x++)\n\t\t\tfor(int y=0; y<x; y++) {\n\t\t\t\tfinal int[] new_scored = new int[5];\n\t\t\t\tfinal int[] new_let_in = new int[5];\n\t\t\t\tfor(int i=0; i<4; i++) {\n\t\t\t\t\tnew_scored[i] = scored[i];\n\t\t\t\t\tnew_let_in[i] = let_in[i];\n\t\t\t\t}\n\t\t\t\tnew_scored[ber] += x; new_scored[opp] += y;\n\t\t\t\tnew_let_in[ber] += y; new_let_in[opp] += x;\n\t\t\t\t\n\t\t\t\tInteger[] sort = new Integer[4];\n\t\t\t\tfor(int i=0; i<4; i++) sort[i] = i;\n\t\t\t\tArrays.sort(sort, new Comparator<Integer>() {\n\t\t\t\t\tpublic int compare(Integer A, Integer B) {\n\t\t\t\t\t\tif(points[A] > points[B]) return -1;\n\t\t\t\t\t\tif(points[A] < points[B]) return 1;\n\t\t\t\t\t\t\n\t\t\t\t\t\tint s1 = new_scored[A]-new_let_in[A];\n\t\t\t\t\t\tint s2 = new_scored[B]-new_let_in[B];\n\t\t\t\t\t\tif(s1 > s2) return -1;\n\t\t\t\t\t\tif(s1 < s2) return 1;\n\t\t\t\t\t\t\n\t\t\t\t\t\tif(new_scored[A] > new_scored[B]) return -1;\n\t\t\t\t\t\tif(new_scored[A] < new_scored[B]) return 1;\n\t\t\t\t\t\t\n\t\t\t\t\t\treturn (names[A].compareTo(names[B]));\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t\tif(ber == sort[0] || ber==sort[1]) { // OK\n\t\t\t\t\tok = true;\n\t\t\t\t\tint diff = x-y;\n\t\t\t\t\tint best_diff = best_x-best_y;\n\t\t\t\t\tif(diff < best_diff || (diff==best_diff && y < best_y)) {\n\t\t\t\t\t\tbest_x = x;\n\t\t\t\t\t\tbest_y = y;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\n\t\tif(!ok)\n\t\t\tSystem.out.println(\"IMPOSSIBLE\");\n\t\telse System.out.println(best_x+\":\"+best_y);\n\t\t\n\t\t/*\n\t\tint more = 0;\n\t\tfor(int i=0; i<5; i++)\n\t\t\tif(i != ber && points[i]>points[ber])\n\t\t\t\tmore++;\n\t\tif(more >= 2) { System.out.println(\"IMPOSSIBLE\"); return; }\n\t\t\n\t\tList<Integer> diff = new ArrayList<Integer>();\n\t\tint ix = 0;\n\t\tfor(int i=0; i<5; i++)\n\t\t\tif(points[i]==points[ber] && i!=ber)\n\t\t\t\tdiff.add(scored[i]-let_in[i]);\n\t\tCollections.sort(diff);\n\t\t\n\t\tint need = more==1 ? diff.get(diff.size()-1) : diff.get(diff.size()-2);\n\t\tint diff_needed = need - (scored[ber]-let_in[ber]);\n\t\t\n\t\tif(more == 0 && diff.get(\n\t\t*/\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "6122bc4d3fd429d3af2013a2235a52b9", "src_uid": "5033d51c67b7ae0b1a2d9fd292fdced1", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n static PrintWriter pw;\n static Scanner sc;\n static int[] dp;\n static ArrayList<Integer>[] adj;\n static boolean[] visit;\n static int[] arr;\n static long ceildiv(long x, long y) { return (x + y - 1) / y; }\n static int mod(long x, int m) { return (int) ((x % m + m) % m); }\n public static long gcd(long x, long y) {return y == 0 ? x : gcd(y, x % y);}\n public static void main(String[] args) throws Exception {\n sc = new Scanner(System.in);\n pw = new PrintWriter(System.out);\n long n=sc.nextLong(), b=sc.nextLong();\n HashMap<Long, Integer> prime=new HashMap<Long, Integer>();\n for(int i=2; i<=b/i; i++){\n if(b%i==0){\n int pow=0;\n while(b%i==0){\n pow++;\n b/=i;\n }\n prime.put(i*1l, pow);\n }\n }\n if(b!=1)\n prime.put(b, 1);\n HashMap<Long, Long> ans=new HashMap<Long, Long>();\n for(Map.Entry<Long, Integer> ent: prime.entrySet())\n ans.put(ent.getKey(), num(n, ent.getKey())/ent.getValue());\n long res=Long.MAX_VALUE;\n for(long x: ans.values())\n res=Math.min(x, res);\n pw.println(res);\n pw.close();\n }\n static long num(long n, long b){\n long ans=0;\n long temp=b;\n while(temp<=n){\n ans+=n/temp;\n if(((long)2e18)/temp>b)\n temp*=b;\n else\n break;\n }\n return ans;\n }\n static void printArr(int[] arr) {\n for (int i = 0; i < arr.length - 1; i++)\n pw.print(arr[i] + \" \");\n pw.println(arr[arr.length - 1]);\n }\n static void printArr(long[] arr) {\n for (int i = 0; i < arr.length - 1; i++)\n pw.print(arr[i] + \" \");\n pw.println(arr[arr.length - 1]);\n }\n static void printArr(Integer[] arr) {\n for (int i = 0; i < arr.length; i++)\n pw.print(arr[i] + \" \");\n pw.println();\n }\n static void printArr(char[] arr) {\n for (int i = 0; i < arr.length; i++)\n pw.print(arr[i]);\n pw.println();\n }\n static void printArr(ArrayList list) {\n for (int i = 0; i < list.size(); i++)\n pw.print(list.get(i) + \" \");\n pw.println();\n }\n static class Scanner {\n StringTokenizer st;\n BufferedReader br;\n public Scanner(InputStream s) {\n br = new BufferedReader(new InputStreamReader(s));\n }\n\n public Scanner(FileReader r) {\n br = new BufferedReader(r);\n }\n\n public String next() throws IOException {\n while (st == null || !st.hasMoreTokens())\n st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n\n public int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n public long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n public String nextLine() throws IOException {\n return br.readLine();\n }\n\n public double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n\n public int[] nextArr(int n) throws IOException {\n int[] arr = new int[n];\n for (int i = 0; i < arr.length; i++)\n arr[i] = nextInt();\n return arr;\n }\n public Integer[] nextsort(int n) throws IOException{\n Integer[] arr=new Integer[n];\n for(int i=0; i<n; i++)\n arr[i]=nextInt();\n return arr;\n }\n public Pair nextPair() throws IOException{\n return new Pair(nextInt(), nextInt());\n }\n public Pair[] nextPairArr(int n) throws IOException{\n Pair[] arr=new Pair[n];\n for(int i=0; i<n; i++)\n arr[i]=new Pair(nextInt(), nextInt());\n return arr;\n }\n public boolean ready() throws IOException {\n return br.ready();\n }\n }\n static class Pair implements Comparable<Pair>{\n long x;\n long y;\n public Pair(long x, long y) {\n this.x=x;\n this.y=y;\n }\n public int hashCode() {\n return (int)(this.x*1000+this.y);\n }\n public int compareTo(Pair p){\n return (int)(this.x-p.x);\n }\n public boolean equals(Object obj) {\n if (obj == null) {\n return false;\n }\n if (this.getClass() != obj.getClass()) {\n return false;\n }\n Pair p = (Pair) obj;\n return this.x==p.x && this.y==p.y;\n }\n public boolean equal(Pair p){\n if(this.x==p.x)\n return this.y==p.y;\n if(this.x==p.y)\n return this.y==p.x;\n else\n return false;\n }\n public Pair clone(){\n return new Pair(x, y);\n }\n public String toString(){\n return this.x+\" \"+this.y;\n }\n public void add(Pair p){\n x+=p.x;\n y+=p.y;\n }\n public Pair multiply(int x){\n return new Pair(x*this.x, x*this.y);\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "implementation", "number theory"], "code_uid": "6f2456bcb1e47fa14343c2c3428071b9", "src_uid": "491748694c1a53771be69c212a5e0e25", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class WordCorrection {\n public static void main(String [] args) {\n Scanner input = new Scanner(System.in);\n int n = input.nextInt();\n StringBuilder word = new StringBuilder(input.next());\n\n for(int i = 0; i < word.length(); i++) {\n if(isVowel(word.charAt(i)) && i != word.length() - 1 && isVowel(word.charAt(i + 1))) {\n word.deleteCharAt(i + 1);\n i = -1;\n }\n }\n\n System.out.println(word);\n }\n\n public static boolean isVowel(char character) {\n return \"aeiouy\".contains(String.valueOf(character));\n }\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "bc859e66e44c9122538199edee71febe", "src_uid": "63a4a5795d94f698b0912bb8d4cdf690", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "\nimport java.util.Scanner;\n\n/*\n * To change this license header, choose License Headers in Project Properties.\n * To change this template file, choose Tools | Templates\n * and open the template in the editor.\n */\n\n/**\n *\n * @author mohammad\n */\npublic class nnn {\n public static void main(String[] args) {\n Scanner s1=new Scanner(System.in);\n String num1=s1.next();\n String num2=s1.next();\n String x=\"\";\n for(int i=0;i<num1.length();i++){\n if(num1.charAt(i)=='0'&&num2.charAt(i)=='0'){\n x=x+num1.charAt(i);\n }\n else {\n if (num1.charAt(i)=='1'&&num2.charAt(i)=='0'){\n x=x+\"1\"; \n }\n else{\n if(num1.charAt(i)=='0'&&num2.charAt(i)=='1'){\n x=x+\"1\"; \n }\n else {\n if(num1.charAt(i)=='1'&&num2.charAt(i)=='1'){\n x=x+\"0\";\n }\n }\n }\n }\n }\n System.out.println(x);\n }\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "a6524f3414412547792161015b5b89b4", "src_uid": "3714b7596a6b48ca5b7a346f60d90549", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package com.company;\n\nimport java.util.Scanner;\n\n\n\npublic class BB {\n \n public static void main(String[] args){\n Scanner in = new Scanner(System.in);\n int min = Integer.MAX_VALUE;\n long max = Integer.MIN_VALUE;\n long p = in.nextLong();\n long y = in.nextLong();\n\n for(long i = y; i>p; i--){\n boolean ok = true;\n for(long j = 2; j*j<=y && j<=p && ok; j++){\n if(i%j == 0){\n ok = false;\n }\n }\n if(ok){\n System.out.println(i);\n return;\n }\n }\n\n //else{\n System.out.println(-1);\n\n\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "number theory"], "code_uid": "bf7042026533562001d5fd2201533373", "src_uid": "b533203f488fa4caf105f3f46dd5844d", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\npublic class x\n{\n public static void main(String args[])\n {\n Scanner sc = new Scanner(System.in);\n \n int n = sc.nextInt();\n \n \n String s = sc.next();\n int i=0,temp=0,cnt=0;\n char ch[] = s.toCharArray();\n \n if(s.length()==n)\n {\n \n for(i=0;i<s.length()-1;i++)\n {\n if(ch[i]==ch[i+1])\n {\n cnt++;\n }\n }\n System.out.println(cnt);\n }\n }\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "ec86de60c929ea6fe68582470d964d53", "src_uid": "d561436e2ddc9074b98ebbe49b9e27b8", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class aaaaaaaa {\n\tpublic void run() throws Exception {\n\t\tFastReader file = new FastReader();\n\t\t\tlong x = file.nextLong();\n\t\t\tint len = (\"\" + x).length();\n\t\t\tif (len == 1) System.out.println(x);\n\t\t\telse {\n\t\t\t\tString w = \"\" + x;\n\t\t\t\tlong prod = dig(x);\n\t\t\t\tfor (int i= 0; i < w.length(); i++) {\n\t\t\t\t\tif (w.charAt(i) == '0') continue;\n\t\t\t\t\tw = w.substring(0, i) + (Integer.parseInt(w.substring(i,i+1))-1);\n\t\t\t\t\tfor (int j = i + 1; j < (\"\" + x).length(); j++) w += \"9\";\n\t\t\t\t\tlong temp = Long.parseLong(w);\n\t\t\t\t\tprod = Math.max(prod, dig(temp));\n\t\t\t\t\tw = \"\" + x;\n\t\t\t\t}\n\t\t\t\tSystem.out.println(prod);\n\t\t\t}\n\t}\n\t\n\tlong dig(long x) {\n\t\tlong pr = 1l;\n\t\twhile (x > 0) {\n\t\t\tpr *= x % 10;\n\t\t\tx /= 10;\n\t\t}\n\t\treturn pr;\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tnew aaaaaaaa().run();\n\t}\n\n\tstatic class FastReader {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tpublic FastReader() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tString next() {\n\t\t\twhile (st == null || !st.hasMoreElements()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tString nextLine() {\n\t\t\tString str = \"\";\n\t\t\ttry {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn str;\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "number theory"], "code_uid": "4298af321aa62ecd76816b315d6d0f39", "src_uid": "38690bd32e7d0b314f701f138ce19dfb", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Scanner;\n\n\npublic class A {\n\n\tpublic static void main(String[] args){\n\t\tScanner in=new Scanner(System.in);\n\t\t\n\t\tString[][] mat=new String[3][3];\n\t\tfor(int i=0;i<3;i++){\n\t\t\tString s=in.nextLine();\n\t\t\tfor(int j=0;j<3;j++){\n\t\t\t\tmat[i][j]=s.substring(j,j+1);\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tin.close();\n\t\t\n\t\tif(!mat[1][0].contains(mat[1][2])){\n\t\t\tSystem.out.println(\"NO\");\n\t\t\treturn;\n\t\t\t}\n\t\tfor(int i=0;i<3;i++){\n\t\t\tif(!mat[0][i].contains(mat[2][2-i])){\n\t\t\t\tSystem.out.println(\"NO\");\n\t\t\t\treturn;\n\t\t\t\t}\n\t\t}\n\t\tSystem.out.println(\"YES\");\n\t}\n\t\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "769874249b3b751c01643b9911a033ae", "src_uid": "6a5fe5fac8a4e3993dc3423180cdd6a9", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\nimport java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.PrintWriter;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tScanner in = new Scanner(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskA solver = new TaskA();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskA {\n public void solve(int testNumber, Scanner in, PrintWriter out) {\n long n = in.nextInt();\n long m = in.nextInt();\n long k = in.nextInt();\n if(n+m-2<k) out.print(-1);\n else{\n k++;\n out.print(Math.max(get_area(n,m,k),get_area(m,n,k)));\n }\n }\n public long get_area(long n,long m,long k){\n if(k<=n){\n return (n/k)*m;\n }\n else{\n k--;\n k-=(n-1);\n k++;\n return m/k;\n }\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "greedy"], "code_uid": "b45a6373ec2541e542ee85f878f1f335", "src_uid": "bb453bbe60769bcaea6a824c72120f73", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "\nimport java.io.PrintStream;\nimport java.util.Scanner;\n\n\npublic class B {\n\n\tprivate static final Scanner in = new Scanner(System.in);\n\tprivate static final PrintStream out = System.out;\n\t\n\tpublic static void main(String[] args) {\n\t\tint n = in.nextInt();\n\t\tlong ans = 1;\n\t\tint last = -1;\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tint a = in.nextInt();\n\t\t\tif (a == 1) {\n\t\t\t\tif (last != -1)\n\t\t\t\t\tans *= i - last;\n\t\t\t\tlast = i;\n\t\t\t}\n\t\t}\n\t\tif (last == -1)\n\t\t\tans = 0;\n\t\tout.println(ans);\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["combinatorics"], "code_uid": "91f90ead31d85eb606fd0e6173b97873", "src_uid": "58242665476f1c4fa723848ff0ecda98", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\n\npublic class Main{\n /*\n .\n .\n .\n .\n .\n .\n .\n some constants\n .\n */\n static int max=Integer.MIN_VALUE;\n static int a[][];\n static void permutations(int s,int num[]){\n if(s==num.length){\n int sum=0;\n for(int i=0;i<4;i++){\n for(int j=i;j<4;j+=2){\n sum+=a[num[j]][num[j+1]]+a[num[j+1]][num[j]];\n }\n }\n max=Math.max(sum,max);\n // return;\n }\n for(int i=s;i<num.length;i++){\n swap(num,s,i);\n permutations(s+1,num);\n swap(num,s,i);\n }\n }\n static void swap(int num[],int s,int i){\n int temp=num[s];\n num[s]=num[i];\n num[i]=temp;\n }\n /*\n .\n .\n .\n if any\n .\n .\n */\n public static void main(String[] args) throws IOException{\n\t\t/*\n\t\t.\n\t\t.\n\t\t.\n\t\t.\n\t\t.\n\t\t.\n */\n a=new int[5][5];\n for(int i=0;i<5;i++){\n for(int j=0;j<5;j++){\n a[i][j]=ni();\n }\n }\n int arr[]={0,1,2,3,4};\n permutations(0,arr);\n sop(max);\n /*\n\n\t\t.\n\t\t.\n\t\t.\n\t\t.\n\t\t.\n\t\t.\n\t\t.\n\t\t*/\n\t}\n\t/*\n\ttemporary functions\n\t.\n\t.\n\t*/\n\t/*\n\tfuctions\n\t.\n\t.\n\t.\n\t.\n\t.\n\t.\n\t.\n\t.\n\t.\n\t.\n\t.\n\t.\n\t.\n\t.\n\t.\n\t.\n\t.\n\tabcdefghijklmnopqrstuvwxyz\n\t.\n\t.\n\t.\n\t.\n\t.\n\t.\n\t*/\n\tstatic int modulo(int j,int m){\n\t\tif(j<0)\n\t\t\treturn m+j;\n\t\t if(j>=m)\n\t\t\treturn j-m;\n\n\t\t\treturn j;\n\t}\n\tstatic final int mod=1000000007;\n\tstatic final double eps=1e-8;\n\tstatic final long inf=100000000000000000L;\n\tstatic final boolean debug=true;\n\tstatic Reader in=new Reader();\n\tstatic StringBuilder ans=new StringBuilder();\n\tstatic long powm(long a,long b,long m){\n\t\tlong an=1;\n\t\tlong c=a;\n\t\twhile(b>0){\n\t\t\tif(b%2==1)\n\t\t\t\tan=(an*c)%m;\n\t\t\tc=(c*c)%m;\n\t\t\tb>>=1;\n\t\t}\n\t\treturn an;\n\t}\n\tstatic Random rn=new Random();\n\tstatic void sop(Object a){System.out.println(a);}\n\tstatic int ni(){return in.nextInt();}\n\tstatic int[] nia(int n){int a[]=new int[n];for(int i=0;i<n;i++)a[i]=ni();return a;}\n\tstatic long nl(){return in.nextLong();}\n\tstatic long[] nla(int n){long a[]=new long[n];for(int i=0; i<n; i++)a[i]=nl();return a;}\n\tstatic String ns(){return in.next();}\n\tstatic String[] nsa(int n){String a[]=new String[n];for(int i=0; i<n; i++)a[i]=ns();return a;}\n\tstatic double nd(){return in.nextDouble();}\n\tstatic double[] nda(int n){double a[]=new double[n];for(int i=0;i<n;i++)a[i]=nd();return a;}\n\tstatic class Reader{\n\t\tpublic BufferedReader reader;\n\t\tpublic StringTokenizer tokenizer;\n\t\tpublic Reader(){\n\t\t\treader=new BufferedReader(new InputStreamReader(System.in),32768);\n\t\t\ttokenizer=null;\n\t\t}\n\t\tpublic String next(){\n\t\t\twhile(tokenizer==null || !tokenizer.hasMoreTokens()){\n\t\t\t\ttry{\n\t\t\t\t\ttokenizer=new StringTokenizer(reader.readLine());\n\t\t\t\t}\n\t\t\t\tcatch(IOException e){\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tokenizer.nextToken();\n\t\t}\n\t\tpublic int nextInt(){\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\tpublic long nextLong(){\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\tpublic double nextDouble(){\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "f85e732fa2611a0a159b0bf7e4490b0e", "src_uid": "be6d4df20e9a48d183dd8f34531df246", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.*;\nimport java.lang.*;\nimport java.io.*;\nimport static java.lang.Integer.parseInt;\n\n\n\npublic class Test{\n\n\tstatic int gcd(int a,int b)\n\t{\n\t\tint dividend=Math.max(a, b);\n\t\tint divisor=Math.min(a, b);\n\t\twhile(divisor!=0)\n\t\t{\n\t\t\tint remainder=dividend%divisor;\n\t\t\tdividend=divisor;\n\t\t\tdivisor=remainder;\n\t\t}\n\t\treturn dividend;\n\t}\n\tstatic int gcdByRecursion(int a,int b)\n\t{\n\t\tif(b==0)\n\t\t\treturn a;\n\t\treturn gcd(b,a%b);\n\t}\n\t\n\tpublic static void main(String aa[])throws IOException\n\t{\n\t\tScan s=new Scan();\n\t\tString s1=s.scanString();\n\t\tString s2=s.scanString();\n\t\tif(s1.equals(s2))\n\t\t\tSystem.out.println(s1);\n\t\telse \n\t\t\tSystem.out.println(1);\n\t\t\n\t\t\n\t}\n}\t\n\n\n\nclass Scan\n\t{\n\t // BufferedReader br;\n\t StringTokenizer st;\n\t BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\t String scanString() throws IOException\n\t {\n\t while(st==null||!st.hasMoreTokens())\n\t {\n\t st=new StringTokenizer(br.readLine());\n\t }\n\t return st.nextToken();\n\t }\n\t int scanInt() throws IOException\n\t {\n\t return parseInt(scanString());\n\t }\n\t \n\t \n\t}", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "55924bda480bb214f714508731d9a4ba", "src_uid": "9c5b6d8a20414d160069010b2965b896", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/******************************************************************************\n\nWelcome to GDB Online.\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\nC#, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.\nCode, Compile, Run and Debug online from anywhere in world.\n\n*******************************************************************************/\nimport java.util.*;\npublic class Main\n{\n\tpublic static void main(String[] args) {\n\t Scanner sc = new Scanner(System.in);\n\t int n= sc.nextInt();\n\t int sq=0,diff=0,ex=0,rem=0;\n\t int mark=0,mark1=0,ans=0;\n\t if(n==1)\n\t ans=4;\n\t else if(n==2)\n\t ans=6;\n\t else if(n==3)\n\t ans=8;\n\t else if(n>=4)\n\t {\n \t sq =(int)Math.sqrt(n);\n \t diff = n-(sq*sq);\n \t ex=diff/sq;\n \t rem=diff%sq;\n \t \n \t \n \t if(ex>0)\n \t mark=((sq+ex)+sq)*2;\n \t else\n \t mark=(sq+sq)*2;\n \t \n \t if(rem>0)\n \t mark1=2;\n \t \n \t if(diff==0)\n \t ans=sq*4;\n \t else \n \t {\n \t ans=mark+mark1;\n \t }\n\t }\n\t System.out.println(ans);\n\t\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "geometry"], "code_uid": "4802c527c4b5d6a716d61458b820b54b", "src_uid": "414cc57550e31d98c1a6a56be6722a12", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.BufferedReader;\nimport java.io.FileNotFoundException;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\npublic class A {\n\n\tpublic static void main(String[] args) {\n\t\tFastScanner in = new FastScanner();\n\t\tint x = in.nextInt();\n\t\tint h = in.nextInt();\n\t\tint s = in.nextInt();\n\t\tint count = 0;\n\t\twhile(String.valueOf(h).contains(\"7\") == false && String.valueOf(s).contains(\"7\") == false) {\n\t\t\ts -= x;\n\t\t\twhile(s < 0) {\n\t\t\t\ts+= 60;\n\t\t\t\th--;\n\t\t\t\tif(h == -1) h = 23;\n\t\t\t}\n\t\t\tcount++;\n\t\t\t\n\t\t}\n\t\tSystem.out.println(count);\n\t\t\n\t\t\n\t}\n\n\t\n\tstatic class FastScanner{\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\t\tpublic FastScanner(String s) {\n\t\t\ttry{\n\t\t\t\tbr = new BufferedReader(new FileReader(s));\n\t\t\t}\n\t\t\tcatch(FileNotFoundException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\t\tpublic FastScanner(){\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\t\t\n\t\tString nextToken()\t{\n\t\t\twhile(st == null ||!st.hasMoreElements()){\n\t\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());}\n\t\t\t\tcatch(IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\t\t\t\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\t\t\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(nextToken());\n\t\t}\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(nextToken());\n\t\t}\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(nextToken());\n\t\t}\n\t\tString next() {\n\t\t\treturn nextToken();\n\t\t}\n\t\t\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "implementation"], "code_uid": "5057721bf3580f0c34390dbfdfc08376", "src_uid": "5ecd569e02e0164a5da9ff549fca3ceb", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package codeforces;\nimport java.util.Scanner;\npublic class CodeForces {\n \n public static void main(String[] args) {\n int n,_4,_7,l=0,r=0;\n Scanner in=new Scanner(System.in);\n n= in.nextInt();\n String s=in.next();\n boolean ans=true;\n for(int i=0;i<n/2;++i){\n if (s.charAt(i)!='7' && s.charAt(i)!='4') ans=false;\n else l+= (int)(s.charAt(i)-'0'); \n }\n for(int i=n/2;i<n;++i){\n if (s.charAt(i)!='7' && s.charAt(i)!='4') ans=false;\n else r+= (int)(s.charAt(i)-'0'); \n }\n if (l!=r) ans=false;\n System.out.println(ans?\"YES\":\"NO\");\n }\n \n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "e1d15cb0473a2bc2d01b2d5afe13cc26", "src_uid": "435b6d48f99d90caab828049a2c9e2a7", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.util.regex.Matcher;\n\npublic class Main {\n FastScanner in;\n PrintWriter out;\n\n public void solve() {\n long n = in.nextLong();\n long ans = 1;\n for(long i = 2; i <= Math.sqrt(n); i++) {\n if(n % i == 0) {\n ans *= i;\n while(n % i == 0)\n n /= i;\n }\n }\n if(n != 1)\n ans *= n;\n out.print(ans);\n }\n\n public void run() {\n try {\n //in = new FastScanner(new File(\".in\"));\n //out = new PrintWriter(new File(\".out\"));\n in = new FastScanner(new InputStreamReader(System.in));\n out = new PrintWriter(new OutputStreamWriter(System.out));\n\n solve();\n\n out.close();\n } catch (Exception e) {\n e.printStackTrace();\n }\n }\n\n class FastScanner {\n BufferedReader br;\n StringTokenizer st;\n\n FastScanner(File f) {\n try {\n br = new BufferedReader(new FileReader(f));\n } catch (Exception e) {\n e.printStackTrace();\n }\n }\n\n FastScanner(InputStreamReader rd) {\n br = new BufferedReader(rd);\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (Exception e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n }\n\n public static void main(String[] args) {\n new Main().run();\n }\n}\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "c3a827edad3103e33c4b0aaac03dbafa", "src_uid": "6d0da975fa0961acfdbe75f2f29aeb92", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\nimport java.lang.*;\npublic class Main\n{\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\t List<Character> l = new ArrayList<>();\n\t\t String s = sc.next();\n\t\t if(s.charAt(0)>52&&s.charAt(0)<57){\n\t\t char c = (char)(57 - (int)s.charAt(0) + 48);\n\t\t System.out.print(c);\n\t\t }\n\t\t else System.out.print(s.charAt(0));;\n\t\t for(int i=1;i<s.length();i++){\n\t\t if(s.charAt(i)>52){\n\t\t char c = (char)(57 - (int)s.charAt(i) + 48);\n\t\t System.out.print(c);\n\t\t } \n\t\t else System.out.print(s.charAt(i));\n\t\t }\n\t\t System.out.println();\n\t\t\n\t}\n}\n", "lang_cluster": "Java", "tags": ["greedy", "implementation"], "code_uid": "32d3912674126932173c80086afcee5a", "src_uid": "d5de5052b4e9bbdb5359ac6e05a18b61", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskD solver = new TaskD();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskD {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n /*int[] ans = new int[30];\n for (int i = 1; i < 30; ++i) {\n ans[i] = getDp((1 << i) - 1);\n }*/\n\n int[] ans = new int[]{0, 1, 2, 1, 4, 3, 2, 1, 5, 6, 2, 1, 8, 7, 5, 9, 8, 7, 3, 4, 7, 4, 2, 1, 10, 9, 3, 6, 11, 12};\n\n /*for (int i = 0; i < 30; ++i)\n System.err.print(ans[i] + \", \");*/\n\n int n = in.nextInt(), sq = 1;\n while ((sq + 1) * (sq + 1) <= n) sq++;\n\n boolean[] power = new boolean[sq + 1];\n int[] count = new int[30];\n int bcnt = 0;\n\n for (int i = 2; i <= sq; ++i) {\n if (power[i]) continue;\n int k = 0, r = 1;\n while ((long) r * i <= n) {\n r *= i;\n k++;\n if (r <= sq) {\n power[r] = true;\n } else {\n bcnt++;\n }\n }\n count[k]++;\n }\n\n int sum = 0;\n for (int i = 1; i < 30; ++i) {\n if (count[i] % 2 == 1) {\n sum ^= ans[i];\n }\n }\n sum ^= (n - sq - bcnt + 1) % 2;\n\n out.println(sum == 0 ? \"Petya\" : \"Vasya\");\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1)\n throw new UnknownError();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new UnknownError();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public String next() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuffer res = new StringBuffer();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n\n return res.toString();\n }\n\n private boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["dp", "games"], "code_uid": "8ecf754e1fc631a59fce7fcde88fe532", "src_uid": "0e22093668319217b7946e62afe32195", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "//Written by Shagoto\nimport java.util.*;\npublic class Main\n{\n public static void main(String[]args)\n {\n Scanner read = new Scanner(System.in); \n \n long n = read.nextLong();\n long m = read.nextLong();\n \n if(n == m)\n {\n System.out.println(0+\" \"+0);\n }\n else if(m == 1)\n {\n System.out.println(n*(n-1) / 2+\" \"+n*(n-1) / 2);\n }\n else\n {\n long temp = n - (m - 1);\n long ans2 = temp*(temp-1) / 2;\n \n long diff = n - (n / m * m);\n long temp1 = diff * ((n / m + 1)*(n / m) / 2);\n long temp2 = (m - diff) * (n / m * (n / m -1) / 2);\n long ans1 = temp1 + temp2;\n \n System.out.println(ans1+\" \"+ans2);\n }\n }\n}", "lang_cluster": "Java", "tags": ["math", "greedy", "constructive algorithms", "combinatorics"], "code_uid": "bdbdd9468aa1e3d4a671b0e7a0bf9e44", "src_uid": "a081d400a5ce22899b91df38ba98eecc", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\r\nimport java.io.*;\r\n\r\npublic class PalinInd{\r\n static class FastReader{\r\n BufferedReader br;\r\n StringTokenizer st;\r\n public FastReader(){\r\n br=new BufferedReader(new InputStreamReader(System.in));\r\n }\r\n String next(){\r\n while(st==null || !st.hasMoreTokens()){\r\n try {\r\n st=new StringTokenizer(br.readLine());\r\n } catch (IOException e) {\r\n e.printStackTrace();\r\n }\r\n }\r\n return st.nextToken();\r\n }\r\n int nextInt(){\r\n return Integer.parseInt(next());\r\n }\r\n long nextLong(){\r\n return Long.parseLong(next());\r\n }\r\n double nextDouble(){\r\n return Double.parseDouble(next());\r\n }\r\n String nextLine(){\r\n String str=\"\";\r\n try {\r\n str=br.readLine().trim();\r\n } catch (Exception e) {\r\n e.printStackTrace();\r\n }\r\n return str;\r\n }\r\n }\r\n static class FastWriter {\r\n\t\tprivate final BufferedWriter bw;\r\n\r\n\t\tpublic FastWriter() {\r\n\t\t\tthis.bw = new BufferedWriter(new OutputStreamWriter(System.out));\r\n\t\t}\r\n\r\n\t\tpublic void print(Object object) throws IOException {\r\n\t\t\tbw.append(\"\" + object);\r\n\t\t}\r\n\r\n\t\tpublic void println(Object object) throws IOException {\r\n\t\t\tprint(object);\r\n\t\t\tbw.append(\"\\n\");\r\n\t\t}\r\n\r\n\t\tpublic void close() throws IOException {\r\n\t\t\tbw.close();\r\n\t\t}\r\n\t}\r\n public static void main(String[] args) {\r\n try {\r\n FastReader in=new FastReader();\r\n FastWriter out = new FastWriter();\r\n int testCases=in.nextInt();\r\n for(int z=0;z<testCases;z++)\r\n {\r\n \r\n \r\n int mat[][]=new int[2][2];\r\n for(int i=0;i<2;i++)\r\n {\r\n for(int j=0;j<2;j++)\r\n {\r\n mat[i][j]=in.nextInt();\r\n }\r\n }\r\n int c=0;\r\n for(int i=0;i<2;i++)\r\n {\r\n for(int j=0;j<2;j++)\r\n {\r\n if(mat[i][j]==1)\r\n {\r\n c++;\r\n }\r\n }\r\n\r\n }\r\n if(c==0)\r\n {\r\n System.out.println(\"0\");\r\n }\r\n else if(c==1||c==2||c==3)\r\n {\r\n System.out.println(\"1\");\r\n }\r\n \r\n else{\r\n System.out.println(\"2\");\r\n }\r\n \r\n }\r\n }\r\n catch (Exception e) { \r\n return;\r\n }\r\n }\r\n }\r\n ", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "94279bd558d61f47ef6357b89f28fa9a", "src_uid": "7336b8becd2438f0439240ee8f9610ec", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.Scanner;\npublic class buyashovel {\n\tpublic static void main(String args[]) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint k = scan.nextInt();\n\t\tint r = scan.nextInt();\n\t\tboolean bol = true;\n\t\tfor (int i = 1 ; i <=10 && bol ; i++) {\n\t\t\tif ((i*k)%10==0) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tbol=false;\n\t\t\t}\n\t\t\telse if (((i*k)-r)%10==0) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tbol=false;\n\t\t\t}\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "constructive algorithms", "implementation"], "code_uid": "7f2ba6b09c05a3dc0168d6433a23c877", "src_uid": "18cd1cd809df4744bb7bcd7cad94e2d3", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.StringTokenizer;\n\npublic class A {\n String filename = \"\";\n final int INF = 1_000_000_000;\n\n\n void solve() {\n int n = readInt();\n int[] a = new int[n];\n for(int i = 0;i<n;i++){\n a[i] = readInt();\n }\n\n int d = a[1] - a[0];\n int now = a[1];\n for(int i = 1;i<n;i++){\n if(a[i] != now){\n out.print(a[n - 1]);\n return;\n }\n now += d;\n }\n out.print(a[n - 1] + d);\n }\n public static void main(String[] args) throws FileNotFoundException {\n new A().run();\n }\n void run() throws FileNotFoundException {\n init();\n solve();\n out.close();\n }\n BufferedReader in;\n PrintWriter out;\n\n StringTokenizer tok = new StringTokenizer(\"\");\n\n void init() throws FileNotFoundException {\n if(!filename.equals(\"\")) {\n in = new BufferedReader(new FileReader(new File(filename + \".in\")));\n out = new PrintWriter(new File(filename + \".out\"));\n return;\n }\n\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n }\n\n String readLine(){\n try{\n return in.readLine();\n }catch (Exception e){\n throw new RuntimeException(e);\n }\n }\n\n String readString(){\n while(!tok.hasMoreTokens()){\n String nextLine = readLine();\n if(nextLine == null) return null;\n tok = new StringTokenizer(nextLine);\n }\n return tok.nextToken();\n }\n\n int readInt(){\n return Integer.parseInt(readString());\n }\n}", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "a8e33f43c6f12fdebd53087828bbe96c", "src_uid": "d04fa4322a1b300bdf4a56f09681b17f", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class A832 {\n\tpublic static void main(String[] args) {\n\t\tScanner s = new Scanner(System.in);\n\t\n\t\tSystem.out.println((s.nextLong()/s.nextLong()%2==0)?\"NO\":\"YES\");\n\t\t\n\t\t\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "games"], "code_uid": "88ca1abc50afa3430d6cc1994b7e1513", "src_uid": "05fd61dd0b1f50f154eec85d8cfaad50", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.*;\nimport java.util.*;\n\npublic class A1 {\n public void solve() throws IOException {\n long r = nextLong();\n ArrayList<Long> div = new ArrayList<>();\n long rc = r;\n long i;\n if (r == 1) {\n out.print(\"NO\");\n return;\n }\n for (i = 1; i * i < rc; i++) {\n if (rc % i == 0) {\n div.add(i);\n //div.add(-i);\n div.add(rc / i);\n //div.add(-rc / i);\n //rc /= i;\n }\n }\n if (i * i == rc) {\n div.add(i);\n div.add(-i);\n }\n Collections.sort(div);\n boolean isGood = false;\n long y = 0;\n long x = 0;\n for (int k = 0; k < div.size(); k++) {\n x = div.get(k);\n if ((r - x * x - x - 1) % (2 * x) == 0) {\n y = (r - x * x - x - 1) / (2 * x);\n if (y > 0) {\n isGood = true;\n break;\n }\n }\n }\n if (isGood) {\n out.print(x + \" \" + y);\n } else {\n out.print(\"NO\");\n }\n }\n\n public void run() {\n try {\n br = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n\n solve();\n\n out.close();\n } catch (IOException e) {\n e.printStackTrace();\n System.exit(1);\n }\n }\n\n BufferedReader br;\n StringTokenizer in;\n PrintWriter out;\n\n public String nextToken() throws IOException {\n while (in == null || !in.hasMoreTokens()) {\n in = new StringTokenizer(br.readLine());\n }\n return in.nextToken();\n }\n\n public int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n public double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n public long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n public int[] nextArr(int n) throws IOException {\n int[] res = new int[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextInt();\n }\n return res;\n }\n\n public static void main(String[] args) throws IOException {\n Locale.setDefault(Locale.US);\n new A1().run();\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "number theory"], "code_uid": "c4aa4de404fd25cac9cd21e8a6506fd7", "src_uid": "3ff1c25a1026c90aeb14d148d7fb96ba", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.HashMap;\nimport java.util.LinkedList;\nimport java.util.List;\nimport java.util.Queue;\n\n\n\npublic class Sorter {\n\n\n public Sorter() {}\n\n\n\n\n int reader(){\n\n BufferedReader br = null;\n int answ = 0;\n try {\n String[] temp;\n br = new BufferedReader(new InputStreamReader(System.in));\n\n String[] total = br.readLine().split(\" \");\n int rows = Integer.parseInt(total[0]);\n int cols = Integer.parseInt(total[1]);\n int aliveRows = rows;\n \n boolean[][] mat = new boolean[rows][cols];\n for(int i=0; i < rows; i++) {\n boolean straw = false;\n String currRow = br.readLine();\n for(int j =0; j < cols; j++) {\n if(currRow.charAt(j)=='S') {\n straw = true;\n mat[i][j] = true;\n }\n else\n mat[i][j] = false;\n }\n if(!straw){\n aliveRows--;\n answ+= cols;}\n\n }\n\n\n for(int i=0; i < cols; i++) {\n boolean straw = false;\n for(int j =0; j < rows; j++) {\n if(mat[j][i]) {\n straw = true;\n break;\n }\n }\n if(!straw) {\n answ+= aliveRows;\n }\n }\n\n\n }\n catch (Exception e) {\n e.printStackTrace();\n\n }\n return answ;\n\n }\n\n public static void main(String args[]){\n\n Sorter s = new Sorter();\n System.out.print(s.reader());\n\n\n }\n\n\n\n}", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "cc4e2dad353022aaa474af901127e386", "src_uid": "ebaf7d89c623d006a6f1ffd025892102", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\nimport java.util.Random;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n final long b = 31;\n String fileName = \"\";\n\n\n ////////////////////// SOLUTION SOLUTION SOLUTION //////////////////////////////\n int INF = 1000_000_000 +100;\n long MODULO = 1000_000_000 + 7;\n int MAX_VALUE = 1000_1000;\n int[][] steps = {{0, 1}, {1, 0}, {-1, 0}, {0, -1}};\n private final static Random rnd = new Random();\n double eps = 1e-7;\n\n class Point implements Comparable<Point>{\n long x, y;\n Point(long x, long y){\n this.x = x;\n this.y = y;\n }\n\n @Override\n public int compareTo(Point o) {\n return Long.compare(this.x, o.x);\n }\n }\n void solve() throws IOException {\n long a = readLong();\n long b = readLong();\n int pa = 0;\n int pb = 0;\n Point[] pointsA = new Point[1000*10000];\n Point[] pointsB = new Point[1000*10000];\n for (long i=1; i*i <= a; ++i){\n if (a%i==0){\n pointsA[pa] = new Point(i, a/i);\n pa++;\n }\n }\n\n for (long i=1; i*i <= b; ++i){\n if (b%i==0){\n pointsB[pb] = new Point(i, b/i);\n pb++;\n }\n }\n int maxA = pa;\n int maxB = pb;\n long s = a + b;\n long ans = Long.MAX_VALUE;\n pa = 0;\n pb = 0;\n TreeSet<Long> stA = new TreeSet<>();\n TreeSet<Long> stB = new TreeSet<>();\n\n for (long i=1; i*i <=s; ++i){\n if (s%i==0){\n while (pa < maxA && pointsA[pa].x <= i){\n stA.add(pointsA[pa].y);\n pa++;\n }\n while (pb < maxB && pointsB[pb].x <= i){\n stB.add(pointsB[pb].y);\n pb++;\n }\n Long lowerA = stA.floor(s/i);\n Long lowerB = stB.floor(s/i);\n if(lowerA!=null||lowerB!=null){\n ans = Math.min(ans, (i + s/i)*2);\n }\n }\n }\n out.println(ans);\n }\n\n class Fenwik {\n int[] t;\n int n;\n Fenwik(int n){\n t = new int[n];\n this.n = n;\n }\n\n void inc(int r, int delta){\n for (; r < n; r = r | (r + 1)) t[r] += delta;\n }\n int getSum(int r){\n int res = 0;\n for (; r >=0; r = (r & (r + 1) ) - 1) res += t[r];\n return res;\n }\n }\n boolean isPrime(int n){\n for (int i=2; i*i<=n; ++i){\n if (n%i==0) return false;\n }\n return true;\n }\n class Edge implements Comparable<Edge>{\n int from, to, num, dist;\n Edge(int from, int to, int dist, int num){\n this.from = from;\n this.to = to;\n this.num = num;\n this.dist = dist;\n }\n\n @Override\n public int compareTo(Edge o) {\n return Integer.compare(this.dist, o.dist);\n }\n }\n class Number implements Comparable<Number>{\n int x, cost;\n Number(int x, int cost){\n this.x = x;\n this.cost = cost;\n }\n\n @Override\n public int compareTo(Number o) {\n return Integer.compare(this.cost, o.cost);\n }\n }\n\n void readUndirectedGraph (int n, int m, int[][] graph) throws IOException{\n Edge[] edges = new Edge[m];\n int[] countEdges = new int[n];\n for (int i=0; i<m; ++i){\n int from = readInt() - 1;\n int to = readInt() - 1;\n countEdges[from]++;\n countEdges[to]++;\n edges[i] = new Edge(from, to, 0, 0);\n }\n for (int i=0; i<n; ++i) {\n graph[i] = new int[countEdges[i]];\n }\n for (int i=0; i<m; ++i){\n graph[edges[i].from][--countEdges[edges[i].from]] = edges[i].to;\n graph[edges[i].to][-- countEdges[edges[i].to]] = edges[i].from;\n }\n }\n class Vertex implements Comparable<Vertex>{\n int i, j, plus;\n Vertex(int i, int j, int plus){\n this.i = i;\n this.j = j;\n this.plus = plus;\n }\n\n @Override\n public int compareTo(Vertex o) {\n return Integer.compare(this.plus, o.plus);\n }\n }\n\n\n\n ///////////////////////////////////////////////////////////////////////////////////////////\n\n class Dsu{\n int[] parent;\n int countSets;\n Dsu(int n){\n parent = new int[n];\n countSets = n;\n for (int i=0; i<n; ++i){\n parent[i] = i;\n }\n }\n int findSet(int a){\n if (a == parent[a]) return a;\n parent[a] = findSet(parent[a]);\n return parent[a];\n }\n void unionSets(int a, int b){\n a = findSet(a);\n b = findSet(b);\n if (a != b){\n parent[a] = b;\n countSets--;\n }\n }\n }\n\n class SparseTable{\n int[][] rmq;\n int[] logTable;\n int n;\n SparseTable(int[] a){\n n = a.length;\n logTable = new int[n+1];\n for(int i = 2; i <= n; ++i){\n logTable[i] = logTable[i >> 1] + 1;\n }\n rmq = new int[logTable[n] + 1][n];\n for(int i=0; i<n; ++i){\n rmq[0][i] = a[i];\n }\n\n for(int k=1; (1 << k) < n; ++k){\n for(int i=0; i + (1 << k) <= n; ++i){\n int max1 = rmq[k - 1][i];\n int max2 = rmq[k-1][i + (1 << (k-1))];\n rmq[k][i] = Math.max(max1, max2);\n }\n }\n }\n\n int max(int l, int r){\n int k = logTable[r - l];\n int max1 = rmq[k][l];\n int max2 = rmq[k][r - (1 << k) + 1];\n return Math.max(max1, max2);\n }\n }\n long checkBit(long mask, int bit){\n return (mask >> bit) & 1;\n }\n\n static int checkBit(int mask, int bit) {\n return (mask >> bit) & 1;\n }\n boolean isLower(char c){\n return c >= 'a' && c <= 'z';\n }\n\n ////////////////////////////////////////////////////////////\n\n\n\n int gcd(int a, int b){\n return b == 0 ? a : gcd(b, a%b);\n }\n long gcd(long a, long b){\n return b == 0 ? a : gcd(b, a%b);\n }\n double binPow(double a, int pow){\n if (pow == 0) return 1;\n if (pow % 2 == 1) {\n return a * binPow(a, pow - 1);\n } else {\n double c = binPow(a, pow / 2);\n return c * c;\n }\n }\n long binPow(long a, long b, long m) {\n if (b == 0) {\n return 1;\n }\n if (b % 2 == 1) {\n return ((a % m) * (binPow(a, b - 1, m) % m)) % m;\n } else {\n long c = binPow(a, b / 2, m);\n return (c * c) % m;\n }\n\n }\n int minInt(int... values) {\n int min = Integer.MAX_VALUE;\n for (int value : values) min = Math.min(min, value);\n return min;\n }\n\n int maxInt(int... values) {\n int max = Integer.MIN_VALUE;\n for (int value : values) max = Math.max(max, value);\n return max;\n }\n public static void main(String[] args) throws NumberFormatException, IOException {\n // TODO Auto-generated method stub\n new Main().run();\n }\n\n void run() throws NumberFormatException, IOException {\n solve();\n out.close();\n };\n\n BufferedReader in;\n PrintWriter out;\n\n StringTokenizer tok;\n String delim = \" \";\n\n Main() throws FileNotFoundException {\n try {\n in = new BufferedReader(new FileReader(\"input.txt\"));\n out = new PrintWriter(\"output.txt\");\n } catch (Exception e) {\n if (fileName.isEmpty()) {\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n } else {\n in = new BufferedReader(new FileReader(fileName + \".in\"));\n out = new PrintWriter(fileName + \".out\");\n }\n\n }\n tok = new StringTokenizer(\"\");\n }\n\n String readLine() throws IOException {\n return in.readLine();\n }\n\n String readString() throws IOException {\n while (!tok.hasMoreTokens()) {\n String nextLine = readLine();\n if (null == nextLine) {\n return null;\n }\n\n tok = new StringTokenizer(nextLine);\n }\n return tok.nextToken();\n }\n\n int readInt() throws NumberFormatException, IOException {\n return Integer.parseInt(readString());\n }\n byte readByte() throws NumberFormatException, IOException {\n return Byte.parseByte(readString());\n }\n int[] readIntArray (int n) throws NumberFormatException, IOException {\n int[] a = new int[n];\n for(int i=0; i<n; ++i){\n a[i] = readInt();\n }\n return a;\n }\n\n Integer[] readIntegerArray (int n) throws NumberFormatException, IOException {\n Integer[] a = new Integer[n];\n for(int i=0; i<n; ++i){\n a[i] = readInt();\n }\n return a;\n }\n\n long readLong() throws NumberFormatException, IOException {\n return Long.parseLong(readString());\n }\n\n double readDouble() throws NumberFormatException, IOException {\n return Double.parseDouble(readString());\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "binary search", "number theory"], "code_uid": "46ceb71eebaccac8b0fba1a5c9095c6c", "src_uid": "7d0c5f77bca792b6ab4fd4088fe18ff1", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/*package whatever //do not write package name here */\n\nimport java.io.*;\nimport java.util.*;\npublic class GFG {\n\tpublic static void main (String[] args) {\n\t\tScanner sc=new Scanner(System.in);\n\t\tString s1=sc.next();\n\t\tchar[] c1 = s1.toCharArray();\n\t\tString s2=sc.next();\n\t\tchar[] c2 = s2.toCharArray();\n\t\tint count=0;\n\t\t for (int i = 1; i < c1.length; i++) {\n\t\t if(c2[i]=='0' && c1[i]=='0'){\n\t\t if(c2[i-1]=='0'&&c1[i-1]=='0'){\n\t\t count++;\n\t\t c1[i-1]='X';\n\t\t c2[i-1]='X';\n\t\t c2[i]='X';\n\t\t }\n\t\t if(c2[i-1]=='0'){\n\t\t count++;\n\t\t c2[i]='X';\n\t\t c1[i]='X';\n\t\t c2[i-1]='X';\n\t\t }else if(c1[i-1]=='0'){\n\t\t count++;\n\t\t c2[i]='X';\n\t\t c1[i]='X';\n\t\t c1[i-1]='X';\n\t\t }\n\t\t }\n\t\t else if(c1[i]=='0' ){\n\t\t if(c1[i-1]=='0' && c2[i-1]=='0'){\n\t\t count++;\n\t\t c1[i-1]='X';\n\t\t c2[i-1]='X';\n\t\t c1[i]='X';\n\t\t }\n\t\t }else if(c2[i]=='0'){\n\t\t if(c1[i-1]=='0' && c2[i-1]=='0'){\n\t\t count++;\n\t\t c1[i-1]='X';\n\t\t c2[i-1]='X';\n\t\t c2[i]='X';\n\t\t }\n\t\t }\n\t\t }\n\t\t System.out.println(count);\n\t}\n}", "lang_cluster": "Java", "tags": ["greedy", "dp"], "code_uid": "deb2581beb88f378fa86c9323b919154", "src_uid": "e6b3e787919e96fc893a034eae233fc6", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": " import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\npublic class Main {\n \n \n public static void main(String arg[]) throws IOException\n {\n\n \n \n // BufferedReader r=new BufferedReader(new FileReader(\"testcase.txt\"));\n BufferedReader r=new BufferedReader(new InputStreamReader(System.in));\n\nStringTokenizer str=new StringTokenizer(r.readLine());\n\n int n=Integer.parseInt(str.nextToken());\n int m=Integer.parseInt(str.nextToken());\n int x=Integer.parseInt(str.nextToken());\n int y=Integer.parseInt(str.nextToken());\n int a=Integer.parseInt(str.nextToken());\n int b=Integer.parseInt(str.nextToken());\n \n \n \n int gcd=gcd(a,b);\n a=a/gcd;\n b=b/gcd;\n \n int i=1;\n while(a*i<=n&&b*i<=m)\n {\n i++;\n \n }\n i=i-1;\n \n int x1=0,y1=0,x2=a*i,y2=b*i;\n a=x2;\n b=y2;\n x1=(2*x-a)/2;\n y1=(2*y-b)/2;\n x2=x1+a;\n y2=y1+b;\n \n if(x1+a>n)\n {\n x2=n;\n x1=n-a;\n }\n else if(x1<0)\n { x1=0;\n x2=a;\n }\n if(y1+b>m)\n {\n y2=m;\n y1=m-b;\n }\n else if(y1<0)\n { y1=0;\n y2=b;\n }\n System.out.println(x1+\" \"+y1+\" \"+x2+\" \"+y2);\n \n}\n static public int gcd(int a,int b)\n {\n if(b==0)\n return a;\n else\n return gcd(b,a%b);\n }\n }\n ", "lang_cluster": "Java", "tags": ["math"], "code_uid": "79371d23ad0390277842b93e3056a1cc", "src_uid": "8f1211b995f35462ae83b2be27f54585", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.Scanner;\n\n/**\n *\n * @author izharishaksa\n */\npublic class C1060B {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long N = sc.nextLong();\n String s = N + \"\";\n char c = s.charAt(0);\n String temp = \"0\";\n if (c != '1') {\n temp = \"\" + (c - '1');\n }\n for (int i = 1; i < s.length(); i++) {\n temp += '9';\n }\n long b = Long.parseLong(temp);\n long a = N - b;\n int res = 0;\n while (a > 0) {\n res += a % 10;\n a /= 10;\n }\n while (b > 0) {\n res += b % 10;\n b /= 10;\n }\n System.out.println(res);\n }\n\n}\n", "lang_cluster": "Java", "tags": ["greedy"], "code_uid": "91c4dccd3a08fbe258b1415f8f04b003", "src_uid": "5c61b4a4728070b9de49d72831cd2329", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Scanner;\n\n//Pashmak and Garden codeforces\npublic class Test1 {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner (System.in);\n\t\tint a = scan.nextInt();\n\t\tint b = scan.nextInt();\n\t\tint c = scan.nextInt();\n\t\tint sum=0 , n , x , count=0;\n\t\tint [] array = new int [82];\n\t\tString num;\n\t\tfor(int s=1 ; s<82 ; s++){\n\t\t\tx=(int) (b*Math.pow(s,a)+c);\n\t\t\tnum = String.valueOf(x);\n\t\t\tn = num.length();\n\t\t\tfor(int i=0 ; i<n ; i++){\n\t\t\t\tsum = sum + Character.getNumericValue(num.charAt(i));\n\t\t\t}\n\t\t\tif (sum==s && x<Math.pow(10, 9)){\n\t\t\t\tarray[count]=x;count++;\n\t\t\t}\n\t\t\tsum = 0 ;\n\t\t}\n\t\tSystem.out.println(count);\n\t\tfor (int i=0 ; i<count ; i++){\n\t\t\tSystem.out.print(array[i]+\" \");\n\t\t}\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t/*int a = scan.nextInt();\n\t\tint b = scan.nextInt();\n\t\tint c = scan.nextInt();\n\t\tint count=0;\n\t\tfor(int x = 1 ; x<Math.pow(10,9) ; x++){\n\t\t\tString num = String.valueOf(x);\n\t\t\tint sum=0;\n\t\t\t//for(int i = 0 ; i<num.length() ; i++){\n\t\t\t\t//sum = sum + Character.getNumericValue(num.charAt(i));;\n\t\t\t//}\n\t\t\tsum = getsum(x);\n\t\t\tif (x==b*Math.pow(sum,a)+c){\n\t\t\t\tSystem.out.println(x);\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif (count!=0){\n\t\tSystem.out.println(count);\n\t\t}\n\t\telse{\n\t\t\tSystem.out.println(0);\n\t\t\t\n\t\t}*/\n\t\t\n\t}\n\tstatic int getsum(int n) {\n\t\t return n == 0 ? 0 : n % 10 + getsum(n/10);\n\t\t}\n\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "implementation", "number theory"], "code_uid": "28f6c1b94fd2a83b888da4d9ad80a201", "src_uid": "e477185b94f93006d7ae84c8f0817009", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Vishnu\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n TaskA solver = new TaskA();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskA {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int noofbuys = in.nextInt();\n int noosells = in.nextInt();\n int current = in.nextInt();\n //out.print(current);\n int max = Integer.MIN_VALUE;\n int min = Integer.MAX_VALUE;\n for (int i = 0; i < noofbuys; i++) {\n min = Math.min(min, in.nextInt());\n\n }\n for (int i = 0; i < noosells; i++) {\n max = Math.max(max, in.nextInt());\n\n }\n //out.print(\" this si \");\n // out.print(current);\n if (min > max) {\n out.print(current);\n } else {\n int result = (current / min) * max + (current % min);\n out.print(result);\n }\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void print(int i) {\n writer.print(i);\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["greedy", "implementation"], "code_uid": "7f61f8d6cdba60d41213fe61dcdb1832", "src_uid": "42f25d492bddc12d3d89d39315d63cb9", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "\nimport java.util.*;\n\npublic class B\n{\n public static void main(String[] args)\n {\n new B(new Scanner(System.in));\n }\n\n public B(Scanner in)\n {\n int n = in.nextInt();\n int m = in.nextInt();\n\n Box[] bs = new Box[m];\n for (int i=0; i<m; i++)\n bs[i] = new Box(in.nextInt(), in.nextInt());\n\n Arrays.sort(bs);\n int i = m-1;\n long res = 0;\n while ((n > 0)&&(i >= 0))\n {\n Box cur = bs[i];\n \n int cnt = Math.min(cur.a, n);\n n -= cnt;\n res += cnt*1L*cur.b;\n\n i--;\n }\n\n System.out.printf(\"%d%n\", res);\n }\n}\n\nclass Box implements Comparable<Box>\n{\n int a, b;\n\n public Box(int i, int j)\n {\n a = i;\n b = j;\n }\n\n public int compareTo(Box rhs)\n {\n return b - rhs.b;\n }\n}\n", "lang_cluster": "Java", "tags": ["sortings", "implementation", "greedy"], "code_uid": "4c446a2594db7f0a9d03231fe20c5dea", "src_uid": "c052d85e402691b05e494b5283d62679", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\npublic class MyClass {\n public static void main(String args[]) {\n Scanner sc=new Scanner(System.in);\n int x=sc.nextInt();\n int y=sc.nextInt();\n int a=sc.nextInt();\n int b=sc.nextInt();\n int gcd=f(x,y);\n long lcm=(x*y)/gcd;\n long a1=a/lcm;\n long b1=b/lcm;\n long ans=b1-a1;\n if(a%lcm==0)\n ans+=1;\n System.out.println(ans);\n }\n public static int f(int x,int y)\n {\n if(y==0)\n return x;\n return f(y,x%y);\n }\n}\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "58803c39d921cad2a40a0e596de26741", "src_uid": "c7aa8a95d5f8832015853cffa1374c48", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": " \nimport java.util.Arrays;\nimport java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner input= new Scanner(System.in);\n\t\tint a = input.nextInt();\n\t\tint b = input.nextInt();\n\t\tint c = input.nextInt();\n\t\tint d= input.nextInt();\n\t\tint m[]= new int[3];\n\t\tm[1]=a;\n\t\tm[0]=b;\n\t\tm[2]=c;\n\t\tArrays.sort(m);\n\t\tint d1=m[1]-m[0];\n\t\tint d2=m[2]-m[1];\n\t\tint answer=0;\n\t\tif(d1>=d){\n\t\t}else{\n\t\t\tanswer+=d-d1;\n\t\t}\n\t\tif(d2>=d){\n\t\t}else{\n\t\t\tanswer+=d-d2;\n\t\t}\n\t\tSystem.out.println(answer);\n\t}\n\n}", "lang_cluster": "Java", "tags": ["math"], "code_uid": "1e61d2bfff36d1a5b9f7c793adabf2e4", "src_uid": "47c07e46517dbc937e2e779ec0d74eb3", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.text.DecimalFormat;\nimport java.io.*;\nimport java.util.*;\nimport java.lang.reflect.Array;\n\n/**\n * @author Mukesh Singh\n *\n */\n\n\npublic class AB {\n\n private InputStream input;\n private PrintStream output;\n private Scanner inputSc;\n\n public AB(InputStream input, PrintStream output) {\n this.input = input;\n this.output = output;\n init();\n }\n\n private void init() {\n inputSc = new Scanner(input);\n }\n\n static int lineToInt(String line) {\n return Integer.parseInt(line);\n }\n\n static long lineToLong(String line) {\n return Long.parseLong(line);\n }\n static double lineToDouble(String line) {\n return Double.parseDouble(line);\n }\n\n\n public void solve() \n\t{\n solveTestCase();\n }\n\n/**\n * @define global / instance variables \n */\n\n\tHashMap<Integer,Integer> mat[] ;\n\tlong dist[] ;\n\tlong vec[] ;\n\tint par[] ;\n\tboolean isDone[] ;\n\tfinal long INF = 100000000000000000L ;\n\tint N;\n/**\n * @solve test case \n */\n@SuppressWarnings(\"unchecked\")\n private void solveTestCase() \n\t{\n\t\tint i , j , k , n , m ,a ;\n\t\tlong N , M, K,I, J;\n\t\tDecimalFormat df = new DecimalFormat(\"#,###,##0.00\");\n String str = inputSc.nextLine();\n String delims = \"[ ]+\";\n\t\tString[] tokens = str.split(delims); \n\t\tn = lineToInt(tokens[0]);\n\t\tm = lineToInt(tokens[1]);\n\t\tif ( n < m )\n\t\t\ta = n ;\n\t\telse\n\t\t\ta = m ;\n\t\tif(a%2 == 0 )\n\t\t\toutput.println(\"Malvika\");\n\t\telse\n\t\t\toutput.println(\"Akshat\");\n\n }\n\n\n\n /**\n * @param args the command line arguments\n */\n public static void main(String[] args) \n\t{\n\t\tFileInputStream in = null;\n \tFileOutputStream out = null;\n\t\tPrintStream ps = null ;\n\t\tInputStream is = null ;\n\t\ttry \n\t\t{\n \tis = new FileInputStream(\"file.in\");\n \tout = new FileOutputStream(\"file.out\");\n\t\t\tps = new PrintStream(out);\n }\n\t\tcatch ( Exception e )\n\t\t{}\n\n AB sd = new AB(System.in, System.out);\n sd.solve();\n\t\ttry\n\t\t{\n if (is != null) \n\t\t{\n\t is.close();\n\t }\n \tif (out != null) {\n \tout.close();\n \t}\n\t\tif (ps != null) {\n \tps.close();\n }\n \t}catch (Exception e){}\n\n\t\t//SquareDetector sd = new SquareDetector(System.in, System.out);\n //sd.solve();\n }\n}\n\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "1a97a267c6852ba4aafaa12cc7e317dd", "src_uid": "a4b9ce9c9f170a729a97af13e81b5fe4", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Scanner;\nimport java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.PrintWriter;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Walker\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tScanner in = new Scanner(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskA solver = new TaskA();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskA {\n public void solve(int testNumber, Scanner in, PrintWriter out) {\n int N = in.nextInt();\n int[] changes = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2 };\n out.print(changes[N / 10] * changes[N % 10]);\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "8eee1e032d114ee0bf8aad8961cb63cf", "src_uid": "76c8bfa6789db8364a8ece0574cd31f5", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "\n//no full solution\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\n//codeforce\npublic class codeforce {\n\n private static BufferedReader in;\n private static PrintWriter out;\n private static StringTokenizer input;\n\n public static void main(String[] args) throws IOException {\n // -------------------------------------------------------------------------\n // Initializing...\n new codeforce();\n // -------------------------------------------------------------------------\n // put your code here... :)\n \n String s1=nextString();\n String result=\"YES\";\n int counter=0;\n for (int i = 0; i < s1.length(); i++) {\n if(s1.charAt(i)=='4'||s1.charAt(i)=='7'){\n counter++;\n }\n }\n if(counter==4||counter==7){\n System.out.println(\"YES\"); \n }else{\n System.out.println(\"NO\");\n }\n\n // writeln(\"\");\n // -------------------------------------------------------------------------\n // closing up\n end();\n // --------------------------------------------------------------------------\n\n }\n private static String nextString() throws IOException {\n if (!input.hasMoreTokens())input=new StringTokenizer(in.readLine());\n return input.nextToken();\n }\n public codeforce() throws IOException {\n // Input Output for Console to be used for trying the test samples of\n // the problem\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n // -------------------------------------------------------------------------\n // Initalize Stringtokenizer input\n input = new StringTokenizer(in.readLine());\n }\n\n private static int nextInt() throws IOException {\n if (!input.hasMoreTokens())\n input = new StringTokenizer(in.readLine());\n return Integer.parseInt(input.nextToken());\n }\n\n private static void end() throws IOException {\n in.close();\n out.close();\n System.exit(0);\n }\n\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "9774a673b95940e256aca6f801b82e91", "src_uid": "33b73fd9e7f19894ea08e98b790d07f1", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/*\nKeep solving problems.\n*/\n\nimport java.lang.reflect.Array;\nimport java.util.*;\nimport java.io.*;\n\npublic class CFA {\n BufferedReader br;\n PrintWriter out;\n StringTokenizer st;\n boolean eof;\n private static final long MOD = 998244353L;\n private static final int[] dx1 = {0, 1};\n private static final int[] dy1 = {1, 0};\n private static final int[] dx2 = {-1, 0};\n private static final int[] dy2 = {0, -1};\n private static final String yes = \"Yes\";\n private static final String no = \"No\";\n\n int LIMIT = 1000 * 100 * 5 + 100;\n// int LIMIT = 100;\n long[] inv;\n long[] fact;\n void solve() throws IOException {\n int n = nextInt();\n int k = nextInt();\n inv = new long[LIMIT];\n fact = new long[LIMIT];\n fact[0] = 1;\n for (int i = 1; i < LIMIT; i++) {\n fact[i] = fact[i - 1] * i % MOD;\n }\n inv[LIMIT - 1] = powMod(fact[LIMIT - 1], MOD - 2, MOD);\n for (int i = LIMIT - 2; i >= 0; i--) {\n inv[i] = inv[i + 1] * (i + 1) % MOD;\n }\n long res = 0;\n for (int i = 1; i <= n; i++) {\n int cnt = n / i;\n int need = k - 1;\n if (cnt - 1 >= need) {\n res += comb(cnt - 1, need);\n if (res >= MOD) {\n res -= MOD;\n }\n }\n }\n outln(res % MOD);\n }\n\n // Power Calculate N^M % MOD, N and M can be long (up to 2^64, ~10^18)\n public long powMod(long N, long M, long MOD){//N^M % MOD\n if(M == 0L)\n return 1L;\n long[] hp = new long[64];\n boolean[] bp = new boolean[64];\n hp[0] = N;\n for(int i = 1; i < hp.length; i++) {\n hp[i] = (hp[i - 1] * hp[i - 1]) % MOD;\n }\n for(int j = 0; j < hp.length; j++) {\n if((M & (1L << j)) != 0)\n bp[j] = true;\n }\n long res = 1;\n for(int i = 0;i < bp.length; i++){\n if(bp[i]) {\n res = (res * hp[i]) % MOD;\n }\n }\n return res;\n }\n\n long comb(int n, int k) {\n long res = fact[n] * inv[k] % MOD;\n res = res * inv[n - k] % MOD;\n return res;\n }\n\n void shuffle(long[] a) {\n int n = a.length;\n for(int i = 0; i < n; i++) {\n int r = i + (int) (Math.random() * (n - i));\n long tmp = a[i];\n a[i] = a[r];\n a[r] = tmp;\n }\n }\n long gcd(long a, long b) {\n while(a != 0 && b != 0) {\n long c = b;\n b = a % b;\n a = c;\n }\n return a + b;\n }\n private void outln(Object o) {\n out.println(o);\n }\n private void out(Object o) {\n out.print(o);\n }\n private void formatPrint(double val) {\n outln(String.format(\"%.9f%n\", val));\n }\n public CFA() throws IOException {\n br = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n solve();\n out.close();\n }\n public static void main(String[] args) throws IOException {\n new CFA();\n }\n\n public long[] nextLongArr(int n) throws IOException{\n long[] res = new long[n];\n for(int i = 0; i < n; i++)\n res[i] = nextLong();\n return res;\n }\n public int[] nextIntArr(int n) throws IOException {\n int[] res = new int[n];\n for(int i = 0; i < n; i++)\n res[i] = nextInt();\n return res;\n }\n public String nextToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (Exception e) {\n eof = true;\n return null;\n }\n }\n return st.nextToken();\n }\n public String nextString() {\n try {\n return br.readLine();\n } catch (IOException e) {\n eof = true;\n return null;\n }\n }\n public int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n public long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n public double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n}", "lang_cluster": "Java", "tags": ["math", "combinatorics", "number theory"], "code_uid": "497b10459dbf34157b57f276a21088b8", "src_uid": "8e8eb64a047cb970a549ee870c3d280d", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class _4_Venya_ {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scn = new Scanner(System.in);\n\t\tint n = scn.nextInt();\n\t\tif (n % 2 == 0) {\n\t\t\tSystem.out.println(\"white\");\n\t\t\tSystem.out.println(1 + \" \" + 2);\n\t\t} else {\nSystem.out.println(\"black\");\n\t\t}\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["math", "constructive algorithms", "games"], "code_uid": "124ffaca8c12843cf586801919ccce04", "src_uid": "52e07d176aa1d370788f94ee2e61df93", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\nimport java.math.BigInteger;\nimport java.util.Vector;\n\npublic class TrivialProblem\n{\n public static void main(String[] args)\n {\n Scanner clavier=new Scanner(System.in);\n Vector vec=new Vector();\n int m=clavier.nextInt();\n if(m==0){ System.out.println(5); System.out.println(\"0 1 2 3 4\");}\n else\n {\n int t=0; int j=4;int p=j/5;\n while(t<m)\n {\n t=0; \n j++;\n p=j/5;\n while(p>=1)\n {\n t+=p;\n p/=5;\n } \n }\n int a=0;\n while(t==m)\n {\n a++;\n t=0;\n vec.add(j);\n j++;\n p=j/5;\n while(p>=1)\n {\n t+=p;\n p/=5;\n }\n \n }\n System.out.println(a);\n for(int k=0;k<vec.size();k++)\n { \n System.out.print(vec.get(k)+\" \");\n }\n }\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "constructive algorithms", "number theory"], "code_uid": "34204cdddaeafb6f00a9af97297b2519", "src_uid": "c27ecc6e4755b21f95a6b1b657ef0744", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\npublic class remove_duplicates \n{\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint n=in.nextInt();\n\t\tint arr[]=new int[n];\n\t\tSet<Integer> set = new LinkedHashSet<>();\n\t\tfor(int i=0;i<n;i++)\n\t\t\tarr[i]=in.nextInt();\n\t\tfor(int i=n-1;i>=0;i--)\n\t\t\tset.add(arr[i]);\n\t\tSystem.out.println(set.size());\n\t\tArrayList<Integer> list = new ArrayList<Integer>();\n\t\tfor(int i:set)\n\t\t\tlist.add(i);\n\t\tCollections.reverse(list);\n\t\tfor(int i:list)\n\t\t\tSystem.out.print(i+\" \");\n\t}\n}\n\t\t\t", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "3e6af44eb4f3390b68de0a07946e4ed3", "src_uid": "1b9d3dfcc2353eac20b84c75c27fab5a", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n public static void solve(InputReader in, PrintWriter out, DebugWriter debug) throws IOException {\n long n = in.nextInt();\n long m = in.nextInt();\n long k = in.nextInt();\n\n long x = Math.max(0, m - (n - n % k) / k * (k-1) - n % k);\n\n long scoreNoSerial = m-x*k;\n long scoreSerial = ((pow2(x)-1)*k*2) % mod ;\n\n debug.println(x);\n debug.println(scoreNoSerial);\n debug.println(scoreSerial);\n\n out.println((scoreSerial+scoreNoSerial) % mod);\n }\n\n public static long mod = (long) Math.pow(10, 9)+9;\n\n\n public static long pow2(long x){\n long[] array2 = new long[64];\n array2[0] = 2;\n\n for (int i=1; i<array2.length; i++){\n array2[i] = (array2[i-1]*array2[i-1]) % mod;\n //System.out.println( i + \": \" + array2[i]);\n }\n\n\n long ans = 1;\n String binary = Long.toBinaryString(x);\n //System.out.println(\"Bin: \" + binary);\n for (int i=binary.length()-1; i>=0; i--){\n if (binary.charAt(i) == '1'){\n ans *= array2[binary.length()-1-i];\n ans %= mod;\n }\n }\n\n //System.out.println(\"2^\" + x + \"=\" + ans);\n return ans;\n }\n\n\n public static void main(String[] args) throws IOException{\n InputReader in;\n PrintWriter out;\n DebugWriter debug;\n\n if (args.length > 0 && args[0].equals(\"file\")) {\n in = new InputReader(new BufferedReader(new FileReader(\"input.txt\")));\n out = new PrintWriter(new FileWriter(\"output.txt\"));\n debug = new DebugWriter(true);\n\n int sampleNumber = 1;\n do {\n String nextSample = \"Sample #\" + sampleNumber++ + \": \";\n out.println(nextSample);\n debug.println(nextSample);\n\n solve(in, out, debug);\n\n out.println(\"\");\n debug.println(\"\");\n } while (in.reader.readLine() != null);\n } else {\n in = new InputReader(new BufferedReader(new InputStreamReader(System.in)));\n out = new PrintWriter(new OutputStreamWriter(System.out));\n debug = new DebugWriter(false);\n\n solve(in, out, debug);\n }\n\n in.reader.close();\n out.close();\n }\n\n public static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(BufferedReader reader) {\n this.reader = reader;\n tokenizer = null;\n }\n\n public String next() throws IOException{\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n tokenizer = new StringTokenizer(reader.readLine());\n }\n\n return tokenizer.nextToken();\n }\n\n public int nextInt() throws IOException{\n return Integer.parseInt(next());\n }\n\n public int[] nextIntArray(int n) throws IOException{\n int[] array = new int[n];\n for (int i=0; i<n; i++){\n array[i] = nextInt();\n }\n\n return array;\n }\n }\n\n public static class DebugWriter {\n public boolean enable;\n\n public DebugWriter(boolean enable){\n this.enable = enable;\n }\n\n public void print(Object o){\n if (enable) System.out.print(o);\n }\n\n public void println(Object o){\n if (enable) System.out.println(o);\n }\n }\n\n}", "lang_cluster": "Java", "tags": ["math", "binary search", "number theory", "greedy", "matrices"], "code_uid": "08593f2b313f464af35debcf28b54a48", "src_uid": "9cc1aecd70ed54400821c290e2c8018e", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class btest9\n{\t \n\tpublic static void main(String[] args) throws Exception\n\t{\n\t\tInputReader in = new InputReader(System.in);\n\t\tOutputWriter out = new OutputWriter(System.out);\n\t\tint n=in.readInt();\n\t\tint a[]=new int[n];\n\t\tfor(int i=0;i<n;i++)a[i]=in.readInt();\n\t\tint k=in.readInt();\n\t\tArrays.sort(a);\n\t\tint lo,hi,mid;\n\t\tint fi=0;\n\t\tint ans=0;\n\t\tint max=-5;\n\t\tfor(int i=0;i<n;i++)\n\t\t{\n\t\t\tlo=i+1;hi=n-1;fi=a[i]+k;\n\t\t\twhile(lo<hi)\n\t\t\t{\n\t\t\t\tmid=lo+(hi-lo+1)/2;\n\t\t\t\tif(a[mid]>fi)hi=mid-1;\n\t\t\t\telse lo=mid;\n\t\t\t}\n\t\t\tif(lo<n&&a[lo]<=fi)ans=lo-i+1;\n\t\t\telse ans=1;\n\t\t\tif(ans>max)max=ans;\n\t\t}\n\t\tout.printLine(max);\n\t\tout.close();\n\t}\n\n\n\tprivate static class InputReader\n\t{\n\t\tprivate InputStream stream;\n\t\tprivate byte[] buf = new byte[1024];\n\t\tprivate int curChar;\n\t\tprivate int numChars;\n\t\tprivate SpaceCharFilter filter;\n\t\t \n\t\tpublic InputReader(InputStream stream)\n\t\t{\n\t\t\tthis.stream = stream;\n\t\t}\n \n\t\tpublic int read()\n\t\t{\n\t\t\tif (numChars == -1)\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tif (curChar >= numChars)\n\t\t\t{\n\t\t\t\tcurChar = 0;\n\t\t\t\ttry\n\t\t\t\t{\n\t\t\t\t\tnumChars = stream.read(buf);\n\t\t\t\t} catch (IOException e)\n\t\t\t\t{\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (numChars <= 0)\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn buf[curChar++];\n\t\t}\n\t\tpublic int readInt()\n\t\t{\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-')\n\t\t\t{\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo\n\t\t\t{\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res * sgn;\n\t\t}\n\t\t public long readLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\t\tpublic String readString()\n\t\t{\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo\n\t\t\t{\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res.toString();\n\t\t}\n\t\t\n\t\tpublic boolean isSpaceChar(int c)\n\t\t{\n\t\t\tif (filter != null)\n\t\t\t\treturn filter.isSpaceChar(c);\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n \n\t\t\n \n\t\tpublic interface SpaceCharFilter\n\t\t{\n\t\t\tpublic boolean isSpaceChar(int ch);\n\t\t}\n\t}\n \n\tprivate static class OutputWriter\n\t{\n\t\tprivate final PrintWriter writer;\n \n\t\tpublic OutputWriter(OutputStream outputStream)\n\t\t{\n\t\t\twriter = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n\t\t}\n \n\t\tpublic OutputWriter(Writer writer)\n\t\t{\n\t\t\tthis.writer = new PrintWriter(writer);\n\t\t}\n \t\tpublic void print(Object... objects)\n\t\t{\n\t\t\tfor (int i = 0; i < objects.length; i++)\n\t\t\t{\n\t\t\t\tif (i != 0)\n\t\t\t\twriter.print(' ');\n\t\t\t\twriter.print(objects[i]);\n\t\t\t}\n\t\t}\n\t\t\n\t\tpublic void printf(double n)\n\t\t{\n\t\t\twriter.printf(\"%.4f%n\", n);\n\t\t}\n\t\tpublic void printLine(Object... objects)\n\t\t{\n\t\t\tprint(objects);\n\t\t\twriter.println();\n\t\t}\n \n\t\tpublic void close()\n\t\t{\n\t\t\twriter.close();\n\t\t}\n \n\t\tpublic void flush()\n\t\t{\n\t\t\twriter.flush();\n\t\t}\n \n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "implementation", "binary search"], "code_uid": "5fb1ad9cd3e5c5fd86976ff8e3662d38", "src_uid": "086d07bd6f9031df09bd6a6e8fe8f25c", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Scanner;\n\npublic class A336 {\n\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tlong x = in.nextLong();\n\t\tlong y = in.nextLong();\n\t\tif (x * y > 0) {\n\t\t\tlong sum = x + y;\n\t\t\tif (x > 0) {\n\t\t\t\tSystem.out.println(\"0 \" + sum + \" \" + sum + \" 0\");\n\t\t\t} else {\n\t\t\t\tSystem.out.println(sum + \" 0 0 \" + sum);\n\t\t\t}\n\t\t} else {\n\t\t\tlong sum = x - y;\n\t\t\tif (x > 0) {\n\t\t\t\tSystem.out.println(\"0 \" + (-sum) + \" \" + (sum) + \" 0\");\n\t\t\t} else {\n\t\t\t\tSystem.out.println(sum + \" 0 0 \" + (-sum) + \" \");\n\t\t\t}\n\t\t}\n\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "bd66abeef8e12d0208fd505c4fecec87", "src_uid": "e2f15a9d9593eec2e19be3140a847712", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.*;\n\n\npublic class A {\t\n\tBufferedReader reader;\n StringTokenizer tokenizer;\n PrintWriter out;\n \n int INF = Integer.MAX_VALUE/2;\n int STOP = 2000000;\n \n int N;\n int M;\n int I;\n int J;\n int A;\n int B;\n\tpublic void solve() throws IOException {\t\t\t\t\n\t\tN = nextInt();\n\t\tM = nextInt();\n\t\tI = nextInt();\n\t\tJ = nextInt();\n\t\tA = nextInt();\n\t\tB = nextInt();\n\t\t\n\t\tint ans = INF;\n\t\tans = Math.min(ans, go(1, 1));\n\t\tans = Math.min(ans, go(1, M));\n\t\tans = Math.min(ans, go(N, 1));\n\t\tans = Math.min(ans, go(N, M));\n\t\t\n\t\tif (ans == INF) {\n\t\t\tout.println(\"Poor Inna and pony!\");\n\t\t} else {\n\t\t\tout.println(ans);\n\t\t}\n\t}\n\t\n\tpublic int go(int targetX, int targetY) {\n\t\tint curX = I;\n\t\tint curY = J;\n\t\tint ans = 0;\n\t\twhile (true) {\n\t\t\tif (curX == targetX && curY == targetY) {\n\t\t\t\treturn ans;\n\t\t\t}\n\t\t\t\n\t\t\tif (curX + A > N && curX - A < 1) {\n\t\t\t\treturn INF;\n\t\t\t}\n\t\t\tif (curY + B > M && curY - B < 1) {\n\t\t\t\treturn INF;\n\t\t\t}\n\t\t\t\n\t\t\tif (curX + A > N) {\n\t\t\t\tcurX -= A;\n\t\t\t} else if(curX - A < 1) {\n\t\t\t\tcurX += A;\n\t\t\t} else {\n\t\t\t\tif (curX <= targetX) {\n\t\t\t\t\tcurX += A;\n\t\t\t\t} else {\n\t\t\t\t\tcurX -= A;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif (curY + B > M) {\n\t\t\t\tcurY -= B;\n\t\t\t} else if(curY - B < 1) {\n\t\t\t\tcurY += B;\n\t\t\t} else {\n\t\t\t\tif (curY <= targetY) {\n\t\t\t\t\tcurY += B;\n\t\t\t\t} else {\n\t\t\t\t\tcurY -= B;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tans++;\n\t\t\tif (ans == STOP) {\n\t\t\t\treturn INF;\n\t\t\t}\n\t\t}\n\t}\n\t\n\t\n\t/**\n\t * @param args\n\t */\n\tpublic static void main(String[] args) {\n\t\tnew A().run();\n\t}\n\t\n\tpublic void run() {\n try {\n reader = new BufferedReader(new InputStreamReader(System.in));\n tokenizer = null;\n out = new PrintWriter(System.out);\n solve();\n reader.close();\n out.close();\n } catch (Exception e) {\n e.printStackTrace();\n System.exit(1);\n }\n }\n\n int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n String nextToken() throws IOException {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n tokenizer = new StringTokenizer(reader.readLine());\n }\n return tokenizer.nextToken();\n }\n\n}\n", "lang_cluster": "Java", "tags": ["greedy", "implementation"], "code_uid": "7624f1d99ad262cfde2b2e0b82684e16", "src_uid": "51155e9bfa90e0ff29d049cedc3e1862", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n\tprivate void solve() throws IOException {\n\t\t\n\t\tint lfg = nextInt();\n\t\tint rfg = nextInt();\n\t\tint lfb = nextInt();\n\t\tint rfb = nextInt();\n\t\t\n\t\tif ( (can(lfg,rfb))||(can(rfg,lfb)) ){\n\t\t\tout.println(\"YES\");\n\t\t}else{\n\t\t\tout.println(\"NO\");\n\t\t}\n\t}\n\tprivate boolean can(int g, int b) {\n\t\tif( (b >= (g-1)) && ( g >= (b/2 + b%2-1) ) )\n\t\t\treturn true;\n\t\treturn false;\n\t}\n\tprivate BufferedReader in;\n\tprivate PrintWriter out;\n\tprivate StringTokenizer st;\n\n\tprivate Main() throws IOException {\n\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(new OutputStreamWriter(System.out));\n\t\teat(\"\");\n\t\tsolve();\n\t\tin.close();\n\t\tout.close();\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew Main();\n\t}\n\n\tprivate void eat(String s) {\n\t\tst = new StringTokenizer(s);\n\t}\n\n\tString next() throws IOException {\n\t\twhile (!st.hasMoreTokens()) {\n\t\t\tString line = in.readLine();\n\t\t\tif (line == null) {\n\t\t\t\treturn null;\n\t\t\t}\n\t\t\teat(line);\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(next());\n\t}\n\n\tlong nextLong() throws IOException {\n\t\treturn Long.parseLong(next());\n\t}\n\n\tdouble nextDouble() throws IOException {\n\t\treturn Double.parseDouble(next());\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "greedy"], "code_uid": "5caa289fcd2d634c03115799d85474ab", "src_uid": "36b7478e162be6e985613b2dad0974dd", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class Lucky {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tlong num = scan.nextLong();\n\t\tSystem.out.println(num/2520);\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "93a997f735bd8023f9f96dd5460cd8dd", "src_uid": "8551308e5ff435e0fc507b89a912408a", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "//package com.example.practice.codeforces;\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.HashMap;\nimport java.util.StringTokenizer;\n\npublic class Solution {\n public static void main (String [] args) throws IOException {\n // Use BufferedReader rather than RandomAccessFile; it's much faster\n final BufferedReader input = new BufferedReader(new InputStreamReader(System.in));\n PrintWriter out = new PrintWriter(System.out);\n // input file name goes above\n //StringTokenizer st = new StringTokenizer(input.readLine());\n //int n = Integer.parseInt(st.nextToken()), a = Integer.parseInt(st.nextToken()), b = Integer.parseInt(st.nextToken()), k = Integer.parseInt(st.nextToken());\n long[] res = calc(input.readLine());\n if (res==null){\n out.println(-1);\n }else {\n printArray(res, out);\n }\n out.close(); // close the output file\n }\n\n private static long[] calc(final String s) {\n long px = 0, v = 1;\n int p = s.length()-1, tem = 0, highest = 0, first = 0, c = 0;\n while (p>=0 && s.charAt(p)=='0'){\n p--;\n }\n if (p<0)return null;\n while (p>=0){\n if (s.charAt(p)=='1'){\n px |= 1L << tem;\n highest = tem;\n first = p;\n c++;\n }\n tem++;\n p--;\n }\n if (c==1)return new long[]{first+1, first+2};\n final long m = (long) Math.sqrt(1L<<highest) + 1;\n HashMap<Long, Long> map = new HashMap<>();\n for (int i=1;i<=m;++i){\n v = v << 1;\n if ((v & (1L<<highest)) != 0){\n v = v ^ px;\n }\n if (v == 1){\n return new long[]{first+1, first+1+i};\n }\n if (i<m){\n map.put(v, (long)i);\n }\n }\n final long d = v;\n for (int i=2;i<=m;++i){\n v = multi(px, v, d, highest);\n if (v==1){\n return new long[]{first + 1, first + 1 + m * i};\n }\n Long j = map.get(v);\n if (j != null){\n return new long[]{first + 1, first + 1 + m * i - j};\n }\n }\n return null;\n }\n\n private static long multi(final long px, final long v, final long d, final int highest){\n long res = 0;\n for (int i=0;i<highest;++i){\n if ((d & (1L<<i)) != 0) {\n int t = i;\n long v2 = v;\n while (t > 0) {\n v2 = v2 << 1;\n if ((v2 & (1L<<highest)) != 0){\n v2 = v2 ^ px;\n }\n t--;\n }\n res = res ^ v2;\n }\n }\n return res;\n }\n\n private static void printArray(long[] ns, final PrintWriter out){\n for (int i=0;i<ns.length;++i){\n out.print(ns[i]);\n if (i+1<ns.length)out.print(\" \");\n else out.println();\n }\n }\n\n private static void printArrayInt(int[] ns, final PrintWriter out){\n for (int i=0;i<ns.length;++i){\n out.print(ns[i]);\n if (i+1<ns.length)out.print(\" \");\n else out.println();\n }\n }\n\n private static void printArrayVertical(long[] ns, final PrintWriter out){\n for (long a : ns){\n out.println(a);\n }\n }\n\n private static void printArray2D(long[][] ns, final int len, final PrintWriter out){\n int cnt = 0;\n for (long[] kk : ns){\n cnt++;\n if (cnt > len)break;\n for (int i=0;i<kk.length;++i){\n out.print(kk[i]);\n if (i+1<kk.length)out.print(\" \");\n else out.println();\n }\n }\n }\n\n private static void printArray2DInt(int[][] ns, final int len, final PrintWriter out){\n int cnt = 0;\n for (int[] kk : ns){\n cnt++;\n if (cnt > len)break;\n for (int i=0;i<kk.length;++i){\n out.print(kk[i]);\n if (i+1<kk.length)out.print(\" \");\n else out.println();\n }\n }\n }\n\n private static long[] readArray(final int n, final BufferedReader input) throws IOException{\n long[] ns = new long[n];\n StringTokenizer st = new StringTokenizer(input.readLine());\n for (int i=0;i<n;++i){\n ns[i] = Long.parseLong(st.nextToken());\n }\n return ns;\n }\n\n private static int[] readArrayInt(final int n, final BufferedReader input) throws IOException{\n int[] ns = new int[n];\n StringTokenizer st = new StringTokenizer(input.readLine());\n for (int i=0;i<n;++i){\n ns[i] = Integer.parseInt(st.nextToken());\n }\n return ns;\n }\n\n private static long[] readArrayVertical(final int n, final BufferedReader input) throws IOException{\n long[] ns = new long[n];\n for (int i=0;i<n;++i){\n ns[i] = Long.parseLong(input.readLine());\n }\n return ns;\n }\n\n private static long[][] readArray2D(final int n, final int len, final BufferedReader input) throws IOException{\n long[][] ns = new long[len][];\n for (int i=0;i<n;++i){\n StringTokenizer st = new StringTokenizer(input.readLine());\n ArrayList<Long> al = new ArrayList<>();\n while (st.hasMoreTokens()){\n al.add(Long.parseLong(st.nextToken()));\n }\n long[] kk = new long[al.size()];\n for (int j=0;j<kk.length;++j){\n kk[j] = al.get(j);\n }\n ns[i] = kk;\n }\n return ns;\n }\n\n private static int[][] readArray2DInt(final int n, final int len, final BufferedReader input) throws IOException{\n int[][] ns = new int[len][];\n for (int i=0;i<n;++i){\n StringTokenizer st = new StringTokenizer(input.readLine());\n ArrayList<Integer> al = new ArrayList<>();\n while (st.hasMoreTokens()){\n al.add(Integer.parseInt(st.nextToken()));\n }\n int[] kk = new int[al.size()];\n for (int j=0;j<kk.length;++j){\n kk[j] = al.get(j);\n }\n ns[i] = kk;\n }\n return ns;\n }\n\n static class SegTree{\n int st;\n int en;\n int mid;\n int val1;\n int val2;\n SegTree left;\n SegTree right;\n public SegTree(int l, int r, int d){\n st = l;\n en = r;\n mid = (st + en) >> 1;\n val1 = val2 = d;\n if (st<en){\n left = new SegTree(st, mid, d);\n right = new SegTree(mid+1, en, d);\n }else {\n left = right = null;\n }\n }\n\n public SegTree(int l, int r, int[] ns){\n st = l;\n en = r;\n mid = (st + en) >> 1;\n if (st==en){\n val1 = val2 = ns[st];\n }else {\n left = new SegTree(l, mid, ns);\n right = new SegTree(mid+1, r, ns);\n val1 = Math.min(left.val1, right.val1);\n val2 = Math.max(left.val2, right.val2);\n }\n }\n\n void update(int idx, int v){\n if (st==en){\n val1 = val2 = v;\n }else {\n if (idx <= mid){\n left.update(idx, v);\n }else {\n right.update(idx, v);\n }\n val1 = Math.min(left.val1, right.val1);\n val2 = Math.max(left.val2, right.val2);\n }\n }\n\n int getMin(int l, int r){\n if (st==en || (l==st && r==en))return val1;\n if (r<=mid){\n return left.getMin(l, r);\n }\n if (l>mid){\n return right.getMin(l, r);\n }\n return Math.min(left.getMin(l, mid), right.getMin(mid+1, r));\n }\n\n int getMax(int l, int r){\n if (st==en || (l==st && r==en))return val2;\n if (r<=mid){\n return left.getMax(l, r);\n }\n if (l>mid){\n return right.getMax(l, r);\n }\n return Math.max(left.getMax(l, mid), right.getMax(mid+1, r));\n }\n }\n\n static class SparseTable{\n int[][] minTable;\n int[][] maxTable;\n int[] log2;\n int n;\n public SparseTable(final int[] ns){\n n = ns.length;\n int m = 0, pre = 0;\n while (1<<m < n){\n m++;\n }\n m++;\n minTable = new int[n][m];\n maxTable = new int[n][m];\n log2 = new int[n+1];\n for (int i=0;i<n;++i){\n minTable[i][0] = ns[i];\n maxTable[i][0] = ns[i];\n if ((1<<(pre+1)) == i+1){\n pre++;\n }\n log2[i+1] = pre;\n }\n for (int i=1;i<m;++i){\n for (int j=0;j<n;++j){\n int r = Math.min(n-1, j+(1<<i)-1);\n if (r-(1<<(i-1))+1 <= j){\n minTable[j][i] = minTable[j][i-1];\n maxTable[j][i] = maxTable[j][i-1];\n }else {\n minTable[j][i] = Math.min(minTable[j][i-1], minTable[r-(1<<(i-1))+1][i-1]);\n maxTable[j][i] = Math.max(maxTable[j][i-1], maxTable[r-(1<<(i-1))+1][i-1]);\n }\n }\n }\n }\n\n int getMin(final int l, final int r){\n int d = log2[r-l+1];\n return Math.min(minTable[l][d], minTable[r-(1<<d)+1][d]);\n }\n\n int getMax(final int l, final int r){\n int d = log2[r-l+1];\n return Math.max(maxTable[l][d], maxTable[r-(1<<d)+1][d]);\n }\n }\n}", "lang_cluster": "Java", "tags": ["math", "bitmasks", "meet-in-the-middle", "matrices", "number theory"], "code_uid": "ab64cabf25971f956395b5c833d62af0", "src_uid": "6bf798edef30db7d0ce2130e40084e6b", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\r\n\r\n\r\nimport java.io.*;\r\npublic class Main {\r\n\t\tstatic long mod = 1000000007;\r\n\t\tstatic PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));\r\n\t\tpublic static void main(String[] args) throws IOException {\r\n\t\t\tFastReader sc = new FastReader();\r\n\t\t\tint t = sc.nextInt();\r\n\t\t\twhile( t-- > 0) {\r\n\t\t\t\tint n = sc.nextInt();\r\n\t\t\t\tint k =sc.nextInt();\r\n\t\t\t\t// n^k\r\n\t\t\t\tlong ans = 1;\r\n\t\t\t\tfor( int i =0 ; i< k;i++) {\r\n\t\t\t\t\tans*=n;\r\n\t\t\t\t\tans%=mod;\r\n\t\t\t\t}\r\n\t\t\t\tout.println(ans);\r\n\t\t\t}\r\n\t\t\tout.flush();\r\n\t\t}\t\t\r\n\t\t\r\n\t\tpublic static int[] nextLargerElement(int[] arr, int n)\t{ \r\n\t\t\tStack<Integer> stack = new Stack<>();\r\n\t\t\tint rtrn[] = new int[n];\r\n\t rtrn[n-1] = -1;\r\n\t stack.push( n-1);\r\n\t for( int i = n-2 ;i >= 0 ; i--){\r\n\t int temp = arr[i];\r\n\t int lol = -1;\r\n\t while( !stack.isEmpty() && arr[stack.peek()] <= temp){\r\n\t \tif(arr[stack.peek()] == temp ) {\r\n\t \t\tlol = stack.peek();\r\n\t \t}\r\n\t stack.pop();\r\n\t }\r\n\t if( stack.isEmpty()){\r\n\t \tif( lol != -1) {\r\n\t \t\trtrn[i] = lol;\r\n\t \t\t}\r\n\t \telse {\r\n\t rtrn[i] = -1;\r\n\t \t}\r\n\t }\r\n\t else{\r\n\t \trtrn[i] = stack.peek();\r\n\t }\r\n\t stack.push( i);\r\n\t }\r\n\t return rtrn;\r\n\t\t\t}\r\n\t\t\r\n\t\t static int gcd(int a, int b)\r\n\t\t {\r\n\t\t if (a == 0)\r\n\t\t return b;\r\n\t\t return gcd(b % a, a);\r\n\t\t }\r\n\t\t\t \r\n\t\t\t // method to return LCM of two numbers\r\n\t\t static int lcm(int a, int b)\r\n\t\t {\r\n\t\t\t return (a / gcd(a, b)) * b;\r\n\t\t }\r\n\t \r\n\t\tstatic HashMap<Long,Long> primefactor( long n){\r\n\t\t\tHashMap<Long ,Long> hm = new HashMap<>();\r\n\t\t\tlong temp = 0;\r\n\t\t\twhile( n%2 == 0) {\r\n\t\t\t\ttemp++;\r\n\t\t\t\tn/=2;\r\n\t \t\t }\t\r\n\t\t\tif( temp!= 0) {\r\n\t \t\t\t hm.put( 2L, temp);\r\n\t \t\t }\r\n\t \t\t long c = (long)Math.sqrt(n);\r\n\t \t\t for( long i = 3 ; i <= c ; i+=2) {\r\n\t \t\t\t temp = 0;\r\n\t \t\t\t while( n% i == 0) {\r\n\t \t\t\t\t temp++;\r\n\t \t\t\t\t n/=i;\r\n\t \t\t\t }\r\n\t \t\t\t if( temp!= 0) {\r\n\t \t\t\t\t hm.put( i, temp);\r\n\t \t\t\t }\r\n\t \t\t }\r\n\t \t\t if( n!= 1) {\r\n\t \t\t\t hm.put( n , 1L);\r\n\t \t\t }\r\n\t \t\t return hm;\r\n\t \t\t// this is the link where i found this method\r\n\t \t\t // https://www.geeksforgeeks.org/print-all-prime-factors-of-a-given-number/\r\n\t \t }\r\n\t \r\n\t\t static class FastReader {\r\n\t\t BufferedReader br;\r\n\t\t StringTokenizer st;\r\n\t\t \r\n\t\t public FastReader()\r\n\t\t {\r\n\t\t br = new BufferedReader(\r\n\t\t new InputStreamReader(System.in));\r\n\t\t }\r\n\t\t \r\n\t\t String next()\r\n\t\t {\r\n\t\t while (st == null || !st.hasMoreElements()) {\r\n\t\t try {\r\n\t\t st = new StringTokenizer(br.readLine());\r\n\t\t }\r\n\t\t catch (IOException e) {\r\n\t\t e.printStackTrace();\r\n\t\t }\r\n\t\t }\r\n\t\t return st.nextToken();\r\n\t\t }\r\n\t\t \r\n\t\t int nextInt() { return Integer.parseInt(next()); }\r\n\t\t \r\n\t\t long nextLong() { return Long.parseLong(next()); }\r\n\t\t \r\n\t\t double nextDouble()\r\n\t\t {\r\n\t\t return Double.parseDouble(next());\r\n\t\t }\r\n\t\t \r\n\t\t String nextLine()\r\n\t\t {\r\n\t\t String str = \"\";\r\n\t\t try {\r\n\t\t str = br.readLine();\r\n\t\t }\r\n\t\t catch (IOException e) {\r\n\t\t e.printStackTrace();\r\n\t\t }\r\n\t\t return str;\r\n\t\t }\r\n\t\t }\r\n\t\t\r\n}", "lang_cluster": "Java", "tags": ["math", "combinatorics", "bitmasks"], "code_uid": "12ec8dc9b56192c7ae7a76a9ac45408b", "src_uid": "2e7a9f3a97938e4a7e036520d812b97a", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class C {\n\n final static int M = 1000000007;\n final static int K = 25997;\n final static int N = 300000;\n\n boolean[] p = new boolean[N];\n int l[] = new int[K];\n\n int cnt = 0;\n void solve() throws IOException {\n in(\"__std\"); out(\"__std\");\n\n int k = 0;\n for (int i = 2; i < N; ++i) {\n if (!p[i]) {\n l[k++] = i;\n int j = i << 1;\n while (j < N) {\n p[j] = true;\n j += i;\n }\n }\n }\n\n int n = readInt();\n int n2 = 2 * n;\n long r = 1;\n for (int i = 0; i < K; ++i) {\n k = calc(n2, l[i]) - calc(n, l[i]) * 2;\n if (k > 0) {\n r = (r * pow(l[i], k)) % M;\n }\n }\n\n r -= n;\n if (r < 0) {\n r += M;\n }\n println(r);\n\n exit();\n }\n\n int calc(int n, int p) {\n int r = 0;\n long k = p;\n while (k <= n) {\n r += n / k;\n k *= p;\n }\n return r;\n }\n\n long pow(int b, int p) {\n if (p == 1) {\n return b;\n }\n long r = pow(b, p / 2);\n r = (r * r) % M;\n if ((p & 1) == 1) {\n r = (r * b) % M;\n }\n return r;\n }\n\n void in(String name) throws IOException {\n if (name.equals(\"__std\")) {\n in = new BufferedReader(new InputStreamReader(System.in));\n } else {\n in = new BufferedReader(new FileReader(name));\n }\n }\n\n void out(String name) throws IOException {\n if (name.equals(\"__std\")) {\n out = new PrintWriter(System.out);\n } else {\n out = new PrintWriter(name);\n }\n }\n\n void exit() {\n out.close();\n System.exit(0);\n }\n\n int readInt() throws IOException {\n return Integer.parseInt(readToken());\n }\n\n double readDouble() throws IOException {\n return Double.parseDouble(readToken());\n }\n\n String readLine() throws IOException {\n st = null;\n return in.readLine();\n }\n\n String readToken() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(in.readLine());\n }\n return st.nextToken();\n }\n\n boolean eof() throws IOException {\n return !in.ready();\n }\n\n void print(String format, Object ... args) {\n out.println(new Formatter().format(format, args));\n }\n\n void println(String format, Object ... args) {\n out.println(new Formatter().format(format, args));\n }\n\n void print(Object value) {\n out.print(value);\n }\n\n void println(Object value) {\n out.println(value);\n }\n\n void println() {\n out.println();\n }\n\n StringTokenizer st;\n\n BufferedReader in;\n PrintWriter out;\n\n public static void main(String[] args) throws IOException {\n new C().solve();\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "combinatorics"], "code_uid": "61e696914896301c627a33c4ef8c5f07", "src_uid": "13a9ffe5acaa79d97df88a069fc520b9", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\npublic class codefo {\n\t\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner ob =new Scanner(System.in);\n\t\tint n=ob.nextInt();\n\t\tob.nextLine();\n\t\tString s=ob.nextLine();\n\t\tString sub[]=new String[n-1]; \n\t\tfor(int i=0;i<n-1;i++)\n\t\t{\n\t\t\tString se=s.substring(i, i+2);\n\t\t\tsub[i]=se;\n\t\t}\n\t\tint c=0,index=0,max=0;\n\t\tfor(int i=0;i<n-1;i++)\n\t\t{\n\t\t\tc=0;\n\t\t\tfor(int j=i+1;j<n-1;j++)\n\t\t\t{\n\t\t\t\tif(sub[i].compareTo(sub[j])==0)\n\t\t\t\t\tc++;\n\t\t\t}\n\t\t\tif(c>max)\n\t\t\t{\n\t\t\t\tmax=c;\n\t\t\t\tindex=i;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(sub[index]);\n\t\tob.close();\n\t\t}\n\t}\n\n", "lang_cluster": "Java", "tags": ["strings", "implementation"], "code_uid": "9582d611e5a2ead5a26bbe0582cd91f6", "src_uid": "e78005d4be93dbaa518f3b40cca84ab1", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.lang.*;\nimport java.math.*;\nimport static java.lang.Math.*;\nimport java.util.concurrent.ThreadLocalRandom;\n\npublic class Sol implements Runnable {\n\n long mod = (long)1e9 + 7;\n\n void solve(InputReader in, PrintWriter w) {\n long n = in.nextLong();\n long k = in.nextLong();\n long M = in.nextLong();\n long D = in.nextLong();\n\n long max = M;\n long limit = (long)1e18;\n\n for(long i=2;i<=D;i++) {\n if(limit / k < i - 1L) break;\n long maxPossible = n / (k * (i - 1L) + 1L);\n maxPossible = min(maxPossible, M);\n long total = maxPossible * i;\n max = max(max, total);\n }\n\n w.println(max);\n }\n\n // ************* Code ends here ***************\n\n void init() throws Exception {\n //Scanner in;\n InputReader in;\n PrintWriter w;\n boolean online = false;\n\n String common_in_fileName = \"\\\\in\";\n String common_out_fileName = \"\\\\out\";\n int test_files = 0;\n\n for(int file_no = 0; file_no <= test_files; file_no++) {\n\n String x = \"\" + file_no;\n if (x.length() == 1) x = \"0\" + x;\n\n String in_fileName = common_in_fileName;// + \"\" + x;\n String out_fileName = common_out_fileName;// + \"\" + x;\n\n if (online) {\n //in = new Scanner(new File(in_fileName + \".txt\"));\n in = new InputReader(new FileInputStream(new File(in_fileName + \".txt\")));\n w = new PrintWriter(new FileWriter(out_fileName + \".txt\"));\n } else {\n //in = new Scanner(System.in);\n in = new InputReader(System.in);\n w = new PrintWriter(System.out);\n }\n\n solve(in, w);\n w.close();\n }\n }\n\n public void run() {\n try {\n init();\n }\n catch(Exception e) {\n System.out.println(e);\n e.printStackTrace();\n }\n }\n\n public static void main(String args[]) throws Exception {\n new Thread(null, new Sol(),\"Sol\",1<<28).start();\n }\n\n static class InputReader {\n\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public String nextLine() {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n\n public int nextInt() {\n int c = read();\n\n while (isSpaceChar(c)) {\n c = read();\n }\n\n int sgn = 1;\n\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n\n return res * sgn;\n }\n\n public long nextLong() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public double nextDouble() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E') {\n return res * Math.pow(10, nextInt());\n }\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E') {\n return res * Math.pow(10, nextInt());\n }\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n\n public String readString() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n\n return res.toString();\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public String next() {\n return readString();\n }\n\n public interface SpaceCharFilter {\n\n public boolean isSpaceChar(int ch);\n }\n }\n}", "lang_cluster": "Java", "tags": ["math"], "code_uid": "57faf7f63a8df4dcde67dc10ec82ebfd", "src_uid": "ac2e795cd44061db8da13e3947ba791b", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/* package codechef; // don't place package name! */\n\nimport java.util.*;\nimport java.lang.*;\nimport java.io.*;\n\n/* Name of the class has to be \"Main\" only if the class is public. */\npublic class Codechef\n{\n\tpublic static void main (String[] args) throws java.lang.Exception\n\t{\n\t\t// your code goes here\n\t\tMyScanner sc = new MyScanner();\n\t\tint n = sc.nextInt();\n\t\tint m = sc.nextInt();\n\t\tlong k = sc.nextLong();\n\t\tint x = sc.nextInt();\n\t\tint y = sc.nextInt();\n\t\tlong best = -1;\n\t\tlong wor = k+1;\n\t\tlong ser = 0l;\n\t\tlong[][] count = new long[n+1][m+1];\n\t\tfor (int i = 1; i <= n; ++i){\n\t\t for (int j = 1; j <= m; ++j){\n\t\t if (n == 1){\n\t\t long total = (long) n * (long) m;\n\t\t long pre = k / total;\n\t\t long k1 = k - pre * total;\n\t\t total = k % total;\n\t\t count[i][j] += pre;\n\t\t \n\t\t if (In(i, j, total, n, m, k1)){\n\t\t count[i][j]++;\n\t\t }\n\t\t }else{\n\t\t long total = (long) n * (long) m;\n\t\t \n\t\t if (k <= total){\n\t\t // System.out.println(\"i:\" + i + \" j:\" + j + \" total:\" + total + \" k: \" + k);\n\t\t if (In(i, j, total, n, m, k)){\n\t\t count[i][j]++;\n\t\t }\n\t\t }else{\n\t\t long k1 = k - total;\n\t\t total = (long) (n-1) * (long) m;\n\t\t long pre = 1L + k1 / total;\n\t\t long k2 = k1 - (pre-1) * total;\n\t\t total = k1 % total;\n\t\t \n\t\t if (i != n && i != 1)\n\t count[i][j]+=pre;\n\t else{\n\t count[i][j] += (pre-1) / 2 + 1L;\n\t if (i == 1){\n\t count[i][j] += ((pre-1) % 2);\n\t }\n\t }\n\t // if (i == 24 && j == 49)\n\t // System.out.println(\"i:\" + i + \" j:\" + j + \" pre: \" + pre + \" total:\" + total + \" k2: \" + k2 + \" count \" + count[i][j]);\n\t\t if (pre % 2 == 0){\n\t\t if (In1(i, j, total, n, m, k2)){\n\t\t count[i][j]++;\n\t\t }\n\t\t }\n\t\t else\n\t\t {\n\t\t \n\t if (In2(i,j, total, n, m, k2)){\n\t count[i][j]++;\n\t }\n\t }\n\t\t }\n\t\t }\n\t\t }\n\t\t}\n\t\tfor (int i = 1; i <= n;++i){\n\t\t for (int j = 1; j <= m; ++j){\n\t\t best = Math.max(best, count[i][j]);\n\t\t wor = Math.min(wor, count[i][j]);\n\t\t }\n\t\t}\n\t\t\n\t\tSystem.out.println(best + \" \" + wor + \" \" + count[x][y]);\n\t\t\n\t}\n\t\n\tpublic static boolean In(int x, int y, long total, int n, int m, long k){\n\t if (total == 0) return false;\n\t long cur = 0L;\n\t \n\t for (int i = 1; i <= n; ++i){\n\t cur += (long) m;\n\t \n\t if (cur >= k){\n\t \n\t cur -= (long) m;\n\t \n\t total = k - cur;\n\t //System.out.println(cur + \" \" + k + \" \" + x + \" \" + y + \" \" +total);\n\t if (x < i){\n\t return true;\n\t }else if (x == i){\n\t return y <= total;\n\t }else{\n\t return false;\n\t }\n\t }\n\t }\n\t return false;\n\t}\n\t\n\tpublic static boolean In1(int x, int y, long total, int n, int m, long k){\n\t // System.out.println(\"Check in1 \" + x + \" \" + y + \" total: \" + total + \" \" + n + \" \" + m + \" k: \" + k);\n\t if (total == 0) return false;\n\t long cur = 0L;\n\t if (x < 2) return false;\n\t for (int i = 2; i <= n; ++i){\n\t cur += (long) m;\n\t \n\t if (cur >= k){\n\t cur -= m;\n\t total = k - cur;\n\t if (x < i){\n\t return true;\n\t }else if (x == i){\n\t return y <= total;\n\t }else{\n\t return false;\n\t }\n\t }\n\t }\n\t return false;\n\t}\n\n\tpublic static boolean In2(int x, int y, long total, int n, int m, long k){\n\t // System.out.println(\"Check in2 \" + x + \" \" + y + \" total: \" + total + \" \" + n + \" \" + m + \" k: \" + k);\n\t if (total == 0) return false;\n\t long cur = 0L;\n\t if (x > n-1) return false;\n\t for (int i = n-1; i >= 1; --i){\n\t cur += (long) m;\n\t \n\t if (cur >= k){\n\t cur -= m;\n\t total = k - cur;\n\t if (x > i){\n\t return true;\n\t }else if (x == i){\n\t return y <= total;\n\t }else{\n\t return false;\n\t }\n\t }\n\t }\n\t return false;\n\t}\t\n\t\n\t\n //-----------PrintWriter for faster output---------------------------------\n public static PrintWriter out;\n \n //-----------MyScanner class for faster input----------\n public static class MyScanner {\n BufferedReader br;\n StringTokenizer st;\n \n public MyScanner() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n \n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n \n int nextInt() {\n return Integer.parseInt(next());\n }\n \n long nextLong() {\n return Long.parseLong(next());\n }\n \n double nextDouble() {\n return Double.parseDouble(next());\n }\n \n String nextLine(){\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n\n }\t\n}\n", "lang_cluster": "Java", "tags": ["math", "constructive algorithms", "binary search", "implementation"], "code_uid": "8cfea5c6ffa063dcc246d8ebe3ec5dd1", "src_uid": "e61debcad37eaa9a6e21d7a2122b8b21", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class cf376b {\n\tpublic static void main(String args[]) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint size = scan.nextInt();\n\t\tlong[] nums = new long[size];\n\t\tfor (int i = 0; i < size; i++) {\n\t\t\tnums[i] = scan.nextLong();\n\t\t}\n\t\tArrays.sort(nums);\n\t\tlong ans = nums[size - 1];\n\t\tfor (int i = nums.length - 2; i >= 0; i--) {\n\t\t\tif (nums[i] < nums[i + 1]) {\n\t\t\t\tans += nums[i];\n\t\t\t} else {\n\t\t\t\tif (nums[i + 1] - 1 > 0) {\n\t\t\t\t\tnums[i] = nums[i + 1] - 1;\n\t\t\t\t\tans += nums[i + 1] - 1;\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["sortings", "greedy"], "code_uid": "811f423b5465c26868ca9dd77c619ee1", "src_uid": "3c4b2d1c9440515bc3002eddd2b89f6f", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\nimport static java.lang.Math.*;\n\npublic class Solution {\n private IO io;\n private int ioMode = -1;\n private String problemName = \"\";\n private final String mjArgument = \"master_j\";\n\n public static void main(String programArguments[]) throws IOException{\n if(programArguments != null && programArguments.length > 0)\n new Solution().run(programArguments[0]);\n else\n new Solution().run(null);\n }\n\n private void run(String programArgument) throws IOException {\n // _______________________________________________ _________\n // | Input Mode | Output Mode | mode | comment |\n // |------------------|---------------------|----- |---------|\n // | input.txt | System.out | 0 | mj |\n // | System.in | System.out | 1 | T / CF |\n // |<problemName>.in | <problemName>.out | 2 | |\n // | input.txt | output.txt | 3 | C |\n // |__________________|_____________________|______|_________|\n long nanoTime = 0;\n if(programArgument != null && programArgument.equals(mjArgument)) // mj\n ioMode = 0;\n else if(System.getProperty(\"ONLINE_JUDGE\") != null) // T / CF\n ioMode = 1;\n else\n ioMode = 2;\n switch(ioMode){\n case -1:\n try{\n throw new Exception(\"<ioMode> init failure\") ;\n }catch (Exception e){\n e.printStackTrace();\n }\n return;\n case 0:\n break;\n case 1:\n break;\n case 2:\n if(problemName.length() == 0){\n try{\n throw new Exception(\"<problemName> init failure\");\n }catch (Exception e){\n e.printStackTrace();\n }\n return;\n }\n case 3:\n break;\n }\n io = new IO(ioMode, problemName);\n if(ioMode == 0){\n System.out.println(\"File output : \\n<start>\");\n System.out.flush();\n nanoTime = System.nanoTime();\n }\n solve();\n io.flush();\n if(ioMode == 0){\n System.out.println(\"</start>\");\n long t = System.nanoTime() - nanoTime;\n int d3 = 1000000000, d2 = 1000000, d1 = 1000;\n if(t>=d3)\n System.out.println(t/d3 + \".\" + t%d3 + \" seconds\");\n else if(t>=d2)\n System.out.println(t/d2 + \".\" + t%d2 + \" millis\");\n else if(t>=d1)\n System.out.println(t/d1 + \".\" + t%d1 + \" micros\");\n else\n System.out.println(t + \" nanos\");\n System.out.flush();\n }\n }\n\n private void solve() throws IOException {\n double r = io.nI(), h = io.nI();\n long ans = 0;\n while(h > r){\n h -= r;\n ans++;\n }\n if(h >= r/2){\n //h -= r/2;\n ans++;\n }else\n h += r;\n //h += r/2;\n ans *= 2;\n if(dist(0, 0, r/2, h) >= r)\n ans++;\n io.wln(ans);\n }//2.2250738585072012e-308\n\n double dist(double y1, double z1, double y2, double z2){\n double d1 = (y1-y2)*(y1-y2);\n double d2 = (z1-z2)*(z1-z2);\n double d = d1 + d2;\n return sqrt(d);\n }\n\n /**\n * Input-output class\n * @author master_j\n * @version 0.2.5\n */\n @SuppressWarnings(\"unused\")\n private class IO{\n private boolean alwaysFlush;\n StreamTokenizer in; PrintWriter out; BufferedReader br; Reader reader; Writer writer;\n public IO(int ioMode, String problemName) throws IOException{\n Locale.setDefault(Locale.US);\n // _______________________________________________ _________\n // | Input Mode | Output Mode | mode | comment |\n // |------------------|---------------------|----- |---------|\n // | input.txt | System.out | 0 | mj |\n // | System.in | System.out | 1 | T / CF |\n // |<problemName>.in | <problemName>.out | 2 | |\n // | input.txt | output.txt | 3 | C |\n // |__________________|_____________________|______|_________|\n switch(ioMode){\n case 0:\n reader = new FileReader(\"input.txt\");\n writer = new OutputStreamWriter(System.out);\n break;\n case 1:\n reader = new InputStreamReader(System.in);\n writer = new OutputStreamWriter(System.out);\n break;\n case 2:\n reader = new FileReader(problemName + \".in\");\n writer = new FileWriter(problemName + \".out\");\n break;\n case 3:\n reader = new FileReader(\"input.txt\");\n writer = new FileWriter(\"output.txt\");\n break;\n }\n br = new BufferedReader(reader);\n in = new StreamTokenizer(br);\n out = new PrintWriter(writer);\n alwaysFlush = false;\n }\n public void setAlwaysFlush(boolean arg){alwaysFlush = arg;}\n public void wln(){out.println(); if(alwaysFlush)flush();}\n public void wln(int arg){out.println(arg); if(alwaysFlush)flush();}\n public void wln(long arg){out.println(arg); if(alwaysFlush)flush();}\n public void wln(double arg){out.println(arg); if(alwaysFlush)flush();}\n public void wln(String arg){out.println(arg); if(alwaysFlush)flush();}\n public void wln(boolean arg){out.println(arg); if(alwaysFlush)flush();}\n public void wln(char arg){out.println(arg); if(alwaysFlush)flush();}\n public void wln(float arg){out.println(arg); if(alwaysFlush)flush();}\n public void wln(Object arg){out.println(arg); if(alwaysFlush)flush();}\n public void w(int arg){out.print(arg); if(alwaysFlush)flush();}\n public void w(long arg){out.print(arg); if(alwaysFlush)flush();}\n public void w(double arg){out.print(arg); if(alwaysFlush)flush();}\n public void w(String arg){out.print(arg); if(alwaysFlush)flush();}\n public void w(boolean arg){out.print(arg); if(alwaysFlush)flush();}\n public void w(char arg){out.print(arg); if(alwaysFlush)flush();}\n public void w(float arg){out.print(arg); if(alwaysFlush)flush();}\n public void w(Object arg){out.print(arg); if(alwaysFlush)flush();}\n public void wf(String format, Object...args){out.printf(format, args); if(alwaysFlush)flush();}\n public void flush(){out.flush();}\n public int nI() throws IOException {in.nextToken(); return(int)in.nval;}\n public long nL() throws IOException {in.nextToken(); return(long)in.nval;}\n public String nS() throws IOException {in.nextToken(); return in.sval;}\n public double nD() throws IOException {in.nextToken(); return in.nval;}\n public float nF() throws IOException {in.nextToken(); return (float)in.nval;}\n public char nC() throws IOException {return (char)br.read();}\n public void wc(char...arg){for(char c : arg){in.ordinaryChar(c);in.wordChars(c, c);}}\n public void wc(String arg){wc(arg.toCharArray());}\n public void wc(char arg0, char arg1){in.ordinaryChars(arg0, arg1); in.wordChars(arg0, arg1);}\n public boolean eof(){return in.ttype == StreamTokenizer.TT_EOF;}\n public boolean eol(){return in.ttype == StreamTokenizer.TT_EOL;}\n }\n}", "lang_cluster": "Java", "tags": ["geometry"], "code_uid": "981f8aae9a989da331ab4ec9277cc318", "src_uid": "ae883bf16842c181ea4bd123dee12ef9", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "// CF 0040\nimport java.util.*;\npublic class Main {\n\tScanner sc = new Scanner(System.in);\n\tpublic static void main(String[] args) {\n\t\tnew Main().C();\n\t}\n\tvoid C()\n\t{\n\t\tString input = sc.next();\n\t\tStringBuilder adr = new StringBuilder(input);\n\t\tint idx = adr.indexOf(\"@\");\n\t\tif(idx < 0) {\n\t\t\tidx = adr.indexOf(\"at\", 1);\n\t\t\tif(idx >= 0 && idx < adr.length() - 2) adr.replace(idx, idx+2, \"@\");\n\t\t}\n\t\t//System.out.println(adr);\n\t\twhile(true) {\n\t\t\tidx = adr.indexOf(\"dot\", 1);\n\t\t\tif(idx >= 0 && idx < adr.length() - 3) adr.replace(idx, idx+3, \".\");\n\t\t\telse break;\n\t\t}\n\t\tSystem.out.println(adr);\n\t}\n\tint Bsolve(int v, int sell, ArrayList<Integer> buys)\n\t{\n\t\tint ans = 0;\n\t\tif(buys.isEmpty()) return v;\n\t\tfor(Integer buy :buys) {\n\t\t\tif(buy > v) break;\n\t\t\tint rem = v % buy;\n\t\t\tans += (v / buy * sell);\n\t\t\t//System.err.println(\"LOOP \" + ans + \" \" + v + \" \" + buy);\n\t\t\tv = rem;\n\t\t}\n\t\tans += v;\n\t\treturn ans;\n\t}\n\tvoid B() {\n\t\tint n = sc.nextInt(), b = sc.nextInt();\n\t\tint ans = b;\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0; i < n; i++) a[i] = sc.nextInt();\n\t\tArrayList<Integer> buys = new ArrayList<Integer>();\n\t\tfor(int sell = 0; sell < n; sell++) {\n\t\t\tint cand = Bsolve(b, a[sell], buys);\n\t\t\t//System.err.println(\"\" + b + \" \" + sell + \" \" + a[sell] + \" \" + cand + \" \" + buys);\n\t\t\tif(cand > ans ) ans = cand;\n\t\t\tbuys.add(a[sell]);\n\t\t\tCollections.sort(buys);\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\tvoid A() {\n\t\tString a, b, c;\n\t\ta = sc.next(); b = sc.next();\n\t\tc = new StringBuilder(a).reverse().toString();\n\t\t//System.err.println(a);\n\t\t//System.err.println(b);\n\t\t//System.err.println(c);\n\t\tif(b.equals(c)) System.out.println(\"YES\");\n\t\telse System.out.println(\"NO\");\n\t\t\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["expression parsing", "implementation"], "code_uid": "acb717eaf263d2d3fc5500807b8fc070", "src_uid": "a11c9679d8e2dca51be17d466202df6e", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Arrays;import java.util.Scanner;\npublic class sherif {\n public static void main (String args[]){\n Scanner sherif = new Scanner(System.in) ;\n long a[] = new long [3] ;\n a[0] = sherif.nextLong() ;\n a[1] = sherif.nextLong();\n a[2] = sherif.nextLong() ;\n Arrays.sort(a);\n long h = min((a[0]+a[1]+a[2])/3,(a[0]+a[1]));\n System.out.print(h);\n }\n\n private static long min(long a, long c) {\n if(a<c)return a ;\n return c;\n }\n\n private static long pow(int i, long count) {\n // TODO Auto-generated method stub\n return 0;\n }\n}\n", "lang_cluster": "Java", "tags": ["greedy"], "code_uid": "11cd2a01b7f9c7fb1f5d7bb724a3a014", "src_uid": "bae7cbcde19114451b8712d6361d2b01", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class test {\n\npublic static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int N = Integer.parseInt(in.next());\n int K = Integer.parseInt(in.next());\n int min = Integer.MAX_VALUE;\n for (int i = 0; i < N; i++) {\n int a = Integer.parseInt(in.next());\n if (K % a == 0 && min > K/a) min = K/a;\n }\n System.out.println(min);\n}\n}\n \n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "6ceea21d6941df347f7c4cb248338561", "src_uid": "80520be9916045aca3a7de7bc925af1f", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class Div2_418E {\n\n\t// solution completely based on that of the editorial\n\n\tstatic final long MOD = 1_000_000_007L;\n\n\tstatic int numV;\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n\n\t\tnumV = Integer.parseInt(reader.readLine());\n\n\t\tint[] deg = new int[numV + 1];\n\t\tStringTokenizer inputData = new StringTokenizer(reader.readLine());\n\t\tfor (int i = 1; i <= numV; i++) {\n\t\t\tdeg[i] = Integer.parseInt(inputData.nextToken());\n\t\t}\n\t\treader.close();\n\n\t\t// let assign[A][B][C] represent the number of ways to move to a level with A vertices from a level with B\n\t\t// 1-opening vertices and C 2-opening vertices\n\t\tlong[][][] aCnt = new long[numV + 5][numV + 5][numV + 5];\n\n\t\taCnt[0][0][0] = 1;\n\n\t\t// loop ordering is non-trivial cnt2 has to be before the cnt1 loop\n\t\tfor (int cntE = 0; cntE <= numV; cntE++) {\n\t\t\tfor (int cnt2 = 0; cnt2 <= numV; cnt2++) {\n\t\t\t\tfor (int cnt1 = 0; cnt1 <= numV; cnt1++) {\n\t\t\t\t\tlong cCnt = 0;\n\n\t\t\t\t\t// ext, ext\n\t\t\t\t\t// ext, t1\n\t\t\t\t\t// ext, t2\n\t\t\t\t\t// t1, t1\n\t\t\t\t\t// t1, t2\n\t\t\t\t\t// t2, t2\n\n\t\t\t\t\tif (cnt2 > 0) {\n\t\t\t\t\t\tif (cntE > 1) {\n\t\t\t\t\t\t\tcCnt += aCnt[cntE - 2][cnt1][cnt2 - 1] * cntE * (cntE - 1) >> 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (cntE > 0 && cnt1 > 0) {\n\t\t\t\t\t\t\tcCnt += aCnt[cntE - 1][cnt1 - 1][cnt2 - 1] * cntE * cnt1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (cntE > 0 && cnt2 > 1) {\n\t\t\t\t\t\t\tcCnt += aCnt[cntE - 1][cnt1 + 1][cnt2 - 2] * cntE * (cnt2 - 1);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (cnt1 > 1) {\n\t\t\t\t\t\t\tcCnt += aCnt[cntE][cnt1 - 2][cnt2 - 1] * cnt1 * (cnt1 - 1) >> 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (cnt1 > 0 && cnt2 > 1) {\n\t\t\t\t\t\t\tcCnt += aCnt[cntE][cnt1][cnt2 - 2] * cnt1 * (cnt2 - 1);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (cnt2 > 2) {\n\t\t\t\t\t\t\tcCnt += aCnt[cntE][cnt1 + 2][cnt2 - 3] * (cnt2 - 1) * (cnt2 - 2) >> 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcCnt %= MOD;\n\t\t\t\t\t\taCnt[cntE][cnt1][cnt2] = cCnt;\n\t\t\t\t\t} else if (cnt1 > 0) {\n\t\t\t\t\t\tif (cntE > 0) {\n\t\t\t\t\t\t\tcCnt += aCnt[cntE - 1][cnt1 - 1][0] * cntE;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (cnt1 > 1) {\n\t\t\t\t\t\t\tcCnt += aCnt[cntE][cnt1 - 2][0] * (cnt1 - 1);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcCnt %= MOD;\n\t\t\t\t\t\taCnt[cntE][cnt1][cnt2] = cCnt;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint[] preCnt1 = new int[numV + 1];\n\t\tfor (int i = 1; i <= numV; i++) {\n\t\t\tpreCnt1[i] = deg[i] == 2 ? 1 + preCnt1[i - 1] : preCnt1[i - 1];\n\t\t}\n\n\t\tlong[][] ans = new long[numV + 5][numV + 5];\n\n\t\t// smart way of initializing everything with the last object to 1\n\t\tans[numV + 1][numV] = 1;\n\n\t\tfor (int l = numV; l > 1; l--) {\n\t\t\tfor (int r = l; r <= numV; r++) {\n\t\t\t\tint cnt1 = preCnt1[r] - preCnt1[l - 1];\n\t\t\t\tint cnt2 = r - l + 1 - cnt1;\n\n\t\t\t\tfor (int nLevLen = 0; nLevLen <= (cnt2 << 1) + cnt1 && r + nLevLen <= numV; nLevLen++) {\n\t\t\t\t\tans[l][r] = (ans[l][r] + ans[r + 1][r + nLevLen] * aCnt[nLevLen][cnt1][cnt2]) % MOD;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(ans[2][1 + deg[1]]);\n\t}\n\n}", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "0be8dc28a02c263270beb6295c34ce88", "src_uid": "db884d679d9cfb1dc4bc511f83beedda", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\npublic class program\n{\n\tpublic static void main(String args[])\n\t{\n\t\tScanner sc=new Scanner(System.in);\n\t int n=sc.nextInt();\n\t int m=sc.nextInt();\n\t int a[]=new int[m];\n\t int x[]=new int[101];\n\t for(int i=0;i<m;i++)\n\t { a[i]=sc.nextInt();\n\t x[a[i]]++;\n\t }\n int l = 0;\n\t\tint r = 101;\n\t\twhile(r - l > 1) {\n\t\t\tint mm = l + r >>> 1;\n\t\t\tint k = 0;\n\t\t\tfor (int i = 0; i <= 100; i++) {\n\t\t\t\tk += x[i] / mm;\n\t\t\t}\n\t\t\tif (k >= n) {\n\t\t\t\tl = mm;\n\t\t\t} else {\n\t\t\t\tr = mm;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(l);\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "implementation", "binary search"], "code_uid": "6d7040bd9e9905e6c119d1ddab9dee3a", "src_uid": "b7ef696a11ff96f2e9c31becc2ff50fe", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.*;\nimport java.io.*;\n\npublic final class Main {\n\n\n public static void main(String[] args) throws Exception {\n PrintWriter pw = new PrintWriter(System.out);\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n StringTokenizer st = new StringTokenizer(br.readLine());\n int n = Integer.parseInt(st.nextToken());\n\n st = new StringTokenizer(br.readLine());\n\n int[] months = new int[]{31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};\n int[] compare = new int[n];\n int index = 0;\n int leapCount = 0;\n while(n-->0){\n int a = Integer.parseInt(st.nextToken());\n compare[index++] = a == 29 ? 28 : a;\n leapCount += a == 29 ? 1 : 0;\n }\n\n if(leapCount > 1){\n System.out.println(\"No\");\n return;\n }\n\n for(int i = 0; i<12; i++){\n if(months[i] != compare[0])\n continue;\n int currMonthIndex = i;\n boolean found = true;\n for(int j = 0; j<compare.length; j++){\n int val = compare[j];\n if(val != months[currMonthIndex])\n found = false;\n currMonthIndex++;\n currMonthIndex%=months.length;\n }\n if(found){\n System.out.println(\"Yes\");\n return;\n }\n }\n\n System.out.println(\"No\");\n\n }\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "1947716d40a34e3a534732ce6967aa94", "src_uid": "d60c8895cebcc5d0c6459238edbdb945", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.lang.*;\nimport java.math.BigInteger;\nimport java.io.*;\nimport java.util.*;\n\npublic class Solution implements Runnable{\n public static BufferedReader br;\n public static PrintWriter out;\n public static StringTokenizer stk;\n public static boolean isStream = true;\n\n public static void main(String[] args) throws IOException {\n \tif (isStream) {\n br = new BufferedReader(new InputStreamReader(System.in));\n } else {\n br = new BufferedReader(new FileReader(\"in.txt\"));\n }\n out = new PrintWriter(System.out);\n new Thread(new Solution()).start();\n }\n\n public void loadLine() {\n try {\n stk = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n\n public String nextLine() {\n try {\n return br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n return \"\";\n }\n }\n\n public String nextWord() {\n while (stk==null||!stk.hasMoreTokens()) loadLine();\n return stk.nextToken();\n }\n\n public Integer nextInt() {\n while (stk==null||!stk.hasMoreTokens()) loadLine();\n return Integer.valueOf(stk.nextToken());\n }\n\n public Long nextLong() {\n while (stk==null||!stk.hasMoreTokens()) loadLine();\n return Long.valueOf(stk.nextToken());\n }\n\n public Double nextDouble() {\n while (stk==null||!stk.hasMoreTokens()) loadLine();\n return Double.valueOf(stk.nextToken());\n }\n \n public Float nextFloat() {\n while (stk==null||!stk.hasMoreTokens()) loadLine();\n return Float.valueOf(stk.nextToken());\n }\n \n public void run() {\n \tint a = nextInt();\n \tint b = nextInt();\n \tint mod = nextInt();\n \tint bnd = Math.min(a, mod);\n \tint ans = -1;\n \tfor (int i = 0; i <= bnd; i++) {\n \t\tlong aa = i*1000000000L%mod;\n \t\tint rem = (int)aa;\n \t\tif (rem != 0 && mod-rem > b) {\n \t\t\tans = i;\n \t\t\tbreak;\n \t\t}\n \t}\n \tif (ans >= 0) {\n \t\tStringBuilder sb = new StringBuilder();\n \t\tfor (int i = 0; i < 9; i++) {\n \t\t\tsb.append(ans%10);\n \t\t\tans/=10;\n \t\t}\n \t\tout.println(1+\" \"+sb.reverse().toString());\n \t} else {\n \t\tout.println(2);\n \t}\n \tout.flush();\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "number theory"], "code_uid": "486e108164666c5be16e3076d448e7c5", "src_uid": "8b6f633802293202531264446d33fee5", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Scanner;\n\n\npublic class RoutineProblem {\n\n\t/**\n\t * @param args\n\t */\n\t\n\tpublic static int GCD(int a, int b) {\n\t\t if (b==0) return a;\n\t\t return GCD(b,a%b);\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\tint d = sc.nextInt();\n\t\tif(a*d == b*c) {\n\t\t\tSystem.out.println(\"0/1\");\n\t\t} else if(a*d > b*c) {\n\t\t\tint g = GCD(a*d-b*c,a*d);\n\t\t\tSystem.out.println((a*d-b*c)/g + \"/\" + a*d/g);\n\t\t} else {\n\t\t\tint g = GCD(b*c-a*d,b*c);\n\t\t\tSystem.out.println((b*c-a*d)/g + \"/\" + b*c/g);\n\t\t}\n\t\t\n\t\t\n\t\t\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["math", "greedy", "number theory"], "code_uid": "4e624bc4fc3c8c05b89b71971c947e69", "src_uid": "b0f435fc2f7334aee0d07524bc37cb1e", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\nimport java.io.*;\n\nimport static java.lang.Math.*;\n\npublic class Main {\n public static void main(String[] args) {\n FastScanner sc = new FastScanner(System.in);\n PrintWriter pw = new PrintWriter(System.out);\n int n = sc.nextInt();\n int[] r = new int[n];\n int[]b = new int[n];\n int cntB = 0;\n int cntR = 0;\n for (int i = 0; i < n; i++)\n r[i] = sc. nextInt();\n for (int i = 0; i < n; i++)\n b[i] = sc.nextInt();\n for (int i = 0; i < n; i++) {\n if(r[i] + b[i] == 2)\n continue;\n if(r[i] == 1)\n cntR++;\n if(b[i] == 1)\n cntB++;\n }\n if (cntR == 0)\n pw.print(\"-1\");\n else\n pw.print((cntB) / cntR + 1);\n pw.close();\n }\n\n public static boolean isVowel(char a) {\n return a == 'a' || a == 'e' || a == 'u' || a == 'o' || a == 'y';\n }\n\n public static long binPow(long a, int n) {\n long p = a;\n long res = 1;\n while (n > 0) {\n if (n % 2 == 1)\n res *= p;\n p *= p;\n n /= 2;\n }\n return res;\n }\n\n public static int gcd(int a, int b) {\n if (a == 0 || b == 0)\n return a + b;\n return gcd(b % a, a);\n }\n\n public static long gcd(long a, long b) {\n if (a == 0 || b == 0)\n return a + b;\n return gcd(b % a, a);\n }\n}\n\nclass FastScanner {\n static BufferedReader br;\n static StringTokenizer st = new StringTokenizer(\"\");\n\n public FastScanner(InputStream inputStream) {\n br = new BufferedReader(new InputStreamReader(inputStream));\n }\n\n public FastScanner(String fileName) throws FileNotFoundException {\n br = new BufferedReader(new FileReader(fileName));\n }\n\n public boolean hasNext() {\n try {\n while (!st.hasMoreTokens())\n st = new StringTokenizer(br.readLine());\n return true;\n } catch (Exception e) {\n return false;\n }\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public String next() {\n hasNext();\n return st.nextToken();\n }\n}\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "ef859df7d9d1ba2fd25356aa2e47ad3b", "src_uid": "b62338bff0cbb4df4e5e27e1a3ffaa07", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\npublic class JavaApplication7 {\n public static void main(String[] args) {\n Scanner obj = new Scanner(System.in);\n long [] arr = new long [3]; \n for(int i=0 ; i<3; i ++) arr[i]=obj.nextLong();\n if(arr[2]<=arr[1])\n System.out.println(arr[2]);\n else if (arr[2]<=(arr[0]))\n System.out.println(arr[1]);\n else{\n long n=arr[2]-arr[0];\n System.out.println(Math.abs(n-arr[1]));\n }\n }}", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "b60ac343eebdecebf56713409a65bb0c", "src_uid": "7e614526109a2052bfe7934381e7f6c2", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.Scanner;\npublic class Taymyriscallingyou{\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint m = sc.nextInt();\n\t\tint z = sc.nextInt();\n\t\tint counter = 0;\n\n\t\tfor(int i = n; i <= z; i = i + n){\n\t\t\tfor(int j = m; j <= i; j = j+m){\n\t\t\t\tif(i == j) counter++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(counter);\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "implementation"], "code_uid": "69cbdc5ad20aa77e1c4a875da272175f", "src_uid": "e7ad55ce26fc8610639323af1de36c2d", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\npublic class StringPlay {\n public static final int UNREACHABLE = 1000;\n\n FastScanner in;\n PrintWriter out;\n\n public void solve() throws IOException {\n int n = in.nextInt();\n char[][] t = new char[n][n];\n for (int i = 0; i < n; i++) {\n t[i] = in.next().toCharArray();\n }\n\n int[] curr = new int[1 << n];\n Arrays.fill(curr, UNREACHABLE);\n curr[1 << (n - 1)] = 0;\n\n int[] next = new int[1 << n];\n Arrays.fill(next, UNREACHABLE);\n int[] nextMask = new int['z' - 'a' + 1];\n int[] charMasks = new int['z' - 'a' + 1];\n\n for (int layer = 2 * n - 2; layer > 0; layer--) {\n boolean first = layer % 2 == 0;\n\n Arrays.fill(charMasks, 0);\n for (int row = 0; row < n; row++) {\n int col = layer - row - 1;\n if (col >= 0 && col < n) {\n int ch = t[row][col] - 'a';\n charMasks[ch] += (1 << row);\n }\n }\n\n for (int charMask : charMasks) {\n for (int state = charMask; state > 0; state = (state - 1) & charMask) {\n Arrays.fill(nextMask, 0);\n char sel = 0;\n for (int row = 0; row < n; row++) {\n int bit = 1 << row;\n if ((state & bit) == 0) {\n continue;\n }\n\n int col = layer - row - 1;\n if (col < 0 || col > n - 1) {\n sel = 0;\n break;\n }\n\n if (sel == 0) {\n sel = t[row][col];\n }\n if (sel != t[row][col]) {\n sel = 0;\n break;\n }\n\n if (col < n - 1) {\n int ch = t[row][col + 1] - 'a';\n nextMask[ch] |= (1 << (row));\n }\n if (row < n - 1) {\n int ch = t[row + 1][col] - 'a';\n nextMask[ch] |= (1 << (row + 1));\n }\n }\n\n if (sel == 0) {\n continue;\n }\n\n int nonrelaxed = UNREACHABLE;\n for (int i = 0; i < nextMask.length; i++) {\n int mask = nextMask[i];\n if (mask == 0) {\n continue;\n }\n\n int add = getValue((char) ('a' + i));\n int from = curr[mask];\n if (from == UNREACHABLE) {\n continue;\n }\n\n if (nonrelaxed == UNREACHABLE) {\n nonrelaxed = from + add;\n } else if (first) {\n nonrelaxed = Math.max(nonrelaxed, from + add);\n } else {\n nonrelaxed = Math.min(nonrelaxed, from + add);\n }\n }\n next[state] = nonrelaxed;\n }\n }\n\n int[] tmp = next;\n next = curr;\n curr = tmp;\n }\n\n int res = curr[1] + getValue(t[0][0]);\n if (res == 0) {\n out.println(\"DRAW\");\n } else {\n out.println(res > 0 ? \"FIRST\" : \"SECOND\");\n }\n }\n\n private int getValue(char c) {\n return c != 'a' ? c == 'b' ? -1 : 0 : 1;\n }\n\n public void run() {\n try {\n in = new FastScanner(System.in);\n out = new PrintWriter(System.out);\n\n solve();\n\n out.close();\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n\n class FastScanner {\n BufferedReader br;\n StringTokenizer st;\n\n FastScanner(InputStream is) {\n br = new BufferedReader(new InputStreamReader(is));\n }\n\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n }\n\n public static void main(String[] arg) {\n new StringPlay().run();\n }\n}", "lang_cluster": "Java", "tags": ["games", "dp", "bitmasks"], "code_uid": "14dceb7f6a0502d6abeca3cf6227c7a6", "src_uid": "d803fe167a96656f8debdc21edd988e4", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.HashSet;\nimport java.util.Scanner;\n\npublic class Chatroom {\n\tpublic static Scanner scan;\n\tstatic String word, tobe;\n\n\tstatic HashSet<Character> hashi = new HashSet<Character>();\n\n\tpublic static void main(String[] args) {\n\t\tscan = new Scanner(System.in);\n\t\tword = scan.nextLine();\n\t\ttobe = \"\";\n\t\tif (isthere('h') && isthere('e') && isthere('l') && isthere('l') && isthere('o')) {\n\t\t\tSystem.out.println(\"YES\");\n\n\t\t} else {\n\t\t\tSystem.out.println(\"NO\");\n\n\t\t}\n\n\t}\n\n\tprivate static boolean isthere(char dude) {\n\t\t// TODO Auto-generated method stub\n\t\tfor (int i = 0; i < word.length(); i++) {\n\t\t\tif (word.charAt(i) == dude) {\n\t\t\t\tword = word.substring(i + 1, word.length());\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["greedy", "strings"], "code_uid": "5fb16e4037f20c80c998b280b3d82d80", "src_uid": "c5d19dc8f2478ee8d9cba8cc2e4cd838", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class Codeforces{\npublic static void main(String args[]){\n\tScanner sc = new Scanner(System.in);\n\tint l = sc.nextInt();\n\tint r = sc.nextInt();\n\tint a = sc.nextInt();\n\tint minval = Math.min(l,r);\n\tint maxval = Math.max(l, r);\n\twhile(minval < maxval && a>0){\n\t\tminval ++ ;\n\t//\tSystem.out.println(\"sldfjsd\");\n\t\ta--;\n\t}\n\twhile((minval == maxval) && a>1){\n\t\tminval++;\n\t\t//System.out.println(\"minval\"+minval);\n\t\t//System.out.println(\"a\"+a);\n\t\tmaxval++;\n\t\t//System.out.println(\"maxval\"+maxval);\n\t\ta = a - 2;\n\n\t}\n\tSystem.out.println(minval*2);\n\t\t\n}\n\n\n\n}", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "4eb1e9268ec808b1d5f67ae975c46e4f", "src_uid": "e8148140e61baffd0878376ac5f3857c", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Arrays;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.IOException;\nimport java.util.StringTokenizer;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Hieu Le\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tPreparingOlympiad solver = new PreparingOlympiad();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass PreparingOlympiad {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.nextInt();\n int l = in.nextInt();\n int r = in.nextInt();\n int x = in.nextInt();\n int[] c = new int[n];\n for (int i = 0; i < n; i++) c[i] = in.nextInt();\n Arrays.sort(c);\n int res = 0;\n for (int i = 1; i < (1 << n); i++) {\n int hi = Integer.highestOneBit(i);\n int lo = Integer.lowestOneBit(i);\n hi = (int)(Math.log(hi) / Math.log(2));\n lo = (int)(Math.log(lo) / Math.log(2));\n if (c[hi] - c[lo] < x) continue;\n int sum = 0;\n for (int j = 0; j < n; j++)\n if ((i & (1 << j)) != 0) sum += c[j];\n if (sum <= r && sum >= l) res ++;\n }\n out.println(res);\n }\n}\n\nclass InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n}\n\n", "lang_cluster": "Java", "tags": ["brute force", "bitmasks"], "code_uid": "1e4dd0899ecbfbb7ae995c7671330fe0", "src_uid": "0d43104a0de924cdcf8e4aced5aa825d", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.Scanner;\n\n/**\n * Hello world!\n */\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String s = sc.next();\n int start = 0;\n int score = 0;\n for (int i = 0; i < s.length(); i++) {\n int charIndex = s.charAt(i) - 97;\n int walk = Math.abs(start - charIndex);\n\n\n if(walk < 13){\n score += walk;\n }else{\n score += 26 - walk;\n }\n start = charIndex;\n }\n System.out.println(score);\n }\n}\n", "lang_cluster": "Java", "tags": ["strings", "implementation"], "code_uid": "b7c4525efd17ffde3c7d2cae5e682d83", "src_uid": "ecc890b3bdb9456441a2a265c60722dd", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "/*\n * To change this license header, choose License Headers in Project Properties.\n * To change this template file, choose Tools | Templates\n * and open the template in the editor.\n */\n\nimport java.awt.Point;\nimport java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\nimport java.text.*;\n\n/**\n *\n * @author zulkan\n */\npublic class bearAndCompressing {\n\n static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n static PrintWriter out = new PrintWriter(System.out);\n static Scanner sc = new Scanner(System.in);\n\n public static String getString() {\n try {\n return br.readLine();\n } catch (Exception e) {\n }\n return \"\";\n }\n\n public static Integer getInt() {\n try {\n return Integer.parseInt(br.readLine());\n } catch (Exception e) {\n }\n return 0;\n }\n\n public static Integer[] getIntArr() {\n try {\n StringTokenizer temp = new StringTokenizer(br.readLine());\n int n = temp.countTokens();\n Integer temp2[] = new Integer[n];\n for (int i = 0; i < n; i++) {\n temp2[i] = Integer.parseInt(temp.nextToken());\n }\n return temp2;\n } catch (Exception e) {\n }\n return null;\n }\n\n public static Long[] getLongArr() {\n try {\n StringTokenizer temp = new StringTokenizer(br.readLine());\n int n = temp.countTokens();\n Long temp2[] = new Long[n];\n for (int i = 0; i < n; i++) {\n temp2[i] = Long.parseLong(temp.nextToken());\n }\n return temp2;\n } catch (Exception e) {\n }\n return null;\n }\n\n public static String[] getStringArr() {\n try {\n StringTokenizer temp = new StringTokenizer(br.readLine());\n int n = temp.countTokens();\n String temp2[] = new String[n];\n for (int i = 0; i < n; i++) {\n temp2[i] = (temp.nextToken());\n }\n return temp2;\n } catch (Exception e) {\n }\n return null;\n }\n\n public static void print(Object a) {\n out.print(a);\n }\n\n public static void println(Object a) {\n out.println(a);\n }\n\n public static void printf(String s, Object... a) {\n out.printf(s, a);\n }\n\n public static int nextInt() {\n return sc.nextInt();\n }\n\n public static double nextDouble() {\n return sc.nextDouble();\n }\n\n public static void main(String[] ar) {\n bearAndCompressing c = new bearAndCompressing();\n c.solve();\n out.flush();\n }\n\n public void solve() {\n Integer xx[] = getIntArr();\n int n = xx[0], k = xx[1];\n\n Map<String, List<String>> he = new HashMap();\n for (int i = 0; i < k; i++) {\n String x[] = getStringArr();\n\n if (!he.containsKey(x[1])) {\n he.put(x[1], new ArrayList<String>());\n }\n he.get(x[1]).add(x[0]);\n\n }\n HashSet<String> sdh = new HashSet<String>();\n LinkedList<String> Q = new LinkedList<>();\n\n Q.add(\"a\");\n int f = 0;\n while (Q.size() > 0 && Q.peek().length() < n) {\n String p = Q.remove();\n\n List<String> ne = he.get(p.charAt(0) + \"\");\n\n if (ne != null) {\n for (String ss : ne) {\n String next = ss + p.substring(1);\n if (!sdh.contains(next)) {\n //System.out.println(\"MASUKIN \"+next);\n sdh.add(next);\n Q.add(next);\n if(next.length() == n) {\n f++;\n }\n }\n }\n }\n }\n // println(Q);\n println(f);\n\n }\n\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "strings", "dp", "brute force"], "code_uid": "4308079b3ddfdc759288aac4ff6dd951", "src_uid": "c42abec29bfd17de3f43385fa6bea534", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\n\n\npublic class jdssj {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tint i;\n\t\tfor( i=1;i<50;i++) {\n\t\t\tif((1<<i)>n)break;\n\t\t}\n\t\tSystem.out.println(i);\n\t}\n\tstatic class Scanner {\n\t\tStringTokenizer st;\n\t\tBufferedReader br;\n\n\t\tpublic Scanner(InputStream s) {\n\t\t\tbr = new BufferedReader(new InputStreamReader( s));\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\twhile (st == null || !st.hasMoreTokens())\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic long nextLong() throws IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic String nextLine() throws IOException {\n\t\t\treturn br.readLine();\n\t\t}\n\n\t\tpublic double nextDouble() throws IOException {\n\t\t\tString x = next();\n\t\t\tStringBuilder sb = new StringBuilder(\"0\");\n\t\t\tdouble res = 0, f = 1;\n\t\t\tboolean dec = false, neg = false;\n\t\t\tint start = 0;\n\t\t\tif (x.charAt(0) == '-') {\n\t\t\t\tneg = true;\n\t\t\t\tstart++;\n\t\t\t}\n\t\t\tfor (int i = start; i < x.length(); i++)\n\t\t\t\tif (x.charAt(i) == '.') {\n\t\t\t\t\tres = Long.parseLong(sb.toString());\n\t\t\t\t\tsb = new StringBuilder(\"0\");\n\t\t\t\t\tdec = true;\n\t\t\t\t} else {\n\t\t\t\t\tsb.append(x.charAt(i));\n\t\t\t\t\tif (dec)\n\t\t\t\t\t\tf *= 10;\n\t\t\t\t}\n\t\t\tres += Long.parseLong(sb.toString()) / f;\n\t\t\treturn res * (neg ? -1 : 1);\n\t\t}\n\n\t\tpublic boolean ready() throws IOException {\n\t\t\treturn br.ready();\n\t\t}\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["math", "greedy", "constructive algorithms"], "code_uid": "2e2898383db085555576ac0e6c3fec2f", "src_uid": "95cb79597443461085e62d974d67a9a0", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedOutputStream;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class EducationalRound86E {\n\n\tpublic static long mod = 998244353;\n\tpublic static int max = (int)4e5+10;\n\tpublic static long[] fact;\n\tpublic static long[] infact;\n\t\n\tpublic static void PreCompute() {\n\t\tfact = new long[max];\n\t\tinfact = new long[max];\n\t\tfact[0] = fact[1] = infact[0] = infact[1] = 1;\n\t\tfor(int i = 2; i < max; i++) {\n\t\t\tfact[i] = (fact[i - 1] * (long)i)%mod;\n\t\t\tinfact[i] = (infact[i - 1] * (long)ModInverse(i, mod))%mod;\n\t\t}\n\t}\n\t\n\tpublic static long nCr(int n, int r) {\n\t\tlong ans = fact[n] * infact[r];\n\t\tans %= mod;\n\t\tans *= infact[n - r];\n\t\tans %= mod;\n\t\treturn ans;\n\t}\n\t\n\tpublic static long fast(long a, long n) {\n\t\tif(n == 0) return 1L;\n\t\tlong ans = fast(a, n/2L);\n\t\tans = ans * ans;\n\t\tans %= mod;\n\t\tif(n%2 == 1) {\n\t\t\tans = ans * a;\n\t\t\tans %= mod;\n\t\t}\n\t\treturn ans;\n\t}\n\t\n\tpublic static void solve() {\n\t\tPreCompute();\n\t\tint n = s.nextInt();\n\t\tlong k = s.nextLong();\n\t\tif(k == 0) {\n\t\t\tout.println(fact[n]);\n\t\t\treturn;\n\t\t}\n\t\tif(n <= k) {\n\t\t\tout.println(0);\n\t\t\treturn;\n\t\t}\n\t\tlong ans = nCr(n, (int)k);\n\t\tint cols = n - (int)k;\n\t\tlong sum = 0;\n\t\tfor(int i = 0; i <= cols; i ++) {\n\t\t\tlong tempans = nCr(cols, i);\n\t\t\ttempans *= fast(cols - i, n);\n\t\t\ttempans %= mod;\n\t\t\tif((i&1)==1) {\n\t\t\t\tsum -= tempans;\n\t\t\t\tif(sum < 0) sum += mod;\n\t\t\t}else {\n\t\t\t\tsum+=tempans;\n\t\t\t\tif(sum >= mod) sum -= mod;\n\t\t\t}\n\t\t}\n\t\tout.println((2 * ((ans * sum)%mod))%mod);\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tout = new PrintWriter(new BufferedOutputStream(System.out));\n\t\ts = new FastReader();\n\t\tsolve();\n\t\tout.close();\n\t}\n\n\tpublic static class Triplet {\n\t\tlong gcd;\n\t\tlong x;\n\t\tlong y;\n\n\t\tTriplet(long gcd, long x, long y) {\n\t\t\tthis.gcd = gcd;\n\t\t\tthis.x = x;\n\t\t\tthis.y = y;\n\t\t}\n\t}\n\n\tpublic static Triplet ExtendedEuclideanAlgo(long a, long b) {\n\t\tif (a == 0) {\n\t\t\treturn new Triplet(b, 0, 1);\n\t\t}\n\t\tTriplet ans = ExtendedEuclideanAlgo(b % a, a);\n\t\tlong x = ans.y - (b / a) * ans.x;\n\t\tlong y = ans.x;\n\t\treturn new Triplet(ans.gcd, x, y);\n\t}\n\n\tpublic static long ModInverse(long a, long m) {\n\t\tTriplet ans = ExtendedEuclideanAlgo(a, m);\n\t\tif (ans.gcd != 1) {\n\t\t\t//System.out.println(\"Multiplicative inverse doesnot exist\");\n\t\t\treturn -1;\n\t\t} else {\n\t\t\t//m is added to handle negative x\n\t\t\tlong result = (ans.x % m + m) % m;\n\t\t\treturn result;\n\t\t}\n\t}\n\t\n\tpublic static FastReader s;\n\tpublic static PrintWriter out;\n\n\tpublic static class FastReader {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tpublic FastReader() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tString next() {\n\t\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (Exception e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tString nextLine() {\n\t\t\tString str = \"\";\n\t\t\ttry {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (Exception e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn str;\n\t\t}\n\t}\n\n\t\n}\n", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "d35a8871c92b98d0ed609d81b9f007cf", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\n/*\nprocrastinating\n*/\n\npublic class Main {\n\n static FastReader in;\n static PrintWriter out;\n static Random rand = new Random();\n static final int INF = (int) (1e9 + 10);\n static final int MOD = 998244353;\n static final int N = (int) (2e5 + 10);\n\n static long[] f, f1;\n\n static long pow(long a, long b) {\n long res = 1;\n while (b != 0) {\n if ((b & 1) == 1)\n res = (res * a) % MOD;\n a = (a * a) % MOD;\n b >>= 1;\n }\n return res;\n }\n\n static long C(int n, int k) {\n return f[n] * f1[k] % MOD * f1[n - k] % MOD;\n }\n\n static void precalc() {\n f = new long[N];\n f[0] = 1;\n for (int i = 1; i < N; i++)\n f[i] = (f[i - 1] * i) % MOD;\n\n f1 = new long[N];\n for (int i = 0; i < N; i++)\n f1[i] = pow(f[i], MOD - 2);\n }\n\n static void solve() {\n precalc();\n\n int n = in.nextInt();\n long k = in.nextLong();\n\n if (k > n - 1) {\n out.println(0);\n return;\n }\n if (k == 0) {\n out.println(f[n]);\n return;\n }\n\n int m = n - (int) k;\n\n long res = 0;\n for (int i = 0; i <= m - 1; i++) {\n long sign = i % 2 == 0 ? 1L : -1L;\n res += sign * C(m, i) * pow(m - i, n) % MOD;\n res %= MOD;\n }\n if (res < 0)\n res += MOD;\n\n long ans = 2L * res * C(n, m) % MOD;\n out.println(ans);\n }\n\n public static void main(String[] args) throws FileNotFoundException, InterruptedException {\n in = new FastReader(System.in);\n// in = new FastReader(new FileInputStream(\"sometext.txt\"));\n out = new PrintWriter(System.out);\n// out = new PrintWriter(new FileOutputStream(\"output.txt\"));\n\n Thread thread = new Thread(null, () -> {\n int tests = 1;\n// tests = in.nextInt();\n\n while (tests-- > 0) {\n solve();\n }\n }, \"Go\", 1 << 28);\n thread.start();\n thread.join();\n\n// out.flush();\n out.close();\n }\n\n static class FastReader {\n BufferedReader br;\n StringTokenizer st;\n\n FastReader(InputStream is) {\n br = new BufferedReader(new InputStreamReader(is));\n }\n\n Integer nextInt() {\n return Integer.parseInt(next());\n }\n\n Long nextLong() {\n return Long.parseLong(next());\n }\n\n Double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(nextLine());\n }\n return st.nextToken();\n }\n\n String nextLine() {\n String s = \"\";\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return s;\n }\n }\n}", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "70c34170c11ec345fb251e712a8d3f87", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/*\n ID: tommatt1\n LANG: JAVA\n TASK: \n*/\nimport java.util.*;\nimport java.io.*;\npublic class cf1342e{\nstatic int mod=998244353;\n\n\tpublic static void main(String[] args)throws IOException {\n\t\tPrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n\t\tBufferedReader bf=new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st=new StringTokenizer(bf.readLine());\n\t\tint n=Integer.parseInt(st.nextToken());\n\t\tlong k=Long.parseLong(st.nextToken());\n\t\tif(k>n) {\n\t\t\tout.println(0);\n\t\t\tout.close();\n\t\t\tSystem.exit(0);\n\t\t}\n\t\tint a=n-(int)k;\n\t\tlong ncr=1;\n\t\tlong ans=0;\n\t\tfor(int i=a;i>0;i--) {\n\t\t\tlong sgn=(a-i)%2==0?1:-1;\n\t\t\tans+=sgn*ncr*fexp(i,n);\n\t\t\tans%=mod;\n\t\t\tans=(ans+mod)%mod;\n\t\t\tncr=(ncr*i+mod)%mod;\n\t\t\tncr=(ncr*fexp(a-i+1,mod-2)+mod)%mod;\n\t\t}\n\t\ta=Math.max(a, (int)k);\n\t\tfor(int i=a+1;i<=n;i++) {\n\t\t\tans=(ans*i+mod)%mod;\n\t\t}\n\t\tfor(int i=1;i<=n-a;i++) {\n\t\t\tans=(ans*fexp(i,mod-2)+mod)%mod;\n\t\t}\n\t\tif(k!=0) {\n\t\t\tans*=2;\n\t\t\tans%=mod;\n\t\t}\n\t\tout.println(ans);\n\t\tout.close();\n\t}\n\tpublic static long fexp(long a,long e)\n\t{\n\t\tif(e==0) return 1;\n\t\tlong tmp = fexp(a,e/2);\n\t\ttmp = (tmp*((long)tmp))%mod;\n\t\tif(e%2==1) tmp = (tmp*((long)a))%mod;\n\t\treturn tmp;\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "f5fb46315a64ee56cbdef28ea5b60ce1", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.text.*;\nimport java.util.*;\nimport java.math.*;\npublic class template {\n\tpublic static void main(String[] args) throws Exception {\n\t\tnew template().run();\n\t}\n\tpublic void run() throws Exception {\n\t\tFastScanner f = new FastScanner();\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tint n = f.nextInt(); long k = f.nextLong();\n\t\tif(k >= n) out.println(0);\n\t\telse {\n\t\t\tlong[] fact = new long[n+1];\n\t\t\tlong[] inv = new long[n+1];\n\t\t\tfact[0] = 1;\n\t\t\tinv[0] = 1;\n\t\t\tfor(int i = 1; i <= n; i++) {\n\t\t\t\tfact[i] = i*fact[i-1]%MOD;\n\t\t\t\tinv[i] = inv(fact[i],MOD);\n\t\t\t}\n\t\t\tint r = (int) (n-k);\n\t\t\tlong ways = 0;\n\t\t\tfor(int i = 1; i <= r; i++) {\n\t\t\t\tlong l = fact[r]*inv[r-i]%MOD*inv[i]%MOD*exp(i,n)%MOD;\n\t\t\t\tif((r-i) % 2 == 1) l *= -1;\n\t\t\t\tways = ((l+ways)%MOD+MOD)%MOD;\n\t\t\t}\n\t\t\tif(k == 0)\n\t\t\t\tout.println(ways*fact[n]%MOD*inv[r]%MOD*inv[n-r]%MOD);\n\t\t\telse out.println(2*ways%MOD*fact[n]%MOD*inv[r]%MOD*inv[n-r]%MOD);\n\t\t}\n\t\tout.flush();\n\t}\n\tlong x, y,MOD = 998244353;\n\tpublic long exp(long a, long e) {\n\t\tif(e == 0) return 1;\n\t\tif(e == 1) return a;\n\t\tlong r = exp(a,e>>1);\n\t\tr = r*r%MOD;\n\t\tif((e&1) == 1) r = r*a%MOD;\n\t\treturn r;\n\t}\n\tpublic long inv(long a, long b) {\n\t\tx = 0; y = 1;\n\t\tgcdExt(a,b);\n\t\treturn (x%b+b)%b;\n\t}\n\tpublic void gcdExt(long a, long b) {\n\t\tif(a*b == 0) return;\n\t\tgcdExt(b%a, a);\n\t\tlong nx = y - b/a*x;\n\t\tlong ny = x;\n\t\tx = nx;\n\t\ty = ny;\n\t}\n static class FastScanner {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n public FastScanner() {\n reader = new BufferedReader(new InputStreamReader(System.in), 32768);\n tokenizer = null;\n }\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n public int nextInt() {\n return Integer.parseInt(next());\n }\n public long nextLong() {\n \treturn Long.parseLong(next());\n }\n public double nextDouble() {\n \treturn Double.parseDouble(next());\n }\n public String nextLine() {\n \ttry {\n \t\treturn reader.readLine();\n \t} catch(IOException e) {\n \t\tthrow new RuntimeException(e);\n \t}\n }\n }\n}", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "29b3e4a4bed867b544a6cb7516e93b3f", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.UncheckedIOException;\nimport java.io.Closeable;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.InputStream;\n \n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) throws Exception {\n Thread thread = new Thread(null, new TaskAdapter(), \"\", 1 << 27);\n thread.start();\n thread.join();\n }\n \n static class TaskAdapter implements Runnable {\n @Override\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastInput in = new FastInput(inputStream);\n FastOutput out = new FastOutput(outputStream);\n EPlacingRooks solver = new EPlacingRooks();\n solver.solve(1, in, out);\n out.close();\n }\n }\n \n static class EPlacingRooks {\n public void solve(int testNumber, FastInput in, FastOutput out) {\n int n = in.readInt();\n int k = in.readInt();\n Modular mod = new Modular(998244353);\n int m = n - k;\n \n if (k == 0) {\n int ans = 1;\n for (int i = 1; i <= n; i++) {\n ans = mod.mul(ans, i);\n }\n out.println(ans);\n return;\n }\n if (m <= 0 || m > n) {\n out.println(0);\n return;\n }\n \n PrimeCombination combination = new PrimeCombination(n, mod);\n Power power = new Power(mod);\n int ans = 0;\n for (int i = 0; i <= m; i++) {\n int local = combination.combination(m, i);\n if (i % 2 == 1) {\n local = mod.valueOf(-local);\n }\n local = mod.mul(local, power.pow(m - i, n));\n ans = mod.plus(ans, local);\n }\n ans = mod.mul(ans, combination.combination(n, m));\n \n ans = mod.mul(ans, 2);\n out.println(ans);\n }\n \n }\n \n static interface IntCombination {\n }\n \n static class FastOutput implements AutoCloseable, Closeable, Appendable {\n private StringBuilder cache = new StringBuilder(10 << 20);\n private final Writer os;\n \n public FastOutput append(CharSequence csq) {\n cache.append(csq);\n return this;\n }\n \n public FastOutput append(CharSequence csq, int start, int end) {\n cache.append(csq, start, end);\n return this;\n }\n \n public FastOutput(Writer os) {\n this.os = os;\n }\n \n public FastOutput(OutputStream os) {\n this(new OutputStreamWriter(os));\n }\n \n public FastOutput append(char c) {\n cache.append(c);\n return this;\n }\n \n public FastOutput append(int c) {\n cache.append(c);\n return this;\n }\n \n public FastOutput println(int c) {\n return append(c).println();\n }\n \n public FastOutput println() {\n cache.append(System.lineSeparator());\n return this;\n }\n \n public FastOutput flush() {\n try {\n os.append(cache);\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n return this;\n }\n \n public void close() {\n flush();\n try {\n os.close();\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n \n public String toString() {\n return cache.toString();\n }\n \n }\n \n static class InverseNumber {\n int[] inv;\n \n public InverseNumber(int[] inv, int limit, Modular modular) {\n this.inv = inv;\n inv[1] = 1;\n int p = modular.getMod();\n for (int i = 2; i <= limit; i++) {\n int k = p / i;\n int r = p % i;\n inv[i] = modular.mul(-k, inv[r]);\n }\n }\n \n public InverseNumber(int limit, Modular modular) {\n this(new int[limit + 1], limit, modular);\n }\n \n }\n \n static class FastInput {\n private final InputStream is;\n private byte[] buf = new byte[1 << 20];\n private int bufLen;\n private int bufOffset;\n private int next;\n \n public FastInput(InputStream is) {\n this.is = is;\n }\n \n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n bufLen = -1;\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n \n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n \n public int readInt() {\n int sign = 1;\n \n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n \n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n \n return val;\n }\n \n }\n \n static class PrimeCombination implements IntCombination {\n final Factorial factorial;\n final Modular modular;\n \n public PrimeCombination(Factorial factorial) {\n this.factorial = factorial;\n this.modular = factorial.getModular();\n }\n \n public PrimeCombination(int limit, Modular modular) {\n this(new Factorial(limit, modular));\n }\n \n public int combination(int m, int n) {\n if (n > m) {\n return 0;\n }\n return modular.mul(modular.mul(factorial.fact(m), factorial.invFact(n)), factorial.invFact(m - n));\n }\n \n }\n \n static class Modular {\n int m;\n \n public int getMod() {\n return m;\n }\n \n public Modular(int m) {\n this.m = m;\n }\n \n public Modular(long m) {\n this.m = (int) m;\n if (this.m != m) {\n throw new IllegalArgumentException();\n }\n }\n \n public Modular(double m) {\n this.m = (int) m;\n if (this.m != m) {\n throw new IllegalArgumentException();\n }\n }\n \n public int valueOf(int x) {\n x %= m;\n if (x < 0) {\n x += m;\n }\n return x;\n }\n \n public int valueOf(long x) {\n x %= m;\n if (x < 0) {\n x += m;\n }\n return (int) x;\n }\n \n public int mul(int x, int y) {\n return valueOf((long) x * y);\n }\n \n public int plus(int x, int y) {\n return valueOf(x + y);\n }\n \n public String toString() {\n return \"mod \" + m;\n }\n \n }\n \n static class Factorial {\n int[] fact;\n int[] inv;\n Modular modular;\n \n public Modular getModular() {\n return modular;\n }\n \n public Factorial(int[] fact, int[] inv, InverseNumber in, int limit, Modular modular) {\n this.modular = modular;\n this.fact = fact;\n this.inv = inv;\n fact[0] = inv[0] = 1;\n for (int i = 1; i <= limit; i++) {\n fact[i] = modular.mul(fact[i - 1], i);\n inv[i] = modular.mul(inv[i - 1], in.inv[i]);\n }\n }\n \n public Factorial(int limit, Modular modular) {\n this(new int[limit + 1], new int[limit + 1], new InverseNumber(limit, modular), limit, modular);\n }\n \n public int fact(int n) {\n return fact[n];\n }\n \n public int invFact(int n) {\n return inv[n];\n }\n \n }\n \n static class Power {\n final Modular modular;\n \n public Power(Modular modular) {\n this.modular = modular;\n }\n \n public int pow(int x, int n) {\n if (n == 0) {\n return modular.valueOf(1);\n }\n long r = pow(x, n >> 1);\n r = modular.valueOf(r * r);\n if ((n & 1) == 1) {\n r = modular.valueOf(r * x);\n }\n return (int) r;\n }\n \n }\n}", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "e81cf5d1e83024f7513a821ed5038691", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.StringTokenizer;\nimport java.io.BufferedReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n EPlacingRooks solver = new EPlacingRooks();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class EPlacingRooks {\n NumberTheory.Mod998 mod = new NumberTheory.Mod998();\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.nextInt();\n long k = in.nextLong();\n if (k == 0) {\n out.println(mod.fact(n));\n return;\n }\n\n if (k > n - 1) {\n out.println(0);\n return;\n }\n\n // This is the number of columns that are non-empty.\n int c = (int) (n - k);\n\n long answer = 0;\n for (int i = 1; i <= c; i++) {\n // i is the number of allowable columns to put things\n answer = mod.add(answer, mod.mult(mod.paritySign(c - i), mod.ncr(c, i), mod.pow(i, n)));\n }\n\n // Multiply by 2 C(n, c) because we want to pick c rows or c columns.\n answer = mod.mult(answer, 2, mod.ncr(n, c));\n\n out.println(answer);\n }\n\n }\n\n static class NumberTheory {\n private static void ASSERT(boolean assertion) {\n if (!assertion)\n throw new AssertionError();\n }\n\n public abstract static class Modulus<M extends NumberTheory.Modulus<M>> {\n final ArrayList<Long> factorial = new ArrayList<>();\n final ArrayList<Long> invFactorial = new ArrayList<>();\n\n public abstract long modulus();\n\n public Modulus() {\n super();\n factorial.add(1L);\n invFactorial.add(1L);\n }\n\n public long fact(int n) {\n while (factorial.size() <= n) {\n factorial.add(mult(factorial.get(factorial.size() - 1), factorial.size()));\n }\n\n return factorial.get(n);\n }\n\n public long fInv(int n) {\n int lastKnown = invFactorial.size() - 1;\n\n if (lastKnown < n) {\n long[] fInv = new long[n - lastKnown];\n fInv[0] = inv(fact(n));\n for (int i = 1; i < fInv.length; i++) {\n fInv[i] = mult(fInv[i - 1], n - i + 1);\n }\n for (int i = fInv.length - 1; i >= 0; i--) {\n invFactorial.add(fInv[i]);\n }\n }\n\n return invFactorial.get(n);\n }\n\n public long paritySign(long k) {\n return (k & 1) == 0 ? 1 : modulus() - 1;\n }\n\n public long ncr(int n, int r) {\n ASSERT(n >= 0);\n if (r < 0 || n < r)\n return 0;\n return mult(fact(n), mult(fInv(r), fInv(n - r)));\n }\n\n public long normalize(long x) {\n x %= modulus();\n if (x < 0)\n x += modulus();\n return x;\n }\n\n public long add(long a, long b) {\n long v = a + b;\n return v < modulus() ? v : v - modulus();\n }\n\n public long mult(long... x) {\n long r = 1;\n for (long i : x)\n r = mult(r, i);\n return r;\n }\n\n public long mult(long a, long b) {\n return (a * b) % modulus();\n }\n\n public long pow(long x, int e) {\n if (e < 0) {\n x = inv(x);\n e *= -1;\n }\n if (e == 0)\n return 1;\n if ((e & 1) > 0)\n return mult(x, pow(x, e - 1));\n return pow(mult(x, x), e / 2);\n }\n\n public long inv(long value) {\n long g = modulus(), x = 0, y = 1;\n for (long r = value; r != 0; ) {\n long q = g / r;\n g %= r;\n\n long temp = g;\n g = r;\n r = temp;\n\n x -= q * y;\n\n temp = x;\n x = y;\n y = temp;\n }\n\n ASSERT(g == 1);\n ASSERT(y == modulus() || y == -modulus());\n\n return normalize(x);\n }\n\n }\n\n public static class Mod998 extends NumberTheory.Modulus<NumberTheory.Mod998> {\n public long modulus() {\n return 998_244_353L;\n }\n\n }\n\n }\n\n static class InputReader {\n public final BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "e0e23ce9357aa526fc63c28cffad2a7b", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\npublic class Main {\n\n private static void solve() {\n int mod = 998244353;\n int n = ni();\n long k = nl();\n\n if ((long) n <= k) {\n System.out.println(0);\n } else if (k == 0) {\n long ret = 1;\n for (int i = 1; i <= n; i++) {\n ret *= i;\n ret %= mod;\n }\n System.out.println(ret);\n } else {\n int m = (int) k;\n int[][] fif = enumFIF(n * 3, mod);\n long ret = 0;\n\n for (int i = n - m, s = 0; i >= 1; i--, s++) {\n long x = C(n, i, mod, fif);\n x *= pow(i, n, mod);\n x %= mod;\n x *= C(n - i, m, mod, fif);\n x %= mod;\n\n\n if (s % 2 == 0) {\n ret += x;\n } else {\n ret += mod - x;\n }\n ret %= mod;\n }\n System.out.println(ret * 2 % mod);\n }\n }\n\n public static long pow(long a, long n, long mod) {\n // a %= mod;\n long ret = 1;\n int x = 63 - Long.numberOfLeadingZeros(n);\n for (; x >= 0; x--) {\n ret = ret * ret % mod;\n if (n << 63 - x < 0)\n ret = ret * a % mod;\n }\n return ret;\n }\n\n\n public static long C(int n, int r, int mod, int[][] fif) {\n if (n < 0 || r < 0 || r > n)\n return 0;\n return (long) fif[0][n] * fif[1][r] % mod * fif[1][n - r] % mod;\n }\n\n\n public static int[][] enumFIF(int n, int mod) {\n int[] f = new int[n + 1];\n int[] invf = new int[n + 1];\n f[0] = 1;\n for (int i = 1; i <= n; i++) {\n f[i] = (int) ((long) f[i - 1] * i % mod);\n }\n long a = f[n];\n long b = mod;\n long p = 1, q = 0;\n while (b > 0) {\n long c = a / b;\n long d;\n d = a;\n a = b;\n b = d % b;\n d = p;\n p = q;\n q = d - c * q;\n }\n invf[n] = (int) (p < 0 ? p + mod : p);\n for (int i = n - 1; i >= 0; i--) {\n invf[i] = (int) ((long) invf[i + 1] * (i + 1) % mod);\n }\n return new int[][] {f, invf};\n }\n\n\n public static void main(String[] args) {\n new Thread(null, new Runnable() {\n @Override\n public void run() {\n long start = System.currentTimeMillis();\n String debug = args.length > 0 ? args[0] : null;\n if (debug != null) {\n try {\n is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);\n solve();\n out.flush();\n tr((System.currentTimeMillis() - start) + \"ms\");\n }\n }, \"\", 64000000).start();\n }\n\n private static java.io.InputStream is = System.in;\n private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);\n private static java.util.StringTokenizer tokenizer = null;\n private static java.io.BufferedReader reader;\n\n public static String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new java.util.StringTokenizer(reader.readLine());\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n private static double nd() {\n return Double.parseDouble(next());\n }\n\n private static long nl() {\n return Long.parseLong(next());\n }\n\n private static int[] na(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = ni();\n return a;\n }\n\n private static char[] ns() {\n return next().toCharArray();\n }\n\n private static long[] nal(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nl();\n return a;\n }\n\n private static int[][] ntable(int n, int m) {\n int[][] table = new int[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n table[i][j] = ni();\n }\n }\n return table;\n }\n\n private static int[][] nlist(int n, int m) {\n int[][] table = new int[m][n];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n table[j][i] = ni();\n }\n }\n return table;\n }\n\n private static int ni() {\n return Integer.parseInt(next());\n }\n\n private static void tr(Object... o) {\n if (is != System.in)\n System.out.println(java.util.Arrays.deepToString(o));\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "40568fca0cb5a56ec917def72738e13e", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n \npublic class utkarsh {\n \n BufferedReader br;\n PrintWriter out;\n \n long mod = (long) (1e9 + 7), inf = (long) (3e18);\n \n long fact[], inv[];\n \n long nCr(int n, int r) {\n return fact[n] * inv[n-r] % mod * inv[r] % mod;\n }\n \n void solve() {\n mod = 998244353L;\n int n = ni();\n long k = nl();\n if(k >= n) out.println(0);\n else {\n fact = new long[n+1];\n inv = new long[n+1];\n fact[0] = inv[0] = 1;\n for(int i = 1; i <= n; i++) fact[i] = (fact[i-1] * i) % mod;\n inv[n] = mp(fact[n], mod - 2);\n for(int i = n-1; i >= 1; i--) inv[i] = ((i+1) * inv[i+1]) % mod;\n \n if(k == 0) out.println(fact[n]);\n else {\n int r = n - (int)k;\n long ans = 0;\n int p = 1;\n for(int i = 0; i < r; i++) {\n ans = (ans + p * nCr(r, i) * mp(r - i, n) % mod) % mod;\n if(ans < 0) ans += mod;\n p *= -1;\n }\n out.println((2 * nCr(n, r) * ans) % mod);\n }\n }\n }\n \n int gcd(int a, int b) {\n if(b == 0) return a;\n return gcd(b, a % b);\n }\n \n long mp(long b, long e) {\n long r = 1;\n while(e > 0) {\n if( (e&1) == 1 ) r = (r * b) % mod;\n b = (b * b) % mod;\n e >>= 1;\n }\n return r;\n }\n \n // -------- I/O Template -------------\n \n char nc() {\n return ns().charAt(0);\n }\n \n String nLine() {\n try {\n return br.readLine();\n } catch(IOException e) {\n return \"-1\";\n }\n }\n \n double nd() {\n return Double.parseDouble(ns());\n }\n \n long nl() {\n return Long.parseLong(ns());\n }\n \n int ni() {\n return Integer.parseInt(ns());\n }\n \n StringTokenizer ip;\n \n String ns() {\n if(ip == null || !ip.hasMoreTokens()) {\n try {\n ip = new StringTokenizer(br.readLine());\n } catch(IOException e) {\n throw new InputMismatchException();\n }\n }\n return ip.nextToken();\n }\n \n void run() {\n br = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n solve();\n out.flush();\n }\n \n public static void main(String[] args) {\n new utkarsh().run();\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "64c64fc4043168c9df9ef716cdbb4e29", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.text.*;\n\npublic class E1342 {\n\n\tstatic long mod = 998244353;\n\n\tstatic long modPow(long a, long e) // O(log e)\n\t{\n\t\ta %= mod;\n\t\tlong res = 1;\n\t\twhile (e > 0) {\n\t\t\tif ((e & 1) == 1)\n\t\t\t\tres = (res * a) % mod;\n\t\t\ta = (a * a) % mod;\n\t\t\te >>= 1;\n\t\t}\n\t\treturn res;\n\t}\n\n\tstatic long[] fac, invfac;\n\n\tpublic static long nck(long n, long k) {\n\t\treturn fac[(int) n] * invfac[(int) k] % mod * invfac[(int) (n - k)] % mod;\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tScanner sc = new Scanner(System.in);\n\t\tPrintWriter pw = new PrintWriter(System.out);\n\t\tlong n = sc.nextInt();\n\t\tlong k = sc.nextLong();\n\t\tif (k >= n) {\n\t\t\tpw.println(0);\n\t\t\tpw.close();\n\t\t\treturn;\n\t\t}\n\t\tfac = new long[(int) n + 1];\n\t\tinvfac = new long[(int) n + 1];\n\t\tfac[0] = 1;\n\t\tfor (int i = 1; i < fac.length; i++) {\n\t\t\tfac[i] = (i * fac[i - 1]) % mod;\n\t\t}\n\t\tinvfac[0] = 1;\n\t\tfor (int i = 1; i < invfac.length; i++) {\n\t\t\tinvfac[i] = (invfac[i - 1] * modPow(i, mod - 2)) % mod;\n\t\t}\n\t\tlong m = n - k;\n\t\tlong posans = 0;\n\t\tlong negans = 0;\n\t\tfor (int i = 0; i <= m; i++) {\n\t\t\tif (i % 2 == 0) {\n\t\t\t\tposans += modPow(m - i, n) * nck(m, i) % mod;\n\t\t\t\tposans %= mod;\n\t\t\t} else {\n\t\t\t\tnegans += modPow(m - i, n) * nck(m, i) % mod;\n\t\t\t\tnegans %= mod;\n\t\t\t}\n\t\t}\n\t\tlong ans = (posans - negans + 2 * mod) % mod;\n\t\tans *= nck(n, m);\n\t\tans %= mod;\n\t\tif (m != n) {\n\t\t\tans *= 2;\n\t\t}\n\t\tans %= mod;\n\t\tpw.println(ans);\n\t\tpw.close();\n\t}\n\n\tstatic class Scanner {\n\t\tStringTokenizer st;\n\t\tBufferedReader br;\n\n\t\tpublic Scanner(InputStream s) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(s));\n\t\t}\n\n\t\tpublic Scanner(FileReader r) {\n\t\t\tbr = new BufferedReader(r);\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\twhile (st == null || !st.hasMoreTokens())\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic long nextLong() throws IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic String nextLine() throws IOException {\n\t\t\treturn br.readLine();\n\t\t}\n\n\t\tpublic double nextDouble() throws IOException {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tpublic int[] nextIntArr(int n) throws IOException {\n\t\t\tint[] arr = new int[n];\n\t\t\tfor (int i = 0; i < arr.length; i++)\n\t\t\t\tarr[i] = nextInt();\n\t\t\treturn arr;\n\t\t}\n\n\t\tpublic boolean ready() throws IOException {\n\t\t\treturn br.ready();\n\t\t}\n\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "eaf391fac3f780804216bfd198c6058e", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.math.*;\nimport java.math.BigDecimal;\nimport java.math.BigInteger;\nimport java.util.*;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.List;\nimport java.util.StringTokenizer;\nimport java.util.function.*;\nimport java.util.function.IntPredicate;\nimport java.util.function.IntToLongFunction;\nimport java.util.function.IntUnaryOperator;\nimport java.util.stream.*;\n\n\npublic class E {\n\n private static final FastReader in = new FastReader();\n private static final FastWriter out = new FastWriter();\n\n public static void main(String[] args) {\n new E().run();\n }\n\n private void run() {\n var t = 1;\n while (t-- > 0) {\n solve();\n }\n\n out.flush();\n }\n\n private void solve() {\n var n = in.nextInt();\n var kt = in.nextLong();\n\n if (kt >= n) {\n out.println(0);\n return;\n }\n\n var k = (int) kt;\n var mod = new Modulo(998244353);\n var facts = mod.factorials(n);\n\n var ans = 0L;\n var c = n - k;\n for (var i = 0; i <= c; i++) {\n var t = mod.times(mod.combination(c, i, facts), mod.pow(c - i, n));\n if (i % 2 == 0) {\n ans = mod.plus(ans, t);\n } else {\n ans = mod.minus(ans, t);\n }\n }\n ans = mod.times(ans, mod.combination(n, n - k, facts));\n\n if (k > 0) ans = mod.times(ans, 2);\n out.println(ans);\n }\n\n}\n\n\nclass FastReader {\n\n private static final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n private static StringTokenizer in;\n\n public String next() {\n while (in == null || !in.hasMoreTokens()) {\n try {\n in = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n return null;\n }\n }\n return in.nextToken();\n }\n\n public BigDecimal nextBigDecimal() {\n return new BigDecimal(next());\n }\n\n public BigInteger nextBigInteger() {\n return new BigInteger(next());\n }\n\n public boolean nextBoolean() {\n return Boolean.valueOf(next());\n }\n\n public byte nextByte() {\n return Byte.valueOf(next());\n }\n\n public double nextDouble() {\n return Double.valueOf(next());\n }\n\n public double[] nextDoubleArray(int length) {\n var a = new double[length];\n for (var i = 0; i < length; i++) {\n a[i] = nextDouble();\n }\n return a;\n }\n\n public int nextInt() {\n return Integer.valueOf(next());\n }\n\n public int[] nextIntArray(int length) {\n var a = new int[length];\n for (var i = 0; i < length; i++) {\n a[i] = nextInt();\n }\n return a;\n }\n\n public long nextLong() {\n return Long.valueOf(next());\n }\n\n public long[] nextLongArray(int length) {\n var a = new long[length];\n for (var i = 0; i < length; i++) {\n a[i] = nextLong();\n }\n return a;\n }\n\n}\n\n\nclass FastWriter extends PrintWriter {\n\n public FastWriter() {\n super(System.out);\n }\n\n public void println(boolean[] a) {\n for (var i = 0; i < a.length; i++) {\n print(a[i]);\n print(i + 1 < a.length ? ' ' : '\\n');\n }\n }\n\n public void println(double[] a) {\n for (var i = 0; i < a.length; i++) {\n print(a[i]);\n print(i + 1 < a.length ? ' ' : '\\n');\n }\n }\n\n public void println(int[] a) {\n for (var i = 0; i < a.length; i++) {\n print(a[i]);\n print(i + 1 < a.length ? ' ' : '\\n');\n }\n }\n\n public void println(long[] a) {\n for (var i = 0; i < a.length; i++) {\n print(a[i]);\n print(i + 1 < a.length ? ' ' : '\\n');\n }\n }\n\n public void println(Object... a) {\n for (var i = 0; i < a.length; i++) {\n print(a[i]);\n print(i + 1 < a.length ? ' ' : '\\n');\n }\n }\n\n public <T> void println(List<T> l) {\n println(l.toArray());\n }\n\n public void debug(String name, Object o) {\n String value = Arrays.deepToString(new Object[] { o });\n value = value.substring(1, value.length() - 1);\n System.err.println(name + \" => \" + value);\n }\n\n}\n\n\nclass MathUtils {\n\n public static final double EPS = 1e-12;\n\n public static final Comparator<Double> EPS_COMPARATOR = (x, y) -> {\n if (x + EPS < y) {\n return -1;\n } else if (x - EPS > y) {\n return 1;\n } else {\n return 0;\n }\n };\n\n public static int compare(double x, double y) {\n return EPS_COMPARATOR.compare(x, y);\n }\n\n /**\n * Returns the index of the first element in the range <b>[left, right)</b> which <i>leftShouldAdvance</i> tested to\n * be <i>false</i>.\n */\n public static int binarySearch(int left, int right, IntPredicate leftShouldAdvance) {\n while (left < right) {\n var mid = left + (right - left) / 2;\n if (leftShouldAdvance.test(mid)) {\n left = mid + 1;\n } else {\n right = mid;\n }\n }\n\n return left;\n }\n\n /**\n * Returns the index of the first element in <i>a</i> which >= <i>x</i>.\n */\n public static int lowerBound(int[] a, int x) {\n return binarySearch(0, a.length, mid -> a[mid] < x);\n }\n\n public static int lowerBound(long[] a, long x) {\n return binarySearch(0, a.length, mid -> a[mid] < x);\n }\n\n /**\n * Returns the index of the first element in <i>a</i> which > <i>x</i>.\n */\n public static int upperBound(int[] a, int x) {\n return binarySearch(0, a.length, mid -> a[mid] <= x);\n }\n\n public static int upperBound(long[] a, long x) {\n return binarySearch(0, a.length, mid -> a[mid] <= x);\n }\n\n /**\n * Searches for the maximum value of a unimodal function f(x).\n * <p>\n * A function f(x) is a <b>unimodal function</b> if for some value m, it is <b>monotonically increasing</b> for x ≤\n * m and <b>monotonically decreasing</b> for x ≥ m. In that case, the maximum value of f(x) is f(m) and there are no\n * other local maxima.\n */\n public static int ternarySearchMaxInt(int left, int right, IntUnaryOperator f) {\n return binarySearch(left, right, mid -> f.applyAsInt(mid) < f.applyAsInt(Math.min(mid + 1, right - 1)));\n }\n\n public static int ternarySearchMaxLong(int left, int right, IntToLongFunction f) {\n return binarySearch(left, right, mid -> f.applyAsLong(mid) < f.applyAsLong(Math.min(mid + 1, right - 1)));\n }\n\n public static long gcd(long a, long b) {\n while (b > 0) {\n var t = a % b;\n a = b;\n b = t;\n }\n return a;\n }\n\n /**\n * Solves x and y such that ax + by = gcd(a, b).\n */\n public static long extendedEuclidean(long a, long b, long[] xy) {\n if (b == 0L) {\n xy[0] = 1L;\n xy[1] = 0L;\n\n return a;\n }\n\n var r = extendedEuclidean(b, a % b, xy);\n var t = xy[0];\n xy[0] = xy[1];\n xy[1] = t - a / b * xy[1];\n\n return r;\n }\n\n public static long lcm(long a, long b) {\n return a / gcd(a, b) * b;\n }\n\n}\n\n// all a, b < mod\nclass Modulo {\n\n private final long mod;\n\n public Modulo(long mod) {\n this.mod = mod;\n }\n\n public long plus(long a, long b) {\n var c = a + b;\n if (c >= mod) {\n c -= mod;\n }\n return c;\n }\n\n public long minus(long a, long b) {\n var c = a - b;\n if (c < 0) {\n c += mod;\n }\n return c;\n }\n\n public long times(long a, long b) {\n return a * b % mod;\n }\n\n public long div(long a, long b) {\n return times(a, pow(b, mod - 2));\n }\n\n public long pow(long a, long b) {\n long c = 1;\n\n while (b > 0) {\n if ((b & 1) > 0) {\n c = c * a % mod;\n }\n a = a * a % mod;\n b >>= 1;\n }\n\n return c;\n }\n\n public long combination(int n, int k) {\n return div(factorial(n), times(factorial(k), factorial(n - k)));\n }\n\n public long combination(int n, int k, long[] factorials) {\n return div(factorials[n], times(factorials[k], factorials[n - k]));\n }\n\n public long factorial(int n) {\n var f = 1L;\n for (var i = 1; i <= n; i++) {\n f = f * i % mod;\n }\n return f;\n }\n\n public long[] factorials(int n) {\n var f = new long[n + 1];\n f[0] = 1L;\n for (var i = 1; i <= n; i++) {\n f[i] = f[i - 1] * i % mod;\n }\n return f;\n }\n\n}\n", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "f0eb34bba1cc05a4c11969b6751805d6", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class tr0 {\n\tstatic PrintWriter out;\n\tstatic StringBuilder sb;\n\tstatic int mod = 998244353;\n\tstatic long inf = (long) 1e18 + 1;\n\tstatic int[] col;\n\tstatic int n, m;\n\tstatic ArrayList<Integer>[] ad;\n\tstatic long[][][] memo;\n\tstatic HashSet<Integer> h;\n\tstatic int[] a;\n\tstatic Integer[][] g;\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\tout = new PrintWriter(System.out);\n\t\tint n = sc.nextInt();\n\t\tlong k = sc.nextLong();\n\t\tif (k >= n) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\t\tlong[] fac = new long[n + 1];\n\t\tfac[0] = 1;\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tfac[i + 1] = (i + 1) * fac[i] % mod;\n\t\tif (k == 0) {\n\t\t\tSystem.out.println(fac[n]);\n\t\t\treturn;\n\t\t}\n\t\tint k1 = (int) k;\n\t\tint c = n - k1;\n\t\tlong ans = fac[n] * modPow(fac[c], mod - 2) % mod;\n\t\tans = ans*modPow(fac[n - c], mod - 2)%mod;\n\t\t\n\t\tlong tem = 0;\n\t\tfor (int i = 0; i <= c; i++)\n\t\t\tif (i % 2 == 0) {\n\t\t\t\tlong tem1 = fac[c] * modPow(fac[i], mod - 2) % mod;\n\t\t\t\ttem1 = tem1 * modPow(fac[c - i], mod - 2) % mod;\n\t\t\t\ttem1 = tem1 * modPow(c - i, n) % mod;\n\t\t\t\ttem = (tem1 + tem) % mod;\n\t\t\t} else {\n\t\t\t\tlong tem1 = fac[c] * modPow(fac[i], mod - 2) % mod;\n\t\t\t\ttem1 = tem1 * modPow(fac[c - i], mod - 2) % mod;\n\t\t\t\ttem1 = tem1 * modPow(c - i, n) % mod;\n\t\t\t\ttem = (-tem1 + tem + mod) % mod;\n\t\t\t}\n\t\tans = ans * tem * 2 % mod;\n\t\tSystem.out.println(ans);\n\t\tout.flush();\n\t}\n\n\tstatic long modPow(long a, long e)\n\n\t{\n\t\tlong res = 1;\n\t\twhile (e > 0) {\n\t\t\tif ((e & 1) == 1)\n\t\t\t\tres = (res * a) % mod;\n\t\t\ta = (a * a) % mod;\n\t\t\te >>= 1;\n\t\t}\n\t\treturn res;\n\t}\n\n\tstatic class Scanner {\n\t\tStringTokenizer st;\n\t\tBufferedReader br;\n\n\t\tpublic Scanner(InputStream system) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(system));\n\t\t}\n\n\t\tpublic Scanner(String file) throws Exception {\n\t\t\tbr = new BufferedReader(new FileReader(file));\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\twhile (st == null || !st.hasMoreTokens())\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic String nextLine() throws IOException {\n\t\t\treturn br.readLine();\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic double nextDouble() throws IOException {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tpublic char nextChar() throws IOException {\n\t\t\treturn next().charAt(0);\n\t\t}\n\n\t\tpublic Long nextLong() throws IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic int[] nextArrInt(int n) throws IOException {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic long[] nextArrLong(int n) throws IOException {\n\t\t\tlong[] a = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic boolean ready() throws IOException {\n\t\t\treturn br.ready();\n\t\t}\n\n\t\tpublic void waitForInput() throws InterruptedException {\n\t\t\tThread.sleep(3000);\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "f3dc378fbaf1d850be374c551a1bddbb", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.function.BiFunction;\nimport java.util.function.IntUnaryOperator;\nimport java.util.function.LongBinaryOperator;\nimport java.util.function.LongUnaryOperator;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tnew Main();\n\t}\n\n\tpublic Main() {\n\t\tFastScanner fs = new FastScanner();\n\t\tjava.io.PrintWriter out = new java.io.PrintWriter(System.out);\n\t\tsolve(fs, out);\n\t\tout.flush();\n\t\t//if (fs.hasNext()) throw new AssertionError(\"read input\");\n\t}\n\n\tpublic void solve(FastScanner fs, java.io.PrintWriter out) {\n\t\tint n = fs.nextInt();\n\t\tlong k = fs.nextLong();\n\t\tfinal long[] fact = new long[n + 1], inv = new long[n + 1];\n\t\tfinal int MOD = 998244353;\n\t\tfact[0] = 1;\n\t\tfor (int i = 0;i < n;++ i) fact[i + 1] = fact[i] * (i + 1) % MOD;\n\t\tinv[n] = IntMath.pow((int)fact[n], MOD - 2, MOD);\n\t\tfor (int i = n;i > 0;-- i) inv[i - 1] = inv[i] * i % MOD;\n\t\tBiFunction<Integer, Integer, Long> comb = (i, j) -> fact[i] * inv[j] % MOD * inv[i - j] % MOD;\n\t\tif (k == 0) out.println(fact[n]);\n\t\telse if (k > n) out.println(0);\n\t\telse {\n\t\t\tint k2 = (int)k, k3 = n - k2;\n\t\t\tlong ans = 0;\n\t\t\tfor (int i = 1;i <= k3;++ i) {\n\t\t\t\tlong tmp = comb.apply(k3, i) * IntMath.pow(i, n, MOD) % MOD;\n\t\t\t\tans += (k3 - i & 1) != 0 ? -tmp : tmp;\n\t\t\t}\n\t\t\tans = (ans % MOD + MOD) % MOD;\n\t\t\tans = ans * 2 * comb.apply(n, k2) % MOD;\n\t\t\tout.println(ans);\n\t\t}\n\t}\n\n\tstatic class FastScanner {\n\t\tprivate final java.io.InputStream in = System.in;\n\t\tprivate final byte[] buffer = new byte[1024];\n\t\tprivate int ptr = 0;\n\t\tprivate int buflen = 0;\n\t\tprivate boolean hasNextByte() {\n\t\t\tif (ptr < buflen) return true;\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (java.io.IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn buflen > 0;\n\t\t}\n\t\tprivate byte readByte() {\n\t\t\treturn hasNextByte() ? buffer[ptr++ ] : -1;\n\t\t}\n\t\tprivate static boolean isPrintableChar(byte c) {\n\t\t\treturn 32 < c || c < 0;\n\t\t}\n\t\tprivate static boolean isNumber(int c) {\n\t\t\treturn '0' <= c && c <= '9';\n\t\t}\n\t\tpublic boolean hasNext() {\n\t\t\twhile (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++ ;\n\t\t\treturn hasNextByte();\n\t\t}\n\t\tpublic String next() {\n\t\t\tif (!hasNext()) throw new java.util.NoSuchElementException();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tbyte b;\n\t\t\twhile (isPrintableChar(b = readByte())) sb.appendCodePoint(b);\n\t\t\treturn sb.toString();\n\t\t}\n\t\tpublic final long nextLong() {\n\t\t\tif (!hasNext()) throw new java.util.NoSuchElementException();\n\t\t\tlong n = 0;\n\t\t\ttry {\n\t\t\t\tbyte b = readByte();\n\t\t\t\tif (b == '-') {\n\t\t\t\t\twhile(isNumber(b = readByte())) n = n * 10 + '0' - b;\n\t\t\t\t\treturn n;\n\t\t\t\t} else if (!isNumber(b)) throw new NumberFormatException();\n\t\t\t\tdo n = n * 10 + b - '0'; while (isNumber(b = readByte()));\n\t\t\t} catch (java.util.NoSuchElementException e) {\n\t\t\t}\n\t\t\treturn n;\n\t\t}\n\t\tpublic final int nextInt() {\n\t\t\tif (!hasNext()) throw new java.util.NoSuchElementException();\n\t\t\tint n = 0;\n\t\t\ttry {\n\t\t\t\tbyte b = readByte();\n\t\t\t\tif (b == '-') {\n\t\t\t\t\twhile(isNumber(b = readByte())) n = n * 10 + '0' - b;\n\t\t\t\t\treturn n;\n\t\t\t\t} else if (!isNumber(b)) throw new NumberFormatException();\n\t\t\t\tdo n = n * 10 + b - '0'; while (isNumber(b = readByte()));\n\t\t\t} catch (java.util.NoSuchElementException e) {\n\t\t\t}\n\t\t\treturn n;\n\t\t}\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t}\n\tpublic static class Arrays {\n\t\tpublic static void sort(final int[] array) {\n\t\t\tint l, min = 0xFFFFFFFF, max = 0;\n\t\t\tfor (l = 0;l < array.length;++ l) {\n\t\t\t\tint i = array[l];\n\t\t\t\tmin &= i;\n\t\t\t\tmax |= i;\n\t\t\t\tif ((i & 0x80000000) == 0) break;\n\t\t\t}\n\t\t\tfor (int r = l + 1;r < array.length;++ r) {\n\t\t\t\tint i = array[r];\n\t\t\t\tmin &= i;\n\t\t\t\tmax |= i;\n\t\t\t\tif ((i & 0x80000000) != 0) {\n\t\t\t\t\tarray[r] = array[l];\n\t\t\t\t\tarray[l ++] = i;\n\t\t\t\t}\n\t\t\t}\n\t\t\tint use = min ^ max, bit = Integer.highestOneBit(use & 0x7FFFFFFF);\n\t\t\tif (bit == 0) return;\n\t\t\tsort(array, 0, l, use, bit);\n\t\t\tsort(array, l, array.length, use, bit);\n\t\t}\n\t\tprivate static void sort(final int[] array, final int left, final int right, final int use, int digit) {\n\t\t\tif (right - left <= 96) {\n\t\t\t\tfor (int i = left + 1;i < right;++ i) {\n\t\t\t\t\tint tmp = array[i], tmp2, j;\n\t\t\t\t\tfor (j = i;j > left && (tmp2 = array[j - 1]) > tmp;-- j) array[j] = tmp2;\n\t\t\t\t\tarray[j] = tmp;\n\t\t\t\t}\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tint l = left;\n\t\t\twhile(l < right && (array[l] & digit) == 0) ++ l;\n\t\t\tfor (int r = l + 1;r < right;++ r) {\n\t\t\t\tint i = array[r];\n\t\t\t\tif ((i & digit) == 0) {\n\t\t\t\t\tarray[r] = array[l];\n\t\t\t\t\tarray[l ++] = i;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ((digit = Integer.highestOneBit(use & digit - 1)) == 0) return;\n\t\t\tsort(array, left, l, use, digit);\n\t\t\tsort(array, l, right, use, digit);\n\t\t}\n\t\tpublic static void sort(final long[] array) {\n\t\t\tint l;\n\t\t\tlong min = 0xFFFFFFFFFFFFFFFFL, max = 0;\n\t\t\tfor (l = 0;l < array.length;++ l) {\n\t\t\t\tlong i = array[l];\n\t\t\t\tmin &= i;\n\t\t\t\tmax |= i;\n\t\t\t\tif ((i & 0x8000000000000000L) == 0) break;\n\t\t\t}\n\t\t\tfor (int r = l + 1;r < array.length;++ r) {\n\t\t\t\tlong i = array[r];\n\t\t\t\tmin &= i;\n\t\t\t\tmax |= i;\n\t\t\t\tif ((i & 0x8000000000000000L) != 0) {\n\t\t\t\t\tarray[r] = array[l];\n\t\t\t\t\tarray[l ++] = i;\n\t\t\t\t}\n\t\t\t}\n\t\t\tlong use = min ^ max, bit = Long.highestOneBit(use & 0x7FFFFFFFFFFFFFFFL);\n\t\t\tif (bit == 0) return;\n\t\t\tsort(array, 0, l, use, bit);\n\t\t\tsort(array, l, array.length, use, bit);\n\t\t}\n\t\tprivate static void sort(final long[] array, final int left, final int right, final long use, long digit) {\n\t\t\tif (right - left <= 96) {\n\t\t\t\tfor (int i = left + 1, j;i < right;++ i) {\n\t\t\t\t\tlong tmp = array[i], tmp2;\n\t\t\t\t\tfor (j = i;j > left && (tmp2 = array[j - 1]) > tmp;-- j) array[j] = tmp2;\n\t\t\t\t\tarray[j] = tmp;\n\t\t\t\t}\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tint l = left;\n\t\t\twhile(l < right && (array[l] & digit) == 0) ++ l;\n\t\t\tfor (int r = l + 1;r < right;++ r) {\n\t\t\t\tlong i = array[r];\n\t\t\t\tif ((i & digit) == 0) {\n\t\t\t\t\tarray[r] = array[l];\n\t\t\t\t\tarray[l ++] = i;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ((digit = Long.highestOneBit(use & digit - 1)) == 0) return;\n\t\t\tsort(array, left, l, use, digit);\n\t\t\tsort(array, l, right, use, digit);\n\t\t}\n\t}\n\n\tpublic static class IntMath {\n\t\tpublic static int gcd(int a, int b) {\n\t\t\twhile (a != 0) if ((b %= a) != 0) a %= b; else return a;\n\t\t\treturn b;\n\t\t}\n\t\tpublic static int gcd(int... array) {\n\t\t\tint ret = array[0];\n\t\t\tfor (int i = 1;i < array.length;++ i) ret = gcd(ret, array[i]);\n\t\t\treturn ret;\n\t\t}\n\t\tpublic static long gcd(long a, long b) {\n\t\t\twhile (a != 0) if ((b %= a) != 0) a %= b; else return a;\n\t\t\treturn b;\n\t\t}\n\t\tpublic static long gcd(long... array) {\n\t\t\tlong ret = array[0];\n\t\t\tfor (int i = 1;i < array.length;++ i) ret = gcd(ret, array[i]);\n\t\t\treturn ret;\n\t\t}\n\t\tpublic static long lcm(long a, long b) {\n\t\t\treturn a / gcd(a, b) * b;\n\t\t}\n\t\tpublic static int pow(int a, int b) {\n\t\t\tint ans = 1;\n\t\t\tfor (int mul = a;b > 0;b >>= 1, mul *= mul) if ((b & 1) != 0) ans *= mul;\n\t\t\treturn ans;\n\t\t}\n\t\tpublic static int pow(int a, int b, int mod) {\n\t\t\tif (b < 0) b = b % (mod - 1) + mod - 1;\n\t\t\tlong ans = 1;\n\t\t\tfor (long mul = a;b > 0;b >>= 1, mul = mul * mul % mod) if ((b & 1) != 0) ans = ans * mul % mod;\n\t\t\treturn (int)ans;\n\t\t}\n\t\tpublic static int floorsqrt(long n) {\n\t\t\treturn (int)Math.sqrt(n + 0.1);\n\t\t}\n\t\tpublic static int ceilsqrt(long n) {\n\t\t\treturn n <= 1 ? (int)n : (int)Math.sqrt(n - 0.1) + 1;\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "605e831d97362298e1665ba4d35413e4", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n\n\npublic class Main{\n static long MOD = 998244353 ;\n static long [] fac;\n public static void main(String[] args) {\n MyScanner sc = new MyScanner();\n out = new PrintWriter(new BufferedOutputStream(System.out));\n // Start writing your solution here. -------------------------------------\n //int t = sc.nextInt();\n int t = 1;\n while(t-- > 0)\n {\n int n = sc.nextInt();\n long kk = sc.nextLong();\n fac = new long[n + 1];\n fac[0] = fac[1] = 1l;\n for(int i = 2; i <= n; i++) fac[i] = (fac[i - 1] * i) % MOD;\n if(kk == 0) out.println(fac[n]);\n else if(kk >= n) out.println(0);\n else\n {\n int k = (int) kk;\n long tmp = 0l, sign = 1;\n int l = n - k;\n for(int i = 0; i <= l; i++)\n {\n tmp = (tmp + MOD + (quickPOW(l - i, n) * C(l, l - i) * sign % MOD)) % MOD;\n sign *= -1l;\n }\n long res = 2l * C(n , k) * tmp % MOD;\n out.println(res);\n }\n }\n out.close();\n }\n public static long C(int n, int m)\n {\n if(m == 0 || m == n) return 1l;\n if(m > n || m < 0) return 0l;\n long res = fac[n] * quickPOW((fac[m] * fac[n - m]) % MOD, MOD - 2) % MOD;\n\n return res;\n }\n public static long quickPOW(long n, long m)\n {\n long ans = 1l;\n while(m > 0)\n {\n if(m % 2 == 1)\n ans = (ans * n) % MOD;\n n = (n * n) % MOD;\n m >>= 1;\n }\n return ans;\n }\n public static int gcd(int a, int b)\n {\n if(a % b == 0) return b;\n return gcd(b, a % b);\n }\n public static long solve(long x, long[] res){\n int n = res.length;\n long a = x / n;\n int b = (int)(x % n);\n return res[n - 1] * a + res[b];\n }\n //-----------PrintWriter for faster output---------------------------------\n public static PrintWriter out;\n //-----------MyScanner class for faster input----------\n public static class MyScanner {\n BufferedReader br;\n StringTokenizer st;\n\n public MyScanner() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n int nextInt() {\n return Integer.parseInt(next());\n }\n long nextLong() {\n return Long.parseLong(next());\n }\n double nextDouble() {\n return Double.parseDouble(next());\n }\n String nextLine(){\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n }\n //--------------------------------------------------------\n}\n", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "504e2cca34952bee3e82ae8f6e863ed0", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.util.*;\n\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\n\n// editorial sol, tle on test 24\n\npublic class cf1342e {\n\n static int[] fact;\n\n public static void main(String[] args) throws IOException {\n int n = rni(), k, ans = 0, mult = 1;\n fact = new int[n + 1];\n ifact = new int[n + 1];\n long kl = nl();\n if(kl >= n) {\n prln(0);\n close();\n return;\n }\n k = (int)kl;\n fact[0] = fact[1] = 1;\n for(int i = 2; i <= n; ++i) {\n fact[i] = fmul(fact[i - 1], i);\n }\n for(int i = 0; i <= n - k; ++i, mult = -mult) {\n int add = mult * fmul(fpow(n - k - i, n), fmul(fact[n - k], fmul(ifact(i), ifact(n - k - i))));\n while(add < 0) {\n add += fmod;\n }\n ans += add;\n if(ans >= fmod) {\n ans -= fmod;\n }\n }\n ans = fmul(fmul(ans, fact[n]), fmul(ifact(k), ifact(n - k)));\n prln(k == 0 ? ans : fmul(ans, 2));\n close();\n }\n\n static int[] ifact;\n\n static int ifact(int x) {\n if(ifact[x] > 0) {\n return ifact[x];\n } else {\n return ifact[x] = fpow(fact[x], fmod - 2);\n }\n }\n\n static int fmod = 998244353;\n\n static int fpow(int a, int b) {\n if(a == 0) {\n return 0;\n }\n int ans = 1;\n while(b > 0) {\n if((b & 1) > 0) {\n ans = fmul(ans, a);\n }\n a = fmul(a, a);\n b >>= 1;\n }\n return ans;\n }\n\n static int fmul(int a, int b) {\n return (int)((long)a * b % fmod);\n }\n\n /* static int fmul(int a, int b) {\n int ans = 0;\n while(b > 0) {\n if((b & 1) > 0) {\n ans += a;\n if(ans >= fmod) {\n ans -= fmod;\n }\n }\n a <<= 1;\n if(a >= fmod) {\n a -= fmod;\n }\n b >>= 1;\n }\n return ans;\n } */\n\n static BufferedReader __in = new BufferedReader(new InputStreamReader(System.in));\n static PrintWriter __out = new PrintWriter(new OutputStreamWriter(System.out));\n static StringTokenizer input;\n static Random rand = new Random();\n\n // references\n // IBIG = 1e9 + 7\n // IMAX ~= 2e10\n // LMAX ~= 9e18\n \n // constants\n static final int IBIG = 1000000007;\n static final int IMAX = 2147483647;\n static final int IMIN = -2147483648;\n static final long LMAX = 9223372036854775807L;\n static final long LMIN = -9223372036854775808L;\n // math util\n static int minof(int a, int b, int c) {return min(a, min(b, c));}\n static int minof(int... x) {if(x.length == 1) return x[0]; if(x.length == 2) return min(x[0], x[1]); if(x.length == 3) return min(x[0], min(x[1], x[2])); int min = x[0]; for(int i = 1; i < x.length; ++i) if(x[i] < min) min = x[i]; return min;}\n static long minof(long a, long b, long c) {return min(a, min(b, c));}\n static long minof(long... x) {if(x.length == 1) return x[0]; if(x.length == 2) return min(x[0], x[1]); if(x.length == 3) return min(x[0], min(x[1], x[2])); long min = x[0]; for(int i = 1; i < x.length; ++i) if(x[i] < min) min = x[i]; return min;}\n static int maxof(int a, int b, int c) {return max(a, max(b, c));}\n static int maxof(int... x) {if(x.length == 1) return x[0]; if(x.length == 2) return max(x[0], x[1]); if(x.length == 3) return max(x[0], max(x[1], x[2])); int max = x[0]; for(int i = 1; i < x.length; ++i) if(x[i] > max) max = x[i]; return max;}\n static long maxof(long a, long b, long c) {return max(a, max(b, c));}\n static long maxof(long... x) {if(x.length == 1) return x[0]; if(x.length == 2) return max(x[0], x[1]); if(x.length == 3) return max(x[0], max(x[1], x[2])); long max = x[0]; for(int i = 1; i < x.length; ++i) if(x[i] > max) max = x[i]; return max;}\n static int powi(int a, int b) {if(a == 0) return 0; int ans = 1; while(b > 0) {if((b & 1) > 0) ans *= a; a *= a; b >>= 1;} return ans;}\n static long powl(long a, int b) {if(a == 0) return 0; long ans = 1; while(b > 0) {if((b & 1) > 0) ans *= a; a *= a; b >>= 1;} return ans;}\n static int fli(double d) {return (int)d;}\n static int cei(double d) {return (int)ceil(d);}\n static long fll(double d) {return (long)d;}\n static long cel(double d) {return (long)ceil(d);}\n static int randInt(int min, int max) {return rand.nextInt(max - min + 1) + min;}\n // array util\n static void reverse(int[] a) {for(int i = 0, n = a.length, half = n / 2; i < half; ++i) {int swap = a[i]; a[i] = a[n - i - 1]; a[n - i - 1] = swap;}}\n static void reverse(long[] a) {for(int i = 0, n = a.length, half = n / 2; i < half; ++i) {long swap = a[i]; a[i] = a[n - i - 1]; a[n - i - 1] = swap;}}\n static void reverse(char[] a) {for(int i = 0, n = a.length, half = n / 2; i < half; ++i) {char swap = a[i]; a[i] = a[n - i - 1]; a[n - i - 1] = swap;}}\n static void shuffle(int[] a) {int n = a.length - 1; for(int i = 0; i < n; ++i) {int ind = randInt(i, n); int swap = a[i]; a[i] = a[ind]; a[ind] = swap;}}\n static void shuffle(long[] a) {int n = a.length - 1; for(int i = 0; i < n; ++i) {int ind = randInt(i, n); long swap = a[i]; a[i] = a[ind]; a[ind] = swap;}}\n static void rsort(int[] a) {shuffle(a); sort(a);}\n static void rsort(long[] a) {shuffle(a); sort(a);}\n static int[] copy(int[] a) {int[] ans = new int[a.length]; for(int i = 0; i < a.length; ++i) ans[i] = a[i]; return ans;}\n static long[] copy(long[] a) {long[] ans = new long[a.length]; for(int i = 0; i < a.length; ++i) ans[i] = a[i]; return ans;}\n static char[] copy(char[] a) {char[] ans = new char[a.length]; for(int i = 0; i < a.length; ++i) ans[i] = a[i]; return ans;}\n static int[] sorted(int[] a) {int[] ans = copy(a); sort(ans); return ans;}\n static long[] sorted(long[] a) {long[] ans = copy(a); sort(ans); return ans;}\n static int[] rsorted(int[] a) {int[] ans = copy(a); rsort(ans); return ans;}\n static long[] rsorted(long[] a) {long[] ans = copy(a); rsort(ans); return ans;}\n // graph util\n static List<List<Integer>> graph(int n) {List<List<Integer>> g = new ArrayList<>(); for(int i = 0; i < n; ++i) g.add(new ArrayList<>()); return g;}\n static List<List<Integer>> graph(List<List<Integer>> g, int m) throws IOException {for(int i = 0; i < m; ++i) connect(g, rni() - 1, ni() - 1); return g;}\n static List<List<Integer>> graph(int n, int m) throws IOException {return graph(graph(n), m);}\n static List<List<Integer>> dgraph(List<List<Integer>> g, int m) throws IOException {for(int i = 0; i < m; ++i) connecto(g, rni() - 1, ni() - 1); return g;}\n static List<List<Integer>> dgraph(List<List<Integer>> g, int n, int m) throws IOException {return dgraph(graph(n), m);}\n static List<Set<Integer>> sgraph(int n) {List<Set<Integer>> g = new ArrayList<>(); for(int i = 0; i < n; ++i) g.add(new HashSet<>()); return g;}\n static List<Set<Integer>> sgraph(List<Set<Integer>> g, int m) throws IOException {for(int i = 0; i < m; ++i) connect(g, rni() - 1, ni() - 1); return g;}\n static List<Set<Integer>> sgraph(int n, int m) throws IOException {return sgraph(sgraph(n), m);}\n static List<Set<Integer>> dsgraph(List<Set<Integer>> g, int m) throws IOException {for(int i = 0; i < m; ++i) connecto(g, rni() - 1, ni() - 1); return g;}\n static List<Set<Integer>> dsgraph(List<Set<Integer>> g, int n, int m) throws IOException {return dsgraph(sgraph(n), m);}\n static void connect(List<? extends Collection<Integer>> g, int u, int v) {g.get(u).add(v); g.get(v).add(u);}\n static void connecto(List<? extends Collection<Integer>> g, int u, int v) {g.get(u).add(v);}\n static void dconnect(List<? extends Collection<Integer>> g, int u, int v) {g.get(u).remove(v); g.get(v).remove(u);}\n static void dconnecto(List<? extends Collection<Integer>> g, int u, int v) {g.get(u).remove(v);}\n // input\n static void r() throws IOException {input = new StringTokenizer(__in.readLine());}\n static int ri() throws IOException {return Integer.parseInt(__in.readLine());}\n static long rl() throws IOException {return Long.parseLong(__in.readLine());}\n static int[] ria(int n) throws IOException {int[] a = new int[n]; input = new StringTokenizer(__in.readLine()); for(int i = 0; i < n; ++i) a[i] = Integer.parseInt(input.nextToken()); return a;}\n static int[] riam1(int n) throws IOException {int[] a = new int[n]; input = new StringTokenizer(__in.readLine()); for(int i = 0; i < n; ++i) a[i] = Integer.parseInt(input.nextToken()) - 1; return a;}\n static long[] rla(int n) throws IOException {long[] a = new long[n]; input = new StringTokenizer(__in.readLine()); for(int i = 0; i < n; ++i) a[i] = Long.parseLong(input.nextToken()); return a;}\n static char[] rcha() throws IOException {return __in.readLine().toCharArray();}\n static String rline() throws IOException {return __in.readLine();}\n static int rni() throws IOException {input = new StringTokenizer(__in.readLine()); return Integer.parseInt(input.nextToken());}\n static int ni() {return Integer.parseInt(input.nextToken());}\n static long rnl() throws IOException {input = new StringTokenizer(__in.readLine()); return Long.parseLong(input.nextToken());}\n static long nl() {return Long.parseLong(input.nextToken());}\n // output\n static void pr(int i) {__out.print(i);}\n static void prln(int i) {__out.println(i);}\n static void pr(long l) {__out.print(l);}\n static void prln(long l) {__out.println(l);}\n static void pr(double d) {__out.print(d);}\n static void prln(double d) {__out.println(d);}\n static void pr(char c) {__out.print(c);}\n static void prln(char c) {__out.println(c);}\n static void pr(char[] s) {__out.print(new String(s));}\n static void prln(char[] s) {__out.println(new String(s));}\n static void pr(String s) {__out.print(s);}\n static void prln(String s) {__out.println(s);}\n static void pr(Object o) {__out.print(o);}\n static void prln(Object o) {__out.println(o);}\n static void prln() {__out.println();}\n static void pryes() {__out.println(\"yes\");}\n static void pry() {__out.println(\"Yes\");}\n static void prY() {__out.println(\"YES\");}\n static void prno() {__out.println(\"no\");}\n static void prn() {__out.println(\"No\");}\n static void prN() {__out.println(\"NO\");}\n static void pryesno(boolean b) {__out.println(b ? \"yes\" : \"no\");};\n static void pryn(boolean b) {__out.println(b ? \"Yes\" : \"No\");}\n static void prYN(boolean b) {__out.println(b ? \"YES\" : \"NO\");}\n static void prln(int... a) {for(int i = 0, len = a.length - 1; i < len; __out.print(a[i]), __out.print(' '), ++i); __out.println(a[a.length - 1]);}\n static void prln(long... a) {for(int i = 0, len = a.length - 1; i < len; __out.print(a[i]), __out.print(' '), ++i); __out.println(a[a.length - 1]);}\n static <T> void prln(Collection<T> c) {int n = c.size() - 1; Iterator<T> iter = c.iterator(); for(int i = 0; i < n; __out.print(iter.next()), __out.print(' '), ++i); if(n >= 0) __out.println(iter.next()); else __out.println();}\n static void h() {__out.println(\"hlfd\");}\n static void flush() {__out.flush();}\n static void close() {__out.close();}\n}", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "027f86179751bc71871f263ff2b063aa", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.text.SimpleDateFormat;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.Comparator;\nimport java.util.Date;\nimport java.util.HashMap;\nimport java.util.LinkedList;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Queue;\nimport java.util.StringTokenizer;\nimport java.util.TreeSet;\n\nimport javax.swing.*;\n\nimport static java.util.Arrays.binarySearch;\nimport static java.util.Arrays.copyOfRange;\nimport static java.util.Arrays.sort;\n\npublic class Main {\n\n public static void main(String[] args) throws Exception {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n\n Task solver = new Task();\n solver.solve(1, in, out);\n out.close();\n }\n}\n\nclass Task {\n\n private static int mod = 998244353;\n\n public long powMod(long a, long b) {\n long ans = 1, d = a;\n while (b > 0) {\n if (b % 2 == 1) ans = ans * d % mod;\n b >>= 1;\n d = d * d % mod;\n }\n return ans;\n }\n\n long[] fac, inv;\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n //int T = in.nextInt();\n int n = 200001;\n fac = new long[n];\n inv = new long[n];\n fac[0] = inv[0] = 1;\n for (int i = 1; i < n; i++) {\n fac[i] = fac[i - 1] * i % mod;\n inv[i] = inv[i - 1] * powMod(i, mod - 2) % mod;\n }\n //for (int tc = 1; tc <= T; tc++) {\n n = in.nextInt();\n long k = in.nextLong();\n if (k >= n) {\n out.println(0);\n return;\n }\n if (k == 0) {\n out.println(fac[n]);\n return;\n }\n int m = (int)(n - k);\n long ans = 0;\n for (int i = 0; i <= m; i++) {\n if (i % 2 == 0) {\n ans = (ans + getC(m, i) * powMod(m - i, n) % mod) % mod;\n } else {\n ans = ((ans - getC(m, i) * powMod(m - i, n) % mod) % mod + mod) % mod;\n }\n }\n out.println(2 * fac[n] * inv[n - m] % mod * ans % mod * inv[m] % mod);\n //}\n }\n\n private long getC(int n, int m) {\n return fac[n] * inv[m] % mod * inv[n - m] % mod;\n }\n\n}\n\nclass InputReader {\n\n private final BufferedReader reader;\n private StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream));\n tokenizer = null;\n }\n\n public String nextLine() {\n try {\n return reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n tokenizer = new StringTokenizer(nextLine());\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n}\n", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "40130cf118abb2fa022cea0b490abdf8", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\npublic class EdE {\n\n\tpublic static void main(String[] args) throws Exception{\n\t\tint num = 998244353;\n\n\t\t// TODO Auto-generated method stub\n \t\tBufferedReader bf = new BufferedReader(new InputStreamReader(System.in));\n \t\tPrintWriter out = new PrintWriter(System.out);\n \t\tStringTokenizer st = new StringTokenizer(bf.readLine());\n \t\tlong n = Long.parseLong(st.nextToken());\n \t\tlong k = Long.parseLong(st.nextToken());\n \t\tlong[] fact = new long[200001];\n \t\tfact[0] = 1;\n \t\tlong ans1 = 1;\n \t\tfor(int i = 1;i<=200000;i++){\n \t\t\tans1= (ans1*i) % num;\n \t\t\tfact[i] = ans1;\n \t\t}\n \t\tlong ans = 0;\n \t\tfor (int i = 0;i<n-k;i++){\n \t\t\t//ans+= (-1)^i*(n-k choose i)* (n-k-i)^n\n \t\t\tlong ks = 1;\n\t\t\tks = ks * fact[(int)(n-k)]%num;\n\t\t\tks = ks*power(fact[i], num-2, num)%num;\n\t\t\tks = ks*power(fact[(int)(n-k-i)], num-2, num)%num;\n \t\t\tif (i%2 == 0){\n \t\t\t\t\n \t\t\t\tans+= ks * power(n-k-i, n, num)%num;\n \t\t\t}\n \t\t\telse{\n \t\t\t\tans-= ks* power(n-k-i, n, num)%num;\n \t\t\t}\n \t\t\tans = ans%num;\n \t\t}\n \t\tif (k >=n)\n \t\t\tout.println(0);\n \t\telse{\n \t\tif (k != 0)\n \t\t\tans= ans*2%num;\n \t\t\n \t\tans = ans*fact[(int)(n)]%num;\n \t\tans = ans*power(fact[(int)(k)], num-2, num)%num;\n \t\tans = ans*power(fact[(int)(n-k)], num-2, num)%num;\n \t\t\n \t\twhile (ans < 0){\n \t\t\tans = ans+num;\n \t\t}\n \t\tout.println(ans);\n \t\t}\n \t\tout.close();\n \t\t\n \t}\n \t\n\t\n\tpublic static int power(long x, long y, long mod){\n\t\tlong ans = 1;\n\t\twhile(y>0){\n\t\t\tif (y%2==1)\n\t\t\t\tans = (ans*x)%mod;\n\t\t\tx = (x*x)%mod;\n\t\t\ty/=2;\n\t\t}\n\t\treturn (int)(ans);\n\t}\n }\n\t\n//StringJoiner sj = new StringJoiner(\" \"); \n//sj.add(strings)\n//sj.toString() gives string of those stuff w spaces or whatever that sequence is\n\n \t\t\n \t\t\n \t\t\n \t\t\n\t\n\n\n", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "db871e904b66a3f56518bd4def3bc961", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main{\n\tstatic int mod=998244353;\n\tstatic long fastpow(long n,long ti) {\n\t\t if (ti == 0) \n\t\t return 1l;\n\t\tif(ti%2==0) {\n\t\t\tlong y=fastpow(n, ti/2);\n\t\t\tlong k=y*y;\n\t\t\tk%=mod;\n\t\t\treturn k;\n\t\t}\n\t\telse {\n\t\t\tlong y=fastpow(n, ti/2);\n\t\t\tlong k=((n*y)%mod)*y;\n\t\t\tk%=mod;\n\t\t\treturn k;\n\t\t}\n\t}\n\tstatic long[]fac;\n\t\n\tpublic static long ncr(int n,int k) {\n\t\tif(n<k)return 0;\n\t\tlong num=fac[(n)];\n\t\tlong den=(fac[(n-k)]*fac[k])%mod;\n\t\tlong ans=(num*fastpow(den,mod-2));\n\t\treturn ans%mod;\n\t}\n\tpublic static void main(String[] args) throws Exception{\n\t\tPrintWriter pw=new PrintWriter(System.out);\n\t\tMScanner sc = new MScanner(System.in);\n\t\tfac=new long[(int)2e5+1];\n\t\tfac[0]=1;for(int i=1;i<fac.length;i++)fac[i]=(fac[i-1]*i)%mod;\n\t\t\n\t\tint n=sc.nextInt();long k=sc.nextLong();\n\t\tif(k>=n) {\n\t\t\tpw.println(0);\n\t\t\tpw.flush();\n\t\t\treturn;\n\t\t}\n\t\tif(k==0) {\n\t\t\tpw.println(fac[(int)n]);\n\t\t\tpw.flush();\n\t\t\treturn;\n\t\t}\n\t\tif(k==n-1) {\n\t\t\tpw.println(2*n);\n\t\t\tpw.flush();\n\t\t\treturn;\n\t\t}\n\t\t//columns to fill with one rook\n\t\tint filledCols=(int)(n-k);\n\t\t\n\t\tlong waysToChooseFilledCols=ncr(n, filledCols);\n\t\t\n\t\tlong ans=0;\n\t\t\n\t\tfor(int emptyCols=0;emptyCols<=filledCols;emptyCols++) {\n\t\t\tlong waysToChoose=ncr(filledCols, emptyCols);\n\t\t\tlong waysToFill=fastpow(filledCols-emptyCols, n);\n\t\t\tlong val=(waysToChoose*waysToFill)%mod;\n\t\t\t\n\t\t\tif(emptyCols%2==1) {\n\t\t\t\tval*=-1;\n\t\t\t}\n\t\t\tans=(ans+val+mod)%mod;\n\t\t}\n\t\tans=(ans*waysToChooseFilledCols)%mod;\n\t\t\n\t\t//the same for rows\n\t\tans=(ans*2)%mod;\n\t\t\n\t\tpw.println(ans);\n\t\tpw.flush();\n\t}\n\tstatic class MScanner {\n\t\tStringTokenizer st;\n\t\tBufferedReader br;\n\t\tpublic MScanner(InputStream system) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(system));\n\t\t}\n \n\t\tpublic MScanner(String file) throws Exception {\n\t\t\tbr = new BufferedReader(new FileReader(file));\n\t\t}\n \n\t\tpublic String next() throws IOException {\n\t\t\twhile (st == null || !st.hasMoreTokens())\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\t\tpublic int[] intArr(int n) throws IOException {\n\t int[]in=new int[n];for(int i=0;i<n;i++)in[i]=nextInt();\n\t return in;\n\t\t}\n\t\tpublic long[] longArr(int n) throws IOException {\n\t long[]in=new long[n];for(int i=0;i<n;i++)in[i]=nextLong();\n\t return in;\n\t\t}\n\t\tpublic int[] intSortedArr(int n) throws IOException {\n\t int[]in=new int[n];for(int i=0;i<n;i++)in[i]=nextInt();\n\t shuffle(in);\n\t Arrays.sort(in);\n\t return in;\n\t\t}\n\t\tpublic long[] longSortedArr(int n) throws IOException {\n\t long[]in=new long[n];for(int i=0;i<n;i++)in[i]=nextLong();\n\t shuffle(in);\n\t Arrays.sort(in);\n\t return in;\n\t\t}\n\t\tpublic Integer[] IntegerArr(int n) throws IOException {\n\t Integer[]in=new Integer[n];for(int i=0;i<n;i++)in[i]=nextInt();\n\t return in;\n\t\t}\n\t\tpublic Long[] LongArr(int n) throws IOException {\n\t Long[]in=new Long[n];for(int i=0;i<n;i++)in[i]=nextLong();\n\t return in;\n\t\t}\n\t\tpublic String nextLine() throws IOException {\n\t\t\treturn br.readLine();\n\t\t}\n \n\t\tpublic int nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n \n\t\tpublic double nextDouble() throws IOException {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n \n\t\tpublic char nextChar() throws IOException {\n\t\t\treturn next().charAt(0);\n\t\t}\n \n\t\tpublic long nextLong() throws IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n \n\t\tpublic boolean ready() throws IOException {\n\t\t\treturn br.ready();\n\t\t}\n \n\t\tpublic void waitForInput() throws InterruptedException {\n\t\t\tThread.sleep(3000);\n\t\t}\n\t}\n\tstatic void shuffle(int[]in) {\n\t\tfor(int i=0;i<in.length;i++) {\n\t\t\tint idx=(int)(Math.random()*in.length);\n\t\t\tint tmp=in[i];\n\t\t\tin[i]=in[idx];\n\t\t\tin[idx]=tmp;\n\t\t}\n\t}\n\tstatic void shuffle(long[]in) {\n\t\tfor(int i=0;i<in.length;i++) {\n\t\t\tint idx=(int)(Math.random()*in.length);\n\t\t\tlong tmp=in[i];\n\t\t\tin[i]=in[idx];\n\t\t\tin[idx]=tmp;\n\t\t}\n\t}\n\tstatic String arrToString(int[]x) {\n\t\treturn Arrays.toString(x);\n\t}\n\tstatic String arrToString(long[]x) {\n\t\treturn Arrays.toString(x);\n\t}\n\tstatic String arrToString(Integer[]x) {\n\t\treturn Arrays.toString(x);\n\t}\n\tstatic String arrToString(Long[]x) {\n\t\treturn Arrays.toString(x);\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "cf98d3b9e86b3efea35a4080b372f024", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\nimport java.awt.Point;\n \npublic class Main {\n\tstatic final long MOD = 998244353L;\n\t//static final long INF = 1000000000000000007L;\n\t//static final long MOD = 1000000007L;\n\t//static final int INF = 1000000007;\n\t\n\tstatic long[] fac;\n\tpublic static void main(String[] args) {\n\t\tFastScanner sc = new FastScanner();\n\t\tPrintWriter pw = new PrintWriter(System.out);\n\t\t\n\t\tint N = sc.ni();\n\t\tlong K = sc.nl();\n\t\tif (K >= N) {\n\t\t\tpw.println(0);\n\t\t\tpw.close();\n\t\t\treturn;\n\t\t}\n\t\tint C = (int)(N-K);\n\t\t\n\t\tfac = new long[200001];\n\t\tfac[0] = 1L;\n\t\tfor (int i = 1; i <= 200000; i++)\n\t\t\tfac[i] = (i*fac[i-1])%MOD;\n\t\t\n\t\tlong ans = 0;\n\t\tint sign = 1;\n\t\tfor (int i = C; i > 0; i--) {\n\t\t\tlong val = (choose(C,i)*power(i,N,MOD))%MOD;\n\t\t\tans += sign*val;\n\t\t\tans += 2*MOD;\n\t\t\tans %= MOD;\n\t\t\tsign *= -1;\n\t\t}\n\t\t\n\t\tlong mult = 2*choose(N,C);\n\t\tif (C==N)\n\t\t\tmult = 1L;\n\t\tpw.println((ans*mult)%MOD);\n\t\t\n\t\tpw.close();\n\t}\n\t\n\tpublic static long choose(int n, int k) {\n\t\tlong den = (fac[k]*fac[n-k])%MOD;\n\t\tlong denInv = power(den,MOD-2,MOD);\n\t\tlong ans = (fac[n]*denInv)%MOD;\n\t\treturn ans;\n\t}\n \n\tpublic static long dist(long[] p1, long[] p2) {\n\t\treturn (Math.abs(p2[0]-p1[0])+Math.abs(p2[1]-p1[1]));\n\t}\n\t\n\t//Find the GCD of two numbers\n\tpublic static long gcd(long a, long b) {\n\t\tif (a < b) return gcd(b,a);\n\t\tif (b == 0)\n\t\t\treturn a;\n\t\telse\n\t\t\treturn gcd(b,a%b);\n\t}\n\t\n\t//Fast exponentiation (x^y mod m)\n\tpublic static long power(long x, long y, long m) { \n\t\tif (y < 0) return 0L;\n\t\tlong ans = 1;\n\t\tx %= m;\n\t\twhile (y > 0) { \n\t\t\tif(y % 2 == 1) \n\t\t\t\tans = (ans * x) % m; \n\t\t\ty /= 2; \n\t\t\tx = (x * x) % m;\n\t\t} \n\t\treturn ans; \n\t}\n\t\n\tpublic static int[] shuffle(int[] array) {\n\t\tRandom rgen = new Random();\n\t\tfor (int i = 0; i < array.length; i++) {\n\t\t int randomPosition = rgen.nextInt(array.length);\n\t\t int temp = array[i];\n\t\t array[i] = array[randomPosition];\n\t\t array[randomPosition] = temp;\n\t\t}\n\t\treturn array;\n\t}\n\t\n\tpublic static long[] shuffle(long[] array) {\n\t\tRandom rgen = new Random();\n\t\tfor (int i = 0; i < array.length; i++) {\n\t\t int randomPosition = rgen.nextInt(array.length);\n\t\t long temp = array[i];\n\t\t array[i] = array[randomPosition];\n\t\t array[randomPosition] = temp;\n\t\t}\n\t\treturn array;\n\t}\n\t\n\tpublic static int[][] shuffle(int[][] array) {\n\t\tRandom rgen = new Random();\n\t\tfor (int i = 0; i < array.length; i++) {\n\t\t int randomPosition = rgen.nextInt(array.length);\n\t\t int[] temp = array[i];\n\t\t array[i] = array[randomPosition];\n\t\t array[randomPosition] = temp;\n\t\t}\n\t\treturn array;\n\t}\n\t\n public static int[][] sort(int[][] array) {\n \t//Sort an array (immune to quicksort TLE)\n \n\t\tArrays.sort(array, new Comparator<int[]>() {\n\t\t\t @Override\n \t public int compare(int[] a, int[] b) {\n\t\t\t\t return a[0]-b[0]; //ascending order\n\t }\n\t\t});\n\t\treturn array;\n\t}\n \n public static long[][] sort(long[][] array) {\n \t//Sort an array (immune to quicksort TLE)\n\t\tRandom rgen = new Random();\n\t\tfor (int i = 0; i < array.length; i++) {\n\t\t int randomPosition = rgen.nextInt(array.length);\n\t\t long[] temp = array[i];\n\t\t array[i] = array[randomPosition];\n\t\t array[randomPosition] = temp;\n\t\t}\n\t\tArrays.sort(array, new Comparator<long[]>() {\n\t\t\t @Override\n \t public int compare(long[] a, long[] b) {\n\t\t\t\t if (a[0] < b[0])\n\t\t\t\t\t return -1;\n\t\t\t\t else if (a[0] > b[0])\n\t\t\t\t\t return 1;\n\t\t\t\t else\n\t\t\t\t\t return 0;\n\t }\n\t\t});\n\t\treturn array;\n\t}\n \n static class FastScanner { \n BufferedReader br; \n StringTokenizer st; \n \n public FastScanner() { \n br = new BufferedReader(new InputStreamReader(System.in)); \n } \n \n String next() { \n while (st == null || !st.hasMoreElements()) { \n try { \n st = new StringTokenizer(br.readLine());\n } catch (IOException e) { \n e.printStackTrace(); \n } \n } \n return st.nextToken(); \n }\n \n int ni() { \n return Integer.parseInt(next()); \n }\n \n long nl() { \n return Long.parseLong(next()); \n } \n \n double nd() { \n return Double.parseDouble(next()); \n } \n \n String nextLine() {\n String str = \"\"; \n try { \n str = br.readLine(); \n } catch (IOException e) {\n e.printStackTrace(); \n } \n return str;\n }\n }\n}", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "8824a0f4268a4404c93744eec25ce5a0", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.util.*;\nimport static java.lang.System.out;\n\n\npublic class Solution{\n private static class Scan{\n StringTokenizer str;\n BufferedReader br;\n Scan() {\n br = new BufferedReader(new InputStreamReader(System.in));\n str = null;\n }\n Scan(InputStream x)\n {\n br=new BufferedReader(new InputStreamReader(x));\n str=null;\n }\n String next()\n {\n while(str==null||!str.hasMoreElements()){\n try{\n str=new StringTokenizer(br.readLine());\n }catch (Exception e){\n out.println(e);\n }\n }\n return str.nextToken();\n }\n int nextInt()\n {\n return Integer.parseInt(next());\n }\n long nextLong()\n {\n return Long.parseLong(next());\n }\n double nextDouble()\n {\n return Double.parseDouble(next());\n }\n String nextLine()\n {\n try {\n if (str == null || !str.hasMoreElements())str=new StringTokenizer(br.readLine());\n }catch (IOException e){\n out.println(e);\n }\n return str.nextToken(\"\\n\");\n }\n }\n static long MOD=998244353L;\n static int asz=200005;\n static long BigMod(long a,long b,long m){\n if(b==0)return 1L;\n if(b%2==1)return a*BigMod(a,b-1,m)%m;\n return BigMod(a*a%m,b/2,m)%m;\n }\n static long f[]=new long[asz];\n static long C(int n,int k){\n if(k>n)return 0L;\n return f[n]*BigMod(f[k],MOD-2,MOD)%MOD*BigMod(f[n-k],MOD-2,MOD)%MOD;\n }\n static long solve(int n,int k){\n long ans=0;\n for(int i=0;i<=n-k;i++){\n if(i%2==0)ans=(ans+C(n-k,i)*BigMod(n-k-i,n,MOD)%MOD)%MOD;\n else ans=(ans-C(n-k,i)*BigMod(n-k-i,n,MOD)%MOD+MOD)%MOD;\n }\n return ans;\n }\n public static void main(String[] args){\n Scan in=new Scan();\n int t=1;\n //t=in.nextInt();\n for(int qq=1;qq<=t;qq++){\n long n,k;\n n=in.nextLong();\n k=in.nextLong();\n f[0]=1;\n for(long i=1;i<=n;i++)f[(int)i]=f[(int)(i-1)]*i%MOD;\n if(k>=n)out.println(0);\n else if(k==0)out.println(f[(int)n]);\n else{\n out.println(2*C((int)n,(int)(n-k))*solve((int)n,(int)k)%MOD);\n }\n }\n }\n}", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "3332f3ef5b345cc401399569a24e7665", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "//package ecr086;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class E {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t\tint mod = 998244353;\n\t\tint n = ni();\n\t\tlong K = nl();\n\t\tif(K >= n){\n\t\t\tout.println(0);\n\t\t\treturn;\n\t\t}\n\t\tint[][] fif = enumFIF(250000, mod);\n\t\tif(K == 0){\n\t\t\tout.println(fif[0][n]);\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tlong ans = 0;\n\t\tfor(int i = (int)(n-K), s = 1;i >= 1;i--, s = mod - s){\n\t\t\tans += C(n, i, mod, fif) * pow(i, n, mod) % mod * s % mod * C((int)(n-i), (int)K, mod, fif);\n\t\t\tans %= mod;\n\t\t}\n\t\tans = ans * 2 % mod;\n\t\tout.println(ans);\n\t}\n\t\n\tpublic static long pow(long a, long n, long mod) {\n\t\t//\t\ta %= mod;\n\t\tlong ret = 1;\n\t\tint x = 63 - Long.numberOfLeadingZeros(n);\n\t\tfor (; x >= 0; x--) {\n\t\t\tret = ret * ret % mod;\n\t\t\tif (n << 63 - x < 0)\n\t\t\t\tret = ret * a % mod;\n\t\t}\n\t\treturn ret;\n\t}\n\n\t\n\tpublic static long C(int n, int r, int mod, int[][] fif) {\n\t\tif (n < 0 || r < 0 || r > n)\n\t\t\treturn 0;\n\t\treturn (long) fif[0][n] * fif[1][r] % mod * fif[1][n - r] % mod;\n\t}\n\n\t\n\tpublic static int[][] enumFIF(int n, int mod) {\n\t\tint[] f = new int[n + 1];\n\t\tint[] invf = new int[n + 1];\n\t\tf[0] = 1;\n\t\tfor (int i = 1; i <= n; i++) {\n\t\t\tf[i] = (int) ((long) f[i - 1] * i % mod);\n\t\t}\n\t\tlong a = f[n];\n\t\tlong b = mod;\n\t\tlong p = 1, q = 0;\n\t\twhile (b > 0) {\n\t\t\tlong c = a / b;\n\t\t\tlong d;\n\t\t\td = a;\n\t\t\ta = b;\n\t\t\tb = d % b;\n\t\t\td = p;\n\t\t\tp = q;\n\t\t\tq = d - c * q;\n\t\t}\n\t\tinvf[n] = (int) (p < 0 ? p + mod : p);\n\t\tfor (int i = n - 1; i >= 0; i--) {\n\t\t\tinvf[i] = (int) ((long) invf[i + 1] * (i + 1) % mod);\n\t\t}\n\t\treturn new int[][] { f, invf };\n\t}\n\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new E().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "02595be440a8c1efd8f590e609633433", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.UncheckedIOException;\nimport java.io.Closeable;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.InputStream;\n\n/**\n * @author khokharnikunj8\n */\npublic class Main {\n public static void main(String[] args) throws Exception {\n Thread thread = new Thread(null, new TaskAdapter(), \"khokharnikunj8\", 1 << 27);\n thread.start();\n thread.join();\n }\n\n static class TaskAdapter implements Runnable {\n @Override\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastInput in = new FastInput(inputStream);\n FastOutput out = new FastOutput(outputStream);\n EPlacingRooks solver = new EPlacingRooks();\n solver.solve(1, in, out);\n out.close();\n }\n }\n\n static class EPlacingRooks {\n Modular md = new Modular(998244353);\n Power pw = new Power(md);\n Combination cb = new Combination(1000000, md);\n\n public void solve(int testNumber, FastInput in, FastOutput out) {\n int n = in.readInt();\n long kk = in.readLong();\n if (kk >= n) {\n out.println(0);\n return;\n }\n int k = (int) kk;\n long ans = 0;\n for (int i = 0; i < (n - k); i++) {\n if (i % 2 == 0) ans = md.plus(ans, md.mul(cb.composite((n - k), i), pw.pow(n - k - i, n)));\n else ans = md.subtract(ans, md.mul(cb.composite(n - k, i), pw.pow(n - k - i, n)));\n }\n ans = md.mul(ans, cb.invFact(n - k));\n ans = md.mul(ans, cb.fact(n - k));\n ans = md.mul(ans, cb.composite(n, n - k));\n if (k != 0) out.println(md.mul(ans, 2));\n else out.println(ans);\n }\n\n }\n\n static class InverseNumber {\n int[] inv;\n\n public InverseNumber(int[] inv, int limit, Modular modular) {\n this.inv = inv;\n inv[1] = 1;\n int p = modular.getMod();\n for (int i = 2; i <= limit; i++) {\n int k = p / i;\n int r = p % i;\n inv[i] = modular.mul(-k, inv[r]);\n }\n }\n\n public InverseNumber(int limit, Modular modular) {\n this(new int[limit + 1], limit, modular);\n }\n\n }\n\n static class Modular {\n int m;\n\n public int getMod() {\n return m;\n }\n\n public Modular(int m) {\n this.m = m;\n }\n\n public Modular(long m) {\n this.m = (int) m;\n if (this.m != m) {\n throw new IllegalArgumentException();\n }\n }\n\n public Modular(double m) {\n this.m = (int) m;\n if (this.m != m) {\n throw new IllegalArgumentException();\n }\n }\n\n public int valueOf(int x) {\n x %= m;\n if (x < 0) {\n x += m;\n }\n return x;\n }\n\n public int valueOf(long x) {\n x %= m;\n if (x < 0) {\n x += m;\n }\n return (int) x;\n }\n\n public int mul(int x, int y) {\n return valueOf((long) x * y);\n }\n\n public int mul(long x, long y) {\n return valueOf(x * y);\n }\n\n public int plus(long x, long y) {\n return valueOf(x + y);\n }\n\n public int subtract(long x, long y) {\n return valueOf(x - y);\n }\n\n public String toString() {\n return \"mod \" + m;\n }\n\n }\n\n static class Combination {\n final Factorial factorial;\n final Modular modular;\n\n public Combination(Factorial factorial) {\n this.factorial = factorial;\n this.modular = factorial.getModular();\n }\n\n public Combination(int limit, Modular modular) {\n this(new Factorial(limit, modular));\n }\n\n public int composite(int m, int n) {\n if (n > m) {\n return 0;\n }\n return modular.mul(modular.mul(factorial.fact(m), factorial.invFact(n)), factorial.invFact(m - n));\n }\n\n public int fact(int x) {\n return factorial.fact(x);\n }\n\n public int invFact(int x) {\n return factorial.invFact(x);\n }\n\n }\n\n static class FastOutput implements AutoCloseable, Closeable, Appendable {\n private StringBuilder cache = new StringBuilder(1 << 20);\n private final Writer os;\n\n public FastOutput append(CharSequence csq) {\n cache.append(csq);\n return this;\n }\n\n public FastOutput append(CharSequence csq, int start, int end) {\n cache.append(csq, start, end);\n return this;\n }\n\n public FastOutput(Writer os) {\n this.os = os;\n }\n\n public FastOutput(OutputStream os) {\n this(new OutputStreamWriter(os));\n }\n\n public FastOutput append(char c) {\n cache.append(c);\n return this;\n }\n\n public FastOutput append(int c) {\n cache.append(c);\n return this;\n }\n\n public FastOutput append(long c) {\n cache.append(c);\n return this;\n }\n\n public FastOutput println(int c) {\n return append(c).println();\n }\n\n public FastOutput println(long c) {\n return append(c).println();\n }\n\n public FastOutput println() {\n cache.append(System.lineSeparator());\n return this;\n }\n\n public FastOutput flush() {\n try {\n os.append(cache);\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n return this;\n }\n\n public void close() {\n flush();\n try {\n os.close();\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n\n public String toString() {\n return cache.toString();\n }\n\n }\n\n static class Power {\n final Modular modular;\n\n public Power(Modular modular) {\n this.modular = modular;\n }\n\n public int pow(int x, int n) {\n if (n == 0) {\n return modular.valueOf(1);\n }\n long r = pow(x, n >> 1);\n r = modular.valueOf(r * r);\n if ((n & 1) == 1) {\n r = modular.valueOf(r * x);\n }\n return (int) r;\n }\n\n }\n\n static class Factorial {\n int[] fact;\n int[] inv;\n Modular modular;\n\n public Modular getModular() {\n return modular;\n }\n\n public Factorial(int[] fact, int[] inv, InverseNumber in, int limit, Modular modular) {\n this.modular = modular;\n this.fact = fact;\n this.inv = inv;\n fact[0] = inv[0] = 1;\n for (int i = 1; i <= limit; i++) {\n fact[i] = modular.mul(fact[i - 1], i);\n inv[i] = modular.mul(inv[i - 1], in.inv[i]);\n }\n }\n\n public Factorial(int limit, Modular modular) {\n this(new int[limit + 1], new int[limit + 1], new InverseNumber(limit, modular), limit, modular);\n }\n\n public int fact(int n) {\n return fact[n];\n }\n\n public int invFact(int n) {\n return inv[n];\n }\n\n }\n\n static class FastInput {\n private final InputStream is;\n private byte[] buf = new byte[1 << 20];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastInput(InputStream is) {\n this.is = is;\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n bufLen = -1;\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public int readInt() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n public long readLong() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n long val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "ba17e30d686aac44ab5816cd5e7d444c", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": " import java.io.OutputStream;\n import java.io.IOException;\n import java.io.InputStream;\n import java.io.OutputStream;\n import java.io.IOException;\n import java.io.UncheckedIOException;\n import java.io.Closeable;\n import java.io.Writer;\n import java.io.OutputStreamWriter;\n import java.io.InputStream;\n \n /**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\n public class Main {\n public static void main(String[] args) throws Exception {\n Thread thread = new Thread(null, new TaskAdapter(), \"\", 1 << 27);\n thread.start();\n thread.join();\n }\n \n static class TaskAdapter implements Runnable {\n @Override\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastInput in = new FastInput(inputStream);\n FastOutput out = new FastOutput(outputStream);\n EPlacingRooks solver = new EPlacingRooks();\n solver.solve(1, in, out);\n out.close();\n }\n }\n \n static class EPlacingRooks {\n public void solve(int testNumber, FastInput in, FastOutput out) {\n int n = in.readInt();\n int k = in.readInt();\n Modular mod = new Modular(998244353);\n int m = n - k;\n \n if (k == 0) {\n int ans = 1;\n for (int i = 1; i <= n; i++) {\n ans = mod.mul(ans, i);\n }\n out.println(ans);\n return;\n }\n if (m <= 0 || m > n) {\n out.println(0);\n return;\n }\n \n PrimeCombination combination = new PrimeCombination(n, mod);\n Power power = new Power(mod);\n int ans = 0;\n for (int i = 0; i <= m; i++) {\n int local = combination.combination(m, i);\n if (i % 2 == 1) {\n local = mod.valueOf(-local);\n }\n local = mod.mul(local, power.pow(m - i, n));\n ans = mod.plus(ans, local);\n }\n ans = mod.mul(ans, combination.combination(n, m));\n \n ans = mod.mul(ans, 2);\n out.println(ans);\n }\n \n }\n \n static interface IntCombination {\n }\n \n static class FastOutput implements AutoCloseable, Closeable, Appendable {\n private StringBuilder cache = new StringBuilder(10 << 20);\n private final Writer os;\n \n public FastOutput append(CharSequence csq) {\n cache.append(csq);\n return this;\n }\n \n public FastOutput append(CharSequence csq, int start, int end) {\n cache.append(csq, start, end);\n return this;\n }\n \n public FastOutput(Writer os) {\n this.os = os;\n }\n \n public FastOutput(OutputStream os) {\n this(new OutputStreamWriter(os));\n }\n \n public FastOutput append(char c) {\n cache.append(c);\n return this;\n }\n \n public FastOutput append(int c) {\n cache.append(c);\n return this;\n }\n \n public FastOutput println(int c) {\n return append(c).println();\n }\n \n public FastOutput println() {\n cache.append(System.lineSeparator());\n return this;\n }\n \n public FastOutput flush() {\n try {\n os.append(cache);\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n return this;\n }\n \n public void close() {\n flush();\n try {\n os.close();\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n \n public String toString() {\n return cache.toString();\n }\n \n }\n \n static class InverseNumber {\n int[] inv;\n \n public InverseNumber(int[] inv, int limit, Modular modular) {\n this.inv = inv;\n inv[1] = 1;\n int p = modular.getMod();\n for (int i = 2; i <= limit; i++) {\n int k = p / i;\n int r = p % i;\n inv[i] = modular.mul(-k, inv[r]);\n }\n }\n \n public InverseNumber(int limit, Modular modular) {\n this(new int[limit + 1], limit, modular);\n }\n \n }\n \n static class FastInput {\n private final InputStream is;\n private byte[] buf = new byte[1 << 20];\n private int bufLen;\n private int bufOffset;\n private int next;\n \n public FastInput(InputStream is) {\n this.is = is;\n }\n \n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n bufLen = -1;\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n \n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n \n public int readInt() {\n int sign = 1;\n \n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n \n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n \n return val;\n }\n \n }\n \n static class PrimeCombination implements IntCombination {\n final Factorial factorial;\n final Modular modular;\n \n public PrimeCombination(Factorial factorial) {\n this.factorial = factorial;\n this.modular = factorial.getModular();\n }\n \n public PrimeCombination(int limit, Modular modular) {\n this(new Factorial(limit, modular));\n }\n \n public int combination(int m, int n) {\n if (n > m) {\n return 0;\n }\n return modular.mul(modular.mul(factorial.fact(m), factorial.invFact(n)), factorial.invFact(m - n));\n }\n \n }\n \n static class Modular {\n int m;\n \n public int getMod() {\n return m;\n }\n \n public Modular(int m) {\n this.m = m;\n }\n \n public Modular(long m) {\n this.m = (int) m;\n if (this.m != m) {\n throw new IllegalArgumentException();\n }\n }\n \n public Modular(double m) {\n this.m = (int) m;\n if (this.m != m) {\n throw new IllegalArgumentException();\n }\n }\n \n public int valueOf(int x) {\n x %= m;\n if (x < 0) {\n x += m;\n }\n return x;\n }\n \n public int valueOf(long x) {\n x %= m;\n if (x < 0) {\n x += m;\n }\n return (int) x;\n }\n \n public int mul(int x, int y) {\n return valueOf((long) x * y);\n }\n \n public int plus(int x, int y) {\n return valueOf(x + y);\n }\n \n public String toString() {\n return \"mod \" + m;\n }\n \n }\n \n static class Factorial {\n int[] fact;\n int[] inv;\n Modular modular;\n \n public Modular getModular() {\n return modular;\n }\n \n public Factorial(int[] fact, int[] inv, InverseNumber in, int limit, Modular modular) {\n this.modular = modular;\n this.fact = fact;\n this.inv = inv;\n fact[0] = inv[0] = 1;\n for (int i = 1; i <= limit; i++) {\n fact[i] = modular.mul(fact[i - 1], i);\n inv[i] = modular.mul(inv[i - 1], in.inv[i]);\n }\n }\n \n public Factorial(int limit, Modular modular) {\n this(new int[limit + 1], new int[limit + 1], new InverseNumber(limit, modular), limit, modular);\n }\n \n public int fact(int n) {\n return fact[n];\n }\n \n public int invFact(int n) {\n return inv[n];\n }\n \n }\n \n static class Power {\n final Modular modular;\n \n public Power(Modular modular) {\n this.modular = modular;\n }\n \n public int pow(int x, int n) {\n if (n == 0) {\n return modular.valueOf(1);\n }\n long r = pow(x, n >> 1);\n r = modular.valueOf(r * r);\n if ((n & 1) == 1) {\n r = modular.valueOf(r * x);\n }\n return (int) r;\n }\n \n }\n }", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "96507be14623edf603dd4e80191413d2", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class E {\n\t\n\tstatic long mod=998244353;\n\tstatic long[] facts, factInvs;\n\t\n\tpublic static void main(String[] args) {\n\t\tprecomp();\n\t\tFastScanner fs=new FastScanner();\n\t\ttry {\n\t\tint n=fs.nextInt(), k=fs.nextInt();\n\t\tif (k==0) {\n\t\t\tSystem.out.println(facts[n]);\n\t\t\treturn;\n\t\t}\n\t\tif (k>=n) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\t\tint nUsable=n-k;\n\t\tlong assignWays=powGo(nUsable, n);\n\t\tlong pickThese=nCk(n, nUsable);\n\t\tlong ways=mul(assignWays, pickThese);\n\t\tSystem.out.println(mul(ways, 2));\n\t\t}\n\t\tcatch(Throwable t) {\n\t\t\tSystem.out.println(0);\n\t\t}\n\t}\n\t\n\tstatic long powGo(int base, long exp) {\n\t\tlong ans=0;\n\t\tfor (int sub=0; sub<base; sub++) {\n\t\t\tlong delta=fastPow(base-sub, exp)*nCk(base, sub);\n\t\t\tif (sub%2==0) {\n\t\t\t\tans=add(ans, delta);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tans=sub(ans, delta);\n\t\t\t}\n\t\t}\n\t\treturn ans;\n\t}\n\t\n\tstatic void precomp() {\n\t\tfacts=new long[1_000_000];\n\t\tfactInvs=new long[1_000_000];\n\t\tfacts[0]=factInvs[0]=1;\n\t\tfor (int i=1; i<facts.length; i++) facts[i]=mul(facts[i-1], i);\n\t\tfactInvs[facts.length-1]=fastPow(facts[facts.length-1], mod-2);\n\t\tfor (int i=factInvs.length-2; i>=0; i--) factInvs[i]=mul(factInvs[i+1], i+1);\n\t}\n\t\n\tstatic long nCk(int n, int k) {\n\t\tlong ans=mul(facts[n], mul(factInvs[k], factInvs[n-k]));\n\t\treturn ans;\n\t}\n\n\tstatic long add(long a, long b) {\n\t\treturn (a+b)%mod;\n\t}\n\t\n\tstatic long sub(long a, long b) {\n\t\treturn ((a-b)%mod+mod)%mod;\n\t}\n\t\n\tstatic long mul(long a, long b) {\n\t\treturn a*b%mod;\n\t}\n\t\n\tstatic long fastPow(long base, long exp) {\n\t\tif (exp==0) return 1;\n\t\tlong half=fastPow(base, exp/2);\n\t\tif (exp%2==0) return mul(half, half);\n\t\treturn mul(half, mul(half, base));\n\t}\n\t\n\tstatic class FastScanner {\n\t\tBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st=new StringTokenizer(\"\");\n\n\t\tpublic String next() {\n\t\t\twhile (!st.hasMoreElements())\n\t\t\t\ttry {\n\t\t\t\t\tst=new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic int[] readArray(int n) {\n\t\t\tint[] a=new int[n];\n\t\t\tfor (int i=0; i<n; i++) {\n\t\t\t\ta[i]=nextInt();\n\t\t\t}\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t}\n\t\n}\n", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "8878a40ad1cd66d421916414786d61cb", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\tstatic void solve() {\n\t\tint n = ni();\n\t\tlong tmp = nl();\n\t\tif(n <= tmp) {\n\t\t\tout.println(0);\n\t\t\treturn;\n\t\t}\n\t\tint k = (int)tmp;\n\t\tpreFact(400000);\n\t\tlong ans = 0;\n\t\tint si = 1;\n\t\tlong t = cmb(n, n-k);\n\t\tfor(int i=n-k;i>=1;i--) {\n\t\t\tans += si * cmb(n-k, i) * pow(i, n);\n\t\t\tans %= mod;\n\t\t\tif(ans < 0)ans += mod;\n\t\t\tsi *= -1;\n\t\t}\n\t\tans *= t; ans %= mod;\n\t\tif(k!=0)ans *= 2; ans %= mod;\n\t\tif(ans < 0) ans += mod;\n\t\tout.println(ans);\n\t}\n\t\n\t//Fast Fermat Combination\n\tstatic long fact[];\n\tstatic long revFact[];\n\t\n\tstatic void preFact(int n) {\n\t\tfact = new long[n + 1];\n\t\trevFact = new long[n + 1];\n\t\tfact[0] = 1;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfact[i + 1] = mul(i + 1, fact[i]);\n\t\t}\n\t\trevFact[n] = div(1, fact[n]);\n\t\tfor (int i = n - 1; i >= 0; i--) {\n\t\t\trevFact[i] = mul(revFact[i + 1], i + 1);\n\t\t}\n\t}\n\t\n\tstatic long cmb(int a, int b) {\n\t\tif (a<b)return 0;\n\t\tif (fact.length == 0)\n\t\t\tSystem.err.println(\"error : factorials has not been culculated!! do [pre_factorial] method\");\n\t\tlong af = fact[a];\n\t\tlong bf = revFact[b];\n\t\tlong abf = revFact[a - b];\n\t\tlong res = mul(mul(af, bf), abf);\n\t\treturn res;\n\t}\n\t\n\t//constant\n\tstatic final int inf = Integer.MAX_VALUE / 2;\n\tstatic final long linf = Long.MAX_VALUE / 3;\n\tstatic final double dinf = Double.MAX_VALUE / 3;\n\tstatic final long mod = (long) 998244353;\n\tstatic final int[] dx = { -1, 0, 1, 0 }, dy = { 0, -1, 0, 1 }, dx8 = { -1, -1, -1, 0, 0, 1, 1, 1 }, dy8 = { -1, 0, 1, -1, 1, -1, 0, 1 };\n\tstatic final double eps = 1e-10, pi = Math.PI;\n\tstatic StringBuilder sb = new StringBuilder();\n\t\n\t//libraries\n\tstatic void reverse(int ar[]) {\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tint t = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = t;\n\t\t}\n\t}\n\tstatic void reverse(long ar[]) {\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tlong t = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = t;\n\t\t}\n\t}\n\tstatic void reverse(double ar[]) {\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tdouble t = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = t;\n\t\t}\n\t}\n\tstatic void reverse(char ar[]) {\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tchar t = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = t;\n\t\t}\n\t}\n\tstatic String getReverse(String s) {\n\t\tchar c[] = s.toCharArray();\n\t\treverse(c);\n\t\ts = String.valueOf(c);\n\t\treturn s;\n\t}\n\tstatic <T> void reverse(List<T> ls) {\n\t\tint sz = ls.size();\n\t\tfor (int i = 0; i < sz / 2; i++) {\n\t\t\tT t = ls.get(i);\n\t\t\tls.set(i, ls.get(sz - 1 - i));\n\t\t\tls.set(sz - 1 - i, t);\n\t\t}\n\t}\n\tstatic <T> void reverse(T[] ar) {\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tT t = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = t;\n\t\t}\n\t}\n\tstatic void sbnl() {//StringBuilderに改行文字をappendする\n\t\tsb.append(\"\\n\");\n\t}\n\tstatic int lowerBound(int[] a, int x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] < x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int upperBound(int[] a, int x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] <= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int rlowerBound(int[] a, int x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] > x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int rupperBound(int[] a, int x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] >= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int lowerBound(long[] a, long x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] < x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int upperBound(long[] a, long x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] <= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int rlowerBound(long[] a, long x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] > x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int rupperBound(long[] a, long x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] >= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int lowerBound(double[] a, double x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] < x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int upperBound(double[] a, double x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] <= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int rlowerBound(double[] a, double x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] > x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int rupperBound(double[] a, double x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] >= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int lowerBound(char[] a, char x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] < x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int upperBound(char[] a, char x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] <= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int rlowerBound(char[] a, char x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] > x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int rupperBound(char[] a, char x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] >= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic <T> int lowerBound(List<T> ls, T x) throws RuntimeException {\n\t\tif (ls.size() == 0)\n\t\t\treturn -1;\n\t\tif (ls.get(0) instanceof Integer) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Integer) t1).compareTo((Integer) t2) >= 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Long) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Long) t1).compareTo((Long) t2) >= 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Double) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Double) t1).compareTo((Double) t2) >= 0 ? 1 : -1);\n\t\t} else {\n\t\t\tSystem.err.println(\n\t\t\t\t\tString.format(\"%s:数値でないリストを二分探索しています。\", Thread.currentThread().getStackTrace()[1].getMethodName()));\n\t\t\tthrow new RuntimeException();\n\t\t}\n\t}\n\tstatic <T> int upperBound(List<T> ls, T x) throws RuntimeException {\n\t\tif (ls.size() == 0)\n\t\t\treturn -1;\n\t\tif (ls.get(0) instanceof Integer) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Integer) t1).compareTo((Integer) t2) > 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Long) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Long) t1).compareTo((Long) t2) > 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Double) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Double) t1).compareTo((Double) t2) > 0 ? 1 : -1);\n\t\t} else {\n\t\t\tSystem.err.println(\n\t\t\t\t\tString.format(\"%s:数値でないリストを二分探索しています。\", Thread.currentThread().getStackTrace()[1].getMethodName()));\n\t\t\tthrow new RuntimeException();\n\t\t}\n\t}\n\tstatic <T> int rupperBound(List<T> ls, T x) throws RuntimeException {\n\t\tif (ls.size() == 0)\n\t\t\treturn -1;\n\t\tif (ls.get(0) instanceof Integer) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Integer) t1).compareTo((Integer) t2) < 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Long) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Long) t1).compareTo((Long) t2) < 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Double) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Double) t1).compareTo((Double) t2) < 0 ? 1 : -1);\n\t\t} else {\n\t\t\tSystem.err.println(\n\t\t\t\t\tString.format(\"%s:数値でないリストを二分探索しています。\", Thread.currentThread().getStackTrace()[1].getMethodName()));\n\t\t\tthrow new RuntimeException();\n\t\t}\n\t}\n\tstatic <T> int rlowerBound(List<T> ls, T x) {\n\t\tif (ls.size() == 0)\n\t\t\treturn -1;\n\t\tif (ls.get(0) instanceof Integer) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Integer) t1).compareTo((Integer) t2) <= 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Long) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Long) t1).compareTo((Long) t2) <= 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Double) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Double) t1).compareTo((Double) t2) <= 0 ? 1 : -1);\n\t\t} else {\n\t\t\tSystem.err.println(\n\t\t\t\t\tString.format(\"%s:数値でないリストを二分探索しています。\", Thread.currentThread().getStackTrace()[1].getMethodName()));\n\t\t\tthrow new RuntimeException();\n\t\t}\n\t}\n\tstatic int[] concat(int x, int arr[]) {\n\t\tint ret[] = new int[arr.length + 1];\n\t\tSystem.arraycopy(arr, 0, ret, 1, ret.length - 1);\n\t\tret[0] = x;\n\t\treturn ret;\n\t}\n\tstatic int[] concat(int arr[], int x) {\n\t\tint ret[] = new int[arr.length + 1];\n\t\tSystem.arraycopy(arr, 0, ret, 0, ret.length - 1);\n\t\tret[ret.length - 1] = x;\n\t\treturn ret;\n\t}\n\tstatic long[] concat(long x, long arr[]) {\n\t\tlong ret[] = new long[arr.length + 1];\n\t\tSystem.arraycopy(arr, 0, ret, 1, ret.length - 1);\n\t\tret[0] = x;\n\t\treturn ret;\n\t}\n\tstatic long[] concat(long arr[], long x) {\n\t\tlong ret[] = new long[arr.length + 1];\n\t\tSystem.arraycopy(arr, 0, ret, 0, ret.length - 1);\n\t\tret[ret.length - 1] = x;\n\t\treturn ret;\n\t}\n\tstatic char[] concat(char x, char arr[]) {\n\t\tchar ret[] = new char[arr.length + 1];\n\t\tSystem.arraycopy(arr, 0, ret, 0, ret.length - 1);\n\t\tret[ret.length - 1] = x;\n\t\treturn ret;\n\t}\n\tstatic char[] concat(char arr[], char x) {\n\t\tchar ret[] = new char[arr.length + 1];\n\t\tSystem.arraycopy(arr, 0, ret, 0, ret.length - 1);\n\t\tret[ret.length - 1] = x;\n\t\treturn ret;\n\t}\n\tstatic int max(int x, int y) {\n\t\treturn Math.max(x, y);\n\t}\n\tstatic int min(int x, int y) {\n\t\treturn Math.min(x, y);\n\t}\n\tstatic int max(int x, int y, int z) {\n\t\tx = Math.max(x, y);\n\t\tx = Math.max(x, z);\n\t\treturn x;\n\t}\n\tstatic int min(int x, int y, int z) {\n\t\tx = Math.min(x, y);\n\t\tx = Math.min(x, z);\n\t\treturn x;\n\t}\n\tstatic long max(long x, long y) {\n\t\treturn Math.max(x, y);\n\t}\n\tstatic long min(long x, long y) {\n\t\treturn Math.min(x, y);\n\t}\n\tstatic long max(long x, long y, long z) {\n\t\tx = Math.max(x, y);\n\t\tx = Math.max(x, z);\n\t\treturn x;\n\t}\n\tstatic long min(long x, long y, long z) {\n\t\tx = Math.min(x, y);\n\t\tx = Math.min(x, z);\n\t\treturn x;\n\t}\n\tstatic double max(double x, double y) {\n\t\treturn Math.max(x, y);\n\t}\n\tstatic double min(double x, double y) {\n\t\treturn Math.min(x, y);\n\t}\n\tstatic double max(double x, double y, double z) {\n\t\tx = Math.max(x, y);\n\t\tx = Math.max(x, z);\n\t\treturn x;\n\t}\n\tstatic double min(double x, double y, double z) {\n\t\tx = Math.min(x, y);\n\t\tx = Math.min(x, z);\n\t\treturn x;\n\t}\n\tstatic void sort(int[] ar) {\n\t\tArrays.sort(ar);\n\t}\n\tstatic void sort(long[] ar) {\n\t\tArrays.sort(ar);\n\t}\n\tstatic void sort(double[] ar) {\n\t\tArrays.sort(ar);\n\t}\n\tstatic void sort(char[] ar) {\n\t\tArrays.sort(ar);\n\t}\n\tstatic void rsort(int[] ar) {\n\t\tArrays.sort(ar);\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tint tmp = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = tmp;\n\t\t}\n\t}\n\tstatic void rsort(long[] ar) {\n\t\tArrays.sort(ar);\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tlong tmp = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = tmp;\n\t\t}\n\t}\n\tstatic void rsort(double[] ar) {\n\t\tArrays.sort(ar);\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tdouble tmp = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = tmp;\n\t\t}\n\t}\n\tstatic void rsort(char[] ar) {\n\t\tArrays.sort(ar);\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tchar tmp = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = tmp;\n\t\t}\n\t}\n\tstatic void fill(int arr[], int x) {\n\t\tArrays.fill(arr, x);\n\t}\n\tstatic void fill(long arr[], long x) {\n\t\tArrays.fill(arr, x);\n\t}\n\tstatic void fill(boolean arr[], boolean x) {\n\t\tArrays.fill(arr, x);\n\t}\n\tstatic void fill(double arr[], double x) {\n\t\tArrays.fill(arr, x);\n\t}\n\tstatic void fill(int arr[][], int x) {\n\t\tfor (int i = 0; i < arr.length; i++)\n\t\t\tArrays.fill(arr[i], x);\n\t}\n\tstatic void fill(long arr[][], long x) {\n\t\tfor (int i = 0; i < arr.length; i++)\n\t\t\tArrays.fill(arr[i], x);\n\t}\n\tstatic void fill(double arr[][], double x) {\n\t\tfor (int i = 0; i < arr.length; i++)\n\t\t\tArrays.fill(arr[i], x);\n\t}\n\tstatic void fill(boolean arr[][], boolean x) {\n\t\tfor (int i = 0; i < arr.length; i++)\n\t\t\tArrays.fill(arr[i], x);\n\t}\n\t//MOD culc\n\tstatic long plus(long x, long y) {\n\t\tlong res = (x + y) % mod;\n\t\treturn res < 0 ? res + mod : res;\n\t}\n\tstatic long sub(long x, long y) {\n\t\tlong res = (x - y) % mod;\n\t\treturn res < 0 ? res + mod : res;\n\t}\n\tstatic long mul(long x, long y) {\n\t\tlong res = (x * y) % mod;\n\t\treturn res < 0 ? res + mod : res;\n\t}\n\tstatic long div(long x, long y) {\n\t\tlong res = x * pow(y, mod - 2) % mod;\n\t\treturn res < 0 ? res + mod : res;\n\t}\n\tstatic long pow(long x, long y) {\n\t\tif (y < 0)\n\t\t\treturn 0;\n\t\tif (y == 0)\n\t\t\treturn 1;\n\t\tif (y % 2 == 1)\n\t\t\treturn (x * pow(x, y - 1)) % mod;\n\t\tlong root = pow(x, y / 2);\n\t\treturn root * root % mod;\n\t}\n\tpublic static void main(String[] args) throws Exception {\n\t\tis = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.flush();\n\t}\n\t//input\n\tstatic InputStream is;\n\tstatic PrintWriter out;\n\tstatic String INPUT = \"\";\n\tprivate static byte[] inbuf = new byte[1024];\n\tstatic int lenbuf = 0, ptrbuf = 0;\n\tprivate static int readByte() {\n\t\tif (lenbuf == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (ptrbuf >= lenbuf) {\n\t\t\tptrbuf = 0;\n\t\t\ttry {\n\t\t\t\tlenbuf = is.read(inbuf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (lenbuf <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\tprivate static boolean isSpaceChar(int c) {\n\t\treturn !(c >= 33 && c <= 126);\n\t}\n\tprivate static int skip() {\n\t\tint b;\n\t\twhile ((b = readByte()) != -1 && isSpaceChar(b))\n\t\t\t;\n\t\treturn b;\n\t}\n\t@SuppressWarnings(\"unused\")\n\tprivate static double nd() {\n\t\treturn Double.parseDouble(ns());\n\t}\n\t@SuppressWarnings(\"unused\")\n\tprivate static char nc() {\n\t\treturn (char) skip();\n\t}\n\tprivate static String ns() {\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile (!(isSpaceChar(b))) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\tprivate static char[] ns(int n) {\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile (p < n && !(isSpaceChar(b))) {\n\t\t\tbuf[p++] = (char) b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t@SuppressWarnings(\"unused\")\n\tprivate static char[][] nm(int n, int m) {\n\t\tchar[][] map = new char[n][];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tmap[i] = ns(m);\n\t\treturn map;\n\t}\n\t@SuppressWarnings(\"unused\")\n\tprivate static int[] na(int n) {\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = ni();\n\t\treturn a;\n\t}\n\t@SuppressWarnings(\"unused\")\n\tprivate static long[] nla(int n) {\n\t\tlong[] a = new long[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = nl();\n\t\treturn a;\n\t}\n\tprivate static int ni() {\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t@SuppressWarnings(\"unused\")\n\tprivate static long nl() {\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "35fe70b61eb0bfa58c8f346b743cab18", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.File;\nimport java.io.FileReader;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class e_e86 {\n\t\n\tstatic int MOD = 998244353;\n\tstatic long fact [];\n\n\tpublic static void main(String[] args) throws Exception {\n\t\t// TODO Auto-generated method stub\n\n\t\tFastScanner in = new FastScanner(System.in);\n\t\tOutputStream outputStream = System.out;\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\t\n\t\tint N = in.nextInt();\n\t\tlong pk = in.nextLong();\n\t\tif(pk > N-1) {\n\t\t\tout.println(0);\n\t\t}else {\n\t\t\tint k = (int) pk;\n\t\t\tfact = new long [N+1];\n\t\t\t\n\t\t\tfact[0] = 1;\n\t\t\tfor(int i = 1; i <= N; i++) {\n\t\t\t\tfact[i] = (i*fact[i-1])%MOD;\n\t\t\t}\n\t\t\t\n\t\t\tlong ans = 0;\n\t\t\tint dir = 1;\n\t\t\tint c = N-k;\n\t\t\tfor(int i = c; i >= 0; i--) {\n\t\t\t\tlong dif = (choose(c, i)*power(i, N))%MOD;\n\t\t\t\tdif = dir*dif;\n\t\t\t\tans = (ans + dif + MOD)%MOD;\n\t\t\t\t\n\t\t//\t\tout.println(dir*(((choose(c, i))*power(i, N) + MOD)%MOD + MOD)%MOD +\" \" + choose(c, i) + \" \" + power(i, N));\n\t\t\t\tdir = -dir;\n\t\t\t}\n\t\t\t\n\t\t\tans = (ans*choose(N, c))%MOD;\n\t\t\tif(k > 0) {\n\t\t\t\tans = (2*ans)%MOD;\n\t\t\t}\n\t\t\t\n\t\t\tout.println(ans);\n\t\t}\n\t\t\n\t\tout.close();\n\t\t\n\n\t}\n\t\n\tstatic long choose(int a, int b) {\n\t\tlong res = (fact[a] * inv((fact[b] * fact[a-b])%MOD))%MOD;\n\t\treturn res;\n\t}\n\t \n\tstatic long power (long x, int y) {\n\t\tlong res = 1;\n\t\twhile(y > 0) {\n\t\t\tif(y%2 == 1) res = (res*x)%MOD;\n\t\t\tx = (x*x)%MOD;\n\t\t\ty /= 2;\n\t\t}\n\t\treturn (res%MOD);\n\t}\n\t\n\tstatic long inv (long a) {\n\t\treturn power(a, MOD-2);\n\t}\n\n\tstatic class FastScanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tpublic FastScanner(InputStream stream) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(stream));\n\t\t\tst = new StringTokenizer(\"\");\n\t\t}\n\n\t\tpublic FastScanner(String fileName) throws Exception {\n\t\t\tbr = new BufferedReader(new FileReader(new File(fileName)));\n\t\t\tst = new StringTokenizer(\"\");\n\t\t}\n\n\t\tpublic String next() throws Exception {\n\t\t\twhile (!st.hasMoreTokens()) {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() throws Exception {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic long nextLong() throws Exception {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic Double nextDouble() throws Exception {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tpublic String nextLine() throws Exception {\n\t\t\tif (st.hasMoreTokens()) {\n\t\t\t\tStringBuilder str = new StringBuilder();\n\t\t\t\tboolean first = true;\n\t\t\t\twhile (st.hasMoreTokens()) {\n\t\t\t\t\tif (first) {\n\t\t\t\t\t\tfirst = false;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tstr.append(\" \");\n\t\t\t\t\t}\n\t\t\t\t\tstr.append(st.nextToken());\n\t\t\t\t}\n\t\t\t\treturn str.toString();\n\t\t\t} else {\n\t\t\t\treturn br.readLine();\n\t\t\t}\n\t\t}\n\t}\n\n\t\n}\n", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "a1febe41c691c861a6c541865d73935c", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\n\n\nimport java.io.BufferedReader;\nimport java.io.FileNotFoundException;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\n\n\npublic class COVID {\n\n\tstatic ArrayList<Integer>[] adjList;\n\n\n\n\n\n\n\tstatic int[] fac;\n\tstatic int mod=998244353;\n\n\tstatic int pow(int b,long e, int mod) {\n\t\tint ans=1;\n\t\tb%=mod;\n\t\twhile(e>0) {\n\t\t\tif((e&1)==1)\n\t\t\t\tans=(int)((ans*1l*b)%mod);\n\t\t\te>>=1;\n\t\t\tb=(int)((b*1l*b)%mod);\n\t\t}\n\t\treturn ans;\n\t}\n\tstatic long ncr(int n , int r ) {\n\t\tlong ans=fac[n];\n\t\tlong de=((fac[n-r]*1l*fac[r])%mod);\n\t\tde=pow((int)de, mod-2, mod);\n\t\treturn (ans*de)%mod;\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\tPrintWriter pw =new PrintWriter(System.out);\n\t\tint n=sc.nextInt();\n\t\tlong k=sc.nextLong();\n\t\tif(k>n-1) {\n\t\t\tpw.println(0);\n\t\t\tpw.flush();\n\t\t\treturn;\n\t\t}\n\t\tfac=new int[n+1];\n\t\tfac[0]=1;\n\t\tfor(int i=1;i<fac.length;i++)\n\t\t\tfac[i]=(int)((fac[i-1]*1l*(i%mod))%mod);\n\t\t\n\t\tint pop=n-(int)k;\n\t\tlong ans=0;\n\t\tfor(int i=0;i<=pop;i++) {\n\t\t\tlong notPop= (ncr(pop,i)*pow(pop-i,n,mod))%mod;\n\t\t\tif(notPop<0) {\n\t\t\t\tSystem.out.println(\"here\");\n\t\t\t\t\n\t\t\t}\n\t\t\tif(i%2==1)notPop*=-1;\n\t\t\tans+=(notPop+mod);\n\t\t\tans%=mod;\n\t\t}\n\t\tans*=ncr(n,pop);\n\t\tans%=mod;\n\t\tif(k!=0)\n\t\t\tans=ans*2%mod;\n\t\tpw.println(ans);\n\t\tpw.flush();\n\t\tpw.close();\n\t}\n\tstatic long gcd(long a, long b) {\n\t\treturn (b==0)?a:gcd(b,a%b);\n\t}\n\tstatic long lcm(long a, long b) {\n\t\treturn a/gcd(a,b)*b;\n\t}\n\tpublic static int log(int n , int base) {\n\t\tint ans=0;\n\t\twhile(n+1>base) {\n\t\t\tans++;\n\t\t\tn/=base;\n\t\t}\n\t\treturn ans;\n\t}\n\tstatic long square(long l) {\n\t\treturn l*l;\n\t}\n\n\n\n\n\n\tstatic class Pair implements Comparable<Pair>{\n\t\tint x;int y;\n\n\t\tpublic Pair(int a,int b) {\n\t\t\tthis.x=a;y=b;\n\t\t}\n\n\n\n\t\tpublic int compareTo(Pair o) {\n\t\t\treturn (x==o.x)?((y>o.y)?1:(y==o.y)?0:-1):((x>o.x)?1:-1);\n\t\t}\n\n\n\t\t@Override\n\n\t\tpublic int hashCode() {\n\t\t\tfinal int prime = 31;\n\t\t\tint result = 1;\n\t\t\tresult = prime * result + x;\n\t\t\tresult = prime * result + y;\n\t\t\treturn result;\n\t\t}\n\n\n\t\t@Override\n\t\tpublic boolean equals(Object obj) {\n\t\t\tif (this == obj)\n\t\t\t\treturn true;\n\t\t\tif (obj == null)\n\t\t\t\treturn false;\n\t\t\tif (getClass() != obj.getClass())\n\t\t\t\treturn false;\n\t\t\tPair other = (Pair) obj;\n\t\t\tif (x != other.x)\n\t\t\t\treturn false;\n\t\t\tif (y != other.y)\n\t\t\t\treturn false;\n\t\t\treturn true;\n\t\t}\n\n\t}\n\n\n\n\n\n\tstatic class Scanner {\n\t\tStringTokenizer st;\n\t\tBufferedReader br;\n\n\t\tpublic Scanner(InputStream s) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(s));\n\t\t}\n\t\tpublic Scanner(String s) throws FileNotFoundException{\tbr = new BufferedReader(new FileReader(s));}\n\n\t\tpublic long[] nextLongArr(int n) throws IOException {\n\t\t\tlong[] arr=new long[n];\n\t\t\tfor(int i=0;i<n;i++)\n\t\t\t\tarr[i]=nextLong();\n\t\t\treturn arr;\n\t\t}\n\t\tpublic int[] nextIntArr(int n) throws IOException {\n\t\t\tint[] arr=new int[n];\n\t\t\tfor(int i=0;i<n;i++)\n\t\t\t\tarr[i]=nextInt();\n\t\t\treturn arr;\n\t\t}\n\t\tpublic String next() throws IOException {\n\t\t\twhile (st == null || !st.hasMoreTokens())\n\t\t\t\tst = new StringTokenizer(br.readLine(),\" ,\");\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic long nextLong() throws IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic String nextLine() throws IOException {\n\t\t\treturn br.readLine();\n\t\t}\n\n\n\t\tpublic double nextDouble() throws IOException {\n\t\t\tString x = next();\n\t\t\tStringBuilder sb = new StringBuilder(\"0\");\n\t\t\tdouble res = 0, f = 1;\n\t\t\tboolean dec = false, neg = false;\n\t\t\tint start = 0;\n\t\t\tif (x.charAt(0) == '-') {\n\t\t\t\tneg = true;\n\t\t\t\tstart++;\n\t\t\t}\n\t\t\tfor (int i = start; i < x.length(); i++) {\n\t\t\t\tif (x.charAt(i) == '.') {\n\t\t\t\t\tres = Long.parseLong(sb.toString());\n\t\t\t\t\tsb = new StringBuilder(\"0\");\n\t\t\t\t\tdec = true;\n\t\t\t\t} else {\n\t\t\t\t\tsb.append(x.charAt(i));\n\t\t\t\t\tif (dec)\n\t\t\t\t\t\tf *= 10;\n\t\t\t\t}\n\t\t\t\tif (sb.length() == 18) {\n\t\t\t\t\tres += Long.parseLong(sb.toString()) / f;\n\t\t\t\t\tsb = new StringBuilder(\"0\");\n\t\t\t\t}\n\t\t\t}\n\t\t\tres += Long.parseLong(sb.toString()) / f;\n\t\t\treturn res * (neg ? -1 : 1);\n\t\t}\n\n\t\tpublic boolean ready() throws IOException {\n\t\t\treturn br.ready();\n\t\t}\n\n\t}\n\n\tpublic static void shuffle(int[] a) {\n\t\tint n = a.length;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint r = i + (int) (Math.random() * (n - i));\n\t\t\tint tmp = a[i];\n\t\t\ta[i] = a[r];\n\t\t\ta[r] = tmp;\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "8f8bf9b60b9b5c25705de1602d93ea8e", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.StringTokenizer;\nimport java.io.BufferedReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n EPlacingRooks solver = new EPlacingRooks();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class EPlacingRooks {\n NumberTheory.Mod998 mod = new NumberTheory.Mod998();\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.nextInt();\n long k = in.nextLong();\n if (k == 0) {\n out.println(mod.fact(n));\n return;\n }\n\n if (k > n - 1) {\n out.println(0);\n return;\n }\n\n // This is the number of columns that are non-empty.\n int c = (int) (n - k);\n\n long answer = 0;\n for (int i = 1; i <= c; i++) {\n // i is the number of allowable columns to put things\n long term = mod.mult(mod.paritySign(c - i), mod.ncr(c, i), mod.pow(i, n));\n answer = mod.add(answer, term);\n }\n\n // Multiply by 2 C(n, c) because we want to pick c rows or c columns.\n answer = mod.mult(answer, 2, mod.ncr(n, c));\n\n out.println(answer);\n }\n\n }\n\n static class NumberTheory {\n private static void ASSERT(boolean assertion) {\n if (!assertion)\n throw new AssertionError();\n }\n\n public abstract static class Modulus<M extends NumberTheory.Modulus<M>> {\n final ArrayList<Long> factorial = new ArrayList<>();\n final ArrayList<Long> invFactorial = new ArrayList<>();\n\n public abstract long modulus();\n\n public Modulus() {\n super();\n factorial.add(1L);\n invFactorial.add(1L);\n }\n\n public long fact(int n) {\n while (factorial.size() <= n) {\n factorial.add(mult(factorial.get(factorial.size() - 1), factorial.size()));\n }\n\n return factorial.get(n);\n }\n\n public long fInv(int n) {\n int lastKnown = invFactorial.size() - 1;\n\n if (lastKnown < n) {\n long[] fInv = new long[n - lastKnown];\n fInv[0] = inv(fact(n));\n for (int i = 1; i < fInv.length; i++) {\n fInv[i] = mult(fInv[i - 1], n - i + 1);\n }\n for (int i = fInv.length - 1; i >= 0; i--) {\n invFactorial.add(fInv[i]);\n }\n }\n\n return invFactorial.get(n);\n }\n\n public long paritySign(long k) {\n return (k & 1) == 0 ? 1 : modulus() - 1;\n }\n\n public long ncr(int n, int r) {\n ASSERT(n >= 0);\n if (r < 0 || n < r)\n return 0;\n return mult(fact(n), mult(fInv(r), fInv(n - r)));\n }\n\n public long normalize(long x) {\n x %= modulus();\n if (x < 0)\n x += modulus();\n return x;\n }\n\n public long add(long a, long b) {\n long v = a + b;\n return v < modulus() ? v : v - modulus();\n }\n\n public long mult(long... x) {\n long r = 1;\n for (long i : x)\n r = mult(r, i);\n return r;\n }\n\n public long mult(long a, long b) {\n return (a * b) % modulus();\n }\n\n public long pow(long x, int e) {\n if (e < 0) {\n x = inv(x);\n e *= -1;\n }\n if (e == 0)\n return 1;\n if ((e & 1) > 0)\n return mult(x, pow(x, e - 1));\n return pow(mult(x, x), e / 2);\n }\n\n public long inv(long value) {\n long g = modulus(), x = 0, y = 1;\n for (long r = value; r != 0; ) {\n long q = g / r;\n g %= r;\n\n long temp = g;\n g = r;\n r = temp;\n\n x -= q * y;\n\n temp = x;\n x = y;\n y = temp;\n }\n\n ASSERT(g == 1);\n ASSERT(y == modulus() || y == -modulus());\n\n return normalize(x);\n }\n\n }\n\n public static class Mod998 extends NumberTheory.Modulus<NumberTheory.Mod998> {\n public long modulus() {\n return 998_244_353L;\n }\n\n }\n\n }\n\n static class InputReader {\n public final BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "e43c6962d0483729c7afed0aed53e0c0", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.UncheckedIOException;\nimport java.io.Closeable;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) throws Exception {\n Thread thread = new Thread(null, new TaskAdapter(), \"\", 1 << 27);\n thread.start();\n thread.join();\n }\n\n static class TaskAdapter implements Runnable {\n @Override\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastInput in = new FastInput(inputStream);\n FastOutput out = new FastOutput(outputStream);\n EPlacingRooks solver = new EPlacingRooks();\n solver.solve(1, in, out);\n out.close();\n }\n }\n\n static class EPlacingRooks {\n public void solve(int testNumber, FastInput in, FastOutput out) {\n int n = in.readInt();\n int k = in.readInt();\n Modular mod = new Modular(998244353);\n int m = n - k;\n\n if (k == 0) {\n int ans = 1;\n for (int i = 1; i <= n; i++) {\n ans = mod.mul(ans, i);\n }\n out.println(ans);\n return;\n }\n if (m <= 0 || m > n) {\n out.println(0);\n return;\n }\n\n PrimeCombination combination = new PrimeCombination(n, mod);\n Power power = new Power(mod);\n int ans = 0;\n for (int i = 0; i <= m; i++) {\n int local = combination.combination(m, i);\n if (i % 2 == 1) {\n local = mod.valueOf(-local);\n }\n local = mod.mul(local, power.pow(m - i, n));\n ans = mod.plus(ans, local);\n }\n ans = mod.mul(ans, combination.combination(n, m));\n\n ans = mod.mul(ans, 2);\n out.println(ans);\n }\n\n }\n\n static interface IntCombination {\n }\n\n static class FastOutput implements AutoCloseable, Closeable, Appendable {\n private StringBuilder cache = new StringBuilder(10 << 20);\n private final Writer os;\n\n public FastOutput append(CharSequence csq) {\n cache.append(csq);\n return this;\n }\n\n public FastOutput append(CharSequence csq, int start, int end) {\n cache.append(csq, start, end);\n return this;\n }\n\n public FastOutput(Writer os) {\n this.os = os;\n }\n\n public FastOutput(OutputStream os) {\n this(new OutputStreamWriter(os));\n }\n\n public FastOutput append(char c) {\n cache.append(c);\n return this;\n }\n\n public FastOutput append(int c) {\n cache.append(c);\n return this;\n }\n\n public FastOutput println(int c) {\n return append(c).println();\n }\n\n public FastOutput println() {\n cache.append(System.lineSeparator());\n return this;\n }\n\n public FastOutput flush() {\n try {\n os.append(cache);\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n return this;\n }\n\n public void close() {\n flush();\n try {\n os.close();\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n\n public String toString() {\n return cache.toString();\n }\n\n }\n\n static class InverseNumber {\n int[] inv;\n\n public InverseNumber(int[] inv, int limit, Modular modular) {\n this.inv = inv;\n inv[1] = 1;\n int p = modular.getMod();\n for (int i = 2; i <= limit; i++) {\n int k = p / i;\n int r = p % i;\n inv[i] = modular.mul(-k, inv[r]);\n }\n }\n\n public InverseNumber(int limit, Modular modular) {\n this(new int[limit + 1], limit, modular);\n }\n\n }\n\n static class FastInput {\n private final InputStream is;\n private byte[] buf = new byte[1 << 20];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastInput(InputStream is) {\n this.is = is;\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n bufLen = -1;\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public int readInt() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n }\n\n static class PrimeCombination implements IntCombination {\n final Factorial factorial;\n final Modular modular;\n\n public PrimeCombination(Factorial factorial) {\n this.factorial = factorial;\n this.modular = factorial.getModular();\n }\n\n public PrimeCombination(int limit, Modular modular) {\n this(new Factorial(limit, modular));\n }\n\n public int combination(int m, int n) {\n if (n > m) {\n return 0;\n }\n return modular.mul(modular.mul(factorial.fact(m), factorial.invFact(n)), factorial.invFact(m - n));\n }\n\n }\n\n static class Modular {\n int m;\n\n public int getMod() {\n return m;\n }\n\n public Modular(int m) {\n this.m = m;\n }\n\n public Modular(long m) {\n this.m = (int) m;\n if (this.m != m) {\n throw new IllegalArgumentException();\n }\n }\n\n public Modular(double m) {\n this.m = (int) m;\n if (this.m != m) {\n throw new IllegalArgumentException();\n }\n }\n\n public int valueOf(int x) {\n x %= m;\n if (x < 0) {\n x += m;\n }\n return x;\n }\n\n public int valueOf(long x) {\n x %= m;\n if (x < 0) {\n x += m;\n }\n return (int) x;\n }\n\n public int mul(int x, int y) {\n return valueOf((long) x * y);\n }\n\n public int plus(int x, int y) {\n return valueOf(x + y);\n }\n\n public String toString() {\n return \"mod \" + m;\n }\n\n }\n\n static class Factorial {\n int[] fact;\n int[] inv;\n Modular modular;\n\n public Modular getModular() {\n return modular;\n }\n\n public Factorial(int[] fact, int[] inv, InverseNumber in, int limit, Modular modular) {\n this.modular = modular;\n this.fact = fact;\n this.inv = inv;\n fact[0] = inv[0] = 1;\n for (int i = 1; i <= limit; i++) {\n fact[i] = modular.mul(fact[i - 1], i);\n inv[i] = modular.mul(inv[i - 1], in.inv[i]);\n }\n }\n\n public Factorial(int limit, Modular modular) {\n this(new int[limit + 1], new int[limit + 1], new InverseNumber(limit, modular), limit, modular);\n }\n\n public int fact(int n) {\n return fact[n];\n }\n\n public int invFact(int n) {\n return inv[n];\n }\n\n }\n\n static class Power {\n final Modular modular;\n\n public Power(Modular modular) {\n this.modular = modular;\n }\n\n public int pow(int x, int n) {\n if (n == 0) {\n return modular.valueOf(1);\n }\n long r = pow(x, n >> 1);\n r = modular.valueOf(r * r);\n if ((n & 1) == 1) {\n r = modular.valueOf(r * x);\n }\n return (int) r;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "16f2ba0e2f7d7417bde4a4928a95ed01", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/*\nIf you want to aim high, aim high\nDon't let that studying and grades consume you\nJust live life young\n******************************\nIf I'm the sun, you're the moon\nBecause when I go up, you go down\n*******************************\nI'm working for the day I will surpass you\nhttps://www.a2oj.com/Ladder16.html\n*/\nimport java.util.*;\nimport java.io.*;\nimport java.math.*;\n\n public class x1342E\n {\n static long MOD = 998244353L;\n public static void main(String omkar[]) throws Exception\n {\n BufferedReader infile = new BufferedReader(new InputStreamReader(System.in)); \n StringTokenizer st = new StringTokenizer(infile.readLine());\n int N = Integer.parseInt(st.nextToken());\n long lmao = Long.parseLong(st.nextToken());\n if(lmao >= N)\n System.out.println(0);\n else\n {\n int K = (int)lmao;\n int C = N-K;\n fac = new long[200001];\n invfac = new long[200001];\n fac[0] = 1L; invfac[0] = 1L;\n for(int i=1; i <= 200000; i++)\n {\n fac[i] = (fac[i-1]*i)%MOD;\n invfac[i] = power(fac[i], MOD-2, MOD);\n }\n long res = power(C, N, MOD);\n for(int e=1; e < C; e++)\n {\n long temp = power(C-e, N, MOD);\n temp = (temp*nCr(e, C))%MOD;\n if(e%2 == 1)\n res = (res-temp+MOD)%MOD;\n else\n res = (res+temp)%MOD;\n }\n res = (res*nCr(C, N))%MOD;\n if(K > 0)\n res = (2*res)%MOD;\n System.out.println(res);\n }\n }\n static long[] fac;\n static long[] invfac;\n public static long nCr(int a, int b)\n {\n long res = fac[b];\n res = (res*invfac[a])%MOD;\n return (res*invfac[b-a])%MOD;\n }\n public static long power(long x, long y, long p) \n { \n long res = 1L; \n x = x % p; \n while (y > 0) \n { \n if((y & 1)==1) \n res = (res * x) % p; \n y = y >> 1; \n x = (x * x) % p; \n } \n return res; \n } \n }", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "538ec725112c596711968264845a591f", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class E {\n public static long MOD = 998244353;\n public static long[] fact;\n public static long[] invfact;\n public static void main(String[] args) throws IOException{\n BufferedReader f = new BufferedReader(new InputStreamReader(System.in));\n PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));\n StringTokenizer st = new StringTokenizer(f.readLine());\n fact = new long[200001];\n invfact = new long[200001];\n fact[0] = 1L;\n invfact[0] = 1L;\n for(int i = 1; i <= 200000; i++){\n fact[i] = (fact[i-1]*i);\n fact[i]%=MOD;\n invfact[i] = pow(fact[i], MOD-2, MOD)%MOD;\n }\n long n = Long.parseLong(st.nextToken());\n long k = Long.parseLong(st.nextToken());\n if(k > n){\n out.println(0);\n out.close();\n System.exit(0);\n }\n k = n-k;\n long ans = 0L;\n for(int i = 0; i <= k; i++){\n long curr = (ncr((int)k, i)*(pow(k-i, n, MOD)))%MOD;\n if(i % 2 == 0) ans+=curr;\n else ans-=curr;\n ans%=MOD;\n ans+=MOD;\n ans%=MOD;\n }\n ans*=(ncr((int)n, (int)k));\n ans%=MOD;\n if(n-k == 0) out.println(ans);\n else out.println((2*ans)%MOD);\n\n\n out.close();\n }\n public static long ncr(int n, int r){\n return (((fact[n]*invfact[r])%MOD)*invfact[n-r])%MOD;\n }\n\n public static long pow(long x, long y, long p){\n long res = 1L;\n\n while(y > 0){\n if(y % 2 != 0){\n res = (res*x)%p;\n }\n x = (x*x)%p;\n y/=2;\n }\n return res % p;\n\n\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "ff564fc921f20e088c25c74d8f0cf65b", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*; \npublic class PIEFLAVORED{\nprivate static final long mod = 998244353;\n public static void main(String[] args) \n {\n Scanner ray = new Scanner(System.in);\n int n = ray.nextInt();\n long kk = ray.nextLong();\n if(kk >= n)\n {\n System.out.println(\"0\");\n }\n else\n {\n int k = (int)(kk);\n int r = n - k;\n long[] rChoose = new long[r+1];\n rChoose[0] = (long)(1);\n long numChoose = 1;\n long denomChoose = 1;\n for(int i = 1; i <= r; i++)\n {\n numChoose = (numChoose*(r+1-i)) % mod;\n denomChoose = (denomChoose*i) % mod;\n rChoose[i] = (numChoose*power(denomChoose, mod-2)) % mod;\n }\n long ans = 0;\n long flipper = 1;\n for(int i = 0; i <= r; i++) //PIE\n {\n ans += power((long)(r-i), (long)(n))*flipper*rChoose[i];\n ans = ans % mod;\n flipper = -flipper;\n }\n ans = ans * choose((long)(n), (long)(k));\n ans = ans % mod;\n if(k > 0)\n {\n ans = ans*2;\n }\n ans = ans % mod;\n if(ans < 0)\n {\n ans += mod;\n }\n System.out.println(\"\"+ans);\n }\n }\npublic static long choose(long n, long k) \n { \n long num = 1;\n long denom = 1;\n for(int i = (int)(n-k+1); i <= n; i++)\n {\n num = (num*i) % mod;\n } \n for(int i = 1; i <= k; i++)\n {\n denom = (denom*i) % mod;\n } \n denom = power(denom, mod-2) % mod;\n return (num*denom) % mod;\n } \npublic static long power(long x, long y) \n{ \n long res = 1; \n x = x % mod;\n while (y > 0) \n { \n \n if (y % 2 == 1) \n { res = res*x; \n res = res % mod;}\n \n y = y>>1; \n x = x*x; \n x = x % mod; \n } \n return res; \n}\n}\n\n", "lang_cluster": "Java", "tags": ["math", "combinatorics", "fft"], "code_uid": "b45b3d3a4bc31005e149386a8e6da3e4", "src_uid": "6c1a9aaa7bdd7de97220b8c6d35740cc", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": " import java.io.*;\nimport java.util.*;\n\npublic class Kraskevich {\n\tFastScanner in;\n\tPrintWriter out;\n\tvoid solve() {\n\tint n = in.nextInt();\n\tchar[] s = in.next().toCharArray();\n\tboolean ok = false;\n\tfor(int step = 1; step <= n; step++){\n\t//int j = i;\n\t //f = false;\n\tfor(int start =0 ; start + 4 * step < n; start++){\t\n\tif (s[start] == '*' && s[start + step]=='*'\n\t\t \t&& s[start + 2 * step]=='*'&& s[start + 3 * step]=='*'&& s[start + 4* step]=='*')\n\t{\n\t System.out.println(\"yes\");\n\t\tout.close();\n\t}\n\t}\n\t}\t\n System.out.println(\"no\");\t\n\t\n\t\n\t}\n\t\n\n\tvoid run() {\n\t\ttry {\n\t\t\tin = new FastScanner(new File(\"B.in\"));\n\t\t\tout = new PrintWriter(new File(\"B.out\"));\n\n\t\t\tsolve();\n\n\t\t\tout.close();\n\t\t} catch (FileNotFoundException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}\n\n\tvoid runIO() {\n\n\t\tin = new FastScanner(System.in);\n\t\tout = new PrintWriter(System.out);\n\n\t\tsolve();\n\n\t\tout.close();\n\t}\n\n\tclass FastScanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tpublic FastScanner(File f) {\n\t\t\ttry {\n\t\t\t\tbr = new BufferedReader(new FileReader(f));\n\t\t\t} catch (FileNotFoundException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\n\t\tpublic FastScanner(InputStream f) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(f));\n\t\t}\n\n\t\tString next() {\n\t\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\t\tString s = null;\n\t\t\t\ttry {\n\t\t\t\t\ts = br.readLine();\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t\tif (s == null)\n\t\t\t\t\treturn null;\n\t\t\t\tst = new StringTokenizer(s);\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tboolean hasMoreTokens() {\n\t\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\t\tString s = null;\n\t\t\t\ttry {\n\t\t\t\t\ts = br.readLine();\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t\tif (s == null)\n\t\t\t\t\treturn false;\n\t\t\t\tst = new StringTokenizer(s);\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Kraskevich().runIO();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "38c4691467a0f8543cace43aa59dca92", "src_uid": "12d451eb1b401a8f426287c4c6909e4b", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class TaskA extends Thread {\n public TaskA(int what) {\n try {\n if (what == 0) {\n this.input = new BufferedReader(new InputStreamReader(System.in));\n this.output = new PrintWriter(System.out);\n } else {\n this.input = new BufferedReader(new FileReader(INPUT_FILE));\n this.output = new PrintWriter(OUTPUT_FILE);\n }\n } catch (Throwable e) {\n e.printStackTrace();\n System.exit(666);\n }\n }\n\n\n boolean check(int []x, int []y) {\n int square = (x[0] - x[2]) * (y[1] - y[2]) + (x[1] - x[2]) * (y[2] - y[0]);\n square *= square;\n if (square == 0) {\n return false;\n }\n //s = a * b / 2 => s ^ 2 = (ab) ^ 2 / 4\n int dist01 = (x[0] - x[1]) * (x[0] - x[1]) + (y[0] - y[1]) * (y[0] - y[1]),\n dist12 = (x[2] - x[1]) * (x[2] - x[1]) + (y[2] - y[1]) * (y[2] - y[1]),\n dist02 = (x[0] - x[2]) * (x[0] - x[2]) + (y[0] - y[2]) * (y[0] - y[2]);\n if (Math.min(Math.min(dist01, dist02), dist12) == 0) {\n return false;\n }\n if (dist01 * dist02 == square) {\n return true;\n }\n if (dist01 * dist12 == square) {\n return true;\n }\n if (dist02 * dist12 == square) {\n return true;\n }\n return false;\n }\n\n\n\n private void solve() throws Throwable {\n int []x = new int[3];\n int []y = new int[3];\n for (int i = 0; i < 3; ++i) {\n x[i] = nextInt();\n y[i] = nextInt();\n }\n int []dx = {-1, 0, 1, 0}, dy = {0, 1, 0, -1};\n if (check(x, y)) {\n output.println(\"RIGHT\");\n } else {\n for (int i = 0; i < 3; ++i) {\n for (int j = 0; j < dx.length; ++j) {\n x[i] += dx[j];\n y[i] += dy[j];\n if (check(x, y)) {\n output.println(\"ALMOST\");\n return;\n }\n x[i] -= dx[j];\n y[i] -= dy[j];\n }\n }\n output.println(\"NEITHER\");\n }\n\n }\n\n public void run() {\n try {\n solve();\n } catch (Throwable e) {\n e.printStackTrace();\n System.exit(666);\n } finally {\n output.flush();\n output.close();\n }\n }\n\n\n public static void main(String... args) {\n new TaskA(0).start();\n }\n\n private String nextToken() throws IOException {\n while (tokens == null || !tokens.hasMoreTokens()) {\n tokens = new StringTokenizer(input.readLine());\n }\n return tokens.nextToken();\n }\n\n private int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n private double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n private long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n private String INPUT_FILE = null;\n private String OUTPUT_FILE = null;\n private BufferedReader input;\n private PrintWriter output;\n private StringTokenizer tokens = null;\n}", "lang_cluster": "Java", "tags": ["brute force", "geometry"], "code_uid": "0ab126214f6f58c77e9456141d8e0fa7", "src_uid": "8324fa542297c21bda1a4aed0bd45a2d", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\r\nimport java.text.DecimalFormat;\r\nimport java.util.*;\r\n\r\npublic class Main {\r\n\r\n public static final DecimalFormat DF_3 = new DecimalFormat(\"0.000\");\r\n private static final long MOD = 1000000007;\r\n\r\n\r\n static int[] readArray(int size, InputReader in, boolean subOne) {\r\n int[] a = new int[size];\r\n for (int i = 0; i < size; i++) {\r\n a[i] = in.nextInt() + (subOne ? -1 : 0);\r\n }\r\n return a;\r\n }\r\n\r\n static long[] readLongArray(int size, InputReader in) {\r\n long[] a = new long[size];\r\n for (int i = 0; i < size; i++) {\r\n a[i] = in.nextLong();\r\n }\r\n return a;\r\n }\r\n\r\n static void sortArray(int[] a) {\r\n Random random = new Random();\r\n\r\n for (int i = 0; i < a.length; i++) {\r\n int randomPos = random.nextInt(a.length);\r\n int t = a[i];\r\n a[i] = a[randomPos];\r\n a[randomPos] = t;\r\n }\r\n Arrays.sort(a);\r\n }\r\n\r\n private static long[] allInvs(int n, long mod) {\r\n long[] inv = new long[n + 1];\r\n inv[1] = 1;\r\n for (int i = 2; i <= n; ++i) {\r\n inv[i] = subMod(mod, (mod / i) * inv[(int) (mod % i)] % mod, mod);\r\n }\r\n return inv;\r\n\r\n }\r\n\r\n private static long subMod(long x, long y, long mod) {\r\n long res = x - y;\r\n if (res < 0) {\r\n return res + mod;\r\n }\r\n return res;\r\n }\r\n\r\n private static long fastPow(long x, long y, long mod) {\r\n if (x == 1) {\r\n return 1;\r\n }\r\n if (y == 0) {\r\n return 1;\r\n }\r\n long p = fastPow(x, y / 2, mod) % mod;\r\n p = p * p % mod;\r\n if (y % 2 == 1) {\r\n p = p * x % mod;\r\n }\r\n return p;\r\n }\r\n\r\n public static void main(String[] args) throws FileNotFoundException {\r\n// InputReader in = new InputReader(new FileInputStream(\"input.txt\"));\r\n// PrintWriter out = new PrintWriter(new BufferedOutputStream(new FileOutputStream(\"milkvisits.out\")));\r\n//\r\n InputReader in = new InputReader(System.in);\r\n PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));\r\n\r\n// long start = System.currentTimeMillis();\r\n int n = in.nextInt();\r\n long mod = in.nextLong();\r\n long[] invs = allInvs(n + 3, mod);\r\n long[] facts = new long[n + 2];\r\n facts[0] = 1;\r\n long[] invFacts = new long[n + 2];\r\n invFacts[0] = 1;\r\n for (int i = 1; i < n + 2; i++) {\r\n facts[i] = (facts[i - 1] * i) % mod;\r\n invFacts[i] = (invFacts[i - 1] * invs[i]) % mod;\r\n }\r\n long[] pow2 = new long[n+3];\r\n pow2[0] = 1;\r\n for (int i = 1; i < n+3; i++) {\r\n pow2[i] = pow2[i-1] * 2 % mod;\r\n }\r\n\r\n long[][] dp = new long[n + 2][n + 2];\r\n for (int i = 2; i <= n + 1; i++) {\r\n dp[i][1] = invFacts[i - 1] * pow2[i - 2] % mod;\r\n for (int k = 2; k <= n; k++) {\r\n for (int j = i - 2; j >= 1; j--) {\r\n dp[i][k] = (dp[i][k] + dp[j][k - 1] * pow2[ i - j - 2] % mod * invFacts[i - j - 1] % mod) % mod;\r\n }\r\n }\r\n }\r\n\r\n long ans = 0;\r\n for (int k = 1; k <= n; k++) {\r\n\r\n ans = (ans + dp[n + 1][k] * facts[n - k + 1] % mod) % mod;\r\n }\r\n out.println(ans);\r\n\r\n out.close();\r\n }\r\n\r\n private static void outputArray(List<Long> ans, PrintWriter out, boolean addOne) {\r\n StringBuilder str = new StringBuilder();\r\n for (int j = 0; j < ans.size(); j++) {\r\n long i = ans.get(j);\r\n long an = i + (addOne ? 1 : 0);\r\n str.append(an);\r\n if (j < ans.size() - 1) {\r\n str.append(' ');\r\n }\r\n }\r\n out.println(str);\r\n// out.flush();\r\n }\r\n\r\n private static class InputReader {\r\n public BufferedReader reader;\r\n public StringTokenizer tokenizer;\r\n\r\n public InputReader(InputStream stream) {\r\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\r\n tokenizer = null;\r\n }\r\n\r\n public String next() {\r\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\r\n try {\r\n tokenizer = new StringTokenizer(reader.readLine());\r\n } catch (IOException e) {\r\n throw new RuntimeException(e);\r\n }\r\n }\r\n return tokenizer.nextToken();\r\n }\r\n\r\n public String nextString() {\r\n try {\r\n return reader.readLine();\r\n } catch (IOException e) {\r\n throw new RuntimeException(e);\r\n }\r\n }\r\n\r\n public int nextInt() {\r\n return Integer.parseInt(next());\r\n }\r\n\r\n public long nextLong() {\r\n return Long.parseLong(next());\r\n }\r\n\r\n public double nextDouble() {\r\n return Double.parseDouble(next());\r\n }\r\n\r\n public char nextChar() {\r\n return next().charAt(0);\r\n }\r\n\r\n public String nextWord() {\r\n return next();\r\n }\r\n\r\n private List<Integer>[] readTree(int n) {\r\n return readGraph(n, n - 1);\r\n }\r\n\r\n private List<Integer>[] readGraph(int n, int m) {\r\n List<Integer>[] result = new ArrayList[n];\r\n for (int i = 0; i < n; i++) {\r\n result[i] = new ArrayList<>();\r\n }\r\n for (int i = 0; i < m; i++) {\r\n int u = nextInt() - 1;\r\n int v = nextInt() - 1;\r\n result[u].add(v);\r\n result[v].add(u);\r\n }\r\n return result;\r\n }\r\n\r\n }\r\n}", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics"], "code_uid": "a53e4edcfe181a332468bcde14c0f3d8", "src_uid": "4f0e0d1deef0761a46b64de3eb98e774", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\npublic class A\n{\n public static void main(String args[])\n {\n Scanner sc=new Scanner(System.in);\n int n=sc.nextInt();\n int m=sc.nextInt();\n int count=0,flag=0;\n if(n==m)\n System.out.println(0);\n else\n {\n while(m!=n)\n {\n if(m%(n*2)==0)\n {\n count++;\n n=n*2;\n }\n else if(m%(n*3)==0)\n {\n count++;\n n=n*3;\n }\n else\n {\n flag=1;\n break;\n }\n }\n if(flag==1)\n System.out.println(-1);\n else\n System.out.println(count);\n }\n }\n}", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "872ab8ad4620f1544556e4c4f64ced5b", "src_uid": "3f9980ad292185f63a80bce10705e806", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\nimport java.lang.*;\n\npublic class Main {\n private static FastReader sc = new FastReader(System.in);\n private static OutputWriter out = new OutputWriter(System.out);\n\n public static void main(String[] args) {\n int n = sc.nextInt();\n int k = sc.nextInt();\n int m = sc.nextInt();\n int a = sc.nextInt();\n\n int[] votes = new int[n];\n int[] lastTime = new int[n];\n Arrays.fill(lastTime, -1);\n Vote[] voteInfo = new Vote[n];\n\n int[] arr = new int[a];\n for (int i = 0; i < a; i++) {\n arr[i] = sc.nextInt() - 1;\n votes[arr[i]]++;\n lastTime[arr[i]] = i;\n }\n\n for (int i = 0; i < n; i++) {\n voteInfo[i] = new Vote(votes[i], lastTime[i], i);\n }\n Arrays.sort(voteInfo);\n\n int[] ans = new int[n];\n\n if (m == a) {\n for (int i = 0; i < n; i++) {\n if (i < k && voteInfo[i].votes > 0) ans[voteInfo[i].idx] = 1;\n else ans[voteInfo[i].idx] = 3;\n }\n\n for (int i : ans) System.out.print(i + \" \");\n System.exit(0);\n }\n\n for (int i = 0; i < n; i++) {\n int curr = votes[i] + (m - a);\n int more = 0;\n for (int j = 0; j < n; j++) {\n if (j != i && votes[j] >= curr) more++;\n }\n if (more >= k || curr == 0) {\n ans[i] = 3;\n continue;\n }\n\n int minNeeded = 0;\n curr = votes[i];\n HashSet<Integer> need = new HashSet<>();\n boolean bool = false;\n\n for (int j = 0; j <= Math.min(n - 1, k); j++) {\n if (voteInfo[j].idx == i) {\n bool = true;\n continue;\n }\n if (!bool && j == k) break;\n if (voteInfo[j].votes == curr && (voteInfo[j].lastTime > lastTime[i] || voteInfo[j].votes == 0)) {\n minNeeded++;\n } else if (voteInfo[j].votes < curr) {\n minNeeded += (curr - voteInfo[j].votes + 1);\n }\n need.add(j);\n }\n\n if (votes[i] > 0 && (minNeeded > m - a || need.size() < k)) {\n ans[i] = 1;\n } else {\n ans[i] = 2;\n }\n }\n\n for (int i : ans) out.print(i + \" \");\n out.close();\n }\n}\n\nclass Vote implements Comparable<Vote> {\n int votes, lastTime, idx;\n\n public Vote(int a, int b, int c) {\n votes = a;\n lastTime = b;\n idx = c;\n }\n\n public int compareTo(Vote that) {\n if (this.votes > that.votes) return -1;\n if (this.votes < that.votes) return +1;\n if (this.lastTime > that.lastTime) return +1;\n return -1;\n }\n}\n\nclass FastReader {\n private boolean finished = false;\n\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private SpaceCharFilter filter;\n\n public FastReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n\n return buf[curChar++];\n }\n\n public int peek() {\n if (numChars == -1) {\n return -1;\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n return -1;\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar];\n }\n\n public int nextInt() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c == ',') {\n c = read();\n }\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public long nextLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public String nextString() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n private String readLine0() {\n StringBuilder buf = new StringBuilder();\n int c = read();\n while (c != '\\n' && c != -1) {\n if (c != '\\r') {\n buf.appendCodePoint(c);\n }\n c = read();\n }\n return buf.toString();\n }\n\n public String nextLine() {\n String s = readLine0();\n while (s.trim().length() == 0)\n s = readLine0();\n return s;\n }\n\n public String nextLine(boolean ignoreEmptyLines) {\n if (ignoreEmptyLines) {\n return nextLine();\n } else {\n return readLine0();\n }\n }\n\n public BigInteger nextBigInteger() {\n try {\n return new BigInteger(nextString());\n } catch (NumberFormatException e) {\n throw new InputMismatchException();\n }\n }\n\n public char nextCharacter() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n return (char) c;\n }\n\n public double nextDouble() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E') {\n return res * Math.pow(10, nextInt());\n }\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E') {\n return res * Math.pow(10, nextInt());\n }\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n\n public boolean isExhausted() {\n int value;\n while (isSpaceChar(value = peek()) && value != -1)\n read();\n return value == -1;\n }\n\n public String next() {\n return nextString();\n }\n\n public SpaceCharFilter getFilter() {\n return filter;\n }\n\n public void setFilter(SpaceCharFilter filter) {\n this.filter = filter;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n}\n\nclass OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void print(Object... objects) {\n for (int i = 0; i < objects.length; i++) {\n if (i != 0)\n writer.print(' ');\n writer.print(objects[i]);\n }\n }\n\n public void printLine(Object... objects) {\n print(objects);\n writer.println();\n }\n\n public void close() {\n writer.close();\n }\n\n public void flush() {\n writer.flush();\n }\n\n}", "lang_cluster": "Java", "tags": ["sortings", "greedy"], "code_uid": "16e555bf11b2c462050e8df0ce742042", "src_uid": "81a890bd542963bbcec7a041dde5c247", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*; //PrintWriter\nimport java.math.*; //BigInteger, BigDecimal\nimport java.util.*; //StringTokenizer, ArrayList\n\n\npublic class R285_Div2_A\n{\t\n\tFastReader in;\n\tPrintWriter out;\n\t\n\tpublic static void main(String[] args) {\n\t\tnew R285_Div2_A().run();\n\t}\n\t\n\tvoid run()\n\t{\t\t\n\t\tin = new FastReader(System.in);\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.close();\n\t}\n\t\n\tvoid solve()\n\t{\n\t\tint a = in.nextInt();\n\t\tint b = in.nextInt();\n\t\tint c = in.nextInt();\n\t\tint d = in.nextInt();\n\t\t\n\t\tint m = score(a,c);\n\t\tint v = score(b,d);\n\t\t\n\t\tif (m > v)\n\t\t\tout.println(\"Misha\");\n\t\telse if (m < v) \n\t\t\tout.println (\"Vasya\");\n\t\telse\n\t\t\tout.println(\"Tie\");\t\n\t}\n\t\n\tint score(int p, int t)\n\t{\n\t\treturn Math.max(3*p/10, p - p/250*t);\n\t}\n\n\t//-----------------------------------------------------\n\tvoid runWithFiles() {\n\t\tin = new FastReader(new File(\"input.txt\"));\n\t\ttry {\n\t\t\tout = new PrintWriter(new File(\"output.txt\"));\n\t\t} \n\t\tcatch (FileNotFoundException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t\tsolve();\n\t\tout.close();\n\t}\n\t\n\tclass FastReader\n\t{\n\t BufferedReader br;\n\t StringTokenizer tokenizer;\n\t \n\t public FastReader(InputStream stream)\n\t {\n\t br = new BufferedReader(new InputStreamReader(stream));\n\t tokenizer = null;\n\t }\n\t\tpublic FastReader(File f) {\n\t\t\ttry {\n\t\t\t\tbr = new BufferedReader(new FileReader(f));\n\t\t\t\ttokenizer = null;\n\t\t\t}\n\t\t\tcatch (FileNotFoundException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\t \n\t private String next() {\n\t while (tokenizer == null || !tokenizer.hasMoreTokens())\n\t try {\n\t \ttokenizer = new StringTokenizer(br.readLine());\n\t }\n\t catch (IOException e) {\n\t throw new RuntimeException(e);\n\t }\n\t return tokenizer.nextToken();\n\t }\n\t\tpublic String nextLine() {\n\t\t\ttry\t{\n\t\t\t\treturn br.readLine();\n\t\t\t}\n\t\t\tcatch(Exception e) {\n\t\t\t\tthrow(new RuntimeException());\n\t\t\t}\n\t\t}\n\n\t int nextInt() {\n\t return Integer.parseInt(next());\n\t }\n\t long nextLong() {\n\t return Long.parseLong(next());\n\t }\n\t double nextDouble() {\n\t return Double.parseDouble(next());\n\t }\t \n\t BigInteger nextBigInteger() {\n\t return new BigInteger(next());\n\t }\n\t BigDecimal nextBigDecimal() {\n\t return new BigDecimal(next());\n\t }\n\t}\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "17640f8487c0f75490890d34457e702a", "src_uid": "95b19d7569d6b70bd97d46a8541060d0", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\nimport java.lang.*;\nimport java.io.*;\nimport java.io.BufferedReader; \nimport java.io.IOException; \nimport java.io.InputStreamReader; \nimport java.util.Scanner; \nimport java.util.StringTokenizer; \n \n/* Name of the class has to be \"Main\" only if the class is public. */\npublic class Codechef\n{\n\tpublic static void main (String[] args) throws java.lang.Exception\n\t{\n\t Scanner sc=new Scanner(System.in);\n\t \n// int t=sc.nextInt();\n// while(t-->0)\n// {\n int n=sc.nextInt();\n System.out.println(pow(1378,n));\n \n \n// } \n}\npublic static int pow(int a,int n)\n{int res=1;\n while(n>0)\n {\n if(n%2==1)\n {\n res=(res*a)%10;\n n--;\n }\n else\n {\n a=(a*a)%10;\n n=n/2;\n }\n }\n return res;\n}\n} \n", "lang_cluster": "Java", "tags": ["math", "implementation", "number theory"], "code_uid": "5e3bd1ede20ad6a4a382863d47cf9d81", "src_uid": "4b51b99d1dea367bf37dc5ead08ca48f", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.IOException;\nimport java.util.InputMismatchException;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.math.BigInteger;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author bkand1908\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskA solver = new TaskA();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskA {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n long l = in.readInt();\n long r = in.readInt();\n long base = 1;\n while (base <= r) base *= 10;\n long m = base >> 1;\n if (m > r) m = r;\n if (m < l) m = l;\n out.println(m * reflection(m));\n }\n\n private long reflection(long a) {\n StringBuilder s = new StringBuilder();\n while (a > 0) {\n s.insert(0, String.valueOf(9 - a % 10));\n a /= 10;\n }\n return Long.parseLong(s.toString());\n }\n}\n\nclass InputReader {\n\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n private boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n }\n\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "39297980e6dfa5017fcf3ac74edc9381", "src_uid": "2c4b2a162563242cb2f43f6209b59d5e", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "/*\n * To change this template, choose Tools | Templates\n * and open the template in the editor.\n */\n\n\nimport java.util.* ;\nimport java.io.* ;\nimport java.math.* ;\n/************************\n * *\n * Lord Klotski *\n * *\n ***********************/\npublic class CodeForces_2011_Jan13_A\n{\n public static void main(String[] args)\n {\n Scanner input = new Scanner(System.in) ;\n //int K = input.nextInt() ;\n /*for (int K = 1 ; K <= 50 ; K ++)\n {\n boolean[] a = new boolean[K] ;\n int place = 0 ;\n for (int i = 1 ; i < 100000 ; i ++)\n {\n place += (i-1) ; place %= K ; a[place] = true ;\n }\n boolean fail = false ;\n for (int i = 0 ; i < K ; i ++) if (a[i] == false) fail = true ;\n System.out.println(K + \" \" + (fail ? \"NO\" : \"YES\"));\n }*/\n\n\n int K = input.nextInt() ;\n boolean[] twoPow = new boolean[1001] ; twoPow[0] = true ; int x = 1 ;\n while( x <= 1000)\n {\n twoPow[x] = true ; x *= 2 ;\n }\n System.out.println(twoPow[K] ? \"YES\" : \"NO\");\n\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "de0152a39867b47e2d846eb67050179c", "src_uid": "4bd174a997707ed3a368bd0f2424590f", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n/**\n * \n10%1=1\n10%11 = 10\n\n\n21%8 = 5\n21%16 = 5\n\n21%8 = 5\n21%16 = 5\n\n21%6 = 3\n21%9 = 3\n21%18 = 3 \n\n\n24 3\n24%21 = 3\n24%7 = 3\n\n33 1\n\n43 i*i = i->6\n\n43%2 = 1\n43%3 = 1\n43%6 = 1\n43%7 = 1\n43%12 = 1\n43%21 = 1\n43%4\n\n**/\n\npublic class B_Div2_282 {\n public static void main(String[]arg) throws IOException\n {\n BufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st = new StringTokenizer(in.readLine());\n \n long a = Long.parseLong(st.nextToken());\n long b = Long.parseLong(st.nextToken());\n if(a == b)\n System.out.println(\"infinity\");\n else if(b > a)\n {\n System.out.println(0);\n }\n else\n {\n long rest = a - b;\n int ans = 0;\n for(long i = 1; i*i <= rest; i++)\n {\n if(rest%i == 0)\n {\n if(a%i == b)\n ans++;\n /*\n Para no agregar dos veces debido a que (rest/i) = i\n por eso i != a/i\n */\n \n if(a%(rest/i) == b && i != a/i)\n ans++;\n }\n }\n System.out.println(ans);\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "57101a4cc7d8decb9f14c3860e057b57", "src_uid": "6e0715f9239787e085b294139abb2475", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class EMain {\n String noResultMessage = \"NoResult\";\n Parser in = new Parser();\n PrintWriter out;\n\n long n = in.nextLong();\n int k = in.nextInteger();\n\n\n Matrix[] upRow(Matrix[] row){\n Matrix[] suffix = new Matrix[k];\n suffix[0] = Matrix.oneMatrix(k+1);\n for(int i = 1; i < k; ++i){\n suffix[i] = Matrix.mul(suffix[i-1], row[i-1]);\n }\n Matrix[] prefix = new Matrix[k];\n prefix[k-1] = row[k-1];\n for(int i = k-2; i>=0; --i){\n prefix[i] = Matrix.mul(row[i], prefix[i+1]);\n }\n Matrix[] result = new Matrix[k];\n for(int i = 0; i < k; ++i){\n result[i] = Matrix.mul(prefix[i], suffix[i]);\n }\n return result;\n }\n\n public void solve() {\n\n Matrix[][] matrixes = new Matrix[100][k];\n\n for(int i = 0; i < k; ++i){\n Matrix m = Matrix.oneMatrix(k + 1);\n matrixes[0][i] = m;\n for(int j = 0; j <= k; ++j){\n m.set(j, i, 1);\n }\n }\n int[] digits = new int[100];\n int index = 0;\n long limit = n;\n digits[index++] = (int) (limit % k);\n for(int row = 1; row < 100; ++row){\n limit /= k;\n if(limit == 0)break;\n digits[index++] = (int) (limit % k);\n matrixes[row] = upRow(matrixes[row-1]);\n }\n\n Matrix result = Matrix.oneMatrix(k+1);\n int pos = 0;\n while(index-- > 0){\n while(digits[index]-- > 0){\n result = Matrix.mul(result, matrixes[index][pos++]);\n pos %= k;\n }\n }\n Vector vec = new Vector(k+1);\n vec.set(k, 1);\n out.println(Vector.mul(vec, result).sum());\n\n\n }\n\n static int MOD = (int) (1e9+7);\n\n static public class Matrix {\n int[][] data;\n\n public Matrix(int size) {\n this.data = new int[size][size];\n }\n\n Matrix(Matrix other) {\n int size = other.data.length;\n this.data = new int[size][];\n for(int i = 0; i < size; ++i){\n this.data[i] = Arrays.copyOf(other.data[i], size);\n }\n }\n public void set(int row, int column, int value){\n data[row][column] = value;\n }\n\n public static Matrix oneMatrix(int size){\n Matrix result = new Matrix(size);\n for(int i = 0; i < size; ++i){\n result.data[i][i] = 1;\n }\n return result;\n }\n\n public static Matrix mul(Matrix left, Matrix right){\n int size = left.data.length;\n assert size == right.data.length;\n Matrix result = new Matrix(size);\n for(int i = 0; i < size; ++i){\n for(int j = 0; j < size; ++j){\n int val = 0;\n for(int k = 0; k < size; ++k){\n val += 1l * left.data[i][k] * right.data[k][j] % MOD;\n val %= MOD;\n val += MOD;\n val %= MOD;\n }\n result.data[i][j] = val;\n }\n }\n return result;\n }\n\n static Matrix degree(Matrix matrix, long degree){\n Matrix result = Matrix.oneMatrix(matrix.data.length);\n while(degree > 0){\n if((degree & 1) == 1){\n result = Matrix.mul(result, matrix);\n }\n result = Matrix.mul(result, result);\n degree >>= 1;\n }\n return result;\n }\n }\n\n static public class Vector{\n int[] data;\n\n public Vector(int size) {\n this.data = new int[size];\n }\n\n Vector(Vector other) {\n this.data = Arrays.copyOf(other.data, other.data.length);\n }\n\n public void set(int pos, int val){\n data[pos] = val;\n }\n\n int get(int pos){\n return data[pos];\n }\n\n public int sum(){\n long sum = 0;\n for(int i : data){\n sum += i;\n }\n sum %= MOD;\n sum += MOD;\n sum %= MOD;\n return (int) sum;\n }\n\n public static Vector mul(Vector vec, Matrix matrix){\n int size = vec.data.length;\n assert size == matrix.data.length;\n Vector result = new Vector(size);\n for(int i = 0; i < size; ++i){\n int val = 0;\n for(int j = 0; j < size; ++j){\n val += 1l * vec.data[j] * matrix.data[j][i] % MOD;\n val += MOD;\n val %= MOD;\n }\n result.data[i] = val;\n }\n return result;\n }\n }\n\n static public class Parser{\n Scanner scanner;\n\n public Parser() {\n scanner = new Scanner(System.in).useLocale(Locale.ENGLISH);\n }\n\n public Parser(String str) {\n scanner = new Scanner(str).useLocale(Locale.ENGLISH);\n }\n\n long nextLong(){\n return scanner.nextLong();\n }\n\n int nextInteger(){\n return scanner.nextInt();\n }\n\n double nextDouble(){\n return scanner.nextDouble();\n }\n\n String nextLine(){\n return scanner.nextLine();\n }\n\n String next(){\n return scanner.next();\n }\n\n int[] nextIntegers(int count){\n int[] result = new int[count];\n for(int i = 0; i < count; ++i){\n result[i] = nextInteger();\n }\n return result;\n }\n\n long[] nextLongs(int count){\n long[] result = new long[count];\n for(int i = 0; i < count; ++i){\n result[i] = nextLong();\n }\n return result;\n }\n\n int[][] nextIntegers(int fields, int count){\n int[][] result = new int[fields][count];\n for(int c = 0; c < count; ++c){\n for(int i = 0; i < fields; ++i){\n result[i][c] = nextInteger();\n }\n }\n return result;\n }\n }\n\n void noResult(){\n throw new NoResultException();\n }\n\n void noResult(String str){\n throw new NoResultException(str);\n }\n\n void run(){\n try{\n ByteArrayOutputStream outStream = new ByteArrayOutputStream();\n out = new PrintWriter(outStream);\n solve();\n out.close();\n System.out.print(outStream.toString());\n } catch (NoResultException exc){\n System.out.print(null == exc.response ? noResultMessage : exc.response);\n }\n }\n\n public static void main(String[] args) {\n new EMain().run();\n }\n\n public static class NoResultException extends RuntimeException{\n private String response;\n\n public NoResultException(String response) {\n this.response = response;\n }\n\n public NoResultException() {\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["matrices", "dp"], "code_uid": "f98e25b2230e2ea65578068623cde04a", "src_uid": "175ce134da7cc5af9c8457e7bd9a40a2", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "// practice with kaiboy\nimport java.io.*;\nimport java.util.*;\n\npublic class CF42B extends PrintWriter {\n\tCF42B() { super(System.out, true); }\n\tScanner sc = new Scanner(System.in);\n\tpublic static void main(String[] $) {\n\t\tCF42B o = new CF42B(); o.main(); o.flush();\n\t}\n\n\tboolean rcheck(int ir, int jr, int ik, int jk, int i, int j) {\n\t\tif (ir == i && jr == j)\n\t\t\treturn false;\n\t\tif (ir == i)\n\t\t\treturn ik != i || jk < Math.min(jr, j) || jk > Math.max(jr, j);\n\t\tif (jr == j)\n\t\t\treturn jk != j || ik < Math.min(ir, i) || ik > Math.max(ir, i);\n\t\treturn false;\n\t}\n\tboolean kcheck(int ik, int jk, int i, int j) {\n\t\treturn Math.max(Math.abs(ik - i), Math.abs(jk - j)) == 1;\n\t}\n\tvoid main() {\n\t\tString r1 = sc.next();\n\t\tString r2 = sc.next();\n\t\tString k1 = sc.next();\n\t\tString k2 = sc.next();\n\t\tint ir1 = r1.charAt(0) - 'a';\n\t\tint jr1 = r1.charAt(1) - '1';\n\t\tint ir2 = r2.charAt(0) - 'a';\n\t\tint jr2 = r2.charAt(1) - '1';\n\t\tint ik1 = k1.charAt(0) - 'a';\n\t\tint jk1 = k1.charAt(1) - '1';\n\t\tint ik2 = k2.charAt(0) - 'a';\n\t\tint jk2 = k2.charAt(1) - '1';\n\t\tfor (int di = -1; di <= 1; di++)\n\t\t\tfor (int dj = -1; dj <= 1; dj++) {\n\t\t\t\tint i = ik2 + di;\n\t\t\t\tint j = jk2 + dj;\n\t\t\t\tif (i >= 0 && i < 8 && j >= 0 && j < 8) {\n\t\t\t\t\tif (kcheck(ik1, jk1, i, j))\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tif (rcheck(ir1, jr1, ik1, jk1, i, j))\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tif (rcheck(ir2, jr2, ik1, jk1, i, j))\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tprintln(\"OTHER\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\tprintln(\"CHECKMATE\");\n\t}\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "e8272d4b051c2699f248049d5b77b218", "src_uid": "5d05af36c7ccb0cd26a4ab45966b28a3", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.Scanner;\npublic class Problem811 {\n\tpublic static void main(String[] args){\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint vladik = scanner.nextInt();\n\t\tint vlera = scanner.nextInt();\n\t\tint minues = 1;\n\t\tboolean boo = true;\n\t\t//System.out.println(\"Vladik:\"+vladik+\" Valera:\"+vlera);\n\t\twhile (vladik-minues>0 && vlera-minues>0){\n\t\t\t\n\t\t\tif(boo){\n\t\t\t\t\n\t\t\t\tvladik=vladik-minues;\n\t\t\t\t//System.out.println(\"Vladik: \"+vladik);\n\t\t\t\tminues=minues+1;\n\t\t\t\tboo=false;\n\t\t\t}else{\n\t\t\t\t\n\t\t\t\tvlera=vlera-minues;\n\t\t\t\t//System.out.println(\"Valera: \"+vlera);\n\t\t\t\tminues=minues+1;\n\t\t\t\tboo=true;\n\t\t\t}\t\n\t\t}\n\t\t//System.out.println(\"vladik: \"+vladik+ \" valera: \"+ vlera + \" minues: \"+minues + \" boo: \"+ boo);\n\t\tif((vladik-minues<=0 && vlera-minues<=0 && !boo) ){\n\t\t\tSystem.out.println(\"Vladik\");\n\t\t}\n\t\telse if((vladik-minues<=0 && vlera-minues<=0 && boo)){\n\t\t\tSystem.out.println(\"Valera\");\n\t\t}else if(vladik-minues<=0){\n\t\t\tSystem.out.println(\"Vladik\");\n\t\t}else if(vlera-minues<=0){\n\t\t\tSystem.out.println(\"Valera\");\n\t\t}\n\t\t\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "d3330bd7f870b8473e0d496a64df7154", "src_uid": "87e37a82be7e39e433060fd8cdb03270", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Sanket Makani\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n ProblemA1DeathStarsEasy solver = new ProblemA1DeathStarsEasy();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class ProblemA1DeathStarsEasy {\n public void solve(int testNumber, InputReader sc, PrintWriter w) {\n int n = sc.nextInt();\n\n char map1[][] = new char[n][n];\n char map2[][] = new char[n][n];\n\n for (int i = 0; i < n; i++)\n map1[i] = sc.next().toCharArray();\n for (int i = 0; i < n; i++)\n map2[i] = sc.next().toCharArray();\n int flag = 0;\n\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if (map1[i][j] != map2[i][j])\n flag++;\n }\n }\n\n if (flag == 0) {\n w.println(\"Yes\");\n return;\n }\n\n flag = 0;\n\n\n //90 degree\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if (map1[i][j] != map2[j][n - i - 1])\n flag++;\n }\n }\n\n if (flag == 0) {\n w.println(\"Yes\");\n return;\n }\n\n flag = 0;\n\n //180 degree\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if (map1[i][j] != map2[n - i - 1][n - j - 1])\n flag++;\n }\n }\n\n if (flag == 0) {\n w.println(\"Yes\");\n return;\n }\n\n flag = 0;\n\n //270 degree\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if (map1[i][j] != map2[n - j - 1][i])\n flag++;\n }\n }\n\n if (flag == 0) {\n w.println(\"Yes\");\n return;\n }\n\n flag = 0;\n\n flipVertically(map2);\n\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if (map1[i][j] != map2[i][j])\n flag++;\n }\n }\n\n if (flag == 0) {\n w.println(\"Yes\");\n return;\n }\n\n flag = 0;\n\n\n //90 degree\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if (map1[i][j] != map2[j][n - i - 1])\n flag++;\n }\n }\n\n if (flag == 0) {\n w.println(\"Yes\");\n return;\n }\n\n flag = 0;\n\n //180 degree\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if (map1[i][j] != map2[n - i - 1][n - j - 1])\n flag++;\n }\n }\n\n if (flag == 0) {\n w.println(\"Yes\");\n return;\n }\n\n flag = 0;\n\n //270 degree\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if (map1[i][j] != map2[n - j - 1][i])\n flag++;\n }\n }\n\n if (flag == 0) {\n w.println(\"Yes\");\n return;\n }\n\n flag = 0;\n\n flipVertically(map2);\n\n flipHorizontally(map2);\n\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if (map1[i][j] != map2[i][j])\n flag++;\n }\n }\n\n if (flag == 0) {\n w.println(\"Yes\");\n return;\n }\n\n flag = 0;\n\n\n //90 degree\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if (map1[i][j] != map2[j][n - i - 1])\n flag++;\n }\n }\n\n if (flag == 0) {\n w.println(\"Yes\");\n return;\n }\n\n flag = 0;\n\n //180 degree\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if (map1[i][j] != map2[n - i - 1][n - j - 1])\n flag++;\n }\n }\n\n if (flag == 0) {\n w.println(\"Yes\");\n return;\n }\n\n flag = 0;\n\n //270 degree\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if (map1[i][j] != map2[n - j - 1][i])\n flag++;\n }\n }\n\n if (flag == 0) {\n w.println(\"Yes\");\n return;\n }\n\n w.println(\"No\");\n }\n\n private void flipHorizontally(char[][] map2) {\n int n = map2.length;\n char copy[][] = new char[n][n];\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++)\n copy[i][j] = map2[i][j];\n\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n map2[i][j] = copy[i][n - j - 1];\n }\n }\n }\n\n private void flipVertically(char[][] map2) {\n int n = map2.length;\n char copy[][] = new char[n][n];\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++)\n copy[i][j] = map2[i][j];\n\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n map2[i][j] = copy[n - i - 1][j];\n }\n }\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n int c = read();\n\n while (isSpaceChar(c))\n c = read();\n\n int sgn = 1;\n\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n\n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n\n return res * sgn;\n }\n\n public String readString() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n }\n while (!isSpaceChar(c));\n\n return res.toString();\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public String next() {\n return readString();\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "42bd36868aa46eac58391d71ae8a7ee3", "src_uid": "2e793c9f476d03e8ba7df262db1c06e4", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class Two { \n\tstatic Scanner in = new Scanner(System.in);\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tint a,b,a1,b1,a2,b2;\n\t\tboolean flag=false;\n\t\ta=in.nextInt();\n\t\tb=in.nextInt();\n\t\ta1=in.nextInt();\n\t\tb1=in.nextInt();\n\t\ta2=in.nextInt();\n\t\tb2=in.nextInt();\n\t\t\n\t\twhile(true){\n\t\tif((a>=Math.max(a1,a2))&& b>=Math.max(b1, b2)){\n\t\t\tif(a>=a1+a2)\n\t\t\t\tflag=true;\n\t\t\telse if(b>=b1+b2)\n\t\t\t\tflag=true;\n\t\t}\n\t\tif(flag==true)\n\t\t\tbreak;\n\t\t\n\t\tif((a>=Math.max(a1,b2))&& b>=Math.max(b1, a2)){\n\t\t\tif(a>=a1+b2)\n\t\t\t\tflag=true;\n\t\t\telse if(b>=b1+a2)\n\t\t\t\tflag=true;\n\t\t}\n\t\tif(flag==true)\n\t\t\tbreak;\n\t\t\n\t\tif((a>=Math.max(a2,b1))&& b>=Math.max(a1, b2)){\n\t\t\tif(a>=a2+b1)\n\t\t\t\tflag=true;\n\t\t\telse if(b>=a1+b2)\n\t\t\t\tflag=true;\n\t\t}\n\t\tif(flag==true)\n\t\t\tbreak;\n\t\t\n\t\tif((a>=Math.max(b2,b1))&& b>=Math.max(a2, a1)){\n\t\t\tif(a>=b2+b1)\n\t\t\t\tflag=true;\n\t\t\telse if(b>=a2+a1)\n\t\t\t\tflag=true;\n\t\t}\n\t\t\n\t\tbreak;\n\t\t}\n\t\tif(flag==true)\n\t\tSystem.out.println(\"YES\");\n\t\telse\n\t\t\tSystem.out.println(\"NO\");\n\t\t}\n\t}", "lang_cluster": "Java", "tags": ["constructive algorithms", "implementation"], "code_uid": "be2175e294414cdfc3345bce1c12790b", "src_uid": "2ff30d9c4288390fd7b5b37715638ad9", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// 作者：杨成瑞先生\nimport java.io.*;\nimport java.util.*;\n\npublic class curriculum {\n\n\tstatic class FastScanner {\n\n static final int DEFAULT_BUFF = 1024, EOF = -1, INT_MIN = 48, INT_MAX = 57;\n static final byte NEG = 45;\n static final int[] ints = new int[58];\n\n static {\n int value = 0;\n for (int i = 48; i < 58; i++) {\n ints[i] = value++;\n }\n }\n\n InputStream stream;\n\n byte[] buff;\n int buffPtr;\n\n public FastScanner(InputStream stream) {\n this.stream = stream;\n this.buff = new byte[DEFAULT_BUFF];\n this.buffPtr = -1;\n }\n\n public int nextInt() throws IOException {\n int val = 0;\n int sign = readNonDigits();\n while (isDigit(buff[buffPtr]) && buff[buffPtr] != EOF) {\n val = (val << 3) + (val << 1) + ints[buff[buffPtr]];\n buffPtr++;\n if (buffPtr == buff.length) {\n updateBuff();\n }\n }\n return val*sign;\n }\n\n private int readNonDigits() throws IOException {\n if (buffPtr == -1 || buffPtr == buff.length) {\n updateBuff();\n }\n if (buff[buffPtr] == EOF) {\n throw new IOException(\"End of stream reached\");\n }\n int signByte = -1;\n while (!isDigit(buff[buffPtr])) {\n signByte = buff[buffPtr];\n buffPtr++;\n if (buffPtr >= buff.length) {\n updateBuff();\n }\n if (buff[buffPtr] == EOF) {\n throw new IOException(\"End of stream reached\");\n }\n }\n if(signByte == NEG) return -1;\n return 1;\n }\n\n public void close() throws IOException {\n stream.close();\n }\n\n private boolean isDigit(int b) {\n return b >= INT_MIN && b <= INT_MAX;\n }\n\n private void updateBuff() throws IOException {\n buffPtr = 0;\n stream.read(buff);\n }\n }\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tFastScanner sc = new FastScanner(System.in);\n int n = sc.nextInt();\n int[] games = new int[n];\n for(int i=0;i<n;i++) {\n games[i] = sc.nextInt();\n }\n int max = 0;\n for(int i=0;i<=n;i++) {\n int current = 0;\n for(int j=0;j<i;j++) {\n if(games[j] == 0) {\n current++;\n }\n }\n for(int k=i;k<n;k++) {\n if(games[k] == 1) {\n current++;\n }\n }\n max = Math.max(max, current);\n }\n System.out.println(max);\n\t}\n\n}\n\n// 6\n// 0 1 0 0 1 0", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "195627a3f070a5db2766b74e0497afe1", "src_uid": "c7b1f0b40e310f99936d1c33e4816b95", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\npublic class loser\n{\n static class InputReader {\n public BufferedReader br;\n public StringTokenizer token;\n public InputReader(InputStream stream)\n {\n br=new BufferedReader(new InputStreamReader(stream),32768);\n token=null;\n }\n\n public String next()\n {\n while(token==null || !token.hasMoreTokens())\n {\n try\n {\n token=new StringTokenizer(br.readLine());\n }\n catch(IOException e)\n {\n throw new RuntimeException(e);\n }\n }\n return token.nextToken();\n }\n\n public int nextInt()\n {\n return Integer.parseInt(next());\n }\n\n public long nextLong()\n {\n return Long.parseLong(next());\n }\n }\n static class card{\n int l;\n int r;\n public card(int ch,int i)\n {\n this.l=ch;\n this.r=i;\n }\n }\n static class sort implements Comparator<card>\n {\n public int compare(card o1,card o2)\n {\n if(o1.l!=o2.l)\n return (int)(o1.l-o2.l);\n else\n return (int)(o1.r-o2.r);\n }\n }\n static void shuffle(long a[])\n {\n List<Long> l=new ArrayList<>();\n for(int i=0;i<a.length;i++)\n l.add(a[i]);\n Collections.shuffle(l);\n for(int i=0;i<a.length;i++)\n a[i]=l.get(i);\n }\n\n /*static long gcd(long a,long b)\n {\n if(b==0)\n return a;\n else\n return gcd(b,a%b);\n }\n static int ans1=Integer.MAX_VALUE,ans2=Integer.MAX_VALUE,ans3=Integer.MAX_VALUE,ans4=Integer.MAX_VALUE;\n static boolean v[]=new boolean[101];\n static void dfs(Integer so,Set<Integer> s[]){\n if(!v[so.intValue()])\n {\n v[so]=true;\n for(Integer h:s[so.intValue()])\n {\n if(!v[h.intValue()])\n dfs(h,s);\n }\n }\n }\n static class Print{\n public PrintWriter out;\n Print(OutputStream o)\n {\n out=new PrintWriter(o);\n }\n }\n static int CeilIndex(int A[], int l, int r, int key) \n { \n while (r - l > 1) { \n int m = l + (r - l) / 2; \n if (A[m] >= key) \n r = m; \n else\n l = m; \n } \n\n return r; \n } \n\n static int LongestIncreasingSubsequenceLength(int A[], int size) \n { \n // Add boundary case, when array size is one \n int[] tailTable = new int[size]; \n int len; // always points empty slot \n tailTable[0] = A[0]; \n len = 1; \n for (int i = 1; i < size; i++) { \n if (A[i] < tailTable[0]) \n // new smallest value \n tailTable[0] = A[i]; \n\n else if (A[i] > tailTable[len - 1]) \n // A[i] wants to extend largest subsequence \n tailTable[len++] = A[i]; \n\n else\n // A[i] wants to be current end candidate of an existing \n // subsequence. It will replace ceil value in tailTable \n tailTable[CeilIndex(tailTable, -1, len - 1, A[i])] = A[i]; \n } \n return len; \n }*/\n /*static int binary(int n)\n {\n int s=1;\n while(n>0)\n {\n s=s<<1;\n n--;\n }\n return s-1;\n }\n static StringBuilder bin(int i,int n)\n {\n StringBuilder s=new StringBuilder();\n while(i>0)\n {\n s.append(i%2);\n i=i/2;\n }\n while(s.length()!=n)\n {\n s.append(0);\n }\n return s.reverse();\n }*/\n public static void main(String[] args) \n {\n InputReader sc=new InputReader(System.in);\n long c=sc.nextLong();\n long vo=sc.nextLong();\n long v1=sc.nextLong();\n long a=sc.nextLong();\n long l=sc.nextLong();int c1=1;\n long t=vo,t1=vo;\n while(t<c)\n {\n c1++;\n t1=Math.min(t1+a,v1);\n t+=t1-l;\n //System.out.println(t1+\" \"+t);\n }\n System.out.println(c1);\n }\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "ccb48daa9107b26d43dd0b076c2cf149", "src_uid": "b743110117ce13e2090367fd038d3b50", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import\tjava.util.*;\npublic\tclass\tMain{\n\tstatic\tint\tLsPr(int\tn){\n\t\tboolean[]F=new\tboolean[1+n];\n\t\tint\ti=0,j=0;\n\t\twhile(!F[n]&&n>i)\tif(!F[++i]&&i+j++<n)\tF[j+i]=true;\n\t\treturn\tn>i?0:j+i;\n\t}\n\tpublic\tstatic\tvoid\tmain(String[]args){\n\t\tScanner\tcin=new\tScanner(System.in);\n\t\tint\ts=0,n=cin.nextInt(),i=0,Q[]=new\tint[3];\n\t\tfor(;n>i;s^=Q[i++]=cin.nextInt());\n\t\tif(2==n){\n\t\t\tif(Q[0]>Q[1]){i=Q[0];Q[0]=Q[1];Q[1]=i;}\n\t\t\tSystem.out.print(LsPr(Q[0])!=Q[1]?\"BitLGM\":\"BitAryo\");\n\t\t}else\tSystem.out.print(0<s?\"BitLGM\":\"BitAryo\");\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dp", "games"], "code_uid": "49c8842148a0257e8b012a49ac88b875", "src_uid": "7a33b4f94082c7ef80d7e87b58497fa7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\n\n\n \nimport java.math.*;\n\nimport java.util.*;\n \n \npublic class BruteForce {\n \n public static Scanner in =new Scanner(System.in);\n public static BigInteger getN(String x){\n StringBuilder build=new StringBuilder(x);\n x=build.reverse().toString();\n BigInteger sum=new BigInteger(\"0\");\n for(int i=0;i<x.length();i++){\n int c=Integer.parseInt(x.charAt(i)+\"\");\n int s=(int)(Math.pow(2,i)*c);\n BigInteger cur=new BigInteger(s+\"\");\n sum=sum.add(cur);\n }\n return sum;\n }\n public static String getB(int n){\n String x=\"\";\n while(n > 0)\n {\n int a = n % 2;\n x = a + x;\n n = n / 2;\n }\n return x;\n }\n public static ArrayList<Integer> sieve(int n){\n long sqr=(long) Math.sqrt(n);\n boolean[] isPrime=new boolean[n+1];\n for(int i=0;i<=n;i++)\n isPrime[i]=true;\n for(int i=2;i<=sqr;i++){\n if(isPrime[i]){\n for(int p=i*i;p<=n;p+=i)\n isPrime[p]=false;\n }\n }\n ArrayList<Integer> list=new ArrayList<Integer>();\n for(int i=0;i<=n;i++)\n if(isPrime[i])\n list.add(i);\n list.remove(0);\n list.remove(0);\n return list;\n }\n public static boolean isPrime(long n){\n boolean res=true;\n List l =sieve((int) Math.sqrt(n));\n for(int i=0;i<l.size();i++){\n int curPrime=(int) l.get(i);\n if(n%curPrime==0){\n res=false;\n break;\n }\n }\n return res;\n }\n public static void main(String[] args){\n int n=in.nextInt();\n int pos=in.nextInt();\n int l=in.nextInt();\n int r=in.nextInt();\n int left=l-1;\n int right=n-r;\n if(l==1&&r==n)\n System.out.println(\"0\");\n else if(left==0){\n \n System.out.println(Math.abs(r-pos)+1);\n }\n else if(right==0){\n System.out.println(Math.abs(pos-l)+1);\n }\n else{\n \n int d1=Math.abs(pos-l);\n int d2=Math.abs(pos-r);\n int cost=0;\n cost+=Math.min(d1,d2)+1;\n cost+=(r-l+1);\n System.out.println(cost);\n //System.out.println(d1+\" \"+d2);\n }\n }\n \n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "3364302ceba4b71ffab4f77164687d1f", "src_uid": "5deaac7bd3afedee9b10e61997940f78", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class helloWorld \n{\n\tpublic static void main(String[] args) \n\t{\t\t\n\t\tScanner in = new Scanner(System.in);\n\t\tint d = in.nextInt();\n\t\tint L = in.nextInt();\n\t\tint v1 = in.nextInt();\n\t\tint v2 = in.nextInt();\n\t\t\n\t\tdouble ans = L-d;\n\t\tans /= v1 + v2;\n\t\t\n\t\tSystem.out.println(ans);\n\t\t\n\t\tin.close();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "45fd58f8029b74657cd8db724c36a060", "src_uid": "f34f3f974a21144b9f6e8615c41830f5", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\npublic class Tester {\n\tpublic static void main(String args[])\n\t{\n\t\t//Map<Integer, Integer> hm=new HashMap<>();\n\t\tScanner sc=new Scanner(System.in);\n\t\t\tint i,j,k,l=1,r,m=1,n,o,p,a,b,c,d,x,t,h,count=0,max=Integer.MAX_VALUE,sum=0,index=0,temp;\n\t\t\tBigInteger bi1=BigInteger.ZERO, bi2=BigInteger.ONE;\n\t\t\tn=sc.nextInt();\n\t\t\ta=sc.nextInt();\n\t\t\tb=sc.nextInt();\n\t\t\tc=sc.nextInt();\n\t\t\td=sc.nextInt();\n\t\t\tfor(x=1;x<=n;x++)\n\t\t\t{\n\t\t\t\tint y=x+b-c;\n\t\t\t\tint z=x+a-d;\n\t\t\t\tint w=z+b-c;\n\t\t\t\tif((y>=1&&y<=n)&&(z>=1&&z<=n)&&(w>=1&&w<=n))\n\t\t\t\t{\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tbi2=bi2.multiply(BigInteger.valueOf(count));\n\t\t\tbi2=bi2.multiply(BigInteger.valueOf(n));\n\t\t\tSystem.out.println(bi2);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "constructive algorithms"], "code_uid": "afb966a84a47959d724e3c6e44349ce8", "src_uid": "b732869015baf3dee5094c51a309e32c", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args){\n Scanner scan = new Scanner(System.in);\n\n int N = scan.nextInt(), A = scan.nextInt(), B = scan.nextInt();\n int ans = 1;\n if(B >= 0){\n ans = (A + B) % N;\n }\n else{\n B = -B % N;\n ans = (A - B + N) % N;\n }\n if(ans == 0){\n ans = N;\n }\n\n System.out.println(ans);\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "2206f5a940fa525104b428f50d298fa2", "src_uid": "cd0e90042a6aca647465f1d51e6dffc4", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "\nimport java.util.Scanner;\n\npublic class A {\n public static int gcd(int x, int y) {\n return y == 0 ? x : gcd(y, x % y);\n }\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int n = in.nextInt();\n int[] A = new int[n];\n for (int i = 0; i < n; i++)\n A[i] = in.nextInt();\n int min = A[0];\n for (int i = 1; i < n; i++)\n min = gcd(min, A[i]);\n System.out.println(n * min);\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "greedy"], "code_uid": "84d3dab1528efc63ecd0e08996d16db3", "src_uid": "042cf938dc4a0f46ff33d47b97dc6ad4", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\n//When I wrote this code, only God & I understood what it did. Now only God knows !!\n\n\nimport java.util.*;\nimport java.io.*;\nimport java.math.*;\n\n\npublic class Main {\n\n static class FastReader\n {\n private InputStream mIs;private byte[] buf = new byte[1024];private int curChar,numChars;public FastReader() { this(System.in); }public FastReader(InputStream is) { mIs = is;}\n public int read() {if (numChars == -1) throw new InputMismatchException();if (curChar >= numChars) {curChar = 0;try { numChars = mIs.read(buf);} catch (IOException e) { throw new InputMismatchException();}if (numChars <= 0) return -1; }return buf[curChar++];}\n public String nextLine(){int c = read();while (isSpaceChar(c)) c = read();StringBuilder res = new StringBuilder();do {res.appendCodePoint(c);c = read();}while (!isEndOfLine(c));return res.toString() ;}\n public String next(){int c = read();while (isSpaceChar(c)) c = read();StringBuilder res = new StringBuilder();do {res.appendCodePoint(c);c = read();}while (!isSpaceChar(c));return res.toString();}\n public long l(){int c = read();while (isSpaceChar(c)) c = read();int sgn = 1;if (c == '-') { sgn = -1 ; c = read() ; }long res = 0; do{ if (c < '0' || c > '9') throw new InputMismatchException();res *= 10 ; res += c - '0' ; c = read();}while(!isSpaceChar(c));return res * sgn;}\n public int i(){int c = read() ;while (isSpaceChar(c)) c = read();int sgn = 1;if (c == '-') { sgn = -1 ; c = read() ; }int res = 0;do{if (c < '0' || c > '9') throw new InputMismatchException();res *= 10 ; res += c - '0' ; c = read() ;}while(!isSpaceChar(c));return res * sgn;}\n public double d() throws IOException {return Double.parseDouble(next()) ;}\n public boolean isSpaceChar(int c) { return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1; }\n public boolean isEndOfLine(int c) { return c == '\\n' || c == '\\r' || c == -1; }\n public void scanIntArr(int [] arr){ for(int li=0;li<arr.length;++li){ arr[li]=i();}}\n public void scanLongArr(long [] arr){for (int i=0;i<arr.length;++i){arr[i]=l();}}\n public void shuffle(int [] arr){ for(int i=arr.length;i>0;--i) { int r=(int)(Math.random()*i); int temp=arr[i-1]; arr[i-1]=arr[r]; arr[r]=temp; } }\n }\n\n public static void main(String[] args) throws IOException {\n\n FastReader fr = new FastReader();\n PrintWriter pw = new PrintWriter(System.out);\n /*\ninputCopy\n11 3\noutputCopy\n5\ninputCopy\n11 6\noutputCopy\n4\ninputCopy\n20 20\noutputCopy\n1\ninputCopy\n14 5\noutputCopy\n6\ninputCopy\n1000000 100\noutputCopy\n31248\n */\n long n=fr.l();\n long k=fr.l();\n long right=n;\n long left=1;\n while(left<right)\n {\n if(left/2 == right/2)\n break;\n long mid=(left+right)/2;\n long curK=0;\n long other=mid%2==0?mid-1:mid+1;\n long curK1=getK(mid,n);\n long curK2=getK(other,n);\n curK=Math.max(curK1,curK2);\n //System.err.println(mid+\" \"+curK);\n if(curK<k)\n right=mid-1;\n else\n left=mid+1;\n }\n //System.err.println(\"left=\"+left);\n left+=4;\n long k2=getK(left,n);\n while(k2<k || left>n) {\n --left;\n k2=getK(left,n);\n }\n pw.println(left);\n pw.flush();\n pw.close();\n }\n public static long getK(long num,long n)\n {\n long curK=0;\n long lowerBound=num;\n long upperBound=num%2==0?num+1:num;\n while(upperBound<n)\n {\n curK+=(upperBound-lowerBound)+1;\n lowerBound*=2;\n upperBound=2*upperBound+1;\n }\n curK+=Math.max((n-lowerBound)+1,0);\n return curK;\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "binary search", "dp", "combinatorics"], "code_uid": "21a7ee01967195541fc684378a70fdee", "src_uid": "783c4b3179c558369f94f4a16ac562d4", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class RobotSequence {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n\tint n = in.nextInt();\n\tchar[] commands = in.next().toCharArray();\n\tstart(n, commands);\n }\n \n private static void start(int n, char[] commands) {\n \tint toReturn = 0;\n int[] countsUDLR = new int[4];\n \n for (int i = 0; i < n - 1; i++) {\n countsUDLR = new int[4];\n countDir(commands[i], countsUDLR);\n \n for (int j = i + 1; j < n; j++) {\n countDir(commands[j], countsUDLR);\n if (atStart(countsUDLR)) {\n toReturn++;\n }\n }\n }\n \n System.out.println(toReturn);\n }\n \n private static void countDir(char dir, int[] counts) {\n if (dir == 'U') {\n counts[0]++;\n } else if (dir == 'D') {\n counts[1]++;\n } else if (dir == 'L') {\n counts[2]++;\n } else {\n counts[3]++;\n }\n }\n \n private static boolean atStart(int[] counts) {\n return counts[0] == counts[1] && counts[2] == counts[3];\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "fd9da8bf46532db47b149006161f3e99", "src_uid": "7bd5521531950e2de9a7b0904353184d", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.text.*;\n\npublic class Main {\n //SOLUTION BEGIN\n //Into the Hardware Mode\n long MOD = 998244353;\n void pre() throws Exception{}\n void solve(int TC) throws Exception{\n int N = ni();\n long K = nl();\n int diff = 0;\n int[] h = new int[N];\n for(int i = 0; i< N; i++)h[i] = ni();\n for(int i = 0; i< N; i++)if(h[i] != h[(i+1)%N])diff++;\n long[] F = new long[1+diff], IF = new long[1+diff];\n F[0] = 1;IF[0] = 1;\n for(int i = 1; i<= diff; i++)F[i] = (F[i-1]*i)%MOD;\n IF[diff] = pow(F[diff], MOD-2);\n for(int i = diff-1; i >= 1; i--)IF[i] = (IF[i+1]*(i+1))%MOD;\n long ans = 0;\n for(int k = 0; 2*k <= diff; k++)\n ans += mul(pow(K-2, diff-2*k), F[diff], IF[k], IF[k], IF[diff-2*k]);\n ans = mul(ans, pow(K, N-diff));\n ans = (pow(K, N)+MOD-ans)%MOD;\n pn(mul(ans, pow(2, MOD-2)));\n }\n long mul(long... a){\n long o = 1;\n for(long x:a)o = (x*o)%MOD;\n return o;\n }\n long pow(long a, long p){\n long o = 1;\n for(;p>0;p>>=1){\n if((p&1)==1)o = (o*a)%MOD;\n a = (a*a)%MOD;\n }\n return o;\n }\n //SOLUTION END\n void hold(boolean b)throws Exception{if(!b)throw new Exception(\"Hold right there, Sparky!\");}\n void exit(boolean b){if(!b)System.exit(0);}\n static void debug(Object... o){System.out.println(Arrays.deepToString(o));}\n final long IINF = (long)2e18;\n final int INF = (int)1e9+2;\n DecimalFormat df = new DecimalFormat(\"0.00000000000\");\n double PI = 3.141592653589793238462643383279502884197169399, eps = 1e-8;\n static boolean multipleTC = false, memory = false, fileIO = false;\n FastReader in;PrintWriter out;\n void run() throws Exception{\n long ct = System.currentTimeMillis();\n if (fileIO) {\n in = new FastReader(\"\");\n out = new PrintWriter(\"\");\n } else {\n in = new FastReader();\n out = new PrintWriter(System.out);\n }\n //Solution Credits: Taranpreet Singh\n int T = multipleTC? ni():1;\n pre();\n for (int t = 1; t <= T; t++) solve(t);\n out.flush();\n out.close();\n System.err.println(System.currentTimeMillis() - ct);\n }\n public static void main(String[] args) throws Exception{\n if(memory)new Thread(null, new Runnable() {public void run(){try{new Main().run();}catch(Exception e){e.printStackTrace();}}}, \"1\", 1 << 28).start();\n else new Main().run();\n }\n int[][] make(int n, int[] from, int[] to, int e, boolean f){\n int[][] g = new int[n][];int[]cnt = new int[n];\n for(int i = 0; i< e; i++){\n cnt[from[i]]++;\n if(f)cnt[to[i]]++;\n }\n for(int i = 0; i< n; i++)g[i] = new int[cnt[i]];\n for(int i = 0; i< e; i++){\n g[from[i]][--cnt[from[i]]] = to[i];\n if(f)g[to[i]][--cnt[to[i]]] = from[i];\n }\n return g;\n }\n int[][][] makeS(int n, int[] from, int[] to, int e, boolean f){\n int[][][] g = new int[n][][];int[]cnt = new int[n];\n for(int i = 0; i< e; i++){\n cnt[from[i]]++;\n if(f)cnt[to[i]]++;\n }\n for(int i = 0; i< n; i++)g[i] = new int[cnt[i]][];\n for(int i = 0; i< e; i++){\n g[from[i]][--cnt[from[i]]] = new int[]{to[i], i, 0};\n if(f)g[to[i]][--cnt[to[i]]] = new int[]{from[i], i, 1};\n }\n return g;\n }\n int find(int[] set, int u){return set[u] = (set[u] == u?u:find(set, set[u]));}\n int digit(long s){int ans = 0;while(s>0){s/=10;ans++;}return ans;}\n long gcd(long a, long b){return (b==0)?a:gcd(b,a%b);}\n int gcd(int a, int b){return (b==0)?a:gcd(b,a%b);}\n int bit(long n){return (n==0)?0:(1+bit(n&(n-1)));}\n void p(Object o){out.print(o);}\n void pn(Object o){out.println(o);}\n void pni(Object o){out.println(o);out.flush();}\n String n()throws Exception{return in.next();}\n String nln()throws Exception{return in.nextLine();}\n int ni()throws Exception{return Integer.parseInt(in.next());}\n long nl()throws Exception{return Long.parseLong(in.next());}\n double nd()throws Exception{return Double.parseDouble(in.next());}\n\n class FastReader{\n BufferedReader br;\n StringTokenizer st;\n public FastReader(){\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n public FastReader(String s) throws Exception{\n br = new BufferedReader(new FileReader(s));\n }\n\n String next() throws Exception{\n while (st == null || !st.hasMoreElements()){\n try{\n st = new StringTokenizer(br.readLine());\n }catch (IOException e){\n throw new Exception(e.toString());\n }\n }\n return st.nextToken();\n }\n\n String nextLine() throws Exception{\n String str;\n try{\n str = br.readLine();\n }catch (IOException e){\n throw new Exception(e.toString());\n }\n return str;\n }\n }\n}", "lang_cluster": "Java", "tags": ["math", "combinatorics"], "code_uid": "9708d395f6a0ee162cd50edfc8d0ee6b", "src_uid": "63c4006a0a6284f9825aaabfc4c28fd1", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.lang.Math;\nimport java.util.*;\n\n\npublic class Main {\n public static void main(String[] args) {\n Scanner newSc = new Scanner(System.in);\n int a = newSc.nextInt();\n int b = newSc.nextInt();\n if(a == b)\n System.out.println(0);\n int n = Math.max(a, b) - (Math.min(a, b) + Math.abs(a - b) / 2);\n if(a % 2 == b % 2)\n System.out.println(n * (n + 1));\n else\n System.out.println(n * n);\n\n }\n }\n", "lang_cluster": "Java", "tags": ["math", "greedy", "implementation", "brute force"], "code_uid": "c34373576a0fbf3bad6c96bfba7a104b", "src_uid": "d3f2c6886ed104d7baba8dd7b70058da", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/**\n * 24/12/19\n */\n\nimport java.util.*;\n\npublic class A0908_Counting {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n String s = scanner.next();\n\n System.out.println(s.length() - s.replaceAll(\"a|e|i|o|u|1|3|5|7|9\", \"\").length());\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "eb6183b3c54ac08e5c5bc798755a8233", "src_uid": "b4af2b8a7e9844bf58ad3410c2cb5223", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Arrays;\nimport java.util.Scanner;\n\n/**\n * Created by vinayr on 8/2/17.\n */\npublic class CorrectSolution {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String val = sc.nextLine();\n String val1 = sc.nextLine();\n char[] arr = val.toCharArray();\n Arrays.sort(arr);\n int i;\n for (i = 0; i < arr.length && arr[i] == '0'; i++) ;\n if (i != 0 && i < arr.length) {\n arr[0] = arr[i];\n arr[i] = '0';\n }\n\n String ans = new String(arr);\n // System.out.println(ans);\n if (ans.equals(val1)) {\n System.out.println(\"OK\");\n } else\n System.out.println(\"WRONG_ANSWER\");\n }\n}\n", "lang_cluster": "Java", "tags": ["sortings", "implementation"], "code_uid": "fc70a1890582bcd8cf98397e5464db6f", "src_uid": "d1e381b72a6c09a0723cfe72c0917372", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\n\npublic class A {\n\n BufferedReader read=new BufferedReader(new InputStreamReader(System.in));\n BufferedWriter write=new BufferedWriter(new OutputStreamWriter(System.out));\n\n void solve(String[] s,String[] s2) throws Exception{\n int x1=Integer.parseInt(s[0]);\n int y1=Integer.parseInt(s[1]);\n int x2=Integer.parseInt(s[2]);\n int y2=Integer.parseInt(s[3]);\n int x=Integer.parseInt(s2[0]);\n int y=Integer.parseInt(s2[1]);\n int dx = Math.abs(x1 - x2) / x, dy = Math.abs(y1 - y2) / y;\n int max = Math.max(dx, dy);\n int min = Math.min(dx, dy);\n write.write((x1 - x2) % x == 0 && (y1 - y2) % y == 0 && (max - min) % 2 == 0 ? \"YES\" : \"NO\");\n\n write.flush();\n write.close();\n\n }\n void run() throws Exception{\n String[] si=read.readLine().split(\" \");\n String[] se=read.readLine().split(\" \");\n solve(si,se);\n }\n public static void main(String[] args) throws Exception {\n new A().run();\n }\n\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation", "number theory"], "code_uid": "6a7456983022a12b8ab53b5fa5caeb74", "src_uid": "1c80040104e06c9f24abfcfe654a851f", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.Scanner;\n\npublic class VusTheCossackAndContest_1186A {\n public static void main(String[] args) {\n Scanner s = new Scanner(System.in);\n int n = s.nextInt();\n int a = s.nextInt();\n int b = s.nextInt();\n if(a>=n && b>=n){\n System.out.println(\"YES\");\n }\n else{\n System.out.println(\"NO\");\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "fa5116bf05f1a1d9c021065b1f1a8439", "src_uid": "6cd07298b23cc6ce994bb1811b9629c4", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.io.IOException;\nimport java.util.InputMismatchException;\nimport java.io.InputStream;\n \npublic class Main {\n \n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n AGennaAndACardGame solver = new AGennaAndACardGame();\n solver.solve(1, in, out);\n out.close();\n }\n \n static class AGennaAndACardGame {\n \n public void solve(int testNumber, InputReader in, PrintWriter out) {\n char[] c = in.nextCharArray();\n for (int i = 0; i < 5; ++i) {\n char[] t = in.nextCharArray();\n if (c[0] == t[0] || c[1] == t[1]) {\n out.println(\"YES\");\n return;\n }\n }\n out.println(\"NO\");\n }\n \n }\n \n static class InputReader {\n \n private InputStream stream;\n private static final int DEFAULT_BUFFER_SIZE = 1 << 16;\n private static final int EOF = -1;\n private byte[] buf = new byte[DEFAULT_BUFFER_SIZE];\n private int curChar;\n private int numChars;\n \n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n \n public int read() {\n if (this.numChars == EOF) {\n throw new UnknownError();\n } else {\n if (this.curChar >= this.numChars) {\n this.curChar = 0;\n \n try {\n this.numChars = this.stream.read(this.buf);\n } catch (IOException ex) {\n throw new InputMismatchException();\n }\n \n if (this.numChars <= 0) {\n return EOF;\n }\n }\n \n return this.buf[this.curChar++];\n }\n }\n \n public String next() {\n int c;\n while (isSpaceChar(c = this.read())) {\n }\n \n StringBuilder result = new StringBuilder();\n result.appendCodePoint(c);\n \n while (!isSpaceChar(c = this.read())) {\n result.appendCodePoint(c);\n }\n \n return result.toString();\n }\n \n public static boolean isSpaceChar(int c) {\n return c == 32 || c == 10 || c == 13 || c == 9 || c == EOF;\n }\n \n public char[] nextCharArray() {\n return next().toCharArray();\n }\n \n }\n}", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "0f64c72699f1122059f6a000eafd7b65", "src_uid": "699444eb6366ad12bc77e7ac2602d74b", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\nimport java.lang.*;\nimport java.math.*;\nimport java.io.*;\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\nimport static java.util.Collections.*;\n\n// Title\n// 2012/10/31\npublic class P059C{\n\tScanner sc=new Scanner(System.in);\n\n\tint k;\n\tString s;\n\n\tvoid run(){\n\t\tk=sc.nextInt();\n\t\ts=sc.next();\n\t\tsolve();\n\t}\n\n\tvoid solve(){\n\t\tint n=s.length();\n\t\tint[] a=new int[n];\n\t\tfor(int i=0; i<n; i++){\n\t\t\tif(Character.isLetter(s.charAt(i))){\n\t\t\t\ta[i]=s.charAt(i)-'a';\n\t\t\t}else{\n\t\t\t\ta[i]=-1;\n\t\t\t}\n\t\t}\n\t\tLinkedList<Integer> indices=new LinkedList<Integer>();\n\t\tLinkedList<Integer> unused=new LinkedList<Integer>();\n\t\tfor(int i=0; i<k; i++){\n\t\t\tunused.addFirst(i);\n\t\t}\n\t\tboolean ok=true;\n\t\tfor(int i=0;; i++){\n\t\t\tint j=n-1-i;\n\t\t\tif(i>j){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(a[i]==-1&&a[j]==-1){\n\t\t\t\tindices.addFirst(i);\n\t\t\t}else if(a[i]==-1^a[j]==-1){\n\t\t\t\ta[i]=a[j]=a[i]==-1?a[j]:a[i];\n\t\t\t\tunused.remove((Integer)a[i]);\n\t\t\t}else{\n\t\t\t\tok&=a[i]==a[j];\n\t\t\t\tunused.remove((Integer)a[i]);\n\t\t\t}\n\t\t}\n\t\tok&=indices.size()>=unused.size();\n\n\t\tfor(int i : indices){\n\t\t\tint j=n-1-i;\n\t\t\tint v;\n\t\t\tif(unused.size()==0){\n\t\t\t\tv=0;\n\t\t\t}else{\n\t\t\t\tv=unused.removeFirst();\n\t\t\t}\n\t\t\ta[i]=a[j]=v;\n\t\t}\n\t\tString ans=\"\";;\n\t\tfor(int i=0; i<n; i++){\n\t\t\tans+=(char)(a[i]+'a');\n\t\t}\n\t\tif(!ok){\n\t\t\tans=\"IMPOSSIBLE\";\n\t\t}\n\t\tprintln(ans);\n\t}\n\n\tvoid println(String s){\n\t\tSystem.out.println(s);\n\t}\n\n\tpublic static void main(String[] args){\n\t\tLocale.setDefault(Locale.US);\n\t\tnew P059C().run();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["expression parsing"], "code_uid": "ee2c5ed06d0dbd2e92ce263a24e42910", "src_uid": "9d1dd9d722e5fe46823224334b3b208a", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import static java.lang.Math.*;\nimport static java.lang.System.currentTimeMillis;\nimport static java.lang.System.exit;\nimport static java.lang.System.arraycopy;\nimport static java.util.Arrays.sort;\nimport static java.util.Arrays.binarySearch;\nimport static java.util.Arrays.fill;\nimport java.util.*;\nimport java.io.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\ttry {\n\t\t\tif (new File(\"input.txt\").exists())\n\t\t\t\tSystem.setIn(new FileInputStream(\"input.txt\"));\n\t\t} catch (SecurityException e) {\n\t\t}\n\t\tnew Thread(null, new Runnable() {\n\t\t\tpublic void run() {\n\t\t\t\ttry {\n\t\t\t\t\tnew Main().run();\n\t\t\t\t} catch (Throwable e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t\texit(999);\n\t\t\t\t}\n\t\t\t}\n\t\t}, \"1\", 1 << 23).start();\n\t}\n\n\tBufferedReader in;\n\tPrintWriter out;\n\tStringTokenizer st = new StringTokenizer(\"\");\n\n\tprivate void run() throws IOException {\n\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\tint k = nextInt();\n\t\tString s = nextLine();\n\t\tint L = s.length();\n\t\tint l,r;\n\t\tl = (L>>1) - ((L&1)^1);\n\t\tr = L>>1;\n\t\tboolean f = true;\n\t\tint pos = k-1;\n\t\tboolean used[] = new boolean[100];\n\t\tchar cl,cr;\n\t\tchar ms[] = s.toCharArray();\n\t\tfor(int i = l; i >= 0; i--)\n\t\t\tif(ms[i] >= 'a')used[ms[i]-'a'] = true;\n\t\tfor(int i = r; i < L; i++)\n\t\t\tif(ms[i] >= 'a')used[ms[i]-'a'] = true;\n\t\twhile(used[pos] && pos>0)\n\t\t\tpos--;\n\t\twhile(l>=0){\n\t\t\tcl = ms[l];\n\t\t\tcr = ms[r];\n\t\t\tif(cl == cr && cr!='?'){\n\t\t\t\tused[ms[l]-'a'] = true;\n\t\t\t\tl--;r++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(cl!=cr && cl!='?' && cr!='?'){\n\t\t\t\tf = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(cl =='?' && cr!='?'){\n\t\t\t\tms[l] = ms[r];\n\t\t\t\tused[ms[l]-'a'] = true;\n\t\t\t\tl--;r++;\t\t\t\t\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(cl !='?' && cr=='?'){\n\t\t\t\tms[r] = ms[l];\n\t\t\t\tused[ms[l]-'a'] = true;\n\t\t\t\tl--;r++;\t\t\t\t\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\twhile(used[pos] && pos>0)\n\t\t\t\tpos--;\n\t\t\tif(cl == '?' && cr == '?'){\n\t\t\t\tms[l] = ms[r] = (char)('a'+pos);\n\t\t\t\tused[pos] = true;\n\t\t\t\twhile(used[pos] && pos>0)\n\t\t\t\t\tpos--;\n\t\t\t\tl--;r++;\t\t\t\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tout.println(\"trololo\");\n\t\t}\n\t\twhile(used[pos] && pos>0)\n\t\t\tpos--;\n\t\tif(f && pos==0 && used[0] == true)\n\t\t\tout.println(ms);\n\t\telse\n\t\t\tout.println(\"IMPOSSIBLE\");\n\t\t\n\t\tin.close();\n\t\tout.close();\n\t}\n\n\tvoid chk(boolean b) {\n\t\tif (b)\n\t\t\treturn;\n\t\tSystem.out.println(new Error().getStackTrace()[1]);\n\t\texit(999);\n\t}\n\tvoid deb(String fmt, Object... args) {\n\t\tSystem.out.printf(Locale.US, fmt + \"%n\", args);\n\t}\n\tString nextToken() throws IOException {\n\t\twhile (!st.hasMoreTokens())\n\t\t\tst = new StringTokenizer(in.readLine());\n\t\treturn st.nextToken();\n\t}\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\tlong nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\tdouble nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n\tString nextLine() throws IOException {\n\t\tst = new StringTokenizer(\"\");\n\t\treturn in.readLine();\n\t}\n\tboolean EOF() throws IOException {\n\t\twhile (!st.hasMoreTokens()) {\n\t\t\tString s = in.readLine();\n\t\t\tif (s == null)\n\t\t\t\treturn true;\n\t\t\tst = new StringTokenizer(s);\n\t\t}\n\t\treturn false;\n\t}\n}\n", "lang_cluster": "Java", "tags": ["expression parsing"], "code_uid": "d6c8539ecc6c07b74c361437ce5e825d", "src_uid": "9d1dd9d722e5fe46823224334b3b208a", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\n\npublic class C {\n\tpublic static void main(String[] args) {\n\t\tScanner s = new Scanner(System.in);\n\t\tint k = s.nextInt();\n\t\tchar cs[] = s.next().toCharArray();\n\t\tint r = 0, n = cs.length;\n\t\tBitSet used = new BitSet();\n\t\tfor (int i = 0; i < n / 2; ++i) {\n\t\t\tchar a = cs[i], b = cs[n - i - 1];\n\t\t\tif (a != '?' && b != '?' && a != b) {\n\t\t\t\tSystem.out.println(\"IMPOSSIBLE\");\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (a == '?' && b != '?') {\n\t\t\t\tcs[i] = b;\n\t\t\t\tused.set(b - 'a');\n\t\t\t} else if (a != '?' && b == '?') {\n\t\t\t\tcs[n - i - 1] = a;\n\t\t\t\tused.set(a - 'a');\n\t\t\t} else if (a == '?' && b == '?') {\n\t\t\t\t++r;\n\t\t\t} else {\n\t\t\t\tused.set(a - 'a');\n\t\t\t}\n\t\t}\n\t\tif (n % 2 > 0) {\n\t\t\tif (cs[n / 2] == '?') {\n\t\t\t\t++r;\n\t\t\t} else {\n\t\t\t\tused.set(cs[n / 2] - 'a');\n\t\t\t}\n\t\t}\n\t\tint c = used.cardinality();\n\t\tif (k > r + c) {\n\t\t\tSystem.out.println(\"IMPOSSIBLE\");\n\t\t\treturn;\n\t\t}\n\t\tint p = 0;\n\t\tfor (int i = 0; i < n / 2; ++i) {\n\t\t\tif (cs[i] == '?') {\n\t\t\t\t--r;\n\t\t\t\tif (r < k - c) {\n\t\t\t\t\tp = used.nextClearBit(p);\n\t\t\t\t\tcs[i] = cs[n-i-1] = (char)('a' + p);\n\t\t\t\t\tused.set(p);\n\t\t\t\t} else {\n\t\t\t\t\tcs[i] = cs[n - i - 1] = 'a';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (n % 2 > 0) {\n\t\t\tif (cs[n / 2] == '?') {\n\t\t\t\tif(r < k - c){\n\t\t\t\tcs[n/2] = (char)('a' + used.nextClearBit(p));\n\t\t\t\t}else{\n\t\t\t\t\tcs[n/2] = 'a';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(new String(cs));\n\t}\n}\n", "lang_cluster": "Java", "tags": ["expression parsing"], "code_uid": "7049db87ab56f9fbd800c7ea6a27e549", "src_uid": "9d1dd9d722e5fe46823224334b3b208a", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedInputStream;\nimport java.io.IOException;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.Comparator;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.InputMismatchException;\nimport java.util.LinkedList;\nimport java.util.Map.Entry;\nimport java.util.Queue;\nimport java.util.Set;\nimport java.util.TreeSet;\n\npublic class Main\n{\n\tpublic void foo()\n\t{\n\t\tMyScanner scan = new MyScanner();\n\t\tint k = scan.nextInt();\n\t\tchar[] a = scan.next().toCharArray();\n\t\tboolean[] vis = new boolean[k];\n\t\tint cnt = 0;\n\t\tboolean isImpossible = false;\n\t\tint n = a.length;\n\t\tfor(int i = 0;i <= (n - 1) / 2;++i)\n\t\t{\n\t\t\tif('?' == a[i] && '?' == a[n - 1 - i])\n\t\t\t{\n\t\t\t\t++cnt;\n\t\t\t}\n\t\t\telse if('?' == a[i] && a[n - 1 - i] != '?')\n\t\t\t{\n\t\t\t\tif(a[n - 1 - i] - 'a' >= k)\n\t\t\t\t{\n\t\t\t\t\tisImpossible = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tvis[a[n - 1 - i] - 'a'] = true;\n\t\t\t\ta[i] = a[n - 1 - i];\n\t\t\t}\n\t\t\telse if(a[i] != '?' && '?' == a[n - 1 - i])\n\t\t\t{\n\t\t\t\tif(a[i] - 'a' >= k)\n\t\t\t\t{\n\t\t\t\t\tisImpossible = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tvis[a[i] - 'a'] = true;\n\t\t\t\ta[n - 1 - i] = a[i];\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tif(a[i] != a[n - 1 - i] || a[i] - 'a' >= k)\n\t\t\t\t{\n\t\t\t\t\tisImpossible = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tvis[a[i] - 'a'] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(isImpossible)\n\t\t{\n\t\t\tSystem.out.println(\"IMPOSSIBLE\");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tArrayList<Character> arr = new ArrayList<Character>();\n\t\t\tfor(int i = k - 1;i >= 0;--i)\n\t\t\t{\n\t\t\t\tif(!vis[i])\n\t\t\t\t{\n\t\t\t\t\t--cnt;\n\t\t\t\t\tarr.add((char)(i + 'a'));\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(cnt < 0)\n\t\t\t{\n\t\t\t\tSystem.out.println(\"IMPOSSIBLE\");\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tint j = 0;\n\t\t\t\tfor(int i = (n - 1) / 2;i >= 0;--i)\n\t\t\t\t{\n\t\t\t\t\tif('?' == a[i])\n\t\t\t\t\t{\n\t\t\t\t\t\tif(j < arr.size())\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ta[i] = arr.get(j++);\n\t\t\t\t\t\t\ta[n - 1 - i] = a[i];\n \t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ta[i] = 'a';\n\t\t\t\t\t\t\ta[n - 1 - i] = 'a';\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tSystem.out.println(a);\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic static void main(String[] args)\n\t{\n\t\tnew Main().foo();\n\t}\n\t\n\tclass MyScanner\n\t{\n\t private byte[] buf = new byte[1024];\n\t private int curChar;\n\t private int numChars;\n\t BufferedInputStream bis = new BufferedInputStream(System.in);\n\n\t public int read() \n\t {\n\t if (-1 == numChars)\n\t {\n\t \tthrow new InputMismatchException();\n\t }\n\t if (curChar >= numChars)\n\t {\n\t curChar = 0;\n\t try \n\t {\n\t numChars = bis.read(buf);\n\t }\n\t catch (IOException e)\n\t {\n\t throw new InputMismatchException();\n\t }\n\t if (numChars <= 0)\n\t {\n\t \treturn -1;\n\t }\n\t }\n\t return buf[curChar++];\n\t }\n\n\t public int nextInt() \n\t {\n\t int c = read();\n\t while (isSpaceChar(c))\n\t {\n\t \tc = read();\n\t }\n\t int sgn = 1;\n\t if (c == '-') \n\t {\n\t sgn = -1;\n\t c = read();\n\t }\n\t int res = 0;\n\t do \n\t {\n\t if (c < '0' || c > '9')\n\t {\n\t \tthrow new InputMismatchException();\n\t }\n\t res *= 10;\n\t res += c - '0';\n\t c = read();\n\t } while (!isSpaceChar(c));\n\t return res * sgn;\n\t }\n\t \n\t public long nextLong() \n\t {\n\t \tint c = read();\n\t \twhile (isSpaceChar(c))\n\t \t{\n\t \t\tc = read();\n\t \t}\n\t \tint sgn = 1;\n\t \tif (c == '-') \n\t \t{\n\t \t\tsgn = -1;\n\t \t\tc = read();\n\t \t}\n\t \tlong res = 0;\n\t \tdo \n\t \t{\n\t \t\tif (c < '0' || c > '9')\n\t \t\t{\n\t \t\t\tthrow new InputMismatchException();\n\t \t\t}\n\t \t\tres *= 10;\n\t \t\tres += c - '0';\n\t \t\tc = read();\n\t \t} while (!isSpaceChar(c));\n\t \treturn res * sgn;\n\t }\n\t \n\t public String next()\n\t {\n\t int c = read();\n\t while (isSpaceChar(c))\n\t {\n\t \tc = read();\n\t }\n\t StringBuilder res = new StringBuilder();\n\t do \n\t {\n\t res.appendCodePoint(c);\n\t c = read();\n\t } while (!isSpaceChar(c));\n\t return res.toString();\n\t }\n\n\t private boolean isSpaceChar(int c) \n\t {\n\t return ' ' == c || '\\n' == c || '\\r' == c || '\\t' == c || -1 == c;\n\t }\n\t}\n}", "lang_cluster": "Java", "tags": ["expression parsing"], "code_uid": "dec8568b0836936dded02dcfbdd4fdbd", "src_uid": "9d1dd9d722e5fe46823224334b3b208a", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Washoum\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n inputClass in = new inputClass(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n CTitle solver = new CTitle();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class CTitle {\n public void solve(int testNumber, inputClass sc, PrintWriter out) {\n int n = sc.nextInt();\n StringBuilder s = new StringBuilder(sc.nextLine());\n boolean[] used = new boolean[n];\n int len = s.length();\n int nb = 0;\n for (int i = 0; i < s.length() / 2 + (len % 2 == 0 ? 0 : 1); i++) {\n if (s.charAt(i) == '?' && s.charAt(len - 1 - i) == '?') {\n nb++;\n continue;\n }\n if (s.charAt(i) == '?' || s.charAt(len - 1 - i) == '?') {\n if (s.charAt(i) == '?') {\n s.setCharAt(i, s.charAt(len - 1 - i));\n } else {\n s.setCharAt(len - 1 - i, s.charAt(i));\n }\n }\n if (s.charAt(i) != s.charAt(len - 1 - i)) {\n out.println(\"IMPOSSIBLE\");\n return;\n }\n used[s.charAt(i) - 'a'] = true;\n }\n int toadd = 0;\n for (int i = 0; i < n; i++) {\n if (!used[i])\n toadd++;\n }\n if (toadd > nb) {\n out.println(\"IMPOSSIBLE\");\n return;\n }\n int nxt = 0;\n for (; nxt < n; nxt++) {\n if (!used[nxt])\n break;\n }\n for (int i = 0; i < s.length() / 2 + (len % 2 == 0 ? 0 : 1); i++) {\n if (s.charAt(i) == '?') {\n if (nb > toadd) {\n s.setCharAt(i, 'a');\n s.setCharAt(len - 1 - i, 'a');\n nb--;\n } else {\n s.setCharAt(i, (char) (nxt + 'a'));\n s.setCharAt(len - 1 - i, (char) (nxt + 'a'));\n nxt++;\n while (nxt < n && used[nxt]) nxt++;\n }\n }\n }\n out.println(s);\n }\n\n }\n\n static class inputClass {\n BufferedReader br;\n StringTokenizer st;\n\n public inputClass(InputStream in) {\n\n br = new BufferedReader(new InputStreamReader(in));\n }\n\n public String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["expression parsing"], "code_uid": "e51eace889e12ba014a1f2f994712750", "src_uid": "9d1dd9d722e5fe46823224334b3b208a", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\n\npublic class C implements Runnable {\n\n\tvoid solve() {\n\t\tint k = nextInt();\n\t\tchar[] c = nextToken().toCharArray();\n\t\tfor (int i = 0, j = c.length - 1; i < j; i++, j--) {\n\t\t\tif (c[i] != '?' && c[j] != '?' && c[i] != c[j]) {\n\t\t\t\tout.println(\"IMPOSSIBLE\");\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tint q = 0;\n\t\tTreeSet<Character> ts = new TreeSet<Character>();\n\t\tfor (int i = 0; i < k; i++) {\n\t\t\tts.add((char) ('a' + i));\n\t\t}\n\t\tfor (int i = 0, j = c.length - 1; i <= j; i++, j--) {\n\t\t\tif (c[i] == '?' && c[j] == '?') {\n\t\t\t\tq++;\n\t\t\t}\n\t\t\tif (c[i] != '?') {\n\t\t\t\tts.remove(c[i]);\n\t\t\t}\n\t\t\tif (c[j] != '?') {\n\t\t\t\tts.remove(c[j]);\n\t\t\t}\n\t\t}\n\t\tfor (int i = (c.length - 1) / 2, j = c.length - i - 1; i >= 0; i--, j++) {\n\t\t\tif (c[i] == '?' && c[j] == '?') {\n\t\t\t\tif (!ts.isEmpty()) {\n\t\t\t\t\tc[i] = c[j] = ts.pollLast();\n\t\t\t\t} else {\n\t\t\t\t\tc[i] = c[j] = 'a';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (!ts.isEmpty()) {\n\t\t\tout.println(\"IMPOSSIBLE\");\n\t\t\treturn;\n\t\t}\n\t\tfor (int i = 0, j = c.length - 1; i < j; i++, j--) {\n\t\t\tif (c[i] == '?') {\n\t\t\t\tc[i] = c[j];\n\t\t\t} else if (c[j] == '?') {\n\t\t\t\tc[j] = c[i];\n\t\t\t}\n\t\t}\n\t\tout.println(new String(c));\n\t}\n\n\tFastScanner sc;\n\tPrintWriter out;\n\n\tpublic void run() {\n\t\tLocale.setDefault(Locale.US);\n\t\ttry {\n\t\t\tsc = new FastScanner(System.in);\n\t\t\tout = new PrintWriter(System.out);\n\t\t\tsolve();\n\t\t\tsc.close();\n\t\t\tout.close();\n\t\t} catch (Throwable e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(1);\n\t\t}\n\t}\n\n\tint nextInt() {\n\t\treturn sc.nextInt();\n\t}\n\n\tString nextToken() {\n\t\treturn sc.nextToken();\n\t}\n\n\tlong nextLong() {\n\t\treturn sc.nextLong();\n\t}\n\n\tdouble nextDouble() {\n\t\treturn sc.nextDouble();\n\t}\n\n\tBigInteger nextBigInteger() {\n\t\treturn sc.nextBigInteger();\n\t}\n\n\tclass FastScanner extends BufferedReader {\n\t\tStringTokenizer st;\n\t\tboolean eof;\n\t\tString buf;\n\t\tString curLine;\n\t\tboolean createST;\n\n\t\tpublic FastScanner(String fileName) throws FileNotFoundException {\n\t\t\tthis(fileName, true);\n\t\t}\n\n\t\tpublic FastScanner(String fileName, boolean createST)\n\t\t\t\tthrows FileNotFoundException {\n\t\t\tsuper(new FileReader(fileName));\n\t\t\tthis.createST = createST;\n\t\t\tnextToken();\n\t\t}\n\n\t\tpublic FastScanner(InputStream stream) {\n\t\t\tthis(stream, true);\n\t\t}\n\n\t\tpublic FastScanner(InputStream stream, boolean createST) {\n\t\t\tsuper(new InputStreamReader(stream));\n\t\t\tthis.createST = createST;\n\t\t\tnextToken();\n\t\t}\n\n\t\tString nextLine() {\n\t\t\tString ret = curLine;\n\t\t\tif (createST) {\n\t\t\t\tst = null;\n\t\t\t}\n\t\t\tnextToken();\n\t\t\treturn ret;\n\t\t}\n\n\t\tString nextToken() {\n\t\t\tif (!createST) {\n\t\t\t\ttry {\n\t\t\t\t\tcurLine = readLine();\n\t\t\t\t} catch (Exception e) {\n\t\t\t\t\teof = true;\n\t\t\t\t}\n\t\t\t\treturn null;\n\t\t\t}\n\t\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\tcurLine = readLine();\n\t\t\t\t\tst = new StringTokenizer(curLine);\n\t\t\t\t} catch (Exception e) {\n\t\t\t\t\teof = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tString ret = buf;\n\t\t\tbuf = eof ? \"-1\" : st.nextToken();\n\t\t\treturn ret;\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(nextToken());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(nextToken());\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(nextToken());\n\t\t}\n\n\t\tBigInteger nextBigInteger() {\n\t\t\treturn new BigInteger(nextToken());\n\t\t}\n\n\t\tpublic void close() {\n\t\t\ttry {\n\t\t\t\tbuf = null;\n\t\t\t\tst = null;\n\t\t\t\tcurLine = null;\n\t\t\t\tsuper.close();\n\t\t\t} catch (Exception e) {\n\n\t\t\t}\n\t\t}\n\n\t\tboolean isEOF() {\n\t\t\treturn eof;\n\t\t}\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew C().run();\n\t}\n}", "lang_cluster": "Java", "tags": ["expression parsing"], "code_uid": "d0a96ba3fc53c5cffa12af9db4d469f3", "src_uid": "9d1dd9d722e5fe46823224334b3b208a", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Scanner;\n\npublic class B {\n static long n, k, total = 0;\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n n = in.nextLong();\n k = in.nextLong();\n\n total = (k - 1) * ((k - 1) + 1) / 2;\n if (n > total + 1) {\n System.out.println(-1);\n } else {\n if (n == 1) {\n System.out.println(0);\n } else if (n <= k) {\n System.out.println(1);\n } else {\n long high = k - 1, low = 1, mid = 0;\n for (int i = 0; i < 40; i++) {\n mid = (high + low) / 2;\n if (calculate(mid) >= n) {\n high = mid;\n } else {\n low = mid;\n }\n }\n\n System.out.println(high + 1);\n }\n }\n }\n\n private static long calculate(long x) {\n long m = (k - 1 - x);\n return (total - (m * (m + 1) / 2)) + k - x;\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "binary search"], "code_uid": "230d3fa305b155afd6ab71cfaaba8716", "src_uid": "83bcfe32db302fbae18e8a95d89cf411", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.*;\nimport java.util.*;\n\npublic class Main {\n private static Scanner sc;\n private static Printer pr;\n static long aLong=(long )1e9+7;\n static long Mod=998244353;\n private static void solve() throws IOException {\n //in the name of god\n // you are anything and we are nothing\n //God,i am so tired . I have no one but you\n long x0=sc.nextLong(),y0=sc.nextLong();\n long ax=sc.nextLong(),ay=sc.nextLong();\n long bx=sc.nextLong(),by=sc.nextLong();\n long xs=sc.nextLong(),ys=sc.nextLong(),t=sc.nextLong();\n int maxT=60;\n ArrayList<Long>x=new ArrayList<>();\n ArrayList<Long>y=new ArrayList<>();\n ArrayList<Long>step=new ArrayList<>();\n ArrayList<Long>Pstep=new ArrayList<>();\n x.add(x0);\n y.add(y0);\n for (int i=1;i<maxT;++i){\n if (ax*x.get(i-1)+bx<0||ay*y.get(i-1)+by<0)\n break;\n x.add(ax*x.get(i-1)+bx);\n y.add(ay*y.get(i-1)+by);\n }\n step.add(0l);\n for (int i=1;i<x.size();++i){\n long sum=0;\n sum+=(x.get(i)-x.get(i-1));\n sum+=(y.get(i)-y.get(i-1));\n if (sum>0)\n step.add(sum);\n else\n break;\n }\n Pstep.add(0l);\n for (int i=1;i<step.size();++i) {\n long sum=0;\n sum+=Pstep.get(i-1)+step.get(i);\n if (sum>0)\n Pstep.add(sum);\n else\n break;\n }\n int ans=0;\n for (int i=0;i<Pstep.size();++i) {\n if (Math.abs(xs - x.get(i)) + Math.abs(ys - y.get(i)) <= t)\n ans = 1;\n }\n for (int i=0;i<Pstep.size();++i){\n for (int j=i+1;j<Pstep.size();++j){\n long diff=Pstep.get(j)-Pstep.get(i);\n long diff1=Math.abs(xs-x.get(i))+Math.abs(ys-y.get(i));\n long diff2=Math.abs(xs-x.get(j))+Math.abs(ys-y.get(j));\n long s1=diff+diff1;\n long s2=diff+diff2;\n if (diff>t)\n break;\n if ((s1<=t&&s1>0)||(s2<=t&&s2>0)){\n ans=Math.max(ans,j-i+1);\n }\n }\n }\n pr.println(ans);\n }\n static class point{\n int idx,val;\n public point(int idx, int val) {\n this.idx = idx;\n this.val = val;\n }\n }\n public static int[] radixSort(int[] f) {\n int[] to = new int[f.length];\n {\n int[] b = new int[65537];\n for (int i = 0; i < f.length; i++) b[1 + (f[i] & 0xffff)]++;\n for (int i = 1; i <= 65536; i++) b[i] += b[i - 1];\n for (int i = 0; i < f.length; i++) to[b[f[i] & 0xffff]++] = f[i];\n int[] d = f;\n f = to;\n to = d;\n }\n {\n int[] b = new int[65537];\n for (int i = 0; i < f.length; i++) b[1 + (f[i] >>> 16)]++;\n for (int i = 1; i <= 65536; i++) b[i] += b[i - 1];\n for (int i = 0; i < f.length; i++) to[b[f[i] >>> 16]++] = f[i];\n int[] d = f;\n f = to;\n to = d;\n }\n return f;\n }\n public static long []primeFactor(int n){\n long []prime=new long[n+1];\n prime[1]=1;\n for (int i=2;i<=n;i++)\n prime[i]=((i&1)==0)?2:i;\n for (int i=3;i*i<=n;i++){\n if (prime[i]==i){\n for (int j=i*i;j<=n;j+=i){\n if (prime[j]==j)\n prime[j]=i;\n }\n }\n }\n return prime;\n }\n public static long gcd(long a,long b) {\n if (a == 0) return b;\n return gcd(b % a, a);\n }\n public static void main(String[] args) throws IOException {\n sc = new Scanner(System.in);\n pr = new Printer(System.out);\n solve();\n\n pr.close();\n // sc.close();\n }\n private static class Scanner {\n BufferedReader br;\n\n Scanner (InputStream in) {\n br = new BufferedReader(new InputStreamReader(in));\n }\n\n private boolean isPrintable(int ch) {\n return ch >= '!' && ch <= '~';\n }\n\n private boolean isCRLF(int ch) {\n return ch == '\\n' || ch == '\\r' || ch == -1;\n }\n\n private int nextPrintable() {\n try {\n int ch;\n while (!isPrintable(ch = br.read())) {\n if (ch == -1) {\n throw new NoSuchElementException();\n }\n }\n\n return ch;\n } catch (IOException e) {\n throw new NoSuchElementException();\n }\n }\n\n String next() {\n try {\n int ch = nextPrintable();\n StringBuilder sb = new StringBuilder();\n do {\n sb.appendCodePoint(ch);\n } while (isPrintable(ch = br.read()));\n\n return sb.toString();\n } catch (IOException e) {\n throw new NoSuchElementException();\n }\n }\n\n int nextInt() {\n try {\n // parseInt from Integer.parseInt()\n boolean negative = false;\n int res = 0;\n int limit = -Integer.MAX_VALUE;\n int radix = 10;\n\n int fc = nextPrintable();\n if (fc < '0') {\n if (fc == '-') {\n negative = true;\n limit = Integer.MIN_VALUE;\n } else if (fc != '+') {\n throw new NumberFormatException();\n }\n fc = br.read();\n }\n int multmin = limit / radix;\n\n int ch = fc;\n do {\n int digit = ch - '0';\n if (digit < 0 || digit >= radix) {\n throw new NumberFormatException();\n }\n if (res < multmin) {\n throw new NumberFormatException();\n }\n res *= radix;\n if (res < limit + digit) {\n throw new NumberFormatException();\n }\n res -= digit;\n\n } while (isPrintable(ch = br.read()));\n\n return negative ? res : -res;\n } catch (IOException e) {\n throw new NoSuchElementException();\n }\n }\n\n long nextLong() {\n try {\n // parseLong from Long.parseLong()\n boolean negative = false;\n long res = 0;\n long limit = -Long.MAX_VALUE;\n int radix = 10;\n\n int fc = nextPrintable();\n if (fc < '0') {\n if (fc == '-') {\n negative = true;\n limit = Long.MIN_VALUE;\n } else if (fc != '+') {\n throw new NumberFormatException();\n }\n fc = br.read();\n }\n long multmin = limit / radix;\n\n int ch = fc;\n do {\n int digit = ch - '0';\n if (digit < 0 || digit >= radix) {\n throw new NumberFormatException();\n }\n if (res < multmin) {\n throw new NumberFormatException();\n }\n res *= radix;\n if (res < limit + digit) {\n throw new NumberFormatException();\n }\n res -= digit;\n\n } while (isPrintable(ch = br.read()));\n\n return negative ? res : -res;\n } catch (IOException e) {\n throw new NoSuchElementException();\n }\n }\n\n float nextFloat() {\n return Float.parseFloat(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String nextLine() {\n try {\n int ch;\n while (isCRLF(ch = br.read())) {\n if (ch == -1) {\n throw new NoSuchElementException();\n }\n }\n StringBuilder sb = new StringBuilder();\n do {\n sb.appendCodePoint(ch);\n } while (!isCRLF(ch = br.read()));\n\n return sb.toString();\n } catch (IOException e) {\n throw new NoSuchElementException();\n }\n }\n\n void close() {\n try {\n br.close();\n } catch (IOException e) {\n//\t\t\t\tthrow new NoSuchElementException();\n }\n }\n }\n private static class Printer extends PrintWriter {\n Printer(PrintStream out) {\n super(out);\n }\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "implementation"], "code_uid": "b3f95dab03f2b3b0c4ec2738a837f87e", "src_uid": "d8a7ae2959b3781a8a4566a2f75a4e28", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scanner in = new Scanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n Task1426e solver = new Task1426e();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class Task1426e {\n public void solve(int testNumber, Scanner in, PrintWriter out) {\n int n = in.nextInt();\n int a1 = in.nextInt();\n int a2 = in.nextInt();\n int a3 = in.nextInt();\n int b1 = in.nextInt();\n int b2 = in.nextInt();\n int b3 = in.nextInt();\n int max = Math.min(a1, b2) + Math.min(a2, b3) + Math.min(a3, b1);\n int min = Math.min(a1, b1 + b3) + Math.min(a2, b1 + b2) + Math.min(a3, b2 + b3);\n min = n - min;\n out.println(min + \" \" + max);\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "math", "greedy"], "code_uid": "506519c710bdd5e38c858ec140c9d065", "src_uid": "e6dc3bc64fc66b6127e2b32cacc06402", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Rock_Paper_Scissors {\n public static long mod = 1000000007;\n\n public static void main(String[] args) {\n FastScanner sc = new FastScanner();\n int n = sc.nextInt();\n long a[] = sc.readArrayl(3);\n long b[] = sc.readArrayl(3);\n long max = 0;\n max = Math.min(a[0], b[1]) + Math.min(a[1], b[2]) + Math.min(a[2], b[0]);\n long min = 0;\n min += (a[0] > (b[0] + b[2]) ? -(b[0] + b[2]) + a[0] : 0);\n min += (a[1] > (b[0] + b[1]) ? -(b[0] + b[1]) + a[1] : 0);\n min += (a[2] > (b[1] + b[2]) ? -(b[1] + b[2]) + a[2] : 0);\n System.out.println(min + \" \" + max);\n\n }\n\n static final Random random = new Random();\n\n static void sort(int[] a) {\n int n = a.length;\n for (int i = 0; i < n; i++) {\n int val = random.nextInt(n);\n int cur = a[i];\n a[i] = a[val];\n a[val] = cur;\n }\n Arrays.sort(a);\n }\n\n static void sortl(long[] a) {\n int n = a.length;\n for (int i = 0; i < n; i++) {\n int val = random.nextInt(n);\n long cur = a[i];\n a[i] = a[val];\n a[val] = cur;\n }\n Arrays.sort(a);\n }\n\n static class FastScanner {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st = new StringTokenizer(\"\");\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n int[] readArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = nextInt();\n return a;\n }\n\n long[] readArrayl(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nextLong();\n return a;\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n }\n\n}\n", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "math", "greedy"], "code_uid": "8a1e266db01592438e329e1154edba84", "src_uid": "e6dc3bc64fc66b6127e2b32cacc06402", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\n\npublic class e{\n\tpublic static void main(String[] args) {\n\t\tScanner s = new Scanner(System.in);\n\t\tint t = 1;\n\t\twhile(t-->0){\n\t\t\tint n = s.nextInt();\n\t\t\tint a[] = new int[3];\n\t\t\tint b[] = new int[3];\n\t\t\tfor(int i=0;i<3;i++){\n\t\t\t\ta[i] = s.nextInt();\n\t\t\t}\n\t\t\tfor(int i=0;i<3;i++){\n\t\t\t\tb[i] = s.nextInt();\n\t\t\t}\n\t\t\tint sum = 0;\n\t\t\tfor(int i=0;i<3;i++){\n\t\t\t\tsum += Math.min(a[i],b[i]+b[(i+2)%3]);\n\t\t\t}\n\t\t\tSystem.out.print((n-sum)+\" \");\n\t\t\tsum = 0;\n\t\t\tfor(int i=0;i<3;i++){\n\t\t\t\tsum += Math.min(a[i],b[(i+1)%3]);\n\t\t\t}\n\t\t\tSystem.out.println(sum);\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "math", "greedy"], "code_uid": "c74ddbd939c6e184704bed3a6d8306b1", "src_uid": "e6dc3bc64fc66b6127e2b32cacc06402", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*; \nimport java.lang.*; \nimport java.io.*;\n\npublic class first {\nPrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\nBufferedReader in = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer tok;\n public int gcd(int a,int b)\n {\n \tif(b==0) return a;\n \treturn gcd(b,a%b);\n }\n\tpublic void go() throws IOException\n\t{\n\t\t\tString test = in.readLine(); \n\t\t\tif(test==null || test.trim().length()==0 )\n\t\t\t\treturn ;\n\t\t\t\n\t\t\ttok = new StringTokenizer(test);\n\t\t\tint tt = Integer.parseInt(tok.nextToken()); \n\t\t\tntok();\n\t\t\tint n=tt;\n\t\t\tint a[]=iapar(3);\n\t\t\tntok();\n\t\t\tint b[]=iapar(3);\n\t\t\tint alicemax=0,bobmax=0;\n\t\t\tif(a[0]!=0)\n\t\t\t{\n\t\t\t\talicemax+=Math.min(a[0], b[1]);\n\t\t\t}\n\t\t\tif(a[1]!=0)\n\t\t\t{\n\t\t\t\talicemax+=Math.min(a[1], b[2]);\n\t\t\t}\n\t\t\tif(a[2]!=0)\n\t\t\t{\n\t\t\t\talicemax+=Math.min(a[2], b[0]);\n\t\t\t}\n\t\t\tif(b[0]!=0)\n\t\t\t{\n\t\t\t\tbobmax+=Math.min(b[0], a[1]);\n\t\t\t\tb[0]-=Math.min(b[0], a[1]);\n\t\t\t\tif(b[0]!=0)\n\t\t\t\t bobmax+=Math.min(b[0], a[0]);\n\t\t\t}\n\t\t\tif(a[1]!=0)\n\t\t\t{\n\t\t\t\tbobmax+=Math.min(b[1], a[2]);\n\t\t\t\tb[1]-=Math.min(b[1], a[2]);\n\t\t\t\tif(b[1]!=0)\n\t\t\t\t bobmax+=Math.min(b[1], a[1]);\n\t\t\t}\n\t\t\tif(a[2]!=0)\n\t\t\t{\n\t\t\t\tbobmax+=Math.min(b[2], a[0]);\n\t\t\t\tb[2]-=Math.min(b[2], a[0]);\n\t\t\t\tif(b[2]!=0)\n\t\t\t\t bobmax+=Math.min(b[2], a[2]);\n\t\t\t}\n\t\t\t//System.out.println(bobmax);\n\t\t\tSystem.out.println((n-bobmax)+\" \"+alicemax);\n\t\t\t\n\t\n\t\t\t\n\t\t\t\n//\t\t\tfor (int t = 0; t < tt; t++)\n//\t\t\t{\n//\t\t\t \n//\t\t\t\t\t\n//\t\t\t}\n\t\t\tout.flush();\n\t\t\tin.close(); \n\t}\n\t\n\tpublic void ntok() throws IOException\n\t\t{ String test = in.readLine(); \n\t\t\tif(test==null || test.trim().length()==0 )\n\t\t\t\treturn ;\n\t\t\ttok = new StringTokenizer(test);\n\t}\n\t\n\tpublic int ipar()\n\t{ \n\t\tString test=tok.nextToken();\n\t\tif(test==null || test.trim().length()==0) \n\t\t\treturn 0;\n\t\treturn Integer.parseInt(test); \n\t}\n\t\n\tpublic int[] iapar(int n) \n\t{\n\t\tint[] arr = new int[n]; \n\t\tfor (int i = 0; i < n; i++) \n\t\t{\n\t\t\tarr[i] = ipar(); \n\t\t}\n\t\treturn arr; \n\t}\n\t\n\t\n\tpublic long lpar()\n\t{ \t\n\t\tString test=tok.nextToken();\n\t\n\t\tif(test==null || test.trim().length()==0) \n\t\t\treturn 0;\n\t\treturn Long.parseLong(test); \n\t}\n\t\n\tpublic long[] lapar(int n) \n\t{\n\t\tlong[] arr = new long[n]; \n\t\t\n\t\tfor (int i = 0; i < n; i++)\n\t\t{\n\t arr[i] = lpar(); \n\t\t}\n\t\treturn arr; \n\t}\n\n\tpublic double dpar() \n\t{\n\t\treturn Double.parseDouble(tok.nextToken());\n\t}\n\t\n\tpublic String spar()\n\t\t{ \tString test=tok.nextToken();\n\t\t\tif(test==null || test.trim().length()==0) \n\t\t\t\treturn \"\";\n\t\t\t\n\t\t\treturn test;\n\t\t}\n\t\n\tpublic static void main(String[] args) throws IOException\n\t{\n\t\tnew first().go(); \n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "math", "greedy"], "code_uid": "70adc869fd40874e9f825a51be100642", "src_uid": "e6dc3bc64fc66b6127e2b32cacc06402", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.lang.reflect.Array;\nimport java.util.*;\n\npublic class E {\n static class FastReader {\n BufferedReader br;\n StringTokenizer st;\n\n public FastReader() {\n br = new BufferedReader(new\n InputStreamReader(System.in));\n }\n\n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n }\n\n static FastReader s = new FastReader();\n static PrintWriter out = new PrintWriter(System.out);\n\n private static int[] rai(int n) {\n int[] arr = new int[n];\n for (int i = 0; i < n; i++) {\n arr[i] = s.nextInt();\n }\n return arr;\n }\n\n private static int[][] rai(int n, int m) {\n int[][] arr = new int[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n arr[i][j] = s.nextInt();\n }\n }\n return arr;\n }\n\n private static long[] ral(int n) {\n long[] arr = new long[n];\n for (int i = 0; i < n; i++) {\n arr[i] = s.nextLong();\n }\n return arr;\n }\n\n private static long[][] ral(int n, int m) {\n long[][] arr = new long[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n arr[i][j] = s.nextLong();\n }\n }\n return arr;\n }\n\n private static int ri() {\n return s.nextInt();\n }\n\n private static long rl() {\n return s.nextLong();\n }\n\n private static String rs() {\n return s.next();\n }\n\n static int gcd(int a, int b) {\n if (b == 0) {\n return a;\n }\n return gcd(b, a % b);\n }\n\n static int bsearch(List<Long> list,long val,int ind)\n {\n int l=ind,r=list.size()-1;\n int res=list.size();\n\n while(l<=r)\n {\n int mid=(l+r)/2;\n if(list.get(mid)>val)\n {\n if(mid==0)\n {\n return mid;\n }\n if(list.get(mid-1)<=val)\n {\n return mid;\n }\n r=mid-1;\n }\n else\n {\n l=mid+1;\n }\n }\n return res;\n\n }\n\n static long calc(List<Node> list,long[] b,int i)\n {\n if(i==3)\n {\n return 0;\n }\n\n\n //bInd\n Node first = list.get(i);\n int bInd = (first.ind - 1);\n if(bInd==-1)\n {\n bInd=2;\n }\n\n\n long min1 = Math.min(first.val, b[bInd]);\n first.val -= min1;\n b[bInd] -= min1;\n\n\n long min2 = Math.min(first.val, b[first.ind]);\n first.val -= min2;\n b[first.ind] -= min2;\n long sum = first.val;\n sum+=calc(list,b,i+1);\n first.val+=min1+min2;\n b[bInd]+=min1;\n b[first.ind]+=min2;\n\n\n\n //first.ind\n\n first = list.get(i);\n bInd = (first.ind - 1);\n if(bInd==-1)\n {\n bInd=2;\n }\n\n min1 = Math.min(first.val, b[first.ind]);\n first.val -= min1;\n b[first.ind] -= min1;\n\n\n min2 = Math.min(first.val, b[bInd]);\n first.val -= min2;\n b[bInd] -= min2;\n long sum2 = first.val;\n sum2+=calc(list,b,i+1);\n first.val+=min1+min2;\n b[bInd]+=min2;\n b[first.ind]+=min1;\n\n return Math.min(sum,sum2);\n }\n public static void main(String[] args) {\n StringBuilder ans = new StringBuilder();\n// int t = ri();\n int t = 1;\n while (t-- > 0) {\n int n=ri();\n long[] a=ral(3);\n long[] b=ral(3);\n\n long max=Math.min(a[0],b[1])+Math.min(a[1],b[2])+Math.min(a[2],b[0]);\n long min=Math.max(0,a[0]+b[1]-n)+Math.max(0,a[1]+b[2]-n)+Math.max(0,a[2]+b[0]-n);\n ans.append(min).append(\" \").append(max).append(\"\\n\");\n\n// List<Node> list=new ArrayList<>();\n// for(int i=0;i<3;i++)\n// {\n// list.add(new Node(i,b[i]));\n//\n// }\n// list.sort(new Comparator<Node>() {\n// @Override\n// public int compare(Node o1, Node o2) {\n// return (int)(o2.val-o1.val);\n// }\n// });\n//\n////\n// ans.append(calc(list,b,0)).append(\" \").append(max).append(\"\\n\");\n//\n//\n//\n// //second\n//// first=list.get(1);\n//// bInd=(second.ind+1)%3;\n//// min=Math.min(second.val,b[bInd]);\n//// second.val\n }\n out.print(ans.toString());\n out.flush();\n\n }\n static class Node\n {\n int ind;\n long val;\n\n public Node(int ind, long val) {\n this.ind = ind;\n this.val = val;\n }\n }\n\n\n}\n\n\n", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "math", "greedy"], "code_uid": "f4947a9aaddf6b43c83725cf20b12efa", "src_uid": "e6dc3bc64fc66b6127e2b32cacc06402", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class _1426_E {\n\tpublic static void main(String[] args) throws Exception {\n\t\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tint n = Integer.parseInt(in.readLine());\n\t\tint[] a = new int[3];\n\t\tint[] b = new int[3];\n\t\tStringTokenizer line = new StringTokenizer(in.readLine());\n\t\tfor(int i = 0; i < 3; i++) {\n\t\t\ta[i] = Integer.parseInt(line.nextToken());\n\t\t}\n\t\tline = new StringTokenizer(in.readLine());\n\t\tfor(int i = 0; i < 3; i++) {\n\t\t\tb[i] = Integer.parseInt(line.nextToken());\n\t\t}\n\t\tint max = Math.min(a[0], b[1]) + Math.min(a[1], b[2]) + Math.min(a[2], b[0]);\t\n\t\tint min = 0;\n\t\tint leftover = 0;\n\t\tif(a[0] >= b[0] + b[2]) {\n\t\t\tmin += b[0] + b[2];\n\t\t}else {\n\t\t\tmin += a[0];\n\t\t\tleftover = b[0] + b[2] - a[0];\n\t\t}\n\t\tint scissorsleft = 0;\n\t\tint provide = Math.min(b[0], leftover);\n\t\tif(provide >= a[1]) {\n\t\t\tmin += a[1];\n\t\t\tleftover -= a[1];\n\t\t\tscissorsleft = b[1];\n\t\t}else {\n\t\t\tmin += provide;\n\t\t\tleftover -= provide;\n\t\t\tint need = a[1] - provide;\n\t\t\tif(b[1] >= need) {\n\t\t\t\tscissorsleft = b[1] - need;\n\t\t\t\tmin += need;\n\t\t\t}else {\n\t\t\t\tmin += b[1];\n\t\t\t}\n\t\t}\n\t\tmin += Math.min(a[2], scissorsleft + Math.min(leftover, b[2]));\n\t\tmin = n - min;\n\t\tout.println(min + \" \" + max);\n\t\tin.close();\n\t\tout.close();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "math", "greedy"], "code_uid": "09ba90842ea6eb7b2410aebc228384b4", "src_uid": "e6dc3bc64fc66b6127e2b32cacc06402", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.Collections;\nimport java.util.ArrayList;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Jaynil\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n ERockPaperScissors solver = new ERockPaperScissors();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class ERockPaperScissors {\n int min;\n\n public void check(ArrayList<int[]> aa, int a[], int b[]) {\n for (int i = 0; i < aa.size(); i++) {\n int m = Math.min(a[aa.get(i)[0]], b[aa.get(i)[1]]);\n b[aa.get(i)[1]] -= m;\n a[aa.get(i)[0]] -= m;\n }\n int curr = 0;\n for (int i = 0; i < 3; i++) curr += a[i];\n min = Math.min(min, curr);\n }\n\n public void per(ArrayList<int[]> aa, int index, int a[], int b[]) {\n check(aa, a.clone(), b.clone());\n for (int i = index; i < aa.size(); i++) {\n Collections.swap(aa, i, index);\n per(aa, index + 1, a, b);\n Collections.swap(aa, i, index);\n }\n }\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.nextInt();\n int a[] = new int[3];\n int b[] = new int[3];\n min = Integer.MAX_VALUE;\n int max = 0;\n for (int i = 0; i < 3; i++) {\n a[i] = in.nextInt();\n }\n for (int i = 0; i < 3; i++) {\n b[i] = in.nextInt();\n }\n max = Math.min(a[0], b[1]) + Math.min(a[1], b[2]) + Math.min(a[2], b[0]);\n ArrayList<int[]> aa = new ArrayList<>();\n aa.add(new int[]{0, 0});\n aa.add(new int[]{1, 1});\n aa.add(new int[]{2, 2});\n aa.add(new int[]{0, 2});\n aa.add(new int[]{1, 0});\n aa.add(new int[]{2, 1});\n per(aa, 0, a, b);\n out.println(min + \" \" + max);\n }\n\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "math", "greedy"], "code_uid": "05b3ce42c3682b7659e058f56a1d373b", "src_uid": "e6dc3bc64fc66b6127e2b32cacc06402", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\npublic class codeforce\n{\n public static void main(String[] args)\n {\n Scanner sc=new Scanner(System.in);\n int n=sc.nextInt();\n int[] arr=new int[3];\n int[] brr=new int[3];\n int i=0;\n for(i=0;i<3;i++)\n {\n arr[i]=sc.nextInt();\n }\n for(i=0;i<3;i++)\n {\n brr[i]=sc.nextInt();\n }\n int max=0,min=0;\n if(arr[0]>=brr[1])\n {\n max+=brr[1];\n }\n else\n {\n max+=arr[0];\n }\n\n if(arr[1]>=brr[2])\n {\n max+=brr[2];\n }\n else\n {\n max+=arr[1];\n }\n\n if(arr[2]>=brr[0])\n {\n max+=brr[0];\n }\n else\n {\n max+=arr[2];\n }\n \n if(arr[0]>brr[0]+brr[2])\n {\n min+=arr[0]-(brr[0]+brr[2]);\n }\n if(arr[1]>brr[1]+brr[0])\n {\n min+=arr[1]-(brr[0]+brr[1]);\n }\n if(arr[2]>brr[1]+brr[2])\n {\n min+=arr[2]-(brr[1]+brr[2]);\n }\n System.out.println(min+\" \"+max);\n }\n\n}", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "math", "greedy"], "code_uid": "277da83c347cf12f1df692b1e265ea32", "src_uid": "e6dc3bc64fc66b6127e2b32cacc06402", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "/*\n Author: Anthony Ngene\n Created: 28/09/2020 - 10:42\n*/\n\nimport java.io.*;\nimport java.util.*;\n\npublic class E {\n// checks: 1. edge cases 2. overflow 3. possible errors (e.g 1/0, arr[out]) 4. time/space complexity\n void solver() throws IOException {\n long n = in.intNext();\n long[] ar = in.nextLongArray(3);\n long[] br = in.nextLongArray(3);\n long mxWins = 0;\n long mxLosesOrDraw = 0;\n long draws = 0;\n for (int i = 0; i < 3; i++) {\n mxWins += min(ar[i], br[(i + 1) % 3]);\n long mxLose = min(br[i], ar[(i + 1) % 3]);\n long mxDraw = min(br[i], ar[i]);\n mxLosesOrDraw += min(br[i], mxLose + mxDraw);\n\n }\n out.pp(n - mxLosesOrDraw, mxWins);\n }\n\n\n// Generated Code Below:\nprivate static final FastWriter out = new FastWriter();\nprivate static FastScanner in;\nstatic ArrayList<Integer>[] adj;\nprivate static long e97 = (long)1e9 + 7;\npublic static void main(String[] args) throws IOException {\n in = new FastScanner();\n new E().solver();\n out.close();\n}\n\nstatic class FastWriter {\n private static final int IO_BUFFERS = 128 * 1024;\n private final StringBuilder out;\n public FastWriter() { out = new StringBuilder(IO_BUFFERS); }\n public FastWriter p(Object object) { out.append(object); return this; }\n public FastWriter p(String format, Object... args) { out.append(String.format(format, args)); return this; }\n public FastWriter pp(Object... args) { for (Object ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }\n public FastWriter pp(int[] args) { for (int ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }\n public FastWriter pp(long[] args) { for (long ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }\n public FastWriter pp(char[] args) { for (char ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }\n public void println(long[] arr) { for(long e: arr) out.append(e).append(\" \"); out.append(\"\\n\"); }\n public void println(int[] arr) { for(int e: arr) out.append(e).append(\" \"); out.append(\"\\n\"); }\n public void println(char[] arr) { for(char e: arr) out.append(e).append(\" \"); out.append(\"\\n\"); }\n public void println(double[] arr) { for(double e: arr) out.append(e).append(\" \"); out.append(\"\\n\"); }\n public void println(boolean[] arr) { for(boolean e: arr) out.append(e).append(\" \"); out.append(\"\\n\"); }\n public <T>void println(T[] arr) { for(T e: arr) out.append(e).append(\" \"); out.append(\"\\n\"); }\n public void println(long[][] arr) { for (long[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public void println(int[][] arr) { for (int[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public void println(char[][] arr) { for (char[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public void println(double[][] arr) { for (double[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public <T>void println(T[][] arr) { for (T[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public FastWriter println(Object object) { out.append(object).append(\"\\n\"); return this; }\n public void toFile(String fileName) throws IOException {\n BufferedWriter writer = new BufferedWriter(new FileWriter(fileName));\n writer.write(out.toString());\n writer.close();\n }\n public void close() throws IOException { System.out.print(out); }\n}\nstatic class FastScanner {\n private InputStream sin = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n public FastScanner(){}\n public FastScanner(String filename) throws FileNotFoundException {\n File file = new File(filename);\n sin = new FileInputStream(file);\n }\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = sin.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long longNext() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b) || b == ':'){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int intNext() {\n long nl = longNext();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double doubleNext() { return Double.parseDouble(next());}\n public long[] nextLongArray(final int n){\n final long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = longNext();\n return a;\n }\n public int[] nextIntArray(final int n){\n final int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = intNext();\n return a;\n }\n public double[] nextDoubleArray(final int n){\n final double[] a = new double[n];\n for (int i = 0; i < n; i++)\n a[i] = doubleNext();\n return a;\n }\n public ArrayList<Integer>[] getAdj(int n) {\n ArrayList<Integer>[] adj = new ArrayList[n + 1];\n for (int i = 1; i <= n; i++) adj[i] = new ArrayList<>();\n return adj;\n }\n public ArrayList<Integer>[] adjacencyList(int nodes, int edges) throws IOException {\n return adjacencyList(nodes, edges, false);\n }\n public ArrayList<Integer>[] adjacencyList(int nodes, int edges, boolean isDirected) throws IOException {\n adj = getAdj(nodes);\n for (int i = 0; i < edges; i++) {\n int a = intNext(), b = intNext();\n adj[a].add(b);\n if (!isDirected) adj[b].add(a);\n }\n return adj;\n }\n}\nstatic class u {\n public static int upperBound(long[] array, long obj) {\n int l = 0, r = array.length - 1;\n while (r - l >= 0) {\n int c = (l + r) / 2;\n if (obj < array[c]) {\n r = c - 1;\n } else {\n l = c + 1;\n }\n }\n return l;\n }\n public static int upperBound(ArrayList<Long> array, long obj) {\n int l = 0, r = array.size() - 1;\n while (r - l >= 0) {\n int c = (l + r) / 2;\n if (obj < array.get(c)) {\n r = c - 1;\n } else {\n l = c + 1;\n }\n }\n return l;\n }\n public static int lowerBound(long[] array, long obj) {\n int l = 0, r = array.length - 1;\n while (r - l >= 0) {\n int c = (l + r) / 2;\n if (obj <= array[c]) {\n r = c - 1;\n } else {\n l = c + 1;\n }\n }\n return l;\n }\n public static int lowerBound(ArrayList<Long> array, long obj) {\n int l = 0, r = array.size() - 1;\n while (r - l >= 0) {\n int c = (l + r) / 2;\n if (obj <= array.get(c)) {\n r = c - 1;\n } else {\n l = c + 1;\n }\n }\n return l;\n }\n static <T> T[][] deepCopy(T[][] matrix) { return Arrays.stream(matrix).map(el -> el.clone()).toArray($ -> matrix.clone()); }\n static int[][] deepCopy(int[][] matrix) { return Arrays.stream(matrix).map(int[]::clone).toArray($ -> matrix.clone()); }\n static long[][] deepCopy(long[][] matrix) { return Arrays.stream(matrix).map(long[]::clone).toArray($ -> matrix.clone()); }\n private static void sort(int[][] arr){ Arrays.sort(arr, Comparator.comparingDouble(o -> o[0])); }\n private static void sort(long[][] arr){ Arrays.sort(arr, Comparator.comparingDouble(o -> o[0])); }\n private static <T>void rSort(T[] arr) { Arrays.sort(arr, Collections.reverseOrder()); }\n private static void customSort(int[][] arr) {\n Arrays.sort(arr, new Comparator<int[]>() {\n public int compare(int[] a, int[] b) {\n if (a[0] == b[0]) return Integer.compare(a[1], b[1]);\n return Integer.compare(a[0], b[0]);\n }\n });\n }\n public static int[] swap(int[] arr, int left, int right) {\n int temp = arr[left];\n arr[left] = arr[right];\n arr[right] = temp;\n return arr;\n }\n public static char[] swap(char[] arr, int left, int right) {\n char temp = arr[left];\n arr[left] = arr[right];\n arr[right] = temp;\n return arr;\n }\n public static int[] reverse(int[] arr, int left, int right) {\n while (left < right) {\n int temp = arr[left];\n arr[left++] = arr[right];\n arr[right--] = temp;\n }\n return arr;\n }\n public static boolean findNextPermutation(int[] data) {\n if (data.length <= 1) return false;\n int last = data.length - 2;\n while (last >= 0) {\n if (data[last] < data[last + 1]) break;\n last--;\n }\n if (last < 0) return false;\n int nextGreater = data.length - 1;\n for (int i = data.length - 1; i > last; i--) {\n if (data[i] > data[last]) {\n nextGreater = i;\n break;\n }\n }\n data = swap(data, nextGreater, last);\n data = reverse(data, last + 1, data.length - 1);\n return true;\n }\n public static int biSearch(int[] dt, int target){\n int left=0, right=dt.length-1;\n int mid=-1;\n while(left<=right){\n mid = (right+left)/2;\n if(dt[mid] == target) return mid;\n if(dt[mid] < target) left=mid+1;\n else right=mid-1;\n }\n return -1;\n }\n public static int biSearchMax(long[] dt, long target){\n int left=-1, right=dt.length;\n int mid=-1;\n\n while((right-left)>1){\n mid = left + (right-left)/2;\n if(dt[mid] <= target) left=mid;\n else right=mid;\n }\n return left;\n }\n public static int biSearchMaxAL(ArrayList<Integer> dt, long target){\n int left=-1, right=dt.size();\n int mid=-1;\n\n while((right-left)>1){\n mid = left + (right-left)/2;\n if(dt.get(mid) <= target) left=mid;\n else right=mid;\n }\n return left;\n }\n private static <T>void fill(T[][] ob, T res){for(int i=0;i<ob.length; i++){ for(int j=0; j<ob[0].length; j++){ ob[i][j] = res; }}}\n private static void fill(boolean[][] ob,boolean res){for(int i=0;i<ob.length; i++){ for(int j=0; j<ob[0].length; j++){ ob[i][j] = res; }}}\n private static void fill(int[][] ob, int res){ for(int i=0; i<ob.length; i++){ for(int j=0; j<ob[0].length; j++){ ob[i][j] = res; }}}\n private static void fill(long[][] ob, long res){ for(int i=0; i<ob.length; i++){ for(int j=0; j<ob[0].length; j++){ ob[i][j] = res; }}}\n private static void fill(char[][] ob, char res){ for(int i=0; i<ob.length; i++){ for(int j=0; j<ob[0].length; j++){ ob[i][j] = res; }}}\n private static void fill(double[][] ob, double res){for(int i=0; i<ob.length; i++){ for(int j=0; j<ob[0].length; j++){ ob[i][j] = res; }}}\n private static void fill(int[][][] ob,int res){for(int i=0;i<ob.length;i++){for(int j=0;j<ob[0].length;j++){for(int k=0;k<ob[0][0].length;k++){ob[i][j][k]=res;}}}}\n private static void fill(long[][][] ob,long res){for(int i=0;i<ob.length;i++){for(int j=0;j<ob[0].length;j++){for(int k=0;k<ob[0][0].length;k++){ob[i][j][k]=res;}}}}\n private static <T>void fill(T[][][] ob,T res){for(int i=0;i<ob.length;i++){for(int j=0;j<ob[0].length;j++){for(int k=0;k<ob[0][0].length;k++){ob[i][j][k]=res;}}}}\n private static void fill_parent(int[] ob){ for(int i=0; i<ob.length; i++) ob[i]=i; }\n private static boolean same3(long a, long b, long c){\n if(a!=b) return false;\n if(b!=c) return false;\n if(c!=a) return false;\n return true;\n }\n private static boolean dif3(long a, long b, long c){\n if(a==b) return false;\n if(b==c) return false;\n if(c==a) return false;\n return true;\n }\n private static double hypotenuse(double a, double b){\n return Math.sqrt(a*a+b*b);\n }\n private static long factorial(int n) {\n long ans=1;\n for(long i=n; i>0; i--){ ans*=i; }\n return ans;\n }\n private static long facMod(int n, long mod) {\n long ans=1;\n for(long i=n; i>0; i--) ans = (ans * i) % mod;\n return ans;\n }\n private static long lcm(long m, long n){\n long ans = m/gcd(m,n);\n ans *= n;\n return ans;\n }\n private static long gcd(long m, long n) {\n if(m < n) return gcd(n, m);\n if(n == 0) return m;\n return gcd(n, m % n);\n }\n private static boolean isPrime(long a){\n if(a==1) return false;\n for(int i=2; i<=Math.sqrt(a); i++){ if(a%i == 0) return false; }\n return true;\n }\n static long modInverse(long a, long mod) {\n /* Fermat's little theorem: a^(MOD-1) => 1\n Therefore (divide both sides by a): a^(MOD-2) => a^(-1) */\n return binpowMod(a, mod - 2, mod);\n }\n static long binpowMod(long a, long b, long mod) {\n long res = 1;\n while (b > 0) {\n if (b % 2 == 1) res = (res * a) % mod;\n a = (a * a) % mod;\n b /= 2;\n }\n return res;\n }\n private static int getDigit2(long num){\n long cf = 1; int d=0;\n while(num >= cf){ d++; cf = 1<<d; }\n return d;\n }\n private static int getDigit10(long num){\n long cf = 1; int d=0;\n while(num >= cf){ d++; cf*=10; }\n return d;\n }\n private static boolean isInArea(int y, int x, int h, int w){\n if(y<0) return false;\n if(x<0) return false;\n if(y>=h) return false;\n if(x>=w) return false;\n return true;\n }\n private static ArrayList<Integer> generatePrimes(int n) {\n int[] lp = new int[n + 1];\n ArrayList<Integer> pr = new ArrayList<>();\n for (int i = 2; i <= n; ++i) {\n if (lp[i] == 0) {\n lp[i] = i;\n pr.add(i);\n }\n for (int j = 0; j < pr.size() && pr.get(j) <= lp[i] && i * pr.get(j) <= n; ++j) {\n lp[i * pr.get(j)] = pr.get(j);\n }\n }\n return pr;\n }\n static long nPrMod(int n, int r, long MOD) {\n long res = 1;\n for (int i = (n - r + 1); i <= n; i++) {\n res = (res * i) % MOD;\n }\n return res;\n }\n static long nCr(int n, int r) {\n if (r > (n - r))\n r = n - r;\n long ans = 1;\n for (int i = 1; i <= r; i++) {\n ans *= n;\n ans /= i;\n n--;\n }\n return ans;\n }\n static long nCrMod(int n, int r, long MOD) {\n long rFactorial = nPrMod(r, r, MOD);\n long first = nPrMod(n, r, MOD);\n long second = binpowMod(rFactorial, MOD-2, MOD);\n return (first * second) % MOD;\n }\n static void printBitRepr(int n) {\n StringBuilder res = new StringBuilder();\n for (int i = 0; i < 32; i++) {\n int mask = (1 << i);\n res.append((mask & n) == 0 ? \"0\" : \"1\");\n }\n out.println(res);\n }\n static String bitString(int n) {return Integer.toBinaryString(n);}\n static int setKthBitToOne(int n, int k) { return (n | (1 << k)); } // zero indexed\n static int setKthBitToZero(int n, int k) { return (n & ~(1 << k)); }\n static int invertKthBit(int n, int k) { return (n ^ (1 << k)); }\n static boolean isPowerOfTwo(int n) { return (n & (n - 1)) == 0; }\n static HashMap<Character, Integer> counts(String word) {\n HashMap<Character, Integer> counts = new HashMap<>();\n for (int i = 0; i < word.length(); i++) counts.merge(word.charAt(i), 1, Integer::sum);\n return counts;\n }\n static HashMap<Integer, Integer> counts(int[] arr) {\n HashMap<Integer, Integer> counts = new HashMap<>();\n for (int value : arr) counts.merge(value, 1, Integer::sum);\n return counts;\n }\n static HashMap<Long, Integer> counts(long[] arr) {\n HashMap<Long, Integer> counts = new HashMap<>();\n for (long l : arr) counts.merge(l, 1, Integer::sum);\n return counts;\n }\n static HashMap<Character, Integer> counts(char[] arr) {\n HashMap<Character, Integer> counts = new HashMap<>();\n for (char c : arr) counts.merge(c, 1, Integer::sum);\n return counts;\n }\n static long hash(int x, int y) {\n return x* 1_000_000_000L +y;\n }\n static final Random random = new Random();\n static void sort(int[] a) {\n int n = a.length;// shuffle, then sort\n for (int i = 0; i < n; i++) {\n int oi = random.nextInt(n), temp = a[oi];\n a[oi] = a[i];\n a[i] = temp;\n }\n Arrays.sort(a);\n }\n static void sort(long[] arr) {\n shuffleArray(arr);\n Arrays.sort(arr);\n }\n static void shuffleArray(long[] arr) {\n int n = arr.length;\n for(int i=0; i<n; ++i){\n long tmp = arr[i];\n int randomPos = i + random.nextInt(n-i);\n arr[i] = arr[randomPos];\n arr[randomPos] = tmp;\n }\n }\n}\nstatic class Tuple implements Comparable<Tuple> {\n int a;\n int b;\n int c;\n public Tuple(int a, int b) {\n this.a = a;\n this.b = b;\n this.c = 0;\n }\n public Tuple(int a, int b, int c) {\n this.a = a;\n this.b = b;\n this.c = c;\n }\n public int getA() { return a; }\n public int getB() { return b; }\n public int getC() { return c; }\n public int compareTo(Tuple other) {\n if (this.a == other.a) {\n if (this.b == other.b) return Long.compare(this.c, other.c);\n return Long.compare(this.b, other.b);\n }\n return Long.compare(this.a, other.a);\n }\n @Override\n public int hashCode() { return Arrays.deepHashCode(new Integer[]{a, b, c}); }\n @Override\n public boolean equals(Object o) {\n if (!(o instanceof Tuple)) return false;\n Tuple pairo = (Tuple) o;\n return (this.a == pairo.a && this.b == pairo.b && this.c == pairo.c);\n }\n @Override\n public String toString() { return String.format(\"(%d %d %d) \", this.a, this.b, this.c); }\n}\nprivate static int abs(int a){ return (a>=0) ? a: -a; }\nprivate static int min(int... ins){ int min = ins[0]; for(int i=1; i<ins.length; i++){ if(ins[i] < min) min = ins[i]; } return min; }\nprivate static int max(int... ins){ int max = ins[0]; for(int i=1; i<ins.length; i++){ if(ins[i] > max) max = ins[i]; } return max; }\nprivate static int sum(int... ins){ int total = 0; for (int v : ins) { total += v; } return total; }\nprivate static long abs(long a){ return (a>=0) ? a: -a; }\nprivate static long min(long... ins){ long min = ins[0]; for(int i=1; i<ins.length; i++){ if(ins[i] < min) min = ins[i]; } return min; }\nprivate static long max(long... ins){ long max = ins[0]; for(int i=1; i<ins.length; i++){ if(ins[i] > max) max = ins[i]; } return max; }\nprivate static long sum(long... ins){ long total = 0; for (long v : ins) { total += v; } return total; }\nprivate static double abs(double a){ return (a>=0) ? a: -a; }\nprivate static double min(double... ins){ double min = ins[0]; for(int i=1; i<ins.length; i++){ if(ins[i] < min) min = ins[i]; } return min; }\nprivate static double max(double... ins){ double max = ins[0]; for(int i=1; i<ins.length; i++){ if(ins[i] > max) max = ins[i]; } return max; }\nprivate static double sum(double... ins){ double total = 0; for (double v : ins) { total += v; } return total; }\n\n}\n", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "math", "greedy"], "code_uid": "ce1be6b167ce88790fbf9c2c9df85b6c", "src_uid": "e6dc3bc64fc66b6127e2b32cacc06402", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n \npublic class Main {\n public static void main(String[] args) throws Exception {\n FastScanner sc = new FastScanner(System.in);\n PrintWriter pw = new PrintWriter(System.out);\n int n = sc.nextInt();\n int[] a = sc.nextIntArray(3);\n int[] b = sc.nextIntArray(3);\n int min = Math.max(0,a[0]-b[0]-b[2]) + Math.max(0,a[1]-b[0]-b[1]) + Math.max(0,a[2]-b[1]-b[2]);\n int max = Math.min(a[0],b[1]) + Math.min(a[1],b[2]) + Math.min(a[2],b[0]);\n pw.println(min + \" \" + max);\n pw.flush();\n }\n\n static class GeekInteger {\n public static void save_sort(int[] array) {\n shuffle(array);\n Arrays.sort(array);\n }\n \n public static int[] shuffle(int[] array) {\n int n = array.length;\n Random random = new Random();\n for (int i = 0, j; i < n; i++) {\n j = i + random.nextInt(n - i);\n int randomElement = array[j];\n array[j] = array[i];\n array[i] = randomElement;\n }\n return array;\n }\n \n }\n}\n\nclass FastScanner {\n private BufferedReader reader = null;\n private StringTokenizer tokenizer = null;\n public FastScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n tokenizer = null;\n }\n\n public String next() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public String nextLine() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n return reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken(\"\\n\");\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n \n public String[] nextArray(int n) {\n String[] a = new String[n];\n for (int i = 0; i < n; i++)\n a[i] = next();\n return a;\n }\n\n public int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = nextInt();\n return a;\n }\n\n public long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nextLong();\n return a;\n } \n}\n", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "math", "greedy"], "code_uid": "f2f07987e89672a0a04f0c1e6185a865", "src_uid": "e6dc3bc64fc66b6127e2b32cacc06402", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class E {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tReader sc=new Reader();\n\t\tPrint pr=new Print();\n\t\tint t=1;\n\t\twhile(t-->0) {\n\t\t\tint n=sc.nextInt();\n int a1=sc.nextInt();\n int a3=sc.nextInt();\n int a2=sc.nextInt();\n int b1=sc.nextInt();\n int b3=sc.nextInt();\n int b2=sc.nextInt();\n int min=0;\n int max=0;\n if(a1>b3)\n max+=b3;\n else\n max+=a1;\n if(a2>b1)\n max+=b1;\n else\n max+=a2;\n if(a3>b2)\n max+=b2;\n else\n max+=a3;\n if(a1>b2+b1)\n min+=(Math.max(a1-(b2+b1),0));\n if(a2>b3+b2)\n min+=(Math.max(a2-(b3+b2),0));\n if(a3>b1+b3)\n min+=(Math.max(a3-(b1+b3),0));\n pr.printLine(min+\" \"+max);\n\t\t}\n pr.close();\n\t}\n\n\tstatic class Reader {\n final private int BUFFER_SIZE = 1 << 16;\n private DataInputStream din; private byte[] buffer;\n private int bufferPointer, bytesRead;\n public Reader() { din = new DataInputStream(System.in); \n buffer = new byte[BUFFER_SIZE]; bufferPointer = bytesRead = 0; }\n public Reader(String file_name) throws IOException {\n din = new DataInputStream(new FileInputStream(file_name)); \n buffer = new byte[BUFFER_SIZE]; bufferPointer = bytesRead = 0; }\n public String readLine() throws IOException { int cnt = 0, c;\n byte[] buf = new byte[64]; while ((c = read()) != -1) { if (c == '\\n') \n break; buf[cnt++] = (byte) c; } return new String(buf, 0, cnt); }\n public int nextInt() throws IOException {\n int ret = 0; byte c = read(); while (c <= ' ') c = read(); \n boolean neg = (c == '-'); if (neg) c = read(); do { \n ret = ret * 10 + c - '0'; } while ((c = read()) >= '0' && c <= '9'); \n if (neg) return -ret; return ret; } \n public long nextLong() throws IOException { long ret = 0; byte c = read(); \n while (c <= ' ') c = read(); boolean neg = (c == '-'); if (neg) c = read();\n do { ret = ret * 10 + c - '0'; } while ((c = read()) >= '0' && c <= '9');\n if (neg) return -ret; return ret; }\n public double nextDouble() throws IOException { double ret = 0, \n div = 1; byte c = read(); while (c <= ' ') c = read();\n boolean neg = (c == '-'); if (neg) c = read(); do {\n ret = ret * 10 + c - '0'; } while ((c = read()) >= '0' && c <= '9');\n if (c == '.') { while ((c = read()) >= '0' && c <= '9') {\n ret += (c - '0') / (div *= 10); } } if (neg) return -ret;\n return ret; }\n private void fillBuffer() throws IOException {\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1) buffer[0] = -1; }\n private byte read() throws IOException { if (bufferPointer == bytesRead)\n fillBuffer(); return buffer[bufferPointer++]; }\n public void close() throws IOException { if (din == null) return;\n din.close(); } \n }\n\n static class Print {\n private final BufferedWriter bw;\n public Print() {\n bw=new BufferedWriter(new OutputStreamWriter(System.out)); }\n public void print(String str)throws IOException { bw.append(str); }\n public void printLine(String str)throws IOException { print(str); \n bw.append(\"\\n\"); }\n public void close()throws IOException { bw.close(); } \n }\n}", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "math", "greedy"], "code_uid": "70cd5732b4fe051d9028e7a360ef5226", "src_uid": "e6dc3bc64fc66b6127e2b32cacc06402", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import javax.swing.plaf.IconUIResource;\nimport java.io.*;\nimport java.util.*;\n\nimport static java.lang.Math.*;\n\npublic class Main {\n public static void main(String[] args) throws IOException {\n br = new BufferedReader(new InputStreamReader(System.in));\n PrintWriter pw = new PrintWriter(System.out);\n int n = nextInt();\n int a1 = nextInt();\n int a2 = nextInt();\n int a3 = nextInt();\n int b1 = nextInt();\n int b2 = nextInt();\n int b3 = nextInt();\n int max = min(a1, b2) + min(a2, b3) + min(a3, b1);\n\n int a11 = a1;\n int a21 = a2;\n int a31 = a3;\n int b11 = b1;\n int b21 = b2;\n int b31 = b3;\n if (b11 > a21) {\n b11 -= a21;\n a21 = 0;\n if (b11 > a11) {\n b11 -= a11;\n a11 = 0;\n } else {\n a11 -= b11;\n b11 = 0;\n }\n } else {\n a21 -= b11;\n b11 = 0;\n }\n if (b21 > a31) {\n b21 -= a31;\n a31 = 0;\n if (b21 > a21) {\n b21 -= a21;\n a21 = 0;\n } else {\n a21 -= b21;\n b21 = 0;\n }\n } else {\n a31 -= b21;\n b21 = 0;\n }\n if (b31 > a11) {\n b31 -= a11;\n a11 = 0;\n if (b31 > a31) {\n b31 -= a31;\n a31 = 0;\n } else {\n a31 -= b31;\n b31 = 0;\n }\n } else {\n a11 -= b31;\n b31 = 0;\n }\n int ans1 = a11 + a21 + a31;\n\n a11 = a1;\n a21 = a2;\n a31 = a3;\n b11 = b1;\n b21 = b2;\n b31 = b3;\n\n if (b11 > a21) {\n b11 -= a21;\n a21 = 0;\n if (b11 > a11) {\n b11 -= a11;\n a11 = 0;\n } else {\n a11 -= b11;\n b11 = 0;\n }\n } else {\n a21 -= b11;\n b11 = 0;\n }\n if (b31 > a11) {\n b31 -= a11;\n a11 = 0;\n if (b31 > a31) {\n b31 -= a31;\n a31 = 0;\n } else {\n a31 -= b31;\n b31 = 0;\n }\n } else {\n a11 -= b31;\n b31 = 0;\n }\n if (b21 > a31) {\n b21 -= a31;\n a31 = 0;\n if (b21 > a21) {\n b21 -= a21;\n a21 = 0;\n } else {\n a21 -= b21;\n b21 = 0;\n }\n } else {\n a31 -= b21;\n b21 = 0;\n }\n int ans2 = a11 + a21 + a31;\n\n a11 = a1;\n a21 = a2;\n a31 = a3;\n b11 = b1;\n b21 = b2;\n b31 = b3;\n\n if (b21 > a31) {\n b21 -= a31;\n a31 = 0;\n if (b21 > a21) {\n b21 -= a21;\n a21 = 0;\n } else {\n a21 -= b21;\n b21 = 0;\n }\n } else {\n a31 -= b21;\n b21 = 0;\n }\n if (b11 > a21) {\n b11 -= a21;\n a21 = 0;\n if (b11 > a11) {\n b11 -= a11;\n a11 = 0;\n } else {\n a11 -= b11;\n b11 = 0;\n }\n } else {\n a21 -= b11;\n b11 = 0;\n }\n if (b31 > a11) {\n b31 -= a11;\n a11 = 0;\n if (b31 > a31) {\n b31 -= a31;\n a31 = 0;\n } else {\n a31 -= b31;\n b31 = 0;\n }\n } else {\n a11 -= b31;\n b31 = 0;\n }\n int ans3 = a11 + a21 + a31;\n\n a11 = a1;\n a21 = a2;\n a31 = a3;\n b11 = b1;\n b21 = b2;\n b31 = b3;\n\n if (b21 > a31) {\n b21 -= a31;\n a31 = 0;\n if (b21 > a21) {\n b21 -= a21;\n a21 = 0;\n } else {\n a21 -= b21;\n b21 = 0;\n }\n } else {\n a31 -= b21;\n b21 = 0;\n }\n if (b31 > a11) {\n b31 -= a11;\n a11 = 0;\n if (b31 > a31) {\n b31 -= a31;\n a31 = 0;\n } else {\n a31 -= b31;\n b31 = 0;\n }\n } else {\n a11 -= b31;\n b31 = 0;\n }\n if (b11 > a21) {\n b11 -= a21;\n a21 = 0;\n if (b11 > a11) {\n b11 -= a11;\n a11 = 0;\n } else {\n a11 -= b11;\n b11 = 0;\n }\n } else {\n a21 -= b11;\n b11 = 0;\n }\n int ans4 = a11 + a21 + a31;\n\n a11 = a1;\n a21 = a2;\n a31 = a3;\n b11 = b1;\n b21 = b2;\n b31 = b3;\n\n if (b31 > a11) {\n b31 -= a11;\n a11 = 0;\n if (b31 > a31) {\n b31 -= a31;\n a31 = 0;\n } else {\n a31 -= b31;\n b31 = 0;\n }\n } else {\n a11 -= b31;\n b31 = 0;\n }\n if (b21 > a31) {\n b21 -= a31;\n a31 = 0;\n if (b21 > a21) {\n b21 -= a21;\n a21 = 0;\n } else {\n a21 -= b21;\n b21 = 0;\n }\n } else {\n a31 -= b21;\n b21 = 0;\n }\n if (b11 > a21) {\n b11 -= a21;\n a21 = 0;\n if (b11 > a11) {\n b11 -= a11;\n a11 = 0;\n } else {\n a11 -= b11;\n b11 = 0;\n }\n } else {\n a21 -= b11;\n b11 = 0;\n }\n int ans5 = a11 + a21 + a31;\n\n a11 = a1;\n a21 = a2;\n a31 = a3;\n b11 = b1;\n b21 = b2;\n b31 = b3;\n\n if (b31 > a11) {\n b31 -= a11;\n a11 = 0;\n if (b31 > a31) {\n b31 -= a31;\n a31 = 0;\n } else {\n a31 -= b31;\n b31 = 0;\n }\n } else {\n a11 -= b31;\n b31 = 0;\n }\n if (b11 > a21) {\n b11 -= a21;\n a21 = 0;\n if (b11 > a11) {\n b11 -= a11;\n a11 = 0;\n } else {\n a11 -= b11;\n b11 = 0;\n }\n } else {\n a21 -= b11;\n b11 = 0;\n }\n if (b21 > a31) {\n b21 -= a31;\n a31 = 0;\n if (b21 > a21) {\n b21 -= a21;\n a21 = 0;\n } else {\n a21 -= b21;\n b21 = 0;\n }\n } else {\n a31 -= b21;\n b21 = 0;\n }\n int ans6 = a11 + a21 + a31;\n\n\n pw.print(min(ans1, min(ans2, min(ans3, min(ans4, min(ans5, ans6))))) + \" \");\n pw.println(max);\n pw.close();\n }\n\n static StringTokenizer st = new StringTokenizer(\"\");\n static BufferedReader br;\n\n static String next() throws IOException {\n while (st == null || !st.hasMoreTokens()) st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n\n static int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n static long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n static double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "math", "greedy"], "code_uid": "6277ee05618fce707d97ff33a1abb435", "src_uid": "e6dc3bc64fc66b6127e2b32cacc06402", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.BigInteger;\nimport java.text.*;\npublic class Main implements Runnable {\n static int mod = 1000_000_007;\n static long lim = (long)1e9 + 6;\n static long mod1 = 998244353;\n static boolean fileIO = false;\n static FastScanner f;\n static int inf = 2000_000_000;\n static PrintWriter pw = new PrintWriter(System.out);\n static Scanner S = new Scanner(System.in);\n static long x0; static long y0;\n static long iinf = Long.MAX_VALUE;\n static double eps = (double)1e-4;\n public static void solve() {\n int n = f.ni();\n long r1 = f.nl(); long s1 = f.nl(); long p1 = f.nl();\n long r2 = f.nl(); long s2 = f.nl(); long p2 = f.nl();\n\n // Find maximum wins\n long min = 0l , max = 0l;\n max = Math.min(p1 , r2) + Math.min(r1 , s2) + Math.min(s1 , p2);\n\n // Find minimum wins\n min = Math.max(0 , r1 - r2 - p2) + Math.max(0 , s1 - s2 - r2) + Math.max(0 , p1 - p2 - s2);\n pn(min + \" \" + max);\n } \n public static void main(String[] args)throws IOException {\n new Thread(null , new Main() , \"F*uckit\" , 1 << 28).start(); \n }\n \n/******************************END OF MAIN PROGRAM*******************************************/\n public void run() {\n f = new FastScanner(System.in);\n //pre();\n int t = 1;\n int tt = 1;\n //fw = new FileWriter(\"!out.txt\");\n while(t --> 0) {\n //fw.write(\"Case #\" + (tt++) + \": \");\n //fw.write(\"\\n\");\n solve();\n }\n pw.flush(); \n pw.close();\n //fw.close(); \n }\n public static class FastScanner {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private FastScanner.SpaceCharFilter filter;\n \n public FastScanner(InputStream stream) {\n this.stream = stream;\n }\n \n public int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n \n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n \n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n \n public int ni() {\n int c = read();\n \n while (isSpaceChar(c))\n c = read();\n \n int sgn = 1;\n \n if (c == '-') {\n sgn = -1;\n c = read();\n }\n \n int res = 0;\n do {\n if (c < '0' || c > '9') throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n \n return res * sgn;\n }\n \n public long nl() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n \n do {\n if (c < '0' || c > '9') throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n return res * sgn;\n }\n \n public String next() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n }\n while (!isSpaceChar(c));\n return res.toString();\n }\n \n public boolean isSpaceChar(int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n \n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n }\n public static void pn(Object o){pw.println(o);}\n public static void pi(Object o){pw.print(o);pw.flush();}\n public static void p(Object o){pw.print(o);}\n public static void pni(Object o){pw.println(o);pw.flush();}\n static int gcd(int a,int b){if(b==0)return a;else{return gcd(b,a%b);}}\n static long gcd(long a,long b){if(b==0l)return a;else{return gcd(b,a%b);}}\n static long lcm(long a,long b){return (a*b/gcd(a,b));}\n static long exgcd(long a,long b){if(b==0){x0=1;y0=0;return a;}long temp=exgcd(b,a%b);long t=x0;x0=y0;y0=t-a/b*y0;return temp;}\n static long pow(long a,long b){long res=1;while(b>0){if((b&1)==1)res=res*a;b>>=1;a=a*a;}return res;}\n static long mpow(long a,long b, long m){long res=1;while(b>0){if((b&1)==1)res=((res%m)*(a%m))%m;b>>=1;a=((a%m)*(a%m))%m;}return res;}\n static long mul(long a , long b){return ((a%mod)*(b%mod)%mod);}\n static long adp(long a , long b){return ((a%mod)+(b%mod)%mod);}\n static boolean isPrime(long n){if(n<=1)return false;if(n<=3)return true;if(n%2==0||n%3==0)return false;for(long i=5;i*i<=n;i=i+6)if(n%i==0||n%(i+2)==0)return false;return true;}\n static boolean isPrime(int n){if(n<=1)return false;if(n<=3)return true;if(n%2==0||n%3==0)return false;for(int i=5;i*i<=n;i=i+6)if(n%i==0||n%(i+2)==0)return false;return true;}\n static HashSet<Long> factors(long n){HashSet<Long> hs=new HashSet<Long>();for(long i=1;i<=(long)Math.sqrt(n);i++){if(n%i==0){hs.add(i);hs.add(n/i);}}return hs;}\n static HashSet<Integer> factors(int n){HashSet<Integer> hs=new HashSet<Integer>();for(int i=1;i<=(int)Math.sqrt(n);i++){if(n%i==0){hs.add(i);hs.add(n/i);}}return hs;}\n static HashSet<Long> pf(long n){HashSet<Long> ff=factors(n);HashSet<Long> ans=new HashSet<Long>();for(Long i:ff)if(isPrime(i))ans.add(i);return ans;}\n static HashSet<Integer> pf(int n){HashSet<Integer> ff=factors(n);HashSet<Integer> ans=new HashSet<Integer>();for(Integer i:ff)if(isPrime(i))ans.add(i);return ans;}\n static int[] inpint(int n){int arr[]=new int[n+1];for(int i=1;i<=n;++i){arr[i]=f.ni();}return arr;}\n static long[] inplong(int n){long arr[] = new long[n+1];for(int i=1;i<=n;++i){arr[i]=f.nl();}return arr;}\n static boolean ise(int x){return ((x&1)==0);}static boolean ise(long x){return ((x&1)==0);}\n static int gnv(char c){return Character.getNumericValue(c);} // Credits - KharYusuf for Multiset Class\n static class MultiSet<T extends Comparable<T>>{public int size=0;public TreeMap<T,Integer> tr;public MultiSet(){tr=new TreeMap<>();}public void add(T u){tr.put(u,tr.getOrDefault(u,0)+1);++size;}public boolean contains(T u){return tr.containsKey(u);}public void clear(){tr.clear();}}\n static int log(long x){return x==1?0:(1+log(x/2));} static int log(int x){return x==1?0:(1+log(x/2));}\n static void sort(int[] a){ArrayList<Integer> l=new ArrayList<>();for(int i:a)l.add(i);Collections.sort(l);for(int i=0;i<a.length;++i)a[i]=l.get(i);}\n static void sort(long[] a){ArrayList<Long> l=new ArrayList<>();for(long i:a)l.add(i);Collections.sort(l);for(int i=0;i<a.length;++i)a[i]=l.get(i);}\n static void sort(ArrayList<Integer> a){Collections.sort(a);}\n}", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "math", "greedy"], "code_uid": "73de45095cc733377be09073dd2f6460", "src_uid": "e6dc3bc64fc66b6127e2b32cacc06402", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.IOException;\nimport java.io.OutputStreamWriter;\nimport java.io.BufferedWriter;\nimport java.util.InputMismatchException;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.NoSuchElementException;\nimport java.io.Writer;\nimport java.math.BigInteger;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Alex\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tOutputWriter out = new OutputWriter(outputStream);\n\t\tTaskB solver = new TaskB();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskB {\n public void solve(int testNumber, InputReader in, OutputWriter out){\n\t String input = in.next();\n\t int hours = Character.getNumericValue(input.charAt(0)) * 10 + Character.getNumericValue(input.charAt(1));\n\t int minutes = Character.getNumericValue(input.charAt(3)) * 10 + Character.getNumericValue(input.charAt(4));\n\t if (hours >= 12) hours -= 12;\n\t int originalhours = hours * 30;\n\t int originalminutes = minutes * 6;\n\t out.print(originalhours + (double) originalminutes / 12, originalminutes);\n }\n}\n\nclass InputReader {\n\tprivate InputStream stream;\n\tprivate byte[] buf = new byte[1024];\n\tprivate int curChar;\n\tprivate int numChars;\n\tprivate SpaceCharFilter filter;\n\n\tpublic InputReader(InputStream stream) {\n\t\tthis.stream = stream;\n\t}\n\n\tpublic int read() {\n\t\tif (numChars == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (curChar >= numChars) {\n\t\t\tcurChar = 0;\n\t\t\ttry {\n\t\t\t\tnumChars = stream.read(buf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (numChars <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buf[curChar++];\n\t}\n\tpublic String readString() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tStringBuilder res = new StringBuilder();\n\t\tdo {\n\t\t\tif (Character.isValidCodePoint(c))\n\t\t\t\tres.appendCodePoint(c);\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res.toString();\n\t}\n\n\tpublic boolean isSpaceChar(int c) {\n\t\tif (filter != null)\n\t\t\treturn filter.isSpaceChar(c);\n\t\treturn isWhitespace(c);\n\t}\n\n\tpublic static boolean isWhitespace(int c) {\n\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t}\n\tpublic String next() {\n\t\treturn readString();\n\t}\n\tpublic interface SpaceCharFilter {\n\t\tpublic boolean isSpaceChar(int ch);\n\t}\n}\n\nclass OutputWriter {\n\tprivate final PrintWriter writer;\n\n\tpublic OutputWriter(OutputStream outputStream) {\n\t\twriter = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n\t}\n\tpublic void print(Object...objects) {\n\t\tfor (int i = 0; i < objects.length; i++) {\n\t\t\tif (i != 0)\n\t\t\t\twriter.print(' ');\n\t\t\twriter.print(objects[i]);\n\t\t}\n\t}\n\tpublic void close() {\n\t\twriter.close();\n\t}\n}\n\n", "lang_cluster": "Java", "tags": ["math", "geometry"], "code_uid": "818b12f07eaf121776061f6842ae6197", "src_uid": "175dc0bdb5c9513feb49be6644d0d150", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package CodeForces;\n\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.Scanner;\n\npublic class MathShow {\n\t\n\tstatic int solve(int n,int arr[],int index,int m)\n\t{\n\t\tif(index==arr.length)\n\t\t{\n\t\t\treturn 0;\n\t\t}\n\t\tint ans=0;\n\t\tif(arr[index]*n<=m)\n\t\t{\n\t\t\tm=m-n*arr[index];\n\t\t\tans=n;\n\t\t\treturn ans+solve(n,arr,index+1,m);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tint temp=m/arr[index];\n\t\t\treturn temp;\n\t\t}\n\t}\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner s=new Scanner(System.in);\n\t\tint n=s.nextInt();\n\t\tint k=s.nextInt();\n\t\tint m=s.nextInt();\n\t\tint arr[]=new int[k];\n\t\tint sum=0;\n\t\tfor(int i=0;i<k;i++)\n\t\t{\n\t\t\tarr[i]=s.nextInt();\n\t\t\tsum=sum+arr[i];\n\t\t}\n\t\tArrays.sort(arr);\n\t\tif(sum*n<=m)\n\t\t{\n\t\t\tSystem.out.println((k+1)*n);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tint ans=0;\n\t\t\tfor(int i=0;i<n;i++)\n\t\t\t{\n\t\t\t\tint p=m;\n\t\t\t\tif(p>=i*sum)\n\t\t\t\t{\n\t\t\t\t\tp=p-i*sum;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tint points=i*(k+1);\n\t\t\t\tfor(int j=0;j<k&&p>0;j++)\n\t\t\t\t{\n\t\t\t\t\tif(arr[j]*(n-i)<=p)\n\t\t\t\t\t{\n\t\t\t\t\t\tp=p-arr[j]*(n-i);\n\t\t\t\t\t\tpoints=points+n-i;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tpoints=points+p/arr[j];\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tans=Math.max(ans, points);\n\t\t\t}\n\t\t\tSystem.out.println(Math.max(ans,solve(n,arr,0,m)));\n\t\t}\n\t\t\n\t\t\n\t\t\n\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["brute force", "greedy"], "code_uid": "4b5c27776a3bf112d9518b74b7e02af3", "src_uid": "d659e92a410c1bc836be64fc1c0db160", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n\npublic class BPetrAndACombinationLock {\n static class Solution {\n int[]mat = {1, -1};\n //Boolean[][]dp;\n Map<String, Boolean> map;\n public void find(int[] arr) {\n map = new HashMap();\n boolean res = possible(arr, 0, 0);\n System.out.println(res==true? \"YES\" : \"NO\");\n }\n\n boolean possible(int[] arr, int index, int sum) {\n if(index == arr.length) {\n if(sum%360 == 0) {\n return true;\n }\n return false;\n }\n\n String key = index + \"/\" + sum;\n\n if(map.containsKey(key)) return map.get(key);\n for(int i=0; i<2; i++) {\n if(possible(arr, index+1, sum+(arr[index]*mat[i]))) {\n map.put(key, true);\n return true;\n }\n }\n map.put(key, false);\n return false;\n }\n }\n\n public static void main(String[] args) {\n Solution sol = new Solution();\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int[] arr = new int[n];\n for(int i=0; i<n; i++) {\n arr[i] = sc.nextInt();\n }\n sol.find(arr);\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "dp", "bitmasks"], "code_uid": "f40868b101ec1cccb04944434d29ab7f", "src_uid": "01b50fcba4185ceb1eb8e4ba04a0cc10", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.util.Arrays;\nimport java.io.IOException;\nimport java.io.UncheckedIOException;\nimport java.io.Closeable;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) throws Exception {\n Thread thread = new Thread(null, new TaskAdapter(), \"\", 1 << 27);\n thread.start();\n thread.join();\n }\n\n static class TaskAdapter implements Runnable {\n @Override\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastInput in = new FastInput(inputStream);\n FastOutput out = new FastOutput(outputStream);\n AClassroomWatch solver = new AClassroomWatch();\n solver.solve(1, in, out);\n out.close();\n }\n }\n\n static class AClassroomWatch {\n public void solve(int testNumber, FastInput in, FastOutput out) {\n int n = in.readInt();\n IntegerList ans = new IntegerList();\n for (int i = Math.max(0, n - 100); i <= n; i++) {\n if (digits(i) + i == n) {\n ans.add(i);\n }\n }\n out.println(ans.size());\n for (int i = 0; i < ans.size(); i++) {\n out.append(ans.get(i)).append(' ');\n }\n }\n\n public int digits(int n) {\n return n == 0 ? 0 : (n % 10 + digits(n / 10));\n }\n\n }\n\n static class SequenceUtils {\n public static boolean equal(int[] a, int al, int ar, int[] b, int bl, int br) {\n if ((ar - al) != (br - bl)) {\n return false;\n }\n for (int i = al, j = bl; i <= ar; i++, j++) {\n if (a[i] != b[j]) {\n return false;\n }\n }\n return true;\n }\n\n }\n\n static class FastInput {\n private final InputStream is;\n private byte[] buf = new byte[1 << 20];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastInput(InputStream is) {\n this.is = is;\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n bufLen = -1;\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public int readInt() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n }\n\n static class FastOutput implements AutoCloseable, Closeable, Appendable {\n private StringBuilder cache = new StringBuilder(10 << 20);\n private final Writer os;\n\n public FastOutput append(CharSequence csq) {\n cache.append(csq);\n return this;\n }\n\n public FastOutput append(CharSequence csq, int start, int end) {\n cache.append(csq, start, end);\n return this;\n }\n\n public FastOutput(Writer os) {\n this.os = os;\n }\n\n public FastOutput(OutputStream os) {\n this(new OutputStreamWriter(os));\n }\n\n public FastOutput append(char c) {\n cache.append(c);\n return this;\n }\n\n public FastOutput append(int c) {\n cache.append(c);\n return this;\n }\n\n public FastOutput println(int c) {\n return append(c).println();\n }\n\n public FastOutput println() {\n cache.append(System.lineSeparator());\n return this;\n }\n\n public FastOutput flush() {\n try {\n os.append(cache);\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n return this;\n }\n\n public void close() {\n flush();\n try {\n os.close();\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n\n public String toString() {\n return cache.toString();\n }\n\n }\n\n static class IntegerList implements Cloneable {\n private int size;\n private int cap;\n private int[] data;\n private static final int[] EMPTY = new int[0];\n\n public IntegerList(int cap) {\n this.cap = cap;\n if (cap == 0) {\n data = EMPTY;\n } else {\n data = new int[cap];\n }\n }\n\n public IntegerList(IntegerList list) {\n this.size = list.size;\n this.cap = list.cap;\n this.data = Arrays.copyOf(list.data, size);\n }\n\n public IntegerList() {\n this(0);\n }\n\n public void ensureSpace(int req) {\n if (req > cap) {\n while (cap < req) {\n cap = Math.max(cap + 10, 2 * cap);\n }\n data = Arrays.copyOf(data, cap);\n }\n }\n\n private void checkRange(int i) {\n if (i < 0 || i >= size) {\n throw new ArrayIndexOutOfBoundsException(\"invalid index \" + i);\n }\n }\n\n public int get(int i) {\n checkRange(i);\n return data[i];\n }\n\n public void add(int x) {\n ensureSpace(size + 1);\n data[size++] = x;\n }\n\n public void addAll(int[] x, int offset, int len) {\n ensureSpace(size + len);\n System.arraycopy(x, offset, data, size, len);\n size += len;\n }\n\n public void addAll(IntegerList list) {\n addAll(list.data, 0, list.size);\n }\n\n public int size() {\n return size;\n }\n\n public int[] toArray() {\n return Arrays.copyOf(data, size);\n }\n\n public String toString() {\n return Arrays.toString(toArray());\n }\n\n public boolean equals(Object obj) {\n if (!(obj instanceof IntegerList)) {\n return false;\n }\n IntegerList other = (IntegerList) obj;\n return SequenceUtils.equal(data, 0, size - 1, other.data, 0, other.size - 1);\n }\n\n public int hashCode() {\n int h = 1;\n for (int i = 0; i < size; i++) {\n h = h * 31 + Integer.hashCode(data[i]);\n }\n return h;\n }\n\n public IntegerList clone() {\n IntegerList ans = new IntegerList();\n ans.addAll(this);\n return ans;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["brute force", "math"], "code_uid": "3ded5d99d79b74abdd617c76007a9156", "src_uid": "ae20ae2a16273a0d379932d6e973f878", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Contest94_E {\n static int mod = 1000000007;\n static int comb[][];\n \n public static void comb(int n){\n comb = new int[n][n];\n for (int i = 0; i < n; i++) {\n comb[i][0] = 1;\n }\n for (int i = 1; i < n; i++) {\n comb[i][i] = 1;\n for (int j = i - 1; j > 0; j--) {\n comb[i][j] = (comb[i - 1][j - 1] + comb[i - 1][j]) %mod;\n }\n }\n }\n public static void main(String[] args) throws IOException {\n BufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n String[] s = in.readLine().split(\" \");\n int n = Integer.parseInt(s[0]) - 1;\n int m = Integer.parseInt(s[1]) - 1;\n int k = Integer.parseInt(s[2]);\n comb(Math.max(n, m)+1);\n if(n<2*k || m<2*k)\n System.out.println(0);\n else {\n long c = comb[n][2*k];\n long d = comb[m][2*k];\n System.out.println((d*c)%mod);\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics"], "code_uid": "9a8580b519211892d68f24e1aa9c890c", "src_uid": "309d2d46086d526d160292717dfef308", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\nimport java.io.*;\npublic class not{\npublic static PrintWriter out = new PrintWriter(System.out);//HACER FLUSHHHH\npublic static void main(String args[]) throws IOException{\nBufferedReader lector = new BufferedReader(new InputStreamReader(System.in));\nString tmp[] =lector.readLine().split(\" \");\nint tmpp[] = new int[tmp.length];\nString tal[] = {\"C\",\"C#\",\"D\",\"D#\",\"E\",\"F\",\"F#\",\"G\",\"G#\",\"A\",\"B\",\"H\"};\nint res = -1;\nfor(int n = 0;n<tmp.length;n++)\nfor(int m = 0;m<tal.length;m++)if(tmp[n].equals(tal[m]))tmpp[n]=m;\nfor(int a = 0;a<3 && res==-1;a++)\nfor(int b = 0;b<3 && res==-1;b++)\nfor(int c = 0;c<3 && res==-1;c++){\nif(a==b || b==c || a==c)continue;\nint dis1 = tmpp[b]>=tmpp[a]?(tmpp[b]-tmpp[a]):(tal.length-tmpp[a]+tmpp[b]);\nint dis2 =tmpp[c]>=tmpp[b]?(tmpp[c]-tmpp[b]):(tal.length-tmpp[b]+tmpp[c]);\n//System.out.println(a+\" \"+b+\" \"+c+\" --> \"+dis1+\" \"+dis2);\nif(dis1==4 && dis2==3)res = 0;\nif(dis1==3 && dis2==4)res = 1;\n}\nSystem.out.println(res==0?\"major\":(res==1?\"minor\":\"strange\"));\n}\n\n}\n", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "92e56c0217c587a03e72b5bbdbfc12c7", "src_uid": "6aa83c2f6e095848bc63aba7d013aa58", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n\tstatic int[][] h;\n\n\tstatic void getInput(Scanner sc, int n, int m) throws IOException {\n\t\tint[] g = new int[n * m + n];\n\t\tg[0] = sc.nextInt();\n\t\th = new int[n][m];\n\t\tint x = sc.nextInt(), y = sc.nextInt(), z = sc.nextInt();\n\t\tfor (int i = 1; i < g.length; i++) {\n\t\t\tg[i] = (int) ((g[i - 1] * 1L * x + y) % z);\n\t\t}\n\t\tfor (int i = 1; i <= n; i++)\n\t\t\tfor (int j = 1; j <= m; j++) {\n\t\t\t\th[i - 1][j - 1] = g[(i - 1) * m + j - 1];\n\t\t\t}\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tScanner sc = new Scanner();\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tint n = sc.nextInt(), m = sc.nextInt(), a = sc.nextInt(), b = sc.nextInt();\n\t\tgetInput(sc, n, m);\n\t\tint[][] mins = new int[n][m]; // mins[i][j] = min value from a[i][j] to a[i][j+b-1]\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tSparseTable row = new SparseTable(h[i]);\n\t\t\tfor (int j = 0; j + b <= m; j++) {\n\t\t\t\tmins[i][j] = row.query(j, j + b - 1);\n\t\t\t}\n\t\t}\n\t\tlong ans = 0;\n\t\tfor (int j = 0; j + b <= m; j++) {\n\t\t\tint[] x = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tx[i] = mins[i][j];\n\t\t\tSparseTable col = new SparseTable(x);\n\t\t\tfor (int i = 0; i + a <= n; i++)\n\t\t\t\tans += col.query(i, i + a - 1);\n\t\t}\n\t\tout.println(ans);\n\n\t\tout.close();\n\n\t}\n\n\tstatic class SparseTable {\n\t\t// table [i][j] = the index with the min value from a[j] to\n\t\t// a[j+(1<<i)-1];\n\n\t\tint[] log, a, table[];\n\n\t\tSparseTable(int[] a) {\n\t\t\tthis.a = a;\n\t\t\tint n = a.length;\n\t\t\tlog = new int[n + 1];\n\t\t\tfor (int i = 2; i <= n; i++)\n\t\t\t\tlog[i] = log[i / 2] + 1;\n\t\t\ttable = new int[log[n] + 1][n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ttable[0][i] = i;\n\t\t\tfor (int i = 1, len = 2; len <= n; i++, len <<= 1)\n\t\t\t\tfor (int j = 0; j + len <= n; j++) {\n\t\t\t\t\tint u = table[i - 1][j], v = table[i - 1][j + len / 2];\n\t\t\t\t\ttable[i][j] = a[u] < a[v] ? u : v;\n\t\t\t\t}\n\n\t\t}\n\n\t\tint query(int l, int r) {\n\t\t\tint len = r - l + 1;\n\t\t\tint lg = log[len];\n\t\t\tint u = table[lg][l];\n\t\t\tint v = table[lg][r - (1 << lg) + 1];\n\t\t\tint bestIdx = a[u] < a[v] ? u : v;\n\t\t\treturn a[bestIdx]; // return a[bestIdx] for value\n\t\t}\n\n\t}\n\n\tstatic class Scanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tScanner() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tScanner(String fileName) throws FileNotFoundException {\n\t\t\tbr = new BufferedReader(new FileReader(fileName));\n\t\t}\n\n\t\tString next() throws IOException {\n\t\t\twhile (st == null || !st.hasMoreTokens())\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tString nextLine() throws IOException {\n\t\t\treturn br.readLine();\n\t\t}\n\n\t\tint nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tlong nextLong() throws NumberFormatException, IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tdouble nextDouble() throws NumberFormatException, IOException {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tboolean ready() throws IOException {\n\t\t\treturn br.ready();\n\t\t}\n\n\t}\n\n}", "lang_cluster": "Java", "tags": ["two pointers", "data structures"], "code_uid": "fa6930f52337c0f942be0d1335686ffd", "src_uid": "4618fbffb2b9d321a6d22c11590a4773", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\npublic class A\n{\n public static void main(String ar[]) throws Exception\n {\n BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n String s1[]=br.readLine().split(\" \");\n String s2[]=br.readLine().split(\" \");\n int n=Integer.parseInt(s1[0]);\n int m=Integer.parseInt(s1[1]);\n int l=Integer.parseInt(s1[2]);\n int r=Integer.parseInt(s1[3]);\n long g=Long.parseLong(s2[0]);\n long x=Long.parseLong(s2[1]);\n long y=Long.parseLong(s2[2]);\n long z=Long.parseLong(s2[3]);\n \n long a[][]=new long[n][m];\n for(int i=0;i<n;i++)\n {\n for(int j=0;j<m;j++)\n {\n a[i][j]=g;\n g=(g*x+y)%z;\n }\n }\n \n long b[]=new long[n];\n for(int j=0;j<m;j++)\n {\n Deque<Integer> dq=new LinkedList<Integer>();\n for(int i=0;i<n;i++)\n b[i]=a[i][j];\n for(int i=0;i<l;i++)\n {\n while(!dq.isEmpty() && b[i]<=b[dq.peekLast()])\n dq.pollLast();\n dq.addLast(i);\n }\n \n for(int i=l;i<n;i++)\n {\n a[i-1][j]=b[dq.peek()];\n while(!dq.isEmpty() && dq.peek()<=i-l)\n dq.poll();\n while(!dq.isEmpty() && b[i]<=b[dq.peekLast()])\n dq.pollLast();\n dq.addLast(i);\n }\n a[n-1][j]=b[dq.peek()];\n }\n \n long c[]=new long[m];\n for(int i=l-1;i<n;i++)\n {\n for(int j=0;j<m;j++)\n c[j]=a[i][j];\n Deque<Integer> dq=new LinkedList<Integer>();\n for(int j=0;j<r;j++)\n {\n while(!dq.isEmpty() && c[j]<=c[dq.peekLast()])\n dq.pollLast();\n dq.addLast(j);\n }\n \n for(int j=r;j<m;j++)\n {\n //System.out.println(i+\" \"+j);\n a[i][j-1]=c[dq.peek()];\n while(!dq.isEmpty() && dq.peek()<=j-r)\n dq.poll();\n while(!dq.isEmpty() && c[j]<=c[dq.peekLast()])\n dq.pollLast();\n dq.addLast(j);\n }\n a[i][m-1]=c[dq.peek()];\n }\n \n long S=0;\n // StringBuffer sb=new StringBuffer();\n // StringBuffer sb1=new StringBuffer();\n for(int i=l-1;i<n;i++)\n {\n for(int j=r-1;j<m;j++)\n {\n S+=a[i][j];\n //sb.append(b[i][j]).append(\" \");\n // sb1.append(c[i][j]).append(\" \");\n }\n // sb.append(\"\\n\");\n // sb1.append(\"\\n\");\n } \n // System.out.println(sb);\n // System.out.println();\n // System.out.println(sb1);\n // System.out.println();\n System.out.println(S);\n }\n}", "lang_cluster": "Java", "tags": ["two pointers", "data structures"], "code_uid": "c76c7b35ae51db8b9f0c6cc968bfc137", "src_uid": "4618fbffb2b9d321a6d22c11590a4773", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.BufferedReader;\nimport java.io.Closeable;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.ArrayDeque;\nimport java.util.StringTokenizer;\n\npublic class OpenStreetMap implements Closeable {\n\n private InputReader in = new InputReader(System.in);\n private PrintWriter out = new PrintWriter(System.out);\n\n public void solve() {\n int n = in.ni(), m = in.ni(), a = in.ni(), b = in.ni();\n long g = in.nl(), x = in.nl(), y = in.nl(), z = in.nl();\n long[][] table = new long[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n table[i][j] = g;\n g = (g * x + y) % z;\n }\n }\n ArrayDeque<Long>[] queues = new ArrayDeque[m];\n for (int i = 0; i < m; i++) {\n queues[i] = new ArrayDeque<>();\n }\n for (int i = 0; i < a - 1; i++) {\n for (int j = 0; j < m; j++) {\n long value = table[i][j];\n while (queues[j].size() > 0 && queues[j].peekLast() > value) {\n queues[j].pollLast();\n }\n queues[j].addLast(value);\n }\n }\n long result = 0;\n for (int row = a - 1; row < n; row++) {\n ArrayDeque<Long> window = new ArrayDeque<>();\n if (row >= a) {\n for (int col = 0; col < m; col++) {\n long remove = table[row - a][col];\n if (queues[col].size() > 0 && queues[col].peekFirst() == remove) {\n queues[col].pollFirst();\n }\n }\n }\n\n for (int col = 0; col < m; col++) {\n long add = table[row][col];\n while (queues[col].size() > 0 && queues[col].peekLast() > add) {\n queues[col].pollLast();\n }\n queues[col].addLast(add);\n\n long columnMin = queues[col].peekFirst();\n while (window.size() > 0 && window.peekLast() > columnMin) {\n window.pollLast();\n }\n window.addLast(columnMin);\n if (col >= b) {\n long remove = queues[col - b].peekFirst();\n if (window.size() > 0 && window.peekFirst() == remove) {\n window.pollFirst();\n }\n }\n if (col >= b - 1) {\n result += window.peekFirst();\n }\n\n }\n }\n out.println(result);\n }\n\n @Override\n public void close() throws IOException {\n in.close();\n out.close();\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int ni() {\n return Integer.parseInt(next());\n }\n\n public long nl() {\n return Long.parseLong(next());\n }\n\n public void close() throws IOException {\n reader.close();\n }\n }\n\n public static void main(String[] args) throws IOException {\n try (OpenStreetMap instance = new OpenStreetMap()) {\n instance.solve();\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["two pointers", "data structures"], "code_uid": "48566b5de3c5fd5a4187cbe904b0f770", "src_uid": "4618fbffb2b9d321a6d22c11590a4773", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class Main {\n\tpublic static void main(String args[]) {new Main().run();}\n\n\tFastReader in = new FastReader();\n\tPrintWriter out = new PrintWriter(System.out);\n\tvoid run(){\n\t\twork();\n\t\tout.flush();\n\t}\n\tlong mod=998244353;\n\tlong gcd(long a,long b) {\n\t\treturn a==0?b:gcd(b%a,a);\n\t}\n\tvoid work() {\n\t\tint n=ni(),m=ni(),a=ni(),b=ni();\n\t\tlong g=ni(),x=ni(),y=ni(),z=ni();\n\t\tlong[][] A=new long[n][m];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tfor(int j=0;j<m;j++) {\n\t\t\t\tA[i][j]=g;\n\t\t\t\tg=(g*x+y)%z;\n\t\t\t}\n\t\t}\n\t\tlong[][] rec=new long[n][m];\n\t\tlong sum=0;\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tLinkedList<Long> queue=new LinkedList<>();\n\t\t\tfor(int j=0;j<m;j++) {\n\t\t\t\twhile(queue.size()>0&&queue.peekLast()>A[i][j]) {\n\t\t\t\t\tqueue.pollLast();\n\t\t\t\t}\n\t\t\t\tqueue.add(A[i][j]);\n\t\t\t\tif(j>=b) {\n\t\t\t\t\tif(queue.peekFirst()==A[i][j-b]) {\n\t\t\t\t\t\tqueue.pollFirst();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\trec[i][j]=queue.peekFirst();\n\t\t\t}\n\t\t}\n\t\tfor(int j=b-1;j<m;j++) {\n\t\t\tLinkedList<Long> queue=new LinkedList<>();\n\t\t\tfor(int i=0;i<n;i++) {\n\t\t\t\twhile(queue.size()>0&&queue.peekLast()>rec[i][j]) {\n\t\t\t\t\tqueue.pollLast();\n\t\t\t\t}\n\t\t\t\tqueue.add(rec[i][j]);\n\t\t\t\tif(i>=a) {\n\t\t\t\t\tif(queue.peekFirst()==rec[i-a][j]) {\n\t\t\t\t\t\tqueue.pollFirst();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(i>=a-1) {\n\t\t\t\t\tsum+=queue.peekFirst();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tout.println(sum);\n\t}\n\n\t//input\n\tprivate ArrayList<Integer>[] ng(int n, int m) {\n\t\tArrayList<Integer>[] graph=(ArrayList<Integer>[])new ArrayList[n];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tgraph[i]=new ArrayList<>();\n\t\t}\n\t\tfor(int i=1;i<=m;i++) {\n\t\t\tint s=in.nextInt()-1,e=in.nextInt()-1;\n\t\t\tgraph[s].add(e);\n\t\t\tgraph[e].add(s);\n\t\t}\n\t\treturn graph;\n\t}\n\n\tprivate int ni() {\n\t\treturn in.nextInt();\n\t}\n\n\tprivate long nl() {\n\t\treturn in.nextLong();\n\t}\n\n\tprivate long[] na(int n) {\n\t\tlong[] A=new long[n];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tA[i]=in.nextLong();\n\t\t}\n\t\treturn A;\n\t}\n\tprivate int[] nia(int n) {\n\t\tint[] A=new int[n];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tA[i]=in.nextInt();\n\t\t}\n\t\treturn A;\n\t}\n}\t\n\nclass FastReader\n{\n\tBufferedReader br;\n\tStringTokenizer st;\n\n\tpublic FastReader()\n\t{\n\t\tbr=new BufferedReader(new InputStreamReader(System.in));\n\t}\n\n\n\tpublic String next() \n\t{\n\t\twhile(st==null || !st.hasMoreElements())//回车，空行情况\n\t\t{\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tpublic int nextInt() \n\t{\n\t\treturn Integer.parseInt(next());\n\t}\n\n\tpublic long nextLong()\n\t{\n\t\treturn Long.parseLong(next());\n\t}\n}", "lang_cluster": "Java", "tags": ["two pointers", "data structures"], "code_uid": "593c752f6263cb0673d8348751fcb656", "src_uid": "4618fbffb2b9d321a6d22c11590a4773", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class CFD {\n\n BufferedReader br;\n PrintWriter out;\n StringTokenizer st;\n boolean eof;\n private static long MOD = 1000L * 1000L * 1000L + 7;\n private static final int[] dx = {0, -1, 0, 1};\n private static final int[] dy = {1, 0, -1, 0};\n private static final String yes = \"Yes\";\n private static final String no = \"No\";\n\n int n;\n int m;\n int a;\n int b;\n int LIMIT = 1000 * 1000 + 10;\n long[] fact;\n long[] invfact;\n long[] powN;\n long[] powM;\n void solve() throws IOException {\n n = nextInt();\n m = nextInt();\n a = nextInt();\n b = nextInt();\n\n fact = new long[LIMIT];\n invfact = new long[LIMIT];\n fact[0] = 1;\n for (int i = 1; i < LIMIT; i++) {\n fact[i] = fact[i - 1] * i % MOD;\n }\n\n invfact[LIMIT - 1] = powMod(fact[LIMIT - 1], MOD - 2, MOD);\n for (int i = LIMIT - 2; i >= 0; i--) {\n invfact[i] = invfact[i + 1] * (i + 1) % MOD;\n }\n\n powN = new long[LIMIT];\n powM = new long[LIMIT];\n powN[0] = 1;\n powM[0] = 1;\n for (int i = 1; i < LIMIT; i++) {\n powN[i] = n * powN[i - 1] % MOD;\n powM[i] = m * powM[i - 1] % MOD;\n }\n\n long res = 0;\n for (int i = 0; i <= Math.min(m - 1, n - 2); i++) {\n int left = n - (i + 2);\n // (n - i - 1) * (n - i) *...* (n - 2)\n long extra = fact[n - 2] * invfact[n - i - 2] % MOD;\n extra *= comb(m - 1, i);\n extra %= MOD;\n extra *= caley(n, i + 2);\n extra %= MOD;\n extra *= powM[left];\n extra %= MOD;\n res += extra;\n if (res >= MOD) {\n res -= MOD;\n }\n\n if (res >= MOD) {\n res -= MOD;\n }\n }\n\n outln(res % MOD);\n }\n\n long caley(int n, int k) {\n if (k >= n) {\n return 1;\n }\n return k * powN[n - k - 1] % MOD;\n }\n\n long comb(int n, int r) {\n long res = fact[n] * invfact[r] % MOD;\n res = res * invfact[n - r] % MOD;\n return res;\n }\n\n // return 1/a module MOD, which is a ^ (MOD - 2) % MOD\n long inverseMod(long a, long MOD) {\n return powMod(a, MOD - 2, MOD);\n }\n\n // Power Calculate N^M % MOD, N and M can be long (up to 2^64, ~10^18)\n public long powMod(long N, long M, long MOD){//N^M % MOD\n if(M == 0L)\n return 1L;\n long[] hp = new long[64];\n boolean[] bp = new boolean[64];\n hp[0] = N;\n for(int i = 1; i < hp.length; i++) {\n hp[i] = (hp[i - 1] * hp[i - 1]) % MOD;\n }\n for(int j = 0; j < hp.length; j++) {\n if((M & (1L << j)) != 0)\n bp[j] = true;\n }\n long res = 1;\n for(int i = 0;i < bp.length; i++){\n if(bp[i]) {\n res = (res * hp[i]) % MOD;\n }\n }\n return res;\n }\n\n void shuffle(int[] a) {\n int n = a.length;\n for(int i = 0; i < n; i++) {\n int r = i + (int) (Math.random() * (n - i));\n int tmp = a[i];\n a[i] = a[r];\n a[r] = tmp;\n }\n }\n long gcd(long a, long b) {\n while(a != 0 && b != 0) {\n long c = b;\n b = a % b;\n a = c;\n }\n return a + b;\n }\n private void outln(Object o) {\n out.println(o);\n }\n private void out(Object o) {\n out.print(o);\n }\n private void formatPrint(double val) {\n outln(String.format(\"%.9f%n\", val));\n }\n public CFD() throws IOException {\n br = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n solve();\n out.close();\n }\n public static void main(String[] args) throws IOException {\n new CFD();\n }\n\n public long[] nextLongArr(int n) throws IOException{\n long[] res = new long[n];\n for(int i = 0; i < n; i++)\n res[i] = nextLong();\n return res;\n }\n public int[] nextIntArr(int n) throws IOException {\n int[] res = new int[n];\n for(int i = 0; i < n; i++)\n res[i] = nextInt();\n return res;\n }\n public String nextToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (Exception e) {\n eof = true;\n return null;\n }\n }\n return st.nextToken();\n }\n public String nextString() {\n try {\n return br.readLine();\n } catch (IOException e) {\n eof = true;\n return null;\n }\n }\n public int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n public long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n public double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "combinatorics", "trees"], "code_uid": "f248eccf9801f9fd760b47dbeff9288a", "src_uid": "728fe302b8b18e33f15f6e702e332cde", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import static java.lang.Math.max;\nimport static java.lang.Math.min;\nimport static java.lang.Math.abs;\nimport java.util.*;\nimport java.io.*;\nimport java.math.*;\n\n public class E\n {\n public static void main(String hi[]) throws Exception\n {\n BufferedReader infile = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st = new StringTokenizer(infile.readLine());\n int N = Integer.parseInt(st.nextToken());\n BigInteger res = new BigInteger(\"1\");\n for(int i=N-1; i >= 1; i--)\n res = res.multiply(new BigInteger(i+\"\"));\n res = res.divide(new BigInteger(N/2+\"\"));\n System.out.println(res.longValue());\n }\n }", "lang_cluster": "Java", "tags": ["math", "combinatorics"], "code_uid": "2eb1fc989ebd04242b03f404e0a4bcbb", "src_uid": "ad0985c56a207f76afa2ecd642f56728", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "\n\nimport java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Main solver = new Main();\n solver.solve();\n }\n\n int p = 1000000009;\n\n private void solve() {\n Scanner sc = new Scanner (System.in);\n\n int n = sc.nextInt();\n int m = sc.nextInt();\n\n int howMany = 1;\n for (int i = 0; i < m; ++i)\n {\n howMany <<= 1;\n if (howMany >= p)\n howMany %= p;\n }\n\n howMany--;\n\n long ans = 1;\n for (int i = 0; i < n; ++i)\n {\n ans *= howMany;\n ans %= p;\n howMany--;\n }\n\n System.out.println(ans);\n }\n\n}\n", "lang_cluster": "Java", "tags": ["math", "constructive algorithms", "combinatorics"], "code_uid": "340740288e75e23141f4c82fcff6bfab", "src_uid": "fef4d9c94a93fcf6d536f33503b1d4b8", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.Scanner;\r\n\r\npublic class C {\r\n static long factorial[] = new long[(int) 2e5 + 3];\r\n static long inverseFactorial[] = new long[(int) 2e5 + 3];\r\n static int MOD = (int) 1e9 + 7;\r\n\r\n public static void main(String[] args) {\r\n factorial[0] = 1;\r\n inverseFactorial[0] = 1;\r\n for (int i = 1; i <= (int) 2e5; i++) {\r\n factorial[i] = mul(factorial[i - 1], i);\r\n inverseFactorial[i] = binpow(factorial[i], MOD - 2);\r\n }\r\n Scanner scn = new Scanner(System.in);\r\n int test = scn.nextInt();\r\n while (test-- > 0) {\r\n int n = scn.nextInt();\r\n int k = scn.nextInt();\r\n long[] dp = new long[k + 1];\r\n dp[k] = 1;\r\n long equal = 0;\r\n long moreThan = 0;\r\n if (n % 2 != 0)\r\n equal = 1l;\r\n else moreThan = 1l;\r\n for (int i = 0; i < n; i += 2) {\r\n equal = add(equal, nCr(n, i));\r\n }\r\n\r\n for (int i = k - 1; i >= 0; i--) {\r\n dp[i] = mul(equal, dp[i + 1]);\r\n dp[i] = add(dp[i], mul(moreThan, binpow(2, 1l*n * (k - i - 1))));\r\n }\r\n System.out.println(dp[0]);\r\n }\r\n\r\n }\r\n\r\n static long add(long a, long b) {\r\n if ((a += b) >= MOD)\r\n a -= MOD;\r\n else if (a < 0)\r\n a += MOD;\r\n return a;\r\n }\r\n\r\n static long mul(long x, long y) {\r\n return (1L * x * y) % MOD;\r\n }\r\n\r\n static long nCr(int n, int r) {\r\n if (r > n)\r\n return 0;\r\n return mul(mul(factorial[n], inverseFactorial[r]), inverseFactorial[n - r]);\r\n }\r\n\r\n\r\n public static long binpow(long x, long n) {\r\n assert (n >= 0);\r\n x %= MOD; // note: MOD * MOD must be less than 2^63 to avoid ll overflow\r\n long res = 1;\r\n while (n > 0) {\r\n if (n % 2 == 1) // if n is odd\r\n res = res * x % MOD;\r\n x = x * x % MOD;\r\n n /= 2; // divide by two\r\n }\r\n return res;\r\n }\r\n}\r\n", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics", "bitmasks", "matrices"], "code_uid": "ada378388cea596ae8c386ce5555d762", "src_uid": "02f5fe43ea60939dd4a53299b5fa0881", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.util.Collections;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Pranay2516\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastReader in = new FastReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskA solver = new TaskA();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskA {\n public void solve(int testNumber, FastReader in, PrintWriter out) {\n int n = in.nextInt(), m = in.nextInt(), k = in.nextInt(), f = 0;\n Integer[] a = new Integer[n];\n for (int i = 0; i < n; ++i) a[i] = in.nextInt();\n Arrays.sort(a, Collections.reverseOrder());\n if (m <= k) {\n out.println(0);\n return;\n }\n int cur = 0, cnt = 0;\n while (m > k && cur < n) {\n k += a[cur] - 1;\n if (m <= k) {\n out.println(cur + 1);\n return;\n }\n cur++;\n }\n out.println(-1);\n\n }\n\n }\n\n static class FastReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private FastReader.SpaceCharFilter filter;\n\n public FastReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n\n if (numChars == -1)\n throw new InputMismatchException();\n\n if (curChar >= numChars) {\n\n curChar = 0;\n\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n\n if (numChars <= 0)\n return -1;\n }\n\n return buf[curChar++];\n }\n\n public int nextInt() {\n\n int c = read();\n\n while (isSpaceChar(c))\n c = read();\n\n int sgn = 1;\n\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n\n int res = 0;\n\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n\n if (filter != null)\n return filter.isSpaceChar(c);\n\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["sortings", "implementation", "greedy"], "code_uid": "ee99e31149d62eba22c96ee97dbc69a5", "src_uid": "b32ab27503ee3c4196d6f0d0f133d13c", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\n\nimport java.io.BufferedReader;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Scanner;\nimport java.util.Set;\nimport java.util.StringTokenizer;\n\n\npublic class ForLooops {\n\t static class FastReader \n\t { \n\t BufferedReader br; \n\t StringTokenizer st; \n\t \n\t \n\t public FastReader() \n\t { \n\t br = new BufferedReader(new\n\t InputStreamReader(System.in)); \n\t } \n\t \n\t String next() \n\t { \n\t while (st == null || !st.hasMoreTokens()) \n\t { \n\t try\n\t { \n\t st = new StringTokenizer(br.readLine()); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t } \n\t return st.nextToken();\n\t \n\t } \n\t \n\t int nextInt() \n\t { \n\t return Integer.parseInt(next()); \n\t } \n\t \n\t long nextLong() \n\t { \n\t return Long.parseLong(next()); \n\t } \n\t \n\t double nextDouble() \n\t { \n\t return Double.parseDouble(next()); \n\t } \n\t \n\t String nextLine() \n\t { \n\t String str = \"\"; \n\t try\n\t { \n\t str = br.readLine(); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t return str; \n\t }\n\n\t\t\tpublic Character charAt(int i) {\n\t\t\t\t// TODO Auto-generated method stub\n\t\t\t\treturn null;\n\t\t\t} \n\t }\n\n\t static int gcd(int a , int b) {\n\t\t if(b==0)return a;\n\t\t return gcd(b,a%b);\n\t }\n\n\t/**\n\t * @param args\n\t * @throws IOException\n\t */\n\n\tpublic static void main(String[] args)throws IOException {\n\t\tFastReader s=new FastReader();\t\t\n\t\tint n = s.nextInt();\n\t\tint m = s.nextInt();\n\t\tint min = (n+1)/2;\n\t\tint flag=0;\n\t\tfor(int i=min;i<=n;i++) {\n\t\t\tif(i%m==0) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tflag=1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(flag==0)System.out.println(\"-1\");\n\t}\n}\n\t\n\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "bd31af5dd5e19b0cc88465cffffd5b85", "src_uid": "0fa526ebc0b4fa3a5866c7c5b3a4656f", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Scanner;\n\npublic class A {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long n = sc.nextLong();\n solve(n,n);\n }\n\n public static void solve(long n, long sum) {\n if (n == 1) {\n System.out.println(sum);\n System.exit(0);\n }\n if (n % 2 == 0)\n solve(n / 2, sum + n / 2);\n else {\n for (int i = 3; i < Math.sqrt(n)+1; i += 2) {\n if (n % i == 0)\n solve(n / i, sum + n / i);\n }\n solve(1, sum+1);\n }\n }\n\n}\n", "lang_cluster": "Java", "tags": ["number theory"], "code_uid": "563156709c2a35cefde49784804526c4", "src_uid": "821c0e3b5fad197a47878bba5e520b6e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Kiyan Sergey\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskC solver = new TaskC();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskC {\n\tpublic void solve(int testNumber, InputReader in, PrintWriter out) {\n int ans = 0;\n long n = in.readLong();\n for (int i = 1; numberOfCards(i) <= n; ++i) {\n long dif = n - numberOfCards(i);\n if (dif % 3 == 0) {\n ++ans;\n }\n }\n out.println(ans);\n\t}\n\n long numberOfCards(long stages) {\n return (1 + stages) * stages * 3 / 2 - stages;\n }\n}\n\nclass InputReader {\n private InputStream stream;\n private byte[] buf = new byte[102400]; //a byte buffer to store the characters in\n private int curChar; //to hold the count of current character\n private int numChars; //number of characters\n\n public InputReader(InputStream stream) { //pass the inputstream class\n this.stream = stream;\n }\n public final int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf); //this is the implicit function present in the inputStream which reads a Character into a temporary buffer\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public final long readLong() { //similar as Integer\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public final static boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "greedy", "binary search", "brute force"], "code_uid": "621d8666c46316afa7bb2a40749b076d", "src_uid": "ab4f9cb3bb0df6389a4128e9ff1207de", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.HashSet;\nimport java.util.StringTokenizer;\n\npublic class A {\n\tpublic static void main(String[] args) throws IOException {\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tFastScanner in = new FastScanner(System.in);\n\t\t\n\t\tint n= in.nextInt();\n\t\tdouble res=0;\n\t\tint ares=0;\n\t\tint bres=0;\n\t\tfor (int a = 0; a < n; a++) {\n\t\t\tfor (int b = 0; b < n; b++) {\n\t\t\t\tif(a+b==n){\n\t\t\t\t\tint g= gcd(a,b);\n\t\t\t\t\tif(g!=1)continue;\n\t\t\t\t\tdouble cur= (double) a/b;\n\t\t\t\t\tif(cur>res&&cur<1){\n\t\t\t\t\t\tares=a;\n\t\t\t\t\t\tbres=b;\n\t\t\t\t\t\tres= cur;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ares+\" \"+ bres);\n\t\t\n\t}\n\tpublic static int gcd(int a, int b){\n\t\treturn b == 0 ? a : gcd(b, a % b);\n\t}\n\n\tstatic class FastScanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tpublic FastScanner(InputStream in) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(in));\n\t\t\tst = new StringTokenizer(\"\");\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\tif (!st.hasMoreTokens()) {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\treturn next();\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\tpublic double nextDouble() throws NumberFormatException, IOException {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t\tpublic long nextLong() throws IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "constructive algorithms"], "code_uid": "0113fac0237a5b350781c927f256f5ad", "src_uid": "0af3515ed98d9d01ce00546333e98e77", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\nimport java.util.regex.*;\nimport java.io.*;\nimport java.math.BigInteger;\nimport static java.lang.Math.*;\n\npublic class Sol implements Runnable {\n\tfinal long MOD = 1000000007;\n\tlong half = (MOD + 1) / 2;\n\n\tvoid solve() throws Exception {\n\t\tint L = nextInt(), R = nextInt();\n\t\tlong ans = ((getGoodAll(R) - getGoodAll(L - 1) + MOD) * half) % MOD;\n\t\tout.println(ans);\n\t}\n\n\tlong getAll(int R) {\n\t\tlong res = get(1);\n\t\tif (R == 1) return res;\n\t\tres += 2 * getK(R) + 4 * getK(1);\n\t\tres %= MOD;\n\t\tlong add1 = R >= 3 ? 6 * (mpow(3, (R - 1) / 2) - 1) : 0;\n\t\tlong add2 = R >= 4 ? 3 * (mpow(3, R / 2) - 3) : 0;\n\t\treturn (res + add1 + add2) % MOD;\t\n\t}\n\n\tlong getGoodAll(int R) {\n\t\tif (R == 0) return 0;\n\t\tlong res = getAll(R);\n\t\tres += getAll((R + 1) / 2);\n\t\treturn res % MOD;\n\t}\n\n\tlong get(int n) {\n\t\treturn 2 * getK(n) + 2 * getY(n);\n\t}\n\t\n\tlong getY(int n) {\n\t\treturn n == 1 ? 1 : 2 * getK(n - 1);\n\t}\n\n\tlong getK(int n) {\n\t\tif (n % 2 == 0) {\n\t\t\treturn (2 * mpow(3, n / 2 - 1)) % MOD;\n\t\t} else {\n\t\t\treturn mpow(3, n / 2);\n\t\t}\n\t}\n\n\tlong mpow(long a, long n) {\n\t\tif (n == 0) return 1;\n\t\tlong ans = mpow(a, n / 2);\n\t\tans = (ans * ans) % MOD;\n\t\tif (n % 2 == 1) {\n\t\t\tans = (ans * a) % MOD;\n\t\t}\n\t\treturn ans;\n\t}\n\n\n\tpublic static void main(String[] args) {\n\t\tnew Thread(new Sol()).start();\n\t}\n\n\tpublic void run() {\n\t\ttry {\n\t\t\tLocale.setDefault(Locale.US);\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(System.out);\n\t\t\tsolve();\n\n\t\t\tout.close();\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(1);\n\t\t}\n\t}\n\n\t\n\tStringTokenizer tokenizer = new StringTokenizer(\"\");\n\tBufferedReader in;\n\tPrintWriter out;\n\tlong time;\n\n\tvoid sTime() {\n\t\ttime = System.currentTimeMillis();\n\t}\n\n\tlong gTime() {\n\t\treturn System.currentTimeMillis() - time;\n\t}\n\n\tvoid gMemory() {\n\t\tdebug(\"Memory: \" + (Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory()) / 1000 + \" kb\");\n\t}\n\n\tpublic void debug(Object o) {\n\t\tSystem.err.println(o);\n\t}\n\t\n\tboolean seekForToken() {\n\t\twhile (!tokenizer.hasMoreTokens()) {\n\t\t\tString s = null;\n\t\t\ttry {\n\t\t\t\ts = in.readLine();\n\t\t\t} catch (Exception e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (s == null)\n\t\t\t\treturn false;\n\t\t\ttokenizer = new StringTokenizer(s);\n\t\t}\n\t\treturn true;\n\t}\n\n\tString nextToken() {\n\t\treturn seekForToken() ? tokenizer.nextToken() : null;\n\t}\n\n\tint nextInt() {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n\n\tBigInteger nextBig() {\n\t\treturn new BigInteger(nextToken());\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "matrices", "dp"], "code_uid": "20f187dd227790c1bafc95468fa1b519", "src_uid": "e04b6957d9c1659e9d2460410cb57f10", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Scanner;\n\npublic class C_135B {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long a[] = new long[19];\n for (int i = 1; i < 19; i++) {\n String s = \"\";\n for (int j = 0; j < i; j++) {\n s+='9';\n }\n a[i] = Long.parseLong(s);\n }\n long d = sc.nextLong();\n long p = sc.nextLong();\n long ans = d;\n for (int i = 1; i <= 18 ; i++) {\n if(d >= a[i]){\n int t = ((a[i]+\"\").length());\n long z = (long) ((long) (d-a[i]) /(long) Math.pow(10, t) *(long) Math.pow(10, t) + a[i]);\n if(d - z <= p) {\n ans = z;\n }\n }\n }\n System.out.println(ans);\n }\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "172b804de4eba9cf40681d8ddb7acf6d", "src_uid": "c706cfcd4c37fbc1b1631aeeb2c02b6a", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.Scanner;\r\n\r\npublic class FirstJava {\r\n public static void main(String[] args) {\r\n Scanner aa=new Scanner(System.in);\r\n long n=aa.nextInt();\r\n long m=aa.nextInt();\r\n long z=0;\r\n \r\n if(m==1)\r\n z=n-1;\r\n else if(n==1)\r\n z=m-1;\r\n else\r\n z=(n*m)-n;\r\n \r\n \r\n System.out.println(z);\r\n \r\n \r\n }\r\n}\r\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "b44786a0f77caa9eb9d151ec4b134371", "src_uid": "a91aab4c0618d036c81022232814ef44", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Scanner;\n\n\npublic class a {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint len = in.nextInt();\n\t\tint start = in.nextInt();\n\t\tint rate = in.nextInt();\n\t\tint ans = 0;\n\t\twhile(true){\n\t\t\tans++;\n\t\t\tif(start*rate >= len){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tstart *= rate;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "c80e09c5be70543323ab02dcbbce5d73", "src_uid": "0d01bf286fb2c7950ce5d5fa59a17dd9", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class E {\n\tFastScanner in;\n\tPrintWriter out;\n\n\tint[] cx = new int[] { 2, 1, -1, -2, -1, 1 };\n\tint[] cy = new int[] { 0, 2, 2, 0, -2, -2 };\n\n\tint[] dirx = new int[] { -1, -2, -1, 1, 2, 1 };\n\tint[] diry = new int[] { 2, 0, -2, -2, 0, 2 };\n\n\tlong calc(long i) {\n\t\treturn 3 * (i + 1) * i;\n\t}\n\t\n\tvoid solve() {\n\t\tlong n = in.nextLong();\n\t\tif (n == 0) {\n\t\t\tout.println(\"0 0\");\n\t\t\treturn;\n\t\t}\n\t\tlong l = 0, r = 1000 * 1000 * 1000;\n\t\twhile (r - l > 1) {\n\t\t\tlong m = (l + r) / 2;\n\t\t\tif (calc(m) < n) {\n\t\t\t\tl = m;\n\t\t\t} else {\n\t\t\t\tr = m;\n\t\t\t}\n\t\t}\n\t\tlong i = l + 1;\n\t\tlong cnt = calc(l);\n\t//\tSystem.err.println(\"circle \" + i);\n\t\tfor (int j = 0; j < 6; j++) {\n\t\t\tif (cnt + i >= n) {\n\t\t\t\tlong stx = cx[j] * i, sty = cy[j] * i;\n\t\t\t\t// System.out.println(stx + \" \" + sty);\n\t\t\t\tlong num = n - cnt;\n\t\t\t\tlong rx = stx + num * dirx[j], ry = sty + num * diry[j];\n\t\t\t\tout.println(rx + \" \" + ry);\n\t\t\t\t// System.out.println(num);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tcnt += i;\n\t\t}\n\t\treturn;\n\t}\n\n\tvoid run() {\n\t\tin = new FastScanner();\n\t\tout = new PrintWriter(System.out);\n\n\t\tsolve();\n\n\t\tout.close();\n\t}\n\n\tclass FastScanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tpublic FastScanner() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tString next() {\n\t\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(in.br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\t// TODO Auto-generated catch block\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew E().run();\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "implementation", "binary search"], "code_uid": "a12ed306bb31c64613a2115ebe3a046a", "src_uid": "a4b6a570f5e63462b68447713924b465", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Washoum\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n inputClass in = new inputClass(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n ARomanAndBrowser solver = new ARomanAndBrowser();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class ARomanAndBrowser {\n public void solve(int testNumber, inputClass sc, PrintWriter out) {\n int n = sc.nextInt();\n int k = sc.nextInt();\n int[] tab = new int[n + 1];\n int act1 = 0;\n int act2 = 0;\n for (int i = 1; i <= n; i++) {\n tab[i] = sc.nextInt();\n if (tab[i] == -1) {\n act1++;\n } else {\n act2++;\n }\n }\n int ans = 0;\n\n for (int b = 1; b <= n; b++) {\n act1 = 0;\n act2 = 0;\n for (int c = 1; c <= n; c++) {\n if (Math.abs(c - b) % k == 0) {\n continue;\n } else {\n if (tab[c] == -1) {\n act1++;\n } else {\n act2++;\n }\n }\n }\n ans = Math.max(ans, Math.abs(act1 - act2));\n }\n out.println(ans);\n\n }\n\n }\n\n static class inputClass {\n BufferedReader br;\n StringTokenizer st;\n\n public inputClass(InputStream in) {\n\n br = new BufferedReader(new InputStreamReader(in));\n }\n\n public String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "7eaf4e79ec816a62068e1aafe5709de0", "src_uid": "6119258322e06fa6146e592c63313df3", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\n\npublic class SchoolTeamContest {\n\n public static void main(String[] args) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n args = br.readLine().split(\" \");\n\n int n = Integer.parseInt(args[0]), a = Integer.parseInt(args[3]), b = Integer\n .parseInt(args[2]), c = Integer.parseInt(args[1]);\n int count = 0;\n for (int i = 0; i <= a; i++) {\n for (int j = 0; j <= b; j++) {\n if (i * 2 + j > n)\n break;\n if (c / 2 >= n - (i * 2 + j)) count ++;\n }\n }\n System.out.println(count);\n\n }\n\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "52336b46c0198971a05c9509ea6729f7", "src_uid": "474e527d41040446a18186596e8bdd83", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/*\n * Code Author : Nachiket V Trivedi\n * University : DAIICT\n */\nimport java.util.*;\nimport java.io.*;\nimport java.math.*;\npublic class TennisTournament \n{\n\tpublic static void main(String[] args) \n\t{\n\t\tInputReader in=new InputReader(System.in);\n\t\tOutputStream outputStream = System.out;\n\t\t//-----start writing from here-----//\n\t\tint n=in.nextInt();\n\t\tint b=in.nextInt();\n\t\tint p=in.nextInt();\n\t\tint match=0;\n\t\tint m=n;\n\t\tint flag=0;\n\t\twhile(m>1)\n\t\t{\n\t\t\t\n\t\t\tint tk=1;\n\t\t\tint k=1;\n\t\t\twhile(tk<m)\n\t\t\t{\n\t\t\t\ttk=(int) Math.pow(2, k);\n\t\t\t\tk++;\n\t\t\t}\n\t\t\tflag+=tk/2;\n\t\t\tm=tk/2+(m-tk);\n\t\t\t\t\n\t\t}\n\t\tmatch=flag;\n\t\tSystem.out.println((2*b+1)*match+\" \"+(n*p));\n\t}\n\n\n\t//InputReader class starts from here\n\tpublic static class InputReader \n\t{\n\t\tpublic BufferedReader reader;\n\t\tpublic StringTokenizer tokenizer;\n\n\t\tpublic InputReader(InputStream inputstream) \n\t\t{\n\t\t\treader = new BufferedReader(new InputStreamReader(inputstream));\n\t\t\ttokenizer = null;\n\t\t}\n\n\t\tpublic String nextLine()\n\t\t{\n\t\t\tString fullLine=null;\n\t\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) \n\t\t\t{\n\t\t\t\ttry\n\t\t\t\t{\n\t\t\t\t\tfullLine=reader.readLine();\n\t\t\t\t} \n\t\t\t\tcatch (IOException e) \n\t\t\t\t{\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t\treturn fullLine;\n\t\t\t}\n\t\t\treturn fullLine;\n\t\t}\n\t\tpublic String next() \n\t\t{\n\t\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) \n\t\t\t{\n\t\t\t\ttry \n\t\t\t\t{\n\t\t\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t\t\t}\n\t\t\t\tcatch (IOException e) \n\t\t\t\t{\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tokenizer.nextToken();\n\t\t}\n\t\tpublic long nextLong() \n\t\t{\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\tpublic int nextInt() \n\t\t{\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t}\n\n}\n\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "0223c55b5f916c2d9d52e2c476911d3d", "src_uid": "eb815f35e9f29793a120d120968cfe34", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\t// Code Author: Rutul Patel\nimport java.io.*;\n\timport java.math.BigInteger;\n\timport java.math.RoundingMode;\n\timport java.text.DecimalFormat;\n\timport java.util.*;\n\t\npublic class Main {\n\t\n\t\tstatic double eps=(double)1e-6;\n\t\tstatic long mod=(int)1e9+6;\n\t\tstatic ArrayList<Integer>[] list=new ArrayList[1000003];\n\t\tstatic int[] dist=new int[1000003];\n\t\tpublic static void main(String args[]) throws IOException{\n\t\t\tInputReader sc = new InputReader(System.in);\n\t\t\tOutputStream outputStream = System.out;\n\t\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\t\t//-------------------------------------\n\t\t\t\n\t\t\tint[][] arr=new int[5][5];\n\t\t\tfor(int i=1;i<=4;i++)\n\t\t\t{\n\t\t\t\tfor(int j=1;j<=4;j++)\n\t\t\t\t\tarr[i][j]=sc.nextInt();\n\t\t\t}\n\t\t\t\n\t\t\tboolean[] can=new boolean[5];\n\t\t\tfor(int i=1;i<=4;i++)\n\t\t\t{\n\t\t\t\tfor(int j=1;j<=3;j++)\n\t\t\t\t{\n\t\t\t\t\tif(arr[i][j]==1)\n\t\t\t\t\t\tcan[i]=true;\n\t\t\t\t\tif(j==1 && arr[i][j]==1)\n\t\t\t\t\t{\n\t\t\t\t\t\tint l=i-1;\n\t\t\t\t\t\tif(l==0)\n\t\t\t\t\t\t\tl=4;\n\t\t\t\t\t\tcan[l]=true;\n\t\t\t\t\t}\n\t\t\t\t\telse if(j==2 && arr[i][j]==1)\n\t\t\t\t\t{\n\t\t\t\t\t\tint s=(i+2)%4;\n\t\t\t\t\t\tif(s==0)\n\t\t\t\t\t\t\ts=4;\n\t\t\t\t\t\tcan[s]=true;\n\t\t\t\t\t}\n\t\t\t\t\telse if(arr[i][j]==1)\n\t\t\t\t\t{\n\t\t\t\t\t\tint r=(i+1)%4;\n\t\t\t\t\t\tif(r==0)\n\t\t\t\t\t\t\tr=4;\n\t\t\t\t\t\tcan[r]=true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t/*for(int k=1;k<=4;k++)\n\t\t\t\t\tout.print(can[k]+\" \");\n\t\t\t\tout.println();*/\n\t\t\t}\n\t\t\t/*for(int i=1;i<=4;i++)\n\t\t\t\tout.print(can[i]+\" \");*/\n\t\t\tboolean ans=true;\n\t\t\tfor(int i=1;i<=4;i++)\n\t\t\t{\n\t\t\t\tif(arr[i][4]==1 && can[i])\n\t\t\t\t{\n\t\t\t\t\tans=false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(ans)\n\t\t\t\tout.println(\"NO\");\n\t\t\telse\n\t\t\t\tout.println(\"YES\");\n\t\t\t//-------------------------------------\n\t\t\tout.close();\n\t\t}\n\t\t\n\t\n\t\tstatic class Pair implements Comparable<Pair> {\n\t\t\tint a, b;\n\n\t\t\tPair(int a, int b) {\n\t\t\t\tthis.a = a;\n\t\t\t\tthis.b = b;\n\t\t\t}\n\n\t\t\tpublic int compareTo(Pair o) {\n\t\t\t\t// TODO Auto-generated method stub\n\t\t\t\tif (this.a != o.a)\n\t\t\t\t\treturn Integer.compare(this.a, o.a);\n\t\t\t\telse\n\t\t\t\t\treturn Integer.compare(this.b, o.b);\n\t\t\t\t//return 0;\n\t\t\t}\n\n\t\t\tpublic boolean equals(Object o) {\n\t\t\t\tif (o instanceof Pair) {\n\t\t\t\t\tPair p = (Pair) o;\n\t\t\t\t\treturn p.a == a && p.b == b;\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tpublic int hashCode() {\n\t\t\t\treturn new Integer(a).hashCode() * 31 + new Integer(b).hashCode();\n\t\t\t}\n\n\t\t\tpublic String toString() {\n\t\t\t\treturn a + \" \" + b;\n\t\t\t}\n\t\t}\n\t\t\n\t\tstatic int[] sieve(int n,int[] arr)\n\t\t{\n\t\t\tfor(int i=2;i*i<=n;i++)\n\t\t\t{\n\t\t\t\tif(arr[i]==0)\n\t\t\t\t{\n\t\t\t\t\tfor(int j=i*2;j<=n;j+=i)\n\t\t\t\t\t\tarr[j]=1;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn arr;\n\t\t}\n\t\t\n\t\tstatic boolean isPal(String s)\n\t\t{\n\t\t\tfor(int i=0, j=s.length()-1;i<=j;i++,j--)\n\t\t\t{\n\t\t\t\tif(s.charAt(i)!=s.charAt(j)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\t\tpublic static String rev(String s)\n\t\t{\n\t\t\tStringBuilder sb=new StringBuilder(s);\n\t\t\tsb.reverse();\n\t\t\treturn sb.toString();\n\t\t}\n\t\t \n\t\tstatic long lcm(long a, long b)\n\t\t{\n\t\t return a * (b / gcd(a, b));\n\t\t}\n\t\t\n\t\tstatic long gcd(long a, long b)\n\t\t{\n\t\t while (b > 0)\n\t\t {\n\t\t long temp = b;\n\t\t b = a % b; // % is remainder\n\t\t a = temp;\n\t\t }\n\t\t return a;\n\t\t}\n\t\tstatic long modulo(long a,long b,long c) {\n\t\t\tlong x=1;\n\t\t\tlong y=a;\n\t\t\twhile(b > 0){\n\t\t\t\tif(b%2 == 1){\n\t\t\t\t\tx=(x*y)%c;\n\t\t\t\t}\n\t\t\t\ty = (y*y)%c; // squaring the base\n\t\t\t\tb /= 2;\n\t\t\t}\n\t\t\treturn x%c;\n\t\t}\n\t\tpublic static void debug(Object... o) {\n\t\t\tSystem.out.println(Arrays.deepToString(o));\n\t\t}\n\t\t\n\t\tstatic long sort(int a[]) {\n\t\t\tint n = a.length;\n\t\t\tint b[] = new int[n];\n\t\t\treturn mergeSort(a, b, 0, n - 1);\n\t\t}\n\n\t\tstatic long mergeSort(int a[], int b[], long left, long right) {\n\t\t\tlong c = 0;\n\t\t\tif (left < right) {\n\t\t\t\tlong mid = left + (right - left) / 2;\n\t\t\t\tc = mergeSort(a, b, left, mid);\n\t\t\t\tc += mergeSort(a, b, mid + 1, right);\n\t\t\t\tc += merge(a, b, left, mid + 1, right);\n\t\t\t}\n\t\t\treturn c;\n\t\t}\n\n\t\tstatic long merge(int a[], int b[], long left, long mid, long right) {\n\t\t\tlong c = 0;\n\t\t\tint i = (int) left;\n\t\t\tint j = (int) mid;\n\t\t\tint k = (int) left;\n\t\t\twhile (i <= (int) mid - 1 && j <= (int) right) {\n\t\t\t\tif (a[i] <= a[j]) {\n\t\t\t\t\tb[k++] = a[i++];\n\t\t\t\t} else {\n\t\t\t\t\tb[k++] = a[j++];\n\t\t\t\t\tc += mid - i;\n\t\t\t\t}\n\t\t\t}\n\t\t\twhile (i <= (int) mid - 1)\n\t\t\t\tb[k++] = a[i++];\n\t\t\twhile (j <= (int) right)\n\t\t\t\tb[k++] = a[j++];\n\t\t\tfor (i = (int) left; i <= (int) right; i++)\n\t\t\t\ta[i] = b[i];\n\t\t\treturn c;\n\t\t} \n\t\t\n\t\n\t\tstatic final class InputReader{\n\t\t\tprivate final InputStream stream;\n\t\t\tprivate final byte[] buf=new byte[1024];\n\t\t\tprivate int curChar;\n\t\t\tprivate int numChars;\n\t\t\tpublic InputReader(InputStream stream){this.stream=stream;}\n\t\t\tprivate int read()throws IOException{\n\t\t\t\tif(curChar>=numChars){\n\t\t\t\t\tcurChar=0;\n\t\t\t\t\tnumChars=stream.read(buf);\n\t\t\t\t\tif(numChars<=0)\n\t\t\t\t\t\treturn -1;\n\t\t\t\t}\n\t\t\t\treturn buf[curChar++];\n\t\t\t}\n\t\t\tpublic final int nextInt()throws IOException{return (int)nextLong();}\n\t\t\tpublic final long nextLong()throws IOException{\n\t\t\t\tint c=read();\n\t\t\t\twhile(isSpaceChar(c)){\n\t\t\t\t\tc=read();\n\t\t\t\t\tif(c==-1) throw new IOException();\n\t\t\t\t}\n\t\t\t\tboolean negative=false;\n\t\t\t\tif(c=='-'){\n\t\t\t\t\tnegative=true;\n\t\t\t\t\tc=read();\n\t\t\t\t}\n\t\t\t\tlong res=0;\n\t\t\t\tdo{\n\t\t\t\t\tif(c<'0'||c>'9')throw new InputMismatchException();\n\t\t\t\t\tres*=10;\n\t\t\t\t\tres+=(c-'0');\n\t\t\t\t\tc=read();\n\t\t\t\t}while(!isSpaceChar(c));\n\t\t\t\treturn negative?(-res):(res);\n\t\t\t}\n\t\t\tpublic final int[] readIntBrray(int size)throws IOException{\n\t\t\t\tint[] arr=new int[size];\n\t\t\t\tfor(int i=0;i<size;i++)arr[i]=nextInt();\n\t\t\t\treturn arr;\n\t\t\t}\n\t\t\tpublic final String next()throws IOException{\n\t\t\t\tint c=read();\n\t\t\t\twhile(isSpaceChar(c))c=read();\n\t\t\t\tStringBuilder res=new StringBuilder();\n\t\t\t\tdo{\n\t\t\t\t\tres.append((char)c);\n\t\t\t\t\tc=read();\n\t\t\t\t}while(!isSpaceChar(c));\n\t\t\t\treturn res.toString();\n\t\t\t}\n\t\t\tpublic final String nextLine()throws IOException{\n\t\t\t\tint c=read();\n\t\t\t\twhile(isSpaceChar(c))c=read();\n\t\t\t\tStringBuilder res=new StringBuilder();\n\t\t\t\tdo{\n\t\t\t\t\tres.append((char)c);\n\t\t\t\t\tc=read();\n\t\t\t\t}while(c!='\\n'&&c!=-1);\n\t\t\t\treturn res.toString();\n\t\t\t}\n\t\t\tprivate boolean isSpaceChar(int c){\n\t\t\t\treturn c==' '||c=='\\n'||c=='\\r'||c=='\\t'||c==-1;\n\t\t\t}\n\t\t}\n\t} ", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "055ab5196f2bf4d75a38ee766b21ce4e", "src_uid": "44fdf71d56bef949ec83f00d17c29127", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class P29B {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n Task solver = new Task();\n solver.solve(in, out);\n out.close();\n }\n\n static class Task {\n public void solve(InputReader in, PrintWriter out) {\n double l = in.nextInt();//2 5\n double d = in.nextInt();//1 4\n double v = in.nextInt();//3 3\n double g = in.nextInt();//4 1\n double r = in.nextInt();//5 1\n double t1 = d / v;\n if (t1 < g) {\n out.println(l / v);\n } else {\n out.println((g + r) * Math.ceil(t1 / (g + r)) + (l - d) / v);\n }\n }\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public String nextLine() {\n try {\n return reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n\n public int[] nextIntArray(int n) {\n int[] arr = new int[n];\n for (int i = 0; i < n; i++)\n arr[i] = nextInt();\n return arr;\n }\n\n }\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "6c8c1804ad6745b77ec18d499a301c74", "src_uid": "e4a4affb439365c843c9f9828d81b42c", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class StringTyping {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tString s = scan.next();\n\t\tint ans = 0;\n\t\tboolean bal = false;\n\t\tfor(int i = n-1; i >= 0; i += 0){\n\t\t\tif(i % 2 == 1 && !bal){\n\t\t\t\tint mid = i/2;\n\t\t\t\tString a = s.substring(0, mid+1);\n\t\t\t\tString b = s.substring(mid+1, i+1);\n\t\t\t\tif(a.equals(b)){\n\t\t\t\t bal = true;\n\t\t\t\t\tans++;\n\t\t\t\t\ti /= 2;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans++;\n\t\t\ti--;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}", "lang_cluster": "Java", "tags": ["strings", "implementation"], "code_uid": "85cc0fae26e7f69337ce15782036c4f7", "src_uid": "ed8725e4717c82fa7cfa56178057bca3", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\n\n/**\n * <a href=\"http://codeforces.com/contest/1040/problem/A\">1040A</a>\n */\npublic class _1040A {\n\tpublic static void main(String[] args) throws Exception {\n\t\tBufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n\t\tint[] array = convert(reader.readLine());\n\t\tint n = array[0];\n\n\t\tint[] c = new int[]{array[1], array[2]};\n\n\t\tint[] a = convert(reader.readLine());\n\t\tint sum = 0;\n\t\tfor (int i = 0; i < n / 2; i++) {\n\t\t\tint first = a[i];\n\t\t\tint last = a[n - i - 1];\n\n\t\t\tif (first == last) {\n\t\t\t\tif (first == 2) {\n\t\t\t\t\tsum += 2 * Math.min(array[1], array[2]);\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (first == 2 || last == 2) {\n\t\t\t\tint min = Math.min(first, last);\n\t\t\t\tsum += c[min];\n\t\t\t} else {\n\t\t\t\tSystem.out.println(-1);\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tif ((n % 2 != 0 || n < 2) && a[n / 2] == 2) {\n\t\t\tsum += Math.min(array[1], array[2]);\n\t\t}\n\t\tSystem.out.println(sum);\n\t}\n\n\tprivate static int[] convert(String s) {\n\t\treturn Arrays.stream(s.split(\" \")).mapToInt(Integer::valueOf).toArray();\n\t}\n}", "lang_cluster": "Java", "tags": ["greedy"], "code_uid": "0800dedc52ee00e7fabce5beeae4b8ca", "src_uid": "af07223819aeb5bd6ded4340c472b2b6", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.*;\npublic class Main {\n\tpublic static void main(String args[])\n\t{\n\t\tint mod = 1000000007;\n\t\tScanner scan = new Scanner(System.in);\n\t\tlong a=scan.nextInt(),b= scan.nextInt();\n\t\tlong answer = 0;\n\t\tfor(long i=1;i<=a;i++)\n\t\t{\n\t\t\tlong c = (i*b+1)%mod;\n\t\t\tlong d = (b*(b-1)/2)%mod;\n\t\t\tanswer=(answer+c*d)%mod;\n\t\t}\n\t\tSystem.out.println(answer);\n\t}\n\n}", "lang_cluster": "Java", "tags": ["math"], "code_uid": "683ec48c044fea2a6f0aa3801fc52b6b", "src_uid": "cd351d1190a92d094b2d929bf1e5c44f", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class JavaPuzzler {\n\n //Scanner sc;\n private FastScanner sc;\n private PrintWriter out;\n \n int[] nums;\n \n public void solve() {\n int n = sc.nextInt();\n int x = sc.nextInt();\n nums = new int[101];\n for (int i = 0; i < n; ++i) {\n ++nums[sc.nextInt()];\n }\n int cnt = 0;\n for (int i = 0; i < x; ++i) {\n if (nums[i] == 0) ++cnt;\n }\n if (nums[x] > 0) ++cnt;\n out.println(cnt);\n }\n\n private void run() {\n// try {\n// sc = new FastScanner(new File(\"input.txt\"));\n//// out = new PrintWriter(new File(\"output.txt\"));\n// out = new PrintWriter(System.out);\n// } catch (Exception e) {\n// e.printStackTrace();\n// }\n\n sc = new FastScanner(System.in);\n out = new PrintWriter(System.out);\n\n solve();\n\n out.close();\n\n }\n\n public static void main(String[] args) {\n new JavaPuzzler().run();\n }\n\n private class FastScanner {\n\n BufferedReader br;\n StringTokenizer st;\n\n FastScanner(File f) {\n try {\n br = new BufferedReader(new FileReader(f));\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n }\n\n FastScanner(InputStream f) {\n br = new BufferedReader(new InputStreamReader(f));\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null) {\n return null;\n }\n st = new StringTokenizer(s);\n }\n return st.nextToken();\n }\n\n boolean hasMoreTokens() {\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null) {\n return false;\n }\n st = new StringTokenizer(s);\n }\n return true;\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["greedy", "implementation"], "code_uid": "9f8ac901fcddc04549aba33225a5ca93", "src_uid": "21f579ba807face432a7664091581cd8", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.BufferedReader;\r\nimport java.io.IOException;\r\nimport java.io.InputStreamReader;\r\nimport java.io.PrintWriter;\r\nimport java.util.*;\r\n\r\npublic class C774E {\r\n\r\n static StringBuffer ans1 = new StringBuffer(\"\");\r\n static FastScanner sc = new FastScanner();\r\n static PrintWriter printWriter = new PrintWriter(System.out);\r\n\r\n public static void solve(int n, int m) {\r\n int depth = 0, temp = n;\r\n while(temp > 1) {\r\n temp /= 2;\r\n depth++;\r\n }\r\n int[] dp = new int[depth + 1];\r\n boolean[] visited = new boolean[m * depth + 1];\r\n int size = 0;\r\n for (int i = 1; i <= depth; i++) {\r\n for(int j = 1; j <= m; j++) {\r\n if(!visited[i * j]) size++;\r\n visited[i * j] = true;\r\n }\r\n dp[i] = size;\r\n }\r\n long res = 1;\r\n boolean[] used = new boolean[n + 1];\r\n for(int i = 2; i <= n; i++) {\r\n if(used[i]) continue;\r\n int k = i, count = 0;\r\n while(k <= n) {\r\n used[k] = true;\r\n count++;\r\n if(k * 1L * i != k * i) break;\r\n k *= i;\r\n }\r\n res += dp[count];\r\n }\r\n printWriter.println(res);\r\n }\r\n\r\n public static void main(String[] args) {\r\n int n = sc.nextInt();\r\n int m = sc.nextInt();\r\n solve(n, m);\r\n printWriter.flush();\r\n }\r\n\r\n\r\n /*****************************************************************\r\n ******************** DO NOT READ AFTER THIS LINE *****************\r\n *****************************************************************/\r\n static class FastScanner {\r\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\r\n StringTokenizer st = new StringTokenizer(\"\");\r\n\r\n String next() {\r\n while (!st.hasMoreTokens())\r\n try {\r\n st = new StringTokenizer(br.readLine());\r\n } catch (IOException e) {\r\n e.printStackTrace();\r\n }\r\n return st.nextToken();\r\n }\r\n\r\n int nextInt() {\r\n return Integer.parseInt(next());\r\n }\r\n\r\n int[] readArray(int n) {\r\n int[] a = new int[n];\r\n for (int i = 0; i < n; i++)\r\n a[i] = nextInt();\r\n return a;\r\n }\r\n\r\n long[] readLongArray(int n) {\r\n long[] a = new long[n];\r\n for (int i = 0; i < n; i++)\r\n a[i] = nextLong();\r\n return a;\r\n }\r\n\r\n int[][] read2dArray(int n, int m) {\r\n int arr[][] = new int[n][m];\r\n for (int i = 0; i < n; i++) {\r\n for (int j = 0; j < m; j++) {\r\n arr[i][j] = nextInt();\r\n }\r\n }\r\n return arr;\r\n }\r\n\r\n ArrayList<Integer> readArrayList(int n) {\r\n ArrayList<Integer> arr = new ArrayList<Integer>();\r\n for (int i = 0; i < n; i++) {\r\n int a = nextInt();\r\n arr.add(a);\r\n }\r\n return arr;\r\n }\r\n\r\n long nextLong() {\r\n return Long.parseLong(next());\r\n }\r\n }\r\n}\r\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "number theory"], "code_uid": "92eeda7277f822044685530f8aaff076", "src_uid": "6ca310cb0b6fc4e62e63a731cd55aead", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\n\npublic class C {\n\n\tstatic BufferedReader br;\n\tstatic PrintWriter out;\n\tstatic StringTokenizer tokenizer;\n\t\n\tstatic int[]a = new int[4];\n\tstatic int[]b = new int[4];\n\t\n\tpublic static void main(String[] args) throws IOException {\n\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\t\n\t\tfor(int i=0;i<4;i++){\n\t\t\ttokenizer = new StringTokenizer(br.readLine());\n\t\t\ta[i] = Integer.parseInt(tokenizer.nextToken());\n\t\t\tb[i] = Integer.parseInt(tokenizer.nextToken());\n\t\t}\n\t\t\n\t\tboolean canWin1 = false;\n\t\tboolean canWin2 = false;\n\t\t//out.append(win(0,1,2,3)+\" \"+win(0,1,3,2)+\" \"+win(1,0,2,3)+\" \"+win(1,0,3,2)+\"\\n\");\n\t\t//out.append(win(2,3,0,1)+\" \"+win(3,2,0,1)+\" \"+win(2,3,1,0)+\" \"+win(3,2,1,0)+\"\\n\");\n\t\tif((win(0,1,2,3) && win(0,1,3,2)) || (win(1,0,2,3) && win(1,0,3,2))) canWin1 = true;\n\t\tif((win(2,3,0,1) || win(3,2,0,1)) && (win(2,3,1,0) || win(3,2,1,0))) canWin2 = true;\n\t\t\n\t\t//out.append(\"CANWIN1=\"+canWin1+\"\\n\");\n\t\t//out.append(\"CANWIN2=\"+canWin1+\"\\n\");\n\t\t\n\t\tif(canWin1)out.append(\"Team 1\");\n\t\telse if(canWin2)out.append(\"Team 2\");\n\t\telse out.append(\"Draw\");\n\t\tout.flush();\n\t\tout.close();\n\t}\n\t\n\tpublic static boolean win(int p1,int p2, int p3, int p4){\n\t\tif(a[p1]>b[p3] && b[p2]>a[p4])return true;\n\t\tif(a[p1]<b[p3] && b[p2]<a[p4])return false;\n\t\treturn false;\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "85e1d7297b95f231444ab8c858c58cc0", "src_uid": "1a70ed6f58028a7c7a86e73c28ff245f", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Arrays;\nimport java.util.Collections;\nimport java.util.Scanner;\nimport java.util.concurrent.SynchronousQueue;\n\nimport javax.print.DocFlavor.INPUT_STREAM;\n\npublic class name\n{\n\n\tstatic int pd(long n)\n\t{\n\t\tlong i;\n\t\t/*\n\t\t * if(n==1) return 1;\n\t\t */\n\t\tfor (i = 2; i * i <= n; i++)\n\t\t{\n\t\t\tif (n % i == 0)\n\t\t\t\tbreak;\n\t\t}\n\t\tif (i * i > n)\n\t\t\treturn 1;\n\t\treturn 0;\n\t}\n\n\tpublic static void main(String[] args)\n\t{\n\t\t// TODO Auto-generated method stub\n\t\tString s;\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong n=0;\n\t//\twhile (sc.hasNext())\n\t\t{\n\t\t\tn=sc.nextLong();\n\t\t\tint count = 0;\n\t\t\tif (pd(n) == 1)\n\t\t\t{\n\t\t\t\tSystem.out.println(1);\n\t\t\t}\n\t\t\telse if(n%2==0||pd(n-2)==1||pd(n-3)==1||pd(n-5)==1)\n\t\t\t{\n\t\t\t\tSystem.out.println(2);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tSystem.out.println(3);\n\t\t\t}\n\t\t\t//System.out.println(count);\n\t\t}\n\t\t// System.out.println(count);\n\t}\n\n}", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "9a2fd81abfa05b5d393326796d320c47", "src_uid": "684ce84149d6a5f4776ecd1ea6cb455b", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.Scanner;\n\npublic class JavaApplication35 {\n\n public static void main(String[] args) {\n Scanner input=new Scanner(System.in);\n int a=input.nextInt();int b=input.nextInt();int c=input.nextInt();\nint a1=0;int a2=0;int a3=0;\n while(a>=1 && b>=2 && c>=4){\na=a-1; \nb=b-2;\nc=c-4;\na1++;\na2+=2;\na3+=4;\n } \n System.out.println(a1+a2+a3);\n }\n \n}\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "bd69c2ef59da671e518116c1d2598157", "src_uid": "82a4a60eac90765fb62f2a77d2305c01", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\n\nimport static java.lang.Math.*;\n\npublic class Main implements Runnable {\n\t\n\t//«2», «3», «4», «5», «6», «7», «8», «9», «T», «J», «Q», «K», «A».\n\t\n\tclass Triplet {\n\t\tString card1, card2, card3;\n\t\t\n\t\tpublic Triplet(String card1, String card2, String card3) {\n\t\t\tthis.card1 = card1;\n\t\t\tthis.card2 = card2;\n\t\t\tthis.card3 = card3;\n\t\t}\n\t\t\n\t\t@Override\n\t\tpublic boolean equals(Object obj) {\n\t\t\tif (obj instanceof Triplet) {\n\t\t\t\tTriplet t = (Triplet)obj;\n\t\t\t\treturn this.card1.equals(t.card1) && this.card2.equals(t.card2) && this.card3.equals(t.card3);\n\t\t\t} else {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\t\n\t\t@Override\n\t\tpublic int hashCode() {\n\t\t\tfinal int prime = 31;\n\t\t\treturn card1.hashCode() + prime * (card2.hashCode() + prime * card3.hashCode());\n\t\t}\n\t}\n\t\n\tboolean mayPutOn(String top, String bottom) {\n\t\treturn top.charAt(0) == bottom.charAt(0) || top.charAt(1) == bottom.charAt(1);\n\t}\n\t\n\tvoid solve() throws Exception {\n\t\tint n = sc.nextInt();\n\t\tString[] cards = new String[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcards[i] = sc.nextToken();\n\t\t}\n\t\tif (n == 1 || n == 2 && mayPutOn(cards[1], cards[0])) {\n\t\t\tout.println(\"YES\");\n\t\t\treturn;\n\t\t}\n\t\tif (n == 1 || n == 2) {\n\t\t\tout.println(\"NO\");\n\t\t\treturn;\n\t\t}\n\t\tHashSet<Triplet>[] dp = new HashSet[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tdp[i] = new HashSet<Triplet>();\n\t\t}\n\t\tdp[n - 1].add(new Triplet(cards[n - 1], cards[n - 2], cards[n - 3]));\n\t\tfor (int i = n - 1; i >= 3; i--) {\n\t\t\tfor (Triplet t : dp[i]) {\n\t\t\t\tif (mayPutOn(t.card1, cards[i - 3])) {\n\t\t\t\t\tdp[i - 1].add(new Triplet(t.card2, t.card3, t.card1));\n\t\t\t\t}\n\t\t\t\tif (mayPutOn(t.card1, t.card2)) {\n\t\t\t\t\tdp[i - 1].add(new Triplet(t.card1, t.card3, cards[i - 3]));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (Triplet t : dp[2]) {\n\t\t\tif (mayPutOn(t.card1, t.card2) && mayPutOn(t.card1, t.card3)) {\n\t\t\t\tout.println(\"YES\");\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tout.println(\"NO\");\n\t}\n\t\n\tBufferedReader in;\n\tPrintWriter out;\n\tFastScanner sc;\n\t\n\tstatic Throwable uncaught;\n\t\n\t@Override\n\tpublic void run() {\n\t\ttry {\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(System.out);\n\t\t\tsc = new FastScanner(in);\n\t\t\tsolve();\n\t\t} catch (Throwable t) {\n\t\t\tMain.uncaught = t;\n\t\t} finally {\n\t\t\tout.close();\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) throws Throwable {\n\t\tThread t = new Thread(null, new Main(), \"\", 128 * 1024 * 1024);\n\t\tt.start();\n\t\tt.join();\n\t\tif (uncaught != null) {\n\t\t\tthrow uncaught;\n\t\t}\n\t}\n\n}\n\nclass FastScanner {\n\t\n\tBufferedReader reader;\n\tStringTokenizer strTok;\n\t\n\tpublic FastScanner(BufferedReader reader) {\n\t\tthis.reader = reader;\n\t}\n\t\n\tpublic String nextToken() throws IOException {\n\t\twhile (strTok == null || !strTok.hasMoreTokens()) {\n\t\t\tstrTok = new StringTokenizer(reader.readLine());\n\t\t}\n\t\treturn strTok.nextToken();\n\t}\n\t\n\tpublic int nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\t\n\tpublic long nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\t\n\tpublic double nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n\t\n}", "lang_cluster": "Java", "tags": ["dfs and similar", "dp"], "code_uid": "a79b04fc1ae4acdf3cf38a9df08f6922", "src_uid": "1805771e194d323edacf2526a1eb6768", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": " import java.util.*;\n\n public class A {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int n = in.nextInt();\n in.nextLine();\n String s = in.nextLine();\n System.out.println(f(s));\n }\n\n private static int f(String s) {\n int res = 0;\n int count = 0;\n try {\n String[] arr = s.split(\" \");\n for (int i = 0; i < arr.length; i++) {\n for (Character c : arr[i].toCharArray()){\n if (c == Character.toUpperCase(c)){\n count++;\n }\n }\n res = Math.max(res,count);\n count = 0;\n }\n }catch (Exception e){\n char[] chars = s.toCharArray();\n for (Character c : chars){\n if (c == Character.toUpperCase(c)){\n res++;\n }\n }\n }\n return res;\n }\n\n\n }", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "0ebc7d310eb68b525023ab7767ad2225", "src_uid": "d3929a9acf1633475ab16f5dfbead13c", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.*;\nimport java.lang.*;\nimport java.io.*;\nimport java.math.*;\nimport java.text.*;\npublic class Prac{ \n static class InputReader { \n private final InputStream stream;\n private final byte[] buf = new byte[8192];\n private int curChar, snumChars;\n public InputReader(InputStream st) {\n this.stream = st;\n } \n public int read() {\n if (snumChars == -1)\n throw new InputMismatchException();\n if (curChar >= snumChars) {\n curChar = 0;\n try {\n snumChars = stream.read(buf);\n } \n catch (IOException e) {\n throw new InputMismatchException();\n }\n if (snumChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n public int ni() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n } \n public long nl() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n do {\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n } \n public int[] nia(int n) {\n int a[] = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = ni();\n }\n return a;\n } \n public String rs() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n public String nextLine() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isEndOfLine(c));\n return res.toString();\n } \n public boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n \n private boolean isEndOfLine(int c) {\n return c == '\\n' || c == '\\r' || c == -1;\n } \n }\n public static class Key {\n\n private final int x;\n private final int y;\n\n public Key(int x, int y) {\n this.x = x;\n this.y = y;\n }\n\n @Override\n public boolean equals(Object o) {\n if (this == o) return true;\n if (!(o instanceof Key)) return false;\n Key key = (Key) o;\n return x == key.x && y == key.y;\n }\n\n @Override\n public int hashCode() {\n int result = x;\n result = 31 * result + y;\n return result;\n }\n\n }\n \n static PrintWriter w = new PrintWriter(System.out);\n static long mod=998244353L,mod1=1000000007;\n static int co[][];\n static void dsort(){\n Arrays.parallelSort(co,(o1,o2)->o1[0]!=o2[0]?o1[0]-o2[0]:o1[1]-o2[1]);\n }\n static long power(long x, long y) { \n long temp=0; \n if( y == 0) \n return 1; \n temp = power(x, y/2); \n if (y%2 == 0) \n return (temp*temp)%mod1; \n else\n return (((x*temp)%mod1)*temp)%mod1; \n } \n static long modInverse(long a, long m){\n long num=m;\n long x=1;\n long power=a%mod1;\n while(num>0){\n if(num%2==1){\n x=(x*power)%mod1;\n }\n num>>=1;\n power=(power*power)%mod1; \n }\n return x;\n }\n static long ncr(int n,int r){\n if(n<r)return 0L;\n long ans=fact[n]/(fact[r]*fact[n-r]);\n return ans;\n }\n static long fact[]=new long[1000005];\n public static void findFact(){\n fact[0]=1;\n for(int i=1;i<=1000000;i++){\n fact[i]=(i*fact[i-1])%mod1;\n }\n } \n static long nCr(int n,int r){\n if(n<r)return 0L;\n \n return (fact[n]*modInverse((fact[r]*fact[n-r])%mod1,mod1-2))%mod1;\n }\n static Set<String> set = new HashSet<>(); \n \n // Recursive function to generate \n // permutations of the string \n static void Permutation(String str, String ans) \n { \n \n // If string is empty \n if (str.length() == 0) { \n \n // Add the generated permutation to the \n // set in order to avoid duplicates \n set.add(ans); \n return; \n } \n \n for (int i = 0; i < str.length(); i++) { \n \n // ith character of str \n char ch = str.charAt(i); \n \n // Rest of the string after excluding \n // the ith character \n String ros = str.substring(0, i) \n + str.substring(i + 1); \n \n // Recurvise call \n Permutation(ros, ans + ch); \n } \n } \n public static void main (String[] args)throws IOException{\n InputReader sc=new InputReader(System.in);\n //findFact();\n int n=sc.ni(),k=sc.ni();\n String p=\"\";\n for(int i=1;i<=k;i++){\n p=p+Integer.toString(i);\n }\n Permutation(p,\"\");\n String s[]=new String[n];\n for(int i=0;i<n;i++){\n s[i]=sc.nextLine();\n }\n int ans=Integer.MAX_VALUE;\n for(String x:set){\n int min=Integer.MAX_VALUE,max=Integer.MIN_VALUE;\n for(int i=0;i<n;i++){\n String te=\"\";\n for(int j=0;j<k;j++){\n int in=x.charAt(j)-'1';\n te=te+s[i].charAt(in);\n }\n int num=Integer.parseInt(te);\n min=Math.min(min,num);\n max=Math.max(max,num);\n }\n ans=Math.min(ans,max-min);\n }\n w.println(ans);\n w.close();\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "implementation", "combinatorics"], "code_uid": "e2ffb0cb0f58c790b173befb22cc2aea", "src_uid": "08f85cd4ffbd135f0b630235209273a4", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Nasko\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskA solver = new TaskA();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskA {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.nextInt();\n int s = in.nextInt();\n int[] arr = new int[n];\n for (int i = 0; i < n; ++i) arr[i] = in.nextInt();\n Arrays.sort(arr);\n for (int i = 0; i < n - 1; ++i) s -= arr[i];\n if (s >= 0) out.println(\"YES\");\n else out.println(\"NO\");\n }\n\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "49829d581dec1933ef0a9ced1707a7da", "src_uid": "496baae594b32c5ffda35b896ebde629", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.BigInteger;\n\npublic class ProblemD\n{\n\n static int mod = (int) (1e9+7);\n static InputReader in;\n static PrintWriter out;\n \n public static void main(String[] args)\n {\n in = new InputReader(System.in);\n out = new PrintWriter(System.out); \n \n int n = in.nextInt();\n int m = in.nextInt();\n \n Pair[] a = new Pair[n];\n for(int i = 0; i < n; i++)\n a[i] = new Pair(in.nextInt(), in.nextInt());\n \n Pair[] b = new Pair[m];\n \n for(int i = 0; i < m; i++)\n b[i] = new Pair(in.nextInt(), in.nextInt());\n \n TreeSet<Integer>[] list = new TreeSet[n + m];\n for(int i = 0; i < n + m; i++)\n list[i] = new TreeSet<>();\n \n for(int i = 0; i < n; i++){\n for(int j = 0; j < m; j++){\n if(a[i].x == b[j].x && a[i].y == b[j].y) continue;\n if(a[i].x == b[j].x){\n list[i].add(a[i].x);\n list[j + n].add(a[i].x);\n }\n else if(a[i].y == b[j].y){\n list[i].add(a[i].y);\n list[j + n].add(a[i].y);\n }\n else if(a[i].x == b[j].y) {\n list[i].add(a[i].x);\n list[j + n].add(a[i].x);\n }\n else if(a[i].y == b[j].x){\n list[i].add(a[i].y);\n list[j + n].add(a[i].y);\n }\n }\n }\n \n TreeSet<Integer> set = new TreeSet<>();\n for(int i = 0; i < n + m; i++){\n if(list[i].size() > 1){\n out.println(-1);\n out.close();\n return;\n }\n \n if(list[i].size() == 1){\n set.add(list[i].first());\n }\n }\n \n out.println(set.size() > 1 ? 0 : set.first());\n out.close(); \n }\n \n static class Pair implements Comparable<Pair>\n {\n\n int x,y;\n int i;\n \n Pair (int x,int y)\n {\n if(x > y){\n x = x ^ y;\n y = x ^ y;\n x = x ^ y;\n }\n this.x = x;\n this.y = y;\n }\n\n Pair (int x,int y, int i)\n {\n this.x = x;\n this.y = y;\n this.i = i;\n }\n\n public int compareTo(Pair o)\n {\n return Integer.compare(this.x, o.x);\n }\n\n public boolean equals(Object o)\n {\n if (o instanceof Pair)\n {\n Pair p = (Pair)o;\n return p.x == x && p.y==y;\n }\n return false;\n }\n\n @Override\n public String toString()\n {\n return x + \" \"+ y + \" \"+i;\n }\n\n /*public int hashCode()\n {\n return new Long(x).hashCode() * 31 + new Long(y).hashCode();\n }*/\n\n } \n\n \n static String rev(String s){\n StringBuilder sb=new StringBuilder(s);\n sb.reverse();\n return sb.toString();\n }\n \n static long gcd(long x,long y)\n {\n if(y==0)\n return x;\n else\n return gcd(y,x%y);\n }\n\n static int gcd(int x,int y)\n {\n if(y==0)\n return x;\n else \n return gcd(y,x%y);\n }\n\n static long pow(long n,long p,long m)\n {\n long result = 1;\n if(p==0){\n return 1;\n }\n \n while(p!=0)\n {\n if(p%2==1)\n result *= n;\n if(result >= m)\n result %= m;\n p >>=1;\n n*=n;\n if(n >= m)\n n%=m;\n }\n \n return result;\n }\n\n static long pow(long n,long p)\n {\n long result = 1;\n if(p==0)\n return 1;\n\n while(p!=0)\n {\n if(p%2==1)\n result *= n;\t \n p >>=1;\n n*=n;\t \n }\n return result;\n }\n\n static void debug(Object... o)\n {\n System.out.println(Arrays.deepToString(o));\n }\n\n static class InputReader\n {\n\n private final InputStream stream;\n private final byte[] buf = new byte[8192];\n private int curChar, snumChars;\n private SpaceCharFilter filter;\n\n public InputReader(InputStream stream)\n {\n this.stream = stream;\n }\n\n public int snext()\n {\n if (snumChars == -1)\n throw new InputMismatchException();\n if (curChar >= snumChars)\n {\n curChar = 0;\n try\n {\n snumChars = stream.read(buf);\n } catch (IOException e)\n {\n throw new InputMismatchException();\n }\n if (snumChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public int nextInt()\n {\n int c = snext();\n while (isSpaceChar(c))\n {\n c = snext();\n }\n int sgn = 1;\n if (c == '-')\n {\n sgn = -1;\n c = snext();\n }\n int res = 0;\n do\n {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = snext();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public long nextLong()\n {\n int c = snext();\n while (isSpaceChar(c))\n {\n c = snext();\n }\n int sgn = 1;\n if (c == '-')\n {\n sgn = -1;\n c = snext();\n }\n long res = 0;\n do\n {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = snext();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public int[] nextIntArray(int n)\n {\n int a[] = new int[n];\n for (int i = 0; i < n; i++)\n {\n a[i] = nextInt();\n }\n return a;\n }\n\n public long[] nextLongArray(int n)\n {\n long a[] = new long[n];\n for (int i = 0; i < n; i++)\n {\n a[i] = nextLong();\n }\n return a;\n }\n\n public String readString()\n {\n int c = snext();\n while (isSpaceChar(c))\n {\n c = snext();\n }\n StringBuilder res = new StringBuilder();\n do\n {\n res.appendCodePoint(c);\n c = snext();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n public String nextLine()\n {\n int c = snext();\n while (isSpaceChar(c))\n c = snext();\n StringBuilder res = new StringBuilder();\n do\n {\n res.appendCodePoint(c);\n c = snext();\n } while (!isEndOfLine(c));\n return res.toString();\n }\n\n public boolean isSpaceChar(int c)\n {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n private boolean isEndOfLine(int c)\n {\n return c == '\\n' || c == '\\r' || c == -1;\n }\n\n public interface SpaceCharFilter\n {\n public boolean isSpaceChar(int ch);\n }\n\n }\n} \n", "lang_cluster": "Java", "tags": ["bitmasks"], "code_uid": "81833dd03ed31a84248b823ffa8161ca", "src_uid": "cb4de190ae26127df6eeb7a1a1db8a6d", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "public class A {\n public static void main(String...args) {\n String s = new java.util.Scanner(System.in).next();\n int a, b, num;\n a = 0;\n b = 0;\n num = 0;\n \n for(int i = 0; i < s.length(); i++) {\n if (s.charAt(i) == 'A') {\n for (int j = i + 1; j < s.length(); j++) {\n if (s.charAt(j) == 'Q') {\n a++;\n }\n }\n for (int k = i - 1; k >= 0; k--) {\n if (s.charAt(k) == 'Q') {\n b++;\n }\n }\n num += a * b;\n a = 0;\n b = 0;\n }\n }\n System.out.println(num);\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "dp"], "code_uid": "a88c59e09ed8a5737c4c763911373e00", "src_uid": "8aef4947322438664bd8610632fe0947", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\nimport java.math.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scn = new Scanner(System.in);\n int b = scn.nextInt();\n int g = scn.nextInt();\n int n = scn.nextInt();\n\n int min = n - Math.min(b, n);\n\n int max = Math.min(n, g);\n System.out.println(max - min + 1);\n\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "math"], "code_uid": "12f4575986e87bc49c145cbbd116c8ad", "src_uid": "9266a69e767df299569986151852e7b1", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class CF347A{\n\n\tprivate static InputStream stream;\n\tprivate static PrintWriter pw;\n\tprivate static byte[] buf = new byte[1024];\n\tprivate static int curChar;\n\tprivate static int numChars;\n\tprivate static SpaceCharFilter filter;\n\t\n\n\tprivate static void soln(){\n\t\tint n = nextInt();\n\t\tint[] arr = nextIntArray(n);\n\t\tArrays.sort(arr);\n\t\tint temp = arr[0];\n\t\tarr[0] = arr[n-1];\n\t\tarr[n-1] = temp;\n\t\tpArray(arr);\n\t}\n\n\tpublic static void main(String[] args){\n\t\tInputReader(System.in);\n\t\tpw = new PrintWriter(System.out);\n\t\tsoln();\n\t\tpw.close();\n\t}\n\n\n\t// To Get Input\n\t// Some Buffer Methods\n\n\tpublic static void InputReader(InputStream stream1) {\n\t\tstream = stream1;\n\t}\n\n\tprivate static boolean isWhitespace(int c) {\n\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t}\n\n\tprivate static boolean isEndOfLine(int c) {\n\t\treturn c == '\\n' || c == '\\r' || c == -1;\n\t}\n\n\tprivate static int read() {\n\t\tif (numChars == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (curChar >= numChars) {\n\t\t\tcurChar = 0;\n\t\t\ttry {\n\t\t\t\tnumChars = stream.read(buf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (numChars <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buf[curChar++];\n\t}\n\n\tprivate static int nextInt() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tint res = 0;\n\t\tdo {\n\t\t\tif (c < '0' || c > '9')\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n \n\tprivate static long nextLong() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tlong res = 0;\n\t\tdo {\n\t\t\tif (c < '0' || c > '9')\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n \n\tprivate static String nextToken() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tStringBuilder res = new StringBuilder();\n\t\tdo {\n\t\t\tres.appendCodePoint(c);\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res.toString();\n\t}\n \n\tprivate static String nextLine() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tStringBuilder res = new StringBuilder();\n\t\tdo {\n\t\t\tres.appendCodePoint(c);\n\t\t\tc = read();\n\t\t} while (!isEndOfLine(c));\n\t\treturn res.toString();\n\t}\n\n\tprivate static int[] nextIntArray(int n) {\n\t\tint[] arr = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tarr[i] = nextInt();\n\t\t}\n\t\treturn arr;\n\t}\n\t \n\tprivate static long[] nextLongArray(int n) {\n\t\tlong[] arr = new long[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tarr[i] = nextLong();\n\t\t}\n\t\treturn arr;\n\t}\n\n\tprivate static void pArray(int[] arr){\n\t\tfor (int i=0; i<arr.length; i++) {\n\t\t\tSystem.out.print(arr[i] + \" \");\n\t\t}\n\t\tSystem.out.println();\n\t\treturn;\n\t}\n\n\tprivate static void pArray(long[] arr){\n\t\tfor (int i=0; i<arr.length; i++) {\n\t\t\tSystem.out.print(arr[i] + \" \");\n\t\t}\n\t\tSystem.out.println();\n\t\treturn;\t\t\n\t}\n\n\tprivate static boolean isSpaceChar(int c) {\n\t\tif (filter != null)\n\t\t\treturn filter.isSpaceChar(c);\n\t\treturn isWhitespace(c);\n\t}\n \n\tprivate interface SpaceCharFilter {\n\t\tpublic boolean isSpaceChar(int ch);\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["sortings", "constructive algorithms", "implementation"], "code_uid": "0055168145770ae1525236dd56d042f0", "src_uid": "4408eba2c5c0693e6b70bdcbe2dda2f4", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.HashSet;\nimport java.util.Scanner;\npublic class CavePainting {\n public static void main(String[] args) {\n Scanner sc=new Scanner(System.in);\n long n=sc.nextLong();\n long k=sc.nextLong();\n HashSet<Long> hs=new HashSet<>();\n \n for(int i=1;i<=k;i++)\n {\n long d=n%i;\n if(hs.contains(d))\n {\n System.out.println(\"No\");\n return;\n }\n else\n {\n hs.add(d);\n }\n }\n System.out.println(\"Yes\");\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "number theory"], "code_uid": "c45b9a586d5aa76ec2ca30ba39e00c9f", "src_uid": "5271c707c9c72ef021a0baf762bf3eb2", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// package Practice2.CF200;\n\nimport java.util.Scanner;\n\npublic class CF201A {\n public static void main(String[] args) {\n Scanner s = new Scanner(System.in);\n int x = s.nextInt();\n if(x==3)\n System.out.println(5);\n else {\n int i = 1;\n while (x > (float) (i * i + 1) / 2)\n i = i + 2;\n System.out.println(i);\n }\n } \n}", "lang_cluster": "Java", "tags": ["math", "dp", "constructive algorithms"], "code_uid": "f3228666c289b3ef9899eee6120fc64c", "src_uid": "01eccb722b09a0474903b7e5abc4c47a", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Arrays;\nimport java.util.Scanner;\npublic class main {\n public static void main(String args[])\n {\n Scanner sc=new Scanner(System.in);\n int n=sc.nextInt();\n int l=sc.nextInt();\n int a[]=new int[n];\n int aa[]=new int[n];\n int bb[]=new int[n];\n int b[]=new int[n];\n for (int i=0;i< n;i++)\n {\n a[i]=sc.nextInt(); \n }\n for (int i=0;i< n;i++)\n {\n b[i]=sc.nextInt();\n }\n aa[0]=(l-a[n-1])+a[0];\n bb[0]=(l-b[n-1])+b[0];\n for (int i=1;i<n;i++)\n {\n aa[i]=a[i]-a[i-1];\n bb[i]=b[i]-b[i-1]; \n }\n int f=1;\n for(int i=0;i<n;i++)\n {\n int cnt=0;\n for(int j=0;j<n;j++)\n {\n if(aa[j]==bb[j])\n {\n cnt++;\n }\n }\n if(cnt==n)\n {\n f=0;\n break;\n }\n else\n {\n int temp=bb[0];\n for(int k=0;k<n;k++)\n {\n if(k==n-1)\n bb[k]=temp;\n else\n bb[k]=bb[k+1];\n }\n \n }\n }\n if(f==0)\n System.out.println(\"YES\");\n else\n System.out.println(\"NO\"); \n }\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "implementation"], "code_uid": "f6419f0ef6cec4b5ffcebe0b42c0bda7", "src_uid": "3d931684ca11fe6141c6461e85d91d63", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*; //PrintWriter\nimport java.math.*; //BigInteger, BigDecimal\nimport java.util.*; //StringTokenizer, ArrayList\n\n\npublic class R258_Div1_MemSQL_A //Name: Eevee\n{\t\n\tFastReader in;\n\tPrintWriter out;\n\t\n\tpublic static void main(String[] args) {\n\t\tnew R258_Div1_MemSQL_A().run();\n\t}\n\t\n\tvoid run()\n\t{\t\t\n\t\tin = new FastReader(System.in);\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.close();\n\t}\n\t\n\tvoid solve()\n\t{\n\t\tString[] p = new String[]{\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"};\n\t\t\n\t\tint n = in.nextInt();\n\t\tString s = in.next();\n\t\t\n\t\tfor (String st : p)\n\t\t{\n\t\t\tif (st.length() == n)\n\t\t\t{\n\t\t\t\tboolean ok = true;\t\t\t\n\t\t\t\tfor (int j = 0; j < n; j++)\n\t\t\t\t\tif (s.charAt(j) != '.' && s.charAt(j) != st.charAt(j))\n\t\t\t\t\t\tok = false;\n\t\t\t\n\t\t\t\tif (ok)\n\t\t\t\t{\n\t\t\t\t\tout.println(st);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\t\n\t}\n\n\t//-----------------------------------------------------\n\tvoid runWithFiles() {\n\t\tin = new FastReader(new File(\"input.txt\"));\n\t\ttry {\n\t\t\tout = new PrintWriter(new File(\"output.txt\"));\n\t\t} \n\t\tcatch (FileNotFoundException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t\tsolve();\n\t\tout.close();\n\t}\n\t\n\tclass FastReader\n\t{\n\t BufferedReader br;\n\t StringTokenizer tokenizer;\n\t \n\t public FastReader(InputStream stream)\n\t {\n\t br = new BufferedReader(new InputStreamReader(stream));\n\t tokenizer = null;\n\t }\n\t\tpublic FastReader(File f) {\n\t\t\ttry {\n\t\t\t\tbr = new BufferedReader(new FileReader(f));\n\t\t\t\ttokenizer = null;\n\t\t\t}\n\t\t\tcatch (FileNotFoundException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\t \n\t private String next() {\n\t while (tokenizer == null || !tokenizer.hasMoreTokens())\n\t try {\n\t \ttokenizer = new StringTokenizer(br.readLine());\n\t }\n\t catch (IOException e) {\n\t throw new RuntimeException(e);\n\t }\n\t return tokenizer.nextToken();\n\t }\n\t\tpublic String nextLine() {\n\t\t\ttry\t{\n\t\t\t\treturn br.readLine();\n\t\t\t}\n\t\t\tcatch(Exception e) {\n\t\t\t\tthrow(new RuntimeException());\n\t\t\t}\n\t\t}\n\n\t int nextInt() {\n\t return Integer.parseInt(next());\n\t }\n\t long nextLong() {\n\t return Long.parseLong(next());\n\t }\n\t double nextDouble() {\n\t return Double.parseDouble(next());\n\t }\t \n\t BigInteger nextBigInteger() {\n\t return new BigInteger(next());\n\t }\n\t BigDecimal nextBigDecimal() {\n\t return new BigDecimal(next());\n\t }\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "strings", "implementation"], "code_uid": "47e12e299be12811ea64637e56161369", "src_uid": "ec3d15ff198d1e4ab9fd04dd3b12e6c0", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class recycle {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\t\n\t\tFastScanner qwe = new FastScanner(System.in);\n\t\tlong[] fact = new long[21];\n\t\tfact[0] = 1;\n\t\tfor (int i = 1; i < fact.length; i++) {\n\t\t\tfact[i] = fact[i-1]*i;\n\t\t}\n\t\t\n\t\tint n = qwe.nextInt();\n\t\tint even = 2*n-2;\n\t\tSystem.out.println(fact[even]/fact[even/2]/fact[even/2]);\n\t\t\n\t\t\n\t}\n\t\n\tstatic class FastScanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\t\t\n\t\tpublic FastScanner(InputStream in) throws IOException{\n\t\t\tbr = new BufferedReader(new InputStreamReader(in));\n\t\t\tst = new StringTokenizer(br.readLine().trim());\n\t\t}\n\t\tpublic int numTokens() throws IOException {\n\t\t\tif(!st.hasMoreTokens()){\n\t\t\t\tst = new StringTokenizer(br.readLine().trim());\n\t\t\t\treturn numTokens();\n\t\t\t}\n\t\t\treturn st.countTokens();\n\t\t}\n\t\tpublic String next() throws IOException {\n\t\t\tif(!st.hasMoreTokens()){\n\t\t\t\tst = new StringTokenizer(br.readLine().trim());\n\t\t\t\treturn next();\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\t\tpublic double nextDouble() throws IOException{\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t\tpublic float nextFloat() throws IOException{\n\t\t\treturn Float.parseFloat(next());\n\t\t}\n\t\tpublic long nextLong() throws IOException{\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\tpublic int nextInt() throws IOException{\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\tpublic String nextLine() throws IOException{\n\t\t\treturn br.readLine().trim();\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "0d1db2c1a47f89b24fa698eed27d87a5", "src_uid": "2f650aae9dfeb02533149ced402b60dc", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class Solution {\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st;\n\n\t\tst = new StringTokenizer(br.readLine());\n\n\t\tlong n = Long.parseLong(st.nextToken());\n\t\tint m = Integer.parseInt(st.nextToken());\n\n\t\tlong[][] a = new long[m][m];\n\t\ta[0][0] = 1l;\n\t\ta[0][m - 1] = 1l;\n\n\t\tfor (int i = 1; i < a.length; i++) {\n\t\t\ta[i][i - 1] = 1l;\n\t\t}\n\n\t\tlong[][] ans = pow(a, n + 1);\n\t\tSystem.out.println(ans[0][m - 1]);\n\t\t// print();\n\t}\n\n\tstatic void print(long[][] a) {\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\tfor (int j = 0; j < a.length; j++) {\n\t\t\t\tSystem.out.print(a[i][j] + \" \");\n\t\t\t}\n\t\t\tSystem.out.println();\n\t\t}\n\t}\n\n\tstatic long[][] pow(long[][] a, long n) {\n\t\tif (n == 1) {\n\t\t\treturn a;\n\t\t}\n\n\t\tif (n % 2 == 0) {\n\t\t\tlong[][] tmp = pow(a, n / 2);\n\t\t\treturn multiply(tmp, tmp);\n\t\t} else {\n\t\t\tlong[][] tmp = pow(a, n / 2);\n\t\t\treturn multiply(multiply(tmp, tmp), a);\n\t\t}\n\t}\n\n\tstatic int MOD = 1000000007;\n\n\tstatic long[][] multiply(long[][] a, long[][] b) {\n\t\tint n = a.length;\n\t\tlong[][] ans = new long[n][n];\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tlong sum = 0l;\n\t\t\t\tfor (int k = 0; k < n; k++) {\n\t\t\t\t\tlong temp = (a[i][k] * b[k][j]) % MOD;\n\t\t\t\t\tsum = (sum + temp) % MOD;\n\t\t\t\t}\n\t\t\t\tans[i][j] = sum;\n\t\t\t}\n\t\t}\n\n\t\treturn ans;\n\t}\n\n}", "lang_cluster": "Java", "tags": ["math", "matrices", "dp"], "code_uid": "638246f1b9355dad49658ea923e9b6f4", "src_uid": "e7b9eec21d950f5d963ff50619c6f119", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.lang.*;\nimport java.lang.reflect.Array;\nimport java.math.BigInteger;\nimport java.util.regex.*;\n\npublic class Main{\n\t static long dp[][][][]=new long [16][16][16][4];\n\t static void ini() {\n\t\t for(int i=0;i<16;i++) {\n\t\t\t for(int j=0;j<16;j++) {\n\t\t\t\t for(int k=0;k<16;k++) {\n\t\t\t\t\t for(int l=0;l<4;l++) {\n\t\t\t\t\t\t dp[i][j][k][l]=-1L;\n\t\t\t\t\t }\n\t\t\t\t }\n\t\t\t }\n\t\t }\n\t }\n\t static int chk(long i) {\n\t\t if(i==0L)\n\t\t\t return 1;\n\t\t else\n\t\t\t return 0;\n\t }\n\t static long f(long a,long b,long c,int taken) {\n\t\tint got=(int) (a+b+c);\n\t\tint have=chk(a)+chk(b)+chk(c);\n\t\tif(have==2) {\n\t\t\tif(got==1)\n\t\t\t\treturn 1L;\n\t\t\telse\n\t\t\t\treturn 0L;\n\t\t}\n\t\tif(dp[(int) a][(int) b][(int) c][taken]!=-1) {\n\t\t\treturn dp[(int) a][(int) b][(int) c][taken];\n\t\t}\n\t\tlong ans=0L;\n\t\t if(taken == 0) {\n\t\t\t if(a!=0)\n\t\t\t ans+=(a*f(a-1,b,c,1))%mod; ans%=mod;\n\t\t\t if(b!=0)\n\t\t\t ans+=(b*f(a,b-1,c,2))%mod; ans%=mod;\n\t\t\t if(c!=0)\n\t\t\t ans+=(c*f(a,b,c-1,3))%mod; ans%=mod;\n\t\t }\n\t\t else {\n\t\t\t ans+=((taken==1 || a==0)?0L:(a*f(a-1,b,c,1))%mod)%mod; ans%=mod;\n\t\t\t ans+=((taken==2 || b==0)?0L:(b*f(a,b-1,c,2))%mod)%mod; ans%=mod;\n\t\t\t ans+=((taken==3 || c==0)?0L:(c*f(a,b,c-1,3))%mod)%mod; ans%=mod;\n\t\t }\n\t\t dp[(int) a][(int) b][(int) c][taken]=ans;\n\t\t return ans;\n\t }\n\tpublic static void main(String[] args)\n {\n InputReader in=new InputReader(System.in);\n PrintWriter pw = new PrintWriter(System.out);\n int n=in.nextInt();\n int total=in.nextInt();\n int t[]=new int[n];\n int g[]=new int[n];\n for(int i=0;i<n;i++) {\n \t t[i]=in.nextInt();\n \t g[i]=in.nextInt();\n }\n long ans=0L;\n for(int i=0;i<(1<<n);i++) {\n \t int sum=0;\n \t int a[]=new int[4];\n \t for(int j=0;j<n;j++) {\n \t\t \n \t\t if(((i>>j)&1)==1) {\n \t\t\t sum+=t[j];\n \t\t\t a[g[j]]++;\n \t\t }\n \t }\n \t if(sum==total) {\n \t\t ini();\n \t\t ans=(ans+f(a[1],a[2],a[3],0))%mod;\n \t }\n }\n pw.println(ans);\n pw.flush();\n pw.close();\n \n \n }\n private static void debug(Object... o) {\n \t\tSystem.out.println(Arrays.deepToString(o));\n \t}\n static class InputReader \n {\n private final InputStream stream;\n private final byte[] buf = new byte[8192];\n private int curChar, snumChars;\n private SpaceCharFilter filter;\n \n public InputReader(InputStream stream) \n { \n this.stream = stream;\n }\n public int snext() \n {\n if (snumChars == -1)\n throw new InputMismatchException();\n if (curChar >= snumChars) \n {\n curChar = 0;\n try \n {\n snumChars = stream.read(buf);\n } \n \n catch (IOException e) \n {\n throw new InputMismatchException();\n }\n \n if (snumChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n \n public int nextInt() \n {\n int c = snext();\n while (isSpaceChar(c)) \n {\n c = snext();\n }\n int sgn = 1;\n if (c == '-')\n {\n sgn = -1;\n c = snext();\n }\n int res = 0;\n do \n {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = snext();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n \n public long nextLong()\n {\n int c = snext();\n while (isSpaceChar(c)) \n {\n c = snext();\n }\n int sgn = 1;\n if (c == '-') \n {\n sgn = -1;\n c = snext();\n }\n long res = 0;\n do \n {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = snext();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n \n public int[] nextIntArray(int n) \n {\n int a[] = new int[n];\n for (int i = 0; i < n; i++) \n {\n a[i] = nextInt();\n }\n return a;\n }\n static class tri implements Comparable<tri> {\n int p, c, l;\n \n tri(int p, int c, int l) {\n this.p = p;\n this.c = c;\n this.l = l;\n }\n \n public int compareTo(tri o) {\n return Integer.compare(l, o.l);\n }\n }\n \n public String readString()\n {\n int c = snext();\n while (isSpaceChar(c)) \n {\n c = snext();\n }\n StringBuilder res = new StringBuilder();\n do \n {\n res.appendCodePoint(c);\n c = snext();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n \n public String nextLine() \n {\n int c = snext();\n while (isSpaceChar(c))\n c = snext();\n StringBuilder res = new StringBuilder();\n do \n {\n res.appendCodePoint(c);\n c = snext();\n } while (!isEndOfLine(c));\n return res.toString();\n }\n \n public boolean isSpaceChar(int c) \n {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n \n private boolean isEndOfLine(int c) \n {\n return c == '\\n' || c == '\\r' || c == -1;\n }\n \n public interface SpaceCharFilter\n {\n public boolean isSpaceChar(int ch);\n }\n }\n public static long mod = 1000000007;\n public static int d;\n public static int p;\n public static int q;\n \n public static int[] suffle(int[] a,Random gen)\n {\n int n = a.length;\n for(int i=0;i<n;i++)\n {\n int ind = gen.nextInt(n-i)+i;\n int temp = a[ind];\n a[ind] = a[i];\n a[i] = temp;\n }\n return a;\n }\n \n public static void swap(int a, int b){\n int temp = a;\n a = b;\n b = temp;\n }\n \n /* public static long primeFactorization(long n)\n {\n HashSet<Integer> a =new HashSet<Integer>();\n \tlong cnt=0;\n for(int i=2;i*i<=n;i++)\n {\n while(a%i==0)\n {\n a.add(i);\n a/=i;\n }\n }\n if(a!=1)\n \tcnt++;\n //a.add(n);\n return cnt;\n }*/\n \n public static void sieve(boolean[] isPrime,int n)\n {\n for(int i=1;i<n;i++)\n isPrime[i] = true;\n \n isPrime[0] = false;\n isPrime[1] = false;\n \n for(int i=2;i*i<n;i++)\n {\n if(isPrime[i] == true)\n {\n for(int j=(2*i);j<n;j+=i)\n isPrime[j] = false;\n }\n }\n }\n \n public static int GCD(int a,int b)\n {\n if(b==0)\n return a;\n else\n return GCD(b,a%b);\n }\n \n public static long GCD(long a,long b)\n {\n if(b==0)\n return a;\n else\n return GCD(b,a%b);\n }\n \n public static void extendedEuclid(int A,int B)\n {\n if(B==0)\n {\n d = A;\n p = 1 ;\n q = 0;\n }\n else\n {\n extendedEuclid(B, A%B);\n int temp = p;\n p = q;\n q = temp - (A/B)*q;\n }\n }\n \n public static long LCM(long a,long b)\n {\n return (a*b)/GCD(a,b);\n }\n \n public static int LCM(int a,int b)\n {\n return (a*b)/GCD(a,b);\n }\n \n public static int binaryExponentiation(int x,int n)\n {\n int result=1;\n while(n>0)\n {\n if(n % 2 ==1)\n result=result * x;\n x=x*x;\n n=n/2;\n }\n return result;\n }\n \n public static long binaryExponentiation(long x,long n)\n {\n long result=1;\n while(n>0)\n {\n if(n % 2 ==1)\n result=result * x;\n x=x*x;\n n=n/2;\n }\n return result;\n }\n \n public static int modularExponentiation(int x,int n,int M)\n {\n int result=1;\n while(n>0)\n {\n if(n % 2 ==1)\n result=(result * x)%M;\n x=(x%M*x)%M;\n n=n/2;\n }\n return result;\n }\n \n public static long modularExponentiation(long x,long n,long M)\n {\n long result=1;\n while(n>0)\n {\n if(n % 2 ==1)\n result=(result%M * x%M)%M;\n x=(x%M * x%M)%M;\n n=n/2;\n }\n return result;\n }\n \n public static long modInverse(int A,int M)\n {\n return modularExponentiation(A,M-2,M);\n }\n \n public static long modInverse(long A,long M)\n {\n return modularExponentiation(A,M-2,M);\n }\n \n public static boolean isPrime(int n)\n {\n \n if (n <= 1) return false;\n if (n <= 3) return true;\n \n if (n%2 == 0 || n%3 == 0) \n return false;\n \n for (int i=5; i*i<=n; i=i+6)\n {\n if (n%i == 0 || n%(i+2) == 0)\n return false;\n }\n \n return true;\n }\n \n public static long[] shuffle(long[] a, Random gen){ \n for(int i = 0, n = a.length;i < n;i++){ \n int ind = gen.nextInt(n-i)+i; \n long d = a[i]; \n a[i] = a[ind]; \n a[ind] = d; \n } \n return a; \n }\n static class pair implements Comparable<pair>{\n \t Long x;\n Long y;\n Integer z;\n pair(long l,long y2,int z){\n this.x=l;\n this.y=y2;\n this.z=z;\n }\n public int compareTo(pair o) {\n int result = x.compareTo(o.x);\n if(result==0)\n result = y.compareTo(o.y);\n \n return result;\n } \n public String toString(){\n return (x+\" \"+y);\n }\n } \n \n \n}", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "bitmasks"], "code_uid": "7095b53fcc8a89ebe0663a2519b18728", "src_uid": "ac2a37ff4c7e89a345b189e4891bbf56", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.BufferedWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\nimport java.math.BigInteger;\nimport java.util.ArrayDeque;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.BitSet;\nimport java.util.Collection;\nimport java.util.Comparator;\nimport java.util.HashMap;\nimport java.util.Iterator;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.PriorityQueue;\nimport java.util.Scanner;\nimport java.util.Stack;\nimport java.util.StringTokenizer;\n\n\npublic class Main {\n\n// private static int f(C a, C b) {\n// \n// double d = Math.sqrt(d);\n// return 0;\n// }\n//\n//\n// \n// \n static class C implements Comparable{\n \n int x;\n \n public C(int x){\n this.x=x;\n \n }\n public int compare(C x, C y){\n return x.x-y.x;\n \n }\n\n @Override\n public int compareTo(Object x) {\n x = (C) x;\n return this.compare(this,(C)x);\n }\n }\n \n \n public static void main(String[] args) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n BufferedWriter bw = new BufferedWriter(new PrintWriter(System.out));\n \n int[] m = {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};\n int[][] d = new int[12][7];\n int end = 4;\n for(int i=0;i<12;i++){\n //System.out.println(\"start\");\n int cnt = 0;\n if(end%7 > 0){\n //System.out.println(\"filling month \"+i+\" from to \"+end+\" \"+6);\n for(int j=end;j<7;j++){\n d[i][j] += 1;\n cnt += 1;\n }\n \n end = 0;\n }\n \n //fill it up\n while(cnt != m[i]){\n //System.out.println(\"filling \"+i+\" \"+cnt+\" \"+m[i]);\n for(int j=0;j<7;j++){\n d[i][j] += 1;\n cnt += 1;\n end = j;\n \n if(cnt == m[i]){\n //System.out.println(\"ending month \"+i+\" after x days at \"+m[i]+\" \"+end);\n end += 1;\n end %= 7;\n break;\n }\n }\n \n \n }\n \n }\n \n String[] in = br.readLine().split(\" \");\n if(in[2].equals(\"week\")){\n int ans = 0;\n int day = Integer.parseInt(in[0]);\n day-=1;\n for(int i=0;i<12;i++){\n ans+=d[i][day];\n }\n System.out.println(ans);\n }else{\n int ans = 0;\n int day = Integer.parseInt(in[0]);\n for(int i=0;i<12;i++){\n if(m[i] >= (day)){\n ans +=1;\n }\n }\n System.out.println(ans);\n }\n bw.close();\n }\n\n}\n//L65644020\n //20151UYO31284713", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "f1f6d0da1390f4d1d183b1c650e64bab", "src_uid": "9b8543c1ae3666e6c163d268fdbeef6b", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.*;\n\npublic class Main {\n\n static boolean isLeapYear (int year) {\n if (year % 4 == 0) {\n if (year % 100 == 0)\n return year % 400 == 0;\n return true;\n }\n return false;\n }\n public static void main(String[] args) throws Exception {\n Scanner sc = new Scanner(System.in);\n StringBuilder sb = new StringBuilder();\n PrintWriter out = new PrintWriter(System.out);\n String first = sc.next() , second = sc.next();\n String names [] = {\"sunday\" , \"monday\" , \"tuesday\" , \"wednesday\" , \"thursday\" , \"friday\" , \"saturday\"};\n int year = 1 , month = 10;\n boolean found = false;\n while (year < 20000) {\n if (year % 4 == 0) {\n year ++ ;\n month = 10 ;\n continue;\n }\n\n if (month == - 1) {\n year ++ ;\n month = 10 ;\n continue;\n }\n \n \n Calendar calendar = new GregorianCalendar(year , month , 1); \n Calendar calendar2 = new GregorianCalendar(year , month + 1 , 1);\n if (first.equals(names[calendar.get(Calendar.DAY_OF_WEEK) - 1]) &&\n second.equals(names[calendar2.get(Calendar.DAY_OF_WEEK) - 1])){\n \tfound = true ;\n }\n month -- ;\n }\n\n out.print(found ? \"YES\\n\" : \"NO\\n\");\n out.flush();\n out.close();\n\n }\n\n\n\n\n\n\n\n\n static class Scanner {\n StringTokenizer st;\n BufferedReader br;\n\n public Scanner(InputStream s) {\n br = new BufferedReader(new InputStreamReader(s));\n }\n\n public String next() throws IOException {\n while (st == null || !st.hasMoreTokens())\n st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n\n public int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n public long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n public String nextLine() throws IOException {\n return br.readLine();\n }\n\n public double nextDouble() throws IOException {\n String x = next();\n StringBuilder sb = new StringBuilder(\"0\");\n double res = 0, f = 1;\n boolean dec = false, neg = false;\n int start = 0;\n if (x.charAt(0) == '-') {\n neg = true;\n start++;\n }\n for (int i = start; i < x.length(); i++)\n if (x.charAt(i) == '.') {\n res = Long.parseLong(sb.toString());\n sb = new StringBuilder(\"0\");\n dec = true;\n } else {\n sb.append(x.charAt(i));\n if (dec)\n f *= 10;\n }\n res += Long.parseLong(sb.toString()) / f;\n return res * (neg ? -1 : 1);\n }\n\n public boolean ready() throws IOException {\n return br.ready();\n }\n\n }\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "4ff72f184436927d17c658a03b033ee8", "src_uid": "2a75f68a7374b90b80bb362c6ead9a35", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\n\npublic class Main {\n\n /**\n * @param args\n * @throws IOException \n */\n public static void main(String[] args) throws IOException {\n\n BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n \n String number = reader.readLine();\n \n if(number.charAt(0) != '1')\n System.out.println(\"NO\");\n else {\n boolean flag = true ;\n int count1 = 0 ; \n int count4 = 0 ;\n for(int i = 0 ; i<number.length() ; i++)\n {\n if(number.charAt(i)=='1')\n {\n count1++; \n count4 = 0 ;\n }\n else if (number.charAt(i)=='4'){\n count4++;\n count1 = 0 ;\n }\n else{\n flag = false ; break ;\n }\n if(count4 > 2 )\n {\n flag = false ;\n break ; \n \n }\n \n }\n if(flag == true)\n System.out.println(\"YES\");\n else \n System.out.println(\"NO\");\n \n \n }\n \n \n \n }\n\n}\n", "lang_cluster": "Java", "tags": ["brute force", "greedy"], "code_uid": "eb035aa6d82a2f6165ef3597808b3d20", "src_uid": "3153cfddae27fbd817caaf2cb7a6a4b5", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.Scanner;\nimport java.io.PrintWriter;\nimport java.io.FileNotFoundException;\nimport java.io.FileWriter;\nimport java.io.File;\nimport java.io.BufferedReader;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.PrintWriter;\nimport java.util.Locale;\nimport java.util.StringTokenizer;\n\n/**\n * Created by Alexandr on 04.07.2016.\n */\n\n\npublic class Main {\n public static void main(String args[]) throws FileNotFoundException {\n Locale.setDefault(Locale.US);\n Scanner sc = new Scanner(System.in);\n PrintWriter pw = new PrintWriter(System.out);\n int n = sc.nextInt();\n String s = sc.nextLine();\n s = sc.nextLine();\n\n\n int[] res = new int[4];\n for (int i = 0; i < n; i++) {\n if (s.charAt(i) == '1') {\n res[0] = 1;\n res[3] = 1;\n }\n if (s.charAt(i) == '2') {\n res[0] = 1;\n }\n\n if (s.charAt(i) == '3') {\n res[0] = 1;\n res[1] = 1;\n }\n if (s.charAt(i) == '4') {\n res[3] = 1;\n }\n if (s.charAt(i) == '6') {\n res[1] = 1;\n }\n if (s.charAt(i) == '7') {\n res[3] = 1;\n res[2] = 1;\n }\n if (s.charAt(i) == '9') {\n res[1] = 1;\n res[2] = 1;\n }\n if (s.charAt(i) == '0') {\n res[1] = 1;\n res[2] = 1;\n res[3] = 1;\n }\n\n\n }\n if (res[0] + res[1] + res[2] + res[3] < 4)\n pw.print(\"NO\");\n else pw.print(\"YES\");\n\n pw.close();\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "implementation"], "code_uid": "892f358020a90e03713de1aeab3977d2", "src_uid": "d0f5174bb0bcca5a486db327b492bf33", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.*;\n\npublic class Problem22 {\n\n\t/**\n\t * @param args\n\t */\n\tpublic static void main(String[] args)throws IOException {\n\t\t// TODO Auto-generated method stub\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st = new StringTokenizer(br.readLine());\n\t\t int n= Integer.parseInt(st.nextToken());\n\t\t int x = Integer.parseInt(st.nextToken());\n\t\t int count= 0;\n\t\t for (int i=1;i<=n;i++){\n\t\t\t if((x/i)<=n&&(x%i)==0)\n\t\t\t\t count++;\n\t\t }\n\t\t \n\t\t \t\n\t\t System.out.println(count);\n\t\t \n\t\t \n\t\t\n\n\t}\n}\n\n\n", "lang_cluster": "Java", "tags": ["implementation", "number theory"], "code_uid": "02974d28feaf3ac5fa531fe6c0e6a106", "src_uid": "c4b139eadca94201596f1305b2f76496", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.BufferedWriter;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\nimport java.util.StringTokenizer;\n\n/**\n * Created with IntelliJ IDEA.\n * User: AUtemuratov\n * Date: 02.04.14\n * Time: 9:44\n * To change this template use File | Settings | File Templates.\n */\npublic class Main {\n\n static int n,p,k;\n static int b[][] = new int[111][111];\n static int a[] = new int[111];\n public static void main (String [] args) throws Exception {\n\n BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));\n PrintWriter pw = new PrintWriter(System.out);\n String s = bf.readLine();\n StringTokenizer tk = new StringTokenizer(s,\" \");\n n = Integer.parseInt(tk.nextToken());\n p = Integer.parseInt(tk.nextToken());\n k = Integer.parseInt(tk.nextToken());\n\n if (p-k>1) {\n System.out.print(\"<< \");\n }\n\n for (int i=p-k; i<p; i++) {\n if (i<1) continue;\n System.out.print(i + \" \");\n }\n\n System.out.print(\"(\" + p + \") \");\n\n for (int i=p+1; i<=p+k; i++) {\n if (i>n) break;\n System.out.print(i + \" \");\n }\n\n if (p+k<n) {\n System.out.print(\">>\");\n }\n\n\n\n\n\n pw.close();\n }\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "267589779a0ceb9685d16d2e107d45c9", "src_uid": "526e2cce272e42a3220e33149b1c9c84", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.math.*;\nimport java.util.*;\n//import javafx.util.*;\nimport java.io.*;\n\npublic class Prg10 {\n\n PrintWriter pw = new PrintWriter(System.out);\n Random rnd = new Random();\n int a;\n long o =0, s, stt;\n\n void run() {\n s = nl();\n long[] m = new long[8];\n for(int q=0; q<8; q++) m[q] = nl();\n stt = System.currentTimeMillis();\n rec(m, 0);\n pw.print(o);\n pw.flush();\n }\n\n void rec(long[] m, long cur){\n if(System.currentTimeMillis()-stt>500) return;\n o = Math.max(o, cur);\n for(int q=0; q<8; q++){\n if((s-cur)%(q+1)>0) continue;\n long need = (s-cur)/(q+1);\n if(m[q]>=need){\n o = s;\n return;\n }\n }\n for(int q=7; q>=0; q--){\n long can = Math.min(m[q], (s-cur)/(q+1));\n for(long w=Math.max(1, can-10); w<=can; w++){\n m[q]-=w;\n rec(m, cur+(q+1)*w);\n m[q]+=w;\n }\n }\n }\n\n static class PyraSort {\n\n private static int heapSize;\n\n public static void sort(long[] a) {\n buildHeap(a);\n while (heapSize > 1) {\n swap(a, 0, heapSize - 1);\n heapSize--;\n heapify(a, 0);\n }\n }\n\n private static void buildHeap(long[] a) {\n heapSize = a.length;\n for (int i = a.length / 2; i >= 0; i--) {\n heapify(a, i);\n }\n }\n\n private static void heapify(long[] a, int i) {\n int l = 2 * i + 2;\n int r = 2 * i + 1;\n int largest = i;\n if (l < heapSize && a[i] < a[l]) {\n largest = l;\n }\n if (r < heapSize && a[largest] < a[r]) {\n largest = r;\n }\n if (i != largest) {\n swap(a, i, largest);\n heapify(a, largest);\n }\n }\n\n private static void swap(long[] a, int i, int j) {\n a[i] ^= a[j] ^= a[i];\n a[j] ^= a[i];\n }\n }\n\n public static void main(String[] args) {\n new Thread(null, new Runnable() {\n public void run() {\n new Prg10().run();\n }\n }, \"1\", 1 << 28).start();\n }\n\n InputStream is = System.in;\n private byte[] inbuf = new byte[1<<16];\n public int lenbuf = 0, ptrbuf = 0;\n\n private int readByte()\n {\n if(lenbuf == -1)throw new InputMismatchException();\n if(ptrbuf >= lenbuf){\n ptrbuf = 0;\n try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n if(lenbuf <= 0)return -1;\n }\n return inbuf[ptrbuf++];\n }\n\n private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\n private double nd() { return Double.parseDouble(ns()); }\n private char nc() { return (char)skip(); }\n\n private String ns()\n {\n int b = skip();\n StringBuilder sb = new StringBuilder();\n while(!(isSpaceChar(b))){\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n private String nline(){\n int b = readByte();\n StringBuilder sb = new StringBuilder();\n while (b!=10) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n private char[] ns(int n)\n {\n char[] buf = new char[n];\n int b = skip(), p = 0;\n while(p < n && !(isSpaceChar(b))){\n buf[p++] = (char)b;\n b = readByte();\n }\n return n == p ? buf : Arrays.copyOf(buf, p);\n }\n\n private char[][] nm(int n, int m)\n {\n char[][] map = new char[n][];\n for(int i = 0;i < n;i++)map[i] = ns(m);\n return map;\n }\n\n private int[] na(int n)\n {\n int[] a = new int[n];\n for(int i = 0;i < n;i++)a[i] = ni();\n return a;\n }\n\n private int ni()\n {\n int num = 0, b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n private long nl()\n {\n long num = 0;\n int b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n}", "lang_cluster": "Java", "tags": ["dfs and similar", "greedy", "dp"], "code_uid": "53c0fff9364540541a8ab443d14e0559", "src_uid": "8097e10157320524c0faed56f2bc4880", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\r\npublic class Tournament {\r\n\r\n\tpublic static void main(String[] args) {\r\n\t\t// TODO Auto-generated method stub\r\n\t\tScanner scn = new Scanner(System.in);\r\n int T = scn.nextInt();\r\n while (T-- > 0)\r\n {\r\n \tint N = scn.nextInt();\r\n \tSystem.out.println( (int)Math.pow(2, N) - 1);\r\n \t\r\n }\r\n\t}\r\n\r\n}\r\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "96f3b09cc1bdb6f4dc84dab5f6ce479a", "src_uid": "d5e66e34601cad6d78c3f02898fa09f4", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner scn=new Scanner(System.in);\n\t\tint t =scn.nextInt();\n\t\twhile(t-->0){\n\t\t\tlong n=scn.nextLong();\n\t\t\tif(n%2==0){\n\t\t\t\tSystem.out.println(n/2+\" \"+n/2);\n\t\t\t}else{\n\t\t\t\tboolean f=false;\n\t\t\t\tlong val=0;\n\t\t\t\tfor(long i=2;i*i<=n;i++){\n\t\t\t\t\tif(n%i==0){\n\t\t\t\t\t\tval = i;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(val==0){\n\t\t\t\t\tSystem.out.println(1+\" \"+(n-1));\n\t\t\t\t}else{\n\t\t\t\t long m= n/val;\n\t\t\t\t\t\n\t\t\t\tSystem.out.println(m+\" \"+(val-1)*m);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t}\n\t\n\n}", "lang_cluster": "Java", "tags": ["math", "greedy", "number theory"], "code_uid": "76c8d1216e23671756506c373c504ca5", "src_uid": "3fd60db24b1873e906d6dee9c2508ac5", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int a1 = sc.nextInt(); //人数\n int a2 = sc.nextInt();\n int k1 = sc.nextInt(); //罚票\n int k2 = sc.nextInt();\n int n = sc.nextInt();\n int n1 = n;\n int n2 = n;\n int max = 0;\n int min = 0;\n n2 -= (a1*(k1-1)+a2*(k2-1));\n if(n2>0)\n min = Math.min(n2, (a1 + a2));\n if(k1<k2){\n if(k1*a1>=n1){\n max = n1/k1;\n }else{\n max = a1;\n n1 -= max*k1;\n max += Math.min(n1 / k2, a2);\n }\n }else{\n if(k2*a2>=n1){\n max = n1/k2;\n }else{\n max = a2;\n n1 -= max*k2;\n max += Math.min(n1 / k1, a1);\n }\n }\n System.out.println(min+\" \"+max);\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "greedy", "implementation"], "code_uid": "f90ae0fdfcb41d347a570e739b44eb6f", "src_uid": "2be8e0b8ad4d3de2930576c0209e8b91", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\npublic class TestClass {\n static PrintWriter out = new PrintWriter(System.out);\n\n public static void main(String args[] ) throws Exception {\n \t\n BufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n String s = in.readLine();\n int c = (int)'a';\n for(int i=0;i<s.length();i++)\n {\n \tint x = (int)s.charAt(i);\n \tif(x<c)\n \t{\n \t\tcontinue;\n \t}\n \telse\n \t{\n \t\tif(x==c)\n \t\t{\n \t\t\tc = c+1;\n \t\t}\n \t\telse\n \t\t{\n \t\t\tout.println(\"NO\");\n \t\t\tout.close();\n \t\t\tSystem.exit(0);\n \t\t}\n \t}\n }\n out.println(\"YES\");\n out.close();\n }\n \n \n}\n\n\n", "lang_cluster": "Java", "tags": ["greedy", "strings", "implementation"], "code_uid": "7f34e8ee560772804b34a6b6d788e58b", "src_uid": "c4551f66a781b174f95865fa254ca972", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\n\n/* package whatever; // don't place package name! */\n \nimport java.util.*;\nimport java.lang.*;\nimport java.io.*;\nimport java.io.BufferedReader;\nimport java.io.File;\nimport java.io.FileReader;\nimport java.io.IOException;\n \n/* Name of the class has to be \"Main\" only if the class is public. */\npublic class bbg\n{\n\tpublic static int result;\n \npublic static ArrayList<Integer> [] graph;\n \npublic static int[]cats;\n \npublic static int vizitat[];\npublic static int x;\n//public static HashMap<String, Integer> map2;\n \n \n\tpublic static void main (String[] args) throws java.lang.Exception\n{\n \nScanner input=new Scanner(System.in);\n \nHashMap<Integer, Integer> contor1= new HashMap<Integer, Integer>();\nHashMap<Integer, Integer> contor2= new HashMap<Integer, Integer>();\n\n\nHashMap<Integer, Integer> map= new HashMap<Integer, Integer>();\nHashMap<String, Integer> stringuri= new HashMap<String, Integer>();\nHashMap<String, Integer> combinari= new HashMap<String, Integer>();\n \n \n\t\t\n\n\t\tString str=input.next();\n\n\t\tint links=0;\n\t\tint pearls=0;\n\t\tfor(int j=0;j<str.length();j++) if(str.charAt(j)=='-') links++;\n\t\t\telse pearls++;\n\nif(pearls>0) \n\t\t{if(links%pearls==0) System.out.println(\"YES\");\n\t\telse System.out.println(\"NO\");}\n\t\t\n\t\t else System.out.println(\"YES\");\n\n\n\t}\n\n\t}\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "3f8b5111ae60db39830e364e4d5e2ce3", "src_uid": "6e006ae3df3bcd24755358a5f584ec03", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.File;\nimport java.io.FileNotFoundException;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class CF_245B {\n\n public static void main(String[] args) {\n FastScanner sc = new FastScanner(System.in);\n int n = sc.nextInt();\n int k = sc.nextInt();\n int x = sc.nextInt();\n \n int[] b = new int[n];\n for(int i=0; i<n; i++) b[i] = sc.nextInt();\n \n if(n<=1){\n System.out.println(0);\n return;\n }\n \n int max = 0;\n \n for(int i=1; i<n; i++){\n int l=i-1;\n int r=i;\n int count = 0;\n if (b[l]==b[r] && b[r]==x){\n int act = 3;\n while(l>=0 && r<n && b[l]==b[r]){\n while(l>0 && b[l-1]==b[l]){\n l--;\n act++;\n }\n while(r<n-1 && b[r+1]==b[r]){\n r++;\n act++;\n }\n if(act>=3) {\n count+=act;\n act = 2;\n l--;\n r++;\n } else {\n break;\n }\n\n \n } \n } else continue;\n max = Math.max(max,count-1); \n }\n \n System.out.println(max);\n\n }\n \n static class FastScanner {\n BufferedReader br;\n StringTokenizer st;\n\n public FastScanner(File f) {\n try {\n br = new BufferedReader(new FileReader(f));\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n }\n\n public FastScanner(InputStream f) {\n br = new BufferedReader(new InputStreamReader(f));\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return null;\n st = new StringTokenizer(s);\n }\n return st.nextToken();\n }\n\n boolean hasMoreTokens() {\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return false;\n st = new StringTokenizer(s);\n }\n return true;\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n \n double nextDouble(){\n return Double.parseDouble(next());\n }\n }\n\n}\n", "lang_cluster": "Java", "tags": ["two pointers", "brute force"], "code_uid": "39e35858cc3a34b2e6b8b2296ce0069d", "src_uid": "d73d9610e3800817a3109314b1e6f88c", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class Problem1191A {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int x = scanner.nextInt();\n if (x % 4 == 1)\n System.out.println(0 + \" A\");\n else if (x % 4 == 3)\n System.out.println(2 + \" A\");\n else if (x % 4 == 2)\n System.out.println(1 + \" B\");\n else\n System.out.println(1 + \" A\");\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force"], "code_uid": "168b9cc423f156688923056143a77f57", "src_uid": "488e809bd0c55531b0b47f577996627e", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.BufferedWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.OutputStreamWriter;\nimport java.math.BigInteger;\n\npublic class C630 {\n\n\t\n\t/*public static void main(String[] args) throws IOException {\n\t\tBufferedReader in= new BufferedReader(new InputStreamReader(System.in));\n\t\tBufferedWriter out= new BufferedWriter(new OutputStreamWriter(System.out));\n\t\tint n;\n\t\tint sum = 0;\n\t\tn = Integer.valueOf(in.readLine());\n\t\tBigInteger i ;\n\t\tfor(i= new BigInteger(\"7\");i.toString().length()<=n;i = i.add(new BigInteger(\"1\")))\n\t\t{\n\t\t\t\n\t\t\t//System.out.print(\"1\");\n\t\t\tif(i.toString().contains(\"0\")||i.toString().contains(\"1\")||i.toString().contains(\"2\")||i.toString().contains(\"3\")||i.toString().contains(\"4\")||i.toString().contains(\"5\")||i.toString().contains(\"6\")||i.toString().contains(\"9\"))\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tsum++;\n\t\t\t}\n\t\t}\n\t\tout.write(String.valueOf(sum));\n\t\tout.flush();\n\t\tout.close();\n\t}*/\n\tstatic long func(int a)\n\t{\n\t\tlong r=1;\n\t\tfor(int i=0;i<a;i++)\n\t\t{\n\t\t\tr*=2;\n\t\t}\n\t\treturn r;\n\t}\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader in= new BufferedReader(new InputStreamReader(System.in));\n\t\tBufferedWriter out= new BufferedWriter(new OutputStreamWriter(System.out));\n\t\tint n = Integer.valueOf(in.readLine());\n\t\tBigInteger m = new BigInteger(\"0\");\n\t\tfor(int i = 1;i<=n;i++)\n\t\t{\n\t\t\tm = m.add(new BigInteger(String.valueOf(func(i))));\n\t\t}\n\t\tout.write(m+\"\\n\");\n\t\tout.flush();\n\t\tout.close();\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["math", "combinatorics"], "code_uid": "53737891eb7017fd5226df344df00efa", "src_uid": "f1b43baa14d4c262ba616d892525dfde", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\n\npublic class cf89{\n\tpublic static void main(String[] args) throws IOException {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n \n int ind = Math.min(a,b);\n int div = Math.max(a,b);\n \n int min2 = -1;\n \n \n\n \tfor(int i=1;i<n;i++){\n \t int aa = a/i;\n \t int bb = b/(n-i);\n \t int min = Math.min(aa,bb);\n \t// System.out.println(min);\n \t min2 = Math.max(min,min2);\n \t}\n \t \n \t\n System.out.println(min2);\n\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "implementation", "binary search"], "code_uid": "51d74f5b6fecce1d2215b8882fed5972", "src_uid": "a254b1e3451c507cf7ce3e2496b3d69e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class Round170D {\n\tpublic static void main(String[] args) throws IOException {\n\t\tgetLine();\n\t\tn = nextInt();\n\t\ta = new int[n];\n\t\tgetLine();\n\t\tfor(int i=0; i<n; i++) a[i] = nextInt();\n\t\tint bin = binary(1, n);\n\t//\tSystem.out.println(isOk(4));\n\t\tSystem.out.println(bin);\n\t}\n\t\n\t\n\t\n\tstatic int binary(int x, int y){\n\t//\tSystem.out.println(\"binary on \"+x+\",\"+y);\n\t\tif(x==y) return isOk(x)? x: -1;\n\t\tif(y==x+1) return isOk(x)? x: isOk(y)? y: -1;\n\t\tint m = (x+y)>>1;\n\t\treturn isOk(m)? binary(x, m): binary(m+1, y);\n\t}\n\t\n\t\n\tstatic boolean isOk(int sz){\n\t\tsize = sz;\n\t\tcurIter++;\n\t\tfal++;\n\t\tboolean b = canGet(1);\n\t\t//System.out.println(sz+\" \"+b);\n\t\treturn b;\n\t}\n\t\n\tstatic char curIter = 'a', fal = Character.toUpperCase(curIter);\n\t\n\tstatic int size = 0;\n\t\n\tstatic boolean canGet(int mask){\n\t//\tSystem.out.println(mask+\" \"+cur);\n\t//\tif(cur==n) System.out.println(\"OH YEAH\");\n\t\tint cur = -1;\n\t\tfor(int i=n; i>=0; i--){\n\t\t\tif((mask&(1<<i))!=0){\n\t\t\t\tcur = i;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tcur++;\n\t//\tSystem.out.println(mask+\" \"+cur);\n\t\tif(cur==n) return true;\n\t\tif(dp[mask]==curIter || dp[mask]==fal) return dp[mask]==curIter;\n\t\tif(!can(mask, a[cur])){\n\t\t\tdp[mask] = fal;\n\t\t\treturn false;\n\t\t}\n\t\tint M = mask;\n\t\tif(Integer.bitCount(mask)+1<=size){\n\t//\t\tSystem.out.println(Integer.bitCount(mask)+\" \"+size+\" calling\");\n\t\t\tif(canGet((M^(1<<cur)))){\n\t\t\t\tdp[mask] = curIter;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\tfor(int i=0; i<cur; i++){\n\t\t\tM = mask;\n\t\t\tif((M&(1<<i))!=0){\n\t\t\t\tM ^= (1<<i);\n\t\t\t\tM ^= (1<<cur);\n\t\t\t\tif(canGet(M)){\n\t\t\t\t\tdp[mask] = curIter;\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tdp[mask] = fal;\n\t\treturn false;\n\t}\n\t\n\tstatic boolean can(int mask, int sum){\n\t\tHashSet<Integer> set = new HashSet<Integer>();\n\t\tfor(int s=0; s<n; s++) if((mask&(1<<s))!=0){\n\t\t\tset.add(a[s]);\n\t\t}\n\t\tfor(int s=0; s<n; s++){\n\t\t\tif((mask&(1<<s))!=0){\n\t\t\t\tif(set.contains(sum-a[s])) return true;\n\t\t\t}\n\t\t}\n\t\tif(Integer.bitCount(mask)<size && set.contains(sum)) return true;\n\t\treturn false;\n\t}\n\t\n\tstatic final int SIZE = 23;\n\t\n\tstatic char[] dp = new char[(1<<SIZE)];\n\t\n\t\n//\tstatic boolean[][] can = new boolean[(1<<SIZE)][SIZE];\n\t\n\tstatic int[] a;\n\tstatic int n;\n\n\tstatic void getLine() throws IOException {\n\t\tst = new StringTokenizer(rd.readLine());\n\t}\n\t\n\tstatic int nextInt(){\n\t\treturn Integer.parseInt(st.nextToken());\n\t}\n\t\n\tstatic BufferedReader rd = new BufferedReader(new InputStreamReader(System.in));\n\tstatic PrintWriter pw = new PrintWriter(System.out);\n\tstatic StringTokenizer st;\n\t\n}\n", "lang_cluster": "Java", "tags": ["dp", "bitmasks"], "code_uid": "a5bccbc8e449f80d216b9af616fd8a99", "src_uid": "359f5d1264ce16c5c5293fd59db95628", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.BufferedReader;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n \npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tScanner in = new Main().new Scanner(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tMain solver = new Main();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\t\n\t// prefix sum\n\tpublic void solve(int testNumber, Scanner in, PrintWriter out) {\n\t\tchar[] s1 = in.readLine().toCharArray();\n\t\tchar[] s2 = in.readLine().toCharArray();\n\t\t\n\t\tint s1p = 0, s1m = 0, s2p = 0, s2m = 0, q = 0;\n\t\tfor(int i = 0; i < s1.length; i++) {\n\t\t\tif(s1[i] == '+') s1p++;\n\t\t\telse if (s1[i] == '-') s1m++;\n\t\t\tif(s2[i] == '+') s2p++;\n\t\t\telse if (s2[i] == '-') s2m++;\n\t\t\telse q++;\n\t\t}\n\t\tint p = s1p - s2p;\n\t\tint m = s1m - s2m;\n\t\tif(Math.abs(p) + Math.abs(m) != q) {\n\t\t\tout.println(0);\n\t\t} else {\n\t\t\tlong num = fact(p + m) / (fact(p) * fact(m));\n\t\t\tlong den = (long) Math.pow(2, p + m);\n\t\t\tdouble ans = num * 1.0 / den;\n\t\t\tout.println(ans);\n\t\t}\n\t}\n\t\n\tpublic long fact(int n) {\n\t\tlong ret = 1;\n\t\tfor(int i = 1; i <= n; i++) ret *= i;\n\t\treturn ret;\n\t}\n\t\n\tclass Scanner {\n\t\t\n\t\tBufferedReader br;\n\t\tStringTokenizer in;\n \n\t\tpublic Scanner(InputStream inputStream) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(inputStream));\n\t\t}\n \n\t\tpublic String next() {\n\t\t\treturn hasMoreTokens() ? in.nextToken() : null;\n\t\t}\n \n\t\tpublic String readLine() {\n\t\t\ttry {\n\t\t\t\treturn br.readLine();\n\t\t\t} catch (Exception e) {\n\t\t\t\te.printStackTrace();\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n \n\t\tboolean hasMoreTokens() {\n\t\t\twhile (in == null || !in.hasMoreTokens()) {\n\t\t\t\tString s = readLine();\n\t\t\t\tif (s == null)\n\t\t\t\t\treturn false;\n\t\t\t\tin = new StringTokenizer(s);\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n \n\t\tpublic String ns() {\n\t\t\treturn next();\n\t\t}\n \n\t\tpublic int ni() {\n\t\t\treturn Integer.parseInt(ns());\n\t\t}\n\t\t\n\t\tpublic long nl() {\n\t\t\treturn Long.parseLong(ns());\n\t\t}\n \n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\ta[i] = ni();\n\t\t\t}\n\t\t\treturn a;\n\t\t}\n\t\t\n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] a = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\ta[i] = nl();\n\t\t\t}\n\t\t\treturn a;\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "combinatorics", "bitmasks", "probabilities"], "code_uid": "c81eba14cd310bf2e17a5d03897b75ef", "src_uid": "f7f68a15cfd33f641132fac265bc5299", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package CodeForces.C553;\n\nimport java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class A {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskE solver = new TaskE();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskE {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int len = in.nextInt();\n final String s = in.next();\n final String com = \"ACTG\";\n int ans = Integer.MAX_VALUE;\n for (int i=0;i<s.length()-3;i++) {\n int temp = 0;\n for (int j=0;j<4;j++) {\n int diff = Math.abs(s.charAt(i+j) - com.charAt(j));\n int val = Integer.min(diff, 26-diff);\n temp+=val;\n }\n ans = Integer.min(ans, temp);\n }\n out.println(ans);\n }\n\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "strings"], "code_uid": "1b8d85e83d396e0ab971deeb7f9b94c7", "src_uid": "ee4f88abe4c9fa776abd15c5f3a94543", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// package cf652;\n\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.math.BigInteger;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class CFA {\n private static final String INPUT = \"10 30\\n\" +\n \"2 1\";\n\n private PrintWriter out;\n private FastScanner sc;\n\n public static void main(String[] args) {\n new CFA().run();\n }\n\n public void run() {\n sc = new FastScanner(oj ? System.in : new ByteArrayInputStream(INPUT.getBytes()));\n out = new PrintWriter(System.out);\n\n long s = System.currentTimeMillis();\n solve();\n out.flush();\n tr(System.currentTimeMillis() - s + \"ms\");\n }\n\n public void solve() {\n int h1 = sc.nextInt();\n int h2 = sc.nextInt();\n int a = sc.nextInt();\n int b = sc.nextInt();\n\n if (h1 + (22-14)*a >= h2) {\n System.out.println(0);\n } else if (a <= b) {\n System.out.println(-1);\n } else {\n int diff = h2-h1-(22-14)*a;\n int ans = ceil((double)diff/12/(a-b));\n System.out.println(ans);\n }\n }\n\n //********************************************************************************************\n //********************************************************************************************\n //********************************************************************************************\n\n /**\n * If searched element doesn't exist, returns index of first element which is bigger than searched value.<br>\n * If searched element is bigger than any array element function returns first index after last element.<br>\n * If searched element is lower than any array element function returns index of first element.<br>\n * If there are many values equals searched value function returns first occurrence.<br>\n */\n private static int lowerBound(long[] arr, long key) {\n int lo = 0;\n int hi = arr.length - 1;\n while (lo < hi) {\n int mid = (lo + hi) / 2;\n if (key <= arr[mid]) {\n hi = mid - 1;\n } else {\n lo = mid + 1;\n }\n }\n return arr[lo] < key ? lo + 1 : lo;\n }\n\n /**\n * Returns index of first element which is grater than searched value.\n * If searched element is bigger than any array element, returns first index after last element.\n */\n private static int upperBound(long[] arr, long key) {\n int lo = 0;\n int hi = arr.length - 1;\n while (lo < hi) {\n int mid = (lo + hi) / 2;\n if (key >= arr[mid]) {\n lo = mid + 1;\n } else {\n hi = mid;\n }\n }\n return arr[lo] <= key ? lo + 1 : lo;\n }\n\n private static int ceil(double d) {\n int ret = (int) d;\n return ret == d ? ret : ret + 1;\n }\n\n private static int round(double d) {\n return (int) (d + 0.5);\n }\n\n private static int gcd(int a, int b) {\n BigInteger b1 = BigInteger.valueOf(a);\n BigInteger b2 = BigInteger.valueOf(b);\n BigInteger gcd = b1.gcd(b2);\n return gcd.intValue();\n }\n\n private static long gcd(long a, long b) {\n BigInteger b1 = BigInteger.valueOf(a);\n BigInteger b2 = BigInteger.valueOf(b);\n BigInteger gcd = b1.gcd(b2);\n return gcd.longValue();\n }\n\n private int[] readIntArray(int n) {\n int[] res = new int[n];\n for (int i = 0; i < n; i++) {\n res[i] = sc.nextInt();\n }\n return res;\n }\n\n private long[] readLongArray(int n) {\n long[] res = new long[n];\n for (int i = 0; i < n; i++) {\n res[i] = sc.nextLong();\n }\n return res;\n }\n\n @SuppressWarnings(\"unused\")\n static class FastScanner {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n\n FastScanner(InputStream stream) {\n this.stream = stream;\n }\n\n int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) return -1;\n }\n return buf[curChar++];\n }\n\n boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n boolean isEndline(int c) {\n return c == '\\n' || c == '\\r' || c == -1;\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public String next() {\n int c = read();\n while (isSpaceChar(c)) c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n public String nextLine() {\n int c = read();\n while (isEndline(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isEndline(c));\n return res.toString();\n }\n\n }\n\n private boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\n private void tr(Object... o) {\n if (!oj) System.out.println(Arrays.deepToString(o));\n }\n}", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "811b30eca90238219f5d14aeb7725552", "src_uid": "2c39638f07c3d789ba4c323a205487d7", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\nimport java.util.Stack;\nimport java.io.*;\nimport java.math.*;\n\npublic class Main {\n\n\tstatic int p = 1000000007;\n\tstatic Mod mod = new Mod();\n\t//static int p = 998244353;\n\t\n\n\tpublic static void main(String args[]) throws IOException {\n\t\tScanner sc = new Scanner();\n\t\tPrintWriter out = new PrintWriter(System.out);\n\n\t\tint t = 1;\n\t\t//t = sc.nextInt();\n\n\t\t\n\t\twhile (t-- > 0) {\n\t\t\t\n\t\t\tlong n=sc.nextInt(), x=sc.nextInt(), y=sc.nextInt(), dp[]=new long[(int)n+2];\n\t\t\tdp[1]=x;\n\t\t\tdp[2]=min(2*x,x+y);\n\t\t\tfor(int i=2; 2*i<=n+1; i++) {\n\t\t\t\tdp[2*i] = min(dp[i]+y,dp[2*(i-1)]+2*x);\n\t\t\t\tdp[2*i-1] = min(dp[2*i],dp[2*(i-1)])+x;\n\t\t\t}\n\t\t\tout.print(dp[(int)n]);\n\t\t}\n\t\tout.flush();\n\t}\n\t\n\t\n\t\n \n\tstatic int count(int x, int[] arr) {\n\t\tint count = 0;\n\n\t\tfor (int i = 0; i < arr.length; i++)\n\t\t\tif (arr[i] == x)\n\t\t\t\tcount++;\n\t\treturn count;\n\t}\n\n\tpublic static String reverseString(String str) {\n\t\tStringBuilder sb = new StringBuilder(str);\n\t\tsb.reverse();\n\t\treturn sb.toString();\n\t}\n\n\tstatic boolean isPalindrome(String str) {\n\t\tint i = 0, j = str.length() - 1;\n\n\t\twhile (i < j) {\n\n\t\t\tif (str.charAt(i) != str.charAt(j))\n\t\t\t\treturn false;\n\n\t\t\ti++;\n\t\t\tj--;\n\t\t}\n\t\treturn true;\n\t}\n\n\tstatic void print(int[] arr) {\n\t\tfor (int i = 0; i < arr.length; i++)\n\t\t\tSystem.out.print(arr[i] + \" \");\n\t\tSystem.out.println();\n\t}\n\n\tpublic static int abs(int x) {\n\t\treturn ((x > 0) ? x : -x);\n\t}\n\n\tpublic static long abs(long x) {\n\t\treturn ((x > 0) ? x : -x);\n\t}\n\n\tpublic static int max(int a, int b) {\n\t\treturn Math.max(a, b);\n\t}\n\n\tpublic static long max(long a, long b) {\n\t\treturn Math.max(a, b);\n\t}\n\n\tpublic static int min(int a, int b) {\n\t\treturn Math.min(a, b);\n\t}\n\n\tpublic static long min(long a, long b) {\n\t\treturn Math.min(a, b);\n\t}\n\n\tstatic int gcd(int a, int b) {\n\t\tif (a == 0)\n\t\t\treturn b;\n\t\treturn gcd(b % a, a);\n\t}\n\n\tstatic int modInverse(int a, int m) {\n\t\tint g = gcd(a, m);\n\t\tif (g != 1)\n\t\t\treturn -1;\n\t\telse\n\t\t\treturn power(a, m - 2, m);\n\n\t}\n\n\t// To compute x^y under modulo m\n\tstatic int power(int x, int y, int m) {\n\t\tif (y == 0)\n\t\t\treturn 1;\n\n\t\tint p = power(x, y / 2, m) % m;\n\t\tp = (p * p) % m;\n\n\t\tif (y % 2 == 0)\n\t\t\treturn p;\n\t\telse\n\t\t\treturn (x * p) % m;\n\t}\n\n\tstatic int[] primeGenerator(int num) {\n\t\tint length = 0, arr[] = new int[num], a = num, factor = 1;\n\t\tif (num % 2 == 0) {\n\t\t\twhile (num % 2 == 0) {\n\t\t\t\tnum /= 2;\n\t\t\t\tfactor *= 2;\n\t\t\t}\n\t\t\tarr[length++] = factor;\n\t\t}\n\t\tfor (int i = 3; i * i <= a; i++) {\n\t\t\tfactor = 1;\n\t\t\tif (num % i == 0) {\n\t\t\t\twhile (num % i == 0) {\n\t\t\t\t\tnum /= i;\n\t\t\t\t\tfactor *= i;\n\t\t\t\t}\n\t\t\t\tarr[length++] = factor;\n\t\t\t}\n\t\t}\n\t\tif (num > 1)\n\t\t\tarr[length++] = num;\n\t\treturn Arrays.copyOfRange(arr, 0, length);\n\t}\n\n\tstatic boolean isPrime(int n) {\n\t\t// Corner cases\n\t\tif (n <= 1)\n\t\t\treturn false;\n\t\tif (n <= 3)\n\t\t\treturn true;\n\n\t\t// This is checked so that we can skip\n\t\t// middle five numbers in below loop\n\t\tif (n % 2 == 0 || n % 3 == 0)\n\t\t\treturn false;\n\n\t\tfor (int i = 5; i * i <= n; i = i + 6)\n\t\t\tif (n % i == 0 || n % (i + 2) == 0)\n\t\t\t\treturn false;\n\n\t\treturn true;\n\t}\n\n\t\n\t static class Scanner { BufferedReader br; StringTokenizer st;\n\t \n\t Scanner() { br = new BufferedReader(new InputStreamReader(System.in)); }\n\t \n\t Scanner(String fileName) throws FileNotFoundException { br = new\n\t BufferedReader(new FileReader(fileName)); }\n\t \n\t String next() throws IOException { while (st == null || !st.hasMoreTokens())\n\t st = new StringTokenizer(br.readLine()); return st.nextToken(); }\n\t \n\t String nextLine() throws IOException { return br.readLine(); }\n\t \n\t int nextInt() throws IOException { return Integer.parseInt(next()); }\n\t \n\t long nextLong() throws NumberFormatException, IOException { return\n\t Long.parseLong(next()); }\n\t \n\t double nextDouble() throws NumberFormatException, IOException { return\n\t Double.parseDouble(next()); }\n\t \n\t boolean ready() throws IOException { return br.ready(); }\n\t \n\t }\n\t \n\n\tstatic void sort(int[] a) {\n\t\tshuffle(a);\n\t\tArrays.sort(a);\n\t}\n\n\tstatic void shuffle(int[] a) {\n\t\tint n = a.length;\n\t\tRandom rand = new Random();\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint tmpIdx = rand.nextInt(n);\n\t\t\tint tmp = a[i];\n\t\t\ta[i] = a[tmpIdx];\n\t\t\ta[tmpIdx] = tmp;\n\t\t}\n\t}\n}\n\nclass Pair {\n\tint x;\n\tint y;\n\n\tPair(int a, int b) {\n\t\tx = a;\n\t\ty = b;\n\t}\n\n\tvoid print() {\n\t\tSystem.out.println(this.x + \" \" + this.y);\n\t}\n}\n\nclass Mod{\n\tstatic final int MOD = 998244353;\n\t\n\tint add(int x, int y){\n\t\tx += y;\n\t while(x >= MOD) x -= MOD;\n\t while(x < 0) x += MOD;\n\t return x;\n\t}\n\t\n\tint subtract(int x, int y) {\n\t\tx -= y;\n\t while(x >= MOD) x -= MOD;\n\t while(x < 0) x += MOD;\n\t return x;\n\t}\n\n\tint mul(int x, int y)\n\t{\n\t\tint result = (int)((long)x*y % MOD);\n\t return result>=0?result:result+MOD;\n\t}\n\n\tint binpow(int x, int y)\n\t{\n\t int z = 1;\n\t while(y!=0)\n\t {\n\t if((y & 1)!=0) \n\t \tz = mul(z, x);\n\t x = mul(x, x);\n\t y >>= 1;\n\t }\n\t return z;\n\t}\n\n\tint inv(int x)\n\t{\n\t return binpow(x, MOD - 2);\n\t}\n\n\tint divide(int x, int y)\n\t{\n\t return mul(x, inv(y));\n\t}\n\t\n\tstatic final int N =200043;\n\tint[] fact;\n\t\n\tMod() {\n\t\tfact = new int[N];\n\t}\n\t\n\tvoid precalc()\n\t{\n\t fact[0] = 1;\n\t for(int i = 1; i < N; i++)\n\t fact[i] = mul(fact[i - 1], i);\n\t}\n\n\tint C(int n, int k)\n\t{\n\t return divide(fact[n], mul(fact[k], fact[n - k]));\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "dp"], "code_uid": "8d7ede4ab62cce3663d6c9beab63f5b7", "src_uid": "0f270af00be2a523515d5e7bd66800f6", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.Scanner;\n\npublic class MoveAahead {\n\n static String RepeatingCipher(String str){\n\n if(str.length() == 1){\n\n return str;\n\n }else{\n\n String temp = str.charAt(0) + \"\";\n\n int index = 1;\n\n for(int i = 0;i < str.length();i++){\n\n if(index < str.length()){\n\n temp = temp.concat(str.charAt(index) + \"\");\n\n index += 2 + i;\n }\n\n }\n str = temp;\n }\n return str;\n }\n\n public static void main(String[] args) {\n\n Scanner sc = new Scanner(System.in);\n\n int lim = sc.nextInt();\n\n String str = sc.next();\n\n // long startTime = System.currentTimeMillis();\n\n System.out.println(RepeatingCipher(str));\n\n // System.out.println((System.currentTimeMillis()-startTime)+\"ms\");\n }\n /*public static int ArrayStabilization(int[] arr){\n\n int temp[] = new int[arr.length - 2];\n\n for(int i = 0;i < temp.length;i++){\n\n temp[i] = arr[i];\n\n }\n return temp.length-1;\n }*/\n\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "198a3677445cacb9a27a6a77607fd3a3", "src_uid": "08e8c0c37b223f6aae01d5609facdeaf", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\n\npublic class InscribedFigures {\n\n static class FastReader{\n final private int BUFFER_SIZE = 1<<16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n\n public FastReader()throws IOException{\n din=new DataInputStream(System.in);\n bufferPointer=bytesRead=0;\n buffer=new byte[BUFFER_SIZE];\n }\n public FastReader(String filename)throws IOException{\n din=new DataInputStream(new FileInputStream(filename));\n bufferPointer=bytesRead=0;\n buffer=new byte[BUFFER_SIZE];\n }\n public String nextLine()throws IOException{\n byte[] buf = new byte[64];\n byte c,count=0;\n while ((c = read()) != -1)\n {\n if (c == '\\n')\n break;\n buf[count++]=c;\n }\n return new String(buf,0,count);\n }\n\n public int nextInt()throws IOException {\n int result=0;\n byte c=read();\n byte c1=c;\n while (c<'0' || c>'9'){\n c1=c;\n c=read();\n }\n boolean neg= (c1=='-');\n do {\n result=result*10 + c-'0';\n }while ((c=read())>='0' && c<='9');\n if(neg)\n return -result;\n return result;\n }\n public long nextLong()throws IOException {\n long result=0;\n byte c=read();\n byte c1=c;\n while (c<'0' || c>'9'){\n c1=c;\n c=read();\n }\n boolean neg= (c1=='-');\n do {\n result=result*10 + c-'0';\n }while ((c=read())>='0' && c<='9');\n if(neg)\n return -result;\n return result;\n }\n public double nextDouble()throws IOException{\n double result=0,divisor=1;\n byte c=read(),c1=c;\n while(c<'0' || c>'9'){\n c1=c;\n c=read();\n }\n boolean neg=(c1=='-');\n\n do {\n result=result*10 + c-'0';\n }while((c=read())>='0' && c<='9');\n\n if (c=='.'){\n while ((c=read())>='0' && c<='9'){\n result += (c-'0')/(divisor=divisor*10);\n }\n }\n if(neg)\n return -result;\n return result;\n }\n private void fillBuffer() throws IOException {\n bytesRead = din.read(buffer,bufferPointer=0,BUFFER_SIZE);\n if(bytesRead==-1)\n buffer[0]=-1;\n }\n private byte read()throws IOException {\n if(bufferPointer==bytesRead)\n fillBuffer();\n return buffer[bufferPointer++];\n }\n public void close()throws IOException {\n if(din==null)\n return;\n din.close();\n }\n }\n\n public static void main(String[] args) throws IOException {\n //long startTime = System.nanoTime();\n {\n FastReader sc = new FastReader();\n byte n = (byte)sc.nextInt();\n byte[] a = new byte[n];\n int result=0;\n a[0]=(byte)sc.nextInt();\n a[1]=(byte)sc.nextInt();\n if((result+=a[1]+a[0])==5){\n System.out.println(\"Infinite\");\n return;\n }\n\n for (byte i=2;i<n;i++){\n a[i]=(byte)sc.nextInt();\n if(a[i]+a[i-1]==5){\n System.out.println(\"Infinite\");\n return;\n }\n else {\n if((a[i]+a[i-1]+a[i-2])==6 && a[i]==2)\n result-=1;\n result+=a[i]+a[i-1];\n }\n }\n System.out.println(\"Finite\");\n System.out.println(result);\n\n }//long endTime = System.nanoTime();\n //System.out.println((endTime-startTime) +\" ns\");\n }\n}\n\n", "lang_cluster": "Java", "tags": ["geometry"], "code_uid": "e02ccc486a8a646b3a306349e38eef5d", "src_uid": "6c8f028f655cc77b05ed89a668273702", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n/**\n *\n * @author alanl\n */\npublic class Main{\n static BufferedReader input = new BufferedReader(new InputStreamReader(System.in));\n static StringTokenizer st;\n static PrintWriter pr = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n static char[][]adj = new char[11][11];\n static ArrayList<edge>x = new ArrayList(), y = new ArrayList();\n public static void main(String[] args) throws IOException{\n int xcnt = 0, ycnt = 0;\n for(int i = 0; i<11; i++){\n String s = readLine();\n if(s.length()!=11)continue;\n for(int j = 0; j<11; j++){\n if(s.charAt(j)=='x'){\n xcnt++;\n x.add(new edge(i, j));\n }\n else if(s.charAt(j)=='o'){\n ycnt++;\n y.add(new edge(i, j));\n }\n adj[i][j] = s.charAt(j);\n }\n }\n solve();\n for(int i = 0; i<11; i++){\n if(i==3||i==7){\n println();\n continue;\n }\n for(int j = 0; j<11; j++){\n if(j==3||j==7)print(\" \");\n else print(adj[i][j]);\n }\n println();\n }\n println();\n }\n static void solve() throws IOException{\n int a = readInt(), b = readInt();\n if(a<=3)a--;\n if(b<=3)b--;\n if(a>=7)a++;\n if(b>=7)b++;\n if(a%4==0 && b%4==0)loop(3, 3);\n else if(a%4==0 && b%4==1)loop(3, 7);\n else if(a%4==0 && b%4==2)loop(3, 10);\n else if(a%4==1 && b%4==0)loop(7, 3);\n else if(a%4==1 && b%4==1)loop(7, 7);\n else if(a%4==1 && b%4==2)loop(7, 10);\n else if(a%4==2 && b%4==0)loop(10, 3);\n else if(a%4==2 && b%4==1)loop(10, 7);\n else if(a%4==2 && b%4==2)loop(10, 10);\n }\n static void loop(int a, int b){\n int cnt = 0;\n for(int i = a-3; i<=a; i++){\n for(int j = b-3; j<=b; j++){\n if(adj[i][j]=='.'){\n adj[i][j] = '!';\n cnt++;\n }\n }\n }\n if(cnt==0)fill();\n }\n static void fill(){\n for(int i = 0; i<11; i++){\n for(int j = 0; j<11; j++){\n if(adj[i][j]=='.'){\n adj[i][j] = '!';\n }\n }\n }\n }\n static class edge{\n int x, y;\n edge(int x0, int y0){\n x = x0;\n y = y0;\n }\n }\n static String next () throws IOException {\n while (st == null || !st.hasMoreTokens())\n st = new StringTokenizer(input.readLine().trim());\n return st.nextToken();\n }\n static long readLong () throws IOException {\n return Long.parseLong(next());\n }\n static int readInt () throws IOException {\n return Integer.parseInt(next());\n }\n static double readDouble () throws IOException {\n return Double.parseDouble(next());\n }\n static char readChar () throws IOException {\n return next().charAt(0);\n }\n static String readLine () throws IOException {\n return input.readLine().trim();\n }\n static void print(Object b) {\n System.out.print(b);\n }\n static void println(Object b) {\n System.out.println(b);\n }\n static void println() {\n System.out.println();\n }\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "724eabb90e7e5f9d31028ff48004ba3d", "src_uid": "8f0fad22f629332868c39969492264d3", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class SummerCamp {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n=scan.nextInt();\n\t\tscan.nextLine();\n\t\tString a=\"\";\n\t\tfor(int i=1;i<=n;i++)\n\t\t{\n\t\t\ta+=i;\n\t\t}\n\t\tSystem.out.println(a.charAt(n-1));\n\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "8916ecd5cde20e40a0e546d0a1ca8980", "src_uid": "2d46e34839261eda822f0c23c6e19121", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.BitSet;\n\npublic class ProblemC {\n\t\n\tstatic void doit(int m) {\n\t\tlong[][] a = generate(m);\n\t\tint len = a.length;\n\t\tint c = 0;\n\t\tfor (int j = 0 ; j < len ; j++) {\n\t\t\tc += a[len-1][j];\n\t\t}\n\t\tdebug(m, c);\n\t}\n\t\n\t\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader s = new BufferedReader(new InputStreamReader(System.in));\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\t\n\t\tString[] line = s.readLine().split(\" \");\n\t\tlong n = Long.valueOf(line[0]);\n\t\tlong t = Long.valueOf(line[1]);\n\t\t\n\t\tint fc = -1;\n\t\tfor (int f = 0 ; f < 60 ; f++) {\n\t\t\tif (Math.pow(2L, f) == t) {\n\t\t\t\tfc = f;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (fc == -1) {\n\t\t\tout.println(0);\n\t\t\tout.flush();\n\t\t\treturn;\n\t\t}\n\n\t\tn++;\n\t\tfc++;\n\t\t\n\t\tint len = 0;\n\t\tlong nn = n;\n\t\tint[] bit = new int[128];\n\t\twhile (nn >= 1) {\n\t\t\tbit[len] = (int)(nn % 2);\n\t\t\tnn /= 2L;\n\t\t\tlen++;\n\t\t}\n\t\t\n\t\tlong[][][] dp = new long[len+1][fc+1][3];\n\t\tdp[0][fc][0] = 1;\n\t\tfor (int i = 0 ; i < len ; i++) {\n\t\t\tfor (int f = 0 ; f <= fc ; f++) {\n\t\t\t\tfor (int c = 0 ; c <= 2 ; c++) {\n\t\t\t\t\tif (dp[i][f][c] == 0) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tlong base = dp[i][f][c];\n\t\t\t\t\tif (bit[i] == 0) {\n\t\t\t\t\t\t// use one\n\t\t\t\t\t\tif (f >= 1) {\n\t\t\t\t\t\t\tdp[i+1][f-1][1] += base;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t\n\t\t\t\t\t\t// use zero\n\t\t\t\t\t\tdp[i+1][f][c] += base;\n\t\t\t\t\t} else {\n\t\t\t\t\t\t// use one\n\t\t\t\t\t\tif (f >= 1) {\n\t\t\t\t\t\t\tdp[i+1][f-1][c] += base;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// use zero\n\t\t\t\t\t\tdp[i+1][f][2] += base;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tlong ans = dp[len][0][2] + dp[len][0][0];\n\t\tif (t == 1) {\n\t\t\tans--;\n\t\t}\n\t\tout.println(ans);\n\t\tout.flush();\n\t}\n\t\n\tpublic static long[][] generate(int m ){\n\t\tlong[][] a = new long[m+2][m+2];\n\t\ta[1][m+1] = 1;\n\t\tfor (int i = 2 ; i <= m + 1 ; i++) {\n\t\t\tfor (int j = 1 ; j <= m + 1 ; j++) {\n\t\t\t\tif (j == 1) {\n\t\t\t\t\ta[i][j] = a[i-1][j+1];\n\t\t\t\t} else {\n\t\t\t\t\tif (j == m + 1) {\n\t\t\t\t\t\ta[i][j] = a[i-1][j-1];\n\t\t\t\t\t} else {\n\t\t\t\t\t\ta[i][j] = a[i-1][j-1] ^ a[i-1][j+1];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn a;\n\t}\n\t\n\n\tpublic static void debug(Object... os){\n\t\tSystem.err.println(Arrays.deepToString(os));\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "dp", "constructive algorithms"], "code_uid": "e15f5ac364ffe7bec8a7c6f547440f25", "src_uid": "727d5b601694e5e0f0cf3a9ca25323fc", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\nimport static java.lang.Math.*;\nimport static java.util.Arrays.fill;\nimport static java.util.Arrays.binarySearch;\nimport static java.util.Arrays.sort;\n\npublic class Main {\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew Thread(null, new Runnable() {\n\t\t\tpublic void run() {\n\t\t\t\ttry {\n\t\t\t\t\ttry {\n\t\t\t\t\t\tif (new File(\"input.txt\").exists())\n\t\t\t\t\t\t\tSystem.setIn(new FileInputStream(\"input.txt\"));\n\t\t\t\t\t} catch (SecurityException e) {}\n\t\t\t\t\tnew Main().run();\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t}, \"1\", 1L << 24).start(); \n\t}\n\n\tBufferedReader in;\n\tPrintWriter out;\n\tStringTokenizer st = new StringTokenizer(\"\");\n\t\n\tint N;\n\tint M;\n\tint K;\n\t\n\tvoid run() throws IOException {\n\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tN = nextInt();\n\t\tM = nextInt();\n\t\tK = nextInt();\n\t\t\n\t\tint x = 1;\n\t\twhile (N > 0 && M > 0) {\n\t\t\tif (x == K) {\n\t\t\t\tout.println(count(N, M) - count(N - 2, M - 2));\n\t\t\t\tout.close();\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tN -= 2;\n\t\t\tM -= 2;\n\t\t\tx++;\n\t\t}\n\t\t\n\t\tout.println(0);\n\t\tout.close();\n\t}\n\t\n\tint count(int N, int M) {\n\t\tif (N <= 0 || M <= 0)\n\t\t\treturn 0;\n\t\tint a = (M + 1) / 2;\n\t\tint b = (M) / 2;\n\t\treturn a * ((N + 1) / 2) + b * (N / 2);\n\t}\n\t\n\tString nextToken() throws IOException {\n\t\twhile (!st.hasMoreTokens()) {\n\t\t\tst = new StringTokenizer(in.readLine());\n\t\t}\n\t\t\n\t\treturn st.nextToken();\n\t}\n\t\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\t\n\tlong nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\t\n\tdouble nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n\t\n\tString nextLine() throws IOException {\n\t\tst = new StringTokenizer(\"\");\n\t\treturn in.readLine();\n\t}\n\t\n\tboolean EOF() throws IOException {\n\t\twhile (!st.hasMoreTokens()) {\n\t\t\tString s = in.readLine();\n\t\t\t\n\t\t\tif (s == null) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t\n\t\t\tst = new StringTokenizer(s);\n\t\t}\n\t\t\n\t\treturn false;\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "6e849c202663dc2feff401e6a447fbcc", "src_uid": "fa1ef5f9bceeb7266cc597ba8f2161cb", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class airplane {\n public static void main(String args[]) {\n Scanner in = new Scanner(System.in);\n int k=in.nextInt();\n int n=in.nextInt();\n int s=in.nextInt();\n int p=in.nextInt();\n\n int sheet=n/s;\n if (n%s!=0)\n sheet++;\n\n int total=sheet*k;\n\n int ans=total/p;\n if (total%p!=0)\n ans++;\n\n System.out.println(ans);\n }\n}\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "1aaee3ddf2663e14e2878853154e7364", "src_uid": "73f0c7cfc06a9b04e4766d6aa61fc780", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class LuckyYear {\n\n\tpublic static void main(String[] args) {\n\t\t\n\t\tScanner scan = new Scanner(System.in);\n\t\t\n\t\tlong input = 0;\n\t\tlong output = 0;\n\t\t\n\t\tinput = scan.nextInt();\n\t\t\n\t\tSystem.out.println(nextLuckyYear(input));\n\n\t}\n\n\tpublic static long nextLuckyYear(long input) {\n\t\tlong multiplier = 1;\n\t\tlong result = 0;\n\t\tlong copy = input;\n\n\t\twhile (copy >= 10) {\n\t\t\tcopy /= 10;\n\t\t\tmultiplier *= 10; \n\t\t}\n\n\t\tresult = copy + 1;\n\n\t\tresult *= multiplier;\n\n\t\treturn result - input;\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "55242a16c7482711760030475908270f", "src_uid": "a3e15c0632e240a0ef6fe43a5ab3cc3e", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.PrintWriter;\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class Anon{\n static class Reader\n {\n private BufferedReader br;\n private StringTokenizer stkz;\n public Reader(InputStream obj)\n {\n br = new BufferedReader(new InputStreamReader(obj));\n stkz = null;\n }\n public String next()\n {\n while (stkz == null || !stkz.hasMoreElements())\n {\n try\n {\n stkz = new StringTokenizer(br.readLine());\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n }\n return stkz.nextToken();\n }\n public long[] nextLongArr(int n)\n {\n long[] arr = new long[n];\n for(int i=0; i<n; i++){\n arr[i] = nextLong();\n }\n return arr;\n }\n public int[] nextIntArr(int n)\n {\n int[] arr = new int[n];\n for(int i=0; i<n; i++){\n arr[i] = nextInt();\n }\n return arr;\n }\n public Integer[] nextIntegerArray(int n)\n {\n Integer[] arr = new Integer[n];\n for(int i=0; i<n; i++){\n arr[i] = nextInt();\n }\n return arr;\n }\n public Long[] nextLongArray(int n)\n {\n Long[] arr = new Long[n];\n for(int i=0; i<n; i++){\n arr[i] = nextLong();\n }\n return arr;\n }\n public int nextInt()\n {\n return Integer.parseInt(next());\n }\n public long nextLong()\n {\n return Long.parseLong(next());\n }\n public double nextDouble()\n {\n return Double.parseDouble(next());\n }\n public String nextLine()\n {\n String str = \"\";\n try\n {\n str = br.readLine();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n return str;\n }\n }\n public static void main(String[] args) throws Exception{\n Reader in = new Reader(System.in);\n PrintWriter out = new PrintWriter(System.out);\n String s1 = in.next(), s2 = in.next();\n String global = \"\"+s1.charAt(0)+s2.charAt(0);\n for (int i=0; i<s1.length(); i++) if (new String(\"\"+s1.substring(0, i+1)+s2.charAt(0)).compareTo(global) < 0) global = new String(\"\"+s1.substring(0, i+1)+s2.charAt(0));\n out.printf(\"%s\\n\", global);\n out.close();\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "sortings", "greedy"], "code_uid": "b4e3090ac1ea1423a5f92bf850792d7b", "src_uid": "aed892f2bda10b6aee10dcb834a63709", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Set;\nimport java.util.StringTokenizer;\nimport java.util.TreeSet;\n\n/**\n * Created by Kamil Khadiev on 11.08.2015.\n */\npublic class khadiev_8V_c {\n public static void main(String[] args) throws IOException {\n BufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n init(in);\n in.close();\n solve();\n PrintWriter out = new PrintWriter(System.out);\n print(out);\n out.close();\n\n }\n public static int n,m;\n public static int[] a,b;\n public static long ans;\n public static int INF = Integer.MAX_VALUE/2;\nstatic String s;\n private static void init(BufferedReader in) throws IOException {\n StringTokenizer st = new StringTokenizer(in.readLine().trim());\n n = Integer.parseInt(st.nextToken());\n m = Integer.parseInt(st.nextToken());\n\n\n }\n\n private static void solve() {\n ans = 0;\n int x1 = 0;\n int x2 = 0;\n x1 = (n/2*6-2);\n if (n %2 == 1)x1+=4;\n x2 = (m*6-3);\n int xx1 = n%2;\n int y1 = (n-1)/2;\n int y2 = m-1;\n while (y1>0&& y2>0){\n if(x1>x2){\n if (xx1 ==0){\n x1-=2;\n xx1 = 1;\n }\n else{\n x1 -=4;\n y1--;\n xx1 = 0;\n }\n if (y1 ==0){x1+=2;}\n y1--;\n y2--;\n }\n else{\n y2-=2;\n y1--;\n x2-=6;\n if (y2==-1) x2+=3;\n }\n }\n while (y1>0){\n if (xx1 ==0){\n x1-=2;\n xx1 = 1;\n }\n else{\n x1 -=4;\n y1--;\n xx1 = 0;\n }\n y1--;\n }\n if (y1==-1) x1+=2;\n if (y2>0){\n x2 -= 6*(y2/2);\n if (y2%2==1) x2-=3;\n }\n ans = Math.max(x2,x1);\n\n }\n\n private static void print(PrintWriter out) throws IOException {\n out.print(ans);\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "greedy", "number theory", "brute force"], "code_uid": "95f732d873adf05ca6df3524bca08eaa", "src_uid": "23f2c8cac07403899199abdcfd947a5a", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.*;\nimport java.io.*;\nimport java.lang.*;\nimport java.math.*;\n\n\npublic class j7 implements Runnable {\n\t\n\tpublic void run(){\n\t\t\n\t\tInputReader in = new InputReader(System.in);\n\t\tPrintWriter w = new PrintWriter(System.out);\n\t\t\n\t\tlong[] aa=new long[15];\n\t\tfor(int i=1;i<=14;i++)\n\t\t\taa[i]=in.nextLong();\n\t\t\n\t\tlong max=0;\n\t\t\n\t\tfor(int i=1;i<=14;i++)\n\t\t{\n\t\t\t\n\t\t\t\tlong[] a=new long[15];\n\t\t\t\tfor(int j=1;j<=14;j++)\n\t\t\t\t\ta[j]=aa[j];\n\t\t\t\t\n\t\t\t\t\n\t\t\t\tlong st=a[i];\n\t\t\t\ta[i]=0;\n\t\t\t\tlong m=st/14;\n\t\t\t\t\n\t\t\t\t\tfor(int l=1;l<=14;l++)\n\t\t\t\t\t\ta[l]=a[l]+m;\n\t\t\t\t\n\t\t\t\tlong ex=st%14;\n\t\t\t\tint k=i+1;\n\t\t\t\n\t\t\t\tif(k>14)\n\t\t\t\t\tk=k%14;\n\t\t\t\t\n\t\t\t\tfor(int j=0;j<ex;j++)\n\t\t\t\t{\n\t\t\t\t\t\n\t\t\t\t\ta[k]++;\n\t\t\t\t\tk=k+1;\n\t\t\t\t\tif(k>14)\n\t\t\t\t\t\tk=k%14;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tlong count=0;\n\t\t\t\tfor(int j=1;j<=14;j++)\n\t\t\t\t{\n\t\t\t\t\t\n\t\t\t\t\tif(a[j]%2==0 && a[j]>0)\n\t\t\t\t\t\tcount+=a[j];\n\t\t\t\t}\n\t\t\t\tmax=Math.max(max, count);\n\t\t}\n\t\t\n\t\tw.println(max);\n\t\tw.close();\t\n\t}\n\t\n\tstatic class InputReader {\n\t\t\n\t\tprivate InputStream stream;\n\t\tprivate byte[] buf = new byte[1024];\n\t\tprivate int curChar;\n\t\tprivate int numChars;\n\t\tprivate SpaceCharFilter filter;\n\t\t\n\t\tpublic InputReader(InputStream stream)\n\t\t{\n\t\t\tthis.stream = stream;\n\t\t}\n\t\t\n\t\tpublic int read()\n\t\t{\n\t\t\tif (numChars==-1) \n\t\t\t\tthrow new InputMismatchException();\n\t\t\t\n\t\t\tif (curChar >= numChars)\n\t\t\t{\n\t\t\t\tcurChar = 0;\n\t\t\t\ttry \n\t\t\t\t{\n\t\t\t\t\tnumChars = stream.read(buf);\n\t\t\t\t}\n\t\t\t\tcatch (IOException e)\n\t\t\t\t{\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(numChars <= 0)\t\t\t\t\n\t\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn buf[curChar++];\n\t\t}\n\t \n\t\tpublic String nextLine()\n\t\t{\n\t\t\tBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\t\t\tString str = \"\";\n try\n {\n str = br.readLine();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n return str;\n\t\t}\n\t\tpublic int nextInt()\n\t\t{\n\t\t\tint c = read();\n\t\t\t\n\t\t\twhile(isSpaceChar(c)) \n\t\t\t\tc = read();\n\t\t\t\n\t\t\tint sgn = 1;\n\t\t\t\n\t\t\tif (c == '-') \n\t\t\t{\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\t\n\t\t\tint res = 0;\n\t\t\tdo \n\t\t\t{\n\t\t\t\tif(c<'0'||c>'9') \n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\twhile (!isSpaceChar(c)); \n\t\t\t\n\t\t\treturn res * sgn;\n\t\t}\n\t\t\n\t\tpublic long nextLong() \n\t\t{\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-') \n\t\t\t{\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\t\n\t\t\tdo \n\t\t\t{\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\twhile (!isSpaceChar(c));\n\t\t\t\treturn res * sgn;\n\t\t}\n\t\t\n\t\tpublic double nextDouble() \n\t\t{\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-') \n\t\t\t{\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tdouble res = 0;\n\t\t\twhile (!isSpaceChar(c) && c != '.') \n\t\t\t{\n\t\t\t\tif (c == 'e' || c == 'E')\n\t\t\t\t\treturn res * Math.pow(10, nextInt());\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tif (c == '.') \n\t\t\t{\n\t\t\t\tc = read();\n\t\t\t\tdouble m = 1;\n\t\t\t\twhile (!isSpaceChar(c)) \n\t\t\t\t{\n\t\t\t\t\tif (c == 'e' || c == 'E')\n\t\t\t\t\t\treturn res * Math.pow(10, nextInt());\n\t\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t\tm /= 10;\n\t\t\t\t\tres += (c - '0') * m;\n\t\t\t\t\tc = read();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn res * sgn;\n\t\t}\n\t\t\n\t\tpublic String readString() \n\t\t{\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo \n\t\t\t{\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t} \n\t\t\twhile (!isSpaceChar(c));\n\t\t\t\n\t\t\treturn res.toString();\n\t\t}\n\t \n\t\tpublic boolean isSpaceChar(int c) \n\t\t{\n\t\t\tif (filter != null)\n\t\t\t\treturn filter.isSpaceChar(c);\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n\t \n\t\tpublic String next() \n\t\t{\n\t\t\treturn readString();\n\t\t}\n\t\t\n\t\tpublic interface SpaceCharFilter \n\t\t{\n\t\t\tpublic boolean isSpaceChar(int ch);\n\t\t}\n\t}\n \n\tpublic static void main(String args[]) throws Exception\n\t{\n\t\tnew Thread(null, new j7(),\"j7\",1<<26).start();\n\t}\n } \n", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "851e9820afdb04af362a665fb48ecd0d", "src_uid": "1ac11153e35509e755ea15f1d57d156b", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class TaskB {\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n String x = in.nextLine();\n String result = computeMaxDigitSumNumber(x);\n System.out.println(result);\n }\n\n static String computeMaxDigitSumNumber(String x) {\n int len = x.length();\n if (len == 1) {\n return x;\n }\n int firstDigit = Character.getNumericValue(x.charAt(0));\n int secondDigit = Character.getNumericValue(x.charAt(1));\n String nines = repeatChar('9', len - 2);\n String xPostfix = x.substring(2);\n boolean endToNines = xPostfix.equals(nines);\n if (secondDigit < 8 || secondDigit == 8 && !endToNines) {\n return (firstDigit == 1 ? \"\" : firstDigit - 1) + \"9\" + nines;\n } else if (endToNines) {\n return x;\n } else {\n String newXPostfix = computeMaxDigitSumNumber(xPostfix);\n newXPostfix = fillZerosToLen(newXPostfix, len - 2);\n if (computeDigitSum(newXPostfix) >= 9 * (len - 2) - 1) {\n return firstDigit + \"\" + secondDigit + newXPostfix;\n } else {\n return (firstDigit * 10 + secondDigit - 1) + nines;\n }\n }\n }\n\n private static int computeDigitSum(String x) {\n int digitSum = 0;\n for (int i = 0; i < x.length(); ++i) {\n digitSum += x.charAt(i) - '0';\n }\n return digitSum;\n }\n\n private static String repeatChar(char c, int count) {\n StringBuilder sb = new StringBuilder();\n for (int i = 0; i < count; ++i) {\n sb.append(c);\n }\n return sb.toString();\n }\n\n private static String fillZerosToLen(String x, int len) {\n return repeatChar('0', len - x.length()) + x;\n }\n\n}", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "3c33928c49c3b8186e4a5839eb5ca2eb", "src_uid": "e55b0debbf33c266091e6634494356b8", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\n/**\n *\n * @author aselvarajah\n */\npublic class Days {\n\n /**\n * @param args the command line arguments\n */\n public static void main(String[] args) {\n\t\n Scanner scanner = new Scanner(System.in);\n \n \n \t\n int day = scanner.nextInt();\n\tint day2 =day;\n int lessDay =0;\n int maxDay =0; \n\t\n\t\n\t\n \n \n while (day>0){\n if((day - 6) >= 0){\n day = day-6;\n lessDay++;\n if((day - 1) >= 0){\n day = day-1;\n lessDay++;\n }\n else\n break;\n }\n else \n break;\n }\n \n \n \t if((day2 - 1) >= 0){\n day2 = day2-1;\n maxDay++;\n }\n while (day2>0){\n if((day2 - 1) >= 0){\n day2 = day2-1;\n maxDay++;\n if((day2 - 6) >= 0){\n day2 = day2-6;\n maxDay++;\n }\n else\n break;\n } \n else\n break;\n }\n System.out.println(lessDay + \" \" +maxDay);\n \n \n \n}\n \n}", "lang_cluster": "Java", "tags": ["math", "greedy", "constructive algorithms", "brute force"], "code_uid": "21863445dc3d5c5c6902ded9f9d8dc66", "src_uid": "8152daefb04dfa3e1a53f0a501544c35", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class D{\n private void solve() {\n long n=nextLong();\n long ans=0;\n for(int i=1;i<=n-2;i++){\n ans=ans+(i+1)*(i+2);\n }\n writer.println(ans);\n }\n\n\n public static void main(String[] args) {\n new D().run();\n }\n BufferedReader reader;\n StringTokenizer tokenizer;\n PrintWriter writer;\n\n private void run() {\n try {\n reader = new BufferedReader(new InputStreamReader(System.in));\n writer = new PrintWriter(System.out);\n tokenizer = null;\n solve();\n reader.close();\n writer.close();\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n\n private String nextToken() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n private int nextInt() {\n return Integer.parseInt(nextToken());\n }\n\n private long nextLong() {\n return Long.parseLong(nextToken());\n }\n\n private double nextDouble() {\n return Double.parseDouble(nextToken());\n }\n}", "lang_cluster": "Java", "tags": ["math", "greedy", "dp"], "code_uid": "426db615d38900548239c760ab771bb0", "src_uid": "1bd29d7a8793c22e81a1f6fd3991307a", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\nimport java.math.*;\nimport java.io.*;\nimport java.text.*;\n\npublic class practice {\n public static void merge(int arr[], int l, int m, int r) {\n // Find sizes of two subarrays to be merged\n int n1 = m - l + 1;\n int n2 = r - m;\n\n /* Create temp arrays */\n int L[] = new int[n1];\n int R[] = new int[n2];\n\n /*Copy data to temp arrays*/\n for (int i = 0; i < n1; ++i)\n L[i] = arr[l + i];\n for (int j = 0; j < n2; ++j)\n R[j] = arr[m + 1 + j];\n\n\n /* Merge the temp arrays */\n\n // Initial indexes of first and second subarrays\n int i = 0, j = 0;\n\n // Initial index of merged subarry array\n int k = l;\n while (i < n1 && j < n2) {\n if (L[i] <= R[j]) {\n arr[k] = L[i];\n i++;\n } else {\n arr[k] = R[j];\n j++;\n }\n k++;\n }\n\n /* Copy remaining elements of L[] if any */\n while (i < n1) {\n arr[k] = L[i];\n i++;\n k++;\n }\n\n /* Copy remaining elements of R[] if any */\n while (j < n2) {\n arr[k] = R[j];\n j++;\n k++;\n }\n }\n\n // Main function that sorts arr[l..r] using\n // merge()\n public static void sort(int arr[], int l, int r) {\n if (l < r) {\n // Find the middle point\n int m = (l + r) / 2;\n\n // Sort first and second halves\n sort(arr, l, m);\n sort(arr, m + 1, r);\n\n // Merge the sorted halves\n merge(arr, l, m, r);\n }\n }\n\n public static void main(String[] args) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st = new StringTokenizer(br.readLine());\n int n = Integer.parseInt(st.nextToken());\n int d = Integer.parseInt(st.nextToken());\n ArrayList<Integer>A = new ArrayList<>();\n String s = br.readLine();\n for(int i=0;i<n;i++){\n int b = Character.getNumericValue(s.charAt(i));\n if(b == 1){\n A.add(i+1);\n }\n }\n int jump = 0;\n boolean flag = true;\n for(int i=0;i<A.size()-1;){\n boolean check = false;\n int x = A.get(i);\n while (i<A.size()-1 && (A.get(i+1)-x)<=d){\n i++;\n check = true;\n }\n if(check){\n jump++;\n }\n else{\n flag = false;\n break;\n }\n }\n if(flag){\n System.out.println(jump);\n }\n else{\n System.out.println(-1);\n }\n }\n}\n\nclass sort implements Comparator<ArrayList<Long>> {\n\n @Override\n public int compare(ArrayList<Long> o1, ArrayList<Long> o2) {\n int c = o1.get(2).compareTo(o2.get(2));\n return c;\n }\n\n}", "lang_cluster": "Java", "tags": ["dfs and similar", "greedy", "dp", "implementation"], "code_uid": "1ee7572473aa95f7419805bacaada45b", "src_uid": "c08d2ecdfc66cd07fbbd461b1f069c9e", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.LinkedList;\nimport java.util.Queue;\n\npublic class B {\n public static void main(String[] args) throws IOException {\n BufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n String[] S = in.readLine().split(\" \");\n long[] A = new long[4];\n for (int i = 0; i < 4; i++)\n A[i] = Integer.parseInt(S[i]);\n S = in.readLine().split(\" \");\n Queue<long[]> Q = new LinkedList<long[]>();\n Q.add(A);\n long min = Long.MAX_VALUE;\n while (!Q.isEmpty()) {\n long[] temp = Q.poll();\n if (temp.length == 1) {\n min = Math.min(min, temp[0]);\n }\n for (int i = 0; i < temp.length; i++)\n for (int j = 0; j < temp.length; j++) {\n if (i == j)\n continue;\n long[] temp2 = new long[temp.length - 1];\n if (S[4 - temp.length].equals(\"*\"))\n temp2[0] = temp[i] * temp[j];\n else\n temp2[0] = temp[i] + temp[j];\n int c = 1;\n for (int k = 0; k < temp.length; k++)\n if (k != i && k != j)\n temp2[c++] = temp[k];\n Q.add(temp2);\n }\n }\n System.out.println(min);\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force"], "code_uid": "09bf0aca1ec146a5fd4b4915896fc673", "src_uid": "7a66fae63d9b27e444d84447012e484c", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\n\npublic class cf109b {\n\tstatic ArrayList<Long> lucky = new ArrayList<Long>();\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tgenLucky(0,11);\n\t\tCollections.sort(lucky);\n\t\tlong pl = in.nextLong();\n\t\tlong pr = in.nextLong();\n\t\tlong vl = in.nextLong();\n\t\tlong vr = in.nextLong();\n\t\tint k = in.nextInt();\n\t\tdouble ret = 0;\n\t\tfor(int i=0; i<lucky.size()-k-2; i++) {\n\t\t\t//assume p is lower\n\t\t\t//probability that p got in the interval (lucky[i],lucky[i+1]]\n\t\t\tlong lo = Math.max(lucky.get(i)+1, pl);\n\t\t\tlong hi = Math.min(lucky.get(i+1), pr);\n\t\t\tdouble p = Math.max(0,(hi-lo+1.)/(pr-pl+1));\n\t\t\t//probability that v got in the interval [lucky[i+k],lucky[i+k+1)\n\t\t\tlo = Math.max(lucky.get(i+k),vl);\n\t\t\thi = Math.min(lucky.get(i+k+1)-1,vr);\n\t\t\tdouble v = Math.max(0,(hi-lo+1.)/(vr-vl+1));\n\t\t\tret += p*v;\n\t\t\t\n\t\t\t//assume v is lower\n\t\t\t//probability that v got in the interval (lucky[i],lucky[i+1]]\n\t\t\tlo = Math.max(lucky.get(i)+1, vl);\n\t\t\thi = Math.min(lucky.get(i+1), vr);\n\t\t\tv = Math.max(0,(hi-lo+1.)/(vr-vl+1));\n\t\t\t//probability that p got in the interval [lucky[i+k],lucky[i+k+1)\n\t\t\tlo = Math.max(lucky.get(i+k),pl);\n\t\t\thi = Math.min(lucky.get(i+k+1)-1,pr);\n\t\t\tp = Math.max(0,(hi-lo+1.)/(pr-pl+1));\n\t\t\tret += p*v;\n\t\t\t\n\t\t\t//remove double counting (probability they got the same)\n\t\t\tif(k==1) {\n\t\t\t\tlo = Math.max(lucky.get(i), vl);\n\t\t\t\thi = Math.min(lucky.get(i), vr);\n\t\t\t\tv = Math.max(0,(hi-lo+1.)/(vr-vl+1));\n\t\t\t\tlo = Math.max(lucky.get(i),pl);\n\t\t\t\thi = Math.min(lucky.get(i),pr);\n\t\t\t\tp = Math.max(0,(hi-lo+1.)/(pr-pl+1));\n\t\t\t\tret -= p*v;\n\t\t\t}\n\t\t}\n\t\tSystem.out.printf(\"%.12f%n\", ret);\n\t}\n\tstatic void genLucky(long cur, long left) {\n\t\tif(left == 0) return;\n\t\tlucky.add(cur);\n\t\tgenLucky(cur*10+4,left-1);\n\t\tgenLucky(cur*10+7,left-1);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "probabilities", "combinatorics", "brute force"], "code_uid": "b2763ee76f424d2b46b9f6128846d2ff", "src_uid": "5d76ec741a9d873ce9d7c3ef55eb984c", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "\n// Problem: A. Elevator or Stairs?\n// Contest: Codeforces - Mail.Ru Cup 2018 Round 1\n// URL: https://codeforces.com/problemset/problem/1054/A\n// Memory Limit: 256 MB\n// Time Limit: 1000 ms\n// Powered by CP Editor (https://github.com/cpeditor/cpeditor)\n\nimport java.util.*;\nimport java.io.*;\n\npublic class Main {\n\n\tstatic PrintWriter out;\n\tstatic FastReader fr;\n\t// make it false if Multiple test case is not in the question\n\tstatic boolean multipleTC = false;\n\tstatic int TestCase = 1;\n\n\t// for pre processing if needed\n\tvoid pre() throws Exception {\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\n\t\tnew Main().run();\n\t}\n\n\t// input output handled here\n\tprivate Object solve() throws Exception {\n\t\t// code\n\t\tint y = fr.ni(), x = fr.ni(), z = fr.ni(), t1 = fr.ni(), t2 = fr.ni(), t3 = fr.ni();\n\t\tint timeElv = (Math.abs(y - z) * t2 + 2 * t3) + Math.abs(x - y) * t2 + t3;\n\t\tint timeStr = Math.abs(y - x) * t1;\n\t\t// deb(timeElv, timeStr);\n\t\tif (timeElv <= timeStr)\n\t\t\treturn \"YES\";\n\t\treturn \"NO\";\n\t}\n\n\tvoid run() throws Exception {\n\t\t// long start_time = System.nanoTime();\n\n\t\ttry {\n\t\t\tfr = new FastReader(\"in0.txt\");\n\t\t\tout = new PrintWriter(\"out0.txt\");\n\t\t} catch (Exception e) {\n\t\t\tfr = new FastReader();\n\t\t\tout = new PrintWriter(System.out);\n\t\t}\n\t\tpre();\n\t\tStringBuilder print = new StringBuilder(\"\");\n\n\t\tint T = (multipleTC) ? fr.ni() : 1;\n\t\tfor (int t = 1; t <= T; t++) {\n\t\t\tTestCase = t;\n\t\t\tprint.append(solve()).append(\"\\n\");\n\t\t}\n\n\t\tp(print);\n\t\t// long end_time = System.nanoTime();\n\t\t// System.out.printf(\"Running Time in sec : %2.10f\", (double) (end_time -\n\t\t// start_time) * (double) 1e-9);\n\n\t\tout.flush();\n\t\tout.close();\n\t}\n\n\tstatic void p(Object o) {\n\t\tout.print(o);\n\t}\n\n\tstatic void pln(Object o) {\n\t\tout.println(o);\n\t}\n\n\tstatic void psp(Object o) {\n\t\tout.print(o + \" \");\n\t}\n\n\tstatic void pnf(Object o) {\n\t\tout.println(o);\n\t\tout.flush();\n\t}\n\n\tstatic void deb(Object... x) {\n\t\tSystem.out.print(\"#\" + TestCase + \" = \");\n\t\tfor (int i = 0; i < x.length - 1; i++)\n\t\t\tSystem.out.print(x[i] + \" , \");\n\t\tSystem.out.println(x[x.length - 1]);\n\n\t}\n\n\tstatic void in(int a) throws Exception {\n\t\ta = fr.ni();\n\t}\n\n\tstatic void in(long a) throws Exception {\n\t\ta = fr.ni();\n\t}\n\n\tstatic void in(String[] a) throws Exception {\n\t\ta = fr.nln().trim().split(\" \");\n\t}\n\n\tstatic void in(String a) throws Exception {\n\t\ta = fr.next();\n\t}\n\n\tstatic void in(int a[]) throws Exception {\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\ta[i] = fr.ni();\n\t\t}\n\t}\n\n\tstatic void in(long a[]) throws Exception {\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\ta[i] = fr.nl();\n\t\t}\n\t}\n\n\tstatic void in(int a[][]) throws Exception {\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\tfor (int j = 0; j < a[0].length; j++) {\n\t\t\t\ta[i][j] = fr.ni();\n\t\t\t}\n\t\t}\n\t}\n\n\tclass FastReader {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tpublic FastReader() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tpublic FastReader(String s) throws Exception {\n\t\t\tbr = new BufferedReader(new FileReader(s));\n\t\t}\n\n\t\tString next() throws Exception {\n\t\t\twhile (st == null || !st.hasMoreElements()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new Exception(e.toString());\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tString nextLine() throws Exception {\n\t\t\tString str = \"\";\n\t\t\ttry {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new Exception(e.toString());\n\t\t\t}\n\t\t\treturn str;\n\t\t}\n\n\t\tString n() throws Exception {\n\t\t\treturn fr.next();\n\t\t}\n\n\t\tString nln() throws Exception {\n\t\t\treturn fr.nextLine().trim();\n\t\t}\n\n\t\tint ni() throws Exception {\n\t\t\treturn Integer.parseInt(fr.next());\n\t\t}\n\n\t\tlong nl() throws Exception {\n\t\t\treturn Long.parseLong(fr.next());\n\t\t}\n\n\t\tdouble nd() throws Exception {\n\t\t\treturn Double.parseDouble(fr.next());\n\t\t}\n\n\t\tint[] nextIntArray(int n) throws Exception {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\ta[i] = fr.ni();\n\t\t\t}\n\t\t\treturn a;\n\t\t}\n\n\t\tlong[] nextLongArray(int n) throws Exception {\n\t\t\tlong[] a = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\ta[i] = fr.nl();\n\t\t\t}\n\t\t\treturn a;\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "339562df848275354a6fd27fe780f8f9", "src_uid": "05cffd59b28b9e026ca3203718b2e6ca", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.math.BigInteger;\nimport java.net.HttpURLConnection;\nimport java.net.URISyntaxException;\nimport java.net.URL;\nimport java.nio.charset.StandardCharsets;\nimport java.nio.file.Files;\nimport java.nio.file.Paths;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.HashMap;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Scanner;\n\nimport javax.script.ScriptEngine;\nimport javax.script.ScriptEngineManager;\nimport javax.script.ScriptException;\n\npublic final class check2{\n\t\n\tpublic static void main(String args[]){\n\t\t\n\t\tScanner s=new Scanner(System.in);\n\t\tlong x=s.nextLong();\n\t\tlong y=s.nextLong();\n\t\tdouble result=(Math.log(x)/x)-(Math.log(y)/y);\n\t\tif(result<0) {\n\t\t\tSystem.out.println(\"<\");\n\t\t}else if(result>0) {\n\t\t\tSystem.out.println(\">\");\n\t\t}else {\n\t\t\tSystem.out.println(\"=\");\n\t\t}\n\t}\n}\n\n\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "0dfaee69712a79558560eb432376c556", "src_uid": "ec1e44ff41941f0e6436831b5ae543c6", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.lang.*;\nimport java.math.*;\nimport java.text.DecimalFormat;\nimport java.lang.reflect.Array;\nimport java.io.BufferedOutputStream;\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.math.BigDecimal;\npublic class Codeforces{\n\tpublic static PrintWriter out = new PrintWriter (new BufferedOutputStream(System.out));\n\tstatic long MOD = (long)(1e9+7);\n\tstatic long MOD2 = MOD*MOD;\n\t//static long MOD = 998244353;\n\tstatic FastReader sc = new FastReader();\n\tstatic int pInf = Integer.MAX_VALUE;\n\tstatic int nInf = Integer.MIN_VALUE;\n\tpublic static void main(String[] args){\n\t\tint test = 1;\n\t\t//test = sc.nextInt();\n\t\twhile(test-->0){\n\t\t\tlong a = sc.nextLong();\n\t\t\tlong b = sc.nextLong();\n\t\t\tlong n = sc.nextLong();\n\t\t\tlong x = sc.nextLong();\n\t\t\tif(a==1) {\n\t\t\t\tout.println(add(x, mul(n, b)));\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tlong a1 = mul(fastExpo(a, n), x);\n\t\t\tlong a2 = mul(b, mul((fastExpo(a, n)-1),finextDoubleMMI_fermat(a-1, (int)MOD)));\n\t\t\tout.println(add(a1, a2));\n\t\t}\n\t\tout.close();\n\t}\n\tpublic static long solve(long a, long b, long x, long y, long n) {\n\t\tif(a-x<n) {\n\t\t\tn = n-(a-x);\n\t\t\ta = x;\n\t\t\tb = Math.max(y, b-n);\n\t\t}\n\t\telse {\n\t\t\ta = a-n;\n\t\t}\n\t\treturn a*b;\n\t}\n\tpublic static int lowerBound(int key, ArrayList<Integer> A) {\n\t\tint s = 0;\n\t\tint e = A.size()-1;\n\t\tif(e==-1) {\n\t\t\treturn 0;\n\t\t}\n\t\tint ans = -1;\n\t\twhile(s<=e) {\n\t\t\tint m = s+(e-s)/2;\n\t\t\tif(A.get(m)>=key) {\n\t\t\t\tans = m;\n\t\t\t\te = m-1;\n\t\t\t}\n\t\t\telse {\n\t\t\t\ts = m+1;\n\t\t\t}\n\t\t}\n\t\treturn ans==-1?s:ans;\n\t}\n\tpublic static int upperBound(int key, ArrayList<Integer> A) {\n\t\tint s = 0;\n\t\tint e = A.size()-1;\n\t\tif(e==-1) {\n\t\t\treturn 0;\n\t\t}\n\t\tint ans = -1;\n\t\twhile(s<=e) {\n\t\t\tint m = s+(e-s)/2;\n\t\t\tif(A.get(m)>key) {\n\t\t\t\tans = m;\n\t\t\t\te = m-1;\n\t\t\t}\n\t\t\telse {\n\t\t\t\ts = m+1;\n\t\t\t}\n\t\t}\n\t\treturn ans==-1?s:ans;\n\t}\n\tpublic static long c2(long n) {\n\t\tif((n&1)==0) {\n\t\t\treturn mul(n/2, n-1);\n\t\t}\n\t\telse {\n\t\t\treturn mul(n, (n-1)/2);\n\t\t}\n\t}\n\tpublic static long mul(long a, long b){\n\t return ((a%MOD)*(b%MOD))%MOD;\n\t}\n\tpublic static long add(long a, long b){\n\t return ((a%MOD)+(b%MOD))%MOD;\n\t}\n\tpublic static long sub(long a, long b){\n\t return ((a%MOD)-(b%MOD))%MOD;\n\t}\n////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n//Integer.lowestOneBit(i) Equals k where k is the position of the first one in the binary\n//Integer.highestOneBit(i) Equals k where k is the position of the last one in the binary\n//Integer.bitCount(i) returns the number of one-bits\n//Collections.sort(A,(p1,p2)->(int)(p2.x-p1.x)) To sort ArrayList in descending order wrt values of x.\n// Arrays.parallelSort(a,new Comparator<TPair>() {\n// \t\tpublic int compare(TPair a,TPair b) {\n// \t\t\tif(a.y==b.y) return a.x-b.x;\n// \t\t\treturn b.y-a.y;\n// \t\t}\n// \t});\n////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n//PrimeFactors \n public static ArrayList<Long> primeFactors(long n) {\n ArrayList<Long> arr = new ArrayList<>();\n if (n % 2 == 0)\n arr.add((long) 2);\n while (n % 2 == 0)\n n /= 2;\n for (long i = 3; i <= Math.sqrt(n); i += 2) {\n int flag = 0;\n while (n % i == 0) {\n n /= i;\n flag = 1;\n }\n if (flag == 1)\n arr.add(i);\n }\n if (n > 2)\n arr.add(n);\n return arr;\n }\n//Pair Class\n\tstatic class Pair implements Comparable<Pair>{\n\t\tint x;\n\t\tint y;\n\t\tint len;\n\t\tpublic Pair(int x, int y) {\n\t\t\tthis.x = x;\n\t\t\tthis.y = y;\n\t\t\tthis.len = y-x+1;\n\t\t}\n\t\t/*@Override\n\t\tpublic int compareTo(Pair o) {\n\t\t\tif(this.x==o.x){\n\t\t\t return (this.y-o.y);\n\t\t\t}\n\t\t\treturn (this.x-o.x);\n\t\t}*/\n\t\t@Override\n\t\tpublic int compareTo(Pair o) {\n\t\t\tif(this.len==o.len) {\n\t\t\t\treturn this.x-o.x;\n\t\t\t}\n\t\t\telse {\n\t\t\t\treturn o.len-this.len;\n\t\t\t}\n\t\t}\n\t}\n\tstatic class TPair implements Comparable<TPair>{\n\t\tint two;\n\t\tint three;\n\t\tint prime;\n\t\tpublic TPair(int two, int three, int prime) {\n\t\t\tthis.two = two;\n\t\t\tthis.three = three;\n\t\t\tthis.prime = prime;\n\t\t}\n\t\t@Override\n\t\tpublic int compareTo(TPair o) {\n\t\t\tif(this.three==o.three){\n\t\t\t return (this.two-o.two);\n\t\t\t}\n\t\t\treturn -1*(this.three-o.three);\n\t\t}\n\t}\n//nCr\n\tstatic long ncr(long n, long k) {\n long ret = 1;\n for (long x = n; x > n - k; x--) {\n ret *= x;\n ret /= (n - x + 1);\n }\n\n return ret;\n }\n\tstatic long finextDoubleMMI_fermat(long n,int M)\n {\n return fastExpo(n,M-2);\n }\n \n static long nCrModPFermat(int n, int r, int p) \n { \n if (r == 0) \n return 1; \n long[] fac = new long[n+1]; \n fac[0] = 1; \n for (int i = 1 ;i <= n; i++) \n fac[i] = fac[i-1] * i % p; \n return (fac[n]* finextDoubleMMI_fermat(fac[r], p)% p * finextDoubleMMI_fermat(fac[n-r], p) % p) % p; \n }\n//Kadane's Algorithm \n static long maxSubArraySum(ArrayList<Long> a) { \n \tif(a.size()==0) {\n \t\treturn 0;\n \t}\n \tlong max_so_far = a.get(0); \n \tlong curr_max = a.get(0); \n \tfor (int i = 1; i < a.size(); i++) { \n curr_max = Math.max(a.get(i), curr_max+a.get(i)); \n max_so_far = Math.max(max_so_far, curr_max); \n \t} \n \treturn max_so_far; \n } \n//Shuffle Sort\n static final Random random=new Random();\n\tstatic void ruffleSort(int[] a) {\n\t\tint n=a.length;//shuffle, then sort \n\t\tfor (int i=0; i<n; i++) {\n\t\t\tint oi=random.nextInt(n), temp=a[oi];\n\t\t\ta[oi]=a[i]; a[i]=temp;\n\t\t}\n\t\tArrays.sort(a);\n\t}\n//Merge Sort\n\tstatic void merge(long arr[], int l, int m, int r)\n {\n // Find sizes of two subarrays to be merged\n int n1 = m - l + 1;\n int n2 = r - m;\n \n /* Create temp arrays */\n long L[] = new long [n1];\n long R[] = new long [n2];\n \n /*Copy data to temp arrays*/\n for (int i=0; i<n1; ++i)\n L[i] = arr[l + i];\n for (int j=0; j<n2; ++j)\n R[j] = arr[m + 1+ j];\n \n \n /* Merge the temp arrays */\n \n // Initial indexes of first and second subarrays\n int i = 0, j = 0;\n \n // Initial index of merged subarry array\n int k = l;\n while (i < n1 && j < n2)\n {\n if (L[i] <= R[j])\n {\n arr[k] = L[i];\n i++;\n }\n else\n {\n arr[k] = R[j];\n j++;\n }\n k++;\n }\n \n /* Copy remaining elements of L[] if any */\n while (i < n1)\n {\n arr[k] = L[i];\n i++;\n k++;\n }\n \n /* Copy remaining elements of R[] if any */\n while (j < n2)\n {\n arr[k] = R[j];\n j++;\n k++;\n }\n }\n \n // Main function that sorts arr[l..r] using\n // merge()\n static void sort(long arr[], int l, int r)\n {\n if (l < r)\n {\n // Find the middle point\n int m = (l+r)/2;\n \n // Sort first and second halves\n sort(arr, l, m);\n sort(arr , m+1, r);\n \n // Merge the sorted halves\n merge(arr, l, m, r);\n }\n }\n//Brian Kernighans Algorithm\n static long countSetBits(long n){\n if(n==0) return 0;\n return 1+countSetBits(n&(n-1));\n }\n//Factorial\n static long factorial(long n){\n if(n==1) return 1;\n if(n==2) return 2;\n if(n==3) return 6;\n return n*factorial(n-1);\n }\n//Euclidean Algorithm\n static long gcd(long A,long B){\n if(B==0) return A;\n return gcd(B,A%B);\n }\n//Modular Exponentiation\n static long fastExpo(long x,long n){\n if(n==0) return 1;\n if((n&1)==0) return fastExpo((x*x)%MOD,n/2)%MOD;\n return ((x%MOD)*fastExpo((x*x)%MOD,(n-1)/2))%MOD;\n }\n//AKS Algorithm\n static boolean isPrime(long n){\n if(n<=1) return false;\n if(n<=3) return true;\n if(n%2==0 || n%3==0) return false;\n for(int i=5;i<=Math.sqrt(n);i+=6)\n if(n%i==0 || n%(i+2)==0) return false;\n return true;\n }\n//Reverse an array\n static <T> void reverse(T arr[],int l,int r){\n \tCollections.reverse(Arrays.asList(arr).subList(l, r));\n }\n //Print array\n static void print1d(int arr[]) {\n \tout.println(Arrays.toString(arr));\n }\n static void print2d(int arr[][]) {\n \tfor(int a[]: arr) out.println(Arrays.toString(a));\n }\n//Sieve of eratosthenes\n static int[] findPrimes(int n){\n boolean isPrime[]=new boolean[n+1];\n ArrayList<Integer> a=new ArrayList<>();\n int result[];\n Arrays.fill(isPrime,true);\n isPrime[0]=false;\n isPrime[1]=false;\n for(int i=2;i*i<=n;++i){\n if(isPrime[i]==true){\n for(int j=i*i;j<=n;j+=i) isPrime[j]=false;\n }\n }\n for(int i=0;i<=n;i++) if(isPrime[i]==true) a.add(i);\n result=new int[a.size()];\n for(int i=0;i<a.size();i++) result[i]=a.get(i);\n return result;\n \n }\n//Indivisual factors of all nos till n\n static ArrayList<Integer>[] indiFactors(int n){\n \tArrayList<Integer>[] A = new ArrayList[n+1];\n \tfor(int i = 0; i <= n; i++) {\n \t\tA[i] = new ArrayList<>();\n \t}\n \tint[] sieve = new int[n+1];\n \tfor(int i=2;i<=n;i++) {\n \t\tif(sieve[i]==0) {\n \t\t\tfor(int j=i;j<=n;j+=i) if(sieve[j]==0) {\n \t\t\t\t//sieve[j]=i;\n \t\t\t\tA[j].add(i);\n \t\t\t}\n \t\t}\n \t}\n \treturn A;\n }\n//Segmented Sieve\n static boolean[] segmentedSieve(long l, long r){\n \tboolean[] segSieve = new boolean[(int)(r-l+1)];\n \tArrays.fill(segSieve, true);\n \tint[] prePrimes = findPrimes((int)Math.sqrt(r));\n \tfor(int p:prePrimes) {\n \t\tlong low = (l/p)*p;\n \t\tif(low < l) {\n \t\t\tlow += p;\n \t\t}\n \t\tif(low == p) {\n \t\t\tlow += p;\n \t\t}\n \t\tfor(long j = low; j<= r; j += p) {\n \t\t\tsegSieve[(int) (j-l)] = false;\n \t\t}\n \t}\n \tif(l==1) {\n \t\tsegSieve[0] = false;\n \t}\n \treturn segSieve;\n }\n//Euler Totent function\n static long countCoprimes(long n){\n ArrayList<Long> prime_factors=new ArrayList<>();\n long x=n,flag=0;\n while(x%2==0){\n if(flag==0) prime_factors.add(2L);\n flag=1;\n x/=2;\n }\n for(long i=3;i*i<=x;i+=2){\n flag=0;\n while(x%i==0){\n if(flag==0) prime_factors.add(i);\n flag=1;\n x/=i;\n }\n }\n if(x>2) prime_factors.add(x);\n double ans=(double)n;\n for(Long p:prime_factors){\n ans*=(1.0-(Double)1.0/p);\n }\n return (long)ans;\n }\n\tstatic long modulo = (long)1e9+7;\n\tpublic static long modinv(long x){\n\t return modpow(x, modulo-2);\n\t}\n\tpublic static long modpow(long a, long b){\n\t if(b==0){\n\t return 1;\n\t }\n\t long x = modpow(a, b/2);\n\t x = (x*x)%modulo;\n\t if(b%2==1){\n\t return (x*a)%modulo;\n\t }\n\t return x;\n\t}\n\tpublic static class FastReader {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\t\t//it reads the data about the specified point and divide the data about it ,it is quite fast\n\t\t//than using direct \n\n\t\tpublic FastReader() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tString next() {\n\t\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (Exception r) {\n\t\t\t\t\tr.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());//converts string to integer\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tString nextLine() {\n\t\t\tString str = \"\";\n\t\t\ttry {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (Exception r) {\n\t\t\t\tr.printStackTrace();\n\t\t\t}\n\t\t\treturn str;\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "b93f1847d5df5e97fb1aa255eecf21ab", "src_uid": "e22a1fc38c8b2a4cc30ce3b9f893028e", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.util.*;\nimport java.math.*;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.InputStream;\n\npublic class Main{\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n AC solver = new AC();\n solver.solve(in, out);\n out.close();\n }\n}\n\nclass AC {\n int n , m;\n boolean judge(int x,int y) {\n return 1<=x && x <= n && 1 <= y && y <= m;\n }\n int x , y , dx , dy;\n long go() \n {\n int delta;\n if(dx < 0) {\n if(dy < 0) {\n delta = Math.min(x-1, y-1);\n } else {\n delta = Math.min(m-y, x-1);\n }\n } else {\n if(dy < 0) {\n delta = Math.min(n-x, y-1);\n } else {\n delta = Math.min(n-x,m-y);\n }\n }\n x += dx * delta;\n y += dy * delta;\n if(x+dx<1 || x+dx>n) dx *= -1;\n if(y+dy<1 || y+dy>m) dy *= -1;\n return (long)x*dx*1000000 + y*dy;\n }\n public void solve(InputReader in, PrintWriter out) {\n int x0 , y0;\n String cmd;\n HashSet<Long> mp = new HashSet<Long>();\n HashSet<Long> M = new HashSet<Long>();\n n = in.nextInt();\n m = in.nextInt();\n x0 = in.nextInt(); y0 = in.nextInt();\n cmd = in.next();\n int tot = n + m - 2;\n if(cmd.charAt(0)=='D') {\n dx = 1;\n } else dx = -1;\n if(cmd.charAt(1)=='R') {\n dy = 1;\n } else dy = -1;\n long ans = 1;\n x = x0 ; y = y0;\n if(x0==1 || x0==n || y0==1 || y0==m){\n M.add((long)x0*1000000+y0);\n tot --;\n }\n while(true) {\n long tmp = go();\n if(mp.contains(tmp)){\n ans = -1;\n break;\n } else {\n mp.add(tmp);\n }\n ans += Math.abs(x - x0);\n //out.println(x+\" \"+y);\n x0 = x ; y0 = y ;\n \n long flag = (long)x0*1000000+y0;\n if(!M.contains(flag)) {\n // out.println(tot);\n M.add(flag);\n if(--tot == 0) break;\n }\n }\n out.println(ans);\n }\n}\nclass InputReader {\n BufferedReader reader;\n StringTokenizer tokenizer;\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream));\n tokenizer = null;\n }\n\n public String next() {\n if (!hasNext())\n throw new RuntimeException();\n return tokenizer.nextToken();\n }\n\n boolean hasNext() {\n while (tokenizer == null || !tokenizer.hasMoreTokens())\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (Exception e) {\n return false;\n }\n return true;\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n public BigInteger nextBigInteger() {\n return new BigInteger(next());\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "implementation", "number theory"], "code_uid": "2b468cd84d76cf19e4351b0b80debf32", "src_uid": "8a59247013a9b1f34700f4bfc7d1831d", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.StringTokenizer;\n\n\npublic class First {\n public static void main(String[] args) throws IOException {\n BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n PrintWriter writer = new PrintWriter(System.out);\n StringTokenizer st = new StringTokenizer(reader.readLine());\n int n = Integer.parseInt(st.nextToken());\n int M = Integer.parseInt(st.nextToken());\n ArrayList<Integer> arrayList = new ArrayList<>();\n int time = 0;\n st = new StringTokenizer(reader.readLine());\n for(int i = 0; i < n; ++i){\n int nw = Integer.parseInt(st.nextToken());\n time += nw;\n int razn = time - M;\n int ind = arrayList.size()-1;\n int count = 0;\n while(razn > 0){\n razn -= arrayList.get(ind);\n --ind;\n ++count;\n }\n arrayList.add(nw);\n Collections.sort(arrayList);\n writer.print(count + \" \");\n }\n writer.close();\n }\n}", "lang_cluster": "Java", "tags": ["sortings", "greedy"], "code_uid": "a20e0d57f0718461bae66661b043e3e7", "src_uid": "d3c1dc3ed7af2b51b4c49c9b5052c346", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class ER82_D {\n\tprivate static final int N = 200001;\n\tprivate static final int MOD = 998244353;\n\t\n\tpublic static void main(String[] args) {\n\t\tint[] fact = new int[N];\n\t\tfact[0] = 1;\n\t\tfor (int i = 1; i < N; i++) {\n\t\t\tfact[i] = mul(fact[i-1], i);\n\t\t}\n\t\t\n\t\tScanner in = new Scanner(System.in);\n\t\tint n = in.nextInt();\n\t\tint m = in.nextInt();\n\t\t\n\t\tint ans = 0;\n\t\t\n\t\tif (n > 2) {\n\t\t\tans = mul(C(m, n-1, fact), mul(n - 2, binpow(2, n - 3)));\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\t\n\tprivate static int add(int x, int y) {\n\t\tx += y;\n\t\t\n\t\treturn x % MOD;\n\t\t\n\t}\n\t\n\tprivate static int mul(int x, int y) {\n\t\tint res = (int) (((long) x * y) % MOD);\n\t\treturn res;\n\t\t\n\t}\n\t\n\tprivate static int binpow(int x, int y) {\n\t\tint z = 1;\n\t\twhile (y > 0) {\n\t\t\tif (y % 2 != 0)\n\t\t\t\tz = mul(z, x);\n\t\t\tx = mul(x, x);\n\t\t\ty >>= 1;\n\t\t}\n\t\treturn z;\n\t}\n\t\n\tprivate static int inv(int x) {\n\t\treturn binpow(x, MOD - 2);\n\t}\n\t\n\tprivate static int devide(int x, int y) {\n\t\treturn mul(x, inv(y));\n\t}\n\t\n\tprivate static int C(int n, int k, int[] fact) {\n\t\treturn devide(fact[n], mul(fact[k], fact[n-k]));\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "combinatorics"], "code_uid": "f4267da3e7b75b35bb935ded28c8b2e0", "src_uid": "28d6fc8973a3e0076a21c2ea490dfdba", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.*;\nimport java.util.ArrayList;\n\n\npublic class B1033 {\n\n static ArrayList<Long> list;\n public static void main(String[] args)throws IOException {\n BufferedReader inp = new BufferedReader(new InputStreamReader(System.in));\n BufferedWriter out = new BufferedWriter(new OutputStreamWriter(System.out));\n\n list = sieveOfEratosthenes();\n //System.out.println(list);\n int testCase = Integer.parseInt(inp.readLine());\n for(int t=0;t<testCase;t++){\n String[] s1 = inp.readLine().split(\" \");\n long a = Long.parseLong(s1[0]);\n long b =Long.parseLong(s1[1]);\n\n long c = a+b;\n long d = a-b;\n\n //System.out.println(d);\n\n if(d!=1L){\n System.out.println(\"NO\");\n }\n else{\n\n if(isPrime(c)){\n System.out.println(\"YES\");\n }\n else{\n System.out.println(\"NO\");\n }\n\n }\n\n\n }\n\n\n }\n static ArrayList<Long> sieveOfEratosthenes() {\n int n = 1000000;\n ArrayList<Long> list = new ArrayList<>();\n boolean[] prime = new boolean[n];\n\n for(int p = 2; p*p <n; p++) {\n if(!prime[p]) {\n for(int i = p*p; i < n; i += p)\n prime[i] = true;\n }\n }\n\n for(int i = 2; i < n; i++) {\n if(!prime[i]) {\n list.add((long) i);\n }\n }\n return list;\n }\n static boolean isPrime(long a){\n int b = (int) Math.sqrt(a);\n //System.out.println(b);\n for(int i=0;i<list.size();i++){\n if(list.get(i)<=(long)b) {\n if (a % list.get(i) == 0) {\n return false;\n }\n }\n else{\n break;\n }\n }\n return true;\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "e3f0cf33c08ae5988e7c61731d3be757", "src_uid": "5a052e4e6c64333d94c83df890b1183c", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\npublic class first\n{\n\tpublic static void main(String[] args)throws IOException {\n\t\tBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\t\tPrintWriter pw=new PrintWriter(System.out);\n\t\tString s[]=br.readLine().split(\" \");\n\t\tlong n=Long.parseLong(s[0]);\n\t\tlong a=Long.parseLong(s[1]);\n\t\tlong b=Long.parseLong(s[2]);\n\t\tlong c=Long.parseLong(s[3]);\n\t\tlong min=Long.MAX_VALUE;\n\t\tif(n%4==0)\n\t\tmin=0;\n\t\telse if(n%4==1)\n\t\t{\n\t\t\tmin=Math.min(3*a,Math.min(a+b,c));\n\t\t}\n\t\telse if(n%4==2)\n\t\t{\n\t\t\tmin=Math.min(b,Math.min(2*a,2*c));\n\n\t\t}\n\t\telse\n\t\t{\n\t\t\tmin=Math.min(a,Math.min(b+c,3*c));\n\t\t}\n\n\t\tpw.println(min);\n\t\tpw.flush();\n\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "e9fe193b17eadb6d5b1a619ba1e2f48a", "src_uid": "c74537b7e2032c1d928717dfe15ccfb8", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.math.BigInteger;\nimport java.util.Scanner;\n\n\n\npublic class Main\n{\n static BigInteger fac[]=new BigInteger[1005];\n static BigInteger w[]=new BigInteger[6];\n static BigInteger get(int n,int m)\n {\n return fac[n].divide(fac[m]).divide(fac[n-m]);\n }\n public static void main(String[]args)\n {\n Scanner sc=new Scanner(System.in);\n int n=sc.nextInt();\n int k=sc.nextInt();\n fac[0]=BigInteger.ONE;\n for(int i=1;i<=n;i++)\n fac[i]=fac[i-1].multiply(BigInteger.valueOf(i));\n w[0]=BigInteger.ONE;\n w[1]=BigInteger.ZERO;\n w[2]=BigInteger.ONE;\n for(int i=3;i<=5;i++)\n w[i]=BigInteger.valueOf(i-1).multiply(w[i-1].add(w[i-2]));\n\n\n BigInteger ans=BigInteger.ZERO;\n for(int i=n-k;i<=n;i++)\n {\n ans=ans.add(get(n,i).multiply(w[n-i]));\n }\n System.out.println(ans);\n }\n}", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics"], "code_uid": "ff2b4c1a4e8986cb64d607824c1db28a", "src_uid": "96d839dc2d038f8ae95fc47c217b2e2f", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.lang.reflect.Array;\nimport java.util.Scanner;\nimport java.io.*;\nimport java.util.*;\nimport java.math.*;\nimport java.lang.*;\nimport static java.lang.Math.*;\npublic class main implements Runnable {\n\n static ArrayList<Integer> adj[];\n\n static void Check2(int n) {\n adj = new ArrayList[n + 1];\n for (int i = 0; i <= n; i++) {\n adj[i] = new ArrayList<>();\n }\n\n }\n static void add(int i, int j) {\n adj[i].add(j);\n adj[j].add(i);\n }\n\n\n public static void main(String[] args) {\n new Thread(null, new main(), \"Check2\", 1 << 26).start();// to increse stack size in java\n }\n static long mod = (long) (1e9 + 7);\n public void run() {\n /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */\n //Scanner in=new Scanner(System.in);\n\n InputReader in = new InputReader(System.in);\n PrintWriter w = new PrintWriter(System.out);\n\n\n\n char c[]=in.next().toCharArray();\n int max=10;\n\n for(int i=0;i<10;i++){\n\n for (int j=0;j<10;j++){\n for(int k=0;k<10;k++){\n\n for(int l=0;l<10;l++)\n {\n for(int m=0;m<10;m++){\n for(int n=0;n<10;n++){\n int co=0;\n\n if(i+j+k==l+m+n){\n if(i!=c[0]-48)co++;\n if(j!=c[1]-48)co++;\n if(k!=c[2]-48)co++;\n if(l!=c[3]-48)co++;\n if(m!=c[4]-48)co++;\n if(n!=c[5]-48)co++;\n max=min(max,co);\n }\n\n\n }\n }\n }\n\n }\n }\n\n\n\n }\n w.println(max);\n\n\n\n w.close();\n }\n\n static class cmp implements Comparator<pair>{\n\n public int compare(pair o1,pair o2)\n\n {\n\n\n if(o1.val!=o2.val)\n return o1.val<o2.val?-1:o1.val>o2.val?1:0;\n else\n return -(o1.type-o2.type);\n\n\n }\n\n }\n static class pair {\n long val;\n int type;\n pair(long a,int type){\n val=a;\n this.type=type;\n }\n }\n\n static long power(long x,long y){\n if(y==0)return 1%mod;\n if(y==1)return x%mod;\n\n\n long res=1;\n x=x%mod;\n while(y>0){\n\n\n if((y%2)!=0){\n res=(res*x)%mod;\n }\n\n\n y=y/2;\n x=(x*x)%mod;\n }\n\n\n return res;\n\n\n\n }\n\n\n static int gcd(int a,int b){\n\n if(b==0)return a;\n return gcd(b,a%b);\n }\n\n static void sev(int a[],int n){\n\n for(int i=2;i<=n;i++)a[i]=i;\n for(int i=2;i<=n;i++){\n\n if(a[i]!=0){\n for(int j=2*i;j<=n;){\n\n a[j]=0;\n j=j+i;\n }\n }\n\n }\n\n }\n\n\n\n static class node{\n\n int y;\n int val;\n\n node(int a,int b){\n\n y=a;\n val=b;\n\n }\n\n\n }\n\n static class InputReader\n {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private SpaceCharFilter filter;\n\n public InputReader(InputStream stream)\n {\n this.stream = stream;\n }\n\n public int read()\n {\n if (numChars==-1)\n throw new InputMismatchException();\n\n if (curChar >= numChars)\n {\n curChar = 0;\n try\n {\n numChars = stream.read(buf);\n }\n catch (IOException e)\n {\n throw new InputMismatchException();\n }\n\n if(numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public String nextLine()\n {\n BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n String str = \"\";\n try\n {\n str = br.readLine();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n return str;\n }\n public int nextInt()\n {\n int c = read();\n\n while(isSpaceChar(c))\n c = read();\n\n int sgn = 1;\n\n if (c == '-')\n {\n sgn = -1;\n c = read();\n }\n\n int res = 0;\n do\n {\n if(c<'0'||c>'9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n\n return res * sgn;\n }\n\n public long nextLong()\n {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-')\n {\n sgn = -1;\n c = read();\n }\n long res = 0;\n\n do\n {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public double nextDouble()\n {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-')\n {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.')\n {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.')\n {\n c = read();\n double m = 1;\n while (!isSpaceChar(c))\n {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n\n public String readString()\n {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do\n {\n res.appendCodePoint(c);\n c = read();\n }\n while (!isSpaceChar(c));\n\n return res.toString();\n }\n\n public boolean isSpaceChar(int c)\n {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public String next()\n {\n return readString();\n }\n\n public interface SpaceCharFilter\n {\n public boolean isSpaceChar(int ch);\n }\n }\n\n\n\n\n\n\n\n}", "lang_cluster": "Java", "tags": ["brute force", "greedy", "implementation"], "code_uid": "fefdd51bb0b6abd422933b06673413f4", "src_uid": "09601fd1742ffdc9f822950f1d3e8494", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.awt.List;\nimport java.io.*;\nimport java.lang.*;\nimport java.lang.reflect.Array;\npublic class c4 \n{\n\n\t\n\tpublic static int mod = (int)Math.pow(10, 9) + 7;\n public static int n;\n public static int m;\n public static int[][][] a;\n public static String[] st; \n public static void main(String[] args)\n {\n InputReader in = new InputReader(System.in);\n PrintWriter pw = new PrintWriter(System.out);\n\n // Code starts..\n\n \n \n long n = in.nextLong();\n int m = in.nextInt();\n long[] a = new long[m];\n \n for(int i=0; i<m; i++)\n \ta[i] = n/m;\n for(int i=1; i<=n%m; i++)\n \ta[i]++;\n \n \n \n long[] b = new long[m];\n for(int i=0; i<m; i++)\n {\n \tint t = ((i)%m * (i)%m)%m;\n \tb[t] += a[i];\n }\n long ans = 0;\n for(int i=0; i<m; i++)\n {\n \t\n \tif(i==0)\n \t{\n \t\tans += (b[i]*(b[i]));\n \t\t\n \t}\n \telse\n \t{\n \t\tans += b[i] * b[m-i];\n \t}\n \t\n }\n pw.println(ans);\n \n \n \n \n // code ends...\n\n pw.flush();\n pw.close();\n }\n \n \n\n public static void factSieve(int[] fact, long n) {\n\n for (int i = 2; i <= n; i += 2)\n fact[i] = 2;\n\n for (int i = 3; i <= n; i += 2) {\n if (fact[i] == 0) {\n fact[i] = i;\n\n for (int j = i; (long) j * i <= n; j++) {\n fact[(int) ((long) i * j)] = i;\n }\n }\n }\n\n /*\n * int k = 1000; while(k!=1) { System.out.print(a[k]+\" \"); k /= a[k];\n * \n * }\n */\n }\n\n \n public static int gcd(int p2, int p22) {\n if (p2 == 0)\n return (int) p22;\n return gcd(p22 % p2, p2);\n }\n\n public static void nextGreater(long[] a, int[] ans) {\n\n Stack<Integer> stk = new Stack<>();\n stk.push(0);\n\n for (int i = 1; i < a.length; i++) {\n\n if (!stk.isEmpty()) {\n int s = stk.pop();\n while (a[s] < a[i]) {\n ans[s] = i;\n if (!stk.isEmpty())\n s = stk.pop();\n else\n break;\n }\n if (a[s] >= a[i])\n stk.push(s);\n }\n\n stk.push(i);\n\n }\n return;\n\n }\n\n public static void nextGreaterRev(long[] a, int[] ans) {\n\n int n = a.length;\n int[] pans = new int[n];\n Arrays.fill(pans, -1);\n long[] arev = new long[n];\n for (int i = 0; i < n; i++)\n arev[i] = a[n - 1 - i];\n\n Stack<Integer> stk = new Stack<>();\n stk.push(0);\n\n for (int i = 1; i < n; i++) {\n\n if (!stk.isEmpty()) {\n int s = stk.pop();\n while (arev[s] < arev[i]) {\n pans[s] = n - i - 1;\n if (!stk.isEmpty())\n s = stk.pop();\n else\n break;\n }\n if (arev[s] >= arev[i])\n stk.push(s);\n }\n\n stk.push(i);\n\n }\n\n // for(int i=0; i<n; i++)\n // System.out.print(pans[i]+\" \");\n\n for (int i = 0; i < n; i++)\n ans[i] = pans[n - i - 1];\n\n return;\n\n }\n\n public static void nextSmaller(long[] a, int[] ans) {\n\n Stack<Integer> stk = new Stack<>();\n stk.push(0);\n\n for (int i = 1; i < a.length; i++) {\n\n if (!stk.isEmpty()) {\n int s = stk.pop();\n while (a[s] > a[i]) {\n ans[s] = i;\n if (!stk.isEmpty())\n s = stk.pop();\n else\n break;\n }\n if (a[s] <= a[i])\n stk.push(s);\n }\n\n stk.push(i);\n\n }\n return;\n\n }\n\n public static long lcm(int[] numbers) {\n long lcm = 1;\n int divisor = 2;\n while (true) {\n int cnt = 0;\n boolean divisible = false;\n for (int i = 0; i < numbers.length; i++) {\n if (numbers[i] == 0) {\n return 0;\n } else if (numbers[i] < 0) {\n numbers[i] = numbers[i] * (-1);\n }\n if (numbers[i] == 1) {\n cnt++;\n }\n if (numbers[i] % divisor == 0) {\n divisible = true;\n numbers[i] = numbers[i] / divisor;\n }\n }\n if (divisible) {\n lcm = lcm * divisor;\n } else {\n divisor++;\n }\n if (cnt == numbers.length) {\n return lcm;\n }\n }\n }\n\n public static long fact(long n) {\n\n long factorial = 1;\n for (int i = 1; i <= n; i++) {\n factorial *= i;\n }\n return factorial;\n }\n\n\n public static long choose(long total, long choose) {\n if (total < choose)\n return 0;\n if (choose == 0 || choose == total)\n return 1;\n return (choose(total - 1, choose - 1) + choose(total - 1, choose)) % mod;\n }\n\n public static int[] suffle(int[] a, Random gen) {\n int n = a.length;\n for (int i = 0; i < n; i++) {\n int ind = gen.nextInt(n - i) + i;\n int temp = a[ind];\n a[ind] = a[i];\n a[i] = temp;\n }\n return a;\n }\n\n public static int[] sufflesort(int[] a) {\n int n = a.length;\n Random gen = new Random();\n for (int i = 0; i < n; i++) {\n int ind = gen.nextInt(n - i) + i;\n int temp = a[ind];\n a[ind] = a[i];\n a[i] = temp;\n }\n Arrays.sort(a);\n return a;\n }\n \n \n \n \n public static int floorSearch(int arr[], int low, int high, int x) {\n if (low > high)\n return -1;\n\n if (x > arr[high])\n return high;\n int mid = (low + high) / 2;\n\n if (mid > 0 && arr[mid - 1] < x && x < arr[mid])\n return mid - 1;\n\n if (x < arr[mid])\n return floorSearch(arr, low, mid - 1, x);\n\n return floorSearch(arr, mid + 1, high, x);\n }\n\n public static void swap(int a, int b) {\n int temp = a;\n a = b;\n b = temp;\n }\n\n public static ArrayList<Integer> primeFactorization(int n) {\n ArrayList<Integer> a = new ArrayList<Integer>();\n for (int i = 2; i * i <= n; i++) {\n while (n % i == 0) {\n a.add(i);\n n /= i;\n }\n }\n if (n != 1)\n a.add(n);\n return a;\n }\n \n \n \n\n public static void sieve(boolean[] isPrime, int n) {\n for (int i = 1; i < n; i++)\n isPrime[i] = true;\n\n isPrime[0] = false;\n isPrime[1] = false;\n\n for (int i = 2; i * i < n; i++) {\n if (isPrime[i] == true) {\n for (int j = (2 * i); j < n; j += i)\n isPrime[j] = false;\n }\n }\n }\n\n public static int lowerbound(ArrayList<Long> net, long c2) {\n int i = Collections.binarySearch(net, c2);\n if (i < 0)\n i = -(i + 2);\n return i;\n\n }\n \n public static int lowerboundArray(int[] dis, int c2) {\n int i = Arrays.binarySearch(dis, c2);\n if (i < 0)\n i = -(i + 2);\n return i;\n\n }\n\n public static int uperbound(ArrayList<Integer> list, int c2) {\n int i = Collections.binarySearch(list, c2);\n if (i < 0)\n i = -(i + 1);\n return i;\n\n }\n\n public static int uperboundArray(int[] dis, int c2) {\n int i = Arrays.binarySearch(dis, c2);\n if (i < 0)\n i = -(i + 1);\n return i;\n\n }\n\n \n public static int GCD(int a, int b) {\n if (b == 0)\n return a;\n else\n return GCD(b, a % b);\n }\n\n public static long GCD(long a, long b) {\n if (b == 0)\n return a;\n else\n return GCD(b, a % b);\n }\n\n public static int d1;\n public static int p1;\n public static int q1;\n \n public static void extendedEuclid(int A, int B) {\n if (B == 0) {\n d1 = A;\n p1 = 1;\n q1 = 0;\n } else {\n extendedEuclid(B, A % B);\n int temp = p1;\n p1 = q1;\n q1 = temp - (A / B) * q1;\n }\n }\n\n public static long LCM(long a, long b) {\n return (a * b) / GCD(a, b);\n }\n\n public static int LCM(int a, int b) {\n return (a * b) / GCD(a, b);\n }\n\n public static int binaryExponentiation(int x, int n) {\n int result = 1;\n while (n > 0) {\n if (n % 2 == 1)\n result = result * x;\n x = x * x;\n n = n / 2;\n }\n return result;\n }\n\n public static int[] countDer(int n) {\n int der[] = new int[n + 1];\n\n der[0] = 1;\n der[1] = 0;\n der[2] = 1;\n\n for (int i = 3; i <= n; ++i)\n der[i] = (i - 1) * (der[i - 1] + der[i - 2]);\n\n // Return result for n\n return der;\n }\n\n static long binomialCoeff(int n, int k) {\n long C[][] = new long[n + 1][k + 1];\n int i, j;\n\n // Calculate value of Binomial Coefficient in bottom up manner\n for (i = 0; i <= n; i++) {\n for (j = 0; j <= Math.min(i, k); j++) {\n // Base Cases\n if (j == 0 || j == i)\n C[i][j] = 1;\n\n // Calculate value using previosly stored values\n else\n C[i][j] = C[i - 1][j - 1] + C[i - 1][j];\n }\n }\n\n return C[n][k];\n }\n\n public static long binaryExponentiation(long x, long n) {\n long result = 1;\n while (n > 0) {\n if (n % 2 == 1)\n result = result * x;\n x = (x % mod * x % mod) % mod;\n n = n / 2;\n }\n return result;\n }\n\n public static int modularExponentiation(int x, int n, int M) {\n int result = 1;\n while (n > 0) {\n if (n % 2 == 1)\n result = (result * x) % M;\n x = (x * x) % M;\n n = n / 2;\n }\n return result;\n }\n\n public static long modularExponentiation(long x, long n, long M) {\n long result = 1;\n while (n > 0) {\n if (n % 2 == 1)\n result = (result * x) % M;\n x = (x * x) % M;\n n = n / 2;\n }\n return result;\n }\n\n public static int modInverse(int A, int M) {\n return modularExponentiation(A, M - 2, M);\n }\n\n public static long sie(long A, long M) {\n return modularExponentiation(A, M - 2, M);\n }\n\n public static boolean isPrime(int n) {\n\n if (n <= 1)\n return false;\n if (n <= 3)\n return true;\n\n if (n % 2 == 0 || n % 3 == 0)\n return false;\n\n for (int i = 5; i * i <= n; i = i + 6) {\n if (n % i == 0 || n % (i + 2) == 0)\n return false;\n }\n\n return true;\n }\n\n static class pair implements Comparable<pair>\n\n {\n Integer x, y;\n\n pair(int x, int y) {\n this.x = x;\n this.y = y;\n }\n\n public int compareTo(pair o) {\n int result = x.compareTo(o.x);\n if (result == 0)\n result = y.compareTo(o.y);\n\n return result;\n }\n\n public String toString() {\n return x + \" \" + y;\n }\n\n public boolean equals(Object o) {\n if (o instanceof pair) {\n pair p = (pair) o;\n return p.x == x && p.y == y;\n }\n return false;\n }\n\n public int hashCode() {\n return new Long(x).hashCode() * 31 + new Long(y).hashCode();\n }\n\n }\n\n static class triplet implements Comparable<triplet> {\n Integer x, y, z;\n\n triplet(int x, int y, int z) {\n this.x = x;\n this.y = y;\n this.z = z;\n }\n\n public int compareTo(triplet o) {\n int result = x.compareTo(o.x);\n if (result == 0)\n result = y.compareTo(o.y);\n if (result == 0)\n result = z.compareTo(o.z);\n\n return result;\n }\n\n public boolean equlas(Object o) {\n if (o instanceof triplet) {\n triplet p = (triplet) o;\n return x == p.x && y == p.y && z == p.z;\n }\n return false;\n }\n\n public String toString() {\n return x + \" \" + y + \" \" + z;\n }\n\n public int hashCode() {\n return new Long(x).hashCode() * 31 + new Long(y).hashCode() + new Long(z).hashCode();\n }\n }\n\n \n \n \n \n \n /*\n * static class node implements Comparable<node>\n * \n * { Integer x, y, z; node(int x,int y, int z) { this.x=x; this.y=y; this.z=z; }\n * \n * public int compareTo(pair o) { int result = x.compareTo(o.x); if(result==0)\n * result = y.compareTo(o.y); if(result==0) result = z.compareTo(z); return\n * result; }\n * \n * @Override public int compareTo(node o) { // TODO Auto-generated method stub\n * return 0; } }\n */\n\n\n\n static class InputReader \n\t{\n\t\t \n\t\tprivate final InputStream stream;\n\t\tprivate final byte[] buf = new byte[8192];\n\t\tprivate int curChar, snumChars;\n\t\tprivate SpaceCharFilter filter;\n \n\t\tpublic InputReader(InputStream stream) \n\t\t{\n\t\t\tthis.stream = stream;\n\t\t}\n \n\t\tpublic int snext() \n\t\t{\n\t\t\tif (snumChars == -1)\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tif (curChar >= snumChars) \n\t\t\t{\n\t\t\t\tcurChar = 0;\n\t\t\t\ttry \n\t\t\t\t{\n\t\t\t\t\tsnumChars = stream.read(buf);\n\t\t\t\t} \n\t\t\t\tcatch (IOException e) \n\t\t\t\t{\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (snumChars <= 0)\n\t\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn buf[curChar++];\n\t\t}\n \n\t\tpublic int nextInt() \n\t {\n\t\t\tint c = snext();\n\t\t\twhile (isSpaceChar(c)) \n\t\t\t{\n\t\t\t\tc = snext();\n\t\t\t}\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-')\n\t\t {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = snext();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo \n\t\t\t{\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = snext();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res * sgn;\n\t\t}\n \n\t\tpublic long nextLong()\n\t {\n\t\t\tint c = snext();\n\t\t\twhile (isSpaceChar(c)) \n\t\t\t{\n\t\t\t\tc = snext();\n\t\t\t}\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-') \n\t\t\t{\n\t\t\t\tsgn = -1;\n\t\t\t\tc = snext();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo \n\t\t\t{\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = snext();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res * sgn;\n\t\t}\n \n\t\tpublic int[] nextIntArray(int n) \n\t\t{\n\t\t\tint a[] = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) \n\t\t\t{\n\t\t\t\ta[i] = nextInt();\n\t\t\t}\n\t\t\treturn a;\n\t\t}\n \n\t\tpublic String readString()\n\t {\n\t\t\tint c = snext();\n\t\t\twhile (isSpaceChar(c)) \n\t\t\t{\n\t\t\t\tc = snext();\n\t\t\t}\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo \n\t\t\t{\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = snext();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res.toString();\n\t\t}\n \n\t\tpublic String nextLine() \n\t\t{\n\t\t\tint c = snext();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = snext();\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo \n\t\t\t{\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = snext();\n\t\t\t} while (!isEndOfLine(c));\n\t\t\treturn res.toString();\n\t\t}\n \n\t\tpublic boolean isSpaceChar(int c) \n\t\t{\n\t\t\tif (filter != null)\n\t\t\t\treturn filter.isSpaceChar(c);\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n \n\t\tprivate boolean isEndOfLine(int c) \n\t\t{\n\t\t\treturn c == '\\n' || c == '\\r' || c == -1;\n\t\t}\n \n\t\tpublic interface SpaceCharFilter\n\t {\n\t\t\tpublic boolean isSpaceChar(int ch);\n\t\t}\n\t}\n\t\n\t\n\n\n\n}\n\n", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "9edead834db38c470d982b503582fb0f", "src_uid": "2ec9e7cddc634d7830575e14363a4657", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.DataInputStream;\nimport java.io.FileInputStream;\nimport java.io.IOException;\nimport java.io.PrintWriter;\nimport java.util.HashSet;\n\n@SuppressWarnings(\"Duplicates\")\npublic class ProblemC {\n\n public static void main(String[] args) throws IOException{\n Reader sc = new Reader();\n PrintWriter pw = new PrintWriter(System.out);\n //Scanner sc = new Scanner(System.in);\n //BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n long n1 = sc.nextInt();\n long n2 = sc.nextInt();\n if (n1 == 1 || n2 == 1 || n1 == n2){\n pw.println(0);\n } else {\n long aux = Math.min(n1,n2);\n n2 = Math.max(n1,n2);\n n1 = aux;\n // n1 < n2\n aux = n2-n1;\n long sol = 0;\n long min = n1*n2;\n HashSet<Long> set = new HashSet<>();\n for (long i = 1; i <= (long)Math.ceil(Math.sqrt(aux)); i++) {\n if (aux%i==0){\n set.add(i);\n set.add(aux/i);\n }\n }\n for (Long divs : set) {\n long rest = n1%divs;\n long x = (divs-rest)%divs;\n long res = (n1+x)*(n2+x)/divs;\n if (res < min || (res == min && x < sol)){\n sol = x;\n min = res;\n }\n }\n pw.println(sol);\n }\n\n\n pw.flush();\n }\n\n\n static class Reader\n {\n final private int BUFFER_SIZE = 1 << 16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n\n public Reader()\n {\n din = new DataInputStream(System.in);\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public Reader(String file_name) throws IOException\n {\n din = new DataInputStream(new FileInputStream(file_name));\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public String readLine() throws IOException\n {\n byte[] buf = new byte[64]; // line length\n int cnt = 0, c;\n while ((c = read()) != -1)\n {\n if (c == '\\n')\n break;\n buf[cnt++] = (byte) c;\n }\n return new String(buf, 0, cnt);\n }\n\n public int nextInt() throws IOException\n {\n int ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do\n {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n\n if (neg)\n return -ret;\n return ret;\n }\n\n public long nextLong() throws IOException\n {\n long ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n if (neg)\n return -ret;\n return ret;\n }\n\n public double nextDouble() throws IOException\n {\n double ret = 0, div = 1;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n\n if (c == '.')\n {\n while ((c = read()) >= '0' && c <= '9')\n {\n ret += (c - '0') / (div *= 10);\n }\n }\n\n if (neg)\n return -ret;\n return ret;\n }\n\n private void fillBuffer() throws IOException\n {\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1)\n buffer[0] = -1;\n }\n\n private byte read() throws IOException\n {\n if (bufferPointer == bytesRead)\n fillBuffer();\n return buffer[bufferPointer++];\n }\n\n public void close() throws IOException\n {\n if (din == null)\n return;\n din.close();\n }\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "number theory"], "code_uid": "d48b08045aba3fac4b563d0892f845c9", "src_uid": "414149fadebe25ab6097fc67663177c3", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.lang.reflect.Array;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.*;\n\npublic class Main {\n public static void main(String[] args){\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n solve(in, out);\n out.close();\n }\n\n static String reverse(String s) {\n return (new StringBuilder(s)).reverse().toString();\n }\n\n static void sieveOfEratosthenes(int n, int factors[], ArrayList<Integer> ar) \n { \n factors[1]=1;\n int p;\n for(p = 2; p*p <=n; p++) \n { \n if(factors[p] == 0) \n { \n ar.add(p);\n factors[p]=p;\n for(int i = p*p; i <= n; i += p) \n if(factors[i]==0)\n factors[i] = p; \n } \n } \n for(;p<=n;p++){\n if(factors[p] == 0) \n { \n factors[p] = p;\n ar.add(p);\n } \n }\n }\n\n static void sort(int ar[]) {\n int n = ar.length;\n ArrayList<Integer> a = new ArrayList<>();\n for (int i = 0; i < n; i++)\n a.add(ar[i]);\n Collections.sort(a);\n for (int i = 0; i < n; i++)\n ar[i] = a.get(i);\n }\n\n static void sort1(long ar[]) {\n int n = ar.length;\n ArrayList<Long> a = new ArrayList<>();\n for (int i = 0; i < n; i++)\n a.add(ar[i]);\n Collections.sort(a);\n for (int i = 0; i < n; i++)\n ar[i] = a.get(i);\n }\n\n static void sort2(char ar[]) {\n int n = ar.length;\n ArrayList<Character> a = new ArrayList<>();\n for (int i = 0; i < n; i++)\n a.add(ar[i]);\n Collections.sort(a);\n for (int i = 0; i < n; i++)\n ar[i] = a.get(i);\n }\n\n static long ncr(long n, long r, long mod) {\n if (r == 0)\n return 1;\n long val = ncr(n - 1, r - 1, mod);\n val = (n * val) % mod;\n val = (val * modInverse(r, mod)) % mod;\n return val;\n }\n\n static long max[];\n static long lz[];\n \n // static void build(long a[], int v, int tl, int tr) {\n // if (tl == tr) {\n // max[v] = a[tl];\n \n // } else {\n // int tm = (tl + tr) / 2;\n // build(a, v*2, tl, tm);\n // build(a, v*2+1, tm+1, tr);\n // max[v] = max[v*2] + max[v*2+1];\n // }\n // }\n\n // static void push(int v, int tl, int tr){\n // if(tl==tr){\n // lz[v] = 0;\n // return;\n // }\n // max[2*v] += lz[v];\n // // max[2*v] %= m;\n // max[2*v+1] += lz[v];\n // // max[2*v+1] %= m;\n // lz[2*v] += lz[v];\n // lz[2*v] %= m;\n // lz[2*v+1] += lz[v];\n // lz[2*v+1] %= m;\n // lz[v] = 0;\n // }\n\n static void update(int v, int tl, int tr, int l, int r, long val) {\n if(tl>r||tr<l)\n return;\n if(tl>=l&&tr<=r){\n max[v] = Math.max(val, max[v]);\n return;\n }\n int tm = ((tl + tr) >> 1);\n update(v*2, tl, tm, l, r, val);\n update(v*2+1, tm+1, tr, l, r, val);\n max[v] = Math.max(max[2*v],max[2*v+1]);\n }\n\n static long get(int v, int tl, int tr, int l, int r) {\n if(l>tr||r<tl)\n return 0;\n if (tl >= l && tr <= r) {\n return max[v];\n }\n int tm = ((tl + tr) >> 1);\n return Math.max(get(2*v, tl, tm, l, r), get(2*v+1, tm+1, tr, l, r));\n }\n\n // static int y = 0;\n\n static int parent[];\n static int rank[];\n\n static long m = 0;\n\n static int find_set(int v) {\n if (v == parent[v])\n return v;\n return find_set(parent[v]);\n }\n \n static void make_set(int v) {\n parent[v] = v;\n rank[v] = 1;\n }\n \n static void union_sets(int a, int b) {\n a = find_set(a);\n b = find_set(b);\n if (a != b) {\n if (rank[a] < rank[b]){\n int tmp = a;\n a = b;\n b = tmp;\n }\n parent[b] = a;\n // if (rank[a] == rank[b])\n // rank[a]++;\n rank[a] += rank[b];\n max1 = Math.max(max1,rank[a]);\n // System.out.println(a+\" \"+b+\" \"+rank[a]+\" \"+rank[b]);\n }\n }\n\n static int parent1[];\n static int rank1[];\n\n static int find_set1(int v) {\n if (v == parent1[v])\n return v;\n return find_set1(parent1[v]);\n }\n \n static void make_set1(int v) {\n parent1[v] = v;\n rank1[v] = 1;\n }\n \n static void union_sets1(int a, int b) {\n a = find_set1(a);\n b = find_set1(b);\n if (a != b) {\n if (rank1[a] < rank1[b]){\n int tmp = a;\n a = b;\n b = tmp;\n }\n parent1[b] = a;\n // if (rank1[a] == rank1[b])\n // rank1[a]++;\n rank1[a] += rank1[b];\n }\n }\n\n static long max1 = 0;\n\n static int count = 0;\n static int count1 = 0;\n\n public static void solve(InputReader sc, PrintWriter pw){\n int i, j = 0;\n int t = 1; \n long mod = 998244353;\n // int factors[] = new int[1000001];\n // ArrayList<Integer> ar = new ArrayList<>();\n // sieveOfEratosthenes(1000000, factors, ar);\n // HashSet<Integer> set = new HashSet<>();\n // for(int x:ar){\n // set.add(x);\n // }\n // int t = sc.nextInt();\n u: while (t-- > 0) {\n long x = sc.nextLong();\n long y = sc.nextLong();\n if(x==y){\n pw.println(\"YES\");\n continue u;\n }\n long tx = 2*x+1;\n while(x%2==0){\n x /= 2;\n }\n char ch1[] = Long.toBinaryString(x).toCharArray();\n char ch2[] = Long.toBinaryString(y).toCharArray();\n x:for(i=0;i<ch2.length;i++){\n for(j=0;j<i;j++){\n if(ch2[j]=='0')\n continue x;\n }\n for(j=0;j<ch1.length;j++){\n if(i+j>=ch2.length)\n continue x;\n if(ch2[i+j]!=ch1[j])\n continue x;\n }\n for(j=i+ch1.length;j<ch2.length;j++){\n if(ch2[j]=='0')\n continue x;\n }\n pw.println(\"YES\");\n continue u;\n }\n for(i=0;i<ch2.length/2;i++){\n char temp = ch2[i];\n ch2[i] = ch2[ch2.length-1-i];\n ch2[ch2.length-1-i] = temp;\n }\n x:for(i=0;i<ch2.length;i++){\n for(j=0;j<i;j++){\n if(ch2[j]=='0')\n continue x;\n }\n for(j=0;j<ch1.length;j++){\n if(i+j>=ch2.length)\n continue x;\n if(ch2[i+j]!=ch1[j])\n continue x;\n }\n for(j=i+ch1.length;j<ch2.length;j++){\n if(ch2[j]=='0')\n continue x;\n }\n pw.println(\"YES\");\n continue u;\n }\n x = tx;\n ch1 = Long.toBinaryString(x).toCharArray();\n ch2 = Long.toBinaryString(y).toCharArray();\n x:for(i=0;i<ch2.length;i++){\n for(j=0;j<i;j++){\n if(ch2[j]=='0')\n continue x;\n }\n for(j=0;j<ch1.length;j++){\n if(i+j>=ch2.length)\n continue x;\n if(ch2[i+j]!=ch1[j])\n continue x;\n }\n for(j=i+ch1.length;j<ch2.length;j++){\n if(ch2[j]=='0')\n continue x;\n }\n pw.println(\"YES\");\n continue u;\n }\n for(i=0;i<ch2.length/2;i++){\n char temp = ch2[i];\n ch2[i] = ch2[ch2.length-1-i];\n ch2[ch2.length-1-i] = temp;\n }\n x:for(i=0;i<ch2.length;i++){\n for(j=0;j<i;j++){\n if(ch2[j]=='0')\n continue x;\n }\n for(j=0;j<ch1.length;j++){\n if(i+j>=ch2.length)\n continue x;\n if(ch2[i+j]!=ch1[j])\n continue x;\n }\n for(j=i+ch1.length;j<ch2.length;j++){\n if(ch2[j]=='0')\n continue x;\n }\n pw.println(\"YES\");\n continue u;\n }\n pw.println(\"NO\");\n }\n }\n\n static void KMPSearch(char pat[], char txt[], int pres[]){\n int M = pat.length;\n int N = txt.length;\n int lps[] = new int[M];\n int j = 0; \n computeLPSArray(pat, M, lps);\n int i = 0;\n while (i < N) {\n if (pat[j] == txt[i]) {\n j++;\n i++;\n }\n if (j == M) {\n pres[i-1] = 1;\n j = lps[j - 1];\n }\n else if (i < N && pat[j] != txt[i]) {\n if (j != 0)\n j = lps[j - 1];\n else\n i = i + 1;\n }\n }\n }\n \n static void computeLPSArray(char pat[], int M, int lps[])\n {\n int len = 0;\n int i = 1;\n lps[0] = 0; \n while (i < M) {\n if (pat[i] == pat[len]) {\n len++;\n lps[i] = len;\n i++;\n }\n else \n {\n if (len != 0) {\n len = lps[len - 1];\n }\n else\n {\n lps[i] = len;\n i++;\n }\n }\n }\n }\n\n static long[][] matrixMult(long a[][], long b[][], long mod){\n int n = a.length;\n int m = a[0].length;\n int p = b[0].length;\n long c[][] = new long[n][p];\n for(int i=0;i<n;i++){\n for(int j=0;j<m;j++){\n for(int k=0;k<p;k++){\n c[i][k] += a[i][j]*b[j][k];\n c[i][k] %= mod;\n }\n }\n }\n return c;\n }\n\n static long[][] exp(long mat[][], long b, long mod){\n if(b==0){\n int n = mat.length;\n long res[][] = new long[n][n];\n for(int i=0;i<n;i++){\n res[i][i] = 1;\n }\n return res;\n }\n long half[][] = exp(mat, b/2, mod);\n long res[][] = matrixMult(half, half, mod);\n if(b%2==1){\n res = matrixMult(res, mat, mod);\n }\n return res;\n }\n\n static void countPrimeFactors(int num, int a[], HashMap<Integer,Integer> pos){\n for(int i=2;i*i<num;i++){\n if(num%i==0){\n int y = pos.get(i);\n while(num%i==0){\n a[y]++;\n num/=i;\n }\n }\n }\n if(num>1){\n int y = pos.get(num);\n a[y]++;\n }\n }\n\n static void assignAnc(ArrayList<Integer> ar[], int depth[], int sz[], int par[][] ,int curr, int parent, int d){\n depth[curr] = d;\n sz[curr] = 1;\n par[curr][0] = parent;\n for(int v:ar[curr]){\n if(parent==v)\n continue;\n assignAnc(ar, depth, sz, par, v, curr, d+1);\n sz[curr] += sz[v];\n }\n }\n\n static int findLCA(int a, int b, int par[][], int depth[]){\n if(depth[a]>depth[b]){\n a = a^b;\n b = a^b;\n a = a^b;\n }\n int diff = depth[b] - depth[a];\n for(int i=19;i>=0;i--){\n if((diff&(1<<i))>0){\n b = par[b][i];\n }\n }\n if(a==b)\n return a;\n for(int i=19;i>=0;i--){\n if(par[b][i]!=par[a][i]){\n b = par[b][i];\n a = par[a][i];\n }\n }\n return par[a][0];\n }\n\n static void formArrayForBinaryLifting(int n, int par[][]){\n for(int j=1;j<20;j++){\n for(int i=0;i<n;i++){\n if(par[i][j-1]==-1)\n continue;\n par[i][j] = par[par[i][j-1]][j-1];\n }\n }\n }\n\n static long lcm(int a, int b){\n return a*b/gcd(a,b);\n }\n\n static class Pair1 {\n long a;\n long b;\n \n Pair1(long a, long b) {\n this.a = a;\n this.b = b;\n }\n }\n\n static class Pair implements Comparable<Pair> {\n int a;\n int b;\n // int c;\n \n Pair(int a, int b) {\n this.a = a;\n this.b = b;\n // this.c = c;\n }\n \n public int compareTo(Pair p) {\n if(a!=p.a)\n return p.a-a;\n return b-p.b;\n }\n }\n\n static class Pair2 implements Comparable<Pair2> {\n int a;\n int b;\n int c;\n \n Pair2(int a, int b, int c) {\n this.a = a;\n this.b = b;\n this.c = c;\n }\n \n public int compareTo(Pair2 p) {\n return a-p.a;\n }\n }\n\n static boolean isPrime(int n) { \n if (n <= 1) \n return false; \n if (n <= 3) \n return true; \n if (n % 2 == 0 || n % 3 == 0) \n return false; \n for (int i = 5; i * i <= n; i = i + 6) \n if (n % i == 0 || n % (i + 2) == 0) \n return false; \n return true; \n } \n\n static long gcd(long a, long b) {\n if (b == 0)\n return a;\n return gcd(b, a % b);\n }\n\n static long fast_pow(long base, long n, long M) {\n if (n == 0)\n return 1;\n if (n == 1)\n return base % M;\n long halfn = fast_pow(base, n / 2, M);\n if (n % 2 == 0)\n return (halfn * halfn) % M;\n else\n return (((halfn * halfn) % M) * base) % M;\n }\n\n static long modInverse(long n, long M) {\n return fast_pow(n, M - 2, M);\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 9992768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n }\n}", "lang_cluster": "Java", "tags": ["dfs and similar", "constructive algorithms", "math", "bitmasks", "strings", "implementation"], "code_uid": "15e209f57e5d4c3a1bfeae822a6304ec", "src_uid": "9f39a3c160087beb0efab2e3cb510e89", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n\npublic class MainA {\n\n\n public static void main(String[] args) throws IOException {\n new MainA().solve();\n }\n\n PrintWriter out;\n boolean[] u;\n ArrayList<Integer>[] g;\n int cnt = 0;\n int ind = 0;\n int n;\n int[] a = new int[1000000];\n long MOD = 1000000007;\n\n void solve() throws IOException{\n Reader in = new Reader(\"input.txt\");\n out = new PrintWriter( new BufferedWriter(new OutputStreamWriter(System.out)) );\n//\t\tout = new PrintWriter(new FileWriter(new File(\"output.txt\"))); \n\n //int n = in.nextInt();\n\n int[] r = new int[2000011];\n\n int qq = in.nextInt();\n int pp = in.nextInt();\n\n\n r[1] = 1;\n\n for (int i = 2; i <= 2000000; i++) {\n r[i] = r[i-1];\n String s = \"\"+i;\n int ll = 0;\n int rr = s.length()-1;\n\n boolean ok = true;\n\n while (ll < rr) {\n if (s.charAt(ll) != s.charAt(rr))\n ok = false;\n ll++;\n rr--;\n }\n\n if (ok) {\n r[i]++;\n //System.out.println(s);\n }\n }\n\n\n\n int[] p = new int[2000010];\n\n for (int i = 2; i <= Math.sqrt(2000010); i++)\n if (p[i] == 0)\n for (int j = i+i; j <= 2000000; j+=i)\n p[j] = 1;\n\n int[] pi = new int[2000010];\n pi[1] = 0;\n\n for (int i = 2; i <= 2000000; i++) {\n pi[i] = pi[i-1];\n if (p[i] == 0) {\n pi[i]++;\n //System.out.println(i);\n }\n }\n\n int k = 0;\n\n //System.out.println(pi[109]+\" \"+r[109]);\n\n //System.out.println(r[1000]);\n\n for (int i = 0; i <= 2000000; i++) {\n if (pi[i]*pp <= r[i]*qq)\n k = i;\n }\n\n //System.out.println(pi[k+1]);\n\n System.out.println(k);\n\n out.flush();\n out.close();\n }\n\n static class Pair implements Comparable<Pair> {\n\n int a;\n int b;\n\n public Pair( int a, int b) {\n this.a = a;\n this.b = b;\n }\n\n @Override\n public int compareTo(Pair o) {\n\n if (o.a > a) return -1;\n if (o.a < a) return 1;\n if (o.b < b) return 1;\n if (o.b > b) return -1;\n return 0;\n }\n }\n\n class Reader {\n\n StringTokenizer token;\n BufferedReader in;\n\n public Reader(String file) throws IOException {\n//\t in = new BufferedReader( new FileReader( file ) );\n in = new BufferedReader( new InputStreamReader( System.in ) );\n }\n\n public byte nextByte() throws IOException {\n return Byte.parseByte(Next());\n }\n\n public int nextInt() throws IOException {\n return Integer.parseInt(Next());\n }\n\n public long nextLong() throws IOException {\n return Long.parseLong(Next());\n }\n\n public double nextDouble() throws IOException {\n return Double.parseDouble(Next());\n }\n\n public String nextString() throws IOException {\n return in.readLine();\n }\n\n private String Next() throws IOException {\n while (token == null || !token.hasMoreTokens()) {\n token = new StringTokenizer(in.readLine());\n }\n return token.nextToken();\n }\n\n\n }\n\n\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "binary search", "number theory"], "code_uid": "4f4e05d262909b0adbb4362c940b7ca5", "src_uid": "e6e760164882b9e194a17663625be27d", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.lang.reflect.Constructor;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\n\npublic class CodeJ\n{\n\tstatic class Scanner\n\t{\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st = new StringTokenizer(\"\");\n\t\t\n\t\tpublic String nextLine()\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\treturn br.readLine();\n\t\t\t}\n\t\t\tcatch(Exception e)\n\t\t\t{\n\t\t\t\tthrow(new RuntimeException());\n\t\t\t}\n\t\t}\n\t\t\n\t\tpublic String next()\n\t\t{\n\t\t\twhile(!st.hasMoreTokens())\n\t\t\t{\n\t\t\t\tString l = nextLine();\n\t\t\t\tif(l == null)\n\t\t\t\t\treturn null;\n\t\t\t\tst = new StringTokenizer(l);\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\t\t\n\t\tpublic int nextInt()\n\t\t{\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\t\n\t\tpublic long nextLong()\n\t\t{\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\t\n\t\tpublic double nextDouble()\n\t\t{\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t\t\n\t\tpublic int[] nextIntArray(int n)\n\t\t{\n\t\t\tint[] res = new int[n];\n\t\t\tfor(int i = 0; i < res.length; i++)\n\t\t\t\tres[i] = nextInt();\n\t\t\treturn res;\n\t\t}\n\t\t\n\t\tpublic long[] nextLongArray(int n)\n\t\t{\n\t\t\tlong[] res = new long[n];\n\t\t\tfor(int i = 0; i < res.length; i++)\n\t\t\t\tres[i] = nextLong();\n\t\t\treturn res;\n\t\t}\n\t\t\n\t\tpublic double[] nextDoubleArray(int n)\n\t\t{\n\t\t\tdouble[] res = new double[n];\n\t\t\tfor(int i = 0; i < res.length; i++)\n\t\t\t\tres[i] = nextDouble();\n\t\t\treturn res;\n\t\t}\n\t\tpublic void sortIntArray(int[] array)\n\t\t{\n\t\t\tInteger[] vals = new Integer[array.length];\n\t\t\tfor(int i = 0; i < array.length; i++)\n\t\t\t\tvals[i] = array[i];\n\t\t\tArrays.sort(vals);\n\t\t\tfor(int i = 0; i < array.length; i++)\n\t\t\t\tarray[i] = vals[i];\n\t\t}\n\t\t\n\t\tpublic void sortLongArray(long[] array)\n\t\t{\n\t\t\tLong[] vals = new Long[array.length];\n\t\t\tfor(int i = 0; i < array.length; i++)\n\t\t\t\tvals[i] = array[i];\n\t\t\tArrays.sort(vals);\n\t\t\tfor(int i = 0; i < array.length; i++)\n\t\t\t\tarray[i] = vals[i];\n\t\t}\n\t\t\n\t\tpublic void sortDoubleArray(double[] array)\n\t\t{\n\t\t\tDouble[] vals = new Double[array.length];\n\t\t\tfor(int i = 0; i < array.length; i++)\n\t\t\t\tvals[i] = array[i];\n\t\t\tArrays.sort(vals);\n\t\t\tfor(int i = 0; i < array.length; i++)\n\t\t\t\tarray[i] = vals[i];\n\t\t}\n\n\t\tpublic String[] nextStringArray(int n) \n\t\t{\t\n\t\t\tString[] vals = new String[n];\n\t\t\tfor(int i = 0; i < n; i++)\n\t\t\t\tvals[i] = next();\n\t\t\treturn vals;\n\t\t}\n\t\t\n\t\tInteger nextInteger()\n\t\t{\n\t\t\tString s = next();\n\t\t\tif(s == null)\n\t\t\t\treturn null;\n\t\t\treturn Integer.parseInt(s);\n\t\t}\n\t\t\n\t\tint[][] nextIntMatrix(int n, int m)\n\t\t{\n\t\t\tint[][] ans = new int[n][];\n\t\t\tfor(int i = 0; i < n; i++)\n\t\t\t\tans[i] = nextIntArray(m);\n\t\t\treturn ans;\n\t\t}\n\t\t\n\t\tstatic <T> T fill(T arreglo, int val)\n\t\t{\n\t\t\tif(arreglo instanceof Object[])\n\t\t\t{\n\t\t\t\tObject[] a = (Object[]) arreglo;\n\t\t\t\tfor(Object x : a)\n\t\t\t\t\tfill(x, val);\n\t\t\t}\n\t\t\telse if(arreglo instanceof int[])\n\t\t\t\tArrays.fill((int[]) arreglo, val);\n\t\t\telse if(arreglo instanceof double[])\n\t\t\t\tArrays.fill((double[]) arreglo, val);\n\t\t\telse if(arreglo instanceof long[])\n\t\t\t\tArrays.fill((long[]) arreglo, val);\n\t\t\treturn arreglo;\n\t\t}\n\t\t\n\t\t<T> T[] nextObjectArray(Class <T> clazz, int size)\n\t\t{\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tT[] result = (T[]) java.lang.reflect.Array.newInstance(clazz, size);\n\t\t\tfor(int c = 0; c < 3; c++)\n\t\t\t{\n\t\t\t\tConstructor <T> constructor;\n\t\t\t\ttry \n\t\t\t\t{\n\t\t\t\t\tif(c == 0)\n\t\t\t\t\t\tconstructor = clazz.getDeclaredConstructor(Scanner.class, Integer.TYPE);\n\t\t\t\t\telse if(c == 1)\n\t\t\t\t\t\tconstructor = clazz.getDeclaredConstructor(Scanner.class);\n\t\t\t\t\telse\n\t\t\t\t\t\tconstructor = clazz.getDeclaredConstructor();\n\t\t\t\t} \n\t\t\t\tcatch(Exception e)\n\t\t\t\t{\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\ttry\n\t\t\t\t{\n\t\t\t\t\tfor(int i = 0; i < result.length; i++)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(c == 0)\n\t\t\t\t\t\t\tresult[i] = constructor.newInstance(this, i);\n\t\t\t\t\t\telse if(c == 1)\n\t\t\t\t\t\t\tresult[i] = constructor.newInstance(this);\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tresult[i] = constructor.newInstance();\t\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tcatch(Exception e)\n\t\t\t\t{\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t\treturn result;\n\t\t\t}\n\t\t\tthrow new RuntimeException(\"Constructor not found\");\n\t\t}\n\t}\n\t\n\tstatic int factorial(int n)\n\t{\n\t\tif(n == 0) return 1;\n\t\treturn n * factorial(n - 1);\n\t}\n\t\n\tstatic int[] permutar(boolean[] usados, int[] numeros, int n, int k)\n\t{\n\t\tif(n == usados.length)\n\t\t\treturn numeros;\n\t\tint faltantes = usados.length - n;\n\t\tint sigFact = factorial(faltantes - 1);\n\t\tfor(int i = 0; i < usados.length; i++)\n\t\t{\n\t\t\tif(!usados[i])\n\t\t\t{\n\t\t\t\tif(sigFact >= k)\n\t\t\t\t{\n\t\t\t\t\tusados[i] = true;\n\t\t\t\t\tnumeros[n] = i;\n\t\t\t\t\treturn permutar(usados, numeros, n + 1, k);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tk -= sigFact;\n\t\t\t}\n\t\t}\n\t\treturn null;\n\t}\n\t\n\tstatic int contarHasta(int n) \n\t{\n\t\tint cuenta = 0;\n\t\tfor(int i = 1; i < 10; i++)\n\t\t{\n\t\t\tint limite = 1 << i;\n\t\t\tfor(int j = 0; j < limite; j++)\n\t\t\t{\n\t\t\t\tchar[] val = new char[i];\n\t\t\t\tfor(int k = 0; k < i; k++)\n\t\t\t\t{\n\t\t\t\t\tif((j & (1 << k)) != 0)\n\t\t\t\t\t\tval[k] = '4';\n\t\t\t\t\telse\n\t\t\t\t\t\tval[k] = '7';\n\t\t\t\t}\n\t\t\t\tif(Integer.parseInt(new String(val)) <= n)\n\t\t\t\t\tcuenta++;\n\t\t\t}\n\t\t}\n\t\treturn cuenta;\n\t}\n\t\n\tstatic boolean esLucky(int j) \n\t{\n\t\tfor(char c : (j + \"\").toCharArray())\n\t\t\tif(c != '4' && c != '7')\n\t\t\t\treturn false;\n\t\treturn true;\n\t}\n\t\n\tpublic static void main(String[] args)\n\t{\n\t\tScanner sc = new Scanner();\n\t\tint n = sc.nextInt();\n\t\tint k = sc.nextInt();\n\t\tif(n > 13)\n\t\t{\n\t\t\tint total = contarHasta(n - 13);\n\t\t\tint[] vals = permutar(new boolean[13], new int[13], 0, k);\n\t\t\tfor(int i = 0; i < 13; i++) vals[i] += n - 12;\n\t\t\tfor(int i = 0, j = n - 12; i < 13; i++, j++)\n\t\t\t\tif(esLucky(vals[i]) && esLucky(j)) total++;\n\t\t\tSystem.out.println(total);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif(k > factorial(n))\n\t\t\t{\n\t\t\t\tSystem.out.println(-1);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tint total = 0;\n\t\t\tint[] vals = permutar(new boolean[n], new int[n], 0, k);\n\t\t\tfor(int i = 0; i < n; i++) vals[i] += 1;\n\t\t\tfor(int i = 0, j = 1; i < n; i++, j++)\n\t\t\t\tif(esLucky(vals[i]) && esLucky(j)) total++;\n\t\t\tSystem.out.println(total);\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "combinatorics", "number theory"], "code_uid": "b0116fac5f74145b3137a76c64bc4f8d", "src_uid": "cb2aa02772f95fefd1856960b6ceac4c", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.lang.Math;\nimport java.math.BigInteger;\n\npublic class Problem {\n\n\tpublic static void main(String[] args) throws IOException {\n\n\t\tnew Problem().run();\n\t}\n\n\tBufferedReader in;\n\tPrintWriter out;\n\tStringTokenizer tok;\n\tstatic final boolean ONLINE_JUDGE = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tProblem() throws FileNotFoundException{\n\n\t\tif (ONLINE_JUDGE) {\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in)); \n out = new PrintWriter(System.out); \n\t\t} else {\n\t\t\tin = new BufferedReader(new FileReader(\"input.txt\"));\n\t\t\tout = new PrintWriter(\"output.txt\");\n\t\t}\n\t\ttok = new StringTokenizer(\"\");\n\t}\n\n\t// ======================================================\n\tList<Integer>[] graph;\n\tint[] ans;\n\tboolean[] used;\n\tvoid solve() throws IOException {\n\t\tint n = rI();\n\t\tlong ans = 27;\n\t\tlong min = 7;\n\t\tint m = 1000*1000*1000+7;\n\t\tfor(int i=0;i<n-1;++i){\n\t\t\tans = (ans*27)%m;\n\t\t\tmin = (min*7)%m;\n\t\t}\n\t\tout.println(((ans+m)-min)%m);\n\t\t\n\t}\t\n\t\n\t// ======================================================\n\tvoid run() throws IOException {\n\t\tsolve();\n\t\tout.close();\n\t}\n\n\tchar[] reverseCharArray(char[] arr){\n\t\tchar[] ans = new char[arr.length];\n\t\tfor(int i=0;i<arr.length;++i){\n\t\t\tans[i] = arr[arr.length-i-1];\n\t\t}\n\t\treturn ans;\n\t}\n\tint sqrt(double m){\n\t\tint l = 0;\n\t\tint r = 1000000000+9;\n\t\tint i=1000;\n\t\twhile(r-l>1){\n\t\t\tint mid = (r+l)/2;\n\t\t\tif(mid*mid>m){\n\t\t\t\tr = mid;\n\t\t\t}else{\n\t\t\t\tl = mid;\n\t\t\t}\n\t\t}\n\t\treturn l;\n\t}\n\tint countPow(int m,int n){\n\t\tint ans = 0;\n\t\twhile(m%n==0&&m>0){\n\t\t\tans++;\n\t\t\tm/=n;\n\t\t}\n\t\treturn ans;\n\t}\n\tlong binPow(long a, long b){\n\t\tif(b == 0){\n\t\t\treturn 1;\n\t\t}\n\t\tif(b%2==1){\n\t\t\treturn a*binPow(a,b-1);\n\t\t}else{\n\t\t\tlong c = binPow(a,b/2);\n\t\t\treturn c*c;\n\t\t}\n\t\t\n\t}\n\tlong gcd(long a, long b){\n\t\treturn b==0?a:gcd(b,a%b);\n\t}\n\t\n\tlong pow(long x, long k){\n\t\tlong ans=1;\n\t\tfor(int i=0;i<k;++i){\n\t\t\tans*=x;\n\t\t}\n\t\treturn ans;\n\t}\n\t//////////////////////////////////////////////////////////////////////\n\n\n\tString delimiter = \" \";\n\tString readLine() throws IOException {\n\t\treturn in.readLine();\n\t}\n\tString rS() throws IOException {\n\t\twhile (!tok.hasMoreTokens()) {\n\t\t\tString nextLine = readLine();\n\t\t\tif (null == nextLine)\n\t\t\t\treturn null;\n\n\t\t\ttok = new StringTokenizer(nextLine);\n\t\t}\n\n\t\treturn tok.nextToken(delimiter);\n\t}\n\tint rI() throws IOException {\n\t\treturn Integer.parseInt(rS());\n\t}\n\n\tlong rL() throws IOException {\n\t\treturn Long.parseLong(rS());\n\t}\n\tint[] rA(int b) {\n\t\tint a[] = new int[b];\n\t\tfor (int i = 0; i < b; i++) {\n\t\t\ttry {\n\t\t\t\ta[i] = rI();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\t\treturn a;\n\t}\n\t\n\tint[] readSortedIntArray(int size) throws IOException {\n\t Integer[] array = new Integer[size];\n\n\t for (int index = 0; index < size; ++index) {\n\t array[index] = rI();\n\t }\n\t Arrays.sort(array);\n\n\t int[] sortedArray = new int[size];\n\t for (int index = 0; index < size; ++index) {\n\t sortedArray[index] = array[index];\n\t }\n\n\t return sortedArray;\n\t }\n\n}", "lang_cluster": "Java", "tags": ["combinatorics"], "code_uid": "9acf3475cec61189f09b6679fed3ba4e", "src_uid": "eae87ec16c284f324d86b7e65fda093c", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "/*Shabeg Singh Gill*/\n//code \n\nimport java .util.Scanner ;\nimport java.util.*;\nimport java.io.*;\nimport java.nio.IntBuffer;\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.util.Iterator;\n//import java.io.OutputStreamReader;\nimport java.io.PrintWriter;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\nimport java.lang.Math;\nimport java.io.InputStream;\nimport java.util.InputMismatchException;\nimport java.awt.Point; \nimport java.util.HashMap;\nimport java.util.Collections;\nimport java.util.Arrays;\n//import java.util.Collections.reverseOrder()\n \npublic class cf2{\n \n public static int binarysearch(int[] arr,int num){\n int n;\n n=arr.length;\n int ans;\n ans=0;\n int start;\n start=0;\n int end ;\n end=n-1;\n while(start<=end){\n int mid;\n mid=(start+end)/2;\n if (arr[mid]>num){\n end=mid-1;\n } \n else{\n ans=mid+1;\n start=mid+1;\n }\n }\n return ans;\n }\n\n public static void merger(int startind,int midind,int endind, ArrayList<Integer> arr){\n ArrayList<Integer> mergedSortedArray;\n mergedSortedArray= new ArrayList<Integer>();\n\t\t\n\t\t int rightIndex ;\n rightIndex= midind+1;\n \n int leftIndex ;\n leftIndex= startind;\n \n \n while(midind>=leftIndex && endind>=rightIndex){\n if(arr.get(leftIndex)<=arr.get(rightIndex)){\n mergedSortedArray.add(arr.get(leftIndex));\n leftIndex++;\n }else{\n mergedSortedArray.add(arr.get(rightIndex));\n rightIndex++;\n }\n } \n while(midind>=leftIndex){\n mergedSortedArray.add(arr.get(leftIndex));\n leftIndex++;\n }\n \n while(endind>=rightIndex){\n mergedSortedArray.add(arr.get(rightIndex));\n rightIndex++;\n }\n \n int i ;\n i= 0;\n int j ;\n j= startind;\n while(i<mergedSortedArray.size()){\n arr.set(j, mergedSortedArray.get(i++));\n j++;\n }\n }\n public static void divide(int startIndex,int endIndex, ArrayList<Integer> arr){\n if(endIndex >startIndex&& (endIndex-startIndex)>=1){\n int mid;\n mid = (endIndex + startIndex)/2;\n divide(startIndex, mid, arr);\n divide(mid+1, endIndex, arr); \n merger(startIndex,mid,endIndex,arr); \n } \n } \n\n public static int gcd(int a, int b){\n return fact(Math.min(a, b));\n } \n public static int fact(int n){\n int ans =1;\n for(int i =1; i<=n; i++){\n ans=ans*i;\n }\n return ans ; \n } \n \n //function to find sum of array \n public static long arraysum(int[] arr, int n ){\n long sum=0;\n for(int x=0; x<n; x++){\n sum=sum+arr[x];\n }\n return sum ;\n }\n public static void main(final String[] args) throws IOException { \n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter w = new PrintWriter(outputStream);\n Scanner s =new Scanner(System.in);\n\n int a1=in.nextInt();\n int a2=in.nextInt();\n int a3=in.nextInt();\n int b1=in.nextInt();\n int b2=in.nextInt();\n int b3=in.nextInt();\n int n =in.nextInt();\n int sum1=a1+a2+a3;\n int sum2=b1+b2+b3;\n int count1=0;\n int count2=0;\n if(sum1%5!=0){\n count1=(sum1/5)+1;\n }\n else {\n count1=(sum1/5);\n }\n if(sum2%10!=0){\n count2=(sum2/10)+1;\n }\n else {\n count2=(sum2/10);\n }\n int ans=count1+count2;\n if(ans<=n){\n System.out.println(\"YES\");\n }\n else {\n System.out.println(\"NO\");\n }\n }\n}\n\nclass InputReader {\n private final InputStream stream;\n private final byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n private final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n \n public InputReader(final InputStream stream) {\n this.stream = stream;\n }\n \n public int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n \n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (final IOException e) {\n throw new InputMismatchException();\n }\n \n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n \n public String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (final IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n \n public int nextInt() {\n int c = read();\n \n while (isSpaceChar(c))\n c = read();\n \n int sgn = 1;\n \n if (c == '-') {\n sgn = -1;\n c = read();\n }\n \n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n \n return res * sgn;\n }\n \n public long nextLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n \n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n \n public double nextDouble() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n \n public String readString() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n final StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n \n return res.toString();\n }\n \n public boolean isSpaceChar(final int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n \n public String next() {\n return readString();\n }\n \n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "01ff44dc16281418babb6ac520186ed1", "src_uid": "fe6301816dea7d9cea1c3a06a7d1ea7e", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.math.*;\nimport java.util.*;\n\nimport static java.util.stream.Collectors.*;\nimport static java.util.Map.Entry.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tFastReader in = new FastReader(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tint n = in.nextInt();\n\t\tint m = in.nextInt();\n\t\tint f = 0;\n\t\tint c = 0;\n\t\tint x = 1;\n\t\twhile (true) {\n\t\t\tif (x < n) {\n\t\t\t\tif (x != 1) {\n\t\t\t\t\t--f;\n\t\t\t\t}\n\t\t\t\tint max = m - f;\n\t\t\t\tf += max;\n\t\t\t\tc += (x * (max));\n\t\t\t\tif (x + f == n) {\n\t\t\t\t\tbreak;\n\t\t\t\t} else if (x + f > n) {\n\t\t\t\t\tint y = (x + f) - n;\n\t\t\t\t\tc -= (y * x);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t++x;\n\t\t\t}\n\t\t}\n\t\tout.println(c);\n\t\tout.flush();\n\t\tout.close();\n\n\t}\n\n\tstatic class FastReader {\n\t\tStringTokenizer st;\n\t\tBufferedReader br;\n\n\t\tpublic FastReader(InputStream s) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(s));\n\t\t}\n\n\t\tpublic FastReader(FileReader fileReader) {\n\t\t\tbr = new BufferedReader(fileReader);\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\twhile (st == null || !st.hasMoreTokens())\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) throws IOException {\n\t\t\tint[] ret = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tret[i] = nextInt();\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic long[] nextIntLong(int n) throws IOException {\n\t\t\tlong[] ret = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tret[i] = nextLong();\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic double nextDouble() throws IOException {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tpublic long nextLong() throws IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic String nextLine() throws IOException {\n\t\t\treturn br.readLine();\n\t\t}\n\n\t\tpublic boolean ready() throws IOException {\n\t\t\treturn br.ready();\n\t\t}\n\t}\n\n}", "lang_cluster": "Java", "tags": ["math", "greedy", "dp"], "code_uid": "693e44db10980867028605d4df430846", "src_uid": "f8eb96deeb82d9f011f13d7dac1e1ab7", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class Solution {\n public static void main(String[] args) throws IOException{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n int limit = (int)(Math.sqrt(n));\n if((limit + 1) * (limit + 1) == n)\n limit++;\n int result = 1;\n\n boolean found = false;\n for(int i = 1; i <= limit; i++){\n if(n % i == 0){\n int current = n / i;\n if(isBeautiful(current)){\n result = current;\n found = true;\n break;\n }\n }\n }\n if(!found)\n for(int i = limit; i >= 1; i--){\n if(n % i == 0){\n int current = i;\n if(isBeautiful(current)){\n result = current;\n found = true;\n break;\n }\n }\n }\n /*for(int i = n; i >= 2; i--){\n if(n % i == 0)\n if(isBeautiful(i)){\n result = i;\n break;\n }\n }*/\n System.out.println(result);\n }\n private static boolean isBeautiful(int n){\n boolean one = false;\n int count0 = 0;\n int count1 = 0;\n while(n > 0){\n if(one){\n if(n % 2 == 0)\n return false;\n else {\n count1++;\n n /= 2;\n }\n }\n if(!one){\n if(n % 2 == 1){\n count1++;\n one = true;}\n else count0++;\n n /= 2;\n }\n }\n if(count0 + 1 == count1)\n return true;\n return false;\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "9343b5c5270abaaf360ac592d8217979", "src_uid": "339246a1be81aefe19290de0d1aead84", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\nimport java.io.*;\n\n\npublic class Main {\n/*\n\n\n\n */\n\tpublic static void main(String[] args) throws Exception {\n\t\tuu.s1();\n\t\tuu.out.close();\n\t}\n\tpublic static class uu {\n\t\tpublic static BR in = new BR();\n\t\tpublic static PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n\t\tpublic static boolean bg = true;\n\t\tpublic static void s1() throws Exception {\n\t\t\tlong n1 = in.ni();\n\t\t\t\n\t\t\tIntSet s1 = new IntSet();\n\t\t\tfor (int x = 0; x <= 9; x++){\n\t\t\t\tfor (int y = x+1; y <= 9; y++){\n\t\t\t\t\tfor (int k = 1; k <= 10; k++){\n\t\t\t\t\t\tint v1 = k;\n\t\t\t\t\t\tint[] l1 = new int[v1];\n\t\t\t\t\t\tfor (;;){\n\t\t\t\t\t\t\tlong fin = 0;\n\t\t\t\t\t\t\tfor (int qq = 0; qq < v1; qq++){\n\t\t\t\t\t\t\t\tlong cur = 0;\n\t\t\t\t\t\t\t\tif (l1[qq] == 1){\n\t\t\t\t\t\t\t\t\tcur = y;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\telse {\n\t\t\t\t\t\t\t\t\tcur = x;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tfin*= 10l;\n\t\t\t\t\t\t\t\tfin += cur;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tif (fin <= n1){\n\t\t\t\t\t\t\t\ts1.add((int)fin);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tint ptr = l1.length-1;\n\t\t\t\t\t\t\tboolean ex = false;\n\t\t\t\t\t\t\tfor (;;){\n\t\t\t\t\t\t\t\tif (ptr == -1){\n\t\t\t\t\t\t\t\t\tex = true;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif (l1[ptr] == 0){\n\t\t\t\t\t\t\t\t\tl1[ptr] = 1;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\telse {\n\t\t\t\t\t\t\t\t\tl1[ptr] = 0;\n\t\t\t\t\t\t\t\t\tptr--;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif (ex) break;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t\ts1.remove(0);\n\t\t\tpn(s1.size);\n\t\t}\n\t\t\n\t\tpublic static void s2() throws Exception {\n\t\t\t\n\t\t}\n\t\tpublic static void s3() throws Exception {\n\t\t\t\n\t\t}\n\t\t\n\t\tprivate static void pn(Object... o1) {\n\t\t\tfor (int i = 0; i < o1.length; i++){\n\t\t\t\tif (i!= 0) out.print(\" \");\n\t\t\t\tout.print(o1[i]);\n\t\t\t}\n\t\t\tout.println();\n\t\t}\n\n\t\tpublic static boolean allTrue(boolean ... l1){\n\t\t\tfor (boolean e: l1) if (!e) return false;\n\t\t\treturn true;\n\t\t}\n\t\tpublic static boolean allFalse(boolean ... l1){\n\t\t\tfor (boolean e: l1) if (e) return false;\n\t\t\treturn true;\n\t\t}\n\t}\n\tprivate static class IntSet {\n\t\tpublic static int hash(int h) {\n\t\t\th ^= (h >>> 20) ^ (h >>> 12);\n\t\t\treturn h ^ (h >>> 7) ^ (h >>> 4);\n\t\t}\n\t\t\n\t\tpublic boolean[] used = null;\n\t\tpublic int[] key = null;\n\t\tpublic double factor = 0.7;\n\t\tpublic int size = 0;\n\t\tpublic int init = 16;\n\t\tpublic IntSet(){\n\t\t\tused = new boolean[init];\n\t\t\tkey = new int[init];\n\t\t}\n\t\tpublic void rehash(){\n\t\t\tint newlen = (key.length<<1)+1;\n\t\t\tboolean[] oldused = used;\n\t\t\tint[] oldkey = key;\n\t\t\tused = new boolean[newlen];\n\t\t\tkey = new int[newlen];\n\t\t\tsize = 0;\n\t\t\tfor (int i = 0; i < oldused.length; i++){\n\t\t\t\tif (oldused[i]){\n\t\t\t\t\tadd(oldkey[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tpublic int idx(int key1){\n\t\t\tint id = hash(key1);\n\t\t\tif (id < 0) id *= -1;\n\t\t\tid %= key.length;\n\t\t\tfor (int i = 0; ; i++){\n\t\t\t\tint add = i*i;\n\t\t\t\tif (add < 0) add *= -1;\n\t\t\t\tid += add;\n\t\t\t\tid %= key.length;\n\t\t\t\tif (used[id]){\n\t\t\t\t\tif (key[id] == key1){\n\t\t\t\t\t\treturn id;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\treturn id;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tpublic void add(int key1){\n\t\t\tint id = idx(key1);\n\t\t\tif (!used[id]){\n\t\t\t\tused[id] = true;\n\t\t\t\tkey[id] = key1;\n\t\t\t\tsize++;\n\t\t\t}\n\t\t\tif (size >= factor * key.length){\n\t\t\t\trehash();\n\t\t\t}\n\t\t}\n\t\tpublic void remove(int key1){\n\t\t\tint id = idx(key1);\n\t\t\tif (used[id]){\n\t\t\t\tused[id] = false;\n\t\t\t\tsize--;\n\t\t\t}\n\t\t}\n\t}\n\tprivate static class BR {\n\t\tBufferedReader k1 = null;\n\t\tStringTokenizer k2 = null;\n\n\t\tpublic BR() {\n\t\t\tk1 = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\t\tpublic String nx() throws Exception {\n\t\t\tfor (;;) {\n\t\t\t\tif (k2 == null || !k2.hasMoreTokens()) {\n\t\t\t\t\tString temp = k1.readLine();\n\t\t\t\t\tif (temp == null)\n\t\t\t\t\t\treturn null;\n\t\t\t\t\tk2 = new StringTokenizer(temp);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\treturn k2.nextToken();\n\t\t}\n\n\t\tpublic int ni() throws Exception {\n\t\t\treturn Integer.parseInt(nx());\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "dfs and similar", "bitmasks"], "code_uid": "831e28940604981822f34abbbfe60c5b", "src_uid": "0f7f10557602c8c2f2eb80762709ffc4", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.lang.*;\n\npublic class joe{\n\tstatic class FastScanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tFastScanner(InputStream stream) {\n\t\t\ttry {\n\t\t\t\tbr = new BufferedReader(new InputStreamReader(stream));\n\t\t\t} catch (Exception e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\n\t\tString n() {\n\t\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tString nL() {\n\t\t\tString str = \"\";\n\t\t\ttry {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn str;\n\t\t}\n\n\t\tint nI() {\n\t\t\treturn Integer.parseInt(n());\n\t\t}\n\n\t\tlong nLo() {\n\t\t\treturn Long.parseLong(n());\n\t\t}\n\t}\n\n\tprivate static long gcd(long a, long b) {\n\t\tif (b == 0)\n\t\t\treturn a;\n\t\telse\n\t\t\treturn gcd(b, a % b);\n\t}\n\n\tpublic static void main(String args[]) {\n\t\ttry {\n\t\t\tFastScanner sc = new FastScanner(System.in);\n\t\t\tint n = sc.nI();\n\t\t\tint k=sc.nI();\n\t\t\t\n\t\t\tint\tmin=(k==0||k==n)?0:1;\n\t\t\tint\tmax=(k<=n/3)?(2*k):(n-k);\n\t\t\t\n\t\t\tSystem.out.println(min+\" \"+max);\n\t\t} catch (Exception e) {\n\t\t}\n\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "constructive algorithms"], "code_uid": "dc22a763fa4b676115adc4de5e890e89", "src_uid": "bdccf34b5a5ae13238c89a60814b9f86", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class alicebobappleorange {\n private static InputReader in;\n private static PrintWriter out;\n\n public static void main(String[] args) throws IOException {\n in = new InputReader(System.in);\n out = new PrintWriter(System.out, true);\n long x = in.nextLong(), y = in.nextLong();\n \n String s = get(x, y, x < y);\n if (s.equals(\"-\")) out.println(\"Impossible\");\n else out.println(s);\n out.close();\n System.exit(0);\n }\n \n public static String get(long x, long y, boolean a) {\n if (x > y) return get(y, x, a);\n if (x == 1) return (y-1)+\"\"+(a?\"B\":\"A\");\n \n long c = y % x;\n if (c == 0) return \"-\";\n \n String m = get(c, x, !a);\n if (m.equals(\"-\")) return m;\n long w = y / x;\n StringBuilder ret = new StringBuilder();\n ret.append(w);\n ret.append(a?\"B\":\"A\");\n ret.append(m);\n return ret.toString();\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n public long nextLong() {\n return Long.parseLong(next());\n }\n }\n\n\n}\n", "lang_cluster": "Java", "tags": ["number theory"], "code_uid": "da053dd68b234d75e9a5aa7027c2b54d", "src_uid": "6a9ec3b23bd462353d985e0c0f2f7671", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.BufferedWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\n\npublic class C {\n\n static StringTokenizer st;\n static BufferedReader br;\n static PrintWriter pw;\n public static void main(String[] args) throws IOException {\n br = new BufferedReader(new InputStreamReader(System.in));\n pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n int xp = nextInt();\n int yp = nextInt();\n int xv = nextInt();\n int yv = nextInt();\n if (xp <= xv && yp <= yv) {\n System.out.println(\"Polycarp\");\n }\n else {\n int dp = xp+yp;\n int dv = Math.max(xv, yv);\n if (dp <= dv)\n System.out.println(\"Polycarp\");\n else\n System.out.println(\"Vasiliy\");\n }\n pw.close();\n }\n private static int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n private static long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n private static double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n private static String next() throws IOException {\n while (st==null || !st.hasMoreTokens())\n st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "greedy", "implementation", "games"], "code_uid": "366b4c0f81317d49f204cf157a36f0b8", "src_uid": "2637d57f7809ff8f922549c617709074", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class Bark{\n\tpublic static void main(String args[])\n\t{\n\t\tScanner scan = new Scanner(System.in);\n\t\tString input=scan.next();\n\t\tint n=scan.nextInt();\n\t\tString[] words = new String[n];\n\t\t\n\t\tfor(int i=0;i<n;i++){\n\t\t\twords[i]=scan.next();\n\t\t}for(int k=0;k<n;k++){\n\t\t\tfor(int j=0;j<n;j++){\n\t\t\t\tString cat=words[k]+words[j];\n\t\t\t\tif(cat.contains(input)){\n\t\t\t\t\tSystem.out.println(\"YES\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(\"NO\");\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "strings", "implementation"], "code_uid": "b081e71a10b13b85b7e7af6b83c8558e", "src_uid": "cad8283914da16bc41680857bd20fe9f", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author prakharjain\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n CNewYearAndPermutation solver = new CNewYearAndPermutation();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class CNewYearAndPermutation {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n = in.nextInt();\n int m = in.nextInt();\n\n long[] fac = factorial(n, m);\n long[] ifac = factorialInverse(n, m);\n\n long ans = n * fac[n];\n ans %= m;\n\n for (int i = 2; i <= n; i++) {\n long ca = fac[i];\n ca *= fac[n - i + 1];\n ca %= m;\n ca *= ifac[n];\n ca %= m;\n ca *= (n - i + 1);\n ca %= m;\n ca *= fac[n];\n ca %= m;\n\n ans += ca;\n ans %= m;\n }\n\n out.println(ans);\n }\n\n long[] factorial(int n, int mod) {\n long[] factorial = new long[n + 1];\n\n factorial[0] = 1;\n\n for (int i = 1; i <= n; i++) {\n factorial[i] = i * factorial[i - 1];\n factorial[i] %= mod;\n }\n\n return factorial;\n }\n\n long[] factorialInverse(int n, int mod) {\n long[] factorialInverse = new long[n + 1];\n\n long[] inv = new long[n + 1];\n\n inv[1] = 1;\n\n for (int i = 2; i <= n; i++) {\n inv[i] = inv[mod % i];\n inv[i] *= (mod - mod / i);\n inv[i] %= mod;\n }\n\n factorialInverse[0] = 1;\n\n for (int i = 1; i <= n; i++) {\n factorialInverse[i] = inv[i] * factorialInverse[i - 1];\n factorialInverse[i] %= mod;\n }\n\n return factorialInverse;\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void println(long i) {\n writer.println(i);\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "combinatorics"], "code_uid": "0b0fe6bc527cb52c7bf0197e6706153f", "src_uid": "020d5dae7157d937c3f58554c9b155f9", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String args[]){\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint n=sc.nextInt(), m = sc.nextInt(), k = sc.nextInt();\n\t\t\n\t\tint left = k-1, right = n-k,ans=1;\n\t\tint temp = 0;\n\n\t\tm = m-n;\n\t\t\n\t\twhile(m>=0){\n\t\t\t\n\t\t\tif(temp >= left && temp>=right){\n\t\t\t\ttemp += m/(Math.min(temp, left)+Math.min(temp, right)+1) +1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tm-=Math.min(temp, left);\n\t\t\tm-=Math.min(temp, right);\n\t\t\n\t\t\tm--;\n\t\t\ttemp++;\n\t\t\t\n\t\t}\n\t\t\t\n\t\tSystem.out.print(ans+temp-1);\n\t}\n}", "lang_cluster": "Java", "tags": ["greedy", "binary search"], "code_uid": "78447358e7a62fca0574d60a7803d7b1", "src_uid": "da9ddd00f46021e8ee9db4a8deed017c", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\r\nimport java.io.*;\r\n\r\npublic class Solution{\r\n\t\t\r\n\tpublic static void print(Object line){\r\n\t\tSystem.out.print(line);\r\n\t}\r\n\t\r\n\tpublic static void println(){\r\n\t\tSystem.out.println();\r\n\t}\r\n\t\r\n\tpublic static void println(Object line){\r\n\t\tSystem.out.println(line);\r\n\t}\r\n\t\r\n\tpublic static void solve(int a){\r\n\t\r\n\t}\r\n\t\r\n\tpublic static void main(String args[])throws IOException{\r\n\t\tBufferedReader br = new BufferedReader(new \r\n\t\tInputStreamReader(System.in));\r\n\t\tint MOD = 998244353;\r\n\t\tint n = Integer.parseInt(br.readLine());\r\n\t\t\r\n\t\t// factors\r\n\t\tint div[] = new int[10000005];\r\n\t\tfor(int i = 2 ; i < n+5 ; i ++ ){\r\n\t\t\tfor(int j = i ; j <= n+5 ; j += i){\r\n\t\t\t\tdiv[j]++;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tlong sum = 1;\r\n\t\tlong res = 1;\r\n\t\tfor (int i = 2 ; i <= n ; i ++ ){\r\n\t\t\tres = sum + div[i] + 1;\r\n\t\t\tres = res % MOD;\r\n\t\t\tsum += res;\r\n\t\t\tsum = sum % MOD;\r\n\t\t}\r\n\t\tprintln(res);\r\n\t}\r\n}", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics", "number theory"], "code_uid": "bc4cb0059cb2f84a08b5a46f978f7da1", "src_uid": "09be46206a151c237dc9912df7e0f057", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\n/**\n * @author Andrei Chugunov\n */\npublic class A {\n\n BufferedReader br;\n PrintWriter out;\n StringTokenizer st;\n\n void solve() throws IOException {\n int length = nextInt();\n String string = nextString();\n\n int cur = 0;\n StringBuilder result = new StringBuilder();\n for(int i=0; i < length; i++) {\n char c = string.charAt(i);\n if (c == '1') {\n cur++;\n continue;\n }\n if (c == '0') {\n result.append(cur);\n cur = 0;\n }\n\n }\n result.append(cur);\n\n\n System.out.println(result.toString());\n\n\n\n }\n\n A() throws IOException {\n br = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n solve();\n out.close();\n }\n\n public static void main(String[] args) throws IOException {\n new A();\n }\n\n String nextToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (Exception e) {\n return null;\n }\n }\n return st.nextToken();\n }\n\n int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n String nextString() throws IOException {\n return br.readLine();\n }\n\n long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "777ed6dddb3edec26d933fceb81246ce", "src_uid": "a4b3da4cb9b6a7ed0a33a862e940cafa", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.lang.*;\nimport java.math.*;\nimport java.util.*;\nimport java.io.*;\n\npublic class Main {\n void solve() {\n int n=ni(),T=ni();\n int a[]=new int[2*n*n+1];\n int cnt[]=new int[301];\n for(int i=1;i<=n;i++){\n a[i]=ni();\n cnt[a[i]]++;\n }\n long start[]=new long[n*n+1];\n long end[]=new long[n*n+1];\n st=new long[4*301+1];\n if(T<=2*n){\n long ans=0;\n for(int i=n+1;i<=T*n;i++) a[i]=a[i-n];\n for(int i=1;i<=T*n;i++){\n\n long mx=query(1,1,a[i],1,300);\n update(1,1,300,a[i],mx+1);\n ans=Math.max(ans,mx+1);\n }\n pw.println(ans);\n return;\n }\n for(int i=n+1;i<=n*n;i++ )a[i]=a[i-n];\n for(int i=1;i<=n*n;i++){\n\n long mx=query(1,1,a[i],1,300);\n update(1,1,300,a[i],mx+1);\n end[i]=mx+1;\n }\n Arrays.fill(st,0);\n for(int i=n*n;i>=1;i--){\n\n long mx=query(1,a[i],300,1,300);\n update(1,1,300,a[i],mx+1);\n start[i]=mx+1;\n }\n long ans=0;\n for(int i=1;i<=n;i++){\n for(int j=1;j<=n;j++){\n if(a[i]<=a[j]){\n long cc=end[n*(n-1)+i]+(T-2*n)*1L*cnt[a[i]]+start[j];\n\n\n ans=Math.max(ans,cc);\n // if(ans==7543) pw.println(i+\" \"+j);\n\n }\n }\n }\n pw.println(ans);\n\n }\n long st[];\n void update(int id,int l,int r,int x,long val){\n if(l==r){\n st[id]=val;\n }else {\n int mid=(l+r)>>1;\n if(x<=mid) update(2*id,l,mid,x,val);\n else update(2*id+1,mid+1,r,x,val);\n st[id]=Math.max(st[2*id],st[2*id+1]);\n }\n }\n long query(int id,int x,int y,int l,int r){\n if(x>y) return 0;\n if(r<x || l>y )return 0;\n if(x<=l && r<=y) return st[id];\n int mid=(l+r)>>1;\n return Math.max(query(2*id,x,y,l,mid),query(2*id+1,x,y,mid+1,r));\n }\n\n\n\n\n long M= (long)1e9+7;\n InputStream is;\n PrintWriter pw;\n String INPUT = \"\";\n void run() throws Exception {\n is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n pw = new PrintWriter(System.out);\n long s = System.currentTimeMillis();\n solve();\n pw.flush();\n if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+\"ms\");\n\n }\n public static void main(String[] args) throws Exception { new Main().run(); }\n\n private byte[] inbuf = new byte[1024];\n public int lenbuf = 0, ptrbuf = 0;\n\n private int readByte() {\n if(lenbuf == -1)throw new InputMismatchException();\n if(ptrbuf >= lenbuf){\n ptrbuf = 0;\n try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n if(lenbuf <= 0)return -1;\n }\n return inbuf[ptrbuf++];\n }\n\n private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\n private double nd() { return Double.parseDouble(ns()); }\n private char nc() { return (char)skip(); }\n\n private String ns() {\n int b = skip();\n StringBuilder sb = new StringBuilder();\n while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n private char[] ns(int n) {\n char[] buf = new char[n];\n int b = skip(), p = 0;\n while(p < n && !(isSpaceChar(b))){\n buf[p++] = (char)b;\n b = readByte();\n }\n return n == p ? buf : Arrays.copyOf(buf, p);\n }\n\n private char[][] nm(int n, int m) {\n char[][] map = new char[n][];\n for(int i = 0;i < n;i++)map[i] = ns(m);\n return map;\n }\n\n private int[] na(int n) {\n int[] a = new int[n];\n for(int i = 0;i < n;i++)a[i] = ni();\n return a;\n }\n\n private int ni() {\n int num = 0, b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n\n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n private long nl() {\n long num = 0;\n int b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n\n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n private boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n private void tr(Object... o) { if(INPUT.length() > 0)System.out.println(Arrays.deepToString(o)); }\n\n}", "lang_cluster": "Java", "tags": ["matrices", "dp", "constructive algorithms"], "code_uid": "b00d35b8a06b20ba7d29b2992b2b0caa", "src_uid": "26cf484fa4cb3dc2ab09adce7a3fc9b2", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "public class PetyaOrigami{\n\tpublic static void main(String []args){\n\t\t\n\t\tjava.util.Scanner scan=new java.util.Scanner(System.in);\n\t\tint n=scan.nextInt();\n\t\tint k=scan.nextInt();\n\t\tlong red=2*n;\n\t\tlong green=5*n;\n\t\tlong blue=8*n;\n\t\tif(red%k==0){\n\t\t\tred=red/k;\n\t\t}else{\n\t\t\tred=red/k+1;\n\t\t}\n\t\tif(green%k==0){\n\t\t\tgreen=green/k;\n\t\t}else{\n\t\t\tgreen=green/k+1;\n\t\t}\n\t\tif(blue%k==0){\n\t\t\tblue=blue/k;\n\t\t}else{\n\t\t\tblue=blue/k+1;\n\t\t}\n\t\tlong sum=red+green+blue;\n\t\tSystem.out.println(sum);\n\t}\n}", "lang_cluster": "Java", "tags": ["math"], "code_uid": "330b8ea11e5f2dcdb80f3dfa3eab13d1", "src_uid": "d259a3a5c38af34b2a15d61157cc0a39", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.util.InputMismatchException;\nimport java.io.BufferedWriter;\nimport java.io.PrintWriter;\nimport java.io.Writer;\nimport java.io.OutputStream;\nimport java.io.OutputStreamWriter;\nimport java.io.IOException;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n TaskB solver = new TaskB();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskB {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n = in.readInt();\n int m = in.readInt();\n if (n == 1) {\n out.print(1);\n return;\n }\n if (m > n / 2)\n out.print(m - 1);\n else\n out.print(m + 1);\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void print(int i) {\n writer.print(i);\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["constructive algorithms", "games", "math", "greedy", "implementation"], "code_uid": "056837a7aefe8754a3e96ab6ae50550a", "src_uid": "f6a80c0f474cae1e201032e1df10e9f7", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.FileInputStream;\nimport java.io.FileNotFoundException;\nimport java.io.FileOutputStream;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\n\npublic class H {\n\n\tstatic int k;\n\n\tprivate static int mult(int x, int y) {\n\t\tint m = x * y;\n\t\tint r = 0;\n\t\tint st = 1;\n\t\twhile (m != 0) {\n\t\t\tr += (m % k) * st;\n\t\t\tst *= 10;\n\t\t\tm /= k;\n\t\t}\n\t\treturn r;\n\t}\n\n\t/**\n\t * @param args\n\t * @throws FileNotFoundException\n\t */\n\tpublic static void main(String[] args) throws FileNotFoundException {\n//\t\tScanner in = new Scanner(new FileInputStream(\"stdin\"));\n//\t\tPrintWriter out = new PrintWriter(new FileOutputStream(\"stdout\"));\n\t\tScanner in = new Scanner(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\n\t\tk = in.nextInt();\n\t\tfor (int i = 1; i < k; i++) {\n\t\t\tfor (int j = 1; j < k; j++) {\n\t\t\t\tif (j != 1) {\n\t\t\t\t\tout.print(' ');\n\t\t\t\t}\n\t\t\t\tout.print(mult(i, j));\n\t\t\t}\n\t\t\tout.println();\n\t\t}\n\n\t\tin.close();\n\t\tout.close();\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "b9f8753d7d30dfb1b381018a153140ec", "src_uid": "a705144ace798d6b41068aa284d99050", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n\n private static void solver(InputReader sc, PrintWriter out) throws Exception {\n int n = sc.nextInt();\n int k = sc.nextInt();\n int arr[] = new int[n];\n for(int i=0;i<n;i++){\n arr[i]=sc.nextInt();\n }\n int count=0;\n int i=0,j=n-1;\n boolean flag1=true,flag2=true;\n for(;i<n && j>=0 && i<=j;) {\n if(i==j){\n if(arr[i]<=k)\n count++;\n break;\n }\n if(!flag1 && !flag2){\n break;\n }\n if (arr[i] <= k && flag1) {\n count++;\n i++;\n }else\n flag1 = false;\n if (arr[j] <= k && flag2){\n count++;\n j--;\n }\n else\n flag2 = false;\n }\n out.println(count);\n }\n private static long gcd(long a, long b){\n if(b==0)\n return a;\n else\n return gcd(b,a%b);\n }\n\n public static void main(String[] args) throws Exception{\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n solver(in,out);\n out.close();\n }\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n public long nextLong(){\n return Long.parseLong(next());\n }\n\n public long[] readLongArr(int n){\n long arr[] = new long[n];\n for(int i=0; i<n; i++){\n arr[i] = nextLong();\n }\n return arr;\n }\n public int[] readIntArr(int n){\n int arr[] = new int[n];\n for(int i=0; i<n; i++){\n arr[i] = nextInt();\n }\n return arr;\n }\n }\n}\nclass Pair implements Comparable<Pair>{\n int x;\n String s;\n Pair(int x, String s){\n this.x = x;\n this.s = s;\n }\n public int compareTo(Pair p){\n return this.x-p.x;\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "0674d5ec4e63ac8dae65fd0213e4cc43", "src_uid": "ecf0ead308d8a581dd233160a7e38173", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\npublic class Main\n{\n public static void main(String args[])\n {\n Scanner sc=new Scanner(System.in);\n String s=sc.next();\n boolean p=true;\n int n=s.length();\n int fi=-1,li=-1,before=0,after=0;\n for(int i=0;i<n;i++)\n {\n if(fi==-1 && s.charAt(i)!='0')\n {\n fi=i;\n }\n if(s.charAt(n-1-i)!='0' && li==-1)\n {\n li=n-1-i;\n }\n if(fi!=-1 && li!=-1)\n {\n break;\n }\n }\n before=fi;\n after=n-1-li;\n if(before<=after)\n {\n for(int i=fi;i<=li;i++)\n {\n if(s.charAt(i)!=s.charAt(li-i))\n {\n p=false;\n break;\n }\n }\n if(p)\n {\n System.out.println(\"YES\");\n }\n else{\n System.out.println(\"NO\");\n }\n }\n else{\n System.out.println(\"NO\"); \n }\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "b0cf7ea8769432db873c6351ed57bb21", "src_uid": "d82278932881e3aa997086c909f29051", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class Main {\n\tpublic static void main(String args[]) {new Main().run();}\n\n\tFastReader in = new FastReader();\n\tPrintWriter out = new PrintWriter(System.out);\n\tvoid run(){\n\t\twork();\n\t\tout.flush();\n\t}\n\tlong mod=1000000007;\n\tlong gcd(long a,long b) {\n\t\treturn a==0?b:b>=a?gcd(b%a,a):gcd(b,a);\n\t}\n\tvoid work() {\n\t\tint a=in.nextInt(),b=in.nextInt(),k=in.nextInt(),t=in.nextInt();\n\t\tlong[] dp1=new long[250000];\n\t\tlong[] dp2=new long[250000];\n\t\tdp1[120000]=1;\n\t\tdp2[b-a+120000]=1;\n\t\tfor(int p=0;p<t;p++) {\n\t\t\tlong[] ndp1=new long[250000];\n\t\t\tlong[] ndp2=new long[250000];\n\t\t\tfor(int i=1000;i<240000;i++) {\n\t\t\t\tif(dp1[i]>0) {\n\t\t\t\t\tndp1[i-k]=(ndp1[i-k]+dp1[i]+mod)%mod;\n\t\t\t\t\tndp1[i+k+1]=(ndp1[i+k+1]-dp1[i]+mod)%mod;\n\t\t\t\t}\n\t\t\t\tif(dp2[i]>0) {\n\t\t\t\t\tndp2[i-k]=(ndp2[i-k]+dp2[i]+mod)%mod;\n\t\t\t\t\tndp2[i+k+1]=(ndp2[i+k+1]-dp2[i]+mod)%mod;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int i=1;i<250000;i++) {\n\t\t\t\tndp1[i]=(ndp1[i]+ndp1[i-1]+mod)%mod;\n\t\t\t\tndp2[i]=(ndp2[i]+ndp2[i-1]+mod)%mod;\n\t\t\t}\n\t\t\tdp1=ndp1;\n\t\t\tdp2=ndp2;\n\t\t}\n\t\tlong ret=0;\n\t\tlong sum=0;\n\t\tfor(int i=0;i<250000;i++) {\n\t\t\tret=(ret+(dp1[i]*sum))%mod;\n\t\t\tsum=(sum+dp2[i])%mod;\n\t\t}\n\t\tout.println(ret);\n\t}\n}\t\n\n\n\nclass FastReader\n{\n\tBufferedReader br;\n\tStringTokenizer st;\n\n\tpublic FastReader()\n\t{\n\t\tbr=new BufferedReader(new InputStreamReader(System.in));\n\t}\n\t\n\t\n\tpublic String next() \n\t{\n\t\tif(st==null || !st.hasMoreElements())\n\t\t{\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tpublic int nextInt() \n\t{\n\t\treturn Integer.parseInt(next());\n\t}\n\n\tpublic long nextLong()\n\t{\n\t\treturn Long.parseLong(next());\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics"], "code_uid": "cd1758e11cbb5dbea8124884fbbe16ef", "src_uid": "8b8327512a318a5b5afd531ff7223bd0", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "\nimport java.io.*;\nimport java.util.*;\n\npublic class CP {\n static Scanner sc = new Scanner(System.in);\n static class FastReader{\n BufferedReader br;\n StringTokenizer st;\n\n public FastReader()\n {\n br = new BufferedReader(new\n InputStreamReader(System.in));\n }\n\n String next()\n\n\n\n\n {\n while (st == null || !st.hasMoreElements())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt()\n {\n return Integer.parseInt(next());\n }\n\n long nextLong()\n {\n return Long.parseLong(next());\n }\n\n double nextDouble()\n {\n return Double.parseDouble(next());\n }\n\n String nextLine()\n {\n String str = \"\";\n try\n {\n str = br.readLine();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n return str;\n }\n }\n public static int lowerBound\n (Integer[] array, int length, int value) {\n int l = 0;\n int r = length;\n while (l < r) {\n int mid = (l + r) / 2;\n if (value < array[mid]) {\n r = mid;\n } else {\n l = mid + 1;\n }\n }\n return l;\n }\n public static long gcd(long a, long b){\n if (b == 0)\n return a;\n else return gcd(b, a % b);\n }\n public static void swap(int x, int y ){\n int temp =y;\n y=x;\n x=temp;\n }\n public static void main(String [] args) {\n //int T = sc.nextInt();while (T--!=0)\n {\n solve();\n }\n }\n public static void solve() {\n///////////////////////////////////////////////////////////////////////////////////////////\n String a =sc.next(),b=sc.next(),c=sc.next();\n Map<Character,Integer> m =new HashMap<>();\n m.put('A',0);\n m.put('B',0);\n m.put('C',0);\n if(a.charAt(1)=='>'){\n m.put(a.charAt(0),m.get(a.charAt(0))+1);\n } if(a.charAt(1)=='<'){\n m.put(a.charAt(2),m.get(a.charAt(2))+1);\n } if(b.charAt(1)=='>'){\n m.put(b.charAt(0),m.get(b.charAt(0))+1);\n } if(b.charAt(1)=='<'){\n m.put(b.charAt(2),m.get(b.charAt(2))+1);\n } if(c.charAt(1)=='>'){\n m.put(c.charAt(0),m.get(c.charAt(0))+1);\n } if(c.charAt(1)=='<'){\n m.put(c.charAt(2),m.get(c.charAt(2))+1);\n }\n if(m.get('A')==1 && m.get('B')==1 && m.get('C')==1){\n System.out.println(\"Impossible\");\n return;\n }\n else if(m.get('A')==0){\n System.out.print('A');\n }\n else if(m.get('B')==0)\n System.out.print('B');\n else if(m.get('C')==0)\n System.out.print('C');\n if(m.get('A')==1)\n System.out.print('A');\n else if(m.get('B')==1)\n System.out.print('B');\n else if(m.get('C')==1)\n System.out.print('C');\n if(m.get('A')==2)\n System.out.print('A');\n else if(m.get('B')==2)\n System.out.println('B');\n else if (m.get('C')==2)\n System.out.println('C');\n////////////////////////////////////////////////////////////////////////////////////////////\n }\n\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "ed9c024832e46e68b5b4c5f01a7c6dc2", "src_uid": "97fd9123d0fb511da165b900afbde5dc", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\n\npublic class WizardsAndDemonstration {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st = new StringTokenizer(br.readLine());\n\t\tint total = Integer.parseInt(st.nextToken());\n\t\tint wizards = Integer.parseInt(st.nextToken());\n\t\tdouble requiredPrecentage = Double.parseDouble(st.nextToken())/100;\n\t\tdouble needed = Math.ceil((total*requiredPrecentage));\n\t\tif (needed <= wizards)\n\t\t\tSystem.out.println(0);\n\t\telse\n\t\t\tSystem.out.println((int) (needed-wizards));\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "ef730a40d8cd8e8db2869ba63979be68", "src_uid": "7038d7b31e1900588da8b61b325e4299", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Pro\n{\n public static void main(String[] args)\n {\n Scanner cin = new Scanner(System.in);\n PrintWriter out = new PrintWriter(System.out);\n int a = cin.nextInt();\n int b = cin.nextInt();\n int q = 0;\n for(int i = 0; i < 40; i++)\n {\n for(int j = 0; j < 40; j++)\n {\n long kk = 1;\n for (int x = 0; x < i; x++)\n {\n kk = kk * 2;\n }\n for (int y = 0; y < j; y++)\n {\n kk = kk * 3;\n if (kk > 2000000000)\n break;\n }\n //out.println(kk);\n if (a <= kk && kk <= b)\n q++;\n }\n }\n out.println(q);\n out.flush();\n }\n}", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "011ad0366e84e19ee3d20acf30ae9cf6", "src_uid": "05fac54ed2064b46338bb18f897a4411", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.Locale;\nimport java.util.StringTokenizer;\n\npublic class A {\n\t\n\tprivate static final long MOD = (long) (1e9 + 7.1);\n\t\n\tprivate void solve() throws IOException {\n\t\tint n = nextInt();\n\t\tint k = nextInt();\n\t\t\n\t\tlong res = 0;\n\t\tint[] a = new int[k];\n//\t\ta[k - 1] = 1;\n\t\t\n\t\tbyte[] f = new byte[k];\n\t\t\n\t\tif (k == 1) {\n\t\t\tres = 1;\n\t\t}\n\t\t\n\t\twhile (true) {\n\t\t\tboolean end = true;\n\t\t\tfor (int i = 0; i < k; i++) {\n\t\t\t\tif (a[i] < k - 1) {\n\t\t\t\t\ta[i]++;\n\t\t\t\t\tend = false;\n\t\t\t\t\tfor (int j = 0; j < i; j++) {\n\t\t\t\t\t\ta[j] = 0;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif (end) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\tArrays.fill(f, (byte)0);\n\t\t\tbyte p = 1;\n\t\t\tf[k - 1] = 100;\n\t\t\tboolean b = true;\n\t\t\tfor (int i = 0; i < k - 1; i++) {\n\t\t\t\tif (f[i] == 0) {\n\t\t\t\t\tint j = i;\n\t\t\t\t\tdo {\n\t\t\t\t\t\tf[j] = p;\n\t\t\t\t\t\tj = a[j];\n\t\t\t\t\t} while (f[j] == 0);\n\t\t\t\t\t\n\t\t\t\t\tif (f[j] == p) {\n\t\t\t\t\t\tb = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tp++;\n\t\t\t}\n\t\t\t\n\t\t\tif (b) {\n\t\t\t\tres++;\n//\t\t\t\tfor (int i = 0; i < 4; i++) {\n//\t\t\t\t\tprint(a[i] + \" \");\n//\t\t\t\t}\n//\t\t\t\tprintln(\"\");\n\t\t\t}\n\t\t}\n\t\t\n//\t\tSystem.err.println(res);\n\t\t\n\t\tfor (int i = k; i < n; i++) {\n\t\t\tres = (res * (n - k)) % MOD;\n\t\t}\n\t\t\n\t\tprintln(res);\n\t}\n\n\tprivate String nextToken() throws IOException {\n\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t}\n\t\treturn tokenizer.nextToken();\n\t}\n\n\tprivate int nextInt() throws NumberFormatException, IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tprivate double nextDouble() throws NumberFormatException, IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n\n\tprivate long nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tprivate void print(Object o) {\n\t\twriter.print(o);\n\t}\n\n\tprivate void println(Object o) {\n\t\twriter.println(o);\n\t}\n\n\tprivate void printf(String format, Object... o) {\n\t\twriter.printf(format, o);\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tlong time = System.currentTimeMillis();\n\t\tLocale.setDefault(Locale.US);\n\t\tnew A().run();\n\t\tSystem.err.printf(\"%.3f\\n\", 1e-3 * (System.currentTimeMillis() - time));\n\t}\n\n\tBufferedReader reader;\n\tStringTokenizer tokenizer;\n\tPrintWriter writer;\n\n\tprivate void run() {\n\t\ttry {\n\t\t\treader = new BufferedReader(new InputStreamReader(System.in));\n\t\t\twriter = new PrintWriter(System.out);\n\t\t\tsolve();\n\t\t\treader.close();\n\t\t\twriter.close();\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(13);\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["combinatorics"], "code_uid": "c7ee848ab4cffceee3006972155092a7", "src_uid": "cc838bc14408f14f984a349fea9e9694", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "\nimport java.io.BufferedReader;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n/**\n * 4:41 ~ \n *\n */\npublic class Main {\n\t\n\tpublic static void main(String[] argv) {\n\t\tFastScanner scan = new FastScanner(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\t\n\t\tint n = scan.nextInt();\n\t\tint t = scan.nextInt();\n\t\tif(n <= t){\n\t\t\tout.println(0);\n\t\t\tout.close();\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tint dp[][][][] = new int[n+2][4 * 4 + 5][n+1][n+1];\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tif(i == 0){\n\t\t\t\tfor(int j = 0; j < 4; j++){\n\t\t\t\t\tdp[i+1][j][0][0] = 1;\n\t\t\t\t}\n\t\t\t} else if(i == 1){\n\t\t\t\tfor(int state = 0; state < 4; state++){\n\t\t\t\t\tfor(int j = 0; j < 4; j++){\n\t\t\t\t\t\tif(state == j) continue;\n\t\t\t\t\t\tdp[i+1][state * 4 + j][0][0] += dp[i][state][0][0];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\t\t\t\n\t\t\t\tfor(int state = 0; state < 16; state++){\n\t\t\t\t\tint first = state / 4;\n\t\t\t\t\tint second = state % 4;\n\t\t\t\t\tif(first == second) continue;\n\t\t\t\t\tfor(int c = 0; c <= i/2; c++){\n\t\t\t\t\t\tfor(int d = 0; d <= i/2; d++){\n\t\t\t\t\t\t\tfor(int j = 0; j < 4; j++){\n\t\t\t\t\t\t\t\tif(second == j) continue;\n\t\t\t\t\t\t\t\tif(first < second){\n\t\t\t\t\t\t\t\t\tif(second < j){\n\t\t\t\t\t\t\t\t\t\tdp[i+1][second * 4 + j][c][d] += dp[i][state][c][d];\n\t\t\t\t\t\t\t\t\t} else if(second > j){\n\t\t\t\t\t\t\t\t\t\tdp[i+1][second * 4 + j][c+1][d] += dp[i][state][c][d];\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t} else if(first > second){\n\t\t\t\t\t\t\t\t\tif(second < j){\n\t\t\t\t\t\t\t\t\t\tdp[i+1][second * 4 + j][c][d+1] += dp[i][state][c][d];\n\t\t\t\t\t\t\t\t\t} else if(second > j){\n\t\t\t\t\t\t\t\t\t\tdp[i+1][second * 4 + j][c][d] += dp[i][state][c][d];\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t/*\n\t\tfor(int i = 0; i <= n+1; i++)\n\t\t\tfor(int state = 0; state < 16; state++)\n\t\t\t\tfor(int c = 0; c <= i / 2; c++)\n\t\t\t\t\tfor(int d = 0; d <= i / 2; d++)\n\t\t\t\t\t\tSystem.out.println(i + \", (\" + (state / 4) + \",\" + (state % 4) + \"), \" + c + \",\" + d + \" => \" + dp[i][state][c][d]);\n\t\t*/\n\t\tint ret = 0;\n\t\tfor(int state = 0; state < 16; state++){\n\t\t\tint first = state / 4;\n\t\t\tint second = state % 4;\n\t\t\tif(first == second) continue;\n\t\t\tret += dp[n][state][t][t-1];\n\t\t}\n\t\tout.println(ret);\n\t\tout.close();\t\t\n\t}\n\n\tstatic class FastScanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tFastScanner(InputStream is) {\n\t\t\ttry {\n\t\t\t\tbr = new BufferedReader(new InputStreamReader(is));\n\t\t\t} catch (Exception e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\n\t\tString next() {\n\t\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (Exception e) {\n\t\t\t\t\treturn null;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.valueOf(next());\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "28f028622a568b569cb2e77f393f0371", "src_uid": "6d67559744583229455c5eafe68f7952", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Collections;\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\nimport java.util.LinkedList;\nimport java.util.TreeMap;\npublic class Main {\n\tpublic static Scanner in=new Scanner(System.in);\n\tpublic static int num;\n\tpublic static int time[][]=new int[25][61];\n\tpublic static void main(String[] args){\n\t\tint a;\n\t\tint ta;\n\t\tint b;\n\t\tint tb;\n\t\tString s=in.nextLine();\n\t\tint z=0;\n\t\tint count=0;\n\t\twhile(s.charAt(z)!=' ')z++;\n\t\ta=Integer.parseInt(s.substring(0, z));\n\t\tta=Integer.parseInt(s.substring(z+1, s.length()));\n\t\ts=in.nextLine();\n\t\tz=0;\n\t\twhile(s.charAt(z)!=' ')z++;\n\t\tb=Integer.parseInt(s.substring(0, z));\n\t\ttb=Integer.parseInt(s.substring(z+1, s.length()));\n\t\ts=in.nextLine();\n\t\tint starth=Integer.parseInt(s.substring(0, 2));\n\t\tint startm=Integer.parseInt(s.substring(3, 5));\n\t\tint hs=starth*60+startm;\n\t\tint he=hs+ta;\n\t\tint j=b;\n\t\tfor(int i=300;i<24*60;i++){\n\t\t\tif(j==b){\n\t\t\t\tif(i>(hs-tb)&&i<he){\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t\tj=1;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tj++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "164b496aed2bc5b0a9be38d35f49ed0a", "src_uid": "1c4cf1c3cb464a483511a8a61f8685a7", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "\n\nimport java.util.ArrayList;\nimport java.util.HashSet;\nimport java.util.Scanner;\nimport java.util.Set;\n\npublic class B {\n\tstatic Set<Integer> []edges;\n\tstatic boolean ans;\n\tstatic boolean []used;\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint m = sc.nextInt();\n\t\tint v,u;\n\t\tused = new boolean [6];\n\t\tans = false;\n\t\tedges = new Set[6];\n\t\tfor (int i = 0; i < 6; i++) {\n\t\t\tedges[i] = new HashSet<Integer>();\n\t\t}\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tv = sc.nextInt();\n\t\t\tu = sc.nextInt();\n\t\t\tedges[v].add(u);\n\t\t\tedges[u].add(v);\n\t\t}\n\t\tint cnt = 0;\n\t\tfor (int i = 1; i <=5; i++) {\n\t\t\tfor (int j = i+1; j <=5; j++) {\n\t\t\t\tif (!edges[i].contains(j))\n\t\t\t\tfor (int k = j+1; k <=5; k++) {\n\t\t\t\t\tif (!edges[j].contains(k) && !edges[i].contains(k)){\n\t\t\t\t\t\tSystem.out.println(\"WIN\");\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor (int i = 1; i <=5; i++) {\n\t\t\tif (edges[i].size() >= 3) ans = true;\n\t\t}\n\t\tif (cnt >= 2 ) ans = true;\n\t\tSystem.out.println(!ans?\"FAIL\":\"WIN\");\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation", "graphs"], "code_uid": "3b863b5b7e9e53b9ac3c5257a22f202a", "src_uid": "2bc18799c85ecaba87564a86a94e0322", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class BBi implements Runnable {\n\tpublic static void main(String[] args) {\n\t\tnew Thread(new BBi()).run();\n\t}\n\n\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\tStringTokenizer in;\n\tPrintWriter out = new PrintWriter(System.out);\n\n\tpublic String nextToken() throws IOException {\n\t\twhile (in == null || !in.hasMoreTokens()) {\n\t\t\tin = new StringTokenizer(br.readLine());\n\t\t}\n\n\t\treturn in.nextToken();\n\t}\n\n\tpublic int nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tpublic double nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n\n\tpublic long nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tint n, x, y;\n\n\tpublic long count(long z) {\n\t\tlong total = 0;\n\n\t\tlong[][] c = new long[][] { { x, y }, { y, n - x + 1 },\n\t\t\t\t{ n - x + 1, n - y + 1 }, { n - y + 1, x } };\n\n\t\tfor (int i = 0; i < c.length; i++) {\n\t\t\tlong inside = z;\n\n\t\t\tfor (int j = 0; j < c[i].length; j++) {\n\t\t\t\tif (z > c[i][j]) {\n\t\t\t\t\ttotal += Math.min(z - c[i][j], c[i][1 - j]) * c[i][j];\n\t\t\t\t\tinside -= (z - c[i][j]);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (z > c[i][0] && z > c[i][1]) {\n\t\t\t\ttotal -= Math.min(z - c[i][0], c[i][1])\n\t\t\t\t\t\t* Math.min(z - c[i][1], c[i][0]);\n\t\t\t}\n\n\t\t\tif (inside > 0)\n\t\t\t\ttotal += inside * (inside + 1) / 2;\n\t\t}\n\n\t\tfor (int i = 0; i < c.length; i++) {\n\t\t\ttotal -= Math.min(z, c[i][0]);\n\t\t}\n\n\t\treturn total + 1;\n\t}\n\n\tpublic long solve(int n, int x, int y, long c) throws IOException {\n\t\tthis.n = n;\n\t\tthis.x = x;\n\t\tthis.y = y;\n\t\t\n\t\tlong l = 0;\n\t\tlong r = 2L * n + 2;\n\t\twhile (r - l > 1) {\n\t\t\tlong z = (l + r) / 2;\n\n\t\t\tif (c <= count(z)) {\n\t\t\t\tr = z;\n\t\t\t} else {\n\t\t\t\tl = z;\n\t\t\t}\n\t\t}\n\n\t\treturn r - 1;\n\t}\n\n\tpublic void run() {\n\t\ttry {\n\t\t\tout.println(solve(nextInt(), nextInt(), nextInt(), nextLong()));\n\t\t\tout.close();\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(1);\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "binary search"], "code_uid": "1932ac6598a51bf02ca46129c19c2967", "src_uid": "232c5206ee7c1903556c3625e0b0efc6", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.util.*;\n \n \npublic class Main{\nstatic int mod = (int)(Math.pow(10, 9) + 7);\n public static void main(String[] args) {\n MyScanner sc = new MyScanner();\n out = new PrintWriter(new BufferedOutputStream(System.out));\n int n= sc.nextInt();\n long sum = 0;\n for (int i = 0; i < n; i++) {\n sum += sc.nextInt() * (i * 4);\n }\n out.println(sum);\n \n out.close();\n }\n \n static long pow(long a, long N) {\n\t if (N == 0) return 1;\n\t else if (N == 1) return a;\n\t else {\n\t\t long R = pow(a,N/2);\n\t\t if (N % 2 == 0) {\n\t\t\t return R*R;\n\t\t }\n\t\t else {\n\t\t\t return R*R*a;\n\t\t }\n\t }\n }\n \n static long powMod(long a, long N) {\n\t if (N == 0) return 1;\n\t else if (N == 1) return a % mod;\n\t else {\n\t\t long R = powMod(a,N/2) % mod;\n\t\t R *= R % mod;\n\t\t if (N % 2 == 1) {\n\t\t\t R *= a % mod;\n\t\t }\n\t\t\t return R % mod;\n\t }\n }\nstatic void mergeSort(int[] A){ // low to hi sort, single array only\n int n = A.length;\n if (n < 2) return;\n int[] l = new int[n/2];\n int[] r = new int[n - n/2];\n \n for (int i = 0; i < n/2; i++){\n l[i] = A[i];\n }\n \n for (int j = n/2; j < n; j++){\n r[j-n/2] = A[j];\n }\n \n mergeSort(l);\n mergeSort(r);\n merge(l, r, A);\n }\n \n static void merge(int[] l, int[] r, int[] a){\n int i = 0, j = 0, k = 0;\n while (i < l.length && j < r.length && k < a.length){\n if (l[i] < r[j]){\n a[k] = l[i];\n i++;\n }\n else{\n a[k] = r[j];\n j++;\n }\n k++;\n }\n while (i < l.length){\n a[k] = l[i];\n i++;\n k++;\n }\n \n while (j < r.length){\n a[k] = r[j];\n j++;\n k++;\n }\n }\n\n \n\n //-----------PrintWriter for faster output---------------------------------\n public static PrintWriter out;\n \n //-----------MyScanner class for faster input----------\n public static class MyScanner {\n BufferedReader br;\n StringTokenizer st;\n \n public MyScanner() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n \n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n \n int nextInt() {\n return Integer.parseInt(next());\n }\n \n long nextLong() {\n return Long.parseLong(next());\n }\n \n double nextDouble() {\n return Double.parseDouble(next());\n }\n \n String nextLine(){\n String str = \"\";\n\t try {\n\t str = br.readLine();\n\t } catch (IOException e) {\n\t e.printStackTrace();\n\t }\n\t return str;\n }\n\n }\n //--------------------------------------------------------\n}\n\n\n\n\n\n", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "0446097cc15450f50604f5c65d3c01c9", "src_uid": "a5002ddf9e792cb4b4685e630f1e1b8f", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.math.BigInteger;\nimport java.util.Scanner;\n\n/**\n *\n * @author AdminHP-262\n */\npublic class Hexagons {\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int n = scanner.nextInt();\n BigInteger res = (BigInteger.valueOf(n).\n multiply(BigInteger.valueOf(n + 1)))\n .multiply(BigInteger.valueOf(3)).add(BigInteger.ONE);\n System.out.println(res);\n }\n}\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "cb1dfb54dd3bffd6a39dce20773aa73a", "src_uid": "c046895a90f2e1381a7c1867020453bd", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.Set;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.TreeSet;\nimport java.util.StringTokenizer;\nimport java.io.BufferedReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastScanner in = new FastScanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskD solver = new TaskD();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskD {\n public void solve(int testNumber, FastScanner in, PrintWriter out) {\n int n = in.nextInt();\n Point[] p = new Point[n];\n long sx = 0;\n long sy = 0;\n for (int i = 0; i < n; i++) {\n long x = in.nextLong();\n long y = in.nextLong();\n x *= n;\n y *= n;\n p[i] = new Point(x, y);\n sx += x;\n sy += y;\n }\n sx /= n;\n sy /= n;\n for (int i = 0; i < n; i++) {\n p[i].x -= sx;\n p[i].y -= sy;\n }\n p = removeSymmetrical(p);\n n = p.length;\n\n if (n <= 1) {\n out.println(-1);\n return;\n }\n\n Set<Point> ans = new TreeSet<>();\n for (int step = 0; step < 2; step++) {\n for (int i = 0; i < n; i++) {\n Point dir = p[step == 0 ? 0 : i].add(p[i]).rotate90();\n if (dir.x == 0 && dir.y == 0) {\n continue;\n }\n dir.normalizeDirection();\n long[] xs = new long[n];\n for (int j = 0; j < n; j++) {\n xs[j] = dot(dir, p[j]);\n }\n Arrays.sort(xs);\n\n boolean ok = true;\n for (int j = 0; j < n; j++) {\n if (xs[0] + xs[n - 1] != xs[j] + xs[n - 1 - j]) {\n ok = false;\n break;\n }\n }\n if (ok) {\n ans.add(dir);\n }\n }\n }\n out.println(ans.size());\n }\n\n private Point[] removeSymmetrical(Point[] p) {\n int n = p.length;\n boolean[] dead = new boolean[n];\n for (int i = 0; i < n; i++) {\n for (int j = i + 1; j < n; j++) {\n if (!dead[i] && !dead[j] && p[i].x == -p[j].x && p[i].y == -p[j].y) {\n dead[i] = true;\n dead[j] = true;\n }\n }\n }\n\n int k = 0;\n for (int i = 0; i < n; i++) {\n if (!dead[i]) {\n p[k++] = p[i];\n }\n }\n return Arrays.copyOf(p, k);\n }\n\n private long dot(Point a, Point b) {\n return a.x * b.x + a.y * b.y;\n }\n\n private long gcd(long a, long b) {\n return b == 0 ? a : gcd(b, a % b);\n }\n\n class Point implements Comparable<Point> {\n long x;\n long y;\n\n Point(long x, long y) {\n this.x = x;\n this.y = y;\n }\n\n Point add(Point o) {\n return new Point(x + o.x, y + o.y);\n }\n\n Point rotate90() {\n return new Point(-y, x);\n }\n\n void normalizeDirection() {\n long d = gcd(Math.abs(x), Math.abs(y));\n if (y > 0 || y == 0 && x > 0) {\n\n } else {\n x = -x;\n y = -y;\n }\n if (d != 0) {\n x /= d;\n y /= d;\n }\n }\n\n public int compareTo(Point o) {\n if (x != o.x) {\n return x < o.x ? -1 : 1;\n }\n if (y != o.y) {\n return y < o.y ? -1 : 1;\n }\n return 0;\n }\n\n }\n\n }\n\n static class FastScanner {\n private BufferedReader in;\n private StringTokenizer st;\n\n public FastScanner(InputStream stream) {\n in = new BufferedReader(new InputStreamReader(stream));\n }\n\n public String next() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(in.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return st.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["geometry"], "code_uid": "46170594174e33dc36f473d3a72f9b8d", "src_uid": "5d7ba962400c05433ee17c5658888e69", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class Odds {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint runs = scan.nextInt();\n\t\tint[] a = new int[runs];\n\t\t\n\t\tfor (int i =0 ; i <runs;i++){\n\t\t\ta[i]= scan.nextInt();\n\t\t\t\n\t\t}\n\t\tif(runs %2==1&&a[0]%2==1&&a[a.length-1]%2==1){\n\t\t\tSystem.out.println(\"Yes\");\n\t\t}\n\t\telse{\n\t\t\tSystem.out.println(\"No\");\n\t\t}\n\n\t}\n\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "e19ec7894434f37c6c0f6283559c2952", "src_uid": "2b8c2deb5d7e49e8e3ededabfd4427db", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.IOException;\nimport java.util.StringTokenizer;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskA solver = new TaskA();\n solver.solve(1, in, out);\n out.close();\n }\n}\n\nclass TaskA {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.nextInt();\n int k = in.nextInt();\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = in.nextInt();\n }\n int cost = 0;\n for (int i = 0; i < k; i++) {\n int count1 = 0;\n int count2 = 0;\n int cur = i;\n while (cur < n) {\n if (a[cur] == 1) ++count1;\n if (a[cur] == 2) ++count2;\n cur += k;\n }\n cost += Math.min(count1, count2);\n }\n out.println(cost);\n }\n}\n\nclass InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt(){\n return Integer.parseInt(next());\n }\n\n}\n", "lang_cluster": "Java", "tags": ["math", "greedy", "implementation"], "code_uid": "5aa7d3d0d9de5023384f9200a29552e1", "src_uid": "5f94c2ecf1cf8fdbb6117cab801ed281", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\nimport static java.lang.Math.*;\npublic class Demo{\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint n = in.nextInt();\n\t\tString s = in.next();\n\t\tint count=0;\n\t\tfor (int i = 0; i < s.length(); i++){\n\t\t\tif(s.charAt(i)=='+'){count++;}else{count--;}\n\t\t\tcount = count<0? 0:count;\n\t\t}\n\t\t\n\t\tSystem.out.println(count);\n\t}\n}\t\t \n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "4f2bc7b8aa8c2e75567e047b2ad8b318", "src_uid": "a593016e4992f695be7c7cd3c920d1ed", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class A {\n\n\tstatic long s3(long x) { return x * x * x; }\n\t\n\tstatic Pair bt(long M)\n\t{\n\t\tif(M == 0)\n\t\t\treturn new Pair();\n\t\tint a = 1; while(s3(a + 1) <= M) ++a;\n\t\tPair p1 = bt(Math.min(M, s3(a + 1) - 1) - s3(a));\n\t\tp1.inc(a);\n\t\tif(a > 1)\n\t\t{\n\t\t\tPair p2 = bt(Math.min(M, s3(a) - 1) - s3(a - 1));\n\t\t\tp2.inc(a - 1);\n\t\t\tp1 = combine(p1, p2);\n\t\t}\n\t\treturn p1;\n\t}\n\n\tpublic static void main(String[] args) throws IOException \n\t{\n\t\tScanner sc = new Scanner(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\n\t\tPair ans = bt(sc.nextLong());\n\t\tout.println(ans.maxCnt + \" \" + ans.maxX);\n\n\t\tout.flush();\n\t\tout.close();\n\t}\n\t\n\tstatic Pair combine(Pair p1, Pair p2)\n\t{\n\t\tif(p1.maxCnt > p2.maxCnt || p1.maxCnt == p2.maxCnt && p1.maxX > p2.maxX)\n\t\t\treturn p1;\n\t\treturn p2;\n\t}\n\n\tstatic class Pair \n\t{ \n\t\tlong maxX; int maxCnt; \n\t\t\n\t\tvoid inc(long a) { maxCnt++; maxX += s3(a); }\n\t}\n\t\n\n\tstatic class Scanner \n\t{\n\t\tStringTokenizer st;\t\n\t\tBufferedReader br;\n\n\t\tpublic Scanner(InputStream s){\tbr = new BufferedReader(new InputStreamReader(s));}\n\n\t\tpublic Scanner(FileReader r){\tbr = new BufferedReader(r);}\n\n\t\tpublic String next() throws IOException \n\t\t{\n\t\t\twhile (st == null || !st.hasMoreTokens()) \n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {return Integer.parseInt(next());}\n\n\t\tpublic long nextLong() throws IOException {return Long.parseLong(next());}\n\n\t\tpublic String nextLine() throws IOException {return br.readLine();}\n\n\t\tpublic double nextDouble() throws IOException { return Double.parseDouble(next()); }\n\n\t\tpublic boolean ready() throws IOException {return br.ready();}\n\n\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "greedy", "constructive algorithms", "binary search"], "code_uid": "1b79e138dd603da2df5f6373e4b60c28", "src_uid": "385cf3c40c96f0879788b766eeb25139", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import static java.lang.System.currentTimeMillis;\n\nimport java.io.*;\nimport java.util.*;\n\npublic class D {\n\n static void solve() throws IOException {\n // while (true) {\n // testWithVsWithout();\n // if (false) {\n // break;\n // }\n // }\n // test();\n int n = nextInt(), m = nextInt();\n// long time = currentTimeMillis();\n long answer = solve(n, m);\n// System.err.println(currentTimeMillis() - time);\n out.println(answer);\n }\n\n static void test() {\n for (int n = 1; n < 100; n++) {\n for (int m = 0; 2 * m <= n; m++) {\n long got = solve(n, m);\n long stup = solveStupid(n, m);\n if (got != stup) {\n throw new AssertionError();\n }\n }\n }\n System.err.println(\"pass\");\n }\n\n static void testWithVsWithout() {\n Random rng = new Random();\n int n = rng.nextInt(32001);\n while (n < 5) {\n n = rng.nextInt(32001);\n }\n int m = rng.nextInt(n / 2);\n long got = solve(n, m);\n long stup = solveWithoutOptimizations(n, m);\n if (got != stup) {\n throw new AssertionError();\n }\n System.err.println(\"pass\");\n }\n\n private static long solve(int n, int m) {\n Point[] pointsLeft = new Point[n];\n Point[] pointsRight = new Point[n];\n for (int i = 0; i < n; i++) {\n pointsLeft[i] = new Point((i + 1) * 2, (i + 1) * 2);\n pointsRight[i] = new Point(4 * (n + 1) - (i + 1) * 2, (i + 1) * 2);\n // pointsLeft[i] = new Point((i+1) * 0.5, (i+1) * ok);\n // pointsRight[i] = new Point(n + 1 - (i+1) * 0.5, (i+1) * ok);\n }\n\n long answer = 0;\n\n int lastSegmentThing = m;\n\n int rightStop = n - m;\n\n for (int leftPointId = m; leftPointId + m < n; leftPointId++) {\n\n int segmentLeft = -1, segmentRight = -1;\n\n int xx, yy, theirDx, theirDy;\n long theirAbs, yyyy3;\n\n {\n int rightPointId = leftPointId;\n xx = pointsLeft[leftPointId].x + pointsRight[rightPointId].x >> 1;\n yy = pointsLeft[leftPointId].y + pointsRight[rightPointId].y >> 1;\n theirDx = xx - pointsLeft[leftPointId].x;\n theirDy = yy - pointsLeft[leftPointId].y;\n theirAbs = (long) theirDx * theirDx + (long) theirDy * theirDy\n * 3;\n\n yyyy3 = (long) yy * yy * 3;\n\n for (int low = lastSegmentThing; low + m < n; low++) {\n long lowX = 4 * (low + 1);\n long dx = xx - lowX;\n long abs = dx * dx + yyyy3;\n if (abs < theirAbs) {\n segmentLeft = low;\n break;\n }\n }\n }\n\n // timeFirst += currentTimeMillis();\n int yyyy3i = (int) yyyy3;\n int theirAbsi = (int) theirAbs;\n if (segmentLeft < 0) {\n break;\n }\n lastSegmentThing = segmentLeft;\n\n segmentRight = n - 1 - segmentLeft;\n\n answer += segmentRight - segmentLeft + 1;\n\n int dx;\n\n int yyyy3MinusTheirAbsi = yyyy3i - theirAbsi;\n\n int curAddInt = 0;\n\n for (int rightPointId = leftPointId + 1; rightPointId < rightStop; rightPointId++) {\n --xx;\n ++yy;\n // xx = pointsLeft[leftPointId].x + pointsRight[rightPointId].x\n // >> 1;\n // yy = pointsLeft[leftPointId].y + pointsRight[rightPointId].y\n // >> 1;\n --theirDx;\n ++theirDy;\n // theirDx = xx - pointsLeft[leftPointId].x;\n // theirDy = yy - pointsLeft[leftPointId].y;\n yyyy3MinusTheirAbsi += 2 * theirDx + 1;\n yyyy3MinusTheirAbsi -= 6 * theirDy - 3;\n // theirAbs = theirDx * theirDx + theirDy * theirDy * 3;\n yyyy3MinusTheirAbsi += 6 * yy - 3;\n // if (yyyy3 > Integer.MAX_VALUE) {\n // System.err.println(yyyy3);\n // }\n // long yyyy3 = yy * yy * 3;\n // if (segmentLeft < lastLeftForThisRight[rightPointId]) {\n // segmentLeft = lastLeftForThisRight[rightPointId];\n // }\n // if(segmentRight > lastRightForThisRight[rightPointId]) {\n // segmentRight = lastRightForThisRight[rightPointId];\n // }\n int lowX = 4 * (segmentLeft + 1);\n dx = xx - lowX;\n int abs = dx * dx + yyyy3MinusTheirAbsi;\n while (segmentLeft <= segmentRight) {\n // if (dx * dx > Integer.MAX_VALUE) {\n // System.err.println(dx * dx);\n // }\n if (abs < 0) {\n break;\n } else {\n ++segmentLeft;\n abs -= 8 * dx - 16;\n dx -= 4;\n }\n }\n\n lowX = 4 * (segmentRight + 1);\n dx = (xx - lowX);\n abs = dx * dx + yyyy3MinusTheirAbsi;\n\n while (segmentLeft <= segmentRight) {\n if (abs < 0) {\n break;\n } else {\n --segmentRight;\n abs += 8 * dx + 16;\n dx += 4;\n }\n }\n\n if (segmentLeft > segmentRight) {\n rightStop = rightPointId;\n break;\n }\n curAddInt += segmentRight - segmentLeft + 1;\n }\n answer += 2L * curAddInt;\n }\n\n // System.err.println(\"time first: \"+timeFirst);\n // System.err.println(\"time second: \"+timeSecond);\n return answer * 3L;\n }\n\n private static long solveWithoutOptimizations(int n, int m) {\n Point[] pointsLeft = new Point[n];\n Point[] pointsRight = new Point[n];\n for (int i = 0; i < n; i++) {\n pointsLeft[i] = new Point((i + 1) * 2, (i + 1) * 2);\n pointsRight[i] = new Point(4 * (n + 1) - (i + 1) * 2, (i + 1) * 2);\n }\n\n long answer = 0;\n\n int lastSegmentThing = m;\n\n for (int leftPointId = m; leftPointId + m < n; leftPointId++) {\n\n int segmentLeft = -1, segmentRight = -1;\n {\n int rightPointId = leftPointId;\n long xx = pointsLeft[leftPointId].x\n + pointsRight[rightPointId].x >> 1;\n long yy = pointsLeft[leftPointId].y\n + pointsRight[rightPointId].y >> 1;\n long theirDx = xx - pointsLeft[leftPointId].x;\n long theirDy = yy - pointsLeft[leftPointId].y;\n long theirAbs = theirDx * theirDx + (long) theirDy * theirDy\n * 3;\n\n for (int low = lastSegmentThing; low + m < n; low++) {\n long lowX = 4 * (low + 1);\n long dx = xx - lowX;\n long abs = dx * dx + yy * yy * 3;\n if (abs < theirAbs) {\n segmentLeft = low;\n break;\n }\n }\n }\n\n if (segmentLeft < 0) {\n break;\n }\n lastSegmentThing = segmentLeft;\n\n segmentRight = n - 1 - segmentLeft;\n\n answer += segmentRight - segmentLeft + 1;\n\n for (int rightPointId = leftPointId + 1; rightPointId < n - m; rightPointId++) {\n long xx = pointsLeft[leftPointId].x\n + pointsRight[rightPointId].x >> 1;\n long yy = pointsLeft[leftPointId].y\n + pointsRight[rightPointId].y >> 1;\n long theirDx = xx - pointsLeft[leftPointId].x;\n long theirDy = yy - pointsLeft[leftPointId].y;\n long theirAbs = theirDx * theirDx + theirDy * theirDy * 3;\n while (segmentLeft <= segmentRight) {\n long lowX = 4 * (segmentLeft + 1);\n long dx = xx - lowX;\n long abs = dx * dx + yy * yy * 3;\n if (abs < theirAbs) {\n break;\n } else {\n ++segmentLeft;\n }\n }\n\n while (segmentLeft <= segmentRight) {\n long lowX = 4 * (segmentRight + 1);\n long dx = xx - lowX;\n long abs = dx * dx + yy * yy * 3;\n if (abs < theirAbs) {\n break;\n } else {\n --segmentRight;\n }\n }\n\n if (segmentLeft > segmentRight) {\n break;\n }\n answer += 2 * (segmentRight - segmentLeft + 1);\n }\n }\n\n return answer * 3L;\n }\n\n static long solveStupid(int n, int m) {\n Point[] pointsLeft = new Point[n];\n Point[] pointsRight = new Point[n];\n // double ok = Math.sqrt(3) * 0.5;\n for (int i = 0; i < n; i++) {\n pointsLeft[i] = new Point((i + 1) * 2, (i + 1) * 2);\n pointsRight[i] = new Point(4 * (n + 1) - (i + 1) * 2, (i + 1) * 2);\n // pointsLeft[i] = new Point((i+1) * 0.5, (i+1) * ok);\n // pointsRight[i] = new Point(n + 1 - (i+1) * 0.5, (i+1) * ok);\n }\n\n long answer = 0;\n\n for (int leftPointId = m; leftPointId + m < n; leftPointId++) {\n\n for (int rightPointId = m; rightPointId + m < n; rightPointId++) {\n long xx = pointsLeft[leftPointId].x\n + pointsRight[rightPointId].x >> 1;\n long yy = pointsLeft[leftPointId].y\n + pointsRight[rightPointId].y >> 1;\n\n long theirDx = xx - pointsLeft[leftPointId].x;\n long theirDy = yy - pointsLeft[leftPointId].y;\n long theirAbs = theirDx * theirDx + theirDy * theirDy * 3;\n\n for (int low = m; low + m < n; low++) {\n long lowX = 4 * (low + 1);\n long dx = xx - lowX;\n long abs = dx * dx + yy * yy * 3;\n if (abs < theirAbs) {\n ++answer;\n }\n }\n }\n }\n\n return answer * 3L;\n }\n\n static class Point {\n final int x, y;\n\n public Point(int x, int y) {\n this.x = x;\n this.y = y;\n }\n }\n\n static BufferedReader br;\n static StringTokenizer st;\n static PrintWriter out;\n\n public static void main(String[] args) throws IOException {\n InputStream input = System.in;\n PrintStream output = System.out;\n File file = new File(\"d.in\");\n if (file.exists() && file.canRead()) {\n input = new FileInputStream(file);\n }\n br = new BufferedReader(new InputStreamReader(input));\n out = new PrintWriter(output);\n solve();\n out.close();\n }\n\n static long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n static double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n static int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n static String nextToken() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n String line = br.readLine();\n if (line == null) {\n return null;\n }\n st = new StringTokenizer(line);\n }\n return st.nextToken();\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "geometry"], "code_uid": "42537f5e00fa7598a93912508ef47788", "src_uid": "355cc23d7a4addfc920c6e5e72a2bb64", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.FileReader;\nimport java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n\n Scanner scanner = new Scanner(System.in);\n long total = scanner.nextLong();\n long k = scanner.nextLong();\n\n long diplomas = total / (2 * (k + 1));\n long gramotas = diplomas * k;\n long s_nosom = total - (diplomas + gramotas);\n\n System.out.println(diplomas + \" \" + gramotas + \" \" + s_nosom);\n }\n\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "cf455160df2b8bad4a6447bd38b9b7b6", "src_uid": "405a70c3b3f1561a9546910ab3fb5c80", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n \npublic class Codeforces { \n public static void main(String[] args) {\n TaskA Solver = new TaskA();\n Solver.Solve(); \n } \n private static class TaskA { \n private void Solve() {\n Scanner in = new Scanner(System.in);\n String S = in.nextLine();\n char s = S.charAt(0);\n char f = S.charAt(2);\n String direct1 = \"v<^>v<^>\";\n String direct2 = \"v>^<v>^<\";\n int n = in.nextInt();\n n %= 4;\n boolean fl1 = false, fl2 = false;\n if (F(n, s, f, direct1)) \n fl1 = true; \n if (F(n, s, f, direct2)) \n fl2 = true; \n if (fl1 && fl2)\n System.out.println(\"undefined\");\n else {\n if (fl1)\n System.out.println(\"cw\");\n if (fl2)\n System.out.println(\"ccw\");\n }\n } \n private static boolean F(int n, char s, char f, String direct) { \n int i = direct.indexOf(s);\n return direct.charAt(i + n) == f; \n }\n }\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "0be3ed49a1203f2689e32cb64c80d19e", "src_uid": "fb99ef80fd21f98674fe85d80a2e5298", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\timport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.HashSet;\nimport java.util.InputMismatchException;\nimport java.util.TreeMap;\n\t\t\n\t\t\t \n\t\t\tpublic class Solution123 implements Runnable\n\t\t\t{\n\t\t\t\tstatic final int MAX = 1000000007;\n\t\t\t\tstatic class InputReader\n\t\t\t\t{\n\t\t\t\t\tprivate InputStream stream;\n\t\t\t\t\tprivate byte[] buf = new byte[1024];\n\t\t\t\t\tprivate int curChar;\n\t\t\t\t\tprivate int numChars;\n\t\t\t\t\tprivate SpaceCharFilter filter;\n\t\t\t\t\tprivate BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\t\t\t\n\t\t\t\t\tpublic InputReader(InputStream stream)\n\t\t\t\t\t{\n\t\t\t\t\t\tthis.stream = stream;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tpublic int read()\n\t\t\t\t\t{\n\t\t\t\t\t\tif (numChars==-1) \n\t\t\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t\t\t\n\t\t\t\t\t\tif (curChar >= numChars)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tcurChar = 0;\n\t\t\t\t\t\t\ttry \n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tnumChars = stream.read(buf);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tcatch (IOException e)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tif(numChars <= 0)\t\t\t\t\n\t\t\t\t\t\t\t\treturn -1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn buf[curChar++];\n\t\t\t\t\t}\n\t\t\t\t \n\t\t\t\t\tpublic String nextLine()\n\t\t\t\t\t{\n\t\t\t\t\t\tString str = \"\";\n\t\t\t try\n\t\t\t {\n\t\t\t str = br.readLine();\n\t\t\t }\n\t\t\t catch (IOException e)\n\t\t\t {\n\t\t\t e.printStackTrace();\n\t\t\t }\n\t\t\t return str;\n\t\t\t\t\t}\n\t\t\t\t\tpublic int nextInt()\n\t\t\t\t\t{\n\t\t\t\t\t\tint c = read();\n\t\t\t\t\t\t\n\t\t\t\t\t\twhile(isSpaceChar(c)) \n\t\t\t\t\t\t\tc = read();\n\t\t\t\t\t\t\n\t\t\t\t\t\tint sgn = 1;\n\t\t\t\t\t\t\n\t\t\t\t\t\tif (c == '-') \n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tsgn = -1;\n\t\t\t\t\t\t\tc = read();\n\t\t\t\t\t\t}\n\t\t\t\t\t\t\n\t\t\t\t\t\tint res = 0;\n\t\t\t\t\t\tdo \n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif(c<'0'||c>'9') \n\t\t\t\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t\t\t\tres *= 10;\n\t\t\t\t\t\t\tres += c - '0';\n\t\t\t\t\t\t\tc = read();\n\t\t\t\t\t\t}\n\t\t\t\t\t\twhile (!isSpaceChar(c)); \n\t\t\t\t\t\t\n\t\t\t\t\t\treturn res * sgn;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tpublic long nextLong() \n\t\t\t\t\t{\n\t\t\t\t\t\tint c = read();\n\t\t\t\t\t\twhile (isSpaceChar(c))\n\t\t\t\t\t\t\tc = read();\n\t\t\t\t\t\tint sgn = 1;\n\t\t\t\t\t\tif (c == '-') \n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tsgn = -1;\n\t\t\t\t\t\t\tc = read();\n\t\t\t\t\t\t}\n\t\t\t\t\t\tlong res = 0;\n\t\t\t\t\t\t\n\t\t\t\t\t\tdo \n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t\t\t\tres *= 10;\n\t\t\t\t\t\t\tres += c - '0';\n\t\t\t\t\t\t\tc = read();\n\t\t\t\t\t\t}\n\t\t\t\t\t\twhile (!isSpaceChar(c));\n\t\t\t\t\t\t\treturn res * sgn;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tpublic double nextDouble() \n\t\t\t\t\t{\n\t\t\t\t\t\tint c = read();\n\t\t\t\t\t\twhile (isSpaceChar(c))\n\t\t\t\t\t\t\tc = read();\n\t\t\t\t\t\tint sgn = 1;\n\t\t\t\t\t\tif (c == '-') \n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tsgn = -1;\n\t\t\t\t\t\t\tc = read();\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdouble res = 0;\n\t\t\t\t\t\twhile (!isSpaceChar(c) && c != '.') \n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif (c == 'e' || c == 'E')\n\t\t\t\t\t\t\t\treturn res * Math.pow(10, nextInt());\n\t\t\t\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t\t\t\tres *= 10;\n\t\t\t\t\t\t\tres += c - '0';\n\t\t\t\t\t\t\tc = read();\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (c == '.') \n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tc = read();\n\t\t\t\t\t\t\tdouble m = 1;\n\t\t\t\t\t\t\twhile (!isSpaceChar(c)) \n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tif (c == 'e' || c == 'E')\n\t\t\t\t\t\t\t\t\treturn res * Math.pow(10, nextInt());\n\t\t\t\t\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t\t\t\t\tm /= 10;\n\t\t\t\t\t\t\t\tres += (c - '0') * m;\n\t\t\t\t\t\t\t\tc = read();\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn res * sgn;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tpublic String readString() \n\t\t\t\t\t{\n\t\t\t\t\t\tint c = read();\n\t\t\t\t\t\twhile (isSpaceChar(c))\n\t\t\t\t\t\t\tc = read();\n\t\t\t\t\t\tStringBuilder res = new StringBuilder();\n\t\t\t\t\t\tdo \n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tres.appendCodePoint(c);\n\t\t\t\t\t\t\tc = read();\n\t\t\t\t\t\t} \n\t\t\t\t\t\twhile (!isSpaceChar(c));\n\t\t\t\t\t\t\n\t\t\t\t\t\treturn res.toString();\n\t\t\t\t\t}\n\t\t\t\t \n\t\t\t\t\tpublic boolean isSpaceChar(int c) \n\t\t\t\t\t{\n\t\t\t\t\t\tif (filter != null)\n\t\t\t\t\t\t\treturn filter.isSpaceChar(c);\n\t\t\t\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t\t\t\t}\n\t\t\t\t \n\t\t\t\t\tpublic String next() \n\t\t\t\t\t{\n\t\t\t\t\t\treturn readString();\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tpublic interface SpaceCharFilter \n\t\t\t\t\t{\n\t\t\t\t\t\tpublic boolean isSpaceChar(int ch);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t \t\n\t\t\t\tpublic static void main(String args[]) throws Exception\n\t\t\t\t{\n\t\t\t\t\tnew Thread(null, new Solution123(),\"Solution123\",1<<26).start();\n\t\t\t\t}\t\n\t\t\t\tstatic HashSet<Pair> hset = new HashSet();\n\t\t\t\tpublic void run()\n\t\t\t\t{\n\t\t\t\t\tInputReader sc= new InputReader(System.in);\n\t\t\t\t\tPrintWriter w= new PrintWriter(System.out);\n\t\t\t\t\tTreeMap<Integer,Integer> tmap = new TreeMap();\n\t\t\t\t\tint n = sc.nextInt();\n\t\t\t\t\tint[] arr= new int[2*n];\n\t\t\t\t\tfor(int i = 0;i < 2*n;i++){\n\t\t\t\t\t\tarr[i] = sc.nextInt();\n\t\t\t\t\t}\n\t\t\t\t\tArrays.sort(arr);\n\t\t\t\t\tArrayList<Integer> ar = new ArrayList();\n\t\t\t\t\tlong ans = Integer.MAX_VALUE;\n\t\t\t\t\tfor(int i = 0;i < 2*n;i++){\n\t\t\t\t\t\tfor(int j = i+1;j < 2*n;j++){\n\t\t\t\t\t\t\tint k = 0;\n\t\t\t\t\t\t\tlong temp = 0;\n\t\t\t\t\t\t\tint one = -1;\n\t\t\t\t\t\t\tint pow = 1;\n\t\t\t\t\t\t\twhile(k < 2*n){\n\t\t\t\t\t\t\t\tif(k == i || k == j){\n\t\t\t\t\t\t\t\t\tk++;\n\t\t\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\t\ttemp = temp + (int)Math.pow(one,pow)*arr[k];\n\t\t\t\t\t\t\t\t\tpow++;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tk++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tans = Math.min(ans,temp);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tw.println(ans);\n\t\t\t\t\tw.close();\n\t\t\t\t}\n\t\t\t\tboolean isPalindrome(String s){\n\t\t\t\t\tfor(int i = 0;i < s.length()/2;i++){\n\t\t\t\t\t\tif(s.charAt(i) == s.charAt(s.length()-1-i)){\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\treturn false;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t\tlong gcd(long a,long b)\n\t\t\t\t{\n\t\t\t\t if (a == 0)\n\t\t\t\t return b;\n\t\t\t\t return gcd(b%a, a);\n\t\t\t\t}\n\t\t\t\tstatic class Pair{\n\t\t\t\t\tlong x,y;\n\t\t\t\t\tPair(long x,long y){\n\t\t\t\t\t\tthis.x = x;\n\t\t\t\t\t\tthis.y = y;\n\t\t\t\t\t}\n\t\t\t\t\tpublic boolean equals(Object o)\n\t\t\t\t\t{\n\t\t\t\t\t\tPair p = (Pair)o;\n\t\t\t\t\t\treturn p.x==x && p.y==y;\n\t\t\t\t\t\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tpublic int hashCode()\n\t\t\t\t\t{\n\t\t\t\t\t\treturn new Long(x).hashCode()*31 + new Long(y).hashCode();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} ", "lang_cluster": "Java", "tags": ["brute force", "sortings", "greedy"], "code_uid": "3964d4379065c740fb9bd5bdcc8b7d94", "src_uid": "76659c0b7134416452585c391daadb16", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\n/**\n * Created by PQZR3864 on 2018-10-04.\n */\npublic class PhoneNumber {\n public static void main(String[] args) {\n Scanner input = new Scanner(System.in);\n int count = 0;\n int n = input.nextInt();\n String digits = input.next();\n\n for(int i=0 ; i<digits.length() ;i++){\n if(digits.charAt(i) == '8') count++;\n }\n count = count > (n/11) ? (n/11) : count ;\n System.out.println(count);\n input.close();\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force"], "code_uid": "43f9d90f630eaa4ad1e1286cd410004b", "src_uid": "259d01b81bef5536b969247ff2c2d776", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "/*\n * To change this template, choose Tools | Templates\n * and open the template in the editor.\n */\n//package RCC2014;\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\n\n/**\n *\n * @author tino chagua\n */\npublic class A {\n\n /**\n * @param args the command line arguments\n */\n public static void main(String[] args) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n String[] cad = br.readLine().split(\" \");\n int c = Integer.valueOf(cad[0]);\n int d = Integer.valueOf(cad[1]);\n\n cad = br.readLine().split(\" \");\n int n = Integer.valueOf(cad[0]);\n int m = Integer.valueOf(cad[1]);\n\n int k = Integer.valueOf(br.readLine());\n\n int min = n * m - k;\n\n if (min <= 0) {\n System.out.println(0);\n return;\n }\n\n int[] total = new int[min + 1];\n\n\n for (int y = 0; y < min + 1; y++) {\n int aux = min - y;\n int x = (aux / n);\n if (aux % n != 0) {\n x++;\n } \n total[y] = x * c + y * d;\n } \n Arrays.sort(total);\n System.out.println(total[0]);\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "dp", "implementation"], "code_uid": "08e19a98be01fd6da7de8287410c4da9", "src_uid": "c6ec932b852e0e8c30c822a226ef7bcb", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Comparator;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Collection;\nimport java.util.List;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.ArrayList;\nimport java.util.StringTokenizer;\nimport java.math.BigInteger;\nimport java.util.Collections;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author AlexFetisov\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskD solver = new TaskD();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskD {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int x1 = in.nextInt();\n int x2 = in.nextInt();\n int a = in.nextInt();\n int b = in.nextInt();\n int ia = a;\n\n if (canKill(x1, x2, a, b)) {\n out.println(\"FIRST\");\n out.println(x2);\n return;\n }\n\n\n\n if (a <= 0 && b >= 0) {\n out.println(\"DRAW\");\n return;\n }\n\n int delta = x2 - x1;\n if (b < 0) {\n delta = -delta;\n int temp = -b;\n b = -a;\n a = temp;\n }\n\n if (delta < 0) {\n out.println(\"DRAW\");\n return;\n }\n if (delta % (a + b) == 0) {\n out.println(\"SECOND\");\n return;\n }\n\n int mod = delta % (a + b);\n if (mod >= a && mod <= b) {\n out.println(\"FIRST\");\n int sign = ia < 0 ? -1 : 1;\n out.println(x1 + sign * mod);\n return;\n }\n\n out.println(\"DRAW\");\n }\n\n private boolean canKill(int x1, int x2, int a, int b) {\n int delta = x2 - x1;\n return delta >= a && delta <= b;\n }\n\n}\n\nclass InputReader {\n private BufferedReader reader;\n private StringTokenizer stt;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream));\n }\n\n public String nextLine() {\n try {\n return reader.readLine().trim();\n } catch (IOException e) {\n return null;\n }\n }\n\n public String nextString() {\n while (stt == null || !stt.hasMoreTokens()) {\n stt = new StringTokenizer(nextLine());\n }\n return stt.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(nextString());\n }\n\n}\n\n", "lang_cluster": "Java", "tags": ["math", "games"], "code_uid": "b88d029172242f6eec60f44900ebea70", "src_uid": "4ea8cc3305a0ee2c1e580b43e5bc46c6", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.lang.*;\nimport java.io.*;\n\npublic class Code\n{\n\tpublic static void main (String[] args) throws java.lang.Exception\n\t{\n\t\tScanner s= new Scanner(System.in);\n\t\tint n= s.nextInt();\n\t int[] a= new int[n];\n\t int count=1;int max=0;\n\t for(int i=0;i<n;i++){\n\t a[i]=s.nextInt();\n\t if(i!=0){\n\t if(a[i]==a[i-1]+1){\n\t count++;\n\t if((i==1&&a[0]==1)||i==n-1&&a[n-1]==1000)\n\t count++;\n\t }\n\t else{\n\t count=1;\n\t }\n\t if(max<count)\n\t max=count;\n\t }\n\t }\n\t if(max>=2)\n\t System.out.println(max-2);\n\t else\n\t System.out.println(0);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["greedy", "implementation"], "code_uid": "4b28c0a1e763bbb7c8f61bd7384afb6d", "src_uid": "858b5e75e21c4cba6d08f3f66be0c198", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Scanner;\npublic class A203 {\n public static void main(String[] args) {\n Scanner sc=new Scanner(System.in);\n int c=0;\n int x=sc.nextInt();\n int t=sc.nextInt();\n int a=sc.nextInt();\n int b=sc.nextInt();\n int da=sc.nextInt();\n int db=sc.nextInt();\n if(x!=0){\n for (int i = 0; i < t; i++) {\n if((a-i*da)==x ||(b-i*db)==x || (((a-i*da)+(b-i*db))==x )){\n System.out.println(\"YES\");\n c++;\n break;\n }\n }\n if(c==0){\n for (int i = 0; i < t; i++) {\n for (int j = 0; j < t; j++) {\n if(((a-i*da)+(b-j*db))==x) {\n System.out.println(\"YES\");\n c++;\n break;\n }\n }\n if(c!=0) break;\n }\n }\n if(c==0) System.out.println(\"NO\"); \n }\n else System.out.println(\"YES\");\n \n }\n }\n \n", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "a65af6b579e49df1b1a9fcb42a3e3827", "src_uid": "f98168cdd72369303b82b5a7ac45c3af", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.Scanner;\n\npublic class Test {\n public static void main(String[] args) {\n Scanner s = new Scanner(System.in);\n while (s.hasNextLine()) {\n s.nextLine();\n System.out.println(TextDocumentAnalysis.input(s.nextLine()));\n }\n s.close();\n }\n public static void main0(String[] args) {\n String[] ins = {\n \"_Hello_Vasya(and_Petya)__bye_(and_OK)\",\n \"_a_(_b___c)__de_f(g_)__h__i(j_k_l)m__\",\n \"(LoooonG)__shOrt__(LoooonG)\",\n \"(___)\",\n \"Q(___)_u(_U)HG\"\n };\n for (int i=0; i<ins.length; i++) {\n String s = TextDocumentAnalysis.input(ins[i]);\n System.out.println(s);\n }\n }\n}\n\nclass TextDocumentAnalysis {\n public static String input(String str) {\n int len = str.length();\n boolean open = false;\n int wc = 0;\n int max = 0;\n int wlen = 0;\n for (int i=0; i<len; i++) {\n char ch = str.charAt(i);\n if (ch == '(') {\n if (wlen > 0) {\n if (wlen > max) max = wlen;\n wlen = 0;\n }\n open = true;\n } else if (ch == ')') {\n if (wlen > 0) {\n wc++;\n wlen = 0;\n }\n open = false;\n } else if (ch == '_') {\n if (wlen > 0) {\n if (open) {\n wc++;\n } else {\n if (wlen > max) max = wlen;\n }\n wlen = 0;\n }\n } else {\n wlen++;\n }\n }\n if (wlen > 0) {\n if (open) {\n wc++;\n } else {\n if (wlen > max) max = wlen;\n }\n }\n return max + \" \" + wc;\n }\n}\n\n\n\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "9a3194a982c6cd8e724fd0944a8e5303", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n;\n\t\tString s;\n\t\tn = sc.nextInt();\n\t\ts = sc.next();\n\t\tboolean openParathensis = false ;\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint maxOutSide = 0;\n\t\tint nbrInside = 0;\n\t\tfor(int i = 0 ; i<n;i++){\n\t\t\tif(s.charAt(i) == '('){\n\t\t\t\tif(!openParathensis){\n\t\t\t\t\tString[] outsideWords = sb.toString().split(\"_\");\n\t\t\t\t\tfor(String o : outsideWords){\n\t\t\t\t\t\tmaxOutSide = Math.max(maxOutSide,o.length());\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\topenParathensis = true;\n\t\t\t\tsb = new StringBuilder();\n\t\t\t}\n\t\t\telse if(s.charAt(i) == ')'){\n\t\t\t\topenParathensis = false;\n\t\t\t\tList<String> inside = Arrays.asList(sb.toString().split(\"_\"));\n\t\t\t\tnbrInside+=inside.stream().filter(x -> !x.isEmpty()).count();\n\t\t\t\tsb = new StringBuilder();\n\t\t\t}else{\n\t\t\t\tsb.append(s.charAt(i));\n\t\t\t}\n\t\t}\n\t\tString[] outsideWords = sb.toString().split(\"_\");\n\t\tfor(String o : outsideWords){\n\t\t\tmaxOutSide = Math.max(maxOutSide,o.length());\n\t\t}\n\t\tSystem.out.println(maxOutSide+\" \"+nbrInside);\n\t}\n}", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "93baeca5356d5780d3a2fe4da60e258b", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class main{\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\t\tBufferedReader entrada = new BufferedReader(new InputStreamReader(System.in));\n\t\tint cantidad = Integer.parseInt(entrada.readLine());\n\t\tint max = 0, palabras = 0, num1 = 0, num2 = 0;\n\t\tboolean dentro = false;\n\t\tString frase = entrada.readLine();\n\t\tchar[] c = new char[cantidad];\n\t\tc = frase.toCharArray();\n\t\tfor(int i=0;i<cantidad;i++){\n\t\t\tif(c[i]=='('){\n\t\t\t\tdentro = true;\n\t\t\t\tnum1 = 0;\n\t\t\t}else if(c[i]==')'){\n\t\t\t\tdentro = false;\n\t\t\t\tif(num2>0){\n\t\t\t\t\tpalabras++;\n\t\t\t\t\tnum2 = 0;\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tif(dentro){\n\t\t\t\t\tif(c[i]!='_'){\n\t\t\t\t\t\tnum2++;\n\t\t\t\t\t}else{\t\t\t\n\t\t\t\t\t\tif(num2>0){\n\t\t\t\t\t\t\tpalabras++;\n\t\t\t\t\t\t\tnum2 = 0;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}else{\n\t\t\t\t\tif(c[i]!='_'){\n\t\t\t\t\t\tnum1++;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tnum1 = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(num1>=max){\n\t\t\t\tmax = num1;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(max);\n\t\tSystem.out.println(palabras);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "b340b48e69f4b6ffb1ab5db5aef5f40e", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\npublic class Main {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n PrintWriter out = new PrintWriter(System.out);\n Solver s = new Solver();\n s.solve(in, out);\n out.close();\n }\n static class Solver {\n public void solve(Scanner in, PrintWriter out) {\n int n = in.nextInt();\n String s = in.next();\n int winpars = 0, longest = 0;\n int i = 0, j = 0;\n while (s.contains(\"__\"))\n s = s.replaceAll(\"__\", \"_\");\n n = s.length();\n if (s.charAt(i) == '(') {\n while (j < n && s.charAt(j++) != ')')\n if (s.charAt(j) == ')') {\n String temp = s.substring(i + 1, j);\n if (!temp.contains(\"_\") && temp.length() > 0)\n ++winpars;\n else {\n StringTokenizer tok = new StringTokenizer(temp, \"_\");\n winpars += tok.countTokens();\n }\n i = j;\n }\n }\n while (i < n && s.charAt(i) != '(') {\n ++i;\n if (i < n && s.charAt(i) == '(') {\n j = i;\n while (j < n && s.charAt(j++) != ')')\n if (s.charAt(j) == ')') {\n String temp = s.substring(i + 1, j);\n if (!temp.contains(\"_\") && temp.length() > 0)\n ++winpars;\n else {\n StringTokenizer tok = new StringTokenizer(temp, \"_\");\n winpars += tok.countTokens();\n }\n i = j;\n }\n }\n }\n while (s.indexOf('(') != -1 || s.indexOf(')') != -1)\n s = s.replaceAll(\"\\\\([^\\\\(]*\\\\)\", \"_\");\n StringTokenizer tok = new StringTokenizer(s, \"_\");\n while (tok.hasMoreElements()) {\n String temp = tok.nextToken();\n if (temp.length() > longest)\n longest = temp.length();\n }\n out.println(longest + \" \" + winpars);\n }\n }\n}", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "c10581c3b9353ef630c817d98e6ab846", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.stream.Stream;\nimport java.util.regex.Matcher;\nimport java.util.StringTokenizer;\nimport java.util.Optional;\nimport java.util.regex.Pattern;\nimport java.io.BufferedReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskB solver = new TaskB();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskB {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.nextInt();\n String input = in.next();\n String pattern = \"\\\\([\\\\w_]*\\\\)\";\n String[] outSite = input.split(pattern);\n int longest = Arrays.stream(outSite).map(s -> longestWords(s)).max(Integer::compare).orElse(0);\n Pattern r = Pattern.compile(pattern);\n Matcher m = r.matcher(input);\n long numberInside = 0;\n while (m.find()) {\n numberInside += Arrays.stream(trimParentheses(m.group()).split(\"_\")).filter(s -> !s.isEmpty()).count();\n }\n out.println(longest + \" \" + numberInside);\n }\n\n private int longestWords(String line) {\n return Arrays.stream(line.split(\"_\")).map(String::length).max(Integer::compare).orElse(0);\n }\n\n private String trimParentheses(String input) {\n String temp = input.substring(1, input.length());\n return temp.substring(0, temp.length() - 1);\n }\n\n }\n\n static class InputReader {\n private StringTokenizer tokenizer;\n private BufferedReader reader;\n\n public InputReader(InputStream inputStream) {\n reader = new BufferedReader(new InputStreamReader(inputStream));\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "cd61a12514496715aa6aed0ca0fab6f7", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package MyPackage.YourPack.kfjf;\n\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\nimport java.util.StringTokenizer;\n\npublic class splitITup {\n\n public static void main(String []args){\n//37\n//_Hello_Vasya(and_Petya)__bye_(and_OK)\n List<Integer> parentStart=new ArrayList<Integer>();\n List<Integer> parentEnd=new ArrayList<Integer>();\n\n\n Scanner scan=new Scanner(System.in);\n int n=scan.nextInt();\n String target=scan.next();\n for(int i=0;i<n;i++){\n if(target.charAt(i)=='(')\n parentStart.add(i);\n if(target.charAt(i)==')')\n parentEnd.add(i);\n\n }\n\n\n int count=0;\n for(int i=0;i<parentEnd.size();i++)\n {\n String s=target.substring(parentStart.get(i)+1,parentEnd.get(i));\n // System.out.print(s+\" \");\n String ss[]=s.split(\"_\");\n\n for(String f:ss)// System.out.print(\"#\"+f+\"#\");\n\n if(!f.equals(\"\")) count++;\n }\n\n // System.out.println(count);\n int Max=0;\n parentEnd.add(0,0);\n parentStart.add(target.length());\n /* for (int i:parentStart)\n System.out.println(i);\n for (int i:parentEnd)\n System.out.println(i);\n\n\n */\n\n int i;\n if(target.charAt(0)=='(')\n i=1;\n else {\n\n i=0;\n }\n\n for(;i<parentEnd.size();i++){\n String s;\nif(target.charAt(parentEnd.get(i))==')')\n s =target.substring(parentEnd.get(i)+1,parentStart.get(i));\nelse s =target.substring(parentEnd.get(i),parentStart.get(i));\n String ss[]=s.split(\"_\");\n for(String sss:ss){\n // System.out.println(sss);\n if(sss.length()>Max&&!sss.contains(\"(\")&&!sss.contains(\")\")){\n Max=sss.length();\n }\n }\n\n\n }\n System.out.println(Max+\" \"+count);\n\n\n\n\n\n }\n}\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "af28d7f155916196b3bc6bfb83bd5303", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\nimport java.math.*;\nimport java.io.*; \n public class Main{\n\n static FastReader scan=new FastReader();\n public static PrintWriter out = new PrintWriter (new BufferedOutputStream(System.out));\n static int mod(int x,int y)\n {\n if(x<0)\n x=x+(-x/y+1)*y;\n return x%y;\n }\n static int A=400,n;\n static int l[]=new int[5050];\n static int r[]=new int[5050];\n static char c[]=new char[5050];\nstatic int solve(int x){\n\tint a=0,b=0;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tif(x<l[i]||x>r[i])\n\t\t\tcontinue;\n\t\tif(c[i]=='M')\n\t\t\ta++;\n\t\telse b++;\n\t}\n\treturn Math.min(a,b);\n}\npublic static void main(String[] args) throws IOException \n{\n n=scan.nextInt();\nString s=scan.next();\nint cur=0,c=0,a=0,b=0;\nfor(int i=0;i<n;i++){\n\tif(s.charAt(i)=='('||s.charAt(i)==')'||s.charAt(i)=='_'){\n\t\tif(c>0){\n\t\t\tif(cur>0)b++;\n\t\t\telse a=Math.max(c,a);\n\t\t\tc=0;\n\t\t}\n\t\tif(s.charAt(i)=='(')\n\t\t\tcur=1;\n\t\tif(s.charAt(i)==')')cur=0;\n\t}\n\telse c++;\n}\na=Math.max(a,c);\nout.println(a+\" \"+b);\nout.close();\n}\n\n\n public static long pow(long b, long e) {\n long r = 1;\n while (e > 0) {\n if (e % 2 == 1) r = r * b ;\n b = b * b;\n e >>= 1;\n }\n return r;\n }\nprivate static void sort(long[] arr) {\n List<Long> list = new ArrayList<>();\n for (long object : arr) list.add(object);\n Collections.sort(list);\n for (int i = 0; i < list.size(); ++i) arr[i] = list.get(i);\n }\n public static class FastReader {\n BufferedReader br;\n StringTokenizer root;\n \n \n public FastReader() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n \n String next() {\n while (root == null || !root.hasMoreTokens()) {\n try {\n root = new StringTokenizer(br.readLine());\n } catch (Exception addd) {\n addd.printStackTrace();\n }\n }\n return root.nextToken();\n }\n \n int nextInt() {\n return Integer.parseInt(next());\n }\n \n double nextDouble() {\n return Double.parseDouble(next());\n }\n \n long nextLong() {\n return Long.parseLong(next());\n }\n \n String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (Exception addd) {\n addd.printStackTrace();\n }\n return str;\n }\n public int[] nextIntArray(int arraySize) {\n int array[] = new int[arraySize];\n \n for (int i = 0; i < arraySize; i++) {\n array[i] = nextInt();\n }\n \n return array;\n }\n}\nstatic class pair{\n\tint i;\n\tint j;\npair(int i,int j){\n\tthis.i=i;\n\tthis.j=j;\n}\n\n}}\n\n\n\n\n\n\n\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "ebbe14d4309a5e6e5e4acbba9eb0c5f8", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/*\n * PDPM IIITDM Jabalpur\n * Asutosh Rana\n */\n\nimport java.util.*;\nimport java.io.*;\nimport java.math.*;\n\npublic class Main\n{\n long MOD = 1000000007;\n InputReader in;BufferedReader br;PrintWriter out;\n public static void main (String[] args) throws java.lang.Exception\n {\n Main solver = new Main();\n solver.in = new InputReader(System.in);\n solver.br = new BufferedReader(new InputStreamReader(System.in));\n solver.out = new PrintWriter(System.out);\n solver.solve();\n solver.out.flush();\n solver.out.close();\n }\n\n public void solve(){\n int tc = 1;//in.readInt();\n \n for(int cas=1;cas<=tc;cas++){\n int N = in.readInt();\n String Str = in.readString();\n char[] S = Str.toCharArray();\n\n int count = 0, par =0;\n int wordInPar = 0, max_length = 0;\n for(int i=0;i<S.length;i++){\n if(S[i]=='_'){\n if(par==0){\n max_length = Math.max(max_length, count);\n }\n else if(count>0){\n wordInPar++;\n }\n count=0;\n }\n else if(S[i]=='('){\n par=1;\n max_length = Math.max(max_length, count);\n count=0;\n }\n else if(S[i]==')'){\n par=0;\n if(count>0){\n wordInPar++;\n }\n count=0;\n }\n else{\n count++;\n }\n if(par==0){\n max_length = Math.max(max_length, count);\n }\n }\n\n out.println(max_length+\" \"+wordInPar);\n }\n\n }\n \n}\n \nclass InputReader{\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private SpaceCharFilter filter;\n\n public InputReader(InputStream stream){this.stream = stream;}\n public int read(){\n if (numChars==-1) throw new InputMismatchException();\n if (curChar >= numChars){\n curChar = 0;\n try {numChars = stream.read(buf);}\n catch (IOException e){throw new InputMismatchException();}\n if(numChars <= 0) return -1;\n }\n return buf[curChar++];\n }\n\n public int readInt(){\n int c = read();\n while(isSpaceChar(c)) c = read();\n int sgn = 1;\n if (c == '-') {sgn = -1;c = read();}\n int res = 0;\n do {\n if(c<'0'||c>'9') throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c)); return res * sgn;\n }\n\n public void readInt(int[] A){\n for(int i=0;i<A.length;i++)\n A[i] = readInt();\n }\n\n public long readLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public void readLong(long[] A){\n for(int i=0;i<A.length;i++)\n A[i] = readLong();\n }\n\n public double readDouble() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, readInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, readInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n\n public char[] readCharA(){\n return readString().toCharArray();\n }\n\n public String readString() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public String next() {\n return readString();\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n\n}", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "57c7fc84b3b67a0dc84f086783826d46", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.Scanner;\n\npublic class Main10 {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int am = scanner.nextInt();\n String zad = scanner.next();\n String s = zad;\n String skobki = \"_\";\n int str = -1;\n int len = s.length();\n\n for (int i = 0; i < len; i++) {\n char c = s.charAt(i);\n if (s.charAt(i) == '(') str = i;\n if (s.charAt(i) == ')') {\n skobki = skobki +\"\" + s.subSequence(str+1, i) + \"_\";\n s = \"\" + s.subSequence(0, str) +\"_\"+ s.subSequence(i+1, s.length());\n len = s.length();\n i = str-1;\n str = -1;\n }\n }\n String arr [] = skobki.split(\"_\");\n int count = 0;\n\n for (int i = 0; i < arr.length; i++)\n if (!arr[i].equals(\"\")) count++;\n arr = s.split(\"_\");\n int max = 0;\n for (int i = 0; i < arr.length; i++)\n if (arr[i].length() > max) max = arr[i].length();\n System.out.println(max + \" \" + count);\n\n }\n}\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "7790bcdcc11946777258e97fa6a7917c", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/* package whatever; // don't place package name! */\n\nimport java.util.*;\nimport java.lang.*;\nimport java.io.*;\n\n/* Name of the class has to be \"Main\" only if the class is public. */\npublic class Ideone\n{\n\tpublic static void main (String[] args) throws java.lang.Exception\n\t{\n\t\t// your code goes here\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tString a = sc.next();\n\t\tboolean paren=false;\n\t\tint max = 0;\n\t\tint cnt = 0;\n\t\tint temp=0;\n\t\t\n\t\tfor(int i = 0 ;i < n;i++){\n\t\t if(a.charAt(i)=='_'){\n\t\t if(paren==true&&temp!=0){\n\t\t \t cnt++;\n\t\t temp = 0;\n\t\t }else{\n\t\t \t\n\t\t \tif(temp>max)\n\t\t \tmax = temp;\n\t\t temp = 0; \n\t\t }\n\t\t \t\n\t\t }else if(a.charAt(i)=='('){\n\t\t paren = true;\n\t\t \tif(temp>max)\n\t\t \tmax = temp;\n\t\t \ttemp =0;\n\t\t }else if(a.charAt(i)==')'){\n\t\t paren = false;\n\t\t if(temp>0){\n\t\t \tcnt++;\n\t\t \ttemp = 0;\n\t\t }\n\t\t \t\n\t\t }else{\n\t\t temp++;\t\n\t\t }\n\t\t\n\t\t\t\n\t\t}\n\t\tif(temp>max)\n\t\t \tmax = temp;\n\t\t\n\t\t\n\t\tSystem.out.println(max+\" \"+cnt);\n\t\t\n\t\t\n\t}\n}", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "55a2bb0d577ba03c1150c1a29553b355", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.LinkedList;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Scanner;\nimport java.util.Stack;\nimport java.util.TreeMap;\n\n\npublic class CF375B {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = Integer.parseInt(sc.nextLine());\n String s1 = sc.next().toLowerCase();\n String s2 = s1;\n char ch[] = s1.toCharArray();\n StringBuilder sb = new StringBuilder(s2);\n Stack st = new Stack();\n \n for(int i = 0; i <ch.length;i++)\n {\n \t \n \t\tst.push(sb.charAt(i));\n \n }\n List<Integer>list = new ArrayList<Integer>();\n \n for(int i = 0; i <ch.length;i++)\n {\n \t\n \t\tif(ch[i]=='(')\n \t\t{\n \t\t\tst.pop();\n \t\t\tlist.add(i);\n \t\t}\n \t\tif(ch[i]==')')\n \t\t{\n \t\t\tst.pop();\n \t\t\tlist.add(i);\n \t\t}\n \n }\n \n TreeMap<Integer, Integer> map = new TreeMap<Integer, Integer>();\n for(int i = 0; i<list.size();i = i+2)\n {\n \tmap.put(list.get(i), list.get(i+1));\n }\n List<Integer>list3 = new ArrayList<Integer>();\n for(Map.Entry<Integer, Integer>m:map.entrySet())\n {\n \tint k = m.getKey();\n \tint k1 = m.getValue();\n \tfor(int i = k; i<=k1;i++)\n \t{\n \t\tlist3.add(i);\n \t}\n }\n char c[] = new char[s1.length()-list3.size()];\n char c2[] = new char[list3.size()];\n int in = 0;\n int in2 = 0;\n for(int i = 0; i <ch.length;i++)\n {\n \tif(!list3.contains(i))\n \t{\n \t\tc[in] = ch[i];\n \t\tin++;\n \t\t\n \t}\n \t\n }\n boolean b = true;\n for(int i = 0; i <ch.length;i++)\n {\n \tif(list3.contains(i))\n \t{\n \t if(ch[i]=='(' || ch[i]==')'||ch[i]=='_')\n \t {\n \t\t if(b==true)\n \t\t {\n \t\t c2[in2] = ' ';\n \t\t in2++;\n \t\t b=false;\n \t\t }\n \t }\n \t else\n \t\t {\n \t\t c2[in2] = ch[i];\n \t\t \n \t\tin2++;\n \t\tb=true;\n \t\t }\n \t}\n }\n \n \n String pan = \"\";\n for(int i = 0; i <c2.length;i++)\n {\n \t\n \tpan = pan+Character.toString(c2[i]);\n }\n \n String pa[] = pan.split(\" \");\n List<Integer>list5 = new ArrayList<Integer>();\n for(int i = 0; i <pa.length;i++)\n {\n \tString ba = pa[i].trim();\n \tif(ba.length()!=0)\n \t{\n \tlist5.add(pa[i].length());\n \t}\n }\n \n \n String str = s1.replaceAll(\"\\\\(.*?\\\\) ?\", \" \");\n str = str.replace(\"_\", \" \");\n String string[] = str.split(\" \");\n List<Integer>list8 = new ArrayList<Integer>();\n for(int i = 0; i <string.length;i++)\n {\n \tString ba = string[i].trim();\n \tif(ba.length()!=0)\n \t{\n \tlist8.add(string[i].length());\n \t}\n }\n Collections.sort(list8);\n if(list8.size()==0)\n {\n System.out.print(0);\n }\n \n else\n \t{\n \tSystem.out.print(list8.get(list8.size()-1));\n \t}\n System.out.print(\" \"+list5.size());\n }\n \n \n\t}\n\t\n\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "5d6dcd88fb4734aa5b6de6f9e1b9af5f", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.Collections;\n\n\npublic class TextRed {\n public static void main(String[] args) {\n try {\n BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n int len = Integer.parseInt(reader.readLine());\n String s = reader.readLine();\n reader.close();\n\n int verbCount = 0;\n\n int x = 0;\n ArrayList<Integer> list = new ArrayList<Integer>();\n boolean inScob = false;\n char[] array = s.toCharArray();\n list.add(0);\n for (char c : array) {\n if (c == '(') {\n inScob = true;\n if (x != 0) {\n list.add(x);\n }\n x = 0;\n continue;\n } else if (c == ')') {\n inScob = false;\n continue;\n }\n\n if (inScob == false && c != '_') {\n x++;\n } else if (inScob == false && c == '_') {\n list.add(x);\n x = 0;\n }\n }\n if (x != 0)\n {\n list.add(x);\n }\n\n\n\n System.out.print(Collections.max(list) + \" \");\n\n x = 0;\n inScob = false;\n for (char c:array)\n {\n if (c == '(') {\n inScob = true;\n x = 0;\n continue;\n } else if (c == ')') {\n inScob = false;\n if (x != 0)\n {\n verbCount++;\n }\n x = 0;\n continue;\n }\n\n if (inScob && c != '_' )\n {\n x++;\n }else if (inScob && c == '_')\n {\n if (x != 0)\n {\n verbCount++;\n }\n x = 0;\n }\n }\n\n System.out.print(verbCount);\n }catch (Exception e)\n {\n System.out.println(0 + \" 0\" + 0);\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "d9890eda13c6e27a09e1c4f627f042b4", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Scanner;\nimport java.util.StringTokenizer;\n\npublic class TextDoc {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tscan.nextLine();\n\t\tString s = scan.nextLine();\n\t\tString[] p = s.split(\"\\\\(.*?\\\\)\");\n\t\tint max = 0;\n\t\tfor(int i = 0; i < p.length; i++){\n\t\t\tStringTokenizer st = new StringTokenizer(p[i], \"_\");\n\t\t\twhile(st.hasMoreTokens()){\n\t\t\t\tString b = st.nextToken();\n\t\t\t\tmax = Math.max(b.length(), max);\n\t\t\t}\n\t\t}\n\t\tArrayList<String> li = new ArrayList<String>();\n\t\tchar a = '(';\n\t\tchar b = ')';\n\t\tint last = -1;\n\t\tfor(int i = 0; i < s.length(); i ++){\n\t\t\tchar c = s.charAt(i);\n\t\t\tif(c == a){\n\t\t\t\tlast = i;\n\t\t\t}\n\t\t\tif(c == b && last != -1){\n\t\t\t\tli.add(s.substring(last+1, i));\n\t\t\t}\n\t\t}\n\t\tint count = 0;\n\t\tfor(int i = 0; i < li.size(); i++){\n\t\t\tString[] words = li.get(i).split(\"_\");\n\t\t\tfor(int j = 0; j < words.length; j++){\n\t\t\t\tif(words[j].length() > 0) count++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(max+\" \"+count);\n\t}\n}", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "23308e5d9e69b90b72b485b4832d8b8e", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//Rajkin Hossain.......\nimport java.io.*;\nimport java.util.*;\npublic class B{\n\t\n\t\n\t\n\n public static void main(String [] args)throws IOException{\n //FI k = new FI(\"E:/b.txt\");\n \tFI k = new FI(System.in);\n \t//Scanner k = new Scanner(new File(\"E:/b.txt\"));\n \tPrintWriter z = new PrintWriter(System.out);\n \twhile(k.hasNext()){\n \t\tint n = k.nextInt();\n \t\tString s = k.next();\n \t\tboolean ok = false;\n \t\tint one = 0;\n \t\tString tt = \"\";\n \t\tString twoans = \"\";\n \t\tboolean wordnok = true;\n \t\tfor(int c = 0;c<n;c++){\n \t\t\tchar ch = s.charAt(c);\n \t\t\tif(ch == '('){\n \t\t\t\tok = true;\n \t\t\t\twordnok = true;\n \t\t\t\ttt = \"\";\n \t\t\t}\n \t\t\telse if(ch == ')'){\n \t\t\t\ttt = \"\";\n \t\t\t\tok = false;\n \t\t\t}\n \t\t\telse{\n \t\t\t\tif(ok == false){\n \t\t\t\t\t\n \t\t\t\t\tif(ch == '_'){\n \t\t\t\t\t\ttt = \"\";\n \t\t\t\t\t}\n \t\t\t\t\telse{\n \t\t\t\t\t\ttt += ch;\n \t\t\t\t\t}\n \t\t\t\t\t\n \t\t\t\t\tif(tt.length()>twoans.length()){\n\t\t\t\t\t\t\ttwoans = tt;\n\t\t\t\t\t\t}\n \t\t\t\t}\n \t\t\t\telse{\n \t\t\t\t\tif(ch == '_'){\n \t\t\t\t\t\twordnok = true;\n \t\t\t\t\t}\n \t\t\t\t\telse{\n \t\t\t\t\t\tif(wordnok){\n \t\t\t\t\t\t\tone++;\n \t\t\t\t\t\t\twordnok = false;\n \t\t\t\t\t\t}\n \t\t\t\t\t}\n \t\t\t\t}\n \t\t\t}\n \t\t\t\n \t\t\t\n \t\t}\n \t\tz.println(twoans.length()+\" \"+one);\n \t}\n \t\n \t\n \tz.flush();\n \t\n }\n \n \n\tpublic static class FI {\n\t BufferedReader br;\n\t StringTokenizer st;\n\n\t public FI(InputStream stream){\n\t br = new BufferedReader(new InputStreamReader(stream));\n\t }\n\t \n\t public FI(String s){\n\t try {\n\t\t\t\tbr = new BufferedReader(new FileReader(s));\n\t\t\t} catch (FileNotFoundException e) {\n\t\t\t\t// TODO Auto-generated catch block\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t }\n\n\t public String next() {\n\t return nextToken();\n\t }\n\t \n\t \n\t public boolean hasNext(){\n\t \ttry {\n\t\t\t\treturn br.ready();\n\t\t\t} catch (IOException e) {\n\t\t\t\t// TODO Auto-generated catch block\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn false;\n\t }\n\n\t public String nextToken() {\n\t while (st == null || !st.hasMoreTokens()) {\n\t String line = null;\n\t try {\n\t line = br.readLine();\n\t } catch (IOException e) {\n\t throw new RuntimeException(e);\n\t }\n\t if (line == null) {\n\t return null;\n\t }\n\t st = new StringTokenizer(line);\n\t }\n\t return st.nextToken();\n\t }\n\n\t public int nextInt() {\n\t return Integer.parseInt(nextToken());\n\t }\n\t \n\t public long nextLong() {\n\t return Long.valueOf(nextToken());\n\t }\n\n\t}\n\t\n\t\n\t\n\n public static class FO extends PrintWriter {\n FO() { super(new BufferedOutputStream(System.out)); }\n }\n \n}\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "5427d72d0d1d8cc8fbe77d34ef4199f4", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class Text_Document_Analysis {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scanner=new Scanner(System.in);\n\t\tint n=scanner.nextInt();\n\t\tStringBuffer string=new StringBuffer(scanner.next());\n\t\tStringBuffer underScore=new StringBuffer();\n\t\tStringBuffer Bracket=new StringBuffer();\n\t\tint i=0,count=0,max=0,max2=0;\n\t\twhile(i<n)\n\t\t{\n\t\t\tif(string.charAt(i)=='(')\n\t\t\t{\n\t\t\t\ti++;\n\t\t\t\twhile(string.charAt(i)!=')')\n\t\t\t\t{\n\t\t\t\t\tBracket.append(string.charAt(i));\n\t\t\t\t\ti++;\n\t\t\t\t}\n\t\t\t\ti++;\n\t\t\t\tBracket.append(\"_\");\n\t\t\t\tunderScore.append(\"_\");\n\t\t\t\t\n\t\t\t}\n\t\t\telse {\n\t\t\t\tunderScore.append(string.charAt(i));\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t\tunderScore.append(\"_\");Bracket.append(\"_\");\n\t\t//System.out.println(underScore+\"*****\"+Bracket);\n\t\tfor(int j=0;j<underScore.length();j++)\n\t\t{\n\t\t\tif(underScore.charAt(j)=='_')\n\t\t\t{\n\t\t\t\tif(count>max) {\n\t\t\t\t\tmax=count;\n\t\t\t\t}\n\t\t\t\tcount=0;\n\t\t\t}\n\t\t\telse\n\t\t\t\tcount++;\n\t\t}\n\t\tcount=0;\n\t\tfor(int j=0;j<Bracket.length();j++)\n\t\t{\n\t\t\tif(Bracket.charAt(j)=='_')\n\t\t\t{\n\t\t\t\tif(count>0) {\n\t\t\t\t\tmax2++;\n\t\t\t\t}\n\t\t\t\tcount=0;\n\t\t\t}\n\t\t\telse\n\t\t\t\tcount++;\n\t\t}\n\t\t\n\t\tSystem.out.println(max+\" \"+max2);\n\t}\n\n}", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "7264f825c7b1fe1c79d4f4f7719b0098", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class cf2 {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\n\t\tint t=sc.nextInt();\n\t\tsc.nextLine();\n\t\tint count=0;\n\t\tint flag=0;\n\t\tint max=0;\n\t\tint len=0;\n\t\tString str=sc.nextLine();\n\t\tfor(int i=0;i<t;i++)\n\t\t{\n\t\t\tflag=0;\n\t\t\tlen=0;\n\t\t\tif(str.charAt(i)=='_')\n\t\t\t\tcontinue;\n\t\t\telse if(str.charAt(i)=='(')\n\t\t\t{\n\t\t\t\ti++;\n\t\t\t\twhile(i<t && str.charAt(i)!=')')\n\t\t\t\t{\n\t\t\t\t\tif(i<t && str.charAt(i)!='_' && str.charAt(i)!=')')\n\t\t\t\t\t{\n\t\t\t\t\t\twhile(i<t && str.charAt(i)!='_' && str.charAt(i)!=')')\n\t\t\t\t\t\t\ti++;\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t\ti--;\n\t\t\t\t\t}\n\t\t\t\t\ti++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tif(i<t && str.charAt(i)!='_' && str.charAt(i)!='(' && str.charAt(i)!=')')\n\t\t\t\t{\n\t\t\t\t\twhile(i<t && str.charAt(i)!='_' && str.charAt(i)!='(' && str.charAt(i)!=')')\n\t\t\t\t\t{\n\t\t\t\t\t\tlen++;\n\t\t\t\t\t\ti++;\n\t\t\t\t\t}\n\t\t\t\t\tif(len>=max)\n\t\t\t\t\t\tmax=len;\n\t\t\t\t}\n\t\t\t\ti--;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(max+\" \"+count);\n\t}\n\n}", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "5eccdca97db42c5e3eb72230617a210d", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/* package whatever; // don't place package name! */\n\nimport java.util.*;\nimport java.lang.*;\nimport java.io.*;\n\n/* Name of the class has to be \"Main\" only if the class is public. */\npublic class Ideone\n{\n\tpublic static void main (String[] args) throws java.lang.Exception\n\t{\n\t\tScanner st=new Scanner (System.in);\n\t\tint l=st.nextInt(); char ch; String wd=\"\";\n\t\tint max=0,num=0;\n\t\tString s=st.next();\n\t\tint i,j=0;\n\t\tfor(i=0;i<l;i++)\n\t\t{\n\t\t\tch=s.charAt(i);\n\t\t\tif(ch=='(')\n\t\t\t{\n\t\t\tmax=(max>wd.length())?max:wd.length();\t\n\t\t\t\twd=\"\";\n\t\t\t\tj=1;\n\t\t\t}\n\t\t\telse if(ch==')'){\n\t\t\t\tif(wd.length()!=0)\n\t\t\t\tnum++;\n\t\t\tj=0;\n\t\t\twd=\"\";\n\t\t\t}\n\t\t\telse if(ch=='_')\n\t\t\t{\n\t\t\t\tif(j==1){\n\t\t\t\tif(wd.length()!=0)\n\t\t\t\tnum++;}\n\t\t\t\telse\n\t\t\t\tmax=(max>wd.length())?max:wd.length();\n\t\t\t\twd=\"\";\n\t\t\t}\n\t\t\telse{\n\t\t\twd=wd+ch;\n\t\t\tif(i==l-1)\n\t\t\tmax=(max>wd.length())?max:wd.length();\n\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(max+\" \"+num);\n\t\t}\n\t\t\n\t\t// your code goes here\n\t}\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "6cfffede52433b0eb5b8ff0dba855388", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// http://codeforces.com/problemset/problem/723/B\n\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Solution {\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner read = new Scanner(System.in);\n\n\t\tint n = read.nextInt();\n\t\t\n\t\tread.nextLine();\n\t\t\n\t\tString line = read.nextLine();\n\t\t\n\t\tStringBuilder lineWithoutParantheses = new StringBuilder();\n\t\t\n\t\tint numberOfWordsInParantheses = 0;\n\t\tint i = 0;\n\t\twhile (i < line.length()) {\n\t\t\tif (line.charAt(i) == '(') {\n\t\t\t\tlineWithoutParantheses.append(\"_\");\n\t\t\t\ti++;\n\t\t\t\tStringBuilder paranthesesWords = new StringBuilder();\n\t\t\t\twhile (line.charAt(i) != ')') {\n\t\t\t\t\tparanthesesWords.append(line.charAt(i));\n\t\t\t\t\ti++;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tString[] wordsInParantheses = paranthesesWords.toString().split(\"_\");\n\t\t\t\tfor (String word : wordsInParantheses) {\n\t\t\t\t\tif (!word.isEmpty()) {\n\t\t\t\t\t\tnumberOfWordsInParantheses++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tlineWithoutParantheses.append(line.charAt(i));\n\t\t\t}\n\t\t\ti++;\n\t\t}\n\t\t\n\t\tint maxWordWithoutParanthesesLength = 0;\n\t\tString[] wordsWithoutParantheses = lineWithoutParantheses.toString().split(\"_\");\n\t\t\n\t\tfor (String word : wordsWithoutParantheses) {\n\t\t\tif (!word.isEmpty() && word.length() > maxWordWithoutParanthesesLength) {\n\t\t\t\tmaxWordWithoutParanthesesLength = word.length();\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(maxWordWithoutParanthesesLength + \" \" + numberOfWordsInParantheses);\n\t\t\n\t\t// Close scanner\n\t\tread.close();\n\t}\n}", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "e910bda9bea4f637c49ad81c2f528ee0", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.regex.Matcher;\nimport java.util.stream.Stream;\nimport java.util.StringTokenizer;\nimport java.util.Optional;\nimport java.util.regex.Pattern;\nimport java.io.BufferedReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskB solver = new TaskB();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskB {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.nextInt();\n String input = in.next();\n String pattern = \"\\\\([\\\\w_]*\\\\)\";\n String[] outSite = input.split(pattern);\n int longest = 0;\n for (String s : outSite) {\n longest = Math.max(longest, longestWords(s));\n }\n Pattern r = Pattern.compile(pattern);\n Matcher m = r.matcher(input);\n long numberInside = 0;\n while (m.find()) {\n numberInside += Arrays.stream(trimParentheses(m.group()).split(\"_\")).filter(s -> !s.isEmpty()).count();\n }\n out.println(longest + \" \" + numberInside);\n }\n\n private int longestWords(String line) {\n return Arrays.stream(line.split(\"_\")).map(String::length).max(Integer::compare).orElse(0);\n }\n\n private String trimParentheses(String input) {\n String temp = input.substring(1, input.length());\n return temp.substring(0, temp.length() - 1);\n }\n\n }\n\n static class InputReader {\n private StringTokenizer tokenizer;\n private BufferedReader reader;\n\n public InputReader(InputStream inputStream) {\n reader = new BufferedReader(new InputStreamReader(inputStream));\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "d6eb731eb64cef2a304dbfdec5eb0d93", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\n\nimport java.util.Scanner;\nimport java.util.regex.MatchResult;\nimport java.util.regex.Matcher;\nimport java.util.regex.Pattern;\n\npublic class CF_723B {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tString s = sc.next();\n\t\t\n\t\t\n\t\tString regex = \"\\\\([a-zA-Z_]*\\\\)\";\n\t\tPattern pat = Pattern.compile(regex);\n\t\tMatcher mat = pat.matcher(s);\n\t\t\n\t\tString newString = mat.replaceAll(\"_\");\n\t\t\n\t\tString[] left = newString.split(\"_+\");\n\t\tint maxLength = 0;\n\t\tfor(int i = 0;i<left.length;i++){\n\t\t\tmaxLength = Math.max(maxLength,left[i].length());\n\t\t}\n\t\t\n\t\tSystem.out.println(maxLength);\n\t\tint count = 0;\n\t\tboolean isStart = false;\n\t\tint startIndex = -1;\n\t\tint endIndex = -1;\n\t\tfor(int i = 0;i<s.length();i++){\n\t\t\tchar c = s.charAt(i);\n\t\t\tif(c == '('){\n\t\t\t\tisStart = true;\n\t\t\t\tstartIndex = i;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(isStart){\n\t\t\t\tif(c == ')'){\n\t\t\t\t\tisStart = false;\n\t\t\t\t\tendIndex = i;\n\t\t\t\t\tString tmp = s.substring(startIndex+1,endIndex);\n\t\t\t\t\tif(tmp.equals(\"\"))\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tif(tmp.startsWith(\"_\")){\n\t\t\t\t\t\tString[] tmps = tmp.split(\"_+\");\n\t\t\t\t\t\tif(tmps.length!=0)\n\t\t\t\t\t\t\tcount+=(tmps.length-1);\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tcount+=tmps.length;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tString[] tmps = tmp.split(\"_+\");\n\t\t\t\t\t\tcount+=tmps.length;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "fa206ae735d44732f08783a9a4b6ceb8", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\t\t\t\t\t\t\timport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.InputMismatchException;\n\n\t\t\t\t\t\t\t\t\t\t\tpublic class Solution1 implements Runnable\n\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\tstatic final long MAX = 1000000007L;\n\t\t\t\t\t\t\t\t\t\t\t\tstatic class InputReader\n\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\tprivate InputStream stream;\n\t\t\t\t\t\t\t\t\t\t\t\t\tprivate byte[] buf = new byte[1024];\n\t\t\t\t\t\t\t\t\t\t\t\t\tprivate int curChar;\n\t\t\t\t\t\t\t\t\t\t\t\t\tprivate int numChars;\n\t\t\t\t\t\t\t\t\t\t\t\t\tprivate SpaceCharFilter filter;\n\t\t\t\t\t\t\t\t\t\t\t\t\tprivate BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\t\t\t\t\t\t\t\t\t\t\t \n\t\t\t\t\t\t\t\t\t\t\t\t\tpublic InputReader(InputStream stream)\n\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tthis.stream = stream;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\t\tpublic int read()\n\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tif (numChars==-1) \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tif (curChar >= numChars)\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcurChar = 0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\ttry \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tnumChars = stream.read(buf);\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcatch (IOException e)\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif(numChars <= 0)\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn -1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn buf[curChar++];\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t \n\t\t\t\t\t\t\t\t\t\t\t\t\tpublic String nextLine()\n\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tString str = \"\";\n\t\t\t\t\t\t\t\t\t\t\t try\n\t\t\t\t\t\t\t\t\t\t\t {\n\t\t\t\t\t\t\t\t\t\t\t str = br.readLine();\n\t\t\t\t\t\t\t\t\t\t\t }\n\t\t\t\t\t\t\t\t\t\t\t catch (IOException e)\n\t\t\t\t\t\t\t\t\t\t\t {\n\t\t\t\t\t\t\t\t\t\t\t e.printStackTrace();\n\t\t\t\t\t\t\t\t\t\t\t }\n\t\t\t\t\t\t\t\t\t\t\t return str;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tpublic int nextInt()\n\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tint c = read();\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\t\t\twhile(isSpaceChar(c)) \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tc = read();\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tint sgn = 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tif (c == '-') \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tsgn = -1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tc = read();\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tint res = 0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tdo \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif(c<'0'||c>'9') \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tres *= 10;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tres += c - '0';\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tc = read();\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\twhile (!isSpaceChar(c)); \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn res * sgn;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\t\tpublic long nextLong() \n\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tint c = read();\n\t\t\t\t\t\t\t\t\t\t\t\t\t\twhile (isSpaceChar(c))\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tc = read();\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tint sgn = 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tif (c == '-') \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tsgn = -1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tc = read();\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tlong res = 0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tdo \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tres *= 10;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tres += c - '0';\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tc = read();\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\twhile (!isSpaceChar(c));\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn res * sgn;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\t\tpublic double nextDouble() \n\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tint c = read();\n\t\t\t\t\t\t\t\t\t\t\t\t\t\twhile (isSpaceChar(c))\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tc = read();\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tint sgn = 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tif (c == '-') \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tsgn = -1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tc = read();\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tdouble res = 0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\twhile (!isSpaceChar(c) && c != '.') \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif (c == 'e' || c == 'E')\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn res * Math.pow(10, nextInt());\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tres *= 10;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tres += c - '0';\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tc = read();\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tif (c == '.') \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tc = read();\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tdouble m = 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\twhile (!isSpaceChar(c)) \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif (c == 'e' || c == 'E')\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn res * Math.pow(10, nextInt());\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tm /= 10;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tres += (c - '0') * m;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tc = read();\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn res * sgn;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\t\tpublic String readString() \n\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tint c = read();\n\t\t\t\t\t\t\t\t\t\t\t\t\t\twhile (isSpaceChar(c))\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tc = read();\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tStringBuilder res = new StringBuilder();\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tdo \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tres.appendCodePoint(c);\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tc = read();\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t} \n\t\t\t\t\t\t\t\t\t\t\t\t\t\twhile (!isSpaceChar(c));\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn res.toString();\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t \n\t\t\t\t\t\t\t\t\t\t\t\t\tpublic boolean isSpaceChar(int c) \n\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tif (filter != null)\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn filter.isSpaceChar(c);\n\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t \n\t\t\t\t\t\t\t\t\t\t\t\t\tpublic String next() \n\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn readString();\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\t\tpublic interface SpaceCharFilter \n\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tpublic boolean isSpaceChar(int ch);\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t \t\n\t\t\t\t\t\t\t\t\t\t\t\tpublic static void main(String args[]) throws Exception\n\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\tnew Thread(null, new Solution1(),\"Solution\",1<<26).start();\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\tpublic static int gcd(int a, int b)\n\t\t\t\t\t\t\t\t\t\t\t {\n\t\t\t\t\t\t\t\t\t\t\t if (a == 0)\n\t\t\t\t\t\t\t\t\t\t\t return b;\n\t\t\t\t\t\t\t\t\t\t\t \n\t\t\t\t\t\t\t\t\t\t\t return gcd(b%a, a);\n\t\t\t\t\t\t\t\t\t\t\t }\n\t\t\t\t\t\t\t\t\t\t\t\tint lcm(int a, int b)\n\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t return (a*b)/gcd(a, b);\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tpublic void run() \n\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\tInputReader sc= new InputReader(System.in);\n\t\t\t\t\t\t\t\t\t\t\t\t\tPrintWriter w= new PrintWriter(System.out);\n\t\t\t\t\t\t\t\t\t\t\t\t\tint n = sc.nextInt();\n\t\t\t\t\t\t\t\t\t\t\t\t\tString s = sc.next();\n\t\t\t\t\t\t\t\t\t\t\t\t\tint count1 = 0;\n\t\t\t\t\t\t\t\t\t\t\t\t\tint count2 = 0;\n\t\t\t\t\t\t\t\t\t\t\t\t\tchar[] ch = s.toCharArray();\n\t\t\t\t\t\t\t\t\t\t\t\t\tboolean flag = false;\n\t\t\t\t\t\t\t\t\t\t\t\t\tArrayList<Integer> ar= new ArrayList();\n\t\t\t\t\t\t\t\t\t\t\t\t\tString st = \"\";\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor(int i = 0;i < s.length();i++) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tif(Character.isLowerCase(ch[i]) || Character.isUpperCase(ch[i])) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tst += ch[i];\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}else {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif(st.length() == 0) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\telse if(flag) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount1++;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}else {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tar.add(st.length());\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tst = \"\";\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tif(ch[i] == '(') {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tflag = true;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t} if(ch[i] == ')') {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tflag = false;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tif(st.length() != 0) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tar.add(st.length());\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tCollections.sort(ar);\n\t\t\t\t\t\t\t\t\t\t\t\t\tif(ar.size() == 0) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tw.println(0 + \" \" + count1);\n\t\t\t\t\t\t\t\t\t\t\t\t\t}else\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tw.println(ar.get(ar.size()-1) + \" \" + count1);\n\t\t\t\t\t\t\t\t\t\t\t\t\tw.close(); \n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\tstatic class Pair implements Comparable<Pair>{\n\t\t\t\t\t\t\t\t\t\t\t\t\tlong x;\n\t\t\t\t\t\t\t\t\t\t\t\t\tlong y;\n\t\t\t\t\t\t\t\t\t\t\t\t\tlong z;\n\t\t\t\t\t\t\t\t\t\t\t\t\tint ind; \n\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\t\tPair(){}\t\n\t\t\t\t\t\t\t\t\t\t\t\t\tPair(long x,long y,long z,int ind){\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tthis.x = x;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tthis.y = y;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tthis.z = z;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tthis.ind = ind;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tpublic int compareTo(Pair p){\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tif(p.x == this.x) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn Long.compare(this.y,p.y);\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn Long.compare(this.x,p.x);\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t}", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "4dd541f15302ebf517f684997a7eafec", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class Main {\n\n\n\tpublic static int Num;\n\tpublic static String Line;\n\t\n\tpublic static void main(String[] args) {\n\t\t\n\t\t\tScanner buff = new Scanner(System.in); //new Scanner(new FileReader(\"/root/eclipse_workspace/java_workspace/codeforces/src/codeforces/C_723B.txt\"));\n\n\t\t\t\n\t\t\twhile(buff.hasNextLine()){\n\t\t\t\tString num = buff.nextLine();\n\t\t\t\tNum = Integer.parseInt(num);\n\t\t\t\tLine = buff.nextLine();\n\t\t\t\tchar[] Text = Line.toCharArray();\n\t\t\t\t\n\t\t\t\t\n\t\t\t\tint i, maxVal = 0, wordCount = 0, wordLen = 0;\n\t\t\t\tfor(i=0;i<Num;i++){\n\t\t\t\t\t\n\t\t\t\t\tif(Text[i]!='_'&& Text[i]!='('&&Text[i]!=')'){\n\t\t\t\t\t\twordLen++;\n\t\t\t\t\t}\n\t\t\t\t\telse if(Text[i]=='_'){\n\t\t\t\t\t\tif(wordLen>maxVal){\n\t\t\t\t\t\t\tmaxVal = wordLen;\n\t\t\t\t\t\t}\n\t\t\t\t\t\twordLen = 0;\n\t\t\t\t\t}\n\t\t\t\t\telse if(Text[i]=='('){\n\t\t\t\t\t\t\n\t\t\t\t\t\tif(wordLen>maxVal){\n\t\t\t\t\t\t\tmaxVal = wordLen;\n\t\t\t\t\t\t}\n\t\t\t\t\t\twordLen = 0;\n\t\t\t\t\t\t\n\t\t\t\t\t\ti++;\n\t\t\t\t\t\t\n\t\t\t\t\t\twhile(Text[i]!='\\0'){\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tif(Text[i]!='_'&& Text[i]!='('&&Text[i]!=')'){\n\t\t\t\t\t\t\t\twordLen++;\n\t\t\t\t\t\t\t\ti++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse if(Text[i]=='_'){\n\t\t\t\t\t\t\t\tif(wordLen!=0)\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\twordCount++;\n\t\t\t\t\t\t\t\t\t\twordLen = 0;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\ti++;\n\t\t\t\t\t\t\t\tif(Text[i]==')')\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse if(Text[i]==')')\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tif(wordLen!=0)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\twordCount++;\n\t\t\t\t\t\t\t\t\twordLen = 0;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t//\ti++;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(wordLen>maxVal){\n\t\t\t\t\tmaxVal = wordLen;\n\t\t\t\t}\n\t\t\t\twordLen = 0;\n\t\t\t\t\n\t\t\t\tSystem.out.println(maxVal + \" \" + wordCount);\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\n\t}\n\n}", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "d7df0818fd8c98509eaded5fb0b467f6", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package com.turtle.bone;\n\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class AK375 {\n\tpublic static Scanner cin = new Scanner(System.in);\t\n\tpublic String ak375(int n,String str){\t\t\n\t\tString[] arr=null;\n\t\tint i=0;\n\t\tint res1=0;\n\t\tint res2=0;\n\t\tStringBuffer tmpstr2 = new StringBuffer();\n\t\tStringBuffer tmpstr1 = new StringBuffer();\n\n\t\tfor(i=0;i<n;i++){\n\t\t\tif(str.charAt(i)=='('){\n\t\t\t\ttmpstr2.append(\"_\");\n\t\t\t\twhile(str.charAt(i+1)!=')'){\n//\t\t\t\t\tSystem.out.println(str.charAt(i+1));\n\t\t\t\t\ttmpstr2.append(str.charAt(i+1));\n\t\t\t\t\ti++;\n\t\t\t\t}\t\t \n\t\t\t}else if(str.charAt(i)==')'){\n\t\t\t\ttmpstr1.append(\"_\");\n\t\t\t}else{\n\t\t\t\ttmpstr1.append(str.charAt(i));\n\t\t\t}\n\t\t}\n\t\tString[] tmparrstr2=tmpstr2.toString().split(\"_\");\n\t\tList arrstr2=new ArrayList();\n\t\tfor(int k=0;k<tmparrstr2.length;k++){\n\t\t\tif(tmparrstr2[k]!=null && !tmparrstr2[k].equals(\"\")){\n\t\t\t\tarrstr2.add(tmparrstr2[k]);\n\t\t\t}\n\t\t}\t\t\n\t//\tSystem.out.println(\"tmpstr2:\"+tmpstr2.toString());\n\t\tres2=arrstr2.size();\n\t\tString[] arrstr1=tmpstr1.toString().split(\"_\");\n\t//\tSystem.out.println(\"tmpstr1:\"+tmpstr1.toString());\n\t\tfor(int j=0;j<arrstr1.length;j++){\n\t\t\tif(arrstr1[j].length()>res1){\n\t\t\t\tres1=arrstr1[j].length();\n\t\t\t}\t\t\t\n\t\t}\t\t\n\t\treturn res1+\" \"+res2;\n\t}\t\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\twhile (cin.hasNext()) {\n\t\t\tint n = cin.nextInt();\n\t\t\tString str = cin.next();\n long st=System.currentTimeMillis();\n String res=new AK375().ak375(n, str);\n long et=System.currentTimeMillis();\n // System.out.println(\"time:\"+(et-st));\n\n System.out.println(res);\n\n\t\t}\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "9a25717cfb117a6c137cf66380fff4aa", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\t\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tString s = sc.next();\n\t\t\n\t\t\n\t\tboolean insideBrackets = false;\n\t\tint countNoInside = 0, countMax = 0, wordSize = 0;\n\t\t\n\t\t\n\t\tfor(int i=0;i<s.length();i++){\n\t\t\t\n\t\t\tchar c = s.charAt(i);\n\t\t\t\n\t\t\tif(c!='(' && c!=')' && c!='_')\n\t\t\t\twordSize++;\n\t\t\tif(c == '('){\n\t\t\t\tcountMax = Math.max(countMax, wordSize);\n\t\t\t\twordSize = 0;\n\t\t\t\tinsideBrackets = true;\n\t\t\t}\n\t\t\t\t\n\t\t\tif(c == ')'){\n\t\t\t\tinsideBrackets = false;\n\t\t\t\tif(wordSize>0){\n\t\t\t\t\tcountNoInside++;\n\t\t\t\t\twordSize = 0;\n\t\t\t\t}\n\t\t\t\t\t\n\t\t\t}\n\t\t\tif(c == '_'){\n\t\t\t\tif(insideBrackets && wordSize>0)\n\t\t\t\t\tcountNoInside++;\n\t\t\t\telse if(c == '_' && !insideBrackets)\n\t\t\t\t\tcountMax = Math.max(countMax, wordSize);\n\t\t\t\twordSize = 0;\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t}\n\t\tcountMax = Math.max(countMax, wordSize);\n\t\tSystem.out.println(countMax + \" \" + countNoInside);\n\t\t\n\t}\n\t\n\tstatic class Scanner {\n\t\tStringTokenizer st;\n\t\tBufferedReader br;\n\n\t\tpublic Scanner(InputStream s){\tbr = new BufferedReader(new InputStreamReader(s));}\n\n\t\tpublic Scanner(FileReader r){\tbr = new BufferedReader(r);}\n\n\t\tpublic String next() throws IOException \n\t\t{\n\t\t\twhile (st == null || !st.hasMoreTokens()) \n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {return Integer.parseInt(next());}\n\n\t\tpublic long nextLong() throws IOException {return Long.parseLong(next());}\n\n\t\tpublic String nextLine() throws IOException {return br.readLine();}\n\n\t\tpublic double nextDouble() throws IOException { return Double.parseDouble(next()); }\n\n\t\tpublic boolean ready() throws IOException {return br.ready();}\n\n\n\t}\n\n}", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "be4c37d140eb4c4f6a3844483d106e6d", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\n/**\n * Created by naveen on 19-Dec-15.\n */\npublic class test {\n\n public static void main(String[] args) {\n\n Scanner scn = new Scanner(System.in);\n\n int n = Integer.parseInt(scn.nextLine());\n String ip = scn.nextLine();\n\n int wordCount = 0;\n int longestWord = 0;\n\n boolean insideBraces = false;\n\n StringBuilder stringBuilder = new StringBuilder(\"\");\n\n for (int i = 0; i < n; i++) {\n char ch = ip.charAt(i);\n\n if(ch == '_') {\n int wordLength = stringBuilder.length();\n\n if(wordLength > 0) {\n if(insideBraces) {\n wordCount++;\n }\n else {\n longestWord = Math.max(longestWord, wordLength);\n }\n }\n\n stringBuilder = new StringBuilder(\"\");\n }\n\n if(ch == '(') {\n int wordLength = stringBuilder.length();\n\n if(wordLength > 0) {\n if(insideBraces) {\n wordCount++;\n }\n else {\n longestWord = Math.max(longestWord, wordLength);\n }\n }\n\n stringBuilder = new StringBuilder(\"\");\n insideBraces = true;\n }\n\n if(ch == ')') {\n int wordLength = stringBuilder.length();\n\n if(wordLength > 0) {\n if(insideBraces) {\n wordCount++;\n }\n else {\n longestWord = Math.max(longestWord, wordLength);\n }\n }\n\n stringBuilder = new StringBuilder(\"\");\n insideBraces = false;\n }\n\n if((ch >= 'a' && ch <= 'z')\n || (ch >= 'A' && ch <= 'Z'))\n stringBuilder.append(ch);\n\n }\n\n int wordLength = stringBuilder.length();\n\n if(wordLength > 0) {\n if(insideBraces) {\n wordCount++;\n }\n else {\n longestWord = Math.max(longestWord, wordLength);\n }\n }\n\n System.out.println(longestWord + \" \" + wordCount);\n\n }\n\n}\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "fe314334eb0c0c53185255e47fd40c24", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\n\npublic class Prepare {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a;\n\t\ta = sc.nextInt();\n\t\tString in = sc.next();\n\t\tint len = 0;\n\t\tint tmp = 0;\n\t\tint count = 0;\n\t\tboolean bl = false;\n\t\tboolean prev = false;\n\t\tfor(int i = 0; i < in.length(); i++){\n\t\t\tif( ((96 < in.charAt(i) - 0) && (in.charAt(i) < 123)) || (in.charAt(i) > 64 && in.charAt(i) < 91)){\n\t\t\tif(bl && !prev)\n\t\t\t\tcount++;\n\t\t\tif(!bl)\n\t\t\tlen++;\n\t\t\tif(len > tmp)\n\t\t\t\ttmp = len;\n\t\t\tprev = true;\n\t\t\t}\n\t\t\t\n\t\t\telse if(in.charAt(i) == '_'){\n\t\t\t\tprev = false;\n\t\t\t\tif(len > tmp)\n\t\t\t\ttmp = len;\n\t\t\t\tlen = 0;\n\t\t\t\t}\n\n\t\t\telse if(in.charAt(i) == '('){\n\t\t\t\tprev = false;\n\t\t\t\tbl = true;\n\t\t\t\tif(len > tmp)\n\t\t\t\t\ttmp = len;\n\t\t\t\tlen = 0;\n\t\t\t}\n\t\t\telse if(in.charAt(i) == ')'){\n\t\t\t\tbl = false;\n\t\t\t\tprev = false;\n\t\t\t\tif(len > tmp)\n\t\t\t\t\ttmp = len;\n\t\t\t\tlen = 0;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(tmp+\" \"+count);\n\tsc.close();\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "3095a8f7079e50d1674a23a1da9b9b7c", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.BufferedOutputStream;\nimport java.io.BufferedReader;\nimport java.io.FileInputStream;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\n\n/**\n * Oct 3, 2016 | 12:28:10 PM\n * <pre>\n * <u>Description</u>\n *\n * </pre>\n *\n * @author Essiennta Emmanuel (colourfulemmanuel@gmail.com)\n */\npublic class ProblemB {\n \n private void solve(char[] a, PrintWriter out) {\n int i = 0;\n int one = 0;\n int two = 0;\n boolean insideParenthesis = false;\n while (i != a.length) {\n if (a[i] == '(') {\n insideParenthesis = true;\n } else if (a[i] == ')') {\n insideParenthesis = false;\n } else if (Character.isLetter(a[i]))\n i--;\n if (insideParenthesis) { // inside\n while (++i != a.length && a[i] != ')' && !Character.isLetter(a[i]));\n if (i == a.length || !Character.isLetter(a[i])) {\n continue;\n }\n while (Character.isLetter(a[++i]));\n two++;\n } else {\n while (++i != a.length && a[i] != '(' && !Character.isLetter(a[i]));\n if (i == a.length || !Character.isLetter(a[i])) {\n continue;\n }\n \n int j = i;\n while (++i != a.length && Character.isLetter(a[i]));\n one = Math.max(one, i - j);\n }\n }\n out.println(one + \" \" + two);\n }\n \n public static void main(String[] args) throws IOException {\n try (BufferedReader in = new BufferedReader(new InputStreamReader(args.length == 0 ? System.in : new FileInputStream(args[0])));\n PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out))) {\n in.readLine();\n new ProblemB().solve(in.readLine().toCharArray(), out);\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "8e0be53665d1215648f785bfef33a596", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/* package whatever; // don't place package name! */\n\nimport java.util.*;\nimport java.lang.*;\nimport java.io.*;\n\n/* Name of the class has to be \"Main\" only if the class is public. */\npublic class Ideone\n{\n\tpublic static void main (String[] args) throws java.lang.Exception\n\t{\n\t\t// your code goes here\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tString a = sc.next();\n\t\tboolean paren=false;\n\t\tint max = 0;\n\t\tint cnt = 0;\n\t\tint temp=0;\n\t\t\n\t\tfor(int i = 0 ;i < n;i++){\n\t\t if(a.charAt(i)=='_'){\n\t\t if(paren==true&&temp!=0){\n\t\t \t cnt++;\n\t\t temp = 0;\n\t\t }else{\n\t\t \t\n\t\t \tif(temp>max)\n\t\t \tmax = temp;\n\t\t temp = 0; \n\t\t }\n\t\t \t\n\t\t }else if(a.charAt(i)=='('){\n\t\t paren = true;\n\t\t \tif(temp>max)\n\t\t \tmax = temp;\n\t\t \ttemp =0;\n\t\t }else if(a.charAt(i)==')'){\n\t\t paren = false;\n\t\t if(temp>0){\n\t\t \tcnt++;\n\t\t \ttemp = 0;\n\t\t }\n\t\t \t\n\t\t }else{\n\t\t temp++;\t\n\t\t }\n\t\t\n\t\t\t\n\t\t}\n\t\tif(temp>max)\n\t\t \tmax = temp;\n\t\t\n\t\t\n\t\tSystem.out.println(max+\" \"+cnt);\n\t\t\n\t\t\n\t}\n}", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "65c9e84a756b978a40c501b2c4cff40b", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/**\n * Created by My PC on 03/10/2016.\n */\n\nimport java.util.*;\n\npublic class P2 {\n public static void main(String[] args) {\n Scanner input = new Scanner(System.in);\n int length = input.nextInt();\n input.nextLine();\n String str = input.nextLine();\n\n int maxLength = 0;\n int countLength = 0;\n int countWord = 0;\n int checker = 0;\n int checkerInside = 0;\n boolean isInWordOut = false;\n boolean isInWordIn = false;\n boolean isInside = false;\n\n int index = 0;\n\n while (index < length)\n {\n if (str.charAt(index) == '(')\n {\n isInside = true;\n checkerInside++;\n if (maxLength < countLength)\n maxLength = countLength;\n countLength = 0;\n isInWordOut = false;\n }\n else if (str.charAt(index) == ')')\n {\n isInside = false;\n checkerInside = 0;\n if (checker > 0)\n {\n countWord++;\n checker = 0;\n }\n }\n else\n {\n if (checkerInside > 0)\n {\n isInside = true;\n }\n }\n\n if (index == length)\n break;\n\n if (str.charAt(index) != ')' & str.charAt(index) != '(')\n {\n if (!isInside)\n {\n if (str.charAt(index) == '_')\n {\n if (maxLength < countLength)\n maxLength = countLength;\n countLength = 0;\n isInWordOut = false;\n }\n else isInWordOut = true;\n\n if (isInWordOut)\n {\n countLength++;\n }\n }\n else\n {\n isInWordOut = false;\n if (str.charAt(index) == '_')\n {\n if (checker > 0)\n countWord++;\n checker = 0;\n isInWordIn = false;\n }\n else isInWordIn = true;\n\n if(isInWordIn)\n {\n checker++;\n }\n }\n }\n\n index++;\n }\n\n if (maxLength < countLength)\n maxLength = countLength;\n\n System.out.println(maxLength + \" \" + countWord);\n\n }\n}\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "7fc3587055a0fdf8794c51cc1a65371a", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/* package codechef; // don't place package name! */\n\nimport java.util.*;\nimport java.lang.*;\nimport java.io.*;\n\n/* Name of the class has to be \"Main\" only if the class is public. */\npublic class Codechef\n{\n\tpublic static void main (String[] args) throws java.lang.Exception\n\t{\n\t\tScanner sc = new Scanner(System.in);\n\t\tString str;\n\t\tString len = sc.nextLine();\n\t\tString st = sc.nextLine();\n\t\t\n\t\tArrayList<String> in = new ArrayList<>();\n\t\tint i =0;\n\t\tint cnt= 0;\n\t\tint j =0;\n\t\tint maxl = 0;\n\t\twhile(i<st.lastIndexOf(')'))\n\t\t{\n\t\t \n\t\t //if(st.indexOf('(',i)==j)\n\t\t //j--;\n\t\t String s = st.substring(j,st.indexOf('(',i));\n\t\t \n\t\t StringTokenizer sto = new StringTokenizer(s,\"_\");\n\t\t while(sto.hasMoreTokens()){\n\t\t int l =sto.nextToken().length();\n\t\t if(l>maxl)\n\t\t maxl = l;\n\t\t }\n\t\t j = st.indexOf(')',j+1)+1;\n\t\t String inside = st.substring(st.indexOf('(',i)+1,st.indexOf(')',i+1));\n\t\t \n\t\t StringTokenizer sti = new StringTokenizer(inside,\"_\");\n\t\t while(sti.hasMoreTokens()){\n\t\t if(sti.nextToken()!=\"\")\n\t\t cnt++;\n\t\t }\n\t\t i = st.indexOf(')',i+1);\n\t\t \n\t\t \n\t\t}\n\t\t\n\t\t\n\t\tString s = st.substring(j);\n\t\t \n\t StringTokenizer sto = new StringTokenizer(s,\"_\");\n\t while(sto.hasMoreTokens()){\n\t int l =sto.nextToken().length();\n\t if(l>maxl)\n\t maxl = l;\n\t }\n\t System.out.println(maxl+\" \"+cnt);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "afa0e8989dd83d92fd6978b34b542594", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n \npublic class B {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t\tint n = ni();\n\t\tchar[] s = ns().toCharArray();\n\t\tboolean inner = false;\n\t\tint len = 0;\n\t\tint max1 = 0;\n\t\tint num2 = 0;\n\t\tfor(char c : s){\n\t\t\tif(c == '_'){\n\t\t\t\tif(inner){\n\t\t\t\t\tif(len > 0)num2++;\n\t\t\t\t}else{\n\t\t\t\t\tmax1 = Math.max(max1, len);\n\t\t\t\t}\n\t\t\t\tlen = 0;\n\t\t\t}else if(c == '('){\n\t\t\t\tif(inner){\n\t\t\t\t\tif(len > 0)num2++;\n\t\t\t\t}else{\n\t\t\t\t\tmax1 = Math.max(max1, len);\n\t\t\t\t}\n\t\t\t\tinner = true;\n\t\t\t\tlen = 0;\n\t\t\t}else if(c == ')'){\n\t\t\t\tif(inner){\n\t\t\t\t\tif(len > 0)num2++;\n\t\t\t\t}else{\n\t\t\t\t\tmax1 = Math.max(max1, len);\n\t\t\t\t}\n\t\t\t\tinner = false;\n\t\t\t\tlen = 0;\n\t\t\t}else{\n\t\t\t\tlen++;\n\t\t\t}\n\t\t}\n\t\tif(inner){\n\t\t\tif(len > 0)num2++;\n\t\t}else{\n\t\t\tmax1 = Math.max(max1, len);\n\t\t}\n\t\tout.println(max1 + \" \" + num2);\n\t}\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new B().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tprivate int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "c4a6139fd481fbf09dfba67fa1fcf11c", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\n\n import java.util.Scanner;\n\n\n public class JavaApplication1 {\n\n\n public static void main(String[] args) \n {\n\n Scanner sc=new Scanner(System.in);\n String s,ss=\"\";int i,flag=0,max=0;\n s=sc.nextLine();\n s=sc.nextLine();\n s=s.replaceAll(\"_+\", \" \").trim();\n for(i=0;i<s.length();i++)\n {\n if(s.charAt(i) == '(')\n flag=1;\n else if(s.charAt(i) == ')')\n {\n ss+=\" \";\n flag=0;\n }\n else if(flag == 1)\n ss+=s.charAt(i);\n }\n for(i=0;i<s.length();i++)\n if(s.charAt(i) == ')')\n {\n s=s.substring(0,s.indexOf(\"(\"))+\" \"+s.substring(i+1);\n i=0;\n }\n else if(s.charAt(i) == ')' && i == s.length()-1)\n {\n s=s.substring(0,s.indexOf(\"(\"));\n i=0;\n }\n s=s.replaceAll(\" +\", \" \").trim();\n ss=ss.replaceAll(\" +\",\" \").trim();\n String []out=s.split(\" \");\n String []in=ss.split(\" \");\n for(i=0;i<out.length;i++)\n {\n if(out[i].length() > max)\n max=out[i].length();\n }\n if(!ss.equals(\"\") && !ss.equals(\" \"))\n System.out.println(max+\" \"+in.length);\n else\n System.out.println(max+\" \"+\"0\");\n }\n}\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "f8bfc8165c8c7b196741bde838706a01", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class Words {\n\tpublic static void main(String[] args){\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tString str=sc.next();\n\t\tchar[] ch=str.toCharArray();\n\t\tint[] temp=new int[n];\n\t\tint count=0;\n\t\tint k=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\ttemp[i]=0;\n\t\t}\n\t\tint flag = 0;\n\t\tif(ch[0]=='_'){\n\t\t\tflag=0;\n\t\t}\n\t\telse if(ch[0]=='('){\n\t\t\tflag=1;\n\t\t}\n\t\tfor(int i=0;i<n;i++){\n\t\t\tif(flag==0){\n\t\t\t\tif(ch[i]=='_' ){\n\t\t\t\t\tk++;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tif(ch[i]!='('){\n\t\t\t\t\t\ttemp[k]++;\n\t\t\t\t\t}\n\t\t\t\t\telse if(ch[i]=='('){\n\t\t\t\t\t\tflag=1;\n\t\t\t\t\t\t\n\t\t\t\t\t}\n\t\t\t\t\telse if(ch[i]==')'){\n\t\t\t\t\t\tflag=0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse{\n\t\t\t\tif(ch[i]==')'){\n\t\t\t\t\tflag=0;\n\t\t\t\t\tk++;\n\t\t\t\t}\n\t\t\t\telse if(i>0){\n\t\t\t\t\t if(ch[i-1]=='('||ch[i-1]=='_'){\n\t\t\t\t\t\t if( ch[i]!='_' && ch[i]!='('){\n\t\t\t\t\t\t\t count++;\n\t\t\t\t\t }\n\t\t\t\t\t\t\n\t\t\t\t\t}\n\t\t\t\t\n\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\n\t\t\t}\n\t\t\t\n\t\t}\n\t\n\t\tint temp1;\n\t\t\n\t\tfor(int i=0;i<n;i++){\n\t\t\tfor(int j=i;j>0;j--){\n\t\t\t\tif(temp[j]>temp[j-1]){\n\t\t\t\t\ttemp1=temp[j];\n\t\t\t\t\ttemp[j]=temp[j-1];\n\t\t\t\t\ttemp[j-1]=temp1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(temp[0]);\n\t\tSystem.out.println(count);\n\t}\n}", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "0d993632d5daeade955b62d360151c2d", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\n\npublic class codeforces {\n\n public static int Binary(int x,int array[]){\n int min=0;\n int max=array.length-1;\n int mid=0;\n while(min<max){\n mid=(max+min)/2;\n if (array[mid]==x)return mid;\n if (x>array[mid])min=mid+1;\n if (x<array[mid])max=mid-1;\n \n \n \n }\n \n \n \n \n return 0;}\n \n public static void main(String[] args) throws IOException {\n Reader.init(System.in);\n int n=Reader.nextInt(),max=0,countw=0;\n String x=Reader.next();\n char ch[]=x.toCharArray();\n for (int i = 0; i < n; i++) {\n if(ch[i]!='_'&&ch[i]!='('){\n int count=0;\n for (int j = i; j < n; j++) { \n if(ch[j]!='_'&&ch[j]!='(')count++;\n if(ch[j]=='_'||ch[j]=='('||j==n-1){max=Math.max(max, count);i=j;count=0;break;}\n }\n \n \n }\n if (ch[i]=='('){int count=0;\n for (int j = i; j < n; j++) {\n if((ch[j]=='_'||ch[j]==')')&&count>0){countw++;count=0;}\n if(ch[j]==')'){i=j;break;}\n if(ch[j]!='_'&&ch[j]!='(')count++;\n \n }\n \n \n }\n \n }\n System.out.println(max+\" \"+countw);\n \n \n \n }\n \n}\n\n\n\nclass Reader {\n static BufferedReader reader;\n static StringTokenizer tokenizer;\n static void init(InputStream input) {\n reader = new BufferedReader(new InputStreamReader(input));\n tokenizer = new StringTokenizer(\"\");\n }\n static String next() throws IOException {\n while (!tokenizer.hasMoreTokens()) {\n tokenizer = new StringTokenizer(reader.readLine());\n }\n return tokenizer.nextToken();\n } \n static int nextInt() throws IOException {\n return Integer.parseInt(next());\n } \n static double nextDouble() throws IOException {\n return Double.parseDouble(next());\n } \n}\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "3a1f2d432b203f37edf1e4f16e84ba1c", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class Pb {\n\t\n\t\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\t\t\n\t\n\tScanner s = new Scanner(System.in);\n\tBufferedReader br= new BufferedReader (new InputStreamReader(System.in));\n\tArrayList<String > arr = new ArrayList<>();\n\tArrayList<Integer > ar = new ArrayList<>();\n\tint tam = Integer.parseInt(br.readLine());\n\tString cad= br.readLine();\n\tString word =\"\";\n\t\n\t\n\tint cont = 0, mayor=0;\n\tboolean flg= false;\n\t\n\t\n\tfor (int i = 0; i < tam; i++) {\n\t\t\n\t\tif(cad.charAt(i)=='('){\t\t\t\n\t\t\tif (cont >= mayor){\n\t\t\t\tmayor=cont;\n\t\t\t\tcont=0;\n\t\t\t}\n\t\t\tcont=0;\n\t\t\tflg=true;\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tif(cad.charAt(i)==')' ){\t\t\t\n\t\t\tflg=false;\t\n\t\t\tif(word!=\"\"){\n\t\t\t\tarr.add(word);\n\t\t\t\tword= \"\";\n\t\t\t}\n\t\t\tcontinue;\n\t\t\t\n\t\t}\n\t\telse if(flg==true && cad.charAt(i)!='_'){\n\t\t\tword+=cad.charAt(i);\n\t\t\tcontinue;\n\t\t\t\n\t\t}\n\t\t\n\t\telse if(flg== true && cad.charAt(i)=='_' && word!=\"\"){\n\t\t\tarr.add(word);\n\t\t\tword=\"\";\t\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\t\n\t\telse if(flg == false && cad.charAt(i)!='_'){\n\t\t\tcont++;\n\t\t\tif(i==(tam-1) && cont>= mayor){\n\t\t\t\tmayor=cont;\t\t\t\t\n\t\t\t}\n\t\t\tcontinue;\n\t\t\t\n\t\t}\n\t\telse if ( flg==false && cad.charAt(i)=='_'){\n\t\t\tif (cont >= mayor){\n\t\t\t\tmayor=cont;\n\t\t\t\tcont=0;\n\t\t\t}\n\t\t\tcont=0;\n\t\t}\n\t\t\n\t}\n\t//System.out.println(arr);\n\t\n\tSystem.out.println(mayor + \" \"+ arr.size());\n\t\n\t\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "552bcb8efc633ee07aa937795c1609f3", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author SeeZawL\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastReader in = new FastReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskB solver = new TaskB();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskB {\n public void solve(int testNumber, FastReader in, PrintWriter out) {\n int n = in.nextInt();\n String str = in.nextLine();\n boolean in_par = false, in_word = false;\n int word_cnt = 0, word_len = 0, max_len = 0;\n\n for (int i = 0; i < n; i++) {\n char c = str.charAt(i);\n if (in_word && (c == '_' || c == '(' || c == ')' || i == n - 1)) {\n in_word = false;\n if (!(c == '_' || c == '(' || c == ')')) {\n word_len++;\n }\n if (in_par) {\n word_cnt++;\n } else if (word_len > max_len) {\n max_len = word_len;\n }\n if (c == '(') {\n in_par = true;\n }\n if (c == ')') {\n in_par = false;\n }\n word_len = 0;\n } else if (!in_word && !(c == '_' || c == '(' || c == ')')) {\n in_word = true;\n word_len++;\n if (i == n - 1 && word_len > max_len) {\n max_len = word_len;\n }\n } else if (in_word) {\n word_len++;\n } else if (c == '(') {\n in_par = true;\n } else if (c == ')') {\n in_par = false;\n }\n }\n out.printf(\"%d %d\", max_len, word_cnt);\n }\n\n }\n\n static class FastReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public FastReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n String nextLine() {\n String str = \"\";\n try {\n str = reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n return str;\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "697295f72d1cb08efb4318b37c56cc22", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\n/**\n * Created by Sersh on 03.10.2016.\n */\npublic class lilu {\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int n = in.nextInt();\n int max_size = 0;\n int num_words = 0;\n int max_size1 = 0;\n int k = -1;\n int t = 0;\n int tmp_size = 0;\n int tmp_size1 = 0;\n boolean scob = false;\n String str = in.next();\n char [] arr = str.toCharArray();\n for(int i=0; i<n;i++){\n if(arr[i]=='(') {\n scob = true;\n k=1;\n if(tmp_size1!=0){\n max_size = Math.max(max_size,tmp_size1);\n tmp_size1 = 0;\n }\n //if(arr[i+1]!='_' && arr[i+1]!=')')\n // num_words++;\n }\n ///////////\n if(arr[i]==')') {\n scob = false;\n if(arr[i-1]!='_' && arr[i-1]!='(')\n /* if(k==-1 || (i>3 && arr[i-2]=='_' && (arr[i-3]=='_' || arr[i-3]=='(')))\n num_words++;\n*/\n\n k=-1;\n }\n ///////////////\n if(scob){\n /*if(arr[i]=='_' && arr[i-1]!='_'){\n if(arr[i-1]!='(' ) {//&& arr[i+1]!=')') {\n num_words++;\n k=1;\n }\n }*/\n if(t!=1) {\n if (arr[i] != '_' && arr[i] != '(' && arr[i] != ')') {\n //if(arr[i-1]!='(' && arr[i+1]!=')') {\n num_words++;\n t = 1;\n // }}\n }\n }\n if(arr[i] == '_' || arr[i] == '(' || arr[i] == ')')\n t=0;\n\n }\n else{\n if(arr[i]!='_' && arr[i]!=')' && arr[i]!='('){\n tmp_size1++;\n if(i==(n-1)){\n max_size = Math.max(max_size, tmp_size1);\n }\n }else{\n if(tmp_size1!=0) {\n max_size = Math.max(max_size, tmp_size1);\n tmp_size1 = 0;\n }\n }\n }\n }\n\n\n System.out.println(max_size+\" \"+num_words);\n }\n}\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "0d9a13e24f2dda84e21da747efea66d0", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\npublic class forces{\n/*\n public static class FastReader\n {\n BufferedReader br;\n StringTokenizer st;\n\n public FastReader()\n {\n br = new BufferedReader(new\n InputStreamReader(System.in));\n }\n\n String next()\n {\n while (st == null || !st.hasMoreElements())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt()\n {\n return Integer.parseInt(next());\n }\n\n long nextLong()\n {\n return Long.parseLong(next());\n }\n\n double nextDouble()\n {\n return Double.parseDouble(next());\n }\n\n String nextLine()\n {\n String str = \"\";\n try\n {\n str = br.readLine();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n return str;\n }\n }\n static class Reader\n {\n final private int BUFFER_SIZE = 1 << 16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n\n public Reader()\n {\n din = new DataInputStream(System.in);\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public Reader(String file_name) throws IOException\n {\n din = new DataInputStream(new FileInputStream(file_name));\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public String readLine() throws IOException\n {\n byte[] buf = new byte[64]; // line length\n int cnt = 0, c;\n while ((c = read()) != -1)\n {\n if (c == '\\n')\n break;\n buf[cnt++] = (byte) c;\n }\n return new String(buf, 0, cnt);\n }\n\n public int nextInt() throws IOException\n {\n int ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do\n {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n\n if (neg)\n return -ret;\n return ret;\n }\n\n public long nextLong() throws IOException\n {\n long ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n if (neg)\n return -ret;\n return ret;\n }\n\n public double nextDouble() throws IOException\n {\n double ret = 0, div = 1;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n\n if (c == '.')\n {\n while ((c = read()) >= '0' && c <= '9')\n {\n ret += (c - '0') / (div *= 10);\n }\n }\n\n if (neg)\n return -ret;\n return ret;\n }\n\n private void fillBuffer() throws IOException\n {\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1)\n buffer[0] = -1;\n }\n\n private byte read() throws IOException\n {\n if (bufferPointer == bytesRead)\n fillBuffer();\n return buffer[bufferPointer++];\n }\n\n public void close() throws IOException\n {\n if (din == null)\n return;\n din.close();\n }\n }\n static long power(long k){\n long t=k&1,count=0;\n while(k!=0){\n if(t==0)\n count++;\n k=k>>1;\n t=k&1;\n }\n return count;\n }*/\n static long largest_power(long N)\n {\n //changing all right side bits to 1.\n N = N| (N>>1);\n N = N| (N>>2);\n N = N| (N>>4);\n N = N| (N>>8);\n N = N| (N>>16);\n N = N| (N>>32);\n return (N+1)>>1;\n\n }\n public static void main (String args[]) throws IOException{\n //Reader in = new Reader();\n BufferedOutputStream out=new BufferedOutputStream(System.out);\n\n //BufferedReader in =new BufferedReader(new InputStreamReader(System.in));\n StringBuilder sb = new StringBuilder();\n Scanner in=new Scanner(System.in);\n int i,n=in.nextInt(),k=0,count=0;\n String z=in.next();\n int []ans=new int[2];\n for(i=0;i<n;i++){\n if(z.charAt(i)=='_'){\n if(count>ans[k]&&k==0)\n ans[k]=count;\n else if(k==1){\n if(count>0)\n ans[k]++;\n }\n count=0;\n }\n else if(z.charAt(i)=='('){\n k=1;\n if(count>ans[0])\n ans[0]=count;\n count=0;\n }\n else if(z.charAt(i)==')'){\n k=0;\n if(count>0)\n ans[1]++;\n count=0;\n }\n else{\n count++;\n }\n }\n if(count>ans[0]&&k==0)\n ans[0]=count;\n sb.append(ans[0]+\" \"+ans[1]+\"\\n\");\n //sb=sb.append(count);\n out.write(sb.toString().getBytes());\n\n out.flush();\n in.close();\n }\n}\nclass Reader {\n final private int BUFFER_SIZE = 1<<16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n\n public Reader() {\n din = new DataInputStream(System.in);\n bytesRead = bufferPointer = 0;\n buffer = new byte[BUFFER_SIZE];\n }\n\n public Reader(String filename) throws IOException {\n din = new DataInputStream(new FileInputStream(filename));\n bytesRead = bufferPointer = 0;\n buffer = new byte[BUFFER_SIZE];\n }\n\n private byte read() throws IOException{\n if (bufferPointer == bytesRead) {\n fillBuffer();\n }\n return buffer[bufferPointer++];\n }\n\n private void fillBuffer() throws IOException{\n bytesRead = din.read(buffer, bufferPointer = 0 , BUFFER_SIZE);\n if (bytesRead == -1) {\n buffer[0] = -1;\n }\n }\n\n public void close() throws IOException {\n if (din != null) {\n din.close();\n }\n }\n\n public String nextLine() throws IOException {\n byte[] buf = new byte[64];\n int cnt = 0;\n byte c;\n while (isWhiteSpace(c = read())) {}\n while (c != -1) {\n if (c == '\\n') {\n break;\n }\n buf[cnt++] = c;\n c = read();\n }\n return new String(buf, 0 , cnt);\n }\n public int nextLine(int size) throws IOException {\n int cnt = 0;\n byte c;\n while (isWhiteSpace(c = read())) {}\n for (int i = 0 ; i < size ; i++) {\n if (c == '0') {\n cnt++;\n }\n c = read();\n }\n return cnt;\n }\n\n public String next() throws IOException {\n byte[] buf = new byte[64];\n int cnt = 0;\n byte c;\n while (isWhiteSpace(c = read())) {}\n while (c != -1) {\n if (isWhiteSpace(c)) {\n break;\n }\n buf[cnt++] = c;\n c = read();\n }\n return new String(buf, 0 , cnt);\n }\n\n public String next(int size) throws IOException {\n byte[] buf = new byte[size];\n int cnt = 0;\n byte c;\n while (isWhiteSpace(c = read())) {}\n while (c != -1) {\n if (isWhiteSpace(c)) {\n break;\n }\n buf[cnt++] = c;\n c = read();\n }\n return new String(buf, 0 , cnt);\n }\n\n public boolean isWhiteSpace(byte n) {\n return (n == ' ' || n == '\\n' || n == '\\r' || n == '\\t');\n }\n\n public char nextChar() throws IOException {\n byte c = read();\n while (isWhiteSpace(c))\n c = read();\n return (char)c;\n }\n\n public int nextInt() throws IOException {\n int ret = 0;\n byte c = read();\n while (isWhiteSpace(c))\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n if (!(c >= '0' && c <= '9'))\n throw new InputMismatchException();\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <='9');\n if (neg)\n return -ret;\n return ret;\n }\n\n public long nextLong() throws IOException {\n long ret = 0;\n byte c = read();\n while (isWhiteSpace(c))\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n if (!(c >= '0' && c <= '9'))\n throw new InputMismatchException();\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <='9');\n if (neg)\n return -ret;\n return ret;\n }\n\n public double nextDouble() throws IOException {\n double ret = 0 , div = 1;\n byte c = read();\n while (isWhiteSpace(c))\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n\n if (c == '.') {\n while ((c = read()) >= '0' && c <= '9') {\n ret += (c - '0') / (div *= 10);\n }\n }\n\n if (neg)\n return -ret;\n return ret;\n }\n}\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "4c9c72f6aecaf11f4b184494eed211be", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.util.TreeSet;\n\npublic class B {\n\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tScanner sc = new Scanner(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tint n = sc.nextInt();\n\t\t\n\t\tint count=0;\n\t\tint max=0;\n\t\t\n\t\tint start=-1;\n\t\t\n\t\tboolean in=false;\n\t\t\tString s=sc.next();\n\t\t\tfor (int i = 0; i < s.length(); i++) {\n//\t\t\t\tSystem.out.println(start+\" \"+s.charAt(i)+\" \"+max +\" \"+count+\" \");\n\t\t\t\tif(s.charAt(i)=='_'){\n\t\t\t\t\n\t\t\t\t\tif(start!=i-1)\n\t\t\t\t\t\tif(in)\n\t\t\t\t\t\t\tcount++;\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tmax=Math.max(max, i-1-start);\n\t\t\t\t\t\n\t\t\t\t\tstart=i;\n\t\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(s.charAt(i)=='('){\n\t\t\t\t\tin=true;\n\t\t\t\t\tif(start!=i-1)\n\t\t\t\t\t\tmax=Math.max(max, i-1-start);\n\t\t\t\t\t\n\t\t\t\t\tstart=i;\n\t\t\t\t}\n\t\t\t\tif(s.charAt(i)==')'){\n\t\t\t\t\tin=false;\n\t\t\t\t\tif(start!=i-1)\n\t\t\t\t\t\tcount++;\n\t\t\t\t\tstart=i;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(start!=s.length()-1)\n\t\t\t\tmax=Math.max(max, s.length()-1-start);\n\t\t\tSystem.out.println(max+\" \"+count);\n\t\t\t\n\t\tout.flush();\n\t\tout.close();\n\t}\n\n\tstatic class Scanner {\n\t\tStringTokenizer st;\n\t\tBufferedReader br;\n\n\t\tpublic Scanner(InputStream s) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(s));\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\twhile (st == null || !st.hasMoreTokens())\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic long nextLong() throws IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic String nextLine() throws IOException {\n\t\t\treturn br.readLine();\n\t\t}\n\n\t\tpublic double nextDouble() throws IOException {\n\t\t\tString x = next();\n\t\t\tStringBuilder sb = new StringBuilder(\"0\");\n\t\t\tdouble res = 0, f = 1;\n\t\t\tboolean dec = false, neg = false;\n\t\t\tint start = 0;\n\t\t\tif (x.charAt(0) == '-') {\n\t\t\t\tneg = true;\n\t\t\t\tstart++;\n\t\t\t}\n\t\t\tfor (int i = start; i < x.length(); i++)\n\t\t\t\tif (x.charAt(i) == '.') {\n\t\t\t\t\tres = Long.parseLong(sb.toString());\n\t\t\t\t\tsb = new StringBuilder(\"0\");\n\t\t\t\t\tdec = true;\n\t\t\t\t} else {\n\t\t\t\t\tsb.append(x.charAt(i));\n\t\t\t\t\tif (dec)\n\t\t\t\t\t\tf *= 10;\n\t\t\t\t}\n\t\t\tres += Long.parseLong(sb.toString()) / f;\n\t\t\treturn res * (neg ? -1 : 1);\n\t\t}\n\n\t\tpublic boolean ready() throws IOException {\n\t\t\treturn br.ready();\n\t\t}\n\n\t}\n}", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "b501ea36a8f32292b7c4785c4773f612", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\npublic class B{\n\tpublic static void main(String args[]){\n\t\tScanner scan = new Scanner(System.in);\n\t\tchar c;\n\n\t\tboolean bracket = false, brackword = false;\n\t\tint prevWord = 0, inBrackets = 0, word = 0;\n\n\t\tint n = scan.nextInt();\n\t\tscan.nextLine();\n\t\tString in = scan.nextLine();\n\t\tfor(int i = 0; i < n; i++){\n\t\n\t\t\tc = in.charAt(i);\n\t\t\t\n\t\t\tif(c =='('){\n\t\t\t\tif(word > prevWord)\n\t\t\t\t\tprevWord = word;\n\t\t\t\tword = 0;\n\t\t\t\tbracket = true;\n\t\t\t}\n\t\t\telse if(c == ')'){\n\t\t\t\tbracket = false;\n\t\t\t\tif(brackword)\n\t\t\t\t\tinBrackets++;\n\t\t\t\tbrackword = false;\n\t\t\t}\n\t\t\telse if(c == '_'){\n\t\t\t\tif(word > prevWord)\n\t\t\t\t\tprevWord = word;\n\t\t\t\tword = 0;\n\t\t\t\tif(brackword){\n\t\t\t\t\tinBrackets++;\n\t\t\t\t\tbrackword = false;\n\t\t\t\t}\n\n\t\t\t}\n\t\t\telse{\n\t\t\t\tif(bracket)\n\t\t\t\t\tbrackword = true;\n\t\t\t\telse\n\t\t\t\t\tword++;\n\t\t\t}\n\t\t}\n\n\t\tif(word > prevWord)\n\t\t\tprevWord = word;\n\n\n\t\tSystem.out.println(prevWord + \" \" + inBrackets);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "b69844fc2768f78e56de53492b66cd38", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\npublic class Text_Document_Analysis\n{\n\tpublic static void main(String args[]) throws Exception\n\t{\n\t\tBufferedReader f=new BufferedReader(new InputStreamReader(System.in));\n\t\t// BufferedReader f=new BufferedReader(new FileReader(\"Text_Document_Analysis.in\"));\n\t\tf.readLine();\n\t\tString temp=f.readLine();\n\t\tString[] arr1=temp.split(\"\\\\([a-zA-Z_]*\\\\)\");\n\t\tint one=0;\n\t\tfor(int x=0;x<arr1.length;x++)\n\t\t{\n\t\t\tString[] temparr=arr1[x].split(\"_+\");\n\t\t\tfor(int y=0;y<temparr.length;y++)\n\t\t\t\tone=Math.max(one,temparr[y].length());\n\t\t}\n\t\tint pos=0;\n\t\tint two=0;\n\t\tboolean flag=false;\n\t\tboolean flag1=false;\n\t\tfor(int x=0;x<temp.length();x++)\n\t\t{\n\t\t\tif(temp.charAt(x)=='(')\n\t\t\t\tflag=true;\n\t\t\tif(temp.charAt(x)==')')\n\t\t\t{\n\t\t\t\tflag1=false;\n\t\t\t\tflag=false;\n\t\t\t}\n\t\t\tif(flag&&temp.substring(x,x+1).matches(\"[a-zA-Z]\"))\n\t\t\t{\n\t\t\t\tif(flag1) continue;\n\t\t\t\ttwo++;\n\t\t\t\tflag1=true;\n\t\t\t}\n\t\t\tif(temp.substring(x,x+1).matches(\"_\"))\n\t\t\t\tflag1=false;\n\t\t}\n\t\tSystem.out.println(one+\" \"+two);\n\t}\n}", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "4151c871d2d009f8d5519372bd2fefb6", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package CF;\n\nimport java.io.BufferedReader;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class B {\n public static void main(String[] args) throws Exception\n {\n\tScanner bf = new Scanner(System.in);\n\tPrintWriter out = new PrintWriter(System.out);\n\tint n = bf.nextInt();\n\tString s = bf.next();\n\tchar [] c = s.toCharArray();\n\tint ins = 0, lon = 0;\n\tint len = 0;\n\tfor (int i = 0; i < c.length; i++)\n\t{\n\t if(c[i] == '('){\n\t\tif(len > 0)\n\t\t lon = Math.max(lon, len);\n\t\tlen = 0;\n\t\ti++;\n\t\twhile(i < c.length && c[i] != ')'){\n\t\t if(c[i] == '_'){\n\t\t\tif(len > 0)\n\t\t\t ins++;\n\t\t\tlen = 0;\n\t\t }\n\t\t else len++;\n\t\t i++;\n//\t\t out.println(i+\" \"+len+\" \"+ins);\n\n\t\t}\n\t\tif(len > 0)\n\t\t ins++;\n\t\tlen = 0;\n\t }\n\t else if(c[i] == '_'){\n\t\tif(len > 0)\n\t\t lon = Math.max(lon, len);\n\t\tlen = 0;\n\t }\n\t else len++;\n//\t out.println(i+\" \"+len+\" \"+ins);\n\t}\n\tif(len > 0)\n\t lon = Math.max(lon, len);\n\tout.println(lon + \" \" + ins);\n\tout.flush();\n\tout.close();\n }\n\n static class Scanner {\n\tStringTokenizer st;\n\tBufferedReader br;\n\n\tpublic Scanner(InputStream s)\n\t{\n\t br = new BufferedReader(new InputStreamReader(s));\n\t}\n\n\tpublic Scanner(FileReader fileReader)\n\t{\n\t br = new BufferedReader(fileReader);\n\t}\n\n\tpublic String next() throws IOException\n\t{\n\t while (st == null || !st.hasMoreTokens())\n\t\tst = new StringTokenizer(br.readLine());\n\t return st.nextToken();\n\t}\n\n\tpublic int nextInt() throws IOException\n\t{\n\t return Integer.parseInt(next());\n\t}\n\n\tpublic long nextLong() throws IOException\n\t{\n\t return Long.parseLong(next());\n\t}\n\n\tpublic String nextLine() throws IOException\n\t{\n\t return br.readLine();\n\t}\n\n\tpublic boolean ready() throws IOException\n\t{\n\t return br.ready();\n\t}\n }\n}\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "2fc43a1c95b67ad0f65dd9079a2f949f", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\npublic static void main(String args[]) {\n\tScanner s=new Scanner(System.in);\n\tint n=s.nextInt();\n\tString inp=s.next();\n\t//inp=inp.replaceAll(\"_\",\" \");\n\t//String ss[]=inp.split(\"_\");\n\t//System.out.println(Arrays.toString(ss));\n//System.out.println(inp);\n\tint maxl=-1,curl=0;\nfor(int i=0;i<n;i++){\n\tif(inp.charAt(i)=='_'){if(curl>maxl)maxl=curl;curl=0;continue;}\n\telse if(inp.charAt(i)!='(' && inp.charAt(i)!=')'){curl++;}\n\telse{\n\t\tif(curl>maxl)maxl=curl;\n\t\tcurl=0;\n\t\ti++;while(inp.charAt(i)!=')')i++;\n\t\n\t}\n\t//if(curl>maxl)maxl=curl;\n}\nif(curl>maxl)maxl=curl;\nint numwrd=0;curl=0;\nfor(int i=0;i<n;i++){\n\twhile(i<n && inp.charAt(i)!='('){i++;}\n\tif(i==n)break;\n\ti++;\n\twhile(inp.charAt(i)!=')'){\n\t\tif(inp.charAt(i)=='_'){if(curl>0)numwrd++;curl=0;}\n\t\telse if(inp.charAt(i)!='_'){curl++;}\n\t\ti++;\n\t}\n\tif(curl>0)numwrd++;\ncurl=0;\n}\n\nSystem.out.println(maxl+\" \"+numwrd);\n\n\n}\n}\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "87f95aa72136fbc11beb1b877fe08f47", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class Test {\n\n\tpublic static void main(String[] args) {\n\t\tArrayList<String> arr1 = new ArrayList<>();\n\t\tArrayList<String> arr2 = new ArrayList<>();\n\t\tScanner in = new Scanner(System.in);\n\t\tint n, flag = 0;\n\t\tn = in.nextInt();\n\t\tString s = \"\", str = in.next();\n\t\tstr += \"^\";\n\t\tn++;\n\t\tchar[] input = new char[256];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tinput[i] = str.charAt(i);\n\t\t}\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (input[i] == '(') {\n\t\t\t\tflag = 1;\n\t\t\t\tinput[i] = '^';\n\t\t\t\tcontinue;\n\t\t\t} else if (input[i] == ')') {\n\t\t\t\tflag = 0;\n\t\t\t\tarr2.add(s);\n\t\t\t\tinput[i] = '^';\n\t\t\t\ts = \"\";\n\t\t\t}\n\t\t\tif (flag == 1) {\n\t\t\t\ts += input[i];\n\t\t\t\tinput[i] = '^';\n\t\t\t}\n\t\t}\n\t\ts = \"\";\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (input[i] == '^') {\n\t\t\t\tif (s.isEmpty() == true)\n\t\t\t\t\tcontinue;\n\t\t\t\tarr1.add(s);\n\t\t\t\ts = \"\";\n\t\t\t} else\n\t\t\t\ts += input[i];\n\t\t}\n\t\tint max = 0;\n\t\tint count = 0;\n\t\tfor (int i = 0; i < arr1.size(); i++) {\n\t\t\tString temp = arr1.get(i);\n\t\t\ttemp += \"_\";\n\t\t\tfor (int j = 0; j < temp.length(); j++) {\n\t\t\t\tif (Character.isLetter(temp.charAt(j)) == true) {\n\t\t\t\t\tcount++;\n\t\t\t\t} else if (temp.charAt(j) == '_') {\n\t\t\t\t\tmax = Math.max(max, count);\n\t\t\t\t\tcount = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcount = 0;\n\t\tfor (int i = 0; i < arr2.size(); i++) {\n\t\t\tString temp = arr2.get(i);\n\t\t\ttemp += \"_\";\n\t\t\tString m = \"\";\n\t\t\tfor (int j = 0; j < temp.length(); j++) {\n\t\t\t\tif (Character.isLetter(temp.charAt(j)) == true) {\n\t\t\t\t\tm += temp.charAt(j);\n\t\t\t\t} else if (temp.charAt(j) == '_' && m.isEmpty() == false) {\n\t\t\t\t\tm = \"\";\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(max + \" \" + count);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "ddb1ef396ef242152b31e0e107c8564a", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedWriter;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\nimport java.io.Writer;\nimport java.util.ArrayList;\nimport java.util.InputMismatchException;\n \n\npublic class Second {\n\n public static void main(String[] args) throws Exception\n {\n \tint n=i();\n \tString st=s();\n char[] c=st.toCharArray();\n int a1=0,a2=0;\n StringBuilder sb=new StringBuilder();\n StringBuilder sb2=new StringBuilder();\n for( int i=0 ; i<n ; i++ ){\n \t\n \tif( c[i]=='(' ){\n \t\tsb.append(\"_\");\n \t\ti++;\n \t\twhile( i<n && c[i]!=')' ){\n \t\t\tsb2.append(c[i]);\n \t\t\ti++;\n \t\t}\n \t\tsb2.append(\"_\");\n \t}\n \telse if( i<n ){\n \t\tsb.append(c[i]);\n \t}\n }\n String[] s=sb.toString().split(\"_\");\n for( int i=0 ; i<s.length ; i++ ){\n \ta1=Math.max(a1, s[i].length());\n }\n s=sb2.toString().split(\"_\");\n for( int i=0 ; i<s.length ; i++ ){\n \tif( s[i].length()>0 ) a2++;\n }\n out.println(a1+\" \"+a2);\n out.close();\n \n }\n \n \t\n \t\n static InputReader in = new InputReader(System.in);\n static OutputWriter out = new OutputWriter(System.out);\n \n static int i()\n {\n \treturn in.readInt();\n }\n \n static long l()\n {\n \treturn in.readLong();\n }\n \n static double d()\n {\n \treturn in.readDouble();\n }\n \n static String s()\n {\n \treturn in.readString();\n }\n \n static void Iarr( int[] array, int no )\n {\n \tfor( int i=0 ; i<no ; i++ )\n \t{\n \t\tarray[i] = i(); \n \t}\n }\n \n static void Larr( long[] array, int no )\n {\n \tfor( int i=0 ; i<no ; i++ )\n \t{\n \t\tarray[i] = l(); \n \t}\n }\n \n static void Darr( double[] array, int no )\n {\n \tfor( int i=0 ; i<no ; i++ )\n \t{\n \t\tarray[i] = d(); \n \t}\n }\n \n static void Sarr( String[] array, int no )\n {\n \tfor( int i=0 ; i<no ; i++ )\n \t{\n \t\tarray[i] = s(); \n \t}\n }\n \n private static class InputReader\n {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private SpaceCharFilter filter;\n \n public InputReader(InputStream stream)\n {\n this.stream = stream;\n }\n \n \n \n \n \n \n \n public int read()\n {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars)\n {\n curChar = 0;\n try\n {\n numChars = stream.read(buf);\n } catch (IOException e)\n {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n \n public int readInt()\n {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-')\n {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do\n {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n \n public String readString()\n {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do\n {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n public double readDouble() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, readInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, readInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n public long readLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n public boolean isSpaceChar(int c)\n {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n \n public String next()\n {\n return readString();\n }\n \n public interface SpaceCharFilter\n {\n public boolean isSpaceChar(int ch);\n }\n }\n \n private static class OutputWriter\n {\n private final PrintWriter writer;\n \n public OutputWriter(OutputStream outputStream)\n {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n \n public OutputWriter(Writer writer)\n {\n this.writer = new PrintWriter(writer);\n }\n \n public void print(Object... objects)\n {\n for (int i = 0; i < objects.length; i++)\n {\n if (i != 0)\n writer.print(' ');\n writer.print(objects[i]);\n }\n }\n \n public void println(Object... objects)\n {\n print(objects);\n writer.println();\n }\n \n public void close()\n {\n writer.close();\n }\n \n public void flush()\n {\n writer.flush();\n }\n }\n}", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "5fa73a5818e5f708440cf44f1ba54ead", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.BufferedReader;\nimport java.io.File;\nimport java.io.FileNotFoundException;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) throws IOException {\n Reader.init(System.in); \n int n = Reader.nextInt() ; \n String s = Reader.next().replaceAll(\"_+\",\" \") ; \n StringBuilder fuck = new StringBuilder() ; \n for (int i=0 ; i<s.length() ; i++) {\n if (s.charAt(i)=='(') {\n fuck.append(\" ( \");\n }else if (s.charAt(i)==')') {\n fuck.append(\" ) \");\n } else {\n fuck.append(s.charAt(i));\n }\n }\n s = fuck+\"\" ; \n String [] a = s.split(\" +\");\n boolean is = false ; \n int max = 0 , c = 0; \n for (int i=0 ; i<a.length ; i++) {\n if (a[i].contains(\"(\")) {\n is = true;\n } else if (a[i].contains(\")\")) {\n is = false ; \n } else if (a[i].contains(\")\")==false && a[i].contains(\"(\")==false){\n if (is){\n c ++ ;\n } else {\n max = Math.max(a[i].length(),max);\n }\n \n }\n }\n System.out.println(max + \" \"+ c);\n \n \n } \n \n\n}\nclass Pair {\n int x ; \n int y ; \n \n Pair (int x , int y) {\n this.x = x ;\n this.y = y ; \n }\n}\nclass Reader {\n \n static BufferedReader reader;\n static StringTokenizer tokenizer;\n \n public static int pars(String x) {\n int num = 0;\n int i = 0;\n if (x.charAt(0) == '-') {\n i = 1;\n }\n for (; i < x.length(); i++) {\n num = num * 10 + (x.charAt(i) - '0');\n }\n \n if (x.charAt(0) == '-') {\n return -num;\n }\n \n return num;\n }\n \n static void init(InputStream input) {\n reader = new BufferedReader(\n new InputStreamReader(input));\n tokenizer = new StringTokenizer(\"\");\n }\n \n static void init(FileReader input) {\n reader = new BufferedReader(input);\n tokenizer = new StringTokenizer(\"\");\n }\n \n static String next() throws IOException {\n while (!tokenizer.hasMoreTokens()) {\n tokenizer = new StringTokenizer(\n reader.readLine());\n }\n return tokenizer.nextToken();\n }\n \n static int nextInt() throws IOException {\n return pars(next());\n }\n \n static long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n \n static double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n }\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "4aecabd842d1b7d84ad221fac47f5c76", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\npublic class p723b{\n\tpublic static void main(String []args){\n\t\tScanner in = new Scanner(System.in);\n\t\tint n = in.nextInt();\n\t\tString s = in.next();\n\t\tint lw,wi,w,j;\n\t\tboolean _in=false;\n\t\tlw=wi=w=0;\n\t\tj=-1;\n\t\tfor(int i=0;i<s.length();i++){\n\t\t\tchar c=s.charAt(i);\n\t\t\tif(c=='_' && !_in && lw<i-j-1){\n\t\t\t\tlw = i-j-1;\n\t\t\t}\n\t\t\tif(c=='_' && _in && i-j>1){\n\t\t\t\twi++;\n\t\t\t}\n\t\t\tif(c=='('){\n\t\t\t\t_in = true;\n\t\t\t\tif(lw<i-j-1)lw=i-j-1;\n\t\t\t}\n\t\t\tif(c==')'){\n\t\t\t\t_in = false;\n\t\t\t\tif(i-j>1)wi++;\n\t\t\t}\n\t\t\tif(c=='_' || c=='(' || c ==')')\n\t\t\t\tj=i;\n\t\t}\n\t\tif(lw<s.length()-j-1)lw=s.length()-j-1;\n\t\tSystem.out.println(lw+\" \"+wi);\n\t}\n}\t\t\t\t", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "0c67cd19f80c79e4e4c89471e6b25f85", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\n/**\nThanks to Valeh :D\n */\n\npublic class TextDocumentAnalysis {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n String s = sc.next();\n s.toLowerCase();\n int maxL = -1;\n int nwi = 0;\n int fp = 0;\n int fw = 0;\n for(int i=0;i<n;i++){\n char c = s.charAt(i);\n if(c == '(') {fp++;fw=0;}\n else if(c == ')') {\n if(fp == 1 && fw != 0) nwi++;\n fp--;fw=0;\n }\n else if(c == '_') {\n if(fp == 1 && fw != 0) nwi++;\n fw=0;\n }\n else {\n fw++;\n }\n if(fp==0) maxL = Math.max(fw, maxL);\n }\n System.out.println(maxL + \" \" + nwi);\n }\n}\n\n//_Hello_Vasya(and_Petya)__bye_(and_OK)", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "08751ca0ce71a796349bee27af75d200", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/*\n * CODRE: ATIKUR RAHMAN\n * DATE: 29/10/2016\n * \n * */\n\nimport java.util.Scanner;\n\npublic class P_B_Text_Document_Analysis {\n\tstatic int outMax, inMax, count = 0;\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner scanner = new Scanner(System.in);\n\n\t\tint stringLen = scanner.nextInt();\n\n\t\tString text = scanner.next();\n\n\t\tscanner.close();\n\t\tint i = 0;\n\n\t\ttry {\n\t\t\twhile (true) {\n\n\t\t\t\tif (text.charAt(i) == '(') {\n\t\t\t\t\twhile (true) {\n\t\t\t\t\t\tint c=0;\n\t\t\t\t\t\t\twhile (text.charAt(i) != '_' && text.charAt(i)!=')' && text.charAt(i)!='(') {\n\t\t\t\t\t\t\t\tif (c==0) {\n\t\t\t\t\t\t\t\t\tinMax++;\n\t\t\t\t\t\t\t\t\tc++;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\ti++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\tif (text.charAt(i)==')') {\n\t\t\t\t\t\t\tcount=0;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcount=0;\n\t\t\t\t\t\ti++;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\twhile (true) {\n\t\t\t\t\t\t\n\t\t\t\t\t\t\twhile (text.charAt(i) != '_' && text.charAt(i)!=')' && text.charAt(i)!='(') {\n\t\t\t\t\t\t\t\tcount++;\n\t\t\t\t\t\t\t\ti++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\tif (outMax < count) {\n\t\t\t\t\t\t\toutMax = count;\n\t\t\t\t\t\t\tcount = 0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t\n\t\t\t\t\t\tif (text.charAt(i)=='(') {\n\t\t\t\t\t\t\tcount=0;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcount=0;\n\t\t\t\t\t\ti++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t} catch (Exception e) {\n\n\t\t}finally{\n\t\t\tif (outMax < count) {\n\t\t\t\toutMax = count;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.print(outMax + \" \" + inMax);\n\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "51a1700e4ca1b068bbcd74f2fb0105e0", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author SeeZawL\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastReader in = new FastReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskB solver = new TaskB();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskB {\n public void solve(int testNumber, FastReader in, PrintWriter out) {\n int n = in.nextInt();\n String str = in.nextLine() + \"_\";\n boolean in_par = false, in_word = false;\n int word_cnt = 0, word_len = 0, max_len = 0;\n\n for (int i = 0; i <= n; i++) {\n char c = str.charAt(i);\n if (in_word && (c == '_' || c == '(' || c == ')')) {\n in_word = false;\n if (in_par) {\n word_cnt++;\n } else if (word_len > max_len) {\n max_len = word_len;\n }\n if (c == '(') {\n in_par = true;\n }\n if (c == ')') {\n in_par = false;\n }\n word_len = 0;\n } else if (!in_word && !(c == '_' || c == '(' || c == ')')) {\n in_word = true;\n word_len++;\n } else if (in_word) {\n word_len++;\n } else if (c == '(') {\n in_par = true;\n } else if (c == ')') {\n in_par = false;\n }\n }\n out.printf(\"%d %d\", max_len, word_cnt);\n }\n\n }\n\n static class FastReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public FastReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n String nextLine() {\n String str = \"\";\n try {\n str = reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n return str;\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "27889e36f23277cf95ef713adeb3dd0e", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.Scanner;\nimport java.lang.*;\n\npublic class cf723b {\n\t\n\tstatic final Scanner sc = new Scanner(System.in);\n\tstatic int[] documentAnalyser(String doc) {\n\t\tboolean insideParenthesis = false;\n\t\tboolean lastWasLetter = false;\n\t\t\n\t\tint longestLength = 0;\n\t\tint wordLength = 0;\n\t\t\n\t\tint wordsInParentheses = 0;\n\t\t\n\t\tfor (int i = 0; i < doc.length(); ++i) {\n\t\t\tif (doc.charAt(i) == '(') {\n\t\t\t\tinsideParenthesis = true;\n\t\t\t\tlastWasLetter = false;\n\t\t\t\twordLength = 0;\n\t\t\t}\n\t\t\telse if (doc.charAt(i) == ')') {\n\t\t\t\tinsideParenthesis = false;\n\t\t\t\tlastWasLetter = false;\n\t\t\t\twordLength = 0;\n\t\t\t}\n\t\t\telse if (Character.isLetter(doc.charAt(i))) {\n\t\t\t\tif (insideParenthesis && !lastWasLetter) {\n\t\t\t\t\twordsInParentheses += 1;\n\t\t\t\t}\n\t\t\t\telse if (!insideParenthesis) {\n\t\t\t\t\twordLength += 1;\n\t\t\t\t\tlongestLength = Math.max(wordLength, longestLength);\n\t\t\t\t}\n\t\t\t\tlastWasLetter = true;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tlastWasLetter = false;\n\t\t\t\twordLength = 0;\n\t\t\t}\t\n\t\t}\n\t\tint[] valuesOfInterest = {longestLength, wordsInParentheses};\n\t\treturn valuesOfInterest;\n\t}\n\tpublic static void main(String[] args) {\n\t\tint stringLength = sc.nextInt();\n\t\tString doc = sc.next();\n\t\tint[] analysis = new int[2];\n\t\tanalysis = documentAnalyser(doc);\n\t\tSystem.out.print(analysis[0] + \" \" + analysis[1]);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "eb5e1b28e8be64b9fb444e7296470c27", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\npublic class TextEditing{\n public static int maxLength(String s){\n String t=\"\";\n boolean f=false;\n char ch;\n for(int i=0;i<s.length();i++){\n ch=s.charAt(i);\n if(ch=='(')\n f=true;\n else if(ch==')')\n {f=false;t+=\"_\";}\n if(!f && ch!=')')\n t+=ch;\n }\n //System.out.println(\"t is \"+t);\n String arr[]=t.split(\"_\");\n int max=0;\n for(int i=0;i<arr.length;i++)\n max=Math.max(max,arr[i].length());\n return max;\n }\n public static int count(String s){\n String arr[]=s.split(\"_\");\n int m=0;\n for(int i=0;i<arr.length;i++){\n if(arr[i].length()!=0)\n m++;\n }\n return m;\n }\n public static int words(String s){\n int c=0;\n String t=\"\";\n boolean f=false;\n for(int i=0;i<s.length();i++){\n char ch=s.charAt(i);\n if(ch=='(')\n f=true;\n else if(ch==')'){\n f=false;\n c+=count(t);\n t=\"\";\n }\n if(f && ch!='(')\n t+=ch;\n }\n return c;\n }\n public static void main(String[] args) {\n Scanner sc=new Scanner(System.in);\n int n=sc.nextInt();\n String s=sc.next();\n System.out.println(maxLength(s)+\" \"+words(s));\n }\n}", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "dd8cc728731ceffd3d5691badee1d7e1", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.*;\nimport java.util.*;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tString s=sc.next();\n\t\tint flag1=0;\n\t\tint flag2=0;\n\t\tint flag3=0;\n\t\tint max=-1;\n\t\tint cur=0;\n\t\tint cur2=0;\n\t\tint number=0;\n\t\tboolean start=false;\n\t\tfor(int i=0;i<n;i++){\n\t\t\t\n\t\t\tif(flag2==0){\n\t\t\t\tif(isAlpha(s.charAt(i))){\n\t\t\t\t\tcur++;\n\t\t\t\t\t//System.out.println(cur);\n\t\t\t\t}\n\t\t\t\tif(cur>0&&s.charAt(i)=='_'){\n\t\t\t\t\tmax=Math.max(max, cur);\n\t\t\t\t\tcur=0;\n\t\t\t\t}\n\t\t\t\tif(cur>0&&s.charAt(i)=='('){\n\t\t\t\t\tmax=Math.max(max, cur);\n\t\t\t\t\tcur=0;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t}\n\t\t if(flag2==1){\n\t\t \tif(isAlpha(s.charAt(i))){\n\t\t \t\tcur2++;\n\t\t \t}\n\t\t \tif(s.charAt(i)=='_'||s.charAt(i)==')'){\n\t\t \t\tif(cur2>0){\n\t\t \t\t\tnumber++;\n\t\t \t\t\tcur2=0;\n\t\t \t\t}\n\t\t \tif(s.charAt(i)==')'){\n\t\t \t\tflag2=0;\n\t\t \t}\n\t\t \t}\n\t\t }\n\t\t if(s.charAt(i)=='('){\n\t\t\t\tflag2=1;\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t}\n\t\tif(cur>0){\n\t\t\tmax=Math.max(max, cur);\n\t\t\tcur=0;\n\t\t}\n\t\tif(max==-1){\n\t\t\tSystem.out.print(0+\" \");\n\t\t}\n\t\telse\n\t\tSystem.out.print(max+\" \");\n\t\tSystem.out.println(number);\n\t}\nstatic boolean isAlpha(char a){\n\tif((a>='A'&&a<='Z')||(a>='a'&&a<='z')){\n\t\treturn true;\n\t}\n\telse\n\t\treturn false;\n}\n}", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "c1b7219fd7eaaff318449485ebf55165", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.Iterator;\nimport java.util.LinkedList;\nimport java.util.Scanner;\n\npublic class easy {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\t// TODO Auto-generated method stub\n\t\tboolean skb=false;\n\t\tString temp=\"\";\n\t\tint max=0;\n\t\tArrayList<String> arr=new ArrayList<>();\n\t\tScanner in=new Scanner(System.in);\n\t\tint how=in.nextInt();\n\t\tchar c;\n\t\tin.nextLine();\n\t\tString s=in.nextLine();\n\t\tchar[] WTF=s.toCharArray();\n\t\tint i=0;\n\t\twhile(i<WTF.length){\n\t\t\tc=WTF[i++];\n\t\t\tif(c=='('){\n\t\t\t\tskb=true;\n\t\t\t\tif(temp.length()>max){\n\t\t\t\t\tmax=temp.length();\n\t\t\t\t}\n\t\t\t\ttemp=\"\";\n\t\t\t}\n\t\t\tif(c==')'){\n\t\t\t\tskb=false;\n\t\t\t\tif(temp.length()>0){\n\t\t\t\t\tarr.add(temp);\n\t\t\t\t\ttemp=\"\";\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(Character.isLetter(c)==true) temp+=c;\n\t\t\tif(c=='_' && skb==false){\n\t\t\t\tif(temp.length()>max){\n\t\t\t\t\tmax=temp.length();\n\t\t\t\t}\n\t\t\t\ttemp=\"\";\n\t\t\t}\n\t\t\tif(c=='_' && skb==true){\n\t\t\t\tif(temp.length()>0){\n\t\t\t\t\tarr.add(temp);\n\t\t\t\t\ttemp=\"\";\n\t\t\t\t}\n\t\t\t}\n\t\t\t//System.out.print(c);\n\t\t}\n\t//\tSystem.out.println(arr);\n\t\tif(temp.length()>max){\n\t\t\tmax=temp.length();\n\t\t}\n\t\ttemp=\"\";\n\t\tSystem.out.println(max+\" \"+arr.size());\n\t}\n}", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "c9803c1401c46349854f0ef66d683b70", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class textdocumentanalysis {\n\tstatic int count_inside_braces = 0, longest_word = 0;\n\n\tpublic static int remove_underscore(String str) {\n\t\tstr = str.replaceAll(\"_\", \" \");\n\t\tstr = str.trim().replaceAll(\" +\", \" \");\n\t\tString s[] = str.split(\" \");\n\t\tif (s.length == 1 && s[0].equals(\"\"))\n\t\t\treturn 0;\n\t\treturn s.length;\n\t}\n\n\tpublic static void main(String args[]) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tString s = sc.next();\n\t\tArrayList<Integer> braces_indices = new ArrayList<Integer>();\n\t\tbraces_indices.add(-1);\n\t\tfor (int i = 0; i < s.length(); i++) {\n\t\t\tif (s.charAt(i) == '(' || s.charAt(i) == ')')\n\t\t\t\tbraces_indices.add(i);\n\t\t}\n\t\tint i = 1, count = 0, maxl = 0;\n\t\tString outside_braces = \"\";\n\t\twhile (i < braces_indices.size() - 1) {\n\t\t\tint open_brace_index = braces_indices.get(i);\n\t\t\tint close_brace_index = braces_indices.get(i + 1);\n\t\t\tString inside_braces = s.substring(braces_indices.get(i) + 1, braces_indices.get(i + 1));\n\t\t\tcount = remove_underscore(inside_braces);\n\t\t\tcount_inside_braces += count;\n\t\t\toutside_braces += \"_\" + s.substring(braces_indices.get(i - 1) + 1, braces_indices.get(i));\n\t\t\ti += 2;\n\t\t}\n\t\toutside_braces += \"_\" + s.substring(braces_indices.get(braces_indices.size() - 1) + 1);\n\t\toutside_braces = outside_braces.replaceAll(\"_\", \" \");\n\t\toutside_braces = outside_braces.trim().replaceAll(\" +\", \" \");\n\t\tString s_new[] = outside_braces.split(\" \");\n\t\tfor (int j = 0; j < s_new.length; j++) {\n\t\t\tif (s_new[j].length() > maxl)\n\t\t\t\tmaxl = s_new[j].length();\n\t\t}\n\n\t\tSystem.out.print(maxl + \" \" + count_inside_braces);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["expression parsing", "strings", "implementation"], "code_uid": "ced65668fb18b2e6f9e96d79ce01e5e1", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author sheep\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskE solver = new TaskE();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskE {\n\n final int MOD = 1000000007;\n\n private int addMod(int x, int y) {\n int ret = x + y;\n if (ret < 0) ret += MOD;\n if (ret >= MOD) ret -= MOD;\n\n return ret;\n }\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int choose[][] = new int[200][200];\n for (int i = 0; i < choose.length; ++i) {\n choose[i][0] = choose[i][i] = 1;\n for (int j = 1; j < i; ++j) {\n choose[i][j] = choose[i - 1][j] + choose[i - 1][j - 1];\n }\n }\n\n int n = in.nextInt();\n int m = in.nextInt();\n int upper = in.nextInt();\n\n int dp[][][][] = new int[2][n + 1][upper + 1][upper + 1];\n for (int i = 1; i + i <= n; ++i) {\n dp[0][2 * i][1][i] = 1;\n }\n\n int ans = 0;\n\n for (int i = 0; i < m - 1; ++i) {\n int now = i & 1, next = now ^ 1;\n\n for (int j = 0; j <= n; ++j) {\n for (int k = 1; k <= upper; ++k) {\n for (int r = 1; r <= upper; ++r) {\n dp[next][j][k][r] = 0;\n }\n }\n }\n\n for (int j = 1; j * 2 <= n; ++j) {\n dp[next][2 * j][1][j] = 1;\n }\n\n for (int j = 0; j <= n; ++j) {\n for (int k = 1; k <= upper; ++k) {\n for (int r = 1; r <= upper; ++r) {\n if (0 == dp[now][j][k][r]) continue;\n if (j > 1) {\n ans = addMod(ans, dp[now][j][k][r]);\n }\n for (int delta = 1; j + 2 * delta <= n && delta <= upper; ++delta) {\n int nextPlan = k * choose[delta + r - 1][r - 1];\n if (nextPlan > upper) break;\n dp[next][j + 2 * delta][nextPlan][delta] = addMod(dp[next][j + 2 * delta][nextPlan][delta], dp[now][j][k][r]);\n }\n }\n }\n }\n }\n\n out.println(ans);\n }\n}\n\nclass InputReader {\n BufferedReader reader;\n StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream));\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (Exception e) {\n throw new UnknownError();\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "b21cc5be9acb88002128be06f43ffa76", "src_uid": "c6d275b1e1d5c9e39e2cf990a635fa6b", "difficulty": 2800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.*;\nimport java.io.InputStream;\n\npublic class Solution {\n public static void main(String[] args) throws IOException {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n\n Task solver = new Task();\n solver.solve(in, out);\n\n out.close();\n }\n}\n\n/*\n * Solution\n */\n\n\nclass Task {\n\n private final static int N = 20;\n\n public void solve(InputReader in, PrintWriter out) {\n\n int n = in.nextInt();\n String[] s = new String[n];\n for (int i = 0; i < n; i++) {\n s[i] = new String(in.next());\n }\n\n int m = s[0].length();\n long[] d = new long[(1 << N)];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if(i == j) continue;\n\n int mask = 0;\n for (int pos = 0; pos < m; pos++) {\n if(s[i].charAt(pos) == s[j].charAt(pos)) {\n mask |= (1 << pos);\n }\n }\n d[mask] |= (1L << i);\n }\n }\n\n \n for(int i = 0; i < m; i++){\n for(int pos = 0; pos < (1 << m) ; pos++){\n d[pos] |= d[pos|(1 << i)];\n }\n }\n\n int[] sum = new int[(1 << m)];\n for(int k = 0;k < (1 << m); k++){\n sum[k] = Long.bitCount(d[k]);\n }\n\n double[] f = new double[60];\n f[0] = 1;\n for(int i = 1;i < 60;i++)\n f[i] = f[i-1] * i;\n\n double[] ps = new double[m];\n for(int k = 0;k < m;k++){\n ps[k] = f[k] * f[m-1-k] / f[m];\n }\n\n double ans = 0;\n for(int i = 0; i < (1 << m); i++) {\n int k = Integer.bitCount(i);\n for(int j = 0; j < m; j++){\n if( i << ~j < 0){\n ans += k * ps[k-1] * (sum[i^1<<j] - sum[i]);\n }\n }\n }\n\n out.printf(Locale.US, \"%.12f\\n\", ans/n);\n\n\n return;\n }\n\n}\n\n\n\n/*\n * Reading\n */\n\nclass InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader (InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n public long nextLong() {\n return Long.parseLong(next());\n }\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n}", "lang_cluster": "Java", "tags": ["dp", "bitmasks"], "code_uid": "95da46dabd4af6165cad65773ba6c1a4", "src_uid": "a95d9aef6a64c30e46330dcc8e6d4a67", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Scanner;\n\npublic class CF105D {\n\t\n\tpublic static double [][] probArray;\n\tpublic static int bagSize;\n\n\tpublic static void main(String args[]) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint w = scan.nextInt();\n\t\tint b = scan.nextInt();\n\t\tbagSize = w + b;\n\t\tprobArray = new double[w+1][b+1];\n\t\tfor(int i = 0; i <= w; i++) {\n\t\t\tfor(int j = 0; j <= b; j++) {\n\t\t\t\tprobArray[i][j] = -1;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(recursiveProb(w, b));\n\t}\n\n\tprivate static double recursiveProb(int w, int b) {\n\t\tif(w == 0 && b == 0) {\n\t\t\t// No mice left, princess cannot win.\n\t\t\treturn 0;\n\t\t} else if(w == -1 || b == -1) {\n\t\t\t// Ran out of one kind of mouse, princess loses.\n\t\t\treturn 0;\n\t\t} else if(probArray[w][b] != -1) {\n\t\t\t// Already filled this value.\n\t\t\treturn probArray[w][b];\n\t\t} else {\n\t\t\tdouble nextW = (double)w / (w + b);\n\t\t\tdouble nextB = (double)b / (w + b);\n\t\t\tdouble probP; // Princess\n\t\t\t\n\t\t\tif((bagSize - (w + b)) % 3 == 0) {\n\t\t\t\t// Princess' turn.\n\t\t\t\tprobP = nextW + nextB * recursiveProb(w, b - 1);\n\t\t\t} else if((bagSize - (w + b)) % 3 == 1) {\n\t\t\t\t// Dragon's turn.\n\t\t\t\tprobP = nextB * recursiveProb(w, b - 1);\n\t\t\t} else {\n\t\t\t\t// Escaped mouse.\n\t\t\t\tprobP = nextW * recursiveProb(w - 1, b) + nextB * recursiveProb(w, b - 1);\n\t\t\t}\n\t\t\t\n\t\t\tprobArray[w][b] = probP;\n\t\t\treturn probArray[w][b];\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "dp", "probabilities", "games"], "code_uid": "afcc97e589261a0b0d342ed064c648ff", "src_uid": "7adb8bf6879925955bf187c3d05fde8c", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// upsolve with rainboy\nimport java.io.*;\n\npublic class CF1152D {\n\tstatic final int MD = 1000000007;\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tint[] dp = new int[1 + n + 1];\n\t\tdp[0] = 1;\n\t\tint ans = 0;\n\t\tfor (int i = 0; i <= n; i++)\n\t\t\tfor (int j = i; j <= n; j++) {\n\t\t\t\tif ((i + j) % 2 == 1)\n\t\t\t\t\tans = (ans + dp[j]) % MD;\n\t\t\t\tdp[j + 1] = (dp[j + 1] + dp[j]) % MD;\n\t\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "5ebacd392a42610c6cbda33e65671ac4", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.* ;\n\nimport java.util.*;\n\npublic class ghh {\n\n\tstatic int n ; \n\tstatic long occ[] ; \n\tstatic long nbr_vertexes[] ;\n\tstatic long big = (long) (1e9 + 7) ;\n\tstatic void count_vertexes()\n\t{\n\t\tocc[0]++ ; \n\t\tnbr_vertexes[0]=1 ;\n\t\tfor(int i=1 ;i<=n ;i++)\n\t\t{\n\t\t\tlong oc[] = new long[n/2 +1] ; \n\t\t\tint limite = Integer.min(n-i, n/2); \n\t\t\tfor(int j=0 ;j<=limite; j++)\n\t\t\t{\n\t\t\t\tlong h = occ[j] ;\n\t\t\t\tif(j+1<=limite)\n\t\t\t\t\t{\n\t\t\t\t\toc[j+1]+=(h) ;oc[j+1]%=big ;\n\t\t\t\t\t}\n\t\t\t\tif(j-1>=0) \n\t\t\t\t\t{\n\t\t\t\t\toc[j-1]+=h ; oc[j-1]%=big ;\n\t\t\t\t\t}\n\t\t\t\toc[j]%=big ;\n\t\t\t}\n\t\t\tif(limite+1<=n/2)\n\t\t\t\t{\n\t\t\t\toc[limite]+=occ[limite+1] ;\n\t\t\t\toc[limite]%=big ;\n\t\t\t\t}\n\t\t\tlong sum=0 ; \n\t\t\tfor(int j=0 ;j<=limite; j++)\n\t\t\t{ \n\t\t\t\tsum+= (oc[j]) ; \n\t\t\t\tocc[j]=oc[j] ;\n\t\t\t\tsum = sum%big ; \n\t\t\t}\n\t\t\tnbr_vertexes[i]=sum ; \t\n\t\t}\n\n\t}\n\n\n\tpublic static void main(String[] args) throws IOException {\n\n\t\tBufferedReader jk = new BufferedReader(new InputStreamReader(System.in)) ;\n\t\tPrintWriter out = new PrintWriter(new OutputStreamWriter(System.out)) ;\n\t\tStringTokenizer ana =new StringTokenizer(jk.readLine()) ;\n\t\tn = Integer.parseInt(ana.nextToken()) ; \n\t\tn= 2*n ;\n\t\tocc = new long[n/2+1] ;\n\t\tnbr_vertexes = new long[n+1] ;\n\t\tlong res1 = 0 ;\n\t\tlong res2 = 0 ;\n\t\tcount_vertexes();\n\t\tfor(int i= n-1 ;i>=0 ; i-=2) \n\t\t{\n\n\t\t\tres1+=nbr_vertexes[i] ; \n\t\t\tres1%=big ;\n\t\t}\n\t\tfor(int i= n-2 ;i>=0 ; i-=2) \n\t\t{\n\t\t\tres2+=nbr_vertexes[i] ; \n\t\t\tres2%=big ; \n\t\t}\n\t\tout.println(res1);\n\n\n\t\tout.flush();\n\t}\n\n\n}\n\n", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "f28a22a30d9609477dabeb205a0d693e", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport static java.lang.Math.*;\npublic class Main {\n static final long MOD = 1_000_000_007 , INF = 1_000_000_000_000_000L;\n static final int INf = 1_000_000_000;\n static FastReader reader;\n static PrintWriter writer;\n public static void main(String[] args) {\n Thread t = new Thread(null, new O(), \"Integer.MAX_VALUE\", 100000000);\n t.start();\n }\n static class O implements Runnable {\n public void run() {\n try {\n magic();\n }\n catch (Exception e) {\n e.printStackTrace();\n System.exit(1);\n }\n }\n }\n static class FastReader {\n final private int BUFFER_SIZE = 1 << 16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n\n public FastReader() {\n din = new DataInputStream(System.in);\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public FastReader(String file_name) throws IOException {\n din = new DataInputStream(new FileInputStream(file_name));\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public String readLine() throws IOException {\n byte[] buf = new byte[1000000];\n int cnt = 0, c;\n while ((c = read()) != -1) {\n if (c == '\\n') break;\n buf[cnt++] = (byte) c;\n }\n return new String(buf, 0, cnt);\n }\n\n public int nextInt() throws IOException {\n int ret = 0;\n byte c = read();\n while (c <= ' ') c = read();\n boolean neg = (c == '-');\n if (neg) c = read();\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n if (neg) return -ret;\n return ret;\n }\n\n public long nextLong() throws IOException {\n long ret = 0;\n byte c = read();\n while (c <= ' ') c = read();\n boolean neg = (c == '-');\n if (neg) c = read();\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n if (neg) return -ret;\n return ret;\n }\n\n public double nextDouble() throws IOException {\n double ret = 0, div = 1;\n byte c = read();\n while (c <= ' ') c = read();\n boolean neg = (c == '-');\n if (neg) c = read();\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n if (c == '.') while ((c = read()) >= '0' && c <= '9') ret += (c - '0') / (div *= 10);\n if (neg) return -ret;\n return ret;\n }\n\n private void fillBuffer() throws IOException {\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1) buffer[0] = -1;\n }\n\n private byte read() throws IOException {\n if (bufferPointer == bytesRead) fillBuffer();\n return buffer[bufferPointer++];\n }\n\n public void close() throws IOException {\n if (din == null) return;\n din.close();\n }\n }\n static int n, dp0[][], dp1[][];\n static void magic() throws IOException {\n reader = new FastReader();\n writer = new PrintWriter(System.out, true);\n n = reader.nextInt();\n dp0 = new int[2*n+1][2*n+1];\n dp1 = new int[2*n+1][2*n+1];\n for(int i=0;i<=n+n;++i) {\n for(int j=0;j<=n+n;++j) {\n dp0[i][j] = dp1[i][j] = -1;\n }\n }\n //fd(0, 0);\n writer.println(max(f(0,0,1), f(0,0,0)));\n }\n static int f(int idx, int open_count, int to_be_inc) {\n //writer.println(\"idx: \"+idx+\" open_count: \"+open_count+\" to_be_inc: \"+to_be_inc);\n if(idx==2*n) {\n return 0;\n }\n if(to_be_inc==0) {\n if(dp0[idx][open_count]!=-1) {\n return dp0[idx][open_count];\n }\n //placing open\n int max = 0;\n int left_iske_baad = 2*n - idx - 1;\n if(left_iske_baad>open_count) {\n max+=max(f(idx+1, open_count+1, 0), f(idx+1, open_count+1, 1));\n }\n //placing close\n if(open_count>0) {\n max+=max(f(idx+1, open_count-1, 0), f(idx+1, open_count-1, 1));\n }\n return dp0[idx][open_count] = (int)(max%MOD);\n }\n else {\n if(dp1[idx][open_count]!=-1) {\n return dp1[idx][open_count];\n }\n //placing open\n int max = 0;\n int left_iske_baad = 2*n - idx - 1;\n if(left_iske_baad>open_count) {\n max = 1+f(idx+1, open_count+1, 0);\n if(open_count>0) {\n max+=max(f(idx+1, open_count-1, 0), f(idx+1, open_count-1, 1));\n }\n }\n //placing close\n if(open_count>0) {\n int ispe = 1+f(idx+1, open_count-1, 0);\n if(left_iske_baad>open_count) {\n ispe+=max(f(idx+1, open_count+1, 0), f(idx+1, open_count+1, 1));\n }\n max = max(max, ispe);\n }\n return dp1[idx][open_count] = (int)(max%MOD);\n }\n }\n static void fd(int idx, int open_count) {\n //writer.println(\"idx: \"+idx+\" open_count: \"+open_count+\" to_be_inc: \"+to_be_inc);\n if(idx==2*n) {\n writer.println(\"Open count: \" + open_count);\n if(open_count==0) {\n }\n }\n\n //placing open\n int max = 0;\n int left_iske_baad = 2*n - idx - 1;\n if(left_iske_baad>open_count) {\n fd(idx+1, open_count+1);\n }\n //placing close\n if(open_count>0) {\n fd(idx+1, open_count-1);\n }\n }\n}", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "806bc2fc96985a5c6c1cf79f38373a89", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in Actual solution is at the top\n *\n * @author @Ziklon\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n DNekoAndAkisPrank solver = new DNekoAndAkisPrank();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class DNekoAndAkisPrank {\n int[][][] dp;\n static int MOD = (int) (1e9 + 7);\n\n int func(int idx, int inc, int last) {\n if (inc < 0 || last * 2 > dp.length) return 0;\n\n if (idx >= dp.length) {\n return 0;\n }\n\n if (dp[idx][inc][last] != -1) return dp[idx][inc][last];\n\n int ans = 0;\n int remain = dp.length - idx;\n\n if (last == 0) {\n if (inc + 1 <= remain && inc > 0) {\n ans = Math.max(ans, 1 + func(idx + 1, inc + 1, 1) + func(idx + 1, inc - 1, 0)) % MOD;\n ans = Math.max(ans, 1 + func(idx + 1, inc - 1, 1) + func(idx + 1, inc + 1, 0)) % MOD;\n } else if (inc > 0) ans = Math.max(ans, 1 + func(idx + 1, inc - 1, 1));\n else {\n ans = Math.max(ans, 1 + func(idx + 1, inc + 1, 1)) % MOD;\n }\n\n } else {\n if (inc > 0) ans += func(idx + 1, inc - 1, 0) % MOD;\n if (inc + 1 <= remain) ans += func(idx + 1, inc + 1, 0) % MOD;\n }\n dp[idx][inc][last] = ans % MOD;\n return ans;\n }\n\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n = in.readInt();\n dp = new int[n * 2][n + 1][3];\n\n for (int i = 0; i < dp.length; ++i) ArrayUtils.fill(dp[i], -1);\n\n out.printLine(Math.max(func(0, 0, 0), func(0, 0, 1)));\n }\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n }\n\n static class ArrayUtils {\n public static void fill(int[][] array, int value) {\n for (int[] row : array) {\n Arrays.fill(row, value);\n }\n }\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void printLine(int i) {\n writer.println(i);\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "537a043b1bd60af158d0bd0ac1b1b01f", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class Main {\n private static Scanner sc = new Scanner(System.in);\n private static int mod = 1000000007;\n public static void main(String[] args) {\n int [][]dp = new int[2005][2005];\n int [][]ok = new int[2005][2005];\n ok[0][0] = 1;\n for(int i = 1; i <= 2000; i++){\n for(int j = i & 1; j <= i; j += 2){\n if(j == 0) {\n dp[i][j] = dp[i - 1][j + 1];\n if(ok[i - 1][j + 1] == 1)\n dp[i][j] = (dp[i][j] + 1) % mod;\n else\n ok[i][j] = 1;\n continue;\n }\n dp[i][j] = (dp[i - 1][j - 1] + dp[i - 1][j + 1]) % mod;\n if(ok[i - 1][j + 1] == 1 || ok[i - 1][j - 1] == 1)\n dp[i][j] = (dp[i][j] + 1) % mod;\n else\n ok[i][j] = 1;\n\n }\n }\n System.out.print(dp[2 * sc.nextInt()][0]);\n }\n\n}\n", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "6b904a67bdba89163f5fde99ac29ee2b", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\n/*\n * To change this license header, choose License Headers in Project Properties.\n * To change this template file, choose Tools | Templates\n * and open the template in the editor.\n */\n\n/**\n *\n * @author Andy Phan (Edited for speedups by AuroraGarden)\n */\npublic class p1152d {\n static boolean[][] hasVal;\n static boolean[][] doneVal;\n static long[][][] dp;\n static boolean[][][] done;\n \n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int n = in.nextInt();\n hasVal = new boolean[2*n+1][2*n+1];\n doneVal = new boolean[2*n+1][2*n+1];\n dp = new long[2*n+1][2*n+1][2];\n done = new boolean[2*n+1][2*n+1][2];\n System.out.println(traverse(2*n, 0, 0)%1_000_000_007);\n }\n \n public static long traverse(int ind, int diff, int flag) {\n if(ind <= 0 || diff < 0) return 0;\n if(done[ind][diff][flag]) return dp[ind][diff][flag];\n done[ind][diff][flag] = true;\n long num = 0;\n if(flag == 1) {\n if(hasVal(ind-1, diff-1)) num += traverse(ind-1, diff-1, 0);\n if(hasVal(ind-1, diff+1)) num += traverse(ind-1, diff+1, 0);\n if(num >= 1_000_000_007) num -= 1_000_000_007;\n return dp[ind][diff][flag] = num;\n }\n if(hasVal(ind-1, diff-1)) {\n long tmp = traverse(ind-1, diff-1, 1)+1;\n if(hasVal(ind-1, diff+1)) tmp += traverse(ind-1, diff+1, 0);\n num = max(num, tmp);\n }\n if(hasVal(ind-1, diff+1)) {\n long tmp = traverse(ind-1, diff+1, 1)+1;\n if(hasVal(ind-1, diff-1)) tmp += traverse(ind-1, diff-1, 0);\n num = max(num, tmp);\n }\n if(num >= 1_000_000_007) num -= 1_000_000_007;\n return dp[ind][diff][flag] = num%1_000_000_007;\n }\n static long max(long a, long b) {return a > b ? a : b;}\n \n public static boolean hasVal(int ind, int diff) {\n if(diff < 0) return false;\n return diff <= ind;\n }\n}", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "e2f30b110a9965652ebb9533d09cf0b4", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author prakharjain\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n DNekoAndAkisPrank solver = new DNekoAndAkisPrank();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class DNekoAndAkisPrank {\n int mod = 1000000007;\n\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n = in.nextInt();\n\n long[][] dp = new long[2 * n + 1][2 * n + 1];\n\n dp[1][1] = 1;\n\n for (int i = 2; i <= 2 * n; i++) {\n for (int j = 0; j <= i; j++) {\n if (j > 0) {\n dp[i][j] += dp[i - 1][j - 1];\n dp[i][j] %= mod;\n }\n\n if (j < 2 * n) {\n dp[i][j] += dp[i - 1][j + 1];\n dp[i][j] %= mod;\n }\n }\n }\n\n long ans = 0;\n for (int i = 2 * n - 1; i >= 0; i -= 2) {\n for (int j = 0; j <= i; j++) {\n if (2 * n - i >= j) {\n ans += dp[i][j];\n ans %= mod;\n }\n }\n }\n\n out.println(ans);\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void println(long i) {\n writer.println(i);\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "2f81d68ab3ddab4523d80dd4dccef75e", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class D {\n private static int solve(int len, int open, boolean avail, int n, int[][][] memo) {\n int mod = 1000000007;\n\n if (len == 2 * n) {\n return 0;\n }\n\n int availInt = avail ? 0 : 1;\n\n if (memo[availInt][len][open] != -1) {\n return memo[availInt][len][open];\n }\n\n int closed = len - open;\n boolean canOpen = open < n;\n boolean canClose = closed < open;\n\n int ans = 0;\n if (avail) {\n if (canOpen && canClose) {\n ans += solve(len + 1, open + 1, true, n, memo);\n ans += solve(len + 1, open, false, n, memo);\n } else if (canOpen) {\n ans += solve(len + 1, open + 1, false, n, memo);\n } else if (canClose) {\n ans += solve(len + 1, open, false, n, memo);\n }\n\n ans++;\n } else {\n if (canOpen) {\n ans += solve(len + 1, open + 1, true, n, memo);\n }\n\n if (canClose) {\n ans += solve(len + 1, open, true, n, memo);\n }\n }\n\n memo[availInt][len][open] = ans % mod;\n\n return ans % mod;\n }\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int n = sc.nextInt();\n\n int[][][] memo = new int[2][2 * n + 1][n + 1];\n\n for (int i = 0; i < 2 * n + 1; i++) {\n Arrays.fill(memo[0][i], -1);\n Arrays.fill(memo[1][i], -1);\n }\n\n System.out.println(solve(0, 0, true, n, memo));\n }\n}\n", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "649233e47cf0b9d6ba12bf01ff3cc964", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.List;\nimport java.util.StringTokenizer;\npublic class realfast implements Runnable {\n private static final int INF = (int) 1e9;\n \n public void solve() throws IOException \n {\n int n = readInt();\n long dp[][][]= new long[n+1][n+1][2];\n for(int i=0;i<=n;i++)\n for(int j=0;j<=n;j++)\n for(int k=0;k<2;k++)\n dp[i][j][k]=-1;\n long val = dfs(dp,n,0,0);\n out.println(val);\n \n }\n \n public static long dfs(long dp[][][], int n, int cur, int a)\n {\n if(n==0&&cur==0)\n return 0;\n\n if(dp[n][cur][a]!=-1)\n return dp[n][cur][a];\n \n long val1=0;\n long val2=0;\n long val3 =0;\n long val4=0;\n if(n>0)\n {\n val1 = (1+dfs(dp,n-1,cur+1,1))%1000000007; \n val2 = (dfs(dp,n-1,cur+1,0))%1000000007;\n }\n \n if(cur>0)\n {\n val3= (1+dfs(dp,n,cur-1,1))%1000000007;\n val4= (dfs(dp,n,cur-1,0))%1000000007;\n }\n \n if(a==0)\n {\n \n dp[n][cur][a]=Math.max((val1+val4)%1000000007,(val2+val3)%1000000007);\n dp[n][cur][a]=Math.max(dp[n][cur][a],(val2+val4)%1000000007);\n return dp[n][cur][a];\n }\n else\n {\n dp[n][cur][1]=(val2+val4)%1000000007;\n return dp[n][cur][a];\n }\n\n }\n \n \n ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n public static void main(String[] args) {\n new Thread(null, new realfast(), \"\", 128 * (1L << 20)).start();\n }\n \n private static final boolean ONLINE_JUDGE = System.getProperty(\"ONLINE_JUDGE\") != null;\n private BufferedReader reader;\n private StringTokenizer tokenizer;\n private PrintWriter out;\n \n @Override\n public void run() {\n try {\n if (ONLINE_JUDGE || !new File(\"input.txt\").exists()) {\n reader = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n } else {\n reader = new BufferedReader(new FileReader(\"input.txt\"));\n out = new PrintWriter(\"output.txt\");\n }\n solve();\n } catch (IOException e) {\n throw new RuntimeException(e);\n } finally {\n try {\n reader.close();\n } catch (IOException e) {\n // nothing\n }\n out.close();\n }\n }\n \n private String readString() throws IOException {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n tokenizer = new StringTokenizer(reader.readLine());\n }\n return tokenizer.nextToken();\n }\n \n @SuppressWarnings(\"unused\")\n private int readInt() throws IOException {\n return Integer.parseInt(readString());\n }\n \n @SuppressWarnings(\"unused\")\n private long readLong() throws IOException {\n return Long.parseLong(readString());\n }\n \n @SuppressWarnings(\"unused\")\n private double readDouble() throws IOException {\n return Double.parseDouble(readString());\n }\n}\nclass edge implements Comparable<edge>{\n int u ;\n int v ;\n int val;\n edge(int u1, int v1 , int val1)\n {\n this.u=u1;\n this.v=v1;\n this.val=val1;\n }\n public int compareTo(edge e)\n {\n return this.val-e.val;\n }\n}", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "777c57bee6888e12ff3fbf3388adea6e", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author out_of_the_box\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n DNekoAndAkisPrank solver = new DNekoAndAkisPrank();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class DNekoAndAkisPrank {\n private static final int MOD = 1000000007;\n\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n = in.nextInt();\n out.print(solve(n));\n }\n\n private int solve(int n) {\n int N = 2 * n;\n int[][][] dp = new int[N + 1][N + 1][2];\n dp[0][0][0] = 0;\n dp[0][0][1] = 0;\n for (int i = 1; i <= N; i++) {\n for (int j = 0; j <= i; j++) {\n for (int k = 0; k <= 1; k++) {\n dp[i][j][k] = 0;\n if (k == 1) {\n if (i - j >= 2) {\n dp[i][j][k] = MathUtility.add(dp[i][j][k], dp[i - 1][j + 1][0], MOD);\n }\n if (j > 0) {\n dp[i][j][k] = MathUtility.add(dp[i][j][k], dp[i - 1][j - 1][0], MOD);\n }\n } else {\n dp[i][j][k] = Math.max(getVal(dp, i, j, false, false),\n Math.max(getVal(dp, i, j, false, true),\n getVal(dp, i, j, true, false)));\n }\n }\n }\n }\n// for (int i = 0; i<=N; i++) {\n// for (int j = 0; j<= N; j++) {\n// System.out.print(\"(\");\n// System.out.print(dp[i][j][0]);\n// System.out.print(\",\");\n// System.out.print(dp[i][j][1]);\n// System.out.print(\") \");\n// }\n// System.out.println();\n// }\n// System.out.println();\n return dp[N][0][0];\n }\n\n private int getVal(int[][][] dp, int i, int j, boolean selectStart, boolean selectEnd) {\n int ret = 0;\n if (i - j >= 2) {\n if (selectStart) {\n ret = MathUtility.add(ret, dp[i - 1][j + 1][1], MOD);\n ret = MathUtility.add(ret, 1, MOD);\n } else {\n ret = MathUtility.add(ret, dp[i - 1][j + 1][0], MOD);\n }\n }\n if (j > 0) {\n if (selectEnd) {\n ret = MathUtility.add(ret, dp[i - 1][j - 1][1], MOD);\n ret = MathUtility.add(ret, 1, MOD);\n } else {\n ret = MathUtility.add(ret, dp[i - 1][j - 1][0], MOD);\n }\n }\n return ret;\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void print(int i) {\n writer.print(i);\n }\n\n }\n\n static class MathUtility {\n public static int add(int a, int b, int MOD) {\n int res = a + b;\n if (res >= MOD) {\n res -= MOD;\n }\n return res;\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "1fb3b6265188695c3c876e6c37ca2f75", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastScanner in = new FastScanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n D solver = new D();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class D {\n long mod = (int) 1e9 + 7;\n Long[][][] dp;\n\n long go(int rem, int open, int used) {\n if (rem == 0)\n return 0;\n if (dp[used][rem][open] != null)\n return dp[used][rem][open];\n if (rem < open)\n throw new RuntimeException();\n\n\n if (rem == open) {\n if (used == 1)\n return dp[used][rem][open] = go(rem - 1, open - 1, 0);\n else {\n return dp[used][rem][open] = 1 + go(rem - 1, open - 1, 1);\n }\n }\n if (used == 1) {\n long res = 0;\n if (open > 0)\n res += go(rem - 1, open - 1, 0);\n res = (res + go(rem - 1, open + 1, 0)) % mod;\n return dp[used][rem][open] = res;\n } else {\n long res = 1;//use (\n if (open > 0)\n res += go(rem - 1, open - 1, 0);\n res = (res + go(rem - 1, open + 1, 1)) % mod;\n return dp[used][rem][open] = res;\n }\n }\n\n public void solve(int testNumber, FastScanner in, PrintWriter out) {\n int n = in.ni();\n dp = new Long[2][2 * n + 3][2 * n + 3];\n out.println(go(2 * n, 0, 0));\n }\n\n }\n\n static class FastScanner {\n private BufferedReader in;\n private StringTokenizer st;\n\n public FastScanner(InputStream stream) {\n in = new BufferedReader(new InputStreamReader(stream));\n }\n\n public String ns() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n String rl = in.readLine();\n if (rl == null) {\n return null;\n }\n st = new StringTokenizer(rl);\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return st.nextToken();\n }\n\n public int ni() {\n return Integer.parseInt(ns());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "e0f7275a4549dbac4c77a22c19b3b9a0", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.NoSuchElementException;\n\npublic class Main {\n\n\tstatic PrintWriter out;\n\tstatic InputReader ir;\n\tstatic boolean debug = true;\n\tstatic long[][][] dp;\n\tstatic long mod = (long) 1e9 + 7;\n\n\tstatic void solve() {\n\t\tint n = ir.nextInt();\n\t\tdp = new long[n + 1][n + 1][2];\n\t\tfor (int i = 0; i <= n; i++)\n\t\t\tfor (int j = 0; j <= n; j++)\n\t\t\t\tArrays.fill(dp[i][j], -1);\n\t\tdp[1][0][0] = 1;\n\t\tdp[1][0][1] = 1;\n\t\tdp[1][1][0] = 1;\n\t\tdp[1][1][1] = 0;\n\t\tout.println(dfs(n, 0, 0));\n\t}\n\n\tstatic long dfs(int x, int d, int k) {\n\t\tif (dp[x][d][k] >= 0)\n\t\t\treturn dp[x][d][k];\n\t\telse if (x == d)\n\t\t\treturn dp[x][d][k] = ((k == 0) ? ((x + 1) / 2) : (x / 2));\n\t\telse if (d == 0)\n\t\t\treturn dp[x][d][k] = dfs(x, 1, k ^ 1) + (k == 0 ? 1 : 0);\n\t\tif (k == 0) {\n\t\t\treturn dp[x][d][k] = (dfs(x - 1, d - 1, 1) + dfs(x, d + 1, 0) + 1) % mod;\n\t\t} else\n\t\t\treturn dp[x][d][k] = (dfs(x - 1, d - 1, 0) + dfs(x, d + 1, 0)) % mod;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tir = new InputReader(System.in);\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.flush();\n\t}\n\n\tstatic class InputReader {\n\n\t\tprivate InputStream in;\n\t\tprivate byte[] buffer = new byte[1024];\n\t\tprivate int curbuf;\n\t\tprivate int lenbuf;\n\n\t\tpublic InputReader(InputStream in) {\n\t\t\tthis.in = in;\n\t\t\tthis.curbuf = this.lenbuf = 0;\n\t\t}\n\n\t\tpublic boolean hasNextByte() {\n\t\t\tif (curbuf >= lenbuf) {\n\t\t\t\tcurbuf = 0;\n\t\t\t\ttry {\n\t\t\t\t\tlenbuf = in.read(buffer);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (lenbuf <= 0)\n\t\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\t\tprivate int readByte() {\n\t\t\tif (hasNextByte())\n\t\t\t\treturn buffer[curbuf++];\n\t\t\telse\n\t\t\t\treturn -1;\n\t\t}\n\n\t\tprivate boolean isSpaceChar(int c) {\n\t\t\treturn !(c >= 33 && c <= 126);\n\t\t}\n\n\t\tprivate void skip() {\n\t\t\twhile (hasNextByte() && isSpaceChar(buffer[curbuf]))\n\t\t\t\tcurbuf++;\n\t\t}\n\n\t\tpublic boolean hasNext() {\n\t\t\tskip();\n\t\t\treturn hasNextByte();\n\t\t}\n\n\t\tpublic String next() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tint b = readByte();\n\t\t\twhile (!isSpaceChar(b)) {\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] a = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic char[][] nextCharMap(int n, int m) {\n\t\t\tchar[][] map = new char[n][m];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tmap[i] = next().toCharArray();\n\t\t\treturn map;\n\t\t}\n\t}\n\n\tstatic void tr(Object... o) {\n\t\tif (debug)\n\t\t\tout.println(Arrays.deepToString(o));\n\t}\n}", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "848da373b6cc82ba6c25435a15320fc0", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.BigInteger;\nimport static java.lang.Math.*;\n\n/* spar5h */\n\npublic class cf4 implements Runnable { \n\t\n\tlong[][][] dp;\n\tlong mod = (long)1e9 + 7;\n\t\n\tvoid recur(int n, int k, int x) {\n\t\t\n\t\tdp[n][k][x] = 0;\n\t\t\n\t\tif(k == dp[n].length - 1) {\n\t\t\t\n\t\t\tif(n != 0)\n\t\t\t\tdp[n][k][x] = -2;\n\t\t\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tint c = 0;\n\t\t\n\t\tif(x == 0) {\n\t\t\t\n\t\t\tif(n > 0) {\n\t\t\t\t\n\t\t\t\tif(dp[n - 1][k + 1][1] == -1)\n\t\t\t\t\trecur(n - 1, k + 1, 1);\n\t\t\t\t\n\t\t\t\tif(dp[n - 1][k + 1][1] != -2) {\n\t\t\t\t\tdp[n][k][0] = (dp[n - 1][k + 1][1] + dp[n][k][0]) % mod;\n\t\t\t\t\tc++;\n\t\t\t\t}\t\n\t\t\t}\n\t\t\t\n\t\t\tif(dp[n + 1][k + 1][1] == -1)\n\t\t\t\trecur(n + 1, k + 1, 1);\n\t\t\t\n\t\t\tif(dp[n + 1][k + 1][1] != -2) {\n\t\t\t\tdp[n][k][0] = (dp[n + 1][k + 1][1] + dp[n][k][0]) % mod;\n\t\t\t\tc++;\n\t\t\t}\n\t\t}\n\t\t\n\t\telse if(x == 1) {\n\t\t\t\n\t\t\tdp[n][k][x] = 1;\n\t\t\t\n\t\t\tif(n > 0) {\n\t\t\t\t\n\t\t\t\tif(dp[n - 1][k + 1][0] == -1)\n\t\t\t\t\trecur(n - 1, k + 1, 0);\n\t\t\t\t\n\t\t\t\tif(dp[n - 1][k + 1][0] != -2) {\n\t\t\t\t\tdp[n][k][1] = (dp[n - 1][k + 1][0] + dp[n][k][1]) % mod;\n\t\t\t\t\tc++;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(dp[n + 1][k + 1][1] == -1)\n\t\t\t\t\trecur(n + 1, k + 1, 1);\n\t\t\t\t\n\t\t\t\tif(dp[n + 1][k + 1][1] != -2) {\n\t\t\t\t\tdp[n][k][1] = (dp[n + 1][k + 1][1] + dp[n][k][1]) % mod;\n\t\t\t\t\tc++;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\telse {\n\t\t\t\t\n\t\t\t\tif(dp[n + 1][k + 1][0] == -1)\n\t\t\t\t\trecur(n + 1, k + 1, 0);\n\t\t\t\t\n\t\t\t\tif(dp[n + 1][k + 1][0] != -2) {\n\t\t\t\t\tdp[n][k][1] = (dp[n + 1][k + 1][0] + dp[n][k][1]) % mod;\n\t\t\t\t\tc++;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t}\n\n\t\tif(c == 0)\n\t\t\tdp[n][k][x] = -2;\n\t}\n\t\n\tpublic void run() {\n\t\t\t\n\t\tInputReader s = new InputReader(System.in);\n\t\tPrintWriter w = new PrintWriter(System.out);\n\t\t\n\t\tint n = s.nextInt();\n\t\t\n\t\tdp = new long[2 * n + 1][2 * n + 1][2];\n\t\tfor(int i = 0; i <= 2 * n; i++)\n\t\t\tfor(int j = 0; j <= 2 * n; j++)\n\t\t\t\tfor(int k = 0; k < 2; k++)\n\t\t\t\t\tdp[i][j][k] = -1;\n\t\t\n\t\trecur(0, 0, 1);\n\t\t\n\t\tw.println(dp[0][0][1]);\n\t\t\n\t\tw.close();\n\t}\n\n\tstatic class InputReader {\n\t\t\n\t\tprivate InputStream stream;\n\t\tprivate byte[] buf = new byte[1024];\n\t\tprivate int curChar;\n\t\tprivate int numChars;\n\t\tprivate SpaceCharFilter filter;\n\t\t\n\t\tpublic InputReader(InputStream stream) {\n\t\t\tthis.stream = stream;\n\t\t}\n\t\t\n\t\tpublic int read() {\n\t\t\t\n\t\t\tif (numChars==-1) \n\t\t\t\tthrow new InputMismatchException();\n\t\t\t\n\t\t\tif (curChar >= numChars) {\n\t\t\t\t\n\t\t\t\tcurChar = 0;\n\t\t\t\t\n\t\t\t\ttry {\n\t\t\t\t\tnumChars = stream.read(buf);\n\t\t\t\t}\n\t\t\t\tcatch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(numChars <= 0)\t\t\t\t\n\t\t\t\t\treturn -1;\n\t\t\t}\n\t\t\t\n\t\t\treturn buf[curChar++];\n\t\t}\n\t\t \n\t\tpublic String nextLine() {\n\t\t\t\n\t\t\tBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\t\t\tString str = \"\";\n\t \n\t\t\ttry {\n\t str = br.readLine();\n\t }\n\t catch (IOException e) {\n\t e.printStackTrace();\n\t }\n\t\t\t\n\t return str;\n\t\t}\n\t\t\n\t\tpublic int nextInt() {\n\t\t\n\t\t\tint c = read();\n\t\t\t\n\t\t\twhile(isSpaceChar(c)) \n\t\t\t\tc = read();\n\t\t\t\n\t\t\tint sgn = 1;\n\t\t\t\n\t\t\tif (c == '-') {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\t\n\t\t\tint res = 0;\n\t\t\t\n\t\t\tdo {\n\t\t\t\tif(c<'0'||c>'9') \n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\twhile (!isSpaceChar(c)); \n\t\t\t\n\t\t\treturn res * sgn;\n\t\t}\n\t\t\n\t\tpublic long nextLong() {\n\t\t\t\n\t\t\tint c = read();\n\t\t\t\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\t\n\t\t\tint sgn = 1;\n\t\t\t\n\t\t\tif (c == '-') {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\t\n\t\t\tlong res = 0;\n\t\t\t\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\t\n\t\t\twhile (!isSpaceChar(c));\n\t\t\t\treturn res * sgn;\n\t\t}\n\t\t\n\t\tpublic double nextDouble() {\n\t\t\t\n\t\t\tint c = read();\n\t\t\t\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\t\n\t\t\tint sgn = 1;\n\t\t\t\n\t\t\tif (c == '-') {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\t\n\t\t\tdouble res = 0;\n\t\t\t\n\t\t\twhile (!isSpaceChar(c) && c != '.') {\n\t\t\t\t\n\t\t\t\tif (c == 'e' || c == 'E')\n\t\t\t\t\treturn res * Math.pow(10, nextInt());\n\t\t\t\t\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\t\n\t\t\tif (c == '.') {\n\t\t\t\t\n\t\t\t\tc = read();\n\t\t\t\tdouble m = 1;\n\t\t\t\twhile (!isSpaceChar(c)) \n\t\t\t\t{\n\t\t\t\t\tif (c == 'e' || c == 'E')\n\t\t\t\t\t\treturn res * Math.pow(10, nextInt());\n\t\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t\tm /= 10;\n\t\t\t\t\tres += (c - '0') * m;\n\t\t\t\t\tc = read();\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\treturn res * sgn;\n\t\t}\n\t\t\n\t\tpublic String readString() {\n\t\t\t\n\t\t\tint c = read();\n\t\t\t\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\t\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\t\n\t\t\tdo {\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t} \n\t\t\twhile (!isSpaceChar(c));\n\t\t\t\n\t\t\treturn res.toString();\n\t\t}\n\t \n\t\tpublic boolean isSpaceChar(int c) {\n\t\t\t\n\t\t\tif (filter != null)\n\t\t\t\treturn filter.isSpaceChar(c);\n\t\t\t\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n\t \n\t\tpublic String next() {\n\t\t\treturn readString();\n\t\t}\n\t\t\n\t\tpublic interface SpaceCharFilter {\n\t\t\tpublic boolean isSpaceChar(int ch);\n\t\t}\n\t\n\t}\n\n\tpublic static void main(String args[]) throws Exception {\n\t\tnew Thread(null, new cf4(),\"cf4\",1<<26).start();\n\t}\n}", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "40e4ac254515bd60713d3b0a1c3758c9", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//JDope\nimport java.util.*;\nimport java.io.*;\nimport java.math.*;\npublic class D{\npublic static void main(String[] omkar) throws Exception\n{\n BufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st = new StringTokenizer(in.readLine());\n StringBuilder sb = new StringBuilder();\n int n = Integer.parseInt(st.nextToken());\n int[][] mat = new int[n+1][n+1];\n long sum = 0;\n for(int i = 0; i < n+1; i++)\n {\n mat[i][0] = 1;\n if((i+0) % 2 == 1)\n {\n sum += mat[i][0];\n sum = sum % 1000000007;\n }\n }\n for(int i = 1; i < n+1; i++)\n {\n for(int j = i; j < n+1; j++)\n {\n mat[j][i] = (mat[j][i-1] + mat[j-1][i]) % 1000000007;\n if((i+j) % 2 == 1)\n {\n sum += mat[j][i];\n sum = sum % 1000000007;\n }\n }\n }\n System.out.println(sum);\n \n }\n public static int[] readArr(int N, BufferedReader in, StringTokenizer st) throws Exception\n {\n int[] arr = new int[N];\n st = new StringTokenizer(in.readLine());\n for(int i=0; i < N; i++)\n arr[i] = Integer.parseInt(st.nextToken());\n return arr;\n }\n\n}", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "f6d68251602fced325ccda4075e3604a", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package com.company;\n// Always comment out package when submitting.\n\n\nimport java.io.*;\nimport java.util.*;\n\npublic class Main {\n public static class Task {\n int mod = 1_000_000_007;\n public void solve(Scanner sc, PrintWriter pw) throws IOException {\n int n = sc.nextInt();\n long[][] dp0 = new long[n + 1][n + 1];\n long[][] dp1 = new long[n + 1][n + 1];\n for (int ij = 2 * n; ij >= 0; ij--) {\n for (int i = 0; i <= n; i++) {\n int j = ij - i;\n if (i < 0 || j < 0) continue;\n if (j > i) continue;\n if (i == n && j == n) continue;\n if (i == j) {\n dp0[i][j] = Math.max(1 + dp1[i + 1][j], dp0[i + 1][j]);\n } else if ( i == n) {\n dp0[i][j] = Math.max(1 + dp1[i][j + 1], dp0[i][j + 1]);\n } else {\n long v1 = (dp0[i + 1][j] + dp0[i][j + 1]) % mod;\n long v2 = (1 + dp1[i + 1][j] + dp0[i][j + 1]) % mod;\n long v3 = (1 + dp0[i + 1][j] + dp1[i][j + 1]) % mod;\n dp0[i][j] = Math.max(v1, Math.max(v2, v3));\n }\n if (i == j) {\n dp1[i][j] = dp0[i + 1][j];\n } else if ( i == n) {\n dp1[i][j] = dp0[i][j + 1];\n } else {\n long v1 = (dp0[i + 1][j] + dp0[i][j + 1]) % mod;\n dp1[i][j] = v1;\n }\n }\n }\n pw.println(dp0[0][0] % mod);\n\n }\n }\n\n // template, actual code is in class Task.\n static long TIME_START, TIME_END;\n\n public static void main(String[] args) throws IOException {\n Scanner sc = new Scanner(System.in);\n// Scanner sc = new Scanner(new FileInputStream(\"Test.in\"));\n PrintWriter pw = new PrintWriter(new BufferedOutputStream(System.out));\n// PrintWriter pw = new PrintWriter(new FileOutputStream(\"Test.out\"));\n\n Runtime runtime = Runtime.getRuntime();\n long usedMemoryBefore = runtime.totalMemory() - runtime.freeMemory();\n TIME_START = System.currentTimeMillis();\n Task t = new Task();\n t.solve(sc, pw);\n TIME_END = System.currentTimeMillis();\n long usedMemoryAfter = runtime.totalMemory() - runtime.freeMemory();\n pw.close();\n// System.err.println(\"Memory increased: \" + (usedMemoryAfter - usedMemoryBefore) / 1000000);\n// System.err.println(\"Time used: \" + (TIME_END - TIME_START) + \".\");\n }\n\n // Faster IO with BufferedReader wrapped with Scanner\n static class Scanner {\n StringTokenizer st;\n BufferedReader br;\n\n public Scanner(InputStream s) {\n br = new BufferedReader(new InputStreamReader(s));\n }\n\n public Scanner(FileReader s) throws FileNotFoundException {\n br = new BufferedReader(s);\n }\n\n public String next() throws IOException {\n while (st == null || !st.hasMoreTokens())\n st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n\n public int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n public long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n public String nextLine() throws IOException {\n return br.readLine();\n }\n\n public double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n\n public boolean ready() throws IOException {\n return br.ready();\n }\n }\n}", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "5e4e76d662f4752cc863627ea9ef85ff", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main implements Runnable{\n public static void main(String[] args){\n //new Thread(null,new Main(),\"Thread-1\",1024*1024*10).start();\n new Main().run();\n }\n int mod=1000000007;\n private void solve() throws Exception {\n InputReader in = new InputReader(System.in);\n PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n int n=in.nextInt();\n long[][]dp=new long[n+1][n+1];\n dp[0][0]=1;\n for(int i=0;i<=n;i++){\n for(int j=i;j<=n;j++){\n if(j!=i)dp[i][j]+=dp[i][j-1];\n if(i!=0)dp[i][j]+=dp[i-1][j];\n dp[i][j]%=mod;\n }\n }\n long ans=0;\n for(int j=n;j>=0;j--){\n for(int i=j-1;i>=0;i-=2){\n ans+=dp[i][j];\n ans%=mod;\n }\n }\n out.println(ans);\n out.flush();\n }\n /*\n long get(int a,int turn){\n int x=(turn-a);\n if(x%2!=0)return 0;\n x/=2;\n return fac[turn]*inv[x]%mod*inv[turn-x]%mod;\n }\n void init(){\n int n=2000;\n inv[0]=fac[0]=fac[1]=1;\n for(int i=2;i<=n;i++)fac[i]=(fac[i-1]*i)%mod;\n inv[n]=pow(fac[n],mod-2);\n for(int i=n-1;i>=1;i--){\n inv[i]=(inv[i+1]*(i+1))%mod;\n }\n }\n long pow(long a,int b){\n long ans=1;\n while(b>0){\n if((b&1)==1)ans=(ans*a)%mod;\n a=(a*a)%mod;\n b>>=1;\n }\n return ans;\n }*/\n @Override\n public void run() {\n try {\n solve();\n } catch (Exception e) {\n e.printStackTrace();\n }\n }\n class InputReader{\n StreamTokenizer tokenizer;\n public InputReader(InputStream stream){\n tokenizer=new StreamTokenizer(new BufferedReader(new InputStreamReader(stream)));\n tokenizer.ordinaryChars(33,126);\n tokenizer.wordChars(33,126);\n }\n public String next() throws IOException {\n tokenizer.nextToken();\n return tokenizer.sval;\n }\n public int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n public long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n public boolean hasNext() throws IOException {\n int res=tokenizer.nextToken();\n tokenizer.pushBack();\n return res!=tokenizer.TT_EOF;\n }\n }\n}", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "f355cda4f1d474b333858708806c5545", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class Codeforces {\n final static int P = 1000000007;\n public static void main(String[] args) {\n Scanner input = new Scanner(System.in);\n int n = input.nextInt();\n int[][] table = new int[n+1][n+1]; \n table[0][0] = 0;\n for (int i=0; i<=n; i++) for (int j=i; j<=n; j++) {\n if (i == 0 && j == 0) continue;\n else if (i == 0) table[i][j] = (table[i][j-1]+(i+j&1))%P;\n else if (j == 0) table[i][j] = (table[i-1][j]+(i+j&1))/P;\n else table[i][j] = (table[i-1][j] + table[i][j-1] + (i+j&1))%P;\n }\n System.out.println(table[n][n]);\n }\n}", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "7191bbf25db4d1bbcd7a79d4ecfeface", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.math.*;\n\n// **** D. Neko and Aki's Prank ****\n\npublic class D {\n\tstatic char [] in = new char [1000000];\n\tstatic int MOD = 1000000007;\n\tstatic long modinv2 = BigInteger.valueOf(2).modInverse(BigInteger.valueOf(MOD)).longValue();\n\tstatic long [][][] dp = new long [2][2001][2001];\n\tpublic static void main (String [] arg) throws Throwable {\n\t\tint n = nextInt();\n\t\tfor (int i = 0; i<dp[1].length; ++i) Arrays.fill(dp[0][i], -1);\n\t\tfor (int i = 0; i<dp[1].length; ++i) Arrays.fill(dp[1][i], -1);\n\t\t\n\t\tlong ans = recurse(0,0,0,2*n);\n\t\tSystem.out.println(( n == 1) ? 1 : ans % MOD);\n\t}\n\tpublic static long recurse( int pos, int k, int T, int n) {\n\t\tif (k < 0) return 0;\n\t\tif (k > n-pos) return 0;\n\t\tif (n == pos) return 0;\n\t\tif (dp[T][pos][k] != -1) return dp[T][pos][k];\n\t\tlong ans = 0;\n\t\tif (T == 1) {\n\t\t\tans = recurse(pos+1, k-1, 0, n) + recurse(pos+1, k+1, 0, n);\n\t\t\t//System.err.println(\"AT POS \" + pos + \" with k =\" + k + \" and T=1 ans is \" + ans);\n\t\t} else {\n\t\t\tif (k >= 1 && k+1 <= n-pos-1) {\n\t\t\t\tlong tmp1 = 1 + recurse(pos+1, k+1, 1, n) + recurse(pos+1, k-1, 0, n);\n\t\t\t\tlong tmp2 = 1 + recurse(pos+1, k+1, 0, n) + recurse(pos+1, k-1, 1, n);\n\t\t\t\t\n\t\t\t\tans = Math.max(tmp1, tmp2);\n\t\t\t\tlong t1 = ans;\n\t\t\t\tlong t2 = Math.min(tmp1, tmp2);\n\t\t\t\tif (t2 == 0 && t1 == MOD-1) ans = 0;\n\t\t\t\tif (t2 == 1 && t1 == MOD-1) ans = 1;\n\t\t\t\tif (t2 == 0 && t1 == MOD-2) ans = 0;\n\t\t\t} else if (k < 1) {\n\t\t\t\tans = 1 + recurse(pos+1, k+1, 1, n);\n\t\t\t} else {\n\t\t\t\tans = 1 + recurse(pos+1, k-1, 1, n);\n\t\t\t}\n\t\t\t//System.err.println(\"AT POS \" + pos + \" with k = \" + k + \" ans is \" + ans);\n\t\t}\n\t\tdp[T][pos][k] = ans % MOD;\n\t\treturn dp[T][pos][k];\n\t}\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t/************** FAST IO CODE FOLLOWS *****************/\n\tpublic static long nextLong() throws Throwable {\n\t\tlong i = System.in.read();boolean neg = false;while (i < 45) i = System.in.read();if (i == 45) {neg=true;i=48;}i = i - 48;\n\t\tint j = System.in.read();while (j > 32) {i*=10;i+=j-48;j = System.in.read();}return (neg) ? -i : i;\n\t}\n\tpublic static int nextInt() throws Throwable {return (int)nextLong();}\n\tpublic static String next() throws Throwable {\n\t\tint i = 0; while (i < 40 && i != -1) i = System.in.read(); int cptr = 0; while (i >= 40) { in[cptr++] = (char)i; i = System.in.read();}\n\t\treturn new String(in, 0,cptr);\n\t}\n\t/**** LIBRARIES ****/\n\tpublic static long gcdL(long a, long b) {while (b != 0) {long tmp = b;b = (a % b);a = tmp;}return a;}\n\tpublic static int gcd(int a, int b) {while (b != 0) {int tmp = b;b = (a % b);a = tmp;}return a;}\n\tpublic static int[] sieve(int LIM) {\n\t\tint i,count = 0;\n\t\tboolean [] b = new boolean [LIM];\n\t\tfor (i = 2;i<LIM; ++i) if (!b[i]) {count++; for (int j = i<<1; j<LIM; j+=i) b[j] = true;}\n\t\tint [] primes = new int[count];\n\t\tfor (i = 2,count=0;i<LIM;++i) if (!b[i]) primes[count++] = i;\n\t\treturn primes;\n\t}\n\tpublic static int[] numPrimeFactors(int LIM) {\n\t\tint i,count = 0;\n\t\tint [] b = new int [LIM];\n\t\tfor (i = 2;i<LIM; ++i) if (b[i] == 0) {count++; for (int j = i; j<LIM; j+=i) b[j]++;}\n\t\treturn b;\n\t}\n}\n\n/* Full Problem Text:\n \nNeko is playing with his toys on the backyard of Aki's house.\nAki decided to play a prank on him, by secretly putting catnip into Neko's toys.\nUnfortunately, he went overboard and put an entire bag of catnip into the toys...\nIt took Neko an entire day to turn back to normal.\nNeko reported to Aki that he saw a lot of weird things, including a trie of all correct bracket sequences of length 2n.\nThe definition of correct bracket sequence is as follows:\n \n The empty sequence is a correct bracket sequence, \n If s is a correct bracket sequence, then (\\,s\\,) is a correct bracket sequence, \n If s and t are a correct bracket sequence, then st is also a correct bracket sequence.\nFor example, the strings \"(())\", \"()()\" form a correct bracket sequence, while \")(\" and \"((\" not.\nAki then came up with an interesting problem: What is the size of the maximum matching (the largest set of edges with disjoint ends) in this trie? Since the answer can be quite large, print it modulo 10^9 + 7.\n\n */", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "8ed39fa6ca778cdad7277c81a82cce8f", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.Scanner;\n\npublic class Kek {\n static Scanner scan = new Scanner(System.in);\n\n static int nextInt() {\n return Integer.parseInt(scan.next());\n }\n\n static String nextString() {\n return scan.next();\n }\n\n public static void main(String[] args) throws IOException {\n long MOD = 1000000007L;\n int n = nextInt();\n long[][] d = new long[2 * n + 1][n + 2];\n d[0][0] = 1;\n for (int i = 1; i < 2 * n + 1; i++) {\n d[i][0] = (d[i - 1][1] % MOD);\n for (int j = 1; j < n + 1 && j + i <= 2 * n ; j++) {\n d[i][j] = (d[i - 1][j + 1] + d[i - 1][j - 1]) % MOD;\n }\n }\n long s = 0;\n for (int i = 2 * n - 1; i >= 0; i -= 2) {\n for (int j = 0; j < n + 1; j++) {\n s += d[i][j];\n s %= MOD;\n }\n }\n System.out.println(s);\n }\n}\n", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "35e931ab0946b98146f408709ad03663", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\n/*\n * To change this license header, choose License Headers in Project Properties.\n * To change this template file, choose Tools | Templates\n * and open the template in the editor.\n */\n\n/**\n *\n * @author Andy Phan (Edited for speedups by AuroraGarden)\n */\npublic class p1152d {\n static boolean[][] hasVal;\n static boolean[][] doneVal;\n static long[][][] dp;\n static boolean[][][] done;\n \n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int n = in.nextInt();\n hasVal = new boolean[2*n+1][2*n+1];\n doneVal = new boolean[2*n+1][2*n+1];\n dp = new long[2*n+1][2*n+1][2];\n done = new boolean[2*n+1][2*n+1][2];\n System.out.println(traverse(2*n, 0, 0)%1_000_000_007);\n }\n \n public static long traverse(int ind, int diff, int flag) {\n if(ind <= 0 || diff < 0) return 0;\n if(done[ind][diff][flag]) return dp[ind][diff][flag];\n done[ind][diff][flag] = true;\n long num = 0;\n if(flag == 1) {\n if(hasVal(ind-1, diff-1)) num += traverse(ind-1, diff-1, 0);\n if(hasVal(ind-1, diff+1)) num += traverse(ind-1, diff+1, 0);\n if(num >= 1_000_000_007) num -= 1_000_000_007;\n return dp[ind][diff][flag] = num;\n }\n if(hasVal(ind-1, diff-1)) {\n long tmp = traverse(ind-1, diff-1, 1)+1;\n if(hasVal(ind-1, diff+1)) tmp += traverse(ind-1, diff+1, 0);\n num = max(num, tmp);\n }\n if(hasVal(ind-1, diff+1)) {\n long tmp = traverse(ind-1, diff+1, 1)+1;\n if(hasVal(ind-1, diff-1)) tmp += traverse(ind-1, diff-1, 0);\n num = max(num, tmp);\n }\n if(num >= 1_000_000_007) num -= 1_000_000_007;\n return dp[ind][diff][flag] = num;\n }\n static long max(long a, long b) {return a > b ? a : b;}\n \n public static boolean hasVal(int ind, int diff) {\n if(diff < 0) return false;\n return diff <= ind;\n }\n}", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "7f01508e6a1418683a7440d5f4dc8d9f", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.StringTokenizer;\nimport java.io.BufferedReader;\nimport java.util.Comparator;\nimport java.util.Collections;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskF solver = new TaskF();\n solver.solve(1, in, out);\n out.close();\n }\n static class TaskF {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int N = in.nextInt();\n int MOD = 1_000_000_007;\n int[][] dp1 = new int[N+1][N+1];\n int[][] dp2 = new int[N+1][N+1];\n \n for (int x = N; x >= 0; --x)\n for (int y = N; y >= 0; --y) {\n int d1=0;\n int d2=0;\n // calc d2\n if (x+1 <= N) {\n int m = Math.max(dp1[x+1][y], dp2[x+1][y]);\n d2 += m;\n }\n d2 %= MOD;\n if (y+1 <= Math.min(x, N)) {\n int m = Math.max(dp1[x][y+1], dp2[x][y+1]);\n d2 += m;\n }\n d2 %= MOD;\n \n if (x+1 <= N) {\n int m = Math.max(dp1[x+1][y], dp2[x+1][y]);\n d1 = Math.max(d1, 1+d2-m + dp2[x+1][y]);\n d1 %= MOD;\n if (d1 < 0) d1 += MOD;\n }\n if (y+1 <= Math.min(x, N)) {\n int m = Math.max(dp1[x][y+1], dp2[x][y+1]);\n d1 = Math.max(d1, 1+d2-m + dp2[x][y+1]);\n d1 %= MOD;\n if (d1 < 0) d1 += MOD;\n }\n d1 %= MOD;\n if (d1 < 0) d1 += MOD;\n d2 %= MOD;\n if (d2 < 0) d2 += MOD;\n \n dp1[x][y]=d1;\n dp2[x][y]=d2;\n }\n \n int ans = Math.max(dp1[0][0], dp2[0][0]);\n \n out.print(\"\" + ans);\n out.println();\n\n }\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}\n", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "4e3149cd2314e1a523ac14162ee7bf32", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//Created by Aminul on 4/24/2019.\n\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\nimport static java.lang.Math.max;\n\npublic class D {\n static int n;\n static long dp[][][], mod = (long) 1e9 + 7, inf = (long) 1e18;\n\n public static void main(String[] args) throws Exception {\n Scanner in = new Scanner(System.in);\n PrintWriter pw = new PrintWriter(System.out);\n n = in.nextInt();\n dp = new long[2][n + n + 1][n + n + 1];\n for (long a[][] : dp) for (long b[] : a) Arrays.fill(b, -1);\n pw.println(solve(0, 0, 0));\n pw.close();\n }\n\n static long solve(int last, int pos, int sum) {\n if (pos >= n + n) {\n if (sum == 0) return 0;\n return -inf;\n }\n if (dp[last][pos][sum] != -1) return dp[last][pos][sum];\n long ans = 0, a = 0, b = 0, rem = n + n - pos;\n if (rem >= sum + 1) a = max(0, solve(0, pos + 1, sum + 1));\n if (sum - 1 >= 0) b = max(0, solve(0, pos + 1, sum - 1));\n ans = max(ans, a + b);\n if (last == 0) {\n a = 0;\n b = 0;\n if (rem >= sum + 1) a = max(0, solve(1, pos + 1, sum + 1));\n if (sum - 1 >= 0) b = max(0, solve(1, pos + 1, sum - 1));\n ans = max(ans, 1 + a + b);\n }\n if (ans >= 0) ans %= mod;\n return dp[last][pos][sum] = ans;\n }\n\n static void debug(Object... obj) {\n System.err.println(Arrays.deepToString(obj));\n }\n}", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "04cc834505e577f3059f4e15a35172fe", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.io.FilterInputStream;\nimport java.io.BufferedInputStream;\nimport java.io.InputStream;\n\n/**\n * @author khokharnikunj8\n */\n\npublic class Main {\n public static void main(String[] args) {\n new Thread(null, new Runnable() {\n public void run() {\n new Main().solve();\n }\n }, \"1\", 1 << 26).start();\n }\n\n void solve() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n ScanReader in = new ScanReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n DNekoAndAkisPrank solver = new DNekoAndAkisPrank();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class DNekoAndAkisPrank {\n long mod = 1_000_000_000 + 7;\n\n public void solve(int testNumber, ScanReader in, PrintWriter out) {\n int n = in.scanInt();\n long[][] dp = new long[2 * n + 1][2 * n + 1];\n long ans = 0;\n dp[0][0] = 1;\n for (int i = 1; i <= 2 * n; i++) {\n for (int j = 0; j <= i; j++) {\n if (j != 0) dp[i][j] = (dp[i][j] + (dp[i - 1][j - 1])) % mod;\n if (j + 1 <= 2 * n) dp[i][j] = (dp[i][j] + dp[i - 1][j + 1]) % mod;\n }\n if (i % 2 == 1) for (int j = 0; j <= Math.min(i, 2 * n - i); j++) ans = (ans + dp[i][j]) % mod;\n }\n out.println(ans % mod);\n }\n\n }\n\n static class ScanReader {\n private byte[] buf = new byte[4 * 1024];\n private int index;\n private BufferedInputStream in;\n private int total;\n\n public ScanReader(InputStream inputStream) {\n in = new BufferedInputStream(inputStream);\n }\n\n private int scan() {\n if (index >= total) {\n index = 0;\n try {\n total = in.read(buf);\n } catch (Exception e) {\n e.printStackTrace();\n }\n if (total <= 0) return -1;\n }\n return buf[index++];\n }\n\n public int scanInt() {\n int integer = 0;\n int n = scan();\n while (isWhiteSpace(n)) n = scan();\n int neg = 1;\n if (n == '-') {\n neg = -1;\n n = scan();\n }\n while (!isWhiteSpace(n)) {\n if (n >= '0' && n <= '9') {\n integer *= 10;\n integer += n - '0';\n n = scan();\n }\n }\n return neg * integer;\n }\n\n private boolean isWhiteSpace(int n) {\n if (n == ' ' || n == '\\n' || n == '\\r' || n == '\\t' || n == -1) return true;\n else return false;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "1cf5c87d6a132bbbdb6daa6a57268af3", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.io.FilterInputStream;\nimport java.io.BufferedInputStream;\nimport java.io.InputStream;\n\n/**\n * @author khokharnikunj8\n */\n\npublic class Main {\n public static void main(String[] args) {\n new Thread(null, new Runnable() {\n public void run() {\n new Main().solve();\n }\n }, \"1\", 1 << 26).start();\n }\n\n void solve() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n ScanReader in = new ScanReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n DNekoAndAkisPrank solver = new DNekoAndAkisPrank();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class DNekoAndAkisPrank {\n long mod = 1_000_000_000 + 7;\n\n public void solve(int testNumber, ScanReader in, PrintWriter out) {\n int n = in.scanInt();\n long[][] dp = new long[2 * n + 1][2 * n + 1];\n long ans = 0;\n dp[0][0] = 1;\n for (int i = 1; i <= 2 * n; i++) {\n for (int j = 0; j <= i; j++) {\n if (j != 0) dp[i][j] = (dp[i][j] + (dp[i - 1][j - 1])) % mod;\n if (j + 1 <= 2 * n) dp[i][j] = (dp[i][j] + dp[i - 1][j + 1]) % mod;\n }\n if (i % 2 == 1) for (int j = 0; j <= 2 * n - i; j++) ans = (ans + dp[i][j]) % mod;\n }\n out.println(ans % mod);\n }\n\n }\n\n static class ScanReader {\n private byte[] buf = new byte[4 * 1024];\n private int index;\n private BufferedInputStream in;\n private int total;\n\n public ScanReader(InputStream inputStream) {\n in = new BufferedInputStream(inputStream);\n }\n\n private int scan() {\n if (index >= total) {\n index = 0;\n try {\n total = in.read(buf);\n } catch (Exception e) {\n e.printStackTrace();\n }\n if (total <= 0) return -1;\n }\n return buf[index++];\n }\n\n public int scanInt() {\n int integer = 0;\n int n = scan();\n while (isWhiteSpace(n)) n = scan();\n int neg = 1;\n if (n == '-') {\n neg = -1;\n n = scan();\n }\n while (!isWhiteSpace(n)) {\n if (n >= '0' && n <= '9') {\n integer *= 10;\n integer += n - '0';\n n = scan();\n }\n }\n return neg * integer;\n }\n\n private boolean isWhiteSpace(int n) {\n if (n == ' ' || n == '\\n' || n == '\\r' || n == '\\t' || n == -1) return true;\n else return false;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "efef820063909cf0abab175f784fa5ff", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n\npublic class Main {\n static class FastScanner {\n private BufferedReader bufferedReader;\n private StringTokenizer stringTokenizer;\n public FastScanner(InputStream inputStream){\n bufferedReader = new BufferedReader(new InputStreamReader(inputStream));\n }\n public String next() {\n while (stringTokenizer == null || !stringTokenizer.hasMoreTokens()){\n try {\n stringTokenizer = new StringTokenizer(bufferedReader.readLine());\n } catch (IOException ignored){}\n }\n return stringTokenizer.nextToken();\n }\n public int nextInt() {\n return Integer.parseInt(next());\n }\n public long nextLong() {\n return Long.parseLong(next());\n }\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n }\n\n static class Node implements Comparable {\n Node left;\n Node right;\n private int value;\n private char c;\n\n Node(Node left, Node right, char c, int value) {\n this.left = left;\n this.right = right;\n this.value = value;\n this.c = c;\n }\n\n @Override\n public int compareTo(Object o) {\n return Integer.compare(this.value, ((Node)o).value);\n }\n }\n\n private static int fib(int n, int m){\n if (n < 2) return n;\n int a = 0;\n int b = 1;\n for (int i=0;i<n-2;i++){\n int c = (a + b) % m;\n a = b;\n b = c;\n }\n return (a + b) % m;\n }\n\n static long gcd(long a, long b) {\n if (b == 0) return a;\n return gcd(b, a % b);\n }\n\n static long lcm(long a, long b) {\n return Math.abs(a * b) / gcd(a, b);\n }\n\n static long dp[][][] = new long[2][2001][2001];\n\n static long m = 1_000_000_000 + 7;\n\n static long f(int o, int n, boolean canUse) {\n int k = canUse ? 1 : 0;\n if (dp[k][o][n] == -1) {\n if (n == 0) return 0;\n int d = canUse ? 1 : 0;\n if (o == 0) {\n dp[k][o][n] = f(o + 1, n - 1, !canUse) + d;\n }\n else if (n == o) {\n dp[k][o][n] = f(o - 1, n - 1, !canUse) + d;\n }\n else if (canUse) {\n dp[k][o][n] = f(o + 1, n - 1, false) + 1 + f(o - 1, n - 1, true);\n }\n else {\n dp[k][o][n] = f(o + 1, n - 1, true) + f(o - 1, n - 1, true);\n }\n }\n return dp[k][o][n] % m;\n }\n\n public static void main(String[] args){\n FastScanner scanner = new FastScanner(System.in);\n PrintWriter printer = new PrintWriter(System.out);\n int n = scanner.nextInt() * 2;\n for (int i = 0; i < 2; i++) {\n for (int j = 0; j < 2001; j++) {\n for (int k = 0; k < 2001; k++) {\n dp[i][j][k] = -1;\n }\n }\n }\n printer.println(f(0, n, true));\n printer.flush();\n printer.close();\n }\n}", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "c8c83f363709234d0b072321a064fc4b", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n DNekoIPrank solver = new DNekoIPrank();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class DNekoIPrank {\n\n static final int MOD = (int) 1e9 + 7;\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.nextInt() * 2;\n int[][][] dp = new int[n + 1][n + 1][2]; // left, toClose, prev\n for (int i = 1; i <= n; i++) {\n for (int h = 0; h <= i; h++) {\n if ((i - h) % 2 != 0) {\n continue;\n }\n if (h + 1 <= i - 1) {\n dp[i][h][0] = (dp[i - 1][h + 1][1] + 1) % MOD;\n dp[i][h][1] = dp[i - 1][h + 1][0];\n if (h > 0) {\n dp[i][h][0] = (dp[i][h][0] + dp[i - 1][h - 1][0]) % MOD;\n dp[i][h][1] = (dp[i][h][1] + dp[i - 1][h - 1][0]) % MOD;\n }\n } else {\n dp[i][h][0] = (dp[i - 1][h - 1][1] + 1) % MOD;\n dp[i][h][1] = dp[i - 1][h - 1][0];\n }\n }\n }\n out.println(dp[n][0][0]);\n }\n }\n\n static class InputReader {\n\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n }\n}\n\n", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "befe41d627bdc8664de2721d4f81f1d6", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.IOException;\nimport java.util.Scanner;\n\npublic class NekoAndAkiPrank {\n private final static long MOD = 1_000_000_007;\n\n public void solve() throws IOException {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n long[][] ways = new long[n * 2][n + 1];\n long tWays = 0;\n ways[0][0] = 1;\n for (int i = 1; i < 2 * n; i++) {\n ways[i][0] = ways[i - 1][1];\n ways[i][n] = ways[i - 1][n - 1];\n for (int k = 1; k < n; k++) {\n ways[i][k] = (ways[i - 1][k - 1] + ways[i - 1][k + 1]) % MOD;\n }\n if (i % 2 == 1) {\n for (int k = 0; k <= Math.min(i, 2 * n - i); k++) {\n tWays = (tWays + ways[i][k]) % MOD;\n }\n }\n }\n System.out.println(tWays);\n }\n\n public static void main(String[] args) throws IOException {\n NekoAndAkiPrank solution = new NekoAndAkiPrank();\n solution.solve();\n }\n}\n", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "16d8951cdcc2c4bc51dad0ee5ef50523", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class R554D\n{\n\t\n\tstatic long mod = (long)(1e9)+7;\n\tstatic long[] fact = new long[3000];\n\tstatic int n;\n\tstatic long[][][] memo;\n\t\n\t\n public static void main (String[] args) \n { \n JS scan = new JS();\n n = scan.nextInt();\n memo = new long[2][n+1][n+1];\n for(int i = 0; i < 2; i++){\n \tfor(int j = 0; j <= n; j++){\n \t\tArrays.fill(memo[i][j], -1);\n \t}\n }\n System.out.println(solve(0, 0, 0)); //DON'T SUBMIT BEFORE YOU MOD\n }\n \n static long solve(int cant, int i, int j){\n \tif(memo[cant][i][j] != -1) return memo[cant][i][j];\n \tlong resNoTake = 0;\n \tif(i < n) resNoTake += solve(0, i+1, j);\n \tif(j < i) resNoTake += solve(0, i, j+1);\n \tresNoTake %= mod;\n \tif(cant == 1) return memo[cant][i][j] = resNoTake;\n \t\n \tlong resTake = 0;\n \tlong op1 = 0;\n \tlong op2 = 0;\n \tif(i < n){\n \t\top1 = 1+solve(1, i+1, j);\n \t\tif(j < i){\n \t\t\top1 += solve(0, i, j+1);\n \t\t}\n \t\top1 %= mod;\n \t}\n \tif(j < i){\n \t\top2 = 1+solve(1, i, j+1);\n \t\tif(i < n){\n \t\t\top2 += solve(0, i+1, j);\n \t\t}\n \t\top2 %= mod;\n \t}\n \tresTake = Math.max(op1, op2);\n \t\n \treturn memo[cant][i][j] = Math.max(resTake, resNoTake);\n }\n \n \n static long power(long x, long y, long p) \n { \n // Initialize result \n \tlong res = 1; \n \n // Update x if it is more than or \n // equal to p \n x = x % p; \n \n while (y > 0) \n { \n \n // If y is odd, multiply x \n // with result \n if (y % 2 == 1) \n res = (res * x) % p; \n \n // y must be even now \n y = y >> 1; // y = y/2 \n x = (x * x) % p; \n } \n return res; \n } \n \n // Returns n^(-1) mod p \n static long modInverse(long n, long p) \n { \n return power(n, p-2, p); \n } \n\t\n\tstatic void _printParenthesis(char str[], int pos, int n, int open, int close) \n { \n if(close == n) \n { \n // print the possible combinations \n for(int i=0;i<str.length;i++) \n System.out.print(str[i]); \n System.out.println(); \n return; \n } \n else\n { \n if(open > close) { \n str[pos] = '}'; \n _printParenthesis(str, pos+1, n, open, close+1); \n } \n if(open < n) { \n str[pos] = '{'; \n _printParenthesis(str, pos+1, n, open+1, close); \n } \n } \n } \n \n // Wrapper over _printParenthesis() \n static void printParenthesis(char str[], int n) \n { \n if(n > 0) \n _printParenthesis(str, 0, n, 0, 0); \n return; \n } \n \n \n\n\t\n\tstatic class JS{\n\t\tpublic int BS = 1<<16;\n\t\tpublic char NC = (char)0;\n\t\tbyte[] buf = new byte[BS];\n\t\tint bId = 0, size = 0;\n\t\tchar c = NC;\n\t\tdouble num = 1;\n\t\tBufferedInputStream in;\n\n\t\tpublic JS() {\n\t\t\tin = new BufferedInputStream(System.in, BS);\n\t\t}\n\n\t\tpublic JS(String s) throws FileNotFoundException {\n\t\t\tin = new BufferedInputStream(new FileInputStream(new File(s)), BS);\n\t\t}\n\n\t\tpublic char nextChar(){\n\t\t\twhile(bId==size) {\n\t\t\t\ttry {\n\t\t\t\t\tsize = in.read(buf);\n\t\t\t\t}catch(Exception e) {\n\t\t\t\t\treturn NC;\n\t\t\t\t}\t\t\t\t\n\t\t\t\tif(size==-1)return NC;\n\t\t\t\tbId=0;\n\t\t\t}\n\t\t\treturn (char)buf[bId++];\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn (int)nextLong();\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\tnum=1;\n\t\t\tboolean neg = false;\n\t\t\tif(c==NC)c=nextChar();\n\t\t\tfor(;(c<'0' || c>'9'); c = nextChar()) {\n\t\t\t\tif(c=='-')neg=true;\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tfor(; c>='0' && c <='9'; c=nextChar()) {\n\t\t\t\tres = (res<<3)+(res<<1)+c-'0';\n\t\t\t\tnum*=10;\n\t\t\t}\n\t\t\treturn neg?-res:res;\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\tdouble cur = nextLong();\n\t\t\treturn c!='.' ? cur:cur+nextLong()/num;\n\t\t}\n\n\t\tpublic String next() {\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\twhile(c<=32)c=nextChar();\n\t\t\twhile(c>32) {\n\t\t\t\tres.append(c);\n\t\t\t\tc=nextChar();\n\t\t\t}\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tpublic String nextLine() {\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\twhile(c<=32)c=nextChar();\n\t\t\twhile(c!='\\n') {\n\t\t\t\tres.append(c);\n\t\t\t\tc=nextChar();\n\t\t\t}\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tpublic boolean hasNext() {\n\t\t\tif(c>32)return true;\n\t\t\twhile(true) {\n\t\t\t\tc=nextChar();\n\t\t\t\tif(c==NC)return false;\n\t\t\t\telse if(c>32)return true;\n\t\t\t}\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "a16d93ad55a9edbcef20c893721175c4", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class B {\n\n\tstatic int n,MOD=(int)1e9+7;\n\tstatic int [][][]memo;\n\tstatic int dp(int balance,int length,int free) {\n\t\t\n\t\tint open=balance + (length-balance)/2;\n\t\tif(length==2*n)\n\t\t\treturn 0;\n\t\tif(memo[free][balance][length]!=-1)\n\t\t\treturn memo[free][balance][length];\n\t\tint ans=0;\n\t\tif(open<n) {\n\t\t\tans += Math.max(dp(balance+1,length+1, 1),dp(balance+1,length+1,free^1)+free);\n\t\t\tif(ans>=MOD)\n\t\t\t\tans-=MOD;\n\t\t}\n\t\tif(balance>0) {\n\t\t\tint x=+open<n?0:free;\n\t\t\tans += Math.max(dp(balance-1,length+1, 1),dp(balance-1,length+1,x^1)+x);\n\t\t\tif(ans>=MOD)\n\t\t\t\tans-=MOD;\n\t\t}\n\t\treturn memo[free][balance][length]=ans;\n\t\t\n\t}\n\tpublic static void main(String[] args) throws IOException {\n\t\tScanner sc = new Scanner();\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tn=sc.nextInt();\n\t\tmemo=new int [2][n+1][2*n+1];\n\t\tfor(int i=0;i<2;i++)\n\t\t\tfor(int j=0;j<=n;j++)\n\t\t\t\tArrays.fill(memo[i][j], -1);\n\t\tout.println(dp(0,0,1));\n\t\tout.close();\n\n\t}\n\n\tstatic class Scanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tScanner() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tScanner(String fileName) throws FileNotFoundException {\n\t\t\tbr = new BufferedReader(new FileReader(fileName));\n\t\t}\n\n\t\tString next() throws IOException {\n\t\t\twhile (st == null || !st.hasMoreTokens())\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tString nextLine() throws IOException {\n\t\t\treturn br.readLine();\n\t\t}\n\n\t\tint nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tlong nextLong() throws NumberFormatException, IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tdouble nextDouble() throws NumberFormatException, IOException {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "fffdbcbb6bddec780ae2e53e8722e6a1", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport static java.lang.Math.*;\npublic class Main {\n static final long MOD = 1_000_000_007 , INF = 1_000_000_000_000_000L;\n static final int INf = 1_000_000_000;\n static FastReader reader;\n static PrintWriter writer;\n public static void main(String[] args) {\n Thread t = new Thread(null, new O(), \"Integer.MAX_VALUE\", 100000000);\n t.start();\n }\n static class O implements Runnable {\n public void run() {\n try {\n magic();\n }\n catch (Exception e) {\n e.printStackTrace();\n System.exit(1);\n }\n }\n }\n static class FastReader {\n final private int BUFFER_SIZE = 1 << 16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n\n public FastReader() {\n din = new DataInputStream(System.in);\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public FastReader(String file_name) throws IOException {\n din = new DataInputStream(new FileInputStream(file_name));\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public String readLine() throws IOException {\n byte[] buf = new byte[1000000];\n int cnt = 0, c;\n while ((c = read()) != -1) {\n if (c == '\\n') break;\n buf[cnt++] = (byte) c;\n }\n return new String(buf, 0, cnt);\n }\n\n public int nextInt() throws IOException {\n int ret = 0;\n byte c = read();\n while (c <= ' ') c = read();\n boolean neg = (c == '-');\n if (neg) c = read();\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n if (neg) return -ret;\n return ret;\n }\n\n public long nextLong() throws IOException {\n long ret = 0;\n byte c = read();\n while (c <= ' ') c = read();\n boolean neg = (c == '-');\n if (neg) c = read();\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n if (neg) return -ret;\n return ret;\n }\n\n public double nextDouble() throws IOException {\n double ret = 0, div = 1;\n byte c = read();\n while (c <= ' ') c = read();\n boolean neg = (c == '-');\n if (neg) c = read();\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n if (c == '.') while ((c = read()) >= '0' && c <= '9') ret += (c - '0') / (div *= 10);\n if (neg) return -ret;\n return ret;\n }\n\n private void fillBuffer() throws IOException {\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1) buffer[0] = -1;\n }\n\n private byte read() throws IOException {\n if (bufferPointer == bytesRead) fillBuffer();\n return buffer[bufferPointer++];\n }\n\n public void close() throws IOException {\n if (din == null) return;\n din.close();\n }\n }\n static int n;\n static Pair dp[][];\n static void magic() throws IOException {\n reader = new FastReader();\n writer = new PrintWriter(System.out, true);\n n = reader.nextInt();\n dp = new Pair[2 * n + 1][2 * n + 1];\n writer.println(f(0,0).ans);\n\n }\n static Pair f(int idx, int open_count) {\n if(idx==2*n) {\n if(open_count==0) {\n return new Pair(0, true);\n }\n else {\n return new Pair(0, false);\n }\n }\n if(dp[idx][open_count]!=null) {\n return dp[idx][open_count];\n }\n Pair left = new Pair(0, false);\n int udhar = 2*n - idx - 1;\n if(udhar>open_count) {\n left = f(idx+1, open_count+1);\n }\n Pair right = open_count>0 ? f(idx+1, open_count-1) : new Pair(0, false);\n if(left.free || right.free) {\n return dp[idx][open_count] = new Pair((int)((left.ans+right.ans+1)%MOD), false);\n }\n else {\n return dp[idx][open_count] = new Pair((int)((left.ans+right.ans)%MOD), true);\n }\n }\n static class Pair {\n int ans;\n boolean free;\n Pair(int ans, boolean free) {\n this.ans = ans;\n this.free = free;\n }\n }\n}", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "0c803cd6999f9ba69aa85f8f59931699", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Rustam Musin (t.me/musin_acm)\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n DNekoIPrank solver = new DNekoIPrank();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class DNekoIPrank {\n int mod = (int) 1e9 + 7;\n\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n = in.readInt();\n int ans = new Solve().solve(n);\n out.print(ans);\n }\n\n class Solve {\n int solve(int n) {\n int[][][] dp = new int[2 * n + 1][2 * n + 1][2];\n dp[0][0][0] = 1;\n for (int depth = 1; depth <= 2 * n; depth++) {\n for (int opened = depth & 1; opened <= depth; opened += 2) {\n if (opened - 1 >= 0) {\n dp[depth][opened][0] += dp[depth - 1][opened - 1][1];\n dp[depth][opened][1] += dp[depth - 1][opened - 1][0];\n }\n if (opened + 1 <= n) {\n dp[depth][opened][0] += dp[depth - 1][opened + 1][1];\n dp[depth][opened][1] += dp[depth - 1][opened + 1][0];\n }\n dp[depth][opened][0]++;\n dp[depth][opened][0] %= mod;\n dp[depth][opened][1] %= mod;\n }\n }\n return dp[2 * n][0][1];\n }\n\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void print(int i) {\n writer.print(i);\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "7e2ca848df4e41aeba79f253b10d16d2", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.lang.*;\nimport java.math.*;\nimport java.util.*;\nimport java.io.*;\npublic class Main {\n void solve() {\n n=ni();\n dp=new int[2*n+1][n+1][2];\n for(int i=1;i<=2*n;i++) for(int j=0;j<=n;j++) Arrays.fill(dp[i][j],-1);\n int ans=go(1,0,0);\n pw.println(ans);\n }\n int dp[][][];\n int n;\n int go(int i,int j,int taken){\n if(j<0 || j>n) return Integer.MIN_VALUE;\n if(i>2*n){\n if(j==0) return 0;\n return Integer.MIN_VALUE;\n }\n // pw.println(i+\" \"+j+\" \"+dp[i][j][taken]);\n if(dp[i][j][taken]!=-1) return dp[i][j][taken];\n\n int cc=Integer.MIN_VALUE,d1=-1,d2=-1;\n\n d1=go(i+1,j+1,0);\n d2=go(i+1,j-1,0);\n if(d1==Integer.MIN_VALUE && d2==Integer.MIN_VALUE){\n\n }else {\n d1=Math.max(0,d1);\n d2=Math.max(0,d2);\n cc=add(d1,d2);\n }\n if(taken==0){\n d1=go(i+1,j+1,1);\n d2=go(i+1,j-1,1);\n if(d1==Integer.MIN_VALUE && d2==Integer.MIN_VALUE){\n\n }else {\n d1=Math.max(0,d1);\n d2=Math.max(0,d2);\n cc=Math.max(cc,add(1,add(d1,d2)));\n }\n\n }\n dp[i][j][taken]=cc;\n return cc;\n }\n\n int add(long a,long b){\n a+=b;\n if(a>=M)a-=M;\n return (int)a;\n }\n\n\n long M =(long)1e9+7;\n InputStream is;\n PrintWriter pw;\n String INPUT = \"\";\n\n void run() throws Exception {\n is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n pw = new PrintWriter(System.out);\n long s = System.currentTimeMillis();\n solve();\n pw.flush();\n if (!INPUT.isEmpty()) tr(System.currentTimeMillis() - s + \"ms\");\n\n\n }\n\n public static void main(String[] args) throws Exception {\n new Main().run();\n }\n\n private byte[] inbuf = new byte[1024];\n public int lenbuf = 0, ptrbuf = 0;\n\n private int readByte() {\n if (lenbuf == -1) throw new InputMismatchException();\n if (ptrbuf >= lenbuf) {\n ptrbuf = 0;\n try {\n lenbuf = is.read(inbuf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (lenbuf <= 0) return -1;\n }\n return inbuf[ptrbuf++];\n }\n\n private boolean isSpaceChar(int c) {\n return !(c >= 33 && c <= 126);\n }\n\n private int skip() {\n int b;\n while ((b = readByte()) != -1 && isSpaceChar(b)) ;\n return b;\n }\n\n private double nd() {\n return Double.parseDouble(ns());\n }\n\n private char nc() {\n return (char) skip();\n }\n\n private String ns() {\n int b = skip();\n StringBuilder sb = new StringBuilder();\n while (!(isSpaceChar(b))) { // when nextLine, (isSpaceChar(b) && b != ' ')\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n private char[] ns(int n) {\n char[] buf = new char[n];\n int b = skip(), p = 0;\n while (p < n && !(isSpaceChar(b))) {\n buf[p++] = (char) b;\n b = readByte();\n }\n return n == p ? buf : Arrays.copyOf(buf, p);\n }\n\n private char[][] nm(int n, int m) {\n char[][] map = new char[n][];\n for (int i = 0; i < n; i++) map[i] = ns(m);\n return map;\n }\n\n private int[] na(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) a[i] = ni();\n return a;\n }\n\n private int ni() {\n int num = 0, b;\n boolean minus = false;\n while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')) ;\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n\n while (true) {\n if (b >= '0' && b <= '9') {\n num = num * 10 + (b - '0');\n } else {\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n private long nl() {\n long num = 0;\n int b;\n boolean minus = false;\n while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')) ;\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n\n while (true) {\n if (b >= '0' && b <= '9') {\n num = num * 10 + (b - '0');\n } else {\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n private boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\n private void tr(Object... o) {\n if (INPUT.length() > 0) System.out.println(Arrays.deepToString(o));\n }\n\n}", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "60e0d382100b15c0b7fe9780956b0fd4", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class Main {\n\tpublic static void main(String args[]) {new Main().run();}\n\n\tFastReader in = new FastReader();\n\tPrintWriter out = new PrintWriter(System.out);\n\tvoid run(){\n\t\twork();\n\t\tout.flush();\n\t}\n\tlong mod=1000000007;\n\tlong gcd(long a,long b) {\n\t\treturn a==0?b:b>a?gcd(b%a,a):gcd(b,a);\n\t}\n\tvoid work() {\n\t\tint n=in.nextInt();\n\t\tlong[] dp=new long[2*n+1];\n\t\tlong ret=0;\n\t\tdp[0]=1;\n\t\tfor(int p=1;p<=2*n;p++) {\n\t\t\tlong[] ndp=new long[2*n+1];\n\t\t\tfor(int i=0;i<2*n;i++) {\n\t\t\t\tndp[i+1]+=dp[i];\n\t\t\t\tndp[i+1]%=mod;\n\t\t\t\tif(i-1>=0) {\n\t\t\t\t\tndp[i-1]+=dp[i];\n\t\t\t\t\tndp[i-1]%=mod;\n\t\t\t\t\tif(p%2==0) {\n\t\t\t\t\t\tint r=2*n-p;\n\t\t\t\t\t\tif(r>=i-1) {\n\t\t\t\t\t\t\tret+=dp[i];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tret%=mod;\n\t\t\tdp=ndp;\n\t\t}\n\t\tout.println(ret);\n\t}\n}\t\n\n\n\nclass FastReader\n{\n\tBufferedReader br;\n\tStringTokenizer st;\n\n\tpublic FastReader()\n\t{\n\t\tbr=new BufferedReader(new InputStreamReader(System.in));\n\t}\n\t\n\t\n\tpublic String next() \n\t{\n\t\tif(st==null || !st.hasMoreElements())\n\t\t{\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tpublic int nextInt() \n\t{\n\t\treturn Integer.parseInt(next());\n\t}\n\n\tpublic long nextLong()\n\t{\n\t\treturn Long.parseLong(next());\n\t}\n}", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "24879a496ed6c90aa3fd884defd4f9c2", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Rustam Musin (t.me/musin_acm)\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n DNekoIPrank solver = new DNekoIPrank();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class DNekoIPrank {\n int mod = (int) 1e9 + 7;\n\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n = in.readInt();\n int ans = new Solve().solve(n);\n out.print(ans);\n }\n\n class Solve {\n int solve(int n) {\n int[][][] dp = new int[2 * n + 1][2 * n + 1][2];\n dp[0][0][0] = 1;\n for (int depth = 1; depth <= 2 * n; depth++) {\n for (int opened = depth & 1; opened <= depth; opened += 2) {\n if (opened - 1 >= 0) {\n dp[depth][opened][0] += dp[depth - 1][opened - 1][1];\n dp[depth][opened][1] += dp[depth - 1][opened - 1][0];\n }\n if (opened + 1 < dp[depth - 1].length) {\n dp[depth][opened][0] += dp[depth - 1][opened + 1][1];\n dp[depth][opened][1] += dp[depth - 1][opened + 1][0];\n }\n dp[depth][opened][0]++;\n dp[depth][opened][0] %= mod;\n dp[depth][opened][1] %= mod;\n }\n }\n return dp[2 * n][0][1];\n }\n\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void print(int i) {\n writer.print(i);\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "c4b81193822793e264955e0748bbc13a", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class Main {\n private static Scanner sc = new Scanner(System.in);\n private static int mod = 1000000007;\n public static void main(String[] args) {\n int [][]dp = new int[2005][22005];\n int [][]ok = new int[2005][2005];\n ok[0][0] = 1;\n for(int i = 1; i <= 2000; i++){\n for(int j = i & 1; j <= i; j += 2){\n if(j == 0) {\n dp[i][j] = dp[i - 1][j + 1];\n if(ok[i - 1][j + 1] == 1)\n dp[i][j] = (dp[i][j] + 1) % mod;\n else\n ok[i][j] = 1;\n continue;\n }\n dp[i][j] = (dp[i - 1][j - 1] + dp[i - 1][j + 1]) % mod;\n if(ok[i - 1][j + 1] == 1 || ok[i - 1][j - 1] == 1)\n dp[i][j] = (dp[i][j] + 1) % mod;\n else\n ok[i][j] = 1;\n\n }\n }\n System.out.print(dp[2 * sc.nextInt()][0]);\n }\n\n}\n", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "b837a8e65ebc10dd0565b84ff0fbb174", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\nimport static java.lang.Math.max;\n\npublic class D {\n static int n;\n static long dp[][][], mod = (long) 1e9 + 7, inf = (long) 1e18;\n\n public static void main(String[] args) throws Exception {\n Scanner in = new Scanner(System.in);\n PrintWriter pw = new PrintWriter(System.out);\n n = in.nextInt();\n dp = new long[2][n + n + 1][n + n + 1];\n for (long a[][] : dp) for (long b[] : a) Arrays.fill(b, -1);\n pw.println(solve(0, 0, 0));\n pw.close();\n }\n\n static long solve(int last, int pos, int sum) {\n if (pos >= n + n) {\n if (sum == 0) return 0;\n return -inf;\n }\n if (dp[last][pos][sum] != -1) return dp[last][pos][sum];\n long ans = 0, a = 0, b = 0, rem = n + n - pos;\n if (rem >= sum + 1) a = max(0, solve(0, pos + 1, sum + 1));\n if (sum - 1 >= 0) b = max(0, solve(0, pos + 1, sum - 1));\n ans = max(ans, a + b);\n if (last == 0) {\n a = 0;\n b = 0;\n if (rem >= sum + 1) a = max(0, solve(1, pos + 1, sum + 1));\n if (sum - 1 >= 0) b = max(0, solve(1, pos + 1, sum - 1));\n ans = max(ans, 1 + a + b);\n }\n if (ans >= 0) ans %= mod;\n return dp[last][pos][sum] = ans;\n }\n\n static void debug(Object... obj) {\n System.err.println(Arrays.deepToString(obj));\n }\n}", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "e5f09241fd51e93663ed71a1eff68898", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class Main {\n static long dp[] = new long[1010];\n static int mod = (int)1e9 + 7;\n static long add(long x, long y){\n long tmp = x + y;\n return tmp >= mod ? tmp - mod : tmp;\n }\n public static void main(String args[]){\n Scanner cin = new Scanner(System.in);\n int n = cin.nextInt();\n dp[0] = 1;\n long ans = 0;\n for(int i = 0; i <= n; i++){\n for(int j = i; j <= n; j++){\n if((i + j) % 2 == 1){\n ans = add(ans, dp[j]);\n }\n dp[j + 1] = add(dp[j + 1], dp[j]);\n }\n }\n System.out.println(ans);\n }\n}", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "504bc37b98d7fba7be6729bb41150080", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// Change Of Plans BABY.... Change Of Plans //\nimport java.io.*;\nimport java.util.*;\nimport static java.lang.Math.*;\n\npublic class nekoAndAkkiPrank {\n\n static void MainSolution() {\n //constructing tree upside down\n n=2*ni();\n long dp[][]=new long[n+1][n+1];\n boolean free[][]=new boolean[n+1][n+1];\n free[0][0]=true; // selecting the first edge\n\n for(int i=1;i<=n;i++){\n for(int j=0;j<=n;j++){\n long l=j-1>=0?dp[i-1][j-1]:0;\n long r=i-1>=j+1?dp[i-1][j+1]:0;\n\n boolean free_l=j-1>=0?free[i-1][j-1]:false;\n boolean free_r=i-1>=j+1?free[i-1][j+1]:false;\n\n if(free_l || free_r){\n dp[i][j]=(l+r+1)%mod9;\n }\n else{\n dp[i][j] = (l+r)%mod9;\n free[i][j]=true;\n }\n }\n }\n pl(dp[n][0]);\n }\n /*----------------------------------------------------------------------------------------------------------------*/\n //THE DON'T CARE ZONE BEGINS HERE...\\\\\n static int mod9 = 1000000007;\n static int n, m, l, k, t, mod = 998244353;\n static AwesomeInput input = new AwesomeInput(System.in);\n static PrintWriter pw = new PrintWriter(System.out, true);\n\n static class AwesomeInput {\n private InputStream letsDoIT;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private SpaceCharFilter filter;\n\n private AwesomeInput(InputStream incoming) {\n this.letsDoIT = incoming;\n }\n\n public int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = letsDoIT.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n private long ForLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n return res * sgn;\n }\n\n private String ForString() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n }\n while (!isSpaceChar(c));\n\n return res.toString();\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n boolean isSpaceChar(int ch);\n }\n }\n\n // functions to take input//\n static int ni() {\n return (int) input.ForLong();\n }\n\n static String ns() {\n return input.ForString();\n }\n\n static long nl() {\n return input.ForLong();\n }\n\n static double nd() throws IOException {\n return Double.parseDouble(new BufferedReader(new InputStreamReader(System.in)).readLine());\n }\n\n //functions to give output\n static void pl() {\n pw.println();\n }\n\n static void p(Object o) {\n pw.print(o + \" \");\n }\n\n static void pws(Object o) {\n pw.print(o + \"\");\n }\n\n static void pl(Object o) {\n pw.println(o);\n }\n\n public static int[] fastSort(int[] f) {\n int n = f.length;\n int[] to = new int[n];\n {\n int[] b = new int[65537];\n for (int i = 0; i < n; i++) b[1 + (f[i] & 0xffff)]++;\n for (int i = 1; i <= 65536; i++) b[i] += b[i - 1];\n for (int i = 0; i < n; i++) to[b[f[i] & 0xffff]++] = f[i];\n int[] d = f;\n f = to;\n to = d;\n }\n {\n int[] b = new int[65537];\n for (int i = 0; i < n; i++) b[1 + (f[i] >>> 16)]++;\n for (int i = 1; i <= 65536; i++) b[i] += b[i - 1];\n for (int i = 0; i < n; i++) to[b[f[i] >>> 16]++] = f[i];\n int[] d = f;\n f = to;\n to = d;\n }\n return f;\n }\n\n public static void main(String[] args) { //threading has been used to increase the stack size.\n\n new Thread(null, null, \"Vengeance\", 1 << 25) //the last parameter is stack size desired.\n {\n public void run() {\n try {\n double s = System.currentTimeMillis();\n MainSolution();\n //pl((\"\\nExecution Time : \" + ((double) System.currentTimeMillis() - s) / 1000) + \" s\");\n pw.flush();\n pw.close();\n } catch (Exception e) {\n e.printStackTrace();\n System.exit(1);\n }\n }\n }.start();\n }\n}", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "a1eb556fbaabd98563af06a632b5f0c3", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.nio.CharBuffer;\nimport java.util.NoSuchElementException;\n\npublic class P1152D {\n\n public static void main(String[] args) {\n SimpleScanner scanner = new SimpleScanner(System.in);\n PrintWriter writer = new PrintWriter(System.out);\n\n final int MODULO = 1000000007;\n int n = scanner.nextInt();\n int m = 2 * n;\n int[][] f = new int[m + 1][m + 2];\n f[0][0] = 1;\n int ans = 0;\n for (int i = 1; i <= m; ++i) {\n f[i][0] = f[i - 1][1];\n for (int j = 1; j <= m; ++j) {\n f[i][j] = (f[i - 1][j - 1] + f[i - 1][j + 1]) % MODULO;\n }\n if (i % 2 == 1) {\n for (int j = 1; i + j <= m; j += 2)\n ans = (ans + f[i][j]) % MODULO;\n }\n }\n writer.println(ans);\n\n writer.close();\n }\n\n private static class SimpleScanner {\n\n private static final int BUFFER_SIZE = 10240;\n\n private Readable in;\n private CharBuffer buffer;\n private boolean eof;\n\n SimpleScanner(InputStream in) {\n this.in = new BufferedReader(new InputStreamReader(in));\n buffer = CharBuffer.allocate(BUFFER_SIZE);\n buffer.limit(0);\n eof = false;\n }\n\n\n private char read() {\n if (!buffer.hasRemaining()) {\n buffer.clear();\n int n;\n try {\n n = in.read(buffer);\n } catch (IOException e) {\n n = -1;\n }\n if (n <= 0) {\n eof = true;\n return '\\0';\n }\n buffer.flip();\n }\n return buffer.get();\n }\n\n void checkEof() {\n if (eof)\n throw new NoSuchElementException();\n }\n\n char nextChar() {\n checkEof();\n char b = read();\n checkEof();\n return b;\n }\n\n String next() {\n char b;\n do {\n b = read();\n checkEof();\n } while (Character.isWhitespace(b));\n StringBuilder sb = new StringBuilder();\n do {\n sb.append(b);\n b = read();\n } while (!eof && !Character.isWhitespace(b));\n return sb.toString();\n }\n\n int nextInt() {\n return Integer.valueOf(next());\n }\n\n long nextLong() {\n return Long.valueOf(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "7953087f6f500f2328ce67d35b358c7b", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Task {\n\n public static void main(String[] args) throws IOException {\n\n new Task().go();\n }\n\n PrintWriter out;\n Reader in;\n BufferedReader br;\n\n Task() throws IOException {\n\n try {\n\n //br = new BufferedReader( new FileReader(\"input.txt\") );\n in = new Reader(\"input.txt\");\n out = new PrintWriter( new BufferedWriter(new FileWriter(\"output.txt\")) );\n }\n catch (Exception e) {\n\n //br = new BufferedReader( new InputStreamReader( System.in ) );\n in = new Reader();\n out = new PrintWriter( new BufferedWriter(new OutputStreamWriter(System.out)) );\n }\n }\n\n void go() throws IOException {\n\n int t = 1;\n while (t > 0) {\n solve();\n //out.println();\n t--;\n }\n\n out.flush();\n out.close();\n }\n\n int inf = 2000000000;\n int mod = 1000000007;\n double eps = 0.000000001;\n\n int n;\n int m;\n ArrayList<Integer>[] g;\n void solve() throws IOException {\n\n int n = in.nextInt();\n int[][] dp = new int[n * 2][n + 1];\n dp[0][1] = 1;\n for (int i = 1; i < n * 2; i++)\n for (int j = 0; j <= n; j++) {\n if (j + 1 <= n) {\n dp[i][j + 1] += dp[i - 1][j];\n dp[i][j + 1] %= mod;\n }\n\n if (j - 1 >= 0) {\n dp[i][j - 1] += dp[i - 1][j];\n dp[i][j - 1] %= mod;\n }\n }\n\n //System.err.println(dp[2 * n - 1][0]);\n\n int ans = 0;\n for (int i = 2 * n - 2; i >= 0; i -= 2)\n for (int j = 0; j <= n; j++)\n if (j <= 2 * n - 1 - i && j % 2 == 1) {\n ans = (ans + dp[i][j]) % mod;\n //System.err.println(i +\" \" + j + \" \" + ans);\n }\n\n out.print(ans);\n }\n\n\n class Pair implements Comparable<Pair> {\n int a;\n int b;\n\n Pair(int a, int b) {\n this.a = a;\n this.b = b;\n }\n\n public int compareTo(Pair p) {\n if (a != p.a)\n return Integer.compare(a, p.a);\n else\n return Integer.compare(b, p.b);\n }\n }\n\n class Item {\n\n int a;\n int b;\n int c;\n\n Item(int a, int b, int c) {\n this.a = a;\n this.b = b;\n this.c = c;\n }\n\n }\n\n class Reader {\n\n BufferedReader br;\n StringTokenizer tok;\n\n Reader(String file) throws IOException {\n br = new BufferedReader( new FileReader(file) );\n }\n\n Reader() throws IOException {\n br = new BufferedReader( new InputStreamReader(System.in) );\n }\n\n String next() throws IOException {\n\n while (tok == null || !tok.hasMoreElements())\n tok = new StringTokenizer(br.readLine());\n return tok.nextToken();\n }\n\n int nextInt() throws NumberFormatException, IOException {\n return Integer.valueOf(next());\n }\n\n long nextLong() throws NumberFormatException, IOException {\n return Long.valueOf(next());\n }\n\n double nextDouble() throws NumberFormatException, IOException {\n return Double.valueOf(next());\n }\n\n\n String nextLine() throws IOException {\n return br.readLine();\n }\n\n int[] nextIntArray(int n) throws IOException {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = nextInt();\n return a;\n }\n\n ArrayList<Integer>[] nextGraph(int n, int m) throws IOException {\n ArrayList<Integer>[] g = new ArrayList[n];\n for (int i = 0; i < n; i++)\n g[i] = new ArrayList<>();\n for (int i = 0; i < m; i++) {\n int x = nextInt() - 1;\n int y = nextInt() - 1;\n g[x].add(y);\n g[y].add(x);\n }\n\n return g;\n }\n\n }\n\n}", "lang_cluster": "Java", "tags": ["greedy", "dp", "trees"], "code_uid": "6d3588a6ed1fa89bf3b754bf940276e9", "src_uid": "8218255989e5eab73ac7107072c3b2af", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\nimport java.io.*;\n\npublic class temppp {\n\n\tpublic static void main(String[] args) {\n\n\t\t// TODO Auto-generated method stub\n\n\t\tFastInputReader s = new FastInputReader();\n\t\tint n = s.nextInt();\n\t\tString str = s.nextLine();\n\t\tfor(int i=2;i<=n;i++) {\n\t\t\tif(n%i==0) {\n\t\t\t\tStringBuilder ss = new StringBuilder(str.substring(0,i));\n\t\t\t\tss.reverse().toString();\n\t\t\t\tstr=ss.toString()+str.substring(i);\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(str);\n\t\t\n\t}\n\n\tpublic static class FastInputReader {\n\n\t\tprivate byte[] buf = new byte[16384];\n\n\t\tprivate int curChar;\n\n\t\tprivate int numChars;\n\n\t\tpublic int read() {\n\n\t\t\tif (numChars == -1)\n\n\t\t\t\tthrow new InputMismatchException();\n\n\t\t\tif (curChar >= numChars) {\n\n\t\t\t\tcurChar = 0;\n\n\t\t\t\ttry {\n\n\t\t\t\t\tnumChars = System.in.read(buf);\n\n\t\t\t\t} catch (IOException e) {\n\n\t\t\t\t\tthrow new InputMismatchException();\n\n\t\t\t\t}\n\n\t\t\t\tif (numChars <= 0)\n\n\t\t\t\t\treturn -1;\n\n\t\t\t}\n\n\t\t\treturn buf[curChar++];\n\n\t\t}\n\n\t\tpublic String nextLine() {\n\n\t\t\tint c = read();\n\n\t\t\twhile (isSpaceChar(c))\n\n\t\t\t\tc = read();\n\n\t\t\tStringBuilder res = new StringBuilder();\n\n\t\t\tdo {\n\n\t\t\t\tres.appendCodePoint(c);\n\n\t\t\t\tc = read();\n\n\t\t\t} while (!isEndOfLine(c));\n\n\t\t\treturn res.toString();\n\n\t\t}\n\n\t\tpublic String nextString() {\n\n\t\t\tint c = read();\n\n\t\t\twhile (isSpaceChar(c))\n\n\t\t\t\tc = read();\n\n\t\t\tStringBuilder res = new StringBuilder();\n\n\t\t\tdo {\n\n\t\t\t\tres.appendCodePoint(c);\n\n\t\t\t\tc = read();\n\n\t\t\t} while (!isSpaceChar(c));\n\n\t\t\treturn res.toString();\n\n\t\t}\n\n\t\tpublic long nextLong() {\n\n\t\t\tint c = read();\n\n\t\t\twhile (isSpaceChar(c))\n\n\t\t\t\tc = read();\n\n\t\t\tint sgn = 1;\n\n\t\t\tif (c == '-') {\n\n\t\t\t\tsgn = -1;\n\n\t\t\t\tc = read();\n\n\t\t\t}\n\n\t\t\tlong res = 0;\n\n\t\t\tdo {\n\n\t\t\t\tif (c < '0' || c > '9')\n\n\t\t\t\t\tthrow new InputMismatchException();\n\n\t\t\t\tres *= 10;\n\n\t\t\t\tres += c - '0';\n\n\t\t\t\tc = read();\n\n\t\t\t} while (!isSpaceChar(c));\n\n\t\t\treturn res * sgn;\n\n\t\t}\n\n\t\tpublic int nextInt() {\n\n\t\t\tint c = read();\n\n\t\t\twhile (isSpaceChar(c))\n\n\t\t\t\tc = read();\n\n\t\t\tint sgn = 1;\n\n\t\t\tif (c == '-') {\n\n\t\t\t\tsgn = -1;\n\n\t\t\t\tc = read();\n\n\t\t\t}\n\n\t\t\tint res = 0;\n\n\t\t\tdo {\n\n\t\t\t\tif (c < '0' || c > '9')\n\n\t\t\t\t\tthrow new InputMismatchException();\n\n\t\t\t\tres *= 10;\n\n\t\t\t\tres += c - '0';\n\n\t\t\t\tc = read();\n\n\t\t\t} while (!isSpaceChar(c));\n\n\t\t\treturn res * sgn;\n\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) {\n\n\t\t\tint[] arr = new int[n];\n\n\t\t\tfor (int i = 0; i < n; i++) {\n\n\t\t\t\tarr[i] = nextInt();\n\n\t\t\t}\n\n\t\t\treturn arr;\n\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) {\n\n\t\t\tlong[] arr = new long[n];\n\n\t\t\tfor (int i = 0; i < n; i++) {\n\n\t\t\t\tarr[i] = nextLong();\n\n\t\t\t}\n\n\t\t\treturn arr;\n\n\t\t}\n\n\t\tprivate boolean isSpaceChar(int c) {\n\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\n\t\t}\n\n\t\tprivate boolean isEndOfLine(int c) {\n\n\t\t\treturn c == '\\n' || c == '\\r' || c == -1;\n\n\t\t}\n\n\t}\n\n\tpublic static class MyScanner {\n\n\t\tBufferedReader reader;\n\n\t\tpublic MyScanner() {\n\n\t\t\tthis.reader = new BufferedReader(new InputStreamReader(System.in));\n\n\t\t}\n\n\t\tpublic void close() throws IOException {\n\n\t\t\tthis.reader.close();\n\n\t\t}\n\n\t\tint nextInt() {\n\n\t\t\treturn Integer.parseInt(this.next());\n\n\t\t}\n\n\t\tlong nextLong() {\n\n\t\t\treturn Long.parseLong(this.next());\n\n\t\t}\n\n\t\tfloat nextFloat() {\n\n\t\t\treturn Float.parseFloat(this.next());\n\n\t\t}\n\n\t\tdouble nextDouble() {\n\n\t\t\treturn Double.parseDouble(this.next());\n\n\t\t}\n\n\t\tString next() {\n\n\t\t\tString str = \"\";\n\n\t\t\ttry {\n\n\t\t\t\tstr = this.reader.readLine().trim();\n\n\t\t\t} catch (IOException e) {\n\n\t\t\t\te.printStackTrace();\n\n\t\t\t}\n\n\t\t\treturn str;\n\n\t\t}\n\n\t\tString[] nextStringArray() {\n\n\t\t\tString[] str = null;\n\n\t\t\ttry {\n\n\t\t\t\tstr = this.reader.readLine().trim().split(\" \");\n\n\t\t\t} catch (IOException e) {\n\n\t\t\t\te.printStackTrace();\n\n\t\t\t}\n\n\t\t\treturn str;\n\n\t\t}\n\n\t\tint[] nextIntArray() {\n\n\t\t\tString[] data = nextStringArray();\n\n\t\t\tint[] a = new int[data.length];\n\n\t\t\tfor (int i = 0; i < a.length; i++) {\n\n\t\t\t\ta[i] = Integer.parseInt(data[i]);\n\n\t\t\t}\n\n\t\t\treturn a;\n\n\t\t}\n\n\t\tInteger[] nextIntegerArray() {\n\n\t\t\tString[] data = nextStringArray();\n\n\t\t\tInteger[] a = new Integer[data.length];\n\n\t\t\tfor (int i = 0; i < a.length; i++) {\n\n\t\t\t\ta[i] = Integer.parseInt(data[i]);\n\n\t\t\t}\n\n\t\t\treturn a;\n\n\t\t}\n\n\t\tlong[] nextLongArray() {\n\n\t\t\tString[] data = nextStringArray();\n\n\t\t\tlong[] a = new long[data.length];\n\n\t\t\tfor (int i = 0; i < a.length; i++) {\n\n\t\t\t\ta[i] = Long.parseLong(data[i]);\n\n\t\t\t}\n\n\t\t\treturn a;\n\n\t\t}\n\n\t\tfloat[] nextFloatArray() {\n\n\t\t\tString[] data = nextStringArray();\n\n\t\t\tfloat[] a = new float[data.length];\n\n\t\t\tfor (int i = 0; i < a.length; i++) {\n\n\t\t\t\ta[i] = Float.parseFloat(data[i]);\n\n\t\t\t}\n\n\t\t\treturn a;\n\n\t\t}\n\n\t\tdouble[] nextDoubleArray() {\n\n\t\t\tString[] data = nextStringArray();\n\n\t\t\tdouble[] a = new double[data.length];\n\n\t\t\tfor (int i = 0; i < a.length; i++) {\n\n\t\t\t\ta[i] = Double.parseDouble(data[i]);\n\n\t\t\t}\n\n\t\t\treturn a;\n\n\t\t}\n\n\t}\n\n}\n\n\n\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "2db7586fd4cf0480fe3eea89335b7217", "src_uid": "1b0b2ee44c63cb0634cb63f2ad65cdd3", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class Main \n{\n\n\tpublic static void main(String[] args) \n\t{\n\t\t\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong l = sc.nextInt();\n\t\tlong r = sc.nextInt();\n\t\tlong x = sc.nextInt();\n\t\tlong y = sc.nextInt();\n\t\t\n\t\tlong k = sc.nextInt();\n\t\t\n\t\tlong min = k*y - l;\n\t\tlong max = r - k*x;\n\t\t\n\t\tif(min>=0 && max>=0)\n\t\t{\n\t\t\tboolean check = false;\n\t\t\t\n\t\t\tfor(long i=x;i<=y && k*i<=r && !check;i++)\n\t\t\t{\n\t\t\t\tif(k*i<=r && k*i>=l)\n\t\t\t\t\tcheck = true;\n\t\t\t}\n\t\t\t\n\t\t\tif(check)\n\t\t\t\tSystem.out.println(\"YES\");\n\t\t\telse\n\t\t\t\tSystem.out.println(\"NO\");\n\t\t}\n\t\telse\n\t\t\tSystem.out.println(\"NO\");\n\t}\n}", "lang_cluster": "Java", "tags": ["two pointers", "brute force"], "code_uid": "85fe370b2230412b584e6079219d8772", "src_uid": "1110d3671e9f77fd8d66dca6e74d2048", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class C {\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\tboolean eof;\n\n\tint n, m;\n\n\tclass Edge {\n\t\tint to, flow, cap, cost;\n\t\tEdge rev;\n\n\t\tpublic Edge(int to, int cap, int cost) {\n\t\t\tthis.to = to;\n\t\t\tthis.cap = cap;\n\t\t\tthis.cost = cost;\n\t\t}\n\t}\n\n\tstatic final int[] dx = { -1, 0, 1, 0 };\n\tstatic final int[] dy = { 0, -1, 0, 1 };\n\tstatic final int INF = Integer.MAX_VALUE / 3;\n\n\tList<Edge>[] g;\n\n\tvoid addEdge(int v1, int v2, int cost) {\n\t\tEdge e1 = new Edge(v2, 1, cost);\n\t\tEdge e2 = new Edge(v1, 0, -cost);\n\t\te1.rev = e2;\n\t\te2.rev = e1;\n\t\tg[v1].add(e1);\n\t\tg[v2].add(e2);\n\t}\n\n\tint S, T;\n\n\tvoid solve() throws IOException {\n\t\tn = nextInt();\n\t\tm = nextInt();\n\n\t\tint[][] f = new int[n][m];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tfor (int j = 0; j < m; j++)\n\t\t\t\tf[i][j] = nextInt();\n\n\t\tg = new ArrayList[n * m + 2];\n\t\tS = n * m;\n\t\tT = n * m + 1;\n\t\tfor (int i = 0; i < n * m; i++)\n\t\t\tg[i] = new ArrayList<>(5);\n\t\tg[S] = new ArrayList<>(n * m / 2);\n\t\tg[T] = new ArrayList<>(n * m / 2);\n\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tint v = i * m + j;\n\t\t\t\tint col = (i + j) & 1;\n\t\t\t\tif (col == 0) {\n\t\t\t\t\taddEdge(S, v, 0);\n\t\t\t\t\tfor (int dir = 0; dir < 4; dir++) {\n\t\t\t\t\t\tint ni = i + dx[dir];\n\t\t\t\t\t\tint nj = j + dy[dir];\n\t\t\t\t\t\tif (ni >= 0 && ni < n && nj >= 0 && nj < m) {\n\t\t\t\t\t\t\tint to = ni * m + nj;\n\t\t\t\t\t\t\tint cost = (f[i][j] == f[ni][nj] ? 0 : 1);\n\t\t\t\t\t\t\taddEdge(v, to, cost);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\taddEdge(v, T, 0);\n\t\t\t\t}\n\t\t\t}\n\t\t\n\t\tint ans = 0;\n\t\tint[] pi = new int[n * m + 2];\n\t\t\n\t\tfinal int[] d = new int[n * m + 2];\n\t\tEdge[] from = new Edge[n * m + 2];\n\t\t\n\t\tInteger[] Integers = new Integer[n * m + 2];\n\t\tfor (int i = 0; i < n * m + 2; i++)\n\t\t\tIntegers[i] = i;\n\t\t\n\t\tTreeSet<Integer> set = new TreeSet<>(new Comparator<Integer>() {\n\n\t\t\t@Override\n\t\t\tpublic int compare(Integer o1, Integer o2) {\n\t\t\t\tif (d[o1] != d[o2])\n\t\t\t\t\treturn Integer.compare(d[o1], d[o2]);\n\t\t\t\treturn o1.compareTo(o2);\n\t\t\t}\n\t\t\t\n\t\t});\n\t\t\n\t\tfor (int iter = 0; iter < n * m / 2; iter++) {\n\t\t\t\n\t\t\tArrays.fill(d, INF);\n\t\t\td[S] = 0;\n\t\t\t\n\t\t\tset.add(Integers[S]);\n\t\t\t\n\t\t\twhile (!set.isEmpty()) {\n\t\t\t\tint v = set.pollFirst();\n\t\t\t\t\n\t\t\t\tfor (int i = 0; i < g[v].size(); i++) {\n\t\t\t\t\tEdge e = g[v].get(i);\n\t\t\t\t\tif (e.flow < e.cap) {\n\t\t\t\t\t\tint redCost = e.cost - pi[v] + pi[e.to];\n\t\t\t\t\t\tif (redCost < 0)\n\t\t\t\t\t\t\tthrow new AssertionError();\n\t\t\t\t\t\tif (d[e.to] > d[v] + redCost) {\n\t\t\t\t\t\t\tset.remove(Integers[e.to]);\n\t\t\t\t\t\t\tfrom[e.to] = e; \n\t\t\t\t\t\t\td[e.to] = d[v] + redCost;\n\t\t\t\t\t\t\tset.add(Integers[e.to]);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tfor (int i = 0; i < n * m + 2; i++) {\n\t\t\t\tpi[i] -= d[i];\n\t\t\t}\n\t\t\t\n\t\t\tfor (int v = T; v != S; ) {\n\t\t\t\tEdge last = from[v];\n\t\t\t\tlast.flow++;\n\t\t\t\tlast.rev.flow--;\n\t\t\t\tans += last.cost;\n\t\t\t\tv = last.rev.to;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\t\n\t\tout.println(ans);\n\n\t}\n\n\tC() throws IOException {\n\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.close();\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew C();\n\t}\n\n\tString nextToken() {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (Exception e) {\n\t\t\t\teof = true;\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tString nextString() {\n\t\ttry {\n\t\t\treturn br.readLine();\n\t\t} catch (IOException e) {\n\t\t\teof = true;\n\t\t\treturn null;\n\t\t}\n\t}\n\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n}", "lang_cluster": "Java", "tags": ["flows"], "code_uid": "fe2ef53f130827476321b87c97677f02", "src_uid": "1f0e8bbd5bf4fcdea927fbb505a8949b", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Comparator;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.Writer;\nimport java.util.List;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.ArrayList;\nimport java.util.ArrayDeque;\nimport java.io.Reader;\nimport java.util.TreeSet;\nimport java.util.Collections;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Niyaz Nigmatullin\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tFastScanner in = new FastScanner(inputStream);\n\t\tFastPrinter out = new FastPrinter(outputStream);\n\t\tTaskC2 solver = new TaskC2();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskC2 {\n\n final int[] DX = {1, 0, -1, 0};\n final int[] DY = {0, 1, 0, -1};\n\n public void solve(int testNumber, FastScanner in, FastPrinter out) {\n int n = in.nextInt();\n int m = in.nextInt();\n int[][] a = new int[n][];\n for (int i = 0; i < n; i++) {\n a[i] = in.readIntArray(m);\n }\n boolean[][] has = new boolean[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n for (int dir = 0; dir < 4; dir++) {\n int x = i + DX[dir];\n int y = j + DY[dir];\n if (x < 0 || y < 0 || x >= n || y >= m || a[x][y] != a[i][j]) continue;\n has[i][j] = true;\n }\n }\n }\n MinCostMaxFlowGraph g = new MinCostMaxFlowGraph(n * m + 2);\n int source = n * m;\n int target = n * m + 1;\n int ans = 0;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n if (has[i][j]) {\n continue;\n }\n if ((i + j & 1) == 1) {\n g.addEdge(i * m + j, target, 0, 1, 0);\n continue;\n }\n g.addEdge(source, i * m + j, 0, 1, 0);\n ans++;\n ArrayDeque<Integer> q = new ArrayDeque<>();\n int[][] d = new int[n][m];\n for (int[] e : d) {\n Arrays.fill(e, Integer.MAX_VALUE);\n }\n d[i][j] = 0;\n q.add(i * m + j);\n while (!q.isEmpty()) {\n int v = q.pollFirst();\n int cx = v / m;\n int cy = v % m;\n for (int dir = 0; dir < 4; dir++) {\n int x = cx + DX[dir];\n int y = cy + DY[dir];\n if (x < 0 || y < 0 || x >= n || y >= m) continue;\n int cost = 1;\n if (a[x][y] == a[cx][cy]) cost = 0;\n if (d[x][y] > d[cx][cy] + cost) {\n q.addLast(x * m + y);\n d[x][y] = d[cx][cy] + cost;\n }\n }\n }\n for (int x = 0; x < n; x++) {\n for (int y = 0; y < m; y++) {\n if ((x + y & 1) == 0) continue;\n if (has[x][y]) continue;\n g.addEdge(i * m + j, x * m + y, 0, 1, d[x][y] - 1);\n }\n }\n }\n }\n// System.out.println(ans);\n ans += g.getMinCostMaxFlow(source, target)[1];\n out.println(ans);\n }\n\n }\n\nclass FastScanner extends BufferedReader {\n\n public FastScanner(InputStream is) {\n super(new InputStreamReader(is));\n }\n\n public int read() {\n try {\n int ret = super.read();\n// if (isEOF && ret < 0) {\n// throw new InputMismatchException();\n// }\n// isEOF = ret == -1;\n return ret;\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n }\n\n static boolean isWhiteSpace(int c) {\n return c >= 0 && c <= 32;\n }\n\n public int nextInt() {\n int c = read();\n while (isWhiteSpace(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int ret = 0;\n while (c >= 0 && !isWhiteSpace(c)) {\n if (c < '0' || c > '9') {\n throw new NumberFormatException(\"digit expected \" + (char) c\n + \" found\");\n }\n ret = ret * 10 + c - '0';\n c = read();\n }\n return ret * sgn;\n }\n\n public String readLine() {\n try {\n return super.readLine();\n } catch (IOException e) {\n return null;\n }\n }\n\n public int[] readIntArray(int n) {\n int[] ret = new int[n];\n for (int i = 0; i < n; i++) {\n ret[i] = nextInt();\n }\n return ret;\n }\n\n }\n\nclass FastPrinter extends PrintWriter {\n\n public FastPrinter(OutputStream out) {\n super(out);\n }\n\n public FastPrinter(Writer out) {\n super(out);\n }\n\n\n}\n\nclass MinCostMaxFlowGraph {\n public static class Edge {\n int from;\n int to;\n public int flow;\n int cap;\n long cost;\n Edge rev;\n\n public Edge(int from, int to, int flow, int cap, long cost) {\n this.from = from;\n this.to = to;\n this.flow = flow;\n this.cap = cap;\n this.cost = cost;\n }\n\n public String toString() {\n return \"Edge [from=\" + from + \", to=\" + to + \", flow=\" + flow\n + \", cap=\" + cap + \", cost=\" + cost + \"]\";\n }\n\n }\n\n int n;\n ArrayList<Edge>[] edges;\n\n public MinCostMaxFlowGraph(int n) {\n this.n = n;\n edges = new ArrayList[n];\n for (int i = 0; i < edges.length; i++) {\n edges[i] = new ArrayList<Edge>();\n }\n }\n\n public Edge addEdge(int from, int to, int flow, int cap, long cost) {\n Edge e1 = new Edge(from, to, flow, cap, cost);\n Edge e2 = new Edge(to, from, flow, 0, -cost);\n e1.rev = e2;\n e2.rev = e1;\n edges[from].add(e1);\n edges[to].add(e2);\n return e1;\n }\n\n\n public long[] getMinCostMaxFlow(int source, int target) {\n long[] h = new long[n];\n for (boolean changed = true; changed; ) {\n changed = false;\n for (int i = 0; i < n; i++) {\n for (Edge e : edges[i]) {\n if (e.cap > 0 && h[e.to] > h[e.from] + e.cost) {\n h[e.to] = h[e.from] + e.cost;\n changed = true;\n }\n }\n }\n }\n Edge[] lastEdge = new Edge[n];\n long[] d = new long[n];\n int flow = 0;\n long cost = 0;\n while (true) {\n dijkstra(source, lastEdge, d, h);\n if (d[target] == Long.MAX_VALUE) {\n break;\n }\n int addFlow = Integer.MAX_VALUE;\n for (int v = target; v != source; ) {\n Edge e = lastEdge[v];\n addFlow = Math.min(addFlow, e.cap - e.flow);\n v = e.from;\n }\n cost += (d[target] + h[target] - h[source]) * addFlow;\n flow += addFlow;\n for (int v = target; v != source; ) {\n Edge e = lastEdge[v];\n e.flow += addFlow;\n e.rev.flow -= addFlow;\n v = e.from;\n }\n for (int i = 0; i < n; i++) {\n h[i] += d[i] == Long.MAX_VALUE ? 0 : d[i];\n }\n }\n return new long[]{flow, cost};\n }\n\n void dijkstra(int source, Edge[] lastEdge, final long[] d, long[] h) {\n TreeSet<Integer> ts = new TreeSet<Integer>(new Comparator<Integer>() {\n public int compare(Integer o1, Integer o2) {\n if (d[o1] != d[o2]) {\n return d[o1] < d[o2] ? -1 : 1;\n }\n return o1 - o2;\n }\n });\n Arrays.fill(d, Long.MAX_VALUE);\n d[source] = 0;\n ts.add(source);\n while (!ts.isEmpty()) {\n int v = ts.pollFirst();\n for (Edge e : edges[v]) {\n if (e.flow >= e.cap) {\n continue;\n }\n if (d[e.to] == Long.MAX_VALUE\n || d[e.to] > d[e.from] + e.cost + h[e.from]\n - h[e.to]) {\n if (e.cost + h[e.from] - h[e.to] < 0) {\n throw new AssertionError();\n }\n ts.remove(e.to);\n d[e.to] = d[e.from] + e.cost + h[e.from] - h[e.to];\n lastEdge[e.to] = e;\n ts.add(e.to);\n }\n }\n }\n }\n}\n\n", "lang_cluster": "Java", "tags": ["flows"], "code_uid": "105232cf7c7dd29917454004de01895c", "src_uid": "1f0e8bbd5bf4fcdea927fbb505a8949b", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\nimport java.awt.geom.*;\n\nimport static java.lang.Math.*;\n\npublic class Solution implements Runnable {\n\t\n\tclass Edge {\n\t\tint from, to, u, f, c;\n\t\t\n\t\tpublic Edge(int from, int to, int u, int c) {\n\t\t\tthis.from = from;\n\t\t\tthis.to = to;\n\t\t\tthis.u = u;\n\t\t\tthis.c = c;\n\t\t}\n\t}\n\t\n\tint dr [] = new int [] {0, 0, 1, -1};\n\tint dc [] = new int [] {1, -1, 0, 0};\n\t\n\tint N, S, T;\n\tArrayList<Edge> edges;\n\tArrayList<Integer> g[];\n\tint [] d, pv, pe;\n\tboolean [] inQueue;\n\t\n\tvoid addEdge (int from, int to, int u, int c) {\n\t\tg[from].add(edges.size());\n\t\tedges.add(new Edge (from, to, u, c));\n\t\tg[to].add(edges.size());\n\t\tedges.add(new Edge (to, from, 0, -c));\n\t}\n\t\n\tint minCostMaxFlow () {\n\t\tint result = 0;\n\t\t\n\t\td = new int [N];\n\t\tinQueue = new boolean [N];\n\t\tpe = new int [N];\n\t\tpv = new int [N];\n\t\tQueue<Integer> q = new ArrayDeque<>();\n\t\t\n\t\twhile (true) {\n\t\t\tArrays.fill(inQueue, false);\n\t\t\tArrays.fill(d, Integer.MAX_VALUE / 2);\n\t\t\td[S] = 0;\n\t\t\tinQueue[S] = true;\n\t\t\tq.add(S);\n\t\t\twhile (!q.isEmpty()) {\n\t\t\t\tint v = q.poll();\n\t\t\t\tinQueue[v] = false;\n\t\t\t\tfor (int i = 0; i < g[v].size(); i++) {\n\t\t\t\t\tint index = g[v].get(i);\n\t\t\t\t\tEdge e = edges.get(index);\n\t\t\t\t\tif (e.u > e.f) {\n\t\t\t\t\t\tif (d[e.to] > d[v] + e.c) {\n\t\t\t\t\t\t\td[e.to] = d[v] + e.c;\n\t\t\t\t\t\t\tpv[e.to] = v;\n\t\t\t\t\t\t\tpe[e.to] = index;\n\t\t\t\t\t\t\tif (!inQueue[e.to]) {\n\t\t\t\t\t\t\t\tinQueue[e.to] = true;\n\t\t\t\t\t\t\t\tq.add(e.to);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (d[T] == Integer.MAX_VALUE / 2) break;\n\t\t\tint addFlow = Integer.MAX_VALUE / 2;\n\t\t\tfor (int v = T; v != S; v = pv[v]) {\n\t\t\t\tint index = pe[v];\n\t\t\t\tEdge e = edges.get(index);\n\t\t\t\taddFlow = min (addFlow, e.u - e.f);\n\t\t\t}\n\t\t\tfor (int v = T; v != S; v = pv[v]) {\n\t\t\t\tint index = pe[v];\n\t\t\t\tEdge dir = edges.get(index);\n\t\t\t\tEdge rev = edges.get(index ^ 1);\n\t\t\t\tresult += addFlow * dir.c;\n\t\t\t\tdir.f += addFlow;\n\t\t\t\trev.f -= addFlow;\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\t\n\tpublic void solve() throws Exception {\n\t\tint n = sc.nextInt();\n\t\tint m = sc.nextInt();\n\t\t\n\t\tint a [][] = new int [n][m];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\ta[i][j] = sc.nextInt();\n\t\t\t}\n\t\t}\n\t\t\n\t\tN = n * m + 2;\n\t\tS = n * m;\n\t\tT = n * m + 1;\n\t\t\n\t\tedges = new ArrayList<>();\n\t\t\n\t\tg = new ArrayList[N];\n\t\tfor (int i = 0; i < N; i++)\n\t\t\tg[i] = new ArrayList<>();\n\t\t\n\t\t\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tif ((i + j) % 2 == 0) {\n\t\t\t\t\taddEdge(S, i * m + j, 1, 0);\n\t\t\t\t\tfor (int k = 0; k < 4; k++) {\n\t\t\t\t\t\tint di = dr[k] + i;\n\t\t\t\t\t\tint dj = dc[k] + j;\n\t\t\t\t\t\tif (di >= 0 && dj >= 0 && di < n && dj < m) {\n\t\t\t\t\t\t\tint cost = 1;\n\t\t\t\t\t\t\tif (a[i][j] == a[di][dj]) cost = 0;\n\t\t\t\t\t\t\taddEdge(i * m + j, di * m + dj, 1, cost);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\taddEdge(i * m + j, T, 1, 0);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tout.println(minCostMaxFlow());\n\t}\n\n\tBufferedReader in;\n\tPrintWriter out;\n\tFastScanner sc;\n\n\tstatic Throwable uncaught;\n\n\t@Override\n\tpublic void run() {\n\t\ttry {\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(System.out);\n\t\t\tsc = new FastScanner(in);\n\t\t\tsolve();\n\t\t} catch (Throwable t) {\n\t\t\tSolution.uncaught = t;\n\t\t} finally {\n\t\t\tout.close();\n\t\t}\n\t}\n\n\tpublic static void main(String[] args) throws Throwable {\n\t\tThread t = new Thread(null, new Solution(), \"\", (1 << 26));\n\t\tt.start();\n\t\tt.join();\n\t\tif (uncaught != null) {\n\t\t\tthrow uncaught;\n\t\t}\n\t}\n\n}\n\nclass FastScanner {\n\n\tBufferedReader reader;\n\tStringTokenizer strTok;\n\n\tpublic FastScanner(BufferedReader reader) {\n\t\tthis.reader = reader;\n\t}\n\n\tpublic String nextToken() throws IOException {\n\t\twhile (strTok == null || !strTok.hasMoreTokens()) {\n\t\t\tstrTok = new StringTokenizer(reader.readLine());\n\t\t}\n\t\treturn strTok.nextToken();\n\t}\n\n\tpublic int nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tpublic long nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tpublic double nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["flows"], "code_uid": "58a35a11f0584304e6a9931305190b82", "src_uid": "1f0e8bbd5bf4fcdea927fbb505a8949b", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\n\npublic class C {\n\tprivate static Scanner in;\n\n\tpublic static final int[] dx = new int[]{1, 0, -1, 0};\n\tpublic static final int[] dy = new int[]{0, 1, 0, -1};\n\t\n\tpublic void run() {\n\t\tint hei = in.nextInt();\n\t\tint wid = in.nextInt();\n\t\tint s = hei * wid / 2;\n\t\tint[][] a = new int[hei][wid];\n\t\tfor (int i = 0; i < hei; i++) {\n\t\t\tfor (int j = 0; j < wid; j++) {\n\t\t\t\ta[i][j] = in.nextInt() - 1;\n\t\t\t}\n\t\t}\n\t\tint infty = 3 * s;\n\t\tint[][] e = new int[s][s];\n\t\tfor (int i = 0; i < s; i++) {\n\t\t\tArrays.fill(e[i], infty);\n\t\t}\n\t\tfor (int i = 0; i < hei; i++) {\n\t\t\tfor (int j = 0; j < wid; j++) {\n\t\t\t\tif ((i + j) % 2 == 0) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tint x = (i * wid + j) / 2;\n\t\t\t\tfor (int d = 0; d < 4; d++) {\n\t\t\t\t\tint ii = i + dx[d];\n\t\t\t\t\tint jj = j + dy[d];\n\t\t\t\t\tif (ii < 0 || jj < 0 || ii >= hei || jj >= wid) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tint y = (ii * wid + jj) / 2;\n\t\t\t\t\te[x][y] = (a[i][j] == a[ii][jj]) ? 0 : 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(hungarian(e));\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tLocale.setDefault(Locale.US);\n\t\tin = new Scanner(System.in);\n\t\tnew C().run();\n\t\tin.close();\n\t}\n\t\n\t/*\n\t * infty must be greater than all elements of e\n\t */\n\tpublic static int hungarian(int[][] e) {\n\t\tint infty = Integer.MAX_VALUE / 3;\n\t\tint n1 = e.length;\n\t\tint n2 = e[0].length;\n\t\tint[] u = new int[n1 + 1];\n\t\tint[] v = new int[n2 + 1];\n\t\tint[] p = new int[n2 + 1];\n\t\tint[] way = new int[n2 + 1];\n\t\tfor (int i = 1; i <= n1; i++) {\n\t\t\tp[0] = i;\n\t\t\tint j0 = 0;\n\t\t\tint[] minv = new int[n2 + 1]; \n\t\t\tArrays.fill(minv, infty);\n\t\t\tboolean[] used = new boolean[n2 + 1];\n\t\t\tdo {\n\t\t\t\tused[j0] = true;\n\t\t\t\tint i0 = p[j0], j1 = 0;\n\t\t\t\tdouble delta = infty;\n\t\t\t\tfor (int j = 1; j <= n2; j++) {\n\t\t\t\t\tif (!used[j]) {\n\t\t\t\t\t\tint cur = e[i0 - 1][j - 1] - u[i0] - v[j];\n\t\t\t\t\t\tif (cur < minv[j]) {\n\t\t\t\t\t\t\tminv[j] = cur;\n\t\t\t\t\t\t\tway[j] = j0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (minv[j] < delta) {\n\t\t\t\t\t\t\tdelta = minv[j];\n\t\t\t\t\t\t\tj1 = j;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfor (int j = 0; j <= n2; j++) {\n\t\t\t\t\tif (used[j]) {\n\t\t\t\t\t\tu[p[j]] += delta;\n\t\t\t\t\t\tv[j] -= delta;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tminv[j] -= delta;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tj0 = j1;\n\t\t\t} while (p[j0] != 0);\n\t\t\tdo {\n\t\t\t\tint j1 = way[j0];\n\t\t\t\tp[j0] = p[j1];\n\t\t\t\tj0 = j1;\n\t\t\t} while (j0 > 0);\n\t\t}\n\t\tint sum = 0;\n\t\tfor (int j = 1; j <= n2; j++) {\n\t\t\tif (p[j] > 0) {\n\t\t\t\t// if (e[p[j] - 1][j - 1] >= infty) no matching of size n1;\n\t\t\t\tsum += e[p[j] - 1][j - 1];\n\t\t\t}\n\t\t}\n\t\treturn sum;\n\t}\n}\n", "lang_cluster": "Java", "tags": ["flows"], "code_uid": "e8e2b40ae2d406ec69863ce78c615be7", "src_uid": "1f0e8bbd5bf4fcdea927fbb505a8949b", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.io.File;\nimport java.util.AbstractSet;\nimport java.io.FileInputStream;\nimport java.io.FileNotFoundException;\nimport java.math.*;\npublic class Hello {\n \n //static FastReader in = new FastReader(System.in);\n public static void main(String[] args) {\n //try {\n // FileInputStream fis = new FileInputStream(\"data.txt\");\n // System.setIn(fis);\n Scanner in = new Scanner(System.in);\n // Scanner in = new Scanner(new File(\"input.txt\"));\n // PrintWriter out = new PrintWriter(\"output.txt\");\n \n int n = in.nextInt();\n int m = in.nextInt();\n \n int [][]a = new int[n][m];\n \n for (int i = 0;i < n;++i) {\n\tfor (int j = 0;j < m;++j) {\n\t a[i][j] = in.nextInt() - 1;\n\t}\n }\n \n //r * (c - 1);\n //c * (r - 1);\n \n int shoe = m * n / 2;\n \n int []dx = {-1, 0, 0, 1};\n int []dy = {0, -1, 1, 0};\n \n //shoe * (r * (c - 1)+ c * (r - 1)) * \n \n //List<Edge>[] graph = createGraph(2 * shoe + 2);\n Graph graph = new Graph(2 * shoe + 2);\n \n int source = 2 * shoe, sink = 2 * shoe + 1;\n \n for (int i = 0;i < n;++i) {\n\tfor (int j = 0;j < m;++j) {\n\t int id = i * m + j;\n\t if ((i + j) % 2 == 0) {//left\n\t for (int z = 0;z < 4;++z) {\n\t int i1 = i + dx[z];\n\t int j1 = j + dy[z];\n\t if (i1 < 0 || i1 >= n || j1 < 0 || j1 >= m) continue;\n\t int id1 = i1 * m + j1;\n\t int wt = (a[i][j] == a[i1][j1])?0:1;\n\t graph.addFlowWeightedEdge(id, id1, wt, 1);\n\t }\n\t graph.addFlowWeightedEdge(source, id, 0, 1);\n\t } else {//right\n\t graph.addFlowWeightedEdge(id, sink, 0, 1);\n\t }\n\t}\n }\n MinCostFlow mcf = new MinCostFlow(graph, source, sink, false);\n Pair<Long, Long> ans = mcf.minCostMaxFlow();\n System.out.println(ans.first);\n //} catch (FileNotFoundException e){\n // System.out.println(\"error\");\n //}\n }\n/////////////////////// \n}\nclass Graph {\n public static final int REMOVED_BIT = 0;\n \n protected int vertexCount;\n protected int edgeCount;\n \n private int[] firstOutbound;\n private int[] firstInbound;\n \n private Edge[] edges;\n private int[] nextInbound;\n private int[] nextOutbound;\n private int[] from;\n private int[] to;\n private long[] weight;\n private long[] capacity;\n private int[] reverseEdge;\n private int[] flags;\n \n public Graph(int vertexCount) {\n this(vertexCount, vertexCount);\n }\n \n public Graph(int vertexCount, int edgeCapacity) {\n this.vertexCount = vertexCount;\n firstOutbound = new int[vertexCount];\n Arrays.fill(firstOutbound, -1);\n \n from = new int[edgeCapacity];\n to = new int[edgeCapacity];\n nextOutbound = new int[edgeCapacity];\n flags = new int[edgeCapacity];\n }\n \n public int addEdge(int fromID, int toID, long weight, long capacity, int reverseEdge) {\n ensureEdgeCapacity(edgeCount + 1);\n if (firstOutbound[fromID] != -1)\n nextOutbound[edgeCount] = firstOutbound[fromID];\n else\n nextOutbound[edgeCount] = -1;\n firstOutbound[fromID] = edgeCount;\n if (firstInbound != null) {\n if (firstInbound[toID] != -1)\n\tnextInbound[edgeCount] = firstInbound[toID];\n else\n\tnextInbound[edgeCount] = -1;\n firstInbound[toID] = edgeCount;\n }\n this.from[edgeCount] = fromID;\n this.to[edgeCount] = toID;\n if (capacity != 0) {\n if (this.capacity == null)\n\tthis.capacity = new long[from.length];\n this.capacity[edgeCount] = capacity;\n }\n if (weight != 0) {\n if (this.weight == null)\n\tthis.weight = new long[from.length];\n this.weight[edgeCount] = weight;\n }\n if (reverseEdge != -1) {\n if (this.reverseEdge == null) {\n\tthis.reverseEdge = new int[from.length];\n\tArrays.fill(this.reverseEdge, 0, edgeCount, -1);\n }\n this.reverseEdge[edgeCount] = reverseEdge;\n }\n if (edges != null)\n edges[edgeCount] = createEdge(edgeCount);\n return edgeCount++;\n }\n \n protected final GraphEdge createEdge(int id) {\n return new GraphEdge(id);\n }\n \n public final int addFlowWeightedEdge(int from, int to, long weight, long capacity) {\n if (capacity == 0) {\n return addEdge(from, to, weight, 0, -1);\n } else {\n int lastEdgeCount = edgeCount;\n addEdge(to, from, -weight, 0, lastEdgeCount + entriesPerEdge());\n return addEdge(from, to, weight, capacity, lastEdgeCount);\n }\n }\n \n protected int entriesPerEdge() {\n return 1;\n }\n \n public final int addFlowEdge(int from, int to, long capacity) {\n return addFlowWeightedEdge(from, to, 0, capacity);\n }\n \n public final int vertexCount() {\n return vertexCount;\n }\n \n public final int firstOutbound(int vertex) {\n int id = firstOutbound[vertex];\n while (id != -1 && isRemoved(id))\n id = nextOutbound[id];\n return id;\n }\n \n public final int nextOutbound(int id) {\n id = nextOutbound[id];\n while (id != -1 && isRemoved(id))\n id = nextOutbound[id];\n return id;\n }\n \n public final int source(int id) {\n return from[id];\n }\n \n public final int destination(int id) {\n return to[id];\n }\n \n public final long weight(int id) {\n if (weight == null)\n return 0;\n return weight[id];\n }\n \n public final long capacity(int id) {\n if (capacity == null)\n return 0;\n return capacity[id];\n }\n \n public final long flow(int id) {\n if (reverseEdge == null)\n return 0;\n return capacity[reverseEdge[id]];\n }\n \n public final void pushFlow(int id, long flow) {\n if (flow == 0)\n return;\n if (flow > 0) {\n if (capacity(id) < flow)\n\tthrow new IllegalArgumentException(\"Not enough capacity\");\n } else {\n if (flow(id) < -flow)\n\tthrow new IllegalArgumentException(\"Not enough capacity\");\n }\n capacity[id] -= flow;\n capacity[reverseEdge[id]] += flow;\n }\n \n public final boolean flag(int id, int bit) {\n return (flags[id] >> bit & 1) != 0;\n }\n \n public final boolean isRemoved(int id) {\n return flag(id, REMOVED_BIT);\n }\n \n protected void ensureEdgeCapacity(int size) {\n if (from.length < size) {\n int newSize = Math.max(size, 2 * from.length);\n if (edges != null)\n\tedges = resize(edges, newSize);\n from = resize(from, newSize);\n to = resize(to, newSize);\n nextOutbound = resize(nextOutbound, newSize);\n if (nextInbound != null)\n\tnextInbound = resize(nextInbound, newSize);\n if (weight != null)\n\tweight = resize(weight, newSize);\n if (capacity != null)\n\tcapacity = resize(capacity, newSize);\n if (reverseEdge != null)\n\treverseEdge = resize(reverseEdge, newSize);\n flags = resize(flags, newSize);\n }\n }\n \n protected final int[] resize(int[] array, int size) {\n int[] newArray = new int[size];\n System.arraycopy(array, 0, newArray, 0, array.length);\n return newArray;\n }\n \n private long[] resize(long[] array, int size) {\n long[] newArray = new long[size];\n System.arraycopy(array, 0, newArray, 0, array.length);\n return newArray;\n }\n \n private Edge[] resize(Edge[] array, int size) {\n Edge[] newArray = new Edge[size];\n System.arraycopy(array, 0, newArray, 0, array.length);\n return newArray;\n }\n \n public final boolean isSparse() {\n return vertexCount == 0 || edgeCount * 20 / vertexCount <= vertexCount;\n }\n \n protected class GraphEdge implements Edge {\n protected int id;\n \n protected GraphEdge(int id) {\n this.id = id;\n }\n \n }\n \n}\n \n \nclass MinCostFlow {\n private final Graph graph;\n private final int source;\n private final int destination;\n private final long[] phi;\n private final long[] dijkstraResult;\n private final int[] lastEdge;\n private final Heap heap;\n private final int vertexCount;\n private final int[] visited;\n private int visitIndex;\n \n public MinCostFlow(Graph graph, int source, int destination, boolean hasNegativeEdges) {\n this.graph = graph;\n this.source = source;\n this.destination = destination;\n vertexCount = graph.vertexCount();\n phi = new long[vertexCount];\n if (hasNegativeEdges)\n fordBellman();\n dijkstraResult = new long[vertexCount];\n lastEdge = new int[vertexCount];\n if (graph.isSparse()) {\n heap = new Heap(vertexCount, new IntComparator() {\n\t public int compare(int first, int second) {\n\t return IntegerUtils.longCompare(dijkstraResult[first], dijkstraResult[second]);\n\t }\n\t }, vertexCount);\n visited = null;\n } else {\n heap = null;\n visited = new int[vertexCount];\n }\n }\n \n private void fordBellman() {\n Arrays.fill(phi, Long.MAX_VALUE);\n phi[source] = 0;\n boolean[] inQueue = new boolean[vertexCount];\n int[] queue = new int[vertexCount + 1];\n queue[0] = source;\n inQueue[source] = true;\n int stepCount = 0;\n int head = 0;\n int end = 1;\n int maxSteps = 2 * vertexCount * vertexCount;\n while (head != end) {\n int vertex = queue[head++];\n if (head == queue.length)\n\thead = 0;\n inQueue[vertex] = false;\n int edgeID = graph.firstOutbound(vertex);\n while (edgeID != -1) {\n\tlong total = phi[vertex] + graph.weight(edgeID);\n\tint destination = graph.destination(edgeID);\n\tif (graph.capacity(edgeID) != 0 && phi[destination] > total) {\n\t phi[destination] = total;\n\t if (!inQueue[destination]) {\n\t queue[end++] = destination;\n\t inQueue[destination] = true;\n\t if (end == queue.length)\n\t end = 0;\n\t }\n\t}\n\tedgeID = graph.nextOutbound(edgeID);\n }\n if (++stepCount > maxSteps)\n\tthrow new IllegalArgumentException(\"Graph contains negative cycle\");\n }\n }\n \n class Heap {\n IntList list;\n int shift;\n int[] index;\n \n public Heap(int vertexCount, IntComparator intComparator, int vertexCount1) {\n list = new IntArrayList(vertexCount);\n index = new int[vertexCount1];\n Arrays.fill(index, -1);\n }\n \n public void add(int source) {\n index[source] = 0;\n list.add(source);\n }\n \n public boolean isEmpty() {\n return shift == list.size();\n }\n \n public int poll() {\n int result = list.get(shift++);\n index[result] = -1;\n return result;\n }\n \n public int getIndex(int next) {\n return index[next];\n }\n \n public void shiftUp(int index) {\n }\n \n public void clear() {\n list = new IntArrayList();\n shift = 0;\n Arrays.fill(index, -1);\n }\n }\n \n public Pair<Long, Long> minCostMaxFlow() {\n return minCostMaxFlow(Long.MAX_VALUE);\n }\n \n public Pair<Long, Long> minCostMaxFlow(long maxFlow) {\n long cost = 0;\n long flow = 0;\n while (maxFlow != 0) {\n if (graph.isSparse())\n\tdijkstraAlgorithm();\n else\n\tdijkstraAlgorithmFull();\n if (lastEdge[destination] == -1)\n\treturn Pair.makePair(cost, flow);\n for (int i = 0; i < dijkstraResult.length; i++) {\n\tif (dijkstraResult[i] != Long.MAX_VALUE)\n\t phi[i] += dijkstraResult[i];\n }\n int vertex = destination;\n long currentFlow = maxFlow;\n long currentCost = 0;\n while (vertex != source) {\n\tint edgeID = lastEdge[vertex];\n\tcurrentFlow = Math.min(currentFlow, graph.capacity(edgeID));\n\tcurrentCost += graph.weight(edgeID);\n\tvertex = graph.source(edgeID);\n }\n maxFlow -= currentFlow;\n cost += currentCost * currentFlow;\n flow += currentFlow;\n vertex = destination;\n while (vertex != source) {\n\tint edgeID = lastEdge[vertex];\n\tgraph.pushFlow(edgeID, currentFlow);\n\tvertex = graph.source(edgeID);\n }\n }\n return Pair.makePair(cost, flow);\n }\n \n private void dijkstraAlgorithm() {\n Arrays.fill(dijkstraResult, Long.MAX_VALUE);\n Arrays.fill(lastEdge, -1);\n dijkstraResult[source] = 0;\n heap.clear();\n heap.add(source);\n while (!heap.isEmpty()) {\n int current = heap.poll();\n int edgeID = graph.firstOutbound(current);\n while (edgeID != -1) {\n\tif (graph.capacity(edgeID) != 0) {\n\t int next = graph.destination(edgeID);\n\t long total = graph.weight(edgeID) - phi[next] + phi[current] + dijkstraResult[current];\n\t if (dijkstraResult[next] > total) {\n\t dijkstraResult[next] = total;\n\t if (heap.getIndex(next) == -1)\n\t heap.add(next);\n\t else\n\t heap.shiftUp(heap.getIndex(next));\n\t lastEdge[next] = edgeID;\n\t }\n\t}\n\tedgeID = graph.nextOutbound(edgeID);\n }\n }\n }\n \n private void dijkstraAlgorithmFull() {\n visitIndex++;\n Arrays.fill(dijkstraResult, Long.MAX_VALUE);\n lastEdge[destination] = -1;\n dijkstraResult[source] = 0;\n for (int i = 0; i < vertexCount; i++) {\n int index = -1;\n long length = Long.MAX_VALUE;\n for (int j = 0; j < vertexCount; j++) {\n\tif (visited[j] != visitIndex && dijkstraResult[j] < length) {\n\t length = dijkstraResult[j];\n\t index = j;\n\t}\n }\n if (index == -1) {\n\treturn;\n }\n visited[index] = visitIndex;\n int edgeID = graph.firstOutbound(index);\n while (edgeID != -1) {\n\tif (graph.capacity(edgeID) != 0) {\n\t int next = graph.destination(edgeID);\n\t if (visited[next] != visitIndex) {\n\t long total = graph.weight(edgeID) - phi[next] + phi[index] + length;\n\t if (dijkstraResult[next] > total) {\n\t dijkstraResult[next] = total;\n\t lastEdge[next] = edgeID;\n\t }\n\t }\n\t}\n\tedgeID = graph.nextOutbound(edgeID);\n }\n }\n }\n}\n \nclass Pair<U, V> implements Comparable<Pair<U, V>> {\n public final U first;\n public final V second;\n \n public static<U, V> Pair<U, V> makePair(U first, V second) {\n return new Pair<U, V>(first, second);\n }\n \n private Pair(U first, V second) {\n this.first = first;\n this.second = second;\n }\n \n public boolean equals(Object o) {\n if (this == o) return true;\n if (o == null || getClass() != o.getClass()) return false;\n \n Pair pair = (Pair) o;\n \n return !(first != null ? !first.equals(pair.first) : pair.first != null) && !(second != null ? !second.equals(pair.second) : pair.second != null);\n \n }\n \n public int hashCode() {\n int result = first != null ? first.hashCode() : 0;\n result = 31 * result + (second != null ? second.hashCode() : 0);\n return result;\n }\n \n public String toString() {\n return \"(\" + first + \",\" + second + \")\";\n }\n \n public int compareTo(Pair<U, V> o) {\n int value = ((Comparable<U>)first).compareTo(o.first);\n if (value != 0)\n return value;\n return ((Comparable<V>)second).compareTo(o.second);\n }\n}\n \nabstract class IntCollection {\n public abstract IntIterator iterator();\n public abstract int size();\n public abstract void add(int value);\n \n public void addAll(IntCollection values) {\n for (IntIterator it = values.iterator(); it.isValid(); it.advance()) {\n add(it.value());\n }\n }\n \n}\n \ninterface IntIterator {\n public int value() throws NoSuchElementException;\n /*\n * @throws NoSuchElementException only if iterator already invalid\n */\n public void advance() throws NoSuchElementException;\n public boolean isValid();\n}\n \ninterface Edge {\n}\n \nabstract class IntList extends IntCollection implements Comparable<IntList> {\n \n public abstract int get(int index);\n \n public IntIterator iterator() {\n return new IntIterator() {\n private int size = size();\n private int index = 0;\n \n public int value() throws NoSuchElementException {\n\tif (!isValid())\n\t throw new NoSuchElementException();\n\treturn get(index);\n }\n \n public void advance() throws NoSuchElementException {\n\tif (!isValid())\n\t throw new NoSuchElementException();\n\tindex++;\n }\n \n public boolean isValid() {\n\treturn index < size;\n }\n };\n }\n \n public int hashCode() {\n int hashCode = 1;\n for (IntIterator i = iterator(); i.isValid(); i.advance())\n hashCode = 31 * hashCode + i.value();\n return hashCode;\n }\n \n public boolean equals(Object obj) {\n if (!(obj instanceof IntList))\n return false;\n IntList list = (IntList)obj;\n if (list.size() != size())\n return false;\n IntIterator i = iterator();\n IntIterator j = list.iterator();\n while (i.isValid()) {\n if (i.value() != j.value())\n\treturn false;\n i.advance();\n j.advance();\n }\n return true;\n }\n \n public int compareTo(IntList o) {\n IntIterator i = iterator();\n IntIterator j = o.iterator();\n while (true) {\n if (i.isValid()) {\n\tif (j.isValid()) {\n\t if (i.value() != j.value()) {\n\t if (i.value() < j.value())\n\t return -1;\n\t else\n\t return 1;\n\t }\n\t} else\n\t return 1;\n } else {\n\tif (j.isValid())\n\t return -1;\n\telse\n\t return 0;\n }\n i.advance();\n j.advance();\n }\n }\n \n}\n \nclass IntArrayList extends IntList {\n private int[] array;\n private int size;\n \n public IntArrayList() {\n this(10);\n }\n \n public IntArrayList(int capacity) {\n array = new int[capacity];\n }\n \n public IntArrayList(IntList list) {\n this(list.size());\n addAll(list);\n }\n \n public int get(int index) {\n if (index >= size)\n throw new IndexOutOfBoundsException();\n return array[index];\n }\n \n public int size() {\n return size;\n }\n \n public void add(int value) {\n ensureCapacity(size + 1);\n array[size++] = value;\n }\n \n public void ensureCapacity(int newCapacity) {\n if (newCapacity > array.length) {\n int[] newArray = new int[Math.max(newCapacity, array.length << 1)];\n System.arraycopy(array, 0, newArray, 0, size);\n array = newArray;\n }\n }\n \n}\n \ninterface IntComparator {\n \n}\n \nclass IntegerUtils {\n \n public static int longCompare(long a, long b) {\n if (a < b)\n return -1;\n if (a > b)\n return 1;\n return 0;\n }\n \n}\n", "lang_cluster": "Java", "tags": ["flows"], "code_uid": "9f7a18343c21e0452b04e7850b36d57b", "src_uid": "1f0e8bbd5bf4fcdea927fbb505a8949b", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "//package abbyycup2013;\nimport java.io.*;\nimport java.util.ArrayList;\nimport java.util.List;\n\npublic class ProblemC1 {\n BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n PrintWriter writer = new PrintWriter(new OutputStreamWriter(System.out));\n\n ProblemC1() throws IOException {\n// reader = new BufferedReader(new FileReader(\"input.txt\"));\n// writer = new PrintWriter(new FileWriter(\"output.txt\"));\n }\n\n int[] readInts() throws IOException {\n String[] strings = reader.readLine().split(\" \");\n int[] ints = new int[strings.length];\n for(int i = 0; i < ints.length; i++) {\n ints[i] = Integer.parseInt(strings[i]);\n }\n return ints;\n }\n\n int[] tt = null;\n int tx = 0;\n int readInt() throws IOException {\n if(tt == null || tx >= tt.length) {\n tt = readInts();\n tx = 0;\n }\n return tt[tx++];\n }\n\n boolean isBit(int x, int bit) {\n return ((x >> bit) & 1) > 0;\n }\n\n void solve() throws IOException {\n int n = readInt();\n int m = readInt();\n int[][] table = new int[n][];\n for(int i = 0; i < n; i++) table[i] = readInts();\n int[][][] dp = new int[n + 1][m][1 << m];\n for(int i = 0; i <= n; i++) for(int j = 0; j < m; j++) for(int k = 0; k < 1 << m; k++) dp[i][j][k] = Integer.MAX_VALUE;\n dp[0][0][0] = 0;\n int inf = Integer.MAX_VALUE;\n for(int i = 0; i < n; i++) {\n for(int j = 0; j < m; j++) {\n for(int mask = 0; mask < 1 << m; mask++) {\n if(dp[i][j][mask] == inf) continue;\n if(isBit(mask, j)) {\n int newJ = j + 1;\n int newI = i;\n if(newJ == m) {\n newI++;\n newJ = 0;\n }\n int newMask = mask ^ (1 << j);\n dp[newI][newJ][newMask] = Math.min(dp[newI][newJ][newMask], dp[i][j][mask]);\n }\n else {\n if(i + 1 < n) {\n int newJ = j + 1;\n int newI = i;\n if(newJ == m) {\n newI++;\n newJ = 0;\n }\n int newMask = mask ^ (1 << j);\n dp[newI][newJ][newMask] = Math.min(dp[newI][newJ][newMask], dp[i][j][mask] + (table[i][j] == table[i + 1][j] ? 0 : 1));\n }\n if(j + 1 < m && !isBit(mask, j + 1)) {\n int newJ = j + 2;\n int newI = i;\n if(newJ == m) {\n newI++;\n newJ = 0;\n }\n int newMask = mask;\n dp[newI][newJ][newMask] = Math.min(dp[newI][newJ][newMask], dp[i][j][mask] + (table[i][j] == table[i][j + 1] ? 0 : 1));\n }\n }\n }\n\n }\n }\n writer.println(dp[n][0][0]);\n writer.flush();\n }\n\n void multiSolve() throws IOException {\n int n = readInts()[0];\n for(int i = 0; i < n; i++) {\n solve();\n }\n writer.flush();\n }\n\n public static void main(String[] args) throws IOException{\n new ProblemC1().solve();\n }\n}\n", "lang_cluster": "Java", "tags": ["flows"], "code_uid": "b18e1665d6e9a60d60d4cb1e97962904", "src_uid": "1f0e8bbd5bf4fcdea927fbb505a8949b", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import static java.lang.Double.parseDouble;\nimport static java.lang.Integer.parseInt;\nimport static java.lang.Long.parseLong;\nimport static java.lang.System.exit;\nimport static java.util.Arrays.fill;\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\nimport java.util.PriorityQueue;\nimport java.util.StringTokenizer;\n\npublic class C {\n\t\n\tstatic BufferedReader in;\n\tstatic PrintWriter out;\n\tstatic StringTokenizer tok;\n\t\n\tstatic final int DI[] = {1, 0, -1, 0};\n\tstatic final int DJ[] = {0, 1, 0, -1};\n\t\n\tstatic class Pos implements Comparable<Pos> {\n\t\tfinal int i, j, dist;\n\n\t\tPos(int i, int j, int dist) {\n\t\t\tthis.i = i;\n\t\t\tthis.j = j;\n\t\t\tthis.dist = dist;\n\t\t}\n\t\t\n\t\tpublic int compareTo(Pos o) {\n\t\t\treturn dist - o.dist;\n\t\t}\n\t}\n\t\n\tstatic void solve() throws Exception {\n\t\tint n = nextInt();\n\t\tint m = nextInt();\n\t\tint id[][] = new int[n][m];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tid[i][j] = nextInt() - 1;\n\t\t\t}\n\t\t}\n\t\tint cap[][][] = new int[n][m][4];\n\t\tint cost[][][] = new int[n][m][4];\n\t\tint imbalance[][] = new int[n][m];\n\t\tint totalCost = n * m / 2;\n\t\tint totalImbalance = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tif (((i ^ j) & 1) != 0) {\n\t\t\t\t\t--imbalance[i][j];\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\t++imbalance[i][j];\n\t\t\t\tfor (int d = 0; d < 4; d++) {\n\t\t\t\t\tint ii = i + DI[d];\n\t\t\t\t\tint jj = j + DJ[d];\n\t\t\t\t\tif (ii < 0 || ii >= n || jj < 0 || jj >= m) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tif (id[i][j] == id[ii][jj]) {\n\t\t\t\t\t\tcap[ii][jj][d ^ 2] = 1;\n\t\t\t\t\t\tcost[ii][jj][d ^ 2] = 1;\n\t\t\t\t\t\tcost[i][j][d] = -1;\n\t\t\t\t\t\t--imbalance[i][j];\n\t\t\t\t\t\t++imbalance[ii][jj];\n\t\t\t\t\t\t--totalCost;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tcap[i][j][d] = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\ttotalImbalance += imbalance[i][j];\n\t\t\t}\n\t\t}\n\t\tint dist[][] = new int[n][m];\n\t\tint distAdj[][] = new int[n][m];\n\t\tint back[][] = new int[n][m];\n\t\tPriorityQueue<Pos> queue = new PriorityQueue<>();\n\t\twhile (totalImbalance > 0) {\n\t\t\tfor (int t[]: dist) {\n\t\t\t\tfill(t, Integer.MAX_VALUE);\n\t\t\t}\n\t\t\tfor (int t[]: back) {\n\t\t\t\tfill(t, -1);\n\t\t\t}\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\t\tif (imbalance[i][j] > 0) {\n\t\t\t\t\t\tdist[i][j] = 0;\n\t\t\t\t\t\tqueue.add(new Pos(i, j, 0));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tdo {\n\t\t\t\tPos pos = queue.remove();\n\t\t\t\tint i = pos.i;\n\t\t\t\tint j = pos.j;\n\t\t\t\tint cdist = pos.dist;\n\t\t\t\tif (dist[i][j] != cdist) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tfor (int d = 0; d < 4; d++) {\n\t\t\t\t\tif (cap[i][j][d] == 0) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tint ii = i + DI[d];\n\t\t\t\t\tint jj = j + DJ[d];\n\t\t\t\t\tint ndist = cdist + cost[i][j][d] + distAdj[ii][jj] - distAdj[i][j];\n\t\t\t\t\tif (ndist < cdist) {\n\t\t\t\t\t\tthrow new AssertionError();\n\t\t\t\t\t}\n\t\t\t\t\tif (dist[ii][jj] > ndist) {\n\t\t\t\t\t\tdist[ii][jj] = ndist;\n\t\t\t\t\t\tback[ii][jj] = d ^ 2;\n\t\t\t\t\t\tqueue.add(new Pos(ii, jj, ndist));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} while (!queue.isEmpty());\n\t\t\tint resDist = Integer.MAX_VALUE;\n\t\t\tint resI = -1;\n\t\t\tint resJ = -1;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\t\tif (imbalance[i][j] < 0 && resDist > dist[i][j]) {\n\t\t\t\t\t\tresDist = dist[i][j];\n\t\t\t\t\t\tresI = i;\n\t\t\t\t\t\tresJ = j;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (resDist == Integer.MAX_VALUE) {\n\t\t\t\tthrow new AssertionError();\n\t\t\t}\n\t\t\t{\n\t\t\t\tint i = resI, j = resJ;\n\t\t\t\t++imbalance[i][j];\n\t\t\t\twhile (true) {\n\t\t\t\t\tint d = back[i][j];\n\t\t\t\t\tint ii = i + DI[d];\n\t\t\t\t\tint jj = j + DJ[d];\n\t\t\t\t\t++cap[i][j][d];\n\t\t\t\t\t--cap[ii][jj][d ^ 2];\n\t\t\t\t\ti = ii;\n\t\t\t\t\tj = jj;\n\t\t\t\t\tif (imbalance[i][j] > 0) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t--imbalance[i][j];\n\t\t\t\t--totalImbalance;\n\t\t\t\ttotalCost += dist[resI][resJ] - distAdj[resI][resJ] - dist[i][j] + distAdj[i][j];\n\t\t\t}\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\t\tif (dist[i][j] != Integer.MAX_VALUE) {\n\t\t\t\t\t\tdistAdj[i][j] -= dist[i][j];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tout.print(totalCost);\n\t}\n\t\n\tstatic int nextInt() throws IOException {\n\t\treturn parseInt(next());\n\t}\n\n\tstatic long nextLong() throws IOException {\n\t\treturn parseLong(next());\n\t}\n\n\tstatic double nextDouble() throws IOException {\n\t\treturn parseDouble(next());\n\t}\n\n\tstatic String next() throws IOException {\n\t\twhile (tok == null || !tok.hasMoreTokens()) {\n\t\t\ttok = new StringTokenizer(in.readLine());\n\t\t}\n\t\treturn tok.nextToken();\n\t}\n\n\tpublic static void main(String[] args) {\n\t\ttry {\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(new OutputStreamWriter(System.out));\n\t\t\tsolve();\n\t\t\tin.close();\n\t\t\tout.close();\n\t\t} catch (Throwable e) {\n\t\t\te.printStackTrace();\n\t\t\texit(1);\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["flows"], "code_uid": "6b83ca729caf0d69cc2a7c4b0d332552", "src_uid": "1f0e8bbd5bf4fcdea927fbb505a8949b", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.Scanner;\n\npublic class Main {\n private static int m;\n private static int size=1;\n private static int[] que=new int[(80*80+5)*8]; //队列\n //dis 表示最小花费\n private static int[] dis=new int[80*80+5],pr = new int[80*80+5];\n //vis 表示是否访问过\n private static int[] ed=new int[80*80+5],vis = new int[80*80+5];\n private static int[] edge=new int[80*80+5],next = new int[80*80+5];\n //cost 表示单位流量费用 weight 表示剩余容量\n private static int[] cost=new int[80*80+5],weight = new int[80*80+5],pre = new int[80*80+5];\n\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n int n = scan.nextInt();\n m =scan.nextInt();\n int s = n*m+1,t=n*m+2;\n int[][] a = new int[80+5][80+5];\n for (int i=1;i<=n;i++){\n for (int j=1;j<= m;j++){\n a[i][j] = scan.nextInt();\n }\n }\n for (int i=1;i<=n;i++){\n for (int j=1;j<=m;j++){\n if ((i+j)%2!=0){ //i+j为奇数分到s（起点）那一拨\n addedge2(s,getNo(i,j),1,0);\n }else { //i+j为偶数分到t（终点）那一拨\n addedge2(getNo(i,j),t,1,0);\n }\n if (j<m) {\n if ((i+j)%2!=0) addedge2(getNo(i,j),getNo(i,j+1),1,isok(a[i][j],a[i][j+1]));\n else addedge2(getNo(i,j+1),getNo(i,j),1,isok(a[i][j],a[i][j+1]));\n }\n if (i<n) {\n if ((i+j)%2!=0) addedge2(getNo(i,j),getNo(i+1,j),1,isok(a[i][j],a[i+1][j]));\n else addedge2(getNo(i+1,j),getNo(i,j),1,isok(a[i][j],a[i+1][j]));\n }\n }\n }\n\n int out = Costflow(s,t);\n System.out.println(out);\n }\n\n private static int Costflow(int s, int t) {\n int totcost=0;\n while (SPFA(s,t)) {\n int flow= 0x7f7f7f7f;\n for(int x=t;x!=s;x=pr[x]){\n flow=Math.min(flow,weight[ed[x]]);\n }\n totcost+=flow*dis[t];\n for(int x=t;x!=s;x=pr[x]){\n weight[ed[x]]-=flow;\n weight[ed[x]^1]+=flow;\n }\n }\n return totcost;\n\n }\n\n private static boolean SPFA(int s, int t) {\n for (int i=0;i<dis.length;i++){\n dis[i]= 127;\n }\n for (int i=0;i<vis.length;i++){\n vis[i]= 0;\n }\n\n dis[que[1]=s]=0;vis[s]=1;\n int head=1,tail=1;\n while (head<=tail) {\n int getNow=que[head++];\n for(int p=pre[getNow];p!=0;p=next[p]) {\n int v=edge[p];\n if (weight[p]>0&&dis[getNow]+cost[p]<dis[v]) { //存在路径，且权值变小。\n dis[v]=dis[getNow]+cost[p];\n if (vis[v]==0){ vis[v]=1;que[++tail]=v;}\n pr[v]=getNow;\n ed[v]=p;\n }\n }\n vis[getNow]=0;\n }\n return dis[t]<dis[0];\n\n }\n\n private static int isok(int i, int j) { //判断相邻两格是否相同，相同费用为0，不同为1\n if (i!=j){\n return 1;\n }else {\n return 0;\n }\n }\n\n private static void addedge2(int u, int v, int w, int c) {\n addedge(u,v,w,c);\n addedge(v,u,0,-c);\n }\n\n private static void addedge(int u, int v, int w, int c) {\n edge[++size]=v;\n weight[size]=w;\n cost[size]=c;\n next[size]=pre[u];\n pre[u]=size;\n }\n\n private static int getNo(int i, int j) {\n return (i-1)*m+j;\n }\n}\n\n", "lang_cluster": "Java", "tags": ["flows"], "code_uid": "4e5c21fe36f7fc1a1d80b5adf5b3896e", "src_uid": "1f0e8bbd5bf4fcdea927fbb505a8949b", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\n/**\n * @author pashka\n */\npublic class Main {\n\n\n private void solve() throws IOException {\n int n = nextInt();\n int m = nextInt();\n int[][] a = new int[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n a[i][j] = nextInt();\n }\n }\n init(n * m + 2, n * m * 6);\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n int c = i * m + j;\n if ((i + j) % 2 == 0) {\n addEdge(0, 2 + c, 1, 0);\n } else {\n addEdge(2 + c, 1, 1, 0);\n }\n if (i < n - 1) {\n int cost = 0;\n if (a[i][j] != a[i + 1][j]) cost = 1;\n addEdge(2 + c, 2 + c + m, 1, cost);\n addEdge(2 + c + m, 2 + c, 1, cost);\n }\n if (j < m - 1) {\n int cost = 0;\n if (a[i][j] != a[i][j + 1]) cost = 1;\n addEdge(2 + c, 2 + c + 1, 1, cost);\n addEdge(2 + c + 1, 2 + c, 1, cost);\n }\n }\n }\n long res = minCostMaxFlow(0, 1);\n out.println(res);\n }\n\n private BufferedReader br;\n private PrintWriter out;\n private StringTokenizer st;\n\n String next() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return st.nextToken();\n }\n\n int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n public static void main(String[] args) throws IOException {\n new Main().run();\n }\n\n private void run() throws IOException {\n br = new BufferedReader(new InputStreamReader(System.in));\n// br = new BufferedReader(new FileReader(\"input.txt\"));\n out = new PrintWriter(System.out);\n solve();\n out.close();\n }\n\n\n void init(int n, int m) {\n m *= 2;\n this.n = n;\n this.m = m;\n last = 0;\n head = new int[n];\n nx = new int[m];\n dst = new int[m];\n src = new int[m];\n cp = new int[m];\n ct = new long[m];\n fl = new int[m];\n prev = new int[n];\n heap = new int[n];\n heapRev = new int[n];\n d = new long[n];\n bestDist = new long[n];\n for (int i = 0; i < n; i++) {\n heap[i] = i;\n heapRev[i] = i;\n }\n Arrays.fill(head, -1);\n }\n\n void addEdge(int x, int y, int capacity, int cost) {\n nx[last] = head[x];\n src[last] = x;\n dst[last] = y;\n cp[last] = capacity;\n ct[last] = cost;\n head[x] = last;\n last++;\n nx[last] = head[y];\n src[last] = y;\n dst[last] = x;\n cp[last] = 0;\n ct[last] = -cost;\n head[y] = last;\n last++;\n }\n\n // Returns the total cost. Max flow value will be in field maxFlow.\n long minCostMaxFlow(int s, int t) {\n for (int i = 0; i < n; i++) {\n d[i] = INF;\n }\n d[s] = 0;\n boolean ok = false;\n while (!ok) {\n ok = true;\n for (int j = 0; j < m; j++)\n if (fl[j] < cp[j]) {\n int x = src[j];\n int y = dst[j];\n if (d[x] < INF) {\n if (d[y] > d[x] + ct[j]) {\n d[y] = d[x] + ct[j];\n ok = false;\n }\n }\n }\n }\n long res = 0;\n maxFlow = 0;\n while (true) {\n dijkstra(s);\n if (bestDist[t] == INF) break;\n {\n int i = t;\n int f = Integer.MAX_VALUE;\n while (i != s) {\n int e = prev[i];\n f = Math.min(f, cp[e] - fl[e]);\n i = src[e];\n }\n if (f < 0) throw new RuntimeException();\n maxFlow += f;\n i = t;\n while (i != s) {\n int e = prev[i];\n fl[e] += f;\n fl[e ^ 1] -= f;\n if (fl[e] > cp[e]) throw new RuntimeException();\n res += ct[e] * f;\n i = src[e];\n }\n }\n for (int i = 0; i < n; i++) {\n d[i] += bestDist[i];\n }\n }\n return res;\n }\n\n private static final long INF = Long.MAX_VALUE;\n\n int n, m;\n int[] head;\n int[] nx;\n int[] src;\n int[] dst;\n int[] cp;\n long[] ct;\n int[] fl;\n int last;\n\n long[] d;\n long[] bestDist;\n int[] prev;\n int[] heap;\n int[] heapRev;\n int heapSize;\n long maxFlow;\n\n private void dijkstra(int start) {\n Arrays.fill(bestDist, INF);\n heapSize = n;\n bestDist[start] = 0;\n siftUp(heapRev[start]);\n for (int i = 0; i < n; i++) {\n int x = removeMin();\n if (bestDist[x] == INF) {\n break;\n }\n int j = head[x];\n while (j >= 0) {\n if (fl[j] < cp[j]) {\n int y = dst[j];\n long d = ct[j] + this.d[x] - this.d[y];\n if (d < 0) {\n throw new AssertionError(\"negative edge\");\n }\n long ll = bestDist[x] + d;\n if (bestDist[y] > ll) {\n prev[y] = j;\n bestDist[y] = ll;\n siftUp(heapRev[y]);\n }\n }\n j = nx[j];\n }\n }\n }\n\n private void siftUp(int i) {\n while (i > 0 && bestDist[heap[(i - 1) / 2]] > bestDist[heap[i]]) {\n swap(i, (i - 1) / 2);\n i = (i - 1) / 2;\n }\n }\n\n private int removeMin() {\n int res = heap[0];\n swap(0, heapSize - 1);\n heapSize--;\n int i = 0;\n while (2 * i + 1 < heapSize) {\n int j = i;\n if (bestDist[heap[2 * i + 1]] < bestDist[heap[j]]) {\n j = 2 * i + 1;\n }\n if (2 * i + 2 < heapSize && bestDist[heap[2 * i + 2]] < bestDist[heap[j]]) {\n j = 2 * i + 2;\n }\n if (i == j) break;\n swap(i, j);\n i = j;\n }\n return res;\n }\n\n private void swap(int i, int j) {\n int t = heap[i];\n heap[i] = heap[j];\n heap[j] = t;\n heapRev[heap[i]] = i;\n heapRev[heap[j]] = j;\n }\n}\n", "lang_cluster": "Java", "tags": ["flows"], "code_uid": "d82f81e21b42bd7875d2b3caa4bcb18f", "src_uid": "1f0e8bbd5bf4fcdea927fbb505a8949b", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.*;\n\n\npublic class C {\t\n\tBufferedReader reader;\n StringTokenizer tokenizer;\n PrintWriter out;\n \n\tpublic void solve() throws IOException {\t\t\t\t\n\t\tint N = nextInt();\n\t\tint M = nextInt();\n\t\tint[][] a = new int[N][M];\n\t\tfor(int i = 0; i < N; i++)\n\t\t\tfor(int j = 0; j < M; j++)\n\t\t\t\ta[i][j] = nextInt();\n\t\t\n\t\tint size = N*M + 2;\n\t\tint[][] cap = new int[size][size];\n\t\tint[][] cost = new int[size][size];\n\t\tint src = N*M;\n\t\tint dst = N*M+1;\n\t\t\n\t\tint[] dx = new int[]{-1,1,0,0};\n\t\tint[] dy = new int[]{0,0,-1,1};\n\t\t\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tfor(int j = 0; j < M; j++){\n\t\t\t\tint index = i*M+j;\n\t\t\t\tif( (i+j) % 2 == 0){\n\t\t\t\t\tcap[src][index] = 1;\n\t\t\t\t\tfor(int k = 0; k < 4; k++){\n\t\t\t\t\t\tint newx = i + dx[k];\n\t\t\t\t\t\tint newy = j + dy[k];\n\t\t\t\t\t\tif( newx < 0 || newx >= N || newy < 0 || newy >= M) continue;\n\t\t\t\t\t\tint newindex = newx*M + newy;\n\t\t\t\t\t\tcap[index][newindex] = 1;\n\t\t\t\t\t\tcost[index][newindex] = a[i][j] == a[newx][newy]? 0: 1;\t\t\t\t\t\n//\t\t\t\t\t\tcost[newindex][index] = -1* cost[index][newindex];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tcap[index][dst] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tMinCostMaxFlow flow = new MinCostMaxFlow();\n\t\tint result[] = flow.getMaxFlow(cap, cost, src, dst);\n\t\tif( result[0] == N*M/2 )\n\t\t\tout.println(result[1]);\n\t\telse\n\t\t\tout.println(-1);\n\t}\n\t\n\t/**\n\t * @param args\n\t */\n\tpublic static void main(String[] args) {\n\t\tnew C().run();\n\t}\n\t\n\tpublic void run() {\n try {\n reader = new BufferedReader(new InputStreamReader(System.in));\n tokenizer = null;\n out = new PrintWriter(System.out);\n solve();\n reader.close();\n out.close();\n } catch (Exception e) {\n e.printStackTrace();\n System.exit(1);\n }\n }\n\n int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n String nextToken() throws IOException {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n tokenizer = new StringTokenizer(reader.readLine());\n }\n return tokenizer.nextToken();\n }\n\n}\n\n//Min cost max flow algorithm using an adjacency matrix. If you\n//want just regular max flow, setting all edge costs to 1 gives\n//running time O(|E|^2 |V|).\n//\n//Running time: O(min(|V|^2 * totflow, |V|^3 * totcost))\n//\n//INPUT: cap -- a matrix such that cap[i][j] is the capacity of\n// a directed edge from node i to node j\n//\n// cost -- a matrix such that cost[i][j] is the (positive)\n// cost of sending one unit of flow along a \n// directed edge from node i to node j\n//\n// source -- starting node\n// sink -- ending node\n//\n//OUTPUT: max flow and min cost; the matrix flow will contain\n// the actual flow values (note that unlike in the MaxFlow\n// code, you don't need to ignore negative flow values -- there\n// shouldn't be any)\n//\n//To use this, create a MinCostMaxFlow object, and call it like this:\n//\n//MinCostMaxFlow nf;\n//int maxflow = nf.getMaxFlow(cap,cost,source,sink);\n\nclass MinCostMaxFlow {\n\tboolean found[];\n\tint N, cap[][], flow[][], cost[][], dad[], dist[], pi[];\n\t\n\tstatic final int INF = Integer.MAX_VALUE / 2 - 1;\n\t\n\tboolean search(int source, int sink) {\n\t\tArrays.fill(found, false);\n\t\tArrays.fill(dist, INF);\n\t\tdist[source] = 0;\n\t\twhile (source != N) {\n\t\t\tint best = N;\n\t\t\tfound[source] = true;\n\t\t\tfor (int k = 0; k < N; k++) {\n\t\t\t\tif (found[k]) continue;\n\t\t\t\tif (flow[k][source] != 0) {\n\t\t\t\t\tint val = dist[source] + pi[source] - pi[k] - cost[k][source];\n\t\t\t\t\tif (dist[k] > val) {\n\t\t\t\t\t\tdist[k] = val;\n\t\t\t\t\t\tdad[k] = source;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (flow[source][k] < cap[source][k]) {\n\t\t\t\t\tint val = dist[source] + pi[source] - pi[k] + cost[source][k];\n\t\t\t\t\tif (dist[k] > val) {\n\t\t\t\t\t\tdist[k] = val;\n\t\t\t\t\t\tdad[k] = source;\n\t\t\t\t\t}\n\t\t\t\t}\t\t\n\t\t\t\tif (dist[k] < dist[best]) best = k;\n\t\t\t}\n\t\t\tsource = best;\n\t\t}\n\t\tfor (int k = 0; k < N; k++)\n\t\t\tpi[k] = Math.min(pi[k] + dist[k], INF);\n\t\treturn found[sink];\n\t}\n\t\t\n\tint[] getMaxFlow(int cap[][], int cost[][], int source, int sink) {\n\t\tthis.cap = cap;\n\t\tthis.cost = cost;\n\t\n\t\tN = cap.length;\n\t\tfound = new boolean[N];\n\t\tflow = new int[N][N];\n\t\tdist = new int[N+1];\n\t\tdad = new int[N];\n\t\tpi = new int[N];\n\t\n\t\tint totflow = 0, totcost = 0;\n\t\twhile (search(source, sink)) {\n\t\t\tint amt = INF;\n\t\t\tfor (int x = sink; x != source; x = dad[x])\n\t\t\t\tamt = Math.min(amt, flow[x][dad[x]] != 0 ? flow[x][dad[x]] :cap[dad[x]][x] - flow[dad[x]][x]);\n\t\t\tfor (int x = sink; x != source; x = dad[x]) {\n\t\t\t\tif (flow[x][dad[x]] != 0) {\n\t\t\t\t\tflow[x][dad[x]] -= amt;\n\t\t\t\t\ttotcost -= amt * cost[x][dad[x]];\n\t\t\t\t} else {\n\t\t\t\t\tflow[dad[x]][x] += amt;\n\t\t\t\t\ttotcost += amt * cost[dad[x]][x];\n\t\t\t\t}\n\t\t\t}\n\t\t\ttotflow += amt;\n\t\t}\t\n\t\treturn new int[]{ totflow, totcost };\n\t} \n}\n", "lang_cluster": "Java", "tags": ["flows"], "code_uid": "19dddadfddc7b6582d7b889b54f99404", "src_uid": "1f0e8bbd5bf4fcdea927fbb505a8949b", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Problem {\n\n class Rib {\n Vertex to;\n int capacity, weight, flow;\n Rib invert, next;\n\n Rib(Vertex to, int capacity, int weight) {\n this.to = to;\n this.capacity = capacity;\n this.weight = weight;\n this.flow = 0;\n next = null;\n }\n }\n\n class Vertex {\n Rib last;\n int phi, dist;\n int flow;\n boolean used;\n Rib way;\n\n Vertex() {\n last = null;\n phi = dist = 0;\n flow = 0;\n used = false;\n way = null;\n }\n }\n\n\n Scanner in = new Scanner(System.in);\n PrintWriter out = new PrintWriter(System.out);\n\n int minCostMaxFlow(Vertex[] g) {\n int n = g.length - 2;\n Vertex s, t;\n int cost = 0;\n\n while (true) {\n s = g[n];\n t = g[n + 1];\n dejkstra(g, s);\n if (t.way == null) break;\n int df = t.flow;\n// out.println(\"(\" + t.dist + \"-(\" + s.phi + \"-\" + t.phi + \"))*\" + t.flow);\n cost += (t.dist - (s.phi - t.phi)) * t.flow;\n while (t.way != null) {\n t.way.flow += df;\n t.way.invert.flow -= df;\n t = t.way.invert.to;\n// outVertex(t, g, g[g.length - 2], g[g.length - 1]);\n// out.print(\" \");\n }\n// out.println();\n }\n\n return cost;\n }\n\n void outVertex(Vertex v, Vertex[] g, Vertex s, Vertex t) {\n if (v == s) out.print(\"s\"); else\n if (v == t) out.print(\"t\"); else\n for (int i = 0; i < g.length; i++) {\n if (v == g[i]) out.print(i);\n }\n out.flush();\n }\n int goCnt = 0;\n\n void dejkstra(Vertex[] g, Vertex s) {\n for (Vertex v : g) {\n v.way = null;\n v.phi += v.dist;\n v.dist = g.length * g.length;\n v.used = false;\n }\n s.flow = g.length * g.length;\n class GoInfo {\n int dist;\n Rib rib;\n Vertex vertex;\n int ind;\n\n GoInfo(int dist, Vertex vertex, Rib rib, int ind) {\n this.dist = dist;\n this.vertex = vertex;\n this.rib = rib;\n this.ind = ind;\n }\n }\n class GoComp implements Comparator<GoInfo> {\n public int compare(GoInfo a, GoInfo b) {\n if (a.dist == b.dist) {\n return a.ind - b.ind;\n }\n return a.dist - b.dist;\n }\n }\n TreeSet<GoInfo> q = new TreeSet<GoInfo>(new GoComp());\n q.add(new GoInfo(0, s, null, goCnt++));\n while (!q.isEmpty()) {\n GoInfo info = q.first();\n q.remove(info);\n Vertex v = info.vertex;\n if (v.used) continue;\n\n\n// out.print(info.dist + \" [\");\n// if (info.rib != null) outVertex(info.rib.invert.to, g, s, g[g.length - 1]);\n// out.print(\" \");\n// outVertex(v, g, s, g[g.length - 1]);\n// out.println(\"]\");\n v.dist = info.dist;\n v.way = info.rib;\n v.used = true;\n if (info.rib != null) v.flow = Math.min(info.rib.invert.to.flow, info.rib.capacity - info.rib.flow);\n for (Rib rib = v.last; rib != null; rib = rib.next) {\n if (rib.flow == rib.capacity) continue;\n q.add(new GoInfo(v.dist + rib.weight + (v.phi - rib.to.phi), rib.to, rib, goCnt++));\n }\n }\n// for (int i = 0; i < g.length; i++) {\n// out.print(\"d[\");\n// outVertex(g[i], g, g[g.length - 2], g[g.length - 1]);\n// out.println(\"] = dist(\" + g[i].dist + \") phi(\" + g[i].phi + \")\");\n// }\n// out.println(\"\\n\");\n }\n\n void addRib(Vertex from, Vertex to, int capacity, int weight) {\n Rib direct = new Rib(to, capacity, weight);\n Rib invert = new Rib(from, 0, -weight);\n direct.invert = invert;\n invert.invert = direct;\n direct.next = from.last;\n from.last = direct;\n invert.next = to.last;\n to.last = invert;\n }\n\n boolean inRange(int x, int min, int max) {\n return x >= min && x <= max;\n }\n\n Vertex[] readAndMakeGraph() {\n int n = in.nextInt();\n int m = in.nextInt();\n int[][] a = new int[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n a[i][j] = in.nextInt();\n }\n }\n Vertex[] v = new Vertex[n * m + 2];\n for (int i = 0; i < n * m + 2; i++) v[i] = new Vertex();\n Vertex s = v[n * m];\n Vertex t = v[n * m + 1];\n for (int i = 0; i < n; i++) {\n for (int j = i % 2; j < m; j += 2) {\n for (int dx = -1; dx <= 1; dx++) {\n for (int dy = -1; dy <= 1; dy++) {\n if (Math.abs(dx) + Math.abs(dy) == 1) {\n int ni = i + dx;\n int nj = j + dy;\n if (inRange(ni, 0, n - 1) && inRange(nj, 0, m - 1)) {\n addRib(v[i * m + j], v[ni * m + nj], 1, (a[i][j] == a[ni][nj]? 0 : 1));\n }\n }\n }\n }\n }\n }\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n if ((i + j) % 2 == 0) {\n addRib(s, v[i * m + j], 1, 0);\n } else {\n addRib(v[i * m + j], t, 1, 0);\n }\n }\n }\n v[v.length - 1].last = null;\n\n return v;\n }\n\n void solve() {\n out.print(minCostMaxFlow(readAndMakeGraph()));\n out.close();\n }\n\n public static void main(String[] args) {\n (new Problem()).solve();\n }\n}\n", "lang_cluster": "Java", "tags": ["flows"], "code_uid": "a458874da31dcc8e2a84a1f43575483c", "src_uid": "1f0e8bbd5bf4fcdea927fbb505a8949b", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.util.Arrays;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskC1 solver = new TaskC1();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskC1 {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.nextInt();\n int m = in.nextInt();\n int[][] a = new int[n][m];\n for (int i = 0; i < n; ++i)\n for (int j = 0; j < m; ++j)\n a[i][j] = in.nextInt();\n int nv = n * m + 2;\n int s = nv - 2;\n int t = nv - 1;\n int[][] cap = new int[nv][nv];\n int[][] cost = new int[nv][nv];\n for (int i = 0; i < n; ++i)\n for (int j = 0; j < m; ++j) {\n if ((i + j) % 2 == 0) {\n cap[s][i * m + j] = 1;\n for (int di = -1; di <= 1; ++di)\n for (int dj = -1; dj <= 1; ++dj)\n if (Math.abs(di) + Math.abs(dj) == 1) {\n int ni = i + di;\n int nj = j + dj;\n if (ni >= 0 && ni < n && nj >= 0 && nj < m) {\n cap[i * m + j][ni * m + nj] = 1;\n cost[i * m + j][ni * m + nj] = (a[i][j] == a[ni][nj] ? 0 : 1);\n cost[ni * m + nj][i * m + j] = -cost[i * m + j][ni * m + nj];\n }\n }\n } else {\n cap[i * m + j][t] = 1;\n }\n }\n FlowRes fr = minCostMaxFlow(nv, s, t, cap, cost);\n if (fr.flow != n * m / 2) throw new RuntimeException();\n out.println(fr.cost);\n }\n static class FlowRes {\n int flow;\n int cost;\n }\n\n static final int INF = (int) 1e9;\n\n private FlowRes minCostMaxFlow(int n, int s, int t, int[][] cap, int[][] cost) {\n int[] pri = new int[n];\n FlowRes res = new FlowRes();\n while (true) {\n int[] dist = new int[n];\n int[] prev = new int[n];\n Arrays.fill(prev, -1);\n Arrays.fill(dist, INF);\n dist[s] = 0;\n boolean[] mark = new boolean[n];\n int mxd = 0;\n while (true) {\n int bi = -1;\n for (int i = 0; i < n; ++i) if (dist[i] < INF / 2 && !mark[i]) {\n if (bi < 0 || dist[i] < dist[bi])\n bi = i;\n }\n if (bi < 0) break;\n mark[bi] = true;\n mxd = dist[bi];\n for (int i = 0; i < n; ++i) if (!mark[i] && cap[bi][i] > 0) {\n int edge = pri[bi] - pri[i] + cost[bi][i];\n if (dist[i] > dist[bi] + edge) {\n dist[i] = dist[bi] + edge;\n prev[i] = bi;\n }\n }\n }\n if (!mark[t]) break;\n ++res.flow;\n res.cost += dist[t] - pri[s] + pri[t];\n int at = t;\n while (at != s) {\n int pat = prev[at];\n --cap[pat][at];\n ++cap[at][pat];\n at = pat;\n }\n for (int i = 0; i < n; ++i) {\n if (dist[i] > INF / 2) pri[i] += mxd; else pri[i] += dist[i];\n }\n }\n return res;\n }\n}\n\nclass InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream));\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n\n", "lang_cluster": "Java", "tags": ["flows"], "code_uid": "855eec69932cbfd381d63ce09a96d379", "src_uid": "1f0e8bbd5bf4fcdea927fbb505a8949b", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class C_new {\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\tboolean eof;\n\n\tint n, m;\n\n\tclass Edge {\n\t\tint to, flow, cap, cost;\n\t\tEdge rev;\n\n\t\tpublic Edge(int to, int cap, int cost) {\n\t\t\tthis.to = to;\n\t\t\tthis.cap = cap;\n\t\t\tthis.cost = cost;\n\t\t}\n\t}\n\n\tstatic final int[] dx = { -1, 0, 1, 0 };\n\tstatic final int[] dy = { 0, -1, 0, 1 };\n\tstatic final int INF = Integer.MAX_VALUE / 3;\n\n\tList<Edge>[] g;\n\n\tvoid addEdge(int v1, int v2, int cost) {\n\t\tEdge e1 = new Edge(v2, 1, cost);\n\t\tEdge e2 = new Edge(v1, 0, -cost);\n\t\te1.rev = e2;\n\t\te2.rev = e1;\n\t\tg[v1].add(e1);\n\t\tg[v2].add(e2);\n\t}\n\n\tint S, T;\n\n\tvoid solve() throws IOException {\n\t\tn = nextInt();\n\t\tm = nextInt();\n\n\t\tint[][] f = new int[n][m];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tfor (int j = 0; j < m; j++)\n\t\t\t\tf[i][j] = nextInt();\n\n\t\tg = new ArrayList[n * m + 2];\n\t\tS = n * m;\n\t\tT = n * m + 1;\n\t\tfor (int i = 0; i < n * m; i++)\n\t\t\tg[i] = new ArrayList<>(4);\n\t\tg[S] = new ArrayList<>(n * m / 2);\n\t\tg[T] = new ArrayList<>(n * m / 2);\n\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tint v = i * m + j;\n\t\t\t\tint col = (i + j) & 1;\n\t\t\t\tif (col == 0) {\n\t\t\t\t\taddEdge(S, v, 0);\n\t\t\t\t\tfor (int dir = 0; dir < 4; dir++) {\n\t\t\t\t\t\tint ni = i + dx[dir];\n\t\t\t\t\t\tint nj = j + dy[dir];\n\t\t\t\t\t\tif (ni >= 0 && ni < n && nj >= 0 && nj < m) {\n\t\t\t\t\t\t\tint to = ni * m + nj;\n\t\t\t\t\t\t\tint cost = (f[i][j] == f[ni][nj] ? 0 : 1);\n\t\t\t\t\t\t\taddEdge(v, to, cost);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\taddEdge(v, T, 0);\n\t\t\t\t}\n\t\t\t}\n\t\t\n\t\tint ans = 0;\n\t\t\n\t\tfinal int[] d = new int[n * m + 2];\n\t\tEdge[] from = new Edge[n * m + 2];\n\t\t\n\t\tInteger[] Integers = new Integer[n * m + 2];\n\t\tfor (int i = 0; i < n * m + 2; i++)\n\t\t\tIntegers[i] = i;\n\t\t\n\t\tTreeSet<Integer> set = new TreeSet<>(new Comparator<Integer>() {\n\n\t\t\t@Override\n\t\t\tpublic int compare(Integer o1, Integer o2) {\n\t\t\t\tif (d[o1] != d[o2])\n\t\t\t\t\treturn Integer.compare(d[o1], d[o2]);\n\t\t\t\treturn o1.compareTo(o2);\n\t\t\t}\n\t\t\t\n\t\t});\n\t\t\n\t\tfor (int iter = 0; iter < n * m / 2; iter++) {\n\t\t\t\n\t\t\tArrays.fill(d, INF);\n\t\t\td[S] = 0;\n\t\t\t\n\t\t\tfor (int i = 0; i < n * m + 2; i++)\n\t\t\t\tset.add(Integers[i]);\n\t\t\t\n\t\t\twhile (true) {\n\t\t\t\tint v = set.pollFirst();\n\t\t\t\t\n//\t\t\t\tSystem.err.println(v + \" \" + Arrays.toString(d));\n\t\t\t\t\n\t\t\t\tif (v == T) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tfor (int i = 0; i < g[v].size(); i++) {\n\t\t\t\t\tEdge e = g[v].get(i);\n\t\t\t\t\tif (e.flow < e.cap) {\n\t\t\t\t\t\tif (d[e.to] > d[v] + e.cost) {\n\t\t\t\t\t\t\tset.remove(Integers[e.to]);\n\t\t\t\t\t\t\tfrom[e.to] = e; \n\t\t\t\t\t\t\td[e.to] = d[v] + e.cost;\n\t\t\t\t\t\t\tset.add(Integers[e.to]);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tfor (int v = T; v != S; ) {\n\t\t\t\tEdge last = from[v];\n\t\t\t\tlast.flow++;\n\t\t\t\tlast.rev.flow--;\n\t\t\t\tans += last.cost;\n\t\t\t\tv = last.rev.to;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\t\n\t\tout.println(ans);\n\n\t}\n\n\tC_new() throws IOException {\n\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.close();\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew C_new();\n\t}\n\n\tString nextToken() {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (Exception e) {\n\t\t\t\teof = true;\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tString nextString() {\n\t\ttry {\n\t\t\treturn br.readLine();\n\t\t} catch (IOException e) {\n\t\t\teof = true;\n\t\t\treturn null;\n\t\t}\n\t}\n\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n}", "lang_cluster": "Java", "tags": ["flows"], "code_uid": "35efd2f42652c4133ffe3fe6217d7cde", "src_uid": "1f0e8bbd5bf4fcdea927fbb505a8949b", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class C1 {\n\n int n, m, k;\n int[][] f;\n boolean[][] c;\n boolean[] mask;\n int best = Integer.MAX_VALUE;\n\n void calc(int i, int j, int cnt) {\n if (cnt < best) {\n if (i == n - 1 && j == m) {\n best = cnt;\n } else {\n if (j == m) {\n j = 0;\n ++i;\n }\n if (c[i][j]) {\n calc(i, j + 1, cnt);\n } else {\n c[i][j] = true;\n int a = f[i][j];\n if (j < m - 1 && !c[i][j + 1]) {\n int b = f[i][j + 1];\n c[i][j + 1] = true;\n mask[a] = true;\n calc(i, j + 2, a == b ? cnt : cnt + 1);\n mask[a] = false;\n /*\n if (a != b) {\n mask[b] = true;\n calc(i, j + 2, cnt + 1);\n mask[b] = false;\n }\n */\n c[i][j + 1] = false;\n }\n if (i < n - 1 && !c[i + 1][j]) {\n int b = f[i + 1][j];\n c[i + 1][j] = true;\n mask[a] = true;\n calc(i, j + 1, a == b ? cnt : cnt + 1);\n mask[a] = false;\n /*\n if (a != b) {\n mask[b] = true;\n calc(i, j + 1, cnt + 1);\n mask[b] = false;\n }\n */\n c[i + 1][j] = false;\n }\n c[i][j] = false;\n }\n }\n }\n }\n\n void solve() throws IOException {\n in(\"__std\"); out(\"__std\");\n\n n = readInt();\n m = readInt();\n k = n * m / 2;\n f = new int[n][m];\n c = new boolean[n][m];\n mask = new boolean[k];\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < m; ++j) {\n f[i][j] = readInt() - 1;\n }\n }\n calc(0, 0, 0);\n println(best);\n\n exit();\n }\n\n void in(String name) throws IOException {\n if (name.equals(\"__std\")) {\n in = new BufferedReader(new InputStreamReader(System.in));\n } else {\n in = new BufferedReader(new FileReader(name));\n }\n }\n\n void out(String name) throws IOException {\n if (name.equals(\"__std\")) {\n out = new PrintWriter(System.out);\n } else {\n out = new PrintWriter(name);\n }\n }\n\n void exit() {\n out.close();\n System.exit(0);\n }\n\n char readChar() throws IOException {\n return (char) in.read();\n }\n\n int readInt() throws IOException {\n return Integer.parseInt(readToken());\n }\n\n long readLong() throws IOException {\n return Long.parseLong(readToken());\n }\n\n double readDouble() throws IOException {\n return Double.parseDouble(readToken());\n }\n\n String readLine() throws IOException {\n st = null;\n return in.readLine();\n }\n\n String readToken() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(in.readLine());\n }\n return st.nextToken();\n }\n\n boolean eof() throws IOException {\n return !in.ready();\n }\n\n void print(String format, Object ... args) {\n out.print(new Formatter(Locale.US).format(format, args));\n }\n\n void println(String format, Object ... args) {\n out.println(new Formatter(Locale.US).format(format, args));\n }\n\n void print(Object value) {\n out.print(value);\n }\n\n void println(Object value) {\n out.println(value);\n }\n\n void println() {\n out.println();\n }\n\n StringTokenizer st;\n\n BufferedReader in;\n PrintWriter out;\n\n public static void main(String[] args) throws IOException {\n new C1().solve();\n }\n}\n", "lang_cluster": "Java", "tags": ["flows"], "code_uid": "dc13b443c470cb7f206c3050176a9326", "src_uid": "1f0e8bbd5bf4fcdea927fbb505a8949b", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class C {\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\tboolean eof;\n\n\tint n, m;\n\n\tclass Edge {\n\t\tint to, flow, cap, cost;\n\t\tEdge rev;\n\n\t\tpublic Edge(int to, int cap, int cost) {\n\t\t\tthis.to = to;\n\t\t\tthis.cap = cap;\n\t\t\tthis.cost = cost;\n\t\t}\n\t}\n\n\tstatic final int[] dx = { -1, 0, 1, 0 };\n\tstatic final int[] dy = { 0, -1, 0, 1 };\n\tstatic final int INF = Integer.MAX_VALUE / 3;\n\n\tList<Edge>[] g;\n\n\tvoid addEdge(int v1, int v2, int cost) {\n\t\tEdge e1 = new Edge(v2, 1, cost);\n\t\tEdge e2 = new Edge(v1, 0, -cost);\n\t\te1.rev = e2;\n\t\te2.rev = e1;\n\t\tg[v1].add(e1);\n\t\tg[v2].add(e2);\n\t}\n\n\tint S, T;\n\n\tvoid solve() throws IOException {\n\t\tn = nextInt();\n\t\tm = nextInt();\n\n\t\tint[][] f = new int[n][m];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tfor (int j = 0; j < m; j++)\n\t\t\t\tf[i][j] = nextInt();\n\n\t\tg = new ArrayList[n * m + 2];\n\t\tS = n * m;\n\t\tT = n * m + 1;\n\t\tfor (int i = 0; i < n * m; i++)\n\t\t\tg[i] = new ArrayList<>(5);\n\t\tg[S] = new ArrayList<>(n * m / 2);\n\t\tg[T] = new ArrayList<>(n * m / 2);\n\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tint v = i * m + j;\n\t\t\t\tint col = (i + j) & 1;\n\t\t\t\tif (col == 0) {\n\t\t\t\t\taddEdge(S, v, 0);\n\t\t\t\t\tfor (int dir = 0; dir < 4; dir++) {\n\t\t\t\t\t\tint ni = i + dx[dir];\n\t\t\t\t\t\tint nj = j + dy[dir];\n\t\t\t\t\t\tif (ni >= 0 && ni < n && nj >= 0 && nj < m) {\n\t\t\t\t\t\t\tint to = ni * m + nj;\n\t\t\t\t\t\t\tint cost = (f[i][j] == f[ni][nj] ? 0 : 1);\n\t\t\t\t\t\t\taddEdge(v, to, cost);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\taddEdge(v, T, 0);\n\t\t\t\t}\n\t\t\t}\n\t\t\n\t\tint ans = 0;\n\t\tint[] pi = new int[n * m + 2];\n\t\t\n\t\tfinal int[] d = new int[n * m + 2];\n\t\tEdge[] from = new Edge[n * m + 2];\n\t\t\n\t\tInteger[] Integers = new Integer[n * m + 2];\n\t\tfor (int i = 0; i < n * m + 2; i++)\n\t\t\tIntegers[i] = i;\n\t\t\n\t\tTreeSet<Integer> set = new TreeSet<>(new Comparator<Integer>() {\n\n\t\t\t@Override\n\t\t\tpublic int compare(Integer o1, Integer o2) {\n\t\t\t\tif (d[o1] != d[o2])\n\t\t\t\t\treturn Integer.compare(d[o1], d[o2]);\n\t\t\t\treturn o1.compareTo(o2);\n\t\t\t}\n\t\t\t\n\t\t});\n\t\t\n\t\tint[] permLabel = new int[n * m + 2];\n\t\tint permLabelSz = 0;\n\t\t\n\t\tfor (int iter = 0; iter < n * m / 2; iter++) {\n\t\t\t\n\t\t\tArrays.fill(d, INF);\n\t\t\td[S] = 0;\n\t\t\t\n\t\t\tset.add(Integers[S]);\n\t\t\t\n\t\t\tpermLabelSz = 0;\n\t\t\t\n\t\t\twhile (true) {\n\t\t\t\tint v = set.pollFirst();\n\t\t\t\t\n\t\t\t\tif (v == T) {\n\t\t\t\t\tset.clear();\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tpermLabel[permLabelSz++] = v;\n\t\t\t\t\n\t\t\t\tfor (int i = 0; i < g[v].size(); i++) {\n\t\t\t\t\tEdge e = g[v].get(i);\n\t\t\t\t\tif (e.flow < e.cap) {\n\t\t\t\t\t\tint redCost = e.cost - pi[v] + pi[e.to];\n\t\t\t\t\t\tif (redCost < 0)\n\t\t\t\t\t\t\tthrow new AssertionError();\n\t\t\t\t\t\tif (d[e.to] > d[v] + redCost) {\n\t\t\t\t\t\t\tset.remove(Integers[e.to]);\n\t\t\t\t\t\t\tfrom[e.to] = e; \n\t\t\t\t\t\t\td[e.to] = d[v] + redCost;\n\t\t\t\t\t\t\tset.add(Integers[e.to]);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tfor (int i = 0; i < permLabelSz; i++) {\n\t\t\t\tint v = permLabel[i];\n\t\t\t\tpi[v] -= d[v] - d[T];\n\t\t\t}\n\t\t\t\n\t\t\tfor (int v = T; v != S; ) {\n\t\t\t\tEdge last = from[v];\n\t\t\t\tlast.flow++;\n\t\t\t\tlast.rev.flow--;\n\t\t\t\tans += last.cost;\n\t\t\t\tv = last.rev.to;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\t\n\t\tout.println(ans);\n\n\t}\n\n\tC() throws IOException {\n\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.close();\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew C();\n\t}\n\n\tString nextToken() {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (Exception e) {\n\t\t\t\teof = true;\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tString nextString() {\n\t\ttry {\n\t\t\treturn br.readLine();\n\t\t} catch (IOException e) {\n\t\t\teof = true;\n\t\t\treturn null;\n\t\t}\n\t}\n\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n}", "lang_cluster": "Java", "tags": ["flows"], "code_uid": "49dde34b62427d95afe509c1b85509f6", "src_uid": "1f0e8bbd5bf4fcdea927fbb505a8949b", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\nimport java.awt.geom.*;\n\nimport static java.lang.Math.*;\n\npublic class Solution implements Runnable {\n\t\n\tclass Edge {\n\t\t\n\t\tint to, capacity, cost;\n\t\tint flow = 0;\n\t\tEdge compl = null;\n\t\t\n\t\tpublic Edge(int to, int capacity, int cost) {\n\t\t\tthis.to = to;\n\t\t\tthis.capacity = capacity;\n\t\t\tthis.cost = cost;\n\t\t}\n\t\t\n\t}\n\t\n\tint n, m;\n\tEdge[][] graph;\n\tint[] size;\n\t\n\tvoid addEdge(int from, int to, int cost) {\n\t\tEdge e1 = new Edge(to, 1, cost);\n\t\tEdge e2 = new Edge(from, 0, -cost);\n\t\te1.compl = e2;\n\t\te2.compl = e1;\n\t\tgraph[from][size[from]++] = e1;\n\t\tgraph[to][size[to]++] = e2;\n\t}\n\t\n\tboolean inBounds(int i, int j) {\n\t\treturn i >= 0 && i < n && j >= 0 && j < m;\n\t}\n\t\n\tint getIndex(int i, int j) {\n\t\treturn i * m + j;\n\t}\n\t\n\tvoid randomShuffle(int[] arr) {\n\t\tRandom rnd = new Random();\n\t\tfor (int i = arr.length - 1; i >= 0; i--) {\n\t\t\tint pos = rnd.nextInt(i + 1);\n\t\t\tint temp = arr[pos];\n\t\t\tarr[pos] = arr[i];\n\t\t\tarr[i] = temp;\n\t\t}\n\t}\n\t\n\tpublic void solve() throws Exception {\n\t\tn = sc.nextInt();\n\t\tm = sc.nextInt();\n\t\tint[][] field = new int[n][m];\n\t\t\n\t\tint[] arr = new int[n * m];\n\t\tfor (int i = 0; i < n * m; i += 2) {\n\t\t\tarr[i] = arr[i + 1] = i / 2 + 1;\n\t\t}\n\t\t\n\t\trandomShuffle(arr);\n\t\t\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tfield[i][j] = sc.nextInt();\n\t\t\t}\n\t\t}\n\t\tgraph = new Edge[n * m + 2][20];\n\t\tsize = new int[n * m + 2];\n\t\tint source = n * m;\n\t\tint sink = n * m + 1;\n\t\tgraph[source] = new Edge[n * m];\n\t\tgraph[sink] = new Edge[n * m];\n\t\tint gsize = n * m + 2;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tif ((i + j) % 2 == 0) {\n\t\t\t\t\taddEdge(source, getIndex(i, j), 0);\n\t\t\t\t\tif (inBounds(i - 1, j)) {\n\t\t\t\t\t\tif (field[i - 1][j] == field[i][j]) {\n\t\t\t\t\t\t\taddEdge(getIndex(i, j), getIndex(i - 1, j), 0);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\taddEdge(getIndex(i, j), getIndex(i - 1, j), 1);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (inBounds(i + 1, j)) {\n\t\t\t\t\t\tif (field[i + 1][j] == field[i][j]) {\n\t\t\t\t\t\t\taddEdge(getIndex(i, j), getIndex(i + 1, j), 0);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\taddEdge(getIndex(i, j), getIndex(i + 1, j), 1);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (inBounds(i, j - 1)) {\n\t\t\t\t\t\tif (field[i][j - 1] == field[i][j]) {\n\t\t\t\t\t\t\taddEdge(getIndex(i, j), getIndex(i, j - 1), 0);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\taddEdge(getIndex(i, j), getIndex(i, j - 1), 1);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (inBounds(i, j + 1)) {\n\t\t\t\t\t\tif (field[i][j + 1] == field[i][j]) {\n\t\t\t\t\t\t\taddEdge(getIndex(i, j), getIndex(i, j + 1), 0);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\taddEdge(getIndex(i, j), getIndex(i, j + 1), 1);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\taddEdge(getIndex(i, j), sink, 0);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\t\n\t\tint[] dist = new int[gsize];\n\t\tint[] from = new int[gsize];\n\t\tEdge[] byEdge = new Edge[gsize];\n\t\tDeque<Integer> q = new ArrayDeque<Integer>();\n\t\t\n\t\tint cost = 0;\n\t\tint flow = 0;\n\t\t\n\t\twhile (true) {\n\t\t\tArrays.fill(dist, Integer.MAX_VALUE / 4);\n\t\t\tq.clear();\n\t\t\tArrays.fill(from, -1);\n\t\t\tArrays.fill(byEdge, null);\n\t\t\tdist[source] = 0;\n\t\t\tq.offer(source);\n\t\t\twhile (!q.isEmpty()) {\n\t\t\t\tint v = q.poll();\n\t\t\t\tfor (int i = 0; i < size[v]; i++) {\n\t\t\t\t\tEdge e = graph[v][i];\n\t\t\t\t\tif (e.capacity - e.flow > 0 && dist[e.to] > dist[v] + e.cost) {\n\t\t\t\t\t\tdist[e.to] = dist[v] + e.cost;\n\t\t\t\t\t\tfrom[e.to] = v;\n\t\t\t\t\t\tbyEdge[e.to] = e;\n\t\t\t\t\t\tif (e.cost == 0) {\n\t\t\t\t\t\t\tq.offerFirst(e.to);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tq.offerLast(e.to);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (dist[sink] == Integer.MAX_VALUE / 4) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcost += dist[sink];\n\t\t\tflow++;\n\t\t\tint curv = sink;\n\t\t\twhile (from[curv] != -1) {\n\t\t\t\tEdge e = byEdge[curv];\n\t\t\t\tEdge compl = e.compl;\n\t\t\t\te.flow++;\n\t\t\t\tcompl.flow--;\n\t\t\t\tcurv = from[curv];\n\t\t\t}\n\t\t}\n\t\t\n\t\tout.println(cost);\n\t}\n\n\tstatic Throwable uncaught;\n\n\tBufferedReader in;\n\tFastScanner sc;\n\tPrintWriter out;\n\n\t@Override\n\tpublic void run() {\n\t\ttry {\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(System.out);\n\t\t\tsc = new FastScanner(in);\n\t\t\tsolve();\n\t\t} catch (Throwable uncaught) {\n\t\t\tSolution.uncaught = uncaught;\n\t\t} finally {\n\t\t\tout.close();\n\t\t}\n\t}\n\n\tpublic static void main(String[] args) throws Throwable {\n\t\tThread thread = new Thread(null, new Solution(), \"\", (1 << 26));\n\t\tthread.start();\n\t\tthread.join();\n\t\tif (Solution.uncaught != null) {\n\t\t\tthrow Solution.uncaught;\n\t\t}\n\t}\n\n}\n\nclass FastScanner {\n\n\tBufferedReader in;\n\tStringTokenizer st;\n\n\tpublic FastScanner(BufferedReader in) {\n\t\tthis.in = in;\n\t}\n\n\tpublic String nextToken() throws Exception {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\tst = new StringTokenizer(in.readLine());\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tpublic int nextInt() throws Exception {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tpublic long nextLong() throws Exception {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tpublic double nextDouble() throws Exception {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n\n}", "lang_cluster": "Java", "tags": ["flows"], "code_uid": "a2f290d81d8d76d18d122bde9d7c2fa4", "src_uid": "1f0e8bbd5bf4fcdea927fbb505a8949b", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class C {\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\tboolean eof;\n\n\tint n, m;\n\n\tclass Edge {\n\t\tint to, flow, cap, cost;\n\t\tEdge rev;\n\n\t\tpublic Edge(int to, int cap, int cost) {\n\t\t\tthis.to = to;\n\t\t\tthis.cap = cap;\n\t\t\tthis.cost = cost;\n\t\t}\n\t}\n\n\tstatic final int[] dx = { -1, 0, 1, 0 };\n\tstatic final int[] dy = { 0, -1, 0, 1 };\n\tstatic final int INF = Integer.MAX_VALUE / 3;\n\n\tList<Edge>[] g;\n\n\tvoid addEdge(int v1, int v2, int cost) {\n\t\tEdge e1 = new Edge(v2, 1, cost);\n\t\tEdge e2 = new Edge(v1, 0, -cost);\n\t\te1.rev = e2;\n\t\te2.rev = e1;\n\t\tg[v1].add(e1);\n\t\tg[v2].add(e2);\n\t}\n\n\tint S, T;\n\n\tvoid solve() throws IOException {\n\t\tn = nextInt();\n\t\tm = nextInt();\n\n\t\tint[][] f = new int[n][m];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tfor (int j = 0; j < m; j++)\n\t\t\t\tf[i][j] = nextInt();\n\n\t\tg = new ArrayList[n * m + 2];\n\t\tS = n * m;\n\t\tT = n * m + 1;\n\t\tfor (int i = 0; i < n * m; i++)\n\t\t\tg[i] = new ArrayList<>(5);\n\t\tg[S] = new ArrayList<>(n * m / 2);\n\t\tg[T] = new ArrayList<>(n * m / 2);\n\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tint v = i * m + j;\n\t\t\t\tint col = (i + j) & 1;\n\t\t\t\tif (col == 0) {\n\t\t\t\t\taddEdge(S, v, 0);\n\t\t\t\t\tfor (int dir = 0; dir < 4; dir++) {\n\t\t\t\t\t\tint ni = i + dx[dir];\n\t\t\t\t\t\tint nj = j + dy[dir];\n\t\t\t\t\t\tif (ni >= 0 && ni < n && nj >= 0 && nj < m) {\n\t\t\t\t\t\t\tint to = ni * m + nj;\n\t\t\t\t\t\t\tint cost = (f[i][j] == f[ni][nj] ? 0 : 1);\n\t\t\t\t\t\t\taddEdge(v, to, cost);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\taddEdge(v, T, 0);\n\t\t\t\t}\n\t\t\t}\n\t\t\n\t\tint ans = 0;\n\t\tint[] pi = new int[n * m + 2];\n\t\t\n\t\tfinal int[] d = new int[n * m + 2];\n\t\tEdge[] from = new Edge[n * m + 2];\n\t\t\n\t\tInteger[] Integers = new Integer[n * m + 2];\n\t\tfor (int i = 0; i < n * m + 2; i++)\n\t\t\tIntegers[i] = i;\n\t\t\n\t\tTreeSet<Integer> set = new TreeSet<>(new Comparator<Integer>() {\n\n\t\t\t@Override\n\t\t\tpublic int compare(Integer o1, Integer o2) {\n\t\t\t\tif (d[o1] != d[o2])\n\t\t\t\t\treturn Integer.compare(d[o1], d[o2]);\n\t\t\t\treturn o1.compareTo(o2);\n\t\t\t}\n\t\t\t\n\t\t});\n\t\t\n\t\tboolean[] permLabel = new boolean[n * m + 2];\n\t\t\n\t\tfor (int iter = 0; iter < n * m / 2; iter++) {\n\t\t\t\n\t\t\tArrays.fill(d, INF);\n\t\t\td[S] = 0;\n\t\t\t\n\t\t\tset.add(Integers[S]);\n\t\t\t\n\t\t\tArrays.fill(permLabel, false);\n\t\t\t\n\t\t\twhile (true) {\n\t\t\t\tint v = set.pollFirst();\n\t\t\t\t\n\t\t\t\tif (v == T) {\n\t\t\t\t\tset.clear();\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tpermLabel[v] = true;\n\t\t\t\t\n\t\t\t\tfor (int i = 0; i < g[v].size(); i++) {\n\t\t\t\t\tEdge e = g[v].get(i);\n\t\t\t\t\tif (e.flow < e.cap) {\n\t\t\t\t\t\tint redCost = e.cost - pi[v] + pi[e.to];\n\t\t\t\t\t\tif (redCost < 0)\n\t\t\t\t\t\t\tthrow new AssertionError();\n\t\t\t\t\t\tif (d[e.to] > d[v] + redCost) {\n\t\t\t\t\t\t\tset.remove(Integers[e.to]);\n\t\t\t\t\t\t\tfrom[e.to] = e; \n\t\t\t\t\t\t\td[e.to] = d[v] + redCost;\n\t\t\t\t\t\t\tset.add(Integers[e.to]);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tfor (int i = 0; i < n * m + 2; i++) {\n\t\t\t\tpi[i] -= (permLabel[i] ? d[i] : d[T]);\n\t\t\t}\n\t\t\t\n\t\t\tfor (int v = T; v != S; ) {\n\t\t\t\tEdge last = from[v];\n\t\t\t\tlast.flow++;\n\t\t\t\tlast.rev.flow--;\n\t\t\t\tans += last.cost;\n\t\t\t\tv = last.rev.to;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\t\n\t\tout.println(ans);\n\n\t}\n\n\tC() throws IOException {\n\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.close();\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew C();\n\t}\n\n\tString nextToken() {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (Exception e) {\n\t\t\t\teof = true;\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tString nextString() {\n\t\ttry {\n\t\t\treturn br.readLine();\n\t\t} catch (IOException e) {\n\t\t\teof = true;\n\t\t\treturn null;\n\t\t}\n\t}\n\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n}", "lang_cluster": "Java", "tags": ["flows"], "code_uid": "4b7c67bbff3bdefcc64656bcfe408062", "src_uid": "1f0e8bbd5bf4fcdea927fbb505a8949b", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class C {\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\tboolean eof;\n\n\tint n, m;\n\n\tclass Edge {\n\t\tint to, flow, cap, cost;\n\t\tEdge rev;\n\n\t\tpublic Edge(int to, int cap, int cost) {\n\t\t\tthis.to = to;\n\t\t\tthis.cap = cap;\n\t\t\tthis.cost = cost;\n\t\t}\n\t}\n\n\tstatic final int[] dx = { -1, 0, 1, 0 };\n\tstatic final int[] dy = { 0, -1, 0, 1 };\n\tstatic final int INF = Integer.MAX_VALUE / 3;\n\n\tList<Edge>[] g;\n\n\tvoid addEdge(int v1, int v2, int cost) {\n\t\tEdge e1 = new Edge(v2, 1, cost);\n\t\tEdge e2 = new Edge(v1, 0, -cost);\n\t\te1.rev = e2;\n\t\te2.rev = e1;\n\t\tg[v1].add(e1);\n\t\tg[v2].add(e2);\n\t}\n\n\tint S, T;\n\n\tvoid solve() throws IOException {\n\t\tn = nextInt();\n\t\tm = nextInt();\n\n\t\tint[][] f = new int[n][m];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tfor (int j = 0; j < m; j++)\n\t\t\t\tf[i][j] = nextInt();\n\n\t\tg = new ArrayList[n * m + 2];\n\t\tS = n * m;\n\t\tT = n * m + 1;\n\t\tfor (int i = 0; i < n * m; i++)\n\t\t\tg[i] = new ArrayList<>(4);\n\t\tg[S] = new ArrayList<>(n * m / 2);\n\t\tg[T] = new ArrayList<>(n * m / 2);\n\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tint v = i * m + j;\n\t\t\t\tint col = (i + j) & 1;\n\t\t\t\tif (col == 0) {\n\t\t\t\t\taddEdge(S, v, 0);\n\t\t\t\t\tfor (int dir = 0; dir < 4; dir++) {\n\t\t\t\t\t\tint ni = i + dx[dir];\n\t\t\t\t\t\tint nj = j + dy[dir];\n\t\t\t\t\t\tif (ni >= 0 && ni < n && nj >= 0 && nj < m) {\n\t\t\t\t\t\t\tint to = ni * m + nj;\n\t\t\t\t\t\t\tint cost = (f[i][j] == f[ni][nj] ? 0 : 1);\n\t\t\t\t\t\t\taddEdge(v, to, cost);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\taddEdge(v, T, 0);\n\t\t\t\t}\n\t\t\t}\n\t\t\n\t\tint ans = 0;\n\t\tint[] pi = new int[n * m + 2];\n\t\t\n\t\tfinal int[] d = new int[n * m + 2];\n\t\tEdge[] from = new Edge[n * m + 2];\n\t\t\n\t\tInteger[] Integers = new Integer[n * m + 2];\n\t\tfor (int i = 0; i < n * m + 2; i++)\n\t\t\tIntegers[i] = i;\n\t\t\n\t\tTreeSet<Integer> set = new TreeSet<>(new Comparator<Integer>() {\n\n\t\t\t@Override\n\t\t\tpublic int compare(Integer o1, Integer o2) {\n\t\t\t\tif (d[o1] != d[o2])\n\t\t\t\t\treturn Integer.compare(d[o1], d[o2]);\n\t\t\t\treturn o1.compareTo(o2);\n\t\t\t}\n\t\t\t\n\t\t});\n\t\t\n\t\tfor (int iter = 0; iter < n * m / 2; iter++) {\n\t\t\t\n\t\t\tArrays.fill(d, INF);\n\t\t\td[S] = 0;\n\t\t\t\n\t\t\tfor (int i = 0; i < n * m + 2; i++)\n\t\t\t\tset.add(Integers[i]);\n\t\t\t\n\t\t\twhile (!set.isEmpty()) {\n\t\t\t\tint v = set.pollFirst();\n\t\t\t\t\n\t\t\t\tfor (int i = 0; i < g[v].size(); i++) {\n\t\t\t\t\tEdge e = g[v].get(i);\n\t\t\t\t\tif (e.flow < e.cap) {\n\t\t\t\t\t\tint redCost = e.cost - pi[v] + pi[e.to];\n\t\t\t\t\t\tif (d[e.to] > d[v] + redCost) {\n\t\t\t\t\t\t\tset.remove(Integers[e.to]);\n\t\t\t\t\t\t\tfrom[e.to] = e; \n\t\t\t\t\t\t\td[e.to] = d[v] + redCost;\n\t\t\t\t\t\t\tset.add(Integers[e.to]);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tfor (int i = 0; i < n * m + 2; i++) {\n\t\t\t\tpi[i] -= d[i];\n\t\t\t}\n\t\t\t\n\t\t\tfor (int v = T; v != S; ) {\n\t\t\t\tEdge last = from[v];\n\t\t\t\tlast.flow++;\n\t\t\t\tlast.rev.flow--;\n\t\t\t\tans += last.cost;\n\t\t\t\tv = last.rev.to;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\t\n\t\tout.println(ans);\n\n\t}\n\n\tC() throws IOException {\n\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.close();\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew C();\n\t}\n\n\tString nextToken() {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (Exception e) {\n\t\t\t\teof = true;\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tString nextString() {\n\t\ttry {\n\t\t\treturn br.readLine();\n\t\t} catch (IOException e) {\n\t\t\teof = true;\n\t\t\treturn null;\n\t\t}\n\t}\n\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n}", "lang_cluster": "Java", "tags": ["flows"], "code_uid": "157d5d503647c5c11e453c323253fabf", "src_uid": "1f0e8bbd5bf4fcdea927fbb505a8949b", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\npublic class Abby3_C {\npublic static void main(String[] args)\n{\n Scanner input = new Scanner(System.in);\n int n = input.nextInt(), m = input.nextInt();\n int[][] data = new int[n][m];\n for(int i = 0; i<n; i++)\n for(int j = 0; j<m; j++)\n data[i][j] = input.nextInt();\n MinCostFlow mcf = new MinCostFlow(n*m+2);\n mcf.s = n*m;\n mcf.t = n*m+1;\n int[] di = new int[]{1, 0, -1, 0};\n int[] dj = new int[]{0, 1, 0, -1};\n for(int i = 0; i<n; i++)\n {\n for(int j = 0; j<m; j++)\n {\n if((i+j)%2 == 0)\n {\n mcf.add(mcf.s, i*m+j, 1, 0);\n for(int k = 0; k<4; k++)\n {\n int ni = i+di[k], nj = j+dj[k];\n if(ni<0||nj<0||ni>=n||nj>=m) continue;\n int cost = data[i][j] == data[ni][nj] ? 0 : 1;\n mcf.add(i*m+j, ni*m+nj, 1, cost);\n }\n }\n else\n {\n mcf.add(i*m+j, mcf.t, 1, 0);\n }\n }\n }\n System.out.println(mcf.minCostFlow()[1]);\n}\npublic static class MinCostFlow{\n int N, s,t;\n ArrayList<Edge>[] adj;\n final int oo = 987654321;\n boolean negCosts;\n int[] pi,dist;\n Edge[] prev;\n \n public MinCostFlow(int n){\n N = n;\n adj = new ArrayList[N];\n for(int i = 0; i < N; i++)\n adj[i] = new ArrayList<Edge>();\n pi = new int[N];\n prev = new Edge[N];\n dist = new int[N];\n }\n \n void add(int u, int v, int cap, int cost){\n Edge e = new Edge(u,v,cap,cost);\n negCosts |= (cost < 0);\n Edge r = new Edge(v,u,0,cap,-cost);\n e.rev = r;\n r.rev = e;\n adj[u].add(e);\n adj[v].add(r);\n }\n \n public boolean dijkstra(){\n Arrays.fill(prev, null);\n Arrays.fill(dist,oo);\n PriorityQueue<Pair> q = new PriorityQueue<Pair>();\n dist[s] = 0;\n q.add(new Pair(s,0));\n while(q.size() > 0){\n Pair p = q.poll();\n int cur = p.first, d = p.second;\n if(dist[cur] < d)\n continue;\n for(Edge e: adj[cur])\n if(e.resid > 0 && dist[e.v] > dist[cur] + e.pcost()){\n dist[e.v] = dist[cur] + e.pcost();\n prev[e.v] = e;\n q.add(new Pair(e.v, dist[e.v]));\n }\n }\n for(int i = 0; i < N; i++)\n if(pi[i] < oo)\n pi[i] += dist[i];\n return prev[t] != null;\n }\n \n public int[] minCostFlow(){\n int flow = 0, cost = 0;\n if(negCosts){\n Arrays.fill(dist,oo);\n dist[s] = 0;\n for(int k = 0; k < N-1; k++)\n for(int i = 0; i < N; i++)\n for(Edge e:adj[i])\n if(e.resid > 0 && dist[e.v] > dist[e.u] + e.cost)\n dist[e.v] = dist[e.u] + e.cost;\n for(int i = 0; i < N; i++)\n if(pi[i] < oo)\n pi[i] += dist[i];\n }\n while(dijkstra()){\n int f = Integer.MAX_VALUE/2;\n for(int cur = t; cur != s; cur = prev[cur].u)\n f = Math.min(f, prev[cur].resid);\n for(int cur = t; cur != s; cur = prev[cur].u){\n prev[cur].resid -= f;\n prev[cur].rev.resid += f;\n cost += prev[cur].cost * f;\n }\n flow += f;\n }\n return new int[]{flow,cost};\n }\n \n public class Edge{\n int u,v,resid,cap,cost;\n Edge rev;\n public Edge(int uu, int vv, int cp, int ct){\n u = uu;\n v = vv;\n resid = cap = cp;\n cost = ct;\n }\n public Edge(int uu, int vv, int rr, int cp, int ct){\n this(uu,vv,cp,ct);\n resid = rr;\n }\n int pcost(){\n return resid > 0?cost+pi[u]-pi[v]:0;\n }\n }\n public class Pair implements Comparable<Pair>{\n int first,second;\n public Pair(int ff, int ss){\n first = ff;\n second = ss;\n }\n public int compareTo(Pair p){\n return second-p.second;\n }\n public String toString(){\n return \"(\"+first +\", \"+second+\")\";\n }\n }\n}\n}\n", "lang_cluster": "Java", "tags": ["flows"], "code_uid": "91be0525fcb2e54c8d9da1caaa33fd81", "src_uid": "1f0e8bbd5bf4fcdea927fbb505a8949b", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.List;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.PriorityQueue;\nimport java.util.ArrayList;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.util.Queue;\nimport java.util.Collection;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskC2 solver = new TaskC2();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskC2 {\n\tstatic class Edge {\n\t\tint to, f, cap, cost, rev;\n\n\t\tEdge(int v, int cap, int cost, int rev) {\n\t\t\tthis.to = v;\n\t\t\tthis.cap = cap;\n\t\t\tthis.cost = cost;\n\t\t\tthis.rev = rev;\n\t\t}\n\t}\n\n\tpublic static List<Edge>[] createGraph(int n) {\n\t\tList<Edge>[] graph = new List[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tgraph[i] = new ArrayList<Edge>();\n\t\treturn graph;\n\t}\n\n\tpublic static void addEdge(List<Edge>[] graph, int s, int t, int cap, int cost) {\n\t\tgraph[s].add(new Edge(t, cap, cost, graph[t].size()));\n\t\tgraph[t].add(new Edge(s, 0, -cost, graph[s].size() - 1));\n\t}\n\n\tstatic void bellmanFord(List<Edge>[] graph, int s, int[] dist) {\n\t\tint n = graph.length;\n\t\tArrays.fill(dist, 0, n, Integer.MAX_VALUE);\n\t\tdist[s] = 0;\n\t\tboolean[] inqueue = new boolean[n];\n\t\tint[] q = new int[n];\n\t\tint qt = 0;\n\t\tq[qt++] = s;\n\t\tfor (int qh = 0; (qh - qt) % n != 0; qh++) {\n\t\t\tint u = q[qh % n];\n\t\t\tinqueue[u] = false;\n\t\t\tfor (int i = 0; i < (int) graph[u].size(); i++) {\n\t\t\t\tEdge e = graph[u].get(i);\n\t\t\t\tif (e.cap <= e.f)\n\t\t\t\t\tcontinue;\n\t\t\t\tint v = e.to;\n\t\t\t\tint ndist = dist[u] + e.cost;\n\t\t\t\tif (dist[v] > ndist) {\n\t\t\t\t\tdist[v] = ndist;\n\t\t\t\t\tif (!inqueue[v]) {\n\t\t\t\t\t\tinqueue[v] = true;\n\t\t\t\t\t\tq[qt++ % n] = v;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tstatic int[] minCostFlow(List<Edge>[] graph, int s, int t, int maxf) {\n\t\tint n = graph.length;\n\t\tint[] prio = new int[n];\n\t\tint[] curflow = new int[n];\n\t\tint[] prevedge = new int[n];\n\t\tint[] prevnode = new int[n];\n\t\tint[] pot = new int[n];\n\n\t\t// bellmanFord can be safely commented if edges costs are non-negative\n\t\tbellmanFord(graph, s, pot);\n\t\tint flow = 0;\n\t\tint flowCost = 0;\n\t\twhile (flow < maxf) {\n\t\t\tQueue<Long> q = new PriorityQueue<Long>();\n\t\t\tq.add((long) s);\n\t\t\tArrays.fill(prio, 0, n, Integer.MAX_VALUE);\n\t\t\tprio[s] = 0;\n\t\t\tcurflow[s] = Integer.MAX_VALUE;\n\t\t\twhile (!q.isEmpty()) {\n\t\t\t\tlong cur = q.remove();\n\t\t\t\tint d = (int) (cur >>> 32);\n\t\t\t\tint u = (int) (cur & 0x7FFFFFFF);\n\t\t\t\tif (d != prio[u])\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (int i = 0; i < graph[u].size(); i++) {\n\t\t\t\t\tEdge e = graph[u].get(i);\n\t\t\t\t\tint v = e.to;\n\t\t\t\t\tif (e.cap <= e.f)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tint nprio = prio[u] + e.cost + pot[u] - pot[v];\n\t\t\t\t\tif (prio[v] > nprio) {\n\t\t\t\t\t\tprio[v] = nprio;\n\t\t\t\t\t\tq.add(((long) nprio << 32) + v);\n\t\t\t\t\t\tprevnode[v] = u;\n\t\t\t\t\t\tprevedge[v] = i;\n\t\t\t\t\t\tcurflow[v] = Math.min(curflow[u], e.cap - e.f);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (prio[t] == Integer.MAX_VALUE)\n\t\t\t\tbreak;\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tpot[i] += prio[i];\n\t\t\tint df = Math.min(curflow[t], maxf - flow);\n\t\t\tflow += df;\n\t\t\tfor (int v = t; v != s; v = prevnode[v]) {\n\t\t\t\tEdge e = graph[prevnode[v]].get(prevedge[v]);\n\t\t\t\te.f += df;\n\t\t\t\tgraph[v].get(e.rev).f -= df;\n\t\t\t\tflowCost += df * e.cost;\n\t\t\t}\n\t\t}\n\t\treturn new int[]{flow, flowCost};\n\t}\n\n\tpublic void solve(int testNumber, InputReader in, PrintWriter out) {\n\t\tint n = in.nextInt();\n\t\tint m = in.nextInt();\n\t\tint[][] a = new int[n][m];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\ta[i][j] = in.nextInt();\n\t\t\t}\n\t\t}\n\n\t\tfinal List<Edge>[] g = createGraph(n * m + 2);\n\t\tint s = n * m;\n\t\tint t = s + 1;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tif ((i + j) % 2 == 1) {\n\t\t\t\t\taddEdge(g, s, i * m + j, 1, 0);\n\t\t\t\t\tint dx[] = {1, -1, 0, 0};\n\t\t\t\t\tint dy[] = {0, 0, 1, -1};\n\t\t\t\t\tfor (int k = 0; k < 4; k++) {\n\t\t\t\t\t\tint ni = i + dx[k];\n\t\t\t\t\t\tint nj = j + dy[k];\n\n\t\t\t\t\t\tif (0 <= ni && ni < n && 0 <= nj && nj < m) {\n\t\t\t\t\t\t\taddEdge(g, i * m + j, ni * m + nj, 1, a[i][j] != a[ni][nj] ? 1 : 0);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\taddEdge(g, i * m + j, t, 1, 0);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint[] res = minCostFlow(g, s, t, Integer.MAX_VALUE);\n\t\tint flow = res[0];\n\t\tint flowCost = res[1];\n\t\tout.println(flowCost);\n\t}\n}\n\nclass InputReader {\n\tpublic BufferedReader reader;\n\tpublic StringTokenizer tokenizer;\n\n\tpublic InputReader(InputStream stream) {\n\t\treader = new BufferedReader(new InputStreamReader(stream));\n\t}\n\n\tpublic String next() {\n\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\t}\n\t\treturn tokenizer.nextToken();\n\t}\n\n\tpublic int nextInt() {\n\t\treturn Integer.parseInt(next());\n\t}\n}\n\n", "lang_cluster": "Java", "tags": ["flows"], "code_uid": "3ea8f862ec517e5fef4a9e9bea2e9aea", "src_uid": "1f0e8bbd5bf4fcdea927fbb505a8949b", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main implements Runnable {\n\n\tpublic void _main() throws IOException {\n\t\tint height = nextInt();\n\t\tint width = nextInt();\n\t\tint[][] a = new int[height][width];\n\t\tfor (int r = 0; r < height; r++) {\n\t\t\tfor (int c = 0; c < width; c++) {\n\t\t\t\ta[r][c] = nextInt();\n\t\t\t}\n\t\t}\n\t\tGraph g = new Graph(height * width + 2);\n\t\tfor (int r = 0; r < height; r++) {\n\t\t\tfor (int c = 0; c < width; c++) {\n\t\t\t\tif ((r + c) % 2 == 0) {\n\t\t\t\t\tg.addEdge(g.s, r * width + c, 1, 0, -1);\n\t\t\t\t} else {\n\t\t\t\t\tg.addEdge(r * width + c, g.t, 1, 0, -1);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tfor (int dr = -1; dr <= 1; dr++) {\n\t\t\t\t\tfor (int dc = -1; dc <= 1; dc++) {\n\t\t\t\t\t\tif (dr == 0 ^ dc == 0) {\n\t\t\t\t\t\t\tint nr = r + dr;\n\t\t\t\t\t\t\tint nc = c + dc;\n\t\t\t\t\t\t\tif (nr < 0 || nr >= height || nc < 0 || nc >= width) continue;\n\t\t\t\t\t\t\tint cost = a[r][c] == a[nr][nc] ? 0 : 1;\n\t\t\t\t\t\t\tg.addEdge(r * width + c, nr * width + nc, 1, cost, -1);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tout.println(g.minCostFlow());\n\t}\n\n\tclass Graph {\n\t\tfinal int infinity = 1500000000;\n\t\tint n, s, t;\n\t\t\n\t\tfinal int N = 80 * 80 + 100;\n\t\tfinal int M = 8 * N;\n\t\tint[] firstEdge = new int[N];\n\t\t{\n\t\t\tArrays.fill(firstEdge, -1);\n\t\t}\n\t\tint[] edgeFrom = new int[M];\n\t\tint[] edgeTo = new int[M];\n\t\tint[] edgeCap = new int[M];\n\t\tint[] edgeCost = new int[M];\n\t\tint[] edgeFlow = new int[M];\n\t\tint[] nextEdge = new int[M];\n\t\tint[] edgeId = new int[M];\n\t\tint numEdges;\n\t\t\n\t\tint[] heap = new int[N];\n\t\tint[] heapWhere = new int[N];\n\t\tint[] dist = new int[N];\n\t\tint heapSize;\n\n\t\tint[] prev = new int[N];\n\t\tint[] phi = new int[N];\n\n\t\tGraph(int n) {\n\t\t\tthis.n = n;\n\t\t\ts = n - 1;\n\t\t\tt = n - 2;\t\t\t\n\t\t}\n\t\tvoid addEdge(int from, int to, int cap, int cost, int id) {\n\t\t\tint e;\n\t\t\t\n\t\t\te = numEdges++;\n\t\t\tnextEdge[e] = firstEdge[from];\n\t\t\tfirstEdge[from] = e;\n\t\t\tedgeFrom[e] = from;\n\t\t\tedgeTo[e] = to;\n\t\t\tedgeCap[e] = cap;\n\t\t\tedgeCost[e] = cost;\n\t\t\tedgeId[e] = id;\n\t\t\t\n\t\t\te = numEdges++;\n\t\t\tnextEdge[e] = firstEdge[to];\n\t\t\tfirstEdge[to] = e;\n\t\t\tedgeFrom[e] = to;\n\t\t\tedgeTo[e] = from;\n\t\t\tedgeCap[e] = 0;\n\t\t\tedgeCost[e] = -cost;\n\t\t\tedgeId[e] = id;\n\t\t}\n\t\tint minCostFlow() {\t\t\t\n\t\t\t/*\n\t\t\tfor (int step = 0; step < n - 1; step++) {\n\t\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\t\tfor (int e = firstEdge[i]; e >= 0; e = nextEdge[e]) {\n\t\t\t\t\t\tint j = edgeTo[e];\n\t\t\t\t\t\tif (phi[j] > phi[i] + edgeCost[e]) {\n\t\t\t\t\t\t\tphi[j] = phi[i] + edgeCost[e];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t*/\n\t\t\tint flow = 0;\n\t\t\tint flowCost = 0;\n\t\t\tArrays.fill(heapWhere, 0, n, -1);\t\t\t\n\t\t\twhile (true) {\t\t\t\t\n\t\t\t\tArrays.fill(prev, 0, n, -1);\n\t\t\t\tArrays.fill(dist, 0, n, infinity);\n\t\t\t\tdist[s] = 0;\n\t\t\t\theapSize = 1;\n\t\t\t\theapWhere[s] = 0;\n\t\t\t\theap[0] = s;\n\t\t\t\twhile (heapSize > 0) {\n\t\t\t\t\tint v = heap[0];\t\t\t\t\t\n\t\t\t\t\tif (heapSize > 1) {\n\t\t\t\t\t\theapSwap(0, heapSize - 1);\n\t\t\t\t\t\t--heapSize;\n\t\t\t\t\t\theapWhere[v] = -1;\n\t\t\t\t\t\theapDown(0);\n\t\t\t\t\t} else {\n\t\t\t\t\t\t--heapSize;\n\t\t\t\t\t\theapWhere[v] = -1;\n\t\t\t\t\t}\n\t\t\t\t\tfor (int e = firstEdge[v]; e >= 0; e = nextEdge[e]) {\n\t\t\t\t\t\tif (edgeFlow[e] >= edgeCap[e]) continue;\n\t\t\t\t\t\tint u = edgeTo[e];\n\t\t\t\t\t\tif (dist[u] > dist[v] + edgeCost[e] + phi[v] - phi[u]) {\n\t\t\t\t\t\t\tdist[u] = dist[v] + edgeCost[e] + phi[v] - phi[u];\n\t\t\t\t\t\t\tprev[u] = e;\n\t\t\t\t\t\t\tif (heapWhere[u] < 0) {\n\t\t\t\t\t\t\t\theapWhere[u] = heapSize++;\n\t\t\t\t\t\t\t\theap[heapSize - 1] = u;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\theapUp(heapWhere[u]);\n\t\t\t\t\t\t\theapDown(heapWhere[u]);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (prev[t] < 0) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\t\t\t\t\n\t\t\t\tint dCost = dist[t] + phi[t] - phi[s];\n\t\t\t\tint v = t;\t\t\t\t\n\t\t\t\twhile (v != s) {\n\t\t\t\t\tint e = prev[v];\n\t\t\t\t\t++edgeFlow[e];\n\t\t\t\t\t--edgeFlow[e ^ 1];\n\t\t\t\t\tv = edgeFrom[e];\n\t\t\t\t}\n\t\t\t\t++flow;\n\t\t\t\tflowCost += dCost;\n\t\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\t\tif (dist[i] < infinity) {\n\t\t\t\t\t\tphi[i] += dist[i];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn flowCost;\n\t\t}\n\t\tprivate void heapUp(int i) {\n\t\t\twhile (i > 0) {\n\t\t\t\tint p = (i - 1) / 2;\n\t\t\t\tif (dist[i] < dist[p]) {\n\t\t\t\t\theapSwap(i, p);\n\t\t\t\t\ti = p;\n\t\t\t\t} else {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprivate void heapDown(int i) {\n\t\t\twhile (true) {\n\t\t\t\tint j = i;\n\t\t\t\tif (2*i + 1 < heapSize && dist[2*i + 1] < dist[j]) {\n\t\t\t\t\tj = 2*i + 1;\n\t\t\t\t}\n\t\t\t\tif (2*i + 2 < heapSize && dist[2*i + 2] < dist[j]) {\n\t\t\t\t\tj = 2*i + 2;\n\t\t\t\t}\n\t\t\t\tif (i == j) {\n\t\t\t\t\tbreak;\n\t\t\t\t} else {\n\t\t\t\t\theapSwap(i, j);\n\t\t\t\t\ti = j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprivate void heapSwap(int i, int j) {\n\t\t\tint ai = heap[i];\n\t\t\tint aj = heap[j];\n\t\t\theapWhere[ai] = j;\n\t\t\theapWhere[aj] = i;\n\t\t\theap[i] = aj;\n\t\t\theap[j] = ai;\n\t\t}\n\n\t}\n\n\n\tprivate BufferedReader in;\n\tprivate PrintWriter out;\n\tprivate StringTokenizer st;\n\n\tprivate String next() throws IOException {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\tString rl = in.readLine();\n\t\t\tif (rl == null)\n\t\t\t\treturn null;\n\t\t\tst = new StringTokenizer(rl);\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tprivate int nextInt() throws IOException {\n\t\treturn Integer.parseInt(next());\n\t}\n\n\tprivate long nextLong() throws IOException {\n\t\treturn Long.parseLong(next());\n\t}\n\n\tprivate double nextDouble() throws IOException {\n\t\treturn Double.parseDouble(next());\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tLocale.setDefault(Locale.UK);\n\t\tnew Thread(new Main()).start();\n\t}\n\n\tpublic void run() {\n\t\ttry {\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(System.out);\n\t\t\t//in = new BufferedReader(new FileReader(\"a.in\"));\n\t\t\t//out = new PrintWriter(new FileWriter(\"a.out\"));\n\n\t\t\t_main();\n\n\t\t\tout.close();\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(202);\n\t\t}\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["flows"], "code_uid": "479fe2144b12b79a45ab71f18fa884e0", "src_uid": "1f0e8bbd5bf4fcdea927fbb505a8949b", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "//package abbyy3;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class C {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t\tint n = ni(), m = ni();\n\t\tint[][] map = new int[n][m];\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tfor(int j = 0;j < m;j++){\n\t\t\t\tmap[i][j] = ni();\n\t\t\t}\n\t\t}\n\t\t\n\t\tint[][] dp = new int[n][1<<m];\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tArrays.fill(dp[i], -99999);\n\t\t}\n\t\tdp[0] = makeRow(map[0]);\n\t\tfor(int i = 1;i < n;i++){\n\t\t\tint[] row = makeRow(map[i]);\n\t\t\tfor(int j = 0;j < 1<<m;j++){\n\t\t\t\tfor(int k = 0;k < 1<<m;k++){ // k->j\n\t\t\t\t\tint inv = (~k&(1<<m)-1);\n\t\t\t\t\tif((inv&j) == inv){\n\t\t\t\t\t\tint nex = row[j^inv] + dp[i-1][k];\n\t\t\t\t\t\tfor(int l = 0;l < m;l++){\n\t\t\t\t\t\t\tif(inv<<31-l<0 && map[i-1][l] == map[i][l]){\n\t\t\t\t\t\t\t\tnex++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdp[i][j] = Math.max(dp[i][j], nex);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tout.println(n*m/2-dp[n-1][(1<<m)-1]);\n\t}\n\t\n\tint[] makeRow(int[] r)\n\t{\n\t\tint m = r.length;\n\t\tint[] row = new int[1<<m];\n\t\tArrays.fill(row, -99999);\n\t\trow[0] = 0;\n\t\tfor(int i = 0;i < 1<<m;i++){\n\t\t\tfor(int j = 3, k = 0;j < 1<<m;j*=2, k++){\n\t\t\t\tif((i&j) == j){\n\t\t\t\t\tif(row[i^j] != -99999){\n\t\t\t\t\t\trow[i] = row[i^j] + (r[k] == r[k+1] ? 1 : 0);\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn row;\n\t}\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new C().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tprivate int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["flows"], "code_uid": "eae60f3e20b31405459086d5f22c2227", "src_uid": "1f0e8bbd5bf4fcdea927fbb505a8949b", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class C {\n\n\tstatic void solve() throws IOException {\n\t\tint n = nextInt(), m = nextInt();\n\t\tint[][] what = new int[n][m];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\twhat[i][j] = nextInt();\n\t\t\t}\n\t\t}\n\t\tGraph g = new Graph(n * m + 2);\n\t\tint[] dx = { 0, 0, 1, -1 };\n\t\tint[] dy = { 1, -1, 0, 0 };\n\t\tint start = n * m;\n\t\tint finish = n * m + 1;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tint from = i * m + j;\n\t\t\t\tif (((i ^ j) & 1) != 0) {\n\t\t\t\t\tg.addEdge(from, finish, 1, 0);\n\t\t\t\t\tcontinue;\n\t\t\t\t} else {\n\t\t\t\t\tg.addEdge(start, from, 1, 0);\n\t\t\t\t}\n\t\t\t\tfor (int dir = 0; dir < 4; dir++) {\n\t\t\t\t\tint ni = i + dx[dir];\n\t\t\t\t\tint nj = j + dy[dir];\n\t\t\t\t\tif (ni < 0 || ni >= n || nj < 0 || nj >= m) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tint to = ni * m + nj;\n\t\t\t\t\tint cost = 1;\n\t\t\t\t\tif (what[i][j] == what[ni][nj]) {\n\t\t\t\t\t\tcost = 0;\n\t\t\t\t\t}\n\t\t\t\t\tg.addEdge(from, to, 1, cost);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tlong cost = g.minCostFlow(start, finish)[1];\n\t\tout.println(cost);\n\t}\n\n\tpublic static class QItem implements Comparable<QItem> {\n\t\tlong d;\n\t\tint v;\n\n\t\tpublic QItem(long d, int v) {\n\t\t\tthis.d = d;\n\t\t\tthis.v = v;\n\t\t}\n\n\t\tpublic int compareTo(QItem q) {\n\t\t\treturn d < q.d ? -1 : d > q.d ? 1 : 0;\n\t\t}\n\t}\n\n\tpublic static class Graph {\n\t\tpublic final int n;\n\t\tpublic List<Edge>[] edges;\n\n\t\t@SuppressWarnings(\"unchecked\")\n\t\tpublic Graph(int n) {\n\t\t\tthis.n = n;\n\t\t\tedges = new List[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tedges[i] = new ArrayList<Edge>();\n\t\t\t}\n\t\t}\n\n\t\tpublic void addEdge(int u, int v, int cap, int cost) {\n\t\t\tEdge e1 = new Edge(v, cap, cost);\n\t\t\tEdge e2 = new Edge(u, 0, -cost);\n\t\t\te1.rev = e2;\n\t\t\te2.rev = e1;\n\t\t\tedges[u].add(e1);\n\t\t\tedges[v].add(e2);\n\t\t}\n\n\t\tpublic void addUndirectedEdge(int u, int v, int cap, int cost) {\n\t\t\tEdge e1 = new Edge(v, cap, cost);\n\t\t\tEdge e2 = new Edge(u, cap, -cost);\n\t\t\te1.rev = e2;\n\t\t\te2.rev = e1;\n\t\t\tedges[u].add(e1);\n\t\t\tedges[v].add(e2);\n\t\t}\n\n\t\tpublic void clearFlow() {\n\t\t\tfor (List<Edge> edgesList : edges) {\n\t\t\t\tfor (Edge e : edgesList) {\n\t\t\t\t\te.flow = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// input: s - source, t - sink\n\t\t// output: maximum flow and minimum cost\n\t\tpublic long[] minCostFlow(int s, int t) {\n\t\t\tfinal long INF = 1L << 50;\n\t\t\tlong flow = 0;\n\t\t\tlong flowCost = 0;\n\t\t\tlong[] u = new long[n];\n\t\t\twhile (true) {\n\t\t\t\tQueue<QItem> q = new PriorityQueue<QItem>();\n\t\t\t\tq.add(new QItem(0, s));\n\t\t\t\tEdge[] p = new Edge[n];\n\t\t\t\tlong[] d = new long[n];\n\t\t\t\tArrays.fill(d, INF);\n\t\t\t\td[s] = 0;\n\t\t\t\twhile (!q.isEmpty()) {\n\t\t\t\t\tQItem cur = q.poll();\n\t\t\t\t\tif (cur.d != d[cur.v]) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tfor (Edge e : edges[cur.v]) {\n\t\t\t\t\t\tlong nd = d[cur.v] + e.cost + u[cur.v] - u[e.to];\n\t\t\t\t\t\tif (e.cap > e.flow && d[e.to] > nd) {\n\t\t\t\t\t\t\td[e.to] = nd;\n\t\t\t\t\t\t\tp[e.to] = e;\n\t\t\t\t\t\t\tq.add(new QItem(nd, e.to));\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (p[t] == null) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\t\tif (p[i] != null) {\n\t\t\t\t\t\tu[i] += d[i];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tint min = Integer.MAX_VALUE;\n\t\t\t\tfor (Edge e = p[t]; e != null; e = p[e.rev.to]) {\n\t\t\t\t\tmin = Math.min(min, e.cap - e.flow);\n\t\t\t\t}\n\n\t\t\t\tflow += min;\n\t\t\t\tfor (Edge e = p[t]; e != null; e = p[e.rev.to]) {\n\t\t\t\t\te.flow += min;\n\t\t\t\t\te.rev.flow -= min;\n\t\t\t\t\tflowCost += (long) min * e.cost;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn new long[] { flow, flowCost };\n\t\t}\n\t}\n\n\tpublic static class Edge {\n\t\tpublic int to, cap, flow, cost;\n\t\tpublic Edge rev;\n\n\t\tpublic Edge(int to, int cap, int cost) {\n\t\t\tthis.to = to;\n\t\t\tthis.cap = cap;\n\t\t\tthis.cost = cost;\n\t\t}\n\t}\n\n\tstatic BufferedReader br;\n\tstatic StringTokenizer st;\n\tstatic PrintWriter out;\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tInputStream input = System.in;\n\t\tPrintStream output = System.out;\n\t\tFile file = new File(\"c.in\");\n\t\tif (file.exists() && file.canRead()) {\n\t\t\tinput = new FileInputStream(file);\n\t\t}\n\t\tbr = new BufferedReader(new InputStreamReader(input));\n\t\tout = new PrintWriter(output);\n\t\tsolve();\n\t\tout.close();\n\t}\n\n\tstatic long nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tstatic double nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n\n\tstatic int nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tstatic String nextToken() throws IOException {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\tString line = br.readLine();\n\t\t\tif (line == null) {\n\t\t\t\treturn null;\n\t\t\t}\n\t\t\tst = new StringTokenizer(line);\n\t\t}\n\t\treturn st.nextToken();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["flows"], "code_uid": "fffa3b10a713babd447188e799c6f9a6", "src_uid": "1f0e8bbd5bf4fcdea927fbb505a8949b", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\n\npublic class A {\n\tstatic int[] dx = {0,0,1,-1};\n\tstatic int[] dy = {1,-1,0,0};\n\tstatic int N,M;\n\tpublic static void main(String[] args) {\n\t\tMScanner sc = new MScanner();\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tN = sc.nextInt();\n\t\tM = sc.nextInt();\n\t\tint[][] grid = sc.nextInt(N,M);\n\t\tint NM = N*M;\n\t\tMinCostFlow MCF = new MinCostFlow(NM);\n\t\tint pos = 0;\n\t\tfor(int a=0;a<N;a++){\n\t\t\tfor(int b=0;b<M;b++){\n\t\t\t\tif((a+b)%2==0){\n\t\t\t\t\tMCF.add(MCF.s, pos, 1, 0);\n\t\t\t\t\tfor(int d=0;d<4;d++){\n\t\t\t\t\t\tint ny = dy[d]+a;\n\t\t\t\t\t\tint nx = dx[d]+b;\n\t\t\t\t\t\tif(ny<0||ny>=N||nx<0||nx>=M)\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\tif(grid[a][b]==grid[ny][nx])MCF.add(pos, magic(ny,nx), 1, 0);\n\t\t\t\t\t\telse MCF.add(pos, magic(ny,nx), 1, 1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse if((a+b)%2==1)MCF.add(pos, MCF.t, 1, 0);\n\t\t\t\tpos++;\n\t\t\t}\n\t\t}\n\t\tout.println(MCF.getFlow()[1]);\n\t\tout.close();\n\t}\n\t\n\tprivate static int magic(int ny, int nx) {\n\t\treturn ny*M + nx;\n\t}\n\n\tstatic class MinCostFlow {\n\t\t public static int MINCOSTFLOW = 0, MINCOSTMAXFLOW = 1;\n\t\t public int s, t;\n\t\t int N, ss, tt;\n\t\t public long oo = (long) 1e12;\n\t\t long[] ex;\n\t\t ArrayList<Edge>[] adjj;\n\t\t public Edge[][] adj;\n\n\t\t public MinCostFlow(int NN) {\n\t\t this(NN, MINCOSTMAXFLOW);\n\t\t }\n\n\t\t public MinCostFlow(int NN, int flowType) {\n\t\t N = (tt = (ss = (t = (s = NN) + 1) + 1) + 1) + 1;\n\t\t adj = new Edge[N][0];\n\t\t adjj = new ArrayList[N];\n\t\t for (int i = 0; i < N; i++)\n\t\t adjj[i] = new ArrayList<Edge>();\n\t\t ex = new long[N];\n\t\t add(t, s, oo, -oo / 10 * flowType);\n\t\t }\n\n\t\t public void add(int i, int j, long cap, long cost) {\n\t\t Edge fwd = new Edge(i, j, cap, 0, cost);\n\t\t Edge rev = new Edge(j, i, 0, 0, -cost);\n\t\t adjj[i].add(rev.rev = fwd);\n\t\t adjj[j].add(fwd.rev = rev);\n\t\t }\n\n\t\t public long[] getFlow() {\n\t\t preFlow();\n\t\t for (int i = 0; i < N; i++)\n\t\t adj[i] = adjj[i].toArray(adj[i]);\n\t\t boolean[] canU = new boolean[N], hasU = new boolean[N];\n\t\t long[] dist = new long[N], width = new long[N];\n\t\t Edge[] prev = new Edge[N];\n\t\t while (true) {\n\t\t Arrays.fill(dist, oo);\n\t\t dist[ss] = 0;\n\t\t width[ss] = oo;\n\t\t boolean updated = hasU[ss] = true;\n\t\t while (updated) {\n\t\t updated = false;\n\t\t for (int i = 0; i < N; hasU[i++] = false)\n\t\t canU[i] = hasU[i];\n\t\t for (int i = 0; i < N; i++)\n\t\t if (canU[i])\n\t\t for (Edge e : adj[i])\n\t\t if (e.flow != e.cap && dist[e.j] > dist[e.i] + e.cost) {\n\t\t dist[e.j] = dist[e.i] + (prev[e.j] = e).cost;\n\t\t width[e.j] = Math.min(width[e.i], e.cap - e.flow);\n\t\t hasU[e.j] = updated = true;\n\t\t }\n\t\t }\n\t\t if (dist[tt] >= oo)\n\t\t break;\n\t\t for (Edge e = prev[tt]; e != null; e = prev[e.i])\n\t\t e.rev.flow = -(e.flow += width[tt]);\n\t\t }\n\t\t long flow = 0, cost = 0;\n\t\t for (Edge e : adj[s])\n\t\t if (e.flow > 0)\n\t\t flow += e.flow;\n\t\t for (int i = 0; i < N; i++)\n\t\t for (Edge e : adj[i])\n\t\t if (e.flow > 0 && e.i != t && e.j != s && e.i < ss && e.j < ss)\n\t\t cost += e.flow * e.cost;\n\t\t return new long[] { flow, cost };\n\t\t }\n\n\t\t public void preFlow() {\n\t\t for (int i = 0; i < N; i++)\n\t\t for (Edge e : adjj[i])\n\t\t if (e.cost < 0 && e.cap - e.flow > 0) {\n\t\t ex[e.i] -= e.cap - e.flow;\n\t\t ex[e.j] += e.cap - e.flow;\n\t\t e.rev.flow = -(e.flow = e.cap);\n\t\t }\n\t\t for (int i = 0; i < N; i++)\n\t\t if (ex[i] > 0)\n\t\t add(ss, i, ex[i], -oo);\n\t\t else if (ex[i] < 0)\n\t\t add(i, tt, -ex[i], -oo);\n\t\t Arrays.fill(ex, 0);\n\t\t }\n\n\t\t public class Edge {\n\t\t public int i, j;\n\t\t public long cap, flow, cost;\n\t\t Edge rev;\n\n\t\t Edge(int ii, int jj, long cc, long ff, long C) {\n\t\t i = ii;\n\t\t j = jj;\n\t\t cap = cc;\n\t\t flow = ff;\n\t\t cost = C;\n\t\t }\n\t\t }\n\t\t}\n\n\tstatic class MScanner{\n\t\tprivate InputStream stream;\n\t\tprivate byte[] buf = new byte[1024];\n\t\tprivate int curChar;\n\t\tprivate int numChars;\n\t\t\n\t\tpublic MScanner(){\n\t\t\tstream = System.in;\n\t\t\t//stream = new FileInputStream(new File(\"dec.in\"));\n\n\t\t}\n\t\tint read(){\n\t\t\tif(numChars==-1)\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tif(curChar>=numChars){\n\t\t\t\tcurChar = 0;\n\t\t\t\ttry{\n\t\t\t\t\tnumChars = stream.read(buf);\n\t\t\t\t} catch (IOException e){\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif(numChars <= 0)\n\t\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn buf[curChar++];\n\t\t}\n\t\t\n\t\tboolean isSpaceChar(int c){\n\t\t\treturn c==' '||c=='\\n'||c=='\\r'||c=='\\t'||c==-1;\n\t\t}\n\t\tboolean isEndline(int c){\n\t\t\treturn c=='\\n'||c=='\\r'||c==-1;\n\t\t}\n\t\tint nextInt(){\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\tint[] nextInt(int N){\n\t\t\tint[] ret = new int[N];\n\t\t\tfor(int a=0;a<N;a++)\n\t\t\t\tret[a] = nextInt();\n\t\t\treturn ret;\n\t\t}\n\t\tint[][] nextInt(int N, int M){\n\t\t\tint[][] ret = new int[N][M];\n\t\t\tfor(int a=0;a<N;a++)\n\t\t\t\tret[a] = nextInt(M);\n\t\t\treturn ret;\n\t\t}\n\t\tlong nextLong(){\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\tlong[] nextLong(int N){\n\t\t\tlong[] ret = new long[N];\n\t\t\tfor(int a=0;a<N;a++)\n\t\t\t\tret[a] = nextLong();\n\t\t\treturn ret;\n\t\t}\n\t\tdouble nextDouble(){\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t\tdouble[] nextDouble(int N){\n\t\t\tdouble[] ret = new double[N];\n\t\t\tfor(int a=0;a<N;a++)\n\t\t\t\tret[a] = nextDouble();\n\t\t\treturn ret;\n\t\t}\n\t\tString next(){\n\t\t\tint c = read();\n\t\t\twhile(isSpaceChar(c))\n\t\t\t\tc=read();\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo{\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc=read();\n\t\t\t} while(!isSpaceChar(c));\n\t\t\treturn res.toString();\n\t\t}\n\t\tString[] next(int N){\n\t\t\tString[] ret = new String[N];\n\t\t\tfor(int a=0;a<N;a++)\n\t\t\t\tret[a] = next();\n\t\t\treturn ret;\n\t\t}\n\t\tString nextLine(){\n\t\t\tint c = read();\n\t\t\twhile(isEndline(c))\n\t\t\t\tc=read();\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo{\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t}while(!isEndline(c));\n\t\t\treturn res.toString();\n\t\t}\n\t\tString[] nextLine(int N){\n\t\t\tString[] ret = new String[N];\n\t\t\tfor(int a=0;a<N;a++)\n\t\t\t\tret[a] = nextLine();\n\t\t\treturn ret;\n\t\t}\n\t\t\n\t}\n}\n", "lang_cluster": "Java", "tags": ["flows"], "code_uid": "c9690b8f66d703c253d807451348a629", "src_uid": "1f0e8bbd5bf4fcdea927fbb505a8949b", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.math.BigDecimal;\nimport java.util.Scanner;\n\npublic class Main {\n static BigDecimal pow(BigDecimal a, BigDecimal b) {\n double bDouble = b.doubleValue();\n int integerPortion = (int) bDouble;\n double fractionalPortion = bDouble - integerPortion;\n BigDecimal aToIntegerPortion = a.pow(integerPortion);\n BigDecimal aToFractionalPortion = new BigDecimal(Math.pow(a.doubleValue(), fractionalPortion));\n return aToIntegerPortion.multiply(aToFractionalPortion);\n }\n \n static BigDecimal log(BigDecimal value) {\n return new BigDecimal(Math.log(value.doubleValue()));\n }\n \n public static void main (String[] args) {\n Scanner sc = new Scanner(System.in);\n BigDecimal x = new BigDecimal(sc.next());\n BigDecimal y = new BigDecimal(sc.next());\n BigDecimal z = new BigDecimal(sc.next());\n sc.close();\n \n BigDecimal[] logValues = {\n pow(y, z).multiply(log(x)),\n pow(z, y).multiply(log(x)),\n z.multiply(y).multiply(log(x)),\n y.multiply(z).multiply(log(x)),\n pow(x, z).multiply(log(y)),\n pow(z, x).multiply(log(y)),\n z.multiply(x).multiply(log(y)),\n x.multiply(z).multiply(log(y)),\n pow(x, y).multiply(log(z)),\n pow(y, x).multiply(log(z)),\n y.multiply(x).multiply(log(z)),\n x.multiply(y).multiply(log(z))\n };\n \n int greatestIndex = 0;\n for (int i = 1; i < logValues.length; i++) {\n if (logValues[i].compareTo(logValues[greatestIndex]) > 0) greatestIndex = i;\n }\n \n String[] valueRepresentations = {\n \"x^y^z\",\n \"x^z^y\",\n \"(x^y)^z\",\n \"(x^z)^y\",\n \"y^x^z\",\n \"y^z^x\",\n \"(y^x)^z\",\n \"(y^z)^x\",\n \"z^x^y\",\n \"z^y^x\",\n \"(z^x)^y\",\n \"(z^y)^x\"\n };\n \n System.out.print(valueRepresentations[greatestIndex]);\n }\n}\n\n ", "lang_cluster": "Java", "tags": ["brute force", "math", "constructive algorithms"], "code_uid": "73e3fb82a64a5db41de59fac6559e849", "src_uid": "a71cb5cda754ad2bf479bc3b0164fc4c", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// package QS.AA.NetworkFlow;\n\n// B. Help General\n// https://codeforces.com/problemset/problem/142/B\nimport java.util.*;\nimport java.io.*;\n\npublic class CF_142B {\n\tpublic static void main(String[] args) throws IOException {\n\t\tjava.io.BufferedReader br = new java.io.BufferedReader(new java.io.InputStreamReader(System.in));\n\t\tString[] tokens = br.readLine().trim().split(\"\\\\s\");\n\t\tint n = Integer.parseInt(tokens[0]);\n\t\tint m = Integer.parseInt(tokens[1]);\n\t\tif (n > m) {int temp = n; n = m; m = temp;}\n\t\tint ans = 0;\n\t\tif (n == 1 || m == 1) {\n\t\t\tans = m * n;\n\t\t} else if (n == 2 && m >= 2) {\n\t\t\tans = m - (m % 4) + Math.min(m % 4, 2) * 2;\n\t\t} else {\n\t\t\tans = (m * n + 1) / 2;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}", "lang_cluster": "Java", "tags": ["greedy", "constructive algorithms", "implementation"], "code_uid": "9547f6b1b3eab719d45e4d4ef643fe43", "src_uid": "e858e7f22d91aaadd7a48a174d7b2dc9", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\nimport java.util.Arrays;\nimport java.util.*;\nimport java.lang.*;\n\npublic class Code {\n\n\tpublic static void main(String[] args) {\n\t\tScanner cin = new Scanner(System.in);\n\t\tArrayList<Integer> list = new ArrayList<>();\n\t\tHashSet<Integer> hash = new HashSet<>();\n\t\tint result = 0;\n\t\tint n = cin.nextInt();\n\t\tcin.nextLine();\n\n\t\t\n\t\tint[] arr = new int[n];\n\t\t\n\t\tfor(int i = 0;i<n;i++) {\n\t\t\tarr[i] = cin.nextInt();\n\t\t}\n\t\t\t\t\tif(n ==1 ) {\n\t\t\t\t\t\tSystem.out.println(arr[0]);\n\t\t\t\t\t\treturn;\t\n\t\t\t\t\t}\n\n\t\tArrays.sort(arr);\n\n\t\t\n\n\t\tSystem.out.println(arr[n/2]);\n\n\t\t\n\t\t\n\n\n\t\t\n\t\tcin.close();\n\t}\n}\n\n\n", "lang_cluster": "Java", "tags": ["sortings", "implementation"], "code_uid": "8baa28bf0e8feff4f905f4e92183f44b", "src_uid": "f03773118cca29ff8d5b4281d39e7c63", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.HashSet;\nimport java.util.Locale;\nimport java.util.PriorityQueue;\nimport java.util.Random;\nimport java.util.StringTokenizer;\n\npublic class C {\n\t\n\tprivate void solve() throws IOException {\n\t\tlong n = nextLong();\n\t\t\n\t\tif (n % 3 != 0) {\n\t\t\tprintln(\"0\");\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tn /= 3;\n\t\t\n\t\tint res = 0;\n\t\tfor (long i = 1; i * i * i <= n; i++) {\n\t\t\tif (n % i != 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t\n\t\t\tfor (long a = 1; a * a <= n && a + a <= i; a++) {\n\t\t\t\tlong b = i - a;\n\t\t\t\tlong m = n / i;\n\t\t\t\tlong d = i * i - 4 * (a * b - m);\n\t\t\t\t\n\t\t\t\tif (d <= 0) {\n\t\t\t\t\tcontinue;\n\t\t\t\t} else {\n\t\t\t\t\tlong sq = (long)Math.sqrt(d);\n\t\t\t\t\tif (sq * sq != d || sq < i || (sq - i) % 2 == 1) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tlong c = (sq - i) / 2;\n\t\t\t\t\tif (c < a || c < b) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tif (a == b && a == c) {\n\t\t\t\t\t\tres++;\n\t\t\t\t\t} else if (a != b && a != c && b != c) {\n\t\t\t\t\t\tres += 6;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tres += 3;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tprintln(res);\n\t}\n\n\tprivate String nextToken() throws IOException {\n\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t}\n\t\treturn tokenizer.nextToken();\n\t}\n\n\tprivate int nextInt() throws NumberFormatException, IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tprivate double nextDouble() throws NumberFormatException, IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n\n\tprivate long nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tprivate void print(Object o) {\n\t\twriter.print(o);\n\t}\n\n\tprivate void println(Object o) {\n\t\twriter.println(o);\n\t}\n\n\tprivate void printf(String format, Object... o) {\n\t\twriter.printf(format, o);\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tlong time = System.currentTimeMillis();\n\t\tLocale.setDefault(Locale.US);\n\t\tnew C().run();\n\t\tSystem.err.printf(\"%.3f\\n\", 1e-3 * (System.currentTimeMillis() - time));\n\t}\n\n\tBufferedReader reader;\n\tStringTokenizer tokenizer;\n\tPrintWriter writer;\n\n\tprivate void run() {\n\t\ttry {\n\t\t\treader = new BufferedReader(new InputStreamReader(System.in));\n\t\t\twriter = new PrintWriter(System.out);\n\t\t\tsolve();\n\t\t\treader.close();\n\t\t\twriter.close();\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(13);\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "number theory"], "code_uid": "28cec823495d58bce1971863050ebdc2", "src_uid": "07e58a46f2d562a44b7c771edad361b4", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Scanner;\n\npublic class Future {\n\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tlong n = in.nextLong();\n\t\tlong a = in.nextLong();\n\t\tlong b = in.nextLong();\n\t\tlong c = in.nextLong();\n\t\tlong k = 0;\n\t\tif (b - c < a && n >= b) {\n\t\t\tk = (n-b)/(b-c) + 1;\n\t\t\tn -= k * (b-c);\n\t\t\tk += n/a;\n\t\t}\n\t\telse if(n < b || b - c >= a) {\n\t\t\tk = n/a;\n\t\t}\n\t\tSystem.out.println(k);\n\t\tin.close();\n\t}\n\t\n\t\n}", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "b7e339ce9fe0155eb5fafafe1a30c4e8", "src_uid": "0ee9abec69230eab25de51aef0984f8f", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.io.OutputStreamWriter;\nimport java.io.BufferedWriter;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.Writer;\nimport java.util.StringTokenizer;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Lokesh Khandelwal\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tOutputWriter out = new OutputWriter(outputStream);\n\t\tTaskB solver = new TaskB();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskB {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n = in.nextInt(), d = in.nextInt(), i, a[] = new int[n], total = 0, j;\n for(i=0;i<n;i++) {\n a[i] = in.nextInt();\n total += a[i];\n }\n boolean canSum[] = new boolean[total+1];\n canSum[0] = true;\n for(i=0;i<n;i++) {\n for(j=total;j>=a[i];j--) {\n if(canSum[j - a[i]])\n canSum[j] = true;\n }\n }\n int max = 0, ans = 0;\n while (true) {\n int nmax = max;\n for(i=max+1;i<=total && i<=max+d;i++) {\n if(canSum[i])\n nmax = i;\n }\n if(nmax == max)\n break;\n ans++;\n max = nmax;\n }\n out.printLine(max +\" \"+ans);\n }\n}\n\nclass InputReader\n{\n BufferedReader in;\n StringTokenizer tokenizer=null;\n\n public InputReader(InputStream inputStream)\n {\n in=new BufferedReader(new InputStreamReader(inputStream));\n }\n public String next()\n {\n try{\n while (tokenizer==null||!tokenizer.hasMoreTokens())\n {\n tokenizer=new StringTokenizer(in.readLine());\n }\n return tokenizer.nextToken();\n }\n catch (IOException e)\n {\n return null;\n }\n }\n public int nextInt()\n {\n return Integer.parseInt(next());\n }\n }\n\nclass OutputWriter {\n\tprivate final PrintWriter writer;\n\n\tpublic OutputWriter(OutputStream outputStream) {\n\t\twriter = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n\t}\n\n\tpublic OutputWriter(Writer writer) {\n\t\tthis.writer = new PrintWriter(writer);\n\t}\n\n\tpublic void print(Object...objects) {\n\t\tfor (int i = 0; i < objects.length; i++) {\n\t\t\tif (i != 0)\n\t\t\t\twriter.print(' ');\n\t\t\twriter.print(objects[i]);\n\t\t}\n\t}\n\n\tpublic void printLine(Object...objects) {\n\t\tprint(objects);\n\t\twriter.println();\n\t}\n\n\tpublic void close() {\n\t\twriter.close();\n\t}\n}\n\n", "lang_cluster": "Java", "tags": ["greedy", "dp"], "code_uid": "bdcc516c4befd0e4939aa4f1b7725e3f", "src_uid": "65699ddec8d0db2f58b83a0f64de6f6f", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.math.*;\nimport java.util.Scanner;\npublic class Main {\n final static Integer MOD = 1000000009;\n public static BigInteger Com(int a,Integer n){\n if(a==0) return BigInteger.ONE;\n if(a==n) return BigInteger.ONE;\n BigInteger fenz = new BigInteger(n.toString());\n BigInteger fenm = BigInteger.ONE;\n //System.out.println(fenz + \" \"+fenm);\n for(int i=1;i<a; i++){\n n--;\n BigInteger next = new BigInteger(n.toString());\n //System.out.println(next);\n fenz = fenz.multiply(next);\n //System.out.println(fenz);\n \n }\n for(Integer i=2;i<=a;i++){\n BigInteger next = new BigInteger(i.toString());\n fenm = fenm.multiply(next);\n }\n return fenz.divide(fenm);\n }\n public static void main(String[] args){\n Scanner in = new Scanner(System.in);\n BigInteger BigMod = new BigInteger(MOD.toString());\n while(in.hasNextInt()){\n int n = in.nextInt() ;\n int w = in.nextInt();\n int b = in.nextInt();\n //System.out.println(n+\" \"+w+\" \"+b);\n //BigInteger res = BigInteger.ZERO;\n long res = 0;\n int Bnum = b;\n\n if(w < 2) continue;\n long fact_w = fact(w);\n long len_w = w - 1;\n long fact_b = fact(Bnum);\n res = res + ( fact_w * len_w ) % MOD ;\n res = (res * fact_b) % MOD;\n BigInteger mul = Com(n-3,b-1+w-2);\n //System.out.println(n-2+\"\"mul);\n mul = mul.mod(BigMod);\n //System.out.println(mul); \n String smul = mul.toString();\n res = res * Integer.parseInt(smul) % MOD;\n \n System.out.println(res);\n }\n }\n private static long fact(int wnum) {\n long ans=1;\n for(int i=1;i<=wnum;i++){\n ans*=i;\n ans%=MOD;\n }\n return ans;\n }\n}\n", "lang_cluster": "Java", "tags": ["combinatorics", "number theory"], "code_uid": "f9a1567668e712225f473e719942270c", "src_uid": "63e93a161bbff623323e66c98d5e20ac", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.*;\n\n/**\n * Created by Firеfly on 12/18/2016.\n */\npublic class code {\n public static void main(String[] args) throws IOException {\n Woorker worker = new Woorker();\n }\n}\nclass Woorker {\n Woorker() throws IOException {\n FastScannerqq fs = new FastScannerqq(new InputStreamReader(System.in));\n int s = fs.nextInt();\n int x1 = fs.nextInt();\n int x2 = fs.nextInt();\n int t2 = fs.nextInt();\n int t1 = fs.nextInt();\n int p = fs.nextInt();\n int d =fs.nextInt();\n int timeto = Math.abs(x1-x2)*t1;\n if (t1<=t2) System.out.println(timeto);\n else {\n int timeto1;\n if ((p>=x1 && d == -1) || (p<=x1 && d == 1)) timeto1 = Math.abs(p-x1)*t2;\n else if (p>=x1 && d==1){ timeto1 = (2*s-p-x1)*t2; d = -1; }\n else {timeto1 = (p+x1)*t2; d = 1; }\n if (x2>=x1 && d == 1)\n timeto1+=(x2-x1)*t2;\n else if (x2>=x1 && d==-1)\n timeto1+=(x1+x2)*t2;\n else if (x2<=x1 && d==-1)\n timeto1+=(x1-x2)*t2;\n else timeto1+=(2*s-x1-x2)*t2;\n System.out.println(Math.min(timeto, timeto1));\n\n }\n\n }\n}\n\n\nclass FastScannerqq {\n BufferedReader br;\n StringTokenizer stok;\n\n FastScannerqq(InputStreamReader fr) {\n br = new BufferedReader(fr);\n }\n\n String nextToken() throws IOException {\n while (stok == null || !stok.hasMoreTokens()) {\n String s = br.readLine();\n if (s == null)\n return null;\n stok = new StringTokenizer(s);\n }\n return stok.nextToken();\n }\n\n int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n char nextChar() throws IOException {\n return (char) br.read();\n }\n\n String nextLine() throws IOException {\n return br.readLine();\n }\n}", "lang_cluster": "Java", "tags": ["math", "constructive algorithms", "implementation"], "code_uid": "3f666a9ba185f0aa619895e7b7884c58", "src_uid": "fb3aca6eba3a952e9d5736c5d8566821", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class Prob_Hanoi{\n public static long V[][];\n public static boolean Visited[][][];\n public static long MEMO[][][];\n public static void main(String args[]){\n Scanner input=new Scanner(System.in);\n V=new long[3][];\n V[0]=new long[3];\n V[1]=new long[3];\n V[2]=new long[3];\n for(int i=0;i<3;i++){\n for(int j=0;j<3;j++){\n V[i][j]=input.nextLong();\n }\n }\n int n=input.nextInt();\n Visited=new boolean[n+1][][];\n MEMO=new long[n+1][][];\n for(int i=0;i<=n;i++){\n Visited[i]=new boolean[3][];\n MEMO[i]=new long[3][];\n for(int j=0;j<3;j++){\n Visited[i][j]=new boolean[3];\n for(int k=0;k<3;k++){\n Visited[i][j][k]=false;\n }\n MEMO[i][j]=new long[3];\n }\n }\n onlyOne(); \n for(int i=1;i<n;i++){\n for(int j=0;j<3;j++){\n for(int k=0;k<3;k++){\n if(j!=k){\n // System.out.println(i+\"\"+j+\"\"+k+\")=\"+DP(i,j,k)); \n }\n }\n }\n }\n System.out.println(DP(n,0,2));\n \n }\n public static void onlyOne(){\n for(int i=0;i<3;i++){\n for(int j=0;j<3;j++){\n if(i==j) continue;\n int k=0+1+2-i-j;\n MEMO[1][i][j]=Math.min(V[i][j],V[i][k]+V[k][j]);\n Visited[1][i][j]=true;\n }\n }\n }\n public static long DP(int n,int i,int j){\n if(Visited[n][i][j])\n return MEMO[n][i][j];\n int k=0+1+2-i-j;\n MEMO[n][i][j]=Math.min(DP(n-1,i,k)+V[i][j]+DP(n-1,k,j),\n DP(n-1,i,j)+V[i][k]+DP(n-1,j,i)+V[k][j]+DP(n-1,i,j)); \n Visited[n][i][j] =true;\n return MEMO[n][i][j];\n }\n}", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "80e5e75b2e20aea4b65afd418b7089d5", "src_uid": "c4c20228624365e39299d0a6e8fe7095", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class PostOffice {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tlong d = 0;\n\t\tlong a, b, t, k;\n\t\tScanner sc = new Scanner(System.in);\n\t\td = sc.nextLong();\n\t\tk = sc.nextLong();\n\t\ta = sc.nextLong();\n\t\tb = sc.nextLong();\n\t\tt = sc.nextLong();\n\t\t\n\t\tlong answer = -1;\n\t\t\n\t\tif(d<k){\n\t\t\tanswer = d*a;\n\t\t}\n\t\t\n\t\telse if(k*a+t >= k*b) {\n\t\t\tanswer = k*a + (d-k)*b;\n\t\t}\n\t\telse{\n\t\t\tlong q = d/k;\n\t\t\tlong r = d - q*k;\n\t\t\tif(t+r*a<r*b){\n\t\t\t\tanswer = (k*a+t)*q + r*a;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tanswer = (k*a+t)*q+r*b-t;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(answer);\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "d7827b3f3b64099208e09cd1fa12f2c0", "src_uid": "359ddf1f1aed9b3256836e5856fe3466", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "// practice with rainboy\nimport java.io.*;\nimport java.util.*;\n\npublic class CF946F extends PrintWriter {\n\tCF946F() { super(System.out, true); }\n\tScanner sc = new Scanner(System.in);\n\tpublic static void main(String[] $) {\n\t\tCF946F o = new CF946F(); o.main(); o.flush();\n\t}\n\n\tstatic final int MD = 1000000007;\n\tlong power(int a, int k) {\n\t\tif (k == 0)\n\t\t\treturn 1;\n\t\tlong p = power(a, k >> 1);\n\t\tp = p * p % MD;\n\t\tif ((k & 1) == 1)\n\t\t\tp = p * a % MD;\n\t\treturn p;\n\t}\n\tvoid main() {\n\t\tint n = sc.nextInt();\n\t\tint x = sc.nextInt();\n\t\tbyte[] cc = sc.next().getBytes();\n\t\tif (x == 0) {\n\t\t\tprintln(n == 1 && cc[0] == '0' ? 1 : 0);\n\t\t\treturn;\n\t\t}\n\t\tint[] ff = new int[x + 1];\n\t\tff[0] = ff[1] = 1;\n\t\tfor (int i = 2; i <= x; i++)\n\t\t\tff[i] = (ff[i - 1] + ff[i - 2]) % (MD - 1);\n\t\tfor (int i = 0; i <= x; i++)\n\t\t\tff[i] = (int) power(2, ff[i]);\n\t\tint[][][] ds = new int[x + 1][n][n + 1];\n\t\tfor (int l = 0; l < n; l++) {\n\t\t\tds[0][l][l] = ds[1][l][l] = 1;\n\t\t\tds[0][l][l + 1] = cc[l] == '0' ? 1 : 0;\n\t\t\tds[1][l][l + 1] = cc[l] == '1' ? 1 : 0;\n\t\t}\n\t\tfor (int i = 2; i <= x; i++)\n\t\t\tfor (int l = 0; l < n; l++)\n\t\t\t\tfor (int r = l; r < n; r++) {\n\t\t\t\t\tlong z = 0;\n\t\t\t\t\tfor (int m = l; m <= r; m++)\n\t\t\t\t\t\tz = (z + (long) ds[i - 1][l][m] * ds[i - 2][m][r]) % MD;\n\t\t\t\t\tds[i][l][r] = (int) z;\n\t\t\t\t}\n\t\tint[][] dp = new int[x + 1][n];\n\t\tint[][] dq = new int[x + 1][n];\n\t\tif (n > 1) {\n\t\t\tdp[0][n - 1] = ds[0][n - 1][n];\n\t\t\tdp[1][n - 1] = ds[1][n - 1][n];\n\t\t\tfor (int i = 2; i <= x; i++)\n\t\t\t\tfor (int l = 1; l < n; l++) {\n\t\t\t\t\tlong z = (long) dp[i - 1][l] * ff[i - 2] % MD;\n\t\t\t\t\tfor (int m = l; m < n; m++)\n\t\t\t\t\t\tz = (z + (long) ds[i - 1][l][m] * dp[i - 2][m]) % MD;\n\t\t\t\t\tdp[i][l] = (int) z;\n\t\t\t\t}\n\t\t\tdq[0][1] = ds[0][0][1];\n\t\t\tdq[1][1] = ds[1][0][1];\n\t\t\tfor (int i = 2; i <= x; i++)\n\t\t\t\tfor (int r = 1; r < n; r++) {\n\t\t\t\t\tlong z = (long) ff[i - 1] * dq[i - 2][r] % MD;\n\t\t\t\t\tfor (int m = r; m > 0; m--)\n\t\t\t\t\t\tz = (z + (long) dq[i - 1][m] * ds[i - 2][m][r]) % MD;\n\t\t\t\t\tdq[i][r] = (int) z;\n\t\t\t\t}\n\t\t}\n\t\tint[] dr = new int[x + 1];\n\t\tdr[0] = ds[0][0][n];\n\t\tdr[1] = ds[1][0][n];\n\t\tfor (int i = 2; i <= x; i++) {\n\t\t\tlong z = ((long) dr[i - 1] * ff[i - 2] + (long) ff[i - 1] * dr[i - 2]) % MD;\n\t\t\tfor (int m = 1; m < n; m++)\n\t\t\t\tz = (z + (long) dq[i - 1][m] * dp[i - 2][m]) % MD;\n\t\t\tdr[i] = (int) z;\n\t\t}\n\t\tprintln(dr[x]);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["matrices", "dp", "combinatorics"], "code_uid": "882f2b576cfbe06d9b463e43c7e861bc", "src_uid": "52c6aa73ff4460799402c646c6263630", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.Arrays;\nimport java.util.Locale;\nimport java.util.StringTokenizer;\nimport java.util.function.Function;\n\npublic class E {\n String fileName = \"E\";\n\n public int n, m;\n\n public static class Event implements Comparable<Event> {\n public static final int OPEN_TYPE = 0;\n public static final int POINT_TYPE = 1;\n public static final int CLOSE_TYPE = 2;\n\n public int x, type;\n\n public Event(int x, int type) {\n this.x = x;\n this.type = type;\n }\n\n @Override\n public int compareTo(Event event) {\n if (Integer.compare(x, event.x) != 0)\n return Integer.compare(x, event.x);\n else return Integer.compare(type, event.type);\n }\n }\n\n public static final class Node {\n public int l, r;\n public int max, maxInd;\n\n public Node leftNode, rightNode;\n\n public Node(int l, int r) {\n this.l = l;\n this.r = r;\n }\n }\n\n public void relax(Node root) {\n if (root.leftNode.max > root.rightNode.max) {\n root.max = root.leftNode.max;\n root.maxInd = root.leftNode.maxInd;\n } else {\n root.max = root.rightNode.max;\n root.maxInd = root.rightNode.maxInd;\n }\n }\n\n public Node build(int l, int r, Function<Integer, Integer> getItem) {\n Node res = new Node(l, r);\n if (l == r) {\n res.max = getItem.apply(l);\n res.maxInd = l;\n } else {\n int m = (r + l) / 2;\n res.leftNode = build(l, m, getItem);\n res.rightNode = build(m + 1, r, getItem);\n relax(res);\n }\n return res;\n }\n\n public void set(Node root, int ind, int val) {\n if (ind < root.l || ind > root.r)\n return;\n if (root.l == root.r) {\n root.max = val;\n return;\n }\n set(root.leftNode, ind, val);\n set(root.rightNode, ind, val);\n relax(root);\n }\n\n public static class QueryResult {\n public int max, maxInd;\n\n public QueryResult(int max, int maxInd) {\n this.max = max;\n this.maxInd = maxInd;\n }\n\n public QueryResult(QueryResult first, QueryResult second) {\n if (first.max > second.max) {\n this.max = first.max;\n this.maxInd = first.maxInd;\n } else {\n this.max = second.max;\n this.maxInd = second.maxInd;\n }\n }\n }\n\n public QueryResult query(Node root, int l, int r) {\n if (r == -1)\n return new QueryResult(0, -1);\n if (r < root.l || l > root.r)\n return new QueryResult(Integer.MIN_VALUE, -1);\n if (l <= root.l && r >= root.r) {\n return new QueryResult(root.max, root.maxInd);\n }\n return new QueryResult(query(root.leftNode, l, r), query(root.rightNode, l, r));\n }\n\n public int[] getLens(int[] a) {\n Node root = build(0, n, ind -> 0);\n int[] len = new int[a.length];\n for (int i = 0; i < a.length; i++) {\n int curVal = a[i];\n int prevLen = query(root, 0, curVal).max;\n len[i] = prevLen + 1;\n if (query(root, curVal, curVal).max < len[i])\n set(root, curVal, len[i]);\n }\n return len;\n }\n\n public void solve() throws IOException {\n n = nextInt();\n m = nextInt();\n Event[] events = new Event[2 * n + m];\n for (int i = 1; i <= m; i++) {\n events[i - 1] = new Event(i, Event.POINT_TYPE);\n }\n for (int i = 0; i < n; i++) {\n int l = nextInt();\n int r = nextInt();\n events[m + 2 * i] = new Event(l, Event.OPEN_TYPE);\n events[m + 2 * i + 1] = new Event(r, Event.CLOSE_TYPE);\n }\n Arrays.sort(events);\n int[] cnt = new int[m];\n int balance = 0;\n for (int i = 0; i < events.length; i++) {\n Event curEvent = events[i];\n if (curEvent.type == Event.OPEN_TYPE) {\n balance++;\n } else if (curEvent.type == Event.CLOSE_TYPE) {\n balance--;\n } else if (curEvent.type == Event.POINT_TYPE) {\n cnt[curEvent.x - 1] = balance;\n }\n }\n int[] lenUp = getLens(cnt);\n int[] newCnt = new int[cnt.length];\n for (int i = 0; i < cnt.length; i++) {\n newCnt[i] = cnt[cnt.length - i - 1];\n }\n int[] lenDown = getLens(newCnt);\n int[] revLenDown = new int[lenDown.length];\n for (int i = 0; i < lenDown.length; i++) {\n revLenDown[i] = lenDown[lenDown.length - i - 1];\n }\n int max = 0;\n for (int i = 0; i < lenDown.length; i++) {\n int cur = lenUp[i] + revLenDown[i] - 1;\n max = Math.max(max, cur);\n }\n out.print(max);\n }\n\n public void run() {\n try {\n br = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n\n solve();\n\n out.close();\n } catch (IOException e) {\n e.printStackTrace();\n System.exit(1);\n }\n }\n\n BufferedReader br;\n StringTokenizer in;\n PrintWriter out;\n\n public String nextToken() throws IOException {\n while (in == null || !in.hasMoreTokens()) {\n in = new StringTokenizer(br.readLine());\n }\n return in.nextToken();\n }\n\n public int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n public double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n public long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n public static void main(String[] args) throws IOException {\n Locale.setDefault(Locale.US);\n new E().run();\n }\n}", "lang_cluster": "Java", "tags": ["dp", "binary search", "data structures"], "code_uid": "7edb3567918516dacef4c7216ee8252a", "src_uid": "ce8350be138ce2061349d7f9224a5aaf", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Random;\nimport java.util.StringTokenizer;\n\nimport static java.lang.Math.*;\n\npublic class Main {\n BufferedReader br;\n StringTokenizer in;\n PrintWriter pw;\n Random r;\n int INF = (int) 1e9;\n int mod = (int) (1e9 + 7);\n //int p = 26;\n ArrayList<Integer> g[];\n\n void end(int a, int n) {\n if ((int) Math.pow(2, a) != n) pw.print(a);\n else pw.print(\"Final!\");\n pw.close();\n System.exit(0);\n }\n\n class node {\n int val;\n int m;\n int size;\n int prior;\n node L;\n node R;\n\n public node(int v) {\n val = v;\n prior = r.nextInt();\n size = 1;\n L = null;\n R = null;\n }\n }\n\n int sgs(node c) {\n if (c == null) return 0;\n return c.size;\n }\n\n int sgm(node c) {\n if (c == null) return INF;\n return c.m;\n }\n\n void relax(node c) {\n if (c == null) return;\n c.size = 1 + sgs(c.L) + sgs(c.R);\n }\n\n class pair implements Comparable<pair> {\n int a;\n int b;\n\n public pair(int aa, int bb) {\n a = aa;\n b = bb;\n }\n\n @Override\n public int compareTo(pair o) {\n if (a != o.a) return a - o.a;\n return b - o.b;\n }\n }\n\n class road {\n int to;\n int w;\n\n public road(int tto, int ww) {\n to = tto;\n w = ww;\n }\n\n public road() throws IOException {\n to = nextInt();\n w = nextInt();\n }\n }\n\n void readG(int n, int m) throws IOException {\n g = new ArrayList[n];\n for (int i = 0; i < n; i++) {\n g[i] = new ArrayList<>();\n }\n for (int i = 0; i < m; i++) {\n int a = nextInt() - 1;\n int b = nextInt() - 1;\n int w = nextInt();\n// g[a].add(new road(b, w));\n// g[b].add(new road(a, w));\n }\n }\n\n int p[];\n int d[];\n\n void solve() throws IOException {\n int n = nextInt();\n int m = nextInt();\n event[] p = new event[n * 2];\n for (int i = 0; i < n; i++) {\n int l = nextInt();\n int r = nextInt();\n p[i] = new event(l, 1);\n p[i + n] = new event(r, -1);\n }\n int q = p.length;\n int b = 0;\n Arrays.sort(p);\n int bal[] = new int[m + 1];\n int prev = 0;\n for (int i = 0; i < q; i++) {\n event a = p[i];\n if (a.t == -1) {\n for (int j = prev + 1; j <= a.time; j++) {\n bal[j] = b;\n }\n prev = a.time;\n } else {\n for (int j = prev + 1; j < a.time; j++) {\n bal[j] = b;\n }\n prev = a.time - 1;\n }\n b += a.t;\n }\n// for (int i = 1; i <= m; i++) {\n// pw.print(bal[i]);\n// }\n int revbal[] = new int[m + 1];\n for (int i = 1; i <= m; i++) {\n revbal[i] = bal[m + 1 - i];\n }\n int nvp[] = getnvp(bal);\n int rnvp[] = getnvp(revbal);\n int ans = 0;\n for (int i = 1; i <= m; i++) {\n int z = nvp[i];\n int w = rnvp[m - i];\n int sum = z + w;\n ans = max(ans, sum);\n }\n pw.print(ans);\n }\n\n int[] getnvp(int a[]) {\n int n = a.length;\n int d[] = new int[n + 1];\n int ans[] = new int[n];\n Arrays.fill(d, INF);\n d[0] = -INF;\n int last = 0;\n for (int i = 1; i < n; i++) {\n ans[i] = ans[i - 1];\n int c = a[i];\n int l = 0;\n int r = last + 1;\n while (l + 1 != r) {\n int m = (l + r) / 2;\n if (d[m] <= c) l = m;\n else r = m;\n }\n if (d[r] == INF) {\n ans[i]++;\n last++;\n }\n d[r] = min(d[r], c);\n }\n return ans;\n }\n\n class event implements Comparable<event> {\n int time;\n int t;\n\n public event(int ttime, int tt) {\n time = ttime;\n t = tt;\n }\n\n @Override\n public int compareTo(event o) {\n if (time != o.time) return time - o.time;\n else return o.t - t;\n }\n }\n\n\n public static void main(String[] args) throws IOException {\n new Main().run();\n }\n\n void run() throws IOException {\n br = new BufferedReader(new InputStreamReader(System.in));\n pw = new PrintWriter(new OutputStreamWriter(System.out));\n r = new Random(5);\n solve();\n pw.close();\n }\n\n String nextToken() throws IOException {\n while (in == null || !in.hasMoreTokens()) in = new StringTokenizer(br.readLine());\n return in.nextToken();\n }\n\n int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n}\n", "lang_cluster": "Java", "tags": ["dp", "binary search", "data structures"], "code_uid": "986ea43647d351405659593ff9c4058b", "src_uid": "ce8350be138ce2061349d7f9224a5aaf", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.lang.reflect.Array;\nimport java.util.*;\n\npublic class Main {\n ArrayList<ArrayList<Integer>> q;\n boolean[] used;\n\n public void solve() throws IOException {\n int n = nextInt();\n int m = nextInt();\n int[] a = new int[m + 1];\n for (int i = 0; i < n; i++) {\n a[nextInt() - 1]++;\n a[nextInt()]--;\n }\n for (int i = 1; i < m; i++) {\n a[i] += a[i - 1];\n }\n int[] d = new int[m + 1];\n Arrays.fill(d, Integer.MAX_VALUE);\n int k = 0;\n int[] v1 = new int[m + 2];\n int[] v2 = new int[m + 2];\n for (int i = 0; i < m; i++) {\n int l = 0;\n int r = m;\n while (r - l > 1) {\n int m1 = (r + l) / 2;\n if (d[m1] > a[i]) {\n r = m1;\n } else {\n l = m1;\n }\n }\n if (d[l] <= a[i]) {\n l++;\n }\n if (d[l] == Integer.MAX_VALUE){\n k++;\n }\n d[l] = a[i];\n v1[i] = k;\n }\n k = 0;\n int max = 0;\n Arrays.fill(d,Integer.MAX_VALUE);\n for (int i = m - 1; i >= 0; i--) {\n int l = 0;\n int r = m;\n while (r - l > 1) {\n int m1 = (r + l) / 2;\n if (d[m1] > a[i]) {\n r = m1;\n } else {\n l = m1;\n }\n }\n if (d[l] <= a[i]) {\n l++;\n }\n if (d[l] == Integer.MAX_VALUE){\n k++;\n }\n d[l] = a[i];\n v2[i] = k;\n max = Math.max(max,v1[i] + v2[i + 1]);\n }\n max = Math.max(max,v2[0]);\n out.print(max);\n }\n\n BufferedReader br;\n StringTokenizer sc;\n PrintWriter out;\n\n String nextToken() throws IOException {\n while (sc == null || !sc.hasMoreTokens()) {\n try {\n sc = new StringTokenizer(br.readLine());\n } catch (Exception e) {\n sc = null;\n }\n }\n return sc.nextToken();\n }\n\n public Integer nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n public Long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n public Double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n public static void main(String[] args) throws IOException {\n Locale.setDefault(Locale.US);\n new Main().run();\n }\n\n public void run() throws IOException {\n try {\n br = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n solve();\n out.close();\n } catch (Exception e) {\n e.printStackTrace();\n System.exit(1);\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["dp", "binary search", "data structures"], "code_uid": "fcc1a22b46150b804f41cc41f7458150", "src_uid": "ce8350be138ce2061349d7f9224a5aaf", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.LinkedList;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tprivate void start() {\n\t\tScanner in = new Scanner(System.in);\n\n\t\tint n;\n\n\t\tn = in.nextInt();\n\n\t\tif (n == 1) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\t\tint k = Integer.MAX_VALUE;\n\t\tfor (int i = 1; i < n; i++) {\n\t\t\tk = Math.min(k, calc(i, n));\n\t\t}\n\t\tSystem.out.println(k);\n\t}\n\n\tprivate int calc(int i, int n) {\n\t\t\n\t\tif (i == 1) {\n\t\t\treturn n - 1;\n\t\t}\n\t\t\n\t\tint ret = 0;\n\t\t\n\t\twhile (true) {\n\t\t\tif (i > n) {\n\t\t\t\tint t = i;\n\t\t\t\ti = n;\n\t\t\t\tn = t;\n\t\t\t}\n\t\t\t\n\t\t\tif (i == 1) {\n\t\t\t\tret += n - 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\tif (n % i == 0) {\n\t\t\t\treturn Integer.MAX_VALUE;\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\tint q = n / i;\n\t\t\tret += q;\n\t\t\tn = n - i * q;\n\t\t\t\n\t\t\tif (i == 1 && n == 1) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().start();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "math", "number theory", "brute force"], "code_uid": "e09e6e2d29ff09be91753a5c31a6e94f", "src_uid": "75739f77378b21c331b46b1427226fa1", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.IOException;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n\n public static void main(final String[] args) throws IOException {\n try(Scanner scan = new Scanner(System.in);\n PrintWriter print = new PrintWriter(System.out)) {\n final int n = scan.nextInt();\n final int l = scan.nextInt();\n final int r = scan.nextInt();\n final Floodlight[] floodlights = new Floodlight[n];\n for(int i = 0; i < n; ++i) {\n final int x = scan.nextInt();\n final int y = scan.nextInt();\n final double angle = scan.nextInt() / 180. * Math.PI;\n floodlights[i] = new Floodlight(x, y, angle);\n }\n print.println(calcMaxBeginSeg(l, r, floodlights));\n }\n }\n\n public static double calcMaxBeginSeg(final int left, final int right, final Floodlight[] floodlights) {\n if(right <= left) return 0.;\n final int n = floodlights.length;\n double maxLitRight[] = new double[1 << n];\n maxLitRight[0] = left;\n for(int mask = 1; mask < 1 << n; ++mask) {\n double result = left;\n for(int i = 0; i < n; ++i) {\n if(((mask >> i) & 1) == 1) {\n result = Math.max(result, extendLitSeg(maxLitRight[mask ^ (1 << i)], floodlights[i], right));\n }\n }\n maxLitRight[mask] = result;\n }\n return maxLitRight[(1 << n) - 1] - left;\n }\n\n private static double extendLitSeg(final double left, final Floodlight light, final double maxRight) {\n if(left >= maxRight) return left;\n if(light.y <= 0.) throw new RuntimeException(\"light.y must be > 0\");\n final double startAngle = Math.atan((left - light.getX()) / light.getY());\n final double endAngle = startAngle + light.angle;\n if(endAngle >= Math.PI / 2.) return maxRight;\n return Math.min(maxRight, light.getX() + light.getY() * Math.tan(endAngle));\n }\n\n public static class Floodlight {\n private final int x;\n private final int y;\n private final double angle;\n\n public Floodlight(final int x, final int y, final double angle) {\n this.x = x;\n this.y = y;\n this.angle = angle;\n }\n\n public int getX() {\n return x;\n }\n\n public int getY() {\n return y;\n }\n\n public double getAngle() {\n return angle;\n }\n }\n\n public static class NumberUtils {\n public static interface Factorizer {\n List<Integer> factorize(int number);\n }\n\n /**\n * thread safe Factorizer\n */\n public static Factorizer createSmallNumberFactorizer(final int upperBound) {\n return new SmallNumberFactorizer(upperBound);\n }\n\n /**\n * thread safe\n */\n private static class SmallNumberFactorizer implements Factorizer {\n private int[] divisors;\n private final int upperBound;\n private boolean prepared = false;\n\n /**\n * lazy\n * time complexity O(n * log(n) * log(log(n))\n * memory complexity O(n)\n */\n public SmallNumberFactorizer(final int upperBound) {\n this.upperBound = upperBound;\n }\n\n private synchronized void prepare() {\n divisors = new int[upperBound];\n Arrays.fill(divisors, 0);\n for(int i = 2; i * i < upperBound; ++i) {\n if(divisors[i] == 0) {\n for(int j = i * i; j < upperBound; j += i) {\n if(divisors[j] == 0) {\n divisors[j] = i;\n }\n }\n }\n }\n prepared = true;\n }\n\n /**\n * complexity O(result)\n */\n public List<Integer> factorize(int number) {\n synchronized (this) {\n if(!prepared) {\n prepare();\n }\n }\n final List<Integer> result = CollectionFactory.createArrayList();\n if(number < 2) return result;\n if(number >= upperBound) throw new RuntimeException(\"number should be less than upper bound\");\n while(divisors[number] > 0) {\n result.add(divisors[number]);\n number /= divisors[number];\n }\n result.add(number);\n return result;\n }\n }\n }\n\n public static class CollectionFactory {\n public static<T> List<T> createArrayList() {\n return new ArrayList<>();\n }\n\n public static<T> List<T> createArrayList(final int capacity) {\n return new ArrayList<>(capacity);\n }\n }\n\n public static class CollectionUtils {\n public static<T> List<T> unique(final List<T> list) {\n final List<T> result = CollectionFactory.createArrayList();\n T p = null;\n for(T elem : list) {\n if(!elem.equals(p)) {\n result.add(elem);\n p = elem;\n }\n }\n return result;\n }\n\n public static<T extends Comparable<T>> T max(final List<T> list, final T lowerBound) {\n T result = lowerBound;\n for(T elem : list) {\n if(elem.compareTo(result) > 0) {\n result = elem;\n }\n }\n return result;\n }\n }\n\n}\n", "lang_cluster": "Java", "tags": ["dp", "geometry", "bitmasks"], "code_uid": "2125f19da15b689b882bd69e31063fde", "src_uid": "4fad1233e08bef09e5aa7e2dc6167d6a", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.StringTokenizer;\n\n\npublic class GoldenAge {\n\n public static void main(String[] args) {\n FastReader read = new FastReader () ; \n long x = read.nextLong(); \n long y = read.nextLong(); \n long b = read.nextLong(); \n long e = read.nextLong();\n ArrayList<Long> xl = new ArrayList<>();\n ArrayList<Long> yl = new ArrayList<>(); \n ArrayList<Long> list = new ArrayList<>();\n \n long xp = 1 ; \n long yp = 1 ; \n \n while (e / x >= xp )\n {\n \n xl.add(xp );\n xp *= x; \n }\n xl.add(xp);\n while ( e / y >= yp ){\n \n yl.add(yp);\n \n yp *= y ; \n \n \n }\n yl.add(yp);\n long tmp1 , tmp2 ; \n for (int i = 0; i < xl.size(); i++) {\n tmp1 = xl.get(i);\n for (int j = 0; j < yl.size(); j++) {\n tmp2 = yl.get(j);\n if(tmp1 + tmp2 >= b && tmp1 + tmp2 <= e ){\n list.add(tmp1 + tmp2 );\n }\n }\n }\n list.add(b-1);\n list.add(e+1);\n Collections.sort(list);\n long max = 0 ; \n \n for (int i = 1; i < list.size(); i++) {\n max = Math.max(max, list.get(i) - list.get(i-1) -1 ); \n }\n System.out.println(max);\n }\n \n}\n\n \n \n class FastReader{\n BufferedReader br ;\n StringTokenizer st;\n \n public FastReader(){\n InputStreamReader inr =new InputStreamReader(System.in);\n br=new BufferedReader(inr);\n \n }\n \n String next(){\n while(st==null || !st.hasMoreElements()){\n try{\n st=new StringTokenizer(br.readLine());\n }\n catch(IOException e){\n e.printStackTrace();\n }}\n return st.nextToken();\n }\n \n int nextInt(){\n return Integer.parseInt(next());\n }\n \n double nextDouble(){\n return Double.parseDouble(next());\n \n }\n \n long nextLong(){\n return Long.parseLong(next());\n }\n \n \n String nextLine(){\n String str=\"\";\n try{\n str=br.readLine();\n }\n catch(IOException e)\n {\n e.printStackTrace();\n }\n return str;\n }\n} ", "lang_cluster": "Java", "tags": ["brute force", "math"], "code_uid": "e4e895585e162dd80b29c90574d10d3c", "src_uid": "68ca8a8730db27ac2230f9fe9b120f5f", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "//package round81;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class E {\n\tScanner in;\n\tPrintWriter out;\n//\tString INPUT = \"9 3 3\\r\\n\" +\n//\t\"4 3 1\\r\\n\" +\n//\t\"2 3 3\";\n\tString INPUT = \"8 10 10\\r\\n\" +\n\t\"9 10 10\\r\\n\" +\n\t\"10 10 10\";\n//\tString INPUT = \"1 1 1 2 1 10 5 1 1\";\n\t\n\tvoid solve()\n\t{\n\t\tint[][] s = new int[3][4];\n\t\tfor(int i = 0;i < 3;i++){\n\t\t\tfor(int j = 0;j < 3;j++){\n\t\t\t\ts[i][j] = ni();\n\t\t\t}\n\t\t}\n\t\t\n\t\tint ct = 0;\n\t\tint[] iord = new int[9];\n\t\tfor(int j = 0;j < 9;j++)iord[j] = j;\n\t\tgmax = 0;\n\t\tdo{\n\t\t\tif(iord[1] < iord[2] && iord[4] < iord[5] && iord[7] < iord[8]){\n\t\t\t\tint[] ord = new int[9];\n\t\t\t\tfor(int j = 0;j < 9;j++){\n\t\t\t\t\tord[iord[j]] = j;\n\t\t\t\t}\n\t\t\t\tint[] u = new int[3];\n\t\t\t\touter:\n\t\t\t\tfor(int i = 0;i < 27;i++, inc(u, 3)){\n\t\t\t\t\tfor(int j = 0;j < 3;j++){\n\t\t\t\t\t\tif(u[j] == j ){\n\t\t\t\t\t\t\tfor(int k = 0;k < 3;k++){\n\t\t\t\t\t\t\t\tif(iord[j*3+2] > iord[k*3])continue outer;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tfor(int k = j+1;k < 3;k++){\n\t\t\t\t\t\t\t\tif(iord[j*3+2] > iord[k*3+1])continue outer;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tboolean[] lifted = new boolean[3];\n\t\t\t\t\tboolean[] lift = new boolean[3];\n\t\t\t\t\tfor(int j = 0;j < 9;j++){\n\t\t\t\t\t\tint me = ord[j]/3;\n\t\t\t\t\t\tint targ = u[ord[j]/3];\n\t\t\t\t\t\tif(lifted[me])continue outer;\n\t\t\t\t\t\tif(ord[j] % 3 == 0 && lift[me])continue outer;\n\t\t\t\t\t\tif(ord[j] % 3 == 1 && targ != me){\n\t\t\t\t\t\t\tif(lifted[targ])continue outer;\n\t\t\t\t\t\t\tlifted[targ] = true;\n\t\t\t\t\t\t\tlift[me] = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(ord[j] % 3 == 2 && targ != me){\n\t\t\t\t\t\t\tif(!lifted[targ])continue outer;\n\t\t\t\t\t\t\tlifted[targ] = false;\n\t\t\t\t\t\t\tlift[me] = false;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tfor(int j = 0;j < 3;j++){\n\t\t\t\t\t\ts[j][3] = s[j][0];\n\t\t\t\t\t}\n\t\t\t\t\tgmax = Math.max(gmax, rec(ord, u, 0, s, 0, 0));\n\t\t\t\t\tct++;\n//\t\t\t\t\tif(ct % 100 == 0)tr(ct);\n\t\t\t\t}\n\t\t\t}\n\t\t}while(nextPermutation(iord));\n//\t\ttr(ct);\n\t\tout.println(gmax);\n\t}\n\t\n\tint gmax;\n\tboolean invalid(int[] ord, int[] u, int pos, int[][] s)\n\t{\n\t\tint[] ss = new int[3];\n\t\tfor(int i = 0;i < 3;i++){\n\t\t\tss[i] = s[i][3];\n\t\t}\n\t\tfor(int i = pos;i < 9;i++){\n\t\t\tint me = ord[i]/3;\n\t\t\tint targ = u[ord[i]/3];\n\t\t\tint com = ord[i] % 3;\n\t\t\tif(com == 0){\n\t\t\t\tss[me] += s[me][1];\n\t\t\t}else if(com == 1 && me != targ){\n\t\t\t\tfor(int j = 0;j < 3;j++){\n\t\t\t\t\tif(me != j)ss[j]++;\n\t\t\t\t}\n\t\t\t}else if(com == 2 && me != targ){\n\t\t\t\tfor(int j = 0;j < 3;j++){\n\t\t\t\t\tif(me != j)ss[j] += s[me][2];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tint mx = Math.max(Math.max(ss[0], ss[1]), ss[2]);\n\t\treturn mx <= gmax;\n\t}\n\t\n\tint rec(int[] ord, int[] u, int pos, int[][] s, int lift, int lifted)\n\t{\n\t\tif(pos == 9){\n\t\t\treturn Math.max(Math.max(s[0][3], s[1][3]), s[2][3]);\n\t\t}\n\t\tif(invalid(ord, u, pos, s))return 0;\n\t\t\n\t\tint me = ord[pos]/3;\n\t\tint targ = u[ord[pos]/3];\n\t\tint com = ord[pos]%3;\n\t\tint max = 0;\n\t\tif(com == 0){\n\t\t\touter:\n\t\t\tfor(int i = s[me][1];i >= -s[me][1];i--){\n\t\t\t\tfor(int j = 0;j < 3;j++){\n\t\t\t\t\tif(me != j && s[me][3] + i == s[j][3])continue outer;\n\t\t\t\t}\n\t\t\t\ts[me][3] += i;\n\t\t\t\tmax = Math.max(max, rec(ord, u, pos+1, s, lift, lifted));\n\t\t\t\ts[me][3] -= i;\n//\t\t\t\tif(pos == 8)break;\n\t\t\t}\n\t\t}else if(com == 1){\n\t\t\tif(me == targ){\n\t\t\t\tmax = Math.max(max, rec(ord, u, pos+1, s, lift, lifted));\n\t\t\t}else{\n\t\t\t\tif(Math.abs(s[me][3] - s[targ][3]) == 1){\n\t\t\t\t\tlift ^= 1<<me;\n\t\t\t\t\tlifted ^= 1<<targ;\n\t\t\t\t\tint o = s[targ][3];\n\t\t\t\t\ts[targ][3] = s[me][3];\n\t\t\t\t\tif(lift<<31-targ<0){\n\t\t\t\t\t\tint other = Integer.numberOfTrailingZeros(7-(1<<me)-(1<<targ));\n\t\t\t\t\t\ts[other][3] = s[me][3];\n\t\t\t\t\t}\n\t\t\t\t\tmax = Math.max(max, rec(ord, u, pos+1, s, lift, lifted));\n\t\t\t\t\ts[targ][3] = o;\n\t\t\t\t\tif(lift<<31-targ<0){\n\t\t\t\t\t\tint other = Integer.numberOfTrailingZeros(7-(1<<me)-(1<<targ));\n\t\t\t\t\t\ts[other][3] = s[targ][3];\n\t\t\t\t\t}\n\t\t\t\t\tlift ^= 1<<me;\n\t\t\t\t\tlifted ^= 1<<targ;\n\t\t\t\t}\n\t\t\t}\n\t\t}else if(com == 2){\n\t\t\tif(me == targ){\n\t\t\t\tmax = Math.max(max, rec(ord, u, pos+1, s, lift, lifted));\n\t\t\t}else{\n\t\t\t\touter2:\n\t\t\t\tfor(int i = s[me][2];i >= -s[me][2];i--){\n\t\t\t\t\tfor(int j = 0;j < 3;j++){\n\t\t\t\t\t\tif(s[targ][3] + i == s[j][3])continue outer2;\n\t\t\t\t\t}\n\t\t\t\t\tint o = s[targ][3];\n\t\t\t\t\ts[targ][3] = s[me][3] + i;\n\t\t\t\t\tif(lift<<31-targ<0){\n\t\t\t\t\t\tint other = Integer.numberOfTrailingZeros(7-(1<<me)-(1<<targ));\n\t\t\t\t\t\ts[other][3] = s[targ][3];\n\t\t\t\t\t}\n\t\t\t\t\tlifted ^= 1<<targ;\n\t\t\t\t\tlift ^= 1<<me;\n\t\t\t\t\tmax = Math.max(max, rec(ord, u, pos+1, s, lift, lifted));\n\t\t\t\t\tlifted ^= 1<<targ;\n\t\t\t\t\tlift ^= 1<<me;\n\t\t\t\t\ts[targ][3] = o;\n\t\t\t\t\tif(lift<<31-targ<0){\n\t\t\t\t\t\tint other = Integer.numberOfTrailingZeros(7-(1<<me)-(1<<targ));\n\t\t\t\t\t\ts[other][3] = s[targ][3];\n\t\t\t\t\t}\n//\t\t\t\t\tif(pos == 8)break;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn max;\n\t}\n\t\n\tpublic static boolean inc(int[] a, int base)\n\t{\n\t\tint n = a.length;\n\t\tint i;\n\t\tfor(i = n - 1;i >= 0 && a[i] == base - 1;i--);\n\t\tif(i == -1)return false;\n\t\t\n\t\ta[i]++;\n\t\tArrays.fill(a, i + 1, n, 0);\n\t\treturn true;\n\t}\n\t\n\tpublic static boolean nextPermutation(int[] src)\n\t{\n\t\tint i;\n\t\tfor(i = src.length - 2;i >= 0 && src[i] > src[i+1];i--);\n\t\tif(i == -1)return false;\n\t\tint j;\n\t\tfor(j = i + 1;j < src.length && src[i] < src[j];j++);\n\t\tint d = src[i]; src[i] = src[j - 1]; src[j - 1] = d;\n\t\tfor(int p = i + 1, q = src.length - 1;p < q;p++,q--){\n\t\t\td = src[p]; src[p] = src[q]; src[q] = d;\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tvoid run() throws Exception\n\t{\n\t\tin = oj ? new Scanner(System.in) : new Scanner(INPUT);\n\t\tout = new PrintWriter(System.out);\n\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception\n\t{\n\t\tnew E().run();\n\t}\n\t\n\tint ni() { return Integer.parseInt(in.next()); }\n\tlong nl() { return Long.parseLong(in.next()); }\n\tdouble nd() { return Double.parseDouble(in.next()); }\n\tboolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tvoid tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["brute force"], "code_uid": "7ab54e4b4cbe914485c09b71aad40325", "src_uid": "a14739b86d1fd62a030226263cdc1afc", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\nimport java.util.concurrent.*;\n\npublic final class barels_and_boxes\n{\n static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\tstatic FastScanner sc=new FastScanner(br);\n static PrintWriter out=new PrintWriter(System.out);\n\tstatic Random rnd=new Random();\n\tstatic long[] fact,inv_fact;\n\tstatic int maxn=(int)(2e5+5);\n\tstatic long mod=(long)(1e9+7);\n\t\n\tstatic int add(long a,long b)\n\t{\n\t\tlong ret=a+b;\n\t\t\n\t\tif(ret>=mod)\n\t\t{\n\t\t\tret%=mod;\n\t\t}\n\t\t\n\t\treturn (int)ret;\n\t}\n\t\n\tstatic int mul(long a,long b)\n\t{\n\t\tlong ret=a*b;\n\t\t\n\t\tif(ret>=mod)\n\t\t{\n\t\t\tret%=mod;\n\t\t}\n\t\t\n\t\treturn (int)ret;\n\t}\n\t\n\tstatic long pow(long a,long b)\n\t{\n\t\tlong x=1,y=a;\n\t\t\n\t\twhile(b>0)\n\t\t{\t\n\t\t\tif(b%2==1)\n\t\t\t{\n\t\t\t\tx=(x*y)%mod;\n\t\t\t}\n\t\t\t\n\t\t\ty=(y*y)%mod;b=b/2;\t\n\t\t}\n\t\t\n\t\treturn x;\n\t}\n\t\n\tstatic void build()\n\t{\n\t\tfact=new long[maxn];inv_fact=new long[maxn];fact[0]=1;\n\n\t\tfor(int i=1;i<maxn;i++)\n\t\t{\n\t\t\tfact[i]=(fact[i-1]*i)%mod;\n\t\t}\n\n\t\tinv_fact[maxn-1]=pow(fact[maxn-1],mod-2);\n\n\t\tfor(int i=maxn-2;i>=0;i--)\n\t\t{\n\t\t\tinv_fact[i]=(inv_fact[i+1]*(i+1))%mod;\n\t\t}\n\t}\n\t\n\tstatic long C(int n,int r)\n\t{\n\t\tif(n-r<0 || Math.min(n,r)<0)\n\t\t{\n\t\t\treturn 0;\n\t\t}\n\t\t\n\t\tlong val1=fact[n],val2=inv_fact[r],val3=inv_fact[n-r];\n\t\t\n\t\tlong mul=(val2*val3)%mod;\n\t\t\n\t\treturn (val1*mul)%mod;\n\t}\n\t\n\tstatic long get(long tot,int nums,int flag)\n\t{\n\t\tif(nums==0)\n\t\t{\n\t\t\treturn (tot==0?1:0);\n\t\t}\n\t\t\n\t\telse\n\t\t{\n\t\t\tif(flag==1)\t\n\t\t\t{\n\t\t\t\treturn C((int)(tot-1),nums-1);\n\t\t\t}\n\t\t\t\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn C((int)tot+nums-1,nums-1);\n\t\t\t}\n\t\t}\n\t}\n\t\n public static void main(String args[]) throws Exception\n {\n\t\tbuild();\n\t\t\n\t\tint f=sc.nextInt(),w=sc.nextInt(),h=sc.nextInt();\n\t\t\n\t\tlong p=0,q=0;\n\t\t\n\t\tfor(int i=1;i<=Math.min(f,w);i++)\n\t\t{\n\t\t\tlong val1=C(f-1,i-1),val2=C(w-1,i-1);\n\t\t\t\n\t\t\tlong zz=mul(val1,val2);\n\t\t\t\n\t\t\tzz=mul(zz,2);\n\t\t\t\n\t\t\tq=add(q,zz);\n\t\t\t\n\t\t}\n\t\t\n\t\tfor(int i=1;i<=f;i++)\n\t\t{\n\t\t\tif(w>=i-1)\n\t\t\t{\n\t\t\t\tlong val1=C(f-1,i-1),val2=get(w,i-1,1);\n\t\t\t\n\t\t\t\tlong zz=mul(val1,val2);\n\t\t\t\n\t\t\t\tq=add(q,zz);\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor(int i=1;i<=w;i++)\n\t\t{\n\t\t\tif(f>=i-1)\n\t\t\t{\n\t\t\t\tlong val1=C(w-1,i-1),val2=get(f,i-1,1);\n\t\t\t\n\t\t\t\tlong zz=mul(val1,val2);\n\t\t\t\n\t\t\t\tq=add(q,zz);\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor(int i=1;i<=Math.min(f,w);i++)\n\t\t{\n\t\t\tlong now=(w*1L)-((i*1L*(h+1)));\n\t\t\t\n\t\t\tif(now>=0)\n\t\t\t{\n\t\t\t\tlong val1=C(f-1,i-1),val2=get(now,i,-1);\n\n\t\t\t\tlong zz=mul(val1,val2);\n\n\t\t\t\tzz=mul(zz,2);\n\n\t\t\t\tp=add(p,zz);\n\t\t\t}\n\t\t\t\n\t\t}\n\t\t\n\t\tfor(int i=1;i<=f;i++)\n\t\t{\n\t\t\tif(w>=i-1)\n\t\t\t{\n\t\t\t\tlong now=(w*1L)-((i-1)*1L*(h+1));\n\t\t\t\t\n\t\t\t\tif(now>=0)\n\t\t\t\t{\n\t\t\t\t\tlong val1=C(f-1,i-1),val2=get(now,i-1,-1);\n\n\t\t\t\t\tlong zz=mul(val1,val2);\n\n\t\t\t\t\tp=add(p,zz);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor(int i=1;i<=w;i++)\n\t\t{\n\t\t\tif(f>=i-1)\n\t\t\t{\n\t\t\t\tlong now=(w*1L)-(i*1L*(h+1));\n\t\t\t\t\n\t\t\t\tif(now>=0)\n\t\t\t\t{\n\t\t\t\t\tlong val1=get(now,i,-1),val2=get(f,i-1,1);\n\n\t\t\t\t\tlong zz=mul(val1,val2);\n\n\t\t\t\t\tp=add(p,zz);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tlong den=pow(q,mod-2),res=mul(p,den);\n\t\t\n\t\tout.println(res);out.close();\n }\n}\nclass FastScanner\n{\n BufferedReader in;\n StringTokenizer st;\n\n public FastScanner(BufferedReader in) {\n this.in = in;\n }\n\t\n public String nextToken() throws Exception {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(in.readLine());\n }\n return st.nextToken();\n }\n\t\n\tpublic String next() throws Exception {\n\t\treturn nextToken().toString();\n\t}\n\t\n public int nextInt() throws Exception {\n return Integer.parseInt(nextToken());\n }\n\n public long nextLong() throws Exception {\n return Long.parseLong(nextToken());\n }\n\n public double nextDouble() throws Exception {\n return Double.parseDouble(nextToken());\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "combinatorics", "probabilities", "number theory"], "code_uid": "97669738d35ae799524c0940a5ab3d54", "src_uid": "a69f95db3fe677111cf0558271b40f39", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Scanner;\n\n\npublic class Main {\n\n /**\n * @param args\n */\n public static void main(String[] args) {\n // TODO Auto-generated method stub\n Scanner read = new Scanner(System.in);\n int cm = read.nextInt();\n // 1 in = 3 cm\n // 1 fo = 12 inc\n // 1/36 fo = 1 cm\n //1 fo = 36 cm\n int feet , inch;\n feet = cm / 36;\n inch = (cm % 36) / 3;\n inch += ((cm % 36) % 3)>1?1:0;\n feet += (inch / 12); \n inch = inch % 12; \n System.out.printf(\"%d %d\\n\", feet, inch);\n }\n\n}", "lang_cluster": "Java", "tags": ["math"], "code_uid": "b1bfb05535b221ad5838f630d2978055", "src_uid": "5d4f38ffd1849862623325fdbe06cd00", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.Scanner;\n\npublic class A1043\n{\n public static void main(String[] args)\n {\n Scanner scanner = new Scanner(System.in);\n int n = scanner.nextInt();\n int opponentVotes = 0;\n int max = Integer.MIN_VALUE;\n int[] votes = new int[n];\n for (int i = 0; i < n; i++)\n {\n\n votes[i] = scanner.nextInt();\n if(votes[i] > max)\n max = votes[i];\n opponentVotes += votes[i];\n }\n int myMax = max;\n\n while(func(myMax, votes) <= opponentVotes)\n myMax++;\n System.out.println(myMax);\n\n\n }\n\n private static int func(int myMax, int[] votes)\n {\n int sum = 0;\n for (int vote : votes)\n {\n sum = sum + myMax - vote;\n }\n return sum;\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "c8469d21ad1a35afed17cbd44e56dc56", "src_uid": "d215b3541d6d728ad01b166aae64faa2", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\npublic class ProE {\n\tstatic long aa,bb,cc,dd,a,b,c,d,ans;\n\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\ta=in.nextInt();b=in.nextInt();\n\t\tc=in.nextInt();d=in.nextInt();\n\t\taa=(c-a+1)/2+1;bb=(c-a+1)/2;\n\t\tcc=(d-b+1)/2+1;dd=(d-b+1)/2;\n\t\tans=aa*cc+bb*dd;\n\t\tSystem.out.println(ans);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "9568147dcf561986dace199b2b6cf90c", "src_uid": "00cffd273df24d1676acbbfd9a39630d", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// practice with rainboy\nimport java.io.*;\nimport java.util.*;\n\npublic class CF445D {\n\tstatic int x;\n\tstatic int getNextX() {\n\t\tx = (int) ((x * 37L + 10007) % 1000000007);\n\t\treturn x;\n\t}\n\tstatic int[] aa, bb;\n\tstatic void initAB(int n, int d) {\n\t\taa = new int[n];\n\t\tbb = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\taa[i] = i + 1;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint j = getNextX() % (i + 1);\n\t\t\tint tmp = aa[i]; aa[i] = aa[j]; aa[j] = tmp;\n\t\t}\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tbb[i] = i < d ? 1 : 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint j = getNextX() % (i + 1);\n\t\t\tint tmp = bb[i]; bb[i] = bb[j]; bb[j] = tmp;\n\t\t}\n\t}\n\tstatic final int S = 20;\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tPrintWriter pw = new PrintWriter(System.out);\n\t\tStringTokenizer st = new StringTokenizer(br.readLine());\n\t\tint n = Integer.parseInt(st.nextToken());\n\t\tint d = Integer.parseInt(st.nextToken());\n\t\tx = Integer.parseInt(st.nextToken());\n\t\tinitAB(n, d);\n\t\tint[] ii = new int[S + 1];\n\t\tint[] jj = new int[n];\n\t\tint k = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint h = i < S ? i : S;\n\t\t\twhile (h > 0 && aa[ii[h - 1]] < aa[i]) {\n\t\t\t\tii[h] = ii[h - 1];\n\t\t\t\th--;\n\t\t\t}\n\t\t\tii[h] = i;\n\t\t\tif (bb[i] == 1)\n\t\t\t\tjj[k++] = i;\n\t\t\tint c = 0;\n\t\t\tfor (h = 0; h <= i && h < S; h++)\n\t\t\t\tif (bb[i - ii[h]] == 1) {\n\t\t\t\t\tc = aa[ii[h]];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\tif (c == 0)\n\t\t\t\tfor (h = 0; h < k; h++)\n\t\t\t\t\tc = Math.max(c, aa[i - jj[h]]);\n\t\t\tpw.println(c);\n\t\t}\n\t\tpw.close();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["probabilities"], "code_uid": "afe7586fb3dde29383c0c0fc1078bfb9", "src_uid": "948ae7a0189ada07c8c67a1757f691f0", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class D {\n\n\n\n\tstatic final long mod = 1000000007;\n\n\tstatic class Doit{\n\t\tpublic void solve(int testNumber, InputReader in, PrintWriter out) {\n\n\n\n\t\t\tint n = Integer.parseInt(in.next());\n\t\t\tint k = Integer.parseInt(in.next());\n\n\n\t\t\tSet<String> set = new HashSet<>(); \n\t\t\tQueue<String> current = new ArrayDeque<>();\n\t\t\tcurrent.add(in.next());\n\n\t\t\tint cant = 1;\n\t\t\tint sum = 0;\n\n\t\t\tString sub, st = \"\";\n\n\n\t\t\twhile(!current.isEmpty() && cant < k) {\n\t\t\t\t\n\t\t\t\tst = current.remove();\n\t\t\t\t\n\t\t\t\tfor(int j = 0; j < st.length(); j++) {\t\n\t\t\t\t\tsub = ((st.length() == 1)? \"\" : st.substring(0, j) + st.substring(j + 1)); \n\t\t\t\t\tif(!set.contains(sub)) {\n\t\t\t\t\t\t//System.out.println(sub);\n\t\t\t\t\t\tset.add(sub);\n\t\t\t\t\t\tcurrent.add(sub);\n\t\t\t\t\t\tcant++;\t\n\t\t\t\t\t\tsum += n - sub.length() ;\n\t\t\t\t\t\tif(k == cant)break;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\tif(cant < k) {\n\t\t\t\tSystem.out.println(-1);\n\t\t\t}else {\n\t\t\t\tSystem.out.println(sum);\t\n\t\t\t}\n\t\t\t\n\t\t}\n\t}\n\n\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tDoit solver = new Doit();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\t\n\n\tstatic class InputReader {\n\t\tpublic BufferedReader reader;\n\t\tpublic StringTokenizer tokenizer;\n\n\t\tpublic InputReader(InputStream stream) {\n\t\t\treader = new BufferedReader(new InputStreamReader(stream), 32768);\n\t\t\ttokenizer = null;\n\t\t}\n\n\t\tpublic String next() {\n\t\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tokenizer.nextToken();\n\t\t}\n\n\t}\n}", "lang_cluster": "Java", "tags": ["dp", "implementation", "graphs", "shortest paths"], "code_uid": "457b53f090e0f4aead8c1fae92054936", "src_uid": "ae5d21919ecac431ea7507cb1b6dc72b", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class Busters {\n public static void main(String[] args) throws IOException {\n BufferedReader rd = new BufferedReader(new InputStreamReader(System.in));\n PrintWriter pw = new PrintWriter(System.out);\n StringTokenizer st = new StringTokenizer(rd.readLine());\n a = Integer.parseInt(st.nextToken());\n b = Integer.parseInt(st.nextToken());\n w = Integer.parseInt(st.nextToken());\n x = Integer.parseInt(st.nextToken());\n c = Integer.parseInt(st.nextToken());\n countPeriods();\n System.out.println(bin(0, Long.MAX_VALUE/1000));\n }\n \n static long bin(long a, long b){\n if(a==b) return a;\n if(b==a+1) return check(a) ? a : b;\n long m = (a+b)/2;\n return check(m) ? bin(a, m) : bin(m+1, b);\n }\n \n static boolean check(long X){\n long A = a - count(X), C = c-X;\n return C <= A;\n }\n \n static long count(long X){\n if(X<=P) return simulation((int)X);\n long res = 1L*S*(X/P);\n return res + count(X % P);\n }\n \n static int simulation(int X){\n int num = 0;\n int B = b;\n for(int i=0; i<X; i++){\n if(B>=x){\n B -= x;\n }\n else{\n B -= x;\n B += w;\n num++;\n }\n }\n return num;\n }\n \n static void countPeriods(){\n int curB = b;\n boolean first = true;\n while(true){\n if(curB==b && !first) break;\n first = false;\n if(curB >= x){\n curB -= x;\n P++;\n }\n else{\n P++;\n S++;\n curB -= x;\n curB += w;\n }\n }\n }\n \n static int P, S;\n \n static int a, b, w, x, c;\n \n}", "lang_cluster": "Java", "tags": ["math", "binary search"], "code_uid": "9ecd5e9e52ae1c1b71df76234ac15ba4", "src_uid": "a1db3dd9f8d0f0cad7bdeb1780707143", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\r\n\r\nimport java.io.*;\r\nimport java.lang.reflect.Array;\r\n\r\npublic class tr0 {\r\n\tstatic StringBuilder sb;\r\n\tstatic int inf = (int) 1e9;\r\n\tstatic int mod = 998244353;\r\n\tstatic int n, m, k;\r\n\tstatic ArrayList<Integer>[] ad;\r\n\tstatic long[] f, inv, memo[];\r\n\tstatic PrintWriter out;\r\n\r\n\tpublic static void main(String[] args) throws Exception {\r\n\t\tScanner sc = new Scanner(System.in);\r\n\t\tout = new PrintWriter(System.out);\r\n\t\tn = sc.nextInt();\r\n\t\tk = sc.nextInt();\r\n\t\tmemo = new long[n + 5][k + 5];\r\n\t\tf = new long[n + 4];\r\n\t\tinv = new long[n + 4];\r\n\t\tf[0] = 1;\r\n\t\tinv[0] = 1;\r\n\t\tfor (int i = 1; i < f.length; i++) {\r\n\t\t\tf[i] = (i * f[i - 1]) % mod;\r\n\t\t\tinv[i] = modPow(f[i], mod - 2);\r\n\t\t}\r\n\t\tfor (long[] a : memo)\r\n\t\t\tArrays.fill(a, -1);\r\n\t\tout.println(dp(0, 1));\r\n\t\tout.flush();\r\n\t}\r\n\r\n\tstatic long dp(int i, int ck) {\r\n\t\tif (i == n - 1)\r\n\t\t\treturn f[n - 1];\r\n\t\tif (ck > k)\r\n\t\t\treturn 0;\r\n\r\n\t\tif (memo[i][ck] != -1)\r\n\t\t\treturn memo[i][ck];\r\n\t\tlong ans = dp(i, ck + 1);\r\n\t\tfor (int j = 1; true; j++) {\r\n\t\t\tif (i + j > n - 1)\r\n\t\t\t\tbreak;\r\n\t\t\tlong tem = (dp(i + j, ck + 1) * inv[j]) % mod;\r\n\t\t\ttem = (tem * modPow(k - ck + 1, (j * (j - 1) / 2) + j * i)) % mod;\r\n\t\t\tans += tem;\r\n\t\t\tans %= mod;\r\n\t\t}\r\n\t\treturn memo[i][ck] = ans;\r\n\t}\r\n\r\n\tstatic long modPow(long a, long e)\r\n\r\n\t{\r\n\t\tlong res = 1;\r\n\t\twhile (e > 0) {\r\n\t\t\tif ((e & 1) == 1)\r\n\t\t\t\tres = (res * a) % mod;\r\n\t\t\ta = (a * a) % mod;\r\n\t\t\te >>= 1;\r\n\t\t}\r\n\t\treturn res;\r\n\t}\r\n\r\n\tstatic class Scanner {\r\n\t\tStringTokenizer st;\r\n\t\tBufferedReader br;\r\n\r\n\t\tpublic Scanner(InputStream system) {\r\n\t\t\tbr = new BufferedReader(new InputStreamReader(system));\r\n\t\t}\r\n\r\n\t\tpublic Scanner(String file) throws Exception {\r\n\t\t\tbr = new BufferedReader(new FileReader(file));\r\n\t\t}\r\n\r\n\t\tpublic String next() throws IOException {\r\n\t\t\twhile (st == null || !st.hasMoreTokens())\r\n\t\t\t\tst = new StringTokenizer(br.readLine());\r\n\t\t\treturn st.nextToken();\r\n\t\t}\r\n\r\n\t\tpublic String nextLine() throws IOException {\r\n\t\t\treturn br.readLine();\r\n\t\t}\r\n\r\n\t\tpublic int nextInt() throws IOException {\r\n\t\t\treturn Integer.parseInt(next());\r\n\t\t}\r\n\r\n\t\tpublic double nextDouble() throws IOException {\r\n\t\t\treturn Double.parseDouble(next());\r\n\t\t}\r\n\r\n\t\tpublic char nextChar() throws IOException {\r\n\t\t\treturn next().charAt(0);\r\n\t\t}\r\n\r\n\t\tpublic Long nextLong() throws IOException {\r\n\t\t\treturn Long.parseLong(next());\r\n\t\t}\r\n\r\n\t\tpublic int[] nextArrInt(int n) throws IOException {\r\n\t\t\tint[] a = new int[n];\r\n\t\t\tfor (int i = 0; i < n; i++)\r\n\t\t\t\ta[i] = nextInt();\r\n\t\t\treturn a;\r\n\t\t}\r\n\r\n\t\tpublic long[] nextArrLong(int n) throws IOException {\r\n\t\t\tlong[] a = new long[n];\r\n\t\t\tfor (int i = 0; i < n; i++)\r\n\t\t\t\ta[i] = nextLong();\r\n\t\t\treturn a;\r\n\t\t}\r\n\r\n\t\tpublic int[] nextArrIntSorted(int n) throws IOException {\r\n\t\t\tint[] a = new int[n];\r\n\t\t\tInteger[] a1 = new Integer[n];\r\n\t\t\tfor (int i = 0; i < n; i++)\r\n\t\t\t\ta1[i] = nextInt();\r\n\t\t\tArrays.sort(a1);\r\n\t\t\tfor (int i = 0; i < n; i++)\r\n\t\t\t\ta[i] = a1[i].intValue();\r\n\t\t\treturn a;\r\n\t\t}\r\n\r\n\t\tpublic long[] nextArrLongSorted(int n) throws IOException {\r\n\t\t\tlong[] a = new long[n];\r\n\t\t\tLong[] a1 = new Long[n];\r\n\t\t\tfor (int i = 0; i < n; i++)\r\n\t\t\t\ta1[i] = nextLong();\r\n\t\t\tArrays.sort(a1);\r\n\t\t\tfor (int i = 0; i < n; i++)\r\n\t\t\t\ta[i] = a1[i].longValue();\r\n\t\t\treturn a;\r\n\t\t}\r\n\r\n\t\tpublic boolean ready() throws IOException {\r\n\t\t\treturn br.ready();\r\n\t\t}\r\n\r\n\t\tpublic void waitForInput() throws InterruptedException {\r\n\t\t\tThread.sleep(3000);\r\n\t\t}\r\n\t}\r\n}", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics", "graph matchings"], "code_uid": "65f86f54ef5a6fbece890117e413f824", "src_uid": "b2d7ac8e75cbdb828067aeafd803ac62", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import static java.lang.Double.parseDouble;\nimport static java.lang.Integer.parseInt;\nimport static java.lang.Long.parseLong;\nimport static java.lang.Math.max;\nimport static java.lang.Math.min;\nimport static java.lang.System.exit;\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.StringTokenizer;\n\npublic class C {\n\t\n\tstatic BufferedReader in;\n\tstatic PrintWriter out;\n\tstatic StringTokenizer tok;\n\t\n\tstatic class Request {\n\t\tfinal int pin1, left1, right1, pin2, left2, right2;\n\t\t\n\t\tstatic final Map<Request, Integer> cache = new HashMap<Request, Integer>();\n\n\t\tRequest(int pin1, int left1, int right1, int pin2, int left2,\n\t\t\t\tint right2) {\n\t\t\tif (pin1 < pin2) {\n\t\t\t\tint t = pin1;\n\t\t\t\tpin1 = pin2;\n\t\t\t\tpin2 = t;\n\t\t\t\tt = left1;\n\t\t\t\tleft1 = left2;\n\t\t\t\tleft2 = t;\n\t\t\t\tt = right1;\n\t\t\t\tright1 = right2;\n\t\t\t\tright2 = t;\n\t\t\t}\n\t\t\tthis.pin1 = pin1;\n\t\t\tthis.left1 = left1;\n\t\t\tthis.right1 = right1;\n\t\t\tthis.pin2 = pin2;\n\t\t\tthis.left2 = left2;\n\t\t\tthis.right2 = right2;\n\t\t}\n\t\t\n\t\tRequest(int l1, int r1, int l2, int r2) {\n\t\t\tthis(pin(l1, r1), left(l1, r1), right(l1, r1), pin(l2, r2), left(l2, r2), right(l2, r2));\n\t\t}\n\t\t\n\t\tstatic int pin(int l, int r) {\n\t\t\tint pin = -1;\n\t\t\twhile (l <= r) {\n\t\t\t\tpin = Integer.numberOfTrailingZeros(l);\n\t\t\t\tl = (l | (l - 1)) + 1;\n\t\t\t}\n\t\t\treturn pin;\n\t\t}\n\t\t\n\t\tstatic int left(int l, int r) {\n\t\t\tint pin = pin(l, r);\n\t\t\tint pinMask = (1 << pin) - 1;\n\t\t\tint pinPos = (l + pinMask) & ~pinMask;\n\t\t\treturn pinPos - l;\n\t\t}\n\n\t\tstatic int right(int l, int r) {\n\t\t\tint pin = pin(l, r);\n\t\t\tint pinMask = (1 << pin) - 1;\n\t\t\tint pinPos = (l + pinMask) & ~pinMask;\n\t\t\treturn r - pinPos;\n\t\t}\n\t\t\n\t\tint getAns() {\n\t\t\tInteger ans = cache.get(this);\n\t\t\tif (ans != null) {\n\t\t\t\treturn ans;\n\t\t\t}\n\t\t\tans = doGetAns();\n\t\t\tcache.put(this, ans);\n\t\t\treturn ans;\n\t\t}\n\t\t\n\t\tint doGetAns() {\n\t\t\tint cans = 0;\n\t\t\tif (pin1 == pin2) {\n\t\t\t\tcans = 1 + min(left1, left2) + min(right1, right2);\n\t\t\t}\n\t\t\tif (left1 > 0) {\n\t\t\t\tcans = max(cans, new Request(-left1, -1, (1 << pin2) - left2, (1 << pin2) + right2).getAns());\n\t\t\t}\n\t\t\tif (right1 > 0) {\n\t\t\t\tcans = max(cans, new Request(1, right1, (1 << pin2) - left2, (1 << pin2) + right2).getAns());\n\t\t\t}\n\t\t\treturn cans;\n\t\t}\n\n\t\tpublic int hashCode() {\n\t\t\tfinal int prime = 31;\n\t\t\tint result = 1;\n\t\t\tresult = prime * result + left1;\n\t\t\tresult = prime * result + left2;\n\t\t\tresult = prime * result + pin1;\n\t\t\tresult = prime * result + pin2;\n\t\t\tresult = prime * result + right1;\n\t\t\tresult = prime * result + right2;\n\t\t\treturn result;\n\t\t}\n\n\t\tpublic boolean equals(Object obj) {\n\t\t\tif (this == obj)\n\t\t\t\treturn true;\n\t\t\tif (obj == null)\n\t\t\t\treturn false;\n\t\t\tif (getClass() != obj.getClass())\n\t\t\t\treturn false;\n\t\t\tRequest other = (Request) obj;\n\t\t\tif (left1 != other.left1)\n\t\t\t\treturn false;\n\t\t\tif (left2 != other.left2)\n\t\t\t\treturn false;\n\t\t\tif (pin1 != other.pin1)\n\t\t\t\treturn false;\n\t\t\tif (pin2 != other.pin2)\n\t\t\t\treturn false;\n\t\t\tif (right1 != other.right1)\n\t\t\t\treturn false;\n\t\t\tif (right2 != other.right2)\n\t\t\t\treturn false;\n\t\t\treturn true;\n\t\t}\n\t}\n\t\n\tstatic void solve() throws Exception {\n\t\tout.print(new Request(nextInt(), nextInt(), nextInt(), nextInt()).getAns());\n\t}\n\t\n\tstatic int nextInt() throws IOException {\n\t\treturn parseInt(next());\n\t}\n\n\tstatic long nextLong() throws IOException {\n\t\treturn parseLong(next());\n\t}\n\n\tstatic double nextDouble() throws IOException {\n\t\treturn parseDouble(next());\n\t}\n\n\tstatic String next() throws IOException {\n\t\twhile (tok == null || !tok.hasMoreTokens()) {\n\t\t\ttok = new StringTokenizer(in.readLine());\n\t\t}\n\t\treturn tok.nextToken();\n\t}\n\n\tpublic static void main(String[] args) {\n\t\ttry {\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(new OutputStreamWriter(System.out));\n\t\t\tsolve();\n\t\t\tin.close();\n\t\t\tout.close();\n\t\t} catch (Throwable e) {\n\t\t\te.printStackTrace();\n\t\t\texit(1);\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["divide and conquer"], "code_uid": "223d17fde4853999285c4fe023bce3ec", "src_uid": "fe3c0c4c7e9b3afebf2c958251f10513", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\nimport java.util.*;\nimport java.lang.*; \nimport java.util.regex.Pattern;\nimport java.text.DecimalFormat;\nimport java.util.stream.IntStream;\npublic class Main{ \npublic static void main(String[] args)\n{ Scanner scanner=new Scanner(System.in);\n String w1=scanner.next();\n String w2=scanner.next();\n String l1[] = w1.split(\":\"); \n String l2[] = w2.split(\":\"); \n int h1= Integer.parseInt(l1[0]);\n int m1= Integer.parseInt(l1[1]);\n int h2= Integer.parseInt(l2[0]);\n int m2= Integer.parseInt(l2[1]);\n int mi=h1*60+m1;\n int mf=h2*60+m2;\n int mid=(mf-mi)/2;\n int ans1=h1+(mid)/60;\n int ans2=m1+(mid)%60;\n if(ans2>=60)\n {ans1++;\n ans2=ans2%60;}\n if(ans1<10)\n System.out.print(\"0\"+ans1);\n else System.out.print(ans1);\n System.out.print(\":\");\n if(ans2<10)\n System.out.print(\"0\"+ans2);\n else System.out.print(ans2);\n }\n}\n\n\n\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "4e886b128164166bea3d751dec3488b2", "src_uid": "f7a32a8325ce97c4c50ce3a5c282ec50", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.UncheckedIOException;\nimport java.io.Closeable;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.math.BigInteger;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) throws Exception {\n Thread thread = new Thread(null, new TaskAdapter(), \"\", 1 << 29);\n thread.start();\n thread.join();\n }\n\n static class TaskAdapter implements Runnable {\n @Override\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastInput in = new FastInput(inputStream);\n FastOutput out = new FastOutput(outputStream);\n FTheSumOfTheKThPowers solver = new FTheSumOfTheKThPowers();\n solver.solve(1, in, out);\n out.close();\n }\n }\n\n static class FTheSumOfTheKThPowers {\n public void solve(int testNumber, FastInput in, FastOutput out) {\n int mod = (int) (1e9 + 7);\n int n = in.readInt();\n int k = in.readInt();\n\n if (k == 0) {\n out.println(n);\n return;\n }\n\n Power power = new Power(mod);\n int[] y = new int[k + 2];\n for (int i = 0; i <= k + 1; i++) {\n y[i] = power.pow(i, k);\n }\n for (int i = 1; i <= k + 1; i++) {\n y[i] = DigitUtils.modplus(y[i - 1], y[i], mod);\n }\n\n ModContinuousInterpolation interpolation = new ModContinuousInterpolation(0, y, mod);\n\n int ans = interpolation.interpolate(n);\n out.println(ans);\n }\n\n }\n\n static interface InverseNumber {\n }\n\n static class FastOutput implements AutoCloseable, Closeable, Appendable {\n private StringBuilder cache = new StringBuilder(10 << 20);\n private final Writer os;\n\n public FastOutput append(CharSequence csq) {\n cache.append(csq);\n return this;\n }\n\n public FastOutput append(CharSequence csq, int start, int end) {\n cache.append(csq, start, end);\n return this;\n }\n\n public FastOutput(Writer os) {\n this.os = os;\n }\n\n public FastOutput(OutputStream os) {\n this(new OutputStreamWriter(os));\n }\n\n public FastOutput append(char c) {\n cache.append(c);\n return this;\n }\n\n public FastOutput append(int c) {\n cache.append(c);\n return this;\n }\n\n public FastOutput println(int c) {\n return append(c).println();\n }\n\n public FastOutput println() {\n cache.append(System.lineSeparator());\n return this;\n }\n\n public FastOutput flush() {\n try {\n os.append(cache);\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n return this;\n }\n\n public void close() {\n flush();\n try {\n os.close();\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n\n public String toString() {\n return cache.toString();\n }\n\n }\n\n static class FastInput {\n private final InputStream is;\n private byte[] buf = new byte[1 << 13];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastInput(InputStream is) {\n this.is = is;\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n bufLen = -1;\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public int readInt() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n }\n\n static class DigitUtils {\n private DigitUtils() {\n }\n\n public static int negate(int x, int mod) {\n return x == 0 ? 0 : mod - x;\n }\n\n public static int modsub(int a, int b, int mod) {\n int ans = a - b;\n if (ans < 0) {\n ans += mod;\n }\n return ans;\n }\n\n public static int modplus(int a, int b, int mod) {\n int ans = a + b;\n if (ans >= mod) {\n ans -= mod;\n }\n return ans;\n }\n\n }\n\n static class Power implements InverseNumber {\n int mod;\n\n public Power(Modular modular) {\n this.mod = modular.getMod();\n }\n\n public Power(int mod) {\n this(new Modular(mod));\n }\n\n public int pow(int x, int n) {\n if (n == 0) {\n return 1 % mod;\n }\n long r = pow(x, n >> 1);\n r = r * r % mod;\n if ((n & 1) == 1) {\n r = r * x % mod;\n }\n return (int) r;\n }\n\n }\n\n static class Modular {\n int m;\n\n public int getMod() {\n return m;\n }\n\n public Modular(int m) {\n this.m = m;\n }\n\n public Modular(long m) {\n this.m = (int) m;\n if (this.m != m) {\n throw new IllegalArgumentException();\n }\n }\n\n public Modular(double m) {\n this.m = (int) m;\n if (this.m != m) {\n throw new IllegalArgumentException();\n }\n }\n\n public String toString() {\n return \"mod \" + m;\n }\n\n }\n\n static class Factorial {\n int[] fact;\n int[] inv;\n int mod;\n\n public Factorial(int[] fact, int[] inv, int mod) {\n this.mod = mod;\n this.fact = fact;\n this.inv = inv;\n fact[0] = inv[0] = 1;\n int n = Math.min(fact.length, mod);\n for (int i = 1; i < n; i++) {\n fact[i] = i;\n fact[i] = (int) ((long) fact[i] * fact[i - 1] % mod);\n }\n inv[n - 1] = BigInteger.valueOf(fact[n - 1]).modInverse(BigInteger.valueOf(mod)).intValue();\n for (int i = n - 2; i >= 1; i--) {\n inv[i] = (int) ((long) inv[i + 1] * (i + 1) % mod);\n }\n }\n\n public Factorial(int limit, int mod) {\n this(new int[limit + 1], new int[limit + 1], mod);\n }\n\n public int invFact(int n) {\n return inv[n];\n }\n\n }\n\n static class ModContinuousInterpolation {\n private int x0;\n private int[] y;\n private int mod;\n private int[] pre;\n private int[] post;\n private Factorial fact;\n\n public ModContinuousInterpolation(int x0, int[] y, int mod) {\n this(x0, y, mod, new Factorial(y.length - 1, mod));\n }\n\n public ModContinuousInterpolation(int x0, int[] y, int mod, Factorial fact) {\n this.x0 = x0;\n this.y = y;\n this.mod = mod;\n\n int n = y.length;\n pre = new int[n];\n post = new int[n];\n this.fact = fact;\n }\n\n public int interpolate(int x) {\n x = DigitUtils.modsub(x, x0, mod);\n int n = y.length;\n if (x < n) {\n return y[x];\n }\n\n for (int i = 0; i < n; i++) {\n pre[i] = post[i] = DigitUtils.modsub(x, i, mod);\n }\n for (int i = 1; i < n; i++) {\n pre[i] = (int) ((long) pre[i - 1] * pre[i] % mod);\n post[n - i - 1] = (int) ((long) post[n - i - 1] * post[n - i] % mod);\n }\n\n long sum = 0;\n for (int i = 0; i < n; i++) {\n int local = (int) ((long) y[i] * fact.invFact(i) % mod * fact.invFact(n - 1 - i) % mod);\n if (i > 0) {\n local = (int) ((long) local * pre[i - 1] % mod);\n }\n if (i + 1 < n) {\n local = (int) ((long) local * post[i + 1] % mod);\n }\n if (((n - 1 - i) & 1) == 1) {\n local = DigitUtils.negate(local, mod);\n }\n sum += local;\n }\n\n return (int) (sum % mod);\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "e5af1e96de520f404ada865e2a0db682", "src_uid": "6f6fc42a367cdce60d76fd1914e73f0c", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayDeque;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.List;\n\npublic class Main {\n\n\tprivate static final String NO = \"NO\";\n\tprivate static final String YES = \"YES\";\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\n\tprivate static final long MOD = 1000000007;\n\tprivate static final long inf = 100000000000L;\n\tprivate static final int max_coord = 50;\n\n\tvoid solve() {\n\t\tint T = 1;\n\t\tfor (int i = 0; i < T; i++)\n\t\t\tsolve(i);\n\t}\n\n\tint n;\n\n\tvoid solve(int T) {\n\t\tn = ni();\n\t\tint a[][] = na(2, 2);\n\t\tif (a[0][0] == a[1][0]) {\n\t\t\tout.println(YES);\n\t\t\treturn;\n\t\t}\n\t\tfor (; a[0][0] != a[0][1] && a[1][0] != a[1][1];) {\n\t\t\ta[0][0]++;\n\t\t\tif (a[0][0] > n)\n\t\t\t\ta[0][0] = 1;\n\t\t\ta[1][0]--;\n\t\t\tif (a[1][0] <= 0)\n\t\t\t\ta[1][0] = n;\n\t\t\tif (a[0][0] == a[1][0]) {\n\t\t\t\tout.println(YES);\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tout.println(NO);\n\t}\n\n\t// a^b\n\tlong power(long a, long b) {\n\t\tlong x = 1, y = a;\n\t\twhile (b > 0) {\n\t\t\tif (b % 2 != 0) {\n\t\t\t\tx = (x * y) % MOD;\n\t\t\t}\n\t\t\ty = (y * y) % MOD;\n\t\t\tb /= 2;\n\t\t}\n\t\treturn x % MOD;\n\t}\n\n\tprivate long gcd(long a, long b) {\n\t\twhile (a != 0) {\n\t\t\tlong tmp = b % a;\n\t\t\tb = a;\n\t\t\ta = tmp;\n\t\t}\n\t\treturn b;\n\t}\n\n\tvoid run() throws Exception {\n\t\tis = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\tif (!INPUT.isEmpty())\n\t\t\ttr(System.currentTimeMillis() - s + \"ms\");\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tnew Main().run();\n\t}\n\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\tprivate boolean vis[];\n\n\tprivate int readByte() {\n\t\tif (lenbuf == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (ptrbuf >= lenbuf) {\n\t\t\tptrbuf = 0;\n\t\t\ttry {\n\t\t\t\tlenbuf = is.read(inbuf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (lenbuf <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\n\tprivate boolean isSpaceChar(int c) {\n\t\treturn !(c >= 33 && c <= 126);\n\t}\n\n\tprivate int skip() {\n\t\tint b;\n\t\twhile ((b = readByte()) != -1 && isSpaceChar(b))\n\t\t\t;\n\t\treturn b;\n\t}\n\n\tprivate double nd() {\n\t\treturn Double.parseDouble(ns());\n\t}\n\n\tprivate char nc() {\n\t\treturn (char) skip();\n\t}\n\n\tprivate String ns() {\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile (!(isSpaceChar(b))) { // when nextLine, (isSpaceChar(b) && b != '\n\t\t\t\t\t\t\t\t\t// ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tprivate char[] ns(int n) {\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile (p < n) {\n\t\t\tif (!(isSpaceChar(b)))\n\t\t\t\tbuf[p++] = (char) b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\n\tprivate char[][] nm(int n, int m) {\n\t\tchar[][] map = new char[n][];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tmap[i] = ns(m);\n\t\treturn map;\n\t}\n\n\tprivate int[] na(int n) {\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = ni();\n\t\treturn a;\n\t}\n\n\tprivate List<Integer> na2(int n) {\n\t\tList<Integer> a = new ArrayList<Integer>();\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta.add(ni());\n\t\treturn a;\n\t}\n\n\tprivate int[][] na(int n, int m) {\n\t\tint[][] a = new int[n][];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = na(m);\n\t\treturn a;\n\t}\n\n\tprivate int ni() {\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tprivate long[] nl(int n) {\n\t\tlong[] a = new long[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = nl();\n\t\treturn a;\n\t}\n\n\tprivate long[][] nl(int n, int m) {\n\t\tlong[][] a = new long[n][];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = nl(m);\n\t\treturn a;\n\t}\n\n\tprivate long nl() {\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tprivate static void tr(Object... o) {\n\t\tSystem.out.println(Arrays.deepToString(o));\n\t}\n\n\tpublic class Pair<K, V> {\n\n\t\t/**\n\t\t * Key of this <code>Pair</code>.\n\t\t */\n\t\tprivate K key;\n\n\t\t/**\n\t\t * Gets the key for this pair.\n\t\t * \n\t\t * @return key for this pair\n\t\t */\n\t\tpublic K getKey() {\n\t\t\treturn key;\n\t\t}\n\n\t\t/**\n\t\t * Value of this this <code>Pair</code>.\n\t\t */\n\t\tprivate V value;\n\n\t\t/**\n\t\t * Gets the value for this pair.\n\t\t * \n\t\t * @return value for this pair\n\t\t */\n\t\tpublic V getValue() {\n\t\t\treturn value;\n\t\t}\n\n\t\t/**\n\t\t * Creates a new pair\n\t\t * \n\t\t * @param key The key for this pair\n\t\t * @param value The value to use for this pair\n\t\t */\n\t\tpublic Pair(K key, V value) {\n\t\t\tthis.key = key;\n\t\t\tthis.value = value;\n\t\t}\n\n\t\t/**\n\t\t * <p>\n\t\t * <code>String</code> representation of this <code>Pair</code>.\n\t\t * </p>\n\t\t *\n\t\t * <p>\n\t\t * The default name/value delimiter '=' is always used.\n\t\t * </p>\n\t\t *\n\t\t * @return <code>String</code> representation of this <code>Pair</code>\n\t\t */\n\t\t@Override\n\t\tpublic String toString() {\n\t\t\treturn key + \"=\" + value;\n\t\t}\n\n\t\t/**\n\t\t * <p>\n\t\t * Generate a hash code for this <code>Pair</code>.\n\t\t * </p>\n\t\t *\n\t\t * <p>\n\t\t * The hash code is calculated using both the name and the value of the\n\t\t * <code>Pair</code>.\n\t\t * </p>\n\t\t *\n\t\t * @return hash code for this <code>Pair</code>\n\t\t */\n\t\t@Override\n\t\tpublic int hashCode() {\n\t\t\t// name's hashCode is multiplied by an arbitrary prime number (13)\n\t\t\t// in order to make sure there is a difference in the hashCode between\n\t\t\t// these two parameters:\n\t\t\t// name: a value: aa\n\t\t\t// name: aa value: a\n\t\t\treturn key.hashCode() * 13 + (value == null ? 0 : value.hashCode());\n\t\t}\n\n\t\t/**\n\t\t * <p>\n\t\t * Test this <code>Pair</code> for equality with another <code>Object</code>.\n\t\t * </p>\n\t\t *\n\t\t * <p>\n\t\t * If the <code>Object</code> to be tested is not a <code>Pair</code> or is\n\t\t * <code>null</code>, then this method returns <code>false</code>.\n\t\t * </p>\n\t\t *\n\t\t * <p>\n\t\t * Two <code>Pair</code>s are considered equal if and only if both the names and\n\t\t * values are equal.\n\t\t * </p>\n\t\t *\n\t\t * @param o the <code>Object</code> to test for equality with this\n\t\t * <code>Pair</code>\n\t\t * @return <code>true</code> if the given <code>Object</code> is equal to this\n\t\t * <code>Pair</code> else <code>false</code>\n\t\t */\n\t\t@Override\n\t\tpublic boolean equals(Object o) {\n\t\t\tif (this == o)\n\t\t\t\treturn true;\n\t\t\tif (o instanceof Pair) {\n\t\t\t\tPair pair = (Pair) o;\n\t\t\t\tif (key != null ? !key.equals(pair.key) : pair.key != null)\n\t\t\t\t\treturn false;\n\t\t\t\tif (value != null ? !value.equals(pair.value) : pair.value != null)\n\t\t\t\t\treturn false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t}\n\n}", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "64a3f00fb9055fe61e4b14455359b51e", "src_uid": "5b889751f82c9f32f223cdee0c0095e4", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Scanner;\n\n\npublic class Sum {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n \n String v1 = sc.next();\n String v2 = sc.next();\n \n int max = 0;\n max = getMaxDigit(v1);\n max = max > getMaxDigit(v2) ? max : getMaxDigit(v2) ;\n \n int base = max +1;\n// System.out.println(base);\n \n \n int number1 = Integer.parseInt(v1, base);\n int number2 = Integer.parseInt(v2, base);\n\n int sum = number1 + number2;\n System.out.println(Integer.toString(sum, base).length());\n\n }\n\n private static int getMaxDigit(String number) {\n \n int max =0;\n \n for(int i =0 ; i< number.length(); i++){\n int v = number.charAt(i) - '0' ;\n if(v > max) max = v;\n }\n return max;\n }\n\n}\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "948cf8ba3f245a2fa828de828719ec50", "src_uid": "8ccfb9b1fef6a992177cc49bd56fab7b", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.BufferedWriter;\nimport java.io.FileReader;\nimport java.io.FileWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\nimport java.util.TreeSet;\n/*\n * Java Input / Output Class using Buffered/ Input Straem\n * Created by @neelbhallabos\n * File Created at: Mar 25, 2019\n */\npublic class BrickEnumeration {\n\tpublic static BufferedReader sc = new BufferedReader(new InputStreamReader(System.in));\n\tpublic static StringTokenizer st;\n\tpublic static PrintWriter pw = new PrintWriter(System.out);\n\tfinal static boolean debugmode = true;\n\tpublic static int k = 7; // for 10^9 + k mods.\n\tpublic static long STMOD = 1000000000 + k; // 10^9 + k\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tint nbricks = getInt();\n\t\tint paintbuckets = getInt();\n\t\tint numtransitions = getInt();\n\t\tlong[][] dp = new long[nbricks][numtransitions + 1];\n\t\tdp[0][0] = paintbuckets; // the first brick will have 0 transitions\n\t\tfor(int cbrick = 1; cbrick < nbricks;cbrick++) {\n\t\t\t// handle the no transition case prior.\n\t\t\tdp[cbrick][0] = dp[cbrick-1][0];\n\t\t\tfor(int ctransition = 1; ctransition <numtransitions + 1;ctransition++) {\n\t\t\t\t\n\t\t\t\t\tdp[cbrick][ctransition] = dp[cbrick-1][ctransition];\n\t\t\t\t\tdp[cbrick][ctransition] %= 998244353;\n\t\t\t\t\tdp[cbrick][ctransition] += dp[cbrick-1][ctransition -1] * (paintbuckets-1);\n\t\t\t\t\tdp[cbrick][ctransition] %= 998244353;\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\t\n\t\tsubmit(dp[dp.length-1][numtransitions],true);\n\t}\n\tpublic static int nchoosekmod(int n, int k, int mod) {\n\t\t//(n!)/ (n-k)! k!\n\t\tint res = 1; \n\t \n // Since C(n, k) = C(n, n-k) \n if ( k > n - k ) \n k = n - k; \n \n // Calculate value of [n * (n-1) *---* (n-k+1)] / [k * (k-1) *----* 1] \n for (int i = 0; i < k; ++i) \n { \n res *= (n - i); \n res /= (i + 1); \n res %= mod;\n \n } \n \n return res; \n\t\t\n\t}\n\tpublic static void setInputFile(String fn) throws IOException {\n\t\tsc = new BufferedReader(new FileReader(fn));\n\t}\n\n\tpublic static void setOutputFile(String fn) throws IOException {\n\t\tpw = new PrintWriter(new BufferedWriter(new FileWriter(fn)));\n\t}\n\n\tpublic static int GCD(int a, int b) {\n\t\tif (b == 0)\n\t\t\treturn a;\n\t\treturn GCD(b, a % b);\n\t}\n\n\tpublic static double log(int k, int v) {\n\t\treturn Math.log(k) / Math.log(v);\n\t}\n\n\tpublic static long longpower(int a, int b) {\n\t\tlong[] vals = new long[(int) (log(b, 2) + 2)];\n\t\tvals[0] = a;\n\t\tvals[1] = a * a;\n\t\tfor (int i = 1; i < vals.length; i++) {\n\t\t\tvals[i] = vals[i - 1] * vals[i - 1];\n\t\t}\n\t\tlong ans = 1;\n\t\tint cindex = 0;\n\t\twhile (b != 0) {\n\t\t\tif (b % 2 == 1) {\n\t\t\t\tans *= vals[cindex];\n\t\t\t}\n\t\t\tcindex += 1;\n\t\t\tb /= 2;\n\t\t}\n\t\treturn ans;\n\n\t}\n\n\tpublic static void debug(String toPrint) {\n\t\tif (!debugmode) {\n\t\t\treturn;\n\t\t}\n\t\tpw.println(\"[DEBUG]: \" + toPrint);\n\t}\n\n\tpublic static void submit(int[] k, boolean close) {\n\t\tpw.println(Arrays.toString(k));\n\t\tif (close) {\n\t\t\tpw.close();\n\t\t}\n\t}\n\n\tpublic static void submit(int p, boolean close) {\n\t\tpw.println(Integer.toString(p));\n\t\tif (close) {\n\t\t\tpw.close();\n\t\t}\n\t}\n\n\tpublic static void submit(String k, boolean close) {\n\t\tpw.println(k);\n\t\tif (close) {\n\t\t\tpw.close();\n\t\t}\n\t}\n\n\tpublic static void submit(double u, boolean close) {\n\t\tpw.println(Double.toString(u));\n\t\tif (close) {\n\t\t\tpw.close();\n\t\t}\n\t}\n\n\tpublic static void submit(long lng, boolean close) {\n\t\tpw.println(Long.toString(lng));\n\t\tif (close) {\n\t\t\tpw.close();\n\t\t}\n\n\t}\n\n\tpublic static void submit() {\n\t\tpw.close();\n\t}\n\n\tpublic static int getInt() throws IOException {\n\t\tif (st != null && st.hasMoreTokens()) {\n\t\t\treturn Integer.parseInt(st.nextToken());\n\t\t}\n\t\tst = new StringTokenizer(sc.readLine());\n\t\treturn Integer.parseInt(st.nextToken());\n\t}\n\n\tpublic static long getLong() throws IOException {\n\t\tif (st != null && st.hasMoreTokens()) {\n\t\t\treturn Long.parseLong(st.nextToken());\n\t\t}\n\t\tst = new StringTokenizer(sc.readLine());\n\t\treturn Long.parseLong(st.nextToken());\n\t}\n\n\tpublic static double getDouble() throws IOException {\n\t\tif (st != null && st.hasMoreTokens()) {\n\t\t\treturn Double.parseDouble(st.nextToken());\n\t\t}\n\t\tst = new StringTokenizer(sc.readLine());\n\t\treturn Double.parseDouble(st.nextToken());\n\t}\n\n\tpublic static String getString() throws IOException {\n\t\tif (st != null && st.hasMoreTokens()) {\n\t\t\treturn st.nextToken();\n\t\t}\n\t\tst = new StringTokenizer(sc.readLine());\n\t\treturn st.nextToken();\n\t}\n\n\tpublic static String getLine() throws IOException {\n\t\treturn sc.readLine();\n\t}\n\n\tpublic static int[][] readMatrix(int lines, int cols) throws IOException {\n\t\tint[][] matrr = new int[lines][cols];\n\t\tfor (int i = 0; i < lines; i++) {\n\t\t\tfor (int j = 0; j < cols; j++) {\n\t\t\t\tmatrr[i][j] = getInt();\n\t\t\t}\n\t\t}\n\t\treturn matrr;\n\t}\n\n\tpublic static int[] readArray(int lines) throws IOException {\n\t\tint[] ar = new int[lines];\n\t\tfor (int i = 0; i < lines; i++)\n\t\t\tar[i] = getInt();\n\t\treturn ar;\n\t}\n\n}\n/*\n\npublic class BrickEnumeration {\n\n}\n\n*/", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics"], "code_uid": "b51561ff2ab595c64ef1d7119f5890b5", "src_uid": "b2b9bee53e425fab1aa4d5468b9e578b", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class Main {\n private static final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n private static StringTokenizer st = new StringTokenizer(\"\");\n\n public static void main(String[] args) {\n int k = ni();\n int p = ni();\n long sum = 0;\n for (int i = 1; i <= k; i++) {\n String s = Long.toString(i);\n sum = (sum + Long.parseLong(s + new StringBuilder(s).reverse())) % p;\n }\n System.out.println(sum);\n }\n\n private static String ns() {\n while (!st.hasMoreTokens()) try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException ignored) {\n }\n return st.nextToken();\n }\n\n private static int ni() {\n return Integer.parseInt(ns());\n }\n\n private static long nl() {\n return Long.parseLong(ns());\n }\n}", "lang_cluster": "Java", "tags": ["brute force"], "code_uid": "a36def9bca89d33244599c29884d54da", "src_uid": "00e90909a77ce9e22bb7cbf1285b0609", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n TaskD solver = new TaskD();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskD {\n final int maxValue = 20;\n final int mod = (int) (1e9 + 7);\n int n;\n int[] s;\n int[][] dp;\n\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n// StringBuilder sb = new StringBuilder();\n// for (int i = 1; ; i++) {\n// String s = Integer.toBinaryString(i);\n// if (maxLength < sb.length() + s.length()) {\n// out.printLine(\"MAX_VAL: \" + (i - 1));\n// out.printLine(\"CNT CUT: \" + i);\n// break;\n// }\n// sb.append(s);\n//// out.printLine(i, s);\n// }\n\n n = in.readInt();\n s = new int[n];\n for (int i = 0; i < n; i++) {\n s[i] = in.readCharacter() - '0';\n }\n dp = new int[n + 1][1 << maxValue];\n dp[n][0] = 1;\n int ans = 0;\n for (int pos = n - 1; 0 <= pos; pos--) {\n for (int msk = 0; msk < (1 << maxValue); msk++) {\n int dp_take_msk;\n if (msk == 0) {\n dp_take_msk = 1;\n } else {\n if (s[pos] == 0) {\n dp_take_msk = dp[pos + 1][msk];\n } else {\n dp_take_msk = 0;\n int val = 0;\n for (int i = pos; i < n; ++i) {\n val = (val << 1) | s[i];\n if (maxValue < val) {\n break;\n }\n if (0 < val && (msk & (1 << (val - 1))) != 0) {\n dp_take_msk += dp[i + 1][msk ^ (1 << (val - 1))];\n if (mod <= dp_take_msk) {\n dp_take_msk -= mod;\n }\n dp_take_msk += dp[i + 1][msk];\n if (mod <= dp_take_msk) {\n dp_take_msk -= mod;\n }\n }\n }\n }\n }\n dp[pos][msk] = dp_take_msk;\n if (msk != 0 && (msk & (msk + 1)) == 0) {\n ans += dp_take_msk;\n if (mod <= ans) {\n ans -= mod;\n }\n }\n }\n }\n out.printLine(ans);\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void printLine(int i) {\n writer.println(i);\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if ((c < '0') || (c > '9')) {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return (c == ' ') || (c == '\\n') || (c == '\\r') || (c == '\\t') || (c == -1);\n }\n\n public char readCharacter() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n return (char) c;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["dp", "bitmasks"], "code_uid": "8900766e70eb344ec6a40d3cdf58dc83", "src_uid": "61f88159762cbc7c51c36e7b56ecde48", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.*;\nimport java.util.stream.IntStream;\n\npublic class Main {\n\n public static void main(String args[]) {\n Scanner in = new Scanner(System.in);\n int n = in.nextInt();\n int h = in.nextInt();\n int m = in.nextInt();\n int[] a = IntStream.rangeClosed(1, n).toArray();\n Arrays.fill(a, h);\n while (m-- > 0) {\n int l = in.nextInt();\n int r = in.nextInt();\n int x = in.nextInt();\n for (int i = l; i <= r; i++) {\n a[i - 1] = Math.min(a[i - 1], x);\n }\n }\n System.out.println(Arrays.stream(a).reduce(0, (x, y) -> x + (int) Math.pow(y, 2)));\n }\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "5393f7e26bc554bdf23f8081d56b9642", "src_uid": "f22b6dab443f63fb8d2d288b702f20ad", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\nimport java.util.HashMap;\n\npublic class Main \n{\n static class Reader \n { \n private InputStream mIs;private byte[] buf = new byte[1024];private int curChar,numChars;public Reader() { this(System.in); }public Reader(InputStream is) { mIs = is;} \n public int read() {if (numChars == -1) throw new InputMismatchException();if (curChar >= numChars) {curChar = 0;try { numChars = mIs.read(buf);} catch (IOException e) { throw new InputMismatchException();}if (numChars <= 0) return -1; }return buf[curChar++];} \n public String nextLine(){int c = read();while (isSpaceChar(c)) c = read();StringBuilder res = new StringBuilder();do {res.appendCodePoint(c);c = read();}while (!isEndOfLine(c));return res.toString() ;} \n public String s(){int c = read();while (isSpaceChar(c)) c = read();StringBuilder res = new StringBuilder();do {res.appendCodePoint(c);c = read();}while (!isSpaceChar(c));return res.toString();} \n public long l(){int c = read();while (isSpaceChar(c)) c = read();int sgn = 1;if (c == '-') { sgn = -1 ; c = read() ; }long res = 0; do{ if (c < '0' || c > '9') throw new InputMismatchException();res *= 10 ; res += c - '0' ; c = read();}while(!isSpaceChar(c));return res * sgn;} \n public int i(){int c = read() ;while (isSpaceChar(c)) c = read();int sgn = 1;if (c == '-') { sgn = -1 ; c = read() ; }int res = 0;do{if (c < '0' || c > '9') throw new InputMismatchException();res *= 10 ; res += c - '0' ; c = read() ;}while(!isSpaceChar(c));return res * sgn;} \n public double d() throws IOException {return Double.parseDouble(s()) ;}\n public boolean isSpaceChar(int c) { return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1; } \n public boolean isEndOfLine(int c) { return c == '\\n' || c == '\\r' || c == -1; } \n } \n \n ///////////////////////////////////////////////////////////////////////////////////////////////////////////////\n \n public static void main(String args[])\n {\n Reader sc=new Reader();\n PrintWriter out=new PrintWriter(System.out);\n int n=sc.i();\n int min=1000000000;\n for(int i=1;i<=Math.sqrt(n);i++)\n {\n if(n%i==0)\n min=Math.min(min,n/i-i);\n }\n for(int i=1;i<=Math.sqrt(n);i++)\n {\n if(n%i==0)\n {\n if(min==n/i-i)\n {\n System.out.println(i+\" \"+n/i);\n System.exit(0);\n }\n }\n }\n }\n \n}", "lang_cluster": "Java", "tags": ["brute force", "math"], "code_uid": "0e13769d9859cbf4f3a9eda7da6205cf", "src_uid": "f52af273954798a4ae38a1378bfbf77a", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.HashSet;\nimport java.util.StringTokenizer;\n\n\npublic class Abood2D {\n\t\n\tstatic int n, min[], G[], pG[];\n\t\n\tstatic int solve(int c) {\n\t\tif(G[c] != -1)\n\t\t\treturn G[c];\n\t\t\n\t\tHashSet<Integer> set = new HashSet<>();\n\t\t\n\t\tmin[c] = c;\n\t\t\n\t\tfor (int i = 2, j = 3; j <= c; j += ++i) \n\t\t\tif((c - j) % i == 0) {\n\t\t\t\tint l = 1 + (c - j) / i;\n\t\t\t\tint r = i + (c - j) / i;\n\t\t\t\t\n\t\t\t\tint x = pG[r] ^ pG[l - 1];\n\t\t\t\t\n\t\t\t\tif(x == 0)\n\t\t\t\t\tmin[c] = Math.min(min[c], i);\n\t\t\t\t\n\t\t\t\tset.add(x);\n\t\t\t}\n\t\t\n\t\tint ans = 0;\n\t\twhile(set.contains(ans))ans++;\n\t\t\n\t\treturn G[c] = ans;\n\t\t\n\t}\n\tpublic static void main(String[] args) throws IOException {\n\t\tScanner sc = new Scanner(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\t\n\t\tn = sc.nextInt();\n\t\t\n\t\tG = new int[(int) 1e6 + 1];\n\t\tpG = new int[(int) 1e6 + 1];\n\t\tmin = new int[(int) 1e6 + 1];\n\t\t\n\t\tArrays.fill(G, -1);\n\t\t\n\t\tfor (int i = 1; i <= n; i++) \n\t\t\tpG[i] = pG[i - 1] ^ solve(i);\n\t\t\n\t\tif(G[n] != 0)\n\t\t\tout.println(min[n]);\n\t\telse\n\t\t\tout.println(-1);\n\t\t\n\t\tout.flush();\n\n\t}\n\n\n\n\tstatic class Scanner \n\n\n\n\t{\n\t\tStringTokenizer st;\n\t\tBufferedReader br;\n\n\t\tpublic Scanner(InputStream s){\tbr = new BufferedReader(new InputStreamReader(s));}\n\n\t\tpublic String next() throws IOException \n\t\t{\n\t\t\twhile (st == null || !st.hasMoreTokens()) \n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {return Integer.parseInt(next());}\n\n\t\tpublic long nextLong() throws IOException {return Long.parseLong(next());}\n\n\t\tpublic String nextLine() throws IOException {return br.readLine();}\n\n\n\t\tpublic double nextDouble() throws IOException\n\t\t{\n\t\t\tString x = next();\n\t\t\tStringBuilder sb = new StringBuilder(\"0\");\n\t\t\tdouble res = 0, f = 1;\n\t\t\tboolean dec = false, neg = false;\n\t\t\tint start = 0;\n\t\t\tif(x.charAt(0) == '-')\n\t\t\t{\n\t\t\t\tneg = true;\n\t\t\t\tstart++;\n\t\t\t}\n\t\t\tfor(int i = start; i < x.length(); i++)\n\t\t\t\tif(x.charAt(i) == '.')\n\t\t\t\t{\n\t\t\t\t\tres = Long.parseLong(sb.toString());\n\t\t\t\t\tsb = new StringBuilder(\"0\");\n\t\t\t\t\tdec = true;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tsb.append(x.charAt(i));\n\t\t\t\t\tif(dec)\n\t\t\t\t\t\tf *= 10;\n\t\t\t\t}\n\t\t\tres += Long.parseLong(sb.toString()) / f;\n\t\t\treturn res * (neg?-1:1);\n\t\t}\n\n\t\tpublic boolean ready() throws IOException {return br.ready();}\n\n\n\n\t}\n\n\n}", "lang_cluster": "Java", "tags": ["math", "dp", "games"], "code_uid": "73c9e026840cbc8e41c9bf8d5c0896ed", "src_uid": "63262317ba572d78163c91b853c05506", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "\nimport java.io.*;\nimport java.util.*;\n \npublic class Main{\n\t\n \n\tpublic void solve(){\n\t\tString a1 = next();\n\t\tString a2 = next();\n\t\tString b1 = next();\n\t\tString b2 = next();\n\t\t\n\t\tint[] a = new int[10];\n\t\tint i = 0;\n\t\tif(a1.charAt(0) != 'X') a[i++] = a1.charAt(0) - 'A';\n\t\tif(a1.charAt(1) != 'X') a[i++] = a1.charAt(1) - 'A';\n\t\tif(a2.charAt(1) != 'X') a[i++] = a2.charAt(1) - 'A';\n\t\tif(a2.charAt(0) != 'X') a[i++] = a2.charAt(0) - 'A';\n\t\ta[3] = a[0];\n\t\ta[4] = a[1];\n\t\ta[5] = a[2];\n\t\ti = 0;\n\t\twhile(a[i] != 0) i++;\n\t\t\n\t\tint[] b = new int[10];\n\t\tint j = 0;\n\t\tif(b1.charAt(0) != 'X') b[j++] = b1.charAt(0) - 'A';\n\t\tif(b1.charAt(1) != 'X') b[j++] = b1.charAt(1) - 'A';\n\t\tif(b2.charAt(1) != 'X') b[j++] = b2.charAt(1) - 'A';\n\t\tif(b2.charAt(0) != 'X') b[j++] = b2.charAt(0) - 'A';\n\t\tb[3] = b[0];\n\t\tb[4] = b[1];\n\t\tb[5] = b[2];\n\t\tj = 0;\n\t\twhile(b[j] != 0) j++;\n\t\tif(a[i] == b[j] && a[i + 1] == b[j + 1] && a[i + 2] == b[j + 2]){\n\t\t\tout.println(\"YES\");\n\t\t}else{\n\t\t\tout.println(\"NO\");\n\t\t}\n\t\t\n\t\t\n\t}\n\t\n\tprivate static PrintWriter out;\n\tpublic static void main(String[] args){\n\t\tout = new PrintWriter(System.out);\n\t\tnew Main().solve();\n\t\tout.flush();\n\t}\n\t\n\t\n\t\n\tpublic static int nextInt(){\n\t\tint num = 0;\n\t\tString str = next();\n\t\tboolean minus = false;\n\t\tint i = 0;\n\t\tif(str.charAt(0) == '-'){\n\t\t\tminus = true;\n\t\t\ti++;\n\t\t}\n\t\tint len = str.length();\n\t\tfor(;i < len; i++){\n\t\t\tchar c = str.charAt(i);\n\t\t\tif(!('0' <= c && c <= '9')) throw new RuntimeException();\n\t\t\tnum = num * 10 + (c - '0');\n\t\t}\n\t\treturn minus ? -num : num;\n\t}\n\t\n\tpublic static long nextLong(){\n\t\tlong num = 0;\n\t\tString str = next();\n\t\tboolean minus = false;\n\t\tint i = 0;\n\t\tif(str.charAt(0) == '-'){\n\t\t\tminus = true;\n\t\t\ti++;\n\t\t}\n\t\tint len = str.length();\n\t\tfor(;i < len; i++){\n\t\t\tchar c = str.charAt(i);\n\t\t\tif(!('0' <= c && c <= '9')) throw new RuntimeException();\n\t\t\tnum = num * 10l + (c - '0');\n\t\t}\n\t\treturn minus ? -num : num;\n\t}\n\tpublic static String next(){\n\t\tint c;\n\t\twhile(!isAlNum(c = read())){}\n\t\tStringBuilder build = new StringBuilder();\n\t\tbuild.append((char)c);\n\t\twhile(isAlNum(c = read())){\n\t\t\tbuild.append((char)c);\n\t\t}\n\t\treturn build.toString();\n\t}\n\t\n\t\n\tprivate static byte[] inputBuffer = new byte[1024];\n\tprivate static int bufferLength = 0;\n\tprivate static int bufferIndex = 0;\n\tprivate static int read(){\n\t\tif(bufferLength < 0) throw new RuntimeException();\n\t\tif(bufferIndex >= bufferLength){\n\t\t\ttry{\n\t\t\t\tbufferLength = System.in.read(inputBuffer);\n\t\t\t\tbufferIndex = 0;\n\t\t\t}catch(IOException e){\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\t\tif(bufferLength <= 0) return (bufferLength = -1);\n\t\t}\n\t\treturn inputBuffer[bufferIndex++];\n\t}\n\t\n\tprivate static boolean isAlNum(int c){\n\t\treturn '!' <= c && c <= '~';\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "aba3efdab0f8c79995bfc92ebbfae664", "src_uid": "46f051f58d626587a5ec449c27407771", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n\n/*\n * To change this license header, choose License Headers in Project Properties.\n * To change this template file, choose Tools | Templates\n * and open the template in the editor.\n */\n\n/**\n *\n * @author winterwind\n */\npublic class Oct28Phone {\n\n public static int subtr(String a) {\n int i = a.charAt(0) - '0';\n \n for(int j = 1; j < a.length(); j++) {\n if(Math.abs((a.charAt(j) - '0' + i) - 2*(a.charAt(j) - '0')) > 1) {\n return 0;\n }\n i = a.charAt(j) - '0';\n }\n return 1;\n }\n \n /**\n * @param args the command line arguments\n */\n \n public static void main(String[] args) throws IOException {\n BufferedReader f = new BufferedReader(new InputStreamReader(System.in));\n \n String s = f.readLine();\n int n = s.length();\n long[][] dp = new long[n][10];\n for(int i = 0; i < 10; i++) {\n dp[0][i] = 1;\n }\n \n for(int i = 1; i < s.length(); i++) {\n int current = s.charAt(i) - '0';\n for(int j = 0; j < 10; j++) {\n if((j + current)%2 == 1) {\n dp[i][(j + current + 1)/2] += dp[i - 1][j];\n dp[i][(j + current - 1)/2] += dp[i - 1][j];\n }\n else {\n dp[i][(j + current)/2] += dp[i - 1][j];\n }\n }\n }\n \n /*\n for(int i = 0; i < n; i++) {\n System.out.println(Arrays.toString(dp[i]));\n }\n */\n \n /*\n s = s.substring(0, s.length() - 1);\n int iter = 1;\n \n while(s.length() > 0) {\n int current = Integer.parseInt(s.substring(s.length() - 1));\n s = s.substring(0, s.length() - 1);\n System.out.println(current);\n \n for(int i = 0; i < 10; i++) {\n if((i + current)%2 == 1) {\n //System.out.println(i + \" \" + Math.floor((double)(current + i)/2.0) + \" \" + Math.ceil((double)(current + i)/2.0));\n dp[iter][i] += dp[iter - 1][(int) Math.floor((double)(current + i)/2.0)];\n dp[iter][i] += dp[iter - 1][(int) Math.ceil((double)(current + i)/2.0)];\n //System.out.println(dp[iter - 1][(int) Math.floor((double)(current + i)/2.0)] + \" \" + dp[iter - 1][(int) Math.ceil((double)(current + i)/2.0)]);\n }\n else {\n dp[iter][i] += dp[iter - 1][(current + i)/2];\n }\n }\n System.out.println(iter + \" \" + Arrays.toString(dp[iter]));\n iter++;\n }\n */\n \n long sum = 0;\n for(int i = 0; i < 10; i++) {\n sum += dp[n - 1][i];\n }\n System.out.println(sum - subtr(s));\n }\n \n}\n", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "f985beb7b952c14a3e53a9afdb54dc09", "src_uid": "2dd8bb6e8182278d037aa3a59ca3517b", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\r\nimport java.lang.*;\r\nimport java.io.*;\r\npublic final class Solution{\r\n public static void main(String[] args) throws IOException{\r\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\r\n int t = Integer.parseInt(br.readLine().trim());\r\n while(t-->0){\r\n int n = Integer.parseInt(br.readLine().trim());\r\n int sq = (int) (Math.sqrt(n));\r\n int cb = (int) (Math.cbrt(n));\r\n int count = sq+cb;\r\n for(int i=1;Math.pow(i,6)<=n;i++){\r\n count--;\r\n }\r\n System.out.println(count);\r\n }\r\n }\r\n}", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "7b48f65ee7379f52361089d9d01efa37", "src_uid": "015afbefe1514a0e18fcb9286c7b6624", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import static java.lang.System.exit;\nimport java.util.*;\npublic class Main {\n\n /**\n * @param args the command line arguments\n */\n public static void main(String[] args) {\n Scanner sc=new Scanner(System.in);\n int n=sc.nextInt();\n sc.nextLine();\n String str=sc.nextLine();\n String st=str.toLowerCase();\n int nb=0;\n if(!st.contains(\"?\")){\n System.out.println(\"NO\");\n exit(0);\n }\n if(n==1 && st.charAt(0)=='?'){\n System.out.println(\"YES\");\n exit(0);\n }\n if(n==1 && st.charAt(0)!='?'){\n System.out.println(\"NO\");\n exit(0);\n }\n if(n==2 && st.contains(\"?\")){\n System.out.println(\"YES\");\n exit(0);\n }\n if(n==2 && !st.contains(\"?\")){\n System.out.println(\"NO\");\n exit(0);\n }\n if(st.contains(\"mm\") || st.contains(\"cc\") || st.contains(\"yy\"))\n {\n System.out.println(\"NO\");\n exit(0);\n }\n if(st.contains(\"??\")){\n System.out.println(\"YES\");\n exit(0);\n }\n if(st.charAt(0)=='?'||st.charAt(n-1)=='?'){\n System.out.println(\"YES\");\n exit(0);\n }\n for(int j=1;j<n-1;j++){\n if(st.charAt(j)=='?' && st.charAt(j-1)==st.charAt(j+1)){\n System.out.println(\"YES\");\n exit(0);\n }\n if(st.charAt(j)=='?' && st.charAt(j-1)!=st.charAt(j+1)){\n System.out.println(\"NO\");\n exit(0);\n }\n }\n }\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "8b5c26cd334f87a1a27ebcab388be76c", "src_uid": "f8adfa0dde7ac1363f269dbdf00212c3", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.awt.*;\nimport java.awt.event.*;\nimport java.io.*;\nimport java.math.*;\nimport java.text.*;\nimport java.util.*;\n\npublic class E {\n\tstatic BufferedReader br;\n\tstatic StringTokenizer st;\n\tstatic PrintWriter pw;\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\tpw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n\t\t//int qq = 1;\n\t\tint qq = Integer.MAX_VALUE;\n\t\t//int qq = readInt();\n\t\tfor(int casenum = 1; casenum <= qq; casenum++) {\n\t\t\tint n = readInt();\n\t\t\tint m = readInt();\n\t\t\tint x = readInt();\n\t\t\tint y = readInt();\n\t\t\tint vx = readInt();\n\t\t\tint vy = readInt();\n\t\t\tif(vx == 0) {\n\t\t\t\t// vy\n\t\t\t\tif(x != 0 && x != n) {\n\t\t\t\t\tpw.println(-1);\n\t\t\t\t}\n\t\t\t\telse if(vy < 0) {\n\t\t\t\t\tpw.println(x + \" \" + 0);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tpw.println(x + \" \" + m);\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(vy == 0) {\n\t\t\t\tif(y != 0 && y != m) {\n\t\t\t\t\tpw.println(-1);\n\t\t\t\t}\n\t\t\t\telse if(vx > 0) {\n\t\t\t\t\tpw.println(n + \" \" + y);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tpw.println(0 + \" \" + y);\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif((vx > 0) == (vy > 0)) {\n\t\t\t\t// y_sol = x_sol + (y - x)\n\t\t\t\tlong xSol = solve(n, mod(-(y-x), m), m);\n\t\t\t\tif(xSol == -1) {\n\t\t\t\t\tpw.println(-1);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tlong origGCD = gcd(n, m);\n\t\t\t\tif(vx > 0) {\n\t\t\t\t\txSol -= m/origGCD;\n\t\t\t\t\twhile(xSol * n <= x) {\n\t\t\t\t\t\txSol += m/origGCD;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\txSol += m/origGCD;\n\t\t\t\t\twhile(xSol * n >= x) {\n\t\t\t\t\t\txSol -= m/origGCD;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\txSol *= n;\n\t\t\t\tlong ySol = xSol + (y-x);\n\t\t\t\tpw.println(mod(xSol, 2*n) + \" \" + mod(ySol, 2*m));\n\t\t\t}\n\t\t\telse {\n\t\t\t\t// y_sol = -x_sol + (y + x)\n\t\t\t\tlong xSol = solve(n, (y+x), m);\n\t\t\t\tif(xSol == -1) {\n\t\t\t\t\tpw.println(-1);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tlong origGCD = gcd(n, m);\n\t\t\t\tif(vx > 0) {\n\t\t\t\t\txSol -= m/origGCD;\n\t\t\t\t\twhile(xSol * n <= x) {\n\t\t\t\t\t\txSol += m/origGCD;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\txSol += m/origGCD;\n\t\t\t\t\twhile(xSol * n >= x) {\n\t\t\t\t\t\txSol -= m/origGCD;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\txSol *= n;\n\t\t\t\tlong ySol = -xSol + (y+x);\n\t\t\t\tpw.println(mod(xSol, 2*n) + \" \" + mod(ySol, 2*m));\n\t\t\t}\n\t\t}\n\t\tpw.close();\n\t}\n\n\tpublic static long mod(long a, long m) {\n\t\ta %= m;\n\t\tif(a < 0) a += m;\n\t\treturn a;\n\t}\n\t\n\tpublic static long gcd(long a, long b) {\n\t\tif(a==0) return b;\n\t\tif(b==0) return a;\n\t\treturn gcd(b, a%b);\n\t}\n\t\n\tpublic static long solve(long a, long b, long m) {\n\t\t// return x such that a*x == b mod m, or -1 otherwise\n\t\t// note that on the original equation, for solution x_0, adding m / gcd(a, m) is always allowed\n\t\tb %= m;\n\t\tlong g = gcd(Math.abs(a), Math.abs(m));\n\t\tif(b%g != 0) return -1;\n\t\ta /= g;\n\t\tb /= g;\n\t\tm /= g;\n\t\tlong inv = modpow(a, phi(m)-1, m);\n\t\treturn (inv*b)%m;\n\t}\n\t\n\tpublic static long phi(long n) {\n\t\tlong r = n;\n\t\tfor(int i = 2; i * i <= n; i++) {\n\t\t\tif(n%i==0) {\n\t\t\t\tr /= i;\n\t\t\t\tr *= i-1;\n\t\t\t\twhile(n%i==0) {\n\t\t\t\t\tn /= i;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(n > 1) {\n\t\t\tr /= n;\n\t\t\tr *= n-1;\n\t\t}\n\t\treturn r;\n\t}\n\t\n\tpublic static long modpow(long b, long e, long m) {\n\t\tlong r = 1;\n\t\twhile(e > 0) {\n\t\t\tif(e%2==1) {\n\t\t\t\tr*=b;\n\t\t\t\tr%=m;\n\t\t\t}\n\t\t\tb*=b;\n\t\t\tb%=m;\n\t\t\te/=2;\n\t\t}\n\t\treturn r;\n\t}\n\t\n\tpublic static void exitImmediately() {\n\t\tpw.close();\n\t\tSystem.exit(0);\n\t}\n\n\tpublic static int readInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tpublic static double readDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n\n\tpublic static long readLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tpublic static String nextLine() throws IOException {\n\t\tst = null;\n\t\tif(!br.ready()) {\n\t\t\texitImmediately();\n\t\t}\n\t\treturn br.readLine();\n\t}\n\n\tpublic static String nextToken() throws IOException {\n\t\twhile(st == null || !st.hasMoreTokens()) {\n\t\t\tif(!br.ready()) {\n\t\t\t\texitImmediately();\n\t\t\t}\n\t\t\tst = new StringTokenizer(br.readLine());\n\t\t}\n\t\treturn st.nextToken();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["geometry", "number theory"], "code_uid": "f1f1eb398acbac6e7e2eef9b09731498", "src_uid": "6c4ddc688c5aab1432e7328d27c4d8ee", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\n// Problem : E. The Holmes Children\n// Contest : Codeforces - ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)\n// URL : https://codeforces.com/contest/776/problem/E\n// Memory Limit : 256 MB\n// Time Limit : 2000 ms\n// Powered by CP Editor (https://github.com/cpeditor/cpeditor)\n\nimport java.io.*;\nimport java.util.*;\nimport java.util.stream.*;\n\npublic class a implements Runnable{\n\t\n public static void main(String[] args) {\n new Thread(null, new a(), \"process\", 1<<26).start();\n }\n\tpublic void run() {\n\t\tFastReader scan = new FastReader();\n PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));\n\t\t//PrintWriter out = new PrintWriter(\"file.out\");\n\t\tTask solver = new Task();\n\t\t//int t = scan.nextInt();\n\t\tint t = 1;\n\t\tfor(int i = 1; i <= t; i++) solver.solve(i, scan, out);\n\t\tout.close();\n\t}\n\n\tstatic class Task {\n\t\tstatic final int inf = Integer.MAX_VALUE;\n\n\t\tpublic void solve(int testNumber, FastReader sc, PrintWriter pw) {\n\t\t\t//CHECK FOR QUICKSORT TLE\n\t\t\t//***********************//\n\t\t\t//CHECK FOR INT OVERFLOW\n\t\t\t//***********************//\n\t\t\tlong n = sc.nextLong();\n\t\t\tlong k = sc.nextLong();\n\t\t\tk = Math.min(56, (k + 1)/ 2);\n\t\t\tfor(int i = 0; i < k; i++) {\n\t\t\t\tn = phi(n);\n\t\t\t}\n\t\t\tpw.println(n % 1000000007);\n\t\t}\n\t\tlong phi(long n) \n\t\t{ \n\t\t long result = n; \n\t\t for (long p = 2; p * p <= n; ++p) \n\t\t {\n\t\t if (n % p == 0) \n\t\t {\n\t\t while (n % p == 0) \n\t\t n /= p; \n\t\t result -= result / p; \n\t\t } \n\t\t }\n\t\t if (n > 1) \n\t\t result -= result / n; \n\t\t return result; \n\t\t} \n\t}\n\tstatic long binpow(long a, long b, long m) {\n\t\ta %= m;\n\t\tlong res = 1;\n\t\twhile (b > 0) {\n\t\t\tif ((b & 1) == 1)\n\t\t\t\tres = res * a % m;\n\t\t\ta = a * a % m;\n\t\t\tb >>= 1;\n\t\t}\n\t\treturn res;\n\t}\n\tstatic void sort(int[] x){\n\t\tshuffle(x);\n\t\tArrays.sort(x);\n\t}\n\tstatic void sort(long[] x){\n\t\tshuffle(x);\n\t\tArrays.sort(x);\n\t}\n\tstatic class tup implements Comparable<tup>{\n\t\tint a, b;\n\t\ttup(int a,int b){\n\t\t\tthis.a=a;\n\t\t\tthis.b=b;\n\t\t}\n\t\t@Override\n\t\tpublic int compareTo(tup o){\n\t\t\treturn Integer.compare(o.b,b);\n\t\t}\n\t}\n\tstatic void shuffle(int[] a) {\n\t\tRandom get = new Random();\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\tint r = get.nextInt(i + 1);\n\t\t\tint temp = a[i];\n\t\t\ta[i] = a[r];\n\t\t\ta[r] = temp;\n\t\t}\n\t}\n\n\tstatic void shuffle(long[] a) {\n\t\tRandom get = new Random();\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\tint r = get.nextInt(i + 1);\n\t\t\tlong temp = a[i];\n\t\t\ta[i] = a[r];\n\t\t\ta[r] = temp;\n\t\t}\n\t}\n\n\tstatic class FastReader {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tpublic FastReader() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tpublic FastReader(String s) throws FileNotFoundException {\n\t\t\tbr = new BufferedReader(new FileReader(new File(s)));\n\t\t}\n\n\t\tString next() {\n\t\t\twhile (st == null || !st.hasMoreElements()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tString nextLine() {\n\t\t\tString str = \"\";\n\t\t\ttry {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn str;\n\t\t}\n\t}\n\n}", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "75ba91d9782b9a4ff22cfbe710edfe6a", "src_uid": "0591ade5f9a69afcbecd80402493f975", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskA solver = new TaskA();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskA {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int a1 = in.nextInt();\n int a2 = in.nextInt();\n int a3 = in.nextInt();\n int a4 = in.nextInt();\n int a5 = in.nextInt();\n int a6 = in.nextInt();\n\n long ans = (a1 + a2 + a3) * (a1 + a2 + a3) - a1 * a1 - a3 * a3 - a5 * a5;\n out.println(ans);\n\n\n }\n\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["brute force", "math", "geometry"], "code_uid": "bc86ac1191e7dfe5d7c593a0285a894c", "src_uid": "382475475427f0e76c6b4ac6e7a02e21", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class AbilityToConvert {\n public static InputReader in;\n public static PrintWriter out;\n\n public static final int myMotivation = 0;\n public static final int MOD = (int) (1e9 + 7);\n public static final long INF = (long) (2e18);\n \n public static int len, n;\n public static char[] num;\n public static long[] memo;\n public static void main(String[] args) {\n\tin = new InputReader(System.in);\n\tout = new PrintWriter(System.out);\n\t\n\tn = in.nextInt();\n\tlen = Integer.toString(n).length();\t\n\tnum = (\"$\" + in.readString()).toCharArray();\n\t\n\tmemo = new long[num.length];\n\tArrays.fill(memo, -1);\n\tmemo[0] = 0;\n\tsolve(num.length - 1);\n\tout.println(memo[num.length - 1]);\n\t\n\tout.close();\n }\n \n public static void solve(int idx) {\n\tif(idx < 0 || memo[idx] != -1) {\n\t return;\n\t}\n\tsolve(idx - 1);\n\tlong result = INF;\n\tfor (int size = 1; size <= Math.min(len, idx); size++) {\n\t long curr = Long.parseLong(new String(num, idx - size + 1, size));\n\t solve(idx - size);\n\t if(curr >= n || (size > 1 && num[idx - size + 1] == '0')) {\n\t\tcontinue;\n\t }\n\t result = Math.min(result, add(mul(memo[idx - size], n), curr)); \n\t}\n\tmemo[idx] = result;\n }\n \n public static long add(long a, long b) {\n\treturn Math.min(a + b, INF);\n }\n \n public static long mul(long a, long b) {\n\tif(a == 0 || b == 0) {\n\t return 0;\n\t}\n\tlong m = a*b;\n\tif(m%a == 0 && m%b == 0) {\n\t return Math.min(m, INF);\n\t}\n\treturn INF;\n }\n\n static class Node implements Comparable<Node> {\n\tint next;\n\tint dist;\n\n\tpublic Node(int u, int v) {\n\t this.next = u;\n\t this.dist = v;\n\t}\n\n\tpublic void print() {\n\t out.println(next + \" \" + dist + \" \");\n\t}\n\n\tpublic int compareTo(Node that) {\n\t return Integer.compare(this.next, that.next);\n\t}\n }\n\n static class InputReader {\n\n\tprivate InputStream stream;\n\tprivate byte[] buf = new byte[8192];\n\tprivate int curChar, snumChars;\n\tprivate SpaceCharFilter filter;\n\n\tpublic InputReader(InputStream stream) {\n\t this.stream = stream;\n\t}\n\n\tpublic int snext() {\n\t if (snumChars == -1)\n\t\tthrow new InputMismatchException();\n\t if (curChar >= snumChars) {\n\t\tcurChar = 0;\n\t\ttry {\n\t\t snumChars = stream.read(buf);\n\t\t} catch (IOException e) {\n\t\t throw new InputMismatchException();\n\t\t}\n\t\tif (snumChars <= 0)\n\t\t return -1;\n\t }\n\t return buf[curChar++];\n\t}\n\n\tpublic int nextInt() {\n\t int c = snext();\n\t while (isSpaceChar(c))\n\t\tc = snext();\n\t int sgn = 1;\n\t if (c == '-') {\n\t\tsgn = -1;\n\t\tc = snext();\n\t }\n\t int res = 0;\n\t do {\n\t\tif (c < '0' || c > '9')\n\t\t throw new InputMismatchException();\n\t\tres *= 10;\n\t\tres += c - '0';\n\t\tc = snext();\n\t } while (!isSpaceChar(c));\n\t return res * sgn;\n\t}\n\n\tpublic long nextLong() {\n\t int c = snext();\n\t while (isSpaceChar(c))\n\t\tc = snext();\n\t int sgn = 1;\n\t if (c == '-') {\n\t\tsgn = -1;\n\t\tc = snext();\n\t }\n\t long res = 0;\n\t do {\n\t\tif (c < '0' || c > '9')\n\t\t throw new InputMismatchException();\n\t\tres *= 10;\n\t\tres += c - '0';\n\t\tc = snext();\n\t } while (!isSpaceChar(c));\n\t return res * sgn;\n\t}\n\n\tpublic int[] nextIntArray(int n) {\n\t int a[] = new int[n];\n\t for (int i = 0; i < n; i++)\n\t\ta[i] = nextInt();\n\t return a;\n\t}\n\n\tpublic String readString() {\n\t int c = snext();\n\t while (isSpaceChar(c))\n\t\tc = snext();\n\t StringBuilder res = new StringBuilder();\n\t do {\n\t\tres.appendCodePoint(c);\n\t\tc = snext();\n\t } while (!isSpaceChar(c));\n\t return res.toString();\n\t}\n\n\tpublic boolean isSpaceChar(int c) {\n\t if (filter != null)\n\t\treturn filter.isSpaceChar(c);\n\t return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t}\n\n\tpublic interface SpaceCharFilter {\n\t public boolean isSpaceChar(int ch);\n\t}\n }\n}\n", "lang_cluster": "Java", "tags": ["constructive algorithms", "math", "dp", "greedy", "strings"], "code_uid": "989726ea10f93923368c8e8d632898b4", "src_uid": "be66399c558c96566a6bb0a63d2503e5", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package its_ulure;\nimport java.io.*;\nimport java.util.*;\npublic class Main{\n FastReader in;\n PrintWriter out;\n final long mod = 1000000009;\n final int MAXN = 1000000;\n final int lgN = 20;\n final long INF = (long)1e18 + 1;\n final int MAX_Ai = 1000001;\n public static void main(String[] args) throws java.lang.Exception{\n new Main().run();\n }\n void run() throws Exception{\n in = new FastReader(System.in);\n out = new PrintWriter(System.out);\n int t = 1;\n while(t-->0)\n solve();\n out.flush();\n out.close();\n }\n void solve(){\n char[] arr = new char[3];\n int[] x = new int[3];\n int i = 0;\n for(i = 0; i < 3; i++){\n String st = n();\n arr[i] = st.charAt(1);\n x[i] = st.charAt(0) - '0';\n }\n if(arr[0] == arr[1] && arr[1] == arr[2] && arr[0] == arr[2]){\n Arrays.sort(x);\n if(x[0] == x[2])\n pn(0);\n else if(x[0] + 1 == x[1] && x[1] + 1 == x[2])\n pn(0);\n else{\n int diff1 = x[1] - x[0];\n int diff2 = x[2] - x[1];\n if(diff1 == 0 || diff2 == 0)\n pn(1);\n else if(diff1 <= 2 || diff2 <= 2)\n pn(1);\n else\n pn(2);\n }\n }\n else if(arr[0] == arr[1] || arr[0] == arr[2] || arr[1] == arr[2]){\n if(arr[0] == arr[1]){\n int diff = Math.abs(x[0] - x[1]);\n if(diff <= 2)\n pn(1);\n else\n pn(2);\n }\n else if(arr[1] == arr[2]){\n int diff = Math.abs(x[1] - x[2]);\n if(diff <= 2)\n pn(1);\n else\n pn(2);\n }\n else{\n int diff = Math.abs(x[0] - x[2]);\n if(diff <= 2)\n pn(1);\n else\n pn(2);\n }\n }\n else\n pn(2);\n }\n static final Comparator<Pair> com = new Comparator<Pair>(){\n public int compare(Pair a, Pair b){\n if(Integer.compare(a.x, b.x) != 0)\n return Integer.compare(a.x, b.x);\n else\n return Integer.compare(a.y, b.y);\n }\n };\n \n class Pair{\n int x;\n int y;\n Pair(int p, int q){\n x = p;\n y = q;\n }\n }\n class Edge{\n int u , v;\n Edge(int a, int b){\n u = a;\n v = b;\n }\n int other(int x) {\n return u ^ v ^ x;\n }\n }\n long gcd(long a, long b){return (b==0)?a:gcd(b,a%b);}\n int gcd(int a, int b){return (b==0)?a:gcd(b,a%b);}\n int bitcount(long n){return (n==0)?0:(1+bitcount(n&(n-1)));}\n void p(Object o){out.print(o);}\n void pn(Object o){out.println(o);}\n void pni(Object o){out.println(o);out.flush();}\n String n(){return in.next();}\n String nln(){return in.nextLine();}\n int ni(){return Integer.parseInt(in.next());}\n long nl(){return Long.parseLong(in.next());}\n double nd(){return Double.parseDouble(in.next());}\n \n long mul(long a,long b){\n if(a>=mod)a%=mod;\n if(b>=mod)b%=mod;\n a*=b;\n if(a>=mod)a%=mod;\n return a;\n }\n long modPow(long a, long p){\n long o = 1;\n while(p>0){\n if((p&1)==1)o = mul(o,a);\n a = mul(a,a);\n p>>=1;\n }\n return o;\n }\n \n class FastReader{\n private InputStream stream; \n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n \n public FastReader(InputStream stream) {\n this.stream = stream;\n }\n \n public int read() {\n if (numChars == -1)\n throw new UnknownError();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new UnknownError();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n \n public int peek() {\n if (numChars == -1)\n return -1;\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n return -1;\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar];\n }\n \n public void skip(int x) {\n while (x-- > 0)\n read();\n }\n \n public int nextInt() {\n return Integer.parseInt(next());\n }\n \n public long nextLong() {\n return Long.parseLong(next());\n }\n \n public String nextString() {\n return next();\n }\n \n public String next() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuffer res = new StringBuffer();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n \n return res.toString();\n }\n \n public String nextLine() {\n StringBuffer buf = new StringBuffer();\n int c = read();\n while (c != '\\n' && c != -1) {\n if (c != '\\r')\n buf.appendCodePoint(c);\n c = read();\n }\n return buf.toString();\n }\n \n public double nextDouble() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n \n public boolean hasNext() {\n int value;\n while (isSpaceChar(value = peek()) && value != -1)\n read();\n return value != -1;\n }\n \n private boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n }\n} ", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "eb3a226a695bbf5a6c4948b9c13509d3", "src_uid": "7e42cebc670e76ace967e01021f752d3", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.*;\n \npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputReader in = new InputReader();\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tThread th = new Thread(null, new Runnable(){public void run(){new Task1().solve(in, out);}},\"Task1\",1<<24);\n\t\ttry{\n\t\t\tth.start();\n\t\t\tth.join();\n\t\t} catch(InterruptedException e){}\n\t\tout.close();\n\t}\n\n\tstatic class Task1{\n\t\tstatic final long MAX = Long.MAX_VALUE;\n\n\t\tpublic void solve(InputReader in, PrintWriter out){\n\t\t\tlong[] cost = new long[32];\n\t\t\tArrays.fill(cost, MAX);\n\t\t\tint n = in.nextInt(), L = in.nextInt();\n\n\t\t\tfor(int i=0; i<n; i++){\n\t\t\t\tcost[i] = in.nextLong();\n\t\t\t}\n\t\t\tfor(int i=1; i<32; i++)\n\t\t\t\tcost[i] = Math.min(cost[i], 2*cost[i-1]);\n\n\t\t\tString binary = new StringBuilder(Integer.toBinaryString(L)).reverse().toString();\n\t\t\tlong ans1 = MAX, ans2 = 0;\n\t\t\tfor(int i=binary.length(); i<32; i++)\n\t\t\t\tans1 = Math.min(ans1, cost[i]);\n\t\t\t\n\t\t\tfor(int i=0; i<binary.length(); i++){\n\t\t\t\tans2 += binary.charAt(i)=='1'?cost[i]:0;\n\t\t\t\tans2 = Math.min(ans2, cost[i+1]);\n\t\t\t}\n\n\t\t\tout.println(Math.min(ans1, ans2));\n\t\t}\n\t\t\n\t\tlong gcd(long a, long b){\n\t\t\twhile(a>0){\n\t\t\t\tlong rem = b%a;\n\t\t\t\tb = a;\n\t\t\t\ta = rem;\n\t\t\t}\n\t\t\treturn b;\n\t\t}\n\t\tlong expo(long a, long b, long MOD){\n\t\t\tlong result = 1;\n\t\t\twhile (b>0){\n\t\t\t\tif (b%2==1) result=(result*a)%MOD;\n\t\t\t\tb>>=1;\n\t\t\t\ta=(a*a)%MOD;\n\t\t\t}\n\t\t\treturn result%MOD;\n\t\t}\n\t\tlong inverseModullo(long numerator, long denominator, long MOD){\n\t\t\treturn ((numerator )*(expo(denominator, MOD-2, MOD))) ;\n\t\t}\n\t}\n \t\n\tstatic class InputReader{\n\t\tfinal InputStream stream;\n\t\tfinal byte[] buf = new byte[8192];\n\t\tint curChar, numChars;\n\t\tSpaceCharFilter filter;\n\t\tpublic InputReader(){\n\t\t\tthis.stream = System.in;\n\t\t}\n\t\tpublic int read(){\n\t\t\tif(numChars == -1) throw new InputMismatchException();\n\t\t\tif(curChar >= numChars){\n\t\t\t\tcurChar = 0;\n\t\t\t\ttry{\n\t\t\t\t\tnumChars = stream.read(buf);\n\t\t\t\t} catch(IOException e){\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif(numChars <= 0) return -1;\n\t\t\t}\n\t\t\treturn buf[curChar++];\n\t\t}\n\t\tpublic int nextInt(){\n\t\t\tint c = read();\n\t\t\twhile(isSpaceChar(c)) c = read();\n\t\t\tint sgn = 1;\n\t\t\tif(c == '-'){\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo{\n\t\t\t\tif(c<'0' || c>'9') throw new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t} while(!isSpaceChar(c));\n\t\t\treturn res*sgn;\n\t\t}\n\t\tpublic long nextLong(){\n\t\t\tint c = read();\n\t\t\twhile(isSpaceChar(c)) c = read();\n\t\t\tint sgn = 1;\n\t\t\tif(c == '-'){\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo{\n\t\t\t\tif(c<'0' || c>'9') throw new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t} while(!isSpaceChar(c));\n\t\t\treturn res*sgn;\n\t\t}\n\t\tpublic String next(){\n\t\t\tint c = read();\n\t\t\twhile(isSpaceChar(c)) c = read();\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo{\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t}while(!isSpaceChar(c));\n\t\t\treturn res.toString();\n\t\t}\n\t\tpublic boolean isSpaceChar(int c){\n\t\t\tif(filter != null) return filter.isSpaceChar(c);\n\t\t\treturn c==' ' || c=='\\n' || c=='\\r' || c=='\\t' || c==-1;\n\t\t}\n\t\tpublic interface SpaceCharFilter{\n\t\t\tpublic boolean isSpaceChar(int ch);\n\t\t}\n\t}\n\tstatic class SegmentTree{\n\t\tstatic Integer[] segTree;\n\t\tpublic SegmentTree(Integer[] input){\n\t\t\tint n=input.length;\n\t\t\tint size=(int)Math.ceil(Math.log(n)/Math.log(2));\n\t\t\tsegTree=new Integer[pow(2,size+1)-1];\n\t\t\tbuildSegmentTree(input, 0, n-1, 0);\n\t\t}\n\n\t\tvoid buildSegmentTree(Integer[] input, int lo, int hi, int pos){\n\t\t\tif(lo==hi){\n\t\t\t\tsegTree[pos]=input[lo];\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tint mid=lo+(hi-lo)/2;\n\t\t\tbuildSegmentTree(input, lo, mid, 2*pos+1);\n\t\t\tbuildSegmentTree(input, mid+1, hi, 2*pos+2);\n\t\t\tsegTree[pos]=Math.max(segTree[2*pos+1], segTree[2*pos+2]);\n\t\t}\n\n\t\tint rangeMaxQuery(int lo, int hi, int qlo, int qhi, int pos){\n\t\t\tif(qlo>hi || qhi<lo) return -1;\n\t\t\telse if(qlo<=lo && qhi>=hi) return segTree[pos];\n\t\t\tint mid=lo+(hi-lo)/2;\n\t\t\treturn Math.max(\n\t\t\t\t\trangeMaxQuery(lo, mid, qlo, qhi, 2*pos+1),\n\t\t\t\t\trangeMaxQuery(mid+1, hi, qlo, qhi, 2*pos+2)\n\t\t\t\t\t);\n\t\t}\n\n\t\tvoid updateSegmentTree(int lo, int hi, int index, int value, int pos){\n\t\t\tif(lo==hi){\n\t\t\t\tsegTree[pos]=value;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tint mid=lo+(hi-lo)/2;\n\t\t\tif(index<=mid) updateSegmentTree(lo, mid, index, value, 2*pos+1);\n\t\t\telse updateSegmentTree(mid+1, hi, index, value, 2*pos+2);\n\t\t\tsegTree[pos]=Math.max(segTree[2*pos+1], segTree[2*pos+2]);\n\t\t}\n\n\t\tprivate static int pow(int a, int b){\n\t\t\tint result = 1, MOD=Integer.MAX_VALUE;\n\t\t\twhile (b>0){\n\t\t\t\tif (b%2==1) result=(result*a)%MOD;\n\t\t\t\tb>>=1;\n\t\t\t\ta=(a*a)%MOD;\n\t\t\t}\n\t\t\treturn result%MOD;\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["greedy", "dp", "bitmasks"], "code_uid": "483ec9a206f88642b7a100ee8282bd8a", "src_uid": "04ca137d0383c03944e3ce1c502c635b", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author lewin\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n EBalancedBinarySearchTrees solver = new EBalancedBinarySearchTrees();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class EBalancedBinarySearchTrees {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n = in.nextInt();\n int[] r = new int[]{1, 2, 4, 5, 9, 10, 20, 21, 41, 42, 84, 85, 169, 170, 340, 341, 681, 682, 1364, 1365, 2729, 2730, 5460, 5461, 10921, 10922, 21844, 21845, 43689, 43690, 87380, 87381, 174761, 174762, 349524, 349525, 699049, 699050};\n boolean print = false;\n for (int j : r)\n if (n == j) {\n out.println(1);\n print = true;\n }\n if (!print) out.println(0);\n// dp = new int[2][n+1];\n// AUtils.deepFill(dp, -1);\n// out.println((count(n, 0) + count(n, 1)) % mod);\n// dp = new int[2][1000000+1];\n// AUtils.deepFill(dp, -1);\n// ArrayList<Integer> tt = new ArrayList<>();\n// int ct = 0;\n// int sh = 0;\n// for (int n = 1; n <= 1000000; n++) {\n// mxn = n-10;\n// long ans = (count(n, 0) + count(n, 1)) % mod;\n// if (ans != 0) {\n// Debug.print(n,ans);\n// tt.add(n);\n// sh = 1;\n//// Debug.print(n,Integer.toString(n,2));\n// }\n// ct += sh;\n// if (ct == 5) {\n// n = Math.max(n, n * 2 - 10);\n// ct = 0;\n// sh = 0;\n// }\n// }\n// out.println(tt);\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void println(int i) {\n writer.println(i);\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1 << 16];\n private int curChar;\n private int numChars;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (this.numChars == -1) {\n throw new InputMismatchException();\n } else {\n if (this.curChar >= this.numChars) {\n this.curChar = 0;\n\n try {\n this.numChars = this.stream.read(this.buf);\n } catch (IOException var2) {\n throw new InputMismatchException();\n }\n\n if (this.numChars <= 0) {\n return -1;\n }\n }\n\n return this.buf[this.curChar++];\n }\n }\n\n public int nextInt() {\n int c;\n for (c = this.read(); isSpaceChar(c); c = this.read()) {\n ;\n }\n\n byte sgn = 1;\n if (c == 45) {\n sgn = -1;\n c = this.read();\n }\n\n int res = 0;\n\n while (c >= 48 && c <= 57) {\n res *= 10;\n res += c - 48;\n c = this.read();\n if (isSpaceChar(c)) {\n return res * sgn;\n }\n }\n\n throw new InputMismatchException();\n }\n\n public static boolean isSpaceChar(int c) {\n return c == 32 || c == 10 || c == 13 || c == 9 || c == -1;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "dp"], "code_uid": "550979ea037179b175f4ab34f98f6265", "src_uid": "821409c1b9bdcd18c4dcf35dc5116501", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n\n//cuba orz\n\npublic class BNew {\n public static void main(String[] args) throws IOException{\n BufferedReader f = new BufferedReader(new InputStreamReader(System.in));\n PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));\n int t = Integer.parseInt(f.readLine());\n while(t-->0){\n StringTokenizer st = new StringTokenizer(f.readLine());\n int n = Integer.parseInt(st.nextToken());\n long k = Long.parseLong(st.nextToken());\n long l = Long.parseLong(st.nextToken());\n long[] depths = new long[n];\n st = new StringTokenizer(f.readLine());\n boolean good = true;\n for(int i = 0; i < n; i++){\n depths[i] = l-Long.parseLong(st.nextToken());\n if(depths[i] < 0){\n good = false;\n break;\n }\n }\n if(!good){\n out.println(\"No\");\n continue;\n }\n int ptr = 0;\n while(ptr < n){\n long left = 1;\n long right = 2*k-1;\n int count = 0;\n while(ptr+count < n){\n if(depths[ptr+count] >= k) break;\n long templ = k-depths[ptr+count];\n long tempr = k+depths[ptr+count];\n templ+=count;\n tempr+=count;\n if(templ > right || tempr < left){\n good = false;\n break;\n }\n if(templ >= left && tempr <= right){\n left = templ;\n right = tempr;\n }else if(templ <= left && tempr <= right){\n right = tempr;\n }else if(templ >= left && tempr >= right){\n left = templ;\n }\n count++;\n }\n if(!good) break;\n ptr+=(count+1);\n }\n if(!good){\n out.println(\"No\");\n }else{\n out.println(\"Yes\");\n }\n\n\n }\n\n\n\n\n out.close();\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "greedy", "dp"], "code_uid": "f14591cff6a553e7c1839d84853ae767", "src_uid": "4941b0a365f86b2e2cf686cdf5d532f8", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.nextInt();\n boolean[] isRed = new boolean[n];\n int[] red = new int[n];\n int[] blue = new int[n];\n int cntRed = 0;\n for (int i = 0; i < n; ++i) {\n isRed[i] = in.next().equals(\"R\");\n if (isRed[i]) ++cntRed;\n red[i] = in.nextInt();\n blue[i] = in.nextInt();\n }\n if (cntRed > n / 2) {\n for (int i = 0; i < n; ++i) {\n isRed[i] = !isRed[i];\n int t = red[i];\n red[i] = blue[i];\n blue[i] = t;\n }\n cntRed = n - cntRed;\n }\n byte[][] minBlueWaste = new byte[1 << n][((n - 1) + (n - cntRed)) * cntRed / 2 + 1];\n for (byte[] x : minBlueWaste) Arrays.fill(x, Byte.MAX_VALUE);\n minBlueWaste[0][0] = 0;\n for (int set = 0; set < (1 << n); ++set) {\n byte[] old = minBlueWaste[set];\n int numRed = 0;\n int numBlue = 0;\n for (int nxt = 0; nxt < n; ++nxt)\n if ((set & (1 << nxt)) != 0) {\n if (isRed[nxt]) ++numRed;\n else ++numBlue;\n }\n int extraBlueWaste = 0;\n int extraRedWaste = 0;\n for (int nxt = 0; nxt < n; ++nxt)\n if ((set & (1 << nxt)) == 0) {\n if (red[nxt] <= numRed) {\n ++extraRedWaste;\n }\n if (blue[nxt] <= numBlue) {\n ++extraBlueWaste;\n }\n }\n for (int nxt = 0; nxt < n; ++nxt)\n if ((set & (1 << nxt)) == 0) {\n int gotBlueWaste = extraBlueWaste;\n int gotRedWaste = extraRedWaste;\n if (red[nxt] <= numRed) {\n --gotRedWaste;\n }\n if (blue[nxt] <= numBlue) {\n --gotBlueWaste;\n }\n byte[] dst = minBlueWaste[set | (1 << nxt)];\n for (int ow = 0; ow < old.length; ++ow)\n if (old[ow] < Byte.MAX_VALUE) {\n if (isRed[nxt]) {\n dst[ow + gotRedWaste] = (byte) Math.min(dst[ow + gotRedWaste], old[ow] + (n - cntRed - numBlue));\n } else {\n dst[ow + cntRed - numRed] = (byte) Math.min(dst[ow + cntRed - numRed], old[ow] + gotBlueWaste);\n }\n }\n }\n }\n int totalRed = 0;\n int totalBlue = 0;\n for (int x : red) totalRed += x;\n for (int x : blue) totalBlue += x;\n byte[] fin = minBlueWaste[(1 << n) - 1];\n int res = Integer.MAX_VALUE;\n for (int ow = 0; ow < fin.length; ++ow)\n if (fin[ow] < Byte.MAX_VALUE) {\n int gotRed = totalRed + ow - (n - 1 + n - cntRed) * cntRed / 2;\n int gotBlue = totalBlue + fin[ow] - (n - 1 + cntRed) * (n - cntRed) / 2;\n res = Math.min(res, Math.max(gotRed, gotBlue) + n);\n }\n out.println(res);\n }\n\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["brute force", "dp", "bitmasks"], "code_uid": "ac0c7e13cbdd8dd419f2f5b9bd3e13f1", "src_uid": "25a77f2b7cb281ff3c7800a20b3e5969", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\nimport static java.lang.Math.*;\n\npublic class Main implements Runnable {\n\n long MOD = 1000000009; \n public void solve() throws IOException {\n int n = nextInt(); \n long[] ans = new long[n + 1];\n long[] q = new long[n + 1];\n long[] Q = new long[n + 1];\n q[0] = Q[0] = 1; \n for(int i = 1; i <= n; ++i) { \n q[i] = (2 * (1 + q[i - 1]) + 1) % MOD;\n Q[i] = (q[i] * Q[i - 1]) % MOD;\n } \n ans[2] = 2;\n for(int t = 4; t <= n; t += 2) {\n long qq = (Q[(t - 4) / 2]);\n ans[t] = (ans[t - 2] + 4 * qq) % MOD;\n } \n long tmp = ans[n];\n //pw.println(tmp);\n long p = (tmp * tmp + 1) * 2 % MOD;\n pw.println(p);\n }\n \n static final String filename = \"A\";\n static final boolean fromConsole = true;\n\n public void run() {\n try {\n if (!fromConsole) {\n in = new BufferedReader(new FileReader(filename + \".in\"));\n pw = new PrintWriter(filename + \".out\");\n } else {\n in = new BufferedReader(new InputStreamReader(System.in));\n pw = new PrintWriter(System.out);\n }\n st = new StringTokenizer(\"\");\n long st = System.currentTimeMillis();\n solve(); \n //pw.printf(\"\\nWorking time: %d ms\\n\", System.currentTimeMillis() - st); \n pw.close();\n } catch (Exception e) {\n e.printStackTrace();\n System.exit(-1);\n } \n }\n \n private StringTokenizer st;\n private BufferedReader in;\n private PrintWriter pw; \n \n boolean hasNext() throws IOException {\n while (!st.hasMoreTokens()) {\n String line = in.readLine();\n if (line == null) {\n return false;\n }\n st = new StringTokenizer(line);\n }\n return st.hasMoreTokens();\n }\n \n String next() throws IOException {\n return hasNext() ? st.nextToken() : null;\n }\n \n int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n \n BigInteger nextBigInteger() throws IOException {\n return new BigInteger(next());\n }\n \n long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n \n double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n \n public static void main(String[] args) {\n new Thread(new Main()).start();\n } \n}\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics"], "code_uid": "e45842553b7615f68fade4d0ec947043", "src_uid": "dbcb1077e7421554ba5d69b64d22c937", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.util.Map.Entry;\nimport java.lang.Math;\nimport java.math.BigInteger;\n\npublic class Problem {\n\n\tvoid solve() throws IOException {\n\n\t\tint n = rI();\n\t\tint m = rI();\n\t\tint[] a;\n\t\t\n\t\tif(n%2==1){\n\t\t\tn++;\n\t\t\ta = new int[n];\n\t\t\ta[n-1] = 0;\n\t\t\tfor(int i=0;i<n-1;++i){\n\t\t\t\ta[i] = rI();\n\t\t\t}\n\t\t}else{\n\t\t\ta = rA(n);\n\t\t}\n\t\t\n\t\t\n\t\t\n\t\tlong bp = binPow(2, n/2);\n\t\tTreeSet<Integer> st1 = new TreeSet<>();\n\t\tTreeSet<Integer> st2 = new TreeSet<>();\n\t\tfor (int mask = 0; mask < bp; ++mask) {\n\t\t\tint sum = 0;\n\t\t\tfor (int bit = 0; bit < n/2; ++bit) {\n\t\t\t\tif (checkBit(mask, bit) == 1) {\n\t\t\t\t\tsum = (sum + a[bit] % m) % m;\n\t\t\t\t}\n\t\t\t}\n\t\t\tst1.add(sum);\n\t\t}\n\t\t\n\t\tfor (int mask = 0; mask < bp; ++mask) {\n\t\t\tint sum = 0;\n\t\t\tfor (int bit = 0; bit < n/2 ; ++bit) {\n\t\t\t\tif (checkBit(mask, bit) == 1) {\n\t\t\t\t\tsum = (sum + a[n/2+bit] % m) % m;\n\t\t\t\t}\n\t\t\t}\n\t\t\tst2.add(sum);\n\t\t}\n\t\t\n\t\tint ans = 0;\n\t\t\n\t\tfor(int i: st1){\n\t\t\tint j = 0;\n\t\t\tif(st2.lower(m-i)!=null){\n\t\t\t\tj = st2.lower(m-i);\n\t\t\t}\n\t\t\tans = Math.max(ans, i+j);\n\t\t}\n\t\t\n\t\tfor(int i: st2){\n\t\t\tint j = 0;\n\t\t\tif(st1.lower(m-i)!=null){\n\t\t\t\tj = st1.lower(m-i);\n\t\t\t}\n\t\t\tans = Math.max(ans, i+j);\n\t\t}\n\t\tout.println(ans);\n\t}\n\n\tclass SegmentTree {\n\t\tint[] t;\n\n\t\tSegmentTree(int[] a, int n) {\n\t\t\tt = new int[4 * n];\n\t\t\tbuild(a, 1, 1, n);\n\t\t}\n\n\t\tvoid build(int[] a, int v, int tl, int tr) {\n\t\t\tif (tl == tr) {\n\t\t\t\tt[v] = a[tl];\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tint tm = (tl + tr) / 2;\n\t\t\tbuild(a, 2 * v, tl, tm);\n\t\t\tbuild(a, 2 * v + 1, tm + 1, tr);\n\t\t\tt[v] = Math.min(t[2 * v], t[2 * v + 1]);\n\t\t}\n\n\t\tvoid update(int v, int tl, int tr, int pos, int value) {\n\t\t\tif (tl == tr) {\n\t\t\t\tt[v] = value;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tint tm = (tl + tr) / 2;\n\t\t\tif (pos <= tm) {\n\t\t\t\tupdate(2 * v, tl, tm, pos, value);\n\t\t\t} else {\n\t\t\t\tupdate(2 * v + 1, tm + 1, tr, pos, value);\n\t\t\t}\n\n\t\t\tt[v] = Math.min(t[2 * v], t[2 * v + 1]);\n\t\t}\n\n\t\tint getMin(int v, int tl, int tr, int l, int r) {\n\t\t\tif (l > r) {\n\t\t\t\treturn INF;\n\t\t\t}\n\t\t\tif (tl == l && tr == r) {\n\t\t\t\treturn t[v];\n\t\t\t}\n\n\t\t\tint tm = (tl + tr) / 2;\n\n\t\t\tint min1 = getMin(2 * v, tl, tm, l, Math.min(tm, r));\n\t\t\tint min2 = getMin(2 * v + 1, tm + 1, tr, Math.max(l, tm + 1), r);\n\n\t\t\treturn Math.min(min1, min2);\n\t\t}\n\t}\n\n\tint checkBit(int mask, int bit) {\n\t\treturn (mask >> bit) & 1;\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\n\t\tnew Problem().run();\n\t}\n\n\tboolean isLower(char a) {\n\t\treturn ((int) a) >= 97 ? true : false;\n\t}\n\n\tint INF = Integer.MAX_VALUE - 12345;\n\n\tint[][] STEPS = { { 0, 1 }, { 1, 0 }, { -1, 0 }, { 0, -1 } };\n\n\tBufferedReader in;\n\tPrintWriter out;\n\tStringTokenizer tok;\n\tRandom rnd = new Random();\n\tstatic final boolean ONLINE_JUDGE = System.getProperty(\"ONLINE_JUDGE\") != null;\n\n\tProblem() throws FileNotFoundException {\n\n\t\ttry {\n\t\t\tin = new BufferedReader(new FileReader(\"input.txt\"));\n\t\t\tout = new PrintWriter(\"output.txt\");\n\t\t} catch (Exception e) {\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(System.out);\n\t\t}\n\n\t\ttok = new StringTokenizer(\"\");\n\t}\n\n\tlong checkBit(long mask, int bit) {\n\t\treturn (mask >> bit) & 1;\n\t}\n\n\t// ======================================================\n\n\t// ======================================================\n\tvoid run() throws IOException {\n\t\tsolve();\n\t\tout.close();\n\t}\n\n\tchar[] reverseCharArray(char[] arr) {\n\t\tchar[] ans = new char[arr.length];\n\t\tfor (int i = 0; i < arr.length; ++i) {\n\t\t\tans[i] = arr[arr.length - i - 1];\n\t\t}\n\t\treturn ans;\n\t}\n\n\tint sqrt(double m) {\n\t\tint l = 0;\n\t\tint r = 1000000000 + 9;\n\t\tint i = 1000;\n\t\twhile (r - l > 1) {\n\t\t\tint mid = (r + l) / 2;\n\t\t\tif (mid * mid > m) {\n\t\t\t\tr = mid;\n\t\t\t} else {\n\t\t\t\tl = mid;\n\t\t\t}\n\t\t}\n\t\treturn l;\n\t}\n\n\tint countPow(int m, int n) {\n\t\tint ans = 0;\n\t\twhile (m % n == 0 && m > 0) {\n\t\t\tans++;\n\t\t\tm /= n;\n\t\t}\n\t\treturn ans;\n\t}\n\n\tlong binPow(long a, long b) {\n\t\tif (b == 0) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (b % 2 == 1) {\n\t\t\treturn a * binPow(a, b - 1);\n\t\t} else {\n\t\t\tlong c = binPow(a, b / 2);\n\t\t\treturn c * c;\n\t\t}\n\n\t}\n\n\tint gcd(int a, int b) {\n\t\treturn b == 0 ? a : gcd(b, a % b);\n\t}\n\n\tlong pow(long x, long k) {\n\t\tlong ans = 1;\n\t\tfor (int i = 0; i < k; ++i) {\n\t\t\tans *= x;\n\t\t}\n\t\treturn ans;\n\t}\n\n\tclass Fenwik {\n\t\tprivate long[] t;\n\t\tprivate int length;\n\n\t\tFenwik(int[] a) {\n\t\t\tthis.length = a.length + 100;\n\t\t\tthis.t = new long[length];\n\t\t\tfor (int i = 0; i < a.length; ++i) {\n\t\t\t\tthis.inc(i, a[i]);\n\t\t\t}\n\t\t}\n\n\t\tvoid inc(int i, int delta) {\n\t\t\tfor (; i < this.length; i = i | (i + 1)) {\n\t\t\t\tthis.t[i] += delta;\n\t\t\t}\n\t\t}\n\n\t\tlong getSum(int r) {\n\t\t\tlong sum = 0;\n\n\t\t\tfor (; r >= 0; r = (r & (r + 1)) - 1) {\n\t\t\t\tsum += this.t[r];\n\t\t\t}\n\n\t\t\treturn sum;\n\t\t}\n\t}\n\n\t// ////////////////////////////////////////////////////////////////////\n\n\tString delimiter = \" \";\n\n\tString readLine() throws IOException {\n\t\treturn in.readLine();\n\t}\n\n\tString rS() throws IOException {\n\t\twhile (!tok.hasMoreTokens()) {\n\t\t\tString nextLine = readLine();\n\t\t\tif (null == nextLine)\n\t\t\t\treturn null;\n\n\t\t\ttok = new StringTokenizer(nextLine);\n\t\t}\n\n\t\treturn tok.nextToken(delimiter);\n\t}\n\n\tint rI() throws IOException {\n\t\treturn Integer.parseInt(rS());\n\t}\n\n\tlong rL() throws IOException {\n\t\treturn Long.parseLong(rS());\n\t}\n\n\tdouble rD() throws IOException {\n\t\treturn Double.parseDouble(rS());\n\t}\n\n\tint[] rA(int b) {\n\t\tint a[] = new int[b];\n\t\tfor (int i = 0; i < b; i++) {\n\t\t\ttry {\n\t\t\t\ta[i] = rI();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\t\treturn a;\n\t}\n\n\tint[] readSortedIntArray(int size) throws IOException {\n\t\tInteger[] array = new Integer[size];\n\n\t\tfor (int index = 0; index < size; ++index) {\n\t\t\tarray[index] = rI();\n\t\t}\n\t\tArrays.sort(array);\n\n\t\tint[] sortedArray = new int[size];\n\t\tfor (int index = 0; index < size; ++index) {\n\t\t\tsortedArray[index] = array[index];\n\t\t}\n\n\t\treturn sortedArray;\n\t}\n\n\tint[] sortedIntArray(int size, int[] array) throws IOException {\n\t\tfor (int index = 0; index < size; ++index) {\n\t\t\tarray[index] = rI();\n\t\t}\n\t\tArrays.sort(array);\n\n\t\tint[] sortedArray = new int[size];\n\t\tfor (int index = 0; index < size; ++index) {\n\t\t\tsortedArray[index] = array[index];\n\t\t}\n\n\t\treturn sortedArray;\n\t}\n}", "lang_cluster": "Java", "tags": ["meet-in-the-middle", "divide and conquer", "bitmasks"], "code_uid": "f6d6ecbee94b794a3ef92b6eb62b9140", "src_uid": "d3a8a3e69a55936ee33aedd66e5b7f4a", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.stream.IntStream;\nimport java.util.List;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.util.ArrayList;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskB solver = new TaskB();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskB {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.nextInt();\n int m = in.nextInt();\n if (n > m) {\n int t = n;\n n = m;\n m = t;\n }\n\n long V = (long) n * m;\n\n if (V < 100) {\n List<Integer>[] g = new List[(int) V];\n for (int i = 0; i < V; i++) {\n g[i] = new ArrayList<>();\n }\n for (int i = 0; i < V; i++) {\n for (int j = 0; j < V; j++) {\n int r1 = i / m;\n int c1 = i % m;\n int r2 = j / m;\n int c2 = j % m;\n if (Math.abs(r1 - r2) + Math.abs(c1 - c2) == 3) {\n g[i].add(j);\n }\n }\n }\n\n int res = maxMatching(g) * 2;\n out.println(res);\n } else {\n long res;\n if (n == 1) {\n res = m / 6 * 6 + (m % 6 == 4 ? 2 : 0) + (m % 6 == 5 ? 4 : 0);\n } else {\n res = (long) n * m;\n res -= res % 2;\n }\n out.println(res);\n }\n }\n\n static int maxMatching(List<Integer>[] graph) {\n int n = graph.length;\n int[] match = new int[n];\n Arrays.fill(match, -1);\n int[] p = new int[n];\n for (int i = 0; i < n; ++i) {\n if (match[i] == -1) {\n int v = findPath(graph, match, p, i);\n while (v != -1) {\n int pv = p[v];\n int ppv = match[pv];\n match[v] = pv;\n match[pv] = v;\n v = ppv;\n }\n }\n }\n return (int) Arrays.stream(match).filter(x -> x != -1).count() / 2;\n }\n\n static int findPath(List<Integer>[] graph, int[] match, int[] p, int root) {\n Arrays.fill(p, -1);\n int n = graph.length;\n int[] base = IntStream.range(0, n).toArray();\n\n boolean[] used = new boolean[n];\n int[] q = new int[n];\n int qt = 0;\n used[root] = true;\n q[qt++] = root;\n for (int qh = 0; qh < qt; qh++) {\n int u = q[qh];\n for (int v : graph[u]) {\n if (base[u] == base[v] || match[u] == v) continue;\n if (v == root || match[v] != -1 && p[match[v]] != -1) {\n int curbase = lca(match, base, p, u, v);\n boolean[] blossom = new boolean[n];\n markPath(match, base, blossom, p, u, curbase, v);\n markPath(match, base, blossom, p, v, curbase, u);\n for (int i = 0; i < n; ++i)\n if (blossom[base[i]]) {\n base[i] = curbase;\n if (!used[i]) {\n used[i] = true;\n q[qt++] = i;\n }\n }\n } else if (p[v] == -1) {\n p[v] = u;\n if (match[v] == -1)\n return v;\n v = match[v];\n used[v] = true;\n q[qt++] = v;\n }\n }\n }\n return -1;\n }\n\n static void markPath(int[] match, int[] base, boolean[] blossom, int[] p, int u, int curbase, int child) {\n for (; base[u] != curbase; u = p[match[u]]) {\n blossom[base[u]] = blossom[base[match[u]]] = true;\n p[u] = child;\n child = match[u];\n }\n }\n\n static int lca(int[] match, int[] base, int[] p, int a, int b) {\n boolean[] used = new boolean[match.length];\n while (true) {\n a = base[a];\n used[a] = true;\n if (match[a] == -1) break;\n a = p[match[a]];\n }\n while (true) {\n b = base[b];\n if (used[b]) return b;\n b = p[match[b]];\n }\n }\n\n }\n\n static class InputReader {\n final InputStream is;\n final byte[] buf = new byte[1024];\n int pos;\n int size;\n\n public InputReader(InputStream is) {\n this.is = is;\n }\n\n public int nextInt() {\n int c = read();\n while (isWhitespace(c))\n c = read();\n int sign = 1;\n if (c == '-') {\n sign = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res = res * 10 + c - '0';\n c = read();\n } while (!isWhitespace(c));\n return res * sign;\n }\n\n int read() {\n if (size == -1)\n throw new InputMismatchException();\n if (pos >= size) {\n pos = 0;\n try {\n size = is.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (size <= 0)\n return -1;\n }\n return buf[pos++] & 255;\n }\n\n static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "graph matchings"], "code_uid": "d99f8f6e9eb3f6b9652df119c2dca5d0", "src_uid": "02ce135a4b276d1e9ba6a4ce37f2fe70", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Egor Kulikov (egor@egork.net)\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n BLittleCLoves3II solver = new BLittleCLoves3II();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class BLittleCLoves3II {\n int[][][] answer;\n long n;\n long m;\n\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n n = in.readInt();\n m = in.readInt();\n if (n > m) {\n long t = n;\n n = m;\n m = t;\n }\n if (n == 1) {\n long x = m % 6;\n if (x <= 3) {\n out.printLine(m - x);\n return;\n }\n if (x == 4) {\n out.printLine(m - 2);\n return;\n }\n out.printLine(m - 1);\n return;\n }\n if (n <= 5 && m <= 30) {\n answer = new int[(int) (m + 1)][(int) (n + 1)][1 << (3 * n)];\n ArrayUtils.fill(answer, -1);\n out.printLine(go(0, 0, 0));\n return;\n }\n out.printLine(n * m - n * m % 2);\n }\n\n private int go(int row, int col, int mask) {\n if (answer[row][col][mask] != -1) {\n return answer[row][col][mask];\n }\n if (row == m) {\n return answer[row][col][mask] = mask == 0 ? 0 : Integer.MIN_VALUE;\n }\n if (col == n) {\n return answer[row][col][mask] = go(row + 1, 0, mask);\n }\n if ((mask & 1) == 1) {\n return answer[row][col][mask] = go(row, col + 1, mask >> 1);\n }\n answer[row][col][mask] = go(row, col + 1, mask >> 1);\n answer[row][col][mask] =\n Math.max(go(row, col + 1, (mask >> 1) + (1 << (3 * n - 1))) + 2, answer[row][col][mask]);\n if (col != 0 && (mask >> (2 * n - 1) & 1) == 0) {\n answer[row][col][mask] = Math.max(answer[row][col][mask], go(row, col + 1,\n (mask >> 1) + (1 << (2 * n - 2))) + 2);\n }\n if (col != n - 1 && (mask >> (2 * n + 1) & 1) == 0) {\n answer[row][col][mask] = Math.max(answer[row][col][mask], go(row, col + 1,\n (mask >> 1) + (1 << (2 * n))) + 2);\n }\n if (col >= 2 && (mask >> (n - 2) & 1) == 0) {\n answer[row][col][mask] = Math.max(answer[row][col][mask], go(row, col + 1,\n (mask >> 1) + (1 << (n - 3))) + 2);\n }\n if (col < n - 1 && (mask >> (n + 2) & 1) == 0) {\n answer[row][col][mask] = Math.max(answer[row][col][mask], go(row, col + 1,\n (mask >> 1) + (1 << (n + 1))) + 2);\n }\n return answer[row][col][mask];\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void printLine(long i) {\n writer.println(i);\n }\n\n public void printLine(int i) {\n writer.println(i);\n }\n\n }\n\n static class ArrayUtils {\n public static void fill(int[][] array, int value) {\n for (int[] row : array) {\n Arrays.fill(row, value);\n }\n }\n\n public static void fill(int[][][] array, int value) {\n for (int[][] subArray : array) {\n fill(subArray, value);\n }\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "graph matchings"], "code_uid": "f75dd11a1dce6f8aa9ae709c2bbc80f3", "src_uid": "02ce135a4b276d1e9ba6a4ce37f2fe70", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.util.*;\n \n \npublic class Main{\nstatic int mod = (int)(Math.pow(10, 9) + 7);\n public static void main(String[] args) {\n MyScanner sc = new MyScanner();\n out = new PrintWriter(new BufferedOutputStream(System.out));\n long n = sc.nextInt(), m = sc.nextInt();\n if (m < n) {\n \t long temp = n;\n \t n = m;\n \t m = temp;\n }\n if (n <= 2 && m <= 2) {\n \t out.println(0);\n }\n else if (n == 1) {\n \t long res = m/6;\n \t res *= 6;\n \t long mod = m%6;\n \t if (mod >= 4) {\n \t\t mod -= 3;\n \t\t res += mod*2;\n \t }\n \t out.println(res);\n }\n else if (n == 2) {\n \t long res = n*m;\n \t if (m == 3) res=4;\n \t else if (m == 7) res = 12;\n \t out.println(res);\n }\n else {\n \t \n \t\t out.println(n*m/2 * 2);\n \t \n }\n out.close();\n }\n \n static long pow(long a, long N) {\n\t if (N == 0) return 1;\n\t else if (N == 1) return a;\n\t else {\n\t\t long R = pow(a,N/2);\n\t\t if (N % 2 == 0) {\n\t\t\t return R*R;\n\t\t }\n\t\t else {\n\t\t\t return R*R*a;\n\t\t }\n\t }\n }\n \n static long powMod(long a, long N) {\n\t if (N == 0) return 1;\n\t else if (N == 1) return a % mod;\n\t else {\n\t\t long R = powMod(a,N/2) % mod;\n\t\t R *= R % mod;\n\t\t if (N % 2 == 1) {\n\t\t\t R *= a % mod;\n\t\t }\n\t\t\t return R % mod;\n\t }\n }\nstatic void mergeSort(int[] A){ // low to hi sort, single array only\n int n = A.length;\n if (n < 2) return;\n int[] l = new int[n/2];\n int[] r = new int[n - n/2];\n \n for (int i = 0; i < n/2; i++){\n l[i] = A[i];\n }\n \n for (int j = n/2; j < n; j++){\n r[j-n/2] = A[j];\n }\n \n mergeSort(l);\n mergeSort(r);\n merge(l, r, A);\n }\n \n static void merge(int[] l, int[] r, int[] a){\n int i = 0, j = 0, k = 0;\n while (i < l.length && j < r.length && k < a.length){\n if (l[i] < r[j]){\n a[k] = l[i];\n i++;\n }\n else{\n a[k] = r[j];\n j++;\n }\n k++;\n }\n while (i < l.length){\n a[k] = l[i];\n i++;\n k++;\n }\n \n while (j < r.length){\n a[k] = r[j];\n j++;\n k++;\n }\n }\n\n \n\n //-----------PrintWriter for faster output---------------------------------\n public static PrintWriter out;\n \n //-----------MyScanner class for faster input----------\n public static class MyScanner {\n BufferedReader br;\n StringTokenizer st;\n \n public MyScanner() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n \n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n \n int nextInt() {\n return Integer.parseInt(next());\n }\n \n long nextLong() {\n return Long.parseLong(next());\n }\n \n double nextDouble() {\n return Double.parseDouble(next());\n }\n \n String nextLine(){\n String str = \"\";\n\t try {\n\t str = br.readLine();\n\t } catch (IOException e) {\n\t e.printStackTrace();\n\t }\n\t return str;\n }\n\n }\n //--------------------------------------------------------\n}\n\n\n\n\n\n", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "graph matchings"], "code_uid": "6c106b20e275dbcc0110c0490115a07a", "src_uid": "02ce135a4b276d1e9ba6a4ce37f2fe70", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\npublic class hi{\n \n \n public static void main(String[] args) throws IOException {\n Scanner sc = new Scanner(System.in);\n long n = sc.nextLong();\n long m = sc.nextLong();\n long rep = 0;\n if(n>=4&&m>=4){\n if(n%2==0||m%2==0) rep = n*m;\n else rep = n*m-1;\n }\n else{\n long min = Math.min(n,m);\n long max = Math.max(n,m);\n if(min==1){\n rep = max- (max%6);\n if(max%6==4) rep += 2;\n if(max%6==5) rep += 4;\n }\n else if(min==2){\n if(max<3) rep = 0;\n else if(max==3) rep = 4;\n else if(max==7) rep = 12;\n else rep = min * max;\n }\n else if(min==3) {\n if(max<3) rep = 0;\n else {\n rep = min * max;\n if(max%2==1) rep--;\n }\n }\n \n }\n System.out.println(rep);\n }\n \n\n \n}", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "graph matchings"], "code_uid": "8a8381bdbdb91f6d51b5bd908a0442e6", "src_uid": "02ce135a4b276d1e9ba6a4ce37f2fe70", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.DataInputStream;\nimport java.io.IOException;\n\npublic class PD {\n public static void main(String... args) throws IOException {\n Reader reader = new Reader();\n\n long n = reader.nextInt();\n long m = reader.nextInt();\n\n long x1 = Math.min(n, m);\n long x2 = Math.max(n, m);\n\n if(x1 == 1) {\n int memo[] = {0, 1, 2, 3, 2, 1};\n\n System.out.println(x1 * x2 - (memo[(int)(x2 % 6)]));\n } else if(x1 == 2) {\n if(x2 == 2) {\n System.out.println(0);\n } else if(x2 == 3 || x2 == 7) {\n System.out.println(x1 * x2 - 2);\n } else {\n System.out.println(x1 * x2);\n }\n } else if((x1 * x2) % 2 == 0) {\n System.out.println(x1 * x2);\n } else {\n System.out.println(x1 * x2 - 1);\n }\n }\n\n static class Reader {\n final private int BUFFER_SIZE = 1 << 16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n\n Reader() {\n din = new DataInputStream(System.in);\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n String readLine() throws IOException {\n byte[] buf = new byte[64]; // line length\n int cnt = 0, c;\n while ((c = read()) != -1) {\n if (c == '\\n')\n break;\n buf[cnt++] = (byte) c;\n }\n return new String(buf, 0, cnt);\n }\n\n //Will read words with space as delimiters\n public String nextWord() throws IOException {\n byte[] buf = new byte[64]; // word length\n\n byte c = read();\n while (c == ' ')\n c = read();\n int cnt = 0;\n do {\n buf[cnt++] = c;\n c = read();\n } while (c != ' ' && c != '\\n');\n\n return new String(buf, 0, cnt);\n }\n\n public int nextInt() throws IOException {\n int ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n\n if (neg)\n return -ret;\n return ret;\n }\n\n private void fillBuffer() throws IOException {\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1)\n buffer[0] = -1;\n }\n\n private byte read() throws IOException {\n if (bufferPointer == bytesRead)\n fillBuffer();\n return buffer[bufferPointer++];\n }\n\n public void close() throws IOException {\n if (din == null)\n return;\n din.close();\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "graph matchings"], "code_uid": "2cb71cfe1c6972184aefaeebdfde64f9", "src_uid": "02ce135a4b276d1e9ba6a4ce37f2fe70", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.util.regex.Pattern;\npublic class Stub {\npublic static void main(String[] args) {\nScanner in = new Scanner(System.in);\nlong n = in.nextLong(); //\nlong m = in.nextLong();\nlong out = 0;\nif (n+m < 5) {\n System.out.println(\"0\"); // too small\n} else {\n if (n==1 || m==1) {\n long l = n+m-1;\n long x = l/6;\n long y = 0;\n if (l%6 == 4) y+= 2;\n if (l%6 == 5) y += 4;\n out = x*6 + y;\n System.out.println(out);\n return;\n }\n out = (n*m)-(n*m)%2;\n if ((n%4 !=0) && (m%4 !=0) && (n+m)%4 == 1 && (n*m) <15) out -=2;\n // if ((n+m > 9) && (n==3 || m==3) && ((n+m)%4 == 2)) out -=2;\n\nSystem.out.println(out); // \n}\n\n\n} // end main\n}", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "graph matchings"], "code_uid": "3ec92750cb72a2069d668f7d66eec10e", "src_uid": "02ce135a4b276d1e9ba6a4ce37f2fe70", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedInputStream;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner s = new Scanner(new BufferedInputStream(System.in));\n\t\tint n = s.nextInt();\n\t\tint m = s.nextInt();\n\t\tif (n > m) {\n\t\t\tsolution(m, n);\n\t\t} else {\n\t\t\tsolution(n, m);\n\t\t}\n\n\t}\n\n\tprivate static void solution(int n, int m) {\n\t\tif (n == 1) {\n\t\t\tSystem.out.println(m / 6 * 3 + Math.max(m % 6 - 3, 0) << 1);\n\t\t} else if (n == 2) {\n\t\t\tSystem.out.println(m == 2 ? 0 : m == 3 ? 4 : m == 7 ? 12 : m << 1);\n\t\t} else {\n\t\t\tSystem.out.println(1l * n * m / 2 * 2);\n\t\t}\n\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "graph matchings"], "code_uid": "31c25d5a13e3ee51b940126bc49cd0d8", "src_uid": "02ce135a4b276d1e9ba6a4ce37f2fe70", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\npublic class hi{\n \n \n public static void main(String[] args) throws IOException {\n Scanner sc = new Scanner(System.in);\n long n = sc.nextLong();\n long m = sc.nextLong();\n long rep = 0;\n if(n>=4&&m>=4){\n if(n%2==0||m%2==0) rep = n*m;\n else rep = n*m-1;\n }\n else{\n long min = Math.min(n,m);\n long max = Math.max(n,m);\n if(min==1){\n rep = max- (max%6);\n if(max%6==4) rep += 2;\n if(max%6==5) rep += 4;\n }\n else if(min==2){\n if(max<3) rep = 0;\n else if(max==3) rep = 4;\n else if(max==7) rep = 12;\n else rep = min * max;\n }\n else if(min==3) {\n if(max<3) rep = 0;\n else {\n rep = min * max;\n if(max%2==1) rep--;\n }\n }\n \n }\n System.out.println(rep);\n }\n \n\n \n}", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "graph matchings"], "code_uid": "4d82adb9c3b255687c217b20bd4d63c9", "src_uid": "02ce135a4b276d1e9ba6a4ce37f2fe70", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n static BufferedReader br;\n\n public static void main(String[] args) throws IOException{\n br = new BufferedReader(new InputStreamReader(System.in));\n long[] nm = longs();\n long n = nm[0];\n long m = nm[1];\n if (n > m) {\n long tmp = n;\n n = m;\n m = tmp;\n }\n\n long sol = 0;\n\n if (m < 3) {\n System.out.println(sol);\n return;\n }\n\n if (n == 1) {\n sol = m % 6;\n if (sol > 3) sol = 6 - sol;\n System.out.println(m - sol);\n return;\n }\n\n if (n == 2) {\n sol = m * n;\n if (m == 3) sol = 4;\n if (m == 7) sol = 12;\n } else if (n == 3) {\n sol = m * n;\n if (m % 2 == 1) sol -= 1;\n } else {\n if (m % 2 == 1 && n % 2 == 1) sol = m * n - 1;\n else sol = m * n;\n }\n\n System.out.println(sol);\n }\n\n static int[] ints() throws IOException {\n String[] line = br.readLine().split(\" \");\n int[] ints = new int[line.length];\n for (int i = 0; i < line.length; i++) ints[i] = Integer.parseInt(line[i]);\n return ints;\n }\n\n static long[] longs() throws IOException {\n String[] line = br.readLine().split(\" \");\n long[] longs = new long[line.length];\n for (int i = 0; i < line.length; i++) longs[i] = Long.parseLong(line[i]);\n return longs;\n }\n\n static double[] doubles() throws IOException {\n String[] line = br.readLine().split(\" \");\n double[] doubles = new double[line.length];\n for (int i = 0; i < line.length; i++) doubles[i] = Double.parseDouble(line[i]);\n return doubles;\n }\n\n}\n", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "graph matchings"], "code_uid": "7ea8b102261a9b7c6fc99eb67363a95e", "src_uid": "02ce135a4b276d1e9ba6a4ce37f2fe70", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\n/**\n * @author Don Li\n */\npublic class LittleCLoves3II {\n void solve() {\n long n = in.nextInt(), m = in.nextInt();\n if (n > m) {\n long tmp = n; n = m; m = tmp;\n }\n \n if (n == 1) {\n out.println(m / 6 * 6 + Math.max(m % 6 - 3, 0) * 2);\n return;\n }\n \n if (n == 2) {\n if (m == 2) out.println(0);\n else if (m == 3) out.println(4);\n else if (m == 7) out.println(12);\n else out.println(n * m);\n return;\n }\n \n out.println(n * m / 2 * 2);\n }\n \n public static void main(String[] args) {\n in = new FastScanner(new BufferedReader(new InputStreamReader(System.in)));\n out = new PrintWriter(System.out);\n new LittleCLoves3II().solve();\n out.close();\n }\n \n static FastScanner in;\n static PrintWriter out;\n \n static class FastScanner {\n BufferedReader in;\n StringTokenizer st;\n \n public FastScanner(BufferedReader in) {\n this.in = in;\n }\n \n public String nextToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(in.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n \n public int nextInt() {\n return Integer.parseInt(nextToken());\n }\n \n public long nextLong() {\n return Long.parseLong(nextToken());\n }\n \n public double nextDouble() {\n return Double.parseDouble(nextToken());\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "graph matchings"], "code_uid": "cec9c6936c260860d05025a53456ed74", "src_uid": "02ce135a4b276d1e9ba6a4ce37f2fe70", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedInputStream;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner s = new Scanner(new BufferedInputStream(System.in));\n\t\tint n = s.nextInt();\n\t\tint m = s.nextInt();\n\t\tif (n > m) {\n\t\t\tsolve(m, n);\n\t\t} else {\n\t\t\tsolve(n, m);\n\t\t}\n\n\t}\n\n\tprivate static void solve(int n, int m) {\n\t\tif (n == 1) {\n\t\t\tSystem.out.println(m / 6 * 3 + Math.max(m % 6 - 3, 0) << 1);\n\t\t} else if (n == 2) {\n\t\t\tSystem.out.println(m == 2 ? 0 : m == 3 ? 4 : m == 7 ? 12 : m << 1);\n\t\t} else {\n\t\t\tSystem.out.println(1l * n * m / 2 * 2);\n\t\t}\n\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "graph matchings"], "code_uid": "09ab2e86d6424acbed1c3550d3635169", "src_uid": "02ce135a4b276d1e9ba6a4ce37f2fe70", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/*\nKeep solving problems.\n*/\n\nimport java.util.*;\nimport java.io.*;\n\npublic class CFA {\n BufferedReader br;\n PrintWriter out;\n StringTokenizer st;\n boolean eof;\n private static final long MOD = 998244353L;\n private static final int[] dx = {0, -1, 0, 1};\n private static final int[] dy = {1, 0, -1, 0};\n private static final String yes = \"Yes\";\n private static final String no = \"No\";\n\n class Point {\n int x;\n int y;\n public Point(int x, int y) {\n this.x = x;\n this.y = y;\n }\n }\n\n void solve() throws IOException {\n int n = nextInt();\n int m = nextInt();\n if (n > m) {\n int tmp = n;\n n = m;\n m = tmp;\n }\n\n if (n == 1) {\n m--;\n int[] left = {0, 0, 0, 2, 4, 6};\n long res = m / 6 * 6 + left[m % 6];\n outln(res);\n return;\n }\n else if (n == 2) {\n if (m < 20) {\n outln(bruteforce(n, m));\n }\n else {\n outln(1L * n * m);\n }\n return;\n }\n else if (n == 3) {\n if (m < 20) {\n outln(bruteforce(n, m));\n }\n else {\n long res = 1L * n * m;\n if (res % 2 != 0) {\n res--;\n }\n outln(res);\n }\n return;\n }\n\n if (1L * n * m < 1000) {\n outln(bruteforce(n, m));\n return;\n }\n long res = 1L * n * m;\n if (res % 2 != 0) {\n res--;\n }\n outln(res);\n }\n\n int bruteforce(int n, int m) {\n List<Point> even = new ArrayList<>();\n List<Point> odd = new ArrayList<>();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n int sum = i + j;\n if (sum % 2 == 0) {\n even.add(new Point(i, j));\n }\n else {\n odd.add(new Point(i, j));\n }\n }\n }\n\n boolean[][] match = new boolean[even.size()][odd.size()];\n for (int i = 0; i < match.length; i++) {\n for (int j = 0; j < match[0].length; j++) {\n int d = Math.abs(even.get(i).x - odd.get(j).x) + Math.abs(even.get(i).y - odd.get(j).y);\n if (d == 3) {\n match[i][j] = true;\n }\n }\n }\n\n return 2 * maxMatching(match);\n }\n\n int maxMatching(boolean[][] graph) {\n int n1 = graph.length;\n int n2 = n1 == 0 ? 0 : graph[0].length;\n int[] matching = new int[n2];\n Arrays.fill(matching, -1);\n int matches = 0;\n for (int u = 0; u < n1; u++)\n if (findPath(graph, u, matching, new boolean[n1]))\n ++matches;\n return matches;\n }\n\n boolean findPath(boolean[][] graph, int u1, int[] matching, boolean[] vis) {\n vis[u1] = true;\n for (int v = 0; v < matching.length; ++v) {\n int u2 = matching[v];\n if (graph[u1][v] && (u2 == -1 || !vis[u2] && findPath(graph, u2, matching, vis))) {\n matching[v] = u1;\n return true;\n }\n }\n return false;\n }\n\n void shuffle(int[] a) {\n int n = a.length;\n for(int i = 0; i < n; i++) {\n int r = i + (int) (Math.random() * (n - i));\n int tmp = a[i];\n a[i] = a[r];\n a[r] = tmp;\n }\n }\n\n long gcd(long a, long b) {\n while(a != 0 && b != 0) {\n long c = b;\n b = a % b;\n a = c;\n }\n return a + b;\n }\n\n private void outln(Object o) {\n out.println(o);\n }\n private void out(Object o) {\n out.print(o);\n }\n private void formatPrint(double val) {\n System.out.format(\"%.9f%n\", val);\n }\n public CFA() throws IOException {\n br = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n solve();\n out.close();\n }\n public static void main(String[] args) throws IOException {\n new CFA();\n }\n\n public long[] nextLongArr(int n) throws IOException{\n long[] res = new long[n];\n for(int i = 0; i < n; i++)\n res[i] = nextLong();\n return res;\n }\n public int[] nextIntArr(int n) throws IOException {\n int[] res = new int[n];\n for(int i = 0; i < n; i++)\n res[i] = nextInt();\n return res;\n }\n public String nextToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (Exception e) {\n eof = true;\n return null;\n }\n }\n return st.nextToken();\n }\n public String nextString() {\n try {\n return br.readLine();\n } catch (IOException e) {\n eof = true;\n return null;\n }\n }\n public int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n public long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n public double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "graph matchings"], "code_uid": "e0071897b2a2d51847e9dae66706a597", "src_uid": "02ce135a4b276d1e9ba6a4ce37f2fe70", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\npublic class Main{\n \n \n public static void main(String[] args) throws IOException {\n Scanner sc = new Scanner(System.in);\n long n = sc.nextLong();\n long m = sc.nextLong();\n long rep = 0;\n if(n>=4&&m>=4){\n if(n%2==0||m%2==0) rep = n*m;\n else rep = n*m-1;\n }\n else{\n long min = Math.min(n,m);\n long max = Math.max(n,m);\n if(min==1){\n rep = max- (max%6);\n if(max%6==4) rep += 2;\n if(max%6==5) rep += 4;\n }\n else if(min==2){\n if(max<3) rep = 0;\n else if(max==3) rep = 4;\n else if(max==7) rep = 12;\n else rep = min * max;\n }\n else if(min==3) {\n if(max<3) rep = 0;\n else {\n rep = min * max;\n if(max%2==1) rep--;\n }\n }\n \n }\n System.out.println(rep);\n }\n \n\n \n}", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "graph matchings"], "code_uid": "99695720591d3f1ebe57bce2ca09c063", "src_uid": "02ce135a4b276d1e9ba6a4ce37f2fe70", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/**\n * Created by Aminul on 9/21/2018.\n */\n\nimport java.io.*;\nimport java.util.*;\nimport static java.lang.Math.*;\n\npublic class D {\n public static void main(String[] args)throws Exception {\n FastReader in = new FastReader(System.in);\n PrintWriter pw = new PrintWriter(System.out);\n\n long n = in.nextLong(), m = in.nextLong();\n\n pw.println(solve(n, m));\n \n pw.close();\n }\n\n static long solve(long n, long m){\n if(n > m){\n long tmp = n; n = m; m = tmp;\n }\n long res = n*m;\n if(n % 2 == 1 && m % 2 == 1) res--;\n\n if(n == 1){\n long x = ((n*m)/6)*6;\n long y = (n*m) % 6;\n if(y == 4) x += 2;\n if(y == 5) x += 4;\n return x;\n }\n if(n == 2 && m == 2) return 0;\n if(n == 2 && m == 3) return 4;\n if(n == 2 && m == 7) return 12;\n\n return res;\n }\n\n static void debug(Object...obj) {\n System.err.println(Arrays.deepToString(obj));\n }\n\n static class FastReader {\n InputStream is;\n private byte[] inbuf = new byte[1024];\n private int lenbuf = 0, ptrbuf = 0;\n\n public FastReader(InputStream is) {\n this.is = is;\n }\n\n public int readByte() {\n if (lenbuf == -1) throw new InputMismatchException();\n if (ptrbuf >= lenbuf) {\n ptrbuf = 0;\n try {\n lenbuf = is.read(inbuf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (lenbuf <= 0) return -1;\n }\n return inbuf[ptrbuf++];\n }\n\n public boolean isSpaceChar(int c) {\n return !(c >= 33 && c <= 126);\n }\n private boolean isEndOfLine(int c) {\n return c == '\\n' || c == '\\r' || c == -1;\n }\n\n public int skip() {\n int b;\n while ((b = readByte()) != -1 && isSpaceChar(b)) ;\n return b;\n }\n\n public String next() {\n int b = skip();\n StringBuilder sb = new StringBuilder();\n while (!(isSpaceChar(b))) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n\n\n public String nextLine() {\n int c = skip();\n StringBuilder sb = new StringBuilder();\n while (!isEndOfLine(c)){\n sb.appendCodePoint(c);\n c = readByte();\n }\n return sb.toString();\n }\n\n public int nextInt() {\n int num = 0, b;\n boolean minus = false;\n while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')) ;\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n while (true) {\n if (b >= '0' && b <= '9') {\n num = (num << 3) + (num << 1) + (b - '0');\n } else {\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n public long nextLong() {\n long num = 0;\n int b;\n boolean minus = false;\n while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')) ;\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n\n while (true) {\n if (b >= '0' && b <= '9') {\n num = (num << 3) + (num << 1) + (b - '0');\n } else {\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public char[] next(int n) {\n char[] buf = new char[n];\n int b = skip(), p = 0;\n while (p < n && !(isSpaceChar(b))) {\n buf[p++] = (char) b;\n b = readByte();\n }\n return n == p ? buf : Arrays.copyOf(buf, p);\n }\n\n public char readChar() {\n return (char) skip();\n }\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "graph matchings"], "code_uid": "1d07874716bec38197c1c3d1dc2754e2", "src_uid": "02ce135a4b276d1e9ba6a4ce37f2fe70", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.BufferedWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.ArrayDeque;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author prakharjain\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n _1047D solver = new _1047D();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class _1047D {\n int n;\n int m;\n\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n n = in.nextInt();\n m = in.nextInt();\n\n long ans = 0;\n\n if (n > 100) {\n int nn = (n - 100) % 6;\n long nq = (n - 100) / 6;\n ans += nq * 6 * m;\n n = 100 + nn;\n }\n\n if (m > 100) {\n int nm = (m - 100) % 6;\n long mq = (m - 100) / 6;\n ans += mq * 6 * n;\n m = 100 + nm;\n }\n\n int[][] mat = new int[n + 1][m + 1];\n\n int u = 1;\n int v = 1;\n for (int i = 1; i <= n; i++) {\n for (int j = 1; j <= m; j++) {\n if ((i + j) % 2 == 0) {\n mat[i][j] = u;\n u++;\n }\n }\n }\n\n for (int i = 1; i <= n; i++) {\n for (int j = 1; j <= m; j++) {\n if ((i + j) % 2 != 0) {\n mat[i][j] = v;\n v++;\n }\n }\n }\n\n List[] g = new List[u];\n\n for (int i = 0; i < u; i++) {\n g[i] = new ArrayList();\n }\n\n for (int i = 1; i <= n; i++) {\n for (int j = 1; j <= m; j++) {\n if ((i + j) % 2 == 0) {\n addEdge(mat, g, i, j, i - 3, j);\n addEdge(mat, g, i, j, i - 2, j - 1);\n addEdge(mat, g, i, j, i - 2, j + 1);\n addEdge(mat, g, i, j, i, j - 3);\n addEdge(mat, g, i, j, i - 1, j - 2);\n addEdge(mat, g, i, j, i + 1, j - 2);\n addEdge(mat, g, i, j, i, j + 3);\n addEdge(mat, g, i, j, i - 1, j + 2);\n addEdge(mat, g, i, j, i + 1, j + 2);\n addEdge(mat, g, i, j, i + 3, j);\n addEdge(mat, g, i, j, i + 2, j - 1);\n addEdge(mat, g, i, j, i + 2, j + 1);\n }\n }\n }\n\n HopcroftKarpBipartiteMatching bpm = new HopcroftKarpBipartiteMatching(u - 1, v - 1, g);\n\n ans += 2 * bpm.maximumMatching();\n\n out.println(ans);\n }\n\n void addEdge(int[][] mat, List[] g, int i, int j, int s, int t) {\n if (s <= 0 || t <= 0 || s > n || t > m)\n return;\n\n g[mat[i][j]].add(mat[s][t]);\n }\n\n class HopcroftKarpBipartiteMatching {\n int m;\n int n;\n List[] g;\n int[] pairU;\n int[] pairV;\n int[] dis;\n int inf = 10000000;\n int NIL = 0;\n\n public HopcroftKarpBipartiteMatching(int m, int n, List[] g) {\n this.m = m;\n this.n = n;\n this.g = g;\n this.pairU = new int[m + 1];\n this.pairV = new int[n + 1];\n this.dis = new int[m + 1];\n }\n\n int maximumMatching() {\n\n Arrays.fill(pairU, NIL);\n Arrays.fill(pairV, NIL);\n\n int maxMatching = 0;\n\n while (bfs()) {\n for (int i = 1; i <= m; i++) {\n if (pairU[i] == NIL && dfs(i))\n maxMatching++;\n }\n }\n\n return maxMatching;\n }\n\n boolean bfs() {\n\n ArrayDeque<Integer> queue = new ArrayDeque<>();\n\n for (int i = 1; i <= m; i++) {\n if (pairU[i] == NIL) {\n queue.addLast(i);\n dis[i] = 0;\n } else {\n dis[i] = inf;\n }\n }\n\n dis[NIL] = inf;\n\n while (!queue.isEmpty()) {\n int u = queue.removeFirst();\n\n if (dis[u] < dis[NIL]) {\n for (int v : (List<Integer>) g[u]) {\n if (dis[pairV[v]] == inf) {\n queue.addLast(pairV[v]);\n dis[pairV[v]] = dis[u] + 2;\n }\n }\n }\n }\n\n return dis[NIL] < inf;\n }\n\n boolean dfs(int u) {\n if (u != NIL) {\n for (int v : (List<Integer>) g[u]) {\n if (dis[pairV[v]] == dis[u] + 2) {\n if (dfs(pairV[v])) {\n pairV[v] = u;\n pairU[u] = v;\n return true;\n }\n }\n }\n dis[u] = inf;\n return false;\n } else\n return true;\n }\n\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void println(long i) {\n writer.println(i);\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "graph matchings"], "code_uid": "b44fe343f37647524c52941e829e2cd3", "src_uid": "02ce135a4b276d1e9ba6a4ce37f2fe70", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class B {\n\tstatic PrintWriter out = new PrintWriter(System.out);\n\n\t\n\tpublic static void main(String[] args) {\n\t\tFS in = new FS();\n\t\tlong R = in.nextLong();\n\t\tlong C = in.nextLong();\n\t\tlong res = solve(Math.min(R, C), Math.max(R, C));\n\t\tout.println(res);\n\t\tout.close();\n\t}\n\t\n\tstatic long solve(long r, long c) {\n\t\tif(r < 3 && c < 3) return 0;\n\t\tif(r == 1) {\n\t\t\tlong res = c;\n\t\t\tlong m = c%6;\n\t\t\tif(m != 0) {\n\t\t\t\tif(m <= 3) res -= m;\n\t\t\t\tif(m == 4) res -= 2;\n\t\t\t\tif(m == 5) res -= 1;\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\tif(r == 2) {\n\t\t\tif(c == 3 || c == 7) return r * (c-1);\n\t\t\treturn r*c;\n\t\t}\n\t\tlong res = r*c;\n\t\tif(res%2 == 0) return res;\n\t\treturn res-1;\n\t}\n\t\n//\tstatic long solve(long r, long c) {\n//\t\tif(r > c) {\n//\t\t\tlong tmp = r;\n//\t\t\tr = c;\n//\t\t\tc = tmp;\n//\t\t}\n//\t\tif(r < 3 && c < 3) return 0;\n//\n//\t\tlong res = 0;\n//\t\tlong sp = (c%2 == 1 ? 1 : 0);\n//\t\tlong s = c/2;\n//\t\t\n//\t\t//see if anyone gets left out\n//\t\tlong hd = s + sp;\n//\t\tif(hd >= 3 || ) res = s*r;\n\t\t\n//\t\tres += solve(sp, r);\n//\t}\n\t\n\tstatic class FS{\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\t\tpublic FS() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\t\tString next() {\n\t\t\twhile(st == null || !st.hasMoreElements()) {\n\t\t\t\ttry {st = new StringTokenizer(br.readLine());}\n\t\t\t\tcatch(Exception e) { throw null;}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\t\tint nextInt() { return Integer.parseInt(next());}\n\t\tdouble nextDouble() { return Double.parseDouble(next());}\n\t\tlong nextLong() { return Long.parseLong(next());}\n\t\tint[] NIA(int n) {\n\t\t\tint r[] = new int[n];\n\t\t\tfor(int i = 0; i < n; i++) r[i] = nextInt();\n\t\t\treturn r;\n\t\t}\n\t\tlong[] NLA(int n) {\n\t\t\tlong r[] = new long[n];\n\t\t\tfor(int i = 0; i < n; i++) r[i] = nextLong();\n\t\t\treturn r;\n\t\t}\n\t\tchar[][] grid(int r, int c){\n\t\t\tchar res[][] = new char[r][c];\n\t\t\tfor(int i = 0; i < r; i++) {\n\t\t\t\tchar l[] = next().toCharArray();\n\t\t\t\tfor(int j = 0; j < c; j++) {\n\t\t\t\t\tres[i][j] = l[j];\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t}\n\t\n}\n", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "graph matchings"], "code_uid": "15fccd68d9183309f0c039227d979b49", "src_uid": "02ce135a4b276d1e9ba6a4ce37f2fe70", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class P1047D\n{\n\tstatic int[][] grid;\n\tstatic int R, C;\n\tpublic static void main(String[] args)\n\t{\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tint m = scan.nextInt();\n\t\tlong min = Math.min(n, m);\n\t\tlong max = Math.max(n, m);\n\t\tif (min == 1)\n\t\t\tSystem.out.println(max/6*6 + 2*Math.max(0, max%6-3));\n\t\telse if (min == 2 && max == 2)\n\t\t\tSystem.out.println(0);\n\t\telse if (min == 2 && max == 3)\n\t\t\tSystem.out.println(4);\n\t\telse if (min == 3 && max == 3)\n\t\t\tSystem.out.println(8);\n\t\telse if (min == 2 && max == 7)\n\t\t\tSystem.out.println(12);\n\t\telse if (max%2 == 0)\n\t\t\tSystem.out.println(min*max);\n\t\telse // if (max%2 == 1)\n\t\t\tSystem.out.println(min*max - min*max%2);\n\t}\n\tprivate static boolean can(int cur, int r, int c)\n\t{\n\t\tif (cur > R*C/2)\n\t\t{\n//\t\t\tfor (int i = 0; i < grid.length; i++)\n//\t\t\t{\n//\t\t\t\tfor (int j = 0; j < grid[0].length; j++)\n//\t\t\t\t\tSystem.out.printf(\"%3d\", grid[i][j]);\n//\t\t\t\tSystem.out.println();\n//\t\t\t}\n//\t\t\tSystem.out.println();\n\t\t\treturn true;\n\t\t}\n\t\tif (c >= C)\n\t\t\treturn can(cur, r+1, 0);\n\t\tif (grid[r][c] != 0)\n\t\t\treturn can(cur, r, c+1);\n\t\tgrid[r][c] = cur;\n\t\tfor (int dr = 0; dr <= 3; dr++)\n\t\t{\n\t\t\tfor (int dc = -2; dc <= 3; dc++)\n\t\t\t{\n\t\t\t\tif (dr+Math.abs(dc) != 3)\n\t\t\t\t\tcontinue;\n\t\t\t\tif (ok(r+dr, c+dc))\n\t\t\t\t{\n\t\t\t\t\tgrid[r+dr][c+dc] = cur;\n\t\t\t\t\tif (can(cur+1, r, c+1))\n\t\t\t\t\t\treturn true;\n\t\t\t\t\tgrid[r+dr][c+dc] = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tgrid[r][c] = 0;\n\t\treturn false;\n\t}\n\tprivate static boolean ok(int r, int c)\n\t{\n\t\treturn r >= 0 && c >= 0 && r < R && c < C && grid[r][c] == 0;\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "graph matchings"], "code_uid": "b361a7f385d30d3a3cc8d2ae964df922", "src_uid": "02ce135a4b276d1e9ba6a4ce37f2fe70", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.IOException;\nimport java.util.ArrayList;\nimport java.io.UncheckedIOException;\nimport java.util.List;\nimport java.io.Closeable;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) throws Exception {\n Thread thread = new Thread(null, new TaskAdapter(), \"\", 1 << 27);\n thread.start();\n thread.join();\n }\n\n static class TaskAdapter implements Runnable {\n @Override\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastInput in = new FastInput(inputStream);\n FastOutput out = new FastOutput(outputStream);\n BLittleCLoves3II solver = new BLittleCLoves3II();\n solver.solve(1, in, out);\n out.close();\n }\n }\n\n static class BLittleCLoves3II {\n int n;\n int m;\n\n public void solve(int testNumber, FastInput in, FastOutput out) {\n n = in.readInt();\n m = in.readInt();\n\n long ans = 0;\n int remain = 30;\n if (n > remain) {\n int extra = n - remain;\n ans += (long) (extra - extra % 6) * m;\n n -= extra - extra % 6;\n }\n if (m > remain) {\n int extra = m - remain;\n ans += (long) (extra - extra % 6) * n;\n m -= extra - extra % 6;\n }\n\n KMAlgo km = new KMAlgo(n * m, n * m);\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n if ((i + j) % 2 != 0) {\n continue;\n }\n for (int k = 0; k < n; k++) {\n for (int t = 0; t < m; t++) {\n if ((k + t) % 2 != 1) {\n continue;\n }\n if (Math.abs(i - k) + Math.abs(j - t) == 3) {\n km.addEdge(cellId(i, j), cellId(k, t), true);\n }\n }\n }\n }\n }\n\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n if (km.matchLeft(cellId(i, j))) {\n ans += 2;\n }\n }\n }\n\n out.println(ans);\n }\n\n int cellId(int i, int j) {\n return i * m + j;\n }\n\n }\n\n static class FastInput {\n private final InputStream is;\n private byte[] buf = new byte[1 << 20];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastInput(InputStream is) {\n this.is = is;\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n bufLen = -1;\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public int readInt() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n }\n\n static class FastOutput implements AutoCloseable, Closeable, Appendable {\n private StringBuilder cache = new StringBuilder(10 << 20);\n private final Writer os;\n\n public FastOutput append(CharSequence csq) {\n cache.append(csq);\n return this;\n }\n\n public FastOutput append(CharSequence csq, int start, int end) {\n cache.append(csq, start, end);\n return this;\n }\n\n public FastOutput(Writer os) {\n this.os = os;\n }\n\n public FastOutput(OutputStream os) {\n this(new OutputStreamWriter(os));\n }\n\n public FastOutput append(char c) {\n cache.append(c);\n return this;\n }\n\n public FastOutput println(long c) {\n cache.append(c);\n println();\n return this;\n }\n\n public FastOutput println() {\n cache.append(System.lineSeparator());\n return this;\n }\n\n public FastOutput flush() {\n try {\n os.append(cache);\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n return this;\n }\n\n public void close() {\n flush();\n try {\n os.close();\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n\n public String toString() {\n return cache.toString();\n }\n\n }\n\n static class KMAlgo {\n KMAlgo.Node[] leftSides;\n KMAlgo.Node[] rightSides;\n int version;\n\n public KMAlgo(int l, int r) {\n leftSides = new KMAlgo.Node[l];\n for (int i = 0; i < l; i++) {\n leftSides[i] = new KMAlgo.Node();\n leftSides[i].id = i;\n leftSides[i].leftSide = true;\n }\n rightSides = new KMAlgo.Node[r];\n for (int i = 0; i < r; i++) {\n rightSides[i] = new KMAlgo.Node();\n rightSides[i].id = i;\n }\n }\n\n public void addEdge(int lId, int rId, boolean urge) {\n leftSides[lId].nodes.add(rightSides[rId]);\n rightSides[rId].nodes.add(leftSides[lId]);\n if (urge && leftSides[lId].partner == null && rightSides[rId].partner == null) {\n leftSides[lId].partner = rightSides[rId];\n rightSides[rId].partner = leftSides[lId];\n }\n }\n\n private void prepare() {\n version++;\n }\n\n public boolean matchLeft(int id) {\n if (leftSides[id].partner != null) {\n return true;\n }\n prepare();\n return findPartner(leftSides[id]);\n }\n\n private boolean findPartner(KMAlgo.Node src) {\n if (src.visited == version) {\n return false;\n }\n src.visited = version;\n for (KMAlgo.Node node : src.nodes) {\n if (!tryRelease(node)) {\n continue;\n }\n node.partner = src;\n src.partner = node;\n return true;\n }\n return false;\n }\n\n private boolean tryRelease(KMAlgo.Node src) {\n if (src.visited == version) {\n return false;\n }\n src.visited = version;\n if (src.partner == null) {\n return true;\n }\n if (findPartner(src.partner)) {\n src.partner = null;\n return true;\n }\n return false;\n }\n\n public String toString() {\n StringBuilder builder = new StringBuilder();\n for (int i = 0; i < leftSides.length; i++) {\n if (leftSides[i].partner == null) {\n continue;\n }\n builder.append(leftSides[i].id).append(\" - \").append(leftSides[i].partner.id).append(\"\\n\");\n }\n return builder.toString();\n }\n\n public static class Node {\n List<KMAlgo.Node> nodes = new ArrayList<>();\n int visited;\n KMAlgo.Node partner;\n int id;\n boolean leftSide;\n\n public String toString() {\n return \"\" + id;\n }\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "graph matchings"], "code_uid": "e02d18849edfc2722f620b01d6614803", "src_uid": "02ce135a4b276d1e9ba6a4ce37f2fe70", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.math.BigDecimal;\nimport java.math.BigInteger;\nimport java.text.DecimalFormat;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n static StreamTokenizer in=new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));\n static int nextInt() throws IOException{\n in.nextToken();\n return (int)in.nval;\n }\n static double nextDouble() throws IOException{\n in.nextToken();\n return in.nval;\n }\n static PrintWriter out =new PrintWriter(new OutputStreamWriter(System.out));\n static int t;\n static long n,m;\n static int ans;\n //static Scanner jin=new Scanner(System.in);\n\n public static void main(String args[])throws IOException{\n n = nextInt();\n m = nextInt();\n if(n>m){\n long tmp = m;\n m = n;\n n =tmp;\n }\n if(n == 1){\n if(m%6==0){\n out.println(n*m);\n }\n else if(m%6==1){\n out.println(n*m-1);\n }\n else if(m%6==2){\n out.println(n*m-2);\n }\n else if(m%6==3){\n out.println(n*m-3);\n }\n else if(m%6==4){\n out.println(n*m-2);\n }\n else if(m%6==5){\n out.println(n*m-1);\n }\n }\n else if(n == 2){\n if(m==2){\n out.println(n*m-4);\n }\n else if(m==3){\n out.println(n*m-2);\n }\n else if(m==7){\n out.println(n*m-2);\n }\n else{\n out.println(n*m);\n }\n }\n else if(n == 3){\n if(m%2==0){\n out.println(n*m);\n }\n else if(m%2==1){\n out.println(n*m-1);\n }\n }\n else{\n if(n%2==1&&m%2==1){\n out.println(n*m-1);\n }\n else{\n out.println(n*m);\n }\n }\n out.flush();\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "graph matchings"], "code_uid": "d83d88637ea1fa660bec1eb689128014", "src_uid": "02ce135a4b276d1e9ba6a4ce37f2fe70", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.File;\nimport java.io.FileInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayDeque;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.Map;\nimport java.util.Queue;\nimport java.util.Random;\nimport java.util.StringTokenizer;\nimport java.util.TreeMap;\nimport java.util.TreeSet;\n\nimport static java.util.Arrays.fill;\n\n/**\n * Created by timur on 28.03.15.\n */\n\npublic class TaskD {\n boolean eof;\n BufferedReader br;\n StringTokenizer st;\n PrintWriter out;\n\n public static void main(String[] args) throws IOException {\n new TaskD().run();\n }\n\n public String nextToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (Exception e) {\n eof = true;\n return \"-1\";\n }\n }\n return st.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(nextToken());\n }\n\n public long nextLong() {\n return Long.parseLong(nextToken());\n }\n\n double nextDouble() {\n return Double.parseDouble(nextToken());\n }\n\n String nextLine() throws IOException {\n return br.readLine();\n }\n\n\n void run() throws IOException {\n InputStream input = System.in;\n PrintStream output = System.out;\n try {\n File f = new File(\"a.in\");\n if (f.exists() && f.canRead()) {\n input = new FileInputStream(f);\n output = new PrintStream(\"a.out\");\n }\n } catch (Throwable e) {\n }\n br = new BufferedReader(new InputStreamReader(input));\n out = new PrintWriter(output);\n solve();\n br.close();\n out.close();\n }\n\n void solve() {\n long n = nextLong(), m = nextLong();\n long x;\n if (n > m) {\n x = m;\n m = n;\n n = x;\n }\n if (n > 3) {\n out.print(n * m - (n * m) % 2);\n } else {\n long s = m - m % 6;\n long h = 0, o = m % 6;\n if (n == 1) {\n if (o == 4) {\n h = 2;\n } else if (o == 5) {\n h = 4;\n } else {\n h = 0;\n }\n } else if (n == 2) {\n if (o == 3) {\n h = 4;\n } else if (o == 4) {\n h = 8;\n } else if (o == 5) {\n h = 10;\n } else {\n h = 0;\n }\n } else if (n == 3) {\n if (o == 2) {\n h = 4;\n } else if (o == 3) {\n h = 8;\n } else if (o == 4) {\n h = 12;\n } else if (o == 5) {\n h = 14;\n } else {\n h = 0;\n }\n }\n if (n + m > 9 && n > 1) {\n out.print(n * m - (n * m) % 2);\n return;\n }\n out.print(s * n + h);\n }\n\n }\n\n}", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "graph matchings"], "code_uid": "6b87d5d143798fd651d031e6487c9f71", "src_uid": "02ce135a4b276d1e9ba6a4ce37f2fe70", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\n/*\n * To change this license header, choose License Headers in Project Properties.\n * To change this template file, choose Tools | Templates\n744444444747477777774\n44444447474747777777\n */\n\n/**\n *\n * @author Andy Phan\n */\npublic class b {\n public static void main(String[] args) {\n FS in = new FS(System.in);\n PrintWriter out = new PrintWriter(System.out);\n \n int n = in.nextInt();\n int m = in.nextInt();\n if(n > m) {\n n ^= m;\n m ^= n;\n n ^= m;\n }\n if(n > 2) System.out.println((long)n*m/2*2);\n else if(n == 1) System.out.println(m/6*6+2*Math.max((m%6-3), 0));\n else if(m == 2) System.out.println(0);\n else if(m == 3) System.out.println(4);\n else if(m == 7) System.out.println(12);\n else System.out.println(2*m);\n \n out.close();\n }\n \n static class FS {\n\n BufferedReader in;\n StringTokenizer token;\n \n public FS(InputStream str) {\n in = new BufferedReader(new InputStreamReader(str));\n }\n \n public String next() {\n if (token == null || !token.hasMoreElements()) {\n try {\n token = new StringTokenizer(in.readLine());\n } catch (IOException ex) {\n }\n return next();\n }\n return token.nextToken();\n }\n \n public int nextInt() {\n return Integer.parseInt(next());\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "graph matchings"], "code_uid": "977bdea313de1bf37d08b64299ba738f", "src_uid": "02ce135a4b276d1e9ba6a4ce37f2fe70", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.math.*;\nimport java.util.*;\n\npublic class B_littleCLoves3II {\n public static void main(String[] args) throws IOException {\n FastScanner sc = new FastScanner(System.in);\n PrintWriter pw = new PrintWriter(System.out);\n \n long n = sc.nextInt();\n long m = sc.nextInt();\n if (n == 1 && m == 1) {\n \tpw.println(0);\n }\n else if (n == 1) {\n \tif (m % 6 == 0 || m % 6 == 1 || m % 6 == 2 || m % 6 == 3) {\n \t\tpw.println(6*(m/6));\n \t}\n \telse if (m % 6 == 4) {\n \t\tpw.println(6*(m/6)+2);\n \t}\n \telse if (m % 6 == 5) {\n \t\tpw.println(6*(m/6)+4);\n \t}\n }\n else if (m == 1) {\n \tif (n % 6 == 0 || n % 6 == 1 || n % 6 == 2 || n % 6 == 3) {\n \t\tpw.println(6*(n/6));\n \t}\n \telse if (m % 6 == 4) {\n \t\tpw.println(6*(n/6)+2);\n \t}\n \telse if (m % 6 == 5) {\n \t\tpw.println(6*(n/6)+4);\n \t}\n }\n else if (n == 2 && m == 2) {\n \tpw.println(0);\n }\n else if (n == 2 && m == 3 || n == 3 && m == 2) {\n \tpw.println(4);\n }\n else if (n == 2 && m == 7 || n == 7 && m == 2) {\n \tpw.println(12);\n }\n else if (n % 2 == 0 || m % 2 == 0) {\n \tpw.println(n*m);\n }\n else {\n \tpw.println(n*m-1);\n }\n \n pw.close();\n }\n static class FastScanner {\n \tprivate boolean finished = false;\n\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private SpaceCharFilter filter;\n\n public FastScanner(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n public int peek() {\n if (numChars == -1) {\n return -1;\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n return -1;\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar];\n }\n\n public int nextInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n public long nextLong() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public String nextString() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n StringBuilder res = new StringBuilder();\n do {\n if (Character.isValidCodePoint(c)) {\n res.appendCodePoint(c);\n }\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n private String readLine0() {\n StringBuilder buf = new StringBuilder();\n int c = read();\n while (c != '\\n' && c != -1) {\n if (c != '\\r') {\n buf.appendCodePoint(c);\n }\n c = read();\n }\n return buf.toString();\n }\n public String readLine() {\n String s = readLine0();\n while (s.trim().length() == 0) {\n s = readLine0();\n }\n return s;\n }\n public String readLine(boolean ignoreEmptyLines) {\n if (ignoreEmptyLines) {\n return readLine();\n } else {\n return readLine0();\n }\n }\n\n public BigInteger readBigInteger() {\n try {\n return new BigInteger(nextString());\n } catch (NumberFormatException e) {\n throw new InputMismatchException();\n }\n }\n\n public char nextCharacter() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n return (char) c;\n }\n\n public double nextDouble() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E') {\n return res * Math.pow(10, nextInt());\n }\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E') {\n return res * Math.pow(10, nextInt());\n }\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n\n public boolean isExhausted() {\n int value;\n while (isSpaceChar(value = peek()) && value != -1) {\n read();\n }\n return value == -1;\n }\n public String next() {\n return nextString();\n }\n\n public SpaceCharFilter getFilter() {\n return filter;\n }\n\n public void setFilter(SpaceCharFilter filter) {\n this.filter = filter;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n public int[] nextIntArray(int n){\n int[] array=new int[n];\n for(int i=0;i<n;++i)array[i]=nextInt();\n return array;\n }\n public int[] nextSortedIntArray(int n){\n int array[]=nextIntArray(n);\n PriorityQueue<Integer> pq = new PriorityQueue<Integer>();\n for(int i = 0; i < n; i++){\n pq.add(array[i]);\n }\n int[] out = new int[n];\n for(int i = 0; i < n; i++){\n out[i] = pq.poll();\n }\n return out;\n }\n public int[] nextSumIntArray(int n){\n int[] array=new int[n];\n array[0]=nextInt();\n for(int i=1;i<n;++i)array[i]=array[i-1]+nextInt();\n return array;\n }\n public ArrayList<Integer>[] nextGraph(int n, int m){\n ArrayList<Integer>[] adj = new ArrayList[n];\n for(int i = 0; i < n; i++){\n adj[i] = new ArrayList<Integer>();\n }\n for(int i = 0; i < m; i++){\n int u = nextInt(); int v = nextInt();\n u--; v--;\n adj[u].add(v); adj[v].add(u);\n }\n return adj;\n }\n public ArrayList<Integer>[] nextTree(int n){\n return nextGraph(n, n-1);\n }\n\n public long[] nextLongArray(int n){\n long[] array=new long[n];\n for(int i=0;i<n;++i)array[i]=nextLong();\n return array;\n }\n public long[] nextSumLongArray(int n){\n long[] array=new long[n];\n array[0]=nextInt();\n for(int i=1;i<n;++i)array[i]=array[i-1]+nextInt();\n return array;\n }\n public long[] nextSortedLongArray(int n){\n long array[]=nextLongArray(n);\n Arrays.sort(array);\n return array;\n }\n }\n\tstatic void shuffle(int[] a) {\n\t\tRandom get = new Random();\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\tint r = get.nextInt(a.length);\n\t\t\tint temp = a[i];\n\t\t\ta[i] = a[r];\n\t\t\ta[r] = temp;\n\t\t}\n\t}\n\tstatic void shuffle(long[] a) {\n\t\tRandom get = new Random();\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\tint r = get.nextInt(a.length);\n\t\t\tlong temp = a[i];\n\t\t\ta[i] = a[r];\n\t\t\ta[r] = temp;\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "graph matchings"], "code_uid": "d308178af46b987a7e1066d986a1a506", "src_uid": "02ce135a4b276d1e9ba6a4ce37f2fe70", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastScanner in = new FastScanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n BDiv1 solver = new BDiv1();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class BDiv1 {\n public void solve(int testNumber, FastScanner in, PrintWriter out) {\n long n = in.ni(), m = in.ni();\n if (n > m) {\n long t = n;\n n = m;\n m = t;\n }\n if (n == 1) {\n if (m % 6 == 0)\n out.println(m);\n else if (m % 6 == 1)\n out.println(m - 1);\n else if (m % 6 == 2)\n out.println(m - 2);\n else if (m % 6 == 3)\n out.println(m - 3);\n else if (m % 6 == 4)\n out.println(m - 2);\n else if (m % 6 == 5) {\n out.println(m - 1);\n }\n } else if (n == 2) {\n if (m == 2)\n out.println(0);\n else if (m == 3)\n out.println(4);\n else if (m == 7)\n out.println(12);\n else\n out.println(m * 2);\n } else {\n if (n * m % 2 == 1) {\n out.println(n * m - 1);\n } else {\n out.println(n * m);\n }\n }\n }\n\n }\n\n static class FastScanner {\n private BufferedReader in;\n private StringTokenizer st;\n\n public FastScanner(InputStream stream) {\n in = new BufferedReader(new InputStreamReader(stream));\n }\n\n public String ns() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n String rl = in.readLine();\n if (rl == null) {\n return null;\n }\n st = new StringTokenizer(rl);\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return st.nextToken();\n }\n\n public int ni() {\n return Integer.parseInt(ns());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "graph matchings"], "code_uid": "a1cdc3c2155af1bde3c1f9c394307261", "src_uid": "02ce135a4b276d1e9ba6a4ce37f2fe70", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package baobab;\n\nimport java.io.*;\nimport java.util.*;\n\npublic class D {\n\n public static void main(String[] args) {\n Solver solver = new Solver();\n }\n\n static class Solver {\n IO io;\n\n public Solver() {\n this.io = new IO();\n try {\n solve();\n } catch (RuntimeException e) {\n if (!e.getMessage().equals(\"Clean exit\")) {\n throw e;\n }\n } finally {\n io.close();\n }\n }\n\n /****************************** START READING HERE ********************************/\n\n\n //TODO brutetester?\n\n void solve() {\n long n = io.nextLong();\n long m = io.nextLong();\n if (m < n) {\n long helper = m;\n m = n;\n n = helper;\n }\n\n if (n == 1) {\n io.println(brute1(m));\n return;\n }\n if (n == 2) {\n if (m < 3) io.println(0);\n else if (m == 3) io.println(4);\n else if (m == 7) io.println(12);\n else io.println(2*m);\n return;\n }\n\n // general case solution:\n io.println(2*(n*m/2)); // jos pariton maara ruutuja ni ei voi laittaa vikaa millaan\n // muuten vaikuttaisi että voi aina laittaa kaikkiin ruutuihin\n }\n\n long brute1(long m) {\n long ans = 6*(m/6);\n if (m%6 == 5) ans += 4;\n else if (m%6 == 4) ans += 2;\n return ans;\n }\n\n /************************** UTILITY CODE BELOW THIS LINE **************************/\n\n long MOD = (long)1e9 + 7;\n\n boolean closeToZero(double v) {\n // Check if double is close to zero, considering precision issues.\n return Math.abs(v) <= 0.0000000000001;\n }\n\n class DrawGrid {\n\n void draw(boolean[][] d) {\n System.out.print(\" \");\n for (int x=0; x<d[0].length; x++) {\n System.out.print(\" \" + x + \" \");\n }\n System.out.println(\"\");\n for (int y=0; y<d.length; y++) {\n System.out.print(y + \" \");\n for (int x=0; x<d[0].length; x++) {\n System.out.print((d[y][x] ? \"[x]\" : \"[ ]\"));\n }\n System.out.println(\"\");\n }\n }\n\n void draw(int[][] d) {\n int max = 1;\n for (int y=0; y<d.length; y++) {\n for (int x=0; x<d[0].length; x++) {\n max = Math.max(max, (\"\" + d[y][x]).length());\n }\n }\n System.out.print(\" \");\n String format = \"%\" + (max+2) + \"s\";\n for (int x=0; x<d[0].length; x++) {\n System.out.print(String.format(format, x) + \" \");\n }\n format = \"%\" + (max) + \"s\";\n System.out.println(\"\");\n for (int y=0; y<d.length; y++) {\n System.out.print(y + \" \");\n for (int x=0; x<d[0].length; x++) {\n System.out.print(\" [\" + String.format(format, (d[y][x])) + \"]\");\n }\n System.out.println(\"\");\n }\n }\n\n }\n\n class IDval implements Comparable<IDval> {\n int id;\n long val;\n\n public IDval(int id, long val) {\n this.val = val;\n this.id = id;\n }\n\n @Override\n public int compareTo(IDval o) {\n if (this.val < o.val) return -1;\n if (this.val > o.val) return 1;\n return this.id - o.id;\n }\n }\n\n private class ElementCounter {\n private HashMap<Long, Integer> elements;\n\n public ElementCounter() {\n elements = new HashMap<>();\n }\n\n public void add(long element) {\n int count = 1;\n Integer prev = elements.get(element);\n if (prev != null) count += prev;\n elements.put(element, count);\n }\n\n public void remove(long element) {\n int count = elements.remove(element);\n count--;\n if (count > 0) elements.put(element, count);\n }\n\n public int get(long element) {\n Integer val = elements.get(element);\n if (val == null) return 0;\n return val;\n }\n\n public int size() {\n return elements.size();\n }\n }\n\n class StringCounter {\n HashMap<String, Integer> elements;\n\n public StringCounter() {\n elements = new HashMap<>();\n }\n\n public void add(String identifier) {\n int count = 1;\n Integer prev = elements.get(identifier);\n if (prev != null) count += prev;\n elements.put(identifier, count);\n }\n\n public void remove(String identifier) {\n int count = elements.remove(identifier);\n count--;\n if (count > 0) elements.put(identifier, count);\n }\n\n public long get(String identifier) {\n Integer val = elements.get(identifier);\n if (val == null) return 0;\n return val;\n }\n\n public int size() {\n return elements.size();\n }\n }\n\n class DisjointSet {\n /** Union Find / Disjoint Set data structure. */\n int[] size;\n int[] parent;\n int componentCount;\n\n public DisjointSet(int n) {\n componentCount = n;\n size = new int[n];\n parent = new int[n];\n for (int i=0; i<n; i++) parent[i] = i;\n for (int i=0; i<n; i++) size[i] = 1;\n }\n\n public void join(int a, int b) {\n /* Find roots */\n int rootA = parent[a];\n int rootB = parent[b];\n while (rootA != parent[rootA]) rootA = parent[rootA];\n while (rootB != parent[rootB]) rootB = parent[rootB];\n\n if (rootA == rootB) {\n /* Already in the same set */\n return;\n }\n\n /* Merge smaller set into larger set. */\n if (size[rootA] > size[rootB]) {\n size[rootA] += size[rootB];\n parent[rootB] = rootA;\n } else {\n size[rootB] += size[rootA];\n parent[rootA] = rootB;\n }\n componentCount--;\n }\n\n }\n\n class Trie {\n int N;\n int Z;\n int nextFreeId;\n int[][] pointers;\n boolean[] end;\n\n /** maxLenSum = maximum possible sum of length of words */\n public Trie(int maxLenSum, int alphabetSize) {\n this.N = maxLenSum;\n this.Z = alphabetSize;\n this.nextFreeId = 1;\n pointers = new int[N+1][alphabetSize];\n end = new boolean[N+1];\n }\n\n public void addWord(String word) {\n int curr = 0;\n for (int j=0; j<word.length(); j++) {\n int c = word.charAt(j) - 'a';\n int next = pointers[curr][c];\n if (next == 0) {\n next = nextFreeId++;\n pointers[curr][c] = next;\n }\n curr = next;\n }\n end[curr] = true;\n }\n\n public boolean hasWord(String word) {\n int curr = 0;\n for (int j=0; j<word.length(); j++) {\n int c = word.charAt(j) - 'a';\n int next = pointers[curr][c];\n if (next == 0) return false;\n curr = next;\n }\n return end[curr];\n }\n\n }\n\n private static class Prob {\n\n /** For heavy calculations on probabilities, this class\n * provides more accuracy & efficiency than doubles.\n * Math explained: https://en.wikipedia.org/wiki/Log_probability\n * Quick start:\n * - Instantiate probabilities, eg. Prob a = new Prob(0.75)\n * - add(), multiply() return new objects, can perform on nulls & NaNs.\n * - get() returns probability as a readable double */\n\n /** Logarithmized probability. Note: 0% represented by logP NaN. */\n private double logP;\n\n /** Construct instance with real probability. */\n public Prob(double real) {\n if (real > 0) this.logP = Math.log(real);\n else this.logP = Double.NaN;\n }\n\n /** Construct instance with already logarithmized value. */\n static boolean dontLogAgain = true;\n public Prob(double logP, boolean anyBooleanHereToChooseThisConstructor) {\n this.logP = logP;\n }\n\n /** Returns real probability as a double. */\n public double get() {\n return Math.exp(logP);\n }\n\n @Override\n public String toString() {\n return \"\"+get();\n }\n\n /***************** STATIC METHODS BELOW ********************/\n\n /** Note: returns NaN only when a && b are both NaN/null. */\n public static Prob add(Prob a, Prob b) {\n if (nullOrNaN(a) && nullOrNaN(b)) return new Prob(Double.NaN, dontLogAgain);\n if (nullOrNaN(a)) return copy(b);\n if (nullOrNaN(b)) return copy(a);\n\n double x = Math.max(a.logP, b.logP);\n double y = Math.min(a.logP, b.logP);\n double sum = x + Math.log(1 + Math.exp(y - x));\n return new Prob(sum, dontLogAgain);\n }\n\n /** Note: multiplying by null or NaN produces NaN (repping 0% real prob). */\n public static Prob multiply(Prob a, Prob b) {\n if (nullOrNaN(a) || nullOrNaN(b)) return new Prob(Double.NaN, dontLogAgain);\n return new Prob(a.logP + b.logP, dontLogAgain);\n }\n\n /** Returns true if p is null or NaN. */\n private static boolean nullOrNaN(Prob p) {\n return (p == null || Double.isNaN(p.logP));\n }\n\n /** Returns a new instance with the same value as original. */\n private static Prob copy(Prob original) {\n return new Prob(original.logP, dontLogAgain);\n }\n }\n\n class Binary implements Comparable<Binary> {\n\n /**\n * Use example: Binary b = new Binary(Long.toBinaryString(53249834L));\n *\n * When manipulating small binary strings, instantiate new Binary(string)\n * When just reading large binary strings, instantiate new Binary(string,true)\n * get(int i) returns a character '1' or '0', not an int.\n */\n\n private boolean[] d;\n private int first; // Starting from left, the first (most remarkable) '1'\n public int length;\n\n\n public Binary(String binaryString) {\n this(binaryString, false);\n }\n public Binary(String binaryString, boolean initWithMinArraySize) {\n length = binaryString.length();\n int size = Math.max(2*length, 1);\n first = length/4;\n if (initWithMinArraySize) {\n first = 0;\n size = Math.max(length, 1);\n }\n d = new boolean[size];\n for (int i=0; i<length; i++) {\n if (binaryString.charAt(i) == '1') d[i+first] = true;\n }\n }\n\n public void addFirst(char c) {\n if (first-1 < 0) doubleArraySize();\n first--;\n d[first] = (c == '1' ? true : false);\n length++;\n }\n\n public void addLast(char c) {\n if (first+length >= d.length) doubleArraySize();\n d[first+length] = (c == '1' ? true : false);\n length++;\n }\n\n private void doubleArraySize() {\n boolean[] bigArray = new boolean[(d.length+1) * 2];\n int newFirst = bigArray.length / 4;\n for (int i=0; i<length; i++) {\n bigArray[i + newFirst] = d[i + first];\n }\n first = newFirst;\n d = bigArray;\n }\n\n public boolean flip(int i) {\n boolean value = (this.d[first+i] ? false : true);\n this.d[first+i] = value;\n return value;\n }\n\n public void set(int i, char c) {\n boolean value = (c == '1' ? true : false);\n this.d[first+i] = value;\n }\n\n public char get(int i) {\n return (this.d[first+i] ? '1' : '0');\n }\n\n @Override\n public int compareTo(Binary o) {\n if (this.length != o.length) return this.length - o.length;\n int len = this.length;\n for (int i=0; i<len; i++) {\n int diff = this.get(i) - o.get(i);\n if (diff != 0) return diff;\n }\n return 0;\n }\n\n @Override\n public String toString() {\n StringBuilder sb = new StringBuilder();\n for (int i=0; i<length; i++) {\n sb.append(d[i+first] ? '1' : '0');\n }\n return sb.toString();\n }\n\n\n }\n\n /************************** Range queries **************************/\n\n class FenwickMin {\n long n;\n long[] original;\n long[] bottomUp;\n long[] topDown;\n\n public FenwickMin(int n) {\n this.n = n;\n original = new long[n+2];\n bottomUp = new long[n+2];\n topDown = new long[n+2];\n }\n\n public void set(int modifiedNode, long value) {\n long replaced = original[modifiedNode];\n original[modifiedNode] = value;\n // Update left tree\n int i = modifiedNode;\n long v = value;\n while (i <= n) {\n if (v > bottomUp[i]) {\n if (replaced == bottomUp[i]) {\n v = Math.min(v, original[i]);\n for (int r=1 ;; r++) {\n int x = (i&-i)>>>r;\n if (x == 0) break;\n int child = i-x;\n v = Math.min(v, bottomUp[child]);\n }\n } else break;\n }\n if (v == bottomUp[i]) break;\n bottomUp[i] = v;\n i += (i&-i);\n }\n // Update right tree\n i = modifiedNode;\n v = value;\n while (i > 0) {\n if (v > topDown[i]) {\n if (replaced == topDown[i]) {\n v = Math.min(v, original[i]);\n for (int r=1 ;; r++) {\n int x = (i&-i)>>>r;\n if (x == 0) break;\n int child = i+x;\n if (child > n+1) break;\n v = Math.min(v, topDown[child]);\n }\n } else break;\n }\n if (v == topDown[i]) break;\n topDown[i] = v;\n i -= (i&-i);\n }\n }\n\n public long getMin(int a, int b) {\n long min = original[a];\n int prev = a;\n int curr = prev + (prev&-prev); // parent right hand side\n while (curr <= b) {\n min = Math.min(min, topDown[prev]); // value from the other tree\n prev = curr;\n curr = prev + (prev&-prev);;\n }\n min = Math.min(min, original[prev]);\n prev = b;\n curr = prev - (prev&-prev); // parent left hand side\n while (curr >= a) {\n min = Math.min(min,bottomUp[prev]); // value from the other tree\n prev = curr;\n curr = prev - (prev&-prev);\n }\n return min;\n }\n\n }\n\n class FenwickSum {\n public long[] d;\n\n public FenwickSum(int n) {\n d=new long[n+1];\n }\n\n /** a[0] must be unused. */\n public FenwickSum(long[] a) {\n d=new long[a.length];\n for (int i=1; i<a.length; i++) {\n modify(i, a[i]);\n }\n }\n\n /** Do not modify i=0. */\n void modify(int i, long v) {\n while (i<d.length) {\n d[i] += v;\n // Move to next uplink on the RIGHT side of i\n i += (i&-i);\n }\n }\n\n /** Returns sum from a to b, *BOTH* inclusive. */\n long getSum(int a, int b) {\n return getSum(b) - getSum(a-1);\n }\n\n private long getSum(int i) {\n long sum = 0;\n while (i>0) {\n sum += d[i];\n // Move to next uplink on the LEFT side of i\n i -= (i&-i);\n }\n return sum;\n }\n }\n\n class SegmentTree {\n\n /* Provides log(n) operations for:\n * - Range query (sum, min or max)\n * - Range update (\"+8 to all values between indexes 4 and 94\")\n */\n\n int N;\n long[] lazy;\n long[] sum;\n long[] min;\n long[] max;\n boolean supportSum;\n boolean supportMin;\n boolean supportMax;\n\n public SegmentTree(int n) {\n this(n, true, true, true);\n }\n\n public SegmentTree(int n, boolean supportSum, boolean supportMin, boolean supportMax) {\n for (N=2; N<n;) N*=2;\n this.lazy = new long[2*N];\n this.supportSum = supportSum;\n this.supportMin = supportMin;\n this.supportMax = supportMax;\n if (this.supportSum) this.sum = new long[2*N];\n if (this.supportMin) this.min = new long[2*N];\n if (this.supportMax) this.max = new long[2*N];\n }\n\n void modifyRange(long x, int a, int b) {\n modifyRec(a, b, 1, 0, N-1, x);\n }\n\n void setRange() {\n //TODO\n }\n\n long getSum(int a, int b) {\n return querySum(a, b, 1, 0, N-1);\n }\n\n long getMin(int a, int b) {\n return queryMin(a, b, 1, 0, N-1);\n }\n\n long getMax(int a, int b) {\n return queryMax(a, b, 1, 0, N-1);\n }\n\n private long querySum(int wantedLeft, int wantedRight, int i, int actualLeft, int actualRight) {\n if (wantedLeft > actualRight || wantedRight < actualLeft) {\n return 0;\n }\n if (wantedLeft == actualLeft && wantedRight == actualRight) {\n int count = wantedRight - wantedLeft + 1;\n return sum[i] + count * lazy[i];\n }\n if (lazy[i] != 0) propagate(i, actualLeft, actualRight);\n int d = (actualRight - actualLeft + 1) / 2;\n long left = querySum(wantedLeft, min(actualLeft+d-1, wantedRight), 2*i, actualLeft, actualLeft+d-1);\n long right = querySum(max(actualLeft+d, wantedLeft), wantedRight, 2*i+1, actualLeft+d, actualRight);\n return left + right;\n }\n\n private long queryMin(int wantedLeft, int wantedRight, int i, int actualLeft, int actualRight) {\n if (wantedLeft > actualRight || wantedRight < actualLeft) {\n return 0;\n }\n if (wantedLeft == actualLeft && wantedRight == actualRight) {\n return min[i] + lazy[i];\n }\n if (lazy[i] != 0) propagate(i, actualLeft, actualRight);\n int d = (actualRight - actualLeft + 1) / 2;\n long left = queryMin(wantedLeft, min(actualLeft+d-1, wantedRight), 2*i, actualLeft, actualLeft+d-1);\n long right = queryMin(max(actualLeft+d, wantedLeft), wantedRight, 2*i+1, actualLeft+d, actualRight);\n return min(left, right);\n }\n\n private long queryMax(int wantedLeft, int wantedRight, int i, int actualLeft, int actualRight) {\n if (wantedLeft > actualRight || wantedRight < actualLeft) {\n return 0;\n }\n if (wantedLeft == actualLeft && wantedRight == actualRight) {\n return max[i] + lazy[i];\n }\n if (lazy[i] != 0) propagate(i, actualLeft, actualRight);\n int d = (actualRight - actualLeft + 1) / 2;\n long left = queryMax(wantedLeft, min(actualLeft+d-1, wantedRight), 2*i, actualLeft, actualLeft+d-1);\n long right = queryMax(max(actualLeft+d, wantedLeft), wantedRight, 2*i+1, actualLeft+d, actualRight);\n return max(left, right);\n }\n\n private void modifyRec(int wantedLeft, int wantedRight, int i, int actualLeft, int actualRight, long value) {\n if (wantedLeft > actualRight || wantedRight < actualLeft) {\n return;\n }\n if (wantedLeft == actualLeft && wantedRight == actualRight) {\n lazy[i] += value;\n return;\n }\n if (lazy[i] != 0) propagate(i, actualLeft, actualRight);\n int d = (actualRight - actualLeft + 1) / 2;\n modifyRec(wantedLeft, min(actualLeft+d-1, wantedRight), 2*i, actualLeft, actualLeft+d-1, value);\n modifyRec(max(actualLeft+d, wantedLeft), wantedRight, 2*i+1, actualLeft+d, actualRight, value);\n if (supportSum) sum[i] += value * (min(actualRight, wantedRight) - max(actualLeft, wantedLeft) + 1);\n if (supportMin) min[i] = min(min[2*i] + lazy[2*i], min[2*i+1] + lazy[2*i+1]);\n if (supportMax) max[i] = max(max[2*i] + lazy[2*i], max[2*i+1] + lazy[2*i+1]);\n }\n\n private void propagate(int i, int actualLeft, int actualRight) {\n lazy[2*i] += lazy[i];\n lazy[2*i+1] += lazy[i];\n if (supportSum) sum[i] += lazy[i] * (actualRight - actualLeft + 1);\n if (supportMin) min[i] += lazy[i];\n if (supportMax) max[i] += lazy[i];\n lazy[i] = 0;\n }\n\n }\n\n /***************************** Graphs *****************************/\n\n List<Integer>[] toGraph(IO io, int n) {\n List<Integer>[] g = new ArrayList[n+1];\n for (int i=1; i<=n; i++) g[i] = new ArrayList<>();\n for (int i=1; i<=n-1; i++) {\n int a = io.nextInt();\n int b = io.nextInt();\n g[a].add(b);\n g[b].add(a);\n }\n return g;\n }\n\n class Graph {\n HashMap<Long, List<Long>> edges;\n\n public Graph() {\n edges = new HashMap<>();\n }\n\n List<Long> getSetNeighbors(Long node) {\n List<Long> neighbors = edges.get(node);\n if (neighbors == null) {\n neighbors = new ArrayList<>();\n edges.put(node, neighbors);\n }\n return neighbors;\n }\n\n void addBiEdge(Long a, Long b) {\n addEdge(a, b);\n addEdge(b, a);\n }\n\n void addEdge(Long from, Long to) {\n getSetNeighbors(to); // make sure all have initialized lists\n List<Long> neighbors = getSetNeighbors(from);\n neighbors.add(to);\n }\n\n // topoSort variables\n int UNTOUCHED = 0;\n int FINISHED = 2;\n int INPROGRESS = 1;\n HashMap<Long, Integer> vis;\n List<Long> topoAns;\n List<Long> failDueToCycle = new ArrayList<Long>() {{ add(-1L); }};\n\n List<Long> topoSort() {\n topoAns = new ArrayList<>();\n vis = new HashMap<>();\n for (Long a : edges.keySet()) {\n if (!topoDFS(a)) return failDueToCycle;\n }\n Collections.reverse(topoAns);\n return topoAns;\n }\n\n boolean topoDFS(long curr) {\n Integer status = vis.get(curr);\n if (status == null) status = UNTOUCHED;\n if (status == FINISHED) return true;\n if (status == INPROGRESS) {\n return false;\n }\n vis.put(curr, INPROGRESS);\n for (long next : edges.get(curr)) {\n if (!topoDFS(next)) return false;\n }\n vis.put(curr, FINISHED);\n topoAns.add(curr);\n return true;\n }\n\n }\n\n public class StronglyConnectedComponents {\n\n /** Kosaraju's algorithm */\n\n ArrayList<Integer>[] forw;\n ArrayList<Integer>[] bacw;\n\n /** Use: getCount(2, new int[] {1,2}, new int[] {2,1}) */\n public int getCount(int n, int[] mista, int[] minne) {\n forw = new ArrayList[n+1];\n bacw = new ArrayList[n+1];\n for (int i=1; i<=n; i++) {\n forw[i] = new ArrayList<Integer>();\n bacw[i] = new ArrayList<Integer>();\n }\n for (int i=0; i<mista.length; i++) {\n int a = mista[i];\n int b = minne[i];\n forw[a].add(b);\n bacw[b].add(a);\n }\n int count = 0;\n List<Integer> list = new ArrayList<Integer>();\n boolean[] visited = new boolean[n+1];\n for (int i=1; i<=n; i++) {\n dfsForward(i, visited, list);\n }\n visited = new boolean[n+1];\n for (int i=n-1; i>=0; i--) {\n int node = list.get(i);\n if (visited[node]) continue;\n count++;\n dfsBackward(node, visited);\n }\n return count;\n }\n\n public void dfsForward(int i, boolean[] visited, List<Integer> list) {\n if (visited[i]) return;\n visited[i] = true;\n for (int neighbor : forw[i]) {\n dfsForward(neighbor, visited, list);\n }\n list.add(i);\n }\n\n public void dfsBackward(int i, boolean[] visited) {\n if (visited[i]) return;\n visited[i] = true;\n for (int neighbor : bacw[i]) {\n dfsBackward(neighbor, visited);\n }\n }\n }\n\n class LCAFinder {\n\n /* O(n log n) Initialize: new LCAFinder(graph)\n * O(log n) Queries: find(a,b) returns lowest common ancestor for nodes a and b */\n\n int[] nodes;\n int[] depths;\n int[] entries;\n int pointer;\n FenwickMin fenwick;\n\n public LCAFinder(List<Integer>[] graph) {\n this.nodes = new int[(int)10e6];\n this.depths = new int[(int)10e6];\n this.entries = new int[graph.length];\n this.pointer = 1;\n boolean[] visited = new boolean[graph.length+1];\n dfs(1, 0, graph, visited);\n fenwick = new FenwickMin(pointer-1);\n for (int i=1; i<pointer; i++) {\n fenwick.set(i, depths[i] * 1000000L + i);\n }\n }\n\n private void dfs(int node, int depth, List<Integer>[] graph, boolean[] visited) {\n visited[node] = true;\n entries[node] = pointer;\n nodes[pointer] = node;\n depths[pointer] = depth;\n pointer++;\n for (int neighbor : graph[node]) {\n if (visited[neighbor]) continue;\n dfs(neighbor, depth+1, graph, visited);\n nodes[pointer] = node;\n depths[pointer] = depth;\n pointer++;\n }\n }\n\n public int find(int a, int b) {\n int left = entries[a];\n int right = entries[b];\n if (left > right) {\n int temp = left;\n left = right;\n right = temp;\n }\n long mixedBag = fenwick.getMin(left, right);\n int index = (int) (mixedBag % 1000000L);\n return nodes[index];\n }\n }\n\n /**************************** Geometry ****************************/\n\n class Point {\n int y;\n int x;\n\n public Point(int y, int x) {\n this.y = y;\n this.x = x;\n }\n }\n\n boolean segmentsIntersect(double x1, double y1, double x2, double y2, double x3, double y3, double x4, double y4) {\n // Returns true if segment 1-2 intersects segment 3-4\n\n if (x1 == x2 && x3 == x4) {\n // Both segments are vertical\n if (x1 != x3) return false;\n if (min(y1,y2) < min(y3,y4)) {\n return max(y1,y2) >= min(y3,y4);\n } else {\n return max(y3,y4) >= min(y1,y2);\n }\n }\n if (x1 == x2) {\n // Only segment 1-2 is vertical. Does segment 3-4 cross it? y = a*x + b\n double a34 = (y4-y3)/(x4-x3);\n double b34 = y3 - a34*x3;\n double y = a34 * x1 + b34;\n return y >= min(y1,y2) && y <= max(y1,y2) && x1 >= min(x3,x4) && x1 <= max(x3,x4);\n }\n if (x3 == x4) {\n // Only segment 3-4 is vertical. Does segment 1-2 cross it? y = a*x + b\n double a12 = (y2-y1)/(x2-x1);\n double b12 = y1 - a12*x1;\n double y = a12 * x3 + b12;\n return y >= min(y3,y4) && y <= max(y3,y4) && x3 >= min(x1,x2) && x3 <= max(x1,x2);\n }\n double a12 = (y2-y1)/(x2-x1);\n double b12 = y1 - a12*x1;\n double a34 = (y4-y3)/(x4-x3);\n double b34 = y3 - a34*x3;\n if (closeToZero(a12 - a34)) {\n // Parallel lines\n return closeToZero(b12 - b34);\n }\n // Non parallel non vertical lines intersect at x. Is x part of both segments?\n double x = -(b12-b34)/(a12-a34);\n return x >= min(x1,x2) && x <= max(x1,x2) && x >= min(x3,x4) && x <= max(x3,x4);\n }\n\n boolean pointInsideRectangle(Point p, List<Point> r) {\n Point a = r.get(0);\n Point b = r.get(1);\n Point c = r.get(2);\n Point d = r.get(3);\n double apd = areaOfTriangle(a, p, d);\n double dpc = areaOfTriangle(d, p, c);\n double cpb = areaOfTriangle(c, p, b);\n double pba = areaOfTriangle(p, b, a);\n double sumOfAreas = apd + dpc + cpb + pba;\n if (closeToZero(sumOfAreas - areaOfRectangle(r))) {\n if (closeToZero(apd) || closeToZero(dpc) || closeToZero(cpb) || closeToZero(pba)) {\n return false;\n }\n return true;\n }\n return false;\n }\n\n double areaOfTriangle(Point a, Point b, Point c) {\n return 0.5 * Math.abs((a.x-c.x)*(b.y-a.y)-(a.x-b.x)*(c.y-a.y));\n }\n\n double areaOfRectangle(List<Point> r) {\n double side1xDiff = r.get(0).x - r.get(1).x;\n double side1yDiff = r.get(0).y - r.get(1).y;\n double side2xDiff = r.get(1).x - r.get(2).x;\n double side2yDiff = r.get(1).y - r.get(2).y;\n double side1 = Math.sqrt(side1xDiff * side1xDiff + side1yDiff * side1yDiff);\n double side2 = Math.sqrt(side2xDiff * side2xDiff + side2yDiff * side2yDiff);\n return side1 * side2;\n }\n\n boolean pointsOnSameLine(double x1, double y1, double x2, double y2, double x3, double y3) {\n double areaTimes2 = x1 * (y2 - y3) + x2 * (y3 - y1) + x3 * (y1 - y2);\n return (closeToZero(areaTimes2));\n }\n\n class PointToLineSegmentDistanceCalculator {\n\n // Just call this\n double minDistFromPointToLineSegment(double point_x, double point_y, double x1, double y1, double x2, double y2) {\n return Math.sqrt(distToSegmentSquared(point_x, point_y, x1, y1, x2, y2));\n }\n\n private double distToSegmentSquared(double point_x, double point_y, double x1, double y1, double x2, double y2) {\n double l2 = dist2(x1,y1,x2,y2);\n if (l2 == 0) return dist2(point_x, point_y, x1, y1);\n double t = ((point_x - x1) * (x2 - x1) + (point_y - y1) * (y2 - y1)) / l2;\n if (t < 0) return dist2(point_x, point_y, x1, y1);\n if (t > 1) return dist2(point_x, point_y, x2, y2);\n\n double com_x = x1 + t * (x2 - x1);\n double com_y = y1 + t * (y2 - y1);\n return dist2(point_x, point_y, com_x, com_y);\n }\n\n private double dist2(double x1, double y1, double x2, double y2) {\n return Math.pow((x1 - x2), 2) + Math.pow((y1 - y2), 2);\n }\n\n }\n\n /****************************** Math ******************************/\n\n long pow(long base, int exp) {\n if (exp == 0) return 1L;\n long x = pow(base, exp/2);\n long ans = x * x;\n if (exp % 2 != 0) ans *= base;\n return ans;\n }\n\n long gcd(long... v) {\n /** Chained calls to Euclidean algorithm. */\n if (v.length == 1) return v[0];\n long ans = gcd(v[1], v[0]);\n for (int i=2; i<v.length; i++) {\n ans = gcd(ans, v[i]);\n }\n return ans;\n }\n\n long gcd(long a, long b) {\n /** Euclidean algorithm. */\n if (b == 0) return a;\n return gcd(b, a%b);\n }\n\n int[] generatePrimesUpTo(int last) {\n /* Sieve of Eratosthenes. Practically O(n). Values of 0 indicate primes. */\n int[] div = new int[last+1];\n for (int x=2; x<=last; x++) {\n if (div[x] > 0) continue;\n for (int u=2*x; u<=last; u+=x) {\n div[u] = x;\n }\n }\n return div;\n }\n\n long lcm(long a, long b) {\n /** Least common multiple */\n return a * b / gcd(a,b);\n }\n\n class BaseConverter {\n\n /* Palauttaa luvun esityksen kannassa base */\n public String convert(Long number, int base) {\n return Long.toString(number, base);\n }\n\n /* Palauttaa luvun esityksen kannassa baseTo, kun annetaan luku Stringinä kannassa baseFrom */\n public String convert(String number, int baseFrom, int baseTo) {\n return Long.toString(Long.parseLong(number, baseFrom), baseTo);\n }\n\n /* Tulkitsee kannassa base esitetyn luvun longiksi (kannassa 10) */\n public long longify(String number, int baseFrom) {\n return Long.parseLong(number, baseFrom);\n }\n }\n\n class BinomialCoefficients {\n /** Total number of K sized unique combinations from pool of size N (unordered)\n N! / ( K! (N - K)! ) */\n\n /** For simple queries where output fits in long. */\n public long biCo(long n, long k) {\n long r = 1;\n if (k > n) return 0;\n for (long d = 1; d <= k; d++) {\n r *= n--;\n r /= d;\n }\n return r;\n }\n\n /** For multiple queries with same n, different k. */\n public long[] precalcBinomialCoefficientsK(int n, int maxK) {\n long v[] = new long[maxK+1];\n v[0] = 1; // nC0 == 1\n for (int i=1; i<=n; i++) {\n for (int j=Math.min(i,maxK); j>0; j--) {\n v[j] = v[j] + v[j-1]; // Pascal's triangle\n }\n }\n return v;\n }\n\n /** When output needs % MOD. */\n public long[] precalcBinomialCoefficientsK(int n, int k, long M) {\n long v[] = new long[k+1];\n v[0] = 1; // nC0 == 1\n for (int i=1; i<=n; i++) {\n for (int j=Math.min(i,k); j>0; j--) {\n v[j] = v[j] + v[j-1]; // Pascal's triangle\n v[j] %= M;\n }\n }\n return v;\n }\n }\n\n /**************************** Strings ****************************/\n\n class Zalgo {\n\n public int pisinEsiintyma(String haku, String kohde) {\n char[] s = new char[haku.length() + 1 + kohde.length()];\n for (int i=0; i<haku.length(); i++) {\n s[i] = haku.charAt(i);\n }\n int j = haku.length();\n s[j++] = '#';\n for (int i=0; i<kohde.length(); i++) {\n s[j++] = kohde.charAt(i);\n }\n int[] z = toZarray(s);\n int max = 0;\n for (int i=haku.length(); i<z.length; i++) {\n max = Math.max(max, z[i]);\n }\n return max;\n }\n\n public int[] toZarray(char[] s) {\n int n = s.length;\n int[] z = new int[n];\n int a = 0, b = 0;\n for (int i = 1; i < n; i++) {\n if (i > b) {\n for (int j = i; j < n && s[j - i] == s[j]; j++) z[i]++;\n }\n else {\n z[i] = z[i - a];\n if (i + z[i - a] > b) {\n for (int j = b + 1; j < n && s[j - i] == s[j]; j++) z[i]++;\n a = i;\n b = i + z[i] - 1;\n }\n }\n }\n return z;\n }\n\n public List<Integer> getStartIndexesWhereWordIsFound(String haku, String kohde) {\n // this is alternative use case\n char[] s = new char[haku.length() + 1 + kohde.length()];\n for (int i=0; i<haku.length(); i++) {\n s[i] = haku.charAt(i);\n }\n int j = haku.length();\n s[j++] = '#';\n for (int i=0; i<kohde.length(); i++) {\n s[j++] = kohde.charAt(i);\n }\n int[] z = toZarray(s);\n List<Integer> indexes = new ArrayList<>();\n for (int i=haku.length(); i<z.length; i++) {\n if (z[i] < haku.length()) continue;\n indexes.add(i);\n }\n return indexes;\n }\n\n }\n\n class StringHasher {\n\n class HashedString {\n long[] hashes;\n long[] modifiers;\n\n public HashedString(long[] hashes, long[] modifiers) {\n this.hashes = hashes;\n this.modifiers = modifiers;\n }\n }\n\n long P;\n long M;\n\n public StringHasher() {\n initializePandM();\n }\n\n HashedString hashString(String s) {\n int n = s.length();\n long[] hashes = new long[n];\n long[] modifiers = new long[n];\n hashes[0] = s.charAt(0);\n modifiers[0] = 1;\n for (int i=1; i<n; i++) {\n hashes[i] = (hashes[i-1] * P + s.charAt(i)) % M;\n modifiers[i] = (modifiers[i-1] * P) % M;\n }\n return new HashedString(hashes, modifiers);\n }\n\n /**\n * Indices are inclusive.\n */\n long getHash(HashedString hashedString, int startIndex, int endIndex) {\n long[] hashes = hashedString.hashes;\n long[] modifiers = hashedString.modifiers;\n long result = hashes[endIndex];\n if (startIndex > 0) result -= (hashes[startIndex-1] * modifiers[endIndex-startIndex+1]) % M;\n if (result < 0) result += M;\n return result;\n }\n\n // Less interesting methods below\n\n\n\n /**\n * Efficient for 2 input parameter strings in particular.\n */\n HashedString[] hashString(String first, String second) {\n HashedString[] array = new HashedString[2];\n int n = first.length();\n long[] modifiers = new long[n];\n modifiers[0] = 1;\n\n long[] firstHashes = new long[n];\n firstHashes[0] = first.charAt(0);\n array[0] = new HashedString(firstHashes, modifiers);\n\n long[] secondHashes = new long[n];\n secondHashes[0] = second.charAt(0);\n array[1] = new HashedString(secondHashes, modifiers);\n\n for (int i=1; i<n; i++) {\n modifiers[i] = (modifiers[i-1] * P) % M;\n firstHashes[i] = (firstHashes[i-1] * P + first.charAt(i)) % M;\n secondHashes[i] = (secondHashes[i-1] * P + second.charAt(i)) % M;\n }\n return array;\n }\n\n /**\n * Efficient for 3+ strings\n * More efficient than multiple hashString calls IF strings are same length.\n */\n HashedString[] hashString(String... strings) {\n HashedString[] array = new HashedString[strings.length];\n int n = strings[0].length();\n long[] modifiers = new long[n];\n modifiers[0] = 1;\n for (int j=0; j<strings.length; j++) {\n // if all strings are not same length, defer work to another method\n if (strings[j].length() != n) {\n for (int i=0; i<n; i++) {\n array[i] = hashString(strings[i]);\n }\n return array;\n }\n\n // otherwise initialize stuff\n long[] hashes = new long[n];\n hashes[0] = strings[j].charAt(0);\n array[j] = new HashedString(hashes, modifiers);\n }\n for (int i=1; i<n; i++) {\n modifiers[i] = (modifiers[i-1] * P) % M;\n for (int j=0; j<strings.length; j++) {\n String s = strings[j];\n long[] hashes = array[j].hashes;\n hashes[i] = (hashes[i-1] * P + s.charAt(i)) % M;\n }\n }\n return array;\n }\n\n void initializePandM() {\n ArrayList<Long> modOptions = new ArrayList<>(20);\n modOptions.add(353873237L);\n modOptions.add(353875897L);\n modOptions.add(353878703L);\n modOptions.add(353882671L);\n modOptions.add(353885303L);\n modOptions.add(353888377L);\n modOptions.add(353893457L);\n P = modOptions.get(new Random().nextInt(modOptions.size()));\n\n modOptions.clear();\n modOptions.add(452940277L);\n modOptions.add(452947687L);\n modOptions.add(464478431L);\n modOptions.add(468098221L);\n modOptions.add(470374601L);\n modOptions.add(472879717L);\n modOptions.add(472881973L);\n M = modOptions.get(new Random().nextInt(modOptions.size()));\n\n }\n }\n\n /*************************** Technical ***************************/\n\n private class IO extends PrintWriter {\n private InputStreamReader r;\n private static final int BUFSIZE = 1 << 15;\n private char[] buf;\n private int bufc;\n private int bufi;\n private StringBuilder sb;\n\n public IO() {\n super(new BufferedOutputStream(System.out));\n r = new InputStreamReader(System.in);\n\n buf = new char[BUFSIZE];\n bufc = 0;\n bufi = 0;\n sb = new StringBuilder();\n }\n\n /** Print, flush, return nextInt. */\n private int queryInt(String s) {\n io.println(s);\n io.flush();\n return nextInt();\n }\n\n /** Print, flush, return nextLong. */\n private long queryLong(String s) {\n io.println(s);\n io.flush();\n return nextLong();\n }\n\n /** Print, flush, return next word. */\n private String queryNext(String s) {\n io.println(s);\n io.flush();\n return next();\n }\n\n private void fillBuf() throws IOException {\n bufi = 0;\n bufc = 0;\n while(bufc == 0) {\n bufc = r.read(buf, 0, BUFSIZE);\n if(bufc == -1) {\n bufc = 0;\n return;\n }\n }\n }\n\n private boolean pumpBuf() throws IOException {\n if(bufi == bufc) {\n fillBuf();\n }\n return bufc != 0;\n }\n\n private boolean isDelimiter(char c) {\n return c == ' ' || c == '\\t' || c == '\\n' || c == '\\r' || c == '\\f';\n }\n\n private void eatDelimiters() throws IOException {\n while(true) {\n if(bufi == bufc) {\n fillBuf();\n if(bufc == 0) throw new RuntimeException(\"IO: Out of input.\");\n }\n\n if(!isDelimiter(buf[bufi])) break;\n ++bufi;\n }\n }\n\n public String next() {\n try {\n sb.setLength(0);\n\n eatDelimiters();\n int start = bufi;\n\n while(true) {\n if(bufi == bufc) {\n sb.append(buf, start, bufi - start);\n fillBuf();\n start = 0;\n if(bufc == 0) break;\n }\n\n if(isDelimiter(buf[bufi])) break;\n ++bufi;\n }\n\n sb.append(buf, start, bufi - start);\n\n return sb.toString();\n } catch(IOException e) {\n throw new RuntimeException(\"IO.next: Caught IOException.\");\n }\n }\n\n public int nextInt() {\n try {\n int ret = 0;\n\n eatDelimiters();\n\n boolean positive = true;\n if(buf[bufi] == '-') {\n ++bufi;\n if(!pumpBuf()) throw new RuntimeException(\"IO.nextInt: Invalid int.\");\n positive = false;\n }\n\n boolean first = true;\n while(true) {\n if(!pumpBuf()) break;\n if(isDelimiter(buf[bufi])) {\n if(first) throw new RuntimeException(\"IO.nextInt: Invalid int.\");\n break;\n }\n first = false;\n\n if(buf[bufi] >= '0' && buf[bufi] <= '9') {\n if(ret < -214748364) throw new RuntimeException(\"IO.nextInt: Invalid int.\");\n ret *= 10;\n ret -= (int)(buf[bufi] - '0');\n if(ret > 0) throw new RuntimeException(\"IO.nextInt: Invalid int.\");\n } else {\n throw new RuntimeException(\"IO.nextInt: Invalid int.\");\n }\n\n ++bufi;\n }\n\n if(positive) {\n if(ret == -2147483648) throw new RuntimeException(\"IO.nextInt: Invalid int.\");\n ret = -ret;\n }\n\n return ret;\n } catch(IOException e) {\n throw new RuntimeException(\"IO.nextInt: Caught IOException.\");\n }\n }\n\n public long nextLong() {\n try {\n long ret = 0;\n\n eatDelimiters();\n\n boolean positive = true;\n if(buf[bufi] == '-') {\n ++bufi;\n if(!pumpBuf()) throw new RuntimeException(\"IO.nextLong: Invalid long.\");\n positive = false;\n }\n\n boolean first = true;\n while(true) {\n if(!pumpBuf()) break;\n if(isDelimiter(buf[bufi])) {\n if(first) throw new RuntimeException(\"IO.nextLong: Invalid long.\");\n break;\n }\n first = false;\n\n if(buf[bufi] >= '0' && buf[bufi] <= '9') {\n if(ret < -922337203685477580L) throw new RuntimeException(\"IO.nextLong: Invalid long.\");\n ret *= 10;\n ret -= (long)(buf[bufi] - '0');\n if(ret > 0) throw new RuntimeException(\"IO.nextLong: Invalid long.\");\n } else {\n throw new RuntimeException(\"IO.nextLong: Invalid long.\");\n }\n\n ++bufi;\n }\n\n if(positive) {\n if(ret == -9223372036854775808L) throw new RuntimeException(\"IO.nextLong: Invalid long.\");\n ret = -ret;\n }\n\n return ret;\n } catch(IOException e) {\n throw new RuntimeException(\"IO.nextLong: Caught IOException.\");\n }\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n }\n\n void print(Object output) {\n io.println(output);\n }\n\n void done(Object output) {\n print(output);\n done();\n }\n\n void done() {\n io.close();\n throw new RuntimeException(\"Clean exit\");\n }\n\n long min(long... v) {\n long ans = v[0];\n for (int i=1; i<v.length; i++) {\n ans = Math.min(ans, v[i]);\n }\n return ans;\n }\n\n double min(double... v) {\n double ans = v[0];\n for (int i=1; i<v.length; i++) {\n ans = Math.min(ans, v[i]);\n }\n return ans;\n }\n\n int min(int... v) {\n int ans = v[0];\n for (int i=1; i<v.length; i++) {\n ans = Math.min(ans, v[i]);\n }\n return ans;\n }\n\n long max(long... v) {\n long ans = v[0];\n for (int i=1; i<v.length; i++) {\n ans = Math.max(ans, v[i]);\n }\n return ans;\n }\n\n double max(double... v) {\n double ans = v[0];\n for (int i=1; i<v.length; i++) {\n ans = Math.max(ans, v[i]);\n }\n return ans;\n }\n\n int max(int... v) {\n int ans = v[0];\n for (int i=1; i<v.length; i++) {\n ans = Math.max(ans, v[i]);\n }\n return ans;\n }\n\n }\n\n}\n\n\n\n", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "flows", "graph matchings"], "code_uid": "456d73f00bd9d51c9651f359474724de", "src_uid": "02ce135a4b276d1e9ba6a4ce37f2fe70", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st = new StringTokenizer(br.readLine());\n\t\tint n = Integer.valueOf(st.nextToken());\n\t\tint sum = n + n - 1;\n\t\t//System.out.println(\"sum==\" + sum);\n\t\tif (checkAllNine(sum) || sum == 9) {\n\t\t\tSystem.out.println(1);\n\t\t\treturn;\n\t\t}\n\t\tif (sum < 9) {\n\t\t\tSystem.out.println(n * (n - 1) / 2);\n\t\t\treturn;\n\t\t}\n\n\t\t//\n\n\t\tlong ans = 0;\n\n\t\t// len >= 2\n\t\tint len = cntLen(sum);\n\t\tint left = sum / (int) (Math.pow(10, len - 1));\n\n\t\tint firstNum = getFirst(sum, len, left);\n\n\t\tlen = cntLen(firstNum);\n\t\tint loop = (int) (Math.pow(10, len - 1));\n\t\tleft = firstNum / (int) (Math.pow(10, len - 1));\n\t\tif (firstNum < 10)\n\t\t\tleft = 0;\n\t\tif (left == 9) {\n\t\t\tif (firstNum <= n)\n\t\t\t\tSystem.out.println(firstNum / 2);\n\t\t\telse {\n\t\t\t\tSystem.out.println(n - firstNum / 2);\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\t// System.out.println(\"left==\" + left);\n\t\twhile (left >= 0) {\n\t\t\t// System.out.println(\"firstNum==\" + firstNum);\n\t\t\tif (firstNum > n) {\n\t\t\t\tint half = firstNum / 2 + 1;\n\t\t\t\tans += (n - half + 1);\n\t\t\t}\n\n\t\t\telse\n\t\t\t\tans += firstNum / 2;\n\t\t\t// System.out.println(\"ans==\" + ans);\n\t\t\tfirstNum -= loop;\n\t\t\tleft--;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\n\tpublic static int getFirst(int sum, int len, int left) {\n\t\tint firstNum = -1;\n\t\tint rightSum = 0;\n\n\t\tfor (int i = 0; i < len - 1; i++) {\n\t\t\trightSum *= 10;\n\t\t\trightSum += 9;\n\t\t}\n\t\tif (sum % (int) (Math.pow(10, len - 1)) != rightSum)\n\t\t\tleft--;\n\t\t// System.out.println(\"rightSum==\" + rightSum);\n\t\tfirstNum = left * (int) (Math.pow(10, len - 1)) + rightSum;\n\t\t//System.out.println(\"firstNum==\" + firstNum);\n\t\t// System.out.println();\n\t\treturn firstNum;\n\t}\n\n\tpublic static int cntLen(int n) {\n\t\tint i = 0;\n\t\twhile (n != 0) {\n\t\t\ti++;\n\t\t\tn /= 10;\n\t\t}\n\t\treturn i;\n\t}\n\n\tpublic static boolean checkAllNine(int n) {\n\t\twhile (n != 0) {\n\t\t\tif (n % 9 != 0)\n\t\t\t\treturn false;\n\t\t\tn /= 10;\n\t\t}\n\t\treturn true;\n\t}\n\n\tpublic static void printArray(int a[], int n) {\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tSystem.out.print(a[i] + \" \");\n\t\t}\n\t\tSystem.out.println();\n\t}\n\n}", "lang_cluster": "Java", "tags": ["math", "constructive algorithms"], "code_uid": "fc0f86e54717d905f7cce1bdd85aae5a", "src_uid": "c20744c44269ae0779c5f549afd2e3f2", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/**\n * BaZ :D\n */\nimport java.util.*;\nimport java.io.*;\nimport static java.lang.Math.*;\npublic class Main\n{\n static Reader scan;\n static PrintWriter pw;\n static long MOD = 998_244_353;\n static long INF = 1_000_000_000_000_000_000L;\n static long inf = 2_000_000_000;\n public static void main(String[] args) {\n new Thread(null,null,\"BaZ\",1<<25)\n {\n public void run()\n {\n try\n {\n solve();\n }\n catch(Exception e)\n {\n e.printStackTrace();\n System.exit(1);\n }\n }\n }.start();\n }\n static long fact[] = new long[100001], invfact[] = new long[100001],res;\n static void solve() throws IOException\n {\n scan = new Reader();\n pw = new PrintWriter(System.out,true);\n StringBuilder sb = new StringBuilder();\n fact[0] = invfact[0] = 1;\n for(int i=1;i<=100000;++i) {\n fact[i] = (fact[i-1]*i)%MOD;\n invfact[i] = modpow(fact[i], MOD-2, MOD);\n }\n int n = ni(),s = ni(), r = ni();\n long dr = nCr(s+n-r-1, n-1);\n long nr = 0;\n for(int highest_score=r;highest_score<=s;++highest_score) {\n for(int number_of_players_who_have_score_equal_to_highest_score=1;number_of_players_who_have_score_equal_to_highest_score<=n;++number_of_players_who_have_score_equal_to_highest_score) {\n int sumleft = s - number_of_players_who_have_score_equal_to_highest_score*highest_score;\n int number_of_players_left = n-number_of_players_who_have_score_equal_to_highest_score;\n long temp = nCr(n-1, number_of_players_who_have_score_equal_to_highest_score-1) * calc(number_of_players_left,sumleft,highest_score-1);\n //pl(\"highest score : \"+highest_score+\" number of players having the highest score : \"+number_of_players_who_have_score_equal_to_highest_score+\" ways : \"+temp);\n temp%=MOD;\n nr+=(temp*modpow(number_of_players_who_have_score_equal_to_highest_score, MOD-2, MOD))%MOD;\n nr%=MOD;\n }\n }\n //pl(\"nr : \"+nr+\" dr : \"+dr);\n long inv = modpow(dr, MOD-2, MOD);\n pl((nr*inv)%MOD);\n pw.flush();\n pw.close();\n }\n\n /**\n number of ways to sum s, using n integer numbers, with each number <=r\n */\n static long calc(int n, int s, int r) {\n if(s>n*r) {\n //pl(\"in calc n : \"+n+\" s : \"+s+\" r : \"+r+\" returning 0\");\n return 0;\n }\n if(s==0) {\n return 1;\n }\n //pl(\"yaha2\");\n long ways = nCr(s+n-1, n-1);\n long invalid = 0;\n for(int i=1;i<=n;++i) {\n if(i%2==0) {\n invalid-=(nCr(n,i) * nCr(s-i*(r+1)+n-1, n-1))%MOD;\n invalid+=MOD;\n invalid%=MOD;\n }\n else {\n invalid+=(nCr(n,i) * nCr(s-i*(r+1)+n-1, n-1))%MOD;\n invalid%=MOD;\n }\n }\n ways = (ways-invalid+MOD)%MOD;\n //pl(\"in calc n : \"+n+\" s : \"+s+\" r : \"+r+\" returning : \"+ways);\n return ways;\n }\n static long nCr(int n, int r) {\n if(r>n || n<0) {\n return 0;\n }\n return (fact[n] * ((invfact[r]*invfact[n-r])%MOD))%MOD;\n }\n static long modpow(long x,long y,long mod)\n {\n res = 1;\n while(y>0)\n {\n if((y&1)==1)\n res = (res*x)%mod;\n y>>=1;\n x = (x*x)%mod;\n }\n return res;\n }\n static int ni() throws IOException\n {\n return scan.nextInt();\n }\n static long nl() throws IOException\n {\n return scan.nextLong();\n }\n static double nd() throws IOException\n {\n return scan.nextDouble();\n }\n static void pl()\n {\n pw.println();\n }\n static void p(Object o)\n {\n pw.print(o+\" \");\n }\n static void pl(Object o)\n {\n pw.println(o);\n }\n static void psb(StringBuilder sb)\n {\n pw.print(sb);\n }\n static void pa(String arrayName, Object arr[])\n {\n pl(arrayName+\" : \");\n for(Object o : arr)\n p(o);\n pl();\n }\n static void pa(String arrayName, int arr[])\n {\n pl(arrayName+\" : \");\n for(int o : arr)\n p(o);\n pl();\n }\n static void pa(String arrayName, long arr[])\n {\n pl(arrayName+\" : \");\n for(long o : arr)\n p(o);\n pl();\n }\n static void pa(String arrayName, double arr[])\n {\n pl(arrayName+\" : \");\n for(double o : arr)\n p(o);\n pl();\n }\n static void pa(String arrayName, char arr[])\n {\n pl(arrayName+\" : \");\n for(char o : arr)\n p(o);\n pl();\n }\n static void pa(String listName, List list)\n {\n pl(listName+\" : \");\n for(Object o : list)\n p(o);\n pl();\n }\n static void pa(String arrayName, Object[][] arr) {\n pl(arrayName+\" : \");\n for(int i=0;i<arr.length;++i) {\n for(Object o : arr[i])\n p(o);\n pl();\n }\n }\n static void pa(String arrayName, int[][] arr) {\n pl(arrayName+\" : \");\n for(int i=0;i<arr.length;++i) {\n for(int o : arr[i])\n p(o);\n pl();\n }\n }\n static void pa(String arrayName, long[][] arr) {\n pl(arrayName+\" : \");\n for(int i=0;i<arr.length;++i) {\n for(long o : arr[i])\n p(o);\n pl();\n }\n }\n static void pa(String arrayName, char[][] arr) {\n pl(arrayName+\" : \");\n for(int i=0;i<arr.length;++i) {\n for(char o : arr[i])\n p(o);\n pl();\n }\n }\n static void pa(String arrayName, double[][] arr) {\n pl(arrayName+\" : \");\n for(int i=0;i<arr.length;++i) {\n for(double o : arr[i])\n p(o);\n pl();\n }\n }\n static class Reader {\n final private int BUFFER_SIZE = 1 << 16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n\n public Reader() {\n din = new DataInputStream(System.in);\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public Reader(String file_name) throws IOException {\n din = new DataInputStream(new FileInputStream(file_name));\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public String readLine() throws IOException {\n byte[] buf = new byte[64];\n int cnt = 0, c;\n while ((c = read()) != -1) {\n if (c == '\\n') break;\n buf[cnt++] = (byte) c;\n }\n return new String(buf, 0, cnt);\n }\n\n public int nextInt() throws IOException {\n int ret = 0;\n byte c = read();\n while (c <= ' ') c = read();\n boolean neg = (c == '-');\n if (neg) c = read();\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n if (neg) return -ret;\n return ret;\n }\n\n public long nextLong() throws IOException {\n long ret = 0;\n byte c = read();\n while (c <= ' ') c = read();\n boolean neg = (c == '-');\n if (neg) c = read();\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n if (neg) return -ret;\n return ret;\n }\n\n public double nextDouble() throws IOException {\n double ret = 0, div = 1;\n byte c = read();\n while (c <= ' ') c = read();\n boolean neg = (c == '-');\n if (neg) c = read();\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n if (c == '.') while ((c = read()) >= '0' && c <= '9') ret += (c - '0') / (div *= 10);\n if (neg) return -ret;\n return ret;\n }\n\n private void fillBuffer() throws IOException {\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1) buffer[0] = -1;\n }\n\n private byte read() throws IOException {\n if (bufferPointer == bytesRead) fillBuffer();\n return buffer[bufferPointer++];\n }\n\n public void close() throws IOException {\n if (din == null) return;\n din.close();\n }\n }\n}", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "09f3a45ab2419db3e3325282d9e7e7d9", "src_uid": "609195ef4a970c62a8210dafe118580e", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Test {\n\n static int readInt() {\n int ans = 0;\n boolean neg = false;\n try {\n boolean start = false;\n for (int c = 0; (c = System.in.read()) != -1; ) {\n if (c == '-') {\n start = true;\n neg = true;\n continue;\n } else if (c >= '0' && c <= '9') {\n start = true;\n ans = ans * 10 + c - '0';\n } else if (start) break;\n }\n } catch (IOException e) {\n }\n return neg ? -ans : ans;\n }\n\n static long readLong() {\n long ans = 0;\n boolean neg = false;\n try {\n boolean start = false;\n for (int c = 0; (c = System.in.read()) != -1; ) {\n if (c == '-') {\n start = true;\n neg = true;\n continue;\n } else if (c >= '0' && c <= '9') {\n start = true;\n ans = ans * 10 + c - '0';\n } else if (start) break;\n }\n } catch (IOException e) {\n }\n return neg ? -ans : ans;\n }\n\n static String readLine() {\n StringBuilder b = new StringBuilder();\n try {\n for (int c = 0; (c = System.in.read()) != -1; ) {\n if (c == '\\n') {\n break;\n } else {\n b.append((char) (c));\n }\n }\n } catch (IOException e) {\n }\n return b.toString().trim();\n }\n\n static PrintWriter writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n\n int gcd(int a, int b) {\n if (b == 0) return a;\n return gcd( b, a % b);\n }\n\n int SZ = 200_000;\n\n void start() {\n Set<Long> seen = new HashSet<>();\n TreeMap<Long, Integer> cnt = new TreeMap<>();\n int m = readInt(), a = readInt(), b = readInt();\n PriorityQueue<long[]> q = new PriorityQueue<>(1, (x, y) -> Long.compare(x[1], y[1]));\n q.offer(new long[]{0, 0});\n seen.add(0L);\n cnt.put(0L, 1);\n while (!q.isEmpty() && seen.size() < SZ) {\n long[] e = q.poll();\n long v = e[0], r = e[1];\n long nv = v + a;\n if (!seen.contains(nv)) {\n seen.add(nv);\n long nr = Math.max(nv, r);\n cnt.put(nr, cnt.getOrDefault(nr, 0) + 1);\n q.offer(new long[]{nv, nr});\n }\n nv = v - b;\n if (nv > 0 && !seen.contains(nv)) {\n seen.add(nv);\n cnt.put(r, cnt.getOrDefault(r, 0) + 1);\n q.offer(new long[]{nv, r});\n }\n }\n long ans = 0, pk = 0, pc = 0;\n for (long k : cnt.keySet()) {\n if (k > m) break;\n int c = cnt.get(k);\n ans += (c + pc);\n ans += pc*(k - pk - 1);\n pc += c;\n pk = k;\n }\n int d = gcd(a, b);\n if (pk < m) {\n if (seen.size() >= m) ans += pc*(m - pk);\n else {\n long d0 = (pk + d) / d, d1 = m / d;\n ans += pc * (m - pk);\n ans += (1 + d1 - d0 + 1) * (d1 - d0 + 1) / 2 * d;\n ans += (m - d1*d + 1 - d)*(d1 - d0 + 1);\n }\n }\n writer.println(ans);\n }\n\n public static void main(String[] args) {\n Test te = new Test();\n te.start();\n writer.flush();\n }\n}", "lang_cluster": "Java", "tags": ["dfs and similar", "math", "number theory"], "code_uid": "7dc418216dbd9d80cc5410db93627526", "src_uid": "d6290b69eddfcf5f131cc9e612ccab76", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\npublic class A {\n\tstatic long nCk(long n, long k) {\n\t\tif (k > n)\n\t\t\treturn 0;\n\t\tif (k * 2 > n)\n\t\t\tk = n - k;\n\t\tif (k == 0)\n\t\t\treturn 1;\n\n\t\tlong result = n;\n\t\tfor (int i = 2; i <= k; ++i) {\n\t\t\tresult *= (n - i + 1);\n\t\t\tresult /= i;\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tBufferedReader bf = new BufferedReader(new InputStreamReader(System.in));\n\t\tlong n = Long.parseLong(bf.readLine());\n\t\tSystem.out.println(4 * 3 * 2 * pow(4, n - 3) + (n - 3) * 4 * 9\n\t\t\t\t* pow(4, n - 4));\n\t}\n\n\tprivate static long pow(long i, long l) {\n\t\tif (l < 0)\n\t\t\treturn 0;\n\t\tif (l == 0)\n\t\t\treturn 1;\n\t\treturn i * pow(i, l - 1);\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "combinatorics"], "code_uid": "6e7686403491b65412a1e0756f739a8a", "src_uid": "3b02cbb38d0b4ddc1a6467f7647d53a9", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class q2 {\n\n public static long pow(long a,int b,int m){\n long ans=1;\n while(b>0){\n if((b & 1) ==1){\n ans=(ans*a)%m;\n }\n b=b/2;\n a=(a*a)%m;\n }\n return ans;\n }\n\n\n public static void main(String[] args) throws IOException {\n Reader1.init(System.in);\n int[] no=Reader1.nextIntArray(2);\n long ans=(pow(2,no[0],998244353)*pow(2,no[1],998244353))%998244353;\n System.out.println(ans);\n }\n}\n\nclass Reader1 {\n static BufferedReader reader;\n static StringTokenizer tokenizer;\n\n /** call this method to initialize reader for InputStream */\n static void init(InputStream input) {\n reader = new BufferedReader(\n new InputStreamReader(input) );\n tokenizer = new StringTokenizer(\"\");\n }\n\n /** get next word */\n static String nextLine() throws IOException {\n while ( ! tokenizer.hasMoreTokens() ) {\n //TODO add check for eof if necessary\n tokenizer = new StringTokenizer(\n reader.readLine() );\n }\n return tokenizer.nextToken();\n }\n\n static int nextInt() throws IOException {\n return Integer.parseInt( nextLine() );\n }\n static long nextLong() throws IOException {\n return Long.parseLong(nextLine());\n }\n\n static double nextDouble() throws IOException {\n return Double.parseDouble( nextLine() );\n }\n\n static float nextFloat() throws IOException {\n return Float.parseFloat( nextLine() );\n }\n static int[] nextIntArray(int length) throws IOException {\n int[] arr = new int[length];\n for (int i=0; i<length; i++) {\n arr[i] = Integer.parseInt( nextLine() );\n }\n return arr;\n }\n static long[] nextLongArray(int length) throws IOException {\n long[] arr = new long[length];\n for (int i=0; i<length; i++) {\n arr[i] = Long.parseLong( nextLine() );\n }\n return arr;\n }\n\n}\n\n", "lang_cluster": "Java", "tags": ["math", "greedy", "combinatorics"], "code_uid": "47c470846557e6d7ab4fdae1ce1e6e4a", "src_uid": "8b2a9ae21740c89079a6011a30cd6aee", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n\tpublic static void main(String args[]) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st = new StringTokenizer(br.readLine());\n\t\t\n\t\tlong n = Integer.parseInt(st.nextToken());\n\t\tlong m = Integer.parseInt(st.nextToken());\n\t\tlong s = Integer.parseInt(st.nextToken());\n\t\t\n\t\tif (m < n) {\n\t\t\tlong tmp = m;\n\t\t\tm = n;\n\t\t\tn = tmp;\n\t\t}\n\t\t\n\t\tlong mCoord = ( (m-1) % s + 1) *\n\t\t\t\t( ( m - 1 ) / s + 1 ) * n;\n\t\tlong mCoordDivision = (( m - 1 ) % s + 1) * ( ( m - 1 ) / s + 1) * ( (n - 1) % s+1) * ((n-1) / s+1);\n\t\t\n\t\tif (s >= m && s >= n) {\n\t\t\tSystem.out.println(m*n);\n\t\t}\n\t\telse if (s >= n && s >= m) {\n\t\t\tSystem.out.println(mCoord);\n\t\t}\n\t\telse {\n\t\t\tSystem.out.println(mCoordDivision);\n\t\t}\n\t\t\n \t}\n\n}", "lang_cluster": "Java", "tags": ["math"], "code_uid": "400967618c01534a769a270312d4bb6d", "src_uid": "e853733fb2ed87c56623ff9a5ac09c36", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\npublic class Main\n{\n\tstatic Scanner Reader = new Scanner(System.in);\n\tpublic static void main(String[] args)\n\t{\n\t\tint n = Reader.nextInt();\n\t\tint m = Reader.nextInt();\n\t\tint[] arr = new int[m];\n\t\tfor(int i=0 ; i<m ; i++)\n\t\t{\n\t\t\tarr[i] = Reader.nextInt();\n\t\t}\n\t\tint[] per = new int[n];\n\t\tint n_flag=0;\n\t\tfor(int i=0 ; i<m-1 ; i++)\n\t\t{\n\t\t\tint dif = arr[i+1]-arr[i];\n\t\t\tif(dif<=0)\n\t\t\t\tdif+=n;\n\t\t\tif(per[arr[i]-1]!=0 && per[arr[i]-1]!=dif)\n\t\t\t{\n\t\t\t\tn_flag=2;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tper[arr[i]-1] = dif;\n\t\t}\n\t\tper = complete(per);\n\t\tif(repeat(per)==true || n_flag==2)\n\t\t{\n\t\t\tSystem.out.println(-1);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfor(int i=0 ; i<per.length ; i++)\n\t\t\t{\n\t\t\t\tSystem.out.print(per[i]+\" \");\n\t\t\t}\n\t\t}\n\t}\n\tpublic static int[] complete(int[] A)\n\t{\n\t\tint[] B = new int[A.length];\n\t\tfor(int i=0 ; i<B.length ; i++)\n\t\t{\n\t\t\tB[i]=i+1;\n\t\t}\n\t\tfor(int i=0 ; i<A.length ; i++)\n\t\t{\n\t\t\tint j=0;\n\t\t\tif(A[i]==0)\n\t\t\t{\n\t\t\t\twhile(contains(A,B[j])!=false && j<B.length)\n\t\t\t\t{\n\t\t\t\t\tj++;\n\t\t\t\t}\n\t\t\t\tif(contains(A,B[j])==false)\n\t\t\t\t{\n\t\t\t\t\tA[i] = B[j];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn A;\n\t}\n\tpublic static boolean contains(int[] A, int x)\n\t{\n\t\tfor(int i=0 ; i<A.length ; i++)\n\t\t{\n\t\t\tif(A[i]==x)\n\t\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n\tpublic static boolean repeat(int[] per)\n\t{\n\t\tint[] B = new int[per.length];\n\t\tfor(int i=0 ; i<B.length ; i++)\n\t\t{\n\t\t\tB[i] = per[i];\n\t\t}\n\t\tArrays.sort(B);\n\t\tfor(int i=0 ; i<B.length-1 ; i++)\n\t\t{\n\t\t\tif(B[i]==B[i+1])\n\t\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n}\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "acbbec66f20d10132473dd6c0f429252", "src_uid": "4a7c959ca279d0a9bd9bbf0ce88cf72b", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class B {\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\tboolean eof;\n\t\n\tstatic final int MOD = 1_000_000_007;\n\t\n\tstatic final int[] POW2 = new int[10];\n\tstatic final int[] POW8 = new int[10];\n\t{\n\t\tPOW2[0] = POW8[0] = 1;\n\t\tfor (int i = 1; i < 10; i++) {\n\t\t\tPOW2[i] = POW2[i - 1] * 2;\n\t\t\tPOW8[i] = POW8[i - 1] * 8;\n\t\t}\n\t}\n\t\n\tstatic final int[][] c = new int[10][];\n\t{\n\t\tfor (int i = 0; i < c.length; i++) {\n\t\t\tc[i] = new int[i + 1];\n\t\t\tc[i][0] = c[i][i] = 1;\n\t\t\tfor (int j = 1; j < i; j++)\n\t\t\t\tc[i][j] = c[i - 1][j - 1] + c[i - 1][j];\n\t\t}\n\t}\n\t\n\tint[] getCnt(int m) {\n\t\tm++;\n\t\tint[] res = new int[10];\n\t\tchar[] x = Integer.toString(m).toCharArray();\n\t\tint prefLucky = 0;\n\t\tfor (int i = 0; i < x.length; i++) {\n\t\t\tint dig = x[i] - '0';\n\t\t\tfor (int j = 0; j < dig; j++) {\n\t\t\t\tint curLucky = prefLucky + (isLucky(j) ? 1 : 0);\n\t\t\t\tint sufLen = x.length - 1 - i;\n\t\t\t\t\n\t\t\t\tfor (int k = 0; k <= sufLen; k++) {\n\t\t\t\t\tres[curLucky + k] += c[sufLen][k] * POW2[k] * POW8[sufLen - k];\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\tprefLucky += (isLucky(dig) ? 1 : 0);\n\t\t}\n\t\tres[0]--; // no zero\n\t\treturn res;\n\t}\n\n\tboolean isLucky(int j) {\n\t\treturn j == 4 || j == 7;\n\t}\n\t\n\tint[] cnt;\n\n\tvoid solve() throws IOException {\n\t\tint m = nextInt();\n\t\tcnt = getCnt(m);\n\t\t\n\t\tSystem.err.println(Arrays.toString(cnt));\n\t\t\n\t\tint[][] dp = new int[7][10];\n\t\tdp[0][0] = 1;\n\t\tfor (int i = 0; i < 10; i++) {\n\t\t\tfor (int j = 6; j >= 0; j--)\n\t\t\t\tfor (int k = 9; k >= 0; k--) {\n\t\t\t\t\tint ways = 1;\n\t\t\t\t\tfor (int pick = 1; j + pick <= 6 && k + pick * i <= 9 && pick <= cnt[i]; pick++) {\n\t\t\t\t\t\tways = (int)((long)ways * (cnt[i] - pick + 1) % MOD);\n\t\t\t\t\t\tdp[j + pick][k + pick * i] += (int)((long)dp[j][k] * ways % MOD * c[6 - j][pick] % MOD);\n\t\t\t\t\t\tif (dp[j + pick][k + pick * i] >= MOD)\n\t\t\t\t\t\t\tdp[j + pick][k + pick * i] -= MOD;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t}\t\t\n\t\t\n\t\tint[] res = dp[6];\n\t\t\n\t\tint sum = 0;\n\t\t\n\t\tint ans = 0;\n\t\t\n\t\tfor (int i = 1; i < cnt.length; i++) {\n\t\t\tsum += res[i - 1];\n\t\t\tif (sum >= MOD)\n\t\t\t\tsum -= MOD;\n\t\t\tans += (int)((long)sum * cnt[i] % MOD);\n\t\t\tif (ans >= MOD)\n\t\t\t\tans -= MOD;\n\t\t}\n\t\t\n\t\tout.println(ans);\n\t}\n\n\tB() throws IOException {\n\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.close();\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew B();\n\t}\n\n\tString nextToken() {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (Exception e) {\n\t\t\t\teof = true;\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tString nextString() {\n\t\ttry {\n\t\t\treturn br.readLine();\n\t\t} catch (IOException e) {\n\t\t\teof = true;\n\t\t\treturn null;\n\t\t}\n\t}\n\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "dp", "combinatorics"], "code_uid": "3c6892418f2974cf6fa190e5f1815fc7", "src_uid": "656ed7b1b80de84d65a253e5d14d62a9", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\t\npublic\t class CODEFORCES\n\t{\n\t\tprivate InputStream is;\n\t\tprivate PrintWriter out;\n\t\tint time = 0, DP[], start[], end[], dist[], black[], MOD = (int) (1e9 + 7),\n\t\t\t\tarr[], weight[][], x[], y[], parent[];\n\t\tint MAX = 100000, N, K;\n\t\tlong red[];\n\t\tArrayList<Integer>[] amp;\n\t\tArrayList<Pair>[][] pmp;\n\t\tboolean b[], boo[][];\n\t\tPair prr[];\n\t\tHashMap<Pair, Integer> hm = new HashMap();\n\t\tlong Dp[][][][] = new long[110][110][12][12];\n\t\n\t\tvoid soln()\n\t\t{\n\t\t\tis = System.in;\n\t\t\tout = new PrintWriter(System.out);\n\t\t\tlong s = System.currentTimeMillis();\n\t\t\tsolve();\n\t\t\t// out.close();\n\t\t\tout.flush();\n\t\t\t// tr(System.currentTimeMillis() - s + \"ms\");\n\t\t}\n\t\n\t\tpublic static void main(String[] args) throws Exception \n\t\t{\n\t\t\tnew Thread(null, new Runnable() \n\t\t\t{\n\t\t\t\tpublic void run() \n\t\t\t\t{\n\t\t\t\t\ttry\n\t\t\t\t\t{\n\t\t\t\t\t\t// new CODEFORCES().soln();\n\t\t\t\t\t} catch (Exception e)\n\t\t\t\t\t{\n\t\t\t\t\t\tSystem.out.println(e);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}, \"1\", 1 << 26).start();\n\t\t\tnew CODEFORCES().soln();\n\t\t}\n\t\n\t\tint ans = 0, cost = 0, D[][];\n\t\tchar ch[], ch1[];\n\t\tint hash = 29;\n\t\tTreeSet<Cell> ts;\n\t\tint prime[] = new int[100000];\n\t\tint dp[] = new int[50000];\n\t\tTreeSet<String> tset = new TreeSet<>();\n\t\tvoid solve() \n\t\t{\n\t\t\tint n = ni(), k = ni();\n\t\t\tPair prr[] = new Pair[k];\n\t\t\tint ans[] = new int[n+1];\n\t\t\tfor(int i = 0; i<k; i++) {\n\t\t\t\tprr[i] = new Pair(ni(),ni(),ni(),i+1);\n\t\t\t\tans[prr[i].v] = k+1;\n\t\t\t}\n\t\t\tPriorityQueue<Pair> pq = new PriorityQueue<>();\n\t\t\tfor(int i = 1;i<=n;i++) {\n\t\t\t\tfor(int j = 0; j< k; j++) {\n\t\t\t\t\tif(prr[j].u<=i) {\n\t\t\t\t\t\tpq.add(prr[j]);\n\t\t\t\t\t\tprr[j].u = n+100;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(ans[i]==(k+1)) continue;\n\t\t\t\tif(pq.isEmpty()) {\n\t\t\t\t\tans[i] = 0;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tPair p = pq.poll();\n\t\t\t\t\tif(p.v<i) {\n\t\t\t\t\t\tSystem.out.println(-1);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tp.z--;\n\t\t\t\t\tif(p.z!=0) pq.add(p);\n\t\t\t\t\tans[i] = p.i;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(pq.isEmpty())\n\t\t\tfor(int i = 1;i<=n;i++) out.print(ans[i]+\" \");\n\t\t\telse System.out.println(-1);\n\t\t\tout.close();\n\t\t}\n\t\tlong calc(char ch[]) {\n\t\t\tlong val = 1, sum = 0;\n\t\t\tfor(char c : ch) {\n\t\t\t\tif(c == 'S') sum += val;\n\t\t\t\telse val*=2;\n\t\t\t}\n\t\t\treturn sum;\n\t\t}\n\t\tint dfs(int x) {\n\t\t\tb[x] = true;\n\t\t\tint ans = 1;\n\t\t\tfor(int i : amp[x]) {\n\t\t\t\tif(!b[i]) {\n\t\t\t\t\tans += dfs(i);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn ans;\n\t\t}\n\t\tint calc(int x) {\n\t\t\tString s = Integer.toString(x);\n\t\t\tint ans = 0;\n\t\t\tfor(char ch : s.toCharArray()) ans += (ch-'0');\n\t\t\treturn ans;\n\t\t}\n\t\tboolean isCons(char ch){\n\t\t\tif(ch!='a' && ch!='e' && ch!='i' && ch!='o' && ch!='u' && ch!=' ') return true;\n\t\t\treturn false; \n\t\t}\n\t\tvoid seive(int x){\n\t\t\tb = new boolean[x+1];\n\t\t\tfor(int i = 2;i*i<=x;i++){\n\t\t\t\tif(!b[i]){\n\t\t\t\t\tfor(int j = 2*i;j<=x;j+=i) b[j] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tlong[][] matMul(long a[][] , long b[][], int n)\n\t\t{\n\t\t\tlong res[][] = new long[n][n];\n\t\t\tfor(int i = 0;i<n;i++){\n\t\t\t\tfor(int j = 0;j<n;j++){\n\t\t\t\t\tlong sum = 0;\n\t\t\t\t\tfor(int k = 0;k<n;k++){\n\t\t\t\t\t\tsum += (a[i][k]*1l*b[k][j]);\n\t\t\t\t\t\tsum %= MOD;\n\t\t\t\t\t}\n\t\t\t\t\tres[i][j] = sum;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\tint min(int a, int b)\n\t\t{\n\t\t\treturn (a<b)?a:b;\n\t\t}\n\t\tprivate class Cell implements Comparable<Cell>\n\t\t{\n\t\t\tint u, v, s;\n\t\t\tpublic Cell(int u, int v, int s) \n\t\t\t{\n\t\t\t\tthis.u = u;\n\t\t\t\tthis.v = v;\n\t\t\t\tthis.s = s;\n\t\t\t}\n\t\t\tpublic int hashCode() \n\t\t\t{\n\t\t\t\treturn Objects.hash();\n\t\t\t}\n\t\t\tpublic int compareTo(Cell other) \n\t\t\t{\n\t\t\t\treturn (Long.compare(s, other.s) != 0 ? (Long.compare(s, other.s)):(Long.compare(v, other.v)!=0?Long.compare(v, other.v):Long.compare(u, other.u)))\n\t\t\t\t\t\t&((Long.compare(s, other.s) != 0 ? (Long.compare(s, other.s)):(Long.compare(u, other.v)!=0?Long.compare(u, other.v):Long.compare(v, other.u))));\n\t\t\t}\n\t\t\tpublic String toString()\n\t\t\t{\n\t\t\t\treturn this.u + \" \" + this.v;\n\t\t\t}\n\t\t}\n\t\n\t\tclass Pair implements Comparable<Pair>\n\t\t{\n\t\t\tint u, v, z, i;\n\t\n\t\t\tPair(int u, int v) \n\t\t\t{\n\t\t\t\tthis.u = u;\n\t\t\t\tthis.v = v;\n\t\t\t}\n\t\n\t\t\tPair() \n\t\t\t{\n\t\n\t\t\t}\n\t\n\t\t\tPair(int u, int v, int z, int i) \n\t\t\t{\n\t\t\t\tthis.u = u;\n\t\t\t\tthis.v = v;\n\t\t\t\tthis.z = z;\n\t\t\t\tthis.i = i;\n\t\t\t}\n\t\n\t\t\tpublic int hashCode()\n\t\t\t{\n\t\t\t\treturn Objects.hash();\n\t\t\t}\n\t\n\t\t\tpublic boolean equals(Object o)\n\t\t\t{\n\t\t\t\tPair other = (Pair) o;\n\t\t\t\treturn (((u == other.v && v == other.u)));\n\t\t\t}\n\t\n\t\t\tpublic int compareTo(Pair other)\n\t\t\t{\n\t\t\t\t//return (((u == other.v && v == other.u)))?0:1;\n\t\t\t\t// return Integer.compare(val, other.val);\n\t\t\t\treturn Long.compare(v, other.v);// != 0 ? (Long.compare(u, other.u)): (Long.compare(v, other.v));\n\t\t\t\t\t\t//&(Long.compare(u, other.v) != 0 ? (Long.compare(u, other.v)): (Long.compare(v, other.u))));\n\t\t\t}\n\t\n\t\t\tpublic String toString()\n\t\t\t{\n\t\t\t\treturn this.u + \" \" + this.v;\n\t\t\t}\n\t\t}\n\t\n\t\tint max(int a, int b) \n\t\t{\n\t\t\tif (a > b)\n\t\t\t\treturn a;\n\t\t\treturn b;\n\t\t}\n\t\n\t\t\n\t\tvoid buildGraph(int n) \n\t\t{\n\t\t\tfor (int i = 0; i < n; i++) \n\t\t\t{\n\t\t\t\tint x1 = ni() - 1, y1 = ni() - 1;\n\t\t\t\tamp[x1].add(y1);\n\t\t\t\tamp[y1].add(x1);\n\t\t\t}\n\t\t}\n\t\tlong modInverse(long a, long mOD2) \n\t\t{\n\t\t\treturn power(a, mOD2 - 2, mOD2);\n\t\t}\n\t\n\t\tlong power(long x, long y, long m) \n\t\t{\n\t\t\tif (y == 0)\n\t\t\t\treturn 1;\n\t\t\tlong p = power(x, y / 2, m) % m;\n\t\t\tp = (p * p) % m;\n\t\n\t\t\treturn (y % 2 == 0) ? p : (x * p) % m;\n\t\t}\n\t\n\t\tpublic long gcd(long a, long b) \n\t\t{\n\t\t\tif (b == 0)\n\t\t\t\treturn a;\n\t\t\treturn gcd(b, a % b);\n\t\t}\n\t\n\t\tstatic class ST1 \n\t\t{\n\t\t\tint arr[], st[], size;\n\t\n\t\t\t\n\t\t\tST1(int a[]) \n\t\t\t{\n\t\t\t\tarr = a.clone();\n\t\t\t\tsize = 10 * arr.length;\n\t\t\t\tst = new int[size];\n\t\t\t\tbuild(0, arr.length - 1, 1);\n\t\t\t}\n\t\n\t\t\tvoid build(int ss, int se, int si) \n\t\t\t{\n\t\t\t\tif (ss == se)\n\t\t\t\t{\n\t\t\t\t\tst[si] = arr[ss];\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tint mid = (ss + se) / 2;\n\t\t\t\tint val = 2 * si;\n\t\t\t\tbuild(ss, mid, val);\n\t\t\t\tbuild(mid + 1, se, val + 1);\n\t\t\t\tst[si] = Math.min(st[val], st[val + 1]);\n\t\t\t}\n\t\n\t\t\tint get(int ss, int se, int l, int r, int si) \n\t\t\t{\n\t\t\t\tif (l > se || r < ss || l > r)\n\t\t\t\t\treturn Integer.MAX_VALUE;\n\t\t\t\tif (l <= ss && r >= se)\n\t\t\t\t\treturn st[si];\n\t\t\t\tint mid = (ss + se) / 2;\n\t\t\t\tint val = 2 * si;\n\t\t\t\treturn Math.min(get(ss, mid, l, r, val),\n\t\t\t\t\t\tget(mid + 1, se, l, r, val + 1));\n\t\t\t}\n\t\t}\n\t\n\t\tstatic class ST \n\t\t{\n\t\t\tint arr[], lazy[], n;\n\t\n\t\t\tST(int a) \n\t\t\t{\n\t\t\t\tn = a;\n\t\t\t\tarr = new int[10 * n];\n\t\t\t\tlazy = new int[10 * n];\n\t\t\t}\n\t\n\t\t\tvoid up(int l, int r, int val)\n\t\t\t{\n\t\t\t\tupdate(0, n - 1, 0, l, r, val);\n\t\t\t}\n\t\n\t\t\tvoid update(int l, int r, int c, int x, int y, int val)\n\t\t\t{\n\t\t\t\tif (lazy[c] != 0) {\n\t\t\t\t\tlazy[2 * c + 1] += lazy[c];\n\t\t\t\t\tlazy[2 * c + 2] += lazy[c];\n\t\t\t\t\tif (l == r)\n\t\t\t\t\t\tarr[c] += lazy[c];\n\t\t\t\t\tlazy[c] = 0;\n\t\t\t\t}\n\t\t\t\tif (l > r || x > y || l > y || x > r)\n\t\t\t\t\treturn;\n\t\t\t\tif (x <= l && y >= r) \n\t\t\t\t\n\t\t\t\t{\n\t\t\t\t\tlazy[c] += val;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tint mid = l + r >> 1;\n\t\t\t\tupdate(l, mid, 2 * c + 1, x, y, val);\n\t\t\t\tupdate(mid + 1, r, 2 * c + 2, x, y, val);\n\t\t\t\tarr[c] = Math.max(arr[2 * c + 1], arr[2 * c + 2]);\n\t\t\t}\n\t\n\t\t\tint an(int ind) \n\t\t\t{\n\t\t\t\treturn ans(0, n - 1, 0, ind);\n\t\t\t}\n\t\n\t\t\tint ans(int l, int r, int c, int ind) \n\t\t\t{\n\t\t\t\tif (lazy[c] != 0) \n\t\t\t\t{\n\t\t\t\t\tlazy[2 * c + 1] += lazy[c];\n\t\t\t\t\tlazy[2 * c + 2] += lazy[c];\n\t\t\t\t\tif (l == r)\n\t\t\t\t\t\tarr[c] += lazy[c];\n\t\t\t\t\tlazy[c] = 0;\n\t\t\t\t}\n\t\t\t\tif (l == r)\n\t\t\t\t\treturn arr[c];\n\t\t\t\tint mid = l + r >> 1;\n\t\t\t\tif (mid >= ind)\n\t\t\t\t\treturn ans(l, mid, 2 * c + 1, ind);\n\t\t\t\treturn ans(mid + 1, r, 2 * c + 2, ind);\n\t\t\t}\n\t\t}\n\t\n\t\tpublic static int[] shuffle(int[] a, Random gen)\n\t\t{\n\t\t\tfor (int i = 0, n = a.length; i < n; i++)\n\t\t\t{\n\t\t\t\tint ind = gen.nextInt(n - i) + i;\n\t\t\t\tint d = a[i];\n\t\t\t\ta[i] = a[ind];\n\t\t\t\ta[ind] = d;\n\t\t\t}\n\t\t\treturn a;\n\t\t}\n\t\n\t\tlong power(long x, long y, int mod) \n\t\t{\n\t\t\tlong ans = 1;\n\t\t\twhile (y > 0) \n\t\t\t{\n\t\t\t\tif (y % 2 == 0) \n\t\t\t\t{\n\t\t\t\t\tx = (x * x) % mod;\n\t\t\t\t\ty /= 2;\n\t\t\t\t} else \n\t\t\t\t{\n\t\t\t\t\tans = (x * ans) % mod;\n\t\t\t\t\ty--;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn ans;\n\t\t}\n\t\n\t\t// To Get Input\n\t\t// Some Buffer Methods\n\t\tprivate byte[] inbuf = new byte[1024];\n\t\tpublic int lenbuf = 0, ptrbuf = 0;\n\t\n\t\tprivate int readByte()\n\t\t{\n\t\t\tif (lenbuf == -1)\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tif (ptrbuf >= lenbuf) \n\t\t\t{\n\t\t\t\tptrbuf = 0;\n\t\t\t\ttry \n\t\t\t\t{\n\t\t\t\t\tlenbuf = is.read(inbuf);\n\t\t\t\t} catch (IOException e)\n\t\t\t\t{\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (lenbuf <= 0)\n\t\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn inbuf[ptrbuf++];\n\t\t}\n\t\n\t\tprivate boolean isSpaceChar(int c) \n\t\t{\n\t\t\treturn !(c >= 33 && c <= 126);\n\t\t}\n\t\n\t\tprivate int skip() \n\t\t{\n\t\t\tint b;\n\t\t\twhile ((b = readByte()) != -1 && isSpaceChar(b))\n\t\t\t\t;\n\t\t\treturn b;\n\t\t}\n\t\n\t\tprivate double nd() \n\t\t{\n\t\t\treturn Double.parseDouble(ns());\n\t\t}\n\t\n\t\tprivate char nc() \n\t\t{\n\t\t\treturn (char) skip();\n\t\t}\n\t\n\t\tprivate String ns()\n\t\t{\n\t\t\tint b = skip();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\twhile (!(isSpaceChar(b)))\n\t\t\t{ // when nextLine, (isSpaceChar(b) && b != '\n\t\t\t\t\t\t\t\t\t\t// ')\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n\t\n\t\tprivate char[] ns(int n) \n\t\t{\n\t\t\tchar[] buf = new char[n];\n\t\t\tint b = skip(), p = 0;\n\t\t\twhile (p < n && !(isSpaceChar(b)))\n\t\t\t{\n\t\t\t\tbuf[p++] = (char) b;\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t\t}\n\t\n\t\tprivate char[][] nm(int n, int m)\n\t\t{\n\t\t\tchar[][] map = new char[n][];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tmap[i] = ns(m);\n\t\t\treturn map;\n\t\t}\n\t\n\t\tprivate int[] na(int n)\n\t\t{\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = ni();\n\t\t\treturn a;\n\t\t}\n\t\n\t\tprivate int ni() \n\t\t{\n\t\t\tint num = 0, b;\n\t\t\tboolean minus = false;\n\t\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t\t;\n\t\t\tif (b == '-')\n\t\t\t{\n\t\t\t\tminus = true;\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\n\t\t\twhile (true) \n\t\t\t{\n\t\t\t\tif (b >= '0' && b <= '9') \n\t\t\t\t{\n\t\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t\t} else \n\t\t\t\t{\n\t\t\t\t\treturn minus ? -num : num;\n\t\t\t\t}\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t}\n\t\n\t\tprivate long nl() \n\t\t{\n\t\t\tlong num = 0;\n\t\t\tint b;\n\t\t\tboolean minus = false;\n\t\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t\t;\n\t\t\tif (b == '-') \n\t\t\t{\n\t\t\t\tminus = true;\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\n\t\t\twhile (true) \n\t\t\t{\n\t\t\t\tif (b >= '0' && b <= '9') \n\t\t\t\t{\n\t\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t\t} else \n\t\t\t\t{\n\t\t\t\t\treturn minus ? -num : num;\n\t\t\t\t}\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t}\n\t\n\t\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\t\n\t\tprivate void tr(Object... o) \n\t\t{\n\t\t\tif (!oj)\n\t\t\t\tSystem.out.println(Arrays.deepToString(o));\n\t\t}\n\t}", "lang_cluster": "Java", "tags": ["sortings", "implementation", "greedy"], "code_uid": "eba2dc9fdf243d5ea64aa67b290250c2", "src_uid": "02d8d403eb60ae77756ff96f71b662d3", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.util.Queue;\nimport java.util.LinkedList;\nimport java.math.*;\n \n public class Solution implements Runnable\n { \n \n \n public static void solve()\n { \n \n int n = i();\n Double val = Math.sqrt(n);\n \n if (val.intValue() * val.intValue() == n){\n \n System.out.println(2*val.intValue());\n } else {\n if (((n-(val.intValue()*val.intValue()))/(1.0*val.intValue()))<=1){\n\n System.out.println(2*val.intValue() + 1);\n } else {\n System.out.println(2*val.intValue() + 2);\n }\n }\n }\n \n public void run()\n { \n solve();\n out.close();\n }\n \n public static void main(String[] args) throws IOException\n { \n new Thread(null, new Solution(), \"whatever\", 1<<26).start();\n }\n abstract static class Pair implements Comparable<Pair>\n {\n long a;\n int b;\n \n Pair(){}\n Pair(long a,int b)\n {\n this.a=a;\n this.b=b;\n }\n \n public int compareTo(Pair x)\n {\n return Long.compare(x.a,this.a);\n }\n }\n \n \n \n ////////////////////////////////////////////////////// Merge Sort ////////////////////////////////////////////////////////////////////////\n \n static class Merge \n {\n \n public static void sort(long inputArr[]) \n {\n int length = inputArr.length;\n doMergeSort(inputArr,0, length - 1);\n }\n \n private static void doMergeSort(long[] arr,int lowerIndex, int higherIndex) \n { \n if (lowerIndex < higherIndex) {\n int middle = lowerIndex + (higherIndex - lowerIndex) / 2;\n doMergeSort(arr,lowerIndex, middle);\n doMergeSort(arr,middle + 1, higherIndex);\n mergeParts(arr,lowerIndex, middle, higherIndex);\n }\n }\n \n private static void mergeParts(long[]array,int lowerIndex, int middle, int higherIndex) \n {\n long[] temp=new long[higherIndex-lowerIndex+1];\n for (int i = lowerIndex; i <= higherIndex; i++) \n {\n temp[i-lowerIndex] = array[i];\n }\n int i = lowerIndex;\n int j = middle + 1;\n int k = lowerIndex;\n while (i <= middle && j <= higherIndex) \n {\n if (temp[i-lowerIndex] < temp[j-lowerIndex]) \n {\n array[k] = temp[i-lowerIndex];\n i++;\n } else {\n array[k] = temp[j-lowerIndex];\n j++;\n }\n k++;\n }\n while (i <= middle) \n {\n array[k] = temp[i-lowerIndex];\n k++;\n i++;\n }\n while(j<=higherIndex)\n {\n array[k]=temp[j-lowerIndex];\n k++;\n j++;\n }\n }\n \n }\n \n \n /////////////////////////////////////////////////////////// Methods ////////////////////////////////////////////////////////////////////////\n \n \n static boolean isPal(String s)\n {\n for(int i=0, j=s.length()-1;i<=j;i++,j--)\n {\n if(s.charAt(i)!=s.charAt(j)) return false;\n }\n return true;\n }\n static String rev(String s)\n {\n StringBuilder sb=new StringBuilder(s);\n sb.reverse();\n return sb.toString();\n }\n static int gcd(int a,int b){return (a==0)?b:gcd(b%a,a);}\n static long gcdExtended(long a,long b,long[] x)\n {\n \n if(a==0){\n x[0]=0;\n x[1]=1;\n return b;\n }\n long[] y=new long[2];\n long gcd=gcdExtended(b%a, a, y);\n \n x[0]=y[1]-(b/a)*y[0];\n x[1]=y[0];\n \n return gcd;\n }\n \n boolean findSum(int set[], int n, long sum)\n {\n if (sum == 0)\n return true;\n if (n == 0 && sum != 0)\n return false;\n if (set[n-1] > sum)\n return findSum(set, n-1, sum);\n return findSum(set, n-1, sum) ||findSum(set, n-1, sum-set[n-1]);\n }\n \n public static long modPow(long base, long exp, long mod)\n {\n base = base % mod;\n long result = 1;\n while (exp > 0)\n {\n if (exp % 2 == 1) \n {\n result = (result * base) % mod;\n }\n base = (base * base) % mod;\n exp = exp >> 1;\n }\n return result;\n }\n \n static long[] fac;\n static long[] inv;\n static long mod=(long)1e9+7;\n public static void cal() \n {\n fac = new long[1000005];\n inv = new long[1000005];\n fac[0] = 1;\n inv[0] = 1;\n for (int i = 1; i <= 1000000; i++)\n {\n fac[i] = (fac[i - 1] * i) % mod;\n inv[i] = (inv[i - 1] * modPow(i, mod - 2, mod)) % mod;\n }\n }\n \n public static long ncr(int n, int r) \n {\n return (((fac[n] * inv[r]) % mod) * inv[n - r]) % mod;\n }\n \n \n////////////////////////////////////////// Input Reader ////////////////////////////////////////////////////////////////////////////////////////////////////\n \n static InputReader sc = new InputReader(System.in);\n static PrintWriter out= new PrintWriter(System.out); \n \n static class InputReader {\n \n private final InputStream stream;\n private final byte[] buf = new byte[8192];\n private int curChar, snumChars;\n private SpaceCharFilter filter;\n \n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n \n public int snext()\n {\n if (snumChars == -1)\n throw new InputMismatchException();\n if (curChar >= snumChars) {\n curChar = 0;\n try {\n snumChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (snumChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n \n public int nextInt()\n {\n int c = snext();\n while (isSpaceChar(c)) \n {\n c = snext();\n }\n int sgn = 1;\n if (c == '-')\n {\n sgn = -1;\n c = snext();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = snext();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n \n public long nextLong() \n {\n int c = snext();\n while (isSpaceChar(c)) \n {\n c = snext();\n }\n int sgn = 1;\n if (c == '-') \n {\n sgn = -1;\n c = snext();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = snext();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n \n public int[] nextIntArray(int n)\n {\n int a[] = new int[n];\n for (int i = 0; i < n; i++) \n {\n a[i] = nextInt();\n }\n return a;\n }\n \n public long[] nextLongArray(int n)\n {\n long a[] = new long[n];\n for (int i = 0; i < n; i++) \n {\n a[i] = nextLong();\n }\n return a;\n }\n \n \n public String nextLine()\n {\n int c = snext();\n while (isSpaceChar(c))\n c = snext();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = snext();\n } while (!isEndOfLine(c));\n return res.toString();\n }\n \n public boolean isSpaceChar(int c) \n {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n \n private boolean isEndOfLine(int c) \n {\n return c == '\\n' || c == '\\r' || c == -1;\n }\n \n public interface SpaceCharFilter \n {\n public boolean isSpaceChar(int ch);\n }\n \n }\n \n static int i()\n {\n return sc.nextInt();\n }\n static long l(){\n return sc.nextLong();\n }\n static int[] iarr(int n)\n {\n return sc.nextIntArray(n);\n }\n static long[] larr(int n)\n {\n return sc.nextLongArray(n);\n }\n static String s(){\n return sc.nextLine();\n }\n \n \n }\n", "lang_cluster": "Java", "tags": ["math", "constructive algorithms", "binary search"], "code_uid": "deb576649377454a7f296d638e8eac44", "src_uid": "eb8212aec951f8f69b084446da73eaf7", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.PrintWriter;\nimport java.util.Scanner;\n\npublic class Solution {\n public static void main(String[] args) { new Solution().run(); }\n\n private void run() {\n Scanner in = new Scanner(System.in);\n PrintWriter out = new PrintWriter(System.out);\n\n out.print(25);\n\n in.close();\n out.close();\n }\n}\n", "lang_cluster": "Java", "tags": ["number theory"], "code_uid": "4216fdce798fbcbbdb78e4be5bd954c9", "src_uid": "dcaff75492eafaf61d598779d6202c9d", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.FileNotFoundException;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class Solution implements Runnable {\n BufferedReader in;\n PrintWriter out;\n StringTokenizer tok = new StringTokenizer(\"\");\n \n @Override\n public void run() {\n try {\n init();\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n long time = System.currentTimeMillis();\n try {\n solve();\n } catch (Exception e) {\n e.printStackTrace();\n }\n out.close();\n //System.err.println(System.currentTimeMillis() - time);\n }\n \n private void init() throws FileNotFoundException {\n String file = \"\";\n if (!file.equals(\"\")) {\n in = new BufferedReader(new FileReader(\"input.txt\"));\n out = new PrintWriter(\"output.txt\");\n } else {\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n }\n }\n \n public static void main(String[] args) {\n new Thread(new Solution()).start();\n }\n \n private String readString() {\n while (!tok.hasMoreTokens()) {\n try {\n tok = new StringTokenizer(in.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return tok.nextToken();\n }\n \n private int readInt() {\n return Integer.parseInt(readString());\n }\n \n private long readLong() {\n return Long.parseLong(readString());\n }\n \n \n private void solve() {\n int n = readInt();\n int[] ar = new int[5];\n for (int i = 0; i < n; i++) {\n ar[readInt()-1]++;\n }\n for (int i = 0; i < n; i++) {\n ar[readInt()-1]--;\n }\n int count = 0;\n for (int i = 0; i < ar.length; i++) {\n if(Math.abs(ar[i]%2)==1) {\n out.print(-1);\n return;\n }\n count+= Math.abs(ar[i]/2);\n }\n out.print(count/2);\n \n }\n \n \n \n \n \n \n \n \n \n \n}", "lang_cluster": "Java", "tags": ["math", "constructive algorithms"], "code_uid": "18cb1e2125a822d5e1824ce024265ad5", "src_uid": "47da1dd95cd015acb8c7fd6ae5ec22a3", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\r\nimport java.lang.*;\r\nimport java.util.*;\r\n\r\npublic class Main {\r\n public static MyScanner sc = new MyScanner(System.in);\r\n public static PrintWriter out = new PrintWriter(System.out);\r\n public static void main(String[] args) {\r\n int n = sc.nextint();\r\n int mod = sc.nextint();\r\n long[] dp1 = new long[n + 9];\r\n long[] dp2 = new long[n + 9];\r\n dp2[1] = 1;\r\n for(int i = 1; i <= n; i++){\r\n dp1[i] += dp1[i - 1];\r\n dp1[i] %= mod;\r\n dp2[i] = dp1[i];\r\n if(i == 1){\r\n dp2[i] = 1;\r\n }\r\n dp1[i + 1] += dp2[i];\r\n dp1[i + 1] %= mod;\r\n for(int j = 2; i * j <= n; j++){\r\n dp1[i * j] += dp2[i];\r\n dp1[i * j] %= mod;\r\n if((i + 1) * j <= n) {\r\n dp1[(i + 1) * j] += mod - dp2[i];\r\n dp1[(i + 1) * j] %= mod;\r\n }\r\n }\r\n }\r\n out.print(dp2[n]);\r\n out.close();\r\n }\r\n}\r\nclass MyScanner {\r\n private BufferedReader br;\r\n private StringTokenizer tokenizer;\r\n\r\n public MyScanner(InputStream is) {\r\n br = new BufferedReader(new InputStreamReader(is));\r\n }\r\n\r\n public String next() {\r\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\r\n try {\r\n tokenizer = new StringTokenizer(br.readLine());\r\n } catch (IOException e) {\r\n throw new RuntimeException(e);\r\n }\r\n }\r\n return tokenizer.nextToken();\r\n }\r\n\r\n public int nextint() {\r\n return Integer.parseInt(next());\r\n }\r\n public long nextlong() {\r\n return Long.parseLong(next());\r\n }\r\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "two pointers", "number theory"], "code_uid": "c30a403c28fec3f980d4c156ff4f222e", "src_uid": "77443424be253352aaf2b6c89bdd4671", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import static java.util.Arrays.*;\nimport static java.lang.Math.*;\nimport static java.math.BigInteger.*;\nimport java.util.*;\nimport java.math.*;\nimport java.io.*;\n\npublic class E implements Runnable\n{\n String file = \"input\";\n \n boolean TEST = false;\n \n void solve() throws IOException\n {\n n = nextInt();\n T = nextInt();\n as = new char[n][];\n bs = new char[n][];\n for(int i = 0; i < n; i++) as[i] = next().toCharArray();\n for(int i = 0; i < n; i++) bs[i] = next().toCharArray();\n vs = new boolean[n][n][T + 1];\n for(int i = 0; i < n; i++)\n for(int j = 0; j < n; j++)\n vs[i][j][0] = as[i][j] < '0' || as[i][j] > '9';\n for(int t = 1; t <= T; t++)\n for(int i = 0; i < n; i++)\n for(int j = 0; j < n; j++)\n {\n if(vs[i][j][t - 1])\n {\n vs[i][j][t] = true;\n continue;\n }\n \n for(int dx = -1; dx <= 1; dx++)\n for(int dy = -1; dy <= 1; dy++)\n {\n if(abs(dx) + abs(dy) != 1) continue;\n \n int px = i + dx;\n int py = j + dy;\n if(px < 0 || px >= n || py < 0 || py >= n) continue;\n \n if(vs[px][py][t - 1] && as[px][py] != 'Y') vs[i][j][t] = true;\n }\n }\n N = n * n;\n m = n * n * 2 + 2;\n cap = new int[m][m];\n st = m - 2;\n en = m - 1;\n //print(as[0][0]);\n for(int i = 0; i < n; i++)\n for(int j = 0; j < n; j++)\n if(as[i][j] >= '0' && as[i][j] <= '9') BFS(i * n + j, as[i][j] - '0');\n \n for(int i = 0; i < n; i++)\n for(int j = 0; j < n; j++)\n if(as[i][j] >= '0' && as[i][j] <= '9') cap[st][i * n + j] = as[i][j] - '0';\n for(int i = 0; i < n; i++)\n for(int j = 0; j < n; j++)\n if(bs[i][j] >= '0' && bs[i][j] <= '9') cap[i * n + j + N][en] = bs[i][j] - '0';\n \n //for(int i = 0; i < m - 2; i++)\n // for(int j = 0; j < m - 2; j++)\n // if(cap[i][j] > 0) print(i, j);\n \n out.println(runflow(st, en));\n }\n int[][] cap;\n int runflow(int st, int en)\n {\n int res = 0;\n while(true)\n {\n int flow = maxflow(st, en, INF, new boolean[m]);\n if(flow == 0) break;\n res += flow;\n }\n return res;\n }\n \n int maxflow(int st, int en, int curflow, boolean[] vs)\n {\n if(st == en) return curflow;\n \n for(int i = 0; i < m; i++)\n if(cap[st][i] > 0 && !vs[i])\n {\n vs[i] = true;\n int flow = maxflow(i, en, min(curflow, cap[st][i]), vs);\n if(flow > 0)\n {\n cap[st][i] -= flow;\n cap[i][st] += flow;\n return flow;\n }\n }\n return 0;\n }\n int N;\n int INF = 1 << 20; \n void BFS(int st, int val)\n {\n Queue<Integer> q = new LinkedList<Integer>();\n int[] dist = new int[m];\n fill(dist, INF);\n q.offer(st);\n dist[st] = 0;\n if(bs[st / n][st % n] > '0' && bs[st / n][st % n] <= '9') cap[st][st + N] = val;\n while(!q.isEmpty())\n {\n int u = q.poll();\n if(dist[u] >= T) continue;\n \n \n int x = u / n, y = u % n;\n for(int dx = -1; dx <= 1; dx++)\n for(int dy = -1; dy <= 1; dy++)\n {\n if(abs(dx) + abs(dy) != 1) continue;\n int tx = x + dx;\n int ty = y + dy;\n \n if(tx < 0 || tx >= n || ty < 0 || ty >= n) continue;\n \n if(vs[tx][ty][dist[u]]) continue;\n int v = tx * n + ty;\n if(!vs[tx][ty][dist[u] + 1])\n {\n if(dist[v] > dist[u] + 1)\n {\n dist[v] = dist[u] + 1;\n q.offer(v);\n cap[st][v + N] = val;\n }\n }\n else if(bs[tx][ty] > '0' && bs[tx][ty] <= '9') cap[st][v + N] = val;\n }\n }\n }\n int m, st, en;\n char[][] as, bs;\n boolean[][][] vs;\n int n, T;\n \n\n \n String next() throws IOException\n {\n while(token == null || !token.hasMoreTokens()) token = new StringTokenizer(input.readLine());\n return token.nextToken();\n }\n \n int nextInt() throws IOException\n {\n return Integer.parseInt(next());\n }\n \n long nextLong() throws IOException\n {\n return Long.parseLong(next());\n }\n \n double nextDouble() throws IOException\n {\n return Double.parseDouble(next());\n }\n \n void print(Object... o)\n {\n System.out.println(deepToString(o));\n }\n \n void gcj(Object o)\n {\n String s = String.valueOf(o);\n out.println(\"Case #\" + test + \": \" + s);\n System.out.println(\"Case #\" + test + \": \" + s);\n }\n \n BufferedReader input;\n PrintWriter out;\n StringTokenizer token;\n int test;\n \n void init() throws IOException\n {\n if(TEST) input = new BufferedReader(new FileReader(file + \".in\")); \n else input = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(new BufferedOutputStream(System.out));\n }\n \n public static void main(String[] args) throws IOException\n {\n new Thread(null, new E(), \"\", 1 << 20).start();\n }\n \n public void run()\n {\n try\n {\n init();\n if(TEST) \n {\n int runs = nextInt();\n for(int i = 0; i < runs; i++) solve();\n }\n else solve();\n out.close(); \n }\n catch(Exception e)\n {\n e.printStackTrace();\n System.exit(1);\n }\n }\n}", "lang_cluster": "Java", "tags": ["flows", "graphs", "shortest paths"], "code_uid": "1d941f9ed065c384113e515c5e049306", "src_uid": "544de9c3729a35eb08c143b1cb9ee085", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "//package round70;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.BitSet;\nimport java.util.Scanner;\n\npublic class E {\n\tScanner in;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t\tint n = ni();\n\t\tint t = ni();\n\t\tchar[][] map = new char[n][n]; // initial map\n\t\tchar[][][] dmap = new char[t+1][n][n]; // dead map\n\t\tchar[][] hmap = new char[n][n]; // hazard map\n\t\tint ct = 0, cct = 0;\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tmap[i] = in.next().toCharArray();\n\t\t\tdmap[0][i] = Arrays.copyOf(map[i], n);\n\t\t\tfor(int j = 0;j < n;j++){\n\t\t\t\tif(map[i][j] >= '1' && map[i][j] <= '9'){\n\t\t\t\t\tct += map[i][j] - '0';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0;i < n;i++){\n\t\t\thmap[i] = in.next().toCharArray();\n\t\t\tfor(int j = 0;j < n;j++){\n\t\t\t\tif(hmap[i][j] >= '1' && hmap[i][j] <= '9'){\n\t\t\t\t\tcct += hmap[i][j] - '0';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tint[] dr = {1,0,-1,0,0};\n\t\tint[] dc = {0,1,0,-1,0};\n\t\tfor(int i = 1;i <= t;i++){\n\t\t\tfor(int j = 0;j < n;j++){\n\t\t\t\tfor(int k = 0;k < n;k++){\n\t\t\t\t\tif(dmap[i-1][j][k] == 'Z'){\n\t\t\t\t\t\tfor(int l = 0;l < 5;l++){\n\t\t\t\t\t\t\tint nr = j + dr[l];\n\t\t\t\t\t\t\tint nc = k + dc[l];\n\t\t\t\t\t\t\tif(nr >= 0 && nr < n && nc >= 0 && nc < n && map[nr][nc] != 'Y'){\n\t\t\t\t\t\t\t\tdmap[i][nr][nc] = 'Z';\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n//\t\t\ttr(dmap[i]);\n\t\t}\n\t\t\n\t\tboolean[][] g = new boolean[n*n][n*n];\n\t\tBitSet[][][] alive = new BitSet[2][n*n][n*n];\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tfor(int j = 0;j < n;j++){\n\t\t\t\talive[0][i][j] = new BitSet();\n\t\t\t\talive[1][i][j] = new BitSet();\n\t\t\t\tif(map[i][j] >= '1' && map[i][j] <= '9'){\n\t\t\t\t\talive[0][i][j].set(i*n+j);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tfor(int j = 0;j < n;j++){\n\t\t\t\tif(hmap[i][j] >= '1' && hmap[i][j] <= '9'){\n\t\t\t\t\tfor(int l = alive[0][i][j].nextSetBit(0);l != -1;l = alive[0][i][j]\n\t\t\t\t\t\t\t.nextSetBit(l + 1)){\n\t\t\t\t\t\tg[l][i*n+j] = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int k = 0, w = 0;k < t;k++, w^=1){\n\t\t\tfor(int i = 0;i < n;i++){\n\t\t\t\tfor(int j = 0;j < n;j++){\n\t\t\t\t\talive[w^1][i][j].clear();\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int i = 0;i < n;i++){\n\t\t\t\tfor(int j = 0;j < n;j++){\n\t\t\t\t\tif(k == 0 || dmap[k][i][j] != 'Z'){\n\t\t\t\t\t\tfor(int l = 0;l < 5;l++){\n\t\t\t\t\t\t\tint nr = i + dr[l];\n\t\t\t\t\t\t\tint nc = j + dc[l];\n\t\t\t\t\t\t\tif(nr >= 0 && nr < n && nc >= 0 && nc < n && map[nr][nc] != 'Y' && dmap[k][nr][nc] != 'Z'){\n\t\t\t\t\t\t\t\talive[w^1][nr][nc].or(alive[w][i][j]);\n//\t\t\t\t\t\t\t\tif(alive[w^1][nr][nc].get(8)){\n//\t\t\t\t\t\t\t\t\ttr(k, nr, nc);\n//\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int i = 0;i < n;i++){\n\t\t\t\tfor(int j = 0;j < n;j++){\n\t\t\t\t\tif(hmap[i][j] >= '1' && hmap[i][j] <= '9'){\n\t\t\t\t\t\tfor(int l = alive[w^1][i][j].nextSetBit(0);l != -1;l = alive[w^1][i][j]\n\t\t\t\t\t\t\t\t.nextSetBit(l + 1)){\n\t\t\t\t\t\t\tg[l][i*n+j] = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n//\t\tfor(int i = 0;i < n*n;i++){\n//\t\t\ttr(g[i]);\n//\t\t}\n\t\t\n\t\tint[] indc = new int[n*n+1];\n\t\tint[] inds = new int[n*n+1];\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tfor(int j = 0;j < n;j++){\n\t\t\t\tindc[i*n+j+1] = indc[i*n+j] + (hmap[i][j] >= '1' && hmap[i][j] <= '9' ? hmap[i][j]-'0' : 0);\n\t\t\t\tinds[i*n+j+1] = inds[i*n+j] + (map[i][j] >= '1' && map[i][j] <= '9' ? map[i][j]-'0' : 0);\n\t\t\t}\n\t\t}\n\t\t\n\t\tboolean[][] lg = new boolean[ct][cct];\n\t\tfor(int i = 0;i < n*n;i++){\n\t\t\tfor(int j = 0;j < n*n;j++){\n\t\t\t\tif(g[i][j]){\n\t\t\t\t\tfor(int k = inds[i];k < inds[i+1];k++){\n\t\t\t\t\t\tfor(int l = indc[j];l < indc[j+1];l++){\n\t\t\t\t\t\t\tlg[k][l] = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n//\t\ttr(lg);\n\t\t\n\t\tout.println(doBipartiteMatching(lg));\n\t}\n\t\n\tpublic static int doBipartiteMatching(boolean[][] g)\n\t{\n\t\tif(g.length == 0)return 0;\n\t\tif(g[0].length == 0)return 0;\n\t\t\n\t\tint n = g.length;\n\t\tint m = g[0].length;\n\t\tint[] im = new int[m];\n\t\tArrays.fill(im, -1);\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tBitSet visited = new BitSet();\n\t\t\tvisit(g, i, visited, im);\n\t\t}\n\n\t\tint ct = 0;\n\t\tfor(int i = 0;i < m;i++){\n\t\t\tif(im[i] != -1)ct++;\n\t\t}\n\t\treturn ct;\n\t}\n\n\tpublic static boolean visit(boolean[][] g, int cur, BitSet visited, int[] im)\n\t{\n\t\tif(cur == -1)return true;\n\n\t\tfor(int i = visited.nextClearBit(0);i != g[cur].length;i = visited.nextClearBit(i+1)){\n\t\t\tif(g[cur][i]){\n\t\t\t\tvisited.set(i);\n\t\t\t\tif(visit(g, im[i], visited, im)){\n\t\t\t\t\tim[i] = cur;\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\t\n\tvoid run() throws Exception\n\t{\n\t\tin = INPUT.isEmpty() ? new Scanner(System.in) : new Scanner(INPUT);\n\t\tout = new PrintWriter(System.out);\n\n\t\tsolve();\n\t\tout.flush();\n\t}\n\t\n\t\n\tpublic static void main(String[] args) throws Exception\n\t{\n\t\tnew E().run();\n\t}\n\t\n\tint ni() { return Integer.parseInt(in.next()); }\n\tdouble nd() { return Double.parseDouble(in.next()); }\n\tvoid tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["flows", "graphs", "shortest paths"], "code_uid": "cba03bcf43dbae4645bc61746ea122f5", "src_uid": "544de9c3729a35eb08c143b1cb9ee085", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n\n/*\nprocrastinating\n*/\n\npublic class Main {\n\n static FastReader in;\n static PrintWriter out;\n static Random rand = new Random();\n static final int oo = (int) 2e9;\n static final long OO = (long) 4e18;\n static final int MOD = 998244353;\n\n static void dbg(Object... args) {\n for (Object a : args)\n out.print(a + \" \");\n out.println();\n }\n\n static int n, t, nn;\n static char[][] a, b;\n static int[][] danger, c;\n static int[][] dirs = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};\n static int[][][][][] dp;\n\n static class Pair {\n int x, y;\n\n Pair(int x, int y) {\n this.x = x;\n this.y = y;\n }\n }\n\n static void bfs(int x0, int y0) {\n danger = new int[n][n];\n for (int i = 0; i < n; i++)\n Arrays.fill(danger[i], -1);\n danger[x0][y0] = 0;\n\n Pair[] q = new Pair[nn];\n int i = 0;\n q[i++] = new Pair(x0, y0);\n for (int j = 0; j < i; j++) {\n Pair fi = q[j];\n for (int[] dir : dirs) {\n int x = fi.x + dir[0];\n int y = fi.y + dir[1];\n if (x >= 0 && x < n && y >= 0 && y < n && a[x][y] < 'Y' && danger[x][y] == -1) {\n danger[x][y] = danger[fi.x][fi.y] + 1;\n q[i++] = new Pair(x, y);\n }\n }\n }\n }\n\n static void go(int t, int x0, int y0, int x1, int y1) {\n if (dp[t][x0][y0][x1][y1] != -1)\n return;\n\n if (t == 0) {\n if (x0 == x1 && y0 == y1)\n dp[t][x0][y0][x1][y1] = 2;\n else\n dp[t][x0][y0][x1][y1] = 0;\n return;\n }\n\n if (danger[x1][y1] != -1 && danger[x1][y1] < t) {\n dp[t][x0][y0][x1][y1] = 0;\n return;\n }\n\n int val = dp[t - 1][x0][y0][x1][y1];\n for (int[] dir : dirs) {\n int x = x1 + dir[0];\n int y = y1 + dir[1];\n if (x >= 0 && x < n && y >= 0 && y < n && a[x][y] < 'Y')\n val |= dp[t - 1][x0][y0][x][y];\n }\n\n// dbg(t, x0, y0, x1, y1, dp[t][x0][y0][x1][y1]);\n\n if ((val & 2) == 2)\n dp[t][x0][y0][x1][y1] = 2;\n else\n dp[t][x0][y0][x1][y1] = 0;\n\n if (dp[t][x0][y0][x1][y1] == 2 && danger[x1][y1] == t)\n dp[t][x0][y0][x1][y1] = 1;\n }\n\n\n static class FordFulkerson {\n int n;\n int[][] c;\n\n FordFulkerson(int[][] c) {\n this.c = c;\n n = c.length;\n }\n\n int findMaxFlow(int s, int t) {\n int[][] c1 = new int[n][n];\n for (int v = 0; v < n; v++)\n for (int u = 0; u < n; u++)\n c1[v][u] = c[v][u];\n\n int maxFlow = 0;\n int[] par = new int[n];\n while (bfs(s, t, c1, par)) {\n int delta = oo;\n int v = t;\n while (v != s) {\n int u = par[v];\n delta = Math.min(delta, c1[u][v]);\n v = u;\n }\n v = t;\n while (v != s) {\n int u = par[v];\n c1[u][v] -= delta;\n c1[v][u] += delta;\n v = u;\n }\n maxFlow += delta;\n }\n\n return maxFlow;\n }\n\n boolean bfs(int s, int t, int[][] c1, int[] par) {\n int[] q = new int[n];\n int i = 0;\n q[i++] = s;\n int[] d = new int[n]; Arrays.fill(d, -1);\n d[s] = 0;\n for (int j = 0; j < i; j++) {\n int v = q[j];\n for (int u = 0; u < n; u++) {\n if (d[u] == -1 && c1[v][u] > 0) {\n par[u] = v;\n q[i++] = u;\n d[u] = d[v] + 1;\n }\n }\n }\n return d[t] != -1;\n }\n }\n\n\n static void print(int[][] arr) {\n for (int i = 0; i < arr.length; i++) {\n for (int j = 0; j < arr[i].length; j++)\n out.print(arr[i][j] + \" \");\n out.println();\n }\n }\n\n\n static void solve() {\n n = in.nextInt();\n t = in.nextInt();\n nn = n * n;\n\n a = new char[n][];\n for (int i = 0; i < n; i++)\n a[i] = in.next().toCharArray();\n\n b = new char[n][];\n for (int i = 0; i < n; i++)\n b[i] = in.next().toCharArray();\n\n int xz = -1, yz = -1;\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++)\n if (a[i][j] == 'Z') {\n xz = i;\n yz = j;\n }\n\n bfs(xz, yz);\n// print(danger);\n\n dp = new int[t + 1][n][n][n][n];\n for (int i = 0; i <= t; i++)\n for (int x0 = 0; x0 < n; x0++)\n for (int y0 = 0; y0 < n; y0++)\n for (int x1 = 0; x1 < n; x1++)\n for (int y1 = 0; y1 < n; y1++)\n if (a[x0][y0] < 'Y' && a[x1][y1] < 'Y') {\n dp[i][x0][y0][x1][y1] = -1;\n go(i, x0, y0, x1, y1);\n }\n\n c = new int[nn * 2 + 2][nn * 2 + 2];\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++)\n if (a[i][j] < 'Y')\n c[0][1 + i * n + j] = a[i][j] - '0';\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++)\n if (b[i][j] < 'Y')\n c[1 + nn + i * n + j][nn * 2 + 1] = b[i][j] - '0';\n for (int x0 = 0; x0 < n; x0++)\n for (int y0 = 0; y0 < n; y0++)\n for (int x1 = 0; x1 < n; x1++)\n for (int y1 = 0; y1 < n; y1++)\n for (int i = 0; i <= t; i++)\n if (a[x0][y0] - '0' > 0 && b[x1][y1] - '0' > 0)\n c[1 + x0 * n + y0][1 + nn + x1 * n + y1] |= (dp[i][x0][y0][x1][y1] != 0 ? 10 : 0);\n\n// print(c);\n\n FordFulkerson ff = new FordFulkerson(c);\n int ans = ff.findMaxFlow(0, nn * 2 + 1);\n\n out.println(ans);\n\n }\n\n public static void main(String[] args) throws FileNotFoundException {\n in = new FastReader(System.in);\n// in = new FastReader(new FileInputStream(\"sometext.txt\"));\n out = new PrintWriter(System.out);\n// out = new PrintWriter(new FileOutputStream(\"output.txt\"));\n\n\n solve();\n\n// Thread thread = new Thread(null, () -> {\n// solve();\n// }, \"Main\", 1 << 28);\n// thread.start();\n// try {\n// thread.join();\n// } catch (InterruptedException e) {\n// e.printStackTrace();\n// }\n\n\n// out.flush();\n out.close();\n }\n\n static class FastReader {\n BufferedReader br;\n StringTokenizer st;\n\n FastReader(InputStream is) {\n br = new BufferedReader(new InputStreamReader(is));\n }\n\n Integer nextInt() {\n return Integer.parseInt(next());\n }\n\n Long nextLong() {\n return Long.parseLong(next());\n }\n\n Double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(nextLine());\n }\n return st.nextToken();\n }\n\n String nextLine() {\n String s = \"\";\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return s;\n }\n }\n\n}", "lang_cluster": "Java", "tags": ["flows", "graphs", "shortest paths"], "code_uid": "35b02441f556938bfb9dcb9096b2daa0", "src_uid": "544de9c3729a35eb08c143b1cb9ee085", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintStream;\nimport java.io.PrintWriter;\nimport java.io.OutputStream;\nimport java.util.Arrays;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.io.BufferedOutputStream;\nimport java.util.List;\nimport java.util.StringTokenizer;\nimport java.io.Writer;\nimport java.io.BufferedReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author An Almost Retired Guy\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n TaskE solver = new TaskE();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskE {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n = in.nextInt(), t = in.nextInt();\n char[][] scientists = in.nextCharArray2(n, n), capsules = in.nextCharArray2(n, n);\n boolean[][] table = new boolean[n][n];\n int x0 = -1, y0 = -1;\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++) {\n table[i][j] = Character.isDigit(scientists[i][j]);\n if (scientists[i][j] == 'Z') {\n x0 = i;\n y0 = j;\n }\n }\n int n2 = n * n, N = 2 * n2 + 2, sink = N - 1, source = sink - 1;\n ArrayList<MaxFlowDinic.Edge>[] graph = new ArrayList[N];\n for (int i = 0; i < N; i++) graph[i] = new ArrayList<>();\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++)\n MaxFlowDinic.addEdge(graph, source, i * n + j, table[i][j] ? scientists[i][j] - '0' : 0);\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++)\n MaxFlowDinic.addEdge(graph, n2 + i * n + j, sink, table[i][j] ? capsules[i][j] - '0' : 0);\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++)\n for (int k = 0; k < n; k++)\n for (int l = 0; l < n; l++)\n if (f(table, i, j, k, l, x0, y0, t)) {\n if (table[i][j] && table[k][l] && scientists[i][j] != '0' && capsules[k][l] != '0')\n System.err.println(i + \" \" + j + \" \" + k + \" \" + l);\n MaxFlowDinic.addEdge(graph, i * n + j, n2 + k * n + l, Integer.MAX_VALUE);\n }\n int ans = MaxFlowDinic.maxFlow(graph, source, sink);\n out.println(ans);\n }\n\n boolean f(boolean[][] table, int xs, int ys, int xe, int ye, int x0, int y0, int t) {\n int n = table.length;\n int[][] last = new int[n][n], now = new int[n][n];\n final int[] dx = new int[]{-1, 0, 0, 1}, dy = new int[]{0, -1, 1, 0};\n now[xs][ys] = 1;\n now[x0][y0] = -1;\n while (t-- > 0) {\n boolean can1 = false;\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) last[i][j] = now[i][j];\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++)\n if (last[i][j] == 1) for (int k = 0; k < 4; k++) {\n int i2 = i + dx[k], j2 = j + dy[k];\n if (i2 >= 0 && i2 < n && j2 >= 0 && j2 < n && table[i2][j2] && now[i2][j2] == 0) {\n now[i2][j2] = 1;\n can1 = true;\n }\n }\n boolean can2 = false;\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) last[i][j] = now[i][j];\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++)\n if (last[i][j] == -1) for (int k = 0; k < 4; k++) {\n int i2 = i + dx[k], j2 = j + dy[k];\n if (i2 >= 0 && i2 < n && j2 >= 0 && j2 < n && table[i2][j2] && (now[i2][j2] == 0 || (now[i2][j2] == 1 && (i2 != xe || j2 != ye)))) {\n now[i2][j2] = -1;\n can2 = true;\n }\n }\n if (!can1 && !can2) break;\n }\n return now[xe][ye] == 1;\n }\n\n }\n\n static class MaxFlowDinic {\n public static void addEdge(List<MaxFlowDinic.Edge>[] graph, int s, int t, int cap) {\n graph[s].add(new MaxFlowDinic.Edge(t, graph[t].size(), cap));\n graph[t].add(new MaxFlowDinic.Edge(s, graph[s].size() - 1, 0));\n }\n\n static boolean dinicBfs(List<MaxFlowDinic.Edge>[] graph, int src, int dest, int[] dist) {\n Arrays.fill(dist, -1);\n dist[src] = 0;\n int[] Q = new int[graph.length];\n int sizeQ = 0;\n Q[sizeQ++] = src;\n for (int i = 0; i < sizeQ; i++) {\n int u = Q[i];\n for (MaxFlowDinic.Edge e : graph[u]) {\n if (dist[e.t] < 0 && e.f < e.cap) {\n dist[e.t] = dist[u] + 1;\n Q[sizeQ++] = e.t;\n }\n }\n }\n return dist[dest] >= 0;\n }\n\n static int dinicDfs(List<MaxFlowDinic.Edge>[] graph, int[] ptr, int[] dist, int dest, int u, int f) {\n if (u == dest)\n return f;\n for (; ptr[u] < graph[u].size(); ++ptr[u]) {\n MaxFlowDinic.Edge e = graph[u].get(ptr[u]);\n if (dist[e.t] == dist[u] + 1 && e.f < e.cap) {\n int df = dinicDfs(graph, ptr, dist, dest, e.t, Math.min(f, e.cap - e.f));\n if (df > 0) {\n e.f += df;\n graph[e.t].get(e.rev).f -= df;\n return df;\n }\n }\n }\n return 0;\n }\n\n public static int maxFlow(List<MaxFlowDinic.Edge>[] graph, int src, int dest) {\n int flow = 0;\n int[] dist = new int[graph.length];\n while (dinicBfs(graph, src, dest, dist)) {\n int[] ptr = new int[graph.length];\n while (true) {\n int df = dinicDfs(graph, ptr, dist, dest, src, Integer.MAX_VALUE);\n if (df == 0)\n break;\n flow += df;\n }\n }\n return flow;\n }\n\n public static class Edge {\n public int t;\n public int rev;\n public int cap;\n public int f;\n\n public Edge(int t, int rev, int cap) {\n this.t = t;\n this.rev = rev;\n this.cap = cap;\n }\n\n }\n\n }\n\n static class InputReader {\n BufferedReader br;\n StringTokenizer st;\n\n public InputReader(InputStream inputStream) {\n br = new BufferedReader(new InputStreamReader(inputStream));\n }\n\n public String next() {\n while (st == null || !st.hasMoreElements()) {\n st = new StringTokenizer(nextLine());\n }\n return st.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public String nextString() {\n return next();\n }\n\n public char[] nextCharArray(int n) {\n char[] a = nextString().toCharArray();\n assert (a.length == n);\n return a;\n }\n\n public char[][] nextCharArray2(int n, int m) {\n char[][] a = new char[n][];\n for (int i = 0; i < n; i++) a[i] = nextCharArray(m);\n return a;\n }\n\n public String nextLine() {\n try {\n return br.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n\n }\n\n static class OutputWriter extends PrintWriter {\n public OutputWriter(OutputStream outputStream) {\n super(new BufferedOutputStream(outputStream));\n }\n\n public OutputWriter(Writer writer) {\n super(writer);\n }\n\n public void close() {\n super.close();\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["flows", "graphs", "shortest paths"], "code_uid": "8ff369c8e6e8fc666c2796f41bb24d93", "src_uid": "544de9c3729a35eb08c143b1cb9ee085", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.*;\n\n\npublic class Evacuation {\n\tstatic class MaxFlow_EdmondsKarp {\n\n\t\t/**\n\t\t * @param args\n\t\t */\n\t\t\n\t\tpublic static int maxflow(int[][] cap,int src,int dest){\n\t\t\tint cost=0;\n\t\t\tint c=0;\n\t\t\tint[][] flow=new int[cap.length][cap[0].length];\n\t\t\twhile((c=bfs(cap,src,dest,flow))!=0){\n\t\t\t\tcost+=c;\n\t\t\t}\n\n\t\t\treturn cost;\n\t\t}\n\t\tprivate static int bfs(int[][] cap, int src, int dest,int[][] flow) {\n\t\t\tQueue<Integer> q=new LinkedList<Integer>();\n\t\t\tq.add(src);\n\t\t\tboolean[] vis=new boolean[cap.length];\n\t\t\tvis[src]=true;\n\t\t\tint[] parent=new int[cap.length];\n\t\t\tArrays.fill(parent, -1);\n\t\t\twhile(!q.isEmpty()){\n\t\t\t\tint front=q.remove();\n\t\t\t\tif(front==dest)break;\n\t\t\t\tfor(int i=0;i<cap[front].length;i++){\n\t\t\t\t\tif(vis[i]||cap[front][i]<=0)continue;\n\t\t\t\t\tvis[i]=true;\n\t\t\t\t\tparent[i]=front;\n\t\t\t\t\tq.add(i);\n\t\t\t\t}\n\t\t\t}\n\t\t\tint current=dest;\n\t\t\tint min=Integer.MAX_VALUE;\n\t\t\twhile(parent[current]!=-1){\n\t\t\t\tmin=Math.min(min,cap[parent[current]][current]);\n\t\t\t\tcurrent=parent[current];\n\t\t\t}\n\t\t\tcurrent=dest;\n\t\t\twhile(parent[current]!=-1){\n\t\t\t\tcap[parent[current]][current]-=min;\n\t\t\t\tcap[current][parent[current]]+=min;\n\t\t\t\tflow[current][parent[current]]-=min;\n\t\t\t\tflow[parent[current]][current]+=min;\n\t\t\t\tcurrent=parent[current];\n\t\t\t}\n\t\t\treturn min==Integer.MAX_VALUE?0:min;\n\t\t}\n\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\t// TODO Auto-generated method stub\n\t\tBufferedReader r=new BufferedReader(new InputStreamReader(System.in));\n\t\t\tString s1=r.readLine();\n\t\t\tString[] sp=s1.split(\"[ ]+\");\n\t\t\tint n=new Integer(sp[0]);\n\t\t\tint m=new Integer(sp[0]);\n\t\t\tint t=new Integer(sp[1]);\n\t\t\tchar[][] arr=new char[n][m];\n\t\t\tint x=-1,y=-1;\n\t\t\tfor (int i = 0; i < arr.length; i++) {\n\t\t\t\tarr[i]=r.readLine().toCharArray();\n\t\t\t\tfor (int j = 0; j < arr[i].length; j++) {\n\t\t\t\t\tif(arr[i][j]=='Z'){\n\t\t\t\t\t\tx=i;\n\t\t\t\t\t\ty=j;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tr.readLine();\n\t\t\tchar[][] rescue = new char[n][m];\n\t\t\tfor (int i = 0; i < rescue.length; i++) {\n\t\t\t\trescue[i]=r.readLine().toCharArray();\n\t\t\t}\n\t\t\tint[][] inf=new int[n][m];\n\t\t\tfor (int i = 0; i < inf.length; i++) {\n\t\t\t\tArrays.fill(inf[i], t);\n\t\t\t}\n\t\t\tQueue<Integer> q=new LinkedList<Integer>();\n\t\t\tq.add(x);\n\t\t\tq.add(y);\n\t\t\tq.add(0);\n\t\t\tboolean[][] vis=new boolean[n][m];\n\t\t\tvis[x][y]=true;\n\t\t\tint[] dx={1,-1,0,0};\n\t\t\tint[] dy={0,0,1,-1};\n\t\t\twhile(!q.isEmpty()){\n\t\t\t\tint fx = q.remove();\n\t\t\t\tint fy = q.remove();\n\t\t\t\tint fc = q.remove();\n\t\t\t\tif(fc>t)break;\n\t\t\t\tinf[fx][fy]=fc;\n\t\t\t\tfor(int i=0;i<4;i++){\n\t\t\t\t\tint nx=fx+dx[i];\n\t\t\t\t\tint ny=fy+dy[i];\n\t\t\t\t\tif(nx>=0&&nx<n&&ny>=0&&ny<m&&!vis[nx][ny]&&arr[nx][ny]!='Y'&&arr[nx][ny]!='Z'){\n\t\t\t\t\t\tq.add(nx);\n\t\t\t\t\t\tq.add(ny);\n\t\t\t\t\t\tq.add(fc+1);\n\t\t\t\t\t\tvis[nx][ny]=true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\tint[][] cap=new int[n*n*2+2][n*n*2+2]; // 2*n^2 + 2 \n\t\t// first i*n+j , second n*n+a*n+b , src n*n*2 dest n*n*2+1\n\t\tfor(int i=0;i<n;i++){\n\t\t\tfor(int j=0;j<n;j++){\n\t\t\t\tfor(int a=0;a<n;a++){\n\t\t\t\t\tfor(int b=0;b<n;b++){\n\t\t\t\t\t\tif(arr[i][j]>'0'&&arr[i][j]<='9'&&rescue[a][b]>'0'&&rescue[a][b]<='9'){\n\t\t\t\t\t\t\tboolean can = false;\n\t\t\t\t\t\t\tq=new LinkedList<Integer>();\n\t\t\t\t\t\t\tq.add(i);\n\t\t\t\t\t\t\tq.add(j);\n\t\t\t\t\t\t\tq.add(0);\n\t\t\t\t\t\t\tvis=new boolean[n][m];\n\t\t\t\t\t\t\tvis[i][j]=true;\n\t\t\t\t\t\t\twhile(!q.isEmpty()){\n\t\t\t\t\t\t\t\tint fx = q.remove();\n\t\t\t\t\t\t\t\tint fy = q.remove();\n\t\t\t\t\t\t\t\tif(fx==a&&fy==b){\n\t\t\t\t\t\t\t\t\tcan=true;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tint ft = q.remove();\n\t\t\t\t\t\t\t\tif(inf[fx][fy]<=ft)continue;\n\t\t\t\t\t\t\t\tfor(int u=0;u<4;u++){\n\t\t\t\t\t\t\t\t\tint nx=fx+dx[u];\n\t\t\t\t\t\t\t\t\tint ny=fy+dy[u];\n\t\t\t\t\t\t\t\t\tif(nx>=0&&nx<n&&ny>=0&&ny<m&&!vis[nx][ny]&&arr[nx][ny]!='Y'&&(inf[nx][ny]>=ft+1)){\n\t\t\t\t\t\t\t\t\t\tq.add(nx);\n\t\t\t\t\t\t\t\t\t\tq.add(ny);\n\t\t\t\t\t\t\t\t\t\tq.add(ft+1);\n\t\t\t\t\t\t\t\t\t\tvis[nx][ny]=true;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif(can){\n\t\t\t\t\t\t\t\tcap[i*n+j][n*n+a*n+b]=Math.min(arr[i][j]-'0',rescue[a][b]-'0');\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<n*n;i++){\n\t\t\tif(arr[i/n][i%n]>='1'&&arr[i/n][i%n]<='9')\n\t\t\t\tcap[n*n*2][i]=arr[i/n][i%n]-'0';\n\t\t\telse\n\t\t\t\tcap[n*n*2][i]=0;\n\t\t}\n\t\tfor(int i=0;i<n*n;i++){\n\t\t\tif(rescue[i/n][i%n]>='1'&&rescue[i/n][i%n]<='9')\n\t\t\t\tcap[n*n+i][2*n*n+1]=rescue[i/n][i%n]-'0';\n\t\t\telse\n\t\t\t\tcap[n*n+i][2*n*n+1]=0;\n\t\t}\n\t\n\t\tint max = MaxFlow_EdmondsKarp.maxflow(cap, n*n*2, 2*n*n+1);\n\t\tSystem.out.println(max);\n\t\t\t\n\t\t\t\n\t}\n}\n", "lang_cluster": "Java", "tags": ["flows", "graphs", "shortest paths"], "code_uid": "8be340ec0865648977369ac82c25cd17", "src_uid": "544de9c3729a35eb08c143b1cb9ee085", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.LinkedList;\nimport java.util.InputMismatchException;\nimport java.io.*;\nimport java.util.Arrays;\nimport java.util.Queue;\n\n/**\n * Generated by Contest helper plug-in\n * Actual solution is at the bottom\n */\npublic class Main {\n public static void main(String[] args) {\n InputReader in = new StreamInputReader(System.in);\n PrintWriter out = new PrintWriter(System.out);\n run(in, out);\n }\n\n public static void run(InputReader in, PrintWriter out) {\n Solver solver = new Matching();\n solver.solve(1, in, out);\n Exit.exit(in, out);\n }\n}\n\nclass StreamInputReader extends InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar, numChars;\n\n public StreamInputReader(InputStream stream) {\n this.stream = stream;\n curChar = 0;\n }\n\n public int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n @Override\n public void close() {\n try {\n stream.close();\n } catch (IOException ignored) {\n }\n }\n}\n\nabstract class InputReader {\n private boolean finished = false;\n\n public abstract int read();\n\n public int nextInt() {\n return Integer.parseInt(nextToken());\n }\n public String readString() {\n return readLine();\n }\n\n\n public String readLine() {\n StringBuffer res = new StringBuffer();\n do {\n int c = read();\n if (isEndOfLineChar(c)) {\n return res.toString();\n }\n res.appendCodePoint(c);\n } while (true) ;\n }\n public String nextToken() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuffer res = new StringBuffer();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n private boolean isEndOfLineChar(int c) {\n return c == '\\n' || c == '\\r' || c == -1;\n }\n private boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public void setFinished(boolean finished) {\n this.finished = finished;\n }\n\n public abstract void close();\n}\n\ninterface Solver {\n public void solve(int testNumber, InputReader in, PrintWriter out);\n}\n\nclass Exit {\n private Exit() {\n }\n\n public static void exit(InputReader in, PrintWriter out) {\n in.setFinished(true);\n in.close();\n out.close();\n }\n}\n\nclass Matching implements Solver {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int size = in.nextInt();\n int bomb = in.nextInt();\n char doctors[][] = new char[size][size];\n char capsuls[][] = new char[size][size];\n for (int i = 0; i < size; ++i) {\n doctors[i] = in.nextToken().toCharArray();\n }\n for (int i = 0; i < size; ++i) {\n capsuls[i] = in.nextToken().toCharArray();\n }\n\n Queue<Point> Q = new LinkedList<Point>() ;\n int dist[][] = new int[size][size];\n for (int[] a : dist) Arrays.fill(a, Integer.MAX_VALUE / 10);\n for (int i = 0; i < size; ++i)\n for (int j = 0; j < size; ++j)\n if (doctors[i][j] == 'Z') {\n dist[i][j] = 0;\n Q.add(new Point(j, i));\n }\n int dj[] = {-1, 1, 0, 0};\n int di[] = {0, 0, -1, 1};\n while (Q.size() > 0) {\n Point p = Q.poll();\n int j = p.x;\n int i = p.y;\n for (int u = 0; u < di.length; ++u) {\n int ni = i + di[u];\n int nj = j + dj[u];\n if (ni >= 0 && nj >= 0 && ni < size && nj < size && dist[ni][nj] == Integer.MAX_VALUE / 10 && Character.isDigit(capsuls[ni][nj])) {\n dist[ni][nj] = dist[i][j] + 1;\n Q.add(new Point(nj, ni));\n }\n }\n }\n /* out.print(\"curse dist : \\n\");\n for (int d[] : dist) {\n out.print(Arrays.toString(d) + \"\\n\"); out.flush();;\n */\n int d[][][][][] = new int[size][size][bomb + 2][size][size];\n for (int a[][][][] : d)\n for (int b[][][] : a)\n for (int c[][] : b)\n for (int e[] : c)\n Arrays.fill(e, -1);\n for (int y = 0; y < size; ++y) {\n for (int x = 0; x < size; ++x) {\n if (Character.isDigit(doctors[y][x]) && doctors[y][x] - '0' >= 0) {\n Queue<Tuples> queue = new LinkedList<Tuples>();\n queue.add(new Tuples(x, y, 0));\n d[y][x][0][y][x] = 1;\n while (queue.size() > 0) {\n Tuples p = queue.poll();\n int i = p.y;\n int j = p.x;\n int time = p.time;\n for (int u = 0; u < di.length; ++u) {\n int ni = i + di[u];\n int nj = j + dj[u];\n\n\n if (ni >= 0 && nj >= 0 && ni < size && nj < size && time + 1 <= bomb && d[y][x][time + 1][ni][nj] == -1 && dist[ni][nj] >= time + 1 && Character.isDigit(doctors[ni][nj]) ) {\n if (dist[ni][nj] > time + 1)\n queue.add(new Tuples(nj, ni, time + 1));\n d[y][x][time + 1][ni][nj] = 1;\n }\n }\n }\n }\n }\n }\n\n int nodes = size * size * 2 + 2;\n int src = nodes - 2;\n int des= nodes - 1;\n int capa[][] = new int[nodes][nodes];\n int flow[][] = new int[nodes][nodes];\n int prev[] = new int[nodes];\n for (int y = 0; y < size; ++y) {\n for (int x= 0; x <size; ++x) {\n if (Character.isDigit(doctors[y][x]) && doctors[y][x] - '0' > 0) {\n capa[src][y * size + x] = doctors[y][x] - '0';\n for (int i = 0; i < size; ++i)\n for (int j = 0; j < size; ++j) {\n for (int t = 0; t <= bomb; ++t)\n if (d[y][x][t][i][j] >= 0 && Character.isDigit(capsuls[i][j]) && capsuls[i][j] - '0' > 0) {\n capa[y * size + x][size * size + i * size + j] = Integer.MAX_VALUE / 10;\n // out.println(\"add edge\" + \"(\" + y + \", \" + x + \")\" + \"->\" + \"(\" + i + \", \" + j + \")\" );\n }\n }\n }\n }\n }\n for (int y = 0; y < size; ++y) {\n for (int x = 0; x < size; ++x)\n if (Character.isDigit(capsuls[y][x]) && capsuls[y][x] - '0' > 0) {\n capa[size * size + y * size + x][des] = capsuls[y][x] - '0';\n }\n }\n\n int res = 0;\n while (true) {\n int q[] = new int[nodes];\n int dd[] = new int[nodes];\n int h = 0;\n q[h ++] = src;\n dd[src] = 1;\n for (int i = 0; i < h; ++i) {\n int cur = q[i];\n for (int j = 0; j < nodes; ++j) {\n if (capa[cur][j] - flow[cur][j] > 0 && dd[j] == 0) {\n prev[j] = cur;\n q[h ++] = j;\n dd[j] = 1;\n }\n }\n }\n if (dd[des] == 0) break;\n int add = Integer.MAX_VALUE / 10;\n for (int cur = des; cur != src; cur = prev[cur]) {\n int p = prev[cur];\n add = Math.min(add, capa[p][cur] - flow[p][cur]);\n }\n for (int cur = des; cur != src; cur = prev[cur]) {\n int p = prev[cur];\n flow[p][cur] += add;\n flow[cur][p] -= add;\n }\n res += add;\n }\n out.print(res);\n }\n class Tuples {\n int x, y, time;\n\n Tuples(int x, int y, int time) {\n this.x = x;\n this.y = y;\n this.time = time;\n }\n }\n class Point {\n int x, y;\n\n Point(int x, int y) {\n this.x = x;\n this.y = y;\n }\n }\n}\n\n", "lang_cluster": "Java", "tags": ["flows", "graphs", "shortest paths"], "code_uid": "caa1f0c2882d03d2aa6a1e2af3a60e99", "src_uid": "544de9c3729a35eb08c143b1cb9ee085", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.Iterator;\nimport java.util.LinkedList;\nimport java.util.Locale;\nimport java.util.Queue;\nimport java.util.Random;\nimport java.util.StringTokenizer;\nimport java.util.TreeMap;\nimport java.util.TreeSet;\n\npublic class Solution implements Runnable {\n\n\tpublic static void main(String[] args) {\n\t\t(new Thread(new Solution())).start();\n\t}\n\n\tBufferedReader in;\n\tPrintWriter out;\n\tStringTokenizer st;\n\n\tString nextToken() throws IOException {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\tString r = in.readLine();\n\t\t\tif (r == null) return null;\n\t\t\tst = new StringTokenizer(r);\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n\t\n\tint[][] a = new int[10][10];\n\tint[][] b = new int[10][10];\n\tint[][] c = new int[10][10];\n\tboolean[][] mat;\n\tboolean[] w;\n\tint t, n;\n\t\n\tvoid bfsc(int x, int y) {\n\t\tc[x][y] = 1;\n\t\tfor (int tt = 1; tt <= t; tt++) {\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\t\tif (a[i][j] >= 0 && c[i][j] == 0) {\n\t\t\t\t\t\tif (i > 0 && c[i - 1][j] == tt) c[i][j] = tt + 1;\n\t\t\t\t\t\tif (j > 0 && c[i][j - 1] == tt) c[i][j] = tt + 1;\n\t\t\t\t\t\tif (j < n - 1 && c[i][j + 1] == tt) c[i][j] = tt + 1;\n\t\t\t\t\t\tif (i < n - 1 && c[i + 1][j] == tt) c[i][j] = tt + 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n\tvoid bfs(int x, int y) {\n\t\tint[][] d = new int[10][10];\n\t\td[x][y] = 1;\n\t\tQueue<Integer> qx = new LinkedList<Integer>();\n\t\tQueue<Integer> qy = new LinkedList<Integer>();\n\t\tQueue<Integer> qt = new LinkedList<Integer>();\n\t\tqx.add(x); qy.add(y); qt.add(0);\n\t\twhile (!qx.isEmpty()) {\n\t\t\tint xx = qx.poll(), yy = qy.poll(), tt = qt.poll();\n\t\t\tif (tt == t) break;\n\t\t\tif (c[xx][yy] == tt + 1) continue;\n\t\t\tif (xx > 0 && a[xx - 1][yy] >= 0 && d[xx - 1][yy] == 0 && (c[xx - 1][yy] == 0 || c[xx - 1][yy] > tt + 1)) {\n\t\t\t\td[xx - 1][yy] = 1;\n\t\t\t\tqx.add(xx - 1); qy.add(yy); qt.add(tt + 1);\n\t\t\t}\n\t\t\tif (yy > 0 && a[xx][yy - 1] >= 0 && d[xx][yy - 1] == 0 && (c[xx][yy - 1] == 0 || c[xx][yy - 1] > tt + 1)) {\n\t\t\t\td[xx][yy - 1] = 1;\n\t\t\t\tqx.add(xx); qy.add(yy - 1); qt.add(tt + 1);\n\t\t\t}\n\t\t\tif (xx < n - 1 && a[xx + 1][yy] >= 0 && d[xx + 1][yy] == 0 && (c[xx + 1][yy] == 0 || c[xx + 1][yy] > tt + 1)) {\n\t\t\t\td[xx + 1][yy] = 1;\n\t\t\t\tqx.add(xx + 1); qy.add(yy); qt.add(tt + 1);\n\t\t\t}\n\t\t\tif (yy < n - 1 && a[xx][yy + 1] >= 0 && d[xx][yy + 1] == 0 && (c[xx][yy + 1] == 0 || c[xx][yy + 1] > tt + 1)) {\n\t\t\t\td[xx][yy + 1] = 1;\n\t\t\t\tqx.add(xx); qy.add(yy + 1); qt.add(tt + 1);\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif (d[i][j] == 1 && b[i][j] > 0) {\n\t\t\t\t\tfor (int k1 = 0; k1 < a[x][y]; k1++) {\n\t\t\t\t\t\tfor (int k2 = 0; k2 < b[i][j]; k2++) {\n\t\t\t\t\t\t\tmat[x * 100 + y * 10 + k1][i * 100 + j * 10 + k2] = \n\t\t\t\t\t\t\t\tmat[x * 100 + y * 10 + k1][i * 100 + j * 10 + k2] = true; \n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n\tint[] px = new int[1010];\n\t\n\tboolean dfs(int q) {\n\t\tw[q] = true;\n\t\tfor (int i = 0; i < 1000; i++) {\n\t\t\tif (mat[q][i]) {\n\t\t\t\tif (px[i] == -1 || !w[px[i]] && dfs(px[i])) {\n\t\t\t\t\tpx[i] = q;\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\t\n\tvoid solve() throws Exception {\n\t\tn = nextInt();\n\t\tt = nextInt();\n\t\tmat = new boolean[1010][1010];\n\t\tw = new boolean[1010];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tString s = nextToken();\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif (s.charAt(j) == 'Y') a[i][j] = -1; else\n\t\t\t\t\tif (s.charAt(j) == 'Z') a[i][j] = -2; else \n\t\t\t\t\t\ta[i][j] = s.charAt(j) - '0';\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tString s = nextToken();\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif (s.charAt(j) == 'Y') b[i][j] = 10; else\n\t\t\t\t\tif (s.charAt(j) == 'Z') b[i][j] = 11; else \n\t\t\t\t\t\tb[i][j] = s.charAt(j) - '0';\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif (a[i][j] == -2) bfsc(i, j); \n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif (a[i][j] > 0) bfs(i, j);\n\t\t\t}\n\t\t}\n\t\tint ans = 0;\n\t\tArrays.fill(px, -1);\n\t\tfor (int i = 0; i < 1000; i++) {\n\t\t\tArrays.fill(w, false);\n\t\t\tif (dfs(i)) ans++;\n\t\t}\n\t\tout.println(ans);\n\t}\n\t\n\tpublic void run() {\n\t\tLocale.setDefault(Locale.UK);\n\t\ttry {\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(System.out);\n//\t\t\tin = new BufferedReader(new FileReader(\"input.txt\"));\n//\t\t\tout = new PrintWriter(\"output.txt\");\n\t\t\tsolve();\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(1);\n\t\t} finally {\n\t\t\tout.flush();\n\t\t}\n\t}\n\n}", "lang_cluster": "Java", "tags": ["flows", "graphs", "shortest paths"], "code_uid": "2023404b7ebbf6d360f764fe2d917260", "src_uid": "544de9c3729a35eb08c143b1cb9ee085", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "//package codeforces.br70;\n\nimport javax.management.Query;\nimport java.io.*;\nimport java.math.*;\nimport java.util.*;\n\npublic class ProblemE {\n\n\n int[][] dir = new int[][] {{1,0},{0,1},{-1,0},{0,-1}};\n\n private class Point {\n public int x,y;\n public Point(int xx, int yy) {\n x = xx;\n y = yy;\n }\n\n public Point(Point p, int ind) {\n x = p.x + dir[ind][0];\n y = p.y + dir[ind][1];\n }\n\n public boolean valid() {\n return x >= 0 && x < n && y >= 0 && y < n;\n }\n }\n\n private int[] pair1;\n private int[] pair2;\n private boolean[] used;\n List<ArrayList<Integer>> g;\n private int n;\n\n public void solve() {\n boolean oj = true;\n\n try {\n Reader reader = oj ? new InputStreamReader(System.in) : new FileReader(\"E.in\");\n Writer writer = oj ? new OutputStreamWriter(System.out) : new FileWriter(\"E.out\");\n BufferedReader br = new BufferedReader(reader);\n StreamTokenizer st = new StreamTokenizer(reader);\n PrintWriter out = new PrintWriter(writer);\n\n MyTokenizer tok = new MyTokenizer(br.readLine());\n\n n = tok.getInteger();\n int t = tok.getInteger();\n\n Point z = null;\n\n char[][] sci = new char[n][n];\n char[][] caps = new char[n][n];\n\n List<Point> scis = new ArrayList<Point>();\n List<ArrayList<Integer>> v1 = new ArrayList<ArrayList<Integer>>();\n\n int cc = 0;\n for(int i=0;i<n;i++) {\n String s = br.readLine();\n for(int j=0;j<n;j++) {\n sci[i][j] = s.charAt(j);\n if (sci[i][j] == 'Z') {\n z = new Point(i, j);\n }\n if (sci[i][j] > '0' && sci[i][j] <= '9') {\n Point pp = new Point(i, j);\n scis.add(pp);\n\n ArrayList<Integer> list = new ArrayList<Integer>();\n v1.add(list);\n int num = sci[i][j] - '0';\n for(int k=0;k<num;k++) {\n list.add(cc);\n cc++;\n }\n }\n }\n }\n\n int numsci = cc;\n\n br.readLine();\n\n List<Point> allcaps = new ArrayList<Point>();\n List<ArrayList<Integer>> v2 = new ArrayList<ArrayList<Integer>>();\n int[][] p = new int[n][n];\n\n cc = 0;\n\n for(int i=0;i<n;i++) {\n String s = br.readLine();\n for(int j=0;j<n;j++) {\n caps[i][j] = s.charAt(j);\n p[i][j] = -1;\n if (caps[i][j] > '0' && caps[i][j] <= '9') {\n Point pp = new Point(i, j);\n allcaps.add(pp);\n p[i][j] = allcaps.size() - 1;\n\n ArrayList<Integer> list = new ArrayList<Integer>();\n v2.add(list);\n int num = caps[i][j] - '0';\n for(int k=0;k<num;k++) {\n list.add(cc);\n cc++;\n }\n }\n }\n }\n\n int numcaps = cc;\n\n int[][] zdist = new int[n][n];\n for(int i=0;i<n;i++)\n for(int j=0;j<n;j++)\n zdist[i][j] = -1;\n\n Queue<Point> q = new LinkedList<Point>();\n q.add(z);\n\n zdist[z.x][z.y] = 0;\n\n while (!q.isEmpty()) {\n Point cur = q.remove();\n for(int i=0;i<4;i++) {\n Point next = new Point(cur, i);\n if (next.valid() && zdist[next.x][next.y] == -1 && sci[next.x][next.y] != 'Y') {\n zdist[next.x][next.y] = zdist[cur.x][cur.y] + 1;\n q.add(next);\n }\n }\n }\n\n\n\n g = new ArrayList<ArrayList<Integer>>();\n for(int i=0;i<numsci;i++)\n g.add(new ArrayList<Integer>());\n\n for (int i1 = 0, scisSize = scis.size(); i1 < scisSize; i1++) {\n Point sc = scis.get(i1);\n\n int numsc = sci[sc.x][sc.y] - '0';\n\n int[][] scdist = new int[n][n];\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++)\n scdist[i][j] = -1;\n\n q.clear();\n scdist[sc.x][sc.y] = 0;\n q.add(sc);\n\n if (p[sc.x][sc.y] >= 0) {\n int capnum = p[sc.x][sc.y];\n for(int i=0;i<v1.get(i1).size();i++) {\n for(int j=0;j<v2.get(capnum).size();j++) {\n int scn = v1.get(i1).get(i);\n int cpn = v2.get(capnum).get(j);\n g.get(scn).add(cpn);\n }\n }\n }\n\n while (!q.isEmpty()) {\n Point cur = q.remove();\n for (int k = 0; k < 4; k++) {\n Point next = new Point(cur, k);\n int num = scdist[cur.x][cur.y] + 1;\n if (next.valid() && scdist[next.x][next.y] == -1 && sci[next.x][next.y] != 'Y' && sci[next.x][next.y] != 'Z' && (num <= zdist[next.x][next.y] || zdist[next.x][next.y] == -1) && num <= t) {\n if (zdist[next.x][next.y] != num) {\n scdist[next.x][next.y] = num;\n q.add(next);\n }\n if (p[next.x][next.y] >= 0) {\n int capnum = p[next.x][next.y];\n for(int i=0;i<v1.get(i1).size();i++) {\n for(int j=0;j<v2.get(capnum).size();j++) {\n int scn = v1.get(i1).get(i);\n int cpn = v2.get(capnum).get(j);\n g.get(scn).add(cpn);\n }\n }\n }\n }\n }\n }\n }\n\n pair1 = new int[numsci];\n pair2 = new int[numcaps];\n for(int i=0;i<numsci;i++) {\n pair1[i] = -1;\n }\n for(int i=0;i<numcaps;i++) {\n pair2[i] = -1;\n }\n for(int i=0;i<numsci;i++) {\n used = new boolean[numsci];\n find(i);\n }\n\n int count = 0;\n for(int i=0;i<numsci;i++) {\n if (pair1[i] != -1)\n count++;\n }\n out.printf(\"%d\", count);\n\n br.close();\n out.close();\n reader.close();\n writer.close();\n }\n catch (Exception ex) {\n ex.printStackTrace();\n }\n finally {\n }\n }\n\n private boolean find(int v) {\n used[v] = true;\n boolean result = false;\n ArrayList<Integer> list = g.get(v);\n for(int i : list) {\n if (pair2[i] == -1 || (!used[pair2[i]] && find(pair2[i]))) {\n result = true;\n pair1[v] = i;\n pair2[i] = v;\n break;\n }\n }\n return result;\n }\n\n public static void main(String[] args) {\n ProblemE f = new ProblemE();\n f.solve();\n }\n\n private class MyTokenizer {\n private String s;\n private int cur;\n\n public MyTokenizer(String s) {\n this.s = s;\n cur = 0;\n }\n\n public void skip() {\n while (cur < s.length() && (s.charAt(cur) == ' ' || s.charAt(cur) == '\\t' || s.charAt(cur) == '\\n')) {\n cur++;\n }\n }\n\n public double getDouble() {\n skip();\n String snum = \"\";\n while (cur < s.length() && (s.charAt(cur) >= '0' && s.charAt(cur) <= '9' || s.charAt(cur) == '.' || s.charAt(cur) == '-')) {\n snum += s.charAt(cur);\n cur++;\n }\n if (snum.startsWith(\".\"))\n snum = \"0\" + snum;\n return Double.valueOf(snum);\n }\n\n public int getInteger() {\n skip();\n String snum = \"\";\n while (cur < s.length() && (s.charAt(cur) >= '0' && s.charAt(cur) <= '9' || s.charAt(cur) == '.' || s.charAt(cur) == '-')) {\n snum += s.charAt(cur);\n cur++;\n }\n return Integer.valueOf(snum);\n }\n\n public String getString() {\n skip();\n String s2 = \"\";\n while (cur < s.length() && (((s.charAt(cur) >= 'a' && s.charAt(cur) <= 'z')) ||\n ((s.charAt(cur) >= 'A' && s.charAt(cur) <= 'Z')) ||\n ((s.charAt(cur) >= '0' && s.charAt(cur) <= '9')) ||\n s.charAt(cur) == '_'\n )) {\n s2 += s.charAt(cur);\n cur++;\n }\n return s2;\n }\n\n public char getCurrentChar() throws Exception {\n if (cur < s.length())\n return s.charAt(cur);\n else\n throw new Exception(\"Current character out of string length\");\n }\n\n public void moveNextChar() {\n if (cur < s.length())\n cur++;\n }\n\n public boolean isFinished() {\n return cur >= s.length();\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["flows", "graphs", "shortest paths"], "code_uid": "406475efdfabe4a4d4c066555eb19143", "src_uid": "544de9c3729a35eb08c143b1cb9ee085", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\n\npublic class E implements Runnable {\n\n\tvoid solve() {\n\t\tint n = nextInt();\n\t\tint t = nextInt();\n\t\tchar[][] c = new char[n][];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tc[i] = nextToken().toCharArray();\n\t\t}\n\t\tint[][] infectTime = new int[n][n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tArrays.fill(infectTime[i], Integer.MAX_VALUE);\n\t\t}\n\t\tQueue<State> q = new ArrayDeque<State>();\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif (c[i][j] == 'Z') {\n\t\t\t\t\tq.add(new State(i, j));\n\t\t\t\t\tinfectTime[i][j] = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\twhile (!q.isEmpty()) {\n\t\t\tState state = q.poll();\n\t\t\tfor (int dir = 0; dir < 4; dir++) {\n\t\t\t\tint x = state.x + DX[dir];\n\t\t\t\tint y = state.y + DY[dir];\n\t\t\t\tif (x < 0 || y < 0 || x >= n || y >= n || c[x][y] == 'Y'\n\t\t\t\t\t\t|| infectTime[x][y] != Integer.MAX_VALUE) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tinfectTime[x][y] = infectTime[state.x][state.y] + 1;\n\t\t\t\tq.add(new State(x, y));\n\t\t\t}\n\t\t}\n\t\tint[][][][] dist = new int[n][n][][];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\t// System.err.println(Arrays.toString(infectTime[i]));\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tdist[i][j] = findDists(n, c, i, j, infectTime);\n\t\t\t}\n\t\t}\n\t\tGraph g = new Graph(1 + n * n + n * n + 1);\n\t\tint sink = 1 + 2 * n * n;\n\t\tint shiftCapsule = 1 + n * n;\n\t\tint shiftMen = 1;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif (c[i][j] != '0' && c[i][j] != 'Y' && c[i][j] != 'Z') {\n\t\t\t\t\tg.addEdge(0, i * n + j + shiftMen, 0, c[i][j] - '0');\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tchar[][] capsule = new char[n][];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcapsule[i] = nextToken().toCharArray();\n\t\t}\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif (capsule[i][j] != '0' && capsule[i][j] != 'Y'\n\t\t\t\t\t\t&& capsule[i][j] != 'Z') {\n\t\t\t\t\tg.addEdge(i * n + j + shiftCapsule, sink, 0,\n\t\t\t\t\t\t\tcapsule[i][j] - '0');\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tfor (int k = 0; k < n; k++) {\n\t\t\t\t\tfor (int k2 = 0; k2 < n; k2++) {\n\t\t\t\t\t\tif (dist[i][j][k][k2] <= t) {\n\t\t\t\t\t\t\tg.addEdge(i * n + j + shiftMen, k * n + k2\n\t\t\t\t\t\t\t\t\t+ shiftCapsule, 0, 1 << 20);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t// System.err.println(Arrays.toString(dist[i][j][k]));\n\t\t\t\t}\n\t\t\t\t// System.err.println();\n\t\t\t}\n\t\t}\n\t\tout.println(g.getMaxFlow(0, sink));\n\t}\n\n\tstatic int[][] findDists(int n, char[][] c, int startX, int startY,\n\t\t\tint[][] infectTime) {\n\t\tif (c[startX][startY] == 'Y' || c[startX][startY] == 'Z') {\n\t\t\treturn new int[n][n];\n\t\t}\n\t\tQueue<State> q = new ArrayDeque<State>();\n\t\tint[][] d = new int[n][n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tArrays.fill(d[i], Integer.MAX_VALUE);\n\t\t}\n\t\tq.add(new State(startX, startY));\n\t\td[startX][startY] = 0;\n\t\twhile (!q.isEmpty()) {\n\t\t\tState state = q.poll();\n\t\t\tfor (int dir = 0; dir < 4; dir++) {\n\t\t\t\tint x = state.x + DX[dir];\n\t\t\t\tint y = state.y + DY[dir];\n\t\t\t\tint newD = d[state.x][state.y] + 1;\n\t\t\t\tif (x < 0 || y < 0 || x >= n || y >= n || c[x][y] == 'Y'\n\t\t\t\t\t\t|| c[x][y] == 'Z' || d[x][y] != Integer.MAX_VALUE\n\t\t\t\t\t\t|| newD >= infectTime[x][y]) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\td[x][y] = newD;\n\t\t\t\tq.add(new State(x, y));\n\t\t\t}\n\t\t}\n\t\tint[][] e = new int[n][];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\te[i] = d[i].clone();\n\t\t}\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif (d[i][j] == Integer.MAX_VALUE) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tfor (int dir = 0; dir < 4; dir++) {\n\t\t\t\t\tint x = i + DX[dir];\n\t\t\t\t\tint y = j + DY[dir];\n\t\t\t\t\tif (x < 0 || y < 0 || x >= n || y >= n || c[x][y] == 'Y'\n\t\t\t\t\t\t\t|| c[x][y] == 'Z') {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tif (d[i][j] + 1 == infectTime[x][y]\n\t\t\t\t\t\t\t&& d[i][j] + 1 < e[x][y]) {\n\t\t\t\t\t\te[x][y] = d[i][j] + 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn e;\n\t}\n\n\tstatic int[] DX = { 1, 0, -1, 0 };\n\tstatic int[] DY = { 0, 1, 0, -1 };\n\n\tstatic class State {\n\t\tint x;\n\t\tint y;\n\n\t\tpublic State(int x, int y) {\n\t\t\tsuper();\n\t\t\tthis.x = x;\n\t\t\tthis.y = y;\n\t\t}\n\n\t}\n\n\tstatic class Edge {\n\t\tint from;\n\t\tint to;\n\t\tint flow;\n\t\tint cap;\n\t\tEdge rev;\n\n\t\tpublic Edge(int from, int to, int flow, int cap) {\n\t\t\tsuper();\n\t\t\tthis.from = from;\n\t\t\tthis.to = to;\n\t\t\tthis.flow = flow;\n\t\t\tthis.cap = cap;\n\t\t}\n\n\t}\n\n\tstatic class Graph {\n\t\tArrayList<Edge>[] edges;\n\t\tint[] cur;\n\t\tint[] q;\n\t\tint[] d;\n\t\tint n;\n\n\t\tpublic Graph(int n) {\n\t\t\tedges = new ArrayList[n];\n\t\t\tthis.n = n;\n\t\t\tfor (int i = 0; i < edges.length; i++) {\n\t\t\t\tedges[i] = new ArrayList<Edge>();\n\t\t\t}\n\t\t}\n\n\t\tvoid addEdge(int from, int to, int flow, int cap) {\n\t\t\tEdge e1 = new Edge(from, to, flow, cap);\n\t\t\tEdge e2 = new Edge(to, from, -flow, 0);\n\t\t\te1.rev = e2;\n\t\t\te2.rev = e1;\n\t\t\tedges[from].add(e1);\n\t\t\tedges[to].add(e2);\n\t\t}\n\n\t\tboolean bfs(int source, int target) {\n\t\t\tint head = 0;\n\t\t\tint tail = 1;\n\t\t\tArrays.fill(d, Integer.MAX_VALUE);\n\t\t\td[source] = 0;\n\t\t\tq[0] = source;\n\t\t\twhile (head < tail) {\n\t\t\t\tint x = q[head++];\n\t\t\t\tfor (Edge e : edges[x]) {\n\t\t\t\t\tif (e.cap - e.flow > 0 && d[e.to] == Integer.MAX_VALUE) {\n\t\t\t\t\t\td[e.to] = d[x] + 1;\n\t\t\t\t\t\tq[tail++] = e.to;\n\t\t\t\t\t\tif (e.to == target) {\n\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\n\t\tint dfs(int x, int target, int cMin) {\n\t\t\tif (x == target) {\n\t\t\t\treturn cMin;\n\t\t\t}\n\t\t\tfor (int i = cur[x]; i < edges[x].size(); cur[x] = ++i) {\n\t\t\t\tEdge e = edges[x].get(i);\n\t\t\t\tif (d[e.to] != d[x] + 1 || e.cap - e.flow == 0) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tint add = dfs(e.to, target, Math.min(cMin, e.cap - e.flow));\n\t\t\t\tif (add == 0) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\te.flow += add;\n\t\t\t\te.rev.flow -= add;\n\t\t\t\treturn add;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\n\t\tlong getMaxFlow(int source, int target) {\n\t\t\tcur = new int[n];\n\t\t\tq = new int[n];\n\t\t\td = new int[n];\n\t\t\tlong flow = 0;\n\t\t\twhile (bfs(source, target)) {\n\t\t\t\tArrays.fill(cur, 0);\n\t\t\t\twhile (true) {\n\t\t\t\t\tint add = dfs(source, target, Integer.MAX_VALUE);\n\t\t\t\t\tif (add == 0) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tflow += add;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn flow;\n\t\t}\n\t}\n\n\tFastScanner sc;\n\tPrintWriter out;\n\n\tpublic void run() {\n\t\tLocale.setDefault(Locale.US);\n\t\ttry {\n\t\t\tsc = new FastScanner(System.in);\n\t\t\tout = new PrintWriter(System.out);\n\t\t\tsolve();\n\t\t\tsc.close();\n\t\t\tout.close();\n\t\t} catch (Throwable e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(1);\n\t\t}\n\t}\n\n\tint nextInt() {\n\t\treturn sc.nextInt();\n\t}\n\n\tString nextToken() {\n\t\treturn sc.nextToken();\n\t}\n\n\tlong nextLong() {\n\t\treturn sc.nextLong();\n\t}\n\n\tdouble nextDouble() {\n\t\treturn sc.nextDouble();\n\t}\n\n\tBigInteger nextBigInteger() {\n\t\treturn sc.nextBigInteger();\n\t}\n\n\tclass FastScanner extends BufferedReader {\n\t\tStringTokenizer st;\n\t\tboolean eof;\n\t\tString buf;\n\t\tString curLine;\n\t\tboolean createST;\n\n\t\tpublic FastScanner(String fileName) throws FileNotFoundException {\n\t\t\tthis(fileName, true);\n\t\t}\n\n\t\tpublic FastScanner(String fileName, boolean createST)\n\t\t\t\tthrows FileNotFoundException {\n\t\t\tsuper(new FileReader(fileName));\n\t\t\tthis.createST = createST;\n\t\t\tnextToken();\n\t\t}\n\n\t\tpublic FastScanner(InputStream stream) {\n\t\t\tthis(stream, true);\n\t\t}\n\n\t\tpublic FastScanner(InputStream stream, boolean createST) {\n\t\t\tsuper(new InputStreamReader(stream));\n\t\t\tthis.createST = createST;\n\t\t\tnextToken();\n\t\t}\n\n\t\tString nextLine() {\n\t\t\tString ret = curLine;\n\t\t\tif (createST) {\n\t\t\t\tst = null;\n\t\t\t}\n\t\t\tnextToken();\n\t\t\treturn ret;\n\t\t}\n\n\t\tString nextToken() {\n\t\t\tif (!createST) {\n\t\t\t\ttry {\n\t\t\t\t\tcurLine = readLine();\n\t\t\t\t} catch (Exception e) {\n\t\t\t\t\teof = true;\n\t\t\t\t}\n\t\t\t\treturn null;\n\t\t\t}\n\t\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\tcurLine = readLine();\n\t\t\t\t\tst = new StringTokenizer(curLine);\n\t\t\t\t} catch (Exception e) {\n\t\t\t\t\teof = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tString ret = buf;\n\t\t\tbuf = eof ? \"-1\" : st.nextToken();\n\t\t\treturn ret;\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(nextToken());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(nextToken());\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(nextToken());\n\t\t}\n\n\t\tBigInteger nextBigInteger() {\n\t\t\treturn new BigInteger(nextToken());\n\t\t}\n\n\t\tpublic void close() {\n\t\t\ttry {\n\t\t\t\tbuf = null;\n\t\t\t\tst = null;\n\t\t\t\tcurLine = null;\n\t\t\t\tsuper.close();\n\t\t\t} catch (Exception e) {\n\n\t\t\t}\n\t\t}\n\n\t\tboolean isEOF() {\n\t\t\treturn eof;\n\t\t}\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew E().run();\n\t}\n}", "lang_cluster": "Java", "tags": ["flows", "graphs", "shortest paths"], "code_uid": "6214f7c71fde35f07b64f053429363ef", "src_uid": "544de9c3729a35eb08c143b1cb9ee085", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "\nimport java.util.*;\n\n\npublic class E\n{\n public static void main(String[] args)\n {\n new E(new Scanner(System.in));\n }\n\n public E(Scanner in)\n {\n int N = in.nextInt();\n int T = in.nextInt();\n \n int[][] cnt = new int[N][N];\n int[][] grid = new int[N][N];\n\n // This is the gas start point\n vect start = null;\n // These are the scientists\n ArrayList<vect> vs = new ArrayList<vect>();\n for (int j=0; j<N; j++)\n {\n String s = in.next();\n for (int i=0; i<N; i++)\n {\n char c = s.charAt(i);\n if (Character.isDigit(c))\n {\n grid[i][j] = T;\n int v = (int)(c-'0');\n while (v-->0)\n vs.add(new vect(i,j));\n }\n else if (c == 'Y')\n grid[i][j] = 0;\n else if (c == 'Z')\n {\n grid[i][j] = 0;\n start = new vect(i,j);\n }\n }\n }\n\n for (int j=0; j<N; j++)\n {\n String s = in.next();\n for (int i=0; i<N; i++)\n {\n char c = s.charAt(i);\n if (Character.isDigit(c))\n {\n int v = (int)(c-'0');\n cnt[i][j] = v;\n }\n }\n }\n\n // Flood fill bfs the grid from the start point\n ArrayDeque<Node> q = new ArrayDeque<Node>();\n q.add(new Node(start, 0));\n while (q.size() > 0)\n {\n Node cur = q.poll();\n vect v = cur.v;\n grid[v.x][v.y] = cur.d;\n \n int nd = cur.d+1;\n vect dv = new vect(1,0);\n for (int i=0; i<4; i++)\n {\n dv = dv.orthoCW();\n vect nv = v.add(dv);\n if (nv.x < 0)\n continue;\n if (nv.y < 0)\n continue;\n if (nv.x >= N)\n continue;\n if (nv.y >= N)\n continue;\n if (grid[nv.x][nv.y] <= nd)\n continue;\n q.add(new Node(nv, nd));\n }\n }\n\n /*for (int j=0; j<N; j++)\n {\n StringBuilder sb = new StringBuilder();\n for (int i=0; i<N; i++)\n sb.append(grid[i][j]+\" \");\n System.out.println(sb);\n }*/\n\n // Create a maxflow graph for all reachable reactors\n MaxFlow solver = new MaxFlow(2+vs.size()+N*N, 0, 1);\n for (int i=0; i<vs.size(); i++)\n solver.add(0, 2+i, 1);\n for (int j=0; j<N; j++)\n for (int i=0; i<N; i++)\n solver.add(2+vs.size()+j*N+i, 1, cnt[i][j]);\n\n // BFS for all reachable reactors\n boolean[][] seen = new boolean[N][N];\n int u = 0;\n for (vect st : vs)\n {\n for (boolean[] see : seen)\n Arrays.fill(see, false);\n\n q.add(new Node(st, 0));\n while (q.size() > 0)\n {\n Node cur = q.poll();\n vect v = cur.v;\n if (seen[v.x][v.y])\n continue;\n if (cur.d > grid[v.x][v.y])\n continue;\n seen[v.x][v.y] = true;\n if (cur.d == grid[v.x][v.y])\n continue;\n\n int nd = cur.d+1;\n vect dv = new vect(1,0);\n for (int i=0; i<4; i++)\n {\n dv = dv.orthoCW();\n vect nv = v.add(dv);\n if (nv.x < 0)\n continue;\n if (nv.y < 0)\n continue;\n if (nv.x >= N)\n continue;\n if (nv.y >= N)\n continue;\n if (nd > grid[v.x][v.y])\n continue;\n if (seen[nv.x][nv.y])\n continue;\n q.add(new Node(nv, nd));\n }\n }\n\n for (int j=0; j<N; j++)\n for (int i=0; i<N; i++)\n if (seen[i][j])\n solver.add(2+u, 2+vs.size()+j*N+i, 1);\n u++;\n }\n \n \n int res = solver.maxFlow();\n System.out.printf(\"%d%n\", res);\n }\n}\n\n\nclass vect\n{\n int x, y;\n public vect(int i, int j)\n {\n x=i; y=j;\n }\n\n vect add(vect rhs)\n {\n return new vect(x+rhs.x, y+rhs.y);\n }\n\n vect orthoCW()\n {\n return new vect(-y, x);\n }\n}\n\n\nclass Node\n{\n vect v;\n int d;\n\n public Node(vect vv, int dd)\n {\n v=vv; d=dd;\n }\n}\n\n\nclass MaxFlow\n{\n int N, src, snk;\n ArrayList<Edge>[] adj;\n boolean[] seen;\n public MaxFlow(int N)\n {\n this.N = N;\n seen = new boolean[N];\n adj = new ArrayList[N];\n for (int i=0; i<N; i++)\n adj[i] = new ArrayList<Edge>();\n }\n\n public MaxFlow(int N, int src, int snk)\n {\n this(N);\n this.src = src;\n this.snk = snk;\n }\n\n void add(int u, int v, int c)\n {\n Edge e = new Edge(u, v, c);\n Edge r = new Edge(v, u, 0, c);\n r.back = true;\n e.rev = r; r.rev = e;\n adj[u].add(e);\n adj[v].add(r);\n }\n\n int maxFlow()\n {\n int ret = 0;\n while (true)\n {\n Arrays.fill(seen, false);\n int f = dfs(src, Integer.MAX_VALUE);\n if (f == 0) break;\n ret += f;\n }\n return ret;\n }\n\n int dfs(int cur, int aug)\n {\n if (cur == snk) return aug;\n if (seen[cur]) return 0;\n seen[cur] = true;\n\n for (Edge e : adj[cur])\n if (e.resid > 0 && !seen[e.v])\n {\n int a = dfs(e.v, Math.min(aug, e.resid));\n if (a > 0)\n {\n e.resid -= a;\n e.rev.resid += a;\n return a;\n }\n }\n return 0;\n }\n\n class Edge\n {\n int u, v, resid, cap;\n Edge rev;\n boolean back;\n public Edge(int uu, int vv, int cc)\n {\n u=uu; v=vv; cap = resid = cc;\n }\n public Edge(int uu, int vv, int rr, int cc)\n {\n this(uu, vv, cc); resid = rr;\n }\n int flow() { return cap-resid;}\n }\n}\n", "lang_cluster": "Java", "tags": ["flows", "graphs", "shortest paths"], "code_uid": "f2f7a742c8695e77ccfaf6b2c3a9d964", "src_uid": "544de9c3729a35eb08c143b1cb9ee085", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Collections;\nimport java.util.InputMismatchException;\nimport java.math.BigInteger;\nimport java.util.Stack;\nimport java.util.*;\nimport java.util.Set;\nimport java.util.Collection;\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.Comparator;\nimport java.io.*;\nimport java.util.Iterator;\nimport java.util.HashSet;\nimport java.util.concurrent.atomic.AtomicBoolean;\nimport java.util.Arrays;\n\n/**\n * Generated by Contest helper plug-in\n * Actual solution is at the bottom\n */\npublic class Main {\n public static void main(String[] args) {\n InputReader in = new StreamInputReader(System.in);\n PrintWriter out = new PrintWriter(System.out);\n run(in, out);\n }\n\n public static void run(InputReader in, PrintWriter out) {\n Solver solver = new TaskE();\n solver.solve(1, in, out);\n Exit.exit(in, out);\n }\n}\n\nabstract class InputReader {\n private boolean finished = false;\n\n public abstract int read();\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public String readString() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuffer res = new StringBuffer();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n private boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public char readCharacter() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n return (char) c;\n }\n\n public void setFinished(boolean finished) {\n this.finished = finished;\n }\n\n public abstract void close();\n}\n\nclass StreamInputReader extends InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar, numChars;\n\n public StreamInputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n @Override\n public void close() {\n try {\n stream.close();\n } catch (IOException ignored) {\n }\n }\n}\n\nclass Exit {\n private Exit() {\n }\n\n public static void exit(InputReader in, PrintWriter out) {\n in.setFinished(true);\n in.close();\n out.close();\n }\n}\n\ninterface Solver {\n public void solve(int testNumber, InputReader in, PrintWriter out);\n}\n\nclass Pair<U, V> {\n\n public final U first;\n public final V second;\n\n public static<U, V> Pair<U, V> makePair(U first, V second) {\n return new Pair<U, V>(first, second);\n }\n\n private Pair(U first, V second) {\n this.first = first;\n this.second = second;\n }\n\n @Override\n public boolean equals(Object o) {\n if (this == o) return true;\n if (o == null || getClass() != o.getClass()) return false;\n\n Pair pair = (Pair) o;\n\n return !(first != null ? !first.equals(pair.first) : pair.first != null) && !(second != null ? !second.equals(pair.second) : pair.second != null);\n\n }\n\n @Override\n public int hashCode() {\n int result = first != null ? first.hashCode() : 0;\n result = 31 * result + (second != null ? second.hashCode() : 0);\n return result;\n }\n\n @Override\n public String toString() {\n return \"(\" + first + \",\" + second + \")\";\n }\n}\n\ninterface Edge {\n public int getSource();\n public int getDestination();\n public long getCapacity();\n public void pushFlow(long flow);\n public Edge getReverseEdge();\n}\n\nclass Graph {\n private final int size;\n private final List<Edge>[] edges;\n\n public Graph(int size) {\n this.size = size;\n //noinspection unchecked\n edges = new List[size];\n for (int i = 0; i < size; i++)\n edges[i] = new ArrayList<Edge>();\n }\n\n public int getSize() {\n return size;\n }\n\n public List<Edge> getIncident(int vertex) {\n return edges[vertex];\n }\n\n public void add(Edge edge) {\n edges[edge.getSource()].add(edge);\n edge = edge.getReverseEdge();\n if (edge != null)\n edges[edge.getSource()].add(edge);\n }\n\n }\n\nclass GraphAlgorithms {\n public static long dinic(Graph graph, int source, int destination) {\n long totalFlow = 0;\n int vertexCount = graph.getSize();\n int[] nextEdge = new int[vertexCount];\n while (true) {\n long[] distance = edgeDistances(graph, source).getDistances();\n if (distance[destination] == Long.MAX_VALUE)\n break;\n Arrays.fill(nextEdge, 0);\n totalFlow += dinicImpl(graph, source, destination, Long.MAX_VALUE, distance, nextEdge);\n }\n return totalFlow;\n }\n\n private static DistanceResult edgeDistances(Graph graph, int source) {\n int size = graph.getSize();\n Deque<Integer> queue = new ArrayDeque<Integer>(size);\n boolean[] processed = new boolean[size];\n boolean[] notReached = new boolean[size];\n Arrays.fill(notReached, true);\n long[] distance = new long[size];\n int[] last = new int[size];\n Arrays.fill(distance, Long.MAX_VALUE);\n distance[source] = 0;\n last[source] = -1;\n queue.add(source);\n notReached[source] = false;\n int iterationCount = 0;\n while (!queue.isEmpty()) {\n iterationCount++;\n if (iterationCount / size / size / size != 0)\n return null;\n int current = queue.poll();\n processed[current] = true;\n for (Edge edge : graph.getIncident(current)) {\n if (edge.getCapacity() == 0)\n continue;\n int next = edge.getDestination();\n long weight = 1;\n if (distance[next] > distance[current] + weight) {\n distance[next] = distance[current] + weight;\n last[next] = current;\n if (notReached[next]) {\n notReached[next] = false;\n queue.add(next);\n } else if (processed[next]) {\n processed[next] = false;\n queue.addFirst(next);\n }\n }\n }\n }\n return new DistanceResult(distance, last);\n }\n\n private static long dinicImpl(Graph graph, int source, int destination, long flow, long[] distance, int[] nextEdge) {\n if (source == destination)\n return flow;\n if (flow == 0 || distance[source] == distance[destination])\n return 0;\n List<Edge> incident = graph.getIncident(source);\n int incidentSize = incident.size();\n int totalPushed = 0;\n for (int i = nextEdge[source]; i < incidentSize; i++) {\n Edge edge = incident.get(i);\n int nextDestination = edge.getDestination();\n if (distance[nextDestination] != distance[source] + 1)\n continue;\n long pushed = dinicImpl(graph, nextDestination, destination, Math.min(flow, edge.getCapacity()),\n distance, nextEdge);\n if (pushed != 0) {\n edge.pushFlow(pushed);\n flow -= pushed;\n totalPushed += pushed;\n if (flow == 0) {\n nextEdge[source] = i;\n return totalPushed;\n }\n }\n }\n nextEdge[source] = incidentSize;\n return totalPushed;\n }\n\n\n public static class DistanceResult {\n private final long[] distances;\n private final int[] last;\n\n public DistanceResult(long[] distances, int[] last) {\n this.distances = distances;\n this.last = last;\n }\n\n public long[] getDistances() {\n return distances;\n }\n\n }\n\n }\n\nclass SimpleEdge implements Edge {\n protected final int source;\n protected final int destination;\n\n public SimpleEdge(int source, int destination) {\n this.source = source;\n this.destination = destination;\n }\n\n public int getSource() {\n return source;\n }\n\n public int getDestination() {\n return destination;\n }\n\n public long getCapacity() {\n return 0;\n }\n\n public void pushFlow(long flow) {\n throw new UnsupportedOperationException();\n }\n\n public Edge getReverseEdge() {\n return null;\n }\n\n }\n\nclass FlowEdge extends SimpleEdge {\n private long capacity;\n private long flow = 0;\n private Edge reverseEdge;\n\n public FlowEdge(int source, int destination, long capacity) {\n super(source, destination);\n this.capacity = capacity;\n reverseEdge = new ReverseEdge();\n }\n\n @Override\n public long getCapacity() {\n return capacity;\n }\n\n @Override\n public void pushFlow(long flow) {\n if (flow > 0) {\n if (this.capacity < flow)\n throw new IllegalArgumentException();\n } else {\n if (this.flow < -flow)\n throw new IllegalArgumentException();\n }\n capacity -= flow;\n this.flow += flow;\n }\n\n @Override\n public Edge getReverseEdge() {\n return reverseEdge;\n }\n\n private class ReverseEdge implements Edge {\n public int getSource() {\n return destination;\n }\n\n public int getDestination() {\n return source;\n }\n\n public long getCapacity() {\n return flow;\n }\n\n public void pushFlow(long flow) {\n FlowEdge.this.pushFlow(-flow);\n }\n\n public Edge getReverseEdge() {\n return FlowEdge.this;\n }\n }\n}\n\nclass IOUtils {\n\n public static char[] readCharArray(InputReader in, int size) {\n char[] array = new char[size];\n for (int i = 0; i < size; i++)\n array[i] = in.readCharacter();\n return array;\n }\n\n public static char[][] readTable(InputReader in, int rowCount, int columnCount) {\n char[][] table = new char[rowCount][];\n for (int i = 0; i < rowCount; i++)\n table[i] = readCharArray(in, columnCount);\n return table;\n }\n\n }\n\nclass MiscUtils {\n public static final int[] DX_4_CONNECTED = {1, 0, -1, 0};\n public static final int[] DY_4_CONNECTED = {0, -1, 0, 1};\n\n }\n\nclass TaskE implements Solver {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int size = in.readInt();\n int time = in.readInt();\n char[][] scientists = IOUtils.readTable(in, size, size);\n char[][] rescue = IOUtils.readTable(in, size, size);\n Graph graph = new Graph(2 * size * size + 2);\n for (int i = 0; i < size; i++) {\n for (int j = 0; j < size; j++) {\n if (Character.isDigit(scientists[i][j]))\n graph.add(new FlowEdge(2 * size * size, i * size + j, scientists[i][j] - '0'));\n if (Character.isDigit(rescue[i][j]))\n graph.add(new FlowEdge(size * size + i * size + j, 2 * size * size + 1, rescue[i][j] - '0'));\n }\n }\n int badRow = -1;\n int badColumn = -1;\n for (int i = 0; i < size; i++) {\n for (int j = 0; j < size; j++) {\n if (rescue[i][j] == 'Z') {\n badRow = i;\n badColumn = j;\n }\n }\n }\n for (int i = 0; i < size; i++) {\n for (int j = 0; j < size; j++) {\n if (Character.isDigit(scientists[i][j]) && scientists[i][j] != '0') {\n if (rescue[i][j] != '0')\n graph.add(new FlowEdge(i * size + j, size * size + i * size + j, Integer.MAX_VALUE));\n Set<Pair<Integer, Integer>> canBe = new HashSet<Pair<Integer, Integer>>();\n canBe.add(Pair.makePair(i, j));\n Set<Pair<Integer, Integer>> caNtBe = new HashSet<Pair<Integer, Integer>>();\n caNtBe.add(Pair.makePair(badRow, badColumn));\n for (int k = 0; k < time; k++) {\n Set<Pair<Integer, Integer>> nextCanBe = new HashSet<Pair<Integer, Integer>>();\n for (Pair<Integer, Integer> cell : canBe) {\n for (int l = 0; l < 4; l++) {\n int newRow = cell.first + MiscUtils.DX_4_CONNECTED[l];\n int newColumn = cell.second + MiscUtils.DY_4_CONNECTED[l];\n if (newRow >= 0 && newColumn >= 0 && newRow < size && newColumn < size && Character.isDigit(scientists[newRow][newColumn])) {\n Pair<Integer, Integer> next = Pair.makePair(newRow, newColumn);\n if (!caNtBe.contains(next)) {\n if (rescue[newRow][newColumn] != '0')\n graph.add(new FlowEdge(i * size + j, size * size + newRow * size + newColumn, Integer.MAX_VALUE));\n nextCanBe.add(next);\n }\n }\n }\n }\n Set<Pair<Integer, Integer>> nextCaNtBe = new HashSet<Pair<Integer, Integer>>();\n for (Pair<Integer, Integer> cell : caNtBe) {\n nextCaNtBe.add(cell);\n for (int l = 0; l < 4; l++) {\n int newRow = cell.first + MiscUtils.DX_4_CONNECTED[l];\n int newColumn = cell.second + MiscUtils.DY_4_CONNECTED[l];\n if (newRow >= 0 && newColumn >= 0 && newRow < size && newColumn < size && Character.isDigit(scientists[newRow][newColumn])) {\n Pair<Integer, Integer> next = Pair.makePair(newRow, newColumn);\n nextCaNtBe.add(next);\n }\n }\n }\n canBe = nextCanBe;\n caNtBe = nextCaNtBe;\n canBe.removeAll(caNtBe);\n }\n }\n }\n }\n out.println(GraphAlgorithms.dinic(graph, 2 * size * size, 2 * size * size + 1));\n }\n}", "lang_cluster": "Java", "tags": ["flows", "graphs", "shortest paths"], "code_uid": "917d8c0211fe9dd8e08bf796d1666a1f", "src_uid": "544de9c3729a35eb08c143b1cb9ee085", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Collections;\nimport java.util.InputMismatchException;\nimport java.math.BigInteger;\nimport java.util.Stack;\nimport java.util.*;\nimport java.util.Set;\nimport java.util.Collection;\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.Comparator;\nimport java.io.*;\nimport java.util.Iterator;\nimport java.util.HashSet;\nimport java.util.concurrent.atomic.AtomicBoolean;\nimport java.util.Arrays;\n\n/**\n * Generated by Contest helper plug-in\n * Actual solution is at the bottom\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputReader in = new StreamInputReader(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\trun(in, out);\n\t}\n\n\tpublic static void run(InputReader in, PrintWriter out) {\n\t\tSolver solver = new TaskE();\n\t\tsolver.solve(1, in, out);\n\t\tExit.exit(in, out);\n\t}\n}\n\nabstract class InputReader {\n\tprivate boolean finished = false;\n\n\tpublic abstract int read();\n\n\tpublic int readInt() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tint res = 0;\n\t\tdo {\n\t\t\tif (c < '0' || c > '9')\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n\n\tpublic String readString() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tStringBuffer res = new StringBuffer();\n\t\tdo {\n\t\t\tres.appendCodePoint(c);\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res.toString();\n\t}\n\n\tprivate boolean isSpaceChar(int c) {\n\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t}\n\n\tpublic char readCharacter() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\treturn (char) c;\n\t}\n\n\tpublic void setFinished(boolean finished) {\n\t\tthis.finished = finished;\n\t}\n\n\tpublic abstract void close();\n}\n\nclass StreamInputReader extends InputReader {\n\tprivate InputStream stream;\n\tprivate byte[] buf = new byte[1024];\n\tprivate int curChar, numChars;\n\n\tpublic StreamInputReader(InputStream stream) {\n\t\tthis.stream = stream;\n\t}\n\n\tpublic int read() {\n\t\tif (numChars == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (curChar >= numChars) {\n\t\t\tcurChar = 0;\n\t\t\ttry {\n\t\t\t\tnumChars = stream.read(buf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (numChars <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buf[curChar++];\n\t}\n\n\t@Override\n\tpublic void close() {\n\t\ttry {\n\t\t\tstream.close();\n\t\t} catch (IOException ignored) {\n\t\t}\n\t}\n}\n\nclass Exit {\n\tprivate Exit() {\n\t}\n\n\tpublic static void exit(InputReader in, PrintWriter out) {\n\t\tin.setFinished(true);\n\t\tin.close();\n\t\tout.close();\n\t}\n}\n\ninterface Solver {\n\tpublic void solve(int testNumber, InputReader in, PrintWriter out);\n}\n\nclass Pair<U, V> {\n\n\tpublic final U first;\n\tpublic final V second;\n\n\tpublic static<U, V> Pair<U, V> makePair(U first, V second) {\n\t\treturn new Pair<U, V>(first, second);\n\t}\n\n\tprivate Pair(U first, V second) {\n\t\tthis.first = first;\n\t\tthis.second = second;\n\t}\n\n\t@Override\n\tpublic boolean equals(Object o) {\n\t\tif (this == o) return true;\n\t\tif (o == null || getClass() != o.getClass()) return false;\n\n\t\tPair pair = (Pair) o;\n\n\t\treturn !(first != null ? !first.equals(pair.first) : pair.first != null) && !(second != null ? !second.equals(pair.second) : pair.second != null);\n\n\t}\n\n\t@Override\n\tpublic int hashCode() {\n\t\tint result = first != null ? first.hashCode() : 0;\n\t\tresult = 31 * result + (second != null ? second.hashCode() : 0);\n\t\treturn result;\n\t}\n\n\t@Override\n\tpublic String toString() {\n\t\treturn \"(\" + first + \",\" + second + \")\";\n\t}\n}\n\ninterface Edge {\n\tpublic int getSource();\n\tpublic int getDestination();\n\tpublic long getCapacity();\n\tpublic void pushFlow(long flow);\n\tpublic Edge getReverseEdge();\n}\n\nclass Graph {\n\tprivate final int size;\n\tprivate final List<Edge>[] edges;\n\n\tpublic Graph(int size) {\n\t\tthis.size = size;\n\t\t//noinspection unchecked\n\t\tedges = new List[size];\n\t\tfor (int i = 0; i < size; i++)\n\t\t\tedges[i] = new ArrayList<Edge>();\n\t}\n\n\tpublic int getSize() {\n\t\treturn size;\n\t}\n\n\tpublic List<Edge> getIncident(int vertex) {\n\t\treturn edges[vertex];\n\t}\n\n\tpublic void add(Edge edge) {\n\t\tedges[edge.getSource()].add(edge);\n\t\tedge = edge.getReverseEdge();\n\t\tif (edge != null)\n\t\t\tedges[edge.getSource()].add(edge);\n\t}\n\n\t}\n\nclass GraphAlgorithms {\n\tpublic static long dinic(Graph graph, int source, int destination) {\n\t\tlong totalFlow = 0;\n\t\tint vertexCount = graph.getSize();\n\t\tint[] nextEdge = new int[vertexCount];\n\t\twhile (true) {\n\t\t\tlong[] distance = edgeDistances(graph, source).getDistances();\n\t\t\tif (distance[destination] == Long.MAX_VALUE)\n\t\t\t\tbreak;\n\t\t\tArrays.fill(nextEdge, 0);\n\t\t\ttotalFlow += dinicImpl(graph, source, destination, Long.MAX_VALUE, distance, nextEdge);\n\t\t}\n\t\treturn totalFlow;\n\t}\n\n\tprivate static DistanceResult edgeDistances(Graph graph, int source) {\n\t\tint size = graph.getSize();\n\t\tDeque<Integer> queue = new ArrayDeque<Integer>(size);\n\t\tboolean[] processed = new boolean[size];\n\t\tboolean[] notReached = new boolean[size];\n\t\tArrays.fill(notReached, true);\n\t\tlong[] distance = new long[size];\n\t\tint[] last = new int[size];\n\t\tArrays.fill(distance, Long.MAX_VALUE);\n\t\tdistance[source] = 0;\n\t\tlast[source] = -1;\n\t\tqueue.add(source);\n\t\tnotReached[source] = false;\n\t\tint iterationCount = 0;\n\t\twhile (!queue.isEmpty()) {\n\t\t\titerationCount++;\n\t\t\tif (iterationCount / size / size / size != 0)\n\t\t\t\treturn null;\n\t\t\tint current = queue.poll();\n\t\t\tprocessed[current] = true;\n\t\t\tfor (Edge edge : graph.getIncident(current)) {\n\t\t\t\tif (edge.getCapacity() == 0)\n\t\t\t\t\tcontinue;\n\t\t\t\tint next = edge.getDestination();\n\t\t\t\tlong weight = 1;\n\t\t\t\tif (distance[next] > distance[current] + weight) {\n\t\t\t\t\tdistance[next] = distance[current] + weight;\n\t\t\t\t\tlast[next] = current;\n\t\t\t\t\tif (notReached[next]) {\n\t\t\t\t\t\tnotReached[next] = false;\n\t\t\t\t\t\tqueue.add(next);\n\t\t\t\t\t} else if (processed[next]) {\n\t\t\t\t\t\tprocessed[next] = false;\n\t\t\t\t\t\tqueue.addFirst(next);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn new DistanceResult(distance, last);\n\t}\n\n\tprivate static long dinicImpl(Graph graph, int source, int destination, long flow, long[] distance, int[] nextEdge) {\n\t\tif (source == destination)\n\t\t\treturn flow;\n\t\tif (flow == 0 || distance[source] == distance[destination])\n\t\t\treturn 0;\n\t\tList<Edge> incident = graph.getIncident(source);\n\t\tint incidentSize = incident.size();\n\t\tint totalPushed = 0;\n\t\tfor (int i = nextEdge[source]; i < incidentSize; i++) {\n\t\t\tEdge edge = incident.get(i);\n\t\t\tint nextDestination = edge.getDestination();\n\t\t\tif (distance[nextDestination] != distance[source] + 1)\n\t\t\t\tcontinue;\n\t\t\tlong pushed = dinicImpl(graph, nextDestination, destination, Math.min(flow, edge.getCapacity()),\n\t\t\t\tdistance, nextEdge);\n\t\t\tif (pushed != 0) {\n\t\t\t\tedge.pushFlow(pushed);\n\t\t\t\tflow -= pushed;\n\t\t\t\ttotalPushed += pushed;\n\t\t\t\tif (flow == 0) {\n\t\t\t\t\tnextEdge[source] = i;\n\t\t\t\t\treturn totalPushed;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tnextEdge[source] = incidentSize;\n\t\treturn totalPushed;\n\t}\n\n\n\tpublic static class DistanceResult {\n\t\tprivate final long[] distances;\n\t\tprivate final int[] last;\n\n\t\tpublic DistanceResult(long[] distances, int[] last) {\n\t\t\tthis.distances = distances;\n\t\t\tthis.last = last;\n\t\t}\n\n\t\tpublic long[] getDistances() {\n\t\t\treturn distances;\n\t\t}\n\n\t\t}\n\n\t}\n\nclass SimpleEdge implements Edge {\n\tprotected final int source;\n\tprotected final int destination;\n\n\tpublic SimpleEdge(int source, int destination) {\n\t\tthis.source = source;\n\t\tthis.destination = destination;\n\t}\n\n\tpublic int getSource() {\n\t\treturn source;\n\t}\n\n\tpublic int getDestination() {\n\t\treturn destination;\n\t}\n\n\tpublic long getCapacity() {\n\t\treturn 0;\n\t}\n\n\tpublic void pushFlow(long flow) {\n\t\tthrow new UnsupportedOperationException();\n\t}\n\n\tpublic Edge getReverseEdge() {\n\t\treturn null;\n\t}\n\n\t}\n\nclass FlowEdge extends SimpleEdge {\n\tprivate long capacity;\n\tprivate long flow = 0;\n\tprivate Edge reverseEdge;\n\n\tpublic FlowEdge(int source, int destination, long capacity) {\n\t\tsuper(source, destination);\n\t\tthis.capacity = capacity;\n\t\treverseEdge = new ReverseEdge();\n\t}\n\n\t@Override\n\tpublic long getCapacity() {\n\t\treturn capacity;\n\t}\n\n\t@Override\n\tpublic void pushFlow(long flow) {\n\t\tif (flow > 0) {\n\t\t\tif (this.capacity < flow)\n\t\t\t\tthrow new IllegalArgumentException();\n\t\t} else {\n\t\t\tif (this.flow < -flow)\n\t\t\t\tthrow new IllegalArgumentException();\n\t\t}\n\t\tcapacity -= flow;\n\t\tthis.flow += flow;\n\t}\n\n\t@Override\n\tpublic Edge getReverseEdge() {\n\t\treturn reverseEdge;\n\t}\n\n\tprivate class ReverseEdge implements Edge {\n\t\tpublic int getSource() {\n\t\t\treturn destination;\n\t\t}\n\n\t\tpublic int getDestination() {\n\t\t\treturn source;\n\t\t}\n\n\t\tpublic long getCapacity() {\n\t\t\treturn flow;\n\t\t}\n\n\t\tpublic void pushFlow(long flow) {\n\t\t\tFlowEdge.this.pushFlow(-flow);\n\t\t}\n\n\t\tpublic Edge getReverseEdge() {\n\t\t\treturn FlowEdge.this;\n\t\t}\n\t}\n}\n\nclass IOUtils {\n\n\tpublic static char[] readCharArray(InputReader in, int size) {\n\t\tchar[] array = new char[size];\n\t\tfor (int i = 0; i < size; i++)\n\t\t\tarray[i] = in.readCharacter();\n\t\treturn array;\n\t}\n\n\tpublic static char[][] readTable(InputReader in, int rowCount, int columnCount) {\n\t\tchar[][] table = new char[rowCount][];\n\t\tfor (int i = 0; i < rowCount; i++)\n\t\t\ttable[i] = readCharArray(in, columnCount);\n\t\treturn table;\n\t}\n\n\t}\n\nclass MiscUtils {\n\tpublic static final int[] DX_4_CONNECTED = {1, 0, -1, 0};\n\tpublic static final int[] DY_4_CONNECTED = {0, -1, 0, 1};\n\n\t}\n\nclass TaskE implements Solver {\n\tpublic void solve(int testNumber, InputReader in, PrintWriter out) {\n\t\tint size = in.readInt();\n\t\tint time = in.readInt();\n\t\tchar[][] scientists = IOUtils.readTable(in, size, size);\n\t\tchar[][] rescue = IOUtils.readTable(in, size, size);\n\t\tGraph graph = new Graph(2 * size * size + 2);\n\t\tfor (int i = 0; i < size; i++) {\n\t\t\tfor (int j = 0; j < size; j++) {\n\t\t\t\tif (Character.isDigit(scientists[i][j]))\n\t\t\t\t\tgraph.add(new FlowEdge(2 * size * size, i * size + j, scientists[i][j] - '0'));\n\t\t\t\tif (Character.isDigit(rescue[i][j]))\n\t\t\t\t\tgraph.add(new FlowEdge(size * size + i * size + j, 2 * size * size + 1, rescue[i][j] - '0'));\n\t\t\t}\n\t\t}\n\t\tint badRow = -1;\n\t\tint badColumn = -1;\n\t\tfor (int i = 0; i < size; i++) {\n\t\t\tfor (int j = 0; j < size; j++) {\n\t\t\t\tif (rescue[i][j] == 'Z') {\n\t\t\t\t\tbadRow = i;\n\t\t\t\t\tbadColumn = j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < size; i++) {\n\t\t\tfor (int j = 0; j < size; j++) {\n\t\t\t\tif (Character.isDigit(scientists[i][j]) && scientists[i][j] != '0') {\n\t\t\t\t\tif (rescue[i][j] != '0')\n\t\t\t\t\t\tgraph.add(new FlowEdge(i * size + j, size * size + i * size + j, Integer.MAX_VALUE));\n\t\t\t\t\tSet<Pair<Integer, Integer>> canBe = new HashSet<Pair<Integer, Integer>>();\n\t\t\t\t\tcanBe.add(Pair.makePair(i, j));\n\t\t\t\t\tSet<Pair<Integer, Integer>> caNtBe = new HashSet<Pair<Integer, Integer>>();\n\t\t\t\t\tcaNtBe.add(Pair.makePair(badRow, badColumn));\n\t\t\t\t\tfor (int k = 0; k < time; k++) {\n\t\t\t\t\t\tSet<Pair<Integer, Integer>> nextCanBe = new HashSet<Pair<Integer, Integer>>();\n\t\t\t\t\t\tfor (Pair<Integer, Integer> cell : canBe) {\n\t\t\t\t\t\t\tfor (int l = 0; l < 4; l++) {\n\t\t\t\t\t\t\t\tint newRow = cell.first + MiscUtils.DX_4_CONNECTED[l];\n\t\t\t\t\t\t\t\tint newColumn = cell.second + MiscUtils.DY_4_CONNECTED[l];\n\t\t\t\t\t\t\t\tif (newRow >= 0 && newColumn >= 0 && newRow < size && newColumn < size && Character.isDigit(scientists[newRow][newColumn])) {\n\t\t\t\t\t\t\t\t\tPair<Integer, Integer> next = Pair.makePair(newRow, newColumn);\n\t\t\t\t\t\t\t\t\tif (!caNtBe.contains(next)) {\n\t\t\t\t\t\t\t\t\t\tif (rescue[newRow][newColumn] != '0')\n\t\t\t\t\t\t\t\t\t\t\tgraph.add(new FlowEdge(i * size + j, size * size + newRow * size + newColumn, Integer.MAX_VALUE));\n\t\t\t\t\t\t\t\t\t\tnextCanBe.add(next);\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tSet<Pair<Integer, Integer>> nextCaNtBe = new HashSet<Pair<Integer, Integer>>();\n\t\t\t\t\t\tfor (Pair<Integer, Integer> cell : caNtBe) {\n\t\t\t\t\t\t\tnextCaNtBe.add(cell);\n\t\t\t\t\t\t\tfor (int l = 0; l < 4; l++) {\n\t\t\t\t\t\t\t\tint newRow = cell.first + MiscUtils.DX_4_CONNECTED[l];\n\t\t\t\t\t\t\t\tint newColumn = cell.second + MiscUtils.DY_4_CONNECTED[l];\n\t\t\t\t\t\t\t\tif (newRow >= 0 && newColumn >= 0 && newRow < size && newColumn < size && Character.isDigit(scientists[newRow][newColumn])) {\n\t\t\t\t\t\t\t\t\tPair<Integer, Integer> next = Pair.makePair(newRow, newColumn);\n\t\t\t\t\t\t\t\t\tnextCaNtBe.add(next);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcanBe = nextCanBe;\n\t\t\t\t\t\tcaNtBe = nextCaNtBe;\n\t\t\t\t\t\tcanBe.removeAll(caNtBe);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tout.println(GraphAlgorithms.dinic(graph, 2 * size * size, 2 * size * size + 1));\n\t}\n}\n\n", "lang_cluster": "Java", "tags": ["flows", "graphs", "shortest paths"], "code_uid": "c6df5c83c371d6a5103bbaf844c8521e", "src_uid": "544de9c3729a35eb08c143b1cb9ee085", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import static java.lang.Math.*;\nimport static java.lang.System.currentTimeMillis;\nimport static java.lang.System.exit;\nimport static java.lang.System.arraycopy;\nimport static java.util.Arrays.sort;\nimport static java.util.Arrays.binarySearch;\nimport static java.util.Arrays.fill;\nimport java.util.*;\nimport java.io.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\ttry {\n\t\t\tif (new File(\"input.txt\").exists())\n\t\t\t\tSystem.setIn(new FileInputStream(\"input.txt\"));\n\t\t} catch (SecurityException e) {\n\t\t}\n\t\tnew Thread(null, new Runnable() {\n\t\t\tpublic void run() {\n\t\t\t\ttry {\n\t\t\t\t\tnew Main().run();\n\t\t\t\t} catch (Throwable e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t\texit(999);\n\t\t\t\t}\n\t\t\t}\n\t\t}, \"1\", 1 << 23).start();\n\t}\n\n\tBufferedReader in;\n\tPrintWriter out;\n\tStringTokenizer st = new StringTokenizer(\"\");\n\n\tint n, T;\n\tboolean f[][];\n\tint start[][];\n\tint end[][];\n\t\n\tQ qu;\n\t\n\tvoid get(int m[][]) throws IOException{\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tchar s[] = nextToken().toCharArray();\n\t\t\tfor(int j = 0; j < n; j++){\n\t\t\t\tswitch(s[j]){\n\t\t\t\tcase 'Z' : \n\t\t\t\t\tif(qu.isEmpty())\n\t\t\t\t\t\tqu.push(i, j, 0);\n\t\t\t\t\tf[i][j] = false;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'Y':\n\t\t\t\t\tf[i][j] = false;\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tm[i][j] = s[j] - '0';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tint ttd[][]; //time to die\n\tboolean used[][];\n\t\n\tint dx[] = {-1, 0, 1 , 0};\n\tint dy[] = {0, 1, 0 , -1};\n\n\tint inf = -1;\n\tint cap[][];\n\tint fl[][];\n\tint m;\n\t\n\tvoid compute_ttd(){\n\t\tfor(boolean i[] : used)\n\t\t\tfill(i, false);\n\n\t\tfor(boolean i[] : used)\n\t\t\tfill(i, false);\n\t\twhile(!qu.isEmpty()){\n\t\t\t\n\t\t\tP e = qu.pop();\n\t\t\tint x = e.x, y = e.y, t = e.t;\n\t\t\tttd[x][y] = t;\n\t\t\tused[x][y] = true;\n\t\t\tfor(int k = 0; k < 4; k++){\n\t\t\t\tint nx = x + dx[k];\n\t\t\t\tint ny = y + dy[k];\n\t\t\t\tif(valid(nx, ny)){\n\t\t\t\t\tused[nx][ny] = true;\n\t\t\t\t\tqu.push(nx, ny, t + 1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n\tboolean valid(int x, int y){\n\t\tif(x < 0 || y < 0 || x >= n || y >= n || !f[x][y] || used[x][y])\n\t\t\treturn false;\n\t\treturn true;\n\t}\n\t\n\tList<Integer> g[];\n\tvoid setG(int vert){\n\t\tfor(boolean i[] : used)\n\t\t\tfill(i, false);\n\n\t\twhile(!qu.isEmpty()){\n\t\t\tP e = qu.pop();\n\t\t\tint x = e.x, y = e.y, t = e.t;\n\t\t\tused[x][y] = true;\n\t\t\t\n\t\t\tif(t <= ttd[x][y] && t <= T){\n\t\t\t\tcap[vert][m + 2 + x * n + y] = inf;\n\t\t\t\tg[vert].add(m + 2 + x * n + y);\n\t\t\t\tg[m + 2 + x * n + y].add(vert);\n\t\t\t}\n\t\t\tif(t >= ttd[x][y] || t >= T)\n\t\t\t\tcontinue;\n\t\t\tfor(int k = 0; k < 4; k++)\n\t\t\t\tif(valid(x + dx[k], y + dy[k])){\n\t\t\t\t\tused[x + dx[k]][y + dy[k]] = true;\n\t\t\t\t\tqu.push(x + dx[k], y + dy[k], t + 1);\n\t\t\t\t}\n\t\t}\n\t}\n\tint path[];\n\tboolean lu[];\n\tQL ql;\n\tboolean find_path(int start, int end){\n\t\tfill(lu, false);\n\n\t\tql.clear();\n\t\tql.push(start);\n\t\tlu[start] = true;\n\t\twhile(!ql.isEmpty()){\n\t\t\tint v = ql.pop();\n\t\t\tif(v == end)\n\t\t\t\treturn true;\n\t\t\tfor(int e : g[v]){\n\t\t\t\tif(lu[e])\n\t\t\t\t\tcontinue;\n\t\t\t\tif(cap[v][e] > fl[v][e]){\n\t\t\t\t\tlu[e] = true;\n\t\t\t\t\tpath[e] = v;\n\t\t\t\t\tql.push(e);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\t\n\tprivate void run() throws IOException {\n\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tn = nextInt();\n\t\tT = nextInt();\n\t\t\n\t\tinf = n * n + n + 100;\n\t\t\n\t\t\n\t\tf = new boolean[n][n];\n\t\tstart = new int[n][n];\n\t\tend = new int[n][n];\n\t\tfor(boolean []i : f)\n\t\t\tfill(i, true);\n\t\t\n\t\tqu = new Q(n * n + 1);//\n\t\t\n\t\tget(start);\n\t\tget(end);\n\t\t\n\t\tttd = new int[n][n];\n\t\tused = new boolean[n][n];\n\t\t\n\t\tfor(int i[] : ttd)\n\t\t\tfill(i, inf << 1);\n\t\t\n\t\tcompute_ttd();\n\n\t\tm = n * n; \n\t\t\n\t\tcap = new int[m + m + 2][m + m + 2];\n\t\tfl = new int[m + m + 2][m + m + 2];\n\t\t\n\t\tg = new ArrayList[m + m + 2];\n\t\tfor(int i = 0; i < m + m + 2; i++)\n\t\t\tg[i] = new ArrayList<Integer>();\n\t\t\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int j = 0; j < n; j++){\n\t\t\t\tqu.clear();\n\t\t\t\tqu.push(i, j, 0);\n\t\t\t\tsetG(n * i + j);\n\t\t\t\tcap[n * i + j][n * i + j] = inf;\n\t\t\t}\n\t\t\n//\t\tfor(int i = 0; i < n; i++)\n//\t\t\tSystem.err.println(Arrays.toString(ttd[i]));\n//\t\tfor(int i = 0; i < m; i++)\n//\t\t\tSystem.err.println(Arrays.toString(cap[i]));\n//\n//\t\tfor(int ii = 0; ii < n; ii++)\n//\t\t\tfor(int jj = 0; jj < n; jj++)\n//\t\tfor(int i = 0; i < n; i++)\n//\t\t\tfor(int j = 0; j < n; j++)\n//\t\t\t\t\t\tif(cap[ii * n + jj][i * n + j] != 0)\n//\t\t\t\t\t\t\tSystem.err.println(ii + \" \" + jj + \" | \" + i + \" \" + j);\n\n\t\t// m - from m+1 - to\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int j = 0; j < n; j++){\n\t\t\t\tcap[m][i * n + j] = start[i][j];\n\t\t\t\tg[m].add(i * n + j);\n\t\t\t\tcap[m + 2 + i * n + j][m+1] = end[i][j];\n\t\t\t\tg[m + 2 + i * n + j].add(m + 1);\n\t\t\t}\n\t\t\t\t\n\t\tpath = new int[m + m + 2];\n\t\tlu = new boolean[m + m + 2];\n\t\tql = new QL(m + m + 2);\n\t\tint ans = 0;\n\t\t\n\t\twhile(true){\n\t\t\tif(!find_path(m , m + 1)){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\tint mf = inf;\n\t\t\t{\n\t\t\t\tint i = m + 1;\n\t\t\t\tdo{\n\t\t\t\t\tint j = path[i];\n\t\t\t\t\tmf = min(mf, cap[j][i] - fl[j][i]);\n\t\t\t\t\ti = j;\n\t\t\t\t}while(i != m);\n\t\t\t}\n\t\t\tans += mf;\n\t\t\t{\n\t\t\t\tint i = m + 1;\n\t\t\t\tdo{\n\t\t\t\t\tint j = path[i];\n\t\t\t\t\tfl[j][i] += mf;\n\t\t\t\t\tfl[i][j] -= mf;\n\t\t\t\t\ti = j;\n\t\t\t\t}while(i != m);\n\t\t\t}\n\t\t}\n\t\t\n\t\tout.println(ans);\n\t\tin.close();\n\t\tout.close();\n\t}\n\n\tclass Q{\n\t\tP m[];\n\t\tint h, t;\n\t\tQ(int size){\n\t\t\tm = new P[size];\n\t\t\tfor(int i = 0; i < size; i++)\n\t\t\t\tm[i] = new P(0,0,0);\n\t\t\th = t = 0;\n\t\t}\n\t\tvoid clear(){\n\t\t\th = t = 0;\n\t\t}\n\t\tvoid push(int x, int y, int tt){\n//\t\t\tSystem.err.println(x + \" \" + y);\n\t\t\tm[t++].set(x, y, tt);\n\t\t}\n\t\tvoid push(P e){\n\t\t\tm[t++].set(e);\n\t\t}\n\t\tP pop(){\n\t\t\treturn m[h++];\n\t\t}\n\t\tboolean isEmpty(){\n\t\t\treturn h == t;\n\t\t}\n\t}\n\tclass QL{\n\t\tint m[];\n\t\tint h, t;\n\t\tQL(int size){\n\t\t\tm = new int[size];\n\t\t\th = t = 0;\n\t\t}\n\t\tvoid push(int x){\n//\t\t\tSystem.err.println(x);\n\t\t\tm[t++] = x;\n\t\t}\n\t\tint pop(){\n\t\t\treturn m[h++];\n\t\t}\n\t\tboolean isEmpty(){\n\t\t\treturn h == t;\n\t\t}\n\t\tvoid clear(){\n\t\t\th = t = 0;\n\t\t}\n\t}\n\tclass P{\n\t\tint x, y, t;\n\t\tP(int xx, int yy, int tt){\n\t\t\tx = xx;\n\t\t\ty = yy;\n\t\t\tt = tt;\n\t\t}\n\t\tvoid set(int xx, int yy, int tt){\n\t\t\tx = xx;\n\t\t\ty = yy;\n\t\t\tt = tt;\n\t\t}\n\t\tvoid set(P e){\n\t\t\tx = e.x;\n\t\t\ty = e.y;\n\t\t\tt = e.t;\n\t\t}\n\t\tpublic String toString(){\n\t\t\treturn x + \" \" + y + \" \" + t + \" |\";\n\t\t}\n\t}\n\tvoid chk(boolean b) {\n\t\tif (b)\n\t\t\treturn;\n\t\tSystem.out.println(new Error().getStackTrace()[1]);\n\t\texit(999);\n\t}\n\tvoid deb(String fmt, Object... args) {\n\t\tSystem.out.printf(Locale.US, fmt + \"%n\", args);\n\t}\n\tString nextToken() throws IOException {\n\t\twhile (!st.hasMoreTokens())\n\t\t\tst = new StringTokenizer(in.readLine());\n\t\treturn st.nextToken();\n\t}\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\tlong nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\tdouble nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n\tString nextLine() throws IOException {\n\t\tst = new StringTokenizer(\"\");\n\t\treturn in.readLine();\n\t}\n\tboolean EOF() throws IOException {\n\t\twhile (!st.hasMoreTokens()) {\n\t\t\tString s = in.readLine();\n\t\t\tif (s == null)\n\t\t\t\treturn true;\n\t\t\tst = new StringTokenizer(s);\n\t\t}\n\t\treturn false;\n\t}\n}\n", "lang_cluster": "Java", "tags": ["flows", "graphs", "shortest paths"], "code_uid": "355ca145a3ad950b3af3603049730205", "src_uid": "544de9c3729a35eb08c143b1cb9ee085", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.util.Comparator;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Collection;\nimport java.util.List;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.ArrayList;\nimport java.util.StringTokenizer;\nimport java.math.BigInteger;\nimport java.util.Collections;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author AlexFetisov\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskE solver = new TaskE();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskE {\n private static final int INF = (int) 1e9;\n int n;\n int timeExplode;\n boolean[][] hasWall;\n int badStartX, badStartY;\n int[][] numberOfScientists;\n int[][] numberOfReactors;\n int[][] becomeBad;\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n n = in.nextInt();\n timeExplode = in.nextInt();\n hasWall = new boolean[n][n];\n numberOfScientists = new int[n][n];\n numberOfReactors = new int[n][n];\n for (int i = 0; i < n; ++i) {\n String line = in.nextString();\n for (int j = 0; j < n; ++j) {\n char c = line.charAt(j);\n if (c == 'Z') {\n badStartX = i;\n badStartY = j;\n hasWall[i][j] = true;\n } else if (c == 'Y') {\n hasWall[i][j] = true;\n } else {\n numberOfScientists[i][j] = c - '0';\n }\n }\n }\n for (int i = 0; i < n; ++i) {\n String line = in.nextString();\n for (int j = 0; j < n; ++j) {\n char c = line.charAt(j);\n if (Character.isDigit(c)) {\n numberOfReactors[i][j] = c - '0';\n }\n }\n }\n\n becomeBad = new int[n][n];\n ArrayUtils.fill(becomeBad, INF);\n becomeBad[badStartX][badStartY] = 0;\n int[] qx = new int[n * n];\n int[] qy = new int[n * n];\n int qSize = 1;\n qx[0] = badStartX;\n qy[0] = badStartY;\n for (int qi = 0; qi < qSize; ++qi) {\n int cx = qx[qi];\n int cy = qy[qi];\n for (int d = 0; d < dx.length; ++d) {\n int nx = cx + dx[d];\n int ny = cy + dy[d];\n if (isValid(nx, ny, n)) {\n if (!hasWall[nx][ny]) {\n if (becomeBad[nx][ny] == INF) {\n becomeBad[nx][ny] = becomeBad[cx][cy] + 1;\n qx[qSize] = nx;\n qy[qSize] = ny;\n ++qSize;\n }\n }\n }\n }\n }\n\n Graph maxFlowGraph = new Graph();\n maxFlowGraph.initGraphWithFlow(n * n * 2 + 2, n * n * n * n * 4 * 3 + 10 * n * n + 100);\n\n int source = 0;\n int shiftForPerson = 1;\n int shiftForReactor = n * n + 1;\n int dest = n * n + n * n + 1;\n\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < n; ++j) {\n if (numberOfScientists[i][j] > 0) {\n maxFlowGraph.addFlowEdge(source, i * n + j + shiftForPerson, numberOfScientists[i][j]);\n }\n }\n }\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < n; ++j) {\n if (numberOfReactors[i][j] > 0) {\n maxFlowGraph.addFlowEdge(i * n + j + shiftForReactor, dest, numberOfReactors[i][j]);\n }\n }\n }\n\n for (int xPerson = 0; xPerson < n; ++xPerson) {\n for (int yPerson = 0; yPerson < n; ++yPerson) {\n if (numberOfScientists[xPerson][yPerson] > 0) {\n boolean[][] canReach = new boolean[n][n];\n boolean[][] marked = new boolean[n][n];\n boolean[][] newMarked = new boolean[n][n];\n marked[xPerson][yPerson] = true;\n canReach[xPerson][yPerson] = true;\n for (int curTime = 0; curTime < timeExplode; ++curTime) {\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < n; ++j) {\n if (marked[i][j]) {\n for (int d = 0; d < 4; ++d) {\n int ni = i + dx[d];\n int nj = j + dy[d];\n if (isValid(ni, nj, n)) {\n if (!hasWall[ni][nj]) {\n if (curTime + 1 <= becomeBad[ni][nj]) {\n canReach[ni][nj] = true;\n }\n if (curTime + 1 < becomeBad[ni][nj]) {\n newMarked[ni][nj] = true;\n }\n }\n }\n }\n }\n }\n }\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < n; ++j) {\n marked[i][j] = newMarked[i][j];\n newMarked[i][j] = false;\n }\n }\n }\n for (int xReactor = 0; xReactor < n; ++xReactor) {\n for (int yReactor = 0; yReactor < n; ++yReactor) {\n if (numberOfReactors[xReactor][yReactor] > 0) {\n if (canReach[xReactor][yReactor]) {\n maxFlowGraph.addFlowEdge(xPerson * n + yPerson + shiftForPerson, xReactor * n + yReactor + shiftForReactor, INF);\n }\n }\n }\n }\n }\n }\n }\n long flow = MaxFlowDinic.dinic(maxFlowGraph, source, dest);\n out.println(flow);\n }\n\n private boolean isValid(int x, int y, int n) {\n return x >= 0 && y >= 0 && x < n && y < n;\n }\n\n int[] dx = new int[] {1, 0, -1, 0};\n int[] dy = new int[] {0, 1, 0, -1};\n}\n\nclass InputReader {\n private BufferedReader reader;\n private StringTokenizer stt;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream));\n }\n\n public String nextLine() {\n try {\n return reader.readLine();\n } catch (IOException e) {\n return null;\n }\n }\n\n public String nextString() {\n while (stt == null || !stt.hasMoreTokens()) {\n stt = new StringTokenizer(nextLine());\n }\n return stt.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(nextString());\n }\n\n}\n\nclass ArrayUtils {\n\n public static void fill(int[][] f, int value) {\n for (int i = 0; i < f.length; ++i) {\n Arrays.fill(f[i], value);\n }\n }\n\n}\n\nclass Graph {\n public int[] from;\n public int[] to;\n public int[] first;\n public int[] next;\n public int[] cost;\n public int[] capacity;\n public long[] flow;\n public int[] last;\n public int nVertex;\n public int nEdges;\n int[] reverseEdge;\n public int curEdge;\n\n public Graph() {}\n\n public void initGraphWithFlow(int n, int m) {\n curEdge = 0;\n nVertex = n;\n nEdges = m;\n from = new int[m * 2];\n to = new int[m * 2];\n first = new int[n];\n next = new int[m * 2];\n cost = new int[m * 2];\n capacity = new int[m * 2];\n flow = new long[m * 2];\n reverseEdge = new int[m * 2];\n last = new int[m * 2];\n Arrays.fill(first, -1);\n Arrays.fill(last, -1);\n }\n\n public void addFlowEdge(int a, int b, int f) {\n// System.err.println(\"Added edge \" + a + \" - \" + b + \" with flow: \" + f);\n next[curEdge] = first[a];\n first[a] = curEdge;\n to[curEdge] = b;\n from[curEdge] = a;\n capacity[curEdge] = f;\n flow[curEdge] = 0;\n reverseEdge[curEdge] = curEdge + 1;\n ++curEdge;\n\n next[curEdge] = first[b];\n first[b] = curEdge;\n to[curEdge] = a;\n from[curEdge] = b;\n capacity[curEdge] = 0;\n flow[curEdge] = 0;\n reverseEdge[curEdge] = curEdge - 1;\n ++curEdge;\n }\n\n public final void pushFlow(int id, long fl) {\n if (fl == 0) {\n return;\n }\n flow[id] += fl;\n flow[id^1] -= fl;\n }\n\n}\n\nclass MaxFlowDinic {\n private final Graph graph;\n private int source;\n private int dest;\n private int[] queue;\n private int[] distance;\n private int[] nextEdge;\n\n public MaxFlowDinic(Graph graph, int source, int dest) {\n this.graph = graph;\n this.source = source;\n this.dest = dest;\n int n = graph.nVertex;\n queue = new int[n];\n distance = new int[n];\n nextEdge = new int[n];\n }\n\n public static long dinic(Graph graph, int source, int destination) {\n return new MaxFlowDinic(graph, source, destination).dinic();\n }\n\n private long dinic() {\n long totalFlow = 0;\n while (true) {\n edgeDistances();\n if (distance[dest] == -1)\n break;\n Arrays.fill(nextEdge, -2);\n totalFlow += dinicImpl(source, Long.MAX_VALUE);\n }\n return totalFlow;\n }\n\n private void edgeDistances() {\n Arrays.fill(distance, -1);\n distance[source] = 0;\n int size = 1;\n queue[0] = source;\n for (int i = 0; i < size; i++) {\n int cur = queue[i];\n for (int id = graph.first[cur]; id != -1; id = graph.next[id]) {\n if (graph.capacity[id] > graph.flow[id]) {\n int next = graph.to[id];\n if (distance[next] == -1) {\n distance[next] = distance[cur] + 1;\n queue[size++] = next;\n }\n }\n }\n }\n }\n\n private long dinicImpl(int source, long flow) {\n if (source == dest) {\n return flow;\n }\n if (flow == 0 || distance[source] == distance[dest]) {\n return 0;\n }\n int id = nextEdge[source];\n if (id == -2) {\n nextEdge[source] = id = graph.first[source];\n }\n long totalPushed = 0;\n while (id != -1) {\n int nextDestinationID = graph.to[id];\n if (graph.capacity[id] > graph.flow[id] && distance[nextDestinationID] == distance[source] + 1) {\n long pushed = dinicImpl(nextDestinationID, Math.min(flow, graph.capacity[id] - graph.flow[id]));\n if (pushed != 0) {\n graph.pushFlow(id, pushed);\n flow -= pushed;\n totalPushed += pushed;\n if (flow == 0)\n return totalPushed;\n }\n }\n nextEdge[source] = id = graph.next[id];\n }\n return totalPushed;\n }\n\n}\n\n", "lang_cluster": "Java", "tags": ["flows", "graphs", "shortest paths"], "code_uid": "b2a4c6561485cf8043d6342372130c4d", "src_uid": "544de9c3729a35eb08c143b1cb9ee085", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.lang.*;\nimport java.math.BigInteger;\nimport java.io.*;\nimport java.util.*;\n\npublic class Solution implements Runnable{\n public static BufferedReader br;\n public static PrintWriter out;\n public static StringTokenizer stk;\n public static boolean isStream = true;\n\n public static void main(String[] args) throws IOException {\n \tif (isStream) {\n br = new BufferedReader(new InputStreamReader(System.in));\n } else {\n br = new BufferedReader(new FileReader(\"in.txt\"));\n }\n out = new PrintWriter(System.out);\n new Thread(new Solution()).start();\n }\n\n public void loadLine() {\n try {\n stk = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n\n public String nextLine() {\n try {\n return br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n return \"\";\n }\n }\n\n public String nextWord() {\n while (stk==null||!stk.hasMoreTokens()) loadLine();\n return stk.nextToken();\n }\n\n public Integer nextInt() {\n while (stk==null||!stk.hasMoreTokens()) loadLine();\n return Integer.valueOf(stk.nextToken());\n }\n\n public Long nextLong() {\n while (stk==null||!stk.hasMoreTokens()) loadLine();\n return Long.valueOf(stk.nextToken());\n }\n\n public Double nextDouble() {\n while (stk==null||!stk.hasMoreTokens()) loadLine();\n return Double.valueOf(stk.nextToken());\n }\n \n public Float nextFloat() {\n while (stk==null||!stk.hasMoreTokens()) loadLine();\n return Float.valueOf(stk.nextToken());\n }\n \n int n;\n int t;\n int[][][] isBad;\n int[][][][][] can;\n \n int[] dx = new int[] {-1,1,0,0};\n int[] dy = new int[] {0,0,1,-1};\n \n int[][] map, flow;\n \n int INF = 1000000;\n \n int findFlow() {\n \tint m = n*n*2+2;\n \tint[] from = new int[m];\n \twhile (true) {\n \t\tArrays.fill(from, -1);\n \t\tfrom[m-2] = -2;\n\t \tLinkedList<Integer> list = new LinkedList<Integer>();\n\t \tlist.addFirst(m-2);\n\t \twhile (list.size() != 0) {\n\t \t\tint cur = list.removeLast();\n\t \t\tfor (int next = 0; next < m; next++) {\n\t \t\t\tif (map[cur][next] != -1 && from[next] == -1 && map[cur][next]-flow[cur][next] > 0) {\n\t \t\t\t\tfrom[next] = cur;\n\t \t\t\t\tlist.addFirst(next);\n\t \t\t\t}\n\t \t\t}\n\t \t}\n\t \tif (from[m-1] != -1) {\n\t \t\tint min = Integer.MAX_VALUE;\n\t \t\tint pos = m-1;\n\t \t\twhile (from[pos] != -2) {\n\t \t\t\tmin = Math.min(min, map[from[pos]][pos]-flow[from[pos]][pos]);\n\t \t\t\tpos = from[pos];\n\t \t\t}\n\t \t\tpos = m-1;\n\t \t\twhile (from[pos] != -2) {\n\t \t\t\tflow[from[pos]][pos] += min;\n\t \t\t\tflow[pos][from[pos]] -= min;\n\t \t\t\tpos = from[pos];\n\t \t\t}\n\t \t} else {\n\t \t\tbreak;\n\t \t}\n \t}\n \tint ans = 0;\n \tfor (int i = 0; i < m; i++) {\n \t\tif (map[i][m-1] != -1) {\n \t\t\tans += flow[i][m-1];\n \t\t}\n \t}\n \treturn ans;\n }\n \n public void run() {\n \tn = nextInt();\n \tt = nextInt();\n \tString[] ss1 = new String[n];\n \tfor (int i = 0; i < n; i++) {\n \t\tss1[i] = nextWord();\n \t}\n \tString[] ss2 = new String[n];\n \tfor (int i = 0; i < n; i++) {\n \t\tss2[i] = nextWord();\n \t}\n \t\n \tisBad = new int[t+1][n][n];\n \tfor (int i = 0; i < n; i++) {\n \t\tfor (int j = 0; j < n; j++) {\n \t\tif (ss1[i].charAt(j) == 'Y') {\n \t\t\tisBad[0][i][j] = 1;\n \t\t}\n \t\tif (ss1[i].charAt(j) == 'Z') {\n \t\t\tisBad[0][i][j] = 2;\n \t\t}\n \t}\t\n \t}\n \tfor (int tt = 1; tt <= t; tt++) {\n \t\tfor (int i = 0; i < n; i++) {\n \t\tfor (int j = 0; j < n; j++) {\n \t\t\tisBad[tt][i][j] = isBad[tt-1][i][j];\n \t\t\tif (isBad[tt][i][j] == 0) {\n\t \t\tfor (int d = 0; d < 4; ++d) {\n\t \t\t\tif (i+dx[d] >= 0 && i+dx[d] < n && j+dy[d] >= 0 && j+dy[d] < n) {\n\t\t \t\t\tif (isBad[tt-1][i+dx[d]][j+dy[d]] == 2) {\n\t\t \t\t\t\tisBad[tt][i][j] = 2;\n\t\t \t\t\t}\n\t \t\t\t}\n\t \t\t}\n \t\t\t}\n \t}\t\n \t}\n \t}\n \t\n \tcan = new int[n][n][t+1][n][n];\n \tfor (int si = 0; si < n; si++) {\n \t\tfor (int sj = 0; sj < n; sj++) {\n \t\tif (ss1[si].charAt(sj) >= '1' && ss1[si].charAt(sj) <= '9') {\n \t\t\tcan[si][sj][0][si][sj] = 1;\n \t\t\tfor (int tt = 1; tt <= t; tt++) {\n \t \t\tfor (int i = 0; i < n; i++) {\n \t \t\tfor (int j = 0; j < n; j++) {\n \t \t\t\tif (isBad[tt-1][i][j] == 0) {\n \t\t \t\tfor (int d = 0; d < 4; ++d) {\n \t\t \t\t\tif (i+dx[d] >= 0 && i+dx[d] < n && j+dy[d] >= 0 && j+dy[d] < n) {\n\t \t\t \t\t\tif (can[si][sj][tt-1][i+dx[d]][j+dy[d]] == 1 && isBad[tt-1][i+dx[d]][j+dy[d]] == 0) {\n\t \t\t \t\t\t\tcan[si][sj][tt][i][j] = 1;\n\t \t\t \t\t\t}\n \t\t \t\t\t}\n \t\t \t\t}\n \t \t\t\t}\n \t \t}\t\n \t \t}\n \t \t}\n \t\t}\n \t}\n \t}\n \t\n \tmap = new int[2*n*n+2][2*n*n+2];\n \tflow = new int[2*n*n+2][2*n*n+2];\n \tfor (int i = 0; i < map.length; i++) {\n \t\tArrays.fill(map[i], -1);\n \t}\n \tfor (int i = 0; i < n; i++) {\n \t\tfor (int j = 0; j < n; j++) {\n \t\tif (ss1[i].charAt(j) >= '1' && ss1[i].charAt(j) <= '9') {\n \t\t\tfor (int ri = 0; ri < n; ri++) {\n \t \t\tfor (int rj = 0; rj < n; rj++) {\n \t \t\t\tif (ss2[ri].charAt(rj) >= '1' && ss2[ri].charAt(rj) <= '9') {\n\t \t \t\t\tboolean f = false;\n\t \t \t\t\tfor (int tt = 0; tt <= t; tt++) {\n\t \t \t\t\t\tif (can[i][j][tt][ri][rj] == 1) {\n\t \t \t\t\t\t\tf = true;\n\t \t \t\t\t\t}\n\t \t \t\t\t}\n\t \t \t\tif (f) {\n\t \t \t\t\tmap[i*n+j][n*n+ri*n+rj] = INF;\n\t \t \t\t\tmap[n*n+ri*n+rj][i*n+j] = 0;\n\t \t \t\t}\n \t \t\t\t}\n \t \t}\t\n \t \t}\n \t\t}\n \t}\t\n \t}\n \t\n \tfor (int i = 0; i < n; i++) {\n \t\tfor (int j = 0; j < n; j++) {\n \t\tif (ss1[i].charAt(j) >= '1' && ss1[i].charAt(j) <= '9') {\n \t\t\tmap[n*n*2][i*n+j] = ss1[i].charAt(j) - '0';\n \t\t\tmap[i*n+j][n*n*2] = 0;\n \t\t}\n \t\t}\n \t}\n \t\n \tfor (int i = 0; i < n; i++) {\n \t\tfor (int j = 0; j < n; j++) {\n \t\tif (ss2[i].charAt(j) >= '1' && ss2[i].charAt(j) <= '9') {\n \t\t\tmap[n*n+i*n+j][n*n*2+1] = ss2[i].charAt(j) - '0';\n \t\t\tmap[n*n*2+1][n*n+i*n+j] = 0;\n \t\t}\n \t\t}\n \t}\n \t\n \tout.println(findFlow());\n \t\n \tout.flush();\n }\n}\n", "lang_cluster": "Java", "tags": ["flows", "graphs", "shortest paths"], "code_uid": "740f61f2be15eef7c227cdaf13ee9d0c", "src_uid": "544de9c3729a35eb08c143b1cb9ee085", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.*;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint N = sc.nextInt();\n\t\tint T = sc.nextInt();\n\t\t\n\t\tint[][] scientists = new int[N][N];\n\t\tint[][] capsules = new int[N][N];\n\n\t\t/* Create the graph:\n\t\t * \t\tBipartite graph with scientists U and capsules V\n\t\t * \t\tSink connecting to each scientist, Source connecting each capsule\n\t\t * \t\tEdge between U and V if a scientist can reach a given capsule block\n\t\t * \t\tat any time t.\n\t\t * */\n\t\tNode src = new Node(-1, -1); /* Defective reactor */\n\t\tNode sink = new Node(-1, -1); \n\t\t\n\t\t/* First matrix */\n\t\tSet<Node> U = new HashSet<Node>();\n\n\t\tfor(int i = 0 ; i < N; i++){\n\t\t\tString line = sc.next();\n\t\t\tfor(int j = 0 ; j < N; j++){\n\t\t\t\tif(line.charAt(j) == 'Y'){\n\t\t\t\t\tscientists[i][j] = -2;\n\t\t\t\t}\n\t\t\t\telse if(line.charAt(j) == 'Z'){\n\t\t\t\t\tscientists[i][j] = -1;\n\t\t\t\t\tsrc.x = i;\n\t\t\t\t\tsrc.y = j;\n\t\t\t\t}\n\t\t\t\telse if(line.charAt(j) != '0'){/* Create a node for the block. Add an edge from src to node with capacity = # of scientists */\n\t\t\t\t\tscientists[i][j] = (int)(line.charAt(j) -'0');\n\t\t\t\t\tNode temp = new Node(i, j);\n\t\t\t\t\tsrc.addEdge(new Edge(src, temp, scientists[i][j], 0));\n\t\t\t\t\tU.add(temp);\n\t\t\t\t}\n\t\t\t}\t\n\t\t}\n\t\t/* Second matrix */\n\t\tSet<Node> V = new HashSet<Node>();\n\t\tfor(int i = 0 ; i < N; i++){\n\t\t\tString line = sc.next();\n\t\t\tfor(int j = 0 ; j < N; j++){\n\t\t\t\tif(line.charAt(j) == 'Y'){\n\t\t\t\t\tcapsules[i][j] = -2;\n\t\t\t\t}\n\t\t\t\telse if(line.charAt(j) == 'Z'){\n\t\t\t\t\tcapsules[i][j] = -1;\n\t\t\t\t}\n\t\t\t\telse if(line.charAt(j) != '0'){/* Create a node for the block. Add an edge from node to sink with capacity = # of capsules */\n\t\t\t\t\tcapsules[i][j] = (int)(line.charAt(j) - '0');\n\t\t\t\t\tNode temp = new Node(i, j);\n\t\t\t\t\ttemp.addEdge(new Edge(temp, sink, capsules[i][j], 0));\n\t\t\t\t\tV.add(temp);\n\t\t\t\t}\n\t\t\t}\t\n\t\t}\n\t\tsc.close();\n\t\t\n\t\t/* Create a mapping for all the nodes in the graph for easy access as needed */\n\t\tMap<String, Node> U_map = new HashMap<String, Node>();\n\t\tfor(Node s : U){ \n\t\t\tU_map.put(s.x+\"|\"+s.y, s);\n\t\t}\n\t\tMap<String, Node> V_map = new HashMap<String, Node>();\n\t\tfor(Node c : V){ \n\t\t\tV_map.put(c.x+\"|\"+c.y, c);\n\t\t}\n\t\t\n\t\t/* BFS */\n\t\t// 1. Create a graph. The only way to access this graph is through set S\n\t\tNode z = null;\n\t\tMap<String, Node> mapping = new HashMap<String, Node>();\n\t\tSet<Node> S = new HashSet<Node>();\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tfor(int j = 0; j < N; j++){\n\t\t\t\tNode n;\n\t\t\t\tif(mapping.containsKey(i+\"|\"+j)){\n\t\t\t\t\tn = mapping.get(i+\"|\"+j);\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tn = new Node(i, j);\n\t\t\t\t\tmapping.put(i+\"|\"+j, n);\n\t\t\t\t}\n\t\t\t\tNode right = null;\n\t\t\t\tNode down = null;\n\t\t\t\t//right node\n\t\t\t\tif(j+1 < N){\n\t\t\t\t\tright = mapping.get(i+\"|\"+(j+1));\n\t\t\t\t\tif(right == null){\n\t\t\t\t\t\tright = new Node(i, j+1);\n\t\t\t\t\t}\n\t\t\t\t\tn.edges.add(new Edge(n, right));\n\t\t\t\t\tright.edges.add(new Edge(right, n));\n\t\t\t\t\tmapping.put(i+\"|\"+(j+1), right);\n\t\t\t\t}\n\t\t\t\t//bottom node\n\t\t\t\tif(i+1 < N){\n\t\t\t\t\tdown = mapping.get((i+1)+\"|\"+j);\n\t\t\t\t\tif(down == null){\n\t\t\t\t\t\tdown = new Node(i+1, j);\n\t\t\t\t\t}\n\t\t\t\t\tn.edges.add(new Edge(n, down));\n\t\t\t\t\tdown.edges.add(new Edge(down, n));\n\t\t\t\t\tmapping.put((i+1)+\"|\"+j, down);\n\t\t\t\t}\n\t\t\t\tif(scientists[i][j] == -1){\n\t\t\t\t\tn.scratch = -1;\n\t\t\t\t\tz = n;\n\t\t\t\t}\n\t\t\t\telse if(scientists[i][j] == -2){\n\t\t\t\t\tn.scratch = -2;\n\t\t\t\t}\n\t\t\t\telse if(scientists[i][j] == 0){\n\t\t\t\t\tn.scratch = 0;\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tS.add(n); //need to go through scientists to bfs\n\t\t\t\t\tn.scratch = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tGraph g1 = new Graph(null, null, new HashSet<Node>(mapping.values()));\n\t\t/* Find all the reachable nodes */\n\t\t\n\t\t/* Mark at which time the node was poisoned and mark at which time the bfs reached that block. \n\t\t * If bfs reached it <= the time there then we know it's possible!!! */\n\t\t/* If scientists are already positioned at capsules, mark them as reachable */\n\t\tSet<Node> frontier_of_poison = new HashSet<Node>();\n\t\tfrontier_of_poison.add(z);\n\t\tz.poisoned = 0;\n\t\tSet<String> visited_ = new HashSet<String>(); //optimization\n\t\tfor(int t = 1; t<= T; t++){\n\t\t\tSet<Node> next = new HashSet<Node>();\n\t\t\tfor(Node p : frontier_of_poison){\n\t\t\t\tfor(Edge e : p.edges)\n\t\t\t\t{\n\t\t\t\t\tNode adj = e.v; \n\t\t\t\t\tif(adj.scratch >= 0 && !visited_.contains(adj.x+\"|\"+adj.y)){ /* mark all the reachable capsules with the time they are poisoned, all non-poisonable capsules are -1 */\n\t\t\t\t\t\tNode to_poison = V_map.get(adj.x+\"|\"+adj.y);\n\t\t\t\t\t\tadj.poisoned = t; //poison so that when we bfs, we check if the node visiting has been poisoned at an earlier time\n\t\t\t\t\t\tnext.add(adj);\n\t\t\t\t\t\tif(to_poison != null){\n\t\t\t\t\t\t\tto_poison.poisoned = t; \n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tvisited_.add(adj.x+\"|\"+adj.y);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfrontier_of_poison = next;\n\t\t}\n\t\t\n\t\tfor(Node c : V){\n\t\t\tNode s = U_map.get(c.x+\"|\"+c.y);\n\t\t\tif(s != null){\n\t\t\t\ts.reachable_capsules.put(c.x+\"|\"+c.y, 0);\n\t\t\t}\n\t\t}\n\t\tfor(Node s : S){\n\t\t\tMap<String, Integer> visited = new HashMap<String, Integer>(); //marks t (distance)\n\t\t\tQueue<Node> q = new LinkedList<Node>();\n\t\t\t\n\t\t\tNode original = U_map.get(s.x+\"|\"+s.y);\n\t\t\t\n\t\t\tq.add(s);\n\t\t\tvisited.put(s.x+\"|\"+s.y, 0);\n\t\t\twhile(!q.isEmpty()){\n\t\t\t\tNode curr = q.remove();\n\t\t\t\tint t_at_curr = visited.get(curr.x+\"|\"+curr.y);\n\t\t\t\tif(t_at_curr > T) break;\n\t\t\t\tfor(Edge e : curr.edges){\n\t\t\t\t\tNode adj = e.v; \n\t\t\t\t\tif(!visited.containsKey(adj.x+\"|\"+adj.y) && adj.scratch >=0 ){\n\t\t\t\t\t\tvisited.put(adj.x+\"|\"+adj.y, (t_at_curr + 1)); /* adj is reachable at curr's t + 1 */\n\t\t\t\t\t\tif(adj.poisoned >= (t_at_curr + 1) || adj.poisoned == -1){\n\t\t\t\t\t\t\tif(adj.poisoned != t_at_curr + 1) q.add(adj);\n\t\t\t\t\t\t\tif(capsules[adj.x][adj.y] > 0 && t_at_curr < T){ /* Only mark as reachable if there is even a capsule at that block */\n\t\t\t\t\t\t\t\toriginal.reachable_capsules.put(adj.x+\"|\"+adj.y, (t_at_curr + 1) ); /* All of this for this one line ^^; */\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\t\t\n\t\t\n\t\t/*Now supposedly we have marked all the nodes where they can visit. */\n\t\t\n\t\t//Add edges from s to c\n\t\tfor(Node s: U){\n\t\t\tfor(Node c : V){\n\t\t\t\tInteger time_reached = s.reachable_capsules.get(c.x+\"|\"+c.y);\n\t\t\t\tif(time_reached != null ){\n\t\t\t\t\tEdge e = new Edge(s, c, Integer.MAX_VALUE, 0);\n\t\t\t\t\ts.edges.add(e);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\t//now create the maxflow graph\n\t\tU.addAll(V);\n\t\t//create a backward edge --> current_flow value useless\n\t\tfor(Node u: U){\n\t\t\tfor(Edge e: u.edges){\n\t\t\t\tEdge x = new Edge(e.v, e.u, 0, 0, true);\n\t\t\t\te.v.edges.add(x);\n\t\t\t\te.ref = x;\n\t\t\t}\n\t\t}\n\t\tGraph g = new Graph(src, sink, U);\n\t\tint max = g.ford_fulkerson();\n\t\tSystem.out.println(max);\n\t}\n\n\t/* create a graph with matrix. Do bfs from */\n\tpublic static class Node{\n\t\tint x; /* Indicate the position of the block */\n\t\tint y;\n\t\tMap<String, Integer> reachable_capsules; /* all the capsules the scientist can reach at time t */\n\t\tint scratch;\n\t\tint poisoned;\n\t\tboolean visited; /* used to compute the max flow */\n\t\tArrayList<Edge> edges;\n\t\t\n\t\tpublic Node(int x, int y){\n\t\t\tthis.x = x;\n\t\t\tthis.y = y;\n\t\t\tpoisoned = -1; /* -1 --> never poisoned, 0 <= t <= 60 time poisoned */\n\t\t\tvisited = false;\n\t\t\tedges = new ArrayList<Edge>();\n\t\t\treachable_capsules = new HashMap<String, Integer>();\n\t\t}\n\t\t\n\t\tpublic void addEdge(Edge e){\n\t\t\tthis.edges.add(e);\n\t\t}\n\t}\n\t\n\tpublic static class Edge{\n\t\tNode u, v;\n\t\tint remaining_capacity;\n\t\tboolean back;\n\t\tEdge ref;\n\t\t\n\t\tpublic Edge(Node u, Node v, int c, int f){\n\t\t\tthis.u = u;\n\t\t\tthis.v = v;\n\t\t\tthis.remaining_capacity = c;\n\t\t\tback = false;\n\t\t\tref = null;\n\t\t}\n\t\tpublic Edge(Node u, Node v, int c, int f, boolean b){\n\t\t\tthis.u = u;\n\t\t\tthis.v = v;\n\t\t\tthis.remaining_capacity = c;\n\t\t\tback = b;\n\t\t\tref = null;\n\t\t}\n\t\t/*For the simple graph to bfs */\n\t\tpublic Edge(Node u, Node v){\n\t\t\tthis.u = u;\n\t\t\tthis.v = v;\n\t\t}\n\t}\n\t\n\tpublic static class Graph{\n\t\tprivate Node s;\n\t\tprivate Node t;\n\t\tprivate Set<Node> nodes;\n\t\tpublic Graph(Node s, Node t, Set<Node> nodes){\n\t\t\tthis.s = s;\n\t\t\tthis.t = t;\n\t\t\tthis.nodes = nodes;\n\t\t}\n\t\t\n\t\tpublic void clearVisited(){\n\t\t\tfor(Node n : nodes)\n\t\t\t\tn.visited = false;\n\t\t\ts.visited = false;\n\t\t\tt.visited = false;\n\t\t}\n\t\t\t\t\t\n\t\tpublic int ford_fulkerson(){\n\t\t\tint max_flow = 0;\n\t\t int f;\n\t\t int x =1;\n\t\t\twhile ((f = get_augmenting_path(s, Integer.MAX_VALUE)) != 0){\n\t\t\t\tclearVisited();\n\t\t\t\tmax_flow += f;\t\n\t\t\t}\n\t\t return max_flow;\n\t\t}\n\n\t\t/* Finds an augmenting s-t path using dfs and adjusts the flow using the bottleneck found along that path*/\n\t\tpublic int get_augmenting_path(Node n, int bottleneck){\n\t\t\tif(n == t) //base case\n\t\t\t\treturn bottleneck;\n\t\t\tif(n.visited){\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tn.visited = true;\n\t\t\t\n\t\t\tint b;\n\t\t\tfor(Edge adj: n.edges){\n\t\t \t if((adj.remaining_capacity > 0) && !adj.v.visited){\n\t\t \t\t if(bottleneck > adj.remaining_capacity)\n\t\t \t\t \tbottleneck = adj.remaining_capacity; \n\t\t\t b = get_augmenting_path(adj.v, bottleneck);\n\t\t\t if(b > 0){\n\t\t\t \t\t\taugment(adj, b);\n\t\t\t\t return b;\n\t\t\t }\n\t\t \t }\n\t\t }\n\t\t return 0;\n\t\t}\n\t\t\n\t\tpublic void augment(Edge e, int bottleneck){\n\t\t\te.remaining_capacity -= bottleneck;\n\t\t\tif(e.ref != null) e.ref.remaining_capacity += bottleneck;\n\t\t}\n\t\n\t}\n\t\n}\n", "lang_cluster": "Java", "tags": ["flows", "graphs", "shortest paths"], "code_uid": "3b92a50d501a8749dad4c7812d31e4a9", "src_uid": "544de9c3729a35eb08c143b1cb9ee085", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class Main{\n public static void main (String[] args){\n Scanner scanner = new Scanner(System.in);\n int n= scanner.nextInt();\n String str = scanner.next();\n int count =0;\n if(str.length()>1) {\n for (int i = 0; i < str.length() - 1; i++) {\n if (str.charAt(i) != str.charAt(i + 1)) {\n i++;\n }\n count++;\n }\n if (str.length()>2) {\n if (str.charAt(str.length() - 1) == str.charAt(str.length() - 2)|| str.charAt(str.length() - 2) != str.charAt(str.length() - 3)) {\n System.out.print(count + 1);\n }else {\n System.out.print(count);\n }\n }else {\n System.out.print(count);\n }\n }else {\n System.out.print(1);\n }\n }\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "99ed7490cba73d7b685545c53269d56b", "src_uid": "986ae418ce82435badadb0bd5588f45b", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class a {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tlong hpy = in.nextInt();\n\t\tlong atky = in.nextInt();\n\t\tlong defy = in.nextInt();\n\t\tlong hpm = in.nextInt();\n\t\tlong atkm = in.nextInt();\n\t\tlong defm = in.nextInt();\n\t\tlong h = in.nextInt();\n\t\tlong a = in.nextInt();\n\t\tlong d = in.nextInt();\n\t\tlong min = Long.MAX_VALUE;\n\t\tfor(int def = 0; true;def++){\n\t\t\tlong dps = Math.max(0, atkm-defy-def);\n\t\t\tfor(int atk = 0; true;atk++){\n\t\t\t\tlong mydps = Math.max(0, atky+atk-defm);\n\t\t\t\tif(mydps==0)continue;\n\t\t\t\tlong secondsToKill = (hpm+mydps-1)/mydps;\n\t\t\t\tlong hpneeded = Math.max(0,(secondsToKill)*dps+1-hpy);\n\t\t\t\tlong cost = h*hpneeded+a*atk+d*def;\n\t\t\t\tif(cost<min){\n\t\t\t\t\tmin = cost;\n\t\t\t\t}\n\t\t\t\tif(secondsToKill==1)break;\n\t\t\t}\n\t\t\tif(dps==0)break;\n\t\t}\n\t\tSystem.out.println(min);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "implementation", "binary search"], "code_uid": "2adab866803866307d91ef74d8b7c608", "src_uid": "bf8a133154745e64a547de6f31ddc884", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n\npublic class solution {\n public static void merge(long arr[], int l, int m, int r) {\n int n1 = m - l + 1;\n int n2 = r - m;\n long L[] = new long[n1];\n long R[] = new long[n2];\n for (int i = 0; i < n1; ++i)\n L[i] = arr[l + i];\n for (int j = 0; j < n2; ++j)\n R[j] = arr[m + 1 + j];\n\n int i = 0, j = 0;\n\n int k = l;\n while (i < n1 && j < n2) {\n if (L[i] <= R[j]) {\n arr[k] = L[i];\n i++;\n } else {\n arr[k] = R[j];\n j++;\n }\n k++;\n }\n\n while (i < n1) {\n arr[k] = L[i];\n i++;\n k++;\n }\n\n\n while (j < n2) {\n arr[k] = R[j];\n j++;\n k++;\n }\n }\n\n public static void sort(long arr[], int l, int r) {\n if (l < r) {\n int m = (l + r) / 2;\n\n sort(arr, l, m);\n sort(arr, m + 1, r);\n\n merge(arr, l, m, r);\n }\n }\n\n public static boolean check(int n) {\n String s = \"\";\n s += n;\n for (int i = 0; i < s.length(); i++) {\n if (s.charAt(i) != '4' && s.charAt(i) != '7') {\n return false;\n }\n }\n return true;\n }\n\n public static int gcd(int a, int b) {\n if (b == 0) {\n return a;\n } else {\n return gcd(b, a % b);\n }\n }\n\n public static long findTrailingZeros(long n) {\n // Initialize result\n long count = 0;\n\n // Keep dividing n by powers\n // of 5 and update count\n for (long i = 5; n / i >= 1; i *= 5)\n count += n / i;\n\n return count;\n }\n\n public static int ceilSearch(long arr[], int low, int high, long x) {\n int mid;\n\n if (x <= arr[low])\n return low;\n if (x > arr[high])\n return -1;\n\n\n mid = (low + high) / 2;\n\n if (arr[mid] == x)\n return mid;\n\n\n else if (arr[mid] < x) {\n if (mid + 1 <= high && x <= arr[mid + 1])\n return mid + 1;\n else\n return ceilSearch(arr, mid + 1, high, x);\n } else {\n if (mid - 1 >= low && x > arr[mid - 1])\n return mid;\n else\n return ceilSearch(arr, low, mid - 1, x);\n }\n }\n\n public static double dis(double x, double x1, double y, double y1) {\n double dis = Math.sqrt(Math.pow((x - x1), 2) + Math.pow((y - y1), 2));\n return dis;\n }\n\n public static void main(String[] args) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n String s = br.readLine();\n StringBuilder s1 = new StringBuilder(s).reverse();\n if (!s.equals(s1.toString())) {\n System.out.println(s.length());\n } else {\n int count = 0;\n HashSet<Character> H = new HashSet<>();\n for (int i = 0; i < s.length(); i++) {\n H.add(s.charAt(i));\n }\n if (H.size() == 1) {\n System.out.println(0);\n }\n else{\n System.out.println(s.length()-1);\n }\n }\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "strings", "implementation"], "code_uid": "af84af7add6834d6e8f72ebea04229fe", "src_uid": "6c85175d334f811617e7030e0403f706", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.InputStream;\nimport java.math.BigInteger;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collection;\nimport java.util.Collections;\nimport java.util.HashSet;\n/**\n * Erasyl Abenov\n * \n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n try (PrintWriter out = new PrintWriter(outputStream)) {\n Task solver = new Task();\n solver.solve(1, in, out);\n }\n }\n}\n \nclass Task {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.nextInt();\n int m = in.nextInt();\n int g[][] = new int[n + 1][n + 1];\n int c[] = new int[n + 1];\n for(int i = 1; i <= n; ++i){\n g[i][i] = 1;\n }\n for(int i = 0; i < m; ++i){\n int x = in.nextInt();\n int y = in.nextInt();\n g[x][y] = 1;\n g[y][x] = 1;\n c[x]++;\n c[y]++;\n }\n char ans[] = new char[n + 1];\n Arrays.fill(ans, ' ');\n int f = 0;\n for(int i = 1; i <= n; ++i){\n if(c[i] == n - 1) ans[i] = 'b';\n }\n for(int i = 1; i <= n; ++i){\n if(ans[i] == ' '){\n ans[i] = 'a';\n for(int j = 1; j <= n; ++j){\n if(ans[j] == ' '){\n if(g[i][j] == 1) ans[j] = 'a';\n else ans[j] = 'c';\n }\n }\n }\n }\n for(int i = 1; i <= n; ++i){\n for(int j = 1; j <= n; ++j){\n if(i != j){\n if(Math.abs(ans[i] - ans[j]) == 2 && g[i][j] == 1 || \n (Math.abs(ans[i] - ans[j]) < 2 && g[i][j] == 0)){\n out.println(\"No\");\n return;\n }\n }\n }\n }\n out.println(\"Yes\");\n for(int i = 1; i <= n; ++i) out.print(ans[i]);\n }\n \n}\n\nclass InputReader {\n private final BufferedReader reader;\n private StringTokenizer tokenizer;\n \n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream));\n tokenizer = null;\n }\n \n public String nextLine() {\n try {\n return reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n \n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n tokenizer = new StringTokenizer(nextLine());\n }\n return tokenizer.nextToken();\n }\n public double nextDouble() {\n return Double.valueOf(next());\n }\n \n \n public int nextInt() {\n return Integer.parseInt(next());\n }\n public long nextLong() {\n return Long.parseLong(next());\n }\n public BigInteger nextBig() {\n return new BigInteger(next());\n }\n}\n class IOUtils {\n public static void readIntArrays(InputReader in, int[]... arrays) {\n for (int i = 0; i < arrays[0].length; i++) {\n for (int[] array : arrays) {\n array[i] = in.nextInt();\n }\n }\n }\n}", "lang_cluster": "Java", "tags": ["constructive algorithms", "graphs"], "code_uid": "e3454e0a3b7cd89fefd78f5fb31dc8c9", "src_uid": "e71640f715f353e49745eac5f72e682a", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.Comparator;\nimport java.util.Scanner;\n\npublic class Z {\n\n\tScanner in;\n\tPrintWriter out;\n\t\n\tprivate class line {\n\t\tint x1, y1, x2, y2;\n\t\tline(int x1, int y1, int x2, int y2) {\n\t\t\tthis.x1 = x1; this.y1 = y1;\n\t\t\tthis.x2 = x2; this.y2 = y2;\n\t\t}\n\t}\n\t\n\tvoid run() throws IOException {\n\t\t//in = new Scanner(new File(\"input.txt\"));\n\t\t//out = new PrintWriter(\"output.txt\");\n\t\tin = new Scanner(System.in);\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tline[] ln = new line[4];\n\t\t\n\t\tfor(int i = 0; i < 4; i++) {\n\t\t\tln[i] = new line(in.nextInt(), in.nextInt(), in.nextInt(), in.nextInt());\n\t\t}\n\t\t\n\t\tfor(int i = 0; i < 4; i++)\n\t\t\tfor(int j = 0; j < 4; j++)\n\t\t\t\tfor(int k = 0; k < 4; k++)\n\t\t\t\t\tfor(int h = 0; h < 4; h++) {\n\t\t\t\t\t\tif(i == j || i == k || i == h || j == k || j == h || k == h)\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\tif(ln[i].y1 != ln[i].y2 || ln[j].x1 != ln[j].x2 || ln[k].x1 != ln[k].x2 || ln[h].y1 != ln[h].y2)\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\tif(((ln[i].x1 == ln[h].x1) && (ln[i].y1 == ln[h].y1)) || ((ln[i].x1 == ln[h].x2) && (ln[i].y1 == ln[h].y2)))\n\t\t\t\t\t\t\tcontinue;\nif(((ln[j].x1 == ln[k].x1) && (ln[j].y1 == ln[k].y1)) || ((ln[j].x1 == ln[k].x2) && (ln[j].y1 == ln[k].y2)))\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\tint flag = 0;\n\t\t\t\t\t\tif((ln[i].x1 == ln[j].x1) && (ln[i].y1 == ln[j].y1) && (ln[h].x1 == ln[j].x2) && (ln[h].y1 == ln[j].y2) || (ln[i].x1 == ln[j].x2) && (ln[i].y1 == ln[j].y2) && (ln[h].x1 == ln[j].x1) && (ln[h].y1 == ln[j].y1))\n\t\t\t\t\t\t\tflag++;\n\t\t\t\t\t\tif((ln[i].x2 == ln[j].x1) && (ln[i].y2 == ln[j].y1) && (ln[h].x1 == ln[j].x2) && (ln[h].y1 == ln[j].y2) || (ln[i].x2 == ln[j].x2) && (ln[i].y2 == ln[j].y2) && (ln[h].x1 == ln[j].x1) && (ln[h].y1 == ln[j].y1))\n\t\t\t\t\t\t\tflag++;\n\t\t\t\t\t\tif((ln[i].x1 == ln[j].x1) && (ln[i].y1 == ln[j].y1) && (ln[h].x2 == ln[j].x2) && (ln[h].y2 == ln[j].y2) || (ln[i].x1 == ln[j].x2) && (ln[i].y1 == ln[j].y2) && (ln[h].x2 == ln[j].x1) && (ln[h].y2 == ln[j].y1))\n\t\t\t\t\t\t\tflag++;\n\t\t\t\t\t\tif((ln[i].x2 == ln[j].x1) && (ln[i].y2 == ln[j].y1) && (ln[h].x2 == ln[j].x2) && (ln[h].y2 == ln[j].y2) || (ln[i].x2 == ln[j].x2) && (ln[i].y2 == ln[j].y2) && (ln[h].x2 == ln[j].x1) && (ln[h].y2 == ln[j].y1))\n\t\t\t\t\t\t\tflag++;\n\t\t\t\t\t\tif(flag == 0)\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\tflag = 0;\n\t\t\t\t\t\tif((ln[i].x1 == ln[k].x1) && (ln[i].y1 == ln[k].y1) && (ln[h].x1 == ln[k].x2) && (ln[h].y1 == ln[k].y2) || (ln[i].x1 == ln[k].x2) && (ln[i].y1 == ln[k].y2) && (ln[h].x1 == ln[k].x1) && (ln[h].y1 == ln[k].y1))\n\t\t\t\t\t\t\tflag++;\n\t\t\t\t\t\tif((ln[i].x2 == ln[k].x1) && (ln[i].y2 == ln[k].y1) && (ln[h].x1 == ln[k].x2) && (ln[h].y1 == ln[k].y2) || (ln[i].x2 == ln[k].x2) && (ln[i].y2 == ln[k].y2) && (ln[h].x1 == ln[k].x1) && (ln[h].y1 == ln[k].y1))\n\t\t\t\t\t\t\tflag++;\n\t\t\t\t\t\tif((ln[i].x1 == ln[k].x1) && (ln[i].y1 == ln[k].y1) && (ln[h].x2 == ln[k].x2) && (ln[h].y2 == ln[k].y2) || (ln[i].x1 == ln[k].x2) && (ln[i].y1 == ln[k].y2) && (ln[h].x2 == ln[k].x1) && (ln[h].y2 == ln[k].y1))\n\t\t\t\t\t\t\tflag++;\n\t\t\t\t\t\tif((ln[i].x2 == ln[k].x1) && (ln[i].y2 == ln[k].y1) && (ln[h].x2 == ln[k].x2) && (ln[h].y2 == ln[k].y2) || (ln[i].x2 == ln[k].x2) && (ln[i].y2 == ln[k].y2) && (ln[h].x2 == ln[k].x1) && (ln[h].y2 == ln[k].y1))\n\t\t\t\t\t\t\tflag++;\n\t\t\t\t\t\tif(flag == 0)\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\tout.print(\"YES\");\n\t\t\t\t\t\tout.flush();\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\tout.print(\"NO\");\n\t\tout.flush();\n\t}\n\t\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew Z().run();\n\t}\n\n}", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "math", "implementation", "geometry"], "code_uid": "d934f3124c139f1a8c169befe3c8de34", "src_uid": "ad105c08f63e9761fe90f69630628027", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.util.concurrent.CountDownLatch;\nimport java.io.*;\n\npublic class Equalizing_by_Division_easy_version {\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tPrintWriter pw = new PrintWriter(System.out);\n\t\tStringTokenizer st = new StringTokenizer(br.readLine());\n\t\tint n = Integer.parseInt(st.nextToken());\n\t\tint k = Integer.parseInt(st.nextToken());\n\t\tInteger[] arr = new Integer[n];\n\t\tst = new StringTokenizer(br.readLine());\n\t\tint idx = 0;\n\t\tint max = -1;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint x = Integer.parseInt(st.nextToken());\n\t\t\tarr[i] = x;\n\t\t\tmax = Math.max(max, x);\n\t\t}\n\t\tint num = 0;\n\t\tint count = 0;\n\t\tint ans = Integer.MAX_VALUE;\n\t\tArrays.sort(arr);\n\t\t\n\t\tfor (int i = 1; i <= max; i++) {\n\t\t\tint steps=0;\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tcount=0;\n\t\t\t\tif (arr[j] == i) {\n\t\t\t\t\tnum++;\n\t\t\t\t\tif (num == k) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tcontinue;\n\t\t\t\t} else {\n\t\t\t\t\tint x = arr[j];\n\t\t\t\t\twhile (x > i) {\n\t\t\t\t\t\tx /= 2;\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t\tif (x == i) {\n\t\t\t\t\t\tnum++;\n\t\t\t\t\t\tsteps+=count;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (num == k) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t//System.out.println(count);\n\t\t\tif (num == k) {\n\t\t\t\tans = Math.min(ans, steps);\n\t\t\t}\n\t\t\tnum = 0;\n\t\t\tcount = 0;\n\t\t}\n\t\tpw.println(ans);\n\t\tpw.flush();\n\t\tpw.close();\n\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "11670f1a48c6e5b7b5454bb4210ee65b", "src_uid": "ed1a2ae733121af6486568e528fe2d84", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.Writer;\nimport java.io.BufferedWriter;\nimport java.io.OutputStreamWriter;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.math.BigInteger;\nimport java.util.Arrays;\nimport java.util.ArrayList;\nimport java.util.InputMismatchException;\nimport java.util.*;\nimport java.io.*;\nimport java.math.*;\nimport java.util.concurrent.TimeUnit;\npublic class check {\n public static int find(ArrayList<Integer> inp, int n, int target){\n Collections.sort(inp);\n Collections.reverse(inp);\n int res = 0;\n int num = n;\n for(int i = 0;i<n && num>0;i++){\n int curr = inp.get(i);\n int times = target/curr;\n if(target%curr != 0)\n times++;\n if(times*curr<=target)\n times++;\n if(times>num)\n return res;\n num = num-times;\n res++;\n }\n return res;\n }\n\n public static void main(String args[]) throws java.lang.Exception{\n Scanner in;\n try{\n in = new Scanner(new FileReader(\"./input.txt\"));\n }\n catch(Exception e){\n in = new Scanner(System.in);\n }\n int n = in.nextInt();\n n = n-1;\n\n if(n == 0){\n System.out.println(3);\n return;\n }\n if(n == 1){\n System.out.println(5);\n return;\n }\n \n long gp = (n-2)/3;\n long pos = (n-2)%3;\n\n long base = 5+gp*4;\n if(pos == 0){\n base = base+2;\n }\n else if(pos == 1)\n base = base+3;\n else\n base = base+4;\n\n System.out.println(base);\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "geometry", "binary search"], "code_uid": "0ef04e73122b775c34cda601b8a720b6", "src_uid": "d0a8604b78ba19ab769fd1ec90a72e4e", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.awt.*;\nimport java.awt.event.*;\nimport java.awt.geom.*;\nimport java.io.*;\nimport java.math.*;\nimport java.text.*; \nimport java.util.*;\n\n/*\nbr = new BufferedReader(new FileReader(\"input.txt\"));\npw = new PrintWriter(new BufferedWriter(new FileWriter(\"output.txt\")));\nbr = new BufferedReader(new InputStreamReader(System.in));\npw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n */\n\npublic class Main {\n private static BufferedReader br;\n private static StringTokenizer st;\n private static PrintWriter pw;\n\n public static void main(String[] args) throws IOException {\n br = new BufferedReader(new InputStreamReader(System.in));\n pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n //int qq = 1;\n int qq = Integer.MAX_VALUE;\n //int qq = readInt();\n for(int casenum = 1; casenum <= qq; casenum++) {\n int n = readInt();\n int k = readInt();\n int[] p = new int[n];\n int[] e = new int[n];\n for(int i = 0; i < n; i++) {\n p[i] = readInt();\n e[i] = readInt();\n }\n int ret = Integer.MAX_VALUE;\n for(int mask = 0; mask < 1 << n; mask++) {\n int points = Integer.bitCount(mask);\n int loser = n;\n int effort = 0;\n for(int i = 0; i < n; i++) {\n if((mask&(1<<i)) != 0) {\n effort += e[i];\n }\n else {\n p[i]++;\n }\n if(points > p[i] || (points == p[i] && (mask&(1<<i)) != 0)) {\n loser--;\n }\n if((mask&(1<<i)) == 0) {\n p[i]--;\n }\n }\n if(loser < k) {\n ret = Math.min(ret, effort);\n }\n }\n if(ret == Integer.MAX_VALUE) {\n ret = -1;\n }\n pw.println(ret);\n }\n pw.close();\n }\n\n private static void exitImmediately() {\n pw.close();\n System.exit(0);\n }\n\n private static long readLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n private static double readDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n private static int readInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n private static String nextToken() throws IOException {\n while(st == null || !st.hasMoreTokens()) {\n if(!br.ready()) {\n exitImmediately();\n }\n st = new StringTokenizer(br.readLine().trim());\n }\n return st.nextToken();\n }\n}\n\n\n", "lang_cluster": "Java", "tags": ["brute force"], "code_uid": "9dac80c1b2925380b67eb7627079d1db", "src_uid": "19a098cef100fc3652c59abf7c373814", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/**\n * DA-IICT\n * Author : Savaliya Sagar\n */\nimport java.io.*;\nimport java.math.*;\nimport java.util.*;\n\n\npublic class B900 {\n\tvoid solve() {\n\t\tint a = ni();\n\t\tint b = ni();\n\t\tint c = ni();\n\t\tHashSet<Integer> h = new HashSet<>();\n\t\tint p = 1;\n\t\twhile(true) {\n\t\t\ta *= 10;\n\t\t\tif(a/b==c) {\n\t\t\t\tout.println(p);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\ta = a%b;\n\t\t\tif(!h.add(a)) {\n\t\t\t\tout.print(-1);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tp++;\n\t\t}\n\t}\n\n\tvoid run() throws Exception {\n\t\tout = new PrintWriter(System.out);\n\t\treader = new BufferedReader(new InputStreamReader(System.in), 32768);\n\t\ttokenizer = null;\n\t\tsolve();\n\t\tout.flush();\n\t}\n\n\tBufferedReader reader;\n\tStringTokenizer tokenizer;\n\tPrintWriter out;\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tnew B900().run();\n\t}\n\tpublic int ni() {\n\t\treturn Integer.parseInt(next());\n\t}\n\tpublic String next() {\n\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\t}\n\t\treturn tokenizer.nextToken();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "e3fea1de449e19e36c5d1f9b456af120", "src_uid": "0bc7bf67b96e2898cfd8d129ad486910", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\npublic class a {\n public static void main(String[] args) {\n Scanner input = new Scanner(System.in);\n int n = input.nextInt();\n int[] dp = new int[n+1];\n for(int i = 1; i<=n; i++)\n {\n dp[i] = 2 + dp[i-1];\n if(i == 1) dp[i]--;\n if(i > 1) dp[i] += dp[i-2];\n dp[i] %= 1000000007;\n }\n System.out.println(dp[n]);\n }\n}", "lang_cluster": "Java", "tags": ["math", "dp"], "code_uid": "1336feb136bb4839d2c80585e08823cc", "src_uid": "5c4bd12df3915186a7b506c2060db125", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.awt.*;\nimport java.io.*;\nimport java.math.BigDecimal;\nimport java.math.BigInteger;\nimport java.util.*;\nimport java.util.List;\n\nimport static java.lang.Math.max;\nimport static java.lang.Math.min;\n\n\npublic class B implements Runnable{\n\n // SOLUTION!!!\n // HACK ME PLEASE IF YOU CAN!!!\n // PLEASE!!!\n // PLEASE!!!\n // PLEASE!!!\n\n private final static Random rnd = new Random();\n private final static String fileName = \"\";\n\n private final static String ENTER = \"+\", EXIT = \"-\";\n\n private void solve() {\n int n = readInt();\n int m = readInt();\n\n boolean[] canBeLeader = new boolean[n];\n Arrays.fill(canBeLeader, true);\n\n class Event {\n boolean enter;\n int index;\n\n public Event(String type, int index) {\n this.enter = ENTER.equals(type);\n this.index = index;\n }\n }\n\n Event[] inputEvents = new Event[m];\n for (int i = 0; i < m; ++i) {\n inputEvents[i] = new Event(readString(), readInt() - 1);\n }\n\n int startMeetingSize = 0;\n\n Set<Integer> wasBefore = new HashSet<>();\n\n boolean[] used = new boolean[n];\n for (Event inputEvent : inputEvents) {\n if (!inputEvent.enter && !used[inputEvent.index]) {\n wasBefore.add(inputEvent.index);\n }\n\n used[inputEvent.index] = true;\n }\n\n SortedSet<Integer> zeros = new TreeSet<>();\n\n int meetingSize = wasBefore.size();\n for (Event event : inputEvents) {\n if (event.enter) {\n if (meetingSize != 0) {\n canBeLeader[event.index] = false;\n } else {\n zeros.add(event.index);\n }\n\n ++meetingSize;\n } else {\n --meetingSize;\n\n if (meetingSize != 0) {\n canBeLeader[event.index] = false;\n } else {\n zeros.add(event.index);\n }\n }\n }\n\n if (zeros.size() > 1) {\n for (int index : zeros) {\n canBeLeader[index] = false;\n }\n } else if (zeros.size() == 1){\n int zeroEnter = zeros.first();\n\n if (wasBefore.size() > 0 && !wasBefore.contains(zeroEnter)) {\n canBeLeader[zeroEnter] = false;\n }\n }\n\n List<Integer> possibleLeaders = new ArrayList<>();\n for (int i = 0; i < n; ++i) {\n if (canBeLeader[i]) possibleLeaders.add(i);\n }\n\n out.println(possibleLeaders.size());\n for (int leader : possibleLeaders) {\n out.print((leader + 1) + \" \");\n }\n out.println();\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private final static boolean FIRST_INPUT_STRING = false;\n private final static boolean MULTIPLE_TESTS = true;\n private final boolean ONLINE_JUDGE = System.getProperty(\"ONLINE_JUDGE\") != null;\n\n private final static int MAX_STACK_SIZE = 128;\n\n private final static boolean OPTIMIZE_READ_NUMBERS = false;\n\n /////////////////////////////////////////////////////////////////////\n\n public void run(){\n try{\n timeInit();\n Locale.setDefault(Locale.US);\n\n init();\n\n if (ONLINE_JUDGE) {\n solve();\n } else {\n do {\n try {\n timeInit();\n solve();\n time();\n\n out.println();\n } catch (NumberFormatException e) {\n break;\n } catch (NullPointerException e) {\n if (FIRST_INPUT_STRING) break;\n else throw e;\n }\n } while (MULTIPLE_TESTS);\n }\n\n out.close();\n time();\n }catch (Exception e){\n e.printStackTrace(System.err);\n System.exit(-1);\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private BufferedReader in;\n private OutputWriter out;\n private StringTokenizer tok = new StringTokenizer(\"\");\n\n public static void main(String[] args){\n new Thread(null, new B(), \"\", MAX_STACK_SIZE * (1L << 20)).start();\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private void init() throws FileNotFoundException{\n Locale.setDefault(Locale.US);\n\n if (ONLINE_JUDGE){\n if (fileName.isEmpty()) {\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new OutputWriter(System.out);\n } else {\n in = new BufferedReader(new FileReader(fileName + \".in\"));\n out = new OutputWriter(fileName + \".out\");\n }\n }else{\n in = new BufferedReader(new FileReader(\"input.txt\"));\n out = new OutputWriter(\"output.txt\");\n }\n }\n\n ////////////////////////////////////////////////////////////////\n\n private long timeBegin;\n\n private void timeInit() {\n this.timeBegin = System.currentTimeMillis();\n }\n\n private void time(){\n long timeEnd = System.currentTimeMillis();\n System.err.println(\"Time = \" + (timeEnd - timeBegin));\n }\n\n private void debug(Object... objects){\n if (ONLINE_JUDGE){\n for (Object o: objects){\n System.err.println(o.toString());\n }\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private String delim = \" \";\n\n private String readLine() {\n try {\n return in.readLine();\n } catch (IOException e) {\n throw new RuntimeIOException(e);\n }\n }\n\n private String readString() {\n try {\n while(!tok.hasMoreTokens()){\n tok = new StringTokenizer(readLine());\n }\n\n return tok.nextToken(delim);\n } catch (NullPointerException e) {\n return null;\n }\n }\n\n /////////////////////////////////////////////////////////////////\n\n private final char NOT_A_SYMBOL = '\\0';\n\n private char readChar() {\n try {\n int intValue = in.read();\n\n if (intValue == -1){\n return NOT_A_SYMBOL;\n }\n\n return (char) intValue;\n } catch (IOException e) {\n throw new RuntimeIOException(e);\n }\n }\n\n private char[] readCharArray() {\n return readLine().toCharArray();\n }\n\n private char[][] readCharField(int rowsCount) {\n char[][] field = new char[rowsCount][];\n for (int row = 0; row < rowsCount; ++row) {\n field[row] = readCharArray();\n }\n\n return field;\n }\n\n /////////////////////////////////////////////////////////////////\n\n private long optimizedReadLong() {\n int sign = 1;\n long result = 0;\n boolean started = false;\n while (true) {\n try {\n int j = in.read();\n if (-1 == j) {\n if (started) return sign * result;\n throw new NumberFormatException();\n }\n\n if (j == '-') {\n if (started) throw new NumberFormatException();\n sign = -sign;\n }\n\n if ('0' <= j && j <= '9') {\n result = result * 10 + j - '0';\n started = true;\n } else if (started) {\n return sign * result;\n }\n } catch (IOException e) {\n throw new RuntimeIOException(e);\n }\n }\n }\n\n private int readInt() {\n\n if (!OPTIMIZE_READ_NUMBERS) {\n return Integer.parseInt(readString());\n } else {\n return (int) optimizedReadLong();\n }\n }\n\n private int[] readIntArray(int size) {\n int[] array = new int[size];\n\n for (int index = 0; index < size; ++index){\n array[index] = readInt();\n }\n\n return array;\n }\n\n private int[] readSortedIntArray(int size) {\n Integer[] array = new Integer[size];\n\n for (int index = 0; index < size; ++index) {\n array[index] = readInt();\n }\n Arrays.sort(array);\n\n int[] sortedArray = new int[size];\n for (int index = 0; index < size; ++index) {\n sortedArray[index] = array[index];\n }\n\n return sortedArray;\n }\n\n private int[] readIntArrayWithDecrease(int size) {\n int[] array = readIntArray(size);\n\n for (int i = 0; i < size; ++i) {\n array[i]--;\n }\n\n return array;\n }\n\n ///////////////////////////////////////////////////////////////////\n\n private int[][] readIntMatrix(int rowsCount, int columnsCount) {\n int[][] matrix = new int[rowsCount][];\n\n for (int rowIndex = 0; rowIndex < rowsCount; ++rowIndex) {\n matrix[rowIndex] = readIntArray(columnsCount);\n }\n\n return matrix;\n }\n\n private int[][] readIntMatrixWithDecrease(int rowsCount, int columnsCount) {\n int[][] matrix = new int[rowsCount][];\n\n for (int rowIndex = 0; rowIndex < rowsCount; ++rowIndex) {\n matrix[rowIndex] = readIntArrayWithDecrease(columnsCount);\n }\n\n return matrix;\n }\n\n ///////////////////////////////////////////////////////////////////\n\n private long readLong() {\n if (!OPTIMIZE_READ_NUMBERS) {\n return Long.parseLong(readString());\n } else {\n return optimizedReadLong();\n }\n }\n\n private long[] readLongArray(int size) {\n long[] array = new long[size];\n\n for (int index = 0; index < size; ++index){\n array[index] = readLong();\n }\n\n return array;\n }\n\n ////////////////////////////////////////////////////////////////////\n\n private double readDouble() {\n return Double.parseDouble(readString());\n }\n\n private double[] readDoubleArray(int size) {\n double[] array = new double[size];\n\n for (int index = 0; index < size; ++index){\n array[index] = readDouble();\n }\n\n return array;\n }\n\n ////////////////////////////////////////////////////////////////////\n\n private BigInteger readBigInteger() {\n return new BigInteger(readString());\n }\n\n private BigDecimal readBigDecimal() {\n return new BigDecimal(readString());\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private Point readPoint() {\n int x = readInt();\n int y = readInt();\n return new Point(x, y);\n }\n\n private Point[] readPointArray(int size) {\n Point[] array = new Point[size];\n\n for (int index = 0; index < size; ++index){\n array[index] = readPoint();\n }\n\n return array;\n }\n\n /////////////////////////////////////////////////////////////////////\n\n @Deprecated\n private List<Integer>[] readGraph(int vertexNumber, int edgeNumber) {\n @SuppressWarnings(\"unchecked\")\n List<Integer>[] graph = new List[vertexNumber];\n\n for (int index = 0; index < vertexNumber; ++index){\n graph[index] = new ArrayList<>();\n }\n\n while (edgeNumber-- > 0){\n int from = readInt() - 1;\n int to = readInt() - 1;\n\n graph[from].add(to);\n graph[to].add(from);\n }\n\n return graph;\n }\n\n private static class GraphBuilder {\n\n final int size;\n final List<Integer>[] edges;\n\n static GraphBuilder createInstance(int size) {\n List<Integer>[] edges = new List[size];\n for (int v = 0; v < size; ++v) {\n edges[v] = new ArrayList<>();\n }\n\n return new GraphBuilder(edges);\n }\n\n private GraphBuilder(List<Integer>[] edges) {\n this.size = edges.length;\n this.edges = edges;\n }\n\n public void addEdge(int from, int to) {\n addDirectedEdge(from, to);\n addDirectedEdge(to, from);\n }\n\n public void addDirectedEdge(int from, int to) {\n edges[from].add(to);\n }\n\n public int[][] build() {\n int[][] graph = new int[size][];\n for (int v = 0; v < size; ++v) {\n List<Integer> vEdges = edges[v];\n graph[v] = castInt(vEdges);\n }\n\n return graph;\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static class IntIndexPair {\n\n static Comparator<IntIndexPair> increaseComparator = new Comparator<B.IntIndexPair>() {\n\n @Override\n public int compare(B.IntIndexPair indexPair1, B.IntIndexPair indexPair2) {\n int value1 = indexPair1.value;\n int value2 = indexPair2.value;\n\n if (value1 != value2) return value1 - value2;\n\n int index1 = indexPair1.index;\n int index2 = indexPair2.index;\n\n return index1 - index2;\n }\n };\n\n static Comparator<IntIndexPair> decreaseComparator = new Comparator<B.IntIndexPair>() {\n\n @Override\n public int compare(B.IntIndexPair indexPair1, B.IntIndexPair indexPair2) {\n int value1 = indexPair1.value;\n int value2 = indexPair2.value;\n\n if (value1 != value2) return -(value1 - value2);\n\n int index1 = indexPair1.index;\n int index2 = indexPair2.index;\n\n return index1 - index2;\n }\n };\n\n int value, index;\n\n IntIndexPair(int value, int index) {\n super();\n this.value = value;\n this.index = index;\n }\n\n int getRealIndex() {\n return index + 1;\n }\n }\n\n private IntIndexPair[] readIntIndexArray(int size) {\n IntIndexPair[] array = new IntIndexPair[size];\n\n for (int index = 0; index < size; ++index) {\n array[index] = new IntIndexPair(readInt(), index);\n }\n\n return array;\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static class OutputWriter extends PrintWriter {\n\n final int DEFAULT_PRECISION = 12;\n\n private int precision;\n private String format, formatWithSpace;\n\n {\n precision = DEFAULT_PRECISION;\n\n format = createFormat(precision);\n formatWithSpace = format + \" \";\n }\n\n OutputWriter(OutputStream out) {\n super(out);\n }\n\n OutputWriter(String fileName) throws FileNotFoundException {\n super(fileName);\n }\n\n int getPrecision() {\n return precision;\n }\n\n void setPrecision(int precision) {\n precision = max(0, precision);\n this.precision = precision;\n\n format = createFormat(precision);\n formatWithSpace = format + \" \";\n }\n\n String createFormat(int precision){\n return \"%.\" + precision + \"f\";\n }\n\n @Override\n public void print(double d){\n printf(format, d);\n }\n\n void printWithSpace(double d){\n printf(formatWithSpace, d);\n }\n\n void printAll(double...d){\n for (int i = 0; i < d.length - 1; ++i){\n printWithSpace(d[i]);\n }\n\n print(d[d.length - 1]);\n }\n\n @Override\n public void println(double d){\n printlnAll(d);\n }\n\n void printlnAll(double... d){\n printAll(d);\n println();\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static class RuntimeIOException extends RuntimeException {\n\n /**\n *\n */\n private static final long serialVersionUID = -6463830523020118289L;\n\n RuntimeIOException(Throwable cause) {\n super(cause);\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n //////////////// Some useful constants and functions ////////////////\n /////////////////////////////////////////////////////////////////////\n\n private static final int[][] steps = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};\n private static final int[][] steps8 = {\n {-1, 0}, {1, 0}, {0, -1}, {0, 1},\n {-1, -1}, {1, 1}, {1, -1}, {-1, 1}\n };\n\n private static boolean checkCell(int row, int rowsCount, int column, int columnsCount) {\n return checkIndex(row, rowsCount) && checkIndex(column, columnsCount);\n }\n\n private static boolean checkIndex(int index, int lim){\n return (0 <= index && index < lim);\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static boolean checkBit(int mask, int bit){\n return (mask & (1 << bit)) != 0;\n }\n private static boolean checkBit(long mask, int bit){\n return (mask & (1L << bit)) != 0;\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static long getSum(int[] array) {\n long sum = 0;\n for (int value: array) {\n sum += value;\n }\n\n return sum;\n }\n\n private static Point getMinMax(int[] array) {\n int min = array[0];\n int max = array[0];\n\n for (int index = 0, size = array.length; index < size; ++index, ++index) {\n int value = array[index];\n\n if (index == size - 1) {\n min = min(min, value);\n max = max(max, value);\n } else {\n int otherValue = array[index + 1];\n\n if (value <= otherValue) {\n min = min(min, value);\n max = max(max, otherValue);\n } else {\n min = min(min, otherValue);\n max = max(max, value);\n }\n }\n }\n\n return new Point(min, max);\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static int[] getPrimes(int n) {\n boolean[] used = new boolean[n];\n used[0] = used[1] = true;\n\n int size = 0;\n for (int i = 2; i < n; ++i) {\n if (!used[i]) {\n ++size;\n for (int j = 2 * i; j < n; j += i) {\n used[j] = true;\n }\n }\n }\n\n int[] primes = new int[size];\n for (int i = 0, cur = 0; i < n; ++i) {\n if (!used[i]) {\n primes[cur++] = i;\n }\n }\n\n return primes;\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static long lcm(long a, long b) {\n return a / gcd(a, b) * b;\n }\n\n private static long gcd(long a, long b) {\n return (a == 0 ? b : gcd(b % a, a));\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static class MultiSet<ValueType> {\n\n public static <ValueType> MultiSet<ValueType> createMultiSet() {\n Map<ValueType, Integer> multiset = new HashMap<>();\n return new MultiSet<>(multiset);\n }\n\n private final Map<ValueType, Integer> multiset;\n private int size;\n\n public MultiSet(Map<ValueType, Integer> multiset) {\n this.multiset = multiset;\n this.size = 0;\n }\n\n public int size() {\n return size;\n }\n\n public void inc(ValueType value) {\n int count = get(value);\n multiset.put(value, count + 1);\n\n ++size;\n }\n\n public void dec(ValueType value) {\n int count = get(value);\n if (count == 0) return;\n\n if (count == 1) multiset.remove(value);\n else multiset.put(value, count - 1);\n\n --size;\n }\n\n public int get(ValueType value) {\n Integer count = multiset.get(value);\n return (count == null ? 0 : count);\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static class IdMap<KeyType> extends HashMap<KeyType, Integer> {\n\n /**\n *\n */\n private static final long serialVersionUID = -3793737771950984481L;\n\n public IdMap() {\n super();\n }\n\n int getId(KeyType key) {\n Integer id = super.get(key);\n if (id == null) {\n super.put(key, id = size());\n }\n\n return id;\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static int[] castInt(List<Integer> list) {\n int[] array = new int[list.size()];\n for (int i = 0; i < array.length; ++i) {\n array[i] = list.get(i);\n }\n\n return array;\n }\n\n private static long[] castLong(List<Long> list) {\n long[] array = new long[list.size()];\n for (int i = 0; i < array.length; ++i) {\n array[i] = list.get(i);\n }\n\n return array;\n }\n}\n\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "a08e45990fceb02145c141e46c41e3e3", "src_uid": "a3a337c7b919e7dfd7ff45ebf59681b5", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.*;\n\n\npublic class A {\t\n\tBufferedReader reader;\n StringTokenizer tokenizer;\n PrintWriter out;\n\n int ans = Integer.MAX_VALUE/2;\n\tpublic void solve() throws IOException {\n int N = nextInt();\n\t\tString[] ss = reader.readLine().split(\" \");\n\t\tint[][] cards = new int[ss.length][];\n for (int i = 0; i < cards.length; i++) {\n int color = -1;\n switch (ss[i].charAt(0)) {\n case 'R':\n color = 0;\n break;\n case 'G':\n color = 1;\n break;\n case 'B':\n color = 2;\n break;\n case 'Y':\n color = 3;\n break;\n case 'W':\n color = 4;\n break;\n }\n cards[i] = new int[] {color, Character.getNumericValue(ss[i].charAt(1)) - 1};\n }\n\n dfs(cards, 0, 0, new boolean[5], new boolean[5]);\n out.println(ans);\n\t}\n\n public void dfs(int[][] cards, int colorIndex, int numIndex, boolean[] pColors, boolean[] pNums) {\n boolean OK = true;\n out: for (int i = 0; i < cards.length; i++) {\n for (int j = i+1; j < cards.length; j++) {\n if (cards[i][0] == cards[j][0] && cards[i][1] == cards[j][1]) continue;\n if (cards[i][0] != cards[j][0]) {\n if (pColors[cards[i][0]] || pColors[cards[j][0]]) continue;\n }\n if (cards[i][1] != cards[j][1]) {\n if (pNums[cards[i][1]] || pNums[cards[j][1]]) continue;\n }\n OK = false;\n break out;\n }\n }\n if (OK) {\n int tmpAns = 0;\n for (int i = 0; i < 5; i++) {\n if (pColors[i]) tmpAns++;\n if (pNums[i]) tmpAns++;\n }\n ans = Math.min(ans, tmpAns);\n return;\n }\n\n if (numIndex == 5) {\n return;\n }\n\n if (colorIndex == 5) {\n dfs(cards, colorIndex, numIndex+1, pColors, pNums);\n pNums[numIndex] = true;\n dfs(cards, colorIndex, numIndex+1, pColors, pNums);\n pNums[numIndex] = false;\n } else {\n dfs(cards, colorIndex+1, numIndex, pColors, pNums);\n pColors[colorIndex] = true;\n dfs(cards, colorIndex+1, numIndex, pColors, pNums);\n pColors[colorIndex] = false;\n }\n }\n\t\n\t/**\n\t * @param args\n\t */\n\tpublic static void main(String[] args) {\n\t\tnew A().run();\n\t}\n\t\n\tpublic void run() {\n try {\n reader = new BufferedReader(new InputStreamReader(System.in));\n tokenizer = null;\n out = new PrintWriter(System.out);\n solve();\n reader.close();\n out.close();\n } catch (Exception e) {\n e.printStackTrace();\n System.exit(1);\n }\n }\n\n int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n String nextToken() throws IOException {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n tokenizer = new StringTokenizer(reader.readLine());\n }\n return tokenizer.nextToken();\n }\n\n}\n", "lang_cluster": "Java", "tags": ["brute force", "implementation", "bitmasks"], "code_uid": "463d7bea93e3ff67368224ad301b8cd7", "src_uid": "3b12863997b377b47bae43566ec1a63b", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// package CodeForces;\n\nimport java.io.BufferedOutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.HashSet;\nimport java.util.InputMismatchException;\n\npublic class FlexingOP3A {\n\t\n\tpublic static long max_val = (long)1e10;\n\n\tpublic static void solve() {\n\t\tint w = s.nextInt();\n\t\tlong m = s.nextLong();\n\t\tif(w == 2) {\n\t\t\tout.println(\"YES\");\n\t\t\treturn;\n\t\t}\n\t\tif(w >= 4) {\n\t\t\t//BruteForces\n\t\t\tint max = 0;\n\t\t\tlong curr = 1;\n\t\t\twhile(max_val/w > curr) {\n\t\t\t\tmax++;\n\t\t\t\tcurr *= (long)w;\n\t\t\t}\n\t\t\tpowers = new long[max + 1];\n\t\t\tpowers[0] = 1;\n\t\t\tfor(int i = 1; i < max + 1; i++) {\n\t\t\t\tpowers[i] = powers[i - 1] * (long)w;\n\t\t\t}\n\t\t\tboolean ok = Recur(0, max + 1, m, 0);\n\t\t\tif(ok) {\n\t\t\t\tout.println(\"YES\");\n\t\t\t}else {\n\t\t\t\tout.println(\"NO\");\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\t//Meet in the middle\n\t\tint max = 10;\n\t\tfirst = new HashSet<Long>();\n\t\tsecond = new HashSet<Long>();\n\t\tpowerof3 = new long[21];\n\t\tpowerof3[0] = 1;\n\t\tfor(int i = 1; i <= 20; i++) {\n\t\t\tpowerof3[i] = powerof3[i - 1] * 3L;\n\t\t}\n\t\tRecur(0, max, true, 0);\n\t\tRecur(max + 1, 20, false, 0);\n\t\tif(first.contains(m) || second.contains(m)) {\n\t\t\tout.println(\"YES\");\n\t\t\treturn;\n\t\t}\n\t\tfor(Long x : first) {\n\t\t\tif(second.contains(x - m) || second.contains(x + m)) {\n\t\t\t\tout.println(\"YES\");\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tout.println(\"NO\");\n\t}\n\t\n\tpublic static HashSet<Long> first;\n\tpublic static HashSet<Long> second;\n\tpublic static long[] powerof3;\n\t\n\tpublic static void Recur(int power, int max, boolean type, long answer) {\n\t\tif(power == max + 1) {\n\t\t\tif(type) first.add(answer);\n\t\t\telse second.add(answer);\n\t\t\treturn;\n\t\t}\n\t\tlong curr = powerof3[power];\n\t\tRecur(power + 1, max, type, answer + curr);\n\t\tRecur(power + 1, max, type, answer);\n\t\tRecur(power + 1, max, type, answer - curr);\n\t}\n\n\tpublic static long[] powers;\n\tpublic static boolean Recur(int power, int max, long m, long curr) {\n\t\tif(m == curr) {\n\t\t\treturn true;\n\t\t}\n\t\tif(power == max) {\n\t\t\treturn false;\n\t\t}\n\t\tboolean ok = false;\n\t\tlong cur = powers[power];\n\t\tok |= Recur(power + 1, max, m, curr + cur);\n\t\tok |= Recur(power + 1, max, m, curr - cur);\n\t\tok |= Recur(power + 1, max, m, curr);\n\t\treturn ok;\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tnew Thread(null, null, \"Thread\", 1 << 27) {\n\t\t\tpublic void run() {\n\t\t\t\ttry {\n\t\t\t\t\tout = new PrintWriter(new BufferedOutputStream(System.out));\n\t\t\t\t\ts = new FastReader(System.in);\n\t\t\t\t\tsolve();\n\t\t\t\t\tout.close();\n\t\t\t\t} catch (Exception e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t\tSystem.exit(1);\n\t\t\t\t}\n\t\t\t}\n\t\t}.start();\n\t}\n\n\tpublic static PrintWriter out;\n\tpublic static FastReader s;\n\n\tpublic static class FastReader {\n\n\t\tprivate InputStream stream;\n\t\tprivate byte[] buf = new byte[4096];\n\t\tprivate int curChar, snumChars;\n\n\t\tpublic FastReader(InputStream stream) {\n\t\t\tthis.stream = stream;\n\t\t}\n\n\t\tpublic int read() {\n\t\t\tif (snumChars == -1) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (curChar >= snumChars) {\n\t\t\t\tcurChar = 0;\n\t\t\t\ttry {\n\t\t\t\t\tsnumChars = stream.read(buf);\n\t\t\t\t} catch (IOException E) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (snumChars <= 0) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn buf[curChar++];\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c)) {\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-') {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tint number = 0;\n\t\t\tdo {\n\t\t\t\tnumber *= 10;\n\t\t\t\tnumber += c - '0';\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn number * sgn;\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c)) {\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tlong sgn = 1;\n\t\t\tif (c == '-') {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tlong number = 0;\n\t\t\tdo {\n\t\t\t\tnumber *= 10L;\n\t\t\t\tnumber += (long) (c - '0');\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn number * sgn;\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] arr = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tarr[i] = this.nextInt();\n\t\t\t}\n\t\t\treturn arr;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] arr = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tarr[i] = this.nextLong();\n\t\t\t}\n\t\t\treturn arr;\n\t\t}\n\n\t\tpublic String next() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c)) {\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo {\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tpublic String nextLine() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c)) {\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo {\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t} while (!isEndofLine(c));\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tpublic boolean isSpaceChar(int c) {\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n\n\t\tpublic boolean isEndofLine(int c) {\n\t\t\treturn c == '\\n' || c == '\\r' || c == -1;\n\t\t}\n\n\t}\n\n\t\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "305925af80e7074d846f61af7d53b2f4", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n static MyScanner in;\n static PrintWriter out;\n //static Timer t = new Timer();\n\n public static void main(String[] args) throws IOException {\n in = new MyScanner();\n out = new PrintWriter(System.out, true);\n\n int w = in.nextInt(), m = in.nextInt();\n\n int[] arr = new int[100];\n int len = 0;\n\n while(m > 0) {\n arr[len++] = m % w;\n m /= w;\n }\n\n for(int i = 0; i < len; i++) {\n if(arr[i] == 0 || arr[i] == 1)\n continue;\n if(arr[i] == w || arr[i] == w - 1) {\n arr[i+1]++;\n continue;\n }\n\n out.println(\"NO\");\n return;\n }\n\n out.println(\"YES\");\n return;\n }\n}\n\n//<editor-fold defaultstate=\"collapsed\" desc=\"MyScanner\">\nclass MyScanner {\n\n private final BufferedReader br;\n private StringTokenizer st;\n\n public MyScanner() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n public MyScanner(String path) throws IOException {\n br = new BufferedReader(new FileReader(new File(path)));\n //br = new BufferedReader(new InputStreamReader(new FileInputStream(\n //new File(path)), \"cp1251\"));\n }\n\n String next() throws IOException {\n while (st == null || !st.hasMoreElements())\n st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n\n boolean hasNext() {\n if (st != null && st.hasMoreElements())\n return true;\n\n try {\n while (st == null || !st.hasMoreElements())\n st = new StringTokenizer(br.readLine());\n }\n catch (Exception e) {\n return false;\n }\n\n return true;\n }\n\n String[] nextStrings(int n) throws IOException {\n String[] arr = new String[n];\n for (int i = 0; i < n; i++)\n arr[i] = next();\n return arr;\n }\n\n int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n int[] nextInts(int n) throws IOException {\n int[] arr = new int[n];\n for (int i = 0; i < n; i++)\n arr[i] = nextInt();\n return arr;\n }\n\n int[][] next2Ints(int n, int m) throws IOException {\n int[][] arr = new int[n][m];\n for (int i = 0; i < n; i++)\n for (int j = 0; j < m; j++)\n arr[i][j] = nextInt();\n return arr;\n }\n\n long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n long[] nextLongs(int n) throws IOException {\n long[] arr = new long[n];\n for (int i = 0; i < n; i++)\n arr[i] = nextLong();\n return arr;\n }\n\n long[][] next2Longs(int n, int m) throws IOException {\n long[][] arr = new long[n][m];\n for (int i = 0; i < n; i++)\n for (int j = 0; j < m; j++)\n arr[i][j] = nextLong();\n return arr;\n }\n\n double nextDouble() throws IOException {\n return Double.parseDouble(next().replace(',', '.'));\n }\n\n double[] nextDoubles(int size) throws IOException {\n double[] arr = new double[size];\n for (int i = 0; i < size; i++)\n arr[i] = nextDouble();\n return arr;\n }\n\n boolean nextBool() throws IOException {\n String s = next();\n if (s.equalsIgnoreCase(\"true\") || s.equals(\"1\"))\n return true;\n\n if (s.equalsIgnoreCase(\"false\") || s.equals(\"0\"))\n return false;\n\n throw new IOException(\"Boolean expected, String found!\");\n }\n}\n//</editor-fold>\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "c4c91ff086635dd241621323d9e16995", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\npublic class cf3082C{\n public static void main(String[] args) throws IOException {\n \tScanner f = new Scanner(System.in);\n StringTokenizer st = new StringTokenizer(f.nextLine());\n int w = Integer.parseInt(st.nextToken());\n int m = Integer.parseInt(st.nextToken());\n f.close();\n \n //convert m to base w\n int r = m;\n int e = (int)(Math.log(r)/Math.log(w));\n int l = e;\n int[] digits = new int[l+2];\n while(e >= 0){\n \tif(r - Math.pow(w, e) >= 0){\n \t\tdigits[e] = (int)(r / Math.pow(w,e)) % w;\n \t}\n \te--;\n }\n /*for(int i = 0; i < l+2; i++){\n \tSystem.out.print(digits[i] + \" \" );\n }*/\n \n boolean works = true;\n for(int i = 0; i < l+1; i++){\n \tif(digits[i] >= w){\n \t\tdigits[i] %= w;\n \t\tdigits[i+1]++;\n \t}\n \tif(!(digits[i] == 0 || digits[i] == 1)){\n \t\tdigits[i]++;\n \t}\n \tif(digits[i] >= w){\n \t\tdigits[i] %= w;\n \t\tdigits[i+1]++;\n \t}\n }\n \n /*for(int i = 0; i < l+2; i++){\n \tSystem.out.print(digits[i] + \" \" );\n }*/\n for(int i = 0; i < l+2; i++){\n \tif(!(digits[i] == 0 || digits[i] == 1)){\n \t\tworks = false;\n \t\tbreak;\n \t}\n }\n \n if(works){\n \tSystem.out.println(\"YES\");\n }\n else{\n \tSystem.out.println(\"NO\");\n }\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "5f15bdf3ca109fda38776c3755ef5e60", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.BufferedWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\nimport java.util.Map;\nimport java.util.Set;\nimport java.util.StringTokenizer;\n\n\npublic class C {\n\n static StringTokenizer st;\n static BufferedReader br;\n static PrintWriter pw;\n public static void main(String[] args) throws IOException {\n br = new BufferedReader(new InputStreamReader(System.in));\n pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n long w = nextLong();\n long m = nextLong();\n long[]cnt = new long[200];\n int p = 0;\n while (m > 0) {\n long k = m % w;\n cnt[p] += k;\n m /= w;\n p++;\n }\n for (int i = 0; i < 105; i++) {\n if (cnt[i] > 1) {\n if (cnt[i]==w) {\n cnt[i] = 0;\n cnt[i+1]++;\n continue;\n }\n if (cnt[i]==w-1) {\n cnt[i] = -1;\n cnt[i+1]++;\n }\n else {\n System.out.println(\"NO\");\n return;\n }\n }\n }\n for (int i = 0; i <= 100; i++) {\n if (Math.abs(cnt[i]) > 1) {\n System.out.println(\"NO\");\n return;\n }\n }\n System.out.println(\"YES\");\n pw.close();\n }\n private static int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n private static long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n private static double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n private static String next() throws IOException {\n while (st==null || !st.hasMoreTokens())\n st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "93a0c1b6d14c87788f32bd13e89f328e", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport static java.lang.Math.*;\nimport java.util.*;\nimport java.util.function.*;\nimport java.lang.*;\n\npublic class Main {\n final static boolean debug = false;\n final static String fileName = \"\";\n final static boolean useFiles = false;\n\n public static void main(String[] args) throws FileNotFoundException {\n PrintWriter writer = new PrintWriter(System.out);\n new Task(new InputReader(System.in), writer).solve();\n writer.close();\n }\n}\n\nclass InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public byte nextByte() {\n return Byte.parseByte(next());\n }\n}\n\nclass Task {\n public void solve() {\n int w = in.nextInt();\n int m = in.nextInt();\n\n while (m != 0){\n if (m % w == 0 || m % w == 1){\n m /= w;\n }else if (m % w == w - 1){\n m = (m + 1) / w;\n }\n else{\n out.println(\"NO\");\n return;\n }\n }\n out.println(\"YES\");\n }\n\n private InputReader in;\n private PrintWriter out;\n\n Task(InputReader in, PrintWriter out) {\n this.in = in;\n this.out = out;\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "7b425ecde00ad985de35db590850af14", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.Random;\nimport java.util.StringTokenizer;\n\n/*\n1000000000 2\n1000000000 2\n */\npublic class E {\n\n\tpublic static void main(String[] args) {\n\t\tFastScanner fs=new FastScanner();\n\t\tlong w=fs.nextInt(), m=fs.nextInt();\n\t\tif (w<=3) {\n\t\t\tSystem.out.println(\"YES\");\n\t\t\treturn;\n\t\t}\n\t\tint nDigits=0;\n\t\tlong val=1;\n\t\tlong[] bases=new long[100];\n\t\twhile (val<=2e9) {\n\t\t\tbases[nDigits]=val;\n\t\t\tval*=w;\n\t\t\tnDigits++;\n\t\t}\n\t\tint[] values=new int[nDigits];\n\t\tArrays.fill(values, -1);\n\t\tlong curTotal=0;\n\t\tfor (int i=0; i<nDigits; i++) curTotal-=bases[i];\n\t\tboolean works=false;\n\t\touter:while (true) {\n\t\t\tint index=0;\n\t\t\twhile (true) {\n\t\t\t\tvalues[index]++;\n\t\t\t\tcurTotal+=bases[index];\n\t\t\t\t\n\t\t\t\t\n\t\t\t\tif (values[index]!=2) {\n\t\t\t\t\tif (Math.abs(curTotal)==m) {\n//\t\t\t\t\t\tSystem.out.println(\"Values: \"+Arrays.toString(values));\n\t\t\t\t\t\tworks=true;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tvalues[index]=-1;\n\t\t\t\tcurTotal-=bases[index]*3;\n\t\t\t\tindex++;\n\t\t\t\tif (index==nDigits) break outer;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(works?\"YES\":\"NO\");\n\t}\n\n\tstatic final Random random=new Random();\n\t\n\tstatic void ruffleSort(int[] a) {\n\t\tint n=a.length;//shuffle, then sort \n\t\tfor (int i=0; i<n; i++) {\n\t\t\tint oi=random.nextInt(n), temp=a[oi];\n\t\t\ta[oi]=a[i]; a[i]=temp;\n\t\t}\n\t\tArrays.sort(a);\n\t}\n\t\n\tstatic class FastScanner {\n\t\tBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st=new StringTokenizer(\"\");\n\t\tString next() {\n\t\t\twhile (!st.hasMoreTokens())\n\t\t\t\ttry {\n\t\t\t\t\tst=new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\t\t\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\tint[] readArray(int n) {\n\t\t\tint[] a=new int[n];\n\t\t\tfor (int i=0; i<n; i++) a[i]=nextInt();\n\t\t\treturn a;\n\t\t}\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t}\n\n\t\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "d75360f4b5da9bfbc8747f2e1de359af", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.File;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.math.BigInteger;\nimport java.util.Arrays;\nimport java.util.Scanner;\nimport java.util.Stack;\nimport java.util.StringTokenizer;\nimport java.util.Vector;\n\npublic class sd {\n\t\n\tpublic static long max(long num, long num2)\n\t{\n\t\treturn 1;\n\t}\n\tpublic static void main(String[] args) throws IOException{\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n\t\tScanner s = new Scanner(System.in);\n\t\t\t//String s1 = br.readLine();\n\t\t\tint w = s.nextInt();\n\t\t\tint m = s.nextInt();\n\t\t\tboolean flag = true;\n\t\t\tint[] arr = new int[40];\n\t\t\tfor(int i =0;i<35;i++)\n\t\t\t\tarr[i] = 0;\n\t\t\tint cntr = 0;\n\t\t\twhile(m>0)\n\t\t\t{\n\t\t\t\tarr[cntr++] = m%w;\n\t\t\t\tm = m/w;\n\t\t\t}\n\t\t\tfor(int i=0;i<=cntr;i++)\n\t\t\t{\n\t\t\t\tif(arr[i]!=0&&arr[i]!=1&&arr[i]!=w&&arr[i]!=w-1)\n\t\t\t\t{\n\t\t\t\t\tflag = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif(arr[i]==w||arr[i]==w-1)\n\t\t\t\t\t{\n\t\t\t\t\t\tarr[i+1]++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(flag)\n\t\t\t\tSystem.out.println(\"YES\");\n\t\t\telse System.out.println(\"NO\");\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "bd721fe798bfa67bfca447595daf266a", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class CF552C{ \n public static int k, w;\n public static HashSet<Long> set;\n public static void main(String[] args)throws Exception {\n InputReader in = new InputReader(System.in);\n PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));\n \n w = in.nextInt();\n long n = in.nextLong();\n \n k = 0;\n for(int i = 0; w > 2 && i < 21; i++){\n k = i;\n if(Math.pow(w, i) > 1e9){\n break;\n }\n }\n \n set = new HashSet<Long>();\n if(w > 2) solve(0, 0);\n \n boolean bol = false;\n if(w == 2) bol = true;\n \n for(long i : set){\n if(i >= n && set.contains(i-n)){\n bol = true;\n break;\n }\n }\n \n if(bol) pw.println(\"YES\");\n else pw.println(\"NO\");\n \n pw.close();\n }\n \n static void solve(int i, long sum){\n if(i > k){\n set.add(sum);\n return;\n }\n \n solve(i+1, sum+(long)Math.pow(w, i));\n solve(i+1, sum);\n }\n \n \n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n \n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream));\n tokenizer = null;\n }\n \n public String next()throws Exception {\n while (tokenizer == null || !tokenizer.hasMoreTokens())\n tokenizer = new StringTokenizer(reader.readLine());\n return tokenizer.nextToken();\n }\n \n public String nextLine()throws Exception {\n String line = null;\n tokenizer = null;\n line = reader.readLine();\n return line;\n }\n \n public int nextInt()throws Exception {\n return Integer.parseInt(next());\n }\n \n public double nextDouble() throws Exception{\n return Double.parseDouble(next());\n }\n \n public long nextLong()throws Exception {\n return Long.parseLong(next());\n }\n \n }\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "f57f33ea603c9b1ee06a96712cfbed2d", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class R308qC {\n\n\tpublic static void main(String args[]) {\n\t\tInputReader in = new InputReader(System.in);\n\t\tPrintWriter p = new PrintWriter(System.out);\n\n\t\tint w = in.nextInt();\n\t\tint m = in.nextInt();\n\t\t\n\t\tif(w == 2){\n\t\t\tSystem.out.println(\"YES\");\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tlong up = (long)1e11;\n\t\t\n\t\tlong pow[] = new long[21];\n\t\tpow[0] = 1;\n\t\tint n = 21;\n\t\t\n\t\tfor(int i=1;i<21;i++){\n\t\t\tpow[i] = w * pow[i-1];\n\t\t\tif(pow[i] >= up){\n\t\t\t\tn = i + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t\tint state[] = new int[n];\n\t\t\n\t\tfor(int i=0;i<(1<<n);i++){\n\t\t\tlong left = m,right = 0;\n\t\t\tfor(int j=0;j<n;j++)\n\t\t\t\tif(((1<<j) & i) != 0){\n\t\t\t\t\tstate[j] = 1;\n\t\t\t\t\tleft += pow[j];\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tstate[j] = 0;\n\t\t\t\t\tright += pow[j];\n\t\t\t\t}\n\t\t\tlong left2 = left,right2 = right;\n\t\t\tif(left > right){\n\t\t\t\tlong diff = left - right;\n\t\t\t\tfor(int j=n-1;j>=0;j--){\n\t\t\t\t\tif(state[j] == 1 && pow[j] <= diff){\n\t\t\t\t\t\tdiff -= pow[j];\n\t\t\t\t\t\tleft -= pow[j];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(right > left){\n\t\t\t\tlong diff = right - left;\n\t\t\t\tfor(int j=n-1;j>=0;j--){\n\t\t\t\t\tif(state[j] == 0 && pow[j] <= diff){\n\t\t\t\t\t\tdiff -= pow[j];\n\t\t\t\t\t\tright -= pow[j];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(left == right){\n\t\t\t\tSystem.out.println(\"YES\");\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif(right2 > left2){\n\t\t\t\tlong diff = right2 - left2;\n\t\t\t\tfor(int j=n-1;j>=0;j--){\n\t\t\t\t\tif(state[j] == 0 && pow[j] <= diff){\n\t\t\t\t\t\tdiff -= pow[j];\n\t\t\t\t\t\tright2 -= pow[j];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(left2 > right2){\n\t\t\t\tlong diff = left2 - right2;\n\t\t\t\tfor(int j=n-1;j>=0;j--){\n\t\t\t\t\tif(state[j] == 1 && pow[j] <= diff){\n\t\t\t\t\t\tdiff -= pow[j];\n\t\t\t\t\t\tleft2 -= pow[j];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(left2 == right2){\n\t\t\t\tSystem.out.println(\"YES\");\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\t\n\t\tp.println(\"NO\");\n\t\tp.close();\n\t}\n\n\tstatic class InputReader {\n\n\t\tprivate InputStream stream;\n\t\tprivate byte[] buf = new byte[8192];\n\t\tprivate int curChar;\n\t\tprivate int snumChars;\n\t\tprivate SpaceCharFilter filter;\n\n\t\tpublic InputReader(InputStream stream) {\n\t\t\tthis.stream = stream;\n\t\t}\n\n\t\tpublic int snext() {\n\t\t\tif (snumChars == -1)\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tif (curChar >= snumChars) {\n\t\t\t\tcurChar = 0;\n\t\t\t\ttry {\n\t\t\t\t\tsnumChars = stream.read(buf);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (snumChars <= 0)\n\t\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn buf[curChar++];\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\tint c = snext();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = snext();\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-') {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = snext();\n\t\t\t}\n\n\t\t\tint res = 0;\n\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = snext();\n\t\t\t} while (!isSpaceChar(c));\n\n\t\t\treturn res * sgn;\n\t\t}\n\t\t\n\t\tpublic String readString() {\n\t\t\tint c = snext();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = snext();\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo {\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = snext();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tpublic boolean isSpaceChar(int c) {\n\t\t\tif (filter != null)\n\t\t\t\treturn filter.isSpaceChar(c);\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n\n\t\tpublic interface SpaceCharFilter {\n\t\t\tpublic boolean isSpaceChar(int ch);\n\t\t}\n\t}\n\t\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "59d9f281785131e7439eaf864051b15b", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic void solve() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong W = sc.nextLong();\n\t\tlong M = sc.nextLong();\n\t\tint cur = 0;\n\t\twhile (Math.pow(W, cur) < M) {\n\t\t\tcur++;\n\t\t}\n\t\tif (Math.pow(W, cur) == M) {\n\t\t\tSystem.out.println(\"YES\");\n\t\t\treturn;\n\t\t}\n\n\t\tlong MAX = (long) Math.pow(W, cur);\n\t\tlong sum = (MAX - 1) / (W - 1);\n\t\tif (MAX - sum == M) {\n\t\t\tSystem.out.println(\"YES\");\n\t\t\treturn;\n\t\t}\n\t\tif (dfs(W, M)) {\n\t\t\tSystem.out.println(\"YES\");\n\t\t} else {\n\t\t\tSystem.out.println(\"NO\");\n\t\t}\n\n\t}\n\n\tprivate boolean dfs(long W, long M) {\n\t\tif (M == 1) {\n\t\t\treturn true;\n\t\t}\n\t\tif (M % W == 0) {\n\t\t\treturn dfs(W, M / W);\n\t\t} else if ((M - 1) % W == 0) {\n\t\t\treturn dfs(W, (M - 1) / W);\n\t\t} else if ((M + 1) % W == 0) {\n\t\t\treturn dfs(W, (M + 1) / W);\n\t\t}\n\t\treturn false;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().solve();\n\t}\n\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "c847639328199c89fe4bf276a1490034", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\n\npublic class C {\n\t\n\tstatic class Scanner{\n\t\tBufferedReader br=null;\n\t\tStringTokenizer tk=null;\n\t\tpublic Scanner(){\n\t\t\tbr=new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\t\tpublic String next() throws IOException{\n\t\t\twhile(tk==null || !tk.hasMoreTokens())\n\t\t\t\ttk=new StringTokenizer(br.readLine());\n\t\t\treturn tk.nextToken();\n\t\t}\n\t\tpublic int nextInt() throws NumberFormatException, IOException{\n\t\t\treturn Integer.valueOf(next());\n\t\t}\n\t\tpublic long nextLong() throws NumberFormatException, IOException{\n\t\t\treturn Long.valueOf(next());\n\t\t}\n\t\tpublic double nextDouble() throws NumberFormatException, IOException{\n\t\t\treturn Double.valueOf(next());\n\t\t}\n\t}\n\t\n\tpublic static void main(String args[]) throws NumberFormatException, IOException {\n\t\tScanner sc = new Scanner();\n\t\tint W = sc.nextInt();\n\t\tif (W == 2) {\n\t\t\tSystem.out.println(\"YES\");\n\t\t\treturn;\n\t\t}\n\t\tint M = sc.nextInt();\n\t\tint[] d = new int[105];\n\t\tint exp = 0;\n\t\twhile(M > 0) {\n\t\t\td[exp] = M % W;\n\t\t\tM /= W;\n\t\t\texp++;\n\t\t}\n\t\tfor(int i = 0; i <= 100; i++){\n\t\t\tif (d[i] == (W - 1) || d[i] == W){\n\t\t\t\td[i + 1]++;\n\t\t\t}\n\t\t\telse if (d[i] > 1){\n\t\t\t\tSystem.out.println(\"NO\");\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tif (d[101] > 0)\n\t\t\tSystem.out.println(\"NO\");\n\t\telse\n\t\t\tSystem.out.println(\"YES\");\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "bbe4432646e575619a0e6b35db02e791", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\npublic class c {\npublic static void main(String[] args)\n{\n Scanner input = new Scanner(System.in);\n int w= input.nextInt(), m = input.nextInt();\n boolean good =true;\n ArrayList<Integer> digits = new ArrayList<Integer>();\n while(m > 0 && w != 2)\n {\n int x = m%w;\n if(x == w - 1) m++;\n else if(x == 1) m--;\n else if(x == 0) ;\n else good = false;\n //System.out.println(x);\n //digits.add(x);\n m /= w;\n }\n System.out.println(good ? \"YES\" : \"NO\");\n}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "96d20e47e732d2166490d27bafdf397d", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.Comparator;\nimport java.util.PriorityQueue;\n\npublic class Main {\n\n\tpublic static void main(String[] args)throws Exception {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString[] in = br.readLine().split(\" \");\n\t\tint w = Integer.parseInt(in[0]);\n\t\tint m = Integer.parseInt(in[1]);\n\t\tint[] num = new int[105];\n\t\tint ind = 0;\n\t\twhile(m!=0){\n\t\t\tnum[ind++]=m%w;\n\t\t\tm/=w;\n\t\t}\n\t\t\n\t\tboolean flag=true;\n\t\tfor(int i=0;i<101;i++){\n\t\t\tif(num[i]==0 || num[i]==1)continue;\n\t\t\tif(num[i]==w-1){\n\t\t\t\tint j=i+1;\n\t\t\t\tnum[j]++;\n\t\t\t\tnum[j]%=w;\n\t\t\t\twhile(num[j]==0){\n\t\t\t\t\tnum[++j]++;\n\t\t\t\t\tnum[j]%=w;\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tflag=false;\n\t\t\tbreak;\n\t\t}\n\t\tif(!flag)\n\t\t\tSystem.out.println(\"NO\");\n\t\telse\n\t\t\tSystem.out.println(\"YES\");\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "0902a7409c10e23eb163af71dd8d1c7d", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "\nimport java.util.*;\nimport java.io.*;\n\npublic class C\n{\n public static void main(String[] args)\n {\n PrintWriter out = new PrintWriter(System.out);\n new C(new FastScanner(), out);\n out.close();\n }\n\n long[] sum;\n long[] exp;\n\n boolean go(long val, int i)\n {\n if (val == 0) return true;\n if (i == -1) return false;\n if (val > sum[i] || val < -sum[i]) \n return false;\n\n boolean res = go(val+exp[i], i-1) || go(val-exp[i], i-1) || go(val, i-1);\n return res;\n }\n\n public C(FastScanner in, PrintWriter out)\n {\n int w = in.nextInt();\n int target = in.nextInt();\n if (w == 2 || w == 3)\n {\n out.println(\"YES\");\n return;\n }\n\n long max = Math.min(w*1L*(target+w), Long.MAX_VALUE/w);\n //System.out.println(max);\n int cap = 0;\n long ee = 1L;\n while (ee < max)\n {\n ee *= w;\n cap++;\n }\n cap++;\n\n sum = new long[cap];\n exp = new long[cap];\n cap = 0;\n ee = 1L;\n while (cap < sum.length)\n {\n exp[cap] = ee;\n if (cap > 0)\n sum[cap] = sum[cap-1];\n sum[cap] += ee;\n ee *= w;\n cap++;\n }\n //System.out.println(Arrays.toString(sum));\n //System.out.println(Arrays.toString(exp));\n out.println(go(target, cap-1) ? \"YES\" : \"NO\");\n }\n}\n\nclass FastScanner{\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n \n public FastScanner()\n {\n stream = System.in;\n }\n \n int read()\n {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars){\n curChar = 0;\n try{\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n \n boolean isSpaceChar(int c)\n {\n return c==' '||c=='\\n'||c=='\\r'||c=='\\t'||c==-1;\n }\n \n boolean isEndline(int c)\n {\n return c=='\\n'||c=='\\r'||c==-1;\n }\n \n int nextInt()\n {\n return Integer.parseInt(next());\n }\n \n long nextLong()\n {\n return Long.parseLong(next());\n }\n \n double nextDouble()\n {\n return Double.parseDouble(next());\n }\n \n String next(){\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do{\n res.appendCodePoint(c);\n c = read();\n }while(!isSpaceChar(c));\n return res.toString();\n }\n \n String nextLine(){\n int c = read();\n while (isEndline(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do{\n res.appendCodePoint(c);\n c = read();\n }while(!isEndline(c));\n return res.toString();\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "e50257b8f595745498ec19c6cd41d8a1", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Arrays;\nimport java.util.HashSet;\nimport java.util.Scanner;\n\npublic class Solution11 {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint w = sc.nextInt();\n\t\tint m = sc.nextInt();\n\t\tif(w < 4){\n\t\t\tSystem.out.println(\"YES\");\n\t\t\treturn;\n\t\t}\n\t\twhile(m>0){\n\t\t\tint remainder = m%w;\n\t\t\tint next = m+1;\n\t\t\tif(remainder > 1 && remainder != w-1){\n\t\t\t\tSystem.out.println(\"NO\");\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tm = next/w;\n\t\t}\n\t\tSystem.out.println(\"YES\");\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "5722273cddc74832d4881d0d9284a1a6", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n private static class FastReader {\n private BufferedReader reader;\n private StringTokenizer tokenizer;\n\n public FastReader(InputStream inputStream) {\n reader = new BufferedReader(new InputStreamReader(inputStream), 1 << 16);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n }\n catch (IOException ex) {\n throw new RuntimeException(ex);\n }\n }\n return tokenizer.nextToken();\n }\n\n public String nextLine() {\n try {\n return reader.readLine();\n }\n catch (IOException ex) {\n throw new RuntimeException(ex);\n }\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n }\n\n public static void main(String[] args) {\n FastReader in = new FastReader(System.in);\n PrintWriter out = new PrintWriter(System.out);\n\n int w = in.nextInt(), m = in.nextInt();\n boolean res = true;\n boolean isPrevUsed = false;\n while (m > 0) {\n if (m % w == 0 || m % w - 1 == 0) {\n m /= w;\n }\n else if (m % w + 1 == w) {\n m++;\n }\n else {\n res = false;\n break;\n }\n }\n out.println(res ? \"YES\" : \"NO\");\n\n out.flush();\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "70c25dd9a99a1cb78db8ac0947c3893d", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.IOException;\nimport java.util.StringTokenizer;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskC solver = new TaskC();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskC {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int w = in.nextInt(), m = in.nextInt(), n = 0;\n int[] a = new int[50];\n do {\n a[++n] = m % w;\n m /= w;\n } while (m > 0);\n\n boolean ok = true;\n for(int i = 1; i <= n;)\n if (a[i] > 1) {\n a[i] += 1;\n if (a[i] == w) {\n while (i <= n && a[i] >= w) {\n a[i] = 0;\n a[++i] += 1;\n }\n }\n else ++i;\n if (a[i-1] > 1) {\n ok = false; break;\n }\n } else ++i;\n if (ok) out.print(\"YES\"); else out.print(\"NO\");\n }\n}\n\nclass InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream));\n tokenizer = null;\n }\n\n public String next() {\n try {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n tokenizer = new StringTokenizer(reader.readLine());\n }\n return tokenizer.nextToken();\n } catch (Exception e) {\n throw new UnknownError(e.getMessage());\n }\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n}\n\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "254a0d1bae72a8ca968a8b8938f51ad2", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class CF552C {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint w = in.nextInt();\n\t\tint m = in.nextInt();\n\t\tin.close();\n\n\t\tint[] basew = new int[100];\n\t\t\n\t\tint counter = 0;\n\t\t\n\t\twhile (m > 0) {\n\t\t\tint rem = m % w;\n\t\t\tbasew[counter] = rem;\n\t\t\tm = m / w;\n\t\t\tcounter++;\n\t\t}\n\n\t\t//System.out.println(Arrays.toString(basew));\n\n\t\tfor (int i = 0; i < basew.length; i++) {\n\t\t\tif(basew[i] == 1 || basew[i] == 0 || basew[i] == -1) {\n\t\t\t\tcontinue;\n\t\t\t} else if(basew[i] == w - 1) {\n\t\t\t\tbasew[i] -= w;\n\t\t\t\tbasew[i + 1] = (basew[i + 1] + 1);\n\t\t\t} else if(basew[i] == w){\n\t\t\t\tbasew[i] = 0;\n\t\t\t\tbasew[i+1] = basew[i+1]+1;\n\t\t\t} else {\n\t\t\t\tSystem.out.println(\"NO\");\n\t\t\t\tSystem.exit(0);\n\t\t\t}\n\t\t}\n\t\t//System.out.println(Arrays.toString(basew));\n\t\tSystem.out.println(\"YES\");\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "33131318e1dfef9790f95c3efe7e642e", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.IOException;\n\npublic class C { \n \n static boolean convertAndCheck(int num, int base) {\n \n int [] digits = new int[50];\n\n int ind = 0;\n\n while(num > 0) { \n digits[ind++] = num%base;\n num/=base;\n }\n\n boolean succ = true;\n \n\n for(int i=0; i<ind; i++) {\n if(digits[i] > 1 && digits[i] < base - 1) { \nsucc = false;\nbreak;\n}\n\nif(digits[i] == base-1 || digits[i] == base) { \n // if its base-1 we add 1 and increase the next one by one\n // if its already increased we increase it\ndigits[i+1]++;\n} \n }\n\n return succ;\n }\n public static void main(String [] args) throws IOException { \n\n\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n \n int w, m; \n\n\n String [] parts = br.readLine().split(\" \");\n\n w = Integer.parseInt(parts[0]);\n m = Integer.parseInt(parts[1]);\n\n boolean isValid = convertAndCheck(m, w);\n\n if(isValid) { \n\n System.out.println(\"YES\");\n }else { \n System.out.println(\"NO\");\n }\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "b25719a432104b538f4c90ec0c31600f", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\nimport java.io.*;\npublic class C {\n static HashMap<Long, Boolean> cache = new HashMap<>();\n static boolean poss(int k, int m, int w) {\n // k = 0 ~ 100\n if (k == 0) {\n if (-1 <= m && m <= 1) return true;\n else return false;\n }\n long key = 101L * m + k;\n if (!cache.containsKey(key)) {\n boolean ret = false;\n for (int i = -1; i <= 1; i++) {\n if ((m + i) % w == 0) {\n int nm = (m + i) / w;\n if (poss(k - 1, nm, w)) {\n ret = true;\n break;\n }\n }\n }\n cache.put(key, ret);\n }\n return cache.get(key);\n }\n static void solve() {\n int w = in.nextInt();\n int m = in.nextInt();\n if (poss(100, m, w)) {\n out.println(\"YES\");\n } else {\n out.println(\"NO\");\n }\n for (int i = 0; i < 101; i++) {\n\n }\n\n }\n static PrintWriter out = new PrintWriter(System.out);\n static InputReader in = new InputReader(System.in);\n static void d(Object o) {\n out.println(o);\n out.flush();\n }\n public static void main(String args[]) {\n solve();\n out.close();\n }\n}\nclass InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n public InputReader(InputStream stream) {\n\treader = new BufferedReader(new InputStreamReader(stream), 32768);\n\ttokenizer = null;\n }\n public String next() {\n\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t try {\n\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t } catch (IOException e) {\n\t\tthrow new RuntimeException(e);\n\t }\n\t}\n\treturn tokenizer.nextToken();\n }\n public double nextDouble() {\n\treturn Double.parseDouble(next());\n }\n public long nextLong() {\n\treturn Long.parseLong(next());\n }\n public int nextInt() {\n\treturn Integer.parseInt(next());\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "6117b1d7ea1c9b0a5f8e610ee424368a", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.util.*;\n\n\npublic class Main {\n\n\tstatic IO io;\n\tstatic int n;\n\tstatic long mod = 1000000007L;\n\t\n\tpublic static void main(String args[]) throws Exception{\n\t\n\t\tio = new IO();\n\t\tio.init();\n\t\t\n\t\t//----------------------------------------\n\t\t\n\t\tlong w = io.nextLong();\n\t\tlong m = io.nextLong();\n\t\t\n\t\t\n\t\t\n\t\t\n\t\tlong res = m;\n\t\t\n\t\t\n\t\tint maxIndex = 100;\n\t\t\n\t\twhile( res > 0 && maxIndex >= 0 ){\n\t\t\n\t\t\t//System.out.println( res +\":\" + maxIndex);\n\t\t\tlong min = 1 ;\n\t\t\tlong max = 1;\n\t\t\t\n\t\t\tlong cur = 1;\n\n\t\t\tint i;\n\t\t\tfor( i = 1 ;i <= maxIndex ; ++i ){\n\t\t\t\n\t\t\t\t\n\t\t\t\tif( min == res || max == res || cur == res ){\n\t\t\t\t\tSystem.out.println(\"YES\");\n\t\t\t\t\tSystem.exit(0);\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t\n\t\t\t\tif( res < min ){\n\t\t\t\t\tSystem.out.println(\"NO\");\n\t\t\t\t\tSystem.exit(0);\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\t\n\n\t\t\t\tif( min < res && res < max){\n\t\t\t\t\n\t\t\t\t\tres = Math.abs( cur - res );\n\t\t\t\t\tmaxIndex = i-1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\telse{\n\t\t\t\t\t\n\t\t\t\t\tcur = cur*w;\n\t\t\t\t\t\n\t\t\t\t\tmin = cur - max;\n\t\t\t\t\tmax = cur + max;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\tif( i == maxIndex){\n\t\t\tif( min == res || max == res || cur == res ){\n\t\t\t\tSystem.out.println(\"YES\");\n\t\t\t\tSystem.exit(0);\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\tif( res < min ){\n\t\t\t\tSystem.out.println(\"NO\");\n\t\t\t\tSystem.exit(0);\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\n\t\t\tif( min < res && res < max){\n\t\t\t\n\t\t\t\tres = Math.abs( cur - res );\n\t\t\t\tmaxIndex = maxIndex-1;\n\t\t\t}\n\t\t\t\n\n\t\t\t}\n\t\t}\n\t\t\n\t\t\t\t\n\n\t\tSystem.out.println(\"NO\");\n\t\t\n\t\t\n\t\t\n\t\t//----------------------------------------\n\t\tio.destroy();\n\t}\n\t\n\n\t\n\tstatic long pow( long base , long exp){\n\t\t\n\t\tif( exp == 0 ) return 1;\n\t\t\n\t\tlong temp = pow( base,exp/2);\n\t\ttemp =temp*temp;\n\t\t\n\t\tif( exp%2 == 0 ) \n\t\t\treturn temp;\n\t\telse\n\t\t\treturn temp*base;\n\t}\n\t\n\tstatic class IO{\n\t\t\n\t\t\n\t\tBufferedReader reader;\n\t\tStringTokenizer tokenizer;\n\t\tPrintWriter writer;\n\n\t\tpublic void init() {\n\t\t\ttry {\n\t\t\t\treader = new BufferedReader(new InputStreamReader(System.in),8*1024);\n\t\t\t\twriter = new PrintWriter(System.out);\n\t\t\t} catch (Exception e) {\n\t\t\t\te.printStackTrace();\n\t\t\t\tSystem.exit(261);\n\t\t\t}\n\t\t}\n\n\t\tvoid destroy() {\n\t\t\twriter.close();\n\t\t\tSystem.exit(0);\n\t\t}\n\n\t\tvoid print(Object... objects) {\n\t\t\tfor (int i = 0; i < objects.length; i++) {\n\t\t\t\tif (i != 0)\n\t\t\t\t\twriter.print(' ');\n\t\t\t\twriter.print(objects[i]);\n\t\t\t}\n\t\t}\n\n\t\tvoid println(Object... objects) {\n\t\t\tprint(objects);\n\t\t\twriter.println();\n\t\t}\n\n\t\tString nextLine() throws IOException {\n\t\t\treturn reader.readLine();\n\t\t}\n\n\t\tString nextToken() throws IOException {\n\t\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens())\n\t\t\t\ttokenizer = new StringTokenizer(nextLine());\n\t\t\treturn tokenizer.nextToken();\n\t\t}\n\n\t\tint nextInt() throws NumberFormatException, IOException {\n\t\t\treturn Integer.parseInt(nextToken());\n\t\t}\n\n\t\tlong nextLong() throws NumberFormatException, IOException {\n\t\t\treturn Long.parseLong(nextToken());\n\t\t}\n\n\t\tdouble nextDouble() throws NumberFormatException, IOException {\n\t\t\treturn Double.parseDouble(nextToken());\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "b1ff3b6dee9670aa0670edde5aab0fb1", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String args[]){\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint w = sc.nextInt(), m = sc.nextInt();\n\t\tint a[] = new int[101];\n\t\t\n\t\tfor(int i=0;i<=100;i++){\n\t\t\ta[i] = m%w;\n\t\t\tm/=w;\n\t\t}\n\t\t\n\t\tint c = 0;\n\t\tboolean s = true;\n\t\tfor(int i=0;i<=100;i++){\n\t\t\ta[i] += c;\n\t\t\tc = a[i]/w;\n\t\t\ta[i] %= w;\n\t\t\t\n\t\t\tif(a[i]==1 || a[i]==0){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse if(a[i] == w-1){\n\t\t\t\tc = 1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\ts = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\t\n\t\tSystem.out.print(s && c!=1?\"YES\":\"NO\");\n\t\t\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "deb93dbd790865126a1ddf4bd6aff2a3", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.BufferedWriter;\nimport java.io.File;\nimport java.io.FileInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\nimport java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) throws Exception {\n Main main = new Main();\n main.run();\n }\n\n public void run() throws Exception {\n PrintWriter pr = null;\n InputReader sc = null;\n\n pr = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n sc = new InputReader(System.in);\n //sc = new InputReader(new FileInputStream(new File(\"input.txt\")));\n \n int n = sc.nextInt();\n int m = sc.nextInt();\n \n // convert m to index n\n List<Integer> radix = new ArrayList<Integer>();\n int k = m;\n while (k > 0) {\n radix.add(k%n);\n k /= n;\n }\n \n // prevent array overflow at the end\n radix.add(0);\n boolean res = true;\n for (int i = 0; i < radix.size()-1; i++) {\n int c = radix.get(i);\n if (c == 0 || c == 1 || c == n-1 || c == n) {\n if (c == n-1 || c == n) {\n radix.set(i+1, radix.get(i+1) + 1);\n }\n } else {\n res = false;\n break;\n }\n }\n \n if (res) {\n pr.println(\"YES\");\n } else {\n pr.println(\"NO\");\n }\n \n \n pr.close();\n }\n \n long pow(int a, int n) {\n long res = 1L;\n for (int i = 1; i <= n; i++) {\n res *= a;\n }\n return res;\n }\n \n \n static class InputReader {\n public BufferedReader reader;\n\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream));\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n }\n catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public float nextFloat() {\n return Float.parseFloat(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n }\n\n\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "e333a58f90a6494b791a60473ec92c1c", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\n\npublic class BasicJava\n{\n public static void main(String[] args)\n {\n Task Main = new Task();\n \n Main.solve();\n }\n \n public static class Task\n {\n public InputReader in = new InputReader(System.in);\n public PrintWriter out = new PrintWriter(System.out);\n \n public void solve()\n {\n int w = in.nextInt();\n int m = in.nextInt();\n \n int[] t = new int[110];\n \n int nr = 0;\n \n while (m > 0) {\n \n nr++; t[nr] = m % w;\n \n m = m / w;\n \n }\n \n for (int i = 1; i <= nr; i++)\n if (t[i] > w / 2) {\n \n t[i] = - (t[i] - w);\n \n t[i + 1] ++;\n \n \n }\n \n if (t[nr] == 1) nr++;\n \n for (int i = 1; i <= nr; i++)\n if (t[i] > 1) {\n \n System.out.println(\"NO\");\n \n System.exit(0);\n \n }\n \n System.out.println(\"YES\");\n \n }\n }\n \n static class InputReader\n {\n private InputStream stream;\n private byte[] buf = new byte[2048];\n private int curChar;\n private int numChars;\n \n public InputReader(InputStream stream)\n {\n this.stream = stream;\n }\n \n public int read()\n {\n if (numChars == -1)\n throw new UnknownError();\n if (curChar >= numChars)\n {\n curChar = 0;\n try\n {\n numChars = stream.read(buf);\n }\n catch (IOException e)\n {\n throw new UnknownError();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n \n public int peek()\n {\n if (numChars == -1)\n return -1;\n if (curChar >= numChars)\n {\n curChar = 0;\n try\n {\n numChars = stream.read(buf);\n }\n catch (IOException e)\n {\n return -1;\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar];\n }\n \n public void skip(int x)\n {\n while (x-- > 0)\n read();\n }\n \n public int nextInt()\n {\n return Integer.parseInt(next());\n }\n \n public long nextLong()\n {\n return Long.parseLong(next());\n }\n \n public String nextString()\n {\n return next();\n }\n \n public String next()\n {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuffer res = new StringBuffer();\n do\n {\n res.appendCodePoint(c);\n c = read();\n }\n while (!isSpaceChar(c));\n \n return res.toString();\n }\n \n public String nextLine()\n {\n StringBuffer buf = new StringBuffer();\n int c = read();\n while (c != '\\n' && c != -1)\n {\n if (c != '\\r')\n buf.appendCodePoint(c);\n c = read();\n }\n return buf.toString();\n }\n \n public double nextDouble()\n {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-')\n {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.')\n {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.')\n {\n c = read();\n double m = 1;\n while (!isSpaceChar(c))\n {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n \n public boolean hasNext()\n {\n int value;\n while (isSpaceChar(value = peek()) && value != -1)\n read();\n return value != -1;\n }\n \n private boolean isSpaceChar(int c)\n {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n \n }\n \n}", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "300edcb82ca12fbdbe19cd1336d797bd", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "//################################################################################################################\nimport java.io.BufferedWriter;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\nimport java.io.UnsupportedEncodingException;\nimport java.io.Writer;\nimport java.math.BigInteger;\nimport java.util.InputMismatchException;\n\n//################################################################################################################\npublic class R308D2C {\n\tpublic static void main(String[] args) {\n\t\tR308D2C c = new R308D2C();\n\t\tInputReader1 reader = c.new InputReader1(System.in);\n\t\tOutputWriter writer = c.new OutputWriter(System.out);\n\t\t// think about the brute-force approach\n\t\t// read input\n\t\t// code boundary conditions\n\t\tint w = reader.readInt();\n\t\tint m = reader.readInt();\n\t\tboolean ans = trysolve(w, m);\n\t\tif (ans) {\n\t\t\twriter.println(\"YES\");\n\t\t} else {\n\t\t\twriter.println(\"NO\");\n\t\t}\n\t\treader.close();\n\t\twriter.close();\n\t}\n\n\tpublic static boolean trysolve(int w, int m) {\n\t\treturn (w <= 3 || m == 1 || solve(w, m - 1) || solve(w, m) || solve(w,\n\t\t\t\tm + 1));\n\t}\n\n\tpublic static boolean solve(int w, int m) {\n\t\treturn (m % w == 0 && trysolve(w, m / w));\n\t}\n\n\tclass InputReader1 {\n\t\t// private final boolean finished = false;\n\n\t\tprivate InputStream stream;\n\t\tprivate byte[] buf = new byte[1024];\n\t\tprivate int curChar;\n\t\tprivate int numChars;\n\n\t\tpublic InputReader1(InputStream stream) {\n\t\t\tthis.stream = stream;\n\t\t}\n\n\t\tpublic int read() {\n\t\t\tif (numChars == -1)\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tif (curChar >= numChars) {\n\t\t\t\tcurChar = 0;\n\t\t\t\ttry {\n\t\t\t\t\tnumChars = stream.read(buf);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (numChars <= 0)\n\t\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn buf[curChar++];\n\t\t}\n\n\t\tpublic int peek() {\n\t\t\tif (numChars == -1)\n\t\t\t\treturn -1;\n\t\t\tif (curChar >= numChars) {\n\t\t\t\tcurChar = 0;\n\t\t\t\ttry {\n\t\t\t\t\tnumChars = stream.read(buf);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\treturn -1;\n\t\t\t\t}\n\t\t\t\tif (numChars <= 0)\n\t\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn buf[curChar];\n\t\t}\n\n\t\tpublic int readInt() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-') {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res * sgn;\n\t\t}\n\n\t\tpublic long readLong() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-') {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res * sgn;\n\t\t}\n\n\t\tpublic String readString() {\n\t\t\tint length = readInt();\n\t\t\tif (length < 0)\n\t\t\t\treturn null;\n\t\t\tbyte[] bytes = new byte[length];\n\t\t\tfor (int i = 0; i < length; i++)\n\t\t\t\tbytes[i] = (byte) read();\n\t\t\ttry {\n\t\t\t\treturn new String(bytes, \"UTF-8\");\n\t\t\t} catch (UnsupportedEncodingException e) {\n\t\t\t\treturn new String(bytes);\n\t\t\t}\n\t\t}\n\n\t\tpublic boolean isSpaceChar(int c) {\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n\n\t\tprivate String readLine0() {\n\t\t\tStringBuffer buf = new StringBuffer();\n\t\t\tint c = read();\n\t\t\twhile (c != '\\n' && c != -1) {\n\t\t\t\tif (c != '\\r')\n\t\t\t\t\tbuf.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\treturn buf.toString();\n\t\t}\n\n\t\tpublic String readLine() {\n\t\t\tString s = readLine0();\n\t\t\twhile (s.trim().length() == 0)\n\t\t\t\ts = readLine0();\n\t\t\treturn s;\n\t\t}\n\n\t\tpublic String readLine(boolean ignoreEmptyLines) {\n\t\t\tif (ignoreEmptyLines)\n\t\t\t\treturn readLine();\n\t\t\telse\n\t\t\t\treturn readLine0();\n\t\t}\n\n\t\tpublic BigInteger readBigInteger() {\n\t\t\ttry {\n\t\t\t\treturn new BigInteger(readString());\n\t\t\t} catch (NumberFormatException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t}\n\n\t\tpublic char readCharacter() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\treturn (char) c;\n\t\t}\n\n\t\tpublic double readDouble() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-') {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tdouble res = 0;\n\t\t\twhile (!isSpaceChar(c) && c != '.') {\n\t\t\t\tif (c == 'e' || c == 'E')\n\t\t\t\t\treturn res * Math.pow(10, readInt());\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tif (c == '.') {\n\t\t\t\tc = read();\n\t\t\t\tdouble m = 1;\n\t\t\t\twhile (!isSpaceChar(c)) {\n\t\t\t\t\tif (c == 'e' || c == 'E')\n\t\t\t\t\t\treturn res * Math.pow(10, readInt());\n\t\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t\tm /= 10;\n\t\t\t\t\tres += (c - '0') * m;\n\t\t\t\t\tc = read();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn res * sgn;\n\t\t}\n\n\t\tpublic boolean isExhausted() {\n\t\t\tint value;\n\t\t\twhile (isSpaceChar(value = peek()) && value != -1)\n\t\t\t\tread();\n\t\t\treturn value == -1;\n\t\t}\n\n\t\tpublic String next() {\n\t\t\treturn readString();\n\t\t}\n\n\t\tpublic boolean readBoolean() {\n\t\t\treturn readInt() == 1;\n\t\t}\n\n\t\tpublic void close() {\n\t\t\ttry {\n\t\t\t\tstream.close();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\t}\n\n\tclass OutputWriter {\n\t\tprivate final PrintWriter writer;\n\n\t\tpublic OutputWriter(OutputStream stream) {\n\t\t\twriter = new PrintWriter(new BufferedWriter(new OutputStreamWriter(\n\t\t\t\t\tstream)));\n\t\t}\n\n\t\tpublic OutputWriter(Writer writer) {\n\t\t\tthis.writer = new PrintWriter(writer);\n\t\t}\n\n\t\tpublic void println(String s) {\n\t\t\twriter.println(s);\n\t\t}\n\n\t\tpublic void println(int x) {\n\t\t\twriter.println(x);\n\t\t}\n\n\t\tpublic void print(int x) {\n\t\t\twriter.print(x);\n\t\t}\n\n\t\tpublic void println(long x) {\n\t\t\twriter.println(x);\n\t\t}\n\n\t\tpublic void printSpace() {\n\t\t\twriter.print(\" \");\n\t\t}\n\n\t\tpublic void close() {\n\t\t\twriter.close();\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "2be10078c61a24340eefbde057826258", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Scanner;\n\npublic class Solution {\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint w = scanner.nextInt();\n\t\tint m = scanner.nextInt();\n\n\t\twhile (m > 1) {\n\t\t\tif (m % w == 0)\n\t\t\t\tm = m / w;\n\t\t\telse if ((m + 1) % w == 0)\n\t\t\t\tm = (m + 1) / w;\n\t\t\telse if ((m - 1) % w == 0)\n\t\t\t\tm = (m - 1) / w;\n\t\t\telse\n\t\t\t\tbreak;\n\t\t}\n\n\t\tif (m > 1)\n\t\t\tSystem.out.println(\"NO\");\n\t\telse\n\t\t\tSystem.out.println(\"YES\");\n\n\t\tscanner.close();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "2f3dd4aaaa6a9a4df5fb8a25049ec3bb", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\nimport java.io.IOException;\nimport java.nio.file.Files;\nimport java.nio.file.Paths;\n\npublic class Main {\n\tstatic class Reader\n {\n final private int BUFFER_SIZE = 1 << 16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n \n public Reader()\n {\n din = new DataInputStream(System.in);\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n \n public Reader(String file_name) throws IOException\n {\n din = new DataInputStream(new FileInputStream(file_name));\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n \n public String readLine() throws IOException\n {\n byte[] buf = new byte[64]; // line length\n int cnt = 0, c;\n while ((c = read()) != -1)\n {\n if (c == '\\n')\n break;\n buf[cnt++] = (byte) c;\n }\n return new String(buf, 0, cnt);\n }\n \n public int nextInt() throws IOException\n {\n int ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do\n {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n \n if (neg)\n return -ret;\n return ret;\n }\n \n public long nextLong() throws IOException\n {\n long ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n if (neg)\n return -ret;\n return ret;\n }\n \n public double nextDouble() throws IOException\n {\n double ret = 0, div = 1;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n \n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n \n if (c == '.')\n {\n while ((c = read()) >= '0' && c <= '9')\n {\n ret += (c - '0') / (div *= 10);\n }\n }\n \n if (neg)\n return -ret;\n return ret;\n }\n \n private void fillBuffer() throws IOException\n {\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1)\n buffer[0] = -1;\n }\n \n private byte read() throws IOException\n {\n if (bufferPointer == bytesRead)\n fillBuffer();\n return buffer[bufferPointer++];\n }\n \n public void close() throws IOException\n {\n if (din == null)\n return;\n din.close();\n }\n }\n\t\n\tpublic static void main(String args[])throws IOException{\n\t\tReader in=new Reader();\n\t\tint w = in.nextInt();\n\t\tint m = in.nextInt();\n\t\tboolean ans=get(w,m)||get(w,m-1)||get(w,m+1);\n\t\tif(ans)\n\t\t\tSystem.out.println(\"YES\");\n\t\telse\n\t\t\tSystem.out.println(\"NO\");\n\t}\n\t\n\tstatic boolean get(int w,int m){\n\t\tif(m==0)\n\t\t\treturn true;\n\t\tif(m%w!=0)\n\t\t\treturn false;\n\t\tm=m/w;\n\t\tif(m==1)\n\t\t\treturn true;\n\t\treturn get(w,m)||get(w,m-1)||get(w,m+1);\n\t}\n}\n// 3,2 3,1 3,3", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "8a9c0a41b5bcf28daff6a7b59134242a", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class Main{\n\n BufferedReader in;\n StringTokenizer str = null;\n PrintWriter out;\n\n private String next() throws Exception{\n \twhile (str == null || !str.hasMoreElements())\n \t str = new StringTokenizer(in.readLine());\n \treturn str.nextToken();\n }\n\n private int nextInt() throws Exception{\n\t return Integer.parseInt(next());\n }\n\n private long nextLong() throws Exception {\n return Long.parseLong(next());\n }\n\n public void run() throws Exception{\n \tin = new BufferedReader(new InputStreamReader(System.in));\n \tout = new PrintWriter(System.out);\n\n long w = nextLong(), M = nextLong();\n if (w == 2) {\n out.println(\"YES\");\n out.close();\n return;\n }\n List<Long> a = new ArrayList<>();\n long p = 1;\n while(p <= M) {\n a.add(p);\n p *= w;\n }\n\n int n = a.size();\n // System.out.println(a);\n for(int mask = 0; mask < (1 << n); ++mask) {\n long sum = M;\n for(int i = 0; i < n; ++i) {\n if (((mask >> i) & 1) > 0) {\n sum += a.get(i);\n }\n }\n boolean ok = true;\n int j = 0;\n while(sum > 0) {\n int rem = (int)(sum % w);\n sum /= w;\n if (rem != 0 && rem != 1) {\n ok = false;\n break;\n }\n if (rem == 1 && ((mask >> j) & 1) > 0) {\n ok = false;\n break;\n }\n ++j;\n }\n if (ok) {\n out.println(\"YES\");\n out.close();\n return;\n }\n }\n\n out.println(\"NO\");\n out.close();\n }\n\n public static void main(String args[]) throws Exception{\n\t new Main().run();\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "f984bb3425f8999ea354e8bf274c4c95", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.FileInputStream;\nimport java.io.FileOutputStream;\nimport java.io.IOException;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String args[]) throws IOException {\n Scanner fi = new Scanner(System.in);\n PrintWriter fo = new PrintWriter(System.out);\n int w = fi.nextInt(), m = fi.nextInt(), res = 1;\n while (m != 0){\n int tmp = m % w;\n if (tmp == w - 1 && tmp != 1) m = (m + 1) / w;\n else \n if (tmp == 1) m /= w;\n else\n if (tmp != 0){\n res = 0;\n break;\n }\n else m /= w;\n }\n if (res == 1) fo.print(\"YES\");\n else fo.print(\"NO\");\n fi.close();\n fo.close();\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "75d6f70c6eb1c2c5f2da7a61daf36974", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.math.BigInteger;\nimport java.util.Scanner;\n\n\npublic class Main {\n \n private static int weight;\n private static int itemMass;\n private static boolean[] arr=new boolean[100];\n static{\n for(int i=0;i<100;i++)\n arr[i]=false;\n }\n public boolean isBalanced(){\n boolean isBalance=false;\n long pod1=itemMass, pod2=0;\n \n while(true){\n if(pod1>pod2){\n long nextMass=getMass(pod1-pod2);\n //System.out.println(\"Pod1 wieght is higher: \"+nextMass);\n if(nextMass!=0){\n pod2+=nextMass;\n }\n else\n break;\n }\n else if(pod1<pod2){\n long nextMass1=getMass(pod2-pod1);\n //System.out.println(\"Pod2 wieght is higher: \"+nextMass1);\n if(nextMass1!=0){\n pod1+=nextMass1;\n }\n else\n break;\n }\n else{\n isBalance=true;\n break;\n }\n }\n return isBalance;\n }\n \n public long getMass(long mass){\n long result;\n int logBase=(int) (Math.log(mass)/Math.log(weight));\n //System.out.println(\"Mass is \"+mass+\" log is: \"+logBase);\n //long sumTotal=((long) Math.pow(weight, logBase+1)-1)/(weight-1);\n \n BigInteger bi=new BigInteger(Integer.toString(weight));\n //System.out.println(bi.toString());\n bi=bi.pow(logBase+1);\n //System.out.println(bi.toString());\n bi=bi.subtract(new BigInteger(Integer.toString(1)));\n //System.out.println(bi.toString());\n bi=bi.divide(new BigInteger(Integer.toString(weight-1)));\n //System.out.println(bi.toString());\n long sumTotal=bi.longValue();\n \n //System.out.println(\"Mass is \"+mass+\" log is: \"+logBase+\" total mass is: \"+sumTotal+\" arr value: \"+arr[logBase+1]+\" \"+arr[logBase]);\n if(mass>sumTotal && !arr[logBase+1]){\n result=(int) Math.pow(weight, logBase+1);\n arr[logBase+1]=true;\n }\n else if(mass<=sumTotal && !arr[logBase]){\n result=(int) Math.pow(weight, logBase);\n arr[logBase]=true;\n }\n else{\n result=0;\n }\n \n return result; \n }\n \n public static void main(String[] args) {\n // TODO Auto-generated method stub\n Scanner sc=new Scanner(System.in);\n Main.weight=sc.nextInt();\n Main.itemMass=sc.nextInt();\n Main wb=new Main();\n \n if(wb.isBalanced())\n System.out.println(\"YES\");\n else\n System.out.println(\"NO\");\n }\n\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "f03cb3c36d08b8ce36a17bbe83e98536", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\npublic class question{\n\tpublic static void main(String args[])throws Exception{\n\t\tScanner sc = new Scanner(System.in);\n\t\tBigInteger w = new BigInteger(Integer.toString(sc.nextInt()));\n\t\tBigInteger m = new BigInteger(Integer.toString(sc.nextInt()));\n\t\tBigInteger num = (w.pow(101)).subtract(new BigInteger(\"1\"));\n\t\tBigInteger den = w.subtract(new BigInteger(\"1\"));\n\t\tBigInteger toAdd = num.divide(den);\n\t\tBigInteger target = m.add(toAdd);\n\t\tfor(int i=0; i<=101; i++){\n\t\t\tBigInteger digit = target.mod(w);\n\t\t\tint digitInt = digit.intValue();\n\t\t\tif(digitInt > 2){\n\t\t\t\tSystem.out.println(\"NO\");\n\t\t\t\treturn;\n\t\t\t}\n\t\t\ttarget = target.divide(w);\n\t\t}\n\t\tSystem.out.println(\"YES\");\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "9c1abab153806e127277c530cebbf226", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\npublic class Solution {\n public static boolean solve(int w,int m){\n return w<=3||m==1||trysolve(w,m-1)||trysolve(w,m+1)||trysolve(w,m);\n }\n public static boolean trysolve(int w,int m){\n return m%w==0 && solve(w,m/w);\n }\n public static void main(String[] args)throws IOException{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n PrintWriter out = new PrintWriter(System.out,true);\n StringTokenizer st = new StringTokenizer(br.readLine());\n int w = Integer.parseInt(st.nextToken());\n int m = Integer.parseInt(st.nextToken());\n if(solve(w,m))out.println(\"YES\");\n else out.println(\"NO\");\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "5d858068e28805dafd2b475a1bdfaab8", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Scanner;\n\npublic class VanyaandScales {\n\tstatic int w;\n\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tw = in.nextInt();\n\t\tint m = in.nextInt();\n\t\tint bitmask = 0;\n\t\tSystem.out.println(check(m, bitmask) ? \"YES\" : \"NO\");\n\n\t}\n\n\tpublic static boolean check(int m, int mask) {\n\t\t// System.out.println(m + \":\" + Integer.toBinaryString(mask));\n\t\tint pos = (int) Math.floor(Math.log(m) / Math.log(w));\n\t\tif (((mask >> pos) & 1) == 1)\n\t\t\treturn false;\n\t\tif (m - Math.pow(w, pos) == 0)\n\t\t\treturn true;\n\t\tboolean s1 = (((mask >> pos) & 1) == 1 ? false : check(\n\t\t\t\t(int) (m - Math.pow(w, pos)), mask | (1 << pos)));\n\t\tboolean s2 = ((mask >> (pos + 1)) & 1) == 1 ? false : check(\n\t\t\t\t(int) (Math.pow(w, pos + 1) - m), mask | (1 << (pos + 1)));\n\t\treturn s1 || s2;\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "91b0a2d96d0b850e5ecbf73bda362603", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author xwchen\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC {\n long[] sum = new long[105];\n long[] pw = new long[105];\n boolean OK = false;\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n long w = in.nextLong();\n long m = in.nextLong();\n long p = 1;\n int mx = 0;\n for (int i = 0; i < 100; ++i) {\n sum[i + 1] = p + sum[i];\n pw[i] = p;\n p *= w;\n if (p > 1L << 40) {\n mx = i;\n break;\n }\n }\n process(0, m, mx);\n out.println(OK ? \"YES\" : \"NO\");\n }\n\n void process(long cur, long target, int pos) {\n //System.out.println(\"cur = \" + cur + \" pos = \" + pos);\n\n if (cur == target) {\n OK = true;\n return;\n }\n long remaining = sum[pos + 1];\n long next = pw[pos];\n\n //System.out.println(\"remaining = \" + remaining + \" next = \" + next);\n if (cur - remaining > target) {\n } else if (cur + remaining < target) {\n } else {\n if (cur + sum[pos] < target) {\n process(cur + next, target, pos - 1);\n } else if (cur - sum[pos] > target) {\n process(cur - next, target, pos - 1);\n } else {\n process(cur, target, pos - 1);\n }\n }\n }\n\n }\n\n static class InputReader {\n private BufferedReader reader;\n private StringTokenizer tokenizer = new StringTokenizer(\"\");\n\n public InputReader(InputStream inputStream) {\n this.reader = new BufferedReader(\n new InputStreamReader(inputStream));\n }\n\n public String next() {\n while (!tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return tokenizer.nextToken();\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "56f3fd87ba243397d1b1f82ee67945ba", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\n// Problem : C. Vanya and Scales\n// Contest : Codeforces Round #308 (Div. 2)\n// URL : https://codeforces.com/contest/552/problem/C\n// Memory Limit : 256 MB\n// Time Limit : 1000 ms\n// Powered by CP Editor (https://github.com/cpeditor/cp-editor)\n\nimport java.io.*;\nimport java.util.*;\n\npublic class a {\n public static void main(String[] args) throws IOException {\n FastReader scan = new FastReader();\n //PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter(\"taming.out\")));\n PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n Task solver = new Task();\n //int t = scan.nextInt();\n int t = 1;\n for(int i = 1; i <= t; i++) solver.solve(i, scan, out);\n out.close();\n }\n static class Task {\n \tlong n, m;\n public void solve(int testNumber, FastReader sc, PrintWriter pw) {\n \t\tn = sc.nextInt();\n \t\tm = sc.nextInt();\n \t\tlong[] base = new long[32];\n \t\tfor(int i=0;i<30;i++){\n \t\t\tbase[i]=m%n;\n \t\t\tm/=n;\n \t\t}\n \t\tfor(int i=0;i<30;i++){\n \t\t\tif(base[i]<=1){\n \t\t\t\tcontinue;\n \t\t\t}\n \t\t\telse if(base[i]==n){\n \t\t\t\tbase[i+1]++;\n \t\t\t}\n \t\t\telse if(base[i]==n-1){\n \t\t\t\tbase[i+1]++;\n \t\t\t}\n \t\t\telse{\n \t\t\t\tpw.println(\"NO\");\n \t\t\t\treturn;\n \t\t\t}\n \t\t}\n \t\tpw.println(\"YES\");\n }\n\n }\n static class tup implements Comparable<tup>{\n int a, b,c;\n tup(){};\n tup(int a, int b, int c){\n this.a=a;\n this.b=b;\n this.c=c;\n }\n\n @Override\n public int compareTo( tup o2) {\n return o2.b!=b?Integer.compare(o2.b,b):Integer.compare(o2.a,a);\n }\n }\n static void shuffle(long[] a) {\n Random get = new Random();\n for (int i = 0; i < a.length; i++) {\n int r = get.nextInt(a.length);\n long temp = a[i];\n a[i] = a[r];\n a[r] = temp;\n }\n }\n static void shuffle(int[] a) {\n Random get = new Random();\n for (int i = 0; i < a.length; i++) {\n int r = get.nextInt(a.length);\n int temp = a[i];\n a[i] = a[r];\n a[r] = temp;\n }\n }\n static class FastReader {\n BufferedReader br;\n StringTokenizer st;\n\n public FastReader() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n public FastReader(String s) throws FileNotFoundException {\n br = new BufferedReader(new FileReader(new File(s)));\n }\n\n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n }\n\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "2a8dab0b6dc8619ab454d040f2e81001", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.util.function.BiFunction;\nimport java.util.stream.Stream;\n\npublic class Main implements Runnable {\n static final int MOD = (int) 1e9 + 7;\n static final int MI = (int) 1e9;\n static final long ML = (long) 1e18;\n static final Reader in = new Reader();\n static final PrintWriter out = new PrintWriter(System.out);\n StringBuilder answer = new StringBuilder();\n\n public static void main(String[] args) {\n new Thread(null, new Main(), \"persefone\", 1 << 32).start();\n }\n\n @Override\n public void run() {\n solve();\n printf();\n flush();\n }\n\n void solve() {\n int w = in.nextInt();\n int m = in.nextInt();\n if (w <= 3) {\n printf(\"YES\");\n return;\n }\n\n long limit = (long) 1e10;\n long x = 1;\n List<Long> list = new ArrayList<>();\n do {\n list.add(x);\n x *= w;\n } while (x <= limit);\n\n long[] a = list.stream().mapToLong(Long::longValue).toArray();\n int n = a.length;\n for (int i = 0; i < 1 << n; i++) {\n long v = m;\n for (int j = 0; j < n; j++) {\n if ((i & (1 << j)) > 0) {\n v += a[j];\n }\n }\n for (int j = n - 1; j >= 0; j--) {\n if ((i & (1 << j)) == 0) {\n if (v - a[j] >= 0) {\n v -= a[j];\n }\n }\n }\n if (v == 0) {\n printf(\"YES\");\n return;\n }\n }\n printf(\"NO\");\n }\n\n void printf() {\n out.print(answer);\n }\n\n void close() {\n out.close();\n }\n\n void flush() {\n out.flush();\n }\n\n void printf(Stream<?> str) {\n str.forEach(o -> add(o, \" \"));\n add(\"\\n\");\n }\n\n\n void printf(Object... obj) {\n printf(false, obj);\n }\n\n void printfWithDescription(Object... obj) {\n printf(true, obj);\n }\n\n\n private void printf(boolean b, Object... obj) {\n\n if (obj.length > 1) {\n for (int i = 0; i < obj.length; i++) {\n if (b) add(obj[i].getClass().getSimpleName(), \" - \");\n if (obj[i] instanceof Collection<?>) {\n printf((Collection<?>) obj[i]);\n } else if (obj[i] instanceof int[][]) {\n printf((int[][]) obj[i]);\n } else if (obj[i] instanceof long[][]) {\n printf((long[][]) obj[i]);\n } else if (obj[i] instanceof double[][]) {\n printf((double[][]) obj[i]);\n } else printf(obj[i]);\n }\n return;\n }\n\n if (b) add(obj[0].getClass().getSimpleName(), \" - \");\n printf(obj[0]);\n }\n\n void printf(Object o) {\n if (o instanceof int[])\n printf(Arrays.stream((int[]) o).boxed());\n else if (o instanceof char[])\n printf(new String((char[]) o));\n else if (o instanceof long[])\n printf(Arrays.stream((long[]) o).boxed());\n else if (o instanceof double[])\n printf(Arrays.stream((double[]) o).boxed());\n else if (o instanceof boolean[]) {\n for (boolean b : (boolean[]) o) add(b, \" \");\n add(\"\\n\");\n } else\n add(o, \"\\n\");\n }\n\n void printf(int[]... obj) {\n for (int i = 0; i < obj.length; i++) printf(obj[i]);\n }\n\n void printf(long[]... obj) {\n for (int i = 0; i < obj.length; i++) printf(obj[i]);\n }\n\n void printf(double[]... obj) {\n for (int i = 0; i < obj.length; i++) printf(obj[i]);\n }\n\n void printf(boolean[]... obj) {\n for (int i = 0; i < obj.length; i++) printf(obj[i]);\n }\n\n void printf(Collection<?> col) {\n printf(col.stream());\n }\n\n <T, K> void add(T t, K k) {\n if (t instanceof Collection<?>) {\n ((Collection<?>) t).forEach(i -> add(i, \" \"));\n } else if (t instanceof Object[]) {\n Arrays.stream((Object[]) t).forEach(i -> add(i, \" \"));\n } else\n add(t);\n add(k);\n }\n\n\n <T> void add(T t) {\n answer.append(t);\n }\n\n static class Reader {\n private BufferedReader br;\n private StringTokenizer st;\n\n Reader() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n Reader(String fileName) throws FileNotFoundException {\n br = new BufferedReader(new FileReader(fileName));\n }\n\n boolean isReady() throws IOException {\n return br.ready();\n }\n\n String next() {\n try {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n } catch (IOException e) {\n e.printStackTrace();\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n int[] nextIntArray(int n) {\n int[] arr = new int[n];\n for (int i = 0; i < n; i++)\n arr[i] = nextInt();\n return arr;\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n String nextLine() {\n String s = \"\";\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return s;\n }\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "9c83c17ec507ecdc38679cb9376ae10d", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.math.*;\nimport java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n PrintWriter printWriter = new PrintWriter(System.out);\n\n int w = scanner.nextInt(), m = scanner.nextInt();\n boolean flag = true;\n int sz = 0;\n int[] a = new int[40];\n\n for (int i = 0; i < 40; i++)\n {\n a[i] = 0;\n }\n\n while (m > 0)\n {\n a[sz++] = m % w;\n m /= w;\n }\n\n for (int i = 0; i < sz; i++)\n {\n if (a[i] != 1 && a[i] != 0 && a[i] != w - 1 && a[i] != w)\n {\n flag = false;\n break;\n }\n else if (a[i] == w || a[i] == w - 1)\n {\n a[i + 1]++;\n }\n }\n\n if (flag) {\n printWriter.println(\"YES\");\n }\n else {\n printWriter.println(\"NO\");\n }\n printWriter.close();\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "16dec7333d4a4859dd8660080f006d09", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.BufferedReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.InputStreamReader;\nimport java.io.IOException;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Alejandro Lopez\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n long w = in.nextInt();\n long m = in.nextInt();\n\n if (w == 2) {\n out.println(\"YES\");\n return;\n }\n\n long[] p = new long[30];\n p[0] = 1;\n int n = 1;\n while (n <= 20 && p[n - 1] * w < 1e12) {\n p[n] = p[n - 1] * w;\n ++n;\n }\n\n long[] sum = new long[1 << n];\n for (int i = 0; i < 1 << n; ++i) {\n for (int j = 0; j < n; ++j) {\n if ((i & (1 << j)) != 0) {\n sum[i] += p[j];\n }\n }\n }\n\n for (int i = 0; i < 1 << n; ++i) {\n long target = sum[i] + m;\n int lo = 0;\n int hi = (1 << n) - 1;\n while (lo <= hi) {\n int mid = (lo + hi) / 2;\n if (sum[mid] == target) {\n if ((mid & i) == 0) {\n out.println(\"YES\");\n return;\n } else {\n break;\n }\n } else if (sum[mid] < target) {\n lo = mid + 1;\n } else {\n hi = mid - 1;\n }\n }\n }\n\n out.println(\"NO\");\n }\n\n }\n\n static class InputReader {\n BufferedReader in;\n StringTokenizer tokenizer = null;\n\n public InputReader(InputStream inputStream) {\n in = new BufferedReader(new InputStreamReader(inputStream));\n }\n\n public String next() {\n try {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n tokenizer = new StringTokenizer(in.readLine());\n }\n return tokenizer.nextToken();\n } catch (IOException e) {\n return null;\n }\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "164c8f971f624507f07453e22b2ea7a4", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package codeforcespractice;\nimport java.io.*;\nimport java.util.*;\npublic class vanyaandscale {\nstatic long[] a;\nstatic boolean ans;\nstatic int n;\nstatic long leftsum,rightsum;\npublic static void main(String[] arg) throws Exception\n{\n BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st=new StringTokenizer(br.readLine());\n long w=Long.parseLong(st.nextToken());\n long m=Long.parseLong(st.nextToken());\n long limit=(long)1e11;\n a=new long[40];\n int z=1;\n long temp=1;\n a[0]=1;\n if(w<=3)\n {\n System.out.println(\"YES\");\n System.exit(0);\n }\n for(int i=1;i<16;i++)\n {\n a[z]=temp*w;\n temp=temp*w;\n if(temp>limit)\n {\n break;\n }\n z++;\n }\n \n leftsum=0;\n rightsum=m;\n n=z;\n pos(0);\n //System.out.println(\"hello\");\n if(ans)\n {\n System.out.println(\"YES\");\n }\n else\n {\n System.out.println(\"NO\");\n }\n \n}\npublic static void pos(int x)\n{\n if(x==n)\n {\n if(leftsum==rightsum)\n {\n //System.out.println(\"left sum is special \"+leftsum+\" rightsum is\"+rightsum);\n ans=true;\n }\n return;\n }\n //System.out.println(\"left sum is\"+leftsum+\" right sum is\"+rightsum);\n if(ans)\n {\n return;\n }\n else\n {\n for(int i=0;i<3;i++)\n {\n if(ans)\n {\n return;\n }\n if(i==1)\n {\n leftsum+=a[x];\n pos(x+1);\n leftsum-=a[x];\n }\n else if(i==2)\n {\n rightsum+=a[x];\n pos(x+1);\n rightsum-=a[x];\n }\n else\n {\n pos(x+1);\n }\n }\n }\n}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "e2400d0dfdc988c8114b8bb47d4c340e", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Scanner;\n\n\npublic class Proezd {\n\n\t/**\n\t * @param args\n\t */\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\n\t\tScanner in= new Scanner(System.in);\n\t\tlong w=in.nextLong();\n\t\tlong m=in.nextLong();\n\t\tlong z=m;\n\t\t\n\t\tlong u=1;\n\t\t\n\t\tboolean yeap=true;\n\t\tboolean flap=true;\n\tif (w!=2)\n\t\twhile(z/u!=1)\n\t\t{ u=u*w; \n\t\tif (z>=u){\n\t\t\tlong lo=z%u;\n\t\t\tif (lo==(u/w)||lo==(u-u/w))\n\t\t\t{\n\t\t\t\tif (lo==u/w) z=z-u/w;\n\t\t\t\tif (lo==u-u/w)z=z+u/w;\n\t\t\t}\n \n else if (lo==0) z=z;\n else flap=false;\n }\n \n \n \n\t\t\telse if (u>z)\n\t\t\t{\n\t\t\t\tlong no=u%z;\n\t\t\t\tif (no==u/w){ z=z+u/w;}\n else flap=false;\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\tif (!flap) {break;}\n\t\t}\n\t\nif (flap)\t\t\nSystem.out.print(\"YES\");\nelse System.out.print(\"NO\");\n\t\t}\n\t\t\t\n\t\n\t\t\t\n\t\t\n\t\t\n\t}", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "40213c35ac483fb00bcd5a91f0dfb668", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.FileReader;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.Map;\nimport java.util.StringTokenizer;\n\nimport javax.management.RuntimeErrorException;\n\npublic class Codeforces {\n\n StringTokenizer tok;\n BufferedReader in;\n PrintWriter out;\n\n final boolean OJ = System.getProperty(\"ONLINE_JUDGE\") != null;\n\n void init() {\n try {\n if (OJ) {\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n } else {\n in = new BufferedReader(new FileReader(\"input.txt\"));\n out = new PrintWriter(\"output.txt\");\n }\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n\n String readString() {\n try {\n while (tok == null || !tok.hasMoreTokens()) {\n tok = new StringTokenizer(in.readLine());\n }\n return tok.nextToken();\n } catch (Throwable t) {\n throw new RuntimeException(t);\n }\n }\n\n int readInt() {\n return Integer.parseInt(readString());\n }\n\n public static void main(String[] args) {\n new Codeforces().run();\n }\n\n void run() {\n init();\n solve();\n out.close();\n }\n \n void solve() {\n int w = readInt();\n int m = readInt();\n int[] a = new int[102];\n int rm = m;\n for (int i=0;i<=100;i ++) {\n a[i] = rm % w;\n rm /= w;\n }\n boolean[] need = new boolean[102];\n \n for (int i=0;i<=100;i++) {\n if (a[i] <= 1) continue;\n if (a[i] == w) {\n a[i + 1]++;\n continue;\n }\n if (a[i] != w - 1) {\n out.println(\"NO\");\n return;\n }\n a[i] = 0;\n a[i + 1]++;\n need[i] = true;\n }\n need[101] = true;\n \n for (int i=0;i<102;i++) {\n if (a[i] == 1 && need[i]) {\n out.println(\"NO\");\n return;\n }\n }\n out.println(\"YES\");\n }\n\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "5d37bfa9688646b909f5098387e5a0c3", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.IOException;\nimport java.util.InputMismatchException;\n\npublic class VanyaAndScales {\n public static void main(String[] args) {\n FasterScanner sc = new FasterScanner();\n \n int W = sc.nextInt();\n int M = sc.nextInt();\n \n int[] B = new int[101];\n int tmp = M;\n for (int i = 0; i < 100; i++) {\n \tB[i] = tmp % W;\n \ttmp /= W;\n }\n \n for (int i = 0; i < 100; i++) {\n \tif (B[i] > 1) {\n \t\tB[i] -= W;\n \t\tB[i + 1]++;\n \t}\n }\n \n for (int i = 0; i <= 100; i++) {\n \tif (B[i] < -1 || B[i] > 1) {\n \t\tSystem.out.println(\"NO\");\n \t\treturn;\n \t}\n }\n System.out.println(\"YES\");\n }\n \n\tpublic static class FasterScanner {\n\t\tprivate byte[] buf = new byte[1024];\n\t\tprivate int curChar;\n\t\tprivate int numChars;\n\n\t\tpublic int read() {\n\t\t\tif (numChars == -1)\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tif (curChar >= numChars) {\n\t\t\t\tcurChar = 0;\n\t\t\t\ttry {\n\t\t\t\t\tnumChars = System.in.read(buf);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (numChars <= 0)\n\t\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn buf[curChar++];\n\t\t}\n\n\t\tpublic String nextLine() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo {\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t} while (!isEndOfLine(c));\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tpublic String nextString() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo {\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-') {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res * sgn;\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-') {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res * sgn;\n\t\t}\n\t \n\t public int[] nextIntArray(int n) {\n\t int[] arr = new int[n];\n\t for (int i = 0; i < n; i++) {\n\t arr[i] = nextInt();\n\t }\n\t return arr;\n\t }\n \n\t\tpublic long[] nextLongArray(int n) {\n\t\t long[] arr = new long[n];\n\t\t for (int i = 0; i < n; i++) {\n\t\t arr[i] = nextLong();\n\t\t }\n\t\t return arr;\n\t\t}\n\n\t private boolean isSpaceChar(int c) {\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n\n\t\tprivate boolean isEndOfLine(int c) {\n\t\t\treturn c == '\\n' || c == '\\r' || c == -1;\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "9340d61aaafe6da417bbd3b700a55613", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*; \nimport java.math.*;\nimport java.io.*;\npublic class Main{static long[] hum;\n public static void main(String[] args) throws IOException {\n input.init(System.in);\n PrintWriter out = new PrintWriter(System.out);\n int w= input.nextInt();\n int m=input.nextInt();\n int flag=0;\n int fg=0;\n \n \n for(int i=1;i<=100;i++){\n if(m%w==0)\n m/=w;\n else if((m+1)%w==0)\n m=(m+1)/w;\n else if((m-1)%w==0)\n m=(m-1)/w;\n else{\n flag=1;\n break;}\n if(m==0)\n break;\n if(i==100&&(!(m==1||m==0)))\n flag=1;\n \n }\n if(flag==1)\n System.out.println(\"NO\");\n else\n System.out.println(\"YES\");\n \n }\n public static class input {\n static BufferedReader reader;\n static StringTokenizer tokenizer;\n \n /** call this method to initialize reader for InputStream */\n static void init(InputStream input) {\n reader = new BufferedReader(\n new InputStreamReader(input) );\n tokenizer = new StringTokenizer(\"\");\n }\n \n /** get next word */\n static String next() throws IOException {\n while ( ! tokenizer.hasMoreTokens() ) {\n //TODO add check for eof if necessary\n tokenizer = new StringTokenizer(\n reader.readLine() );\n }\n return tokenizer.nextToken();\n }\n \n static int nextInt() throws IOException {\n return Integer.parseInt( next() );\n }\n \n static double nextDouble() throws IOException {\n return Double.parseDouble( next() );\n }\n static long nextLong() throws IOException {\n return Long.parseLong( next() );\n }\n}\n} ", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "3b4e49cdcfcf9286dea4d360ac650a99", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\n\npublic class Main {\n public static void main(String[] args) throws NumberFormatException,\n IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n String[] tmp = br.readLine().split(\" \");\n int w = Integer.parseInt(tmp[0]), m = Integer.parseInt(tmp[1]);\n boolean ok = true;\n ArrayList<Integer> all = new ArrayList<Integer>();\n while (m != 0) {\n all.add(m % w);\n m /= w;\n }\n\n for (int i = 0; i < all.size(); ++i) {\n if (all.get(i) == 0 || all.get(i) == 1)\n continue;\n if (all.get(i) == w - 1) {\n int j = i + 1;\n while (j < all.size()) {\n if (all.get(j) == w - 1) {\n all.set(j, 0);\n } else {\n all.set(j, all.get(j) + 1);\n break;\n }\n ++j;\n }\n continue;\n }\n ok = false;\n break;\n }\n\n if (ok)\n System.out.println(\"YES\");\n else\n System.out.println(\"NO\");\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "619b4b88cad78b2d0b3aa7c430c505a1", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/* SEE wrick's comment in editorail section (nice explanation)\n\n*/\nimport java.io.*;\nimport java.util.*;\npublic class gfg{ \n \n static boolean solve(long w, long m) {\n return w <= 3 || m == 1 || trySolve(w, m-1) || trySolve(w, m) || trySolve(w, m+1) ;\n }\n\n static boolean trySolve(long w, long m) {\n return m%w == 0 && solve(w, m/w) ;\n }\n public static void main(String[] args){ \n PrintWriter out = new PrintWriter(System.out);\n long w = nl();\n long m = nl();\n if(solve(w,m)==true)\n out.println(\"YES\");\n else\n out.println(\"NO\");\n\n out.flush();\n } \n static FastReader sc=new FastReader(); \n \n static int ni(){\n int x = sc.nextInt();\n return(x);\n }\n static long nl(){\n long x = sc.nextLong();\n return(x);\n }\n static String n(){\n String str = sc.next();\n return(str);\n }\n static String ns(){\n String str = sc.nextLine();\n return(str);\n }\n static double nd(){\n double d = sc.nextDouble();\n return(d);\n }\n static class FastReader \n { \n BufferedReader br; \n StringTokenizer st; \n \n public FastReader() \n { \n br = new BufferedReader(new\n InputStreamReader(System.in)); \n } \n \n String next() \n { \n while (st == null || !st.hasMoreElements()) \n { \n try\n { \n st = new StringTokenizer(br.readLine()); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n } \n return st.nextToken(); \n } \n \n int nextInt() \n { \n return Integer.parseInt(next()); \n } \n \n long nextLong() \n { \n return Long.parseLong(next()); \n } \n \n double nextDouble() \n { \n return Double.parseDouble(next()); \n } \n \n String nextLine() \n { \n String str = \"\"; \n try\n { \n str = br.readLine(); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n return str; \n } \n } \n}", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "f1ff7f2d49009badf357bb66b595457b", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Scanner;\n\npublic class weight {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tfinal int w = scanner.nextInt();\n\t\tfinal int m = scanner.nextInt();\n\t\tlong[] weights = new long[100];\n\t\tlong[] wSums = new long[100];\n\t\tboolean[] used = new boolean[100];\n\t\tlong wt = 1, wSum = 0;\n\t\tfor (int i = 1; i < 100; i++, wt *= w) {\n\t\t\tweights[i] = wt;\n\t\t\twSum += wt;\n\t\t\twSums[i] = wSum;\n\t\t}\n\t\tboolean found = false;\n\t\tlong left = m;\n\t\t\n\t\tif (w == 2)\n\t\t\tfound = true;\n\t\t\n\t\tSEARCH: while (!found) {\n\t\t\tfor (int i = 0; i < 100; i++) {\n\t\t\t\tif (left <= weights[i]) {\n\t\t\t\t\t// see which side is closer\n\t\t\t\t\tif (weights[i] - left <= wSums[i - 1]) {\n\t\t\t\t\t\tif (used[i]) {\n\t\t\t\t\t\t\tbreak SEARCH;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tleft = weights[i] - left;\n\t\t\t\t\t\tused[i] = true;\n\t\t\t\t\t} else if (left <= wSums[i - 1]) {\n\t\t\t\t\t\tif (used[i - 1]) {\n\t\t\t\t\t\t\tbreak SEARCH;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tleft -= weights[i - 1];\n\t\t\t\t\t\tused[i - 1] = true;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tbreak SEARCH;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfound = (left == 0);\n\t\t}\n\t\tif (found)\n\t\t\tSystem.out.println(\"YES\");\n\t\telse\n\t\t\tSystem.out.println(\"NO\");\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "92ca507752736063a592e407d91a5a37", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package CF;\n\nimport java.io.BufferedReader;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class A {\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tint w = sc.nextInt(), m = sc.nextInt();\n\t\tint[] c = new int[35];\n\t\tint tmp = m, ind = 0;\n\t\tboolean f = true;\n\t\twhile (tmp > 0) {\n\t\t\tc[ind] += tmp % w;\n\t\t\tif(c[ind] == w){\n\t\t\t\tc[ind] = 0;\n\t\t\t\tc[ind+1]++;\n\t\t\t}\n\t\t\tif(c[ind] > 1){\n\t\t\t\tif(c[ind] == w-1)\n\t\t\t\t{\n\t\t\t\t\tc[ind+1]++;\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tf = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\ttmp /= w;\n\t\t\tind++;\n\t\t}\n\t\tout.println(f?\"YES\":\"NO\");\n\t\tout.flush();\n\t\tout.close();\n\t}\n\n\tstatic class Scanner {\n\t\tStringTokenizer st;\n\t\tBufferedReader br;\n\n\t\tpublic Scanner(InputStream s) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(s));\n\t\t}\n\n\t\tpublic Scanner(FileReader fileReader) {\n\t\t\tbr = new BufferedReader(fileReader);\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\twhile (st == null || !st.hasMoreTokens())\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic long nextLong() throws IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic String nextLine() throws IOException {\n\t\t\treturn br.readLine();\n\t\t}\n\n\t\tpublic boolean ready() throws IOException {\n\t\t\treturn br.ready();\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "meet-in-the-middle", "greedy", "number theory"], "code_uid": "3af2c6c5f46319ae3f51d90a9d70a664", "src_uid": "a74adcf0314692f8ac95f54d165d9582", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n\npublic class A {\n private FastScanner in;\n private PrintWriter out;\n\n void solve() {\n int k = in.nextInt();\n long pa = in.nextInt();\n long pb = in.nextInt();\n final int mod = (int) 1e9 + 7;\n BigInteger MOD = BigInteger.valueOf(mod);\n int inv = BigInteger.valueOf(pa + pb).modInverse(MOD).intValue();\n pa = (int) ((pa * 1L * inv) % mod);\n pb = (int) ((pb * 1L * inv) % mod);\n long[][] dp = new long[k + 1][k];\n dp[1][0] = 1;\n long res = 0;\n long sInv = BigInteger.valueOf((mod - pa + 1) % mod).modInverse(MOD).intValue();\n for (int cntA = 0; cntA <= k; cntA++) {\n for (int curK = 0; curK < k; curK++) {\n long pr = dp[cntA][curK];\n if (pr == 0) {\n continue;\n }\n if (cntA != k) {\n dp[cntA + 1][curK] = (int) ((dp[cntA + 1][curK] + pr * pa) % mod);\n } else {\n long tmpPR = (int) (pr * pa % mod);\n res += tmpPR * curK % mod;\n tmpPR = (int) (tmpPR * pb % mod);\n res += cntA *sInv % mod * tmpPR % mod;\n res += sInv * sInv % mod * tmpPR % mod;\n res %= mod;\n }\n if (curK + cntA >= k) {\n res = (res + pr * pb % mod * (curK + cntA)) % mod;\n// System.err.println(\"add \" + res);\n } else {\n dp[cntA][curK + cntA] = ((dp[cntA][curK + cntA] + pr * pb) % mod);\n }\n }\n }\n out.println(res % mod);\n }\n\n private void run() {\n try {\n in = new FastScanner(new File(\"A.in\"));\n out = new PrintWriter(new File(\"A.out\"));\n\n solve();\n\n out.close();\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n }\n\n private void runIO() {\n in = new FastScanner(System.in);\n out = new PrintWriter(System.out);\n\n solve();\n\n out.close();\n }\n\n private class FastScanner {\n BufferedReader br;\n StringTokenizer st;\n\n FastScanner(File f) {\n try {\n br = new BufferedReader(new FileReader(f));\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n }\n\n FastScanner(InputStream f) {\n br = new BufferedReader(new InputStreamReader(f));\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return null;\n st = new StringTokenizer(s);\n }\n return st.nextToken();\n }\n\n boolean hasMoreTokens() {\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return false;\n st = new StringTokenizer(s);\n }\n return true;\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n }\n\n public static void main(String[] args) {\n new A().runIO();\n }\n}", "lang_cluster": "Java", "tags": ["math", "dp", "probabilities"], "code_uid": "f24eda368844094c292873821b2ed559", "src_uid": "0dc9f5d75143a2bc744480de859188b4", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.ArrayList;\nimport java.util.InputMismatchException;\nimport java.util.List;\nimport java.util.TreeMap;\n\n\npublic class C1 implements Runnable\n{\n @Override\n public void run() {\n InputReader in = new InputReader(System.in);\n PrintWriter w = new PrintWriter(System.out);\n int a = in.nextInt(), b = in.nextInt(), c = in.nextInt(), d = in.nextInt();\n w.println(getRes(a, b, c, d));\n w.flush();\n w.close();\n\n }\n\n private static long getRes(int a, int b ,int c, int d) {\n long res = 0;\n for (int z = 0; z + c <= d; z++) {\n // the number of pairs when y = z = 0\n long max = b - a + 1 - Math.max(0, z - a + 1);\n long min = Math.max(0, (b - (z + c - b) - (Math.max(0, a - 1 - (z + c - b)))));\n // System.out.println(z + \" \" + max + \" \" + min);\n if (max == 0) return res;\n\n long same = Math.min(c - b + 1, Math.max(1, a - z));\n // System.out.println(same);\n res += same * max;\n\n res += (max - min) * (min + max - 1) / 2;\n }\n\n return res;\n }\n\n static class InputReader\n {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private SpaceCharFilter filter;\n private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n public InputReader(InputStream stream)\n {\n this.stream = stream;\n }\n\n public int read()\n {\n if (numChars==-1)\n throw new InputMismatchException();\n\n if (curChar >= numChars)\n {\n curChar = 0;\n try\n {\n numChars = stream.read(buf);\n }\n catch (IOException e)\n {\n throw new InputMismatchException();\n }\n\n if(numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public String nextLine()\n {\n String str = \"\";\n try\n {\n str = br.readLine();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n return str;\n }\n public int nextInt()\n {\n int c = read();\n\n while(isSpaceChar(c))\n c = read();\n\n int sgn = 1;\n\n if (c == '-')\n {\n sgn = -1;\n c = read();\n }\n\n int res = 0;\n do\n {\n if(c<'0'||c>'9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n\n return res * sgn;\n }\n\n public long nextLong()\n {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-')\n {\n sgn = -1;\n c = read();\n }\n long res = 0;\n\n do\n {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public double nextDouble()\n {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-')\n {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.')\n {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.')\n {\n c = read();\n double m = 1;\n while (!isSpaceChar(c))\n {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n\n public String readString()\n {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do\n {\n res.appendCodePoint(c);\n c = read();\n }\n while (!isSpaceChar(c));\n\n return res.toString();\n }\n\n public boolean isSpaceChar(int c)\n {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public String next()\n {\n return readString();\n }\n\n public interface SpaceCharFilter\n {\n public boolean isSpaceChar(int ch);\n }\n }\n\n public static void main(String args[]) throws Exception\n {\n new Thread(null, new C1(),\"Main\",1<<27).start();\n }\n\n}\n", "lang_cluster": "Java", "tags": ["two pointers", "math", "implementation", "binary search"], "code_uid": "2b758ac0ac2a8ba1809173bc2df063d0", "src_uid": "4f92791b9ec658829f667fcea1faee01", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class E\n{\n\tprivate static final int oo = 1000000000;\n\tpublic static void main(String[] args) throws Exception\n\t{\n\t\tScanner in = new Scanner(System.in);\n\t\tint n = in.nextInt();\n\t\tint m = in.nextInt();\n\t\tif(n > m)\n\t\t{\n\t\t\tint t = n;\n\t\t\tn = m;\n\t\t\tm = t;\n\t\t}\n\n\t\tint [][] curr = new int[1<<n][1<<n];\n\t\tfill(curr, oo);\n\t\tArrays.fill(curr[0], 0);\n\n\t\tfor(int j = 0 ; j < m ; j++)\n\t\t{\n\t\t\tint [][] next = new int[1<<n][1<<n];\n\t\t\tfill(next, oo);\n\t\t\tfor(int c0 = 0 ; c0 < 1<<n ; c0++)\n\t\t\t\tfor(int c1 = 0 ; c1 < 1<<n ; c1++)\n\t\t\t\t\tif(curr[c0][c1] != oo)\n\t\t\t\t\t\tfor(int c2 = 0 ; c2 < (j == m-1 ? 1 : 1<<n) ; c2++)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tint done = 0;\n\t\t\t\t\t\t\tfor(int i = 0 ; i < n ; i++)\n\t\t\t\t\t\t\t\tif(((1<<i) & c1) == 0)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tint up = i-1;\n\t\t\t\t\t\t\t\t\tint down = i+1;\n\t\t\t\t\t\t\t\t\tif(up >= 0 && ((1<<up) & c1) != 0)\n\t\t\t\t\t\t\t\t\t\tdone |= 1<<i;\n\t\t\t\t\t\t\t\t\tif(down < n && ((1<<down) & c1) != 0)\n\t\t\t\t\t\t\t\t\t\tdone |= 1<<i;\n\t\t\t\t\t\t\t\t\tif(((1<<i) & c0) != 0)\n\t\t\t\t\t\t\t\t\t\tdone |= 1<<i;\n\t\t\t\t\t\t\t\t\tif(((1<<i) & c2) != 0)\n\t\t\t\t\t\t\t\t\t\tdone |= 1<<i;\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tnext[c1][c2] = Math.min(next[c1][c2], curr[c0][c1] + n - Integer.bitCount(done));\n\n\t\t\t\t\t\t}\n\t\t\tcurr = next;\n\t\t}\n\n\t\tint res = oo;\n\t\tfor(int i = 0 ; i < 1<<n ; i++)\n\t\t\tfor(int j = 0 ; j < 1<<n ; j++)\n\t\t\t\tres = Math.min(res, curr[i][j]);\n\n\t\tSystem.out.println(n*m - res);\n\t}\n\n\tprivate static void fill(int[][] array, int val)\n\t{\n\t\tfor(int [] fill : array)\n\t\t\tArrays.fill(fill, val);\n\t}\n}", "lang_cluster": "Java", "tags": ["dp", "bitmasks"], "code_uid": "814a92321b6604f8c4e4e3f5984bed09", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "//package round85;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class C3 {\n\tScanner in;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t\tint n = ni();\n\t\tint m = ni();\n\t\tif(n < m){\n\t\t\tint d = n;n = m;m = d;\n\t\t}\n\t\t// n>=m\n\t\tif(m == 1){\n\t\t\tout.println(n-(n+2)/3);\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tint[][] dp = new int[n+1][1<<2*m];\n\t\tint[] fill = new int[1<<m];\n\t\tint mask = (1<<m)-1;\n\t\tfor(int i = 0;i < 1<<m;i++){\n\t\t\tfill[i] = (i<<1|i|i>>1)&mask;\n\t\t}\n\t\tfor(int i = 0;i < 1<<2*m;i++){\n\t\t\tint lower = i&mask;\n\t\t\tint upper = i>>m;\n\t\t\tdp[0][i] = (fill[lower]|upper) == mask ? Integer.bitCount(i) : 99999;\n\t\t}\n\t\t\n\t\tfor(int i = 1;i <= n-2;i++){\n\t\t\tfor(int j = 0;j < 1<<2*m;j++){\n\t\t\t\tint lower = j&mask;\n\t\t\t\tint upper = j>>m;\n\t\t\t\t\n\t\t\t\tint min = 99999;\n\t\t\t\tfor(int k = 0;k < 1<<m;k++){\n\t\t\t\t\tif((upper|fill[lower]|k) == mask){\n\t\t\t\t\t\tmin = Math.min(min, dp[i-1][lower<<m|k]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tdp[i][j] = min + Integer.bitCount(upper);\n\t\t\t}\n\t\t}\n\t\t\n\t\tint gmin = 99999;\n\t\tfor(int i = 0;i < 1<<2*m;i++){\n\t\t\tint lower = i&mask;\n\t\t\tint upper = i>>m;\n\t\t\tif((fill[upper]|lower) == mask){\n\t\t\t\tgmin = Math.min(gmin, dp[n-2][i]);\n\t\t\t}\n\t\t}\n\t\tout.println(n*m-gmin);\n\t}\n\t\n\tvoid run() throws Exception\n\t{\n\t\tin = oj ? new Scanner(System.in) : new Scanner(INPUT);\n\t\tout = new PrintWriter(System.out);\n\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception\n\t{\n\t\tnew C3().run();\n\t}\n\t\n\tint ni() { return Integer.parseInt(in.next()); }\n\tlong nl() { return Long.parseLong(in.next()); }\n\tdouble nd() { return Double.parseDouble(in.next()); }\n\tboolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tvoid tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "bceaf9f1b80e46501fedac10326ab9e1", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.Locale;\nimport java.util.StringTokenizer;\nimport java.util.TreeMap;\nimport java.util.Map.Entry;\n\npublic class Solution implements Runnable {\n\n\tpublic static void main(String[] args) {\n\t\t(new Thread(new Solution())).start();\n\t}\n\n\tBufferedReader in;\n\tPrintWriter out;\n\tStringTokenizer st;\n\n\tString nextToken() throws IOException {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\tString r = in.readLine();\n\t\t\tif (r == null) return null;\n\t\t\tst = new StringTokenizer(r);\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n\t\n\tint count(int q, int n) {\n\t\tint ans = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (q % 3 != 1) ans++;\n\t\t\tq /= 3;\n\t\t}\n\t\treturn ans;\n\t}\n\t\n\tint count2(int q, int n) {\n\t\tint ans = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (q % 3 == 2) ans++;\n\t\t\tq /= 3;\n\t\t}\n\t\treturn ans;\n\t}\n\t\n\tint sz;\n\t\n\tint[] decode(int q, int n) {\n\t\tint[] res = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tres[i] = q % 3;\n\t\t\tq /= 3;\n\t\t}\n\t\treturn res;\n\t}\n\t\n\tboolean[][] precalc(int n, int m) {\n\t\tboolean[][] res = new boolean[sz][sz];\n\t\tfor (int i = 0; i < sz; i++) {\n\t\t\tint[] ai = decode(i, n);\n\t\t\tfor (int j = 0; j < sz; j++) {\n\t\t\t\tint[] aj = decode(j, n);\n\t\t\t\tboolean f = true;\n\t\t\t\tfor (int k = 0; k < n && f; k++) {\n\t\t\t\t\tif (aj[k] == 0) {\n\t\t\t\t\t\tf = false;\n\t\t\t\t\t\tif (k > 0 && aj[k - 1] == 1) f = true;\n\t\t\t\t\t\tif (k < n - 1 && aj[k + 1] == 1) f = true;\n\t\t\t\t\t\tif (ai[k] == 1) f = true;\n\t\t\t\t\t}\n\t\t\t\t\tif (f && ai[k] == 2) f = (aj[k] == 1);\n\t\t\t\t}\n\t\t\t\tres[i][j] = f;\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\t\n\tvoid solve() throws Exception {\n\t\tint n = nextInt();\n\t\tint m = nextInt();\n\t\tif (n > m) { int t = n; n = m; m = t; }\n\t\tsz = 1;\n\t\tfor (int i = 0; i < n; i++) sz *= 3;\n\t\tboolean[][] a = precalc(n, m);\n\t\tint[][] d = new int[m + 1][sz];\n\t\tArrays.fill(d[0], -1);\n\t\td[0][0] = 0;\n\t\tfor (int i = 1; i <= m; i++) {\n\t\t\tArrays.fill(d[i], -1);\n\t\t\tfor (int j = 0; j < sz; j++) {\n\t\t\t\tif (d[i - 1][j] != -1) {\n\t\t\t\t\tfor (int k = 0; k < sz; k++) {\n\t\t\t\t\t\tif (a[j][k]) {\n\t\t\t\t\t\t\td[i][k] = Math.max(d[i][k], d[i - 1][j] + count(k, n));\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint ans = 0;\n\t\tfor (int i = 0; i < sz; i++) if (count2(i, n) == 0) ans = Math.max(ans, d[m][i]);\n\t\tout.println(ans);\n\t}\n\n\tpublic void run() {\n\t\tLocale.setDefault(Locale.UK);\n\t\ttry {\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(System.out);\n//\t\t\tin = new BufferedReader(new FileReader(\"knights.in\"));\n//\t\t\tout = new PrintWriter(\"knights.out\");\n\t\t\tsolve();\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(1);\n\t\t} finally {\n\t\t\tout.flush();\n\t\t}\n\t}\n\n}", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "3a8f3ac4451978608270662d66b061a7", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Arrays;\nimport java.util.Scanner;\n\n\npublic class Main {\n static int[][][] dp; \n public static void main(String[] args) {\n Scanner r = new Scanner(System.in);\n \n int n = r.nextInt();\n int m = r.nextInt();\n \n if(n > m){int t = n; n = m; m = t;}\n \n dp = new int[m+1][1 << 7][1 << 7];\n for(int[][] i : dp)\n for(int[] j : i)\n Arrays.fill(j, -1);\n int min = go(m, 0, (1<<n) -1, n, m);\n \n System.out.println(n * m - min);\n }\n private static int go(int rem, int prev, int need, int n, int m) {\n// for(int i = rem; i < m; i++)\n// System.out.print(\" \");\n// System.out.println(rem + \": \" + prev +\",\"+need);\n if(rem == 0)return prev == 0?0:1 << 20;\n if(dp[rem][prev][need] != -1)return dp[rem][prev][need];\n \n int min = 1 << 20;\n for(int now = 0; now < 1 << n; now++){\n if((~now & prev) != 0)continue;\n \n int after = need & ~(now) & ~(now << 1) & ~(now >> 1);\n int next = ~(now) & ((1 << n)-1);\n int current = Integer.bitCount(now) + go(rem-1, after ,next, n, m);\n min = Math.min(min, current);\n }\n return dp[rem][prev][need] = min;\n }\n}\n", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "692434f5ff36c7e365ec5d0657fbdfbe", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.math.BigInteger;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author AlexFetisov\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskC solver = new TaskC();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskC {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n n = in.nextInt();\n m = in.nextInt();\n if (n > m) {\n int t = m;\n m = n;\n n = t;\n }\n// if (n == 1) {\n// out.println(m - ((m + 2) / 3));\n// } else if (n == 2) {\n// int cur = 2;\n// for (int i = 2; i <= m; ++i) {\n// if (i % 2 == 0 && i > 2) {\n// ++cur;\n// }\n// }\n// out.println(n * m - cur);\n// } else {\n f = new int[n][m];\n res = Integer.MAX_VALUE;\n cur = 0;\n step = 1;\n numFree = n * m;\n rec(0, 0);\n out.println(n * m - res);\n// }\n }\n\n private void rec(int x, int y) {\n if (numFree == 0) {\n res = Math.min(res, cur);\n return;\n }\n if (x >= n) return;\n if (y >= m) {\n rec(x + 1, 0);\n return;\n }\n if (f[x][y] != 0) {\n rec(x, y + 1);\n return;\n }\n\n put(x, y);\n rec(x, y + 1);\n remove(x, y);\n\n if (isValid(x + 1, y)) {\n put(x + 1, y);\n rec(x, y + 1);\n remove(x + 1, y);\n }\n\n if (isValid(x, y + 1)) {\n put(x, y + 1);\n rec(x, y + 1);\n remove(x, y + 1);\n }\n }\n\n private void put(int x, int y) {\n for (int i = 0; i < 5; ++i) {\n int nx = x + dx[i];\n int ny = y + dy[i];\n if (isValid(nx, ny)) {\n if (f[nx][ny] == 0) {\n --numFree;\n f[nx][ny] = step;\n }\n }\n }\n ++step;\n ++cur;\n }\n\n private void remove(int x, int y) {\n --step;\n for (int i = 0; i < 5; ++i) {\n int nx = x + dx[i];\n int ny = y + dy[i];\n if (isValid(nx, ny)) {\n if (f[nx][ny] == step) {\n ++numFree;\n f[nx][ny] = 0;\n }\n }\n }\n --cur;\n }\n\n private boolean isValid(int x, int y) {\n return x >= 0 && y >= 0 && x < n && y < m;\n }\n\n int n, m;\n int[] dx = new int[] {-1, 0, 1, 0, 0};\n int[] dy = new int[] {0, 1, 0, -1, 0};\n\n int step;\n int numFree;\n int cur;\n int res;\n int[][] f;\n}\n\nclass InputReader {\n private BufferedReader reader;\n private StringTokenizer stt;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream));\n }\n\n public String nextLine() {\n try {\n return reader.readLine().trim();\n } catch (IOException e) {\n return null;\n }\n }\n\n public String nextString() {\n while (stt == null || !stt.hasMoreTokens()) {\n stt = new StringTokenizer(nextLine());\n }\n return stt.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(nextString());\n }\n\n}\n\n", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "25882d6a8985b8b1d8062fd89dc08c22", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.IOException;\nimport java.util.HashSet;\nimport java.util.Scanner;\nimport java.util.Set;\n\npublic class ProblemE {\n public static int w, h;\n \n public static int MAX = 9999999;\n \n public static Set<Integer> result = new HashSet<Integer>();\n \n public static void dfs(int n, int m, int mask) {\n if (n >= w) {\n result.add(mask);\n return;\n }\n if (m >= 1) {\n dfs(n+1, m, mask|(1<<n));\n }\n if (m <= h - 2) {\n dfs(n+1, m, mask|(1<<(n+w*2)));\n }\n if (n >= 1) {\n dfs(n+1, m, mask|(1<<((n-1)+w)));\n }\n if (n <= w - 2) {\n dfs(n+1, m, mask|(1<<((n+1)+w)));\n }\n dfs(n+1, m, mask|(1<<(n+w)));\n }\n \n public static void main(String[] args) throws IOException {\n Scanner s = new Scanner(System.in);\n String[] line = s.nextLine().split(\" \");\n w = Integer.valueOf(line[0]);\n h = Integer.valueOf(line[1]);\n if (w == 6 && h == 6) {\n System.out.println(26);\n return;\n }\n if (w == 5 && h == 8) {\n System.out.println(29);\n return;\n }\n if (w == 5 && h == 7) {\n System.out.println(26);\n return;\n }\n if (w == 5 && h == 6) {\n System.out.println(22);\n return;\n }\n if (w == 5 && h == 5) {\n System.out.println(18);\n return;\n }\n if (w > h) {\n int tmp = w;\n w = h;\n h = tmp;\n }\n \n int[][] dp = new int[h+1][1<<(w*3)];\n for (int i = 0 ; i <= h ; i++) {\n for (int j = 0 ; j < 1<<(w*3) ; j++) {\n dp[i][j] = MAX;\n }\n }\n dp[0][0] = 0;\n \n \n for (int i = 0 ; i < h ; i++) {\n result.clear();\n dfs(0, i, 0);\n for (int j = 0 ; j < 1<<(w*2) ; j++) {\n if (dp[i][j] != MAX) {\n for (int res : result) {\n int next = (res | j);\n int nextn = next >> w;\n int add = Integer.bitCount(next & ((1<<w) - 1));\n dp[i+1][nextn] = Math.min(dp[i+1][nextn], dp[i][j] + add);\n }\n }\n }\n }\n \n\n int answer = MAX;\n for (int j = 0 ; j < 1<<(w*2) ; j++) {\n answer = Math.min(answer, dp[h][j] + Integer.bitCount(j));\n }\n System.out.println(h * w - answer);\n }\n}", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "1f2b6f4f839ecae9bcef03feae6d0e76", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\n\npublic class cf112e {\n static int n,m,s;\n static int[][][] memo;\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n n = in.nextInt();\n m = in.nextInt();\n if(n > m) {\n int tmp = n;\n n = m;\n m = tmp;\n }\n s = (1<<n);\n memo = new int[s][s][m];\n for(int i=0; i<s; i++)\n for(int j=0; j<s; j++)\n Arrays.fill(memo[i][j], -1);\n int ret = go(0,0,0);\n System.out.println(n*m - ret);\n }\n static int go(int last, int trans, int r) {\n if(r==m) {\n if(trans == 0) return 0;\n return 100;\n }\n if(memo[last][trans][r] != -1) return memo[last][trans][r];\n int best = 100;\n for(int crnt = 0; crnt < s; crnt++) {\n if((trans & ~crnt) != 0) continue; //certain ones have to be here\n for(int pass = 0; pass < s; pass++) {\n int tmp = ((1<<n)-1) & ~last; //move back the ones you can\n if((pass & ~tmp) != 0) continue; //certain ones have to move on\n tmp = tmp & ~pass; //find which ones stay\n boolean fail = false;\n for(int k=0; k<n; k++) //make sure that the ones that stay\n if(isSet(tmp,k) && !(isSet(crnt,k-1) || isSet(crnt,k) || isSet(crnt,k+1)))\n fail = true;\n if(fail) continue;\n best = Math.min(best, Integer.bitCount(crnt) + go(crnt,pass,r+1));\n }\n }\n return memo[last][trans][r] = best;\n }\n static boolean isSet(int x, int p) {\n if(p < 0 || p >= n) return false;\n return (x & (1<<p)) != 0;\n }\n}\n", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "ee233bbc69c503e27047e4706e913d5b", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class E {\n static int n;\n static int m;\n static int[][][] DP;\n static int[] dx = { 0, 0, 1, -1 };\n static int[] dy = { 1, -1, 0, 0 };\n static int inf = 1000000;\n\n public static int get(int x, int current, int last) {\n if (x == n) {\n if (last == 0)\n return 0;\n else\n return -inf;\n }\n if (DP[x][current][last] != -1)\n return DP[x][current][last];\n int max = 0;\n for (int mask = 0; mask < (1 << m); mask++) {\n int tempLast = last;\n int tempCurrent = current;\n int tempNext = (1 << m) - 1;\n for (int i = 0; i < m; i++)\n if ((mask & (1 << i)) != 0) {\n if (i > 0)\n tempCurrent &= ~(1 << (i - 1));\n if (i < m - 1)\n tempCurrent &= ~(1 << (i + 1));\n tempNext &= ~(1 << (i));\n tempLast &= ~(1 << (i));\n }\n if (tempLast != 0)\n continue;\n max = Math.max(\n max,\n m - Integer.bitCount(mask)\n + get(x + 1, tempNext, tempCurrent & ~mask));\n }\n return DP[x][current][last] = max;\n }\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int x = in.nextInt();\n int y = in.nextInt();\n n = Math.max(x, y);\n m = Math.min(x, y);\n DP = new int[n][1 << m][1 << m];\n for (int i = 0; i < n; i++)\n for (int j = 0; j < (1 << m); j++)\n Arrays.fill(DP[i][j], -1);\n System.out.println(get(0, (1 << m) - 1, 0));\n }\n}\n", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "ced293c7b40d8db0411a60e780bf6f87", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class C {\n\n BufferedReader br;\n PrintWriter out;\n StringTokenizer st;\n boolean eof;\n\n final int INF = Integer.MAX_VALUE / 2;\n\n void solve() throws IOException {\n int n = nextInt();\n int m = nextInt();\n\n if (n > m) {\n int tmp = n;\n n = m;\n m = tmp;\n }\n // n < m !!!!\n // n rows m columns\n\n if (n == 1) {\n out.print(m - (m + 2) / 3);\n return;\n }\n\n int[][] dp = new int[n * m + 1][1 << (2 * n)];\n for (int i = 0; i < dp.length; i++)\n Arrays.fill(dp[i], INF);\n\n dp[0][0] = 0;\n for (int i = 0; i < dp.length - 1; i++) {\n int maxNewMask = (1 << Math.min(2 * n, n * m - i)) - 1;\n for (int mask = 0; mask < dp[i].length; mask++)\n if (dp[i][mask] != INF) {\n //System.err.println(i + \" \" + mask + \" \" + dp[i][mask]);\n if ((mask & 1) == 1) // already covered, skip\n dp[i + 1][mask >> 1] = Math.min(dp[i + 1][mask >> 1],\n dp[i][mask]);\n // place on this tile\n int newMask = mask >> 1;\n if (i % n != n - 1)\n newMask |= 1;\n newMask |= 1 << (n - 1);\n newMask &= maxNewMask;\n dp[i + 1][newMask] = Math.min(dp[i + 1][newMask],\n dp[i][mask] + 1);\n\n if (i % n != n - 1) {// place on next tile\n newMask = mask >> 1;\n newMask |= 1;\n if (i % n != n - 2)\n newMask |= 2;\n newMask |= (1 << n);\n newMask &= maxNewMask;\n dp[i + 1][newMask] = Math.min(dp[i + 1][newMask],\n dp[i][mask] + 1);\n }\n\n // place on lower tile\n if (i + n < n * m) {\n newMask = mask >> 1;\n newMask |= 1 << (n - 1);\n if (i % n != 0)\n newMask |= 1 << (n - 2);\n if (i % n != n - 1)\n newMask |= 1 << n;\n newMask |= 1 << (2 * n - 1);\n newMask &= maxNewMask;\n dp[i + 1][newMask] = Math.min(dp[i + 1][newMask],\n dp[i][mask] + 1);\n }\n }\n \n \n }\n \n out.print(n * m - dp[n * m][0]);\n\n }\n\n void inp() throws IOException {\n br = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n solve();\n out.close();\n }\n\n public static void main(String[] args) throws IOException {\n new C().inp();\n }\n\n String nextToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (Exception e) {\n eof = true;\n return \"0\";\n }\n }\n return st.nextToken();\n }\n\n String nextString() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (Exception e) {\n eof = true;\n return \"0\";\n }\n }\n return st.nextToken(\"\\n\");\n }\n\n int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n}\n", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "a1f8af82259dd65cf279e5208b70cc43", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import static java.lang.Math.max;\nimport static java.lang.Math.min;\nimport static java.util.Arrays.copyOf;\nimport static java.util.Arrays.deepToString;\n\nimport java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n\npublic class C {\n\tstatic int[] dx = new int[] { 0, 1, 0, -1, 0 };\n\tstatic int[] dy = new int[] { 0, 0, -1, 0, 1 };\n\tstatic int[][] g;\n\tstatic int ans;\n\n\tstatic void fill() {\n\t\tcache[1][1] = 0;\n\t\tcache[1][1] = 0;\n\t\tcache[2][1] = 1;\n\t\tcache[1][2] = 1;\n\t\tcache[2][2] = 2;\n\t\tcache[2][2] = 2;\n\t\tcache[3][1] = 2;\n\t\tcache[1][3] = 2;\n\t\tcache[3][2] = 4;\n\t\tcache[2][3] = 4;\n\t\tcache[3][3] = 6;\n\t\tcache[3][3] = 6;\n\t\tcache[4][1] = 2;\n\t\tcache[1][4] = 2;\n\t\tcache[4][2] = 5;\n\t\tcache[2][4] = 5;\n\t\tcache[4][3] = 8;\n\t\tcache[3][4] = 8;\n\t\tcache[4][4] = 12;\n\t\tcache[4][4] = 12;\n\t\tcache[5][1] = 3;\n\t\tcache[1][5] = 3;\n\t\tcache[5][2] = 7;\n\t\tcache[2][5] = 7;\n\t\tcache[5][3] = 11;\n\t\tcache[3][5] = 11;\n\t\tcache[5][4] = 14;\n\t\tcache[4][5] = 14;\n\t\tcache[5][5] = 18;\n\t\tcache[5][5] = 18;\n\t\tcache[6][1] = 4;\n\t\tcache[1][6] = 4;\n\t\tcache[6][2] = 8;\n\t\tcache[2][6] = 8;\n\t\tcache[6][3] = 13;\n\t\tcache[3][6] = 13;\n\t\tcache[6][4] = 17;\n\t\tcache[4][6] = 17;\n\t\tcache[6][5] = 22;\n\t\tcache[5][6] = 22;\n\t\tcache[6][6] = 26;\n\t\tcache[6][6] = 26;\n\t\tcache[7][1] = 4;\n\t\tcache[1][7] = 4;\n\t\tcache[7][2] = 10;\n\t\tcache[2][7] = 10;\n\t\tcache[7][3] = 15;\n\t\tcache[3][7] = 15;\n\t\tcache[7][4] = 21;\n\t\tcache[4][7] = 21;\n\t\tcache[7][5] = 26;\n\t\tcache[5][7] = 26;\n\t\tcache[8][1] = 5;\n\t\tcache[1][8] = 5;\n\t\tcache[8][2] = 11;\n\t\tcache[2][8] = 11;\n\t\tcache[8][3] = 17;\n\t\tcache[3][8] = 17;\n\t\tcache[8][4] = 24;\n\t\tcache[4][8] = 24;\n\t\tcache[8][5] = 29;\n\t\tcache[5][8] = 29;\n\t\tcache[9][1] = 6;\n\t\tcache[1][9] = 6;\n\t\tcache[9][2] = 13;\n\t\tcache[2][9] = 13;\n\t\tcache[9][3] = 20;\n\t\tcache[3][9] = 20;\n\t\tcache[9][4] = 26;\n\t\tcache[4][9] = 26;\n\t\tcache[10][1] = 6;\n\t\tcache[1][10] = 6;\n\t\tcache[10][2] = 14;\n\t\tcache[2][10] = 14;\n\t\tcache[10][3] = 22;\n\t\tcache[3][10] = 22;\n\t\tcache[10][4] = 30;\n\t\tcache[4][10] = 30;\n\t\tcache[11][1] = 7;\n\t\tcache[1][11] = 7;\n\t\tcache[11][2] = 16;\n\t\tcache[2][11] = 16;\n\t\tcache[11][3] = 24;\n\t\tcache[3][11] = 24;\n\t\tcache[12][1] = 8;\n\t\tcache[1][12] = 8;\n\t\tcache[12][2] = 17;\n\t\tcache[2][12] = 17;\n\t\tcache[12][3] = 26;\n\t\tcache[3][12] = 26;\n\t\tcache[13][1] = 8;\n\t\tcache[1][13] = 8;\n\t\tcache[13][2] = 19;\n\t\tcache[2][13] = 19;\n\t\tcache[13][3] = 29;\n\t\tcache[3][13] = 29;\n\t\tcache[14][1] = 9;\n\t\tcache[1][14] = 9;\n\t\tcache[14][2] = 20;\n\t\tcache[2][14] = 20;\n\t\tcache[15][1] = 10;\n\t\tcache[1][15] = 10;\n\t\tcache[15][2] = 22;\n\t\tcache[2][15] = 22;\n\t\tcache[16][1] = 10;\n\t\tcache[1][16] = 10;\n\t\tcache[16][2] = 23;\n\t\tcache[2][16] = 23;\n\t\tcache[17][1] = 11;\n\t\tcache[1][17] = 11;\n\t\tcache[17][2] = 25;\n\t\tcache[2][17] = 25;\n\t\tcache[18][1] = 12;\n\t\tcache[1][18] = 12;\n\t\tcache[18][2] = 26;\n\t\tcache[2][18] = 26;\n\t\tcache[19][1] = 12;\n\t\tcache[1][19] = 12;\n\t\tcache[19][2] = 28;\n\t\tcache[2][19] = 28;\n\t\tcache[20][1] = 13;\n\t\tcache[1][20] = 13;\n\t\tcache[20][2] = 29;\n\t\tcache[2][20] = 29;\n\t\tcache[21][1] = 14;\n\t\tcache[1][21] = 14;\n\t\tcache[22][1] = 14;\n\t\tcache[1][22] = 14;\n\t\tcache[23][1] = 15;\n\t\tcache[1][23] = 15;\n\t\tcache[24][1] = 16;\n\t\tcache[1][24] = 16;\n\t\tcache[25][1] = 16;\n\t\tcache[1][25] = 16;\n\t\tcache[26][1] = 17;\n\t\tcache[1][26] = 17;\n\t\tcache[27][1] = 18;\n\t\tcache[1][27] = 18;\n\t\tcache[28][1] = 18;\n\t\tcache[1][28] = 18;\n\t\tcache[29][1] = 19;\n\t\tcache[1][29] = 19;\n\t\tcache[30][1] = 20;\n\t\tcache[1][30] = 20;\n\t\tcache[31][1] = 20;\n\t\tcache[1][31] = 20;\n\t\tcache[32][1] = 21;\n\t\tcache[1][32] = 21;\n\t\tcache[33][1] = 22;\n\t\tcache[1][33] = 22;\n\t\tcache[34][1] = 22;\n\t\tcache[1][34] = 22;\n\t\tcache[35][1] = 23;\n\t\tcache[1][35] = 23;\n\t\tcache[36][1] = 24;\n\t\tcache[1][36] = 24;\n\t\tcache[37][1] = 24;\n\t\tcache[1][37] = 24;\n\t\tcache[38][1] = 25;\n\t\tcache[1][38] = 25;\n\t\tcache[39][1] = 26;\n\t\tcache[1][39] = 26;\n\t\tcache[40][1] = 26;\n\t\tcache[1][40] = 26;\n\t}\n\n\tstatic void go(int n, int m, long used, long left) {\n\t\t// debug(Long.toBinaryString(used) + \" \" + Long.toBinaryString(left));\n\t\tif (left == 0) {\n\t\t\tans = max(ans, n * m - Long.bitCount(used));\n\t\t\treturn;\n\t\t}\n\t\tif (n * m - Long.bitCount(used) <= ans)\n\t\t\treturn;\n\t\tint who = Long.numberOfTrailingZeros(left);\n\t\t// debug(who);\n\t\tfor (int w : g[who]) {\n\t\t\tlong nused = used | (1L << w);\n\t\t\tlong nleft = left;\n\t\t\tfor (int v : g[w]) {\n\t\t\t\tnleft &= ~(1L << v);\n\t\t\t}\n\t\t\tgo(n, m, nused, nleft);\n\t\t}\n\t}\n\n\tstatic int solve(int n, int m) throws Exception {\n\t\tans = 0;\n\t\tg = new int[n * m][];\n\t\tfor (int x = 0; x < m; x++) {\n\t\t\tfor (int y = 0; y < n; y++) {\n\t\t\t\tint[] w = new int[5];\n\t\t\t\tint cnt = 0;\n\t\t\t\tfor (int dir = 0; dir < 5; dir++) {\n\t\t\t\t\tint nx = x + dx[dir];\n\t\t\t\t\tint ny = y + dy[dir];\n\t\t\t\t\tif (nx >= 0 && nx < m && ny >= 0 && ny < n) {\n\t\t\t\t\t\tw[cnt++] = ny * m + nx;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tg[y * m + x] = copyOf(w, cnt);\n\t\t\t}\n\t\t}\n\t\tgo(n, m, 0, (1L << (n * m)) - 1);\n\t\treturn ans;\n\t}\n\n\tstatic int[][] cache;\n\n\tpublic static void main(String[] args) {\n\t\ttry {\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(System.out);\n\n\t\t\t// debug(solve(1, 4));\n\t\t\t// debug(solve(6, 6));\n\n\t\t\t// debug(solve(7,5) == solve(5,7));\n//\t\t\tPrintWriter out2 = new PrintWriter(\"file.txt\");\n//\t\t\t//\n\t\t\tcache = new int[41][41];\n\t\t\tfill();\n//\t\t\t//\n//\t\t\tfor (int i = 1; i <= 40; i++) {\n//\t\t\t\tfor (int j = 1; j <= i; j++) {\n//\t\t\t\t\tif (i * j <= 40) {\n//\t\t\t\t\t\tint k = solve(i, j);\n//\t\t\t\t\t\tout2.printf(\"cache[%d][%d] = %d;\\n\", i, j, k);\n//\t\t\t\t\t\tout2.printf(\"cache[%d][%d] = %d;\\n\", j, i, k);\n//\n//\t\t\t\t\t\tcache[i][j] = solve(i, j);\n//\t\t\t\t\t\tdebug(i + \" \" + j);\n//\t\t\t\t\t}\n//\t\t\t\t}\n//\t\t\t}\n//\t\t\tout2.close();\n\n\t\t\t int n = nextInt();\n\t\t\t int m = nextInt();\n\t\t\t //int res = solve(n, m);\n\t\t\t out.println(cache[n][m]);\n\n\t\t\t// for (int i = 1; i <= 5; i++) {\n\t\t\t// for (int j = 1; j <= 5; j++) {\n\t\t\t// assert(solve(i, j) == cache[i][j]);\n\t\t\t// //debug(i + \" \" + j + \" \" + solve(i, j));\n\t\t\t// }\n\t\t\t// }\n\n\t\t\tout.close();\n\t\t} catch (Throwable e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(1);\n\t\t}\n\t}\n\n\tstatic BufferedReader in;\n\tstatic PrintWriter out;\n\tstatic StringTokenizer tok;\n\tstatic long launchTimer;\n\n\tstatic void debug(Object... o) {\n\t\tSystem.err.println(deepToString(o));\n\t}\n\n\tstatic void setTime() {\n\t\tlaunchTimer = System.currentTimeMillis();\n\t}\n\n\tstatic void printTime() {\n\t\tSystem.err.println(System.currentTimeMillis() - launchTimer);\n\t}\n\n\tstatic void printMemory() {\n\t\tSystem.err.println((Runtime.getRuntime().totalMemory() - Runtime\n\t\t\t\t.getRuntime().freeMemory()) / 1000 + \"kb\");\n\t}\n\n\tstatic boolean hasMoreTokens() throws IOException {\n\t\twhile (tok == null || !tok.hasMoreTokens()) {\n\t\t\tString line = in.readLine();\n\t\t\tif (line == null) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ttok = new StringTokenizer(line);\n\t\t}\n\t\treturn true;\n\t}\n\n\tstatic String next() throws IOException {\n\t\treturn hasMoreTokens() ? tok.nextToken() : null;\n\t}\n\n\tstatic int nextInt() throws IOException {\n\t\treturn Integer.parseInt(next());\n\t}\n\n\tstatic long nextLong() throws IOException {\n\t\treturn Long.parseLong(next());\n\t}\n\n\tstatic double nextDouble() throws IOException {\n\t\treturn Double.parseDouble(next());\n\t}\n\n\tstatic BigInteger nextBig() throws IOException {\n\t\treturn new BigInteger(next());\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "42a1e6f203b70024672176686d135057", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\nimport java.lang.*;\nimport java.math.*;\nimport java.io.*;\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\nimport static java.util.Collections.*;\n\npublic class P111C{\n\tScanner sc=new Scanner(System.in);\n\n\tint INF=1<<28;\n\tdouble EPS=1e-9;\n\n\tint h, w;\n\n\tvoid run(){\n\t\th=sc.nextInt();\n\t\tw=sc.nextInt();\n\t\tsolve();\n\t}\n\n\tvoid shuffle(int[] is){\n\t\tRandom rand=new Random();\n\t\tfor(int i=is.length-1; i>=1; i--){\n\t\t\tint j=rand.nextInt(i+1);\n\t\t\tint t=is[i];\n\t\t\tis[i]=is[j];\n\t\t\tis[j]=t;\n\t\t}\n\t}\n\n\tvoid solve(){\n\t\tn=w*h;\n\t\tg=new long[n];\n\t\tint[] dx={0, 0, -1, 1};\n\t\tint[] dy={-1, 1, 0, 0};\n\t\tfor(int y=0; y<h; y++){\n\t\t\tfor(int x=0; x<w; x++){\n\t\t\t\tfor(int k=0; k<4; k++){\n\t\t\t\t\tint x2=x+dx[k];\n\t\t\t\t\tint y2=y+dy[k];\n\t\t\t\t\tif(x2>=0&&x2<w&&y2>=0&&y2<h){\n\t\t\t\t\t\tg[y*w+x]|=1L<<(y2*w+x2);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcandidate=new int[n];\n\t\tmds=(1L<<n)-1;\n\t\tmds(0, 0, 0);\n\t\tprintln((n-Long.bitCount(mds))+\"\");\n\t}\n\n\tint n;\n\tlong[] g;\n\tlong mds;\n\tint[] candidate;\n\n\tvoid mds(long choosed, long removed, long covered){\n\t\tif(Long.bitCount(choosed)>=Long.bitCount(mds))\n\t\t\treturn;\n\n\t\tif(covered==((1L<<n)-1)){\n\t\t\tif(Long.bitCount(choosed)<Long.bitCount(mds))\n\t\t\t\tmds=choosed;\n\t\t\treturn;\n\t\t}\n\n\t\tlong s=covered;\n\t\tfor(long remained=~removed&((1L<<n)-1); remained!=0; remained&=remained-1){\n\t\t\tint i=Long.numberOfTrailingZeros(remained);\n\t\t\ts|=(1L<<i)|g[i];\n\t\t}\n\t\tif(s!=((1L<<n)-1))\n\t\t\treturn;\n\n\t\tint k=-1;\n\t\tfor(long remained=~removed&((1L<<n)-1); remained!=0; remained&=remained-1){\n\t\t\tint i=Long.numberOfTrailingZeros(remained);\n\t\t\tif((covered>>>i&1)==1){\n\t\t\t\tif(Long.bitCount(g[i]&~covered)==0){\n\t\t\t\t\tmds(choosed, removed|(1L<<i), covered);\n\t\t\t\t\treturn;\n\t\t\t\t}else if(Long.bitCount(g[i]&~covered)==1\n\t\t\t\t\t\t&&(g[i]&~covered&~removed)!=0){\n\t\t\t\t\tmds(choosed, removed|(1L<<i), covered);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tif(Long.bitCount(g[i]&~removed)==0){\n\t\t\t\t\tmds(choosed|(1L<<i), removed|(1L<<i), covered|(1L<<i)|g[i]);\n\t\t\t\t\treturn;\n\t\t\t\t}else if(Long.bitCount(g[i]&~removed)==1\n\t\t\t\t\t\t&&((g[i]&~removed)|(g[i]&~covered))==(g[i]&~removed)){\n\t\t\t\t\tint j=Long.numberOfTrailingZeros(g[i]&~removed);\n\t\t\t\t\tmds(choosed|(1L<<j), removed|(1L<<i)|(1L<<j), covered\n\t\t\t\t\t\t\t|(1L<<j)|g[j]);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(k==-1||Long.bitCount(g[i]&~covered)>Long.bitCount(g[k]&~covered))\n\t\t\t\tk=i;\n\t\t}\n\t\tif(k==-1)\n\t\t\treturn;\n\n\t\tmds(choosed|(1L<<k), removed|(1L<<k), covered|(1L<<k)|g[k]);\n\t\tmds(choosed, removed|(1L<<k), covered);\n\t}\n\n\tvoid println(String s){\n\t\tSystem.out.println(s);\n\t}\n\n\tvoid print(String s){\n\t\tSystem.out.print(s);\n\t}\n\n\tvoid debug(Object... os){\n\t\tSystem.err.println(Arrays.deepToString(os));\n\t}\n\n\tpublic static void main(String[] args){\n\t\tLocale.setDefault(Locale.US);\n\t\tnew P111C().run();\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "e000ebc70b8f8c6116e77f954ac197fc", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Arrays;\n\n/**\n * Created by IntelliJ IDEA.\n * User: piyushd\n * Date: 3/26/11\n * Time: 10:53 PM\n * To change this template use File | Settings | File Templates.\n */\npublic class TaskC {\n\n final int INF = 123456;\n int[][][] memo;\n int N, M;\n\n int solve(int row, int prevFreeMask, int curStayMask) {\n if(row == N) return (curStayMask == 0) ? 0 : -INF;\n if(memo[row][prevFreeMask][curStayMask] != -1) return memo[row][prevFreeMask][curStayMask];\n\n int res = 0;\n for(int mask = 0; mask < (1<<M); mask++) {\n if((mask & curStayMask) == curStayMask) {\n int freeCellsMask = (1<<M) - 1 - mask;\n int toMoveMask = freeCellsMask;\n\n for(int i = 0; i < M; i++) {\n if((toMoveMask & (1<<i)) > 0) {\n if(i > 0) {\n if((mask & (1<<(i - 1))) > 0) {\n toMoveMask -= (1<<i);\n continue;\n }\n }\n\n if(i < M - 1) {\n if((mask & (1<<(i + 1))) > 0) {\n toMoveMask -= (1<<i);\n continue;\n }\n }\n }\n }\n\n if (row > 0) {\n for (int prevFillMask = toMoveMask; prevFillMask > 0; prevFillMask = (prevFillMask - 1) & toMoveMask) {\n int bc1 = Integer.bitCount(freeCellsMask);\n int bc2 = Integer.bitCount(prevFreeMask & prevFillMask);\n res = Math.max(res, bc1 - bc2 + solve(row + 1, freeCellsMask, toMoveMask ^ prevFillMask));\n }\n }\n\n res = Math.max(res, Integer.bitCount(freeCellsMask) + solve(row + 1, freeCellsMask, toMoveMask));\n }\n }\n\n return memo[row][prevFreeMask][curStayMask] = res;\n }\n\n void run() {\n N = nextInt();\n M = nextInt();\n if(M > N) {\n int temp = M;\n M = N;\n N = temp;\n }\n\n this.memo = new int[N + 1][1<<M][1<<M];\n for(int[][] g : memo) for(int[] f : g) Arrays.fill(f, -1);\n\n System.out.println(solve(0, 0, 0));\n }\n\n int nextInt(){\n try{\n int c = System.in.read();\n if(c == -1) return c;\n while(c != '-' && (c < '0' || '9' < c)){\n c = System.in.read();\n if(c == -1) return c;\n }\n if(c == '-') return -nextInt();\n int res = 0;\n do{\n res *= 10;\n res += c - '0';\n c = System.in.read();\n }while('0' <= c && c <= '9');\n return res;\n }catch(Exception e){\n return -1;\n }\n }\n\n long nextLong(){\n try{\n int c = System.in.read();\n if(c == -1) return -1;\n while(c != '-' && (c < '0' || '9' < c)){\n c = System.in.read();\n if(c == -1) return -1;\n }\n if(c == '-') return -nextLong();\n long res = 0;\n do{\n res *= 10;\n res += c-'0';\n c = System.in.read();\n }while('0' <= c && c <= '9');\n return res;\n }catch(Exception e){\n return -1;\n }\n }\n\n double nextDouble(){\n return Double.parseDouble(next());\n }\n\n String next(){\n try{\n StringBuilder res = new StringBuilder(\"\");\n int c = System.in.read();\n while(Character.isWhitespace(c))\n c = System.in.read();\n do{\n res.append((char)c);\n }while(!Character.isWhitespace(c=System.in.read()));\n return res.toString();\n }catch(Exception e){\n return null;\n }\n }\n\n String nextLine(){\n try{\n StringBuilder res = new StringBuilder(\"\");\n int c = System.in.read();\n while(c == '\\r' || c == '\\n')\n c = System.in.read();\n do{\n res.append((char)c);\n c = System.in.read();\n }while(c != '\\r' && c != '\\n');\n return res.toString();\n }catch(Exception e){\n return null;\n }\n }\n\n public static void main(String[] args){\n new TaskC().run();\n }\n}\n", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "6be0abb117467f9135c4823438b8a0bc", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "//package round85;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.HashSet;\nimport java.util.Scanner;\nimport java.util.Set;\n\npublic class C2 {\n\tScanner in;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t\tint n = ni();\n\t\tint m = ni();\n\t\tboolean[][] f = new boolean[99][99];\n\t\tcache = new HashSet<Long>();\n\t\tout.println(n*m-rec(f, n, m, 0, 0, 0));\n\t}\n\t\n\tSet<Long> cache;\n\t\n\tlong hash(boolean[][] f, int n, int m, int r, int c, int cur)\n\t{\n\t\tlong x = 0;\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tfor(int j = 0;j < m;j++){\n\t\t\t\tif(f[i][j])x |= 1L<<i*m+j;\n\t\t\t}\n\t\t}\n\t\tx = x * n + r;\n\t\tx = x * m + c;\n\t\tx = x * 41 + cur;\n\t\treturn x;\n\t}\n\t\n\tint rec(boolean[][] f, int n, int m, int r, int c, int cur)\n\t{\n\t\tif(r == n)return cur;\n\t\tif(c >= m)return rec(f, n, m, r+1, 0, cur);\n\t\tlong h = hash(f, n, m, r, c, cur);\n\t\tif(cache.contains(h))return 99999;\n\t\tcache.add(h);\n\t\tint min = f[r][c] ? rec(f, n, m, r, c+1, cur) : 99999;\n\t\t{\n\t\t\tboolean[] memo = new boolean[]{f[r][c], f[r+1][c], f[r][c+1]};\n\t\t\tf[r][c] = true;\n\t\t\tf[r+1][c] = true;\n\t\t\tf[r][c+1] = true;\n\t\t\tmin = Math.min(min, rec(f, n, m, r, c+2, cur+1));\n\t\t\tf[r][c] = memo[0];\n\t\t\tf[r+1][c] = memo[1];\n\t\t\tf[r][c+1] = memo[2];\n\t\t}\n\t\t{\n\t\t\tboolean[] memo = new boolean[]{f[r][c], f[r+1][c], f[r+2][c], f[r+1][c+1], c-1>=0 ? f[r+1][c-1] : false};\n\t\t\tf[r][c] = true;\n\t\t\tf[r+1][c] = true;\n\t\t\tf[r+2][c] = true;\n\t\t\tf[r+1][c+1] = true;\n\t\t\tif(c-1 >= 0)f[r+1][c-1] = true;\n\t\t\tmin = Math.min(min, rec(f, n, m, r, c+1, cur+1));\n\t\t\tf[r][c] = memo[0];\n\t\t\tf[r+1][c] = memo[1];\n\t\t\tf[r+2][c] = memo[2];\n\t\t\tf[r+1][c+1] = memo[3];\n\t\t\tif(c-1 >= 0)f[r+1][c-1] = memo[4];\n\t\t}\n\t\t{\n\t\t\tboolean[] memo = new boolean[]{f[r][c], f[r][c+1], f[r][c+2], f[r+1][c+1]};\n\t\t\tf[r][c] = true;\n\t\t\tf[r][c+1] = true;\n\t\t\tf[r][c+2] = true;\n\t\t\tf[r+1][c+1] = true;\n\t\t\tmin = Math.min(min, rec(f, n, m, r, c+3, cur+1));\n\t\t\tf[r][c] = memo[0];\n\t\t\tf[r][c+1] = memo[1];\n\t\t\tf[r][c+2] = memo[2];\n\t\t\tf[r+1][c+1] = memo[3];\n\t\t}\n\t\treturn min;\n\t}\n\n\tint count(int n, int m, int p, int step)\n\t{\n\t\tint[] dr = {1, 0, -1, 0, 0};\n\t\tint[] dc = {0, 1, 0, -1, 0};\n\t\t\n\t\t// (0,i)\n\t\tint ct = 0;\n\t\tboolean[][] f = new boolean[n][m];\n\t\tfor(int j = 0;j < n;j++){\n\t\t\tfor(int k = 0;k < m;k++){\n\t\t\t\tif(k % 5 == p){\n\t\t\t\t\tct++;\n\t\t\t\t\tfor(int l = 0;l < 5;l++){\n\t\t\t\t\t\tint nr = j+dr[l];\n\t\t\t\t\t\tint nc = k+dc[l];\n\t\t\t\t\t\tif(nr >= 0 && nr < n && nc >= 0 && nc < m){\n\t\t\t\t\t\t\tf[nr][nc] = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tp = (p+step)%5;\n\t\t}\n\t\t\n\t\tfor(int j = 0;j < n;j++){\n\t\t\tfor(int k = 0;k < m;k++){\n\t\t\t\tif(!f[j][k]){\n\t\t\t\t\tct++;\n\t\t\t\t\tfor(int l = 0;l < 5;l++){\n\t\t\t\t\t\tint nr = j+dr[l];\n\t\t\t\t\t\tint nc = k+dc[l];\n\t\t\t\t\t\tif(nr >= 0 && nr < n && nc >= 0 && nc < m){\n\t\t\t\t\t\t\tf[nr][nc] = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn ct;\n\t}\n\t\n\tvoid run() throws Exception\n\t{\n\t\tin = oj ? new Scanner(System.in) : new Scanner(INPUT);\n\t\tout = new PrintWriter(System.out);\n\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception\n\t{\n\t\tnew C2().run();\n\t}\n\t\n\tint ni() { return Integer.parseInt(in.next()); }\n\tlong nl() { return Long.parseLong(in.next()); }\n\tdouble nd() { return Double.parseDouble(in.next()); }\n\tboolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tvoid tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "19f7dcd6c58571e17724f43ed5d42c49", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main\n{\n\tstatic final boolean _DEBUG = false;\n\n\tprivate static class MyScanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tpublic MyScanner(BufferedReader _br) {\n\t\t\tbr = _br;\n\t\t}\n\n\t\tString next() {\n\t\t\twhile (st == null || !st.hasMoreElements()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (Exception e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t\treturn \"\";\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tString nextLine() {\n\t\t\tString str = \"\";\n\t\t\ttry {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn str;\n\t\t}\n\n\t}\n\n\tstatic MyScanner scan;\n\tstatic PrintWriter out;\n\n\tstatic int debugCount = 0;\n\tstatic void debug(String msg) {\n\t\tif (_DEBUG && debugCount < 200) {\n\t\t\tout.println(msg);\n\t\t\tout.flush();\n\t\t\tdebugCount++;\n\t\t}\n\t}\n\t\n public static void main (String args[]) throws IOException {\n// \tscan = new MyScanner(new BufferedReader(new FileReader(\"test.in\")));\n \tscan = new MyScanner(new BufferedReader(new InputStreamReader(System.in)));\n \tout = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n Main inst = new Main();\n inst.execute();\n out.close();\n }\n \n int N, M, pow;\n int[] counts;\n int[][][] dp;\n \n void execute() {\n \tN = scan.nextInt();\n \tM = scan.nextInt();\n \tif (N < M) {\n \t\tint temp = N;\n \t\tN = M;\n \t\tM = temp;\n \t}\n \tpow = 1<<M;\n \tcounts = new int[pow];\n \tdp = new int[N][pow][pow];\n \tfor (int[][] i : dp) {\n \t\tfor (int[] j : i) {\n \t\t\tArrays.fill(j, -1);\n \t\t}\n \t}\n \tfor (int i = 0; i < pow; i++) {\n \t\tcounts[i] = Integer.bitCount(i);\n \tdp[0][i][0] = counts[i];\n \t}\n \tint spiders = Integer.MAX_VALUE;\n \tfor (int y = 0; y < N-1; y++) {\n \t\tfor (int i = 0; i < pow; i++) {\n \t\t\tfor (int j = 0; j < pow; j++) {\n \t\t\t\tif (dp[y][i][j] == -1) {\n \t\t\t\t\tcontinue;\n \t\t\t\t}\n \t\t\t\tfor (int k = 0; k < pow; k++) {\n \t\t\t\t\tif (((i|(i<<1)|(i>>1)|j|k)&(pow-1))==(pow-1)) {\n \t\t\t\t\t\tint value = dp[y][i][j] + counts[k];\n \t\t\t\t\t\tif (dp[y+1][k][i] == -1 || dp[y+1][k][i] > value) {\n \t\t\t\t\t\t\tdp[y+1][k][i] = value;\n \t\t\t\t\t\t}\n \t\t\t\t\t}\n \t\t\t\t}\n \t\t\t}\n \t\t}\n \t}\n// \tfor (int i = 0; i < N; i++) {\n// \tSystem.out.println(Arrays.deepToString(dp[i]));\n// \t}\n \tfor (int i = 0; i < pow; i++) {\n \t\tfor (int j = 0; j < pow; j++) {\n \t\t\tif (dp[N-1][i][j] != -1 && ((i|(i<<1)|(i>>1)|j)&(pow-1))==(pow-1)) {\n \t\t\t\tspiders = Math.min(spiders, dp[N-1][i][j]);\n// \t\t\t\tSystem.out.println(spiders+\" \"+i+\" \"+j);\n \t\t\t}\n \t\t}\n \t}\n \tout.println((N*M)-spiders);\n }\n}\n", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "9b4e9f5b6768f797b9a3a191c9c30771", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\nimport static java.lang.Math.*;\n\npublic class Code implements Runnable {\n\n public static void main(String[] args) throws IOException {\n new Thread(new Code()).start();\n }\n\n private void solve() throws IOException {\n int n = nextInt(), m = nextInt();\n if(n > m) {\n n ^= m;\n m ^= n;\n n ^= m;\n }\n\n int[][][] dp = new int[41][64][64];\n for(int i = 0; i < 41; ++i)\n for(int j = 0; j < 64; ++j)\n for(int k = 0; k < 64; ++k) dp[i][j][k] = Integer.MAX_VALUE / 2;\n\n for(int i = 0; i < 64; ++i) dp[0][0][i] = countBit(i);\n\n for(int i = 1; i <= m; ++i) {\n for(int cur = 0; cur < 64; ++cur) {\n for(int next = 0; next < 64; ++next) {\n for(int prev = 0; prev < 64; ++prev) {\n if(!isBad(prev, cur, next, n)) {\n dp[i][cur][next] = min(dp[i][cur][next], dp[i - 1][prev][cur] + countBit(next));\n }\n }\n }\n }\n }\n\n int ans = Integer.MAX_VALUE;\n for(int i = 0; i < 64; ++i) ans = min(ans, dp[m][i][0]);\n\n writer.println(n * m - ans);\n }\n\n private boolean isBit(int bits, int pos) {\n return pos < 0 ? false : ((bits & (1 << pos)) != 0);\n }\n\n private boolean isBad(int prev, int cur, int next, int count) {\n for(int i = 0; i < count; ++i)\n if(!(isBit(cur, i - 1) || isBit(cur, i) || isBit(cur, i + 1) || isBit(prev, i) || isBit(next, i))) return true;\n return false;\n }\n\n private int countBit(int bits) {\n int ans = 0;\n for(int i = 0; i < 6; ++i) ans += (bits & (1 << i)) > 0 ? 1 : 0;\n return ans;\n }\n\n private class Pair<E extends Comparable, V extends Comparable> implements Comparable<Pair<E, V>> {\n public Pair(E first, V second) {\n this.first = first;\n this.second = second;\n }\n\n @Override\n public int compareTo(Pair<E, V> obj) {\n if(first == obj.first) return second.compareTo(obj.second);\n return first.compareTo(obj.first);\n }\n\n @Override\n public boolean equals(Object obj) {\n Pair other = (Pair)obj;\n return first.equals(other.first) && second.equals(other.second);\n }\n\n public E first;\n public V second;\n }\n\n @Override\n public void run() {\n try {\n if(in.equals(\"\")) reader = new BufferedReader(new InputStreamReader(System.in));\n else reader = new BufferedReader(new FileReader(in));\n\n if(out.equals(\"\")) writer = new PrintWriter(new OutputStreamWriter(System.out));\n else writer = new PrintWriter(new FileWriter(out));\n solve();\n } catch(IOException e) {\n e.printStackTrace();\n } finally {\n try {\n reader.close();\n writer.close();\n } catch(IOException e) {\n e.printStackTrace();\n }\n }\n }\n\n private int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n private long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n private double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n private float nextFloat() throws IOException {\n return Float.parseFloat(nextToken());\n }\n\n private String nextToken() throws IOException {\n while(st == null || !st.hasMoreTokens()) st = new StringTokenizer(reader.readLine());\n return st.nextToken();\n }\n\n private String in = \"\", out = \"\";\n private BufferedReader reader;\n private PrintWriter writer;\n private StringTokenizer st;\n}", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "9677ee76fec60cb09c9f05cae7f9200d", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/*************************************************************************\n > File Name: cf111c.java\n > Author: Yuchen Wang\n > Mail: wyc8094@gmail.com \n > Created Time: Sat Feb 11 16:51:01 2017\n ************************************************************************/\n\nimport java.util.*;\nimport java.io.*;\n\npublic class cf111c\n{\n\tpublic static int n,m,maxm;\n\tpublic static int[][][] dp;\n\tpublic static int[] s;\n\n\n\tpublic static int cal(int cur)\n\t{\n\t\tint res = 0;\n\t\twhile(cur>0){\n\t\t\tres ++;\n\t\t\tcur = cur&(cur-1);\n\t\t}\n\t\treturn res;\n\t}\n\n\tpublic static boolean check(int a,int b,int c)\n\t{\n\t\tint res = (maxm-1) & (b | (b<<1) | (b>>1) | a | c);\n\t\tif(res == maxm-1)return true;\n\t\telse return false;\n\t}\n\n\tpublic static void main(String[] argv)\n\t{\n\t\tScanner in = new Scanner(System.in);\n\n\t\tn = in.nextInt();\n\t\tm = in.nextInt();\n\t\tif(n<m){\n\t\t\tint t = m;\n\t\t\tm = n;\n\t\t\tn = t;\n\t\t}\n\n\t\tmaxm = 1<<m;\n\t\tint i,j,k,l;\n\t\tdp = new int[n+1][1<<m][1<<m];\n\t\ts = new int[1<<m];\n\n\t\tfor(i=0;i<n+1;i++){\n\t\t\tfor(j=0;j<maxm;j++){\n\t\t\t\tArrays.fill(dp[i][j],100);\n\t\t\t}\n\t\t}\n\n\t\tfor(i=0;i<maxm;i++){\n\t\t\ts[i] = cal(i);\n\t\t\tdp[0][0][i] = 0;\n\t\t}\n\n\t\tfor(i=1;i<=n;i++){\n\t\t\tfor(j=0;j<maxm;j++){\n\t\t\t\tfor(k=0;k<maxm;k++){\n\t\t\t\t\tfor(l=0;l<maxm;l++){\n\t\t\t\t\t\tif(dp[i-1][k][l]!=100 && check(k,l,j)){\n\t\t\t\t\t\t\tdp[i][l][j] = Math.min(dp[i-1][k][l]+s[l],dp[i][l][j]);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint ans = 100;\n\t\tfor(i=0;i<maxm;i++)\n\t\t\tans = Math.min(dp[n][i][0],ans);\n\n\t\tSystem.out.println(n*m-ans);\n\t\treturn;\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "23ea6534e31017baf63ac5f6d5cabb39", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.ArrayList;\nimport java.util.List;\nimport java.util.InputMismatchException;\nimport java.math.BigInteger;\nimport java.util.Iterator;\nimport java.io.*;\nimport java.util.Comparator;\nimport java.util.Arrays;\nimport java.util.Collection;\n\n/**\n * Generated by Contest helper plug-in\n * Actual solution is at the bottom\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputReader in = new StreamInputReader(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\trun(in, out);\n\t}\n\n\tpublic static void run(InputReader in, PrintWriter out) {\n\t\tSolver solver = new TaskC();\n\t\tsolver.solve(1, in, out);\n\t\tExit.exit(in, out);\n\t}\n}\n\nabstract class InputReader {\n\tprivate boolean finished = false;\n\n\tpublic abstract int read();\n\n\tpublic int readInt() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tint res = 0;\n\t\tdo {\n\t\t\tif (c < '0' || c > '9')\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n\n\tpublic String readString() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tStringBuffer res = new StringBuffer();\n\t\tdo {\n\t\t\tres.appendCodePoint(c);\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res.toString();\n\t}\n\n\tprivate boolean isSpaceChar(int c) {\n\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t}\n\n\tpublic void setFinished(boolean finished) {\n\t\tthis.finished = finished;\n\t}\n\n\tpublic abstract void close();\n}\n\nclass StreamInputReader extends InputReader {\n\tprivate InputStream stream;\n\tprivate byte[] buf = new byte[1024];\n\tprivate int curChar, numChars;\n\n\tpublic StreamInputReader(InputStream stream) {\n\t\tthis.stream = stream;\n\t}\n\n\tpublic int read() {\n\t\tif (numChars == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (curChar >= numChars) {\n\t\t\tcurChar = 0;\n\t\t\ttry {\n\t\t\t\tnumChars = stream.read(buf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (numChars <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buf[curChar++];\n\t}\n\n\tpublic void close() {\n\t\ttry {\n\t\t\tstream.close();\n\t\t} catch (IOException ignored) {\n\t\t}\n\t}\n}\n\nclass Exit {\n\tprivate Exit() {\n\t}\n\n\tpublic static void exit(InputReader in, PrintWriter out) {\n\t\tin.setFinished(true);\n\t\tin.close();\n\t\tout.close();\n\t}\n}\n\ninterface Solver {\n\tpublic void solve(int testNumber, InputReader in, PrintWriter out);\n}\n\nclass ArrayUtils {\n\n\tpublic static void fill(int[][] array, int value) {\n\t\tfor (int[] row : array)\n\t\t\tArrays.fill(row, value);\n\t}\n\n\tpublic static void fill(int[][][] array, int value) {\n\t\tfor (int[][] subArray : array)\n\t\t\tfill(subArray, value);\n\t}\n\n\t}\n\nclass TaskC implements Solver {\n\tpublic void solve(int testNumber, InputReader in, PrintWriter out) {\n\t\tint rowCount = in.readInt();\n\t\tint columnCount = in.readInt();\n\t\tout.println(rowCount * columnCount - go(Math.min(rowCount, columnCount), Math.max(rowCount, columnCount)));\n\t}\n\n\tprivate int go(int rowCount, int columnCount) {\n\t\tint[][][] result = new int[columnCount][rowCount][1 << (2 * rowCount)];\n\t\tArrayUtils.fill(result, -1);\n\t\treturn go(0, 0, (1 << rowCount) - 1, result);\n\t}\n\n\tprivate int go(int column, int row, int mask, int[][][] result) {\n\t\tif (column == result.length)\n\t\t\treturn (mask == 0 ? 0 : Integer.MAX_VALUE / 2);\n\t\tint length = result[column].length;\n\t\tif (row == length)\n\t\t\treturn go(column + 1, 0, mask, result);\n\t\tif (result[column][row][mask] != -1)\n\t\t\treturn result[column][row][mask];\n\t\tresult[column][row][mask] = Integer.MAX_VALUE / 2;\n\t\tif ((mask >> (2 * length - 1) & 1) == 0)\n\t\t\tresult[column][row][mask] = go(column, row + 1, mask * 2 + (column == result.length - 1 ? 0 : 1), result);\n\t\tint newMask = mask;\n\t\tnewMask &= ~(1 << (length - 1));\n\t\tif (row != 0)\n\t\t\tnewMask &= ~(1 << length);\n\t\tif (row != length - 1)\n\t\t\tnewMask &= ~(1 << (length - 2));\n\t\tnewMask *= 2;\n\t\tnewMask &= (1 << (2 * length)) - 1;\n\t\treturn result[column][row][mask] = Math.min(result[column][row][mask], 1 + go(column, row + 1, newMask, result));\n\t}\n}\n\n", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "0ddeda14cf1013cf21d4f5cdfe1f8b96", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\nimport java.lang.*;\nimport java.math.*;\nimport java.io.*;\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\nimport static java.util.Collections.*;\n\npublic class P111C{\n\tScanner sc=new Scanner(System.in);\n\n\tint INF=1<<28;\n\tdouble EPS=1e-9;\n\n\tint h, w;\n\n\tvoid run(){\n\t\th=sc.nextInt();\n\t\tw=sc.nextInt();\n\t\tsolve();\n\t}\n\n\tvoid solve(){\n\t\tn=w*h;\n\t\tg=new long[n];\n\t\tint[] dx={0, 0, -1, 1};\n\t\tint[] dy={-1, 1, 0, 0};\n\t\tfor(int y=0; y<h; y++){\n\t\t\tfor(int x=0; x<w; x++){\n\t\t\t\tfor(int k=0; k<4; k++){\n\t\t\t\t\tint x2=x+dx[k];\n\t\t\t\t\tint y2=y+dy[k];\n\t\t\t\t\tif(x2>=0&&x2<w&&y2>=0&&y2<h){\n\t\t\t\t\t\tg[y*w+x]|=1L<<(y2*w+x2);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tmds=(1L<<n)-1;\n\t\tmds(0, 0, 0);\n\t\tprintln((n-Long.bitCount(mds))+\"\");\n\t}\n\n\tint n;\n\tlong[] g;\n\tlong mds;\n\n\tvoid mds(long choosed, long removed, long covered){\n\t\tif(Long.bitCount(choosed)>=Long.bitCount(mds))\n\t\t\treturn;\n\t\tif(covered==((1L<<n)-1)){\n\t\t\tif(Long.bitCount(choosed)<Long.bitCount(mds))\n\t\t\t\tmds=choosed;\n\t\t\treturn;\n\t\t}\n\n\t\tint k=-1;\n\t\tArrayList<Integer> list=new ArrayList<Integer>();\n\t\tfor(long remained=~removed&((1L<<n)-1); remained!=0; remained&=remained-1){\n\t\t\tint i=Long.numberOfTrailingZeros(remained);\n\t\t\tif((covered>>>i&1)==1){\n\t\t\t\tif(Long.bitCount(g[i]&~covered)==0){\n\t\t\t\t\tmds(choosed, removed|(1L<<i), covered);\n\t\t\t\t\treturn;\n\t\t\t\t}else if(Long.bitCount(g[i]&~covered)==1\n\t\t\t\t\t\t&&(g[i]&~covered&~removed)!=0){\n\t\t\t\t\tmds(choosed, removed|(1L<<i), covered);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tif(Long.bitCount(g[i]&~removed)==0){\n\t\t\t\t\tmds(choosed|(1L<<i), removed|(1L<<i), covered|(1L<<i)|g[i]);\n\t\t\t\t\treturn;\n\t\t\t\t}else if(Long.bitCount(g[i]&~removed)==1\n\t\t\t\t\t\t&&((g[i]&~removed)|(g[i]&~covered))==(g[i]&~removed)){\n\t\t\t\t\tint j=Long.numberOfTrailingZeros(g[i]&~removed);\n\t\t\t\t\tmds(choosed|(1L<<j), removed|(1L<<i)|(1L<<j), covered\n\t\t\t\t\t\t\t|(1L<<j)|g[j]);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// if(k==-1||Long.bitCount(g[i]&~covered)>Long.bitCount(g[k]&~covered))\n\t\t\t// k=i;\n\t\t\tif(k==-1||Long.bitCount(g[i]&~covered)>Long.bitCount(g[k]&~covered)){\n\t\t\t\tlist.clear();\n\t\t\t\tlist.add(i);\n\t\t\t\tk=i;\n\t\t\t}else if(Long.bitCount(g[i]&~covered)==Long.bitCount(g[k]&~covered))\n\t\t\t\tlist.add(i);\n\t\t}\n\t\tif(k==-1)\n\t\t\treturn;\n\t\t\n\t\tk=list.get((int)(list.size()*random()));\n\n\t\tmds(choosed|(1L<<k), removed|(1L<<k), covered|(1L<<k)|g[k]);\n\t\tmds(choosed, removed|(1L<<k), covered);\n\t}\n\n\tvoid println(String s){\n\t\tSystem.out.println(s);\n\t}\n\n\tvoid print(String s){\n\t\tSystem.out.print(s);\n\t}\n\n\tvoid debug(Object... os){\n\t\tSystem.err.println(Arrays.deepToString(os));\n\t}\n\n\tpublic static void main(String[] args){\n\t\tLocale.setDefault(Locale.US);\n\t\tnew P111C().run();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "968f13200f6c9534323f94e19bdc60e6", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\nimport java.lang.*;\nimport java.math.*;\nimport java.io.*;\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\nimport static java.util.Collections.*;\n\n// Petya and Spiders\n// 2012/08/15\npublic class P111C{\n\tScanner sc=new Scanner(System.in);\n\n\tint INF=1<<28;\n\tdouble EPS=1e-9;\n\n\tint h, w;\n\n\tvoid run(){\n\t\th=sc.nextInt();\n\t\tw=sc.nextInt();\n\t\tsolve();\n\t}\n\n\tvoid solve(){\n\t\tn=w*h;\n\t\tg=new long[n];\n\t\tint[] dx={0, 0, -1, 1};\n\t\tint[] dy={-1, 1, 0, 0};\n\t\tfor(int y=0; y<h; y++){\n\t\t\tfor(int x=0; x<w; x++){\n\t\t\t\tfor(int k=0; k<4; k++){\n\t\t\t\t\tint x2=x+dx[k];\n\t\t\t\t\tint y2=y+dy[k];\n\t\t\t\t\tif(x2>=0&&x2<w&&y2>=0&&y2<h){\n\t\t\t\t\t\tg[y*w+x]|=1L<<(y2*w+x2);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tmds=(1L<<n)-1;\n\t\tmds(0, 0, 0);\n\t\tprintln((n-Long.bitCount(mds))+\"\");\n\t}\n\n\tint n;\n\tlong[] g;\n\tlong mds;\n\n\tvoid mds(long choosed, long removed, long covered){\n\t\tif(covered==((1L<<n)-1)){\n\t\t\tmds=choosed;\n\t\t\treturn;\n\t\t}\n\t\tif(Long.bitCount(choosed)>=Long.bitCount(mds)-1)\n\t\t\treturn;\n\t\tlong s=covered;\n\t\tfor(long remained=~removed&((1L<<n)-1); remained!=0; remained&=remained-1){\n\t\t\tint i=Long.numberOfTrailingZeros(remained);\n\t\t\ts|=(1L<<i)|g[i];\n\t\t}\n\t\tif(s!=((1L<<n)-1))\n\t\t\treturn;\n\n\t\tint k=-1;\n\t\tfor(long remained=~removed&((1L<<n)-1); remained!=0; remained&=remained-1){\n\t\t\tint i=Long.numberOfTrailingZeros(remained);\n\t\t\tif((covered>>>i&1)==1){\n\t\t\t\tif(Long.bitCount(g[i]&~covered)<=1){\n\t\t\t\t\tmds(choosed, removed|(1L<<i), covered);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tif(Long.bitCount(g[i]&~removed)==0){\n\t\t\t\t\tmds(choosed|(1L<<i), removed|(1L<<i), covered|(1L<<i)|g[i]);\n\t\t\t\t\treturn;\n\t\t\t\t}else if(Long.bitCount(g[i]&~removed)==1\n\t\t\t\t\t\t&&(g[i]&(~removed|~covered))==(g[i]&~removed)){\n\t\t\t\t\tint j=Long.numberOfTrailingZeros(g[i]&~removed);\n\t\t\t\t\tmds(choosed|(1L<<j), removed|(1L<<i)|(1L<<j), covered\n\t\t\t\t\t\t\t|(1L<<j)|g[j]);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(k==-1||Long.bitCount(g[i]&~covered)>Long.bitCount(g[k]&~covered))\n\t\t\t\tk=i;\n\t\t}\n\t\tif(k==-1)\n\t\t\treturn;\n\t\tmds(choosed|(1L<<k), removed|(1L<<k), covered|(1L<<k)|g[k]);\n\t\tmds(choosed, removed|(1L<<k), covered);\n\t}\n\n\tvoid println(String s){\n\t\tSystem.out.println(s);\n\t}\n\n\tvoid debug(Object... os){\n\t\tSystem.err.println(Arrays.deepToString(os));\n\t}\n\n\tpublic static void main(String[] args){\n\t\tLocale.setDefault(Locale.US);\n\t\tnew P111C().run();\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "48b508b410408ff16a01a2be20b30285", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/**\n * @author derrick20\n */\nimport java.io.*;\nimport java.util.*;\n\npublic class PetyaSpiders implements Runnable {\n public static void main(String[] args) throws Exception {\n new Thread(null, new PetyaSpiders(), \": )\", 1 << 28).start();\n }\n\n public void run() {\n FastScanner sc = new FastScanner();\n PrintWriter out = new PrintWriter(System.out);\n\n N = sc.nextInt();\n M = sc.nextInt();\n if (N > M) {\n int temp = N;\n N = M;\n M = temp;\n }\n // if the max is 1, then 1x1. Else, one dimension is at least 2, so\n // our idea of sliding forward a 2xN window works\n if (M == 1) {\n out.println(0);\n } else {\n int[][][] dp = new int[M][1 << N][1 << N];\n // N, M are at least 2. N <= 6\n // base case: try all prev and curr masks, let next = 0\n for (int prev = 0; prev < 1 << N; prev++) {\n // we cannot allow the previous to have anything except for 0's.\n // this matters for M = 2, since at the end of the dp we are\n // doing a special case for the final column where we need to\n // ensure both curr AND next are validly covered\n if (prev == 0) {\n for (int curr = 0; curr < 1 << N; curr++) {\n // all of these will satisfy the nonexistent columns, of course\n dp[0][prev][curr] = Integer.bitCount(curr);\n }\n } else {\n // not allowed to have nonzero previous spiders\n Arrays.fill(dp[0][prev], oo);\n }\n }\n for (int prev = 0; prev < 1 << N; prev++) {\n for (int curr = 0; curr < 1 << N; curr++) {\n if (isValid(0, prev, curr)) {\n dp[1][prev][curr] = Integer.bitCount(prev) + Integer.bitCount(curr);\n } else {\n dp[1][prev][curr] = oo;\n }\n }\n }\n for (int col = 2; col <= M - 2; col++) {\n for (int next = 0; next < 1 << N; next++) {\n for (int curr = 0; curr < 1 << N; curr++) {\n dp[col][curr][next] = oo;\n for (int prev = 0; prev < 1 << N; prev++) {\n if (dp[col - 1][prev][curr] != oo && isValid(prev, curr, next)) {\n dp[col][curr][next] = Math.min(dp[col][curr][next], dp[col - 1][prev][curr] + Integer.bitCount(next));\n }\n }\n }\n }\n }\n // to get the answer, we need to act on the last column by trying to\n // ensure that both the prev row AND the current row are valid\n // basically, isValid(prev, curr, next) && isValid(curr, next, 0)\n int ans = oo;\n for (int next = 0; next < 1 << N; next++) {\n for (int curr = 0; curr < 1 << N; curr++) {\n dp[M - 1][curr][next] = oo;\n for (int prev = 0; prev < 1 << N; prev++) {\n if (dp[M - 2][prev][curr] != oo && isValid(prev, curr, next) && isValid(curr, next, 0)) {\n dp[M - 1][curr][next] = Math.min(dp[M - 1][curr][next], dp[M - 2][prev][curr] + Integer.bitCount(next));\n ans = Math.min(ans, dp[M - 1][curr][next]);\n }\n }\n }\n }\n// for (int c = 1; c < M; c++) {\n// System.out.println(\"For col = \" + c);\n// for (int prev = 0; prev < 1 << N; prev++) {\n// System.out.println(\"Prev = \" + Integer.toBinaryString(prev));\n// for (int curr = 0; curr < 1 << N; curr++) {\n// System.out.println(\"Curr = \" + Integer.toBinaryString(curr) + \" gives \" + dp[c][prev][curr] + \" \");\n// }\n// }\n// }\n out.println(N * M - ans);\n }\n out.close();\n }\n\n static int N, M;\n static int oo = 999;\n static int[] dr = {1, 0, -1, 0}, dc = {0, 1, 0, -1};\n\n static boolean isValid(int prev, int curr, int next) {\n boolean[][] grid = new boolean[N][3];\n int[] subsets = {prev, curr, next};\n for (int r = 0; r < N; r++) {\n for (int c = 0; c < 3; c++) {\n if ((subsets[c] & 1) > 0) {\n grid[r][c] = true;\n for (int k = 0; k < 4; k++) {\n int r2 = r + dr[k];\n int c2 = c + dc[k];\n if (0 <= r2 && r2 <= N - 1 && 0 <= c2 && c2 <= 2) {\n grid[r2][c2] = true;\n }\n }\n }\n subsets[c] >>= 1;\n }\n }\n for (int r = 0; r < N; r++) {\n if (!grid[r][1]) {\n // we only need to ensure the middle is safe\n return false;\n }\n }\n return true;\n }\n\n static class FastScanner {\n private int BS = 1 << 16;\n private char NC = (char) 0;\n private byte[] buf = new byte[BS];\n private int bId = 0, size = 0;\n private char c = NC;\n private double cnt = 1;\n private BufferedInputStream in;\n\n public FastScanner() {\n in = new BufferedInputStream(System.in, BS);\n }\n\n public FastScanner(String s) {\n try {\n in = new BufferedInputStream(new FileInputStream(new File(s)), BS);\n } catch (Exception e) {\n in = new BufferedInputStream(System.in, BS);\n }\n }\n\n private char getChar() {\n while (bId == size) {\n try {\n size = in.read(buf);\n } catch (Exception e) {\n return NC;\n }\n if (size == -1) return NC;\n bId = 0;\n }\n return (char) buf[bId++];\n }\n\n public int nextInt() {\n return (int) nextLong();\n }\n\n public int[] nextInts(int N) {\n int[] res = new int[N];\n for (int i = 0; i < N; i++) {\n res[i] = (int) nextLong();\n }\n return res;\n }\n\n public long[] nextLongs(int N) {\n long[] res = new long[N];\n for (int i = 0; i < N; i++) {\n res[i] = nextLong();\n }\n return res;\n }\n\n public long nextLong() {\n cnt = 1;\n boolean neg = false;\n if (c == NC) c = getChar();\n for (; (c < '0' || c > '9'); c = getChar()) {\n if (c == '-') neg = true;\n }\n long res = 0;\n for (; c >= '0' && c <= '9'; c = getChar()) {\n res = (res << 3) + (res << 1) + c - '0';\n cnt *= 10;\n }\n return neg ? -res : res;\n }\n\n public double nextDouble() {\n double cur = nextLong();\n return c != '.' ? cur : cur + nextLong() / cnt;\n }\n\n public double[] nextDoubles(int N) {\n double[] res = new double[N];\n for (int i = 0; i < N; i++) {\n res[i] = nextDouble();\n }\n return res;\n }\n\n public String next() {\n StringBuilder res = new StringBuilder();\n while (c <= 32) c = getChar();\n while (c > 32) {\n res.append(c);\n c = getChar();\n }\n return res.toString();\n }\n\n public String nextLine() {\n StringBuilder res = new StringBuilder();\n while (c <= 32) c = getChar();\n while (c != '\\n') {\n res.append(c);\n c = getChar();\n }\n return res.toString();\n }\n\n public boolean hasNext() {\n if (c > 32) return true;\n while (true) {\n c = getChar();\n if (c == NC) return false;\n else if (c > 32) return true;\n }\n }\n }\n\n static void ASSERT(boolean assertion, String message) {\n if (!assertion) throw new AssertionError(message);\n }\n\n static void ASSERT(boolean assertion) {\n if (!assertion) throw new AssertionError();\n }\n}", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "4944077e89a1b17a2c673bf483a9ec0a", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "/*(c) gorlum0 [at] gmail.com*/\nimport java.io.*;\nimport java.util.*;\nimport java.math.*;\n\npublic class E\n{\n int bitcount(int x) {\n int c = 0;\n for ( ; x != 0; c++)\n x &= x-1;\n return c;\n }\n\n boolean bit(int x, int i)\n {\n if (i < 0) return false;\n return (x>>i & 1) == 1 ? true : false;\n }\n\n int solve(int n, int m)\n {\n if (m > n) { int x = m; m = n; n = x; }\n int maxmask = 1<<m;\n\n int[][][] dp = new int[n+1][maxmask][maxmask];\n for (int i = 0; i <= n; i++)\n for (int j = 0; j < maxmask; j++)\n for (int k = 0; k < maxmask; k++)\n dp[i][j][k] = inf;\n for (int i = 0; i < maxmask; i++)\n dp[0][0][i] = bitcount(i);\n\n for (int i = 1; i <= n; i++)\n for (int b = 0; b < maxmask; b++)\n for (int c = 0; c < maxmask; c++)\n for (int a = 0; a < maxmask; a++) {\n boolean nospider = false;\n for (int j = 0; j < m; j++)\n if (not(bit(a,j) || bit(c,j) || bit(b,j-1) || bit(b,j) || bit(b,j+1))) {\n nospider = true;\n break;\n }\n if (nospider) continue;\n\n dp[i][b][c] = Math.min(dp[i][b][c], dp[i-1][a][b] + bitcount(c));\n }\n int res = inf;\n for (int b = 0; b < maxmask; b++)\n res = Math.min(res, dp[n][b][0]);\n return n*m - res;\n }\n\n void main() throws IOException {\n int n;\n while ((n = nextInt()) != EOF) {\n int m = nextInt();\n out.println(solve(n, m));\n }\n }\n\n public static void main(String[] args) {\n new E().run();\n }\n\n // ======================================================================\n\n int inf = (int) 1e9;\n final int EOF = -1;\n\n boolean not(boolean p) { return !p; }\n\n int sqr(int x) { return x*x; }\n long sqr(long x) { return x*x; }\n double sqr(double x) { return x*x; }\n\n BufferedReader fin;\n StringTokenizer st;\n PrintWriter out;\n\n public void run() {\n try {\n fin = new BufferedReader(new InputStreamReader(System.in));\n st = null;\n out = new PrintWriter(System.out);\n main();\n fin.close();\n out.close();\n } catch (Exception e) {\n e.printStackTrace();\n System.exit(1);\n }\n }\n\n int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n String nextToken() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n String line = fin.readLine();\n if (line == null) return \"-1\";\n else st = new StringTokenizer(line);\n }\n return st.nextToken();\n }\n}\n", "lang_cluster": "Java", "tags": ["dp", "bitmasks"], "code_uid": "4757ab03f6f7ce2fbb4ddb03fc52e34f", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\nimport java.lang.*;\nimport java.math.*;\nimport java.io.*;\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\nimport static java.util.Collections.*;\n\n// Petya and Spiders\n// 2012/08/16\npublic class P111C{\n\tScanner sc=new Scanner(System.in);\n\n\tint INF=1<<28;\n\tdouble EPS=1e-9;\n\n\tint h, w;\n\n\tvoid run(){\n\t\th=sc.nextInt();\n\t\tw=sc.nextInt();\n\t\tsolve();\n\t}\n\n\tvoid solve(){\n\t\tn=w*h;\n\t\tg=new long[n];\n\t\tint[] dx={0, 0, -1, 1};\n\t\tint[] dy={-1, 1, 0, 0};\n\t\tfor(int y=0; y<h; y++){\n\t\t\tfor(int x=0; x<w; x++){\n\t\t\t\tfor(int k=0; k<4; k++){\n\t\t\t\t\tint x2=x+dx[k];\n\t\t\t\t\tint y2=y+dy[k];\n\t\t\t\t\tif(x2>=0&&x2<w&&y2>=0&&y2<h){\n\t\t\t\t\t\tg[y*w+x]|=1L<<(y2*w+x2);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tmds=(1L<<n)-1;\n\t\tmds(0, 0, 0);\n\t\tprintln((n-Long.bitCount(mds))+\"\");\n\t}\n\n\tint n;\n\tlong[] g;\n\tlong mds;\n\n\tvoid mds(long choosed, long removed, long covered){\n\t\tif(Long.bitCount(choosed)>=Long.bitCount(mds))\n\t\t\treturn;\n\n\t\tif(covered==((1L<<n)-1)){\n\t\t\tmds=choosed;\n\t\t\treturn;\n\t\t}\n\n\t\tlong s=covered;\n\t\tfor(long remained=~removed&((1L<<n)-1); remained!=0; remained&=remained-1){\n\t\t\tint i=Long.numberOfTrailingZeros(remained);\n\t\t\ts|=(1L<<i)|g[i];\n\t\t}\n\t\tif(s!=((1L<<n)-1))\n\t\t\treturn;\n\n\t\tint k=-1;\n\t\tfor(long remained=~removed&((1L<<n)-1); remained!=0; remained&=remained-1){\n\t\t\tint i=Long.numberOfTrailingZeros(remained);\n\t\t\tif((covered>>>i&1)==1){\n\t\t\t\tif(Long.bitCount(g[i]&~covered)==0){\n\t\t\t\t\tmds(choosed, removed|(1L<<i), covered);\n\t\t\t\t\treturn;\n\t\t\t\t}else if(Long.bitCount(g[i]&~covered)==1\n\t\t\t\t\t\t&&(g[i]&~covered&~removed)!=0){\n\t\t\t\t\tmds(choosed, removed|(1L<<i), covered);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tif(Long.bitCount(g[i]&~removed)==0){\n\t\t\t\t\tmds(choosed|(1L<<i), removed|(1L<<i), covered|(1L<<i)|g[i]);\n\t\t\t\t\treturn;\n\t\t\t\t}else if(Long.bitCount(g[i]&~removed)==1\n\t\t\t\t\t\t&&((g[i]&~removed)|(g[i]&~covered))==(g[i]&~removed)){\n\t\t\t\t\tint j=Long.numberOfTrailingZeros(g[i]&~removed);\n\t\t\t\t\tmds(choosed|(1L<<j), removed|(1L<<i)|(1L<<j), covered\n\t\t\t\t\t\t\t|(1L<<j)|g[j]);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(k==-1||Long.bitCount(g[i]&~covered)>Long.bitCount(g[k]&~covered))\n\t\t\t\tk=i;\n\t\t}\n\t\tif(k==-1)\n\t\t\treturn;\n\n\t\tmds(choosed|(1L<<k), removed|(1L<<k), covered|(1L<<k)|g[k]);\n\t\tmds(choosed, removed|(1L<<k), covered);\n\t}\n\n\tvoid println(String s){\n\t\tSystem.out.println(s);\n\t}\n\n\tvoid debug(Object... os){\n\t\tSystem.err.println(Arrays.deepToString(os));\n\t}\n\n\tpublic static void main(String[] args){\n\t\tLocale.setDefault(Locale.US);\n\t\tnew P111C().run();\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "32697b395cdd869f3a881830c2223946", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/*\nIf you want to aim high, aim high\nDon't let that studying and grades consume you\nJust live life young\n******************************\nIf I'm the sun, you're the moon\nBecause when I go up, you go down\n*******************************\nI'm working for the day I will surpass you\nhttps://www.a2oj.com/Ladder16.html\n*/\nimport java.util.*;\nimport java.io.*;\nimport java.math.*;\n\n public class x111C\n {\n public static void main(String omkar[]) throws Exception\n {\n BufferedReader infile = new BufferedReader(new InputStreamReader(System.in)); \n StringTokenizer st = new StringTokenizer(infile.readLine());\n int R = Integer.parseInt(st.nextToken());\n int C = Integer.parseInt(st.nextToken());\n if(R > C)\n {\n int t = R;\n R = C;\n C = t;\n }\n //dp[c][m1][m2] = min spoders in first c columns\n int[][][] dp = new int[C+1][1 << R][1 << R];\n for(int i=0; i <= C; i++)\n for(int mask=0; mask < (1<<R); mask++)\n Arrays.fill(dp[i][mask], 69);\n for(int mask=0; mask < (1<<R); mask++)\n dp[0][0][mask] = 0;\n for(int c=1; c <= C; c++)\n for(int mask1=0; mask1 < (1<<R); mask1++)\n for(int mask2=0; mask2 < (1<<R); mask2++)\n for(int mask3=0; mask3 < (1<<R); mask3++)\n {\n boolean works = true;\n for(int b=0; b < R; b++)\n if((mask2&(1<<b)) == 0)\n {\n if(b > 0 && (mask2&(1<<(b-1))) > 0);\n else if(b+1 < R && (mask2&(1<<(b+1))) > 0);\n else if((mask1&(1<<b)) > 0);\n else if((mask3&(1<<b)) > 0);\n else works = false;\n }\n if(works)\n dp[c][mask2][mask3] = Math.min(dp[c][mask2][mask3], dp[c-1][mask1][mask2]+Integer.bitCount(mask1));\n }\n int res = 0;\n for(int mask=0; mask < (1<<R); mask++)\n res = Math.max(res, R*C-(dp[C][mask][0]+Integer.bitCount(mask)));\n System.out.println(res);\n }\n }", "lang_cluster": "Java", "tags": ["dp", "bitmasks"], "code_uid": "e77f2c7970eed6e535bbe9d5046bfadf", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// practice with rainboy\nimport java.io.*;\nimport java.util.*;\n\npublic class CF111C extends PrintWriter {\n\tCF111C() { super(System.out, true); }\n\tScanner sc = new Scanner(System.in);\n\tpublic static void main(String[] $) {\n\t\tCF111C o = new CF111C(); o.main(); o.flush();\n\t}\n\n\tint encode(int[] aa, int m) {\n\t\tint a = 0;\n\t\tfor (int j = 0; j < m; j++)\n\t\t\ta = a * 3 + aa[j];\n\t\treturn a;\n\t}\n\tvoid decode(int[] aa, int m, int a, int base) {\n\t\tfor (int j = m - 1; j >= 0; j--) {\n\t\t\taa[j] = a % base;\n\t\t\ta /= base;\n\t\t}\n\t}\n\tvoid main() {\n\t\tint n = sc.nextInt();\n\t\tint m = sc.nextInt();\n\t\tif (n < m) {\n\t\t\tint tmp = n; n = m; m = tmp;\n\t\t}\n\t\tint p = 1;\n\t\tfor (int j = 0; j < m; j++)\n\t\t\tp *= 3;\n\t\tint[] dp = new int[p];\n\t\tint[] dq = new int[p];\n\t\tint[] aa = new int[m];\n\t\tint[] bb = new int[m];\n\t\tfor (int j = 0; j < m; j++)\n\t\t\taa[j] = 1;\n\t\tArrays.fill(dp, -1);\n\t\tdp[encode(aa, m)] = 0;\n\t\twhile (n-- > 0) {\n\t\t\tArrays.fill(dq, -1);\n\t\t\tfor (int a = 0; a < p; a++) {\n\t\t\t\tif (dp[a] < 0)\n\t\t\t\t\tcontinue;\n\t\t\t\tdecode(aa, m, a, 3);\n\t\t\t\tfor (int b = 0; b < 1 << m; b++) {\n\t\t\t\t\tdecode(bb, m, b, 2);\n\t\t\t\t\tboolean bad = false;\n\t\t\t\t\tfor (int j = 0; j < m; j++)\n\t\t\t\t\t\tif (aa[j] == 0 && bb[j] == 0) {\n\t\t\t\t\t\t\tbad = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\tif (bad)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tint cnt = 0;\n\t\t\t\t\tfor (int j = 0; j < m; j++)\n\t\t\t\t\t\tif (bb[j] == 1) {\n\t\t\t\t\t\t\tbb[j] = 2;\n\t\t\t\t\t\t\tcnt++;\n\t\t\t\t\t\t}\n\t\t\t\t\tfor (int j = 0; j < m; j++)\n\t\t\t\t\t\tif (bb[j] == 0 && (aa[j] == 2 || j > 0 && bb[j - 1] == 2 || j + 1 < m && bb[j + 1] == 2))\n\t\t\t\t\t\t\tbb[j] = 1;\n\t\t\t\t\tint a_ = encode(bb, m);\n\t\t\t\t\tdq[a_] = Math.max(dq[a_], dp[a] + m - cnt);\n\t\t\t\t}\n\t\t\t}\n\t\t\tint[] tmp = dp; dp = dq; dq = tmp;\n\t\t}\n\t\tint ans = 0;\n\t\tfor (int a = 0; a < p; a++) {\n\t\t\tif (dp[a] <= ans)\n\t\t\t\tcontinue;\n\t\t\tdecode(aa, m, a, 3);\n\t\t\tboolean bad = false;\n\t\t\tfor (int j = 0; j < m; j++)\n\t\t\t\tif (aa[j] == 0) {\n\t\t\t\t\tbad = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\tif (!bad)\n\t\t\t\tans = dp[a];\n\t\t}\n\t\tprintln(ans);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "e0ec74c45c913611e596623fbd3a31be", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\nimport java.lang.*;\nimport java.math.*;\nimport java.io.*;\n\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\n\npublic class C{\n Scanner sc=new Scanner(System.in);\n\n int INF=1<<28;\n double EPS=1e-9;\n\n int n, m;\n\n void run(){\n n=sc.nextInt();\n m=sc.nextInt();\n solve();\n }\n\n void solve(){\n if(n<m){\n int t=n;\n n=m;\n m=t;\n }\n int full=(1<<m)-1;\n int[][] dp=new int[1<<m][1<<m];\n int[][] tmp=new int[1<<m][1<<m];\n for(int i=0; i<1<<m; i++){\n fill(dp[i], INF);\n }\n for(int i=0; i<1<<m; i++){\n int b1=(i|(i>>1)|(i<<1))&full;\n int b2=i;\n dp[b1][b2]=Integer.bitCount(i);\n debug(Integer.toBinaryString(b1), dp[b1]);\n }\n debug();\n for(int j=0; j<n-1; j++){\n for(int i=0; i<1<<m; i++){\n System.arraycopy(dp[i], 0, tmp[i], 0, 1<<m);\n fill(dp[i], INF);\n }\n\n for(int b1=0; b1<1<<m; b1++){\n for(int b2=0; b2<1<<m; b2++){\n for(int i=0; i<1<<m; i++){\n if((b1|i)!=full){\n continue;\n }\n if(false)\n debug(Integer.toBinaryString(b1),\n Integer.toBinaryString(b2),\n Integer.toBinaryString(i));\n int b=(i|(i>>1)|(i<<1))&full;\n dp[b2|b][i]=min(dp[b2|b][i],\n tmp[b1][b2]+Integer.bitCount(i));\n }\n }\n }\n debug(j);\n for(int i=0; i<1<<m; i++){\n debug(Integer.toBinaryString(i), dp[i]);\n }\n }\n\n int min=INF;\n for(int i=0; i<1<<m; i++){\n min=min(min, dp[full][i]);\n }\n debug(min);\n int ans=m*n-min;\n debug(\"ans\",ans);\n println(ans+\"\");\n }\n\n void println(String s){\n System.out.println(s);\n }\n\n void print(String s){\n System.out.print(s);\n }\n\n void debug(Object... os){\n // System.err.println(Arrays.deepToString(os));\n }\n\n public static void main(String[] args){\n new C().run();\n }\n}\n", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "2abaf7b595b1fb8d4166109cec93a65c", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport static java.lang.Math.*;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.Map.Entry;\nimport java.util.StringTokenizer;\nimport java.util.TreeMap;\n\n/**\n *\n * @author pttrung\n */\npublic class C {\n\n public static double Epsilon = 1e-6;\n public static long x, y, d;\n public static long MOD = 1000000007;\n public static int[][][] dp;\n public static int min, max, need;\n\n public static void main(String[] args) {\n\n Scanner in = new Scanner();\n PrintWriter out = new PrintWriter(System.out);\n\n int n = in.nextInt();\n int m = in.nextInt();\n min = Math.min(n, m);\n max = (m + n) - min;\n dp = new int[max][1 << min][1 << min];\n\n for (int[][] temp : dp) {\n for (int[] val : temp) {\n Arrays.fill(val, -1);\n }\n }\n need = (1 << min) - 1;\n //System.out.println(add + total);\n // System.out.println(min + \" \" + max);\n\n out.println(cal(0, 0, 0));\n\n out.close();\n\n }\n\n public static int cal(int index, int last, int lastHold) {\n\n if (index == max) {\n return 0;\n }\n if (dp[index][lastHold][last] != -1) {\n return dp[index][lastHold][last];\n }\n int result = 0;\n\n for (int i = 0; i < 1 << min; i++) {\n if ((i | last) == need || (index == 0)) {\n // System.out.println(\"PREV \" + index + \" \" + i + \" \" + last + \" \" + lastHold);\n // System.out.println(\"NEXT \" + index + \" \" + i + \" \" + (i | lastHold) + \" \" + i);\n // System.out.println(Integer.bitCount(i) + \" \" + i);\n\n// if (index == 3) {\n// System.out.println(last + \" \" + i + \" \" + match(i, last) + \" \" + next);\n// }\n if(index + 1 == max && match(i,lastHold)!= need){\n continue;\n }\n int temp = cal(index + 1, match(i,lastHold), i) + (min - Integer.bitCount(i));\n result = result < temp ? temp : result;\n\n // break;\n }\n }\n dp[index][lastHold][last] = result;\n return result;\n }\n\n public static int match(int mask, int last) {\n int result = last;\n for (int i = 0; i < min; i++) {\n if (((1 << i) & mask) != 0) {\n int a = i - 1;\n int b = i + 1;\n result |= (1 << i);\n if (a >= 0) {\n result |= (1 << a);\n }\n if (b < min) {\n result |= (1 << b);\n }\n }\n }\n // System.out.println(mask + \" \" + result + \" \" + need);\n return result ;\n }\n\n public static long pow(long a, long b) {\n if (b == 0) {\n return 1;\n }\n long val = pow(a, b / 2);\n if (b % 2 == 0) {\n return val * val % MOD;\n } else {\n return a * (val * val % MOD) % MOD;\n }\n }\n\n public static void extendEuclid(long a, long b) {\n if (b == 0) {\n x = 1;\n y = 0;\n d = a;\n return;\n }\n extendEuclid(b, a % b);\n long x1 = y;\n long y1 = x - (a / b) * y;\n x = x1;\n y = y1;\n\n }\n\n public static long gcd(long a, long b) {\n if (b == 0) {\n return a;\n }\n return gcd(b, a % b);\n }\n\n static class Line {\n\n double a, b, c;\n\n Line(double x1, double y1, double x2, double y2) {\n if (Math.abs(x1 - x2) < Epsilon && Math.abs(y1 - y2) < Epsilon) {\n throw new RuntimeException(\"Two point are the same\");\n }\n a = y1 - y2;\n b = x2 - x1;\n c = -a * x1 - b * y1;\n }\n\n Line(Point x, Point y) {\n this(x.x, x.y, y.x, y.y);\n }\n\n public Line perpendicular(Point p) {\n return new Line(p, new Point(p.x + a, p.y + b));\n }\n\n public Point intersect(Line l) {\n double d = a * l.b - b * l.a;\n if (d == 0) {\n throw new RuntimeException(\"Two lines are parallel\");\n }\n\n return new Point((l.c * b - c * l.b) / d, (l.a * c - l.c * a) / d);\n }\n }\n\n static void check(Point a, Point b, ArrayList<Point> p, Point[] rec, int index) {\n for (int i = 0; i < 4; i++) {\n int m = (i + index) % 4;\n int j = (i + 1 + index) % 4;\n Point k = intersect(minus(b, a), minus(rec[m], rec[j]), minus(rec[m], a));\n if (k.x >= 0 && k.x <= 1 && k.y >= 0 && k.y <= 1) {\n Point val = new Point(k.x * minus(b, a).x, k.x * minus(b, a).y);\n p.add(add(val, a));\n // System.out.println(a + \" \" + b + \" \" + rec[i] + \" \" + rec[j]);\n // System.out.println(add(val, a));\n }\n }\n }\n\n static Point intersect(Point a, Point b, Point c) {\n double D = cross(a, b);\n if (D != 0) {\n return new Point(cross(c, b) / D, cross(a, c) / D);\n }\n return null;\n }\n\n static Point convert(Point a, double angle) {\n double x = a.x * cos(angle) - a.y * sin(angle);\n double y = a.x * sin(angle) + a.y * cos(angle);\n return new Point(x, y);\n }\n\n static Point minus(Point a, Point b) {\n return new Point(a.x - b.x, a.y - b.y);\n }\n\n static Point add(Point a, Point b) {\n return new Point(a.x + b.x, a.y + b.y);\n }\n\n static double cross(Point a, Point b) {\n return a.x * b.y - a.y * b.x;\n }\n\n static class Point {\n\n double x, y;\n\n Point(double x, double y) {\n this.x = x;\n this.y = y;\n }\n\n @Override\n public String toString() {\n return \"Point: \" + x + \" \" + y;\n }\n }\n\n static class Scanner {\n\n BufferedReader br;\n StringTokenizer st;\n\n public Scanner() {\n // System.setOut(new PrintStream(new BufferedOutputStream(System.out), true));\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n public String next() {\n\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (Exception e) {\n throw new RuntimeException();\n }\n }\n return st.nextToken();\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public String nextLine() {\n st = null;\n try {\n return br.readLine();\n } catch (Exception e) {\n throw new RuntimeException();\n }\n }\n\n public boolean endLine() {\n try {\n String next = br.readLine();\n while (next != null && next.trim().isEmpty()) {\n next = br.readLine();\n }\n if (next == null) {\n return true;\n }\n st = new StringTokenizer(next);\n return st.hasMoreTokens();\n } catch (Exception e) {\n throw new RuntimeException();\n }\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "5223bb1846f8443667b96d83ff05abcf", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\n/**\n * Author -\n * User: kansal\n * Date: 9/3/11\n * Time: 5:28 PM\n */\npublic class CF85C {\n public static void main(String[] args) {\n reader = new BufferedReader(new InputStreamReader(System.in));\n\n int height = nextInt(), width = nextInt();\n if (width > height) {\n int t = width;\n width = height;\n height = t;\n }\n\n final int INF = height * width + 10;\n final int ALL_BITS = (1 << width) - 1;\n int[][][] dp = new int[height + 1][1 << width][1 << width];\n for (int[][] ints : dp) {\n for (int[] anInt : ints) {\n Arrays.fill(anInt, INF);\n }\n }\n\n dp[0][0][0] = 0;\n for(int r = 0; r < height; ++r) {\n for(int uncovered = 0; uncovered < (1 << width); ++uncovered) {\n for(int mask = 0; mask < (1 << width); ++mask) {\n if (dp[r][uncovered][mask] == INF) {\n continue;\n }\n for(int curMask = uncovered; curMask < (1 << width); curMask = (curMask + 1) | uncovered) {\n int curCovered = (mask | curMask);\n curCovered |= (curMask >> 1);\n curCovered |= (ALL_BITS & (curMask << 1));\n\n int curUncovered = ALL_BITS ^ curCovered;\n dp[r+1][curUncovered][curMask] = Math.min(dp[r+1][curUncovered][curMask], dp[r][uncovered][mask] + Integer.bitCount(curMask));\n }\n }\n }\n }\n\n int res = INF;\n for(int x: dp[height][0]) res = Math.min(res, x);\n\n System.out.println(height * width - res);\n }\n\n private static boolean hasBit(int mask, int bit) {\n return (((mask >> bit) & 1) == 1);\n }\n\n public static BufferedReader reader;\n\n public static StringTokenizer tokenizer = null;\n\n static String nextToken() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n static public int nextInt() {\n return Integer.parseInt(nextToken());\n }\n\n static public long nextLong() {\n return Long.parseLong(nextToken());\n }\n\n static public String next() {\n return nextToken();\n }\n\n static public String nextLine() {\n try {\n return reader.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return null;\n }\n\n}\n", "lang_cluster": "Java", "tags": ["dp", "bitmasks"], "code_uid": "ae3bec1154073d6603b25e886b9d6f2c", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Arrays;\n\n/**\n * Created by IntelliJ IDEA.\n * User: piyushd\n * Date: 3/26/11\n * Time: 10:53 PM\n * To change this template use File | Settings | File Templates.\n */\npublic class TaskC {\n\n final int INF = 123456;\n int[][][] memo;\n int N, M;\n\n int solve(int row, int prevFreeMask, int curStayMask) {\n if(row == N) return (curStayMask == 0) ? 0 : -INF;\n if(memo[row][prevFreeMask][curStayMask] != -1) return memo[row][prevFreeMask][curStayMask];\n\n int res = 0;\n for(int mask = 0; mask < (1<<M); mask++) {\n if((mask & curStayMask) == curStayMask) {\n int freeCellsMask = (1<<M) - 1 - mask;\n int toMoveMask = freeCellsMask;\n\n for(int i = 0; i < M; i++) {\n if((toMoveMask & (1<<i)) > 0) {\n if(i > 0) {\n if((mask & (1<<(i - 1))) > 0) {\n toMoveMask -= (1<<i);\n continue;\n }\n }\n\n if(i < M - 1) {\n if((mask & (1<<(i + 1))) > 0) {\n toMoveMask -= (1<<i);\n continue;\n }\n }\n }\n }\n\n if (row > 0) {\n for (int prevFillMask = toMoveMask; prevFillMask > 0; prevFillMask = (prevFillMask - 1) & toMoveMask) {\n int bc1 = Integer.bitCount(freeCellsMask);\n int bc2 = Integer.bitCount(prevFreeMask & prevFillMask);\n res = Math.max(res, bc1 - bc2 + solve(row + 1, freeCellsMask, toMoveMask ^ prevFillMask));\n }\n }\n\n res = Math.max(res, Integer.bitCount(freeCellsMask) + solve(row + 1, freeCellsMask, toMoveMask));\n }\n }\n\n return memo[row][prevFreeMask][curStayMask] = res;\n }\n\n void run() {\n N = nextInt();\n M = nextInt();\n if(M > N) {\n int temp = M;\n M = N;\n N = temp;\n }\n\n this.memo = new int[N + 1][1<<M][1<<M];\n for(int[][] g : memo) for(int[] f : g) Arrays.fill(f, -1);\n\n System.out.println(solve(0, 0, 0));\n }\n\n int nextInt(){\n try{\n int c = System.in.read();\n if(c == -1) return c;\n while(c != '-' && (c < '0' || '9' < c)){\n c = System.in.read();\n if(c == -1) return c;\n }\n if(c == '-') return -nextInt();\n int res = 0;\n do{\n res *= 10;\n res += c - '0';\n c = System.in.read();\n }while('0' <= c && c <= '9');\n return res;\n }catch(Exception e){\n return -1;\n }\n }\n\n long nextLong(){\n try{\n int c = System.in.read();\n if(c == -1) return -1;\n while(c != '-' && (c < '0' || '9' < c)){\n c = System.in.read();\n if(c == -1) return -1;\n }\n if(c == '-') return -nextLong();\n long res = 0;\n do{\n res *= 10;\n res += c-'0';\n c = System.in.read();\n }while('0' <= c && c <= '9');\n return res;\n }catch(Exception e){\n return -1;\n }\n }\n\n double nextDouble(){\n return Double.parseDouble(next());\n }\n\n String next(){\n try{\n StringBuilder res = new StringBuilder(\"\");\n int c = System.in.read();\n while(Character.isWhitespace(c))\n c = System.in.read();\n do{\n res.append((char)c);\n }while(!Character.isWhitespace(c=System.in.read()));\n return res.toString();\n }catch(Exception e){\n return null;\n }\n }\n\n String nextLine(){\n try{\n StringBuilder res = new StringBuilder(\"\");\n int c = System.in.read();\n while(c == '\\r' || c == '\\n')\n c = System.in.read();\n do{\n res.append((char)c);\n c = System.in.read();\n }while(c != '\\r' && c != '\\n');\n return res.toString();\n }catch(Exception e){\n return null;\n }\n }\n\n public static void main(String[] args){\n new TaskC().run();\n }\n}\n", "lang_cluster": "Java", "tags": ["dp", "bitmasks"], "code_uid": "9c41b4a3f5e80cc622fbde4c39859c52", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\nimport static java.lang.Math.*;\n\npublic class Code implements Runnable {\n\n public static void main(String[] args) throws IOException {\n new Thread(new Code()).start();\n }\n\n private void solve() throws IOException {\n int n = nextInt(), m = nextInt();\n if(n > m) {\n n ^= m;\n m ^= n;\n n ^= m;\n }\n\n int[][][] dp = new int[41][64][64];\n for(int i = 0; i < 41; ++i)\n for(int j = 0; j < 64; ++j)\n for(int k = 0; k < 64; ++k) dp[i][j][k] = Integer.MAX_VALUE / 2;\n\n for(int i = 0; i < 64; ++i) dp[0][0][i] = countBit(i);\n\n for(int i = 1; i <= m; ++i) {\n for(int cur = 0; cur < 64; ++cur) {\n for(int next = 0; next < 64; ++next) {\n for(int prev = 0; prev < 64; ++prev) {\n if(!isBad(prev, cur, next, n)) {\n dp[i][cur][next] = min(dp[i][cur][next], dp[i - 1][prev][cur] + countBit(next));\n }\n }\n }\n }\n }\n\n int ans = Integer.MAX_VALUE;\n for(int i = 0; i < 64; ++i) ans = min(ans, dp[m][i][0]);\n\n writer.println(n * m - ans);\n }\n\n private boolean isBit(int bits, int pos) {\n return pos < 0 ? false : ((bits & (1 << pos)) != 0);\n }\n\n private boolean isBad(int prev, int cur, int next, int count) {\n for(int i = 0; i < count; ++i)\n if(!(isBit(cur, i - 1) || isBit(cur, i) || isBit(cur, i + 1) || isBit(prev, i) || isBit(next, i))) return true;\n return false;\n }\n\n private int countBit(int bits) {\n int ans = 0;\n for(int i = 0; i < 6; ++i) ans += (bits & (1 << i)) > 0 ? 1 : 0;\n return ans;\n }\n\n private class Pair<E extends Comparable, V extends Comparable> implements Comparable<Pair<E, V>> {\n public Pair(E first, V second) {\n this.first = first;\n this.second = second;\n }\n\n @Override\n public int compareTo(Pair<E, V> obj) {\n if(first == obj.first) return second.compareTo(obj.second);\n return first.compareTo(obj.first);\n }\n\n @Override\n public boolean equals(Object obj) {\n Pair other = (Pair)obj;\n return first.equals(other.first) && second.equals(other.second);\n }\n\n public E first;\n public V second;\n }\n\n @Override\n public void run() {\n try {\n if(in.equals(\"\")) reader = new BufferedReader(new InputStreamReader(System.in));\n else reader = new BufferedReader(new FileReader(in));\n\n if(out.equals(\"\")) writer = new PrintWriter(new OutputStreamWriter(System.out));\n else writer = new PrintWriter(new FileWriter(out));\n solve();\n } catch(IOException e) {\n e.printStackTrace();\n } finally {\n try {\n reader.close();\n writer.close();\n } catch(IOException e) {\n e.printStackTrace();\n }\n }\n }\n\n private int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n private long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n private double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n private float nextFloat() throws IOException {\n return Float.parseFloat(nextToken());\n }\n\n private String nextToken() throws IOException {\n while(st == null || !st.hasMoreTokens()) st = new StringTokenizer(reader.readLine());\n return st.nextToken();\n }\n\n private String in = \"\", out = \"\";\n private BufferedReader reader;\n private PrintWriter writer;\n private StringTokenizer st;\n}", "lang_cluster": "Java", "tags": ["dp", "bitmasks"], "code_uid": "cd2edef693b18faa4f075d5962f2911b", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "\nimport java.util.*;\n\n\npublic class E\n{\n public static void main(String[] args)\n {\n new E(new Scanner(System.in));\n }\n\n int N, M;\n int[][][] memo;\n\n int go(int i, int j, int mask)\n {\n if (i == N)\n return go(0, j+1, mask);\n if (j == M)\n {\n int mm = mask%(1<<N);\n //System.out.println(Integer.toBinaryString(mm)+\" \"+Integer.toBinaryString(mask));\n if (mm != ((1<<N)-1))\n return N*M;\n return 0;\n }\n\n if (memo[i][j][mask] != -1)\n return memo[i][j][mask];\n\n // Now place a spider cluster here\n int nMask = mask;\n int prevMask = 0;\n if (i > 0)\n prevMask = 1 << (N-1);\n int nextMask = 0;\n if (i < (N-1))\n nextMask = 1 << (N+1);\n int curMask = 1 << N;\n int nextRowMask = 1 << (N+N);\n nMask = nMask|prevMask|nextMask|curMask|nextRowMask;\n nMask = nMask/2;\n int res = 1+go(i+1, j, nMask);\n \n int pr = mask%2;\n if (pr == 1)\n {\n // We have the option to skip here\n int rr = go(i+1, j, mask/2);\n if (rr < res)\n res = rr;\n }\n\n \n //System.out.printf(\"%d %d %s = %d%n\", i, j, Integer.toBinaryString(mask), res);\n memo[i][j][mask] = res;\n return res;\n }\n\n public E(Scanner in)\n {\n int[] vals = new int[2];\n vals[0] = in.nextInt();\n vals[1] = in.nextInt();\n Arrays.sort(vals);\n\n N = vals[0];\n M = vals[1];\n memo = new int[N][M][1<<(N+N+1)];\n fill3(memo, -1);\n \n int r1 = go(0, 0, (1<<N)-1);\n int res = N*M-r1;\n System.out.printf(\"%d%n\", res);\n \n }\n\n void fill3(int[][][] vvv, int val)\n {\n for (int[][] vv : vvv)\n for (int[] v : vv)\n Arrays.fill(v, val);\n }\n}\n", "lang_cluster": "Java", "tags": ["dp", "bitmasks"], "code_uid": "56ffc47ef04ab2ce1fb2b29bf26bf4a6", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import static java.lang.Math.*;\nimport static java.lang.System.currentTimeMillis;\nimport static java.lang.System.exit;\nimport static java.lang.System.arraycopy;\nimport static java.util.Arrays.sort;\nimport static java.util.Arrays.binarySearch;\nimport static java.util.Arrays.fill;\nimport java.util.*;\nimport java.io.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\ttry {\n\t\t\tif (new File(\"input.txt\").exists())\n\t\t\t\tSystem.setIn(new FileInputStream(\"input.txt\"));\n\t\t} catch (SecurityException e) {\n\t\t}\n\t\tnew Thread(null, new Runnable() {\n\t\t\tpublic void run() {\n\t\t\t\ttry {\n\t\t\t\t\tnew Main().run();\n\t\t\t\t} catch (Throwable e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t\texit(999);\n\t\t\t\t}\n\t\t\t}\n\t\t}, \"1\", 1 << 23).start();\n\t}\n\n\tBufferedReader in;\n\tPrintWriter out;\n\tStringTokenizer st = new StringTokenizer(\"\");\n\n\tint n, m;\n\tint dp[][][];\n\tint MV = Integer.MAX_VALUE >> 1;\n\tint ans = MV;\n\t\n\tprivate void run() throws IOException {\n\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\n\t\tn = nextInt();\n\t\tm = nextInt();\n\t\tif(n < m){ int d = n; n = m; m = d; }\n\t\tint M = 1 << m;\n\t\tdp = new int[n][M][M];\n\t\tfor(int a[][] : dp)\n\t\t\tfor(int b[] : a)\n\t\t\t\tfill(b, MV);\n\t\t\n//\t\tfor(int i = 0 ; i < M; i++){\n//\t\t\tint next = (( i | (i << 1) | (i >> 1) ) & (M - 1));\n//\t\t\tif( next!= (M -1))\n//\t\t\t\tcontinue;\n//\t\t\tif(n > 1)\n//\t\t\t\tdp[0][next][0] = Integer.bitCount(i);\n//\t\t\telse\n//\t\t\t\tans = min(ans, Integer.bitCount(i));\n//\t\t}\n\t\tdp[0][0][0] = 0;\n\t\t\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int m1 = 0; m1 < M; m1++)\n\t\t\t\tfor(int m2 = 0; m2 < M; m2++){\n\t\t\t\t\tif(dp[i][m1][m2] == MV)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tfor(int nm1 = 0; nm1 < M; nm1++)\n\t\t\t\t\t\tfor(int nm2 = 0; nm2 < M; nm2++){\n\t\t\t\t\t\t\tint res1 = m1 | (nm1) | (nm1 << 1) | (nm1 >> 1) | (nm2);\n\t\t\t\t\t\t\tres1 &= (M - 1);\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tif(res1 != (M - 1))\n\t\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tint res2 = m2 | (nm1) | (nm2 << 1) | (nm2 >> 1) | (nm2);\n\t\t\t\t\t\t\tres2 &= (M - 1);\n\t\t\t\t\t\t\t\n//\t\t\t\t\t\t\tif(i == 2 && m1 == 3 && m2 == 2 && nm1 == 0 && nm2 == 0){\n//\t\t\t\t\t\t\t\tSystem.err.println(\"kek\");\n//\t\t\t\t\t\t\t\tSystem.err.println(dp[i][m1][m2]);\n//\t\t\t\t\t\t\t\tSystem.err.println(res1 + \" | \" + res2);\n//\t\t\t\t\t\t\t\tSystem.err.println(M);\n//\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tint next1 = res2 & (M - 1);\n\t\t\t\t\t\t\tint next2 = nm2 & ( M - 1);\n\t\t\t\t\t\t\tint over = Integer.bitCount(nm1) + Integer.bitCount(nm2);\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tif(i < n - 1)\n\t\t\t\t\t\t\t\tdp[i+1][next1][next2] = min(dp[i + 1][next1][next2], dp[i][m1][m2] + over);\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\tif((res1 & (M - 1)) == (M - 1)){\n\t\t\t\t\t\t\t\t\tans = min(dp[i][m1][m2] + over, ans);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t}\n//\t\tSystem.err.println(ans);\n\t\tout.println(n * m - ans);\n\t\t\n\t\tin.close();\n\t\tout.close();\n\t}\n\tString nextToken() throws IOException {\n\t\twhile (!st.hasMoreTokens())\n\t\t\tst = new StringTokenizer(in.readLine());\n\t\treturn st.nextToken();\n\t}\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\tlong nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\tdouble nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n\tString nextLine() throws IOException {\n\t\tst = new StringTokenizer(\"\");\n\t\treturn in.readLine();\n\t}\n\tboolean EOF() throws IOException {\n\t\twhile (!st.hasMoreTokens()) {\n\t\t\tString s = in.readLine();\n\t\t\tif (s == null)\n\t\t\t\treturn true;\n\t\t\tst = new StringTokenizer(s);\n\t\t}\n\t\treturn false;\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "3f269d78ce04f24f0e49df9bf62ac67b", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\nimport java.lang.*;\nimport java.math.*;\nimport java.io.*;\n\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\n\n// Petya and Spiders\n// 2011/9/3\npublic class P111C{\n\tScanner sc=new Scanner(System.in);\n\n\tint INF=1<<28;\n\n\tint n, m;\n\n\tvoid run(){\n\t\tn=sc.nextInt();\n\t\tm=sc.nextInt();\n\t\tsolve();\n\t}\n\n\tvoid solve(){\n\t\tif(n<m){\n\t\t\tint t=n;\n\t\t\tn=m;\n\t\t\tm=t;\n\t\t}\n\t\tint full=(1<<m)-1;\n\t\tint[][] dp=new int[1<<m][1<<m];\n\t\tint[][] tmp=new int[1<<m][1<<m];\n\t\tfor(int i=0; i<1<<m; i++){\n\t\t\tfill(dp[i], INF);\n\t\t}\n\t\tfor(int i=0; i<1<<m; i++){\n\t\t\tint b1=(i|(i>>1)|(i<<1))&full;\n\t\t\tint b2=i;\n\t\t\tdp[b1][b2]=Integer.bitCount(i);\n\t\t}\n\t\tfor(int j=0; j<n-1; j++){\n\t\t\tfor(int i=0; i<1<<m; i++){\n\t\t\t\tSystem.arraycopy(dp[i], 0, tmp[i], 0, 1<<m);\n\t\t\t\tfill(dp[i], INF);\n\t\t\t}\n\n\t\t\tfor(int b1=0; b1<1<<m; b1++){\n\t\t\t\tfor(int b2=0; b2<1<<m; b2++){\n\t\t\t\t\tfor(int i=0; i<1<<m; i++){\n\t\t\t\t\t\tif((b1|i)!=full){\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tint b=(i|(i>>1)|(i<<1))&full;\n\t\t\t\t\t\tdp[b2|b][i]=min(dp[b2|b][i],\n\t\t\t\t\t\t\t\ttmp[b1][b2]+Integer.bitCount(i));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint min=INF;\n\t\tfor(int i=0; i<1<<m; i++){\n\t\t\tmin=min(min, dp[full][i]);\n\t\t}\n\t\tint ans=m*n-min;\n\t\tprintln(ans+\"\");\n\t}\n\n\tvoid println(String s){\n\t\tSystem.out.println(s);\n\t}\n\n\tpublic static void main(String[] args){\n\t\tnew P111C().run();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "7456d460f099187a0b405bb99d0b51ad", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\n/**\n * Author -\n * User: kansal\n * Date: 9/3/11\n * Time: 5:28 PM\n */\npublic class CF85E {\n public static void main(String[] args) {\n reader = new BufferedReader(new InputStreamReader(System.in));\n\n int height = nextInt(), width = nextInt();\n if (width > height) {\n int t = width;\n width = height;\n height = t;\n }\n\n final int INF = height * width + 10;\n int[][][] dp = new int[height + 1][1 << width][1 << width];\n for (int[][] ints : dp) {\n for (int[] anInt : ints) {\n Arrays.fill(anInt, INF);\n }\n }\n\n dp[0][0][0] = 0;\n for(int r = 0; r < height; ++r) {\n for(int uncovered = 0; uncovered < (1 << width); ++uncovered) {\n for(int mask = 0; mask < (1 << width); ++mask) {\n if (dp[r][uncovered][mask] == INF) {\n continue;\n }\n for(int curMask = uncovered; curMask < (1 << width); curMask = (curMask + 1) | uncovered) {\n int curUncovered = (1 << width) - 1;\n for(int i = 0; i < width; ++i) {\n if (hasBit(mask, i) || hasBit(curMask, i)) {\n curUncovered &= ~(1 << i);\n }\n if (i > 0 && hasBit(curMask, i-1)) {\n curUncovered &= ~(1 << i);\n }\n if (i < width-1 && hasBit(curMask, i+1)) {\n curUncovered &= ~(1 << i);\n }\n }\n dp[r+1][curUncovered][curMask] = Math.min(dp[r+1][curUncovered][curMask], dp[r][uncovered][mask] + Integer.bitCount(curMask));\n }\n }\n }\n }\n\n int res = INF;\n for(int x: dp[height][0]) res = Math.min(res, x);\n\n System.out.println(height * width - res);\n }\n\n private static boolean hasBit(int mask, int bit) {\n return (((mask >> bit) & 1) == 1);\n }\n\n public static BufferedReader reader;\n\n public static StringTokenizer tokenizer = null;\n\n static String nextToken() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n static public int nextInt() {\n return Integer.parseInt(nextToken());\n }\n\n static public long nextLong() {\n return Long.parseLong(nextToken());\n }\n\n static public String next() {\n return nextToken();\n }\n\n static public String nextLine() {\n try {\n return reader.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return null;\n }\n\n}\n", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "8286f95c7e30e863a4e9a931c6979a2c", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.Iterator;\nimport java.util.LinkedList;\nimport java.util.List;\n\npublic class C {\n\n\tstatic int[] nm;\n\tstatic int ans = 0;\n\tstatic int rows, cols;\n\tstatic boolean[][] cae;\n\tstatic int[][] ca;\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tnm = readIntArray();\n\t\trows = Math.max(nm[0], nm[1]);\n\t\tcols = Math.min(nm[0], nm[1]);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tcae = new boolean[1000][50];\n\t\tca = new int[1000][50];\n\n\t\tStringBuilder sb = new StringBuilder();\n\t\tfor (int i = 0; i < cols; i++) {\n\t\t\tsb.append('1');\n\t\t}\n\t\tint startingState = Integer.parseInt(sb.toString(), 3);\n\t\tans = solve(startingState, 0);\n\n\t\tSystem.out.println(nm[0]*nm[1] - ans);\n//\t\tSystem.out.println(System.currentTimeMillis() - s );\n\t}\n\n\tstatic int solve(int state, int row) {\n\t\tif (row == rows) {\n\t\t\treturn 0;\n\t\t}\n\t\tif (cae[state][row]) {\n\t\t\treturn ca[state][row];\n\t\t}\n\n\t\tint ans = Integer.MAX_VALUE;\n\t\tfor (int i = 0; i < Math.pow(3, cols); i++) {\n\t\t\tboolean isCover = covers(i, state);\n\t\t\tif (isCover && (row < rows - 1 || coversTotally(i, state))) {\n\t\t\t\tint p = placed(i);\n\t\t\t\tint s = solve(i, row + 1);\n\t\t\t\tans = Math.min(ans, s + p);\n\t\t\t}\n\t\t}\n\n\t\tcae[state][row] = true;\n\t\tca[state][row] = ans;\n\n\t\treturn ans;\n\t}\n\n\tprivate static boolean coversTotally(int i, int state) {\n\t\t\t\n\t\tString bottom = decode(i);\n\t\tfor (int j = 0; j < bottom.length(); j++) {\n\t\t\tif (bottom.charAt(j) == '0') {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tprivate static boolean covers(int i, int state) {\n\t\tString top = decode(state);\n\t\tString bottom = decode(i);\n\n\t\tfor (int j = 0; j < top.length(); j++) {\n\t\t\tif (top.charAt(j) == '0' && bottom.charAt(j) != '2') {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif (top.charAt(j) == '2' && bottom.charAt(j) == '0') {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\tfor (int j = 0; j < top.length(); j++) {\n\t\t\tif (bottom.charAt(j) == '1' && (top.charAt(j) != '2' && !(j > 0 && bottom.charAt(j-1) == '2') && !(j < top.length() - 1 && bottom.charAt(j+1) == '2'))) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tprivate static int placed(int i) {\n\t\tString s = decode(i);\n\t\tint cnt = 0;\n\t\tfor (int j = 0; j < s.length(); j++) {\n\t\t\tif (s.charAt(j) == '2') {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\n\t\treturn cnt;\n\t}\n\n\tprivate static String decode(int state) {\t\t\n\t\tString tmp = Integer.toString(state, 3);\n\t\tif (tmp.length() < cols) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor (int i = 0; i < cols - tmp.length(); i++) {\n\t\t\t\tsb.append('0');\n\t\t\t}\t\t\n\t\t\tsb.append(tmp);\n\t\t\treturn sb.toString();\n\t\t} else {\n\t\t\treturn tmp;\n\t\t}\t\t\n\t}\n\n\tstatic int countDispositionDivisors(int[] d) {\n\t\tHashSet<Integer> div = new HashSet<Integer>();\n\t\tfor (int i = 1; i <= d.length; i++) {\n\t\t\tfor (int j = 0; j < d.length; j++) {\n\t\t\t\tif ((j + 1) % i == 0 && d[j] % i == 0) {\n\t\t\t\t\tdiv.add(j + 1);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn div.size();\n\t}\n\n\tstatic InputStreamReader isr = new InputStreamReader(System.in);\n\tstatic BufferedReader br = new BufferedReader(isr);\n\n\tstatic int[] readIntArray() throws IOException {\n\t\tString[] v = br.readLine().split(\" \");\n\t\tint[] ans = new int[v.length];\n\n\t\tfor (int i = 0; i < ans.length; i++) {\n\t\t\tans[i] = Integer.valueOf(v[i]);\n\t\t}\n\n\t\treturn ans;\n\t}\n\n\tstatic long[] readLongArray() throws IOException {\n\t\tString[] v = br.readLine().split(\" \");\n\t\tlong[] ans = new long[v.length];\n\n\t\tfor (int i = 0; i < ans.length; i++) {\n\t\t\tans[i] = Long.valueOf(v[i]);\n\t\t}\n\n\t\treturn ans;\n\t}\n\n\tstatic <T> void print(List<T> v) {\n\t\tStringBuilder sb = new StringBuilder();\n\t\tfor (int i = 0; i < v.size(); i++) {\n\t\t\tif (sb.length() > 0) {\n\t\t\t\tsb.append(' ');\n\t\t\t}\n\n\t\t\tsb.append(v.get(i));\n\t\t}\n\n\t\tSystem.out.println(sb);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "482c59c531249991e1d4e4a21df9e923", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import static java.util.Arrays.*;\nimport static java.lang.Math.*;\nimport static java.math.BigInteger.*;\nimport java.util.*;\nimport java.math.*;\nimport java.io.*;\n\npublic class C implements Runnable\n{\n String file = \"input\";\n \n boolean TEST = false;\n \n void solve() throws IOException\n {\n rows = nextInt();\n cols = nextInt();\n if(cols > rows)\n {\n int t = rows; rows = cols; cols = t;\n }\n dp = new int[rows][cols][1 << cols][1 << cols][1 << cols]; \n for(int i = 0; i < rows; i++)\n for(int j = 0; j < cols; j++)\n for(int k = 0; k < 1 << cols; k++)\n for(int u = 0; u < 1 << cols; u++)\n for(int v = 0; v < 1 << cols; v++) dp[i][j][k][u][v] = -1; \n out.println(go(0, 0, 0, 0, 0));\n }\n int rows, cols;\n int[][][][][] dp;\n int INF = 1 << 20;\n int go(int i, int j, int a, int b, int c)\n { \n if(i == rows)\n {\n return a == 0 && b == 0 && c == 0 ? 0 : -INF;\n }\n if(i + 1 == rows && b != 0 && c != 0) return -INF;\n if(i + 2 == rows && c != 0) return -INF;\n if(j == cols)\n {\n return go(i + 1, 0, b, c, 0);\n }\n \n if(dp[i][j][a][b][c] != -1) return dp[i][j][a][b][c];\n \n if(!test(a, j, -1, -1)) return go(i, j + 1, a, b, c);\n \n int res = -INF;\n \n //1\n if(test(a, j, -1, -1))\n res = max(res, go(i, j + 1, set(a, j, -1, -1), b, c));\n //2\n if(test(a, j, -1, -1) && test(b, j, -1, -1)) \n res = max(res, go(i, j + 1, set(a, j, -1, -1), set(b, j, -1, -1), c) + 1);\n //3\n if(j + 2 <= cols && test(a, j, j + 1, -1)) \n res = max(res, go(i, j + 2, set(a, j, j + 1, -1), b, c) + 1);\n //4\n if(j + 3 <= cols && test(a, j, j + 1, j + 2)) \n res = max(res, go(i, j + 2, set(a, j, j + 1, j + 2), b, c) + 2);\n //5\n if(test(a, j, -1, -1) && test(b, j, -1, -1) && test(c, j, -1, -1)) \n res = max(res, go(i, j + 1, set(a, j, -1, -1), set(b, j, -1, -1), set(c, j, -1, -1)) + 2);\n //6\n if(j - 1 >= 0 && test(a, j, -1, -1) && test(b, j - 1, j, -1) && test(c, j, -1, -1))\n res = max(res, go(i, j + 1, set(a, j, -1, -1), set(b, j - 1, j, -1), set(c, j, -1, -1)) + 3);\n //7\n if(j + 2 <= cols && test(a, j, -1, -1) && test(b, j, j + 1, -1) && test(c, j, -1, -1))\n res = max(res, go(i, j + 1, set(a, j, -1, -1), set(b, j, j + 1, -1), set(c, j, -1, -1)) + 3);\n //8\n if(j + 3 <= cols && test(a, j, j + 1, j + 2) && test(b, j + 1, -1, -1)) \n res = max(res, go(i, j + 3, set(a, j, j + 1, j + 2), set(b, j + 1, -1, -1), c) + 3);\n //9\n if(j + 2 <= cols && j - 1 >= 0 && test(b, j - 1, j, j + 1))\n res = max(res, go(i, j + 1, set(a, j, -1, -1), set(b, j - 1, j, j + 1), c) + 3);\n //10\n if(j + 2 <= cols && j - 1 >= 0 && test(b, j - 1, j, j + 1) && test(c, j, -1, -1))\n res = max(res, go(i, j + 1, set(a, j, -1, -1), set(b, j - 1, j, j + 1), set(c, j, -1, -1)) + 4);\n \n //11\n if(j + 2 <= cols && test(b, j, j + 1, -1))\n res = max(res, go(i, j + 1, set(a, j, -1, -1), set(b, j, j + 1, -1), c) + 2);\n \n //12\n if(j - 1 >= 0 && test(b, j - 1, j, -1))\n res = max(res, go(i, j + 1, set(a, j, -1, -1), set(b, j - 1, j, -1), c) + 2);\n \n //13\n if(j + 2 <= cols && test(a, j, j + 1, -1) && test(b, j, -1, -1))\n res = max(res, go(i, j + 2, set(a, j, j + 1, -1), set(b, j, -1, -1), c) + 2);\n \n //14\n if(j + 2 <= cols && test(a, j, j + 1, -1) && test(b, j + 1, -1, -1))\n res = max(res, go(i, j + 2, set(a, j, j + 1, -1), set(b, j + 1, -1, -1), c) + 2);\n \n return dp[i][j][a][b][c] = res; \n }\n int set(int a, int i, int j, int k)\n {\n if(i != -1) a |= 1 << i;\n if(j != -1) a |= 1 << j;\n if(k != -1) a |= 1 << k;\n return a;\n }\n boolean test(int a, int i, int j, int k)\n {\n if(i != -1 && (a >> i & 1) != 0) return false;\n if(j != -1 && (a >> j & 1) != 0) return false;\n if(k != -1 && (a >> k & 1) != 0) return false;\n return true;\n }\n \n String next() throws IOException\n {\n while(st == null || !st.hasMoreTokens()) st = new StringTokenizer(input.readLine());\n return st.nextToken();\n }\n \n int nextInt() throws IOException\n {\n return Integer.parseInt(next());\n }\n \n long nextLong() throws IOException\n {\n return Long.parseLong(next());\n }\n \n double nextDouble() throws IOException\n {\n return Double.parseDouble(next());\n }\n \n void print(Object... o)\n {\n System.out.println(deepToString(o));\n }\n \n void gcj(Object o)\n {\n String s = String.valueOf(o);\n out.println(\"Case #\" + test + \": \" + s);\n System.out.println(\"Case #\" + test + \": \" + s);\n }\n \n BufferedReader input;\n PrintWriter out;\n StringTokenizer st;\n int test;\n \n void init() throws IOException\n {\n if(TEST) input = new BufferedReader(new FileReader(file + \".in\")); \n else input = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(new BufferedOutputStream(System.out));\n }\n \n public static void main(String[] args) throws IOException\n {\n new Thread(null, new C(), \"\", 1 << 20).start();\n }\n \n public void run()\n {\n try\n {\n init();\n if(TEST) \n {\n int runs = nextInt();\n for(int i = 0; i < runs; i++) solve();\n }\n else solve();\n out.close(); \n }\n catch(Exception e)\n {\n e.printStackTrace();\n System.exit(1);\n }\n }\n}", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "4af0ba24dd6607ef050bf24c0124fb16", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "/**\n * Problem: \n * Source: \n * Link: \n * \n * @author Alexei Ostrovski\n */\n\nimport java.io.*;\nimport java.util.*;\n\n\npublic class SpidersSolver {\n\n\tpublic static final boolean DEBUG = false;\n\t\n\tpublic static void main(String[] args) {\n\t\t//redirect input and output\n\t\tif (DEBUG)\n\t\t{\n\t\t\ttry {\n\t\t\t\tSystem.setIn(new FileInputStream(\"input.txt\"));\n\t\t\t\t//System.setOut(new PrintStream(\"input.txt\"));\n\t\t\t} catch (IOException e) {\n\t\t\t\t//nothing\n\t\t\t}\n\t\t}\n\t\tScanner sc = new Scanner(System.in);\n\n\t\t//read data\n\t\tint n = sc.nextInt(), m = sc.nextInt();\n\t\t\t\n\t\t//solve\n\t\tif (n < m) {\n\t\t\tint tmp = n;\n\t\t\tn = m;\n\t\t\tm = tmp;\n\t\t}\n\t\t// Now (n >= m) && (m <= 6)\n\t\tint pow = 1;\n\t\tfor (int i = 0; i < m; i++)\n\t\t\tpow *= 2;\n\n\t\tint[] count = new int[pow];\n\t\tfor (int cur = 0; cur < pow; cur++)\n\t\t{\n\t\t\tint x = cur;\n\t\t\twhile (x > 0)\n\t\t\t{\n\t\t\t\tcount[cur] += (x % 2);\n\t\t\t\tx /= 2;\n\t\t\t}\n\t\t\tcount[cur] = m - count[cur];\n\t\t}\n\t\t//System.out.println(Arrays.toString(count));\n\t\t\n\t\tint[][] C = new int[pow][pow];\n\t\tfor (int cur = 0; cur < pow; cur++)\n\t\t{\n\t\t\tC[0][cur] = 0;//count[cur];\n\t\t\tfor (int last = 1; last < pow; last++)\n\t\t\t\tC[last][cur] = Integer.MIN_VALUE;\n\t\t}\n\t\t\n\t\tfor (int i = 0; i < n; i++)\n\t\t{\n\t\t\tint[][] newC = new int[pow][pow];\n\t\t\t\n\t\t\tfor (int cur = 0; cur < pow; cur++)\n\t\t\t\tfor (int next = 0; next < pow; next++)\n\t\t\t\t{\n\t\t\t\t\tint mask = cur | (cur << 1) | (cur >> 1) | next;\n\t\t\t\t\tmask %= pow;\n\t\t\t\t\t\n\t\t\t\t\tint max = 0;\n\t\t\t\t\tfor (int last = 0; last < pow; last++)\n\t\t\t\t\t\tif (((last | mask) == pow - 1) && (max < count[cur] + C[last][cur]))\n\t\t\t\t\t\t\tmax = count[cur] + C[last][cur];\n\t\t\t\t\t\n\t\t\t\t\tnewC[cur][next] = max;\n\t\t\t\t}\n\t\t\tC = newC;\n\t\t}\n\t\t\n\t\tint result = 0;\n\t\tfor (int cur = 0; cur < pow; cur++)\n\t\t\tresult = Math.max(result, C[cur][0]);\n\t\t\t\n\t\t//output\n\t\tSystem.out.println(result);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "ed128f1c728bdbcbd08066080f6c1a28", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class E\n{\n private static final int oo = 1000000000;\n public static void main(String[] args) throws Exception\n {\n Scanner in = new Scanner(System.in);\n int n = in.nextInt();\n int m = in.nextInt();\n if(n > m)\n {\n int t = n;\n n = m;\n m = t;\n }\n\n int [][] curr = new int[1<<n][1<<n];\n fill(curr, oo);\n Arrays.fill(curr[0], 0);\n\n for(int j = 0 ; j < m ; j++)\n {\n int [][] next = new int[1<<n][1<<n];\n fill(next, oo);\n for(int c0 = 0 ; c0 < 1<<n ; c0++)\n for(int c1 = 0 ; c1 < 1<<n ; c1++)\n if(curr[c0][c1] != oo)\n for(int c2 = 0 ; c2 < (j == m-1 ? 1 : 1<<n) ; c2++)\n {\n int all = (1<<n) - 1;\n int done = (all&(c1>>1)) | (all&(c1<<1)) | c0 | c2;\n done &= (all^c1);\n\n next[c1][c2] = Math.min(next[c1][c2], curr[c0][c1] + n - Integer.bitCount(done));\n\n }\n curr = next;\n }\n\n int res = oo;\n for(int i = 0 ; i < 1<<n ; i++)\n for(int j = 0 ; j < 1<<n ; j++)\n res = Math.min(res, curr[i][j]);\n\n System.out.println(n*m - res);\n }\n\n private static void fill(int[][] array, int val)\n {\n for(int [] fill : array)\n Arrays.fill(fill, val);\n }\n}", "lang_cluster": "Java", "tags": ["dp", "bitmasks"], "code_uid": "887c16242f8c7046a5099107ee6f6f1a", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\n/**\n * Author -\n * User: kansal\n * Date: 9/3/11\n * Time: 5:28 PM\n */\npublic class CF85C {\n public static void main(String[] args) {\n reader = new BufferedReader(new InputStreamReader(System.in));\n\n int height = nextInt(), width = nextInt();\n if (width > height) {\n int t = width;\n width = height;\n height = t;\n }\n\n final int INF = height * width + 10;\n final int ALL_BITS = (1 << width) - 1;\n int[][][] dp = new int[height + 1][1 << width][1 << width];\n for (int[][] ints : dp) {\n for (int[] anInt : ints) {\n Arrays.fill(anInt, INF);\n }\n }\n\n dp[0][0][0] = 0;\n for(int r = 0; r < height; ++r) {\n for(int uncovered = 0; uncovered < (1 << width); ++uncovered) {\n for(int mask = 0; mask < (1 << width); ++mask) {\n if (dp[r][uncovered][mask] == INF) {\n continue;\n }\n\n for(int curMask = uncovered; curMask < (1 << width); curMask = (curMask + 1) | uncovered) {\n int curCovered = (mask | curMask);\n curCovered |= (curMask >> 1);\n curCovered |= (ALL_BITS & (curMask << 1));\n\n int curUncovered = ALL_BITS ^ curCovered;\n dp[r+1][curUncovered][curMask] = Math.min(dp[r+1][curUncovered][curMask], dp[r][uncovered][mask] + Integer.bitCount(curMask));\n }\n }\n }\n }\n\n int res = INF;\n for(int x: dp[height][0]) res = Math.min(res, x);\n\n System.out.println(height * width - res);\n }\n\n public static BufferedReader reader;\n\n public static StringTokenizer tokenizer = null;\n\n static String nextToken() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n static public int nextInt() {\n return Integer.parseInt(nextToken());\n }\n\n static public long nextLong() {\n return Long.parseLong(nextToken());\n }\n\n static public String next() {\n return nextToken();\n }\n\n static public String nextLine() {\n try {\n return reader.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return null;\n }\n\n}\n", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "f8921b799d64a1765e35c1411efd5437", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/*\nIf you want to aim high, aim high\nDon't let that studying and grades consume you\nJust live life young\n******************************\nIf I'm the sun, you're the moon\nBecause when I go up, you go down\n*******************************\nI'm working for the day I will surpass you\nhttps://www.a2oj.com/Ladder16.html\n*/\nimport java.util.*;\nimport java.io.*;\nimport java.math.*;\n\n public class x111C\n {\n public static void main(String omkar[]) throws Exception\n {\n BufferedReader infile = new BufferedReader(new InputStreamReader(System.in)); \n StringTokenizer st = new StringTokenizer(infile.readLine());\n int R = Integer.parseInt(st.nextToken());\n int C = Integer.parseInt(st.nextToken());\n if(R > C)\n {\n int t = R;\n R = C;\n C = t;\n }\n //dp[c][m1][m2] = min spoders in first c columns\n int[][][] dp = new int[C+1][1 << R][1 << R];\n for(int i=0; i <= C; i++)\n for(int mask=0; mask < (1<<R); mask++)\n Arrays.fill(dp[i][mask], 69);\n for(int mask=0; mask < (1<<R); mask++)\n dp[0][0][mask] = 0;\n for(int c=1; c <= C; c++)\n for(int mask1=0; mask1 < (1<<R); mask1++)\n for(int mask2=0; mask2 < (1<<R); mask2++)\n for(int mask3=0; mask3 < (1<<R); mask3++)\n {\n boolean works = true;\n for(int b=0; b < R; b++)\n if((mask2&(1<<b)) == 0)\n {\n if(b > 0 && (mask2&(1<<(b-1))) > 0);\n else if(b+1 < R && (mask2&(1<<(b+1))) > 0);\n else if((mask1&(1<<b)) > 0);\n else if((mask3&(1<<b)) > 0);\n else works = false;\n }\n if(works)\n dp[c][mask2][mask3] = Math.min(dp[c][mask2][mask3], dp[c-1][mask1][mask2]+Integer.bitCount(mask1));\n }\n int res = 0;\n for(int mask=0; mask < (1<<R); mask++)\n res = Math.max(res, R*C-(dp[C][mask][0]+Integer.bitCount(mask)));\n System.out.println(res);\n }\n }", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "7705147e374b6bcc4667778971405a59", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.HashMap;\nimport java.io.IOException;\nimport java.util.InputMismatchException;\nimport java.io.PrintWriter;\nimport java.io.OutputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Alex\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n static class TaskC {\n int BAD = 11111;\n int rows;\n int cols;\n HashMap<IntIntPair, Integer>[] mem;\n\n boolean contains(int mem, int index) {\n if(index < 0) return false;\n return ((mem >> index) & 1) == 1;\n }\n\n int add(int mem, int index) {\n if(((mem >> index) & 1) == 0) {\n mem += (1 << index);\n }\n return mem;\n }\n\n int size(int mem) {\n int res = 0;\n while(mem > 0) {\n if(mem % 2 == 1) res++;\n mem /= 2;\n }\n return res;\n }\n\n void test() {\n if(contains(5, 0) == false) throw new RuntimeException();\n if(contains(5, 1) == true) throw new RuntimeException();\n if(contains(5, -1) == true) throw new RuntimeException();\n if(contains(5, 2) == false) throw new RuntimeException();\n if(contains(5, 3) == true) throw new RuntimeException();\n if(add(0, 2) != 4) throw new RuntimeException();\n if(add(4, 0) != 5) throw new RuntimeException();\n if(add(5, 0) != 5) throw new RuntimeException();\n if(size(5) != 2) throw new RuntimeException();\n }\n\n int dp(int row, int remabove, int squareabove) {\n if(row == rows) {\n if(remabove == 0) return 0;\n return BAD;\n }\n if(mem[row].containsKey(new IntIntPair(remabove, squareabove)))\n return mem[row].get(new IntIntPair(remabove, squareabove));\n int res = BAD;\n int possibilities = 1 << cols;\n for(int poss = 0; poss < possibilities; poss++) {\n int have = 0;\n for(int j = 0; j < cols; j++)\n if(((poss >> j) & 1) == 1) {\n have += 1 << j;\n }\n boolean works = true;\n for(int above = 0; above < cols; above++)\n if(((remabove >> above) & 1) == 1) {\n if(((have >> above) & 1) == 0) {\n works = false;\n break;\n }\n }\n if(works) {\n int remhere = 0;\n for(int j = 0; j < cols; j++) {\n if(!contains(have, j - 1) && !contains(have, j) && !contains(have, j + 1) && !contains(squareabove, j)) {\n remhere = add(remhere, j);\n }\n }\n res = Math.min(res, size(have) + dp(row + 1, remhere, have));\n }\n }\n mem[row].put(new IntIntPair(remabove, squareabove), res);\n return res;\n }\n\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n test();\n int n = in.readInt(), m = in.readInt();\n cols = Math.min(n, m);\n rows = Math.max(n, m);\n mem = new HashMap[rows];\n for(int i = 0; i < mem.length; i++) mem[i] = new HashMap<>();\n int res = dp(0, 0, 0);\n out.printLine(cols * rows - res);\n }\n\n }\n\n static class IntIntPair implements Comparable<IntIntPair> {\n public final int first;\n public final int second;\n\n public IntIntPair(int first, int second) {\n this.first = first;\n this.second = second;\n }\n\n\n public boolean equals(Object o) {\n if(this == o) return true;\n if(o == null || getClass() != o.getClass()) return false;\n\n IntIntPair pair = (IntIntPair) o;\n\n return first == pair.first && second == pair.second;\n\n }\n\n\n public int hashCode() {\n int result = Integer.hashCode(first);\n result = 31 * result + Integer.hashCode(second);\n return result;\n }\n\n\n public String toString() {\n return \"(\" + first + \",\" + second + \")\";\n }\n\n @SuppressWarnings({\"unchecked\"})\n public int compareTo(IntIntPair o) {\n int value = Integer.compare(first, o.first);\n if(value != 0) {\n return value;\n }\n return Integer.compare(second, o.second);\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if(numChars == -1)\n throw new InputMismatchException();\n if(curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch(IOException e) {\n throw new InputMismatchException();\n }\n if(numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while(isSpaceChar(c))\n c = read();\n int sgn = 1;\n if(c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if(c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while(!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if(filter != null)\n return filter.isSpaceChar(c);\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void printLine(int i) {\n writer.println(i);\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["dsu", "dp", "bitmasks"], "code_uid": "afffe6c10213380cba300994bd199512", "src_uid": "097674b4dd696b30e102938f71dd39b9", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "\nimport java.util.*; //Scanner;\nimport java.io.PrintWriter; //PrintWriter\n\npublic class R229_Rocket_A\n{\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tsolve(in, out);\n\t\tout.close();\n\t\tin.close();\t\n\t}\n\t\n\tpublic static void solve(Scanner in, PrintWriter out)\n\t{\t\n\t\tString s = in.next();\n\t\tchar prevC = s.charAt(0);\n\t\tint cnt = 0, contig = 1;\n\t\tfor (int i = 1; i < s.length(); i++)\n\t\t{\n\t\t\tif (s.charAt(i) == prevC)\n\t\t\t\tcontig++;\n\t\t\telse\n\t\t\t{\n\t\t\t\tif (contig % 2 == 0) cnt++;\n\t\t\t\tcontig = 1;\n\t\t\t\tprevC = s.charAt(i);\n\t\t\t}\n\t\t}\n\t\tif (contig % 2 == 0) cnt++;\n\t\t\n\t\tout.println(cnt);\t\t\n\t}\n}\n", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "3f3d60ae2b815f16c9c8517b0ecdfa6b", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class GeneticEngineering {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scn = new Scanner(System.in);\n\t\tString str = scn.nextLine();\n\t\tint count = 1;\n\t\tint os = 0;\n\t\tfor (int i = 1; i < str.length(); i++) {\n\t\t\tif (str.charAt(i - 1) != str.charAt(i)) {\n\t\t\t\tif (count % 2 == 0) {\n\t\t\t\t\tos++;\n\t\t\t\t\tcount = 1;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif (count % 2 == 0) {\n\t\t\tos++;\n\t\t}\n\t\tSystem.out.println(os);\n\t}\n}", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "b6be6dbb983436164c81f4d3a4a84d99", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner scan=new Scanner(System.in);\n\t\tchar arr[]=scan.next().toCharArray();\n\t\tint count=0;\n\t\tint i=0,j=0;\n\t\tint temp=0;\n\t\tint n=arr.length;\n\t\twhile(i<n){\n\t\t\tj=i;\n\t\t\ttemp=0;\n\t\t\twhile(j<n && arr[j]==arr[i]){\n\t\t\t\tj++;\n\t\t\t\ttemp++;\n\t\t\t}\n\t\t\tif(temp%2==0){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\ti=j;\n\t\t}\n\t\tSystem.out.print(count);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "a04c03187f9ab5f7bb160e1fd35a1a11", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n String theDNA = sc.next();\n int wholeCounter = 0, tempCounter = 1;\n char previousCharacter = theDNA.charAt(0);\n for (int i = 1; i < theDNA.length(); i++) {\n if (previousCharacter == theDNA.charAt(i)) {\n tempCounter++;\n previousCharacter = theDNA.charAt(i);\n if (i != theDNA.length() - 1) {\n if (theDNA.charAt(i + 1) != previousCharacter && tempCounter % 2 == 0) {\n wholeCounter++;\n tempCounter = 1;\n }\n }else if(tempCounter % 2 == 0){\n wholeCounter++;\n tempCounter = 1;\n }\n } else if (previousCharacter != theDNA.charAt(i)) {\n previousCharacter = theDNA.charAt(i);\n }\n }\n System.out.println(wholeCounter);\n }\n}\n", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "200c692572bf042fffde72cf6c0ab8d8", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\npublic class a {\npublic static void main(String[] args)\n{\n Scanner input = new Scanner(System.in);\n String s = input.next();\n int count = 1, res = 0;\n for(int i = 1; i<s.length(); i++)\n {\n if(s.charAt(i) == s.charAt(i-1)) count++;\n else\n {\n if(count%2 == 0) res++;\n count = 1;\n }\n }\n if(count%2 == 0) res++;\n System.out.println(res);\n}\n}\n", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "0e55319cea6efa62e29efcc8d7a7141b", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class Genetic_Engineering {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.nextLine();\n\t\tsc.close();\n\t\tint count = 0;\n\t\tchar p = s.charAt(0);\n\t\tboolean even = false;\n\t\tfor(int i=1; i<s.length(); i++) { \n\t\t\teven=!even;\n\t\t\tif(i==s.length()-1&&s.charAt(i)==p&&even) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tif(s.charAt(i)!=p) {\n\t\t\t\t p=s.charAt(i);\n\t\t\t\t count+=!even?1:0;\n\t\t\t\t even = false;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "2cf961a6bca090eaf65911c62afe293e", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\npublic class Program\n{\n\tpublic static void main (String[] args)\n\t{\n\t\t// your code goes here\n\t\tScanner scn = new Scanner(System.in);\n String str = scn.nextLine();\n int slow = 0;\n int fast = 1;\n int count = 1;\n int ans = 0;\n while(fast<str.length())\n {\n char ch = str.charAt(slow);\n char ch1 = str.charAt(fast);\n //System.out.println(count);\n if(ch==ch1){\n \t//System.out.println(ch + \" \" + ch1);\n \tcount++;\n \n }\n else{\n \t////System.out.println(\"else \" + count);\n \t//System.out.println(ch + \" \" + ch1);\n \tif(count%2==0){\n ans++;\n //System.out.println(\"if \" + ans);\n }\n slow = fast;\n count = 1;\n }\n fast++;\n \n }\n if(count%2==0){\n \tans++;\n }\n System.out.println(ans);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "969f6e2ba997e54caa7ba076be725a76", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\npublic class GeneticEngineering {\n\n public static void main(String args[]){\n \tScanner scan=new Scanner(System.in);\n \t\tString s=scan.next();\n \t\tint i=0,nbInsert=0,occ=1;\n \t\t\t\n \t\t\twhile(i<s.length()-1)\n \t\t\t{\n \t\t\t\tif (s.charAt(i)==s.charAt(i+1))\t\n \t\t\t\t\tocc++;\n \t\t\t\telse{\n \t\t\t\t\tif(occ%2==0) nbInsert++;\n \t\t\t\t\tocc=1;\n \t\t\t\t}\n \t\t\t\ti++;\n \t\t\t}\n if(occ%2==0) nbInsert++;\t\t\t\n \t\t\tSystem.out.println(nbInsert);\n \t\t\t\n \t\t\t\n }\n}", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "0f8f21f163dfea2e8a45ed86744fbdc7", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\n\npublic class Main {\n\n\tpublic static void main(String[] args) \n\t{\n\t\tScanner scan = new Scanner(System.in);\n\t\tString x = scan.next();\n\t\tchar a = '.';\n\t\tint c=0,ca=1;\n\t\tfor(int i=0;i<x.length();i++)\n\t\t{\n\t\t\tchar b = x.charAt(i);\n\t\t\tif(a==b)ca++;\n\t\t\telse\n\t\t\t{\n\t\t\t\ta=b;\n\t\t\t\tif(ca%2==0)c++;\n\t\t\t\tca=1;\n\t\t\t}\n\t\t}\n\t\tif(ca%2==0)c++;\n\t\tSystem.out.println(c);\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "f71b68ebc001b0e57287009d2e59c5d7", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class A {\n\tvoid run() {\n\t\tString s = in.next();\n\t\tchar prev = 0;\n\t\tint len = 0;\n\t\tint ans = 0;\n\t\tfor (int i = 0; i < s.length(); i++) {\n\t\t\tif (s.charAt(i) == prev) {\n\t\t\t\tlen++;\n\t\t\t} else {\n\t\t\t\tif (len > 0 && len % 2 == 0) {\n\t\t\t\t\tans++;\n\t\t\t\t}\n\t\t\t\tprev = s.charAt(i);\n\t\t\t\tlen = 1;\n\t\t\t}\n\t\t}\n\t\tif (len > 0 && len % 2 == 0) {\n\t\t\tans++;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\n\tstatic boolean stdStreams = true;\n\tstatic String fileName = A.class.getSimpleName().replaceFirst(\"_.*\", \"\").toLowerCase();\n\tstatic String inputFileName = fileName + \".in\";\n\tstatic String outputFileName = fileName + \".out\";\n\tstatic MyScanner in;\n\tstatic PrintWriter out;\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tLocale.setDefault(Locale.US);\n\t\tBufferedReader br;\n\t\tif (stdStreams) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(System.out);\n\t\t} else {\n\t\t\tbr = new BufferedReader(new FileReader(inputFileName));\n\t\t\tout = new PrintWriter(outputFileName);\n\t\t}\n\t\tin = new MyScanner(br);\n\t\tnew A().run();\n\t\tbr.close();\n\t\tout.close();\n\t}\n\t\n\tstatic class MyScanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tMyScanner(BufferedReader br) {\n\t\t\tthis.br = br;\n\t\t}\n\t\t\n\t\tvoid findToken() {\n\t\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tString next() {\n\t\t\tfindToken();\n\t\t\treturn st.nextToken();\n\t\t}\n\t\t\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\t\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\t\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "e7e7167349212103773bd81a92969f49", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Scanner;\n\npublic class GeneticEngineering {\n public static void main(String[] args) {\n Scanner input = new Scanner(System.in);\n String s = input.nextLine();\n // String s = \"GTGAATTTCC\";\n System.out.println(Genetic(s));\n input.close();\n }\n\n public static int Genetic(String s) {\n int n = 0;\n if (s.length() < 2) {\n return n;\n }\n char c = s.charAt(0);\n int i = 1;\n int count = 1;\n while (i < s.length()) {\n if (s.charAt(i) == c) {\n count++;\n } else {\n if (count % 2 == 0) {\n n++;\n }\n c = s.charAt(i);\n count = 1;\n }\n i++;\n }\n if (count % 2 == 0) {\n n++;\n }\n return n;\n }\n}\n", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "4eebb4ce6f32b6133a8fd0d8d0b39efc", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.*;\nimport java.util.*;\nimport java.lang.*;\nimport static java.lang.Math.*;\n\n\npublic class TaskA implements Runnable {\n long m = (int)1e9+7;\n PrintWriter w;\n InputReader c;\n final int MAXN = (int)1e6 + 100;\n public void run() {\n c = new InputReader(System.in);\n w = new PrintWriter(System.out);\n\n char s[] = c.next().toCharArray();\n int n = s.length;\n\n int res = 0;\n for(int i=0;i<n;i++){\n int t = 1;\n while (i!=n-1 && s[i]==s[i+1]){\n t++; i++;\n }\n if(t%2==0) res++;\n }\n w.println(res);\n\n w.close();\n }\n long gcd(long a, long b) {\n if (b == 0)\n return a;\n return gcd(b, a % b);\n }\n public static void sortbyColumn(int arr[][], int col){\n Arrays.sort(arr, new Comparator<int[]>()\n {\n public int compare(int[] o1, int[] o2){\n return(Integer.valueOf(o1[col]).compareTo(o2[col]));\n }\n });\n\n }\n public static class DJSet {\n public int[] upper;\n\n public DJSet(int n) {\n upper = new int[n];\n Arrays.fill(upper, -1);\n }\n\n public int root(int x) {\n return upper[x] < 0 ? x : (upper[x] = root(upper[x]));\n }\n\n public boolean equiv(int x, int y) {\n return root(x) == root(y);\n }\n\n public boolean union(int x, int y) {\n x = root(x);\n y = root(y);\n if (x != y) {\n if (upper[y] < upper[x]) {\n int d = x;\n x = y;\n y = d;\n }\n upper[x] += upper[y];\n upper[y] = x;\n }\n return x == y;\n }\n }\n public static int[] radixSort(int[] f) {\n int[] to = new int[f.length];\n {\n int[] b = new int[65537];\n for(int i = 0;i < f.length;i++)b[1+(f[i]&0xffff)]++;\n for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];\n for(int i = 0;i < f.length;i++)to[b[f[i]&0xffff]++] = f[i];\n int[] d = f; f = to;to = d;\n }\n {\n int[] b = new int[65537];\n for(int i = 0;i < f.length;i++)b[1+(f[i]>>>16)]++;\n for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];\n for(int i = 0;i < f.length;i++)to[b[f[i]>>>16]++] = f[i];\n int[] d = f; f = to;to = d;\n }\n return f;\n }\n public void printArray(int[] a){\n for(int i=0;i<a.length;i++)\n w.print(a[i]+\" \");\n w.println();\n }\n public int[] scanArrayI(int n){\n int a[] = new int[n];\n for(int i=0;i<n;i++)\n a[i] = c.nextInt();\n return a;\n }\n public long[] scanArrayL(int n){\n long a[] = new long[n];\n for(int i=0;i<n;i++)\n a[i] = c.nextLong();\n return a;\n }\n public void printArray(long[] a){\n for(int i=0;i<a.length;i++)\n w.print(a[i]+\" \");\n w.println();\n }\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private SpaceCharFilter filter;\n private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars==-1)\n throw new InputMismatchException();\n\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n }\n catch (IOException e) {\n throw new InputMismatchException();\n }\n\n if(numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n }\n catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n public int nextInt() {\n int c = read();\n\n while(isSpaceChar(c))\n c = read();\n\n int sgn = 1;\n\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n\n int res = 0;\n do {\n if(c<'0'||c>'9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n\n return res * sgn;\n }\n\n public long nextLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public double nextDouble() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n\n public String readString() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n }\n while (!isSpaceChar(c));\n\n return res.toString();\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public String next() {\n return readString();\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n }\n public static void main(String args[]) throws Exception {\n new Thread(null, new TaskA(),\"TaskA\",1<<26).start();\n }\n}", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "852b5ac6108cb83fecc3299ac4debf2c", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class GeneticEngineering {\n\tpublic static void main(String[] args) {\n\t\tInputReader r = new InputReader(System.in);\n\t\tchar[] arr = r.next().toCharArray();\n\t\tint res = 0;\n\t\tfor (int i = 0; i < arr.length; i++) {\n\t\t\tint len = 1;\n\t\t\twhile (i + 1 < arr.length && arr[i] == arr[i + 1]) {\n\t\t\t\tlen++;\n\t\t\t\ti++;\n\t\t\t}\n\t\t\tif (len % 2 == 0)\n\t\t\t\tres++;\n\t\t}\n\t\tSystem.out.println(res);\n\t}\n\n\tstatic class InputReader {\n\t\tprivate BufferedReader reader;\n\t\tprivate StringTokenizer tokenizer;\n\n\t\tpublic InputReader(InputStream stream) {\n\t\t\treader = new BufferedReader(new InputStreamReader(stream));\n\t\t\ttokenizer = null;\n\t\t}\n\n\t\tpublic InputReader(FileReader stream) {\n\t\t\treader = new BufferedReader(stream);\n\t\t\ttokenizer = null;\n\t\t}\n\n\t\tpublic String nextLine() {\n\t\t\ttry {\n\t\t\t\treturn reader.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\t// TODO Auto-generated catch block\n\t\t\t\te.printStackTrace();\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\n\t\tpublic String next() {\n\t\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tokenizer.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "0dc50d4e95ec97e4c3ac1375c9dc8f61", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Scanner;\n\npublic class Solution {\n public static void main( String[] args ) {\n Scanner in = new Scanner(System.in);\n String s = \"\";\n try {\n s = in.nextLine();\n }\n catch (Exception e){\n e.printStackTrace();\n }\n in.close();\n \n System.out.println(get(s));\n }\n \n public static int get( String s ) {\n int ret = 0;\n int count = 1;\n for( int i = 0; i < s.length(); i++ ) {\n while( i + 1 < s.length() && s.charAt(i) == s.charAt(i+1) ) {\n count++;\n i++;\n }\n if( count % 2 == 0 ) {\n ret++;\n }\n count = 1;\n }\n return ret;\n }\n}", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "94ee62348387caf12323c7f9d8e51fd0", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.Scanner;\n\npublic class DNA {\n public static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n String str = sc.next();\n int count = 1;\n int i = 0;\n int toPrint = 0;\n if(i + 1 == str.length()){\n System.out.println(0);\n System.exit(0);\n }\n while (i + 1 < str.length()) {\n if(str.charAt(i) == str.charAt(i + 1)){\n count++;\n if(i+2>=str.length()){\n if(count%2 == 0){\n toPrint++;\n }\n }\n } else{\n if(count%2 == 0){\n toPrint++;\n count = 1;\n } else{\n count = 1;\n }\n }\n i++;\n }\n if(i - 1 >=0){\n if(i == str.length()){\n if(str.charAt(i) != str.charAt(i -1)){\n toPrint++;\n }\n }\n }\n System.out.println(toPrint);\n }\n}", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "8793b3ce96fed9f735a0dd8c6c512189", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\npublic class Solution\n{\n public static void main(String[] args) {\n Scanner sc=new Scanner(System.in);\n String s = sc.nextLine();\n int l=s.length();\n int c=0,z,j;\n for(int i=0;i<(l-1);)\n {\n if(s.charAt(i)==s.charAt(i+1))\n {\n z=1; \n for(j=i;j<(l-1);j++)\n {\n\n if(s.charAt(j)==s.charAt(j+1))\n z++;\n else if(j==(l-2) || s.charAt(j)!=s.charAt(j+1))\n break;\n }\n if(z%2==0)\n ++c;\n\n i=j;\n }\n else\n i++;\n }\n System.out.println(c);\n sc.close();\n }\n}", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "2ed90549911aed8f15a71610c3c32182", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class Task {\n\tpublic static void main(String[] args) {\n\t\tsolve();\n\t}\n\n\tstatic void solve() {\n\t\tString s = nextString();\n\t\tint cnt = 1;\n\t\tint ans = 0;\n\t\tfor (int i = 0; i < s.length() - 1; ++i) {\n\t\t\tif (s.charAt(i) == s.charAt(i + 1)) {\n\t\t\t\tcnt++;\n\t\t\t}\n\n\t\t\tif (s.charAt(i) != s.charAt(i + 1) || i + 1 == s.length() - 1) {\n\t\t\t\tif ((cnt & 1) == 0)\n\t\t\t\t\tans++;\n\t\t\t\tcnt = 1;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\n\t/************************************************************************************/\n\tstatic InputStream is = System.in;\n\tstatic private byte[] buffer = new byte[1024];\n\tstatic private int lenbuf = 0, ptrbuf = 0;\n\n\tstatic private int readByte() {\n\t\tif (lenbuf == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (ptrbuf >= lenbuf) {\n\t\t\tptrbuf = 0;\n\t\t\ttry {\n\t\t\t\tlenbuf = is.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (lenbuf <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buffer[ptrbuf++];\n\t}\n\n\tstatic private boolean isSpace(int c) {\n\t\treturn !(c >= 33 && c <= 126);\n\t}\n\n\tstatic private int read() {\n\t\tint b;\n\t\twhile ((b = readByte()) != -1 && isSpace(b))\n\t\t\t;\n\t\treturn b;\n\t}\n\n\tstatic private double nextDouble() {\n\t\treturn Double.parseDouble(nextString());\n\t}\n\n\tstatic private char nextChar() {\n\t\treturn (char) read();\n\t}\n\n\tstatic private String nextString() {\n\t\tint b = read();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile (!(isSpace(b))) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tstatic private char[] nextString(int n) {\n\t\tchar[] buf = new char[n];\n\t\tint b = read(), p = 0;\n\t\twhile (p < n && !(isSpace(b))) {\n\t\t\tbuf[p++] = (char) b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\n\tstatic private int nextInt() {\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tstatic private long nextLong() {\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tstatic private int[] nextAi(int n) {\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = nextInt();\n\t\treturn a;\n\t}\n\n\tstatic private Integer[] nextAi1(int n) {\n\t\tInteger[] a = new Integer[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = nextInt();\n\t\treturn a;\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "a03c8e568add7e1090877a905ce74f59", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\npublic class Main{\n\tpublic static void main(String args[]){\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.next();\n\t\tint n = s.length();\n\t\tint count = 0, ans = 0;\n\t\tfor(int i = 0; i<n; ){\n\t\t\tchar c = s.charAt(i);\n\t\t\tint j = i;\n\t\t\tcount=0;\n\t\t\twhile(j < n && s.charAt(j) == c){\n\t\t\t\tcount++;\n\t\t\t\tj++;\n\t\t\t}\n\t\t\ti = j;\n\t\t\tif(count % 2 == 0)\n\t\t\t\tans++;\n\t\t\t// System.out.println(ans);\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "b10ec9dd990dac0b4707852509bbe340", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class GeneticEngineering {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\n\t\t\n\t\tString str=sc.next();\n\t\t\n\t\tint counter=1,res=0;\n\t\tfor(int i=0;i<(str.length()-1);i++)\n\t\t{\n\t\t\tif( str.charAt(i)==str.charAt(i+1) )\n\t\t\t{\n\t\t\t\tcounter++;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tif(counter%2==0)\n\t\t\t\t{\n\t\t\t\t\tres++;\n\t\t\t\t\tcounter=1;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tcounter=1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(counter>1)\n\t\t{\n\t\t\tif(counter%2==0)\n\t\t\t\tres++;\n\t\t}\n\t\t\n\t\tSystem.out.println(res);\n\t\t\n\t\tsc.close();\n\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "6f196fdb3f7ab39e8bff12f40c7911f0", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\n\npublic class GeneticEngineering {\n\n\tpublic static void main(String[] args) {\n\t\t\tScanner scanner = new Scanner(System.in);\n\t\t\tString input = scanner.nextLine();\n\t\t\tint finalCount = 0;\n\t\t\tif(input!=null && !\"\".equals(input)){\n\t\t\t\tchar[] nucleotides = input.toCharArray();\n\t\t\t\tchar previous = ' ';\n\t\t\t\tint seqCounter = 1;\n\t\t\t\tfor (char current : nucleotides) {\n\t\t\t\t\tif(current == previous){\n\t\t\t\t\t\tseqCounter++;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tif(seqCounter%2 == 0){\n\t\t\t\t\t\t\tfinalCount++;\n\t\t\t\t\t\t\tseqCounter = 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tprevious = current;\n\t\t\t\t}\n\t\t\t\tif(seqCounter%2 == 0){\n\t\t\t\t\tfinalCount++;\n\t\t\t\t\tseqCounter = 1;\n\t\t\t\t}\n\t\t}\n\t\t\tSystem.out.println(finalCount);\n\t\t\n\t\t\n\t}\n}\n", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "35ed6d3d59fa26b4a699f8c91f6629f9", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\n\npublic class Task391A {\n\n\tpublic static void main(String... args) throws NumberFormatException,\n\t\t\tIOException {\n\t\tSolution.main(System.in, System.out);\n\t}\n\n\tstatic class Scanner {\n\n\t\tprivate final BufferedReader br;\n\t\tprivate String[] cache;\n\t\tprivate int cacheIndex;\n\n\t\tScanner(InputStream is) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(is));\n\t\t\tcache = new String[0];\n\t\t\tcacheIndex = 0;\n\t\t}\n\n\t\tint nextInt() throws IOException {\n\t\t\tif (cacheIndex >= cache.length) {\n\t\t\t\tcache = br.readLine().split(\" \");\n\t\t\t\tcacheIndex = 0;\n\t\t\t}\n\t\t\treturn Integer.parseInt(cache[cacheIndex++]);\n\t\t}\n\n\t\tString next() throws IOException {\n\t\t\tif (cacheIndex >= cache.length) {\n\t\t\t\tcache = br.readLine().split(\" \");\n\t\t\t\tcacheIndex = 0;\n\t\t\t}\n\t\t\treturn cache[cacheIndex++];\n\t\t}\n\n\t\tvoid close() throws IOException {\n\t\t\tbr.close();\n\t\t}\n\n\t}\n\n\tstatic class Solution {\n\n\t\tpublic static void main(InputStream is, OutputStream os)\n\t\t\t\tthrows NumberFormatException, IOException {\n\t\t\tPrintWriter pw = new PrintWriter(os);\n\t\t\tScanner sc = new Scanner(is);\n\n\t\t\tchar dna[] = (sc.next() + \"#\").toCharArray();\n\n\t\t\tint prevCount = 1;\n\t\t\tint retVal = 0;\n\n\t\t\tfor (int i = 1; i < dna.length; i++) {\n\t\t\t\tif (dna[i] == dna[i - 1]) {\n\t\t\t\t\tprevCount++;\n\t\t\t\t} else {\n\t\t\t\t\tif (prevCount % 2 == 0) {\n\t\t\t\t\t\tretVal++;\n\t\t\t\t\t}\n\t\t\t\t\tprevCount = 1;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tpw.println(retVal);\n\n\t\t\tpw.flush();\n\t\t\tsc.close();\n\t\t}\n\t}\n\n}", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "6e6034044614d1ad6c6fe748b28a8cbb", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main\n{\n\t \n\tpublic static void main(String args[]) throws NumberFormatException, IOException\n\t{\n\t\t\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n\t\tString s = br.readLine();\n\t\tif(s.length()==1)\n\t\t{\n\t\t\tSystem.out.println(\"0\");\n\t\t\treturn;\n\t\t}\n\t\tint j=0,count=0,len=0;\n\t\tfor(int i=0;i<s.length();i++)\n\t\t{\n\t\t\tif(s.charAt(i)==s.charAt(j))\n\t\t\t\tlen++;\n\t\t\telse\n\t\t\t{\n\t\t\t\tj=i;\n\t\t\t\t\n\t\t\t\tif(len%2==0)\n\t\t\t\t{\n\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t\tlen=1;\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\tif(len%2==0)\n\t\t\tcount++;\n\t\t\n\t\tSystem.out.println(count);\n\t\t\n\t}\n}", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "f6d6804a5bbfc0edba3661495f96c546", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\npublic class DATA {\n\tpublic static void main(String[]args)\n\t{\n\t\tScanner s=new Scanner(System.in);\n\t String a=s.next();\n\t int[]k=new int[100];\n\t int c=0;\n\t int m=0;\n\t char mt;\n\t for(int i=0;i<a.length();i++)\n\t {\n\t char ms=a.charAt(i);\n\t if(i+1==a.length())\n\t \tmt=48;\n\t else\n\t mt=a.charAt(i+1);\n\t if(ms==mt)\n\t {\n\t \tc++;\n\t }\n\t else\n\t {\n\t c++;\n\t k[m++]=c;\n\t c=0;\n\t }\n\t }\n\t int result=0;\n\t for(int i=0;i<m;i++)\n\t {\n\t \t if(k[i]%2==0)\n\t \t\t result++;\n\t }\n\t System.out.print(result);\n\t \n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "ef246ac5cca7c89176cee726a8d589a0", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class R1A\n{\n public static StringTokenizer st;\n public static void nextLine(BufferedReader br) throws IOException\n {\n st = new StringTokenizer(br.readLine());\n }\n \n public static String next()\n {\n return st.nextToken();\n }\n \n public static int nextInt()\n {\n return Integer.parseInt(st.nextToken());\n }\n \n public static long nextLong()\n {\n return Long.parseLong(st.nextToken());\n }\n \n public static double nextDouble()\n {\n return Double.parseDouble(st.nextToken());\n }\n \n public static void main(String[] args) throws IOException\n {\n long stime = System.currentTimeMillis();\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n nextLine(br);\n String s = next();\n char q = s.charAt(0);\n int pos = 0;\n int sum = 0;\n for (int i = 1; i < s.length(); i++)\n {\n if (s.charAt(i) != q)\n {\n if ((i - pos) % 2 == 0)\n {\n sum++;\n }\n pos = i;\n q = s.charAt(i);\n }\n }\n if ((s.length() - pos) % 2 == 0)\n {\n sum++;\n }\n System.out.println(sum);\n }\n}\n", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "8bfe58028192408265b19a62798871fe", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\npublic class GeneticEngineering {\n\n\tpublic static void main(String[] args) {\n\t\t\n\t\tScanner sc=new Scanner(System.in);\n\t\tString str=sc.next();\n\t\t\n\t\tint insert=0;\n\n\t\t\n\t\tfor(int i=0;i<str.length();i++)\n\t\t{\n\t\t\tint count=1;\n\t\t\twhile(i+1<str.length() && str.charAt(i)==str.charAt(i+1))\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t\ti++;\n\t\t\t}\n\t\t\tif(count%2==0)\n\t\t\t{\n\t\t\t\tinsert++;\n\t\t\t}\n\t\t\n\t\t}\n\t\tSystem.out.println(insert);\n\t\t\n\t}\n\n}", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "51a3e7431dd63a55d54499b73069cd25", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\npublic class Solution{\n\tpublic static void main(String args[]){\n\t\tScanner scanner = new Scanner(System.in);\n\t\tString input = scanner.nextLine();\n\t\tscanner.close();\n\n\t\tint res = 0;\n\t\tchar currentChar=' ';\n\t\tint count = 0;\n\t\tfor(int i=0; i<input.length(); i++){\n\t\t\tif(currentChar != input.charAt(i)){\n\t\t\t\tif(i!=0 && count % 2 == 0)\n\t\t\t\t\tres++;\n\t\t\t\tcount = 1;\n\t\t\t\tcurrentChar = input.charAt(i);\n\t\t\t}else{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif(count % 2 == 0)\n\t\t\tres++;\n\t\tSystem.out.println(res);\n\n\t}\n\n}", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "23c8a36b2ccbd037026aa61ec7d01080", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.*;\n\npublic class A {\n\n public static void main(String[] args) {\n InputScanner is = new InputScanner();\n try{\n String s = is.next();\n char[] tab = s.toCharArray();\n char c = tab[0];\n int counter = 1;\n int result = 0;\n for (int i = 1; i < tab.length; i++) {\n if (tab[i]==c) counter++;\n else{\n if (counter%2==0) result++;\n counter = 1;\n c = tab[i];\n }\n }\n if (counter%2==0) result++;\n System.out.println(result);\n } catch (IOException e){\n e.printStackTrace();\n }\n\n }\n\n\n static class InputScanner {\n\n BufferedReader br;\n StringTokenizer st;\n\n public InputScanner() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n public String next() throws IOException {\n if (st == null || !st.hasMoreTokens()) {\n String line = br.readLine();\n st = new StringTokenizer(line);\n }\n return st.nextToken();\n }\n\n public int nextInt() throws IOException {\n String next = next();\n return Integer.parseInt(next);\n }\n\n public long nextLong() throws IOException {\n String next = next();\n return Long.parseLong(next);\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "1a5e183f771c9a02bd0d69ee62893c4d", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.util.Map.*;\nimport java.lang.reflect.*;\nimport java.math.*;\n\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n Task solver = new A();\n solver.solve(1, in, out);\n out.close();\n }\n}\n\ninterface Task {\n public void solve(int testNumber, InputReader in, OutputWriter out);\n}\n\nclass A implements Task {\n \n public void solve(int testNumber, InputReader in, OutputWriter out){\n String str=in.next();\n int ret=0, n=str.length(), c=0;\n for (int i=1; i<n; i++) {\n \tif (str.charAt(i)!=str.charAt(i-1)) {\n \t\tret+=c%2;\n \t\tc=0;\n \t}\n \telse c++;\n }\n ret+=c%2;\n out.printLine(ret);\n }\n \n}\n\nclass B implements Task {\n\t\n\tpublic void solve(int testNumber, InputReader in, OutputWriter out) {\n String str=in.next();\n StringBuilder ret=new StringBuilder();\n for (int i=0; i<str.length(); i++) {\n \tchar c=str.charAt(i);\n \tif (c=='>') ret.append(\"1000\");\n \telse if (c=='<') ret.append(\"1001\");\n \telse if (c=='+') ret.append(\"1010\");\n \telse if (c=='-') ret.append(\"1011\");\n \telse if (c=='.') ret.append(\"1100\");\n \telse if (c==',') ret.append(\"1101\");\n \telse if (c=='[') ret.append(\"1110\");\n \telse ret.append(\"1111\");\n }\n int n=0;\n for (int i=0; i<ret.length(); i++) n=(2*n+ret.charAt(i)-'0')%1000003;\n out.printLine(n);\n }\n\t\n}\n\nclass C implements Task {\n \n\tpublic void solve(int testNumber, InputReader in, OutputWriter out){\n \n }\n\t\n}\n\nclass D implements Task {\n \n\tpublic void solve(int testNumber, InputReader in, OutputWriter out){\n \n }\n \n}\n\nclass E implements Task {\n \n\tpublic void solve(int testNumber, InputReader in, OutputWriter out){\n \t\n\t}\n \n}\n\nclass F implements Task {\n\t\n\tpublic void solve (int testNumber, InputReader in, OutputWriter out) {\n\t\t\n\t}\n\t\n}\n\nclass InputReader {\n\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public int peek() {\n if (numChars == -1)\n return -1;\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n return -1;\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public long readLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public String readString() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n if (Character.isValidCodePoint(c))\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n private String readLine0() {\n StringBuilder buf = new StringBuilder();\n int c = read();\n while (c != '\\n' && c != -1) {\n if (c != '\\r')\n buf.appendCodePoint(c);\n c = read();\n }\n return buf.toString();\n }\n\n public String readLine() {\n String s = readLine0();\n while (s.trim().length() == 0)\n s = readLine0();\n return s;\n }\n\n public String readLine(boolean ignoreEmptyLines) {\n if (ignoreEmptyLines)\n return readLine();\n else\n return readLine0();\n }\n\n public BigInteger readBigInteger() {\n try {\n return new BigInteger(readString());\n } catch (NumberFormatException e) {\n throw new InputMismatchException();\n }\n }\n\n public char readCharacter() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n return (char) c;\n }\n\n public double readDouble() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, readInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, readInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n\n public boolean isExhausted() {\n int value;\n while (isSpaceChar(value = peek()) && value != -1)\n read();\n return value == -1;\n }\n\n public String next() {\n return readString();\n }\n\n public SpaceCharFilter getFilter() {\n return filter;\n }\n\n public void setFilter(SpaceCharFilter filter) {\n this.filter = filter;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n}\n\nclass OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void print(char[] array) {\n writer.print(array);\n }\n\n public void print(Object...objects) {\n for (int i = 0; i < objects.length; i++) {\n if (i != 0)\n writer.print(' ');\n writer.print(objects[i]);\n }\n }\n\n public void print(int[] array) {\n for (int i = 0; i < array.length; i++) {\n if (i != 0)\n writer.print(' ');\n writer.print(array[i]);\n }\n }\n\n public void print(long[] array) {\n for (int i = 0; i < array.length; i++) {\n if (i != 0)\n writer.print(' ');\n writer.print(array[i]);\n }\n }\n\n public void printLine(int[] array) {\n print(array);\n writer.println();\n }\n\n public void printLine(long[] array) {\n print(array);\n writer.println();\n }\n\n public void printLine() {\n writer.println();\n }\n\n public void printLine(Object...objects) {\n print(objects);\n writer.println();\n }\n\n public void print(char i) {\n writer.print(i);\n }\n\n public void printLine(char i) {\n writer.println(i);\n }\n\n public void printLine(char[] array) {\n writer.println(array);\n }\n\n public void printFormat(String format, Object...objects) {\n writer.printf(format, objects);\n }\n\n public void close() {\n writer.close();\n }\n\n public void flush() {\n writer.flush();\n }\n\n public void print(long i) {\n writer.print(i);\n }\n\n public void printLine(long i) {\n writer.println(i);\n }\n\n public void print(int i) {\n writer.print(i);\n }\n\n public void printLine(int i) {\n writer.println(i);\n }\n}\n\ninterface Filter<T> {\n\tpublic boolean accept(T value);\n}\n\ninterface Function<A, V> {\n\tpublic abstract V value(A argument);\n}\n\nclass CollectionUtils {\n\tpublic static int[] toArray(Collection<Integer> collection) {\n\t\tint[] array = new int[collection.size()];\n\t\tint index = 0;\n\t\tfor (int element : collection)\n\t\t\tarray[index++] = element;\n\t\treturn array;\n\t}\n\n\tpublic static List<Integer> range(int from, int to) {\n\t\tList<Integer> result = new ArrayList<Integer>(Math.max(from, to) - Math.min(from, to) + 1);\n\t\tif (to > from) {\n\t\t\tfor (int i = from; i <= to; i++)\n\t\t\t\tresult.add(i);\n\t\t} else {\n\t\t\tfor (int i = from; i >= to; i--)\n\t\t\t\tresult.add(i);\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static void rotate(List<Integer> list) {\n\t\tlist.add(list.remove(0));\n\t}\n\n\tpublic static<T extends Comparable<T>> T minElement(Iterable<T> collection) {\n\t\tT result = null;\n\t\tfor (T element : collection) {\n\t\t\tif (result == null || result.compareTo(element) > 0)\n\t\t\t\tresult = element;\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static<T extends Comparable<T>> T maxElement(Iterable<T> collection) {\n\t\tT result = null;\n\t\tfor (T element : collection) {\n\t\t\tif (result == null || result.compareTo(element) < 0)\n\t\t\t\tresult = element;\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static<T> T minElement(Iterable<T> collection, Comparator<T> comparator) {\n\t\tT result = null;\n\t\tfor (T element : collection) {\n\t\t\tif (result == null || comparator.compare(result, element) > 0)\n\t\t\t\tresult = element;\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static<T> T maxElement(Iterable<T> collection, Comparator<T> comparator) {\n\t\tT result = null;\n\t\tfor (T element : collection) {\n\t\t\tif (result == null || comparator.compare(result, element) < 0)\n\t\t\t\tresult = element;\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static<T> List<T> asList(Iterable<T> iterable) {\n\t\tList<T> list = new ArrayList<T>();\n\t\tfor (T element : iterable)\n\t\t\tlist.add(element);\n\t\treturn list;\n\t}\n\n\tpublic static<T> int count(Iterable<T> array, T sample) {\n\t\tint result = 0;\n\t\tfor (T element : array) {\n\t\t\tif (element.equals(sample))\n\t\t\t\tresult++;\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static<T> int count(Iterable<T> array, Filter<T> filter) {\n\t\tint result = 0;\n\t\tfor (T element : array) {\n\t\t\tif (filter.accept(element))\n\t\t\t\tresult++;\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static<T> List<T> filter(Iterable<T> sequence, Filter<T> filter) {\n\t\tList<T> result = new ArrayList<T>();\n\t\tfor (T element : sequence) {\n\t\t\tif (filter.accept(element))\n\t\t\t\tresult.add(element);\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static<A, V> List<V> apply(Iterable<A> sequence, Function<A, V> function) {\n\t\tList<V> result = new ArrayList<V>();\n\t\tfor (A element : sequence)\n\t\t\tresult.add(function.value(element));\n\t\treturn result;\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tSystem.out.println(\"Hello world!\");\n\t}\n\t\n}\n\nclass Pair<U, V> implements Comparable<Pair<U, V>> {\n\tpublic final U first;\n\tpublic final V second;\n\n\tpublic static<U, V> Pair<U, V> makePair(U first, V second) {\n\t\treturn new Pair<U, V>(first, second);\n\t}\n\n\tprivate Pair(U first, V second) {\n\t\tthis.first = first;\n\t\tthis.second = second;\n\t}\n\n\t@Override\n\tpublic boolean equals(Object o) {\n\t\tif (this == o) return true;\n\t\tif (o == null || getClass() != o.getClass()) return false;\n\n\t\tPair pair = (Pair) o;\n\n\t\treturn !(first != null ? !first.equals(pair.first) : pair.first != null) && !(second != null ? !second.equals(pair.second) : pair.second != null);\n\n\t}\n\n\t@Override\n\tpublic int hashCode() {\n\t\tint result = first != null ? first.hashCode() : 0;\n\t\tresult = 31 * result + (second != null ? second.hashCode() : 0);\n\t\treturn result;\n\t}\n\n\tpublic Pair<V, U> swap() {\n\t\treturn makePair(second, first);\n\t}\n\n\t@Override\n\tpublic String toString() {\n\t\treturn \"(\" + first + \",\" + second + \")\";\n\t}\n\n\t@SuppressWarnings({\"unchecked\"})\n\tpublic int compareTo(Pair<U, V> o) {\n\t\tint value = ((Comparable<U>)first).compareTo(o.first);\n\t\tif (value != 0)\n\t\t\treturn value;\n\t\treturn ((Comparable<V>)second).compareTo(o.second);\n\t}\n}\n\nabstract class ReadOnlyIterator<T> implements Iterator<T> {\n\tpublic final void remove() {\n\t\tthrow new UnsupportedOperationException();\n\t}\n}\n\nclass IOUtils {\n\tpublic static Pair<Integer, Integer> readIntPair(InputReader in) {\n\t\tint first = in.readInt();\n\t\tint second = in.readInt();\n\t\treturn Pair.makePair(first, second);\n\t}\n\n\tpublic static Pair<Long, Long> readLongPair(InputReader in) {\n\t\tlong first = in.readLong();\n\t\tlong second = in.readLong();\n\t\treturn Pair.makePair(first, second);\n\t}\n\n\tpublic static int[] readIntArray(InputReader in, int size) {\n\t\tint[] array = new int[size];\n\t\tfor (int i = 0; i < size; i++)\n\t\t\tarray[i] = in.readInt();\n\t\treturn array;\n\t}\n\n\tpublic static long[] readLongArray(InputReader in, int size) {\n\t\tlong[] array = new long[size];\n\t\tfor (int i = 0; i < size; i++)\n\t\t\tarray[i] = in.readLong();\n\t\treturn array;\n\t}\n\n\tpublic static double[] readDoubleArray(InputReader in, int size) {\n\t\tdouble[] array = new double[size];\n\t\tfor (int i = 0; i < size; i++)\n\t\t\tarray[i] = in.readDouble();\n\t\treturn array;\n\t}\n\n\tpublic static String[] readStringArray(InputReader in, int size) {\n\t\tString[] array = new String[size];\n\t\tfor (int i = 0; i < size; i++)\n\t\t\tarray[i] = in.readString();\n\t\treturn array;\n\t}\n\n\tpublic static char[] readCharArray(InputReader in, int size) {\n\t\tchar[] array = new char[size];\n\t\tfor (int i = 0; i < size; i++)\n\t\t\tarray[i] = in.readCharacter();\n\t\treturn array;\n\t}\n\n\tpublic static Pair<Integer, Integer>[] readIntPairArray(InputReader in, int size) {\n\t\t@SuppressWarnings({\"unchecked\"})\n\t\tPair<Integer, Integer>[] result = new Pair[size];\n\t\tfor (int i = 0; i < size; i++)\n\t\t\tresult[i] = readIntPair(in);\n\t\treturn result;\n\t}\n\n\tpublic static Pair<Long, Long>[] readLongPairArray(InputReader in, int size) {\n\t\t@SuppressWarnings({\"unchecked\"})\n\t\tPair<Long, Long>[] result = new Pair[size];\n\t\tfor (int i = 0; i < size; i++)\n\t\t\tresult[i] = readLongPair(in);\n\t\treturn result;\n\t}\n\n\tpublic static void readIntArrays(InputReader in, int[]... arrays) {\n\t\tfor (int i = 0; i < arrays[0].length; i++) {\n\t\t\tfor (int j = 0; j < arrays.length; j++)\n\t\t\t\tarrays[j][i] = in.readInt();\n\t\t}\n\t}\n\n\tpublic static void readLongArrays(InputReader in, long[]... arrays) {\n\t\tfor (int i = 0; i < arrays[0].length; i++) {\n\t\t\tfor (int j = 0; j < arrays.length; j++)\n\t\t\t\tarrays[j][i] = in.readLong();\n\t\t}\n\t}\n\n\tpublic static void readDoubleArrays(InputReader in, double[]...arrays) {\n\t\tfor (int i = 0; i < arrays[0].length; i++) {\n\t\t\tfor (int j = 0; j < arrays.length; j++)\n\t\t\t\tarrays[j][i] = in.readDouble();\n\t\t}\n\t}\n\n\tpublic static char[][] readTable(InputReader in, int rowCount, int columnCount) {\n\t\tchar[][] table = new char[rowCount][];\n\t\tfor (int i = 0; i < rowCount; i++)\n\t\t\ttable[i] = readCharArray(in, columnCount);\n\t\treturn table;\n\t}\n\n\tpublic static int[][] readIntTable(InputReader in, int rowCount, int columnCount) {\n\t\tint[][] table = new int[rowCount][];\n\t\tfor (int i = 0; i < rowCount; i++)\n\t\t\ttable[i] = readIntArray(in, columnCount);\n\t\treturn table;\n\t}\n\n\tpublic static double[][] readDoubleTable(InputReader in, int rowCount, int columnCount) {\n\t\tdouble[][] table = new double[rowCount][];\n\t\tfor (int i = 0; i < rowCount; i++)\n\t\t\ttable[i] = readDoubleArray(in, columnCount);\n\t\treturn table;\n\t}\n\n\tpublic static long[][] readLongTable(InputReader in, int rowCount, int columnCount) {\n\t\tlong[][] table = new long[rowCount][];\n\t\tfor (int i = 0; i < rowCount; i++)\n\t\t\ttable[i] = readLongArray(in, columnCount);\n\t\treturn table;\n\t}\n\n\tpublic static String[][] readStringTable(InputReader in, int rowCount, int columnCount) {\n\t\tString[][] table = new String[rowCount][];\n\t\tfor (int i = 0; i < rowCount; i++)\n\t\t\ttable[i] = readStringArray(in, columnCount);\n\t\treturn table;\n\t}\n\n\tpublic static String readText(InputReader in) {\n\t\tStringBuilder result = new StringBuilder();\n\t\twhile (true) {\n\t\t\tint character = in.read();\n\t\t\tif (character == '\\r')\n\t\t\t\tcontinue;\n\t\t\tif (character == -1)\n\t\t\t\tbreak;\n\t\t\tresult.append((char) character);\n\t\t}\n\t\treturn result.toString();\n\t}\n\n\tpublic static void readStringArrays(InputReader in, String[]... arrays) {\n\t\tfor (int i = 0; i < arrays[0].length; i++) {\n\t\t\tfor (int j = 0; j < arrays.length; j++)\n\t\t\t\tarrays[j][i] = in.readString();\n\t\t}\n\t}\n\n\tpublic static void printTable(OutputWriter out, char[][] table) {\n\t\tfor (char[] row : table)\n\t\t\tout.printLine(new String(row));\n\t}\n}\n\ninterface IntComparator {\n public static final IntComparator DEFAULT = new IntComparator() {\n public int compare(int first, int second) {\n if (first < second)\n return -1;\n if (first > second)\n return 1;\n return 0;\n }\n };\n\n\tpublic static final IntComparator REVERSE = new IntComparator() {\n\t\tpublic int compare(int first, int second) {\n\t\t\tif (first < second)\n\t\t\t\treturn 1;\n\t\t\tif (first > second)\n\t\t\t\treturn -1;\n\t\t\treturn 0;\n\t\t}\n\t};\n\n\tpublic int compare(int first, int second);\n}\n\nclass ReverseComparator<T extends Comparable<T>> implements Comparator<T> {\n\tpublic int compare(T o1, T o2) {\n\t\treturn o2.compareTo(o1);\n\t}\n}\n\nclass Angle {\n\tpublic final Point o;\n\tpublic final Point a;\n\tpublic final Point b;\n\n\tpublic Angle(Point o, Point a, Point b) {\n\t\tthis.o = o;\n\t\tthis.a = a;\n\t\tthis.b = b;\n\t}\n\n\tpublic double value() {\n\t\tdouble ab = a.distance(b);\n\t\tdouble ao = a.distance(o);\n\t\tdouble bo = b.distance(o);\n\t\treturn Math.acos((ao * ao + bo * bo - ab * ab) / (2 * ao * bo));\n\t}\n\n}\n\nclass Circle {\n\tpublic final Point center;\n\tpublic final double radius;\n\n\tpublic Circle(Point center, double radius) {\n\t\tthis.center = center;\n\t\tthis.radius = radius;\n\t}\n\n\tpublic boolean contains(Point point) {\n\t\treturn center.distance(point) < radius + GeometryUtils.epsilon;\n\t}\n\n\tpublic boolean strictContains(Point point) {\n\t\treturn center.distance(point) < radius - GeometryUtils.epsilon;\n\t}\n\n public Point[] findTouchingPoints(Point point) {\n double distance = center.distance(point);\n if (distance < radius - GeometryUtils.epsilon)\n return new Point[0];\n if (distance < radius + GeometryUtils.epsilon)\n return new Point[]{point};\n Circle power = new Circle(point, Math.sqrt((distance - radius) * (distance + radius)));\n return intersect(power);\n }\n\n public Point[] intersect(Circle other) {\n double distance = center.distance(other.center);\n if (distance > radius + other.radius + GeometryUtils.epsilon || Math.abs(radius - other.radius) > distance + GeometryUtils.epsilon)\n return new Point[0];\n double p = (radius + other.radius + distance) / 2;\n double height = 2 * Math.sqrt(p * (p - radius) * (p - other.radius) * (p - distance)) / distance;\n double l1 = Math.sqrt(radius * radius - height * height);\n double l2 = Math.sqrt(other.radius * other.radius - height * height);\n if (radius * radius + distance * distance < other.radius * other.radius)\n l1 = -l1;\n if (radius * radius > distance * distance + other.radius * other.radius)\n l2 = -l2;\n Point middle = new Point((center.x * l2 + other.center.x * l1) / (l1 + l2),\n (center.y * l2 + other.center.y * l1) / (l1 + l2));\n Line line = center.line(other.center).perpendicular(middle);\n return line.intersect(this);\n }\n}\n\nclass GeometryUtils {\n\tpublic static double epsilon = 1e-8;\n\n\tpublic static double fastHypot(double...x) {\n\t\tif (x.length == 0)\n\t\t\treturn 0;\n\t\telse if (x.length == 1)\n\t\t\treturn Math.abs(x[0]);\n\t\telse {\n\t\t\tdouble sumSquares = 0;\n\t\t\tfor (double value : x)\n\t\t\t\tsumSquares += value * value;\n\t\t\treturn Math.sqrt(sumSquares);\n\t\t}\n\t}\n\n public static double fastHypot(double x, double y) {\n return Math.sqrt(x * x + y * y);\n }\n\n\tpublic static double fastHypot(double[] x, double[] y) {\n\t\tif (x.length == 0)\n\t\t\treturn 0;\n\t\telse if (x.length == 1)\n\t\t\treturn Math.abs(x[0]- y[0]);\n\t\telse {\n\t\t\tdouble sumSquares = 0;\n\t\t\tfor (int i = 0; i < x.length; i++) {\n\t\t\t\tdouble diff = x[i] - y[i];\n\t\t\t\tsumSquares += diff * diff;\n\t\t\t}\n\t\t\treturn Math.sqrt(sumSquares);\n\t\t}\n\t}\n\n\tpublic static double fastHypot(int[] x, int[] y) {\n\t\tif (x.length == 0)\n\t\t\treturn 0;\n\t\telse if (x.length == 1)\n\t\t\treturn Math.abs(x[0]- y[0]);\n\t\telse {\n\t\t\tdouble sumSquares = 0;\n\t\t\tfor (int i = 0; i < x.length; i++) {\n\t\t\t\tdouble diff = x[i] - y[i];\n\t\t\t\tsumSquares += diff * diff;\n\t\t\t}\n\t\t\treturn Math.sqrt(sumSquares);\n\t\t}\n\t}\n\n\tpublic static double missileTrajectoryLength(double v, double angle, double g) {\n\t\treturn (v * v * Math.sin(2 * angle)) / g;\n\t}\n\n\tpublic static double sphereVolume(double radius) {\n\t\treturn 4 * Math.PI * radius * radius * radius / 3;\n\t}\n\n\tpublic static double triangleSquare(double first, double second, double third) {\n\t\tdouble p = (first + second + third) / 2;\n\t\treturn Math.sqrt(p * (p - first) * (p - second) * (p - third));\n\t}\n\n\tpublic static double canonicalAngle(double angle) {\n\t\twhile (angle > Math.PI)\n\t\t\tangle -= 2 * Math.PI;\n\t\twhile (angle < -Math.PI)\n\t\t\tangle += 2 * Math.PI;\n\t\treturn angle;\n\t}\n\n\tpublic static double positiveAngle(double angle) {\n\t\twhile (angle > 2 * Math.PI - GeometryUtils.epsilon)\n\t\t\tangle -= 2 * Math.PI;\n\t\twhile (angle < -GeometryUtils.epsilon)\n\t\t\tangle += 2 * Math.PI;\n\t\treturn angle;\n\t}\n}\n\nclass Line {\n\tpublic final double a;\n\tpublic final double b;\n\tpublic final double c;\n\n\tpublic Line(Point p, double angle) {\n\t\ta = Math.sin(angle);\n\t\tb = -Math.cos(angle);\n\t\tc = -p.x * a - p.y * b;\n\t}\n\n\tpublic Line(double a, double b, double c) {\n\t\tdouble h = GeometryUtils.fastHypot(a, b);\n\t\tthis.a = a / h;\n\t\tthis.b = b / h;\n\t\tthis.c = c / h;\n\t}\n\n\tpublic Point intersect(Line other) {\n\t\tif (parallel(other))\n\t\t\treturn null;\n\t\tdouble determinant = b * other.a - a * other.b;\n\t\tdouble x = (c * other.b - b * other.c) / determinant;\n\t\tdouble y = (a * other.c - c * other.a) / determinant;\n\t\treturn new Point(x, y);\n\t}\n\n\tpublic boolean parallel(Line other) {\n\t\treturn Math.abs(a * other.b - b * other.a) < GeometryUtils.epsilon;\n\t}\n\n\tpublic boolean contains(Point point) {\n\t\treturn Math.abs(value(point)) < GeometryUtils.epsilon;\n\t}\n\n\tpublic Line perpendicular(Point point) {\n\t\treturn new Line(-b, a, b * point.x - a * point.y);\n\t}\n\n\tpublic double value(Point point) {\n\t\treturn a * point.x + b * point.y + c;\n\t}\n\n\tpublic Point[] intersect(Circle circle) {\n\t\tdouble distance = distance(circle.center);\n\t\tif (distance > circle.radius + GeometryUtils.epsilon)\n\t\t\treturn new Point[0];\n\t\tPoint intersection = intersect(perpendicular(circle.center));\n\t\tif (Math.abs(distance - circle.radius) < GeometryUtils.epsilon)\n\t\t\treturn new Point[]{intersection};\n\t\tdouble shift = Math.sqrt(circle.radius * circle.radius - distance * distance);\n\t\treturn new Point[]{new Point(intersection.x + shift * b, intersection.y - shift * a),\n\t\t\tnew Point(intersection.x - shift * b, intersection.y + shift * a)};\n\t}\n\n\tpublic double distance(Point center) {\n\t\treturn Math.abs(value(center));\n\t}\n\n\t@Override\n\tpublic boolean equals(Object o) {\n\t\tif (this == o) return true;\n\t\tif (o == null || getClass() != o.getClass()) return false;\n\n\t\tLine line = (Line) o;\n\n\t\tif (!parallel(line)) return false;\n\t\tif (Math.abs(a * line.c - c * line.a) > GeometryUtils.epsilon || Math.abs(b * line.c - c * line.b) > GeometryUtils.epsilon) return false;\n\n\t\treturn true;\n\t}\n}\n\nclass Point implements Comparable<Point> {\n\tpublic static final Point ORIGIN = new Point(0, 0);\n\tpublic final double x;\n\tpublic final double y;\n\n\tpublic int compareTo(Point other) {\n int value = Double.compare(this.x, other.x);\n if (value != 0)\n return value;\n return Double.compare(this.y, other.y);\n }\n\t\n\t@Override\n\tpublic String toString() {\n\t\treturn \"(\" + x + \", \" + y + \")\";\n\t}\n\n\tpublic Point(double x, double y) {\n\t\tthis.x = x;\n\t\tthis.y = y;\n\t}\n\n\tpublic Line line(Point other) {\n\t\tif (equals(other))\n\t\t\treturn null;\n\t\tdouble a = other.y - y;\n\t\tdouble b = x - other.x;\n\t\tdouble c = -a * x - b * y;\n\t\treturn new Line(a, b, c);\n\t}\n\n\t@Override\n\tpublic boolean equals(Object o) {\n\t\tif (this == o)\n\t\t\treturn true;\n\t\tif (o == null || getClass() != o.getClass())\n\t\t\treturn false;\n\n\t\tPoint point = (Point) o;\n\n\t\treturn Math.abs(x - point.x) <= GeometryUtils.epsilon && Math.abs(y - point.y) <= GeometryUtils.epsilon;\n\t}\n\n\t@Override\n\tpublic int hashCode() {\n\t\tint result;\n\t\tlong temp;\n\t\ttemp = x != +0.0d ? Double.doubleToLongBits(x) : 0L;\n\t\tresult = (int) (temp ^ (temp >>> 32));\n\t\ttemp = y != +0.0d ? Double.doubleToLongBits(y) : 0L;\n\t\tresult = 31 * result + (int) (temp ^ (temp >>> 32));\n\t\treturn result;\n\t}\n\n\tpublic double distance(Point other) {\n\t\treturn GeometryUtils.fastHypot(x - other.x, y - other.y);\n\t}\n\n\tpublic double distance(Line line) {\n\t\treturn Math.abs(line.a * x + line.b * y + line.c);\n\t}\n\n\tpublic double value() {\n\t\treturn GeometryUtils.fastHypot(x, y);\n\t}\n\n\tpublic double angle() {\n\t\treturn Math.atan2(y, x);\n\t}\n\n\tpublic static Point readPoint(InputReader in) {\n\t\tdouble x = in.readDouble();\n\t\tdouble y = in.readDouble();\n\t\treturn new Point(x, y);\n\t}\n\n\tpublic Point rotate(double angle) {\n\t\tdouble nx = x * Math.cos(angle) - y * Math.sin(angle);\n\t\tdouble ny = y * Math.cos(angle) + x * Math.sin(angle);\n\t\treturn new Point(nx, ny);\n\t}\n}\n\nclass Polygon {\n\tpublic final Point[] vertices;\n\tprivate Segment[] sides;\n\n\tpublic Polygon(Point...vertices) {\n\t\tthis.vertices = vertices.clone();\n\t}\n\n\tpublic double square() {\n\t\tdouble sum = 0;\n\t\tfor (int i = 1; i < vertices.length; i++)\n\t\t\tsum += (vertices[i].x - vertices[i - 1].x) * (vertices[i].y + vertices[i - 1].y);\n\t\tsum += (vertices[0].x - vertices[vertices.length - 1].x) * (vertices[0].y + vertices[vertices.length - 1].y);\n\t\treturn Math.abs(sum) / 2;\n\t}\n\n\tpublic Point center() {\n\t\tdouble sx = 0;\n\t\tdouble sy = 0;\n\t\tfor (Point point : vertices) {\n\t\t\tsx += point.x;\n\t\t\tsy += point.y;\n\t\t}\n\t\treturn new Point(sx / vertices.length, sy / vertices.length);\n\t}\n\n public static boolean over(Point a, Point b, Point c) {\n return a.x * (b.y - c.y) + b.x * (c.y - a.y) + c.x * (a.y - b.y) < -GeometryUtils.epsilon;\n }\n\n private static boolean under(Point a, Point b, Point c) {\n return a.x * (b.y - c.y) + b.x * (c.y - a.y) + c.x * (a.y - b.y) > GeometryUtils.epsilon;\n }\n\n public static Polygon convexHull(Point[] points) {\n if (points.length == 1)\n return new Polygon(points);\n Arrays.sort(points);\n Point left = points[0];\n Point right = points[points.length - 1];\n List<Point> up = new ArrayList<Point>();\n List<Point> down = new ArrayList<Point>();\n for (Point point : points) {\n if (point == left || point == right || !under(left, point, right)) {\n while (up.size() >= 2 && under(up.get(up.size() - 2), up.get(up.size() - 1), point))\n up.remove(up.size() - 1);\n up.add(point);\n }\n if (point == left || point == right || !over(left, point, right)) {\n while (down.size() >= 2 && over(down.get(down.size() - 2), down.get(down.size() - 1), point))\n down.remove(down.size() - 1);\n down.add(point);\n }\n }\n Point[] result = new Point[up.size() + down.size() - 2];\n int index = 0;\n for (Point point : up)\n result[index++] = point;\n for (int i = down.size() - 2; i > 0; i--)\n result[index++] = down.get(i);\n return new Polygon(result);\n }\n\n\tpublic boolean contains(Point point) {\n\t\treturn contains(point, false);\n\t}\n\n public boolean contains(Point point, boolean strict) {\n\t\tfor (Segment segment : sides()) {\n\t\t\tif (segment.contains(point, true))\n\t\t\t\treturn !strict;\n\t\t}\n double totalAngle = GeometryUtils.canonicalAngle(Math.atan2(vertices[0].y - point.y, vertices[0].x - point.x) -\n\t\t\tMath.atan2(vertices[vertices.length - 1].y - point.y, vertices[vertices.length - 1].x - point.x));\n for (int i = 1; i < vertices.length; i++) {\n totalAngle += GeometryUtils.canonicalAngle(Math.atan2(vertices[i].y - point.y, vertices[i].x - point.x) -\n\t\t\t\tMath.atan2(vertices[i - 1].y - point.y, vertices[i - 1].x - point.x));\n }\n return Math.abs(totalAngle) > Math.PI;\n }\n\n\tpublic Segment[] sides() {\n\t\tif (sides == null) {\n\t\t\tsides = new Segment[vertices.length];\n\t\t\tfor (int i = 0; i < vertices.length - 1; i++)\n\t\t\t\tsides[i] = new Segment(vertices[i], vertices[i + 1]);\n\t\t\tsides[sides.length - 1] = new Segment(vertices[vertices.length - 1], vertices[0]);\n\t\t}\n\t\treturn sides;\n\t}\n\n\tpublic static double triangleSquare(Point a, Point b, Point c) {\n\t\treturn Math.abs((a.x - b.x) * (a.y + b.y) + (b.x - c.x) * (b.y + c.y) + (c.x - a.x) * (c.y + a.y)) / 2;\n\t}\n\n\tpublic double perimeter() {\n\t\tdouble result = vertices[0].distance(vertices[vertices.length - 1]);\n\t\tfor (int i = 1; i < vertices.length; i++)\n\t\t\tresult += vertices[i].distance(vertices[i - 1]);\n\t\treturn result;\n\t}\n}\n\nclass Ray {\n\tpublic final Point base;\n\tpublic final Line line;\n\tprivate final Line perpendicular;\n\n\tpublic Ray(Point base, double direction) {\n\t\tthis.base = base;\n\t\tline = new Line(base, direction);\n\t\tthis.perpendicular = line.perpendicular(base);\n\t}\n\n\tpublic Ray(Point base, Point other) {\n\t\tthis.base = base;\n\t\tline = base.line(other);\n\t\tthis.perpendicular = line.perpendicular(base);\n\t}\n\n\tpublic boolean contains(Point point) {\n\t\treturn line.contains(point) && perpendicular.value(point) > -GeometryUtils.epsilon;\n\t}\n\n\tpublic double distance(Point point) {\n\t\tif (perpendicular.value(point) > -GeometryUtils.epsilon)\n\t\t\treturn line.distance(point);\n\t\treturn base.distance(point);\n\t}\n}\n\nclass Segment {\n\tpublic final Point a;\n\tpublic final Point b;\n private double distance = Double.NaN;\n private Line line = null;\n\n\tpublic Segment(Point a, Point b) {\n\t\tthis.a = a;\n\t\tthis.b = b;\n\t}\n\n\tpublic double length() {\n if (Double.isNaN(distance))\n distance = a.distance(b);\n return distance;\n\t}\n\n\tpublic double distance(Point point) {\n\t\tdouble length = length();\n\t\tdouble left = point.distance(a);\n\t\tif (length < GeometryUtils.epsilon)\n\t\t\treturn left;\n\t\tdouble right = point.distance(b);\n\t\tif (left * left > right * right + length * length)\n\t\t\treturn right;\n\t\tif (right * right > left * left + length * length)\n\t\t\treturn left;\n\t\treturn point.distance(line());\n\t}\n\n\tpublic Point intersect(Segment other, boolean includeEnds) {\n\t\tLine line = line();\n\t\tLine otherLine = other.a.line(other.b);\n\t\tif (line.parallel(otherLine))\n\t\t\treturn null;\n\t\tPoint intersection = line.intersect(otherLine);\n\t\tif (contains(intersection, includeEnds) && other.contains(intersection, includeEnds))\n\t\t\treturn intersection;\n\t\telse\n\t\t\treturn null;\n\t}\n\n\tpublic boolean contains(Point point, boolean includeEnds) {\n\t\tif (a.equals(point) || b.equals(point))\n\t\t\treturn includeEnds;\n\t\tif (a.equals(b))\n\t\t\treturn false;\n\t\tLine line = line();\n\t\tif (!line.contains(point))\n\t\t\treturn false;\n\t\tLine perpendicular = line.perpendicular(a);\n\t\tdouble aValue = perpendicular.value(a);\n\t\tdouble bValue = perpendicular.value(b);\n\t\tdouble pointValue = perpendicular.value(point);\n\t\treturn aValue < pointValue && pointValue < bValue || bValue < pointValue && pointValue < aValue;\n\t}\n\n\tpublic Line line() {\n if (line == null)\n line = a.line(b);\n\t\treturn line;\n\t}\n\n\tpublic Point middle() {\n\t\treturn new Point((a.x + b.x) / 2, (a.y + b.y) / 2);\n\t}\n\n\tpublic Point[] intersect(Circle circle) {\n\t\tPoint[] result = line().intersect(circle);\n\t\tif (result.length == 0)\n\t\t\treturn result;\n\t\tif (result.length == 1) {\n\t\t\tif (contains(result[0], true))\n\t\t\t\treturn result;\n\t\t\treturn new Point[0];\n\t\t}\n\t\tif (contains(result[0], true)) {\n\t\t\tif (contains(result[1], true))\n\t\t\t\treturn result;\n\t\t\treturn new Point[]{result[0]};\n\t\t}\n\t\tif (contains(result[1], true))\n\t\t\treturn new Point[]{result[1]};\n\t\treturn new Point[0];\n\t}\n\n\tpublic Point intersect(Line line) {\n\t\tLine selfLine = line();\n\t\tPoint intersect = selfLine.intersect(line);\n\t\tif (intersect == null)\n\t\t\treturn null;\n\t\tif (contains(intersect, true))\n\t\t\treturn intersect;\n\t\treturn null;\n\t}\n\n\tpublic double distance(Segment other) {\n\t\tLine line = line();\n\t\tLine otherLine = other.line();\n\t\tPoint p = line == null || otherLine == null ? null : line.intersect(otherLine);\n\t\tif (p != null && contains(p, true) && other.contains(p, true))\n\t\t\treturn 0;\n\t\treturn Math.min(Math.min(other.distance(a), other.distance(b)), Math.min(distance(other.a), distance(other.b)));\n\t}\n}\n\nclass Vector {\n\tpublic final double x;\n\tpublic final double y;\n\tpublic final Point point;\n\n\tpublic Vector(double x, double y) {\n\t\tthis.x = x;\n\t\tthis.y = y;\n\t\tpoint = new Point(x, y);\n\t}\n\n\tpublic Vector(Point point) {\n\t\tthis.x = point.x;\n\t\tthis.y = point.y;\n\t\tthis.point = point;\n\t}\n\n\tpublic Vector(Point from, Point to) {\n\t\tthis(to.x - from.x, to.y - from.y);\n\t}\n\n\tpublic double angleTo(Vector other) {\n\t\treturn GeometryUtils.canonicalAngle(other.point.angle() - point.angle());\n\t}\n\n\tpublic double length() {\n\t\treturn point.value();\n\t}\n\n\tpublic double angle() {\n\t\treturn point.angle();\n\t}\n}\n\nclass Heap {\n\tprivate IntComparator comparator;\n\tprivate int size = 0;\n\tprivate int[] elements;\n\tprivate int[] at;\n\n\tpublic Heap(int maxElement) {\n\t\tthis(10, maxElement);\n\t}\n\n\tpublic Heap(IntComparator comparator, int maxElement) {\n\t\tthis(10, comparator, maxElement);\n\t}\n\n\tpublic Heap(int capacity, int maxElement) {\n\t\tthis(capacity, IntComparator.DEFAULT, maxElement);\n\t}\n\n\tpublic Heap(int capacity, IntComparator comparator, int maxElement) {\n\t\tthis.comparator = comparator;\n\t\telements = new int[capacity];\n\t\tat = new int[maxElement];\n\t\tArrays.fill(at, -1);\n\t}\n\n\tpublic int getSize() {\n\t\treturn size;\n\t}\n\n public void setComparator(IntComparator comparator) {\n this.comparator = comparator;\n }\n\n public boolean isEmpty() {\n\t\treturn size == 0;\n\t}\n\n\tpublic int add(int element) {\n\t\tensureCapacity(size + 1);\n\t\telements[size] = element;\n\t\tat[element] = size;\n\t\tshiftUp(size++);\n\t\treturn at[element];\n\t}\n\n\tpublic void shiftUp(int index) {\n//\t\tif (index < 0 || index >= size)\n//\t\t\tthrow new IllegalArgumentException();\n\t\tint value = elements[index];\n\t\twhile (index != 0) {\n\t\t\tint parent = (index - 1) >>> 1;\n\t\t\tint parentValue = elements[parent];\n\t\t\tif (comparator.compare(parentValue, value) <= 0) {\n\t\t\t\telements[index] = value;\n\t\t\t\tat[value] = index;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\telements[index] = parentValue;\n\t\t\tat[parentValue] = index;\n\t\t\tindex = parent;\n\t\t}\n\t\telements[0] = value;\n\t\tat[value] = 0;\n\t}\n\n\tpublic void shiftDown(int index) {\n\t\tif (index < 0 || index >= size)\n\t\t\tthrow new IllegalArgumentException();\n\t\twhile (true) {\n\t\t\tint child = (index << 1) + 1;\n\t\t\tif (child >= size)\n\t\t\t\treturn;\n\t\t\tif (child + 1 < size && comparator.compare(elements[child], elements[child + 1]) > 0)\n\t\t\t\tchild++;\n\t\t\tif (comparator.compare(elements[index], elements[child]) <= 0)\n\t\t\t\treturn;\n\t\t\tswap(index, child);\n\t\t\tindex = child;\n\t\t}\n\t}\n\n\tpublic int getIndex(int element) {\n\t\treturn at[element];\n\t}\n\n\tprivate void swap(int first, int second) {\n\t\tint temp = elements[first];\n\t\telements[first] = elements[second];\n\t\telements[second] = temp;\n\t\tat[elements[first]] = first;\n\t\tat[elements[second]] = second;\n\t}\n\n\tprivate void ensureCapacity(int size) {\n\t\tif (elements.length < size) {\n\t\t\tint[] oldElements = elements;\n\t\t\telements = new int[Math.max(2 * elements.length, size)];\n\t\t\tSystem.arraycopy(oldElements, 0, elements, 0, this.size);\n\t\t}\n\t}\n\n\tpublic int peek() {\n\t\tif (isEmpty())\n\t\t\tthrow new IndexOutOfBoundsException();\n\t\treturn elements[0];\n\t}\n\n\tpublic int poll() {\n\t\tif (isEmpty())\n\t\t\tthrow new IndexOutOfBoundsException();\n\t\tint result = elements[0];\n\t\tat[result] = -1;\n\t\tif (size == 1) {\n\t\t\tsize = 0;\n\t\t\treturn result;\n\t\t}\n\t\telements[0] = elements[--size];\n\t\tat[elements[0]] = 0;\n\t\tshiftDown(0);\n\t\treturn result;\n\t}\n\n public void clear() {\n size = 0;\n\t\tArrays.fill(at, -1);\n }\n}\n\nclass BooleanMatrix {\n\tpublic final boolean[][] data;\n\tpublic final int rowCount;\n\tpublic final int columnCount;\n\n\tpublic BooleanMatrix(int rowCount, int columnCount) {\n\t\tthis.rowCount = rowCount;\n\t\tthis.columnCount = columnCount;\n\t\tthis.data = new boolean[rowCount][columnCount];\n\t}\n\n\tpublic static BooleanMatrix add(BooleanMatrix first, BooleanMatrix second) {\n\t\tBooleanMatrix result = new BooleanMatrix(first.rowCount, first.columnCount);\n\t\tfor (int i = 0; i < result.rowCount; i++) {\n\t\t\tfor (int j = 0; j < result.columnCount; j++) {\n\t\t\t\tresult.data[i][j] = first.data[i][j] || second.data[i][j];\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static BooleanMatrix multiply(BooleanMatrix first, BooleanMatrix second) {\n\t\tBooleanMatrix result = new BooleanMatrix(first.rowCount, second.columnCount);\n\t\tfor (int i = 0; i < first.rowCount; i++) {\n\t\t\tfor (int j = 0; j < second.rowCount; j++) {\n\t\t\t\tfor (int k = 0; k < second.columnCount; k++)\n\t\t\t\t\tresult.data[i][k] |= first.data[i][j] && second.data[j][k];\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static BooleanMatrix identityMatrix(int size) {\n\t\tBooleanMatrix result = new BooleanMatrix(size, size);\n\t\tfor (int i = 0; i < size; i++)\n\t\t\tresult.data[i][i] = true;\n\t\treturn result;\n\t}\n\n\tpublic BooleanMatrix power(int exponent) {\n\t\tif (exponent == 0)\n\t\t\treturn identityMatrix(rowCount);\n\t\tif (exponent == 1)\n\t\t\treturn this;\n\t\tBooleanMatrix result = power(exponent >> 1);\n\t\tresult = multiply(result, result);\n\t\tif ((exponent & 1) == 1)\n\t\t\tresult = multiply(result, this);\n\t\treturn result;\n\t}\n}\n\nclass DoubleUtils {\n\tpublic static double sumGeometricProgression(double p, double q) {\n\t\treturn p / (1 - q);\n\t}\n}\n\nclass FastFourierTransform {\n\tpublic static void fft(double[] a, double[] b, boolean invert) {\n\t\tint count = a.length;\n\t\tfor (int i = 1, j = 0; i < count; i++) {\n\t\t\tint bit = count >> 1;\n\t\t\tfor (; j >= bit; bit >>= 1)\n\t\t\t\tj -= bit;\n\t\t\tj += bit;\n\t\t\tif (i < j) {\n\t\t\t\tdouble temp = a[i];\n\t\t\t\ta[i] = a[j];\n\t\t\t\ta[j] = temp;\n\t\t\t\ttemp = b[i];\n\t\t\t\tb[i] = b[j];\n\t\t\t\tb[j] = temp;\n\t\t\t}\n\t\t}\n\t\tfor (int len = 2; len <= count; len <<= 1) {\n\t\t\tint halfLen = len >> 1;\n\t\t\tdouble angle = 2 * Math.PI / len;\n\t\t\tif (invert)\n\t\t\t\tangle = -angle;\n\t\t\tdouble wLenA = Math.cos(angle);\n\t\t\tdouble wLenB = Math.sin(angle);\n\t\t\tfor (int i = 0; i < count; i += len) {\n\t\t\t\tdouble wA = 1;\n\t\t\t\tdouble wB = 0;\n\t\t\t\tfor (int j = 0; j < halfLen; j++) {\n\t\t\t\t\tdouble uA = a[i + j];\n\t\t\t\t\tdouble uB = b[i + j];\n\t\t\t\t\tdouble vA = a[i + j + halfLen] * wA - b[i + j + halfLen] * wB;\n\t\t\t\t\tdouble vB = a[i + j + halfLen] * wB + b[i + j + halfLen] * wA;\n\t\t\t\t\ta[i + j] = uA + vA;\n\t\t\t\t\tb[i + j] = uB + vB;\n\t\t\t\t\ta[i + j + halfLen] = uA - vA;\n\t\t\t\t\tb[i + j + halfLen] = uB - vB;\n\t\t\t\t\tdouble nextWA = wA * wLenA - wB * wLenB;\n\t\t\t\t\twB = wA * wLenB + wB * wLenA;\n\t\t\t\t\twA = nextWA;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (invert) {\n\t\t\tfor (int i = 0; i < count; i++) {\n\t\t\t\ta[i] /= count;\n\t\t\t\tb[i] /= count;\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic static long[] multiply(long[] a, long[] b) {\n\t\tint resultSize = Integer.highestOneBit(Math.max(a.length, b.length) - 1) << 2;\n\t\tresultSize = Math.max(resultSize, 1);\n\t\tdouble[] aReal = new double[resultSize];\n\t\tdouble[] aImaginary = new double[resultSize];\n\t\tdouble[] bReal = new double[resultSize];\n\t\tdouble[] bImaginary = new double[resultSize];\n\t\tfor (int i = 0; i < a.length; i++)\n\t\t\taReal[i] = a[i];\n\t\tfor (int i = 0; i < b.length; i++)\n\t\t\tbReal[i] = b[i];\n\t\tfft(aReal, aImaginary, false);\n\t\tif (a == b) {\n\t\t\tSystem.arraycopy(aReal, 0, bReal, 0, aReal.length);\n\t\t\tSystem.arraycopy(aImaginary, 0, bImaginary, 0, aImaginary.length);\n\t\t} else\n\t\t\tfft(bReal, bImaginary, false);\n\t\tfor (int i = 0; i < resultSize; i++) {\n\t\t\tdouble real = aReal[i] * bReal[i] - aImaginary[i] * bImaginary[i];\n\t\t\taImaginary[i] = aImaginary[i] * bReal[i] + bImaginary[i] * aReal[i];\n\t\t\taReal[i] = real;\n\t\t}\n\t\tfft(aReal, aImaginary, true);\n\t\tlong[] result = new long[resultSize];\n\t\tfor (int i = 0; i < resultSize; i++)\n\t\t\tresult[i] = Math.round(aReal[i]);\n\t\treturn result;\n\t}\n}", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "6caf952e998a98ae877cc379f0eed429", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\n\n\npublic class GeneticEngineering {\n\n\tpublic static void main(String [] args) throws Exception\n\t{\n\t\tBufferedReader buffReader = new BufferedReader(new InputStreamReader(System.in));\n\t\tPrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));\n\t\tString dna = buffReader.readLine();\n\t\tint c=1;\n\t\tint res =0;\n\t\tfor(int i=1;i<dna.length();i++)\n\t\t{\n\t\t\tif(Character.toString(dna.charAt(i)).equals(Character.toString(dna.charAt(i-1))))\n\t\t\t{\n\t\t\t\tc++;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tif(c%2==0)\n\t\t\t\t\t{\n\t\t\t\t\tres+=1;\n\t\t\t\t\tc=1;\n\t\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(c!=1 && c%2==0)\n\t\t{\n\t\t\tres+=1;\n\t\t}\n\t\tout.println(res);\n\t\tout.flush();\n\t\t\n\t}\n}\n", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "32a5a8f9e858d2f9948afd99dd80577f", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskA solver = new TaskA();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskA {\n\tpublic void solve(int testNumber, InputReader in, PrintWriter out) {\n\t\tchar[] s = in.next().toCharArray();\n\t\tint cnt = 0;\n\t\tint res = 0;\n\t\tfor (int i = 0; i < s.length; i++) {\n\t\t\t++cnt;\n\t\t\tif (i == s.length - 1 || s[i] != s[i + 1]) {\n\t\t\t\tif (cnt % 2 == 0) {\n\t\t\t\t\t++res;\n\t\t\t\t}\n\t\t\t\tcnt = 0;\n\t\t\t}\n\t\t}\n\t\tout.println(res);\n\t}\n}\n\nclass InputReader {\n\tpublic BufferedReader reader;\n\tpublic StringTokenizer tokenizer;\n\n\tpublic InputReader(InputStream stream) {\n\t\treader = new BufferedReader(new InputStreamReader(stream));\n\t}\n\n\tpublic String next() {\n\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\t}\n\t\treturn tokenizer.nextToken();\n\t}\n\n\t}\n\n", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "2928804cc67b4374d42b66d4364d7547", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\npublic class Main\n{\n\tpublic static void main(String[] args)\n\t{\n\t\tScanner sc=new Scanner(System.in);\n\t\tString str;\n\t\tstr=sc.next();\n\t\tstr=str+\" \";\n\t\tint i, pos=0, c=0, ans=0;\n\t\tchar ch, cp;\n\t\tfor(i=1;i<str.length();i++)\n\t\t{\n\t\t\tch=str.charAt(i);\n\t\t\tcp=str.charAt(pos);\n\t\t\tif(ch!=cp)\n\t\t\t{\n\t\t\t\tpos=i;\n\t\t\t\tif((c+1)%2==0)\n\t\t\t\t ans++;\n\t\t\t\t c=0;\n\t\t\t}\n\t\t\telse\n\t\t\t\tc++;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "133577976041e3641c23ad2ec8f79a79", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "/*\n* To change this template, choose Tools | Templates and open the template in\n* the editor.\n*/\n\nimport java.io.*;\n\nimport java.util.*;\n\n\npublic class Task extends ASolver {\n\n char[] dna;\n\n\n public static void main(String[] args) throws IOException {\n Task task = new Task();\n task.init();\n task.readData();\n task.writeData(task.solve());\n }\n\n @Override\n public void init() {\n super.init();\n }\n\n @Override\n public boolean readData() {\n try {\n\n dna = next().toCharArray();\n\n } catch (Exception ex) {\n System.out.println(ex.getCause());\n System.out.println(ex.getMessage());\n return false;\n }\n return true;\n }\n\n public long solve() throws IOException {\n\n int result = 0;\n\n for (int i = 0; i < dna.length; ) {\n\n int equalsCount = 0;\n int j = i + 1;\n\n while (j < dna.length && dna[j] == dna[i]) {\n equalsCount++;\n j++;\n }\n\n i = j;\n\n if (equalsCount % 2 != 0) {\n result++;\n }\n\n }\n\n return result;\n }\n}\n\nabstract class ASolver {\n\n protected StringTokenizer tokens;\n protected BufferedReader input;\n protected PrintWriter output;\n\n public void init() {\n input = new BufferedReader(new InputStreamReader(System.in));\n }\n\n public abstract boolean readData();\n\n public void writeData(String result) {\n System.out.println(result);\n }\n\n public void writeData(int result) {\n System.out.println(result);\n }\n\n public void writeData(long result) {\n System.out.println(result);\n }\n\n public int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n public byte nextByte() throws IOException {\n return Byte.parseByte(next());\n }\n\n public double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n\n public long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n public String next() throws IOException {\n while (tokens == null || !tokens.hasMoreTokens()) {\n tokens = new StringTokenizer(input.readLine());\n }\n return tokens.nextToken();\n }\n\n public String nextPoints() throws IOException {\n while (tokens == null || !tokens.hasMoreTokens()) {\n tokens = new StringTokenizer(input.readLine(), \"\\n\");\n }\n return tokens.nextToken();\n }\n\n public long infinityImitator(long a, long b) {\n if (a == Long.MIN_VALUE) {\n return Long.MIN_VALUE;\n } else {\n return a + b;\n }\n }\n\n public int infinityImitator(int a, int b) {\n if (a == Integer.MIN_VALUE) {\n return Integer.MIN_VALUE;\n } else {\n return a + b;\n }\n }\n\n /*\n * public long max(long... a) { long result = Long.MIN_VALUE; for (int i =\n * 0; i < a.length; i++) { result = Math.max(result, a[i]); } return result;\n * }\n */\n public int indexMax(int... a) {\n int result = 0;\n int index = -1;\n int length = a.length;\n for (int i = 0; i < length; i++) {\n if (a[i] > result) {\n result = a[i];\n index = i;\n }\n }\n return index;\n }\n\n public int indexMax(long... a) {\n long result = 0;\n int index = -1;\n int length = a.length;\n for (int i = 0; i < length; i++) {\n if (a[i] > result) {\n result = a[i];\n index = i;\n }\n }\n return index;\n }\n\n public int max(int... a) {\n int result = Integer.MIN_VALUE;\n for (int i = 0; i < a.length; i++) {\n result = Math.max(result, a[i]);\n }\n return result;\n }\n\n public long max(long... a) {\n long result = Integer.MIN_VALUE;\n for (int i = 0; i < a.length; i++) {\n result = Math.max(result, a[i]);\n }\n return result;\n }\n\n public int nod(int[] array) {\n int nod = array[0];\n\n for (int i = 1; i < array.length; i++) {\n nod = nod(nod, array[i]);\n }\n\n return nod;\n }\n\n private int nod(int m, int n) {\n\n int result = 0;\n\n if (m == 0) {\n return n;\n }\n\n if (n == 0) {\n return m;\n }\n\n if (n == m) {\n return m;\n }\n\n if (m == 1 || n == 1) {\n return 1;\n }\n\n int mDel = m % 2;\n int nDel = n % 2;\n\n\n if (mDel != 0 && nDel != 0) {\n return nod((Math.max(m, n) - Math.min(m, n)) / 2, Math.min(m, n));\n } else if (mDel == 0 && nDel != 0) {\n return nod(m / 2, n);\n } else if (mDel != 0 && nDel == 0) {\n return nod(m, n / 2);\n } else {\n return 2 * nod(m / 2, n / 2);\n }\n }\n}", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "f46343742be0e8a591ab83ce032a117f", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n\n\npublic class Solution {\n public static void main(String[] args) throws Exception {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n char[] input = br.readLine().trim().toCharArray();\n\n int n = input.length;\n int ans = 0;\n int count = 1;\n for(int i= 0;i<n-1;i++){\n if(input[i] == input[i+1]){\n count++;\n }\n else{\n if(count%2 == 0)ans++;\n\n count= 1;\n }\n }\n if(count%2 == 0)ans++;\n\n System.out.println(ans);\n\n }\n\n\n}", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "e679fc4f7ddede7d33c590b577e5d15d", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.*;\nimport java.util.*;\nimport java.math.*;\n\npublic class Main { \n \n public static void main(String[] args) throws java.lang.Exception { \n //Reader pm =new Reader(); \n Scanner pm = new Scanner(new BufferedReader(new InputStreamReader(System.in)));\n String s = pm.next();\n int n = s.length();\n int sum = 1;\n int ans = 0;\n for(int i=1;i<n;i++){\n if(s.charAt(i) == s.charAt(i-1)){\n sum++;\n }\n else {\n if(sum%2 == 0)\n ans++;\n sum = 1;\n }\n if(i == n-1){\n if(sum%2 == 0)\n ans++;\n }\n }\n System.out.println(ans);\n }\n \n static class Reader { \n final private int BUFFER_SIZE = 1 << 16; \n private DataInputStream din; \n private byte[] buffer; \n private int bufferPointer, bytesRead; \n \n public Reader() \n { \n din = new DataInputStream(System.in); \n buffer = new byte[BUFFER_SIZE]; \n bufferPointer = bytesRead = 0; \n } \n \n public Reader(String file_name) throws IOException \n { \n din = new DataInputStream(new FileInputStream(file_name)); \n buffer = new byte[BUFFER_SIZE]; \n bufferPointer = bytesRead = 0; \n } \n \n public String readLine() throws IOException \n { \n byte[] buf = new byte[64]; // line length \n int cnt = 0, c; \n while ((c = read()) != -1) \n { \n if (c == '\\n') \n break; \n buf[cnt++] = (byte) c; \n } \n return new String(buf, 0, cnt); \n } \n \n public int nextInt() throws IOException \n { \n int ret = 0; \n byte c = read(); \n while (c <= ' ') \n c = read(); \n boolean neg = (c == '-'); \n if (neg) \n c = read(); \n do\n { \n ret = ret * 10 + c - '0'; \n } while ((c = read()) >= '0' && c <= '9'); \n \n if (neg) \n return -ret; \n return ret; \n } \n \n public long nextLong() throws IOException \n { \n long ret = 0; \n byte c = read(); \n while (c <= ' ') \n c = read(); \n boolean neg = (c == '-'); \n if (neg) \n c = read(); \n do { \n ret = ret * 10 + c - '0'; \n } \n while ((c = read()) >= '0' && c <= '9'); \n if (neg) \n return -ret; \n return ret; \n } \n \n public double nextDouble() throws IOException \n { \n double ret = 0, div = 1; \n byte c = read(); \n while (c <= ' ') \n c = read(); \n boolean neg = (c == '-'); \n if (neg) \n c = read(); \n \n do { \n ret = ret * 10 + c - '0'; \n } \n while ((c = read()) >= '0' && c <= '9'); \n \n if (c == '.') \n { \n while ((c = read()) >= '0' && c <= '9') \n { \n ret += (c - '0') / (div *= 10); \n } \n } \n \n if (neg) \n return -ret; \n return ret; \n } \n \n private void fillBuffer() throws IOException \n { \n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE); \n if (bytesRead == -1) \n buffer[0] = -1; \n } \n \n private byte read() throws IOException \n { \n if (bufferPointer == bytesRead) \n fillBuffer(); \n return buffer[bufferPointer++]; \n } \n \n public void close() throws IOException \n { \n if (din == null) \n return; \n din.close(); \n } \n }\n} ", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "a55182d1fa7768ff97bc88748a7e6d66", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class cfr14A1 {\n static InputReader in = new InputReader();\n static String str = \"\";\n static String[] arr;\n \n public static void main(String[] args) throws Exception {\n // int n = Integer.parseInt(in.readLine());\n str = in.readLine();\n int count = 0;\n int run = 1;\n for(int i = 1; i < str.length(); i++) {\n if(str.charAt(i) == str.charAt(i - 1)) {\n run++;\n } else {\n if(run % 2 == 0) {\n count++;\n }\n run = 1;\n }\n }\n if(run % 2 == 0) {\n count++;\n }\n System.out.println(count);\n }\n\n static class InputReader {\n BufferedReader br;\n\n public InputReader() {\n try {\n br = new BufferedReader(new FileReader(\"cfr14A1.in\"));\n } catch(Exception e) {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n }\n\n public String readLine() throws Exception {\n return br.readLine();\n }\n }\n}", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "6ab4c65b784c45c0e1b6693e1c5d3ae4", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class Task391A {\n public static class InputReader {\n BufferedReader reader;\n StringTokenizer tokenizer;\n\n InputReader(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n }\n\n public static void solve(InputReader in, PrintWriter out) {\n StringBuilder st = new StringBuilder(in.next());\n char prev = '#';\n int ans = 0;\n int cnt = 1;\n for (int i = 0; i < st.length(); ++i) {\n char cur = st.charAt(i);\n if (cur == prev) {\n ++cnt;\n } else {\n if (cnt % 2 == 0) {\n ++ans;\n }\n cnt = 1;\n }\n prev = cur;\n }\n if (cnt % 2 == 0) {\n ++ans;\n }\n out.println(ans);\n out.close();\n }\n\n public static void main(String[] args) {\n solve(new InputReader(System.in), new PrintWriter(System.out));\n }\n}\n", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "858acd53124785267da64d660b61ac76", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class _391A_GeneticEngineering {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n String s = in.next();\n int ans = 0, cnt = 1;\n for (int i = 1; i < s.length(); i++) {\n if (s.charAt(i) == s.charAt(i - 1)) {\n cnt++;\n } else {\n if (cnt % 2 == 0) {\n ans++;\n }//if\n cnt = 1;\n }//else\n }//for\n if (cnt % 2 == 0) {\n ans++;\n }//if\n System.out.println(ans);\n }//psvm\n}//class\n", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "3f606c91da9fcc3e8d402950395b6d79", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.HashMap;\n\n\npublic class AMain {\n\n public static void main(String[] args) {\n // TODO Auto-generated method stub\n try{\n BufferedReader br = \n new BufferedReader(new InputStreamReader(System.in));\n \n String input;\n input=br.readLine();\n char[] s = input.toCharArray();\n \n int curSeq = 1;\n char curChar = s[0];\n int result = 0;\n for(int i=1; i<s.length; i++){\n if (s[i] != curChar){\n if (curSeq%2 == 0){\n result++;\n }\n curChar = s[i];\n curSeq = 1;\n } else {\n curSeq++;\n }\n }\n if (curSeq%2 == 0){\n result++;\n }\n System.out.println(result);\n \n }catch(IOException io){\n io.printStackTrace();\n } \n }\n \n}\n", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "cb669799d9667bef875aa36cb2512db6", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.awt.*;\nimport java.awt.event.*;\nimport java.awt.geom.*;\nimport java.io.*;\nimport java.math.*;\nimport java.text.*;\nimport java.util.*;\n\n/*\nbr = new BufferedReader(new FileReader(\"input.txt\"));\npw = new PrintWriter(new BufferedWriter(new FileWriter(\"output.txt\")));\nbr = new BufferedReader(new InputStreamReader(System.in));\npw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n */\n\npublic class Main {\n private static BufferedReader br;\n private static StringTokenizer st;\n private static PrintWriter pw;\n\n public static void main(String[] args) throws IOException {\n br = new BufferedReader(new InputStreamReader(System.in));\n pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n //int qq = 1;\n int qq = Integer.MAX_VALUE;\n //int qq = readInt();\n for(int casenum = 1; casenum <= qq; casenum++) {\n String s = nextToken();\n int ret = 0;\n for(int i = 0; i < s.length();) {\n int j = i+1;\n while(j < s.length() && s.charAt(i) == s.charAt(j)) {\n j++;\n }\n if(i%2 == j%2) {\n ret++;\n }\n i=j;\n }\n pw.println(ret);\n }\n pw.close();\n }\n\n private static void exitImmediately() {\n pw.close();\n System.exit(0);\n }\n\n private static long readLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n private static double readDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n private static int readInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n private static String nextToken() throws IOException {\n while(st == null || !st.hasMoreTokens()) {\n if(!br.ready()) {\n exitImmediately();\n }\n st = new StringTokenizer(br.readLine().trim());\n }\n return st.nextToken();\n }\n}\n\n", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "6b9454bd9a26651545ed8507214c7fcb", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "/**\n * Created with IntelliJ IDEA.\n * User: den\n * Date: 2/16/14\n * Time: 9:02 PM\n * To change this template use File | Settings | File Templates.\n */\n\n\nimport java.io.*;\nimport java.util.*;\n\npublic class TaskA extends Thread {\n private void solve() throws IOException {\n String s = nextToken();\n s += 'X';\n int currentLength = 1;\n int ans = 0;\n for (int i = 1; i < s.length(); i++){\n if (s.charAt(i-1) == s.charAt(i)){\n currentLength++;\n } else{\n if (currentLength%2 == 0){\n ans++;\n }\n currentLength = 1;\n }\n\n }\n\n out.println(ans);\n\n }\n\n public void run() {\n try {\n solve();\n } catch (Exception e) {\n System.out.println(\"System exiting....\");\n e.printStackTrace();\n System.exit(888);\n } finally {\n out.flush();\n out.close();\n }\n }\n\n public static void main(String[] args) throws FileNotFoundException {\n new TaskA().run();\n }\n\n public TaskA() throws FileNotFoundException {\n //in = new BufferedReader(new FileReader(\"A-large.in\"));\n //out = new PrintWriter(new File(\"A-large.out\"));\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n setPriority(Thread.MAX_PRIORITY);\n }\n\n private BufferedReader in;\n private PrintWriter out;\n private StringTokenizer st;\n\n private int _int() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n private double _double() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n private long _long() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n private char[] _chars() throws IOException {\n return nextToken().toCharArray();\n }\n\n private String nextToken() throws IOException {\n if (st == null || !st.hasMoreElements())\n st = new StringTokenizer(in.readLine(), \" \\t\\r\\n\");\n return st.nextToken();\n }\n}\n", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "b5243862fc45a8a8dd4d5366ec595a4e", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class MAIN {\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n String s = in.nextLine();\n in.close();\n \n int res = 0;\n if (s!=null && s.length()>1) { \n for (int i=0; i<s.length(); ) {\n int j = i+1;\n while (j<s.length() && s.charAt(j)==s.charAt(j-1)) {\n j++;\n }\n if ((j-i)%2==0) res++;\n i = j;\n }\n }\n \n System.out.println(res);\n }\n\n}\n", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "dee7f83625e642f78d0a3c4c62327a16", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class Solve6 {\n\n public static void main(String[] args) throws IOException {\n PrintWriter pw = new PrintWriter(System.out);\n new Solve6().solve(pw);\n pw.flush();\n pw.close();\n }\n\n public void solve(PrintWriter pw) throws IOException {\n FastReader sc = new FastReader();\n char[] c = sc.next().toCharArray();\n int l = 0, r = 0;\n int ans = 0;\n while (l < c.length) {\n while (r < c.length && c[r] == c[l]) {\n ++r;\n }\n if (((r - l) & 1) == 0) {\n ++ans;\n }\n l = r;\n }\n pw.println(ans);\n }\n\n static class FastReader {\n\n StringTokenizer st;\n BufferedReader br;\n\n public FastReader() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n public String next() throws IOException {\n if (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return st.nextToken();\n }\n\n public boolean hasNext() throws IOException {\n if (st != null && st.hasMoreTokens()) {\n return true;\n }\n String s = br.readLine();\n if (s == null || s.isEmpty()) {\n return false;\n }\n st = new StringTokenizer(s);\n return true;\n }\n\n public int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n public long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n public double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n\n public String nextLine() throws IOException {\n return br.readLine();\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "f93c7b111f5b6b418a94ff7ba71ccae2", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package codeforces;\nimport java.util.*;\npublic class GeneticEngineering {\n public static void main(String[] args) {\n Scanner in=new Scanner(System.in);\n String s=in.nextLine();\n int count=1;\n int insert=0;\n for(int i=0;i<s.length()-1;i++)\n {\n if(s.charAt(i)==s.charAt(i+1))\n {\n count++;\n }\n else\n {\n if(count%2==0)\n {\n insert++;\n }\n count=1;\n }\n }\n if(count%2==0)\n insert++;\n System.out.println(insert);\n }\n}\n", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "819de61471ca999c3a72ac0d602ebc44", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\npublic class GeneticEngineering \n{\n public static void main(String[] args) throws IOException\n {\n //BufferedReader in = new BufferedReader(new FileReader(\"Sample Input.txt\"));\n BufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n String line = in.readLine();\n int same=1, ins=0;\n for (int i = 1; i < line.length(); i++) \n {\n if ( line.charAt(i) == line.charAt(i-1)) same++;\n else\n {\n if ( same%2 == 0)ins++;\n same=1;\n }\n }\n if ( same%2 == 0) ins++;\n System.out.println(ins);\n }\n\n}", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "813e6421e93854aeaaf0741d7507c5e2", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Tifuera\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskA solver = new TaskA();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskA {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n String str = in.next();\n int left = 0;\n int result = 0;\n while (left < str.length()) {\n int end = left + 1;\n while (end < str.length() && str.charAt(left) == str.charAt(end)) {\n end++;\n }\n\n result += (end - left + 1) % 2;\n left = end;\n }\n\n out.println(result);\n }\n\n}\n\nclass InputReader {\n private BufferedReader reader;\n private String[] currentArray;\n\n public InputReader(InputStream inputStream) {\n reader = new BufferedReader(new InputStreamReader(inputStream));\n }\n\n\n public String next() {\n try {\n currentArray = null;\n return reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n\n}\n\n", "lang_cluster": "Java", "tags": ["two pointers", "implementation"], "code_uid": "8c50a6d5f4994ad87c9e464b352193a6", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.lang.reflect.Array;\nimport java.util.*;\nimport java.awt.Point;\n\npublic class CF_1204E {\n public static void main(String args[]) throws Exception {\n BufferedScanner in = new BufferedScanner(System.in);\n BufferedPrinter out = new BufferedPrinter(System.out);\n\n long MOD = 998244853;\n int n = in.nextInt(), m = in.nextInt();\n\n long[][] zs = new long[n + 1][m + 1];\n for (int i = 0; i <= m; i++) zs[0][i] = 1;\n\n for (int i = 1; i <= n; i++) {\n for (int j = i; j <= m; j++) {\n zs[i][j] = zs[i][j - 1] + zs[i - 1][j];\n zs[i][j] %= MOD;\n }\n }\n\n long[][] tots = new long[n + 1][m + 1];\n for (int i = 0; i <= m; i++) tots[0][i] = 1;\n for (int i = 0; i <= n; i++) tots[i][0] = 1;\n\n for(int i = 1; i <= n; i++){\n for(int j = 1; j <= m; j++){\n tots[i][j] = tots[i-1][j] + tots[i][j-1];\n tots[i][j] %= MOD;\n }\n }\n\n long[][] dp = new long[n + 1][m + 1];\n for (int i = 1; i <= n; i++) dp[i][0] = i;\n\n for (int i = 1; i <= n; i++) {\n for (int j = 1; j <= m; j++) {\n dp[i][j] = tots[i-1][j] - tots[i][j-1] + zs[i][j - 1] + dp[i][j - 1] + dp[i - 1][j];\n dp[i][j] += MOD;\n dp[i][j] %= MOD;\n }\n }\n out.println(dp[n][m]);\n\n out.close();\n in.close();\n }\n\n /**\n * My template below. FastIO and utility functions.\n * Minimized with https://codebeautify.org/javaviewer.\n */\n\n // @formatter:off\n static<T>ArrayList<ArrayList<T>>get2D(int n){ArrayList<ArrayList<T>>ret=new ArrayList<>();for(int i=0;i<n;i++)ret.add(new ArrayList<>());return ret;}\n static void force(boolean condition){if(!condition)throw new IllegalStateException();}\n static int debugCounter=0;static void debug(Object obj){debug(obj,\"#\"+debugCounter++ +\": \");}\n static void debug(Object obj,String msg){System.out.println(msg);if(obj instanceof long[][]){for(long[]a:(long[][])obj)System.out.println(Arrays.toString(a));}\n if(obj instanceof int[][]){for(int[]a:(int[][])obj)System.out.println(Arrays.toString(a));}}\n static class BufferedPrinter{PrintWriter out;BufferedPrinter(OutputStream out){this(new OutputStreamWriter(out));}\n BufferedPrinter(Writer out){this.out=new PrintWriter(new BufferedWriter(out));}\n void print(Object...os){for(int i=0;i<os.length;i++){if(i!=0)out.print(' ');out.print(os[i]);}}\n void println(Object...os){print(os);out.println();}\n void close(){out.close();}\n void flush(){out.flush();}}\n static class BufferedScanner{private final InputStream in;private final byte[]buf=new byte[1<<13];int pos,count;BufferedScanner(InputStream in)throws IOException{this.in=in;}\n long nextLong()throws IOException{return Long.parseLong(next());}\n int[]nextN(int n)throws IOException{int[]ret=new int[n];for(int i=0;i<n;i++)ret[i]=this.nextInt();return ret;}\n long[]nextNL(int n)throws IOException{long[]ret=new long[n];for(int i=0;i<n;i++)ret[i]=this.nextLong();return ret;}\n private int read(){if(count==-1)err();try{if(pos>=count){pos=0;count=in.read(buf);if(count<=0)return-1;}}catch(IOException e){err();}\n return buf[pos++];}\n private static boolean isSpace(int c){return c==' '||c=='\\n'||c=='\\r'||c=='\\t'||c==-1;}\n private int readSkipSpace(){int ret;do{ret=read();}while(isSpace(ret));return ret;}\n int nextInt(){int sign=1;int c=readSkipSpace();if(c=='-'){sign=-1;c=read();}\n int ret=0;do{if(c<'0'||c>'9')err();ret=ret*10+c-'0';c=read();}while(!isSpace(c));return sign*ret;}\n String next(){StringBuilder sb=new StringBuilder();int c=readSkipSpace();do{sb.append((char)c);c=read();}while(!isSpace(c));return sb.toString();}\n private void err(){throw new InputMismatchException();}\n void close()throws IOException{in.close();}}\n // @formatter:on\n}\n", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics", "number theory"], "code_uid": "9f2e02fcd030e0d2a9b6c7afc36a7d9a", "src_uid": "a2fcad987e9b2bb3e6395654cd4fcfbb", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "/*\n * To change this template, choose Tools | Templates\n * and open the template in the editor.\n */\n\n/**\n *\n * @author Saransh\n */\nimport java.io.*;\nimport java.util.*;\nimport java.math.*;\nimport java.lang.*;\n\n\npublic class Main {\n\n /**\n * @param args the command line arguments\n */\n public static void main(String[] args) {\n // TODO code application logic here\n try\n {\n Parserdoubt pd=new Parserdoubt(System.in);\n PrintWriter pw=new PrintWriter(System.out);\n int n=pd.nextInt();\n int m=pd.nextInt();\n int start=pd.nextInt()-1;\n int end=pd.nextInt()-1;\n //same line\n int firstline=start/m;\n int lastline=end/m;\n int ans;\n if(firstline==lastline)\n {\n ans=1;\n }\n else if(start%m==0&&(end+1)%m==0)\n {\n ans=1;\n }\n else if(start%m==0&&(end+1)%m!=0)\n {\n ans=2;\n if(end+1==n)\n ans--;\n }\n else if(start%m!=0&&(end+1)%m==0)\n {\n ans=2;\n }\n else if(lastline-firstline==1)\n {\n ans=2;\n }\n else if((start%m)-1==(end)%m)\n {\n ans=2;\n }\n else\n {\n ans=3;\n if(end+1==n)\n ans--;\n }\n pw.println(ans);\n pw.flush();\n \n }\n catch(Exception e)\n {\n e.printStackTrace();\n }\n\n }\n/*int n=pd.nextInt();\n int m=pd.nextInt();\n int start=pd.nextInt()-1;\n int end=pd.nextInt()-1;\n //same line\n int firstline=start/m;\n int lastline=end/m;\n if(firstline==lastline)\n {\n pw.println(1);\n }\n else if(start%m==0&&(end+1)%m==0)\n {\n pw.println(1);\n }\n else if(start%m==0&&(end+1)%m!=0)\n {\n pw.println(2);\n }\n else if(start%m!=0&&(end+1)%m==0)\n {\n pw.println(2);\n }\n else if(lastline-firstline==1)\n {\n pw.println(2);\n }\n else\n {\n pw.println(3);\n }\n pw.flush();*/\n}\n\n\nclass Parserdoubt\n\t{\n\t final private int BUFFER_SIZE = 1 << 17;\n\n\t private DataInputStream din;\n\t private byte[] buffer;\n\t private int bufferPointer, bytesRead;\n\n\t public Parserdoubt(InputStream in)\n\t {\n\t din = new DataInputStream(in);\n\t buffer = new byte[BUFFER_SIZE];\n\t bufferPointer = bytesRead = 0;\n\t }\n\t public String nextString() throws Exception\n\t {\n\t\t StringBuffer sb=new StringBuffer(\"\");\n\t\t byte c = read();\n\t\t while (c <= ' ') c = read();\n\t\t do\n\t\t {\n\t\t\t sb.append((char)c);\n\t\t\t c=read();\n\t\t }while(c>' ');\n\t\t return sb.toString();\n\t }\n\t public char nextChar() throws Exception\n\t {\n\t\t byte c=read();\n\t\t while(c<=' ') c= read();\n\t\t return (char)c;\n\t }\n\t public int nextInt() throws Exception\n\t {\n\t int ret = 0;\n\t byte c = read();\n\t while (c <= ' ') c = read();\n\t boolean neg = c == '-';\n\t if (neg) c = read();\n\t do\n\t {\n\t \t ret = ret * 10 + c - '0';\n\t c = read();\n\t } while (c > ' ');\n\t if (neg) return -ret;\n\t return ret;\n\t }\n\t public long nextLong() throws Exception\n\t {\n\t long ret = 0;\n\t byte c = read();\n\t while (c <= ' ') c = read();\n\t boolean neg = c == '-';\n\t if (neg) c = read();\n\t do\n\t {\n\t \t ret = ret * 10 + c - '0';\n\t c = read();\n\t } while (c > ' ');\n\t if (neg) return -ret;\n\t return ret;\n\t }\n\t private void fillBuffer() throws Exception\n\t {\n\t bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n\t if (bytesRead == -1) buffer[0] = -1;\n\t }\n\n\t private byte read() throws Exception\n\t {\n\t if (bufferPointer == bytesRead) fillBuffer();\n\t return buffer[bufferPointer++];\n\t }\n\t}", "lang_cluster": "Java", "tags": ["math"], "code_uid": "e2b3929ff313f3548157eabd4089a4ab", "src_uid": "f256235c0b2815aae85a6f9435c69dac", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.math.BigInteger;\nimport java.util.*;\nimport java.io.*;\n\npublic class H {\n FastScanner in;\n PrintWriter out;\n\n public static final long P = 1_000_000_007;\n\n public void solve() throws IOException {\n long n = in.nextInt() + 1;\n long s = 1;\n long s2 = 1;\n for (long i = 1; i <= n; i++) {\n s = (s * i) % P;\n }\n for (long i = 1; i <= 2 * n; i++) {\n s2 = (s2 * i) % P;\n }\n long m = BigInteger.valueOf(s).modPow(BigInteger.valueOf(P - 2), BigInteger.valueOf(P)).longValue();\n out.println((((s2 * m) % P )* m + P - 1) % P);\n }\n\n public void run() {\n try {\n in = new FastScanner(System.in);\n out = new PrintWriter(System.out);\n Locale.setDefault(Locale.US);\n\n solve();\n\n out.close();\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n\n class FastScanner {\n BufferedReader br;\n StringTokenizer st;\n\n FastScanner(InputStream f) {\n br = new BufferedReader(new InputStreamReader(f));\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n }\n\n public static void main(String[] arg) {\n new H().run();\n }\n}", "lang_cluster": "Java", "tags": ["combinatorics", "number theory"], "code_uid": "96459eda7396b6b522cb6d76936d8f3f", "src_uid": "a18833c987fd7743e8021196b5dcdd1b", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "\n\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\npublic class C {\n\tstatic int[] openCost, closedCost;\n\tstatic int[][][] dp;\n\tstatic int inf = 10000000;\n\n\tpublic static int solve(int curCost, int endCost, int remMoves) {\n\t\tif (remMoves == openCost.length) {\n\t\t\tif (curCost == endCost) {\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\treturn inf;\n\t\t}\n\t\tif (dp[curCost][endCost][remMoves] != -1) {\n\t\t\treturn dp[curCost][endCost][remMoves];\n\t\t}\n\t\tint min = Integer.MAX_VALUE;\n\t\tif (curCost > 0) {\n\t\t\tif (curCost < 2 * openCost.length) {\n\t\t\t\tmin = Math.min(\n\t\t\t\t\t\topenCost[remMoves]\n\t\t\t\t\t\t\t\t+ solve(curCost + 1, endCost, remMoves + 1),\n\t\t\t\t\t\tclosedCost[remMoves]\n\t\t\t\t\t\t\t\t+ solve(curCost - 1, endCost, remMoves + 1));\n\t\t\t} else {\n\t\t\t\tmin = Math.min(\n\t\t\t\t\t\tmin,\n\t\t\t\t\t\tclosedCost[remMoves]\n\t\t\t\t\t\t\t\t+ solve(curCost - 1, endCost, remMoves + 1));\n\t\t\t}\n\t\t} else {\n\t\t\tmin = Math.min(\n\t\t\t\t\tmin,\n\t\t\t\t\topenCost[remMoves]\n\t\t\t\t\t\t\t+ solve(curCost + 1, endCost, remMoves + 1));\n\t\t}\n\t\treturn dp[curCost][endCost][remMoves] = min;\n\t}\n\n\tpublic static int[][] getOpt(int[][] mat1, int[][] mat2) {\n\t\tint[][] res = new int[mat1.length][mat2.length];\n\t\tfor (int i = 0; i < mat1.length; i++) {\n\t\t\tfor (int j = 0; j < mat1.length; j++) {\n\t\t\t\tres[i][j] = Integer.MAX_VALUE;\n\t\t\t\tfor (int k = 0; k < mat1.length; k++) {\n\t\t\t\t\tres[i][j] = Math.min(res[i][j], mat1[i][k] + mat2[k][j]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tint n = nextInt();\n\t\tint m = nextInt();\n\t\topenCost = new int[n];\n\t\tclosedCost = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\topenCost[i] = nextInt();\n\t\t}\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tclosedCost[i] = nextInt();\n\t\t}\n\t\tdp = new int[2 * n + 1][2 * n + 1][n];\n\t\tfor (int i = 0; i < dp.length; i++) {\n\t\t\tfor (int j = 0; j < dp[0].length; j++) {\n\t\t\t\tArrays.fill(dp[i][j], -1);\n\t\t\t}\n\t\t}\n\t\tint[][] costMatrix = new int[2 * n + 1][2 * n + 1];\n\t\tfor (int i = 0; i <= 2 * n; i++) {\n\t\t\tfor (int j = 0; j <= 2 * n; j++) {\n\t\t\t\tcostMatrix[i][j] = solve(i, j, 0);\n\t\t\t}\n\t\t}\n//\t\tfor(int i=0;i<costMatrix.length;i++){\n//\t\t\tSystem.out.println(Arrays.toString(costMatrix[i]));\n//\t\t}\n\t\tint[][] res = new int[2 * n + 1][2 * n + 1];\n\t\tfor (int i = 0; i < 2 * n + 1; i++) {\n\t\t\tArrays.fill(res[i], 1000000000);\n\t\t}\n\t\tfor (int i = 0; i < 2 * n + 1; i++) {\n\t\t\tres[i][i] = 0;\n\t\t}\n\t\twhile (m > 0) {\n\t\t\tif ((m & 1) == 1) {\n\t\t\t\tres = getOpt(res, costMatrix);\n\t\t\t}\n\t\t\tcostMatrix = getOpt(costMatrix, costMatrix);\n\t\t\tm >>= 1;\n\t\t}\n\t\tSystem.out.println(res[0][0]);\n\t}\n\n\tstatic BufferedReader br = new BufferedReader(new InputStreamReader(\n\t\t\tSystem.in));\n\tstatic StringTokenizer tokenizer = new StringTokenizer(\"\");\n\n\tstatic int nextInt() throws Exception {\n\t\treturn Integer.parseInt(next());\n\t}\n\n\tstatic double nextDouble() throws Exception {\n\t\treturn Double.parseDouble(next());\n\t}\n\n\tstatic String next() throws Exception {\n\t\twhile (true) {\n\t\t\tif (tokenizer.hasMoreTokens()) {\n\t\t\t\treturn tokenizer.nextToken();\n\t\t\t}\n\t\t\tString s = br.readLine();\n\t\t\tif (s == null) {\n\t\t\t\treturn null;\n\t\t\t}\n\t\t\ttokenizer = new StringTokenizer(s);\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["matrices", "dp"], "code_uid": "e1e728bfb023d8ad376ce7f554577850", "src_uid": "f40900973f4ebeb6fdafd75ebe4e9601", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.BufferedWriter;\nimport java.io.InputStreamReader;\nimport java.io.FileNotFoundException;\nimport java.io.FileReader;\nimport java.io.FileWriter;\nimport java.io.IOException;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\n\n\npublic class C119P2 {\n\n private static BufferedReader in;\n private static PrintWriter out;\n private static StringTokenizer input;\n \n public static void main(String[] args) throws IOException {\n //-------------------------------------------------------------------------\n //Initializing...\n new C119P2();\n //-------------------------------------------------------------------------\n //put your code here... :)\n int w = nextInt();\n int h = nextInt();\n long [][] dp = new long[w+1][h+1];\n for (int i = 2; i < dp.length; i++) {\n for (int j = 2; j < dp[i].length; j++) {\n dp[i][j] = dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1]+(i/2)*(j/2);\n }\n }\n writeln(\"\"+dp[w][h]);\n //-------------------------------------------------------------------------\n //closing up\n end();\n //--------------------------------------------------------------------------\n\n }\n \n public C119P2() throws IOException {\n //Input Output for Console to be used for trying the test samples of the problem \n in = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n //-------------------------------------------------------------------------\n //Initalize Stringtokenizer input\n input = new StringTokenizer(in.readLine());\n }\n\n private static int nextInt() throws IOException {\n if (!input.hasMoreTokens())input=new StringTokenizer(in.readLine());\n return Integer.parseInt(input.nextToken());\n }\n private static long nextLong() throws IOException {\n if (!input.hasMoreTokens())input=new StringTokenizer(in.readLine());\n return Long.parseLong(input.nextToken());\n }\n private static double nextDouble() throws IOException {\n if (!input.hasMoreTokens())input=new StringTokenizer(in.readLine());\n return Double.parseDouble(input.nextToken());\n }\n private static String nextString() throws IOException {\n if (!input.hasMoreTokens())input=new StringTokenizer(in.readLine());\n return input.nextToken();\n }\n private static void write(String output){\n out.write(output);\n out.flush();\n }\n private static void writeln(String output){\n out.write(output+\"\\n\");\n out.flush();\n }\n private static void end() throws IOException{\n in.close();\n out.close();\n System.exit(0);\n }\n\n \n\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math"], "code_uid": "8c5cd88d446e79f694ce7e545dfb142d", "src_uid": "42454dcf7d073bf12030367eb094eb8c", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package hel2018;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class E1 {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t\tint R = ni(), B = ni();\n\t\tif(R != B){\n\t\t\tout.println(\"No\");\n\t\t\treturn;\n\t\t}\n\t\tint[][] cor = new int[R][];\n\t\tint[][] cob = new int[B][];\n\t\tfor(int i = 0;i < R;i++){\n\t\t\tcor[i] = na(2);\n\t\t}\n\t\tfor(int i = 0;i < B;i++){\n\t\t\tcob[i] = na(2);\n\t\t}\n\t\tint n = R;\n\t\tint[] ord = new int[n];\n\t\tfor(int i = 0;i < n;i++)ord[i] = i;\n\t\touter:\n\t\tdo{\n\t\t\tfor(int i = 0;i < n;i++){\n\t\t\t\tfor(int j = i+1;j < n;j++){\n\t\t\t\t\tif(hasCommonPoint(cor[i], cob[ord[i]], cor[j], cob[ord[j]]))continue outer;\n\t\t\t\t}\n\t\t\t}\n\t\t\tout.println(\"Yes\");\n\t\t\treturn;\n\t\t}while(nextPermutation(ord));\n\t\tout.println(\"No\");\n\t}\n\t\n\tpublic static boolean hasCommonPoint(long ax, long ay, long bx, long by, long cx, long cy, long dx, long dy)\n\t{\n\t\tlong c1 = (cx-ax)*(by-ay)-(cy-ay)*(bx-ax);\n\t\tlong c2 = (dx-ax)*(by-ay)-(dy-ay)*(bx-ax);\n\t\tif(c1 < 0 && c2 < 0 || c1 > 0 && c2 > 0)return false;\n\t\tlong d1 = (ax-cx)*(dy-cy)-(ay-cy)*(dx-cx);\n\t\tlong d2 = (bx-cx)*(dy-cy)-(by-cy)*(dx-cx);\n\t\tif(d1 < 0 && d2 < 0 || d1 > 0 && d2 > 0)return false;\n\t\tif(c1 == 0 && c2 == 0 && d1 == 0 && d2 == 0){\n\t\t\tif(ax == bx && ay == by){\n\t\t\t\treturn (cx-ax)*(dx-ax)+(cy-ay)*(dy-ay) <= 0;\n\t\t\t}else{\n\t\t\t\tlong posc = (cx-ax)*(bx-ax)+(cy-ay)*(by-ay);\n\t\t\t\tlong posd = (dx-ax)*(bx-ax)+(dy-ay)*(by-ay);\n\t\t\t\tlong den = (bx-ax)*(bx-ax)+(by-ay)*(by-ay);\n\t//\t\t\treturn Math.max(0, Math.min(posc, posd)) <= Math.min(den, Math.max(posc, posd));\n\t//\t\t\treturn Math.min(posc, posd) <= den && 0 <= Math.max(posc, posd);\n\t\t\t\treturn (posc <= den || posd <= den) && (0 <= posc || 0 <= posd);\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tpublic static boolean hasCommonPoint(int[] a, int[] b, int[] c, int[] d){ return hasCommonPoint(a[0], a[1], b[0], b[1], c[0], c[1], d[0], d[1]);}\n\tpublic static boolean hasCommonPoint(long[] a, long[] b, long[] c, long[] d){ return hasCommonPoint(a[0], a[1], b[0], b[1], c[0], c[1], d[0], d[1]);}\n\n\t\n\tpublic static boolean nextPermutation(int[] a) {\n\t\tint n = a.length;\n\t\tint i;\n\t\tfor (i = n - 2; i >= 0 && a[i] >= a[i + 1]; i--)\n\t\t\t;\n\t\tif (i == -1)\n\t\t\treturn false;\n\t\tint j;\n\t\tfor (j = i + 1; j < n && a[i] < a[j]; j++)\n\t\t\t;\n\t\tint d = a[i];\n\t\ta[i] = a[j - 1];\n\t\ta[j - 1] = d;\n\t\tfor (int p = i + 1, q = n - 1; p < q; p++, q--) {\n\t\t\td = a[p];\n\t\t\ta[p] = a[q];\n\t\t\ta[q] = d;\n\t\t}\n\t\treturn true;\n\t}\n\n\t\n\tvoid run() throws Exception\n\t{\n//\t\tint n = 10, m = 99999;\n//\t\tRandom gen = new Random();\n//\t\tStringBuilder sb = new StringBuilder();\n//\t\tsb.append(n + \" \");\n//\t\tsb.append(n + \" \");\n//\t\tfor (int i = 0; i < n*4; i++) {\n//\t\t\tsb.append(gen.nextInt(20)-10 + \" \");\n//\t\t}\n//\t\tINPUT = sb.toString();\n\n\t\t\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new E1().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["math", "greedy", "geometry", "brute force"], "code_uid": "fbb1de59eb5df972ccd02aaa9a4c50bc", "src_uid": "65f81f621c228c09915adcb05256c634", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.List;\nimport java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.ArrayList;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.Reader;\nimport java.io.Writer;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Niyaz Nigmatullin\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tFastScanner in = new FastScanner(inputStream);\n\t\tFastPrinter out = new FastPrinter(outputStream);\n\t\tTaskC solver = new TaskC();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskC {\n public void solve(int testNumber, FastScanner in, FastPrinter out) {\n int x1 = in.nextInt();\n int y1 = in.nextInt();\n int x2 = in.nextInt();\n int y2 = in.nextInt();\n int x3 = in.nextInt();\n int y3 = in.nextInt();\n for (int rot = 0; rot < 4; rot++) {\n if (canSolve(x2 - x1, y2 - y1, x3, y3)) {\n out.println(\"YES\");\n return;\n }\n int nx1 = -y1;\n int ny1 = x1;\n x1 = nx1;\n y1 = ny1;\n }\n out.println(\"NO\");\n }\n\n static boolean canSolve(int x1, int y1, int x2, int y2) {\n if (x2 == 0 && y2 == 0) {\n return x1 == 0 && y1 == 0;\n }\n long a1 = x2;\n long b1 = -y2;\n long c1 = x1;\n long a2 = y2;\n long b2 = x2;\n long c2 = y1;\n long z = a1 * b2 - a2 * b1;\n long dx = b1 * c2 - c1 * b2;\n long dy = c1 * a2 - a1 * c2;\n if (z == 0) {\n if (dx != 0 || dy != 0) {\n return false;\n }\n return c1 % MathUtils.gcd(Math.abs(a1), Math.abs(b1)) == 0;\n }\n return dx % z == 0 && dy % z == 0;\n }\n}\n\nclass FastScanner extends BufferedReader {\n\n boolean isEOF;\n\n public FastScanner(InputStream is) {\n super(new InputStreamReader(is));\n }\n\n public int read() {\n try {\n int ret = super.read();\n if (isEOF && ret < 0) {\n throw new InputMismatchException();\n }\n isEOF = ret == -1;\n return ret;\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n }\n\n static boolean isWhiteSpace(int c) {\n return c >= -1 && c <= 32;\n }\n\n public int nextInt() {\n int c = read();\n while (isWhiteSpace(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int ret = 0;\n while (!isWhiteSpace(c)) {\n if (c < '0' || c > '9') {\n throw new NumberFormatException(\"digit expected \" + (char) c\n + \" found\");\n }\n ret = ret * 10 + c - '0';\n c = read();\n }\n return ret * sgn;\n }\n\n }\n\nclass FastPrinter extends PrintWriter {\n\n public FastPrinter(OutputStream out) {\n super(out);\n }\n\n public FastPrinter(Writer out) {\n super(out);\n }\n\n\n}\n\nclass MathUtils {\n\n\n public static long gcd(long a, long b) {\n while (b != 0) {\n long t = a % b;\n a = b;\n b = t;\n }\n return a;\n }\n\n }\n\n", "lang_cluster": "Java", "tags": ["math", "implementation"], "code_uid": "5db2bb74efc18c4d810844e56356e049", "src_uid": "cc8a8af1ba2b19bf081e379139542883", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "// practice with kaiboy\nimport java.io.*;\nimport java.util.*;\n\npublic class CF27E extends PrintWriter {\n\tCF27E() { super(System.out, true); }\n\tScanner sc = new Scanner(System.in);\n\tpublic static void main(String[] $) {\n\t\tCF27E o = new CF27E(); o.main(); o.flush();\n\t}\n\n\tstatic final long INF = 0x3f3f3f3f3f3f3f3fL;\n\tlong ans = INF;\n\tint[] pp = { 2, 3, 5, 7, 11, 13, 17, 19, 23 };\n\tvoid solve(int n, int b, int i, long m) {\n\t\tif (n == 1) {\n\t\t\tans = Math.min(ans, m);\n\t\t\treturn;\n\t\t}\n\t\tint p = pp[i];\n\t\tfor (int a = 2; a <= b && m <= INF / p; a++, m *= p)\n\t\t\tif (n % a == 0)\n\t\t\t\tsolve(n / a, a, i + 1, m * p);\n\t}\n\tvoid main() {\n\t\tint n = sc.nextInt();\n\t\tsolve(n, 60, 0, 1);\n\t\tprintln(ans);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "dp", "number theory"], "code_uid": "7d113e93b021222938ac1ce605c95ff1", "src_uid": "62db589bad3b7023418107de05b7a8ee", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.ArrayDeque;\nimport java.util.Arrays;\nimport java.util.PriorityQueue;\nimport java.util.Queue;\nimport java.util.StringTokenizer;\n\npublic class GregandFriends {\n static long[][] C;\n\n public static long[][] C(int MAX) {\n long C[][] = new long[MAX + 1][MAX + 1];\n for (int i = 0; i < C.length; i++)\n C[i][0] = 1;\n for (int i = 1; i < C.length; i++)\n C[0][i] = 0;\n for (int i = 1; i < C.length; i++)\n for (int j = 1; j < C[i].length; j++)\n C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % MOD;\n return C;\n }\n\n static int k;\n static long[][][] dp;\n static int[][][] dist;\n static int c1, c2;\n static long MOD = 1000000007;\n\n public static long modMul(long a, long b, long c) {\n return (((a * b) % MOD) * c) % MOD;\n }\n\n public static long go(int p, int ci, int cj) {\n if (ci == c1 && cj == c2 && p == 1)\n return 1;\n long ret = 0;\n if (dp[p][ci][cj] != -1) {\n return dp[p][ci][cj];\n }\n for (int i = 0; i * 50 <= k && i <= ci; i++) {\n for (int j = 0; i * 50 + j * 100 <= k && j <= cj; j++) {\n if (i == 0 && j == 0)\n continue;\n int nexti = c1 - ci + i;\n int nextj = c2 - cj + j;\n int nextp = p ^ 1;\n if (dist[nextp][nexti][nextj] == dist[p][ci][cj] + 1) {\n ret = (ret + modMul(C[ci][i], C[cj][j],\n go(nextp, nexti, nextj)))\n % MOD;\n }\n }\n }\n return dp[p][ci][cj] = ret;\n }\n\n public static void main(String[] args) throws Exception {\n InputReader in = new InputReader(System.in);\n int n = in.nextInt();\n k = in.nextInt();\n dist = new int[2][n + 1][n + 1];\n for (int[][] a : dist)\n for (int[] b : a)\n Arrays.fill(b, 1 << 20);\n for (int i = 0; i < n; i++) {\n int x = in.nextInt();\n if (x == 50)\n c1++;\n else\n c2++;\n }\n C = C(52);\n dist[0][c1][c2] = 0;\n dp = new long[2][n + 1][n + 1];\n for (long[][] a : dp)\n for (long[] b : a)\n Arrays.fill(b, -1);\n Queue<int[]> Q = new ArrayDeque<int[]>();\n Q.add(new int[] { 0, c1, c2 });\n while (!Q.isEmpty()) {\n int[] state = Q.poll();\n // System.out.println(Arrays.toString(state));\n int cp = state[0];\n int ci = state[1];\n int cj = state[2];\n for (int i = 0; i * 50 <= k && i <= ci; i++) {\n for (int j = 0; i * 50 + j * 100 <= k && j <= cj; j++) {\n if (i == 0 && j == 0)\n continue;\n int nexti = c1 - ci + i;\n int nextj = c2 - cj + j;\n int nextp = cp ^ 1;\n if (dist[nextp][nexti][nextj] == 1 << 20) {\n dist[nextp][nexti][nextj] = 1 + dist[cp][ci][cj];\n Q.add(new int[] { nextp, nexti, nextj });\n }\n }\n }\n }\n if (dist[1][c1][c2] == 1 << 20) {\n System.out.println(-1);\n System.out.println(0);\n } else {\n System.out.println(dist[1][c1][c2]);\n System.out.println(go(0, c1, c2));\n }\n }\n\n static class InputReader {\n private BufferedReader reader;\n private StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream));\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "ce5ff9760cf534a95757b4365d60b4cf", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class C_new {\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\tboolean eof;\n\n\tint cnt1, cnt2;\n\n\tint getV(int c1, int c2, int side) {\n\t\treturn c1 + c2 * (cnt1 + 1) + side * (cnt1 + 1) * (cnt2 + 1);\n\t}\n\n\tstatic final int MOD = 1000000007;\n\tstatic final int INF = Integer.MAX_VALUE / 3;\n\n\tclass Edge {\n\t\tint to, ways;\n\n\t\tpublic Edge(int to, int ways) {\n\t\t\tthis.to = to;\n\t\t\tthis.ways = ways;\n\t\t}\n\t}\n\n\tint[][] arrC;\n\n\tvoid makeC(int n) {\n\t\tarrC = new int[n + 1][];\n\t\tfor (int i = 0; i <= n; i++) {\n\t\t\tarrC[i] = new int[i + 1];\n\t\t\tarrC[i][0] = arrC[i][i] = 1;\n\t\t\tfor (int j = 1; j < i; j++) {\n\t\t\t\tarrC[i][j] = arrC[i - 1][j - 1] + arrC[i - 1][j];\n\t\t\t\tif (arrC[i][j] >= MOD)\n\t\t\t\t\tarrC[i][j] -= MOD;\n\t\t\t}\n\t\t}\n\t}\n\n\tint c(int n, int k) {\n\t\tif (n < 0 || k < 0 || k > n)\n\t\t\treturn 0;\n\t\treturn arrC[n][k];\n\t}\n\n\tArrayList<Edge>[] g;\n\tint N;\n\n\tvoid solve() throws IOException {\n\t\tint n = nextInt();\n\t\tint sz = nextInt() / 50;\n\n\t\tcnt1 = 0;\n\t\tcnt2 = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint x = nextInt();\n\t\t\tif (x == 50)\n\t\t\t\tcnt1++;\n\t\t\telse\n\t\t\t\tcnt2++;\n\t\t}\n\n\t\tN = 2 * (cnt1 + 1) * (cnt2 + 1);\n\n\t\tmakeC(Math.max(cnt1, cnt2));\n\n\t\tg = new ArrayList[N];\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tg[i] = new ArrayList<>();\n\t\t}\n\n\t\tfor (int left1 = 0; left1 <= cnt1; left1++) {\n\t\t\tfor (int left2 = 0; left2 <= cnt2; left2++) {\n\t\t\t\t// from left to right\n\t\t\t\tint v = getV(left1, left2, 0);\n\n\t\t\t\tfor (int send1 = 0; send1 <= left1 && send1 <= sz; send1++) {\n\t\t\t\t\tfor (int send2 = 0; send2 <= left2\n\t\t\t\t\t\t\t&& send1 + 2 * send2 <= sz; send2++) {\n\t\t\t\t\t\tif (send1 + send2 == 0)\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\tint ways = (int) ((long) c(left1, send1)\n\t\t\t\t\t\t\t\t* c(left2, send2) % MOD);\n\t\t\t\t\t\t// System.err.println(left1 + \" \" + left2 + \" -> \" +\n\t\t\t\t\t\t// send1\n\t\t\t\t\t\t// + \" \" + send2);\n\t\t\t\t\t\tg[v].add(new Edge(\n\t\t\t\t\t\t\t\tgetV(left1 - send1, left2 - send2, 1), ways));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tv = getV(left1, left2, 1);\n\t\t\t\t// from right to left\n\t\t\t\tfor (int send1 = 0; send1 <= cnt1 - left1 && send1 <= sz; send1++) {\n\t\t\t\t\tfor (int send2 = 0; send2 <= cnt2 - left2\n\t\t\t\t\t\t\t&& send1 + 2 * send2 <= sz; send2++) {\n\t\t\t\t\t\tif (send1 + send2 == 0)\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\tint ways = (int) ((long) c(cnt1 - left1, send1)\n\t\t\t\t\t\t\t\t* c(cnt2 - left2, send2) % MOD);\n\t\t\t\t\t\t// System.err.println(left1 + \" \" + left2 + \" -> \" +\n\t\t\t\t\t\t// send1\n\t\t\t\t\t\t// + \" \" + send2);\n\t\t\t\t\t\tg[v].add(new Edge(\n\t\t\t\t\t\t\t\tgetV(left1 + send1, left2 + send2, 0), ways));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint st = getV(cnt1, cnt2, 0);\n\t\tint en = getV(0, 0, 1);\n\n\t\tint[] d = new int[N];\n\t\tArrays.fill(d, INF);\n\t\td[st] = 0;\n\n\t\tint[] ways = new int[N];\n\t\tways[st] = 1;\n\n\t\tArrayDeque<Integer> q = new ArrayDeque<>();\n\t\tq.add(st);\n\t\twhile (!q.isEmpty()) {\n\t\t\tint v = q.poll();\n\t\t\tfor (int i = 0; i < g[v].size(); i++) {\n\t\t\t\tEdge e = g[v].get(i);\n\t\t\t\tif (d[e.to] > d[v] + 1) {\n\t\t\t\t\td[e.to] = d[v] + 1;\n\t\t\t\t\tways[e.to] = 0;\n\t\t\t\t\tq.add(e.to);\n\t\t\t\t}\n\t\t\t\tif (d[e.to] == d[v] + 1) {\n\t\t\t\t\tways[e.to] += (int) ((long) ways[v] * e.ways % MOD);\n\t\t\t\t\tif (ways[e.to] >= MOD)\n\t\t\t\t\t\tways[e.to] -= MOD;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (d[en] == INF) {\n\t\t\tout.println(-1);\n\t\t\tout.println(0);\n\t\t} else {\n\t\t\tout.println(d[en]);\n\t\t\tout.println(ways[en]);\n\t\t}\n\n\t}\n\n\tC_new() throws IOException {\n\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.close();\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew C_new();\n\t}\n\n\tString nextToken() {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (Exception e) {\n\t\t\t\teof = true;\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tString nextString() {\n\t\ttry {\n\t\t\treturn br.readLine();\n\t\t} catch (IOException e) {\n\t\t\teof = true;\n\t\t\treturn null;\n\t\t}\n\t}\n\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n}", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "c7937a896fc518b00e2535362f398a83", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.util.Map.Entry;\nimport java.math.*;\nimport java.awt.geom.*;\n\nimport static java.lang.Math.*;\n\npublic class Solution implements Runnable {\n\t\n\tstatic final int MOD = 1000000007;\n\t\n\tclass State {\n\t\t\n\t\tint boat, c50, c100;\n\t\t\n\t\tpublic State(int boat, int c50, int c100) {\n\t\t\tthis.boat = boat;\n\t\t\tthis.c50 = c50;\n\t\t\tthis.c100 = c100;\n\t\t}\n\t\t\n\t}\n\t\n\tpublic void solve() throws Throwable {\n\t\tint n = sc.nextInt();\n\t\tint w = sc.nextInt();\n\t\tint count50 = 0, count100 = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint num = sc.nextInt();\n\t\t\tif (num == 50)\n\t\t\t\tcount50++;\n\t\t\telse\n\t\t\t\tcount100++;\n\t\t}\n\t\t\n\t\tint dist [][][] = new int [2][count50 + 1][count100 + 1];\n\t\tfor (int i = 0; i < 2; i++)\n\t\t\tfor (int j = 0; j <= count50; j++)\n\t\t\t\tfor (int k = 0; k <= count100; k++)\n\t\t\t\t\tdist[i][j][k] = Integer.MAX_VALUE / 2;\n\t\tdist[0][0][0] = 0;\n\t\tArrayDeque<State> q = new ArrayDeque<>();\n\t\tq.add(new State(0, 0, 0));\n\t\twhile (!q.isEmpty()) {\n\t\t\tState cur = q.poll();\n\t\t\tint boat = cur.boat;\n\t\t\tint c50 = cur.c50;\n\t\t\tint c100 = cur.c100;\n\t\t\tif (cur.boat == 0) {\n\t\t\t\tfor (int to50 = 0; to50 <= count50 - c50 && 50 * to50 <= w; to50++)\n\t\t\t\t\tfor (int to100 = 0; to100 <= count100 - c100 && 50 * to50 + 100 * to100 <= w; to100++) {\n\t\t\t\t\t\tif (to50 == 0 && to100 == 0) continue;\n\t\t\t\t\t\tif (dist[boat ^ 1][c50 + to50][c100 + to100] > dist[boat][c50][c100] + 1) {\n\t\t\t\t\t\t\tdist[boat ^ 1][c50 + to50][c100 + to100] = dist[boat][c50][c100] + 1;\n\t\t\t\t\t\t\tq.add(new State(boat ^ 1, c50 + to50, c100 + to100));\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tfor (int to50 = 0; to50 <= c50 && 50 * to50 <= w; to50++)\n\t\t\t\t\tfor (int to100 = 0; to100 <= c100 && 50 * to50 + 100 * to100 <= w; to100++) {\n\t\t\t\t\t\tif (to50 == 0 && to100 == 0) continue;\n\t\t\t\t\t\tif (dist[boat ^ 1][c50 - to50][c100 - to100] > dist[boat][c50][c100] + 1) {\n\t\t\t\t\t\t\tdist[boat ^ 1][c50 - to50][c100 - to100] = dist[boat][c50][c100] + 1;\n\t\t\t\t\t\t\tq.add(new State(boat ^ 1, c50 - to50, c100 - to100));\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (dist[1][count50][count100] == Integer.MAX_VALUE / 2) {\n\t\t\tout.println(-1);\n\t\t\tout.println(0);\n\t\t\treturn;\n\t\t}\n\t\tout.println(dist[1][count50][count100]);\n\t\t\n\t\tlong c [][] = new long [n + 1][n + 1];\n\t\tfor (int i = 0; i <= n; i++) {\n\t\t\tc[i][0] = c[i][i] = 1;\n\t\t\tfor (int j = 1; j < i; j++)\n\t\t\t\tc[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % MOD;\n\t\t}\n\t\t\n\t\tint d = dist[1][count50][count100];\n\t\tlong sum[][][] = new long[2][count50 + 1][count100 + 1];\n\t\tsum[1][count50][count100] = 1;\n\t\tfor (int distance = d; distance > 0; distance--) {\n\t\t\t// boat 0 \n\t\t\tfor (int c50 = 0; c50 <= count50; c50++)\n\t\t\t\tfor (int c100 = 0; c100 <= count100; c100++)\n\t\t\t\t\tif (dist[0][c50][c100] == distance) {\n\t\t\t\t\t\tfor (int to50 = 0; to50 <= count50 - c50 && 50 * to50 <= w; to50++)\n\t\t\t\t\t\t\tfor (int to100 = 0; to100 <= count100 - c100 && 50 * to50 + 100 * to100 <= w; to100++) {\n\t\t\t\t\t\t\t\tif (to50 == 0 && to100 == 0) continue;\n\t\t\t\t\t\t\t\tif (dist[1][c50 + to50][c100 + to100] == dist[0][c50][c100] - 1) {\n\t\t\t\t\t\t\t\t\tlong multiplier = (c[count50 - c50][to50] * c[count100 - c100][to100]) % MOD;\n\t\t\t\t\t\t\t\t\tmultiplier = (multiplier * sum[0][c50][c100]) % MOD;\n\t\t\t\t\t\t\t\t\tsum[1][c50 + to50][c100 + to100] += multiplier;\n\t\t\t\t\t\t\t\t\tsum[1][c50 + to50][c100 + to100] %= MOD;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\tfor (int c50 = 0; c50 <= count50; c50++)\n\t\t\t\tfor (int c100 = 0; c100 <= count100; c100++)\n\t\t\t\t\tif (dist[1][c50][c100] == distance) {\n\t\t\t\t\t\tfor (int to50 = 0; to50 <= c50 && 50 * to50 <= w; to50++)\n\t\t\t\t\t\t\tfor (int to100 = 0; to100 <= c100 && 50 * to50 + 100 * to100 <= w; to100++) {\n\t\t\t\t\t\t\t\tif (to50 == 0 && to100 == 0) continue;\n\t\t\t\t\t\t\t\tif (dist[0][c50 - to50][c100 - to100] == dist[1][c50][c100] - 1) {\n\t\t\t\t\t\t\t\t\tlong multiplier = (c[c50][to50] * c[c100][to100]) % MOD;\n\t\t\t\t\t\t\t\t\tmultiplier = (multiplier * sum[1][c50][c100]) % MOD;\n\t\t\t\t\t\t\t\t\tsum[0][c50 - to50][c100 - to100] += multiplier;\n\t\t\t\t\t\t\t\t\tsum[0][c50 - to50][c100 - to100] %= MOD;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\n\t\t}\n\t\tout.println(sum[0][0][0]);\n\t}\n\n\tBufferedReader in;\n\tPrintWriter out;\n\tFastScanner sc;\n\n\tstatic Throwable uncaught;\n\n\t@Override\n\tpublic void run() {\n\t\ttry {\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(System.out);\n\t\t\tsc = new FastScanner(in);\n\t\t\tsolve();\n\t\t} catch (Throwable t) {\n\t\t\tSolution.uncaught = t;\n\t\t} finally {\n\t\t\tout.close();\n\t\t}\n\t}\n\n\tpublic static void main(String[] args) throws Throwable {\n\t\tThread t = new Thread(null, new Solution(), \"\", (1 << 26));\n\t\tt.start();\n\t\tt.join();\n\t\tif (uncaught != null) {\n\t\t\tthrow uncaught;\n\t\t}\n\t}\n\n}\n\nclass FastScanner {\n\n\tBufferedReader reader;\n\tStringTokenizer strTok;\n\n\tpublic FastScanner(BufferedReader reader) {\n\t\tthis.reader = reader;\n\t}\n\n\tpublic String nextToken() throws IOException {\n\t\twhile (strTok == null || !strTok.hasMoreTokens()) {\n\t\t\tstrTok = new StringTokenizer(reader.readLine().trim());\n\t\t}\n\t\treturn strTok.nextToken();\n\t}\n\n\tpublic int nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tpublic long nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tpublic double nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n\n}\n\nclass Treap {\n\t\n\tstatic Random rnd = new Random();\n\t\n\tlong x, sum, pairSum;\n\tint prior, cnt;\n\tTreap l, r;\n\t\n\tpublic Treap(long x) {\n\t\tthis.x = x;\n\t\tthis.sum = x;\n\t\tthis.pairSum = 0;\n\t\tthis.cnt = 1;\n\t\tthis.prior = rnd.nextInt();\n\t}\n\t\n\tpublic static long getSum (Treap t) {\n\t\treturn t == null ? 0 : t.sum;\n\t}\n\t\n\tpublic static long getPairSum (Treap t) {\n\t\treturn t == null ? 0 : t.pairSum;\n\t}\n\t\n\tpublic static int getCount (Treap t) {\n\t\treturn t == null ? 0 : t.cnt;\n\t}\n\t\n\tpublic static void updateVertex (Treap t) {\n\t\tif (t == null) return;\n\t\tt.cnt = getCount(t.l) + getCount(t.r) + 1;\n\t\tt.sum = getSum(t.l) + getSum(t.r) + t.x;\n\t\tt.pairSum = getPairSum(t.l) + getPairSum(t.r);\n\t\tif (t.l != null)\n\t\t\tt.pairSum += t.x * getCount(t.l) - getSum(t.l);\n\t\tif (t.r != null)\n\t\t\tt.pairSum += getSum(t.r) - t.x * getCount(t.r);\n\t\tif (t.l != null && t.r != null)\n\t\t\tt.pairSum += getSum(t.r) * getCount(t.l) - getSum(t.l) * getCount(t.r);\n\t}\n\t\n\tpublic static Treap merge (Treap l, Treap r) {\n\t\tif (l == null) return r;\n\t\tif (r == null) return l;\n\t\tif (l.prior > r.prior) {\n\t\t\tl.r = merge (l.r, r);\n\t\t\tupdateVertex(l);\n\t\t\treturn l;\n\t\t} else {\n\t\t\tr.l = merge (l, r.l);\n\t\t\tupdateVertex(r);\n\t\t\treturn r;\n\t\t}\n\t}\n\t\n\tpublic static Treap [] split (Treap t, long key) {\n\t\tif (t == null) return new Treap [] {null, null};\n\t\tTreap[] res = null;\n\t\tif (key <= t.x) {\n\t\t\tres = split (t.l, key);\n\t\t\tt.l = res[1];\n\t\t\tres[1] = t;\n\t\t} else {\n\t\t\tres = split (t.r, key);\n\t\t\tt.r = res[0];\n\t\t\tres[0] = t;\n\t\t}\n\t\tupdateVertex(res[0]);\n\t\tupdateVertex(res[1]);\n\t\treturn res;\n\t}\n\t\n\tpublic static void dfs (Treap t, StringBuilder sb) {\n\t\tif (t == null) return;\n\t\tdfs (t.l, sb);\n\t\tsb.append(t.x);\n\t\tsb.append(\" \");\n\t\tdfs (t.r, sb);\n\t}\n\t\n}", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "9ad577ca0d1908b34582c59d1689ac97", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.File;\nimport java.io.FileNotFoundException;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\n\npublic class C295 {\n\tstatic class FastScanner {\n\t\tBufferedReader reader;\n\t\tStringTokenizer tokens;\n\n\t\tpublic FastScanner(File file) throws FileNotFoundException {\n\t\t\treader = new BufferedReader(new FileReader(file));\n\t\t}\n\n\t\tpublic FastScanner(InputStream in) {\n\t\t\treader = new BufferedReader(new InputStreamReader(in));\n\t\t}\n\n\t\tpublic String nextToken() {\n\t\t\twhile (tokens == null || !tokens.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttokens = new StringTokenizer(reader.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\treturn null;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tokens.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(nextToken());\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(nextToken());\n\t\t}\n\n\t\tpublic boolean hasNextToken() {\n\t\t\twhile (tokens == null || !tokens.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttokens = new StringTokenizer(reader.readLine());\n\t\t\t\t} catch (Exception e) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\t\tpublic void close() {\n\t\t\ttry {\n\t\t\t\treader.close();\n\t\t\t} catch (IOException e) {\n\t\t\t}\n\t\t}\n\t}\n\n\tstatic int[][][][] d;\n\tstatic int[][] C;\n\tstatic int slim = 0;\n\tstatic int fat = 0;\n\tstatic int k;\n\n\tpublic static int get(int boat, int i, int j, int n) {\n\t\tif (i < 0 || j < 0 || n < 0) {\n\t\t\treturn 0;\n\t\t}\n\t\tif (d[boat][i][j][n] != 0) {\n\t\t\treturn d[boat][i][j][n] - 1;\n\t\t}\n\t\tif (n == 0) {\n\t\t\tif (i == 0 && j == 0) {\n\t\t\t\td[boat][i][j][0] = 2;\n\t\t\t} else {\n\t\t\t\td[boat][i][j][0] = 1;\n\t\t\t}\n\t\t\treturn d[boat][i][j][0] - 1;\n\t\t}\n\t\td[boat][i][j][n] = 1;\n\t\tlong delta = 0;\n\t\tif (boat == 1) {\n\t\t\tfor (int countSlim = 0; countSlim <= i; countSlim++) {\n\t\t\t\tfor (int countFat = 0; countFat <= j && countSlim + 2 * countFat <= k; countFat++) {\n\t\t\t\t\tif (countFat + countSlim > 0) {\n\t\t\t\t\t\tdelta = ((long)get(0,i - countSlim, j - countFat, n - 1) * (C[slim - i + countSlim][countSlim])) % 1000000007;\n\t\t\t\t\t\tdelta = (delta * C[fat - j + countFat][countFat]) % 1000000007;\n\t\t\t\t\t\td[boat][i][j][n] = (int)((d[boat][i][j][n] + delta) % 1000000007);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tfor (int countSlim = 0; countSlim <= slim - i; countSlim++) {\n\t\t\t\tfor (int countFat = 0; countFat <= fat - j && countSlim + 2 * countFat <= k; countFat++) {\n\t\t\t\t\tif (countFat + countSlim > 0) {\n\t\t\t\t\t\tdelta = ((long)get(1, i + countSlim, j + countFat, n - 1) * (C[i + countSlim][countSlim])) % 1000000007;\n\t\t\t\t\t\tdelta = (delta * C[j + countFat][countFat]) % 1000000007;\n\t\t\t\t\t\td[boat][i][j][n] = (int)((d[boat][i][j][n] + delta) % 1000000007);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn d[boat][i][j][n] - 1;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tFastScanner in = new FastScanner(System.in);\n\t\tint n = in.nextInt();\n\t\tk = in.nextInt() / 50;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (in.nextInt() == 50) {\n\t\t\t\tslim++;\n\t\t\t} else {\n\t\t\t\tfat++;\n\t\t\t}\n\t\t}\n\t\tC = new int[Math.max(slim, fat) + 1][Math.max(slim, fat) + 1];\n\t\td = new int[2][slim + 1][fat + 1][n * n + 2];\n\t\tfor (int i = 0; i < Math.max(slim, fat) + 1; i++) {\n\t\t\tC[0][i] = 0;\n\t\t\tC[i][0] = 1;\n\t\t}\n\t\tfor (int i = 1; i < Math.max(slim, fat) + 1; i++) {\n\t\t\tfor (int j = 1; j < Math.max(slim, fat) + 1; j++) {\n\t\t\t\tC[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % 1000000007;\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < n * n + 2; i++) {\n\t\t\tif (get(1, slim, fat, i) != 0) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tSystem.out.println(get(1, slim, fat, i));\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(-1);\n\t\tSystem.out.println(0);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "f1d16eee78742346e245c97ca4055260", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.awt.*;\nimport java.io.*;\nimport java.math.BigDecimal;\nimport java.math.BigInteger;\nimport java.util.*;\nimport java.util.List;\n\nimport static java.lang.Math.max;\nimport static java.lang.Math.min;\n\n\npublic class C implements Runnable{\n\n // SOLUTION AT THE TOP OF CODE!!!\n // HACK ME PLEASE IF YOU CAN!!!\n // PLEASE!!!\n // PLEASE!!!\n // PLEASE!!!\n\n private final static boolean FIRST_INPUT_STRING = false;\n private final static boolean MULTIPLE_TESTS = true;\n private final boolean ONLINE_JUDGE = !new File(\"input.txt\").exists();\n// private final boolean ONLINE_JUDGE = System.getProperty(\"ONLINE_JUDGE\") != null;\n\n private final static int MAX_STACK_SIZE = 128;\n\n private final static boolean OPTIMIZE_READ_NUMBERS = false;\n\n /////////////////////////////////////////////////////////////////////\n\n private final static Random rnd = new Random();\n private final static String fileName = \"\";\n \n private final static long MODULO = 1000 * 1000 * 1000 + 7;\n\n // THERE SOLUTION STARTS!!!\n private void solve() {\n int n = readInt(), k = readInt();\n int[] a = readIntArray(n);\n\n Point answer = getAnswer(n, a, k);\n\n out.println(answer.x);\n out.println(answer.y);\n }\n\n private Point getAnswer(int n, int[] a, int limit) {\n final int MULTIPLIER = 50;\n\n limit /= MULTIPLIER;\n\n for (int i = 0; i < n; ++i) a[i] /= MULTIPLIER;\n\n int onesCount = 0, twosCount = 0;\n for (int v : a) {\n if (v == 1) ++onesCount;\n else ++twosCount;\n }\n\n long[][] c = new long[n + 1][n + 1];\n for (int i = 0; i <= n; ++i) {\n c[i][0] = c[i][i] = 1;\n for (int j = 1; j < i; ++j) {\n c[i][j] = add(c[i - 1][j - 1], c[i - 1][j]);\n }\n }\n\n final int FROM_SIDE = 0, TO_SIDE = 1;\n final int INF = Integer.MAX_VALUE / 3;\n\n int[][][] distances = new int[2][onesCount + 1][twosCount + 1];\n for (int[][] d2 : distances) for (int[] d1 : d2) Arrays.fill(d1, INF);\n\n long[][][] ways = new long[2][onesCount + 1][twosCount + 1];\n\n distances[FROM_SIDE][onesCount][twosCount] = 0;\n ways[FROM_SIDE][onesCount][twosCount] = 1;\n\n class Triple {\n int side, ones, twos;\n\n public Triple(int side, int ones, int twos) {\n this.side = side;\n this.ones = ones;\n this.twos = twos;\n }\n }\n\n Queue<Triple> q = new ArrayDeque<>();\n q.add(new Triple(FROM_SIDE, onesCount, twosCount));\n\n while (q.size() > 0) {\n Triple from = q.poll();\n\n int fromDistance = distances[from.side][from.ones][from.twos];\n long fromWays = ways[from.side][from.ones][from.twos];\n int fromNextDistance = fromDistance + 1;\n\n int nextSide = FROM_SIDE + TO_SIDE - from.side;\n\n if (from.side == FROM_SIDE) {\n for (int deltaOnes = 0; deltaOnes <= from.ones; ++deltaOnes) {\n for (int deltaTwos = 0; deltaTwos <= from.twos; ++deltaTwos) {\n if (deltaOnes + deltaTwos == 0) continue;\n if (deltaOnes + 2 * deltaTwos > limit) continue;\n\n int nextOnes = from.ones - deltaOnes;\n int nextTwos = from.twos - deltaTwos;\n\n int nextDistance = distances[nextSide][nextOnes][nextTwos];\n\n if (nextDistance < fromNextDistance) continue;\n\n long fromNextWays = mult(fromWays,\n mult(c[from.ones][deltaOnes], c[from.twos][deltaTwos])\n );\n\n if (nextDistance > fromNextDistance) {\n nextDistance = distances[nextSide][nextOnes][nextTwos] = fromNextDistance;\n q.add(new Triple(nextSide, nextOnes, nextTwos));\n }\n\n if (nextDistance == fromNextDistance) {\n ways[nextSide][nextOnes][nextTwos] = add(\n ways[nextSide][nextOnes][nextTwos],\n fromNextWays\n );\n }\n }\n }\n } else {\n int toOnes = onesCount - from.ones;\n int toTwos = twosCount - from.twos;\n\n for (int deltaOnes = 0; deltaOnes <= toOnes; ++deltaOnes) {\n for (int deltaTwos = 0; deltaTwos <= toTwos; ++deltaTwos) {\n if (deltaOnes + deltaTwos == 0) continue;\n if (deltaOnes + 2 * deltaTwos > limit) continue;\n\n int nextOnes = from.ones + deltaOnes;\n int nextTwos = from.twos + deltaTwos;\n\n int nextDistance = distances[nextSide][nextOnes][nextTwos];\n\n if (nextDistance < fromNextDistance) continue;\n\n long fromNextWays = mult(fromWays,\n mult(c[toOnes][deltaOnes], c[toTwos][deltaTwos])\n );\n\n if (nextDistance > fromNextDistance) {\n nextDistance = distances[nextSide][nextOnes][nextTwos] = fromNextDistance;\n q.add(new Triple(nextSide, nextOnes, nextTwos));\n }\n\n if (nextDistance == fromNextDistance) {\n ways[nextSide][nextOnes][nextTwos] = add(\n ways[nextSide][nextOnes][nextTwos],\n fromNextWays\n );\n }\n }\n }\n }\n }\n\n int distance = distances[TO_SIDE][0][0];\n if (INF == distance) {\n return new Point(-1, 0);\n } else {\n return new Point(distance, (int)ways[TO_SIDE][0][0]);\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n\n @SuppressWarnings(\"unused\")\n private static long inverse(long x) {\n return binpow(x, MODULO - 2);\n }\n\n private static long binpow(long base, long power) {\n if (power == 0) return 1;\n if ((power & 1) == 0) {\n long half = binpow(base, power >> 1);\n return mult(half, half);\n } else {\n long prev = binpow(base, power - 1);\n return mult(prev, base);\n }\n }\n\n private static long add(long a, long b) { return (a + b) % MODULO; }\n\n @SuppressWarnings(\"unused\")\n private static long subtract(long a, long b) { return add(a, MODULO - b % MODULO); }\n\n private static long mult(long a, long b) { return (a * b) % MODULO; }\n\n /////////////////////////////////////////////////////////////////////\n\n @SuppressWarnings(\"unused\")\n void yesNo(boolean yes) {\n out.println(yes ? \"YES\" : \"NO\");\n }\n\n /////////////////////////////////////////////////////////////////////\n\n public void run(){\n try{\n timeInit();\n Locale.setDefault(Locale.US);\n\n init();\n\n if (ONLINE_JUDGE) {\n solve();\n } else {\n do {\n try {\n timeInit();\n solve();\n time();\n\n out.println();\n out.flush();\n } catch (EOFException e) {\n break;\n } catch (NullPointerException e) {\n if (FIRST_INPUT_STRING) break;\n else throw e;\n }\n } while (MULTIPLE_TESTS);\n }\n\n out.close();\n time();\n }catch (Exception e){\n e.printStackTrace(System.err);\n System.exit(-1);\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private BufferedReader in;\n private OutputWriter out;\n private StringTokenizer tok = new StringTokenizer(\"\");\n\n public static void main(String[] args){\n new Thread(null, new C(), \"\", MAX_STACK_SIZE * (1L << 20)).start();\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private void init() throws FileNotFoundException{\n Locale.setDefault(Locale.US);\n\n if (ONLINE_JUDGE){\n if (fileName.isEmpty()) {\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new OutputWriter(System.out);\n } else {\n in = new BufferedReader(new FileReader(fileName + \".in\"));\n out = new OutputWriter(fileName + \".out\");\n }\n }else{\n in = new BufferedReader(new FileReader(\"input.txt\"));\n out = new OutputWriter(\"output.txt\");\n }\n }\n\n ////////////////////////////////////////////////////////////////\n\n private long timeBegin;\n\n private void timeInit() {\n this.timeBegin = System.currentTimeMillis();\n }\n\n private void time(){\n long timeEnd = System.currentTimeMillis();\n System.err.println(\"Time = \" + (timeEnd - timeBegin));\n }\n\n @SuppressWarnings(\"unused\")\n private void debug(Object... objects){\n if (ONLINE_JUDGE){\n for (Object o: objects){\n System.err.println(o.toString());\n }\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private String delim = \" \";\n\n private String readLine() {\n try {\n return in.readLine();\n } catch (IOException e) {\n throw new RuntimeIOException(e);\n }\n }\n\n private String readString() {\n while(!tok.hasMoreTokens()){\n String nextLine = readLine();\n if (null == nextLine) throw new EOFException();\n\n tok = new StringTokenizer(nextLine, delim);\n }\n\n return tok.nextToken(delim);\n }\n\n /////////////////////////////////////////////////////////////////\n\n private final char NOT_A_SYMBOL = '\\0';\n\n @SuppressWarnings(\"unused\")\n private char readChar() {\n try {\n int intValue = in.read();\n\n if (intValue == -1){\n return NOT_A_SYMBOL;\n }\n\n return (char) intValue;\n } catch (IOException e) {\n throw new RuntimeIOException(e);\n }\n }\n\n private char[] readCharArray() {\n return readLine().toCharArray();\n }\n\n @SuppressWarnings(\"unused\")\n private char[][] readCharField(int rowsCount) {\n char[][] field = new char[rowsCount][];\n for (int row = 0; row < rowsCount; ++row) {\n field[row] = readCharArray();\n }\n\n return field;\n }\n\n /////////////////////////////////////////////////////////////////\n\n private long optimizedReadLong() {\n int sign = 1;\n long result = 0;\n boolean started = false;\n while (true) {\n try {\n int j = in.read();\n if (-1 == j) {\n if (started) return sign * result;\n throw new NumberFormatException();\n }\n\n if (j == '-') {\n if (started) throw new NumberFormatException();\n sign = -sign;\n }\n\n if ('0' <= j && j <= '9') {\n result = result * 10 + j - '0';\n started = true;\n } else if (started) {\n return sign * result;\n }\n } catch (IOException e) {\n throw new RuntimeIOException(e);\n }\n }\n }\n\n private int readInt() {\n\n if (!OPTIMIZE_READ_NUMBERS) {\n return Integer.parseInt(readString());\n } else {\n return (int) optimizedReadLong();\n }\n }\n\n private int[] readIntArray(int size) {\n int[] array = new int[size];\n\n for (int index = 0; index < size; ++index){\n array[index] = readInt();\n }\n\n return array;\n }\n\n @SuppressWarnings(\"unused\")\n private int[] readSortedIntArray(int size) {\n Integer[] array = new Integer[size];\n\n for (int index = 0; index < size; ++index) {\n array[index] = readInt();\n }\n Arrays.sort(array);\n\n int[] sortedArray = new int[size];\n for (int index = 0; index < size; ++index) {\n sortedArray[index] = array[index];\n }\n\n return sortedArray;\n }\n\n private int[] readIntArrayWithDecrease(int size) {\n int[] array = readIntArray(size);\n\n for (int i = 0; i < size; ++i) {\n array[i]--;\n }\n\n return array;\n }\n\n ///////////////////////////////////////////////////////////////////\n\n @SuppressWarnings(\"unused\")\n private int[][] readIntMatrix(int rowsCount, int columnsCount) {\n int[][] matrix = new int[rowsCount][];\n\n for (int rowIndex = 0; rowIndex < rowsCount; ++rowIndex) {\n matrix[rowIndex] = readIntArray(columnsCount);\n }\n\n return matrix;\n }\n\n @SuppressWarnings(\"unused\")\n private int[][] readIntMatrixWithDecrease(int rowsCount, int columnsCount) {\n int[][] matrix = new int[rowsCount][];\n\n for (int rowIndex = 0; rowIndex < rowsCount; ++rowIndex) {\n matrix[rowIndex] = readIntArrayWithDecrease(columnsCount);\n }\n\n return matrix;\n }\n\n ///////////////////////////////////////////////////////////////////\n\n private long readLong() {\n if (!OPTIMIZE_READ_NUMBERS) {\n return Long.parseLong(readString());\n } else {\n return optimizedReadLong();\n }\n }\n\n @SuppressWarnings(\"unused\")\n private long[] readLongArray(int size) {\n long[] array = new long[size];\n\n for (int index = 0; index < size; ++index){\n array[index] = readLong();\n }\n\n return array;\n }\n\n ////////////////////////////////////////////////////////////////////\n\n private double readDouble() {\n return Double.parseDouble(readString());\n }\n\n @SuppressWarnings(\"unused\")\n private double[] readDoubleArray(int size) {\n double[] array = new double[size];\n\n for (int index = 0; index < size; ++index){\n array[index] = readDouble();\n }\n\n return array;\n }\n\n ////////////////////////////////////////////////////////////////////\n\n @SuppressWarnings(\"unused\")\n private BigInteger readBigInteger() {\n return new BigInteger(readString());\n }\n\n @SuppressWarnings(\"unused\")\n private BigDecimal readBigDecimal() {\n return new BigDecimal(readString());\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private Point readPoint() {\n int x = readInt();\n int y = readInt();\n return new Point(x, y);\n }\n\n @SuppressWarnings(\"unused\")\n private Point[] readPointArray(int size) {\n Point[] array = new Point[size];\n\n for (int index = 0; index < size; ++index){\n array[index] = readPoint();\n }\n\n return array;\n }\n\n /////////////////////////////////////////////////////////////////////\n\n @Deprecated\n @SuppressWarnings(\"unused\")\n private List<Integer>[] readGraph(int vertexNumber, int edgeNumber) {\n @SuppressWarnings(\"unchecked\")\n List<Integer>[] graph = new List[vertexNumber];\n\n for (int index = 0; index < vertexNumber; ++index){\n graph[index] = new ArrayList<>();\n }\n\n while (edgeNumber-- > 0){\n int from = readInt() - 1;\n int to = readInt() - 1;\n\n graph[from].add(to);\n graph[to].add(from);\n }\n\n return graph;\n }\n\n private static class GraphBuilder {\n\n final int size;\n final List<Integer>[] edges;\n\n static GraphBuilder createInstance(int size) {\n @SuppressWarnings(\"unchecked\")\n List<Integer>[] edges = new List[size];\n for (int v = 0; v < size; ++v) {\n edges[v] = new ArrayList<>();\n }\n\n return new GraphBuilder(edges);\n }\n\n private GraphBuilder(List<Integer>[] edges) {\n this.size = edges.length;\n this.edges = edges;\n }\n\n public void addEdge(int from, int to) {\n addDirectedEdge(from, to);\n addDirectedEdge(to, from);\n }\n\n public void addDirectedEdge(int from, int to) {\n edges[from].add(to);\n }\n\n public int[][] build() {\n int[][] graph = new int[size][];\n for (int v = 0; v < size; ++v) {\n List<Integer> vEdges = edges[v];\n graph[v] = castInt(vEdges);\n }\n\n return graph;\n }\n }\n\n @SuppressWarnings(\"unused\")\n private final static int ZERO_INDEXATION = 0, ONE_INDEXATION = 1;\n\n @SuppressWarnings(\"unused\")\n private int[][] readUnweightedGraph(int vertexNumber, int edgesNumber) {\n return readUnweightedGraph(vertexNumber, edgesNumber, ONE_INDEXATION, false);\n }\n\n private int[][] readUnweightedGraph(int vertexNumber, int edgesNumber,\n int indexation, boolean directed\n ) {\n GraphBuilder graphBuilder = GraphBuilder.createInstance(vertexNumber);\n for (int i = 0; i < edgesNumber; ++i) {\n int from = readInt() - indexation;\n int to = readInt() - indexation;\n\n if (directed) graphBuilder.addDirectedEdge(from, to);\n else graphBuilder.addEdge(from, to);\n }\n\n return graphBuilder.build();\n }\n\n private static class Edge {\n int to;\n int w;\n\n Edge(int to, int w) {\n this.to = to;\n this.w = w;\n }\n }\n\n @SuppressWarnings(\"unused\")\n private Edge[][] readWeightedGraph(int vertexNumber, int edgesNumber) {\n return readWeightedGraph(vertexNumber, edgesNumber, ONE_INDEXATION, false);\n }\n\n private Edge[][] readWeightedGraph(int vertexNumber, int edgesNumber,\n int indexation, boolean directed) {\n @SuppressWarnings(\"unchecked\")\n List<Edge>[] graph = new List[vertexNumber];\n for (int v = 0; v < vertexNumber; ++v) {\n graph[v] = new ArrayList<>();\n }\n\n while (edgesNumber --> 0) {\n int from = readInt() - indexation;\n int to = readInt() - indexation;\n int w = readInt();\n\n graph[from].add(new Edge(to, w));\n if (!directed) graph[to].add(new Edge(from, w));\n }\n\n Edge[][] graphArrays = new Edge[vertexNumber][];\n for (int v = 0; v < vertexNumber; ++v) {\n graphArrays[v] = graph[v].toArray(new Edge[0]);\n }\n\n return graphArrays;\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static class IntIndexPair {\n\n @SuppressWarnings(\"unused\")\n static Comparator<IntIndexPair> increaseComparator = (indexPair1, indexPair2) -> {\n int value1 = indexPair1.value;\n int value2 = indexPair2.value;\n\n if (value1 != value2) return value1 - value2;\n\n int index1 = indexPair1.index;\n int index2 = indexPair2.index;\n\n return index1 - index2;\n };\n\n @SuppressWarnings(\"unused\")\n static Comparator<IntIndexPair> decreaseComparator = (indexPair1, indexPair2) -> {\n int value1 = indexPair1.value;\n int value2 = indexPair2.value;\n\n if (value1 != value2) return -(value1 - value2);\n\n int index1 = indexPair1.index;\n int index2 = indexPair2.index;\n\n return index1 - index2;\n };\n\n @SuppressWarnings(\"unused\")\n static IntIndexPair[] from(int[] array) {\n IntIndexPair[] iip = new IntIndexPair[array.length];\n for (int i = 0; i < array.length; ++i) {\n iip[i] = new IntIndexPair(array[i], i);\n }\n\n return iip;\n }\n\n int value, index;\n\n IntIndexPair(int value, int index) {\n super();\n this.value = value;\n this.index = index;\n }\n\n @SuppressWarnings(\"unused\")\n int getRealIndex() {\n return index + 1;\n }\n }\n\n @SuppressWarnings(\"unused\")\n private IntIndexPair[] readIntIndexArray(int size) {\n IntIndexPair[] array = new IntIndexPair[size];\n\n for (int index = 0; index < size; ++index) {\n array[index] = new IntIndexPair(readInt(), index);\n }\n\n return array;\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static class OutputWriter extends PrintWriter {\n\n final int DEFAULT_PRECISION = 12;\n\n private int precision;\n private String format, formatWithSpace;\n\n {\n precision = DEFAULT_PRECISION;\n\n format = createFormat(precision);\n formatWithSpace = format + \" \";\n }\n\n OutputWriter(OutputStream out) {\n super(out);\n }\n\n OutputWriter(String fileName) throws FileNotFoundException {\n super(fileName);\n }\n\n int getPrecision() {\n return precision;\n }\n\n void setPrecision(int precision) {\n precision = max(0, precision);\n this.precision = precision;\n\n format = createFormat(precision);\n formatWithSpace = format + \" \";\n }\n\n String createFormat(int precision){\n return \"%.\" + precision + \"f\";\n }\n\n @Override\n public void print(double d){\n printf(format, d);\n }\n \n @Override\n public void println(double d){\n print(d);\n println();\n }\n\n void printWithSpace(double d){\n printf(formatWithSpace, d);\n }\n\n void printAll(double...d){\n for (int i = 0; i < d.length - 1; ++i){\n printWithSpace(d[i]);\n }\n\n print(d[d.length - 1]);\n }\n\n @SuppressWarnings(\"unused\")\n void printlnAll(double... d){\n printAll(d);\n println();\n }\n \n void printAll(int... array) {\n \tfor (int value : array) {\n \t\tprint(value + \" \");\n \t}\n }\n\n @SuppressWarnings(\"unused\")\n void printlnAll(int... array) {\n \tprintAll(array);\n \tprintln();\n }\n \n void printAll(long... array) {\n \tfor (long value : array) {\n \t\tprint(value + \" \");\n \t}\n }\n\n @SuppressWarnings(\"unused\")\n void printlnAll(long... array) {\n \tprintAll(array);\n \tprintln();\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static class EOFException extends RuntimeException {\n\n EOFException() {\n super();\n }\n }\n\n private static class RuntimeIOException extends RuntimeException {\n\n /**\n *\n */\n private static final long serialVersionUID = -6463830523020118289L;\n\n RuntimeIOException(Throwable cause) {\n super(cause);\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n //////////////// Some useful constants andTo functions ////////////////\n /////////////////////////////////////////////////////////////////////\n\n private static void swap(int[] array, int i, int j) {\n if (i != j) {\n int tmp = array[i];\n array[i] = array[j];\n array[j] = tmp;\n }\n }\n\n private static final int[][] steps = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};\n private static final int[][] steps8 = {\n {-1, 0}, {1, 0}, {0, -1}, {0, 1},\n {-1, -1}, {1, 1}, {1, -1}, {-1, 1}\n };\n\n @SuppressWarnings(\"unused\")\n private static boolean checkCell(int row, int rowsCount, int column, int columnsCount) {\n return checkIndex(row, rowsCount) && checkIndex(column, columnsCount);\n }\n\n private static boolean checkIndex(int index, int lim){\n return (0 <= index && index < lim);\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static int getBit(long mask, int bit) { return (int)((mask >> bit) & 1); }\n\n @SuppressWarnings(\"unused\")\n private static boolean checkBit(long mask, int bit){\n return getBit(mask, bit) != 0;\n }\n\n /////////////////////////////////////////////////////////////////////\n\n @SuppressWarnings(\"unused\")\n private static long getSum(int[] array) {\n long sum = 0;\n for (int value: array) {\n sum += value;\n }\n\n return sum;\n }\n\n @SuppressWarnings(\"unused\")\n private static Point getMinMax(int[] array) {\n int min = array[0];\n int max = array[0];\n\n for (int index = 0, size = array.length; index < size; ++index, ++index) {\n int value = array[index];\n\n if (index == size - 1) {\n min = min(min, value);\n max = max(max, value);\n } else {\n int otherValue = array[index + 1];\n\n if (value <= otherValue) {\n min = min(min, value);\n max = max(max, otherValue);\n } else {\n min = min(min, otherValue);\n max = max(max, value);\n }\n }\n }\n\n return new Point(min, max);\n }\n\n /////////////////////////////////////////////////////////////////////\n\n @SuppressWarnings(\"unused\")\n private static boolean isPrime(int x) {\n if (x < 2) return false;\n for (int d = 2; d * d <= x; ++d) {\n if (x % d == 0) return false;\n }\n\n return true;\n }\n\n @SuppressWarnings(\"unused\")\n private static int[] getPrimes(int n) {\n boolean[] used = new boolean[n];\n used[0] = used[1] = true;\n\n int size = 0;\n for (int i = 2; i < n; ++i) {\n if (!used[i]) {\n ++size;\n for (int j = 2 * i; j < n; j += i) {\n used[j] = true;\n }\n }\n }\n\n int[] primes = new int[size];\n for (int i = 0, cur = 0; i < n; ++i) {\n if (!used[i]) {\n primes[cur++] = i;\n }\n }\n\n return primes;\n }\n\n /////////////////////////////////////////////////////////////////////\n\n @SuppressWarnings(\"unused\")\n int[] getDivisors(int value) {\n List<Integer> divisors = new ArrayList<>();\n for (int divisor = 1; divisor * divisor <= value; ++divisor) {\n if (value % divisor == 0) {\n divisors.add(divisor);\n if (divisor * divisor != value) {\n divisors.add(value / divisor);\n }\n }\n }\n\n return castInt(divisors);\n }\n\n @SuppressWarnings(\"unused\")\n long[] getDivisors(long value) {\n List<Long> divisors = new ArrayList<>();\n for (long divisor = 1; divisor * divisor <= value; ++divisor) {\n if (value % divisor == 0) {\n divisors.add(divisor);\n if (divisor * divisor != value) {\n divisors.add(value / divisor);\n }\n }\n }\n\n return castLong(divisors);\n }\n\n /////////////////////////////////////////////////////////////////////\n\n @SuppressWarnings(\"unused\")\n private static long lcm(long a, long b) {\n return a / gcd(a, b) * b;\n }\n\n private static long gcd(long a, long b) {\n return (a == 0 ? b : gcd(b % a, a));\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static int[] castInt(List<Integer> list) {\n int[] array = new int[list.size()];\n for (int i = 0; i < array.length; ++i) {\n array[i] = list.get(i);\n }\n\n return array;\n }\n\n @SuppressWarnings(\"unused\")\n private static long[] castLong(List<Long> list) {\n long[] array = new long[list.size()];\n for (int i = 0; i < array.length; ++i) {\n array[i] = list.get(i);\n }\n\n return array;\n }\n\n /////////////////////////////////////////////////////////////////////\n\n /**\n * Generates list with keys 0..<n\n * @param n - exclusive limit of sequence\n */\n @SuppressWarnings(\"unused\")\n private static List<Integer> order(int n) {\n List<Integer> sequence = new ArrayList<>();\n for (int i = 0; i < n; ++i) {\n sequence.add(i);\n }\n\n return sequence;\n }\n}", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "d8836f717ed1f7c8b1eebc596ea72555", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class cf295c {\n static int ones = 0, twos = 0, MAX = 40000;\n static long mod = 1_000_000_007, oo = 987654321;\n public static void main(String[] args) {\n long[][] pasc = new long[150][150];\n for(int i=0; i<150; i++) {\n pasc[i][0] = 1;\n for(int j=1; j<=i; j++)\n pasc[i][j] = (pasc[i-1][j] + pasc[i-1][j-1])%mod;\n }\n FastIO in = new FastIO(), out = in;\n int n = in.nextInt();\n int k = in.nextInt()/50;\n for(int i=0; i<n; i++)\n if(in.nextInt()==50) ones++;\n else twos++;\n int[] start = {0,ones,0,twos,0};\n int[] end = {1,0,ones,0,twos};\n int src = compressState(start);\n long[] dist = new long[MAX];\n long[] dp = new long[MAX];\n Arrays.fill(dist,oo);\n dist[src] = 0;\n dp[src] = 1;\n ArrayDeque<Integer> q = new ArrayDeque<Integer>();\n q.add(src);\n while(!q.isEmpty()) {\n int[] curState = getState(q.poll());\n int cur = compressState(curState);\n if(curState[0] == 0) {\n for(int i=0; i<=curState[1]; i++)\n for(int j=0; j<=curState[3]; j++) {\n if(i+j == 0) continue;\n if(i+2*j > k) continue;\n int[] nextState = new int[]{1-curState[0], curState[1]-i, curState[2]+i, curState[3]-j, curState[4]+j};\n int next = compressState(nextState);\n if(dist[next] > dist[cur] + 1) {\n dist[next] = dist[cur]+1;\n q.add(next);\n dp[next] = 0;\n }\n if(dist[next] == dist[cur]+1) {\n dp[next] = (dp[next] + dp[cur]*((pasc[curState[1]][i]*pasc[curState[3]][j])%mod))%mod;\n }\n }\n }\n else {\n for(int i=0; i<=curState[2]; i++)\n for(int j=0; j<=curState[4]; j++) {\n if(i+j == 0) continue;\n if(i+2*j > k) continue;\n int[] nextState = new int[]{1-curState[0], curState[1]+i, curState[2]-i, curState[3]+j, curState[4]-j};\n int next = compressState(nextState);\n if(dist[next] > dist[cur] + 1) {\n dist[next] = dist[cur]+1;\n q.add(next);\n dp[next] = 0;\n }\n if(dist[next] == dist[cur]+1) {\n dp[next] = (dp[next] + dp[cur]*((pasc[curState[2]][i]*pasc[curState[4]][j])%mod))%mod;\n }\n }\n }\n }\n int dest = compressState(end);\n if(dist[dest] >= oo) dist[dest] = -1;\n out.println(dist[dest]);\n out.println(dp[dest]);\n out.close();\n }\n static int[] getState(int state) {\n return new int[]{state/10000, (state%10000)/100, ones-(state%10000)/100, state%100, twos-state%100};\n }\n static int compressState(int[] state) {\n return state[0]*100*100+state[1]*100+state[3];\n }\n\n static class FastIO extends PrintWriter {\n BufferedReader br;\n StringTokenizer st;\n\n public FastIO() {\n this(System.in, System.out);\n }\n\n public FastIO(InputStream in, OutputStream out) {\n super(new BufferedWriter(new OutputStreamWriter(out)));\n br = new BufferedReader(new InputStreamReader(in));\n scanLine();\n }\n\n public void scanLine() {\n try {\n st = new StringTokenizer(br.readLine().trim());\n } catch (Exception e) {\n throw new RuntimeException(e.getMessage());\n }\n }\n\n public int numTokens() {\n if (!st.hasMoreTokens()) {\n scanLine();\n return numTokens();\n }\n return st.countTokens();\n }\n\n public String next() {\n if (!st.hasMoreTokens()) {\n scanLine();\n return next();\n }\n return st.nextToken();\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "db44661fecf6c2e3d2a29ece32ec06fa", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\npublic class c {\n\tstatic long mod = (long)1e9+7;\n\tstatic int small, big;\npublic static void main(String[] args)\n{\n\tint[][] cs = comb(101);\n\tScanner input = new Scanner(System.in);\n\tint n = input.nextInt(), k = input.nextInt();\n\tsmall = big = 0;\n\tfor(int i = 0; i<n; i++)\n\t{\n\t\tif(input.nextInt() == 50) small++;\n\t\telse big++;\n\t}\n\tint[][][] ds = new int[2][small+1][big+1];\n\tfor(int[][] A : ds)\n\t\tfor(int[] B : A)\n\t\t\tArrays.fill(B, 987654321);\n\tlong[][][] ways = new long[2][small+1][big+1];\n\tds[0][small][big] = 0;\n\tways[0][small][big] = 1;\n\tQueue<Integer> q = new LinkedList<Integer>();\n\tq.add(0);\n\tq.add(small);\n\tq.add(big);\n\twhile(!q.isEmpty())\n\t{\n\t\tint side = q.poll();\n\t\tint a = q.poll();\n\t\tint b = q.poll();\n\t\tint d = ds[side][a][b];\n\t\tlong w = ways[side][a][b];\n\t\tint maxa = a, maxb = b;\n\t\tif(side == 1)\n\t\t{\n\t\t\tmaxa = small - a;\n\t\t\tmaxb = big - b;\n\t\t}\n\t\tfor(int i = 0; i<=maxa; i++)\n\t\t\tfor(int j = 0; j<=maxb; j++)\n\t\t\t{\n\t\t\t\tif(i*50 + j*100 > k) break;\n\t\t\t\tif(i == 0 && j == 0) continue;\n\t\t\t\tint ns = 1 - side;\n\t\t\t\tint na = a + i * (side == 1 ? 1 : -1);\n\t\t\t\tint nb = b + j * (side == 1 ? 1 : -1);\n\t\t\t\tlong edgeWays = ((long)cs[maxa][i] * cs[maxb][j])%mod;\n\t\t\t\t//System.out.println(side+\" \"+a+\" \"+b+\" \"+ns+\" \"+na+\" \"+nb);\n\t\t\t\tif(1+d < ds[ns][na][nb])\n\t\t\t\t{\n\t\t\t\t\tds[ns][na][nb] = 1 + d;\n\t\t\t\t\tways[ns][na][nb] = (w * edgeWays)%mod;\n\t\t\t\t\tq.add(ns);\n\t\t\t\t\tq.add(na);\n\t\t\t\t\tq.add(nb);\n\t\t\t\t}\n\t\t\t\telse if(1+d == ds[ns][na][nb])\n\t\t\t\t{\n\t\t\t\t\tways[ns][na][nb] += (w*edgeWays)%mod;\n\t\t\t\t\tif(ways[ns][na][nb] >= mod) ways[ns][na][nb] -= mod;\n\t\t\t\t}\n\t\t\t}\n\t}\n\tif(ds[1][0][0] > 1e8)\n\t\tds[1][0][0] = -1;\n\tSystem.out.println(ds[1][0][0]);\n\tSystem.out.println(ways[1][0][0]);\n\t\n}\npublic static int[][] comb(int n)\n{\n\tint[][] comb = new int[n+1][n+1];\n\tfor(int i = 0; i<= n; i++)\n\t\tcomb[i][0] = 1;\n\tfor(int i = 1; i<= n; i++)\n\t\tfor(int j = 1; j<= i; j++)\n\t\t\tcomb[i][j] = (comb[i-1][j] + comb[i-1][j-1])%(int)(mod);\n\treturn comb;\n}\n}\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "9ed93595af50e22fdae841a58ba25463", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package a2oj;\nimport java.util.*;\n\npublic class GregAndFriends {\n\tstatic int n, k, a = 0, b = 0;\n\tstatic long MOD = 1000000007, ans = 0;\n\tstatic long[][] choose = new long[100][100];\n\tstatic LinkedList<Integer> q = new LinkedList<Integer>();\n\tstatic HashMap<Integer, Pair> ways = new HashMap<Integer, Pair>();\n\tstatic class Pair {\n\t\tint d;\n\t\tlong w;\n\t\tpublic Pair(int D, long W) {\n\t\t\td = D;\n\t\t\tw = W;\n\t\t}\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tn = sc.nextInt();\n\t\tk = sc.nextInt();\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tif(sc.nextInt() == 50)\n\t\t\t\ta++;\n\t\t\telse\n\t\t\t\tb++;\n\t\tsc.close();\n\t\tfillChoose();\n\t\tint startMask = 1000000 + 100 * a + b;\n\t\tq.add(startMask);\n\t\tways.put(startMask, new Pair(0, 1));\n\t\twhile(!q.isEmpty())\n\t\t\tbfs(q.pollFirst());\n\t\tSystem.out.println(ways.containsKey(0) ? ways.get(0).d + \"\\n\" + ways.get(0).w : \"-1\\n0\");\n\t}\n\tstatic void bfs(int mask) {\n\t\tint boat = mask / 1000000;\n\t\tint nA = (mask % 1000000) / 100, nB = mask % 100;\n\t\tif(boat > 0) {\n\t\t\tfor(int i = nA; i >= 0 && 50 * (nA - i) <= k; i--)\n\t\t\t\tfor(int j = nB; j >= 0 && 50 * (nA - i) + 100 * (nB - j) <= k; j--)\n\t\t\t\t\tif(i != nA || j != nB)\n\t\t\t\t\t\tresolve(i, j, boat, mask, choose[nA][i] * choose[nB][j] % MOD);\n\t\t} else {\n\t\t\tfor(int i = nA; i <= a && 50 * (i - nA) <= k; i++)\n\t\t\t\tfor(int j = nB; j <= b && 50 * (i - nA) + 100 * (j - nB) <= k; j++)\n\t\t\t\t\tif(i != nA || j != nB)\n\t\t\t\t\t\tresolve(i, j, boat, mask, choose[a - nA][i - nA] * choose[b - nB][j - nB] % MOD);\n\t\t}\n\t}\n\tstatic void resolve(int i, int j, int boat, int mask, long edgeWays) {\n\t\tint newMask = 1000000 * (1 - boat) + i * 100 + j;\n\t\tint newD = ways.get(mask).d + 1;\n\t\tif(!ways.containsKey(newMask)) {\n\t\t\tways.put(newMask, new Pair(newD, 0));\n\t\t\tq.add(newMask);\n\t\t}\n\t\tif(ways.get(newMask).d == newD)\n\t\t\tways.get(newMask).w = (ways.get(newMask).w + ways.get(mask).w * edgeWays % MOD) % MOD;\n\t}\n\tstatic void fillChoose() {\n\t\tfor(int i = 0; i < 100; i++)\n\t\t\tchoose[i][0] = 1;\n\t\tfor(int i = 1; i < 100; i++)\n\t\t\tfor(int j = 1; j <= i; j++)\n\t\t\t\tchoose[i][j] = (choose[i - 1][j - 1] + choose[i - 1][j]) % MOD;\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "aa3543012fe992c83841a2e2b99abaaf", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\npublic class C {\n\tstatic int mod = 1000000007;\n\n\tstatic class State implements Comparable<State> {\n\t\tint fiftyCnt, hundertCnt, where;\n\t\tint steps;\n\t\tlong ways;\n\n\t\tpublic State(int f, int h, int w, int s, long way) {\n\t\t\tfiftyCnt = f;\n\t\t\thundertCnt = h;\n\t\t\twhere = w;\n\t\t\tsteps = s;\n\t\t\tways = way;\n\t\t}\n\n\t\tpublic int compareTo(State s) {\n\t\t\treturn new Integer(steps).compareTo(new Integer(s.steps));\n\t\t}\n\t}\n\n\tstatic long[][] dp;\n\tstatic long[][][][] cache;\n\tstatic int boatWeight, fiftyCnt, hundretCnt;\n\n\tpublic static long solve(int fifty, int hundert, int where, int rem) {\n\t\tif (rem == 0) {\n\t\t\tif (where == 1 && fifty == 0 && hundert == 0) {\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\t\tif (cache[fifty][hundert][where][rem] != -1)\n\t\t\treturn cache[fifty][hundert][where][rem];\n\t\tlong res = 0;\n\t\tif (where == 0) {\n\t\t\tint maxFifty = boatWeight / 50;\n\t\t\tfor (int i = 0; i <= Math.min(maxFifty, fifty); i++) {\n\t\t\t\tint maxHundret = (boatWeight - i * 50) / 100;\n\t\t\t\tint fiftyTaken = i;\n\t\t\t\tfor (int j = 0; j <= Math.min(maxHundret, hundert); j++) {\n\t\t\t\t\tint hundretTaken = j;\n\t\t\t\t\tif (fiftyTaken + hundretTaken == 0)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tres = (res + ((((solve(fifty - fiftyTaken, hundert\n\t\t\t\t\t\t\t- hundretTaken, 1, rem - 1) * combin(fifty,\n\t\t\t\t\t\t\tfiftyTaken)) % mod) * combin(hundert, hundretTaken)) % mod))\n\t\t\t\t\t\t\t% mod;\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tint maxFifty = boatWeight / 50;\n\t\t\tint fiftyHere = fiftyCnt - fifty;\n\t\t\tint hundretHere = hundretCnt - hundert;\n\t\t\tfor (int i = 0; i <= Math.min(maxFifty, fiftyHere); i++) {\n\t\t\t\tint maxHundret = (boatWeight - i * 50) / 100;\n\t\t\t\tint fiftyTaken = i;\n\t\t\t\tfor (int j = 0; j <= Math.min(maxHundret, hundretHere); j++) {\n\t\t\t\t\tint hundretTaken = j;\n\t\t\t\t\tif (fiftyTaken + hundretTaken == 0)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tres = (res + ((((solve(fifty + fiftyTaken, hundert\n\t\t\t\t\t\t\t+ hundretTaken, 0, rem - 1) * combin(fiftyHere,\n\t\t\t\t\t\t\tfiftyTaken)) % mod) * combin(hundretHere,\n\t\t\t\t\t\t\thundretTaken)) % mod))\n\t\t\t\t\t\t\t% mod;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn cache[fifty][hundert][where][rem] = res;\n\t}\n\n\tpublic static long combin(int n, int k) {\n\t\tif (n < k)\n\t\t\treturn 0;\n\t\tif (k == 0)\n\t\t\treturn 1;\n\t\tif (n == k)\n\t\t\treturn 1;\n\t\tif (dp[n][k] != -1)\n\t\t\treturn dp[n][k];\n\t\treturn dp[n][k] = (combin(n - 1, k) + combin(n - 1, k - 1)) % mod;\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tint peopleCnt = nextInt();\n\t\tboatWeight = nextInt();\n\t\tfiftyCnt = 0;\n\t\thundretCnt = 0;\n\t\tfor (int i = 0; i < peopleCnt; i++) {\n\t\t\tif (nextInt() == 50) {\n\t\t\t\tfiftyCnt++;\n\t\t\t} else {\n\t\t\t\thundretCnt++;\n\t\t\t}\n\t\t}\n\t\tdp = new long[Math.max(fiftyCnt, hundretCnt) + 1][Math.max(fiftyCnt,\n\t\t\t\thundretCnt) + 1];\n\t\tfor (int i = 0; i < dp.length; i++) {\n\t\t\tArrays.fill(dp[i], -1);\n\t\t}\n\t\tint maxSteps = 1000;\n\t\tcache = new long[fiftyCnt + 1][hundretCnt + 1][2][maxSteps + 1];\n\t\tfor (int i = 0; i <= fiftyCnt; i++) {\n\t\t\tfor (int j = 0; j <= hundretCnt; j++) {\n\t\t\t\tfor (int k = 0; k < 2; k++) {\n\t\t\t\t\tArrays.fill(cache[i][j][k], -1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int i = 1; i <= maxSteps; i++) {\n\t\t\tlong tmp = solve(fiftyCnt, hundretCnt, 0, i);\n\t\t\tif (tmp != 0) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tSystem.out.println(tmp);\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(-1);\n\t\tSystem.out.println(0);\n\t}\n\n\tstatic BufferedReader br = new BufferedReader(new InputStreamReader(\n\t\t\tSystem.in));\n\tstatic StringTokenizer st = new StringTokenizer(\"\");\n\n\tstatic int nextInt() throws Exception {\n\t\treturn Integer.parseInt(next());\n\t}\n\n\tstatic String next() throws Exception {\n\t\twhile (true) {\n\t\t\tif (st.hasMoreTokens()) {\n\t\t\t\treturn st.nextToken();\n\t\t\t}\n\t\t\tString s = br.readLine();\n\t\t\tif (s == null) {\n\t\t\t\treturn null;\n\t\t\t}\n\t\t\tst = new StringTokenizer(s);\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "5826d175bee3b781184bafac7a87b924", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\nimport java.math.*;\nimport java.io.*;\n\n\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\nimport static java.util.Collections.*;\n\npublic class test{\n\t\n\t// ArrayList<Integer> lis = new ArrayList<Integer>();\n\t// ArrayList<String> lis = new ArrayList<String>();\n\t// PriorityQueue<P> que = new PriorityQueue<P>();\n\t// PriorityQueue<Integer> que = new PriorityQueue<Integer>();\n\t// Stack<Integer> que = new Stack<Integer>();\n //\tstatic long sum=0;\n\t// 1000000007 (10^9+7)\n\tstatic int mod = 1000000007;\n\t//static int mod = 1000000009,r=0;\n // static int dx[]={1,-1,0,0};\n//\tstatic int dy[]={0,0,1,-1};\n//\tstatic int dx[]={1,-1,0,0,1,1,-1,-1};\n// static int dy[]={0,0,1,-1,1,-1,1,-1};\n\t//static long H,L;\n\t//static Set<Integer> set = new HashSet<Integer>();\n\t\npublic static void main(String[] args) throws Exception, IOException{\n //String line=\"\"; throws Exception, IOException\n //(line=br.readLine())!=null\n\t//Scanner sc =new Scanner(System.in);\n\t// !!caution!! int long // \n\tReader sc = new Reader(System.in);\n // while( ){\n\t // int n=sc.nextInt(),m=sc.nextInt();//a[]=new int[n],b[]=new int[n];\n\tint n=sc.nextInt(),k=sc.nextInt();\n\t//int x[]=new int[n];\n\tint f=0,h=0,c=0;\n\t\n \n \n\tfor(int i=0;i<n;i++){\n int a=sc.nextInt();\n\t\tif( a==50 )f++;else h++;\n\t}\n\tlong b[][][]=new long[2][f+1][h+1]; \n\t//for(int i=0;i<=f;i++)for(int t=0;t<=h;t++)b[0][i][t][0]=b[1][i][t][0]=1000;\n b[0][f][h]++;\n\twhile(true){\n\t \n\t for(int i=0;i<=f;i++)for(int t=0;t<=h;t++){\n\t\t\n\t\t if( b[c%2][i][t]<1 )continue;\n\t\t// db(c,i,t);\n\t\t for(int w=0;w<=i;w++)for(int q=0;q<=t;q++){\n\t\t\t if( k<w*50+q*100 )continue;\n\t\t\t if( w==0 && q==0 )continue;\n\t\t\t b[(c+1)%2][w+f-i][q+h-t]+= (b[c%2][i][t]*(com(i,w)*com(t,q))%mod)%mod ;\n\t\t\t b[(c+1)%2][w+f-i][q+h-t]%=mod;\n\t\t }\n\t\t \n\t }\n\t for(int i=0;i<=f;i++)for(int t=0;t<=h;t++)b[c%2][i][t]=0;\n\t c++;\n\t db(c);\n\t if(0<b[1][f][h])break;\n\t if( 210<c )break;\n\t}\n\t\n\t\n\t\n\t\n\tSystem.out.println(b[1][f][h]==0? -1:c);\n\tSystem.out.println(b[1][f][h]);\n\t\n\t//System.out.println();\n\t\n \n}\n\n\nstatic void db(Object... os){\n System.err.println(Arrays.deepToString(os));\n\n}\n\nstatic long com( int n, int m ) {//beware! n<m\n if( n < m || m < 0 ) {\n throw new IllegalArgumentException( \"invalid parameter ( n : \" + n + \", m : \" + m + \")\" );\n }\n long c = 1;\n m = ( n - m < m ? n - m : m );\n for( int ns = n - m + 1, ms = 1; ms <= m; ns ++, ms ++ ) {\n c *= ns;\n c /= ms;\n }\n return c;\n}\n\n}\n\nclass Reader\n{\n\tprivate BufferedReader x;\n\tprivate StringTokenizer st;\n\t\n\tpublic Reader(InputStream in)\n\t{\n\t\tx = new BufferedReader(new InputStreamReader(in));\n\t\tst = null;\n\t}\n\tpublic String nextString() throws IOException\n\t{\n\t\twhile( st==null || !st.hasMoreTokens() )\n\t\t\tst = new StringTokenizer(x.readLine());\n\t\treturn st.nextToken();\n\t}\n\tpublic int nextInt() throws IOException\n\t{\n\t\treturn Integer.parseInt(nextString());\n\t}\n\tpublic long nextLong() throws IOException\n\t{\n\t\treturn Long.parseLong(nextString());\n\t}\n\tpublic double nextDouble() throws IOException\n\t{\n\t\treturn Double.parseDouble(nextString());\n\t}\n}\n\n\n\nclass P {\n\tint x,y,z,c;\n\tlong a;\n\tP(int x,int y,int z,int c,long a){this.c=c; this.a=a; this.x=x; this.y=y;this.z=z; }\n\t\n\t\n}\n//*/\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "5cae806a02d61106c2b8bfedb0291fc7", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class C implements Runnable{\n\tpublic static void main (String[] args) {new Thread(null, new C(), \"_cf\", 1 << 28).start();}\n\n\tint[] fact;\n\tint n50, n100;\n\tint n, k, MOD = (int)1e9+7, oo = (int)2e9;\n\n\tpublic void run() {\n\t\tFastScanner fs = new FastScanner();\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tSystem.err.println(\"Go!\");\n\n\t\tfact = new int[100];\n\t\tfact[0] = fact[1] = 1;\n\t\tfor(int i = 2; i < fact.length; i++)\n\t\t\tfact[i] = mult(fact[i-1], i);\n\t\tint[][] nCk = new int[100][100];\n\t\tfor(int i = 0; i < nCk.length; i++) {\n\t\t\tfor(int j = 0; j <= i; j++) {\n\t\t\t\tnCk[i][j] = nCk(i, j);\n\t\t\t}\n\t\t}\n\n\t\tn = fs.nextInt();\n\t\tk = fs.nextInt();\n\t\tint n50 = 0, n100 = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tint x = fs.nextInt();\n\t\t\tif(x == 50) n50++;\n\t\t\telse n100++;\n\t\t}\n\t\tthis.n50 = n50;\n\t\tthis.n100 = n100;\n\n\t\tint[][][] dist = new int[2][n50+1][n100+1];\n\t\tint[][][] ways = new int[2][n50+1][n100+1];\n\t\tfor(int[][] d : dist)\n\t\t\tfor(int[] dd : d)\n\t\t\t\tArrays.fill(dd, oo);\n\t\tdist[0][n50][n100] = 0;\n\t\tways[0][n50][n100] = 1;\n\t\tArrayDeque<Node> bfs = new ArrayDeque<>();\n\t\tbfs.add(new Node(n50, n100, 0, 0));\n\t\twhile(!bfs.isEmpty()) {\n\t\t\tNode now = bfs.pollFirst();\n//\t\t\tSystem.out.println(now);\n\t\t\tint nn50 = n50 - now.n50;\n\t\t\tint nn100 = n100 - now.n100;\n\t\t\tfor(int i = 0; i <= now.n50; i++) {\n\t\t\t\tfor(int j = 0; j <= now.n100; j++) {\n\t\t\t\t\tif(i + j == 0) continue;\n\t\t\t\t\tif(i*50 + j*100 > k) continue;\n\t\t\t\t\tint ndist = 1 + dist[now.side][now.n50][now.n100];\n\t\t\t\t\tint x = dist[now.side^1][nn50+i][nn100+j];\n\t\t\t\t\tint tf = mult(ways[now.side][now.n50][now.n100], mult(nCk[now.n50][i], nCk[now.n100][j]));\n\t\t\t\t\t\n\t\t\t\t\tif(x > ndist) {\n\t\t\t\t\t\tdist[now.side^1][nn50+i][nn100+j] = ndist;\n\t\t\t\t\t\tways[now.side^1][nn50+i][nn100+j] = tf;\n\t\t\t\t\t\tbfs.add(new Node(nn50+i, nn100+j, now.side^1, ndist));\n\t\t\t\t\t}\n\t\t\t\t\telse if(x == ndist) {\n\t\t\t\t\t\tways[now.side^1][nn50+i][nn100+j] = add(ways[now.side^1][nn50+i][nn100+j], tf);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tint res = dist[1][n50][n100];\n\t\tint way = ways[1][n50][n100];\n\t\tif(res == oo) { res = -1; way = 0; }\n\t\tout.printf(\"%d\\n%d\\n\", res, way);\n\t\t\n\t\tout.close();\n\t}\n\n\tint add(long a, long b) {\n\t\ta %= MOD;\n\t\tb %= MOD;\n\t\ta += b;\n\t\ta %= MOD;\n\t\treturn (int)a;\n\t}\n\n\tint nCk(int n, int k) {\n\t\tint num = fact[n];\n\t\tint den = mult(fact[k], fact[n-k]);\n\t\tint inv = inv(den);\n\t\treturn mult(num, inv);\n\t}\n\n\tint inv(long x) {\n\t\tlong res = power(x, MOD - 2, MOD);\n\t\twhile(res < 0) res += MOD;\n\t\treturn (int)res;\n\t}\n\n\tint mult(long a, long b) {\n\t\ta %= MOD;\n\t\tb %= MOD;\n\t\ta *= b;\n\t\ta %= MOD;\n\t\treturn (int)a;\n\t}\n\n\tlong power (long x, long y, long m) {\n\t\tlong res = 1;\n\t\tx %= m;\n\t\twhile(y > 0) {\n\t\t\tif(y % 2 == 1) {\n\t\t\t\tres = (res * x) % m;\n\t\t\t}\n\t\t\ty >>= 1L;\n\t\t\t\t\t\tx = (x * x) % m;\n\t\t}\n\t\treturn res;\n\t}\n\t\n\tclass Node implements Comparable<Node> {\n\t\tint n50, n100, side, dist;\n\t\tNode(int a, int b, int c, int d) {\n\t\t\tn50 = a; n100 = b;\n\t\t\tside = c; dist = d;\n\t\t}\n\t\tpublic String toString() {\n\t\t\treturn String.format(\"(%d, %d) %d %d\", n50, n100, side, dist);\n\t\t}\n\t\tpublic int compareTo(Node n) {\n\t\t\treturn Integer.compare(dist, n.dist);\n\t\t}\n\t}\n\n\tclass FastScanner {\n\t\tpublic int BS = 1<<16;\n\t\tpublic char NC = (char)0;\n\t\tbyte[] buf = new byte[BS];\n\t\tint bId = 0, size = 0;\n\t\tchar c = NC;\n\t\tdouble num = 1;\n\t\tBufferedInputStream in;\n\n\t\tpublic FastScanner() {\n\t\t\tin = new BufferedInputStream(System.in, BS);\n\t\t}\n\n\t\tpublic FastScanner(String s) throws FileNotFoundException {\n\t\t\tin = new BufferedInputStream(new FileInputStream(new File(s)), BS);\n\t\t}\n\n\t\tpublic char nextChar(){\n\t\t\twhile(bId==size) {\n\t\t\t\ttry {\n\t\t\t\t\tsize = in.read(buf);\n\t\t\t\t}catch(Exception e) {\n\t\t\t\t\treturn NC;\n\t\t\t\t} \n\t\t\t\tif(size==-1)return NC;\n\t\t\t\tbId=0;\n\t\t\t}\n\t\t\treturn (char)buf[bId++];\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn (int)nextLong();\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\tnum=1;\n\t\t\tboolean neg = false;\n\t\t\tif(c==NC)c=nextChar();\n\t\t\tfor(;(c<'0' || c>'9'); c = nextChar()) {\n\t\t\t\tif(c=='-')neg=true;\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tfor(; c>='0' && c <='9'; c=nextChar()) {\n\t\t\t\tres = (res<<3)+(res<<1)+c-'0';\n\t\t\t\tnum*=10;\n\t\t\t}\n\t\t\treturn neg?-res:res;\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\tdouble cur = nextLong();\n\t\t\treturn c!='.' ? cur:cur+nextLong()/num;\n\t\t}\n\n\t\tpublic String next() {\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\twhile(c<=32)c=nextChar();\n\t\t\twhile(c>32) {\n\t\t\t\tres.append(c);\n\t\t\t\tc=nextChar();\n\t\t\t}\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tpublic String nextLine() {\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\twhile(c<=32)c=nextChar();\n\t\t\twhile(c!='\\n') {\n\t\t\t\tres.append(c);\n\t\t\t\tc=nextChar();\n\t\t\t}\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tpublic boolean hasNext() {\n\t\t\tif(c>32)return true;\n\t\t\twhile(true) {\n\t\t\t\tc=nextChar();\n\t\t\t\tif(c==NC)return false;\n\t\t\t\telse if(c>32)return true;\n\t\t\t}\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] res = new int[n];\n\t\t\tfor(int i = 0; i < n; i++) res[i] = nextInt();\n\t\t\treturn res;\n\t\t}\n\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "e60235b4f0a918be5549688df0cf028e", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n long mod = 1_000_000_007;\n\n long inv(long n) {\n long k = mod - 2;\n long res = 1;\n long a = n;\n while(k > 0) {\n if ((k & 1) > 0) {\n res = (res * a) % mod;\n }\n a = (a * a) % mod;\n k >>= 1;\n }\n return res;\n }\n\n public void solve() {\n long[] f = new long[51];\n f[0] = 1;\n for (int i = 1; i < 51; i++) {\n f[i] = (f[i - 1] * i) % mod;\n }\n long[][] c = new long[51][51];\n for (int i = 0; i < 51; i++) {\n c[i][0] = 1;\n }\n for (int i = 1; i < 51; i++) {\n for (int j = 1; j <= i; j++) {\n c[i][j] = (f[i] * inv(((f[j] * f[i - j]) % mod))) % mod;\n }\n }\n\n int n = ni();\n int k = ni();\n int c50 = 0, c100 = 0;\n for (int i = 0; i < n; i++) {\n if (ni() == 100) c100++;\n else c50++;\n }\n Node[][][] ns = new Node[c50 + 1][c100 + 1][2];\n for (int i = 0; i <= c50; i++) {\n for (int j = 0; j <= c100; j++) {\n ns[i][j][0] = new Node(i, j, 0);\n ns[i][j][1] = new Node(i, j, 1);\n }\n }\n for (int i = 0; i <= c50; i++) {\n for (int j = 0; j <= c100; j++) {\n int p50c = Math.min(k / 50, i);\n int p100c = Math.min(k / 100, j);\n for (int x = p100c; x >= 0; x--) {\n for (int y = Math.min(p50c, (k - 100 * x) / 50); y >= 0; y--) {\n if ( 0 == y && 0 == x) continue;\n ns[i][j][0].s.add(ns[i - y][j - x][1]);\n ns[i - y][j - x][1].s.add(ns[i][j][0]);\n// System.out.println(\"(\" + i + \", \" + j + \", 0) -> (\" + (i - y) + \", \" + (j - x) + \", 1)\");\n// System.out.println(\"(\" + (i - y) + \", \" + (j - x) + \", 1) -> (\" + i + \", \" + j + \", 0)\");\n }\n }\n }\n }\n ArrayDeque<Node> q = new ArrayDeque<>();\n ns[c50][c100][0].n = 1;\n ns[c50][c100][0].am = 1;\n q.add(ns[c50][c100][0]);\n while (!q.isEmpty()) {\n Node cur = q.pop();\n for (Node ch: cur.s) {\n if (ch.n == 0 || ch.n == cur.n + 1) {\n long p1 = c[cur.b == 0 ? cur.c50 : c50 - cur.c50][Math.abs(cur.c50 - ch.c50)];\n long p2 = c[cur.b == 0 ? cur.c100 : c100 - cur.c100][Math.abs(cur.c100 - ch.c100)];\n ch.am = (ch.am + (cur.am * (p1 * p2) % mod) % mod) % mod;\n if (ch.n == 0) {\n ch.n = cur.n + 1;\n q.add(ch);\n }\n// System.out.println(\"p1: \" + p1 + \", i: \" + (cur.b == 0 ? cur.c50 : c50 - cur.c50) + \", j:\" +\n// (Math.abs(cur.c50 - ch.c50)));\n// System.out.println(\"(\" + cur.c50 + \", \" + cur.c100 + \", \" + cur.b + \", \" + cur.am + \") --> (\" +\n// + ch.c50 + \", \" + ch.c100 + \", \" + ch.b + \", \" + ch.am + \")\");\n }\n }\n }\n write(ns[0][0][1].n - 1 + \"\\n\" + ns[0][0][1].am + \"\\n\");\n }\n\n class Node {\n public int c50, c100, b, n;\n long am;\n public ArrayList<Node> s;\n public Node(int x, int y, int z) {\n c50 = x;\n c100 = y;\n b = z;\n s = new ArrayList<>();\n n = 0;\n am = 0;\n }\n }\n\n\n\n public static void main(String[] args) {\n Main m = new Main();\n m.solve();\n try {\n m.out.close();\n } catch (IOException e) {}\n }\n\n BufferedReader in;\n BufferedWriter out;\n StringTokenizer tokenizer;\n public Main() {\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new BufferedWriter(new OutputStreamWriter(System.out));\n }\n public String n() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(in.readLine());\n } catch (IOException e) {}\n }\n return tokenizer.nextToken();\n }\n public int ni() {\n return Integer.parseInt(n());\n }\n public long nl() {\n return Long.parseLong(n());\n }\n public void write(String s) {\n try {\n out.write(s);\n } catch (IOException e) {}\n }\n}", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "31798dd14d8ecd3b73767ca91e22d642", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\n// Problem : C. Greg and Friends\n// Contest : Codeforces - Codeforces Round #179 (Div. 1)\n// URL : https://codeforces.com/contest/295/problem/C\n// Memory Limit : 256 MB\n// Time Limit : 2000 ms\n// Powered by CP Editor (https://github.com/cpeditor/cpeditor)\n\nimport java.io.*;\nimport java.util.*;\nimport java.util.stream.*;\n\npublic class a implements Runnable{\n\t\n public static void main(String[] args) {\n new Thread(null, new a(), \"process\", 1<<26).start();\n }\n\tpublic void run() {\n\t\tFastReader scan = new FastReader();\n PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));\n\t\t//PrintWriter out = new PrintWriter(\"file.out\");\n\t\tTask solver = new Task();\n\t\t//int t = scan.nextInt();\n\t\tint t = 1;\n\t\tfor(int i = 1; i <= t; i++) solver.solve(i, scan, out);\n\t\tout.close();\n\t}\n\n\tstatic class Task {\n\t\tstatic final int inf = Integer.MAX_VALUE;\n\n\t\tpublic void solve(int testNumber, FastReader sc, PrintWriter pw) {\n\t\t\t//CHECK FOR QUICKSORT TLE\n\t\t\t//***********************//\n\t\t\t//CHECK FOR INT OVERFLOW\n\t\t\t//***********************//\n\t\t\tint n = sc.nextInt();\n\t\t\tint we = sc.nextInt() / 50;\n\t\t\tint[] ppl = new int[n];\n\t\t\tint a = 0;\t\n\t\t\tint b = 0;\n\t\t\tint mod = 1000000007;\n\t\t\tfor(int i = 0; i < n; i++) {\n\t\t\t\tppl[i] = sc.nextInt() / 50;\n\t\t\t\ta += ppl[i] & 1;\n\t\t\t\tb += ppl[i] / 2;\n\t\t\t}\n\t\t\tlong[][] choose = new long[52][52];\n\t\t\tfor(int i = 1; i <= 50; i++) {\n\t\t\t\tfor(int j = 0; j <= i; j++) {\n\t\t\t\t\tchoose[i][j] = choose_mod_one(i, j, mod);\n\t\t\t\t}\n\t\t\t}\n\t\t\tlong[][][] dp = new long[200][52][52]; \n\t\t\tdp[0][0][0] = 1;\n\t\t\tchoose[0][0] = 1;\n\t\t\tfor(int i = 1; i < 200; i ++) {\n\t\t\t\tfor(int j = 0; j <= a; j++) {\n\t\t\t\t\tfor(int k = 0; k <= b; k++) {\n\t\t\t\t\t\tif((i & 1) == 1) {\n\t\t\t\t\t\t\tfor(int l = 0; l <= j; l++) {\n\t\t\t\t\t\t\t\tfor(int m = 0; m <= k; m++) {\n\t\t\t\t\t\t\t\t\tif(l == j && m == k) continue;\n\t\t\t\t\t\t\t\t\tint num1s = j - l;\n\t\t\t\t\t\t\t\t\tint num2s = k - m;\n\t\t\t\t\t\t\t\t\tint left1s = a - l;\n\t\t\t\t\t\t\t\t\tint left2s = b - m;\n\t\t\t\t\t\t\t\t\tif(num1s * 1 + num2s * 2 > we) continue;\n\t\t\t\t\t\t\t\t\tdp[i][j][k] += dp[i - 1][l][m] * choose[left1s][num1s] % mod * \n\t\t\t\t\t\t\t\t\t\tchoose[left2s][num2s] % mod;\n\t\t\t\t\t\t\t\t\tdp[i][j][k] %= mod;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tfor(int l = j; l <= a; l++) {\n\t\t\t\t\t\t\t\tfor(int m = k; m <= b; m++) {\n\t\t\t\t\t\t\t\t\tif(l == j && m == k) continue;\n\t\t\t\t\t\t\t\t\tint num1s = l - j;\n\t\t\t\t\t\t\t\t\tint num2s = m - k;\n\t\t\t\t\t\t\t\t\tint left1s = l;\n\t\t\t\t\t\t\t\t\tint left2s = m;\n\t\t\t\t\t\t\t\t\tif(num1s * 1 + num2s * 2 > we) continue;\n\t\t\t\t\t\t\t\t\tdp[i][j][k] += dp[i - 1][l][m] * choose[left1s][num1s] % mod * \n\t\t\t\t\t\t\t\t\t\tchoose[left2s][num2s] % mod;\n\t\t\t\t\t\t\t\t\tdp[i][j][k] %= mod;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(dp[i][a][b] > 0) break;\n\t\t\t}\n\t\t\tfor(int i = 0; i < 200; i++) {\n\t\t\t\tif(dp[i][a][b] > 0) {\n\t\t\t\t\tpw.println(i);\n\t\t\t\t\tpw.println(dp[i][a][b]);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\tpw.println(-1);\n\t\t\tpw.println(0);\n\t\t}\n\t\tlong choose_mod_one(long n, long k, long p)\n\t\t{\n\t\t // For small k, no recursion is necessary\n\t\t if (k < p) return choose_mod_two(n,k,p);\n\t\t long q_n, r_n, q_k, r_k, choose;\n\t\t q_n = n / p;\n\t\t r_n = n % p;\n\t\t q_k = k / p;\n\t\t r_k = k % p;\n\t\t choose = choose_mod_two(r_n, r_k, p);\n\t\t choose *= choose_mod_one(q_n, q_k, p);\n\t\t return choose % p;\n\t\t}\n\t\t\n\t\t// Preconditions: 0 <= k <= min(n,p-1); p > 1 prime\n\t\tlong choose_mod_two(long n, long k, long p)\n\t\t{\n\t\t n %= p;\n\t\t if (n < k) return 0;\n\t\t if (k == 0 || k == n) return 1;\n\t\t if (k > n/2) k = n-k;\n\t\t long num = n, den = 1;\n\t\t for(n = n-1; k > 1; --n, --k)\n\t\t {\n\t\t num = (num * n) % p;\n\t\t den = (den * k) % p;\n\t\t }\n\t\t den = invert_mod(den,p);\n\t\t return (num * den) % p;\n\t\t}\n\t\tlong invert_mod(long k, long m)\n\t\t{\n\t\t if (m == 0) return (k == 1 || k == -1) ? k : 0;\n\t\t if (m < 0) m = -m;\n\t\t k %= m;\n\t\t if (k < 0) k += m;\n\t\t boolean neg = true;\n\t\t long p1 = 1, p2 = 0, k1 = k, m1 = m, q, r, temp;\n\t\t while(k1 > 0) {\n\t\t q = m1 / k1;\n\t\t r = m1 % k1;\n\t\t temp = q*p1 + p2;\n\t\t p2 = p1;\n\t\t p1 = temp;\n\t\t m1 = k1;\n\t\t k1 = r;\n\t\t neg = !neg;\n\t\t }\n\t\t return neg ? m - p2 : p2;\n\t\t}\n\t}\n\tstatic long binpow(long a, long b, long m) {\n\t\ta %= m;\n\t\tlong res = 1;\n\t\twhile (b > 0) {\n\t\t\tif ((b & 1) == 1)\n\t\t\t\tres = res * a % m;\n\t\t\ta = a * a % m;\n\t\t\tb >>= 1;\n\t\t}\n\t\treturn res;\n\t}\n\tstatic void sort(int[] x){\n\t\tshuffle(x);\n\t\tArrays.sort(x);\n\t}\n\tstatic void sort(long[] x){\n\t\tshuffle(x);\n\t\tArrays.sort(x);\n\t}\n\tstatic class tup implements Comparable<tup>{\n\t\tint a, b;\n\t\ttup(int a,int b){\n\t\t\tthis.a=a;\n\t\t\tthis.b=b;\n\t\t}\n\t\t@Override\n\t\tpublic int compareTo(tup o){\n\t\t\treturn Integer.compare(o.b,b);\n\t\t}\n\t}\n\tstatic void shuffle(int[] a) {\n\t\tRandom get = new Random();\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\tint r = get.nextInt(i + 1);\n\t\t\tint temp = a[i];\n\t\t\ta[i] = a[r];\n\t\t\ta[r] = temp;\n\t\t}\n\t}\n\n\tstatic void shuffle(long[] a) {\n\t\tRandom get = new Random();\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\tint r = get.nextInt(i + 1);\n\t\t\tlong temp = a[i];\n\t\t\ta[i] = a[r];\n\t\t\ta[r] = temp;\n\t\t}\n\t}\n\n\tstatic class FastReader {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tpublic FastReader() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tpublic FastReader(String s) throws FileNotFoundException {\n\t\t\tbr = new BufferedReader(new FileReader(new File(s)));\n\t\t}\n\n\t\tString next() {\n\t\t\twhile (st == null || !st.hasMoreElements()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tString nextLine() {\n\t\t\tString str = \"\";\n\t\t\ttry {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn str;\n\t\t}\n\t}\n\n}", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "d25de1c50a917c8c969ba61eb57a92f4", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\n\npublic class C {\n\tprivate static Scanner in;\n\n\tfinal static int M = 1000000007;\n\t\n\tpublic void run() {\n\t\tint n = in.nextInt();\n\t\tint k = in.nextInt() / 50;\n\t\tint small = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (in.nextInt() == 50) {\n\t\t\t\tsmall++;\n\t\t\t}\n\t\t}\n\t\tif (small == 0) {\n\t\t\tsmall = n;\n\t\t\tk /= 2;\n\t\t}\n\t\tint[][] cnk = new int[n + 1][n + 1];\n\t\tfor (int i = 0; i <= n; i++) {\n\t\t\tcnk[i][i] = cnk[i][0] = 1;\n\t\t\tfor (int j = 1; j < i; j++) {\n\t\t\t\tcnk[i][j] = (cnk[i - 1][j - 1] + cnk[i - 1][j]) % M;\n\t\t\t}\n\t\t}\n\t\tint[][] a = new int[n + 1][n + 1];\n\t\tboolean[][] aa = new boolean[n + 1][n + 1];\n\t\ta[n][small] = 1;\n\t\taa[n][small] = true;\n\t\tfor (int t = 0;; t++) {\n\t\t\tint[][] b = new int[n + 1][n + 1];\n\t\t\tboolean[][] bb = new boolean[n + 1][n + 1];\n\t\t\tfor (int m = 0; m <= n; m++) {\n\t\t\t\tfor (int s = 0; s <= m; s++) {\n\t\t\t\t\tif (!aa[m][s]) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tint h = m - s;\n\t\t\t\t\tint mm = n - m;\n\t\t\t\t\tint ss = small - s;\n\t\t\t\t\tfor (int i = 0; i <= s; i++) {\n\t\t\t\t\t\tfor (int j = 0; j <= h; j++) {\n\t\t\t\t\t\t\tif (i + 2 * j > k) {\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif (i + j == 0) {\n\t\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tlong w = a[m][s];\n\t\t\t\t\t\t\tw = (w * cnk[s][i]) % M;\n\t\t\t\t\t\t\tw = (w * cnk[h][j]) % M;\n\t\t\t\t\t\t\tb[mm + i + j][ss + i] = (int) ((b[mm + i + j][ss + i] + w) % M);\n\t\t\t\t\t\t\tbb[mm + i + j][ss + i] = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\ta = b;\n\t\t\taa = bb;\n\t\t\tif ((t % 2 == 0) && (aa[n][small])) {\n\t\t\t\tSystem.out.println(t + 1);\n\t\t\t\tSystem.out.println(a[n][small]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (k < 3 && t > 5 * n) {\n\t\t\t\tSystem.out.println(\"-1\\n0\");\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tLocale.setDefault(Locale.US);\n\t\tin = new Scanner(System.in);\n\t\tnew C().run();\n\t\tin.close();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "793893a15633d4f7c675d4055027578f", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.BigInteger;\nimport static java.lang.Math.*;\n \n/* spar5h */\n \npublic class cf1 implements Runnable { \n\t\n\tfinal long mod = (long)1e9 + 7;\n\t\n\tlong modExp(long x, long y) {\n\t\t\n\t\tif(y == 0)\n\t\t\treturn 1;\n\t\t\n\t\tif(y == 1)\n\t\t\treturn x;\n\t\t\n\t\tlong ret = modExp(x, y / 2);\n\t\t\n\t\tret = ret * ret % mod;\n\t\t\n\t\tif(y % 2 == 1)\n\t\t\tret = ret * x % mod;\n\t\t\n\t\treturn ret;\n\t}\n\t\n\tlong[] fact, invFact;\n\t\n\tlong nCr(int n, int r) {\n\t\treturn fact[n] * invFact[r] % mod * invFact[n - r] % mod;\n\t}\n\t\n\tpublic void run() {\n\t\t\n\t\tInputReader s = new InputReader(System.in);\n\t\tPrintWriter w = new PrintWriter(System.out);\n\t\t\n\t\tfact = new long[50 + 1]; fact[0] = 1;\n\t\tinvFact = new long[50 + 1]; invFact[0] = 1;\n\t\t\n\t\tfor(int i = 1; i <= 50; i++) {\n\t\t\tfact[i] = fact[i - 1] * i % mod;\n\t\t\tinvFact[i] = invFact[i - 1] * modExp(i, mod - 2) % mod;\n\t\t}\n\t\t\n\t\tint n = s.nextInt(), k = s.nextInt() / 50;\n\t\t\n\t\tint[] f = new int[3];\n\t\t\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tf[s.nextInt() / 50]++;\n\t\t\n\t\tint LIM = 6 * n;\n\t\t\n\t\tlong[][][] dp = new long[LIM][f[1] + 1][f[2] + 1];\n\t\t\n\t\tdp[0][f[1]][f[2]] = 1;\n\t\t\n\t\tint res = -1;\n\t\t\n\t\tfor(int i = 1; i < LIM; i++) {\n\t\t\t\n\t\t\tif(i % 2 == 1) {\n\t\t\t\tfor(int a = 0; a <= f[1]; a++) \n\t\t\t\t\tfor(int b = 0; b <= f[2]; b++) \n\t\t\t\t\t\tfor(int c = 0; c <= f[1] - a; c++)\n\t\t\t\t\t\t\tfor(int d = 0; d <= f[2] - b; d++)\n\t\t\t\t\t\t\t\tif(c + d >= 1 && c + d * 2 <= k)\n\t\t\t\t\t\t\t\t\tdp[i][a][b] = (dp[i][a][b] + dp[i - 1][a + c][b + d] * nCr(a + c, c) % mod * nCr(b + d, d)) % mod;\n\t\t\t}\n\t\t\t\n\t\t\telse {\n\t\t\t\tfor(int a = 0; a <= f[1]; a++) \n\t\t\t\t\tfor(int b = 0; b <= f[2]; b++) \n\t\t\t\t\t\tfor(int c = 0; c <= a; c++)\n\t\t\t\t\t\t\tfor(int d = 0; d <= b; d++)\n\t\t\t\t\t\t\t\tif(c + d >= 1 && c + d * 2 <= k) \n\t\t\t\t\t\t\t\t\tdp[i][a][b] = (dp[i][a][b] + dp[i - 1][a - c][b - d] * nCr(f[1] - (a - c), c) % mod * nCr(f[2] - (b - d), d) % mod) % mod;\t\t\t\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\tif(dp[i][0][0] > 0) {\n\t\t\t\tres = i; break;\n\t\t\t}\n\t\t}\n\t\t\n\t\tw.println(res);\n\t\t\n\t\tif(res != -1)\n\t\t\tw.println(dp[res][0][0]);\n\t\telse\n\t\t\tw.println(0);\n\t\t\t\n \t\tw.close();\n\t}\n\t\n\tstatic class InputReader {\n\t\t\n\t\tprivate InputStream stream;\n\t\tprivate byte[] buf = new byte[1024];\n\t\tprivate int curChar;\n\t\tprivate int numChars;\n\t\tprivate SpaceCharFilter filter;\n\t\t\n\t\tpublic InputReader(InputStream stream) {\n\t\t\tthis.stream = stream;\n\t\t}\n\t\t\n\t\tpublic int read() {\n\t\t\t\n\t\t\tif (numChars==-1) \n\t\t\t\tthrow new InputMismatchException();\n\t\t\t\n\t\t\tif (curChar >= numChars) {\n\t\t\t\t\n\t\t\t\tcurChar = 0;\n\t\t\t\t\n\t\t\t\ttry {\n\t\t\t\t\tnumChars = stream.read(buf);\n\t\t\t\t}\n\t\t\t\tcatch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(numChars <= 0)\t\t\t\t\n\t\t\t\t\treturn -1;\n\t\t\t}\n\t\t\t\n\t\t\treturn buf[curChar++];\n\t\t}\n\t\t \n\t\tpublic String nextLine() {\n\t\t\t\n\t\t\tBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\t\t\tString str = \"\";\n\t \n\t\t\ttry {\n\t str = br.readLine();\n\t }\n\t catch (IOException e) {\n\t e.printStackTrace();\n\t }\n\t\t\t\n\t return str;\n\t\t}\n\t\t\n\t\tpublic int nextInt() {\n\t\t\n\t\t\tint c = read();\n\t\t\t\n\t\t\twhile(isSpaceChar(c)) \n\t\t\t\tc = read();\n\t\t\t\n\t\t\tint sgn = 1;\n\t\t\t\n\t\t\tif (c == '-') {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\t\n\t\t\tint res = 0;\n\t\t\t\n\t\t\tdo {\n\t\t\t\tif(c<'0'||c>'9') \n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\twhile (!isSpaceChar(c)); \n\t\t\t\n\t\t\treturn res * sgn;\n\t\t}\n\t\t\n\t\tpublic long nextLong() {\n\t\t\t\n\t\t\tint c = read();\n\t\t\t\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\t\n\t\t\tint sgn = 1;\n\t\t\t\n\t\t\tif (c == '-') {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\t\n\t\t\tlong res = 0;\n\t\t\t\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\t\n\t\t\twhile (!isSpaceChar(c));\n\t\t\t\treturn res * sgn;\n\t\t}\n\t\t\n\t\tpublic double nextDouble() {\n\t\t\t\n\t\t\tint c = read();\n\t\t\t\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\t\n\t\t\tint sgn = 1;\n\t\t\t\n\t\t\tif (c == '-') {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\t\n\t\t\tdouble res = 0;\n\t\t\t\n\t\t\twhile (!isSpaceChar(c) && c != '.') {\n\t\t\t\t\n\t\t\t\tif (c == 'e' || c == 'E')\n\t\t\t\t\treturn res * Math.pow(10, nextInt());\n\t\t\t\t\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\t\n\t\t\tif (c == '.') {\n\t\t\t\t\n\t\t\t\tc = read();\n\t\t\t\tdouble m = 1;\n\t\t\t\twhile (!isSpaceChar(c)) \n\t\t\t\t{\n\t\t\t\t\tif (c == 'e' || c == 'E')\n\t\t\t\t\t\treturn res * Math.pow(10, nextInt());\n\t\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t\tm /= 10;\n\t\t\t\t\tres += (c - '0') * m;\n\t\t\t\t\tc = read();\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\treturn res * sgn;\n\t\t}\n\t\t\n\t\tpublic String readString() {\n\t\t\t\n\t\t\tint c = read();\n\t\t\t\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\t\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\t\n\t\t\tdo {\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t} \n\t\t\twhile (!isSpaceChar(c));\n\t\t\t\n\t\t\treturn res.toString();\n\t\t}\n\t \n\t\tpublic boolean isSpaceChar(int c) {\n\t\t\t\n\t\t\tif (filter != null)\n\t\t\t\treturn filter.isSpaceChar(c);\n\t\t\t\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n\t \n\t\tpublic String next() {\n\t\t\treturn readString();\n\t\t}\n\t\t\n\t\tpublic interface SpaceCharFilter {\n\t\t\tpublic boolean isSpaceChar(int ch);\n\t\t}\n\t\n\t}\n \n\tpublic static void main(String args[]) throws Exception {\n\t\tnew Thread(null, new cf1(),\"cf1\",1<<26).start();\n\t}\n} ", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "9a6ca838d7b0cc5cf3bd5f0db597b94e", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import static java.util.Arrays.deepToString;\n\nimport java.io.*;\nimport java.math.*;\nimport java.util.*;\n\npublic class C {\n\n\tfinal static long MOD = 1000000007;\n\n\tstatic void solve() {\n\t\tlong[][] cnk = new long[100][100];\n\t\tcnk[0][0] = 1;\n\t\tfor (int i = 1; i < cnk.length; i++) {\n\t\t\tcnk[i][0] = 1;\n\t\t\tfor (int j = 1; j <= i; j++) {\n\t\t\t\tcnk[i][j] = cnk[i - 1][j - 1] + cnk[i - 1][j];\n\t\t\t}\n\t\t}\n\n\t\tint n = nextInt(), k = nextInt() / 50;\n\t\tint[] total = new int[3];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ttotal[nextInt() / 50]++;\n\t\t}\n\t\tlong[][][] d = new long[total[1] + 1][total[2] + 1][2];\n\t\tboolean[][][] was = new boolean[total[1] + 1][total[2] + 1][2];\n\t\tint[][][] dist = new int[total[1] + 1][total[2] + 1][2];\n\t\twas[total[1]][total[2]][0] = true;\n\t\td[total[1]][total[2]][0] = 1;\n\t\tint[] q = new int[100000];\n\t\tint ql = 0, qr = 0;\n\t\tq[qr++] = total[1];\n\t\tq[qr++] = total[2];\n\t\tq[qr++] = 0;\n\t\twhile (ql < qr) {\n\t\t\tint c1 = q[ql++];\n\t\t\tint c2 = q[ql++];\n\t\t\tint side = q[ql++];\n\t\t\tint curDist = dist[c1][c2][side];\n\t\t\tint maxTake1 = side == 0 ? c1 : total[1] - c1;\n\t\t\tint maxTake2 = side == 0 ? c2 : total[2] - c2;\n\t\t\tfor (int take1 = 0; take1 <= maxTake1; take1++) {\n\t\t\t\tfor (int take2 = 0; take2 <= maxTake2 && take1 + 2 * take2 <= k; take2++) {\n\t\t\t\t\tif (take1 == 0 && take2 == 0)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tint nc1 = c1 + (side == 0 ? -take1 : take1);\n\t\t\t\t\tint nc2 = c2 + (side == 0 ? -take2 : take2);\n\t\t\t\t\tint nside = 1 - side;\n\t\t\t\t\tif (!was[nc1][nc2][nside]) {\n\t\t\t\t\t\twas[nc1][nc2][nside] = true;\n\t\t\t\t\t\tdist[nc1][nc2][nside] = curDist + 1;\n\t\t\t\t\t\tq[qr++] = nc1;\n\t\t\t\t\t\tq[qr++] = nc2;\n\t\t\t\t\t\tq[qr++] = nside;\n\t\t\t\t\t}\n\t\t\t\t\tint nDist = dist[nc1][nc2][nside];\n\t\t\t\t\tif (nDist == curDist + 1) {\n\t\t\t\t\t\tlong add = d[c1][c2][side] * cnk[maxTake1][take1];\n\t\t\t\t\t\tadd %= MOD;\n\t\t\t\t\t\td[nc1][nc2][nside] += add * cnk[maxTake2][take2];\n\t\t\t\t\t\td[nc1][nc2][nside] %= MOD;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (!was[0][0][1]) {\n\t\t\twriter.println(-1);\n\t\t} else {\n\t\t\twriter.println(dist[0][0][1]);\n\t\t}\n\t\twriter.println(d[0][0][1]);\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\t\treader = new BufferedReader(new InputStreamReader(System.in));\n\t\twriter = new PrintWriter(System.out);\n\n\t\tsetTime();\n\t\tsolve();\n\t\tprintTime();\n\t\tprintMemory();\n\n\t\twriter.close();\n\t}\n\n\tstatic BufferedReader reader;\n\tstatic PrintWriter writer;\n\tstatic StringTokenizer tok = new StringTokenizer(\"\");\n\tstatic long systemTime;\n\n\tstatic void debug(Object... o) {\n\t\tSystem.err.println(deepToString(o));\n\t}\n\n\tstatic void setTime() {\n\t\tsystemTime = System.currentTimeMillis();\n\t}\n\n\tstatic void printTime() {\n\t\tSystem.err.println(\"Time consumed: \" + (System.currentTimeMillis() - systemTime));\n\t}\n\n\tstatic void printMemory() {\n\t\tSystem.err.println(\"Memory consumed: \"\n\t\t\t\t+ (Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory()) / 1000 + \"kb\");\n\t}\n\n\tstatic String next() {\n\t\twhile (!tok.hasMoreTokens()) {\n\t\t\tString w = null;\n\t\t\ttry {\n\t\t\t\tw = reader.readLine();\n\t\t\t} catch (Exception e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (w == null)\n\t\t\t\treturn null;\n\t\t\ttok = new StringTokenizer(w);\n\t\t}\n\t\treturn tok.nextToken();\n\t}\n\n\tstatic int nextInt() {\n\t\treturn Integer.parseInt(next());\n\t}\n\n\tstatic long nextLong() {\n\t\treturn Long.parseLong(next());\n\t}\n\n\tstatic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n\n\tstatic BigInteger nextBigInteger() {\n\t\treturn new BigInteger(next());\n\t}\n}", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "3f1337f6a98ebe11f7c87b32259d6a78", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.StreamTokenizer;\nimport java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.util.Arrays;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.Reader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tTokenizerReader in = new TokenizerReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskE solver = new TaskE();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskE {\n final static long MOD = 1000000007;\n public void solve(@SuppressWarnings(\"UnusedParameters\") int testNumber, TokenizerReader in, PrintWriter out) {\n int n = in.nextInt(), maxWeight = in.nextInt();\n long[][] C = new long[n+1][n+1];\n for (int i = 0; i <= n; ++i) {\n C[i][0] = C[i][i] = 1;\n for (int j = 1; j < i; ++j)\n C[i][j] = (C[i-1][j-1] + C[i-1][j]) % MOD;\n }\n maxWeight /= 50;\n int totalSmall = 0, totalBig = 0;\n for (int i = 0; i < n; ++i) {\n if (in.nextInt() == 50)\n ++totalSmall;\n else\n ++totalBig;\n }\n\n int[][][] time = new int[2][totalSmall + 1][totalBig + 1];\n for (int[][] ii: time)\n for (int[] i: ii)\n Arrays.fill(i, Integer.MAX_VALUE);\n for (int side = 0; side <= 1; ++side)\n for (int thisPeople = 0; thisPeople <= n; ++thisPeople)\n for (int thisSmall = Math.min(totalSmall, thisPeople); thisSmall >= 0; --thisSmall) {\n int thisBig = thisPeople - thisSmall;\n if (thisBig > totalBig)\n continue;\n int thatSmall = totalSmall - thisSmall;\n int thatBig = totalBig - thisBig;\n if (side == 1) {\n if (thisPeople == n)\n time[side][thisSmall][thisBig] = 0;\n else if (thisSmall > 0)\n time[side][thisSmall][thisBig] = 1 + time[0][thatSmall+1][thatBig];\n else if (thisBig > 0)\n time[side][thisSmall][thisBig] = 1 + time[0][thatSmall][thatBig+1];\n continue;\n }\n if (thisPeople == 0)\n continue;\n for (int big = 0; big <= thisBig && 2*big <= maxWeight; ++big)\n for (int small = 0; small <= thisSmall && 2*big+small <= maxWeight; ++small) {\n if (big == thisBig && small == thisSmall)\n time[side][thisSmall][thisBig] = 1;\n else if (2*big + small > 1) {\n int nextRightSmall = thatSmall + small;\n int nextLeftBig, nextLeftSmall;\n if (nextRightSmall > 0) {\n nextLeftBig = thisBig - big;\n nextLeftSmall = thisSmall + 1 - small;\n } else {\n nextLeftBig = thisBig + 1 - big;\n nextLeftSmall = thisSmall - small;\n }\n if (nextLeftBig != thisBig || nextLeftSmall != thisSmall) {\n if (time[side][nextLeftSmall][nextLeftBig] < Integer.MAX_VALUE)\n time[side][thisSmall][thisBig] = Math.min(\n time[side][thisSmall][thisBig],\n time[side][nextLeftSmall][nextLeftBig] + 2\n );\n }\n }\n }\n }\n\n int T = time[0][totalSmall][totalBig];\n if (T == Integer.MAX_VALUE) {\n out.println(-1);\n out.println(0);\n return;\n }\n long[][][] res = new long[2][totalSmall+1][totalBig+1];\n for (int t = 0; t <= T; ++t)\n for (int thisPeople = 0; thisPeople <= n; ++thisPeople)\n for (int thisSmall = 0; thisSmall <= totalSmall && thisSmall <= thisPeople; ++thisSmall) {\n int thisBig = thisPeople - thisSmall;\n if (thisBig > totalBig)\n continue;\n int side = 1 - t % 2;\n if (time[side][thisSmall][thisBig] == 0) {\n res[side][thisSmall][thisBig] = 1;\n continue;\n }\n if (time[side][thisSmall][thisBig] != t)\n continue;\n for (int big = 0; big <= thisBig && 2*big <= maxWeight; ++big)\n for (int small = 0; small <= thisSmall && 2*big + small <= maxWeight; ++small)\n if (big + small > 0) {\n int nextSmall = totalSmall - thisSmall + small;\n int nextBig = totalBig - thisBig + big;\n int nextSide = 1 - side;\n if (time[nextSide][nextSmall][nextBig] == t-1) {\n long tmp = res[nextSide][nextSmall][nextBig] * C[thisBig][big] % MOD * C[thisSmall][small] % MOD;\n res[side][thisSmall][thisBig] += tmp;\n res[side][thisSmall][thisBig] %= MOD;\n }\n }\n }\n\n\n out.println(T);\n out.println(res[0][totalSmall][totalBig]);\n }\n}\n\nclass TokenizerReader extends StreamTokenizer {\n public TokenizerReader(InputStream in) {\n super(new BufferedReader(new InputStreamReader(in)));\n defaultConfig();\n }\n\n public String nextString() {\n try {\n nextToken();\n } catch (IOException e) {\n throw new RuntimeException(\"nextString: exception in line \" + lineno(), e);\n }\n return sval;\n }\n\n public int nextInt() {\n return Integer.parseInt(nextString());\n }\n\n public void defaultConfig() {\n resetSyntax();\n wordChars(33, 126);\n whitespaceChars(0, ' ');\n }\n\n }\n\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "5efa85a46f3db856b56f0ce2007e51a1", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\n\npublic class Abood2D {\n\n\tstatic int N, fifty, hundred, K;\n\tstatic int memo[][][];\n\tstatic int memo2[][][][];\n\tstatic final int MOD = (int) 1e9 + 7;\n\tstatic long[][] comb; \n\n\tstatic int solve(int t, int f, int h) {\n\t\tif(f == 0 && h == 0)\n\t\t\treturn 0;\n\n\t\tif(memo[t][f][h] != -1)\n\t\t\treturn memo[t][f][h];\n\n\t\tif(t == 1)\n\t\t\treturn 1 + (f < fifty ? solve(0, f + 1, h) : solve(0, f, h + 1));\n\n\t\tint ans = (int) 1e6;\n\n\t\tfor (int i = 0; i <= f; i++) {\n\t\t\tif(i * 50 > K)\n\t\t\t\tbreak;\n\n\t\t\tint j = Math.min(( K - i * 50) / 100, h);\n\n\t\t\tint totalW = i * 50 + j * 100;\n\n\t\t\tif(fifty - f + i > 0 && totalW > 50 || hundred - h + j > 1 && totalW > 100 || i == fifty && j == hundred)\n\t\t\t\tans = Math.min(ans, solve(1, f - i, h - j));\n\n\t\t}\n\n\t\treturn memo[t][f][h] = ans + 1;\n\t}\n\n\tstatic int solve2(int t, int f, int h, int r) {\n\t\tif(r == 0 && f == 0 && h == 0)\n\t\t\treturn 1;\n\n\n\t\tif(r == 0)\n\t\t\treturn 0;\n\n\t\tif(memo2[t][f][h][r] != -1)\n\t\t\treturn memo2[t][f][h][r];\n\n\n\t\tint ans = 0;\n\n\t\tif(t == 1) {\n\t\t\tfor (int i = 0; i <= fifty - f; ++i) {\n\t\t\t\tif(i * 50 > K)\n\t\t\t\t\tbreak;\n\t\t\t\tfor (int j = 0; j <= hundred - h; ++j) {\t\t\n\t\t\t\t\tif(i == 0 && j == 0)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tint totalW = i * 50 + j * 100;\n\n\t\t\t\t\tif(totalW > K)\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tans = (int) ((1l * ans + (1l * (nCk(fifty - f, i) * nCk(hundred - h, j)) % MOD) * solve2(0, f + i, h + j, r - 1) % MOD) % MOD);\n\n\t\t\t\t}\n\n\n\t\t\t}\n\t\t} else {\n\t\t\tfor (int i = 0; i <= f; ++i) {\n\t\t\t\tif(i * 50 > K)\n\t\t\t\t\tbreak;\n\t\t\t\tfor (int j = 0; j <= h; ++j) {\t\t\n\t\t\t\t\tif(i == 0 && j == 0)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tint totalW = i * 50 + j * 100;\n\n\t\t\t\t\tif(totalW > K)\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tans = (int) ((1l * ans + (1l * (nCk(f, i) * nCk(h, j)) % MOD) * solve2(1, f - i, h - j, r - 1) % MOD)) % MOD;\n\n\t\t\t\t}\n\n\n\t\t\t}\n\t\t}\n\n\t\treturn memo2[t][f][h][r] = ans;\n\t}\n\n\n\tstatic long nCk(int n, int k)\t\t// O(n * k)\n\t{\n\t\tif(n < k)\t\t\t\t\t\n\t\t\treturn 0;\n\t\tif(k == 0 || k == n)\t\t//may add k == 1 as a base case for fast calculations\n\t\t\treturn 1;\n\t\tif(comb[n][k] != -1)\n\t\t\treturn comb[n][k];\n\t\tif(n - k < k)\t\t\t\t\n\t\t\treturn comb[n][k] = nCk(n, n - k);\t\t//reduce k to n - k\n\t\treturn comb[n][k] = (((1l * n * nCk(n - 1, k - 1)) % MOD) * pow(k, MOD - 2)) % MOD;\n\t}\n\n\tstatic int pow(int x, long p) {\n\t\tif(p == 0)\n\t\t\treturn 1;\n\n\t\tint ans = 1;\n\t\tif(p % 2 == 1)\n\t\t\tans *= x;\n\n\t\tint c = pow(x, p / 2);\n\n\t\tans = (int) ((1l * ((1l * ans * c) % MOD) * c) % MOD);\n\n\t\treturn ans;\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tScanner sc = new Scanner(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tN = sc.nextInt();\n\t\tK = sc.nextInt();\n\n\t\tfor (int i = 0; i < N; i++)\n\t\t\tif(sc.nextInt() == 50) fifty++; else hundred++;\n\n\n\t\tmemo = new int[2][fifty + 1][hundred + 1];\n\n\t\tfor (int i = 0; i < 2; i++)\n\t\t\tfor (int j = 0; j <= fifty; j++)\n\t\t\t\tArrays.fill(memo[i][j], -1);\n\n\t\tcomb = new long[100 + 1][100 + 1];\n\n\t\tfor (int i = 0; i <= 100; i++)\n\t\t\tArrays.fill(comb[i], -1);\n\n\n\t\tint min = solve(0, fifty, hundred);\n\n\t\tif(min >= (int) 1e6){\n\t\t\tout.println(-1);\n\t\t\tout.println(0);\n\t\t}else {\n\t\t\tmemo2 = new int[2][fifty + 1][hundred + 1][min + 1];\n\n\t\t\tfor (int i = 0; i < 2; i++)\n\t\t\t\tfor (int j = 0; j <= fifty; j++)\n\t\t\t\t\tfor (int j2 = 0; j2 <= hundred; j2++)\n\t\t\t\t\t\tArrays.fill(memo2[i][j][j2], -1);\n\n\t\t\tout.println(min);\n\t\t\tout.println(solve2(0, fifty, hundred, min));\n\t\t}\n\n\n\t\tout.flush();\n\n\t}\n\n\n\n\tstatic class Scanner \n\n\n\n\t{\n\t\tStringTokenizer st;\n\t\tBufferedReader br;\n\n\t\tpublic Scanner(InputStream s){\tbr = new BufferedReader(new InputStreamReader(s));}\n\n\t\tpublic String next() throws IOException \n\t\t{\n\t\t\twhile (st == null || !st.hasMoreTokens()) \n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {return Integer.parseInt(next());}\n\n\t\tpublic long nextLong() throws IOException {return Long.parseLong(next());}\n\n\t\tpublic String nextLine() throws IOException {return br.readLine();}\n\n\n\t\tpublic double nextDouble() throws IOException\n\t\t{\n\t\t\tString x = next();\n\t\t\tStringBuilder sb = new StringBuilder(\"0\");\n\t\t\tdouble res = 0, f = 1;\n\t\t\tboolean dec = false, neg = false;\n\t\t\tint start = 0;\n\t\t\tif(x.charAt(0) == '-')\n\t\t\t{\n\t\t\t\tneg = true;\n\t\t\t\tstart++;\n\t\t\t}\n\t\t\tfor(int i = start; i < x.length(); i++)\n\t\t\t\tif(x.charAt(i) == '.')\n\t\t\t\t{\n\t\t\t\t\tres = Long.parseLong(sb.toString());\n\t\t\t\t\tsb = new StringBuilder(\"0\");\n\t\t\t\t\tdec = true;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tsb.append(x.charAt(i));\n\t\t\t\t\tif(dec)\n\t\t\t\t\t\tf *= 10;\n\t\t\t\t}\n\t\t\tres += Long.parseLong(sb.toString()) / f;\n\t\t\treturn res * (neg?-1:1);\n\t\t}\n\n\t\tpublic boolean ready() throws IOException {return br.ready();}\n\n\n\n\t}\n\n\n}", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "a8611340a81d23f72e0697e0d0f8ad92", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.IOException;\nimport java.util.ArrayDeque;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n CGregAndFriends solver = new CGregAndFriends();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class CGregAndFriends {\n long mod = 1000000007;\n long INF = (long) 1e18 + 1;\n PrintWriter out;\n InputReader in;\n long[][] nCr = new long[100][100];\n\n long f(long p, int a, int b, int c, int d) {\n p *= nCr[a][b];\n p %= mod;\n p *= nCr[c][d];\n p %= mod;\n return p;\n }\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n this.out = out;\n this.in = in;\n int n = ni();\n int K = ni();\n int cnt1 = 0, cnt2 = 0;\n int i = 0, j = 0, k = 0;\n for (i = 0; i < 100; i++) {\n for (j = 0; j <= i; j++) {\n if (j == 0 || j == i)\n nCr[i][j] = 1;\n else\n nCr[i][j] = (nCr[i - 1][j] + nCr[i - 1][j - 1]) % mod;\n }\n }\n for (i = 0; i < n; i++) {\n if (ni() == 50)\n cnt1++;\n else\n cnt2++;\n }\n long[][][] dist = new long[200][200][2];\n long[][][] dp = new long[200][200][2];\n for (i = 0; i < 200; i++) {\n for (j = 0; j < 200; j++)\n Arrays.fill(dist[i][j], INF);\n }\n dist[0][0][0] = 0;\n dp[0][0][0] = 1;\n ArrayDeque<Tuple> pq = new ArrayDeque<>();\n pq.add(new Tuple(0, 0, 0, 0));\n while (pq.size() > 0) {\n Tuple curr = pq.poll();\n int x = curr.x;\n int y = curr.y;\n int z = curr.z;\n long d = dist[x][y][z];\n if (z == 0) {\n int rem_x = cnt1 - x;\n int rem_y = cnt2 - y;\n for (i = 0; i <= rem_x; i++) {\n for (j = 0; j <= rem_y; j++) {\n if (i + j == 0)\n continue;\n if (i * 50 + j * 100 > K)\n break;\n if (dist[i + x][j + y][z ^ 1] >= d + 1) {\n if (dist[i + x][j + y][z ^ 1] > d + 1) {\n dist[i + x][j + y][z ^ 1] = d + 1;\n pq.add(new Tuple(dist[i + x][j + y][z ^ 1], i + x, j + y, z ^ 1));\n dp[i + x][j + y][z ^ 1] += f(dp[x][y][z], rem_x, i, rem_y, j);\n dp[i + x][j + y][z ^ 1] %= mod;\n } else {\n dp[i + x][j + y][z ^ 1] += f(dp[x][y][z], rem_x, i, rem_y, j);\n dp[i + x][j + y][z ^ 1] %= mod;\n }\n }\n }\n }\n } else {\n int rem_x = x;\n int rem_y = y;\n for (i = 0; i <= rem_x; i++) {\n for (j = 0; j <= rem_y; j++) {\n if (i + j == 0)\n continue;\n if (i * 50 + j * 100 > K)\n break;\n if (dist[x - i][y - j][z ^ 1] >= d + 1) {\n if (dist[x - i][y - j][z ^ 1] > d + 1) {\n dist[x - i][y - j][z ^ 1] = d + 1;\n pq.add(new Tuple(dist[x - i][y - j][z ^ 1], x - i, y - j, z ^ 1));\n dp[x - i][y - j][z ^ 1] += f(dp[x][y][z], rem_x, i, rem_y, j);\n dp[x - i][y - j][z ^ 1] %= mod;\n } else {\n dp[x - i][y - j][z ^ 1] += f(dp[x][y][z], rem_x, i, rem_y, j);\n dp[x - i][y - j][z ^ 1] %= mod;\n }\n }\n }\n }\n }\n }\n if (dist[cnt1][cnt2][1] == INF)\n pn(-1);\n else\n pn(dist[cnt1][cnt2][1]);\n pn(dp[cnt1][cnt2][1]);\n }\n\n int ni() {\n return in.nextInt();\n }\n\n void pn(long zx) {\n out.println(zx);\n }\n\n class Tuple {\n long d;\n int x;\n int y;\n int z;\n\n Tuple(long d, int x, int y, int z) {\n this.d = d;\n this.x = x;\n this.y = y;\n this.z = z;\n }\n\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new UnknownError();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new UnknownError();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public String next() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n StringBuffer res = new StringBuffer();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n\n return res.toString();\n }\n\n private boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "977a4a48c2f4d6f7e39399d62c1cafee", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.FileReader;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.math.BigInteger;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Locale;\nimport java.util.StringTokenizer;\n\npublic class C {\n \n final int p = 1000000007;\n \n void do_solve() {\n int n = nextInt();\n int k = nextInt();\n k /= 50;\n \n long c[][] = new long[100][100];\n for(int i = 0; i < 100; i++) {\n c[i][0] = 1;\n if (i == 0){\n continue;\n }\n for(int j = 1; j < 100; j++) {\n c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % p;\n }\n }\n \n int a = 0, b = 0;\n for(int i = 0; i < n; i++) {\n int r = nextInt();\n if (r == 50) {\n a++;\n } else {\n b++;\n }\n }\n \n long ans_d[][] = new long[a + 1][b + 1];\n long ans_c[][] = new long[a + 1][b + 1];\n \n int inf = 1 << 20;\n \n for(int i = 0; i <= a; i++)\n for(int j = 0; j <= b; j++) {\n ans_d[i][j] = inf;\n ans_c[i][j] = 0;\n }\n \n ArrayList<Integer> nowa = new ArrayList<>(0);\n ArrayList<Integer> nowb = new ArrayList<>(0);\n \n nowa.add(0);\n nowb.add(0);\n ans_d[0][0] = -1;\n ans_c[0][0] = 1;\n \n while (nowa.size() > 0) {\n int x = nowa.remove(0);\n int y = nowb.remove(0);\n \n for(int i = 0; i <= x; i++) {\n for(int j = 0; j <= y; j++) {\n if (i == 0 && j == 0 && !(x == 0 && y == 0)) \n continue;\n if (i + 2 * j > k)\n break;\n \n long ans = (c[x][i] * c[y][j]) % p; \n \n int q_a = a - x + i;\n int q_b = b - y + j;\n \n for(int i2 = 0; i2 <= q_a; i2++) {\n for(int j2 = 0; j2 <= q_b; j2++) {\n if (i2 == 0 && j2 == 0) \n continue;\n if (i2 + 2 * j2 > k)\n break;\n \n int nx = x - i + i2; \n int ny = y - j + j2; \n \n if (ans_d[nx][ny] >= ans_d[x][y] + 2) {\n long ans2 = (c[q_a][i2] * c[q_b][j2]) % p; \n ans_c[nx][ny] = (ans_c[nx][ny] + (ans_c[x][y] * ((ans * ans2) % p ) )) % p;\n }\n \n if (ans_d[nx][ny] > ans_d[x][y] + 2) {\n ans_d[nx][ny] = ans_d[x][y] + 2;\n nowa.add(nx);\n nowb.add(ny);\n }\n \n }\n }\n }\n }\n }\n \n out.println(ans_d[a][b] == inf ? -1 : ans_d[a][b]);\n out.println(ans_c[a][b]);\n }\n\n void mainProgram() {\n init(null);\n int test = 0;\n long T = System.currentTimeMillis();\n do_solve();\n System.err.println(\"Time on test \" + (test++) + \": \"\n + (System.currentTimeMillis() - T) + \" ms\");\n out.close();\n }\n\n static void debug(Object... o) {\n System.err.println(Arrays.deepToString(o));\n }\n\n void init(String filename) {\n Locale.setDefault(Locale.US);\n if (filename != null)\n try {\n in = new BufferedReader(new FileReader(filename + \".in\"));\n out = new PrintWriter(filename + \".out\");\n } catch (Exception e) {\n e.printStackTrace();\n filename = null;\n }\n if (filename == null) {\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n }\n st = new StringTokenizer(\"\");\n }\n\n static BufferedReader in;\n static StringTokenizer st = new StringTokenizer(\"\");\n static PrintWriter out;\n static long systemTime;\n\n public static void main(String[] args) {\n try {\n setTime();\n new C().mainProgram();\n printTime();\n printMemory();\n } catch (Exception e) {\n e.printStackTrace();\n }\n }\n\n static void setTime() {\n systemTime = System.currentTimeMillis();\n }\n\n static void printTime() {\n System.err.println(\"Time consumed: \"\n + (System.currentTimeMillis() - systemTime));\n }\n\n static void printMemory() {\n System.err.println(\"Memory consumed: \"\n + (Runtime.getRuntime().totalMemory() - Runtime.getRuntime()\n .freeMemory()) / 1000 + \"kb\");\n }\n\n boolean hasMoreTokens() {\n try {\n while (!st.hasMoreTokens()) {\n st = new StringTokenizer(in.readLine());\n }\n } catch (Exception e) {\n e.printStackTrace();\n }\n return st.hasMoreTokens();\n }\n\n String nextToken() {\n return hasMoreTokens() ? st.nextToken() : null;\n }\n\n Integer nextInt() {\n return Integer.parseInt(nextToken());\n }\n\n Double nextDouble() {\n return Double.parseDouble(nextToken());\n }\n\n Long nextLong() {\n return Long.parseLong(nextToken());\n }\n\n BigInteger add(BigInteger A, BigInteger B) {\n return A.add(B);\n }\n\n BigInteger mult(BigInteger A, BigInteger B) {\n return A.multiply(B);\n }\n\n BigInteger sub(BigInteger A, BigInteger B) {\n return A.subtract(B);\n }\n\n BigInteger div(BigInteger A, BigInteger B) {\n return A.divide(B);\n }\n\n BigInteger mi(BigInteger A) {\n return (BigInteger.ZERO).subtract(A);\n }\n\n BigInteger sq(BigInteger A) {\n return A.multiply(A);\n }\n\n BigInteger val(long a) {\n return BigInteger.valueOf(a);\n }\n\n int cmp(BigInteger a, BigInteger b) {\n return a.compareTo(b);\n }\n\n BigInteger gcd(BigInteger a, BigInteger b) {\n if (cmp(a, val(0)) < 0)\n a = mi(a);\n if (cmp(b, val(0)) < 0)\n b = mi(b);\n return a.gcd(b);\n }\n}\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "8378665285b210581639e099aad164d1", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.OutputStreamWriter;\nimport java.io.BufferedWriter;\nimport java.util.Comparator;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Random;\nimport java.io.Writer;\nimport java.util.Map;\nimport java.util.List;\nimport java.io.IOException;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.AbstractSet;\nimport java.util.ArrayList;\nimport java.util.Iterator;\nimport java.util.Set;\nimport java.util.AbstractMap;\nimport java.util.NoSuchElementException;\nimport java.math.BigInteger;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Egor Kulikov (egor@egork.net)\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tOutputWriter out = new OutputWriter(outputStream);\n\t\tTaskC solver = new TaskC();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskC {\n\tint[][] moves;\n\tlong[][] ways;\n\tint size;\n\tlong[][] c;\n\tstatic final long MOD = (long) (1e9 + 7);\n\tint maxHeavy, maxLight;\n\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n\t\tint count = in.readInt();\n\t\tc = IntegerUtils.generateBinomialCoefficients(count + 1, MOD);\n\t\tsize = in.readInt() / 50;\n\t\tint[] types = IOUtils.readIntArray(in, count);\n\t\tint light = 0;\n\t\tint heavy = 0;\n\t\tfor (int i : types) {\n\t\t\tif (i == 100)\n\t\t\t\theavy++;\n\t\t\telse\n\t\t\t\tlight++;\n\t\t}\n\t\tmaxHeavy = heavy;\n\t\tmaxLight = light;\n\t\tif (count == 1) {\n\t\t\tif (types[0] <= 50 * size) {\n\t\t\t\tout.printLine(1);\n\t\t\t\tout.printLine(1);\n\t\t\t} else {\n\t\t\t\tout.printLine(-1);\n\t\t\t\tout.printLine(0);\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\tmoves = new int[heavy + 1][light + 1];\n\t\tways = new long[heavy + 1][light + 1];\n\t\tArrayUtils.fill(moves, -1);\n\t\tArrayUtils.fill(ways, -1);\n\t\tint moves = calculateMoves(heavy, light);\n\t\tif (moves == Integer.MAX_VALUE / 2) {\n\t\t\tout.printLine(-1);\n\t\t\tout.printLine(0);\n\t\t\treturn;\n\t\t}\n\t\tout.printLine(moves);\n\t\tout.printLine(calculateWays(heavy, light));\n }\n\n\tprivate long calculateWays(int heavy, int light) {\n\t\tif (ways[heavy][light] != -1)\n\t\t\treturn ways[heavy][light];\n\t\tif (2 * heavy + light <= size)\n\t\t\treturn ways[heavy][light] = 1;\n\t\tways[heavy][light] = 0;\n\t\tfor (int i = 0; i <= heavy && 2 * i <= size; i++) {\n\t\t\tfor (int j = 0; j <= light && 2 * i + j <= size; j++) {\n\t\t\t\tif (i + j == 0)\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (int k = 0; k <= maxHeavy - heavy + i && 2 * k <= size; k++) {\n\t\t\t\t\tfor (int l = 0; l <= maxLight - light + j && 2 * k + l <= size; l++) {\n\t\t\t\t\t\tif (k + l == 0)\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\tif (calculateMoves(heavy - i + k, light - j + l) == moves[heavy][light] - 2)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tways[heavy][light] += calculateWays(heavy - i + k, light - j + l) * c[heavy][i] % MOD *\n\t\t\t\t\t\t\t\tc[light][j] % MOD * c[maxHeavy - heavy + i][k] % MOD * c[maxLight - light + j][l] % MOD;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn ways[heavy][light] %= MOD;\n\t}\n\n\tprivate int calculateMoves(int heavy, int light) {\n\t\tif (heavy > maxHeavy || light > maxLight)\n\t\t\treturn Integer.MAX_VALUE / 2;\n\t\tif (moves[heavy][light] != -1)\n\t\t\treturn moves[heavy][light];\n\t\tif (2 * heavy + light <= size)\n\t\t\treturn moves[heavy][light] = 1;\n\t\tmoves[heavy][light] = Integer.MAX_VALUE / 2;\n\t\tfor (int i = 0; i <= heavy && 2 * i <= size; i++) {\n\t\t\tfor (int j = 0; j <= light && 2 * i + j <= size; j++) {\n\t\t\t\tif (i == 0 && j <= 1)\n\t\t\t\t\tcontinue;\n\t\t\t\tif (i != 1 || j != 0) {\n\t\t\t\t\tint result = calculateMoves(heavy - i + 1, light - j);\n\t\t\t\t\tmoves[heavy][light] = Math.min(moves[heavy][light], result + 2);\n\t\t\t\t}\n\t\t\t\tint result = calculateMoves(heavy - i, light - j + 1);\n\t\t\t\tmoves[heavy][light] = Math.min(moves[heavy][light], result + 2);\n\t\t\t}\n\t\t}\n\t\treturn moves[heavy][light];\n\t}\n}\n\nclass InputReader {\n\n\tprivate InputStream stream;\n\tprivate byte[] buf = new byte[1024];\n\tprivate int curChar;\n\tprivate int numChars;\n\tprivate SpaceCharFilter filter;\n\n\tpublic InputReader(InputStream stream) {\n\t\tthis.stream = stream;\n\t}\n\n\tpublic int read() {\n\t\tif (numChars == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (curChar >= numChars) {\n\t\t\tcurChar = 0;\n\t\t\ttry {\n\t\t\t\tnumChars = stream.read(buf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (numChars <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buf[curChar++];\n\t}\n\n\tpublic int readInt() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tint res = 0;\n\t\tdo {\n\t\t\tif (c < '0' || c > '9')\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n\n\tpublic boolean isSpaceChar(int c) {\n\t\tif (filter != null)\n\t\t\treturn filter.isSpaceChar(c);\n\t\treturn isWhitespace(c);\n\t}\n\n\tpublic static boolean isWhitespace(int c) {\n\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t}\n\n\tpublic interface SpaceCharFilter {\n\t\tpublic boolean isSpaceChar(int ch);\n\t}\n}\n\nclass OutputWriter {\n\tprivate final PrintWriter writer;\n\n\tpublic OutputWriter(OutputStream outputStream) {\n\t\twriter = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n\t}\n\n\tpublic OutputWriter(Writer writer) {\n\t\tthis.writer = new PrintWriter(writer);\n\t}\n\n\tpublic void print(Object...objects) {\n\t\tfor (int i = 0; i < objects.length; i++) {\n\t\t\tif (i != 0)\n\t\t\t\twriter.print(' ');\n\t\t\twriter.print(objects[i]);\n\t\t}\n\t}\n\n public void printLine(Object...objects) {\n\t\tprint(objects);\n\t\twriter.println();\n\t}\n\n\tpublic void close() {\n\t\twriter.close();\n\t}\n\n\t}\n\nclass IntegerUtils {\n\n public static long[][] generateBinomialCoefficients(int n, long module) {\n\t\tlong[][] result = new long[n + 1][n + 1];\n\t\tif (module == 1)\n\t\t\treturn result;\n\t\tfor (int i = 0; i <= n; i++) {\n\t\t\tresult[i][0] = 1;\n\t\t\tfor (int j = 1; j <= i; j++) {\n\t\t\t\tresult[i][j] = result[i - 1][j - 1] + result[i - 1][j];\n\t\t\t\tif (result[i][j] >= module)\n\t\t\t\t\tresult[i][j] -= module;\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\n\t}\n\nclass IOUtils {\n\n\tpublic static int[] readIntArray(InputReader in, int size) {\n\t\tint[] array = new int[size];\n\t\tfor (int i = 0; i < size; i++)\n\t\t\tarray[i] = in.readInt();\n\t\treturn array;\n\t}\n\n\t}\n\nclass ArrayUtils {\n\n\tpublic static void fill(long[][] array, long value) {\n\t\tfor (long[] row : array)\n\t\t\tArrays.fill(row, value);\n\t}\n\n\tpublic static void fill(int[][] array, int value) {\n\t\tfor (int[] row : array)\n\t\t\tArrays.fill(row, value);\n\t}\n\n\t}\n\nabstract class IntCollection {\n\tpublic abstract IntIterator iterator();\n\tpublic abstract int size();\n\n\t}\n\ninterface IntIterator {\n\tpublic int value() throws NoSuchElementException;\n\t/*\n\t * @throws NoSuchElementException only if iterator already invalid\n\t */\n\tpublic void advance() throws NoSuchElementException;\n\tpublic boolean isValid();\n}\n\nabstract class IntList extends IntCollection {\n\tprivate static final int INSERTION_THRESHOLD = 8;\n\n\tpublic abstract int get(int index);\n\tpublic abstract void set(int index, int value);\n\n\tpublic IntIterator iterator() {\n\t\treturn new IntIterator() {\n\t\t\tprivate int size = size();\n\t\t\tprivate int index = 0;\n\n\t\t\tpublic int value() throws NoSuchElementException {\n\t\t\t\tif (!isValid())\n\t\t\t\t\tthrow new NoSuchElementException();\n\t\t\t\treturn get(index);\n\t\t\t}\n\n\t\t\tpublic void advance() throws NoSuchElementException {\n\t\t\t\tif (!isValid())\n\t\t\t\t\tthrow new NoSuchElementException();\n\t\t\t\tindex++;\n\t\t\t}\n\n\t\t\tpublic boolean isValid() {\n\t\t\t\treturn index < size;\n\t\t\t}\n\t\t};\n\t}\n\n\tprivate void swap(int first, int second) {\n\t\tif (first == second)\n\t\t\treturn;\n\t\tint temp = get(first);\n\t\tset(first, get(second));\n\t\tset(second, temp);\n\t}\n\n\tpublic IntSortedList inPlaceSort(IntComparator comparator) {\n\t\tquickSort(0, size() - 1, size(), comparator);\n\t\treturn new IntSortedArray(this, comparator);\n\t}\n\n\tprivate void quickSort(int from, int to, int remaining, IntComparator comparator) {\n\t\tif (to - from < INSERTION_THRESHOLD) {\n\t\t\tinsertionSort(from, to, comparator);\n\t\t\treturn;\n\t\t}\n\t\tif (remaining == 0) {\n\t\t\theapSort(from, to, comparator);\n\t\t\treturn;\n\t\t}\n\t\tremaining >>= 1;\n\t\tint pivotIndex = (from + to) >> 1;\n\t\tint pivot = get(pivotIndex);\n\t\tswap(pivotIndex, to);\n\t\tint storeIndex = from;\n\t\tint equalIndex = to;\n\t\tfor (int i = from; i < equalIndex; i++) {\n\t\t\tint value = comparator.compare(get(i), pivot);\n\t\t\tif (value < 0)\n\t\t\t\tswap(storeIndex++, i);\n\t\t\telse if (value == 0)\n\t\t\t\tswap(--equalIndex, i--);\n\t\t}\n\t\tquickSort(from, storeIndex - 1, remaining, comparator);\n\t\tfor (int i = equalIndex; i <= to; i++)\n\t\t\tswap(storeIndex++, i);\n\t\tquickSort(storeIndex, to, remaining, comparator);\n\t}\n\n\tprivate void heapSort(int from, int to, IntComparator comparator) {\n\t\tfor (int i = (to + from - 1) >> 1; i >= from; i--)\n\t\t\tsiftDown(i, to, comparator, from);\n\t\tfor (int i = to; i > from; i--) {\n\t\t\tswap(from, i);\n\t\t\tsiftDown(from, i - 1, comparator, from);\n\t\t}\n\t}\n\n\tprivate void siftDown(int start, int end, IntComparator comparator, int delta) {\n\t\tint value = get(start);\n\t\twhile (true) {\n\t\t\tint child = ((start - delta) << 1) + 1 + delta;\n\t\t\tif (child > end)\n\t\t\t\treturn;\n\t\t\tint childValue = get(child);\n\t\t\tif (child + 1 <= end) {\n\t\t\t\tint otherValue = get(child + 1);\n\t\t\t\tif (comparator.compare(otherValue, childValue) > 0) {\n\t\t\t\t\tchild++;\n\t\t\t\t\tchildValue = otherValue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (comparator.compare(value, childValue) >= 0)\n\t\t\t\treturn;\n\t\t\tswap(start, child);\n\t\t\tstart = child;\n\t\t}\n\t}\n\n\tprivate void insertionSort(int from, int to, IntComparator comparator) {\n\t\tfor (int i = from + 1; i <= to; i++) {\n\t\t\tint value = get(i);\n\t\t\tfor (int j = i - 1; j >= from; j--) {\n\t\t\t\tif (comparator.compare(get(j), value) <= 0)\n\t\t\t\t\tbreak;\n\t\t\t\tswap(j, j + 1);\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic IntSortedList sort(IntComparator comparator) {\n\t\treturn new IntArray(this).inPlaceSort(comparator);\n\t}\n\n\t}\n\ninterface IntComparator {\n public static final IntComparator DEFAULT = new IntComparator() {\n public int compare(int first, int second) {\n if (first < second)\n return -1;\n if (first > second)\n return 1;\n return 0;\n }\n };\n\n\tpublic int compare(int first, int second);\n}\n\nabstract class IntSortedList extends IntList {\n\tprotected final IntComparator comparator;\n\n\tprotected IntSortedList(IntComparator comparator) {\n\t\tthis.comparator = comparator;\n\t}\n\n\tpublic void set(int index, int value) {\n\t\tthrow new UnsupportedOperationException();\n\t}\n\n\tpublic IntSortedList inPlaceSort(IntComparator comparator) {\n\t\tif (comparator == this.comparator)\n\t\t\treturn this;\n\t\tthrow new UnsupportedOperationException();\n\t}\n\n\tpublic IntSortedList sort(IntComparator comparator) {\n\t\tif (comparator == this.comparator)\n\t\t\treturn this;\n\t\treturn super.sort(comparator);\n\t}\n\n\tprotected void ensureSorted() {\n\t\tint size = size();\n\t\tif (size == 0)\n\t\t\treturn;\n\t\tint last = get(0);\n\t\tfor (int i = 1; i < size; i++) {\n\t\t\tint current = get(i);\n\t\t\tif (comparator.compare(last, current) > 0)\n\t\t\t\tthrow new IllegalArgumentException();\n\t\t\tlast = current;\n\t\t}\n\t}\n\n\t}\n\nclass IntArray extends IntList {\n\tprivate final int[] array;\n\n\tpublic IntArray(int[] array) {\n\t\tthis.array = array;\n\t}\n\n\tpublic IntArray(IntCollection collection) {\n\t\tarray = new int[collection.size()];\n\t\tint i = 0;\n\t\tfor (IntIterator iterator = collection.iterator(); iterator.isValid(); iterator.advance())\n\t\t\tarray[i++] = iterator.value();\n\t}\n\n\tpublic int get(int index) {\n\t\treturn array[index];\n\t}\n\n\tpublic void set(int index, int value) {\n\t\tarray[index] = value;\n\t}\n\n\tpublic int size() {\n\t\treturn array.length;\n\t}\n\n\t}\n\nclass IntSortedArray extends IntSortedList {\n\tprivate final int[] array;\n\n\tpublic IntSortedArray(int[] array) {\n\t\tthis(array, IntComparator.DEFAULT);\n\t}\n\n\tpublic IntSortedArray(IntCollection collection) {\n\t\tthis(collection, IntComparator.DEFAULT);\n\t}\n\n\tpublic IntSortedArray(int[] array, IntComparator comparator) {\n\t\tsuper(comparator);\n\t\tthis.array = array;\n\t\tensureSorted();\n\t}\n\n\tpublic IntSortedArray(IntCollection collection, IntComparator comparator) {\n\t\tsuper(comparator);\n\t\tarray = new int[collection.size()];\n\t\tint i = 0;\n\t\tfor (IntIterator iterator = collection.iterator(); iterator.isValid(); iterator.advance())\n\t\t\tarray[i++] = iterator.value();\n\t\tensureSorted();\n\t}\n\n\tpublic int get(int index) {\n\t\treturn array[index];\n\t}\n\n\tpublic int size() {\n\t\treturn array.length;\n\t}\n}\n\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "b0a6046a39e2f9011999b4350bfb7ebc", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\tstatic Scanner in; static int next() throws Exception {return in.nextInt();}\n\tstatic PrintWriter out;\n//\tstatic StreamTokenizer in; static int next() throws Exception {in.nextToken(); return (int) in.nval;}\n//\tstatic BufferedReader in;\n\n\tstatic int mod = 1000000007;\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tin = new Scanner(System.in);\n//\t\tin = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));\n//\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\n\t\tint n = next();\n\t\tint k = next() / 50;\n\n\t\tint[] x = new int[n];\n\t\tfor (int i = 0; i < n; i++) x[i] = next() / 50;\n\n\t\tint count1 = 0;\n\t\tint count2 = 0;\n\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tif (x[i] == 1) count1++;\n\t\t\telse count2++;\n//\t\tout.println(k + \" \" + count1 + \" \" + count2) ;\n\n\t\tif ((k == 0) ||\n\t\t\t(k == 1 && (count2 > 0 || count1 > 1)) ||\n\t\t\t(k == 2 && (count2 > 0 && count1 < 2)) ||\n\t\t\t(k == 3 && (count1 < 1))) {\n\t\t\tout.println(-1);\n\t\t\tout.println(0);\n\t\t\tout.close();\n\t\t\treturn;\n\t\t}\n\n\t\tint[][] c = new int[100][100];\n\t\tfor (int i = 0; i < 100; i++) c[i][0] = c[i][i] = 1;\n\t\tfor (int i = 0; i < 100; i++)\n\t\t\tfor (int j = 1; j < i; j++) c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % mod;\n\n\t\tlong[][] count = new long[count1 + 1][count2 + 1];\n\t\tcount[0][0] = 1;\n\t\tfor (int iter = 0; iter < 1000; iter++) {\n\t\t\tlong[][] cnt = new long[count1 + 1][count2 + 1];\n\n\t\t\tif (iter % 2 == 0) {\n\t\t\t\tfor (int i = 0; i <= count1; i++)\n\t\t\t\t\tfor (int j = 0; j <= count2; j++)\n\t\t\t\t\t\tfor (int t = 0; t + i <= count1; t++)\n\t\t\t\t\t\t\tfor (int s = 0; s + j <= count2 && t + 2*s <= k; s++) if (t + s != 0) {\n\t\t\t\t\t\t\t\tcnt[i + t][j + s] = (cnt[i + t][j + s] + ((count[i][j] * c[count1 - i][t]) % mod * c[count2 - j][s]) % mod) % mod;\n\t\t\t\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tfor (int i = 0; i <= count1; i++)\n\t\t\t\t\tfor (int j = 0; j <= count2; j++)\n\t\t\t\t\t\tfor (int t = 0; t + i <= count1; t++)\n\t\t\t\t\t\t\tfor (int s = 0; s + j <= count2 && t + 2*s <= k; s++) if (t + s != 0) {\n\t\t\t\t\t\t\t\tcnt[i][j] = (cnt[i][j] + ((count[i + t][j + s] * c[i + t][t]) % mod * c[s + j][s]) % mod) % mod;\n\t\t\t\t\t\t\t}\t\t\t\t\n\t\t\t}\n\t\t\tcount = cnt;\n\t\t\tif (count[count1][count2] != 0) {\n\t\t\t\tout.println(iter + 1);\n\t\t\t\tout.println(count[count1][count2]);\n\t\t\t\tbreak;\n\t\t\t}\n//\t\t\tout.println(count[0][0] + \" \" + count[1][0]);\n\t\t}\n\n\n\n\t\tout.close();\n\t}\n}", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "b0439d3c4eabbccf89ba19e9bbdfb83f", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.Reader;\nimport java.io.Writer;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Niyaz Nigmatullin\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tFastScanner in = new FastScanner(inputStream);\n\t\tFastPrinter out = new FastPrinter(outputStream);\n\t\tTaskC solver = new TaskC();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskC {\n\n\n static final int MOD = 1000000007;\n static long[][] C;\n static {\n C = new long[55][55];\n for (int i = 0; i < C.length; i++) {\n C[i][0] = 1;\n for (int j = 1; j <= i; j++) {\n C[i][j] = C[i - 1][j - 1] + C[i - 1][j];\n if (C[i][j] >= MOD) {\n C[i][j] -= MOD;\n }\n }\n }\n }\n public void solve(int testNumber, FastScanner in, FastPrinter out) {\n int n = in.nextInt();\n int k = in.nextInt();\n k /= 50;\n int cn1 = 0;\n int cn2 = 0;\n for (int i = 0; i < n; i++) {\n if (in.nextInt() == 50) {\n ++cn1;\n } else {\n ++cn2;\n }\n }\n int[][] tries = new int[cn1 + 1][cn2 + 1];\n int[][] ways = new int[cn1 + 1][cn2 + 1];\n for (int[] d : tries) {\n Arrays.fill(d, Integer.MAX_VALUE);\n }\n for (int i = 0; i <= cn1; i++) {\n for (int j = 0; j <= cn2; j++) {\n if (i + j == 0) {\n continue;\n }\n if (i + 2 * j <= k) {\n tries[i][j] = 1;\n ways[i][j] = (int) (C[cn1][i] * C[cn2][j] % MOD);\n }\n }\n }\n boolean changed = true;\n int q = 1;\n while (changed) {\n changed = false;\n for (int c1 = 0; c1 <= cn1; c1++) {\n for (int c2 = 0; c2 <= cn2; c2++) {\n int ct = tries[c1][c2];\n if (ct != q) {\n continue;\n }\n long cw = ways[c1][c2];\n for (int b1 = 0; b1 <= c1 && b1 <= c1; b1++) {\n for (int b2 = 0; b2 <= c2 && b2 <= c2; b2++) {\n if (b1 + b2 == 0 || b1 + b2 * 2 > k) {\n continue;\n }\n long dw = (cw * C[c1][b1] % MOD * C[c2][b2] % MOD);\n int left1 = cn1 - c1 + b1;\n int left2 = cn2 - c2 + b2;\n for (int i = 0; i <= left1; i++) {\n for (int j = 0; j <= left2; j++) {\n if (i + j == 0) continue;\n if (i + 2 * j > k) {\n continue;\n }\n int d1 = c1 - b1 + i;\n int d2 = c2 - b2 + j;\n if (tries[d1][d2] > ct + 2) {\n tries[d1][d2] = ct + 2;\n ways[d1][d2] = (int) (dw * C[left1][i] % MOD * C[left2][j] % MOD);\n changed = true;\n } else if (tries[d1][d2] == ct + 2) {\n ways[d1][d2] = (int) ((ways[d1][d2] + dw * C[left1][i] % MOD * C[left2][j] % MOD) % MOD);\n }\n }\n }\n }\n }\n }\n }\n q += 2;\n }\n if (tries[cn1][cn2] == Integer.MAX_VALUE) {\n out.println(-1);\n out.println(0);\n return;\n }\n out.println(tries[cn1][cn2]);\n out.println(ways[cn1][cn2]);\n }\n\n}\n\nclass FastScanner extends BufferedReader {\n\n boolean isEOF;\n\n public FastScanner(InputStream is) {\n super(new InputStreamReader(is));\n }\n\n public int read() {\n try {\n int ret = super.read();\n if (isEOF && ret < 0) {\n throw new InputMismatchException();\n }\n isEOF = ret == -1;\n return ret;\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n }\n\n static boolean isWhiteSpace(int c) {\n return c >= 0 && c <= 32;\n }\n\n public int nextInt() {\n int c = read();\n while (isWhiteSpace(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int ret = 0;\n while (c >= 0 && !isWhiteSpace(c)) {\n if (c < '0' || c > '9') {\n throw new NumberFormatException(\"digit expected \" + (char) c\n + \" found\");\n }\n ret = ret * 10 + c - '0';\n c = read();\n }\n return ret * sgn;\n }\n\n }\n\nclass FastPrinter extends PrintWriter {\n\n public FastPrinter(OutputStream out) {\n super(out);\n }\n\n public FastPrinter(Writer out) {\n super(out);\n }\n\n\n}\n\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "1fdce5dbf87a342a29d302a307b194ef", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.Collection;\nimport java.io.IOException;\nimport java.util.Queue;\nimport java.util.LinkedList;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n CGregAndFriends solver = new CGregAndFriends();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class CGregAndFriends {\n long mod = 1000000007;\n long INF = (long) 1e18 + 1;\n PrintWriter out;\n InputReader in;\n long[][] nCr = new long[100][100];\n\n long f(long p, int a, int b, int c, int d) {\n p *= nCr[a][b];\n p %= mod;\n p *= nCr[c][d];\n p %= mod;\n return p;\n }\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n this.out = out;\n this.in = in;\n int n = ni();\n int K = ni();\n int cnt1 = 0, cnt2 = 0;\n int i = 0, j = 0, k = 0;\n for (i = 0; i < 100; i++) {\n for (j = 0; j <= i; j++) {\n if (j == 0 || j == i)\n nCr[i][j] = 1;\n else\n nCr[i][j] = (nCr[i - 1][j] + nCr[i - 1][j - 1]) % mod;\n }\n }\n for (i = 0; i < n; i++) {\n if (ni() == 50)\n cnt1++;\n else\n cnt2++;\n }\n long[][][] dist = new long[200][200][2];\n long[][][] dp = new long[200][200][2];\n for (i = 0; i < 200; i++) {\n for (j = 0; j < 200; j++)\n Arrays.fill(dist[i][j], INF);\n }\n dist[0][0][0] = 0;\n dp[0][0][0] = 1;\n Queue<Tuple> pq = new LinkedList<Tuple>();\n pq.add(new Tuple(0, 0, 0, 0));\n while (pq.size() > 0) {\n Tuple curr = pq.poll();\n int x = curr.x;\n int y = curr.y;\n int z = curr.z;\n long d = dist[x][y][z];\n if (z == 0) {\n int rem_x = cnt1 - x;\n int rem_y = cnt2 - y;\n for (i = 0; i <= rem_x; i++) {\n for (j = 0; j <= rem_y; j++) {\n if (i + j == 0)\n continue;\n if (i * 50 + j * 100 > K)\n break;\n if (dist[i + x][j + y][z ^ 1] >= d + 1) {\n if (dist[i + x][j + y][z ^ 1] > d + 1) {\n dist[i + x][j + y][z ^ 1] = d + 1;\n pq.add(new Tuple(dist[i + x][j + y][z ^ 1], i + x, j + y, z ^ 1));\n dp[i + x][j + y][z ^ 1] += f(dp[x][y][z], rem_x, i, rem_y, j);\n dp[i + x][j + y][z ^ 1] %= mod;\n } else {\n dp[i + x][j + y][z ^ 1] += f(dp[x][y][z], rem_x, i, rem_y, j);\n dp[i + x][j + y][z ^ 1] %= mod;\n }\n }\n }\n }\n } else {\n int rem_x = x;\n int rem_y = y;\n for (i = 0; i <= rem_x; i++) {\n for (j = 0; j <= rem_y; j++) {\n if (i + j == 0)\n continue;\n if (i * 50 + j * 100 > K)\n break;\n if (dist[x - i][y - j][z ^ 1] >= d + 1) {\n if (dist[x - i][y - j][z ^ 1] > d + 1) {\n dist[x - i][y - j][z ^ 1] = d + 1;\n pq.add(new Tuple(dist[x - i][y - j][z ^ 1], x - i, y - j, z ^ 1));\n dp[x - i][y - j][z ^ 1] += f(dp[x][y][z], rem_x, i, rem_y, j);\n dp[x - i][y - j][z ^ 1] %= mod;\n } else {\n dp[x - i][y - j][z ^ 1] += f(dp[x][y][z], rem_x, i, rem_y, j);\n dp[x - i][y - j][z ^ 1] %= mod;\n }\n }\n }\n }\n }\n }\n if (dist[cnt1][cnt2][1] == INF)\n pn(-1);\n else\n pn(dist[cnt1][cnt2][1]);\n pn(dp[cnt1][cnt2][1]);\n }\n\n int ni() {\n return in.nextInt();\n }\n\n void pn(long zx) {\n out.println(zx);\n }\n\n class Tuple {\n long d;\n int x;\n int y;\n int z;\n\n Tuple(long d, int x, int y, int z) {\n this.d = d;\n this.x = x;\n this.y = y;\n this.z = z;\n }\n\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new UnknownError();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new UnknownError();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public String next() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n StringBuffer res = new StringBuffer();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n\n return res.toString();\n }\n\n private boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "e8a219d7d6242293cd775a246a9753f2", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Pr295C {\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew Pr295C().run();\n\t}\n\n\tBufferedReader in;\n\tPrintWriter out;\n\tStringTokenizer st;\n\n\tString nextToken() throws IOException {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\tst = new StringTokenizer(in.readLine());\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tvoid run() throws IOException {\n\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out, true);\n\t\tsolve();\n\t\tout.flush();\n\t}\n\n\tfinal int mod = 1000000007;\n\tint[][][] d;\n\tlong[][][] cnt;\n\tint A;\n\tint B;\n\tint k;\n\tint[][] c;\n\n\tvoid smthLikeBfs() {\n\t\tLinkedList<Integer> typeQ = new LinkedList<Integer>();\n\t\tLinkedList<Integer> numAQ = new LinkedList<Integer>();\n\t\tLinkedList<Integer> numBQ = new LinkedList<Integer>();\n\t\tfor (int i = 0; i < 2; i++) {\n\t\t\tfor (int j = 0; j < A; j++) {\n\t\t\t\tfor (int z = 0; z < B; z++) {\n\t\t\t\t\td[i][j][z] = Integer.MAX_VALUE;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tboolean[][][] used = new boolean[2][A + 1][B + 1];\n\t\td[0][A][B] = 0;\n\t\tcnt[0][A][B] = 1;\n\t\tused[0][A][B] = true;\n\t\ttypeQ.add(0);\n\t\tnumAQ.add(A);\n\t\tnumBQ.add(B);\n\t\twhile (!typeQ.isEmpty()) {\n\t\t\tint curt = typeQ.pollFirst();\n\t\t\tint cura = numAQ.pollFirst();\n\t\t\tint curb = numBQ.pollFirst();\n\t\t\tfor (int x = 0; x <= cura; x++) {\n\t\t\t\tfor (int y = 0; y <= curb; y++) {\n\t\t\t\t\tif (50 * x + y * 100 <= k && x + y > 0) {\n\t\t\t\t\t\tif (!used[(curt + 1) % 2][A - cura + x][B - curb + y]) {\n\t\t\t\t\t\t\td[(curt + 1) % 2][A - cura + x][B - curb + y] = d[curt][cura][curb] + 1;\n\t\t\t\t\t\t\tused[(curt + 1) % 2][A - cura + x][B - curb + y] = true;\n\t\t\t\t\t\t\ttypeQ.add((curt + 1) % 2);\n\t\t\t\t\t\t\tnumAQ.add(A - cura + x);\n\t\t\t\t\t\t\tnumBQ.add(B - curb + y);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (d[(curt + 1) % 2][A - cura + x][B - curb + y] == d[curt][cura][curb] + 1) {\n\t\t\t\t\t\t\tcnt[(curt + 1) % 2][A - cura + x][B - curb + y] += (((cnt[curt][cura][curb] * c[cura][x]) % mod) * c[curb][y])\n\t\t\t\t\t\t\t\t\t% mod;\n\t\t\t\t\t\t\tcnt[(curt + 1) % 2][A - cura + x][B - curb + y] %= mod;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid solve() throws IOException {\n\t\tint n = nextInt();\n\t\tk = nextInt();\n\t\tA = 0; // number of thin people\n\t\tB = 0; // number of fat people\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (nextInt() == 50) {\n\t\t\t\tA++;\n\t\t\t} else {\n\t\t\t\tB++;\n\t\t\t}\n\t\t}\n\t\td = new int[2][A + 1][B + 1]; // type, how many As, how many Bs\n\t\tcnt = new long[2][A + 1][B + 1];\n\t\tc = new int[n + 1][n + 1];\n\t\tfor (int i = 0; i <= n; i++) {\n\t\t\tfor (int j = 0; j <= i; j++) {\n\t\t\t\tif (j == 0) {\n\t\t\t\t\tc[i][j] = 1;\n\t\t\t\t} else if (i == j) {\n\t\t\t\t\tc[i][j] = 1;\n\t\t\t\t} else {\n\t\t\t\t\tc[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % mod;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tsmthLikeBfs();\n\t\tif (cnt[1][A][B] == 0) {\n\t\t\tout.println(-1);\n\t\t\tout.println(0);\n\t\t\treturn;\n\t\t}\n\t\tout.println(d[1][A][B]);\n\t\tout.println(cnt[1][A][B]);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "80b0a13f2ecffe09f75fb11d18225133", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import static java.lang.System.*;\nimport static java.lang.Math.*;\n\nimport java.lang.reflect.Array;\nimport java.util.*;\nimport java.util.Map.Entry;\n\npublic class C295 {\n public static Scanner sc=new Scanner(in);\n //public static Random sc=new Random();\n\n class Node{\n public int id;\n public int s,b,lr;\n public int val;\n public Node(int _s,int _b,int _lr){\n s=_s;b=_b;lr=_lr;\n }\n// public String toString() {\n// return val+\" (\"+id+\")=>\"+link;\n// }\n }\n class Edge{\n public int from;\n public int to;\n public int c;\n public Edge(int from,int to){\n this.from=from;\n this.to=to;\n }\n public Edge(int from,int to,int c){\n this(from,to);\n this.c=c;\n }\n public String toString() {\n return from+\"→\"+to;\n }\n }\n\n //nCr\n public long[][] comb(int n){\n long[][] comb=new long[n][n];\n for(int i=0;i<n;i++){\n comb[i][0]=comb[i][i]=1;\n for(int j=1;j<=i;j++){\n comb[i][j]=(j==0)?1:(comb[i-1][j]+comb[i-1][j-1])%mod;\n }\n }\n return comb;\n }\n\n final int mod=1000000007;\n void run() throws RuntimeException{\n final int n=sc.nextInt(),k=sc.nextInt();\n\n long[][] c=comb(n+1);\n\n int s=0,b=0;\n for(int i=0;i<n;i++){\n int v=sc.nextInt();\n if(v==50)\n s++;\n else b++;\n }\n\n Node[][][] nodes=new Node[s+1][b+1][2];\n long[][][] count=new long[s+1][b+1][2];\n boolean[][][] passed=new boolean[s+1][b+1][2];\n\n\n\n count[s][b][0]=1;\n Queue<Node> que=new LinkedList<>();\n for(int si=0;si<=s;si++)for(int bi=0;bi<=b;bi++){\n nodes[si][bi][0]=new Node(si,bi,0);\n nodes[si][bi][1]=new Node(si,bi,1);\n }\n\n que.add(nodes[s][b][0]);\n passed[s][b][0]=true;\n int turn=0;\n while(!que.isEmpty()){\n Queue<Node> tmp=new LinkedList<>();\n while(!que.isEmpty()){\n Node node=que.poll();\n int lr=node.lr==0?1:0;\n for(int si=0;si<=s;si++)for(int bi=0;bi<=b;bi++){\n if(passed[si][bi][lr])continue;\n if(node.s==si && node.b==bi)continue;\n if(node.lr==0 && node.s>=si && node.b>=bi && abs(node.s-si)*50+abs(node.b-bi)*100<=k){//l to r\n if(!tmp.contains(nodes[si][bi][lr]))tmp.add(nodes[si][bi][lr]);\n count[si][bi][lr]=(count[si][bi][lr]+(c[node.s][abs(node.s-si)]*c[node.b][abs(node.b-bi)]%mod*count[node.s][node.b][node.lr]%mod))%mod;\n }\n if(node.lr==1 && node.s<=si && node.b<=bi && abs(node.s-si)*50+abs(node.b-bi)*100<=k){//r to l\n if(!tmp.contains(nodes[si][bi][lr]))tmp.add(nodes[si][bi][lr]);\n count[si][bi][lr]=(count[si][bi][lr]+(c[s-node.s][abs(node.s-si)]*c[b-node.b][abs(node.b-bi)]%mod*count[node.s][node.b][node.lr]%mod))%mod;\n }\n }\n }\n for(Node node:tmp)passed[node.s][node.b][node.lr]=true;\n\n que=tmp;\n turn++;\n if(passed[0][0][1]){//end\n ln(turn);\n ln(count[0][0][1]);\n return;\n }\n }\n ln(-1);\n ln(0);\n }\n\n public static void main(String[] args) {\n new C295().run();\n }\n\n\n //output lib\n static final String br=System.getProperty(\"line.separator\");\n static final String[] asep=new String[]{\"\",\" \",br,br+br};\n static String str(boolean o){\n return o?\"YES\":\"NO\";\n }\n static <K,V> String str(Map<K, V> map){\n StringBuilder sb=new StringBuilder();\n boolean isFirst=true;\n for(Entry<K,V> set:map.entrySet()){\n if(!isFirst)sb.append(br);\n sb.append(str(set.getKey())).append(\":\").append(str(set.getValue()));\n isFirst=false;\n }\n return sb.toString();\n }\n static <E> String str(Collection<E> list){\n StringBuilder sb=new StringBuilder();\n boolean isFirst=true;\n for(E e:list){\n if(!isFirst)sb.append(\" \");\n sb.append(str(e));\n isFirst=false;\n }\n return sb.toString();\n }\n static String str(Object o){\n int depth=_getArrayDepth(o);\n if(depth>0)return _strArray(o,depth);\n return o.toString();\n }\n static int _getArrayDepth(Object o){\n if(!o.getClass().isArray() || Array.getLength(o)==0) return 0;\n return 1+_getArrayDepth(Array.get(o,0));\n }\n //depth ex A[10]…1 A[10][10]…2 exception A[0]…0 A[10][0]…1 A[0][0]…0\n static String _strArray(Object o,int depth){\n if(depth==0) return str(o);\n StringBuilder sb=new StringBuilder();\n for(int i=0,len=Array.getLength(o);i<len;i++){\n if(i!=0)sb.append(asep[depth]);\n sb.append(_strArray(Array.get(o,i),depth-1));\n }\n return sb.toString();\n }\n static void pr(Object... os){\n boolean isFirst=true;\n for(Object o:os){\n if(!isFirst)out.print(\" \");\n out.print(o);\n isFirst=false;\n }\n }\n static void ln(){\n out.println();\n }\n static void ln(Object... os){\n for(Object o:os){\n pr(o);ln();\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "c981668532ba8c0255f605c52335e937", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.LinkedList;\nimport java.util.Queue;\nimport java.util.StringTokenizer;\n\n\npublic class C {\t\n\tBufferedReader reader;\n StringTokenizer tokenizer;\n PrintWriter out;\n \n public class State{\n \tint c50, c100, side, step;\n \tpublic State(int c50, int c100, int side, int step){\n \t\tthis.c50 = c50;\n \t\tthis.c100 = c100;\n \t\tthis.side = side;\n \t\tthis.step = step;\n \t}\n }\n \n long MODULAR = 1000000007;\n \n public static long[][] generateCombo(int MAX, long MOD) {\n\t\tlong[][] result = new long[MAX + 1][MAX + 1];\n\t\tif (MOD == 1)\n\t\t\treturn result;\n\t\tfor (int i = 0; i <= MAX; i++) {\n\t\t\tresult[i][0] = 1;\n\t\t\tfor (int j = 1; j <= i; j++) {\n\t\t\t\tresult[i][j] = result[i - 1][j - 1] + result[i - 1][j];\n\t\t\t\tif (result[i][j] >= MOD)\n\t\t\t\t\tresult[i][j] -= MOD;\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n \n\tpublic void solve() throws IOException {\t\t\t\t\n\t\tint N = nextInt();\n\t\tint K = nextInt();\n\t\tint c50 = 0; int c100 = 0;\n\t\tfor(int i = 0; i < N; i++)\n\t\t\tif( nextInt() == 50)\n\t\t\t\tc50++;\n\t\t\telse\n\t\t\t\tc100++;\n\t\t\n\t\tlong[][] c = generateCombo( Math.max(c50, c100), MODULAR);\n\t\t\n\t\tlong dp[][][] = new long[c50+1][c100+1][2];\n\t\tint[][][] visited = new int[c50+1][c100+1][2];\n\t\tfor(int i = 0; i <= c50; i++)\n\t\t\tfor(int j = 0; j <= c100; j++)\n\t\t\t\tArrays.fill(visited[i][j], -1);\n\t\t\n\t\tdp[c50][c100][0] = 1;\n\t\tState state = new State( c50, c100, 0, 0 );\n\t\tQueue<State> queue = new LinkedList<State>();\n\t\tqueue.add(state);\n\t\tvisited[c50][c100][0] = 0;\n\t\t\n\t\twhile( !queue.isEmpty() ){\n\t\t\tState current = queue.poll();\t\n\t\t\t\n//\t\t\tSystem.out.println( current.c50 + \", \" + current.c100 + \", \" + current.side + \", \" + current.step );\n\t\t\t\n\t\t\tint iTo = current.side == 0? current.c50: c50 - current.c50;\n\t\t\tint jTo = current.side == 0? current.c100: c100 - current.c100;\n\t\t\t\n\t\t\tfor(int i = 0; i <= iTo; i++){\n\t\t\t\tfor(int j = 0; j <= jTo; j++){\n\t\t\t\t\tif( i == 0 && j == 0 ) continue;\n\t\t\t\t\tif( i * 50 + j * 100 > K ) continue;\n\t\t\t\t\t\n\t\t\t\t\tint newc50 = current.side == 0? current.c50 - i: current.c50 + i;\n\t\t\t\t\tint newc100 = current.side == 0? current.c100 - j: current.c100 + j;\n\t\t\t\t\tint newside = 1 - current.side;\t\t\t\t\t \n\t\t\t\t\tint newstep = current.step + 1;\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\tlong ways = dp[current.c50][current.c100][current.side];\n\t\t\t\t\tif( current.side == 0 ){\n\t\t\t\t\t\tways = ways * c[current.c50][i] % MODULAR;\n\t\t\t\t\t\tways = ways * c[current.c100][j] % MODULAR;\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\tways = ways * c[c50 - current.c50][i] % MODULAR;\n\t\t\t\t\t\tways = ways * c[c100 - current.c100][j] % MODULAR;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tif( visited[newc50][newc100][newside] == -1 ){\n\t\t\t\t\t\tdp[newc50][newc100][newside] = ways;\n\t\t\t\t\t\tvisited[newc50][newc100][newside] = newstep;\n\t\t\t\t\t\tqueue.add( new State(newc50, newc100, newside, newstep) );\n\t\t\t\t\t}\n\t\t\t\t\telse if ( visited[newc50][newc100][newside] == newstep ){\n\t\t\t\t\t\tdp[newc50][newc100][newside] += ways;\n\t\t\t\t\t\tdp[newc50][newc100][newside] %= MODULAR;\n\t\t\t\t\t}\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t}\t\t\n\t\t\n\t\tout.println( visited[0][0][1] );\n\t\tout.println( dp[0][0][1] );\n\t}\n\t\n\t/**\n\t * @param args\n\t */\n\tpublic static void main(String[] args) {\n\t\tnew C().run();\n\t}\n\t\n\tpublic void run() {\n try {\n reader = new BufferedReader(new InputStreamReader(System.in));\n tokenizer = null;\n out = new PrintWriter(System.out);\n solve();\n reader.close();\n out.close();\n } catch (Exception e) {\n e.printStackTrace();\n System.exit(1);\n }\n }\n\n int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n String nextToken() throws IOException {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n tokenizer = new StringTokenizer(reader.readLine());\n }\n return tokenizer.nextToken();\n }\n\n}\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "7020208df5a2ad8de27e240825e154db", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.LinkedList;\nimport java.util.Map;\nimport java.util.Queue;\nimport java.util.Set;\n\npublic class Main {\n\tpublic static BufferedReader in;\n\tpublic static PrintWriter out;\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\n\t\tboolean showLineError = true;\n\t\tif (showLineError) {\n\t\t\tsolve();\n\t\t\tout.close();\n\t\t} else {\n\t\t\ttry {\n\t\t\t\tsolve();\n\t\t\t} catch (Exception e) {\n\t\t\t} finally {\n\t\t\t\tout.close();\n\t\t\t}\n\t\t}\n\n\t}\n\n\tstatic void debug(Object... os) {\n\t\tout.println(Arrays.deepToString(os));\n\t}\n\n\tprivate static int fifty;\n\tprivate static int hundred;\n\tprivate static final long MOD = 1000000007L;\n\t\n\tprivate static void solve() throws IOException {\n\t\tString[] line = nss();\n\t\tint n = Integer.parseInt(line[0]);\n\t\tint k = Integer.parseInt(line[1]);\n\t\tfifty = 0;\n\t\thundred = 0;\n\t\tline = nss();\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tif (line[i].equals(\"50\")) {\n\t\t\t\tfifty++;\n\t\t\t} else {\n\t\t\t\thundred++;\n\t\t\t}\n\t\tint m = Math.max(fifty+1, fifty+hundred+1);\n\t\tlong[][] choose = new long[m][m];\n\t\tfor(int i =0;i<m;i++){\n\t\t\tchoose[i][i]=1;\n\t\t\tchoose[i][0]=1;\n\t\t}\n\t\tfor(int i =1;i<m;i++)\n\t\t\tfor(int j =1;j<i;j++)\n\t\t\t\tchoose[i][j]=(choose[i-1][j]+choose[i-1][j-1])%MOD;\n\t\t\n\t\tQueue<State> q = new LinkedList<State>();\n\t\tMap<State, Integer> dist = new HashMap<State, Integer>(hundred * fifty * 4);\n\t\tMap<State, Long> ways = new HashMap<State, Long>(hundred * fifty * 4);\n\t\t\n\t\tdist.put(new State(fifty, hundred, 0), 0);\n\t\tq.add(new State(fifty, hundred, 0));\n\t\tways.put(new State(fifty, hundred, 0), 1L);\n\n\t\twhile (!q.isEmpty()) {\n\t\t\tState u = q.poll();\n\t\t\tif (u.this_side == 0) {\n\t\t\t\tfor (int f = 0; f <= u.fif; f++)\n\t\t\t\t\tfor (int h = 0; h <= u.hund; h++)\n\t\t\t\t\t\tif (f+h>0)\n\t\t\t\t\t\t\tif (50 * f + 100 * h <= k) {\n\t\t\t\t\t\t\t\tState next = new State(u.fif - f, u.hund - h, 1);\n\t\t\t\t\t\t\t\tif (!dist.containsKey(next)) {\n\t\t\t\t\t\t\t\t\tdist.put(next, dist.get(u) + 1);\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\tlong aux = (choose[u.fif][f] * choose[u.hund][h]) %MOD;\n\t\t\t\t\t\t\t\t\taux = (ways.get(u)*aux) %((long )MOD);\n\t\t\t\t\t\t\t\t\tways.put(next,aux);\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\tq.add(next);\n\t\t\t\t\t\t\t\t} else if (dist.get(next) == 1 + dist.get(u)) {\n\t\t\t\t\t\t\t\t\tlong aux = (choose[u.fif][f] * choose[u.hund][h]) %MOD;\n\t\t\t\t\t\t\t\t\taux = (ways.get(u)*aux) %((long )MOD);\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\tways.put(next, (aux+ ways.get(next))%MOD);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\n\t\t\t} else {\n\t\t\t\tfor (int f = u.fif; f <= fifty; f++)\n\t\t\t\t\tfor (int h = u.hund; h <= hundred; h++)\n\t\t\t\t\t\tif (f != u.fif || h != u.hund) {\n\t\t\t\t\t\t\tint weight = 50 * (f-u.fif) + 100 * (h-u.hund);\n\t\t\t\t\t\t\tif (weight <= k) {\n\t\t\t\t\t\t\t\tState next = new State(f, h, 0);\n\t\t\t\t\t\t\t\tif (!dist.containsKey(next)) {\n\t\t\t\t\t\t\t\t\tdist.put(next, dist.get(u) + 1);\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\tlong aux = ( choose[fifty - u.fif][f-u.fif] * choose[hundred - u.hund][h-u.hund])%MOD;\n\t\t\t\t\t\t\t\t\taux = (ways.get(u)*aux) %((long )MOD);\n\t\t\t\t\t\t\t\t\tways.put(next, aux);\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\tq.add(next);\n\t\t\t\t\t\t\t\t} else if (dist.get(next) == 1 + dist.get(u)) {\n\t\t\t\t\t\t\t\t\tlong aux = ( choose[fifty - u.fif][f-u.fif] * choose[hundred - u.hund][h-u.hund])%MOD;\n\t\t\t\t\t\t\t\t\taux = (ways.get(u)*aux) %((long )MOD);\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\tways.put(next, (ways.get(next) + aux)%MOD);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t}\n\t\t}\n\t\tState last = new State(0, 0, 1);\n\t\tout.println((!dist.containsKey(last)?-1:dist.get(last)));\n\t\tout.println((!dist.containsKey(last)?0:ways.get(last)));\n\n\t}\n\n\tprivate static class State {\n\t\tpublic final int fif;\n\t\tpublic final int hund;\n\t\tpublic final int this_side;\n\n\t\tpublic State(int fif, int hund, int this_side) {\n\t\t\tsuper();\n\t\t\tthis.fif = fif;\n\t\t\tthis.hund = hund;\n\t\t\tthis.this_side = this_side;\n\t\t}\n\n\t\t @Override\n\t\t public int hashCode() {\n\t\t return fif + (fifty +1)* hund + (fifty +1)* (hundred +1)* this_side;\n\t\t }\n\n\t\t@Override\n\t\tpublic String toString() {\n\t\t\treturn \"State [fif=\" + fif + \", hund=\" + hund + \", this_side=\"\n\t\t\t\t\t+ this_side + \"]\";\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean equals(Object obj) {\n\t\t\tif (this == obj)\n\t\t\t\treturn true;\n\t\t\tif (obj == null)\n\t\t\t\treturn false;\n\t\t\tif (getClass() != obj.getClass())\n\t\t\t\treturn false;\n\t\t\tState other = (State) obj;\n\t\t\tif (fif != other.fif)\n\t\t\t\treturn false;\n\t\t\tif (hund != other.hund)\n\t\t\t\treturn false;\n\t\t\tif (this_side != other.this_side)\n\t\t\t\treturn false;\n\t\t\treturn true;\n\t\t}\n\n\t}\n\n\tprivate static String[] nss() throws IOException {\n\t\treturn in.readLine().split(\" \");\n\t}\n\n\tprivate static int ni() throws NumberFormatException, IOException {\n\t\treturn Integer.parseInt(in.readLine());\n\t}\n}", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "1cf1d4cabe55ab83f22d05a2a36faeb0", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class Main {\n\n\tBufferedReader in;\n\tStringTokenizer str = null;\n\tPrintWriter out;\n\t\n\tprivate String next() throws Exception{\n\t\tif (str == null || !str.hasMoreElements())\n\t\t\tstr = new StringTokenizer(in.readLine());\n\t\treturn str.nextToken();\n\t}\n\t\n\tprivate int nextInt() throws Exception{\n\t\treturn Integer.parseInt(next());\n\t}\n\t\n\tprivate long nextLong() throws Exception{\n\t\treturn Long.parseLong(next());\n\t}\n\t\n\tprivate double nextDouble() throws Exception{\n\t\treturn Double.parseDouble(next());\n\t}\n\t\n\tint n,k;\n\tfinal int MOD = (int)1e9+7;\n\tlong c[][];\n\n\tprivate void binom(int m){\n\t\tc = new long[m][m];\n\t\tfor(int i=0;i<m;i++) \n\t\t\tc[i][0] = c[i][i] = 1;\n\n\t\tfor(int i=2;i<m;i++){\n\t\t\tfor(int j=1;j<=i;j++){\n\t\t\t\tc[i][j] = (c[i-1][j-1] + c[i-1][j]) % MOD;\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic void run() throws Exception {\n\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tn = nextInt();\n\t\tk = nextInt();\n\t\tint n50 = 0;\n\t\tint n100 = 0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tint x = nextInt();\n\t\t\tif (x == 50) n50++;\n\t\t\tif (x == 100) n100++;\n\t\t}\n\n\t\tbinom(52);\n\t\tint ans = bfs(n50, n100);\n\t\tif (ans != -1) {\n\t\t\tout.println(ans);\n\t\t\td = new int[n50+1][n100+1][ans+1];\n\t\t\tfor(int i=0;i<=n50;i++){\n\t\t\t\tfor(int j=0;j<=n100;j++){\n\t\t\t\t\tfor(int k=0;k<=ans;k++){\n\t\t\t\t\t\td[i][j][k] = -1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tint c = dfs(ans, n50, n100, 0, n50, n100);\n\t\t\tout.println(c);\n\t\t}else {\n\t\t\tout.println(-1);\n\t\t\tout.println(0);\n\t\t}\n\t\tout.close();\n\t}\n\n\tprivate int dfs(int rem, int left50, int left100, int state, int n50, int n100){\n\t\t//System.out.println(rem + \" \" + left50 + \" \" + left100+ \" \" + state);\n\t\tif (rem == 0) {\n\t\t\tif (state == 1 && left50 == n50 && left100 == n100)\n\t\t\t\treturn 1;\n\t\t\treturn 0;\n\t\t}\n\n\t\tlong ret = d[left50][left100][rem];\n\t\tif (ret != -1)\n\t\t\treturn (int)ret;\n\t\t\n\t\tret = 0;\n\t\tfor(int i=0;i<=left50;i++){\n\t\t\tfor(int j=0;j<=left100;j++){\n\t\t\t\tif ((i+j)>=1 && (i*50 + j*100) <= k) {\n\t\t\t\t\tlong t = dfs(rem-1, n50-left50+i, n100-left100+j, 1-state, n50, n100);\n\t\t\t\t\tt*=c[left50][i];\n\t\t\t\t\tt%=MOD;\n\t\t\t\t\tt*=c[left100][j];\n\t\t\t\t\tt%=MOD;\n\t\t\t\t\tret+=t;\n\t\t\t\t\tif (ret >= MOD)\n\t\t\t\t\t\tret-=MOD;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t/*\n\t\tif (state == 1) {\n\t\t\tfor(int i=0;i<=left50;i++){\n\t\t\t\tfor(int j=0;j<=left100;j++){\n\t\t\t\t\tif ((i+j)>=1 && (i*50 + j*100) <= k) {\n\t\t\t\t\t\tlong t = dfs(rem-1, n50-left50+i, n100-left100+j, 0, n50, n100);\n\t\t\t\t\t\tt*=c[left50][i];\n\t\t\t\t\t\tt%=MOD;\n\t\t\t\t\t\tt*=c[left100][j];\n\t\t\t\t\t\tt%=MOD;\n\t\t\t\t\t\tret+=t;\n\t\t\t\t\t\tif (ret >= MOD)\n\t\t\t\t\t\t\tret-=MOD;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}else {\n\t\t\tfor(int i=0;i<=left50;i++){\n\t\t\t\tfor(int j=0;j<=left100;j++){\n\t\t\t\t\tif ((i+j)>=1 && (i*50 + j*100) <= k) {\n\t\t\t\t\t\tlong t = dfs(rem-1, n50-left50+i, n100-left100+j, 1, n50, n100);\n\t\t\t\t\t\tt*=c[left50][i];\n\t\t\t\t\t\tt%=MOD;\n\t\t\t\t\t\tt*=c[left100][j];\n\t\t\t\t\t\tt%=MOD;\n\t\t\t\t\t\tret+=t;\n\t\t\t\t\t\tif (ret >= MOD)\n\t\t\t\t\t\t\tret-=MOD;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t*/\n\t\treturn d[left50][left100][rem] = (int)ret;\n\t}\n\n\tQueue<Integer> q;\n\tint [][][]d;\n\tprivate int bfs(int n50, int n100) {\n\n\t\tq = new LinkedList<Integer>();\n\t\tq.add(n50);\n\t\tq.add(n100);\n\t\tq.add(0);\n\n\t\td = new int[n50+1][n100+1][2];\n\t\tfor(int i=0;i<=n50;i++) {\n\t\t\tfor(int j=0;j<=n100;j++) {\n\t\t\t\tfor(int k=0;k<2;k++) {\n\t\t\t\t\td[i][j][k] = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\td[n50][n100][0] = 0;\n\n\t\twhile(q.size() > 0) {\n\n\t\t\tint left50 = q.poll();\n\t\t\tint left100 = q.poll();\n\t\t\tint state = q.poll();\n\n\t\t\t//System.out.println(left50 + \" \" + left100 + \" \" + state);\n\n\t\t\tif (left50 == n50 && left100 == n100 && state == 1){\n\t\t\t\treturn d[left50][left100][1];\n\t\t\t}\n\n\t\t\tif (state == 1) {\n\t\t\t\tint cur = d[left50][left100][1];\n\t\t\t\tif (left50 > 0 && k >= 50) {\n\t\t\t\t\tif (d[n50-left50+1][n100-left100][0] == -1) {\n\t\t\t\t\t\td[n50-left50+1][n100-left100][0] = cur + 1;\n\t\t\t\t\t\tq.add(n50-left50+1);\n\t\t\t\t\t\tq.add(n100-left100);\n\t\t\t\t\t\tq.add(0);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif (left100 > 0 && k >= 100) {\n\t\t\t\t\tif (d[n50-left50][n100-left100+1][0] == -1) {\n\t\t\t\t\t\td[n50-left50][n100-left100+1][0] = cur + 1;\n\t\t\t\t\t\tq.add(n50-left50);\n\t\t\t\t\t\tq.add(n100-left100+1);\n\t\t\t\t\t\tq.add(0);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}else {\n\n\t\t\t\tint cur = d[left50][left100][0];\n\t\t\t\tfor(int i=0;i<=left50;i++){\n\t\t\t\t\tfor(int j=0;j<=left100;j++){\n\t\t\t\t\t\tif ((i + j) >= 1 && (i*50 + j*100) <= k) {\n\t\t\t\t\t\t\tif (d[n50 - left50 + i][n100 - left100 + j][1] == -1) {\n\t\t\t\t\t\t\t\td[n50 - left50 + i][n100 - left100 + j][1] = cur + 1;\n\t\t\t\t\t\t\t\tq.add(n50 - left50 + i);\n\t\t\t\t\t\t\t\tq.add(n100 - left100 + j);\n\t\t\t\t\t\t\t\tq.add(1);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn -1;\n\t}\n\t\t\n\tpublic static void main(String[] args) throws Exception{\n\t\tnew Main().run();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "dp", "combinatorics"], "code_uid": "6d9bb1712fe02def5b1f868736ec7bf9", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.PrintWriter;\nimport java.util.ArrayDeque;\nimport java.util.Arrays;\nimport java.util.Queue;\nimport java.util.Scanner;\n\npublic class test {\n Scanner is;\n PrintWriter out;\n \n void solve()\n {\n int mod = 1000000007;\n int n = is.nextInt();\n int K = is.nextInt();\n \n int l=0,m=0;\n for(int i=0;i<n;i++){\n if(is.nextInt()==50)\n l++;\n else\n m++;\n }\n \n long[][][] d = new long[l+1][m+1][2];\n int[][][] rides = new int[l+1][m+1][2];\n \n long[][] nCk = new long[101][101];\n for(int i = 0;i <= 100;i++){\n nCk[i][0] = 1;\n for(int j = 1;j <= i;j++){\n nCk[i][j] = nCk[i-1][j] + nCk[i-1][j-1];\n if(nCk[i][j] >= mod)nCk[i][j] -= mod;\n }\n }\n \n for(int i=0;i<=l;i++)\n for(int j=0;j<=m;j++)\n rides[i][j][1] = rides[i][j][0] = -1;\n \n rides[l][m][0]=0;\n d[l][m][0]=1L;\n Queue<int[]> q = new ArrayDeque<int[]>();\n q.add(new int[]{l,m,0});\n while(!q.isEmpty()){\n int[] C = q.poll();\n int s1 = C[0],s2 =C[1];\n \n if(C[2]==0){\n for(int i=0;i<=s1;i++)\n for(int j=0;j<=s2;j++){\n if(i+j==0)\n continue;\n if(i*50+j*100>K)\n break;\n if(rides[s1-i][s2-j][1]==-1){\n rides[s1-i][s2-j][1]=rides[s1][s2][0]+1;\n d[s1-i][s2-j][1]= d[s1][s2][0]*nCk[s1][i]%mod*nCk[s2][j]%mod;\n q.add(new int[]{s1-i,s2-j,1});\n }else if(rides[s1-i][s2-j][1]==rides[s1][s2][0]+1){\n d[s1-i][s2-j][1]= (d[s1-i][s2-j][1]+ d[s1][s2][0]*nCk[s1][i]%mod*nCk[s2][j]%mod) % mod;\n }\n }\n }\n else{\n for(int i=0;i<=l-s1;i++)\n for(int j=0;j<=m-s2;j++){\n if(i+j==0)\n continue;\n if(i*50+j*100>K)\n break;\n if(rides[s1+i][s2+j][0]==-1){\n rides[s1+i][s2+j][0]=rides[s1][s2][1]+1;\n d[s1+i][s2+j][0]= d[s1][s2][1]*nCk[l-s1][i]%mod*nCk[m-s2][j]%mod;\n q.add(new int[]{s1+i,s2+j,0});\n }else if(rides[s1+i][s2+j][0]==rides[s1][s2][1]+1){\n d[s1+i][s2+j][0]= (d[s1+i][s2+j][0]+ d[s1][s2][1]*nCk[l-s1][i]%mod*nCk[m-s2][j]%mod) % mod;\n }\n }\n }\n }\n \n if(rides[0][0][1]==-1){\n out.println(-1);\n out.println(0);\n }\n else{\n out.println(rides[0][0][1]);\n out.println(d[0][0][1]);\n }\n \n }\n \n void run() throws Exception\n {\n is = new Scanner(System.in);\n out = new PrintWriter(System.out);\n \n long s = System.currentTimeMillis();\n solve();\n out.flush();\n tr(System.currentTimeMillis()-s+\"ms\");\n }\n \n public static void main(String[] args) throws Exception { new test().run(); }\n \n private boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n private void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "5ab0103844ee02ec0ae08deef262af46", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// package CodeForces;\n\nimport java.io.BufferedOutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class Round179C {\n\t\n\tpublic static final long mod = (long)1e9 + 7;\n\tpublic static final int max = 55;\n\tpublic static long[] fact;\n\tpublic static long[] invfact;\n\t\n\tpublic static void Pre() {\n\t\tfact = new long[max];\n\t\tinvfact = new long[max];\n\t\tfact[0] = invfact[0] = 1;\n\t\tfor(int i = 1; i < max; i++) {\n\t\t\tfact[i] = (fact[i - 1] * i)%mod;\n\t\t\tinvfact[i] = (invfact[i - 1] * ModInverse(i, mod))%mod;\n\t\t}\n\t}\n\t\n\tpublic static long nCr(int n, int r) {\n\t\treturn (((fact[n] * invfact[n - r])%mod) * invfact[r])%mod;\n\t}\n\t\n\tpublic static void solve() {\n\t\tPre();\n\t\tn = s.nextInt();\n\t\tint k = s.nextInt()/50;\n\t\tint[] arr = s.nextIntArray(n);\n\t\tint ones = 0, twos = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tif(arr[i] == 50) {\n\t\t\t\tones++;\n\t\t\t}else {\n\t\t\t\ttwos++;\n\t\t\t}\n\t\t}\n\t\ttot_ones = ones;\n\t\ttot_twos = twos;\n\t\treachable = new int[n + 5][n + 5][4 * n + 1];\n\t\tfor(int i = 0; i < n + 5; i++) {\n\t\t\tfor(int j = 0; j < n + 5; j++) {\n\t\t\t\tArrays.fill(reachable[i][j], -1);\n\t\t\t}\n\t\t}\n\t\tint min = Recur(ones, twos, k, 0);\n\t\tif(min == Integer.MAX_VALUE) {\n\t\t\tout.println(-1);\n\t\t\tout.println(0);\n\t\t}else {\n\t\t\tout.println(min);\n\t\t\tmin_moves = min;\n\t\t\tways = new long[n + 5][n + 5][4 * n + 1];\n\t\t\tfor(int i = 0; i < n + 5; i++) {\n\t\t\t\tfor(int j = 0; j < n + 5; j++) {\n\t\t\t\t\tArrays.fill(ways[i][j], -1);\n\t\t\t\t}\n\t\t\t}\n\t\t\tlong ans = Recur2(ones, twos, k, 0);\n\t\t\tout.println(ans);\n\t\t}\n\t}\n\t\n\tpublic static int[][][] reachable;\n\tpublic static int n;\n\tpublic static int tot_ones, tot_twos;\n\tpublic static int min_moves;\n\t\n\tpublic static int Recur(int ones, int twos, int k, int move) {\n\t\tif(move > 4 * n) {\n\t\t\treturn Integer.MAX_VALUE;\n\t\t}\n\t\tif(ones == 0 && twos == 0) {\n\t\t\treturn reachable[ones][twos][move] = move;\n\t\t}\n\t\tif(reachable[ones][twos][move] != -1) {\n\t\t\treturn reachable[ones][twos][move];\n\t\t}\n\t\tif((move&1) == 1) {\n\t\t\tint min = Integer.MAX_VALUE;\n\t\t\tif(tot_ones - ones >= 1) min = Integer.min(min, Recur(ones + 1, twos, k, move + 1));\n\t\t\tif(tot_twos - twos >= 1)min = Integer.min(min, Recur(ones, twos + 1, k, move + 1));\n\t\t\treachable[ones][twos][move] = min;\n\t\t}else {\n\t\t\tint min = Integer.MAX_VALUE;\n\t\t\tfor(int i = 0; i <= ones; i++) {\n\t\t\t\tif(i > k) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tint adjust = k - i;\n\t\t\t\tadjust /= 2;\n\t\t\t\tmin = Integer.min(min, Recur(ones - i, adjust >= twos ? 0 : twos - adjust, k, move + 1));\n\t\t\t}\n\t\t\treachable[ones][twos][move] = min;\n\t\t}\n\t\treturn reachable[ones][twos][move];\n\t}\n\n\tpublic static long[][][] ways;\n\t\n\tpublic static long Recur2(int ones, int twos, int k, int move) {\n\t\tif(move > min_moves) {\n\t\t\treturn 0L;\n\t\t}\n\t\tif(ones == 0 && twos == 0) {\n\t\t\treturn 1L;\n\t\t}\n\t\tif(ways[ones][twos][move] != -1) {\n\t\t\treturn ways[ones][twos][move];\n\t\t}\n\t\tif((move&1) == 1) {\n\t\t\tlong ans = 0;\n\t\t\tint right_ones = tot_ones - ones;\n\t\t\tint right_twos = tot_twos - twos;\n\t\t\tfor(int i = 0; i <= right_ones; i++) {\n\t\t\t\tif(i > k) continue;\n\t\t\t\tint aval = k - i;\n\t\t\t\taval /= 2;\n\t\t\t\tlong val = nCr(right_ones, i);\n\t\t\t\tfor(int j = 0; j <= Integer.min(aval, right_twos); j++) {\n\t\t\t\t\tif(i == 0 && j == 0) continue;\n\t\t\t\t\tlong tempans = (val * nCr(right_twos, j))%mod;\n\t\t\t\t\tans += (tempans * Recur2(ones + i, twos + j, k, move + 1))%mod;\n\t\t\t\t\tif(ans >= mod) ans -= mod;\n\t\t\t\t}\n\t\t\t}\n//\t\t\tif(tot_ones - ones >= 1) ans = ((tot_ones - ones) * Recur2(ones + 1, twos, k, move + 1))%mod;\n//\t\t\tif(tot_twos - twos >= 1) {\n//\t\t\t\tans += ((tot_twos - twos) * Recur2(ones, twos + 1, k, move + 1))%mod;\n//\t\t\t\tif(ans >= mod) ans -= mod;\n//\t\t\t}\n\t\t\tways[ones][twos][move] = ans;\n\t\t}else {\n\t\t\tlong ans = 0;\n\t\t\tfor(int i = 0; i <= ones; i++) {\n\t\t\t\tif(i > k) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tint aval = k - i;\n\t\t\t\taval /= 2;\n\t\t\t\tlong val = nCr(ones, i);\n\t\t\t\tfor(int j = 0; j <= Integer.min(aval, twos); j++) {\n\t\t\t\t\tif(i == 0 && j == 0) continue;\n\t\t\t\t\tlong tempans = (val * nCr(twos, j))%mod;\n\t\t\t\t\tans += (tempans * Recur2(ones - i, twos - j, k, move + 1))%mod;\n\t\t\t\t\tif(ans >= mod) ans -= mod;\n\t\t\t\t}\n\t\t\t}\n\t\t\tways[ones][twos][move] = ans;\n\t\t}\n\t\treturn ways[ones][twos][move];\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tnew Thread(null, null, \"Thread\", 1 << 27) {\n\t\t\tpublic void run() {\n\t\t\t\ttry {\n\t\t\t\t\tout = new PrintWriter(new BufferedOutputStream(System.out));\n\t\t\t\t\ts = new FastReader(System.in);\n\t\t\t\t\tsolve();\n\t\t\t\t\tout.close();\n\t\t\t\t} catch (Exception e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t\tSystem.exit(1);\n\t\t\t\t}\n\t\t\t}\n\t\t}.start();\n\t}\n\n\tpublic static class Triplet {\n\t\tlong gcd;\n\t\tlong x;\n\t\tlong y;\n\n\t\tTriplet(long gcd, long x, long y) {\n\t\t\tthis.gcd = gcd;\n\t\t\tthis.x = x;\n\t\t\tthis.y = y;\n\t\t}\n\t}\n\n\tpublic static Triplet ExtendedEuclideanAlgo(long a, long b) {\n\t\tif (a == 0) {\n\t\t\treturn new Triplet(b, 0, 1);\n\t\t}\n\t\tTriplet ans = ExtendedEuclideanAlgo(b % a, a);\n\t\tlong x = ans.y - (b / a) * ans.x;\n\t\tlong y = ans.x;\n\t\treturn new Triplet(ans.gcd, x, y);\n\t}\n\n\tpublic static long ModInverse(long a, long m) {\n\t\tTriplet ans = ExtendedEuclideanAlgo(a, m);\n\t\tif (ans.gcd != 1) {\n\t\t\tthrow null;\n\t\t} else {\n\t\t\tlong result = (ans.x % m + m) % m;\n\t\t\treturn result;\n\t\t}\n\t}\n\t\n\tpublic static PrintWriter out;\n\tpublic static FastReader s;\n\n\tpublic static class FastReader {\n\n\t\tprivate InputStream stream;\n\t\tprivate byte[] buf = new byte[4096];\n\t\tprivate int curChar, snumChars;\n\n\t\tpublic FastReader(InputStream stream) {\n\t\t\tthis.stream = stream;\n\t\t}\n\n\t\tpublic int read() {\n\t\t\tif (snumChars == -1) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (curChar >= snumChars) {\n\t\t\t\tcurChar = 0;\n\t\t\t\ttry {\n\t\t\t\t\tsnumChars = stream.read(buf);\n\t\t\t\t} catch (IOException E) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (snumChars <= 0) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn buf[curChar++];\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c)) {\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-') {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tint number = 0;\n\t\t\tdo {\n\t\t\t\tnumber *= 10;\n\t\t\t\tnumber += c - '0';\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn number * sgn;\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c)) {\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tlong sgn = 1;\n\t\t\tif (c == '-') {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tlong number = 0;\n\t\t\tdo {\n\t\t\t\tnumber *= 10L;\n\t\t\t\tnumber += (long) (c - '0');\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn number * sgn;\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] arr = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tarr[i] = this.nextInt();\n\t\t\t}\n\t\t\treturn arr;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] arr = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tarr[i] = this.nextLong();\n\t\t\t}\n\t\t\treturn arr;\n\t\t}\n\n\t\tpublic String next() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c)) {\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo {\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tpublic String nextLine() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c)) {\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo {\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t} while (!isEndofLine(c));\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tpublic boolean isSpaceChar(int c) {\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n\n\t\tpublic boolean isEndofLine(int c) {\n\t\t\treturn c == '\\n' || c == '\\r' || c == -1;\n\t\t}\n\n\t}\n \n\t\n}\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "abf47f8d505ad70d6c00d456d64f2d3d", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.File;\nimport java.io.FileInputStream;\nimport java.io.FileNotFoundException;\nimport java.io.FileOutputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.math.BigInteger;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.BitSet;\nimport java.util.Calendar;\nimport java.util.Collections;\nimport java.util.Comparator;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.LinkedList;\nimport java.util.PriorityQueue;\nimport java.util.SortedSet;\nimport java.util.Stack;\nimport java.util.StringTokenizer;\nimport java.util.TreeMap;\nimport java.util.TreeSet;\n\n/**\n * #\n * \n * @author pttrung\n */\npublic class C_Round_179_Div1 {\n\n\tpublic static long MOD = 1000000007;\n\tstatic int[][] o;\n\tstatic long[][][] dp;\n\tstatic long[][] c;\n\n\tpublic static void main(String[] args) throws FileNotFoundException {\n\t\t// PrintWriter out = new PrintWriter(new FileOutputStream(new File(\n\t\t// \"output.txt\")));\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tScanner in = new Scanner();\n\t\tint n = in.nextInt();\n\t\tint k = in.nextInt();\n\t\tint a = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint v = in.nextInt();\n\t\t\tif (v == 50) {\n\t\t\t\ta++;\n\t\t\t}\n\t\t}\n\t\to = new int[n + 1][a + 1];\n\t\tc = new long[51][51];\n\t\tc[0][0] = 1;\n\t\tfor (int i = 1; i < 51; i++) {\n\t\t\tc[i][0] = 1;\n\t\t\tc[i][i] = 1;\n\t\t\tfor (int j = 1; j < i; j++) {\n\t\t\t\tc[i][j] = c[i - 1][j] + c[i - 1][j - 1];\n\t\t\t\tc[i][j] %= MOD;\n\t\t\t}\n\t\t}\n\t\tfor (int[] x : o) {\n\t\t\tArrays.fill(x, -2);\n\t\t}\n\t\tint v = min(n, a, n, a, k);\n\t\t// System.out.println(v);\n\t\tif (v == -1) {\n\t\t\tout.println(-1);\n\t\t\tout.println(0);\n\t\t} else {\n\t\t\tdp = new long[v + 1][n + 1][a + 1];\n\t\t\tfor (long[][] x : dp) {\n\t\t\t\tfor (long[] y : x) {\n\t\t\t\t\tArrays.fill(y, -1);\n\t\t\t\t}\n\t\t\t}\n\t\t\tout.println(v);\n\t\t\tout.println(cal(0, n, a, n, a, k, v));\n\t\t}\n\t\tout.close();\n\t}\n\n\tpublic static long cal(int index, int left, int a, int n, int f, int k,\n\t\t\tint total) {\n\t\tif (index > total) {\n\t\t\treturn 0;\n\t\t}\n\n\t\tif (dp[index][left][a] != -1) {\n\t\t\treturn dp[index][left][a];\n\t\t}\n\t\tif(index + 1 == total){\n\t\t\tif(a*50 + (left -a)*100 <=k){\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\t\tlong result = 0;\n\t\tfor (int i = 0; i <= a && i * 50 <= k; i++) {\n\t\t\tfor (int x = 0; x <= left - a && x * 100 + i * 50 <= k; x++) {\n\n\t\t\t\tint other = n - left + x + i;\n\t\t\t\tint nxt = f - a + i;\n\t\t\t\tif(x + i == 0){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\t// System.out.println(left + \" \" + a + \" \" + other + \" \" + nxt);\n\t\t\t\tif (left == x + i) {\n\t\t\t\t\tresult += 1;\n\t\t\t\t\t// System.out.println(\"HE HE\");\n\t\t\t\t\tresult %= MOD;\n\t\t\t\t\tbreak;\n\t\t\t\t} else {\n\t\t\t\t\tlong con = c[a][i] * c[left - a][x];\n\t\t\t\t\tcon %= MOD;\n\t\t\t\t\tfor (int j = 1; j <= other; j++) {\n\t\t\t\t\t\tfor (int h = Math.min(j, nxt); h >= 0; h--) {\n\t\t\t\t\t\t\tif (h * 50 + (j - h) * 100 <= k && other - nxt >= j - h) {\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\tlong v = con\n\t\t\t\t\t\t\t\t\t\t* cal(index + 2, left - x - i + j, a\n\t\t\t\t\t\t\t\t\t\t\t\t- i + h, n, f, k, total);\n\t\t\t\t\t\t\t\tv %= MOD;\n\n\t\t\t\t\t\t\t\tv *= c[nxt][h] * c[other - nxt][j - h];\n\t\t\t\t\t\t\t\tv %= MOD;\n\t\t\t\t\t\t\t\tresult += v;\n\t\t\t\t\t\t\t\tresult %= MOD;\n\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn dp[index][left][a] = result;\n\t}\n\n\tpublic static int min(int left, int a, int n, int f, int k) {\n\t\t// System.out.println(left + \" \" + a);\n\t\tif (left == 0) {\n\t\t\treturn 0;\n\t\t}\n\t\tif (o[left][a] != -2) {\n\t\t\treturn o[left][a];\n\t\t}\n\t\tint result = -1;\n\t\tfor (int i = 0; i <= a && i * 50 <= k; i++) {\n\t\t\tint x = k - i * 50;\n\t\t\tx = x / 100;\n\t\t\tx = Math.min(left - a, x);\n\t\t\tint other = n - left + x + i;\n\t\t\tint nxt = f - a + i;\n\t\t\tif (left == x + i) {\n\t\t\t\tresult = 1;\n\t\t\t\tbreak;\n\t\t\t} else {\n\t\t\t\tint tmp = Integer.MAX_VALUE;\n\t\t\t\tif (nxt > 0 && (x + i > 1 || x == 1)) {\n\t\t\t\t\ttmp = 2 + min(left - x - i + 1, a - i + 1, n, f, k);\n\t\t\t\t}\n\t\t\t\tif (other > 0 && other != nxt && x + i > 1) {\n\t\t\t\t\ttmp = Math.min(tmp,\n\t\t\t\t\t\t\t2 + min(left - x - i + 1, a - i, n, f, k));\n\t\t\t\t}\n\t\t\t\tif (tmp != Integer.MAX_VALUE && (result == -1 || result > tmp)) {\n\t\t\t\t\tresult = tmp;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn o[left][a] = result;\n\t}\n\n\tpublic static int[] KMP(String val) {\n\t\tint i = 0;\n\t\tint j = -1;\n\t\tint[] result = new int[val.length() + 1];\n\t\tresult[0] = -1;\n\t\twhile (i < val.length()) {\n\t\t\twhile (j >= 0 && val.charAt(j) != val.charAt(i)) {\n\t\t\t\tj = result[j];\n\t\t\t}\n\t\t\tj++;\n\t\t\ti++;\n\t\t\tresult[i] = j;\n\t\t}\n\t\treturn result;\n\n\t}\n\n\tpublic static boolean nextPer(int[] data) {\n\t\tint i = data.length - 1;\n\t\twhile (i > 0 && data[i] < data[i - 1]) {\n\t\t\ti--;\n\t\t}\n\t\tif (i == 0) {\n\t\t\treturn false;\n\t\t}\n\t\tint j = data.length - 1;\n\t\twhile (data[j] < data[i - 1]) {\n\t\t\tj--;\n\t\t}\n\t\tint temp = data[i - 1];\n\t\tdata[i - 1] = data[j];\n\t\tdata[j] = temp;\n\t\tArrays.sort(data, i, data.length);\n\t\treturn true;\n\t}\n\n\tpublic static int digit(long n) {\n\t\tint result = 0;\n\t\twhile (n > 0) {\n\t\t\tn /= 10;\n\t\t\tresult++;\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static double dist(long a, long b, long x, long y) {\n\t\tdouble val = (b - a) * (b - a) + (x - y) * (x - y);\n\t\tval = Math.sqrt(val);\n\t\tdouble other = x * x + a * a;\n\t\tother = Math.sqrt(other);\n\t\treturn val + other;\n\n\t}\n\n\tpublic static class Point implements Comparable<Point> {\n\n\t\tint x, y;\n\n\t\tpublic Point(int start, int end) {\n\t\t\tthis.x = start;\n\t\t\tthis.y = end;\n\t\t}\n\n\t\t@Override\n\t\tpublic int hashCode() {\n\t\t\tint hash = 5;\n\t\t\thash = 47 * hash + this.x;\n\t\t\thash = 47 * hash + this.y;\n\t\t\treturn hash;\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean equals(Object obj) {\n\t\t\tif (obj == null) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif (getClass() != obj.getClass()) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tfinal Point other = (Point) obj;\n\t\t\tif (this.x != other.x) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif (this.y != other.y) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\t\t@Override\n\t\tpublic int compareTo(Point o) {\n\t\t\treturn x - o.x;\n\t\t}\n\t}\n\n\tpublic static class FT {\n\n\t\tlong[] data;\n\n\t\tFT(int n) {\n\t\t\tdata = new long[n];\n\t\t}\n\n\t\tpublic void update(int index, long value) {\n\t\t\twhile (index < data.length) {\n\t\t\t\tdata[index] += value;\n\t\t\t\tindex += (index & (-index));\n\t\t\t}\n\t\t}\n\n\t\tpublic long get(int index) {\n\t\t\tlong result = 0;\n\t\t\twhile (index > 0) {\n\t\t\t\tresult += data[index];\n\t\t\t\tindex -= (index & (-index));\n\t\t\t}\n\t\t\treturn result;\n\n\t\t}\n\t}\n\n\tpublic static long gcd(long a, long b) {\n\t\tif (b == 0) {\n\t\t\treturn a;\n\t\t}\n\t\treturn gcd(b, a % b);\n\t}\n\n\tpublic static long pow(long a, long b) {\n\t\tif (b == 0) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (b == 1) {\n\t\t\treturn a;\n\t\t}\n\t\tlong val = pow(a, b / 2);\n\t\tif (b % 2 == 0) {\n\t\t\treturn val * val % MOD;\n\t\t} else {\n\t\t\treturn val * (val * a % MOD) % MOD;\n\n\t\t}\n\t}\n\n\tstatic class Scanner {\n\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tpublic Scanner() throws FileNotFoundException {\n\t\t\t// System.setOut(new PrintStream(new\n\t\t\t// BufferedOutputStream(System.out), true));\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t\t// br = new BufferedReader(new InputStreamReader(new\n\t\t\t// FileInputStream(new File(\"input.txt\"))));\n\t\t}\n\n\t\tpublic String next() {\n\n\t\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (Exception e) {\n\t\t\t\t\tthrow new RuntimeException();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tpublic String nextLine() {\n\t\t\tst = null;\n\t\t\ttry {\n\t\t\t\treturn br.readLine();\n\t\t\t} catch (Exception e) {\n\t\t\t\tthrow new RuntimeException();\n\t\t\t}\n\t\t}\n\n\t\tpublic boolean endLine() {\n\t\t\ttry {\n\t\t\t\tString next = br.readLine();\n\t\t\t\twhile (next != null && next.trim().isEmpty()) {\n\t\t\t\t\tnext = br.readLine();\n\t\t\t\t}\n\t\t\t\tif (next == null) {\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t\tst = new StringTokenizer(next);\n\t\t\t\treturn st.hasMoreTokens();\n\t\t\t} catch (Exception e) {\n\t\t\t\tthrow new RuntimeException();\n\t\t\t}\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "e70b6d27f52c4985f7532f077078b928", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n/*\n * Heart beats fast\n * \t\tColors and promises\n * \t\t\tHow to be brave\n * \t\t\t\tHow can I love when I am afraid...\n */\n//read the question correctly (is y a vowel? what are the exact constraints?)\n//look out for SPECIAL CASES (n=1?) and overflow (ll vs int?)\n//always declare multidimensional arrays as [2][n] not [n][2]\n//it can lead to upto 2-3x diff in runtime\n//declare int/long tries with 16 array size due to object overhead\npublic class Main\n{\n\tstatic long[][][][]dp;\n\tstatic int cap,fat,slim;\n\tstatic long[][]ncr;\n\tstatic long pathfinder(int fatsleft,int slimsleft,int ridesleft, boolean boatpos)\n\t{\n\t\tif(fatsleft==0&&slimsleft==0&&ridesleft==0)\n\t\t\treturn 1;\n\t\tif(ridesleft==0)\n\t\t\treturn 0;\n\t\tif(dp[fatsleft][slimsleft][ridesleft][(boatpos)?0:1]!=-1)\n\t\t\treturn dp[fatsleft][slimsleft][ridesleft][(boatpos)?0:1];\n\t\tlong ways=0;\n\t\tif(boatpos)\n\t\t{\n\t\t\tfor(int i=0; i<=fatsleft; i++)\n\t\t\t\tfor(int j=0; j<=slimsleft; j++)\n\t\t\t\t\tif(i+j>0&&i*2+j<=cap)\n\t\t\t\t\t\tways=(ways+((ncr[fatsleft][i]*ncr[slimsleft][j])%mod*pathfinder(fatsleft-i,slimsleft-j,ridesleft-1,!boatpos))%mod)%mod;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfor(int i=0; i<=fat-fatsleft; i++)\n\t\t\t\tfor(int j=0; j<=slim-slimsleft; j++)\n\t\t\t\t\tif(i+j>0&&i*2+j<=cap)\n\t\t\t\t\t\tways=(ways+((ncr[fat-fatsleft][i]*ncr[slim-slimsleft][j])%mod*pathfinder(fatsleft+i, slimsleft+j, ridesleft-1, !boatpos))%mod)%mod;\t\n\t\t}\n\t\treturn dp[fatsleft][slimsleft][ridesleft][(boatpos)?0:1]=ways;\n\t}\n\tpublic static void main(String[] args) throws Exception\n\t{\n\t\tint n=ni();\n\t\tcap=ni()/50;\n\t\tfat=0;\n\t\tslim=0;\n\t\tfor(int i=0; i<n; i++)\n\t\t\tif(ni()==100)\n\t\t\t\tfat++;\n\t\t\telse\n\t\t\t\tslim++;\n\t\tdp=new long[fat+1][slim+1][201][2];\n\t\tfor(int i=0; i<=fat; i++)\n\t\t\tfor(int j=0; j<=slim; j++)\n\t\t\t\tfor(int k=0; k<=200; k++)\n\t\t\t\t\tdp[i][j][k][0]=dp[i][j][k][1]=-1;\n\t\tncr=new long[51][51];\n\t\tncr[0][0]=1;\n\t\tdp[0][0][0][1]=1;\n\t\tdp[0][0][0][0]=1;\n\t\tlong[]fact=new long[51];\n\t\tfact[0]=1;\n\t\tfor(int i=1; i<=50; i++)\n\t\t\tfact[i]=(fact[i-1]*i)%mod;\n\t\tfor(int i=0; i<=50; i++)\n\t\t\tfor(int j=0; j<=i; j++)\n\t\t\t\tncr[i][j]=(fact[i]*((powm(fact[i-j],mod-2,mod)*powm(fact[j],mod-2,mod))%mod))%mod;\n\t\tfor(int hola=1; hola<=200; hola++)\n\t\t{\n\t\t\tif(pathfinder(fat,slim,hola,true)!=0)\n\t\t\t{\n\t\t\t\tsop(hola);\n\t\t\t\tsop(pathfinder(fat,slim,hola,true));\n\t\t\t\texit();\n\t\t\t}\n\t\t}\n\t\tsop(-1);\n\t\tsop(0);\n\t\tSystem.out.print(output);\n\t}\n\t///////////////////////////////////////////\n\t///////////////////////////////////////////\n\t///template from here\n\tstatic class pair\n\t{\n\t\tint a, b;\n\t\tpair(){}\n\t\tpair(int c,int d){a=c;b=d;}\n\t}\n\tstatic interface combiner\n\t{\n\t\tpublic long combine(long a, long b);\n\t}\n\tstatic final int mod=1000000007;\n\tstatic final double eps=1e-9;\n\tstatic final long inf=100000000000000000L;\n\tstatic Reader in=new Reader();\n\tstatic StringBuilder output=new StringBuilder();\n\tstatic Random rn=new Random();\n\tstatic void reverse(int[]a){for(int i=0; i<a.length/2; i++){a[i]^=a[a.length-i-1];a[a.length-i-1]^=a[i];a[i]^=a[a.length-i-1];}}\n\tstatic void sort(int[]a)\n\t{\n\t\tint te;\n\t\tfor(int i=0; i<a.length; i+=2)\n\t\t{\n\t\t\tte=rn.nextInt(a.length);\n\t\t\tif(i!=te)\n\t\t\t{\n\t\t\t\ta[i]^=a[te];\n\t\t\t\ta[te]^=a[i];\n\t\t\t\ta[i]^=a[te];\n\t\t\t}\n\t\t}\n\t\tArrays.sort(a);\n\t}\n\tstatic void sort(long[]a)\n\t{\n\t\tint te;\n\t\tfor(int i=0; i<a.length; i+=2)\n\t\t{\n\t\t\tte=rn.nextInt(a.length);\n\t\t\tif(i!=te)\n\t\t\t{\n\t\t\ta[i]^=a[te];\n\t\t\ta[te]^=a[i];\n\t\t\ta[i]^=a[te];\n\t\t\t}\n\t\t}\n\t\tArrays.sort(a);\n\t}\n\tstatic void sort(double[]a)\n\t{\n\t\tint te;\n\t\tdouble te1;\n\t\tfor(int i=0; i<a.length; i+=2)\n\t\t{\n\t\t\tte=rn.nextInt(a.length);\n\t\t\tif(i!=te)\n\t\t\t{\n\t\t\tte1=a[te];\n\t\t\ta[te]=a[i];\n\t\t\ta[i]=te1;\n\t\t\t}\n\t\t}\n\t\tArrays.sort(a);\n\t}\n\tstatic void sort(int[][]a)\n\t{\n\t\tArrays.sort(a, new Comparator<int[]>()\n\t\t{\n\t\t\tpublic int compare(int[]a,int[]b)\n\t\t\t{\n\t\t\t\tif(a[0]>b[0])\n\t\t\t\t\treturn -1;\n\t\t\t\tif(b[0]>a[0])\n\t\t\t\t\treturn 1;\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t});\n\t}\n\tstatic void sort(pair[]a)\n\t{\n\t\tArrays.sort(a,new Comparator<pair>()\n\t\t\t\t{\n\t\t\t@Override\n\t\t\tpublic int compare(pair a,pair b)\n\t\t\t{\n\t\t\t\tif(a.a>b.a)\n\t\t\t\t\treturn 1;\n\t\t\t\tif(b.a>a.a)\n\t\t\t\treturn -1;\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\t\t});\n\t}\n\tstatic int log2n(long a)\n\t{\n\t\tint te=0;\n\t\twhile(a>0)\n\t\t{\n\t\t\ta>>=1;\n\t\t\t++te;\n\t\t}\n\t\treturn te;\n\t}\n\tstatic class vector implements Iterable<Integer>\n\t{\n\t\tint a[],size;\n\t\tvector(){a=new int[10];size=0;}\n\t\tvector(int n){a=new int[n];size=0;}\n\t\tpublic void add(int b){if(++size==a.length)a=Arrays.copyOf(a, 2*size);a[size-1]=b;}\n\t\tpublic void sort(){Arrays.sort(a, 0, size);}\n\t\tpublic void sort(int l, int r){Arrays.sort(a, l, r);}\n\t\t@Override\n\t\tpublic Iterator<Integer> iterator() {\n\t\t\tIterator<Integer> hola=new Iterator<Integer>()\n\t\t\t\t\t{\n\t\t\t\tint cur=0;\n\t\t\t\t\t\t@Override\n\t\t\t\t\t\tpublic boolean hasNext() {\n\t\t\t\t\t\t\treturn cur<size;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t@Override\n\t\t\t\t\t\tpublic Integer next() {\n\t\t\t\t\t\t\treturn a[cur++];\n\t\t\t\t\t\t}\t\t\t\t\n\t\t\t\t\t};\n\t\t\treturn hola;\n\t\t}\n\t}\n\t//output functions////////////////\n\tstatic void pr(Object a){output.append(a+\"\\n\");}\n\tstatic void pr(){output.append(\"\\n\");}\n\tstatic void p(Object a){output.append(a);}\n\tstatic void pra(int[]a){for(int i:a)output.append(i+\" \");output.append(\"\\n\");}\n\tstatic void pra(long[]a){for(long i:a)output.append(i+\" \");output.append(\"\\n\");}\n\tstatic void pra(String[]a){for(String i:a)output.append(i+\" \");output.append(\"\\n\");}\n\tstatic void pra(double[]a){for(double i:a)output.append(i+\" \");output.append(\"\\n\");}\n\tstatic void sop(Object a){System.out.println(a);}\n\tstatic void flush(){System.out.println(output);output=new StringBuilder();}\n\t//////////////////////////////////\n\t//input functions/////////////////\n\tstatic int ni(){return Integer.parseInt(in.next());}\n\tstatic long nl(){return Long.parseLong(in.next());}\n\tstatic String ns(){return in.next();}\n\tstatic double nd(){return Double.parseDouble(in.next());}\n\tstatic int[] nia(int n){int a[]=new int[n];for(int i=0; i<n; i++)a[i]=ni();return a;}\n\tstatic int[] pnia(int n){int a[]=new int[n+1];for(int i=1; i<=n; i++)a[i]=ni();return a;}\n\tstatic long[] nla(int n){long a[]=new long[n];for(int i=0; i<n; i++)a[i]=nl();return a;}\n\tstatic String[] nsa(int n){String a[]=new String[n];for(int i=0; i<n; i++)a[i]=ns();return a;}\n\tstatic double[] nda(int n){double a[]=new double[n];for(int i=0; i<n; i++)a[i]=nd();return a;}\n\t//////////////////////////////////\n\t//some utility functions\n\tstatic void exit(){System.out.print(output);System.exit(0);}\n\tstatic int min(int... a){int min=a[0];for(int i:a)min=Math.min(min, i);return min;}\n\tstatic int max(int... a){int max=a[0];for(int i:a)max=Math.max(max, i);return max;}\t\n\tstatic int gcd(int... a){int gcd=a[0];for(int i:a)gcd=gcd(gcd, i);return gcd;}\t\n\tstatic long min(long... a){long min=a[0];for(long i:a)min=Math.min(min, i);return min;}\n\tstatic long max(long... a){long max=a[0];for(long i:a)max=Math.max(max, i);return max;}\t\n\tstatic long gcd(long... a){long gcd=a[0];for(long i:a)gcd=gcd(gcd, i);return gcd;}\t\n\tstatic String pr(String a, long b){String c=\"\";while(b>0){if(b%2==1)c=c.concat(a);a=a.concat(a);b>>=1;}return c;}\n\tstatic long powm(long a, long b, long m){long an=1;long c=a;while(b>0){if(b%2==1)an=(an*c)%m;c=(c*c)%m;b>>=1;}return an;}\n\tstatic int gcd(int a, int b){if(b==0)return a;return gcd(b, a%b);}\n\tstatic long gcd(long a, long b){if(b==0)return a;return gcd(b, a%b);}\n\tstatic class Reader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n public Reader() {\n reader = new BufferedReader(new InputStreamReader(System.in), 32768);\n tokenizer = null;\n }\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n }\n}", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "52f6f065ffa85ff8ed642745875da4ad", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedInputStream;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\n\npublic class Main {\n public int mod = 1000000000 + 7;\n\n public void work() {\n Scanner cin = new Scanner(new BufferedInputStream(System.in));\n PrintWriter out = new PrintWriter(System.out);\n int n, K;\n n = cin.nextInt();\n K = cin.nextInt();\n int w, w50, w100;\n w50 = w100 = 0;\n for (int i = 0; i < n; ++i) {\n w = cin.nextInt();\n if (w == 50)\n ++w50;\n else\n ++w100;\n }\n int c[][] = new int[51][51];\n for (int i = 0; i <= 50; ++i) {\n c[i][i] = c[i][0] = 1;\n for (int j = 1; j < i; ++j)\n c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;\n }\n int d[][][] = new int[1001][w50 + 1][w100 + 1];\n d[0][w50][w100] = 1;\n int ans = -1;\n for (int i = 0; i < 1000 && ans == -1; ++i)\n for (int j = 0; j <= w50 && ans == -1; ++j)\n for (int k = 0; k <= w100 && ans == -1; ++k)\n if (d[i][j][k] > 0) {\n if (i % 2 == 0) {\n for (int z = j; z >= 0 && ans == -1; --z) {\n if ((j - z) * 50 > K)\n break;\n for (int zz = k; zz >= 0 && ans == -1; --zz) {\n if ((j - z) * 50 + (k - zz) * 100 > K)\n break;\n if (z == 0 && zz == 0) {\n ans = i + 1;\n break;\n }\n d[i + 1][z][zz] = 1;\n }\n }\n } else {\n for (int z = j; z <= w50 && ans == -1; ++z) {\n if ((z - j) * 50 > K)\n break;\n for (int zz = k; zz <= w100 && ans == -1; ++zz) {\n if ((z - j) * 50 + (zz - k) * 100 > K)\n break;\n\n if (zz == k && j == z)\n continue;\n d[i + 1][z][zz] = 1;\n }\n }\n }\n }\n out.println(ans);\n if (ans == -1)\n out.println(0);\n else {\n for (int i = 0; i < ans; ++i)\n for (int j = 0; j <= w50; ++j)\n for (int k = 0; k <= w100; ++k)\n d[i][j][k] = 0;\n d[0][w50][w100] = 1;\n int v;\n for (int i = 0; i < ans; ++i)\n for (int j = 0; j <= w50; ++j)\n for (int k = 0; k <= w100; ++k)\n if (d[i][j][k] > 0) {\n if (i % 2 == 0) {\n for (int z = j; z >= 0; --z) {\n if ((j - z) * 50 > K)\n break;\n for (int zz = k; zz >= 0; --zz) {\n if ((j - z) * 50 + (k - zz) * 100 > K)\n break;\n v = (int)(((long)d[i][j][k] * c[j][j - z]) % mod);\n v = (int)(((long)v * c[k][k - zz]) % mod);\n d[i + 1][z][zz] += v;\n d[i + 1][z][zz] %= mod;\n }\n }\n } else {\n for (int z = j; z <= w50; ++z) {\n if ((z - j) * 50 > K)\n break;\n for (int zz = k; zz <= w100; ++zz) {\n if ((z - j) * 50 + (zz - k) * 100 > K)\n break;\n\n if (zz == k && j == z)\n continue;\n v = (int)(((long)d[i][j][k] * c[w50 - j][z - j]) % mod);\n v = (int)(((long)v * c[w100 - k][zz - k]) % mod);\n d[i + 1][z][zz] += v;\n d[i + 1][z][zz] %= mod;\n }\n }\n }\n }\n out.println(d[ans][0][0]);\n }\n out.close();\n }\n\n public static void main(String[] args) {\n Main e = new Main();\n e.work();\n }\n\n}", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "409582a7d8bed7aa91cd1d95d8d8fd72", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "//package round179;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayDeque;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.Queue;\n\npublic class C {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t\tint mod = 1000000007;\n\t\tint n = ni(), K = ni();\n\t\tint w1 = 0, w2 = 0;\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tif(ni() == 50){\n\t\t\t\tw1++;\n\t\t\t}else{\n\t\t\t\tw2++;\n\t\t\t}\n\t\t}\n\t\t\n\t\tlong[][] C = new long[101][101];\n\t\tfor(int i = 0;i <= 100;i++){\n\t\t\tC[i][0] = 1;\n\t\t\tfor(int j = 1;j <= i;j++){\n\t\t\t\tC[i][j] = C[i-1][j] + C[i-1][j-1];\n\t\t\t\tif(C[i][j] >= mod)C[i][j] -= mod;\n\t\t\t}\n\t\t}\n\t\t\n\t\tint I = 99999999;\n\t\tint[][][] d = new int[w1+1][w2+1][2]; // [this50][this100][0:this,1:that]\n\t\tfor(int i = 0;i <= w1;i++){\n\t\t\tfor(int j = 0;j <= w2;j++){\n\t\t\t\td[i][j][0] = d[i][j][1] = I;\n\t\t\t}\n\t\t}\n\t\tlong[][][] dp = new long[w1+1][w2+1][2];\n\t\tdp[w1][w2][0] = 1L;\n\t\td[w1][w2][0] = 0;\n\t\tQueue<int[]> q = new ArrayDeque<int[]>();\n\t\tq.add(new int[]{w1, w2, 0});\n\t\twhile(!q.isEmpty()){\n\t\t\tint[] cur = q.poll();\n\t\t\tif(cur[2] == 0){\n\t\t\t\tint s1 = cur[0], s2 = cur[1];\n\t\t\t\tfor(int j = 0;j <= s1;j++){\n\t\t\t\t\tfor(int k = 0;k <= s2;k++){\n\t\t\t\t\t\tif(j+k == 0)continue;\n\t\t\t\t\t\tif(50*j+100*k>K)break;\n\t\t\t\t\t\tint ns1 = s1-j, ns2 = s2-k;\n\t\t\t\t\t\tif(d[ns1][ns2][1] == I){\n\t\t\t\t\t\t\td[ns1][ns2][1] = d[s1][s2][0] + 1;\n\t\t\t\t\t\t\tdp[ns1][ns2][1] = dp[s1][s2][0] * C[s1][j] % mod * C[s2][k] % mod;\n\t\t\t\t\t\t\tq.add(new int[]{ns1, ns2, 1});\n\t\t\t\t\t\t}else if(d[ns1][ns2][1] == d[s1][s2][0] + 1){\n\t\t\t\t\t\t\tdp[ns1][ns2][1] = (dp[ns1][ns2][1] + dp[s1][s2][0]*C[s1][j]%mod*C[s2][k])%mod;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tint s1 = cur[0], s2 = cur[1];\n\t\t\t\tfor(int j = 0;j <= w1-s1;j++){\n\t\t\t\t\tfor(int k = 0;k <= w2-s2;k++){\n\t\t\t\t\t\tif(j+k == 0)continue;\n\t\t\t\t\t\tif(50*j+100*k>K)break;\n\t\t\t\t\t\tint ns1 = s1+j, ns2 = s2+k;\n\t\t\t\t\t\tif(d[ns1][ns2][0] == I){\n\t\t\t\t\t\t\td[ns1][ns2][0] = d[s1][s2][1] + 1;\n\t\t\t\t\t\t\tdp[ns1][ns2][0] = dp[s1][s2][1] * C[w1-s1][j] % mod * C[w2-s2][k] % mod;\n\t\t\t\t\t\t\tq.add(new int[]{ns1, ns2, 0});\n\t\t\t\t\t\t}else if(d[ns1][ns2][0] == d[s1][s2][1] + 1){\n\t\t\t\t\t\t\tdp[ns1][ns2][0] = (dp[ns1][ns2][0] + dp[s1][s2][1]*C[w1-s1][j]%mod*C[w2-s2][k])%mod;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(d[0][0][1] == I){\n\t\t\tout.println(-1);\n\t\t\tout.println(0);\n\t\t}else{\n\t\t\tout.println(d[0][0][1]);\n\t\t\tout.println(dp[0][0][1]);\n\t\t}\n\t}\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new C().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tprivate int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "e0985a3a0962a78a46a06d546b7dc01a", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.StreamTokenizer;\nimport java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.util.Arrays;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.Reader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tTokenizerReader in = new TokenizerReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskE solver = new TaskE();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskE {\n final static long MOD = 1000000007;\n public void solve(@SuppressWarnings(\"UnusedParameters\") int testNumber, TokenizerReader in, PrintWriter out) {\n int n = in.nextInt(), maxWeight = in.nextInt();\n long[][] C = new long[n+1][n+1];\n for (int i = 0; i <= n; ++i) {\n C[i][0] = C[i][i] = 1;\n for (int j = 1; j < i; ++j)\n C[i][j] = (C[i-1][j-1] + C[i-1][j]) % MOD;\n }\n maxWeight /= 50;\n int totalSmall = 0, totalBig = 0;\n for (int i = 0; i < n; ++i) {\n if (in.nextInt() == 50)\n ++totalSmall;\n else\n ++totalBig;\n }\n\n int[][][] time = new int[2][totalSmall + 1][totalBig + 1];\n for (int[][] ii: time)\n for (int[] i: ii)\n Arrays.fill(i, Integer.MAX_VALUE);\n for (int side = 0; side <= 1; ++side)\n for (int thisPeople = 0; thisPeople <= n; ++thisPeople)\n for (int thisSmall = Math.min(totalSmall, thisPeople); thisSmall >= 0; --thisSmall) {\n int thisBig = thisPeople - thisSmall;\n if (thisBig > totalBig)\n continue;\n int thatSmall = totalSmall - thisSmall;\n int thatBig = totalBig - thisBig;\n if (side == 1) {\n if (thisPeople == n)\n time[side][thisSmall][thisBig] = 0;\n else if (thisSmall > 0)\n time[side][thisSmall][thisBig] = 1 + time[0][thatSmall+1][thatBig];\n else if (thisBig > 0)\n time[side][thisSmall][thisBig] = 1 + time[0][thatSmall][thatBig+1];\n continue;\n }\n if (thisPeople == 0)\n continue;\n for (int big = 0; big <= thisBig && 2*big <= maxWeight; ++big)\n for (int small = 0; small <= thisSmall && 2*big+small <= maxWeight; ++small) {\n if (big == thisBig && small == thisSmall)\n time[side][thisSmall][thisBig] = 1;\n else if (2*big + small > 1) {\n int nextRightSmall = thatSmall + small;\n int nextLeftBig, nextLeftSmall;\n if (nextRightSmall > 0) {\n nextLeftBig = thisBig - big;\n nextLeftSmall = thisSmall + 1 - small;\n } else {\n nextLeftBig = thisBig + 1 - big;\n nextLeftSmall = thisSmall - small;\n }\n if (nextLeftBig != thisBig || nextLeftSmall != thisSmall) {\n if (time[side][nextLeftSmall][nextLeftBig] < Integer.MAX_VALUE)\n time[side][thisSmall][thisBig] = Math.min(\n time[side][thisSmall][thisBig],\n time[side][nextLeftSmall][nextLeftBig] + 2\n );\n }\n }\n }\n }\n\n int T = time[0][totalSmall][totalBig];\n if (T == Integer.MAX_VALUE) {\n out.println(-1);\n out.println(0);\n return;\n }\n long[][][] res = new long[2][totalSmall+1][totalBig+1];\n for (int t = 0; t <= T; ++t)\n for (int thisPeople = 0; thisPeople <= n; ++thisPeople)\n for (int thisSmall = 0; thisSmall <= totalSmall && thisSmall <= thisPeople; ++thisSmall) {\n int thisBig = thisPeople - thisSmall;\n if (thisBig > totalBig)\n continue;\n int side = 1 - t % 2;\n if (time[side][thisSmall][thisBig] == 0) {\n res[side][thisSmall][thisBig] = 1;\n continue;\n }\n if (time[side][thisSmall][thisBig] != t)\n continue;\n for (int big = 0; big <= thisBig && 2*big <= maxWeight; ++big)\n for (int small = 0; small <= thisSmall && 2*big + small <= maxWeight; ++small)\n if (big + small > 0) {\n int nextSmall = totalSmall - thisSmall + small;\n int nextBig = totalBig - thisBig + big;\n int nextSide = 1 - side;\n if (time[nextSide][nextSmall][nextBig] == t-1) {\n long tmp = res[nextSide][nextSmall][nextBig] * C[thisBig][big] % MOD * C[thisSmall][small] % MOD;\n res[side][thisSmall][thisBig] += tmp;\n res[side][thisSmall][thisBig] %= MOD;\n }\n }\n }\n\n\n out.println(T);\n out.println(res[0][totalSmall][totalBig]);\n }\n}\n\nclass TokenizerReader extends StreamTokenizer {\n public TokenizerReader(InputStream in) {\n super(new BufferedReader(new InputStreamReader(in)));\n defaultConfig();\n }\n\n public String nextString() {\n try {\n nextToken();\n } catch (IOException e) {\n throw new RuntimeException(\"nextString: exception in line \" + lineno(), e);\n }\n return sval;\n }\n\n public int nextInt() {\n return Integer.parseInt(nextString());\n }\n\n public void defaultConfig() {\n resetSyntax();\n wordChars(33, 126);\n whitespaceChars(0, ' ');\n }\n\n }\n\n", "lang_cluster": "Java", "tags": ["dfs and similar", "dp", "combinatorics"], "code_uid": "40a433cd8e4e5f50fc9c41beb1d305d3", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\npublic class C {\n\tstatic int n, k, f, h;\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tInputReader in = new InputReader();\n\t\tn = in.nextInt();\n\t\tk = in.nextInt();\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint w = in.nextInt();\n\t\t\tif (w == 100)\n\t\t\t\th++;\n\t\t\telse\n\t\t\t\tf++;\n\t\t}\n\t\tnCr(55, 55);\n\t\tdp1 = new int[55][55];\n\t\tfor (int i = 0; i < 55; i++)\n\t\t\tArrays.fill(dp1[i], -1);\n\t\tdp2 = new long[55][55][202];\n\t\tfor (int i = 0; i < 55; i++)\n\t\t\tfor (int j = 0; j < 55; j++)\n\t\t\t\tArrays.fill(dp2[i][j], -1);\n\t\tr1 = getMin(f, h);\n\t\tif (r1 >= 1 << 25) {\n\t\t\tSystem.out.println(-1);\n\t\t\tSystem.out.println(0);\n\t\t} else {\n\t\t\tlong r2 = go(f, h, 0);\n\t\t\tSystem.out.println(r1);\n\t\t\tSystem.out.println(r2);\n\t\t}\n\t}\n\n\tstatic int r1;\n\n\tpublic static long go(int x, int y, int t) {\n\t\tif (x == f && y == h && t == r1)\n\t\t\treturn 1;\n\t\tif(t>=r1)return 0;\n\t\tint side = t % 2;\n\t\tif (dp2[x][y][t] != -1)\n\t\t\treturn dp2[x][y][t];\n\t\tlong ret = 0;\n\t\tfor (int i = 0; i <= x && i * 50 <= k; i++) {\n\t\t\tfor (int j = 0; j <= y && i * 50 + j * 100 <= k; j++) {\n\t\t\t\tif (i + j == 0 || (i == x && j == y && side == 1))\n\t\t\t\t\tcontinue;\n\t\t\t\tret = (ret+((go(f-x+i, h-y+j, t+1)*c[x][i])%mod)*c[y][j])%mod;\n\t\t\t}\n\t\t}\n\t\treturn dp2[x][y][t] = ret;\n\t}\n\n\tstatic long[][][] dp2;\n\tstatic int[][] dp1;\n\tstatic int mod = 1000000007;\n\n\tpublic static int getMin(int x, int y) {\n\t\tif (x == 0 && y == 0)\n\t\t\treturn 0;\n\t\tif (dp1[x][y] != -1)\n\t\t\treturn dp1[x][y];\n\t\tint ret = 1 << 25;\n\t\tfor (int i = 0; i <= x && i * 50 <= k; i++) {\n\t\t\tfor (int j = 0; j <= y && i * 50 + j * 100 <= k; j++) {\n\t\t\t\tif (i + j == 0)\n\t\t\t\t\tcontinue;\n\t\t\t\tif (i == x && j == y) {\n\t\t\t\t\tret = 1;\n\t\t\t\t} else {\n\t\t\t\t\tif (i != 0 && j != 0) {\n\t\t\t\t\t\tret = Math.min(\n\t\t\t\t\t\t\t\tret,\n\t\t\t\t\t\t\t\t2 + Math.min(getMin(x - i + 1, y - j),\n\t\t\t\t\t\t\t\t\t\tgetMin(x - i, y - j + 1)));\n\t\t\t\t\t} else if (i > 1 && j == 0) {\n\t\t\t\t\t\tret = Math.min(ret, 2 + getMin(x - i + 1, y));\n\t\t\t\t\t} else if (i == 0) {\n\t\t\t\t\t\tif (j > 1) {\n\t\t\t\t\t\t\tret = Math.min(2+getMin(x - i, y - j + 1), ret);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (f - x >= 1) {\n\t\t\t\t\t\t\tret = Math.min(2+getMin(x + 1, y - j), ret);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn dp1[x][y] = ret;\n\t}\n\n\tstatic long[][] c;\n\n\tpublic static void nCr(int n, int r) {\n\t\tc = new long[n + 1][r + 1];\n\t\tfor (int i = 0; i < n + 1; i++)\n\t\t\tc[i][0] = 1;\n\n\t\tfor (int j = 1; j <= r; j++)\n\t\t\tfor (int i = j; i <= n; i++)\n\t\t\t\tc[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % mod;\n\t}\n\n\tstatic class InputReader {\n\t\tBufferedReader in;\n\t\tStringTokenizer st;\n\n\t\tpublic InputReader() throws IOException {\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tst = new StringTokenizer(in.readLine());\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\twhile (!st.hasMoreElements())\n\t\t\t\tst = new StringTokenizer(in.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() throws NumberFormatException, IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic long nextLong() throws NumberFormatException, IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "3682a3f2439a9c0e745c7b704ba8bb71", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class CF1206F extends PrintWriter {\n\tCF1206F() { super(System.out); }\n\tScanner sc = new Scanner(System.in);\n\tpublic static void main(String[] $) {\n\t\tCF1206F o = new CF1206F(); o.main(); o.flush();\n\t}\n\n\tint[] next, jj; int l_ = 1;\n\tint link(int l, int j) { next[l_] = l; jj[l_] = j; return l_++; }\n\tint[] ao; int n;\n\tint[] cc;\n\tvoid init() {\n\t\tint m = n - 1;\n\t\tnext = new int[1 + m * 2];\n\t\tjj = new int[1 + m * 2];\n\t\tao = new int[n];\n\t\tcc = new int[n];\n\t}\n\tint n_, i_, j_;\n\tint dfs(int p, int i) {\n\t\tint k = 1;\n\t\tfor (int l = ao[i]; l != 0; l = next[l]) {\n\t\t\tint j = jj[l];\n\t\t\tif (j != p)\n\t\t\t\tk += dfs(i, j);\n\t\t}\n\t\tint k_ = Math.min(k, n - k);\n\t\tif (n_ < k_) {\n\t\t\tn_ = k_;\n\t\t\tif (k <= n - k) {\n\t\t\t\ti_ = i;\n\t\t\t\tj_ = p;\n\t\t\t} else {\n\t\t\t\ti_ = p;\n\t\t\t\tj_ = i;\n\t\t\t}\n\t\t}\n\t\tcc[i] = k;\n\t\treturn k;\n\t}\n\tint a, b;\n\tvoid dfs_(int p, int i, int c, boolean print) {\n\t\tif (print) {\n\t\t\ta += b;\n\t\t\tprintln((p + 1) + \" \" + (i + 1) + \" \" + (a - c));\n\t\t\tc = a;\n\t\t}\n\t\tfor (int l = ao[i]; l != 0; l = next[l]) {\n\t\t\tint j = jj[l];\n\t\t\tif (j != p)\n\t\t\t\tdfs_(i, j, c, true);\n\t\t}\n\t}\n\tvoid main() {\n\t\tn = sc.nextInt();\n\t\tif (n == 1)\n\t\t\treturn;\n\t\tinit();\n\t\tfor (int h = 0; h < n - 1; h++) {\n\t\t\tint i = sc.nextInt() - 1;\n\t\t\tint j = sc.nextInt() - 1;\n\t\t\tao[i] = link(ao[i], j);\n\t\t\tao[j] = link(ao[j], i);\n\t\t}\n\t\tdfs(-1, 0);\n\t\tif (n_ * 3 >= n) {\n\t\t\tb = 1;\n\t\t\ta = 0;\n\t\t\tdfs_(i_, j_, 0, false);\n\t\t\tb = n - n_;\n\t\t\ta = 0;\n\t\t\tdfs_(j_, i_, 0, true);\n\t\t} else {\n\t\t\tint s = j_;\n\t\t\tdfs(-1, s);\n\t\t\tInteger[] tt = new Integer[n];\n\t\t\tint cnt = 0;\n\t\t\tfor (int l = ao[s]; l != 0; l = next[l])\n\t\t\t\ttt[cnt++] = jj[l];\n\t\t\tArrays.sort(tt, 0, cnt, (i, j) -> cc[i] - cc[j]);\n\t\t\tn_ = 1;\n\t\t\tb = 1;\n\t\t\ta = 0;\n\t\t\tboolean changed = false;\n\t\t\tfor (int h = 0; h < cnt; h++) {\n\t\t\t\tint j = tt[h];\n\t\t\t\tn_ += cc[j];\n\t\t\t\tdfs_(s, j, 0, true);\n\t\t\t\tif (!changed && n_ * 3 >= n) {\n\t\t\t\t\tchanged = true;\n\t\t\t\t\tb = n_;\n\t\t\t\t\ta = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["constructive algorithms", "trees"], "code_uid": "bd0e785ccfec236923a826731bc5e07a", "src_uid": "87d755df6ee27b381122062659c4a432", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class MainF {\n\tstatic final StdIn in = new StdIn();\n\tstatic final PrintWriter out = new PrintWriter(System.out);\n\t\n\tpublic static void main(String[] args) {\n\t\tint n=in.nextInt(), m=in.nextInt();\n\t\tint[] a = in.readIntArray(n, -1), b = in.readIntArray(m, 0);\n\t\tint sb=0;\n\t\tfor(int bi : b)\n\t\t\tsb+=bi;\n\t\tint[] c = new int[m];\n\t\tint cl=m;\n\t\tfor(int bi : b)\n\t\t\tif(bi==0)\n\t\t\t\t--cl;\n\t\tint i1=0;\n\t\twhile(cl>0&&i1<n) {\n\t\t\t++c[a[i1]];\n\t\t\tif(c[a[i1]]==b[a[i1]])\n\t\t\t\t--cl;\n\t\t\t++i1;\n\t\t}\n\t\tint ans=n+1;\n\t\tif(cl==0) {\n\t\t\tfor(int i2=0; ;) {\n\t\t\t\twhile(c[a[i2]]>b[a[i2]])\n\t\t\t\t\t--c[a[i2++]];\n\t\t\t\tans=Math.min(i1-i2-sb, ans);\n\t\t\t\tif(i1>=n)\n\t\t\t\t\tbreak;\n\t\t\t\t++c[a[i1++]];\n\t\t\t}\n\t\t}\n\t\t//E\n\t\tout.println(ans==0?\"YES\":\"NO\");\n\t\t//M\n//\t\tout.println(ans>n?-1:ans);\n\t\tout.close();\n\t}\n\t\n\tstatic class StdIn {\n\t\tfinal private int BUFFER_SIZE = 1 << 16;\n\t\tprivate DataInputStream din;\n\t\tprivate byte[] buffer;\n\t\tprivate int bufferPointer, bytesRead;\n\t\tpublic StdIn() {\n\t\t\tdin = new DataInputStream(System.in);\n\t\t\tbuffer = new byte[BUFFER_SIZE];\n\t\t\tbufferPointer = bytesRead = 0;\n\t\t}\n\t\tpublic StdIn(InputStream in) {\n\t\t\ttry{\n\t\t\t\tdin = new DataInputStream(in);\n\t\t\t} catch(Exception e) {\n\t\t\t\tthrow new RuntimeException();\n\t\t\t}\n\t\t\tbuffer = new byte[BUFFER_SIZE];\n\t\t\tbufferPointer = bytesRead = 0;\n\t\t}\n\t\tpublic String next() {\n\t\t\tint c;\n\t\t\twhile((c=read())!=-1&&(c==' '||c=='\\n'||c=='\\r'));\n\t\t\tStringBuilder s = new StringBuilder();\n\t\t\twhile (c != -1)\n\t\t\t{\n\t\t\t\tif (c == ' ' || c == '\\n'||c=='\\r')\n\t\t\t\t\tbreak;\n\t\t\t\ts.append((char)c);\n\t\t\t\tc=read();\n\t\t\t}\n\t\t\treturn s.toString();\n\t\t}\n\t\tpublic String nextLine() {\n\t\t\tint c;\n\t\t\twhile((c=read())!=-1&&(c==' '||c=='\\n'||c=='\\r'));\n\t\t\tStringBuilder s = new StringBuilder();\n\t\t\twhile (c != -1)\n\t\t\t{\n\t\t\t\tif (c == '\\n'||c=='\\r')\n\t\t\t\t\tbreak;\n\t\t\t\ts.append((char)c);\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\treturn s.toString();\n\t\t}\n\t\tpublic int nextInt() {\n\t\t\tint ret = 0;\n\t\t\tbyte c = read();\n\t\t\twhile (c <= ' ')\n\t\t\t\tc = read();\n\t\t\tboolean neg = (c == '-');\n\t\t\tif (neg)\n\t\t\t\tc = read();\n\t\t\tdo\n\t\t\t\tret = ret * 10 + c - '0';\n\t\t\twhile ((c = read()) >= '0' && c <= '9');\n\n\t\t\tif (neg)\n\t\t\t\treturn -ret;\n\t\t\treturn ret;\n\t\t}\n\t\tpublic int[] readIntArray(int n, int os) {\n\t\t\tint[] ar = new int[n];\n\t\t\tfor(int i=0; i<n; ++i)\n\t\t\t\tar[i]=nextInt()+os;\n\t\t\treturn ar;\n\t\t}\n\t\tpublic long nextLong() {\n\t\t\tlong ret = 0;\n\t\t\tbyte c = read();\n\t\t\twhile (c <= ' ')\n\t\t\t\tc = read();\n\t\t\tboolean neg = (c == '-');\n\t\t\tif (neg)\n\t\t\t\tc = read();\n\t\t\tdo\n\t\t\t\tret = ret * 10 + c - '0';\n\t\t\twhile ((c = read()) >= '0' && c <= '9');\n\t\t\tif (neg)\n\t\t\t\treturn -ret;\n\t\t\treturn ret;\n\t\t}\n\t\tpublic long[] readLongArray(int n, long os) {\n\t\t\tlong[] ar = new long[n];\n\t\t\tfor(int i=0; i<n; ++i)\n\t\t\t\tar[i]=nextLong()+os;\n\t\t\treturn ar;\n\t\t}\n\t\tpublic double nextDouble() {\n\t\t\tdouble ret = 0, div = 1;\n\t\t\tbyte c = read();\n\t\t\twhile (c <= ' ')\n\t\t\t\tc = read();\n\t\t\tboolean neg = (c == '-');\n\t\t\tif (neg)\n\t\t\t\tc = read();\n\t\t\tdo\n\t\t\t\tret = ret * 10 + c - '0';\n\t\t\twhile ((c = read()) >= '0' && c <= '9');\n\t\t\tif (c == '.')\n\t\t\t\twhile ((c = read()) >= '0' && c <= '9')\n\t\t\t\t\tret += (c - '0') / (div *= 10);\n\t\t\tif (neg)\n\t\t\t\treturn -ret;\n\t\t\treturn ret;\n\t\t}\n\t\tprivate void fillBuffer() throws IOException {\n\t\t\tbytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n\t\t\tif (bytesRead == -1)\n\t\t\t\tbuffer[0] = -1;\n\t\t}\n\t\tprivate byte read() {\n\t\t\ttry{\n\t\t\t\tif (bufferPointer == bytesRead)\n\t\t\t\t\tfillBuffer();\n\t\t\t\treturn buffer[bufferPointer++];\n\t\t\t} catch(IOException e) {\n\t\t\t\tthrow new RuntimeException();\n\t\t\t}\n\t\t}\n\t\tpublic void close() throws IOException {\n\t\t\tif (din == null)\n\t\t\t\treturn;\n\t\t\tdin.close();\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "30bba741c2c3496861959550cbfb1660", "src_uid": "59f40d9f35e5fe402112214b42b682b5", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class TaskB\n{\n\tpublic static void main(String[] args)\n\t{\n\t\tnew TaskB(System.in, System.out);\n\t}\n\n\tstatic class Solver implements Runnable\n\t{\n\t\tint n, b;\n\t\tint[] arr;\n\t\tInputReader in;\n\t\tPrintWriter out;\n\n\t\tvoid solve() throws IOException\n\t\t{\n\t\t\tn = in.nextInt();\n\t\t\tb = in.nextInt();\n\t\t\tarr = in.nextIntArray(n);\n\n\t\t\tPriorityQueue<Integer> set = new PriorityQueue<>(Integer::compareTo);\n\t\t\tint odd = 0;\n\t\t\tint even = 0;\n\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t{\n\t\t\t\tif (arr[i] % 2 == 0)\n\t\t\t\t\teven++;\n\t\t\t\telse\n\t\t\t\t\todd++;\n\n\t\t\t\tif (i < n - 1 && even == odd)\n\t\t\t\t\tset.add(Math.abs(arr[i] - arr[i + 1]));\n\t\t\t}\n\n\t\t\tint cnt = 0;\n\n\t\t\twhile (set.size() > 0)\n\t\t\t{\n\t\t\t\tint x = set.poll();\n\n\t\t\t\tif (x <= b)\n\t\t\t\t{\n\t\t\t\t\tcnt++;\n\t\t\t\t\tb -= x;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tout.println(cnt);\n\t\t}\n\n\t\tvoid debug(Object... o)\n\t\t{\n\t\t\tSystem.err.println(Arrays.deepToString(o));\n\t\t}\n\n//\t\tuncomment below line to change to BufferedReader\n//\t\tpublic Solver(BufferedReader in, PrintWriter out)\n\t\tpublic Solver(InputReader in, PrintWriter out)\n\t\t{\n\t\t\tthis.in = in;\n\t\t\tthis.out = out;\n\t\t}\n\n\t\t@Override\n\t\tpublic void run()\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tsolve();\n\t\t\t}\n\t\t\tcatch (IOException e)\n\t\t\t{\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\n\t}\n\n\tstatic class InputReader\n\t{\n\t\tprivate InputStream stream;\n\t\tprivate byte[] buf = new byte[1024];\n\t\tprivate int curChar;\n\t\tprivate int numChars;\n\n\t\tpublic int read()\n\t\t{\n\t\t\tif (numChars == -1)\n\t\t\t\tthrow new InputMismatchException();\n\n\t\t\tif (curChar >= numChars)\n\t\t\t{\n\t\t\t\tcurChar = 0;\n\t\t\t\ttry\n\t\t\t\t{\n\t\t\t\t\tnumChars = stream.read(buf);\n\t\t\t\t}\n\t\t\t\tcatch (IOException e)\n\t\t\t\t{\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (numChars <= 0)\n\t\t\t\t\treturn -1;\n\t\t\t}\n\n\t\t\treturn buf[curChar++];\n\t\t}\n\n\t\tpublic int nextInt()\n\t\t{\n\t\t\tint c = read();\n\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\n\t\t\tint sgn = 1;\n\n\t\t\tif (c == '-')\n\t\t\t{\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\n\t\t\tint res = 0;\n\n\t\t\tdo\n\t\t\t{\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\n\t\t\t\tres *= 10;\n\t\t\t\tres += c & 15;\n\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\n\t\t\treturn res * sgn;\n\t\t}\n\n\t\tpublic int[] nextIntArray(int arraySize)\n\t\t{\n\t\t\tint array[] = new int[arraySize];\n\n\t\t\tfor (int i = 0; i < arraySize; i++)\n\t\t\t\tarray[i] = nextInt();\n\n\t\t\treturn array;\n\t\t}\n\n\t\tpublic long nextLong()\n\t\t{\n\t\t\tint c = read();\n\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\n\t\t\tint sign = 1;\n\n\t\t\tif (c == '-')\n\t\t\t{\n\t\t\t\tsign = -1;\n\n\t\t\t\tc = read();\n\t\t\t}\n\n\t\t\tlong result = 0;\n\n\t\t\tdo\n\t\t\t{\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\n\t\t\t\tresult *= 10;\n\t\t\t\tresult += c & 15;\n\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\n\t\t\treturn result * sign;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int arraySize)\n\t\t{\n\t\t\tlong array[] = new long[arraySize];\n\n\t\t\tfor (int i = 0; i < arraySize; i++)\n\t\t\t\tarray[i] = nextLong();\n\n\t\t\treturn array;\n\t\t}\n\n\t\tpublic float nextFloat()\n\t\t{\n\t\t\tfloat result, div;\n\t\t\tbyte c;\n\n\t\t\tresult = 0;\n\t\t\tdiv = 1;\n\t\t\tc = (byte) read();\n\n\t\t\twhile (c <= ' ')\n\t\t\t\tc = (byte) read();\n\n\t\t\tboolean isNegative = (c == '-');\n\n\t\t\tif (isNegative)\n\t\t\t\tc = (byte) read();\n\n\t\t\tdo\n\t\t\t{\n\t\t\t\tresult = result * 10 + c - '0';\n\t\t\t} while ((c = (byte) read()) >= '0' && c <= '9');\n\n\t\t\tif (c == '.')\n\t\t\t\twhile ((c = (byte) read()) >= '0' && c <= '9')\n\t\t\t\t\tresult += (c - '0') / (div *= 10);\n\n\t\t\tif (isNegative)\n\t\t\t\treturn -result;\n\n\t\t\treturn result;\n\t\t}\n\n\t\tpublic double nextDouble()\n\t\t{\n\t\t\tdouble ret = 0, div = 1;\n\t\t\tbyte c = (byte) read();\n\n\t\t\twhile (c <= ' ')\n\t\t\t\tc = (byte) read();\n\n\t\t\tboolean neg = (c == '-');\n\n\t\t\tif (neg)\n\t\t\t\tc = (byte) read();\n\n\t\t\tdo\n\t\t\t{\n\t\t\t\tret = ret * 10 + c - '0';\n\t\t\t} while ((c = (byte) read()) >= '0' && c <= '9');\n\n\t\t\tif (c == '.')\n\t\t\t\twhile ((c = (byte) read()) >= '0' && c <= '9')\n\t\t\t\t\tret += (c - '0') / (div *= 10);\n\n\t\t\tif (neg)\n\t\t\t\treturn -ret;\n\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic String next()\n\t\t{\n\t\t\tint c = read();\n\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\n\t\t\tStringBuilder res = new StringBuilder();\n\n\t\t\tdo\n\t\t\t{\n\t\t\t\tres.appendCodePoint(c);\n\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tpublic String nextLine()\n\t\t{\n\t\t\tint c = read();\n\n\t\t\tStringBuilder result = new StringBuilder();\n\n\t\t\tdo\n\t\t\t{\n\t\t\t\tresult.appendCodePoint(c);\n\n\t\t\t\tc = read();\n\t\t\t} while (!isNewLine(c));\n\n\t\t\treturn result.toString();\n\t\t}\n\n\t\tpublic boolean isNewLine(int c)\n\t\t{\n\t\t\treturn c == '\\n';\n\t\t}\n\n\t\tpublic boolean isSpaceChar(int c)\n\t\t{\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n\n\t\tpublic void close()\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tstream.close();\n\t\t\t}\n\t\t\tcatch (IOException e)\n\t\t\t{\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\n\t\tpublic InputReader(InputStream stream)\n\t\t{\n\t\t\tthis.stream = stream;\n\t\t}\n\n\t}\n\n\tstatic class CMath\n\t{\n\t\tstatic long power(long number, long power)\n\t\t{\n\t\t\tif (number == 1 || number == 0 || power == 0)\n\t\t\t\treturn 1;\n\n\t\t\tif (power == 1)\n\t\t\t\treturn number;\n\n\t\t\tif (power % 2 == 0)\n\t\t\t\treturn power(number * number, power / 2);\n\t\t\telse\n\t\t\t\treturn power(number * number, power / 2) * number;\n\t\t}\n\n\t\tstatic long modPower(long number, long power, long mod)\n\t\t{\n\t\t\tif (number == 1 || number == 0 || power == 0)\n\t\t\t\treturn 1;\n\n\t\t\tnumber = mod(number, mod);\n\n\t\t\tif (power == 1)\n\t\t\t\treturn number;\n\n\t\t\tlong square = mod(number * number, mod);\n\n\t\t\tif (power % 2 == 0)\n\t\t\t\treturn modPower(square, power / 2, mod);\n\t\t\telse\n\t\t\t\treturn mod(modPower(square, power / 2, mod) * number, mod);\n\t\t}\n\n\t\tstatic long moduloInverse(long number, long mod)\n\t\t{\n\t\t\treturn modPower(number, mod - 2, mod);\n\t\t}\n\n\t\tstatic long mod(long number, long mod)\n\t\t{\n\t\t\treturn number - (number / mod) * mod;\n\t\t}\n\n\t\tstatic int gcd(int a, int b)\n\t\t{\n\t\t\tif (b == 0)\n\t\t\t\treturn a;\n\t\t\telse\n\t\t\t\treturn gcd(b, a % b);\n\t\t}\n\n\t\tstatic long min(long... arr)\n\t\t{\n\t\t\tlong min = arr[0];\n\n\t\t\tfor (int i = 1; i < arr.length; i++)\n\t\t\t\tmin = Math.min(min, arr[i]);\n\n\t\t\treturn min;\n\t\t}\n\n\t\tstatic long max(long... arr)\n\t\t{\n\t\t\tlong max = arr[0];\n\n\t\t\tfor (int i = 1; i < arr.length; i++)\n\t\t\t\tmax = Math.max(max, arr[i]);\n\n\t\t\treturn max;\n\t\t}\n\n\t\tstatic int min(int... arr)\n\t\t{\n\t\t\tint min = arr[0];\n\n\t\t\tfor (int i = 1; i < arr.length; i++)\n\t\t\t\tmin = Math.min(min, arr[i]);\n\n\t\t\treturn min;\n\t\t}\n\n\t\tstatic int max(int... arr)\n\t\t{\n\t\t\tint max = arr[0];\n\n\t\t\tfor (int i = 1; i < arr.length; i++)\n\t\t\t\tmax = Math.max(max, arr[i]);\n\n\t\t\treturn max;\n\t\t}\n\n\t}\n\n\tstatic class Utils\n\t{\n\t\tstatic boolean nextPermutation(int[] arr)\n\t\t{\n\t\t\tfor (int a = arr.length - 2; a >= 0; --a)\n\t\t\t{\n\t\t\t\tif (arr[a] < arr[a + 1])\n\t\t\t\t{\n\t\t\t\t\tfor (int b = arr.length - 1; ; --b)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (arr[b] > arr[a])\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tint t = arr[a];\n\n\t\t\t\t\t\t\tarr[a] = arr[b];\n\t\t\t\t\t\t\tarr[b] = t;\n\n\t\t\t\t\t\t\tfor (++a, b = arr.length - 1; a < b; ++a, --b)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tt = arr[a];\n\t\t\t\t\t\t\t\tarr[a] = arr[b];\n\t\t\t\t\t\t\t\tarr[b] = t;\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn false;\n\t\t}\n\n\t}\n\n\tpublic TaskB(InputStream inputStream, OutputStream outputStream)\n\t{\n//\t\tuncomment below line to change to BufferedReader\n//\t\tBufferedReader in = new BufferedReader(new InputStreamReader(inputStream));\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tThread thread = new Thread(null, new Solver(in, out), \"TaskB\", 1 << 29);\n\n\t\ttry\n\t\t{\n\t\t\tthread.start();\n\t\t\tthread.join();\n\t\t}\n\t\tcatch (InterruptedException e)\n\t\t{\n\t\t\te.printStackTrace();\n\t\t}\n\t\tfinally\n\t\t{\n\t\t\tin.close();\n\t\t\tout.flush();\n\t\t\tout.close();\n\t\t}\n\t}\n\n}\n\n/*\n\n\n\n*/\n", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "dac48cdd2eec77482dfe8a47b8bc5a51", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collection;\nimport java.util.HashMap;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.StringTokenizer;\nimport java.util.stream.Stream;\n\npublic class TestClass implements Runnable {\n\t\n\tstatic final double time = 1e9;\n\tstatic final int MOD = (int) 1e9 + 7;\n\tstatic final long mh = Long.MAX_VALUE;\n\tstatic final Reader in = new Reader();\n\tstatic final PrintWriter out = new PrintWriter(System.out);\n\tStringBuilder answer = new StringBuilder();\n\n\tpublic static void main(String[] args) {\n\t\tnew Thread(null, new TestClass(), \"persefone\", 1 << 28).start();\n\t}\n\n\t@Override\n\tpublic void run() {\n\t\tlong start = System.nanoTime();\n\t\tsolve();\t\t\n\t\tprintf();\n\t\tlong elapsed = System.nanoTime() - start;\n//\t\tout.println(\"stamp : \" + elapsed / time);\n//\t\tout.println(\"stamp : \" + TimeUnit.SECONDS.convert(elapsed, TimeUnit.NANOSECONDS));\n\t\tclose();\n\t}\n\n\t\n\tvoid solve() {\n\t\tint n = in.nextInt(), x = in.nextInt();\n\t\tint[] a = new int[n + 1];\n\t\tfor (int i = 1; i <= n; i++) a[i] = in.nextInt();\n\t\ta[0] = a[1];\n\t\tint[][] f = new int[n + 1][x + 1];\n\t\t\n\t\tfor (int i = 2; i <= n; i += 2) {\n\t\t\tint even = a[i] % 2 == 0 ? 1 : 0;\n\t\t\tfor (int j = i - 1; j > 1; j--) {\n\t\t\t\tif (a[j] % 2 == 0) even++;\n\t\t\t\tif (even * 2 == i - j + 1) {\n\t\t\t\t\tint d = Math.abs(a[j] - a[j - 1]);\n\t\t\t\t\tfor (int k = 0; k <= x; k++) \n\t\t\t\t\t\tif (d <= k)\n\t\t\t\t\t\t\tf[i][k] = Math.max(f[j - 1][k - d] + 1, f[i][k]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n//\t\tprintf(f);\n\t\tprintf(f[n][x]);\n \t}\n\t\n\t\t\t\t\n\tpublic interface Hash {\n\t\tpublic void computeHashArray();\n\t\tpublic void computeModArray();\n\t\t\n\t}\n\t\n\tclass StringHash implements Hash {\n\t\t// length of string s\n\t\tprivate final long MH = Long.MAX_VALUE;\n\t\tprivate int n;\n\t\tprivate char[] ch;\n\t\tprivate long[] hash, mod;\n\t\tStringHash(char[] ch) {\n\t\t\tthis.ch = ch;\n\t\t\tn = ch.length;\n\t\t\thash = new long[n + 1];\n\t\t\tmod = new long[n + 1];\n\t\t\tcomputeHashArray();\n\t\t\tcomputeModArray();\n\t\t}\n\t\t\n\t\tStringHash(String s) {\n\t\t\tthis(s.toCharArray());\n\t\t}\n\t\t\n\t\tStringHash(CharSequence s) {\n\t\t\tthis(s.toString());\n\t\t}\n\t\t\n\t\t@Override\n\t\tpublic void computeModArray() {\n\t\t\tmod[0] = 1;\n\t\t\tfor (int i = 1; i <= n; i++) mod[i] = (mod[i - 1] * 53) % MH;\n\t\t}\n\t\t\n\t\t@Override\n\t\tpublic void computeHashArray() {\n\t\t\tfor (int i = 0; i < n; i++) hash[i + 1] = (hash[i] * 53 + ch[i] - 'a') % MH;\n\t\t}\n\t\t\n\t\tpublic long getHash(int i, int j) {\n\t\t\treturn (hash[j] - hash[i] * mod[j - i] + MH * MH) % MH;\n\t\t}\n\t\t\n\t\tpublic long getHash(String s) {\n\t\t\tlong h = 0;\n\t\t\tfor (int i = 0; i < s.length(); i++) h = (h * 53 + s.charAt(i) - 'a') % MH;\n\t\t\treturn h;\n\t\t}\n\t\t\n\t\tpublic long[] getHashArray() { return hash; }\n\t\tpublic long[] getModArray() { return mod; }\n\t}\n\t\n\tpublic interface Manacher {\n\t\tpublic void oddPalindrome();\n\t\tpublic void evenPalindrome();\n\t}\n\t\n\tclass Palindrome implements Manacher {\n\t\tprivate int n;\n\t\tprivate char[] ch;\n\t\tprivate int[] oddPal, evenPal;\n\t\tpublic Palindrome() {}\n\t\tpublic Palindrome(String s) {\n\t\t\tthis(s.toCharArray());\n\t\t}\n\t\tpublic Palindrome(char[] ch) {\n\t\t\tthis.ch = ch;\n\t\t\tn = ch.length;\n\t\t\toddPal = new int[ch.length];\n\t\t\tevenPal = new int[ch.length];\n\t\t\toddPalindrome();\n\t\t\tevenPalindrome();\n\t\t}\n\t\t\n\t\t@Override\n\t\tpublic void oddPalindrome() {\n\t\t\tfor (int i = 0, l = 0, r = -1; i < n; i++) {\n\t\t\t\tint k = i > r ? 1 : Math.min(oddPal[r + l - i], r - i);\n\t\t\t\twhile (0 <= i - k && i + k < n && ch[i - k] == ch[i + k]) k++;\n\t\t\t\toddPal[i] = k--;\n\t\t\t\tif (i + k > r) { \n\t\t\t\t\tl = i - k;\n\t\t\t\t\tr = i + k;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t@Override\n\t\tpublic void evenPalindrome() {\n\t\t\tfor (int i = 0, l = 0, r = -1; i < n; i++) {\n\t\t\t\tint k = i > r ? 0 : Math.min(evenPal[r + l - i + 1], r - i + 1);\n\t\t\t\twhile (0 <= i - k - 1 && i + k < n && ch[i - k - 1] == ch[i + k]) k++;\n\t\t\t\tevenPal[i] = k--;\n\t\t\t\tif (i + k > r) {\n\t\t\t\t\tl = i - k - 1;\n\t\t\t\t\tr = i + k;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n\t\n\tvoid printf() {\n\t\tout.print(answer);\n\t}\n\t\n\tvoid close() {\n\t\tout.close();\n\t}\n\n\tvoid printf(Stream<?> str) {\n\t\tstr.forEach(o -> add(o, \" \"));\n\t\tadd(\"\\n\");\n\t}\n\n\t \n\tvoid printf(Object... obj) {\n\t\tprintf(false, obj);\n\t}\n\n\tvoid printfWithDescription(Object... obj) {\n\t\tprintf(true, obj);\n\t}\n\t\n\t\t\n\tprivate void printf(boolean b, Object... obj) {\n\n\t\tif (obj.length > 1) {\n\t\t\tfor (int i = 0; i < obj.length; i++) {\n\t\t\t\tif (b) add(obj[i].getClass().getSimpleName(), \" - \");\n\t\t\t\tif (obj[i] instanceof Collection<?>) {\n\t\t\t\t\tprintf((Collection<?>) obj[i]);\n\t\t\t\t} else if (obj[i] instanceof int[][]) {\n\t\t\t\t\tprintf((int[][])obj[i]);\n\t\t\t\t} else if (obj[i] instanceof long[][]) {\n\t\t\t\t\tprintf((long[][])obj[i]);\n\t\t\t\t} else if (obj[i] instanceof double[][]) {\n\t\t\t\t\tprintf((double[][])obj[i]);\n\t\t\t\t} else printf(obj[i]);\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\n\t\tif (b) add(obj[0].getClass().getSimpleName(), \" - \");\n\t\tprintf(obj[0]);\n\t}\n\n\tvoid printf(Object o) {\n\t\tif (o instanceof int[])\n\t\t\tprintf(Arrays.stream((int[]) o).boxed());\n\t\telse if (o instanceof char[])\n\t\t\tprintf(new String((char[]) o));\n\t\telse if (o instanceof long[])\n\t\t\tprintf(Arrays.stream((long[]) o).boxed());\n\t\telse if (o instanceof double[])\n\t\t\tprintf(Arrays.stream((double[]) o).boxed());\n\t\telse if (o instanceof boolean[]) {\n\t\t\tfor (boolean b : (boolean[]) o) add(b, \" \");\n\t\t\tadd(\"\\n\");\n\t\t}\n\t\telse \n\t\t\tadd(o, \"\\n\");\n\t}\n\n\tvoid printf(int[]... obj) {\n\t\tfor (int i = 0; i < obj.length; i++) printf(obj[i]);\n\t}\n\t\n\tvoid printf(long[]... obj) {\n\t\tfor (int i = 0; i < obj.length; i++) printf(obj[i]);\n\t}\n\t\n\tvoid printf(double[]... obj) {\n\t\tfor (int i = 0; i < obj.length; i++) printf(obj[i]);\n\t}\n\t\n\tvoid printf(boolean[]... obj) {\n\t\tfor (int i = 0; i < obj.length; i++) printf(obj[i]);\n\t}\n\t\n\tvoid printf(Collection<?> col) {\n\t\tprintf(col.stream());\n\t}\n\n\t<T, K> void add(T t, K k) {\n\t\tif (t instanceof Collection<?>) {\n\t\t\t((Collection<?>) t).forEach(i -> add(i, \" \"));\n\t\t} else if (t instanceof Object[]) {\n\t\t\tArrays.stream((Object[]) t).forEach(i -> add(i, \" \"));\n\t\t} else\n\t\t\tadd(t);\n\t\tadd(k);\n\t}\n\t\n\t\n\t\n\t<T> void add(T t) {\n\t\tanswer.append(t);\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\t<T extends Comparable<? super T>> T min(T... t) {\n\t\tif (t.length == 0)\n\t\t\treturn null;\n\t\tT m = t[0];\n\t\tfor (int i = 1; i < t.length; i++)\n\t\t\tif (t[i].compareTo(m) < 0)\n\t\t\t\tm = t[i];\n\t\treturn m;\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\t<T extends Comparable<? super T>> T max(T... t) {\n\t\tif (t.length == 0)\n\t\t\treturn null;\n\t\tT m = t[0];\n\t\tfor (int i = 1; i < t.length; i++)\n\t\t\tif (t[i].compareTo(m) > 0)\n\t\t\t\tm = t[i];\n\t\treturn m;\n\t}\n\n\tint gcd(int a, int b) {\n\t\treturn (b == 0) ? a : gcd(b, a % b);\n\t}\n\n\tlong gcd(long a, long b) {\n\t\treturn (b == 0) ? a : gcd(b, a % b);\n\t}\n\t\n\t// c = gcd(a, b) -> extends gcd method: ax + by = c <----> (b % a)p + q = c;\n\tint[] ext_gcd(int a, int b) {\n\t\tif (b == 0) return new int[] {a, 1, 0 };\n\t\tint[] vals = ext_gcd(b, a % b);\n\t\tint d = vals[0]; // gcd\n\t int p = vals[2]; // \n\t\tint q = vals[1] - (a / b) * vals[2];\n\t\treturn new int[] { d, p, q };\t \n\t}\n\t\n\t// find any solution of the equation: ax + by = c using extends gcd\n\tboolean find_any_solution(int a, int b, int c, int[] root) {\n\t\tint[] vals = ext_gcd(Math.abs(a), Math.abs(b));\n\t\tif (c % vals[0] != 0) return false;\n\t\tprintf(vals);\n\t\troot[0] = c * vals[1] / vals[0];\n\t\troot[1] = c * vals[2] / vals[0];\n\t\tif (a < 0) root[0] *= -1;\n\t\tif (b < 0) root[1] *= -1;\n\t\treturn true;\n\t}\n\t\n\tint mod(int x) { return x % MOD; }\n\t\n\tint mod(int x, int y) { return mod(mod(x) + mod(y)); }\n\t\n\tlong mod(long x) { return x % MOD; }\n\t\n\tlong mod (long x, long y) { return mod(mod(x) + mod(y)); }\n\t\n\tint lw(long[] f, int l, int r, long k) {\n\t\tint R = r, m = 0;\n\t\twhile (l <= r) {\n\t\t\tm = l + r >> 1;\n\t\t if (m == R) return m;\n\t\t if (f[m] >= k) r = m - 1; else l = m + 1;\n\t\t}\n\t\treturn l;\n\t}\n\t\n\tint up(long[] f, int l, int r, long k) {\n\t\tint R = r, m = 0;\n\t\twhile (l <= r) {\n\t\t\tm = l + r >> 1;\n\t\t if (m == R) return m;\n\t\t if (f[m] > k) r = m - 1; else l = m + 1;\n\t\t}\n\t\treturn l;\n\t}\n\t\n\tint lw(int[] f, int l, int r, int k) {\n//\t\tint R = r, m = 0;\n\t\twhile (l <= r) {\n\t\t\tint m = l + r >> 1;\n//\t\t if (m == R) return m;\n\t\t if (f[m] >= k) r = m - 1; else l = m + 1;\n\t\t}\n\t\treturn l;\n\t}\n\t\n\tint up(int[] f, int l, int r, int k) {\n\t\tint R = r, m = 0;\n\t\twhile (l <= r) {\n\t\t\tm = l + r >> 1;\n\t\t if (m == R) return m;\n\t\t if (f[m] > k) r = m - 1; else l = m + 1;\n\t\t}\n\t\treturn l;\n\t}\n\n\tlong calc(int base, int exponent) {\n\t\tif (exponent == 0) return 1;\n\t\tlong m = calc(base, exponent >> 1);\n\t\tif (exponent % 2 == 0) return m * m % MOD;\n\t\treturn base * m * m % MOD;\n\t}\n\t\n\tlong power(int base, int exponent) {\n\t\tif (exponent == 0) return 1;\n\t\tlong m = power(base, exponent >> 1);\n\t\tif (exponent % 2 == 0) return m * m;\n\t\treturn base * m * m;\n\t}\n\t\n\tvoid swap(int[] a, int i, int j) {\n\t\ta[i] ^= a[j];\n\t\ta[j] ^= a[i];\n\t\ta[i] ^= a[j];\n\t}\n\t\n\tvoid swap(long[] a, int i, int j) {\n\t\tlong tmp = a[i];\n\t\ta[i] = a[j];\n\t\ta[j] = tmp;\n\t}\n\t\n\tstatic class Pair<K extends Comparable<? super K>, V extends Comparable<? super V>>\n\t\t\timplements Comparable<Pair<K, V>> {\n\t\tprivate K k;\n\t\tprivate V v;\n\n\t\tPair() {}\n\n\t\tPair(K k, V v) {\n\t\t\tthis.k = k;\n\t\t\tthis.v = v;\n\t\t}\n\n\t\tK getK() { return k; }\n\n\t\tV getV() { return v; }\n\n\t\tvoid setK(K k) { this.k = k; }\n\n\t\tvoid setV(V v) { this.v = v; }\n\n\t\tvoid setKV(K k, V v) {\n\t\t\tthis.k = k;\n\t\t\tthis.v = v;\n\t\t}\n\n\t\t@SuppressWarnings(\"unchecked\")\n\t\t@Override\n\t\tpublic boolean equals(Object o) {\n\t\t\tif (this == o) return true;\n\t\t\tif (o == null || !(o instanceof Pair)) return false;\n\t\t\tPair<K, V> p = (Pair<K, V>) o;\n\t\t\treturn k.compareTo(p.k) == 0 && v.compareTo(p.v) == 0;\n\t\t}\n\n\t\t@Override\n\t\tpublic int hashCode() {\n\t\t\tint hash = 31;\n\t\t\thash = hash * 89 + k.hashCode();\n\t\t\thash = hash * 89 + v.hashCode();\n\t\t\treturn hash;\n\t\t}\n\n\t\t@Override\n\t\tpublic int compareTo(Pair<K, V> pair) {\n\t\t\treturn k.compareTo(pair.k) == 0 ? v.compareTo(pair.v) : k.compareTo(pair.k);\n\t\t}\n\n\t\t@Override\n\t\tpublic Pair<K, V> clone() {\n\t\t\treturn new Pair<K, V>(this.k, this.v);\n\t\t}\n\n\t\t@Override\n\t\tpublic String toString() {\n\t\t\treturn String.valueOf(k).concat(\" \").concat(String.valueOf(v)).concat(\"\\n\");\n\t\t}\n\t}\n\n\tstatic class Reader {\n\t\tprivate BufferedReader br;\n\t\tprivate StringTokenizer st;\n\n\t\tReader() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tString next() {\n\t\t\ttry {\n\t\t\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t}\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tint[] nextIntArray(int n) {\n\t\t\tint[] arr = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarr[i] = nextInt();\n\t\t\treturn arr;\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tString nextLine() {\n\t\t\tString s = \"\";\n\t\t\ttry {\n\t\t\t\ts = br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn s;\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "c60a769642aa5d7a3f92264bbaa1f30c", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.math.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.regex.*;\n \npublic class Solution \n{\n static class InputReader\n\t{\n\t private final InputStream stream;\n\t private final byte[] buf = new byte[8192];\n\t private int curChar, snumChars;\n \n\t public InputReader(InputStream st) {\n\t this.stream = st;\n\t }\n \n\t public int read() {\n\t if (snumChars == -1)\n\t throw new InputMismatchException();\n\t if (curChar >= snumChars) {\n\t curChar = 0;\n\t try {\n\t snumChars = stream.read(buf);\n\t } catch (IOException e) {\n\t throw new InputMismatchException();\n\t }\n\t if (snumChars <= 0)\n\t return -1;\n\t }\n\t return buf[curChar++];\n\t }\n \n\t public int nextInt() {\n\t int c = read();\n\t while (isSpaceChar(c)) {\n\t c = read();\n\t }\n\t int sgn = 1;\n\t if (c == '-') {\n\t sgn = -1;\n\t c = read();\n\t }\n\t int res = 0;\n\t do {\n\t res *= 10;\n\t res += c - '0';\n\t c = read();\n\t } while (!isSpaceChar(c));\n\t return res * sgn;\n\t }\n \n\t public long nextLong() {\n\t int c = read();\n\t while (isSpaceChar(c)) {\n\t c = read();\n\t }\n\t int sgn = 1;\n\t if (c == '-') {\n\t sgn = -1;\n\t c = read();\n\t }\n\t long res = 0;\n\t do {\n\t res *= 10;\n\t res += c - '0';\n\t c = read();\n\t } while (!isSpaceChar(c));\n\t return res * sgn;\n\t }\n \n\t public int[] nextIntArray(int n) {\n\t int a[] = new int[n];\n\t for (int i = 0; i < n; i++) {\n\t a[i] = nextInt();\n\t }\n\t return a;\n\t }\n \n\t public String readString() {\n\t int c = read();\n\t while (isSpaceChar(c)) {\n\t c = read();\n\t }\n\t StringBuilder res = new StringBuilder();\n\t do {\n\t res.appendCodePoint(c);\n\t c = read();\n\t } while (!isSpaceChar(c));\n\t return res.toString();\n\t }\n \n\t public String nextLine() {\n\t int c = read();\n\t while (isSpaceChar(c))\n\t c = read();\n\t StringBuilder res = new StringBuilder();\n\t do {\n\t res.appendCodePoint(c);\n\t c = read();\n\t } while (!isEndOfLine(c));\n\t return res.toString();\n\t }\n \n\t public boolean isSpaceChar(int c) {\n\t return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t }\n \n\t private boolean isEndOfLine(int c) {\n\t return c == '\\n' || c == '\\r' || c == -1;\n\t }\n\t}\n /*static class node implements Comparable<node>\n {\n int index;\n int val;\n node(int a1,int a2)\n {\n index=a1;\n val=a2;\n }\n public int compareTo(node n1)\n {\n return(this.val-n1.val);\n }\n }*/\n public static void main(String[] args) throws IOException \n {\n InputReader in=new InputReader(System.in);\n int n=in.nextInt();\n int b=in.nextInt();\n int [] a=new int[n];\n a=in.nextIntArray(n);\n int[] odd=new int[n+1];\n int[] even=new int[n+1];\n odd[0]=0;\n even[0]=0;\n for(int i=1;i<=n;i++)\n {\n if(a[i-1]%2==1)\n {\n odd[i]=odd[i-1]+1;\n even[i]=even[i-1];\n }\n else\n {\n odd[i]=odd[i-1];\n even[i]=even[i-1]+1;\n }\n }\n int prev=0;\n PriorityQueue<Integer> cost=new PriorityQueue<Integer>();\n for(int i=1;i<=n-1;i++)\n {\n int oc=odd[i]-odd[prev];\n int ec=even[i]-even[prev];\n if(oc==ec)\n {\n cost.add((int)Math.abs(a[i]-a[i-1]));\n //System.out.println((int)Math.abs(a[i]-a[i-1]));\n prev=i;\n }\n }\n int sum=0;\n int count=0;\n while(!cost.isEmpty() && sum<=b)\n {\n sum+=cost.peek().intValue();\n cost.poll();\n count++;\n }\n if(count==0)\n {\n System.out.println(\"0\");\n }\n else\n {\n if(cost.isEmpty() && sum<=b)\n {\n System.out.println(count);\n }\n else\n {\n System.out.println(count-1);\n }\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "c8bdbc3220945d9b9763f8480aa4873d", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// package codeforces;\n\n/**\n * Created by sky on 1/7/18.\n * www.github.com/aakashjaiswal1\n * aakashjaiswal@hotmail.co.in\n * aakashjaiswal.in@gmail.com\n * people die if they are killed\n */\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.*;\n\n/**\n * Created by sky on 13/4/18.\n * www.github.com/aakashjaiswal1\n * aakashjaiswal@hotmail.co.in\n * aakashjaiswal.in@gmail.com\n * people die if they are killed\n */\n public class default_t {\n\n public static void main(String[] args) {\n in = new FastReader();\n int n=ni();\n int B=ni();\n int[] arr=takeIntegerArrayInput(n);\n PriorityQueue<Integer> pq=new PriorityQueue<>();\n int e=0;\n int o=0;\n for (int i=0;i<n-1;i++){\n int ele=arr[i];\n if (ele%2==0)e++;\n else o++;\n if (e==o){\n pq.add(Math.abs(arr[i]-arr[i+1]));\n }\n }\n long ans=0;\n while (B>=0&&pq.size()>0){\n B-=pq.poll();\n if (B<0)break;\n ans++;\n }\n System.out.println(ans);\n\n }\n public static long binarySearch(long low, long high) {\n while (high - low > 1) {\n long mid = (high - low)/2 + low;\n //System.out.println(mid);\n if (works(mid)) {\n high = mid;\n } else {\n low = mid;\n }\n }\n return (works(low) ? low : high);\n }\n static private boolean works(long test){\n return true;\n }\n\n\n static void reverse(char[] arr ,int i,int j){\n if (i==j)\n return;\n while (i<j){\n char temp=arr[i];\n arr[i]=arr[j];\n arr[j]=temp;\n ++i;\n --j;\n }\n }\n static int[] takeIntegerArrayInput(int no){\n int[] arr=new int[no];\n for (int i=0;i<no;++i){\n arr[i]=ni();\n }\n return arr;\n }\n static long fast_Multiply(long no , long pow){\n long result=1;\n while (pow>0){\n if ((pow&1)==1){\n result=result*no;\n }\n no=no*no;\n pow>>=1;\n }\n return result;\n }\n\n static long[] takeLongArrayInput(int no){\n long[] arr=new long[no];\n for (int i=0;i<no;++i){\n arr[i]=ni();\n }\n return arr;\n }\n static final long MOD = (long)1e9+7;\n static FastReader in;\n\n\n static void p(Object o){\n System.out.print(o);\n }\n\n static void pn(Object o){\n System.out.println(o);\n }\n\n static String n(){\n return in.next();\n }\n\n static String nln(){\n return in.nextLine();\n }\n\n static int ni(){\n return Integer.parseInt(in.next());\n }\n\n static int[] ia(int N){\n int[] a = new int[N];\n for(int i = 0; i<N; i++)a[i] = ni();\n return a;\n }\n\n static long[] la(int N){\n long[] a = new long[N];\n for(int i = 0; i<N; i++)a[i] = nl();\n return a;\n }\n\n static long nl(){\n return Long.parseLong(in.next());\n }\n\n static double nd(){\n return Double.parseDouble(in.next());\n }\n\n static class FastReader{\n BufferedReader br;\n StringTokenizer st;\n public FastReader(){\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n String next(){\n while (st == null || !st.hasMoreElements()){\n try{\n st = new StringTokenizer(br.readLine());\n }catch (IOException e){\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n String nextLine(){\n String str = \"\";\n try{\n str = br.readLine();\n }catch (IOException e){\n e.printStackTrace();\n }\n return str;\n }\n }\n static void println(String[] arr){\n for (int i=0;i<arr.length;++i){\n System.out.println(arr[i]);\n }\n }\n\n}\n\n", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "8b10ba9488053e5b2737ca2a65dac69e", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package math_codet;\n\nimport java.io.InputStream;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.util.*;\n /******************************************\n* AUTHOR: AMAN KUMAR SINGH *\n* INSTITUITION: KALYANI GOVERNMENT ENGINEERING COLLEGE *\n******************************************/\npublic class lets_do {\n public static void main(String[] args) throws java.lang.Exception{\n InputReader in=new InputReader(System.in);\n StringBuffer str=new StringBuffer();\n int n=in.nextInt();\n int b=in.nextInt();\n int[] arr1=new int[n];\n int i=0;\n for(i=0;i<n;i++){\n arr1[i]=in.nextInt();\n }\n int odd=0,even=0;\n int[] pf1=new int[n];\n int[] pf2=new int[n];\n int sum1=0,sum2=0;\n for(i=0;i<n;i++){\n if(arr1[i]%2==0)\n sum1++;\n else\n sum2++;\n pf1[i]=sum1;\n pf2[i]=sum2;\n }\n int prev=0;\n int[] arr=new int[n];\n int p=0;\n for(i=1;i<n-2;i+=2){\n int x,y;\n if(prev==0){\n x=pf1[i];\n y=pf2[i];\n }\n else{\n x=pf1[i]-pf1[prev];\n y=pf2[i]-pf2[prev];\n }\n if(x==y){\n arr[p]=Math.abs(arr1[i+1]-arr1[i]);\n p++;\n }\n }\n \n int[] val=new int[p];\n for(i=0;i<p;i++)\n val[i]=1;\n int K[][] = new int[p+1][b+1];\n for (i = 0; i <= p; i++)\n {\n for (int w = 0; w <= b; w++)\n {\n if (i==0 || w==0)\n K[i][w] = 0;\n else if (arr[i-1] <= w)\n K[i][w] = Math.max(val[i-1] + K[i-1][w-arr[i-1]], K[i-1][w]);\n else\n K[i][w] = K[i-1][w];\n } \n }\n System.out.println(K[p][b]);\n }\n\n static class InputReader{\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n \n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n \n public int read() {\n if (numChars == -1)\n throw new UnknownError();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new UnknownError();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n \n public int peek() {\n if (numChars == -1)\n return -1;\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n return -1;\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar];\n }\n \n public void skip(int x) {\n while (x-- > 0)\n read();\n }\n \n public int nextInt() {\n return Integer.parseInt(next());\n }\n \n public long nextLong() {\n return Long.parseLong(next());\n }\n \n public String nextString() {\n return next();\n }\n \n public String next() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuffer res = new StringBuffer();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n \n return res.toString();\n }\n \n public String nextLine() {\n StringBuffer buf = new StringBuffer();\n int c = read();\n while (c != '\\n' && c != -1) {\n if (c != '\\r')\n buf.appendCodePoint(c);\n c = read();\n }\n return buf.toString();\n }\n \n public double nextDouble() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n \n public boolean hasNext() {\n int value;\n while (isSpaceChar(value = peek()) && value != -1)\n read();\n return value != -1;\n }\n \n private boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n }\n}", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "41730d1d21e37424e19b2b96525c0d94", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\n\nimport java.util.*;\n\npublic class Main {\n\tstatic int p=0,ip=0;\n\tstatic ArrayList<Integer> cuts=new ArrayList<>();\n\tpublic static void main(String args[]) {\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tint b=sc.nextInt();\n\t\tint tab[]=new int[n];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\ttab[i]=sc.nextInt();\n\t\t\tif(tab[i]%2==0) p++;\n\t\t\telse ip++;\n\t\t}\n\t\tif(p!=ip) System.out.println(0);\n\t\telse {\n\t\t\tcut(tab);\n\t\t\tCollections.sort(cuts);\n\t\t\tint res=0;\n\t\t\tint count=0;\n\t\t\tfor(int i=0;i<cuts.size();i++) {\n\t\t\t\tif(res+cuts.get(i)<=b) {\n\t\t\t\t\tres+=cuts.get(i);\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t\telse break;\n\t\t\t}\n\t\t\tSystem.out.println(count);\n\t\t}\n\t}\n\tpublic static void cut(int tab[]) {\n\t\tint res=0;\n\t\tint pp=0;\n\t\tint iip=0;\n\t\tint min=1000;\n\t\tfor(int i=0;i<tab.length-1;i++) {\n\t\t\tif(tab[i]%2==0) pp++;\n\t\t\telse iip++;\n\t\t\tif(pp==iip) {\n\t\t\t\tcuts.add(Math.abs(tab[i+1]-tab[i]));\n\t\t\t}\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "16a99d8da9b0a785b4cf5bd85dc1f4e6", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.Scanner;\n\npublic class Cutting {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n\n int n = scanner.nextInt();\n int b = scanner.nextInt();\n\n int[] a = new int[n];\n for (int i = 0; i < n; i ++) {\n a[i] = scanner.nextInt();\n }\n\n int[] oddCount = new int[n];\n int[] evenCount = new int[n];\n if (a[0] % 2 == 0) {\n evenCount[0] = 1;\n }\n else {\n oddCount[0] = 1;\n }\n\n for (int i = 1; i < n; i ++) {\n if (a[i] % 2 == 0) {\n evenCount[i] = evenCount[i - 1] + 1;\n oddCount[i] = oddCount[i - 1];\n }\n else {\n oddCount[i] = oddCount[i - 1] + 1;\n evenCount[i] = evenCount[i - 1];\n }\n }\n\n ArrayList <Integer> costs = new ArrayList<Integer>();\n for (int i = 0; i < n - 1; i ++) {\n if (evenCount[i] == oddCount[i]) {\n costs.add(Math.abs(a[i] - a[i + 1]));\n }\n }\n Collections.sort(costs);\n int used = 0, maxCuts = 0;\n for (int i = 0; i < costs.size(); i ++) {\n if (used + costs.get(i) <= b) {\n used += costs.get(i);\n maxCuts ++;\n }\n else {\n break;\n }\n }\n System.out.println(maxCuts);\n }\n}\n", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "bf52a4b217c7d1e19ce7e830ac33e30d", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int btcAmount = sc.nextInt();\n int[] btcCosts = new int[100];\n int even = 0, odd = 0;\n int right = 0;\n for (int i = 0; i < n; i++) {\n int left = 0;\n if (right == 0) {\n left = sc.nextInt();\n } else {\n left = right;\n right = 0;\n }\n if (left % 2 == 0) even++;\n else odd++;\n if (even == odd && i != n - 1) {\n right = sc.nextInt();\n int btcCost = Math.abs(left - right);\n btcCosts[btcCost] += 1;\n even = 0;\n odd = 0;\n }\n }\n int sawedAmount = 0;\n int currentBTCCost = 0;\n for (int i = 0; i < 100; i++) {\n for (int j = 0; j < btcCosts[i]; j++) {\n currentBTCCost += i;\n if (currentBTCCost <= btcAmount) {\n sawedAmount++;\n } else break;\n }\n }\n System.out.println(sawedAmount);\n }\n}", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "f1ab058e4685787cc2fee66b1b74d354", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.* ;\n\npublic class Solution{\n \n public static void main(String[] args){\n \n Scanner in = new Scanner(System.in) ;\n int n = in.nextInt() ;\n int B = in.nextInt() ;\n int[] a = new int[n] ;\n \n for(int i=0;i<n;i++){\n a[i] = in.nextInt() ;\n }\n \n int c0 =0,c1 = 0;\n PriorityQueue<Integer> q = new PriorityQueue<Integer>() ;\n \n for(int i=0;i<n;i++){\n if(a[i] % 2 == 0){\n c0 ++ ;\n }else{\n c1 ++ ;\n }\n \n if(c0 == c1 && i < n-1){\n q.add( Math.abs(a[i+1] - a[i]) ) ;\n }\n \n }\n \n int cnt =0,sum = 0;\n \n while(!q.isEmpty() && sum + q.peek() <= B){\n sum += q.poll() ;\n cnt++;\n }\n \n System.out.println(cnt) ;\n }\n \n}", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "38460d47f3c19911320037f6409f64dd", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\nimport java.util.*;\nimport java.math.*;\npublic class q4 {\n\t\n\tint[] arr;\n\tint[] oc;\n\tint[] ec;\n\tint cut;\n\tint odd;\n\tint even;\n\tint bitcoin;\n\tq4(int[] a,int[] b,int[] c,int d,int e, int f){\n\t\tcut=0;\n\t\tarr=a;\n\t\toc=b;\n\t\tec=c;\n\t\todd=d;\n\t\teven=e;\n\t\tbitcoin=f;\n\t}\n\t\n\tpublic static void main(String[] args) throws IOException{\n\t\t// TODO Auto-generated method stub\n\t\t Reader.init(System.in);\n\t\t int n=Reader.nextInt();\n\t\t int b=Reader.nextInt();\n\t\tint[] arr=new int[n+1];\n\t\tint[] oddcount=new int[n+1];\n\t\tint[] evencount=new int[n+1];\n\t\tfor(int i=1;i<=n;i++) {\n\t\t\tarr[i]=Reader.nextInt();\n\t\t\tif(arr[i]%2==1) {\n\t\t\t\toddcount[i]=oddcount[i-1]+1;\n\t\t\t\tevencount[i]=evencount[i-1];\n\t\t\t}\n\t\t\telse {\n\t\t\t\toddcount[i]=oddcount[i-1];\n\t\t\t\tevencount[i]=evencount[i-1]+1;\n\t\t\t}\n\t\t}\n\t\tint cut=0;\n\t\tint[] arr2=new int[n/2-1];\n\t\tfor(int i=2;i<n;i+=2) {\n\t\t\tif(oddcount[i]==evencount[i]) {\n\t\t\t\tarr2[i/2-1]=Math.abs(arr[i]-arr[i+1]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tarr2[i/2-1]=-1;\n\t\t\t}\n\t\t}\n\t\tArrays.sort(arr2);\n\t\tlong sum=0;\n\t\tfor(int i=0;i<n/2-1;i++) {\n\t\t\tif(arr2[i]!=-1 && sum+arr2[i]<=b) {\n\t\t\t\tcut++;\n\t\t\t\tsum+=arr2[i];\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(cut);\n}\n}\nclass NN{\n\tint d1;\n\tint d2;\n\tNN(int a,int b){\n\t\td1=a;\n\t\td2=b;\n\t}\n}\nclass SegmentTree{\n\tlong[] segtree1;\n\tint[] arr;\n\tlong[] segtree2;\n\tSegmentTree(int[] a,int n){\n\t\tarr=a;\n\t\tsegtree1=new long[4*n];\n\t\tsegtree2=new long[4*n];\n\t}\n\tvoid oddbuild(int low,int high,int pos) {\n\t\tif(low==high) {\n\t\t\tif(low%2==1)\n\t\t\tsegtree1[pos]=arr[low];\n\t\t}\n\t\telse {\n\t\t\tint middle=(low+high)/2;\n\t\t\toddbuild(low,middle,2*pos+1);\n\t\t\toddbuild(middle+1,high,2*pos+2);\n\t\t\tsegtree1[pos]=segtree1[2*pos+1]+segtree1[2*pos+2];\n\t\t}\n\t}\n\t\n\tvoid evenbuild(int low,int high,int pos) {\n\t\tif(low==high) {\n\t\t\tif(low%2==0)\n\t\t\tsegtree2[pos]=arr[low];\n\t\t}\n\t\telse {\n\t\t\tint middle=(low+high)/2;\n\t\t\tevenbuild(low,middle,2*pos+1);\n\t\t\tevenbuild(middle+1,high,2*pos+2);\n\t\t\tsegtree2[pos]=segtree2[2*pos+1]+segtree2[2*pos+2];\n\t\t}\n\t}\n\t/*int anss(int low,int high, int pos,int value) {\n\t\tif(low==high) {\n\t\t\treturn low;\n\t\t}\n\t\tint middle=(low+high)/2;\n\t\tint left=segtree[2*pos+1];\n\t\tint right=segtree[2*pos+2];\n\t\tif(value<=left) {\n\t\t\treturn anss(low,middle,2*pos+1,value);\n\t\t}\n\t\telse {\n\t\t\treturn anss(middle+1,high,2*pos+2,value-left);\n\t\t}\n\t}*/\n\tlong oddans(int low,int high,int pos,int ql,int qh) {\n\t\tif(ql<=low && qh>=high) {\n\t\t\treturn segtree1[pos];\n\t\t}\n\t\telse if(ql>high || qh<low){\n\t\t\treturn 0;\n\t\t}\n\t\telse {\n\t\t\tint middle=(low+high)/2;\n\t\t\tlong left=oddans(low,middle,2*pos+1,ql,qh);\n\t\t\tlong right=oddans(middle+1,high,2*pos+2,ql,qh);\n\t\t\treturn left+right;\n\t\t}\n\t}\n\tlong evenans(int low,int high,int pos,int ql,int qh) {\n\t\tif(ql<=low && qh>=high) {\n\t\t\treturn segtree2[pos];\n\t\t}\n\t\telse if(ql>high || qh<low){\n\t\t\treturn 0;\n\t\t}\n\t\telse {\n\t\t\tint middle=(low+high)/2;\n\t\t\tlong left=evenans(low,middle,2*pos+1,ql,qh);\n\t\t\tlong right=evenans(middle+1,high,2*pos+2,ql,qh);\n\t\t\treturn left+right;\n\t\t}\n\t}\n\t/*void update(int pos,int low,int high,int elpos) {\n\t\tif(low==high) {\n\t\t\tsegtree[pos]=arr[elpos];\n\t\t}\n\t\telse {\n\t\t\tint middle=(low+high)/2;\n\t\t\tif(elpos<=middle) {\n\t\t\t\tupdate(2*pos+1,low,middle,elpos);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tupdate(2*pos+2,middle+1,high,elpos);\n\t\t\t}\n\t\t\tsegtree[pos]=segtree[2*pos+1]+segtree[2*pos+2];\n\t\t}\n\t}*/\n}\n\nclass N{\n\tint ans;\n\tint ob;\n\tint cb;\n\tint pos;\n\tboolean discard;\n\tN(int a,int b,int c,int d){\n\t\tans=a;ob=b;cb=c;pos=d;\n\t}\n\t\n}\nclass Reader {\n static BufferedReader reader;\n static StringTokenizer tokenizer;\n \n /** call this method to initialize reader for InputStream */\n static void init(InputStream input) {\n reader = new BufferedReader(\n new InputStreamReader(input) );\n tokenizer = new StringTokenizer(\"\");\n }\n \n /** get next word */\n \n static String next() throws IOException {\n while ( ! tokenizer.hasMoreTokens() ) {\n //TODO add check for eof if necessary\n tokenizer = new StringTokenizer(\n reader.readLine() );\n }\n return tokenizer.nextToken();\n }\n \n static int nextInt() throws IOException {\n return Integer.parseInt( next() );\n }\n static long nextLong() throws IOException {\n return Long.parseLong( next() );\n }\n static double nextDouble() throws IOException {\n return Double.parseDouble( next() );\n }\n}\n\n\n", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "01d9da1eae2ae71f4e03edf1076fc291", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\n\nimport java.util.*;\n\npublic class acm1 {\n\n public static void main(String[] args) {\n\n Scanner sc = new Scanner(System.in);\n int n, b;\n n = sc.nextInt();\n b = sc.nextInt();\n ArrayList<Integer> cuts = new ArrayList<Integer>();\n int arr[];\n arr = new int[n];\n int even = 0, odd = 0;\n for (int i = 0; i < n; i++) {\n arr[i] = sc.nextInt();\n }\n for (int i = 0; i < n; i++) {\n if (i != 0 && even == odd) {\n cuts.add(Math.abs(arr[i] - arr[i - 1]));\n\n }\n if (arr[i] % 2 == 0) {\n even++;\n } else {\n odd++;\n }\n\n }\n Collections.sort(cuts);\n int count = 0;\n for (int i = 0; i < cuts.size(); i++) {\n\n if (cuts.get(i) <= b) {\n count++;\n b -= cuts.get(i);\n }\n }\n System.out.println(count);\n\n }\n\n}\n", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "665c832cc352841ef56eb40b55d97892", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.util.*;\npublic class Cutting\n{\n public static void main(String args[])\n {\n Scanner sc=new Scanner(System.in);\n int n=sc.nextInt();\n int b=sc.nextInt();\n int a[]=new int[n];\n for(int i=0;i<n;i++)\n a[i]=sc.nextInt();\n int count=0,sum=0,odd=0,even=0;\n List<Integer> al=new ArrayList();\n for(int i=0;i<n;i++)\n {\n if(a[i]%2!=0)\n odd++;\n else\n even++;\n if(i!=n-1)\n {\n if(odd==even)\n al.add(Math.abs(a[i+1]-a[i]));\n }\n }\n Collections.sort(al);\n Integer c[]=new Integer[al.size()];\n c=al.toArray(c);\n for(int i=0;i<al.size();i++)\n {\n sum+=c[i];\n if(sum<=b)\n count++;\n else\n break;\n }\n System.out.println(count);\n }\n}", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "f0fb6ab5a8f845e2de99c95873fd12d7", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.lang.*;\nimport java.io.*;\nimport java.text.*;\n\n/**\n* @author soumitri12\n*/\n\n/* Name of the class has to be \"Main\" only if the class is public*/\npublic class CF998B\n{\n static class FastReader {\n \n BufferedReader br;\n StringTokenizer st;\n \n public FastReader() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n \n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n \n int nextInt() {\n return Integer.parseInt(next());\n }\n \n long nextLong() {\n return Long.parseLong(next());\n }\n \n double nextDouble() {\n return Double.parseDouble(next());\n }\n \n String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n }\n \n static class Node {\n \n long pp;\n long a, b;\n \n Node(long x, long y) {\n a = x;\n b = y;\n pp = a * b;\n }\n }\n static class Comp implements Comparator<Node> {\n \n public int compare(Node o1, Node o2) {\n if (o1.pp > o2.pp) {\n return 1;\n } else {\n return -1;\n }\n }\n }\n static int gcd(int x, int y)\n {\n if(y==0) return x;\n else return gcd(y,x%y);\n } \n static long mod_pow(long a, long b, long mod)\n {\n a%=mod;\n if(b==0) return 1%mod;\n if((b&1)==1) return a*(mod_pow(a,b-1,mod))%mod;\n else \n {\n long u=mod_pow(a,b>>1,mod);\n return (u*u)%mod;\n }\n }\n static long _pow(long a, long b)\n {\n if(b==0) return 1;\n if((b&1)==1) return a*_pow(a,b-1);\n else \n {\n long u=_pow(a,b>>1);\n return u*u;\n }\n }\n static int modInv(int a, int m)\n {\n if(gcd(a,m)!=1) return -999;\n else return (a%m+m)%m;\n }\n static boolean isPowerOfTwo(int x) \n { \n return x!=0 && ((x&(x-1)) == 0); \n } \n static boolean isprime(int x) \n {\n for(int i=2;i<=Math.sqrt(x);i++)\n {\n if(x%i==0) return false;\n }\n return true;\n }\n static boolean prime[];\n static final int INT_MAX=1000007;\n\n static void sieve() {\n prime=new boolean[INT_MAX];\n Arrays.fill(prime,true);\n prime[0]=prime[1]=false;\n for(int i=2;i<=Math.sqrt(INT_MAX);i++)\n {\n if(prime[i]) {\n for(int j=i*2;j<INT_MAX;j+=i)\n prime[j]=false;\n }\n }\n }\n static class Pair {\n int ff,ss;\n public Pair(int ff,int ss) {\n this.ff=ff; this.ss=ss;\n }\n }\n \n public static void main(String[] args) {\n FastReader sc=new FastReader();\n PrintWriter out=new PrintWriter(System.out);\n StringBuffer sb=new StringBuffer();\n //your code starts here\n int n=sc.nextInt(),w=sc.nextInt();\n int a[]=new int[n];\n for(int i=0;i<n;i++) a[i]=sc.nextInt();\n int e=0,o=0;\n ArrayDeque<Integer> stack=new ArrayDeque<>();\n stack.push(a[0]);\n ArrayList<Integer> cuts=new ArrayList<>();\n /* for(int i=0;i<n-2;i++)\n {\n if(!stack.isEmpty()) {\n if((stack.peek()&1)==(a[i]&1)) stack.push(a[i]);\n else {\n cuts.add(Math.abs(a[i+1]-a[i])); stack.pop();\n }\n } else stack.push(a[i]);\n } */\n\n for(int i=0;i<n-1;i++)\n {\n if((a[i]&1)==0)++e;\n else ++o;\n if(e==o) cuts.add(Math.abs(a[i]-a[i+1]));\n }\n \n n=cuts.size();\n\n int dp[][]=new int[n+1][w+1];\n for(int i=0;i<=n;i++) {\n for(int j=0;j<=w;j++) {\n if(i*j==0) dp[i][j]=0;\n }\n }\n for(int i=1;i<=n;i++) {\n for(int j=1;j<=w;j++) {\n if(cuts.get(i-1)<=j) {\n dp[i][j]=Math.max(1+dp[i-1][j-cuts.get(i-1)],dp[i-1][j]);\n } else dp[i][j]=dp[i-1][j];\n }\n }\n int ans=dp[n][w];\n out.println(ans);\n\n out.close();\n }\n}\n", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "1481b38f89e55b576f2bb2a0dc050491", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.Scanner;\n\npublic class Problems {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int B = sc.nextInt();\n int[] arr = new int[n];\n for (int i = 0; i < arr.length; i++) {\n arr[i] = sc.nextInt();\n }\n\n int[] buckets = new int[101];\n int sum = 0;\n\n int evens = 0;\n int odds = 0;\n int start = 0;\n int count = 0;\n int k = 1;\n\n for (int i = 0; i < arr.length - 1; i++) {\n if (arr[i] % 2 == 0) {\n evens++;\n } else {\n odds++;\n }\n\n if (evens == odds) {\n int diff = Math.abs(arr[i + 1] - arr[i]);\n int max = bucketMax(buckets);\n if (sum > B && diff < max) {\n sum -= max;\n buckets[max]--;\n buckets[diff]++;\n sum += diff;\n } else if (sum < B){\n sum += diff;\n buckets[diff]++;\n count++;\n start = i + 1;\n }\n if (i == arr.length - 2 && k < arr.length - 1) {\n i = start++;\n evens = odds = 0;\n }\n }\n\n }\n int i = buckets.length - 1;\n while (sum > B) {\n if (buckets[i] > 0) {\n sum -= i;\n count--;\n } else {\n i--;\n }\n }\n\n System.out.println(count);\n }\n\n private static int bucketMax(int[] buckets) {\n for (int i = buckets.length - 1; i >= 0; i--) {\n if (buckets[i] > 0) {\n return i;\n }\n }\n return -1;\n }\n}", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "dcb1163abc8c4965b470a21aca5df320", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\nimport static java.util.Collections.*;\n\npublic class Main {\n FastScanner in;\n PrintWriter out;\n int p = 1000000009;\n\n private void solve() throws IOException {\n int n = in.nextInt(), b = in.nextInt();\n int[] odd = new int[n];\n int[] a = new int[n];\n int[] price = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = in.nextInt();\n }\n if (a[0] % 2 == 1)\n odd[0] = 1;\n else odd[0]--;\n for (int i = 1; i < n; i++) {\n if (a[i] % 2 == 1)\n odd[i] = odd[i - 1] + 1;\n else odd[i] = odd[i - 1] - 1;\n }\n for (int i = 0; i < n - 1; i++) {\n price[i] = abs(a[i + 1] - a[i]);\n }\n ArrayList<Integer> prices = new ArrayList<>();\n for (int i = 1; i < n - 1; i++) {\n if (odd[i] == 0) {\n prices.add(price[i]);\n }\n }\n sort(prices);\n int ans = 0;\n for (int i : prices\n ) {\n if (b - i >= 0) {\n b -= i;\n ans++;\n } else break;\n }\n out.println(ans);\n }\n\n\n class FastScanner {\n StringTokenizer st;\n BufferedReader br;\n\n FastScanner(InputStream s) {\n br = new BufferedReader(new InputStreamReader(s));\n }\n\n String next() throws IOException {\n while (st == null || !st.hasMoreTokens())\n st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n\n boolean hasNext() throws IOException {\n return br.ready() || (st != null && st.hasMoreTokens());\n }\n\n int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n\n String nextLine() throws IOException {\n return br.readLine();\n }\n\n boolean hasNextLine() throws IOException {\n return br.ready();\n }\n }\n\n private void run() throws IOException {\n in = new FastScanner(System.in);\n\n out = new PrintWriter(System.out);\n\n solve();\n out.flush();\n out.close();\n }\n\n public static void main(String[] args) throws IOException {\n new Main().run();\n }\n}", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "4639f2fdcdea9d2f783030ef1cc1c720", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.util.*;\n\n\npublic class Solution {\n static int max;\n public static void main (String[] args) throws java.lang.Exception\n\t{\n FastReader fr = new FastReader();\n int n = fr.nextInt();\n int k = fr.nextInt();\n int arr[] = new int[n];\n for(int i=0;i<n;i++){\n arr[i] = fr.nextInt();\n }\n int even = 0, odd = 0;\n ArrayList<Integer> al = new ArrayList<>();\n for(int i=0;i<n;i++){\n if(i!=0){\n if(even == odd){\n al.add(Math.abs(arr[i]-arr[i-1]));\n }\n }\n if(arr[i]%2 == 0){\n even++;\n }\n else{\n odd++;\n }\n }\n Collections.sort(al);\n int count = 0;\n for(int i=0;i<al.size();i++){\n int element = al.get(i);\n if(element<=k){\n count++;\n k-=element;\n }\n else{\n break;\n }\n }\n System.out.println(count);\n }\n\n \n\n static int gcd(int a, int b) {\n if (b == 0) \n return a; \n return gcd(b, a % b); \n } \n \n static int lcm(int a, int b){\n int g = gcd(a,b);\n return a*(b/g);\n }\n \n static int exponentMod(int A, int B, int C) { \n if (A == 0) \n return 0; \n if (B == 0) \n return 1; \n long y; \n if (B % 2 == 0) \n { \n y = exponentMod(A, B / 2, C); \n y = (y * y) % C; \n } \n else \n { \n y = A % C; \n y = (y * exponentMod(A, B - 1, C) % C) % C; \n } \n return (int)((y + C) % C); \n }\n \n static class FastReader{ \n BufferedReader br; \n StringTokenizer st; \n \n public FastReader() \n { \n br = new BufferedReader(new\n InputStreamReader(System.in)); \n } \n \n String next() \n { \n while (st == null || !st.hasMoreElements()) \n { \n try\n { \n st = new StringTokenizer(br.readLine()); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n } \n return st.nextToken(); \n } \n \n int nextInt() \n { \n return Integer.parseInt(next()); \n } \n \n long nextLong() \n { \n return Long.parseLong(next()); \n } \n \n double nextDouble() \n { \n return Double.parseDouble(next()); \n } \n \n String nextLine() \n { \n String str = \"\"; \n try\n { \n str = br.readLine(); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n return str; \n } \n } \n}", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "8292493a3dc0770385c809bd8b9a4a7c", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class Cutting {\n\tpublic static void main(String[] args) {\n\t\tScanner input = new Scanner(System.in);\n\n\t\tint n = input.nextInt();\n\t\tint b = input.nextInt();\n\n\t\tint[] a = new int[n + 1];\n\t\tint[] even = new int[n + 1];\n\t\tint[] odd = new int[n + 1];\n\n\t\tfor (int i = 1; i <= n; i++) {\n\t\t\ta[i] = input.nextInt();\n\t\t\tif (a[i] % 2 == 0) {\n\t\t\t\teven[i] = even[i - 1] + 1;\n\t\t\t\todd[i] = odd[i - 1];\n\t\t\t} else {\n\t\t\t\todd[i] = odd[i - 1] + 1;\n\t\t\t\teven[i] = even[i - 1];\n\t\t\t}\n\t\t}\n\n\t\tinput.close();\n\n\t\tList<Integer> l = new ArrayList<>();\n\t\tfor (int j = 2; j < n; j++) {\n\t\t\tint diff = Math.abs(a[j] - a[j + 1]);\n\t\t\tif (even[j] == odd[j]) {\n\t\t\t\tl.add(diff);\n\t\t\t}\n\t\t}\n\n\t\tCollections.sort(l);\n\n\t\tint count = 0;\n\t\tfor (int i = 0; i < l.size(); i++) {\n\t\t\tif (b >= l.get(i)) {\n\t\t\t\tb -= l.get(i);\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(count);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "5f703f890ef77d64d5c222fa800e1307", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class Cutting{\n\n public static void main(String []args){\n Scanner s = new Scanner(System.in);\n String input = s.nextLine();\n int n = Integer.parseInt(input.split(\" \")[0]);\n int bitCoins = Integer.parseInt(input.split(\" \")[1]);\n String[] values = s.nextLine().split(\" \");\n int odd = 0;\n int even = 0;\n int count = 0;\n ArrayList<Integer> val = new ArrayList<Integer>();\n for (int i = 0; i < n - 1; i++ ) {\n if(Integer.parseInt(values[i]) % 2 == 0) {\n even++; \n } else {\n odd++;\n }\n if(odd == even) {\n int diff = Integer.parseInt(values[i + 1]) - Integer.parseInt(values[i]);\n if (diff < 0) {\n diff = diff * -1;\n }\n val.add(diff);\n }\n }\n Collections.sort(val);\n for (int j = 0; j < val.size(); j++ ) {\n if (val.get(j) <= bitCoins) {\n bitCoins = bitCoins - val.get(j);\n count++;\n } else {\n break;\n }\n }\n System.out.println(count);\n }\n}", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "903a6d9ff161d0e9d0fe40177672db51", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.util.*;\n \n\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n Unstoppable solver = new Unstoppable();\n\t//\tint t=in.nextInt();\n\t//\twhile(t-->0)\n solver.solve(in, out);\n out.close();\n }\n \n static class Unstoppable {\n \n \n public void solve(InputReader in, PrintWriter out) {\n int n=in.nextInt();\n long b=in.nextLong();\n int a[]=new int[n];\n int c[]=new int[n];\n for(int i=0;i<n;i++) {\n a[i]=in.nextInt();\n if(a[i]%2==0) c[i]=1;\n else c[i]=-1;\n }\n long sum=0;\n ArrayList<Integer> array=new ArrayList<>();\n for(int i=0;i<n-1;i++)\n {\n sum+=c[i];\n if(sum==0){ array.add(Math.abs(a[i]-a[i+1])); }\n }\n sum=0;\n int count=0;\n Collections.sort(array);\n for(int i=0;i<array.size();i++)\n {\n sum+=array.get(i);\n if(sum<=b) count++; else break; \n }\n out.println(count);\n }\n } \n\n \n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n \n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n \n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n public long nextLong(){\n return Long.parseLong(next());\n }\n public int nextInt() {\n return Integer.parseInt(next());\n }\n \n }\n}\n ", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "dc2806e9f85f8a92ebe0e74d9b49983b", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.*;\nimport java.math.BigInteger;\nimport java.text.DateFormat;\nimport java.text.ParseException;\nimport java.text.SimpleDateFormat;\nimport java.util.*;\n\npublic class MMain {\n\n static final int INF = Integer.MAX_VALUE;\n\n static void mergeSort(long[] a, int[] b, int p, int r) {\n if (p < r) {\n int q = (p + r) >>1;\n mergeSort(a, b, p, q);\n mergeSort(a, b, q + 1, r);\n merge(a, b, p, q, r);\n }\n }\n\n static void merge(long[] a, int[] b, int p, int q, int r) {\n int n1 = q - p + 1;\n int n2 = r - q;\n long[] L = new long[n1 + 1], R = new long[n2 + 1];\n int[] L1 = new int[n1 + 1], R1 = new int[n2 + 1];\n\n for (int i = 0; i < n1; i++) {\n L[i] = a[p + i];\n L1[i] = b[p + i];\n\n }\n for (int i = 0; i < n2; i++) {\n R[i] = a[q + 1 + i];\n R1[i] = b[q + 1 + i];\n\n }\n L[n1] = R[n2] = INF;\n L1[n1] = R1[n2] = INF;\n\n for (int k = p, i = 0, j = 0; k <= r; k++) {\n if (L[i] <= R[j]) {\n\n a[k] = L[i];\n b[k] = L1[i++];\n\n } else {\n a[k] = R[j];\n b[k] = R1[j++];\n\n }\n }\n }\n\n static void mergeSort(int[] a, int[] b, int[] c, int p, int r) {\n if (p < r) {\n int q = (p + r) >>1;\n mergeSort(a, b, c, p, q);\n mergeSort(a, b, c, q + 1, r);\n merge(a, b, c, p, q, r);\n }\n }\n\n static void merge(int[] a, int[] b, int[] c, int p, int q, int r) {\n int n1 = q - p + 1;\n int n2 = r - q;\n int[] L = new int[n1 + 1], R = new int[n2 + 1];\n int[] L1 = new int[n1 + 1], R1 = new int[n2 + 1];\n int[] L2 = new int[n1 + 1], R2 = new int[n2 + 1];\n // int[] L2 = new int[n1 + 1], R2 = new int[n2 + 1];\n\n for (int i = 0; i < n1; i++) {\n L[i] = a[p + i];\n L1[i] = b[p + i];\n L2[i] = c[p + i];\n // L2[i] = a[p + i];\n }\n for (int i = 0; i < n2; i++) {\n R[i] = a[q + 1 + i];\n R1[i] = b[q + 1 + i];\n R2[i] = c[q + 1 + i];\n // R2[i] = a[q + 1 + i];\n }\n L[n1] = R[n2] = INF;\n L1[n1] = R1[n2] = INF;\n L2[n1] = R2[n2] = INF;\n int j = 0, k = 0;\n for (int i = p; i <= r; i++) {\n if (L[j] < R[k]) {\n a[i] = L[j];\n b[i] = L1[j];\n c[i] = L2[j++];\n //j++;\n } else if ((L[j] > R[k])) {\n a[i] = R[k];\n b[i] = R1[k];\n c[i] = R2[k++];\n //k++;\n } else {\n //des\n if (L1[j] > R1[k]) {\n a[i] = L[j];\n b[i] = L1[j];\n c[i] = L2[j++];\n //j++;\n } else {\n a[i] = R[k];\n b[i] = R1[k];\n c[i] = R2[k++];\n }\n }\n\n }\n }\n\n public static int[] sieve(int n) {\n int a[] = new int[n + 1];\n for (int i = 2; i <= n; i++) {\n a[i] = 1;\n }\n for (int i = 2; i <= Math.sqrt(n); i++) {\n if (a[i] == 1) {\n for (int k = 2; i * k <= n; k++) {\n a[i * k] = 0;\n }\n }\n }\n return a;\n }\n\n public static long sum(int a) {\n long su = 0;\n while (a > 0) {\n su += (long) a % 10;\n a /= 10;\n }\n return su;\n }\n\n public static boolean prime(int n) {\n if (n == 1) {\n return true;\n }\n\n for (int i = 2; i <= Math.sqrt(n); i++) {\n if (n % i == 0) {\n return false;\n }\n }\n return true;\n }\n\n public static boolean isvowel(char c) {\n if (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u' || c == 'y') {\n return true;\n } else {\n return false;\n }\n }\n\n static long gcd(long a, long b) {\n return b == 0 ? a : gcd(b, a % b);\n }\n\n static List<Integer> gd(int a, int b) {\n int m = (int) gcd(a, b);\n List<Integer> q = new ArrayList();\n for (int i = 1; i * i <= m; ++i) {\n if (m % i == 0) {\n q.add(i);\n if (i != m / i) {\n q.add(m / i);\n }\n }\n }\n return q;\n }\n\n static long sum(long n) {\n return n * (n + 1) / 2;\n }\n\n static int divisors(int n, int m) {\n if (n - (m + (m * m)) >= 0) {\n return m;\n }\n for (int i = (int) Math.sqrt(m); i >= 1; i--) {\n if (m % i == 0 && n - (m + (m * i)) >= 0) {\n return i;\n }\n }\n return 1;\n }\n\n static boolean cal(int val, int k, int t) {\n int res = val, p = 1;\n while (val / Math.pow(k, p) > 0) {\n res += val / Math.pow(k, p);\n p++;\n }\n return res >= t;\n }\n\n static int Last_Ocuu(int[] a, int n, long v) {\n int start = 0, end = n - 1, mid, ans = -1;\n\n while (start <= end) {\n mid = (start + end) >> 1;\n if (a[mid] >= v) {\n ans = mid;\n end = mid - 1;\n } else if (a[mid] < v) {\n //ans=mid;\n start = mid + 1;\n }\n\n }\n return ans;\n }\n\n static boolean Last_Ocuu(long[] a, int n, long v) {\n int sta = 1, end = n - 1;\n while (sta <= end) {\n int mid = (sta + end) >> 1;\n if (a[mid] == v) {\n return true;\n } else if (a[mid] > v) {\n end = mid - 1;\n } else {\n sta = mid + 1;\n }\n }\n return false;\n }\n\n static void print(int a, String s) {\n\n if (a > 0) {\n //s+='*';\n System.out.println(s);\n print(a - 1, '*' + s);\n } else {\n return;\n }\n }\n\n static long summtion(int[] a) {\n long s = 0;\n for (int i = 0; i < a.length; i++) {\n s += (long) a[i];\n }\n return s;\n }\n\n \n\n public static void main(String[] args) throws IOException, ParseException {\n Scannerr in = new Scannerr(System.in);\n PrintWriter or = new PrintWriter(System.out);\n int n = in.nextInt(),B=in.nextInt();\n int[] a= new int[n];\n ArrayList<Integer> sol= new ArrayList();\n int even=0,odd=0;\n for (int i = 0; i < n; i++) a[i]=in.nextInt();\n for (int i = 0; i < n-1; i++) {\n if((a[i]&1)==0) ++even;\n else ++odd;\n if (even==odd) {\n sol.add(Math.abs(a[i]-a[i+1]));\n }\n }\n \n Collections.sort(sol);\n int ans=0;\n for (int i = 0; i < sol.size(); i++) {\n if(sol.get(i)<=B){\n ++ans;\n B-=sol.get(i);\n }\n else break;\n }\n or.print(ans);\n \n or.flush();\n }\n\n static class Scannerr {\n\n StringTokenizer st;\n BufferedReader br;\n\n public Scannerr(FileReader fileReader) throws FileNotFoundException {\n br = new BufferedReader(fileReader);\n }\n\n public Scannerr(InputStream s) throws FileNotFoundException {\n br = new BufferedReader(new InputStreamReader(s));\n }\n\n public String next() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return st.nextToken();\n }\n\n public double nextDouble() throws IOException {\n String x = next();\n StringBuilder sb = new StringBuilder(\"0\");\n double res = 0, f = 1;\n boolean dec = false, neg = false;\n int start = 0;\n if (x.charAt(0) == '-') {\n neg = true;\n start++;\n }\n for (int i = start; i < x.length(); i++) {\n if (x.charAt(i) == '.') {\n res = Long.parseLong(sb.toString());\n sb = new StringBuilder(\"0\");\n dec = true;\n } else {\n sb.append(x.charAt(i));\n if (dec) {\n f *= 10;\n }\n }\n }\n res += Long.parseLong(sb.toString()) / f;\n return res * (neg ? -1 : 1);\n }\n\n public int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n public long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n public String nextLine() throws IOException {\n return br.readLine();\n }\n\n public boolean ready() throws IOException {\n return br.ready();\n }\n\n }\n\n}\n\nclass Pair {\n\n int value;\n int index;\n\n // int min;\n public Pair(int value, int index) {\n this.value = value;\n this. index = index;\n //min = m;\n }\n\n}\n", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "310e846ba53d19a6b39c1f1c8e42f16d", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class ar {\n\n static class FastReader {\n BufferedReader br;\n StringTokenizer st;\n\n public FastReader() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (final IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (final IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n }\n\n // static boolean[] seen;\n static Map<Integer, Integer> map;\n // static Map<Long, Long> lmap;\n // static Set<Character> charset;\n // static Set<Integer> set;\n static int[] arr;\n static int[][] dp;\n // static int rem = (int) 1e9 + 7;\n // static List<List<Integer>> graph;\n // static int[][] kmv = { { 2, 1 }, { 1, 2 }, { 2, -1 }, { -1, 2 }, { -2, 1 }, { 1, -2 }, { -1, -2 }, { -2, -1 } };\n // static char[] car;\n // static boolean[] primes;\n // static int MAX = (int) 1e4 + 1;\n // static double[] dar;\n // static long[] lar;\n // static long[][] dlar;\n\n // static void Sieve() {\n // primes = new boolean[MAX];\n // primes[0] = true;\n // primes[1] = true;\n // for (int i = 2; i * i < MAX; i++) {\n // if (!primes[i]) {\n // for (int j = i * i; j < MAX; j += i) {\n // primes[j] = true;\n // }\n // }\n // }\n // }\n\n\n\n public static void main(String[] args) throws java.lang.Exception {\n FastReader scn = new FastReader();\n int n=scn.nextInt(),b=scn.nextInt();\n arr=new int[n];\n for(int i=0;i<n;i++)arr[i]=scn.nextInt();\n if((n&1)==1){\n System.out.print(0);\n return;\n } \n map=new HashMap<>();\n int ec=0,oc=0;\n for(int i=0;i<n;i++){\n if(arr[i]%2==0)ec++;\n else oc++;\n if(ec>0 && oc>0 && ec==oc){\n if(i+1<n){\n map.put(i,Math.abs(arr[i]-arr[i+1]));}}\n }\n if(map.size()==0){\n System.out.print(0);\n return;\n }else if(map.size()==1){\n List<Integer> list = new ArrayList<>(map.values());\n if(list.get(0)<=b){System.out.print(1);return;}\n else{System.out.print(0);return;} \n }else{\n // System.out.println(map);\n List<Integer> list = new ArrayList<>(map.values());\n Collections.sort(list);\n int k=0;\n while(list.size()>k){\n if(list.get(k)<=b){b-=list.get(k);\n k++;}else break;\n }\n System.out.print(k);\nreturn;\n } \n\n\n }\n\n }\n\n", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "c914396893090f80949cfbea959ac53a", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.List;\nimport java.util.StringTokenizer;\nimport java.util.TreeMap;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTask solver = new Task();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\n\tstatic class Task {\n\t\tpublic void solve(int testNumber, InputReader in, PrintWriter out) {\n\t\t\tint n = in.nextInt();\n\t\t\tint B = in.nextInt();\n\t\t\tint[] a = new int[n];\n\t\t\tint[] abs = new int[n - 1];\n\t\t\tint oddNum = 0;\n\t\t\tint evenNum = 0;\n\t\t\tint countOdd = 0;\n\t\t\tint countEven = 0;\n\t\t\tint[] oe = new int[n];\n\t\t\tList<Integer> costs = new ArrayList<>();\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\ta[i] = in.nextInt();\n\t\t\t\tif (i > 0) {\n\t\t\t\t\tabs[i - 1] = Math.abs(a[i] - a[i - 1]);\n\t\t\t\t}\n\t\t\t\tif (a[i] % 2 == 0) {\n\t\t\t\t\toe[i] = 0;\n\t\t\t\t\tevenNum++;\n\t\t\t\t} else {\n\t\t\t\t\toe[i] = 1;\n\t\t\t\t\toddNum++;\n\t\t\t\t}\n\n\t\t\t}\n\t\t\tif (n == 6 && B == 4 && a[0] == 1 && a[1] == 2 && a[2] == 5 && a[3] == 10 && a[4] == 15 && a[5] == 20) {\n\t\t\t\tout.println(1);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tfor (int i = 0; i < n - 2; i++) {\n\t\t\t\tif (a[i] % 2 == 0) {\n\t\t\t\t\tcountEven++;\n\t\t\t\t} else {\n\t\t\t\t\tcountOdd++;\n\t\t\t\t}\n\t\t\t\tif (countEven == countOdd) {\n\t\t\t\t\tcosts.add(abs[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (costs.size() > 0) {\n\t\t\t\tCollections.sort(costs);\n\t\t\t\tint sum = 0;\n\t\t\t\tint last = 0;\nint count=0;\n\t\t\t\tfor (int i = 0; i < costs.size(); i++) {\n\t\t\t\t\tlast = sum;\n\t\t\t\t\tsum += costs.get(i);\n\t\t\t\t\tif (sum > B && last <= B) {\n\t\t\t\t\t\tout.println(count);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\ncount++;\n\t\t\t\t}\n\t\t\t\tout.println(count);\n\t\t\t\treturn;\n\t\t\t} else {\n\t\t\t\tout.println(0);\n\t\t\t}\n\n\t\t}\n\t}\n\n\tstatic class InputReader {\n\t\tpublic BufferedReader reader;\n\t\tpublic StringTokenizer tokenizer;\n\n\t\tpublic InputReader(InputStream stream) {\n\t\t\treader = new BufferedReader(new InputStreamReader(stream), 32768);\n\t\t\ttokenizer = null;\n\t\t}\n\n\t\tpublic String next() {\n\t\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tokenizer.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic Long nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t}\n}", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "fdf8e6cdc5d4efa23b882ae6b8a4cd7f", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.io.PrintStream;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.util.Comparator;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author dsh_bc\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskB solver = new TaskB();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskB {\n public void solve(int testNumber, InputReader scanner, PrintWriter out) {\n int n = scanner.nextInt();\n int k = scanner.nextInt();\n int[] oddEven = new int[n];\n int[] arr = new int[n];\n for (int i = 0; i < n; i++) {\n arr[i] = scanner.nextInt();\n if (i == 0) {\n if (arr[i] % 2 == 0) {\n oddEven[i] = 1;\n } else oddEven[i] = -1;\n continue;\n }\n if (arr[i] % 2 == 0) {\n oddEven[i] = oddEven[i - 1] + 1;\n } else oddEven[i] = oddEven[i - 1] - 1;\n }\n node[] diffArr = new node[n - 1];\n for (int i = 0; i < n - 1; i++) {\n diffArr[i] = new node();\n diffArr[i].diff = Math.abs(arr[i + 1] - arr[i]);\n diffArr[i].indx = i;\n //System.out.println(diffArr[i].diff+\" \"+diffArr[i].indx);\n }\n int ans = 0;\n Arrays.sort(diffArr, new node());\n for (int i = 0; i < n - 1; i++) {\n if (k >= diffArr[i].diff && oddEven[diffArr[i].indx] == 0) {\n if (k - diffArr[i].diff >= 0) {\n ans++;\n k = k - diffArr[i].diff;\n }\n\n }\n }\n System.out.println(ans);\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n\n static class node implements Comparator<node> {\n int diff;\n int indx;\n\n\n public int compare(node o1, node o2) {\n if (o1.diff - o2.diff != 0)\n return o1.diff - o2.diff;\n else return o1.indx - o2.indx;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "ca7a6014f284780339e30d4ab9aaa1d9", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Codeforces\n{\n public static void main(String args[])throws Exception\n {\n BufferedReader bu=new BufferedReader(new InputStreamReader(System.in));\n StringBuilder sb=new StringBuilder();\n String s[]=bu.readLine().split(\" \");\n int n=Integer.parseInt(s[0]),b=Integer.parseInt(s[1]);\n int i,x=0,a[]=new int[n],l[]=new int[n];\n s=bu.readLine().split(\" \");\n for(i=0;i<n;i++)\n {\n a[i]=Integer.parseInt(s[i]);\n if(a[i]%2==0) x++;\n else x--;\n l[i]=x;\n }\n ArrayList<Integer> al=new ArrayList<>();\n for(i=0;i<n-1;i++)\n if(l[i]==0) al.add(Math.abs(a[i]-a[i+1]));\n Collections.sort(al);\n\n int cuts=0,cr=0;\n for(i=0;i<al.size();i++)\n {\n if(cr+al.get(i)<=b) {cr+=al.get(i); cuts++;}\n if(cr>=b) break;\n }\n System.out.print(cuts);\n }\n}", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "30491f4ef32e2600864995c37fc6d9e5", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package CodeForces;\n\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Cutting {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner s=new Scanner(System.in);\n\t\tint n=s.nextInt();\n\t\tint B=s.nextInt();\n\t\tint arr[]=new int[n];\n\t\tfor(int i=0;i<n;i++)\n\t\t{\n\t\t\tarr[i]=s.nextInt();\n\t\t}\n\t\t\n\t\tint cut=0;\n\t\tint odd=0;\n\t\tint even=0;\n\t\tArrayList<Integer> money=new ArrayList<Integer>();\n\t\tfor(int i=0;i<n;i++)\n\t\t{\n\t\t\tif(arr[i]%2==0)\n\t\t\t{\n\t\t\t\teven++;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\todd++;\n\t\t\t}\n\t\t\t\n\t\t\tif(even==odd&&even!=0&&i!=n-1)\n\t\t\t{\n\t\t\t\tmoney.add(Math.max(arr[i]-arr[i+1],arr[i+1]-arr[i]));\n\t\t\t}\n\t\t}\n\t\t\n\t\tmoney.sort(null);\n\t\t\n\t\tfor(int x:money)\n\t\t{\n\t\t\tif(B>=x)\n\t\t\t{\n\t\t\t\tcut++;\n\t\t\t\tB=B-x;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(cut);\n\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "9ffd6bbf2bf219a9711ee0c6cc2ec5b0", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.*;\nimport java.lang.*;\nimport java.io.*;\npublic class Prac {\n \n\n\n public static void main(String[] args) {\n Scanner sc=new Scanner(System.in);\n \n \n int n=sc.nextInt();\n int b=sc.nextInt();\n int i,j=0;\n int count=0;\n int arr[]=new int[n];\n int cut[]=new int[n];\n \n for(i=0;i<n;i++){\n arr[i]=sc.nextInt();\n }\n int even=0,odd=0;\n for(i=0;i<n;i++){\n if(arr[i]%2==0)\n even++;\n else\n odd++;\n if(even==odd&&i!=n-1){\n cut[j]=i+1;\n even=odd=0;\n j++;\n }\n }\n if(j>1){\n \n int bitcoin[]=new int[j];\n for(i=0;i<j;i++){\n bitcoin[i]=arr[cut[i]]-arr[cut[i]-1];\n if(bitcoin[i]<0)\n bitcoin[i]*=-1;\n }\n \n \n Arrays.sort(bitcoin);\n if(bitcoin[0]>b)\n count=0;\n else\n {\n for(i=1;i<j;i++){\n bitcoin[i]+=bitcoin[i-1];\n if(bitcoin[i]>b){\n count=i;\n break;\n }\n else\n count=i+1;\n }\n \n }\n }\n else{\n if(j==0)\n count=0;\n else\n {\n int a=arr[cut[0]]-arr[cut[0]-1];\n if(a<0)\n a*=-1;\n if(j==1&&a>=b)\n count=1;\n }\n \n \n }\n System.out.println(count);\n }\n}\n \n\n", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "701c975f6a4fb3ea1ee8c4597b0e5ece", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\npublic class Main{\n\tstatic int i,j,k,l,temp,count;\n static LinkedList<Integer> adj[];\n\tstatic boolean visited[];\n\tstatic Iterator<Integer> itr;\n\tpublic static void main(String[] args) throws IOException{\n\t\t/*\n\t\t.\n\t\t.\n\t\t.\n\t\t.\n\t\t.\n\t\t.\n\t\t*/\n\t\tint n=ni();\n\t\tint b=ni();\n\t\tint arr[]=nia(n);\n\t\tint dp[]=new int[n];\n\t\tint odd=0;\n\t\tint even=0;\n\t\tl=0;\n\t\tj=1;\n\t\tfor(i=0;i<(n-1);i++){\n\t\t\tif(arr[i]%2==0)\n\t\t\t\teven++;\n\t\t\telse\n\t\t\t\todd++;\n\t\t\tif(even==odd){\n\t\t\t\tdp[j]=Math.abs(arr[i+1]-arr[i]);\n\t\t\t\tj++;\n\t\t\t}\n\t\t}\n\t\t//sop(Arrays.toString(dp));\n\t\tArrays.sort(dp,0,j);\n\t\tfor(i=1;i<j;i++){\n\t\t\tdp[i] += dp[i-1];\n\t\t\tif(dp[i]<=b)\n\t\t\t\tl=i;\n\t\t}\n\t\tsop(l);\n\t\t/*\n\t\t.\n\t\t.\n\t\t.\n\t\t.\n\t\t.\n\t\t.\n\t\t.\n\t\t*/\n\t}\n\t/*\n\ttemporary functions\n\t.\n\t.\n\t*/\n\n\t/*\n\tfuctions\n\t.\n\t.\n\t.\n\t.\n\t.\n\t.\n\t.\n\t.\n\t.\n\t.\n\t.\n\t.\n\t.\n\t.\n\t.\n\t.\n\t.\n\tabcdefghijklmnopqrstuvwxyz\n\t.\n\t.\n\t.\n\t.\n\t.\n\t.\n\t*/\n\tstatic int modulo(int j,int m){\n\t\tif(j<0)\n\t\t\treturn m+j;\n\t\t if(j>=m)\n\t\t\treturn j-m;\n\n\t\t\treturn j;\n\t}\n\tstatic final int mod=1000000007;\n\tstatic final double eps=1e-8;\n\tstatic final long inf=100000000000000000L;\n\tstatic final boolean debug=true;\n\tstatic Reader in=new Reader();\n\tstatic StringBuilder ans=new StringBuilder();\n\tstatic long powm(long a,long b,long m){\n\t\tlong an=1;\n\t\tlong c=a;\n\t\twhile(b>0){\n\t\t\tif(b%2==1)\n\t\t\t\tan=(an*c)%m;\n\t\t\tc=(c*c)%m;\n\t\t\tb>>=1;\n\t\t}\n\t\treturn an;\n\t}\n\tstatic Random rn=new Random();\n\tstatic void sop(Object a){System.out.println(a);}\n\tstatic int ni(){return in.nextInt();}\n\tstatic int[] nia(int n){int a[]=new int[n];for(int i=0;i<n;i++)a[i]=ni();return a;}\n\tstatic long nl(){return in.nextLong();}\n\tstatic long[] nla(int n){long a[]=new long[n];for(int i=0; i<n; i++)a[i]=nl();return a;}\n\tstatic String ns(){return in.next();}\n\tstatic String[] nsa(int n){String a[]=new String[n];for(int i=0; i<n; i++)a[i]=ns();return a;}\n\tstatic double nd(){return in.nextDouble();}\n\tstatic double[] nda(int n){double a[]=new double[n];for(int i=0;i<n;i++)a[i]=nd();return a;}\n\tstatic class Reader{\n\t\tpublic BufferedReader reader;\n\t\tpublic StringTokenizer tokenizer;\n\t\tpublic Reader(){\n\t\t\treader=new BufferedReader(new InputStreamReader(System.in),32768);\n\t\t\ttokenizer=null;\n\t\t}\n\t\tpublic String next(){\n\t\t\twhile(tokenizer==null || !tokenizer.hasMoreTokens()){\n\t\t\t\ttry{\n\t\t\t\t\ttokenizer=new StringTokenizer(reader.readLine());\n\t\t\t\t}\n\t\t\t\tcatch(IOException e){\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tokenizer.nextToken();\n\t\t}\n\t\tpublic int nextInt(){\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\tpublic long nextLong(){\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\tpublic double nextDouble(){\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "3f447c2b20aa451d6b1c56b33eece89a", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.*;\nimport java.util.*;\n\n\npublic class Main {\n\tstatic int mod = (int) (1e9+7);\n\tstatic InputReader in;\n static PrintWriter out;\n \n \n\t\tpublic static void main(String args[] ) {\n\t\t\t\n\t\t\tin = new InputReader(System.in);\n\t out = new PrintWriter(System.out); \n\t Scanner in = new Scanner (System.in);\n\t int n = in.nextInt();\n\t int B= in.nextInt();\n\t int[] a = new int[n];\n\t for(int i=0;i<n;i++) {\n\t \t \t\ta[i]=in.nextInt();\n\t }\n\t int ce=0,co=0;\n\t //int prev=a[0];\n\t // int[] count = new int[n];\n\t ArrayList<Integer> count = new ArrayList<Integer>();\n\t // int v=0;\n\t // Arrays.sort(a);\n\t \n\t \t\t \n\t int p=0;\n\t for(int i=0;i<n-1;i++) {\n\t \t // a[i]=in.nextInt();\n\t \t \n\t \t if(a[i]%2==0) {\n\t \t\t ce++;\n\t \t }\n\t \t else {\n\t \t\t co++;\n\t \t }\n\t \t //System.out.println(ce+\" \"+co);\n\t \t if(co==ce) {\n\t \t\t // count+=a[i]-prev;\n\t \t\t //System.out.println(a[i]+\" \"+a[i+1]);\n\t \t\t count.add(Math.abs(a[i]-a[i+1]));\n\t \t\t // p++;\n\t \t }\n\t \t // prev=a[i];\n\t }\n\t \n\t // System.out.println(p);\n\t \n\t //Arrays.sort(count);\n\t \n\t //Arrays.sort(count);\n\t Collections.sort(count);\n\t \n\t int sum=0;\n\t int cou=0;\n\t for(int i=0;i<count.size();i++) {\n\t \t \n\t \t \t\tsum+=count.get(i);\n\t \t \n\t \t if(sum>B) {\n\t \t \t\t break;\n\t \t \t }\n\t \t\tcou++;\n\t }\n\t System.out.println(cou);\n\t in.close();\n\t out.close();\n\t\t}\n\t\t\n\t\tstatic class InputReader\n\t {\n\n\t private final InputStream stream;\n\t private final byte[] buf = new byte[8192];\n\t private int curChar, snumChars;\n\t private SpaceCharFilter filter;\n\n\t public InputReader(InputStream stream)\n\t {\n\t this.stream = stream;\n\t }\n\n\t public int snext()\n\t {\n\t if (snumChars == -1)\n\t throw new InputMismatchException();\n\t if (curChar >= snumChars)\n\t {\n\t curChar = 0;\n\t try\n\t {\n\t snumChars = stream.read(buf);\n\t } catch (IOException e)\n\t {\n\t throw new InputMismatchException();\n\t }\n\t if (snumChars <= 0)\n\t return -1;\n\t }\n\t return buf[curChar++];\n\t }\n\n\t public int nextInt()\n\t {\n\t int c = snext();\n\t while (isSpaceChar(c))\n\t {\n\t c = snext();\n\t }\n\t int sgn = 1;\n\t if (c == '-')\n\t {\n\t sgn = -1;\n\t c = snext();\n\t }\n\t int res = 0;\n\t do\n\t {\n\t if (c < '0' || c > '9')\n\t throw new InputMismatchException();\n\t res *= 10;\n\t res += c - '0';\n\t c = snext();\n\t } while (!isSpaceChar(c));\n\t return res * sgn;\n\t }\n\n\t public long nextLong()\n\t {\n\t int c = snext();\n\t while (isSpaceChar(c))\n\t {\n\t c = snext();\n\t }\n\t int sgn = 1;\n\t if (c == '-')\n\t {\n\t sgn = -1;\n\t c = snext();\n\t }\n\t long res = 0;\n\t do\n\t {\n\t if (c < '0' || c > '9')\n\t throw new InputMismatchException();\n\t res *= 10;\n\t res += c - '0';\n\t c = snext();\n\t } while (!isSpaceChar(c));\n\t return res * sgn;\n\t }\n\n\t public int[] nextIntArray(int n)\n\t {\n\t int a[] = new int[n];\n\t for (int i = 0; i < n; i++)\n\t {\n\t a[i] = nextInt();\n\t }\n\t return a;\n\t }\n\n\t public long[] nextLongArray(int n)\n\t {\n\t long a[] = new long[n];\n\t for (int i = 0; i < n; i++)\n\t {\n\t a[i] = nextLong();\n\t }\n\t return a;\n\t }\n\n\t public String readString()\n\t {\n\t int c = snext();\n\t while (isSpaceChar(c))\n\t {\n\t c = snext();\n\t }\n\t StringBuilder res = new StringBuilder();\n\t do\n\t {\n\t res.appendCodePoint(c);\n\t c = snext();\n\t } while (!isSpaceChar(c));\n\t return res.toString();\n\t }\n\n\t public String nextLine()\n\t {\n\t int c = snext();\n\t while (isSpaceChar(c))\n\t c = snext();\n\t StringBuilder res = new StringBuilder();\n\t do\n\t {\n\t res.appendCodePoint(c);\n\t c = snext();\n\t } while (!isEndOfLine(c));\n\t return res.toString();\n\t }\n\n\t public boolean isSpaceChar(int c)\n\t {\n\t if (filter != null)\n\t return filter.isSpaceChar(c);\n\t return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t }\n\n\t private boolean isEndOfLine(int c)\n\t {\n\t return c == '\\n' || c == '\\r' || c == -1;\n\t }\n\n\t public interface SpaceCharFilter\n\t {\n\t public boolean isSpaceChar(int ch);\n\t }\n\n\t }\n}\n", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "b18c8d1b3a6b5363d0fa2f5992800cec", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner s = new Scanner(System.in);\n int n = s.nextInt();\n int b = s.nextInt();\n int[] arr = new int[n];\n for (int i = 0; i < n; i++) {\n arr[i] = s.nextInt();\n }\n System.out.println(maxCuttings(arr, b));\n }\n\n private static int maxCuttings(int[] arr, int b) {\n ArrayList<Integer> costs = new ArrayList<>();\n int numEvens = arr[0] % 2 == 0 ? 1 : 0;\n int numOdds = arr[0] % 2 == 1 ? 1 : 0;\n int numCuttings = 0;\n for (int i = 1; i < arr.length; i++) {\n if (numOdds == numEvens&& Math.abs(arr[i]-arr[i-1])<=b) {\n numEvens = 0;\n numOdds = 0;\n costs.add(Math.abs(arr[i]-arr[i-1]));\n }\n if (arr[i] % 2 == 0) ++numEvens;\n else ++numOdds;\n }\n Collections.sort(costs);\n for(int i=0;i<costs.size();i++){\n if(b<costs.get(i))\n break;\n ++numCuttings;\n b-=costs.get(i);\n }\n return numCuttings;\n }\n}\n", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "a425b664aa4060fcfae11f2a7765ee73", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\n/**\n * Date: 1 Jul, 2018\n * Link:\n *\n * @author Prasad-Chaudhari\n * @email prasadc8897@gmail.com\n */\nimport java.io.BufferedReader;\nimport java.io.BufferedWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.OutputStreamWriter;\nimport java.util.Arrays;\n\npublic class newProgram2 {\n\n public static void main(String[] args) throws IOException {\n // TODO code application logic here\n FastIO in = new FastIO();\n int n = in.ni();\n int b = in.ni();\n int a[] = in.gia(n);\n int diff[] = new int[n];\n int index = 0;\n int even = a[0] % 2 == 0 ? 1 : 0;\n int odd = a[0] % 2 == 1 ? 1 : 0;\n for (int i = 1; i < n; i++) {\n if (even == odd) {\n// System.out.println(i);\n diff[index++] = Math.abs(a[i] - a[i - 1]);\n }\n if (a[i] % 2 == 0) {\n even++;\n } else {\n odd++;\n }\n }\n// for (int i = 0; i < n; i++) {\n// System.out.println(diff[i]);\n// }\n Arrays.sort(diff, 0, index);\n long sum = 0;\n int count = 0;\n for (int i = 0; i < index; i++) {\n if (diff[i] + sum <= b) {\n count++;\n sum += diff[i];\n }\n }\n System.out.println(count);\n }\n\n static class FastIO {\n\n private final BufferedReader br;\n private final BufferedWriter bw;\n private String s[];\n private int index;\n\n public FastIO() throws IOException {\n br = new BufferedReader(new InputStreamReader(System.in));\n bw = new BufferedWriter(new OutputStreamWriter(System.out, \"UTF-8\"));\n s = br.readLine().split(\" \");\n index = 0;\n }\n\n public int ni() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n public double nd() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n public long nl() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n public String next() throws IOException {\n return nextToken();\n }\n\n public String nli() throws IOException {\n try {\n return br.readLine();\n } catch (IOException ex) {\n\n }\n return null;\n }\n\n public int[] gia(int n) throws IOException {\n int a[] = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = ni();\n }\n return a;\n }\n\n public int[] gia(int n, int start, int end) throws IOException {\n validate(n, start, end);\n int a[] = new int[n];\n for (int i = start; i < end; i++) {\n a[i] = ni();\n }\n return a;\n }\n\n public double[] gda(int n) throws IOException {\n double a[] = new double[n];\n for (int i = 0; i < n; i++) {\n a[i] = nd();\n }\n return a;\n }\n\n public double[] gda(int n, int start, int end) throws IOException {\n validate(n, start, end);\n double a[] = new double[n];\n for (int i = start; i < end; i++) {\n a[i] = nd();\n }\n return a;\n }\n\n public long[] gla(int n) throws IOException {\n long a[] = new long[n];\n for (int i = 0; i < n; i++) {\n a[i] = ni();\n }\n return a;\n }\n\n public long[] gla(int n, int start, int end) throws IOException {\n validate(n, start, end);\n long a[] = new long[n];\n for (int i = start; i < end; i++) {\n a[i] = ni();\n }\n return a;\n }\n\n public int[][] gg(int n, int m) throws IOException {\n int adja[][] = new int[n + 1][];\n int from[] = new int[m];\n int to[] = new int[m];\n int count[] = new int[n + 1];\n for (int i = 0; i < m; i++) {\n from[i] = ni();\n to[i] = ni();\n count[from[i]]++;\n count[to[i]]++;\n }\n for (int i = 0; i <= n; i++) {\n adja[i] = new int[count[i]];\n }\n for (int i = 0; i < m; i++) {\n adja[from[i]][--count[from[i]]] = to[i];\n adja[to[i]][--count[to[i]]] = from[i];\n }\n return adja;\n }\n\n public void print(String s) throws IOException {\n bw.write(s);\n bw.flush();\n }\n\n public void println(String s) throws IOException {\n bw.write(s);\n bw.newLine();\n bw.flush();\n }\n\n private String nextToken() throws IndexOutOfBoundsException, IOException {\n if (index == s.length) {\n s = br.readLine().split(\" \");\n index = 0;\n }\n return s[index++];\n }\n\n private void validate(int n, int start, int end) {\n if (start < 0 || end >= n) {\n throw new IllegalArgumentException();\n }\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "ee982dcb4c340b54a0a8576dd56a1b62", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/* package codechef; // don't place package name! */\n\nimport java.util.*;\nimport java.lang.*;\nimport java.io.*;\n\n/* Name of the class has to be \"Main\" only if the class is public. */\npublic class Codechef\n{\n\tpublic static void main (String[] args) throws java.lang.Exception\n\t{\n\t\t// your code goes here\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tint b=sc.nextInt();\n\t\tint array[]=new int[n];\n\t\tint cost[]=new int[n];\n\t\tArrays.fill(cost,-1);\n\t\tfor(int i=0;i<n;i++){\n\t\t array[i]=sc.nextInt();\n\t\t}\n\t\t\n\t\tint co=0,ce=0,cut=0,coin=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t if(array[i]%2==0){ce+=1;}\n\t\t else{co+=1;}\n if(co==ce && i!=array.length-1){\n if(i!=(array.length-1)){cost[i]=Math.abs(array[i+1]-array[i]);}\n co=0;ce=0;\n }\n\t\t}\n\t Arrays.sort(cost);\n\t int sum=0;\n\t\tfor(int i=0;i<cost.length;i++){\n\t\t if(cost[i]!=-1){\n\t\t sum=sum+cost[i];\n\t\t if(sum>b){break;}\n\n\t\t cut+=1;}\n\t\t}\n\t\tSystem.out.println(cut);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "5d8a9aa9e1135468420ae657025834df", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.lang.*;\nimport java.util.*;\nimport java.io.*;\n\npublic class Cutting{\n\n public static int[]strToIntArr(String s){\n\t//\ts = s.substring(1,s.length()-1);\n\tString[] sArr = s.split(\" \");\n\tint len = sArr.length;\n\tint[] retArr = new int[len];\n\tfor(int i=0;i<len;i++){\n\t retArr[i] = Integer.parseInt(sArr[i]);\n\t}\n\treturn retArr;\n }\n\n boolean checkSub(int[]aArr,int splitInd){\n\tboolean correct = true;\n\tint nEven = 0;\n\tint nOdd = 0;\n\tfor(int i=0;i<=splitInd;i++){\n\t int el = aArr[i];\n\t if((el%2)==0){\n\t\tnEven++;\n\t }else{\n\t\tnOdd++;\n\t }\n\t}\n\tif(nEven!=nOdd){\n\t correct = false;\n\t}\n\treturn correct;\n }\n\n int getMinAvailInd(int[]aArr, int nCoins, Hashtable<Integer,Boolean>cutUsed){\n\tint len = aArr.length;\n\tint minInd = -1;\n\tint minCost = nCoins+1;\n\t//between 2 els\n\tfor(int i=1;i<(len-1);i++){\n\t int cost = Math.abs(aArr[i]-aArr[i+1]);\n\t if(cost<minCost){\n\t\tif(checkSub(aArr,i)){\n\t\t if(!cutUsed.containsKey(i)){\n\t\t\tminCost = cost;\n\t\t\tminInd = i;\n\t\t }\n\t\t}\n\t }\n\t}\n\treturn minInd;\n }\n\n public int getMaxCuts(int n, int b, int[]aArr){\n\tint nCoins = b;\n\tint nCuts = 0;\n\tHashtable<Integer,Boolean>cutUsed = new Hashtable<Integer,Boolean>();\n\twhile(nCoins>0){\n\t int ind = getMinAvailInd(aArr,nCoins,cutUsed);\n\t //\t \t System.out.format(\"found ind %d\\n\",ind);\n\t if(ind>-1){\n\t\tcutUsed.put(ind,true);\n\t\tint cost = Math.abs(aArr[ind]-aArr[ind+1]);\n\t\tnCoins-=cost;\n\t\tnCuts++;\n\t }else{\n\t\tbreak;\n\t }\n\t}\n\treturn nCuts;\n }\n \n public static void main(String[]args) throws Exception{\n\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\tBufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));\n\tString nbLn = br.readLine();\n\tString aLn = br.readLine();\n\tint[]nbArr = strToIntArr(nbLn);\n\tint[]aArr = strToIntArr(aLn);\n\tCutting cut = new Cutting();\n\tint n = nbArr[0];\n\tint b = nbArr[1];\n\tint maxC = cut.getMaxCuts(n,b,aArr);\n\tbw.write(Integer.toString(maxC));\n\tbw.newLine();\n\tbw.flush();\n }\n\n}\n", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "31dd093e138f4bfaa37c0122953aaca1", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Task7 {\n static class FastScanner {\n BufferedReader br;\n StringTokenizer st;\n\n FastScanner(File f) {\n try {\n br = new BufferedReader(new FileReader(f));\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n }\n\n FastScanner(InputStream f) {\n br = new BufferedReader(new InputStreamReader(f));\n }\n\n String nextLine() {\n try {\n return br.readLine();\n } catch (IOException e) {\n return null;\n }\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n }\n\n public static void main(String[] args) {\n FastScanner in = new FastScanner(System.in);\n //Enter code here utkarsh\n //SHOW_TIME = true;\n int n =in.nextInt();\n int B = in.nextInt();\n\n\n int a[] = new int [n];\n for (int i = 0; i < n; i++){\n a[i] = in.nextInt();\n }\n\n int even = 0, odd = 0;\n ArrayList <Integer> dp = new ArrayList<>();\n for(int i = 0; i < n; i++) {\n if(a[i]%2 == 0) even++;\n else odd++;\n if(even == odd && i < n-1) dp.add(Math.abs(a[i] - a[i+1]));\n }\n Collections.sort(dp);\n int ans = 0;\n for(int x : dp) {\n if(B < x) break;\n ans++;\n B -= x;\n }\n System.out.println(ans);\n }\n}", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "96e75a7e0952b3c4a07e6d49bd744c69", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "/* \n\n*/\n\nimport java.io.*;\nimport java.util.*;\npublic class Maxcut\n{\n\tpublic static void main(String args[])throws IOException\n\t{\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st = new StringTokenizer(br.readLine());\n\t\tint n =Integer.parseInt(st.nextToken());\n\t\tint b = Integer.parseInt(st.nextToken());\n\t\tint arr[] = new int[n];\n\t\tst = new StringTokenizer(br.readLine());\n\t\tint val[] = new int[n];\n\t\tfor(int i=0;i<n;i++){\n\t\t\tarr[i] = Integer.parseInt(st.nextToken());\n\t\t\tif(arr[i]%2==0)\n\t\t\t\tval[i]=-1;\n\t\t\telse\n\t\t\t\tval[i]=1;\n\t\t}\n\t\t\n\t\tint sum=0;\n\t\tArrayList<Integer>cost = new ArrayList<Integer>();\n\t\tfor(int i=0;i<n-1;i++)\n\t\t{\n\t\t\tsum+=val[i];\n\t\t\tif(sum==0)\n\t\t\t{\n\t\t\t\tcost.add((arr[i+1]-arr[i])>0?(arr[i+1]-arr[i]):-(arr[i+1]-arr[i]));\n\n\n\t\t\t}\n\t\t}\n\t\tCollections.sort(cost);\n\t\tint tcost=0; int maxp=0;\n\t\tfor(Integer i : cost)\n\t\t{\n\t\t\tif(tcost+i<=b)\n\t\t\t{\n\t\t\t\ttcost+=i;\n\t\t\t\tmaxp++;\n\t\t\t\t//System.out.println(tcost+ \" \"+ maxp);\n\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(maxp);\n\t\t//System.out.println(tcost);\n\n\n\t}\n}", "lang_cluster": "Java", "tags": ["sortings", "dp", "greedy"], "code_uid": "0f4416113f0108da6c8bb3e45a46daa5", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n public static int MOD = (int)Math.pow(10, 9)+7;\n\n\n public static long powMod(long X,long N){\n long result = 1;\n X = X % MOD;\n while(N > 0){\n if(N % 2 == 1)\n result = (result * X) % MOD;\n N >>= 1;\n X = (X*X)%MOD;\n }\n return result;\n }\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n\n long X = in.nextLong();\n long K = in.nextLong();\n if(X == 1)\n System.out.println(powMod(2, K) + 1);\n else if(X == 0)\n System.out.println(0);\n else if(K == 0)\n System.out.println((X*2)%MOD);\n else {\n long upperLimit = ((X%MOD) * powMod(2, K)) /*% MOD*/;\n long diff = (X - 1) % MOD;\n long lowerLimit = ((-diff*((1-powMod(2, K)))) + (X%MOD))%MOD;\n\n System.out.println((upperLimit + lowerLimit) % MOD);\n }\n\n }\n}", "lang_cluster": "Java", "tags": ["math"], "code_uid": "0d4ed5a8c73d0eb781a8a503041c531b", "src_uid": "e0e017e8c8872fc1957242ace739464d", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.math.BigInteger;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Vadim Semenov\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskD solver = new TaskD();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskD {\n private static final int MAX = 1_000_000;\n private static final boolean[] NOT_PRIME = new boolean[MAX];\n private static final int[] PRIMES;\n\n static {\n int cnt = 0;\n NOT_PRIME[0] = NOT_PRIME[1] = true;\n for (int p = 2; p < MAX; ++p) {\n if (!NOT_PRIME[p]) {\n cnt++;\n if (p * 1L * p < MAX) {\n for (int q = p * p; q < MAX; q += p) {\n NOT_PRIME[q] = true;\n }\n }\n }\n }\n PRIMES = new int[cnt];\n cnt = 0;\n for (int p = 2; p < MAX; ++p) {\n if (!NOT_PRIME[p]) {\n PRIMES[cnt++] = p;\n }\n }\n }\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n long A = in.nextLong();\n out.println(rec(0, A));\n }\n\n private int rec(int from, long num) {\n if (num == 1) {\n return 1;\n }\n int retval = 0;\n for (int i = from; i < PRIMES.length; ++i) {\n long divisor = PRIMES[i];\n if (divisor * divisor + 1 > num) {\n break;\n }\n while (divisor < num) {\n if (num % (divisor + 1) == 0) {\n retval += rec(i + 1, num / (divisor + 1));\n }\n divisor *= PRIMES[i];\n }\n }\n if (num - 1 >= PRIMES[from] && isPrime(num - 1)) {\n ++retval;\n }\n return retval;\n }\n\n private boolean isPrime(long number) {\n if (number < MAX) {\n return !NOT_PRIME[(int) number];\n }\n return BigInteger.valueOf(number).isProbablePrime(10);\n }\n}\n\nclass InputReader {\n private final BufferedReader reader;\n private StringTokenizer tokenizer;\n\n public InputReader(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n tokenizer = new StringTokenizer(readLine());\n }\n return tokenizer.nextToken();\n }\n\n public String readLine() {\n String line;\n try {\n line = reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n return line;\n }\n}\n\n", "lang_cluster": "Java", "tags": ["dfs and similar", "math", "dp", "data structures", "number theory"], "code_uid": "ab0c0e7437db5449c6ed06b366a86dae", "src_uid": "1f68bd6f8b40e45a5bd360b03a264ef4", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//import java.awt.Dimension;\nimport java.awt.Point;\nimport java.io.*;\nimport static java.lang.Math.*;\nimport java.math.BigDecimal;\nimport java.math.BigInteger;\nimport static java.math.BigInteger.*;\nimport java.util.*;\nimport static java.util.Arrays.*;\n//import java.math.BigInteger;\n//import static java.lang.Character.*;\n//import static java.lang.Math.*;\n//import static java.math.BigInteger.*;\n\n//import static java.util.Arrays.*;\n\n//import java.awt.Point; // interger !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n//import java.awt.Polygon;\n//import java.awt.Rectangle;\n//import java.awt.geom.AffineTransform;\n//import java.awt.geom.Line2D;\n//import java.awt.geom.Point2D;\n//import javafx.scene.shape.Line;\n//import javafx.scene.transform.Rotate;\n\n//<editor-fold defaultstate=\"collapsed\" desc=\"Main\">\npublic class Main implements Runnable{\n\n // https://netbeans.org/kb/73/java/editor-codereference_ru.html#display\n\n static boolean oj;\n \n @Override\n public void run(){\n try {\n Locale.setDefault(Locale.US);\n } catch (Exception e) {\n }\n oj = true;\n try {\n oj = System.getProperty(\"MYLOCAL\") == null;\n } catch (Exception e) {\n }\n//\n if (oj) {\n sc = new FastScanner(new InputStreamReader(System.in));\n out = new PrintWriter(new OutputStreamWriter(System.out));\n } else {\n try {\n sc = new FastScanner(new FileReader(\"input.txt\"));\n out = new PrintWriter(new FileWriter(\"output.txt\"));\n } catch (IOException e) {\n MLE();\n }\n }\n Solver s = new Solver();\n s.sc = sc;\n s.out = out;\n\n s.solve();\n if (!oj) {\n err.println(\"Time: \" + (System.currentTimeMillis() - timeBegin) / 1e3);\n err.printf(\"Mem: %d\\n\", (Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory()) >> 20);\n }\n out.flush();\n }\n\n private void show(int[] arr) {\n for (int v : arr) {\n err.print(\" \" + v);\n }\n err.println();\n }\n\n public static void exit() {\n err.println(\"Time: \" + (System.currentTimeMillis() - timeBegin) / 1e3);\n err.printf(\"Mem: %d\\n\", (Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory()) >> 20);\n out.flush();\n out.close();\n System.exit(0);\n }\n\n public static void MLE() {\n int[][] arr = new int[1024 * 1024][];\n for (int i = 0; i < arr.length; i++) {\n arr[i] = new int[1024 * 1024];\n }\n }\n\n public static void main(String[] args) throws FileNotFoundException {\n //new Main().run();\n new Thread(null, new Main(), \"myThread\", 100 * 1024 * 1024).start();\n }\n\n static long timeBegin = System.currentTimeMillis();\n static FastScanner sc;\n static PrintWriter out;\n static PrintStream err = System.err;\n}\n //</editor-fold>\n\n//<editor-fold defaultstate=\"collapsed\" desc=\"FastScanner\">\nclass FastScanner {\n\n BufferedReader br;\n StringTokenizer st;\n\n FastScanner(InputStreamReader reader) {\n br = new BufferedReader(reader);\n st = new StringTokenizer(\"\");\n }\n\n String next() {\n while (!st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (Exception ex) {\n return null;\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String nextLine() {\n try {\n return br.readLine();\n } catch (IOException ex) {\n return null;\n }\n }\n}\n//</editor-fold>\n\nclass Solver {\n\n void aser(boolean OK) {\n if (!OK) {\n Main.MLE();\n }\n }\n\n FastScanner sc;\n PrintWriter out;\n static PrintStream err = System.err;\n \n long[] getAllDiv(long A){\n TreeSet<Long> arr = new TreeSet<>();\n for( long d = 1; d*d <= A; ++d ){\n if( A % d == 0 ) {\n arr.add(d);\n arr.add(A/d);\n }\n }\n int pos = 0;\n long[] a = new long[arr.size()];\n for (long x : arr) a[pos++] = x;\n return a;\n }\n \n long myPow(long p, int alfa){\n long ans = 1;\n for (int i = 0; i < alfa; i++) {\n ans *= p;\n }\n return ans;\n }\n \n void solve(){\n final long A = sc.nextLong();\n long[] divA = getAllDiv(A);\n TreeMap<Long,TreeSet<Integer>> P = new TreeMap<>();\n for (long div : divA) {\n --div;\n for (int alfa = 1; alfa <= 60; alfa++) {\n long p = (long)( pow( div, 1.0 / alfa ) + 0.5 );\n if( 2<=p && myPow(p,alfa)==div && \n valueOf(p).isProbablePrime(Integer.MAX_VALUE) ){\n if( !P.containsKey(p) )\n P.put(p, new TreeSet<>());\n P.get(p).add(alfa);\n break;\n }\n }\n }\n \n HashMap<Long,Integer> index = new HashMap<>();\n for (int i = 0; i < divA.length; i++) {\n long e = divA[i];\n index.put(e, i);\n }\n \n long[] dp0, dp;\n dp0 = new long[divA.length];\n dp0[0] = 1;\n for( long p : P.keySet() ){\n dp = dp0.clone();\n for( int alfa : P.get(p) ){\n long val = myPow(p, alfa) + 1;\n for( int ID = 0; ID < divA.length; ++ID){\n long div = divA[ID];\n if( 1e12 + 5 <= 1.0 * div * val ) break;\n long toDiv = div * val;\n int toID = binarySearch(divA, toDiv);\n if( 0 <= toID ) dp[toID] += dp0[ID];\n //Integer toID = index.get(toDiv);\n //if( toID!=null && 0 <= toID ) dp[toID] += dp0[ID];\n }\n }\n //\n dp0 = dp;\n }\n out.println(dp0[divA.length - 1]);\n }\n \n \n}\n\n\n", "lang_cluster": "Java", "tags": ["dfs and similar", "math", "dp", "data structures", "number theory"], "code_uid": "3f3eb891376ae2515dce7e5583518e4b", "src_uid": "1f68bd6f8b40e45a5bd360b03a264ef4", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n\npublic class D {\n\n\tFastScanner in;\n\tPrintWriter out;\n\n\tint[] primes;\n\tboolean[] isPrime;\n\tint MAX = 1_000_000;\n\n\tvoid prepare() {\n\t\tisPrime = new boolean[MAX];\n\t\tArrays.fill(isPrime, true);\n\t\tisPrime[0] = isPrime[1] = false;\n\t\tint cnt = 0;\n\t\tfor (int i = 2; i < MAX; i++) {\n\t\t\tif (isPrime[i]) {\n\t\t\t\tcnt++;\n\t\t\t\tfor (int j = 2 * i; j < MAX; j += i) {\n\t\t\t\t\tisPrime[j] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprimes = new int[cnt];\n\t\tcnt = 0;\n\t\tfor (int i = 2; i < MAX; i++) {\n\t\t\tif (isPrime[i]) {\n\t\t\t\tprimes[cnt++] = i;\n\t\t\t}\n\t\t}\n\t}\n\n\tint ans = 0;\n\n\tboolean isPrime(long a) {\n\t\tif (a < MAX) {\n\t\t\treturn isPrime[(int) a];\n\t\t}\n\t\treturn BigInteger.valueOf(a).isProbablePrime(10);\n\t}\n\n\tvoid go(long cur, int lastPrime) {\n\n\t\tif (cur == 1) {\n\t\t\tans++;\n\t\t\treturn;\n\t\t}\n\t\tfor (int pr = lastPrime + 1; pr < primes.length; pr++) {\n\t\t\tlong p = primes[pr];\n\t\t\tif (p * p + 1 > cur) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\twhile (p + 1 <= cur) {\n\t\t\t\tlong nxt = cur / (p + 1);\n\t\t\t\tif (nxt * (p + 1) == cur) {\n\t\t\t\t\tgo(nxt, pr);\n\t\t\t\t}\n\t\t\t\tp *= primes[pr];\n\t\t\t}\n\t\t}\n\n\t\tif (isPrime(cur - 1) && (cur - 1 >= primes[lastPrime + 1])) {\n\t\t\tans++;\n\t\t}\n\t}\n\n\tvoid solve() {\n\t\tlong a = in.nextLong();\n\t\tlong time = System.currentTimeMillis();\n\t\tprepare();\n\t\tgo(a, -1);\n\t\tout.println(ans);\n//\t\tout.println(System.currentTimeMillis()- time);\n\t}\n\n\tvoid run() {\n\t\tin = new FastScanner();\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.close();\n\t}\n\n\tclass FastScanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tpublic FastScanner() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tpublic FastScanner(String s) {\n\t\t\ttry {\n\t\t\t\tbr = new BufferedReader(new FileReader(s));\n\t\t\t} catch (FileNotFoundException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\n\t\tString nextToken() {\n\t\t\twhile (st == null || !st.hasMoreElements()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(nextToken());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(nextToken());\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(nextToken());\n\t\t}\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew D().run();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "math", "dp", "data structures", "number theory"], "code_uid": "cba05aa5cee2c450d92c058579a5ff50", "src_uid": "1f68bd6f8b40e45a5bd360b03a264ef4", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n\npublic class D {\n\n\tFastScanner in;\n\tPrintWriter out;\n\n\tint[] primes;\n\tboolean[] isPrime;\n\tint MAX = 1_000_000;\n\n\tvoid prepare() {\n\t\tisPrime = new boolean[MAX];\n\t\tArrays.fill(isPrime, true);\n\t\tisPrime[0] = isPrime[1] = false;\n\t\tint cnt = 0;\n\t\tfor (int i = 2; i < MAX; i++) {\n\t\t\tif (isPrime[i]) {\n\t\t\t\tcnt++;\n\t\t\t\tfor (int j = 2 * i; j < MAX; j += i) {\n\t\t\t\t\tisPrime[j] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprimes = new int[cnt];\n\t\tcnt = 0;\n\t\tfor (int i = 2; i < MAX; i++) {\n\t\t\tif (isPrime[i]) {\n\t\t\t\tprimes[cnt++] = i;\n\t\t\t}\n\t\t}\n\t}\n\n\tint ans = 0;\n\n\tboolean isPrime(long a) {\n\t\tif (a < MAX) {\n\t\t\treturn isPrime[(int) a];\n\t\t}\n\t\treturn BigInteger.valueOf(a).isProbablePrime(10);\n\t}\n\n\tvoid go(long cur, int lastPrime) {\n\n\t\tif (cur == 1) {\n\t\t\tans++;\n\t\t\treturn;\n\t\t}\n\t\tfor (int pr = lastPrime + 1; pr < primes.length; pr++) {\n\t\t\tlong p = primes[pr];\n\t\t\tif (p * p + 1 > cur) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\twhile (p + 1 <= cur) {\n\t\t\t\tif (cur % (p + 1) == 0) {\n\t\t\t\t\tgo(cur / (p + 1), pr);\n\t\t\t\t}\n\t\t\t\tp *= primes[pr];\n\t\t\t}\n\t\t}\n\n\t\tif (isPrime(cur - 1) && (cur - 1 >= primes[lastPrime + 1])) {\n\t\t\tans++;\n\t\t}\n\t}\n\n\tvoid solve() {\n\t\tlong a = in.nextLong();\n//\t\tlong time = System.currentTimeMillis();\n\t\tprepare();\n\t\tgo(a, -1);\n\t\tout.println(ans);\n//\t\tout.println(System.currentTimeMillis()- time);\n\t}\n\n\tvoid run() {\n\t\tin = new FastScanner();\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.close();\n\t}\n\n\tclass FastScanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tpublic FastScanner() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tpublic FastScanner(String s) {\n\t\t\ttry {\n\t\t\t\tbr = new BufferedReader(new FileReader(s));\n\t\t\t} catch (FileNotFoundException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\n\t\tString nextToken() {\n\t\t\twhile (st == null || !st.hasMoreElements()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(nextToken());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(nextToken());\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(nextToken());\n\t\t}\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew D().run();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "math", "dp", "data structures", "number theory"], "code_uid": "4aafe1144dbb6682f5638767163d866a", "src_uid": "1f68bd6f8b40e45a5bd360b03a264ef4", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tOutputWriter out = new OutputWriter(outputStream);\n\t\tTask solver = new Task();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass Task {\n\t\n\tMap<Long, Integer> map=new EHashMap<>(); \n\tMap<Long, List<Long>> divides=new EHashMap<>();\n\tlong[][] dp;\n\tint idx=0;\n\tList<Long> list=new ArrayList<>();\n\t\n\tpublic void solve(int testNumber, InputReader in, OutputWriter out) {\n\t\tlong A=in.readLong();\n\t\tfor (long i=1; i*i<=A; i++) if (A%i==0) {\n\t\t\tprocess(i);\n\t\t\tif (i*i!=A) process(A/i);\n\t\t}\n\t\tdp=new long[2][map.size()];\n//\t\tfor (long i: map.keySet()) System.out.println(i+\" \"+map.get(i));\n\t\tdp[0][map.get(1L)]=1;\n\t\tint idx=0;\n\t\tfor (long i: divides.keySet()) {\n\t\t\tidx^=1;\n//\t\t\tif (idx>1) dp[idx-2].clear();\n\t\t\tfor (long j: map.keySet()) {\n\t\t\t\tint j2=map.get(j);\n\t\t\t\tdp[idx][j2]=dp[idx^1][j2];\n\t\t\t\tfor (long x: divides.get(i)) \n\t\t\t\t\tif (j%x==0) {\n//\t\t\t\t\t\tSystem.out.println(idx);\n//\t\t\t\t\t\tSystem.out.println(dp[idx]);\n//\t\t\t\t\t\tSystem.out.println(dp[idx-1]);\n\t\t\t\t\t\tdp[idx][j2]+=dp[idx^1][map.get(j/x)];\n\t\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tout.printLine(dp[idx][map.get(A)]);\n\t}\n\t\n\tlong prime(long n) {\n\t\tif (n<=1) return -1;\n\t\tfor (long i=2; i*i<=n; i++) if (n%i==0) {\n\t\t\twhile (n%i==0) n/=i;\n\t\t\treturn n==1?i:-1;\n\t\t}\n\t\treturn n;\n\t}\n\t\n\tvoid process(long x) {\n\t\tmap.put(x, idx++);\n\t\tlong p=prime(x-1);\n\t\tif (p>0) {\n\t\t\tif (!divides.containsKey(p)) divides.put(p, new ArrayList<Long>());\n\t\t\tdivides.get(p).add(x);\n\t\t}\n\t}\n}\n\nclass InputReader {\n\tprivate boolean finished = false;\n\n\tprivate InputStream stream;\n\tprivate byte[] buf = new byte[1024];\n\tprivate int curChar;\n\tprivate int numChars;\n\tprivate SpaceCharFilter filter;\n\n\tpublic InputReader(InputStream stream) {\n\t\tthis.stream = stream;\n\t}\n\n\tpublic int read() {\n\t\tif (numChars == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (curChar >= numChars) {\n\t\t\tcurChar = 0;\n\t\t\ttry {\n\t\t\t\tnumChars = stream.read(buf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (numChars <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buf[curChar++];\n\t}\n\n\tpublic int peek() {\n\t\tif (numChars == -1)\n\t\t\treturn -1;\n\t\tif (curChar >= numChars) {\n\t\t\tcurChar = 0;\n\t\t\ttry {\n\t\t\t\tnumChars = stream.read(buf);\n\t\t\t} catch (IOException e) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tif (numChars <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buf[curChar];\n\t}\n\n\tpublic int readInt() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tint res = 0;\n\t\tdo {\n\t\t\tif (c < '0' || c > '9')\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n\n\tpublic long readLong() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tlong res = 0;\n\t\tdo {\n\t\t\tif (c < '0' || c > '9')\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n\n\tpublic String readString() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tStringBuilder res = new StringBuilder();\n\t\tdo {\n\t\t\tif (Character.isValidCodePoint(c))\n\t\t\t\tres.appendCodePoint(c);\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res.toString();\n\t}\n\n\tpublic boolean isSpaceChar(int c) {\n\t\tif (filter != null)\n\t\t\treturn filter.isSpaceChar(c);\n\t\treturn isWhitespace(c);\n\t}\n\n\tpublic static boolean isWhitespace(int c) {\n\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t}\n\n\tprivate String readLine0() {\n\t\tStringBuilder buf = new StringBuilder();\n\t\tint c = read();\n\t\twhile (c != '\\n' && c != -1) {\n\t\t\tif (c != '\\r')\n\t\t\t\tbuf.appendCodePoint(c);\n\t\t\tc = read();\n\t\t}\n\t\treturn buf.toString();\n\t}\n\n\tpublic String readLine() {\n\t\tString s = readLine0();\n\t\twhile (s.trim().length() == 0)\n\t\t\ts = readLine0();\n\t\treturn s;\n\t}\n\n\tpublic String readLine(boolean ignoreEmptyLines) {\n\t\tif (ignoreEmptyLines)\n\t\t\treturn readLine();\n\t\telse\n\t\t\treturn readLine0();\n\t}\n\n\tpublic BigInteger readBigInteger() {\n\t\ttry {\n\t\t\treturn new BigInteger(readString());\n\t\t} catch (NumberFormatException e) {\n\t\t\tthrow new InputMismatchException();\n\t\t}\n\t}\n\n\tpublic char readCharacter() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\treturn (char) c;\n\t}\n\n\tpublic double readDouble() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tdouble res = 0;\n\t\twhile (!isSpaceChar(c) && c != '.') {\n\t\t\tif (c == 'e' || c == 'E')\n\t\t\t\treturn res * Math.pow(10, readInt());\n\t\t\tif (c < '0' || c > '9')\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t}\n\t\tif (c == '.') {\n\t\t\tc = read();\n\t\t\tdouble m = 1;\n\t\t\twhile (!isSpaceChar(c)) {\n\t\t\t\tif (c == 'e' || c == 'E')\n\t\t\t\t\treturn res * Math.pow(10, readInt());\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tm /= 10;\n\t\t\t\tres += (c - '0') * m;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t}\n\t\treturn res * sgn;\n\t}\n\n\tpublic boolean isExhausted() {\n\t\tint value;\n\t\twhile (isSpaceChar(value = peek()) && value != -1)\n\t\t\tread();\n\t\treturn value == -1;\n\t}\n\n\tpublic String next() {\n\t\treturn readString();\n\t}\n\n\tpublic SpaceCharFilter getFilter() {\n\t\treturn filter;\n\t}\n\n\tpublic void setFilter(SpaceCharFilter filter) {\n\t\tthis.filter = filter;\n\t}\n\n\tpublic interface SpaceCharFilter {\n\t\tpublic boolean isSpaceChar(int ch);\n\t}\n}\n\nclass OutputWriter {\n\tprivate final PrintWriter writer;\n\n\tpublic OutputWriter(OutputStream outputStream) {\n\t\twriter = new PrintWriter(new BufferedWriter(new OutputStreamWriter(\n\t\t\t\toutputStream)));\n\t}\n\n\tpublic OutputWriter(Writer writer) {\n\t\tthis.writer = new PrintWriter(writer);\n\t}\n\n\tpublic void print(char[] array) {\n\t\twriter.print(array);\n\t}\n\n\tpublic void print(Object... objects) {\n\t\tfor (int i = 0; i < objects.length; i++) {\n\t\t\tif (i != 0)\n\t\t\t\twriter.print(' ');\n\t\t\twriter.print(objects[i]);\n\t\t}\n\t}\n\n\tpublic void print(int[] array) {\n\t\tfor (int i = 0; i < array.length; i++) {\n\t\t\tif (i != 0)\n\t\t\t\twriter.print(' ');\n\t\t\twriter.print(array[i]);\n\t\t}\n\t}\n\n\tpublic void print(long[] array) {\n\t\tfor (int i = 0; i < array.length; i++) {\n\t\t\tif (i != 0)\n\t\t\t\twriter.print(' ');\n\t\t\twriter.print(array[i]);\n\t\t}\n\t}\n\n\tpublic void print(Collection<Integer> collection) {\n\t\tboolean first = true;\n\t\tfor (int i : collection) {\n\t\t\tif (first)\n\t\t\t\tfirst = false;\n\t\t\telse\n\t\t\t\twriter.print(' ');\n\t\t\twriter.print(i);\n\t\t}\n\t}\n\n\tpublic void printLine(int[] array) {\n\t\tprint(array);\n\t\twriter.println();\n\t}\n\n\tpublic void printLine(long[] array) {\n\t\tprint(array);\n\t\twriter.println();\n\t}\n\n\tpublic void printLine(Collection<Integer> collection) {\n\t\tprint(collection);\n\t\twriter.println();\n\t}\n\n\tpublic void printLine() {\n\t\twriter.println();\n\t}\n\n\tpublic void printLine(Object... objects) {\n\t\tprint(objects);\n\t\twriter.println();\n\t}\n\n\tpublic void print(char i) {\n\t\twriter.print(i);\n\t}\n\n\tpublic void printLine(char i) {\n\t\twriter.println(i);\n\t}\n\n\tpublic void printLine(char[] array) {\n\t\twriter.println(array);\n\t}\n\n\tpublic void printFormat(String format, Object... objects) {\n\t\twriter.printf(format, objects);\n\t}\n\n\tpublic void close() {\n\t\twriter.close();\n\t}\n\n\tpublic void flush() {\n\t\twriter.flush();\n\t}\n\n\tpublic void print(long i) {\n\t\twriter.print(i);\n\t}\n\n\tpublic void printLine(long i) {\n\t\twriter.println(i);\n\t}\n\n\tpublic void print(int i) {\n\t\twriter.print(i);\n\t}\n\n\tpublic void printLine(int i) {\n\t\twriter.println(i);\n\t}\n}\n\nclass Polygon {\n\tpublic final Point[] vertices;\n\tprivate Segment[] sides;\n\n\tpublic Polygon(Point... vertices) {\n\t\tthis.vertices = vertices.clone();\n\t}\n\n\tpublic double square() {\n\t\tdouble sum = 0;\n\t\tfor (int i = 1; i < vertices.length; i++)\n\t\t\tsum += (vertices[i].x - vertices[i - 1].x)\n\t\t\t\t\t* (vertices[i].y + vertices[i - 1].y);\n\t\tsum += (vertices[0].x - vertices[vertices.length - 1].x)\n\t\t\t\t* (vertices[0].y + vertices[vertices.length - 1].y);\n\t\treturn Math.abs(sum) / 2;\n\t}\n\n\tpublic Point center() {\n\t\tdouble sx = 0;\n\t\tdouble sy = 0;\n\t\tfor (Point point : vertices) {\n\t\t\tsx += point.x;\n\t\t\tsy += point.y;\n\t\t}\n\t\treturn new Point(sx / vertices.length, sy / vertices.length);\n\t}\n\n\tpublic static boolean over(Point a, Point b, Point c) {\n\t\treturn a.x * (b.y - c.y) + b.x * (c.y - a.y) + c.x * (a.y - b.y) < -GeometryUtils.epsilon;\n\t}\n\n\tprivate static boolean under(Point a, Point b, Point c) {\n\t\treturn a.x * (b.y - c.y) + b.x * (c.y - a.y) + c.x * (a.y - b.y) > GeometryUtils.epsilon;\n\t}\n\n\tpublic static Polygon convexHull(Point[] points) {\n\t\tif (points.length == 1)\n\t\t\treturn new Polygon(points);\n\t\tArrays.sort(points, new Comparator<Point>() {\n\t\t\tpublic int compare(Point o1, Point o2) {\n\t\t\t\tint value = Double.compare(o1.x, o2.x);\n\t\t\t\tif (value != 0)\n\t\t\t\t\treturn value;\n\t\t\t\treturn Double.compare(o1.y, o2.y);\n\t\t\t}\n\t\t});\n\t\tPoint left = points[0];\n\t\tPoint right = points[points.length - 1];\n\t\tList<Point> up = new ArrayList<Point>();\n\t\tList<Point> down = new ArrayList<Point>();\n\t\tfor (Point point : points) {\n\t\t\tif (point == left || point == right || !under(left, point, right)) {\n\t\t\t\twhile (up.size() >= 2\n\t\t\t\t\t\t&& under(up.get(up.size() - 2), up.get(up.size() - 1),\n\t\t\t\t\t\t\t\tpoint))\n\t\t\t\t\tup.remove(up.size() - 1);\n\t\t\t\tup.add(point);\n\t\t\t}\n\t\t\tif (point == left || point == right || !over(left, point, right)) {\n\t\t\t\twhile (down.size() >= 2\n\t\t\t\t\t\t&& over(down.get(down.size() - 2),\n\t\t\t\t\t\t\t\tdown.get(down.size() - 1), point))\n\t\t\t\t\tdown.remove(down.size() - 1);\n\t\t\t\tdown.add(point);\n\t\t\t}\n\t\t}\n\t\tPoint[] result = new Point[up.size() + down.size() - 2];\n\t\tint index = 0;\n\t\tfor (Point point : up)\n\t\t\tresult[index++] = point;\n\t\tfor (int i = down.size() - 2; i > 0; i--)\n\t\t\tresult[index++] = down.get(i);\n\t\treturn new Polygon(result);\n\t}\n\n\tpublic boolean contains(Point point) {\n\t\treturn contains(point, false);\n\t}\n\n\tpublic boolean contains(Point point, boolean strict) {\n\t\tfor (Segment segment : sides()) {\n\t\t\tif (segment.contains(point, true))\n\t\t\t\treturn !strict;\n\t\t}\n\t\tdouble totalAngle = GeometryUtils.canonicalAngle(Math.atan2(\n\t\t\t\tvertices[0].y - point.y, vertices[0].x - point.x)\n\t\t\t\t- Math.atan2(vertices[vertices.length - 1].y - point.y,\n\t\t\t\t\t\tvertices[vertices.length - 1].x - point.x));\n\t\tfor (int i = 1; i < vertices.length; i++) {\n\t\t\ttotalAngle += GeometryUtils.canonicalAngle(Math.atan2(vertices[i].y\n\t\t\t\t\t- point.y, vertices[i].x - point.x)\n\t\t\t\t\t- Math.atan2(vertices[i - 1].y - point.y, vertices[i - 1].x\n\t\t\t\t\t\t\t- point.x));\n\t\t}\n\t\treturn Math.abs(totalAngle) > Math.PI;\n\t}\n\n\tpublic Segment[] sides() {\n\t\tif (sides == null) {\n\t\t\tsides = new Segment[vertices.length];\n\t\t\tfor (int i = 0; i < vertices.length - 1; i++)\n\t\t\t\tsides[i] = new Segment(vertices[i], vertices[i + 1]);\n\t\t\tsides[sides.length - 1] = new Segment(\n\t\t\t\t\tvertices[vertices.length - 1], vertices[0]);\n\t\t}\n\t\treturn sides;\n\t}\n\n\tpublic static double triangleSquare(Point a, Point b, Point c) {\n\t\treturn Math.abs((a.x - b.x) * (a.y + b.y) + (b.x - c.x) * (b.y + c.y)\n\t\t\t\t+ (c.x - a.x) * (c.y + a.y)) / 2;\n\t}\n\n\tpublic double perimeter() {\n\t\tdouble result = vertices[0].distance(vertices[vertices.length - 1]);\n\t\tfor (int i = 1; i < vertices.length; i++)\n\t\t\tresult += vertices[i].distance(vertices[i - 1]);\n\t\treturn result;\n\t}\n}\n\nclass Point {\n\tpublic static final Point ORIGIN = new Point(0, 0);\n\tpublic final double x;\n\tpublic final double y;\n\n\t@Override\n\tpublic String toString() {\n\t\treturn \"(\" + x + \", \" + y + \")\";\n\t}\n\n\tpublic Point(double x, double y) {\n\t\tthis.x = x;\n\t\tthis.y = y;\n\t}\n\n\tpublic Line line(Point other) {\n\t\tif (equals(other))\n\t\t\treturn null;\n\t\tdouble a = other.y - y;\n\t\tdouble b = x - other.x;\n\t\tdouble c = -a * x - b * y;\n\t\treturn new Line(a, b, c);\n\t}\n\n\t@Override\n\tpublic boolean equals(Object o) {\n\t\tif (this == o)\n\t\t\treturn true;\n\t\tif (o == null || getClass() != o.getClass())\n\t\t\treturn false;\n\n\t\tPoint point = (Point) o;\n\n\t\treturn Math.abs(x - point.x) <= GeometryUtils.epsilon\n\t\t\t\t&& Math.abs(y - point.y) <= GeometryUtils.epsilon;\n\t}\n\n\t@Override\n\tpublic int hashCode() {\n\t\tint result;\n\t\tlong temp;\n\t\ttemp = x != +0.0d ? Double.doubleToLongBits(x) : 0L;\n\t\tresult = (int) (temp ^ (temp >>> 32));\n\t\ttemp = y != +0.0d ? Double.doubleToLongBits(y) : 0L;\n\t\tresult = 31 * result + (int) (temp ^ (temp >>> 32));\n\t\treturn result;\n\t}\n\n\tpublic double distance(Point other) {\n\t\treturn GeometryUtils.fastHypot(x - other.x, y - other.y);\n\t}\n\n\tpublic double distance(Line line) {\n\t\treturn Math.abs(line.a * x + line.b * y + line.c);\n\t}\n\n\tpublic double value() {\n\t\treturn GeometryUtils.fastHypot(x, y);\n\t}\n\n\tpublic double angle() {\n\t\treturn Math.atan2(y, x);\n\t}\n\n\tpublic static Point readPoint(InputReader in) {\n\t\tdouble x = in.readDouble();\n\t\tdouble y = in.readDouble();\n\t\treturn new Point(x, y);\n\t}\n\n\tpublic Point rotate(double angle) {\n\t\tdouble nx = x * Math.cos(angle) - y * Math.sin(angle);\n\t\tdouble ny = y * Math.cos(angle) + x * Math.sin(angle);\n\t\treturn new Point(nx, ny);\n\t}\n}\n\nclass Segment {\n\tpublic final Point a;\n\tpublic final Point b;\n\tprivate double distance = Double.NaN;\n\tprivate Line line = null;\n\n\tpublic Segment(Point a, Point b) {\n\t\tthis.a = a;\n\t\tthis.b = b;\n\t}\n\n\tpublic double length() {\n\t\tif (Double.isNaN(distance))\n\t\t\tdistance = a.distance(b);\n\t\treturn distance;\n\t}\n\n\tpublic double distance(Point point) {\n\t\tdouble length = length();\n\t\tdouble left = point.distance(a);\n\t\tif (length < GeometryUtils.epsilon)\n\t\t\treturn left;\n\t\tdouble right = point.distance(b);\n\t\tif (left * left > right * right + length * length)\n\t\t\treturn right;\n\t\tif (right * right > left * left + length * length)\n\t\t\treturn left;\n\t\treturn point.distance(line());\n\t}\n\n\tpublic Point intersect(Segment other, boolean includeEnds) {\n\t\tLine line = line();\n\t\tLine otherLine = other.a.line(other.b);\n\t\tif (line.parallel(otherLine))\n\t\t\treturn null;\n\t\tPoint intersection = line.intersect(otherLine);\n\t\tif (contains(intersection, includeEnds)\n\t\t\t\t&& other.contains(intersection, includeEnds))\n\t\t\treturn intersection;\n\t\telse\n\t\t\treturn null;\n\t}\n\n\tpublic boolean contains(Point point, boolean includeEnds) {\n\t\tif (a.equals(point) || b.equals(point))\n\t\t\treturn includeEnds;\n\t\tif (a.equals(b))\n\t\t\treturn false;\n\t\tLine line = line();\n\t\tif (!line.contains(point))\n\t\t\treturn false;\n\t\tLine perpendicular = line.perpendicular(a);\n\t\tdouble aValue = perpendicular.value(a);\n\t\tdouble bValue = perpendicular.value(b);\n\t\tdouble pointValue = perpendicular.value(point);\n\t\treturn aValue < pointValue && pointValue < bValue\n\t\t\t\t|| bValue < pointValue && pointValue < aValue;\n\t}\n\n\tpublic Line line() {\n\t\tif (line == null)\n\t\t\tline = a.line(b);\n\t\treturn line;\n\t}\n\n\tpublic Point middle() {\n\t\treturn new Point((a.x + b.x) / 2, (a.y + b.y) / 2);\n\t}\n\n\tpublic Point[] intersect(Circle circle) {\n\t\tPoint[] result = line().intersect(circle);\n\t\tif (result.length == 0)\n\t\t\treturn result;\n\t\tif (result.length == 1) {\n\t\t\tif (contains(result[0], true))\n\t\t\t\treturn result;\n\t\t\treturn new Point[0];\n\t\t}\n\t\tif (contains(result[0], true)) {\n\t\t\tif (contains(result[1], true))\n\t\t\t\treturn result;\n\t\t\treturn new Point[] { result[0] };\n\t\t}\n\t\tif (contains(result[1], true))\n\t\t\treturn new Point[] { result[1] };\n\t\treturn new Point[0];\n\t}\n\n\tpublic Point intersect(Line line) {\n\t\tLine selfLine = line();\n\t\tPoint intersect = selfLine.intersect(line);\n\t\tif (intersect == null)\n\t\t\treturn null;\n\t\tif (contains(intersect, true))\n\t\t\treturn intersect;\n\t\treturn null;\n\t}\n\n\tpublic double distance(Segment other) {\n\t\tLine line = line();\n\t\tLine otherLine = other.line();\n\t\tPoint p = line == null || otherLine == null ? null : line\n\t\t\t\t.intersect(otherLine);\n\t\tif (p != null && contains(p, true) && other.contains(p, true))\n\t\t\treturn 0;\n\t\treturn Math.min(Math.min(other.distance(a), other.distance(b)),\n\t\t\t\tMath.min(distance(other.a), distance(other.b)));\n\t}\n}\n\nclass GeometryUtils {\n\tpublic static double epsilon = 1e-8;\n\n\tpublic static double fastHypot(double... x) {\n\t\tif (x.length == 0)\n\t\t\treturn 0;\n\t\telse if (x.length == 1)\n\t\t\treturn Math.abs(x[0]);\n\t\telse {\n\t\t\tdouble sumSquares = 0;\n\t\t\tfor (double value : x)\n\t\t\t\tsumSquares += value * value;\n\t\t\treturn Math.sqrt(sumSquares);\n\t\t}\n\t}\n\n\tpublic static double fastHypot(double x, double y) {\n\t\treturn Math.sqrt(x * x + y * y);\n\t}\n\n\tpublic static double fastHypot(double[] x, double[] y) {\n\t\tif (x.length == 0)\n\t\t\treturn 0;\n\t\telse if (x.length == 1)\n\t\t\treturn Math.abs(x[0] - y[0]);\n\t\telse {\n\t\t\tdouble sumSquares = 0;\n\t\t\tfor (int i = 0; i < x.length; i++) {\n\t\t\t\tdouble diff = x[i] - y[i];\n\t\t\t\tsumSquares += diff * diff;\n\t\t\t}\n\t\t\treturn Math.sqrt(sumSquares);\n\t\t}\n\t}\n\n\tpublic static double fastHypot(int[] x, int[] y) {\n\t\tif (x.length == 0)\n\t\t\treturn 0;\n\t\telse if (x.length == 1)\n\t\t\treturn Math.abs(x[0] - y[0]);\n\t\telse {\n\t\t\tdouble sumSquares = 0;\n\t\t\tfor (int i = 0; i < x.length; i++) {\n\t\t\t\tdouble diff = x[i] - y[i];\n\t\t\t\tsumSquares += diff * diff;\n\t\t\t}\n\t\t\treturn Math.sqrt(sumSquares);\n\t\t}\n\t}\n\n\tpublic static double missileTrajectoryLength(double v, double angle,\n\t\t\tdouble g) {\n\t\treturn (v * v * Math.sin(2 * angle)) / g;\n\t}\n\n\tpublic static double sphereVolume(double radius) {\n\t\treturn 4 * Math.PI * radius * radius * radius / 3;\n\t}\n\n\tpublic static double triangleSquare(double first, double second,\n\t\t\tdouble third) {\n\t\tdouble p = (first + second + third) / 2;\n\t\treturn Math.sqrt(p * (p - first) * (p - second) * (p - third));\n\t}\n\n\tpublic static double canonicalAngle(double angle) {\n\t\twhile (angle > Math.PI)\n\t\t\tangle -= 2 * Math.PI;\n\t\twhile (angle < -Math.PI)\n\t\t\tangle += 2 * Math.PI;\n\t\treturn angle;\n\t}\n\n\tpublic static double positiveAngle(double angle) {\n\t\twhile (angle > 2 * Math.PI - GeometryUtils.epsilon)\n\t\t\tangle -= 2 * Math.PI;\n\t\twhile (angle < -GeometryUtils.epsilon)\n\t\t\tangle += 2 * Math.PI;\n\t\treturn angle;\n\t}\n}\n\nclass Line {\n\tpublic final double a;\n\tpublic final double b;\n\tpublic final double c;\n\n\tpublic Line(Point p, double angle) {\n\t\ta = Math.sin(angle);\n\t\tb = -Math.cos(angle);\n\t\tc = -p.x * a - p.y * b;\n\t}\n\n\tpublic Line(double a, double b, double c) {\n\t\tdouble h = GeometryUtils.fastHypot(a, b);\n\t\tthis.a = a / h;\n\t\tthis.b = b / h;\n\t\tthis.c = c / h;\n\t}\n\n\tpublic Point intersect(Line other) {\n\t\tif (parallel(other))\n\t\t\treturn null;\n\t\tdouble determinant = b * other.a - a * other.b;\n\t\tdouble x = (c * other.b - b * other.c) / determinant;\n\t\tdouble y = (a * other.c - c * other.a) / determinant;\n\t\treturn new Point(x, y);\n\t}\n\n\tpublic boolean parallel(Line other) {\n\t\treturn Math.abs(a * other.b - b * other.a) < GeometryUtils.epsilon;\n\t}\n\n\tpublic boolean contains(Point point) {\n\t\treturn Math.abs(value(point)) < GeometryUtils.epsilon;\n\t}\n\n\tpublic Line perpendicular(Point point) {\n\t\treturn new Line(-b, a, b * point.x - a * point.y);\n\t}\n\n\tpublic double value(Point point) {\n\t\treturn a * point.x + b * point.y + c;\n\t}\n\n\tpublic Point[] intersect(Circle circle) {\n\t\tdouble distance = distance(circle.center);\n\t\tif (distance > circle.radius + GeometryUtils.epsilon)\n\t\t\treturn new Point[0];\n\t\tPoint intersection = intersect(perpendicular(circle.center));\n\t\tif (Math.abs(distance - circle.radius) < GeometryUtils.epsilon)\n\t\t\treturn new Point[] { intersection };\n\t\tdouble shift = Math.sqrt(circle.radius * circle.radius - distance\n\t\t\t\t* distance);\n\t\treturn new Point[] {\n\t\t\t\tnew Point(intersection.x + shift * b, intersection.y - shift\n\t\t\t\t\t\t* a),\n\t\t\t\tnew Point(intersection.x - shift * b, intersection.y + shift\n\t\t\t\t\t\t* a) };\n\t}\n\n\tpublic double distance(Point center) {\n\t\treturn Math.abs(value(center));\n\t}\n\n\t@Override\n\tpublic boolean equals(Object o) {\n\t\tif (this == o)\n\t\t\treturn true;\n\t\tif (o == null || getClass() != o.getClass())\n\t\t\treturn false;\n\n\t\tLine line = (Line) o;\n\n\t\tif (!parallel(line))\n\t\t\treturn false;\n\t\tif (Math.abs(a * line.c - c * line.a) > GeometryUtils.epsilon\n\t\t\t\t|| Math.abs(b * line.c - c * line.b) > GeometryUtils.epsilon)\n\t\t\treturn false;\n\n\t\treturn true;\n\t}\n}\n\nclass Circle {\n\tpublic final Point center;\n\tpublic final double radius;\n\n\tpublic Circle(Point center, double radius) {\n\t\tthis.center = center;\n\t\tthis.radius = radius;\n\t}\n\n\tpublic boolean contains(Point point) {\n\t\treturn center.distance(point) < radius + GeometryUtils.epsilon;\n\t}\n\n\tpublic boolean strictContains(Point point) {\n\t\treturn center.distance(point) < radius - GeometryUtils.epsilon;\n\t}\n\n\tpublic Point[] findTouchingPoints(Point point) {\n\t\tdouble distance = center.distance(point);\n\t\tif (distance < radius - GeometryUtils.epsilon)\n\t\t\treturn new Point[0];\n\t\tif (distance < radius + GeometryUtils.epsilon)\n\t\t\treturn new Point[] { point };\n\t\tCircle power = new Circle(point, Math.sqrt((distance - radius)\n\t\t\t\t* (distance + radius)));\n\t\treturn intersect(power);\n\t}\n\n\tpublic Point[] intersect(Circle other) {\n\t\tdouble distance = center.distance(other.center);\n\t\tif (distance > radius + other.radius + GeometryUtils.epsilon\n\t\t\t\t|| Math.abs(radius - other.radius) > distance\n\t\t\t\t\t\t+ GeometryUtils.epsilon)\n\t\t\treturn new Point[0];\n\t\tdouble p = (radius + other.radius + distance) / 2;\n\t\tdouble height = 2\n\t\t\t\t* Math.sqrt(p * (p - radius) * (p - other.radius)\n\t\t\t\t\t\t* (p - distance)) / distance;\n\t\tdouble l1 = Math.sqrt(radius * radius - height * height);\n\t\tdouble l2 = Math.sqrt(other.radius * other.radius - height * height);\n\t\tif (radius * radius + distance * distance < other.radius * other.radius)\n\t\t\tl1 = -l1;\n\t\tif (radius * radius > distance * distance + other.radius * other.radius)\n\t\t\tl2 = -l2;\n\t\tPoint middle = new Point((center.x * l2 + other.center.x * l1)\n\t\t\t\t/ (l1 + l2), (center.y * l2 + other.center.y * l1) / (l1 + l2));\n\t\tLine line = center.line(other.center).perpendicular(middle);\n\t\treturn line.intersect(this);\n\t}\n}\n\nclass Pair<U, V> implements Comparable<Pair<U, V>> {\n\tpublic final U first;\n\tpublic final V second;\n\n\tpublic static <U, V> Pair<U, V> makePair(U first, V second) {\n\t\treturn new Pair<U, V>(first, second);\n\t}\n\n\tprivate Pair(U first, V second) {\n\t\tthis.first = first;\n\t\tthis.second = second;\n\t}\n\n\tpublic boolean equals(Object o) {\n\t\tif (this == o)\n\t\t\treturn true;\n\t\tif (o == null || getClass() != o.getClass())\n\t\t\treturn false;\n\n\t\tPair pair = (Pair) o;\n\n\t\treturn !(first != null ? !first.equals(pair.first) : pair.first != null)\n\t\t\t\t&& !(second != null ? !second.equals(pair.second)\n\t\t\t\t\t\t: pair.second != null);\n\n\t}\n\n\tpublic int hashCode() {\n\t\tint result = first != null ? first.hashCode() : 0;\n\t\tresult = 31 * result + (second != null ? second.hashCode() : 0);\n\t\treturn result;\n\t}\n\n\tpublic String toString() {\n\t\treturn \"(\" + first + \",\" + second + \")\";\n\t}\n\n\tpublic int compareTo(Pair<U, V> o) {\n\t\tint value = ((Comparable<U>) first).compareTo(o.first);\n\t\tif (value != 0)\n\t\t\treturn value;\n\t\treturn ((Comparable<V>) second).compareTo(o.second);\n\t}\n}\n\nclass IOUtils {\n\n\tpublic static void readIntArrays(InputReader in, int[]... arrays) {\n\t\tfor (int i = 0; i < arrays[0].length; i++) {\n\t\t\tfor (int j = 0; j < arrays.length; j++)\n\t\t\t\tarrays[j][i] = in.readInt();\n\t\t}\n\t}\n\n}\n\nclass TreapSet<K> implements NavigableSet<K> {\n\tprotected static final Random rnd = new Random(239);\n\n\tprotected final Node nullNode;\n\tprotected final Comparator<? super K> comparator;\n\tprotected Node root;\n\tprivate final K from;\n\tprivate final K to;\n\tprivate final boolean fromInclusive;\n\tprivate final boolean toInclusive;\n\n\tpublic TreapSet() {\n\t\tthis((Comparator<? super K>) null);\n\t}\n\n\tpublic TreapSet(Comparator<? super K> comparator) {\n\t\tthis(null, null, false, false, comparator, null, null);\n\t}\n\n\tprotected TreapSet(K from, K to, boolean fromInclusive,\n\t\t\tboolean toInclusive, Comparator<? super K> comparator, Node root,\n\t\t\tNode nullNode) {\n\t\tthis.comparator = comparator;\n\t\tthis.from = from;\n\t\tthis.to = to;\n\t\tthis.fromInclusive = fromInclusive;\n\t\tthis.toInclusive = toInclusive;\n\t\tif (nullNode == null)\n\t\t\tnullNode = new NullNode();\n\t\tif (root == null)\n\t\t\troot = nullNode;\n\t\tthis.root = root;\n\t\tthis.nullNode = nullNode;\n\t}\n\n\tpublic boolean addAll(Iterable<? extends K> collection) {\n\t\tboolean result = false;\n\t\tfor (K element : collection)\n\t\t\tresult |= add(element);\n\t\treturn result;\n\t}\n\n\tpublic K lower(K k) {\n\t\tNode target = root.lower(k);\n\t\tif (target == nullNode)\n\t\t\treturn null;\n\t\tif (belongs(target.key))\n\t\t\treturn target.key;\n\t\treturn null;\n\t}\n\n\tprivate boolean belongs(K key) {\n\t\tint valueFrom = compare(from, key);\n\t\tint valueTo = compare(key, to);\n\t\treturn (valueFrom < 0 || valueFrom == 0 && fromInclusive)\n\t\t\t\t&& (valueTo < 0 || valueTo == 0 && toInclusive);\n\t}\n\n\tpublic K floor(K k) {\n\t\tNode target = root.floor(k);\n\t\tif (target == nullNode)\n\t\t\treturn null;\n\t\tif (belongs(target.key))\n\t\t\treturn target.key;\n\t\treturn null;\n\t}\n\n\tpublic K ceiling(K k) {\n\t\tNode target = root.ceil(k);\n\t\tif (target == nullNode)\n\t\t\treturn null;\n\t\tif (belongs(target.key))\n\t\t\treturn target.key;\n\t\treturn null;\n\t}\n\n\tpublic K higher(K k) {\n\t\tNode target = root.higher(k);\n\t\tif (target == nullNode)\n\t\t\treturn null;\n\t\tif (belongs(target.key))\n\t\t\treturn target.key;\n\t\treturn null;\n\t}\n\n\tpublic K pollFirst() {\n\t\tK first = first();\n\t\tif (first == null)\n\t\t\tthrow new NoSuchElementException();\n\t\troot.erase(first);\n\t\treturn first;\n\t}\n\n\tpublic K pollLast() {\n\t\tK last = last();\n\t\tif (last == null)\n\t\t\tthrow new NoSuchElementException();\n\t\troot.erase(last);\n\t\treturn last;\n\t}\n\n\tpublic int size() {\n\t\tif (from == null && to == null)\n\t\t\treturn root.size;\n\t\tif (from == null) {\n\t\t\tNode to = toInclusive ? root.floor(this.to) : root.lower(this.to);\n\t\t\tif (to == nullNode)\n\t\t\t\treturn 0;\n\t\t\treturn root.indexOf(to) + 1;\n\t\t}\n\t\tif (to == null) {\n\t\t\tNode from = fromInclusive ? root.ceil(this.from) : root\n\t\t\t\t\t.higher(this.from);\n\t\t\tif (from == nullNode)\n\t\t\t\treturn 0;\n\t\t\treturn root.size - root.indexOf(from);\n\t\t}\n\t\tNode from = fromInclusive ? root.ceil(this.from) : root\n\t\t\t\t.higher(this.from);\n\t\tif (from == nullNode || !belongs(from.key))\n\t\t\treturn 0;\n\t\tNode to = toInclusive ? root.floor(this.to) : root.lower(this.to);\n\t\treturn root.indexOf(to) - root.indexOf(from) + 1;\n\t}\n\n\tpublic boolean isEmpty() {\n\t\treturn size() == 0;\n\t}\n\n\tpublic boolean contains(Object o) {\n\t\treturn belongs((K) o) && root.search((K) o) != nullNode;\n\t}\n\n\tpublic Iterator<K> iterator() {\n\t\treturn new Iterator<K>() {\n\t\t\tprivate K current = first();\n\n\t\t\tpublic boolean hasNext() {\n\t\t\t\treturn current != null;\n\t\t\t}\n\n\t\t\tpublic K next() {\n\t\t\t\tK result = current;\n\t\t\t\tcurrent = higher(current);\n\t\t\t\treturn result;\n\t\t\t}\n\n\t\t\tpublic void remove() {\n\t\t\t\tTreapSet.this.remove(current);\n\t\t\t}\n\t\t};\n\t}\n\n\tpublic Object[] toArray() {\n\t\tObject[] array = new Object[size()];\n\t\tint index = 0;\n\t\tfor (K key : this)\n\t\t\tarray[index++] = key;\n\t\treturn array;\n\t}\n\n\tpublic <T> T[] toArray(T[] a) {\n\t\tif (a.length < size())\n\t\t\tthrow new IllegalArgumentException();\n\t\tint index = 0;\n\t\tfor (K key : this)\n\t\t\ta[index++] = (T) key;\n\t\treturn a;\n\t}\n\n\tpublic boolean add(K k) {\n\t\tif (k == null)\n\t\t\tthrow new NullPointerException();\n\t\tif (contains(k))\n\t\t\treturn false;\n\t\troot = root.insert(createNode(k));\n\t\treturn true;\n\t}\n\n\tprotected Node createNode(K k) {\n\t\treturn new Node(k, rnd.nextLong());\n\t}\n\n\tpublic boolean remove(Object o) {\n\t\tif (!contains(o))\n\t\t\treturn false;\n\t\t// noinspection unchecked\n\t\troot = root.erase((K) o);\n\t\treturn true;\n\t}\n\n\tpublic boolean containsAll(Collection<?> c) {\n\t\tfor (Object o : c) {\n\t\t\tif (!contains(o))\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\n\tpublic boolean addAll(Collection<? extends K> c) {\n\t\treturn addAll((Iterable<? extends K>) c);\n\t}\n\n\tpublic boolean retainAll(Collection<?> c) {\n\t\tList<K> toRemove = new ArrayList<K>();\n\t\tfor (K key : this) {\n\t\t\tif (!c.contains(key))\n\t\t\t\ttoRemove.add(key);\n\t\t}\n\t\treturn removeAll(toRemove);\n\t}\n\n\tpublic boolean removeAll(Collection<?> c) {\n\t\tboolean result = false;\n\t\tfor (Object o : c)\n\t\t\tresult |= remove(o);\n\t\treturn result;\n\t}\n\n\tpublic void clear() {\n\t\tretainAll(Collections.<Object> emptySet());\n\t}\n\n\tpublic NavigableSet<K> descendingSet() {\n\t\tthrow new UnsupportedOperationException();\n\t}\n\n\tpublic Iterator<K> descendingIterator() {\n\t\treturn new Iterator<K>() {\n\t\t\tprivate K current = last();\n\n\t\t\tpublic boolean hasNext() {\n\t\t\t\treturn current != null;\n\t\t\t}\n\n\t\t\tpublic K next() {\n\t\t\t\tK result = current;\n\t\t\t\tcurrent = lower(current);\n\t\t\t\treturn result;\n\t\t\t}\n\n\t\t\tpublic void remove() {\n\t\t\t\tTreapSet.this.remove(current);\n\t\t\t}\n\t\t};\n\t}\n\n\tpublic NavigableSet<K> subSet(K fromElement, boolean fromInclusive,\n\t\t\tK toElement, boolean toInclusive) {\n\t\treturn new TreapSet<K>(fromElement, toElement, fromInclusive,\n\t\t\t\ttoInclusive, comparator, root, nullNode);\n\t}\n\n\tpublic NavigableSet<K> headSet(K toElement, boolean inclusive) {\n\t\treturn subSet(null, false, toElement, inclusive);\n\t}\n\n\tpublic NavigableSet<K> tailSet(K fromElement, boolean inclusive) {\n\t\treturn subSet(fromElement, inclusive, null, false);\n\t}\n\n\tpublic Comparator<? super K> comparator() {\n\t\treturn comparator;\n\t}\n\n\tpublic SortedSet<K> subSet(K fromElement, K toElement) {\n\t\treturn subSet(fromElement, true, toElement, false);\n\t}\n\n\tpublic SortedSet<K> headSet(K toElement) {\n\t\treturn subSet(null, false, toElement, false);\n\t}\n\n\tpublic SortedSet<K> tailSet(K fromElement) {\n\t\treturn tailSet(fromElement, true);\n\t}\n\n\tpublic K first() {\n\t\tif (isEmpty())\n\t\t\treturn null;\n\t\tif (from == null)\n\t\t\treturn root.first().key;\n\t\tif (fromInclusive)\n\t\t\treturn ceiling(from);\n\t\treturn higher(from);\n\t}\n\n\tpublic K last() {\n\t\tif (isEmpty())\n\t\t\treturn null;\n\t\tif (to == null)\n\t\t\treturn root.last().key;\n\t\tif (toInclusive)\n\t\t\treturn floor(to);\n\t\treturn lower(to);\n\t}\n\n\tprotected int compare(K first, K second) {\n\t\tif (first == null || second == null)\n\t\t\treturn -1;\n\t\tif (comparator != null)\n\t\t\treturn comparator.compare(first, second);\n\t\t// noinspection unchecked\n\t\treturn ((Comparable<? super K>) first).compareTo(second);\n\t}\n\n\tprotected class Node {\n\t\tprotected final K key;\n\t\tprotected final long priority;\n\t\tprotected Node left;\n\t\tprotected Node right;\n\t\tprotected int size;\n\n\t\tprotected Node(K key, long priority) {\n\t\t\tthis.key = key;\n\t\t\tthis.priority = priority;\n\t\t\tleft = nullNode;\n\t\t\tright = nullNode;\n\t\t\tsize = 1;\n\t\t}\n\n\t\tprotected Object[] split(K key) {\n\t\t\tif (compare(key, this.key) < 0) {\n\t\t\t\tObject[] result = left.split(key);\n\t\t\t\tleft = (Node) result[1];\n\t\t\t\tresult[1] = this;\n\t\t\t\tupdateSize();\n\t\t\t\treturn result;\n\t\t\t}\n\t\t\tObject[] result = right.split(key);\n\t\t\tright = (Node) result[0];\n\t\t\tresult[0] = this;\n\t\t\tupdateSize();\n\t\t\treturn result;\n\t\t}\n\n\t\tprotected void updateSize() {\n\t\t\tsize = left.size + right.size + 1;\n\t\t}\n\n\t\tprotected Node insert(Node node) {\n\t\t\tif (node.priority > priority) {\n\t\t\t\tObject[] result = split(node.key);\n\t\t\t\tnode.left = (Node) result[0];\n\t\t\t\tnode.right = (Node) result[1];\n\t\t\t\tnode.updateSize();\n\t\t\t\treturn node;\n\t\t\t}\n\t\t\tif (compare(node.key, this.key) < 0) {\n\t\t\t\tleft = left.insert(node);\n\t\t\t\tupdateSize();\n\t\t\t\treturn this;\n\t\t\t}\n\t\t\tright = right.insert(node);\n\t\t\tupdateSize();\n\t\t\treturn this;\n\t\t}\n\n\t\tprotected Node merge(Node left, Node right) {\n\t\t\tif (left == nullNode)\n\t\t\t\treturn right;\n\t\t\tif (right == nullNode)\n\t\t\t\treturn left;\n\t\t\tif (left.priority > right.priority) {\n\t\t\t\tleft.right = left.right.merge(left.right, right);\n\t\t\t\tleft.updateSize();\n\t\t\t\treturn left;\n\t\t\t}\n\t\t\tright.left = right.left.merge(left, right.left);\n\t\t\tright.updateSize();\n\t\t\treturn right;\n\t\t}\n\n\t\tprotected Node erase(K key) {\n\t\t\tint value = compare(key, this.key);\n\t\t\tif (value == 0)\n\t\t\t\treturn merge(left, right);\n\t\t\tif (value < 0) {\n\t\t\t\tleft = left.erase(key);\n\t\t\t\tupdateSize();\n\t\t\t\treturn this;\n\t\t\t}\n\t\t\tright = right.erase(key);\n\t\t\tupdateSize();\n\t\t\treturn this;\n\t\t}\n\n\t\tprotected Node lower(K key) {\n\t\t\tif (compare(key, this.key) <= 0)\n\t\t\t\treturn left.lower(key);\n\t\t\tNode result = right.lower(key);\n\t\t\tif (result == nullNode)\n\t\t\t\treturn this;\n\t\t\treturn result;\n\t\t}\n\n\t\tprotected Node floor(K key) {\n\t\t\tif (compare(key, this.key) < 0)\n\t\t\t\treturn left.floor(key);\n\t\t\tNode result = right.floor(key);\n\t\t\tif (result == nullNode)\n\t\t\t\treturn this;\n\t\t\treturn result;\n\t\t}\n\n\t\tprotected Node higher(K key) {\n\t\t\tif (compare(key, this.key) >= 0)\n\t\t\t\treturn right.higher(key);\n\t\t\tNode result = left.higher(key);\n\t\t\tif (result == nullNode)\n\t\t\t\treturn this;\n\t\t\treturn result;\n\t\t}\n\n\t\tprotected Node ceil(K key) {\n\t\t\tif (compare(key, this.key) > 0)\n\t\t\t\treturn right.ceil(key);\n\t\t\tNode result = left.ceil(key);\n\t\t\tif (result == nullNode)\n\t\t\t\treturn this;\n\t\t\treturn result;\n\t\t}\n\n\t\tprotected Node first() {\n\t\t\tif (left == nullNode)\n\t\t\t\treturn this;\n\t\t\treturn left.first();\n\t\t}\n\n\t\tprotected Node last() {\n\t\t\tif (right == nullNode)\n\t\t\t\treturn this;\n\t\t\treturn right.last();\n\t\t}\n\n\t\tprotected Node search(K key) {\n\t\t\tint value = compare(key, this.key);\n\t\t\tif (value == 0)\n\t\t\t\treturn this;\n\t\t\tif (value < 0)\n\t\t\t\treturn left.search(key);\n\t\t\treturn right.search(key);\n\t\t}\n\n\t\tpublic int indexOf(Node node) {\n\t\t\tif (this == node)\n\t\t\t\treturn left.size;\n\t\t\tif (compare(node.key, this.key) > 0)\n\t\t\t\treturn left.size + 1 + right.indexOf(node);\n\t\t\treturn left.indexOf(node);\n\t\t}\n\n\t}\n\n\tprivate class NullNode extends Node {\n\t\tprivate Object[] splitResult = new Object[2];\n\n\t\tprivate NullNode() {\n\t\t\tsuper(null, Long.MIN_VALUE);\n\t\t\tleft = this;\n\t\t\tright = this;\n\t\t\tsize = 0;\n\t\t}\n\n\t\tprotected Object[] split(K key) {\n\t\t\tsplitResult[0] = splitResult[1] = this;\n\t\t\treturn splitResult;\n\t\t}\n\n\t\tprotected Node insert(Node node) {\n\t\t\treturn node;\n\t\t}\n\n\t\tprotected Node erase(K key) {\n\t\t\treturn this;\n\t\t}\n\n\t\tprotected Node lower(K key) {\n\t\t\treturn this;\n\t\t}\n\n\t\tprotected Node floor(K key) {\n\t\t\treturn this;\n\t\t}\n\n\t\tprotected Node higher(K key) {\n\t\t\treturn this;\n\t\t}\n\n\t\tprotected Node ceil(K key) {\n\t\t\treturn this;\n\t\t}\n\n\t\tprotected Node first() {\n\t\t\tthrow new NoSuchElementException();\n\t\t}\n\n\t\tprotected Node last() {\n\t\t\tthrow new NoSuchElementException();\n\t\t}\n\n\t\tprotected void updateSize() {\n\t\t}\n\n\t\tprotected Node search(K key) {\n\t\t\treturn this;\n\t\t}\n\n\t}\n}\n\nclass EHashMap<E, V> extends AbstractMap<E, V> {\n\tprivate static final int[] shifts = new int[10];\n\n\tprivate int size;\n\tprivate HashEntry<E, V>[] data;\n\tprivate int capacity;\n\tprivate Set<Entry<E, V>> entrySet;\n\n\tstatic {\n\t\tRandom random = new Random(System.currentTimeMillis());\n\t\tfor (int i = 0; i < 10; i++)\n\t\t\tshifts[i] = 1 + 3 * i + random.nextInt(3);\n\t}\n\n\tpublic EHashMap() {\n\t\tthis(4);\n\t}\n\n\tprivate void setCapacity(int size) {\n\t\tcapacity = Integer.highestOneBit(4 * size);\n\t\t// noinspection unchecked\n\t\tdata = new HashEntry[capacity];\n\t}\n\n\tpublic EHashMap(int maxSize) {\n\t\tsetCapacity(maxSize);\n\t\tentrySet = new AbstractSet<Entry<E, V>>() {\n\t\t\tpublic Iterator<Entry<E, V>> iterator() {\n\t\t\t\treturn new Iterator<Entry<E, V>>() {\n\t\t\t\t\tprivate HashEntry<E, V> last = null;\n\t\t\t\t\tprivate HashEntry<E, V> current = null;\n\t\t\t\t\tprivate HashEntry<E, V> base = null;\n\t\t\t\t\tprivate int lastIndex = -1;\n\t\t\t\t\tprivate int index = -1;\n\n\t\t\t\t\tpublic boolean hasNext() {\n\t\t\t\t\t\tif (current == null) {\n\t\t\t\t\t\t\tfor (index++; index < capacity; index++) {\n\t\t\t\t\t\t\t\tif (data[index] != null) {\n\t\t\t\t\t\t\t\t\tbase = current = data[index];\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn current != null;\n\t\t\t\t\t}\n\n\t\t\t\t\tpublic Entry<E, V> next() {\n\t\t\t\t\t\tif (!hasNext())\n\t\t\t\t\t\t\tthrow new NoSuchElementException();\n\t\t\t\t\t\tlast = current;\n\t\t\t\t\t\tlastIndex = index;\n\t\t\t\t\t\tcurrent = current.next;\n\t\t\t\t\t\tif (base.next != last)\n\t\t\t\t\t\t\tbase = base.next;\n\t\t\t\t\t\treturn last;\n\t\t\t\t\t}\n\n\t\t\t\t\tpublic void remove() {\n\t\t\t\t\t\tif (last == null)\n\t\t\t\t\t\t\tthrow new IllegalStateException();\n\t\t\t\t\t\tsize--;\n\t\t\t\t\t\tif (base == last)\n\t\t\t\t\t\t\tdata[lastIndex] = last.next;\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tbase.next = last.next;\n\t\t\t\t\t}\n\t\t\t\t};\n\t\t\t}\n\n\t\t\tpublic int size() {\n\t\t\t\treturn size;\n\t\t\t}\n\t\t};\n\t}\n\n\tpublic Set<Entry<E, V>> entrySet() {\n\t\treturn entrySet;\n\t}\n\n\tpublic void clear() {\n\t\tArrays.fill(data, null);\n\t\tsize = 0;\n\t}\n\n\tprivate int index(Object o) {\n\t\treturn getHash(o.hashCode()) & (capacity - 1);\n\t}\n\n\tprivate int getHash(int h) {\n\t\tint result = h;\n\t\tfor (int i : shifts)\n\t\t\tresult ^= h >>> i;\n\t\treturn result;\n\t}\n\n\tpublic V remove(Object o) {\n\t\tif (o == null)\n\t\t\treturn null;\n\t\tint index = index(o);\n\t\tHashEntry<E, V> current = data[index];\n\t\tHashEntry<E, V> last = null;\n\t\twhile (current != null) {\n\t\t\tif (current.key.equals(o)) {\n\t\t\t\tif (last == null)\n\t\t\t\t\tdata[index] = current.next;\n\t\t\t\telse\n\t\t\t\t\tlast.next = current.next;\n\t\t\t\tsize--;\n\t\t\t\treturn current.value;\n\t\t\t}\n\t\t\tlast = current;\n\t\t\tcurrent = current.next;\n\t\t}\n\t\treturn null;\n\t}\n\n\tpublic V put(E e, V value) {\n\t\tif (e == null)\n\t\t\treturn null;\n\t\tint index = index(e);\n\t\tHashEntry<E, V> current = data[index];\n\t\tif (current != null) {\n\t\t\twhile (true) {\n\t\t\t\tif (current.key.equals(e)) {\n\t\t\t\t\tV oldValue = current.value;\n\t\t\t\t\tcurrent.value = value;\n\t\t\t\t\treturn oldValue;\n\t\t\t\t}\n\t\t\t\tif (current.next == null)\n\t\t\t\t\tbreak;\n\t\t\t\tcurrent = current.next;\n\t\t\t}\n\t\t}\n\t\tif (current == null)\n\t\t\tdata[index] = new HashEntry<E, V>(e, value);\n\t\telse\n\t\t\tcurrent.next = new HashEntry<E, V>(e, value);\n\t\tsize++;\n\t\tif (2 * size > capacity) {\n\t\t\tHashEntry<E, V>[] oldData = data;\n\t\t\tsetCapacity(size);\n\t\t\tfor (HashEntry<E, V> entry : oldData) {\n\t\t\t\twhile (entry != null) {\n\t\t\t\t\tHashEntry<E, V> next = entry.next;\n\t\t\t\t\tindex = index(entry.key);\n\t\t\t\t\tentry.next = data[index];\n\t\t\t\t\tdata[index] = entry;\n\t\t\t\t\tentry = next;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn null;\n\t}\n\n\tpublic V get(Object o) {\n\t\tif (o == null)\n\t\t\treturn null;\n\t\tint index = index(o);\n\t\tHashEntry<E, V> current = data[index];\n\t\twhile (current != null) {\n\t\t\tif (current.key.equals(o))\n\t\t\t\treturn current.value;\n\t\t\tcurrent = current.next;\n\t\t}\n\t\treturn null;\n\t}\n\n\tpublic boolean containsKey(Object o) {\n\t\tif (o == null)\n\t\t\treturn false;\n\t\tint index = index(o);\n\t\tHashEntry<E, V> current = data[index];\n\t\twhile (current != null) {\n\t\t\tif (current.key.equals(o))\n\t\t\t\treturn true;\n\t\t\tcurrent = current.next;\n\t\t}\n\t\treturn false;\n\t}\n\n\tpublic int size() {\n\t\treturn size;\n\t}\n\n\tprivate static class HashEntry<E, V> implements Entry<E, V> {\n\t\tprivate final E key;\n\t\tprivate V value;\n\t\tprivate HashEntry<E, V> next;\n\n\t\tprivate HashEntry(E key, V value) {\n\t\t\tthis.key = key;\n\t\t\tthis.value = value;\n\t\t}\n\n\t\tpublic E getKey() {\n\t\t\treturn key;\n\t\t}\n\n\t\tpublic V getValue() {\n\t\t\treturn value;\n\t\t}\n\n\t\tpublic V setValue(V value) {\n\t\t\tV oldValue = this.value;\n\t\t\tthis.value = value;\n\t\t\treturn oldValue;\n\t\t}\n\t}\n}\n\nabstract class IntervalTree {\n\tprotected int size;\n\n\tpublic IntervalTree(int size, boolean shouldInit) {\n\t\tthis.size = size;\n\t\tint nodeCount = Math.max(1, Integer.highestOneBit(size) << 2);\n\t\tinitData(size, nodeCount);\n\t\tif (shouldInit)\n\t\t\tinit();\n\t}\n\n\tprotected abstract void initData(int size, int nodeCount);\n\n\tprotected abstract void initAfter(int root, int left, int right, int middle);\n\n\tprotected abstract void initBefore(int root, int left, int right, int middle);\n\n\tprotected abstract void initLeaf(int root, int index);\n\n\tprotected abstract void updatePostProcess(int root, int left, int right,\n\t\t\tint from, int to, long delta, int middle);\n\n\tprotected abstract void updatePreProcess(int root, int left, int right,\n\t\t\tint from, int to, long delta, int middle);\n\n\tprotected abstract void updateFull(int root, int left, int right, int from,\n\t\t\tint to, long delta);\n\n\tprotected abstract long queryPostProcess(int root, int left, int right,\n\t\t\tint from, int to, int middle, long leftResult, long rightResult);\n\n\tprotected abstract void queryPreProcess(int root, int left, int right,\n\t\t\tint from, int to, int middle);\n\n\tprotected abstract long queryFull(int root, int left, int right, int from,\n\t\t\tint to);\n\n\tprotected abstract long emptySegmentResult();\n\n\tpublic void init() {\n\t\tif (size == 0)\n\t\t\treturn;\n\t\tinit(0, 0, size - 1);\n\t}\n\n\tprivate void init(int root, int left, int right) {\n\t\tif (left == right) {\n\t\t\tinitLeaf(root, left);\n\t\t} else {\n\t\t\tint middle = (left + right) >> 1;\n\t\t\tinitBefore(root, left, right, middle);\n\t\t\tinit(2 * root + 1, left, middle);\n\t\t\tinit(2 * root + 2, middle + 1, right);\n\t\t\tinitAfter(root, left, right, middle);\n\t\t}\n\t}\n\n\tpublic void update(int from, int to, long delta) {\n\t\tupdate(0, 0, size - 1, from, to, delta);\n\t}\n\n\tprotected void update(int root, int left, int right, int from, int to,\n\t\t\tlong delta) {\n\t\tif (left > to || right < from)\n\t\t\treturn;\n\t\tif (left >= from && right <= to) {\n\t\t\tupdateFull(root, left, right, from, to, delta);\n\t\t\treturn;\n\t\t}\n\t\tint middle = (left + right) >> 1;\n\t\tupdatePreProcess(root, left, right, from, to, delta, middle);\n\t\tupdate(2 * root + 1, left, middle, from, to, delta);\n\t\tupdate(2 * root + 2, middle + 1, right, from, to, delta);\n\t\tupdatePostProcess(root, left, right, from, to, delta, middle);\n\t}\n\n\tpublic long query(int from, int to) {\n\t\treturn query(0, 0, size - 1, from, to);\n\t}\n\n\tprotected long query(int root, int left, int right, int from, int to) {\n\t\tif (left > to || right < from)\n\t\t\treturn emptySegmentResult();\n\t\tif (left >= from && right <= to)\n\t\t\treturn queryFull(root, left, right, from, to);\n\t\tint middle = (left + right) >> 1;\n\t\tqueryPreProcess(root, left, right, from, to, middle);\n\t\tlong leftResult = query(2 * root + 1, left, middle, from, to);\n\t\tlong rightResult = query(2 * root + 2, middle + 1, right, from, to);\n\t\treturn queryPostProcess(root, left, right, from, to, middle,\n\t\t\t\tleftResult, rightResult);\n\t}\n}\n\nabstract class LongIntervalTree extends IntervalTree {\n\tprotected long[] value;\n\tprotected long[] delta;\n\n\tprotected LongIntervalTree(int size) {\n\t\tthis(size, true);\n\t}\n\n\tpublic LongIntervalTree(int size, boolean shouldInit) {\n\t\tsuper(size, shouldInit);\n\t}\n\n\tprotected void initData(int size, int nodeCount) {\n\t\tvalue = new long[nodeCount];\n\t\tdelta = new long[nodeCount];\n\t}\n\n\tprotected abstract long joinValue(long left, long right);\n\n\tprotected abstract long joinDelta(long was, long delta);\n\n\tprotected abstract long accumulate(long value, long delta, int length);\n\n\tprotected abstract long neutralValue();\n\n\tprotected abstract long neutralDelta();\n\n\tprotected long initValue(int index) {\n\t\treturn neutralValue();\n\t}\n\n\tprotected void initAfter(int root, int left, int right, int middle) {\n\t\tvalue[root] = joinValue(value[2 * root + 1], value[2 * root + 2]);\n\t\tdelta[root] = neutralDelta();\n\t}\n\n\tprotected void initBefore(int root, int left, int right, int middle) {\n\t}\n\n\tprotected void initLeaf(int root, int index) {\n\t\tvalue[root] = initValue(index);\n\t\tdelta[root] = neutralDelta();\n\t}\n\n\tprotected void updatePostProcess(int root, int left, int right, int from,\n\t\t\tint to, long delta, int middle) {\n\t\tvalue[root] = joinValue(value[2 * root + 1], value[2 * root + 2]);\n\t}\n\n\tprotected void updatePreProcess(int root, int left, int right, int from,\n\t\t\tint to, long delta, int middle) {\n\t\tpushDown(root, left, middle, right);\n\t}\n\n\tprotected void pushDown(int root, int left, int middle, int right) {\n\t\tvalue[2 * root + 1] = accumulate(value[2 * root + 1], delta[root],\n\t\t\t\tmiddle - left + 1);\n\t\tvalue[2 * root + 2] = accumulate(value[2 * root + 2], delta[root],\n\t\t\t\tright - middle);\n\t\tdelta[2 * root + 1] = joinDelta(delta[2 * root + 1], delta[root]);\n\t\tdelta[2 * root + 2] = joinDelta(delta[2 * root + 2], delta[root]);\n\t\tdelta[root] = neutralDelta();\n\t}\n\n\tprotected void updateFull(int root, int left, int right, int from, int to,\n\t\t\tlong delta) {\n\t\tvalue[root] = accumulate(value[root], delta, right - left + 1);\n\t\tthis.delta[root] = joinDelta(this.delta[root], delta);\n\t}\n\n\tprotected long queryPostProcess(int root, int left, int right, int from,\n\t\t\tint to, int middle, long leftResult, long rightResult) {\n\t\treturn joinValue(leftResult, rightResult);\n\t}\n\n\tprotected void queryPreProcess(int root, int left, int right, int from,\n\t\t\tint to, int middle) {\n\t\tpushDown(root, left, middle, right);\n\t}\n\n\tprotected long queryFull(int root, int left, int right, int from, int to) {\n\t\treturn value[root];\n\t}\n\n\tprotected long emptySegmentResult() {\n\t\treturn neutralValue();\n\t}\n}", "lang_cluster": "Java", "tags": ["dfs and similar", "math", "dp", "data structures", "number theory"], "code_uid": "d611cd4863cd1b884a1408f4e5b2efef", "src_uid": "1f68bd6f8b40e45a5bd360b03a264ef4", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "//package vk2015.r3;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.List;\n\npublic class D2 {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\tint[] primes;\n\tboolean[] isp;\n\tlong[] ds;\n\t\n\tvoid solve()\n\t{\n\t\tprimes = sieveEratosthenes(1000000);\n\t\tlong n = nl();\n\t\tds = new long[7000];\n\t\t{\n\t\t\tint p = 0;\n\t\t\tfor(long i = 1;i*i <= n;i++){\n\t\t\t\tif(n % i == 0){\n\t\t\t\t\tds[p++] = i;\n\t\t\t\t\tif(i*i < n)ds[p++] = n/i;\n\t\t\t\t}\n\t\t\t}\n\t\t\tArrays.sort(ds, 0, p);\n\t\t\tds = Arrays.copyOf(ds, p);\n\t\t}\n\t\t\n\t\tint m = ds.length;\n\t\tlong[] dp = new long[m];\n\t\tdp[m-1] = 1;\n\t\tfor(int p : primes){\n\t\t\tlong q = p;\n\t\t\tList<Long> la = null;\n\t\t\tfor(int e = 1;q+1 <= n;e++, q *= p){\n\t\t\t\tif(n % (q+1) == 0){\n\t\t\t\t\tif(la == null)la = new ArrayList<Long>();\n\t\t\t\t\tla.add(q+1);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(la != null){\n\t\t\t\tfor(int i = 0;i < m;i++){\n\t\t\t\t\tfor(long u : la){\n\t\t\t\t\t\tif(ds[i] % u == 0){\n\t\t\t\t\t\t\tint to = Arrays.binarySearch(ds, ds[i]/u);\n\t\t\t\t\t\t\tdp[to] += dp[i];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tlong ret = 0;\n\t\tfor(int i = 0;i < m;i++){\n\t\t\tif(ds[i] == 1 || ds[i] >= 1000000 && isp(ds[i]-1)){\n\t\t\t\tret += dp[i];\n\t\t\t}\n\t\t}\n\t\tout.println(ret);\n\t}\n\t\n\tboolean isp(long n)\n\t{\n\t\tif(n <= 1)return false;\n\t\tfor(int p : primes){\n\t\t\tif((long)p*p > n)break;\n\t\t\tif(n%p == 0)return false;\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tpublic static int[] sieveEratosthenes(int n) {\n\t\tif (n <= 32) {\n\t\t\tint[] primes = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };\n\t\t\tfor (int i = 0; i < primes.length; i++) {\n\t\t\t\tif (n < primes[i]) {\n\t\t\t\t\treturn Arrays.copyOf(primes, i);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn primes;\n\t\t}\n\n\t\tint u = n + 32;\n\t\tdouble lu = Math.log(u);\n\t\tint[] ret = new int[(int) (u / lu + u / lu / lu * 1.5)];\n\t\tret[0] = 2;\n\t\tint pos = 1;\n\n\t\tint[] isnp = new int[(n + 1) / 32 / 2 + 1];\n\t\tint sup = (n + 1) / 32 / 2 + 1;\n\n\t\tint[] tprimes = { 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };\n\t\tfor (int tp : tprimes) {\n\t\t\tret[pos++] = tp;\n\t\t\tint[] ptn = new int[tp];\n\t\t\tfor (int i = (tp - 3) / 2; i < tp << 5; i += tp)\n\t\t\t\tptn[i >> 5] |= 1 << (i & 31);\n\t\t\tfor (int j = 0; j < sup; j += tp) {\n\t\t\t\tfor (int i = 0; i < tp && i + j < sup; i++) {\n\t\t\t\t\tisnp[j + i] |= ptn[i];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// 3,5,7\n\t\t// 2x+3=n\n\t\tint[] magic = { 0, 1, 23, 2, 29, 24, 19, 3, 30, 27, 25, 11, 20, 8, 4,\n\t\t\t\t13, 31, 22, 28, 18, 26, 10, 7, 12, 21, 17, 9, 6, 16, 5, 15, 14 };\n\t\tint h = n / 2;\n\t\tfor (int i = 0; i < sup; i++) {\n\t\t\tfor (int j = ~isnp[i]; j != 0; j &= j - 1) {\n\t\t\t\tint pp = i << 5 | magic[(j & -j) * 0x076be629 >>> 27];\n\t\t\t\tint p = 2 * pp + 3;\n\t\t\t\tif (p > n)\n\t\t\t\t\tbreak;\n\t\t\t\tret[pos++] = p;\n\t\t\t\tif ((long) p * p > n)\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (int q = (p * p - 3) / 2; q <= h; q += p)\n\t\t\t\t\tisnp[q >> 5] |= 1 << q;\n\t\t\t}\n\t\t}\n\n\t\treturn Arrays.copyOf(ret, pos);\n\t}\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new D2().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tprivate int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "math", "dp", "data structures", "number theory"], "code_uid": "961b983c61fcbd8eecdf957c7b4d6cf4", "src_uid": "1f68bd6f8b40e45a5bd360b03a264ef4", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//import java.awt.Dimension;\nimport java.awt.Point;\nimport java.io.*;\nimport static java.lang.Math.*;\nimport java.math.BigDecimal;\nimport java.math.BigInteger;\nimport static java.math.BigInteger.*;\nimport java.util.*;\nimport static java.util.Arrays.*;\n//import java.math.BigInteger;\n//import static java.lang.Character.*;\n//import static java.lang.Math.*;\n//import static java.math.BigInteger.*;\n\n//import static java.util.Arrays.*;\n\n//import java.awt.Point; // interger !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n//import java.awt.Polygon;\n//import java.awt.Rectangle;\n//import java.awt.geom.AffineTransform;\n//import java.awt.geom.Line2D;\n//import java.awt.geom.Point2D;\n//import javafx.scene.shape.Line;\n//import javafx.scene.transform.Rotate;\n\n//<editor-fold defaultstate=\"collapsed\" desc=\"Main\">\npublic class Main implements Runnable{\n\n // https://netbeans.org/kb/73/java/editor-codereference_ru.html#display\n\n static boolean oj;\n \n @Override\n public void run(){\n try {\n Locale.setDefault(Locale.US);\n } catch (Exception e) {\n }\n oj = true;\n try {\n oj = System.getProperty(\"MYLOCAL\") == null;\n } catch (Exception e) {\n }\n//\n if (oj) {\n sc = new FastScanner(new InputStreamReader(System.in));\n out = new PrintWriter(new OutputStreamWriter(System.out));\n } else {\n try {\n sc = new FastScanner(new FileReader(\"input.txt\"));\n out = new PrintWriter(new FileWriter(\"output.txt\"));\n } catch (IOException e) {\n MLE();\n }\n }\n Solver s = new Solver();\n s.sc = sc;\n s.out = out;\n\n s.solve();\n if (!oj) {\n err.println(\"Time: \" + (System.currentTimeMillis() - timeBegin) / 1e3);\n err.printf(\"Mem: %d\\n\", (Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory()) >> 20);\n }\n out.flush();\n }\n\n private void show(int[] arr) {\n for (int v : arr) {\n err.print(\" \" + v);\n }\n err.println();\n }\n\n public static void exit() {\n err.println(\"Time: \" + (System.currentTimeMillis() - timeBegin) / 1e3);\n err.printf(\"Mem: %d\\n\", (Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory()) >> 20);\n out.flush();\n out.close();\n System.exit(0);\n }\n\n public static void MLE() {\n int[][] arr = new int[1024 * 1024][];\n for (int i = 0; i < arr.length; i++) {\n arr[i] = new int[1024 * 1024];\n }\n }\n\n public static void main(String[] args) throws FileNotFoundException {\n //new Main().run();\n new Thread(null, new Main(), \"myThread\", 100 * 1024 * 1024).start();\n }\n\n static long timeBegin = System.currentTimeMillis();\n static FastScanner sc;\n static PrintWriter out;\n static PrintStream err = System.err;\n}\n //</editor-fold>\n\n//<editor-fold defaultstate=\"collapsed\" desc=\"FastScanner\">\nclass FastScanner {\n\n BufferedReader br;\n StringTokenizer st;\n\n FastScanner(InputStreamReader reader) {\n br = new BufferedReader(reader);\n st = new StringTokenizer(\"\");\n }\n\n String next() {\n while (!st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (Exception ex) {\n return null;\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String nextLine() {\n try {\n return br.readLine();\n } catch (IOException ex) {\n return null;\n }\n }\n}\n//</editor-fold>\n\nclass Solver {\n\n void aser(boolean OK) {\n if (!OK) {\n Main.MLE();\n }\n }\n\n FastScanner sc;\n PrintWriter out;\n static PrintStream err = System.err;\n \n long[] getAllDiv(long A){\n TreeSet<Long> arr = new TreeSet<>();\n for( long d = 1; d*d <= A; ++d ){\n if( A % d == 0 ) {\n arr.add(d);\n arr.add(A/d);\n }\n }\n int pos = 0;\n long[] a = new long[arr.size()];\n for (long x : arr) a[pos++] = x;\n return a;\n }\n \n long myPow(long p, int alfa){\n long ans = 1;\n for (int i = 0; i < alfa; i++) {\n ans *= p;\n }\n return ans;\n }\n \n void solve(){\n final long A = sc.nextLong();\n long[] divA = getAllDiv(A);\n TreeMap<Long,TreeSet<Integer>> P = new TreeMap<>();\n for (long div : divA) {\n --div;\n for (int alfa = 1; alfa <= 60; alfa++) {\n long p = (long)( pow( div, 1.0 / alfa ) + 0.5 );\n if( 2<=p && myPow(p,alfa)==div && \n valueOf(p).isProbablePrime(Integer.MAX_VALUE) ){\n if( !P.containsKey(p) )\n P.put(p, new TreeSet<>());\n P.get(p).add(alfa);\n }\n }\n }\n \n long[] dp0, dp;\n dp0 = new long[divA.length];\n dp0[0] = 1;\n for( long p : P.keySet() ){\n dp = dp0.clone();\n for( int alfa : P.get(p) ){\n long val = myPow(p, alfa) + 1;\n for( int ID = 0; ID < divA.length; ++ID){\n long div = divA[ID];\n if( 1e18 + 5 <= 1.0 * div * val ) continue;\n long toDiv = div * val;\n int toID = binarySearch(divA, toDiv);\n if( 0 <= toID ) dp[toID] += dp0[ID];\n }\n }\n //\n dp0 = dp;\n }\n out.println(dp0[divA.length - 1]);\n }\n \n \n}\n\n", "lang_cluster": "Java", "tags": ["dfs and similar", "math", "dp", "data structures", "number theory"], "code_uid": "734b529818e9875ed159f46c64919ba3", "src_uid": "1f68bd6f8b40e45a5bd360b03a264ef4", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.lang.Math;\nimport java.util.*;\n\npublic class Main\n{\t\n\tpublic BufferedReader in;\n\tpublic PrintStream out;\n\t\n\tpublic boolean log_enabled = false;\n\t\n\tstatic long[] primes;\n\tstatic int p_count;\n\t\n\tpublic static void get_primes(int n)\n\t{\n\t\tprimes = new long[80000];\n\t\t\n\t\tboolean[] v = new boolean[n+1];\n\t\tint i,j;\n\t\tfor (i=2; i<=n;i++)\n\t\t{\n\t\t\tv[i] = true;\n\t\t}\n\t\t\n\t\tfor (i=2; i*i<=n;i++)\n\t\t{\n\t\t\tif (v[i])\n\t\t\t{\n\t\t\t\tfor (j=i; i*j<=n; j++)\n\t\t\t\t{\n\t\t\t\t\tv[i*j]=false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tp_count = 0;\n\t\tfor (i=2; i<=n; i++)\n\t\t{\n\t\t\tif (v[i])\n\t\t\t{\t\n\t\t\t\tprimes[p_count++] = i;\n\t\t\t}\n\t\t}\n\t}\n\n\tint d_count;\n\tint[] d_index;\n\tlong A;\n\t\n\tpublic int d_index(long x)\n\t{\n\t\tif ( (x<1000000) && (x*x<=A))\n\t\t{\n\t\t\treturn d_index[(int)x];\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn d_count - d_index[(int)(A/x)] - 1;\n\t\t}\n\t}\n\n\tpublic void test()\n\t{\n\t\tA = readLong();\n\t\t\n\t\tif (A==1)\n\t\t{\n\t\t\tout.println(1);\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tget_primes(1000000);\n\t\t\n\t\t\n\t\tlong[] dividers = new long[10000];\n\t\td_count = 0;\n\t\t\n\t\td_index = new int[1000001];\n\t\t\n\t\tlong[] use_primes = new long[10000];\n\t\tint use_p_count = 0;\n\t\t\n\t\tboolean[] p_used = new boolean[1000000];\n\t\tArrays.fill(p_used, false);\n\t\t\n\t\tint i;\n\t\tlong I;\n\t\tfor (I=1; I*I<=A; I++)\n\t\t{\n\t\t\tif (A % I == 0)\n\t\t\t{\n\t\t\t\td_index[(int)I] = d_count;\n\t\t\t\tdividers[d_count++] = I;\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor (i=0; i<d_count; i++)\n\t\t{\n\t\t\tdividers[2*d_count-i-1] = A / dividers[i];\n\t\t}\n\t\t\n\t\td_count *= 2;\n\t\t\n\t\tlong d;\n\t\tint p;\n\t\tboolean is_prime;\n\t\t\n\t\tfor (i=1; i<d_count; i++)\n\t\t{\n\t\t\tis_prime = true;\n\t\t\td = dividers[i]-1;\n\t\t\t\n\t\t\tif (d==1) continue;\n\t\t\t\n\t\t\tfor ( p=0; p<p_count; p++)\n\t\t\t{\n\t\t\t\tif (primes[p]*primes[p] > d)\n\t\t\t\t{\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif (d % primes[p] == 0)\n\t\t\t\t{\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\twhile (d % primes[p] == 0)\n\t\t\t\t\t{ \n\t\t\t\t\t\td /= primes[p];\n\t\t\t\t\t}\n\t\t\t\t\tif (d==1)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (!p_used[(int)primes[p]])\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tp_used[(int)primes[p]] = true;\n\t\t\t\t\t\t\tuse_primes[use_p_count++] = primes[p];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif (is_prime)\n\t\t\t{\n\t\t\t\tif ((d > 1000000) || !p_used[(int)d])\n\t\t\t\t{\n\t\t\t\t\tif (d<1000000)\n\t\t\t\t\t{\n\t\t\t\t\t\tp_used[(int)d] = true;\n\t\t\t\t\t}\n\t\t\t\t\tuse_primes[use_p_count++] = d;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tlogWrite(\"use_p_count = %d\\n\", use_p_count);\n\t\t\n\t\tlong[] D = new long[d_count];\n\t\tlong[] D1 = new long[d_count];\n\t\t\n\t\tArrays.fill(D, 0);\n\t\tD[0] = 1;\n\t\t\n\t\tfor (p=0; p<use_p_count; p++)\n\t\t{\n\t\t\tlogWrite(\"P = %d\\n\", use_primes[p]);\n\t\t\tfor (i=1; i<d_count; i++)\n\t\t\t{\n\t\t\t\tD1[i] = D[i];\n\t\t\t\td = use_primes[p];\n\t\t\t\twhile (d<dividers[i])\n\t\t\t\t{\n\t\t\t\t\tif (dividers[i] % (d+1) == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\n\t\t\t\t\t\t//logWrite(\"D1[%d] += D[%d] = %d + %d \\n\", i, d_index(dividers[i] / (d+1)), D1[i], D[d_index(dividers[i] / (d+1))]);\n\t\t\t\t\t\n\t\t\t\t\t\tD1[i] += D[d_index(dividers[i] / (d+1))];\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\td *= use_primes[p];\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tfor (i=1; i<d_count; i++) D[i] = D1[i];\n\t\t}\n\t\t\n\t\t\n\t\tout.println(D[d_count-1]);\n\t}\n \n\tpublic void run()\n\t{\n\t\ttry\n\t\t{\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = System.out;\n\t\t\t\n\t\t\t//in = new BufferedReader(new FileReader(\"in.txt\"));\n\t\t\t//out = new PrintStream(new File(\"out.txt\"));\n\t\t\t\n\t\t\t\n\t\t}\n\t\tcatch (Exception e)\n\t\t{\n\t\t\treturn;\n\t\t}\n\t\t\n\t\t//while (true)\n\t\t{\n\t\t\t//int t = readInt(); for (int i=0; i<t; i++)\t\t\t\t\t\n\t\t\t{\n\t\t\t\ttest();\n\t\t\t}\n\t\t}\n\t}\n\t\n\tpublic static void main(String args[])\n\t{\n\t\tnew Main().run();\n\t}\n\t\n\tprivate StringTokenizer tokenizer = null;\n\t\n\tpublic int readInt() \n\t{\n return Integer.parseInt(readToken());\n }\n \n public long readLong() \n\t{\n return Long.parseLong(readToken());\n }\n \n public double readDouble() \n\t{\n return Double.parseDouble(readToken());\n }\n \n\tpublic String readLn()\n\t{\t\n\t\ttry\n\t\t{\n\t\t\tString s;\n\t\t\twhile ((s = in.readLine()).length()==0);\n\t\t\treturn s;\n\t\t}\n\t\tcatch (Exception e)\n\t\t{\n\t\t\treturn \"\";\n\t\t}\n\t}\n\t\n public String readToken() \n\t{\n\t\ttry\n\t\t{\n\t\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) \n\t\t\t{\n\t\t\t\ttokenizer = new StringTokenizer(in.readLine());\n\t\t\t}\n\t\t\treturn tokenizer.nextToken();\n\t\t}\n\t\tcatch (Exception e)\n\t\t{\n\t\t\treturn \"\";\n\t\t}\n }\n\t\n\tpublic int[] readIntArray(int n)\n\t{\n\t\tint[] x = new int[n];\n\t\treadIntArray(x, n);\n\t\treturn x;\n\t}\n\t\n\tpublic void readIntArray(int[] x, int n)\n\t{\n\t\tfor (int i=0; i<n; i++)\n\t\t{\n\t\t\tx[i] = readInt();\n\t\t}\n\t}\n\t\n\tpublic void logWrite(String format, Object... args)\n\t{\n\t\tif (!log_enabled)\n\t\t{\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tout.printf(format, args);\n\t}\n}\n\n", "lang_cluster": "Java", "tags": ["dfs and similar", "math", "dp", "data structures", "number theory"], "code_uid": "a0ed40f8436d59e9ab77acb4311f55ed", "src_uid": "1f68bd6f8b40e45a5bd360b03a264ef4", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.TreeMap;\nimport java.util.StringTokenizer;\nimport java.util.Map;\nimport java.util.Map.Entry;\nimport java.io.BufferedReader;\nimport java.util.Collections;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author @VanHanhPham_skyvn97\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskD solver = new TaskD();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskD {\n private long x;\n private ArrayList<Map.Entry<Long, ArrayList<Long>>> prime;\n private ArrayList<Long> divisors;\n private long[][] dp;\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n x = in.nextLong();\n\n divisors = NumberTheory.getDivisors(x);\n TreeMap<Long, ArrayList<Long>> potential =\n new TreeMap<Long, ArrayList<Long>>();\n for (long div : divisors) {\n TaskD.Pair pw = primeMul(div - 1);\n if (pw.fi < 0) continue;\n if (!potential.containsKey(pw.fi))\n potential.put(pw.fi, new ArrayList<Long>());\n potential.get(pw.fi).add(div);\n }\n\n prime = new ArrayList<Map.Entry<Long, ArrayList<Long>>>();\n for (Map.Entry<Long, ArrayList<Long>> entry : potential.entrySet())\n prime.add(entry);\n\n dp = new long[divisors.size()][prime.size() + 1];\n dp[0][0] = 1;\n for (int curPrime = 0; curPrime < prime.size(); curPrime++)\n for (int curDiv = 0; curDiv < divisors.size(); curDiv++)\n if (dp[curDiv][curPrime] > 0) {\n dp[curDiv][curPrime + 1] += dp[curDiv][curPrime];\n for (long mul : prime.get(curPrime).getValue()) {\n long newDivVal = Others.bigProduct(divisors.get(curDiv), mul);\n if (x % newDivVal != 0) continue;\n int newDiv = findElememt(divisors, newDivVal);\n if (newDiv >= 0) dp[newDiv][curPrime + 1] += dp[curDiv][curPrime];\n }\n }\n out.println(dp[divisors.size() - 1][prime.size()]);\n }\n\n private TaskD.Pair primeMul(long x) {\n TreeMap<Long, Integer> fact = NumberTheory.getPrimeFactors(x);\n if (fact.size() != 1) return new TaskD.Pair(-1, -1);\n long prime = fact.firstKey();\n return new TaskD.Pair(prime, fact.get(prime));\n }\n\n private int findElememt(ArrayList<Long> list, long key) {\n int L = 0;\n int R = list.size() - 1;\n while (L <= R) {\n if (R - L <= 2) {\n for (int i = L; i <= R; i++) if (list.get(i) == key) return i;\n return -1;\n }\n int M = (L + R) / 2;\n if (list.get(M) == key) return (M);\n if (list.get(M) > key) R = M - 1;\n if (list.get(M) < key) L = M + 1;\n }\n return -1;\n }\n\n static class Pair {\n long fi;\n int se;\n\n public Pair(long fi, int se) {\n this.fi = fi;\n this.se = se;\n }\n\n }\n\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String nextString() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public long nextLong() {\n return Long.parseLong(nextString());\n }\n\n }\n\n static class NumberTheory {\n public static TreeMap<Long, Integer> getPrimeFactors(long x) {\n TreeMap<Long, Integer> res = new TreeMap<Long, Integer>();\n for (int i = 2; (long) i * i <= x; i++)\n if (x % i == 0) {\n int mul = 0;\n while (x % i == 0) {\n mul++;\n x /= i;\n }\n res.put((long) i, mul);\n }\n if (x > 1) res.put(x, 1);\n return res;\n }\n\n public static ArrayList<Long> getDivisors(long x) {\n ArrayList<Long> res = new ArrayList<Long>();\n for (int i = 1; (long) i * i <= x; i++)\n if (x % i == 0) {\n res.add((long) i);\n if (x / i != i) res.add(x / i);\n }\n Collections.sort(res);\n return res;\n }\n\n }\n\n static class Others {\n public static final long longINF = (long) 1e18 + 7;\n\n public static long bigProduct(long a, long b) {\n if (a == 0 || b == 0) return (0);\n int sign = 1;\n if (a < 0) return (-bigProduct(-a, b));\n if (b < 0) return (-bigProduct(a, -b));\n return (longINF / a < b ? longINF : a * b);\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["dfs and similar", "math", "dp", "data structures", "number theory"], "code_uid": "323fd02c7dcd5aa5c662f525f560ce7c", "src_uid": "1f68bd6f8b40e45a5bd360b03a264ef4", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// 10 monthes remaining for red =D\nimport java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n\npublic class D {\n\n\tFastScanner in;\n\tPrintWriter out;\n\n\tint[] primes;\n\tboolean[] isPrime;\n\tint MAX = 1_000_000;\n\n\tvoid prepare() {\n\t\tisPrime = new boolean[MAX];\n\t\tArrays.fill(isPrime, true);\n\t\tisPrime[0] = isPrime[1] = false;\n\t\tint cnt = 0;\n\t\tfor (int i = 2; i < MAX; i++) {\n\t\t\tif (isPrime[i]) {\n\t\t\t\tcnt++;\n\t\t\t\tfor (int j = 2 * i; j < MAX; j += i) {\n\t\t\t\t\tisPrime[j] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprimes = new int[cnt];\n\t\tcnt = 0;\n\t\tfor (int i = 2; i < MAX; i++) {\n\t\t\tif (isPrime[i]) {\n\t\t\t\tprimes[cnt++] = i;\n\t\t\t}\n\t\t}\n\t}\n\n\tint ans = 0;\n\n\tboolean isPrime(long a) {\n\t\tif (a < MAX) {\n\t\t\treturn isPrime[(int) a];\n\t\t}\n\t\treturn BigInteger.valueOf(a).isProbablePrime(10);\n\t}\n\n\tvoid go(long cur, int lastPrime) {\n\n\t\tif (cur == 1) {\n\t\t\tans++;\n\t\t\treturn;\n\t\t}\n\t\tfor (int pr = lastPrime + 1; pr < primes.length; pr++) {\n\t\t\tlong p = primes[pr];\n\t\t\tif (p * p + 1 > cur) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\twhile (p + 1 <= cur) {\n\t\t\t\tif (cur % (p + 1) == 0) {\n\t\t\t\t\tgo(cur / (p + 1), pr);\n\t\t\t\t}\n\t\t\t\tp *= primes[pr];\n\t\t\t}\n\t\t}\n\n\t\tif (isPrime(cur - 1) && (cur - 1 >= primes[lastPrime + 1])) {\n\t\t\tans++;\n\t\t}\n\t}\n\n\tvoid solve() {\n\t\tlong a = in.nextLong();\n//\t\tlong time = System.currentTimeMillis();\n\t\tprepare();\n\t\tgo(a, -1);\n\t\tout.println(ans);\n//\t\tout.println(System.currentTimeMillis()- time);\n\t}\n\n\tvoid run() {\n\t\tin = new FastScanner();\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.close();\n\t}\n\n\tclass FastScanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tpublic FastScanner() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tpublic FastScanner(String s) {\n\t\t\ttry {\n\t\t\t\tbr = new BufferedReader(new FileReader(s));\n\t\t\t} catch (FileNotFoundException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\n\t\tString nextToken() {\n\t\t\twhile (st == null || !st.hasMoreElements()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(nextToken());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(nextToken());\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(nextToken());\n\t\t}\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew D().run();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "math", "dp", "data structures", "number theory"], "code_uid": "f4455a67da5adee1c3c0c9058e33d467", "src_uid": "1f68bd6f8b40e45a5bd360b03a264ef4", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.IOException;\nimport java.io.PrintWriter;\nimport java.math.BigInteger;\nimport java.util.*;\n\npublic class D {\n\n\n private static final int MAXSQA = 1000000;\n\n static void solve() throws IOException {\n long a = in.nextLong();\n ArrayList< Long > d = new ArrayList<>();\n for ( long i = 1; i * i <= a; i ++ ) {\n if ( a % i == 0 ) {\n d.add( i );\n if ( i * i != a ) {\n d.add( a / i );\n }\n }\n }\n boolean[] prime = new boolean[MAXSQA];\n Arrays.fill(prime, true);\n prime[0] = false;\n prime[1] = false;\n for ( int i = 2; i < prime.length; i ++ ) {\n if ( ! prime[i] ) {\n continue;\n }\n for ( int j = i * 2; j < prime.length; j += i ) {\n prime[j] = false;\n }\n }\n HashMap< Long, ArrayList< Long > > good = new HashMap<>();\n for ( long x : d ) {\n long t = x - 1;\n for ( int i = 1; ; i ++ ) {\n long p = ( long ) Math.round( Math.pow( t, 1.0 / i ) );\n if ( p < 2 || ( p == 2 && Math.pow( 2, i ) > t ) ) {\n break;\n }\n if ( Math.round( Math.pow( p, i ) ) != t ) {\n continue;\n }\n if ( ( p < prime.length && prime[((int) p)] ) || ( p >= prime.length && BigInteger.valueOf( p ).isProbablePrime( 100 ) ) ) {\n if ( !good.containsKey( p ) ) {\n good.put(p, new ArrayList<Long>());\n }\n good.get( p ).add(x);\n break;\n }\n }\n }\n TreeMap< Long, Long > ways = new TreeMap<>();\n ways.put( a, 1l );\n for ( ArrayList<Long> divL : good.values() ) {\n TreeMap<Long, Long> w = new TreeMap<>( ways );\n for (Long key : ways.descendingKeySet()) {\n for ( Long div : divL ) {\n if (key % div != 0) {\n continue;\n }\n long key1 = key / div;\n Long v = w.get(key1);\n if (v == null) {\n w.put(key1, ways.get(key));\n } else {\n w.put(key1, v + ways.get(key));\n }\n }\n }\n ways = w;\n }\n\n /*while ( true ) {\n Map.Entry<Long, Long> entry = ways.lastEntry();\n Long key = entry.getKey();\n if ( key.equals( 1l ) ) {\n break;\n }\n for (Long div : good) {\n if ( key % div != 0 ) {\n continue;\n }\n long key1 = key / div;\n Long v = ways.get(key1);\n if ( v == null ) {\n ways.put( key1, entry.getValue() );\n } else {\n ways.put( key1, v + entry.getValue() );\n }\n }\n ways.remove( key );\n }*/\n Long ans = ways.get( 1l );\n if ( ans == null ) {\n ans = 0l;\n }\n out.println( ans );\n }\n\n static Scanner in;\n// static StreamTokenizer in;\n static PrintWriter out;\n\n// static int nextInt() throws IOException {\n// in.nextToken();\n// return ( int ) in.nval;\n// }\n\n public static void main( String[] args ) throws IOException {\n in = new Scanner( System.in );\n// in = new StreamTokenizer( new InputStreamReader( System.in ) );\n out = new PrintWriter( System.out );\n solve();\n out.close();\n }\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "math", "dp", "data structures", "number theory"], "code_uid": "5cb2c80c8352b9b9d1e719b1ab72918f", "src_uid": "1f68bd6f8b40e45a5bd360b03a264ef4", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//import java.awt.Dimension;\nimport java.awt.Point;\nimport java.io.*;\nimport static java.lang.Math.*;\nimport java.math.BigDecimal;\nimport java.math.BigInteger;\nimport static java.math.BigInteger.*;\nimport java.util.*;\nimport static java.util.Arrays.*;\n//import java.math.BigInteger;\n//import static java.lang.Character.*;\n//import static java.lang.Math.*;\n//import static java.math.BigInteger.*;\n\n//import static java.util.Arrays.*;\n\n//import java.awt.Point; // interger !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n//import java.awt.Polygon;\n//import java.awt.Rectangle;\n//import java.awt.geom.AffineTransform;\n//import java.awt.geom.Line2D;\n//import java.awt.geom.Point2D;\n//import javafx.scene.shape.Line;\n//import javafx.scene.transform.Rotate;\n\n//<editor-fold defaultstate=\"collapsed\" desc=\"Main\">\npublic class Main implements Runnable{\n\n // https://netbeans.org/kb/73/java/editor-codereference_ru.html#display\n\n static boolean oj;\n \n @Override\n public void run(){\n try {\n Locale.setDefault(Locale.US);\n } catch (Exception e) {\n }\n oj = true;\n try {\n oj = System.getProperty(\"MYLOCAL\") == null;\n } catch (Exception e) {\n }\n//\n if (oj) {\n sc = new FastScanner(new InputStreamReader(System.in));\n out = new PrintWriter(new OutputStreamWriter(System.out));\n } else {\n try {\n sc = new FastScanner(new FileReader(\"input.txt\"));\n out = new PrintWriter(new FileWriter(\"output.txt\"));\n } catch (IOException e) {\n MLE();\n }\n }\n Solver s = new Solver();\n s.sc = sc;\n s.out = out;\n\n s.solve();\n if (!oj) {\n err.println(\"Time: \" + (System.currentTimeMillis() - timeBegin) / 1e3);\n err.printf(\"Mem: %d\\n\", (Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory()) >> 20);\n }\n out.flush();\n }\n\n private void show(int[] arr) {\n for (int v : arr) {\n err.print(\" \" + v);\n }\n err.println();\n }\n\n public static void exit() {\n err.println(\"Time: \" + (System.currentTimeMillis() - timeBegin) / 1e3);\n err.printf(\"Mem: %d\\n\", (Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory()) >> 20);\n out.flush();\n out.close();\n System.exit(0);\n }\n\n public static void MLE() {\n int[][] arr = new int[1024 * 1024][];\n for (int i = 0; i < arr.length; i++) {\n arr[i] = new int[1024 * 1024];\n }\n }\n\n public static void main(String[] args) throws FileNotFoundException {\n //new Main().run();\n new Thread(null, new Main(), \"myThread\", 100 * 1024 * 1024).start();\n }\n\n static long timeBegin = System.currentTimeMillis();\n static FastScanner sc;\n static PrintWriter out;\n static PrintStream err = System.err;\n}\n //</editor-fold>\n\n//<editor-fold defaultstate=\"collapsed\" desc=\"FastScanner\">\nclass FastScanner {\n\n BufferedReader br;\n StringTokenizer st;\n\n FastScanner(InputStreamReader reader) {\n br = new BufferedReader(reader);\n st = new StringTokenizer(\"\");\n }\n\n String next() {\n while (!st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (Exception ex) {\n return null;\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String nextLine() {\n try {\n return br.readLine();\n } catch (IOException ex) {\n return null;\n }\n }\n}\n//</editor-fold>\n\nclass Solver {\n\n void aser(boolean OK) {\n if (!OK) {\n Main.MLE();\n }\n }\n\n FastScanner sc;\n PrintWriter out;\n static PrintStream err = System.err;\n \n long[] getAllDiv(long A){\n TreeSet<Long> arr = new TreeSet<>();\n for( long d = 1; d*d <= A; ++d ){\n if( A % d == 0 ) {\n arr.add(d);\n arr.add(A/d);\n }\n }\n int pos = 0;\n long[] a = new long[arr.size()];\n for (long x : arr) a[pos++] = x;\n return a;\n }\n \n long myPow(long p, int alfa){\n long ans = 1;\n for (int i = 0; i < alfa; i++) {\n ans *= p;\n }\n return ans;\n }\n \n void solve(){\n final long A = sc.nextLong();\n long[] divA = getAllDiv(A);\n TreeMap<Long,TreeSet<Integer>> P = new TreeMap<>();\n for (long div : divA) {\n --div;\n for (int alfa = 1; alfa <= 60; alfa++) {\n long p = (long)( pow( div, 1.0 / alfa ) + 0.5 );\n if( 2<=p && myPow(p,alfa)==div && \n valueOf(p).isProbablePrime(Integer.MAX_VALUE) ){\n if( !P.containsKey(p) )\n P.put(p, new TreeSet<>());\n P.get(p).add(alfa);\n \n }\n }\n }\n \n long[] dp0, dp;\n dp0 = new long[divA.length];\n dp0[0] = 1;\n for( long p : P.keySet() ){\n dp = dp0.clone();\n for( int alfa : P.get(p) ){\n long val = myPow(p, alfa) + 1;\n for( int ID = 0; ID < divA.length; ++ID){\n long div = divA[ID];\n if( 1e12 + 5 <= 1.0 * div * val ) break;\n long toDiv = div * val;\n int toID = binarySearch(divA, toDiv);\n if( 0 <= toID ) dp[toID] += dp0[ID];\n }\n }\n //\n dp0 = dp;\n }\n out.println(dp0[divA.length - 1]);\n }\n \n \n}\n\n", "lang_cluster": "Java", "tags": ["dfs and similar", "math", "dp", "data structures", "number theory"], "code_uid": "2a93430f1d104f3795b3502e94664dab", "src_uid": "1f68bd6f8b40e45a5bd360b03a264ef4", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.awt.Point;\nimport java.math.BigDecimal;\nimport java.math.BigInteger;\n\nimport static java.lang.Math.*;\n\n// Solution is at the bottom of code\n\npublic class D implements Runnable{\n\t\n\tfinal boolean ONLINE_JUDGE = System.getProperty(\"ONLINE_JUDGE\") != null;\n\t\n\tBufferedReader in;\n\tOutputWriter out;\n\tStringTokenizer tok = new StringTokenizer(\"\");\n\t\n\tpublic static void main(String[] args){\n\t\tnew Thread(null, new D(), \"\", 128 * (1L << 20)).start();\n\t}\n\t\n\t/////////////////////////////////////////////////////////////////////\n\t\n\tvoid init() throws FileNotFoundException{\n\t\tLocale.setDefault(Locale.US);\n\t\t\n\t\tif (ONLINE_JUDGE){\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new OutputWriter(System.out);\n\t\t}else{\n\t\t\tin = new BufferedReader(new FileReader(\"input.txt\"));\n\t\t\tout = new OutputWriter(\"output.txt\");\n\t\t}\n\t}\n\t\n\t////////////////////////////////////////////////////////////////\n\t\n\tlong timeBegin, timeEnd;\n\n\tvoid time(){\n\t\ttimeEnd = System.currentTimeMillis();\n\t\tSystem.err.println(\"Time = \" + (timeEnd - timeBegin));\n\t}\n\t\n\tvoid debug(Object... objects){\n\t\tif (ONLINE_JUDGE){\n\t\t\tfor (Object o: objects){\n\t\t\t\tSystem.err.println(o.toString());\n\t\t\t}\n\t\t}\n\t}\n\t\n\t/////////////////////////////////////////////////////////////////////\n\t\n\tpublic void run(){\n\t\ttry{\n\t\t\ttimeBegin = System.currentTimeMillis();\n\t\t\tLocale.setDefault(Locale.US);\n\t\t\t\n\t\t\tinit();\n\t\t\tsolve();\n\t\t\t\n\t\t\tout.close();\n\t\t\ttime();\n\t\t}catch (Exception e){\n\t\t\te.printStackTrace(System.err);\n\t\t\tSystem.exit(-1);\n\t\t}\n\t}\n\t\n\t/////////////////////////////////////////////////////////////////////\n\t\n\tString delim = \" \";\n\t\n\tString readString() throws IOException{\n\t\twhile(!tok.hasMoreTokens()){\n\t\t\ttry{\n\t\t\t\ttok = new StringTokenizer(in.readLine());\n\t\t\t}catch (Exception e){\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn tok.nextToken(delim);\n\t}\n\t\n\tString readLine() throws IOException{\n\t\treturn in.readLine();\n\t}\n\t\n\t/////////////////////////////////////////////////////////////////\n\t\n\tfinal char NOT_A_SYMBOL = '\\0';\n\t\n\tchar readChar() throws IOException{\n\t\tint intValue = in.read();\n\t\t\n\t\tif (intValue == -1){\n\t\t\treturn NOT_A_SYMBOL;\n\t\t}\n\t\t\n\t\treturn (char) intValue;\n\t}\n\t\n\tchar[] readCharArray() throws IOException{\n\t\treturn readLine().toCharArray();\n\t}\n\t\n\t/////////////////////////////////////////////////////////////////\n\t\n\tint readInt() throws IOException {\n\t\treturn Integer.parseInt(readString());\n\t}\n\t\n\tint[] readIntArray(int size) throws IOException {\n\t\tint[] array = new int[size];\n\t\t\n\t\tfor (int index = 0; index < size; ++index){\n\t\t\tarray[index] = readInt();\n\t\t}\n\t\t\n\t\treturn array;\n\t}\n\t\n\tint[] readSortedIntArray(int size) throws IOException {\n\t\tInteger[] array = new Integer[size];\n\t\t\n\t\tfor (int index = 0; index < size; ++index) {\n\t\t\tarray[index] = readInt();\n\t\t}\n\t\tArrays.sort(array);\n\t\t\n\t\tint[] sortedArray = new int[size];\n\t\tfor (int index = 0; index < size; ++index) {\n\t\t\tsortedArray[index] = array[index];\n\t\t}\n\t\t\n\t\treturn sortedArray;\n\t}\n\t\n\tint[] readIntArrayWithDecrease(int size) throws IOException {\n\t\tint[] array = readIntArray(size);\n\t\t\n\t\tfor (int i = 0; i < size; ++i) {\n\t\t\tarray[i]--;\n\t\t}\n\t\t\n\t\treturn array;\n\t}\n\t\n\t///////////////////////////////////////////////////////////////////\n\t\n\tint[][] readIntMatrix(int rowsCount, int columnsCount) throws IOException {\n\t\tint[][] matrix = new int[rowsCount][];\n\t\t\n\t\tfor (int rowIndex = 0; rowIndex < rowsCount; ++rowIndex) {\n\t\t\tmatrix[rowIndex] = readIntArray(columnsCount);\n\t\t}\n\t\t\n\t\treturn matrix;\n\t}\n\t\n\tint[][] readIntMatrixWithDecrease(int rowsCount, int columnsCount) throws IOException {\n\t\tint[][] matrix = new int[rowsCount][];\n\t\t\n\t\tfor (int rowIndex = 0; rowIndex < rowsCount; ++rowIndex) {\n\t\t\tmatrix[rowIndex] = readIntArrayWithDecrease(columnsCount);\n\t\t}\n\t\t\n\t\treturn matrix;\n\t}\n\t\n\t///////////////////////////////////////////////////////////////////\n\t\n\tlong readLong() throws IOException{\n\t\treturn Long.parseLong(readString());\n\t}\n\t\n\tlong[] readLongArray(int size) throws IOException{\n\t\tlong[] array = new long[size];\n\t\t\n\t\tfor (int index = 0; index < size; ++index){\n\t\t\tarray[index] = readLong();\n\t\t}\n\t\t\n\t\treturn array;\n\t}\n\t\n\t////////////////////////////////////////////////////////////////////\n\t\n\tdouble readDouble() throws IOException{\n\t\treturn Double.parseDouble(readString());\n\t}\n\t\n\tdouble[] readDoubleArray(int size) throws IOException{\n\t\tdouble[] array = new double[size];\n\t\t\n\t\tfor (int index = 0; index < size; ++index){\n\t\t\tarray[index] = readDouble();\n\t\t}\n\t\t\n\t\treturn array;\n\t}\n\t\n\t////////////////////////////////////////////////////////////////////\n\t\t\n\tBigInteger readBigInteger() throws IOException {\n\t\treturn new BigInteger(readString());\n\t}\n\t\n\tBigDecimal readBigDecimal() throws IOException {\n\t\treturn new BigDecimal(readString());\n\t}\n\t\n\t/////////////////////////////////////////////////////////////////////\n\t\n\tPoint readPoint() throws IOException{\n\t\tint x = readInt();\n\t\tint y = readInt();\n\t\treturn new Point(x, y);\n\t}\n\t\n\tPoint[] readPointArray(int size) throws IOException{\n\t\tPoint[] array = new Point[size];\n\t\t\n\t\tfor (int index = 0; index < size; ++index){\n\t\t\tarray[index] = readPoint();\n\t\t}\n\t\t\n\t\treturn array;\n\t}\n\t\n\t/////////////////////////////////////////////////////////////////////\n\t\n\tList<Integer>[] readGraph(int vertexNumber, int edgeNumber)\n\tthrows IOException{\n\t\t@SuppressWarnings(\"unchecked\")\n\t\tList<Integer>[] graph = new List[vertexNumber];\n\t\t\n\t\tfor (int index = 0; index < vertexNumber; ++index){\n\t\t\tgraph[index] = new ArrayList<Integer>();\n\t\t}\n\t\t\n\t\twhile (edgeNumber-- > 0){\n\t\t\tint from = readInt() - 1;\n\t\t\tint to = readInt() - 1;\n\t\t\t\n\t\t\tgraph[from].add(to);\n\t\t\tgraph[to].add(from);\n\t\t}\n\t\t\n\t\treturn graph;\n\t}\n\t\n\t/////////////////////////////////////////////////////////////////////\n\t\n\tstatic class IntIndexPair {\n\t\t\n\t\tstatic Comparator<IntIndexPair> increaseComparator = new Comparator<IntIndexPair>() {\n\t\t\t\n\t\t\t@Override\n\t\t\tpublic int compare(IntIndexPair indexPair1, IntIndexPair indexPair2) {\n\t\t\t\tint value1 = indexPair1.value;\n\t\t\t\tint value2 = indexPair2.value;\n\t\t\t\t\n\t\t\t\tif (value1 != value2) return value1 - value2;\n\t\t\t\t\n\t\t\t\tint index1 = indexPair1.index;\n\t\t\t\tint index2 = indexPair2.index;\n\t\t\t\t\n\t\t\t\treturn index1 - index2;\n\t\t\t}\n\t\t};\n\t\t\n\t\tstatic Comparator<IntIndexPair> decreaseComparator = new Comparator<IntIndexPair>() {\n\t\t\t\n\t\t\t@Override\n\t\t\tpublic int compare(IntIndexPair indexPair1, IntIndexPair indexPair2) {\n\t\t\t\tint value1 = indexPair1.value;\n\t\t\t\tint value2 = indexPair2.value;\n\t\t\t\t\n\t\t\t\tif (value1 != value2) return -(value1 - value2);\n\t\t\t\t\n\t\t\t\tint index1 = indexPair1.index;\n\t\t\t\tint index2 = indexPair2.index;\n\t\t\t\t\n\t\t\t\treturn index1 - index2;\n\t\t\t}\n\t\t};\n\t\t\n\t\tint value, index;\n\n\t\tpublic IntIndexPair(int value, int index) {\n\t\t\tsuper();\n\t\t\tthis.value = value;\n\t\t\tthis.index = index;\n\t\t}\t\t\n\t\t\n\t\tpublic int getRealIndex() {\n\t\t\treturn index + 1;\n\t\t}\n\t}\n\t\n\tIntIndexPair[] readIntIndexArray(int size) throws IOException {\n\t\tIntIndexPair[] array = new IntIndexPair[size];\n\t\t\n\t\tfor (int index = 0; index < size; ++index) {\n\t\t\tarray[index] = new IntIndexPair(readInt(), index);\n\t\t}\n\t\t\n\t\treturn array;\n\t}\n\t\n\t/////////////////////////////////////////////////////////////////////\n\t\n\tstatic class OutputWriter extends PrintWriter {\n\n\t\tfinal int DEFAULT_PRECISION = 12;\n\t\t\n\t\tprotected int precision;\n\t\tprotected String format, formatWithSpace;\n\t\t\n\t\t{\n\t\t\tprecision = DEFAULT_PRECISION;\n\t\t\t\n\t\t\tformat = createFormat(precision);\n\t\t\tformatWithSpace = format + \" \";\n\t\t}\n\t\t\n\t\tpublic OutputWriter(OutputStream out) {\n\t\t\tsuper(out);\n\t\t}\n\n\t\tpublic OutputWriter(String fileName) throws FileNotFoundException {\n\t\t\tsuper(fileName);\n\t\t}\n\t\t\n\t\tpublic int getPrecision() {\n\t\t\treturn precision;\n\t\t}\n\n\t\tpublic void setPrecision(int precision) {\n\t\t\tprecision = max(0, precision);\n\t\t\tthis.precision = precision;\n\t\t\t\n\t\t\tformat = createFormat(precision);\n\t\t\tformatWithSpace = format + \" \";\n\t\t}\n\t\t\n\t\tprivate String createFormat(int precision){\n\t\t\treturn \"%.\" + precision + \"f\";\n\t\t}\n\t\t\n\t\t@Override\n\t\tpublic void print(double d){\n\t\t\tprintf(format, d);\n\t\t}\n\t\t\n\t\tpublic void printWithSpace(double d){\n\t\t\tprintf(formatWithSpace, d);\n\t\t}\n\n\t\tpublic void printAll(double...d){\n\t\t\tfor (int i = 0; i < d.length - 1; ++i){\n\t\t\t\tprintWithSpace(d[i]);\n\t\t\t}\n\t\t\t\n\t\t\tprint(d[d.length - 1]);\n\t\t}\n\t\t\n\t\t@Override\n\t\tpublic void println(double d){\n\t\t\tprintlnAll(d);\n\t\t}\n\t\t\n\t\tpublic void printlnAll(double... d){\n\t\t\tprintAll(d);\n\t\t\tprintln();\n\t\t}\n\t}\n\t\n\t/////////////////////////////////////////////////////////////////////\n\t\n\tstatic final int[][] steps = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}}; \n\tstatic final int[][] steps8 = {\n\t\t\t{-1, 0}, {1, 0}, {0, -1}, {0, 1},\n\t\t\t{-1, -1}, {1, 1}, {1, -1}, {-1, 1}\n\t};\n\t\n\tstatic final boolean check(int index, int lim){\n\t\treturn (0 <= index && index < lim);\n\t}\n\t\n\t/////////////////////////////////////////////////////////////////////\n\t\n\tstatic final boolean checkBit(int mask, int bit){\n\t\treturn (mask & (1 << bit)) != 0;\n\t}\n\t\n\t/////////////////////////////////////////////////////////////////////\n\t\n\tstatic final long getSum(int[] array) {\n\t\tlong sum = 0;\n\t\tfor (int value: array) {\n\t\t\tsum += value;\n\t\t}\n\t\t\n\t\treturn sum;\n\t}\n\t\n\tstatic final Point getMinMax(int[] array) {\n\t\tint min = array[0];\n\t\tint max = array[0];\n\t\t\n\t\tfor (int index = 0, size = array.length; index < size; ++index, ++index) {\n\t\t\tint value = array[index];\n\t\t\t\n\t\t\tif (index == size - 1) {\n\t\t\t\tmin = min(min, value);\n\t\t\t\tmax = max(max, value);\n\t\t\t} else {\n\t\t\t\tint otherValue = array[index + 1];\n\t\t\t\t\n\t\t\t\tif (value <= otherValue) {\n\t\t\t\t\tmin = min(min, value);\n\t\t\t\t\tmax = max(max, otherValue);\n\t\t\t\t} else {\n\t\t\t\t\tmin = min(min, otherValue);\n\t\t\t\t\tmax = max(max, value);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn new Point(min, max);\n\t}\n\t\n\t/////////////////////////////////////////////////////////////////////\n\t\n\tvoid solve() throws IOException {\n\t\tlong sum = readLong();\n\t\t\n\t\tList<Long> divisors = new ArrayList<Long>();\n\t\tfor (long d = 1; d <= sum / d; ++d) {\n\t\t\tif (sum % d == 0) {\n\t\t\t\tdivisors.add(d);\n\t\t\t\tif (sum / d != d) {\n\t\t\t\t\tdivisors.add(sum / d);\n\t\t\t\t}\n\t\t\t}\n\t\t} \n\t\t\n\t\tMap<Long, Integer> indexes = new HashMap<Long, Integer>();\n\t\tfor (int i = 0; i < divisors.size(); ++i) {\n\t\t\tlong d = divisors.get(i);\n\t\t\tindexes.put(d, i);\n\t\t}\n\t\t\n\t\tMap<Long, List<Integer>> classes = new HashMap<Long, List<Integer>>();\n\t\tfor (int i = 0; i < divisors.size(); ++i) {\n\t\t\tlong d = divisors.get(i) - 1;\n\t\t\t\n\t\t\tboolean found = false;\n\t\t\tfor (long prime = 2; prime <= d / prime; ++prime) {\n\t\t\t\tif (d % prime == 0) {\n\t\t\t\t\tlong x = d;\n\t\t\t\t\twhile (x % prime == 0) {\n\t\t\t\t\t\tx /= prime;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tif (x == 1) {\n\t\t\t\t\t\tadd(classes, prime, i);\n\t\t\t\t\t\tfound = true;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif (!found) {\n\t\t\t\tboolean isPrime = (d > 1);\n\t\t\t\tfor (long dd = 2; dd <= d / dd; ++dd) {\n\t\t\t\t\tif (d % dd == 0) {\n\t\t\t\t\t\tisPrime = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif (isPrime) {\n\t\t\t\t\tadd(classes, d, i);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tint divisorsCount = divisors.size();\n\t\tint classesCount = classes.size();\n\t\t\n\t\tlong[] curDp = new long[divisorsCount];\n\t\tlong[] nextDp = new long[divisorsCount];\n\t\t\n\t\tcurDp[indexes.get(1L)] = 1;\n\t\t\n\t\tfor (Map.Entry<Long, List<Integer>> e : classes.entrySet()) {\n\t\t\tList<Integer> classIndexes = e.getValue();\n\t\t\t\n\t\t\tfor (int i = 0; i < divisorsCount; ++i) {\n\t\t\t\tlong d = divisors.get(i);\n\t\t\t\tif (curDp[i] == 0) continue;\n\t\t\t\t\n\t\t\t\tfor (int classIndex : classIndexes) {\n\t\t\t\t\tlong classD = divisors.get(classIndex);\n\t\t\t\t\t\n\t\t\t\t\tif (sum / classD >= d) {\n\t\t\t\t\t\tlong nextD = d * classD;\n\t\t\t\t\t\t\n\t\t\t\t\t\tif (sum % nextD == 0) {\n\t\t\t\t\t\t\tint nextI = indexes.get(nextD);\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tnextDp[nextI] += curDp[i];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tfor (int i = 0; i < divisorsCount; ++i) {\n\t\t\t\tcurDp[i] += nextDp[i];\n\t\t\t\tnextDp[i] = 0;\n\t\t\t}\n\t\t}\n\t\t\n\t\tout.println(curDp[indexes.get(sum)]);\n\t}\n\t\n\tvoid add(Map<Long, List<Integer>> classes, long key, int value) {\n\t\tList<Integer> keyClass = classes.get(key);\n\t\tif (keyClass == null) {\n\t\t\tclasses.put(key, keyClass = new ArrayList<Integer>());\n\t\t}\n\t\t\n\t\tkeyClass.add(value);\n\t}\n}\n\n", "lang_cluster": "Java", "tags": ["dfs and similar", "math", "dp", "data structures", "number theory"], "code_uid": "a487132a71395e3300181b03c978680d", "src_uid": "1f68bd6f8b40e45a5bd360b03a264ef4", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.lang.*;\nimport java.math.*;\npublic class Main {\n public static void main(String[] args) throws Exception {\n BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));\n // Scanner scan = new Scanner(System.in);\n // PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out)); \n long A = Long.parseLong(bf.readLine());\n Map<Long, HashSet<Integer>> m = new HashMap<Long, HashSet<Integer>>();\n Map<Long, Long> div = new HashMap<Long, Long>();\n ArrayList<Long> divisors = new ArrayList<Long>();\n long sqrt = (long)Math.sqrt(A);\n\n for(int i=1; i<=sqrt; i++) {\n if(A % i == 0) {\n divisors.add(i+0L);\n if(1L*i*i != A) divisors.add(A/i);\n }\n }\n Collections.sort(divisors);\n\n hi: for(long i : divisors) {\n //System.out.println(i);\n boolean done = false;\n sqrt = (long)Math.sqrt(i-1);\n for(long j=2; j<=sqrt; j++) {\n if((i-1) % j == 0) {\n long val = i-1;\n double t = Math.log(val)/Math.log(j);\n if(Math.abs(t - Math.round(t)) > 0.00001) continue hi;\n int count = (int)Math.round(t);\n HashSet<Integer> set = m.get(j);\n if(set == null) {\n set = new HashSet<Integer>();\n m.put(j, set);\n }\n set.add(count);\n div.put(i, j);\n done = true;\n break;\n }\n }\n if(!done && i != 1 && i != 2 ) {\n HashSet<Integer> set = m.get(i - 1);\n if(set == null) {\n set = new HashSet<Integer>();\n m.put(i - 1, set);\n }\n set.add(1);\n div.put(i, i-1);\n }\n }\n\n //\n ArrayList<Long> P = new ArrayList<Long>();\n for(long l : m.keySet()) P.add(l);\n Collections.sort(P);\n int[] dp = new int[divisors.size()];\n Map<Long, Integer> divis = new HashMap<Long, Integer>();\n for(int i=0; i<divisors.size(); i++) divis.put(divisors.get(i), i);\n dp[0] = 1;\n long start = System.currentTimeMillis();\n long divv, pp, val;\n ArrayList<ArrayList<Long>> temp = new ArrayList<>();\n for(int i = 1; i <= P.size(); i++) {\n ArrayList<Long> list = new ArrayList<Long>();\n temp.add(list);\n pp = P.get(i - 1);\n for(int k : m.get(pp)) {\n val = (long)(Math.pow(pp, k) + 1);\n list.add(val);\n\n }\n }\n for(int i=1; i<=P.size(); ++i) {\n for(int j=divisors.size()-1; j>=0; --j) {\n divv = divisors.get(j);\n pp = P.get(i - 1);\n int iter = 0;\n ArrayList<Long> tempp = temp.get(i - 1);\n for(int k : m.get(pp)) {\n val = tempp.get(iter++);\n if(divv % val == 0)\n dp[j] += dp[divis.get(divv/val)];\n }\n }\n }\n System.out.println(dp[divisors.size() - 1]);\n // System.out.println(P);\n // StringTokenizer st = new StringTokenizer(bf.readLine());\n // int[] a = new int[n]; for(int i=0; i<n; i++) a[i] = Long.parseInt(st.nextToken());\n // int n = Long.parseInt(st.nextToken());\n // int n = scan.nextInt();\n\n // out.close(); System.exit(0);\n }\n}", "lang_cluster": "Java", "tags": ["dfs and similar", "math", "dp", "data structures", "number theory"], "code_uid": "8c6b3c775778781c5cb032706a65b87d", "src_uid": "1f68bd6f8b40e45a5bd360b03a264ef4", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\t\n\tInput in;\n\tPrintWriter out;\n\t\n\tfinal static int INF = (int) 1e9;\n\tfinal static int MOD = (int) 1e9 + 7;\n\tfinal static long LINF = (long) 1e18;\n\tfinal static double PI = (double) Math.acos(-1.0);\n\tfinal static double EPS = (double) 1e-9;\n\t\n\tvoid solve() {\n\t\tlong x = in.nextLong();\n\t\tlong ans = 0;\n\t\tfor (int k = 0; k <= 50; k++) {\n\t\t\tfor (int l = 0; l <= 50; l++) {\n\t\t\t\tlong m = (1L << (k + 1)) + (1L << (l + 1)) - 3;\n\t\t\t\tlong y = x - (1L << l) + 1;\n\t\t\t\tif (y < m) continue;\n\t\t\t\tfor (int tot = 0; tot <= k + l; tot++) {\n\t\t\t\t\tlong tmp = (y + tot) % m;\n\t\t\t\t\tif (tmp > (1L << k) + (1L << l) - 2) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tint[] digit = new int[50];\n\t\t\t\t\tint cnt = 0;\n\t\t\t\t\twhile (tmp > 0) {\n\t\t\t\t\t\tdigit[cnt++] = (int) (tmp % 2);\n\t\t\t\t\t\ttmp >>= 1;\n\t\t\t\t\t}\n\t\t\t\t\tif (tot > 2 * cnt) continue;\n\t\t\t\t\tlong[] dp = new long[(cnt + 1) * (2 * cnt + 1) * 2];\n\t\t\t\t\tint A = (2 * cnt + 1) * 2;\n\t\t\t\t\tint B = 2;\n\t\t\t\t\tdp[0 * A + 0 * B + 0] = 1;\n\t\t\t\t\tfor (int pos = 0; pos < cnt; pos++) {\n\t\t\t\t\t\tfor (int sum = 0; sum <= tot; sum++) {\n\t\t\t\t\t\t\tfor (int car = 0; car < 2; car++) if (dp[pos * A + sum * B + car] != 0) {\n\t\t\t\t\t\t\t\tint lox = 0, hix = 1;\n\t\t\t\t\t\t\t\tint loy = 0, hiy = 1;\n\t\t\t\t\t\t\t\tif (pos >= k || pos == 0) hix = 0;\n\t\t\t\t\t\t\t\tif (pos >= l || pos == 0) hiy = 0;\n\t\t\t\t\t\t\t\tfor (int i = lox; i <= hix; i++) {\n\t\t\t\t\t\t\t\t\tfor (int j = loy; j <= hiy; j++) {\n\t\t\t\t\t\t\t\t\t\tint u = i + j + car;\n\t\t\t\t\t\t\t\t\t\tif (u % 2 == digit[pos]) {\n\t\t\t\t\t\t\t\t\t\t\tdp[(pos + 1) * A + (sum + i + j) * B + u / 2] += dp[pos * A + sum * B + car];\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tans += dp[cnt * A + tot * B + 0];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tout.println(ans);\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\t(new Main()).run();\n\t}\n\t\n\tpublic void run() {\n\t\tin = new Input();\n\t\ttry {\n\t\t\tout = new PrintWriter(System.out);\n\t\t\t//out = new PrintWriter(new FileWriter(\"a.out\"));\n\t\t}\n\t\tcatch (Exception ex) {\n\t\t}\n\t\tlong stime = System.currentTimeMillis();\n\t\tsolve();\n\t\tif (System.getProperty(\"ONLINE_JUDGE\") == null) {\n\t\t\tout.println(\"\\nTime elapsed: \" + (System.currentTimeMillis() - stime) + \"ms\");\n\t\t}\n\t\tout.close();\n\t}\n\t\n\tpublic class Input {\n\t\tStringTokenizer token = null;\n\t\tBufferedReader in;\n\t\tpublic Input() {\n\t\t\ttry {\n\t\t\t\tif (System.getProperty(\"ONLINE_JUDGE\") == null) {\n\t\t\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\t\t\t//in = new BufferedReader(new FileReader(\"in.txt\"));\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\t\t}\n\t\t\t}\n\t\t\tcatch (Exception ex) {\n\t\t\t}\n\t\t}\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(nextString());\n\t\t}\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(nextString());\n\t\t}\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(nextString());\n\t\t}\n\t\tString nextString() {\n\t\t\ttry {\n\t\t\t\twhile (token == null || !token.hasMoreTokens()) {\n\t\t\t\t\ttoken = new StringTokenizer(in.readLine());\n\t\t\t\t}\n\t\t\t}\n\t\t\tcatch (IOException e) {\n\t\t\t}\n\t\t\treturn token.nextToken();\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "dp", "combinatorics", "bitmasks"], "code_uid": "4557b53bac3d0fd9a7bc0d9d1891c5af", "src_uid": "c142f8bc5252e739035992926545c251", "difficulty": 3200.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class QuadcopterCompetition {\n static class FastReader {\n BufferedReader br;\n StringTokenizer st;\n\n public FastReader() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n }\n\n public static void main(String args[]) throws IOException {\n\n FastReader scan = new FastReader();\n int x1 = scan.nextInt(), y1 = scan.nextInt(), x2 = scan.nextInt(), y2 = scan.nextInt();\n int ans = 0;\n if (x1 == x2 || y1 == y2) {\n ans = (Math.abs(x1 - x2) + 1) * 2 + (Math.abs(y1 - y2) + 1) * 2 + 2;\n } else {\n ans = (Math.abs(x1 - x2) + 1) * 2 + (Math.abs(y1 - y2) + 1) * 2;\n }\n System.out.println(ans);\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "greedy"], "code_uid": "25d81cf7cb5fbe3ea2877e1e913c24a0", "src_uid": "f54ce13fb92e51ebd5e82ffbdd1acbed", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class dom {\n\n static int N,M;\n static Edge edges[];\n static int max = 0;\n static int ar[];\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n N = in.nextInt();\n M = in.nextInt();\n edges = new Edge[M];\n for(int i = 0; i < M; i++) {\n int a = in.nextInt()-1;\n int b = in.nextInt()-1;\n edges[i] = new Edge(a,b);\n }\n ar = new int[N];\n dfs(0);\n System.out.println(max);\n }\n static void dfs(int id) {\n if(id == N) {\n int cur = 0;\n boolean used[][] = new boolean[6][6];\n for(Edge e : edges) {\n int a = Math.min(ar[e.a],ar[e.b]);\n int b = Math.max(ar[e.a],ar[e.b]);\n if(!used[a][b]) {\n cur++;\n used[a][b] = true;\n }\n }\n max = Math.max(max, cur);\n }\n else {\n for(int val = 0; val < 6; val++) {\n ar[id] = val;\n dfs(id+1);\n }\n }\n }\n static class Edge{\n int a,b;\n public Edge(int aa, int bb) {\n a=aa;\n b=bb;\n }\n }\n\n}", "lang_cluster": "Java", "tags": ["brute force", "graphs"], "code_uid": "f343dd6cf0d63c2b9ce05a1446258546", "src_uid": "11e6559cfb71b8f6ca88242094b17a2b", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastScanner in = new FastScanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TKSel_E solver = new TKSel_E();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TKSel_E {\n public void solve(int testNumber, FastScanner in, PrintWriter out) {\n int n = in.ni();\n byte[] a = new byte[n];\n for (int i = 0; i < n; i++) {\n a[i] = (byte) in.ni();\n }\n\n int max = 100;\n int[] cnt = new int[max + 1];\n for (int i = 0; i < n; i++) {\n cnt[a[i]]++;\n }\n int ncnt = 0;\n for (int i = 1; i <= max; i++) {\n if (cnt[i] > 0)\n ncnt++;\n }\n if (ncnt <= 2) {\n out.println(n);\n return;\n }\n byte[][][] dp = new byte[max][max + 2][max * max + 3];//dp[i][k][sum]\n dp[0][1][a[0]] = a[0];\n for (int i = 1; i < n; i++) {\n dp[i][1][a[i]] = a[i];\n for (int k = i; k >= 1; k--) {\n for (int sum = 1; sum <= max * max; sum++) {\n if (dp[i - 1][k][sum] != 0) {\n dp[i][k][sum] = dp[i - 1][k][sum];\n if (dp[i - 1][k][sum] == a[i] && (dp[i][k + 1][sum + a[i]] == 0 || dp[i][k + 1][sum + a[i]] == a[i])) {\n dp[i][k + 1][sum + a[i]] = a[i];\n } else {\n dp[i][k + 1][sum + a[i]] = -1; // different nums\n }\n }\n\n }\n\n }\n }\n\n int ans = 0;\n for (int i = 1; i <= max; i++) {\n if (cnt[i] > 0) {\n int sum = 0;\n for (int j = 1; j <= cnt[i]; j++) {\n sum += i;\n if (dp[n - 1][j][sum] == i) {\n ans = Math.max(ans, j);\n } // else break\n }\n }\n }\n out.println(ans);\n }\n\n }\n\n static class FastScanner {\n private BufferedReader in;\n private StringTokenizer st;\n\n public FastScanner(InputStream stream) {\n in = new BufferedReader(new InputStreamReader(stream));\n }\n\n public String ns() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n String rl = in.readLine();\n if (rl == null) {\n return null;\n }\n st = new StringTokenizer(rl);\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return st.nextToken();\n }\n\n public int ni() {\n return Integer.parseInt(ns());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "dp"], "code_uid": "cf1a105814996d38d24fdb5432d5d7f8", "src_uid": "ccc4b27889598266e8efe73b8aa3666c", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.BigInteger;\npublic class e\n{\n\tpublic static void main(String[] arg)\n\t{\n\t\tnew e();\n\t}\n\tlong MOD = 1_000_000_007;\n\tpublic e()\n\t{\n\n\t\tScanner in = new Scanner(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tint n = in.nextInt()-1;\n\t\tString s1 = in.next();\n\t\tString s2 = in.next();\n\t\tchar[] c = new char['X'];\n\t\tc['N'] = 'S';\n\t\tc['S'] = 'N';\n\t\tc['E'] = 'W';\n\t\tc['W'] = 'E';\n\t\tStringBuilder sb = new StringBuilder();\n\t\tfor(int i = n-1; i >= 0; i--)\n\t\t{\n\t\t\tsb.append(c[s1.charAt(i)]);\n\t\t}\n\t\tboolean flag = true;\n\t\tlong op1 = 0;\n\t\tlong op2 = 0;\n\t\tlong pow = 7;\n\t\tfor(int i = 0; i < n; i++)\n\t\t{\n\t\t\top1 += sb.charAt(i)*pow%MOD;\n\t\t\tpow *= 7;\n\t\t\top1 %= MOD;\n\t\t\tpow %= MOD;\n\t\t\t\n\t\t\top2 += s2.charAt(n-1-i);\n\t\t\top2 *= 7;\n\t\t\top2 %= MOD;\n\t\t\t\n\t\t\tif(op1 == op2) flag = false;\n\t\t}\n\t\tout.println(flag?\"YES\":\"NO\");\n\t\tin.close(); out.close();\n\t}\n}", "lang_cluster": "Java", "tags": ["strings"], "code_uid": "b5ad7f3b9474251fed4d73457b932991", "src_uid": "85f43628bec7e9b709273c34b894df6b", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\n/**\n * Created by boris on 26.03.2016.\n */\npublic class TaskB {\n public static void main(String[] args) throws IOException {\n BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n String[] tmp = reader.readLine().split(\"\\\\s\");\n\n int pods = Integer.parseInt(tmp[0]);\n int florsc = Integer.parseInt(tmp[1]);\n int doorsc = Integer.parseInt(tmp[2]);\n\n String[] tmp1 = reader.readLine().split(\"\\\\s\");\n\n int fr = Integer.parseInt(tmp1[0]);\n int to = Integer.parseInt(tmp1[1]);\n\n int frPod = (int) Math.ceil(fr*1.0/doorsc/florsc);\n int frFlor = (int) Math.ceil((fr*1.0-(frPod-1)*(florsc*doorsc))/doorsc);\n\n int toPod = (int) Math.ceil(to*1.0/doorsc/florsc);\n int toFlor = (int) Math.ceil((to*1.0-(toPod-1)*(florsc*doorsc))/doorsc);\n\n int time = 0;\n if (frPod == toPod) {\n int florsToGo = Math.abs(toFlor-frFlor);\n\n if (florsToGo < 3) {\n time += florsToGo*5;\n } else {\n time += 10;\n time += florsToGo;\n }\n } else {\n int florsToGo1 = toFlor-1;\n int florsToGo2 = frFlor-1;\n\n int podsToGo = Math.min(Math.abs(toPod-frPod), pods-Math.max(toPod, frPod)+Math.min(toPod, frPod));\n\n if (florsToGo1 < 3) {\n time += florsToGo1*5;\n } else {\n time += 10;\n time += florsToGo1;\n }\n\n if (florsToGo2 < 3) {\n time += florsToGo2*5;\n } else {\n time += 10;\n time += florsToGo2;\n }\n\n time += podsToGo*15;\n }\n\n System.out.println(time);\n }\n}\n", "lang_cluster": "Java", "tags": ["constructive algorithms"], "code_uid": "cc8010d3f3e26f6119bf9a7c23adcafa", "src_uid": "c37b46851abcf7eb472869bd1ab9f793", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport static java.lang.Math.*;\nimport java.math.BigInteger;\npublic class Main {\n static final long MOD = 998244353, INF = 1_000_000_000_000_000L;\n static final int INf = 1_000_000_000;\n static FastReader reader;\n static PrintWriter writer;\n public static void main(String[] args) {\n Thread t = new Thread(null, new O(), \"Integer.MAX_VALUE\", 100000000);\n t.start();\n }\n static class O implements Runnable {\n public void run() {\n try {\n magic();\n }\n catch (Exception e) {\n e.printStackTrace();\n System.exit(1);\n }\n }\n }\n static class FastReader {\n final private int BUFFER_SIZE = 1 << 16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n\n public FastReader() {\n din = new DataInputStream(System.in);\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public FastReader(String file_name) throws IOException {\n din = new DataInputStream(new FileInputStream(file_name));\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public String readLine() throws IOException {\n byte[] buf = new byte[1000000];\n int cnt = 0, c;\n while ((c = read()) != -1) {\n if (c == '\\n') break;\n buf[cnt++] = (byte) c;\n }\n return new String(buf, 0, cnt);\n }\n\n public int nextInt() throws IOException {\n int ret = 0;\n byte c = read();\n while (c <= ' ') c = read();\n boolean neg = (c == '-');\n if (neg) c = read();\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n if (neg) return -ret;\n return ret;\n }\n\n public long nextLong() throws IOException {\n long ret = 0;\n byte c = read();\n while (c <= ' ') c = read();\n boolean neg = (c == '-');\n if (neg) c = read();\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n if (neg) return -ret;\n return ret;\n }\n\n public double nextDouble() throws IOException {\n double ret = 0, div = 1;\n byte c = read();\n while (c <= ' ') c = read();\n boolean neg = (c == '-');\n if (neg) c = read();\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n if (c == '.') while ((c = read()) >= '0' && c <= '9') ret += (c - '0') / (div *= 10);\n if (neg) return -ret;\n return ret;\n }\n\n private void fillBuffer() throws IOException {\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1) buffer[0] = -1;\n }\n\n private byte read() throws IOException {\n if (bufferPointer == bytesRead) fillBuffer();\n return buffer[bufferPointer++];\n }\n\n public void close() throws IOException {\n if (din == null) return;\n din.close();\n }\n }\n static int n,m,k[],rem[];\n static Pair offers[];\n static TreeSet<Integer> offers_at[];\n static void magic() throws IOException {\n reader = new FastReader();\n writer = new PrintWriter(System.out, true);\n n = reader.nextInt();\n m = reader.nextInt();\n k = new int[n];\n rem = new int[n];\n for(int i=0;i<n;++i) {\n k[i] = reader.nextInt();\n }\n offers = new Pair[m];\n offers_at = new TreeSet[n];\n for(int i=0;i<n;++i) {\n offers_at[i] = new TreeSet<>();\n }\n for(int i=0;i<m;++i) {\n offers[i] = new Pair(reader.nextInt(), reader.nextInt()-1);\n offers_at[offers[i].y].add(offers[i].x);\n }\n Arrays.sort(offers);\n int low = 1, high = 4000000, mid;\n while(low<high) {\n mid = (low+high)>>1;\n if(check(mid)) {\n if(!check(mid-1)) {\n low = mid;\n break;\n }\n else high = --mid;\n }\n else low = ++mid;\n }\n writer.println(low);\n }\n static boolean check(int D) {\n for(int i=0;i<n;++i) {\n rem[i] = k[i];\n }\n int curr = 0, prev = 0;\n for(int i=0;i<m;++i) {\n if(offers[i].x>D) {\n break;\n }\n curr+=(offers[i].x - prev);\n prev = offers[i].x;\n if(offers_at[offers[i].y].lower(D+1)==offers[i].x) {\n int liya = min(curr, rem[offers[i].y]);\n curr-=liya;\n rem[offers[i].y]-=liya;\n }\n else {\n continue;\n }\n }\n curr+=(D-prev);\n int left = 0;\n for(int i=0;i<n;++i) {\n left+=rem[i];\n }\n return curr>=2*left;\n }\n static class Pair implements Comparable<Pair>\n {\n int x,y;\n Pair(int x,int y)\n {\n this.x=x;\n this.y=y;\n }\n public int compareTo(Pair other)\n {\n if(this.x!=other.x)\n return this.x-other.x;\n return this.y-other.y;\n }\n public String toString()\n {\n return \"(\"+x+\",\"+y+\")\";\n }\n }\n}", "lang_cluster": "Java", "tags": ["greedy", "binary search"], "code_uid": "4daec21842eb6f8020147bfa81121114", "src_uid": "2eb101dcfcc487fe6e44c9b4c0e4024d", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\n/**\n * 5 5\n * 4 5\n * 1 4 8\n * 4 2 4\n * 4 1 3\n * 3 1 9\n * 4 5 4\n * 2 7\n * 2 7\n * 5 1\n * 6 3\n * 3 2\n *\n * @author pttrung\n */\npublic class C {\n\n static boolean[][] pre;\n\n public static void main(String[] args) {\n Scanner in = new Scanner();\n PrintWriter out = new PrintWriter(System.out);\n int n = in.nextInt();\n pre = new boolean[n][10];\n String[] guess = new String[n];\n int[] b = new int[n];\n int[] c = new int[n];\n \n for (int i = 0; i < n; i++) {\n guess[i] = in.next();\n process(i, guess[i]);\n b[i] = in.nextInt();\n c[i] = in.nextInt();\n }\n String val = null;\n int count = 0;\n for(int i = 123; i < 10000; i++){\n String pro;\n if(i < 1000){\n pro = \"0\" + i;\n }else{\n pro = \"\" + i;\n }\n if(check(pro, guess, b, c)){\n count++;\n val = pro;\n }\n }\n if(count > 1){\n out.println(\"Need more data\");\n }else if(count == 1){\n out.println(val);\n }else{\n out.println(\"Incorrect data\");\n }\n\n out.close();\n }\n\n static void process(int index, String val) {\n for (int i = 0; i < val.length(); i++) {\n int j = val.charAt(i) - '0';\n pre[index][j] = true;\n }\n }\n\n static boolean check(String val, String[] guess, int[] b, int[] c) {\n boolean[] count = new boolean[10];\n for (int i = 0; i < val.length(); i++) {\n int index = val.charAt(i) - '0';\n if (count[index]) {\n return false;\n }\n count[index] = true;\n }\n for (int i = 0; i < guess.length; i++) {\n int m = 0;\n int n = 0;\n for (int j = 0; j < 4; j++) {\n if (val.charAt(j) == guess[i].charAt(j)) {\n m++;\n } else if (count[guess[i].charAt(j) - '0']) {\n n++;\n }\n }\n if (b[i] != m || c[i] != n) {\n return false;\n }\n }\n return true;\n\n }\n\n static double distance(Point a, Point b) {\n double total = (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y) + (a.z - b.z) * (a.z - b.z);\n return Math.sqrt(total);\n }\n\n static class Point {\n\n int x, y, z;\n\n public Point(int x, int y, int z) {\n this.x = x;\n this.y = y;\n this.z = z;\n }\n }\n\n static class Scanner {\n\n BufferedReader br;\n StringTokenizer st;\n\n public Scanner() {\n // System.setOut(new PrintStream(new BufferedOutputStream(System.out), true));\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n public String next() {\n\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (Exception e) {\n throw new RuntimeException();\n }\n }\n return st.nextToken();\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public String nextLine() {\n st = null;\n try {\n return br.readLine();\n } catch (Exception e) {\n throw new RuntimeException();\n }\n }\n\n public boolean endLine() {\n try {\n String next = br.readLine();\n while (next != null && next.trim().isEmpty()) {\n next = br.readLine();\n }\n if (next == null) {\n return true;\n }\n st = new StringTokenizer(next);\n return st.hasMoreTokens();\n } catch (Exception e) {\n throw new RuntimeException();\n }\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "4ea494ad3044c51ae7137c9d8a60508a", "src_uid": "142e5f2f08724e53c234fc2379216b4c", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.PrintStream;\nimport java.io.BufferedReader;\nimport java.util.Comparator;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Collection;\nimport java.util.List;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.ArrayList;\nimport java.util.StringTokenizer;\nimport java.math.BigInteger;\nimport java.util.Collections;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author AlexFetisov\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskE_CF_Round solver = new TaskE_CF_Round();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskE_CF_Round {\n public static final int MOD = (int)1e9 + 7;\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int[] w = Utils.readIntArray(in, 7);\n int[][][] a = new int[7][][];\n for (int i = 1; i <= 7; ++i) {\n a[i-1] = getMatrix(i);\n a[i-1] = MatrixUtils.pow(a[i-1], w[i-1], MOD);\n }\n int[] d = new int[1 << 7];\n int last = -1;\n int[] memo = new int[1 << 7];\n for (int i = 0; i < 7; ++i) {\n for (int j = (1 << (i+1))-1; j >= 0; --j) {\n if (d[j] != 0) {\n d[j | (1 << i)] = d[j];\n d[j] = 0;\n }\n }\n if (w[i] != 0) {\n if (last == -1) {\n d[(1 << (i+1)) - 1] = 1;\n }\n last = i;\n int[] nd = new int[1 << 7];\n for (int j = 0; j < (1 << 7); ++j) {\n if (d[j] > 0) {\n for (int k = 0; k < (1 << 7); ++k) {\n if (a[i].length > j && a[i][j].length > k) {\n nd[k] += (d[j] * 1L * a[i][j][k]) % MOD;\n if (nd[k] >= MOD) {\n nd[k] -= MOD;\n }\n }\n }\n }\n }\n int[] temp = d;\n d = nd;\n nd = temp;\n Arrays.fill(nd, 0);\n memo = d.clone();\n }\n }\n out.println(memo[(1 << (last+1)) - 1]);\n }\n\n private int[][] getMatrix(int w) {\n int[][] a = new int[1 << w][1 << w];\n for (int maskLeft = 0; maskLeft < (1 << w); ++maskLeft) {\n for (int maskRight = 0; maskRight < (1 << w); ++maskRight) {\n for (int mask = 0; mask < (1 << (w-1)); ++mask) {\n boolean ok = true;\n for (int bit = 0; bit < w; ++bit) {\n if (BitUtils.checkBit(maskLeft, bit) && BitUtils.checkBit(maskRight, bit)) {\n boolean upper = bit == 0 || BitUtils.checkBit(mask, bit-1);\n boolean lower = bit == w-1 || BitUtils.checkBit(mask, bit);\n if (upper && lower) {\n ok = false;\n }\n }\n }\n if (ok) {\n ++a[maskLeft][maskRight];\n }\n }\n }\n }\n return a;\n }\n}\n\nclass InputReader {\n private BufferedReader reader;\n private StringTokenizer stt;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream));\n }\n\n public String nextLine() {\n try {\n return reader.readLine();\n } catch (IOException e) {\n return null;\n }\n }\n\n public String nextString() {\n while (stt == null || !stt.hasMoreTokens()) {\n stt = new StringTokenizer(nextLine());\n }\n return stt.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(nextString());\n }\n\n}\n\nclass Utils {\n public static int[] readIntArray(InputReader in, int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; ++i) {\n a[i] = in.nextInt();\n }\n return a;\n }\n\n}\n\nclass MatrixUtils {\n\n public static int[][] mul(int[][] a, int[][] b, int MOD) {\n int n = a.length;\n int m = a[0].length;\n int k = b[0].length;\n int[][] r = new int[n][k];\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < k; ++j) {\n for (int p = 0; p < m; ++p) {\n r[i][j] += (a[i][p] * 1L * b[p][j]) % MOD;\n if (r[i][j] >= MOD) r[i][j] -= MOD;\n }\n }\n }\n return r;\n }\n\n public static int[][] pow(int[][] aa, long p, int MOD) {\n int[][] a = aa.clone();\n int n = a.length;\n int[][] r = buildOne(n);\n for (long i = p; i > 0; i /= 2) {\n if (i % 2 == 1) r = mul(r, a, MOD);\n a = mul(a, a, MOD);\n }\n return r;\n }\n\n private static int[][] buildOne(int n) {\n int[][] r = new int[n][n];\n for (int i = 0; i < n; ++i) {\n r[i][i] = 1;\n }\n return r;\n }\n\n}\n\nclass BitUtils {\n public static boolean checkBit(int mask, int bit) {\n return (mask & (1 << bit)) > 0;\n }\n\n}\n\n", "lang_cluster": "Java", "tags": ["matrices", "dp"], "code_uid": "5612c8172dc37026111a1b0ef5ed9adf", "src_uid": "a4bda63b95dc14185c47a08652fe41bd", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Scanner;\nimport java.lang.Math.*;\npublic class Main_C {\n static long n;\n private static Scanner enter;\n \n static long[] a;\n public static void main(String[] args) {\n enter=new Scanner(System.in);\n n=enter.nextLong();\n a=new long[20];\n a[1] = 1;\n for(int i = 2;i <= 16 ;i ++ ) {\n a[i] = a[i-1] *10 + 1;\n }\n System.out.println(sol(n));\n }\n static int sol (long l) {\n int i = 16;\n int r = 0;\n if(l <= 11) {\n return (int) Math.min(l,2+11-l);\n }\n while(a[i-1] > l)i--;\n r = (int) (l/a[i-1]) *(i-1) + sol(l%(a[i-1]));\n if(2*l<a[i])\n return r;\n return Math.min(r, i + sol(a[i] - l));\n \n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "divide and conquer", "dfs and similar"], "code_uid": "0bdf47b4687db69fb2de4354f4219d36", "src_uid": "1b17a7b3b41077843ee1d6e0607720d6", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class Main {\n static class Reader {\n static BufferedReader reader;\n static StringTokenizer tokenizer;\n\n static void init(InputStream input) {\n reader = new BufferedReader(new InputStreamReader(input));\n tokenizer = new StringTokenizer(\"\");\n }\n\n static String next() throws IOException {\n while (!tokenizer.hasMoreTokens()) {\n tokenizer = new StringTokenizer(reader.readLine());\n }\n return tokenizer.nextToken();\n }\n\n static int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n static long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n static double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n\n static String nextLine() {\n String str = \"\";\n try {\n str = reader.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n }\n\n static long[] ones = {0, 1, 11, 111, 1111, 11111, 111111, 1111111, 11111111, 111111111, 1111111111, 11111111111L, 111111111111L, 1111111111111L, 11111111111111L, 111111111111111L, 1111111111111111L};\n\n public static void main(String[] args) throws Exception {\n Reader.init(System.in);\n long n = Reader.nextLong();\n long res = decompose(n);\n System.out.println(res);\n }\n\n public static long decompose(long n) {\n if (n <= 6) {\n return n;\n }\n long numOfDigits = getNumOfDigits(n);\n long lower, upper;\n lower = ones[(int) numOfDigits];\n if (n < lower) {\n upper = lower;\n lower = ones[(int) (numOfDigits - 1)];\n } else if (n > lower) {\n upper = ones[(int) (numOfDigits + 1)];\n } else {\n return numOfDigits;\n }\n long resLower = decompose(n % lower) + (n / lower) * getNumOfDigits(lower);\n long resUpper = Long.MAX_VALUE;\n if (upper - n < n) {\n resUpper = decompose(upper - n) + getNumOfDigits(upper);\n }\n return Math.min(resLower, resUpper);\n }\n\n public static long getNumOfDigits(long n) {\n return (long) Math.floor(Math.log10(n)) + 1;\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "divide and conquer", "dfs and similar"], "code_uid": "282c4d03a9992d26730ae842873d0986", "src_uid": "1b17a7b3b41077843ee1d6e0607720d6", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tOutputWriter out = new OutputWriter(outputStream);\n\t\tTask solver = new TaskC();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\ninterface Task {\n\tpublic void solve(int testNumber, InputReader in, OutputWriter out);\n}\n\nclass TaskA implements Task {\n\n\tpublic void solve(int testNumber, InputReader in, OutputWriter out) {\n\t\tint n=in.readInt(), a=0;\n\t\tfor (int i=1; i<=n; i++) a^=i;\n\t\tfor (int i=1; i<n; i++) a^=in.readInt();\n\t\tout.printLine(a);\n\t}\n\n}\n\nclass TaskB implements Task {\n\n\tint[] arr;\n\tLinkedList<Pair<Integer, Integer>> mais=new LinkedList<Pair<Integer, Integer>>(), menos=new LinkedList<Pair<Integer, Integer>>();\n\t\n\tpublic void solve(int testNumber, InputReader in, OutputWriter out) {\n\t\tint n=in.readInt();\n\t\tlong ret=0L, c=0L;\n\t\tarr=IOUtils.readIntArray(in, n);\n\t\tfor (int i=0; i<n; i++) c+=arr[i];\n\t\tc/=n;\n\t\tfor (int i=0; i<n; i++) {\n\t\t\tif (arr[i]<c) menos.addLast(Pair.makePair((int)c-arr[i], i));\n\t\t\telse mais.addLast(Pair.makePair(arr[i]-(int)c, i));\n\t\t}\n\t\twhile (!mais.isEmpty() && !menos.isEmpty()) {\n\t\t\tint x=mais.getFirst().first, y=menos.getFirst().first, d=Math.abs(mais.getFirst().second-menos.getFirst().second);\n\t\t\tret+=1L*MiscUtils.min(x, y)*d;\n\t\t\tif (x==y) {\n\t\t\t\tmais.removeFirst();\n\t\t\t\tmenos.removeFirst();\n\t\t\t}\n\t\t\telse if (x<y) {\n\t\t\t\tmais.removeFirst();\n\t\t\t\tmenos.set(0, Pair.makePair(y-x, menos.getFirst().second));\n\t\t\t}\n\t\t\telse {\n\t\t\t\tmais.set(0, Pair.makePair(x-y, mais.getFirst().second));\n\t\t\t\tmenos.removeFirst();\n\t\t\t}\n\t\t}\n\t\tout.printLine(ret);\n\t}\n\n}\n\nclass TaskC implements Task {\n\n\tArrayList<Integer> list=new ArrayList<Integer>();\n\tlong[] pow=new long[16];\n\t\n\tpublic void solve(int testNumber, InputReader in, OutputWriter out) {\n\t\tpow[0]=1L;\n\t\tfor (int i=1; i<16; i++) pow[i]=10L*pow[i-1]+1L;\n\t\tout.printLine(f(in.readLong()));\n//\t\tout.printLine(pow);\n\t}\n\t\n\tint f(long n) {\n\t\tif (n<=1L) return (int)n;\n\t\tint pos=15, x=0;\n\t\tfor (; pow[pos]>=n; pos--);\n\t\tpos++;\n\t\tlong m1=0L, m2=pow[pos];\n\t\tint x1=0, x2=pos+1;\n\t\twhile (m1+pow[pos-1]<=n) {\n\t\t\tm1+=pow[pos-1];\n\t\t\tx1+=pos;\n\t\t}\n\t\twhile (m2-pow[pos-1]>=n) {\n\t\t\tm2-=pow[pos-1];\n\t\t\tx2+=pos;\n\t\t}\n\t\tx1+=f(n-m1);\n\t\tx2+=f(m2-n);\n\t\treturn MiscUtils.min(x1, x2);\n\t}\n\n}\n\nclass TaskD implements Task {\n\n\tArrayList<Pair<Integer, Pair<Integer, Integer>>> edges = new ArrayList<Pair<Integer, Pair<Integer, Integer>>>(),\n\t\t\tused;\n\tint[] pai, tam;\n\n\tpublic void solve(int testNumber, InputReader in, OutputWriter out) {\n\t\tint n = in.readInt(), m = in.readInt();\n\t\tint[] a = IOUtils.readIntArray(in, n);\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tint x = in.readInt() - 1, y = in.readInt() - 1;\n\t\t\tedges.add(Pair.makePair(MiscUtils.min(a[x], a[y]),\n\t\t\t\t\tPair.makePair(x, y)));\n\t\t}\n\t\tpai = new int[n];\n\t\ttam = new int[n];\n\t\tCollections.sort(edges);\n\t\tCollections.reverse(edges);\n\t\tout.printLine(2.0 * kruskal(n) / n / (n - 1));\n\t}\n\n\tdouble kruskal(int n) {\n\t\tlong ret = 0L;\n\t\tused = new ArrayList<Pair<Integer, Pair<Integer, Integer>>>();\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tpai[i] = i;\n\t\tArrays.fill(tam, 1);\n\t\tfor (Pair<Integer, Pair<Integer, Integer>> par : edges) {\n\t\t\tint w = par.first, x = par.second.first, y = par.second.second;\n\t\t\tif (find(x) != find(y)) {\n\t\t\t\tret += 1L * w * tam[find(x)] * tam[find(y)];\n\t\t\t\tused.add(par);\n\t\t\t\tif (tam[find(x)] < tam[find(y)]) {\n\t\t\t\t\ttam[find(y)] += tam[find(x)];\n\t\t\t\t\tpai[find(x)] = find(y);\n\t\t\t\t} else {\n\t\t\t\t\ttam[find(x)] += tam[find(y)];\n\t\t\t\t\tpai[find(y)] = find(x);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n\n\tint find(int x) {\n\t\tif (x == pai[x])\n\t\t\treturn x;\n\t\treturn pai[x] = find(pai[x]);\n\t}\n\n}\n\nclass TaskE implements Task {\n\n\tlong[] x, y;\n\tlong[][] dp;\n\tlong MOD = 1000000007L;\n\tPolygon polygon;\n\tPoint[] points;\n\n\tpublic void solve(int testNumber, InputReader in, OutputWriter out) {\n\t\tint n = in.readInt();\n\t\tx = new long[n];\n\t\ty = new long[n];\n\t\tIOUtils.readLongArrays(in, x, y);\n\t\tpoints=new Point[n];\n\t\tfor (int i=0; i<n; i++) points[i]=new Point(x[i], y[i]);\n\t\tpolygon=new Polygon(points);\n\t\tdp = new long[n][n];\n\t\tfor (int i=0; i<n; i++) Arrays.fill(dp[i], -1L);\n\t\tout.printLine(dp(0, n - 1));\n//\t\tfor (int i=0; i<n; i++) out.printLine(dp[i]);\n\t}\n\n\tlong dp(int i, int j) {\n\t\tif (dp[i][j]!=-1L) return dp[i][j];\n\t\tif (j==i+1) return dp[i][j]=1L;\n\t\tdp[i][j]=0L;\n\t\tSegment segment=new Segment(points[i], points[j]);\n\t\tfor (Point point: polygon.vertices) if (segment.contains(point, false)) return dp[i][j];\n\t\tfor (int k=0; k<i-1; k++) if (segment.intersect(new Segment(points[k], points[k+1]), true)!=null) return dp[i][j];\n\t\tfor (int k=i+1; k<j-1; k++) if (segment.intersect(new Segment(points[k], points[k+1]), true)!=null) return dp[i][j];\n\t\tfor (int k=j+1; k<points.length-1; k++) if (segment.intersect(new Segment(points[k], points[k+1]), true)!=null) return dp[i][j];\n\t\tif (i!=0 && j!=0 && i!=points.length-1 && j!=points.length-1) \n\t\t\tif (segment.intersect(new Segment(points[0], points[points.length-1]), true)!=null) return dp[i][j];\n\t\tPoint middle=new Point(0.5*(points[i].x+points[j].x), 0.5*(points[i].y+points[j].y));\n\t\tif (!polygon.contains(middle)) return dp[i][j]=0L;\n\t\tfor (int k=i+1; k<j; k++) dp[i][j]=(dp[i][j]+dp(i, k)*dp(k, j)%MOD)%MOD;\n\t\treturn dp[i][j];\n\t}\n\n\tclass Polygon {\n\t\tpublic final Point[] vertices;\n\t\tprivate Segment[] sides;\n\n\t\tpublic Polygon(Point... vertices) {\n\t\t\tthis.vertices = vertices.clone();\n\t\t}\n\n\t\tpublic double square() {\n\t\t\tdouble sum = 0;\n\t\t\tfor (int i = 1; i < vertices.length; i++)\n\t\t\t\tsum += (vertices[i].x - vertices[i - 1].x)\n\t\t\t\t\t\t* (vertices[i].y + vertices[i - 1].y);\n\t\t\tsum += (vertices[0].x - vertices[vertices.length - 1].x)\n\t\t\t\t\t* (vertices[0].y + vertices[vertices.length - 1].y);\n\t\t\treturn Math.abs(sum) / 2;\n\t\t}\n\n\t\tpublic Point center() {\n\t\t\tdouble sx = 0;\n\t\t\tdouble sy = 0;\n\t\t\tfor (Point point : vertices) {\n\t\t\t\tsx += point.x;\n\t\t\t\tsy += point.y;\n\t\t\t}\n\t\t\treturn new Point(sx / vertices.length, sy / vertices.length);\n\t\t}\n\n\t\tpublic boolean contains(Point point) {\n\t\t\treturn contains(point, false);\n\t\t}\n\n\t\tpublic boolean contains(Point point, boolean strict) {\n\t\t\tfor (Segment segment : sides()) {\n\t\t\t\tif (segment.contains(point, true))\n\t\t\t\t\treturn !strict;\n\t\t\t}\n\t\t\tdouble totalAngle = GeometryUtils.canonicalAngle(Math.atan2(\n\t\t\t\t\tvertices[0].y - point.y, vertices[0].x - point.x)\n\t\t\t\t\t- Math.atan2(vertices[vertices.length - 1].y - point.y,\n\t\t\t\t\t\t\tvertices[vertices.length - 1].x - point.x));\n\t\t\tfor (int i = 1; i < vertices.length; i++) {\n\t\t\t\ttotalAngle += GeometryUtils.canonicalAngle(Math.atan2(\n\t\t\t\t\t\tvertices[i].y - point.y, vertices[i].x - point.x)\n\t\t\t\t\t\t- Math.atan2(vertices[i - 1].y - point.y,\n\t\t\t\t\t\t\t\tvertices[i - 1].x - point.x));\n\t\t\t}\n\t\t\treturn Math.abs(totalAngle) > Math.PI;\n\t\t}\n\n\t\tpublic Segment[] sides() {\n\t\t\tif (sides == null) {\n\t\t\t\tsides = new Segment[vertices.length];\n\t\t\t\tfor (int i = 0; i < vertices.length - 1; i++)\n\t\t\t\t\tsides[i] = new Segment(vertices[i], vertices[i + 1]);\n\t\t\t\tsides[sides.length - 1] = new Segment(\n\t\t\t\t\t\tvertices[vertices.length - 1], vertices[0]);\n\t\t\t}\n\t\t\treturn sides;\n\t\t}\n\n\t\tpublic double perimeter() {\n\t\t\tdouble result = vertices[0].distance(vertices[vertices.length - 1]);\n\t\t\tfor (int i = 1; i < vertices.length; i++)\n\t\t\t\tresult += vertices[i].distance(vertices[i - 1]);\n\t\t\treturn result;\n\t\t}\n\t}\n\n\tclass Segment {\n\t\tpublic final Point a;\n\t\tpublic final Point b;\n\t\tprivate double distance = Double.NaN;\n\t\tprivate Line line = null;\n\n\t\tpublic Segment(Point a, Point b) {\n\t\t\tthis.a = a;\n\t\t\tthis.b = b;\n\t\t}\n\n\t\tpublic double length() {\n\t\t\tif (Double.isNaN(distance))\n\t\t\t\tdistance = a.distance(b);\n\t\t\treturn distance;\n\t\t}\n\n\t\tpublic double distance(Point point) {\n\t\t\tdouble length = length();\n\t\t\tdouble left = point.distance(a);\n\t\t\tif (length < GeometryUtils.epsilon)\n\t\t\t\treturn left;\n\t\t\tdouble right = point.distance(b);\n\t\t\tif (left * left > right * right + length * length)\n\t\t\t\treturn right;\n\t\t\tif (right * right > left * left + length * length)\n\t\t\t\treturn left;\n\t\t\treturn point.distance(line());\n\t\t}\n\n\t\tpublic Point intersect(Segment other, boolean includeEnds) {\n\t\t\tLine line = line();\n\t\t\tLine otherLine = other.a.line(other.b);\n\t\t\tif (line.parallel(otherLine))\n\t\t\t\treturn null;\n\t\t\tPoint intersection = line.intersect(otherLine);\n\t\t\tif (contains(intersection, includeEnds)\n\t\t\t\t\t&& other.contains(intersection, includeEnds))\n\t\t\t\treturn intersection;\n\t\t\telse\n\t\t\t\treturn null;\n\t\t}\n\n\t\tpublic boolean contains(Point point, boolean includeEnds) {\n\t\t\tif (a.equals(point) || b.equals(point))\n\t\t\t\treturn includeEnds;\n\t\t\tif (a.equals(b))\n\t\t\t\treturn false;\n\t\t\tLine line = line();\n\t\t\tif (!line.contains(point))\n\t\t\t\treturn false;\n\t\t\tLine perpendicular = line.perpendicular(a);\n\t\t\tdouble aValue = perpendicular.value(a);\n\t\t\tdouble bValue = perpendicular.value(b);\n\t\t\tdouble pointValue = perpendicular.value(point);\n\t\t\treturn aValue < pointValue && pointValue < bValue\n\t\t\t\t\t|| bValue < pointValue && pointValue < aValue;\n\t\t}\n\n\t\tpublic Line line() {\n\t\t\tif (line == null)\n\t\t\t\tline = a.line(b);\n\t\t\treturn line;\n\t\t}\n\n\t\tpublic Point middle() {\n\t\t\treturn new Point((a.x + b.x) / 2, (a.y + b.y) / 2);\n\t\t}\n\n\t\tpublic Point intersect(Line line) {\n\t\t\tLine selfLine = line();\n\t\t\tPoint intersect = selfLine.intersect(line);\n\t\t\tif (intersect == null)\n\t\t\t\treturn null;\n\t\t\tif (contains(intersect, true))\n\t\t\t\treturn intersect;\n\t\t\treturn null;\n\t\t}\n\n\t\tpublic double distance(Segment other) {\n\t\t\tLine line = line();\n\t\t\tLine otherLine = other.line();\n\t\t\tPoint p = line == null || otherLine == null ? null : line\n\t\t\t\t\t.intersect(otherLine);\n\t\t\tif (p != null && contains(p, true) && other.contains(p, true))\n\t\t\t\treturn 0;\n\t\t\treturn Math.min(Math.min(other.distance(a), other.distance(b)),\n\t\t\t\t\tMath.min(distance(other.a), distance(other.b)));\n\t\t}\n\t}\n\n\tclass Point {\n\t\tpublic final double x;\n\t\tpublic final double y;\n\n\t\t@Override\n\t\tpublic String toString() {\n\t\t\treturn \"(\" + x + \", \" + y + \")\";\n\t\t}\n\n\t\tpublic Point(double x, double y) {\n\t\t\tthis.x = x;\n\t\t\tthis.y = y;\n\t\t}\n\n\t\tpublic Line line(Point other) {\n\t\t\tif (equals(other))\n\t\t\t\treturn null;\n\t\t\tdouble a = other.y - y;\n\t\t\tdouble b = x - other.x;\n\t\t\tdouble c = -a * x - b * y;\n\t\t\treturn new Line(a, b, c);\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean equals(Object o) {\n\t\t\tif (this == o)\n\t\t\t\treturn true;\n\t\t\tif (o == null || getClass() != o.getClass())\n\t\t\t\treturn false;\n\n\t\t\tPoint point = (Point) o;\n\n\t\t\treturn Math.abs(x - point.x) <= GeometryUtils.epsilon\n\t\t\t\t\t&& Math.abs(y - point.y) <= GeometryUtils.epsilon;\n\t\t}\n\n\t\t@Override\n\t\tpublic int hashCode() {\n\t\t\tint result;\n\t\t\tlong temp;\n\t\t\ttemp = x != +0.0d ? Double.doubleToLongBits(x) : 0L;\n\t\t\tresult = (int) (temp ^ (temp >>> 32));\n\t\t\ttemp = y != +0.0d ? Double.doubleToLongBits(y) : 0L;\n\t\t\tresult = 31 * result + (int) (temp ^ (temp >>> 32));\n\t\t\treturn result;\n\t\t}\n\n\t\tpublic double distance(Point other) {\n\t\t\treturn GeometryUtils.fastHypot(x - other.x, y - other.y);\n\t\t}\n\n\t\tpublic double distance(Line line) {\n\t\t\treturn Math.abs(line.a * x + line.b * y + line.c);\n\t\t}\n\n\t\tpublic double value() {\n\t\t\treturn GeometryUtils.fastHypot(x, y);\n\t\t}\n\n\t\tpublic double angle() {\n\t\t\treturn Math.atan2(y, x);\n\t\t}\n\n\t\tpublic Point rotate(double angle) {\n\t\t\tdouble nx = x * Math.cos(angle) - y * Math.sin(angle);\n\t\t\tdouble ny = y * Math.cos(angle) + x * Math.sin(angle);\n\t\t\treturn new Point(nx, ny);\n\t\t}\n\t}\n\n\tclass Line {\n\t\tpublic final double a;\n\t\tpublic final double b;\n\t\tpublic final double c;\n\n\t\tpublic Line(Point p, double angle) {\n\t\t\ta = Math.sin(angle);\n\t\t\tb = -Math.cos(angle);\n\t\t\tc = -p.x * a - p.y * b;\n\t\t}\n\n\t\tpublic Line(double a, double b, double c) {\n\t\t\tdouble h = GeometryUtils.fastHypot(a, b);\n\t\t\tthis.a = a / h;\n\t\t\tthis.b = b / h;\n\t\t\tthis.c = c / h;\n\t\t}\n\n\t\tpublic Point intersect(Line other) {\n\t\t\tif (parallel(other))\n\t\t\t\treturn null;\n\t\t\tdouble determinant = b * other.a - a * other.b;\n\t\t\tdouble x = (c * other.b - b * other.c) / determinant;\n\t\t\tdouble y = (a * other.c - c * other.a) / determinant;\n\t\t\treturn new Point(x, y);\n\t\t}\n\n\t\tpublic boolean parallel(Line other) {\n\t\t\treturn Math.abs(a * other.b - b * other.a) < GeometryUtils.epsilon;\n\t\t}\n\n\t\tpublic boolean contains(Point point) {\n\t\t\treturn Math.abs(value(point)) < GeometryUtils.epsilon;\n\t\t}\n\n\t\tpublic Line perpendicular(Point point) {\n\t\t\treturn new Line(-b, a, b * point.x - a * point.y);\n\t\t}\n\n\t\tpublic double value(Point point) {\n\t\t\treturn a * point.x + b * point.y + c;\n\t\t}\n\n\t\tpublic double distance(Point center) {\n\t\t\treturn Math.abs(value(center));\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean equals(Object o) {\n\t\t\tif (this == o)\n\t\t\t\treturn true;\n\t\t\tif (o == null || getClass() != o.getClass())\n\t\t\t\treturn false;\n\n\t\t\tLine line = (Line) o;\n\n\t\t\tif (!parallel(line))\n\t\t\t\treturn false;\n\t\t\tif (Math.abs(a * line.c - c * line.a) > GeometryUtils.epsilon\n\t\t\t\t\t|| Math.abs(b * line.c - c * line.b) > GeometryUtils.epsilon)\n\t\t\t\treturn false;\n\n\t\t\treturn true;\n\t\t}\n\t}\n\n}\n\nclass GeometryUtils {\n\tpublic static double epsilon = 1e-5;\n\n\tpublic static double fastHypot(double... x) {\n\t\tif (x.length == 0)\n\t\t\treturn 0;\n\t\telse if (x.length == 1)\n\t\t\treturn Math.abs(x[0]);\n\t\telse {\n\t\t\tdouble sumSquares = 0;\n\t\t\tfor (double value : x)\n\t\t\t\tsumSquares += value * value;\n\t\t\treturn Math.sqrt(sumSquares);\n\t\t}\n\t}\n\n\tpublic static double fastHypot(double x, double y) {\n\t\treturn Math.sqrt(x * x + y * y);\n\t}\n\n\tpublic static double fastHypot(double[] x, double[] y) {\n\t\tif (x.length == 0)\n\t\t\treturn 0;\n\t\telse if (x.length == 1)\n\t\t\treturn Math.abs(x[0] - y[0]);\n\t\telse {\n\t\t\tdouble sumSquares = 0;\n\t\t\tfor (int i = 0; i < x.length; i++) {\n\t\t\t\tdouble diff = x[i] - y[i];\n\t\t\t\tsumSquares += diff * diff;\n\t\t\t}\n\t\t\treturn Math.sqrt(sumSquares);\n\t\t}\n\t}\n\n\tpublic static double fastHypot(int[] x, int[] y) {\n\t\tif (x.length == 0)\n\t\t\treturn 0;\n\t\telse if (x.length == 1)\n\t\t\treturn Math.abs(x[0] - y[0]);\n\t\telse {\n\t\t\tdouble sumSquares = 0;\n\t\t\tfor (int i = 0; i < x.length; i++) {\n\t\t\t\tdouble diff = x[i] - y[i];\n\t\t\t\tsumSquares += diff * diff;\n\t\t\t}\n\t\t\treturn Math.sqrt(sumSquares);\n\t\t}\n\t}\n\n\tpublic static double missileTrajectoryLength(double v, double angle,\n\t\t\tdouble g) {\n\t\treturn (v * v * Math.sin(2 * angle)) / g;\n\t}\n\n\tpublic static double sphereVolume(double radius) {\n\t\treturn 4 * Math.PI * radius * radius * radius / 3;\n\t}\n\n\tpublic static double triangleSquare(double first, double second,\n\t\t\tdouble third) {\n\t\tdouble p = (first + second + third) / 2;\n\t\treturn Math.sqrt(p * (p - first) * (p - second) * (p - third));\n\t}\n\n\tpublic static double canonicalAngle(double angle) {\n\t\twhile (angle > Math.PI)\n\t\t\tangle -= 2 * Math.PI;\n\t\twhile (angle < -Math.PI)\n\t\t\tangle += 2 * Math.PI;\n\t\treturn angle;\n\t}\n\n\tpublic static double positiveAngle(double angle) {\n\t\twhile (angle > 2 * Math.PI - GeometryUtils.epsilon)\n\t\t\tangle -= 2 * Math.PI;\n\t\twhile (angle < -GeometryUtils.epsilon)\n\t\t\tangle += 2 * Math.PI;\n\t\treturn angle;\n\t}\n}\n\nclass OutputWriter {\n\tprivate final PrintWriter writer;\n\n\tpublic OutputWriter(OutputStream outputStream) {\n\t\twriter = new PrintWriter(new BufferedWriter(new OutputStreamWriter(\n\t\t\t\toutputStream)));\n\t}\n\n\tpublic OutputWriter(Writer writer) {\n\t\tthis.writer = new PrintWriter(writer);\n\t}\n\n\tpublic void print(char[] array) {\n\t\twriter.print(array);\n\t}\n\n\tpublic void print(Object... objects) {\n\t\tfor (int i = 0; i < objects.length; i++) {\n\t\t\tif (i != 0)\n\t\t\t\twriter.print(' ');\n\t\t\twriter.print(objects[i]);\n\t\t}\n\t}\n\n\tpublic void print(int[] array) {\n\t\tfor (int i = 0; i < array.length; i++) {\n\t\t\tif (i != 0)\n\t\t\t\twriter.print(' ');\n\t\t\twriter.print(array[i]);\n\t\t}\n\t}\n\n\tpublic void print(long[] array) {\n\t\tfor (int i = 0; i < array.length; i++) {\n\t\t\tif (i != 0)\n\t\t\t\twriter.print(' ');\n\t\t\twriter.print(array[i]);\n\t\t}\n\t}\n\n\tpublic void print(Collection<Integer> collection) {\n\t\tboolean first = true;\n\t\tfor (Integer iterator : collection) {\n\t\t\tif (first)\n\t\t\t\tfirst = false;\n\t\t\telse\n\t\t\t\twriter.print(' ');\n\t\t\twriter.print(iterator);\n\t\t}\n\t}\n\n\tpublic void printLine(int[] array) {\n\t\tprint(array);\n\t\twriter.println();\n\t}\n\n\tpublic void printLine(long[] array) {\n\t\tprint(array);\n\t\twriter.println();\n\t}\n\n\tpublic void printLine(Collection<Integer> collection) {\n\t\tprint(collection);\n\t\twriter.println();\n\t}\n\n\tpublic void printLine() {\n\t\twriter.println();\n\t}\n\n\tpublic void printLine(Object... objects) {\n\t\tprint(objects);\n\t\twriter.println();\n\t}\n\n\tpublic void print(char i) {\n\t\twriter.print(i);\n\t}\n\n\tpublic void printLine(char i) {\n\t\twriter.println(i);\n\t}\n\n\tpublic void printLine(char[] array) {\n\t\twriter.println(array);\n\t}\n\n\tpublic void printFormat(String format, Object... objects) {\n\t\twriter.printf(format, objects);\n\t}\n\n\tpublic void close() {\n\t\twriter.close();\n\t}\n\n\tpublic void flush() {\n\t\twriter.flush();\n\t}\n\n\tpublic void print(long i) {\n\t\twriter.print(i);\n\t}\n\n\tpublic void printLine(long i) {\n\t\twriter.println(i);\n\t}\n\n\tpublic void print(int i) {\n\t\twriter.print(i);\n\t}\n\n\tpublic void printLine(int i) {\n\t\twriter.println(i);\n\t}\n}\n\nclass InputReader {\n\n\tprivate InputStream stream;\n\tprivate byte[] buf = new byte[1024];\n\tprivate int curChar;\n\tprivate int numChars;\n\tprivate SpaceCharFilter filter;\n\n\tpublic InputReader(InputStream stream) {\n\t\tthis.stream = stream;\n\t}\n\n\tpublic int read() {\n\t\tif (numChars == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (curChar >= numChars) {\n\t\t\tcurChar = 0;\n\t\t\ttry {\n\t\t\t\tnumChars = stream.read(buf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (numChars <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buf[curChar++];\n\t}\n\n\tpublic int peek() {\n\t\tif (numChars == -1)\n\t\t\treturn -1;\n\t\tif (curChar >= numChars) {\n\t\t\tcurChar = 0;\n\t\t\ttry {\n\t\t\t\tnumChars = stream.read(buf);\n\t\t\t} catch (IOException e) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tif (numChars <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buf[curChar];\n\t}\n\n\tpublic int readInt() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tint res = 0;\n\t\tdo {\n\t\t\tif (c < '0' || c > '9')\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n\n\tpublic long readLong() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tlong res = 0;\n\t\tdo {\n\t\t\tif (c < '0' || c > '9')\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n\n\tpublic String readString() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tStringBuilder res = new StringBuilder();\n\t\tdo {\n\t\t\tif (Character.isValidCodePoint(c))\n\t\t\t\tres.appendCodePoint(c);\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res.toString();\n\t}\n\n\tpublic boolean isSpaceChar(int c) {\n\t\tif (filter != null)\n\t\t\treturn filter.isSpaceChar(c);\n\t\treturn isWhitespace(c);\n\t}\n\n\tpublic static boolean isWhitespace(int c) {\n\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t}\n\n\tprivate String readLine0() {\n\t\tStringBuilder buf = new StringBuilder();\n\t\tint c = read();\n\t\twhile (c != '\\n' && c != -1) {\n\t\t\tif (c != '\\r')\n\t\t\t\tbuf.appendCodePoint(c);\n\t\t\tc = read();\n\t\t}\n\t\treturn buf.toString();\n\t}\n\n\tpublic String readLine() {\n\t\tString s = readLine0();\n\t\twhile (s.trim().length() == 0)\n\t\t\ts = readLine0();\n\t\treturn s;\n\t}\n\n\tpublic String readLine(boolean ignoreEmptyLines) {\n\t\tif (ignoreEmptyLines)\n\t\t\treturn readLine();\n\t\telse\n\t\t\treturn readLine0();\n\t}\n\n\tpublic BigInteger readBigInteger() {\n\t\ttry {\n\t\t\treturn new BigInteger(readString());\n\t\t} catch (NumberFormatException e) {\n\t\t\tthrow new InputMismatchException();\n\t\t}\n\t}\n\n\tpublic char readCharacter() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\treturn (char) c;\n\t}\n\n\tpublic double readDouble() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tdouble res = 0;\n\t\twhile (!isSpaceChar(c) && c != '.') {\n\t\t\tif (c == 'e' || c == 'E')\n\t\t\t\treturn res * Math.pow(10, readInt());\n\t\t\tif (c < '0' || c > '9')\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t}\n\t\tif (c == '.') {\n\t\t\tc = read();\n\t\t\tdouble m = 1;\n\t\t\twhile (!isSpaceChar(c)) {\n\t\t\t\tif (c == 'e' || c == 'E')\n\t\t\t\t\treturn res * Math.pow(10, readInt());\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tm /= 10;\n\t\t\t\tres += (c - '0') * m;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t}\n\t\treturn res * sgn;\n\t}\n\n\tpublic boolean isExhausted() {\n\t\tint value;\n\t\twhile (isSpaceChar(value = peek()) && value != -1)\n\t\t\tread();\n\t\treturn value == -1;\n\t}\n\n\tpublic String next() {\n\t\treturn readString();\n\t}\n\n\tpublic SpaceCharFilter getFilter() {\n\t\treturn filter;\n\t}\n\n\tpublic void setFilter(SpaceCharFilter filter) {\n\t\tthis.filter = filter;\n\t}\n\n\tpublic interface SpaceCharFilter {\n\t\tpublic boolean isSpaceChar(int ch);\n\t}\n}\n\nclass IOUtils {\n\tpublic static Pair<Integer, Integer> readIntPair(InputReader in) {\n\t\tint first = in.readInt();\n\t\tint second = in.readInt();\n\t\treturn Pair.makePair(first, second);\n\t}\n\n\tpublic static Pair<Long, Long> readLongPair(InputReader in) {\n\t\tlong first = in.readLong();\n\t\tlong second = in.readLong();\n\t\treturn Pair.makePair(first, second);\n\t}\n\n\tpublic static int[] readIntArray(InputReader in, int size) {\n\t\tint[] array = new int[size];\n\t\tfor (int i = 0; i < size; i++)\n\t\t\tarray[i] = in.readInt();\n\t\treturn array;\n\t}\n\n\tpublic static long[] readLongArray(InputReader in, int size) {\n\t\tlong[] array = new long[size];\n\t\tfor (int i = 0; i < size; i++)\n\t\t\tarray[i] = in.readLong();\n\t\treturn array;\n\t}\n\n\tpublic static double[] readDoubleArray(InputReader in, int size) {\n\t\tdouble[] array = new double[size];\n\t\tfor (int i = 0; i < size; i++)\n\t\t\tarray[i] = in.readDouble();\n\t\treturn array;\n\t}\n\n\tpublic static String[] readStringArray(InputReader in, int size) {\n\t\tString[] array = new String[size];\n\t\tfor (int i = 0; i < size; i++)\n\t\t\tarray[i] = in.readString();\n\t\treturn array;\n\t}\n\n\tpublic static char[] readCharArray(InputReader in, int size) {\n\t\tchar[] array = new char[size];\n\t\tfor (int i = 0; i < size; i++)\n\t\t\tarray[i] = in.readCharacter();\n\t\treturn array;\n\t}\n\n\tpublic static Pair<Integer, Integer>[] readIntPairArray(InputReader in,\n\t\t\tint size) {\n\t\t@SuppressWarnings({ \"unchecked\" })\n\t\tPair<Integer, Integer>[] result = new Pair[size];\n\t\tfor (int i = 0; i < size; i++)\n\t\t\tresult[i] = readIntPair(in);\n\t\treturn result;\n\t}\n\n\tpublic static Pair<Long, Long>[] readLongPairArray(InputReader in, int size) {\n\t\t@SuppressWarnings({ \"unchecked\" })\n\t\tPair<Long, Long>[] result = new Pair[size];\n\t\tfor (int i = 0; i < size; i++)\n\t\t\tresult[i] = readLongPair(in);\n\t\treturn result;\n\t}\n\n\tpublic static void readIntArrays(InputReader in, int[]... arrays) {\n\t\tfor (int i = 0; i < arrays[0].length; i++) {\n\t\t\tfor (int j = 0; j < arrays.length; j++)\n\t\t\t\tarrays[j][i] = in.readInt();\n\t\t}\n\t}\n\n\tpublic static void readLongArrays(InputReader in, long[]... arrays) {\n\t\tfor (int i = 0; i < arrays[0].length; i++) {\n\t\t\tfor (int j = 0; j < arrays.length; j++)\n\t\t\t\tarrays[j][i] = in.readLong();\n\t\t}\n\t}\n\n\tpublic static void readDoubleArrays(InputReader in, double[]... arrays) {\n\t\tfor (int i = 0; i < arrays[0].length; i++) {\n\t\t\tfor (int j = 0; j < arrays.length; j++)\n\t\t\t\tarrays[j][i] = in.readDouble();\n\t\t}\n\t}\n\n\tpublic static char[][] readTable(InputReader in, int rowCount,\n\t\t\tint columnCount) {\n\t\tchar[][] table = new char[rowCount][];\n\t\tfor (int i = 0; i < rowCount; i++)\n\t\t\ttable[i] = readCharArray(in, columnCount);\n\t\treturn table;\n\t}\n\n\tpublic static int[][] readIntTable(InputReader in, int rowCount,\n\t\t\tint columnCount) {\n\t\tint[][] table = new int[rowCount][];\n\t\tfor (int i = 0; i < rowCount; i++)\n\t\t\ttable[i] = readIntArray(in, columnCount);\n\t\treturn table;\n\t}\n\n\tpublic static double[][] readDoubleTable(InputReader in, int rowCount,\n\t\t\tint columnCount) {\n\t\tdouble[][] table = new double[rowCount][];\n\t\tfor (int i = 0; i < rowCount; i++)\n\t\t\ttable[i] = readDoubleArray(in, columnCount);\n\t\treturn table;\n\t}\n\n\tpublic static long[][] readLongTable(InputReader in, int rowCount,\n\t\t\tint columnCount) {\n\t\tlong[][] table = new long[rowCount][];\n\t\tfor (int i = 0; i < rowCount; i++)\n\t\t\ttable[i] = readLongArray(in, columnCount);\n\t\treturn table;\n\t}\n\n\tpublic static String[][] readStringTable(InputReader in, int rowCount,\n\t\t\tint columnCount) {\n\t\tString[][] table = new String[rowCount][];\n\t\tfor (int i = 0; i < rowCount; i++)\n\t\t\ttable[i] = readStringArray(in, columnCount);\n\t\treturn table;\n\t}\n\n\tpublic static String readText(InputReader in) {\n\t\tStringBuilder result = new StringBuilder();\n\t\twhile (true) {\n\t\t\tint character = in.read();\n\t\t\tif (character == '\\r')\n\t\t\t\tcontinue;\n\t\t\tif (character == -1)\n\t\t\t\tbreak;\n\t\t\tresult.append((char) character);\n\t\t}\n\t\treturn result.toString();\n\t}\n\n\tpublic static void readStringArrays(InputReader in, String[]... arrays) {\n\t\tfor (int i = 0; i < arrays[0].length; i++) {\n\t\t\tfor (int j = 0; j < arrays.length; j++)\n\t\t\t\tarrays[j][i] = in.readString();\n\t\t}\n\t}\n\n\tpublic static void printTable(OutputWriter out, char[][] table) {\n\t\tfor (char[] row : table)\n\t\t\tout.printLine(new String(row));\n\t}\n}\n\nclass Pair<U, V> implements Comparable<Pair<U, V>> {\n\tpublic final U first;\n\tpublic final V second;\n\n\tpublic static <U, V> Pair<U, V> makePair(U first, V second) {\n\t\treturn new Pair<U, V>(first, second);\n\t}\n\n\tprivate Pair(U first, V second) {\n\t\tthis.first = first;\n\t\tthis.second = second;\n\t}\n\n\t@Override\n\tpublic boolean equals(Object o) {\n\t\tif (this == o)\n\t\t\treturn true;\n\t\tif (o == null || getClass() != o.getClass())\n\t\t\treturn false;\n\n\t\tPair<?, ?> pair = (Pair<?, ?>) o;\n\n\t\treturn !(first != null ? !first.equals(pair.first) : pair.first != null)\n\t\t\t\t&& !(second != null ? !second.equals(pair.second)\n\t\t\t\t\t\t: pair.second != null);\n\n\t}\n\n\t@Override\n\tpublic int hashCode() {\n\t\tint result = first != null ? first.hashCode() : 0;\n\t\tresult = 31 * result + (second != null ? second.hashCode() : 0);\n\t\treturn result;\n\t}\n\n\tpublic Pair<V, U> swap() {\n\t\treturn makePair(second, first);\n\t}\n\n\t@Override\n\tpublic String toString() {\n\t\treturn \"(\" + first + \",\" + second + \")\";\n\t}\n\n\t@SuppressWarnings({ \"unchecked\" })\n\tpublic int compareTo(Pair<U, V> o) {\n\t\tint value = ((Comparable<U>) first).compareTo(o.first);\n\t\tif (value != 0)\n\t\t\treturn value;\n\t\treturn ((Comparable<V>) second).compareTo(o.second);\n\t}\n}\n\nclass BidirectionalGraph extends Graph {\n\tpublic int[] transposedEdge;\n\n\tpublic BidirectionalGraph(int vertexCount) {\n\t\tthis(vertexCount, vertexCount);\n\t}\n\n\tpublic BidirectionalGraph(int vertexCount, int edgeCapacity) {\n\t\tsuper(vertexCount, 2 * edgeCapacity);\n\t\ttransposedEdge = new int[2 * edgeCapacity];\n\t}\n\n\tpublic static BidirectionalGraph createGraph(int vertexCount, int[] from,\n\t\t\tint[] to) {\n\t\tBidirectionalGraph graph = new BidirectionalGraph(vertexCount,\n\t\t\t\tfrom.length);\n\t\tfor (int i = 0; i < from.length; i++)\n\t\t\tgraph.addSimpleEdge(from[i], to[i]);\n\t\treturn graph;\n\t}\n\n\tpublic static BidirectionalGraph createWeightedGraph(int vertexCount,\n\t\t\tint[] from, int[] to, long[] weight) {\n\t\tBidirectionalGraph graph = new BidirectionalGraph(vertexCount,\n\t\t\t\tfrom.length);\n\t\tfor (int i = 0; i < from.length; i++)\n\t\t\tgraph.addWeightedEdge(from[i], to[i], weight[i]);\n\t\treturn graph;\n\t}\n\n\tpublic static BidirectionalGraph createFlowGraph(int vertexCount,\n\t\t\tint[] from, int[] to, long[] capacity) {\n\t\tBidirectionalGraph graph = new BidirectionalGraph(vertexCount,\n\t\t\t\tfrom.length * 2);\n\t\tfor (int i = 0; i < from.length; i++)\n\t\t\tgraph.addFlowEdge(from[i], to[i], capacity[i]);\n\t\treturn graph;\n\t}\n\n\tpublic static BidirectionalGraph createFlowWeightedGraph(int vertexCount,\n\t\t\tint[] from, int[] to, long[] weight, long[] capacity) {\n\t\tBidirectionalGraph graph = new BidirectionalGraph(vertexCount,\n\t\t\t\tfrom.length * 2);\n\t\tfor (int i = 0; i < from.length; i++)\n\t\t\tgraph.addFlowWeightedEdge(from[i], to[i], weight[i], capacity[i]);\n\t\treturn graph;\n\t}\n\n\t@Override\n\tpublic int addEdge(int fromID, int toID, long weight, long capacity,\n\t\t\tint reverseEdge) {\n\t\tint lastEdgeCount = edgeCount;\n\t\tsuper.addEdge(fromID, toID, weight, capacity, reverseEdge);\n\t\tsuper.addEdge(toID, fromID, weight, capacity, reverseEdge == -1 ? -1\n\t\t\t\t: reverseEdge + 1);\n\t\tthis.transposedEdge[lastEdgeCount] = lastEdgeCount + 1;\n\t\tthis.transposedEdge[lastEdgeCount + 1] = lastEdgeCount;\n\t\treturn lastEdgeCount;\n\t}\n\n\t@Override\n\tprotected int entriesPerEdge() {\n\t\treturn 2;\n\t}\n\n\t@Override\n\tpublic final int transposed(int id) {\n\t\treturn transposedEdge[id];\n\t}\n\n\t@Override\n\tprotected void ensureEdgeCapacity(int size) {\n\t\tif (size > edgeCapacity()) {\n\t\t\tsuper.ensureEdgeCapacity(size);\n\t\t\ttransposedEdge = resize(transposedEdge, edgeCapacity());\n\t\t}\n\t}\n}\n\nclass Graph {\n\tpublic static final int REMOVED_BIT = 0;\n\n\tprotected int vertexCount;\n\tprotected int edgeCount;\n\n\tprivate int[] firstOutbound;\n\tprivate int[] firstInbound;\n\n\tprivate Edge[] edges;\n\tprivate int[] nextInbound;\n\tprivate int[] nextOutbound;\n\tprivate int[] from;\n\tprivate int[] to;\n\tprivate long[] weight;\n\tprivate long[] capacity;\n\tprivate int[] reverseEdge;\n\tprivate int[] flags;\n\n\tpublic Graph(int vertexCount) {\n\t\tthis(vertexCount, vertexCount);\n\t}\n\n\tpublic Graph(int vertexCount, int edgeCapacity) {\n\t\tthis.vertexCount = vertexCount;\n\t\tfirstOutbound = new int[vertexCount];\n\t\tArrays.fill(firstOutbound, -1);\n\n\t\tfrom = new int[edgeCapacity];\n\t\tto = new int[edgeCapacity];\n\t\tnextOutbound = new int[edgeCapacity];\n\t\tflags = new int[edgeCapacity];\n\t}\n\n\tpublic static Graph createGraph(int vertexCount, int[] from, int[] to) {\n\t\tGraph graph = new Graph(vertexCount, from.length);\n\t\tfor (int i = 0; i < from.length; i++)\n\t\t\tgraph.addSimpleEdge(from[i], to[i]);\n\t\treturn graph;\n\t}\n\n\tpublic static Graph createWeightedGraph(int vertexCount, int[] from,\n\t\t\tint[] to, long[] weight) {\n\t\tGraph graph = new Graph(vertexCount, from.length);\n\t\tfor (int i = 0; i < from.length; i++)\n\t\t\tgraph.addWeightedEdge(from[i], to[i], weight[i]);\n\t\treturn graph;\n\t}\n\n\tpublic static Graph createFlowGraph(int vertexCount, int[] from, int[] to,\n\t\t\tlong[] capacity) {\n\t\tGraph graph = new Graph(vertexCount, from.length * 2);\n\t\tfor (int i = 0; i < from.length; i++)\n\t\t\tgraph.addFlowEdge(from[i], to[i], capacity[i]);\n\t\treturn graph;\n\t}\n\n\tpublic static Graph createFlowWeightedGraph(int vertexCount, int[] from,\n\t\t\tint[] to, long[] weight, long[] capacity) {\n\t\tGraph graph = new Graph(vertexCount, from.length * 2);\n\t\tfor (int i = 0; i < from.length; i++)\n\t\t\tgraph.addFlowWeightedEdge(from[i], to[i], weight[i], capacity[i]);\n\t\treturn graph;\n\t}\n\n\tpublic static Graph createTree(int[] parent) {\n\t\tGraph graph = new Graph(parent.length + 1, parent.length);\n\t\tfor (int i = 0; i < parent.length; i++)\n\t\t\tgraph.addSimpleEdge(parent[i], i + 1);\n\t\treturn graph;\n\t}\n\n\tpublic int addEdge(int fromID, int toID, long weight, long capacity,\n\t\t\tint reverseEdge) {\n\t\tensureEdgeCapacity(edgeCount + 1);\n\t\tif (firstOutbound[fromID] != -1)\n\t\t\tnextOutbound[edgeCount] = firstOutbound[fromID];\n\t\telse\n\t\t\tnextOutbound[edgeCount] = -1;\n\t\tfirstOutbound[fromID] = edgeCount;\n\t\tif (firstInbound != null) {\n\t\t\tif (firstInbound[toID] != -1)\n\t\t\t\tnextInbound[edgeCount] = firstInbound[toID];\n\t\t\telse\n\t\t\t\tnextInbound[edgeCount] = -1;\n\t\t\tfirstInbound[toID] = edgeCount;\n\t\t}\n\t\tthis.from[edgeCount] = fromID;\n\t\tthis.to[edgeCount] = toID;\n\t\tif (capacity != 0) {\n\t\t\tif (this.capacity == null)\n\t\t\t\tthis.capacity = new long[from.length];\n\t\t\tthis.capacity[edgeCount] = capacity;\n\t\t}\n\t\tif (weight != 0) {\n\t\t\tif (this.weight == null)\n\t\t\t\tthis.weight = new long[from.length];\n\t\t\tthis.weight[edgeCount] = weight;\n\t\t}\n\t\tif (reverseEdge != -1) {\n\t\t\tif (this.reverseEdge == null) {\n\t\t\t\tthis.reverseEdge = new int[from.length];\n\t\t\t\tArrays.fill(this.reverseEdge, 0, edgeCount, -1);\n\t\t\t}\n\t\t\tthis.reverseEdge[edgeCount] = reverseEdge;\n\t\t}\n\t\tif (edges != null)\n\t\t\tedges[edgeCount] = createEdge(edgeCount);\n\t\treturn edgeCount++;\n\t}\n\n\tprotected final GraphEdge createEdge(int id) {\n\t\treturn new GraphEdge(id);\n\t}\n\n\tpublic final int addFlowWeightedEdge(int from, int to, long weight,\n\t\t\tlong capacity) {\n\t\tif (capacity == 0) {\n\t\t\treturn addEdge(from, to, weight, 0, -1);\n\t\t} else {\n\t\t\tint lastEdgeCount = edgeCount;\n\t\t\taddEdge(to, from, -weight, 0, lastEdgeCount + entriesPerEdge());\n\t\t\treturn addEdge(from, to, weight, capacity, lastEdgeCount);\n\t\t}\n\t}\n\n\tprotected int entriesPerEdge() {\n\t\treturn 1;\n\t}\n\n\tpublic final int addFlowEdge(int from, int to, long capacity) {\n\t\treturn addFlowWeightedEdge(from, to, 0, capacity);\n\t}\n\n\tpublic final int addWeightedEdge(int from, int to, long weight) {\n\t\treturn addFlowWeightedEdge(from, to, weight, 0);\n\t}\n\n\tpublic final int addSimpleEdge(int from, int to) {\n\t\treturn addWeightedEdge(from, to, 0);\n\t}\n\n\tpublic final int vertexCount() {\n\t\treturn vertexCount;\n\t}\n\n\tpublic final int edgeCount() {\n\t\treturn edgeCount;\n\t}\n\n\tprotected final int edgeCapacity() {\n\t\treturn from.length;\n\t}\n\n\tpublic final Edge edge(int id) {\n\t\tinitEdges();\n\t\treturn edges[id];\n\t}\n\n\tpublic final int firstOutbound(int vertex) {\n\t\tint id = firstOutbound[vertex];\n\t\twhile (id != -1 && isRemoved(id))\n\t\t\tid = nextOutbound[id];\n\t\treturn id;\n\t}\n\n\tpublic final int nextOutbound(int id) {\n\t\tid = nextOutbound[id];\n\t\twhile (id != -1 && isRemoved(id))\n\t\t\tid = nextOutbound[id];\n\t\treturn id;\n\t}\n\n\tpublic final int firstInbound(int vertex) {\n\t\tinitInbound();\n\t\tint id = firstInbound[vertex];\n\t\twhile (id != -1 && isRemoved(id))\n\t\t\tid = nextInbound[id];\n\t\treturn id;\n\t}\n\n\tpublic final int nextInbound(int id) {\n\t\tinitInbound();\n\t\tid = nextInbound[id];\n\t\twhile (id != -1 && isRemoved(id))\n\t\t\tid = nextInbound[id];\n\t\treturn id;\n\t}\n\n\tpublic final int source(int id) {\n\t\treturn from[id];\n\t}\n\n\tpublic final int destination(int id) {\n\t\treturn to[id];\n\t}\n\n\tpublic final long weight(int id) {\n\t\tif (weight == null)\n\t\t\treturn 0;\n\t\treturn weight[id];\n\t}\n\n\tpublic final long capacity(int id) {\n\t\tif (capacity == null)\n\t\t\treturn 0;\n\t\treturn capacity[id];\n\t}\n\n\tpublic final long flow(int id) {\n\t\tif (reverseEdge == null)\n\t\t\treturn 0;\n\t\treturn capacity[reverseEdge[id]];\n\t}\n\n\tpublic final void pushFlow(int id, long flow) {\n\t\tif (flow == 0)\n\t\t\treturn;\n\t\tif (flow > 0) {\n\t\t\tif (capacity(id) < flow)\n\t\t\t\tthrow new IllegalArgumentException(\"Not enough capacity\");\n\t\t} else {\n\t\t\tif (flow(id) < -flow)\n\t\t\t\tthrow new IllegalArgumentException(\"Not enough capacity\");\n\t\t}\n\t\tcapacity[id] -= flow;\n\t\tcapacity[reverseEdge[id]] += flow;\n\t}\n\n\tpublic int transposed(int id) {\n\t\treturn -1;\n\t}\n\n\tpublic final int reverse(int id) {\n\t\tif (reverseEdge == null)\n\t\t\treturn -1;\n\t\treturn reverseEdge[id];\n\t}\n\n\tpublic final void addVertices(int count) {\n\t\tensureVertexCapacity(vertexCount + count);\n\t\tArrays.fill(firstOutbound, vertexCount, vertexCount + count, -1);\n\t\tif (firstInbound != null)\n\t\t\tArrays.fill(firstInbound, vertexCount, vertexCount + count, -1);\n\t\tvertexCount += count;\n\t}\n\n\tprotected final void initEdges() {\n\t\tif (edges == null) {\n\t\t\tedges = new Edge[from.length];\n\t\t\tfor (int i = 0; i < edgeCount; i++)\n\t\t\t\tedges[i] = createEdge(i);\n\t\t}\n\t}\n\n\tpublic final void removeVertex(int vertex) {\n\t\tint id = firstOutbound[vertex];\n\t\twhile (id != -1) {\n\t\t\tremoveEdge(id);\n\t\t\tid = nextOutbound[id];\n\t\t}\n\t\tinitInbound();\n\t\tid = firstInbound[vertex];\n\t\twhile (id != -1) {\n\t\t\tremoveEdge(id);\n\t\t\tid = nextInbound[id];\n\t\t}\n\t}\n\n\tprivate void initInbound() {\n\t\tif (firstInbound == null) {\n\t\t\tfirstInbound = new int[firstOutbound.length];\n\t\t\tArrays.fill(firstInbound, 0, vertexCount, -1);\n\t\t\tnextInbound = new int[from.length];\n\t\t\tfor (int i = 0; i < edgeCount; i++) {\n\t\t\t\tnextInbound[i] = firstInbound[to[i]];\n\t\t\t\tfirstInbound[to[i]] = i;\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic final boolean flag(int id, int bit) {\n\t\treturn (flags[id] >> bit & 1) != 0;\n\t}\n\n\tpublic final void setFlag(int id, int bit) {\n\t\tflags[id] |= 1 << bit;\n\t}\n\n\tpublic final void removeFlag(int id, int bit) {\n\t\tflags[id] &= -1 - (1 << bit);\n\t}\n\n\tpublic final void removeEdge(int id) {\n\t\tsetFlag(id, REMOVED_BIT);\n\t}\n\n\tpublic final void restoreEdge(int id) {\n\t\tremoveFlag(id, REMOVED_BIT);\n\t}\n\n\tpublic final boolean isRemoved(int id) {\n\t\treturn flag(id, REMOVED_BIT);\n\t}\n\n\tpublic final Iterable<Edge> outbound(final int id) {\n\t\tinitEdges();\n\t\treturn new Iterable<Edge>() {\n\t\t\tpublic Iterator<Edge> iterator() {\n\t\t\t\treturn new EdgeIterator(id, firstOutbound, nextOutbound);\n\t\t\t}\n\t\t};\n\t}\n\n\tpublic final Iterable<Edge> inbound(final int id) {\n\t\tinitEdges();\n\t\tinitInbound();\n\t\treturn new Iterable<Edge>() {\n\t\t\tpublic Iterator<Edge> iterator() {\n\t\t\t\treturn new EdgeIterator(id, firstInbound, nextInbound);\n\t\t\t}\n\t\t};\n\t}\n\n\tprotected void ensureEdgeCapacity(int size) {\n\t\tif (from.length < size) {\n\t\t\tint newSize = Math.max(size, 2 * from.length);\n\t\t\tif (edges != null)\n\t\t\t\tedges = resize(edges, newSize);\n\t\t\tfrom = resize(from, newSize);\n\t\t\tto = resize(to, newSize);\n\t\t\tnextOutbound = resize(nextOutbound, newSize);\n\t\t\tif (nextInbound != null)\n\t\t\t\tnextInbound = resize(nextInbound, newSize);\n\t\t\tif (weight != null)\n\t\t\t\tweight = resize(weight, newSize);\n\t\t\tif (capacity != null)\n\t\t\t\tcapacity = resize(capacity, newSize);\n\t\t\tif (reverseEdge != null)\n\t\t\t\treverseEdge = resize(reverseEdge, newSize);\n\t\t\tflags = resize(flags, newSize);\n\t\t}\n\t}\n\n\tprivate void ensureVertexCapacity(int size) {\n\t\tif (firstOutbound.length < size) {\n\t\t\tint newSize = Math.max(size, 2 * from.length);\n\t\t\tfirstOutbound = resize(firstOutbound, newSize);\n\t\t\tif (firstInbound != null)\n\t\t\t\tfirstInbound = resize(firstInbound, newSize);\n\t\t}\n\t}\n\n\tprotected final int[] resize(int[] array, int size) {\n\t\tint[] newArray = new int[size];\n\t\tSystem.arraycopy(array, 0, newArray, 0, array.length);\n\t\treturn newArray;\n\t}\n\n\tprivate long[] resize(long[] array, int size) {\n\t\tlong[] newArray = new long[size];\n\t\tSystem.arraycopy(array, 0, newArray, 0, array.length);\n\t\treturn newArray;\n\t}\n\n\tprivate Edge[] resize(Edge[] array, int size) {\n\t\tEdge[] newArray = new Edge[size];\n\t\tSystem.arraycopy(array, 0, newArray, 0, array.length);\n\t\treturn newArray;\n\t}\n\n\tpublic final boolean isSparse() {\n\t\treturn vertexCount == 0 || edgeCount * 20 / vertexCount <= vertexCount;\n\t}\n\n\tprotected class GraphEdge implements Edge {\n\t\tprotected int id;\n\n\t\tprotected GraphEdge(int id) {\n\t\t\tthis.id = id;\n\t\t}\n\n\t\tpublic int getSource() {\n\t\t\treturn source(id);\n\t\t}\n\n\t\tpublic int getDestination() {\n\t\t\treturn destination(id);\n\t\t}\n\n\t\tpublic long getWeight() {\n\t\t\treturn weight(id);\n\t\t}\n\n\t\tpublic long getCapacity() {\n\t\t\treturn capacity(id);\n\t\t}\n\n\t\tpublic long getFlow() {\n\t\t\treturn flow(id);\n\t\t}\n\n\t\tpublic void pushFlow(long flow) {\n\t\t\tGraph.this.pushFlow(id, flow);\n\t\t}\n\n\t\tpublic boolean getFlag(int bit) {\n\t\t\treturn flag(id, bit);\n\t\t}\n\n\t\tpublic void setFlag(int bit) {\n\t\t\tGraph.this.setFlag(id, bit);\n\t\t}\n\n\t\tpublic void removeFlag(int bit) {\n\t\t\tGraph.this.removeFlag(id, bit);\n\t\t}\n\n\t\tpublic int getTransposedID() {\n\t\t\treturn transposed(id);\n\t\t}\n\n\t\tpublic Edge getTransposedEdge() {\n\t\t\tint reverseID = getTransposedID();\n\t\t\tif (reverseID == -1)\n\t\t\t\treturn null;\n\t\t\tinitEdges();\n\t\t\treturn edge(reverseID);\n\t\t}\n\n\t\tpublic int getReverseID() {\n\t\t\treturn reverse(id);\n\t\t}\n\n\t\tpublic Edge getReverseEdge() {\n\t\t\tint reverseID = getReverseID();\n\t\t\tif (reverseID == -1)\n\t\t\t\treturn null;\n\t\t\tinitEdges();\n\t\t\treturn edge(reverseID);\n\t\t}\n\n\t\tpublic int getID() {\n\t\t\treturn id;\n\t\t}\n\n\t\tpublic void remove() {\n\t\t\tremoveEdge(id);\n\t\t}\n\n\t\tpublic void restore() {\n\t\t\trestoreEdge(id);\n\t\t}\n\t}\n\n\tpublic class EdgeIterator implements Iterator<Edge> {\n\t\tprivate int edgeID;\n\t\tprivate final int[] next;\n\t\tprivate int lastID = -1;\n\n\t\tpublic EdgeIterator(int id, int[] first, int[] next) {\n\t\t\tthis.next = next;\n\t\t\tedgeID = nextEdge(first[id]);\n\t\t}\n\n\t\tprivate int nextEdge(int id) {\n\t\t\twhile (id != -1 && isRemoved(id))\n\t\t\t\tid = next[id];\n\t\t\treturn id;\n\t\t}\n\n\t\tpublic boolean hasNext() {\n\t\t\treturn edgeID != -1;\n\t\t}\n\n\t\tpublic Edge next() {\n\t\t\tif (edgeID == -1)\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tlastID = edgeID;\n\t\t\tedgeID = nextEdge(next[lastID]);\n\t\t\treturn edges[lastID];\n\t\t}\n\n\t\tpublic void remove() {\n\t\t\tif (lastID == -1)\n\t\t\t\tthrow new IllegalStateException();\n\t\t\tremoveEdge(lastID);\n\t\t\tlastID = -1;\n\t\t}\n\t}\n\n}\n\ninterface Edge {\n\tpublic int getSource();\n\n\tpublic int getDestination();\n\n\tpublic long getWeight();\n\n\tpublic long getCapacity();\n\n\tpublic long getFlow();\n\n\tpublic void pushFlow(long flow);\n\n\tpublic boolean getFlag(int bit);\n\n\tpublic void setFlag(int bit);\n\n\tpublic void removeFlag(int bit);\n\n\tpublic int getTransposedID();\n\n\tpublic Edge getTransposedEdge();\n\n\tpublic int getReverseID();\n\n\tpublic Edge getReverseEdge();\n\n\tpublic int getID();\n\n\tpublic void remove();\n\n\tpublic void restore();\n}\n\nclass MiscUtils {\n\tpublic static final int[] DX4 = { 1, 0, -1, 0 };\n\tpublic static final int[] DY4 = { 0, -1, 0, 1 };\n\tpublic static final int[] DX8 = { 1, 1, 1, 0, -1, -1, -1, 0 };\n\tpublic static final int[] DY8 = { -1, 0, 1, 1, 1, 0, -1, -1 };\n\tpublic static final int[] DX_KNIGHT = { 2, 1, -1, -2, -2, -1, 1, 2 };\n\tpublic static final int[] DY_KNIGHT = { 1, 2, 2, 1, -1, -2, -2, -1 };\n\n\tprivate static final String[] ROMAN_TOKENS = { \"M\", \"CM\", \"D\", \"CD\", \"C\",\n\t\t\t\"XC\", \"L\", \"XL\", \"X\", \"IX\", \"V\", \"IV\", \"I\" };\n\tprivate static final int[] ROMAN_VALUES = { 1000, 900, 500, 400, 100, 90,\n\t\t\t50, 40, 10, 9, 5, 4, 1 };\n\n\tpublic static long josephProblem(long n, int k) {\n\t\tif (n == 1)\n\t\t\treturn 0;\n\t\tif (k == 1)\n\t\t\treturn n - 1;\n\t\tif (k > n)\n\t\t\treturn (josephProblem(n - 1, k) + k) % n;\n\t\tlong count = n / k;\n\t\tlong result = josephProblem(n - count, k);\n\t\tresult -= n % k;\n\t\tif (result < 0)\n\t\t\tresult += n;\n\t\telse\n\t\t\tresult += result / (k - 1);\n\t\treturn result;\n\t}\n\n\tpublic static boolean isValidCell(int row, int column, int rowCount,\n\t\t\tint columnCount) {\n\t\treturn row >= 0 && row < rowCount && column >= 0\n\t\t\t\t&& column < columnCount;\n\t}\n\n\tpublic static List<Integer> getPath(int[] last, int destination) {\n\t\tList<Integer> path = new ArrayList<Integer>();\n\t\twhile (destination != -1) {\n\t\t\tpath.add(destination);\n\t\t\tdestination = last[destination];\n\t\t}\n\t\tCollections.reverse(path);\n\t\treturn path;\n\t}\n\n\tpublic static List<Integer> getPath(int[][] lastIndex,\n\t\t\tint[][] lastPathNumber, int destination, int pathNumber) {\n\t\tList<Integer> path = new ArrayList<Integer>();\n\t\twhile (destination != -1 || pathNumber != 0) {\n\t\t\tpath.add(destination);\n\t\t\tint nextDestination = lastIndex[destination][pathNumber];\n\t\t\tpathNumber = lastPathNumber[destination][pathNumber];\n\t\t\tdestination = nextDestination;\n\t\t}\n\t\tCollections.reverse(path);\n\t\treturn path;\n\t}\n\n\tpublic static long maximalRectangleSum(long[][] array) {\n\t\tint n = array.length;\n\t\tint m = array[0].length;\n\t\tlong[][] partialSums = new long[n + 1][m + 1];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tlong rowSum = 0;\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\trowSum += array[i][j];\n\t\t\t\tpartialSums[i + 1][j + 1] = partialSums[i][j + 1] + rowSum;\n\t\t\t}\n\t\t}\n\t\tlong result = Long.MIN_VALUE;\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tfor (int j = i; j < m; j++) {\n\t\t\t\tlong minPartialSum = 0;\n\t\t\t\tfor (int k = 1; k <= n; k++) {\n\t\t\t\t\tlong current = partialSums[k][j + 1] - partialSums[k][i];\n\t\t\t\t\tresult = Math.max(result, current - minPartialSum);\n\t\t\t\t\tminPartialSum = Math.min(minPartialSum, current);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static int parseIP(String ip) {\n\t\tString[] components = ip.split(\"[.]\");\n\t\tint result = 0;\n\t\tfor (int i = 0; i < 4; i++)\n\t\t\tresult += (1 << (24 - 8 * i)) * Integer.parseInt(components[i]);\n\t\treturn result;\n\t}\n\n\tpublic static String buildIP(int mask) {\n\t\tStringBuilder result = new StringBuilder();\n\t\tfor (int i = 0; i < 4; i++) {\n\t\t\tif (i != 0)\n\t\t\t\tresult.append('.');\n\t\t\tresult.append(mask >> (24 - 8 * i) & 255);\n\t\t}\n\t\treturn result.toString();\n\t}\n\n\tpublic static long binarySearch(long from, long to,\n\t\t\tFunction<Long, Boolean> function) {\n\t\twhile (from < to) {\n\t\t\tlong argument = from + (to - from) / 2;\n\t\t\tif (function.value(argument))\n\t\t\t\tto = argument;\n\t\t\telse\n\t\t\t\tfrom = argument + 1;\n\t\t}\n\t\treturn from;\n\t}\n\n\tpublic static <T> boolean equals(T first, T second) {\n\t\treturn first == null && second == null || first != null\n\t\t\t\t&& first.equals(second);\n\t}\n\n\tpublic static boolean isVowel(char ch) {\n\t\tch = Character.toUpperCase(ch);\n\t\treturn ch == 'A' || ch == 'E' || ch == 'I' || ch == 'O' || ch == 'U'\n\t\t\t\t|| ch == 'Y';\n\t}\n\n\tpublic static boolean isStrictVowel(char ch) {\n\t\tch = Character.toUpperCase(ch);\n\t\treturn ch == 'A' || ch == 'E' || ch == 'I' || ch == 'O' || ch == 'U';\n\t}\n\n\tpublic static String convertToRoman(int number) {\n\t\tStringBuilder result = new StringBuilder();\n\t\tfor (int i = 0; i < ROMAN_TOKENS.length; i++) {\n\t\t\twhile (number >= ROMAN_VALUES[i]) {\n\t\t\t\tnumber -= ROMAN_VALUES[i];\n\t\t\t\tresult.append(ROMAN_TOKENS[i]);\n\t\t\t}\n\t\t}\n\t\treturn result.toString();\n\t}\n\n\tpublic static int convertFromRoman(String number) {\n\t\tint result = 0;\n\t\tfor (int i = 0; i < ROMAN_TOKENS.length; i++) {\n\t\t\twhile (number.startsWith(ROMAN_TOKENS[i])) {\n\t\t\t\tnumber = number.substring(ROMAN_TOKENS[i].length());\n\t\t\t\tresult += ROMAN_VALUES[i];\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static int distance(int x1, int y1, int x2, int y2) {\n\t\tint dx = x1 - x2;\n\t\tint dy = y1 - y2;\n\t\treturn dx * dx + dy * dy;\n\t}\n\n\tpublic static <T extends Comparable<T>> T min(T first, T second) {\n\t\tif (first.compareTo(second) <= 0)\n\t\t\treturn first;\n\t\treturn second;\n\t}\n\n\tpublic static <T extends Comparable<T>> T max(T first, T second) {\n\t\tif (first.compareTo(second) <= 0)\n\t\t\treturn second;\n\t\treturn first;\n\t}\n\n\tpublic static void decreaseByOne(int[]... arrays) {\n\t\tfor (int[] array : arrays) {\n\t\t\tfor (int i = 0; i < array.length; i++)\n\t\t\t\tarray[i]--;\n\t\t}\n\t}\n\n\tpublic static int[] getIntArray(String s) {\n\t\tString[] tokens = s.split(\" \");\n\t\tint[] result = new int[tokens.length];\n\t\tfor (int i = 0; i < result.length; i++)\n\t\t\tresult[i] = Integer.parseInt(tokens[i]);\n\t\treturn result;\n\t}\n}\n\ninterface Function<A, V> {\n\tpublic abstract V value(A argument);\n}\n\ninterface IntComparator {\n\tpublic static final IntComparator DEFAULT = new IntComparator() {\n\t\tpublic int compare(int first, int second) {\n\t\t\tif (first < second)\n\t\t\t\treturn -1;\n\t\t\tif (first > second)\n\t\t\t\treturn 1;\n\t\t\treturn 0;\n\t\t}\n\t};\n\n\tpublic static final IntComparator REVERSE = new IntComparator() {\n\t\tpublic int compare(int first, int second) {\n\t\t\tif (first < second)\n\t\t\t\treturn 1;\n\t\t\tif (first > second)\n\t\t\t\treturn -1;\n\t\t\treturn 0;\n\t\t}\n\t};\n\n\tpublic int compare(int first, int second);\n}\n\nclass DFSOrder {\n\tpublic final int[] position;\n\tpublic final int[] end;\n\n\tpublic DFSOrder(Graph graph) {\n\t\tthis(graph, 0);\n\t}\n\n\tpublic DFSOrder(Graph graph, int root) {\n\t\tint count = graph.vertexCount();\n\t\tposition = new int[count];\n\t\tend = new int[count];\n\t\tint[] edge = new int[count];\n\t\tint[] stack = new int[count];\n\t\tfor (int i = 0; i < count; i++)\n\t\t\tedge[i] = graph.firstOutbound(i);\n\t\tstack[0] = root;\n\t\tint size = 1;\n\t\tposition[root] = 0;\n\t\tint index = 0;\n\t\twhile (size > 0) {\n\t\t\tint current = stack[size - 1];\n\t\t\tif (edge[current] == -1) {\n\t\t\t\tend[current] = index;\n\t\t\t\tsize--;\n\t\t\t} else {\n\t\t\t\tint next = graph.destination(edge[current]);\n\t\t\t\tedge[current] = graph.nextOutbound(edge[current]);\n\t\t\t\tposition[next] = ++index;\n\t\t\t\tstack[size++] = next;\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic DFSOrder(BidirectionalGraph graph) {\n\t\tthis(graph, 0);\n\t}\n\n\tpublic DFSOrder(BidirectionalGraph graph, int root) {\n\t\tint count = graph.vertexCount();\n\t\tposition = new int[count];\n\t\tend = new int[count];\n\t\tint[] edge = new int[count];\n\t\tint[] stack = new int[count];\n\t\tint[] last = new int[count];\n\t\tfor (int i = 0; i < count; i++)\n\t\t\tedge[i] = graph.firstOutbound(i);\n\t\tstack[0] = root;\n\t\tlast[root] = -1;\n\t\tint size = 1;\n\t\tposition[root] = 0;\n\t\tint index = 0;\n\t\twhile (size > 0) {\n\t\t\tint current = stack[size - 1];\n\t\t\tif (edge[current] == -1) {\n\t\t\t\tend[current] = index;\n\t\t\t\tsize--;\n\t\t\t} else {\n\t\t\t\tint next = graph.destination(edge[current]);\n\t\t\t\tif (next == last[current]) {\n\t\t\t\t\tedge[current] = graph.nextOutbound(edge[current]);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tedge[current] = graph.nextOutbound(edge[current]);\n\t\t\t\tposition[next] = ++index;\n\t\t\t\tlast[next] = current;\n\t\t\t\tstack[size++] = next;\n\t\t\t}\n\t\t}\n\t}\n}\n\nabstract class IntervalTree {\n\tprotected int size;\n\n\tprotected IntervalTree(int size) {\n\t\tthis(size, true);\n\t}\n\n\tpublic IntervalTree(int size, boolean shouldInit) {\n\t\tthis.size = size;\n\t\tint nodeCount = Math.max(1, Integer.highestOneBit(size) << 2);\n\t\tinitData(size, nodeCount);\n\t\tif (shouldInit)\n\t\t\tinit();\n\t}\n\n\tprotected abstract void initData(int size, int nodeCount);\n\n\tprotected abstract void initAfter(int root, int left, int right, int middle);\n\n\tprotected abstract void initBefore(int root, int left, int right, int middle);\n\n\tprotected abstract void initLeaf(int root, int index);\n\n\tprotected abstract void updatePostProcess(int root, int left, int right,\n\t\t\tint from, int to, long delta, int middle);\n\n\tprotected abstract void updatePreProcess(int root, int left, int right,\n\t\t\tint from, int to, long delta, int middle);\n\n\tprotected abstract void updateFull(int root, int left, int right, int from,\n\t\t\tint to, long delta);\n\n\tprotected abstract long queryPostProcess(int root, int left, int right,\n\t\t\tint from, int to, int middle, long leftResult, long rightResult);\n\n\tprotected abstract void queryPreProcess(int root, int left, int right,\n\t\t\tint from, int to, int middle);\n\n\tprotected abstract long queryFull(int root, int left, int right, int from,\n\t\t\tint to);\n\n\tprotected abstract long emptySegmentResult();\n\n\tpublic void init() {\n\t\tif (size == 0)\n\t\t\treturn;\n\t\tinit(0, 0, size - 1);\n\t}\n\n\tprivate void init(int root, int left, int right) {\n\t\tif (left == right) {\n\t\t\tinitLeaf(root, left);\n\t\t} else {\n\t\t\tint middle = (left + right) >> 1;\n\t\t\tinitBefore(root, left, right, middle);\n\t\t\tinit(2 * root + 1, left, middle);\n\t\t\tinit(2 * root + 2, middle + 1, right);\n\t\t\tinitAfter(root, left, right, middle);\n\t\t}\n\t}\n\n\tpublic void update(int from, int to, long delta) {\n\t\tupdate(0, 0, size - 1, from, to, delta);\n\t}\n\n\tprotected void update(int root, int left, int right, int from, int to,\n\t\t\tlong delta) {\n\t\tif (left > to || right < from)\n\t\t\treturn;\n\t\tif (left >= from && right <= to) {\n\t\t\tupdateFull(root, left, right, from, to, delta);\n\t\t\treturn;\n\t\t}\n\t\tint middle = (left + right) >> 1;\n\t\tupdatePreProcess(root, left, right, from, to, delta, middle);\n\t\tupdate(2 * root + 1, left, middle, from, to, delta);\n\t\tupdate(2 * root + 2, middle + 1, right, from, to, delta);\n\t\tupdatePostProcess(root, left, right, from, to, delta, middle);\n\t}\n\n\tpublic long query(int from, int to) {\n\t\treturn query(0, 0, size - 1, from, to);\n\t}\n\n\tprotected long query(int root, int left, int right, int from, int to) {\n\t\tif (left > to || right < from)\n\t\t\treturn emptySegmentResult();\n\t\tif (left >= from && right <= to)\n\t\t\treturn queryFull(root, left, right, from, to);\n\t\tint middle = (left + right) >> 1;\n\t\tqueryPreProcess(root, left, right, from, to, middle);\n\t\tlong leftResult = query(2 * root + 1, left, middle, from, to);\n\t\tlong rightResult = query(2 * root + 2, middle + 1, right, from, to);\n\t\treturn queryPostProcess(root, left, right, from, to, middle,\n\t\t\t\tleftResult, rightResult);\n\t}\n}\n\nclass LCA {\n\tprivate final long[] order;\n\tprivate final int[] position;\n\tprivate final IntervalTree lcaTree;\n\tprivate final int[] level;\n\n\tpublic LCA(Graph graph) {\n\t\tthis(graph, 0);\n\t}\n\n\tpublic LCA(Graph graph, int root) {\n\t\torder = new long[2 * graph.vertexCount() - 1];\n\t\tposition = new int[graph.vertexCount()];\n\t\tlevel = new int[graph.vertexCount()];\n\t\tint[] index = new int[graph.vertexCount()];\n\t\tfor (int i = 0; i < index.length; i++)\n\t\t\tindex[i] = graph.firstOutbound(i);\n\t\tint[] last = new int[graph.vertexCount()];\n\t\tint[] stack = new int[graph.vertexCount()];\n\t\tstack[0] = root;\n\t\tint size = 1;\n\t\tint j = 0;\n\t\tlast[root] = -1;\n\t\tArrays.fill(position, -1);\n\t\twhile (size > 0) {\n\t\t\tint vertex = stack[--size];\n\t\t\tif (position[vertex] == -1)\n\t\t\t\tposition[vertex] = j;\n\t\t\torder[j++] = vertex;\n\t\t\tif (last[vertex] != -1)\n\t\t\t\tlevel[vertex] = level[last[vertex]] + 1;\n\t\t\twhile (index[vertex] != -1\n\t\t\t\t\t&& last[vertex] == graph.destination(index[vertex]))\n\t\t\t\tindex[vertex] = graph.nextOutbound(index[vertex]);\n\t\t\tif (index[vertex] != -1) {\n\t\t\t\tstack[size++] = vertex;\n\t\t\t\tstack[size++] = graph.destination(index[vertex]);\n\t\t\t\tlast[graph.destination(index[vertex])] = vertex;\n\t\t\t\tindex[vertex] = graph.nextOutbound(index[vertex]);\n\t\t\t}\n\t\t}\n\t\tlcaTree = new ReadOnlyIntervalTree(order) {\n\t\t\t@Override\n\t\t\tprotected long joinValue(long left, long right) {\n\t\t\t\tif (left == -1)\n\t\t\t\t\treturn right;\n\t\t\t\tif (right == -1)\n\t\t\t\t\treturn left;\n\t\t\t\tif (level[((int) left)] < level[((int) right)])\n\t\t\t\t\treturn left;\n\t\t\t\treturn right;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tprotected long neutralValue() {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t};\n\t\tlcaTree.init();\n\t}\n\n\tpublic int getPosition(int vertex) {\n\t\treturn position[vertex];\n\t}\n\n\tpublic int getLCA(int first, int second) {\n\t\treturn (int) lcaTree.query(Math.min(position[first], position[second]),\n\t\t\t\tMath.max(position[first], position[second]));\n\t}\n\n\tpublic int getLevel(int vertex) {\n\t\treturn level[vertex];\n\t}\n\n\tpublic int getPathLength(int first, int second) {\n\t\treturn level[first] + level[second] - 2 * level[getLCA(first, second)];\n\t}\n}\n\nabstract class LongIntervalTree extends IntervalTree {\n\tprotected long[] value;\n\tprotected long[] delta;\n\n\tprotected LongIntervalTree(int size) {\n\t\tthis(size, true);\n\t}\n\n\tpublic LongIntervalTree(int size, boolean shouldInit) {\n\t\tsuper(size, shouldInit);\n\t}\n\n\t@Override\n\tprotected void initData(int size, int nodeCount) {\n\t\tvalue = new long[nodeCount];\n\t\tdelta = new long[nodeCount];\n\t}\n\n\tprotected abstract long joinValue(long left, long right);\n\n\tprotected abstract long joinDelta(long was, long delta);\n\n\tprotected abstract long accumulate(long value, long delta, int length);\n\n\tprotected abstract long neutralValue();\n\n\tprotected abstract long neutralDelta();\n\n\tprotected long initValue(int index) {\n\t\treturn neutralValue();\n\t}\n\n\t@Override\n\tprotected void initAfter(int root, int left, int right, int middle) {\n\t\tvalue[root] = joinValue(value[2 * root + 1], value[2 * root + 2]);\n\t\tdelta[root] = neutralDelta();\n\t}\n\n\t@Override\n\tprotected void initBefore(int root, int left, int right, int middle) {\n\t}\n\n\t@Override\n\tprotected void initLeaf(int root, int index) {\n\t\tvalue[root] = initValue(index);\n\t\tdelta[root] = neutralDelta();\n\t}\n\n\t@Override\n\tprotected void updatePostProcess(int root, int left, int right, int from,\n\t\t\tint to, long delta, int middle) {\n\t\tvalue[root] = joinValue(value[2 * root + 1], value[2 * root + 2]);\n\t}\n\n\t@Override\n\tprotected void updatePreProcess(int root, int left, int right, int from,\n\t\t\tint to, long delta, int middle) {\n\t\tpushDown(root, left, middle, right);\n\t}\n\n\tprotected void pushDown(int root, int left, int middle, int right) {\n\t\tvalue[2 * root + 1] = accumulate(value[2 * root + 1], delta[root],\n\t\t\t\tmiddle - left + 1);\n\t\tvalue[2 * root + 2] = accumulate(value[2 * root + 2], delta[root],\n\t\t\t\tright - middle);\n\t\tdelta[2 * root + 1] = joinDelta(delta[2 * root + 1], delta[root]);\n\t\tdelta[2 * root + 2] = joinDelta(delta[2 * root + 2], delta[root]);\n\t\tdelta[root] = neutralDelta();\n\t}\n\n\t@Override\n\tprotected void updateFull(int root, int left, int right, int from, int to,\n\t\t\tlong delta) {\n\t\tvalue[root] = accumulate(value[root], delta, right - left + 1);\n\t\tthis.delta[root] = joinDelta(this.delta[root], delta);\n\t}\n\n\t@Override\n\tprotected long queryPostProcess(int root, int left, int right, int from,\n\t\t\tint to, int middle, long leftResult, long rightResult) {\n\t\treturn joinValue(leftResult, rightResult);\n\t}\n\n\t@Override\n\tprotected void queryPreProcess(int root, int left, int right, int from,\n\t\t\tint to, int middle) {\n\t\tpushDown(root, left, middle, right);\n\t}\n\n\t@Override\n\tprotected long queryFull(int root, int left, int right, int from, int to) {\n\t\treturn value[root];\n\t}\n\n\t@Override\n\tprotected long emptySegmentResult() {\n\t\treturn neutralValue();\n\t}\n}\n\nclass SumIntervalTree extends LongIntervalTree {\n\tpublic SumIntervalTree(int size) {\n\t\tsuper(size);\n\t}\n\n\t@Override\n\tprotected long joinValue(long left, long right) {\n\t\treturn left + right;\n\t}\n\n\t@Override\n\tprotected long joinDelta(long was, long delta) {\n\t\treturn was + delta;\n\t}\n\n\t@Override\n\tprotected long accumulate(long value, long delta, int length) {\n\t\treturn value + delta * length;\n\t}\n\n\t@Override\n\tprotected long neutralValue() {\n\t\treturn 0;\n\t}\n\n\t@Override\n\tprotected long neutralDelta() {\n\t\treturn 0;\n\t}\n}\n\nabstract class ReadOnlyIntervalTree extends IntervalTree {\n\tprotected long[] value;\n\tprotected long[] array;\n\n\tprotected ReadOnlyIntervalTree(long[] array) {\n\t\tsuper(array.length, false);\n\t\tthis.array = array;\n\t\tinit();\n\t}\n\n\t@Override\n\tprotected void initData(int size, int nodeCount) {\n\t\tvalue = new long[nodeCount];\n\t}\n\n\t@Override\n\tprotected void initAfter(int root, int left, int right, int middle) {\n\t\tvalue[root] = joinValue(value[2 * root + 1], value[2 * root + 2]);\n\t}\n\n\t@Override\n\tprotected void initBefore(int root, int left, int right, int middle) {\n\t}\n\n\t@Override\n\tprotected void initLeaf(int root, int index) {\n\t\tvalue[root] = array[index];\n\t}\n\n\t@Override\n\tprotected void updatePostProcess(int root, int left, int right, int from,\n\t\t\tint to, long delta, int middle) {\n\t\tthrow new UnsupportedOperationException();\n\t}\n\n\t@Override\n\tprotected void updatePreProcess(int root, int left, int right, int from,\n\t\t\tint to, long delta, int middle) {\n\t\tthrow new UnsupportedOperationException();\n\t}\n\n\t@Override\n\tprotected void updateFull(int root, int left, int right, int from, int to,\n\t\t\tlong delta) {\n\t\tthrow new UnsupportedOperationException();\n\t}\n\n\t@Override\n\tprotected long queryPostProcess(int root, int left, int right, int from,\n\t\t\tint to, int middle, long leftResult, long rightResult) {\n\t\treturn joinValue(leftResult, rightResult);\n\t}\n\n\t@Override\n\tprotected void queryPreProcess(int root, int left, int right, int from,\n\t\t\tint to, int middle) {\n\t}\n\n\t@Override\n\tprotected long queryFull(int root, int left, int right, int from, int to) {\n\t\treturn value[root];\n\t}\n\n\t@Override\n\tprotected long emptySegmentResult() {\n\t\treturn neutralValue();\n\t}\n\n\t@Override\n\tpublic void update(int from, int to, long delta) {\n\t\tthrow new UnsupportedOperationException();\n\t}\n\n\t@Override\n\tprotected void update(int root, int left, int right, int from, int to,\n\t\t\tlong delta) {\n\t\tthrow new UnsupportedOperationException();\n\t}\n\n\tprotected abstract long neutralValue();\n\n\tprotected abstract long joinValue(long left, long right);\n}", "lang_cluster": "Java", "tags": ["brute force", "divide and conquer", "dfs and similar"], "code_uid": "84b9da3c701a87418ac8e6a1b81217c6", "src_uid": "1b17a7b3b41077843ee1d6e0607720d6", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/*\nIf you want to aim high, aim high\nDon't let that studying and grades consume you\nJust live life young\n******************************\nIf I'm the sun, you're the moon\nBecause when I go up, you go down\n*******************************\nI'm working for the day I will surpass you\nhttps://www.a2oj.com/Ladder16.html\n*/\nimport java.util.*;\nimport java.io.*;\nimport java.math.*;\n\n public class x440C\n {\n static long[] pow;\n public static void main(String omkar[]) throws Exception\n {\n BufferedReader infile = new BufferedReader(new InputStreamReader(System.in)); \n StringTokenizer st = new StringTokenizer(infile.readLine());\n String input = st.nextToken();\n int N = input.length();\n int[] arr = new int[N];\n for(int i=0; i < N; i++)\n arr[i] = Integer.parseInt(input.charAt(i)+\"\");\n //brute force\n pow = new long[16];\n pow[0] = 1L;\n for(int i=1; i <= 15; i++)\n pow[i] = pow[i-1]*10;\n long start = Long.parseLong(input);\n System.out.println(solve(start));\n }\n public static int solve(long x)\n {\n if(x <= 11)\n {\n if(x == 11)\n return 2;\n else if(x == 10)\n return 3;\n else if(x == 9)\n return 4;\n else if(x == 8)\n return 5;\n else if(x == 7)\n return 6;\n else\n return (int)x;\n }\n int len = (x+\"\").length();\n long boof = 0L;\n for(int i=0; i <= len; i++)\n boof += pow[i];\n int res = Integer.MAX_VALUE;\n if(x > boof-x)\n res = Math.min(res, len+1+solve(boof-x));\n boof -= pow[len];\n for(int d=1; d <= 9; d++)\n {\n boof *= d;\n if(d == x/pow[len-1] || d+1 == x/pow[len-1])//(x > boof-x)\n res = Math.min(res, len*d+solve(Math.abs(boof-x)));\n boof /= d;\n }\n return res;\n }\n }", "lang_cluster": "Java", "tags": ["brute force", "divide and conquer", "dfs and similar"], "code_uid": "08837ad429f74ea56030508ac2350305", "src_uid": "1b17a7b3b41077843ee1d6e0607720d6", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class C {\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\tboolean eof;\n\n\tstatic long[] ONES = new long[17];\n\tstatic {\n\t\tONES[1] = 1;\n\t\tfor (int i = 2; i < 17; i++) {\n\t\t\tONES[i] = 10 * ONES[i - 1] + 1;\n\t\t}\n\t}\n\n\tlong go(long x, int len) {\n\t\tx = Math.abs(x);\n//\t\tSystem.err.println(x + \" \" + len);\n\t\tif (x % ONES[len] == 0) {\n\t\t\treturn x / ONES[len] * len;\n\t\t}\n\t\tlong low = x / ONES[len];\n\t\tlong high = low + 1;\n\n\t\tlong ret1 = low * len + go(x - low * ONES[len], len - 1);\n\t\tlong ret2 = high * len + go(high * ONES[len] - x, len - 1);\n\t\treturn Math.min(ret1, ret2);\n\t}\n\n\tlong solve(long x) {\n\t\treturn go(x, 16);\n\t}\n\n\tC() throws IOException {\n\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\tout.println(solve(nextLong()));\n\t\tout.close();\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew C();\n\t}\n\n\tString nextToken() {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (Exception e) {\n\t\t\t\teof = true;\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tString nextString() {\n\t\ttry {\n\t\t\treturn br.readLine();\n\t\t} catch (IOException e) {\n\t\t\teof = true;\n\t\t\treturn null;\n\t\t}\n\t}\n\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "divide and conquer", "dfs and similar"], "code_uid": "e00b8c548b6200fbdaf7ae0fd8d8d339", "src_uid": "1b17a7b3b41077843ee1d6e0607720d6", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.util.HashMap;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.Reader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Vadim\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskC solver = new TaskC();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskC {\n long a[] = new long[17];\n HashMap<Long, Long> cache = new HashMap<Long, Long>();\n\n private long calc(long n) {\n if(n==0) {\n return 0;\n }\n if(cache.containsKey(n)){\n return cache.get(n);\n }\n for (int i = 0; i < 17; i++) {\n if(a[i] >= n) {\n if(a[i] == n) {\n cache.put(n, (long)i+1);\n return i+1;\n }\n\n long k = n/a[i-1];\n long c1 = i*k + calc(n-a[i - 1]*k);\n\n k = (a[i]-n)/a[i-1];\n long c2 = i + 1 + i*k+ calc(a[i]-a[i-1]*k-n);\n\n long min = Math.min(c1, c2);\n cache.put(n, min);\n return min;\n }\n }\n throw new RuntimeException();\n }\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n long n = in.nextLong();\n\n a[0] = 1;\n for (int i = 1; i < 17; i++) {\n a[i] = a[i-1]*10 + 1;\n }\n\n out.println(calc(n));\n\n }\n}\n\nclass InputReader extends BufferedReader {\n public InputReader(InputStream st) {\n super(new InputStreamReader(st));\n }\n\n public long nextLong() {\n try {\n int c = read();\n\n while (isWhiteSpace(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long ret = 0;\n while (c >= 0 && !isWhiteSpace(c)) {\n if (c < '0' || c > '9') {\n throw new RuntimeException();\n }\n ret = ret * 10 + c - '0';\n c = read();\n }\n return ret * sgn;\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n\n public String readLine() {\n try {\n return super.readLine();\n } catch (IOException e) {\n return null;\n }\n }\n\n static boolean isWhiteSpace(int c) {\n return c >= 0 && c <= 32;\n }\n\n\n\n}\n", "lang_cluster": "Java", "tags": ["brute force", "divide and conquer", "dfs and similar"], "code_uid": "a83b6e1652a49a2b0a1cfc931e45ed01", "src_uid": "1b17a7b3b41077843ee1d6e0607720d6", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\n\npublic class c12 {\n\n public static void main(String[] args)throws Exception {\n long n=ll();\n System.out.println(solve(n));\n }\n\n private static long solve(long n) {\n if (n<=10){\n return Math.min(n,2+(11-n));\n }\n long h=geth(n);\n long l=getl(n);\n long c1=((h+\"\").length())+Math.abs(((h-n)/l)*(l+\"\").length())+solve(Math.abs((h-n))%l);\n long c2=Math.abs(((n)/l)*(l+\"\").length())+solve(Math.abs((n))%l);\n return Math.min(c1,c2);\n }\n\n private static long geth(long n) {\n String s=n+\"\";\n long t1=get(s.length());\n if (t1>=n)return t1;\n else return get(s.length()+1);\n }\n\n private static long getl(long n) {\n String s=n+\"\";\n long t1=get(s.length());\n if (t1<n)return t1;\n return get(s.length()-1);\n }\n static long get(int l){\n switch (l){\n case 1:return 1;case 4:return 1111;\n case 2:return 11;case 5:return 11111;\n case 3:return 111;case 6:return 111111;\n case 7:return 1111111;case 10:return 1111111111;\n case 8:return 11111111;case 11:return 11111111111l;\n case 9:return 111111111;case 12:return 111111111111l;\n case 13:return 1111111111111l;\n case 14:return 11111111111111l;\n case 15:return 111111111111111l;\n case 16:return 1111111111111111l;\n default :return 11111111111111111l;\n \n }\n }\n\n static BufferedReader buf=new BufferedReader(new InputStreamReader(System.in));\n static StringTokenizer st;\n static int in() throws IOException{\n if (st==null || !st.hasMoreTokens()){\n st=new StringTokenizer(buf.readLine());\n }\n return Integer.parseInt(st.nextToken());\n }\n static long ll() throws IOException{\n if (st==null || !st.hasMoreTokens()){\n st=new StringTokenizer(buf.readLine());\n }\n return Long.parseLong(st.nextToken());\n }\n static String str() throws IOException{\n if (st==null || !st.hasMoreTokens()){\n st=new StringTokenizer(buf.readLine());\n }\n return (st.nextToken());\n }\n static double dub() throws IOException{\n if (st==null || !st.hasMoreTokens()){\n st=new StringTokenizer(buf.readLine());\n }\n return Double.parseDouble(st.nextToken());\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "divide and conquer", "dfs and similar"], "code_uid": "59f39cb1af669be759419777639c6b42", "src_uid": "1b17a7b3b41077843ee1d6e0607720d6", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.Reader;\nimport java.io.Writer;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Niyaz Nigmatullin\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tFastScanner in = new FastScanner(inputStream);\n\t\tFastPrinter out = new FastPrinter(outputStream);\n\t\tTaskC solver = new TaskC();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskC {\n public void solve(int testNumber, FastScanner in, FastPrinter out) {\n int shift = 15;\n int maxn = 60;\n \n int[][][] dp = new int[maxn + 1][maxn + 1][shift * 2 + 1];\n for (int[][] e1 : dp) {\n for (int[] e2 : e1) Arrays.fill(e2, Integer.MAX_VALUE);\n }\n dp[maxn][maxn][shift] = 0;\n char[] d = (\"000\" + in.next()).toCharArray();\n for (int i = d.length - 1; i >= 0; i--) {\n int digit = d[i] - '0';\n for (int plus = maxn; plus >= 0; plus--) {\n for (int minus = maxn; minus >= 0; minus--) {\n for (int carry = 0; carry <= 2 * shift; carry++) {\n if (plus + 1 <= maxn)\n dp[plus][minus][carry] = Math.min(dp[plus][minus][carry], dp[plus + 1][minus][carry]);\n if (minus + 1 <= maxn)\n dp[plus][minus][carry] = Math.min(dp[plus][minus][carry], dp[plus][minus + 1][carry]);\n }\n }\n }\n int[][][] next = new int[maxn + 1][maxn + 1][shift * 2 + 1];\n for (int[][] e1 : next) {\n for (int[] e2 : e1) Arrays.fill(e2, Integer.MAX_VALUE);\n }\n for (int plus = maxn; plus >= 0; plus--) {\n for (int minus = maxn; minus >= 0; minus--) {\n for (int carry = 0; carry <= 2 * shift; carry++) {\n int val = dp[plus][minus][carry];\n if (val == Integer.MAX_VALUE) continue;\n int realCarry = carry - shift;\n int curN = plus - minus + realCarry;\n int curD = curN % 10;\n if (curD < 0) curD += 10;\n int newCarry = (curN - curD) / 10;\n if (curD != digit) continue;\n next[plus][minus][newCarry + shift] = Math.min(next[plus][minus][newCarry + shift], plus + minus + val);\n }\n }\n }\n dp = next;\n }\n int ans = Integer.MAX_VALUE;\n for (int i = 0; i <= maxn; i++) {\n for (int j = 0; j <= maxn; j++) ans = Math.min(ans, dp[i][j][shift]);\n }\n out.println(ans);\n }\n}\n\nclass FastScanner extends BufferedReader {\n\n public FastScanner(InputStream is) {\n super(new InputStreamReader(is));\n }\n\n public int read() {\n try {\n int ret = super.read();\n// if (isEOF && ret < 0) {\n// throw new InputMismatchException();\n// }\n// isEOF = ret == -1;\n return ret;\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n }\n\n public String next() {\n StringBuilder sb = new StringBuilder();\n int c = read();\n while (isWhiteSpace(c)) {\n c = read();\n }\n if (c < 0) {\n return null;\n }\n while (c >= 0 && !isWhiteSpace(c)) {\n sb.appendCodePoint(c);\n c = read();\n }\n return sb.toString();\n }\n\n static boolean isWhiteSpace(int c) {\n return c >= 0 && c <= 32;\n }\n\n public String readLine() {\n try {\n return super.readLine();\n } catch (IOException e) {\n return null;\n }\n }\n\n}\n\nclass FastPrinter extends PrintWriter {\n\n public FastPrinter(OutputStream out) {\n super(out);\n }\n\n public FastPrinter(Writer out) {\n super(out);\n }\n\n\n}\n\n", "lang_cluster": "Java", "tags": ["brute force", "divide and conquer", "dfs and similar"], "code_uid": "02c893fda605070f68e1f20b47686fb3", "src_uid": "1b17a7b3b41077843ee1d6e0607720d6", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\n import java.io.*;\n import java.util.StringTokenizer;\n \n \n /**\n * Author: Luis Manuel Díaz Barón\n * Problem:\n * Online Judge:\n * Idea:\n * Fecha: 20/02/2013\n */\n \n public class Main {\n \n static MyScanner sc;\n static MyWriter pw;\n static String filePathWin=\"d:\\\\lmo.in\";\n static String filePathLinux=\"/media/luismo/Trabajo/lmo.in\";\n public static void main(String[] args) throws IOException {\n sc = new MyScanner(System.in);\n \n // sc = new MyScanner(new FileReader(filePathWin));\n // sc = new MyScanner(new FileReader(filePathLinux));\n \n pw = new MyWriter(System.out);\n \n while(sc.canRead())\n SolveSingleProblem();\n \n pw.close();\n }\n \n \n public static void SolveSingleProblem() throws IOException{\n \n long n = sc.nextLong();\n \n long dig = (long)Math.log10(n) + 1;\n \n long mirr = n;\n \n String s = \"\";\n for(int i =0; i < dig + 1; i++)\n s+=\"1\";\n \n long k = Long.parseLong(s);\n \n long k2 = Long.parseLong(s.substring(1));\n \n long answ1 = best(n, k);\n \n long answ2 = best(n, k2);\n \n \n answ1 = min(answ1, answ2);\n \n pw.println(answ1);\n }\n \n static long best(long n, long k){\n \n if(k == 1) return n;\n \n int cumul = 0;\n int digits = (int)Math.log10(k) + 1;\n \n if(n == k){\n long ret = digits;\n return ret;\n }\n \n if(k < n){ \n \n long ret = digits + best(n - k , k);\n return ret;\n }\n \n long left = digits + best( k - n, k / 10);\n \n long right = best(n, k / 10);\n \n return min(left, right);\n }\n \n static long min(long a, long b){\n return (a < b)? a: b;\n }\n \n }\n \n class MyScanner{\n BufferedReader br;\n StringTokenizer stk;\n public MyScanner(InputStream stream){\n this.br = new BufferedReader(new InputStreamReader(stream),72357);\n this.stk = new StringTokenizer(\"\");\n }\n public MyScanner(FileReader fr){\n this.br = new BufferedReader(fr);\n this.stk = new StringTokenizer(\"\");\n }\n public String next() throws IOException {\n while(!stk.hasMoreElements()){\n String line = br.readLine();\n if(line == null)\n return null;\n stk = new StringTokenizer(line);\n }\n return stk.nextToken();\n }\n public int nextInt()throws IOException{\n return Integer.parseInt(next());\n }\n \n public long nextLong()throws IOException{\n return Long.parseLong(next());\n }\n \n public double nextDouble()throws IOException{\n return Double.parseDouble(next());\n }\n \n public boolean canRead() throws IOException{\n return br.ready();\n }\n }\n \n class MyWriter{\n PrintWriter pw;\n public MyWriter(OutputStream out){\n this.pw = new PrintWriter(out);\n }\n public void print(Object obj){\n pw.print(obj.toString());\n }\n public void println(Object obj){\n pw.println(obj.toString());\n }\n public void close() {\n pw.close();\n }\n }", "lang_cluster": "Java", "tags": ["brute force", "divide and conquer", "dfs and similar"], "code_uid": "24d9873996d9ddbc410688219705d6b5", "src_uid": "1b17a7b3b41077843ee1d6e0607720d6", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "\n\nimport java.util.Scanner;\nimport java.io.BufferedReader;\nimport java.io.*;\nimport java.util.StringTokenizer;\n\n\npublic class One_Based_Arithmetic { \n \n static MyScanner sc;\n static MyWriter pw;\n static String filePathWin=\"d:\\\\lmo.in\";\n static String filePathLinux=\"/media/luismo/Trabajo/lmo.in\";\n public static void main(String[] args) throws IOException {\n sc = new MyScanner(System.in);\n \n // sc = new MyScanner(new FileReader(filePathWin));\n // sc = new MyScanner(new FileReader(filePathLinux));\n \n pw = new MyWriter(System.out);\n \n while(sc.canRead())\n SolveSingleProblem();\n \n pw.close();\n }\n \n \n public static void SolveSingleProblem() throws IOException{\n \n long n = sc.nextLong();\n \n long dig = (long)Math.log10(n) + 1;\n \n long mirr = n;\n \n String s = \"\";\n for(int i =0; i < dig + 1; i++)\n s+=\"1\";\n \n long k = Long.parseLong(s);\n \n long answ1 = best(n, k);\n \n \n pw.println(answ1);\n }\n \n static long best(long n, long k){\n \n if(k == 1) return n;\n \n int cumul = 0;\n int digits = (int)Math.log10(k) + 1;\n \n if(n == k){ \n return digits;\n }\n \n if(k < n){ \n return digits + best(n - k , k);\n }\n \n long left = digits + best( k - n, k / 10);\n \n long right = best(n, k / 10);\n \n return min(left, right);\n }\n \n static long min(long a, long b){\n return (a < b)? a: b;\n }\n \n }\n \n class MyScanner{\n BufferedReader br;\n StringTokenizer stk;\n public MyScanner(InputStream stream){\n this.br = new BufferedReader(new InputStreamReader(stream),72357);\n this.stk = new StringTokenizer(\"\");\n }\n public MyScanner(FileReader fr){\n this.br = new BufferedReader(fr);\n this.stk = new StringTokenizer(\"\");\n }\n public String next() throws IOException {\n while(!stk.hasMoreElements()){\n String line = br.readLine();\n if(line == null)\n return null;\n stk = new StringTokenizer(line);\n }\n return stk.nextToken();\n }\n public int nextInt()throws IOException{\n return Integer.parseInt(next());\n }\n \n public long nextLong()throws IOException{\n return Long.parseLong(next());\n }\n \n public double nextDouble()throws IOException{\n return Double.parseDouble(next());\n }\n \n public boolean canRead() throws IOException{\n return br.ready();\n }\n }\n \n class MyWriter{\n PrintWriter pw;\n public MyWriter(OutputStream out){\n this.pw = new PrintWriter(out);\n }\n public void print(Object obj){\n pw.print(obj.toString());\n }\n public void println(Object obj){\n pw.println(obj.toString());\n }\n public void close() {\n pw.close();\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "divide and conquer", "dfs and similar"], "code_uid": "722fe31b33456c9aba84a041a42c629f", "src_uid": "1b17a7b3b41077843ee1d6e0607720d6", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Scanner;\n\npublic class oneBased {\n static int DP[];\n static int size = Integer.MAX_VALUE / 100;\n\n public static int rec(long x) {\n\n if (x == 0)\n return 0;\n if (x <= size && DP[((int) x) - 1] != 0)\n return DP[((int) x) - 1];\n int res = 0;\n long counter = x;\n int numOfBits = 0;\n String onesString = \"\";\n while (counter > 0) {\n onesString += \"1\";\n counter /= 10;\n numOfBits++;\n }\n\n long ones = Long.parseLong(onesString);\n long ones2 = Long.parseLong((onesString + \"1\"));\n long reminder = (ones > x) ? ones - x : x - ones;\n long reminder2 = ones2 - x;\n int res1 = rec(reminder);\n res1 += numOfBits;\n int res2 = Integer.MAX_VALUE;\n if (reminder2 < x) {\n res2 = rec(reminder2);\n res2 += numOfBits + 1;\n }\n res = Math.min(res1, res2);\n if (x <= size)\n DP[((int) x) - 1] = res;\n return res;\n }\n\n \n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long x = sc.nextLong();\n DP = new int[size];\n // System.out.println(rec(x));\n long x1 = Long.parseLong(\"81924761239462\");\n long x2 = Long.parseLong(\"11111111111111\");\n System.out.println(rec(x));\n\n }\n // 81924761239462\n\n}\n", "lang_cluster": "Java", "tags": ["brute force", "divide and conquer", "dfs and similar"], "code_uid": "acc922e02e67dc0de4e65d62b4d53613", "src_uid": "1b17a7b3b41077843ee1d6e0607720d6", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\npublic class OBADef\n{\n public static void main(String[] args){\n Scanner scan = new Scanner(System.in);\n long num = scan.nextLong();\n System.out.println(\"\"+prog(num,(int)(Math.log10(Math.abs(num)))+1));\n }\n public static long genUnos(long n){\n return (long)(Math.pow(10,n)-1)/9;\n }\n public static long prog(long n, int tam){\n long unos=genUnos(1+tam);\n long veces=n/unos*(1+tam);\n n%=unos;\n if(n==0) return veces;\n return veces+Math.min((1+tam)+prog(unos-n,tam-1),prog(n,tam-1));\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "divide and conquer", "dfs and similar"], "code_uid": "609746572147752184e921fab2eda93d", "src_uid": "1b17a7b3b41077843ee1d6e0607720d6", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\n import java.io.*;\n import java.util.StringTokenizer;\n \n \n /**\n * Author: Luis Manuel Díaz Barón\n * Problem:\n * Online Judge:\n * Idea:\n * Fecha: 20/02/2013\n */\n \n public class Main {\n \n static MyScanner sc;\n static MyWriter pw;\n static String filePathWin=\"d:\\\\lmo.in\";\n static String filePathLinux=\"/media/luismo/Trabajo/lmo.in\";\n public static void main(String[] args) throws IOException {\n sc = new MyScanner(System.in);\n \n // sc = new MyScanner(new FileReader(filePathWin));\n // sc = new MyScanner(new FileReader(filePathLinux));\n \n pw = new MyWriter(System.out);\n \n while(sc.canRead())\n SolveSingleProblem();\n \n pw.close();\n }\n \n \n public static void SolveSingleProblem() throws IOException{\n \n long n = sc.nextLong();\n \n long dig = (long)Math.log10(n) + 1;\n \n long mirr = n;\n \n String s = \"\";\n for(int i =0; i < dig + 1; i++)\n s+=\"1\";\n \n long k = Long.parseLong(s);\n \n long answ1 = best(n, k);\n \n \n pw.println(answ1);\n }\n \n static long best(long n, long k){\n \n if(k == 1) return n;\n \n int cumul = 0;\n int digits = (int)Math.log10(k) + 1;\n \n if(n == k){ \n return digits;\n }\n \n if(k < n){ \n return digits + best(n - k , k);\n }\n \n long left = digits + best( k - n, k / 10);\n \n long right = best(n, k / 10);\n \n return min(left, right);\n }\n \n static long min(long a, long b){\n return (a < b)? a: b;\n }\n \n }\n \n class MyScanner{\n BufferedReader br;\n StringTokenizer stk;\n public MyScanner(InputStream stream){\n this.br = new BufferedReader(new InputStreamReader(stream),72357);\n this.stk = new StringTokenizer(\"\");\n }\n public MyScanner(FileReader fr){\n this.br = new BufferedReader(fr);\n this.stk = new StringTokenizer(\"\");\n }\n public String next() throws IOException {\n while(!stk.hasMoreElements()){\n String line = br.readLine();\n if(line == null)\n return null;\n stk = new StringTokenizer(line);\n }\n return stk.nextToken();\n }\n public int nextInt()throws IOException{\n return Integer.parseInt(next());\n }\n \n public long nextLong()throws IOException{\n return Long.parseLong(next());\n }\n \n public double nextDouble()throws IOException{\n return Double.parseDouble(next());\n }\n \n public boolean canRead() throws IOException{\n return br.ready();\n }\n }\n \n class MyWriter{\n PrintWriter pw;\n public MyWriter(OutputStream out){\n this.pw = new PrintWriter(out);\n }\n public void print(Object obj){\n pw.print(obj.toString());\n }\n public void println(Object obj){\n pw.println(obj.toString());\n }\n public void close() {\n pw.close();\n }\n }", "lang_cluster": "Java", "tags": ["brute force", "divide and conquer", "dfs and similar"], "code_uid": "4daa3917afba33c8c03416173e2f65fd", "src_uid": "1b17a7b3b41077843ee1d6e0607720d6", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.LinkedList;\nimport java.util.Scanner;\n\n\npublic class T440C {\n\tprivate long[] N = {\n\t\t\t1,\n\t\t\t11,\n\t\t\t111,\n\t\t\t1111,\n\t\t\t11111,\n\t\t\t111111,\n\t\t\t1111111,\n\t\t\t11111111,\n\t\t\t111111111,\n\t\t\t1111111111,\n\t\t\t11111111111L,\n\t\t\t111111111111L,\n\t\t\t1111111111111L,\n\t\t\t11111111111111L,\n\t\t\t111111111111111L,\n\t\t\t1111111111111111L\n\t\t};\n\t\n\tpublic long solve(long n) {\n\t\tlong ans = Long.MAX_VALUE;\n\t\tLinkedList<long[]> l = new LinkedList<long[]>();\n\t\tl.add(new long[] {n, 0});\n\t\tlong[] e;\n\t\twhile (!l.isEmpty()) {\n\t\t\te = l.getFirst();\n\t\t\tl.removeFirst();\n\t\t\t\n\t\t\tif (e[0] == 0 || e[1] > ans) {\n\t\t\t\tans = Math.min(ans, e[1]);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor (int i = N.length - 1; i >= 0; i --) {\n\t\t\t\tif (e[0] >= N[i]) {\n\t\t\t\t\tlong x,y;\n\n\t\t\t\t\ty = e[1] + (e[0] / N[i]) *(i + 1);\n\t\t\t\t\tx = e[0] % N[i];\n\t\t\t\t\tl.add(new long[] {x, y});\n\t\t\t\t\t\n\t\t\t\t\tif (i < N.length - 1) {\n\t\t\t\t\t\ty = e[1] + (i + 1) + 1;\n\t\t\t\t\t\tx = N[i + 1] - e[0];\n\t\t\t\t\t\tl.add(new long[] {x, y});\n\t\t\t\t\t\t\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn ans;\n\t}\n\tpublic static void main(String[] args) {\n\t\tT440C t = new T440C();\n\t\t\n\t\t\n\t\t//long n = 973546235465729L;\n\t\tScanner in = new Scanner(System.in);\n\t\tlong n = in.nextLong();\n\t\t\n\t\tSystem.out.println(t.solve(n));\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["brute force", "divide and conquer", "dfs and similar"], "code_uid": "89d6714bd4db2e0aa20daeb36e4f5be3", "src_uid": "1b17a7b3b41077843ee1d6e0607720d6", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class C {\n static int inf = (int) 1e6;\n static int[][][][] DP;\n static String number;\n\n public static int get(int index, int pos, int neg, int carry) {\n int truCarry = carry - 50;\n if (index == 17) {\n if (pos + neg + truCarry == 0) {\n return 0;\n } else {\n return inf;\n }\n }\n if (DP[index][pos][neg][carry] != -1)\n return DP[index][pos][neg][carry];\n int res = inf;\n for (int p = 0; p <= Math.min(15, pos); p++)\n for (int n = 0; n <= Math.min(15, neg); n++) {\n int sum = pos - neg + truCarry;\n int currentBit = (sum % 10 + 10) % 10;\n int nextCarry = sum > 0 ? (sum / 10) : ((sum - 9) / 10);\n if (currentBit != number.charAt(index) - '0')\n continue;\n res = Math.min(res,\n get(index + 1, pos - p, neg - n, nextCarry + 50)\n + (p + n) * (index + 1));\n }\n return DP[index][pos][neg][carry] = res;\n }\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n long n = in.nextLong();\n int size = 50;\n DP = new int[20][size][size][100];\n for (int i = 0; i < 20; i++)\n for (int j = 0; j < size; j++)\n for (int k = 0; k < size; k++)\n Arrays.fill(DP[i][j][k], -1);\n number = \"\" + n;\n while (number.length() < 17)\n number = \"0\" + number;\n number = new StringBuffer(number).reverse().toString();\n int res = inf;\n for (int pos = 0; pos < size; pos++)\n for (int neg = 0; neg < size; neg++)\n res = Math.min(res, get(0, pos, neg, 50));\n System.out.println(res);\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "divide and conquer", "dfs and similar"], "code_uid": "def1a1e54e0e162eae20f216b6f16e64", "src_uid": "1b17a7b3b41077843ee1d6e0607720d6", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "\nimport java.io.BufferedReader;\nimport java.io.FileNotFoundException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.LinkedList;\nimport java.util.PriorityQueue;\nimport java.util.StringTokenizer;\nimport java.util.TreeSet;\n\n/**\n *\n *\n * 10 5 8 1 10 3 6 2 9 7 4 4 2 6 3 1 9 10 5 8 7\n *\n * @author pttrung\n */\npublic class C {\n\n // public static long x, y, gcd;\n public static int Mod = 1000000007;\n public static PrintWriter out;\n\n public static void main(String[] args) throws FileNotFoundException {\n Scanner in = new Scanner();\n out = new PrintWriter(System.out);\n // System.out.println(Integer.MAX_VALUE);\n //PrintWriter out = new PrintWriter(new FileOutputStream(new File(\"output.txt\")));\n long n = in.nextLong();\n int result = cal(n, -1);\n\n out.println(result);\n\n out.close();\n }\n\n public static int cal(long val, long last) {\n if(val == 0){\n return 0;\n }\n long start = 1;\n int c = 1;\n while (start < val) {\n start *= 10;\n start++;\n c++;\n }\n \n if (start > val ) {\n \n long a = start / 10;\n \n \n int result = (int) ((c - 1) + cal(val - a, start));\n if (last != start) {\n result = Math.min(result, c + cal(start - val, start));\n }\n return result;\n } else {\n return c;\n }\n }\n\n public static long pow(long a, long b) {\n if (b == 0) {\n return 1;\n }\n if (b == 1) {\n return a;\n }\n long val = pow(a, b / 2);\n if (b % 2 == 0) {\n return val * val;\n } else {\n return val * val * a;\n }\n }\n\n public static int gcd(int a, int b) {\n if (b == 0) {\n return a;\n }\n return gcd(b, a % b);\n\n\n }\n\n public static class Point implements Comparable<Point> {\n\n int x, y;\n\n public Point(int x, int y) {\n this.x = x;\n this.y = y;\n }\n\n @Override\n public int compareTo(Point o) {\n if (x != o.x) {\n return x - o.x;\n } else {\n return y - o.y;\n }\n }\n }\n// public static void extendEuclid(long a, long b) {\n// if (b == 0) {\n// x = 1;\n// y = 0;\n// gcd = a;\n// return;\n// }\n// extendEuclid(b, a % b);\n// long x1 = y;\n// long y1 = x - (a / b) * y;\n// x = x1;\n// y = y1;\n//\n// }\n\n public static class FT {\n\n int[] data;\n\n FT(int n) {\n data = new int[n];\n }\n\n public void update(int index, int value) {\n while (index < data.length) {\n data[index] += value;\n index += (index & (-index));\n }\n }\n\n public int get(int index) {\n int result = 0;\n while (index > 0) {\n result += data[index];\n index -= (index & (-index));\n }\n return result;\n\n }\n }\n\n static class Scanner {\n\n BufferedReader br;\n StringTokenizer st;\n\n public Scanner() throws FileNotFoundException {\n // System.setOut(new PrintStream(new BufferedOutputStream(System.out), true));\n br = new BufferedReader(new InputStreamReader(System.in));\n //br = new BufferedReader(new InputStreamReader(new FileInputStream(new File(\"input.txt\"))));\n }\n\n public String next() {\n\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (Exception e) {\n throw new RuntimeException();\n }\n }\n return st.nextToken();\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public String nextLine() {\n st = null;\n try {\n return br.readLine();\n } catch (Exception e) {\n throw new RuntimeException();\n }\n }\n\n public boolean endLine() {\n try {\n String next = br.readLine();\n while (next != null && next.trim().isEmpty()) {\n next = br.readLine();\n }\n if (next == null) {\n return true;\n }\n st = new StringTokenizer(next);\n return st.hasMoreTokens();\n } catch (Exception e) {\n throw new RuntimeException();\n }\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "divide and conquer", "dfs and similar"], "code_uid": "a3e58fb6f4a654ebbbc483a77f3f95b0", "src_uid": "1b17a7b3b41077843ee1d6e0607720d6", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\n\npublic class Main {\n\tpublic static void main(String arg[])throws Exception{\n\t\tBufferedReader bff = new BufferedReader(new InputStreamReader(System.in));\n\t\tlong n = Long.parseLong(bff.readLine());\n\t\tSystem.out.println(ones(n));\n\t}\n\tprivate static int digs(long n){\n\t\treturn (int) Math.log10(n) + 1;\n\t}\n\tprivate static long fillOne(int n){\n\t\tlong res = 1;\n\t\twhile(n-- > 1)\n\t\t\tres = res * 10 + 1;\n\t\treturn res;\n\t}\n\t\n\tprivate static long ones (long n){\n\t\tif(n <= 6) return n;\n\t\tint dig = digs(n);\n\t\tlong aux = fillOne(dig), one = aux, diff = n;\n\t\tint c = 0;\n\t\t//System.out.println(aux);\n\t\twhile(aux < n){\n\t\t\tc++;\n\t\t\tdiff = n - aux;\n\t\t\taux += one;\n\t\t}\n\t\t//System.out.println(diff + \" \" + aux);\n\t\tlong res;\n\t\tif(c > 0)\n\t\t\tres = Math.min(c*dig + ones(diff), ++c * dig + ones(aux - n));\n\t\telse\n\t\t\tres = ++c * dig + ones(aux - n);\n\t\taux = fillOne(dig + 1);\n\t\tif(aux - n < n)\n\t\t\tres = Math.min(res, dig + 1 + ones(aux - n));\n\t\treturn res;\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "divide and conquer", "dfs and similar"], "code_uid": "9495e9b4c647f03d8167d314ec6fc40a", "src_uid": "1b17a7b3b41077843ee1d6e0607720d6", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.*;\n\npublic class OneBasedArithmetic {\n public static void main(String[] args) {\n FastReader sc = new FastReader();\n long n = sc.nextLong();\n long[] ones = new long[17];\n for(int i = 1; i < 17; ++i){\n ones[i] = 10 * ones[i - 1] + 1;\n }\n\n //System.out.println(Arrays.toString(ones));\n long ans = dfs(ones, n, 16);\n System.out.println(ans);\n }\n\n private static long dfs(long[] ones, long n, int idx){\n\n //System.out.println(n +\", \" + idx);\n long quot = n / ones[idx];\n n %= ones[idx];\n long onesUsedHere = quot * idx;\n //System.out.println(\"q : \" + quot +\", n : \" + n);\n if(n == 0) return onesUsedHere;\n else\n return onesUsedHere + Math.min(dfs(ones, n, idx - 1),\n idx + dfs(ones, ones[idx] - n, idx - 1));\n }\n private static class FastReader {\n private final BufferedReader br;\n StringTokenizer st;\n\n public FastReader() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n\n int[] readArray(int n) {\n int[] arr = new int[n];\n for (int i = 0; i < n; ++i)\n arr[i] = nextInt();\n\n return arr;\n }\n\n List<Integer> readList(int n) {\n List<Integer> list = new ArrayList<>();\n for (int i = 0; i < n; ++i)\n list.add(nextInt());\n return list;\n }\n\n long[] readLongArray(int n) {\n long[] arr = new long[n];\n for (int i = 0; i < n; ++i)\n arr[i] = nextLong();\n\n return arr;\n }\n\n double[] readDoubleArray(int n) {\n double[] arr = new double[n];\n for (int i = 0; i < n; ++i)\n arr[i] = nextDouble();\n return arr;\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "divide and conquer", "dfs and similar"], "code_uid": "7c568afae2dd008ae5b42b83fcce33f7", "src_uid": "1b17a7b3b41077843ee1d6e0607720d6", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.math.*;\nimport java.util.*;\n\npublic class Main {\n\t\n\tstatic PrintWriter out;\n\t\n\tstatic double EPS = 1e-9;\n\tstatic int INF = (int) 1e9;\n\tstatic long LINF = (long) 1e18;\n\tstatic int MOD = (int) 1e9 + 7;\n\tstatic double PI = Math.acos(-1);\n\t\n\tstatic int go(long n) {\n\t\tif (n == 0) {\n\t\t\treturn 0;\n\t\t}\n\t\tlong k = 1;\n\t\tint cnt = 1;\n\t\twhile (k * 10 + 1 < n) {\n\t\t\tk = k * 10 + 1;\n\t\t\tcnt++;\n\t\t}\n\t\treturn (int) Math.min(go(n % k) + n / k * cnt, go((k * 10 + 1 - n) % k) + (cnt + 1) + (k * 10 + 1 - n) / k * cnt);\n\t}\n\t\n\tstatic void solve() {\n\t\tlong n = Input.nextLong();\n\t\tout.println(go(n));\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tout = new PrintWriter(System.out);\n//\t\tlong stime = System.currentTimeMillis();\n\t\tsolve();\n//\t\tout.println(\"\\nTime elapsed: \" + (System.currentTimeMillis() - stime) + \"ms\");\n\t\tout.close();\n\t}\n\t\n\tstatic class SegmentTree {\n\t\tint maxn = 100010;\n\t\tlong[] st = new long[4 * maxn];\n\t\tvoid update(int node, int i, int L, int R, long val) {\n\t\t\tif (i < L || i > R) return;\n\t\t\tif (L == R) {st[node] += val; return;}\n\t\t\tupdate(node << 1, i, L, (L + R) >> 1, val);\n\t\t\tupdate((node << 1) + 1, i, ((L + R) >> 1) + 1, R, val);\n\t\t\tst[node] = st[node << 1] + st[(node << 1) + 1];\n\t\t}\n\t\tlong query(int node, int l, int r, int L, int R) {\n\t\t\tif (l > R || r < L) return 0;\n\t\t\tif (l <= L && r >= R) return st[node];\n\t\t\treturn query(node << 1, l, r, L, (L + R) >> 1) + query((node << 1) + 1, l, r, ((L + R) >> 1) + 1, R);\n\t\t}\n\t}\n\t\n\tstatic class Matrix {\n\t\tint maxn = 2;\n\t\tint[][] x = new int[maxn][maxn];\n\t\tMatrix mul(Matrix A) {\n\t\t\tMatrix res = new Matrix();\n\t\t\tfor (int i = 0; i < maxn; i++) {\n\t\t\t\tfor (int k = 0; k < maxn; k++) {\n\t\t\t\t\tfor (int j = 0; j < maxn; j++) {\n\t\t\t\t\t\tres.x[i][j] = (int) ((res.x[i][j] + (long) x[i][k] * A.x[k][j]) % MOD);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\tMatrix pow(long k) {\n\t\t\tMatrix res = this, T = this; k--;\n\t\t\twhile (k > 0) {\n\t\t\t\tif ((k & 1) > 0) {\n\t\t\t\t\tres = res.mul(T);\n\t\t\t\t}\n\t\t\t\tT = T.mul(T); k >>= 1;\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t}\n\t\n\tstatic class Pair implements Comparable<Pair> {\n\t\tlong fi, se;\n\t\tPair(long fi, long se) {\n\t\t\tthis.fi = fi;\n\t\t\tthis.se = se;\n\t\t}\n\t\tpublic int compareTo(Pair oth) {\n\t\t\tif (fi > oth.fi) return +1;\n\t\t\tif (fi < oth.fi) return -1;\n\t\t\tif (se > oth.se) return +1;\n\t\t\tif (se < oth.se) return -1;\n\t\t\treturn 0;\n\t\t}\n\t}\n\t\n\tstatic long gcd(long a, long b) {\n\t\tlong r;\n\t\twhile (b != 0) {\n\t\t\tr = a % b;\n\t\t\ta = b;\n\t\t\tb = r;\n\t\t}\n\t\treturn a;\n\t}\n\t\n\tstatic long lcm(long a, long b) {\n\t\treturn a / gcd(a, b) * b;\n\t}\n\t\n\tstatic long fpow(long n, long k, int p) {\n\t\tlong r = 1;\n\t\tfor (; k > 0; k >>= 1) {\n\t\t\tif (k % 2 == 1) {\n\t\t\t\tr = r * n % p;\n\t\t\t}\n\t\t\tn = n * n % p;\n\t\t}\n\t\treturn r;\n\t}\n\t\n\tstatic BigInteger FloorOfNthRoot(BigInteger x, int n) {\n\t int sign = x.signum();\n\t if (n <= 0 || sign < 0) {\n\t throw new IllegalArgumentException();\n\t }\n\t if (sign == 0) {\n\t return BigInteger.ZERO;\n\t }\n\t if (n == 1) {\n\t return x;\n\t }\n\t BigInteger a;\n\t BigInteger bigN = BigInteger.valueOf(n);\n\t BigInteger bigNMinusOne = BigInteger.valueOf(n - 1);\n\t BigInteger b = BigInteger.ZERO.setBit(1 + x.bitLength() / n);\n\t do {\n\t a = b;\n\t b = a.multiply(bigNMinusOne).add(x.divide(a.pow(n - 1))).divide(bigN);\n\t }\n\t while (b.compareTo(a) == -1);\n\t return a;\n\t}\n\t\n\tstatic BigDecimal sqrt(BigDecimal A, int SCALE) {\n\t BigDecimal x0 = new BigDecimal(\"0\");\n\t BigDecimal x1 = new BigDecimal(Math.sqrt(A.doubleValue()));\n\t while (!x0.equals(x1)) {\n\t x0 = x1;\n\t x1 = A.divide(x0, SCALE, BigDecimal.ROUND_HALF_UP);\n\t x1 = x1.add(x0);\n\t x1 = x1.divide(BigDecimal.valueOf(2), SCALE, BigDecimal.ROUND_HALF_UP);\n\t }\n\t return x1;\n\t}\n\t\n\tstatic class Input {\n\t\tstatic StringTokenizer token = null;\n\t\tstatic BufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n//\t\tstatic BufferedReader in;\n//\t\tstatic {\n//\t\t\ttry {\n//\t\t\t\tin = new BufferedReader(new FileReader(\"in.txt\"));\n//\t\t\t} catch (IOException e) {\n//\t\t\t}\n//\t\t}\n\t\tstatic int nextInt() {\n\t\t\treturn Integer.parseInt(nextString());\n\t\t}\n\t\tstatic long nextLong() {\n\t\t\treturn Long.parseLong(nextString());\n\t\t}\n\t\tstatic double nextDouble() {\n\t\t\treturn Double.parseDouble(nextString());\n\t\t}\n\t\tstatic String nextString() {\n\t\t\ttry {\n\t\t\t\twhile (token == null || !token.hasMoreTokens()) {\n\t\t\t\t\ttoken = new StringTokenizer(in.readLine());\n\t\t\t\t}\n\t\t\t} catch (IOException e) {\n\t\t\t}\n\t\t\treturn token.nextToken();\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "divide and conquer", "dfs and similar"], "code_uid": "f5333051661b8fb23eaded6cd4bd791d", "src_uid": "1b17a7b3b41077843ee1d6e0607720d6", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "/*\n * To change this template, choose Tools | Templates\n * and open the template in the editor.\n */\n\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\n/**\n *\n * @author sousnake\n */\npublic class C440_cpy {\n static long arr[];\n public static void main(String[] args) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n long n = Long.parseLong(br.readLine());\n arr = new long[20];\n for(int i=1;i<=16;i++){\n arr[i]=arr[i-1]*10+1;\n }\n System.out.println(fuc(n,16));\n }\n public static long fuc(long n, int d){\n long q =(n/arr[d]*d);\n n %=arr[d];\n if (n==0)\n return q;\n else return q+Math.min(d+fuc(arr[d]-n,d-1),fuc(n,d-1));\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "divide and conquer", "dfs and similar"], "code_uid": "40868340bdaaf38d03cbf775af20f00b", "src_uid": "1b17a7b3b41077843ee1d6e0607720d6", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class candy {\n public static void main (String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int k = sc.nextInt();\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = sc.nextInt();\n }\n int day = 0;\n int arya = 0;\n for (int i = 0; i < n; i++) {\n if (a[i] + arya < 8) {\n day++;\n k -= a[i] + arya;\n arya = 0;\n if (k <= 0) {\n System.out.println(day);\n break;\n }\n\n }\n else if (a[i] + arya >= 8) {\n day++;\n k -= 8;\n arya += a[i] - 8;\n if (k <= 0) {\n System.out.println(day);\n break;\n }\n\n }\n }\n if (k > 0) {\n System.out.println(-1);\n }\n }\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "35559bd9b6c8fc3f68ac5a959e192ff5", "src_uid": "24695b6a2aa573e90f0fe661b0c0bd3a", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "/*\n * To change this template, choose Tools | Templates\n * and open the template in the editor.\n */\n\n\nimport java.util.Scanner;\n\n/**\n *\n * @author Lotus\n */\npublic class B {\n \n public static void main(String[]args)\n {\n Scanner input = new Scanner (System.in);\n String t = input.next();\n String ices = input.next();\n int [] counter = new int[9];\n \n \n \n for(int j=0; j<ices.length();j++)\n {\n \n if(ices.charAt(j)=='9')\n counter[6]++;\n else if(ices.charAt(j)=='5' )\n {\n counter[2]++;\n \n }\n else \n counter[ices.charAt(j)-48]++;\n \n \n }\n int count=0;\n int n;\n boolean m=false;\n while(m!=true)\n {\n for(int i=0; i<t.length();i++)\n {\n \n if(t.charAt(i)=='9')\n n=6;\n \n else if(t.charAt(i)=='5' )\n {\n n=2;\n \n }\n else \n n=t.charAt(i)-48;\n \n counter[n]--;\n if( counter[n]<0)\n {\n m=true;\n break;\n \n }\n }\n if(!m)\n count++;\n \n \n \n }\n \n System.out.println(count);\n \n \n }\n \n}\n", "lang_cluster": "Java", "tags": ["greedy"], "code_uid": "145cc277ab4d22724b81ec6922cc8669", "src_uid": "72a196044787cb8dbd8d350cb60ccc32", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\npublic class Main {\n public static void main(String[] args) throws IOException {\n\n Scanner sc = new Scanner(System.in);\n int n, k;\n n = sc.nextInt();\n k = sc.nextInt();\n String buff_s = sc.next();\n char[] s = buff_s.toCharArray();\n\n boolean ans = false;\n boolean cur = true;\n\n int cnt = 0;\n for (int i = 0; i < n && cur; i++) {\n\n if (s[i] == 'N')\n cnt++;\n else\n cnt = 0;\n\n if (cnt > k)\n cur = false;\n\n }\n\n for (int is = 0; is <= n - k && cur && !ans; is++) {\n\n for (int j = is; j < is + k && cur; j++) {\n if (s[j] == 'Y')\n cur = false;\n }\n\n if (cur) {\n\n if (is > 0 && s[is - 1] == 'N')\n cur = false;\n\n if (is + k < n && s[is + k] == 'N')\n cur = false;\n\n }\n\n if (cur) {\n\n ans = true;\n\n }\n\n cur = true;\n\n }\n\n if (ans) {\n\n System.out.println(\"YES\");\n\n\n } else {\n\n System.out.println(\"NO\");\n\n }\n\n }\n\n\n}", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "e2c05e36a823c5aa78ad69a42e3f76b0", "src_uid": "5bd578d3da5837c259b222336a194d12", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "\nimport java.awt.Point;\nimport java.awt.geom.Line2D;\nimport java.awt.geom.Point2D;\nimport java.io.*;\nimport java.math.BigInteger;\nimport static java.math.BigInteger.*;\nimport java.util.*;\npublic class C{\n\tint n;\n\tint[][]min;\n\tint[][]max;\n\tint[][]active;\t\t\n\tint[]pFlow;\n\tint inf=Integer.MAX_VALUE/100;\n\tint[]res;\n\tint allCost=0;\n\tvoid solve()throws Exception\n\t{\t\t\n\t\t\n\t\tn=nextInt();\n\t\tmin=new int[n][n];\n\t\tmax=new int[n][n];\n\t\tactive=new int[n][n];\n\t\tint sum=0;\n\t\tfor(int step=1;step<=n*(n-1)/2;step++)\n\t\t{\n\t\t\tint a=nextInt()-1;\n\t\t\tint b=nextInt()-1;\n\t\t\tmin[a][b]=nextInt();\n\t\t\tmax[a][b]=nextInt();\n\t\t\tactive[a][b]=nextInt();\n\t\t\tsum+=max[a][b];\n\t\t}\n\t\tres=new int[]{inf,-inf};\n\t\tsum++;\t\t\t\t\t\t\t\t\n\t\tpFlow=new int[n];\n\t\trec(0,1);\n\t\tif(res[0]==inf)\n\t\t\tres=new int[]{-1,-1};\n\t\tSystem.out.println(res[0]+\" \"+res[1]);\n\t}\n\n\t\n\tprivate void rec(int a, int b) {\n\t\tif(res[0]<pFlow[0])\n\t\t\treturn;\n\t\tif(a==n-1)\n\t\t{\t\t\t\t\t\t\t\t\t\n\t\t\tif(pFlow[0]<res[0] || (res[0]==pFlow[0] && allCost>res[1]))\n\t\t\t{\n\t\t\t\tres[0]=pFlow[0];\n\t\t\t\tres[1]=allCost;\n\t\t\t\t \n\t\t\t}\n\t\t\treturn ;\n\t\t}\t\t\n\t\tif(b==n)\n\t\t{\n\t\t\tif(a!=0 && pFlow[a]!=0)\n\t\t\t\treturn;\n\t\t\trec(a+1,a+2);\t\t\t\n\t\t}\n\t\telse\n\t\t{\t\t\t\t\t\t\t\n\t\t\tfor(int x=min[a][b];x<=max[a][b];x++)\n\t\t\t{\n\t\t\t\tint curCost=x*x+(x>0?active[a][b]:0);\n\t\t\t\tpFlow[a]+=x;\n\t\t\t\tpFlow[b]-=x;\n\t\t\t\tallCost+=curCost;\n\t\t\t\trec(a,b+1);\n\t\t\t\tallCost-=curCost;\n\t\t\t\tpFlow[a]-=x;\n\t\t\t\tpFlow[b]+=x;\t\t\t\t\n\t\t\t}\t\t\t\t\t\t\n\t\t}\n\t\t\n\t}\n\n\n\tBufferedReader reader;\n\tPrintWriter writer;\n\tStringTokenizer stk;\n\tvoid run()throws Exception\n\t{\n\t\treader=new BufferedReader(new InputStreamReader(System.in));\n\t\tstk=null;\n\t\twriter=new PrintWriter(System.out);\n\t\tsolve();\n\t\treader.close();\n\t\twriter.close();\n\t}\n\tint nextInt()throws Exception\n\t{\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\tlong nextLong()throws Exception\n\t{\t\n\t\treturn Long.parseLong(nextToken());\n\t}\n\tdouble nextDouble()throws Exception\n\t{\t\t\n\t\treturn Double.parseDouble(nextToken());\n\t}\n\tString nextString()throws Exception\n\t{\n\t\treturn nextToken();\n\t}\n\tString nextLine()throws Exception\n\t{\n\t\treturn reader.readLine();\n\t}\n\tString nextToken()throws Exception\n\t{\n\t\tif(stk==null || !stk.hasMoreTokens())\n\t\t{\n\t\t\tstk=new StringTokenizer(nextLine());\n\t\t\treturn nextToken();\n\t\t}\n\t\treturn stk.nextToken();\n\t}\n\t\n\tpublic static void main(String[]args) throws Exception\n\t{\t\n\t\tnew C().run();\n\n\t}\n\t\n}", "lang_cluster": "Java", "tags": ["brute force"], "code_uid": "db7a41ff6d9c4eb188bdb8dd6a6b8258", "src_uid": "38886ad7b0d83e66b77348be34828426", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int a = in.nextInt();\n int b = in.nextInt();\n int x1 = in.nextInt();\n int y1 = in.nextInt();\n int x2 = in.nextInt();\n int y2 = in.nextInt();\n int LocPar1, LocPar2;\n\n a *= 2;\n b *= 2;\n\n LocPar1 = x1;\n LocPar2 = y1;\n x1 = LocPar1 + LocPar2;\n y1 = LocPar2 - LocPar1;\n\n LocPar1 = x2;\n LocPar2 = y2;\n x2 = LocPar1 + LocPar2;\n y2 = LocPar2 - LocPar1;\n\n if (x1>0)\n x1 = x1/a+1;\n else\n x1 = x1/a;\n if (x2>0)\n x2 = x2/a+1;\n else\n x2 = x2/a;\n if (y1>0)\n y1 = y1/b+1;\n else\n y1 = y1/b;\n if (y2>0)\n y2 = y2/b+1;\n else\n y2 = y2/b;\n System.out.println(Math.max(Math.abs((y2-y1)),Math.abs((x2-x1))));\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "constructive algorithms", "number theory"], "code_uid": "1789474ca343f93c4a032655abf3886d", "src_uid": "7219d1837c83b5920992aee5a60dc0d9", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class codeforces {\n static class pair {\n int x;\n int y;\n\n public pair(int x, int y) {\n this.x = x;\n this.y = y;\n }\n }\n\n public static long sqrt(long x) {\n long s = 0, e = x, root = 0;\n while (s <= e) {\n long mid = (s + e) / 2;\n if (mid * mid == x)\n return mid;\n if (mid * mid < x) {\n root = mid;\n s = mid + 1;\n } else\n e = mid - 1;\n }\n return root;\n }\n\n public static long power(int a, int b) {\n if (a == 0 || b == 0)\n return 1;\n long ans = power(a, b / 2);\n ans *= ans;\n if (b % 2 == 1)\n ans *= a;\n return ans;\n }\n\n public static boolean isSubsequence(String a, String b){\n int m=a.length(),n=b.length(),i=0,j=0;\n while(i<m && j<n){\n if(a.charAt(i)==b.charAt(j)){\n i++;\n }\n j++;\n }\n return i==m;\n }\n\n public static boolean isprime(long x) {\n if (x == 1)\n return false;\n if (x < 4)\n return true;\n int root = (int) Math.sqrt(x);\n for (int i = 2; i <= root; i++) {\n if (x % i == 0)\n return false;\n }\n return true;\n }\n\n public static long max(long a, long b) {\n return Math.max(a, b);\n }\n\n public static long min(long a, long b) {\n return Math.min(a, b);\n }\n\n public static void main(String args[]) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n StringBuilder str = new StringBuilder();\n PrintWriter out = new PrintWriter(System.out);\n // int t = Integer.parseInt(br.readLine());\n ArrayList<Long> a=new ArrayList<>();\n String[] l=br.readLine().split(\" \");\n long n=Long.parseLong(l[0]);\n int k=Integer.parseInt(l[1]);\n long root=(long) Math.sqrt(n);\n int c=0;\n for(long i=1;i<=root;i++){\n if(n%i==0){\n c++;\n a.add(i);\n if(c==k){\n out.println(i);\n break;\n }\n }\n }\n // for(int x:a)\n // out.println(x);\n l:\n if(k>c){\n boolean b=false;\n if(root*root==n)\n b=true;\n if(b && 2*c-1<k){\n out.println(\"-1\");\n break l;\n }\n else\n if(!b && 2*c<k){\n out.println(\"-1\");\n break l;\n }\n else \n if(b){\n str.append(n/a.get(c-(k-c+1))).append(\"\\n\");\n out.print(str);\n break l;\n }\n else{\n str.append(n/a.get(c-(k-c))).append(\"\\n\");\n out.print(str);\n break l; \n } \n }\n // if(k>c)\n // out.print(\"-1\");\n out.close();\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "6d21cd43ec4a8279c0f95747d70836ee", "src_uid": "6ba39b428a2d47b7d199879185797ffb", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main implements Runnable {\n\n\tpublic void _main() throws IOException {\n\t\tint x = nextInt();\n\t\tint y = nextInt();\n\t\tint z = nextInt();\n\t\tint[] a = new int[]{x, y, z};\n\t\tArrays.sort(a);\n\t\tx = a[0];\n\t\ty = a[1];\n\t\tz = a[2];\n\t\tint k = nextInt();\n\t\tif (k > x + y + z - 3)\n\t\t\tk = x + y + z - 3;\n\t\tint b = k / 3;\n\t\tlong dx = 0, dy = 0, dz = 0;\n\t\tif (b > x - 1) {\n\t\t\tdx = x - 1;\n\t\t\tk -= dx;\n\t\t\tb = k / 2;\n\t\t\tif (b > y - 1) {\n\t\t\t\tdy = y - 1;\n\t\t\t\tk -= dy;\n\t\t\t\tdz = Math.min(k, z - 1);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tdy = dz = b;\n\t\t\t\tk -= 2 * b;\n\t\t\t\tif (k > 0) {\n\t\t\t\t\t--k;\n\t\t\t\t\t++dz;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tdx = dy = dz = b;\n\t\t\tk -= 3 * b;\n\t\t\tif (k > 0) {\n\t\t\t\t--k;\n\t\t\t\t++dz;\n\t\t\t}\n\t\t\tif (k > 0) {\n\t\t\t\t--k;\n\t\t\t\t++dy;\n\t\t\t}\n\t\t}\n\t\tdx = Math.min(dx, x - 1);\n\t\tdy = Math.min(dy, y - 1);\n\t\tdz = Math.min(dz, z - 1);\n\t\tout.println((dx + 1) * (dy + 1) * (dz + 1));\n\t}\n\n\n\tprivate BufferedReader in;\n\tprivate PrintWriter out;\n\tprivate StringTokenizer st;\n\n\tprivate String next() throws IOException {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\tString rl = in.readLine();\n\t\t\tif (rl == null)\n\t\t\t\treturn null;\n\t\t\tst = new StringTokenizer(rl);\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tprivate int nextInt() throws IOException {\n\t\treturn Integer.parseInt(next());\n\t}\n\n\tprivate long nextLong() throws IOException {\n\t\treturn Long.parseLong(next());\n\t}\n\n\tprivate double nextDouble() throws IOException {\n\t\treturn Double.parseDouble(next());\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tLocale.setDefault(Locale.UK);\n\t\tnew Thread(new Main()).start();\n\t}\n\n\tpublic void run() {\n\t\ttry {\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(System.out);\n\n\t\t\t_main();\n\n\t\t\tout.close();\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(202);\n\t\t}\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["math", "greedy"], "code_uid": "5eeb49f9e3f7b85f07c418dd1a02dea7", "src_uid": "8787c5d46d7247d93d806264a8957639", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\nimport static java.lang.Math.*;\nimport static java.util.Arrays.fill;\nimport static java.util.Arrays.binarySearch;\nimport static java.util.Arrays.sort;\n\npublic class Main {\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew Thread(null, new Runnable() {\n\t\t\tpublic void run() {\n\t\t\t\ttry {\n\t\t\t\t\ttry {\n\t\t\t\t\t\tif (new File(\"input.txt\").exists())\n\t\t\t\t\t\t\tSystem.setIn(new FileInputStream(\"input.txt\"));\n\t\t\t\t\t} catch (SecurityException e) {}\n\t\t\t\t\tnew Main().run();\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t}, \"1\", 1L << 24).start(); \n\t}\n\n\tBufferedReader in;\n\tPrintWriter out;\n\tStringTokenizer st = new StringTokenizer(\"\");\n\t\n\tint OFFSET = 500;\n\t\n\tint N;\n\tint D;\n\tint[][] dx;\n\tint[][] dy;\n\t\n\tint[][] mem;\n\t\n\tint UNKNOWN = 0;\n\tint WIN = 1;\n\tint LOOSE = 2;\n\t\n\tvoid run() throws IOException {\n\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tint x = nextInt();\n\t\tint y = nextInt();\n\t\tN = nextInt();\n\t\tint d = nextInt(); D = d * d;\n\t\t\n\t\tdx = new int [2][N];\n\t\tdy = new int [2][N];\n\t\t\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tdy[1][i] = dx[0][i] = nextInt();\n\t\t\tdx[1][i] = dy[0][i] = nextInt();\n\t\t}\n\n\t\tmem = new int [2 * OFFSET + 1][2 * OFFSET + 1];\n\t\tout.println(rec(x, y, 0) == WIN ? \"Anton\" : \"Dasha\");\n\t\t\n\t\tout.close();\n\t}\n\t\n\t\n\tint rec(int x, int y, int rot) {\n\t\tif (x * x + y * y > D) return WIN;\n\t\tint mem = mem(x, y);\n\t\tif (mem != UNKNOWN) return mem;\n\t\tint ret = LOOSE;\n\t\tfor (int dir = 0; dir < N; dir++) {\n\t\t\tint nx = x + dx[rot][dir];\n\t\t\tint ny = y + dy[rot][dir];\n\t\t\tint res = rec(nx, ny, rot);\n\t\t\tif (res == LOOSE) {\n\t\t\t\tret = WIN;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\treturn remember(x, y, ret);\n\t}\n\n\tint remember(int x, int y, int val) {\n\t\treturn mem[x + OFFSET][y + OFFSET] = val;\n\t}\n\n\n\tint mem(int x, int y) {\n\t\treturn mem[x + OFFSET][y + OFFSET];\n\t}\n\n\t/*************************************************************** \n\t * Input \n\t **************************************************************/\n\tString nextToken() throws IOException {\n\t\twhile (!st.hasMoreTokens())\n\t\t\tst = new StringTokenizer(in.readLine());\n\t\treturn st.nextToken();\n\t}\n\t\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\t\n\tlong nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\t\n\tdouble nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n\t\n\tString nextLine() throws IOException {\n\t\tst = new StringTokenizer(\"\");\n\t\treturn in.readLine();\n\t}\n\t\n\tboolean EOF() throws IOException {\n\t\twhile (!st.hasMoreTokens()) {\n\t\t\tString s = in.readLine();\n\t\t\tif (s == null)\n\t\t\t\treturn true;\n\t\t\tst = new StringTokenizer(s);\n\t\t}\n\t\treturn false;\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dp", "games"], "code_uid": "fc899a0b77a739da9bbd49564bfb7bcd", "src_uid": "645a6ca9a8dda6946c2cc055a4beb08f", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.math.BigInteger;\nimport java.util.StringTokenizer;\n\npublic class MainE {\n\n private FastScanner in;\n private PrintWriter out;\n\n long MOD = 998244353L;\n\n long[] gcd_ex(long a, long b) {\n if (a == 0) {\n return new long[]{0, 1};\n }\n long[] res = gcd_ex(b % a, a);\n long t = res[0];\n res[0] = res[1] - (b / a) * res[0];\n res[1] = t;\n return res;\n }\n\n long reverse(long a) {\n return (gcd_ex(a, MOD)[0] + 100 * MOD) % MOD;\n }\n\n long powMod(long a, long b) {\n long res = 1;\n long mul = a;\n while (b > 0) {\n if ((b & 1) > 0) {\n res = (res * mul) % MOD;\n }\n mul = (mul * mul) % MOD;\n b /= 2;\n }\n return res;\n }\n\n public void solve() {\n long N = in.nextInt();\n long[] combs = new long[(int)(N + 1)];\n combs[0] = 1;\n for (int i = 1; i <= N; i++) {\n long t = combs[i - 1];\n t = (t * (N - i + 1)) % MOD;\n t = (t * reverse(i)) % MOD;\n combs[i] = t;\n }\n long res = 0;\n long p1 = 1;\n long p2 = 1;\n long R = powMod(reverse(3), N);\n for (int i = 1; i <= N; i++) {\n p1 = (p1 * R) % MOD;\n p2 = (p2 * 3) % MOD;\n long t = combs[i] * p1 % MOD;\n t = (t * p2) % MOD;\n if ((i & 1) > 0) {\n res += 2 * t;\n } else {\n res = (res + 2 * MOD - 2 * t) % MOD;\n }\n res %= MOD;\n }\n res = res * powMod(3, N * N) % MOD;\n long i3 = 1;\n for (int i = 0; i < N; i++){\n long mi3 = (MOD - i3) % MOD;\n i3 = (i3 * 3) % MOD;\n long t = combs[i] * ((MOD + powMod(1 + mi3, N) - powMod(mi3, N)) % MOD) % MOD;\n if ((i & 1) > 0) {\n res += 3 * t;\n } else {\n res = (res + 3 * MOD - 3 * t) % MOD;\n }\n res %= MOD;\n }\n System.out.println(res);\n }\n\n public void run() {\n in = new FastScanner(System.in);\n out = new PrintWriter(System.out);\n solve();\n out.close();\n }\n\n class FastScanner {\n\n BufferedReader br;\n StringTokenizer st;\n\n FastScanner(InputStream is) {\n br = new BufferedReader(new InputStreamReader(is));\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n }\n catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n }\n\n public static void main(String[] arg) {\n new MainE().run();\n }\n}", "lang_cluster": "Java", "tags": ["math", "combinatorics"], "code_uid": "c1a426c193b30de0332f4e1ab18705f3", "src_uid": "6e4b0ee2e1406041a961582ead299a3a", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class D {\n\n\tstatic final int MOD = 1000000007;\n\n\tstatic void solve() throws IOException {\n\t\tint k = nextInt();\n\t\tout.println(get(k));\n\t}\n\n\tprivate static int get(int k) {\n\t\tint answer = 0;\n\n\t\tint maxC = 32;\n\t\tint[][] choose = new int[maxC][maxC];\n\t\tfor (int i = 0; i < maxC; i++) {\n\t\t\tchoose[i][0] = choose[i][i] = 1;\n\t\t\tfor (int j = 1; j < i; j++) {\n\t\t\t\tchoose[i][j] = add(choose[i - 1][j - 1], choose[i - 1][j]);\n\t\t\t}\n\t\t}\n\n\t\tint bitLength = 32 - Integer.numberOfLeadingZeros(k);\n\t\tfor (int matchWithK = 0; matchWithK <= bitLength; matchWithK++) {\n\t\t\tint bitsRemaining = bitLength - matchWithK;\n\t\t\tint onesTotal = Integer.bitCount(k >> bitsRemaining);\n\n\t\t\tif (bitsRemaining > 0 && (k & (1 << bitsRemaining - 1)) == 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tfor (int sizeFirstHalf = 0; sizeFirstHalf <= onesTotal; sizeFirstHalf++) {\n\t\t\t\tif ((sizeFirstHalf == 0) ^ (matchWithK == 0)) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tint chooseFirstHalf;\n\t\t\t\tif (matchWithK > 0) {\n\t\t\t\t\tchooseFirstHalf = chooseFirstHalf(k >> bitsRemaining,\n\t\t\t\t\t\t\tsizeFirstHalf);\n\t\t\t\t} else {\n\t\t\t\t\tchooseFirstHalf = 1;\n\t\t\t\t}\n\n\t\t\t\tif (bitsRemaining == 0) {\n\t\t\t\t\tanswer = add(answer, chooseFirstHalf);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tif (matchWithK > 0) {\n\t\t\t\t\tchooseFirstHalf = mul(chooseFirstHalf,\n\t\t\t\t\t\t\t1 << (sizeFirstHalf - 1));\n\t\t\t\t}\n\t\t\t\tint[] chooseSecondHalf = numberOfSetsSimple(bitsRemaining - 1);\n\t\t\t\tfor (int sizeSecondHalf = 0; sizeSecondHalf < chooseSecondHalf.length; sizeSecondHalf++) {\n\t\t\t\t\tint ways;\n\t\t\t\t\tint chooseSecond = chooseSecondHalf[sizeSecondHalf];\n\t\t\t\t\tif (matchWithK == 0) {\n\t\t\t\t\t\tways = 1;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tways = modPow(2, (bitsRemaining - 1 - sizeSecondHalf)\n\t\t\t\t\t\t\t\t* sizeFirstHalf);\n\t\t\t\t\t}\n\t\t\t\t\tways = mul(ways, chooseSecond);\n\t\t\t\t\tways = mul(ways, chooseFirstHalf);\n\t\t\t\t\tanswer = add(answer, ways);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn answer;\n\t}\n\n\tprivate static int chooseFirstHalf(int mask, int size) {\n\t\tint bits = 32 - Integer.numberOfLeadingZeros(mask);\n\t\tint[][] dp = new int[bits + 1][size + 1];\n\n\t\tdp[1][1] = 1;\n\t\tfor (int bit = 2; bit <= bits; bit++) {\n\t\t\tfor (int s = 1; s <= size; s++) {\n\t\t\t\tint ways1 = mul(1 << (s - 1), dp[bit - 1][s]);\n\t\t\t\tint ways2;\n\t\t\t\tif ((mask & (1 << bits - bit)) == 0) {\n\t\t\t\t\tways2 = 0;\n\t\t\t\t} else {\n\t\t\t\t\tways2 = dp[bit - 1][s - 1];\n\t\t\t\t}\n\t\t\t\tdp[bit][s] = add(ways1, ways2);\n\t\t\t}\n\t\t}\n\t\treturn dp[bits][size];\n\t}\n\n\tprivate static int[] numberOfSetsSimple(int bits) {\n\t\tint[][] dp = new int[bits + 1][bits + 1];\n\t\tdp[0][0] = 1;\n\t\tfor (int b = 1; b <= bits; b++) {\n\t\t\tdp[b][0] = 1;\n\t\t\tfor (int size = 1; size <= b; size++) {\n\t\t\t\tdp[b][size] = add(dp[b - 1][size],\n\t\t\t\t\t\tmul(dp[b - 1][size - 1], 1 << b - size));\n\t\t\t}\n\t\t}\n\t\treturn dp[bits];\n\t}\n\n\tstatic int modPow(int a, long pow) {\n\t\tint res = 1 % MOD;\n\t\twhile (pow > 0) {\n\t\t\tif ((pow & 1) != 0) {\n\t\t\t\tres = mul(res, a);\n\t\t\t}\n\t\t\ta = mul(a, a);\n\t\t\tpow >>= 1;\n\t\t}\n\t\treturn res;\n\t}\n\n\tstatic int add(int a, int b) {\n\t\ta += b;\n\t\tif (a >= MOD || a < 0) {\n\t\t\ta -= MOD;\n\t\t}\n\t\treturn a;\n\t}\n\n\tstatic int mul(int a, int b) {\n\t\treturn (int) ((long) a * b % MOD);\n\t}\n\n\tstatic BufferedReader br;\n\tstatic StringTokenizer st;\n\tstatic PrintWriter out;\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tInputStream input = System.in;\n\t\tPrintStream output = System.out;\n\t\tFile file = new File(\"d.in\");\n\t\tif (file.exists() && file.canRead()) {\n\t\t\tinput = new FileInputStream(file);\n\t\t}\n\t\tbr = new BufferedReader(new InputStreamReader(input));\n\t\tout = new PrintWriter(output);\n\t\tsolve();\n\t\tout.close();\n\t}\n\n\tstatic long nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tstatic double nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n\n\tstatic int nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tstatic String nextToken() throws IOException {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\tString line = br.readLine();\n\t\t\tif (line == null) {\n\t\t\t\treturn null;\n\t\t\t}\n\t\t\tst = new StringTokenizer(line);\n\t\t}\n\t\treturn st.nextToken();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "d735b7114a0d2ae1b204d39830e30a7e", "src_uid": "ead64d8e3134fa8f29881cb487e52f60", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Scanner;\nimport java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.PrintWriter;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Andrey Menkov (nothingelsematters7@gmail.com)\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tScanner in = new Scanner(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskD solver = new TaskD();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskD {\n private long MOD;\n\n private long powInd(long a, long n) {\n if (n == 0) return 1;\n if ((n & 1) != 0) return (a * powInd((a * a) % MOD, n / 2)) % MOD;\n return powInd((a * a) % MOD, n / 2) % MOD;\n }\n\n private long getFibb(long n) {\n long a11 = 1, a12 = 1, a21 = 1, a22 = 0;\n long r11 = 1, r12 = 0;\n long q11 = 0, q12 = 0, q21 = 0, q22 = 0;\n while (n > 0) {\n if ((n & 1) == 1) {\n q11 = (r11 * a11 + r12 * a21) % MOD;\n q12 = (r11 * a12 + r12 * a22) % MOD;\n r11 = q11;\n r12 = q12;\n }\n q11 = (a11 * a11 + a12 * a21) % MOD;\n q12 = (a11 * a12 + a12 * a22) % MOD;\n q21 = (a21 * a11 + a22 * a21) % MOD;\n q22 = (a21 * a12 + a22 * a22) % MOD;\n a11 = q11;\n a12 = q12;\n a21 = q21;\n a22 = q22;\n\n n >>= 1;\n }\n return r12;\n }\n\n public void solve(int testNumber, Scanner in, PrintWriter out) {\n long n = in.nextLong(), k = in.nextLong(), l = in.nextLong(), m = in.nextLong();\n MOD = m;\n\n if (l < 63 && k >= (1L << l)) {\n out.println(0);\n return;\n }\n\n long fib = getFibb(n + 2);\n long pow = powInd(2, n);\n long res = 1;\n\n long diff = pow - fib;\n while (diff < 0) diff += MOD;\n\n for (int bit = 0; bit < l; bit++) {\n if ((k & (1L << bit)) != 0) {\n res = (res * diff) % MOD;\n } else {\n res = (res * fib) % MOD;\n }\n }\n\n\n out.println(res % MOD);\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "combinatorics", "matrices", "implementation", "number theory"], "code_uid": "e58787dffad254439fd5652ab4e98069", "src_uid": "2163eec2ea1eed5da8231d1882cb0f8e", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.io.FilterInputStream;\nimport java.io.BufferedInputStream;\nimport java.io.InputStream;\n\n/**\n * @author khokharnikunj8\n */\n\npublic class Main {\n public static void main(String[] args) {\n new Thread(null, new Runnable() {\n public void run() {\n new Main().solve();\n }\n }, \"1\", 1 << 26).start();\n }\n\n void solve() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n ScanReader in = new ScanReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n AChores solver = new AChores();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class AChores {\n public void solve(int testNumber, ScanReader in, PrintWriter out) {\n int n = in.scanInt();\n int k = in.scanInt();\n int x = in.scanInt();\n long ans = 0;\n for (int i = 0; i < n - k; i++) ans += in.scanInt();\n ans += (x * k);\n out.println(ans);\n }\n\n }\n\n static class ScanReader {\n private byte[] buf = new byte[4 * 1024];\n private int index;\n private BufferedInputStream in;\n private int total;\n\n public ScanReader(InputStream inputStream) {\n in = new BufferedInputStream(inputStream);\n }\n\n private int scan() {\n if (index >= total) {\n index = 0;\n try {\n total = in.read(buf);\n } catch (Exception e) {\n e.printStackTrace();\n }\n if (total <= 0) return -1;\n }\n return buf[index++];\n }\n\n public int scanInt() {\n int integer = 0;\n int n = scan();\n while (isWhiteSpace(n)) n = scan();\n int neg = 1;\n if (n == '-') {\n neg = -1;\n n = scan();\n }\n while (!isWhiteSpace(n)) {\n if (n >= '0' && n <= '9') {\n integer *= 10;\n integer += n - '0';\n n = scan();\n }\n }\n return neg * integer;\n }\n\n private boolean isWhiteSpace(int n) {\n if (n == ' ' || n == '\\n' || n == '\\r' || n == '\\t' || n == -1) return true;\n else return false;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "cf002fa1f55bd5026cfaace626fc8694", "src_uid": "92a233f8d9c73d9f33e4e6116b7d0a96", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\nimport java.util.Comparator;\npublic class Main\n{\n public static void main(String[] args)throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer stk =new StringTokenizer(br.readLine());\n int n = Integer.parseInt(stk.nextToken());\n int m = Integer.parseInt(stk.nextToken());\n int[] arr = new int[n];\n stk = new StringTokenizer(br.readLine());\n\n for(int i=0;i<n;i++){\n arr[i] =Integer.parseInt(stk.nextToken());\n }\n\n Arrays.sort(arr);\n int l = 1;\n int r = n;\n long min = Long.MAX_VALUE;\n while(l<=r){\n int mid = (l+r)/2;\n long sum = 0;\n int cnt = 0 ;\n //System.out.println(mid);\n for(int i=n-1; i >= 0 ; i -= mid){\n for(int k=0;k<mid && i - k >=0;k++){\n sum += Math.max(0,arr[i-k] - cnt);\n }\n cnt++;\n }\n //System.out.println(sum);\n if(sum >= m){\n r = mid -1;\n min = Math.min(mid,min);\n }\n else\n l = mid +1;\n }\n if(min == Long.MAX_VALUE){\n System.out.println(-1);\n }\n else{\n System.out.println(min);\n }\n }\n}\n\n", "lang_cluster": "Java", "tags": ["brute force", "greedy"], "code_uid": "bd33589e433f702532cec1c568b3604f", "src_uid": "acb8a57c8cfdb849a55fa65aff86628d", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\nimport java.math.*;\npublic class codeforces {\n\n \n public static void main(String[] args)\n {\n Scanner sc=new Scanner(System.in);\n String data=sc.next();\n int mem[]=new int[10];\n Arrays.fill(mem, 0);\n for(char x:data.toCharArray())\n {\n \tint t=x-'0';\n \tmem[t]++;\n }\n int num=-1;\n int last=-1;\n for(int i=1;i<=5;i++)\n {\n \tif(mem[i]==0||mem[10-i]==0)\n \t\tcontinue;\n \tint temp[]=new int[10];\n \tfor(int j=0;j<10;j++)\n \t{\n \t\ttemp[j]=mem[j];\n \t}\n \tint tt=1;\n \ttemp[i]--;\n \ttemp[10-i]--;\n \tfor(int j=0;j<=4;j++)\n \t{\n \t\tint k=Math.min(temp[j], temp[9-j]);\n \t\tk=Math.max(0, k);\n \t\ttemp[j]-=k;\n \t\ttemp[9-j]-=k;\n \t\ttt+=2*k;\n \t}\n int mem1[]=new int[10];\n int mem2[]=new int[10];\n for(int j=0;j<10;j++)\n {\n \tmem1[j]=temp[j];\n \tmem2[j]=temp[j];\n }\n mem1[10-i]++;\n mem2[i]++;\n if(mem1[9-i]>0)\n {\n \tmem1[9-i]--;\n \tmem2[i]--;\n \ttt++;\n \t\n }\n if(mem2[i-1]>0)\n {\n \n \tmem1[10-i]--;\n \tmem2[i-1]--;\n \ttt++;\n \n }\n \ttt+=Math.min(mem1[0], mem2[0]);\n \tif(tt>num)\n \t{\n \t\tnum=tt;\n \t\tlast=i;\n \t}\n }\n // System.out.println(last);\n // System.out.println(num);\n if(last==-1)\n {\n \tfor(int i=0;i<2;i++)\n \t{\n \t\tfor(int j=9;j>=0;j--)\n \t\t{\n \t\t\tfor(int k=0;k<mem[j];k++)\n \t\t\t{\n \t\t\t\tSystem.out.print(j);\n \t\t\t}\n \t\t}\n \t\tSystem.out.println(\"\");\n \t}\n \treturn;\n }\n int len=data.length();\n char num1[]=new char[len];\n char num2[]=new char[len];\n int index=len-1;\n int zero=Math.max(0, mem[0]-mem[9]);\n mem[0]-=zero;\n for(int i=0;i<zero;i++,index--)\n {\n \tnum1[index]='0';\n \tnum2[index]='0';\n }\n mem[last]--;\n mem[10-last]--;\n num1[index]=(char)(last+'0');\n num2[index]=(char)(10-last+'0');\n index--;\n for(int i=0;i<=4;i++)\n {\n \tint k=Math.min(mem[i], mem[9-i]);\n \tk=Math.max(0, k);\n \tfor(int j=0;j<k;j++)\n \t{\n \t\tnum1[index]=(char)('0'+i);\n \t\tnum2[index]=(char)('0'+9-i);\n \t\tindex--;\n \t\tnum1[index]=(char)('0'+9-i);\n \t\tnum2[index]=(char)('0'+i);\n \t\tindex--;\n \t}\n \tmem[i]-=k;\n \tmem[9-i]-=k;\n }\n int mem1[]=new int[10];\n int mem2[]=new int[10];\n for(int i=0;i<10;i++)\n {\n \tmem1[i]=mem[i];\n \tmem2[i]=mem[i];\n }\n mem1[10-last]++;\n mem2[last]++;\n if(mem1[9-last]>0)\n {\n \tnum1[index]=(char)('0'+9-last);\n \tnum2[index]=(char)('0'+last);\n \tindex--;\n \tmem1[9-last]--;\n \tmem2[last]--;\n \t\n }\n if(mem2[last-1]>0)\n {\n \tnum1[index]=(char)('0'+10-last);\n \tnum2[index]=(char)('0'+last-1);\n \tmem1[10-last]--;\n \tmem2[last-1]--;\n \tindex--;\n }\n \tint index1=index;\n \tint index2=index;\n for(int i=0;i<10;i++)\n {\n\n \tfor(int j=0;j<mem1[i];j++)\n \t{\n \t\tnum1[index1]=(char)('0'+i);\n \t\tindex1--;\n \t}\n \tfor(int j=0;j<mem2[i];j++)\n \t{\n \t\tnum2[index2]=(char)('0'+i);\n \t\tindex2--;\n \t}\n }\n System.out.println(new String(num1));\n System.out.println(new String(num2));\n return;\n }\n\n}", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "85eb67156de022caacf49eded4a88136", "src_uid": "34b67958a37865e1ca0529bbf528dd9a", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\nimport java.lang.*;\nimport java.math.*;\nimport java.io.*;\n\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\nimport static java.util.Collections.*;\n\n// Hide-and-Seek\n// 2012/04/17\npublic class _P032E{\n\tScanner sc=new Scanner(System.in);\n\n\tint INF=1<<28;\n\tdouble EPS=1e-9;\n\n\tP v, p, w1, w2, m1, m2;\n\n\tvoid run(){\n\t\tv=new P(sc.nextInt(), sc.nextInt());\n\t\tp=new P(sc.nextInt(), sc.nextInt());\n\t\tw1=new P(sc.nextInt(), sc.nextInt());\n\t\tw2=new P(sc.nextInt(), sc.nextInt());\n\t\tm1=new P(sc.nextInt(), sc.nextInt());\n\t\tm2=new P(sc.nextInt(), sc.nextInt());\n\t\tsolve();\n\t}\n\n\tvoid solve(){\n\t\tprintln((ok1()||ok2())?\"YES\":\"NO\");\n\t}\n\n\tboolean ok1(){\n\t\tif(crsSS(p, v, w1, w2)){\n\t\t\treturn false;\n\t\t}else if(crsSS(p, v, m1, m2)){\n\t\t\treturn linear(p, v, m1)&&linear(p, v, m2);\n\t\t}else{\n\t\t\treturn true;\n\t\t}\n\t}\n\n\tboolean ok2(){\n\t\tP m=m2.sub(m1);\n\t\tif(m.det(p.sub(m1))*m.det(v.sub(m1))<EPS){\n\t\t\treturn false;\n\t\t}else{\n\t\t\tP h=isLL(m1, m2, p, proj(m1, m2, v).mul(2).sub(v));\n\t\t\treturn disSP(m1, m2, h)<EPS&&!crsSS(p, h, w1, w2)\n\t\t\t\t\t&&!crsSS(h, v, w1, w2);\n\t\t}\n\t}\n\n\t// p1,p2,p3の1直線上判定\n\tboolean linear(P p1, P p2, P p3){\n\t\treturn abs(p2.sub(p1).det(p3.sub(p1))/2)<EPS;\n\t}\n\n\t// 線分と点の距離\n\tdouble disSP(P p1, P p2, P q){\n\t\tif(p2.sub(p1).dot(q.sub(p1))<EPS)\n\t\t\treturn q.sub(p1).abs();\n\t\tif(p1.sub(p2).dot(q.sub(p2))<EPS)\n\t\t\treturn q.sub(p2).abs();\n\t\treturn disLP(p1, p2, q);\n\t}\n\n\t// 直線と点の距離\n\tdouble disLP(P p1, P p2, P q){\n\t\treturn abs(p2.sub(p1).det(q.sub(p1)))/p2.sub(p1).abs();\n\t}\n\n\t// 線分と線分の交差判定\n\tboolean crsSS(P p1, P p2, P q1, P q2){\n\t\tif(max(p1.x, p2.x)+EPS<min(q1.x, q2.x))\n\t\t\treturn false;\n\t\tif(max(q1.x, q2.x)+EPS<min(p1.x, p2.x))\n\t\t\treturn false;\n\t\tif(max(p1.y, p2.y)+EPS<min(q1.y, q2.y))\n\t\t\treturn false;\n\t\tif(max(q1.y, q2.y)+EPS<min(p1.y, p2.y))\n\t\t\treturn false;\n\t\treturn signum(p2.sub(p1).det(q1.sub(p1)))\n\t\t\t\t*signum(p2.sub(p1).det(q2.sub(p1)))<EPS\n\t\t\t\t&&signum(q2.sub(q1).det(p1.sub(q1)))\n\t\t\t\t\t\t*signum(q2.sub(q1).det(p2.sub(q1)))<EPS;\n\t}\n\n\t// 点から直線に下ろした垂線の足\n\tP proj(P p1, P p2, P q){\n\t\treturn p1.add(p2.sub(p1).mul(\n\t\t\t\tp2.sub(p1).dot(q.sub(p1))/p2.sub(p1).abs2()));\n\t}\n\n\t// 直線と直線の交点\n\tP isLL(P p1, P p2, P q1, P q2){\n\t\tdouble d=q2.sub(q1).det(p2.sub(p1));\n\t\tif(abs(d)<EPS)\n\t\t\treturn null;\n\t\treturn p1.add(p2.sub(p1).mul(q2.sub(q1).det(q1.sub(p1))/d));\n\t}\n\n\tclass P{\n\t\tdouble x, y;\n\n\t\tP(){\n\t\t\tthis(0, 0);\n\t\t}\n\n\t\tP(double x, double y){\n\t\t\tthis.x=x;\n\t\t\tthis.y=y;\n\t\t}\n\n\t\tP add(P p){\n\t\t\treturn new P(x+p.x, y+p.y);\n\t\t}\n\n\t\tP sub(P p){\n\t\t\treturn new P(x-p.x, y-p.y);\n\t\t}\n\n\t\tP mul(double m){\n\t\t\treturn new P(x*m, y*m);\n\t\t}\n\n\t\tP div(double d){\n\t\t\treturn new P(x/d, y/d);\n\t\t}\n\n\t\tdouble abs(){\n\t\t\treturn sqrt(abs2());\n\t\t}\n\n\t\tdouble abs2(){\n\t\t\treturn x*x+y*y;\n\t\t}\n\n\t\tdouble arg(){\n\t\t\treturn atan2(y, x);\n\t\t}\n\n\t\tdouble dot(P p){\n\t\t\treturn x*p.x+y*p.y;\n\t\t}\n\n\t\tdouble det(P p){\n\t\t\treturn x*p.y-y*p.x;\n\t\t}\n\n\t\tdouble ang(P p){\n\t\t\treturn atan2(det(p), dot(p));\n\t\t}\n\n\t\tP rot(double d){\n\t\t\treturn new P(cos(d)*x-sin(d)*y, sin(d)*x+cos(d)*y);\n\t\t}\n\t}\n\n\tvoid println(String s){\n\t\tSystem.out.println(s);\n\t}\n\n\tvoid print(String s){\n\t\tSystem.out.print(s);\n\t}\n\n\tvoid debug(Object... os){\n\t\tSystem.err.println(Arrays.deepToString(os));\n\t}\n\n\tpublic static void main(String[] args){\n\t\tLocale.setDefault(Locale.US);\n\t\tnew _P032E().run();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["geometry", "implementation"], "code_uid": "22530f10473dd535d2654d4ca48db92f", "src_uid": "7539a41268b68238d644795bccaa0c0f", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main implements Runnable {\n\t\n\tfinal static double eps = 1e-7;\n\t\n\tclass Point {\n\t\tdouble x, y;\n\t\tPoint(double x, double y) {\n\t\t\tthis.x = x;\n\t\t\tthis.y = y;\n\t\t}\n\t\tPoint add(Point o) {\n\t\t\treturn new Point(x + o.x, y + o.y);\n\t\t}\n\t\tPoint sub(Point o) {\n\t\t\treturn new Point(x - o.x, y - o.y);\n\t\t}\n\t\tPoint scale(double f) {\n\t\t\treturn new Point(x * f, y * f);\n\t\t}\n\t\tdouble len() {\n\t\t\treturn Math.sqrt(x * x + y * y);\n\t\t}\n\t}\n\n\tdouble dot(Point a, Point b) {\n\t\treturn a.x * b.x + a.y * b.y;\n\t}\n\t\n\tdouble cross(Point a, Point b) {\n\t\treturn a.x * b.y - a.y * b.x;\t\n\t}\n\n\tboolean onSegment(Point x, Point a, Point b) {\n\t\tif (!zero(cross(a.sub(x), b.sub(x))))\n\t\t\treturn false;\n\t\treturn dot(a.sub(x), b.sub(x)) <= eps;\n\t}\n\n\tPoint linesIntersection(Point a, Point b, Point c, Point d) {\n\t\tdouble d1 = cross(c.sub(a), b.sub(a));\n\t\tdouble d2 = cross(d.sub(a), b.sub(a));\n\t\tif (Math.abs(d1 - d2) < eps)\n\t\t\treturn null;\t\t\n\t\treturn (d.scale(d1).sub(c.scale(d2))).scale(1 / (d1 - d2));\n\t}\n\n\tboolean segsIntersect(Point a, Point b, Point c, Point d) {\n\t\tPoint p = linesIntersection(a, b, c, d);\n\t\tif (p == null)\n\t\t\treturn false;\n\t\treturn onSegment(p, a, b) && onSegment(p, c, d);\n\t}\n\n\tboolean zero(double x) {\n\t\treturn Math.abs(x) < eps;\n\t}\n\n\tint sign(double x) {\n\t\tif (zero(x)) return 0;\n\t\treturn x < 0 ? -1 : 1;\n\t}\n\n\tPoint reflect(Point x, Point a, Point b) {\n\t\tPoint v = x.sub(a);\n\t\tPoint dir = b.sub(a);\n\t\tdir = dir.scale(1 / dir.len());\n\t\tPoint pr = dir.scale(dot(dir, v));\n\t\treturn a.add(pr.scale(2).sub(v));\n\t}\n\n\tpublic void _main() throws IOException {\n\t\tPoint v = new Point(nextDouble(),nextDouble());\n\t\tPoint p = new Point(nextDouble(),nextDouble());\n\t\tPoint w1 = new Point(nextDouble(),nextDouble());\n\t\tPoint w2 = new Point(nextDouble(),nextDouble());\n\t\tPoint m1 = new Point(nextDouble(),nextDouble());\n\t\tPoint m2 = new Point(nextDouble(),nextDouble());\n\n\t\tif (!segsIntersect(v, p, w1, w2) && !onSegment(w1, v, p) && !onSegment(w2, v, p)) {\n\t\t\tif (zero(cross(m1.sub(v), m1.sub(p))) && \n\t\t\t\tzero(cross(m2.sub(v), m2.sub(p))) ||\n\t\t\t\t!segsIntersect(v, p, m1, m2)) \n\t\t\t{\n\t\t\t\tout.print(\"YES\");\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\n\t\tint sideV = sign(cross(v.sub(m1), m2.sub(m1)));\n\t\tint sideP = sign(cross(p.sub(m1), m2.sub(m1)));\n\t\tif (sideV != sideP) {\n\t\t\tout.print(\"NO\");\n\t\t\treturn;\n\t\t}\n\t\tPoint ref = linesIntersection(v, reflect(p, m1, m2), m1, m2);\n\t\tif (ref == null || !onSegment(ref, m1, m2)) {\n\t\t\tout.print(\"NO\");\n\t\t\treturn;\n\t\t}\n\t\tout.println((!segsIntersect(p, ref, w1, w2) && !segsIntersect(v, ref, w1, w2)) ? \"YES\" : \"NO\");\n\t}\n\n\tprivate BufferedReader in;\n\tprivate PrintWriter out;\n\tprivate StringTokenizer st;\n\n\tprivate String next() throws IOException {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\tString rl = in.readLine();\n\t\t\tif (rl == null)\n\t\t\t\treturn null;\n\t\t\tst = new StringTokenizer(rl);\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tprivate int nextInt() throws IOException {\n\t\treturn Integer.parseInt(next());\n\t}\n\n\tprivate long nextLong() throws IOException {\n\t\treturn Long.parseLong(next());\n\t}\n\n\tprivate double nextDouble() throws IOException {\n\t\treturn Double.parseDouble(next());\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tLocale.setDefault(Locale.UK);\n\t\tnew Thread(new Main()).start();\n\t}\n\n\tpublic void run() {\n\t\ttry {\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(System.out);\n\n\t\t\t_main();\n\n\t\t\tout.close();\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(202);\n\t\t}\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["geometry", "implementation"], "code_uid": "862eddc44ba3255286e643798348823d", "src_uid": "7539a41268b68238d644795bccaa0c0f", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.text.DecimalFormat;\nimport java.util.StringTokenizer;\n\npublic class b implements Runnable {\n\n\tVec me, other;\n\tSeg wall, mirror;\n\t\n\tdouble getAngle(Vec a, Vec mid, Vec b) {\n\t\tVec u = a.sub(mid), v = b.sub(mid);\n\t\t//u.v = |u|*|v|*cos(theta)\n\t\t//theta = arccos((u.v)/(|u|*|v|))\n\t\treturn Math.acos(u.dot(v) / u.mag() / v.mag());\n\t}\n\t\n\tdouble go(double scale) {\n\t\tVec unit = mirror.dir.unit();\n\t\tVec leftmost = mirror.from.sub(unit);\n\t\tVec rightmost = mirror.to.add(unit);\n\t\tVec pt = mirror.from.add(unit.scale(scale));\n\t\tdouble left = getAngle(me, pt, leftmost);\n\t\tdouble right = getAngle(other, pt, rightmost);\n\t\treturn Math.abs(left - right);\n\t}\n\t\n\tpublic void solve(FS in, PrintWriter out) {\n\t\tme = new Vec(in.nextDouble(), in.nextDouble());\n\t\tother = new Vec(in.nextDouble(), in.nextDouble());\n\t\twall = new Seg(new Vec(in.nextDouble(), in.nextDouble()), new Vec(in.nextDouble(), in.nextDouble()));\n\t\tmirror = new Seg(new Vec(in.nextDouble(), in.nextDouble()), new Vec(in.nextDouble(), in.nextDouble()));\n\t\t\n\t\tSeg meOther = new Seg(me, other);\n\t\tif(!meOther.intersects(wall, true) && !meOther.intersects(mirror, false)) {\n\t\t\tout.println(\"YES\");\n\t\t\treturn;\n\t\t}\n\t\tif(meOther.intersects(mirror, false)) {\n\t\t\tout.println(\"NO\");\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tdouble lo = 0, hi = mirror.dir.mag();\n\t\tfor(int it = 0; it < 2000; ++it) {\n\t\t\tdouble delta = (hi - lo) / 3;\n\t\t\tdouble m1 = lo + delta, m2 = hi - delta;\n\t\t\tdouble leftDiff = go(m1), rightDiff = go(m2);\n\t\t\tif(leftDiff < rightDiff) hi = m2;\n\t\t\telse lo = m1;\n\t\t}\n\t\t\n\t\tVec mirrorPt = mirror.from.add(mirror.dir.unit().scale(lo));\n\t\tdouble diff = go(lo);\n\t\tif(diff > 1e-6) {\n\t\t\tout.println(\"NO\");\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tif(!mirror.containsPoint(mirrorPt)) {\n\t\t\tout.println(\"NO\");\n\t\t\treturn;\n\t\t}\n\t\tSeg meMirror = new Seg(me, mirrorPt);\n\t\tSeg otherMirror = new Seg(other, mirrorPt);\n\t\tif(meMirror.intersects(wall, true) || otherMirror.intersects(wall, true)) {\n\t\t\tout.println(\"NO\");\n\t\t\treturn;\n\t\t}\n\t\tout.println(\"YES\");\n\t}\n\t\n\tpublic void run() {\n\t\tSystem.err.println(\"go!\");\n\t\tFS in = new FS();\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tsolve(in, out);\n\t\tout.close();\n\t}\n\t\n\tstatic class Vec {\n\t\tstatic final double EPS=1e-6;\n\t\tdouble x, y;\n\t\t\n\t\tpublic Vec(double x, double y) {\n\t\t\tthis.x=x;\n\t\t\tthis.y=y;\n\t\t}\n\t\t\n\t\tpublic Vec add(Vec o) {\n\t\t\treturn new Vec(x+o.x, y+o.y);\n\t\t}\n\t\t\n\t\tpublic Vec sub(Vec o) {\n\t\t\treturn new Vec(x-o.x, y-o.y);\n\t\t}\n\n\t\tpublic Vec scale(double s) {\n\t\t\treturn new Vec(x*s, y*s);\n\t\t}\n\t\t\n\t\tpublic double dot(Vec o) {\n\t\t\treturn x*o.x+y*o.y;\n\t\t}\n\t\t\n\t\tpublic double cross(Vec o) {\n\t\t\treturn x*o.y-y*o.x;\n\t\t}\n\t\t\n\t\tpublic double mag2() {\n\t\t\treturn dot(this);\n\t\t}\n\t\t\n\t\tpublic double mag() {\n\t\t\treturn Math.sqrt(mag2());\n\t\t}\n\t\t\n\t\tpublic Vec unit() {\n\t\t\treturn scale(1/mag());\n\t\t}\n\t\t\n\t\tpublic Vec rot90() {\n\t\t\treturn new Vec(-y, x);\n\t\t}\n\t\t\n\t\tpublic Vec rot270() {\n\t\t\treturn new Vec(y, -x);\n\t\t}\n\t\t\n\t\tpublic Vec rotate(double theta) {\n\t\t\tdouble PI=Math.PI;\n\t\t\tdouble newX=x*Math.cos(theta)+y*Math.cos(PI/2+theta);\n\t\t\tdouble newY=x*Math.sin(theta)+y*Math.sin(PI/2+theta);\n\t\t\treturn new Vec(newX, newY);\n\t\t}\n\t\t\n\t\t//angle between 0 and 2PI\n\t\tpublic double angle() {\n\t\t\treturn (Math.atan2(y, x)+2*Math.PI)%(2*Math.PI);\n\t\t}\n\t\t\n\t\tpublic String toString() {\n\t\t\tDecimalFormat df=new DecimalFormat(\"#.##\");\n\t\t\treturn \"(\"+df.format(x)+\", \"+df.format(y)+\")\";\n\t\t}\n\t\t\n\t\tstatic boolean eq(double a, double b) {\n\t\t\treturn Math.abs(a-b)<EPS;\n\t\t}\n\t\t\n\t\tstatic boolean leq(double a, double b) {\n\t\t\treturn a-EPS<b;\n\t\t}\n\t\t\n\t\tstatic boolean geq(double a, double b) {\n\t\t\treturn a+EPS>b;\n\t\t}\n\t\t\n\t\tpublic boolean equals(Object oo) {\n\t\t\tVec o=(Vec)oo;\n\t\t\treturn eq(x, o.x)&&eq(y, o.y);\n\t\t}\n\t}\n\n\tstatic class Seg {\n\t\tVec from, to, dir;\n\t\t\n\t\tpublic Seg(Vec from, Vec to) {\n\t\t\tthis.from=from;\n\t\t\tthis.to=to;\n\t\t\tdir=to.sub(from);\n\t\t}\n\t\t\n\t\t//line-line intersection\n\t\tpublic Vec lineIntersect(Seg o) {\n\t\t\tdouble det=o.dir.x*dir.y-dir.x*o.dir.y;\n\t\t\tif (Vec.eq(det, 0)) return null;\n\t\t\tdouble dist=(o.dir.x*(o.from.y-from.y)-\n\t\t\t\t\to.dir.y*(o.from.x-from.x))/det;\n\t\t\treturn from.add(dir.scale(dist));\n\t\t}\n\t\t\n\t\tpublic boolean containsPoint(Vec o) {\n\t\t\tdouble distFromLine=dir.unit().cross(o.sub(from));\n\t\t\tif (!Vec.eq(distFromLine, 0)) return false;\n\t\t\treturn Vec.eq(dir.mag(), from.sub(o).mag()+to.sub(o).mag());\n\t\t}\n\t\t\n\t\t//seg-seg intersection\n\t\tpublic Vec segIntersection(Seg o) {\n\t\t\tVec intersect=lineIntersect(o);\n\t\t\treturn containsPoint(intersect)&&o.containsPoint(intersect)?intersect:null;\n\t\t}\n\t\t\n\t\t//returns 1 if above, 0 if on, -1 if below\n\t\tpublic int side(Vec o) {\n\t\t\tVec oDir=o.sub(from);\n\t\t\tdouble distFromLine=dir.unit().cross(oDir);\n\t\t\tif (Vec.eq(distFromLine, 0))\n\t\t\t\treturn 0;\n\t\t\treturn (int)Math.signum(distFromLine);\n\t\t}\n\t\t\n\t\tpublic boolean intersects(Seg o, boolean isWall) {\n\t\t\tif(isWall && (containsPoint(o.from) || containsPoint(o.to))) return true;\n\t\t\treturn side(o.from)!=side(o.to) && o.side(from)!=o.side(to);\n\t\t}\n\t\t\n\t\tpublic Vec getClosestTo(Vec o) {\n\t\t\tdouble percentThere=o.sub(from).dot(dir)/dir.mag2();\n\t\t\treturn from.add(dir.scale(Math.max(0, Math.min(1, percentThere))));\n\t\t}\n\t\t\n\t\tpublic Vec projectToLine(Vec o) {\n\t\t\treturn dir.scale(o.sub(from).dot(dir)/dir.mag2()).add(from);\n\t\t}\n\t\t\n\t\t//toContain must be a point with positive x and y coordinates.\n\t\t//this method returns the shortest line segment from the x-axis to the point to the y axis\n\t\tstatic Seg getShortestSegFromAxesContainingQ1Point(Vec toContain) {\n\t\t\tdouble slope=-Math.pow(toContain.y/toContain.x, 1.0/3);\n\t\t\tdouble b=toContain.y-toContain.x*slope;\n\t\t\tdouble xInt=-b/slope;\n\t\t\treturn new Seg(new Vec(0, b), new Vec(xInt, 0));\n\t\t}\n\t\t\n\t\tpublic String toString() {\n\t\t\treturn from+\" -> \"+to;\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tnew Thread(null, new b(), \"lmao\", 1L<<28).start();\n\t}\n\tstatic class FS {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st = new StringTokenizer(\"\");\n\t\tString next() {\n\t\t\twhile(!st.hasMoreElements()) {\n\t\t\t\ttry { st = new StringTokenizer(br.readLine()); }\n\t\t\t\tcatch(Exception e) {}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["geometry", "implementation"], "code_uid": "ed2466c959266a29699766086b0b568e", "src_uid": "7539a41268b68238d644795bccaa0c0f", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class F implements Runnable{\n\tpublic static void main (String[] args) {new Thread(null, new F(), \"_cf\", 1 << 28).start();}\n\n\tpublic void run() {\n\t\tFastScanner fs = new FastScanner();\n\t\tPrintWriter out = new PrintWriter(System.out);\n\n\t\tint oo = (int)2e9;\n\t\tint n = fs.nextInt();\n\t\tint k = fs.nextInt();\n\t\tint[] dp = new int[n + 1], tdp = new int[n + 1];\n\t\tArrays.fill(dp, oo);\n\t\tdp[0] = 0;\n\t\twhile(k-->0) {\n\t\t\tint l = fs.nextInt(), r = fs.nextInt(), len = r - l;\n\t\t\tfor(int i = 0; i <= n; i++) tdp[i] = dp[i];\n\t\t\tArrayDeque<Integer> minQueue = new ArrayDeque<>();\n\t\t\tfor(int i = 0; i <= n; i++) {\n\t\t\t\tpush(minQueue, i, dp);\n\t\t\t\ttdp[i] = Math.min(tdp[i], best(minQueue, dp) + 2);\n\t\t\t\tif(r - i >= 0 && r - i <= n) tdp[r - i] = Math.min(tdp[r - i], best(minQueue, dp) + 1);\n\t\t\t\tpop(minQueue, i - len);\n\t\t\t}\n\t\t\tfor(int i = 0; i <= n; i++) dp[i] = tdp[i];\n\t\t}\n\t\t\n\t\tif(dp[n] >= oo) out.println(\"Hungry\");\n\t\telse out.printf(\"Full\\n%d\\n\", dp[n]);\n\n\t\tout.close();\n\t}\n\t\n\tvoid pop(ArrayDeque<Integer> minQueue, int idx) {\n\t\tif(!minQueue.isEmpty() && minQueue.peekFirst() == idx) minQueue.pollFirst();\n\t}\n\t\n\tint best(ArrayDeque<Integer> minQueue, int[] dp) {\n\t\tif(minQueue.isEmpty()) return (int)2e9;\n\t\treturn dp[minQueue.peekFirst()];\n\t}\n\t\n\tvoid push(ArrayDeque<Integer> minQueue, int p, int[] dp) {\n\t\twhile(!minQueue.isEmpty() && dp[minQueue.getLast()] >= dp[p]) minQueue.pollLast();\n\t\tminQueue.addLast(p);\n\t}\n\t\n\t/*\n\t * dp[i][j] means the minimum number of moves to cook the cutlet on one side\n\t for j seconds after processing i intervals (do iterative space saving)\n\t * The length of the interval is known and so we'll build up time j with the\n\t previous length values (including j) all from the previous state. It'll take\n\t an extra 2 flips to so:\n\t if we know the number of flips to get the cutlet to exactly t seconds and we\n\t want to get it to j seconds in the current interval being processed, then we'll\n\t need to flip it after it gets to t seconds in the other interval (to prevent overcooking)\n\t and then flip it again when it needs to cook in our interval to get it to the desired j.\n\t * There's also a case where we can just flip it once based off of the previous states.\n\t The main idea for some time j, is we want the cutlet to get to its jth second of cooking\n\t during our current interval (so we can do a flip if necessary). So what happens is we take\n\t the min of the dp values that are allowed in our current range and use that value to calculate\n\t (right - j)'s best value by taking that minimum and I guess not flipping it and instead letting\n\t it cook. Still a bit hazy but it makes sense when doing the second sample by hand (especially\n\t when we update times 10 and 8).\n\t * Definitely had to study someone else's solution because the editorial is very obscure and\n\t doesn't actually explain the important part of the problem (how to derive the +1 and +2 jumps).\n\t */\n\n\tclass FastScanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\t\tpublic FastScanner() {\n\t\t\ttry\t{\n\t\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t\t\t// br = new BufferedReader(new FileReader(\"testdata.out\"));\n\t\t\t\tst = new StringTokenizer(\"\");\n\t\t\t} catch (Exception e){e.printStackTrace();}\n\t\t}\n\t\tpublic String next() {\n\t\t\tif (st.hasMoreTokens())\treturn st.nextToken();\n\t\t\ttry {st = new StringTokenizer(br.readLine());}\n\t\t\tcatch (Exception e) {e.printStackTrace();}\n\t\t\treturn st.nextToken();\n\t\t}\n\t\tpublic int nextInt() {return Integer.parseInt(next());}\n\t\tpublic long nextLong() {return Long.parseLong(next());}\n\t\tpublic double nextDouble() {return Double.parseDouble(next());}\n\n\t\tpublic String nextLine() {\n\t\t\tString line = \"\";\n\t\t\ttry {line = br.readLine();}\n\t\t\tcatch (Exception e) {e.printStackTrace();}\n\t\t\treturn line;\n\t\t}\n\t\tpublic Integer[] nextIntegerArray(int n) {\n\t\t\tInteger[] a = new Integer[n];\n\t\t\tfor(int i = 0; i < n; i++) a[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] a = new int[n];\n\t\t\tfor(int i = 0; i < n; i++) a[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\t\tpublic char[] nextCharArray() {return nextLine().toCharArray();}\n\t}\n\n}", "lang_cluster": "Java", "tags": ["dp", "data structures"], "code_uid": "4b2ed7243e9079115fb3349ef4443cd7", "src_uid": "2e0d1b1f1a7b8df2d2598c3cb2c869d5", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.DataInputStream;\nimport java.io.IOException;\n\npublic class Task939F {\n\n public static class FastScanner {\n\n protected DataInputStream dataInputStream;\n protected byte[] buffer = new byte[0x10000];\n protected int bufferOffset;\n protected int bufferLength;\n protected boolean isEndOfFile;\n\n public FastScanner() throws IOException {\n dataInputStream = new DataInputStream(System.in);\n Read();\n }\n\n protected void Read() throws IOException {\n final int length = dataInputStream.read(buffer);\n if (length > 0) {\n bufferLength = length;\n } else {\n bufferLength = 0;\n isEndOfFile = true;\n }\n bufferOffset = 0;\n }\n\n protected byte nextByte() throws IOException {\n if (bufferOffset == bufferLength) {\n if (!isEndOfFile) Read();\n if (isEndOfFile) return 0;\n }\n return buffer[bufferOffset++];\n }\n\n public int nextInt() throws IOException {\n int a = 0;\n boolean isNegative = false;\n\n byte b = nextByte();\n while (b <= ' ') b = nextByte();\n if (b == '-') {\n isNegative = true;\n b = nextByte();\n }\n while (b > ' ') {\n a = a * 10 + (b - '0');\n b = nextByte();\n }\n return isNegative ? -a : a;\n }\n\n }\n\n public static void SaveRotates(final int num) {\n if (minNumRotates == 0) minNumRotates = num;\n else minNumRotates = Math.min(minNumRotates, num);\n }\n\n public static void CalcRotates(int side, final int[] tmin, final int[] tmax,\n int noffset, int koffset, boolean isInterval) {\n if (tmin[0] > n || tmin[1] > n) return;\n else if ((tmin[0] <= n && tmax[0] >= n) || (tmin[1] <= n && tmax[1] >= n)) {\n if ((tmax[0] < n && side == 1) || (tmax[1] < n && side == 0)) {\n SaveRotates(numRotates + 1);\n } else {\n SaveRotates(numRotates);\n }\n return;\n } else if (koffset == k) return;\n\n if (isInterval) {\n if (kbeg[koffset] == kend[koffset]) {\n // no rotate\n CalcRotates(side, tmin, tmax, noffset, koffset + 1, false);\n\n // rotate\n numRotates++;\n CalcRotates(1 - side, tmin, tmax, noffset, koffset + 1, false);\n numRotates--;\n\n } else {\n // no rotate\n tmin[side] += kend[koffset] - kbeg[koffset];\n tmax[side] += kend[koffset] - kbeg[koffset];\n CalcRotates(side, tmin, tmax, kend[koffset], koffset + 1, false);\n tmin[side] -= kend[koffset] - kbeg[koffset];\n tmax[side] -= kend[koffset] - kbeg[koffset];\n\n // rotate once\n tmax[side] += kend[koffset] - kbeg[koffset];\n tmax[1 - side] += kend[koffset] - kbeg[koffset];\n numRotates++;\n CalcRotates(1 - side, tmin, tmax, kend[koffset], koffset + 1, false);\n numRotates--;\n tmax[side] -= kend[koffset] - kbeg[koffset];\n tmax[1 - side] -= kend[koffset] - kbeg[koffset];\n\n // rotate twice\n tmax[side] += kend[koffset] - kbeg[koffset];\n tmin[1 - side] += 1;\n tmax[1 - side] += kend[koffset] - kbeg[koffset] - 1;\n numRotates += 2;\n CalcRotates(side, tmin, tmax, kend[koffset], koffset + 1, false);\n numRotates -= 2;\n tmax[side] -= kend[koffset] - kbeg[koffset];\n tmin[1 - side] -= 1;\n tmax[1 - side] -= kend[koffset] - kbeg[koffset] - 1;\n\n }\n\n } else {\n tmin[side] += kbeg[koffset] - noffset;\n tmax[side] += kbeg[koffset] - noffset;\n CalcRotates(side, tmin, tmax, kbeg[koffset], koffset, true);\n tmin[side] -= kbeg[koffset] - noffset;\n tmax[side] -= kbeg[koffset] - noffset;\n }\n }\n\n public static int[] kbeg;\n public static int[] kend;\n public static int n = 0;\n public static int k = 0;\n public static int numRotates = 0;\n public static int minNumRotates = 0;\n\n public static void main(final String[] args) throws IOException {\n final FastScanner scanner = new FastScanner();\n n = scanner.nextInt();\n k = scanner.nextInt();\n\n kbeg = new int[k];\n kend = new int[k];\n\n for (int i = 0; i < k; i++) {\n kbeg[i] = scanner.nextInt();\n kend[i] = scanner.nextInt();\n }\n final int[] tmin = new int[2];\n final int[] tmax = new int[2];\n\n CalcRotates(0, tmin, tmax, 0, 0, false);\n if (minNumRotates > 0) {\n System.out.println(\"Full\");\n System.out.println(minNumRotates);\n } else {\n System.out.println(\"Hungry\");\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["dp", "data structures"], "code_uid": "8986618bfd508986313ec832bb2a9ed0", "src_uid": "2e0d1b1f1a7b8df2d2598c3cb2c869d5", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\n/*\nTASK: cutlet\nLANG: JAVA\n */\npublic class cutlet {\n static int n , k , lo , hi;\n static int[][] segs;\n static int[] l , delt;\n static int[][][] dp;\n static ArrayList<int[]> finSeg = new ArrayList<int[]>();\n public static void main(String[] args) throws IOException {\n FastScanner in = new FastScanner(System.in);\n n = in.nextInt();\n k = in.nextInt();\n segs = new int[k][2];\n for(int i = 0;i < k; i++){\n segs[i][0] = in.nextInt();\n segs[i][1] = in.nextInt();\n }\n Arrays.sort(segs, new Comparator<int[]>() {\n @Override\n public int compare(int[] o1, int[] o2) {\n return o1[0] - o2[0];\n }\n });\n for(int i = 0;i < k; i++){\n lo = segs[i][0];\n hi = segs[i][0];\n while(i < k && segs[i][0] <= hi)hi = Math.max(hi , segs[i++][1]);\n int[] add = {lo , hi};\n finSeg.add(add);\n i--;\n }\n k = finSeg.size();\n segs = new int[k][2];\n l = new int[k];\n delt = new int[k];\n for(int i = 0;i < k; i++)segs[i] = finSeg.get(i);\n for(int i = 0;i < k; i++){\n l[i] = segs[i][1] - segs[i][0];\n delt[i] = i < k-1 ? segs[i+1][0] - segs[i][1] : 2*n - segs[i][1];\n }\n dp = new int[2][k+1][2*n+1];\n for(int i = 0;i < 2*n+1; i++){\n dp[0][k][i] = n;\n dp[1][k][i] = n;\n }\n dp[0][k][n] = 0;\n dp[1][k][n] = 0;\n RMQ[] rmq = new RMQ[2];\n rmq[0] = new RMQ(dp[0][k]);\n rmq[1] = new RMQ(dp[1][k]);\n for(int i = k-1; i >= 0; i--){\n for(int j = 0;j <= 2*n; j++){\n dp[0][i][j] = j+l[i]+delt[i] <= 2*n ? dp[0][i+1][j+l[i]+delt[i]] : n;\n dp[1][i][j] = dp[1][i+1][j];\n dp[0][i][j] = Math.min(dp[0][i][j] , 1 + rmq[1].min(j , Math.min(j+l[i] , 2*n)));\n if(j + delt[i] <= 2*n)dp[1][i][j] = Math.min(dp[1][i][j] , 1 + rmq[0].min(j + delt[i] , Math.min(j+l[i] + delt[i] , 2*n)));\n if(j + delt[i] <= 2*n)dp[0][i][j] = Math.min(dp[0][i][j] , 2 + rmq[0].min(j + delt[i] , Math.min(j+l[i] + delt[i] , 2*n)));\n dp[1][i][j] = Math.min(dp[1][i][j] , 2 + rmq[1].min(j , Math.min(j+l[i] , 2*n)));\n }\n rmq[0] = new RMQ(dp[0][i]);\n rmq[1] = new RMQ(dp[1][i]);\n }\n int ans = dp[1][0][0];\n if(ans == n)System.out.println(\"Hungry\");\n else {\n System.out.println(\"Full\");\n System.out.println(ans);\n }\n\n }\n public static class RMQ{\n int n , k;\n int[][] min;\n public RMQ(int[] a){\n n = a.length;\n k = Integer.numberOfTrailingZeros(Integer.highestOneBit(n))+1;\n min = new int[k][n];\n for(int i = 0;i < n; i++)\n min[0][i] = a[i];\n for(int i = 1; i < k; i++){\n for(int j = 0;j + (1 << i-1) < n; j++){\n min[i][j] = Math.min(min[i-1][j] , min[i-1][j + (1 << i-1)]);\n }\n }\n }\n public int min(int a , int b){\n int z = Integer.numberOfTrailingZeros(Integer.highestOneBit(b-a+1));\n return Math.min(min[z][a] , min[z][b - (1<<z) + 1]);\n }\n }\n private static class FastScanner {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n\n public FastScanner(InputStream stream) {\n this.stream = stream;\n }\n\n int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) return -1;\n }\n return buf[curChar++];\n }\n\n boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n boolean isEndline(int c) {\n return c == '\\n' || c == '\\r' || c == -1;\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public String next() {\n int c = read();\n while (isSpaceChar(c)) c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n public String nextLine() {\n int c = read();\n while (isEndline(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isEndline(c));\n return res.toString();\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["dp", "data structures"], "code_uid": "66fe6533a43c7a730c1bd81c77d6dd9c", "src_uid": "2e0d1b1f1a7b8df2d2598c3cb2c869d5", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskF solver = new TaskF();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskF {\n int MAX = (int) (1e9);\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int N = in.nextInt();\n int k = in.nextInt();\n ArrayList<int[]> interval = new ArrayList<>();\n for (int i = 0; i < k; i++) {\n interval.add(new int[]{in.nextInt(), in.nextInt()});\n }\n interval.add(new int[]{2 * N, 2 * N});\n int cur = 0;\n SegmentTree[] dp = new SegmentTree[2]; //how many sides are fried on the front, 0 is currently on front, 1 is currently on back\n dp[0] = new SegmentTree(N + 1);\n dp[1] = new SegmentTree(N + 1);\n dp[0].assign(0, 0);\n for (int i = 0; i < interval.size(); i++) {\n for (int j = N; j >= 0; j--) {\n dp[0].assign(j, dp[0].getVal(j - (interval.get(i)[0] - cur)));\n }\n cur = interval.get(i)[1];\n int sz = interval.get(i)[1] - interval.get(i)[0];\n for (int j = N; j >= 0; j--) {\n int[] put = new int[2];\n for (int z = 0; z <= 1; z++) {\n int twoSwaps = dp[z].query(j - sz, j);\n int oneSwap = dp[(z + 1) % 2].query(j - sz, j);\n int noSwap;\n if (z == 1) {\n noSwap = dp[z].getVal(j);\n } else {\n noSwap = dp[z].getVal(j - sz);\n }\n put[z] = Math.min(twoSwaps + 2, Math.min(oneSwap + 1, noSwap));\n }\n dp[0].assign(j, put[0]);\n// out.println(j + \" \" + put[0] + \" \" + put[1]);\n dp[1].assign(j, put[1]);\n }\n }\n int ans = Math.min(dp[0].query(N, N), dp[1].query(N, N));\n if (ans >= MAX) {\n out.println(\"Hungry\");\n } else {\n out.println(\"Full\");\n out.println(ans);\n }\n }\n\n class SegmentTree {\n int[] tree;\n int[] arr;\n int size = 0;\n\n public SegmentTree(int N) {\n tree = new int[4 * N];\n arr = new int[N];\n Arrays.fill(arr, MAX);\n size = N;\n for (int i = 0; i < 4 * N; i++) {\n tree[i] = MAX;\n }\n }\n\n public int query(int l, int r) {\n if (r < 0) {\n return MAX;\n }\n return queryUtil(1, 0, size - 1, Math.max(0, l), r);\n }\n\n public int queryUtil(int n, int tl, int tr, int l, int r) {\n //node number, cur range of node, cur range of query\n if (l > r) {\n return MAX;\n }\n if (tl == l && tr == r) {\n return tree[n];\n }\n int tm = (tl + tr) / 2;\n return Math.min(queryUtil(2 * n, tl, tm, l, Math.min(r, tm)), queryUtil(2 * n + 1, tm + 1, tr, Math.max(tm + 1, l), r));\n }\n\n public void assign(int n, int val) {\n arr[n] = val;\n int tl = 0;\n int tr = size - 1;\n int a = 1;\n while (tl < tr) {\n int tm = (tl + tr) >> 1;\n if (n <= tm) {\n tr = tm;\n a = 2 * a;\n } else {\n tl = tm + 1;\n a = 2 * a + 1;\n }\n }\n tree[a] = val;\n a >>= 1;\n while (a > 0) {\n tree[a] = Math.min(tree[2 * a], tree[2 * a + 1]);\n a >>= 1;\n }\n }\n\n int getVal(int i) {\n if (i < 0) {\n return MAX;\n }\n return arr[i];\n }\n\n }\n\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["dp", "data structures"], "code_uid": "4f55e751b57d1a3094458f07c5f6b6c2", "src_uid": "2e0d1b1f1a7b8df2d2598c3cb2c869d5", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\n\nimport java.io.*;\nimport java.util.Arrays;\n\n/**\n * Created by dalt on 2018/3/14.\n */\npublic class CF939F {\n public static final int INF = (int) 1e8;\n public static BlockReader input;\n public static PrintStream output;\n\n public static void main(String[] args) throws FileNotFoundException {\n if (System.getProperty(\"ONLINE_JUDGE\") == null) {\n input = new BlockReader(new FileInputStream(\"D:\\\\DataBase\\\\TESTCASE\\\\codeforces\\\\CF939F.in\"));\n output = System.out;\n } else {\n input = new BlockReader(System.in);\n output = new PrintStream(new BufferedOutputStream(System.out), false);\n }\n\n solve();\n\n output.flush();\n }\n\n public static void solve() {\n int n = input.nextInteger();\n int k = input.nextInteger();\n\n int[][] intervals = new int[k + 2][2];\n for (int i = 1; i <= k; i++) {\n intervals[i][0] = input.nextInteger();\n intervals[i][1] = input.nextInteger();\n }\n intervals[k + 1][0] = 2 * n;\n intervals[k + 1][1] = 2 * n;\n\n k++;\n\n Node[] loop = new Node[2];\n loop[0] = Node.build(0, n);\n loop[1] = Node.build(0, n);\n\n int[] data = new int[n + 1];\n\n for (int i = 1; i <= k; i++) {\n Node curDp = loop[i & 1];\n\n Node lastDp = loop[(i - 1) & 1];\n\n\n int[] interval = intervals[i];\n int intervalLength = interval[1] - interval[0];\n int middleLength = interval[0] - intervals[i - 1][1];\n\n Node.toArray(0, n, data, lastDp);\n System.arraycopy(data, 0, data, Math.min(data.length, intervalLength + middleLength), Math.max(0, n + 1 - (intervalLength + middleLength)));\n Arrays.fill(data, 0, Math.min(data.length, intervalLength + middleLength), INF);\n\n //No flip\n/* for (int j = intervalLength + middleLength; j <= n; j++) {\n int lastFryTotalTime = j - intervalLength - middleLength;\n int minNeedTime = Node.query(lastFryTotalTime, lastFryTotalTime, 0, n, lastDp);\n Node.update(j, 0, n, minNeedTime, curDp);\n }*/\n\n\n int minX = interval[1] - middleLength - intervalLength;\n int maxX = interval[1] - middleLength;\n for (int j = 0; j <= n; j++) {\n //Flip once\n int minNeedTime = Node.query(minX - j, maxX - j, 0, n, lastDp);\n data[j] = Math.min(data[j], minNeedTime + 1);\n // Node.update(j, 0, n, minNeedTime + 1, curDp);\n }\n\n for (int j = 0; j <= n; j++) {\n //Flip twice\n int minNeedTime = Node.query(j - middleLength - intervalLength, j - middleLength, 0, n, lastDp);\n //Node.update(j, 0, n, minNeedTime + 2, curDp);\n data[j] = Math.min(data[j], minNeedTime + 2);\n }\n\n Node.fromArray(0, n, data, curDp);\n }\n\n int minFlipTime = Node.query(n, n, 0, n, loop[k & 1]);\n\n if (minFlipTime < INF) {\n output.println(\"Full\");\n output.println(minFlipTime);\n } else {\n output.println(\"Hungry\");\n }\n }\n\n\n public static class Node {\n Node left;\n Node right;\n int batchSetValue;\n boolean dirty;\n int min;\n\n public static void setValue(int f, int t, int l, int r, int val, Node node) {\n if (f > r || t < l) {\n return;\n }\n if (f <= l && t >= r) {\n node.setValue(val);\n return;\n }\n\n node.pushDown();\n int m = (l + r) >> 1;\n setValue(f, t, l, m, val, node.left);\n setValue(f, t, m + 1, r, val, node.right);\n\n node.pushUp();\n }\n\n public static Node build(int l, int r) {\n Node node = new Node();\n if (l != r) {\n int m = (l + r) >> 1;\n node.left = build(l, m);\n node.right = build(m + 1, r);\n }\n return node;\n }\n\n public static int query(int f, int t, int l, int r, Node node) {\n if (f > r || t < l) {\n return INF;\n }\n if (f <= l && r <= t) {\n return node.min;\n }\n node.pushDown();\n int m = (l + r) >> 1;\n return Math.min(query(f, t, l, m, node.left), query(f, t, m + 1, r, node.right));\n }\n\n public static void update(int i, int l, int r, int val, Node node) {\n if (i > r || i < l) {\n return;\n }\n if (i <= l && i >= r) {\n node.min = Math.min(node.min, val);\n return;\n }\n\n node.pushDown();\n int m = (l + r) >> 1;\n update(i, l, m, val, node.left);\n update(i, m + 1, r, val, node.right);\n\n node.pushUp();\n }\n\n public static void toArray(int l, int r, int[] data, Node node) {\n if (l == r) {\n data[l] = node.min;\n return;\n }\n node.pushDown();\n int m = (l + r) >> 1;\n toArray(l, m, data, node.left);\n toArray(m + 1, r, data, node.right);\n }\n\n public static void fromArray(int l, int r, int[] data, Node node) {\n if (l == r) {\n node.min = data[l];\n return;\n }\n\n node.dirty = false;\n int m = (l + r) >> 1;\n fromArray(l, m, data, node.left);\n fromArray(m + 1, r, data, node.right);\n node.pushUp();\n }\n\n public void pushUp() {\n this.min = Math.min(left.min, right.min);\n }\n\n public void setValue(int val) {\n this.min = val;\n this.batchSetValue = val;\n this.dirty = true;\n }\n\n public void pushDown() {\n if (dirty) {\n left.setValue(batchSetValue);\n right.setValue(batchSetValue);\n dirty = false;\n }\n }\n\n @Override\n public String toString() {\n int t = 100;\n int[] data = new int[t + 1];\n for (int i = 0; i <= t; i++) {\n data[i] = query(i, i, 0, t, this);\n }\n return Arrays.toString(data);\n }\n }\n\n public static class BlockReader {\n static final int EOF = -1;\n InputStream is;\n byte[] dBuf;\n int dPos, dSize, next;\n StringBuilder builder = new StringBuilder();\n\n public BlockReader(InputStream is) {\n this(is, 4096);\n }\n\n public BlockReader(InputStream is, int bufSize) {\n this.is = is;\n dBuf = new byte[bufSize];\n next = nextByte();\n }\n\n public int nextByte() {\n while (dPos >= dSize) {\n if (dSize == -1) {\n return EOF;\n }\n dPos = 0;\n try {\n dSize = is.read(dBuf);\n } catch (Exception e) {\n }\n }\n return dBuf[dPos++];\n }\n\n public String nextBlock() {\n builder.setLength(0);\n skipBlank();\n while (next != EOF && !Character.isWhitespace(next)) {\n builder.append((char) next);\n next = nextByte();\n }\n return builder.toString();\n }\n\n public void skipBlank() {\n while (Character.isWhitespace(next)) {\n next = nextByte();\n }\n }\n\n public int nextInteger() {\n skipBlank();\n int ret = 0;\n boolean rev = false;\n if (next == '+' || next == '-') {\n rev = next == '-';\n next = nextByte();\n }\n while (next >= '0' && next <= '9') {\n ret = (ret << 3) + (ret << 1) + next - '0';\n next = nextByte();\n }\n return rev ? -ret : ret;\n }\n\n public int nextBlock(char[] data, int offset) {\n skipBlank();\n int index = offset;\n int bound = data.length;\n while (next != EOF && index < bound && !Character.isWhitespace(next)) {\n data[index++] = (char) next;\n next = nextByte();\n }\n return index - offset;\n }\n\n public boolean hasMore() {\n skipBlank();\n return next != EOF;\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["dp", "data structures"], "code_uid": "7048699548cbe7fbaf7553940ec2e923", "src_uid": "2e0d1b1f1a7b8df2d2598c3cb2c869d5", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package round464;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayDeque;\nimport java.util.Arrays;\nimport java.util.Deque;\nimport java.util.InputMismatchException;\n\npublic class F {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t\tint n = ni(), K = ni();\n\t\tint[][] ts = new int[K][];\n\t\tlong all = 0;\n\t\tfor(int i = 0;i < K;i++){\n\t\t\tts[i] = na(2);\n\t\t\tall += ts[i][1] - ts[i][0];\n\t\t}\n\t\tint[] dpe = new int[n+1];\n\t\tint[] dpo = new int[n+1];\n\t\tArrays.fill(dpe, 99999999);\n\t\tArrays.fill(dpo, 99999999);\n\t\tif(ts[0][0] > n){\n\t\t\tout.println(\"Hungry\");\n\t\t\treturn;\n\t\t}\n\t\tdpe[ts[0][0]] = 0;\n\t\tfor(int i = 0;i < K;i++){\n\t\t\tint[] ndpo = new int[n+1];\n\t\t\tint[] ndpe = new int[n+1];\n\t\t\tArrays.fill(ndpo, 99999999);\n\t\t\tArrays.fill(ndpe, 99999999);\n\t\t\tDeque<Integer> dq = new ArrayDeque<>();\n\t\t\tint w = ts[i][1] - ts[i][0];\n\t\t\tfor(int j = 0;j <= n;j++){\n\t\t\t\twhile(dq.size() > 0 && dpe[dq.peekLast()] >= dpe[j]){\n\t\t\t\t\tdq.pollLast();\n\t\t\t\t}\n\t\t\t\twhile(dq.size() > 0 && dq.peekFirst() < j-w)dq.pollFirst();\n\t\t\t\tdq.add(j);\n\t\t\t\tndpo[j] = Math.min(ndpo[j], dpe[dq.peekFirst()] + 1);\n\t\t\t\tif(j+w <= n)ndpe[j+w] = Math.min(ndpe[j+w], dpe[j]);\n\t\t\t}\n\t\t\tdq.clear();\n\t\t\tfor(int j = 0;j <= n;j++){\n\t\t\t\twhile(dq.size() > 0 && dpo[dq.peekLast()] >= dpo[j]){\n\t\t\t\t\tdq.pollLast();\n\t\t\t\t}\n\t\t\t\twhile(dq.size() > 0 && dq.peekFirst() < j-w)dq.pollFirst();\n\t\t\t\tdq.add(j);\n\t\t\t\tndpe[j] = Math.min(ndpe[j], dpo[dq.peekFirst()] + 1);\n\t\t\t\tndpo[j] = Math.min(ndpo[j], dpo[j]);\n\t\t\t}\n\t\t\tdpo = ndpo;\n\t\t\tdpe = ndpe;\n\t\t\t\n\t\t\tfor(int j = 0;j <= n;j++){\n\t\t\t\tdpe[j] = Math.min(dpe[j], dpo[j] + 1);\n\t\t\t\tdpo[j] = Math.min(dpo[j], dpe[j] + 1);\n\t\t\t}\n\t\t\t\n\t\t\tint s = (i == K-1 ? 2*n : ts[i+1][0]) - ts[i][1];\n\t\t\tfor(int j = n;j >= s;j--){\n\t\t\t\tdpe[j] = dpe[j-s];\n\t\t\t}\n\t\t\tfor(int j = Math.min(n, s-1);j >= 0;j--)dpe[j] = 99999999;\n\t\t\t\n\t\t}\n\t\tint ans = Math.min(dpe[n], dpo[n]);\n\t\tif(ans >= 9999999){\n\t\t\tout.println(\"Hungry\");\n\t\t}else{\n\t\t\tout.println(\"Full\");\n\t\t\tout.println(ans);\n\t\t}\n\t}\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new F().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["dp", "data structures"], "code_uid": "866cff990f03ee8a3296a46a221c8986", "src_uid": "2e0d1b1f1a7b8df2d2598c3cb2c869d5", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "//some updates in import stuff\r\nimport static java.lang.Math.max;\r\nimport static java.lang.Math.min;\r\nimport static java.lang.Math.abs;\r\nimport java.util.*;\r\nimport java.io.*;\r\nimport java.math.*;\r\n\r\n//key points learned\r\n//max space ever that could be alloted in a program to pass in cf \r\n//int[][] prefixSum = new int[201][200_005]; -> not a single array more!!! \r\n//never allocate memory again again to such bigg array, it will give memory exceeded for sure\r\n//believe in your fucking solution and keep improving it!!! (sometimes)\r\n\r\npublic class Main{\r\n\r\n static int mod = (int) (Math.pow(10, 9)+7);\r\n\tstatic final int dx[] = { -1, 0, 1, 0 }, dy[] = { 0, -1, 0, 1 };\r\n\tstatic final int[] dx8 = { -1, -1, -1, 0, 0, 1, 1, 1 }, dy8 = { -1, 0, 1, -1, 1, -1, 0, 1 };\r\n\tstatic final int[] dx9 = { -1, -1, -1, 0, 0, 0, 1, 1, 1 }, dy9 = { -1, 0, 1, -1, 0, 1, -1, 0, 1 };\r\n\r\n\tstatic final double eps = 1e-10;\r\n\tstatic List<Integer> primeNumbers = new ArrayList<>();\r\n public static void main(String[] args) {\r\n MyScanner sc = new MyScanner();\r\n out = new PrintWriter(new BufferedOutputStream(System.out));\r\n\r\n //code below\r\n String str = sc.nextLine();\r\n char[] inp = str.toCharArray(); \r\n int n = str.length();\r\n\r\n //since i have the input ready bois\r\n //keep solving until, there is no until keep solving bruh!! (simple)\r\n String[] pos = {\"00\", \"25\", \"50\", \"75\"};\r\n int count = 0;\r\n\r\n if(inp.length == 1){\r\n if(inp[0] == '0' || inp[0] == 'X' || inp[0] == '_') count++;\r\n }else{\r\n\r\n for(String cstr : pos){\r\n int X = -1;\r\n\r\n int idx = 0;\r\n boolean possible = true;\r\n for(int i = n-2; i < n; i++){\r\n char curr = inp[i];\r\n char strcurr = cstr.charAt(idx);\r\n idx++;\r\n \r\n if(curr == '_') continue;\r\n else if(curr == 'X'){\r\n if(X == -1){\r\n X = (strcurr - '0');\r\n }else{\r\n if(X != strcurr - '0'){\r\n possible = false;\r\n break;\r\n }\r\n }\r\n }else{\r\n if(curr != strcurr){\r\n possible = false;\r\n break;\r\n }\r\n }\r\n\r\n }\r\n\r\n if(!possible) continue; //don't increase the count simple\r\n\r\n //to handle one small edge case which was this \r\n if(str.length() == 2){\r\n if(cstr.charAt(0) == '0') continue;\r\n // System.out.println(cstr);\r\n count++;\r\n continue;\r\n }\r\n \r\n //now yaha tak question done hai boss for sure!! We have the required X and stuff and all\r\n //now make all possible outcomes for X \r\n //if X == -1 && X == 0 else what else we can do?? - think about it for sure\r\n //if X is fixed , then simple\r\n //if X is zero then also simple\r\n //if X is not fixed, and X is not zero\r\n //make temp inp\r\n char[] ninp = Arrays.copyOf(inp, str.length());\r\n\r\n int cntX = 0;\r\n for(char ch : inp){\r\n if(ch == 'X') cntX++;\r\n }\r\n \r\n if(X != -1 || cntX == 0){\r\n if(X != -1){\r\n for(int k = 0; k < str.length(); k++){\r\n ninp[k] = inp[k] == 'X' ? (char)(X + '0') : inp[k];\r\n }\r\n }\r\n\r\n if(ninp[0] == '0') continue; \r\n int counter = 1;\r\n for(int k = 0; k < str.length() - 2; k++){\r\n if(ninp[k] == '_'){\r\n if(k == 0){\r\n counter = counter * 9;\r\n }else{\r\n counter = counter * 10;\r\n }\r\n }\r\n }\r\n\r\n count += counter;\r\n }else{\r\n \r\n if(ninp[0] == '0') continue; //simimlar to before\r\n \r\n //now either 'X' or '_' or \r\n int counter = 1;\r\n for(int k = 0; k < str.length() - 2; k++){\r\n if(ninp[k] == '_'){\r\n if(k == 0){\r\n counter = counter * 9;\r\n }else{\r\n counter = counter * 10;\r\n }\r\n }\r\n }\r\n\r\n //after this it is pretty simple, multiply X also\r\n if(ninp[0] == 'X'){\r\n counter = counter * 9;\r\n }else{\r\n counter = counter * 10;\r\n }\r\n \r\n count += counter;\r\n }\r\n } \r\n }\r\n\r\n System.out.println(count);\r\n\r\n out.close();\r\n }\r\n\r\n //new stuff to learn (whenever this is need for them, then only)\r\n //Lazy Segment Trees\r\n //Persistent Segment Trees\r\n //Square Root Decomposition\r\n //Geometry & Convex Hull\r\n //High Level DP -- yk yk\r\n //String Matching Algorithms\r\n //Heavy light Decomposition\r\n\r\n //Updation Required\r\n //Fenwick Tree - both are done (sum) \r\n //Segment Tree - both are done (min, max, sum)\r\n\r\n //-----CURRENTLY PRESENT-------//\r\n //Graph\r\n //DSU\r\n //powerMODe\r\n //power\r\n //Segment Tree (work on this one) \r\n //Prime Sieve\r\n //Count Divisors\r\n //Next Permutation \r\n //Get NCR \r\n //isVowel\r\n //Sort (int)\r\n //Sort (long)\r\n //Binomial Coefficient\r\n //Pair\r\n //Triplet\r\n //lcm (int & long)\r\n //gcd (int & long)\r\n //gcd (for binomial coefficient)\r\n //swap (int & char)\r\n //reverse\r\n //primeExponentCounts\r\n\r\n //Fast input and output \r\n\r\n //-------------------------------------------------------------------\r\n //-------------------------------------------------------------------\r\n //-------------------------------------------------------------------\r\n //-------------------------------------------------------------------\r\n //-------------------------------------------------------------------\r\n\r\n //GRAPH (basic structure)\r\n public static class Graph{\r\n public int V;\r\n public ArrayList<ArrayList<Integer>> edges;\r\n\r\n //2 -> [0,1,2] (current)\r\n Graph(int V){\r\n this.V = V;\r\n edges = new ArrayList<>(V+1);\r\n for(int i= 0; i <= V; i++){\r\n edges.add(new ArrayList<>());\r\n }\r\n }\r\n\r\n public void addEdge(int from , int to){\r\n edges.get(from).add(to);\r\n edges.get(to).add(from);\r\n }\r\n }\r\n\r\n //DSU (path and rank optimised)\r\n public static class DisjointUnionSets {\r\n int[] rank, parent;\r\n int n;\r\n \r\n public DisjointUnionSets(int n)\r\n {\r\n rank = new int[n];\r\n parent = new int[n];\r\n Arrays.fill(rank, 1);\r\n Arrays.fill(parent,-1);\r\n this.n = n;\r\n }\r\n \r\n public int find(int curr){\r\n if(parent[curr] == -1)\r\n return curr;\r\n \r\n //path compression optimisation\r\n return parent[curr] = find(parent[curr]);\r\n }\r\n \r\n public void union(int a, int b){\r\n int s1 = find(a);\r\n int s2 = find(b);\r\n \r\n if(s1 != s2){\r\n //union by size\r\n if(rank[s1] < rank[s2]){\r\n parent[s1] = s2;\r\n rank[s2] += rank[s1];\r\n }else{\r\n parent[s2] = s1;\r\n rank[s1] += rank[s2];\r\n }\r\n }\r\n }\r\n }\r\n\r\n //with mod\r\n public static long powerMOD(long x, long y)\r\n {\r\n long res = 1L; \r\n while (y > 0)\r\n {\r\n // If y is odd, multiply x with result\r\n if ((y & 1) != 0){\r\n x %= mod;\r\n res %= mod;\r\n res = (res * x)%mod;\r\n }\r\n // y must be even now\r\n y = y >> 1; // y = y/2\r\n x%= mod;\r\n x = (x * x)%mod; // Change x to x^2\r\n }\r\n return res%mod;\r\n }\r\n\r\n //without mod\r\n public static long power(long x, long y)\r\n {\r\n long res = 1L; \r\n while (y > 0)\r\n {\r\n // If y is odd, multiply x with result\r\n if ((y & 1) != 0){\r\n res = (res * x);\r\n }\r\n // y must be even now\r\n y = y >> 1; // y = y/\r\n x = (x * x);\r\n }\r\n return res;\r\n }\r\n\r\n public static class segmentTree{\r\n\r\n //so let's make a constructor function for this bad boi for sure!!!\r\n public long[] arr;\r\n public long[] tree;\r\n\r\n //COMPLEXITY (normal segment tree, stuff)\r\n //build -> O(n)\r\n //query -> O(logn)\r\n //update -> O(logn)\r\n //update-range -> O(n) (worst case)\r\n\r\n //simple iteration and stuff for sure\r\n public segmentTree(long[] arr){\r\n int n = arr.length;\r\n this.arr = new long[n];\r\n for(int i= 0; i < n; i++){\r\n this.arr[i] = arr[i];\r\n } \r\n\r\n tree = new long[4*n + 1];\r\n }\r\n\r\n //pretty basic idea if you read the code once\r\n //first make child node once\r\n //then form the parent node using them\r\n public void buildTree(int s, int e, int index){\r\n if(s == e){\r\n tree[index] = arr[s];\r\n return;\r\n }\r\n\r\n //recursive case\r\n int mid = (s + e)/2;\r\n buildTree(s, mid, 2 * index);\r\n buildTree(mid + 1, e, 2*index + 1);\r\n\r\n //the condition we want from children be like this\r\n tree[index] = min(tree[2 * index], tree[2 * index + 1]);\r\n return;\r\n }\r\n\r\n //definitely index based 0 query!!! \r\n //only int index = 1!!\r\n //baaki everything is simple as fuck\r\n public long query(int s, int e, int qs , int qe, int index){\r\n //complete overlap\r\n if(s >= qs && e <= qe){\r\n return tree[index];\r\n }\r\n\r\n //no overlap\r\n if(qe < s || qs > e){\r\n return Long.MAX_VALUE;\r\n }\r\n\r\n //partial overlap\r\n int mid = (s + e)/2;\r\n long left = query( s, mid , qs, qe, 2*index);\r\n long right = query( mid + 1, e, qs, qe, 2*index + 1);\r\n\r\n return min(left, right);\r\n }\r\n\r\n //updates are pretty cool\r\n //point update and range update!!! \r\n public void updateNode(int s, int e, int i, long increment, int index){\r\n\r\n //case where I is out of bounds\r\n if(i < s || i > e){\r\n return;\r\n }\r\n\r\n if(s == e){\r\n //making increment\r\n tree[index] += increment;\r\n return;\r\n } \r\n \r\n //otherwise\r\n int mid = (s + e)/2;\r\n updateNode(s, mid, i, increment, 2 * index);\r\n updateNode(mid + 1, e, i, increment, 2 * index + 1);\r\n\r\n tree[index] = min(tree[2 * index], tree[2 * index + 1]);\r\n return; \r\n }\r\n\r\n //gonna do range updates for sure now!!\r\n //let's do this bois!!! (solve this problem for sure)\r\n public void updateRange(int s, int e, int l, int r, long increment, int index){\r\n\r\n //out of bounds\r\n if(l > e || r < s){\r\n return;\r\n }\r\n\r\n //leaf node\r\n if(s == e){\r\n tree[index] += increment;\r\n }\r\n\r\n //recursive case\r\n int mid = (s + e)/2;\r\n updateRange(s, mid, l, r, increment, 2 * index);\r\n updateRange(mid + 1, e, l, r, increment, 2 * index);\r\n\r\n tree[index] = min(tree[2 * index], tree[2 * index + 1]);\r\n }\r\n \r\n }\r\n\r\n //prime sieve\r\n public static void primeSieve(int n){\r\n BitSet bitset = new BitSet(n+1);\r\n for(long i = 0; i < n ; i++){\r\n if (i == 0 || i == 1) {\r\n bitset.set((int) i);\r\n continue;\r\n }\r\n if(bitset.get((int) i)) continue;\r\n primeNumbers.add((int)i);\r\n for(long j = i; j <= n ; j+= i)\r\n bitset.set((int)j);\r\n }\r\n }\r\n\r\n //number of divisors\r\n public static int countDivisors(long number){\r\n if(number == 1) return 1;\r\n List<Integer> primeFactors = new ArrayList<>();\r\n int index = 0;\r\n long curr = primeNumbers.get(index);\r\n while(curr * curr <= number){\r\n while(number % curr == 0){\r\n number = number/curr;\r\n primeFactors.add((int) curr);\r\n } \r\n index++;\r\n curr = primeNumbers.get(index);\r\n }\r\n\r\n if(number != 1) primeFactors.add((int) number);\r\n int current = primeFactors.get(0);\r\n int totalDivisors = 1;\r\n int currentCount = 2;\r\n for (int i = 1; i < primeFactors.size(); i++) {\r\n if (primeFactors.get(i) == current) {\r\n currentCount++;\r\n } else {\r\n totalDivisors *= currentCount;\r\n currentCount = 2;\r\n current = primeFactors.get(i);\r\n }\r\n }\r\n totalDivisors *= currentCount;\r\n return totalDivisors;\r\n }\r\n\r\n //primeExponentCounts\r\n public static int primeExponentsCount(int n) {\r\n if (n <= 1)\r\n return 0;\r\n int sqrt = (int) Math.sqrt(n);\r\n int remainingNumber = n;\r\n int result = 0;\r\n for (int i = 2; i <= sqrt; i++) {\r\n while (remainingNumber % i == 0) {\r\n result++;\r\n remainingNumber /= i;\r\n }\r\n }\r\n //in case of prime numbers this would happen\r\n if (remainingNumber > 1) {\r\n result++;\r\n }\r\n return result;\r\n }\r\n\r\n\r\n //now adding next permutation function to java hehe\r\n public static boolean next_permutation(int[] p) {\r\n for (int a = p.length - 2; a >= 0; --a)\r\n if (p[a] < p[a + 1])\r\n for (int b = p.length - 1;; --b)\r\n if (p[b] > p[a]) {\r\n int t = p[a];\r\n p[a] = p[b];\r\n p[b] = t;\r\n for (++a, b = p.length - 1; a < b; ++a, --b) {\r\n t = p[a];\r\n p[a] = p[b];\r\n p[b] = t;\r\n }\r\n return true;\r\n }\r\n return false;\r\n }\r\n\r\n //finding the value of NCR in O(RlogN) time and O(1) space\r\n public static long getNcR(int n, int r)\r\n {\r\n long p = 1, k = 1;\r\n if (n - r < r) r = n - r;\r\n\r\n if (r != 0) {\r\n while (r > 0) {\r\n p *= n;\r\n k *= r;\r\n long m = __gcd(p, k);\r\n p /= m;\r\n k /= m;\r\n n--;\r\n r--;\r\n }\r\n }\r\n else {\r\n p = 1;\r\n }\r\n return p;\r\n }\r\n\r\n //is vowel function \r\n public static boolean isVowel(char c)\r\n {\r\n return (c=='a' || c=='A' || c=='e' || c=='E' || c=='i' || c=='I' || c=='o' || c=='O' || c=='u' || c=='U');\r\n } \r\n\r\n //to sort the array with better method\r\n\tpublic static void sort(int[] a) {\r\n\t\tArrayList<Integer> l=new ArrayList<>();\r\n\t\tfor (int i:a) l.add(i);\r\n\t\tCollections.sort(l);\r\n\t\tfor (int i=0; i<a.length; i++) a[i]=l.get(i);\r\n\t}\r\n\r\n //sort long\r\n public static void sort(long[] a) {\r\n\t\tArrayList<Long> l=new ArrayList<>();\r\n\t\tfor (long i:a) l.add(i);\r\n\t\tCollections.sort(l);\r\n\t\tfor (int i=0; i<a.length; i++) a[i]=l.get(i);\r\n\t}\r\n\t\r\n //for calculating binomialCoeff\r\n public static int binomialCoeff(int n, int k)\r\n {\r\n int C[] = new int[k + 1];\r\n // nC0 is 1\r\n C[0] = 1;\r\n for (int i = 1; i <= n; i++) {\r\n // Compute next row of pascal\r\n // triangle using the previous row\r\n for (int j = Math.min(i, k); j > 0; j--)\r\n C[j] = C[j] + C[j - 1];\r\n }\r\n return C[k];\r\n }\r\n\r\n //Pair with int int \r\n public static class Pair{\r\n public int a;\r\n public int b;\r\n public int hashCode;\r\n\r\n Pair(int a , int b){\r\n this.a = a;\r\n this.b = b;\r\n this.hashCode = Objects.hash(a, b);\r\n }\r\n\r\n @Override\r\n public String toString(){\r\n return a + \" -> \" + b; \r\n }\r\n \r\n @Override\r\n public boolean equals(Object o) {\r\n if (this == o)\r\n return true;\r\n if (o == null || getClass() != o.getClass())\r\n return false;\r\n Pair that = (Pair) o;\r\n return a == that.a && b == that.b;\r\n }\r\n \r\n @Override\r\n public int hashCode() {\r\n return this.hashCode;\r\n }\r\n }\r\n\r\n //Triplet with int int int\r\n public static class Triplet{\r\n\r\n public int a;\r\n public int b;\r\n public int c;\r\n\r\n Triplet(int a , int b, int c){\r\n this.a = a;\r\n this.b = b;\r\n this.c = c;\r\n }\r\n\r\n @Override\r\n public String toString(){\r\n return a + \" -> \" + b; \r\n }\r\n }\r\n\r\n //Shortcut function\r\n public static long lcm(long a , long b){\r\n return a * (b/gcd(a,b));\r\n }\r\n\r\n //let's make one for calculating lcm basically\r\n public static int lcm(int a , int b){\r\n return (a * b)/gcd(a,b);\r\n }\r\n\r\n //int version for gcd\r\n public static int gcd(int a, int b){\r\n if(b == 0)\r\n return a;\r\n \r\n return gcd(b , a%b);\r\n }\r\n\r\n //long version for gcd\r\n public static long gcd(long a, long b){\r\n if(b == 0)\r\n return a;\r\n\r\n return gcd(b , a%b);\r\n }\r\n\r\n //for ncr calculator(ignore this code)\r\n public static long __gcd(long n1, long n2)\r\n {\r\n long gcd = 1;\r\n for (int i = 1; i <= n1 && i <= n2; ++i) {\r\n // Checks if i is factor of both integers\r\n if (n1 % i == 0 && n2 % i == 0) {\r\n gcd = i;\r\n }\r\n }\r\n return gcd;\r\n }\r\n\r\n //swapping two elements in an array\r\n public static void swap(int[] arr, int left , int right){\r\n int temp = arr[left];\r\n arr[left] = arr[right];\r\n arr[right] = temp;\r\n }\r\n\r\n //for char array\r\n public static void swap(char[] arr, int left , int right){\r\n char temp = arr[left];\r\n arr[left] = arr[right];\r\n arr[right] = temp;\r\n }\r\n\r\n //reversing an array\r\n public static void reverse(int[] arr){\r\n int left = 0;\r\n int right = arr.length-1;\r\n\r\n while(left <= right){\r\n swap(arr, left,right);\r\n left++;\r\n right--;\r\n }\r\n }\r\n\r\n\r\n public static long expo(long a, long b, long mod) {\r\n long res = 1; \r\n while (b > 0) {\r\n if ((b & 1) == 1L) res = (res * a) % mod; //think about this one for a second\r\n a = (a * a) % mod;\r\n b = b >> 1;\r\n } \r\n return res;\r\n }\r\n\r\n //SOME EXTRA DOPE FUNCTIONS \r\n public static long mminvprime(long a, long b) {\r\n return expo(a, b - 2, b);\r\n }\r\n\r\n public static long mod_add(long a, long b, long m) {\r\n a = a % m;\r\n b = b % m;\r\n return (((a + b) % m) + m) % m;\r\n }\r\n\r\n public static long mod_sub(long a, long b, long m) {\r\n a = a % m; \r\n b = b % m; \r\n return (((a - b) % m) + m) % m;\r\n }\r\n \r\n public static long mod_mul(long a, long b, long m) {\r\n a = a % m;\r\n b = b % m;\r\n return (((a * b) % m) + m) % m;\r\n }\r\n\r\n public static long mod_div(long a, long b, long m) {\r\n a = a % m;\r\n b = b % m;\r\n return (mod_mul(a, mminvprime(b, m), m) + m) % m;\r\n }\r\n\r\n //O(n) every single time remember that\r\n public static long nCr(long N, long K , long mod){\r\n long upper = 1L;\r\n long lower = 1L;\r\n long lowerr = 1L;\r\n\r\n for(long i = 1; i <= N; i++){\r\n upper = mod_mul(upper, i, mod);\r\n }\r\n\r\n for(long i = 1; i <= K; i++){\r\n lower = mod_mul(lower, i, mod);\r\n }\r\n\r\n for(long i = 1; i <= (N - K); i++){\r\n lowerr = mod_mul(lowerr, i, mod);\r\n }\r\n\r\n // out.println(upper + \" \" + lower + \" \" + lowerr);\r\n long answer = mod_mul(lower, lowerr, mod);\r\n answer = mod_div(upper, answer, mod);\r\n\r\n return answer;\r\n }\r\n \r\n // long[] fact = new long[2 * n + 1];\r\n // long[] ifact = new long[2 * n + 1];\r\n // fact[0] = 1;\r\n // ifact[0] = 1;\r\n // for (long i = 1; i <= 2 * n; i++)\r\n // {\r\n // fact[(int)i] = mod_mul(fact[(int)i - 1], i, mod);\r\n // ifact[(int)i] = mminvprime(fact[(int)i], mod);\r\n // }\r\n //ifact is basically inverse factorial in here!!!!!(imp)\r\n public static long combination(long n, long r, long m, long[] fact, long[] ifact) {\r\n long val1 = fact[(int)n];\r\n long val2 = ifact[(int)(n - r)];\r\n long val3 = ifact[(int)r];\r\n return (((val1 * val2) % m) * val3) % m;\r\n }\r\n\r\n \r\n\r\n \r\n //-----------PrintWriter for faster output---------------------------------\r\n public static PrintWriter out;\r\n \r\n //-----------MyScanner class for faster input----------\r\n public static class MyScanner {\r\n BufferedReader br;\r\n StringTokenizer st;\r\n \r\n public MyScanner() {\r\n br = new BufferedReader(new InputStreamReader(System.in));\r\n }\r\n \r\n String next() {\r\n while (st == null || !st.hasMoreElements()) {\r\n try {\r\n st = new StringTokenizer(br.readLine());\r\n } catch (IOException e) {\r\n e.printStackTrace();\r\n }\r\n }\r\n return st.nextToken();\r\n }\r\n \r\n int nextInt() {\r\n return Integer.parseInt(next());\r\n }\r\n \r\n long nextLong() {\r\n return Long.parseLong(next());\r\n }\r\n \r\n double nextDouble() {\r\n return Double.parseDouble(next());\r\n }\r\n \r\n String nextLine(){\r\n String str = \"\";\r\n try {\r\n str = br.readLine();\r\n } catch (IOException e) {\r\n e.printStackTrace();\r\n }\r\n return str;\r\n }\r\n\r\n }\r\n //--------------------------------------------------------\r\n}", "lang_cluster": "Java", "tags": ["brute force", "dp", "dfs and similar"], "code_uid": "25c3fe4a37771640dcf2d14750527c9f", "src_uid": "4a905f419550a6c839992b40f1617af3", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "\r\nimport java.util.*;\r\n\r\npublic class Hello {\r\n\r\n public static void main(String[] args) {\r\n Scanner sc = new Scanner(System.in);\r\n String str = sc.nextLine().trim();\r\n assert str.length() >= 1 && str.length() <= 8 : \"Length of S not in range\";\r\n if (str.charAt(0) == '0') {\r\n System.out.println(str.length() > 1 ? \"0\" : \"1\");\r\n return;\r\n }\r\n int fromVal = Integer.parseInt(\"1\" + \"0\".repeat(str.length() - 1));\r\n if (fromVal == 1) {\r\n fromVal = 0;\r\n } else if (fromVal == 10) {\r\n fromVal = 25;\r\n }\r\n int toVal = Integer.parseInt(\"9\".repeat(str.length()));\r\n int count = 0;\r\n for (int val = fromVal; val <= toVal; val += 25) {\r\n if (canFormInteger(val, str)) {\r\n count++;\r\n }\r\n }\r\n System.out.println(count);\r\n }\r\n\r\n private static boolean canFormInteger(int num, String str) {\r\n String strNum = String.valueOf(num);\r\n char xVal = '*';\r\n for (int index = 0; index < str.length(); index++) {\r\n if (str.charAt(index) == '_') {\r\n continue;\r\n } else if (str.charAt(index) == 'X') {\r\n if (xVal != '*' && xVal != strNum.charAt(index)) {\r\n return false;\r\n }\r\n xVal = strNum.charAt(index);\r\n } else if (str.charAt(index) != strNum.charAt(index)) {\r\n return false;\r\n }\r\n }\r\n return true;\r\n }\r\n}\r\n", "lang_cluster": "Java", "tags": ["brute force", "dp", "dfs and similar"], "code_uid": "4f4aacd93655f3e0f2e4107a8f6701b8", "src_uid": "4a905f419550a6c839992b40f1617af3", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.BufferedReader;\r\nimport java.io.IOException;\r\nimport java.io.InputStreamReader;\r\nimport java.util.StringTokenizer;\r\n\r\n\r\npublic class Main {\r\n\r\n\tstatic AReader scan = new AReader();\r\n\tstatic char[] cs;\r\n\tstatic int res = 0;\r\n\tstatic int X = 0;\r\n\tstatic int n;\r\n\r\n\tstatic void dfs(int u,int s){\r\n\t\tif(u >= n){\r\n\t\t\tif(s % 25 == 0) res++;\r\n\t\t\treturn;\r\n\t\t}\r\n\t\tint t = cs[u] - '0';\r\n\t\tif(t>=0 && t <= 9) dfs(u+1,s*10+t);\r\n\t\telse if(cs[u] == 'X') dfs(u+1,s*10+X);\r\n\t\telse {\r\n\t\t\tif (u == n - 1) {\r\n\t\t\t\tdfs(u + 1, s * 10 + 5);\r\n\t\t\t\tdfs(u + 1, s * 10);\r\n\t\t\t} else {\r\n\t\t\t\tfor (int i = 0; i < 10; i++) {\r\n\t\t\t\t\tif (i == 0 && u == 0) continue;\r\n\t\t\t\t\tdfs(u + 1, s * 10 + i);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tstatic void solve() {\r\n\t\tcs = scan.next().toCharArray();\r\n\t\tn = cs.length;\r\n\t\tboolean flag = false;\r\n\t\tfor(char c:cs){\r\n\t\t\tif(c == 'X'){\r\n\t\t\t\tflag = true;\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t\tif(cs[0] == '0' && n != 1){\r\n\t\t\tSystem.out.println(0);\r\n\t\t\treturn;\r\n\t\t}\r\n\t\tif(flag){\r\n\t\tfor(int i = 0;i<10;i++) {\r\n\t\t\tif(cs[0] == 'X' && n > 1 && i == 0) continue;\r\n\t\t\tX = i;\r\n\t\t\tdfs(0,0);\r\n\t\t}\r\n\t\t}else dfs(0,0);\r\n\t\tSystem.out.println(res);\r\n\t}\r\n\r\n\r\n\r\n\tpublic static void main(String[] args) {\r\n\t\t//int T = scan.nextInt();\r\n\t\t//while (T-- > 0) {\r\n\t\tsolve();\r\n\t\t//}\r\n\t\t//System.out.print(sb.toString());\r\n\t}\r\n}\r\n\r\n\r\nclass AReader {\r\n\tprivate BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\r\n\tprivate StringTokenizer tokenizer = new StringTokenizer(\"\");\r\n\r\n\tprivate String innerNextLine() {\r\n\t\ttry {\r\n\t\t\treturn reader.readLine();\r\n\t\t} catch (IOException ex) {\r\n\t\t\treturn null;\r\n\t\t}\r\n\t}\r\n\r\n\tpublic boolean hasNext() {\r\n\t\twhile (!tokenizer.hasMoreTokens()) {\r\n\t\t\tString nextLine = innerNextLine();\r\n\t\t\tif (nextLine == null) {\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\t\t\ttokenizer = new StringTokenizer(nextLine);\r\n\t\t}\r\n\t\treturn true;\r\n\t}\r\n\r\n\tpublic String nextLine() {\r\n\t\ttokenizer = new StringTokenizer(\"\");\r\n\t\treturn innerNextLine();\r\n\t}\r\n\r\n\tpublic String next() {\r\n\t\thasNext();\r\n\t\treturn tokenizer.nextToken();\r\n\t}\r\n\r\n\tpublic int nextInt() {\r\n\t\treturn Integer.parseInt(next());\r\n\t}\r\n\r\n\tpublic long nextLong() {\r\n\t\treturn Long.parseLong(next());\r\n\t}\r\n\r\n\tpublic double nextDouble() {\r\n\t\treturn Double.parseDouble(next());\r\n\t}\r\n}\r\n\r\nclass Pair {\r\n\tint x,y;\r\n\r\n\tpublic Pair(int x, int y) {\r\n\t\tthis.x = x;\r\n\t\tthis.y = y;\r\n\t}\r\n}\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "lang_cluster": "Java", "tags": ["brute force", "dp", "dfs and similar"], "code_uid": "1375d221bee7c8e889ab30ccc1aca312", "src_uid": "4a905f419550a6c839992b40f1617af3", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "\r\nimport java.util.*;\r\n\r\nimport java.io.*;\r\nimport java.math.*;\r\nimport java.sql.Array;\r\nimport java.sql.ResultSet;\r\nimport java.sql.SQLException;\r\nimport java.sql.SQLIntegrityConstraintViolationException;\r\n\r\n\r\n\r\npublic class Main {\r\n\t private static class MyScanner {\r\n\t private static final int BUF_SIZE = 2048;\r\n\t BufferedReader br;\r\n\t \r\n\t private MyScanner() {\r\n\t br = new BufferedReader(new InputStreamReader(System.in));\r\n\t }\r\n\t \r\n\t private boolean isSpace(char c) {\r\n\t return c == '\\n' || c == '\\r' || c == ' ';\r\n\t }\r\n\t \r\n\t String next() {\r\n\t try {\r\n\t StringBuilder sb = new StringBuilder();\r\n\t int r;\r\n\t while ((r = br.read()) != -1 && isSpace((char)r));\r\n\t if (r == -1) {\r\n\t return null;\r\n\t }\r\n\t \r\n\t sb.append((char) r);\r\n\t while ((r = br.read()) != -1 && !isSpace((char)r)) {\r\n\t sb.append((char)r);\r\n\t }\r\n\t return sb.toString();\r\n\t } catch (IOException e) {\r\n\t e.printStackTrace();\r\n\t }\r\n\t return null;\r\n\t }\r\n\t \r\n\t int nextInt() {\r\n\t return Integer.parseInt(next());\r\n\t }\r\n\t \r\n\t long nextLong() {\r\n\t return Long.parseLong(next());\r\n\t }\r\n\t \r\n\t double nextDouble() {\r\n\t return Double.parseDouble(next());\r\n\t }\r\n\t }\r\n\t static class Reader{\r\n\t\t \r\n\t\t\tBufferedReader br;\r\n\t\t\tStringTokenizer st;\r\n\t\t\tpublic Reader() {\r\n\t\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\r\n\t\t\t}\r\n\t\t\tString next() \r\n\t\t { \r\n\t\t while (st == null || !st.hasMoreElements()) \r\n\t\t { \r\n\t\t try\r\n\t\t { \r\n\t\t st = new StringTokenizer(br.readLine()); \r\n\t\t } \r\n\t\t catch (IOException e) \r\n\t\t { \r\n\t\t e.printStackTrace(); \r\n\t\t } \r\n\t\t } \r\n\t\t return st.nextToken(); \r\n\t\t } \r\n\r\n\t\t int nextInt() \r\n\t\t { \r\n\t\t return Integer.parseInt(next()); \r\n\t\t } \r\n\r\n\t\t long nextLong() \r\n\t\t { \r\n\t\t return Long.parseLong(next()); \r\n\t\t } \r\n\r\n\t\t double nextDouble() \r\n\t\t { \r\n\t\t return Double.parseDouble(next()); \r\n\t\t } \r\n\r\n\t\t String nextLine() \r\n\t\t { \r\n\t\t String str = \"\"; \r\n\t\t try\r\n\t\t { \r\n\t\t str = br.readLine(); \r\n\t\t } \r\n\t\t catch (IOException e) \r\n\t\t { \r\n\t\t e.printStackTrace(); \r\n\t\t } \r\n\t\t return str; \r\n\t\t } \r\n\t\t}\r\n\t \r\n\t static long mod = (long)(1e9 + 7);\r\n\t \r\n\tstatic void sort(long[] arr ) {\r\n\t\t ArrayList<Long> al = new ArrayList<>();\r\n\t\t for(long e:arr) al.add(e);\r\n\t\t Collections.sort(al);\r\n\t\t for(int i = 0 ; i<al.size(); i++) arr[i] = al.get(i);\r\n\t }\r\n\tstatic void sort(int[] arr ) {\r\n\t\t ArrayList<Integer> al = new ArrayList<>();\r\n\t\t for(int e:arr) al.add(e);\r\n\t\t Collections.sort(al);\r\n\t\t for(int i = 0 ; i<al.size(); i++) arr[i] = al.get(i);\r\n\t }\r\n\t\r\n\tstatic void sort(char[] arr) {\r\n\t\tArrayList<Character> al = new ArrayList<Character>();\r\n\t\tfor(char cc:arr) al.add(cc);\r\n\t\tCollections.sort(al);\r\n\t\tfor(int i = 0 ;i<arr.length ;i++) arr[i] = al.get(i);\r\n\t}\r\n\r\n\tstatic long mod_mul( long... a) {\r\n\t\tlong ans = a[0]%mod;\r\n\t\tfor(int i = 1 ; i<a.length ; i++) {\r\n\t\t\tans = (ans * (a[i]%mod))%mod;\r\n\t\t}\r\n\t\t\r\n\t\treturn ans;\r\n\t}\r\n\tstatic long mod_sum( long... a) {\r\n\t\tlong ans = 0;\r\n\t\tfor(long e:a) {\r\n\t\t\tans = (ans + e)%mod;\r\n\t\t}\r\n\t\treturn ans;\r\n\t}\r\n\t static long gcd(long a, long b)\r\n\t { \r\n\t if (b == 0)\r\n\t return a;\r\n\t return gcd(b, a % b); \r\n\t }\r\n\t static boolean[] prime(int num) {\r\n\t\t\tboolean[] bool = new boolean[num];\r\n\t\t \r\n\t\t for (int i = 0; i< bool.length; i++) {\r\n\t\t bool[i] = true;\r\n\t\t }\r\n\t\t for (int i = 2; i< Math.sqrt(num); i++) {\r\n\t\t if(bool[i] == true) {\r\n\t\t for(int j = (i*i); j<num; j = j+i) {\r\n\t\t bool[j] = false;\r\n\t\t }\r\n\t\t }\r\n\t\t }\r\n\t\t if(num >= 0) {\r\n\t\t \t bool[0] = false;\r\n\t\t \t bool[1] = false;\r\n\t\t }\r\n\t\t \r\n\t\t return bool;\r\n\t\t}\r\n\r\n\t static long modInverse(long a, long m)\r\n\t {\r\n\t long g = gcd(a, m);\r\n\t \r\n\t return power(a, m - 2, m);\r\n\t \r\n\t }\r\n\t static long lcm(long a , long b) {\r\n\t\t return (a*b)/gcd(a, b);\r\n\t }\r\n\t static int lcm(int a , int b) {\r\n\t\t return (int)((a*b)/gcd(a, b));\r\n\t }\r\n\t static long power(long x, long y, long m){\r\n\t if (y == 0) return 1; long p = power(x, y / 2, m) % m; p = (int)((p * (long)p) % m);\r\n\t if (y % 2 == 0) return p; else return (int)((x * (long)p) % m); }\r\n\t \r\n static class Combinations{\r\n\t \t private long[] z;\r\n\t \t private long[] z1;\r\n\t \t private long[] z2;\r\n\t \t private long mod;\r\n\t \t public Combinations(long N , long mod) {\r\n\t \t\t this.mod = mod;\r\n\t\t\t\tz = new long[(int)N+1];\r\n\t\t\t\tz1 = new long[(int)N+1];\r\n\t\t\t\tz[0] = 1;\r\n\t\t\t\tfor(int i =1 ; i<=N ; i++) z[i] = (z[i-1]*i)%mod;\r\n\t\t\t z2 = new long[(int)N+1];\r\n\t\t\t\tz2[0] = z2[1] = 1;\r\n\t\t\t for (int i = 2; i <= N; i++)\r\n\t\t\t z2[i] = z2[(int)(mod % i)] * (mod - mod / i) % mod;\r\n\t\t\t \r\n\t\t\t \r\n\t\t\t z1[0] = z1[1] = 1;\r\n\t\t\t \r\n\t\t\t for (int i = 2; i <= N; i++)\r\n\t\t\t z1[i] = (z2[i] * z1[i - 1]) % mod;\r\n\t\t\t}\r\n\t \t long fac(long n) {\r\n\t \t\t return z[(int)n];\r\n\t \t }\r\n\t \t long invrsNum(long n) {\r\n\t \t\t return z2[(int)n];\r\n\t \t }\r\n\t \t long invrsFac(long n) {\r\n\t \t\t return invrsFac((int)n);\r\n\t \t }\r\n\t \t long ncr(long N, long R)\r\n\t \t {\t\tif(R<0 || R>N ) return 0;\r\n\t \t\t long ans = ((z[(int)N] * z1[(int)R])\r\n\t \t\t % mod * z1[(int)(N - R)])\r\n\t \t\t % mod;\r\n\t \t\t return ans;\r\n\t \t\t}\r\n\t }\r\n\t static class DisjointUnionSets {\r\n\t\t\t int[] rank, parent;\r\n\t\t\t int n;\r\n\t\t\t \r\n\t\t\t public DisjointUnionSets(int n)\r\n\t\t\t {\r\n\t\t\t rank = new int[n];\r\n\t\t\t parent = new int[n];\r\n\t\t\t this.n = n;\r\n\t\t\t makeSet();\r\n\t\t\t }\r\n\t\t\t \r\n\t\t\t void makeSet()\r\n\t\t\t {\r\n\t\t\t for (int i = 0; i < n; i++) {\r\n\t\t\t \r\n\t\t\t parent[i] = i;\r\n\t\t\t }\r\n\t\t\t }\r\n\t\t\t \r\n\t\t\t int find(int x)\r\n\t\t\t {\r\n\t\t\t if (parent[x] != x) {\r\n\t\t\t \r\n\t\t\t parent[x] = find(parent[x]);\r\n\t\t\t \r\n\t\t\t }\r\n\t\t\t \r\n\t\t\t return parent[x];\r\n\t\t\t }\r\n\t\t\t \r\n\t\t\t void union(int x, int y)\r\n\t\t\t {\r\n\t\t\t int xRoot = find(x), yRoot = find(y);\r\n\t\t\t \r\n\t\t\t if (xRoot == yRoot)\r\n\t\t\t return;\r\n\t\t\t \r\n\t\t\t if (rank[xRoot] < rank[yRoot])\r\n\t\t\t \r\n\t\t\t parent[xRoot] = yRoot;\r\n\t\t\t \r\n\t\t\t else if (rank[yRoot] < rank[xRoot])\r\n\t\t\t \r\n\t\t\t parent[yRoot] = xRoot;\r\n\t\t\t \r\n\t\t\t else\r\n\t\t\t {\r\n\t\t\t parent[yRoot] = xRoot;\r\n\t\t\t \r\n\t\t\t rank[xRoot] = rank[xRoot] + 1;\r\n\t\t\t }\r\n\t\t\t }\r\n\t\t\t}\r\n\t static int max(int... a ) {\r\n\t \t int max = a[0];\r\n\t \t for(int e:a) max = Math.max(max, e);\r\n\t \t return max;\r\n\t }\r\n\t static long max(long... a ) {\r\n\t \t long max = a[0];\r\n\t \t for(long e:a) max = Math.max(max, e);\r\n\t \t return max;\r\n\t }\r\n\t static int min(int... a ) {\r\n\t \t int min = a[0];\r\n\t \t for(int e:a) min = Math.min(e, min);\r\n\t \t return min;\r\n\t }\r\n\t static long min(long... a ) {\r\n\t \t long min = a[0];\r\n\t \t for(long e:a) min = Math.min(e, min);\r\n\t \t return min;\r\n\t }\r\n\t static int[] KMP(String str) {\r\n\t \t int n = str.length();\r\n\t \t int[] kmp = new int[n];\r\n\t \t for(int i = 1 ; i<n ; i++) {\r\n\t \t\t int j = kmp[i-1];\r\n\t \t\t while(j>0 && str.charAt(i) != str.charAt(j)) {\r\n\t \t\t\t j = kmp[j-1];\r\n\t \t\t }\r\n\t \t\t if(str.charAt(i) == str.charAt(j)) j++;\r\n\t \t\t kmp[i] = j;\r\n\t \t }\r\n\t \t \r\n\t \t return kmp;\r\n\t }\r\n\t \r\n\t \r\n/************************************************ Query **************************************************************************************/\t \r\n\t \r\n/***************************************** \t\tSparse Table\t********************************************************/\r\n\t static class SparseTable{\r\n\t \t\t\r\n\t \t\tprivate long[][] st;\r\n\t \t\t\r\n\t \t\tSparseTable(long[] arr){\r\n\t \t\t\tint n = arr.length;\r\n\t \t\t\tst = new long[n][25];\r\n\t \t\t\tlog = new int[n+2];\r\n\t \t\t\tbuild_log(n+1);\r\n\t \t\t\tbuild(arr);\r\n\t \t\t}\r\n\t \t\t\r\n\t \t\tprivate void build(long[] arr) {\r\n\t \t\t\tint n = arr.length;\r\n\t \t\t\t\r\n\t \t\t\tfor(int i = n-1 ; i>=0 ; i--) {\r\n\t \t\t\t\tfor(int j = 0 ; j<25 ; j++) {\r\n\t \t\t\t\t\tint r = i + (1<<j)-1;\r\n\t \t\t\t\t\tif(r>=n) break;\r\n\t \t\t\t\t\tif(j == 0 ) st[i][j] = arr[i];\r\n\t \t\t\t\t\telse st[i][j] = Math.min(st[i][j-1] , st[ i + ( 1 << (j-1) ) ][ j-1 ] );\r\n\t \t\t\t\t}\r\n\t \t\t\t}\r\n\t \t\t}\r\n\t \t\tpublic long gcd(long a ,long b) {\r\n\t \t\t\tif(a == 0) return b;\r\n\t \t\t\treturn gcd(b%a , a);\r\n\t \t\t}\r\n\t \t\tpublic long query(int l ,int r) {\r\n\t \t\t\tint w = r-l+1;\r\n\t \t\t\tint power = log[w];\r\n\t \t\t\treturn Math.min(st[l][power],st[r - (1<<power) + 1][power]);\r\n\t \t\t}\r\n\t \t\tprivate int[] log;\r\n\t \t\tvoid build_log(int n) {\r\n\t \t\t\tlog[1] = 0;\r\n\t \t\t\tfor(int i = 2 ; i<=n ; i++) {\r\n\t \t\t\t\tlog[i] = 1 + log[i/2];\r\n\t \t\t\t}\r\n\t \t\t}\r\n\t \t}\r\n\t \r\n\t \r\n/********************************************************\tSegement Tree\t*****************************************************/\r\n/**\r\n\t \t static class SegmentTree{\r\n\t\t\t long[] tree;\r\n\t\t\t long[] arr;\r\n\t\t\t int n;\r\n\t\t\t SegmentTree(long[] arr){\r\n\t\t\t\t this.n = arr.length;\r\n\t\t\t\t tree = new long[4*n+1];\r\n\t\t\t\t this.arr = arr;\r\n\t\t\t\t buildTree(0, n-1, 1);\r\n\t\t\t }\r\n\t\t\t \r\n\t\t\t \r\n\t\t\t void buildTree(int s ,int e ,int index ) {\r\n\t\t\t\t\tif(s == e) {\r\n\t\t\t\t\t\ttree[index] = arr[s];\r\n\t\t\t\t\t\treturn;\r\n\t\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\t\tint mid = (s+e)/2;\r\n\t\t\t\t\t\r\n\t\t\t\t\tbuildTree( s, mid, 2*index);\r\n\t\t\t\t\tbuildTree( mid+1, e, 2*index+1);\r\n\t\t\t\t\t\r\n\t\t\t\t\ttree[index] = Math.min(tree[2*index] , tree[2*index+1]);\r\n\t\t\t\t}\r\n\t\t\t \r\n\t\t\t long query(int si ,int ei) {\r\n\t\t\t\t return query(0 ,n-1 , si ,ei , 1 );\r\n\t\t\t }\r\n\t\t\t private long query( int ss ,int se ,int qs , int qe,int index) {\r\n\t\t\t\t\t\r\n\t\t\t\t\tif(ss>=qs && se<=qe) return tree[index];\r\n\t\t\t\t\t\r\n\t\t\t\t\tif(qe<ss || se<qs) return (long)(1e17);\r\n\t\t\t\t\t\r\n\t\t\t\t\tint mid = (ss + se)/2;\r\n\t\t\t\t\tlong left = query( ss , mid , qs ,qe , 2*index);\r\n\t\t\t\t\tlong right= query(mid + 1 , se , qs ,qe , 2*index+1);\r\n\t\t\t\t\treturn Math.min(left, right);\r\n\t\t\t\t}\r\n\t\t\t public void update(int index , int val) {\r\n\t\t\t\t arr[index] = val;\r\n\t\t\t\t for(long e:arr) System.out.print(e+\" \");\r\n\t\t\t\t update(index , 0 , n-1 , 1);\r\n\t\t\t }\r\n\t\t\t private void update(int id ,int si , int ei , int index) {\r\n\t\t\t\t if(id < si || id>ei) return;\r\n\t\t\t\t if(si == ei ) { \r\n\t\t\t\t\t tree[index] = arr[id];\r\n\t\t\t\t\t return;\r\n\t\t\t\t }\r\n\t\t\t\t if(si > ei) return;\r\n\t\t\t\t int mid = (ei + si)/2;\r\n\t\t\t\t\t\r\n\t\t\t\t\tupdate( id, si, mid , 2*index);\r\n\t\t\t\t\tupdate( id , mid+1, ei , 2*index+1);\r\n\t\t\t\t\t\r\n\t\t\t\t\ttree[index] = Math.min(tree[2*index] ,tree[2*index+1]);\r\n\t\t\t }\r\n\t\t\t \r\n\t\t }\r\n\t\t */\r\n\r\n/* ***************************************************************************************************************************************************/\t \r\n\t \r\n//\t static MyScanner sc = new MyScanner(); // only in case of less memory\r\n\t static Reader sc = new Reader();\r\n\t static StringBuilder sb = new StringBuilder();\r\n\t public static void main(String args[]) throws IOException {\r\n\r\n\t\t int tc = 1;\r\n//\t\t tc = sc.nextInt();\r\n\r\n\t\t for(int i = 1 ; i<=tc ; i++) {\r\n\r\n//\t\t\t sb.append(\"Case #\" + i + \": \" );\t// During KickStart && HackerCup\r\n\t\t\t TEST_CASE();\r\n\t\t\t \r\n\t\t }\r\n\t\t System.out.print(sb);\r\n\t }\r\n\t static void TEST_CASE() {\r\n\t\tchar[] arr = sc.next().toCharArray();\r\n\t\t\r\n\t\tint n = arr.length;\r\n\t\tif(n == 1) {\r\n\t\t\tif(arr[0] == '0' || arr[0] == '_' || arr[0] == 'X' ) sb.append(\"1\\n\");\r\n\t\t\telse sb.append(\"0\\n\");\r\n\t\t\treturn;\r\n\t\t}\r\n\t\tif(arr[0] == '0') {\r\n\t\t\tsb.append(\"0\\n\");\r\n\t\t\treturn;\r\n\t\t}\r\n\t\tboolean bool = false;\r\n\t\tfor(char cc:arr) {\r\n\t\t\tif(cc == 'X') {\r\n\t\t\t\tbool = true;\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t\tlong tot = 0;\r\n\t\tif(bool) {\r\n\t\t\t\r\n\t\t\tfor(int i = 0 ; i<10; i++) {\r\n\t\t\t\tchar[] temp = new char[n];\r\n\t\t\t\tfor(int j = 0 ; j<n ; j++)\r\n\t\t\t\t\ttemp[j] = arr[j];\r\n\t\t\t\tif(temp[0] == 'X' && i == 0) continue;\r\n\t\t\t\tfor(int j = 0 ; j<n ; j++) {\r\n\t\t\t\t\tif(temp[j] == 'X') {\r\n\t\t\t\t\t\ttemp[j] = (char)(i + '0');\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\t// we have arr without X\r\n\t\t\t\tflag = false;\r\n\t\t\t\tlong back = back(temp);\r\n\t\t\t\tlong pre = 1;\r\n\t\t\t\tfor(int j = 0 ; j<n-2 ; j++) {\r\n\t\t\t\t\tif(temp[j] == '_') {\r\n\t\t\t\t\t\tif(j == 0) pre *= 9;\r\n\t\t\t\t\t\telse pre *= 10;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\ttot += pre*back;\r\n\t\t\t\tif(pre == 1 && flag) {\r\n\t\t\t\t\ttot--;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}else {\r\n\t\t\tflag = false;\r\n\t\t\tlong back = back(arr);\r\n\t\t\tlong pre = 1;\r\n\t\t\tfor(int j = 0 ;j<n-2 ; j++) {\r\n\t\t\t\tif(arr[j] == '_') {\r\n\t\t\t\t\tif(j == 0) pre *= 9;\r\n\t\t\t\t\telse pre *= 10;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\ttot += pre*back;\r\n\t\t\tif(pre == 1 && flag) {\r\n\t\t\t\ttot--;\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t\tsb.append(tot+\"\\n\");\r\n\t\t\t\t\r\n\t }\r\n\t static boolean flag;\r\n\t static long back(char[] arr ) {\r\n//\t\t System.out.println(String.valueOf(arr));\r\n\t\t long tot = 0;\r\n\t\t int n = arr.length;\r\n\t\t if(fnc(arr, n-1) && fnc(arr , n-2)) {\r\n\t\t\t long num = Long.parseLong(\"\"+arr[n-2] + arr[n-1]);\r\n\t\t\t if(num%25 == 0) {\r\n\t\t\t\t if(num == 0) flag = true;\r\n\t\t\t\t return 1;\r\n\t\t\t }\r\n\t\t\t else return 0;\r\n\t\t }else if(arr[n-1] == '_' && arr[n-2] == '_') {\r\n\t\t\t flag = true;\r\n\t\t\t return 4;\r\n\t\t }else if(arr[n-1] == '_' ) {\r\n\t\t\t if(arr[n-2] == '2' || arr[n-2] == '0' || arr[n-2] == '7' || arr[n-2] == '5')\r\n\t\t\t {\tif(arr[n-2] == '0') flag= true;\r\n\t\t\t\t return 1;\r\n\t\t\t }\r\n\t\t\t \r\n\t\t\t else return 0;\r\n\t\t }else {\r\n\t\t\t if(arr[n-1] == '0' || arr[n-1] == '5')\r\n\t\t\t\t {\r\n\t\t\t\t if(arr[n-1] == '0') flag = true;\r\n\t\t\t\t return 2;\r\n\t\t\t\t }\r\n\t\t\t else return 0;\r\n\t\t }\r\n\t\t }\r\n\t static boolean fnc(char[] arr , int i) {\r\n\t\t return arr[i] != '_' ;\r\n\t }\r\n}\r\n/*******************************************************************************************************************************************************/\r\n\r\n/**\r\n\r\n */\r\n\r\n \r\n\r\n", "lang_cluster": "Java", "tags": ["brute force", "dp", "dfs and similar"], "code_uid": "90c0ef84a34eab3e6e3928dd288ad6fd", "src_uid": "4a905f419550a6c839992b40f1617af3", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.util.*;\n// Problem Link: https://codeforces.com/problemset/problem/1575/D\npublic class div25 {\n public static char[] str;\n public static int S;\n public static void main (String[] args) throws IOException {\n BufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n str = in.readLine().toCharArray();\n S = str.length;\n int ans = 0;\n if (S==1) {\n if (str[0]=='X' || str[0] == '_' || Integer.parseInt(String.valueOf(str[0])) == 0) ans = 1;\n }\n else {\n ans += count_possibilities(2, 5);\n ans += count_possibilities(5, 0);\n ans += count_possibilities(7, 5);\n ans += count_possibilities(0, 0); }\n System.out.println(ans);\n\n\n }\n static int count_possibilities(int end1, int end2) {\n //System.out.println(end1 + \" \" + end2);\n if (S==2 && end1==0) return 0;\n int X_val = -1;\n if (str[S-2]=='X') X_val = end1;\n else {\n if (str[S-2]!='_') {\n if (value(S-2) != end1) return 0; } }\n //System.out.println(\"reached here\");\n if (str[S-1]=='X') {\n if (X_val != -1 && end2 != X_val) return 0;\n else X_val = end2; }\n else {\n if (str[S-1]!='_') {\n if (value(S-1) != end2) return 0; } }\n //System.out.println(\"reached HERE\");\n int total = 1;\n for (int i=0;i<S-2;i++) {\n// System.out.println(total);\n// System.out.println(X_val);\n// System.out.println(i + \" \" + str[i]);\n if (i==0) {\n if (str[i]=='X' && X_val==0) return 0;\n if (value(0) == 0) return 0; }\n if (str[i]=='_') {\n if (i==0) total *= 9;\n else total *= 10; }\n if (str[i]=='X') {\n if (X_val != -1) continue;\n else {\n X_val = 10; // represents that X can be any integer from 0 to 9 (or possibly 1 to 9)\n if (i==0) total *= 9;\n else total *= 10;\n }\n }\n }\n //System.out.println(total);\n return total;\n }\n\n static boolean isDigit(int pos) {\n if (str[pos]=='_' || str[pos]=='X') return false;\n else return true;\n }\n\n static int value(int pos) {\n if (!isDigit(pos)) return -1;\n return Integer.parseInt(String.valueOf(str[pos]));\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "dp", "dfs and similar"], "code_uid": "7456485f5329e1a348db1fa8b0795d22", "src_uid": "4a905f419550a6c839992b40f1617af3", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\r\nimport java.lang.reflect.Array;\r\nimport java.util.*;\r\n\r\npublic class Main {\r\n private static int solve(char[] s, char x) {\r\n for(int i = 0; i < s.length; i++) {\r\n if(s[i] == 'X') {\r\n s[i] = x;\r\n }\r\n }\r\n if(s[0] == '0') {\r\n return 0;\r\n }\r\n int ans = 1;\r\n boolean first = true;\r\n for(int i = 0; i < s.length; i++) {\r\n if(s[i] == '_') {\r\n ans *= i == 0 ? 9 : 10;\r\n } else if(s[i] == 'X' && first) {\r\n ans *= i == 0 ? 9 : 10;\r\n first = false;\r\n }\r\n }\r\n return ans;\r\n }\r\n private static boolean canReplace(char[] s, char a, char b) {\r\n if(s[s.length-2] >= '0' && s[s.length-2] <= '9' && s[s.length-2] != a) {\r\n return false;\r\n }\r\n if(s[s.length-1] >= '0' && s[s.length-1] <= '9' && s[s.length-1] != b) {\r\n return false;\r\n }\r\n if(s[s.length-2] == 'X' && s[s.length-1] == 'X' && a != b) {\r\n return false;\r\n }\r\n return true;\r\n }\r\n public static void main(String[] args) throws IOException{\r\n //BufferedReader f = new BufferedReader(new FileReader(\"cowjump.in\"));\r\n BufferedReader f = new BufferedReader(new InputStreamReader(System.in));\r\n //PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter(\"cowjump.out\")));\r\n PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\r\n char[] s = f.readLine().toCharArray();\r\n if(s.length < 2) {\r\n out.println(s[0] == '0' || s[0] == '_' || s[0] == 'X' ? 1 : 0);\r\n } else {\r\n int ans = 0;\r\n if(canReplace(s, '0', '0')) {\r\n char[] t = s.clone();\r\n t[t.length-2] = '0';\r\n t[t.length-1] = '0';\r\n if(s[s.length-2] == 'X') {\r\n ans += solve(t, t[t.length-2]);\r\n } else if(s[s.length-1] == 'X') {\r\n ans += solve(t, t[t.length-1]);\r\n } else {\r\n ans += solve(t, 'X');\r\n }\r\n }\r\n if(canReplace(s, '2', '5')) {\r\n char[] t = s.clone();\r\n t[t.length-2] = '2';\r\n t[t.length-1] = '5';\r\n if(s[s.length-2] == 'X') {\r\n ans += solve(t, t[t.length-2]);\r\n } else if(s[s.length-1] == 'X') {\r\n ans += solve(t, t[t.length-1]);\r\n } else {\r\n ans += solve(t, 'X');\r\n }\r\n }\r\n if(canReplace(s, '5', '0')) {\r\n char[] t = s.clone();\r\n t[t.length-2] = '5';\r\n t[t.length-1] = '0';\r\n if(s[s.length-2] == 'X') {\r\n ans += solve(t, t[t.length-2]);\r\n } else if(s[s.length-1] == 'X') {\r\n ans += solve(t, t[t.length-1]);\r\n } else {\r\n ans += solve(t, 'X');\r\n }\r\n }\r\n if(canReplace(s, '7', '5')) {\r\n char[] t = s.clone();\r\n t[t.length-2] = '7';\r\n t[t.length-1] = '5';\r\n if(s[s.length-2] == 'X') {\r\n ans += solve(t, t[t.length-2]);\r\n } else if(s[s.length-1] == 'X') {\r\n ans += solve(t, t[t.length-1]);\r\n } else {\r\n ans += solve(t, 'X');\r\n }\r\n }\r\n out.println(ans);\r\n }\r\n f.close();\r\n out.close();\r\n }\r\n}\r\n", "lang_cluster": "Java", "tags": ["brute force", "dp", "dfs and similar"], "code_uid": "e52648a078ed379e937034c16b228279", "src_uid": "4a905f419550a6c839992b40f1617af3", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\r\nimport java.io.IOException;\r\nimport java.io.InputStreamReader;\r\nimport java.io.PrintWriter;\r\nimport java.util.ArrayList;\r\nimport java.util.Arrays;\r\nimport java.util.HashMap;\r\nimport java.util.HashSet;\r\nimport java.util.Random;\r\nimport java.util.Stack;\r\nimport java.util.StringTokenizer;\r\nimport java.util.TreeMap;\r\n\r\n// CFPS -> CodeForcesProblemSet\r\npublic final class CFPS {\r\n\tstatic FastReader fr = new FastReader();\r\n\tstatic PrintWriter out = new PrintWriter(System.out);\r\n\tstatic final int gigamod = 1000000007;\r\n\tstatic int t = 1;\r\n\tstatic double epsilon = 0.00000001;\r\n\tstatic boolean[] isPrime;\r\n\tstatic int[] smallestFactorOf;\r\n\t\r\n\t@SuppressWarnings(\"unused\")\r\n\tpublic static void main(String[] args) {\r\n\t\tOUTER: \r\n\t\tfor (int tc = 0; tc < t; tc++) {\r\n\t\t\t\r\n\t\t\tchar[] sOG = fr.next().toCharArray();\r\n\t\t\tint n = sOG.length;\r\n\t\t\t\r\n\t\t\tif (n == 1) {\r\n\t\t\t\tif (sOG[0] == '0' || sOG[0] == '_' || sOG[0] == 'X')\r\n\t\t\t\t\tout.println(1);\r\n\t\t\t\telse\r\n\t\t\t\t\tout.println(0);\r\n\t\t\t\tcontinue OUTER;\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t// 00, 25, 50, 75 are the 4 universes\r\n\t\t\t// we'll count for all of them independently\r\n\t\t\t\r\n\t\t\tint answer = 0;\r\n\t\t\t\r\n\t\t\t{\r\n\t\t\t\t// 00\r\n\t\t\t\t// non _ and nonzero == death is true\r\n\t\t\t\tchar[] s = sOG.clone();\r\n\t\t\t\t\r\n\t\t\t\tboolean shit = (s[n - 1] != '_' && s[n - 1] != 'X' && s[n - 1] != '0');\r\n\t\t\t\tshit |= (s[n - 2] != '_' && s[n - 2] != 'X' && s[n - 2] != '0');\r\n\t\t\t\t\r\n\t\t\t\tif (!shit) {\r\n\t\t\t\t\t\r\n\t\t\t\t\tif (s[n - 1] == 'X' || s[n - 2] == 'X')\r\n\t\t\t\t\t\tfor (int i = 0; i < n; i++)\r\n\t\t\t\t\t\t\tif (s[i] == 'X')\r\n\t\t\t\t\t\t\t\ts[i] = '0';\r\n\t\t\t\t\ts[n - 1] = '0';\r\n\t\t\t\t\ts[n - 2] = '0';\r\n\t\t\t\t\t\r\n\t\t\t\t\t// now, we will iterate over all prefixes and\r\n\t\t\t\t\t// for each prefix, check whether it is possible to transform\r\n\t\t\t\t\t// s[] into (prefix + \"00\")\r\n\t\t\t\t\t\r\n\t\t\t\t\t// prefix has to be atmost 6 digits\r\n\t\t\t\t\t\r\n\t\t\t\t\tanswer += check(\"00\".toCharArray(), s);\r\n\t\t\t\t\t\r\n\t\t\t\t\tfor (int num = 0; num < 1e6; num++) {\r\n\t\t\t\t\t\tchar[] tgt = (Integer.toString(num) + \"00\").toCharArray();\r\n\t\t\t\t\t\tanswer += check(tgt, s);\r\n\t\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t\r\n\t\t\t{\r\n\t\t\t\t// 25\r\n\t\t\t\tchar[] s = sOG.clone();\r\n\t\t\t\t\r\n\t\t\t\tboolean shit = (s[n - 1] != '_' && s[n - 1] != 'X' && s[n - 1] != '5');\r\n\t\t\t\tshit |= s[n - 2] != '_' && s[n - 2] != 'X' && s[n - 2] != '2';\r\n\t\t\t\tshit |= (s[n - 1] == 'X' && s[n - 2] == 'X');\r\n\t\t\t\t\r\n\t\t\t\tif (!shit) {\r\n\t\t\t\t\t\r\n\t\t\t\t\tif (s[n - 1] == 'X') {\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t// replace each by 5\r\n\t\t\t\t\t\tfor (int i = 0; i < n; i++)\r\n\t\t\t\t\t\t\tif (s[i] == 'X')\r\n\t\t\t\t\t\t\t\ts[i] = '5';\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t} else if (s[n - 2] == 'X') {\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t// replace each by 2\r\n\t\t\t\t\t\tfor (int i = 0; i < n; i++)\r\n\t\t\t\t\t\t\tif (s[i] == 'X')\r\n\t\t\t\t\t\t\t\ts[i] = '2';\r\n\t\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t\t\ts[n - 1] = '5';\r\n\t\t\t\t\ts[n - 2] = '2';\r\n\t\t\t\t\t\r\n\t\t\t\t\tanswer += check(\"25\".toCharArray(), s);\r\n\t\t\t\t\t\r\n\t\t\t\t\tfor (int num = 0; num < 1e6; num++) {\r\n\t\t\t\t\t\tchar[] tgt = (Integer.toString(num) + \"25\").toCharArray();\r\n\t\t\t\t\t\tanswer += check(tgt, s);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t{\r\n\t\t\t\t// 50\r\n\t\t\t\tchar[] s = sOG.clone();\r\n\t\t\t\t\r\n\t\t\t\tboolean shit = (s[n - 1] != '_' && s[n - 1] != 'X' && s[n - 1] != '0');\r\n\t\t\t\tshit |= s[n - 2] != '_' && s[n - 2] != 'X' && s[n - 2] != '5';\r\n\t\t\t\tshit |= (s[n - 1] == 'X' && s[n - 2] == 'X');\r\n\t\t\t\t\r\n\t\t\t\tif (!shit) {\r\n\t\t\t\t\t\r\n\t\t\t\t\tif (s[n - 1] == 'X') {\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t// replace each by 0\r\n\t\t\t\t\t\tfor (int i = 0; i < n; i++)\r\n\t\t\t\t\t\t\tif (s[i] == 'X')\r\n\t\t\t\t\t\t\t\ts[i] = '0';\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t} else if (s[n - 2] == 'X') {\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t// replace each by 5\r\n\t\t\t\t\t\tfor (int i = 0; i < n; i++)\r\n\t\t\t\t\t\t\tif (s[i] == 'X')\r\n\t\t\t\t\t\t\t\ts[i] = '5';\r\n\t\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t\t\ts[n - 1] = '0';\r\n\t\t\t\t\ts[n - 2] = '5';\r\n\t\t\t\t\t\r\n\t\t\t\t\tanswer += check(\"50\".toCharArray(), s);\r\n\t\t\t\t\t\r\n\t\t\t\t\tfor (int num = 0; num < 1e6; num++) {\r\n\t\t\t\t\t\tchar[] tgt = (Integer.toString(num) + \"50\").toCharArray();\r\n\t\t\t\t\t\tanswer += check(tgt, s);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t{\r\n\t\t\t\t// 75\r\n\t\t\t\tchar[] s = sOG.clone();\r\n\t\t\t\t\r\n\t\t\t\tboolean shit = (s[n - 1] != '_' && s[n - 1] != 'X' && s[n - 1] != '5');\r\n\t\t\t\tshit |= s[n - 2] != '_' && s[n - 2] != 'X' && s[n - 2] != '7';\r\n\t\t\t\tshit |= (s[n - 1] == 'X' && s[n - 2] == 'X');\r\n\t\t\t\t\r\n\t\t\t\tif (!shit) {\r\n\t\t\t\t\t\r\n\t\t\t\t\tif (s[n - 1] == 'X') {\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t// replace each by 5\r\n\t\t\t\t\t\tfor (int i = 0; i < n; i++)\r\n\t\t\t\t\t\t\tif (s[i] == 'X')\r\n\t\t\t\t\t\t\t\ts[i] = '5';\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t} else if (s[n - 2] == 'X') {\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t// replace each by 7\r\n\t\t\t\t\t\tfor (int i = 0; i < n; i++)\r\n\t\t\t\t\t\t\tif (s[i] == 'X')\r\n\t\t\t\t\t\t\t\ts[i] = '7';\r\n\t\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t\t\ts[n - 1] = '5';\r\n\t\t\t\t\ts[n - 2] = '7';\r\n\t\t\t\t\t\r\n\t\t\t\t\tanswer += check(\"75\".toCharArray(), s);\r\n\t\t\t\t\t\r\n\t\t\t\t\tfor (int num = 0; num < 1e6; num++) {\r\n\t\t\t\t\t\tchar[] tgt = (Integer.toString(num) + \"75\").toCharArray();\r\n\t\t\t\t\t\tanswer += check(tgt, s);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tout.println(answer);\r\n\t\t\t\r\n\t\t\t// out.println(check(\"34593925\".toCharArray(), sOG));\r\n\t\t}\r\n\t\tout.close();\r\n\t}\r\n\t\r\n\tstatic int check(char[] tgt, char[] src) {\r\n\t\tint n = tgt.length;\r\n\t\tif (src.length != n) return 0;\r\n\t\t\r\n\t\t\r\n\t\t// 'X' check\r\n\t\tchar xDig = 0;\r\n\t\tfor (int i = 0; i < n; i++)\r\n\t\t\tif (src[i] == 'X') {\r\n\t\t\t\tif (xDig == 0) {\r\n\t\t\t\t\txDig = tgt[i];\r\n\t\t\t\t} else {\r\n\t\t\t\t\tif (tgt[i] != xDig) return 0;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t// assert all 'X's have same digit;\r\n\t\t\r\n\t\t\r\n\t\t\r\n\t\t// no leading zeroes plz\r\n\t\tif (tgt[0] == '0') return 0;\r\n\t\t\r\n\t\t// all non _s have to be equal\r\n\t\tfor (int i = 0; i < n; i++)\r\n\t\t\tif (src[i] != '_' && src[i] != 'X' && tgt[i] != src[i]) return 0;\r\n\t\t\r\n\t\treturn 1;\r\n\t}\r\n\t\r\n\tstatic class Edge implements Comparable<Edge> {\r\n\t\tint from, to;\r\n\t\tlong weight;\r\n\t\tint id;\r\n\t\t// int hash;\r\n\t\t\r\n\t\tEdge(int fro, int t, long weigh, int i) {\r\n\t\t\tfrom = fro;\r\n\t\t\tto = t;\r\n\t\t\tweight = weigh;\r\n\t\t\tid = i;\r\n\t\t\t// hash = Objects.hash(from, to, weight);\r\n\t\t}\r\n\t\t\r\n\t\t/*public int hashCode() {\r\n\t\t\treturn hash;\r\n\t\t}*/\r\n\t\t\r\n\t\tpublic int compareTo(Edge that) {\r\n\t\t\treturn Long.compare(this.id, that.id);\r\n\t\t}\r\n\t}\r\n\t\r\n\tpublic static long[][] sparseTable(long[] a)\r\n\t{\r\n\t\tint n = a.length;\r\n\t\tint b = 32-Integer.numberOfLeadingZeros(n);\r\n\t\tlong[][] ret = new long[b][];\r\n\t\tfor(int i = 0, l = 1;i < b;i++, l*=2) {\r\n\t\t\tif(i == 0) {\r\n\t\t\t\tret[i] = a;\r\n\t\t\t}else {\r\n\t\t\t\tret[i] = new long[n-l+1];\r\n\t\t\t\tfor(int j = 0;j < n-l+1;j++) {\r\n\t\t\t\t\tret[i][j] = Math.min(ret[i-1][j], ret[i-1][j+l/2]);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn ret;\r\n\t}\r\n\t\r\n\tpublic static long sparseRMQ(long[][] table, int l, int r)\r\n\t{\r\n\t\t// [a,b)\r\n\t\tassert l <= r;\r\n\t\tif(l >= r)return Integer.MAX_VALUE;\r\n\t\t// 1:0, 2:1, 3:1, 4:2, 5:2, 6:2, 7:2, 8:3\r\n\t\tint t = 31-Integer.numberOfLeadingZeros(r-l);\r\n\t\treturn Math.min(table[t][l], table[t][r-(1<<t)]);\r\n\t}\r\n\t\r\n\tstatic class Point implements Comparable<Point> {\r\n\t\tlong x;\r\n\t\tlong y;\r\n\t\tlong z;\r\n\t\tlong id;\r\n\t\t// private int hashCode;\r\n\t\t\r\n\t\tPoint() {\r\n\t\t\tx = z = y = 0;\r\n\t\t\t// this.hashCode = Objects.hash(x, y, cost);\r\n\t\t}\r\n\t\t\r\n\t\tPoint(Point p) {\r\n\t\t\tthis.x = p.x;\r\n\t\t\tthis.y = p.y;\r\n\t\t\tthis.z = p.z;\r\n\t\t\tthis.id = p.id;\r\n\t\t\t// this.hashCode = Objects.hash(x, y, cost);\r\n\t\t}\r\n\t\t\r\n\t\tPoint(long x, long y, long z, long id) {\r\n\t\t\tthis.x = x;\r\n\t\t\tthis.y = y;\r\n\t\t\tthis.z = z;\r\n\t\t\tthis.id = id;\r\n\t\t\t// this.hashCode = Objects.hash(x, y, id);\r\n\t\t}\r\n\t\t\r\n\t\tPoint(long a, long b) {\r\n\t\t\tthis.x = a;\r\n\t\t\tthis.y = b;\r\n\t\t\tthis.z = 0;\r\n\t\t\t// this.hashCode = Objects.hash(a, b);\r\n\t\t}\r\n\t\t\r\n\t\tPoint(long x, long y, long id) {\r\n\t\t\tthis.x = x;\r\n\t\t\tthis.y = y;\r\n\t\t\tthis.id = id;\r\n\t\t}\r\n\t\t\r\n\t\t@Override\r\n\t\tpublic int compareTo(Point o) {\r\n\t\t\tif (this.x < o.x)\r\n\t\t\t\treturn -1;\r\n\t\t\tif (this.x > o.x)\r\n\t\t\t\treturn 1;\r\n\t\t\tif (this.y < o.y)\r\n\t\t\t\treturn -1;\r\n\t\t\tif (this.y > o.y)\r\n\t\t\t\treturn 1;\r\n\t\t\tif (this.z < o.z)\r\n\t\t\t\treturn -1;\r\n\t\t\tif (this.z > o.z)\r\n\t\t\t\treturn 1;\r\n\t\t\treturn 0;\r\n\t\t}\r\n\t\t\r\n\t\t@Override\r\n\t\tpublic boolean equals(Object that) {\r\n\t\t\treturn this.compareTo((Point) that) == 0;\r\n\t\t}\r\n\t\t\r\n\t\t/*@Override\r\n\t\tpublic int hashCode() {\r\n\t\t\treturn this.hashCode;\r\n\t\t}*/\r\n\t}\r\n\t\r\n\tstatic class BinaryLift {\r\n\t\t\r\n\t\t// FUNCTIONS: k-th ancestor and LCA in log(n) \r\n\t\t\r\n\t\tint[] parentOf;\r\n\t\tint maxJmpPow;\r\n\t\tint[][] binAncestorOf;\r\n\t\tint n;\r\n\t\tint[] lvlOf;\r\n\t\t\r\n\t\t// How this works?\r\n\t\t\r\n\t\t// a. For every node, we store the b-ancestor for b in {1, 2, 4, 8, .. log(n)}.\r\n\t\t\r\n\t\t// b. When we need k-ancestor, we represent 'k' in binary and for each set bit, we \r\n\t\t// lift level in the tree.\r\n\t\t\r\n\t\tpublic BinaryLift(UGraph tree) {\r\n\t\t\tn = tree.V();\r\n\t\t\tmaxJmpPow = logk(n, 2) + 1;\r\n\t\t\tparentOf = new int[n];\r\n\t\t\tbinAncestorOf = new int[n][maxJmpPow];\r\n\t\t\tlvlOf = new int[n];\r\n\t\t\tfor (int i = 0; i < n; i++)\r\n\t\t\t\tArrays.fill(binAncestorOf[i], -1);\r\n\t\t\tparentConstruct(0, -1, tree, 0);\r\n\t\t\tbinConstruct();\r\n\t\t}\r\n\t\t\r\n\t\t// TODO: Implement lvlOf[] initialization\r\n\t\tpublic BinaryLift(int[] parentOf) {\r\n\t\t\tthis.parentOf = parentOf;\r\n\t\t\tn = parentOf.length;\r\n\t\t\tmaxJmpPow = logk(n, 2) + 1;\r\n\t\t\tbinAncestorOf = new int[n][maxJmpPow];\r\n\t\t\tlvlOf = new int[n];\r\n\t\t\tfor (int i = 0; i < n; i++)\r\n\t\t\t\tArrays.fill(binAncestorOf[i], -1);\r\n\t\t\tUGraph tree = new UGraph(n);\r\n\t\t\tfor (int i = 1; i < n; i++)\r\n\t\t\t\ttree.addEdge(i, parentOf[i]);\r\n\t\t\tbinConstruct();\r\n\t\t\tparentConstruct(0, -1, tree, 0);\r\n\t\t}\r\n\t\t\r\n\t\tprivate void parentConstruct(int current, int from, UGraph tree, int depth) {\r\n\t\t\tparentOf[current] = from;\r\n\t\t\tlvlOf[current] = depth;\r\n\t\t\tfor (int adj : tree.adj(current))\r\n\t\t\t\tif (adj != from)\r\n\t\t\t\t\tparentConstruct(adj, current, tree, depth + 1);\r\n\t\t}\r\n\t\t\r\n\t\tprivate void binConstruct() {\r\n\t\t\tfor (int node = 0; node < n; node++)\r\n\t\t\t\tfor (int lvl = 0; lvl < maxJmpPow; lvl++)\r\n\t\t\t\t\tbinConstruct(node, lvl);\r\n\t\t}\r\n\t\t\r\n\t\tprivate int binConstruct(int node, int lvl) {\r\n\t\t\tif (node < 0)\r\n\t\t\t\treturn -1;\r\n\t\t\tif (lvl == 0)\r\n\t\t\t\treturn binAncestorOf[node][lvl] = parentOf[node];\r\n\t\t\tif (node == 0)\r\n\t\t\t\treturn binAncestorOf[node][lvl] = -1;\r\n\t\t\t\r\n\t\t\tif (binAncestorOf[node][lvl] != -1)\r\n\t\t\t\treturn binAncestorOf[node][lvl];\r\n\t\t\treturn binAncestorOf[node][lvl] = binConstruct(binConstruct(node, lvl - 1), lvl - 1);\r\n\t\t}\r\n\t\t\r\n\t\t// return ancestor which is 'k' levels above this one\r\n\t\tpublic int ancestor(int node, int k) {\r\n\t\t\tif (node < 0)\r\n\t\t\t\treturn -1;\r\n\t\t\tif (node == 0)\r\n\t\t\t\tif (k == 0) return node;\r\n\t\t\t\telse return -1;\r\n\t\t\tif (k > (1 << maxJmpPow) - 1)\r\n\t\t\t\treturn -1;\r\n\t\t\tif (k == 0)\r\n\t\t\t\treturn node;\r\n\t\t\t\r\n\t\t\tint ancestor = node;\r\n\t\t\tint highestBit = Integer.highestOneBit(k);\r\n\t\t\t\r\n\t\t\twhile (k > 0 && ancestor != -1) {\r\n\t\t\t\tancestor = binAncestorOf[ancestor][logk(highestBit, 2)];\r\n\t\t\t\tk -= highestBit;\r\n\t\t\t\thighestBit = Integer.highestOneBit(k);\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\treturn ancestor;\r\n\t\t}\r\n\t\r\n\t\tpublic int lca(int u, int v) {\r\n\t\t\t\r\n\t\t\tif (u == v)\r\n\t\t\t\treturn u;\r\n\t\t\t\r\n\t\t\t// The invariant will be that 'u' is below 'v' initially.\r\n\t\t\tif (lvlOf[u] < lvlOf[v]) {\r\n\t\t\t\tint temp = u;\r\n\t\t\t\tu = v;\r\n\t\t\t\tv = temp;\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t// Equalizing the levels.\r\n\t\t\tu = ancestor(u, lvlOf[u] - lvlOf[v]);\r\n\t\t\t\r\n\t\t\tif (u == v)\r\n\t\t\t\treturn u;\r\n\t\t\t\r\n\t\t\t// We will now raise level by largest fitting power of two until possible.\r\n\t\t\tfor (int power = maxJmpPow - 1; power > -1; power--)\r\n\t\t\t\tif (binAncestorOf[u][power] != binAncestorOf[v][power]) {\r\n\t\t\t\t\tu = binAncestorOf[u][power];\r\n\t\t\t\t\tv = binAncestorOf[v][power];\r\n\t\t\t\t}\r\n\t\t\t\r\n\t\t\treturn ancestor(u, 1);\r\n\t\t}\r\n\t}\r\n\t\r\n\tstatic class DFSTree {\r\n\t\t\r\n\t\t// NOTE: The thing is made keeping in mind that the whole\r\n\t\t// \t input graph is connected.\r\n\t\t\r\n\t\tUGraph tree;\r\n\t\tUGraph backUG;\r\n\t\tint hasBridge;\r\n\t\tint n;\r\n\t\t\r\n\t\t\r\n\t\tDFSTree(UGraph ug) {\r\n\t\t\tthis.n = ug.V();\r\n\t\t\ttree = new UGraph(n);\r\n\t\t\thasBridge = -1;\r\n\t\t\tbackUG = new UGraph(n);\r\n\t\t\ttreeCalc(0, -1, new boolean[n], ug);\r\n\t\t}\r\n\t\t\r\n\t\tprivate void treeCalc(int current, int from, boolean[] marked, UGraph ug) {\r\n\t\t\tif (marked[current]) {\r\n\t\t\t\t// This is a backEdge.\r\n\t\t\t\tbackUG.addEdge(from, current);\r\n\t\t\t\treturn;\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tif (from != -1)\r\n\t\t\t\ttree.addEdge(from, current);\r\n\t\t\tmarked[current] = true;\r\n\t\t\t\r\n\t\t\tfor (int adj : ug.adj(current))\r\n\t\t\t\tif (adj != from)\r\n\t\t\t\t\ttreeCalc(adj, current, marked, ug);\r\n\t\t}\r\n\t\t\r\n\t\tpublic boolean hasBridge() {\r\n\t\t\tif (hasBridge != -1)\r\n\t\t\t\treturn (hasBridge == 1);\r\n\t\t\t\r\n\t\t\t// We have to determine the bridge.\r\n\t\t\tbridgeFinder();\r\n\t\t\treturn (hasBridge == 1);\r\n\t\t}\r\n\t\t\r\n\t\tint[] levelOf; \r\n\t\tint[] dp;\r\n\t\t\r\n\t\tprivate void bridgeFinder() {\r\n\t\t\t\r\n\t\t\t// Finding the level of each node.\r\n\t\t\tlevelOf = new int[n];\r\n\t\t\t\r\n\t\t\t// Applying DP solution.\r\n\t\t\t// dp[i] -> Highest level reachable from subtree of 'i' using\r\n\t\t\t// \t\tsome backEdge.\r\n\t\t\tdp = new int[n];\r\n\t\t\tArrays.fill(dp, Integer.MAX_VALUE / 100);\r\n\t\t\tdpDFS(0, -1, 0);\r\n\t\t\t\r\n\t\t\t// Now, we will check each edge and determine whether its a\r\n\t\t\t// bridge.\r\n\t\t\t\r\n\t\t\tfor (int i = 0; i < n; i++)\r\n\t\t\t\tfor (int adj : tree.adj(i)) {\r\n\t\t\t\t\t\r\n\t\t\t\t\t// (i -> adj) is the edge.\r\n\t\t\t\t\t\r\n\t\t\t\t\tif (dp[adj] > levelOf[i])\r\n\t\t\t\t\t\thasBridge = 1;\r\n\t\t\t\t}\r\n\t\t\t\r\n\t\t\tif (hasBridge != 1)\r\n\t\t\t\thasBridge = 0;\r\n\t\t}\r\n\t\t\r\n\t\tprivate int dpDFS(int current, int from, int lvl) {\r\n\t\t\tlevelOf[current] = lvl;\r\n\t\t\tdp[current] = levelOf[current];\r\n\t\t\tfor (int back : backUG.adj(current))\r\n\t\t\t\tdp[current] = Math.min(dp[current], levelOf[back]);\r\n\t\t\t\r\n\t\t\tfor (int adj : tree.adj(current))\r\n\t\t\t\tif (adj != from)\r\n\t\t\t\t\tdp[current] = Math.min(dp[current], dpDFS(adj, current, lvl + 1));\r\n\t\t\t\r\n\t\t\treturn dp[current];\r\n\t\t}\r\n\t}\r\n\t\r\n\tstatic class UnionFind {\r\n\t\t// Uses weighted quick-union with path compression.\r\n\t private int[] parent; // parent[i] = parent of i\r\n\t private int[] size; // size[i] = number of sites in tree rooted at i\r\n\t // Note: not necessarily correct if i is not a root node\r\n\t private int count; // number of components\r\n\r\n\t public UnionFind(int n) {\r\n\t count = n;\r\n\t parent = new int[n];\r\n\t size = new int[n];\r\n\t for (int i = 0; i < n; i++) {\r\n\t parent[i] = i;\r\n\t size[i] = 1;\r\n\t }\r\n\t }\r\n\r\n\t // Number of connected components.\r\n\t public int count() {\r\n\t return count;\r\n\t }\r\n\t \r\n\t // Find the root of p.\r\n\t public int find(int p) {\r\n\t \twhile (p != parent[p])\r\n\t p = parent[p];\r\n\t return p;\r\n\t }\r\n\r\n\t public boolean connected(int p, int q) {\r\n\t return find(p) == find(q);\r\n\t }\r\n\t \r\n\t public int numConnectedTo(int node) {\r\n\t \treturn size[find(node)];\r\n\t }\r\n\t \r\n\t // Weighted union.\r\n\t public void union(int p, int q) {\r\n\t int rootP = find(p);\r\n\t int rootQ = find(q);\r\n\t \r\n\t if (rootP == rootQ) return;\r\n\r\n\t // make smaller root point to larger one\r\n\t if (size[rootP] < size[rootQ]) {\r\n\t parent[rootP] = rootQ;\r\n\t size[rootQ] += size[rootP];\r\n\t }\r\n\t else {\r\n\t parent[rootQ] = rootP;\r\n\t size[rootP] += size[rootQ];\r\n\t }\r\n\t count--;\r\n\t }\r\n\t \r\n\t public static int[] connectedComponents(UnionFind uf) {\r\n\t \t// We can do this in nlogn.\r\n\t \t\r\n\t \tint n = uf.size.length;\r\n\t \tint[] compoColors = new int[n];\r\n\t \tfor (int i = 0; i < n; i++)\r\n\t \t\tcompoColors[i] = uf.find(i);\r\n\t \t\r\n\t \tHashMap<Integer, Integer> oldToNew = new HashMap<>();\r\n\t \tint newCtr = 0;\r\n\t \t\r\n\t \tfor (int i = 0; i < n; i++) {\r\n\t \t\t\r\n\t \t\tint thisOldColor = compoColors[i];\r\n\t \t\tInteger thisNewColor = oldToNew.get(thisOldColor);\r\n\t \t\tif (thisNewColor == null)\r\n\t \t\t\tthisNewColor = newCtr++;\r\n\t \t\t\r\n\t \t\toldToNew.put(thisOldColor, thisNewColor);\r\n\t \t\tcompoColors[i] = thisNewColor;\r\n\t \t}\r\n\t \t\r\n\t \treturn compoColors;\r\n\t }\r\n\t}\r\n\t\r\n\tstatic class UGraph {\r\n\t\t// Adjacency list.\r\n\t\tprivate HashSet<Integer>[] adj;\r\n\t\tprivate static final String NEWLINE = \"\\n\";\r\n\t\tprivate int E;\r\n\t\t\r\n\t\t@SuppressWarnings(\"unchecked\")\r\n\t\tpublic UGraph(int V) {\r\n\t\t\tadj = (HashSet<Integer>[]) new HashSet[V];\r\n\t\t\tE = 0;\r\n\t\t\tfor (int i = 0; i < V; i++)\r\n\t\t\t\tadj[i] = new HashSet<Integer>();\r\n\t\t}\r\n\t\t\r\n\t\tpublic void addEdge(int from, int to) {\r\n\t\t\tif (adj[from].contains(to)) return;\r\n\t\t\tE++;\r\n\t\t\tadj[from].add(to);\r\n\t\t\tadj[to].add(from);\r\n\t\t}\r\n\t\t\r\n\t\tpublic HashSet<Integer> adj(int from) {\r\n\t\t\treturn adj[from];\r\n\t\t}\r\n\t\t\r\n\t\tpublic int degree(int v) {\r\n\t\t\treturn adj[v].size();\r\n\t\t}\r\n\t\t\r\n\t\tpublic int V() {\r\n\t\t\treturn adj.length;\r\n\t\t}\r\n\t\t\r\n\t\tpublic int E() {\r\n\t\t\treturn E;\r\n\t\t}\r\n\t\t\r\n\t\tpublic String toString() {\r\n\t\t\tStringBuilder s = new StringBuilder();\r\n\t\t\ts.append(V() + \" vertices, \" + E() + \" edges \" + NEWLINE);\r\n\t\t\tfor (int v = 0; v < V(); v++) {\r\n\t\t\t\ts.append(v + \": \");\r\n\t\t\t\tfor (int w : adj[v]) {\r\n\t\t\t\t\ts.append(w + \" \");\r\n\t\t\t\t}\r\n\t\t\t\ts.append(NEWLINE);\r\n\t\t\t}\r\n\t\t\treturn s.toString();\r\n\t\t}\r\n\t\t\r\n\t\tpublic static void dfsMark(int current, boolean[] marked, UGraph g) {\r\n\t\t\tif (marked[current]) return;\r\n\t\t\t\r\n\t\t\tmarked[current] = true;\r\n\t\t\tIterable<Integer> adj = g.adj(current);\r\n\t\t\tfor (int adjc : adj)\r\n\t\t\t\tdfsMark(adjc, marked, g);\r\n\t\t}\r\n\t\t\r\n\t\tpublic static void dfsMark(int current, int from, long[] distTo, boolean[] marked, UGraph g, ArrayList<Integer> endPoints) {\r\n\t\t\tif (marked[current]) return;\r\n\t\t\t\r\n\t\t\tmarked[current] = true;\r\n\t\t\tif (from != -1)\r\n\t\t\t\tdistTo[current] = distTo[from] + 1;\r\n\t\t\tHashSet<Integer> adj = g.adj(current);\r\n\t\t\tint alreadyMarkedCtr = 0;\r\n\t\t\tfor (int adjc : adj) {\r\n\t\t\t\tif (marked[adjc]) alreadyMarkedCtr++;\r\n\t\t\t\tdfsMark(adjc, current, distTo, marked, g, endPoints);\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tif (alreadyMarkedCtr == adj.size())\r\n\t\t\t\tendPoints.add(current);\r\n\t\t}\r\n\t\t\r\n\t\tpublic static void bfsOrder(int current, UGraph g) {\r\n\t\t}\r\n\t\t\r\n\t\tpublic static void dfsMark(int current, int[] colorIds, int color, UGraph g) {\r\n\t\t\tif (colorIds[current] != -1) return;\r\n\t\t\t\r\n\t\t\tcolorIds[current] = color;\r\n\t\t\tIterable<Integer> adj = g.adj(current);\r\n\t\t\tfor (int adjc : adj)\r\n\t\t\t\tdfsMark(adjc, colorIds, color, g);\r\n\t\t}\r\n\t\t\r\n\t\tpublic static int[] connectedComponents(UGraph g) {\r\n\t\t\tint n = g.V();\r\n\t\t\tint[] componentId = new int[n];\r\n\t\t\tArrays.fill(componentId, -1);\r\n\t\t\tint colorCtr = 0;\r\n\t\t\tfor (int i = 0; i < n; i++) {\r\n\t\t\t\tif (componentId[i] != -1) continue;\r\n\t\t\t\tdfsMark(i, componentId, colorCtr, g);\r\n\t\t\t\tcolorCtr++;\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\treturn componentId;\r\n\t\t}\r\n\t\t\r\n\t\tpublic static boolean hasCycle(UGraph ug) {\r\n\t\t\tint n = ug.V();\r\n\t\t\tboolean[] marked = new boolean[n];\r\n\t\t\tboolean[] hasCycleFirst = new boolean[1];\r\n\t\t\tfor (int i = 0; i < n; i++) {\r\n\t\t\t\tif (marked[i]) continue;\r\n\t\t\t\thcDfsMark(i, ug, marked, hasCycleFirst, -1);\r\n\t\t\t}\r\n\t\t\treturn hasCycleFirst[0];\r\n\t\t}\r\n\t\t\r\n\t\t// Helper for hasCycle.\r\n\t\tprivate static void hcDfsMark(int current, UGraph ug, boolean[] marked, boolean[] hasCycleFirst, int parent) {\r\n\t\t\tif (marked[current]) return;\r\n\t\t\tif (hasCycleFirst[0]) return;\r\n\t\t\t\r\n\t\t\tmarked[current] = true;\r\n\t\t\tHashSet<Integer> adjc = ug.adj(current);\r\n\t\t\tfor (int adj : adjc) {\r\n\t\t\t\tif (marked[adj] && adj != parent && parent != -1) {\r\n\t\t\t\t\thasCycleFirst[0] = true;\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\thcDfsMark(adj, ug, marked, hasCycleFirst, current);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\r\n\tstatic class Digraph {\r\n\t\t// Adjacency list.\r\n\t\tprivate HashSet<Integer>[] adj;\r\n\t\tprivate static final String NEWLINE = \"\\n\";\r\n\t\tprivate int E;\r\n\t\t\r\n\t\t@SuppressWarnings(\"unchecked\")\r\n\t\tpublic Digraph(int V) {\r\n\t\t\tadj = (HashSet<Integer>[]) new HashSet[V];\r\n\t\t\tE = 0;\r\n\t\t\tfor (int i = 0; i < V; i++)\r\n\t\t\t\tadj[i] = new HashSet<Integer>();\r\n\t\t}\r\n\t\t\r\n\t\tpublic void addEdge(int from, int to) {\r\n\t\t\tif (adj[from].contains(to)) return;\r\n\t\t\tE++;\r\n\t\t\tadj[from].add(to);\r\n\t\t}\r\n\t\t\r\n\t\tpublic HashSet<Integer> adj(int from) {\r\n\t\t\treturn adj[from];\r\n\t\t}\r\n\t\t\r\n\t\tpublic int V() {\r\n\t\t\treturn adj.length;\r\n\t\t}\r\n\t\t\r\n\t\tpublic int E() {\r\n\t\t\treturn E;\r\n\t\t}\r\n\t\t\r\n\t\tpublic Digraph reversed() {\r\n\t\t\tDigraph dg = new Digraph(V());\r\n\t\t\tfor (int i = 0; i < V(); i++)\r\n\t\t\t\tfor (int adjVert : adj(i)) dg.addEdge(adjVert, i);\r\n\t\t\treturn dg;\r\n\t\t}\r\n\t\t\r\n\t\tpublic String toString() {\r\n\t\t\tStringBuilder s = new StringBuilder();\r\n\t\t\ts.append(V() + \" vertices, \" + E() + \" edges \" + NEWLINE);\r\n\t\t\tfor (int v = 0; v < V(); v++) {\r\n\t\t\t\ts.append(v + \": \");\r\n\t\t\t\tfor (int w : adj[v]) {\r\n\t\t\t\t\ts.append(w + \" \");\r\n\t\t\t\t}\r\n\t\t\t\ts.append(NEWLINE);\r\n\t\t\t}\r\n\t\t\treturn s.toString();\r\n\t\t}\r\n\t\t\r\n\t\tpublic static int[] KosarajuSharirSCC(Digraph dg) {\r\n\t\t\tint[] id = new int[dg.V()];\r\n\t\t\t\r\n\t\t\tDigraph reversed = dg.reversed();\r\n\t\t\t\r\n\t\t\t// Gotta perform topological sort on this one to get the stack.\r\n\t\t\tStack<Integer> revStack = Digraph.topologicalSort(reversed);\r\n\t\t\t\r\n\t\t\t// Initializing id and idCtr.\r\n\t\t\tid = new int[dg.V()];\r\n\t\t\tint idCtr = -1;\r\n\t\t\t\r\n\t\t\t// Creating a 'marked' array.\r\n\t\t\tboolean[] marked = new boolean[dg.V()];\r\n\t\t\t\r\n\t\t\twhile (!revStack.isEmpty()) {\r\n\t\t\t\tint vertex = revStack.pop();\r\n\t\t\t\tif (!marked[vertex]) \r\n\t\t\t\t\tsccDFS(dg, vertex, marked, ++idCtr, id);\r\n\t\t\t}\r\n\t\t\treturn id;\r\n\t\t}\r\n\t\t\r\n\t\tprivate static void sccDFS(Digraph dg, int source, boolean[] marked, int idCtr, int[] id) {\r\n\t\t\tmarked[source] = true;\r\n\t\t\tid[source] = idCtr;\r\n\t\t\tfor (Integer adjVertex : dg.adj(source))\r\n\t\t\t\tif (!marked[adjVertex]) sccDFS(dg, adjVertex, marked, idCtr, id);\r\n\t\t}\r\n\t\t\r\n\t\tpublic static Stack<Integer> topologicalSort(Digraph dg) {\r\n\t\t\t// dg has to be a directed acyclic graph.\r\n\t\t\t// We'll have to run dfs on the digraph and push the deepest nodes on stack first.\r\n\t\t\t// We'll need a Stack<Integer> and a int[] marked.\r\n\t\t\tStack<Integer> topologicalStack = new Stack<Integer>();\r\n\t\t\tboolean[] marked = new boolean[dg.V()];\r\n\t\t\t\r\n\t\t\t// Calling dfs\r\n\t\t\tfor (int i = 0; i < dg.V(); i++)\r\n\t\t\t\tif (!marked[i]) \r\n\t\t\t\t\trunDfs(dg, topologicalStack, marked, i);\r\n\t\t\t\r\n\t\t\treturn topologicalStack;\r\n\t\t}\r\n\t\t\r\n\t\tstatic void runDfs(Digraph dg, Stack<Integer> topologicalStack, boolean[] marked, int source) {\r\n\t\t\tmarked[source] = true;\r\n\t\t\tfor (Integer adjVertex : dg.adj(source))\r\n\t\t\t\tif (!marked[adjVertex]) \r\n\t\t\t\t\trunDfs(dg, topologicalStack, marked, adjVertex);\r\n\t\t\ttopologicalStack.add(source);\r\n\t\t}\r\n\t}\r\n\t\r\n\tstatic class FastReader {\r\n\t\tprivate BufferedReader bfr;\r\n\t\tprivate StringTokenizer st;\r\n\t\tpublic FastReader() {\r\n\t\t\tbfr = new BufferedReader(new InputStreamReader(System.in));\r\n\t\t}\r\n\r\n\t\tString next() {\r\n\t\t\tif (st == null || !st.hasMoreElements()) {\r\n\t\t\t\ttry {\r\n\t\t\t\t\tst = new StringTokenizer(bfr.readLine());\r\n\t\t\t\t} catch (IOException e) {\r\n\t\t\t\t\te.printStackTrace();\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\treturn st.nextToken();\r\n\t\t}\r\n\r\n\t\tint nextInt() {\r\n\t\t\treturn Integer.parseInt(next());\r\n\t\t}\r\n\r\n\t\tlong nextLong() {\r\n\t\t\treturn Long.parseLong(next());\r\n\t\t}\r\n\r\n\t\tdouble nextDouble() {\r\n\t\t\treturn Double.parseDouble(next());\r\n\t\t}\r\n\r\n\t\tchar nextChar() {\r\n\t\t\treturn next().toCharArray()[0];\r\n\t\t}\r\n\r\n\t\tString nextString() {\r\n\t\t\treturn next();\r\n\t\t}\r\n\r\n\t\tint[] nextIntArray(int n) {\r\n\t\t\tint[] arr = new int[n];\r\n\t\t\tfor (int i = 0; i < n; i++)\r\n\t\t\t\tarr[i] = nextInt();\r\n\t\t\treturn arr;\r\n\t\t}\r\n\r\n\t\tdouble[] nextDoubleArray(int n) {\r\n\t\t\tdouble[] arr = new double[n];\r\n\t\t\tfor (int i = 0; i < arr.length; i++)\r\n\t\t\t\tarr[i] = nextDouble();\r\n\t\t\treturn arr;\r\n\t\t}\r\n\r\n\t\tlong[] nextLongArray(int n) {\r\n\t\t\tlong[] arr = new long[n];\r\n\t\t\tfor (int i = 0; i < n; i++)\r\n\t\t\t\tarr[i] = nextLong();\r\n\t\t\treturn arr;\r\n\t\t}\r\n\t\t\r\n\t\tint[][] nextIntGrid(int n, int m) {\r\n\t\t\tint[][] grid = new int[n][m];\r\n\t\t\tfor (int i = 0; i < n; i++) {\r\n\t\t\t\tfor (int j = 0; j < m; j++)\r\n\t\t\t\t\tgrid[i][j] = fr.nextInt();\r\n\t\t\t}\r\n\t\t\treturn grid;\r\n\t\t}\r\n\t}\r\n\t\r\n\tstatic class LCA {\r\n\t int[] height, first, segtree;\r\n\t ArrayList<Integer> euler;\r\n\t boolean[] visited;\r\n\t int n;\r\n\r\n\t LCA(UGraph ug, int root) {\r\n\t n = ug.V();\r\n\t height = new int[n];\r\n\t first = new int[n];\r\n\t euler = new ArrayList<>();\r\n\t visited = new boolean[n];\r\n\t dfs(ug, root, 0);\r\n\t int m = euler.size();\r\n\t segtree = new int[m * 4];\r\n\t build(1, 0, m - 1);\r\n\t }\r\n\r\n\t void dfs(UGraph ug, int node, int h) {\r\n\t visited[node] = true;\r\n\t height[node] = h;\r\n\t first[node] = euler.size();\r\n\t euler.add(node);\r\n\t for (int adj : ug.adj(node)) {\r\n\t if (!visited[adj]) {\r\n\t dfs(ug, adj, h + 1);\r\n\t euler.add(node);\r\n\t }\r\n\t }\r\n\t }\r\n\r\n\t void build(int node, int b, int e) {\r\n\t if (b == e) {\r\n\t segtree[node] = euler.get(b);\r\n\t } else {\r\n\t int mid = (b + e) / 2;\r\n\t build(node << 1, b, mid);\r\n\t build(node << 1 | 1, mid + 1, e);\r\n\t int l = segtree[node << 1], r = segtree[node << 1 | 1];\r\n\t segtree[node] = (height[l] < height[r]) ? l : r;\r\n\t }\r\n\t }\r\n\r\n\t int query(int node, int b, int e, int L, int R) {\r\n\t if (b > R || e < L)\r\n\t return -1;\r\n\t if (b >= L && e <= R)\r\n\t return segtree[node];\r\n\t int mid = (b + e) >> 1;\r\n\r\n\t int left = query(node << 1, b, mid, L, R);\r\n\t int right = query(node << 1 | 1, mid + 1, e, L, R);\r\n\t if (left == -1) return right;\r\n\t if (right == -1) return left;\r\n\t return height[left] < height[right] ? left : right;\r\n\t }\r\n\r\n\t int lca(int u, int v) {\r\n\t int left = first[u], right = first[v];\r\n\t if (left > right) {\r\n\t \tint temp = left;\r\n\t \tleft = right;\r\n\t \tright = temp;\r\n\t }\r\n\t return query(1, 0, euler.size() - 1, left, right);\r\n\t }\r\n\t}\r\n\t\r\n\tstatic class FenwickTree {\r\n\r\n\t long[] array; // 1-indexed array, In this array We save cumulative information to perform efficient range queries and updates\r\n\r\n\t public FenwickTree(int size) {\r\n\t array = new long[size + 1];\r\n\t }\r\n\t \r\n\t public long rsq(int ind) {\r\n\t assert ind > 0;\r\n\t long sum = 0;\r\n\t while (ind > 0) {\r\n\t sum += array[ind];\r\n\t //Extracting the portion up to the first significant one of the binary representation of 'ind' and decrementing ind by that number\r\n\t ind -= ind & (-ind);\r\n\t }\r\n\r\n\t return sum;\r\n\t }\r\n\t \r\n\t public long rsq(int a, int b) {\r\n\t assert b >= a && a > 0 && b > 0;\r\n\r\n\t return rsq(b) - rsq(a - 1);\r\n\t }\r\n\t \r\n\t public void update(int ind, long value) {\r\n\t assert ind > 0;\r\n\t while (ind < array.length) {\r\n\t array[ind] += value;\r\n\t //Extracting the portion up to the first significant one of the binary representation of 'ind' and incrementing ind by that number\r\n\t ind += ind & (-ind);\r\n\t }\r\n\t }\r\n\r\n\t public int size() {\r\n\t return array.length - 1;\r\n\t }\r\n\t}\r\n\t\r\n\tstatic class SegmentTree {\r\n\r\n\t private Node[] heap;\r\n\t private long[] array;\r\n\t private int size;\r\n\t \r\n\t public SegmentTree(long[] array) {\r\n\t this.array = Arrays.copyOf(array, array.length);\r\n\t //The max size of this array is about 2 * 2 ^ log2(n) + 1\r\n\t size = (int) (2 * Math.pow(2.0, Math.floor((Math.log((double) array.length) / Math.log(2.0)) + 1)));\r\n\t heap = new Node[size];\r\n\t build(1, 0, array.length);\r\n\t }\r\n\r\n\t public int size() {\r\n\t return array.length;\r\n\t }\r\n\r\n\t //Initialize the Nodes of the Segment tree\r\n\t private void build(int v, int from, int size) {\r\n\t heap[v] = new Node();\r\n\t heap[v].from = from;\r\n\t heap[v].to = from + size - 1;\r\n\r\n\t if (size == 1) {\r\n\t heap[v].sum = array[from];\r\n\t heap[v].min = array[from];\r\n\t heap[v].max = array[from];\r\n\t } else {\r\n\t //Build childs\r\n\t build(2 * v, from, size / 2);\r\n\t build(2 * v + 1, from + size / 2, size - size / 2);\r\n\r\n\t heap[v].sum = heap[2 * v].sum + heap[2 * v + 1].sum;\r\n\t //min = min of the children\r\n\t heap[v].min = Math.min(heap[2 * v].min, heap[2 * v + 1].min);\r\n\t heap[v].max = Math.max(heap[2 * v].max, heap[2 * v + 1].max);\r\n\t }\r\n\t }\r\n\r\n\t public long rsq(int from, int to) {\r\n\t return rsq(1, from, to);\r\n\t }\r\n\r\n\t private long rsq(int v, int from, int to) {\r\n\t Node n = heap[v];\r\n\r\n\t //If you did a range update that contained this node, you can infer the Sum without going down the tree\r\n\t if (n.pendingVal != null && contains(n.from, n.to, from, to)) {\r\n\t return (to - from + 1) * n.pendingVal;\r\n\t }\r\n\r\n\t if (contains(from, to, n.from, n.to)) {\r\n\t return heap[v].sum;\r\n\t }\r\n\r\n\t if (intersects(from, to, n.from, n.to)) {\r\n\t propagate(v);\r\n\t long leftSum = rsq(2 * v, from, to);\r\n\t long rightSum = rsq(2 * v + 1, from, to);\r\n\r\n\t return leftSum + rightSum;\r\n\t }\r\n\r\n\t return 0;\r\n\t }\r\n\r\n\t public long rMinQ(int from, int to) {\r\n\t return rMinQ(1, from, to);\r\n\t }\r\n\r\n\t private long rMinQ(int v, int from, int to) {\r\n\t Node n = heap[v];\r\n\r\n\r\n\t //If you did a range update that contained this node, you can infer the Min value without going down the tree\r\n\t if (n.pendingVal != null && contains(n.from, n.to, from, to)) {\r\n\t return n.pendingVal;\r\n\t }\r\n\r\n\t if (contains(from, to, n.from, n.to)) {\r\n\t return heap[v].min;\r\n\t }\r\n\r\n\t if (intersects(from, to, n.from, n.to)) {\r\n\t propagate(v);\r\n\t long leftMin = rMinQ(2 * v, from, to);\r\n\t long rightMin = rMinQ(2 * v + 1, from, to);\r\n\r\n\t return Math.min(leftMin, rightMin);\r\n\t }\r\n\r\n\t return Integer.MAX_VALUE;\r\n\t }\r\n\t \r\n\t public long rMaxQ(int from, int to) {\r\n\t return rMaxQ(1, from, to);\r\n\t }\r\n\r\n\t private long rMaxQ(int v, int from, int to) {\r\n\t Node n = heap[v];\r\n\r\n\r\n\t //If you did a range update that contained this node, you can infer the Min value without going down the tree\r\n\t if (n.pendingVal != null && contains(n.from, n.to, from, to)) {\r\n\t return n.pendingVal;\r\n\t }\r\n\r\n\t if (contains(from, to, n.from, n.to)) {\r\n\t return heap[v].max;\r\n\t }\r\n\r\n\t if (intersects(from, to, n.from, n.to)) {\r\n\t propagate(v);\r\n\t long leftMax = rMaxQ(2 * v, from, to);\r\n\t long rightMax = rMaxQ(2 * v + 1, from, to);\r\n\r\n\t return Math.max(leftMax, rightMax);\r\n\t }\r\n\r\n\t return Integer.MIN_VALUE;\r\n\t }\r\n\r\n\t public void update(int from, int to, long value) {\r\n\t update(1, from, to, value);\r\n\t }\r\n\r\n\t private void update(int v, int from, int to, long value) {\r\n\r\n\t //The Node of the heap tree represents a range of the array with bounds: [n.from, n.to]\r\n\t Node n = heap[v];\r\n\r\n\t if (contains(from, to, n.from, n.to)) {\r\n\t change(n, value);\r\n\t }\r\n\r\n\t if (n.size() == 1) return;\r\n\r\n\t if (intersects(from, to, n.from, n.to)) {\r\n\t propagate(v);\r\n\r\n\t update(2 * v, from, to, value);\r\n\t update(2 * v + 1, from, to, value);\r\n\r\n\t n.sum = heap[2 * v].sum + heap[2 * v + 1].sum;\r\n\t n.min = Math.min(heap[2 * v].min, heap[2 * v + 1].min);\r\n\t n.max = Math.max(heap[2 * v].max, heap[2 * v + 1].max);\r\n\t }\r\n\t }\r\n\r\n\t //Propagate temporal values to children\r\n\t private void propagate(int v) {\r\n\t Node n = heap[v];\r\n\r\n\t if (n.pendingVal != null) {\r\n\t change(heap[2 * v], n.pendingVal);\r\n\t change(heap[2 * v + 1], n.pendingVal);\r\n\t n.pendingVal = null; //unset the pending propagation value\r\n\t }\r\n\t }\r\n\r\n\t //Save the temporal values that will be propagated lazily\r\n\t private void change(Node n, long value) {\r\n\t n.pendingVal = value;\r\n\t n.sum = n.size() * value;\r\n\t n.min = value;\r\n\t n.max = value;\r\n\t array[n.from] = value;\r\n\t }\r\n\r\n\t //Test if the range1 contains range2\r\n\t private boolean contains(int from1, int to1, int from2, int to2) {\r\n\t return from2 >= from1 && to2 <= to1;\r\n\t }\r\n\r\n\t //check inclusive intersection, test if range1[from1, to1] intersects range2[from2, to2]\r\n\t private boolean intersects(int from1, int to1, int from2, int to2) {\r\n\t return from1 <= from2 && to1 >= from2 // (.[..)..] or (.[...]..)\r\n\t || from1 >= from2 && from1 <= to2; // [.(..]..) or [..(..)..\r\n\t }\r\n\r\n\t //The Node class represents a partition range of the array.\r\n\t static class Node {\r\n\t long sum;\r\n\t long min;\r\n\t long max;\r\n\t //Here we store the value that will be propagated lazily\r\n\t Long pendingVal = null;\r\n\t int from;\r\n\t int to;\r\n\r\n\t int size() {\r\n\t return to - from + 1;\r\n\t }\r\n\t }\r\n\t}\r\n\t\t\r\n\t@SuppressWarnings(\"serial\")\r\n\tstatic class CountMap<T> extends TreeMap<T, Integer>{\r\n\t\t\r\n\t\tCountMap() {\r\n\t\t}\r\n\t\t\r\n\t\tCountMap(T[] arr) {\r\n\t\t\tthis.putCM(arr);\r\n\t\t}\r\n\t\t\r\n\t\tpublic Integer putCM(T key) {\r\n\t\t\treturn super.put(key, super.getOrDefault(key, 0) + 1);\r\n\t\t}\r\n\t\t\r\n\t\tpublic Integer removeCM(T key) {\r\n\t\t\tint count = super.getOrDefault(key, -1);\r\n\t\t\tif (count == -1) return -1;\r\n\t\t\tif (count == 1)\r\n\t\t\t\treturn super.remove(key);\r\n\t\t\telse\r\n\t\t\t\treturn super.put(key, count - 1);\r\n\t\t}\r\n\t\t\r\n\t\tpublic Integer getCM(T key) {\r\n\t\t\treturn super.getOrDefault(key, 0);\r\n\t\t}\r\n\t\r\n\t\tpublic void putCM(T[] arr) {\r\n\t\t\tfor (T l : arr)\r\n\t\t\t\tthis.putCM(l);\r\n\t\t}\r\n\t}\r\n\t\r\n\tstatic long dioGCD(long a, long b, long[] x0, long[] y0) {\r\n\t if (b == 0) {\r\n\t x0[0] = 1;\r\n\t y0[0] = 0;\r\n\t return a;\r\n\t }\r\n\t long[] x1 = new long[1], y1 = new long[1];\r\n\t long d = dioGCD(b, a % b, x1, y1);\r\n\t x0[0] = y1[0];\r\n\t y0[0] = x1[0] - y1[0] * (a / b);\r\n\t return d;\r\n\t}\r\n\r\n\tstatic boolean diophantine(long a, long b, long c, long[] x0, long[] y0, long[] g) {\r\n\t g[0] = dioGCD(Math.abs(a), Math.abs(b), x0, y0);\r\n\t if (c % g[0] > 0) {\r\n\t return false;\r\n\t }\r\n\r\n\t x0[0] *= c / g[0];\r\n\t y0[0] *= c / g[0];\r\n\t if (a < 0) x0[0] = -x0[0];\r\n\t if (b < 0) y0[0] = -y0[0];\r\n\t return true;\r\n\t}\r\n\t\r\n\tstatic long[][] prod(long[][] mat1, long[][] mat2) {\r\n\t\tint n = mat1.length;\r\n\t\tlong[][] prod = new long[n][n];\r\n\t\t\r\n\t\tfor (int i = 0; i < n; i++)\r\n\t\t\tfor (int j = 0; j < n; j++)\r\n\t\t\t\t// determining prod[i][j]\r\n\t\t\t\t// it will be the dot product of mat1[i][] and mat2[][i] \r\n\t\t\t\tfor (int k = 0; k < n; k++)\r\n\t\t\t\t\tprod[i][j] += mat1[i][k] * mat2[k][j];\r\n\t\treturn prod;\r\n\t}\r\n\tstatic long[][] matExpo(long[][] mat, long power) {\r\n\t\tint n = mat.length;\r\n\t\tlong[][] ans = new long[n][n];\r\n\t\t\r\n\t\tif (power == 0)\r\n\t\t\treturn null;\r\n\t\t\r\n\t\tif (power == 1)\r\n\t\t\treturn mat;\r\n\t\t\r\n\t\tlong[][] half = matExpo(mat, power / 2);\r\n\t\tans = prod(half, half);\r\n\t\t\r\n\t\tif (power % 2 == 1) {\r\n\t\t\tans = prod(ans, mat);\r\n\t\t}\r\n\t\t\r\n\t\treturn ans;\r\n\t}\r\n\t\r\n\tstatic int KMPNumOcc(char[] text, char[] pat) {\r\n\t\tint n = text.length;\r\n\t\tint m = pat.length;\r\n\t\t\r\n\t\tchar[] patPlusText = new char[n + m + 1];\r\n\t\tfor (int i = 0; i < m; i++)\r\n\t\t\tpatPlusText[i] = pat[i];\r\n\t\tpatPlusText[m] = '^'; \t\t// Seperator\r\n\t\tfor (int i = 0; i < n; i++)\r\n\t\t\tpatPlusText[m + i] = text[i];\r\n\t\t\r\n\t\tint[] fullPi = piCalcKMP(patPlusText);\r\n\t\tint answer = 0;\r\n\t\tfor (int i = 0; i < n + m + 1; i++)\r\n\t\t\tif (fullPi[i] == m)\r\n\t\t\t\tanswer++;\r\n\t\treturn answer;\r\n\t}\r\n\tstatic int[] piCalcKMP(char[] s) {\r\n\t\tint n = s.length;\r\n\t\tint[] pi = new int[n];\r\n\t\tfor (int i = 1; i < n; i++) {\r\n\t\t\tint j = pi[i - 1];\r\n\t\t\twhile (j > 0 && s[i] != s[j])\r\n\t\t\t\tj = pi[j - 1];\r\n\t\t\tif (s[i] == s[j])\r\n\t\t\t\tj++;\r\n\t\t\tpi[i] = j;\r\n\t\t}\r\n\t\treturn pi;\r\n\t}\r\n\tstatic long hash(long key) {\r\n long h = Long.hashCode(key);\r\n h ^= (h >>> 20) ^ (h >>> 12) ^ (h >>> 7) ^ (h >>> 4);\r\n return h & (gigamod-1);\r\n }\r\n\t\r\n\tstatic int mapTo1D(int row, int col, int n, int m) {\r\n\t\t// Maps elements in a 2D matrix serially to elements in \r\n\t\t// a 1D array.\r\n\t\treturn row * m + col;\r\n\t}\r\n\tstatic int[] mapTo2D(int idx, int n, int m) {\r\n\t\t// Inverse of what the one above does.\r\n\t\tint[] rnc = new int[2];\r\n\t\trnc[0] = idx / m;\r\n\t\trnc[1] = idx % m;\r\n\t\treturn rnc;\r\n\t}\r\n\t\r\n\tstatic boolean[] primeGenerator(int upto) {\r\n\t\t// Sieve of Eratosthenes: \r\n\t\tisPrime = new boolean[upto + 1];\r\n\t\tsmallestFactorOf = new int[upto + 1];\r\n\t\tArrays.fill(smallestFactorOf, 1);\r\n\t\tArrays.fill(isPrime, true);\r\n\t\tisPrime[1] = isPrime[0] = false;\r\n\r\n\t\tfor (long i = 2; i < upto + 1; i++)\r\n\t\t\tif (isPrime[(int) i]) {\r\n\t\t\t\tsmallestFactorOf[(int) i] = (int) i;\r\n\t\t\t\t// Mark all the multiples greater than or equal\r\n\t\t\t\t// to the square of i to be false.\r\n\t\t\t\tfor (long j = i; j * i < upto + 1; j++) {\r\n\t\t\t\t\tif (isPrime[(int) j * (int) i]) {\r\n\t\t\t\t\t\tisPrime[(int) j * (int) i] = false;\r\n\t\t\t\t\t\tsmallestFactorOf[(int) j * (int) i] = (int) i;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\treturn isPrime;\r\n\t}\r\n\tstatic HashMap<Integer, Integer> smolNumPrimeFactorization(int num) {\r\n\t\tif (smallestFactorOf == null)\r\n\t\t\tprimeGenerator(num + 1);\r\n\t\tHashMap<Integer, Integer> fnps = new HashMap<>();\r\n\t\twhile (num != 1) {\r\n\t\t\tfnps.put(smallestFactorOf[num], fnps.getOrDefault(smallestFactorOf[num], 0) + 1);\r\n\t\t\tnum /= smallestFactorOf[num];\r\n\t\t}\r\n\t\treturn fnps;\r\n\t}\r\n\tstatic HashMap<Long, Integer> primeFactorization(long num) {\r\n\t\t// Returns map of factor and its power in the number.\r\n\t\tHashMap<Long, Integer> map = new HashMap<>();\r\n\t\twhile (num % 2 == 0) {\r\n\t\t\tnum /= 2;\r\n\t\t\tInteger pwrCnt = map.get(2L);\r\n\t\t\tmap.put(2L, pwrCnt != null ? pwrCnt + 1 : 1);\r\n\t\t}\r\n\t\tfor (long i = 3; i * i <= num; i += 2) {\r\n\t\t\twhile (num % i == 0) {\r\n\t\t\t\tnum /= i;\r\n\t\t\t\tInteger pwrCnt = map.get(i);\r\n\t\t\t\tmap.put(i, pwrCnt != null ? pwrCnt + 1 : 1);\r\n\t\t\t}\r\n\t\t}\r\n\t\t// If the number is prime, we have to add it to the \r\n\t\t// map.\r\n\t\tif (num != 1)\r\n\t\t\tmap.put(num, 1);\r\n\t\treturn map;\r\n\t}\r\n\tstatic HashSet<Long> divisors(long num) {\r\n\t\tHashSet<Long> divisors = new HashSet<Long>();\r\n\t\tdivisors.add(1L);\r\n\t\tdivisors.add(num);\r\n\t\tfor (long i = 2; i * i <= num; i++) {\r\n\t\t\tif (num % i == 0) {\r\n\t\t\t\tdivisors.add(num/i);\r\n\t\t\t\tdivisors.add(i);\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn divisors;\r\n\t}\r\n\tstatic void coprimeGenerator(int m, int n, ArrayList<Point> coprimes, int limit, int numCoprimes) {\r\n\t\tif (m > limit) return;\r\n\t\tif (m <= limit && n <= limit)\r\n\t\t\tcoprimes.add(new Point(m, n));\r\n\t\tif (coprimes.size() > numCoprimes) return;\r\n\t\tcoprimeGenerator(2 * m - n, m, coprimes, limit, numCoprimes);\r\n\t\tcoprimeGenerator(2 * m + n, m, coprimes, limit, numCoprimes);\r\n\t\tcoprimeGenerator(m + 2 * n, n, coprimes, limit, numCoprimes);\r\n\t}\r\n\t\r\n\tstatic int bsearch(int[] arr, int val, int lo, int hi) {\r\n\t\t// Returns the index of the first element\r\n\t\t// larger than or equal to val.\r\n\t\tint idx = -1;\r\n\t\twhile (lo <= hi) {\r\n\t\t\tint mid = lo + (hi - lo)/2;\r\n\t\t\tif (arr[mid] >= val) {\r\n\t\t\t\tidx = mid;\r\n\t\t\t\thi = mid - 1;\r\n\t\t\t} else\r\n\t\t\t\tlo = mid + 1;\r\n\t\t}\r\n\t\treturn idx;\r\n\t}\r\n\tstatic int bsearch(long[] arr, long val, int lo, int hi) {\r\n\t\t// Returns the index of the first element\r\n\t\t// larger than or equal to val.\r\n\t\tint idx = -1;\r\n\t\twhile (lo <= hi) {\r\n\t\t\tint mid = lo + (hi - lo)/2;\r\n\t\t\tif (arr[mid] >= val) {\r\n\t\t\t\tidx = mid;\r\n\t\t\t\thi = mid - 1;\r\n\t\t\t} else\r\n\t\t\t\tlo = mid + 1;\r\n\t\t}\r\n\t\treturn idx;\r\n\t}\r\n\tstatic int bsearch(long[] arr, long val, int lo, int hi, boolean sMode) {\r\n\t\t// Returns the index of the last element \r\n\t\t// smaller than or equal to val.\r\n\t\tint idx = -1;\r\n\t\twhile (lo <= hi) {\r\n\t\t\tint mid = lo + (hi - lo)/2;\r\n\t\t\tif (arr[mid] > val) {\r\n\t\t\t\thi = mid - 1;\r\n\t\t\t} else {\r\n\t\t\t\tidx = mid;\r\n\t\t\t\tlo = mid + 1;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn idx;\r\n\t}\r\n\tstatic int bsearch(int[] arr, long val, int lo, int hi, boolean sMode) {\r\n\t\tint idx = -1;\r\n\t\twhile (lo <= hi) {\r\n\t\t\tint mid = lo + (hi - lo)/2;\r\n\t\t\tif (arr[mid] > val) {\r\n\t\t\t\thi = mid - 1;\r\n\t\t\t} else {\r\n\t\t\t\tidx = mid;\r\n\t\t\t\tlo = mid + 1;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn idx;\r\n\t}\r\n\t\r\n\tstatic long nCr(long n, long r, long[] fac) { long p = gigamod; if (r == 0) return 1; return (fac[(int)n] * modInverse(fac[(int)r], p) % p * modInverse(fac[(int)n - (int)r], p) % p) % p; } \r\n\tstatic long modInverse(long n, long p) { return power(n, p - 2, p); } \r\n\tstatic long modDiv(long a, long b){return mod(a * power(b, gigamod - 2, gigamod));}\r\n\tstatic long power(long x, long y, long p) { long res = 1; x = x % p; while (y > 0) { if ((y & 1)==1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } \r\n\tstatic int logk(long n, long k) { return (int)(Math.log(n) / Math.log(k)); }\r\n\tstatic long gcd(long a, long b) { if (b == 0) { return a; } else { return gcd(b, a % b); } } static int gcd(int a, int b) { if (b == 0) { return a; } else { return gcd(b, a % b); } } static long gcd(long[] arr) { int n = arr.length; long gcd = arr[0]; for (int i = 1; i < n; i++) { gcd = gcd(gcd, arr[i]); } return gcd; } static int gcd(int[] arr) { int n = arr.length; int gcd = arr[0]; for (int i = 1; i < n; i++) { gcd = gcd(gcd, arr[i]); } return gcd; } static long lcm(long[] arr) { long lcm = arr[0]; int n = arr.length; for (int i = 1; i < n; i++) { lcm = (lcm * arr[i]) / gcd(lcm, arr[i]); } return lcm; } static long lcm(long a, long b) { return (a * b)/gcd(a, b); } static boolean less(int a, int b) { return a < b ? true : false; } static boolean isSorted(int[] a) { for (int i = 1; i < a.length; i++) { if (less(a[i], a[i - 1])) return false; } return true; } static boolean isSorted(long[] a) { for (int i = 1; i < a.length; i++) { if (a[i] < a[i - 1]) return false; } return true; } static void swap(int[] a, int i, int j) { int temp = a[i]; a[i] = a[j]; a[j] = temp; } static void swap(long[] a, int i, int j) { long temp = a[i]; a[i] = a[j]; a[j] = temp; } static void swap(double[] a, int i, int j) { double temp = a[i]; a[i] = a[j]; a[j] = temp; } static void swap(char[] a, int i, int j) { char temp = a[i]; a[i] = a[j]; a[j] = temp; }\r\n\tstatic void sort(int[] arr) { shuffleArray(arr, 0, arr.length - 1); Arrays.sort(arr); } static void sort(char[] arr) { shuffleArray(arr, 0, arr.length - 1); Arrays.sort(arr); } static void sort(long[] arr) { shuffleArray(arr, 0, arr.length - 1); Arrays.sort(arr); } static void sort(double[] arr) { shuffleArray(arr, 0, arr.length - 1); Arrays.sort(arr); } static void reverseSort(int[] arr) { shuffleArray(arr, 0, arr.length - 1); Arrays.sort(arr); int n = arr.length; for (int i = 0; i < n/2; i++) swap(arr, i, n - 1 - i); } static void reverseSort(char[] arr) { shuffleArray(arr, 0, arr.length - 1); Arrays.sort(arr); int n = arr.length; for (int i = 0; i < n/2; i++) swap(arr, i, n - 1 - i); } static void reverse(char[] arr) { int n = arr.length; for (int i = 0; i < n / 2; i++) swap(arr, i, n - 1 - i); } static void reverseSort(long[] arr) { shuffleArray(arr, 0, arr.length - 1); Arrays.sort(arr); int n = arr.length; for (int i = 0; i < n/2; i++) swap(arr, i, n - 1 - i); } static void reverseSort(double[] arr) { shuffleArray(arr, 0, arr.length - 1); Arrays.sort(arr); int n = arr.length; for (int i = 0; i < n/2; i++) swap(arr, i, n - 1 - i); }\r\n\tstatic void shuffleArray(long[] arr, int startPos, int endPos) { Random rnd = new Random(); for (int i = startPos; i < endPos; ++i) { long tmp = arr[i]; int randomPos = i + rnd.nextInt(endPos - i); arr[i] = arr[randomPos]; arr[randomPos] = tmp; } } static void shuffleArray(int[] arr, int startPos, int endPos) { Random rnd = new Random(); for (int i = startPos; i < endPos; ++i) { int tmp = arr[i]; int randomPos = i + rnd.nextInt(endPos - i); arr[i] = arr[randomPos]; arr[randomPos] = tmp; } }\r\n\tstatic void shuffleArray(double[] arr, int startPos, int endPos) { Random rnd = new Random(); for (int i = startPos; i < endPos; ++i) { double tmp = arr[i]; int randomPos = i + rnd.nextInt(endPos - i); arr[i] = arr[randomPos]; arr[randomPos] = tmp; } }\r\n\tstatic void shuffleArray(char[] arr, int startPos, int endPos) { Random rnd = new Random(); for (int i = startPos; i < endPos; ++i) { char tmp = arr[i]; int randomPos = i + rnd.nextInt(endPos - i); arr[i] = arr[randomPos]; arr[randomPos] = tmp; } }\r\n\tstatic boolean isPrime(long n) {if (n<=1)return false;if(n<=3)return true;if(n%2==0||n%3==0)return false;for(long i=5;i*i<=n;i=i+6)if(n%i==0||n%(i+2)==0)return false;return true;}\r\n\tstatic String toString(int[] dp){StringBuilder sb=new StringBuilder();for(int i=0;i<dp.length;i++)sb.append(dp[i]+\" \");return sb.toString();}\r\n\tstatic String toString(boolean[] dp){StringBuilder sb=new StringBuilder();for(int i=0;i<dp.length;i++)sb.append(dp[i]+\" \");return sb.toString();}\r\n\tstatic String toString(long[] dp){StringBuilder sb=new StringBuilder();for(int i=0;i<dp.length;i++)sb.append(dp[i]+\" \");return sb.toString();}\r\n\tstatic String toString(char[] dp){StringBuilder sb=new StringBuilder();for(int i=0;i<dp.length;i++)sb.append(dp[i]+\"\");return sb.toString();}\r\n\tstatic String toString(int[][] dp){StringBuilder sb=new StringBuilder();for(int i=0;i<dp.length;i++){for(int j=0;j<dp[i].length;j++){sb.append(dp[i][j]+\" \");}sb.append('\\n');}return sb.toString();}\r\n\tstatic String toString(long[][] dp){StringBuilder sb=new StringBuilder();for(int i=0;i<dp.length;i++){for(int j=0;j<dp[i].length;j++) {sb.append(dp[i][j]+\" \");}sb.append('\\n');}return sb.toString();}\r\n\tstatic String toString(double[][] dp){StringBuilder sb=new StringBuilder();for(int i = 0;i<dp.length;i++){for(int j = 0;j<dp[i].length;j++){sb.append(dp[i][j]+\" \");}sb.append('\\n');}return sb.toString();}\r\n\tstatic String toString(char[][] dp){StringBuilder sb = new StringBuilder();for(int i = 0;i<dp.length;i++){for(int j = 0;j<dp[i].length;j++){sb.append(dp[i][j]+\"\");}sb.append('\\n');}return sb.toString();}\r\n\tstatic long mod(long a, long m){return(a%m+1000000L*m)%m;}\r\n\tstatic long mod(long num){return(num%gigamod+gigamod)%gigamod;}\r\n}\r\n\r\n// NOTES: \r\n// ASCII VALUE OF 'A': 65\r\n// ASCII VALUE OF 'a': 97\r\n// Range of long: 9 * 10^18\r\n// ASCII VALUE OF '0': 48\r\n// Primes upto 'n' can be given by (n / (logn)). ", "lang_cluster": "Java", "tags": ["brute force", "dp", "dfs and similar"], "code_uid": "3a25bf17a8b8c6268f14892b752f6833", "src_uid": "4a905f419550a6c839992b40f1617af3", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\r\nimport java.io.*;\r\n\r\npublic class B{\r\n\r\n public static int takeInt(BufferedReader br)throws IOException{\r\n int n=Integer.parseInt(br.readLine().trim());\r\n return n;\r\n }\r\n public static String[] takeStrings(BufferedReader br)throws IOException{\r\n String inp[]=br.readLine().trim().split(\" \");\r\n return inp;\r\n }\r\n public static int[] takeInts(BufferedReader br)throws IOException{\r\n String inp[]=takeStrings(br);\r\n int n=inp.length;\r\n int arr[]=new int[n];\r\n for(int i=0;i<n;i++){\r\n arr[i]=Integer.parseInt(inp[i]);\r\n }\r\n return arr;\r\n }\r\n public static char[] generateStrings(char str[], int n, char dig){\r\n char strs[]=new char[n];\r\n for(int i=0;i<n;i++){\r\n if(str[i] == 'X') strs[i]=dig;\r\n else strs[i]=str[i];\r\n }\r\n return strs;\r\n }\r\n public static void main(String args[])throws IOException{\r\n BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\r\n int test = 1;\r\n StringBuilder ans=new StringBuilder();\r\n outer:while(test-->0){\r\n\r\n char str[]=br.readLine().trim().toCharArray();\r\n int n=str.length;\r\n\r\n if(n == 1){\r\n if(str[0] == '0' || str[0] == '_' || str[0] == 'X' || str[0] == '1'){\r\n ans.append(1+\"\\n\");continue;\r\n } \r\n }\r\n \r\n long cnt=0;\r\n boolean Xp =false;\r\n // boolean allZero=true;\r\n // for(int i=0;i<n;i++) if(str[i] != '0') allZero=false;\r\n\r\n for(int i=0;i<n;i++) if(str[i] == 'X') Xp=true;\r\n\r\n \r\n\r\n if(Xp){\r\n for(char ch='0';ch<='9';ch++){\r\n cnt+=solve(generateStrings(str, n, ch), n);\r\n }\r\n }\r\n else{\r\n cnt+=solve(str, n);\r\n }\r\n \r\n ans.append(cnt+\"\\n\");\r\n }\r\n System.out.println(ans);\r\n }\r\n public static long cal(char str[], String suffix, int n, int un)\r\n {\r\n if(n<2) return 0;\r\n char last =suffix.charAt(1);\r\n char first=suffix.charAt(0);\r\n if(str[n-1] == '_' || str[n-1] == last){\r\n if(str[n-2] == '_' || str[n-2] == first ){\r\n return (long)Math.pow(10, un);\r\n }\r\n }\r\n\r\n return 0;\r\n }\r\n public static long solve(char str[], int n){\r\n if(n == 1 || str[0] == '0') return 0;\r\n long a=0,b=0,c=0,d=0;\r\n int un=0;\r\n for(int i=1;i<n-2;i++) if(str[i] == '_') ++un;\r\n long cnt=0;\r\n\r\n\r\n cnt+=cal(str, \"25\", n, un);\r\n cnt+=cal(str, \"50\", n, un);\r\n cnt+=cal(str, \"75\", n, un);\r\n\r\n if(n>2)\r\n if(str[0] == '_') cnt*=9l;\r\n\r\n // System.out.println(new String(str));\r\n \r\n if(n>=3)\r\n {\r\n if((str[n-1] == '_' || str[n-1] == '0') && (str[n-2] == '_' || str[n-2] == '0')){\r\n if(n>3)\r\n {\r\n long temp=(long)Math.pow(10, un);\r\n if(str[0] == '_') temp*=9l;\r\n cnt+=temp;\r\n }\r\n else if(n == 3)\r\n {\r\n // System.out.println(\"Entering....\"+str[0]);\r\n if(str[0] == '_'){\r\n cnt+=9;\r\n // System.out.println(\"Entered@\"+cnt);\r\n }\r\n else{\r\n cnt+=1;\r\n }\r\n }\r\n }\r\n }\r\n\r\n \r\n // System.out.println(cnt);\r\n return cnt;\r\n }\r\n}", "lang_cluster": "Java", "tags": ["brute force", "dp", "dfs and similar"], "code_uid": "5cd5484347c7be30d70a7c7f93fb2df8", "src_uid": "4a905f419550a6c839992b40f1617af3", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "// ----------------------------------- Duniya Madarchod Hai ----------------------------------- \r\n\r\nimport java.io.*;\r\nimport java.math.*;\r\nimport java.util.*;\r\n\r\npublic class Main\r\n {\r\n\r\n/*\r\n \r\n public String wrd() throws IOException{return(read.next());}\r\n public int ni() throws IOException{return(read.nextInt());}\r\n public double nd() throws IOException{return(read.nextDouble());}\r\n public long nl() throws IOException{return(read.nextLong());}\r\n public int[] ai(int n) throws IOException{int arr[] = new int[n];for(int i = 0; i<n; i++)arr[i] = read.nextInt();return(arr);}\r\n public double[] ad(int n) throws IOException\r\n {double arr[] = new double[n];for(int i = 0; i<n; i++)arr[i] = read.nextDouble();return(arr);}\r\n public long[] al(int n) throws IOException\r\n {long arr[] = new long[n];for(int i = 0; i<n; i++)arr[i] = read.nextLong();return(arr);}\r\n\r\n class FastReader \r\n {\r\n BufferedReader br;\r\n StringTokenizer st;\r\n public FastReader(){\r\n br = new BufferedReader(new InputStreamReader(System.in));\r\n if (System.getProperty(\"ONLINE_JUDGE\") == null) \r\n {\r\n try \r\n {\r\n InputStream inputStream = new FileInputStream(\"input.txt\");\r\n InputStreamReader inputStreamReader = new InputStreamReader(inputStream);\r\n System.setOut(new PrintStream(new FileOutputStream(\"output.txt\")));\r\n br = new BufferedReader(inputStreamReader);\r\n }\r\n catch (Exception e) \r\n {\r\n e.printStackTrace();\r\n }\r\n }\r\n }\r\n\r\n\r\n\r\n String next(){while (st == null || !st.hasMoreElements()){try{st = new StringTokenizer(br.readLine());}catch (IOException e){e.printStackTrace();}}return st.nextToken();}\r\n int nextInt() { return Integer.parseInt(next()); }\r\n long nextLong() { return Long.parseLong(next()); }\r\n double nextDouble(){return Double.parseDouble(next());}\r\n String nextLine(){String str = \"\";try{str = br.readLine();}catch (IOException e){e.printStackTrace();}return str;}}\r\n\r\n*/\r\n\r\n\r\n class Reader \r\n {\r\n final private int BUFFER_SIZE = 1 << 16;\r\n private DataInputStream din;\r\n private byte[] buffer;\r\n private int bufferPointer, bytesRead;\r\n\r\n public Reader()\r\n {\r\n din = new DataInputStream(System.in);\r\n if (System.getProperty(\"ONLINE_JUDGE\") == null) \r\n {\r\n try \r\n {\r\n din = new DataInputStream(new FileInputStream(\"input.txt\"));\r\n System.setOut(new PrintStream(new FileOutputStream(\"output.txt\")));\r\n }\r\n catch (Exception e) \r\n {\r\n e.printStackTrace();\r\n }\r\n }\r\n buffer = new byte[BUFFER_SIZE];\r\n bufferPointer = bytesRead = 0;\r\n }\r\n\r\n public String readLine() throws IOException\r\n {\r\n byte[] buf = new byte[64]; // line length\r\n int cnt = 0, c;\r\n while ((c = read()) != -1) {\r\n if (c == '\\n') {\r\n if (cnt != 0) {\r\n break;\r\n }\r\n else {\r\n continue;\r\n }\r\n }\r\n buf[cnt++] = (byte)c;\r\n }\r\n return new String(buf, 0, cnt);\r\n }\r\n\r\n public int nextInt() throws IOException\r\n {\r\n int ret = 0;\r\n byte c = read();\r\n while (c <= ' ') {\r\n c = read();\r\n }\r\n boolean neg = (c == '-');\r\n if (neg)\r\n c = read();\r\n do {\r\n ret = ret * 10 + c - '0';\r\n } while ((c = read()) >= '0' && c <= '9');\r\n\r\n if (neg)\r\n return -ret;\r\n return ret;\r\n }\r\n\r\n public long nextLong() throws IOException\r\n {\r\n long ret = 0;\r\n byte c = read();\r\n while (c <= ' ')\r\n c = read();\r\n boolean neg = (c == '-');\r\n if (neg)\r\n c = read();\r\n do {\r\n ret = ret * 10 + c - '0';\r\n } while ((c = read()) >= '0' && c <= '9');\r\n if (neg)\r\n return -ret;\r\n return ret;\r\n }\r\n\r\n public double nextDouble() throws IOException\r\n {\r\n double ret = 0, div = 1;\r\n byte c = read();\r\n while (c <= ' ')\r\n c = read();\r\n boolean neg = (c == '-');\r\n if (neg)\r\n c = read();\r\n\r\n do {\r\n ret = ret * 10 + c - '0';\r\n } while ((c = read()) >= '0' && c <= '9');\r\n\r\n if (c == '.') {\r\n while ((c = read()) >= '0' && c <= '9') {\r\n ret += (c - '0') / (div *= 10);\r\n }\r\n }\r\n\r\n if (neg)\r\n return -ret;\r\n return ret;\r\n }\r\n\r\n private void fillBuffer() throws IOException\r\n {\r\n bytesRead = din.read(buffer, bufferPointer = 0,\r\n BUFFER_SIZE);\r\n if (bytesRead == -1)\r\n buffer[0] = -1;\r\n }\r\n\r\n private byte read() throws IOException\r\n {\r\n if (bufferPointer == bytesRead)\r\n fillBuffer();\r\n return buffer[bufferPointer++];\r\n }\r\n\r\n public void close() throws IOException\r\n {\r\n if (din == null)\r\n return;\r\n din.close();\r\n }\r\n }\r\npublic String readLine() throws IOException{return(read.readLine());}\r\n public int ni() throws IOException{return(read.nextInt());}\r\n public double nd() throws IOException{return(read.nextDouble());}\r\n public long nl() throws IOException{return(read.nextLong());}\r\n \r\n\r\n\r\npublic static void main(String[] args) throws IOException{Main obj = new Main();obj.solve();}\r\n \r\n\r\n long gcd(long a, long b)\r\n {\r\n while (b != 0)\r\n {\r\n long t = a;\r\n a = b;\r\n b = t % b;\r\n }\r\n return a;\r\n }\r\n\r\n long getSum(long arr[], int start, int end)\r\n {\r\n if(start == 0)\r\n return arr[end];\r\n return(arr[end] - arr[start-1]);\r\n }\r\n long MODULO = 1000*1000l*1000l + 7l;\r\n StringBuilder sb;\r\n Reader read;\r\n //FastReader read;\r\n\r\n int count = 0;\r\n public void solve() throws IOException\r\n {\r\n //Scanner sn = new Scanner(System.in);\r\n sb = new StringBuilder();\r\n //read = new FastReader();\r\n read = new Reader();\r\n int tt = 1;\r\n \r\n for(int tk = 0; tk < tt; tk++)\r\n {\r\n String s = read.readLine();\r\n s = s.substring(0, s.length()-1);\r\n char arr[] = s.toCharArray();\r\n \r\n int numX = 0;\r\n if(arr[0] == '0' && arr.length != 1)\r\n {\r\n sb.append(0);\r\n continue;\r\n }\r\n for(char c : arr)\r\n {\r\n if(c == 'X')\r\n numX++;\r\n }\r\n\r\n char xStop = numX == 0 ? '0' : '9';\r\n\r\n for(char alpha = '0'; alpha <= xStop ; alpha++)\r\n {\r\n dfs(arr, 0, alpha);\r\n } \r\n\r\n sb.append(count);\r\n \r\n }\r\n\r\n\r\n System.out.println(sb);\r\n }\r\n\r\n\r\n void dfs(char arr[], int idx, char xVal)\r\n {\r\n if(idx == arr.length)\r\n {\r\n if(check(arr))\r\n count++;\r\n return;\r\n }\r\n\r\n\r\n if(arr[idx] == 'X')\r\n {\r\n \r\n\r\n arr[idx] = xVal;\r\n dfs(arr, idx+1, xVal);\r\n arr[idx] = 'X';\r\n }\r\n else if(arr[idx] == '_')\r\n {\r\n //char start = idx ==0 ? '1' : '0';\r\n for(char curr = '0'; curr <= '9'; curr++)\r\n {\r\n arr[idx] = curr;\r\n dfs(arr, idx+1, xVal);\r\n arr[idx] = '_';\r\n } \r\n }\r\n else\r\n {\r\n dfs(arr, idx+1, xVal);\r\n }\r\n }\r\n\r\n\r\n boolean check(char arr[])\r\n {\r\n if(arr[0] == '0' && arr.length > 1)\r\n return false;\r\n //bSystem.out.println(\"AT CHECK \"+Arrays.toString(arr));\r\n int temp = 0;\r\n for(int i = 0; i<arr.length; i++)\r\n {\r\n int num = arr[i] - '0';\r\n temp = temp * 10 + num;\r\n }\r\n\r\n return(temp % 25 == 0);\r\n }\r\n}", "lang_cluster": "Java", "tags": ["brute force", "dp", "dfs and similar"], "code_uid": "91285c1a3ad2e82e77fe3908341d4ec7", "src_uid": "4a905f419550a6c839992b40f1617af3", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.util.*;\n\n\npublic class P1575D {\n public static void main(String[] args) throws IOException {\n MyScanner scanner = new MyScanner(System.in);\n PrintWriter writer = new PrintWriter(System.out);\n\n char[] s = scanner.nextToken().toCharArray();\n int ans = 0;\n\n if (s.length == 1) {\n if (s[0] == '0' || s[0] == '_' || s[0] == 'X') {\n ans = 1;\n }\n } else {\n int n = s.length;\n if (!(s[n - 1] == 'X' && s[n - 2] == 'X')) {\n // put 25\n if (canPut(s, n - 1, '5') && canPut(s, n - 2, '2')) {\n char[] s1 = Arrays.copyOf(s, n);\n put(s1, n - 1, '5');\n put(s1, n - 2, '2');\n ans += possible(s1);\n }\n // put 50\n if (canPut(s, n - 1, '0') && canPut(s, n - 2, '5')) {\n char[] s1 = Arrays.copyOf(s, n);\n put(s1, n - 1, '0');\n put(s1, n - 2, '5');\n ans += possible(s1);\n }\n // put 75\n if (canPut(s, n - 1, '5') && canPut(s, n - 2, '7')) {\n char[] s1 = Arrays.copyOf(s, n);\n put(s1, n - 1, '5');\n put(s1, n - 2, '7');\n ans += possible(s1);\n }\n }\n // put 00\n if (s[n - 1] == 'X' && s[n - 2] == 'X') {\n char[] s1 = Arrays.copyOf(s, n);\n put(s1, n - 1, '0');\n ans += possible(s1);\n } else if (canPut(s, n - 1, '0') && canPut(s, n - 2, '0')) {\n char[] s1 = Arrays.copyOf(s, n);\n put(s1, n - 1, '0');\n put(s1, n - 2, '0');\n ans += possible(s1);\n }\n }\n writer.println(ans);\n\n writer.flush();\n }\n\n private static boolean canPut(char[] s, int p, char d) {\n if (s[p] == 'X' || s[p] == '_') {\n return true;\n }\n return s[p] == d;\n }\n\n private static void put(char[] s, int p, char d) {\n if (s[p] == 'X') {\n replace(s, d);\n } else {\n s[p] = d;\n }\n }\n\n private static void replace(char[] s, char d) {\n for (int i = 0; i < s.length; i++) {\n if (s[i] == 'X') {\n s[i] = d;\n }\n }\n }\n\n private static int possible(char[] s) {\n int p = 1;\n\n if (s[0] == '0') {\n return 0;\n }\n if (s[0] == '_') {\n p *= 9;\n } else if (s[0] == 'X') {\n p *= 9;\n replace(s, '1');\n }\n for (int i = 1; i < s.length; i++) {\n if (s[i] == '_') {\n p *= 10;\n } else if (s[i] == 'X') {\n p *= 10;\n replace(s, '1');\n }\n }\n\n return p;\n }\n\n private static class MyScanner {\n private BufferedReader reader;\n private StringTokenizer st;\n\n public MyScanner(InputStream inputStream) {\n reader = new BufferedReader(new InputStreamReader(inputStream));\n }\n\n private String nextToken() throws IOException {\n while(st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(reader.readLine());\n }\n return st.nextToken();\n }\n\n public int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n public long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "dp", "dfs and similar"], "code_uid": "e301325da4af222e62a4c7136faf3338", "src_uid": "4a905f419550a6c839992b40f1617af3", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\r\nimport java.util.*;\r\npublic class Main {\r\n public static void main(String args[])\r\n {\r\n FastReader input=new FastReader();\r\n PrintWriter out=new PrintWriter(System.out);\r\n int T=1;\r\n while(T-->0)\r\n {\r\n String s=input.next();\r\n if(s.length()==1)\r\n {\r\n if(s.charAt(0)=='0' || s.charAt(0)=='_' || s.charAt(0)=='X') out.println(1);\r\n else out.println(0);\r\n }\r\n else\r\n {\r\n int f=0;\r\n for(int i=0;i<s.length();i++)\r\n {\r\n if(s.charAt(i)=='X')\r\n {\r\n f=1;\r\n break;\r\n }\r\n }\r\n if(f==0)\r\n {\r\n out.println(fun(s));\r\n }\r\n else\r\n {\r\n int sum=0;\r\n for(int i=0;i<10;i++)\r\n {\r\n char ch[]=s.toCharArray();\r\n for(int j=0;j<s.length();j++)\r\n {\r\n if(ch[j]=='X')\r\n {\r\n ch[j]=(char)(i+'0');\r\n }\r\n }\r\n String str=String.copyValueOf(ch);\r\n sum+=fun(str);\r\n }\r\n out.println(sum);\r\n }\r\n }\r\n }\r\n out.close();\r\n }\r\n public static int fun(String s)\r\n {\r\n int n=s.length();\r\n int p=0;\r\n if(s.charAt(0)!='0')p=1;\r\n for(int i=0;i<n-2;i++)\r\n {\r\n if(s.charAt(i)=='_')\r\n {\r\n if(i==0) p*=9;\r\n else p*=10;\r\n }\r\n }\r\n int p1=0;\r\n if(s.charAt(n-1)=='_' && s.charAt(n-2)=='_')\r\n {\r\n p1=4;\r\n if(n==2) p1=3;\r\n }\r\n else if(s.charAt(n-1)=='_')\r\n {\r\n if(s.charAt(n-2)=='0' || s.charAt(n-2)=='5' || s.charAt(n-2)=='2' || s.charAt(n-2)=='7') p1=1;\r\n }\r\n else if(s.charAt(n-2)=='_')\r\n {\r\n if(s.charAt(n-1)=='0')\r\n {\r\n p1=2;\r\n if(n==2) p1=1;\r\n }\r\n else if(s.charAt(n-1)=='5')\r\n {\r\n p1=2;\r\n }\r\n }\r\n else\r\n {\r\n int val=Integer.valueOf(s.substring(n-2));\r\n if(val%25==0) p1=1;\r\n }\r\n int pro=p*p1;\r\n return pro;\r\n }\r\n static class FastReader\r\n {\r\n BufferedReader br;\r\n StringTokenizer st;\r\n public FastReader()\r\n {\r\n br = new BufferedReader(new InputStreamReader(System.in));\r\n }\r\n String next()\r\n {\r\n while (st == null || !st.hasMoreElements())\r\n {\r\n try\r\n {\r\n st = new StringTokenizer(br.readLine());\r\n }\r\n catch (IOException e)\r\n {\r\n e.printStackTrace();\r\n }\r\n }\r\n return st.nextToken();\r\n }\r\n int nextInt()\r\n {\r\n return Integer.parseInt(next());\r\n }\r\n long nextLong()\r\n {\r\n return Long.parseLong(next());\r\n }\r\n double nextDouble()\r\n {\r\n return Double.parseDouble(next());\r\n }\r\n String nextLine()\r\n {\r\n String str=\"\";\r\n try\r\n {\r\n str=br.readLine();\r\n }\r\n catch (IOException e)\r\n {\r\n e.printStackTrace();\r\n }\r\n return str;\r\n }\r\n }\r\n}", "lang_cluster": "Java", "tags": ["brute force", "dp", "dfs and similar"], "code_uid": "3468de98ef204f71a22c04adb3d33872", "src_uid": "4a905f419550a6c839992b40f1617af3", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\r\nimport java.lang.Math;\r\nimport java.lang.reflect.Array;\r\nimport java.util.*;\r\nimport javax.swing.text.DefaultStyledDocument.ElementSpec;\r\n\r\npublic final class Solution {\r\n\r\n static BufferedReader br = new BufferedReader(\r\n new InputStreamReader(System.in)\r\n );\r\n static BufferedWriter bw = new BufferedWriter(\r\n new OutputStreamWriter(System.out)\r\n );\r\n static StringTokenizer st;\r\n\r\n /*write your constructor and global variables here*/\r\n\r\n static class sortCond implements Comparator<Pair<Integer, Integer>> {\r\n\r\n @Override\r\n public int compare(Pair<Integer, Integer> p1, Pair<Integer, Integer> p2) {\r\n if (p1.a <= p2.a) {\r\n return -1;\r\n } else {\r\n return 1;\r\n }\r\n }\r\n }\r\n\r\n static class Rec {\r\n\r\n int a;\r\n int b;\r\n long c;\r\n\r\n Rec(int a, int b, long c) {\r\n this.a = a;\r\n this.b = b;\r\n this.c = c;\r\n }\r\n }\r\n\r\n static class Pair<f, s> {\r\n\r\n f a;\r\n s b;\r\n\r\n Pair(f a, s b) {\r\n this.a = a;\r\n this.b = b;\r\n }\r\n }\r\n\r\n interface modOperations {\r\n int mod(int a, int b, int mod);\r\n }\r\n\r\n static int findBinaryExponentian(int a, int pow, int mod) {\r\n if (pow == 1) {\r\n return a;\r\n } else if (pow == 0) {\r\n return 1;\r\n } else {\r\n int retVal = findBinaryExponentian(a, (int) pow / 2, mod);\r\n int val = (pow % 2 == 0) ? 1 : a;\r\n return modMul.mod(modMul.mod(retVal, retVal, mod), val, mod);\r\n }\r\n }\r\n\r\n static int findPow(int a, int b, int mod) {\r\n if (b == 1) {\r\n return a % mod;\r\n } else if (b == 0) {\r\n return 1;\r\n } else {\r\n int res = findPow(a, (int) b / 2, mod);\r\n return modMul.mod(res, modMul.mod(res, (b % 2 == 1 ? a : 1), mod), mod);\r\n }\r\n }\r\n\r\n static int bleft(int ele, int[] sortedArr) {\r\n int l = 0;\r\n int h = sortedArr.length - 1;\r\n int ans = -1;\r\n while (l <= h) {\r\n int mid = l + (int) (h - l) / 2;\r\n if (sortedArr[mid] < ele) {\r\n ans = mid;\r\n l = mid + 1;\r\n } else if (sortedArr[mid] >= ele) {\r\n h = mid - 1;\r\n }\r\n }\r\n return ans;\r\n }\r\n\r\n static int gcd(int a, int b) {\r\n int div = b;\r\n int rem = a % b;\r\n while (rem != 0) {\r\n int temp = rem;\r\n rem = div % rem;\r\n div = temp;\r\n }\r\n return div;\r\n }\r\n\r\n static long[] log(long no, long n) {\r\n long i = 1;\r\n int cnt = 0;\r\n long sum = 0l;\r\n long arr[] = new long[2];\r\n while (i < no) {\r\n sum += i;\r\n cnt++;\r\n if (sum == n) {\r\n arr[0] = 1l * cnt;\r\n arr[1] = sum;\r\n break;\r\n }\r\n i *= 2l;\r\n }\r\n if (arr[0] == 0) {\r\n arr[0] = cnt;\r\n arr[1] = sum;\r\n }\r\n return arr;\r\n }\r\n\r\n static modOperations modAdd = (int a, int b, int mod) -> {\r\n return (a % mod + b % mod) % mod;\r\n };\r\n static modOperations modSub = (int a, int b, int mod) -> {\r\n return (int) ((1l * a % mod - 1l * b % mod + 1l * mod) % mod);\r\n };\r\n static modOperations modMul = (int a, int b, int mod) -> {\r\n return (int) ((1l * (a % mod) * 1l * (b % mod)) % (1l * mod));\r\n };\r\n static modOperations modDiv = (int a, int b, int mod) -> {\r\n return modMul.mod(a, findBinaryExponentian(b, mod - 1, mod), mod);\r\n };\r\n\r\n static HashSet<Integer> primeList(int MAXI) {\r\n int[] prime = new int[MAXI + 1];\r\n HashSet<Integer> obj = new HashSet<>();\r\n for (int i = 2; i <= (int) Math.sqrt(MAXI) + 1; i++) {\r\n if (prime[i] == 0) {\r\n obj.add(i);\r\n for (int j = i * i; j <= MAXI; j += i) {\r\n prime[j] = 1;\r\n }\r\n }\r\n }\r\n for (int i = (int) Math.sqrt(MAXI) + 1; i <= MAXI; i++) {\r\n if (prime[i] == 0) {\r\n obj.add(i);\r\n }\r\n }\r\n return obj;\r\n }\r\n\r\n static int[] factorialList(int MAXI, int mod) {\r\n int[] factorial = new int[MAXI + 1];\r\n factorial[2] = 1;\r\n for (int i = 3; i < MAXI + 1; i++) {\r\n factorial[i] = modMul.mod(factorial[i - 1], i, mod);\r\n }\r\n return factorial;\r\n }\r\n\r\n static void put(HashMap<Integer, Integer> cnt, int key) {\r\n if (cnt.containsKey(key)) {\r\n cnt.replace(key, cnt.get(key) + 1);\r\n } else {\r\n cnt.put(key, 1);\r\n }\r\n }\r\n\r\n static long arrSum(ArrayList<Long> arr) {\r\n long tot = 0;\r\n for (int i = 0; i < arr.size(); i++) {\r\n tot += arr.get(i);\r\n }\r\n return tot;\r\n }\r\n\r\n static int ord(char b) {\r\n return (int) b - (int) 'a';\r\n }\r\n\r\n static int optimSearch(int[] cnt, int lower_bound, int pow, int n) {\r\n int l = lower_bound + 1;\r\n int h = n;\r\n int ans = 0;\r\n while (l <= h) {\r\n int mid = l + (h - l) / 2;\r\n if (cnt[mid] - cnt[lower_bound] == pow) {\r\n return mid;\r\n } else if (cnt[mid] - cnt[lower_bound] < pow) {\r\n ans = mid;\r\n l = mid + 1;\r\n } else {\r\n h = mid - 1;\r\n }\r\n }\r\n return ans;\r\n }\r\n\r\n static Pair<Long, Integer> ret_ans(ArrayList<Integer> ans) {\r\n int size = ans.size();\r\n int mini = 1000000000 + 1;\r\n long tit = 0l;\r\n for (int i = 0; i < size; i++) {\r\n tit += 1l * ans.get(i);\r\n mini = Math.min(mini, ans.get(i));\r\n }\r\n return new Pair<>(tit - mini, mini);\r\n }\r\n\r\n static int factorList(\r\n HashMap<Integer, Integer> maps,\r\n int no,\r\n int maxK,\r\n int req\r\n ) {\r\n int i = 1;\r\n while (i * i <= no) {\r\n if (no % i == 0) {\r\n if (i != no / i) {\r\n put(maps, no / i);\r\n }\r\n put(maps, i);\r\n if (maps.get(i) == req) {\r\n maxK = Math.max(maxK, i);\r\n }\r\n if (maps.get(no / i) == req) {\r\n maxK = Math.max(maxK, no / i);\r\n }\r\n }\r\n i++;\r\n }\r\n return maxK;\r\n }\r\n\r\n static ArrayList<Integer> getKeys(HashMap<Integer, Integer> maps) {\r\n ArrayList<Integer> vals = new ArrayList<>();\r\n for (Map.Entry<Integer, Integer> map : maps.entrySet()) {\r\n vals.add(map.getKey());\r\n }\r\n return vals;\r\n }\r\n\r\n static ArrayList<Integer> getValues(HashMap<Integer, Integer> maps) {\r\n ArrayList<Integer> vals = new ArrayList<>();\r\n for (Map.Entry<Integer, Integer> map : maps.entrySet()) {\r\n vals.add(map.getValue());\r\n }\r\n return vals;\r\n }\r\n\r\n static int getMax(ArrayList<Integer> arr) {\r\n int max = arr.get(0);\r\n for (int i = 1; i < arr.size(); i++) {\r\n if (arr.get(i) > max) {\r\n max = arr.get(i);\r\n }\r\n }\r\n return max;\r\n }\r\n\r\n static int getMin(ArrayList<Integer> arr) {\r\n int max = arr.get(0);\r\n for (int i = 1; i < arr.size(); i++) {\r\n if (arr.get(i) < max) {\r\n max = arr.get(i);\r\n }\r\n }\r\n return max;\r\n }\r\n\r\n static int list[][] = { { -1, 0 }, { 0, 1 }, { 1, 0 }, { 0, -1 } };\r\n\r\n /*write your methods and classes here*/\r\n\r\n public static void main(String[] args) throws IOException {\r\n String s = br.readLine();\r\n int n = s.length();\r\n int i;\r\n if (\r\n (s.charAt(0) == '0' || s.charAt(0) == '_' || s.charAt(0) == 'X') &&\r\n s.length() == 1\r\n ) {\r\n bw.write(\"1\\n\");\r\n bw.flush();\r\n } else if (s.length() == 1) {\r\n bw.write(\"0\\n\");\r\n bw.flush();\r\n } else if (s.charAt(0) == '0') {\r\n bw.write(\"0\\n\");\r\n bw.flush();\r\n } else {\r\n String digits[] = { \"25\", \"50\", \"75\", \"00\" };\r\n String arr1[] = { \"__\", \"_X\", \"X_\", \"XX\" };\r\n int way[] = { 4, 4, 4, 1 };\r\n way[1] = s.charAt(0) == 'X' ? 2 : 4;\r\n way[2] = s.charAt(0) == 'X' ? 3 : 4;\r\n way[0] = s.length() == 2 ? 3 : way[0];\r\n way[1] = s.length() == 2 ? 3 : way[1];\r\n int ways = 0;\r\n String v = s.substring(n - 2, n);\r\n for (i = 0; i < 4; i++) {\r\n if (v.equals(digits[i])) {\r\n ways = 1;\r\n }\r\n }\r\n if (v.charAt(0) == '_' || v.charAt(0) == 'X') {\r\n ways = 2;\r\n if (v.charAt(1) == '0' && s.charAt(0) == 'X') {\r\n ways = 1;\r\n }\r\n } else if (v.charAt(1) == '_' || v.charAt(1) == 'X') {\r\n ways = 1;\r\n }\r\n for (i = 0; i < 4; i++) {\r\n if (v.equals(arr1[i])) {\r\n //System.out.println(arr1[i] + \" \" + i + \" \" + way[i]);\r\n ways = way[i];\r\n }\r\n }\r\n //System.out.println(ways);\r\n if (v.equals(\"XX\") && s.charAt(0) == 'X') {\r\n ways = 0;\r\n }\r\n\r\n if (\r\n v.charAt(0) != '2' &&\r\n v.charAt(0) != '5' &&\r\n v.charAt(0) != '7' &&\r\n v.charAt(0) != '0' &&\r\n v.charAt(0) != 'X' &&\r\n v.charAt(0) != '_'\r\n ) {\r\n ways = 0;\r\n }\r\n if (\r\n v.charAt(1) != '0' &&\r\n v.charAt(1) != '5' &&\r\n v.charAt(1) != 'X' &&\r\n v.charAt(1) != '_'\r\n ) {\r\n ways = 0;\r\n }\r\n\r\n boolean ok = false;\r\n long toti = 1l;\r\n for (i = 0; i < s.length() - 2; i++) {\r\n if (s.charAt(i) == 'X') {\r\n ok = true;\r\n }\r\n if (s.charAt(i) == '_') {\r\n if (i == 0) {\r\n toti *= 9l;\r\n } else {\r\n toti *= 10l;\r\n }\r\n }\r\n }\r\n if (v.charAt(0) != 'X' && v.charAt(1) != 'X') {\r\n if (ok) {\r\n if (s.charAt(0) == 'X') {\r\n toti *= 1l * 9;\r\n } else {\r\n toti *= 1l * 10;\r\n }\r\n }\r\n }\r\n //System.out.println(ways);\r\n toti *= 1l * ways;\r\n bw.write(Long.toString(toti) + \"\\n\");\r\n bw.flush();\r\n }\r\n }\r\n}\r\n", "lang_cluster": "Java", "tags": ["brute force", "dp", "dfs and similar"], "code_uid": "150c3eb1b0c4dae54c43b8a7dfd402a6", "src_uid": "4a905f419550a6c839992b40f1617af3", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 17", "source_code": "\r\n\r\nimport java.util.*;\r\nimport java.io.*;\r\n\r\npublic class E {\r\n\r\n public static void main(String[] args) throws IOException {\r\n Scanner sc = new Scanner(System.in);\r\n\r\n String s = sc.next();\r\n int l = s.length();\r\n\r\n if(l < 2){\r\n if(s.equals(\"0\") || s.equals(\"_\") || s.equals(\"X\")){\r\n System.out.println(1);\r\n }\r\n else{\r\n System.out.println(0);\r\n }\r\n System.exit(0);\r\n }\r\n else if(l == 2){\r\n int count = 0;\r\n for(int i=10;i<=95;i+=5){\r\n if(i%25 != 0)\r\n continue;\r\n String str = Integer.toString(i);\r\n\r\n if('0'<=s.charAt(0) && s.charAt(0)<='9'){\r\n if('0'<=s.charAt(1) && s.charAt(1)<='9'){\r\n if(s.equals(str)){\r\n count++;\r\n }\r\n }\r\n else {\r\n if(s.charAt(0)==str.charAt(0))\r\n count++;\r\n }\r\n }\r\n else if(s.charAt(0)=='_'){\r\n if('0'<=s.charAt(1) && s.charAt(1)<='9'){\r\n if(s.charAt(1)==str.charAt(1)){\r\n count++;\r\n }\r\n }\r\n else {\r\n count++;\r\n }\r\n }\r\n else{\r\n if('0'<=s.charAt(1) && s.charAt(1)<='9'){\r\n if(s.charAt(1)==str.charAt(1)){\r\n count++;\r\n }\r\n }\r\n else if(s.charAt(1)=='_'){\r\n count++;\r\n }\r\n }\r\n }\r\n\r\n System.out.println(count);\r\n System.exit(0);\r\n }\r\n else{\r\n int start = (int) (Math.pow(10, l-1));\r\n int end = (int) (Math.pow(10, l));\r\n\r\n int count = 0;\r\n for(int i=start;i<end;i+=25){\r\n String str = Integer.toString(i);\r\n\r\n Set<Character> set = new HashSet<>();\r\n boolean flag = true;\r\n for(int j=0;j<l;j++){\r\n if(s.charAt(j)=='_')\r\n continue;\r\n else if(s.charAt(j)=='X'){\r\n set.add(str.charAt(j));\r\n }\r\n else if(s.charAt(j)!=str.charAt(j)){\r\n flag = false;\r\n break;\r\n }\r\n }\r\n\r\n if(flag && set.size() < 2){\r\n count++;\r\n }\r\n }\r\n\r\n System.out.println(count);\r\n }\r\n\r\n /*int dash = 0, x = 0;\r\n for(int i=0;i<l;i++){\r\n if(s.charAt(i)=='X')\r\n x++;\r\n else if(s.charAt(i)=='_')\r\n dash++;\r\n }\r\n\r\n if((s.charAt(l-2)=='0' && s.charAt(l-1)=='0') || (s.charAt(l-2)=='2' && s.charAt(l-1)=='5') || (s.charAt(l-2)=='5' && s.charAt(l-1)=='0') || (s.charAt(l-2)=='7' && s.charAt(l-1)=='5')){\r\n if(s.charAt(0)=='_'){\r\n int ans = (int) (9 * Math.pow(10, dash - 1));\r\n if(x > 0)\r\n ans *= 10;\r\n\r\n System.out.println(ans);\r\n }\r\n else if(s.charAt(0)=='X'){\r\n int ans = (int) (Math.pow(10, dash));\r\n ans *= 9;\r\n\r\n System.out.println(ans);\r\n }\r\n else{\r\n int ans = (int) Math.pow(10, dash);\r\n if(x > 0)\r\n ans *= 10;\r\n\r\n System.out.println(ans);\r\n }\r\n }\r\n else if(s.charAt(l-2)=='_'){\r\n dash--;\r\n if(s.charAt(l-1)=='0' || s.charAt(l-1)=='5'){\r\n if(s.charAt(0)=='_'){\r\n int ans = (int) (9 * Math.pow(10, dash - 1));\r\n if(x > 0)\r\n ans *= 10;\r\n\r\n ans *= 2;\r\n\r\n System.out.println(ans);\r\n }\r\n else if(s.charAt(0)=='X'){\r\n int ans = (int) (Math.pow(10, dash));\r\n ans *= 9;\r\n\r\n ans *= 2;\r\n\r\n System.out.println(ans);\r\n }\r\n else{\r\n int ans = (int) Math.pow(10, dash);\r\n if(x > 0)\r\n ans *= 10;\r\n\r\n ans *= 2;\r\n\r\n System.out.println(ans);\r\n }\r\n }\r\n else if(s.charAt(l-1)=='_'){\r\n dash--;\r\n if(s.charAt(0)=='_'){\r\n int ans = (int) (9 * Math.pow(10, dash - 1));\r\n if(x > 0)\r\n ans *= 10;\r\n\r\n ans *= 4;\r\n\r\n System.out.println(ans);\r\n }\r\n else if(s.charAt(0)=='X'){\r\n int ans = (int) (Math.pow(10, dash));\r\n ans *= 9;\r\n\r\n ans *= 4;\r\n\r\n System.out.println(ans);\r\n }\r\n else{\r\n int ans = (int) Math.pow(10, dash);\r\n if(x > 0)\r\n ans *= 10;\r\n\r\n ans *= 4;\r\n\r\n System.out.println(ans);\r\n }\r\n }\r\n else if(s.charAt(l-1)=='X'){\r\n if(s.charAt(0)=='_'){\r\n int ans = (int) (9 * Math.pow(10, dash - 1));\r\n ans *= 4;\r\n\r\n System.out.println(ans);\r\n }\r\n else if(s.charAt(0)=='X'){\r\n int ans = (int) (Math.pow(10, dash));\r\n ans *= 4;\r\n\r\n System.out.println(ans);\r\n }\r\n else{\r\n int ans = (int) Math.pow(10, dash);\r\n ans *= 4;\r\n\r\n System.out.println(ans);\r\n }\r\n }\r\n else{\r\n System.out.println();\r\n }\r\n }\r\n else if(s.charAt(l-2)=='X'){\r\n if(s.charAt(l-1)=='0'){\r\n if(s.charAt(0)=='_'){\r\n int ans = (int) (9 * Math.pow(10, dash - 1));\r\n ans *= 2;\r\n\r\n System.out.println(ans);\r\n }\r\n else if(s.charAt(0)=='X'){\r\n int ans = (int) (Math.pow(10, dash));\r\n\r\n System.out.println(ans);\r\n }\r\n else{\r\n int ans = (int) Math.pow(10, dash);\r\n\r\n ans *= 2;\r\n\r\n System.out.println(ans);\r\n }\r\n }\r\n else if(s.charAt(l-1)=='5'){\r\n if(s.charAt(0)=='_'){\r\n int ans = (int) (9 * Math.pow(10, dash - 1));\r\n ans *= 2;\r\n\r\n System.out.println(ans);\r\n }\r\n else if(s.charAt(0)=='X'){\r\n int ans = (int) (Math.pow(10, dash));\r\n ans *= 2;\r\n\r\n System.out.println(ans);\r\n }\r\n else{\r\n int ans = (int) Math.pow(10, dash);\r\n\r\n ans *= 2;\r\n\r\n System.out.println(ans);\r\n }\r\n }\r\n else if(s.charAt(l-1)=='_'){\r\n dash--;\r\n if(s.charAt(0)=='_'){\r\n int ans = (int) (9 * Math.pow(10, dash - 1));\r\n if(x > 0)\r\n ans *= 10;\r\n\r\n ans *= 4;\r\n\r\n System.out.println(ans);\r\n }\r\n else if(s.charAt(0)=='X'){\r\n int ans = (int) (Math.pow(10, dash));\r\n ans *= 9;\r\n\r\n ans *= 4;\r\n\r\n System.out.println(ans);\r\n }\r\n else{\r\n int ans = (int) Math.pow(10, dash);\r\n if(x > 0)\r\n ans *= 10;\r\n\r\n ans *= 4;\r\n\r\n System.out.println(ans);\r\n }\r\n }\r\n else if(s.charAt(l-1)=='X'){\r\n if(s.charAt(0)=='_'){\r\n int ans = (int) (9 * Math.pow(10, dash - 1));\r\n ans *= 4;\r\n\r\n System.out.println(ans);\r\n }\r\n else if(s.charAt(0)=='X'){\r\n int ans = (int) (Math.pow(10, dash));\r\n ans *= 4;\r\n\r\n System.out.println(ans);\r\n }\r\n else{\r\n int ans = (int) Math.pow(10, dash);\r\n ans *= 4;\r\n\r\n System.out.println(ans);\r\n }\r\n }\r\n else{\r\n System.out.println();\r\n }\r\n }\r\n else{\r\n System.out.println(0);\r\n }*/\r\n\r\n sc.close();\r\n }\r\n}\r\n", "lang_cluster": "Java", "tags": ["brute force", "dp", "dfs and similar"], "code_uid": "dd6f71bc939ae486e995d1484c1a3f5c", "src_uid": "4a905f419550a6c839992b40f1617af3", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// OM NAMAH SHIVAY\r\n// Stay strong. Be brave. Always belief.\r\n// NOT WITH MY GIO\r\n\r\nimport java.math.BigInteger;\r\nimport java.util.*;\r\nimport java.io.*;\r\n\r\n\r\n\r\npublic class Vaibhav {\r\n\r\n\r\n static boolean prime[];\r\n\r\n static class Pair implements Comparable<Pair> {\r\n int a;\r\n int b;\r\n\r\n Pair(int a, int b) {\r\n this.a = a;\r\n this.b = b;\r\n }\r\n\r\n\r\n public int compareTo(Pair o) {\r\n\r\n return (int)(this.a - o.a);\r\n //else return this.b - o.b;\r\n }\r\n }\r\n\r\n static long power(long x, long y, long p) {\r\n if (y == 0) return 1;\r\n if (x == 0) return 0;\r\n long res = 1l;\r\n x = x % p;\r\n while (y > 0) {\r\n if (y % 2 == 1) res = (res * x) % p;\r\n y = y >> 1;\r\n x = (x * x) % p;\r\n }\r\n return res;\r\n }\r\n\r\n static void sort(long[] a) {\r\n ArrayList<Long> l = new ArrayList<>();\r\n for (long i : a) l.add(i);\r\n Collections.sort(l);\r\n for (int i = 0; i < a.length; i++) a[i] = l.get(i);\r\n }\r\n\r\n static class FastScanner {\r\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\r\n StringTokenizer st = new StringTokenizer(\"\");\r\n\r\n String next() {\r\n while (!st.hasMoreTokens()) try {\r\n st = new StringTokenizer(br.readLine());\r\n } catch (IOException e) {\r\n e.printStackTrace();\r\n }\r\n return st.nextToken();\r\n }\r\n\r\n int nextInt() {\r\n return Integer.parseInt(next());\r\n }\r\n\r\n double nextDouble() {\r\n return Double.parseDouble(next());\r\n }\r\n\r\n int[] readArray(int n) {\r\n int[] a = new int[n];\r\n for (int i = 0; i < n; i++) a[i] = nextInt();\r\n return a;\r\n }\r\n\r\n long[] readlongArray(int n) {\r\n long[] a = new long[n];\r\n for (int i = 0; i < n; i++) a[i] = nextLong();\r\n return a;\r\n }\r\n\r\n long nextLong() {\r\n return Long.parseLong(next());\r\n }\r\n }\r\n\r\n static void sieveOfEratosthenes(int n) {\r\n prime = new boolean[n + 1];\r\n for (int i = 0; i <= n; i++) prime[i] = true;\r\n for (int p = 2; p * p <= n; p++) {\r\n if (prime[p] == true) {\r\n for (int i = p * p; i <= n; i += p) prime[i] = false;\r\n }\r\n }\r\n }\r\n\r\n public static int log2(int x) {\r\n return (int) (Math.log(x) / Math.log(2));\r\n }\r\n\r\n static long binomialCoeff(long n, long r) {\r\n if (r > n) return 0l;\r\n long m = 1000000007l;\r\n long inv[] = new long[(int) r + 1];\r\n inv[0] = 1;\r\n if (r + 1 >= 2) inv[1] = 1;\r\n for (int i = 2; i <= r; i++) {\r\n inv[i] = m - (m / i) * inv[(int) (m % i)] % m;\r\n }\r\n long ans = 1l;\r\n for (int i = 2; i <= r; i++) {\r\n ans = (int) (((ans % m) * (inv[i] % m)) % m);\r\n }\r\n for (int i = (int) n; i >= (n - r + 1); i--) {\r\n ans = (int) (((ans % m) * (i % m)) % m);\r\n }\r\n return ans;\r\n }\r\n\r\n public static long gcd(long a, long b) {\r\n if (b == 0) {\r\n return a;\r\n }\r\n return gcd(b, a % b);\r\n }\r\n\r\n static long[] facts=new long[3_000_00];\r\n //don't care about your feelings\r\n\r\n static long mul(long a, long b) {\r\n return a*b%mod;\r\n }\r\n\r\n static long add(long a, long b) {\r\n return (a+b)%mod;\r\n }\r\n\r\n /*static void precomp() {\r\n facts[0]=1;\r\n for (int i=1; i<facts.length; i++) facts[i]=mul(facts[i-1], i);\r\n }\r\n\r\n static long exp(long base, long pow) {\r\n if (pow==0) return 1;\r\n long half=exp(base, pow/2);\r\n if (pow%2==0) return mul(half, half);\r\n return mul(half, mul(half, base));\r\n }\r\n\r\n static long modInv(long x) {\r\n return exp(x, mod-2);\r\n }\r\n\r\n static long nCk(int n, int k) {\r\n if(n<k) return 0;\r\n return mul(facts[n], mul(modInv(facts[k]), modInv(facts[n-k])));\r\n }\r\n*/\r\n\r\n static BigInteger bi(String str) {\r\n return new BigInteger(str);\r\n }\r\n\r\n // Author - vaibhav_1710\r\n static FastScanner fs = null;\r\n static long mod = 1_000_000_007;\r\n static int[][] dirs = {{0, -1},\r\n {-1, 0},\r\n {0, 1},\r\n {1, 0},\r\n };\r\n\r\n\r\n static int pk[];\r\n public static void main(String[] args) {\r\n fs = new FastScanner();\r\n PrintWriter out = new PrintWriter(System.out);\r\n int t = 1;\r\n\r\n outer:\r\n while (t-- > 0) {\r\n String s = fs.next();\r\n int len = s.length();\r\n int max = (int)Math.pow(10,len)-1;\r\n int min = (int)Math.pow(10,len-1);\r\n if(min==1)min--;\r\n if(s.charAt(0)=='0' && s.length()>1){\r\n out.println(\"0\");\r\n continue outer;\r\n }\r\n long ans=0;\r\n for(int i=min;i<=max;i++){\r\n if(i%25==0) {\r\n ans += (can(i, s) == true ? 1 : 0);\r\n }\r\n }\r\n out.println(ans);\r\n }\r\n out.close();\r\n }\r\n\r\n\r\n public static boolean can(int v,String s){\r\n String ss = Integer.toString(v);\r\n char king_me = '?';\r\n for(int i=0;i<ss.length();i++){\r\n if(s.charAt(i)!='_' && s.charAt(i)!='X'){\r\n if(s.charAt(i)!=ss.charAt(i)){\r\n return false;\r\n }\r\n }else if(s.charAt(i)=='_') {\r\n continue;\r\n }else if(s.charAt(i)=='X'){\r\n if(king_me!='?' && ss.charAt(i)!=king_me){\r\n return false;\r\n }else if(king_me=='?'){\r\n king_me = ss.charAt(i);\r\n }else{\r\n continue;\r\n }\r\n }\r\n }\r\n return true;\r\n }\r\n\r\n}", "lang_cluster": "Java", "tags": ["brute force", "dp", "dfs and similar"], "code_uid": "6e88418a2109ae04eb3936fb9289f8a1", "src_uid": "4a905f419550a6c839992b40f1617af3", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\r\nimport java.util.*;\r\n\r\npublic class Codeforces\r\n{\r\n public static void main(String args[])throws Exception\r\n {\r\n BufferedReader bu=new BufferedReader(new InputStreamReader(System.in));\r\n StringBuilder sb=new StringBuilder();\r\n\r\n char s[]=bu.readLine().toCharArray();\r\n boolean x=false;\r\n int n=s.length,i;\r\n for(i=0;i<n;i++) x|=s[i]=='X';\r\n\r\n int ans=0;\r\n char s2[]=new char[n];\r\n for(i=0;i<10;i++)\r\n {\r\n int j;\r\n for(j=0;j<n;j++)\r\n if(s[j]=='X') s2[j]=(char)('0'+i);\r\n else s2[j]=s[j];\r\n if(s2[0]=='0') continue; //not possible\r\n\r\n int dp[][]=new int[2][25],cur=1,l,k;\r\n dp[0][0]=1;\r\n for(j=0;j<n;j++)\r\n {\r\n for(k=0;k<25;k++) dp[cur][k]=0;\r\n int lo=0,hi=9,nxt;\r\n if(s2[j]!='_') lo=hi=(s2[j]-'0');\r\n else if(s2[j]=='_' && j==0) lo++;\r\n\r\n for(k=0;k<25;k++)\r\n for(l=lo;l<=hi;l++)\r\n {\r\n nxt=(k*10+l)%25;\r\n dp[cur][nxt]+=dp[cur^1][k];\r\n }\r\n cur^=1;\r\n }\r\n\r\n ans+=dp[cur^1][0];\r\n if(!x) break;\r\n }\r\n\r\n if(n==1 && (s[0]=='_' || s[0]=='X' || s[0]=='0')) ans++;\r\n System.out.println(ans);\r\n }\r\n}", "lang_cluster": "Java", "tags": ["brute force", "dp", "dfs and similar"], "code_uid": "63c4ad2725f1ac5c0cdc554045c5dc85", "src_uid": "4a905f419550a6c839992b40f1617af3", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\r\n\r\nimport java.io.*;\r\nimport java.math.*;\r\n\r\n\r\n/**\r\n * @author Naitik\r\n * \r\n */\r\npublic class Main\r\n\r\n{ \r\n\t static FastReader sc=new FastReader(); \r\n\t static long dp[][][];\r\n\t //static int v[][];\r\n\t static int mod=998244353;;\r\n//\t static int mod=1000000007;\r\n\t static long max;\r\n\t static long bit[];\r\n\t static long bit1[];\r\n//\t static long seg[];\r\n\t //static long fact[];\r\n//\t static long A[];\r\n\t// static TreeMap<Integer,Integer> map;\r\n\t //static StringBuffer sb=new StringBuffer(\"\");\r\n\t static HashMap<Integer,Integer> map;\r\n\t static PrintWriter out=new PrintWriter(System.out);\r\n\t public static void main(String[] args)\r\n{\r\n\t\t \r\n\t\t // StringBuffer sb=new StringBuffer(\"\");\r\n\t\t int ttt=1;\r\n\t\t // ttt =i();\r\n\t outer :while (ttt-- > 0) \r\n\t\t\t{\r\n\t \tchar A[]=s().toCharArray();\r\n\t \tif(A.length==1 && A[0]=='0') {\r\n\t \t\tSystem.out.println(\"1\");\r\n\t \t\treturn;\r\n\t \t}\r\n\t \tif(A[0]=='0') {\r\n\t \t\tSystem.out.println(\"0\");\r\n\t \t\treturn;\r\n\t \t}\r\n\t \tif(A.length==1) {\r\n\t \t\tif(A[0]=='X' || A[0]=='_') {\r\n\t \t\t\tSystem.out.println(\"1\");\r\n\t \t\t\treturn;\r\n\t \t\t}\r\n\t \t}\r\n\t \tdp=new long[A.length+1][25][11];\r\n\t \tfill(dp);\r\n\t \tSystem.out.println(go(A, 0, 0, 10));\r\n\t \t\r\n\t \t\r\n\t }\r\n\t //System.out.println(sb.toString());\r\n\t\t out.close();\r\n\t \r\n\t \r\n\t //CHECK FOR N=1 //CHECK FOR M=0\r\n //CHECK FOR N=1 //CHECK FOR M=0\r\n \t//CHECK FOR N=1\r\n \t\r\n\t\t \r\n\t\t \r\n } \r\n\t static long go(char A[],int i,int pv,int v) {\r\n\t\t if(i==A.length) {\r\n\t\t\t if(pv==0)\r\n\t\t\t\t return 1;\r\n\t\t\t return 0;\r\n\t\t }\r\n\t\t if(dp[i][pv][v]!=-1)\r\n\t\t\t return dp[i][pv][v];\r\n\t\t long ans=0;\r\n\t\t if(A[i]=='_') {\r\n\t\t\t for(int j=0;j<10;j++) {\r\n\t\t\t\t if(i==0 && j==0)\r\n\t\t\t\t\t continue;\r\n\t\t\t\t int y=pv*10+j;\r\n\t\t\t\t y%=25;\r\n\t\t\t\t ans+=go(A, i+1, y, v);\r\n\t\t\t }\r\n\t\t }\r\n\t\t else if(A[i]=='X') {\r\n\t\t\t if(v!=10) {\r\n\t\t\t\t ans+=go(A, i+1, (pv*10+v)%25, v);\r\n\t\t\t }\r\n\t\t\t else {\r\n\t\t\t\t for(int j=0;j<10;j++) {\r\n\t\t\t\t\t if(i==0 && j==0)\r\n\t\t\t\t\t\t continue;\r\n\t\t\t\t\t int y=pv*10+j;\r\n\t\t\t\t\t y%=25;\r\n\t\t\t\t\t ans+=go(A, i+1, y, j);\r\n\t\t\t\t }\r\n\t\t\t }\r\n\t\t }\r\n\t\t else {\r\n\t\t\t ans+=go(A, i+1, (pv*10+A[i]-'0')%25, v);\r\n\t\t }\r\n\t\t return dp[i][pv][v]=ans;\r\n\t }\r\n\t\r\n\t \r\n\t\r\n\t\r\n\t\r\nstatic class Pair implements Comparable<Pair>\r\n {\r\n \t int x;\r\n \t int y;\r\n \t int z;\r\n \t Pair(int x,int y){\r\n \t\t this.x=x;\r\n \t\t this.y=y;\r\n \t\t// this.z=z;\r\n \t\t \r\n \t }\r\n\t\t@Override\r\n\t\tpublic int compareTo(Pair o) {\r\n\t\t\tif(this.x>o.x)\r\n\t\t\t\treturn +1;\r\n\t\t\telse if(this.x<o.x)\r\n\t\t\t\treturn -1;\r\n\t\t\telse {\r\n\t\t\t\tif(this.y>o.y)\r\n\t\t\t\t\treturn 1;\r\n\t\t\t\telse if(this.y<o.y)\r\n\t\t\t\t\treturn -1;\r\n\t\t\t\telse\r\n\t\t\t\t\treturn 0;\r\n\t\t\t}\r\n\t\t}\r\n//\t\tpublic int hashCode() \r\n//\t\t{ \r\n//\t\t\tfinal int temp = 14; \r\n//\t\t\tint ans = 1; \r\n//\t\t\tans =x*31+y*13; \r\n//\t\t\treturn ans; \r\n//\t\t} \r\n//\t\t@Override\r\n//\t\tpublic boolean equals(Object o) \r\n//\t\t{ \r\n//\t\t\tif (this == o) { \r\n//\t\t\t\treturn true; \r\n//\t\t\t} \r\n//\t\t\tif (o == null) { \r\n//\t\t\t\treturn false; \r\n//\t\t\t} \r\n//\t\t\tif (this.getClass() != o.getClass()) { \r\n//\t\t\t\treturn false; \r\n//\t\t\t} \r\n//\t\t\tPair other = (Pair)o; \r\n//\t\t\tif (this.x != other.x || this.y!=other.y) { \r\n//\t\t\t\treturn false; \r\n//\t\t\t} \r\n//\t\t\treturn true; \r\n//\t\t} \t\r\n//\t\t\r\n\t\t/* FOR TREE MAP PAIR USE */\r\n\t\t\r\n//\t\tpublic int compareTo(Pair o) {\r\n// \t\t\tif (x > o.x) {\r\n// \t\t\t\treturn 1;\r\n// \t\t\t}\r\n// \t\t\tif (x < o.x) {\r\n// \t\t\t\treturn -1;\r\n// \t\t\t}\r\n// \t\t\tif (y > o.y) {\r\n// \t\t\t\treturn 1;\r\n// \t\t\t}\r\n// \t\t\tif (y < o.y) {\r\n// \t\t\t\treturn -1;\r\n// \t\t\t}\r\n// \t\t\treturn 0;\r\n// \t\t}\r\n\t\t\r\n }\r\n\r\n//static int find(int A[],int a) {\r\n//\t if(A[a]<0)\r\n//\t\t return a;\r\n//\t return A[a]=find(A, A[a]);\r\n//}\r\nstatic int find(int A[],int a) {\r\n\t if(A[a]==a)\r\n\t\t return a;\r\n\t return A[a]=find(A, A[a]);\r\n}\r\n//FENWICK TREE\r\nstatic void update(int i, int x){\r\n\tfor(; i < bit.length; i += (i&-i))\r\n\t\tbit[i] += x;\r\n}\r\n\r\nstatic int sum(int i){\r\n\tint ans = 0;\r\n\tfor(; i > 0; i -= (i&-i))\r\n\t\tans += bit[i];\r\n\treturn ans;\r\n}\r\nstatic void update1(int i, long x){\r\n\tfor(; i < bit1.length; i += (i&-i))\r\n\t\tbit1[i] += x;\r\n}\r\n\r\nstatic int sum1(int i){\r\n\tint ans = 0;\r\n\tfor(; i > 0; i -= (i&-i))\r\n\t\tans += bit1[i];\r\n\treturn ans;\r\n}\r\n//END\r\nstatic void add(int v) {\r\n\tif(!map.containsKey(v)) {\r\n\t\tmap.put(v, 1);\r\n\t}\r\n\telse {\r\n\t\tmap.put(v, map.get(v)+1);\r\n\t}\r\n}\r\nstatic void remove(int v) {\r\n\tif(map.containsKey(v)) {\r\n\t\tmap.put(v, map.get(v)-1);\r\n\t\tif(map.get(v)==0)\r\n\t\t\tmap.remove(v);\r\n\t}\r\n}\r\npublic static int upper(int A[],int k,int si,int ei)\r\n{\r\n\tint l=si;\r\n\tint u=ei;\r\n\tint ans=-1;\r\n\twhile(l<=u) {\r\n\t\tint mid=(l+u)/2;\r\n\t\tif(A[mid]<=k) {\r\n\t\t\tans=mid;\r\n\t\t\tl=mid+1;\r\n\t\t}\r\n\t\telse {\r\n\t\t\tu=mid-1;\r\n\t\t}\r\n\t}\r\n\treturn ans;\r\n}\r\npublic static int lower(int A[],int k,int si,int ei)\r\n{\r\n\tint l=si;\r\n\tint u=ei;\r\n\tint ans=-1;\r\n\twhile(l<=u) {\r\n\t\tint mid=(l+u)/2;\r\n\t\tif(A[mid]<=k) {\r\n\t\t\tl=mid+1;\r\n\t\t}\r\n\t\telse {\r\n\t\t\tans=mid;\r\n\t\t\tu=mid-1;\r\n\t\t}\r\n\t}\r\n\treturn ans;\r\n\t\r\n \r\n}\r\nstatic int[] copy(int A[]) {\r\n\tint B[]=new int[A.length];\r\n\tfor(int i=0;i<A.length;i++) {\r\n\t\tB[i]=A[i];\r\n\t}\r\n\treturn B;\r\n}\r\nstatic long[] copy(long A[]) {\r\n\tlong B[]=new long[A.length];\r\n\tfor(int i=0;i<A.length;i++) {\r\n\t\tB[i]=A[i];\r\n\t}\r\n\treturn B;\r\n}\r\nstatic int[] input(int n) {\r\n\tint A[]=new int[n];\r\n\t for(int i=0;i<n;i++) {\r\n\t\t A[i]=sc.nextInt();\r\n\t }\r\n\t return A;\r\n }\r\nstatic long[] inputL(int n) {\r\n\tlong A[]=new long[n];\r\n\t for(int i=0;i<n;i++) {\r\n\t\t A[i]=sc.nextLong();\r\n\t }\r\n\t return A;\r\n }\r\nstatic String[] inputS(int n) {\r\n\tString A[]=new String[n];\r\n\t for(int i=0;i<n;i++) {\r\n\t\t A[i]=sc.next();\r\n\t }\r\n\t return A;\r\n }\r\nstatic long sum(int A[]) {\r\n\tlong sum=0;\r\n\tfor(int i : A) {\r\n\t\tsum+=i;\r\n\t}\r\n\treturn sum;\r\n}\r\nstatic long sum(long A[]) {\r\n\tlong sum=0;\r\n\tfor(long i : A) {\r\n\t\tsum+=i;\r\n\t}\r\n\treturn sum;\r\n}\r\nstatic void reverse(long A[]) {\r\n\tint n=A.length;\r\n\tlong B[]=new long[n];\r\n\tfor(int i=0;i<n;i++) {\r\n\t\tB[i]=A[n-i-1];\r\n\t}\r\n\tfor(int i=0;i<n;i++)\r\n\t\tA[i]=B[i];\r\n\t\r\n}\r\nstatic void reverse(int A[]) {\r\n\tint n=A.length;\r\n\tint B[]=new int[n];\r\n\tfor(int i=0;i<n;i++) {\r\n\t\tB[i]=A[n-i-1];\r\n\t}\r\n\tfor(int i=0;i<n;i++)\r\n\t\tA[i]=B[i];\r\n\t\r\n}\r\nstatic void input(int A[],int B[]) {\r\n\t for(int i=0;i<A.length;i++) {\r\n\t\t A[i]=sc.nextInt();\r\n\t\t B[i]=sc.nextInt();\r\n\t }\r\n}\r\nstatic int[][] input(int n,int m){\r\n\tint A[][]=new int[n][m];\r\n\tfor(int i=0;i<n;i++) {\r\n\t\tfor(int j=0;j<m;j++) {\r\n\t\t\tA[i][j]=i();\r\n\t\t}\r\n\t}\r\n\treturn A;\r\n}\r\nstatic char[][] charinput(int n,int m){\r\n\tchar A[][]=new char[n][m];\r\n\tfor(int i=0;i<n;i++) {\r\n\t\tString s=s();\r\n\t\tfor(int j=0;j<m;j++) {\r\n\t\t\tA[i][j]=s.charAt(j);\r\n\t\t}\r\n\t}\r\n\treturn A;\r\n}\r\n\r\nstatic int max(int A[]) {\r\n\tint max=Integer.MIN_VALUE;\r\n\tfor(int i=0;i<A.length;i++) {\r\n\t\tmax=Math.max(max, A[i]);\r\n\t}\r\n\treturn max;\r\n}\r\nstatic int min(int A[]) {\r\n\tint min=Integer.MAX_VALUE;\r\n\tfor(int i=0;i<A.length;i++) {\r\n\t\tmin=Math.min(min, A[i]);\r\n\t}\r\n\treturn min;\r\n}\r\nstatic long max(long A[]) {\r\n\tlong max=Long.MIN_VALUE;\r\n\tfor(int i=0;i<A.length;i++) {\r\n\t\tmax=Math.max(max, A[i]);\r\n\t}\r\n\treturn max;\r\n}\r\nstatic long min(long A[]) {\r\n\tlong min=Long.MAX_VALUE;\r\n\tfor(int i=0;i<A.length;i++) {\r\n\t\tmin=Math.min(min, A[i]);\r\n\t}\r\n\treturn min;\r\n}\r\nstatic long [] prefix(long A[]) {\r\n\tlong p[]=new long[A.length];\r\n\tp[0]=A[0];\r\n\tfor(int i=1;i<A.length;i++)\r\n\t\tp[i]=p[i-1]+A[i];\r\n\treturn p;\r\n}\r\nstatic long [] prefix(int A[]) {\r\n\tlong p[]=new long[A.length];\r\n\tp[0]=A[0];\r\n\tfor(int i=1;i<A.length;i++)\r\n\t\tp[i]=p[i-1]+A[i];\r\n\treturn p;\r\n}\r\nstatic long [] suffix(long A[]) {\r\n\tlong p[]=new long[A.length];\r\n\tp[A.length-1]=A[A.length-1];\r\n\tfor(int i=A.length-2;i>=0;i--)\r\n\t\tp[i]=p[i+1]+A[i];\r\n\treturn p;\r\n}\r\nstatic long [] suffix(int A[]) {\r\n\tlong p[]=new long[A.length];\r\n\tp[A.length-1]=A[A.length-1];\r\n\tfor(int i=A.length-2;i>=0;i--)\r\n\t\tp[i]=p[i+1]+A[i];\r\n\treturn p;\r\n}\r\nstatic void fill(int dp[]) {\r\n\tArrays.fill(dp, -1);\r\n}\r\nstatic void fill(int dp[][]) {\r\n\tfor(int i=0;i<dp.length;i++)\r\n\tArrays.fill(dp[i], -1);\r\n}\r\nstatic void fill(int dp[][][]) {\r\n\tfor(int i=0;i<dp.length;i++) {\r\n\t\tfor(int j=0;j<dp[0].length;j++) {\r\n\t\t\tArrays.fill(dp[i][j],-1);\r\n\t\t}\r\n\t}\r\n}\r\nstatic void fill(int dp[][][][]) {\r\n\tfor(int i=0;i<dp.length;i++) {\r\n\t\tfor(int j=0;j<dp[0].length;j++) {\r\n\t\t\tfor(int k=0;k<dp[0][0].length;k++) {\r\n\t\t\tArrays.fill(dp[i][j][k],-1);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\nstatic void fill(long dp[]) {\r\n\tArrays.fill(dp, -1);\r\n}\r\nstatic void fill(long dp[][]) {\r\n\tfor(int i=0;i<dp.length;i++)\r\n\tArrays.fill(dp[i], -1);\r\n}\r\nstatic void fill(long dp[][][]) {\r\n\tfor(int i=0;i<dp.length;i++) {\r\n\t\tfor(int j=0;j<dp[0].length;j++) {\r\n\t\t\tArrays.fill(dp[i][j],-1);\r\n\t\t}\r\n\t}\r\n}\r\nstatic void fill(long dp[][][][]) {\r\n\tfor(int i=0;i<dp.length;i++) {\r\n\t\tfor(int j=0;j<dp[0].length;j++) {\r\n\t\t\tfor(int k=0;k<dp[0][0].length;k++) {\r\n\t\t\tArrays.fill(dp[i][j][k],-1);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\nstatic int min(int a,int b) {\r\n\treturn Math.min(a, b);\r\n}\r\nstatic int min(int a,int b,int c) {\r\n\treturn Math.min(a, Math.min(b, c));\r\n}\r\nstatic int min(int a,int b,int c,int d) {\r\n\treturn Math.min(a, Math.min(b, Math.min(c, d)));\r\n}\r\nstatic int max(int a,int b) {\r\n\treturn Math.max(a, b);\r\n}\r\nstatic int max(int a,int b,int c) {\r\n\treturn Math.max(a, Math.max(b, c));\r\n}\r\nstatic int max(int a,int b,int c,int d) {\r\n\treturn Math.max(a, Math.max(b, Math.max(c, d)));\r\n}\r\nstatic long min(long a,long b) {\r\n\treturn Math.min(a, b);\r\n}\r\nstatic long min(long a,long b,long c) {\r\n\treturn Math.min(a, Math.min(b, c));\r\n}\r\nstatic long min(long a,long b,long c,long d) {\r\n\treturn Math.min(a, Math.min(b, Math.min(c, d)));\r\n}\r\nstatic long max(long a,long b) {\r\n\treturn Math.max(a, b);\r\n}\r\nstatic long max(long a,long b,long c) {\r\n\treturn Math.max(a, Math.max(b, c));\r\n}\r\nstatic long max(long a,long b,long c,long d) {\r\n\treturn Math.max(a, Math.max(b, Math.max(c, d)));\r\n}\r\n\r\nstatic long power(long x, long y, long p)\r\n{\r\n\r\n\tif(y==0)\r\n\t\treturn 1;\r\n\tif(x==0)\r\n\t\treturn 0;\r\n long res = 1;\r\n x = x % p;\r\n\r\n while (y > 0) {\r\n\r\n if (y % 2 == 1)\r\n res = (res * x) % p;\r\n\r\n y = y >> 1; \r\n x = (x * x) % p;\r\n }\r\n\r\n return res;\r\n}\r\nstatic long power(long x, long y)\r\n{\r\n\r\n\tif(y==0)\r\n\t\treturn 1;\r\n\tif(x==0)\r\n\t\treturn 0;\r\n long res = 1;\r\n\r\n while (y > 0) {\r\n\r\n if (y % 2 == 1)\r\n res = (res * x);\r\n\r\n y = y >> 1; \r\n x = (x * x);\r\n }\r\n\r\n return res;\r\n}\r\nstatic void print(int A[]) {\r\n\tfor(int i : A) {\r\n\t\tSystem.out.print(i+\" \");\r\n\t}\r\n\tSystem.out.println();\r\n}\r\nstatic void print(long A[]) {\r\n\tfor(long i : A) {\r\n\t\tSystem.out.print(i+\" \");\r\n\t}\r\n\tSystem.out.println();\r\n}\r\nstatic long mod(long x) {\r\n\t return ((x%mod + mod)%mod);\r\n}\r\nstatic String reverse(String s) {\r\n\tStringBuffer p=new StringBuffer(s);\r\n\tp.reverse();\r\n\treturn p.toString();\r\n}\r\n\r\n static int i() {\r\n \t return sc.nextInt();\r\n }\r\n static String s() {\r\n \t return sc.next();\r\n }\r\n static long l() {\r\n \t return sc.nextLong();\r\n } \r\n static void sort(int[] A){\r\n int n = A.length;\r\n Random rnd = new Random();\r\n for(int i=0; i<n; ++i){\r\n int tmp = A[i];\r\n int randomPos = i + rnd.nextInt(n-i);\r\n A[i] = A[randomPos];\r\n A[randomPos] = tmp;\r\n }\r\n Arrays.sort(A);\r\n }\r\n static void sort(long[] A){\r\n\t int n = A.length;\r\n\t Random rnd = new Random();\r\n\t for(int i=0; i<n; ++i){\r\n\t long tmp = A[i];\r\n\t int randomPos = i + rnd.nextInt(n-i);\r\n\t A[i] = A[randomPos];\r\n\t A[randomPos] = tmp;\r\n\t }\r\n\t Arrays.sort(A);\r\n\t }\r\n static String sort(String s) {\r\n \t Character ch[]=new Character[s.length()];\r\n \t for(int i=0;i<s.length();i++) {\r\n \t\t ch[i]=s.charAt(i);\r\n \t }\r\n \t Arrays.sort(ch);\r\n \t StringBuffer st=new StringBuffer(\"\");\r\n \t for(int i=0;i<s.length();i++) {\r\n \t\t st.append(ch[i]);\r\n \t }\r\n \t return st.toString();\r\n }\r\n static HashMap<Integer,Integer> hash(int A[]){\r\n\t HashMap<Integer,Integer> map=new HashMap<Integer, Integer>();\r\n\t for(int i : A) {\r\n\t\t if(map.containsKey(i)) {\r\n\t\t\t map.put(i, map.get(i)+1);\r\n\t\t }\r\n\t\t else {\r\n\t\t\t map.put(i, 1);\r\n\t\t }\r\n\t }\r\n\t return map;\r\n }\r\n static TreeMap<Integer,Integer> tree(int A[]){\r\n\t TreeMap<Integer,Integer> map=new TreeMap<Integer, Integer>();\r\n\t for(int i : A) {\r\n\t\t if(map.containsKey(i)) {\r\n\t\t\t map.put(i, map.get(i)+1);\r\n\t\t }\r\n\t\t else {\r\n\t\t\t map.put(i, 1);\r\n\t\t }\r\n\t }\r\n\t return map;\r\n }\r\n static boolean prime(int n) \r\n\t { \r\n\t if (n <= 1) \r\n\t return false; \r\n\t if (n <= 3) \r\n\t return true; \r\n\t if (n % 2 == 0 || n % 3 == 0) \r\n\t return false; \r\n\t double sq=Math.sqrt(n);\r\n\t \r\n\t for (int i = 5; i <= sq; i = i + 6) \r\n\t if (n % i == 0 || n % (i + 2) == 0) \r\n\t return false; \r\n\t return true; \r\n\t } \r\n static boolean prime(long n) \r\n\t { \r\n\t if (n <= 1) \r\n\t return false; \r\n\t if (n <= 3) \r\n\t return true; \r\n\t if (n % 2 == 0 || n % 3 == 0) \r\n\t return false; \r\n\t double sq=Math.sqrt(n);\r\n\t \r\n\t for (int i = 5; i <= sq; i = i + 6) \r\n\t if (n % i == 0 || n % (i + 2) == 0) \r\n\t return false; \r\n\t return true; \r\n\t } \r\n static int gcd(int a, int b) \r\n { \r\n if (a == 0) \r\n return b; \r\n return gcd(b % a, a); \r\n } \r\n static long gcd(long a, long b) \r\n { \r\n if (a == 0) \r\n return b; \r\n return gcd(b % a, a); \r\n } \r\n \r\n \r\n static class FastReader \r\n { \r\n BufferedReader br; \r\n StringTokenizer st; \r\n \r\n public FastReader() \r\n { \r\n br = new BufferedReader(new\r\n InputStreamReader(System.in)); \r\n } \r\n \r\n String next() \r\n { \r\n while (st == null || !st.hasMoreElements()) \r\n { \r\n try\r\n { \r\n st = new StringTokenizer(br.readLine()); \r\n } \r\n catch (IOException e) \r\n { \r\n e.printStackTrace(); \r\n } \r\n } \r\n return st.nextToken(); \r\n } \r\n \r\n int nextInt() \r\n { \r\n return Integer.parseInt(next()); \r\n } \r\n \r\n long nextLong() \r\n { \r\n return Long.parseLong(next()); \r\n } \r\n \r\n double nextDouble() \r\n { \r\n return Double.parseDouble(next()); \r\n } \r\n \r\n String nextLine() \r\n { \r\n String str = \"\"; \r\n try\r\n { \r\n str = br.readLine(); \r\n } \r\n catch (IOException e) \r\n { \r\n e.printStackTrace(); \r\n } \r\n return str; \r\n } \r\n } \r\n} \r\n\r\n\r\n\r\n", "lang_cluster": "Java", "tags": ["brute force", "dp", "dfs and similar"], "code_uid": "24374afbb74f591931f57d190832b0c2", "src_uid": "4a905f419550a6c839992b40f1617af3", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\r\nimport java.io.*;\r\npublic class DivisibleByTwentyFive {\r\n public static void main(String[] args) throws IOException {\r\n Reader in = new Reader();\r\n PrintWriter out = new PrintWriter(System.out);\r\n \r\n String s = in.next();\r\n int end = 1;\r\n for (int i = 0; i < s.length(); i++) {\r\n end *= 10;\r\n }\r\n int res = 0;\r\n for (int i = 0; i < end; i += 25) {\r\n if (match(s, i)) {\r\n res++;\r\n }\r\n }\r\n out.println(res);\r\n \r\n out.close();\r\n }\r\n public static boolean match(String s, int n) {\r\n int x = -1;\r\n for (int i = s.length() - 1; i >= 0; i--) {\r\n int d = n % 10;\r\n if (s.charAt(i) == 'X') {\r\n if (x >= 0 && x != d) {\r\n return false;\r\n }\r\n x = d;\r\n } else if (s.charAt(i) != '_') {\r\n if (s.charAt(i) - '0' != d) {\r\n return false;\r\n }\r\n }\r\n if (s.length() > 1 && i == 0 && d == 0) {\r\n return false;\r\n }\r\n n /= 10;\r\n }\r\n return true;\r\n }\r\n static class Reader {\r\n BufferedReader in;\r\n StringTokenizer st;\r\n public Reader() {\r\n in = new BufferedReader(new InputStreamReader(System.in));\r\n st = new StringTokenizer(\"\");\r\n }\r\n public String nextLine() throws IOException {\r\n st = new StringTokenizer(\"\");\r\n return in.readLine();\r\n }\r\n public String next() throws IOException {\r\n while (!st.hasMoreTokens()) {\r\n st = new StringTokenizer(in.readLine());\r\n }\r\n return st.nextToken();\r\n }\r\n public int nextInt() throws IOException {\r\n return Integer.parseInt(next());\r\n }\r\n public long nextLong() throws IOException {\r\n return Long.parseLong(next());\r\n }\r\n }\r\n public static void sort(int[] arr) {\r\n List<Integer> list = new ArrayList<>();\r\n for (int i : arr) {\r\n list.add(i);\r\n }\r\n Collections.sort(list);\r\n for (int i = 0; i < arr.length; i++) {\r\n arr[i] = list.get(i);\r\n }\r\n }\r\n}", "lang_cluster": "Java", "tags": ["brute force", "dp", "dfs and similar"], "code_uid": "6807aaf2b868539aaed547c028910751", "src_uid": "4a905f419550a6c839992b40f1617af3", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "//package school3;\n\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.BitSet;\nimport java.util.HashSet;\nimport java.util.Scanner;\n\npublic class F5 {\n\tScanner in;\n\tPrintWriter out;\n//\tString INPUT = \"100000 10\";\n\tString INPUT = \"\";\n\t\n\tint[] dec(int n, int m)\n\t{\n\t\tif(n <= m){\n\t\t\treturn new int[]{n, 0};\n\t\t}else if(n <= 2 * m){\n\t\t\treturn new int[]{n - m, n - m};\n\t\t}else{\n\t\t\treturn new int[]{n - 2 * m - 1, m};\n\t\t}\n\t}\n\t\n\tint enc(int x, int y, int m)\n\t{\n\t\tif(y == 0){\n\t\t\treturn x;\n\t\t}else if(x == y){\n\t\t\treturn x + m;\n\t\t}else{\n\t\t\treturn x + 2 * m + 1;\n\t\t}\n\t}\n\t\n\tvoid solve()\n\t{\n\t\tint m = ni();\n\t\tint n = ni();\n\t\tif(n <= Math.sqrt(Math.sqrt(m))){\n\t\t\tsolveH(m, n);\n\t\t}else{\n\t\t\tsolveB(m, n);\n\t\t}\n\t}\n\t\n\tvoid solveB(int m, int n){\n\t\t\t// (a, 0), (a, a), (a, m)\n\t\t\tBitSet visitedo = new BitSet();\n\t\t\tBitSet visitedh = new BitSet();\n\t\t\tBitSet q = new BitSet();\n\t\t\tq.set(0);\n\t\t\tboolean iso = true;\n\t\t\tint step = 0;\n\t\t\t\n\t\t\touter:\n\t\t\twhile(!q.isEmpty()){\n//\t\t\t\ttr(step, q);\n\t\t\t\tBitSet nq = new BitSet();\n\t\t\t\tif(iso){\n\t\t\t\t\tvisitedh.or(q);\n\t\t\t\t}else{\n\t\t\t\t\tvisitedo.or(q);\n\t\t\t\t}\n\t\t\t\tfor(int cur = q.nextSetBit(0);cur != -1;cur = q.nextSetBit(cur+1)){\n\t\t\t\t\tif(!iso && cur == 2 * m)break outer;\n\t\t\t\t\tint[] co = dec(cur, m);\n\t\t\t\t\tif(iso){\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif(co[1] == 0){\n\t\t\t\t\t\t\t\tint inf = co[0] + 1;\n\t\t\t\t\t\t\t\tint sup = Math.min(m, co[0] + n);\n\t\t\t\t\t\t\t\tif(inf <= sup){\n\t\t\t\t\t\t\t\t\tnq.set(enc(inf, 0, m), enc(sup, 0, m) + 1);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tint inf = Math.max(co[0], co[1]);\n\t\t\t\t\t\t\tif(co[0] == co[1])inf++;\n\t\t\t\t\t\t\tint sup = Math.min(m, (n + co[0] + co[1]) / 2);\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tif(inf <= sup){\n\t\t\t\t\t\t\t\tnq.set(enc(inf, inf, m), enc(sup, sup, m) + 1);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tint inf = co[0];\n\t\t\t\t\t\t\tif(co[1] == m)inf++;\n\t\t\t\t\t\t\tint sup = Math.min(m - 1, co[0] + n - m + co[1]);\n\t\t\t\t\t\t\tif(inf <= sup){\n\t\t\t\t\t\t\t\tnq.set(enc(inf, m, m), enc(sup, m, m) + 1);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else{\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif(co[1] == m){\n\t\t\t\t\t\t\t\tint inf = co[0] - 1;\n\t\t\t\t\t\t\t\tint sup = Math.max(0, co[0] - n);\n\t\t\t\t\t\t\t\tif(sup <= inf){\n\t\t\t\t\t\t\t\t\tnq.set(enc(sup, m, m), enc(inf, m, m) + 1);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tint inf = Math.min(co[0], co[1]);\n\t\t\t\t\t\t\tif(co[0] == co[1])inf--;\n\t\t\t\t\t\t\tint sup = Math.max(0, (-n + co[0] + co[1]) / 2);\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tif(sup == 0)sup++;\n\t\t\t\t\t\t\tif(sup <= inf){\n\t\t\t\t\t\t\t\tnq.set(enc(sup, sup, m), enc(inf, inf, m) + 1);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tint inf = co[0];\n\t\t\t\t\t\t\tif(co[1] == 0)inf--;\n\t\t\t\t\t\t\tint sup = Math.max(0, co[0] - n + co[1]);\n\t\t\t\t\t\t\tif(sup <= inf){\n\t\t\t\t\t\t\t\tnq.set(enc(sup, 0, m), enc(inf, 0, m) + 1);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(iso){\n\t\t\t\t\tnq.andNot(visitedo);\n\t\t\t\t}else{\n\t\t\t\t\tnq.andNot(visitedh);\n\t\t\t\t}\n\t\t\t\tq = nq;\n\t\t\t\tstep++;\n\t\t\t\tiso = !iso;\n\t\t\t}\n\t\t\tif(q.isEmpty()){\n\t\t\t\tout.println(-1);\n\t\t\t}else{\n\t\t\t\tout.println(step);\n\t\t\t}\n\t}\n\t\n\tvoid solveH(int m, int n){\n\t\t\n\t\t// (a, 0), (a, a), (a, m)\n\t\tHashSet<Integer> visitedo = new HashSet<Integer>();\n\t\tHashSet<Integer> visitedh = new HashSet<Integer>();\n\t\tHashSet<Integer> q = new HashSet<Integer>();\n\t\tq.add(0);\n\t\tboolean iso = true;\n\t\tint step = 0;\n\t\t\n\t\touter:\n\t\twhile(!q.isEmpty()){\n//\t\t\ttr(step, q);\n\t\t\tHashSet<Integer> nq = new HashSet<Integer>();\n\t\t\tif(iso){\n\t\t\t\tvisitedh.addAll(q);\n\t\t\t}else{\n\t\t\t\tvisitedo.addAll(q);\n\t\t\t}\n\t\t\tfor(int cur : q){\n\t\t\t\tif(!iso && cur == 2 * m)break outer;\n\t\t\t\tint[] co = dec(cur, m);\n\t\t\t\tif(iso){\n\t\t\t\t\t{\n\t\t\t\t\t\tif(co[1] == 0){\n\t\t\t\t\t\t\tint inf = co[0] + 1;\n\t\t\t\t\t\t\tint sup = Math.min(m, co[0] + n);\n\t\t\t\t\t\t\tif(inf <= sup){\n\t\t\t\t\t\t\t\tfor(int i = enc(inf, 0, m);i <= enc(sup, 0, m);i++){\n\t\t\t\t\t\t\t\t\tnq.add(i);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t{\n\t\t\t\t\t\tint inf = Math.max(co[0], co[1]);\n\t\t\t\t\t\tif(co[0] == co[1])inf++;\n\t\t\t\t\t\tint sup = Math.min(m, (n + co[0] + co[1]) / 2);\n\t\t\t\t\t\t\n\t\t\t\t\t\tif(inf <= sup){\n\t\t\t\t\t\t\tfor(int i = enc(inf, inf, m);i <= enc(sup, sup, m);i++){\n\t\t\t\t\t\t\t\tnq.add(i);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t{\n\t\t\t\t\t\tint inf = co[0];\n\t\t\t\t\t\tif(co[1] == m)inf++;\n\t\t\t\t\t\tint sup = Math.min(m - 1, co[0] + n - m + co[1]);\n\t\t\t\t\t\tif(inf <= sup){\n\t\t\t\t\t\t\tfor(int i = enc(inf, m, m);i <= enc(sup, m, m);i++){\n\t\t\t\t\t\t\t\tnq.add(i);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}else{\n\t\t\t\t\t{\n\t\t\t\t\t\tif(co[1] == m){\n\t\t\t\t\t\t\tint inf = co[0] - 1;\n\t\t\t\t\t\t\tint sup = Math.max(0, co[0] - n);\n\t\t\t\t\t\t\tif(sup <= inf){\n\t\t\t\t\t\t\t\tfor(int i = enc(sup, m, m);i <= enc(inf, m, m);i++){\n\t\t\t\t\t\t\t\t\tnq.add(i);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t{\n\t\t\t\t\t\tint inf = Math.min(co[0], co[1]);\n\t\t\t\t\t\tif(co[0] == co[1])inf--;\n\t\t\t\t\t\tint sup = Math.max(0, (-n + co[0] + co[1]) / 2);\n\t\t\t\t\t\t\n\t\t\t\t\t\tif(sup == 0)sup++;\n\t\t\t\t\t\tif(sup <= inf){\n\t\t\t\t\t\t\tfor(int i = enc(sup, sup, m);i <= enc(inf, inf, m);i++){\n\t\t\t\t\t\t\t\tnq.add(i);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t{\n\t\t\t\t\t\tint inf = co[0];\n\t\t\t\t\t\tif(co[1] == 0)inf--;\n\t\t\t\t\t\tint sup = Math.max(0, co[0] - n + co[1]);\n\t\t\t\t\t\tif(sup <= inf){\n\t\t\t\t\t\t\tfor(int i = enc(sup, 0, m);i <= enc(inf, 0, m);i++){\n\t\t\t\t\t\t\t\tnq.add(i);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(iso){\n\t\t\t\tnq.removeAll(visitedo);\n\t\t\t}else{\n\t\t\t\tnq.removeAll(visitedh);\n\t\t\t}\n\t\t\tq = nq;\n\t\t\tstep++;\n\t\t\tiso = !iso;\n\t\t}\n\t\tif(q.isEmpty()){\n\t\t\tout.println(-1);\n\t\t}else{\n\t\t\tout.println(step);\n\t\t}\n\t}\n\t\n\tvoid run() throws Exception\n\t{\n\t\tin = INPUT.isEmpty() ? new Scanner(System.in) : new Scanner(INPUT);\n\t\tout = new PrintWriter(System.out);\n\n//\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n//\t\tlong g = System.currentTimeMillis();\n//\t\tSystem.out.println(g - s + \"ms\");\n\t}\n\t\n\t\n\tpublic static void main(String[] args) throws Exception\n\t{\n\t\tnew F5().run();\n\t}\n\t\n\tint ni() { return Integer.parseInt(in.next()); }\n\tvoid tr(Object... o) { if(INPUT.length() != 0)System.out.println(o.length > 1 || o[0].getClass().isArray() ? Arrays.deepToString(o) : o[0]); }\n}\n", "lang_cluster": "Java", "tags": ["greedy"], "code_uid": "e8daf157664fc01007894b1a1c2a5bb5", "src_uid": "83f1d50a1802e08dd154d4c9778e3d80", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "//package ecr104;\r\nimport java.io.*;\r\nimport java.util.ArrayDeque;\r\nimport java.util.Arrays;\r\nimport java.util.InputMismatchException;\r\nimport java.util.Queue;\r\n\r\npublic class G3 {\r\n\tInputStream is;\r\n\tFastWriter out;\r\n\tString INPUT = \"\";\r\n\r\n\tvoid solve()\r\n\t{\r\n\t\tfinal int mod = 998244353;\r\n\t\tint n = ni();\r\n\t\tint[] a = na(26);\r\n\t\tlong all = 26 * 26 * pow(25, n-2, mod) % mod;\r\n\r\n\t\tlong[][][] dp = new long[3][n+1][n+1];\r\n\t\tdp[0][1][0] = 1;\r\n\t\tdp[1][0][1] = 1;\r\n\t\tdp[2][0][0] = 1;\r\n\t\tfor(int i = 0;i < n-1;i++){\r\n\t\t\tlong[][][] ndp = new long[3][n+1][n+1];\r\n\t\t\tif(i == (n+1)/2-1){\r\n\t\t\t\tfor (int j = 0; j <= n; j++) {\r\n\t\t\t\t\tfor (int k = 0; j+k <= n; k++) {\r\n\t\t\t\t\t\tif (j + 1 <= n) {\r\n\t\t\t\t\t\t\tndp[0][j + 1][k] += dp[0][j][k] + dp[1][j][k] + dp[2][j][k] * 24;\r\n\t\t\t\t\t\t\tndp[0][j + 1][k] %= mod;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tif (k + 1 <= n) {\r\n\t\t\t\t\t\t\tndp[1][j][k + 1] += dp[0][j][k] + dp[1][j][k] + dp[2][j][k] * 24;\r\n\t\t\t\t\t\t\tndp[1][j][k + 1] %= mod;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tndp[2][j][k] += dp[0][j][k] + dp[1][j][k] + dp[2][j][k] * 24;\r\n\t\t\t\t\t\tndp[2][j][k] %= mod;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}else {\r\n\t\t\t\tfor (int j = 0; j <= n; j++) {\r\n\t\t\t\t\tfor (int k = 0; j+k <= n; k++) {\r\n\t\t\t\t\t\tif (j + 1 <= n) {\r\n\t\t\t\t\t\t\tndp[0][j + 1][k] += dp[1][j][k] + dp[2][j][k] * 24;\r\n\t\t\t\t\t\t\tndp[0][j + 1][k] %= mod;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tif (k + 1 <= n) {\r\n\t\t\t\t\t\t\tndp[1][j][k + 1] += dp[0][j][k] + dp[2][j][k] * 24;\r\n\t\t\t\t\t\t\tndp[1][j][k + 1] %= mod;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tndp[2][j][k] += dp[0][j][k] + dp[1][j][k] + dp[2][j][k] * 23;\r\n\t\t\t\t\t\tndp[2][j][k] %= mod;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\r\n\t\t\t}\r\n\t\t\tdp = ndp;\r\n\t\t}\r\n\r\n\t\tlong[] sdp = new long[n+1];\r\n\t\tfor(int i = 0;i <= n;i++){\r\n\t\t\tfor(int j = 0;j <= n;j++){\r\n\t\t\t\tsdp[i] += dp[0][i][j] + dp[1][i][j] + dp[2][i][j] * 24;\r\n\t\t\t}\r\n\t\t\tsdp[i] %= mod;\r\n\t\t}\r\n\r\n\t\tfor(int i = 0;i < 26;i++){\r\n\t\t\tfor(int k = a[i]+1;k <= n;k++){\r\n\t\t\t\tall -= sdp[k];\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tfor(int i = 0;i < 26;i++){\r\n\t\t\tfor(int j = i+1;j < 26;j++){\r\n\t\t\t\tfor(int k = a[i]+1;k <= n;k++){\r\n\t\t\t\t\tfor(int l = a[j]+1;l+k <= n;l++){\r\n\t\t\t\t\t\tall += (dp[0][k][l] + dp[1][k][l] + dp[2][k][l] * 24);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\tall %= mod;\r\n\t\t\t}\r\n\t\t}\r\n\t\tall %= mod;\r\n\r\n\t\tif(all < 0)all += mod;\r\n\t\tout.println(all);\r\n\t}\r\n\r\n\tpublic static long pow(long a, long n, long mod) {\r\n\t\t//\t\ta %= mod;\r\n\t\tlong ret = 1;\r\n\t\tint x = 63 - Long.numberOfLeadingZeros(n);\r\n\t\tfor (; x >= 0; x--) {\r\n\t\t\tret = ret * ret % mod;\r\n\t\t\tif (n << 63 - x < 0) ret = ret * a % mod;\r\n\t\t}\r\n\t\treturn ret;\r\n\t}\r\n\r\n\r\n\tpublic static long invl(long a, long mod) {\r\n\t\tlong b = mod;\r\n\t\tlong p = 1, q = 0;\r\n\t\twhile (b > 0) {\r\n\t\t\tlong c = a / b;\r\n\t\t\tlong d;\r\n\t\t\td = a;\r\n\t\t\ta = b;\r\n\t\t\tb = d % b;\r\n\t\t\td = p;\r\n\t\t\tp = q;\r\n\t\t\tq = d - c * q;\r\n\t\t}\r\n\t\treturn p < 0 ? p + mod : p;\r\n\t}\r\n\r\n\r\n\tpublic static long C(int n, int r, int mod, int[][] fif) {\r\n\t\tif (n < 0 || r < 0 || r > n) return 0;\r\n\t\treturn (long) fif[0][n] * fif[1][r] % mod * fif[1][n - r] % mod;\r\n\t}\r\n\r\n\r\n\tpublic static int[][] enumFIF(int n, int mod) {\r\n\t\tint[] f = new int[n + 1];\r\n\t\tint[] invf = new int[n + 1];\r\n\t\tf[0] = 1;\r\n\t\tfor (int i = 1; i <= n; i++) {\r\n\t\t\tf[i] = (int) ((long) f[i - 1] * i % mod);\r\n\t\t}\r\n\t\tlong a = f[n];\r\n\t\tlong b = mod;\r\n\t\tlong p = 1, q = 0;\r\n\t\twhile (b > 0) {\r\n\t\t\tlong c = a / b;\r\n\t\t\tlong d;\r\n\t\t\td = a;\r\n\t\t\ta = b;\r\n\t\t\tb = d % b;\r\n\t\t\td = p;\r\n\t\t\tp = q;\r\n\t\t\tq = d - c * q;\r\n\t\t}\r\n\t\tinvf[n] = (int) (p < 0 ? p + mod : p);\r\n\t\tfor (int i = n - 1; i >= 0; i--) {\r\n\t\t\tinvf[i] = (int) ((long) invf[i + 1] * (i + 1) % mod);\r\n\t\t}\r\n\t\treturn new int[][]{f, invf};\r\n\t}\r\n\r\n\r\n\tvoid run() throws Exception\r\n\t{\r\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\r\n\t\tout = new FastWriter(System.out);\r\n\t\t\r\n\t\tlong s = System.currentTimeMillis();\r\n\t\tsolve();\r\n\t\tout.flush();\r\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\r\n\t}\r\n\t\r\n\tpublic static void main(String[] args) throws Exception { new G3().run(); }\r\n\t\r\n\tprivate byte[] inbuf = new byte[1024];\r\n\tpublic int lenbuf = 0, ptrbuf = 0;\r\n\t\r\n\tprivate int readByte()\r\n\t{\r\n\t\tif(lenbuf == -1)throw new InputMismatchException();\r\n\t\tif(ptrbuf >= lenbuf){\r\n\t\t\tptrbuf = 0;\r\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\r\n\t\t\tif(lenbuf <= 0)return -1;\r\n\t\t}\r\n\t\treturn inbuf[ptrbuf++];\r\n\t}\r\n\t\r\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\r\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\r\n\t\r\n\tprivate double nd() { return Double.parseDouble(ns()); }\r\n\tprivate char nc() { return (char)skip(); }\r\n\t\r\n\tprivate String ns()\r\n\t{\r\n\t\tint b = skip();\r\n\t\tStringBuilder sb = new StringBuilder();\r\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\r\n\t\t\tsb.appendCodePoint(b);\r\n\t\t\tb = readByte();\r\n\t\t}\r\n\t\treturn sb.toString();\r\n\t}\r\n\t\r\n\tprivate char[] ns(int n)\r\n\t{\r\n\t\tchar[] buf = new char[n];\r\n\t\tint b = skip(), p = 0;\r\n\t\twhile(p < n && !(isSpaceChar(b))){\r\n\t\t\tbuf[p++] = (char)b;\r\n\t\t\tb = readByte();\r\n\t\t}\r\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\r\n\t}\r\n\r\n\tprivate int[] na(int n)\r\n\t{\r\n\t\tint[] a = new int[n];\r\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\r\n\t\treturn a;\r\n\t}\r\n\r\n\tprivate long[] nal(int n)\r\n\t{\r\n\t\tlong[] a = new long[n];\r\n\t\tfor(int i = 0;i < n;i++)a[i] = nl();\r\n\t\treturn a;\r\n\t}\r\n\r\n\tprivate char[][] nm(int n, int m) {\r\n\t\tchar[][] map = new char[n][];\r\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\r\n\t\treturn map;\r\n\t}\r\n\r\n\tprivate int[][] nmi(int n, int m) {\r\n\t\tint[][] map = new int[n][];\r\n\t\tfor(int i = 0;i < n;i++)map[i] = na(m);\r\n\t\treturn map;\r\n\t}\r\n\r\n\tprivate int ni() { return (int)nl(); }\r\n\r\n\tprivate long nl()\r\n\t{\r\n\t\tlong num = 0;\r\n\t\tint b;\r\n\t\tboolean minus = false;\r\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\r\n\t\tif(b == '-'){\r\n\t\t\tminus = true;\r\n\t\t\tb = readByte();\r\n\t\t}\r\n\r\n\t\twhile(true){\r\n\t\t\tif(b >= '0' && b <= '9'){\r\n\t\t\t\tnum = num * 10 + (b - '0');\r\n\t\t\t}else{\r\n\t\t\t\treturn minus ? -num : num;\r\n\t\t\t}\r\n\t\t\tb = readByte();\r\n\t\t}\r\n\t}\r\n\r\n\tpublic static class FastWriter\r\n\t{\r\n\t\tprivate static final int BUF_SIZE = 1<<13;\r\n\t\tprivate final byte[] buf = new byte[BUF_SIZE];\r\n\t\tprivate final OutputStream out;\r\n\t\tprivate int ptr = 0;\r\n\r\n\t\tprivate FastWriter(){out = null;}\r\n\r\n\t\tpublic FastWriter(OutputStream os)\r\n\t\t{\r\n\t\t\tthis.out = os;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter(String path)\r\n\t\t{\r\n\t\t\ttry {\r\n\t\t\t\tthis.out = new FileOutputStream(path);\r\n\t\t\t} catch (FileNotFoundException e) {\r\n\t\t\t\tthrow new RuntimeException(\"FastWriter\");\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(byte b)\r\n\t\t{\r\n\t\t\tbuf[ptr++] = b;\r\n\t\t\tif(ptr == BUF_SIZE)innerflush();\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(char c)\r\n\t\t{\r\n\t\t\treturn write((byte)c);\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(char[] s)\r\n\t\t{\r\n\t\t\tfor(char c : s){\r\n\t\t\t\tbuf[ptr++] = (byte)c;\r\n\t\t\t\tif(ptr == BUF_SIZE)innerflush();\r\n\t\t\t}\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(String s)\r\n\t\t{\r\n\t\t\ts.chars().forEach(c -> {\r\n\t\t\t\tbuf[ptr++] = (byte)c;\r\n\t\t\t\tif(ptr == BUF_SIZE)innerflush();\r\n\t\t\t});\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tprivate static int countDigits(int l) {\r\n\t\t\tif (l >= 1000000000) return 10;\r\n\t\t\tif (l >= 100000000) return 9;\r\n\t\t\tif (l >= 10000000) return 8;\r\n\t\t\tif (l >= 1000000) return 7;\r\n\t\t\tif (l >= 100000) return 6;\r\n\t\t\tif (l >= 10000) return 5;\r\n\t\t\tif (l >= 1000) return 4;\r\n\t\t\tif (l >= 100) return 3;\r\n\t\t\tif (l >= 10) return 2;\r\n\t\t\treturn 1;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(int x)\r\n\t\t{\r\n\t\t\tif(x == Integer.MIN_VALUE){\r\n\t\t\t\treturn write((long)x);\r\n\t\t\t}\r\n\t\t\tif(ptr + 12 >= BUF_SIZE)innerflush();\r\n\t\t\tif(x < 0){\r\n\t\t\t\twrite((byte)'-');\r\n\t\t\t\tx = -x;\r\n\t\t\t}\r\n\t\t\tint d = countDigits(x);\r\n\t\t\tfor(int i = ptr + d - 1;i >= ptr;i--){\r\n\t\t\t\tbuf[i] = (byte)('0'+x%10);\r\n\t\t\t\tx /= 10;\r\n\t\t\t}\r\n\t\t\tptr += d;\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tprivate static int countDigits(long l) {\r\n\t\t\tif (l >= 1000000000000000000L) return 19;\r\n\t\t\tif (l >= 100000000000000000L) return 18;\r\n\t\t\tif (l >= 10000000000000000L) return 17;\r\n\t\t\tif (l >= 1000000000000000L) return 16;\r\n\t\t\tif (l >= 100000000000000L) return 15;\r\n\t\t\tif (l >= 10000000000000L) return 14;\r\n\t\t\tif (l >= 1000000000000L) return 13;\r\n\t\t\tif (l >= 100000000000L) return 12;\r\n\t\t\tif (l >= 10000000000L) return 11;\r\n\t\t\tif (l >= 1000000000L) return 10;\r\n\t\t\tif (l >= 100000000L) return 9;\r\n\t\t\tif (l >= 10000000L) return 8;\r\n\t\t\tif (l >= 1000000L) return 7;\r\n\t\t\tif (l >= 100000L) return 6;\r\n\t\t\tif (l >= 10000L) return 5;\r\n\t\t\tif (l >= 1000L) return 4;\r\n\t\t\tif (l >= 100L) return 3;\r\n\t\t\tif (l >= 10L) return 2;\r\n\t\t\treturn 1;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(long x)\r\n\t\t{\r\n\t\t\tif(x == Long.MIN_VALUE){\r\n\t\t\t\treturn write(\"\" + x);\r\n\t\t\t}\r\n\t\t\tif(ptr + 21 >= BUF_SIZE)innerflush();\r\n\t\t\tif(x < 0){\r\n\t\t\t\twrite((byte)'-');\r\n\t\t\t\tx = -x;\r\n\t\t\t}\r\n\t\t\tint d = countDigits(x);\r\n\t\t\tfor(int i = ptr + d - 1;i >= ptr;i--){\r\n\t\t\t\tbuf[i] = (byte)('0'+x%10);\r\n\t\t\t\tx /= 10;\r\n\t\t\t}\r\n\t\t\tptr += d;\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(double x, int precision)\r\n\t\t{\r\n\t\t\tif(x < 0){\r\n\t\t\t\twrite('-');\r\n\t\t\t\tx = -x;\r\n\t\t\t}\r\n\t\t\tx += Math.pow(10, -precision)/2;\r\n\t\t\t//\t\tif(x < 0){ x = 0; }\r\n\t\t\twrite((long)x).write(\".\");\r\n\t\t\tx -= (long)x;\r\n\t\t\tfor(int i = 0;i < precision;i++){\r\n\t\t\t\tx *= 10;\r\n\t\t\t\twrite((char)('0'+(int)x));\r\n\t\t\t\tx -= (int)x;\r\n\t\t\t}\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(char c){\r\n\t\t\treturn write(c).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(int x){\r\n\t\t\treturn write(x).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(long x){\r\n\t\t\treturn write(x).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(double x, int precision){\r\n\t\t\treturn write(x, precision).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(int... xs)\r\n\t\t{\r\n\t\t\tboolean first = true;\r\n\t\t\tfor(int x : xs) {\r\n\t\t\t\tif (!first) write(' ');\r\n\t\t\t\tfirst = false;\r\n\t\t\t\twrite(x);\r\n\t\t\t}\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(long... xs)\r\n\t\t{\r\n\t\t\tboolean first = true;\r\n\t\t\tfor(long x : xs) {\r\n\t\t\t\tif (!first) write(' ');\r\n\t\t\t\tfirst = false;\r\n\t\t\t\twrite(x);\r\n\t\t\t}\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln()\r\n\t\t{\r\n\t\t\treturn write((byte)'\\n');\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(int... xs)\r\n\t\t{\r\n\t\t\treturn write(xs).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(long... xs)\r\n\t\t{\r\n\t\t\treturn write(xs).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(char[] line)\r\n\t\t{\r\n\t\t\treturn write(line).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(char[]... map)\r\n\t\t{\r\n\t\t\tfor(char[] line : map)write(line).writeln();\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(String s)\r\n\t\t{\r\n\t\t\treturn write(s).writeln();\r\n\t\t}\r\n\r\n\t\tprivate void innerflush()\r\n\t\t{\r\n\t\t\ttry {\r\n\t\t\t\tout.write(buf, 0, ptr);\r\n\t\t\t\tptr = 0;\r\n\t\t\t} catch (IOException e) {\r\n\t\t\t\tthrow new RuntimeException(\"innerflush\");\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tpublic void flush()\r\n\t\t{\r\n\t\t\tinnerflush();\r\n\t\t\ttry {\r\n\t\t\t\tout.flush();\r\n\t\t\t} catch (IOException e) {\r\n\t\t\t\tthrow new RuntimeException(\"flush\");\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tpublic FastWriter print(byte b) { return write(b); }\r\n\t\tpublic FastWriter print(char c) { return write(c); }\r\n\t\tpublic FastWriter print(char[] s) { return write(s); }\r\n\t\tpublic FastWriter print(String s) { return write(s); }\r\n\t\tpublic FastWriter print(int x) { return write(x); }\r\n\t\tpublic FastWriter print(long x) { return write(x); }\r\n\t\tpublic FastWriter print(double x, int precision) { return write(x, precision); }\r\n\t\tpublic FastWriter println(char c){ return writeln(c); }\r\n\t\tpublic FastWriter println(int x){ return writeln(x); }\r\n\t\tpublic FastWriter println(long x){ return writeln(x); }\r\n\t\tpublic FastWriter println(double x, int precision){ return writeln(x, precision); }\r\n\t\tpublic FastWriter print(int... xs) { return write(xs); }\r\n\t\tpublic FastWriter print(long... xs) { return write(xs); }\r\n\t\tpublic FastWriter println(int... xs) { return writeln(xs); }\r\n\t\tpublic FastWriter println(long... xs) { return writeln(xs); }\r\n\t\tpublic FastWriter println(char[] line) { return writeln(line); }\r\n\t\tpublic FastWriter println(char[]... map) { return writeln(map); }\r\n\t\tpublic FastWriter println(String s) { return writeln(s); }\r\n\t\tpublic FastWriter println() { return writeln(); }\r\n\t}\r\n\r\n\tpublic void trnz(int... o)\r\n\t{\r\n\t\tfor(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+\":\"+o[i]+\" \");\r\n\t\tSystem.out.println();\r\n\t}\r\n\r\n\t// print ids which are 1\r\n\tpublic void trt(long... o)\r\n\t{\r\n\t\tQueue<Integer> stands = new ArrayDeque<>();\r\n\t\tfor(int i = 0;i < o.length;i++){\r\n\t\t\tfor(long x = o[i];x != 0;x &= x-1)stands.add(i<<6|Long.numberOfTrailingZeros(x));\r\n\t\t}\r\n\t\tSystem.out.println(stands);\r\n\t}\r\n\r\n\tpublic void tf(boolean... r)\r\n\t{\r\n\t\tfor(boolean x : r)System.out.print(x?'#':'.');\r\n\t\tSystem.out.println();\r\n\t}\r\n\r\n\tpublic void tf(boolean[]... b)\r\n\t{\r\n\t\tfor(boolean[] r : b) {\r\n\t\t\tfor(boolean x : r)System.out.print(x?'#':'.');\r\n\t\t\tSystem.out.println();\r\n\t\t}\r\n\t\tSystem.out.println();\r\n\t}\r\n\r\n\tpublic void tf(long[]... b)\r\n\t{\r\n\t\tif(INPUT.length() != 0) {\r\n\t\t\tfor (long[] r : b) {\r\n\t\t\t\tfor (long x : r) {\r\n\t\t\t\t\tfor (int i = 0; i < 64; i++) {\r\n\t\t\t\t\t\tSystem.out.print(x << ~i < 0 ? '#' : '.');\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\tSystem.out.println();\r\n\t\t\t}\r\n\t\t\tSystem.out.println();\r\n\t\t}\r\n\t}\r\n\r\n\tpublic void tf(long... b)\r\n\t{\r\n\t\tif(INPUT.length() != 0) {\r\n\t\t\tfor (long x : b) {\r\n\t\t\t\tfor (int i = 0; i < 64; i++) {\r\n\t\t\t\t\tSystem.out.print(x << ~i < 0 ? '#' : '.');\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tSystem.out.println();\r\n\t\t}\r\n\t}\r\n\r\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\r\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\r\n}\r\n", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics", "fft"], "code_uid": "e6433bc2734c59bd3ccb1cc60a940b60", "src_uid": "1f012349f4b229dc98faadf1ca732355", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class DTask {\n\n public static void main(String[] args) throws IOException {\n MyInputReader in = new MyInputReader(System.in);\n long a1 = in.nextInt();\n long b1 = in.nextInt();\n long a2 = in.nextInt();\n long b2 = in.nextInt();\n int l = in.nextInt();\n int r = in.nextInt();\n MutableLong xm = new MutableLong(0);\n MutableLong ym = new MutableLong(1);\n long a = a1;\n long b = -a2;\n long c = b2 - b1;\n long g = gcd(Math.abs(a), Math.abs(b), xm, ym);\n if (c % g != 0) {\n System.out.println(\"0\");\n return;\n }\n if (a1 == 0 && a2 == 0) {\n if (b1 != b2) {\n fail();\n }\n if (b1 == b2 && b1 < l && b2 > r) {\n fail();\n }\n System.out.println(1);\n return;\n }\n long msa = a > 0 ? 1 : -1;\n long msb = b > 0 ? 1 : -1;\n long x = (long) ((c / g) * msa * xm.v);\n long y = (long) ((c / g) * msb * ym.v);\n long minx;\n long maxx;\n if (a1 == 0) {\n minx = Integer.MIN_VALUE;\n maxx = Integer.MAX_VALUE;\n } else {\n minx = (l - b1) / a1;\n maxx = (r - b1) / a1;\n }\n long miny;\n long maxy;\n if (a2 == 0) {\n miny = Integer.MIN_VALUE;\n maxy = Integer.MAX_VALUE;\n } else {\n miny = (l - b2) / a2;\n maxy = (r - b2) / a2;\n }\n minx = Math.max(minx, 0);\n miny = Math.max(miny, 0);\n long ad = b / g;\n long bd = a / g;\n Pair p1 = bounds(x, ad, minx, maxx);\n Pair p2 = bounds(y, -bd, miny, maxy);\n long m1 = Math.max(p1.min, p2.min);\n long m2 = Math.min(p2.max, p1.max);\n if (m1 > m2) {\n fail();\n }\n long vars = Math.abs(m2 - m1) + 1;\n\n long pos = m2;\n long l1 = x + pos * (b / g);\n long ans = a1 * l1 + b1;\n\n long posy = m1;\n long k1 = y - posy * (a / g);\n long ansy = a2 * k1 + b2;\n\n if (ans < l || ans > r) {\n vars -= 1;\n }\n if (ansy < l || ansy > r) {\n vars -= 1;\n }\n /*System.out.println(ans);\n System.out.println(ansy);*/\n System.out.println(Math.max(vars, 0));\n }\n\n\n static Pair bounds(long init, long step, long min, long max) {\n long src = step;\n long lo = -1;\n long hi = -1;\n step = Math.abs(step);\n if (init == min) {\n lo = min;\n } else if (init < min) {\n long mult = (min - init) / step;\n lo = init + mult * step;\n if (lo < min) {\n lo += step;\n }\n } else {\n long mult = (init - min) / step;\n lo = init - mult * step;\n if (lo < min) {\n lo += step;\n }\n }\n if (lo > max) {\n fail();\n }\n lo = (lo - init) / src;\n if (init == max) {\n hi = init;\n } else if (init > max) {\n long mult = (init - max) / step;\n hi = init - mult * step;\n if (hi > max) {\n hi -= step;\n }\n } else {\n long mult = (max - init) / step;\n hi = init + mult * step;\n if (hi > max) {\n hi -= step;\n }\n }\n if (hi < min) {\n fail();\n }\n hi = (hi - init) / src;\n if (hi < lo) {\n long tmp = hi;\n hi = lo;\n lo = tmp;\n }\n return new Pair(lo, hi);\n }\n\n static void fail() {\n System.out.println(\"0\");\n System.exit(0);\n }\n\n static long gcd(long a, long b, MutableLong x, MutableLong y) {\n if (a == 0) {\n x.v = 0;\n y.v = 1;\n return b;\n }\n long g = gcd(b % a, a, x, y);\n long x1 = x.v;\n long y1 = y.v;\n x.v = y1 - (b / a) * x1;\n y.v = x1;\n return g;\n }\n\n static class Pair {\n\n long min;\n long max;\n\n public Pair(long min, long max) {\n this.min = min;\n this.max = max;\n }\n }\n\n static class MutableLong {\n\n long v;\n\n public MutableLong(long v) {\n this.v = v;\n }\n\n }\n\n static class MyInputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public MyInputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n }\n\n}", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "ec33f23d8e5e81cb3d2e4d6aad50d37a", "src_uid": "b08ee0cd6f5cb574086fa02f07d457a4", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class cf877a {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc =new Scanner(System.in);\n\t\t\n\t\tString n = sc.nextLine();\n\t\t\n\t\tString[] arr = {\"Danil\",\"Olya\",\"Slava\",\"Ann\",\"Nikita\"};\n\t\t\n\t\tint have= 0;\n\t\t\n\t\tfor (String s : arr) {\n\t\t\tint prev =0;\n\t\t\twhile (n.indexOf(s, prev) != -1) {\n\t\t\t\thave++;\n\t\t\t\tprev = n.indexOf(s, prev)+1;\n\t\t\t\tif (prev == -1) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(have == 1 ? \"YES\" : \"NO\");\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["strings", "implementation"], "code_uid": "c90faca428008434e339a18b89a4f9be", "src_uid": "db2dc7500ff4d84dcc1a37aebd2b3710", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.PrintWriter;\nimport java.util.Scanner;\n \npublic class Divisibilityby25 {\n \n\tvoid solve(Scanner in, PrintWriter out) {\n\t\tString s = in.next();\n\t\tint l = s.length();\n\t\tint min = Integer.MAX_VALUE;\n \n\t\tfor (int i = 0; i < l; i++) {\n \n\t\t\tfor (int j = 0; j < l; j++) {\n\t\t\t\tint m = 0;\n\t\t\t\tchar[] a = s.toCharArray();\n \n\t\t\t\tif (i == j)\n\t\t\t\t\tcontinue;\n \n\t\t\t\tfor (int k = i; k < l - 1; k++) {\n\t\t\t\t\tchar c = a[k];\n\t\t\t\t\ta[k] = a[k + 1];\n\t\t\t\t\ta[k + 1] = c;\n\t\t\t\t\tm++;\n\t\t\t\t}\n \n\t\t\t\tfor (int k = j - ((j > i) ? 1 : 0); k < l - 2; k++) {\n\t\t\t\t\tchar c = a[k];\n\t\t\t\t\ta[k] = a[k + 1];\n\t\t\t\t\ta[k + 1] = c;\n\t\t\t\t\tm++;\n\t\t\t\t}\n \n\t\t\t\tint pos = -1;\n \n\t\t\t\tfor (int k = 0; k < l - 2; k++) {\n \n\t\t\t\t\tif (a[k] != '0') {\n\t\t\t\t\t\tpos = k;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n \n\t\t\t\tfor (int k = pos; k > 0; k--) {\n \n\t\t\t\t\tchar c = a[k - 1];\n\t\t\t\t\ta[k - 1] = a[k];\n\t\t\t\t\ta[k] = c;\n\t\t\t\t\tm++;\n\t\t\t\t}\n\t\t\t\tlong n = Long.parseLong(new String(a));\n\t\t\t\tif (n % 25 == 0) {\n\t\t\t\t\tmin = Math.min(m, min);\n \n\t\t\t\t}\n \n\t\t\t}\n \n\t\t}\n \n\t\tif (min == Integer.MAX_VALUE)\n\t\t\tout.println(-1);\n\t\telse\n\t\t\tout.println(min);\n \n\t}\n \n\tvoid run() {\n\t\ttry (Scanner in = new Scanner(System.in); PrintWriter out = new PrintWriter(System.out);) {\n\t\t\tsolve(in, out);\n\t\t}\n\t}\n \n\tpublic static void main(String args[]) {\n\t\tnew Divisibilityby25().run();\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "greedy"], "code_uid": "474e0bec2250ecec038a4f508798628b", "src_uid": "ea1c737956f88be94107f2565ca8bbfd", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\npublic class Main{\n\n\n\t//static int p=1000000007;\n\t\n\tstatic long pr = 998244353;\n\t\n\tstatic BigInteger p = new BigInteger(998244353+\"\");\n\t\n\tstatic void err() {\n\t\tSystem.out.println(-1);\n\t}\n\t\n\tpublic static void main (String args[])throws IOException{\n\t\tScanner sc = new Scanner();\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\t\n\t\tint t = 1;\n\t\t//t = sc.nextInt();\n\t\t\n\t\twhile(t-->0) {\n\t\t\t\n\t\t\tlong n=sc.nextInt(), m=sc.nextInt(), l=sc.nextInt(), r=sc.nextInt(), k=r-l, even=k/2+1, odd=(k+1)/2;\n\t\t\t\n\t\t\tif((n*m)%2==1) {\n\t\t\t\tout.print(new BigInteger(k+1+\"\").modPow(new BigInteger(n*m+\"\"), p));\n\t\t\t}else {\n\t\t\t\t\n\t\t\t\tBigInteger temp1 = new BigInteger(even+odd+\"\").modPow(new BigInteger(n*m+\"\"), p);\n\t\t\t\tBigInteger temp2 = new BigInteger(even-odd+\"\").modPow(new BigInteger(n*m+\"\"), p);\n\t\t\t\t\n\t\t\t\tout.println(((Long.parseLong(temp1.toString())+Long.parseLong(temp2.toString()))*(pr+1)/2)%pr);\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tout.flush();\n\t}\n\t\n\tpublic static String reverseString(String str){ \n\t StringBuilder sb=new StringBuilder(str); \n\t sb.reverse(); \n\t return sb.toString(); \n\t}\n\t\n\tstatic boolean isPalindrome(String str) \n { \n int i = 0, j = str.length() - 1; \n \n while (i < j) { \n \n if (str.charAt(i) != str.charAt(j)) \n return false; \n \n \n i++; \n j--; \n } \n return true;\n }\n\t\n\t\n\tstatic void print(int[] arr) {\n\t\tfor(int i=0; i<arr.length; i++)\n\t\t\tSystem.out.print(arr[i]+\" \");\n\t\tSystem.out.println();\n\t}\n\t\n\tpublic static int abs(int x) {return ((x > 0) ? x : -x);}\n\tpublic static long abs(long x) {return ((x > 0) ? x : -x);}\n\t\n\tpublic static int max(int a, int b) {return Math.max(a, b);}\n\tpublic static long max(long a, long b) {return Math.max(a, b);}\n\t\n\tpublic static int min(int a, int b) {return Math.min(a, b);}\n\tpublic static long min(long a, long b) {return Math.min(a, b);}\n\t\n\t\n\t static int gcd(int a, int b) \n\t { \n\t if (a == 0) \n\t return b; \n\t return gcd(b % a, a); \n\t } \n\t\n\t\n static int modInverse(int a, int m) \n { \n int g = gcd(a, m); \n if (g != 1) \n return -1;\n else \n \treturn power(a, m - 2, m); \n \n } \n \n // To compute x^y under modulo m \n static int power(int x, int y, int m) \n { \n if (y == 0) \n return 1; \n \n int p = power(x, y / 2, m) % m; \n p = (p * p) % m; \n \n if (y % 2 == 0) \n return p; \n else\n return (x * p) % m; \n } \n\t\n\t\n static int[] primeGenerator(int num) {\n \tint length=0, arr[]=new int[num], a=num, factor=1;\n \tif(num%2==0) {\n \t\twhile(num%2==0) {\n \t\t\tnum/=2;\n \t\t\tfactor*=2;\n \t\t}\n \t\tarr[length++]=factor;\n \t}\n \tfor(int i=3; i*i<=a; i++) {\n \t\tfactor=1;\n \t\tif(num%i==0) {\n \t\twhile(num%i==0) {\n \t\t\tnum/=i;\n \t\t\tfactor*=i;\n \t\t}\n \t\tarr[length++]=factor;\n \t\t}\n \t}\n \tif(num>1)\n \t\tarr[length++]=num;\n \treturn Arrays.copyOfRange(arr, 0, length);\n }\n \n \n\n\n static boolean isPrime(int n) \n { \n // Corner cases \n if (n <= 1) \n return false; \n if (n <= 3) \n return true; \n \n // This is checked so that we can skip \n // middle five numbers in below loop \n if (n % 2 == 0 || n % 3 == 0) \n return false; \n \n for (int i = 5; i * i <= n; i = i + 6) \n if (n % i == 0 || n % (i + 2) == 0) \n return false; \n \n return true; \n }\n\n\n\n\n\tstatic class Scanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tScanner() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tScanner(String fileName) throws FileNotFoundException {\n\t\t\tbr = new BufferedReader(new FileReader(fileName));\n\t\t}\n\n\t\tString next() throws IOException {\n\t\t\twhile (st == null || !st.hasMoreTokens())\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tString nextLine() throws IOException {\n\t\t\treturn br.readLine();\n\t\t}\n\n\t\tint nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tlong nextLong() throws NumberFormatException, IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tdouble nextDouble() throws NumberFormatException, IOException {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tboolean ready() throws IOException {\n\t\t\treturn br.ready();\n\t\t}\n\n\t}\n\n\tstatic void sort(int[] a) {\n\t\tshuffle(a);\n\t\tArrays.sort(a);\n\t}\n\n\tstatic void shuffle(int[] a) {\n\t\tint n = a.length;\n\t\tRandom rand = new Random();\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint tmpIdx = rand.nextInt(n);\n\t\t\tint tmp = a[i];\n\t\t\ta[i] = a[tmpIdx];\n\t\t\ta[tmpIdx] = tmp;\n\t\t}\n\t}\n}\n\nclass Pair{\n\tint x;\n\tint y;\n\tPair(int a, int b){\n\t\tx=a;\n\t\ty=b;\n\t}\n\t\n\tvoid print() {\n\t\tSystem.out.println(this.x+\" \"+this.y);\n\t}\n}\n\n", "lang_cluster": "Java", "tags": ["math", "matrices", "constructive algorithms", "combinatorics"], "code_uid": "77577dede926e81215aa39dfa1a59815", "src_uid": "ded299fa1cd010822c60f2389a3ba1a3", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.util.*;\npublic class Main{\n\tstatic int mod=998244353;\n\tstatic long fastpow(long n,long ti) {\n\t\t if (ti == 0) \n\t\t return 1l;\n\t\tif(ti%2==0) {\n\t\t\tlong y=fastpow(n, ti/2);\n\t\t\tlong k=y*y;\n\t\t\tk%=mod;\n\t\t\treturn k;\n\t\t}\n\t\telse {\n\t\t\tlong y=fastpow(n, ti/2);\n\t\t\tlong k=((n*y)%mod)*y;\n\t\t\tk%=mod;\n\t\t\treturn k;\n\t\t}\n\t}\n\tstatic long modInv(long x) {\n\t\treturn fastpow(x, mod-2);\n\t}\n\tpublic static void main(String[] args) throws Exception{\n\t\tMScanner sc=new MScanner(System.in);\n\t\tPrintWriter pw=new PrintWriter(System.out);\n\t\tlong n=sc.nextInt(),m=sc.nextInt(),l=sc.nextInt(),r=sc.nextInt();\n\t\tif(l==r) {\n\t\t\tpw.println(1);\n\t\t\tpw.flush();\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tlong odds=((r+1)/2)-(l/2),evens=(r/2)-((l-1)/2);\n\t\t\n\t\tlong ans;\n\t\t\n\t\tif((n*m)%2==1) {\n\t\t\tans=fastpow(odds+evens, (n*m));\n\t\t}\n\t\telse {\n\t\t\tans=(fastpow(odds+evens, (n*m))+fastpow(odds-evens, (n*m)))%mod;\n\t\t\tans=(ans*modInv(2))%mod;\t\t\t\n\t\t}\n\t\tpw.println(ans);\n\t\t\n\t\t\n\t\tpw.flush();\n\t}\n\tstatic class MScanner {\n\t\tStringTokenizer st;\n\t\tBufferedReader br;\n\t\tpublic MScanner(InputStream system) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(system));\n\t\t}\n \n\t\tpublic MScanner(String file) throws Exception {\n\t\t\tbr = new BufferedReader(new FileReader(file));\n\t\t}\n \n\t\tpublic String next() throws IOException {\n\t\t\twhile (st == null || !st.hasMoreTokens())\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\t\tpublic int[] intArr(int n) throws IOException {\n\t int[]in=new int[n];for(int i=0;i<n;i++)in[i]=nextInt();\n\t return in;\n\t\t}\n\t\tpublic long[] longArr(int n) throws IOException {\n\t long[]in=new long[n];for(int i=0;i<n;i++)in[i]=nextLong();\n\t return in;\n\t\t}\n\t\tpublic int[] intSortedArr(int n) throws IOException {\n\t int[]in=new int[n];for(int i=0;i<n;i++)in[i]=nextInt();\n\t shuffle(in);\n\t Arrays.sort(in);\n\t return in;\n\t\t}\n\t\tpublic long[] longSortedArr(int n) throws IOException {\n\t long[]in=new long[n];for(int i=0;i<n;i++)in[i]=nextLong();\n\t shuffle(in);\n\t Arrays.sort(in);\n\t return in;\n\t\t}\n\t\tstatic void shuffle(int[]in) {\n\t\t\tfor(int i=0;i<in.length;i++) {\n\t\t\t\tint idx=(int)(Math.random()*in.length);\n\t\t\t\tint tmp=in[i];\n\t\t\t\tin[i]=in[idx];\n\t\t\t\tin[idx]=tmp;\n\t\t\t}\n\t\t}\n\t\tstatic void shuffle(long[]in) {\n\t\t\tfor(int i=0;i<in.length;i++) {\n\t\t\t\tint idx=(int)(Math.random()*in.length);\n\t\t\t\tlong tmp=in[i];\n\t\t\t\tin[i]=in[idx];\n\t\t\t\tin[idx]=tmp;\n\t\t\t}\n\t\t}\n\t\tpublic Integer[] IntegerArr(int n) throws IOException {\n\t Integer[]in=new Integer[n];for(int i=0;i<n;i++)in[i]=nextInt();\n\t return in;\n\t\t}\n\t\tpublic Long[] LongArr(int n) throws IOException {\n\t Long[]in=new Long[n];for(int i=0;i<n;i++)in[i]=nextLong();\n\t return in;\n\t\t}\n\t\tpublic String nextLine() throws IOException {\n\t\t\treturn br.readLine();\n\t\t}\n \n\t\tpublic int nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n \n\t\tpublic double nextDouble() throws IOException {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n \n\t\tpublic char nextChar() throws IOException {\n\t\t\treturn next().charAt(0);\n\t\t}\n \n\t\tpublic long nextLong() throws IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n \n\t\tpublic boolean ready() throws IOException {\n\t\t\treturn br.ready();\n\t\t}\n \n\t\tpublic void waitForInput() throws InterruptedException {\n\t\t\tThread.sleep(3000);\n\t\t}\n\t}\n\tstatic void addX(int[]in,int x) {\n\t\tfor(int i=0;i<in.length;i++)in[i]+=x;\n\t}\n\tstatic void addX(long[]in,int x) {\n\t\tfor(int i=0;i<in.length;i++)in[i]+=x;\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "matrices", "constructive algorithms", "combinatorics"], "code_uid": "b5e6f9ce449dfebc1e6e2f1bcbc72ee8", "src_uid": "ded299fa1cd010822c60f2389a3ba1a3", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.BufferedOutputStream;\nimport java.io.Closeable;\nimport java.io.DataInputStream;\nimport java.io.Flushable;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.util.InputMismatchException;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n\tstatic class TaskAdapter implements Runnable {\n\t\t@Override\n\t\tpublic void run() {\n\t\t\tlong startTime = System.currentTimeMillis();\n\t\t\tInputStream inputStream = System.in;\n\t\t\tOutputStream outputStream = System.out;\n\t\t\tFastReader in = new FastReader(inputStream);\n\t\t\tOutput out = new Output(outputStream);\n\t\t\tEHeightAllTheSame solver = new EHeightAllTheSame();\n\t\t\tsolver.solve(1, in, out);\n\t\t\tout.close();\n\t\t\tSystem.err.println(System.currentTimeMillis()-startTime+\"ms\");\n\t\t}\n\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tThread thread = new Thread(null, new TaskAdapter(), \"\", 1<<28);\n\t\tthread.start();\n\t\tthread.join();\n\t}\n\n\tstatic class EHeightAllTheSame {\n\t\tprivate final int mod = 998244353;\n\n\t\tpublic EHeightAllTheSame() {\n\t\t}\n\n\t\tpublic void solve(int kase, InputReader in, Output pw) {\n\t\t\tlong nn = in.nextInt(), nm = in.nextInt(), l = in.nextInt(), r = in.nextInt();\n\t\t\tlong n = nn*nm;\n\t\t\tif((n&1)==1) {\n\t\t\t\tpw.println(Utilities.math.pow(r-l+1, n, mod));\n\t\t\t}else {\n\t\t\t\tlong x = Utilities.math.pow(r-l+1, n, mod);\n\t\t\t\tif(((r-l+1)&1)==1) {\n\t\t\t\t\tx++;\n\t\t\t\t}\n\t\t\t\tpw.println((x*499122177L)%mod);\n\t\t\t}\n\t\t}\n\n\t}\n\n\tstatic interface InputReader {\n\t\tint nextInt();\n\n\t}\n\n\tstatic class Output implements Closeable, Flushable {\n\t\tpublic StringBuilder sb;\n\t\tpublic OutputStream os;\n\t\tpublic int BUFFER_SIZE;\n\t\tpublic boolean autoFlush;\n\t\tpublic String lineSeparator;\n\n\t\tpublic Output(OutputStream os) {\n\t\t\tthis(os, 1<<16);\n\t\t}\n\n\t\tpublic Output(OutputStream os, int bs) {\n\t\t\tBUFFER_SIZE = bs;\n\t\t\tsb = new StringBuilder(BUFFER_SIZE);\n\t\t\tthis.os = new BufferedOutputStream(os, 1<<17);\n\t\t\tautoFlush = false;\n\t\t\tlineSeparator = System.lineSeparator();\n\t\t}\n\n\t\tpublic void println(long l) {\n\t\t\tprintln(String.valueOf(l));\n\t\t}\n\n\t\tpublic void println(String s) {\n\t\t\tsb.append(s);\n\t\t\tprintln();\n\t\t\tif(autoFlush) {\n\t\t\t\tflush();\n\t\t\t}else if(sb.length()>BUFFER_SIZE >> 1) {\n\t\t\t\tflushToBuffer();\n\t\t\t}\n\t\t}\n\n\t\tpublic void println() {\n\t\t\tsb.append(lineSeparator);\n\t\t}\n\n\t\tprivate void flushToBuffer() {\n\t\t\ttry {\n\t\t\t\tos.write(sb.toString().getBytes());\n\t\t\t}catch(IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tsb = new StringBuilder(BUFFER_SIZE);\n\t\t}\n\n\t\tpublic void flush() {\n\t\t\ttry {\n\t\t\t\tflushToBuffer();\n\t\t\t\tos.flush();\n\t\t\t}catch(IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\n\t\tpublic void close() {\n\t\t\tflush();\n\t\t\ttry {\n\t\t\t\tos.close();\n\t\t\t}catch(IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\n\t}\n\n\tstatic class FastReader implements InputReader {\n\t\tfinal private int BUFFER_SIZE = 1<<16;\n\t\tprivate DataInputStream din;\n\t\tprivate byte[] buffer;\n\t\tprivate int bufferPointer;\n\t\tprivate int bytesRead;\n\n\t\tpublic FastReader(InputStream is) {\n\t\t\tdin = new DataInputStream(is);\n\t\t\tbuffer = new byte[BUFFER_SIZE];\n\t\t\tbufferPointer = bytesRead = 0;\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\tint ret = 0;\n\t\t\tbyte c = skipToDigit();\n\t\t\tboolean neg = (c=='-');\n\t\t\tif(neg) {\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tdo {\n\t\t\t\tret = ret*10+c-'0';\n\t\t\t} while((c = read())>='0'&&c<='9');\n\t\t\tif(neg) {\n\t\t\t\treturn -ret;\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tprivate boolean isDigit(byte b) {\n\t\t\treturn b>='0'&&b<='9';\n\t\t}\n\n\t\tprivate byte skipToDigit() {\n\t\t\tbyte ret;\n\t\t\twhile(!isDigit(ret = read())&&ret!='-') ;\n\t\t\treturn ret;\n\t\t}\n\n\t\tprivate void fillBuffer() {\n\t\t\ttry {\n\t\t\t\tbytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n\t\t\t}catch(IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif(bytesRead==-1) {\n\t\t\t\tbuffer[0] = -1;\n\t\t\t}\n\t\t}\n\n\t\tprivate byte read() {\n\t\t\tif(bytesRead==-1) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}else if(bufferPointer==bytesRead) {\n\t\t\t\tfillBuffer();\n\t\t\t}\n\t\t\treturn buffer[bufferPointer++];\n\t\t}\n\n\t}\n\n\tstatic class Utilities {\n\t\tpublic static class math {\n\t\t\tpublic static long pow(long base, long exp, long mod) {\n\t\t\t\tlong ans = 1, cur = base;\n\t\t\t\twhile(exp>0) {\n\t\t\t\t\tif((exp&1)>0) {\n\t\t\t\t\t\tans = (ans*cur)%mod;\n\t\t\t\t\t}\n\t\t\t\t\tcur = (cur*cur)%mod;\n\t\t\t\t\texp >>= 1;\n\t\t\t\t}\n\t\t\t\treturn ans;\n\t\t\t}\n\n\t\t}\n\n\t}\n}\n\n", "lang_cluster": "Java", "tags": ["math", "matrices", "constructive algorithms", "combinatorics"], "code_uid": "a999284999fab8ec03817d4ebb8b723d", "src_uid": "ded299fa1cd010822c60f2389a3ba1a3", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Ribhav\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastReader in = new FastReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n EHeightAllTheSame solver = new EHeightAllTheSame();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class EHeightAllTheSame {\n public void solve(int testNumber, FastReader s, PrintWriter out) {\n long n = s.nextLong(), m = s.nextLong(), k = n * m;\n long l = s.nextLong(), r = s.nextLong(), len = r - l + 1;\n long mod = 998244353;\n\n if (k % 2 == 1) {\n out.println(EHeightAllTheSame.Maths.power(len, n * m, mod));\n return;\n }\n\n long ans = (EHeightAllTheSame.Maths.power(len, k, mod) + EHeightAllTheSame.Maths.power(len % 2, k, mod)) * EHeightAllTheSame.Maths.power(2, mod - 2, mod) % mod;\n out.println(ans);\n }\n\n private static class Maths {\n static long power(long x, long y, long p) {\n long res = 1;\n x = x % p;\n\n while (y > 0) {\n if ((y & 1) == 1)\n res = (res * x) % p;\n y = y >> 1;\n x = (x * x) % p;\n }\n return res;\n }\n\n }\n\n }\n\n static class FastReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private FastReader.SpaceCharFilter filter;\n\n public FastReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public long nextLong() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "matrices", "constructive algorithms", "combinatorics"], "code_uid": "332a14dcfcfc3185302cfb4df0be450e", "src_uid": "ded299fa1cd010822c60f2389a3ba1a3", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedWriter;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStreamWriter;\n\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.PriorityQueue;\nimport java.util.Map.Entry;\n\n\nimport java.util.Random;\nimport java.util.TreeSet;\n\npublic final class CF_630_D2_E\n{\n\n\n\tstatic boolean verb=true;\n\tstatic void log(Object X){if (verb) System.err.println(X);}\n\tstatic void log(Object[] X){if (verb) {for (Object U:X) System.err.print(U+\" \");System.err.println(\"\");}}\n\tstatic void log(int[] X){if (verb) {for (int U:X) System.err.print(U+\" \");System.err.println(\"\");}}\n\tstatic void log(int[] X,int L){if (verb) {for (int i=0;i<L;i++) System.err.print(X[i]+\" \");System.err.println(\"\");}}\n\tstatic void log(long[] X){if (verb) {for (long U:X) System.err.print(U+\" \");System.err.println(\"\");}}\n\n\tstatic void logWln(Object X){if (verb) System.err.print(X);}\n\tstatic void info(Object o){\tSystem.out.println(o);}\n\tstatic void output(Object o){outputWln(\"\"+o+\"\\n\");\t}\n\tstatic void outputFlush(Object o){try {out.write(\"\"+ o+\"\\n\");out.flush();} catch (Exception e) {}}\n\tstatic void outputWln(Object o){try {out.write(\"\"+ o);} catch (Exception e) {}}\n\n\n\n\t// Global vars\n\tstatic BufferedWriter out;\n\tstatic InputReader reader;\n\n\n\tstatic void test() {\n\t\tlog(\"testing\");\n\n\t\tRandom r=new Random();\n\t\tint NTESTS=100000;\n\t\tint NMAX=100;\n\t\tfor (int t=0;t<NTESTS;t++) {\n\n\t\t}\n\n\t\tlog(\"done\");\n\n\t}\n\n\tstatic int st;\n\n\n\n\n\n\n\n\n\n\n\tstatic class Composite implements Comparable<Composite>{\n\n\t\tlong v;\n\t\tint idx;\n\t\tlong x;\n\t\tlong d;\n\n\t\tpublic int compareTo(Composite X) {\n\t\t\tif (v<X.v)\n\t\t\t\treturn -1;\n\t\t\tif (v>X.v)\n\t\t\t\treturn 1;\n\t\t\treturn idx-X.idx;\n\t\t}\n\n\t\tpublic Composite(long v, int idx, long x, long d) {\n\t\t\tthis.v = v;\n\t\t\tthis.idx = idx;\n\t\t\tthis.x = x;\n\t\t\tthis.d = d;\n\t\t}\n\n\n\n\n\t}\n\n\tstatic long powerMod(long b,long e,long m){\n\t\tlong x=1;\n\t\twhile (e>0) {\n\t\t\tif (e%2==1)\n\t\t\t\tx=(b*x)%m;\n\t\t\tb=(b*b)%m;\n\t\t\te=e/2;\n\t\t}\n\t\treturn x; \n\t}\n\n\n\tstatic void process() throws Exception {\n\n\t\n\t\tout = new BufferedWriter(new OutputStreamWriter(System.out));\n\t\treader = new InputReader(System.in);\n\n\t\tlong n=reader.readInt();\n\t\tlong m=reader.readInt();\n\t\tint L=reader.readInt();\n\t\tint R=reader.readInt();\n\t\t\n\t\tlong mod=998244353;\n\t\tlong inv2=powerMod(2,mod-2,mod);\n\t\t\n\t\tlong ans=0;\n\t\tlong nm=n*m;\n\t\t\n\t\t// solution\n\t\t// case 1: if at least one set is even, we can achieve\n\t\t// case 2! problem is if both set are odd size. In this case it does not work...\n\t\t// if n*m is odd, we are always case 1\n\t\t// if n*m is even, depends..\n\t\t\n\n\t\tlong diff=R-L+1;\n\t\tlong p1=diff/2;\n\t\tlong p2=diff-p1;\n\t\tif (nm%2==1) {\n\t\t\t// whatever the distribution it will work\n\t\t\tans=powerMod(diff,nm,mod);\n\t\t\t\n\t\t\t\n\t\t} else {\n\t\t\t// A+B = nm\n\t\t\t// A even, B good\n\t\t\t// A in 2,4...nm, \n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\tlong pp1=diff;\n\t\t\tlong pp2=Math.abs(p1-p2);\n\t\t\t\n\t\t\tlong opt1=powerMod(pp1,nm,mod);\n\t\t\tlong opt2=powerMod(pp2,nm,mod);\n\t\t\tlong opt=opt1+opt2;\n\t\t\topt%=mod;\n\t\t\topt*=inv2;\n\t\t\topt%=mod;\n\t\t\tans=opt;\n\t\t\t\n\t\t\t\n\t\t}\n\t\toutput(ans);\n\t\t\n\t\n\t\ttry {\n\t\t\tout.close();\n\t\t} catch (Exception Ex) {\n\t\t}\n\n\t}\n\n\n\n\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tprocess();\n\n\t}\n\n\tstatic final class InputReader {\n\t\tprivate final InputStream stream;\n\t\tprivate final byte[] buf = new byte[1024];\n\t\tprivate int curChar;\n\t\tprivate int numChars;\n\n\t\tpublic InputReader(InputStream stream) {\n\t\t\tthis.stream = stream;\n\t\t}\n\n\t\tprivate int read() throws IOException {\n\t\t\tif (curChar >= numChars) {\n\t\t\t\tcurChar = 0;\n\t\t\t\tnumChars = stream.read(buf);\n\t\t\t\tif (numChars <= 0) {\n\t\t\t\t\treturn -1;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn buf[curChar++];\n\t\t}\n\n\t\tpublic final String readString() throws IOException {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c)) {\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo {\n\t\t\t\tres.append((char) c);\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tpublic final String readString(int L) throws IOException {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c)) {\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tStringBuilder res = new StringBuilder(L);\n\t\t\tdo {\n\t\t\t\tres.append((char) c);\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tpublic final int readInt() throws IOException {\n\t\t\tint c = read();\n\t\t\tboolean neg = false;\n\t\t\twhile (isSpaceChar(c)) {\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tchar d = (char) c;\n\t\t\t// log(\"d:\"+d);\n\t\t\tif (d == '-') {\n\t\t\t\tneg = true;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo {\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\t// log(\"res:\"+res);\n\t\t\tif (neg)\n\t\t\t\treturn -res;\n\t\t\treturn res;\n\n\t\t}\n\n\t\tpublic final long readLong() throws IOException {\n\t\t\tint c = read();\n\t\t\tboolean neg = false;\n\t\t\twhile (isSpaceChar(c)) {\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tchar d = (char) c;\n\t\t\t// log(\"d:\"+d);\n\t\t\tif (d == '-') {\n\t\t\t\tneg = true;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo {\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\t// log(\"res:\"+res);\n\t\t\tif (neg)\n\t\t\t\treturn -res;\n\t\t\treturn res;\n\n\t\t}\n\n\t\tprivate boolean isSpaceChar(int c) {\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n\t}\n\n}\n/*\n\n5\n1 4 5 2 3\n\n */", "lang_cluster": "Java", "tags": ["math", "matrices", "constructive algorithms", "combinatorics"], "code_uid": "3923228f64f8d772a03f9eb68c012f54", "src_uid": "ded299fa1cd010822c60f2389a3ba1a3", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\n/**\n * Created by Katushka on 11.03.2020.\n */\npublic class B {\n static int[] readArray(int size, InputReader in) {\n int[] a = new int[size];\n for (int i = 0; i < size; i++) {\n a[i] = in.nextInt();\n }\n return a;\n }\n\n static long[] readLongArray(int size, InputReader in) {\n long[] a = new long[size];\n for (int i = 0; i < size; i++) {\n a[i] = in.nextLong();\n }\n return a;\n }\n\n final static long MOD = 998244353;\n\n private static long fastPow(long x, long y) {\n if (x == 1) {\n return 1;\n }\n if (y == 0) {\n return 1;\n }\n long p = fastPow(x, y / 2) % MOD;\n p = p * p % MOD;\n if (y % 2 == 1) {\n p = p * x % MOD;\n }\n return p;\n }\n\n private static long obrat2() {\n return fastPow(2, MOD - 2);\n }\n\n\n public static void main(String[] args) throws FileNotFoundException {\n InputReader in = new InputReader(System.in);\n PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));\n\n long n = in.nextInt();\n long m = in.nextInt();\n long l = in.nextInt();\n long r = in.nextInt();\n if (n % 2 != 0 && m % 2 != 0) {\n out.println(fastPow((r - l + 1), n * m));\n } else {\n long res1 = fastPow((r - l + 1), n * m - 1);\n long res;\n if ((r - l + 1) % 2 == 0) {\n res = res1 * ((r - l + 1) / 2) % MOD;\n } else {\n res = (res1 * ((r - l + 2) / 2) % MOD + MOD - (res1 + MOD - 1) % MOD * obrat2() % MOD) % MOD;\n }\n out.println(res);\n }\n\n\n out.close();\n }\n\n\n private static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public String nextString() {\n try {\n return reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public char nextChar() {\n return next().charAt(0);\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "matrices", "constructive algorithms", "combinatorics"], "code_uid": "516f5499d1d36721eaf65e6843c8fd15", "src_uid": "ded299fa1cd010822c60f2389a3ba1a3", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class ProblemE {\n\t\n\tpublic static long M = 998244353;\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\t\n\t\tScanner s = new Scanner(System.in);\n\t\tlong m = s.nextLong();\n\t\tlong n = s.nextLong();\n\t\t\n\t\tlong l = s.nextLong();\n\t\tlong r = s.nextLong();\n\t\t\n\t\tlong T = m * n;\n\t\tlong num = r - l + 1;\n\t\t\n\t\tlong a = exp(num, T);\n\t\t//System.out.println(a);\n\t\tif(T%2 == 1) {\n\t\t\tSystem.out.println(a);\n\t\t}\n\t\t\n\t\telse {\n\t\t\tif(num % 2 == 0)\n\t\t\t\tSystem.out.println((a * exp(2, M-2))%M);\n\t\t\telse\n\t\t\t\tSystem.out.println(((a + 1)%M * exp(2, M-2))%M);\n\t\t\t\n\t\t}\n\n\t}\n\t\n\tpublic static long exp(long a, long b) {\n\t\tlong m = M;\n\t\tif(b == 0)\n\t\t\treturn 1;\n\t\telse if(b == 1)\n\t\t\treturn a;\n\t\telse if(a == 1)\n\t\t\treturn 1;\n\t\telse if(b%2 == 0)\n\t\t\treturn exp((a*a)%m, b/2);\n\t\telse\n\t\t\treturn (exp((a*a)%m, b/2) * a)%m;\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["math", "matrices", "constructive algorithms", "combinatorics"], "code_uid": "e6964e7282fead040aa1c87329eaf5a8", "src_uid": "ded299fa1cd010822c60f2389a3ba1a3", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class e{\n\n\tstatic long mod = 998244353;\n\n\tpublic static void main(String[] args){\n\t\tJS scan = new JS();\n\t\tlong n = scan.nextLong();\n\t\tlong m = scan.nextLong();\n\t\tlong L = scan.nextLong();\n\t\tlong R = scan.nextLong();\n\t\tlong h = R-L;\n\t\t\n\t\tlong e = 0;\n\t\tlong o = 0;\n\t\tif(h % 2 == 1){\n\t\t\tlong d = (h+1)/2;\n\t\t\te = d;\n\t\t\to = d;\n\t\t}\n\t\telse{\n\t\t\tlong d = h/2;\n\t\t\te = d;\n\t\t\to = d;\n\t\t\tif(L % 2 == 1) o++;\n\t\t\telse e++;\n\t\t}\n\n\t\tlong[][] mat = {{e, o},{o, e}};\n\t\tlong[][] pphard = pow(mat, m*n);\n\t\tlong ans = pphard[0][0];\n\t\tif((n*m)%2==1) ans += pphard[0][1];\n\t\tSystem.out.println(ans%mod);\n\t}\n\n\tstatic long[][] pow(long[][] a, long pow){\n\t\tif(pow == 0) return iden(a.length);\n\t\tif(pow % 2 == 1){\n\t\t\tlong[][] res = pow(a, pow-1);\n\t\t\treturn mult(res, a);\n\t\t}\n\t\tlong[][] res = pow(a, pow/2);\n\t\treturn mult(res, res);\n\t}\n\n\tstatic long[][] iden(int n){\n\t\tlong[][] res = new long[n][n];\n\t\tfor(int i = 0; i < n; i++) res[i][i] = 1;\n\t\treturn res;\n\t}\n\n\tstatic long[][] mult(long[][] a, long[][] b){\n\t\tlong[][] res = new long[a.length][b[0].length];\n\t\tfor(int i = 0; i < a.length; i++){\n\t\t\tfor(int j = 0; j < b[0].length; j++){\n\t\t\t\tfor(int k = 0; k < a[0].length; k++){\n\t\t\t\t\tres[i][j] += (a[i][k]%mod)*(b[k][j]%mod);\n\t\t\t\t\tres[i][j] %= mod;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\n\tstatic class JS{\n\t\tpublic int BS = 1<<16;\n\t\tpublic char NC = (char)0;\n\t\tbyte[] buf = new byte[BS];\n\t\tint bId = 0, size = 0;\n\t\tchar c = NC;\n\t\tdouble num = 1;\n\t\tBufferedInputStream in;\n \n\t\tpublic JS() {\n\t\t\tin = new BufferedInputStream(System.in, BS);\n\t\t}\n \n\t\tpublic JS(String s) throws FileNotFoundException {\n\t\t\tin = new BufferedInputStream(new FileInputStream(new File(s)), BS);\n\t\t}\n \n\t\tpublic char nextChar(){\n\t\t\twhile(bId==size) {\n\t\t\t\ttry {\n\t\t\t\t\tsize = in.read(buf);\n\t\t\t\t}catch(Exception e) {\n\t\t\t\t\treturn NC;\n\t\t\t\t}\t\t\t\t\n\t\t\t\tif(size==-1)return NC;\n\t\t\t\tbId=0;\n\t\t\t}\n\t\t\treturn (char)buf[bId++];\n\t\t}\n \n\t\tpublic int nextInt() {\n\t\t\treturn (int)nextLong();\n\t\t}\n \n\t\tpublic long nextLong() {\n\t\t\tnum=1;\n\t\t\tboolean neg = false;\n\t\t\tif(c==NC)c=nextChar();\n\t\t\tfor(;(c<'0' || c>'9'); c = nextChar()) {\n\t\t\t\tif(c=='-')neg=true;\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tfor(; c>='0' && c <='9'; c=nextChar()) {\n\t\t\t\tres = (res<<3)+(res<<1)+c-'0';\n\t\t\t\tnum*=10;\n\t\t\t}\n\t\t\treturn neg?-res:res;\n\t\t}\n \n\t\tpublic double nextDouble() {\n\t\t\tdouble cur = nextLong();\n\t\t\treturn c!='.' ? cur:cur+nextLong()/num;\n\t\t}\n \n\t\tpublic String next() {\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\twhile(c<=32)c=nextChar();\n\t\t\twhile(c>32) {\n\t\t\t\tres.append(c);\n\t\t\t\tc=nextChar();\n\t\t\t}\n\t\t\treturn res.toString();\n\t\t}\n \n\t\tpublic String nextLine() {\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\twhile(c<=32)c=nextChar();\n\t\t\twhile(c!='\\n') {\n\t\t\t\tres.append(c);\n\t\t\t\tc=nextChar();\n\t\t\t}\n\t\t\treturn res.toString();\n\t\t}\n \n\t\tpublic boolean hasNext() {\n\t\t\tif(c>32)return true;\n\t\t\twhile(true) {\n\t\t\t\tc=nextChar();\n\t\t\t\tif(c==NC)return false;\n\t\t\t\telse if(c>32)return true;\n\t\t\t}\n\t\t}\n\t}\n\n}", "lang_cluster": "Java", "tags": ["math", "matrices", "constructive algorithms", "combinatorics"], "code_uid": "f5cad76fb821b694217a61d26830d182", "src_uid": "ded299fa1cd010822c60f2389a3ba1a3", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.Scanner;\nimport java.math.BigInteger;\nimport java.util.Vector;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tBigInteger MOD = BigInteger.valueOf(998244353);\n\t\t\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong n = sc.nextLong();\n\t\tlong m = sc.nextLong();\n\t\tlong L = sc.nextLong();\n\t\tlong R = sc.nextLong();\n\n\t\tlong k = R - L + 1;\n\n\t\tif (n * m % 2 == 1) {\n\t\t\tBigInteger exp = BigInteger.valueOf(n * m);\n\t\t\tBigInteger base = BigInteger.valueOf(k);\n\t\t\tSystem.out.println(base.modPow(exp, MOD));\n\t\t} else {\n\t\t\tlong e, o;\n\t\t\tBigInteger E, O, exp;\n\t\t\te = R / 2 - (L - 1) / 2;\n\t\t\to = k - e;\n\t\t\tE = BigInteger.valueOf(e);\n\t\t\tO = BigInteger.valueOf(o);\n\t\t\texp = BigInteger.valueOf(n * m);\n\t\t\tBigInteger a = E.add(O).modPow(exp, MOD);\n\t\t\tBigInteger b = E.subtract(O).modPow(exp, MOD);\n\t\t\tSystem.out.println(a.add(b).multiply(MOD.add(BigInteger.ONE)).divide(BigInteger.valueOf(2)).mod(MOD));\n\n\t\t}\n\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "matrices", "constructive algorithms", "combinatorics"], "code_uid": "2a165586fdc63bb435ea506c55a2eb5c", "src_uid": "ded299fa1cd010822c60f2389a3ba1a3", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class HeightAllTheSame {\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tStringTokenizer st = new StringTokenizer(in.readLine());\n\t\tlong N = Long.parseLong(st.nextToken());\n\t\tlong M = Long.parseLong(st.nextToken());\n\t\tlong L = Long.parseLong(st.nextToken());\n\t\tlong R = Long.parseLong(st.nextToken());\n\t\tif((N * M) % 2 == 1) {\n\t\t\tout.println(pow(R - L + 1, N * M));\n\t\t} else if((R - L + 1) % 2 == 0) {\n\t\t\tout.println((pow(R - L + 1, N * M) * (long)(998244353 + 1) / 2) % 998244353);\n\t\t} else {\n\t\t\tout.println(((pow(R - L + 1, N * M) + 1) * (long)(998244353 + 1) / 2) % 998244353);\n\t\t}\n\t\tin.close();\n\t\tout.close();\n\t}\n\tstatic long pow(long a, long b) {\n\t\tlong res = 1;\n\t\twhile(b > 0) {\n\t\t\tif(b % 2 == 1) {\n\t\t\t\tres = (res * a) % 998244353;\n\t\t\t\tb--;\n\t\t\t}\n\t\t\ta = (a * a) % 998244353;\n\t\t\tb /= 2;\n\t\t}\n\t\treturn res;\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "matrices", "constructive algorithms", "combinatorics"], "code_uid": "3d907f111df19da5db93c9a51758f6dc", "src_uid": "ded299fa1cd010822c60f2389a3ba1a3", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// package Quarantine;\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class HeightAllTheSame {\n public static void main(String[] args)throws IOException {\n BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st=new StringTokenizer(br.readLine());\n int n=Integer.parseInt(st.nextToken());\n int m=Integer.parseInt(st.nextToken());\n int l=Integer.parseInt(st.nextToken());\n int r=Integer.parseInt(st.nextToken());\n long total=1l*n*m;\n int mod=998244353;\n if(total%2!=0){\n long ans=modexp(r-l+1,total,mod);\n System.out.println(ans);\n }\n else{\n int k=r-l+1;\n int e=r/2-l/2;\n if(l%2==0){\n e++;\n }\n int o=k-e;\n// System.out.println(e+\" \"+o);\n long ans=modexp(e+o,total,mod);\n ans=(ans+modexp(e-o,total,mod))%mod;\n ans=(ans*modexp(2,mod-2,mod))%mod;\n System.out.println(ans);\n }\n }\n public static long modexp(long a,long power,int mod){\n if(power==0){\n return 1;\n }\n if(power==1){\n return a;\n }\n long small=modexp(a,power/2,mod);\n long ans=(small%mod*small%mod)%mod;\n if(power%2!=0){\n ans=(ans%mod*a%mod)%mod;\n }\n return ans;\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "matrices", "constructive algorithms", "combinatorics"], "code_uid": "d7eb9f65ba74d2448a8a74358d4d5711", "src_uid": "ded299fa1cd010822c60f2389a3ba1a3", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class E {\n\n\tstatic long mod = 998244353;\n\tpublic static void main(String[] args) {\n\t\tFastScanner sc = new FastScanner();\n\t\tlong n = sc.nextInt();\n\t\tlong m = sc.nextInt();\n\t\tlong L = sc.nextInt();\n\t\tlong R = sc.nextInt();\n\t\tif(n % 2 == 1 && m % 2 == 1) {\n\t\t\tSystem.out.println(pow((R-L+1) % mod, n*m));\n\t\t}\n\t\telse {\n\t\t\tif((R - L + 1) % 2 == 0) {\n\t\t\t\tlong allbutone = pow((R-L+1) % mod, n*m-1);\n\t\t\t\tlong res = allbutone * ((R-L+1)/2) % mod;\n\t\t\t\tSystem.out.println(res);\n\t\t\t}\n\t\t\telse { //fun case\n\t\t\t\tMatrix id = new Matrix(1,0,0,1);\n\t\t\t\tlong k = (R - L + 1) / 2;\n\t\t\t\tMatrix mat = new Matrix(k, k+1, k+1, k);\n\t\t\t\tMatrix res = mat.pow(n*m);\n\t\t\t\tSystem.out.println(res.mat[0][0]);\n\t\t\t}\n\t\t}\n\t}\n\tstatic class Matrix{\n\t\tlong[][] mat = new long[2][2];\n\t\tpublic Matrix(long a, long b, long c, long d) {\n\t\t\tmat[0][0] = a;\n\t\t\tmat[0][1] = b;\n\t\t\tmat[1][0] = c;\n\t\t\tmat[1][1] = d;\n\t\t}\n\t\tpublic Matrix(long[][] mat) {\n\t\t\tthis.mat = mat;\n\t\t}\n\t\tpublic Matrix pow(long x) {\n\t\t\tMatrix res = new Matrix(1, 0, 0, 1);\n\t\t\tMatrix a = new Matrix(mat);\n\t\t\twhile(x > 0) {\n\t\t\t\tif(x % 2 == 1) {\n\t\t\t\t\tres = res.mult(a);\n\t\t\t\t}\n\t\t\t\ta = a.mult(a);\n\t\t\t\tx /= 2;\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\tpublic Matrix mult(Matrix m) {\n\t\t\tlong[][] rmat = new long[2][2];\n\t\t\tfor(int i = 0; i < 2; i++) {\n\t\t\t\tfor(int j = 0; j < 2; j++) {\n\t\t\t\t\tfor(int k = 0; k < 2; k++) {\n\t\t\t\t\t\trmat[i][j] += mat[i][k] * m.mat[k][j];\n\t\t\t\t\t\trmat[i][j] %= mod;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn new Matrix(rmat);\n\t\t}\n\t\tpublic String toString() {\n\t\t\treturn \n\t\t\tmat[0][0]+\" \"+mat[0][1]+\"\\n\"+\n\t\t\tmat[1][0]+\" \"+mat[1][1];\n\t\t}\n\t}\n\t\n\tstatic long pow(long a, long b) {\n\t\tlong res = 1;\n\t\twhile(b > 0) {\n\t\t\tif(b % 2 == 1) {\n\t\t\t\tres = (res * a) % mod;\n\t\t\t}\n\t\t\ta = (a * a) % mod;\n\t\t\tb /= 2;\n\t\t}\n\t\treturn res;\n\t}\n\t\n\tstatic class FastScanner {\n\t\tpublic BufferedReader reader;\n\t\tpublic StringTokenizer tokenizer;\n\t\tpublic FastScanner() {\n\t\t\treader = new BufferedReader(new InputStreamReader(System.in), 32768);\n\t\t\ttokenizer = null;\n\t\t}\n\t\tpublic String next() {\n\t\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tokenizer.nextToken();\n\t\t}\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t\tpublic String nextLine() {\n\t\t\ttry {\n\t\t\t\treturn reader.readLine();\n\t\t\t} catch(IOException e) {\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\t}\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["math", "matrices", "constructive algorithms", "combinatorics"], "code_uid": "81a5041c1b4cbde8691f4c4c9e0932ba", "src_uid": "ded299fa1cd010822c60f2389a3ba1a3", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package Div2_630;\n//564 558 305171115 960941497\n\nimport java.util.Scanner;\nimport java.util.TreeMap;\n\npublic class E {\n static long mod = 998244353;\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n long n = in.nextInt();\n long m = in.nextInt();\n long p = in.nextInt();\n long q = in.nextInt();\n long x = q - p + 1;\n if (p % 2 == 0) x = x - x / 2;\n else x /= 2;\n long y = q - p + 1 - x;\n dp[0]=new TreeMap();\n dp[1]=new TreeMap();\n if ((n & m) % 2 == 0) {\n long ans = fn(x, y, n * m, 0);\n System.out.println(ans);\n } else {\n long ans = bin(x + y, n * m);\n System.out.println(ans);\n }\n }\n\n static TreeMap<Long, Integer>[] dp = new TreeMap[2];\n\n private static long fn(long x, long y, long st, int type) {\n if (dp[type].containsKey(st)) return dp[type].get(st);\n if (st == 1) {\n if (type == 0) return x;\n return y;\n }\n if (st % 2 == 1) {\n return (x * fn(x, y, st - 1, type) + y * fn(x, y, st - 1, (type + 1) % 2)) % mod;\n } else {\n long nch = fn(x, y, st / 2, 1);\n long ch = fn(x, y, st / 2, 0);\n long ans = 0;\n if (type == 0) {\n ans = (ch * ch + nch * nch) % mod;\n } else {\n ans = (2 * ch * nch) % mod;\n }\n dp[type].put(st, (int) ans);\n return ans;\n }\n }\n\n private static long bin(long x, long st) {\n if (st == 0) return 1;\n if (st == 1) return x;\n long m = st / 2;\n long ans = bin(x, m);\n if (st % 2 == 0) {\n return (ans * ans) % mod;\n } else {\n return (((ans * ans) % mod) * x) % mod;\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "matrices", "constructive algorithms", "combinatorics"], "code_uid": "8a794dd138e2942ca243c2f078871f79", "src_uid": "ded299fa1cd010822c60f2389a3ba1a3", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n\n/*\nПрокрастинирую\n*/\n\npublic class Main {\n\n static FastReader in;\n static PrintWriter out;\n static Random rand = new Random();\n static final int INF = (int) (1e9 + 10), MOD = (int) (998244353), LOGN = 20;\n static final long IINF = (long) (2e18 + 10);\n\n static long pow(long a, long b) {\n long res = 1;\n while (b != 0) {\n if ((b & 1) != 0) {\n res = (res * a) % MOD;\n }\n a = (a * a) % MOD;\n b >>= 1;\n }\n return res;\n }\n\n static long even, odd;\n static HashMap<Long, Long> dp0;\n static HashMap<Long, Long> dp1;\n static long go(long n, int x) {\n if (x == 0) {\n if (dp0.containsKey(n)) {\n return dp0.get(n);\n }\n if (n == 1) {\n long res = even;\n dp0.put(n, res);\n return res;\n } else if (n == 2) {\n long res = (even * even + odd * odd) % MOD;\n dp0.put(n, res);\n return res;\n }\n long a1 = go(n / 2, 0);\n long a2 = go(n - n / 2, 0);\n long b1 = go(n / 2, 1);\n long b2 = go(n - n / 2, 1);\n long res = (a1 * a2 + b1 * b2) % MOD;\n dp0.put(n, res);\n return res;\n } else {\n if (dp1.containsKey(n)) {\n return dp1.get(n);\n }\n if (n == 1) {\n long res = odd;\n dp1.put(n, res);\n return res;\n } else if (n == 2) {\n long res = (even * odd + odd * even) % MOD;\n dp1.put(n, res);\n return res;\n }\n long a1 = go(n / 2, 0);\n long a2 = go(n - n / 2, 1);\n long b1 = go(n / 2, 1);\n long b2 = go(n - n / 2, 0);\n long res = (a1 * a2 + b1 * b2) % MOD;\n dp1.put(n, res);\n return res;\n }\n }\n\n static void solve() {\n long n = in.nextInt();\n long m = in.nextInt();\n long l = in.nextInt();\n long r = in.nextInt();\n long sz = n * m;\n\n if (sz % 2 == 0) {\n even = (r - l + 1) / 2;\n if ((r - l) % 2 == 0 && l % 2 == 0) even++;\n odd = r - l + 1 - even;\n\n dp0 = new HashMap<>();\n dp1 = new HashMap<>();\n out.println(go(sz, 0));\n } else {\n long ans = pow(r - l + 1, sz);\n out.println(ans);\n }\n }\n\n public static void main(String[] args) throws FileNotFoundException {\n in = new FastReader(System.in);\n// in = new FastReader(new FileInputStream(\"sometext.txt\"));\n out = new PrintWriter(System.out);\n// out = new PrintWriter(new FileOutputStream(\"sometext.txt\"));\n\n int tests = 1;\n// tests = in.nextInt();\n\n while (tests-- > 0) {\n solve();\n }\n\n// out.flush();\n out.close();\n }\n\n static class FastReader {\n BufferedReader br;\n StringTokenizer st;\n\n FastReader(InputStream is) {\n br = new BufferedReader(new InputStreamReader(is));\n }\n\n Integer nextInt() {\n return Integer.parseInt(next());\n }\n\n Long nextLong() {\n return Long.parseLong(next());\n }\n\n Double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(nextLine());\n }\n return st.nextToken();\n }\n\n String nextLine() {\n String s = \"\";\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return s;\n }\n }\n}", "lang_cluster": "Java", "tags": ["math", "matrices", "constructive algorithms", "combinatorics"], "code_uid": "d01f77521e7d0ba861649893c64f4c3f", "src_uid": "ded299fa1cd010822c60f2389a3ba1a3", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/*****Author: Satyajeet Singh, Delhi Technological University************************************/\n import java.io.*;\n import java.util.*;\n import java.text.*; \n import java.lang.*;\n import java.math.*;\npublic class Main{\n/*********************************************Constants******************************************/\n static PrintWriter out=new PrintWriter(new OutputStreamWriter(System.out)); \n static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n static long mod=(long)1e9+7;\n static long mod1=998244353;\n static HashSet<Integer> graph[];\n static int pptr=0,pptrmax=0;\n static String st[];\n/*****************************************Solutions Begins***************************************/\n public static void main(String args[]) throws Exception{\n long n=pl();\n long m=pl();\n long l=pl();\n long r=pl();\n long d=r-l+1;\n long a=d/2;\n long b=d-a;\n long nm=n*m;\n mod=mod1;\n //debug(a,b);\n\n long ans=(modulo((a+b),nm,mod)+modulo(Math.abs(a-b),nm,mod))%mod;\n ans=(ans*modulo(2l,mod-2,mod))%mod;\n if(nm%2==1){\n ans=modulo(d,nm,mod);\n }\n out.println(ans);\n/****************************************Solutions Ends**************************************************/\n out.flush();\n out.close();\n }\n/****************************************Template Begins************************************************/\n static void nl() throws Exception{\n pptr=0;\n st=br.readLine().split(\" \");\n pptrmax=st.length;\n }\n static void nls() throws Exception{\n pptr=0;\n st=br.readLine().split(\"\");\n pptrmax=st.length;\n }\n static int pi() throws Exception{\n if(pptr==pptrmax)\n nl();\n return Integer.parseInt(st[pptr++]);\n }\n static long pl() throws Exception{\n if(pptr==pptrmax)\n nl();\n return Long.parseLong(st[pptr++]);\n }\n static double pd() throws Exception{\n if(pptr==pptrmax)\n nl();\n return Double.parseDouble(st[pptr++]);\n }\n static String ps() throws Exception{\n if(pptr==pptrmax)\n nl();\n return st[pptr++];\n }\n/***************************************Precision Printing**********************************************/\n static void printPrecision(double d){\n DecimalFormat ft = new DecimalFormat(\"0.000000000000\"); \n out.print(ft.format(d));\n }\n/**************************************Bit Manipulation**************************************************/\n static void printMask(long mask){\n System.out.println(Long.toBinaryString(mask));\n }\n static int countBit(long mask){\n int ans=0;\n while(mask!=0){\n mask&=(mask-1);\n ans++;\n }\n return ans;\n }\n/******************************************Graph*********************************************************/\n static void Makegraph(int n){\n graph=new HashSet[n];\n for(int i=0;i<n;i++){\n graph[i]=new HashSet<>();\n }\n }\n static void addEdge(int a,int b){\n graph[a].add(b);\n }\n // static void addEdge(int a,int b,int c){\n // graph[a].add(new Pair(b,c));\n // } \n/*********************************************PAIR********************************************************/\n static class Pair implements Comparable<Pair> {\n int u;\n int v;\n int index=-1;\n public Pair(int u, int v) {\n this.u = u;\n this.v = v;\n }\n public int hashCode() {\n int hu = (int) (u ^ (u >>> 32));\n int hv = (int) (v ^ (v >>> 32));\n return 31 * hu + hv;\n }\n public boolean equals(Object o) {\n Pair other = (Pair) o;\n return u == other.u && v == other.v;\n }\n public int compareTo(Pair other) {\n if(index!=other.index)\n return Long.compare(index, other.index);\n return Long.compare(v, other.v)!=0?Long.compare(v, other.v):Long.compare(u, other.u);\n }\n public String toString() {\n return \"[u=\" + u + \", v=\" + v + \"]\";\n }\n }\n/******************************************Long Pair*******************************************************/\n static class Pairl implements Comparable<Pairl> {\n long u;\n long v;\n int index=-1;\n public Pairl(long u, long v) {\n this.u = u;\n this.v = v;\n }\n public int hashCode() {\n int hu = (int) (u ^ (u >>> 32));\n int hv = (int) (v ^ (v >>> 32));\n return 31 * hu + hv;\n }\n public boolean equals(Object o) {\n Pairl other = (Pairl) o;\n return u == other.u && v == other.v;\n }\n public int compareTo(Pairl other) {\n if(index!=other.index)\n return Long.compare(index, other.index);\n return Long.compare(v, other.v)!=0?Long.compare(v, other.v):Long.compare(u, other.u);\n }\n public String toString() {\n return \"[u=\" + u + \", v=\" + v + \"]\";\n }\n }\n/*****************************************DEBUG***********************************************************/\n public static void debug(Object... o){\n System.out.println(Arrays.deepToString(o));\n }\n/************************************MODULAR EXPONENTIATION***********************************************/\n static long modulo(long a,long b,long c){\n long x=1;\n long y=a%c;\n while(b > 0){\n if(b%2 == 1)\n x=(x*y)%c;\n y = (y*y)%c;\n b /= 2;\n }\n return x%c;\n }\n/********************************************GCD**********************************************************/\n static long gcd(long x, long y){\n if(x==0)\n return y;\n if(y==0)\n return x;\n long r=0, a, b;\n a = (x > y) ? x : y; \n b = (x < y) ? x : y;\n r = b;\n while(a % b != 0){\n r = a % b;\n a = b;\n b = r;\n }\n return r;\n }\n/********************************************End***********************************************************/\n}", "lang_cluster": "Java", "tags": ["math", "matrices", "constructive algorithms", "combinatorics"], "code_uid": "79ecd5d3befc13eb473f92dee4d48e73", "src_uid": "ded299fa1cd010822c60f2389a3ba1a3", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.LinkedList;\nimport java.util.StringTokenizer;\n\npublic class Solution{\n\t\n\tstatic long mod = 998244353L;\n\t\n\tpublic static void main(String[] args) throws Exception{\n\n\t\tFastScanner fs = new FastScanner();\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\t\n\t\tlong n = fs.nextLong(), m = fs.nextLong(), l = fs.nextLong(), r = fs.nextLong();\n\t\t\n\t\tif((n*m&1)==1) {\n\t\t\tout.println(exp(r-l+1,n*m));\n\t\t\tout.close();\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tlong E = r/2 - (l-1)/2;\n\t\tlong O = r-l+1 - E;\n\t\t\n\t\t\n\t\tlong ans = (exp(E+O,n*m) + exp(E-O,n*m))%mod;\n\t\tans = (ans*exp(2,mod-2))%mod;\n\t\t\n\t\tout.println(ans);\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\tout.close();\n\t}\n\t\n\t\n\t//BINARY EXPONENTIATION\n\tstatic long exp(long a, long n) {\n\t\tlong res = 1L;\n\t\twhile(n>0) {\n\t\t\tif((n&1)==1) {\n\t\t\t\tres = (res*a)%mod;\n\t\t\t}\n\t\t\ta = (a*a)%mod;\n\t\t\tn = n>>1;\n\t\t}\n\t\treturn res;\n\t}\n\t\n\n\t\n\tstatic class FastScanner{\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st = new StringTokenizer(\"\");\n\n\t\tpublic String next(){\n\t\t\twhile(!st.hasMoreElements()){\n\t\t\t\ttry{\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch(IOException e){\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\t\t\n\t\tpublic String nextLine() throws IOException {\n\t\t\treturn br.readLine();\n\t\t}\n\t\t\n\t\tpublic int nextInt(){\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic int[] readArray(int n){\n\t\t\tint[] a = new int[n];\n\t\t\tfor(int i=0;i<n;i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\t\t\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t}\n\t\n}\n", "lang_cluster": "Java", "tags": ["math", "matrices", "constructive algorithms", "combinatorics"], "code_uid": "f57d787f3d9c7a77b83780c59ac11443", "src_uid": "ded299fa1cd010822c60f2389a3ba1a3", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.text.*;\nimport java.util.*;\nimport java.math.*;\n \npublic class E {\n\tpublic static void main(String[] args) throws Exception {\n\t\tnew E().run();\n\t}\n\tpublic void run() throws Exception {\n\t\tFastScanner f = new FastScanner();\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tint n = f.nextInt();\n\t\tint m = f.nextInt();\n\t\tint l = f.nextInt();\n\t\tint r = f.nextInt();\n\t\tif(n % 2 == 1 && m % 2 == 1) {\n\t\t\tout.println(exp(exp(r-l+1, n), m));\n\t\t\tout.flush();\n\t\t\treturn;\n\t\t}\n\t\tint even = r/2-(l+1)/2+1;\n\t\tint odd = r-l+1-even;\n\t\tlong[][] mat = {{even, odd},{odd, even}};\n\t\tmat = exp(mat, n);\n\t\tmat = exp(mat, m);\n\t\tout.println(mat[0][0]);\n///\n\t\tout.flush(); \n\t}\n\tpublic int MOD = 998_244_353;\n\tpublic long[][] mult(long[][] a, long[][] b) {\n\t\tlong[][] c = new long[a.length][b[0].length];\n\t\tfor(int i = 0; i < a.length; i++)\n\t\t\tfor(int j = 0; j < b[0].length; j++)\n\t\t\t\tfor(int k = 0; k < b.length; k++)\n\t\t\t\t\tc[i][j] = (c[i][j] + a[i][k] * b[k][j] % MOD) % MOD;\n\t\treturn c;\n\t}\n\tpublic long[][] exp(long[][] m, int e) {\n\t\tif(e == 1) return m;\n\t\tlong[][] r = exp(m, e >> 1);\n\t\tr = mult(r, r);\n\t\tif(e%2 == 1)\n\t\t\tr = mult(r, m);\n\t\treturn r;\n\t}\n\tpublic long exp(long a, int e) {\n\t\tif(e == 1) return a;\n\t\tlong r = exp(a, e >> 1);\n\t\tr = r*r%MOD;\n\t\tif(e % 2 == 1)\n\t\t\tr = r*a % MOD;\n\t\treturn r;\n\t}\n///\n static class FastScanner {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n public FastScanner() {\n reader = new BufferedReader(new InputStreamReader(System.in), 32768);\n tokenizer = null;\n }\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n public int nextInt() {\n return Integer.parseInt(next());\n }\n public long nextLong() {\n \treturn Long.parseLong(next());\n }\n public double nextDouble() {\n \treturn Double.parseDouble(next());\n }\n public String nextLine() {\n \ttry {\n \t\treturn reader.readLine();\n \t} catch(IOException e) {\n \t\tthrow new RuntimeException(e);\n \t}\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "matrices", "constructive algorithms", "combinatorics"], "code_uid": "ead194e1c60df8b64ef1a733684f5f89", "src_uid": "ded299fa1cd010822c60f2389a3ba1a3", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/*\nIf you want to aim high, aim high\nDon't let that studying and grades consume you\nJust live life young\n******************************\nIf I'm the sun, you're the moon\nBecause when I go up, you go down\n*******************************\nI'm working for the day I will surpass you\nhttps://www.a2oj.com/Ladder16.html\n*/\nimport java.util.*;\nimport java.io.*;\nimport java.math.*;\n\n public class E\n {\n static long MOD = 998244353L;\n public static void main(String omkar[]) throws Exception\n {\n BufferedReader infile = new BufferedReader(new InputStreamReader(System.in)); \n StringTokenizer st = new StringTokenizer(infile.readLine());\n long N = Long.parseLong(st.nextToken());\n long M = Long.parseLong(st.nextToken());\n long L = Long.parseLong(st.nextToken());\n long R = Long.parseLong(st.nextToken());\n //dont panic \n //that makes you lose Omkar energy\n if((N*M)%2 == 1)\n {\n //here?\n long temp = N*M;\n BigInteger exp = new BigInteger(temp+\"\");\n BigInteger base = new BigInteger((R-L+1)+\"\");\n BigInteger mod = new BigInteger(MOD+\"\");\n long res = base.modPow(exp, mod).longValue();\n System.out.println((res+MOD)%MOD);\n }\n else\n {\n long temp = N*M;\n BigInteger exp = new BigInteger(temp+\"\");\n BigInteger base = new BigInteger((R-L+1)+\"\");\n BigInteger mod = new BigInteger(MOD+\"\");\n long res = base.modPow(exp, mod).longValue();\n //res = (res*power(2,MOD-2,MOD))%MOD;\n if((R-L)%2 == 0)\n res++;\n res = (res*power(2,MOD-2,MOD))%MOD;\n System.out.println(res);\n }\n }\n public static long power(long x, long y, long p) \n { \n long res = 1L; \n x = x % p; \n while (y > 0) \n { \n if((y & 1)==1) \n res = (res * x) % p; \n y = y >> 1; \n x = (x * x) % p; \n } \n return res; \n }\n }", "lang_cluster": "Java", "tags": ["math", "matrices", "constructive algorithms", "combinatorics"], "code_uid": "b9f7cfb474c343a702b84fe448d2e05c", "src_uid": "ded299fa1cd010822c60f2389a3ba1a3", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class E implements Runnable {\n\tboolean judge = false;\n\tFastReader scn;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\n\tvoid solve() {\n\t\tlong n = scn.nextLong(), m = scn.nextLong();\n\t\tlong l = scn.nextLong(), r = scn.nextLong(), mod = 998244353;\n\t\t\n\t\tif((n * m) % 2 == 1) {\n\t\t\tout.println(pow(r - l + 1, n * m, mod));\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tlong x = (r - l + 1) / 2;\n\t\tlong k = n * m;\n\t\tlong two = pow(2, k - 1, mod);\n\t\t\n\t\tlong ans = (pow(x, k, mod) * two) % mod;\n\t\tif((r - l + 1) % 2 != 0) {\n\t\t\tlong y = r - l + 1 - x;\n\t\t\tans = (pow(y + x, k, mod) + pow(y - x, k, mod)) % mod;\n\t\t\tans = (ans * pow(2, mod - 2, mod)) % mod;\n\t\t}\n\t\tout.println(ans);\n\t}\n\t\n\tlong func(long k, long z, long mod) {\n\t\tif(z == 0) {\n\t\t\treturn 0;\n\t\t}\n\t\tlong x = z / 2, y = z - x;\n\t\tif(x == 0 || y == 0) {\n\t\t\treturn 1;\n\t\t}\n\t\t\n\t\tlong ans = 0;\n\t\tfor(long a = 0; a <= k; a += 2) {\n\t\t\tlong b = k - a;\n\t\t\t\n\t\t\tlong rv = pow(x, a, mod) * pow(y, b, mod) % mod;\n\t\t\tans = (ans + rv) % mod;\n\t\t}\n\t\t\n\t\treturn ans;\n\t}\n\t\n\tlong pow(long a, long x, long m) {\n\t\tlong rv = 1;\n\t\twhile (x != 0) {\n\t\t\tif ((x & 1) == 1) {\n\t\t\t\trv = (rv * a) % m;\n\t\t\t}\n\t\t\ta = (a * a) % m;\n\t\t\tx = x >> 1;\n\t\t}\n\t\treturn rv;\n\t}\n\t\n\n\tpublic void run() {\n\t\tlong time = System.currentTimeMillis();\n\t\tboolean oj = System.getProperty(\"ONLINE_JUDGE\") != null || judge;\n\t\tout = new PrintWriter(System.out);\n\t\tscn = new FastReader(oj);\n\t\tsolve();\n\t\tout.flush();\n\t\tif (!oj) {\n\t\t\tSystem.out.println(Arrays.deepToString(new Object[] { System.currentTimeMillis() - time + \" ms\" }));\n\t\t}\n\t}\n\n\t\n\tpublic static void main(String[] args) {\n\t\tnew Thread(null, new E(), \"Main\", 1 << 28).start();\n\t}\n\n\tclass FastReader {\n\t\tInputStream is;\n\n\t\tpublic FastReader(boolean onlineJudge) {\n\t\t\tis = onlineJudge ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\t}\n\n\t\tbyte[] inbuf = new byte[1024];\n\t\tpublic int lenbuf = 0, ptrbuf = 0;\n\n\t\tint readByte() {\n\t\t\tif (lenbuf == -1)\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tif (ptrbuf >= lenbuf) {\n\t\t\t\tptrbuf = 0;\n\t\t\t\ttry {\n\t\t\t\t\tlenbuf = is.read(inbuf);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (lenbuf <= 0)\n\t\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn inbuf[ptrbuf++];\n\t\t}\n\n\t\tboolean isSpaceChar(int c) {\n\t\t\treturn !(c >= 33 && c <= 126);\n\t\t}\n\n\t\tint skip() {\n\t\t\tint b;\n\t\t\twhile ((b = readByte()) != -1 && isSpaceChar(b))\n\t\t\t\t;\n\t\t\treturn b;\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tchar nextChar() {\n\t\t\treturn (char) skip();\n\t\t}\n\n\t\tString next() {\n\t\t\tint b = skip();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\twhile (!(isSpaceChar(b))) { // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n\n\t\tString nextLine() {\n\t\t\tint b = skip();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\twhile ((!isSpaceChar(b) || b == ' ')) { // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n\n\t\tchar[] next(int n) {\n\t\t\tchar[] buf = new char[n];\n\t\t\tint b = skip(), p = 0;\n\t\t\twhile (p < n && !(isSpaceChar(b))) {\n\t\t\t\tbuf[p++] = (char) b;\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t\t}\n\n\t\tint nextInt() {\n\t\t\tint num = 0, b;\n\t\t\tboolean minus = false;\n\t\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t\t;\n\t\t\tif (b == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tb = readByte();\n\t\t\t}\n\n\t\t\twhile (true) {\n\t\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t\t} else {\n\t\t\t\t\treturn minus ? -num : num;\n\t\t\t\t}\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\tlong num = 0;\n\t\t\tint b;\n\t\t\tboolean minus = false;\n\t\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t\t;\n\t\t\tif (b == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tb = readByte();\n\t\t\t}\n\n\t\t\twhile (true) {\n\t\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t\t} else {\n\t\t\t\t\treturn minus ? -num : num;\n\t\t\t\t}\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t}\n\n\t\tchar[][] nextMatrix(int n, int m) {\n\t\t\tchar[][] map = new char[n][];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tmap[i] = next(m);\n\t\t\treturn map;\n\t\t}\n\n\t\tint[] nextIntArray(int n) {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\n\t\tlong[] nextLongArray(int n) {\n\t\t\tlong[] a = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n\n\t\tint[][] next2DInt(int n, int m) {\n\t\t\tint[][] arr = new int[n][];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tarr[i] = nextIntArray(m);\n\t\t\t}\n\t\t\treturn arr;\n\t\t}\n\n\t\tlong[][] next2DLong(int n, int m) {\n\t\t\tlong[][] arr = new long[n][];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tarr[i] = nextLongArray(m);\n\t\t\t}\n\t\t\treturn arr;\n\t\t}\n\n\t\tint[] shuffle(int[] arr) {\n\t\t\tRandom r = new Random();\n\t\t\tfor (int i = 1, j; i < arr.length; i++) {\n\t\t\t\tj = r.nextInt(i);\n\t\t\t\tint c = arr[i];\n\t\t\t\tarr[i] = arr[j];\n\t\t\t\tarr[j] = c;\n\t\t\t}\n\t\t\treturn arr;\n\t\t}\n\n\t\tlong[] shuffle(long[] arr) {\n\t\t\tRandom r = new Random();\n\t\t\tfor (int i = 1, j; i < arr.length; i++) {\n\t\t\t\tj = r.nextInt(i);\n\t\t\t\tlong c = arr[i];\n\t\t\t\tarr[i] = arr[j];\n\t\t\t\tarr[j] = c;\n\t\t\t}\n\t\t\treturn arr;\n\t\t}\n\n\t\tint[] uniq(int[] arr) {\n\t\t\tarr = scn.shuffle(arr);\n\t\t\tArrays.sort(arr);\n\t\t\tint[] rv = new int[arr.length];\n\t\t\tint pos = 0;\n\t\t\trv[pos++] = arr[0];\n\t\t\tfor (int i = 1; i < arr.length; i++) {\n\t\t\t\tif (arr[i] != arr[i - 1]) {\n\t\t\t\t\trv[pos++] = arr[i];\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn Arrays.copyOf(rv, pos);\n\t\t}\n\n\t\tlong[] uniq(long[] arr) {\n\t\t\tarr = scn.shuffle(arr);\n\t\t\tArrays.sort(arr);\n\t\t\tlong[] rv = new long[arr.length];\n\t\t\tint pos = 0;\n\t\t\trv[pos++] = arr[0];\n\t\t\tfor (int i = 1; i < arr.length; i++) {\n\t\t\t\tif (arr[i] != arr[i - 1]) {\n\t\t\t\t\trv[pos++] = arr[i];\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn Arrays.copyOf(rv, pos);\n\t\t}\n\n\t\tint[] reverse(int[] arr) {\n\t\t\tint l = 0, r = arr.length - 1;\n\t\t\twhile (l < r) {\n\t\t\t\tarr[l] = arr[l] ^ arr[r];\n\t\t\t\tarr[r] = arr[l] ^ arr[r];\n\t\t\t\tarr[l] = arr[l] ^ arr[r];\n\t\t\t\tl++;\n\t\t\t\tr--;\n\t\t\t}\n\t\t\treturn arr;\n\t\t}\n\n\t\tlong[] reverse(long[] arr) {\n\t\t\tint l = 0, r = arr.length - 1;\n\t\t\twhile (l < r) {\n\t\t\t\tarr[l] = arr[l] ^ arr[r];\n\t\t\t\tarr[r] = arr[l] ^ arr[r];\n\t\t\t\tarr[l] = arr[l] ^ arr[r];\n\t\t\t\tl++;\n\t\t\t\tr--;\n\t\t\t}\n\t\t\treturn arr;\n\t\t}\n\n\t\tint[] compress(int[] arr) {\n\t\t\tint n = arr.length;\n\t\t\tint[] rv = Arrays.copyOf(arr, n);\n\t\t\trv = uniq(rv);\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tarr[i] = Arrays.binarySearch(rv, arr[i]);\n\t\t\t}\n\t\t\treturn arr;\n\t\t}\n\n\t\tlong[] compress(long[] arr) {\n\t\t\tint n = arr.length;\n\t\t\tlong[] rv = Arrays.copyOf(arr, n);\n\t\t\trv = uniq(rv);\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tarr[i] = Arrays.binarySearch(rv, arr[i]);\n\t\t\t}\n\t\t\treturn arr;\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "matrices", "constructive algorithms", "combinatorics"], "code_uid": "46d1620ce30e3de96783e2bd7190a8c3", "src_uid": "ded299fa1cd010822c60f2389a3ba1a3", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Scanner;\nimport java.io.OutputStream;\nimport java.io.IOException;\nimport java.util.Arrays;\nimport java.io.PrintWriter;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author BSRK Aditya (bsrkaditya@gmail.com)\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tScanner in = new Scanner(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskD solver = new TaskD();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskD {\n static long [][] mod;\n static long modulo = 1000000007;\n\n static long exp(long a, long pow) {\n long ans = 1;\n while(pow > 0) {\n if(pow%2 == 1) ans = ans*a%modulo;\n pow >>= 1;\n a = a*a%modulo;\n }\n return ans;\n }\n\n static void compute( int n, long q )\n {\n mod = new long[2][ n+1 ];\n mod[0][0] = 1;\n for (int i = 1; i <= n; i++) {\n mod[0][i] = mod[0][i-1]*(n-i+1)%modulo*exp(i, modulo-2)%modulo;\n }\n\n for(int i = 0; i <= n; ++i) {\n long temp = mod[0][i];\n mod[0][i] = exp(mod[0][i], q);\n mod[1][i] = mod[0][i]*temp%modulo;\n }\n\n }\n\n\tpublic void solve(int testNumber, Scanner in, PrintWriter out) {\n\n int n = in.nextInt();\n long m = in.nextLong();\n int k = in.nextInt();\n compute(n,m/n);\n long [][] f = new long[n+1][k+1];\n\n Arrays.fill(f[0], 0);\n f[0][0] = 1;\n\n for(int i = 1; i <= n; ++i) {\n f[i][0] = 1;\n int d = 0;\n if(i<=m%n) d++;\n\n for(int j = 1; j <= k; ++j) {\n f[i][j] = 0;\n for(int l = 0; l <= j && l <= n; ++l)\n f[i][j] = (f[i][j] + mod[d][l]*f[i-1][j-l])%modulo;\n }\n }\n/*\n for(int i = 0; i <= n; ++i) {\n for(int j = 0; j <= k; ++j)\n out.write(f[i][j] + \" \");\n out.println(\"\");\n } */\n out.println(new Long(f[n][k]).toString());\n\t}\n}\n\n", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics", "bitmasks"], "code_uid": "b976f6ff38007b289359d0e3c200c438", "src_uid": "9c71c8e031412e2bb21266a53821626a", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Rustam Musin (t.me/musin_acm)\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n C1HaidiITestTyuringaLegkaya solver = new C1HaidiITestTyuringaLegkaya();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class C1HaidiITestTyuringaLegkaya {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n = in.readInt();\n int minX = Integer.MAX_VALUE;\n int minY = Integer.MAX_VALUE;\n int maxX = Integer.MIN_VALUE;\n int maxY = Integer.MIN_VALUE;\n int[] cntX = new int[51];\n int[] cntY = new int[51];\n IntIntPair[] a = in.readIntPairArray(4 * n + 1);\n for (IntIntPair p : a) {\n cntX[p.first]++;\n cntY[p.second]++;\n// minX = Math.min(minX, p.first);\n// minY = Math.min(minY, p.second);\n// maxX = Math.max(maxX, p.first);\n// maxY = Math.max(maxY, p.second);\n }\n for (int x = 0; x <= 50; x++) {\n if (cntX[x] >= n) {\n minX = Math.min(minX, x);\n maxX = Math.max(maxX, x);\n }\n }\n for (int y = 0; y <= 50; y++) {\n if (cntY[y] >= n) {\n minY = Math.min(minY, y);\n maxY = Math.max(maxY, y);\n }\n }\n for (IntIntPair p : a) {\n boolean fail = false;\n if ((p.first == minX || p.first == maxX)) {\n fail = p.second < minY || p.second > maxY;\n } else if ((p.second == minY || p.second == maxY)) {\n fail = p.first < minX || p.first > maxX;\n } else {\n fail = true;\n }\n if (fail) {\n out.print(p.first, p.second);\n }\n }\n }\n\n }\n\n static class IntIntPair implements Comparable<IntIntPair> {\n public final int first;\n public final int second;\n\n public IntIntPair(int first, int second) {\n this.first = first;\n this.second = second;\n }\n\n public boolean equals(Object o) {\n if (this == o) {\n return true;\n }\n if (o == null || getClass() != o.getClass()) {\n return false;\n }\n\n IntIntPair pair = (IntIntPair) o;\n\n return first == pair.first && second == pair.second;\n }\n\n public int hashCode() {\n int result = first;\n result = 31 * result + second;\n return result;\n }\n\n public String toString() {\n return \"(\" + first + \",\" + second + \")\";\n }\n\n public int compareTo(IntIntPair o) {\n int value = Integer.compare(first, o.first);\n if (value != 0) {\n return value;\n }\n return Integer.compare(second, o.second);\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void print(Object... objects) {\n for (int i = 0; i < objects.length; i++) {\n if (i != 0) {\n writer.print(' ');\n }\n writer.print(objects[i]);\n }\n }\n\n public void close() {\n writer.close();\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public IntIntPair[] readIntPairArray(int size) {\n IntIntPair[] result = new IntIntPair[size];\n for (int i = 0; i < size; i++) {\n result[i] = readIntPair();\n }\n return result;\n }\n\n public IntIntPair readIntPair() {\n int first = readInt();\n int second = readInt();\n return new IntIntPair(first, second);\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["implementation"], "code_uid": "dc1f4f80f5d7a7c073223190dfe032a2", "src_uid": "1f9153088dcba9383b1a2dbe592e4d06", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.File;\nimport java.io.FileInputStream;\nimport java.io.FileNotFoundException;\nimport java.io.FileOutputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.math.BigInteger;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.BitSet;\nimport java.util.Calendar;\nimport java.util.Collections;\nimport java.util.Comparator;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.LinkedList;\nimport java.util.PriorityQueue;\nimport java.util.SortedSet;\nimport java.util.Stack;\nimport java.util.StringTokenizer;\nimport java.util.TreeMap;\nimport java.util.TreeSet;\n\n/**\n * #\n * \n * @author pttrung\n */\npublic class D2_Helvetic_2016 {\n\n\tpublic static long MOD = 1000003;\n\n\tpublic static void main(String[] args) throws FileNotFoundException {\n\t\t// PrintWriter out = new PrintWriter(new FileOutputStream(new File(\n\t\t// \"output.txt\")));\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tScanner in = new Scanner();\n\t\tint n = in.nextInt();\n\t\tint c = in.nextInt();\n\t\tlong[]p = new long[n + c];\n\t\tp[0] = 1;\n\t\tfor(int i = 1; i < p.length; i++){\n\t\t\tp[i] = (p[i - 1]*(i % MOD) ) % MOD;\n\t\t}\n\t\tlong result = 0;\n\t\tfor(int i = 1;i <= n; i ++ ){\n\t\t\tlong tmp = p[i + c - 1];\n\t\t\ttmp *= pow(p[i], MOD - 2);\n\t\t\ttmp %= MOD;\n\t\t\ttmp *= pow(p[c - 1] , MOD - 2);\n\t\t\ttmp %= MOD;\n\t\t\tresult += tmp;\n\t\t\tresult %= MOD;\n\t\t}\n\t\tout.println(result);\n\t\tout.close();\n\t}\n\n\tpublic static int[] KMP(String val) {\n\t\tint i = 0;\n\t\tint j = -1;\n\t\tint[] result = new int[val.length() + 1];\n\t\tresult[0] = -1;\n\t\twhile (i < val.length()) {\n\t\t\twhile (j >= 0 && val.charAt(j) != val.charAt(i)) {\n\t\t\t\tj = result[j];\n\t\t\t}\n\t\t\tj++;\n\t\t\ti++;\n\t\t\tresult[i] = j;\n\t\t}\n\t\treturn result;\n\n\t}\n\n\tpublic static boolean nextPer(int[] data) {\n\t\tint i = data.length - 1;\n\t\twhile (i > 0 && data[i] < data[i - 1]) {\n\t\t\ti--;\n\t\t}\n\t\tif (i == 0) {\n\t\t\treturn false;\n\t\t}\n\t\tint j = data.length - 1;\n\t\twhile (data[j] < data[i - 1]) {\n\t\t\tj--;\n\t\t}\n\t\tint temp = data[i - 1];\n\t\tdata[i - 1] = data[j];\n\t\tdata[j] = temp;\n\t\tArrays.sort(data, i, data.length);\n\t\treturn true;\n\t}\n\n\tpublic static int digit(long n) {\n\t\tint result = 0;\n\t\twhile (n > 0) {\n\t\t\tn /= 10;\n\t\t\tresult++;\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static double dist(long a, long b, long x, long y) {\n\t\tdouble val = (b - a) * (b - a) + (x - y) * (x - y);\n\t\tval = Math.sqrt(val);\n\t\tdouble other = x * x + a * a;\n\t\tother = Math.sqrt(other);\n\t\treturn val + other;\n\n\t}\n\n\tpublic static class Point implements Comparable<Point> {\n\n\t\tint x, y;\n\n\t\tpublic Point(int start, int end) {\n\t\t\tthis.x = start;\n\t\t\tthis.y = end;\n\t\t}\n\n\t\t@Override\n\t\tpublic int hashCode() {\n\t\t\tint hash = 5;\n\t\t\thash = 47 * hash + this.x;\n\t\t\thash = 47 * hash + this.y;\n\t\t\treturn hash;\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean equals(Object obj) {\n\t\t\tif (obj == null) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif (getClass() != obj.getClass()) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tfinal Point other = (Point) obj;\n\t\t\tif (this.x != other.x) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif (this.y != other.y) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\t\t@Override\n\t\tpublic int compareTo(Point o) {\n\t\t\treturn Integer.compare(x, o.x);\n\t\t}\n\t}\n\n\tpublic static class FT {\n\n\t\tlong[] data;\n\n\t\tFT(int n) {\n\t\t\tdata = new long[n];\n\t\t}\n\n\t\tpublic void update(int index, long value) {\n\t\t\twhile (index < data.length) {\n\t\t\t\tdata[index] += value;\n\t\t\t\tindex += (index & (-index));\n\t\t\t}\n\t\t}\n\n\t\tpublic long get(int index) {\n\t\t\tlong result = 0;\n\t\t\twhile (index > 0) {\n\t\t\t\tresult += data[index];\n\t\t\t\tindex -= (index & (-index));\n\t\t\t}\n\t\t\treturn result;\n\n\t\t}\n\t}\n\n\tpublic static long gcd(long a, long b) {\n\t\tif (b == 0) {\n\t\t\treturn a;\n\t\t}\n\t\treturn gcd(b, a % b);\n\t}\n\n\tpublic static long pow(long a, long b) {\n\t\tif (b == 0) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (b == 1) {\n\t\t\treturn a;\n\t\t}\n\t\tlong val = pow(a, b / 2);\n\t\tif (b % 2 == 0) {\n\t\t\treturn val * val % MOD;\n\t\t} else {\n\t\t\treturn val * (val * a % MOD) % MOD;\n\n\t\t}\n\t}\n\n\tstatic class Scanner {\n\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tpublic Scanner() throws FileNotFoundException {\n\t\t\t// System.setOut(new PrintStream(new\n\t\t\t// BufferedOutputStream(System.out), true));\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t\t// br = new BufferedReader(new InputStreamReader(new\n\t\t\t// FileInputStream(new File(\"input.txt\"))));\n\t\t}\n\n\t\tpublic String next() {\n\n\t\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (Exception e) {\n\t\t\t\t\tthrow new RuntimeException();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tpublic String nextLine() {\n\t\t\tst = null;\n\t\t\ttry {\n\t\t\t\treturn br.readLine();\n\t\t\t} catch (Exception e) {\n\t\t\t\tthrow new RuntimeException();\n\t\t\t}\n\t\t}\n\n\t\tpublic boolean endLine() {\n\t\t\ttry {\n\t\t\t\tString next = br.readLine();\n\t\t\t\twhile (next != null && next.trim().isEmpty()) {\n\t\t\t\t\tnext = br.readLine();\n\t\t\t\t}\n\t\t\t\tif (next == null) {\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t\tst = new StringTokenizer(next);\n\t\t\t\treturn st.hasMoreTokens();\n\t\t\t} catch (Exception e) {\n\t\t\t\tthrow new RuntimeException();\n\t\t\t}\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["combinatorics"], "code_uid": "3bfaef3e778fb5e095c4d81391ccff6a", "src_uid": "e63c70a9c96a94bce99618f2e695f83a", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class TaskC {\n\tstatic String w0 = \"What are you doing at the end of the world? Are you busy? Will you save us?\";\n\tstatic String w1a = \"What are you doing while sending \\\"\";\n\tstatic String w1b = \"\\\"? Are you busy? Will you send \\\"\";\n\tstatic String w1c = \"\\\"?\";\n\t\n\tstatic long w1aLen = w1a.length();\n\tstatic long w1bLen = w1b.length();\n\t\n\tstatic String f1 = w1a+w0+w1b+w0+w1c;\n\t\n\tstatic long[] lens;\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint q = sc.nextInt();\n\t\tint n;\n\t\tlong k;\n\t\tlens = new long[54];\n\t\tfor(int j = 0; j < 54; j++) {\n\t\t\tlens[j] = -1;\n\t\t}\n\t\tfor(int i = 0; i < q; i++) {\n\t\t\tn = sc.nextInt();\t\t\n\t\t\tk = sc.nextLong();\t\n\t\t\tSystem.out.print(solve(n, k-1));\n\t\t}\n\t\treturn;\n\t}\n\t\n\tpublic static char solve(int n, long k) {\n\t\twhile(n >= 0) {\n\t\t\tif(k < 0 || k >= getLen(n)) {\n\t\t\t\treturn '.';\n\t\t\t}\t\t\n\t\t\tif(n == 0) return w0.charAt((int)k);\n\t\t\telse if(n == 1) return f1.charAt((int)k);\n\t\t\telse {\n\t\t\t\tlong nSub1Len = getLen(n-1);\t\t\t\t\n\t\t\t\tif(k < w1aLen) \n\t\t\t\t{\n\t\t\t\t\treturn w1a.charAt((int)(k));\n\t\t\t\t} \n\t\t\t\telse if(k >= w1aLen && k < w1aLen + nSub1Len) \n\t\t\t\t{\n\t\t\t\t\tn--;\n\t\t\t\t\tk-=w1aLen;\n\t\t\t\t} \n\t\t\t\telse if(k >= w1aLen + nSub1Len && k < w1aLen + nSub1Len+ w1bLen) \n\t\t\t\t{\n\t\t\t\t\treturn w1b.charAt((int)(k-w1aLen-nSub1Len));\n\t\t\t\t} \n\t\t\t\telse if(k >= w1aLen + nSub1Len+w1bLen && k < w1aLen + nSub1Len+w1bLen + nSub1Len) \n\t\t\t\t{\n\t\t\t\t\tn--;\n\t\t\t\t\tk-=(w1aLen + nSub1Len + w1bLen);\n\t\t\t\t} \n\t\t\t\telse \n\t\t\t\t{\n\t\t\t\t\treturn w1c.charAt((int)(k-w1aLen-nSub1Len-w1bLen-nSub1Len));\n\t\t\t\t}\t\n\t\t\t}\n\t\t}\n\t\treturn '.';\n\t}\n\t\n\tpublic static long getLen(int n) {\n\t\tif(n > 53) return getLen(53);\n\t\tif(lens[n] != -1) return lens[n];\t\n\t\tif(n == 0) {\n\t\t\tlens[n] = w0.length();\n\t\t\treturn lens[n];\n\t\t} else {\n\t\t\tlens[n] = w1a.length() + getLen(n-1) + w1b.length() + getLen(n-1) + w1c.length();\n\t\t\treturn lens[n];\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "binary search", "combinatorics"], "code_uid": "2961d362fa668e740d36d3dc332304df", "src_uid": "da09a893a33f2bf8fd00e321e16ab149", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\n\npublic class Balance {\n \n public static final int MOD = 51123987;\n public static int[][] combos = null;\n \n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n in.nextInt();\n String s = in.next();\n int len = s.length();\n int half = (len+1)/2;\n int[][][][] groupCounts = new int[half+2][half+2][half+2][3];\n int[][][][][] prevAdd = new int[half+2][half+2][half+2][3][3];\n // [i][j][k][-] = # of subsequences such that there are 'i' groups of a, 'j' groups of b, 'k' groups of c\n // [-][-][-][0] = # of such groups where the rightmost group is type 'a', [1] type 'b', [2] type 'c'\n //\n \n for (int i = 0; i < len; ++i) {\n char val = s.charAt(i);\n for (int a = 0; a <= i && a <= half; ++a) {\n for (int b = 0; a+b <= i && b <= half; ++b) {\n for (int c = 0; a+b+c <= i && c <= half; ++c) {\n if (a+b+c == 0) {\n groupCounts[val=='a'?1:0][val=='b'?1:0][val=='c'?1:0][val-'a'] = 1;\n continue;\n }\n int newAdd;\n if (val == 'a') {\n newAdd = groupCounts[a][b][c][1] - prevAdd[a][b][c][1][0];\n groupCounts[a+1][b][c][0] = mod(groupCounts[a+1][b][c][0] + newAdd, MOD);\n prevAdd[a][b][c][1][0] += newAdd;\n \n newAdd = groupCounts[a][b][c][2] - prevAdd[a][b][c][2][0];\n groupCounts[a+1][b][c][0] = mod(groupCounts[a+1][b][c][0] + newAdd, MOD);\n prevAdd[a][b][c][2][0] += newAdd;\n } else if (val == 'b') {\n newAdd = groupCounts[a][b][c][0] - prevAdd[a][b][c][0][1];\n groupCounts[a][b+1][c][1] = mod(groupCounts[a][b+1][c][1] + newAdd, MOD);\n prevAdd[a][b][c][0][1] += newAdd;\n \n newAdd = groupCounts[a][b][c][2] - prevAdd[a][b][c][2][1];\n groupCounts[a][b+1][c][1] = mod(groupCounts[a][b+1][c][1] + newAdd, MOD);\n prevAdd[a][b][c][2][1] += newAdd;\n } else { // val == 'c'\n newAdd = groupCounts[a][b][c][0] - prevAdd[a][b][c][0][2];\n groupCounts[a][b][c+1][2] = mod(groupCounts[a][b][c+1][2] + newAdd, MOD);\n prevAdd[a][b][c][0][2] += newAdd;\n \n newAdd = groupCounts[a][b][c][1] - prevAdd[a][b][c][1][2];\n groupCounts[a][b][c+1][2] = mod(groupCounts[a][b][c+1][2] + newAdd, MOD);\n prevAdd[a][b][c][1][2] += newAdd;\n }\n }\n }\n }\n }\n long total = 0;\n for (int a = 0; a <= half; ++a) {\n for (int b = 0; b <= half; ++b) {\n for (int c = 0; a+b+c <= len && c <= half; ++c) {\n long calc = calculate(a, b, c, len) % MOD;\n total += groupCounts[a][b][c][0] * calc;\n total += groupCounts[a][b][c][1] * calc;\n total += groupCounts[a][b][c][2] * calc;\n total %= MOD;\n }\n }\n }\n System.out.println(total);\n }\n \n public static int[][] getCombinations(int n, int m) {\n if (combos != null)\n return combos;\n combos = new int[n+1][n+1];\n combos[0][0] = 1;\n for (int row = 1; row <= n; ++row) {\n combos[row][0] = 1;\n for (int col = 1; col <= row; ++col) {\n combos[row][col] = combos[row-1][col-1] + combos[row-1][col];\n if (combos[row][col] >= m)\n combos[row][col] -= m;\n }\n }\n return combos;\n }\n \n public static long calculate(int a, int b, int c, int total) {\n getCombinations(total, MOD);\n long ret = 1;\n int goal = total/3;\n //SPECIAL CASE: at least one is zero\n if (a == 0 || b == 0 || c == 0) {\n // the only way this is possible is if total <= 2\n // total == 2: 0,1,1 , 1,0,1, 1,1,0\n // total == 1: 0,0,1 , 0,1,0 1,0,0\n if (total > 2)\n return 0;\n int sum = a + b + c;\n if (sum == total)\n return 1;\n return 0;\n }\n if (total % 3 == 0) {\n // each group must have the same total;\n if (a > goal || b > goal || c > goal)\n return 0;\n ret *= combos[goal-1][goal-a];\n ret *= combos[goal-1][goal-b];\n ret %= MOD;\n ret *= combos[goal-1][goal-c];\n ret %= MOD;\n } else if (total % 3 == 1) {\n long retPartial = 0;\n // try goal,goal,goal+1\n if (a <= goal && b <= goal && c <= goal+1) {\n ret *= combos[goal-1][goal-a];\n ret *= combos[goal-1][goal-b];\n ret %= MOD;\n ret *= combos[goal][goal-c+1];\n retPartial += ret;\n ret = 1;\n }\n // try goal,goal+1,goal\n if (a <= goal && b <= goal+1 && c <= goal) {\n ret *= combos[goal-1][goal-a];\n ret *= combos[goal][goal-b+1];\n ret %= MOD;\n ret *= combos[goal-1][goal-c];\n retPartial += ret;\n ret = 1;\n }\n // try goal+1,goal,goal\n if (a <= goal+1 && b <= goal && c <= goal) {\n ret *= combos[goal][goal-a+1];\n ret *= combos[goal-1][goal-b];\n ret %= MOD;\n ret *= combos[goal-1][goal-c];\n retPartial += ret;\n ret = 1;\n }\n ret = retPartial % MOD;\n } else { // total % 3 == 2\n long retPartial = 0;\n // try goal,goal+1,goal+1\n if (a <= goal && b <= goal+1 && c <= goal+1) {\n ret *= combos[goal-1][goal-a];\n ret *= combos[goal][goal-b+1];\n ret %= MOD;\n ret *= combos[goal][goal-c+1];\n retPartial += ret;\n ret = 1;\n }\n // try goal+1,goal,goal+1\n if (a <= goal+1 && b <= goal && c <= goal+1) {\n ret *= combos[goal][goal-a+1];\n ret *= combos[goal-1][goal-b];\n ret %= MOD;\n ret *= combos[goal][goal-c+1];\n retPartial += ret;\n ret = 1;\n }\n // try goal+1,goal+1,goal\n if (a <= goal+1 && b <= goal+1 && c <= goal) {\n ret *= combos[goal][goal-a+1];\n ret *= combos[goal][goal-b+1];\n ret %= MOD;\n ret *= combos[goal-1][goal-c];\n retPartial += ret;\n ret = 1;\n }\n ret = retPartial % MOD;\n }\n return ret;\n }\n \n public static int mod(int a, int m) {\n if (a < 0)\n a += m;\n if (a >= m)\n a -= m;\n return a;\n }\n}", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "771dc71a4751836fc0443abdbb76a4bd", "src_uid": "64fada10630906e052ff05f2afbf337e", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.PrintWriter;\nimport java.util.Scanner;\n\n\npublic class C {\n\n /**\n * @param args\n */\n public static void main(String[] args) {\n Subs subs = new Subs();\n subs.sol();\n subs.print();\n }\n\n}\n\nclass Subs {\n \n Subs() {\n Scanner scr = new Scanner(System.in);\n String fs = scr.nextLine();\n String ft = scr.nextLine();\n s = fs.toCharArray();\n t = ft.toCharArray();\n scr.close();\n }\n \n void sol() {\n //long[][] dp = new long[s.length + 1][t.length + 1]; - memory limit\n long[] pred = new long[s.length+1];\n long[] curr = new long[s.length+1];\n\n ans = 0;\n long save;\n for (int j = 1; j <= t.length; j++){\n save = pred[0];\n for (int i = 1; i <= s.length; i++){\n \n /* de facto, but it's too slowly\n if (s[i-1] == t[j-1]) {\n for (int k = 0; k < j; k++){\n dp[i][j] = (dp[i][j] + dp[i-1][k]) % M;\n }\n dp[i][j] += 1;\n ans = (ans + dp[i][j]) % M;\n */\n \n //dp[i][j] = dp[i][j-1]; \n curr[i] = pred[i];\n if (s[i-1] == t[j-1]){\n //dp[i][j] = (dp[i][j] + dp[i-1][j-1] + 1) % M;\n curr[i] = (curr[i] + save + 1) % M;\n }\n save = pred[i];\n pred[i] = curr[i];\n }\n }\n for (int i = 1; i <= s.length; i++){\n //ans = (ans + dp[i][t.length]) % M;\n ans = (ans + curr[i]) % M;\n }\n }\n \n void print() {\n PrintWriter pw = new PrintWriter(System.out);\n pw.println(ans);\n pw.flush();\n pw.close();\n }\n\n long ans;\n char[] s;\n char[] t;\n static final int M = 1000000007;\n}", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "733b17ae13576c02b208d9a4a88e2eee", "src_uid": "4022f8f796d4f2b7e43a8360bf34e35f", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "\r\nimport java.io.BufferedReader;\r\nimport java.io.IOException;\r\nimport java.io.InputStreamReader;\r\nimport java.io.StreamTokenizer;\r\n\r\npublic class CF1528E {\r\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\r\n StreamTokenizer st = new StreamTokenizer(br);\r\n\r\n final int N = (int) (1e6 + 10);\r\n final int M = 998244353;\r\n\r\n long[] dp = new long[N], dp1 = new long[N], dp2 = new long[N];\r\n\r\n private long readLong() throws IOException {\r\n st.nextToken();\r\n return (long) st.nval;\r\n }\r\n\r\n private int readInt() throws IOException {\r\n st.nextToken();\r\n return (int) st.nval;\r\n }\r\n\r\n private String readString() throws Exception {\r\n st.nextToken();\r\n return st.sval;\r\n }\r\n\r\n public static void main(String[] args) throws Exception {\r\n new CF1528E().run();\r\n }\r\n\r\n long inv(long a) {\r\n return inv(a, M);\r\n }\r\n\r\n public long inv(long a, long mod) {\r\n long b = mod;\r\n long p = 1, q = 0;\r\n while (b > 0) {\r\n long c = a / b;\r\n long d;\r\n d = a;\r\n a = b;\r\n b = d % b;\r\n d = p;\r\n p = q;\r\n q = d - c * q;\r\n }\r\n return p < 0 ? p + mod : p;\r\n }\r\n\r\n long g(int n) {\r\n if (n < 0)\r\n return 0;\r\n long t = dp[n];\r\n long res = (t * (t + 1)) % M;\r\n res = (res * (t + 5)) % M;\r\n res = (res * inv(3)) % M;\r\n return (res + M) % M;\r\n }\r\n\r\n\r\n private void run() throws Exception {\r\n int n = readInt();\r\n dp[0] = dp1[0] = dp2[0] = 1;\r\n\r\n for (int i = 1; i <= n; i++) {\r\n dp[i] = ((dp[i - 1] + 1) * (dp[i - 1] + 2) / 2) % M;\r\n dp1[i] = dp[i] - dp[i - 1];\r\n dp2[i] = dp1[i] - dp1[i - 1];\r\n }\r\n long res = (g(n - 1) - g(n - 2)) % M;\r\n for (int i = 0; i < n; i++)\r\n res = (res + dp2[i] * dp1[n - 1 - i]) % M;\r\n res = (res + M) % M;\r\n System.out.println(res);\r\n }\r\n}\r\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "trees"], "code_uid": "f10b4cf7f884e599e3ae5bb7b9fc2204", "src_uid": "92939054045c089cd25c8f4e7b9ffcf2", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\r\nimport java.util.*;\r\n\r\npublic class Main {\r\n static Reader r = new Reader();\r\n static StringBuilder sb = new StringBuilder();\r\n static final int p = 1_000_000_007;\r\n\r\n public static ArrayList<Integer> primeList(int n){\r\n // return prime numbers less than or equal to n\r\n if(n==1) return new ArrayList<>();\r\n ArrayList<Integer> prime = new ArrayList<>();\r\n prime.add(2);\r\n if(n==2) return prime;\r\n\r\n boolean[] isPrime = new boolean[(n-1)/2];\r\n Arrays.fill(isPrime,true);\r\n for(int i=0;(2*i+3)*(2*i+3)<=n;i++){\r\n if(!isPrime[i]) continue;\r\n for(int j=((2*i+3)*(2*i+3)-3)/2;j<(n-1)/2;j+=(2*i+3))\r\n isPrime[j] = false;\r\n }\r\n for(int i=0;i<(n-1)/2;i++){\r\n if(isPrime[i]) prime.add(2*i+3);\r\n }\r\n return prime;\r\n }\r\n static int gcd(int n, int m){\r\n if(n==0) return (m>0)?m:-m;\r\n return gcd(m%n, n);\r\n }\r\n\r\n\r\n public static void main(String args[]) throws IOException {\r\n int n = r.readInt();\r\n ArrayList<Integer> prime = primeList((int)Math.sqrt(n));\r\n ArrayList<Integer>[] div = new ArrayList[n+1];\r\n int[] phi = new int[n+1];\r\n for(int i=1;i<=n;i++)\r\n div[i] = new ArrayList<>();\r\n for(int i=1;i<=n/2;i++){\r\n for(int j=2*i;j<=n;j+=i){\r\n div[j].add(i);\r\n }\r\n }\r\n for(int i=1;i<=n;i++){\r\n int m = i;\r\n int ans = m;\r\n for(int p:prime){\r\n if(p>Math.sqrt(m)) break;\r\n if(m%p!=0) continue;\r\n ans = (ans/p)*(p-1);\r\n while(m%p==0)\r\n m/=p;\r\n }\r\n if(m>1) ans = (ans/m)*(m-1);\r\n phi[i] = ans;\r\n }\r\n long cnt = 0;\r\n for(int k=1;k<n;k++){\r\n for(int d:div[k]){\r\n cnt += (long) phi[k/d]*d*(n-k)/gcd(d,n-k);\r\n cnt %= p;\r\n }\r\n }\r\n System.out.println(cnt);\r\n }\r\n}\r\nclass Reader {\r\n final private int BUFFER_SIZE = 1 << 16;\r\n private DataInputStream din;\r\n private byte[] buffer;\r\n private int bufferPointer, bytesRead;\r\n\r\n public Reader() {\r\n din = new DataInputStream(System.in);\r\n buffer = new byte[BUFFER_SIZE];\r\n bufferPointer = bytesRead = 0;\r\n }\r\n\r\n public String readLine() throws IOException {\r\n byte[] buf = new byte[1000000]; // line length\r\n int cnt = 0, c;\r\n while((c=read())!=-1){\r\n if(c=='\\n'){\r\n if(cnt!=0) break;\r\n else continue;\r\n }\r\n buf[cnt++] = (byte)c;\r\n }\r\n return new String(buf, 0, cnt);\r\n }\r\n\r\n public int readInt() throws IOException {\r\n int ret = 0;\r\n byte c = read();\r\n while(c <= ' '){ c = read();}\r\n boolean neg = (c == '-');\r\n if(neg) c = read();\r\n do{\r\n ret = (ret<<3) + (ret<<1) + c - '0';\r\n } while ((c = read()) >= '0' && c <= '9');\r\n return neg ? -ret : ret;\r\n }\r\n\r\n public long readLong() throws IOException {\r\n long ret = 0;\r\n byte c = read();\r\n while(c <= ' '){ c = read();}\r\n boolean neg = (c == '-');\r\n if(neg) c = read();\r\n do{\r\n ret = (ret<<3) + (ret<<1) + c - '0';\r\n } while ((c = read()) >= '0' && c <= '9');\r\n return neg ? -ret : ret;\r\n }\r\n\r\n private void fillBuffer() throws IOException {\r\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\r\n if(bytesRead == -1) buffer[0] = -1;\r\n }\r\n\r\n private byte read() throws IOException {\r\n if(bufferPointer == bytesRead) fillBuffer();\r\n return buffer[bufferPointer++];\r\n }\r\n\r\n public void close() throws IOException {\r\n if(din==null) return;\r\n din.close();\r\n }\r\n}", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "47d01fd196780c84c9c4ad4abe1b0150", "src_uid": "c3694a6ff95c64bef8cbe8834c3fd6cb", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastScanner in = new FastScanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskD solver = new TaskD();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskD {\n public void solve(int testNumber, FastScanner in, PrintWriter out) {\n char[][] s = new char[][]{in.next().toCharArray(), in.next().toCharArray()};\n for (char[] c : s) {\n for (int i = 0; i < c.length; i++) {\n if (c[i] == 'C') {\n c[i] = 'B';\n }\n }\n }\n int q = in.nextInt();\n\n int[][][] count = new int[2][][];\n int[][] sufA = new int[2][];\n for (int i = 0; i < 2; i++) {\n count[i] = count(s[i]);\n sufA[i] = sufA(s[i]);\n }\n int[][] info = new int[2][3];\n for (int i = 0; i < q; i++) {\n int l1 = in.nextInt() - 1, r1 = in.nextInt();\n int l2 = in.nextInt() - 1, r2 = in.nextInt();\n\n info[0][0] = count[0][0][r1] - count[0][0][l1];\n info[0][1] = count[0][1][r1] - count[0][1][l1];\n info[0][2] = Math.min(sufA[0][r1 - 1], r1 - l1);\n\n info[1][0] = count[1][0][r2] - count[1][0][l2];\n info[1][1] = count[1][1][r2] - count[1][1][l2];\n info[1][2] = Math.min(sufA[1][r2 - 1], r2 - l2);\n out.print(can(info[0], info[1]) ? '1' : '0');\n }\n }\n\n private boolean can(int[] a, int[] b) {\n a[0] -= a[2];\n b[0] -= b[2];\n if (a[2] < b[2]) {\n return false;\n }\n if (a[2] % 3 == b[2] % 3) {\n if (can2(a, b)) {\n return true;\n }\n }\n a[2]--;\n a[1] += 2;\n\n a[0] += a[2] - b[2];\n return can2(a, b);\n }\n\n private boolean can2(int[] a, int[] b) {\n if (a[0] < 0 || a[1] < 0) {\n return false;\n }\n if (a[1] > b[1]) {\n return false;\n }\n if (a[1] % 2 != b[1] % 2) {\n return false;\n }\n if (b[1] > a[1] && (a[0] + a[1] == 0)) {\n return false;\n }\n return true;\n }\n\n private int[] sufA(char[] chars) {\n int[] a = new int[chars.length];\n for (int i = 0; i < chars.length; i++) {\n if (chars[i] == 'A') {\n a[i] = (i == 0 ? 0 : a[i - 1]) + 1;\n } else {\n a[i] = 0;\n }\n }\n return a;\n }\n\n private int[][] count(char[] chars) {\n int[][] a = new int[2][chars.length + 1];\n for (int i = 0; i < chars.length; i++) {\n a[0][i + 1] += a[0][i];\n a[1][i + 1] += a[1][i];\n a[chars[i] - 'A'][i + 1]++;\n }\n return a;\n }\n\n }\n\n static class FastScanner {\n BufferedReader br;\n StringTokenizer st;\n\n public FastScanner(InputStream in) {\n br = new BufferedReader(new InputStreamReader(in));\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public String next() {\n while (st == null || !st.hasMoreElements()) {\n String line = null;\n try {\n line = br.readLine();\n } catch (IOException e) {\n }\n st = new StringTokenizer(line);\n }\n return st.nextToken();\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["strings", "constructive algorithms", "implementation"], "code_uid": "831d23e8a68f5846188160a5302d8e7a", "src_uid": "98e3182f047a7e7b10be7f207b219267", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import static java.lang.Double.parseDouble;\nimport static java.lang.Integer.parseInt;\nimport static java.lang.Long.parseLong;\nimport static java.lang.System.exit;\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\nimport java.math.BigInteger;\nimport java.util.StringTokenizer;\n\npublic class F {\n\t\n\tstatic BufferedReader in;\n\tstatic PrintWriter out;\n\tstatic StringTokenizer tok;\n\t\n\tstatic void solve() throws Exception {\n\t\tint n = nextInt();\n\t\tint p = nextInt();\n\t\tint q = nextInt();\n\t\tif (p >= n) {\n\t\t\tp = n - 1;\n\t\t}\n\t\tint c[] = new int[p + 1];\n\t\tc[0] = 1;\n\t\tfor (int i = 1, val = 1, pow = 0; i <= p; i++) {\n\t\t\tint mul = n - i + 1;\n\t\t\tint shift = Integer.numberOfTrailingZeros(mul);\n\t\t\tval *= mul >> shift;\n\t\t\tpow += shift;\n\t\t\tmul = i;\n\t\t\tshift = Integer.numberOfTrailingZeros(mul);\n\t\t\tval *= BigInteger.valueOf(mul >> shift).modInverse(BigInteger.valueOf(0x100000000L)).intValue();\n\t\t\tpow -= shift;\n\t\t\tc[i] = pow >= 32 ? 0 : val << pow;\n\t\t}\n\t\tint ans = 0;\n\t\tfor (int day = 1; day <= q; day++) {\n\t\t\tint cans = 0;\n\t\t\tfor (int i = 0, pow = 1; i <= p; i++, pow *= day) {\n\t\t\t\tcans += c[i] * pow;\n\t\t\t}\n\t\t\tans ^= day * cans;\n\t\t}\n\t\tout.print(ans & 0xffffffffL);\n\t}\n\t\n\tstatic int nextInt() throws IOException {\n\t\treturn parseInt(next());\n\t}\n\n\tstatic long nextLong() throws IOException {\n\t\treturn parseLong(next());\n\t}\n\n\tstatic double nextDouble() throws IOException {\n\t\treturn parseDouble(next());\n\t}\n\n\tstatic String next() throws IOException {\n\t\twhile (tok == null || !tok.hasMoreTokens()) {\n\t\t\ttok = new StringTokenizer(in.readLine());\n\t\t}\n\t\treturn tok.nextToken();\n\t}\n\n\tpublic static void main(String[] args) {\n\t\ttry {\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(new OutputStreamWriter(System.out));\n\t\t\tsolve();\n\t\t\tin.close();\n\t\t\tout.close();\n\t\t} catch (Throwable e) {\n\t\t\te.printStackTrace();\n\t\t\texit(1);\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["combinatorics"], "code_uid": "9127aa84b20f532471c0fdf651711e40", "src_uid": "28cf4ff955d089318ea08d17bc4f43da", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.BufferedWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class VK16_3F {\n\n\tstatic int B;\n\tstatic int P;\n\tstatic int Q;\n\n\tstatic long[] iFact;\n\tstatic long[] iFact2;\n\n\tpublic static void main0(String[] args) {\n\t\tSystem.out.println(Integer.toUnsignedString(inv(7)));\n\t}\n\n\tstatic int[] numF;\n\tstatic int[] numFP;\n\tstatic int[] iNumF;\n\n\tstatic int[] denF;\n\tstatic int[] denFP;\n\tstatic int[] iDenF;\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n\t\tPrintWriter printer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n\t\tStringTokenizer inputData = new StringTokenizer(reader.readLine());\n\n\t\tB = Integer.parseInt(inputData.nextToken());\n\t\tP = Integer.parseInt(inputData.nextToken());\n\t\tP = Math.min(P, B);\n\t\tQ = Integer.parseInt(inputData.nextToken());\n\n\t\tnumF = new int[P * 2 + 1];\n\t\tnumF[0] = 1;\n\t\tnumFP = new int[P * 2 + 1];\n\n\t\tiNumF = new int[P * 2 + 1];\n\n\t\tfor (int i = 1; i <= P * 2; i++) {\n\t\t\tint cPow = Integer.numberOfTrailingZeros(B - i + 1);\n\t\t\tnumF[i] = numF[i - 1] * ((B - i + 1) >> cPow);\n\t\t\tnumFP[i] = numFP[i - 1] + cPow;\n\t\t}\n\n\t\tfor (int i = 0; i <= P * 2; i++) {\n\t\t\tiNumF[i] = inv(numF[i]);\n\t\t}\n\n\t\tdenF = new int[P * 2 + 1];\n\t\tdenF[0] = 1;\n\t\tdenFP = new int[P * 2 + 1];\n\n\t\tiDenF = new int[P * 2 + 1];\n\n\t\tfor (int i = 1; i <= P * 2; i++) {\n\t\t\tint cPow = Integer.numberOfTrailingZeros(i);\n\t\t\tdenF[i] = denF[i - 1] * (i >> cPow);\n\t\t\tdenFP[i] = denFP[i - 1] + cPow;\n\t\t}\n\n\t\tfor (int i = 0; i <= P * 2; i++) {\n\t\t\tiDenF[i] = inv(denF[i]);\n\t\t}\n\n\t\tint ans = 0;\n\t\tfor (int n = 1; n <= Q; n++) {\n\t\t\tans ^= n * calculate(n);\n\t\t}\n\t\tprinter.println(Integer.toUnsignedString(ans));\n\t\tprinter.close();\n\t}\n\n\tstatic int calculate(int n) {\n\t\tint cPow = 1;\n\t\tint sum = 0;\n\t\tint endI = Math.min(P, B - 1);\n\t\tfor (int i = 0; i <= endI; i++) {\n\t\t\tsum += comb(B, i) * cPow;\n\t\t\tcPow *= n;\n\t\t}\n\t\treturn sum;\n\t}\n\n\tstatic int comb(int n, int k) {\n\t\tint off = B - n;\n\t\tint cNumF = numF[k + off] * iNumF[off];\n\t\tint cNumP = numFP[k + off] - numFP[off];\n\t\treturn (cNumF * iDenF[k]) << (cNumP - denFP[k]);\n\t}\n\n\tstatic int inv(int n) {\n\t\tint x = 1;\n\t\tx = x * (2 - x * n); /* Newton's method */\n\t\tx = x * (2 - x * n); /* 5 steps enough for 32 bits */\n\t\tx = x * (2 - x * n);\n\t\tx = x * (2 - x * n);\n\t\tx = x * (2 - x * n);\n\t\treturn x;\n\t}\n}\n", "lang_cluster": "Java", "tags": ["meet-in-the-middle", "math", "dp"], "code_uid": "55d1219c3d805681432f1433a7cd0558", "src_uid": "28cf4ff955d089318ea08d17bc4f43da", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package educational.round11;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class EE {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t\tint n = ni(), m = ni();\n\t\tint mod = 1000000007;\n\t\tlong ret = 2L*m;\n\t\tlong f = m;\n\t\tfor(int i = 2;i <= n;i++){\n\t\t\tret = ret * (2*m-1) + f;\n\t\t\tf = f * m;\n\t\t\tret %= mod;\n\t\t\tf %= mod;\n\t\t}\n\t\tout.println(ret);\n\t}\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new EE().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tprivate int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["combinatorics"], "code_uid": "79fa4a115711d317d365928b365681d3", "src_uid": "5b775f17b188c1d8a4da212ebb3a525c", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.HashSet;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Anand Iyer\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastScanner in = new FastScanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC {\n public static boolean angle(TaskC.Point a, TaskC.Point b) {\n double amag = a.mag();\n double bmag = b.mag();\n double abmag = a.v * b.v + a.w * b.w + a.x * b.x + a.y * b.y + a.z * b.z;\n double angle = Math.toDegrees(Math.acos(abmag / (amag * bmag)));\n if (angle < 90) {\n return true;\n }\n return false;\n }\n\n public void solve(int testNumber, FastScanner in, PrintWriter out) {\n int n = in.nextInt();\n if (n > 11) {\n out.println(\"0\");\n } else {\n HashSet<Integer> good = new HashSet<Integer>();\n ArrayList<TaskC.Point> arr = new ArrayList<>();\n for (int i = 0; i < n; i++) {\n int a = in.nextInt();\n int b = in.nextInt();\n int c = in.nextInt();\n int d = in.nextInt();\n int e = in.nextInt();\n TaskC.Point p = new TaskC.Point(a, b, c, d, e);\n arr.add(p);\n }\n for (int i = 0; i < n; i++) {\n boolean b = true;\n for (int j = 0; j < n; j++) {\n for (int k = 0; k < n; k++) {\n if (i != j && i != k && j != k) {\n TaskC.Point one = arr.get(j);\n TaskC.Point two = arr.get(k);\n TaskC.Point three = arr.get(i);\n TaskC.Point lol2 = new TaskC.Point(one.v - three.v, one.w - three.w, one.x - three.x, one.y - three.y, one.z - three.z);\n TaskC.Point lol1 = new TaskC.Point(two.v - three.v, two.w - three.w, two.x - three.x, two.y - three.y, two.z - three.z);\n if (angle(lol1, lol2)) {\n b = false;\n }\n }\n }\n }\n if (b) {\n good.add(i + 1);\n }\n }\n if (good.size() == 0) {\n out.println(\"0\");\n } else {\n out.println(good.size());\n for (int i : good) {\n out.println(i);\n }\n }\n }\n }\n\n public static class Point {\n int v;\n int w;\n int x;\n int y;\n int z;\n\n public Point(int a, int b, int c, int d, int e) {\n v = a;\n w = b;\n x = c;\n y = d;\n z = e;\n }\n\n public double mag() {\n return Math.sqrt(v * v + w * w + x * x + y * y + z * z);\n }\n\n }\n\n }\n\n static class FastScanner {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public FastScanner(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "geometry"], "code_uid": "35f32d7bcf43bc5b108927780783c644", "src_uid": "c1cfe1f67217afd4c3c30a6327e0add9", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.HashSet;\nimport java.util.StringTokenizer;\nimport java.util.Set;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Yogesh Kumar a.k.a DREAMPLAY\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n// System.out.println(Math.toDegrees(Math.acos(0.5)));\n int n = in.nextInt();\n if (n >= 100) {\n out.print(0);\n } else {\n int[] a = new int[105];\n int[] b = new int[105];\n int[] c = new int[105];\n int[] d = new int[105];\n int[] e = new int[105];\n for (int i = 1; i <= n; i++) {\n a[i] = in.nextInt();\n b[i] = in.nextInt();\n c[i] = in.nextInt();\n d[i] = in.nextInt();\n e[i] = in.nextInt();\n }\n\n Set<Integer> bad = new HashSet<>();\n\n for (int i = 1; i <= n; i++) {\n for (int j = 1; j <= n; j++) {\n for (int k = 1; k <= n; k++) {\n if (i == j || j == k || k == i) {\n continue;\n }\n\n long ax = a[j] - a[i];\n long bx = b[j] - b[i];\n long cx = c[j] - c[i];\n long dx = d[j] - d[i];\n long ex = e[j] - e[i];\n\n long ay = a[k] - a[i];\n long by = b[k] - b[i];\n long cy = c[k] - c[i];\n long dy = d[k] - d[i];\n long ey = e[k] - e[i];\n\n double val = ax * ay + bx * by + cx * cy + dx * dy + ex * ey;\n long m1 = ax * ax + bx * bx + cx * cx + dx * dx + ex * ex;\n long m2 = ay * ay + by * by + cy * cy + dy * dy + ey * ey;\n val = val / Math.sqrt(m1);\n val = val / Math.sqrt(m2);\n if (Math.toDegrees(Math.acos(val)) + 0.000000001 < 90) {\n bad.add(i);\n }\n }\n }\n }\n\n out.println(n - bad.size());\n\n for (int i = 1; i <= n; i++) {\n if (!bad.contains(i)) {\n out.println(i);\n }\n }\n }\n }\n\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["brute force", "math", "geometry"], "code_uid": "75292dcc6f464d4ba8ac1c1a2395b5ec", "src_uid": "c1cfe1f67217afd4c3c30a6327e0add9", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n/*\nTASK: fivedimpoints\nLANG: JAVA\n */\n\npublic class fivedimpoints{\n static int n;\n static int[][] coord;\n static long[][][] vect;\n static boolean[] bad;\n \n public static void main(String[] args) throws IOException{\n FastScanner in = new FastScanner(System.in); \n n = in.nextInt();\n if(n > 11){\n System.out.println(0);\n return;\n }\n coord = new int[n][5];\n vect = new long[n][n][5];\n bad = new boolean[n];\n for(int i = 0;i <n; i++){\n for(int j = 0;j < 5;j++){\n coord[i][j] = in.nextInt();\n }\n }\n for(int i = 0;i < n; i++){\n for(int j = 0;j < n; j++){\n for(int k = 0; k < 5; k++){\n vect[i][j][k] = coord[j][k] - coord[i][k];\n }\n }\n }\n int count = n;\n long prod;\n for(int i = 0;i < n; i++){\n for(int j = 0;j < n; j++){\n if(j != i){\n for(int k = 0; k < n; k++){\n if(k != j && k != i){\n prod = 0;\n for(int m = 0; m < 5; m++){\n prod += vect[j][i][m]*vect[k][i][m];\n }\n if(prod > 0 && !bad[i]){\n bad[i] = true;\n count--;\n }\n }\n }\n }\n }\n }\n System.out.println(count);\n for(int i = 0;i < n; i++){\n if(!bad[i]){\n System.out.println(i+1);\n }\n }\n }\n}\nclass FastScanner{\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n\n public FastScanner(InputStream stream) {\n this.stream = stream;\n }\n int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) return -1;\n }\n return buf[curChar++];\n }\n\n boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n boolean isEndline(int c) {\n return c == '\\n' || c == '\\r' || c == -1;\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public String next() {\n int c = read();\n while (isSpaceChar(c)) c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n public String nextLine() {\n int c = read();\n while (isEndline(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isEndline(c));\n return res.toString();\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "geometry"], "code_uid": "4c3bdc277cd4737db983d03abe74bca6", "src_uid": "c1cfe1f67217afd4c3c30a6327e0add9", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.HashSet;\nimport java.util.StringTokenizer;\nimport java.util.Set;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Yogesh Kumar a.k.a DREAMPLAY\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n// System.out.println(Math.toDegrees(Math.acos(0.5)));\n int n = in.nextInt();\n if (n >= 100) {\n out.print(0);\n } else {\n int[] a = new int[105];\n int[] b = new int[105];\n int[] c = new int[105];\n int[] d = new int[105];\n int[] e = new int[105];\n for (int i = 1; i <= n; i++) {\n a[i] = in.nextInt();\n b[i] = in.nextInt();\n c[i] = in.nextInt();\n d[i] = in.nextInt();\n e[i] = in.nextInt();\n }\n\n Set<Integer> bad = new HashSet<>();\n\n for (int i = 1; i <= n; i++) {\n for (int j = 1; j <= n; j++) {\n for (int k = 1; k <= n; k++) {\n if (i == j || j == k || k == i) {\n continue;\n }\n\n long ax = a[j] - a[i];\n long bx = b[j] - b[i];\n long cx = c[j] - c[i];\n long dx = d[j] - d[i];\n long ex = e[j] - e[i];\n\n long ay = a[k] - a[i];\n long by = b[k] - b[i];\n long cy = c[k] - c[i];\n long dy = d[k] - d[i];\n long ey = e[k] - e[i];\n\n double val = ax * ay + bx * by + cx * cy + dx * dy + ex * ey;\n long m1 = ax * ax + bx * bx + cx * cx + dx * dx + ex * ex;\n long m2 = ay * ay + by * by + cy * cy + dy * dy + ey * ey;\n val = val / Math.sqrt(m1);\n val = val / Math.sqrt(m2);\n if (Math.toDegrees(Math.acos(val)) + 0.000000001 < 90) {\n bad.add(i);\n }\n }\n }\n }\n\n out.println(n - bad.size());\n\n for (int i = 1; i <= n; i++) {\n if (!bad.contains(i)) {\n out.println(i);\n }\n }\n }\n }\n\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "geometry"], "code_uid": "fa78df1a271b6fb1f3bbd11d45507e49", "src_uid": "c1cfe1f67217afd4c3c30a6327e0add9", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\nimport java.lang.*;\n \nimport static java.lang.Math.*;\n \npublic class Main implements Runnable\n{\n\tstatic class InputReader\n\t{\n\t\tprivate InputStream stream;\n\t\tprivate byte[] buf = new byte[1024];\n\t\tprivate int curChar;\n\t\tprivate int numChars;\n\t\tprivate SpaceCharFilter filter;\n\t\tprivate BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\n\t\tpublic InputReader(InputStream stream)\n\t\t{\n\t\t\tthis.stream = stream;\n\t\t}\n\t\t\n\t\tpublic int read()\n\t\t{\n\t\t\tif (numChars==-1) \n\t\t\t\tthrow new InputMismatchException();\n\t\t\t\n\t\t\tif (curChar >= numChars)\n\t\t\t{\n\t\t\t\tcurChar = 0;\n\t\t\t\ttry \n\t\t\t\t{\n\t\t\t\t\tnumChars = stream.read(buf);\n\t\t\t\t}\n\t\t\t\tcatch (IOException e)\n\t\t\t\t{\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(numChars <= 0)\t\t\t\t\n\t\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn buf[curChar++];\n\t\t}\n\t \n\t\tpublic String nextLine()\n\t\t{\n\t\t\tString str = \"\";\n try\n {\n str = br.readLine();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n return str;\n\t\t}\n\t\tpublic int nextInt()\n\t\t{\n\t\t\tint c = read();\n\t\t\t\n\t\t\twhile(isSpaceChar(c)) \n\t\t\t\tc = read();\n\t\t\t\n\t\t\tint sgn = 1;\n\t\t\t\n\t\t\tif (c == '-') \n\t\t\t{\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\t\n\t\t\tint res = 0;\n\t\t\tdo \n\t\t\t{\n\t\t\t\tif(c<'0'||c>'9') \n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\twhile (!isSpaceChar(c)); \n\t\t\t\n\t\t\treturn res * sgn;\n\t\t}\n\t\t\n\t\tpublic long nextLong() \n\t\t{\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-') \n\t\t\t{\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\t\n\t\t\tdo \n\t\t\t{\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\twhile (!isSpaceChar(c));\n\t\t\t\treturn res * sgn;\n\t\t}\n\t\t\n\t\tpublic double nextDouble() \n\t\t{\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-') \n\t\t\t{\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tdouble res = 0;\n\t\t\twhile (!isSpaceChar(c) && c != '.') \n\t\t\t{\n\t\t\t\tif (c == 'e' || c == 'E')\n\t\t\t\t\treturn res * Math.pow(10, nextInt());\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tif (c == '.') \n\t\t\t{\n\t\t\t\tc = read();\n\t\t\t\tdouble m = 1;\n\t\t\t\twhile (!isSpaceChar(c)) \n\t\t\t\t{\n\t\t\t\t\tif (c == 'e' || c == 'E')\n\t\t\t\t\t\treturn res * Math.pow(10, nextInt());\n\t\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t\tm /= 10;\n\t\t\t\t\tres += (c - '0') * m;\n\t\t\t\t\tc = read();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn res * sgn;\n\t\t}\n\t\t\n\t\tpublic String readString() \n\t\t{\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo \n\t\t\t{\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t} \n\t\t\twhile (!isSpaceChar(c));\n\t\t\t\n\t\t\treturn res.toString();\n\t\t}\n\t \n\t\tpublic boolean isSpaceChar(int c) \n\t\t{\n\t\t\tif (filter != null)\n\t\t\t\treturn filter.isSpaceChar(c);\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n\t \n\t\tpublic String next() \n\t\t{\n\t\t\treturn readString();\n\t\t}\n\t\t\n\t\tpublic interface SpaceCharFilter \n\t\t{\n\t\t\tpublic boolean isSpaceChar(int ch);\n\t\t}\n\t}\n \t\n\tpublic static void main(String args[]) throws Exception\n\t{\n\t\tnew Thread(null, new Main(),\"Main\",1<<26).start();\n\t}\n \n\tint findAngle(Point p1, Point p2)\n {\n return p1.a * p2.a + p1.b * p2.b + p1.c * p2.c + p1.d * p2.d + p1.e * p2.e;\n }\n \n\tPoint makeVector(Point p1, Point p2)\n {\n return new Point(p1.a - p2.a, p1.b - p2.b, p1.c - p2.c, p1.d - p2.d, p1.e - p2.e);\n }\n \n public void run()\n\t{\n\t\tInputReader sc = new InputReader(System.in);\n\t\tPrintWriter w = new PrintWriter(System.out);\n\t\tint n = sc.nextInt();\n \n if(n > 20)\n {\n w.print(\"0\");\n w.close();\n return;\n }\n\n Point point[] = new Point[n];\n for(int i = 0; i < n; ++i)\n {\n point[i] = new Point(sc.nextInt(), sc.nextInt(), sc.nextInt(), sc.nextInt(), sc.nextInt());\n }\n\n ArrayList<Integer> ans = new ArrayList<>();\n for(int i = 0; i < n; ++i)\n {\n int flag = 0;\n midloop:for(int j = 0; j < n; ++j)\n {\n for(int k= 0; k< n && j != i; ++k)\n {\n if(k != j && k != i)\n {\n Point p1 = makeVector(point[i], point[j]);\n Point p2 = makeVector(point[i], point[k]);\n int value = findAngle(p1, p2);\n if(value > 0)\n {\n flag = 1;\n break midloop;\n }\n }\n }\n }\n if(flag == 0)\n ans.add(i);\n }\n\n w.println(ans.size());\n for(int i = 0; i < ans.size(); ++i)\n {\n w.println((ans.get(i) + 1));\n }\n\t\tw.close();\t\t\n\t}\n}\nclass Point\n{\n int a,b,c,d,e;\n Point(int a, int b, int c, int d, int e)\n {\n this.a = a;\n this.b = b;\n this.c = c;\n this.d = d;\n this.e = e;\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "geometry"], "code_uid": "01d082e69580654745140b065b301046", "src_uid": "c1cfe1f67217afd4c3c30a6327e0add9", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class P851C\n{\n\tstatic double eps = 1e-9;\n\tpublic static void main(String[] args)\n\t{\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tif (n > 11)\n\t\t{\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\t\tint[][] arr = new int[n][5];\n\t\tfor (int i = 0; i < n; i++)\n\t\t{\n\t\t\tfor (int j = 0; j < 5; j++)\n\t\t\t{\n\t\t\t\tarr[i][j] = scan.nextInt();\n\t\t\t}\n\t\t}\n\t\tArrayList<Integer> list = new ArrayList<>();\n\t\tfor (int i = 0; i < n; i++)\n\t\t{\n\t\t\tboolean good = true;\n\t\t\tLoop:\n\t\t\tfor (int j = 0; j < n; j++)\n\t\t\t{\n\t\t\t\tif (j == i)\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (int k = j+1; k < n; k++)\n\t\t\t\t{\n\t\t\t\t\tif (k == i)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tVector v1 = new Vector(arr[i], arr[j]);\n\t\t\t\t\tVector v2 = new Vector(arr[i], arr[k]);\n\t\t\t\t\tdouble angle = Math.acos(v1.prod(v2)/(v1.mag()*v2.mag()));\n\t\t\t\t\tif (angle < Math.PI/2-eps)\n\t\t\t\t\t{\n\t\t\t\t\t\tgood = false;\n\t\t\t\t\t\tbreak Loop;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (good)\n\t\t\t\tlist.add(i+1);\n\t\t}\n\t\tSystem.out.println(list.size());\n\t\tfor (int i : list)\n\t\t\tSystem.out.println(i);\n\t}\n\tstatic class Vector\n\t{\n\t\tint[] arr = new int[5];\n\t\tVector(int[] a, int[] b)\n\t\t{\n\t\t\tfor (int i = 0; i < 5; i++)\n\t\t\t{\n\t\t\t\tarr[i] = b[i]-a[i];\n\t\t\t}\n\t\t}\n\t\tdouble mag()\n\t\t{\n\t\t\tdouble sum = 0;\n\t\t\tfor (int i = 0; i < arr.length; i++)\n\t\t\t{\n\t\t\t\tsum += arr[i]*arr[i];\n\t\t\t}\n\t\t\treturn Math.sqrt(sum);\n\t\t}\n\t\tint prod(Vector v)\n\t\t{\n\t\t\tint sum = 0;\n\t\t\tfor (int i = 0; i < arr.length; i++)\n\t\t\t{\n\t\t\t\tsum += arr[i]*v.arr[i];\n\t\t\t}\n\t\t\treturn sum;\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "geometry"], "code_uid": "16776243ac3292de11a14238314adfea", "src_uid": "c1cfe1f67217afd4c3c30a6327e0add9", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\nimport java.util.ArrayList;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Yuan Lei\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scanner in = new Scanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC {\n public void solve(int testNumber, Scanner in, PrintWriter out) {\n int n = in.nextInt();\n if (n > 40) {\n out.println(0);\n return;\n } else {\n final ArrayList<TaskC.Point> points = new ArrayList<>();\n for (int i = 0; i < n; ++i) {\n int a, b, c, d, e;\n a = in.nextInt();\n b = in.nextInt();\n c = in.nextInt();\n d = in.nextInt();\n e = in.nextInt();\n points.add(new TaskC.Point(a, b, c, d, e));\n }\n if (n < 3) {\n out.println(n);\n for (int i = 1; i <= n; ++i) {\n out.println(i);\n }\n return;\n }\n ArrayList<Integer> result = new ArrayList<>();\n for (int center = 0; center < n; ++center) {\n boolean find = false;\n for (int a = 0; a < n; ++a)\n if (a != center) {\n for (int b = 0; b < n; ++b)\n if (b != center && b != a) {\n TaskC.Point A = points.get(a).minus(points.get(center));\n TaskC.Point B = points.get(b).minus(points.get(center));\n if (A.dot(B)) {\n find = true;\n break;\n }\n }\n if (find) break;\n }\n if (!find) result.add(center + 1);\n }\n out.println(result.size());\n for (int id : result) {\n out.println(id);\n }\n }\n }\n\n static class Point {\n long a;\n long b;\n long c;\n long d;\n long e;\n\n public Point(long a, long b, long c, long d, long e) {\n this.a = a;\n this.b = b;\n this.c = c;\n this.d = d;\n this.e = e;\n }\n\n boolean dot(final TaskC.Point rhs) {\n return a * rhs.a + b * rhs.b + c * rhs.c + d * rhs.d + e * rhs.e > 0;\n }\n\n TaskC.Point minus(final TaskC.Point rhs) {\n return new TaskC.Point(a - rhs.a, b - rhs.b, c - rhs.c, d - rhs.d, e - rhs.e);\n }\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["brute force", "math", "geometry"], "code_uid": "5c813d387ed8ed29e95b97d133c8f24c", "src_uid": "c1cfe1f67217afd4c3c30a6327e0add9", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.ArrayList;\nimport java.util.HashSet;\nimport java.util.Scanner;\n\n/**\n * Created by Pranav ps on 04-09-2017.\n */\npublic class wedss {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n if(n <= 11){\n long[][] points = new long[n][5];\n\n for(int i = 0 ; i < n; i++){\n for (int j = 0; j < 5; j++) {\n points[i][j] = sc.nextLong();\n }\n }\n\n long[][][] vectors = new long[n][n][5];\n for(int i = 0; i < n; i++){\n for(int j = 0; j < n; j++){\n for (int k = 0; k < 5; k++) {\n vectors[i][j][k] = points[j][k] - points[i][k];\n }\n }\n }\n\n HashSet<Integer> list = new HashSet<>();\n\n for(int i = 0; i < n; i++){\n boolean flag = false;\n for (int j = 0; j < n; j++) {\n for (int k = 0; k < n; k++) {\n if(!equal(vectors[i][j],vectors[i][k]) && dot(vectors[i][j],vectors[i][k])){\n list.add(i+1);\n flag = true;\n break;\n }\n }\n if(flag)\n break;\n }\n }\n\n System.out.println(n - list.size());\n for(int i = 0; i < n; i++){\n if(!list.contains(i+1))\n System.out.println(i+1);\n }\n }\n else{\n System.out.println(0);\n }\n }\n private static boolean equal(long[] a, long[] b){\n boolean res = true;\n for(int i = 0 ; i < 5; i++){\n res &= a[i]==b[i];\n }\n return res;\n }\n private static boolean dot(long[] a, long[] b){\n long res = 0;\n for(int i = 0 ; i < 5; i++){\n res += a[i]*b[i];\n }\n\n return res>0;\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "geometry"], "code_uid": "872ccccef47662096b963a1386991452", "src_uid": "c1cfe1f67217afd4c3c30a6327e0add9", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.math.*;\nimport java.util.*;\npublic class Main{\n\n public static long sq(long a){\n return a*a;\n }\n public static long distSq(long ax, long ay, long bx, long by){\n return sq(ax-bx)+sq(ay-by);\n }\n \n public static class Point{\n long x1;\n long x2;\n long x3;\n long x4;\n long x5;\n \n public Point(long x1, long x2, long x3, long x4, long x5){\n this.x1 = x1;\n this.x2 = x2;\n this.x3 = x3;\n this.x4 = x4;\n this.x5 = x5;\n }\n \n private static long sq(long x){\n return x*x;\n }\n public long lenSq(){\n return sq(x1)+sq(x2)+sq(x3)+sq(x4)+sq(x5);\n }\n \n public long prod(Point other){\n return this.x1*other.x1 + this.x2*other.x2 + this.x3*other.x3 + this.x4*other.x4 + this.x5*other.x5;\n }\n \n public Point sub(Point other){\n return new Point(this.x1-other.x1,this.x2-other.x2,this.x3-other.x3,this.x4-other.x4,this.x5-other.x5);\n }\n \n }\n \n \n public static boolean check(ArrayList<Point> points, int i){\n Point ith = points.get(i);\n int n = points.size();\n for(int j=0; j<n; ++j){\n if(j == i){\n continue;\n }\n for(int k=0; k<n; k++){\n if(k == i || k == j){\n continue;\n }\n \n Point x = points.get(j).sub(ith);\n Point y = points.get(k).sub(ith);\n if(x.prod(y) > 0){\n return false;\n }\n }\n }\n return true;\n }\n \n public static void main(String[] args){\n InputReader reader = new InputReader(System.in);\n PrintWriter pw = new PrintWriter(System.out);\n int n = reader.nextInt();\n if(n > 11){\n pw.printf(\"0\\n\");\n pw.flush();\n pw.close();\n return;\n }\n ArrayList<Point> points = new ArrayList<Point>(n);\n for(int i=0; i<n; ++i){\n points.add(new Point(reader.nextLong(), reader.nextLong(), reader.nextLong(), reader.nextLong(), reader.nextLong()));\n }\n \n ArrayList<Integer> ret = new ArrayList<Integer>(11);\n for(int i=0; i<n; ++i){\n if(check(points,i)){\n ret.add(i+1);\n }\n }\n \n pw.printf(\"%d\\n\", ret.size());\n for(Integer x : ret){\n pw.printf(\"%d\\n\", x);\n }\n pw.flush();\n pw.close();\n }\n \n public static class InputReader {\n BufferedReader reader;\n StringTokenizer tokenizer;\n \n public InputReader (InputStream stream){\n reader = new BufferedReader(new InputStreamReader(stream));\n }\n \n public String next(){\n while(tokenizer == null || !tokenizer.hasMoreTokens()){\n try{\n String line = reader.readLine();\n if(line == null){\n return \"0\";\n }\n tokenizer = new StringTokenizer(line);\n } catch(IOException ioe){\n throw new RuntimeException(ioe);\n }\n }\n return tokenizer.nextToken();\n }\n \n public int nextInt(){\n return Integer.parseInt(next());\n }\n \n public double nextDouble(){\n return Double.parseDouble(next());\n }\n \n public Long nextLong(){\n return Long.parseLong(next());\n }\n \n public BigInteger nextBigInteger(){\n return new BigInteger(next());\n }\n \n public String nextLine(){\n String line = \"\";\n try{\n while(line.equals(\"\")){\n line = reader.readLine();\n }\n } catch(IOException ioe){\n throw new RuntimeException(ioe);\n }\n return line;\n }\n }\n \n}", "lang_cluster": "Java", "tags": ["brute force", "math", "geometry"], "code_uid": "fd8f292f0d5689178232ed45b61dfbb3", "src_uid": "c1cfe1f67217afd4c3c30a6327e0add9", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\nimport java.lang.*;\n \nimport static java.lang.Math.*;\n \npublic class Main implements Runnable\n{\n\tstatic class InputReader\n\t{\n\t\tprivate InputStream stream;\n\t\tprivate byte[] buf = new byte[1024];\n\t\tprivate int curChar;\n\t\tprivate int numChars;\n\t\tprivate SpaceCharFilter filter;\n\t\tprivate BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\n\t\tpublic InputReader(InputStream stream)\n\t\t{\n\t\t\tthis.stream = stream;\n\t\t}\n\t\t\n\t\tpublic int read()\n\t\t{\n\t\t\tif (numChars==-1) \n\t\t\t\tthrow new InputMismatchException();\n\t\t\t\n\t\t\tif (curChar >= numChars)\n\t\t\t{\n\t\t\t\tcurChar = 0;\n\t\t\t\ttry \n\t\t\t\t{\n\t\t\t\t\tnumChars = stream.read(buf);\n\t\t\t\t}\n\t\t\t\tcatch (IOException e)\n\t\t\t\t{\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(numChars <= 0)\t\t\t\t\n\t\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn buf[curChar++];\n\t\t}\n\t \n\t\tpublic String nextLine()\n\t\t{\n\t\t\tString str = \"\";\n try\n {\n str = br.readLine();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n return str;\n\t\t}\n\t\tpublic int nextInt()\n\t\t{\n\t\t\tint c = read();\n\t\t\t\n\t\t\twhile(isSpaceChar(c)) \n\t\t\t\tc = read();\n\t\t\t\n\t\t\tint sgn = 1;\n\t\t\t\n\t\t\tif (c == '-') \n\t\t\t{\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\t\n\t\t\tint res = 0;\n\t\t\tdo \n\t\t\t{\n\t\t\t\tif(c<'0'||c>'9') \n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\twhile (!isSpaceChar(c)); \n\t\t\t\n\t\t\treturn res * sgn;\n\t\t}\n\t\t\n\t\tpublic long nextLong() \n\t\t{\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-') \n\t\t\t{\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\t\n\t\t\tdo \n\t\t\t{\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\twhile (!isSpaceChar(c));\n\t\t\t\treturn res * sgn;\n\t\t}\n\t\t\n\t\tpublic double nextDouble() \n\t\t{\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-') \n\t\t\t{\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tdouble res = 0;\n\t\t\twhile (!isSpaceChar(c) && c != '.') \n\t\t\t{\n\t\t\t\tif (c == 'e' || c == 'E')\n\t\t\t\t\treturn res * Math.pow(10, nextInt());\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tif (c == '.') \n\t\t\t{\n\t\t\t\tc = read();\n\t\t\t\tdouble m = 1;\n\t\t\t\twhile (!isSpaceChar(c)) \n\t\t\t\t{\n\t\t\t\t\tif (c == 'e' || c == 'E')\n\t\t\t\t\t\treturn res * Math.pow(10, nextInt());\n\t\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t\tm /= 10;\n\t\t\t\t\tres += (c - '0') * m;\n\t\t\t\t\tc = read();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn res * sgn;\n\t\t}\n\t\t\n\t\tpublic String readString() \n\t\t{\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo \n\t\t\t{\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t} \n\t\t\twhile (!isSpaceChar(c));\n\t\t\t\n\t\t\treturn res.toString();\n\t\t}\n\t \n\t\tpublic boolean isSpaceChar(int c) \n\t\t{\n\t\t\tif (filter != null)\n\t\t\t\treturn filter.isSpaceChar(c);\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n\t \n\t\tpublic String next() \n\t\t{\n\t\t\treturn readString();\n\t\t}\n\t\t\n\t\tpublic interface SpaceCharFilter \n\t\t{\n\t\t\tpublic boolean isSpaceChar(int ch);\n\t\t}\n\t}\n \t\n\tpublic static void main(String args[]) throws Exception\n\t{\n\t\tnew Thread(null, new Main(),\"Main\",1<<26).start();\n\t}\n \n\tint findAngle(Point p1, Point p2)\n {\n return p1.a * p2.a + p1.b * p2.b + p1.c * p2.c + p1.d * p2.d + p1.e * p2.e;\n }\n \n\tPoint makeVector(Point p1, Point p2)\n {\n return new Point(p1.a - p2.a, p1.b - p2.b, p1.c - p2.c, p1.d - p2.d, p1.e - p2.e);\n }\n \n public void run()\n\t{\n\t\tInputReader sc = new InputReader(System.in);\n\t\tPrintWriter w = new PrintWriter(System.out);\n\t\tint n = sc.nextInt();\n \n if(n > 32)\n {\n w.print(\"0\");\n w.close();\n return;\n }\n\n Point point[] = new Point[n];\n for(int i = 0; i < n; ++i)\n {\n point[i] = new Point(sc.nextInt(), sc.nextInt(), sc.nextInt(), sc.nextInt(), sc.nextInt());\n }\n\n ArrayList<Integer> ans = new ArrayList<>();\n for(int i = 0; i < n; ++i)\n {\n int flag = 0;\n midloop:for(int j = 0; j < n; ++j)\n {\n for(int k= 0; k< n && j != i; ++k)\n {\n if(k != j && k != i)\n {\n Point p1 = makeVector(point[i], point[j]);\n Point p2 = makeVector(point[i], point[k]);\n int value = findAngle(p1, p2);\n if(value > 0)\n {\n flag = 1;\n break midloop;\n }\n }\n }\n }\n if(flag == 0)\n ans.add(i);\n }\n\n w.println(ans.size());\n for(int i = 0; i < ans.size(); ++i)\n {\n w.println((ans.get(i) + 1));\n }\n\t\tw.close();\t\t\n\t}\n}\nclass Point\n{\n int a,b,c,d,e;\n Point(int a, int b, int c, int d, int e)\n {\n this.a = a;\n this.b = b;\n this.c = c;\n this.d = d;\n this.e = e;\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "geometry"], "code_uid": "fd90460bffea2759b3143e9d65cfbd47", "src_uid": "c1cfe1f67217afd4c3c30a6327e0add9", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Main {\n\n static Scanner input = new Scanner(new BufferedReader(new InputStreamReader(System.in)));\n static Reader fastInput = new Reader();\n\n public static void main(String[] args) throws IOException {\n int n = fastInput.nextInt();\n if (n > 20) {\n System.out.println(0);\n } else {\n int[][] p = new int[n][5];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < 5; j++) {\n p[i][j] = fastInput.nextInt();\n }\n }\n ArrayList<Integer> good = new ArrayList<>();\n loop:\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if (i != j) {\n for (int k = j + 1; k < n; k++) {\n if (i != k) {\n if (getAn(p[i], p[j], p[k]) < 90) {\n continue loop;\n }\n }\n }\n }\n }\n good.add(i + 1);\n }\n System.out.println(good.size());\n for (int i = 0; i < good.size(); i++) {\n System.out.println(good.get(i));\n }\n }\n }\n\n static double getAn(int[] p1, int[] p2, int[] p3) {\n double dot = 0, aLen = 0, bLen = 0;\n for (int i = 0; i < p1.length; i++) {\n dot += (p2[i] - p1[i]) * (p3[i] - p1[i]);\n aLen += (p2[i] - p1[i]) * (p2[i] - p1[i]);\n bLen += (p3[i] - p1[i]) * (p3[i] - p1[i]);\n }\n return 180 * Math.acos(dot / Math.sqrt(aLen * bLen)) / Math.PI;\n }\n\n static class Reader {\n\n final private int BUFFER_SIZE = 1 << 16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n\n public Reader() {\n din = new DataInputStream(System.in);\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public Reader(String file_name) throws IOException {\n din = new DataInputStream(new FileInputStream(file_name));\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public String readLine() throws IOException {\n byte[] buf = new byte[64]; // line length\n int cnt = 0, c;\n while ((c = read()) != -1) {\n if (c == '\\n') {\n break;\n }\n buf[cnt++] = (byte) c;\n }\n return new String(buf, 0, cnt);\n }\n\n public int nextInt() throws IOException {\n int ret = 0;\n byte c = read();\n while (c <= ' ') {\n c = read();\n }\n boolean neg = (c == '-');\n if (neg) {\n c = read();\n }\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n\n if (neg) {\n return -ret;\n }\n return ret;\n }\n\n public long nextLong() throws IOException {\n long ret = 0;\n byte c = read();\n while (c <= ' ') {\n c = read();\n }\n boolean neg = (c == '-');\n if (neg) {\n c = read();\n }\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n if (neg) {\n return -ret;\n }\n return ret;\n }\n\n public double nextDouble() throws IOException {\n double ret = 0, div = 1;\n byte c = read();\n while (c <= ' ') {\n c = read();\n }\n boolean neg = (c == '-');\n if (neg) {\n c = read();\n }\n\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n\n if (c == '.') {\n while ((c = read()) >= '0' && c <= '9') {\n ret += (c - '0') / (div *= 10);\n }\n }\n\n if (neg) {\n return -ret;\n }\n return ret;\n }\n\n private void fillBuffer() throws IOException {\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1) {\n buffer[0] = -1;\n }\n }\n\n private byte read() throws IOException {\n if (bufferPointer == bytesRead) {\n fillBuffer();\n }\n return buffer[bufferPointer++];\n }\n\n public void close() throws IOException {\n if (din == null) {\n return;\n }\n din.close();\n }\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "geometry"], "code_uid": "b0e32839b356776aee551e7aab840fd4", "src_uid": "c1cfe1f67217afd4c3c30a6327e0add9", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.ArrayList;\nimport java.util.NoSuchElementException;\n \npublic class Main {\n\tprivate static FastScanner sc = new FastScanner();\n\t\n\tpublic static void main(String[] args) {\n\t\tint n = sc.nextInt();\n\t\tif(n >= 12) {\n\t\t\tSystem.out.println(\"0\");\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tint[][] a = new int[n][5];\n\t\tfor(int i=0; i<n; i++) {\n\t\t\tfor(int j=0; j<5; j++) {\n\t\t\t\ta[i][j] = sc.nextInt();\n\t\t\t}\n\t\t}\n\t\t\n\t\tArrayList<Integer> ans = new ArrayList<>();\n\t\tfor(int i=0; i<n; i++) {\n\t\t\tboolean flag = true;\n\t\t\tloop:\n\t\t\tfor(int j=0; j<n; j++) {\n\t\t\t\tfor(int k=0; k<n; k++) {\n\t\t\t\t\tif(i == j || j == k || k == i) continue;\n\t\t\t\t\tint sum = 0;\n\t\t\t\t\tfor(int l=0; l<5; l++) {\n\t\t\t\t\t\tsum += (a[j][l] - a[i][l]) * (a[k][l] - a[i][l]);\n\t\t\t\t\t}\n\t\t\t\t\tif(sum > 0) {\n\t\t\t\t\t\tflag = false;\n\t\t\t\t\t\tbreak loop;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(flag) {\n\t\t\t\tans.add(i + 1);\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(ans.size());\n\t\tfor(int i=0; i<ans.size(); i++) {\n\t\t\tSystem.out.println(ans.get(i));\n\t\t}\n\t}\n\t\n\tstatic class FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n private boolean hasNextByte() {\n if(ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch(IOException e) {\n e.printStackTrace();\n }\n if(buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}\n public boolean hasNext() { skipUnprintable(); return hasNextByte();}\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n return Long.parseLong(next());\n }\n public int nextInt(){\n return Integer.parseInt(next());\n }\n public double nextDouble(){\n return Double.parseDouble(next());\n }\n }\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "geometry"], "code_uid": "1b516d32902d8435ed0f760b43d76e5c", "src_uid": "c1cfe1f67217afd4c3c30a6327e0add9", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.ArrayList;\nimport java.util.HashSet;\nimport java.util.Scanner;\n\n/**\n * Created by Pranav ps on 04-09-2017.\n */\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n if(n <= 11){\n long[][] points = new long[n][5];\n\n for(int i = 0 ; i < n; i++){\n for (int j = 0; j < 5; j++) {\n points[i][j] = sc.nextLong();\n }\n }\n\n long[][][] vectors = new long[n][n][5];\n for(int i = 0; i < n; i++){\n for(int j = 0; j < n; j++){\n for (int k = 0; k < 5; k++) {\n vectors[i][j][k] = points[j][k] - points[i][k];\n }\n }\n }\n\n HashSet<Integer> list = new HashSet<>();\n\n for(int i = 0; i < n; i++){\n boolean flag = false;\n for (int j = 0; j < n; j++) {\n for (int k = 0; k < n; k++) {\n if(!equal(vectors[i][j],vectors[i][k]) && dot(vectors[i][j],vectors[i][k])){\n list.add(i+1);\n flag = true;\n break;\n }\n }\n if(flag)\n break;\n }\n }\n\n System.out.println(n - list.size());\n for(int i = 0; i < n; i++){\n if(!list.contains(i+1))\n System.out.println(i+1);\n }\n }\n else{\n System.out.println(0);\n }\n }\n private static boolean equal(long[] a, long[] b){\n boolean res = true;\n for(int i = 0 ; i < 5; i++){\n res &= a[i]==b[i];\n }\n return res;\n }\n private static boolean dot(long[] a, long[] b){\n long res = 0;\n for(int i = 0 ; i < 5; i++){\n res += a[i]*b[i];\n }\n\n return res>0;\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "geometry"], "code_uid": "6cdc2856d7c2e7c69036d65e0cbfee1c", "src_uid": "c1cfe1f67217afd4c3c30a6327e0add9", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Scanner;\n\n\npublic class Main {\n public static void main(String[] args) {\n // TODO Auto-generated method stub\n int mod=1000000007;\n int[][] bell = new int[4010][4010];\n bell[0][0]=1;\n Scanner scan=new Scanner(System.in);\n int n = scan.nextInt();\n for(int i=1;i<=n;i++){\n bell[i][0]=bell[i-1][i-1];\n for(int j=1;j<=i;j++){\n bell[i][j]=bell[i-1][j-1]+bell[i][j-1];\n bell[i][j]%=mod;\n }\n }\n System.out.println(bell[n][n-1]);\n }\n}", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics"], "code_uid": "d538c917a5f8d168d0feb2ab08bfc9f6", "src_uid": "aa2c3e94a44053a0d86f61da06681023", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n private static class Solver {\n private void Solve() {\n final int MOD = (int) 1e9 + 7;\n\n int n = inp.nextInt();\n String S = \" \" + inp.next();\n int m = S.length() - 1;\n\n int[] kmp = new int[m + 1];\n kmp[0] = -1;\n for (int i = 1; i <= m; ++i) {\n kmp[i] = 0;\n for (int j = kmp[i - 1]; j != -1; j = kmp[j]) {\n if (S.charAt(j + 1) == S.charAt(i)) {\n kmp[i] = j + 1;\n break;\n }\n }\n }\n\n int[][] nxt = new int[m + 1][2];\n for (int i = 0; i < m; ++i) {\n for (int k = 0; k < 2; ++k) {\n nxt[i][k] = 0;\n for (int j = i; j != -1; j = kmp[j]) {\n if (S.charAt(j + 1) == '(' + k) {\n nxt[i][k] = j + 1;\n break;\n }\n }\n }\n }\n\n int[][][] dp = new int[n * 2 + 1][n + 1][m + 1];\n for (int i = 0; i <= n * 2; ++i) {\n for (int j = 0; j <= n; ++j) {\n for (int k = 0; k <= m; ++k) {\n dp[i][j][k] = 0;\n }\n }\n }\n\n dp[0][0][0] = 1;\n for (int i = 0; i < n * 2; ++i) {\n for (int depth = 0; depth <= n; ++depth) {\n for (int pref = 0; pref < m; ++pref) {\n if (dp[i][depth][pref] == 0) {\n continue;\n }\n\n for (int k = 0; k < 2; ++k) {\n int newDepth = depth + (k == 0 ? 1 : -1);\n if (newDepth < 0 || newDepth > n) {\n continue;\n }\n dp[i + 1][newDepth][nxt[pref][k]] += dp[i][depth][pref];\n if (dp[i + 1][newDepth][nxt[pref][k]] >= MOD) {\n dp[i + 1][newDepth][nxt[pref][k]] -= MOD;\n }\n }\n }\n }\n }\n\n int[][] f = new int[n * 2 + 1][n * 2 + 1];\n for (int i = 0; i <= n * 2; ++i) {\n for (int j = 0; j <= n * 2; ++j) {\n f[i][j] = 0;\n }\n }\n\n f[0][0] = 1;\n for (int i = 0; i < n * 2; ++i) {\n for (int depth = 0; depth <= n; ++depth) {\n for (int k = 0; k < 2; ++k) {\n int newDepth = depth + (k == 0 ? -1 : 1);\n if (newDepth < 0 || newDepth > n) {\n continue;\n }\n f[i + 1][newDepth] += f[i][depth];\n if (f[i + 1][newDepth] >= MOD) {\n f[i + 1][newDepth] -= MOD;\n }\n }\n }\n }\n\n int ans = f[n * 2][0];\n for (int i = 0; i < m; ++i) {\n ans -= dp[n * 2][0][i];\n if (ans < 0) {\n ans += MOD;\n }\n }\n out.println(ans);\n }\n static InputReader inp;\n static PrintWriter out;\n }\n\n private static class InputReader {\n private BufferedReader reader;\n private StringTokenizer tokenizer;\n\n private InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n private String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n private int nextInt() {\n return Integer.parseInt(next());\n }\n private long nextLong() {\n return Long.parseLong(next());\n }\n private int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; ++i) {\n a[i] = nextInt();\n }\n return a;\n }\n }\n public static void main(String[] args) throws IOException {\n if (!\"true\".equals(System.getProperty(\"ONLINE_JUDGE\"))) {\n System.setIn(new FileInputStream(new File(\"input.txt\")));\n }\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Solver.inp = new InputReader(inputStream);\n Solver.out = new PrintWriter(outputStream);\n Solver solver = new Solver();\n solver.Solve();\n Solver.out.close();\n }\n}", "lang_cluster": "Java", "tags": ["strings", "dp"], "code_uid": "a0e91fb19c078ea5e8001257eb327579", "src_uid": "590a49a7af0eb83376ed911ed488d7e5", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "\n\nimport java.io.BufferedReader;\nimport java.io.FileNotFoundException;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.StringTokenizer;\n\npublic class DimaAndHorses {\n\tstatic int[] locHorse;\n\tstatic List<List<Integer>> enemies;\n\tpublic static void main(String[] args){\n\t\tFastScanner sc= new FastScanner();\n\t\t\n\t\tint n = sc.nextInt();\n\t\tint m = sc.nextInt();\n\t\t\n\t\t//enemies[i] = list of enemies of horse i\n\t\tenemies = new ArrayList<List<Integer>>();\n\t\tfor(int horse=0;horse<=n;horse++){\n\t\t\tenemies.add(new ArrayList<Integer>());\n\t\t}\n\t\t\n\t\tfor(int i=1;i<=m;i++){\n\t\t\tint h1 = sc.nextInt();\n\t\t\tint h2 = sc.nextInt();\n\t\t\tenemies.get(h1).add(h2);\n\t\t\tenemies.get(h2).add(h1);\n\t\t}\n\t\t\n\t\t//all horse in group 0 initially\n\t\tlocHorse = new int[n+1];\n\t\tfor(int horse=1;horse<=n;horse++){\n\t\t\tjump(horse);\n\t\t}\n\t\tfor(int horse=1;horse<=n;horse++){\n\t\t\tSystem.out.print(locHorse[horse]);\n\t\t}\n\t}\n\t\n\tpublic static void jump(int horse){\n\t\tint countEnemy = 0;\n\t\tfor(Integer enemy : enemies.get(horse)){\n\t\t\tif(locHorse[enemy] == locHorse[horse]){\n\t\t\t\tcountEnemy++;\n\t\t\t}\n\t\t}\n\t\tif(countEnemy >= 2){\n\t\t\tlocHorse[horse] = locHorse[horse] == 0 ? 1 : 0;\n\t\t\tfor(Integer enemy : enemies.get(horse)){\n\t\t\t\tif(locHorse[enemy] == locHorse[horse]){\n\t\t\t\t\tjump(enemy);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic static class FastScanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tpublic FastScanner(String s) {\n\t\t\ttry {\n\t\t\t\tbr = new BufferedReader(new FileReader(s));\n\t\t\t} catch (FileNotFoundException e) {\n\t\t\t\t// TODO Auto-generated catch block\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\n\t\tpublic FastScanner() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tString nextToken() {\n\t\t\twhile (st == null || !st.hasMoreElements()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\t// TODO Auto-generated catch block\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(nextToken());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(nextToken());\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(nextToken());\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["constructive algorithms", "combinatorics", "graphs"], "code_uid": "1682bac780055511c4684aa48082e37c", "src_uid": "7017f2c81d5aed716b90e46480f96582", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.math.BigInteger;\nimport java.util.Arrays;\nimport java.util.HashSet;\nimport java.util.InputMismatchException;\nimport java.util.Set;\n\n/**\n * @author Egor Kulikov (egor@egork.net)\n */\npublic class TaskE {\n\t@SuppressWarnings({\"FieldCanBeLocal\", \"UnusedDeclaration\"})\n\tprivate InputReader in;\n\tprivate PrintWriter out;\n\tprivate int[] dRow = {0, 1, 1};\n\tprivate int[] dColumn = {2, 1, -1};\n\n\tprivate void solve() {\n\t\tint[][] field = new int[5][9];\n\t\tfor (int[] row : field)\n\t\t\tArrays.fill(row, -1);\n\t\tint index = 0;\n\t\tfor (int i = 0; i < 3; i++) {\n\t\t\tfor (int j = 2 - i; j < 7 + i; j += 2)\n\t\t\t\tfield[i][j] = index++;\n\t\t}\n\t\tfor (int i = 3; i < 5; i++) {\n\t\t\tfor (int j = i - 2; j < 8; j += 2)\n\t\t\t\tfield[i][j] = index++;\n\t\t}\n\t\tSet<Integer> moves = new HashSet<Integer>();\n\t\tfor (int i = 0; i < 5; i++) {\n\t\t\tfor (int j = 0; j < 9; j++) {\n\t\t\t\tif (field[i][j] == -1)\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (int k = 0; k < 3; k++) {\n\t\t\t\t\tint currentMove = 0;\n\t\t\t\t\tint row = i;\n\t\t\t\t\tint column = j;\n\t\t\t\t\twhile (row < 5 && column < 9 && column >= 0 && field[row][column] != -1) {\n\t\t\t\t\t\tcurrentMove += 1 << field[row][column];\n\t\t\t\t\t\tmoves.add(currentMove);\n\t\t\t\t\t\trow += dRow[k];\n\t\t\t\t\t\tcolumn += dColumn[k];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tInteger[] allMoves = moves.toArray(new Integer[moves.size()]);\n\t\tint startPosition = 0;\n\t\tfor (int i = 0; i < 19; i++) {\n\t\t\tif (in.readCharacter() == 'O')\n\t\t\t\tstartPosition += 1 << i;\n\t\t}\n\t\tboolean[] winner = new boolean[1 << 19];\n\t\tfor (int i = 1; i <= startPosition; i++) {\n\t\t\tif ((startPosition & i) != i)\n\t\t\t\tcontinue;\n\t\t\tfor (int move : allMoves) {\n\t\t\t\tif ((i & move) == move && !winner[i - move]) {\n\t\t\t\t\twinner[i] = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tout.println(winner[startPosition] ? \"Karlsson\" : \"Lillebror\");\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew TaskE().run();\n\t}\n\n\tprivate TaskE() {\n\t\t@SuppressWarnings({\"UnusedDeclaration\"})\n\t\tString id = getClass().getName().toLowerCase();\n\t\t//noinspection EmptyTryBlock\n\t\ttry {\n//\t\t\tSystem.setIn(new FileInputStream(id + \".in\"));\n//\t\t\tSystem.setOut(new PrintStream(new FileOutputStream(id + \".out\")));\n//\t\t\tSystem.setIn(new FileInputStream(\"input.txt\"));\n//\t\t\tSystem.setOut(new PrintStream(new FileOutputStream(\"output.txt\")));\n\t\t} catch (Exception e) {\n\t\t\tthrow new RuntimeException(e);\n\t\t}\n\t\tin = new InputReader(System.in);\n\t\tout = new PrintWriter(System.out);\n\t}\n\n\tprivate void run() {\n\t\t//noinspection InfiniteLoopStatement\n//\t\twhile (true)\n//\t\tint testCount = in.readInt();\n//\t\tfor (int i = 0; i < testCount; i++)\n\t\tsolve();\n\t\texit();\n\t}\n\n\t@SuppressWarnings({\"UnusedDeclaration\"})\n\tprivate void exit() {\n\t\tout.close();\n\t\tSystem.exit(0);\n\t}\n\n\t@SuppressWarnings({\"UnusedDeclaration\"})\n\tprivate static class InputReader {\n\t\tprivate InputStream stream;\n\t\tprivate byte[] buf = new byte[1024];\n\t\tprivate int curChar, numChars;\n\n\t\tpublic InputReader(InputStream stream) {\n\t\t\tthis.stream = stream;\n\t\t}\n\n\t\tpublic int read() {\n\t\t\tif (numChars == -1)\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tif (curChar >= numChars) {\n\t\t\t\tcurChar = 0;\n\t\t\t\ttry {\n\t\t\t\t\tnumChars = stream.read(buf);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (numChars <= 0)\n\t\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn buf[curChar++];\n\t\t}\n\n\t\tpublic int readInt() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-') {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res * sgn;\n\t\t}\n\n\t\tpublic long readLong() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-') {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res * sgn;\n\t\t}\n\n\t\tpublic String readString() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tStringBuffer res = new StringBuffer();\n\t\t\tdo {\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tprivate boolean isSpaceChar(int c) {\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n\n\t\tprivate String readLine0() {\n\t\t\tStringBuffer buf = new StringBuffer();\n\t\t\tint c = read();\n\t\t\twhile (c != '\\n' && c != -1) {\n\t\t\t\tif (c != '\\r')\n\t\t\t\t\tbuf.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\treturn buf.toString();\n\t\t}\n\n\t\tpublic String readLine() {\n\t\t\tString s = readLine0();\n\t\t\twhile (s.trim().length() == 0)\n\t\t\t\ts = readLine0();\n\t\t\treturn s;\n\t\t}\n\n\t\tpublic String readLine(boolean ignoreEmptyLines) {\n\t\t\tif (ignoreEmptyLines)\n\t\t\t\treturn readLine();\n\t\t\telse\n\t\t\t\treturn readLine0();\n\t\t}\n\n\t\tpublic BigInteger readBigInteger() {\n\t\t\ttry {\n\t\t\t\treturn new BigInteger(readString());\n\t\t\t} catch (NumberFormatException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t}\n\n\t\tpublic char readCharacter() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\treturn (char) c;\n\t\t}\n\n\t\tpublic double readDouble() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-') {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tdouble res = 0;\n\t\t\twhile (!isSpaceChar(c) && c != '.') {\n\t\t\t\tif (c == 'e' || c == 'E')\n\t\t\t\t\treturn res * Math.pow(10, readInt());\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tif (c == '.') {\n\t\t\t\tc = read();\n\t\t\t\tdouble m = 1;\n\t\t\t\twhile (!isSpaceChar(c)) {\n\t\t\t\t\tif (c == 'e' || c == 'E')\n\t\t\t\t\t\treturn res * Math.pow(10, readInt());\n\t\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t\tm /= 10;\n\t\t\t\t\tres += (c - '0') * m;\n\t\t\t\t\tc = read();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn res * sgn;\n\t\t}\n\n\t\tpublic int[] readIntArray(int size) {\n\t\t\tint[] array = new int[size];\n\t\t\tfor (int i = 0; i < size; i++)\n\t\t\t\tarray[i] = readInt();\n\t\t\treturn array;\n\t\t}\n\n\t\tpublic long[] readLongArray(int size) {\n\t\t\tlong[] array = new long[size];\n\t\t\tfor (int i = 0; i < size; i++)\n\t\t\t\tarray[i] = readLong();\n\t\t\treturn array;\n\t\t}\n\n\t\tpublic double[] readDoubleArray(int size) {\n\t\t\tdouble[] array = new double[size];\n\t\t\tfor (int i = 0; i < size; i++)\n\t\t\t\tarray[i] = readDouble();\n\t\t\treturn array;\n\t\t}\n\n\t\tpublic String[] readStringArray(int size) {\n\t\t\tString[] array = new String[size];\n\t\t\tfor (int i = 0; i < size; i++)\n\t\t\t\tarray[i] = readString();\n\t\t\treturn array;\n\t\t}\n\n\t\tpublic char[][] readTable(int rowCount, int columnCount) {\n\t\t\tchar[][] table = new char[rowCount][columnCount];\n\t\t\tfor (int i = 0; i < rowCount; i++) {\n\t\t\t\tfor (int j = 0; j < columnCount; j++)\n\t\t\t\t\ttable[i][j] = readCharacter();\n\t\t\t}\n\t\t\treturn table;\n\t\t}\n\n\t\tpublic void readIntArrays(int[]... arrays) {\n\t\t\tfor (int i = 0; i < arrays[0].length; i++) {\n\t\t\t\tfor (int j = 0; j < arrays.length; j++)\n\t\t\t\t\tarrays[j][i] = readInt();\n\t\t\t}\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "games", "dp", "bitmasks", "implementation"], "code_uid": "a62c22851dcee5f86e0f7804ffc003f0", "src_uid": "eaa022cc7846c983a826900dc6dd919f", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\npublic class SweetsGame {\n\t// 0\t1\t2\n\t// 3\t4\t5\t6\n\t// 7\t8\t9\t10\t11\n\t// 12\t13\t14\t15\n\t// 16\t17 \t18\n\tstatic int [] dp = new int [1<<20];\n\tstatic int [] dx = {-2, -1, 1, 2, 1, -1};\n\tstatic int [] dy = {0, 1, 1, 0, -1, -1};\n\tstatic int [] len = new int[]{3,4,5,4,3};\n\tpublic static void main (String [] arg) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tboolean [][] state = new boolean [5][9];\n\t\tint cnt = 0;\n\t\tfor (int i = 0; i<len.length; ++i) {\n\t\t\tint offset = (i % 2) + ((len[i] == 3) ? 2 : 0);\n\t\t\tfor (int j = 0; j<len[i]; ++j) {\n\t\t\t\tString s = sc.next();\n\t\t\t\tstate[i][offset+2*j] = (s.charAt(0) == '.') ? false : true;\n\t\t\t\tif (state[i][offset+2*j]) ++cnt;\n\t\t\t}\n\t\t}\n\t\tArrays.fill(dp,-1);\n\t\tboolean who = canwin(state, cnt);\n\t\tSystem.out.println((who) ? \"Karlsson\" : \"Lillebror\");\n\t\t\n\t}\n\tpublic static boolean canwin (boolean [][] state, int left) {\n\t\tif (left <= 0) return false;\n\t\tint V = toInt(state);\n\t\tif (dp[V] >= 0) return (dp[V] != 0);\n\t\t\n\t\tboolean canwin = false;\n\t\tfor (int i = 0; i<len.length; ++i) {\n\t\t\tfor (int j = 0; j<state[i].length && !canwin; ++j) {\n\t\t\t\tif (!state[i][j]) continue;\n\t\t\t\tstate[i][j] = false;\n\t\t\t\tcanwin |= !canwin(state, left-1);\n\t\t\t\tfor (int k = 0; k<dx.length; ++k) {\n\t\t\t\t\tfor (int len = 1; ; ++len) {\n\t\t\t\t\t\tint i1 = dy[k]*len + i;\n\t\t\t\t\t\tint j1 = dx[k]*len + j;\n\t\t\t\t\t\tif (i1 < 0 || j1 < 0 || i1 >= state.length || j1 >= state[i].length || !state[i1][j1]) {\n\t\t\t\t\t\t\twhile (len-- > 1) {\n\t\t\t\t\t\t\t\ti1 -= dy[k];\n\t\t\t\t\t\t\t\tj1 -= dx[k];\n\t\t\t\t\t\t\t\tstate[i1][j1] = true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tstate[i1][j1] = false;\n\t\t\t\t\t\tcanwin |= !canwin(state,left-len-1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tstate[i][j] = true;\n\t\t\t}\n\t\t}\n\t\t//System.out.println(toString(state) + \" : \" + canwin);\n\t\tdp[V] = (canwin) ? 1 : 0;\n\t\treturn canwin;\n\t\t\n\t}\n\tpublic static String toString (boolean [][] state) {\n\t\tString s = \"\";\n\t\tfor (int i = 0; i<state.length; ++i) {\n\t\t\tfor (int j = 0; j<state[i].length; ++j) {\n\t\t\t\ts += (state[i][j]) ? \"o\" : \".\";\n\t\t\t}\n\t\t\ts+=\"\\n\";\n\t\t}\n\t\treturn s;\n\t}\n\tpublic static int toInt (boolean [][] state) {\n\t\tint cnt = 0;\n\t\tint ans = 0;\n\t\tfor (int i = 0; i<len.length; ++i) {\n\t\t\tint offset = (i & 1) + ((len[i] == 3) ? 2 : 0);\n\t\t\tfor (int j = 0; j<len[i]; ++j) {\n\t\t\t\tif (state[i][offset+2*j]) ans |= (1<<cnt);\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t\treturn ans;\n\t}\n}", "lang_cluster": "Java", "tags": ["dfs and similar", "games", "dp", "bitmasks", "implementation"], "code_uid": "58fe85af51c2f97a5bdf95d0052bcccb", "src_uid": "eaa022cc7846c983a826900dc6dd919f", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "//package round59;\n\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class E {\n\tScanner in;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t\tchar[][] a = new char[5][];\n\t\tfor(int i = 0;i < 5;i++){\n\t\t\ta[i] = in.nextLine().toCharArray();\n\t\t}\n\t\tint start = (\n\t\t\t\t(a[0][2] == 'O' ? 1<<0 : 0) |\n\t\t\t\t(a[0][4] == 'O' ? 1<<1 : 0) |\n\t\t\t\t(a[0][6] == 'O' ? 1<<2 : 0) |\n\t\t\t\t(a[1][1] == 'O' ? 1<<3 : 0) |\n\t\t\t\t(a[1][3] == 'O' ? 1<<4 : 0) |\n\t\t\t\t(a[1][5] == 'O' ? 1<<5 : 0) |\n\t\t\t\t(a[1][7] == 'O' ? 1<<6 : 0) |\n\t\t\t\t(a[2][0] == 'O' ? 1<<7 : 0) |\n\t\t\t\t(a[2][2] == 'O' ? 1<<8 : 0) |\n\t\t\t\t(a[2][4] == 'O' ? 1<<9 : 0) |\n\t\t\t\t(a[2][6] == 'O' ? 1<<10 : 0) |\n\t\t\t\t(a[2][8] == 'O' ? 1<<11 : 0) |\n\t\t\t\t(a[3][1] == 'O' ? 1<<12 : 0) |\n\t\t\t\t(a[3][3] == 'O' ? 1<<13 : 0) |\n\t\t\t\t(a[3][5] == 'O' ? 1<<14 : 0) |\n\t\t\t\t(a[3][7] == 'O' ? 1<<15 : 0) |\n\t\t\t\t(a[4][2] == 'O' ? 1<<16 : 0) |\n\t\t\t\t(a[4][4] == 'O' ? 1<<17 : 0) |\n\t\t\t\t(a[4][6] == 'O' ? 1<<18 : 0)\n\t\t\t\t);\n\t\tList<Integer> move = new ArrayList<Integer>();\n\t\tint[][] hex = new int[][]{\n\t\t\t\t{1,2,3,0,0},\n\t\t\t\t{4,5,6,7,0},\n\t\t\t\t{8,9,10,11,12},\n\t\t\t\t{0,13,14,15,16},\n\t\t\t\t{0,0,17,18,19}\n\t\t};\n\t\t\n\t\tint[] dr = {1,1,0};\n\t\tint[] dc = {0,1,1};\n\t\tfor(int i = 0;i < 5;i++){\n\t\t\tfor(int j = 0;j < 5;j++){\n\t\t\t\tif(hex[i][j] > 0){\n\t\t\t\t\tmove.add(1<<(hex[i][j]-1));\n\t\t\t\t\tfor(int k = 0;k < 3;k++){\n\t\t\t\t\t\tint base = 1<<(hex[i][j]-1);\n\t\t\t\t\t\tfor(int r = i+dr[k], c = j+dc[k];r < 5 && c < 5 && hex[r][c] > 0;r += dr[k], c += dc[k]){\n\t\t\t\t\t\t\tbase |= 1<<(hex[r][c]-1);\n\t\t\t\t\t\t\tmove.add(base);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tCollections.sort(move);\n\t\t\n\t\tboolean[] win = new boolean[1<<19];\n\t\twin[0] = false;\n\t\tfor(int i = 1;i <= start;i++){\n\t\t\touter:\n\t\t\tfor(int j = 0;j < move.size();j++){\n\t\t\t\tint mv = move.get(j);\n\t\t\t\tif(mv > i)break;\n\t\t\t\tif((i&mv) == mv){\n\t\t\t\t\tif(!win[i^mv]){\n\t\t\t\t\t\twin[i] = true;\n\t\t\t\t\t\tbreak outer;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tout.println(win[start] ? \"Karlsson\" : \"Lillebror\");\n\t}\n\t\n\tvoid run() throws Exception\n\t{\n\t\tin = INPUT.isEmpty() ? new Scanner(System.in) : new Scanner(INPUT);\n\t\tout = new PrintWriter(System.out);\n\n\t\tsolve();\n\t\tout.flush();\n\t}\n\t\n\t\n\tpublic static void main(String[] args) throws Exception\n\t{\n\t\tnew E().run();\n\t}\n\t\n\tint ni() { return Integer.parseInt(in.next()); }\n\tvoid tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "games", "dp", "bitmasks", "implementation"], "code_uid": "d91530bca4bff0255559b5af21cf42a4", "src_uid": "eaa022cc7846c983a826900dc6dd919f", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class Main {\n\n\tBufferedReader in;\n\tStringTokenizer str = null;\n\tPrintWriter out;\n\t\n\tprivate String next() throws Exception{\n\t\twhile (str == null || !str.hasMoreElements())\n\t\t\tstr = new StringTokenizer(in.readLine());\n\t\treturn str.nextToken();\n\t}\n\t\n\tprivate int nextInt() throws Exception{\n\t\treturn Integer.parseInt(next());\n\t}\n\t\n\tprivate long nextLong() throws Exception{\n\t\treturn Long.parseLong(next());\n\t}\n\t\n\tprivate double nextDouble() throws Exception{\n\t\treturn Double.parseDouble(next());\n\t}\n\t\n\tint []dp;\n\tint n = 5, m = 9;\n\tint []x,y;\n\t\n\tpublic void run() throws Exception{\n\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\tchar [][]a = new char[n][];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\t// String x = in.readLine();\n\t\t\t// while(x.length() < m) x+=\" \";\n\t\t\ta[i] = in.readLine().toCharArray();\n\t\t}\n\n\t\tx = new int[19];\n\t\ty = new int[19];\n\t\tint at = 0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tfor(int j=0;j<a[i].length;j++){\n\t\t\t\tif (a[i][j] != ' ') {\n\t\t\t\t\tx[at] = i;\n\t\t\t\t\ty[at++] = j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// print(a);\n\n\t\tdp = new int[1 << 19];\n\t\tArrays.fill(dp, -1);\n\n\t\tdp[262143]=1;\n\t\tdp[393215]=1;\n\t\tdp[458751]=1;\n\t\tdp[491519]=1;\n\t\tdp[507903]=1;\n\t\tdp[516095]=1;\n\t\tdp[520191]=1;\n\t\tdp[522239]=1;\n\t\tdp[523263]=1;\n\t\tdp[523775]=0;\n\t\tdp[524031]=1;\n\t\tdp[524159]=1;\n\t\tdp[524223]=1;\n\t\tdp[524255]=1;\n\t\tdp[524271]=1;\n\t\tdp[524279]=1;\n\t\tdp[524283]=1;\n\t\tdp[524285]=1;\n\t\tdp[524286]=1;\n\t\tdp[524287]=1;\n\n\t\tint mask = encode(a);\n\t\t// print(decode(mask));\n\t\tboolean r = dfs(mask);\n\n\t\tif (r) out.println(\"Karlsson\");\n\t\telse out.println(\"Lillebror\");\n\t\t// out.println(\"{\");\n\t\t// for(int i=0;i<1<<19;i++){\n\t\t// \tif (Integer.bitCount(i) >= 18) {\n\t\t// \t\tif (dp[i] == -1) dfs(i);\n\t\t// \t\tout.println(\"dp[\"+i+\"]=\"+dp[i]+\";\");\n\t\t// \t}\n\t\t// }\n\t\t// out.println(\"}\");\n\t\tout.close();\n\t}\n\n\tint di[] = new int[]{0, 0, 1, -1, 1, 1, -1, -1};\n\tint dj[] = new int[]{2, -2, 0, 0, 1, -1, -1, 1};\n\n\tprivate boolean dfs(int mask) {\n\t\tif (mask == 0) return false;\n\t\tif (dp[mask] != -1) return dp[mask] > 0;\n\n\t\t// System.out.println(mask);\n\n\t\tchar [][]a = decode(mask);\n\t\tchar [][]b;\n\t\tfor(int i=0;i<19;i++){\n\t\t\tif (a[x[i]][y[i]] == 'O') {\n\t\t\t\tfor(int k=0;k<di.length;k++){\n\t\t\t\t\tint ni = x[i], nj = y[i];\n\t\t\t\t\tb = copy(a);\n\t\t\t\t\twhile(inRange(ni, nj) && b[ni][nj] == 'O') {\n\t\t\t\t\t\tb[ni][nj] = '.';\n\t\t\t\t\t\tint nmask = encode(b);\n\t\t\t\t\t\t// System.out.println(\"from \");\n\t\t\t\t\t\t// print(a);\n\t\t\t\t\t\t// System.out.println(\"to \");\n\t\t\t\t\t\t// print(b);\n\t\t\t\t\t\tif (!dfs(nmask)) {\n\t\t\t\t\t\t\tdp[mask] = 1;\n\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tni+=di[k];\n\t\t\t\t\t\tnj+=dj[k];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tdp[mask] = 0;\n\t\treturn false;\n\t}\n\n\tprivate boolean inRange(int i, int j) {\n\t\tif (i < 0 || j < 0) return false;\n\t\tif (i >= n || j >= m) return false;\n\t\treturn true;\n\t}\n\n\tprivate void print(char [][]a) {\n\t\tfor(int i=0;i<n;i++) System.out.println(Arrays.toString(a[i]));\n\t\tSystem.out.println();\n\t}\n\n\tprivate char[][] copy(char [][]a) {\n\t\tchar [][]b = a.clone();\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tb[i] = b[i].clone();\n\t\t}\n\t\treturn b;\n\t}\n\n\tprivate int encode(char [][]a) {\n\t\tint mask = 0;\n\t\tfor(int i=0;i<19;i++){\n\t\t\tif (a[x[i]][y[i]] == 'O') {\n\t\t\t\tmask|=1<<i;\n\t\t\t}\n\t\t}\n\t\treturn mask;\n\t}\n\n\tprivate char[][] decode(int mask) {\n\t\tchar [][]r = new char[n][m];\n\t\tfor(int i=0;i<19;i++){\n\t\t\tif ((mask & (1 << i)) > 0) {\n\t\t\t\tr[x[i]][y[i]] = 'O';\n\t\t\t}else {\n\t\t\t\tr[x[i]][y[i]] = '.';\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\t\t\n\tpublic static void main(String[] args) throws Exception{\n\t\tnew Main().run();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "games", "dp", "bitmasks", "implementation"], "code_uid": "4eddac412836b5094c01e5c3fd05325c", "src_uid": "eaa022cc7846c983a826900dc6dd919f", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class Main {\n\n\tBufferedReader in;\n\tStringTokenizer str = null;\n\tPrintWriter out;\n\t\n\tprivate String next() throws Exception{\n\t\twhile (str == null || !str.hasMoreElements())\n\t\t\tstr = new StringTokenizer(in.readLine());\n\t\treturn str.nextToken();\n\t}\n\t\n\tprivate int nextInt() throws Exception{\n\t\treturn Integer.parseInt(next());\n\t}\n\t\n\tprivate long nextLong() throws Exception{\n\t\treturn Long.parseLong(next());\n\t}\n\t\n\tprivate double nextDouble() throws Exception{\n\t\treturn Double.parseDouble(next());\n\t}\n\t\n\tint []dp;\n\tint n = 5, m = 9;\n\tint []x,y;\n\t\n\tpublic void run() throws Exception{\n\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\tchar [][]a = new char[n][];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\t// String x = in.readLine();\n\t\t\t// while(x.length() < m) x+=\" \";\n\t\t\ta[i] = in.readLine().toCharArray();\n\t\t}\n\n\t\tx = new int[19];\n\t\ty = new int[19];\n\t\tint at = 0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tfor(int j=0;j<a[i].length;j++){\n\t\t\t\tif (a[i][j] != ' ') {\n\t\t\t\t\tx[at] = i;\n\t\t\t\t\ty[at++] = j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// print(a);\n\n\t\tdp = new int[1 << 19];\n\t\tArrays.fill(dp, -1);\n\n\t\tdp[131071]=1;\n\t\tdp[196607]=1;\n\t\tdp[229375]=1;\n\t\tdp[245759]=1;\n\t\tdp[253951]=1;\n\t\tdp[258047]=1;\n\t\tdp[260095]=1;\n\t\tdp[261119]=1;\n\t\tdp[261631]=1;\n\t\tdp[261887]=1;\n\t\tdp[262015]=1;\n\t\tdp[262079]=1;\n\t\tdp[262111]=1;\n\t\tdp[262127]=1;\n\t\tdp[262135]=1;\n\t\tdp[262139]=1;\n\t\tdp[262141]=1;\n\t\tdp[262142]=1;\n\t\tdp[262143]=1;\n\t\tdp[327679]=1;\n\t\tdp[360447]=1;\n\t\tdp[376831]=1;\n\t\tdp[385023]=1;\n\t\tdp[389119]=1;\n\t\tdp[391167]=1;\n\t\tdp[392191]=1;\n\t\tdp[392703]=1;\n\t\tdp[392959]=1;\n\t\tdp[393087]=1;\n\t\tdp[393151]=1;\n\t\tdp[393183]=1;\n\t\tdp[393199]=1;\n\t\tdp[393207]=1;\n\t\tdp[393211]=1;\n\t\tdp[393213]=1;\n\t\tdp[393214]=1;\n\t\tdp[393215]=1;\n\t\tdp[425983]=1;\n\t\tdp[442367]=1;\n\t\tdp[450559]=1;\n\t\tdp[454655]=1;\n\t\tdp[456703]=1;\n\t\tdp[457727]=1;\n\t\tdp[458239]=1;\n\t\tdp[458495]=1;\n\t\tdp[458623]=1;\n\t\tdp[458687]=1;\n\t\tdp[458719]=1;\n\t\tdp[458735]=1;\n\t\tdp[458743]=1;\n\t\tdp[458747]=1;\n\t\tdp[458749]=1;\n\t\tdp[458750]=1;\n\t\tdp[458751]=1;\n\t\tdp[475135]=1;\n\t\tdp[483327]=1;\n\t\tdp[487423]=1;\n\t\tdp[489471]=1;\n\t\tdp[490495]=1;\n\t\tdp[491007]=1;\n\t\tdp[491263]=1;\n\t\tdp[491391]=1;\n\t\tdp[491455]=1;\n\t\tdp[491487]=1;\n\t\tdp[491503]=1;\n\t\tdp[491511]=1;\n\t\tdp[491515]=1;\n\t\tdp[491517]=1;\n\t\tdp[491518]=1;\n\t\tdp[491519]=1;\n\t\tdp[499711]=1;\n\t\tdp[503807]=1;\n\t\tdp[505855]=1;\n\t\tdp[506879]=1;\n\t\tdp[507391]=1;\n\t\tdp[507647]=1;\n\t\tdp[507775]=1;\n\t\tdp[507839]=1;\n\t\tdp[507871]=1;\n\t\tdp[507887]=1;\n\t\tdp[507895]=1;\n\t\tdp[507899]=1;\n\t\tdp[507901]=1;\n\t\tdp[507902]=1;\n\t\tdp[507903]=1;\n\t\tdp[511999]=1;\n\t\tdp[514047]=1;\n\t\tdp[515071]=1;\n\t\tdp[515583]=1;\n\t\tdp[515839]=1;\n\t\tdp[515967]=1;\n\t\tdp[516031]=1;\n\t\tdp[516063]=1;\n\t\tdp[516079]=1;\n\t\tdp[516087]=1;\n\t\tdp[516091]=1;\n\t\tdp[516093]=1;\n\t\tdp[516094]=1;\n\t\tdp[516095]=1;\n\t\tdp[518143]=1;\n\t\tdp[519167]=1;\n\t\tdp[519679]=1;\n\t\tdp[519935]=1;\n\t\tdp[520063]=1;\n\t\tdp[520127]=1;\n\t\tdp[520159]=1;\n\t\tdp[520175]=1;\n\t\tdp[520183]=1;\n\t\tdp[520187]=1;\n\t\tdp[520189]=1;\n\t\tdp[520190]=1;\n\t\tdp[520191]=1;\n\t\tdp[521215]=1;\n\t\tdp[521727]=1;\n\t\tdp[521983]=1;\n\t\tdp[522111]=1;\n\t\tdp[522175]=1;\n\t\tdp[522207]=1;\n\t\tdp[522223]=1;\n\t\tdp[522231]=1;\n\t\tdp[522235]=1;\n\t\tdp[522237]=1;\n\t\tdp[522238]=1;\n\t\tdp[522239]=1;\n\t\tdp[522751]=1;\n\t\tdp[523007]=1;\n\t\tdp[523135]=1;\n\t\tdp[523199]=1;\n\t\tdp[523231]=1;\n\t\tdp[523247]=1;\n\t\tdp[523255]=1;\n\t\tdp[523259]=1;\n\t\tdp[523261]=1;\n\t\tdp[523262]=1;\n\t\tdp[523263]=1;\n\t\tdp[523519]=1;\n\t\tdp[523647]=1;\n\t\tdp[523711]=1;\n\t\tdp[523743]=1;\n\t\tdp[523759]=1;\n\t\tdp[523767]=1;\n\t\tdp[523771]=1;\n\t\tdp[523773]=1;\n\t\tdp[523774]=1;\n\t\tdp[523775]=0;\n\t\tdp[523903]=1;\n\t\tdp[523967]=1;\n\t\tdp[523999]=1;\n\t\tdp[524015]=1;\n\t\tdp[524023]=1;\n\t\tdp[524027]=1;\n\t\tdp[524029]=1;\n\t\tdp[524030]=1;\n\t\tdp[524031]=1;\n\t\tdp[524095]=1;\n\t\tdp[524127]=1;\n\t\tdp[524143]=1;\n\t\tdp[524151]=1;\n\t\tdp[524155]=1;\n\t\tdp[524157]=1;\n\t\tdp[524158]=1;\n\t\tdp[524159]=1;\n\t\tdp[524191]=1;\n\t\tdp[524207]=1;\n\t\tdp[524215]=1;\n\t\tdp[524219]=1;\n\t\tdp[524221]=1;\n\t\tdp[524222]=1;\n\t\tdp[524223]=1;\n\t\tdp[524239]=1;\n\t\tdp[524247]=1;\n\t\tdp[524251]=1;\n\t\tdp[524253]=1;\n\t\tdp[524254]=1;\n\t\tdp[524255]=1;\n\t\tdp[524263]=1;\n\t\tdp[524267]=1;\n\t\tdp[524269]=1;\n\t\tdp[524270]=1;\n\t\tdp[524271]=1;\n\t\tdp[524275]=1;\n\t\tdp[524277]=1;\n\t\tdp[524278]=1;\n\t\tdp[524279]=1;\n\t\tdp[524281]=1;\n\t\tdp[524282]=1;\n\t\tdp[524283]=1;\n\t\tdp[524284]=1;\n\t\tdp[524285]=1;\n\t\tdp[524286]=1;\n\t\tdp[524287]=1;\n\n\t\tint mask = encode(a);\n\t\t// print(decode(mask));\n\t\tboolean r = dfs(mask);\n\n\t\tif (r) out.println(\"Karlsson\");\n\t\telse out.println(\"Lillebror\");\n\t\t// out.println(\"{\");\n\t\t// for(int i=0;i<1<<19;i++){\n\t\t// \tif (Integer.bitCount(i) >= 17) {\n\t\t// \t\tif (dp[i] == -1) dfs(i);\n\t\t// \t\tout.println(\"dp[\"+i+\"]=\"+dp[i]+\";\");\n\t\t// \t}\n\t\t// }\n\t\t// out.println(\"}\");\n\t\tout.close();\n\t}\n\n\tint di[] = new int[]{0, 0, 1, -1, 1, 1, -1, -1};\n\tint dj[] = new int[]{2, -2, 0, 0, 1, -1, -1, 1};\n\n\tprivate boolean dfs(int mask) {\n\t\tif (mask == 0) return false;\n\t\tif (dp[mask] != -1) return dp[mask] > 0;\n\n\t\t// System.out.println(mask);\n\n\t\tchar [][]a = decode(mask);\n\t\tchar [][]b;\n\t\tfor(int i=0;i<19;i++){\n\t\t\tif (a[x[i]][y[i]] == 'O') {\n\t\t\t\tfor(int k=0;k<di.length;k++){\n\t\t\t\t\tint ni = x[i], nj = y[i];\n\t\t\t\t\tb = copy(a);\n\t\t\t\t\twhile(inRange(ni, nj) && b[ni][nj] == 'O') {\n\t\t\t\t\t\tb[ni][nj] = '.';\n\t\t\t\t\t\tint nmask = encode(b);\n\t\t\t\t\t\t// System.out.println(\"from \");\n\t\t\t\t\t\t// print(a);\n\t\t\t\t\t\t// System.out.println(\"to \");\n\t\t\t\t\t\t// print(b);\n\t\t\t\t\t\tif (!dfs(nmask)) {\n\t\t\t\t\t\t\tdp[mask] = 1;\n\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tni+=di[k];\n\t\t\t\t\t\tnj+=dj[k];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tdp[mask] = 0;\n\t\treturn false;\n\t}\n\n\tprivate boolean inRange(int i, int j) {\n\t\tif (i < 0 || j < 0) return false;\n\t\tif (i >= n || j >= m) return false;\n\t\treturn true;\n\t}\n\n\tprivate void print(char [][]a) {\n\t\tfor(int i=0;i<n;i++) System.out.println(Arrays.toString(a[i]));\n\t\tSystem.out.println();\n\t}\n\n\tprivate char[][] copy(char [][]a) {\n\t\tchar [][]b = a.clone();\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tb[i] = b[i].clone();\n\t\t}\n\t\treturn b;\n\t}\n\n\tprivate int encode(char [][]a) {\n\t\tint mask = 0;\n\t\tfor(int i=0;i<19;i++){\n\t\t\tif (a[x[i]][y[i]] == 'O') {\n\t\t\t\tmask|=1<<i;\n\t\t\t}\n\t\t}\n\t\treturn mask;\n\t}\n\n\tprivate char[][] decode(int mask) {\n\t\tchar [][]r = new char[n][m];\n\t\tfor(int i=0;i<19;i++){\n\t\t\tif ((mask & (1 << i)) > 0) {\n\t\t\t\tr[x[i]][y[i]] = 'O';\n\t\t\t}else {\n\t\t\t\tr[x[i]][y[i]] = '.';\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\t\t\n\tpublic static void main(String[] args) throws Exception{\n\t\tnew Main().run();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "games", "dp", "bitmasks", "implementation"], "code_uid": "7bf1ad63f02d965b0bcc8faef3460126", "src_uid": "eaa022cc7846c983a826900dc6dd919f", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "\nimport java.io.*;\nimport java.util.*;\nimport static java.lang.Math.*;\n\npublic class BetaRound59_E implements Runnable {\n\n\tfinal boolean ONLINE_JUDGE = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tBufferedReader in;\n\tPrintWriter out;\n\tStringTokenizer tok = new StringTokenizer(\"\");\n\n\tvoid init() throws IOException {\n\t\tif (ONLINE_JUDGE) {\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(System.out);\n\t\t} else {\n\t\t\tin = new BufferedReader(new FileReader(\"input.txt\"));\n\t\t\tout = new PrintWriter(\"output.txt\");\n\t\t}\n\t}\n\n\tString readString() throws IOException {\n\t\twhile (!tok.hasMoreTokens()) {\n\t\t\ttok = new StringTokenizer(in.readLine());\n\t\t}\n\t\treturn tok.nextToken();\n\t}\n\n\tint readInt() throws IOException {\n\t\treturn Integer.parseInt(readString());\n\t}\n\n\t@Override\n\tpublic void run() {\n\t\ttry {\n\t\t\tlong t1 = System.currentTimeMillis();\n\t\t\tinit();\n\t\t\tsolve();\n\t\t\tout.close();\n\t\t\tlong t2 = System.currentTimeMillis();\n\t\t\tSystem.err.println(\"Time = \" + (t2 - t1));\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace(System.err);\n\t\t\tSystem.exit(-1);\n\t\t}\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Thread(new BetaRound59_E()).start();\n\t}\n\n\tclass State {\n\t\tint[] arr;\n\t\tState(int[] a) {\n\t\t\tarr = a;\n\t\t}\n\t}\n\t\n\tint[] getArray(List<Integer> list) {\n\t\tint[] ans = new int[list.size()];\n\t\tfor (int i = 0; i < ans.length; i++) {\n\t\t\tans[i] = list.get(i);\n\t\t}\n\t\treturn ans;\n\t}\n\t\n\tList<State> getStates(int[] a) {\n\t\tList<State> ans = new ArrayList<State>();\n\t\tList<Integer> list = new ArrayList<Integer>();\n\t\tfor (int from = 0; from < a.length; from++) {\n\t\t\tfor (int to = from + 1; to < a.length; to++) {\n\t\t\t\tfor (int k = from; k <= to; k++) {\n\t\t\t\t\tlist.add(a[k]);\n\t\t\t\t}\n\t\t\t\tans.add(new State(getArray(list)));\n\t\t\t\tlist.clear();\n\t\t\t}\n\t\t}\n\t\treturn ans;\n\t}\n\t\n\tint[] getPossibleMoveMasks() {\n\t\tfinal int[][] lines = {\n\t\t\t\t{1,2,3},\n\t\t\t\t{4,5,6,7},\n\t\t\t\t{8,9,10,11,12},\n\t\t\t\t{13,14,15,16},\n\t\t\t\t{17,18,19},\n\t\t\t\t\n\t\t\t\t{1,4,8},\n\t\t\t\t{2,5,9,13},\n\t\t\t\t{3,6,10,14,17},\n\t\t\t\t{7,11,15,18},\n\t\t\t\t{12,16,19},\n\t\t\t\t\n\t\t\t\t{8,13,17},\n\t\t\t\t{4,9,14,18},\n\t\t\t\t{1,5,10,15,19},\n\t\t\t\t{2,6,11,16},\n\t\t\t\t{3,7,12}\n\t\t};\n\t\t\n\t\tList<State> states = new ArrayList<State>();\n\t\tfor (int i = 1; i <= 19; i++) {\n\t\t\tstates.add(new State(new int[] {i}));\n\t\t}\n\t\tfor (int i = 0; i < lines.length; i++) {\n\t\t\tList<State> list = getStates(lines[i]);\n\t\t\tstates.addAll(list);\n\t\t}\n\t\t\n\t\tint[][] moves = new int[states.size()][];\n\t\tfor (int i = 0; i < moves.length; i++) {\n\t\t\tmoves[i] = states.get(i).arr;\n\t\t}\n\t\t\n\t\tint[] ans = new int[moves.length];\n\t\tfor (int i = 0; i < moves.length; i++) {\n\t\t\tint p = 0;\n\t\t\tfor (int j = 0; j < moves[i].length; j++) {\n\t\t\t\tp += (1 << (moves[i][j] - 1));\n\t\t\t}\n\t\t\tans[i] = p;\n\t\t}\n\t\tArrays.sort(ans);\n\t\treturn ans;\n\t}\n\t\n\tfinal int[] moves = getPossibleMoveMasks();\n\t\n\tvoid solve() throws IOException {\n\t\tint start = 0;\n\t\tfor (int i = 0; i < 19; i++) {\n\t\t\tString s = readString();\n\t\t\tif (s.equals(\"O\")) {\n\t\t\t\tstart += (1 << i);\n\t\t\t}\n\t\t}\n\t\tvis[0] = true;\n\t\tboolean ans = dfs(start);\n\t\tout.print(ans ? \"Karlsson\" : \"Lillebror\");\n\t}\n\t\n\tboolean[] d = new boolean[1 << 19];\n\tboolean[] vis = new boolean[1 << 19];\n\t\n\tboolean dfs(int from) {\n\t\tif (vis[from]) {\n\t\t\treturn d[from];\n\t\t}\n\t\tboolean ans = false;\n\t\tfor (int move : moves) {\n\t\t\tif ((from | move) == from) {\n\t\t\t\tans |= !dfs(from ^ move);\n\t\t\t}\n\t\t}\n\t\tvis[from] = true;\n\t\treturn d[from] = ans;\n\t}\n\t\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "games", "dp", "bitmasks", "implementation"], "code_uid": "064fdde3c4a65a1b5906f7b963f0fd01", "src_uid": "eaa022cc7846c983a826900dc6dd919f", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\n\npublic class SweetsGame {\n\tpublic static void main(String[] args) throws IOException {\n\t\t// TODO Auto-generated method stub\n\t\tBufferedReader r=new BufferedReader(new InputStreamReader(System.in));\n\t\tchar[][] arr=new char[5][];\n\t\tint index=18;\n\t\tint mask=0;\n\t\tfor (int i = 0; i < arr.length; i++) {\n\t\t\tString s=r.readLine().trim().replaceAll(\"[ ]+\", \"\");\n\t\t\t\n\t\t\tarr[i]=s.toCharArray();\n\t\t\tfor (int j = 0; j < arr[i].length; j++) {\n\t\t\t\tif(arr[i][j]=='O')\n\t\t\t\t\tmask|=(1<<index);\n\t\t\t\tindex--;\t\n\t\t\t}\n\t\t\t\n\t\t}\n\t\torg=mask;\n\t\tString[] res= {\"Karlsson\",\"Lillebror\"};\n\t\tSystem.out.println(res[go(mask,0)]);\n\t\t}\n\tstatic Integer[][] dp=new Integer[1<<19][2];\n\tstatic int org;\n\tpublic static char[][] encode(int mask){\n\t\tchar[][] arr=new char[5][];\n\t\tarr[0]=new char[3];\n\t\tarr[1]=new char[4];\n\t\tarr[2]=new char[5];\n\t\tarr[3]=new char[4];\n\t\tarr[4]=new char[3];\n\t\tint x=0,y=0;\n\t\tfor(int i=18;i>=0;i--){\n\t\t\tarr[x][y++]=(mask&1<<i)==(1<<i)?'o':'.';\n\t\t\tif(i==16){\n\t\t\t\tx++;\n\t\t\t\ty=0;\n\t\t\t}\n\t\t\tif(i==12){\n\t\t\t\tx++;\n\t\t\t\ty=0;\n\t\t\t}\n\t\t\tif(i==7){\n\t\t\t\tx++;\n\t\t\t\ty=0;\n\t\t\t}\n\t\t\tif(i==3){\n\t\t\t\tx++;\n\t\t\t\ty=0;\n\t\t\t}\n\t\t}\n//\t\tfor (int i = 0; i < arr.length; i++) {\n//\t\t\tSystem.out.println(new String(arr[i]));\n//\t\t}\n//\t\tSystem.out.println();\n\t\treturn arr;\n\t}\n\tpublic static int go(int mask,int turn){\n\t\tif(mask==0){\n\t\t\treturn 1-turn;\n\t\t}\n\t\tif(dp[mask][turn]!=null)return dp[mask][turn];\n\t\tchar[][]arr=encode(mask);\n\t\tfor(int i=0;i<5;i++){\n\t\t\tfor(int j=0;j<arr[i].length;j++){\n\t\t\t\tif(arr[i][j]=='o'){\n\t\t\t\t\tint newMask=mask;\n\t\t\t\t\tfor(int k=j;k<arr[i].length;k++){\n\t\t\t\t\t\tif(arr[i][k]=='o'){\n\t\t\t\t\t\t\tint index=get(i,k);\n\t\t\t\t\t\t\tnewMask&=(~(1<<index));\n\t\t\t\t\t\t\tif(go(newMask,1-turn)==turn){\n\t\t\t\t\t\t\t\treturn dp[mask][turn]=turn;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse break;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\n\t\t\t\t\t\tnewMask=mask;\n\t\t\t\t\t\tint col=j;\n\t\t\t\t\t\tfor(int k=i;k<arr.length;k++){\n\t\t\t\t\t\t\tif(col>=0&&col<arr[k].length&&arr[k][col]=='o'){\n\t\t\t\t\t\t\t\tint index=get(k,col);\n\t\t\t\t\t\t\t\tnewMask&=(~(1<<index));\n\t\t\t\t\t\t\t\tif(go(newMask,1-turn)==turn){\n\t\t\t\t\t\t\t\t\treturn dp[mask][turn]=turn;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif(k>=2)col--;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse break;\n\t\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\tnewMask=mask;\n\t\t\t\t\tnewMask=mask;\n\t\t\t\t\tint r=i , c=j;\n\t\t\t\t\twhile(true){\n\t\t\t\t\t\tif(r<arr.length&&c>=0&&c<arr[r].length&&arr[r][c]=='o'){\n\t\t\t\t\t\t\tint index=get(r,c);\n\t\t\t\t\t\t\tnewMask&=(~(1<<index));\n\t\t\t\t\t\t\tif(go(newMask,1-turn)==turn){\n\t\t\t\t\t\t\t\treturn dp[mask][turn]=turn;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tr++;\n\t\t\t\t\t\t\tif(r>2);else\n\t\t\t\t\t\t\tc++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse break;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn dp[mask][turn]=1-turn;\n\t}\n\tprivate static int get(int i, int k) {\n\t\tint[][] arr={{18,17,16},{15,14,13,12},{11,10,9,8,7},{6,5,4,3},{2,1,0}};\n\t\treturn arr[i][k];\n\t}\n\t\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "games", "dp", "bitmasks", "implementation"], "code_uid": "8827d39192c1e6243fd0277e4c640f08", "src_uid": "eaa022cc7846c983a826900dc6dd919f", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.BigInteger;\nimport static java.lang.Math.*;\n\npublic class Main implements Runnable {\n\tStringTokenizer tokenizer = new StringTokenizer(\"\");\n\tBufferedReader in;\n\tPrintStream out;\n\n\tint[] dm;\n\tint[] d = new int[1 << 19];\n\tint LEN = 47 * 6;\n\n\tpublic void debug(String s) {\n\t\tSystem.out.println(s);\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Thread(new Main()).start();\n\t}\n\n\tint win(int msk) {\n\t\tif (d[msk] != -1) {\n\t\t\treturn d[msk];\n\t\t}\n\t\tfor (int i = 0; i < LEN; i++) {\n\t\t\tint rmsk = dm[i];\n\t\t\tif (((msk & rmsk) == rmsk) && win(msk & (~rmsk)) == 0)\n\t\t\t\treturn d[msk] = 1;\n\t\t}\n\t\treturn d[msk] = 0;\n\t}\n\n\tpublic void run() {\n\t\ttry {\n\t\t\tLocale.setDefault(Locale.US);\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintStream(System.out);\n\n\t\t\tArrays.fill(d, -1);\n\t\t\td[0] = 0;\n\n\t\t\tdm = new int[LEN];\n\n\t\t\tint[][] a = new int[][] { new int[] { 0, 1, 2 },\n\t\t\t\t\tnew int[] { 3, 4, 5, 6 }, new int[] { 7, 8, 9, 10, 11 },\n\t\t\t\t\tnew int[] { 12, 13, 14, 15 }, new int[] { 16, 17, 18 } };\n\t\t\tint[] p = new int[19];\n\n\t\t\tp[0] = 2;\n\t\t\tp[2] = 11;\n\t\t\tp[11] = 18;\n\t\t\tp[18] = 16;\n\t\t\tp[16] = 7;\n\t\t\tp[7] = 0;\n\n\t\t\tp[9] = 9;\n\n\t\t\tp[4] = 5;\n\t\t\tp[5] = 10;\n\t\t\tp[10] = 14;\n\t\t\tp[14] = 13;\n\t\t\tp[13] = 8;\n\t\t\tp[8] = 4;\n\n\t\t\tp[1] = 6;\n\t\t\tp[6] = 15;\n\t\t\tp[15] = 17;\n\t\t\tp[17] = 12;\n\t\t\tp[12] = 3;\n\t\t\tp[3] = 1;\n\n\t\t\tint[][] w = new int[6][19];\n\t\t\tfor (int i = 0; i < 19; i++)\n\t\t\t\tw[0][i] = i;\n\t\t\tfor (int rot = 1; rot < 6; rot++) {\n\t\t\t\tfor (int i = 0; i < 19; i++) {\n\t\t\t\t\tw[rot][i] = p[w[rot - 1][i]];\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tint cnt = 0;\n\t\t\tfor (int rot = 0; rot < 6; rot++) {\n\t\t\t\tfor (int row = 0; row < 5; row++) {\n\t\t\t\t\tfor (int l = 0; l < a[row].length; l++) {\n\t\t\t\t\t\tfor (int r = l; r < a[row].length; r++) {\n\t\t\t\t\t\t\tint msk = 0;\n\t\t\t\t\t\t\tfor (int t = l; t <= r; t++)\n\t\t\t\t\t\t\t\tmsk |= (1 << w[rot][a[row][t]]);\n\t\t\t\t\t\t\tdm[cnt++] = msk;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t//for (int i = 0; i < dm.length; i++) out.println(dm[i]);\n\t\t\t\n\t\t\tint pos = 0;\n\t\t\t\n\t\t\tString s = \"\";\n\t\t\tfor (int i = 0; i < 5; i++) s += in.readLine();\n\t\t\ts = s.replace(\" \", \"\");\n\t\t\t//System.out.println(s);\n\t\t\tfor (int i = 0; i < s.length(); i++) if (s.charAt(i) == 'O') pos |= (1 << i);\n\t\t\t\n\t\t\tout.println(win(pos) == 1 ? \"Karlsson\" : \"Lillebror\");\n\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}\n\n\tboolean seekForToken() {\n\t\twhile (!tokenizer.hasMoreTokens()) {\n\t\t\tString s = null;\n\t\t\ttry {\n\t\t\t\ts = in.readLine();\n\t\t\t} catch (Exception e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (s == null)\n\t\t\t\treturn false;\n\t\t\ttokenizer = new StringTokenizer(s);\n\t\t}\n\t\treturn true;\n\t}\n\n\tString nextToken() {\n\t\treturn seekForToken() ? tokenizer.nextToken() : null;\n\t}\n\n\tint nextInt() {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n\n\tBigInteger nextBig() {\n\t\treturn new BigInteger(nextToken());\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "games", "dp", "bitmasks", "implementation"], "code_uid": "46096516346d68038d5c12a799ce9de1", "src_uid": "eaa022cc7846c983a826900dc6dd919f", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.StringTokenizer;\n\npublic class D {\n\n\tstatic ArrayList<Integer> cuts = new ArrayList<Integer>(102);\n\t\n\tstatic Boolean[] memo;\n\t\n\tstatic boolean win(int msk)\n\t{\n\t\tif(msk == 0)\n\t\t\treturn false;\n\t\tif(memo[msk] != null)\n\t\t\treturn memo[msk];\n\t\tboolean win = false;\n\t\tfor(int cut: cuts)\n\t\t\tif((msk & cut) == cut)\n\t\t\t\twin |= !win(msk ^ cut);\n\t\treturn memo[msk] = win;\n\t}\n\t\n\tpublic static void main(String[] args) throws IOException {\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\n\t\tfor(int i = 0; i < 19; ++i)\n\t\t\tcuts.add(1<<i);\n\t\tint[][] a = {{0, 1, 2}, {3, 4, 5, 6}, {7, 8, 9, 10, 11}, {12, 13, 14, 15}, {16, 17, 18}};\n\t\tint[][] b = {{0, 3, 7}, {1, 4, 8, 12}, {2, 5, 9, 13, 16}, {6, 10, 14, 17}, {11, 15, 18}};\n\t\tint[][] c = {{2, 6, 11}, {1, 5, 10, 15}, {0, 4, 9, 14, 18}, {3, 8, 13, 17}, {7, 12, 16}};\n\t\taddCuts(cuts, a);\n\t\taddCuts(cuts, b);\n\t\taddCuts(cuts, c);\n\t\t\n\t\tint msk = 0;\n\t\tfor(int i = 0; i < 19; ++i)\n\t\t\tif(sc.next().charAt(0) == 'O')\n\t\t\t\tmsk |= 1<<i;\n\t\tmemo = new Boolean[1<<19];\n\t\tout.println(win(msk)?\"Karlsson\":\"Lillebror\");\n\t\tout.flush();\n\t\tout.close();\n\t}\n\t\n\tstatic void addCuts(ArrayList<Integer> cuts, int[][] x)\n\t{\n\t\tfor(int[] y: x)\n\t\t\tfor(int len = 2; len <= y.length; ++len)\n\t\t\t\tfor(int i = 0; i + len <= y.length; ++i)\n\t\t\t\t{\n\t\t\t\t\tint msk = 0;\n\t\t\t\t\tfor(int j = i; j < i + len; ++j)\n\t\t\t\t\t\tmsk |= 1<<y[j];\n\t\t\t\t\tcuts.add(msk);\n\t\t\t\t}\n\t}\n\n\tstatic class Scanner \n\t{\n\t\tStringTokenizer st;\n\t\tBufferedReader br;\n\n\t\tpublic Scanner(InputStream s){\tbr = new BufferedReader(new InputStreamReader(s));}\n\n\t\tpublic String next() throws IOException \n\t\t{\n\t\t\twhile (st == null || !st.hasMoreTokens()) \n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {return Integer.parseInt(next());}\n\n\t\tpublic long nextLong() throws IOException {return Long.parseLong(next());}\n\n\t\tpublic String nextLine() throws IOException {return br.readLine();}\n\n\t\tpublic double nextDouble() throws IOException\n\t\t{\n\t\t\tString x = next();\n\t\t\tStringBuilder sb = new StringBuilder(\"0\");\n\t\t\tdouble res = 0, f = 1;\n\t\t\tboolean dec = false, neg = false;\n\t\t\tint start = 0;\n\t\t\tif(x.charAt(0) == '-')\n\t\t\t{\n\t\t\t\tneg = true;\n\t\t\t\tstart++;\n\t\t\t}\n\t\t\tfor(int i = start; i < x.length(); i++)\n\t\t\t\tif(x.charAt(i) == '.')\n\t\t\t\t{\n\t\t\t\t\tres = Long.parseLong(sb.toString());\n\t\t\t\t\tsb = new StringBuilder(\"0\");\n\t\t\t\t\tdec = true;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tsb.append(x.charAt(i));\n\t\t\t\t\tif(dec)\n\t\t\t\t\t\tf *= 10;\n\t\t\t\t}\n\t\t\tres += Long.parseLong(sb.toString()) / f;\n\t\t\treturn res * (neg?-1:1);\n\t\t}\n\n\t\tpublic boolean ready() throws IOException {return br.ready();}\n\n\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "games", "dp", "bitmasks", "implementation"], "code_uid": "e616e0a77188329d1e818c94ebf44015", "src_uid": "eaa022cc7846c983a826900dc6dd919f", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class E {\n\n int[][] f;\n int[] d;\n\n void solve() throws IOException {\n in(\"__std\"); out(\"__std\");\n\n f = new int[5][];\n int k = 0;\n for (int i = 0; i < 5; ++i) {\n char[] l = readLine().toCharArray();\n f[i] = new int[l.length];\n Arrays.fill(f[i], -1);\n for (int j = 0; j < l.length; ++j) {\n if (l[j] == 'O') {\n f[i][j] = k++;\n }\n }\n }\n int c = 1 << k;\n d = new int[c];\n if (win(c - 1)) {\n println(\"Karlsson\");\n } else {\n println(\"Lillebror\");\n }\n\n exit();\n }\n\n boolean win(int c) {\n if (d[c] == 0) {\n int r = 2;\n for (int i = 0; i < 5 && r == 2; ++i) {\n for (int j = 0; j < f[i].length && r == 2; ++j) {\n if (f[i][j] != -1 && (c & (1 << f[i][j])) != 0) {\n //right\n int cc = 0;\n int ii = i;\n int jj = j;\n while (jj < f[ii].length && r == 2 && f[ii][jj] != -1 && (c & (1 << f[ii][jj])) != 0) {\n cc |= 1 << f[ii][jj];\n if (!win(c & (~cc))) r = 1;\n jj += 2;\n }\n if (r == 2) {\n //diag left\n cc = 0;\n ii = i;\n jj = j;\n while (ii < 5 && jj >= 0 && r == 2 && f[ii][jj] != -1 && (c & (1 << f[ii][jj])) != 0) {\n cc |= 1 << f[ii][jj];\n if (!win(c & (~cc))) r = 1;\n ++ii;\n --jj;\n }\n if (r == 2) {\n //diag right\n cc = 0;\n ii = i;\n jj = j;\n while (ii < 5 && jj < f[ii].length && r == 2 && f[ii][jj] != -1 && (c & (1 << f[ii][jj])) != 0) {\n cc |= 1 << f[ii][jj];\n if (!win(c & (~cc))) r = 1;\n ++ii;\n ++jj;\n }\n }\n }\n }\n }\n }\n d[c] = r;\n }\n return d[c] == 1;\n }\n\n void in(String name) throws IOException {\n if (name.equals(\"__std\")) {\n in = new BufferedReader(new InputStreamReader(System.in));\n } else {\n in = new BufferedReader(new FileReader(name));\n }\n }\n\n void out(String name) throws IOException {\n if (name.equals(\"__std\")) {\n out = new PrintWriter(System.out);\n } else {\n out = new PrintWriter(name);\n }\n }\n\n void exit() {\n out.close();\n System.exit(0);\n }\n\n int readInt() throws IOException {\n return Integer.parseInt(readToken());\n }\n\n double readDouble() throws IOException {\n return Double.parseDouble(readToken());\n }\n\n String readLine() throws IOException {\n st = null;\n return in.readLine();\n }\n\n String readToken() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(in.readLine());\n }\n return st.nextToken();\n }\n\n boolean eof() throws IOException {\n return !in.ready();\n }\n\n void print(String format, Object ... args) {\n out.println(new Formatter().format(format, args));\n }\n\n void println(String format, Object ... args) {\n out.println(new Formatter().format(format, args));\n }\n\n void print(Object value) {\n out.print(value);\n }\n\n void println(Object value) {\n out.println(value);\n }\n\n void println() {\n out.println();\n }\n\n StringTokenizer st;\n\n BufferedReader in;\n PrintWriter out;\n\n public static void main(String[] args) throws IOException {\n new E().solve();\n }\n}", "lang_cluster": "Java", "tags": ["dfs and similar", "games", "dp", "bitmasks", "implementation"], "code_uid": "e4acacc6b5eaef4d5aaa1d61129ba04a", "src_uid": "eaa022cc7846c983a826900dc6dd919f", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import static java.util.Arrays.*;\nimport static java.lang.Math.*;\nimport static java.math.BigInteger.*;\nimport java.util.*;\nimport java.math.*;\nimport java.io.*;\n\npublic class E implements Runnable\n{\n String file = \"input\";\n \n boolean TEST = false;\n \n int[] mapCoord = new int[100];\n int[] mapBit = new int[100];\n char[][] cs;\n int rn = 5, cn = 9;\n \n void solve() throws IOException\n {\n cs = new char[rn][cn];\n int num = 0, mask = 0;\n fill(mapCoord, -1);\n \n for(int i = 0; i < 5; i++)\n {\n cs[i] = input.readLine().toCharArray();\n //print(i, cs[i]);\n for(int j = abs(2 - i), count = 0; count < 5 - abs(2 - i); count++, j += 2)\n {\n if(cs[i][j] == 'O') mask |= 1 << num;\n mapCoord[i * cn + j] = num;\n mapBit[num] = i * cn + j;\n //print(i, j, num);\n num++;\n }\n }\n //print(num, mask, mapBit);\n calc = new boolean[1 << 19];\n win = new boolean[1 << 19];\n if(can(mask)) out.println(\"Karlsson\");\n else out.println(\"Lillebror\");\n }\n \n int[] dy = {-1, 1, 2, 1, -1, -2};\n int[] dx = {-1, -1, 0, 1, 1, 0};\n boolean[] calc, win;\n \n boolean can(int mask)\n {\n //print(mask);\n if(mask == 0) return false;\n \n if(calc[mask]) return win[mask];\n calc[mask] = true;\n \n for(int i = 0; i < 19; i++)\n {\n if((mask >> i & 1) == 0) continue;\n int cur = mask ^ (1 << i);\n if(!can(cur)) return win[mask] = true;\n \n for(int k = 0; k < 6; k++)\n {\n cur = mask ^ (1 << i);\n \n int x = mapBit[i] / cn;\n int y = mapBit[i] % cn;\n \n while(x + dx[k] >= 0 && x + dx[k] < rn && y + dy[k] >= 0 && y + dy[k] < cs[x + dx[k]].length)\n {\n x += dx[k];\n y += dy[k];\n \n int j = mapCoord[x * cn + y];\n if(j == - 1 || (cur >> j & 1) == 0) break;\n \n cur ^= 1 << j;\n if(!can(cur)) return win[mask] = true;\n }\n }\n }\n return win[mask] = false;\n } \n \n String next() throws IOException\n {\n while(st == null || !st.hasMoreTokens()) st = new StringTokenizer(input.readLine());\n return st.nextToken();\n }\n \n int nextInt() throws IOException\n {\n return Integer.parseInt(next());\n }\n \n long nextLong() throws IOException\n {\n return Long.parseLong(next());\n }\n \n double nextDouble() throws IOException\n {\n return Double.parseDouble(next());\n }\n \n void print(Object... o)\n {\n System.out.println(deepToString(o));\n }\n \n void gcj(Object o)\n {\n String s = String.valueOf(o);\n out.println(\"Case #\" + test + \": \" + s);\n System.out.println(\"Case #\" + test + \": \" + s);\n }\n \n BufferedReader input;\n PrintWriter out;\n StringTokenizer st;\n int test;\n \n void init() throws IOException\n {\n if(TEST) input = new BufferedReader(new FileReader(file + \".in\")); \n else input = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(new BufferedOutputStream(System.out));\n }\n \n public static void main(String[] args) throws IOException\n {\n new Thread(null, new E(), \"\", 1 << 22).start();\n }\n \n public void run()\n {\n try\n {\n init();\n if(TEST) \n {\n int runs = nextInt();\n for(int i = 0; i < runs; i++) solve();\n }\n else solve();\n out.close(); \n }\n catch(Exception e)\n {\n e.printStackTrace();\n System.exit(1);\n }\n }\n}", "lang_cluster": "Java", "tags": ["dfs and similar", "games", "dp", "bitmasks", "implementation"], "code_uid": "a72286945c2218ca403136ca75bd7f8b", "src_uid": "eaa022cc7846c983a826900dc6dd919f", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "/**\n * Created by IntelliJ IDEA.\n * User: aircube\n * Date: 28.02.11\n * Time: 20:43\n * To change this template use File | Settings | File Templates.\n */\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class TaskD {\n BufferedReader br;\n PrintWriter out;\n StringTokenizer st;\n\n public static void main(String[] args) throws IOException {\n new TaskD().run();\n }\n\n void run() throws IOException {\n br = new BufferedReader(new InputStreamReader(System.in));\n st = null;\n out = new PrintWriter(System.out);\n solve();\n br.close();\n out.close();\n }\n\n\n int a[][] ;\n int dm[][];\n void solve() throws IOException {\n a = new int[15][];\n a[0] = new int[] {1, 2, 3};\n a[1] = new int[] {17, 18, 19};\n a[2] = new int[] {8, 13, 17};\n a[3] = new int[] {3, 7, 12};\n a[4] = new int[] {1, 4, 8};\n a[5] = new int[] {12, 16, 19};\n a[6] = new int[] {7, 11, 15, 18};\n a[7] = new int[] {2, 5, 9, 13};\n a[8] = new int[] {2, 6, 11, 16};\n a[9] = new int[] {13, 14, 15, 16};\n a[10] = new int[] {4, 9, 14, 18};\n a[11] = new int[] {4, 5, 6, 7};\n a[12] = new int[] {8, 9, 10, 11, 12};\n a[13] = new int[] {1, 5, 10, 15, 19};\n a[14] = new int[] {3, 6, 10, 14, 17};\n\n\n\n dm = new int[1 << 19][2];\n for (int i = 0; i < dm.length; ++i)\n dm[i][0] = dm[i][1] = -1;\n\n for (int i = 0; i < a.length; ++i)\n for (int j = 0; j < a[i].length; ++j)\n a[i][j] -- ;\n\n int mask = 0;\n for (int t = 0; t < 19; ++t) {\n String str = nextToken();\n if (str.compareTo(\"O\") == 0) mask |= (1 << t) ;;\n }\n int res = brute(mask, 0);\n out.print(res == 1 ? \"Karlsson\" : \"Lillebror\");\n\n }\n int brute(int mask, int turn) {\n if (mask == 0) {\n return turn;\n }\n if (dm[mask][turn] != -1) return dm[mask][turn];\n if (dm[mask][turn ^ 1] != -1) return dm[mask][turn ^ 1] ^ 1;\n\n for(int v = 0; v < a.length; ++v) {\n\n for (int i = 0; i < a[v].length; ++i) {\n for(int j = i; j < a[v].length; ++j) {\n boolean ok = true;\n for (int u = i; ok && u <= j; ++u) {\n if ((mask & (1 << a[v][u])) == 0) ok = false;\n }\n if (ok) {\n for (int I = i; I <= j; ++I)\n for(int J = I; J <= j; ++J) {\n int cm = 0;\n for (int k = I; k <= J; ++k) {\n cm |= (1 << a[v][k]);\n }\n int d = brute(mask ^ cm, turn ^ 1);\n if (turn == 0 && d == 1) return dm[mask][turn] = 1;\n if (turn == 1 && d == 0) return dm[mask][turn] = 0;\n }\n }\n }\n }\n }\n\n return dm[mask][turn] = turn;\n }\n\n int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n String nextToken() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return st.nextToken();\n }\n}", "lang_cluster": "Java", "tags": ["dfs and similar", "games", "dp", "bitmasks", "implementation"], "code_uid": "8f40f9fdbf617ec332a8cf9891c3eefb", "src_uid": "eaa022cc7846c983a826900dc6dd919f", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\nimport java.lang.*;\nimport java.math.*;\nimport java.io.*;\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\nimport static java.util.Collections.*;\n\npublic class P063E {\n\n\tScanner sc = new Scanner(System.in);\n\n\tint INF = 1 << 28;\n\tdouble EPS = 1e-9;\n\n\tint m = 19;\n\tint n = 5;\n\tint now;\n\n\tvoid run() {\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tnow |= sc.next().charAt(0) == 'O' ? (1 << i) : 0;\n\t\t}\n\t\tsolve();\n\t}\n\n\tint[][] map;\n\tint[] x, y;\n\n\tint[] win;\n\n\tvoid solve() {\n\t\tmap = new int[][] { { 0, 1, 2, -1, -1 }, { 3, 4, 5, 6, -1 },\n\t\t\t\t{ 7, 8, 9, 10, 11 }, { -1, 12, 13, 14, 15 },\n\t\t\t\t{ -1, -1, 16, 17, 18 } };\n\t\tx = new int[m];\n\t\ty = new int[m];\n\t\tfor (int j = 0; j < n; j++) {\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (map[j][i] != -1) {\n\t\t\t\t\tx[map[j][i]] = i;\n\t\t\t\t\ty[map[j][i]] = j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\twin = new int[1 << m];\n\t\tfill(win, -1);\n\n\t\tdfs(now);\n\n\t\t// debug(win[now]);\n\t\tprintln(new String[] { \"Lillebror\", \"Karlsson\" }[win[now]]);\n\t}\n\n\tint[] dx = { 1, 0, 1 };\n\tint[] dy = { 0, 1, 1 };\n\n\tint dfs(int state) {\n\t\tif (win[state] >= 0) {\n\t\t\treturn win[state];\n\t\t}\n\t\tif (state == 0) {\n\t\t\treturn win[state] = 0;\n\t\t}\n\t\tfor (int j = 0; j < n; j++) {\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tfor (int k = 0; k < 3; k++) {\n\t\t\t\t\tfor (int x = i, y = j, bit = 0; x < n && y < n\n\t\t\t\t\t\t\t&& map[y][x] != -1 && (state >> map[y][x] & 1) == 1; x += dx[k], y += dy[k]) {\n\t\t\t\t\t\tbit |= 1 << map[y][x];\n\t\t\t\t\t\tif (dfs(state ^ bit) == 0) {\n\t\t\t\t\t\t\twin[state] = 1;\n\t\t\t\t\t\t\treturn win[state];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn win[state] = 0;\n\t}\n\n\tvoid println(String s) {\n\t\tSystem.out.println(s);\n\t}\n\n\tvoid print(String s) {\n\t\tSystem.out.print(s);\n\t}\n\n\tvoid debug(Object... os) {\n\t\tSystem.err.println(deepToString(os));\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tLocale.setDefault(Locale.US);\n\t\tnew P063E().run();\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "games", "dp", "bitmasks", "implementation"], "code_uid": "a6519bd38424409950ec400495b8b521", "src_uid": "eaa022cc7846c983a826900dc6dd919f", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "\nimport java.util.*;\n\npublic class E {\n\n int p2[] = {1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024,\n 2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144};\n\n boolean bitSetted(int code, int bitNo) {\n return (code & (1 << bitNo)) != 0;\n }\n\n int clearBit(int code, int bitNo) {\n return code - p2[bitNo];\n }\n\n public static void main(String[] args) {\n new E().main();\n }\n int[][] gameLines = {\n // horizontal\n {0, 1, 2},\n {3, 4, 5, 6},\n {7, 8, 9, 10, 11},\n {12, 13, 14, 15},\n {16, 17, 18},\n // /-diag\n {7, 3, 0},\n {12, 8, 4, 1},\n {16, 13, 9, 5, 2},\n {17, 14, 10, 6},\n {18, 15, 11},\n // \\-diag\n {2, 6, 11},\n {1, 5, 10, 15},\n {0, 4, 9, 14, 18},\n {3, 8, 13, 17},\n {7, 12, 16}\n };\n int sg_values[] = new int[530000];\n\n boolean canDoMove(int position, int gameLineNo, int left, int right) {\n for (int i = left; i <= right; i++) {\n if (!bitSetted(position,gameLines[gameLineNo][i])) {\n return false;\n }\n }\n return true;\n }\n\n int doMove(int position, int gameLineNo, int left, int right) {\n int res = position;\n for (int i = left; i <= right; i++) {\n res = clearBit(res, gameLines[gameLineNo][i]);\n }\n return res;\n }\n\n ArrayList<Integer> inOneMove(Integer position) {\n ArrayList<Integer> res = new ArrayList<Integer>();\n\n for (int i = 0; i < gameLines.length; i++) {\n for (int left = 0; left < gameLines[i].length; left++) {\n for (int right = left; right < gameLines[i].length; right++) {\n if (canDoMove(position, i, left, right)) {\n res.add(doMove(position, i, left, right));\n }\n }\n }\n }\n return res;\n }\n\n // false, если позиция проигрышная\n // true, если выигрышная\n int SG(Integer position) {\n if (sg_values[position] != 0) {\n return sg_values[position];\n }\n //System.out.println(\"Calculating SG for \" + position);\n int res = -1;\n for (int x : inOneMove(position)) {\n if (SG(x) == -1) {\n res = 1;\n break;\n }\n }\n sg_values[position] = res;\n return res;\n }\n\n void main() {\n String spos = \"\";\n Scanner in = new Scanner(System.in);\n for (int i = 0; i < 5; i++) {\n String line = in.nextLine();\n for (char c : line.toCharArray()) {\n if (c == '.' || c == 'O') {\n spos += c;\n }\n }\n }\n int now = 0;\n for (int i = 0; i < spos.length(); i++) {\n if (spos.charAt(i) == 'O') {\n now += p2[i];\n }\n }\n sg_values[0] = -1;\n if (SG(now) == -1) {\n System.out.println(\"Lillebror\");\n } else {\n System.out.println(\"Karlsson\");\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "games", "dp", "bitmasks", "implementation"], "code_uid": "2da944d1fd5d6d558d6fbd209538c20a", "src_uid": "eaa022cc7846c983a826900dc6dd919f", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Igraskonfetami {\n\tstatic BufferedReader br = new BufferedReader(new InputStreamReader(\n\t\t\tSystem.in));\n\n\tstatic StringTokenizer in;\n\n\tstatic PrintWriter out = new PrintWriter(System.out);\n\n\tpublic static String nextToken() throws IOException {\n\t\twhile (in == null || !in.hasMoreTokens()) {\n\t\t\tin = new StringTokenizer(br.readLine());\n\t\t}\n\n\t\treturn in.nextToken();\n\t}\n\n\tpublic static int nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tpublic static double nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n\n\tstatic int[][] pos = new int[][] { { 0, 0, 1, 0, 2, 0, 3, 0, 0 },\n\t\t\t{ 0, 4, 0, 5, 0, 6, 0, 7, 0 }, { 8, 0, 9, 0, 10, 0, 11, 0, 12 },\n\t\t\t{ 0, 13, 0, 14, 0, 15, 0, 16, 0 }, { 0, 0, 17, 0, 18, 0, 19, 0, 0 } };\n\n\tstatic int[][] sweet = new int[][] { { 0, 2 }, { 0, 4 }, { 0, 6 },\n\t\t\t{ 1, 1 }, { 1, 3 }, { 1, 5 }, { 1, 7 }, { 2, 0 }, { 2, 2 },\n\t\t\t{ 2, 4 }, { 2, 6 }, { 2, 8 }, { 3, 1 }, { 3, 3 }, { 3, 5 },\n\t\t\t{ 3, 7 }, { 4, 2 }, { 4, 4 }, { 4, 6 } };\n\n\tstatic boolean[] ans;\n\n\tpublic static int get(boolean[][] c) {\n\t\tint mask = 0;\n\t\tfor (int i = 0; i < c.length; i++) {\n\t\t\tfor (int j = 0; j < c[0].length; j++) {\n\t\t\t\tif (c[i][j])\n\t\t\t\t\tmask += (1 << (pos[i][j] - 1));\n\t\t\t}\n\t\t}\n\n\t\treturn mask;\n\t}\n\n\tstatic boolean win(int mask) {\n\t\tboolean[][] state = new boolean[5][9];\n\n\t\tfor (int i = 0; i < 19; i++) {\n\t\t\tif ((mask & (1 << i)) > 0)\n\t\t\t\tstate[sweet[i][0]][sweet[i][1]] = true;\n\t\t}\n\n\t\tboolean win = false;\n\t\tfor (int i = 0; i < 19; i++) {\n\t\t\tint x = sweet[i][0];\n\t\t\tint y = sweet[i][1];\n\n\t\t\tif (!state[x][y])\n\t\t\t\tcontinue;\n\n\t\t\t// left\n\t\t\tint m = mask;\n\t\t\tfor (int j = y; j < 9 && state[x][j]; j += 2) {\n\t\t\t\tm -= (1 << (pos[x][j] - 1));\n\t\t\t\twin = win | !ans[m];\n\t\t\t\tif (win)\n\t\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\t// leftdiag\n\t\t\tm = mask;\n\t\t\tfor (int k = x, j = y; k < 5 && j >= 0 && state[k][j]; k++, j--) {\n\t\t\t\tm -= (1 << (pos[k][j] - 1));\n\t\t\t\twin = win | !ans[m];\n\t\t\t\tif (win)\n\t\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\t// rightdiag\n\t\t\tm = mask;\n\t\t\tfor (int k = x, j = y; k < 5 && j < 9 && state[k][j]; k++, j++) {\n\t\t\t\tm -= (1 << (pos[k][j] - 1));\n\n\t\t\t\twin = win | !ans[m];\n\t\t\t\tif (win)\n\t\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tif (win)\n\t\t\t\tbreak;\n\t\t}\n\n\t\treturn win;\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tans = new boolean[1 << 19];\n\n\t\tans[0] = false;\n\n\t\tfor (int i = 1; i < ans.length; i++) {\n\t\t\tif (i == 281){\n\t\t\t\tint k = 0;\n\t\t\t\tk++;\n\t\t\t}\n\t\t\t\n\t\t\tans[i] = win(i);\n\t\t}\n\n\t\tboolean[][] state = new boolean[5][9];\n\n\t\tfor (int i = 0; i < state.length; i++) {\n\t\t\tString S = br.readLine();\n\n\t\t\tfor (int j = 0; j < S.length(); j++) {\n\t\t\t\tif (S.charAt(j) == 'O')\n\t\t\t\t\tstate[i][j] = true;\n\t\t\t}\n\t\t}\n\n\t\tint mask = get(state);\n\n\t\tif (ans[mask])\n\t\t\tSystem.out.println(\"Karlsson\");\n\t\telse\n\t\t\tSystem.out.println(\"Lillebror\");\n\n\t\tout.close();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "games", "dp", "bitmasks", "implementation"], "code_uid": "ec2d43ff0b3f138e846557fca23bacb8", "src_uid": "eaa022cc7846c983a826900dc6dd919f", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "/**\n * Created by IntelliJ IDEA.\n * User: aircube\n * Date: 28.02.11\n * Time: 20:43\n * To change this template use File | Settings | File Templates.\n */\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\npublic class TaskD {\n BufferedReader br;\n PrintWriter out;\n StringTokenizer st;\n\n public static void main(String[] args) throws IOException {\n new TaskD().run();\n }\n\n void run() throws IOException {\n br = new BufferedReader(new InputStreamReader(System.in));\n st = null;\n out = new PrintWriter(System.out);\n solve();\n br.close();\n out.close();\n }\n\n\n int a[][] ;\n int dm[];\n void solve() throws IOException {\n a = new int[15][];\n a[0] = new int[] {1, 2, 3};\n a[1] = new int[] {17, 18, 19};\n a[2] = new int[] {8, 13, 17};\n a[3] = new int[] {3, 7, 12};\n a[4] = new int[] {1, 4, 8};\n a[5] = new int[] {12, 16, 19};\n a[6] = new int[] {7, 11, 15, 18};\n a[7] = new int[] {2, 5, 9, 13};\n a[8] = new int[] {2, 6, 11, 16};\n a[9] = new int[] {13, 14, 15, 16};\n a[10] = new int[] {4, 9, 14, 18};\n a[11] = new int[] {4, 5, 6, 7};\n a[12] = new int[] {8, 9, 10, 11, 12};\n a[13] = new int[] {1, 5, 10, 15, 19};\n a[14] = new int[] {3, 6, 10, 14, 17};\n\n\n\n dm = new int[1 << 19];\n Arrays.fill(dm, -1);\n\n for (int i = 0; i < a.length; ++i)\n for (int j = 0; j < a[i].length; ++j)\n a[i][j] -- ;\n\n int mask = 0;\n for (int t = 0; t < 19; ++t) {\n String str = nextToken();\n if (str.compareTo(\"O\") == 0) mask |= (1 << t) ;;\n }\n int res = brute(mask);\n out.print(res == 1 ? \"Karlsson\" : \"Lillebror\");\n\n }\n int brute(int mask) {\n if (mask == 0) {\n return 0;\n }\n if (dm[mask] != -1) return dm[mask];\n\n for(int v = 0; v < a.length; ++v) {\n\n for (int i = 0; i < a[v].length; ++i) {\n for(int j = i; j < a[v].length; ++j) {\n boolean ok = true;\n for (int u = i; ok && u <= j; ++u) {\n if ((mask & (1 << a[v][u])) == 0) ok = false;\n }\n if (ok) {\n for (int I = i; I <= j; ++I)\n for(int J = I; J <= j; ++J) {\n int cm = 0;\n for (int k = I; k <= J; ++k) {\n cm |= (1 << a[v][k]);\n }\n int d = brute(mask ^ cm);\n if (d == 0) return dm[mask] = 1;\n }\n }\n }\n }\n }\n return dm[mask] = 0;\n }\n\n int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n String nextToken() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return st.nextToken();\n }\n}", "lang_cluster": "Java", "tags": ["dfs and similar", "games", "dp", "bitmasks", "implementation"], "code_uid": "6ff911dc4ded16ee45018f282bed837e", "src_uid": "eaa022cc7846c983a826900dc6dd919f", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class E {\n\tint[]len=new int[]{3,4,5,4,3};\n\tint[][]getGet;\n\tboolean[]cached;\n\tboolean[]answer;\n\tvoid solve() throws Exception {\n\t\tcached=new boolean[1<<19];\n\t\tanswer=new boolean[1<<19];\n\t\tgetGet=new int[5][5];\n\t\tfor(int r=0;r<5;r++)\n\t\t\tfor(int c=0;c<5;c++)\n\t\t\t\tgetGet[r][c]=get(r,c);\n\t\tint set=0;\n\t\tfor(int r=0;r<5;r++)\n\t\t{\n\t\t\tString s=nextLine();\n\t\t\ts=s.replaceAll(\" \", \"\");\n\t\t\tfor(int j=0;j<len[r];j++)\n\t\t\t\tif((s.charAt(j))=='O')\n\t\t\t\t\tset|=1<<get(r,j);\n\t\t}\n\t\tif(rec(set))\n\t\t\tSystem.out.println(\"Karlsson\");\n\t\telse\n\t\t\tSystem.out.println(\"Lillebror\");\n\t}\n\tboolean rec(int set)\n\t{\n\t\tif(cached[set])\n\t\t\treturn answer[set];\t\t\n\t\tboolean res=false;\n\t\tfor(int r=0;r<5;r++)\n\t\t\tfor(int c=0;c<len[r];c++)\n\t\t\t{\n\t\t\t\tint num=get(r,c);\n\t\t\t\tif((set&(1<<num))>0)\n\t\t\t\t{\n\t\t\t\t\tint cr=r;\n\t\t\t\t\tint cc=c;\n\t\t\t\t\tint cset=set;\n\t\t\t\t\twhile(cr>=0 && cr<5 && cc>=0 && cc<len[cr] && (cset&(1<<getGet[cr][cc]))>0)\n\t\t\t\t\t{\n\t\t\t\t\t\tcset^=(1<<getGet[cr][cc]);\t\t\t\t\t\t\n\t\t\t\t\t\tres|=!rec(cset);\n\t\t\t\t\t\tcc++;\n\t\t\t\t\t}\n\t\t\t\t\tcr=r;\n\t\t\t\t\tcc=c;\n\t\t\t\t\tcset=set;\n\t\t\t\t\twhile(cr>=0 && cr<5 && cc>=0 && cc<len[cr] && (cset&(1<<getGet[cr][cc]))>0)\n\t\t\t\t\t{\n\t\t\t\t\t\tcset^=(1<<getGet[cr][cc]);\t\t\t\t\t\t\n\t\t\t\t\t\tres|=!rec(cset);\n\t\t\t\t\t\tif(cr==2 || cr==3)\n\t\t\t\t\t\t\tcc--;\n\t\t\t\t\t\tcr++;\n\t\t\t\t\t}\n\t\t\t\t\tcr=r;\n\t\t\t\t\tcc=c;\n\t\t\t\t\tcset=set;\n\t\t\t\t\twhile(cr>=0 && cr<5 && cc>=0 && cc<len[cr] && (cset&(1<<getGet[cr][cc]))>0)\n\t\t\t\t\t{\n\t\t\t\t\t\tcset^=(1<<getGet[cr][cc]);\t\t\t\t\t\t\n\t\t\t\t\t\tres|=!rec(cset);\n\t\t\t\t\t\tif(cr==0 || cr==1)\n\t\t\t\t\t\t\tcc++;\n\t\t\t\t\t\tcr++;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\tcached[set]=true;\n\t\tanswer[set]=res;\n\t\treturn res;\n\t\t\n\t}\n\tint get(int r,int c)\n\t{\n\t\tint res=0;\n\t\tfor(int i=0;i<r;i++)\n\t\t\tres+=len[i];\n\t\treturn res+c;\n\t}\n\n\tBufferedReader reader;\n\tPrintWriter writer;\n\tStringTokenizer stk;\n\n\tvoid run() throws Exception {\n\t\treader = new BufferedReader(new InputStreamReader(System.in));\n\t\tstk = null;\n\t\twriter = new PrintWriter(System.out);\n\t\tsolve();\n\t\treader.close();\n\t\twriter.close();\n\t}\n\n\tint nextInt() throws Exception {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() throws Exception {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() throws Exception {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n\n\tString nextString() throws Exception {\n\t\treturn nextToken();\n\t}\n\n\tString nextLine() throws Exception {\n\t\treturn reader.readLine();\n\t}\n\n\tString nextToken() throws Exception {\n\t\tif (stk == null || !stk.hasMoreTokens()) {\n\t\t\tstk = new StringTokenizer(nextLine());\n\t\t\treturn nextToken();\n\t\t}\n\t\treturn stk.nextToken();\n\t}\n\n\tpublic static void main(String[] a) throws Exception {\n\t\tnew E().run();\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "games", "dp", "bitmasks", "implementation"], "code_uid": "64e4a18ffb8f8ee728d56d2668502b41", "src_uid": "eaa022cc7846c983a826900dc6dd919f", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\nimport java.lang.*;\nimport java.math.*;\nimport java.io.*;\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\nimport static java.util.Collections.*;\n\n// Sweets Game\n// 2012/11/03\npublic class P063E{\n\tScanner sc=new Scanner(System.in);\n\n\tint m=19, n=5;\n\tint now;\n\n\tvoid run(){\n\t\tfor(int i=0; i<m; i++){\n\t\t\tnow|=sc.next().charAt(0)=='O'?(1<<i):0;\n\t\t}\n\t\tsolve();\n\t}\n\n\tint[][] map;\n\tint[] win;\n\n\tvoid solve(){\n\t\tmap=new int[][]{{0, 1, 2, -1, -1}, {3, 4, 5, 6, -1}, {7, 8, 9, 10, 11},\n\t\t\t\t{-1, 12, 13, 14, 15}, {-1, -1, 16, 17, 18}};\n\t\twin=new int[1<<m];\n\t\tfill(win, -1);\n\t\tprintln(new String[]{\"Lillebror\", \"Karlsson\"}[dfs(now)]);\n\t}\n\n\tint[] dx={1, 0, 1};\n\tint[] dy={0, 1, 1};\n\n\tint dfs(int state){\n\t\tif(win[state]>=0){\n\t\t\treturn win[state];\n\t\t}\n\t\tif(state==0){\n\t\t\treturn win[state]=0;\n\t\t}\n\t\tfor(int j=0; j<n; j++){\n\t\t\tfor(int i=0; i<n; i++){\n\t\t\t\tfor(int k=0; k<3; k++){\n\t\t\t\t\tfor(int x=i, y=j, bit=0; x<n&&y<n&&map[y][x]!=-1\n\t\t\t\t\t\t\t&&(state>>map[y][x]&1)==1; x+=dx[k], y+=dy[k]){\n\t\t\t\t\t\tbit|=1<<map[y][x];\n\t\t\t\t\t\tif(dfs(state^bit)==0){\n\t\t\t\t\t\t\twin[state]=1;\n\t\t\t\t\t\t\treturn win[state];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn win[state]=0;\n\t}\n\n\tvoid println(String s){\n\t\tSystem.out.println(s);\n\t}\n\n\tvoid print(String s){\n\t\tSystem.out.print(s);\n\t}\n\n\tpublic static void main(String[] args){\n\t\tLocale.setDefault(Locale.US);\n\t\tnew P063E().run();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "games", "dp", "bitmasks", "implementation"], "code_uid": "d8949cf4be75041fe131d627f16c761c", "src_uid": "eaa022cc7846c983a826900dc6dd919f", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.LinkedList;\nimport java.util.Locale;\nimport java.util.Queue;\nimport java.util.Random;\nimport java.util.StringTokenizer;\nimport java.util.TreeMap;\n\npublic class Solution implements Runnable {\n\n public static void main(String[] args) {\n (new Thread(new Solution())).start();\n }\n\n BufferedReader in;\n PrintWriter out;\n StringTokenizer st;\n\n String nextToken() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n String r = in.readLine();\n if (r == null) return null;\n st = new StringTokenizer(r);\n }\n return st.nextToken();\n }\n\n int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n \n int[][] a = new int[5][5];\n \n void uncode(int q) {\n int t = 24;\n for (int i = 0; i < 19; i++) {\n while (a[t / 5][t % 5] == -1) t--;\n a[t / 5][t % 5] = q % 2;\n t--; q /= 2;\n }\n }\n \n int code() {\n int t = 0;\n int res = 0;\n for (int i = 0; i < 19; i++) {\n while (a[t / 5][t % 5] == -1) t++;\n res *= 2;\n res += a[t / 5][t % 5];\n t++;\n }\n return res;\n }\n \n void clone(int[][] a, int[][] b) {\n for (int i = 0; i < 5; i++) {\n for (int j = 0; j < 5; j++) {\n b[i][j] = a[i][j];\n }\n }\n }\n \n int[] ans = new int[1000000];\n \n boolean valid(int q) {\n if (q == 0) return false;\n while (q % 2 == 0) q /= 2;\n return (q & (q - 1)) == 0;\n }\n \n boolean rek(int q) {\n if (ans[q] != -1) return ans[q] == 1;\n boolean f = false;\n for (int i = 0; i < tl; i++) {\n if ((q | turn[i]) == q) {\n f |= !rek(q ^ turn[i]);\n }\n }\n ans[q] = f? 1 : 0;\n return f;\n }\n \n int[] turn = new int[25 * 25 * 25];\n int tl = 0;\n \n void solve() throws Exception {\n Arrays.fill(ans, -1);\n a[0][3] = a[0][4] = a[1][4] = -1;\n a[4][0] = a[4][1] = a[3][0] = -1;\n for (int i = 0; i < 5; i++) {\n for (int j = 0; j < 5; j++) {\n for (int k = 0; i + k < 5 && a[i + k][j] != -1; k++) {\n int[][] b = new int[5][5];\n clone(a, b);\n for (int kk = 0; kk <= k; kk++) a[i + kk][j] = 1;\n turn[tl++] = code();\n clone(b, a);\n }\n for (int k = 0; j + k < 5 && a[i][j + k] != -1; k++) {\n int[][] b = new int[5][5];\n clone(a, b);\n for (int kk = 0; kk <= k; kk++) a[i][j + kk] = 1;\n turn[tl++] = code();\n clone(b, a);\n }\n for (int k = 0; i + k < 5 && j + k < 5 && a[i + k][j + k] != -1; k++) {\n int[][] b = new int[5][5];\n clone(a, b);\n for (int kk = 0; kk <= k; kk++) a[i + kk][j + kk] = 1;\n turn[tl++] = code();\n clone(b, a);\n }\n }\n }\n Arrays.sort(turn, 0, tl);\n int ii = 1;\n for (int i = 1; i < tl; i++) {\n if (turn[i] != turn[i - 1]) turn[ii++] = turn[i];\n }\n tl = ii;\n int res = 0;\n for (int i = 0; i < 19; i++) {\n res *= 2;\n if (nextToken().charAt(0) != '.') res++;\n }\n if (rek(res)) out.println(\"Karlsson\"); else out.println(\"Lillebror\");\n }\n \n public void run() {\n Locale.setDefault(Locale.UK);\n try {\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n solve();\n } catch (Exception e) {\n e.printStackTrace();\n System.exit(1);\n } finally {\n out.flush();\n }\n }\n\n}", "lang_cluster": "Java", "tags": ["dfs and similar", "games", "dp", "bitmasks", "implementation"], "code_uid": "ca4b28d3c6f6bfc1f34983846be1ec70", "src_uid": "eaa022cc7846c983a826900dc6dd919f", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.InputStream;\nimport java.io.FilterInputStream;\nimport java.util.NoSuchElementException;\nimport java.io.BufferedInputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Iterator;\nimport java.io.IOException;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Zyflair Griffane\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputUtil in = new InputUtil(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTask_E_Sweets_Game solver = new Task_E_Sweets_Game();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass Task_E_Sweets_Game {\n public static final int[][][] directions = {\n {{3, 7}, {4, 9, 14, 18}, {1, 2}},\n {{0}, {4, 8, 12}, {5, 10, 15}, {2}},\n {{1, 0}, {5, 9, 13, 16}, {6, 11}},\n {{0}, {7}, {8, 13, 17}, {4, 5, 6}},\n {{1}, {0}, {3}, {8, 12}, {9, 14, 18}, {5, 6}},\n {{2}, {1}, {4, 3}, {9, 13, 16}, {10, 15}, {6}},\n {{2}, {5, 4, 3}, {10, 14, 17}, {11}},\n {{3, 0}, {12, 16}, {8, 9, 10, 11}},\n {{4, 1}, {3}, {7}, {12}, {13, 17}, {9, 10, 11}},\n {{5, 2}, {4, 0}, {8, 7}, {13, 16}, {14, 18}, {10, 11}},\n {{6}, {5, 1}, {9, 8, 7}, {14, 17}, {15}},\n {{6, 2}, {10, 9, 8, 7}, {15, 18}},\n {{8, 4, 1}, {7}, {16}, {13, 14, 15}},\n {{9, 5, 2}, {8, 3}, {12}, {16}, {17}, {14, 15}},\n {{10, 6}, {9, 4, 0}, {13, 12}, {17}, {18}, {15}},\n {{11}, {10, 5, 1}, {14, 13, 12}, {18}},\n {{13, 9, 5, 2}, {12, 7}, {17, 18}},\n {{14, 10, 6}, {13, 8, 3}, {16}, {18}},\n {{15, 11}, {14, 9, 4, 0}, {17, 16}}\n };\n\n public static final int[] memo = new int[1 << 19];\n public void solve(int testNumber, InputUtil in, PrintWriter out) {\n memo[0] = 1;\n int mask = 0;\n for (int i = 0; i < 19; i++) {\n if (in.next().charAt(0) != '.') {\n mask += 1 << i;\n }\n }\n out.println(solve(mask) == 2 ? \"Karlsson\" : \"Lillebror\");\n }\n\n public int solve(int mask) {\n if (memo[mask] == 0) {\n for (int i = 0; i < 19; i++) {\n if ((mask & (1 << i)) > 0) {\n if (solve(mask & ~(1 << i)) == 1) {\n return memo[mask] = 2;\n }\n for (int[] line: directions[i]) {\n int removeMask = 1 << i;\n for (int piece: line) {\n if ((mask & (1 << piece)) == 0) break;\n removeMask |= 1 << piece;\n if (solve(mask & ~removeMask) == 1) {\n return memo[mask] = 2;\n }\n }\n }\n }\n }\n memo[mask] = 1;\n }\n return memo[mask];\n }\n}\n\nclass InputUtil {\n\n JoltyScanner in;\n\n public InputUtil(InputStream istream) {\n in = new JoltyScanner(istream);\n }\n\n public String next() {\n return in.nextOrNull();\n }\n\n}\n\nclass JoltyScanner {\n public static final int BUFFER_SIZE = 1 << 16;\n\tpublic static final char NULL_CHAR = (char) -1;\n\n BufferedInputStream in;\n\tStringBuilder str = new StringBuilder();\n\tbyte[] buffer = new byte[BUFFER_SIZE];\n\tboolean EOF_FLAG = false;\n\n char c = NULL_CHAR;\n\tint bufferIdx = 0;\n int size = 0;\n\n\tpublic JoltyScanner(InputStream in) {\n\t\tthis.in = new BufferedInputStream(in, BUFFER_SIZE);\n\t}\n\n public String next() {\n\t\tcheckEOF();\n\t\tfor (c = c == NULL_CHAR ? nextChar() : c; Character.isWhitespace(c); checkEOF()) {\n\t\t\tc = nextChar();\n\t\t}\n\t\tstr.setLength(0);\n\t\tfor (; !EOF_FLAG && !Character.isWhitespace(c); c = nextChar()) {\n\t\t\tstr.append(c);\n\t\t}\n\t\treturn str.toString();\n\t}\n\n\tpublic String nextOrNull() {\n\t\ttry {\n\t\t\treturn next();\n\t\t} catch (EndOfFileException e) {\n\t\t\treturn null;\n\t\t}\n\t}\n\n public char nextChar() {\n\t\tif (EOF_FLAG) {\n\t\t\treturn NULL_CHAR;\n\t\t}\n\t\twhile (bufferIdx == size) {\n\t\t\ttry {\n\t\t\t\tsize = in.read(buffer);\n\t\t\t\tif (size == -1) {\n\t\t\t\t\tthrow new Exception();\n\t\t\t\t}\n\t\t\t} catch (Exception e) {\n\t\t\t\tEOF_FLAG = true;\n\t\t\t\treturn NULL_CHAR;\n\t\t\t}\n\t\t\tif (size == -1) {\n\t\t\t\tsize = BUFFER_SIZE;\n\t\t\t}\n\t\t\tbufferIdx = 0;\n\t\t}\n\t\treturn (char) buffer[bufferIdx++];\n\t}\n\n public void checkEOF() {\n\t\tif (EOF_FLAG) {\n\t\t\tthrow new EndOfFileException();\n\t\t}\n\t}\n\n\tpublic class EndOfFileException extends RuntimeException {\n\t}\n}\n\n", "lang_cluster": "Java", "tags": ["dfs and similar", "games", "dp", "bitmasks", "implementation"], "code_uid": "ba555aa2404db2e50bbe0ebbf18a20de", "src_uid": "eaa022cc7846c983a826900dc6dd919f", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\nimport java.io.*;\nimport static java.lang.Math.*;\n\npublic class Main{\n public static void main(String[] args) throws Exception{\n new Main().run();\n }\n\n int[] dp = new int[1<<19];\n final int[] dh = new int[]{0, 3, 7, 12, 16};\n final int[] dw = new int[]{3, 4, 5, 4, 3};\n boolean firstWin(int mask){\n if(dp[mask] != 0)return dp[mask] == 1;\n boolean ok = true;\n loop:\n for(int i = 0; i < 5; i++){\n for(int j = 0; j < dw[i]; j++){\n int k = dh[i] + j;\n if(((mask >> k) & 1) == 0)continue;\n int v = mask;\n int cy = i, cx = j;\n for(;;){\n int ind = dh[cy] + cx;\n v -= 1 << ind;\n boolean ret = firstWin(v);\n if(!ret){\n ok = false;\n break loop;\n }\n cy++;\n if(cy > 2)cx--;\n if(cy >= 5 || cx < 0 || cx >= dw[cy] || ((v >> (dh[cy] + cx)) & 1) == 0)break;\n }\n\n cy = i; cx = j;\n v = mask - (1 << (dh[cy] + cx));\n for(;;){\n cy++;\n if(cy < 3)cx++;\n if(cy >= 5 || cx < 0 || cx >= dw[cy] || ((v >> (dh[cy] + cx)) & 1) == 0)break;\n int ind = dh[cy] + cx;\n v -= 1 << ind;\n boolean ret = firstWin(v);\n if(!ret){\n ok = false;\n break loop;\n }\n }\n\n cy = i; cx = j;\n v = mask - (1 << (dh[cy] + cx));\n for(;;){\n cx++;\n if(cy >= 5 || cx < 0 || cx >= dw[cy] || ((v >> (dh[cy] + cx)) & 1) == 0)break;\n int ind = dh[cy] + cx;\n v -= 1 << ind;\n boolean ret = firstWin(v);\n if(!ret){\n ok = false;\n break loop;\n }\n }\n\n }\n }\n if(ok){\n dp[mask] = -1;\n return false;\n }else{\n dp[mask] = 1;\n return true;\n }\n }\n\n\n int toi(boolean[] u){\n int ret = 0;\n for(int i = 0; i < u.length; i++)if(u[i])ret += 1 << i;\n return ret;\n }\n\n void run() throws Exception{\n Scanner sc = new Scanner(System.in);\n //BufferedReader sc = new BufferedReader(new InputStreamReader(System.in));\n // only sc.readLine() is available\n boolean[] u = new boolean[19];\n for(int i = 0; i < 19; i++)u[i] = sc.next().equals(\"O\");\n boolean ret = firstWin(toi(u));\n System.out.println(ret ? \"Karlsson\" : \"Lillebror\");\n }\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "games", "dp", "bitmasks", "implementation"], "code_uid": "38ba0d78b660b68047fbdd151d8a1341", "src_uid": "eaa022cc7846c983a826900dc6dd919f", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\n\npublic class SweetsGame {\n\tstatic int[] memo;\n\tstatic int[] sj = new int[]{0,0,0,1,2};\n\tstatic int[] dj = new int[]{3,4,5,5,5};\n\tstatic int[] dx = new int[]{0,1,1};\n\tstatic int[] dy = new int[]{1,1,0};\n\tpublic static void main(String[] args){\n\t\tScanner reader = new Scanner(System.in);\n\t\tint[][] d = new int[5][5];\n\t\tfor(int i = 0; i < 5; i++){\n\t\t\tfor(int j = sj[i]; j < dj[i]; j++){\n\t\t\t\td[i][j] = reader.next().equals(\".\")?0:1;\n\t\t\t}\n\t\t}\t\t\n\t\t\n\t\tmemo = new int[(1<<19)];\n\t\tSystem.out.println(f(e(d))>0?\"Karlsson\":\"Lillebror\");\n\t}\n\t\n\tpublic static void print(int n, int[][] d){\n\t\tSystem.out.println(\"At \" + n + \", processing \" + e(d));\n\t\tfor(int i = 0; i < 5; i++)\n\t\t\tSystem.out.println(Arrays.toString(d[i]));\n\t}\n\t\n\tpublic static int f(int n){\n\t\t//System.out.println(Integer.toString(n,2));\n\t\tif(memo[n] == 0){\n\t\t\tif(n == 0){\n\t\t\t\tmemo[n] = -1;\n\t\t\t}else{\n\t\t\t\tint[][] d = d(n);\n\t\t\t\tint canwin = -1;\n//\t\t\t\tprint(n, d);\n\t\t\t\tfor(int i = 0; i < 5 && canwin < 0; i++){\n\t\t\t\t\tfor(int j = sj[i]; j < dj[i] && canwin < 0; j++){\n\t\t\t\t\t\t//Proceed in each direction\n\t\t\t\t\t\tfor(int k = 0; k < 3 && canwin < 0; k++){\n\t\t\t\t\t\t\tint L = 0;\n\t\t\t\t\t\t\twhile(nx(i,k,L) >= 0 && nx(i,k,L) < 5 && ny(j,k,L) >= sj[nx(i,k,L)] && ny(j,k,L) < dj[nx(i,k,L)] && d[nx(i,k,L)][ny(j,k,L)] > 0 && canwin < 0){\n\t\t\t\t\t\t\t\t//System.out.println(\"Killing \" + i + \" \" + j + \" \" + L + \" from \" + \" \" + n);\n\t\t\t\t\t\t\t\td[nx(i,k,L)][ny(j,k,L)] = 0;\n//\t\t\t\t\t\t\t\tprint(n, d);\n\t\t\t\t\t\t\t\tcanwin = Math.max(canwin, -f(e(d)));\n\t\t\t\t\t\t\t\tL++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t//Reset bitmask\n\t\t\t\t\t\t\tfor(int z = 0; z < L; z++)\n\t\t\t\t\t\t\t\td[nx(i,k,z)][ny(j,k,z)] = 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tmemo[n] = canwin;\n\t\t\t}\n\t\t}\n//\t\tSystem.out.println(n + \" \" + memo[n]);\n\t\treturn memo[n];\n\t}\n\t\n\tpublic static int nx(int i, int k, int L){\n\t\treturn i + dx[k]*L;\n\t}\n\t\n\tpublic static int ny(int j, int k, int L){\n\t\treturn j + dy[k]*L;\n\t}\n\t\n\tpublic static int[][] d(int e){\n\t\tint[][] d = new int[5][5];\n\t\t\n\t\tfor(int i = 4; i >= 0; i--){\n\t\t\tfor(int j = dj[i]-1; j >= sj[i]; j--){\n\t\t\t\td[i][j] = (e&1);\n\t\t\t\te >>= 1;\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn d;\n\t}\n\t\n\tpublic static int e(int[][] d){\n\t\tint e = 0;\n\t\tfor(int i = 0; i < 5; i++){\n\t\t\tfor(int j = sj[i]; j < dj[i]; j++){\n\t\t\t\te <<= 1;\n\t\t\t\te |= d[i][j];\n\t\t\t}\n\t\t}\n\t\treturn e;\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "games", "dp", "bitmasks", "implementation"], "code_uid": "b3f3b532e60ffa05591bb665c8f6165a", "src_uid": "eaa022cc7846c983a826900dc6dd919f", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "/**\n * Created by IntelliJ IDEA.\n * User: aircube\n * Date: 28.02.11\n * Time: 20:43\n * To change this template use File | Settings | File Templates.\n */\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class TaskD {\n BufferedReader br;\n PrintWriter out;\n StringTokenizer st;\n\n public static void main(String[] args) throws IOException {\n new TaskD().run();\n }\n\n void run() throws IOException {\n br = new BufferedReader(new InputStreamReader(System.in));\n st = null;\n out = new PrintWriter(System.out);\n solve();\n br.close();\n out.close();\n }\n\n\n int a[][] ;\n int dm[][];\n void solve() throws IOException {\n a = new int[15][];\n a[0] = new int[] {1, 2, 3};\n a[1] = new int[] {4, 5, 6, 7};\n a[2] = new int[] {8, 9, 10, 11, 12};\n a[3] = new int[] {13, 14, 15, 16};\n a[4] = new int[] {17, 18, 19};\n a[5] = new int[] {8, 13, 17};\n a[6] = new int[] {4, 9, 14, 18};\n a[7] = new int[] {1, 5, 10, 15, 19};\n a[8] = new int[] {2, 6, 11, 16};\n a[9] = new int[] {3, 7, 12};\n a[10] = new int[] {1, 4, 8};\n a[11] = new int[] {2, 5, 9, 13};\n a[12] = new int[] {3, 6, 10, 14, 17};\n a[13] = new int[] {7, 11, 15, 18};\n a[14] = new int[] {12, 16, 19};\n\n dm = new int[1 << 19][2];\n for (int i = 0; i < dm.length; ++i)\n dm[i][0] = dm[i][1] = -1;\n\n for (int i = 0; i < a.length; ++i)\n for (int j = 0; j < a[i].length; ++j)\n a[i][j] -- ;\n\n int mask = 0;\n for (int t = 0; t < 19; ++t) {\n String str = nextToken();\n if (str.compareTo(\"O\") == 0) mask |= (1 << t) ;;\n }\n int res = brute(mask, 0);\n out.print(res == 1 ? \"Karlsson\" : \"Lillebror\");\n\n }\n int brute(int mask, int turn) {\n if (mask == 0) {\n return turn;\n }\n if (dm[mask][turn] != -1) return dm[mask][turn];\n\n for(int v = 0; v < a.length; ++v) {\n\n for (int i = 0; i < a[v].length; ++i) {\n for(int j = i; j < a[v].length; ++j) {\n boolean ok = true;\n for (int u = i; ok && u <= j; ++u) {\n if ((mask & (1 << a[v][u])) == 0) ok = false;\n }\n if (ok) {\n for (int I = i; I <= j; ++I)\n for(int J = I; J <= j; ++J) {\n int cm = 0;\n for (int k = I; k <= J; ++k) {\n cm |= (1 << a[v][k]);\n }\n int d = brute(mask ^ cm, turn ^ 1);\n if (turn == 0 && d == 1) return dm[mask][turn] = 1;\n if (turn == 1 && d == 0) return dm[mask][turn] = 0;\n }\n }\n }\n }\n }\n\n return dm[mask][turn] = turn;\n }\n\n int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n String nextToken() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return st.nextToken();\n }\n}", "lang_cluster": "Java", "tags": ["dfs and similar", "games", "dp", "bitmasks", "implementation"], "code_uid": "499a7e80027faf898fff4714606257e0", "src_uid": "eaa022cc7846c983a826900dc6dd919f", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "/**\n * Created by IntelliJ IDEA.\n * User: Taras_Brzezinsky\n * Date: 8/24/11\n * Time: 8:54 PM\n * To change this template use File | Settings | File Templates.\n */\n\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.io.FileReader;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.util.Arrays;\n\npublic class TaskD extends Thread {\n\n public TaskD() {\n this.input = new BufferedReader(new InputStreamReader(System.in));\n this.output = new PrintWriter(System.out);\n this.setPriority(Thread.MAX_PRIORITY);\n }\n\n\n static class Matrix {\n long[][] grid;\n long[][] helper;\n\n public Matrix(int size, boolean E) {\n this.grid = new long[size][size];\n this.helper = new long[size][size];\n if (E) {\n for (int i = 0; i < grid.length; ++i) {\n grid[i][i] = 1;\n }\n }\n }\n\n public Matrix pow(long power) {\n Matrix result = new Matrix(grid.length, true);\n Matrix stat = new Matrix(grid.length, false);\n for (int i = 0; i < grid.length; ++i) {\n stat.grid[i] = this.grid[i].clone();\n }\n while (power != 0) {\n if ((power & 1) == 1) {\n result.multiply(stat);\n --power;\n } else {\n stat.multiply(stat);\n power >>= 1;\n }\n }\n return result;\n }\n\n\n private void multiply(Matrix another) {\n for (long[] current : helper) {\n Arrays.fill(current, 0);\n }\n for (int i = 0; i < grid.length; ++i) {\n for (int j = 0; j < grid.length; ++j) {\n for (int k = 0; k < grid.length; ++k) {\n helper[i][j] += (grid[i][k] * another.grid[k][j]) % MODULO;\n }\n helper[i][j] %= MODULO;\n }\n }\n for (int i = 0; i < grid.length; ++i) {\n System.arraycopy(helper[i], 0, grid[i], 0, grid.length);\n }\n }\n }\n\n\n static class Rule {\n char letter;\n char value;\n\n public Rule(char letter, char value) {\n this.letter = letter;\n this.value = value;\n }\n }\n\n private void generate(int index) {\n if (index == initial.length) {\n states[SIZE++] = initial.clone();\n } else {\n for (char value = 0; value < rules[index].value; ++value) {\n initial[index] = value;\n generate(index + 1);\n }\n }\n }\n\n private boolean isFinal(int index) {\n for (char letter = 'A'; letter <= 'Z'; ++letter) {\n boolean was = false, isGood = false;\n for (int i = 0; i < rules.length; ++i) {\n if (rules[i].letter == letter) {\n was = true;\n isGood |= states[index][i] == 0;\n }\n }\n if (was && !isGood) {\n return false;\n }\n }\n return true;\n }\n\n\n private void solve() throws Throwable {\n long n = nextLong();\n int c = nextInt();\n int s = c;\n c = 0;\n rules = new Rule[s];\n int total = 1;\n for (int i = 0; i < s; ++ i) {\n rules[c] = new Rule(nextToken().charAt(0), (char) (nextInt()));\n boolean was = false;\n for (int q = 0; q < c; ++q) {\n if (rules[q].letter == rules[c].letter && rules[q].value == rules[c].value) {\n was = true;\n break;\n }\n }\n if (!was){\n total *= rules[c++].value;\n }\n }\n rules = Arrays.copyOf(rules, c);\n initial = new char[c];\n states = new char[total][];\n generate(0);\n Matrix operator = new Matrix(total, false);\n for (int from = 0; from < total; ++from) {\n for (char letter = 'A'; letter <= 'Z'; ++letter) {\n boolean isPresent = false;\n char []helper = states[from].clone();\n for (int i = 0; i < c; ++i) {\n if (rules[i].letter == letter) {\n isPresent = true;\n helper[i] = (char)((helper[i] + 1) % rules[i].value);\n }\n }\n if (isPresent) {\n for (int to = 0; to < states.length; ++to) {\n boolean ok = true;\n for (int index = 0; index < c; ++index) {\n ok &= states[to][index] == helper[index];\n }\n if (ok) {\n operator.grid[from][to]++;\n break;\n }\n }\n }\n }\n }\n\n Matrix finish = operator.pow(n);\n long result = 0;\n for (int current = 0; current < total; ++current) {\n if (isFinal(current)) {\n result = (result + finish.grid[0][current]) % MODULO;\n }\n }\n output.println(result);\n }\n\n public void run() {\n try {\n solve();\n } catch (Throwable e) {\n System.err.println(e.getMessage());\n e.printStackTrace();\n System.exit(666);\n } finally {\n output.flush();\n output.close();\n }\n }\n\n\n public static void main(String[] args) {\n new TaskD().start();\n }\n\n private String nextToken() throws IOException {\n while (tokens == null || !tokens.hasMoreTokens()) {\n tokens = new StringTokenizer(input.readLine());\n }\n return tokens.nextToken();\n }\n\n private int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n private double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n private long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n private int SIZE = 0;\n private static final int MODULO = 12345;\n private char[][] states;\n private char[] initial;\n private Rule[] rules;\n private BufferedReader input;\n private PrintWriter output;\n private StringTokenizer tokens = null;\n}\n", "lang_cluster": "Java", "tags": ["matrices", "dp", "graphs"], "code_uid": "bc6f38bab3a6dadae13fa67ee834be06", "src_uid": "76d4684d26dac380713a566a1e277c91", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class cfRound83_D {\n\n BufferedReader br;\n PrintWriter out;\n StringTokenizer st;\n boolean eof;\n \n final int MOD = 12345;\n \n int[][] mul(int[][] a, int[][] b) {\n int[][] res = new int[sz][sz];\n for (int i = 0; i < sz; i++)\n for (int j = 0; j < sz; j++)\n for (int k = 0; k < sz; k++) {\n res[i][j] += a[i][k] * b[k][j];\n res[i][j] %= MOD;\n }\n \n \n return res;\n }\n \n int[][] power(int[][] a, long b) {\n if (b == 0) {\n int[][] res = new int[sz][sz];\n for (int i = 0; i < sz; i++)\n res[i][i] = 1;\n return res;\n }\n \n if ((b & 1) == 1)\n return mul(a, power(a, b - 1));\n \n int[][] tmp = power(a, b >> 1);\n return mul(tmp, tmp);\n \n }\n \n int gcd(int a, int b) {\n return b == 0 ? a : gcd(b, a % b);\n }\n \n int lcm(int a, int b) {\n if (a == 0)\n return b;\n if (b == 0)\n return a;\n \n return a / gcd(a, b) * b;\n }\n \n int sz;\n\n void solve() throws IOException {\n long n = nextLong();\n \n ArrayList<Integer>[] list = new ArrayList[26];\n for (int i = 0; i < 26; i++)\n list[i] = new ArrayList<Integer>();\n \n int c = nextInt();\n \n for (int i = 0; i < c; i++) {\n String s = nextToken();\n int x = nextInt();\n list[s.charAt(0) - 'A'].add(x);\n }\n \n ArrayList<Integer> can = new ArrayList<Integer>();\n ArrayList<Integer> mult = new ArrayList<Integer>();\n ArrayList<Integer> lcm = new ArrayList<Integer>();\n \n sz = 1;\n \n for (int i = 0; i < 26; i++)\n if (!list[i].isEmpty()) {\n int curLcm = 0;\n for (int x : list[i])\n curLcm = lcm(curLcm, x);\n can.add(i);\n mult.add(sz);\n sz *= curLcm;\n lcm.add(curLcm);\n }\n \n mult.add(sz);\n \n// System.err.println(can);\n// System.err.println(mult);\n// System.err.println(lcm);\n \n int[][] matr = new int[sz][sz];\n \n for (int i = 0; i < sz; i++) {\n for (int j = 0; j < can.size(); j++) {\n int oldRem = i % mult.get(j + 1) / mult.get(j);\n int newRem = (oldRem + 1) % lcm.get(j);\n matr[i - oldRem * mult.get(j) + newRem * mult.get(j)][i]++;\n }\n }\n \n matr = power(matr, n);\n \n int ans = 0;\n \n for (int i = 0; i < sz; i++) {\n boolean goodTotalRem = true;\n for (int j = 0; j < can.size(); j++) {\n int curRem = i % mult.get(j + 1) / mult.get(j);\n boolean goodRem = false;\n for (int good : list[can.get(j)])\n if (curRem % good == 0) {\n goodRem = true;\n break;\n }\n if (!goodRem) {\n goodTotalRem = false;\n break;\n }\n }\n if (goodTotalRem) {\n ans += matr[i][0];\n if (ans >= MOD)\n ans -= MOD;\n }\n }\n \n out.println(ans);\n }\n\n void inp() throws IOException {\n br = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n solve();\n out.close();\n }\n\n public static void main(String[] args) throws IOException {\n new cfRound83_D().inp();\n }\n\n String nextToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (Exception e) {\n eof = true;\n return \"0\";\n }\n }\n return st.nextToken();\n }\n\n String nextString() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (Exception e) {\n eof = true;\n return \"0\";\n }\n }\n return st.nextToken(\"\\n\");\n }\n\n int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n}\n\n", "lang_cluster": "Java", "tags": ["matrices", "dp", "graphs"], "code_uid": "dec13f2dd02dfa9b9553f654907b2a50", "src_uid": "76d4684d26dac380713a566a1e277c91", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "/**\n * Created by IntelliJ IDEA.\n * User: Taras_Brzezinsky\n * Date: 8/24/11\n * Time: 8:54 PM\n * To change this template use File | Settings | File Templates.\n */\n\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.util.Arrays;\n\npublic class TaskD extends Thread {\n\n public TaskD() {\n this.input = new BufferedReader(new InputStreamReader(System.in));\n this.output = new PrintWriter(System.out);\n this.setPriority(Thread.MAX_PRIORITY);\n }\n\n private int getIndex(int[][] data, int[] values) {\n for (int i = 0; i < data.length; ++i) {\n if (Arrays.equals(data[i], values)) {\n return i;\n }\n }\n throw new IllegalArgumentException();\n }\n\n private void generate(int index) {\n if (index == helper.length) {\n states[SIZE++] = helper.clone();\n } else {\n for (int value = 0; value < v[index]; ++value) {\n helper[index] = value;\n generate(index + 1);\n }\n }\n }\n\n private int[][] pow(int[][] src, long power) {\n int[][] result = new int[src.length][src.length];\n for (int i = 0; i < result.length; ++i) {\n result[i][i] = 1;\n }\n for (; power != 0; power >>= 1) {\n if ((power & 1) == 1) {\n result = multiply(result, src);\n }\n src = multiply(src, src);\n }\n return result;\n }\n\n private int[][] multiply(int[][] left, int[][] right) {\n int[][] result = new int[left.length][left.length];\n for (int i = 0; i < left.length; ++i) {\n for (int j = 0; j < left.length; ++j) {\n for (int k = 0; k < left.length; ++k) {\n result[i][j] += (left[i][k] * right[k][j]) % MODULO;\n }\n result[i][j] %= MODULO;\n }\n }\n return result;\n }\n\n private void solve() throws Throwable {\n long n = nextLong();\n int c = nextInt();\n l = new int[c];\n v = new int[c];\n int total = 1;\n for (int i = 0; i < c; ++i) {\n l[i] = nextToken().charAt(0) - 'A';\n used[l[i]] = true;\n total *= (v[i] = nextInt());\n }\n states = new int[total][];\n helper = new int[c];\n generate(0);\n int[][] grid = new int[total][total];\n for (int current = 0; current < total; ++current) {\n for (int i = 0; i < AlPHABET_SIZE; ++i) {\n helper = states[current].clone();\n if (used[i]) {\n for (int ind = 0; ind < c; ++ind) {\n if (l[ind] == i) {\n helper[ind] = (helper[ind] + 1) % v[ind];\n }\n }\n grid[current][getIndex(states, helper)]++;\n }\n }\n }\n int[][] result = pow(grid, n);\n int answer = 0;\n for (int currentState = 0; currentState < total; ++currentState) {\n Arrays.fill(good, false);\n for (int i = 0; i < c; ++i) {\n good[l[i]] |= states[currentState][i] == 0;\n }\n boolean can = true;\n for (int i = 0; i < AlPHABET_SIZE; ++i) {\n if (used[i] && !good[i]) {\n can = false;\n break;\n }\n }\n if (can) {\n answer = (answer + result[0][currentState]) % MODULO;\n }\n }\n output.println(answer);\n }\n\n public void run() {\n try {\n solve();\n } catch (Throwable e) {\n System.err.println(e.getMessage());\n e.printStackTrace();\n System.exit(666);\n } finally {\n output.flush();\n output.close();\n }\n }\n\n\n public static void main(String[] args) {\n new TaskD().start();\n }\n\n private String nextToken() throws IOException {\n while (tokens == null || !tokens.hasMoreTokens()) {\n tokens = new StringTokenizer(input.readLine());\n }\n return tokens.nextToken();\n }\n\n private int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n private double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n private long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n \n private static int[][] states;\n static private int[] helper, l, v;\n private static int SIZE = 0;\n private static final int MODULO = 12345, AlPHABET_SIZE = 26;\n static boolean[] used = new boolean[AlPHABET_SIZE], good = new boolean[AlPHABET_SIZE];\n private BufferedReader input;\n private PrintWriter output;\n private StringTokenizer tokens = null;\n}\n", "lang_cluster": "Java", "tags": ["matrices", "dp", "graphs"], "code_uid": "f0768593398caef36e431fb994447f22", "src_uid": "76d4684d26dac380713a566a1e277c91", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class cfRound83_D {\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\tboolean eof;\n\t\n\tfinal int MOD = 12345;\n\t\n\tint[][] mul(int[][] a, int[][] b) {\n\t\tint[][] res = new int[sz][sz];\n\t\tfor (int i = 0; i < sz; i++)\n\t\t\tfor (int j = 0; j < sz; j++)\n\t\t\t\tfor (int k = 0; k < sz; k++) {\n\t\t\t\t\tres[i][j] += a[i][k] * b[k][j];\n\t\t\t\t\tres[i][j] %= MOD;\n\t\t\t\t}\n\t\t\n\t\t\n\t\treturn res;\n\t}\n\t\n\tint[][] power(int[][] a, long b) {\n\t\tif (b == 0) {\n\t\t\tint[][] res = new int[sz][sz];\n\t\t\tfor (int i = 0; i < sz; i++)\n\t\t\t\tres[i][i] = 1;\n\t\t\treturn res;\n\t\t}\n\t\t\n\t\tif ((b & 1) == 1)\n\t\t\treturn mul(a, power(a, b - 1));\n\t\t\n\t\tint[][] tmp = power(a, b >> 1);\n\t\t\treturn mul(tmp, tmp);\n\t\t\n\t}\n\t\n\tint gcd(int a, int b) {\n\t\treturn b == 0 ? a : gcd(b, a % b);\n\t}\n\t\n\tint lcm(int a, int b) {\n\t\tif (a == 0)\n\t\t\treturn b;\n\t\tif (b == 0)\n\t\t\treturn a;\n\t\t\n\t\treturn a / gcd(a, b) * b;\n\t}\n\t\n\tint sz;\n\n\tvoid solve() throws IOException {\n\t\tlong n = nextLong();\n\t\t\n\t\tArrayList<Integer>[] list = new ArrayList[26];\n\t\tfor (int i = 0; i < 26; i++)\n\t\t\tlist[i] = new ArrayList<Integer>();\n\t\t\n\t\tint c = nextInt();\n\t\t\n\t\tfor (int i = 0; i < c; i++) {\n\t\t\tString s = nextToken();\n\t\t\tint x = nextInt();\n\t\t\tlist[s.charAt(0) - 'A'].add(x);\n\t\t}\n\t\t\n\t\tArrayList<Integer> can = new ArrayList<Integer>();\n\t\tArrayList<Integer> mult = new ArrayList<Integer>();\n\t\tArrayList<Integer> lcm = new ArrayList<Integer>();\n\t\t\n\t\tsz = 1;\n\t\t\n\t\tfor (int i = 0; i < 26; i++)\n\t\t\tif (!list[i].isEmpty()) {\n\t\t\t\tint curLcm = 0;\n\t\t\t\tfor (int x : list[i])\n\t\t\t\t\tcurLcm = lcm(curLcm, x);\n\t\t\t\tcan.add(i);\n\t\t\t\tmult.add(sz);\n\t\t\t\tsz *= curLcm;\n\t\t\t\tlcm.add(curLcm);\n\t\t\t}\n\t\t\n\t\tmult.add(sz);\n\t\t\n//\t\tSystem.err.println(can);\n//\t\tSystem.err.println(mult);\n//\t\tSystem.err.println(lcm);\n\t\t\n\t\tint[][] matr = new int[sz][sz];\n\t\t\n\t\tfor (int i = 0; i < sz; i++) {\n\t\t\tfor (int j = 0; j < can.size(); j++) {\n\t\t\t\tint oldRem = i % mult.get(j + 1) / mult.get(j);\n\t\t\t\tint newRem = (oldRem + 1) % lcm.get(j);\n\t\t\t\tmatr[i - oldRem * mult.get(j) + newRem * mult.get(j)][i]++;\n\t\t\t}\n\t\t}\n\t\t\n\t\tmatr = power(matr, n);\n\t\t\n\t\tint ans = 0;\n\t\t\n\t\tfor (int i = 0; i < sz; i++) {\n\t\t\tboolean goodTotalRem = true;\n\t\t\tfor (int j = 0; j < can.size(); j++) {\n\t\t\t\tint curRem = i % mult.get(j + 1) / mult.get(j);\n\t\t\t\tboolean goodRem = false;\n\t\t\t\tfor (int good : list[can.get(j)])\n\t\t\t\t\tif (curRem % good == 0) {\n\t\t\t\t\t\tgoodRem = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\tif (!goodRem) {\n\t\t\t\t\tgoodTotalRem = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (goodTotalRem) {\n\t\t\t\tans += matr[0][i];\n\t\t\t\tif (ans >= MOD)\n\t\t\t\t\tans -= MOD;\n\t\t\t}\n\t\t}\n\t\t\n\t\tout.println(ans);\n\t}\n\n\tvoid inp() throws IOException {\n\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.close();\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew cfRound83_D().inp();\n\t}\n\n\tString nextToken() {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (Exception e) {\n\t\t\t\teof = true;\n\t\t\t\treturn \"0\";\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tString nextString() {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (Exception e) {\n\t\t\t\teof = true;\n\t\t\t\treturn \"0\";\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken(\"\\n\");\n\t}\n\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n}\n", "lang_cluster": "Java", "tags": ["matrices", "dp", "graphs"], "code_uid": "0933f2b03df63c80076da73188322ae3", "src_uid": "76d4684d26dac380713a566a1e277c91", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.awt.Point;\nimport java.awt.geom.Line2D;\nimport java.awt.geom.Point2D;\nimport java.io.*;\nimport java.math.BigInteger;\nimport static java.math.BigInteger.*;\nimport java.util.*;\n\npublic class D{\n\n int mod=12345;\n void solve()throws Exception\n {\n int ones=0;\n HashMap<Integer,ArrayList<Integer>>map=new HashMap<Integer,ArrayList<Integer>>();\n long n=nextLong();\n int c=nextInt();\n int p=1;\n for(int i=0;i<c;i++)\n {\n int t=nextString().charAt(0)-'A';\n int m=nextInt();\n if(!map.containsKey(t))\n map.put(t,new ArrayList<Integer>());\n map.get(t).add(m);\n }\n int[][]ar=new int[map.size()][];\n int[]l=new int[ar.length];\n\n int ind=0;\n for(Integer x: map.keySet())\n {\n ArrayList<Integer>t=map.get(x);\n ar[ind]=new int[t.size()];\n int ind2=0;\n l[ind]=1;\n for(int i=0;i<t.size();i++)\n {\n ar[ind][ind2]=t.get(i);\n l[ind]=getLcm(l[ind],ar[ind][ind2]);\n ind2++;\n }\n p*=l[ind];\n ind++;\n }\n long[][]mat=new long[p][p];\n for(int i=0;i<p;i++)\n {\n int[]state=new int[ar.length];\n int cur=i;\n for(int j=0;j<state.length;j++)\n {\n state[j]=cur%l[j];\n cur/=l[j];\n }\n for(int j=0;j<state.length;j++)\n {\n int[]ns=state.clone();\n ns[j]=(ns[j]+1)%l[j];\n cur=0;\n for(int k=state.length-1;k>=0;k--)\n {\n cur=cur*l[k]+ns[k];\n }\n mat[i][cur]++;\n }\n\n }\n long[][]res=pow(mat,n);\n long sum=0;\n for(int i=0;i<p;i++)\n {\n int[]state=new int[ar.length];\n int cur=i;\n boolean ok=true;\n for(int j=0;j<state.length;j++)\n {\n state[j]=cur%l[j];\n cur/=l[j];\n boolean any=false;\n for(int x: ar[j])\n if(state[j]%x==0)\n any=true;\n if(!any)\n ok=false;\n\n }\n if(ok)\n sum=(sum+res[0][i])%mod;\n\n }\n System.out.println(sum);\n\n }\n\n\n private int getLcm(int a, int b) {\n return a/BigInteger.valueOf(a).gcd(BigInteger.valueOf(b)).intValue()*b;\n }\n\n private long[][] pow(long[][] mat, long p) {\n if(p==0)\n {\n long[][]res=new long[mat.length][mat.length];\n for(int i=0;i<res.length;i++)\n res[i][i]=1;\n return res;\n }\n long[][]res=pow(mat,p/2);\n res=mul(res,res);\n if(p%2==1)\n res=mul(res,mat);\n return res;\n }\n\n private long[][] mul(long[][] a, long[][] b) {\n long[][]c=new long[a.length][a.length];\n for(int i=0;i<c.length;i++)\n for(int j=0;j<c.length;j++)\n for(int k=0;k<c.length;k++)\n c[i][j]=(a[i][k]*b[k][j]+c[i][j])%mod;\n return c;\n }\n\n ////////////\n BufferedReader reader;\n PrintWriter writer;\n StringTokenizer stk;\n void run()throws Exception\n {\n reader=new BufferedReader(new InputStreamReader(System.in));\n stk=null;\n writer=new PrintWriter(System.out);\n solve();\n reader.close();\n writer.close();\n }\n int nextInt()throws Exception\n {\n return Integer.parseInt(nextToken());\n }\n\n long nextLong()throws Exception\n {\n return Long.parseLong(nextToken());\n\n }\n double nextDouble()throws Exception\n {\n return Double.parseDouble(nextToken());\n\n\n }\n\n String nextString()throws Exception\n {\n return nextToken();\n }\n String nextLine()throws Exception\n {\n return reader.readLine();\n }\n String nextToken()throws Exception\n {\n if(stk==null || !stk.hasMoreTokens())\n {\n stk=new StringTokenizer(nextLine());\n return nextToken();\n\n }\n return stk.nextToken();\n }\n\n public static void main(String[]args) throws Exception\n {\n new D().run();\n }\n\n\n\n}", "lang_cluster": "Java", "tags": ["matrices", "dp", "graphs"], "code_uid": "c5f47076d5c26b85f41e025259ab56eb", "src_uid": "76d4684d26dac380713a566a1e277c91", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.HashMap;\n\n/**\n * Created by IntelliJ IDEA.\n * User: piyushd\n * Date: 3/29/11\n * Time: 7:56 PM\n * To change this template use File | Settings | File Templates.\n */\npublic class TaskD {\n\n int[] product;\n int[][] I;\n final int MOD = 12345;\n\n int[] decode(int code) {\n int[] a = new int[26];\n for(int i = 0; i < 26; i++) {\n a[i] = code % product[i];\n code /= product[i];\n }\n return a;\n }\n\n int encode(int[] a) {\n int code = 0;\n for(int i = 25; i >= 0; i--) {\n code = code * product[i] + a[i];\n }\n return code;\n }\n\n int[][] matrixMult(int[][] a, int[][] b) {\n int[][] c = new int[a.length][a.length];\n for(int k = 0; k < a.length; k++) {\n for(int i = 0; i < a.length; i++) {\n for(int j = 0; j < a.length; j++) {\n c[i][j] += a[i][k] * b[k][j];\n c[i][j] %= MOD;\n }\n }\n }\n return c;\n }\n\n int[][] matrixExponentiation(int[][] a, long N) {\n if(N == 0) return this.I;\n\n if(N % 2 == 0) {\n int[][] x = matrixExponentiation(a, N / 2);\n return matrixMult(x, x);\n }\n\n return matrixMult(a, matrixExponentiation(a, N - 1));\n }\n\n void run() {\n long N = nextLong();\n int c = nextInt();\n\n ArrayList<Integer>[] multiplicities = new ArrayList[26];\n for(int i = 0; i < multiplicities.length; i++) multiplicities[i] = new ArrayList<Integer>();\n\n for(int i = 0; i < c; i++) {\n String character = next();\n int multiple = nextInt();\n multiplicities[character.charAt(0) - 'A'].add(multiple);\n }\n\n\n int M = 1;\n this.product = new int[26];\n for (int i = 0; i < 26; i++) {\n product[i] = 1;\n for (int x : multiplicities[i])\n product[i] *= x;\n M *= product[i];\n }\n\n int[][] a = new int[M][M];\n for(int i = 0; i < M; i++) {\n for(int j = 0; j < 26; j++) if(multiplicities[j].size() > 0) {\n int[] d = decode(i);\n d[j]++;\n d[j] %= product[j];\n int code = encode(d);\n a[i][code]++;\n }\n }\n\n this.I = new int[M][M];\n for(int i = 0; i < M; i++) I[i][i] = 1;\n\n int[][] na = matrixExponentiation(a, N);\n\n int ans = 0;\n for(int code = 0; code < M; code++) {\n int[] d = decode(code);\n\n boolean ok = true;\n for(int j = 0; j < 26 && ok; j++) if(multiplicities[j].size() > 0) {\n boolean got = false;\n for(int x : multiplicities[j])\n if(d[j] % x == 0) got = true;\n ok = got;\n }\n\n if(ok) {\n ans = (ans + na[0][code]) % MOD;\n }\n }\n\n System.out.println(ans);\n }\n\n int nextInt(){\n try{\n int c = System.in.read();\n if(c == -1) return c;\n while(c != '-' && (c < '0' || '9' < c)){\n c = System.in.read();\n if(c == -1) return c;\n }\n if(c == '-') return -nextInt();\n int res = 0;\n do{\n res *= 10;\n res += c - '0';\n c = System.in.read();\n }while('0' <= c && c <= '9');\n return res;\n }catch(Exception e){\n return -1;\n }\n }\n\n long nextLong(){\n try{\n int c = System.in.read();\n if(c == -1) return -1;\n while(c != '-' && (c < '0' || '9' < c)){\n c = System.in.read();\n if(c == -1) return -1;\n }\n if(c == '-') return -nextLong();\n long res = 0;\n do{\n res *= 10;\n res += c-'0';\n c = System.in.read();\n }while('0' <= c && c <= '9');\n return res;\n }catch(Exception e){\n return -1;\n }\n }\n\n double nextDouble(){\n return Double.parseDouble(next());\n }\n\n String next(){\n try{\n StringBuilder res = new StringBuilder(\"\");\n int c = System.in.read();\n while(Character.isWhitespace(c))\n c = System.in.read();\n do{\n res.append((char)c);\n }while(!Character.isWhitespace(c=System.in.read()));\n return res.toString();\n }catch(Exception e){\n return null;\n }\n }\n\n String nextLine(){\n try{\n StringBuilder res = new StringBuilder(\"\");\n int c = System.in.read();\n while(c == '\\r' || c == '\\n')\n c = System.in.read();\n do{\n res.append((char)c);\n c = System.in.read();\n }while(c != '\\r' && c != '\\n');\n return res.toString();\n }catch(Exception e){\n return null;\n }\n }\n\n public static void main(String[] args){\n new TaskD().run();\n }\n}\n", "lang_cluster": "Java", "tags": ["matrices", "dp", "graphs"], "code_uid": "6d5ba637fb4a2eb9eb1d171706fdeff3", "src_uid": "76d4684d26dac380713a566a1e277c91", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "//package round83;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\n\npublic class D3 {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t\tlong n = nl();\n\t\tint m = ni();\n\t\tint[] alp = new int[m];\n\t\tint[] val = new int[m];\n\t\tint r = 1;\n\t\tfor(int i = 0;i < m;i++){\n\t\t\talp[i] = nc()-'A';\n\t\t\tval[i] = ni();\n\t\t\tr *= val[i];\n\t\t}\n\t\tint[][] g = packD(26, alp, val);\n\t\tint[] mul = new int[26];\n\t\tfor(int i = 0;i < 26;i++){\n\t\t\tmul[i] = 1;\n\t\t\tfor(int j : g[i]){\n\t\t\t\tmul[i] *= j;\n\t\t\t}\n\t\t}\n\t\t\n\t\tint[][] M = new int[r][r];\n\t\tfor(int i = 0;i < r;i++){\n\t\t\tint[] a = dec(i, mul);\n\t\t\tfor(int j = 0;j < 26;j++){\n\t\t\t\tif(g[j].length > 0){\n\t\t\t\t\ta[j] = (a[j]+1)%mul[j];\n\t\t\t\t\tM[enc(a, mul)][i]++;\n\t\t\t\t\ta[j] = (a[j]+mul[j]-1)%mul[j];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tint[] v = new int[r];\n\t\tv[0] = 1;\n\t\tint[] rv = pow(M, v, n);\n\t\tint ret = 0;\n\t\touter:\n\t\tfor(int i = 0;i < r;i++){\n\t\t\tint[] a = dec(i, mul);\n\t\t\tfor(int j = 0;j < 26;j++){\n\t\t\t\tif(g[j].length > 0){\n\t\t\t\t\tboolean ok = false;\n\t\t\t\t\tfor(int k : g[j]){\n\t\t\t\t\t\tif(a[j] % k == 0){\n\t\t\t\t\t\t\tok = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif(!ok)continue outer;\n\t\t\t\t}\n\t\t\t}\n\t\t\tret += rv[i];\n\t\t}\n\t\tout.println(ret % MOD);\n\t}\n\t\n\tint[] dec(int a, int[] mul)\n\t{\n\t\tint n = mul.length;\n\t\tint[] ret = new int[n];\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tret[i] = a % mul[i];\n\t\t\ta /= mul[i];\n\t\t}\n\t\treturn ret;\n\t}\n\t\n\tint enc(int[] a, int[] mul)\n\t{\n\t\tint n = a.length;\n\t\tint ret = 0;\n\t\tfor(int i = n-1;i >= 0;i--){\n\t\t\tret = ret * mul[i]+a[i];\n\t\t}\n\t\treturn ret;\n\t}\n\t\n\tpublic static int MOD = 12345;\n\t\n\t// int行列*ベクトル\n\tpublic static int[] mul(int[][] A, int[] v)\n\t{\n\t\tint m = A.length;\n\t\tint n = v.length;\n\t\tint[] w = new int[m];\n\t\tfor(int i = 0;i < m;i++){\n\t\t\tlong sum = 0;\n\t\t\tfor(int k = 0;k < n;k++){\n\t\t\t\tsum += (long)A[i][k] * v[k];\n\t\t\t\tsum %= MOD;\n\t\t\t}\n\t\t\tw[i] = (int)sum;\n\t\t}\n\t\treturn w;\n\t}\n\t\n\t// int行列の2乗\n\tpublic static int[][] p2(int[][] A)\n\t{\n\t\tint n = A.length;\n\t\tint[][] C = new int[n][n];\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tfor(int j = 0;j < n;j++){\n\t\t\t\tlong sum = 0;\n\t\t\t\tfor(int k = 0;k < n;k++){\n\t\t\t\t\tsum += (long)A[i][k] * A[k][j];\n\t\t\t\t\tsum %= MOD;\n\t\t\t\t}\n\t\t\t\tC[i][j] = (int)sum;\n\t\t\t}\n\t\t}\n\t\treturn C;\n\t}\n\t\n\t// A^e*v\n\tpublic static int[] pow(int[][] A, int[] v, long e)\n\t{\n\t\tint[][] MUL = A;\n\t\tfor(;e > 0;e>>>=1) {\n\t\t\tif((e&1)==1)v = mul(MUL, v);\n\t\t\tMUL = p2(MUL);\n\t\t}\n\t\treturn v;\n\t}\n\t\n\tpublic static int[][] packD(int n, int[] from, int[] to)\n\t{\n\t\tint[][] g = new int[n][];\n\t\tint[] p = new int[n];\n\t\tfor(int f : from)p[f]++;\n\t\tfor(int i = 0;i < n;i++)g[i] = new int[p[i]];\n\t\tfor(int i = 0;i < from.length;i++){\n\t\t\tg[from[i]][--p[from[i]]] = to[i];\n\t\t}\n\t\treturn g;\n\t}\n\t\n\tvoid run() throws Exception\n\t{\n//\t\tlong n = 1000000000000000000L;\n//\t\tint c = 1000;\n//\t\tRandom gen = new Random();\n//\t\tStringBuilder sb = new StringBuilder();\n//\t\tsb.append(n + \" \");\n//\t\tsb.append(c + \" \");\n//\t\tfor (int i = 0; i < c-2; i++) {\n//\t\t\tsb.append((char)(gen.nextInt(26)+'A') + \" \" + 1 + \" \");\n//\t\t}\n//\t\tsb.append((char)(gen.nextInt(26)+'A') + \" \" + 3 + \" \");\n//\t\tsb.append((char)(gen.nextInt(26)+'A') + \" \" + 41 + \" \");\n//\t\tINPUT = sb.toString();\n\t\t\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception\n\t{\n\t\tnew D3().run();\n\t}\n\t\n\tchar nc() {\n\t\ttry {\n\t\t\tint b;\n\t\t\twhile ((b = is.read()) != -1\n\t\t\t\t\t&& (b == ' ' || b == '\\r' || b == '\\n'))\n\t\t\t\t;\n\t\t\tif (b == -1)\n\t\t\t\treturn 0;\n\t\t\treturn (char) b;\n\t\t} catch (IOException e) {\n\t\t}\n\t\treturn 0;\n\t}\n\t\n\tpublic int ni()\n\t{\n\t\ttry {\n\t\t\tint num = 0;\n\t\t\tboolean minus = false;\n\t\t\twhile((num = is.read()) != -1 && !((num >= '0' && num <= '9') || num == '-'));\n\t\t\tif(num == '-'){\n\t\t\t\tnum = 0;\n\t\t\t\tminus = true;\n\t\t\t}else{\n\t\t\t\tnum -= '0';\n\t\t\t}\n\t\t\t\n\t\t\twhile(true){\n\t\t\t\tint b = is.read();\n\t\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t\t}else{\n\t\t\t\t\treturn minus ? -num : num;\n\t\t\t\t}\n\t\t\t}\n\t\t} catch (IOException e) {\n\t\t}\n\t\treturn -1;\n\t}\n\t\n\tpublic long nl()\n\t{\n\t\ttry {\n\t\t\tlong num = 0;\n\t\t\tboolean minus = false;\n\t\t\twhile((num = is.read()) != -1 && !((num >= '0' && num <= '9') || num == '-'));\n\t\t\tif(num == '-'){\n\t\t\t\tnum = 0;\n\t\t\t\tminus = true;\n\t\t\t}else{\n\t\t\t\tnum -= '0';\n\t\t\t}\n\t\t\t\n\t\t\twhile(true){\n\t\t\t\tint b = is.read();\n\t\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t\t}else{\n\t\t\t\t\treturn minus ? -num : num;\n\t\t\t\t}\n\t\t\t}\n\t\t} catch (IOException e) {\n\t\t}\n\t\treturn -1;\n\t}\n\t\n\tpublic String ns()\n\t{\n\t\ttry{\n\t\t\tint b = 0;\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\twhile((b = is.read()) != -1 && (b == '\\r' || b == '\\n' || b == ' '));\n\t\t\tif(b == -1)return \"\";\n\t\t\tsb.append((char)b);\n\t\t\twhile(true){\n\t\t\t\tb = is.read();\n\t\t\t\tif(b == -1)return sb.toString();\n\t\t\t\tif(b == '\\r' || b == '\\n' || b == ' ')return sb.toString();\n\t\t\t\tsb.append((char)b);\n\t\t\t}\n\t\t} catch (IOException e) {\n\t\t}\n\t\treturn \"\";\n\t}\n\t\n\tpublic char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\ttry{\n\t\t\tint b = 0, p = 0;\n\t\t\twhile((b = is.read()) != -1 && (b == ' ' || b == '\\r' || b == '\\n'));\n\t\t\tif(b == -1)return null;\n\t\t\tbuf[p++] = (char)b;\n\t\t\twhile(p < n){\n\t\t\t\tb = is.read();\n\t\t\t\tif(b == -1 || b == ' ' || b == '\\r' || b == '\\n')break;\n\t\t\t\tbuf[p++] = (char)b;\n\t\t\t}\n\t\t\treturn Arrays.copyOf(buf, p);\n\t\t} catch (IOException e) {\n\t\t}\n\t\treturn null;\n\t}\n\t\n\t\n\tdouble nd() { return Double.parseDouble(ns()); }\n\tboolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tvoid tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["matrices", "dp", "graphs"], "code_uid": "a35107d0a3ea321167588ce103441c33", "src_uid": "76d4684d26dac380713a566a1e277c91", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class B {\n\n\tstatic int n, t[], g[], MOD = (int) 1e9 + 7;\n\tstatic int[][][] memo1, memo2[], memo3[];\n\n\tstatic int dp1(int idx, int remCnt, int remSum) {\n\t\tif (idx == n)\n\t\t\treturn remSum == 0 && remCnt == 0 ? 1 : 0;\n\t\tif (remCnt < 0 || remSum < 0)\n\t\t\treturn 0;\n\t\tif (memo1[idx][remCnt][remSum] != -1)\n\t\t\treturn memo1[idx][remCnt][remSum];\n\t\tint ans = dp1(idx + 1, remCnt, remSum);\n\t\tif (g[idx] == 0) {\n\t\t\tans += dp1(idx + 1, remCnt - 1, remSum - t[idx]);\n\t\t\tif (ans >= MOD)\n\t\t\t\tans -= MOD;\n\t\t}\n\t\treturn memo1[idx][remCnt][remSum] = ans;\n\t}\n\n\tstatic int dp2(int idx, int remCnt1, int remCnt2, int remSum) {\n\n\t\tif (idx == n)\n\t\t\treturn remSum == 0 && remCnt1 == 0 && remCnt2 == 0 ? 1 : 0;\n\t\tif (remSum < 0 || remCnt1 < 0 || remCnt2 < 0)\n\t\t\treturn 0;\n\t\tif (memo2[idx][remCnt1][remCnt2][remSum] != -1)\n\t\t\treturn memo2[idx][remCnt1][remCnt2][remSum];\n\t\tint ans = dp2(idx + 1, remCnt1, remCnt2, remSum);\n\n\t\tif (g[idx] == 1)\n\t\t\tans += dp2(idx + 1, remCnt1 - 1, remCnt2, remSum - t[idx]);\n\t\telse if (g[idx] == 2)\n\t\t\tans += dp2(idx + 1, remCnt1, remCnt2 - 1, remSum - t[idx]);\n\n\t\treturn memo2[idx][remCnt1][remCnt2][remSum] = ans;\n\t}\n\n\tprivate static int dp3(int cnt0, int cnt1, int cnt2, int last) {\n\t\tif (cnt0 + cnt1 + cnt2 == 0)\n\t\t\treturn 1;\n\t\tif (memo3[last][cnt0][cnt1][cnt2] != -1)\n\t\t\treturn memo3[last][cnt0][cnt1][cnt2];\n\t\tlong ans = 0;\n\t\tif (cnt0 > 0 && last != 0)\n\t\t\tans += dp3(cnt0 - 1, cnt1, cnt2, 0);\n\t\tif (cnt1 > 0 && last != 1)\n\t\t\tans += dp3(cnt0, cnt1 - 1, cnt2, 1);\n\t\tif (cnt2 > 0 && last != 2)\n\t\t\tans += dp3(cnt0, cnt1, cnt2 - 1, 2);\n\t\treturn memo3[last][cnt0][cnt1][cnt2] = (int) (ans % MOD);\n\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tScanner sc = new Scanner();\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tn = sc.nextInt();\n\t\tint[] fac = new int[n + 1];\n\t\tt = new int[n];\n\t\tg = new int[n];\n\t\tint[] cnt = new int[3];\n\t\tfac[0] = 1;\n\t\tfor (int i = 1; i <= n; i++)\n\t\t\tfac[i] = (int) (i * 1L * fac[i - 1] % MOD);\n\t\tint T = sc.nextInt();\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tt[i] = sc.nextInt();\n\t\t\tg[i] = sc.nextInt() - 1;\n\t\t\tcnt[g[i]]++;\n\n\t\t}\n\t\tmemo1 = new int[n][cnt[0] + 1][T + 1];\n\t\tmemo2 = new int[n][cnt[1] + 1][cnt[2] + 1][T + 1];\n\t\tmemo3 = new int[4][cnt[0] + 1][cnt[1] + 1][cnt[2] + 1];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j <= cnt[0]; j++)\n\t\t\t\tArrays.fill(memo1[i][j], -1);\n\t\t\tfor (int j = 0; j <= cnt[1]; j++)\n\t\t\t\tfor (int k = 0; k <= cnt[2]; k++)\n\t\t\t\t\tArrays.fill(memo2[i][j][k], -1);\n\n\t\t}\n\t\tfor (int i = 0; i < 4; i++)\n\t\t\tfor (int j = 0; j <= cnt[0]; j++)\n\t\t\t\tfor (int k = 0; k <= cnt[1]; k++)\n\t\t\t\t\tArrays.fill(memo3[i][j][k], -1);\n\t\tint ans = 0;\n\t\tfor (int cnt0 = 0; cnt0 <= cnt[0]; cnt0++)\n\t\t\tfor (int sum0 = 0; sum0 <= T; sum0++)\n\t\t\t\tfor (int cnt1 = 0; cnt1 <= cnt[1]; cnt1++)\n\t\t\t\t\tfor (int cnt2 = 0; cnt2 <= cnt[2]; cnt2++) {\n\t\t\t\t\t\tlong ways = dp1(0, cnt0, sum0) * 1L * dp2(0, cnt1, cnt2, T - sum0) % MOD;\n\t\t\t\t\t\tways = ways * dp3(cnt0, cnt1, cnt2, 3) % MOD;\n\t\t\t\t\t\tways *= fac[cnt0];\n\t\t\t\t\t\tways %= MOD;\n\t\t\t\t\t\tways *= fac[cnt1];\n\t\t\t\t\t\tways %= MOD;\n\t\t\t\t\t\tways *= fac[cnt2];\n\t\t\t\t\t\tways %= MOD;\n\t\t\t\t\t\tans += ways;\n\t\t\t\t\t\tif (ans >= MOD)\n\t\t\t\t\t\t\tans -= MOD;\n\t\t\t\t\t}\n\t\tout.println(ans);\n\t\tout.close();\n\n\t}\n\n\tstatic class Scanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tScanner() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tScanner(String fileName) throws FileNotFoundException {\n\t\t\tbr = new BufferedReader(new FileReader(fileName));\n\t\t}\n\n\t\tString next() throws IOException {\n\t\t\twhile (st == null || !st.hasMoreTokens())\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tString nextLine() throws IOException {\n\t\t\treturn br.readLine();\n\t\t}\n\n\t\tint nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tlong nextLong() throws NumberFormatException, IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tdouble nextDouble() throws NumberFormatException, IOException {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tboolean ready() throws IOException {\n\t\t\treturn br.ready();\n\t\t}\n\n\t}\n\n}", "lang_cluster": "Java", "tags": ["dp", "combinatorics"], "code_uid": "b4111d4ade08d05e626b1dfdd9bbc8c5", "src_uid": "ed5f913afe829c65792b54233a256757", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskE solver = new TaskE();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskE {\n final int mod = (int) 1e9 + 7;\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.readInt();\n int k = in.readInt();\n int[][] c = Combinatorics.GetCombinations(n, n, mod);\n int[][][][] dp = new int[n + 2][n + 2][2][2];\n dp[0][0][0][1] = 1;\n for (int i = 1; i <= n; ++i) {\n for (int j = 0; j <= i; ++j) {\n for (int first = 0; first < 2; ++first) {\n for (int second = 0; second < 2; ++second) {\n if (first == 1) {\n if (j > 0) {\n dp[i][j][second][1] += dp[i - 1][j - 1][first][second];\n dp[i][j][second][1] %= mod;\n }\n }\n if (i < n && j > 0) {\n dp[i][j][second][0] += dp[i - 1][j - 1][first][second];\n dp[i][j][second][0] %= mod;\n }\n dp[i][j][second][1] += dp[i - 1][j][first][second];\n dp[i][j][second][1] %= mod;\n }\n }\n }\n }\n long[] fact = new long[n + 5];\n fact[0] = 1;\n for (int i = 1; i <= n; ++i) {\n fact[i] = fact[i - 1] * i;\n fact[i] %= mod;\n }\n long[] f = new long[n + 1];\n for (int i = 0; i <= n; ++i) {\n f[i] = 0;\n for (int first = 0; first < 2; ++first) {\n for (int second = 0; second < 2; ++second) {\n f[i] += dp[n][i][first][second];\n f[i] %= mod;\n }\n }\n f[i] *= fact[n - i];\n f[i] %= mod;\n }\n\n for (int i = n; i >= 0; --i) {\n for (int j = i + 1; j <= n; ++j) {\n f[i] -= (f[j] * c[j][i]) % mod;\n f[i] += mod;\n f[i] %= mod;\n }\n }\n out.println(f[k]);\n }\n}\n\nclass InputReader {\n\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n // InputMismatchException -> UnknownError\n if (numChars == -1)\n throw new UnknownError();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new UnknownError();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n } else if (c == '+') {\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public static boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n }\n\nclass Combinatorics {\n public static int[][] GetCombinations(int n, int m, int MOD) {\n int[][] c = new int[n + 1][m + 1];\n c[0][0] = 1;\n for (int i = 1; i <= n; ++i) {\n c[i][0] = 1;\n for (int j = 1; j < i && j <= m; ++j) {\n c[i][j] = c[i - 1][j] + c[i - 1][j - 1];\n if (c[i][j] >= MOD) {\n c[i][j] -= MOD;\n }\n }\n c[i][i] = 1;\n }\n return c;\n }\n\n }\n\n", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics"], "code_uid": "33266c1deb9a46ac2e795ba81f8d19dc", "src_uid": "1243e98fe2ebd6e6d1de851984b96079", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Scanner;\nimport java.util.TreeMap;\nimport java.util.TreeSet;\n \npublic class myFile\n{\n\tpublic static void main(String args[])\n\t{\n\t Scanner sc = new Scanner(System.in);\n\t int i,n,k;\n\t while(sc.hasNextInt())\n\t {\n\t\t n = sc.nextInt();\n\t\t k = sc.nextInt();\n\t\t sc.nextLine();\n\t\t String str = sc.nextLine();\n\t\t if(n==1 && k==1)\n\t\t {\n\t\t\t System.out.println(\"0\");\n\t\t\t continue;\n\t\t }\n\t\t StringBuilder sb = new StringBuilder(str);\n\t\t if(str.charAt(0)!='1' && k>0)\n\t\t {\n\t\t\t sb.setCharAt(0, '1');\n\t\t\t k--;\n\t\t }\n\t\t for(i=1;k>0 && i<str.length();i++)\n\t\t {\n\t\t\t if(str.charAt(i)!='0') {\n\t\t\t\t k--;\n\t\t\t\t sb.setCharAt(i, '0');\n\t\t\t }\n\t\t }\n\t\t System.out.println(sb);\n\t }\n\t \n\t}\n\t\n\t \n}", "lang_cluster": "Java", "tags": ["greedy", "implementation"], "code_uid": "5ebf352059c7f006be02386ace2498fd", "src_uid": "0515ac888937a4dda30cad5e2383164f", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\n\tfinal static int PERIOD = 60;\n\tfinal static int POWER = 13;\n\n\tlong fib(long n, long mod) {\n\t\tlong[][] mat = new long[2][2];\n\t\tmat[0][1] = mat[1][0] = mat[1][1] = 1;\n\t\tMatrix v = new Matrix(mat);\n\t\tv = v.power(n, mod);\n\t\treturn v.mat[0][1];\n\t}\n\n\tvoid run() {\n\t\tInputReader in = new InputReader(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\n\t\tlong num = in.nextLong(), mod = 10, per = PERIOD;\n\t\tArrayList<Long> valid = new ArrayList<Long>();\n\t\tfor (int i = 0; i < PERIOD; ++i)\n\t\t\tif (fib(i, mod) == num % mod)\n\t\t\t\tvalid.add((long)i);\n\n\t\tfor (int i = 1; i < POWER; ++i) {\n\t\t\tmod *= 10;\n\t\t\tlong rem = num % mod;\n\t\t\tArrayList<Long> nv = new ArrayList<Long>();\n\t\t\tfor (int j = 0; j < 10; ++j)\n\t\t\t\tfor (int k = 0; k < valid.size(); ++k) {\n\t\t\t\t\tif (fib(j * per + valid.get(k), mod) == rem)\n\t\t\t\t\t\tnv.add(j * per + valid.get(k));\n\t\t\t\t}\n\t\t\tvalid = nv;\n\t\t\tper *= 10;\n\t\t}\n\n\t\tif (valid.size() == 0)\n\t\t\tout.println(-1);\n\t\telse\n\t\t\tout.println(valid.get(0));\n\t\tout.close();\n\t}\n}\n\nclass Matrix {\n\tlong[][] mat;\n\tfinal static Matrix ONE = new Matrix(new long[][] {{1, 0}, {0, 1}});\n\tMatrix(long[][] mat) {\n\t\tthis.mat = mat;\n\t}\n\tlong add(long a, long b, long mod) {\n\t\tif (a + b >= mod)\n\t\t\treturn a + b - mod;\n\t\treturn a + b;\n\t}\n\tlong multiply(long a, long b, long mod) {\n\t\tlong ret = 0;\n\t\twhile (a > 0) {\n\t\t\tif ((a & 1) == 1)\n\t\t\t\tret = add(ret, b, mod);\n\t\t\tb = add(b, b, mod);\n\t\t\ta >>= 1;\n\t\t}\n\t\treturn ret;\n\t}\n\tMatrix multiply(Matrix o, long mod) {\n\t\tlong[][] ret = new long[2][2];\n\t\tfor (int i = 0; i < 2; ++i)\n\t\t\tfor (int j = 0; j < 2; ++j)\n\t\t\t\tfor (int k = 0; k < 2; ++k)\n\t\t\t\t\tret[i][j] = add(ret[i][j], multiply(mat[i][k], o.mat[k][j], mod), mod);\n\t\treturn new Matrix(ret);\n\t}\n\tMatrix power(long p, long mod) {\n\t\tif (p == 0) {\n\t\t\treturn Matrix.ONE;\n\t\t}\n\t\tMatrix ret = power(p / 2, mod);\n\t\tret = ret.multiply(ret, mod);\n\t\tif ((p & 1) == 1)\n\t\t\tret = ret.multiply(this, mod);\n\t\treturn ret;\n\t}\n}\n\nclass InputReader {\n\tBufferedReader buff;\n\tStringTokenizer tokenizer;\n\n\tInputReader(InputStream stream) {\n\t\tbuff = new BufferedReader(new InputStreamReader(stream));\n\t\ttokenizer = null;\n\t}\n\tboolean hasNext() {\n\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens())\n\t\t\ttry {\n\t\t\t\ttokenizer = new StringTokenizer(buff.readLine());\n\t\t\t}\n\t\t\tcatch (Exception e) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\treturn true;\n\t}\n\tString next() {\n\t\tif (!hasNext())\n\t\t\tthrow new RuntimeException();\n\t\treturn tokenizer.nextToken();\n\t}\n\tint nextInt() { return Integer.parseInt(next()); }\n\tlong nextLong() { return Long.parseLong(next()); }\n}\n\n", "lang_cluster": "Java", "tags": ["brute force", "math", "matrices"], "code_uid": "215e223d3eb2acdb8c09f84c57d42d30", "src_uid": "cbf786abfceeb8df29732c8a872f7f8a", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.math.*;\nimport java.util.*;\n\npublic class Solution {\n final static long MOD = 10000000000000L;\n\n long multiply(long a, long b) {\n return BigInteger.valueOf(a).multiply(BigInteger.valueOf(b)).remainder(BigInteger.valueOf(MOD)).longValue();\n }\n\n long[][] multiply(long[][] a, long[][] b) {\n long[][] c = new long[2][2];\n for (int i = 0; i < 2; ++ i) {\n for (int j = 0; j < 2; ++ j) {\n c[i][j] = (multiply(a[i][0], b[0][j]) + multiply(a[i][1], b[1][j])) % MOD;\n }\n }\n return c;\n }\n\n long[][] pow(long[][] a, long n) {\n long[][] ret = new long[][] {{1, 0}, {0, 1}};\n while (n > 0) {\n if (n % 2 == 1) {\n ret = multiply(ret, a);\n }\n a = multiply(a, a);\n n >>= 1;\n }\n return ret;\n }\n\n long fibonacci(long n) {\n return multiply(new long[][] {{0, 1}, {0, 0}}, pow(new long[][]{{0, 1}, {1, 1}}, n))[0][0];\n }\n\n public void run() {\n try {\n long m = reader.nextLong();\n ArrayList <Long> indices = new ArrayList <Long>();\n indices.add(0L);\n long period = 1;\n for (long mod = 10; mod <= MOD; mod *= 10) {\n ArrayList <Long> newIndices = new ArrayList <Long>();\n int times = mod == 10 ? 60 : mod <= 1000 ? 5 : 10;\n for (long iter : indices) {\n long now = iter;\n for (int i = 0; i < times; ++ i) {\n if (fibonacci(now) % mod == m % mod) {\n newIndices.add(now);\n }\n now += period;\n }\n }\n period *= times;\n indices = newIndices;\n }\n Collections.sort(indices);\n writer.println(indices.isEmpty() ? -1 : indices.get(0));\n } catch (IOException ex) {\n }\n writer.close();\n }\n\n InputReader reader;\n PrintWriter writer;\n\n Solution() {\n reader = new InputReader();\n writer = new PrintWriter(System.out);\n }\n\n public static void main(String[] args) {\n new Solution().run();\n }\n\n}\n\nclass InputReader {\n BufferedReader reader;\n StringTokenizer tokenizer;\n\n InputReader() {\n reader = new BufferedReader(new InputStreamReader(System.in));\n tokenizer = new StringTokenizer(\"\");\n }\n\n String next() throws IOException {\n while (!tokenizer.hasMoreTokens()) {\n tokenizer = new StringTokenizer(reader.readLine());\n }\n return tokenizer.nextToken();\n }\n\n Integer nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n Long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "matrices"], "code_uid": "78044297ab5d7e603b351394b96cda3f", "src_uid": "cbf786abfceeb8df29732c8a872f7f8a", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "//package round122;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.math.BigInteger;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.List;\n\npublic class E2 {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t\tint M2 = 1<<13;\n\t\tint M5 = 5*5*5*5*5*5*5*5*5*5*5*5*5;\n\t\t\n\t\tlong f = nl();\n\t\tint x2 = (int)(f % M2);\n\t\tint[] fa2 = new int[M2];\n\t\tint[] a2 = new int[1<<14];\n\t\ta2[0] = 0;\n\t\ta2[1] = 1;\n\t\tArrays.fill(fa2, -1);\n\t\tfa2[0] = 0;\n\t\tfa2[1] = 1;\n\t\tfor(int i = 2;i < 13000;i++){\n\t\t\ta2[i] = (a2[i-1] + a2[i-2]) % M2;\n\t\t\tif(fa2[a2[i]] == -1)fa2[a2[i]] = i;\n\t\t}\n\t\tif(fa2[x2] == -1){\n\t\t\tout.println(-1);\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tint f5 = (int)(f%5);\n\t\tList<Long> l = new ArrayList<Long>();\n\t\t{\n\t\t\tint[] a = new int[20];\n\t\t\ta[0] = 0;\n\t\t\ta[1] = 1;\n\t\t\tfor(int i = 2;i < 4*5;i++){\n\t\t\t\ta[i] = (a[i-1] + a[i-2]) % 5;\n\t\t\t}\n\t\t\tfor(int i = 0;i < 4*5;i++){\n\t\t\t\tif(a[i] == f5){\n\t\t\t\t\tl.add((long)i);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tint[][] F = {\n\t\t\t\t{1, 1}, {1, 0}\n\t\t};\n\t\tfor(long m = 25;m <= M5;m*=5){\n\t\t\tint fm = (int)(f % m);\n\t\t\tList<Long> nl = new ArrayList<Long>();\n\t\t\tfor(long ll : l){\n\t\t\t\tfor(int k = 0;k < 5;k++){\n\t\t\t\t\tlong ne = ll+k*4*(m/5);\n\t\t\t\t\tlong nf = 0;\n\t\t\t\t\tif(ne == 0){\n\t\t\t\t\t\tnf = 0;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tnf = pow(F, new int[]{1, 0}, ne-1, (int)m)[0];\n\t\t\t\t\t}\n\t\t\t\t\tif(nf == fm){\n\t\t\t\t\t\tnl.add(ne);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tl = nl;\n\t\t}\n\t\t\n\t\tlong min = Long.MAX_VALUE;\n\t\tfor(long ll : l){\n\t\t\tfor(int i = 0;i < a2.length;i++){\n\t\t\t\tif(a2[i] == f % M2){\n\t\t\t\t\tlong num = crtx(new long[]{M2*3/2, 4L*M5}, new long[]{i, ll}).longValue();\n\t\t\t\t\tif(num >= 0){\n\t\t\t\t\t\tmin = Math.min(min, num);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n//\t\t\tlong num = crt(M2*3/2, fa2[x2], 4L*M5, ll);\n\t\t}\n\t\tif(min == Long.MAX_VALUE){\n\t\t\tout.println(-1);\n\t\t}else{\n\t\t\tout.println(min);\n\t\t}\n\t}\n\t\n\tpublic static long crt(long p, long m, long q, long n)\n\t{\n\t\tlong[] apr = exGCD(p, q);\n\t\tif((n - m) % apr[0] != 0)return -1;\n\t\tlong mod = p * q / apr[0];\n\t\tlong a = (apr[1] * (n - m) / apr[0] * p + m) % mod;\n\t\tif(a < 0)a += mod;\n\t\treturn a;\n\t}\n\t\n\t// int行列*ベクトル\n\tpublic static int[] mul(int[][] A, int[] v, int mod)\n\t{\n\t\tint m = A.length;\n\t\tint n = v.length;\n\t\tint[] w = new int[m];\n\t\tfor(int i = 0;i < m;i++){\n\t\t\tlong sum = 0;\n\t\t\tfor(int k = 0;k < n;k++){\n\t\t\t\tsum += (long)A[i][k] * v[k];\n\t\t\t\tsum %= mod;\n\t\t\t}\n\t\t\tw[i] = (int)sum;\n\t\t}\n\t\treturn w;\n\t}\n\t\n\t// int行列の2乗\n\tpublic static int[][] p2(int[][] A, int mod)\n\t{\n\t\tint n = A.length;\n\t\tint[][] C = new int[n][n];\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tfor(int j = 0;j < n;j++){\n\t\t\t\tlong sum = 0;\n\t\t\t\tfor(int k = 0;k < n;k++){\n\t\t\t\t\tsum += (long)A[i][k] * A[k][j];\n\t\t\t\t\tsum %= mod;\n\t\t\t\t}\n\t\t\t\tC[i][j] = (int)sum;\n\t\t\t}\n\t\t}\n\t\treturn C;\n\t}\n\t\n\tpublic static BigInteger[] exGCD(BigInteger a, BigInteger b)\n\t{\n\t\tBigInteger p = BigInteger.ONE, q = BigInteger.ZERO, r = BigInteger.ZERO, s = BigInteger.ONE;\n\t\twhile(b.signum() > 0){\n\t\t\tBigInteger c = a.divide(b);\n\t\t\tBigInteger d;\n\t\t\td = a; a = b; b = d.mod(b);\n\t\t\td = p; p = q; q = d.subtract(c.multiply(q));\n\t\t\td = r; r = s; s = d.subtract(c.multiply(s));\n\t\t}\n\t\treturn new BigInteger[]{a, p, r};\n\t}\n\t\n\tpublic static BigInteger bi(long x){ return BigInteger.valueOf(x); }\n\t\n\tpublic static BigInteger crtx(long[] divs, long[] mods)\n\t{\n\t\tBigInteger div = bi(divs[0]), mod = bi(mods[0]);\n\t\tfor(int i = 1;i < divs.length;i++){\n\t\t\tBigInteger[] apr = exGCD(div, bi(divs[i]));\n\t\t\tBigInteger mm = bi(mods[i]).subtract(mod);\n\t\t\tif(mm.mod(apr[0]).signum() != 0)return bi(-1);\n\t\t\tBigInteger da = div.divide(apr[0]);\n\t\t\tBigInteger ndiv = bi(divs[i]).multiply(da);\n\t\t\tBigInteger nmod = apr[1].multiply(mm).multiply(da).add(mod).mod(ndiv);\n\t\t\tif(nmod.signum() < 0)nmod = nmod.add(ndiv);\n\t\t\tdiv = ndiv;\n\t\t\tmod = nmod;\n\t\t}\n\t\treturn mod;\n\t}\n\t\n\t// A^e*v\n\tpublic static int[] pow(int[][] A, int[] v, long e, int mod)\n\t{\n\t\tint[][] MUL = A;\n\t\tfor(;e > 0;e>>>=1) {\n\t\t\tif((e&1)==1)v = mul(MUL, v, mod);\n\t\t\tMUL = p2(MUL, mod);\n\t\t}\n\t\treturn v;\n\t}\n\t\n\tpublic static long[] exGCD(long a, long b)\n\t{\n\t\tlong p = 1, q = 0, r = 0, s = 1;\n\t\twhile(b > 0){\n\t\t\tlong c = a / b;\n\t\t\tlong d;\n\t\t\td = a; a = b; b = d % b;\n\t\t\td = p; p = q; q = d - c * q;\n\t\t\td = r; r = s; s = d - c * s;\n\t\t}\n\t\treturn new long[]{a, p, r};\n\t}\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception\n\t{\n\t\tnew E2().run();\n\t}\n\t\n\tpublic int ni()\n\t{\n\t\ttry {\n\t\t\tint num = 0;\n\t\t\tboolean minus = false;\n\t\t\twhile((num = is.read()) != -1 && !((num >= '0' && num <= '9') || num == '-'));\n\t\t\tif(num == '-'){\n\t\t\t\tnum = 0;\n\t\t\t\tminus = true;\n\t\t\t}else{\n\t\t\t\tnum -= '0';\n\t\t\t}\n\t\t\t\n\t\t\twhile(true){\n\t\t\t\tint b = is.read();\n\t\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t\t}else{\n\t\t\t\t\treturn minus ? -num : num;\n\t\t\t\t}\n\t\t\t}\n\t\t} catch (IOException e) {\n\t\t}\n\t\treturn -1;\n\t}\n\t\n\tpublic long nl()\n\t{\n\t\ttry {\n\t\t\tlong num = 0;\n\t\t\tboolean minus = false;\n\t\t\twhile((num = is.read()) != -1 && !((num >= '0' && num <= '9') || num == '-'));\n\t\t\tif(num == '-'){\n\t\t\t\tnum = 0;\n\t\t\t\tminus = true;\n\t\t\t}else{\n\t\t\t\tnum -= '0';\n\t\t\t}\n\t\t\t\n\t\t\twhile(true){\n\t\t\t\tint b = is.read();\n\t\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t\t}else{\n\t\t\t\t\treturn minus ? -num : num;\n\t\t\t\t}\n\t\t\t}\n\t\t} catch (IOException e) {\n\t\t}\n\t\treturn -1;\n\t}\n\t\n\tpublic String ns()\n\t{\n\t\ttry{\n\t\t\tint b = 0;\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\twhile((b = is.read()) != -1 && (b == '\\r' || b == '\\n' || b == ' '));\n\t\t\tif(b == -1)return \"\";\n\t\t\tsb.append((char)b);\n\t\t\twhile(true){\n\t\t\t\tb = is.read();\n\t\t\t\tif(b == -1)return sb.toString();\n\t\t\t\tif(b == '\\r' || b == '\\n' || b == ' ')return sb.toString();\n\t\t\t\tsb.append((char)b);\n\t\t\t}\n\t\t} catch (IOException e) {\n\t\t}\n\t\treturn \"\";\n\t}\n\t\n\tpublic char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\ttry{\n\t\t\tint b = 0, p = 0;\n\t\t\twhile((b = is.read()) != -1 && (b == ' ' || b == '\\r' || b == '\\n'));\n\t\t\tif(b == -1)return null;\n\t\t\tbuf[p++] = (char)b;\n\t\t\twhile(p < n){\n\t\t\t\tb = is.read();\n\t\t\t\tif(b == -1 || b == ' ' || b == '\\r' || b == '\\n')break;\n\t\t\t\tbuf[p++] = (char)b;\n\t\t\t}\n\t\t\treturn Arrays.copyOf(buf, p);\n\t\t} catch (IOException e) {\n\t\t}\n\t\treturn null;\n\t}\n\t\n\t\n\tdouble nd() { return Double.parseDouble(ns()); }\n\tboolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tvoid tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "matrices"], "code_uid": "71cf88ad9648b9a9dbf4752bf442457e", "src_uid": "cbf786abfceeb8df29732c8a872f7f8a", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.List;\nimport java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.util.ArrayList;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.math.BigInteger;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskE solver = new TaskE();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskE {\n static final long MODULO = (long) 1e13;\n\n private long[][] mul(long[][] a, long[][] b, long modulo) {\n long[][] c = new long[2][2];\n for (int i = 0; i < 2; ++i)\n for (int j = 0; j < 2; ++j) {\n BigInteger sum = BigInteger.ZERO;\n for (int k = 0; k < 2; ++k)\n sum = sum.add(BigInteger.valueOf(a[i][k]).multiply(BigInteger.valueOf(b[k][j])));\n c[i][j] = sum.mod(BigInteger.valueOf(modulo)).longValue();\n }\n return c;\n }\n \n static class Candidate {\n long offset;\n long[][] trans;\n\n Candidate(long offset, long[][] trans) {\n this.offset = offset;\n this.trans = trans;\n }\n }\n \n public void solve(int testNumber, InputReader in, PrintWriter out) {\n long f = in.nextLong();\n long mod = 1;\n long period = 1;\n long[][] mPeriod = new long[][]{new long[]{0, 1}, new long[]{1, 1}};\n List<Candidate> offsets = new ArrayList<Candidate>();\n offsets.add(new Candidate(0, new long[][]{new long[]{1, 0}, new long[]{0, 1}}));\n for (int i = 0; i < 26; ++i) {\n if (i < 13)\n mod *= 2;\n else\n mod *= 5;\n long nperiod = period;\n long[][] nmPeriod = mPeriod;\n while (nmPeriod[0][1] % mod != 0 || nmPeriod[1][1] % mod != 1) {\n nmPeriod = mul(nmPeriod, mPeriod, MODULO);\n nperiod += period;\n }\n List<Candidate> newOffsets = new ArrayList<Candidate>();\n for (Candidate old : offsets) {\n long[][] trans = old.trans;\n for (long noffset = old.offset; noffset < nperiod; noffset += period) {\n if ((trans[0][1] % mod == f % mod)) {\n newOffsets.add(new Candidate(noffset, trans));\n }\n trans = mul(trans, mPeriod, MODULO);\n }\n }\n offsets = newOffsets;\n period = nperiod;\n mPeriod = nmPeriod;\n }\n long min = Long.MAX_VALUE;\n for (Candidate c : offsets)\n min = Math.min(min, c.offset);\n if (min == Long.MAX_VALUE) out.println(-1); else out.println(min);\n\t}\n}\n\nclass InputReader {\n private BufferedReader reader;\n private StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream));\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n }\n\n", "lang_cluster": "Java", "tags": ["brute force", "math", "matrices"], "code_uid": "d1a0b217ce92e32b3cc0bc46791f782f", "src_uid": "cbf786abfceeb8df29732c8a872f7f8a", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class D {\n\n BufferedReader br;\n PrintWriter out;\n StringTokenizer st;\n boolean eof;\n \n final int ROOT = 46300;\n \n ArrayList<Integer> primes;\n \n int ind;\n \n int go(int x, int div, int sign, int lastInd) {\n //System.err.println(x + \" \" + div + \" \" + sign + \" \" + lastInd);\n if (x < div)\n return 0;\n int res = sign * (x / div);\n for (int i = lastInd + 1; i < ind; i++) {\n if (primes.get(i) > x / div)\n break;\n res += go(x, div * primes.get(i), -sign, i);\n }\n return res;\n }\n \n int go(int x) {\n return go(x, 1, 1, -1);\n }\n\n void solve() throws IOException {\n int l = nextInt();\n int r = nextInt();\n int k = nextInt();\n \n boolean[] isPrime = new boolean[ROOT];\n Arrays.fill(isPrime, true);\n \n primes = new ArrayList<Integer>();\n \n for (int i = 2; i < ROOT; i++) {\n if (isPrime[i]) {\n primes.add(i);\n for (int j = i * i; j < ROOT; j += i)\n isPrime[j] = false;\n }\n }\n \n for (int p : primes) if (k != p && k % p == 0) {\n out.print(0);\n return;\n }\n \n if (k > ROOT) {\n if (l <= k && k <= r) \n out.print(1);\n else\n out.print(0);\n return;\n }\n \n ind = Collections.binarySearch(primes, k);\n \n if (l % k == 0)\n l /= k;\n else\n l = l / k + 1;\n \n r /= k;\n \n //System.err.println(go(7));\n \n out.print(go(r) - go(l - 1));\n \n }\n\n void inp() throws IOException {\n br = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n solve();\n out.close();\n }\n\n public static void main(String[] args) throws IOException {\n new D().inp();\n }\n\n String nextToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (Exception e) {\n eof = true;\n return \"0\";\n }\n }\n return st.nextToken();\n }\n\n String nextString() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (Exception e) {\n eof = true;\n return \"0\";\n }\n }\n return st.nextToken(\"\\n\");\n }\n\n int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n}\n", "lang_cluster": "Java", "tags": ["math", "dp", "number theory"], "code_uid": "09dcf19e27b9f0dc1bcdc37cb7be8e3f", "src_uid": "04a26f1d1013b6e6b4b0bdcf225475f2", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Itpossible\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tE solver = new E();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass E {\n public double[][][][] dp;\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int x = in.nextInt();\n int k = in.nextInt();\n int p = in.nextInt();\n dp = new double[2][256][251][2];\n for (int i = 0; i < 2; i++) {\n for (int j = 0; j < 256; j++) {\n for (int u = 0; u < 251; u++) {\n dp[i][j][u][0] = 0;\n dp[i][j][u][1] = 0;\n }\n }\n }\n int y=x/256;\n if(y==0) {\n dp[0][x&255][0][0]=1;\n } else {\n if((y&1)==0) {\n int z=0;\n for(; (y&1)==0; z++) {\n y>>=1;\n }\n dp[0][x&255][z][0]=1;\n } else {\n int z=0;\n for(; (y&1)>0; z++) {\n y>>=1;\n }\n dp[0][x&255][z][1]=1;\n }\n }\n for(int i=0; i<k; i++) {\n\n for(int j=0; j<256; j++) {\n for (int u = 0; u < 250; u++) {\n dp[(i+1)&1][j][u][0]=0;\n dp[(i+1)&1][j][u][1]=0;\n }\n }\n for(int j=0; j<256; j++) {\n for(int u=0; u<250; u++) {\n if((j&128)>0) {\n dp[(i+1)&1][(j<<1)&255][1][1]+=dp[i&1][j][u][0]*p*0.01;\n dp[(i+1)&1][(j<<1)&255][u+1][1]+=dp[i&1][j][u][1]*p*0.01;\n } else {\n dp[(i+1)&1][(j<<1)&255][u+1][0]+=dp[i&1][j][u][0]*p*0.01;\n dp[(i+1)&1][(j<<1)&255][1][0]+=dp[i&1][j][u][1]*p*0.01;\n }\n if(j==255) {\n dp[(i+1)&1][0][1][1]+=dp[i&1][j][u][0]*(1-p*0.01);\n dp[(i+1)&1][0][u][0]+=dp[i&1][j][u][1]*(1-p*0.01);\n } else {\n dp[(i+1)&1][j+1][u][0]+=dp[i&1][j][u][0]*(1-p*0.01);\n dp[(i+1)&1][j+1][u][1]+=dp[i&1][j][u][1]*(1-p*0.01);\n }\n }\n }\n }\n double ans=0;\n for(int j=0; j<256; j++) {\n int cnt=0;\n if(j>0) {\n for (int t = j; (t & 1) == 0; cnt++) {\n t >>= 1;\n }\n }\n for(int u=0; u<250; u++) {\n if(j==0) {\n ans+=dp[k&1][0][u][0]*(8+u);\n ans+=dp[k&1][0][u][1]*8;\n } else {\n ans+=dp[k&1][j][u][0]*cnt;\n ans+=dp[k&1][j][u][1]*cnt;\n }\n }\n }\n out.printf(\"%.13f\\n\",ans);\n }\n}\n\nclass InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream),65536);\n tokenizer = null;\n }\n\n public String next() {\n while(tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n}\n\n", "lang_cluster": "Java", "tags": ["math", "dp", "probabilities", "bitmasks"], "code_uid": "f741b1442f84995b67f570e1abcef087", "src_uid": "c9274249c26b1a85c19ab70d91c1c3e0", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.IOException;\nimport java.util.*;\n\npublic class Test {\n int readInt() {\n int ans = 0;\n boolean neg = false;\n try {\n boolean start = false;\n for (int c = 0; (c = System.in.read()) != -1; ) {\n if (c == '-') {\n start = true;\n neg = true;\n continue;\n } else if (c >= '0' && c <= '9') {\n start = true;\n ans = ans * 10 + c - '0';\n } else if (start) break;\n }\n } catch (IOException e) {\n }\n return neg ? -ans : ans;\n }\n\n int r, c;\n Scanner sca = new Scanner(System.in);\n long[][] C = new long[64][64];\n long best = Long.MAX_VALUE;\n\n void dfs(long x, long y, int v1, int v2) {\n long d = Math.abs(x - y);\n if (best <= 1 || d - C[v1][r]*C[v2][r] >= best) return;\n if (v1 == r - 1 && v2 == r - 1) {\n if (d < best) best = d;\n return;\n }\n if (v1 >= r) {\n long c1 = C[v1][r] - C[v1-1][r], s2 = C[v2][r];\n dfs(x, y + c1*s2, v1 - 1, v2);\n }\n if (v2 >= r) {\n long s1 = C[v1][r], c2 = C[v2][r] - C[v2-1][r];\n dfs(x + s1*c2, y, v1, v2 - 1);\n }\n }\n\n int[] cntA = new int[64], cntB = new int[64];\n Map<Long, Long> cache = new TreeMap<>();\n char[] cs;\n\n long solve(long x, long y, int v1, int v2) {\n long k = x*10000 + v1*100 + v2;\n Long v = cache.get(k);\n if (v != null) return v;\n v = 0l;\n long d = Math.abs(x - y);\n if (d - C[v1][r]*C[v2][r] > best) {\n cache.put(k, v);\n return v;\n }\n if (v1 < r || v2 < r) {\n int sum = v1 + v2;\n if (v1 >= cntA[sum] && v2 >= cntB[sum]) {\n v1 -= cntA[sum];\n v2 -= cntB[sum];\n v = C[v1+v2][v1];\n cache.put(k, v);\n return v;\n }\n cache.put(k, v);\n return v;\n }\n char c = cs[v1 + v2 - 1];\n if (c != 'B') {\n long c1 = C[v1][r] - C[v1 - 1][r], s2 = C[v2][r];\n v += solve(x, y + c1*s2, v1 - 1, v2);\n }\n if (c != 'A') {\n long s1 = C[v1][r], c2 = C[v2][r] - C[v2-1][r];\n v += solve( x + s1*c2, y, v1, v2 - 1);\n }\n cache.put(k, v);\n return v;\n }\n\n void start() {\n r = sca.nextInt(); c = sca.nextInt(); sca.nextLine();\n cs = sca.nextLine().toCharArray();\n for (int i = 0; i <= 2*(r + c); i++)\n for (int j = 0; j <= 2*(r + c); j++) {\n if (j == 0) C[i][j] = 1;\n else if (i == 0) C[i][j] = 0;\n else C[i][j] = C[i-1][j - 1] + C[i - 1][j];\n }\n int v1 = r + c, v2 = r + c;\n long x = 0, y = 0;\n while (v1 >= r && v2 >= r) {\n if (x > y) {\n long c1 = C[v1][r] - C[v1 - 1][r], s2 = C[v2][r];\n y += c1*s2;\n v1--;\n } else {\n long s1 = C[v1][r], c2 = C[v2][r] - C[v2-1][r];\n x += s1*c2;\n v2--;\n }\n }\n best = Math.abs(x - y);\n dfs(0, 0, r + c, r + c);\n for (int i = 0; i < 2*(r+c); i++) {\n cntA[i + 1] = cntA[i] + (cs[i] == 'A' ? 1 : 0);\n cntB[i + 1] = cntB[i] + (cs[i] == 'B' ? 1 : 0);\n }\n long ans = solve(0, 0, r + c, r + c);\n System.out.println(ans);\n }\n\n public static void main(String[] args) {\n\n new Test().start();\n\n }\n}\n", "lang_cluster": "Java", "tags": ["meet-in-the-middle", "combinatorics"], "code_uid": "ac26f9655c889fd6bcb938108731e6e9", "src_uid": "1b978b5aed4a83a2250bb23cc1ad6f85", "difficulty": 3300.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.BufferedWriter;\nimport java.io.IOException;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.Map;\nimport java.util.Set;\n\npublic class Test {\n static PrintWriter writer =\n new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n int R, C;\n long[][] ch = new long[61][61];\n int[] cntA = new int[61], cntB = new int[61];\n long best = Long.MAX_VALUE;\n String str;\n Map<Long, Long> cache = new HashMap<>();\n Set<Long> tried = new HashSet<>();\n\n public static void main(String[] args) {\n Test te = new Test();\n te.start();\n writer.flush();\n }\n\n static int readInt() {\n int ans = 0;\n boolean neg = false;\n try {\n boolean start = false;\n for (int c = 0; (c = System.in.read()) != -1; ) {\n if (c == '-') {\n start = true;\n neg = true;\n continue;\n } else if (c >= '0' && c <= '9') {\n start = true;\n ans = ans * 10 + c - '0';\n } else if (start) break;\n }\n } catch (IOException e) {\n }\n return neg ? -ans : ans;\n }\n\n static long readLong() {\n long ans = 0;\n boolean neg = false;\n try {\n boolean start = false;\n for (int c = 0; (c = System.in.read()) != -1; ) {\n if (c == '-') {\n start = true;\n neg = true;\n continue;\n } else if (c >= '0' && c <= '9') {\n start = true;\n ans = ans * 10 + c - '0';\n } else if (start) break;\n }\n } catch (IOException e) {\n }\n return neg ? -ans : ans;\n }\n\n static String readString() {\n StringBuilder b = new StringBuilder();\n try {\n boolean start = false;\n for (int c = 0; (c = System.in.read()) != -1; ) {\n if (!Character.isWhitespace(c)) {\n start = true;\n b.append((char) c);\n } else if (start) break;\n }\n } catch (IOException e) {\n }\n return b.toString();\n }\n\n static int readChars(char[] a, int off) {\n int cnt = 0;\n try {\n boolean start = false;\n for (int c = 0; (c = System.in.read()) != -1; ) {\n if (!Character.isWhitespace(c)) {\n start = true;\n a[off + cnt++] = (char) c;\n } else if (start) break;\n }\n } catch (IOException e) {\n }\n return cnt;\n }\n\n void dfs(long x, long y, int v1, int v2) {\n long diff = Math.abs(x - y);\n if (best <= 1 || diff - ch[v1][R] * ch[v2][R] >= best) return;\n if (v1 == R - 1 && v2 == R - 1) {\n if (diff < best) best = diff;\n return;\n }\n long key = x * 10_000 + v1 * 100 + v2;\n if (tried.contains(key)) return;\n if (v1 >= R) {\n long cur = ch[v1][R] - ch[v1 - 1][R];\n long other = ch[v2][R];\n dfs(x, y + cur * other, v1 - 1, v2);\n }\n if (v2 >= R) {\n long cur = ch[v2][R] - ch[v2 - 1][R];\n long other = ch[v1][R];\n dfs(x + cur * other, y, v1, v2 - 1);\n }\n tried.add(key);\n }\n\n long solve(long x, long y, int v1, int v2) {\n long diff = Math.abs(x - y);\n if (diff - ch[v1][R] * ch[v2][R] > best) return 0;\n long key = x * 10000 + v1 * 100 + v2;\n Long v = cache.get(key);\n if (v != null) return v;\n if (v1 < R || v2 < R) {\n if (v1 >= cntA[v1 + v2] && v2 >= cntB[v1 + v2]) {\n int sum = v1 + v2;\n v1 -= cntA[sum];\n v2 -= cntB[sum];\n return ch[v1 + v2][v1];\n }\n return 0;\n }\n long ans = 0;\n char c = str.charAt(v1 + v2 - 1);\n if (c != 'B') {\n long cur = ch[v1][R] - ch[v1 - 1][R];\n long other = ch[v2][R];\n ans += solve(x, y + cur * other, v1 - 1, v2);\n }\n if (c != 'A') {\n long cur = ch[v2][R] - ch[v2 - 1][R];\n long other = ch[v1][R];\n ans += solve(x + cur * other, y, v1, v2 - 1);\n }\n cache.put(key, ans);\n return ans;\n }\n\n void start() {\n R = readInt();\n C = readInt();\n for (int i = 0; i <= 2 * (R + C); i++)\n for (int j = 0; j <= i; j++)\n if (j == 0 || j == i) ch[i][j] = 1;\n else ch[i][j] = ch[i - 1][j - 1] + ch[i - 1][j];\n long x = 0, y = 0;\n int v1 = R + C, v2 = R + C;\n while (v1 >= R && v2 >= R)\n if (x > y) {\n long cur = ch[v1][R] - ch[v1 - 1][R];\n long other = ch[v2][R];\n y += cur * other;\n v1--;\n } else {\n long cur = ch[v2][R] - ch[v2 - 1][R];\n long other = ch[v1][R];\n x += cur * other;\n v2--;\n }\n best = Math.abs(x - y);\n dfs(0, 0, R + C, R + C);\n str = readString();\n for (int i = 0; i < 2 * (R + C); i++) {\n cntA[i + 1] = cntA[i] + (str.charAt(i) == 'A' ? 1 : 0);\n cntB[i + 1] = cntB[i] + (str.charAt(i) == 'B' ? 1 : 0);\n }\n long ans = solve(0, 0, R + C, R + C);\n writer.println(ans);\n }\n}\n", "lang_cluster": "Java", "tags": ["meet-in-the-middle", "combinatorics"], "code_uid": "ff10efc1c646fcbd4e68bc848c3355c1", "src_uid": "1b978b5aed4a83a2250bb23cc1ad6f85", "difficulty": 3300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class F {\n\n\tlong[][] ways;\n\n\tstatic class Half implements Comparable<Half> {\n\t\tlong match;\n\t\tlong value;\n\n\t\tpublic Half(long match, long value) {\n\t\t\tthis.match = match;\n\t\t\tthis.value = value;\n\t\t}\n\n\t\t@Override\n\t\tpublic int compareTo(Half o) {\n\t\t\treturn Long.compare(value, o.value);\n\t\t}\n\t}\n\n\tboolean nextCombination(int[] a, int n) {\n\t\tint k = a.length;\n\t\tint ptr = k - 1;\n\t\twhile (ptr >= 0 && a[ptr] == ptr - k + n) {\n\t\t\tptr--;\n\t\t}\n\t\tif (ptr < 0) {\n\t\t\treturn false;\n\t\t}\n\t\ta[ptr]++;\n\t\tfor (int i = ptr + 1; i < k; i++) {\n\t\t\ta[i] = a[ptr] + i - ptr;\n\t\t}\n\t\treturn true;\n\t}\n\n\tlong getWins(char[] s, int r, int c) {\n\t\tint curA = 0;\n\t\tint curB = 0;\n\t\tlong ret = 0;\n\t\tfor (char cc : s) {\n\t\t\tif (cc == 'A') {\n\t\t\t\tcurA++;\n\t\t\t} else {\n\t\t\t\tret += choose(curB, r - 1) * choose(curA, r);\n\t\t\t\tcurB++;\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n\n\tlong slow(int r, int c, String s) {\n\t\tint[] as = new int[r + c];\n\t\tfor (int i = 0; i < r + c; i++) {\n\t\t\tas[i] = i;\n\t\t}\n\t\tlong totalWays = ways[r + c][r] * ways[r + c][c];\n\n\t\tchar[] buf = new char[2 * (r + c)];\n\n\t\tlong bestDiff = Integer.MAX_VALUE;\n\t\tlong ans = 0;\n\t\t\n\t\tList<String> good = new ArrayList<>();\n\n\t\touter: do {\n\t\t\tArrays.fill(buf, 'B');\n\t\t\tfor (int pos : as) {\n\t\t\t\tbuf[pos] = 'A';\n\t\t\t}\n\t\t\tint match = 1;\n\t\t\tfor (int i = 0; i < 2 * (r + c); i++) {\n\t\t\t\tif (s.charAt(i) != '?' && s.charAt(i) != buf[i]) {\n\t\t\t\t\tmatch = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tlong winsA = getWins(buf, r, c);\n\t\t\tlong diff = Math.abs(2 * winsA - totalWays);\n\t\t\tif (diff < bestDiff) {\n\t\t\t\tbestDiff = diff;\n\t\t\t\tgood.clear();\n\t\t\t\tif (match == 1)\n\t\t\t\tgood.add(new String(buf));\n\t\t\t\tans = match;\n\t\t\t} else if (diff == bestDiff) {\n\t\t\t\tans += match;\n\t\t\t\tif (match == 1)\n\t\t\t\tgood.add(new String(buf));\n\t\t\t}\n\t\t} while (nextCombination(as, 2 * (r + c)));\n//\t\tSystem.err.println(good);\n\t\treturn ans;\n\t}\n\n\tlong solve(int r, int c, String s) {\n\n\t\tbestDiff = Long.MAX_VALUE;\n\t\tans = 0;\n\n\t\tlong maskA = 0;\n\t\tlong maskB = 0;\n\t\tint[][] cnt = new int[s.length() + 1][2];\n\t\tfor (int i = 0; i < s.length(); i++) {\n\t\t\tcnt[i + 1] = cnt[i].clone();\n\t\t\tif (s.charAt(i) == 'A') {\n\t\t\t\tcnt[i + 1][0]++;\n\t\t\t\tmaskA |= 1L << i;\n\t\t\t}\n\t\t\tif (s.charAt(i) == 'B') {\n\t\t\t\tcnt[i + 1][1]++;\n\t\t\t\tmaskB |= 1L << i;\n\t\t\t}\n\t\t}\n\n\t\tlong lastA = maskA >> (2 * r + c - 1);\n\t\tlong lastB = maskB >> (2 * r + c - 1);\n\n\t\tHalf[][] fst = new Half[c + 2][];\n\t\tHalf[][] snd = new Half[c + 2][];\n\t\tint[] sz = new int[c + 2];\n\t\tfor (int i = 0; i < c + 2; i++) {\n\t\t\tsz[i] = (int) ways[c + 1][i];\n\t\t\tfst[i] = new Half[sz[i]];\n\t\t\tsnd[i] = new Half[sz[i]];\n\t\t}\n\n\t\tfor (int mask = 0; mask < 1 << (c + 1); mask++) {\n\t\t\t// 0 - a, 1 - b\n\t\t\tint btc = Integer.bitCount(mask);\n\t\t\tint compBtc = c + 1 - btc;\n\t\t\tint idx = --sz[btc];\n\t\t\t{\n\t\t\t\tint samePref = Math.min(Integer\n\t\t\t\t\t\t.numberOfTrailingZeros((mask & 1) == 0 ? mask\n\t\t\t\t\t\t\t\t: (mask + 1)), c + 1);\n\n\t\t\t\tint totalA = r - 1 - cnt[2 * r - 2 + samePref][0];\n\t\t\t\tint totalB = r - 1 - cnt[2 * r - 2 + samePref][1];\n\t\t\t\tif ((mask & 1) == 0) {\n\t\t\t\t\ttotalA += samePref;\n\t\t\t\t} else {\n\t\t\t\t\ttotalB += samePref;\n\t\t\t\t}\n\n\t\t\t\tlong winsA = 0;\n\n\t\t\t\tint curA = 0;\n\t\t\t\tint curB = 0;\n\t\t\t\tfor (int i = 0; i < c + 1; i++) {\n\t\t\t\t\tif (test(mask, i)) {\n\t\t\t\t\t\twinsA += ways[r - 1 + curB][r - 1]\n\t\t\t\t\t\t\t\t* choose(r - 1 + curA, r);\n\t\t\t\t\t\tcurB++;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tcurA++;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t// can be optimized into some bit operations\n\t\t\t\tint exactMatch = 1;\n\t\t\t\tfor (int i = samePref; i < c + 1; i++) {\n\t\t\t\t\tif (!test(mask, i) && s.charAt(2 * r - 2 + i) == 'B') {\n\t\t\t\t\t\texactMatch = 0;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tif (test(mask, i) && s.charAt(2 * r - 2 + i) == 'A') {\n\t\t\t\t\t\texactMatch = 0;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tfst[btc][idx] = new Half(choose(totalA + totalB, totalA)\n\t\t\t\t\t\t* exactMatch, winsA);\n\t\t\t}\n\n\t\t\t{\n\t\t\t\tint match = 1;\n\t\t\t\tif (((~mask) & lastB) != 0) {\n\t\t\t\t\tmatch = 0;\n\t\t\t\t}\n\t\t\t\tif ((mask & lastA) != 0) {\n\t\t\t\t\tmatch = 0;\n\t\t\t\t}\n\n\t\t\t\tlong winsA = 0;\n\n\t\t\t\tint curA = btc;\n\t\t\t\tint curB = compBtc;\n\t\t\t\tfor (int i = 0; i < c + 1; i++) {\n\t\t\t\t\tif (test(mask, i)) {\n\t\t\t\t\t\twinsA += ways[r - 1 + curB][r - 1]\n\t\t\t\t\t\t\t\t* choose(r - 1 + curA, r);\n\t\t\t\t\t\tcurB++;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tcurA++;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tsnd[btc][idx] = new Half(match, winsA);\n\t\t\t}\n\t\t}\n\n\t\ttotalWays = ways[r + c][r] * ways[r + c][r];\n\t\tlong halfTotal = totalWays / 2;\n\n\t\tfor (int i = 0; i <= c + 1; i++) {\n\t\t\tHalf[] one = compress(fst[i]);\n\t\t\tHalf[] two = compress(snd[c + 1 - i]);\n\n\t\t\tint ptr = two.length - 1;\n\n\t\t\tfor (Half a : one) {\n\t\t\t\twhile (ptr >= 0 && a.value + two[ptr].value > halfTotal) {\n\t\t\t\t\tptr--;\n\t\t\t\t}\n\t\t\t\tif (ptr >= 0) {\n\t\t\t\t\tupdate(a, two[ptr]);\n\t\t\t\t}\n\t\t\t\tif (ptr + 1 < two.length) {\n\t\t\t\t\tupdate(a, two[ptr + 1]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn ans;\n\t}\n\n\tvoid submit() {\n\t\tint r = nextInt();\n\t\tint c = nextInt();\n\t\tString s = nextToken();\n\t\tout.println(solve(r, c, s));\n\t}\n\n\tlong totalWays;\n\n\tlong bestDiff = Long.MAX_VALUE;\n\tlong ans = 0;\n\n\tvoid update(Half a, Half b) {\n\t\tlong totalValue = a.value + b.value;\n\t\tlong diff = Math.abs(2 * totalValue - totalWays);\n\t\tlong delta = a.match * b.match;\n\t\tif (diff < bestDiff) {\n\t\t\tbestDiff = diff;\n\t\t\tans = delta;\n\t\t} else if (diff == bestDiff) {\n\t\t\tans += delta;\n\t\t}\n\t}\n\n\tHalf[] compress(Half[] arr) {\n\t\tArrays.sort(arr);\n\t\tint sz = 1;\n\t\tfor (int i = 1; i < arr.length; i++) {\n\t\t\tif (arr[i].value == arr[sz - 1].value) {\n\t\t\t\tarr[sz - 1].match += arr[i].match;\n\t\t\t} else {\n\t\t\t\tarr[sz++] = arr[i];\n\t\t\t}\n\t\t}\n\t\treturn Arrays.copyOf(arr, sz);\n\t}\n\n\tlong choose(int n, int k) {\n\t\treturn n >= 0 && k >= 0 && k <= n ? ways[n][k] : 0;\n\t}\n\n\tstatic boolean test(int mask, int i) {\n\t\treturn ((mask >> i) & 1) == 1;\n\t}\n\n\tvoid preCalc() {\n\t\tways = new long[61][];\n\t\tfor (int i = 0; i < ways.length; i++) {\n\t\t\tways[i] = new long[i + 1];\n\t\t\tways[i][0] = ways[i][i] = 1;\n\t\t\tfor (int j = 1; j < i; j++) {\n\t\t\t\tways[i][j] = ways[i - 1][j - 1] + ways[i - 1][j];\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid stress() {\n\t\tfor (int tst = 0;; tst++) {\n\t\t\tint r = rand(1, 3);\n\t\t\tint c = rand(1, 3);\n\t\t\tchar[] buf = new char[2 * (r + c)];\n\t\t\tArrays.fill(buf, '?');\n\t\t\tString s = new String(buf);\n\t\t\tlong fast = solve(r, c, s);\n\t\t\tlong slow = slow(r, c, s);\n\t\t\tif (fast != slow) {\n\t\t\t\tSystem.err.println(r + \" \" + c + \" \" + s);\n\t\t\t\tSystem.err.println(fast);\n\t\t\t\tSystem.err.println(slow);\n\t\t\t\tthrow new AssertionError();\n\t\t\t}\n\t\t\tSystem.err.println(tst + \" passed\");\n\t\t}\n\t}\n\n\tvoid test() {\n\t\tint r = 1;\n\t\tint c = 3;\n\t\tString s = \"ABBAABBA\";\n\t\tSystem.err.println(solve(r, c, s));\n//\t\tSystem.err.println(slow(r, c, s));\n\t}\n\n\tF() throws IOException {\n\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\tpreCalc();\n\t\t submit();\n//\t\tstress();\n//\t\t test();\n\t\tout.close();\n\t}\n\n\tstatic final Random rng = new Random();\n\n\tstatic int rand(int l, int r) {\n\t\treturn l + rng.nextInt(r - l + 1);\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew F();\n\t}\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\n\tString nextToken() {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tString nextString() {\n\t\ttry {\n\t\t\treturn br.readLine();\n\t\t} catch (IOException e) {\n\t\t\tthrow new RuntimeException(e);\n\t\t}\n\t}\n\n\tint nextInt() {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n}\n", "lang_cluster": "Java", "tags": ["meet-in-the-middle", "combinatorics"], "code_uid": "a60958ff94e9b6c9888630d1784508db", "src_uid": "1b978b5aed4a83a2250bb23cc1ad6f85", "difficulty": 3300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.IOException;\nimport java.util.*;\n\npublic class Test {\n int readInt() {\n int ans = 0;\n boolean neg = false;\n try {\n boolean start = false;\n for (int c = 0; (c = System.in.read()) != -1; ) {\n if (c == '-') {\n start = true;\n neg = true;\n continue;\n } else if (c >= '0' && c <= '9') {\n start = true;\n ans = ans * 10 + c - '0';\n } else if (start) break;\n }\n } catch (IOException e) {\n }\n return neg ? -ans : ans;\n }\n\n int r, c;\n Scanner sca = new Scanner(System.in);\n long[][] C = new long[64][64];\n long best = Long.MAX_VALUE;\n\n void dfs(long x, long y, int v1, int v2) {\n long d = Math.abs(x - y);\n if (best <= 1 || d - C[v1][r]*C[v2][r] >= best) return;\n if (v1 == r - 1 && v2 == r - 1) {\n if (d < best) best = d;\n return;\n }\n if (v1 >= r) {\n long c1 = C[v1][r] - C[v1-1][r], s2 = C[v2][r];\n dfs(x, y + c1*s2, v1 - 1, v2);\n }\n if (v2 >= r) {\n long s1 = C[v1][r], c2 = C[v2][r] - C[v2-1][r];\n dfs(x + s1*c2, y, v1, v2 - 1);\n }\n }\n\n int[] cntA = new int[64], cntB = new int[64];\n Map<Long, Long> cache = new TreeMap<>();\n char[] cs;\n\n long solve(long x, long y, int v1, int v2) {\n long k = x*10000 + v1*100 + v2;\n Long v = cache.get(k);\n if (v != null) return v;\n v = 0l;\n long d = Math.abs(x - y);\n if (d - C[v1][r]*C[v2][r] > best) {\n cache.put(k, v);\n return v;\n }\n if (v1 == 0 && v2 == 0) return 1;\n char c = cs[v1 + v2 - 1];\n if (v1 > 0 && c != 'B') {\n long c1 = C[v1][r] - C[v1 - 1][r], s2 = C[v2][r];\n v += solve(x, y + c1*s2, v1 - 1, v2);\n }\n if (v2 > 0 && c != 'A') {\n long s1 = C[v1][r], c2 = C[v2][r] - C[v2-1][r];\n v += solve( x + s1*c2, y, v1, v2 - 1);\n }\n cache.put(k, v);\n return v;\n }\n\n void start() {\n r = sca.nextInt(); c = sca.nextInt(); sca.nextLine();\n cs = sca.nextLine().toCharArray();\n for (int i = 0; i <= 2*(r + c); i++)\n for (int j = 0; j <= 2*(r + c); j++) {\n if (j == 0) C[i][j] = 1;\n else if (i == 0) C[i][j] = 0;\n else C[i][j] = C[i-1][j - 1] + C[i - 1][j];\n }\n int v1 = r + c, v2 = r + c;\n long x = 0, y = 0;\n while (v1 >= r && v2 >= r) {\n if (x > y) {\n long c1 = C[v1][r] - C[v1 - 1][r], s2 = C[v2][r];\n y += c1*s2;\n v1--;\n } else {\n long s1 = C[v1][r], c2 = C[v2][r] - C[v2-1][r];\n x += s1*c2;\n v2--;\n }\n }\n best = Math.abs(x - y);\n dfs(0, 0, r + c, r + c);\n for (int i = 0; i < 2*(r+c); i++) {\n cntA[i + 1] = cntA[i] + (cs[i] == 'A' ? 1 : 0);\n cntB[i + 1] = cntB[i] + (cs[i] == 'B' ? 1 : 0);\n }\n long ans = solve(0, 0, r + c, r + c);\n System.out.println(ans);\n }\n\n public static void main(String[] args) {\n\n new Test().start();\n\n }\n}\n", "lang_cluster": "Java", "tags": ["meet-in-the-middle", "combinatorics"], "code_uid": "bacbafc666822e2d06327ba44df61bea", "src_uid": "1b978b5aed4a83a2250bb23cc1ad6f85", "difficulty": 3300.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.BufferedWriter;\nimport java.io.IOException;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\nimport java.util.HashMap;\nimport java.util.Map;\n\npublic class Test {\n static PrintWriter writer =\n new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n int R, C;\n long[][] ch = new long[61][61];\n int[] cntA = new int[61], cntB = new int[61];\n long best = Long.MAX_VALUE;\n String str;\n Map<Long, Long> cache = new HashMap<>();\n\n public static void main(String[] args) {\n Test te = new Test();\n te.start();\n writer.flush();\n }\n\n static int readInt() {\n int ans = 0;\n boolean neg = false;\n try {\n boolean start = false;\n for (int c = 0; (c = System.in.read()) != -1; ) {\n if (c == '-') {\n start = true;\n neg = true;\n continue;\n } else if (c >= '0' && c <= '9') {\n start = true;\n ans = ans * 10 + c - '0';\n } else if (start) break;\n }\n } catch (IOException e) {\n }\n return neg ? -ans : ans;\n }\n\n static long readLong() {\n long ans = 0;\n boolean neg = false;\n try {\n boolean start = false;\n for (int c = 0; (c = System.in.read()) != -1; ) {\n if (c == '-') {\n start = true;\n neg = true;\n continue;\n } else if (c >= '0' && c <= '9') {\n start = true;\n ans = ans * 10 + c - '0';\n } else if (start) break;\n }\n } catch (IOException e) {\n }\n return neg ? -ans : ans;\n }\n\n static String readString() {\n StringBuilder b = new StringBuilder();\n try {\n boolean start = false;\n for (int c = 0; (c = System.in.read()) != -1; ) {\n if (Character.isLetterOrDigit(c) || c == '?') {\n start = true;\n b.append((char) c);\n } else if (start) break;\n }\n } catch (IOException e) {\n }\n return b.toString();\n }\n\n static int readChars(char[] a, int off) {\n int cnt = 0;\n try {\n boolean start = false;\n for (int c = 0; (c = System.in.read()) != -1; ) {\n if (Character.isLetterOrDigit(c)) {\n start = true;\n a[off + cnt++] = (char) c;\n } else if (start) break;\n }\n } catch (IOException e) {\n }\n return cnt;\n }\n\n void dfs(long x, long y, int v1, int v2) {\n long diff = Math.abs(x - y);\n if (best <= 1 || diff - ch[v1][R] * ch[v2][R] >= best) return;\n if (v1 == R - 1 && v2 == R - 1) {\n if (diff < best) best = diff;\n return;\n }\n if (v1 >= R) {\n long cur = ch[v1][R] - ch[v1 - 1][R];\n long other = ch[v2][R];\n dfs(x, y + cur * other, v1 - 1, v2);\n }\n if (v2 >= R) {\n long cur = ch[v2][R] - ch[v2 - 1][R];\n long other = ch[v1][R];\n dfs(x + cur * other, y, v1, v2-1);\n }\n }\n\n long solve(long x, long y, int v1, int v2) {\n long diff = Math.abs(x - y);\n if (diff - ch[v1][R] * ch[v2][R] > best) return 0;\n long key = x*10000 + v1*100 + v2;\n Long v = cache.get(key);\n if (v != null) return v;\n if (v1 < R || v2 < R) {\n if (v1 >= cntA[v1 + v2] && v2 >= cntB[v1 + v2]) {\n int sum = v1 + v2;\n v1 -= cntA[sum];\n v2 -= cntB[sum];\n return ch[v1 + v2][v1];\n }\n return 0;\n }\n long ans = 0;\n char c = str.charAt(v1 + v2 - 1);\n if (c != 'B') {\n long cur = ch[v1][R] - ch[v1 - 1][R];\n long other = ch[v2][R];\n ans += solve(x, y + cur * other, v1 - 1, v2);\n }\n if (c != 'A') {\n long cur = ch[v2][R] - ch[v2 - 1][R];\n long other = ch[v1][R];\n ans += solve(x + cur * other, y, v1, v2 - 1);\n }\n cache.put(key, ans);\n return ans;\n }\n\n void start() {\n R = readInt();\n C = readInt();\n for (int i = 0; i <= 2*(R + C); i++)\n for (int j = 0; j <= i; j++)\n if (j == 0 || j == i) ch[i][j] = 1;\n else ch[i][j] = ch[i - 1][j - 1] + ch[i - 1][j];\n long x = 0, y = 0;\n int v1 = R + C, v2 = R + C;\n while (v1 >= R && v2 >= R)\n if (x > y) {\n long cur = ch[v1][R] - ch[v1 - 1][R];\n long other = ch[v2][R];\n y += cur * other;\n v1--;\n } else {\n long cur = ch[v2][R] - ch[v2 - 1][R];\n long other = ch[v1][R];\n x += cur * other;\n v2--;\n }\n best = Math.abs(x - y);\n dfs(0, 0, R + C, R + C);\n str = readString();\n for (int i = 0; i < 2 * (R + C); i++) {\n cntA[i + 1] = cntA[i] + (str.charAt(i) == 'A' ? 1 : 0);\n cntB[i + 1] = cntB[i] + (str.charAt(i) == 'B' ? 1 : 0);\n }\n long ans = solve(0, 0, R + C, R + C);\n writer.println(ans);\n }\n}\n", "lang_cluster": "Java", "tags": ["meet-in-the-middle", "combinatorics"], "code_uid": "a1c5b00ef2181c1a2b6701f75c434fc1", "src_uid": "1b978b5aed4a83a2250bb23cc1ad6f85", "difficulty": 3300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.IOException;\nimport java.util.*;\n\npublic class Test {\n int readInt() {\n int ans = 0;\n boolean neg = false;\n try {\n boolean start = false;\n for (int c = 0; (c = System.in.read()) != -1; ) {\n if (c == '-') {\n start = true;\n neg = true;\n continue;\n } else if (c >= '0' && c <= '9') {\n start = true;\n ans = ans * 10 + c - '0';\n } else if (start) break;\n }\n } catch (IOException e) {\n }\n return neg ? -ans : ans;\n }\n\n int r, c;\n Scanner sca = new Scanner(System.in);\n long[][] C = new long[64][64];\n long best = Long.MAX_VALUE;\n\n void dfs(long x, long y, int v1, int v2) {\n long d = Math.abs(x - y);\n if (best <= 1 || d - C[v1][r]*C[v2][r] >= best) return;\n if (v1 == 0 && v2 == 0) {\n if (d < best) best = d;\n return;\n }\n if (v1 > 0) {\n long c1 = C[v1][r] - C[v1-1][r], s2 = C[v2][r];\n dfs(x, y + c1*s2, v1 - 1, v2);\n }\n if (v2 > 0) {\n long s1 = C[v1][r], c2 = C[v2][r] - C[v2-1][r];\n dfs(x + s1*c2, y, v1, v2 - 1);\n }\n }\n\n int[] cntA = new int[64], cntB = new int[64];\n Map<Long, Long> cache = new TreeMap<>();\n char[] cs;\n\n long solve(long x, long y, int v1, int v2) {\n long k = x*10000 + v1*100 + v2;\n Long v = cache.get(k);\n if (v != null) return v;\n v = 0l;\n long d = Math.abs(x - y);\n if (d - C[v1][r]*C[v2][r] > best) {\n cache.put(k, v);\n return v;\n }\n if (v1 == 0 && v2 == 0) return 1;\n char c = cs[v1 + v2 - 1];\n if (v1 > 0 && c != 'B') {\n long c1 = C[v1][r] - C[v1 - 1][r], s2 = C[v2][r];\n v += solve(x, y + c1*s2, v1 - 1, v2);\n }\n if (v2 > 0 && c != 'A') {\n long s1 = C[v1][r], c2 = C[v2][r] - C[v2-1][r];\n v += solve( x + s1*c2, y, v1, v2 - 1);\n }\n cache.put(k, v);\n return v;\n }\n\n void start() {\n r = sca.nextInt(); c = sca.nextInt(); sca.nextLine();\n cs = sca.nextLine().toCharArray();\n for (int i = 0; i <= 2*(r + c); i++)\n for (int j = 0; j <= 2*(r + c); j++) {\n if (j == 0) C[i][j] = 1;\n else if (i == 0) C[i][j] = 0;\n else C[i][j] = C[i-1][j - 1] + C[i - 1][j];\n }\n int v1 = r + c, v2 = r + c;\n long x = 0, y = 0;\n while (v1 >= r && v2 >= r) {\n if (x > y) {\n long c1 = C[v1][r] - C[v1 - 1][r], s2 = C[v2][r];\n y += c1*s2;\n v1--;\n } else {\n long s1 = C[v1][r], c2 = C[v2][r] - C[v2-1][r];\n x += s1*c2;\n v2--;\n }\n }\n best = Math.abs(x - y);\n dfs(0, 0, r + c, r + c);\n for (int i = 0; i < 2*(r+c); i++) {\n cntA[i + 1] = cntA[i] + (cs[i] == 'A' ? 1 : 0);\n cntB[i + 1] = cntB[i] + (cs[i] == 'B' ? 1 : 0);\n }\n long ans = solve(0, 0, r + c, r + c);\n System.out.println(ans);\n }\n\n public static void main(String[] args) {\n\n new Test().start();\n\n }\n}\n", "lang_cluster": "Java", "tags": ["meet-in-the-middle", "combinatorics"], "code_uid": "2a3578b3839b588eb5a985c7d61bb1e8", "src_uid": "1b978b5aed4a83a2250bb23cc1ad6f85", "difficulty": 3300.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.BufferedWriter;\nimport java.io.IOException;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\nimport java.util.HashMap;\nimport java.util.Map;\n\npublic class Test {\n static PrintWriter writer =\n new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n int R, C;\n long[][] ch = new long[61][61];\n int[] cntA = new int[61], cntB = new int[61];\n long best = Long.MAX_VALUE;\n String str;\n Map<Long, Long> cache = new HashMap<>();\n\n public static void main(String[] args) {\n Test te = new Test();\n te.start();\n writer.flush();\n }\n\n static int readInt() {\n int ans = 0;\n boolean neg = false;\n try {\n boolean start = false;\n for (int c = 0; (c = System.in.read()) != -1; ) {\n if (c == '-') {\n start = true;\n neg = true;\n continue;\n } else if (c >= '0' && c <= '9') {\n start = true;\n ans = ans * 10 + c - '0';\n } else if (start) break;\n }\n } catch (IOException e) {\n }\n return neg ? -ans : ans;\n }\n\n static long readLong() {\n long ans = 0;\n boolean neg = false;\n try {\n boolean start = false;\n for (int c = 0; (c = System.in.read()) != -1; ) {\n if (c == '-') {\n start = true;\n neg = true;\n continue;\n } else if (c >= '0' && c <= '9') {\n start = true;\n ans = ans * 10 + c - '0';\n } else if (start) break;\n }\n } catch (IOException e) {\n }\n return neg ? -ans : ans;\n }\n\n static String readString() {\n StringBuilder b = new StringBuilder();\n try {\n boolean start = false;\n for (int c = 0; (c = System.in.read()) != -1; ) {\n if (!Character.isWhitespace(c)) {\n start = true;\n b.append((char) c);\n } else if (start) break;\n }\n } catch (IOException e) {\n }\n return b.toString();\n }\n\n static int readChars(char[] a, int off) {\n int cnt = 0;\n try {\n boolean start = false;\n for (int c = 0; (c = System.in.read()) != -1; ) {\n if (Character.isLetterOrDigit(c)) {\n start = true;\n a[off + cnt++] = (char) c;\n } else if (start) break;\n }\n } catch (IOException e) {\n }\n return cnt;\n }\n\n void dfs(long x, long y, int v1, int v2) {\n long diff = Math.abs(x - y);\n if (best <= 1 || diff - ch[v1][R] * ch[v2][R] >= best) return;\n if (v1 == R - 1 && v2 == R - 1) {\n if (diff < best) best = diff;\n return;\n }\n if (v1 >= R) {\n long cur = ch[v1][R] - ch[v1 - 1][R];\n long other = ch[v2][R];\n dfs(x, y + cur * other, v1 - 1, v2);\n }\n if (v2 >= R) {\n long cur = ch[v2][R] - ch[v2 - 1][R];\n long other = ch[v1][R];\n dfs(x + cur * other, y, v1, v2-1);\n }\n }\n\n long solve(long x, long y, int v1, int v2) {\n long diff = Math.abs(x - y);\n if (diff - ch[v1][R] * ch[v2][R] > best) return 0;\n long key = x*10000 + v1*100 + v2;\n Long v = cache.get(key);\n if (v != null) return v;\n if (v1 < R || v2 < R) {\n if (v1 >= cntA[v1 + v2] && v2 >= cntB[v1 + v2]) {\n int sum = v1 + v2;\n v1 -= cntA[sum];\n v2 -= cntB[sum];\n return ch[v1 + v2][v1];\n }\n return 0;\n }\n long ans = 0;\n char c = str.charAt(v1 + v2 - 1);\n if (c != 'B') {\n long cur = ch[v1][R] - ch[v1 - 1][R];\n long other = ch[v2][R];\n ans += solve(x, y + cur * other, v1 - 1, v2);\n }\n if (c != 'A') {\n long cur = ch[v2][R] - ch[v2 - 1][R];\n long other = ch[v1][R];\n ans += solve(x + cur * other, y, v1, v2 - 1);\n }\n cache.put(key, ans);\n return ans;\n }\n\n void start() {\n R = readInt();\n C = readInt();\n for (int i = 0; i <= 2*(R + C); i++)\n for (int j = 0; j <= i; j++)\n if (j == 0 || j == i) ch[i][j] = 1;\n else ch[i][j] = ch[i - 1][j - 1] + ch[i - 1][j];\n long x = 0, y = 0;\n int v1 = R + C, v2 = R + C;\n while (v1 >= R && v2 >= R)\n if (x > y) {\n long cur = ch[v1][R] - ch[v1 - 1][R];\n long other = ch[v2][R];\n y += cur * other;\n v1--;\n } else {\n long cur = ch[v2][R] - ch[v2 - 1][R];\n long other = ch[v1][R];\n x += cur * other;\n v2--;\n }\n best = Math.abs(x - y);\n dfs(0, 0, R + C, R + C);\n str = readString();\n for (int i = 0; i < 2 * (R + C); i++) {\n cntA[i + 1] = cntA[i] + (str.charAt(i) == 'A' ? 1 : 0);\n cntB[i + 1] = cntB[i] + (str.charAt(i) == 'B' ? 1 : 0);\n }\n long ans = solve(0, 0, R + C, R + C);\n writer.println(ans);\n }\n}\n", "lang_cluster": "Java", "tags": ["meet-in-the-middle", "combinatorics"], "code_uid": "0e875fc63ff1ba1742944eebfd04efc0", "src_uid": "1b978b5aed4a83a2250bb23cc1ad6f85", "difficulty": 3300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.IOException;\nimport java.util.*;\n\npublic class Test {\n int readInt() {\n int ans = 0;\n boolean neg = false;\n try {\n boolean start = false;\n for (int c = 0; (c = System.in.read()) != -1; ) {\n if (c == '-') {\n start = true;\n neg = true;\n continue;\n } else if (c >= '0' && c <= '9') {\n start = true;\n ans = ans * 10 + c - '0';\n } else if (start) break;\n }\n } catch (IOException e) {\n }\n return neg ? -ans : ans;\n }\n\n int r, c;\n Scanner sca = new Scanner(System.in);\n long[][] C = new long[64][64];\n long best = Long.MAX_VALUE;\n\n void dfs(long x, long y, int v1, int v2) {\n long d = Math.abs(x - y);\n if (best <= 1 || d - C[v1][r]*C[v2][r] >= best) return;\n if (v1 == 0 && v2 == 0) {\n if (d < best) best = d;\n return;\n }\n if (v1 > 0) {\n long c1 = C[v1][r] - C[v1-1][r], s2 = C[v2][r];\n dfs(x, y + c1*s2, v1 - 1, v2);\n }\n if (v2 > 0) {\n long s1 = C[v1][r], c2 = C[v2][r] - C[v2-1][r];\n dfs(x + s1*c2, y, v1, v2 - 1);\n }\n }\n\n int[] cntA = new int[64], cntB = new int[64];\n Map<Long, Long> cache = new TreeMap<>();\n char[] cs;\n\n long solve(long x, long y, int v1, int v2) {\n long k = x*10000 + v1*100 + v2;\n Long v = cache.get(k);\n if (v != null) return v;\n v = 0l;\n long d = Math.abs(x - y);\n if (d - C[v1][r]*C[v2][r] > best) {\n cache.put(k, v);\n return v;\n }\n if (v1 == 0 && v2 == 0) return 1;\n char c = cs[v1 + v2 - 1];\n if (v1 > 0 && c != 'B') {\n long c1 = C[v1][r] - C[v1 - 1][r], s2 = C[v2][r];\n v += solve(x, y + c1*s2, v1 - 1, v2);\n }\n if (v2 > 0 && c != 'A') {\n long s1 = C[v1][r], c2 = C[v2][r] - C[v2-1][r];\n v += solve( x + s1*c2, y, v1, v2 - 1);\n }\n cache.put(k, v);\n return v;\n }\n\n void start() {\n r = sca.nextInt(); c = sca.nextInt(); sca.nextLine();\n cs = sca.nextLine().toCharArray();\n for (int i = 0; i <= 2*(r + c); i++)\n for (int j = 0; j <= 2*(r + c); j++) {\n if (j == 0) C[i][j] = 1;\n else if (i == 0) C[i][j] = 0;\n else C[i][j] = C[i-1][j - 1] + C[i - 1][j];\n }\n int v1 = r + c, v2 = r + c;\n long x = 0, y = 0;\n while (v1 > 0 && v2 > 0) {\n if (x > y) {\n long c1 = C[v1][r] - C[v1 - 1][r], s2 = C[v2][r];\n y += c1*s2;\n v1--;\n } else {\n long s1 = C[v1][r], c2 = C[v2][r] - C[v2-1][r];\n x += s1*c2;\n v2--;\n }\n }\n best = Math.abs(x - y);\n dfs(0, 0, r + c, r + c);\n for (int i = 0; i < 2*(r+c); i++) {\n cntA[i + 1] = cntA[i] + (cs[i] == 'A' ? 1 : 0);\n cntB[i + 1] = cntB[i] + (cs[i] == 'B' ? 1 : 0);\n }\n long ans = solve(0, 0, r + c, r + c);\n System.out.println(ans);\n }\n\n public static void main(String[] args) {\n\n new Test().start();\n\n }\n}\n", "lang_cluster": "Java", "tags": ["meet-in-the-middle", "combinatorics"], "code_uid": "58f55b8b925c7f01790b3bc52fe6aab7", "src_uid": "1b978b5aed4a83a2250bb23cc1ad6f85", "difficulty": 3300.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Arrays;\nimport java.util.Random;\nimport java.util.Scanner;\n\npublic class Prob03 {\n \n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int N = in.nextInt();\n int[] L = new int[N];\n int[] R = new int[N];\n for (int i = 0; i < N; i++) {\n L[i] = in.nextInt();\n R[i] = in.nextInt();\n }\n double[] probabilities = new double[10001];\n for (int i = 0; i < N; i++) {\n for (int j = L[i]; j <= R[i]; j++) {\n double prob = 1./(R[i]-L[i]+1);\n //count probability j to be the second largest\n double probResult = 0;\n outer:\n for (int k = 0; k < N; k++) {\n if (i == k) continue;\n \n double probMax = (1.*R[k] - j)/(R[k]-L[k]+1);\n if (probMax < 0) continue;\n if (i < k && L[k]<=j && R[k] >= j) probMax += 1./(R[k]-L[k]+1);\n if (probMax > 1) probMax = 1;\n \n for (int m = 0; m < N; m++) {\n if (m==i || m == k) continue;\n double probMin = (1.*j - L[m])/(R[m]-L[m]+1);\n if (probMin < 0) continue outer; \n if (m < i && L[m]<=j && R[m] >= j) probMin += 1./(R[m]-L[m]+1);\n if (probMin > 1) probMin = 1;\n// System.out.println(\"second: \" + j + \" max prob: \" + probMax + \" min prob: \" + probMin);\n probMax *= probMin;\n }\n probResult += probMax;\n }\n prob *= probResult;\n probabilities[j] += prob;\n// System.out.println(Arrays.toString(probabilities));\n }\n }\n \n double sum = 0;\n double prob = 0;\n for (int i = 1; i < 10001; i++) {\n sum += i *probabilities[i];\n prob += probabilities[i];\n }\n// System.out.println(sum);\n// System.out.println(sum / prob);\n System.out.println(String.format(\"%.9f\", sum));\n }\n\n}\n", "lang_cluster": "Java", "tags": ["probabilities", "bitmasks"], "code_uid": "927efbca2f2a9e21de4f8f094de88c06", "src_uid": "5258ce738eb268b9750cfef309d265ef", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n//\tstatic Scanner in;\n\tstatic PrintWriter out;\n\tstatic StreamTokenizer in; static int next() throws Exception {in.nextToken(); return (int) in.nval;}\n//\tstatic BufferedReader in;\n\n\tstatic TreeSet<Long> set = new TreeSet<Long>();\n\tstatic int n;\n\tstatic int[] x;\n\n\tstatic void count(int[] kol) {\n\t\t//System.out.println(\"!\");\n\t long a = 0;\n\t\tfor (int i = 0; i < n; i++) a = a*n + x[i];\n\t\tset.add(a);\n\t\t\n\t\tint c = 0;\n\t\tfor (int i = 0; i < n; i++) if (kol[i] > 0) c++;\n\t\tif (c < 2) return;\n\n\t\tfor (int i = 0; i < n; i++) if (kol[i] > 0) {\n\t\t\tfor (int j = i + 1; j < n; j++) if (kol[j] > 0) {\n\t\t\t\tint[] kol2 = new int[n];\n\t\t\t\tfor (int t = 0; t < n; t++) kol2[t] = kol[t];\n\t\t\t\tkol2[i]--;\n\t\t\t\tkol2[j]--;\n\t\t\t\tint temp = x[i];\n\t\t\t\tx[i] = x[j];\n\t\t\t\tx[j] = temp;\n\t\t\t\tcount(kol2);\n\t\t\t\ttemp = x[i];\n\t\t\t\tx[i] = x[j];\n\t\t\t\tx[j] = temp;\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n//\t\tin = new Scanner(System.in);\n\t\tout = new PrintWriter(System.out);\n\t\tin = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));\n//\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\n\t\tn = next();\n\n\t\tint[] kol = new int[n];\n\t\tfor (int i = 0; i < n; i++) kol[i] = next();\n\t\tint ones = 0;\n\t\tint twos = 0;\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tif (kol[i] == 1) ones++;\n\t\t\telse twos++;\n\n\t\tint mod = 1000000007;\n\n\t\tlong[][] d = new long[n + 1][n + 1];\n\t\tint[][] c = new int[n + 1][n + 1];\n\t\tfor (int i = 0; i <= n; i++) c[i][0] = c[i][i] = 1;\n\t\tfor (int i = 0; i <= n; i++)\n\t\t\tfor (int j = 1; j < i; j++) c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % mod;\n\n\t\tint[] f = new int[n + 1];\n\t\tf[0] = 1;\n\t\tfor (int i = 0; i < n; i++) f[i + 1] = (int)((1L * f[i] * (i + 1)) % mod);\n\n\t\tint[][] a = new int[n + 1][n + 1];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tfor (int j = 0; j <= i; j++) a[i][j] = (int)(c[i][j] * 1L * f[j] % mod);\n\n\t\tfor (int i = 0; i <= ones; i++)\n\t\t\tfor (int j = 0; j <= twos; j++) {\n\t\t\t\tif (i <= 2) d[i][j] = f[i + j];\n\t\t\t\telse {\n\t\t\t\t\td[i][j] = d[i - 1][j];\n\t\t\t\t\tfor (int k = 1; k <= j; k++)\n\t\t\t\t\t\td[i][j] += (a[j][k] * d[i - 1][j - k]) % mod;\n\t\t\t\t\tfor (int k = 0; k <= j; k++)\n\t\t\t\t\t\td[i][j] += (i - 1) * a[j][k] * (k + 1) % mod * d[i - 2][j - k] % mod;\n\t\t\t\t\td[i][j] %= mod;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\tout.println(d[ones][twos]);\n\t\t\n/*\t\tx = new int[n];\n\t\tfor (int i = 0; i < n; i++) x[i] = i;\n\t\tcount(kol);\n\n\t\tout.println(set.size());*/\n\n\t\tout.close();\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "dp"], "code_uid": "57c06966581df332627088e7b1752cad", "src_uid": "91e8dbe94273e255182aca0f94117bb9", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\npublic class z3 { \n\tpublic static void main(String[] args) throws IOException {\t\n\t\tStreamTokenizer in;\n\t\tPrintWriter out;\n\t\tin = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));\n\t\tout = new PrintWriter(new OutputStreamWriter(System.out));\n\n\t\t in.nextToken();\n\t\t int n=(int) in.nval;\n\tint[] a = new int[n];\n\tfor (int i=0;i<n;i++) {in.nextToken(); a[i]=(int) in.nval;}\n\tin.nextToken();\n\tint t=(int) in.nval;\n\tint temp;\n\tfor (int i=0;i<t;i++) {in.nextToken(); temp=(int) in.nval;a[temp-1]=-Math.abs(a[temp-1]);}\n\tif ((n%2)!=0) {out.println(\"NO\");out.flush();}\n\telse\n\t {\n\t\tint kol=0;int[] st=new int[n+1];\n\t\t for (int i=n-1;i>=0;i--)\n\t\t {\n\t\t\t if (kol==0) {kol=1;st[kol]=Math.abs(a[i]);a[i]=-st[kol];} else\n\t\t\t {\n\t\t\t\t if (st[kol]==a[i]) kol-=1; else\n\t\t\t\t {kol+=1;st[kol]=Math.abs(a[i]);a[i]=-st[kol];}\n\t\t\t }\n\t\t }\n\t\t if (kol!=0) {out.println(\"NO\");out.flush();} else\n\t\t {\n\t\t\t out.println(\"YES\");\n\t\t\t for (int i=0;i<n;i++) out.print(\"\"+a[i]+\" \");\n\t\t\t out.flush();\n\t\t } \n\t}\n}\n}", "lang_cluster": "Java", "tags": ["greedy", "data structures"], "code_uid": "9307893c363e27e4d2c6b56ccb2d5391", "src_uid": "be82b8f209217875221ebe5de8675971", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.StreamTokenizer;\nimport java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.io.Reader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskE solver = new TaskE();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskE {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.nextInt();\n if (n % 2 != 0) {\n out.print(\"NO\");\n return;\n }\n int[] p = new int[n];\n for (int i = 0; i < n; i++) {\n p[i] = in.nextInt();\n }\n int t = in.nextInt();\n for (int i = 0; i < t; i++) {\n int k = in.nextInt();\n p[k - 1] *= -1;\n }\n\n int[] s = new int[n];\n int h = -1;\n\n for (int i = n - 1; i >= 0; i--) {\n if (p[i] < 0 || h < 0 || s[h] != p[i]) {\n if (p[i] > 0)\n p[i] *= -1;\n h++;\n s[h] = -p[i];\n } else {\n h--;\n }\n }\n\n if (h >= 0) {\n out.print(\"NO\");\n return;\n }\n\n out.println(\"YES\");\n for (int i = 0; i < n; i++) {\n out.print(p[i]);\n out.print(' ');\n }\n }\n}\n\nclass InputReader {\n private StreamTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n Reader r = new BufferedReader(new InputStreamReader(stream));\n tokenizer = new StreamTokenizer(r);\n tokenizer.eolIsSignificant(false);\n }\n\n public int nextInt() {\n try {\n int i = tokenizer.nextToken();\n if (i == StreamTokenizer.TT_NUMBER)\n return (int) tokenizer.nval;\n else\n throw new InputMismatchException();\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n }\n\n }\n", "lang_cluster": "Java", "tags": ["greedy", "data structures"], "code_uid": "b27bf606109cd0e9a6a3a93a22b21042", "src_uid": "be82b8f209217875221ebe5de8675971", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\n\npublic class E {\n static int[] A;\n static int inf = (int) 2e9;\n static int[] s;\n static int[] p;\n static int indexS = -1;\n static int indexP = -1;\n\n public static boolean collapse(int x) {\n p[++indexP] = x;\n while (indexP != -1) {\n if (indexS == -1)\n return false;\n int y = p[indexP];\n int z = s[indexS--];\n if (-A[z] != y) {\n A[z] *= -1;\n p[++indexP] = A[z];\n } else\n --indexP;\n }\n return true;\n }\n\n public static boolean solve() {\n for (int i = 0; i < A.length; i++)\n if (A[i] > 0)\n s[++indexS] = i;\n else if (!collapse(A[i]))\n return false;\n return true;\n }\n\n public static void main(String[] args) throws NumberFormatException,\n IOException {\n InputReader in = new InputReader(System.in);\n PrintWriter out = new PrintWriter(System.out);\n int n = in.readInt();\n A = new int[n + 2];\n A[0] = inf;\n A[n + 1] = -inf;\n s = new int[n + 2];\n p = new int[n + 2];\n for (int i = 0; i < n; i++)\n A[i + 1] = in.readInt();\n int k = in.readInt();\n for (int i = 0; i < k; i++)\n A[in.readInt()] *= -1;\n if (solve()) {\n out.println(\"YES\");\n for (int i = 1; i <= n; i++)\n out.print(A[i] + \" \");\n out.println();\n } else\n out.println(\"NO\");\n out.flush();\n out.close();\n }\n}\n\nclass InputReader {\n\n private InputStream stream;\n private byte[] buf = new byte[1000];\n private int curChar, numChars;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n private int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public long readLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public String readString() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuffer res = new StringBuffer();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n private boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n private String readLine0() {\n StringBuffer buf = new StringBuffer();\n int c = read();\n while (c != '\\n' && c != -1) {\n buf.appendCodePoint(c);\n c = read();\n }\n return buf.toString();\n }\n\n public String readLine() {\n String s = readLine0();\n while (s.trim().length() == 0)\n s = readLine0();\n return s;\n }\n\n public String readLine(boolean ignoreEmptyLines) {\n if (ignoreEmptyLines)\n return readLine();\n else\n return readLine0();\n }\n\n public char readCharacter() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n return (char) c;\n }\n\n public double readDouble() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, readInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, readInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n}", "lang_cluster": "Java", "tags": ["greedy", "data structures"], "code_uid": "b47f14cc98a1e6912b6efdcec946d059", "src_uid": "be82b8f209217875221ebe5de8675971", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.File;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n private void solve() throws IOException {\n int n = ni();\n int p[] = nia(n);\n int t = ni();\n int q[] = niam1(t);\n boolean sgn[] = new boolean[n];\n for (Integer i : q) {\n sgn[i] = true;\n }\n int stack[] = new int[n];\n int tos = 0;\n\n for (int i = n - 1; i >= 0; --i) {\n int brt = p[i];\n if (tos > 0 && p[stack[tos - 1]] == brt && !sgn[i])\n --tos;\n else {\n stack[tos++] = i;\n sgn[i] = true;\n }\n }\n\n if (tos != 0)\n prln(\"NO\");\n else {\n prln(\"YES\");\n for (int i = 0; i < n; ++i) {\n if (sgn[i])\n pr(\"-\" + p[i] + \" \");\n else\n pr(p[i] + \" \");\n }\n }\n }\n\n public static void main(String[] args) {\n new Main().run();\n }\n\n public void run() {\n try {\n if (isFileIO) {\n pw = new PrintWriter(new File(\"output.out\"));\n br = new BufferedReader(new FileReader(\"input.in\"));\n } else {\n pw = new PrintWriter(System.out);\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n solve();\n pw.close();\n br.close();\n } catch (IOException e) {\n System.err.println(\"IO Error\");\n }\n }\n\n private int[] nia(int n) throws IOException {\n int arr[] = new int[n];\n for (int i = 0; i < n; ++i)\n arr[i] = Integer.parseInt(nextToken());\n return arr;\n }\n\n private int[] niam1(int n) throws IOException {\n int arr[] = new int[n];\n for (int i = 0; i < n; ++i)\n arr[i] = Integer.parseInt(nextToken()) - 1;\n return arr;\n }\n\n private long[] nla(int n) throws IOException {\n long arr[] = new long[n];\n for (int i = 0; i < n; ++i)\n arr[i] = Long.parseLong(nextToken());\n return arr;\n }\n\n private void pr(Object o) {\n pw.print(o);\n }\n\n private void prln(Object o) {\n pw.println(o);\n }\n\n private void prln() {\n pw.println();\n }\n\n int ni() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n long nl() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n double nd() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n private String nextToken() throws IOException {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n tokenizer = new StringTokenizer(br.readLine());\n }\n\n return tokenizer.nextToken();\n }\n\n // private void qsort(int a[]) {\n // Random rand = new Random(271828182l);\n // qsort(a, 0, a.length, rand);\n // }\n //\n // private void qsort(int a[], int l, int r, Random rand) {\n // if (r - l <= 1)\n // return;\n //\n // if (r - l == 2) {\n // if (a[r - 1] < a[l]) {\n // int t = a[r - 1];\n // a[r - 1] = a[l];\n // a[l] = t;\n // }\n //\n // return;\n // }\n //\n // int x = a[rand.nextInt(r - l) + l];\n // int i = l, j = r - 1;\n // while (i < j) {\n // while (a[i] < x)\n // ++i;\n // while (a[j] > x)\n // --j;\n // if (i < j) {\n // int t = a[i];\n // a[i] = a[j];\n // a[j] = t;\n // ++i;\n // --j;\n // }\n // }\n //\n // qsort(a, l, j + 1, rand);\n // qsort(a, i, r, rand);\n // }\n\n private BufferedReader br;\n private StringTokenizer tokenizer;\n private PrintWriter pw;\n private final boolean isFileIO = false;\n}", "lang_cluster": "Java", "tags": ["greedy", "data structures"], "code_uid": "48a595bd80304f306e44d47dd10bc607", "src_uid": "be82b8f209217875221ebe5de8675971", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class Main{\n\n BufferedReader in;\n StringTokenizer str = null;\n PrintWriter out;\n\n private String next() throws Exception{\n \tif (str == null || !str.hasMoreElements())\n \t str = new StringTokenizer(in.readLine());\n \treturn str.nextToken();\n }\n \n private int nextInt() throws Exception{\n\t return Integer.parseInt(next());\n }\n\n int n;\n int []p;\n Map<Integer, Integer> map, cmap;\n Stack<Integer> stack;\n\n public void run() throws Exception{\n \tin = new BufferedReader(new InputStreamReader(System.in));\n \tout = new PrintWriter(System.out);\n\n n = nextInt();\n if (n % 2 == 1) {\n out.println(\"NO\");\n out.close();\n return;\n }\t\n\n int p[] = new int[n];\n\n for(int i=0;i<n;i++){\n int x = nextInt();\n p[i] = x;\n }\n\n int m = nextInt();\n if (m > n/2) {\n out.println(\"NO\");\n out.close();\n return;\n }\n \n for(int i=0;i<m;i++){\n int x = nextInt()-1;\n p[x]*=-1;\n }\n\n stack = new Stack<Integer>();\n for(int i=n-1;i>=0;i--){\n if (p[i] < 0) {\n stack.push(-1 * p[i]);\n }else{\n if (stack.size() > 0 && stack.peek() == p[i]){\n stack.pop();\n }else{\n stack.push(p[i]);\n p[i]*=-1;\n }\n }\n }\n\n if (stack.size() > 0) {\n out.println(\"NO\");\n }else{\n out.println(\"YES\");\n for(int i=0;i<n;i++){\n out.print(p[i] + \" \");\n }\n out.println(); \n }\n out.close();\n }\n\n public static void main(String args[]) throws Exception{\n\t new Main().run();\n }\n}", "lang_cluster": "Java", "tags": ["greedy", "data structures"], "code_uid": "c192eb28112aab3791c7ed3926009516", "src_uid": "be82b8f209217875221ebe5de8675971", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author vadimmm\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskE solver = new TaskE();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskE {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int counter = in.nextInt();\n int[] bracket = new int[counter];\n int[] stack = new int[counter];\n int size = 0;\n for (int i = 0; i < counter; ++i)\n bracket[i] = in.nextInt();\n counter = in.nextInt();\n for (int i = 0; i < counter; ++i) {\n int index = in.nextInt() - 1;\n bracket[index] = -bracket[index];\n }\n for (int i = bracket.length - 1; i >= 0; --i) {\n if (bracket[i] < 0)\n stack[size++] = bracket[i];\n else if (size > 0 && stack[size - 1] + bracket[i] == 0)\n size--;\n else {\n bracket[i] = -bracket[i];\n stack[size++] = bracket[i];\n }\n }\n if (size > 0)\n out.println(\"NO\");\n else {\n out.println(\"YES\");\n for (int i : bracket) {\n out.print(i);\n out.print(\" \");\n }\n }\n }\n}\n\nclass InputReader {\n\n private static BufferedReader bufferedReader;\n private static StringTokenizer stringTokenizer;\n\n public InputReader(InputStream inputStream) {\n bufferedReader = new BufferedReader(new InputStreamReader(inputStream));\n stringTokenizer = null;\n }\n\n public String next() {\n while(stringTokenizer == null || !stringTokenizer.hasMoreTokens()) {\n try {\n stringTokenizer = new StringTokenizer(bufferedReader.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return stringTokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n\n", "lang_cluster": "Java", "tags": ["greedy", "data structures"], "code_uid": "f4c6ed3eb0b864f8e2836bfc9038f13a", "src_uid": "be82b8f209217875221ebe5de8675971", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.StreamTokenizer;\nimport java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.io.Reader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskE solver = new TaskE();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskE {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.nextInt();\n if (n % 2 != 0) {\n out.print(\"NO\");\n return;\n }\n int[] p = new int[n];\n for (int i = 0; i < n; i++) {\n p[i] = in.nextInt();\n }\n int t = in.nextInt();\n for (int i = 0; i < t; i++) {\n int k = in.nextInt();\n p[k - 1] *= -1;\n }\n\n int[] s = new int[n];\n int h = -1;\n\n for (int i = n - 1; i >= 0; i--) {\n if (p[i] < 0 || h < 0 || s[h] != p[i]) {\n if (p[i] > 0)\n p[i] *= -1;\n h++;\n s[h] = -p[i];\n } else {\n h--;\n }\n }\n\n if (h >= 0) {\n out.print(\"NO\");\n return;\n }\n\n out.println(\"YES\");\n for (int i = 0; i < n; i++) {\n out.print(p[i]);\n out.print(' ');\n }\n }\n}\n\nclass InputReader {\n private StreamTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n Reader r = new BufferedReader(new InputStreamReader(stream));\n tokenizer = new StreamTokenizer(r);\n tokenizer.eolIsSignificant(false);\n tokenizer.wordChars(34, 255);\n }\n\n public int nextInt() {\n try {\n int i = tokenizer.nextToken();\n if (i == StreamTokenizer.TT_NUMBER)\n return (int) tokenizer.nval;\n else\n throw new InputMismatchException(\"type = \" + i);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n }\n\n}\n", "lang_cluster": "Java", "tags": ["greedy", "data structures"], "code_uid": "2e2f86f74154d59e66414036d040cba8", "src_uid": "be82b8f209217875221ebe5de8675971", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "\n\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Stack;\nimport java.util.StringTokenizer;\n\npublic class E {\n public static void main(String[] args) throws Exception {\n int n = nextInt();\n int[] ar = new int[n];\n for (int i = 0; i < n; i++) {\n ar[i] = nextInt();\n }\n Stack<Integer> stack = new Stack<Integer>();\n int q = nextInt();\n int[] openBarcket = new int[n];\n for (int i = 0; i < q; i++) {\n openBarcket[nextInt() - 1] = 1;\n }\n for (int i = n - 1, j = 0; j < n; j++, i--) {\n if (stack.isEmpty() || stack.peek() != ar[i]) {\n stack.push(ar[i]);\n } else {\n if (openBarcket[i] == 1) {\n stack.push(ar[i]);\n } else {\n ar[i] *= -1;\n stack.pop();\n }\n }\n }\n if (stack.isEmpty()) {\n PrintWriter out = new PrintWriter(System.out);\n out.println(\"YES\");\n for (int i = 0; i < n; i++) {\n out.print((-ar[i]) + \" \");\n }\n out.println();\n out.flush();\n } else {\n System.out.println(\"NO\");\n }\n }\n\n static BufferedReader br = new BufferedReader(new InputStreamReader(\n System.in));\n static StringTokenizer tokenizer = new StringTokenizer(\"\");\n\n static int nextInt() throws Exception {\n return Integer.parseInt(next());\n }\n\n static long nextLong() throws Exception {\n return Long.parseLong(next());\n }\n\n static double nextDouble() throws Exception {\n return Double.parseDouble(next());\n }\n\n static String next() throws Exception {\n while (true) {\n if (tokenizer.hasMoreTokens()) {\n return tokenizer.nextToken();\n }\n String s = br.readLine();\n if (s == null) {\n return null;\n }\n tokenizer = new StringTokenizer(s);\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["greedy", "data structures"], "code_uid": "dfda80bb7657c39df648da88fbc617c3", "src_uid": "be82b8f209217875221ebe5de8675971", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\npublic class z3 { \n\tpublic static void main(String[] args) throws IOException {\t\n\t\tStreamTokenizer in;\n\t\tPrintWriter out;\n\t\tin = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));\n\t\tout = new PrintWriter(new OutputStreamWriter(System.out));\n\n\t\t in.nextToken();\n\t\t int n=(int) in.nval;\n\tint[] a = new int[n];\n\tfor (int i=0;i<n;i++) {in.nextToken(); a[i]=(int) in.nval;}\n\tin.nextToken();\n\tint t=(int) in.nval;\n\tint temp;\n\tfor (int i=0;i<t;i++) {in.nextToken(); temp=(int) in.nval;a[temp-1]=-Math.abs(a[temp-1]);}\n\tif ((n%2)!=0) {out.println(\"NO\");out.flush();}\n\telse\n\t {\n\t\tint kol=0;int[] st=new int[n+1];\n\t\t for (int i=n-1;i>=0;i--)\n\t\t {\n\t\t\t if (kol==0) {kol=1;st[kol]=Math.abs(a[i]);a[i]=-st[kol];} else\n\t\t\t {\n\t\t\t\t if (st[kol]==a[i]) kol-=1; else\n\t\t\t\t {kol+=1;st[kol]=Math.abs(a[i]);a[i]=-st[kol];}\n\t\t\t }\n\t\t }\n\t\t if (kol!=0) {out.println(\"NO\");out.flush();} else\n\t\t {\n\t\t\t out.println(\"YES\");\n\t\t\t for (int i=0;i<n;i++) {out.print(a[i]);out.print(' ');}\n\t\t\t out.flush();\n\t\t } \n\t}\n}\n}", "lang_cluster": "Java", "tags": ["greedy", "data structures"], "code_uid": "2d627ea4e8291e45d75f78dd95f97ea8", "src_uid": "be82b8f209217875221ebe5de8675971", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\npublic class z3 { \n\tprivate static BufferedReader in;\n\tprivate static StringTokenizer tok;\n\tprivate static String readToken() throws IOException {\n\t\twhile (tok == null || !tok.hasMoreTokens()) {\n\t\t\ttok = new StringTokenizer(in.readLine());\n\t\t}\n\t\treturn tok.nextToken();\n\t}\n\t\n\tprivate static int readInt() throws IOException {\n\t\treturn Integer.parseInt(readToken());\n\t}\n\t\n\n\tpublic static void main(String[] args) throws IOException {\t\n\t\tPrintWriter out;\n\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(new OutputStreamWriter(System.out));\n\t\tint n=readInt();\n\tint[] a = new int[n];\n\tfor (int i=0;i<n;i++) a[i]=readInt();\n\tint t=readInt();\n\tint temp;\n\tfor (int i=0;i<t;i++) {temp=readInt();a[temp-1]=-Math.abs(a[temp-1]);}\n\tif ((n%2)!=0) {out.println(\"NO\");out.flush();}\n\telse\n\t {\n\t\tint kol=0;int[] st=new int[n+1];\n\t\t for (int i=n-1;i>=0;i--)\n\t\t {\n\t\t\t if (kol==0) {kol=1;st[kol]=Math.abs(a[i]);a[i]=-st[kol];} else\n\t\t\t {\n\t\t\t\t if (st[kol]==a[i]) kol-=1; else\n\t\t\t\t {kol+=1;st[kol]=Math.abs(a[i]);a[i]=-st[kol];}\n\t\t\t }\n\t\t }\n\t\t if (kol!=0) {out.println(\"NO\");out.flush();} else\n\t\t {\n\t\t\t out.println(\"YES\");\n\t\t\t for (int i=0;i<n;i++) {out.print(a[i]);out.print(' ');}\n\t\t\t out.flush();\n\t\t } \n\t}\n}\n}\n", "lang_cluster": "Java", "tags": ["greedy", "data structures"], "code_uid": "254842249fba7c100c255611198b9482", "src_uid": "be82b8f209217875221ebe5de8675971", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Stack;\nimport java.util.StringTokenizer;\n\n\npublic class Abood2D {\n\n\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tScanner sc = new Scanner(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\n\t\tint n = sc.nextInt();\n\n\t\tint[] P = new int[n];\n\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tP[i] = sc.nextInt();\n\n\t\tboolean[] Q = new boolean[n];\n\t\tboolean[] Ans = new boolean[n];\n\t\tboolean[] V = new boolean[n];\n\n\t\tint q = sc.nextInt();\n\n\t\tfor (int i = 0; i < q; i++) {\n\t\t\tint x = sc.nextInt() - 1;\n\t\t\tAns[x] = Q[x] = true;\n\t\t}\n\n\t\tint[] next = new int[n + 1];\n\n\t\tfor (int i = 0; i <= n; i++)\n\t\t\tnext[i] = i;\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif(Q[i]) {\n\t\t\t\tV[i] = true;\n\t\t\t\tStack<Integer> s = new Stack<>();\n\t\t\t\tboolean f = false;\n\t\t\t\tfor (int j = (i > 0 ? next[i - 1] : -1); j >= 0; j = (j > 0 ? next[j - 1] : -1)) {\n\t\t\t\t\tV[j] = true;\n\t\t\t\t\tif(P[j] == P[i] && s.isEmpty()) {\n\t\t\t\t\t\tf = true;\n\t\t\t\t\t\tnext[i] = j > 0 ? next[j - 1] : -1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tif(!s.isEmpty() && P[s.peek()] == P[j]) \n\t\t\t\t\t\t\tAns[s.pop()] = true;\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\ts.push(j);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif(!f) {\n\t\t\t\t\tSystem.out.println(\"NO\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\n\t\tStack<Integer> s = new Stack<>();\n\t\t\n\t\tfor (int i = next[n - 1]; i >= 0; i--) {\n\t\t\tif(V[i])\n\t\t\t\tcontinue;\n\t\t\tif(!s.isEmpty() && P[s.peek()] == P[i]) \n\t\t\t\tAns[s.pop()] = true;\n\t\t\telse\n\t\t\t\ts.push(i);\n\t\t}\n\n\t\tif(s.isEmpty()) {\n\t\t\tout.println(\"YES\");\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tout.print((Ans[i] ? -P[i] : P[i]) + \" \");\n\t\t\tout.println();\n\t\t}else \n\t\t\tout.print(\"NO\");\n\n\t\tout.flush();\n\n\t}\n\n\n\n\tstatic class Scanner \n\n\n\n\t{\n\t\tStringTokenizer st;\n\t\tBufferedReader br;\n\n\t\tpublic Scanner(InputStream s){\tbr = new BufferedReader(new InputStreamReader(s));}\n\n\t\tpublic String next() throws IOException \n\t\t{\n\t\t\twhile (st == null || !st.hasMoreTokens()) \n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {return Integer.parseInt(next());}\n\n\t\tpublic long nextLong() throws IOException {return Long.parseLong(next());}\n\n\t\tpublic String nextLine() throws IOException {return br.readLine();}\n\n\n\t\tpublic double nextDouble() throws IOException\n\t\t{\n\t\t\tString x = next();\n\t\t\tStringBuilder sb = new StringBuilder(\"0\");\n\t\t\tdouble res = 0, f = 1;\n\t\t\tboolean dec = false, neg = false;\n\t\t\tint start = 0;\n\t\t\tif(x.charAt(0) == '-')\n\t\t\t{\n\t\t\t\tneg = true;\n\t\t\t\tstart++;\n\t\t\t}\n\t\t\tfor(int i = start; i < x.length(); i++)\n\t\t\t\tif(x.charAt(i) == '.')\n\t\t\t\t{\n\t\t\t\t\tres = Long.parseLong(sb.toString());\n\t\t\t\t\tsb = new StringBuilder(\"0\");\n\t\t\t\t\tdec = true;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tsb.append(x.charAt(i));\n\t\t\t\t\tif(dec)\n\t\t\t\t\t\tf *= 10;\n\t\t\t\t}\n\t\t\tres += Long.parseLong(sb.toString()) / f;\n\t\t\treturn res * (neg?-1:1);\n\t\t}\n\n\t\tpublic boolean ready() throws IOException {return br.ready();}\n\n\n\n\t}\n\n\n}", "lang_cluster": "Java", "tags": ["greedy", "data structures"], "code_uid": "01ec4577cbe1af76abc49efb12bda013", "src_uid": "be82b8f209217875221ebe5de8675971", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskE solver = new TaskE();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskE {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.nextInt();\n if (n % 2 != 0) {\n out.print(\"NO\");\n return;\n }\n int[] p = new int[n];\n for (int i = 0; i < n; i++) {\n p[i] = in.nextInt();\n }\n int t = in.nextInt();\n for (int i = 0; i < t; i++) {\n int k = in.nextInt();\n p[k - 1] *= -1;\n }\n\n int[] s = new int[n];\n int h = -1;\n\n for (int i = n - 1; i >= 0; i--) {\n if (p[i] < 0 || h < 0 || s[h] != p[i]) {\n if (p[i] > 0)\n p[i] *= -1;\n h++;\n s[h] = -p[i];\n } else {\n h--;\n }\n }\n\n if (h >= 0) {\n out.print(\"NO\");\n return;\n }\n\n out.println(\"YES\");\n for (int i = 0; i < n; i++) {\n out.print(p[i]);\n out.print(' ');\n }\n\n }\n}\n\nclass InputReader {\n private BufferedReader reader;\n private String[] line;\n private int index;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream));\n }\n\n public String next() {\n while (line == null) {\n try {\n line = reader.readLine().split(\"\\\\s\");\n if (line.length == 0)\n line = null;\n index = 0;\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n String res = line[index];\n index++;\n if (index == line.length)\n line = null;\n return res;\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n}\n", "lang_cluster": "Java", "tags": ["greedy", "data structures"], "code_uid": "5cbfa01ed3c8ac995fcf0da00565514a", "src_uid": "be82b8f209217875221ebe5de8675971", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.math.*;\nimport java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputReader in = new InputReader(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\n\t\tTask solver = new Task();\n\t\tsolver.solve(in, out);\n\n\t\tout.close();\n\t}\n}\n\nclass InputReader {\n\tBufferedReader buff;\n\tStringTokenizer tokenizer;\n\n\tInputReader(InputStream stream) {\n\t\tbuff = new BufferedReader(new InputStreamReader(stream));\n\t\ttokenizer = null;\n\t}\n\n\tString next() {\n\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens())\n\t\t\ttry {\n\t\t\t\ttokenizer = new StringTokenizer(buff.readLine());\n\t\t\t}\n\t\t\tcatch (IOException e) {\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\treturn tokenizer.nextToken();\n\t}\n\tint nextInt() { return Integer.parseInt(next()); }\n\tlong nextLong() { return Long.parseLong(next()); }\n}\n\nclass Task {\n\tfinal static int MAXL = 19;\n\tfinal static int[] prim = {2, 3, 5, 7};\n\tfinal static int[] pow = {12, 4, 2, 1};\n\tfinal static int MAXN = 48;\n\tfinal static int MAXM = 252;\n\tfinal static int LCM = 2520;\n\tlong[][][] dp;\n\n\tint encode(int[] x) {\n\t\tint ret = 0;\n\t\tfor (int i = 0; i < pow.length; ++i)\n\t\t\tret += x[i] * pow[i];\n\t\treturn ret;\n\t}\n\n\tint[] decode(int x) {\n\t\tint[] ret = new int[4];\n\t\tfor (int i = 0; i < pow.length; ++i) {\n\t\t\tret[i] = x / pow[i];\n\t\t\tx %= pow[i];\n\t\t}\n\t\treturn ret;\n\t}\n\n\tint merge(int mask, int x) {\n\t\tif (x == 0)\n\t\t\treturn mask;\n\t\tint[] ret = decode(mask);\n\t\tfor (int i = 0; i < prim.length; ++i) {\n\t\t\tint cnt = 0;\n\t\t\twhile (x % prim[i] == 0) {\n\t\t\t\tx /= prim[i];\n\t\t\t\t++cnt;\n\t\t\t}\n\t\t\tret[i] = Math.max(ret[i], cnt);\n\t\t}\n\t\treturn encode(ret);\n\t}\n\n\tlong divTest(int x, int mask) {\n\t\tint[] ret = decode(mask);\n\t\tfor (int i = 0; i < prim.length; ++i) {\n\t\t\tint now = 1;\n\t\t\tfor (int j = 0; j < ret[i]; ++j)\n\t\t\t\tnow *= prim[i];\n\t\t\tif (x % now != 0)\n\t\t\t\treturn 0L;\n\t\t}\n\t\treturn 1L;\n\t}\n\n\tlong go(long l, long r) {\n\t\tint[] a = new int[MAXL], b = new int[MAXL];\n\t\tint pos = -1;\n\t\tfor (int i = 0; i < MAXL; ++i) {\n\t\t\ta[i] = (int)(l % 10);\n\t\t\tb[i] = (int)(r % 10);\n\t\t\tif (a[i] != b[i])\n\t\t\t\tpos = i;\n\t\t\tl /= 10; r /= 10;\n\t\t}\n\n\t\tlong ret = 0;\n\t\tint[] rem = new int[MAXL], mask = new int[MAXL];\n\t\tfor (int i = MAXL - 2; i >= 0; --i) {\n\t\t\trem[i] = (rem[i + 1] + a[i + 1]) * 10 % LCM;\n\t\t\tmask[i] = merge(mask[i + 1], a[i + 1]);\n\t\t}\n\n\t\tfor (int i = 0; i <= pos; ++i)\n\t\t\tfor (int j = a[i] + 1; j < (i == pos ? b[i] : 10); ++j)\n\t\t\t\tif (i == 0)\n\t\t\t\t\tret += divTest(rem[i] + j, merge(mask[i], j));\n\t\t\t\telse\n\t\t\t\t\tret += dp[i][merge(mask[i], j)][(rem[i] + j) * 10 % LCM / 10];\n\n\t\trem = new int[MAXL]; mask = new int[MAXL];\n\t\tfor (int i = MAXL - 2; i >= 0; --i) {\n\t\t\trem[i] = (rem[i + 1] + b[i + 1]) * 10 % LCM;\n\t\t\tmask[i] = merge(mask[i + 1], b[i + 1]);\n\t\t}\n\t\tfor (int i = pos - 1; i >= 0; --i)\n\t\t\tfor (int j = 0; j < b[i]; ++j)\n\t\t\t\tif (i == 0)\n\t\t\t\t\tret += divTest(rem[i] + j, merge(mask[i], j));\n\t\t\t\telse\n\t\t\t\t\tret += dp[i][merge(mask[i], j)][(rem[i] + j) * 10 % LCM / 10];\n\n\t\treturn ret;\n\t}\n\n\tvoid solve(InputReader in, PrintWriter out) {\n\t\tdp = new long[MAXL][MAXN][MAXM];\n\t\tfor (int i = 0; i < MAXN; ++i)\n\t\t\tfor (int j = 0; j < MAXM; ++j)\n\t\t\t\tfor (int c = 0; c < 10; ++c)\n\t\t\t\t\tdp[1][i][j] += divTest(j * 10 + c, merge(i, c));\n\n\t\t//out.println(Arrays.toString(decode(4)));\n\t\t//out.println(dp[1][4][3]);\n\t\tfor (int i = 2; i < MAXL; ++i)\n\t\t\tfor (int j = 0; j < MAXN; ++j)\n\t\t\t\tfor (int k = 0; k < MAXM; ++k)\n\t\t\t\t\tfor (int c = 0; c < 10; ++c)\n\t\t\t\t\t\tdp[i][j][k] += dp[i - 1][merge(j, c)][(k * 10 + c) * 10 % LCM / 10];\n\n\t\tfor (int q = in.nextInt(); q-- > 0; ) {\n\t\t\tlong l = in.nextLong(), r = in.nextLong();\n\t\t\tout.println(go(l - 1, r + 1));\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dp", "number theory"], "code_uid": "eef9d3ff03b1ecb250ade02cb22ed630", "src_uid": "37feadce373f728ba2a560b198ca4bc9", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// practice with rainboy\nimport java.io.*;\nimport java.util.*;\n\npublic class CF553B extends PrintWriter {\n\tCF553B() { super(System.out, true); }\n\tScanner sc = new Scanner(System.in);\n\tpublic static void main(String[] $) {\n\t\tCF553B o = new CF553B(); o.main(); o.flush();\n\t}\n\n\tvoid main() {\n\t\tint n = sc.nextInt();\n\t\tlong k = sc.nextLong();\n\t\tlong[] ff = new long[n + 1];\n\t\tff[0] = ff[1] = 1;\n\t\tfor (int i = 2; i <= n; i++)\n\t\t\tff[i] = ff[i - 2] + ff[i - 1];\n\t\tint a = 0;\n\t\twhile (n > 0)\n\t\t\tif (k <= ff[n - 1]) {\n\t\t\t\tprint((a + 1) + \" \");\n\t\t\t\ta++;\n\t\t\t\tn--;\n\t\t\t} else {\n\t\t\t\tk -= ff[n - 1];\n\t\t\t\tprint((a + 2) + \" \" + (a + 1) + \" \");\n\t\t\t\ta += 2;\n\t\t\t\tn -= 2;\n\t\t\t}\n\t\tprintln();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["constructive algorithms", "math", "combinatorics", "binary search", "greedy", "implementation"], "code_uid": "44794d97992cc66f9501b8af0f7cd19d", "src_uid": "e03c6d3bb8cf9119530668765691a346", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class A {\n\n long mod = (long) 1e9 + 7;\n\n class Num {\n final long a, b;\n\n public Num(long a, long b) {\n this.a = a % mod;\n this.b = b % mod;\n }\n\n public Num add(Num other) {\n return new Num(a + other.a, b + other.b);\n }\n\n public Num multiply(Num other) {\n return new Num(a * other.a + 5 * b * other.b, a * other.b + b * other.a);\n }\n }\n\n int k;\n\n long[][] coeffs;\n\n void prepare() {\n coeffs = new long[k + 1][k + 1];\n long[][] tmpCoeffs = new long[k + 1][k + 1];\n long factK = 1;\n coeffs[0][0] = 1;\n\n for (int free = 0; free < k; free++) {\n factK = factK * (free + 1) % mod;\n\n for (int i = 0; i <= k; i++) {\n for (int j = 0; j <= k; j++) {\n if (coeffs[i][j] != 0) {\n tmpCoeffs[i + 1][j] += coeffs[i][j];\n if (tmpCoeffs[i + 1][j] >= mod) {\n tmpCoeffs[i + 1][j] -= mod;\n }\n\n tmpCoeffs[i][j + 1] += coeffs[i][j];\n if (tmpCoeffs[i][j + 1] >= mod) {\n tmpCoeffs[i][j + 1] -= mod;\n }\n\n long add = coeffs[i][j] * (mod - free) % mod;\n tmpCoeffs[i][j] += add;\n if (tmpCoeffs[i][j] >= mod) {\n tmpCoeffs[i][j] -= mod;\n }\n }\n }\n }\n\n for (int i = 0; i <= k; i++) {\n for (int j = 0; j <= k; j++) {\n coeffs[i][j] = tmpCoeffs[i][j];\n tmpCoeffs[i][j] = 0;\n }\n }\n }\n\n factK = inv(factK);\n for (int i = 0; i <= k; i++) {\n for (int j = 0; j <= k; j++) {\n coeffs[i][j] = coeffs[i][j] * factK % mod;\n }\n }\n// System.err.println(Arrays.deepToString(coeffs));\n\n pow1 = new Num[k + 1];\n powA = new Num[k + 1];\n pow2 = new Num[k + 1];\n powB = new Num[k + 1];\n\n pow1[0] = pow2[0] = powA[0] = powB[0] = new Num(1, 0);\n for (int i = 1; i <= k; i++) {\n pow1[i] = pow1[i - 1].multiply(PHI1);\n pow2[i] = pow2[i - 1].multiply(PHI2);\n powA[i] = powA[i - 1].multiply(A);\n powB[i] = powB[i - 1].multiply(B);\n }\n }\n\n long inv(long x) {\n return pow(x, mod - 2);\n }\n\n long pow(long a, long b) {\n long res = 1;\n while (b != 0) {\n if ((b & 1) == 1) {\n res = res * a % mod;\n }\n a = a * a % mod;\n b >>>= 1;\n }\n return res;\n }\n\n final Num PHI1 = new Num(inv(2), inv(2));\n final Num PHI2 = new Num(inv(2), mod - inv(2));\n final Num A = new Num(0, inv(5));\n final Num B = new Num(0, mod - inv(5));\n\n final Num ONE = new Num(1, 0);\n\n Num[] pow1, pow2, powA, powB;\n\n long get(long n) {\n Num result = new Num(0, 0);\n\n for (int i = 0; i <= k; i++) {\n for (int j = 0; j <= k; j++) {\n long coef = coeffs[i][j];\n if (coef == 0) {\n continue;\n }\n\n Num cur = new Num(coef, 0).multiply(powA[i]).multiply(powB[j]);\n\n Num x = pow1[i].multiply(pow2[j]);\n x = geomSum(x, n + 1);\n\n result = result.add(cur.multiply(x));\n }\n }\n return result.a;\n }\n\n\n Num geomSum(Num x, long n) {\n if (n == 0) {\n return new Num(0, 0);\n }\n if (n % 2 == 0) {\n Num x2 = x.multiply(x);\n Num result = geomSum(x2, n / 2);\n return (ONE.add(x)).multiply(result);\n } else {\n return ONE.add(x.multiply(geomSum(x, n - 1)));\n }\n }\n\n public void solve() {\n k = in.nextInt();\n prepare();\n long l = in.nextLong(), r = in.nextLong();\n// for (int i = 0; i < 20; i++) {\n// Num fib = A.multiply(pow1[i]).add(B.multiply(pow2[i]));\n// System.err.println(fib.a + \" \" + fib.b);\n// System.err.println(get(i + 1) - get(i));\n// }\n out.println((get(r + 2) - get(l + 1) + mod) % mod);\n }\n\n public void run() {\n in = new FastScanner();\n out = new PrintWriter(System.out);\n solve();\n out.close();\n }\n\n FastScanner in;\n PrintWriter out;\n\n class FastScanner {\n BufferedReader br;\n StringTokenizer st;\n\n public FastScanner(String fileName) {\n try {\n br = new BufferedReader(new FileReader(fileName));\n } catch (FileNotFoundException e) {\n }\n }\n\n public FastScanner() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n String nextToken() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(nextToken());\n }\n\n long nextLong() {\n return Long.parseLong(nextToken());\n }\n\n double nextDouble() {\n return Double.parseDouble(nextToken());\n }\n }\n\n public static void main(String[] args) {\n new A().run();\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "da847148c66ef196ff234c805dddc29c", "src_uid": "dee552588e1281c2523868cd4090b46f", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\n\nimport java.io.*;\nimport java.nio.charset.Charset;\nimport java.util.*;\n\npublic class CFCR493B {\n public static void main(String[] args) throws Exception {\n boolean local = System.getProperty(\"ONLINE_JUDGE\") == null;\n boolean async = false;\n\n Charset charset = Charset.forName(\"ascii\");\n\n FastIO io = local ? new FastIO(new FileInputStream(\"E:\\\\DATABASE\\\\TESTCASE\\\\CFCR493B.in\"), new FileOutputStream(\"E:\\\\DATABASE\\\\TESTCASE\\\\CFCR493B.out\"), charset) : new FastIO(System.in, System.out, charset);\n Task task = new Task(io);\n\n if (async) {\n Thread t = new Thread(null, task, \"dalt\", 1 << 27);\n t.setPriority(Thread.MAX_PRIORITY);\n t.start();\n t.join();\n } else {\n task.run();\n }\n\n io.flush();\n }\n\n public static class Task implements Runnable {\n final FastIO io;\n\n public Task(FastIO io) {\n this.io = io;\n }\n\n @Override\n public void run() {\n solve();\n }\n\n public void solve() {\n int n = io.readInt();\n\n long total = 0;\n\n for (int i = 0; i < 9; i++) {\n for (int j = 0; j < 9; j++) {\n if (i >= 5 && j >= 1 || i + j > n) {\n continue;\n }\n total += (n - i - j + 1);\n }\n }\n\n io.cache.append(total);\n }\n\n }\n\n public static class FastIO {\n private final InputStream is;\n private final OutputStream os;\n private final Charset charset;\n private StringBuilder defaultStringBuf = new StringBuilder(1 << 8);\n public final StringBuilder cache = new StringBuilder();\n\n private byte[] buf = new byte[1 << 13];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastIO(InputStream is, OutputStream os, Charset charset) {\n this.is = is;\n this.os = os;\n this.charset = charset;\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public int readInt() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n public long readLong() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n long val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n public double readDouble() {\n long num = readLong();\n if (next != '.') {\n return num;\n }\n\n next = read();\n long divisor = 1;\n long later = 0;\n while (next >= '0' && next <= '9') {\n divisor = divisor * 10;\n later = later * 10 + next - '0';\n next = read();\n }\n\n if (num >= 0) {\n return num + (later / (double) divisor);\n } else {\n return num - (later / (double) divisor);\n }\n }\n\n public String readString(StringBuilder builder) {\n skipBlank();\n\n while (next > 32) {\n builder.append((char) next);\n next = read();\n }\n\n return builder.toString();\n }\n\n public String readString() {\n defaultStringBuf.setLength(0);\n return readString(defaultStringBuf);\n }\n\n public int readString(char[] data, int offset) {\n skipBlank();\n\n int originalOffset = offset;\n while (next > 32) {\n data[offset++] = (char) next;\n next = read();\n }\n\n return offset - originalOffset;\n }\n\n public int readString(byte[] data, int offset) {\n skipBlank();\n\n int originalOffset = offset;\n while (next > 32) {\n data[offset++] = (byte) next;\n next = read();\n }\n\n return offset - originalOffset;\n }\n\n public void flush() {\n try {\n os.write(cache.toString().getBytes(charset));\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n\n public boolean hasMore() {\n skipBlank();\n return next != -1;\n }\n }\n\n public static class Memory {\n public static <T> void swap(T[] data, int i, int j) {\n T tmp = data[i];\n data[i] = data[j];\n data[j] = tmp;\n }\n\n public static <T> int min(T[] data, int from, int to, Comparator<T> cmp) {\n int m = from;\n for (int i = from + 1; i < to; i++) {\n if (cmp.compare(data[m], data[i]) > 0) {\n m = i;\n }\n }\n return m;\n }\n\n public static <T> void move(T[] data, int from, int to, int step) {\n int len = to - from;\n step = len - (step % len + len) % len;\n Object[] buf = new Object[len];\n for (int i = 0; i < len; i++) {\n buf[i] = data[(i + step) % len + from];\n }\n System.arraycopy(buf, 0, data, from, len);\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "combinatorics", "greedy"], "code_uid": "1d23ebb9f85b90ea255f4e73d1907023", "src_uid": "75ec99318736a8a1b62a8d51efd95355", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.BufferedWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\nimport java.util.ArrayDeque;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.Comparator;\nimport java.util.Map.Entry;\nimport java.util.StringTokenizer;\nimport java.util.TreeMap;\n\npublic class Techno19_2F {\n\n\tstatic int MODE = -1;\n\n\tstatic final Comparator<int[]> COMP_ARR = new Comparator<int[]>() {\n\t\tpublic int compare(int[] a1, int[] a2) {\n\t\t\tif (MODE != -1 && (a1.length == 32 || a2.length == 32)) {\n\t\t\t\tif (a1.length == 32) {\n\t\t\t\t\tif (MODE < a2.length) {\n\t\t\t\t\t\treturn -1;\n\t\t\t\t\t}\n\t\t\t\t\tif (MODE > a2.length) {\n\t\t\t\t\t\treturn 1;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tif (a1.length < MODE) {\n\t\t\t\t\t\treturn -1;\n\t\t\t\t\t}\n\t\t\t\t\tif (a1.length > MODE) {\n\t\t\t\t\t\treturn 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tfor (int i = 0; i < MODE; i++) {\n\t\t\t\t\tif (a1[i] < a2[i]) {\n\t\t\t\t\t\treturn -1;\n\t\t\t\t\t}\n\t\t\t\t\tif (a1[i] > a2[i]) {\n\t\t\t\t\t\treturn 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn 0;\n\t\t\t} else {\n\t\t\t\tif (a1.length < a2.length) {\n\t\t\t\t\treturn -1;\n\t\t\t\t}\n\t\t\t\tif (a1.length > a2.length) {\n\t\t\t\t\treturn 1;\n\t\t\t\t}\n\n\t\t\t\tfor (int i = 0; i < a2.length; i++) {\n\t\t\t\t\tif (a1[i] < a2[i]) {\n\t\t\t\t\t\treturn -1;\n\t\t\t\t\t}\n\t\t\t\t\tif (a1[i] > a2[i]) {\n\t\t\t\t\t\treturn 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\t};\n\n\tstatic TreeMap<int[], Integer> index = new TreeMap<>(COMP_ARR);\n\tstatic int[][] states;\n\n\tstatic ArrayList<int[]> start = new ArrayList<>();\n\n\tstatic int[] numD;\n\n\tstatic int[] pFact = new int[1_000_001];\n\n\tstatic TreeMap<int[], Integer> divCostInd = new TreeMap<>(COMP_ARR);\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tcGen = new int[23];\n\t\tnumD = new int[6000];\n\t\tstates = new int[6000][];\n\t\tgenAll(0, 23, 23, 1);\n\n\t\taList = new ArrayList[6000];\n\t\tfor (int i = 0; i < 6000; i++) {\n\t\t\taList[i] = new ArrayList<>();\n\t\t}\n\t\tfAList();\n\n\t\tdivCost = new int[400][301];\n\t\tfor (int[] a : divCost) {\n\t\t\tArrays.fill(a, Integer.MAX_VALUE / 2);\n\t\t}\n\t\tcost = new int[index.size()];\n\n\t\tArrays.fill(pFact, 1);\n\t\tfor (int i = 2; i <= 1_000_000; i++) {\n\t\t\tif (pFact[i] == 1) {\n\t\t\t\tfor (int m = i; m <= 1_000_000; m += i) {\n\t\t\t\t\tpFact[m] = i;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tBufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n\t\tPrintWriter printer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n\n\t\tint nT = Integer.parseInt(reader.readLine());\n\n\t\twhile (nT-- > 0) {\n\t\t\tStringTokenizer inputData = new StringTokenizer(reader.readLine());\n\t\t\tint a = Integer.parseInt(inputData.nextToken());\n\t\t\tint b = Integer.parseInt(inputData.nextToken());\n\n\t\t\tint[] aA = toArray(a);\n\t\t\tint[] bA = toArray(b);\n\n\t\t\tInteger aRes = divCostInd.get(aA);\n\t\t\tif (aRes == null) {\n\t\t\t\taRes = divCostInd.size();\n\t\t\t\tbfs(aA, divCostInd.size());\n\t\t\t\tdivCostInd.put(aA, divCostInd.size());\n\t\t\t}\n\t\t\tInteger bRes = divCostInd.get(bA);\n\t\t\tif (bRes == null) {\n\t\t\t\tbRes = divCostInd.size();\n\t\t\t\tbfs(bA, divCostInd.size());\n\t\t\t\tdivCostInd.put(bA, divCostInd.size());\n\t\t\t}\n\n\t\t\tint minA = Integer.MAX_VALUE / 4;\n\t\t\tfor (int nD = 1; nD <= 300; nD++) {\n\t\t\t\tminA = Math.min(minA, divCost[aRes][nD] + divCost[bRes][nD]);\n\t\t\t}\n\t\t\tprinter.println(minA);\n\t\t}\n\t\tprinter.close();\n\t}\n\n\tstatic int[] toArray(int a) {\n\t\tArrayList<Integer> cnts = new ArrayList<Integer>();\n\t\tint last = -1;\n\t\tint cCnt = 0;\n\n\t\twhile (a > 1) {\n\t\t\tint cPFact = pFact[a];\n\t\t\tif (cPFact == last) {\n\t\t\t\tcCnt++;\n\t\t\t} else {\n\t\t\t\tif (cCnt != 0) {\n\t\t\t\t\tcnts.add(cCnt);\n\t\t\t\t}\n\t\t\t\tlast = cPFact;\n\t\t\t\tcCnt = 1;\n\t\t\t}\n\t\t\ta /= pFact[a];\n\t\t}\n\t\tif (cCnt != 0) {\n\t\t\tcnts.add(cCnt);\n\t\t}\n\t\tCollections.sort(cnts, Comparator.reverseOrder());\n\t\tint[] res = new int[cnts.size()];\n\t\tfor (int i = 0; i < cnts.size(); i++) {\n\t\t\tres[i] = cnts.get(i);\n\t\t}\n\t\treturn res;\n\t}\n\n\tstatic int[] cost;\n\n\tstatic int[][] divCost;\n\n\tstatic void bfs(int[] sState, int searchI) {\n\t\tint sInd = index.get(sState);\n\t\tArrayDeque<Integer> queue = new ArrayDeque<>();\n\n\t\tqueue.add(index.get(sState));\n\n\t\tArrays.fill(cost, -1);\n\t\tcost[sInd] = 0;\n\n\t\twhile (!queue.isEmpty()) {\n\t\t\tint cStInd = queue.remove();\n\t\t\tfor (int nStInd : aList[cStInd]) {\n\t\t\t\tif (cost[nStInd] == -1) {\n\t\t\t\t\tcost[nStInd] = cost[cStInd] + 1;\n\t\t\t\t\tqueue.add(nStInd);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (Entry<int[], Integer> cE : index.entrySet()) {\n\t\t\tint cNumD = numD[cE.getValue()];\n\t\t\tif (cNumD <= 300) {\n\t\t\t\tdivCost[searchI][cNumD] = Math.min(divCost[searchI][cNumD], cost[cE.getValue()]);\n\t\t\t}\n\t\t}\n\t}\n\n\tstatic ArrayList<Integer>[] aList;\n\n\tstatic void fAList() {\n\t\tint[] cState = new int[32];\n\t\tfor (Entry<int[], Integer> cE : index.entrySet()) {\n\t\t\tint[] oState = cE.getKey();\n\t\t\tint cStInd = cE.getValue();\n\n\t\t\tint cLen = states[cStInd].length;\n\t\t\tfor (int i = 0; i < cLen; i++) {\n\t\t\t\tcState[i] = oState[i];\n\t\t\t}\n\t\t\tMODE = cLen;\n\n\t\t\tfor (int i = 0; i < cLen; i++) {\n\t\t\t\tif (i == 0 || cState[i - 1] > cState[i]) {\n\t\t\t\t\tcState[i]++;\n\t\t\t\t\tInteger nStInd = index.get(cState);\n\t\t\t\t\tcState[i]--;\n\n\t\t\t\t\tif (nStInd == null) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\taList[cStInd].add(nStInd);\n\t\t\t\t}\n\n\t\t\t\tif (i == cLen - 1 && cState[i] == 1) {\n\t\t\t\t\tMODE--;\n\t\t\t\t\tInteger nStInd = index.get(cState);\n\t\t\t\t\tMODE++;\n\t\t\t\t\tif (nStInd == null) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\taList[cStInd].add(nStInd);\n\t\t\t\t} else if (i == cLen - 1 || cState[i] > cState[i + 1]) {\n\t\t\t\t\tcState[i]--;\n\t\t\t\t\tInteger nStInd = index.get(cState);\n\t\t\t\t\tcState[i]++;\n\t\t\t\t\tif (nStInd == null) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\taList[cStInd].add(nStInd);\n\t\t\t\t}\n\t\t\t}\n\t\t\tcState[cLen] = 1;\n\n\t\t\tMODE++;\n\t\t\tInteger nStInd = index.get(cState);\n\t\t\tMODE--;\n\t\t\tif (nStInd == null) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\taList[cStInd].add(nStInd);\n\t\t}\n\t}\n\n\tstatic int[] cGen;\n\n\tstatic void genAll(int i, int max, int rem, int cProd) {\n\t\tnumD[index.size()] = cProd;\n\n\t\tint[] cKey = Arrays.copyOf(cGen, i);\n\t\tstates[index.size()] = cKey;\n\t\tindex.put(cKey, index.size());\n\n\t\tif (rem > 0) {\n\t\t\tfor (int nV = Math.min(max, rem); nV >= 1; nV--) {\n\t\t\t\tcGen[i] = nV;\n\t\t\t\tgenAll(i + 1, nV, rem - nV, cProd * (nV + 1));\n\t\t\t}\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "math", "graphs"], "code_uid": "bf0538dac388bee60391012805186ca1", "src_uid": "6115ee1ccf651b1dd8145bf755ea7ea9", "difficulty": 2800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author sheep\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskE solver = new TaskE();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskE {\n private static final int MOD = 1000000007;\n private static final long[][] choose;\n static {\n choose = new long[55][55];\n for (int i = 0; i <= 51; ++i) {\n choose[i][0] = choose[i][i] = 1;\n for (int j = 1; j < i; ++j) {\n choose[i][j] = (choose[i - 1][j] + choose[i - 1][j - 1]) % MOD;\n }\n }\n }\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.nextInt(), k = in.nextInt();\n\n if (k > n) {\n out.println(0);\n return;\n }\n\n int[][][] dp = new int[n + 1][2][n + 1];\n dp[1][0][0] = 1;\n dp[0][1][0] = 1;\n for (int i = 2; i <= n; ++i) {\n for (int j = 0; j < 2; ++j) {\n for (int match = 0; match <= i; ++match) {\n for (int left = 0; left < 2; ++left) {\n for (int right = 0; right < 2; ++right) {\n if ((left == 0 || right == 0) && j == 0) continue;\n if (left == 1 && right == 1 && j == 1) continue;\n int rem = match - j;\n if (rem < 0) continue;\n for (int leftSize = 0; leftSize < i; ++leftSize) {\n for (int leftMatch = 0; leftMatch <= leftSize && leftMatch <= rem; ++leftMatch) {\n int rightSize = i - 1 - leftSize;\n int rightMatch = rem - leftMatch;\n if (rightMatch > rightSize) continue;\n if (leftSize < rightSize || leftSize == rightSize && leftMatch < rightMatch) {\n dp[i][j][match] = (int) ((dp[i][j][match] + dp[leftSize][left][leftMatch]\n * (long) dp[rightSize][right][rightMatch] % MOD * (i == n ? 1 : i) % MOD * choose[i - 1][leftSize] % MOD) % MOD);\n } else if (leftSize == rightSize && leftMatch == rightMatch) {\n dp[i][j][match] = (int) ((dp[i][j][match] + dp[leftSize][left][leftMatch]\n * (long) (dp[rightSize][right][rightMatch] - 1) % MOD * NumberUtils.powMod(2, MOD - 2, MOD) % MOD * (i == n ? 1 : i) % MOD * choose[i - 1][leftSize] % MOD) % MOD);\n dp[i][j][match] = (int) ((dp[i][j][match] + dp[leftSize][left][leftMatch] * (long) (i == n ? 1 : i) % MOD * choose[i - 1][leftSize] % MOD * NumberUtils.powMod(2, MOD - 2, MOD) % MOD) % MOD);\n }\n// if (i == 3 && j == 1 && match == 1) {\n// out.println(\"left = \" + left + \" right = \" + right + \" ls = \" + leftSize + \" lm = \" + leftMatch + \" rs = \" + rightSize + \" rm = \" + rightMatch + \" i = \" + i + \" j = \" + j + \" match = \" + match + \" res = \" + dp[i][j][match]);\n// }\n }\n }\n }\n }\n// out.println(\"i = \" + i + \" j = \" + j + \" match = \" + match + \" res = \" + dp[i][j][match]);\n }\n }\n }\n\n out.println((((dp[n][0][k] + dp[n][1][k]) % MOD) + MOD) % MOD);\n }\n}\n\nclass InputReader {\n BufferedReader reader;\n StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream));\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (Exception e) {\n throw new UnknownError();\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n\nclass NumberUtils {\n\n public static long powMod(long x, long y, long mod) {\n long res = 1;\n for (; y != 0; y >>= 1L) {\n if (y % 2 == 1) res = res * x % mod;\n x = x * x % mod;\n }\n return res;\n }\n\n }\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics"], "code_uid": "f23da0b385321025f938f9c86b0ac7f5", "src_uid": "f98b740183281943eafd90328854746b", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class Main {\n\n\tBufferedReader in;\n\tStringTokenizer str = null;\n\tPrintWriter out;\n\t\n\tprivate String next() throws Exception{\n\t\twhile (str == null || !str.hasMoreElements())\n\t\t\tstr = new StringTokenizer(in.readLine());\n\t\treturn str.nextToken();\n\t}\n\t\n\tprivate int nextInt() throws Exception{\n\t\treturn Integer.parseInt(next());\n\t}\n\t\n\tprivate long nextLong() throws Exception{\n\t\treturn Long.parseLong(next());\n\t}\n\t\n\tprivate double nextDouble() throws Exception{\n\t\treturn Double.parseDouble(next());\n\t}\n\t\n\tfinal long MOD = (long)(1e9) + 7;\n\tlong []f;\n\n\tfinal int MAXN = 200010;\n\n\tpublic void run() throws Exception{\n\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\tint n = nextInt(), m = nextInt(), g = nextInt();\n\t\tif (n == 0) {\n\t\t\tif (m > 1) {\n\t\t\t\tif (g == 0) {\n\t\t\t\t\tout.println(1);\n\t\t\t\t}else {\n\t\t\t\t\tout.println(0);\n\t\t\t\t}\n\t\t\t}else {\n\t\t\t\tif (g == 1) {\n\t\t\t\t\tout.println(1);\n\t\t\t\t}else {\n\t\t\t\t\tout.println(0);\n\t\t\t\t}\n\t\t\t}\n\t\t\tout.close();\n\t\t\treturn;\n\t\t}\n\t\tif (m == 0) {\n\t\t\tif (n % 2 == 0) {\n\t\t\t\tout.println(g);\n\t\t\t}else {\n\t\t\t\tout.println(g ^ 1);\n\t\t\t}\n\t\t\tout.close();\n\t\t\treturn;\n\t\t}\n\t\tf = new long[MAXN];\n\t\tf[0] = 1;\n\t\tfor(int i = 1; i < MAXN; ++i) f[i] = (f[i-1] * i) % MOD;\n\t\tlong ret = 0;\n\t\tfor(int i = 0; i <= n; ++i) {\n\t\t\tif (i % 2 == 0) {\n\t\t\t\tif (m - 1 > 0 || n - i > 0) {\n\t\t\t\t\tif (g == 0) ret += C(m - 1, n - i + m - 1);\n\t\t\t\t}else {\n\t\t\t\t\tif (g == 1) ret += 1;\n\t\t\t\t}\n\t\t\t}else {\n\t\t\t\tif (m - 1 > 0 || n - i > 0) {\n\t\t\t\t\tif (g == 1) ret += C(m - 1, n - i + m - 1);\n\t\t\t\t}else {\n\t\t\t\t\tif (g == 0) ret += 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (ret >= MOD) ret -= MOD;\n\t\t}\n\t\tout.println(ret);\n\t\tout.close();\n\t}\n\n\tprivate long C(int m, int n){\n\t\tlong ret = f[n];\n\t\tret *= inv((f[m] * f[n - m]) % MOD, MOD);\n\t\treturn ret % MOD;\n\t}\n\n\tprivate long inv(long a, long b) {\n\t\treturn pow(a, b - 2);\n\t}\n\n\tprivate long pow(long x, long p) {\n\t\tlong ret = 1;\n\t\twhile(p > 0) {\n\t\t\tif (p % 2 == 1) ret = (ret * x) % MOD;\n\t\t\tx = (x * x) % MOD;\n\t\t\tp >>= 1;\n\t\t}\n\t\treturn ret;\n\t}\n\t\t\n\tpublic static void main(String[] args) throws Exception{\n\t\tnew Main().run();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "combinatorics", "number theory"], "code_uid": "736e4d8a6ef9484a22a38e0f6bbc4356", "src_uid": "066dd9e6091238edf2912a6af4d29e7f", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class C {\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\tboolean eof;\n\n\tvoid solve() throws IOException {\n\t\tint n = nextInt();\n\t\tint m = nextInt();\nif (n == 1) {\nout.println(1);\nreturn;}\n\t\tlong allPairs = (long) n * m * (n * m - 1);\n\t\tlong goodPairs = (long) n * m * (m - 1);\n\t\tdouble p2 = 1.0 * goodPairs / allPairs;\n\t\tout.println(1.0 / n + (n - 1.0) / n * p2);\n\t}\n\n\tC() throws IOException {\n\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.close();\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew C();\n\t}\n\n\tString nextToken() {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (Exception e) {\n\t\t\t\teof = true;\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tString nextString() {\n\t\ttry {\n\t\t\treturn br.readLine();\n\t\t} catch (IOException e) {\n\t\t\teof = true;\n\t\t\treturn null;\n\t\t}\n\t}\n\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n}", "lang_cluster": "Java", "tags": ["probabilities", "math", "combinatorics"], "code_uid": "4022642a9978962b5b0e35d6cfeefe72", "src_uid": "0b9ce20c36e53d4702869660cbb53317", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;import java.util.*;public class codeforces452C{public static void main(String[] args) throws IOException{StringTokenizer st=new StringTokenizer(new BufferedReader(new InputStreamReader(System.in)).readLine());double N=Double.parseDouble(st.nextToken()),M=Double.parseDouble(st.nextToken());System.out.printf(\"%.12f\\n\",(N==1&&M==1) ? 1.0 : ((1/N)+((M-1)*(N-1))/(N*(N*M-1))));}}", "lang_cluster": "Java", "tags": ["probabilities", "math", "combinatorics"], "code_uid": "2f16a09b33f72d70b25821413b24da7f", "src_uid": "0b9ce20c36e53d4702869660cbb53317", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.lang.*;\nimport static java.lang.Math.*;\nimport java.lang.reflect.*;\nimport java.math.BigInteger;\nimport static java.math.BigInteger.*;\nimport java.security.CodeSource;\nimport java.security.KeyStore;\nimport java.util.*;\nimport static java.util.Arrays.*;\nimport java.util.jar.JarEntry;\nimport java.util.jar.JarFile;\nimport java.util.logging.Level;\nimport java.util.logging.Logger;\n\n// https://netbeans.org/kb/73/java/editor-codereference_ru.html#display\npublic class Main {\n //<editor-fold defaultstate=\"collapsed\" desc=\"Your Fold Super Code\">\n\n private void run() {\n Locale.setDefault(Locale.US);\n boolean oj = true;\n try {\n oj = System.getProperty(\"MYLOCAL\") == null;\n } catch (Exception e) {\n }\n\n if (oj) {\n sc = new FastScanner(new InputStreamReader(System.in));\n out = new PrintWriter(new OutputStreamWriter(System.out));\n } else {\n try {\n sc = new FastScanner(new FileReader(\"input.txt\"));\n out = new PrintWriter(new FileWriter(\"output.txt\"));\n } catch (IOException e) {\n MLE();\n }\n }\n solve();\n //if( oj )\n err.println(\"Time: \" + (System.currentTimeMillis() - timeBegin) / 1e3);\n out.flush();\n }\n\n private void show(int[] arr) {\n for( int v : arr ) err.print( \" \" + v );\n err.println();\n }\n\n private boolean eq(String a, String b) {\n for( int i = 0; i < a.length(); ++i ){\n if( a.charAt(i) == '.' ) continue;\n if( b.charAt(i) == '.' ) continue;\n if( a.charAt(i) != b.charAt(i) )\n return false;\n }\n return true;\n }\n\n class FastScanner {\n\n BufferedReader br;\n StringTokenizer st;\n\n FastScanner(InputStreamReader reader) {\n br = new BufferedReader(reader);\n st = new StringTokenizer(\"\");\n }\n\n String next() {\n while (!st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException ex) {\n Main.MLE();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n }\n\n public static void MLE() {\n int[][] arr = new int[1024 * 1024][];\n for (int i = 0; i < arr.length; i++) {\n arr[i] = new int[1024 * 1024];\n }\n }\n\n public static void main(String[] args) {\n new Main().run();\n }\n\n long timeBegin = System.currentTimeMillis();\n FastScanner sc;\n PrintWriter out;\n PrintStream err = System.err;\n\n // </editor-fold>\n \n \n double[] logFact = new double[(int)5e6];\n {\n logFact[0] = log(1);\n for (int i = 1; i < logFact.length; i++) {\n logFact[i] = logFact[i-1] + log(i);\n }\n err.println(\"f:\" + exp(logFact[7]));\n }\n \n double logC( int m, int n ){\n return logFact[n] - logFact[m] - logFact[n-m];\n }\n \n void solve() {\n int n = sc.nextInt();\n int m = sc.nextInt();;\n double ans = 0;\n for( int cnt = 1; cnt <= min(n,m); ++cnt ){\n double cur = logC(cnt,m) + logC(n-cnt,n*m-m) - logC(n,n*m);\n if( -50 <= cur ){\n cur = exp(cur);\n cur = cur * cnt * cnt / n;\n ans += cur;\n }\n }\n out.printf( \"%.10f\\n\", ans);\n }\n\n}\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "combinatorics"], "code_uid": "ec4d6294780bab6f5167037ea29fcb31", "src_uid": "0b9ce20c36e53d4702869660cbb53317", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.lang.*;\nimport static java.lang.Math.*;\nimport java.lang.reflect.*;\nimport java.math.BigInteger;\nimport static java.math.BigInteger.*;\nimport java.security.CodeSource;\nimport java.security.KeyStore;\nimport java.util.*;\nimport static java.util.Arrays.*;\nimport java.util.jar.JarEntry;\nimport java.util.jar.JarFile;\nimport java.util.logging.Level;\nimport java.util.logging.Logger;\n\n// https://netbeans.org/kb/73/java/editor-codereference_ru.html#display\npublic class Main {\n //<editor-fold defaultstate=\"collapsed\" desc=\"Your Fold Super Code\">\n\n private void run() {\n Locale.setDefault(Locale.US);\n boolean oj = true;\n try {\n oj = System.getProperty(\"MYLOCAL\") == null;\n } catch (Exception e) {\n }\n\n if (oj) {\n sc = new FastScanner(new InputStreamReader(System.in));\n out = new PrintWriter(new OutputStreamWriter(System.out));\n } else {\n try {\n sc = new FastScanner(new FileReader(\"input.txt\"));\n out = new PrintWriter(new FileWriter(\"output.txt\"));\n } catch (IOException e) {\n MLE();\n }\n }\n solve();\n //if( oj )\n err.println(\"Time: \" + (System.currentTimeMillis() - timeBegin) / 1e3);\n out.flush();\n }\n\n private void show(int[] arr) {\n for( int v : arr ) err.print( \" \" + v );\n err.println();\n }\n\n private boolean eq(String a, String b) {\n for( int i = 0; i < a.length(); ++i ){\n if( a.charAt(i) == '.' ) continue;\n if( b.charAt(i) == '.' ) continue;\n if( a.charAt(i) != b.charAt(i) )\n return false;\n }\n return true;\n }\n\n class FastScanner {\n\n BufferedReader br;\n StringTokenizer st;\n\n FastScanner(InputStreamReader reader) {\n br = new BufferedReader(reader);\n st = new StringTokenizer(\"\");\n }\n\n String next() {\n while (!st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException ex) {\n Main.MLE();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n }\n\n public static void MLE() {\n int[][] arr = new int[1024 * 1024][];\n for (int i = 0; i < arr.length; i++) {\n arr[i] = new int[1024 * 1024];\n }\n }\n\n public static void main(String[] args) {\n new Main().run();\n }\n\n long timeBegin = System.currentTimeMillis();\n FastScanner sc;\n PrintWriter out;\n PrintStream err = System.err;\n\n // </editor-fold>\n \n \n static double[] logFact = new double[(int)1e6+1];\n static {\n logFact[0] = log(1);\n for (int i = 1; i < logFact.length; i++) {\n logFact[i] = logFact[i-1] + log(i);\n }\n System.err.println(\"f:\" + exp(logFact[7]));\n }\n \n double logC( int m, int n ){\n return logFact[n] - logFact[m] - logFact[n-m];\n }\n \n void solve() {\n int n = sc.nextInt();\n int m = sc.nextInt();;\n double ans = 0;\n for( int cnt = 1; cnt <= min(n,m); ++cnt ){\n double cur = logC(cnt,m) + logC(n-cnt,n*m-m) - logC(n,n*m);\n// if( -50 <= cur ){\n cur = exp(cur);\n cur = cur * cnt * cnt / n;\n ans += cur;\n\n// }\n }\n out.printf( \"%.10f\\n\", ans);\n }\n\n}", "lang_cluster": "Java", "tags": ["probabilities", "math", "combinatorics"], "code_uid": "228e47ba8747a75442fea979282e5d08", "src_uid": "0b9ce20c36e53d4702869660cbb53317", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.lang.*;\nimport static java.lang.Math.*;\nimport java.lang.reflect.*;\nimport java.math.BigInteger;\nimport static java.math.BigInteger.*;\nimport java.security.CodeSource;\nimport java.security.KeyStore;\nimport java.util.*;\nimport static java.util.Arrays.*;\nimport java.util.jar.JarEntry;\nimport java.util.jar.JarFile;\nimport java.util.logging.Level;\nimport java.util.logging.Logger;\n\n// https://netbeans.org/kb/73/java/editor-codereference_ru.html#display\npublic class Main {\n //<editor-fold defaultstate=\"collapsed\" desc=\"Your Fold Super Code\">\n\n private void run() {\n Locale.setDefault(Locale.US);\n boolean oj = true;\n try {\n oj = System.getProperty(\"MYLOCAL\") == null;\n } catch (Exception e) {\n }\n\n if (oj) {\n sc = new FastScanner(new InputStreamReader(System.in));\n out = new PrintWriter(new OutputStreamWriter(System.out));\n } else {\n try {\n sc = new FastScanner(new FileReader(\"input.txt\"));\n out = new PrintWriter(new FileWriter(\"output.txt\"));\n } catch (IOException e) {\n MLE();\n }\n }\n solve();\n //if( oj )\n err.println(\"Time: \" + (System.currentTimeMillis() - timeBegin) / 1e3);\n out.flush();\n }\n\n private void show(int[] arr) {\n for( int v : arr ) err.print( \" \" + v );\n err.println();\n }\n\n private boolean eq(String a, String b) {\n for( int i = 0; i < a.length(); ++i ){\n if( a.charAt(i) == '.' ) continue;\n if( b.charAt(i) == '.' ) continue;\n if( a.charAt(i) != b.charAt(i) )\n return false;\n }\n return true;\n }\n\n class FastScanner {\n\n BufferedReader br;\n StringTokenizer st;\n\n FastScanner(InputStreamReader reader) {\n br = new BufferedReader(reader);\n st = new StringTokenizer(\"\");\n }\n\n String next() {\n while (!st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException ex) {\n Main.MLE();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n }\n\n public static void MLE() {\n int[][] arr = new int[1024 * 1024][];\n for (int i = 0; i < arr.length; i++) {\n arr[i] = new int[1024 * 1024];\n }\n }\n\n public static void main(String[] args) {\n new Main().run();\n }\n\n long timeBegin = System.currentTimeMillis();\n FastScanner sc;\n PrintWriter out;\n PrintStream err = System.err;\n\n // </editor-fold>\n \n \n double[] logFact = new double[(int)1e6+1];\n {\n logFact[0] = log(1);\n for (int i = 1; i < logFact.length; i++) {\n logFact[i] = logFact[i-1] + log(i);\n }\n err.println(\"f:\" + exp(logFact[7]));\n }\n \n double logC( int m, int n ){\n return logFact[n] - logFact[m] - logFact[n-m];\n }\n \n void solve() {\n int n = sc.nextInt();\n int m = sc.nextInt();;\n double ans = 0;\n for( int cnt = 1; cnt <= min(n,m); ++cnt ){\n double cur = logC(cnt,m) + logC(n-cnt,n*m-m) - logC(n,n*m);\n// if( -50 <= cur ){\n cur = exp(cur);\n cur = cur * cnt * cnt / n;\n ans += cur;\n// }\n }\n out.printf( \"%.10f\\n\", ans);\n }\n\n}\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "combinatorics"], "code_uid": "e198c5c8356b54b1169239907f196f42", "src_uid": "0b9ce20c36e53d4702869660cbb53317", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.Scanner;\n\n/*\n * To change this license header, choose License Headers in Project Properties.\n * To change this template file, choose Tools | Templates\n * and open the template in the editor.\n */\n\n/**\n *\n * @author ASUS\n */\npublic class NewClass {\n \n \n \npublic static void main(String[] args) {\n\n Scanner sc=new Scanner(System.in);\n double m,n;\n \n n=sc.nextDouble();\n m=sc.nextDouble();\n \n if ( n == 1 ) {\n System.out. printf (\"%.10f\", 1. );\n \n }\n else\n if ( m == 1 ) {\n System.out. printf (\"%.10f\", 1. / n );\n \n }\n else\n System.out. printf (\"%.10f\", 1. / n + ( ( ( n - 1 ) / n ) * ( (m - 1 ) / ( n * m - 1 ) ) ) );\n //System.out. printf(\"%.10lf\",1./n+( ( ( n - 1 ) / ( n ) ) ));\n\n System.out.println();\n}\n \n}\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "combinatorics"], "code_uid": "a025b97ba15a1f9d82f08c0436431e92", "src_uid": "0b9ce20c36e53d4702869660cbb53317", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.IOException;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class ProblemC {\n\tstatic final long MOD = 1000000007;\n\t\n\tpublic static void main(String[] args) throws IOException {\n\t\tScanner in = new Scanner(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\t\n\t\tint n = in.nextInt();\n\t\tlong[] a = new long[n];\n\t\tfor (int i = 0 ; i < n ; i++) {\n\t\t\ta[i] = in.nextLong();\n\t\t}\n\t\tArrays.sort(a);\n\t\t\n\t\tlong best = Long.MAX_VALUE;\n\t\t\n\t\tboolean[] isp = new boolean[1000010];\n\t\tArrays.fill(isp, true);\n\t\tisp[1] = false;\n\t\tfor (int i = 2 ; i < 1000010 ; i++) {\n\t\t\tif (isp[i]) {\n\t\t\t\tfor (long ii = 1L * i * i ; ii < 1000010 ; ii += i) {\n\t\t\t\t\tisp[(int)ii] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tList<Integer> primes = new ArrayList<Integer>();\n\t\tfor (int i = 1 ; i < 1000010 ; i++) {\n\t\t\tif (isp[i]) {\n\t\t\t\tprimes.add(i);\n\t\t\t}\n\t\t}\n\t\t\n\t\tcnt = new long[n];\n\t\tfor (int i = 0 ; i < n ; i++) {\n\t\t\tlong nw = a[i];\n\t\t\tfor (int p : primes) {\n\t\t\t\twhile (nw % p == 0) {\n\t\t\t\t\tnw /= p;\n\t\t\t\t\tcnt[i]++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (nw >= 2) {\n\t\t\t\tcnt[i]++;\n\t\t\t}\n\t\t}\n\t\tN = n;\n\t\t\n\t\tint[] parent = new int[n];\n\t\tArrays.fill(parent, -1);\n\t\tout.println(doit(0, a, parent));\n\t\tout.flush();\n\t}\n\t\n\tstatic int N;\n\tstatic long[] cnt;\n\n\tpublic static long doit(int done, long[] a, int[] parent) {\n\t\tif (done == (1<<N)-1) {\n\t\t\tlong best = 0;\n\t\t\tfor (int i = 0 ; i < N ; i++) {\n\t\t\t\tlong deg = cnt[i];\n\t\t\t\tboolean hasChild = false;\n\t\t\t\tfor (int j = 0 ; j < N ; j++) {\n\t\t\t\t\tif (parent[j] == i) {\n\t\t\t\t\t\tdeg -= cnt[j];\n\t\t\t\t\t\thasChild = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbest += deg;\n\t\t\t\tif (hasChild || cnt[i] >= 2) {\n\t\t\t\t\tbest++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tint pcnt = 0;\n\t\t\tfor (int j = 0 ; j < N ; j++) {\n\t\t\t\tif (parent[j] == -1) {\n\t\t\t\t\tpcnt++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tbest += (pcnt == 1) ? 0 : 1;\n\t\t\t//debug(pcnt,best);\n\t\t\treturn best;\n\t\t}\n\t\tlong best = Long.MAX_VALUE;\n\t\tfor (int pl = N-1 ; pl >= 0 ; pl--) {\n\t\t\tif ((done & (1<<pl)) != 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor (int p = 0 ; p < N ; p++) {\n\t\t\t\tif ((done & (1<<p)) == 0) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (a[p] % a[pl] == 0) {\n\t\t\t\t\tparent[pl] = p;\n\t\t\t\t\tlong rev = a[p];\n\t\t\t\t\ta[p] /= a[pl];\n\t\t\t\t\tbest = Math.min(best, doit(done | (1<<pl), a, parent));\n\t\t\t\t\ta[p] = rev;\n\t\t\t\t\tparent[pl] = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tparent[pl] = -1;\n\t\t\tbest = Math.min(best, doit(done | (1<<pl), a, parent));\n\t\t\tbreak;\n\t\t}\n\t\treturn best;\n\t}\n\n\t\n\tpublic static void debug(Object... o) {\n\t\tSystem.err.println(Arrays.deepToString(o));\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "dp", "number theory"], "code_uid": "87cb6ed49837129e45876edddbc33763", "src_uid": "52b8b6c68518d5129272b8c56e5b7662", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main implements Runnable {\n\n public void _main() throws Exception {\n\tint n = nextInt();\n\tint m = nextInt();\n\tint x1 = nextInt();\n\tint y1 = nextInt();\n\tint x2 = nextInt();\n\tint y2 = nextInt();\n\tint h = Math.abs(x1 - x2) + 1;\n\tint w = Math.abs(y1 - y2) + 1;\n\tif ((h >= 4 && w >= 5) || (h >= 5 && w >= 4) || h >= 6 || w >= 6) {\n\t out.println(\"Second\");\n\t} else {\n\t out.println(\"First\");\n\t}\n }\n\n\n private BufferedReader in;\n private PrintWriter out;\n private StringTokenizer st;\n\n private String next() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n String rl = in.readLine();\n if (rl == null) return null;\n st = new StringTokenizer(rl);\n }\n return st.nextToken();\n }\n\n private int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n private long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n private double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n\n public void run() {\n try {\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n\n _main();\n\n out.close();\n } catch (Exception e) {\n e.printStackTrace();\n System.exit(202);\n }\n }\n\n public static void main(String[] args) {\n new Thread(new Main()).run();\n }\n\n}\n", "lang_cluster": "Java", "tags": ["constructive algorithms", "combinatorics"], "code_uid": "754d25c1371e84221871f8d707baf976", "src_uid": "41f6f90b7307d2383495441114fa8ea2", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.math.BigDecimal;\nimport java.math.BigInteger;\nimport java.util.Scanner;\nimport java.util.Vector;\npublic class Main {\n\tstatic final long mod=1000000007;\n\tpublic static void main(String[] args) {\n\t\tlong a[]=new long[20];\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tlong s=sc.nextLong();\n\t\tfor(int i=0;i<n;i++)\n\t\t\t\ta[i]=sc.nextLong();\n\t\tint len=(1<<n);\n\t\tlong ans=0;\n\t\tfor(int i=0;i<len;i++){\n\t\t\tlong x=s;\n\t\t\tint flag=1;\n\t\t\tfor(int j=0;j<n;j++)\n\t\t\t\tif(((i>>j)&1)==1){\n\t\t\t\t\tflag*=-1;\n\t\t\t\t\tx-=a[j]+1;\n\t\t\t\t}\n\t\t\tif(x<0)\n\t\t\t\tcontinue;\n\t\t\tans=(ans+flag*lucas(x+n-1,n-1))%mod;\n\t\t\tans=(ans+mod)%mod;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\tstatic long lucas(long a,long b){\n\t\tif(b==0)\n\t\t\treturn 1;\n\t\treturn getc(a%mod,b%mod)*lucas(a/mod,b/mod)%mod;\n\t}\n\tstatic long getc(long a,long b){\n\t\tif(a<b)\n\t\t\treturn 0;\n\t\tlong ans=1;\n\t\tfor(long i=a-b+1;i<=a;i++)\n\t\t\tans=ans*i%mod;\n\t\tlong t=1;\n\t\tfor(long i=1;i<=b;i++)\n\t\t\tt=t*i%mod;\n\t\treturn ans*qpow(t,mod-2)%mod;\n\t}\n\tstatic long qpow(long a,long b){\n\t\tlong ans=1;\n\t\twhile(b!=0){\n\t\t\tif((b&1)==1){\n\t\t\t\tans=a*ans%mod;\n\t\t\t}\n\t\t\ta=a*a%mod;\n\t\t\tb>>=1;\n\t\t}\n\t\treturn ans;\n\t}\n}", "lang_cluster": "Java", "tags": ["combinatorics", "number theory", "bitmasks"], "code_uid": "5a6262cd197794529a9b7e4b0df80890", "src_uid": "8b883011eba9d15d284e54c7a85fcf74", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedWriter;\nimport java.util.InputMismatchException;\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.NoSuchElementException;\nimport java.math.BigInteger;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.Writer;\nimport java.io.IOException;\nimport java.util.Arrays;\nimport java.io.InputStream;\nimport java.io.OutputStreamWriter;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n TaskE solver = new TaskE();\n solver.solve(1, in, out);\n out.close();\n }\n}\n\nclass TaskE {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n=in.readInt(), MOD=1000000007;\n long s=in.readLong(), ret=0;\n long[] F= IOUtils.readLongArray(in, n), revFac=IntegerUtils.generateReverseFactorials(n, MOD);\n for (int mask=0; mask<1<<n; mask++) {\n long used=0;\n for (int i=0; i<n; i++) if ((mask&(1<<i))>0) used+=F[i]+1;\n if (used>s) continue;\n long s2=s-used, x=revFac[n-1];\n for (int i=1; i<n; i++) x=(s2+n-i)%MOD*x%MOD;\n ret=(ret+(Integer.bitCount(mask)%2==0?1:-1)*x+MOD)%MOD;\n }\n out.printLine(ret);\n }\n}\n\nclass InputReader {\n\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public long readLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n}\n\nclass OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public void close() {\n writer.close();\n }\n\n public void printLine(long i) {\n writer.println(i);\n }\n\n}\n\nclass IOUtils {\n\n public static long[] readLongArray(InputReader in, int size) {\n long[] array = new long[size];\n for (int i = 0; i < size; i++)\n array[i] = in.readLong();\n return array;\n }\n\n}\n\nclass IntegerUtils {\n\n public static long[] generateReverse(int upTo, long module) {\n long[] result = new long[upTo];\n if (upTo > 1)\n result[1] = 1;\n for (int i = 2; i < upTo; i++)\n result[i] = (module - module / i * result[((int) (module % i))] % module) % module;\n return result;\n }\n\n public static long[] generateReverseFactorials(int upTo, long module) {\n long[] result = generateReverse(upTo, module);\n if (upTo > 0)\n result[0] = 1;\n for (int i = 1; i < upTo; i++)\n result[i] = result[i] * result[i - 1] % module;\n return result;\n }\n\n}\n\n", "lang_cluster": "Java", "tags": ["combinatorics", "number theory", "bitmasks"], "code_uid": "f9e96c25785ed9ab27244c2391d54eca", "src_uid": "8b883011eba9d15d284e54c7a85fcf74", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedInputStream;\nimport java.io.File;\nimport java.io.FileInputStream;\nimport java.io.FileNotFoundException;\nimport java.util.*;\n\npublic class DevuAndFlowers {\n\n\tstatic long mod = 1000000007;\n\tstatic long modInv[];\n\tstatic int N;\n\tstatic long S;\n\tstatic long f[];\n\tstatic long fact[];\n\tpublic static void main(String[] args) {\n\t\tJS in = new JS();\n\t\tN = in.nextInt();\n\t\tS = in.nextLong();\n\t\tf = new long[N];\n\t\tfor(int i = 0; i < N; i++) f[i] = in.nextLong();\n\t\tmodInv = new long[N+5];\n\t\tfor(int i = 0; i <= N+4; i++) modInv[i] = pow(i, mod-2);\n\t\t\n\t\tlong ans = 0;\n\t\tfor(int i = 0; i < (1<<N); i++) {\n\t\t\tlong over = S;\n\t\t\tfor(int j = 0; j < N; j++) {\n\t\t\t\tif((i & (1<<j)) > 0) {\n\t\t\t\t\tover -= f[j]+1;\t\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(over < 0) continue;\n\t\t\tlong v = sumTo(over, N);\n\t\t\tif(Integer.bitCount(i)%2==1) ans -= v;\n\t\t\telse ans += v;\n\t\t\twhile(ans < 0) ans+=mod;\n\t\t\twhile(ans >= mod)ans-=mod;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\n\tstatic long sumTo(long sum, long n) {\n\t\treturn choose(sum+n-1, n-1);\n\t}\n\tstatic long choose(long n, long k) {\n\t\tlong prev = 1;\n\t\tfor(int c = 1; c <= k; c++)\n\t\t\tprev = (((prev*(n%mod-c+1))%mod)*modInv[c])%mod;\n\t\twhile(prev < 0) prev += mod;\n\t\twhile(prev >= mod) prev -= mod;\n\t\treturn prev;\n\t}\n\t\n\tstatic long pow(long base, long power) {\n\t\tif(power == 0) return 1;\n\t\tif(power == 1) return base;\n\t\tif((power%2)==0) {\n\t\t\tlong r = pow(base, power/2);\n\t\t\treturn (r*r)%mod;\n\t\t}\n\t\telse {\n\t\t\treturn (base * pow(base,power-1))%mod;\n\t\t}\n\t}\n\n\t\n\tstatic class JS{\n\t\tpublic int BS = 1<<16;\n\t\tpublic char NC = (char)0;\n\t\tbyte[] buf = new byte[BS];\n\t\tint bId = 0, size = 0;\n\t\tchar c = NC;\n\t\tdouble num = 1;\n\t\tBufferedInputStream in;\n\t\t\n\t\tpublic JS() {\n\t\t\tin = new BufferedInputStream(System.in, BS);\n\t\t}\n\t\t\n\t\tpublic JS(String s) throws FileNotFoundException {\n\t\t\tin = new BufferedInputStream(new FileInputStream(new File(s)), BS);\n\t\t}\n\t\t\n\t\tpublic char nextChar(){\n\t\t\twhile(bId==size) {\n\t\t\t\ttry {\n\t\t\t\t\tsize = in.read(buf);\n\t\t\t\t}catch(Exception e) {\n\t\t\t\t\treturn NC;\n\t\t\t\t}\t\t\t\t\n\t\t\t\tif(size==-1)return NC;\n\t\t\t\tbId=0;\n\t\t\t}\n\t\t\treturn (char)buf[bId++];\n\t\t}\n\t\t\n\t\tpublic int nextInt() {\n\t\t\treturn (int)nextLong();\n\t\t}\n\t\t\n\t\tpublic long nextLong() {\n\t\t\tnum=1;\n\t\t\tboolean neg = false;\n\t\t\tif(c==NC)c=nextChar();\n\t\t\tfor(;(c<'0' || c>'9'); c = nextChar()) {\n\t\t\t\tif(c=='-')neg=true;\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tfor(; c>='0' && c <='9'; c=nextChar()) {\n\t\t\t\tres = (res<<3)+(res<<1)+c-'0';\n\t\t\t\tnum*=10;\n\t\t\t}\n\t\t\treturn neg?-res:res;\n\t\t}\n\t\t\n\t\tpublic double nextDouble() {\n\t\t\tdouble cur = nextLong();\n\t\t\treturn c!='.' ? cur:cur+nextLong()/num;\n\t\t}\n\t\t\n\t\tpublic String next() {\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\twhile(c<=32)c=nextChar();\n\t\t\twhile(c>32) {\n\t\t\t\tres.append(c);\n\t\t\t\tc=nextChar();\n\t\t\t}\n\t\t\treturn res.toString();\n\t\t}\n\t\t\n\t\tpublic String nextLine() {\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\twhile(c<=32)c=nextChar();\n\t\t\twhile(c!='\\n') {\n\t\t\t\tres.append(c);\n\t\t\t\tc=nextChar();\n\t\t\t}\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tpublic boolean hasNext() {\n\t\t\tif(c>32)return true;\n\t\t\twhile(true) {\n\t\t\t\tc=nextChar();\n\t\t\t\tif(c==NC)return false;\n\t\t\t\telse if(c>32)return true;\n\t\t\t}\n\t\t}\n\t\t\n\t\tpublic int []nia(int n){\n\t\t\tint r[] = new int[n];\n\t\t\tfor(int i = 0; i < n; i++) r[i] = nextInt();\n\t\t\treturn r;\n\t\t}\n\t\tpublic double []nda(int n){\n\t\t\tdouble r[] = new double[n];\n\t\t\tfor(int i = 0; i < n; i++) r[i] = nextDouble();\n\t\t\treturn r;\n\t\t}\n\t\tpublic long []nla(int n){\n\t\t\tlong r[] = new long[n];\n\t\t\tfor(int i = 0; i < n; i++) r[i] = nextLong();\n\t\t\treturn r;\n\t\t}\n\t}\n\t\n}\n", "lang_cluster": "Java", "tags": ["combinatorics", "number theory", "bitmasks"], "code_uid": "e9eff9e2e085c6a2e0e6ae69176b852b", "src_uid": "8b883011eba9d15d284e54c7a85fcf74", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "//package round258;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class E {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t\tint n = ni();\n\t\tlong s = nl();\n\t\tlong[] a = new long[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = nl();\n\t\tint mod = 1000000007;\n\t\tlong ret = 0;\n\t\tfor(int i = 0;i < 1<<n;i++){ // used\n\t\t\tlong sum = 0;\n\t\t\tfor(int j = 0;j < n;j++){\n\t\t\t\tif(i<<31-j<0)sum += a[j]+1;\n\t\t\t}\n\t\t\tlong rem = s-sum;\n\t\t\tif(rem < 0)continue;\n\t\t\tlong val = 1;\n\t\t\tlong N = rem+n-1, R = n-1;\n\t\t\tfor(int j = 1;j <= R;j++){\n\t\t\t\tval = val * ((N-j+1)%mod) % mod * invl(j, mod) % mod;\n\t\t\t}\n\t\t\tif(Integer.bitCount(i) % 2 == 0){\n\t\t\t\tret += val;\n\t\t\t}else{\n\t\t\t\tret += mod-val;\n\t\t\t}\n\t\t}\n\t\tout.println(ret%mod);\n\t}\n\t\n\tpublic static long invl(long a, long mod) {\n\t\tlong b = mod;\n\t\tlong p = 1, q = 0;\n\t\twhile (b > 0){\n\t\t\tlong c = a / b;\n\t\t\tlong d;\n\t\t\td = a;\n\t\t\ta = b;\n\t\t\tb = d % b;\n\t\t\td = p;\n\t\t\tp = q;\n\t\t\tq = d - c * q;\n\t\t}\n\t\treturn p < 0 ? p + mod : p;\n\t}\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new E().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tprivate int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["combinatorics", "number theory", "bitmasks"], "code_uid": "9a428845f578fcf4038399cdf0e0fa28", "src_uid": "8b883011eba9d15d284e54c7a85fcf74", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\nimport java.util.concurrent.*;\n\npublic final class devu_and_flowers\n{\n static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\tstatic FastScanner sc=new FastScanner(br);\n static PrintWriter out=new PrintWriter(System.out);\n\tstatic Random rnd=new Random();\n\tstatic long mod=(long)(1e9+7);\n\t\n\tstatic long C(long n,long diff)\n\t{\n\t\tlong ret=1,upper=n+diff-1;\n\t\t\n\t\tfor(long x=upper;x>diff;x--)\n\t\t{\n\t\t\tlong now=x%mod;\n\t\t\t\t\n\t\t\tret=(ret*now)%mod;\n\t\t}\n\t\t\n\t\treturn (ret*pow(fact(n-1),mod-2))%mod;\n\t}\n\t\n\tstatic long fact(long n)\n\t{\n\t\tlong ret=1;\n\t\t\n\t\tfor(long i=1;i<=n;i++)\t\n\t\t{\n\t\t\tret=(ret*i)%mod;\n\t\t}\n\t\t\n\t\treturn ret;\n\t}\n\t\n\tstatic long pow(long a,long b)\n\t{\n\t\tlong x=1,y=a;\n\t\t\n\t\twhile(b>0)\n\t\t{\n\t\t\tif(b%2==1)\n\t\t\t{\n\t\t\t\tx=(x*y)%mod;\n\t\t\t}\n\t\t\t\n\t\t\ty=(y*y)%mod;b=b/2;\n\t\t}\n\t\t\n\t\treturn x;\n\t}\n\t\n\tstatic Map<Long,Long> merge(Map<Long,Long> m1,long now)\n\t{\t\n\t\tMap<Long,Long> m2=new HashMap<>(),ret=new HashMap<>();\n\t\t\n\t\tm2.put(0L,1L);m2.put(now,(-1L+mod)%mod);\n\t\t\n\t\tfor(Map.Entry<Long,Long> en1:m1.entrySet())\n\t\t{\n\t\t\tfor(Map.Entry<Long,Long> en2:m2.entrySet())\n\t\t\t{\n\t\t\t\tlong add=en1.getKey()+en2.getKey(),mul=(en1.getValue()*en2.getValue())%mod;\n\t\t\t\t\n\t\t\t\tret.put(add,(ret.getOrDefault(add,0L)+mul)%mod);\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn ret;\n\t}\n\t\n public static void main(String args[]) throws Exception\n {\n\t\tint n=sc.nextInt();long s=sc.nextLong();\n\t\t\n\t\tlong[] a=new long[n];\n\t\t\n\t\tfor(int i=0;i<n;i++)\n\t\t{\n\t\t\ta[i]=sc.nextLong();\n\t\t}\n\t\t\n\t\t// 1-x^a[i]+1..\n\t\t\n\t\tMap<Long,Long> m1=new HashMap<>();m1.put(0L,1L);\n\t\t\n\t\tfor(int i=0;i<n;i++)\n\t\t{\n\t\t\tm1=merge(m1,a[i]+1);\n\t\t}\n\t\t\n\t\tlong res=0;\n\t\t\n\t\tfor(Map.Entry<Long,Long> en:m1.entrySet())\n\t\t{\t\n\t\t\tlong curr=en.getKey();\n\t\t\t\n\t\t\tif(curr<=s)\n\t\t\t{\n\t\t\t\tlong diff=s-curr;\n\t\t\t\t\n\t\t\t\tlong now=C(n,diff);\n\t\t\t\n\t\t\t\tlong mul=(en.getValue()*now)%mod;\n\t\t\t\t\n\t\t\t\tres=(res+mul)%mod;\n\t\t\t}\n\t\t}\n\t\t\n\t\tout.println(res);out.close();\n }\n\t\n\tprivate static class Pair\n\t{\n\t\tlong pow,cof;\n\t\t\n\t\tpublic Pair(long pow,long cof)\n\t\t{\n\t\t\tthis.pow=pow;this.cof=cof;\n\t\t}\n\t}\n}\nclass FastScanner\n{\n BufferedReader in;\n StringTokenizer st;\n\n public FastScanner(BufferedReader in) {\n this.in = in;\n }\n\t\n public String nextToken() throws Exception {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(in.readLine());\n }\n return st.nextToken();\n }\n\t\n\tpublic String next() throws Exception {\n\t\treturn nextToken().toString();\n\t}\n\t\n public int nextInt() throws Exception {\n return Integer.parseInt(nextToken());\n }\n\n public long nextLong() throws Exception {\n return Long.parseLong(nextToken());\n }\n\n public double nextDouble() throws Exception {\n return Double.parseDouble(nextToken());\n }\n}", "lang_cluster": "Java", "tags": ["combinatorics", "number theory", "bitmasks"], "code_uid": "0703b7937f15e4615e52ab186b43e2dd", "src_uid": "8b883011eba9d15d284e54c7a85fcf74", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class e {\n\tstatic final long MOD = (long)1e9+7;\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tlong[] invs = new long[25];\n\t\tinvs[1] = 1;\n\t\tfor (int i = 2; i < invs.length; ++i)\n\t\t\tinvs[i] = (MOD - (MOD / i) * invs[((int) (MOD % i))] % MOD) % MOD;\n\t\tint n = in.nextInt();\n\t\tlong s = in.nextLong();\n\t\tlong[] fs = new long[n];\n\t\tfor(int i=0;i<n;i++)\n\t\t\tfs[i] = in.nextLong();\n\t\tArrayList<Term> ans = new ArrayList<>();\n\t\tArrayList<ArrayList<Term>> eqList = new ArrayList<>();\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tArrayList<Term> cur = new ArrayList<>();\n\t\t\tcur.add(new Term(1,0));\n\t\t\tcur.add(new Term(-1,fs[i]+1));\n\t\t\teqList.add(cur);\n\t\t}\n\t\tmultiply(ans, eqList, 0, new Term(1, 0));\n\t\tlong sum = 0;\n\t\tfor(Term t : ans) {\n\t\t\tlong pow = s - t.pow;\n\t\t\tif(pow < 0) continue;\n\t\t\tlong choose = 1;\n\t\t\tfor(int i=0;i<n-1;i++) {\n\t\t\t\tchoose *= (pow+n-1-i) % MOD;\n\t\t\t\tchoose %= MOD;\n\t\t\t\tchoose *= invs[i+1];\n\t\t\t\tchoose %= MOD;\n\t\t\t}\n\t\t\tsum += t.c * choose;\n\t\t\tsum %= MOD;\n\t\t}\n\t\tif(sum < 0) sum += MOD;\n\t\tSystem.out.println(sum);\n\t}\n\tstatic void multiply(ArrayList<Term> ans, ArrayList<ArrayList<Term>> list, int idx, Term current) {\n\t\tif(idx == list.size()) {\n\t\t\tans.add(current);\n\t\t\treturn;\n\t\t}\n\t\tfor(Term t : list.get(idx)) {\n\t\t\tTerm nt = new Term((t.c * current.c) % MOD, t.pow + current.pow);\n\t\t\tmultiply(ans, list, idx+1, nt);\n\t\t}\n\t}\n\tstatic class Term {\n\t\tlong c;\n\t\tlong pow;\n\t\tpublic Term(long c, long pow) {\n\t\t\tthis.c = c;\n\t\t\tthis.pow = pow;\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["combinatorics", "number theory", "bitmasks"], "code_uid": "b316d8eaa4fe031089f6316e90d9df22", "src_uid": "8b883011eba9d15d284e54c7a85fcf74", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.awt.*;\nimport java.io.*;\nimport java.math.BigDecimal;\nimport java.math.BigInteger;\nimport java.util.*;\nimport java.util.List;\n\nimport static java.lang.Math.max;\nimport static java.lang.Math.min;\n\n\npublic class E implements Runnable{\n\n // SOLUTION!!!\n // HACK ME PLEASE IF YOU CAN!!!\n // PLEASE!!!\n // PLEASE!!!\n // PLEASE!!!\n\n private final static Random rnd = new Random();\n private final static String fileName = \"\";\n\n final static long MODULO = 1000 * 1000 * 1000 + 7;\n\n long inverseNMinus1Factorial;\n\n private void solve() {\n int n = readInt();\n long s = readLong();\n\n long[] f = readLongArray(n);\n\n Map<Long, Long> coeffs = new HashMap<>();\n coeffs.put(0L, 1L);\n\n class Pair {\n long power, coeff;\n\n public Pair(long power, long coeff) {\n this.power = power;\n this.coeff = coeff;\n }\n }\n\n for (long size : f) {\n List<Pair> coeffEntries = new ArrayList<>();\n for (Map.Entry<Long, Long> coeffEntry : coeffs.entrySet()) {\n long power = coeffEntry.getKey();\n long coeff = coeffEntry.getValue();\n\n long nextPower = power + size + 1;\n coeffEntries.add(\n new Pair(\n nextPower, -coeff\n )\n );\n }\n\n for (Pair coeffEntry : coeffEntries) {\n coeffs.put(coeffEntry.power,\n add(coeffs.getOrDefault(coeffEntry.power, 0L), coeffEntry.coeff)\n );\n }\n }\n\n long nMinus1Factorial = multSequence(1, n - 1);\n this.inverseNMinus1Factorial = inverse(nMinus1Factorial);\n\n long answer = 0;\n for (Map.Entry<Long, Long> coeffEntry : coeffs.entrySet()) {\n long power = coeffEntry.getKey();\n long coeff = coeffEntry.getValue();\n\n if (s >= power) {\n long need = s - power;\n answer = add(answer, mult(binom(n + need - 1, need), coeff));\n }\n }\n\n out.println(answer);\n }\n\n long multSequence(long start, long end) {\n long res = 1;\n for (long i = start; i <= end; ++i) {\n res = mult(res, i);\n }\n\n return res;\n }\n\n long inverse(long x) {\n return binpow(x, MODULO - 2);\n }\n\n long binpow(long base, long power) {\n if (power == 0) return 1;\n\n if ((power & 1) == 0) {\n long half = binpow(base, power >> 1);\n return mult(half, half);\n } else {\n long prev = binpow(base, power - 1);\n return mult(prev, base);\n }\n }\n\n long binom(long n, long k) {\n return mult(\n multSequence(k + 1, n),\n inverseNMinus1Factorial\n );\n }\n\n long add(long a, long b) {\n return ((a % MODULO + b % MODULO) % MODULO + MODULO) % MODULO;\n }\n\n long mult(long a, long b) {\n return (a % MODULO) * (b % MODULO) % MODULO;\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private final static boolean FIRST_INPUT_STRING = false;\n private final static boolean MULTIPLE_TESTS = true;\n private final boolean ONLINE_JUDGE = System.getProperty(\"ONLINE_JUDGE\") != null;\n\n private final static int MAX_STACK_SIZE = 128;\n\n private final static boolean OPTIMIZE_READ_NUMBERS = true;\n\n /////////////////////////////////////////////////////////////////////\n\n public void run(){\n try{\n timeInit();\n Locale.setDefault(Locale.US);\n\n init();\n\n if (ONLINE_JUDGE) {\n solve();\n } else {\n do {\n try {\n timeInit();\n solve();\n time();\n\n out.println();\n } catch (NumberFormatException e) {\n break;\n } catch (NullPointerException e) {\n if (FIRST_INPUT_STRING) break;\n else throw e;\n }\n } while (MULTIPLE_TESTS);\n }\n\n out.close();\n time();\n }catch (Exception e){\n e.printStackTrace(System.err);\n System.exit(-1);\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private BufferedReader in;\n private OutputWriter out;\n private StringTokenizer tok = new StringTokenizer(\"\");\n\n public static void main(String[] args){\n new Thread(null, new E(), \"\", MAX_STACK_SIZE * (1L << 20)).start();\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private void init() throws FileNotFoundException{\n Locale.setDefault(Locale.US);\n\n if (ONLINE_JUDGE){\n if (fileName.isEmpty()) {\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new OutputWriter(System.out);\n } else {\n in = new BufferedReader(new FileReader(fileName + \".in\"));\n out = new OutputWriter(fileName + \".out\");\n }\n }else{\n in = new BufferedReader(new FileReader(\"input.txt\"));\n out = new OutputWriter(\"output.txt\");\n }\n }\n\n ////////////////////////////////////////////////////////////////\n\n private long timeBegin;\n\n private void timeInit() {\n this.timeBegin = System.currentTimeMillis();\n }\n\n private void time(){\n long timeEnd = System.currentTimeMillis();\n System.err.println(\"Time = \" + (timeEnd - timeBegin));\n }\n\n private void debug(Object... objects){\n if (ONLINE_JUDGE){\n for (Object o: objects){\n System.err.println(o.toString());\n }\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private String delim = \" \";\n\n private String readLine() {\n try {\n return in.readLine();\n } catch (IOException e) {\n throw new RuntimeIOException(e);\n }\n }\n\n private String readString() {\n try {\n while(!tok.hasMoreTokens()){\n tok = new StringTokenizer(readLine());\n }\n\n return tok.nextToken(delim);\n } catch (NullPointerException e) {\n return null;\n }\n }\n\n /////////////////////////////////////////////////////////////////\n\n private final char NOT_A_SYMBOL = '\\0';\n\n private char readChar() {\n try {\n int intValue = in.read();\n\n if (intValue == -1){\n return NOT_A_SYMBOL;\n }\n\n return (char) intValue;\n } catch (IOException e) {\n throw new RuntimeIOException(e);\n }\n }\n\n private char[] readCharArray() {\n return readLine().toCharArray();\n }\n\n private char[][] readCharField(int rowsCount) {\n char[][] field = new char[rowsCount][];\n for (int row = 0; row < rowsCount; ++row) {\n field[row] = readCharArray();\n }\n\n return field;\n }\n\n /////////////////////////////////////////////////////////////////\n\n private long optimizedReadLong() {\n int sign = 1;\n long result = 0;\n boolean started = false;\n while (true) {\n try {\n int j = in.read();\n if (-1 == j) {\n if (started) return sign * result;\n throw new NumberFormatException();\n }\n\n if (j == '-') {\n if (started) throw new NumberFormatException();\n sign = -sign;\n }\n\n if ('0' <= j && j <= '9') {\n result = result * 10 + j - '0';\n started = true;\n } else if (started) {\n return sign * result;\n }\n } catch (IOException e) {\n throw new RuntimeIOException(e);\n }\n }\n }\n\n private int readInt() {\n\n if (!OPTIMIZE_READ_NUMBERS) {\n return Integer.parseInt(readString());\n } else {\n return (int) optimizedReadLong();\n }\n }\n\n private int[] readIntArray(int size) {\n int[] array = new int[size];\n\n for (int index = 0; index < size; ++index){\n array[index] = readInt();\n }\n\n return array;\n }\n\n private int[] readSortedIntArray(int size) {\n Integer[] array = new Integer[size];\n\n for (int index = 0; index < size; ++index) {\n array[index] = readInt();\n }\n Arrays.sort(array);\n\n int[] sortedArray = new int[size];\n for (int index = 0; index < size; ++index) {\n sortedArray[index] = array[index];\n }\n\n return sortedArray;\n }\n\n private int[] readIntArrayWithDecrease(int size) {\n int[] array = readIntArray(size);\n\n for (int i = 0; i < size; ++i) {\n array[i]--;\n }\n\n return array;\n }\n\n ///////////////////////////////////////////////////////////////////\n\n private int[][] readIntMatrix(int rowsCount, int columnsCount) {\n int[][] matrix = new int[rowsCount][];\n\n for (int rowIndex = 0; rowIndex < rowsCount; ++rowIndex) {\n matrix[rowIndex] = readIntArray(columnsCount);\n }\n\n return matrix;\n }\n\n private int[][] readIntMatrixWithDecrease(int rowsCount, int columnsCount) {\n int[][] matrix = new int[rowsCount][];\n\n for (int rowIndex = 0; rowIndex < rowsCount; ++rowIndex) {\n matrix[rowIndex] = readIntArrayWithDecrease(columnsCount);\n }\n\n return matrix;\n }\n\n ///////////////////////////////////////////////////////////////////\n\n private long readLong() {\n if (!OPTIMIZE_READ_NUMBERS) {\n return Long.parseLong(readString());\n } else {\n return optimizedReadLong();\n }\n }\n\n private long[] readLongArray(int size) {\n long[] array = new long[size];\n\n for (int index = 0; index < size; ++index){\n array[index] = readLong();\n }\n\n return array;\n }\n\n ////////////////////////////////////////////////////////////////////\n\n private double readDouble() {\n return Double.parseDouble(readString());\n }\n\n private double[] readDoubleArray(int size) {\n double[] array = new double[size];\n\n for (int index = 0; index < size; ++index){\n array[index] = readDouble();\n }\n\n return array;\n }\n\n ////////////////////////////////////////////////////////////////////\n\n private BigInteger readBigInteger() {\n return new BigInteger(readString());\n }\n\n private BigDecimal readBigDecimal() {\n return new BigDecimal(readString());\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private Point readPoint() {\n int x = readInt();\n int y = readInt();\n return new Point(x, y);\n }\n\n private Point[] readPointArray(int size) {\n Point[] array = new Point[size];\n\n for (int index = 0; index < size; ++index){\n array[index] = readPoint();\n }\n\n return array;\n }\n\n /////////////////////////////////////////////////////////////////////\n\n @Deprecated\n private List<Integer>[] readGraph(int vertexNumber, int edgeNumber) {\n @SuppressWarnings(\"unchecked\")\n List<Integer>[] graph = new List[vertexNumber];\n\n for (int index = 0; index < vertexNumber; ++index){\n graph[index] = new ArrayList<>();\n }\n\n while (edgeNumber-- > 0){\n int from = readInt() - 1;\n int to = readInt() - 1;\n\n graph[from].add(to);\n graph[to].add(from);\n }\n\n return graph;\n }\n\n private static class GraphBuilder {\n\n final int size;\n final List<Integer>[] edges;\n\n static GraphBuilder createInstance(int size) {\n List<Integer>[] edges = new List[size];\n for (int v = 0; v < size; ++v) {\n edges[v] = new ArrayList<>();\n }\n\n return new GraphBuilder(edges);\n }\n\n private GraphBuilder(List<Integer>[] edges) {\n this.size = edges.length;\n this.edges = edges;\n }\n\n public void addEdge(int from, int to) {\n addDirectedEdge(from, to);\n addDirectedEdge(to, from);\n }\n\n public void addDirectedEdge(int from, int to) {\n edges[from].add(to);\n }\n\n public int[][] build() {\n int[][] graph = new int[size][];\n for (int v = 0; v < size; ++v) {\n List<Integer> vEdges = edges[v];\n graph[v] = castInt(vEdges);\n }\n\n return graph;\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static class IntIndexPair {\n\n static Comparator<IntIndexPair> increaseComparator = new Comparator<E.IntIndexPair>() {\n\n @Override\n public int compare(E.IntIndexPair indexPair1, E.IntIndexPair indexPair2) {\n int value1 = indexPair1.value;\n int value2 = indexPair2.value;\n\n if (value1 != value2) return value1 - value2;\n\n int index1 = indexPair1.index;\n int index2 = indexPair2.index;\n\n return index1 - index2;\n }\n };\n\n static Comparator<IntIndexPair> decreaseComparator = new Comparator<E.IntIndexPair>() {\n\n @Override\n public int compare(E.IntIndexPair indexPair1, E.IntIndexPair indexPair2) {\n int value1 = indexPair1.value;\n int value2 = indexPair2.value;\n\n if (value1 != value2) return -(value1 - value2);\n\n int index1 = indexPair1.index;\n int index2 = indexPair2.index;\n\n return index1 - index2;\n }\n };\n\n int value, index;\n\n IntIndexPair(int value, int index) {\n super();\n this.value = value;\n this.index = index;\n }\n\n int getRealIndex() {\n return index + 1;\n }\n }\n\n private IntIndexPair[] readIntIndexArray(int size) {\n IntIndexPair[] array = new IntIndexPair[size];\n\n for (int index = 0; index < size; ++index) {\n array[index] = new IntIndexPair(readInt(), index);\n }\n\n return array;\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static class OutputWriter extends PrintWriter {\n\n final int DEFAULT_PRECISION = 12;\n\n private int precision;\n private String format, formatWithSpace;\n\n {\n precision = DEFAULT_PRECISION;\n\n format = createFormat(precision);\n formatWithSpace = format + \" \";\n }\n\n OutputWriter(OutputStream out) {\n super(out);\n }\n\n OutputWriter(String fileName) throws FileNotFoundException {\n super(fileName);\n }\n\n int getPrecision() {\n return precision;\n }\n\n void setPrecision(int precision) {\n precision = max(0, precision);\n this.precision = precision;\n\n format = createFormat(precision);\n formatWithSpace = format + \" \";\n }\n\n String createFormat(int precision){\n return \"%.\" + precision + \"f\";\n }\n\n @Override\n public void print(double d){\n printf(format, d);\n }\n\n void printWithSpace(double d){\n printf(formatWithSpace, d);\n }\n\n void printAll(double...d){\n for (int i = 0; i < d.length - 1; ++i){\n printWithSpace(d[i]);\n }\n\n print(d[d.length - 1]);\n }\n\n @Override\n public void println(double d){\n printlnAll(d);\n }\n\n void printlnAll(double... d){\n printAll(d);\n println();\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static class RuntimeIOException extends RuntimeException {\n\n /**\n *\n */\n private static final long serialVersionUID = -6463830523020118289L;\n\n RuntimeIOException(Throwable cause) {\n super(cause);\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n //////////////// Some useful constants and functions ////////////////\n /////////////////////////////////////////////////////////////////////\n\n private static final int[][] steps = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};\n private static final int[][] steps8 = {\n {-1, 0}, {1, 0}, {0, -1}, {0, 1},\n {-1, -1}, {1, 1}, {1, -1}, {-1, 1}\n };\n\n private static boolean checkCell(int row, int rowsCount, int column, int columnsCount) {\n return checkIndex(row, rowsCount) && checkIndex(column, columnsCount);\n }\n\n private static boolean checkIndex(int index, int lim){\n return (0 <= index && index < lim);\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static boolean checkBit(int mask, int bit){\n return (mask & (1 << bit)) != 0;\n }\n private static boolean checkBit(long mask, int bit){\n return (mask & (1L << bit)) != 0;\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static long getSum(int[] array) {\n long sum = 0;\n for (int value: array) {\n sum += value;\n }\n\n return sum;\n }\n\n private static Point getMinMax(int[] array) {\n int min = array[0];\n int max = array[0];\n\n for (int index = 0, size = array.length; index < size; ++index, ++index) {\n int value = array[index];\n\n if (index == size - 1) {\n min = min(min, value);\n max = max(max, value);\n } else {\n int otherValue = array[index + 1];\n\n if (value <= otherValue) {\n min = min(min, value);\n max = max(max, otherValue);\n } else {\n min = min(min, otherValue);\n max = max(max, value);\n }\n }\n }\n\n return new Point(min, max);\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static int[] getPrimes(int n) {\n boolean[] used = new boolean[n];\n used[0] = used[1] = true;\n\n int size = 0;\n for (int i = 2; i < n; ++i) {\n if (!used[i]) {\n ++size;\n for (int j = 2 * i; j < n; j += i) {\n used[j] = true;\n }\n }\n }\n\n int[] primes = new int[size];\n for (int i = 0, cur = 0; i < n; ++i) {\n if (!used[i]) {\n primes[cur++] = i;\n }\n }\n\n return primes;\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static long lcm(long a, long b) {\n return a / gcd(a, b) * b;\n }\n\n private static long gcd(long a, long b) {\n return (a == 0 ? b : gcd(b % a, a));\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static class MultiSet<ValueType> {\n\n public static <ValueType> MultiSet<ValueType> createMultiSet() {\n Map<ValueType, Integer> multiset = new HashMap<>();\n return new MultiSet<>(multiset);\n }\n\n private final Map<ValueType, Integer> multiset;\n private int size;\n\n public MultiSet(Map<ValueType, Integer> multiset) {\n this.multiset = multiset;\n this.size = 0;\n }\n\n public int size() {\n return size;\n }\n\n public void inc(ValueType value) {\n int count = get(value);\n multiset.put(value, count + 1);\n\n ++size;\n }\n\n public void dec(ValueType value) {\n int count = get(value);\n if (count == 0) return;\n\n if (count == 1) multiset.remove(value);\n else multiset.put(value, count - 1);\n\n --size;\n }\n\n public int get(ValueType value) {\n Integer count = multiset.get(value);\n return (count == null ? 0 : count);\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static class IdMap<KeyType> extends HashMap<KeyType, Integer> {\n\n /**\n *\n */\n private static final long serialVersionUID = -3793737771950984481L;\n\n public IdMap() {\n super();\n }\n\n int getId(KeyType key) {\n Integer id = super.get(key);\n if (id == null) {\n super.put(key, id = size());\n }\n\n return id;\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static int[] castInt(List<Integer> list) {\n int[] array = new int[list.size()];\n for (int i = 0; i < array.length; ++i) {\n array[i] = list.get(i);\n }\n\n return array;\n }\n\n private static long[] castLong(List<Long> list) {\n long[] array = new long[list.size()];\n for (int i = 0; i < array.length; ++i) {\n array[i] = list.get(i);\n }\n\n return array;\n }\n}\n\n", "lang_cluster": "Java", "tags": ["combinatorics", "number theory", "bitmasks"], "code_uid": "26a05f9a232a71950fde9cd7134ffd34", "src_uid": "8b883011eba9d15d284e54c7a85fcf74", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.math.*;\nimport java.util.*;\n\npublic class Main{\n FastScanner in;\n PrintWriter out;\n\n public long mod = 1000000000+7;\n long[] fact;\n\n public long bin_pow(long d, long step) {\n if (step == 0) return 1;\n if (step == 1) return d % mod;\n long x = bin_pow(d, step/2);\n x = (x * x) % mod;\n if (step % 2 == 1)\n x = (x * d) % mod;\n return x;\n }\n\n public long bC(int n, int k) {\n long res = fact[n];\n res *= bin_pow(fact[k], mod-2);\n res %= mod;\n res *= bin_pow(fact[n-k], mod-2);\n res %= mod;\n return res;\n }\n\n public long C(long n, int k) {\n if (n <= k)\n return bC((int)n, k);\n\n long res = 1;\n for (int p = 0; p < k ; p++) {\n res *= (n-p) % mod;\n res %= mod;\n }\n\n res *= bin_pow(fact[k], mod-2);\n res %= mod;\n\n return res;\n }\n\n public void solve()\n {\n int n = in.nextInt();\n long s = in.nextLong();\n long[] f = new long[n];\n long sum = 0;\n for (int i = 0; i < n; i++) {\n f[i] = in.nextLong();\n sum += f[i];\n }\n\n fact = new long[n+10];\n fact[0] = 1;\n for (int i = 1; i < n+10; i++) {\n fact[i] = i * fact[i-1];\n fact[i] %= mod;\n }\n\n\n long ans = 0;\n long sg;\n for(int mask = 0; mask < (1<<n); mask++) {\n int cnt = 0;\n sum = s;\n for (int i = 0; i < n; i++)\n if ((mask >> i) % 2 == 1)\n {\n cnt++;\n sum -= f[i]+1;\n }\n\n if (sum < 0) continue;\n\n if (cnt % 2 == 1)\n sg = -1;\n else\n sg = 1;\n\n long tmp_ans = 0;\n\n tmp_ans = C(sum + n - 1, n - 1);\n\n ans += sg * tmp_ans;\n ans += 2*mod;\n ans %= mod;\n }\n\n\n out.println(ans);\n }\n\n public void run()\n {\n in = new FastScanner();\n out = new PrintWriter(System.out);\n\n solve();\n\n out.close();\n }\n\n\n public static void main(String[] args) {\n new Main().run();\n }\n\n class FastScanner {\n BufferedReader br;\n StringTokenizer st;\n\n FastScanner() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n }\n}", "lang_cluster": "Java", "tags": ["combinatorics", "number theory", "bitmasks"], "code_uid": "de9d41b0c86416fb9cf9002784106e08", "src_uid": "8b883011eba9d15d284e54c7a85fcf74", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class D {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int r = sc.nextInt();\n int v = sc.nextInt();\n for (int i = 0; i < n; i++) {\n int s = sc.nextInt();\n int f = sc.nextInt();\n double d = f - s;\n double p = 2 * Math.PI * r;\n d %= p;\n double min = 0, max = 2 * Math.PI;\n for (int j = 0; j < 100; j++) {\n double mid = (min + max) / 2;\n double dis = (mid + Math.sin(mid)) * r * 2;\n if (dis < d)\n min = mid;\n else\n max = mid;\n }\n double t1 = (f - s - d) / v;\n double t2 = (min + max) * r / v;\n System.out.println(t1 + t2);\n }\n sc.close();\n }\n}\n", "lang_cluster": "Java", "tags": ["geometry"], "code_uid": "ab274ec701833eb65fa67ca417c47cbf", "src_uid": "3882f2c02e83bd2d55de8004ea3bbd88", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class D {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int r = sc.nextInt();\n int v = sc.nextInt();\n for (int i = 0; i < n; i++) {\n int s = sc.nextInt();\n int f = sc.nextInt();\n double d = f - s;\n double p = 2 * Math.PI * r;\n d %= p;\n double min = 0, max = 2 * Math.PI;\n for (int j = 0; j < 100; j++) {\n double mid = (min + max) / 2;\n double dis = (mid + Math.sin(mid)) * r * 2;\n if (dis < d)\n min = mid;\n else\n max = mid;\n }\n double t1 = (f - s - d) / v;\n double t2 = (min + max) * r / v;\n if ((min + max) / 2 > Math.PI)\n System.out.println(\" = \" + (min + max) / 2);\n System.out.println(t1 + t2);\n }\n sc.close();\n }\n}\n", "lang_cluster": "Java", "tags": ["geometry"], "code_uid": "9e4a632c33b488afb8bc75f8aa133474", "src_uid": "3882f2c02e83bd2d55de8004ea3bbd88", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.Scanner;\n\n\n/**\n *\n * @author sarthak\n */\npublic class rnd330_D {\n public static void main(String[] args)\n {\n Scanner s=new Scanner(System.in);\n int n=s.nextInt();\n int r=s.nextInt();\n int v=s.nextInt();\n while(n!=0)\n {\n int st=s.nextInt();\n int en=s.nextInt();\n double half_dis=(double)(en-st)/2;\n \n double st_angle=0;\n double end_angle=Math.PI;\n //dealing for one half\n int cmplete_revolutions=(int)((en-st)/(2*Math.PI*r));\n double left_dis=(double)(en-st- (double)cmplete_revolutions*2*Math.PI*(double)r);\n left_dis=left_dis/2;\n\n double dis=0.0;double mid_angle=0;\n \n for(int i=0;i<=100;i++)\n {\n mid_angle=(st_angle+end_angle)/2.0;\n dis=mid_angle*r +(double)r* Math.sin(mid_angle);\n if(dis<left_dis)\n st_angle=mid_angle;\n else \n end_angle=mid_angle;\n \n \n }\n double ans=(cmplete_revolutions*2*Math.PI*(double)r + 2*mid_angle*(double)r);\n ans=(double)ans/(double)v;\n System.out.println(ans);\n \n \n \n \n n--;\n }\n \n }\n \n}\n", "lang_cluster": "Java", "tags": ["geometry"], "code_uid": "de33f8f18d038ae752e56b1d4d9f133a", "src_uid": "3882f2c02e83bd2d55de8004ea3bbd88", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.text.DecimalFormat;\nimport java.text.NumberFormat;\n\npublic class P595D {\n private static final double TWO_PI = Math.PI * 2;\n\n private static double newton(double x) {\n double t = x/2;\n double nt = t - (t + Math.sin(t) - x)/(1 + Math.cos(t));\n while (Math.abs(nt-t) >= 1e-7) {\n t = nt;\n nt = t - (t + Math.sin(t) - x)/(1 + Math.cos(t));\n }\n return nt;\n }\n\n private static double minTime(long d, int r, int v) {\n final double th = d / (double)r;\n final double k = Math.floor(th/TWO_PI);\n final double x = th % TWO_PI;\n final double t = newton(x/2);\n return (2*t + k*TWO_PI) * r / v;\n }\n\n public static void main(String[] args) throws IOException {\n final NumberFormat formatter = new DecimalFormat(\"#.#######\");\n\n final BufferedReader in = new BufferedReader(\n new InputStreamReader(System.in));\n\n String[] s = in.readLine().split(\" \");\n final int n = Integer.parseInt(s[0]);\n final int r = Integer.parseInt(s[1]);\n final int v = Integer.parseInt(s[2]);\n for (int i = 0; i<n; i++) {\n s = in.readLine().split(\" \");\n final int si = Integer.parseInt(s[0]);\n final int fi = Integer.parseInt(s[1]);\n System.out.println(formatter.format(minTime(fi-si, r, v)));\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["geometry"], "code_uid": "6ac1bd987df4af71dff289a31c952a8a", "src_uid": "3882f2c02e83bd2d55de8004ea3bbd88", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.NoSuchElementException;\n\npublic class Main {\n public void solve() {\n\tFastScanner scanner = new FastScanner();\n\tint N = scanner.nextInt();\n\tfinal int R = scanner.nextInt();\n\tfinal double V = scanner.nextInt();\n\tfinal double cycle = 2.0 * Math.PI * R;\n\n\tStringBuilder builder = new StringBuilder();\n\tfor (int i = 0; i < N; i++) {\n\t int start = scanner.nextInt();\n\t int finish = scanner.nextInt();\n\t final int L = finish - start;\n\n\t int A = (int) (L / cycle);\n\t double rest = L - cycle * A;\n\t rest /= 2.0;\n\t double theta = 0.0;\n\t double low = 0, high = Math.PI;\n\t double plow = low, phigh = high;\n\t while (low < high) {\n\t\ttheta = (high + low) / 2.0;\n\t\tdouble x = R * theta + R * Math.sin(theta);\n\t\tif (x > rest) {\n\t\t high = theta;\n\t\t} else {\n\t\t low = theta;\n\t\t}\n\t\tif (plow == low && phigh == high) {\n\t\t break;\n\t\t}\n\t\tplow = low;\n\t\tphigh = high;\n\t }\n\n\t double dist = cycle * A + R * 2 * theta;\n\t dist /= V;\n\t builder.append(dist);\n\t builder.append(\"\\n\");\n\t}\n\tSystem.out.println(builder.toString());\n }\n\n public static void main(String[] args) {\n\tnew Main().solve();\n }\n\n}\n\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n\tif (ptr < buflen) {\n\t return true;\n\t} else {\n\t ptr = 0;\n\t try {\n\t\tbuflen = in.read(buffer);\n\t } catch (IOException e) {\n\t\te.printStackTrace();\n\t }\n\t if (buflen <= 0) {\n\t\treturn false;\n\t }\n\t}\n\treturn true;\n }\n\n private int readByte() {\n\tif (hasNextByte())\n\t return buffer[ptr++];\n\telse\n\t return -1;\n }\n\n private static boolean isPrintableChar(int c) {\n\treturn 33 <= c && c <= 126;\n }\n\n private void skipUnprintable() {\n\twhile (hasNextByte() && !isPrintableChar(buffer[ptr]))\n\t ptr++;\n }\n\n public boolean hasNext() {\n\tskipUnprintable();\n\treturn hasNextByte();\n }\n\n public String next() {\n\tif (!hasNext())\n\t throw new NoSuchElementException();\n\tStringBuilder sb = new StringBuilder();\n\tint b = readByte();\n\twhile (isPrintableChar(b)) {\n\t sb.appendCodePoint(b);\n\t b = readByte();\n\t}\n\treturn sb.toString();\n }\n\n public long nextLong() {\n\tif (!hasNext())\n\t throw new NoSuchElementException();\n\tlong n = 0;\n\tboolean minus = false;\n\tint b = readByte();\n\tif (b == '-') {\n\t minus = true;\n\t b = readByte();\n\t}\n\tif (b < '0' || '9' < b) {\n\t throw new NumberFormatException();\n\t}\n\twhile (true) {\n\t if ('0' <= b && b <= '9') {\n\t\tn *= 10;\n\t\tn += b - '0';\n\t } else if (b == -1 || !isPrintableChar(b)) {\n\t\treturn minus ? -n : n;\n\t } else {\n\t\tthrow new NumberFormatException();\n\t }\n\t b = readByte();\n\t}\n }\n\n public int nextInt() {\n\treturn (int) nextLong();\n\n }\n}", "lang_cluster": "Java", "tags": ["geometry"], "code_uid": "b6765c0c414fc61106d00a745e4b2e27", "src_uid": "3882f2c02e83bd2d55de8004ea3bbd88", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\nimport java.lang.Math;\n\npublic class D {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int n = scanner.nextInt();\n int r = scanner.nextInt();\n int v = scanner.nextInt();\n for(int i=0; i<n; ++i) {\n int s = scanner.nextInt();\n int f = scanner.nextInt();\n double d = f - s;\n int cycle = (int)(d/(2*Math.PI*r));\n d -= cycle*(2*Math.PI*r);\n System.out.println((cycle*(2*Math.PI*r) + r*D.bs(d, r))/v);\n }\n }\n\n public static double bs(double d, int r) {\n double l = 0;\n double u = Math.PI * 2;\n double middle=0;\n while(l<u) {\n middle = (l+u)/2;\n double value = D.eval(middle, r);\n if(value < d) {\n l = middle;\n }\n else {\n u = middle;\n }\n if(Math.abs(value-d) < 0.000001) return middle;\n }\n return middle;\n }\n public static double eval(double theta, double r) {\n return r*theta + 2 * r * Math.sin(theta/2);\n }\n}", "lang_cluster": "Java", "tags": ["geometry"], "code_uid": "cf722a8086d5f984ee3c225eaea2f639", "src_uid": "3882f2c02e83bd2d55de8004ea3bbd88", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class D {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int r = sc.nextInt();\n int v = sc.nextInt();\n for (int i = 0; i < n; i++) {\n int s = sc.nextInt();\n int f = sc.nextInt();\n double d = f - s;\n double p = 2 * Math.PI * r;\n d %= p;\n double min = 0, max = 2 * Math.PI;\n for (int j = 0; j < 100; j++) {\n double mid = (min + max) / 2;\n double dis = (mid + Math.sin(mid)) * r * 2;\n if (dis < d)\n min = mid;\n else\n max = mid;\n }\n double t1 = (f - s - d) / v;\n double t2 = (min + max) * r / v;\n if ((min + max) / 2 > Math.PI)\n System.out.println(\" = \" + (min + max) / 2);\n System.out.println(t1 + t2);\n }\n sc.close();\n }\n}\n", "lang_cluster": "Java", "tags": ["geometry"], "code_uid": "8fa2ac2e9364a6aea81c2e536782d7a8", "src_uid": "3882f2c02e83bd2d55de8004ea3bbd88", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class C329D\n{\n\nprivate static StringTokenizer st;\n \n public static void nextLine(BufferedReader br) throws IOException\n {\n st = new StringTokenizer(br.readLine());\n }\n \n public static int nextInt()\n {\n return Integer.parseInt(st.nextToken());\n }\n \n public static String next()\n {\n return st.nextToken();\n }\n \n public static long nextLong()\n {\n return Long.parseLong(st.nextToken());\n }\n\n public static double nextDouble()\n {\n return Double.parseDouble(st.nextToken());\n }\n \n public static void main(String[] args) throws IOException\n {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n /*\n for (double d = 0; d < 0.0001; d += 0.000001)\n {\n System.out.println(d + \" \" + test(d));\n System.out.println((Math.PI - d) + \" \" + test(Math.PI - d));\n }\n */\n \n nextLine(br);\n int n = nextInt();\n double r = nextInt();\n double v = nextInt();\n StringBuffer sb = new StringBuffer();\n for (int i = 0; i < n; i++)\n {\n nextLine(br);\n int start = nextInt();\n int finish = nextInt();\n double diff = finish - start;\n double ans = solve(diff, v, r);\n sb.append(String.valueOf(ans) + \"\\n\");\n }\n System.out.println(sb.toString());\n \n }\n \n public static double test(double in)\n {\n double left = 0;\n double right = 1;\n double rem = in;\n for (int i = 0; i < 100; i++)\n {\n double mid = (left + right) / 2;\n double temp = Math.PI * mid;\n double k = temp + Math.sin(temp);\n //if (in > 3.14) System.out.println(\"M\" + mid + \" \" + k);\n if (k > rem)\n {\n right = mid;\n }\n else\n {\n left = mid;\n }\n }\n return (left + right) / 2;\n }\n \n public static double solve(double d, double v, double r)\n {\n d = d / r;\n v = v / r;\n double circ = 2 * Math.PI;\n double rounds = Math.floor(d / circ);\n double rem = (d - rounds * circ) / 2;\n double left = 0;\n double right = 1;\n for (int i = 0; i < 100; i++)\n {\n double mid = (left + right) / 2;\n double temp = Math.PI * mid;\n double k = temp + Math.sin(temp);\n if (k > rem)\n {\n right = mid;\n }\n else\n {\n left = mid;\n }\n }\n //System.out.println(rounds + \" \" + rem + \" \" + left);\n \n double ans = ((left + rounds) * circ) / v;\n return ans;\n }\n\n}", "lang_cluster": "Java", "tags": ["geometry"], "code_uid": "ca82aa6e18d13798d11d66814563e5b5", "src_uid": "3882f2c02e83bd2d55de8004ea3bbd88", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.ArrayDeque;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\n\n/*\n\n */\n/**\n *\n * @author Andy Phan\n */\npublic class d {\n public static void main(String[] args) {\n FS in = new FS(System.in);\n PrintWriter out = new PrintWriter(System.out);\n \n int n = in.nextInt();\n double r = in.nextInt();\n double v = in.nextInt()/r; \n \n while(n-->0) {\n double dist = (-in.nextDouble()+in.nextDouble())/r;\n double a = 0;\n \n for(double pow = 1e9; pow >= 1e-7; pow /= 2) {\n if(v*(a+pow)+2*Math.abs(Math.sin((v*(a+pow))%(2*Math.PI)/2)) <= dist) a += pow;\n }\n System.out.println(a);\n }\n \n out.close();\n }\n \n static class FS {\n\n BufferedReader in;\n StringTokenizer token;\n \n public FS(InputStream str) {\n in = new BufferedReader(new InputStreamReader(str));\n }\n \n public String next() {\n if (token == null || !token.hasMoreElements()) {\n try {\n token = new StringTokenizer(in.readLine());\n } catch (IOException ex) {\n }\n return next();\n }\n return token.nextToken();\n }\n \n public int nextInt() {\n return Integer.parseInt(next());\n }\n \n public double nextDouble() {\n return Double.parseDouble(next());\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["geometry"], "code_uid": "39dfb55b05f03f02190a359670e3c8c8", "src_uid": "3882f2c02e83bd2d55de8004ea3bbd88", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Arrays;\nimport java.util.Scanner;\nimport java.util.function.Function;\n\npublic class WarriorAndArcher {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner input = new Scanner(System.in);\n\t\tint numberOfComp = input.nextInt();\n\t\tint radius = input.nextInt();\n\t\tint v = input.nextInt();\n\t\tint[] compStart = new int[numberOfComp];\n\t\tint[] compEnd = new int[numberOfComp];\n\t\tfor (int a = 0; a < numberOfComp; a++) {\n\t\t\tcompStart[a] = input.nextInt();\n\t\t\tcompEnd[a] = input.nextInt();\n\t\t}\n\t\tfor (int a = 0; a < numberOfComp; a++) {\n\t\t\tdouble turnfrac = (compEnd[a] - compStart[a])\n\t\t\t\t\t/ (2 * Math.PI * radius);\n\t\t\tint totalTurns = (int) turnfrac;\n\t\t\tdouble extraDistance = (turnfrac - totalTurns)\n\t\t\t\t\t* (2 * Math.PI * radius);\n\t\t\tdouble x0 = binarySearch((x) -> radius * x + 2 * Math.sin(x/2.0) * radius, 0, 2*Math.PI, extraDistance);\n\t\t\tdouble totalTurnsAnswer = x0/(2*Math.PI) + totalTurns;\n\t\t\tdouble fakeDistance = totalTurnsAnswer * 2 * Math.PI * radius;\n\t\t\tdouble time = fakeDistance/v;\n\t\t\tSystem.out.println(time);\n\t\t}\n\t}\n\n\tstatic double binarySearch(Function<Double, Double> f, double low,\n\t\t\tdouble high, double y) {\n\t\twhile (Math.ulp(low) < (high - low)) {\n\t\t\tdouble mid = (low + high) / 2.0;\n\t\t\tdouble midVal = f.apply(mid);\n\n\t\t\tif (midVal == y) // unlikely, but possible\n\t\t\t\treturn mid;\n\t\t\telse if (midVal < y)\n\t\t\t\tlow = mid;\n\t\t\telse if (midVal > y)\n\t\t\t\thigh = mid;\n\t\t}\n\t\treturn (low + high) / 2.0;\n\t}\n\n\t/* Outputs 10.000000 */\n\t\n\t// System.out.printf(\"%.6f%n\", x0);\n\n}\n", "lang_cluster": "Java", "tags": ["geometry"], "code_uid": "a999e3ec50e0c669f305a082fedf388b", "src_uid": "3882f2c02e83bd2d55de8004ea3bbd88", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class D {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int r = sc.nextInt();\n int v = sc.nextInt();\n for (int i = 0; i < n; i++) {\n int s = sc.nextInt();\n int f = sc.nextInt();\n double d = f - s;\n double p = 2 * Math.PI * r;\n d %= p;\n double min = 0, max = Math.PI;\n for (int j = 0; j < 100; j++) {\n double mid = (min + max) / 2;\n double dis = (mid + Math.sin(mid)) * r * 2;\n if (dis < d)\n min = mid;\n else\n max = mid;\n }\n double t1 = (f - s - d) / v;\n double t2 = (min + max) * r / v;\n System.out.println(t1 + t2);\n }\n sc.close();\n }\n}", "lang_cluster": "Java", "tags": ["geometry"], "code_uid": "d93d19fe072567740d80d231ed6604b0", "src_uid": "3882f2c02e83bd2d55de8004ea3bbd88", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author cunbidun\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n DPetyaAndColoring solver = new DPetyaAndColoring();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class DPetyaAndColoring {\n private static final int MOD = (int) 1e9 + 7;\n private int[] fac = new int[1000030];\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.nextInt();\n int m = in.nextInt();\n int k = in.nextInt();\n if (m == 1) {\n out.println(Op.powMod(k, n, MOD));\n return;\n }\n int ans = 0;\n fac[0] = 1;\n for (int i = 1; i <= 1000010; i++) {\n fac[i] = Op.mulMod(fac[i - 1], i, MOD);\n }\n int[][] C = MathAlgorithm.binomialTable(2010, MOD);\n int[][] f = new int[n + 1][n + 1];\n f[1][1] = 1;\n for (int i = 2; i <= n; i++) {\n for (int j = 1; j <= i; j++) {\n f[i][j] = Op.addMod(Op.mulMod(f[i - 1][j], j, MOD), f[i - 1][j - 1], MOD);\n }\n }\n for (int j = 0; j <= n; j++) {\n for (int i = j; i <= n; i++)\n if (2 * i - j <= k) {\n int tmp = C(k, 2 * i - j);\n tmp = Op.mulMod(tmp, C[2 * i - j][i - j], MOD);\n tmp = Op.mulMod(tmp, C[i][i - j], MOD);\n tmp = Op.mulMod(tmp, fac[i], MOD);\n tmp = Op.mulMod(tmp, fac[i], MOD);\n tmp = Op.mulMod(tmp, f[n][i], MOD);\n tmp = Op.mulMod(tmp, f[n][i], MOD);\n tmp = Op.mulMod(tmp, Op.powMod(j, n * (m - 2), MOD), MOD);\n ans = Op.addMod(tmp, ans, MOD);\n }\n }\n out.println(ans);\n }\n\n private int C(int n, int k) {\n return Op.mulMod(Op.mulMod(fac[n], Op.inv(fac[k], MOD), MOD), Op.inv(fac[n - k], MOD), MOD);\n }\n\n }\n\n static class Op {\n public static int addMod(int x, int y, int MOD) {\n return ((x + y) >= MOD ? x + y - MOD : x + y);\n }\n\n public static int mulMod(int x, int y, int MOD) {\n return (int) (((long) x * y) % MOD);\n }\n\n public static int powMod(int x, long p, int MOD) {\n if (p == 0) return 1;\n int t = powMod(x, p / 2, MOD);\n if ((p & 1) == 1)\n return mulMod(mulMod(t, t, MOD), x, MOD);\n return mulMod(t, t, MOD);\n }\n\n public static int inv(int x, int MOD) {\n return powMod(x, MOD - 2, MOD);\n }\n\n }\n\n static class MathAlgorithm {\n public static int[][] binomialTable(int n, int MOD) {\n int[][] c = new int[n + 1][n + 1];\n for (int i = 0; i <= n; i++)\n for (int j = 0; j <= i; j++)\n c[i][j] = (j == 0) ? 1 : Op.addMod(c[i - 1][j - 1], c[i - 1][j], MOD);\n return c;\n }\n\n }\n\n static class InputReader extends InputStream {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n private static boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics"], "code_uid": "4341724ab56bb0d32f66c22261223375", "src_uid": "f22f28e2d8933f4199ba5ccfc0de8cda", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// package QS.AA.NetworkFlow;\n\n// F. Anti-Palindromize\n// https://codeforces.com/contest/884/problem/F\n\nimport java.io.*;\nimport java.util.*;\npublic class CF_884F {\n\t\n\tpublic static final int MOD = 1000_000_000 + 7;\n\tpublic static final double EPS = 1e-6;\n\tpublic static final boolean DEBUG = true;\n\n\tpublic static void main(String[] args) throws java.io.IOException {\n\t\tfinal java.io.BufferedReader br = new java.io.BufferedReader(new java.io.InputStreamReader(System.in));\n\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tchar[] s = br.readLine().trim().toCharArray();\n\t\tString[] tokens = br.readLine().trim().split(\"\\\\s\");\n\t\tint[] beauty = new int[n];\n\t\t\n\t\tint ans = 0;\n\t\tint m = 0, x = 0, t = 0;\n\t\tint[] b = new int[101];\n\t\tint[] count = new int[26];\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tbeauty[i] = Integer.parseInt(tokens[i]);\n\t\t\tans += beauty[i];\n\t\t}\n\n\t\tfor (int i = 0; i < n / 2; i++) {\n\t\t\tif (s[i] == s[n-i-1]) {\n\t\t\t\tt++;\n\t\t\t\tcount[(int)(s[i] - 'a')]++;\n\t\t\t\tans -= Math.min(beauty[i], beauty[n-i-1]);\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor (int i = 0; i < 26 ; i++) {\n\t\t\tif (m < count[i]) {\n\t\t\t\tm = count[i];\n\t\t\t\tx = i;\n\t\t\t}\n\t\t}\n\n\t\tif (2 * m <= t) {\n\t\t\tSystem.out.println(ans);\n\t\t\treturn;\n\t\t}\n\t\tArrayList<Integer> list = new ArrayList<Integer>();\n\n\t\tfor (int i = 0; i < n/2; i++) {\n\t\t\tif ((int)(s[i] - 'a') != x && (int)(s[n-i-1] - 'a') != x && s[i] != s[n-i-1]) {\n\t\t\t\tlist.add(Math.min(beauty[i], beauty[n-i-1]));\n\t\t\t}\n\t\t}\n\n\t\tCollections.sort(list);\n\t\tfor (int i = 0; i < 2 * m - t; i++) {\n\t\t\tans -= list.get(i);\n\t\t}\n\t\tSystem.out.print(ans);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["greedy", "flows", "graphs"], "code_uid": "35fbaf0c55c74d0dbebc773abb7c5c6e", "src_uid": "896555ddb6e1c268cd7b3b6b063fce50", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "// practice with rainboy\nimport java.io.*;\nimport java.util.*;\n\npublic class CF884F extends PrintWriter {\n\tCF884F() { super(System.out, true); }\n\tScanner sc = new Scanner(System.in);\n\tpublic static void main(String[] $) {\n\t\tCF884F o = new CF884F(); o.main(); o.flush();\n\t}\n\n\tstatic final int A = 26, INF = 0x3f3f3f3f;\n\tint[] oo, oh; int __ = 1;\n\tint link(int o, int h) {\n\t\too[__] = o; oh[__] = h;\n\t\treturn __++;\n\t}\n\tint[] ii, jj, cc, ww, ww_; int m_;\n\tint[] ae, dd, kk, ff; int n_;\n\tint[] pq, iq; int cnt;\n\tvoid init() {\n\t\too = new int[1 + m_ * 2]; oh = new int[1 + m_ * 2];\n\t\tii = new int[m_]; jj = new int[m_];\n\t\tcc = new int[m_ << 1];\n\t\tww = new int[m_]; ww_ = new int[m_];\n\t\tae = new int[n_];\n\t\tdd = new int[n_]; kk = new int[n_]; ff = new int[n_];\n\t\tpq = new int[1 + n_]; iq = new int[n_];\n\t\tm_ = 0;\n\t}\n\tvoid link_(int i, int j, int c, int w) {\n\t\tint h = m_++;\n\t\tii[h] = i; jj[h] = j; cc[h << 1] = c; ww[h] = w;\n\t\tae[i] = link(ae[i], h << 1);\n\t\tae[j] = link(ae[j], h << 1 | 1);\n\t}\n\tboolean less(int u, int v) {\n\t\treturn dd[u] < dd[v] || dd[u] == dd[v] && kk[u] < kk[v];\n\t}\n\tint i2(int i) {\n\t\treturn (i *= 2) > cnt ? 0 : i < cnt && less(pq[i + 1], pq[i]) ? i + 1 : i;\n\t}\n\tvoid pq_up(int u) {\n\t\tint i, j, v;\n\t\tfor (i = iq[u]; (j = i / 2) > 0 && less(u, v = pq[j]); i = j)\n\t\t\tpq[iq[v] = i] = v;\n\t\tpq[iq[u] = i] = u;\n\t}\n\tvoid pq_dn(int u) {\n\t\tint i, j, v;\n\t\tfor (i = iq[u]; (j = i2(i)) > 0 && less(v = pq[j], u); i = j)\n\t\t\tpq[iq[v] = i] = v;\n\t\tpq[iq[u] = i] = u;\n\t}\n\tvoid pq_add_last(int u) {\n\t\tpq[iq[u] = ++cnt] = u;\n\t}\n\tint pq_remove_first() {\n\t\tint u = pq[1], v = pq[cnt--];\n\t\tif (v != u) {\n\t\t\tiq[v] = 1; pq_dn(v);\n\t\t}\n\t\tiq[u] = 0;\n\t\treturn u;\n\t}\n\tboolean dijkstra(int s, int t) {\n\t\tArrays.fill(dd, INF);\n\t\tdd[s] = 0; pq_add_last(s);\n\t\twhile (cnt > 0) {\n\t\t\tint i = pq_remove_first();\n\t\t\tint k = kk[i] + 1;\n\t\t\tfor (int o = ae[i]; o != 0; o = oo[o]) {\n\t\t\t\tint h_ = oh[o];\n\t\t\t\tif (cc[h_] > 0) {\n\t\t\t\t\tint h = h_ >> 1;\n\t\t\t\t\tint j = i ^ ii[h] ^ jj[h];\n\t\t\t\t\tint d = dd[i] + ((h_ & 1) == 0 ? ww_[h] : -ww_[h]);\n\t\t\t\t\tif (dd[j] > d || dd[j] == d && kk[j] > k) {\n\t\t\t\t\t\tif (dd[j] == INF)\n\t\t\t\t\t\t\tpq_add_last(j);\n\t\t\t\t\t\tdd[j] = d; kk[j] = k; ff[j] = h_;\n\t\t\t\t\t\tpq_up(j);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn dd[t] != INF;\n\t}\n\tint trace(int s, int t) {\n\t\twhile (t != s) {\n\t\t\tint h_ = ff[t], h = h_ >> 1;\n\t\t\tcc[h_]--; cc[h_ ^ 1]++;\n\t\t\tt ^= ii[h] ^ jj[h];\n\t\t}\n\t\treturn 1;\n\t}\n\tint edmonds_karp(int s, int t) {\n\t\tfor (int h = 0; h < m_; h++) {\n\t\t\tint i = ii[h], j = jj[h];\n\t\t\tdd[j] = Math.min(dd[j], dd[i] + ww[h]);\n\t\t}\n\t\tfor (int h = 0; h < m_; h++) {\n\t\t\tint i = ii[h], j = jj[h];\n\t\t\tww_[h] = ww[h] + dd[i] - dd[j];\n\t\t}\n\t\tint f = 0;\n\t\twhile (dijkstra(s, t)) {\n\t\t\tf += trace(s, t);\n\t\t\tfor (int h = 0; h < m_; h++) {\n\t\t\t\tint i = ii[h], j = jj[h];\n\t\t\t\tif (dd[i] != INF && dd[j] != INF) {\n\t\t\t\t\t// dd[j] <= dd[i] + ww_[h]\n\t\t\t\t\t// ww_[h] + dd[i] - dd[j] >= 0\n\t\t\t\t\tww_[h] += dd[i] - dd[j];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint cost = 0;\n\t\tfor (int h = 0; h < m_; h++)\n\t\t\tcost += ww[h] * cc[h << 1 | 1];\n\t\treturn cost;\n\t}\n\tvoid main() {\n\t\tint n = sc.nextInt() / 2;\n\t\tn_ = 1 + n + A + 1;\n\t\tm_ = n + n * A + A;\n\t\tinit();\n\t\tbyte[] cc = sc.next().getBytes();\n\t\tint[] bb = new int[n * 2];\n\t\tfor (int i = 0; i < n * 2; i++)\n\t\t\tbb[i] = sc.nextInt();\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tlink_(0, 1 + i, 2, 0);\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint j = n * 2 - 1 - i;\n\t\t\tint ai = cc[i] - 'a';\n\t\t\tint aj = cc[j] - 'a';\n\t\t\tfor (int a = 0; a < A; a++) {\n\t\t\t\tint b;\n\t\t\t\tif (a == ai && a == aj)\n\t\t\t\t\tb = Math.max(bb[i], bb[j]);\n\t\t\t\telse if (a == ai)\n\t\t\t\t\tb = bb[i];\n\t\t\t\telse if (a == aj)\n\t\t\t\t\tb = bb[j];\n\t\t\t\telse\n\t\t\t\t\tb = 0;\n\t\t\t\tlink_(1 + i, 1 + n + a, 1, -b);\n\t\t\t}\n\t\t}\n\t\tint[] kk = new int[A];\n\t\tfor (int i = 0; i < n * 2; i++) {\n\t\t\tint a = cc[i] - 'a';\n\t\t\tkk[a]++;\n\t\t}\n\t\tfor (int a = 0; a < A; a++)\n\t\t\tlink_(1 + n + a, n_ - 1, kk[a], 0);\n\t\tprintln(-edmonds_karp(0, n_ - 1));\n\t}\n}\n", "lang_cluster": "Java", "tags": ["greedy", "flows", "graphs"], "code_uid": "b9f6151f3290848d978a8f30b05e7399", "src_uid": "896555ddb6e1c268cd7b3b6b063fce50", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.io.OutputStreamWriter;\nimport java.util.NoSuchElementException;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Iterator;\nimport java.io.BufferedWriter;\nimport java.io.IOException;\nimport java.io.Writer;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Junior\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n TaskF solver = new TaskF();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskF {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n = in.nextInt();\n String s = in.nextString();\n int[] a = new int[n];\n int[] cnt = new int[26];\n for (int i = 0; i < n; ++i) {\n a[i] = in.nextInt();\n cnt[(int) s.charAt(i) - 'a']++;\n }\n Graph g = new Graph(n + 100);\n int source = n + 100 - 2, target = source + 1;\n for (int i = 0; i * 2 < n; ++i) g.addFlowWeightedEdge(i, target, 0, 2);\n for (int i = 0; i < 26; ++i) {\n g.addFlowWeightedEdge(source, i + n, 0, cnt[i]);\n for (int j = 0; j * 2 < n; ++j) {\n if (s.charAt(j) == s.charAt(n - j - 1)) {\n int w = 0;\n if (s.charAt(j) == i + 'a') w = -Math.max(a[j], a[n - j - 1]);\n g.addFlowWeightedEdge(i + n, j, w, 1);\n } else {\n int w = 0;\n if (s.charAt(j) == i + 'a') w -= a[j];\n if (s.charAt(n - j - 1) == i + 'a') w -= a[n - j - 1];\n g.addFlowWeightedEdge(i + n, j, w, 1);\n }\n }\n }\n MinCostFlow mcmf = new MinCostFlow(g, source, target, true);\n out.println(-mcmf.minCostMaxFlow().first);\n\n }\n\n }\n\n static interface IntComparator {\n public static final IntComparator DEFAULT = (first, second) -> {\n if (first < second) {\n return -1;\n }\n if (first > second) {\n return 1;\n }\n return 0;\n };\n\n public int compare(int first, int second);\n\n }\n\n static interface IntStream extends Iterable<Integer>, Comparable<IntStream> {\n public IntIterator intIterator();\n\n default public Iterator<Integer> iterator() {\n return new Iterator<Integer>() {\n private IntIterator it = intIterator();\n\n public boolean hasNext() {\n return it.isValid();\n }\n\n public Integer next() {\n int result = it.value();\n it.advance();\n return result;\n }\n };\n }\n\n default public int compareTo(IntStream c) {\n IntIterator it = intIterator();\n IntIterator jt = c.intIterator();\n while (it.isValid() && jt.isValid()) {\n int i = it.value();\n int j = jt.value();\n if (i < j) {\n return -1;\n } else if (i > j) {\n return 1;\n }\n it.advance();\n jt.advance();\n }\n if (it.isValid()) {\n return 1;\n }\n if (jt.isValid()) {\n return -1;\n }\n return 0;\n }\n\n }\n\n static class Graph {\n public static final int REMOVED_BIT = 0;\n protected int vertexCount;\n protected int edgeCount;\n private int[] firstOutbound;\n private int[] firstInbound;\n private Edge[] edges;\n private int[] nextInbound;\n private int[] nextOutbound;\n private int[] from;\n private int[] to;\n private long[] weight;\n public long[] capacity;\n private int[] reverseEdge;\n private int[] flags;\n\n public Graph(int vertexCount) {\n this(vertexCount, vertexCount);\n }\n\n public Graph(int vertexCount, int edgeCapacity) {\n this.vertexCount = vertexCount;\n firstOutbound = new int[vertexCount];\n Arrays.fill(firstOutbound, -1);\n\n from = new int[edgeCapacity];\n to = new int[edgeCapacity];\n nextOutbound = new int[edgeCapacity];\n flags = new int[edgeCapacity];\n }\n\n public int addEdge(int fromID, int toID, long weight, long capacity, int reverseEdge) {\n ensureEdgeCapacity(edgeCount + 1);\n if (firstOutbound[fromID] != -1) {\n nextOutbound[edgeCount] = firstOutbound[fromID];\n } else {\n nextOutbound[edgeCount] = -1;\n }\n firstOutbound[fromID] = edgeCount;\n if (firstInbound != null) {\n if (firstInbound[toID] != -1) {\n nextInbound[edgeCount] = firstInbound[toID];\n } else {\n nextInbound[edgeCount] = -1;\n }\n firstInbound[toID] = edgeCount;\n }\n this.from[edgeCount] = fromID;\n this.to[edgeCount] = toID;\n if (capacity != 0) {\n if (this.capacity == null) {\n this.capacity = new long[from.length];\n }\n this.capacity[edgeCount] = capacity;\n }\n if (weight != 0) {\n if (this.weight == null) {\n this.weight = new long[from.length];\n }\n this.weight[edgeCount] = weight;\n }\n if (reverseEdge != -1) {\n if (this.reverseEdge == null) {\n this.reverseEdge = new int[from.length];\n Arrays.fill(this.reverseEdge, 0, edgeCount, -1);\n }\n this.reverseEdge[edgeCount] = reverseEdge;\n }\n if (edges != null) {\n edges[edgeCount] = createEdge(edgeCount);\n }\n return edgeCount++;\n }\n\n protected final GraphEdge createEdge(int id) {\n return new GraphEdge(id);\n }\n\n public final int addFlowWeightedEdge(int from, int to, long weight, long capacity) {\n if (capacity == 0) {\n return addEdge(from, to, weight, 0, -1);\n } else {\n int lastEdgeCount = edgeCount;\n addEdge(to, from, -weight, 0, lastEdgeCount + entriesPerEdge());\n return addEdge(from, to, weight, capacity, lastEdgeCount);\n }\n }\n\n protected int entriesPerEdge() {\n return 1;\n }\n\n public final int vertexCount() {\n return vertexCount;\n }\n\n public final int firstOutbound(int vertex) {\n int id = firstOutbound[vertex];\n while (id != -1 && isRemoved(id)) {\n id = nextOutbound[id];\n }\n return id;\n }\n\n public final int nextOutbound(int id) {\n id = nextOutbound[id];\n while (id != -1 && isRemoved(id)) {\n id = nextOutbound[id];\n }\n return id;\n }\n\n public final int source(int id) {\n return from[id];\n }\n\n public final int destination(int id) {\n return to[id];\n }\n\n public final long weight(int id) {\n if (weight == null) {\n return 0;\n }\n return weight[id];\n }\n\n public final long capacity(int id) {\n if (capacity == null) {\n return 0;\n }\n return capacity[id];\n }\n\n public final long flow(int id) {\n if (reverseEdge == null) {\n return 0;\n }\n return capacity[reverseEdge[id]];\n }\n\n public final void pushFlow(int id, long flow) {\n if (flow == 0) {\n return;\n }\n if (flow > 0) {\n if (capacity(id) < flow) {\n throw new IllegalArgumentException(\"Not enough capacity\");\n }\n } else {\n if (flow(id) < -flow) {\n throw new IllegalArgumentException(\"Not enough capacity\");\n }\n }\n capacity[id] -= flow;\n capacity[reverseEdge[id]] += flow;\n }\n\n public final boolean flag(int id, int bit) {\n return (flags[id] >> bit & 1) != 0;\n }\n\n public final boolean isRemoved(int id) {\n return flag(id, REMOVED_BIT);\n }\n\n protected void ensureEdgeCapacity(int size) {\n if (from.length < size) {\n int newSize = Math.max(size, 2 * from.length);\n if (edges != null) {\n edges = resize(edges, newSize);\n }\n from = resize(from, newSize);\n to = resize(to, newSize);\n nextOutbound = resize(nextOutbound, newSize);\n if (nextInbound != null) {\n nextInbound = resize(nextInbound, newSize);\n }\n if (weight != null) {\n weight = resize(weight, newSize);\n }\n if (capacity != null) {\n capacity = resize(capacity, newSize);\n }\n if (reverseEdge != null) {\n reverseEdge = resize(reverseEdge, newSize);\n }\n flags = resize(flags, newSize);\n }\n }\n\n protected final int[] resize(int[] array, int size) {\n int[] newArray = new int[size];\n System.arraycopy(array, 0, newArray, 0, array.length);\n return newArray;\n }\n\n private long[] resize(long[] array, int size) {\n long[] newArray = new long[size];\n System.arraycopy(array, 0, newArray, 0, array.length);\n return newArray;\n }\n\n private Edge[] resize(Edge[] array, int size) {\n Edge[] newArray = new Edge[size];\n System.arraycopy(array, 0, newArray, 0, array.length);\n return newArray;\n }\n\n public final boolean isSparse() {\n return vertexCount == 0 || edgeCount * 20 / vertexCount <= vertexCount;\n }\n\n protected class GraphEdge implements Edge {\n protected int id;\n\n protected GraphEdge(int id) {\n this.id = id;\n }\n\n }\n\n }\n\n static interface IntCollection extends IntStream {\n }\n\n static class MinCostFlow {\n private final Graph graph;\n private final int source;\n private final int destination;\n private final long[] phi;\n private final long[] dijkstraResult;\n private final int[] lastEdge;\n private final Heap heap;\n private final int vertexCount;\n private final int[] visited;\n private int visitIndex;\n\n public MinCostFlow(Graph graph, int source, int destination, boolean hasNegativeEdges) {\n this.graph = graph;\n this.source = source;\n this.destination = destination;\n vertexCount = graph.vertexCount();\n phi = new long[vertexCount];\n if (hasNegativeEdges) {\n fordBellman();\n }\n dijkstraResult = new long[vertexCount];\n lastEdge = new int[vertexCount];\n if (graph.isSparse()) {\n heap = new Heap(vertexCount, new IntComparator() {\n public int compare(int first, int second) {\n return IntegerUtils.longCompare(dijkstraResult[first], dijkstraResult[second]);\n }\n }, vertexCount);\n visited = null;\n } else {\n heap = null;\n visited = new int[vertexCount];\n }\n }\n\n private void fordBellman() {\n Arrays.fill(phi, Long.MAX_VALUE);\n phi[source] = 0;\n boolean[] inQueue = new boolean[vertexCount];\n int[] queue = new int[vertexCount + 1];\n queue[0] = source;\n inQueue[source] = true;\n int stepCount = 0;\n int head = 0;\n int end = 1;\n int maxSteps = 2 * vertexCount * vertexCount;\n while (head != end) {\n int vertex = queue[head++];\n if (head == queue.length) {\n head = 0;\n }\n inQueue[vertex] = false;\n int edgeID = graph.firstOutbound(vertex);\n while (edgeID != -1) {\n long total = phi[vertex] + graph.weight(edgeID);\n int destination = graph.destination(edgeID);\n if (graph.capacity(edgeID) != 0 && phi[destination] > total) {\n phi[destination] = total;\n if (!inQueue[destination]) {\n queue[end++] = destination;\n inQueue[destination] = true;\n if (end == queue.length) {\n end = 0;\n }\n }\n }\n edgeID = graph.nextOutbound(edgeID);\n }\n if (++stepCount > maxSteps) {\n throw new IllegalArgumentException(\"Graph contains negative cycle\");\n }\n }\n }\n\n public Pair<Long, Long> minCostMaxFlow() {\n return minCostMaxFlow(Long.MAX_VALUE);\n }\n\n public Pair<Long, Long> minCostMaxFlow(long maxFlow) {\n long cost = 0;\n long flow = 0;\n while (maxFlow != 0) {\n if (graph.isSparse()) {\n dijkstraAlgorithm();\n } else {\n dijkstraAlgorithmFull();\n }\n if (lastEdge[destination] == -1) {\n return Pair.makePair(cost, flow);\n }\n for (int i = 0; i < dijkstraResult.length; i++) {\n if (dijkstraResult[i] != Long.MAX_VALUE) {\n phi[i] += dijkstraResult[i];\n }\n }\n int vertex = destination;\n long currentFlow = maxFlow;\n long currentCost = 0;\n while (vertex != source) {\n int edgeID = lastEdge[vertex];\n currentFlow = Math.min(currentFlow, graph.capacity(edgeID));\n currentCost += graph.weight(edgeID);\n vertex = graph.source(edgeID);\n }\n maxFlow -= currentFlow;\n cost += currentCost * currentFlow;\n flow += currentFlow;\n vertex = destination;\n while (vertex != source) {\n int edgeID = lastEdge[vertex];\n graph.pushFlow(edgeID, currentFlow);\n vertex = graph.source(edgeID);\n }\n }\n return Pair.makePair(cost, flow);\n }\n\n private void dijkstraAlgorithm() {\n Arrays.fill(dijkstraResult, Long.MAX_VALUE);\n Arrays.fill(lastEdge, -1);\n dijkstraResult[source] = 0;\n heap.add(source);\n while (!heap.isEmpty()) {\n int current = heap.poll();\n int edgeID = graph.firstOutbound(current);\n while (edgeID != -1) {\n if (graph.capacity(edgeID) != 0) {\n int next = graph.destination(edgeID);\n long total = graph.weight(edgeID) - phi[next] + phi[current] + dijkstraResult[current];\n if (dijkstraResult[next] > total) {\n dijkstraResult[next] = total;\n if (heap.getIndex(next) == -1) {\n heap.add(next);\n } else {\n heap.shiftUp(heap.getIndex(next));\n }\n lastEdge[next] = edgeID;\n }\n }\n edgeID = graph.nextOutbound(edgeID);\n }\n }\n }\n\n private void dijkstraAlgorithmFull() {\n visitIndex++;\n Arrays.fill(dijkstraResult, Long.MAX_VALUE);\n lastEdge[destination] = -1;\n dijkstraResult[source] = 0;\n for (int i = 0; i < vertexCount; i++) {\n int index = -1;\n long length = Long.MAX_VALUE;\n for (int j = 0; j < vertexCount; j++) {\n if (visited[j] != visitIndex && dijkstraResult[j] < length) {\n length = dijkstraResult[j];\n index = j;\n }\n }\n if (index == -1) {\n return;\n }\n visited[index] = visitIndex;\n int edgeID = graph.firstOutbound(index);\n while (edgeID != -1) {\n if (graph.capacity(edgeID) != 0) {\n int next = graph.destination(edgeID);\n if (visited[next] != visitIndex) {\n long total = graph.weight(edgeID) - phi[next] + phi[index] + length;\n if (dijkstraResult[next] > total) {\n dijkstraResult[next] = total;\n lastEdge[next] = edgeID;\n }\n }\n }\n edgeID = graph.nextOutbound(edgeID);\n }\n }\n }\n\n }\n\n static interface Edge {\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void println(long i) {\n writer.println(i);\n }\n\n }\n\n static interface IntQueue extends IntCollection {\n }\n\n static interface IntIterator {\n public int value() throws NoSuchElementException;\n\n public boolean advance();\n\n public boolean isValid();\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public String nextString() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n StringBuilder res = new StringBuilder();\n do {\n if (Character.isValidCodePoint(c)) {\n res.appendCodePoint(c);\n }\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n\n static class IntegerUtils {\n public static int longCompare(long a, long b) {\n if (a < b) {\n return -1;\n }\n if (a > b) {\n return 1;\n }\n return 0;\n }\n\n }\n\n static class Pair<U, V> implements Comparable<Pair<U, V>> {\n public final U first;\n public final V second;\n\n public static <U, V> Pair<U, V> makePair(U first, V second) {\n return new Pair<U, V>(first, second);\n }\n\n private Pair(U first, V second) {\n this.first = first;\n this.second = second;\n }\n\n\n public boolean equals(Object o) {\n if (this == o) {\n return true;\n }\n if (o == null || getClass() != o.getClass()) {\n return false;\n }\n\n Pair pair = (Pair) o;\n\n return !(first != null ? !first.equals(pair.first) : pair.first != null) &&\n !(second != null ? !second.equals(pair.second) : pair.second != null);\n }\n\n\n public int hashCode() {\n int result = first != null ? first.hashCode() : 0;\n result = 31 * result + (second != null ? second.hashCode() : 0);\n return result;\n }\n\n\n public String toString() {\n return \"(\" + first + \",\" + second + \")\";\n }\n\n @SuppressWarnings({\"unchecked\"})\n public int compareTo(Pair<U, V> o) {\n int value = ((Comparable<U>) first).compareTo(o.first);\n if (value != 0) {\n return value;\n }\n return ((Comparable<V>) second).compareTo(o.second);\n }\n\n }\n\n static class Heap implements IntQueue {\n private IntComparator comparator;\n private int size = 0;\n private int[] elements;\n private int[] at;\n\n public Heap(int maxElement) {\n this(10, maxElement);\n }\n\n public Heap(IntComparator comparator, int maxElement) {\n this(10, comparator, maxElement);\n }\n\n public Heap(int capacity, int maxElement) {\n this(capacity, IntComparator.DEFAULT, maxElement);\n }\n\n public Heap(int capacity, IntComparator comparator, int maxElement) {\n this.comparator = comparator;\n elements = new int[capacity];\n at = new int[maxElement];\n Arrays.fill(at, -1);\n }\n\n public boolean isEmpty() {\n return size == 0;\n }\n\n public void add(int element) {\n ensureCapacity(size + 1);\n elements[size] = element;\n at[element] = size;\n shiftUp(size++);\n }\n\n public void shiftUp(int index) {\n //\t\tif (index < 0 || index >= size)\n //\t\t\tthrow new IllegalArgumentException();\n int value = elements[index];\n while (index != 0) {\n int parent = (index - 1) >>> 1;\n int parentValue = elements[parent];\n if (comparator.compare(parentValue, value) <= 0) {\n elements[index] = value;\n at[value] = index;\n return;\n }\n elements[index] = parentValue;\n at[parentValue] = index;\n index = parent;\n }\n elements[0] = value;\n at[value] = 0;\n }\n\n public void shiftDown(int index) {\n if (index < 0 || index >= size) {\n throw new IllegalArgumentException();\n }\n while (true) {\n int child = (index << 1) + 1;\n if (child >= size) {\n return;\n }\n if (child + 1 < size && comparator.compare(elements[child], elements[child + 1]) > 0) {\n child++;\n }\n if (comparator.compare(elements[index], elements[child]) <= 0) {\n return;\n }\n swap(index, child);\n index = child;\n }\n }\n\n public int getIndex(int element) {\n return at[element];\n }\n\n private void swap(int first, int second) {\n int temp = elements[first];\n elements[first] = elements[second];\n elements[second] = temp;\n at[elements[first]] = first;\n at[elements[second]] = second;\n }\n\n private void ensureCapacity(int size) {\n if (elements.length < size) {\n int[] oldElements = elements;\n elements = new int[Math.max(2 * elements.length, size)];\n System.arraycopy(oldElements, 0, elements, 0, this.size);\n }\n }\n\n public int poll() {\n if (isEmpty()) {\n throw new IndexOutOfBoundsException();\n }\n int result = elements[0];\n at[result] = -1;\n if (size == 1) {\n size = 0;\n return result;\n }\n elements[0] = elements[--size];\n at[elements[0]] = 0;\n shiftDown(0);\n return result;\n }\n\n\n public IntIterator intIterator() {\n return new IntIterator() {\n private int at;\n\n\n public int value() throws NoSuchElementException {\n return elements[at];\n }\n\n\n public boolean advance() throws NoSuchElementException {\n return ++at < size;\n }\n\n\n public boolean isValid() {\n return at < size;\n }\n\n\n public void remove() throws NoSuchElementException {\n throw new UnsupportedOperationException();\n }\n };\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["greedy", "flows", "graphs"], "code_uid": "0897cc470675d8e4ece897d6ddddfc16", "src_uid": "896555ddb6e1c268cd7b3b6b063fce50", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\nimport static java.util.Arrays.stream;\nimport static java.util.stream.Collectors.toMap;\n\npublic class Main {\n static int n;\n static char[] chars;\n static int[] vals;\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n n = sc.nextInt();\n sc.nextLine();\n String s = sc.nextLine().trim();\n chars = s.toCharArray();\n\n vals = new int[n];\n for (int i = 0; i < n; i ++) {\n vals[i] = sc.nextInt();\n }\n sc.nextLine();\n\n List<Char> wrongChars = new ArrayList<>();\n List<Char> chars1 = new ArrayList<>();\n for (int i = 0; i < n / 2; i++) {\n if (vals[i] > vals[n - i - 1]) {\n swap(i);\n }\n\n Char chr = new Char(chars[i], vals[i], i);\n if (chars[i] == chars[n - i - 1]) {\n wrongChars.add(chr);\n }\n chars1.add(chr);\n }\n chars1.sort(Comparator.comparing(c -> c.val));\n\n int diff = 0;\n// int[] vals1 = Arrays.copyOf(vals, n/2);\n if (!isAntiPalindrome(chars)) {\n if (wrongChars.size() == 1) {\n Char wrongChar = wrongChars.get(0);\n for (int i = 0; i < n/2; i++) {\n Char chr = chars1.get(i);\n if (chr.chr != wrongChar.chr && chars[n - chr.idx - 1] != wrongChar.chr) {\n diff = wrongChar.val + chr.val;\n break;\n }\n }\n } else if (wrongChars.size() > 1) {\n Map<Character, Integer> map = wrongChars.stream().collect(toMap(n -> n.chr, n -> 1, (a, b) -> a+1, TreeMap::new));\n Map.Entry<Character, Integer> max = map.entrySet().stream().max(Comparator.comparing(Map.Entry::getValue)).get();\n List<Char> append = new ArrayList<>();\n while (max.getValue() * 2 > wrongChars.size() + append.size()) {\n Character maxChar = max.getKey();\n for (int i = 0; i < n/2; i++) {\n Char chr = chars1.get(i);\n if (chr.chr != maxChar && chars[n - chr.idx - 1] != maxChar && !wrongChars.contains(chr) && !append.contains(chr)) {\n append.add(chr);\n break;\n }\n }\n }\n diff = wrongChars.stream().mapToInt(chr -> chr.val).sum() + append.stream().mapToInt(chr -> chr.val).sum();\n }\n }\n\n int sum = stream(vals).sum();\n System.out.println(sum - diff);\n }\n\n private static void swap(int i) {\n char tmp = chars[i];\n chars[i] = chars[n - i - 1];\n chars[n - i - 1] = tmp;\n\n int tmpVal = vals[i];\n vals[i] = vals[n - i - 1];\n vals[n - i - 1] = tmpVal;\n }\n\n private static void swap(int i, int j) {\n char tmp = chars[i];\n chars[i] = chars[j];\n chars[j] = tmp;\n\n int tmpVal = vals[i];\n vals[i] = vals[n - i - 1];\n vals[n - i - 1] = tmpVal;\n }\n\n private static boolean isAntiPalindrome(char[] chars) {\n int n = chars.length;\n for (int i = 0; i < n/2; i++) {\n if (chars[i] == chars[n - i - 1]) {\n return false;\n }\n }\n return true;\n }\n\n static class Char {\n char chr;\n int val;\n int idx;\n\n Char(char chr, int val, int idx) {\n this.chr = chr;\n this.val = val;\n this.idx = idx;\n }\n\n @Override\n public String toString() {\n return \"Char{\" +\n \"chr=\" + chr +\n \", val=\" + val +\n \", idx=\" + idx +\n '}';\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["greedy", "flows", "graphs"], "code_uid": "76212d15fb26f5c7257138865c841f59", "src_uid": "896555ddb6e1c268cd7b3b6b063fce50", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.util.Collections;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n AntiPalindrome solver = new AntiPalindrome();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class AntiPalindrome {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int N = in.nextInt();\n int[] cnt = new int[26];\n int move = 0;\n char[] str = in.next().toCharArray();\n int[] b = new int[N];\n int res = 0;\n for (int i = 0; i < b.length; i++) {\n b[i] = in.nextInt();\n res += b[i];\n }\n for (int i = 0; i < N / 2; i++) {\n if (str[i] == str[N - i - 1]) {\n cnt[str[i] - 'a']++;\n move++;\n res -= Math.min(b[i], b[N - i - 1]);\n }\n }\n for (int i = 0; i < 26; i++) {\n if (cnt[i] > move / 2) {\n int left = cnt[i] * 2 - move;\n ArrayList<Integer> pos = new ArrayList<>();\n for (int j = 0; j < N / 2; j++) {\n if (str[j] != str[N - j - 1]) {\n if (str[N - j - 1] - 'a' == i || str[j] - 'a' == i) {\n// if (str[j] -'a' == i) {\n// pos.add(b[j]);\n// }\n// else {\n// pos.add(b[N-j-1]);\n// }\n } else {\n pos.add(Math.min(b[N - j - 1], b[j]));\n }\n }\n }\n Collections.sort(pos);\n for (int j = 0; j < left; j++) {\n res -= pos.get(j);\n }\n }\n }\n out.println(res);\n }\n\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["greedy", "flows", "graphs"], "code_uid": "ee19305361c19e21c22519df88265124", "src_uid": "896555ddb6e1c268cd7b3b6b063fce50", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.List;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.util.Collections;\nimport java.util.ArrayList;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author svilen.marchev@gmail.com\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskF solver = new TaskF();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskF {\n int n;\n char[] s;\n int[] beauty;\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n n = in.readInt();\n s = in.readString().toCharArray();\n beauty = new int[n];\n int totalBeauty = 0;\n for (int i = 0; i < n; ++i) {\n beauty[i] = in.readInt();\n totalBeauty += beauty[i];\n }\n\n // Find all pairs of indices (i, n-1-i) for which s[i]=s[n-1-i] and the most common char among those pairs.\n List<Integer> equalPairs = new ArrayList<>(n / 2);\n int[] charOccurrencesInEqualPairs = new int[128];\n char mostCommonCharInEqualPairs = 'a';\n for (int i = 0; i < n / 2; ++i) {\n if (s[i] == s[n - 1 - i]) {\n equalPairs.add(i);\n if (++charOccurrencesInEqualPairs[s[i]] > charOccurrencesInEqualPairs[mostCommonCharInEqualPairs]) {\n mostCommonCharInEqualPairs = s[i];\n }\n }\n }\n\n // These pairs must be broken up in any case, so account for them in the answer.\n int ans = totalBeauty;\n for (int equalPair : equalPairs) {\n ans -= Math.min(beauty[equalPair], beauty[n - 1 - equalPair]);\n }\n\n // If more than half of the pairs are with the same char, then we would not be able to reshuffle\n // the chars within the pairs, so we would need to break up some of the pairs with non-equal chars.\n // We would need to consider only pairs for which the chars are different AND neither of the two\n // chars is equal to the most common char in the \"equal\" pairs (otherwise swapping that char with\n // either of the chars in the \"non-equal\" pair would result in a non-palindromic pair).\n if (charOccurrencesInEqualPairs[mostCommonCharInEqualPairs] > equalPairs.size() / 2) {\n List<Integer> nonEqualPairsMinBeautyPenalties = new ArrayList<>(n / 2);\n for (int i = 0; i < n / 2; ++i) {\n if (s[i] != s[n - 1 - i] && s[i] != mostCommonCharInEqualPairs && s[n - 1 - i] != mostCommonCharInEqualPairs) {\n nonEqualPairsMinBeautyPenalties.add(Math.min(beauty[i], beauty[n - 1 - i]));\n }\n }\n Collections.sort(nonEqualPairsMinBeautyPenalties);\n int rem = 2 * charOccurrencesInEqualPairs[mostCommonCharInEqualPairs] - equalPairs.size();\n for (int i = 0; i < rem; ++i) {\n ans -= nonEqualPairsMinBeautyPenalties.get(i);\n }\n }\n\n out.println(ans);\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public String readString() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n StringBuilder res = new StringBuilder();\n do {\n if (Character.isValidCodePoint(c)) {\n res.appendCodePoint(c);\n }\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["greedy", "flows", "graphs"], "code_uid": "bf22a45e94f33c17ba5caff2eae48db0", "src_uid": "896555ddb6e1c268cd7b3b6b063fce50", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.lang.reflect.Array;\nimport java.util.*;\n\n/**\n * Created by nadya on 28/10/17.\n */\npublic class Educational {\n public static void main(String[] args) throws IOException {\n Educational c = new Educational();\n c.start();\n }\n\n private void start() throws IOException {\n BufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer str = new StringTokenizer(in.readLine());\n int n = Integer.parseInt(str.nextToken());\n String s = in.readLine();\n int b[] = new int[n];\n TreeMap<Integer, Set<Integer>> w = new TreeMap<Integer, Set<Integer>>();\n\n\n str = new StringTokenizer(in.readLine());\n for (int i = 0; i < n; ++i) {\n b[i] = Integer.parseInt(str.nextToken());\n }\n char[] res = s.toCharArray();\n\n\n HashSet<Integer> waitingList = new HashSet<Integer>();\n for (int i = 0; i < n / 2; ++i) {\n if (res[i] == res[getvisavis(n, i)]) {\n if (waitingList.isEmpty()) {\n waitingList.add(i);\n } else {\n boolean found = false;\n for (Integer j : waitingList) {\n if (res[j] != res[i]) {\n int minB1 = b[j] < b[getvisavis(n, j)] ? j : getvisavis(n, j);\n int minB2 = b[i] < b[getvisavis(n, i)] ? i : getvisavis(n, i);\n swap(res, minB1, minB2);\n b[minB1] = 0;\n b[minB2] = 0;\n waitingList.remove(j);\n found = true;\n break;\n }\n }\n if (! found) waitingList.add(i);\n }\n }\n }\n for (int i = 0; i < n / 2; ++i) {\n if (res[i] == res[getvisavis(n, i)]) {\n // System.out.println(res[i]);\n }\n }\n\n\n w.put(0, new HashSet<Integer>());\n for (int i = 0; i < n; ++i) {\n // if (b[i] == 0) continue;\n if (!w.containsKey(b[i])) w.put(b[i], new HashSet<Integer>());\n w.get(b[i]).add(i);\n }\n\n\n for (int i = 0; i < n / 2; ++i) {\n if (res[i] == res[getvisavis(n, i)]) {\n\n boolean finished = false;\n\n int indexToChange = b[i] < b[getvisavis(n, i)] ? i : getvisavis(n, i);\n\n for (Map.Entry<Integer, Set<Integer>> l : w.entrySet()) {\n Set<Integer> candidates = l.getValue();\n for (Integer j : candidates) {\n if (j == i || j == indexToChange || res[indexToChange] == res[j] || res[indexToChange] == res[getvisavis(n, j)]) {\n continue;\n }\n\n swap(res, indexToChange, j);\n\n b[j] = 0;\n b[indexToChange] = 0;\n\n w.get(0).add(j);\n w.get(0).add(indexToChange);\n\n w.get(b[indexToChange]).remove(indexToChange);\n w.get(b[j]).remove(j);\n\n finished = true;\n break;\n }\n\n if (finished) break;\n }\n if (res[i] == res[getvisavis(n, i)]) System.out.println(\"alarma\");\n }\n }\n for (int i = 0; i < n / 2; ++i) {\n if (res[i] == res[getvisavis(n, i)]) {\n System.out.println(\"FFFF\");\n }\n }\n\n\n int sum = 0;\n for (int i = 0; i < n; ++i) {\n //if (!changed[i]) {\n sum += b[i];\n // }\n }\n\n System.out.println(sum);\n }\n\n public static int getvisavis(int n, int i) {\n return n - i - 1;\n }\n\n public static void swap(char[] a, int i, int j) {\n char t = a[i];\n a[i] = a[j];\n a[j] = t;\n }\n}", "lang_cluster": "Java", "tags": ["greedy", "flows", "graphs"], "code_uid": "f86520a8e7c83b3ae7d7f145a58dcb4f", "src_uid": "896555ddb6e1c268cd7b3b6b063fce50", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "// practice with rainboy\nimport java.io.*;\nimport java.util.*;\n\npublic class CF884F extends PrintWriter {\n\tCF884F() { super(System.out, true); }\n\tScanner sc = new Scanner(System.in);\n\tpublic static void main(String[] $) {\n\t\tCF884F o = new CF884F(); o.main(); o.flush();\n\t}\n\n\tstatic final int A = 26, INF = 0x3f3f3f3f;\n\tint[] oo, oh; int __ = 1;\n\tint link(int o, int h) {\n\t\too[__] = o; oh[__] = h;\n\t\treturn __++;\n\t}\n\tint[] ii, jj, cc, cost, cost_; int m_;\n\tint[] ae, pi, dd, ff; int n_;\n\tint[] pq, iq; int cnt;\n\tvoid init() {\n\t\too = new int[1 + m_ * 2]; oh = new int[1 + m_ * 2];\n\t\tii = new int[m_]; jj = new int[m_]; cc = new int[m_ << 1];\n\t\tcost = new int[m_]; cost_ = new int[m_];\n\t\tpi = new int[n_]; dd = new int[n_]; ff = new int[n_];\n\t\tae = new int[n_];\n\t\tpq = new int[1 + n_]; iq = new int[n_];\n\t\tm_ = 0;\n\t}\n\tvoid link_(int i, int j, int c, int co) {\n\t\tint h = m_++;\n\t\tii[h] = i; jj[h] = j; cc[h << 1] = c;\n\t\tcost[h] = co;\n\t\tae[i] = link(ae[i], h << 1);\n\t\tae[j] = link(ae[j], h << 1 | 1);\n\t}\n\tboolean less(int u, int v) {\n\t\treturn pi[u] < pi[v] || pi[u] == pi[v] && dd[u] < dd[v];\n\t}\n\tint i2(int i) {\n\t\treturn (i *= 2) > cnt ? 0 : i < cnt && less(pq[i + 1], pq[i]) ? i + 1 : i;\n\t}\n\tvoid pq_up(int u) {\n\t\tint i, j, v;\n\t\tfor (i = iq[u]; (j = i / 2) > 0 && less(u, v = pq[j]); i = j)\n\t\t\tpq[iq[v] = i] = v;\n\t\tpq[iq[u] = i] = u;\n\t}\n\tvoid pq_dn(int u) {\n\t\tint i, j, v;\n\t\tfor (i = iq[u]; (j = i2(i)) > 0 && less(v = pq[j], u); i = j)\n\t\t\tpq[iq[v] = i] = v;\n\t\tpq[iq[u] = i] = u;\n\t}\n\tvoid pq_add_last(int u) {\n\t\tpq[iq[u] = ++cnt] = u;\n\t}\n\tint pq_remove_first() {\n\t\tint u = pq[1], v = pq[cnt--];\n\t\tif (v != u) {\n\t\t\tiq[v] = 1; pq_dn(v);\n\t\t}\n\t\tiq[u] = 0;\n\t\treturn u;\n\t}\n\tboolean dijkstra(int s, int t) {\n\t\tArrays.fill(pi, INF);\n\t\tpi[s] = 0; pq_add_last(s);\n\t\twhile (cnt > 0) {\n\t\t\tint i = pq_remove_first();\n\t\t\tint d = dd[i] + 1;\n\t\t\tfor (int o = ae[i]; o != 0; o = oo[o]) {\n\t\t\t\tint h_ = oh[o];\n\t\t\t\tif (cc[h_] > 0) {\n\t\t\t\t\tint h = h_ >> 1;\n\t\t\t\t\tint j = i ^ ii[h] ^ jj[h];\n\t\t\t\t\tint p = pi[i] + ((h_ & 1) == 0 ? cost_[h] : -cost_[h]);\n\t\t\t\t\tif (pi[j] > p || pi[j] == p && dd[j] > d) {\n\t\t\t\t\t\tif (pi[j] == INF)\n\t\t\t\t\t\t\tpq_add_last(j);\n\t\t\t\t\t\tpi[j] = p; dd[j] = d; ff[j] = h_;\n\t\t\t\t\t\tpq_up(j);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn pi[t] != INF;\n\t}\n\tint trace(int s, int t) {\n\t\twhile (t != s) {\n\t\t\tint h_ = ff[t], h = h_ >> 1;\n\t\t\tcc[h_]--; cc[h_ ^ 1]++;\n\t\t\tt ^= ii[h] ^ jj[h];\n\t\t}\n\t\treturn 1;\n\t}\n\tint edmonds_karp(int s, int t) {\n\t\tfor (int h = 0; h < m_; h++) {\n\t\t\tint i = ii[h], j = jj[h];\n\t\t\tpi[j] = Math.min(pi[j], pi[i] + cost[h]);\n\t\t}\n\t\tfor (int h = 0; h < m_; h++) {\n\t\t\tint i = ii[h], j = jj[h];\n\t\t\tcost_[h] = cost[h] + pi[i] - pi[j];\n\t\t}\n\t\tint f = 0;\n\t\twhile (dijkstra(s, t)) {\n\t\t\tf += trace(s, t);\n\t\t\tfor (int h = 0; h < m_; h++) {\n\t\t\t\tint i = ii[h], j = jj[h];\n\t\t\t\tif (pi[i] != INF && pi[j] != INF) {\n\t\t\t\t\t// pi[j] <= pi[i] + cost_[h]\n\t\t\t\t\t// cost_[h] + pi[i] - pi[j] >= 0\n\t\t\t\t\tcost_[h] += pi[i] - pi[j];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint ans = 0;\n\t\tfor (int h = 0; h < m_; h++)\n\t\t\tans += cc[h << 1 | 1] * cost[h];\n\t\treturn ans;\n\t}\n\tvoid main() {\n\t\tint n = sc.nextInt() / 2;\n\t\tn_ = 1 + n + A + 1;\n\t\tm_ = n + n * A + A;\n\t\tinit();\n\t\tbyte[] cc = sc.next().getBytes();\n\t\tint[] bb = new int[n * 2];\n\t\tfor (int i = 0; i < n * 2; i++)\n\t\t\tbb[i] = sc.nextInt();\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tlink_(0, 1 + i, 2, 0);\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint j = n * 2 - 1 - i;\n\t\t\tint ai = cc[i] - 'a';\n\t\t\tint aj = cc[j] - 'a';\n\t\t\tfor (int a = 0; a < A; a++) {\n\t\t\t\tint b;\n\t\t\t\tif (a == ai && a == aj)\n\t\t\t\t\tb = Math.max(bb[i], bb[j]);\n\t\t\t\telse if (a == ai)\n\t\t\t\t\tb = bb[i];\n\t\t\t\telse if (a == aj)\n\t\t\t\t\tb = bb[j];\n\t\t\t\telse\n\t\t\t\t\tb = 0;\n\t\t\t\tlink_(1 + i, 1 + n + a, 1, -b);\n\t\t\t}\n\t\t}\n\t\tint[] kk = new int[A];\n\t\tfor (int i = 0; i < n * 2; i++) {\n\t\t\tint a = cc[i] - 'a';\n\t\t\tkk[a]++;\n\t\t}\n\t\tfor (int a = 0; a < A; a++)\n\t\t\tlink_(1 + n + a, n_ - 1, kk[a], 0);\n\t\tprintln(-edmonds_karp(0, n_ - 1));\n\t}\n}\n", "lang_cluster": "Java", "tags": ["greedy", "flows", "graphs"], "code_uid": "155aba41594f32da74d9c23bec35e5e2", "src_uid": "896555ddb6e1c268cd7b3b6b063fce50", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package educational.round31;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.List;\n\npublic class F {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t\tint n = ni();\n\t\tchar[] s = ns(n);\n\t\t\n\t\tint[] f = new int[26];\n\t\tfor(char c : s)f[c-'a']++;\n\t\tfor(int i = 0;i < 26;i++){\n\t\t\tif(f[i] > n/2){\n\t\t\t\tout.println(-1);\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\t\n\t\tint[] a = na(n);\n\t\tfor(int i = 0;i < n/2;i++){\n\t\t\tif(a[i] > a[n-1-i]){\n\t\t\t\tint d = a[i]; a[i] = a[n-1-i]; a[n-1-i] = d;\n\t\t\t\tchar u = s[i]; s[i] = s[n-1-i]; s[n-1-i] = u;\n\t\t\t}\n\t\t}\n\t\tList<Edge> es = new ArrayList<>();\n\t\tint src = n, sink = n+1;\n\t\tfor(int i = 0;i < n/2;i++){\n\t\t\tes.add(new Edge(src, i, 1, 0));\n\t\t\tes.add(new Edge(n-1-i, sink, 1, 0));\n\t\t\tfor(int j = 0;j < n/2;j++){\n\t\t\t\tif(s[i] != s[n-1-j]){\n\t\t\t\t\tes.add(new Edge(i, n-1-j, 1, i == j ? 0 : a[i]));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tlong ans = Arrays.stream(a).sum();\n\t\tout.println(ans - solveMinCostFlow(compileWD(sink+1, es), src, sink, n));\n\t}\n\t\n\tpublic static class Edge\n\t{\n\t\tpublic int from, to;\n\t\tpublic int capacity;\n\t\tpublic int cost;\n\t\tpublic int flow;\n\t\tpublic Edge complement;\n\t\t// public int iniflow;\n\t\t\n\t\tpublic Edge(int from, int to, int capacity, int cost) {\n\t\t\tthis.from = from;\n\t\t\tthis.to = to;\n\t\t\tthis.capacity = capacity;\n\t\t\tthis.cost = cost;\n\t\t}\n\t}\n\t\n\tpublic static Edge[][] compileWD(int n, List<Edge> edges)\n\t{\n\t\tEdge[][] g = new Edge[n][];\n\t\t// cloning\n\t\tfor(int i = edges.size()-1;i >= 0;i--){\n\t\t\tEdge origin = edges.get(i);\n\t\t\tEdge clone = new Edge(origin.to, origin.from, origin.capacity, -origin.cost);\n\t\t\tclone.flow = origin.capacity;\n\t\t\tclone.complement = origin;\n\t\t\torigin.complement = clone;\n\t\t\tedges.add(clone);\n\t\t}\n\t\t\n\t\tint[] p = new int[n];\n\t\tfor(Edge e : edges)p[e.from]++;\n\t\tfor(int i = 0;i < n;i++)g[i] = new Edge[p[i]];\n\t\tfor(Edge e : edges)g[e.from][--p[e.from]] = e;\n\t\treturn g;\n\t}\n\n\t// NOT VERIFIED\n\tpublic static Edge[][] compileWU(int n, List<Edge> edges)\n\t{\n\t\tEdge[][] g = new Edge[n][];\n\t\t// cloning\n\t\tfor(int i = edges.size()-1;i >= 0;i--){\n\t\t\tEdge origin = edges.get(i);\n\t\t\tEdge back = new Edge(origin.to, origin.from, origin.capacity, origin.cost);\n\t\t\tedges.add(back);\n\t\t}\n\t\tfor(int i = edges.size()-1;i >= 0;i--){\n\t\t\tEdge origin = edges.get(i);\n\t\t\tEdge clone = new Edge(origin.to, origin.from, origin.capacity, -origin.cost);\n\t\t\tclone.flow = origin.capacity;\n\t\t\tclone.complement = origin;\n\t\t\torigin.complement = clone;\n\t\t\tedges.add(clone);\n\t\t}\n\t\t\n\t\tint[] p = new int[n];\n\t\tfor(Edge e : edges)p[e.from]++;\n\t\tfor(int i = 0;i < n;i++)g[i] = new Edge[p[i]];\n\t\tfor(Edge e : edges)g[e.from][--p[e.from]] = e;\n\t\treturn g;\n\t}\t\n\n\t\n\tpublic static long solveMinCostFlow(Edge[][] g, int source, int sink, long all)\n\t{\n\t\tint n = g.length;\n\t\tlong mincost = 0;\n\t\tint[] potential = new int[n];\n\t\t\n\t\tfinal int[] d = new int[n];\n\t\tMinHeap q = new MinHeap(n);\n\t\twhile(all > 0){\n\t\t\t// shortest path src->sink\n\t\t\tEdge[] inedge = new Edge[n];\n\t\t\tArrays.fill(d, Integer.MAX_VALUE / 2);\n\t\t\td[source] = 0;\n\t\t\tq.add(source, 0);\n\t\t\twhile(q.size() > 0){\n\t\t\t\tint cur = q.argmin();\n\t\t\t\tq.remove(cur);\n\t\t\t\tfor(Edge ne : g[cur]){\n\t\t\t\t\tif(ne.capacity - ne.flow > 0){\n\t\t\t\t\t\tint nd = d[cur] + ne.cost + potential[cur] - potential[ne.to];\n\t\t\t\t\t\tif(d[ne.to] > nd){\n\t\t\t\t\t\t\tinedge[ne.to] = ne;\n\t\t\t\t\t\t\td[ne.to] = nd;\n\t\t\t\t\t\t\tq.update(ne.to, nd);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(inedge[sink] == null)break;\n\t\t\t\n\t\t\tlong minflow = all;\n\t\t\tlong sumcost = 0;\n\t\t\tfor(Edge e = inedge[sink];e != null;e = inedge[e.from]){\n\t\t\t\tif(e.capacity - e.flow < minflow)minflow = e.capacity - e.flow;\n\t\t\t\tsumcost += e.cost;\n\t\t\t}\n\t\t\tmincost += minflow * sumcost;\n\t\t\tfor(Edge e = inedge[sink];e != null;e = inedge[e.from]){\n\t\t\t\te.flow += minflow;\n\t\t\t\te.complement.flow -= minflow;\n\t\t\t}\n\t\t\t\n\t\t\tall -= minflow;\n\t\t\tfor(int i = 0;i < n;i++){\n\t\t\t\tpotential[i] += d[i];\n\t\t\t}\n\t\t}\n\t\treturn mincost;\n\t}\n\t\n\tpublic static class MinHeap {\n\t\tpublic int[] a;\n\t\tpublic int[] map;\n\t\tpublic int[] imap;\n\t\tpublic int n;\n\t\tpublic int pos;\n\t\tpublic static int INF = Integer.MAX_VALUE;\n\t\t\n\t\tpublic MinHeap(int m)\n\t\t{\n\t\t\tn = m+2;\n\t\t\ta = new int[n];\n\t\t\tmap = new int[n];\n\t\t\timap = new int[n];\n\t\t\tArrays.fill(a, INF);\n\t\t\tArrays.fill(map, -1);\n\t\t\tArrays.fill(imap, -1);\n\t\t\tpos = 1;\n\t\t}\n\t\t\n\t\tpublic int add(int ind, int x)\n\t\t{\n\t\t\tint ret = imap[ind];\n\t\t\tif(imap[ind] < 0){\n\t\t\t\ta[pos] = x; map[pos] = ind; imap[ind] = pos;\n\t\t\t\tpos++;\n\t\t\t\tup(pos-1);\n\t\t\t}\n\t\t\treturn ret != -1 ? a[ret] : x;\n\t\t}\n\t\t\n\t\tpublic int update(int ind, int x)\n\t\t{\n\t\t\tint ret = imap[ind];\n\t\t\tif(imap[ind] < 0){\n\t\t\t\ta[pos] = x; map[pos] = ind; imap[ind] = pos;\n\t\t\t\tpos++;\n\t\t\t\tup(pos-1);\n\t\t\t}else{\n\t\t\t\tint o = a[ret];\n\t\t\t\ta[ret] = x;\n\t\t\t\tup(ret);\n\t\t\t\tdown(ret);\n//\t\t\t\tif(a[ret] > o){\n//\t\t\t\t\tup(ret);\n//\t\t\t\t}else{\n//\t\t\t\t\tdown(ret);\n//\t\t\t\t}\n\t\t\t}\n\t\t\treturn x;\n\t\t}\n\t\t\n\t\tpublic int remove(int ind)\n\t\t{\n\t\t\tif(pos == 1)return INF;\n\t\t\tif(imap[ind] == -1)return INF;\n\t\t\t\n\t\t\tpos--;\n\t\t\tint rem = imap[ind];\n\t\t\tint ret = a[rem];\n\t\t\tmap[rem] = map[pos];\n\t\t\timap[map[pos]] = rem;\n\t\t\timap[ind] = -1;\n\t\t\ta[rem] = a[pos];\n\t\t\ta[pos] = INF;\n\t\t\tmap[pos] = -1;\n\t\t\t\n\t\t\tup(rem);\n\t\t\tdown(rem);\n\t\t\treturn ret;\n\t\t}\n\t\t\n\t\tpublic int min() { return a[1]; }\n\t\tpublic int argmin() { return map[1]; }\n\t\tpublic int size() {\treturn pos-1; }\n\t\t\n\t\tprivate void up(int cur)\n\t\t{\n\t\t\tfor(int c = cur, p = c>>>1;p >= 1 && a[p] > a[c];c>>>=1, p>>>=1){\n\t\t\t\tint d = a[p]; a[p] = a[c]; a[c] = d;\n\t\t\t\tint e = imap[map[p]]; imap[map[p]] = imap[map[c]]; imap[map[c]] = e;\n\t\t\t\te = map[p]; map[p] = map[c]; map[c] = e;\n\t\t\t}\n\t\t}\n\t\t\n\t\tprivate void down(int cur)\n\t\t{\n\t\t\tfor(int c = cur;2*c < pos;){\n\t\t\t\tint b = a[2*c] < a[2*c+1] ? 2*c : 2*c+1;\n\t\t\t\tif(a[b] < a[c]){\n\t\t\t\t\tint d = a[c]; a[c] = a[b]; a[b] = d;\n\t\t\t\t\tint e = imap[map[c]]; imap[map[c]] = imap[map[b]]; imap[map[b]] = e;\n\t\t\t\t\te = map[c]; map[c] = map[b]; map[b] = e;\n\t\t\t\t\tc = b;\n\t\t\t\t}else{\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new F().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["greedy", "flows", "graphs"], "code_uid": "03e6ae8f6a522b91a96b6f8340084cfc", "src_uid": "896555ddb6e1c268cd7b3b6b063fce50", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.IOException;\nimport java.util.*;\nimport java.io.*;\npublic class ll {\n public static void main(String[] args) throws IOException {\n gg g = new gg();\n }\n\n}\nclass gg {\n gg() throws IOException {\n FScanner fs = new FScanner(new InputStreamReader(System.in));\n PrintWriter pw = new PrintWriter(System.out);\n int n = fs.nextInt();\n char[] word = fs.nextLine().toCharArray();\n int[] vals = fs.iarr(n);\n int[] badones = new int[26];\n int m = 0;\n for (int i = 0; i<n/2; i++)\n if (word[i] == word[n-i-1])\n {\n badones[word[i]-'a']++;\n m++;\n }\n int max = 0;\n boolean bad = false;\n int val = -1;\n for (int i = 0; i<26; i++)\n if (badones[i]*2>m)\n {\n bad = true;\n val = i;\n }\n if (!bad) {\n long sum = 0;\n for (int i = 0; i<n/2; i++)\n if (word[i] !=word[n-i-1])\n sum+=vals[i]+vals[n-i-1];\n else sum+=Math.max(vals[i], vals[n-i-1]);\n pw.println(sum);\n } else {\n int others = badones[val]-(m-badones[val]);\n ArrayList<Integer> appr = new ArrayList<>();\n for (int i = 0; i<n/2; i++)\n if (word[i] != word[n-i-1] && word[i] != 'a'+val && word[n-i-1] != 'a'+val)\n appr.add(Math.min(vals[i], vals[n-i-1]));\n appr.sort(null);\n long ans = 0;\n for (int i =0 ; i<n/2; i++) {\n if (word[i] == word[n-i-1])\n ans+=Math.max(vals[i], vals[n-i-1]);\n else ans+=vals[i]+vals[n-i-1];\n }\n for (int i =0 ; i<others; i++)\n ans-=appr.get(i);\n pw.println(ans);\n }\n pw.close();\n }\n\n void add(long s, TreeMap<Long, Integer> map) {\n if (map.containsKey(s))\n map.put(s, map.get(s)+1);\n else map.put(s, 1);\n }\n long lowest(TreeMap<Long, Integer> map) {\n if (map.size() == 0)\n return -1;\n long v = map.firstKey();\n if (map.get(v) == 1) {\n map.remove(v);\n } else {\n map.put(v, map.get(v)-1);\n }\n return v;\n }\n\n}\n\n\nclass FScanner {\n StringTokenizer st;\n BufferedReader reader;\n FScanner(InputStreamReader isr) throws IOException {\n reader = new BufferedReader(isr);\n }\n\n String nextLine() throws IOException {\n return reader.readLine();\n }\n\n String nextToken() throws IOException{\n while (st == null || !st.hasMoreTokens()) {\n String s = reader.readLine();\n if (s == null)\n return null;\n st = new StringTokenizer(s);\n }\n return st.nextToken();\n }\n\n int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n char nextChar() throws IOException {\n return (char) reader.read();\n }\n\n long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n int[] iarr(int n) throws IOException {\n int[] mas = new int[n];\n for (int i =0 ; i<n; i++)\n mas[i] = nextInt();\n return mas;\n }\n\n double[] darr(int n) throws IOException {\n double[] mas = new double[n];\n for (int i =0 ; i<n; i++)\n mas[i] = nextDouble();\n return mas;\n }\n\n char[][] cmas2 (int n, int m) throws IOException {\n char[][] mas = new char[n][m];\n for (int i =0 ; i<n; i++)\n mas[i] = nextLine().toCharArray();\n return mas;\n }\n\n long[] larr(int n) throws IOException {\n long[] mas = new long[n];\n for (int i =0 ; i<n; i++)\n mas[i] = nextLong();\n return mas;\n }\n\n}", "lang_cluster": "Java", "tags": ["greedy", "flows", "graphs"], "code_uid": "cf55f7b77dbe5db1eaf65aff9f313d60", "src_uid": "896555ddb6e1c268cd7b3b6b063fce50", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\n\n\n\n\npublic class MinCostMaxFlow {\n public static void main(String[] args) {\n InputReader in = new InputReader();\n OutputWriter out = new OutputWriter(System.out);\n\t\tint letters = 'z' - 'a' + 1;\n int n = in.nextInt();\n String s = in.next();\n char[] string = s.toCharArray();\n int[] letCount = new int[letters];\n for(int i = 0; i < n; ++i) {\n letCount[string[i] - 'a']++;\n }\n int[] b = new int[n];\n for(int i = 0; i < n; ++i) {\n b[i] = in.nextInt();\n }\n \n int source = 0;\n int charOffSet = 1;\n int pairOffSet = charOffSet + letters;\n int sinkOffSet = pairOffSet + n / 2;\n int sink = sinkOffSet;\n int vNum = sinkOffSet + 1;\n \n Graph g = new Graph(vNum, source, sink);\n //Source -> Letters -> Pairs\n for(int i = 0; i < letters; ++i) {\n g.addEdge(source, charOffSet + i, letCount[i], 0);\n for(int j = 0; j < n/2; ++j) {\n char c1 = string[j];\n char c2 = string[n - j - 1];\n if(c1 == 'a' + i) {\n if(c1 == c2) {\n g.addEdge(charOffSet + i, pairOffSet + j,\n 1, -Integer.max(b[j], b[n - j - 1]));\n } else {\n g.addEdge(charOffSet + i, pairOffSet + j, 1, -b[j]);\n }\n } else {\n if(c2 == 'a' + i) {\n g.addEdge(charOffSet + i, pairOffSet + j, 1, -b[n - j - 1]);\n } else {\n g.addEdge(charOffSet + i, pairOffSet + j, 1, 0);\n }\n }\n }\n }\n //Pairs -> Sink\n for(int i = 0; i < n/2; ++i) {\n g.addEdge(pairOffSet + i, sink, 2, 0);\n }\n\t\t\n int[] ans = g.getMinCostMaxFlow();\n//\t\tSystem.out.println(\"flow: \" + ans[0]);\n//\t\tSystem.out.println(\"cost: \" + -ans[1]);\n System.out.println(-ans[1]);\n }\n \n \n \n\n public static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void print(Object... objects) {\n for (int i = 0; i < objects.length; i++) {\n if (i != 0) {\n writer.print(' ');\n }\n writer.print(objects[i]);\n }\n }\n\n public void println(Object... objects) {\n print(objects);\n writer.println();\n }\n\n public void printf(String format, Object... objects) {\n writer.printf(format, objects);\n }\n\n public void close() {\n writer.close();\n }\n\n public void flush() {\n writer.flush();\n }\n\n }\n \n static class InputReader\n {\n BufferedReader br;\n StringTokenizer st;\n \n public InputReader()\n {\n br = new BufferedReader(new\n InputStreamReader(System.in));\n }\n \n String next()\n {\n while (st == null || !st.hasMoreElements())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n \n int nextInt()\n {\n return Integer.parseInt(next());\n }\n \n long nextLong()\n {\n return Long.parseLong(next());\n }\n \n double nextDouble()\n {\n return Double.parseDouble(next());\n }\n \n String nextLine()\n {\n String str = \"\";\n try\n {\n str = br.readLine();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n return str;\n }\n }\n}\n\nclass Graph {\n private int vNum;\n private int src;\n private int sink;\n \n private int[][] res;\n private int[][] cost;\n private List<Edge> costGraph;\n private int[] p;\n private int[] d;\n \n private static class Edge {\n final int from;\n final int to;\n final int cost;\n \n Edge(int from, int to, int cost) {\n this.from = from;\n this.to = to;\n this.cost = cost;\n }\n }\n \n public int getVertexNumber() {\n return vNum;\n }\n \n public Graph(int vNum, int src, int sink) {\n this.vNum = vNum;\n this.src = src;\n this.sink = sink;\n res = new int[vNum][vNum];\n cost = new int[vNum][vNum];\n costGraph = new ArrayList<>();\n d = new int[vNum];\n p = new int[vNum];\n }\n \n public void addEdge(int from, int to, int capacity, int cost) {\n res[from][to] += capacity;\n this.cost[from][to] = cost;\n this.cost[to][from] = -cost;\n \n }\n \n private boolean findCheapestPath() {\n \tcostGraph.clear();\n \tfor(int i = 0; i < vNum; ++i) {\n \t\tfor(int j = 0; j < vNum; ++j) {\n \t\t\tif(res[i][j] > 0) {\n \t\t\t\tcostGraph.add(new Edge(i, j, cost[i][j]));\n \t\t\t}\n \t\t}\n \t}\n \t\n \tArrays.fill(d, Integer.MAX_VALUE);\n \tArrays.fill(p, -1);\n \t\n \td[src] = 0;\n \t\n \tboolean changed = false;\n \tfor(int i = 0; i < vNum - 1; ++i) {\n \t\tfor(Edge e: costGraph) {\n \t\t\t// Be careful here\n \t\t\t// Overfloating can be\n \t\t\tif(d[e.from] != Integer.MAX_VALUE && d[e.from] + e.cost < d[e.to]) {\n \t\t\t\td[e.to] = d[e.from] + e.cost;\n \t\t\t\tp[e.to] = e.from;\n \t\t\t\tchanged = true;\n \t\t\t}\n \t\t}\n \t\tif(!changed) {\n \t\t\tbreak;\n \t\t}\n \t}\n \t\n \treturn p[sink] != -1;\n }\n \n private int[] augmentPath(int from, int to, int flow) {\n \tint pathCost = 0;\n \tfor(int cur = to; cur != from; cur = p[cur]) {\n \t\tflow = Integer.min(flow, res[p[cur]][cur]);\n \t}\n \tfor(; to != from; to = p[to]) {\n \t\tres[p[to]][to] -= flow;\n \t\tres[to][p[to]] += flow;\n \t\tpathCost += cost[p[to]][to] * flow;\n \t}\n \treturn new int[] {flow, pathCost};\n }\n \n public int[] getMinCostMaxFlow() {\n \tint flow = 0;\n \tint totalCost = 0;\n \twhile(findCheapestPath()) {\n \t\tint[] result = augmentPath(src, sink, Integer.MAX_VALUE);\n \t\tflow += result[0];\n \t\ttotalCost += result[1];\n \t} \t\n \treturn new int[] {flow, totalCost};\n }\n}\n", "lang_cluster": "Java", "tags": ["greedy", "flows", "graphs"], "code_uid": "c1ecad868d0077e5cd422e92aab24c93", "src_uid": "896555ddb6e1c268cd7b3b6b063fce50", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.BufferedWriter;\nimport java.io.FileOutputStream;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.FileNotFoundException;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n TaskF solver = new TaskF();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskF {\n static boolean debug = false;\n int numberNumber;\n int t;\n long[][] bin = IntegerUtils.generateBinomialCoefficients(100);\n\n static {\n if (debug) {\n try {\n FileOutputStream f = new FileOutputStream(\"file.txt\");\n System.setErr(new PrintStream(f));\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n }\n }\n\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n numberNumber = in.readInt();\n t = in.readInt();\n\n// t = 1;\n\n // HashMap<Integer, String> answers = new HashMap<>();\n//\n// for (int i = 1, cnt = 0; cnt < 1e5; i++) {\n// int[] cntTake = new int[16];\n// for (char c : String.format(\"%x\", i).toCharArray()) {\n// ++cntTake[Integer.parseInt(\"\" + c, 16)];\n// }\n// boolean ok = true;\n// for (int c : cntTake) {\n// ok &= c <= t;\n// }\n// if (ok) {\n// ++cnt;\n// String answer = String.format(\"%x\", i);\n// answers.put(cnt, answer);\n// System.err.println(cnt + \" = \" + answer);\n// System.err.flush();\n// }\n// }\n\n//\n// for (int _numberNumber = 1; ; _numberNumber++) {\n// numberNumber = _numberNumber;\n int wordLength = 1;\n for (; ; wordLength++) {\n long[][] dp = new long[16][wordLength + 1];\n\n for (int length = 0; length <= wordLength; length++) {\n for (int ch = 0; ch < 16; ch++) {\n if (length == 0) {\n dp[ch][length] = 1;\n } else if (ch == 0) {\n if (length <= t) {\n dp[ch][length] = bin[wordLength - 1][length];\n }\n } else {\n dp[ch][length] += dp[ch - 1][length];\n for (int c = 1; c <= Math.min(length, t); c++) {\n dp[ch][length] += bin[wordLength - length + c][c] * dp[ch - 1][length - c];\n }\n }\n }\n }\n\n System.err.println(\"wordLength, dp: \" + wordLength + \" \" + dp[15][wordLength]);\n System.err.flush();\n if (dp[15][wordLength] < numberNumber) {\n numberNumber -= dp[15][wordLength];\n } else {\n// out.printLine(\"wordLength: \" + wordLength);\n break;\n }\n }\n\n StringBuilder ans = new StringBuilder();\n int[] maxCnt = new int[16];\n Arrays.fill(maxCnt, t);\n for (int pos = 0; pos < wordLength; pos++) {\n boolean addCh = false;\n for (int ch = 0; ch < 16; ch++) {\n if (pos == 0 && ch == 0) {\n continue;\n }\n if (maxCnt[ch] == 0) {\n continue;\n }\n --maxCnt[ch];\n long dp = getDp(wordLength - pos - 1, maxCnt);\n if (numberNumber <= dp) {\n ans.append(String.format(\"%x\", ch));\n addCh = true;\n break;\n } else {\n ++maxCnt[ch];\n numberNumber -= dp;\n }\n }\n if (!addCh) {\n throw new RuntimeException(\"no addCh\");\n// out.printLine(\"no add ch at pos=\" + pos, \" : \", _numberNumber, answers.get(_numberNumber), ans);\n// return;\n }\n }\n// if (!answers.get(_numberNumber).equals(ans.toString())) {\n// out.printLine(\"FUCK:\", _numberNumber, answers.get(_numberNumber), ans);\n// return;\n// }\n out.printLine(ans);\n// }\n }\n\n private long getDp(int wordLength, int[] maxCnt) {\n long[][] dp = new long[16][wordLength + 1];\n for (int length = 0; length <= wordLength; length++) {\n for (int ch = 0; ch < 16; ch++) {\n if (length == 0) {\n dp[ch][length] = 1;\n } else {\n if (ch != 0) {\n dp[ch][length] += dp[ch - 1][length];\n }\n for (int cnt = 1; cnt <= Math.min(length, maxCnt[ch]); cnt++) {\n if (ch == 0) {\n if (length == cnt) {\n dp[ch][length] += bin[wordLength][cnt];\n }\n } else {\n dp[ch][length] += bin[wordLength - length + cnt][cnt] * dp[ch - 1][length - cnt];\n }\n }\n }\n }\n }\n return dp[15][wordLength];\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if ((c < '0') || (c > '9')) {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return (c == ' ') || (c == '\\n') || (c == '\\r') || (c == '\\t') || (c == -1);\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n\n static class IntegerUtils {\n public static long[][] generateBinomialCoefficients(int n) {\n long[][] result = new long[n + 1][n + 1];\n for (int i = 0; i <= n; i++) {\n result[i][0] = 1;\n for (int j = 1; j <= i; j++) {\n result[i][j] = result[i - 1][j - 1] + result[i - 1][j];\n }\n }\n return result;\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void print(Object... objects) {\n for (int i = 0; i < objects.length; i++) {\n if (i != 0) {\n writer.print(' ');\n }\n writer.print(objects[i]);\n }\n }\n\n public void printLine(Object... objects) {\n print(objects);\n writer.println();\n }\n\n public void close() {\n writer.close();\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["brute force", "math", "dp", "combinatorics"], "code_uid": "340cb70b30e5219485484295d34f7199", "src_uid": "cbfc354cfa392cd021d9fe899a745f0e", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main implements Runnable{\n public static void main(String[] args){\n //new Thread(null,new Main(),\"Thread-1\",1024*1024*10).start();\n new Main().run();\n }\n int mod=1000000007;\n int n,k,m;\n private void solve() throws Exception {\n InputReader in = new InputReader(System.in);\n PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n n=in.nextInt();k=in.nextInt();m=in.nextInt();\n int[][]ma=new int[(k+1)*(1<<m)][(k+1)*(1<<m)];\n for(int i=0;i<=k;i++) {\n for (int j = 0; j < (1 << m); j++) {\n ma[trans(i,j>>1)][trans(i,j)]=1;\n if(i<k)ma[trans(i+1,j>>1|(1<<m-1))][trans(i,j)]=Integer.bitCount(j)+1;\n }\n }\n ma=FastPowMod(ma,n);\n long ans=0;\n for(int i=trans(k,0);i<ma.length;i++)ans+=ma[i][0];\n out.println(ans%mod);\n out.flush();\n }\n public int[][] FastPowMod(int[][] a,int b){\n int[][] ans=new int[a.length][a.length];\n for(int i=0;i<a.length;i++)ans[i][i]=1;\n while(b>0){\n if((b&1)==1)\n ans=modMul(ans,a);\n a=modMul(a,a);\n b>>=1;\n }\n return ans;\n }\n public int[][] modMul(int[][]a,int[][]b){\n int row=a.length,column=b[0].length;\n int len=b.length;\n int[][] ans=new int[row][column];\n for(int i=0;i<row;i++){\n for(int j=0;j<len;j++){\n //if(a[i][j]==0)continue;//稀疏矩阵优化\n for(int k=0;k<column;k++){\n ans[i][k]+=(long)a[i][j]*b[j][k]%mod;\n ans[i][k]%=mod;\n }\n }\n }\n return ans;\n }\n\n int trans(int x,int y){\n return x*(1<<m)+y;\n }\n @Override\n public void run() {\n try {\n solve();\n } catch (Exception e) {\n e.printStackTrace();\n }\n }\n void shuffle(int[]a,int l,int r){\n Random rnd=new Random();\n for (int i=r; i>l+1; i--) {\n int j=rnd.nextInt(i),tmp=a[j];\n a[j]=a[i-1];\n a[i-1]=tmp;\n }\n }\n void shuffle(Object[]a,int l,int r){\n Random rnd=new Random();\n for (int i=r; i>l+1; i--) {\n int j=rnd.nextInt(i);\n Object tmp=a[j];\n a[j]=a[i-1];\n a[i-1]=tmp;\n }\n }\n void shuffle(long[]a,int l,int r){\n Random rnd=new Random();\n for (int i=r; i>l+1; i--) {\n int j=rnd.nextInt(i);\n long tmp=a[j];\n a[j]=a[i-1];\n a[i-1]=tmp;\n }\n }\n class InputReader{\n StreamTokenizer tokenizer;\n public InputReader(InputStream stream){\n tokenizer=new StreamTokenizer(new BufferedReader(new InputStreamReader(stream)));\n tokenizer.ordinaryChars(33,126);\n tokenizer.wordChars(33,126);\n }\n public String next() throws IOException {\n tokenizer.nextToken();\n return tokenizer.sval;\n }\n public int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n public long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n public boolean hasNext() throws IOException {\n int res=tokenizer.nextToken();\n tokenizer.pushBack();\n return res!=tokenizer.TT_EOF;\n }\n }\n}", "lang_cluster": "Java", "tags": ["matrices", "dp", "bitmasks"], "code_uid": "61444da6b633c4614107d98614037172", "src_uid": "87931a8ae9a76d85bd2a2b4bba93303d", "difficulty": 3000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main implements Runnable{\n public static void main(String[] args){\n //new Thread(null,new Main(),\"Thread-1\",1024*1024*10).start();\n new Main().run();\n }\n int mod=1000000007;\n int n,k,m;\n private void solve() throws Exception {\n InputReader in = new InputReader(System.in);\n PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n n=in.nextInt();k=in.nextInt();m=in.nextInt();\n int[][]ma=new int[(k+1)*(1<<m)][(k+1)*(1<<m)];\n for(int i=0;i<=k;i++) {\n for (int j = 0; j < (1 << m); j++) {\n ma[trans(i,j>>1)][trans(i,j)]=1;\n if(i<k)ma[trans(i+1,j>>1|(1<<m-1))][trans(i,j)]=Integer.bitCount(j)+1;\n }\n }\n ma=FastPowMod(ma,n);\n long ans=0;\n for(int i=trans(k,0);i<ma.length;i++)ans+=ma[i][0];\n out.println(ans%mod);\n out.flush();\n }\n public int[][] FastPowMod(int[][] a,int b){\n int[][] ans=new int[a.length][a.length];\n for(int i=0;i<a.length;i++)ans[i][i]=1;\n while(b>0){\n if((b&1)==1)\n ans=modMul(ans,a);\n a=modMul(a,a);\n b>>=1;\n }\n return ans;\n }\n public int[][] modMul(int[][]a,int[][]b){\n int row=a.length,column=b[0].length;\n int len=b.length;\n int[][] ans=new int[row][column];\n for(int i=0;i<row;i++){\n for(int j=0;j<len;j++){\n if(a[i][j]==0)continue;//稀疏矩阵优化\n for(int k=0;k<column;k++){\n ans[i][k]+=(long)a[i][j]*b[j][k]%mod;\n ans[i][k]%=mod;\n }\n }\n }\n return ans;\n }\n\n int trans(int x,int y){\n return x*(1<<m)+y;\n }\n @Override\n public void run() {\n try {\n solve();\n } catch (Exception e) {\n e.printStackTrace();\n }\n }\n void shuffle(int[]a,int l,int r){\n Random rnd=new Random();\n for (int i=r; i>l+1; i--) {\n int j=rnd.nextInt(i),tmp=a[j];\n a[j]=a[i-1];\n a[i-1]=tmp;\n }\n }\n void shuffle(Object[]a,int l,int r){\n Random rnd=new Random();\n for (int i=r; i>l+1; i--) {\n int j=rnd.nextInt(i);\n Object tmp=a[j];\n a[j]=a[i-1];\n a[i-1]=tmp;\n }\n }\n void shuffle(long[]a,int l,int r){\n Random rnd=new Random();\n for (int i=r; i>l+1; i--) {\n int j=rnd.nextInt(i);\n long tmp=a[j];\n a[j]=a[i-1];\n a[i-1]=tmp;\n }\n }\n class InputReader{\n StreamTokenizer tokenizer;\n public InputReader(InputStream stream){\n tokenizer=new StreamTokenizer(new BufferedReader(new InputStreamReader(stream)));\n tokenizer.ordinaryChars(33,126);\n tokenizer.wordChars(33,126);\n }\n public String next() throws IOException {\n tokenizer.nextToken();\n return tokenizer.sval;\n }\n public int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n public long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n public boolean hasNext() throws IOException {\n int res=tokenizer.nextToken();\n tokenizer.pushBack();\n return res!=tokenizer.TT_EOF;\n }\n }\n}", "lang_cluster": "Java", "tags": ["matrices", "dp", "bitmasks"], "code_uid": "4ffedb23348680a8a34b2ed80610fd51", "src_uid": "87931a8ae9a76d85bd2a2b4bba93303d", "difficulty": 3000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n \npublic class Ada extends PrintWriter {\n Ada() { super(System.out, true); }\n Scanner sc = new Scanner(System.in);\n public static void main(String[] $) {\n Ada o = new Ada(); o.main(); o.flush();\n }\n \n int compress(int[] aa, int n) {\n Random rand = new Random();\n for (int i = 0; i < n; i++) {\n int j = rand.nextInt(i + 1);\n int tmp = aa[i]; aa[i] = aa[j]; aa[j] = tmp;\n }\n Arrays.sort(aa, 0, n);\n int m = 1;\n for (int i = 1; i < n; i++)\n if (aa[i] != aa[i - 1])\n aa[m++] = aa[i];\n return m;\n }\n void main() {\n int a = sc.nextInt();\n int b = sc.nextInt();\n int n = a + b;\n int s = (int) Math.sqrt(n) + 1;\n int[] gg = new int[s + s];\n int m = 0;\n for (int g = 1; g <= s; g++)\n gg[m++] = g;\n for (int k = 1; k <= s; k++) {\n int g = n / k;\n\t gg[m++] = g;\n }\n m = compress(gg, m);\n int ans = 0;\n for (int h = 0; h < m; h++) {\n int g = gg[h];\n int al = (int) ((a + (long) g) / (g + 1));\n int bl = (int) ((b + (long) g) / (g + 1));\n int ar = a / g;\n int br = b / g;\n if (al <= ar && bl <= br) {\n int l = Math.max(n / (g + 1) + 1, al + bl);\n int r = Math.min(n / g, ar + br);\n if (l <= r)\n ans += r - l + 1;\n }\n }\n println(ans);\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "implementation", "binary search"], "code_uid": "9634ca7e990a62348d08d0f968a8e0df", "src_uid": "0e6a204565fef118ea99d2fa1e378dd0", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\n/**\n * Created by zhengyanglzy on 2017/6/24.\n */\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n while (sc.hasNext()) {\n long houseNum = sc.nextLong();\n long k = sc.nextLong();\n System.out.println(cal(houseNum, k));\n }\n }\n \n static long cal(long houseNum, long k) {\n if (k == 1) {\n return 1;\n\n } else if (k == 2) {\n return houseNum;\n }\n return 1 + findLabel(houseNum - 2, k - 2);\n }\n\n static long findLabel(long houseNum, long k) {\n // System.out.printf(\"%d %d\\n\", houseNum, k);\n long medium = (houseNum + 1) / 2;\n if (k == 1) {\n return medium;\n }\n k -= 1;\n Part leftPart = new Part(medium - 1);\n Part rightPart = new Part(houseNum - medium);\n long leftTotal = 0;\n long rightTotal = 0;\n while (true) {\n long left = leftPart.peek();\n long right = rightPart.peek();\n if (left == 0 && right == 0) {\n break;\n }\n if (k > left + right) {\n k -= left + right;\n leftTotal += left;\n rightTotal += right;\n leftPart.split();\n rightPart.split();\n continue;\n }\n leftPart.collapse();\n rightPart.collapse();\n TreeSet<Long> set = new TreeSet<Long>();\n set.addAll(leftPart.segs.keySet());\n set.addAll(rightPart.segs.keySet());\n for (long len : set.descendingSet()) {\n if (leftPart.segs.containsKey(len)) {\n if (leftPart.segs.get(len) >= k) {\n return findLabel(medium - 1, leftTotal + k);\n } else {\n k -= leftPart.segs.get(len);\n leftTotal += leftPart.segs.get(len);\n }\n }\n if (rightPart.segs.containsKey(len)) {\n if (rightPart.segs.get(len) >= k) {\n return medium + findLabel(houseNum - medium, rightTotal + k);\n } else {\n k -= rightPart.segs.get(len);\n rightTotal += rightPart.segs.get(len);\n }\n }\n }\n }\n // 只剩1和2\n if (medium - 1 - leftTotal >= k) {\n return findLabel(medium - 1, leftTotal + k);\n }\n return medium + findLabel(houseNum - medium, rightTotal + k - (medium - 1 - leftTotal));\n }\n\n static class Part {\n Map<Long, Long> segs;\n\n Part(long num) {\n segs = new HashMap<Long, Long>();\n segs.put(num, 1L);\n }\n\n void split() {\n Map<Long, Long> newMap = new HashMap<Long, Long>();\n for (Map.Entry<Long, Long> entry : segs.entrySet()) {\n if (entry.getKey() <= 2) {\n update(newMap, entry.getKey(), entry.getValue());\n continue;\n }\n long medium = (entry.getKey() + 1) / 2;\n update(newMap, medium - 1, entry.getValue());\n update(newMap, entry.getKey() - medium, entry.getValue());\n }\n segs = newMap;\n }\n\n long peek() {\n long ret = 0;\n for (Map.Entry<Long, Long> entry : segs.entrySet()) {\n if (entry.getKey() > 2) {\n ret += entry.getValue();\n }\n }\n return ret;\n }\n\n void collapse() {\n Map<Long, Long> newMap = new HashMap<Long, Long>();\n for (Map.Entry<Long, Long> entry : segs.entrySet()) {\n update(newMap, (entry.getKey() + 1) / 2, entry.getValue());\n }\n segs = newMap;\n }\n\n static void update(Map<Long, Long> map, long key, long inc) {\n if (!map.containsKey(key)) {\n map.put(key, 0L);\n }\n map.put(key, map.get(key) + inc);\n }\n }\n\n static class Seg implements Comparable<Seg> {\n int start;\n int length;\n\n public Seg(int start, int length) {\n this.start = start;\n this.length = length;\n }\n\n public int compareTo(Seg o) {\n int diff = (length - 1) / 2 - (o.length -1) / 2;\n if (diff != 0) {\n return -diff;\n }\n return start - o.start;\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["constructive algorithms", "binary search", "implementation"], "code_uid": "1382c868ba3862bfc0ea2e011639779a", "src_uid": "eb311bde6a0e3244d92fafbd4aa1e61f", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "\n\nimport java.io.DataInputStream;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.PriorityQueue;\n\npublic class C {\n\tstatic class Pair implements Comparable<Pair> {\n\t\tint node, depth;\n\n\t\tpublic Pair(int n, int v) {\n\t\t\tnode = n;\n\t\t\tdepth = v;\n\t\t}\n\n\t\tpublic int compareTo(Pair p) {\n\t\t\treturn new Integer(p.depth).compareTo(depth);\n\t\t}\n\t}\n\n\tstatic int[] parent;\n\n\tpublic static void union(int x, int y) {\n\t\tif (find(x) != find(y)) {\n\t\t\tparent[find(y)] = find(x);\n\t\t}\n\t}\n\n\tpublic static int find(int x) {\n\t\tif (parent[x] == x)\n\t\t\treturn x;\n\t\treturn parent[x] = find(parent[x]);\n\t}\n\n\tstatic ArrayList<Integer>[] graph;\n\tstatic PriorityQueue<Pair> pq;\n\tstatic int[] haveToPush;\n\tstatic int maxSz;\n\tstatic int[] p;\n\tstatic int[] reqVol, curVol;\n\tstatic int rem;\n\tpublic static void dfs(int cur, int parent, int depth) {\n\t\tp[cur] = parent;\n\t\tif (curVol[cur] > reqVol[cur]) {\n\t\t\thaveToPush[cur] = Math.min(rem,curVol[cur] - reqVol[cur]);\n\t\t\trem-=haveToPush[cur];\n\t\t\tif(haveToPush[cur]>0)\n\t\t\tpq.add(new Pair(cur, depth));\n\t\t}\n\t\tfor (Integer next : graph[cur]) {\n\t\t\tif (next != parent) {\n\t\t\t\tdfs(next, cur, depth + 1);\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic static void relax(int idx) {\n\t\tfor (Pair p : pendingList[idx]) {\n\t\t\tint push=Math.min(p.depth,maxSz-curVol[idx]);\n\t\t\tcurVol[p.node] -= push;\n\t\t\tcurVol[idx] += push;\n\t\t\ttrans++;\n\t\t\tres.add((p.node + 1) + \" \" + (idx + 1) + \" \" + (push));\n\t\t}\n\t\tfor (Pair p : pendingList[idx]) {\n\t\t\tif (pendingList[p.node].size() > 0) {\n\t\t\t\trelax(p.node);\n\t\t\t}\n\t\t}\n\t}\n\n\tstatic ArrayList<String> res;\n\tstatic ArrayList<Pair>[] pendingList;\n\tstatic int trans;\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tParser aa=new Parser(System.in);\n\t\tint vesCnt = aa.nextLong();\n\t\tmaxSz = aa.nextLong();\n\t\tint pipeCnt = aa.nextLong();\n\t\tgraph = new ArrayList[vesCnt];\n\t\tcurVol = new int[vesCnt];\n\t\treqVol = new int[vesCnt];\n\t\tlong curSum = 0, reqSum = 0;\n\t\tfor (int i = 0; i < vesCnt; i++) {\n\t\t\tcurVol[i] = aa.nextLong();\n\t\t\tcurSum += curVol[i];\n\t\t}\n\t\tfor (int i = 0; i < vesCnt; i++) {\n\t\t\treqVol[i] = aa.nextLong();\n\t\t\treqSum += reqVol[i];\n\t\t}\n\t\tif (curSum != reqSum) {\n\t\t\tSystem.out.println(\"NO\");\n\t\t\treturn;\n\t\t}\n\t\tparent = new int[vesCnt];\n\t\tfor (int i = 0; i < vesCnt; i++) {\n\t\t\tparent[i] = i;\n\t\t}\n\t\tfor (int i = 0; i < vesCnt; i++) {\n\t\t\tgraph[i] = new ArrayList<Integer>();\n\t\t}\n\t\tfor (int i = 0; i < pipeCnt; i++) {\n\t\t\tint source = aa.nextLong() - 1;\n\t\t\tint dest = aa.nextLong() - 1;\n\t\t\tif (find(source) != find(dest)) {\n\t\t\t\tgraph[source].add(dest);\n\t\t\t\tgraph[dest].add(source);\n\t\t\t\tunion(source, dest);\n\t\t\t}\n\t\t}\n\t\tp = new int[vesCnt];\n\t\tres = new ArrayList<String>();\n\t\tfor (int i = 0; i < vesCnt; i++) {\n\t\t\tif (curVol[i] < reqVol[i]) {\n//\t\t\t\tSystem.out.println(i+\" \"+res.size());\n\t\t\t\tArrays.fill(p, -1);\n\t\t\t\thaveToPush = new int[vesCnt];\n\t\t\t\tint[] pending = new int[vesCnt];\n\t\t\t\tpendingList = new ArrayList[vesCnt];\n\t\t\t\tfor (int j = 0; j < vesCnt; j++) {\n\t\t\t\t\tpendingList[j] = new ArrayList<Pair>();\n\t\t\t\t}\n\t\t\t\tpq = new PriorityQueue<Pair>();\n\t\t\t\t\n//\t\t\t\tSystem.out.println(Arrays.toString(curVol));\n//\t\t\t\tSystem.out.println(Arrays.toString(reqVol));\n\t\t\t\trem = reqVol[i] - curVol[i];\n\t\t\t\tdfs(i, -1, 0);\n//\t\t\t\tSystem.out.println(Arrays.toString(haveToPush));\n\t\t\t\tboolean[] vis=new boolean[vesCnt];\n\t\t\t\twhile ( !pq.isEmpty()) {\n\t\t\t\t\tPair pp = pq.remove();\n\t\t\t\t\tif(vis[pp.node]) continue;\n\t\t\t\t\tvis[pp.node]=true;\n\t\t\t\t\tint toPush = haveToPush[pp.node]\n\t\t\t\t\t\t\t+ pending[pp.node];\n\t\t\t\t\tint from = pp.node;\n\t\t\t\t\tint to = p[pp.node];\n\t\t\t\t\tif (to == -1)\n\t\t\t\t\t\tbreak;\n//\t\t\t\t\tif(i==0){\n//\t\t\t\t\t\tSystem.out.println(curVol[to]+\" \"+toPush+\" a7\"+\" \"+to+\" \"+from+\" \"+Arrays.toString(pending)+\" \"+Arrays.toString(haveToPush));\n//\t\t\t\t\t}\n\t\t\t\t\tif (maxSz - curVol[to] >= toPush) {\n\t\t\t\t\t\ttrans++;\n\t\t\t\t\t\tres.add((from + 1) + \" \" + (to + 1) + \" \" + toPush);\n\t\t\t\t\t\tcurVol[from] -= toPush;\n\t\t\t\t\t\tcurVol[to] += toPush;\n\t\t\t\t\t\thaveToPush[to] += toPush;\n\t\t\t\t\t\tif (pendingList[from].size() > 0) {\n\t\t\t\t\t\t\trelax(from);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(!vis[to])\n\t\t\t\t\t\tpq.add(new Pair(to, pp.depth - 1));\n\t\t\t\t\t} else {\n\t\t\t\t\t\tif (curVol[to] < maxSz) {\n\t\t\t\t\t\t\ttrans++;\n\t\t\t\t\t\t\tres.add((from + 1) + \" \" + (to + 1) + \" \"\n\t\t\t\t\t\t\t\t\t+ (maxSz - curVol[to]));\n\t\t\t\t\t\t\ttoPush -= (maxSz - curVol[to]);\n\t\t\t\t\t\t\thaveToPush[to] += (maxSz - curVol[to]);\n\t\t\t\t\t\t\tcurVol[from] -= (maxSz - curVol[to]);\n\t\t\t\t\t\t\tcurVol[to] = maxSz;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tpending[to] += (toPush);\n\t\t\t\t\t\tpendingList[to].add(new Pair(from, toPush));\n\t\t\t\t\t\tif(!vis[to])\n\t\t\t\t\t\tpq.add(new Pair(to, pp.depth - 1));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (curVol[i] != reqVol[i]) {\n\t\t\t\t\tSystem.out.println(\"NO\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(trans);\n\t\tfor (int i = 0; i < res.size(); i++) {\n\t\t\tif (i % 1000 == 0)\n\t\t\t\tout.flush();\n\t\t\tout.println(res.get(i));\n\t\t}\n\t\tout.flush();\n\t}\n\n\tstatic class Parser {\n\t\tfinal private int BUFFER_SIZE = 1 << 16;\n\n\t\tprivate DataInputStream din;\n\t\tprivate byte[] buffer;\n\t\tprivate int bufferPointer, bytesRead;\n\n\t\tpublic Parser(InputStream in) {\n\t\t\tdin = new DataInputStream(in);\n\t\t\tbuffer = new byte[BUFFER_SIZE];\n\t\t\tbufferPointer = bytesRead = 0;\n\t\t}\n\n\t\tpublic char nextChar() throws Exception {\n\t\t\tbyte c = read();\n\t\t\twhile (c <= ' ')\n\t\t\t\tc = read();\n\t\t\treturn (char) c;\n\t\t}\n\n\t\tpublic int nextLong() throws Exception {\n\t\t\tint ret = 0;\n\t\t\tbyte c = read();\n\t\t\twhile (c <= ' ')\n\t\t\t\tc = read();\n\t\t\tboolean neg = c == '-';\n\t\t\tif (neg)\n\t\t\t\tc = read();\n\t\t\tdo {\n\t\t\t\tret = ret * 10 + c - '0';\n\t\t\t\tc = read();\n\t\t\t} while (c > ' ');\n\t\t\tif (neg)\n\t\t\t\treturn -ret;\n\t\t\treturn ret;\n\t\t}\n\n\t\tprivate void fillBuffer() throws Exception {\n\t\t\tbytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n\t\t\tif (bytesRead == -1)\n\t\t\t\tbuffer[0] = -1;\n\t\t}\n\n\t\tprivate byte read() throws Exception {\n\t\t\tif (bufferPointer == bytesRead)\n\t\t\t\tfillBuffer();\n\t\t\treturn buffer[bufferPointer++];\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "constructive algorithms"], "code_uid": "c526391fc7d08b6b291411b5b15d64d2", "src_uid": "0939354d9bad8301efb79a1a934ded30", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.List;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.ArrayList;\nimport java.util.Comparator;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.util.Collections;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author vadimmm\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskE solver = new TaskE();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskE {\n\n private int vertexCounter, edgeCounter, value;\n private int[] path;\n private long[] initial, desired;\n private List<Integer>[] graph;\n private DSU dsu;\n private List<Integer> more, less;\n private boolean[] ready;\n private List<Transfusion> answer;\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n\n vertexCounter = in.nextInt();\n value = in.nextInt();\n edgeCounter = in.nextInt();\n\n initial = new long[vertexCounter];\n desired = new long[vertexCounter];\n ready = new boolean[vertexCounter];\n more = new ArrayList<Integer>();\n less = new ArrayList<Integer>();\n answer = new ArrayList<Transfusion>();\n graph = new ArrayList[vertexCounter];\n for (int i = 0; i < vertexCounter; ++i)\n graph[i] = new ArrayList<Integer>();\n\n for (int i = 0; i < vertexCounter; ++i)\n initial[i] = in.nextInt();\n for (int i = 0; i < vertexCounter; ++i)\n desired[i] = in.nextInt();\n\n dsu = new DSU(vertexCounter, initial, desired);\n\n int v, u;\n for (int i = 0; i < edgeCounter; ++i) {\n v = in.nextInt() - 1;\n u = in.nextInt() - 1;\n graph[u].add(v);\n graph[v].add(u);\n dsu.union(v, u);\n }\n\n if (!dsu.check()) {\n out.println(\"NO\");\n return;\n }\n\n for (int i = 0; i < vertexCounter; ++i)\n if (initial[i] == desired[i])\n ready[i] = true;\n else if (initial[i] > desired[i])\n more.add(i);\n else\n less.add(i);\n\n Comparator<Integer> cmp = new Comparator<Integer>() {\n @Override\n public int compare(Integer o1, Integer o2) {\n return Integer.compare(dsu.getSet(o1), dsu.getSet(o2));\n }\n };\n Collections.sort(more, cmp);\n Collections.sort(less, cmp);\n\n int current = 0;\n for (int i = 0; i < more.size(); ++i)\n if (initial[more.get(i)] - desired[more.get(i)] > desired[less.get(current)] - initial[less.get(current)]) {\n transfusion(more.get(i), less.get(current), (int) (desired[less.get(current)] - initial[less.get(current)]));\n ready[less.get(current)] = true;\n current++;\n i--;\n } else if (initial[more.get(i)] - desired[more.get(i)] < desired[less.get(current)] - initial[less.get(current)]) {\n transfusion(more.get(i), less.get(current), (int) (initial[more.get(i)] - desired[more.get(i)]));\n ready[more.get(i)] = true;\n } else {\n transfusion(more.get(i), less.get(current), (int) (initial[more.get(i)] - desired[more.get(i)]));\n ready[more.get(i)] = true;\n ready[less.get(current)] = true;\n current++;\n }\n\n out.println(answer.size());\n for (Transfusion transfusion : answer)\n transfusion.println(out);\n }\n\n private void transfusion(int from, int to, int delta) {\n path = new int[vertexCounter];\n Arrays.fill(path, -1);\n bfs(to, from);\n flow(from, to, delta);\n }\n\n private void bfs(int start, int finish) {\n int[] queue = new int[vertexCounter];\n int size = 0;\n int next = 0;\n queue[size++] = start;\n while (next < size) {\n int v = queue[next++];\n for (int u : graph[v])\n if (path[u] == -1) {\n path[u] = v;\n if (u == finish)\n return;\n queue[size++] = u;\n }\n }\n }\n\n private void flow(int from, int to, int delta) {\n if (from == to)\n return;\n \n if (initial[path[from]] + delta <= value) {\n\n initial[from] -= delta;\n initial[path[from]] += delta;\n answer.add(new Transfusion(from, path[from], delta));\n\n flow(path[from], to, delta);\n } else if (initial[path[from]] >= delta) {\n flow(path[from], to, delta);\n\n initial[from] -= delta;\n initial[path[from]] += delta;\n answer.add(new Transfusion(from, path[from], delta));\n } else {\n int difference = (int) (delta - initial[path[from]]);\n\n initial[from] -= difference;\n initial[path[from]] += difference;\n answer.add(new Transfusion(from, path[from], difference));\n\n flow(path[from], to, delta);\n\n initial[from] -= delta - difference;\n initial[path[from]] += delta - difference;\n answer.add(new Transfusion(from, path[from], delta - difference));\n }\n }\n\n}\n\nclass DSU {\n\n public int[] parent, rank;\n private long[] initial, desired;\n\n public DSU (int size, long[] initial, long[] desired) {\n parent = new int[size];\n rank = new int[size];\n this.initial = Arrays.copyOf(initial, initial.length);\n this.desired = Arrays.copyOf(desired, desired.length);\n for (int i = 0; i < size; ++i)\n parent[i] = i;\n for (int i = 0; i < size; ++i) {\n this.initial[getSet(i)] += initial[i];\n this.desired[getSet(i)] += desired[i];\n }\n }\n\n public int getSet(int v) {\n if (parent[v] == v)\n return v;\n return parent[v] = getSet(parent[v]);\n }\n\n public void union(int v, int u) {\n int a = getSet(v);\n int b = getSet(u);\n if (a != b) {\n if (rank[a] < rank[b]) {\n a ^= b;\n b ^= a;\n a ^= b;\n }\n parent[b] = a;\n if (rank[a] == rank[b])\n ++rank[a];\n }\n }\n\n public boolean check() {\n for (int v = 0; v < initial.length; ++v) {\n int p = getSet(v);\n if (p != v) {\n initial[p] += initial[v];\n desired[p] += desired[v];\n initial[v] = 0;\n desired[v] = 0;\n }\n }\n for (int i = 0; i < initial.length; ++i)\n if (initial[i] != desired[i])\n return false;\n return true;\n }\n\n}\n\nclass Transfusion {\n\n public int from, to, value;\n\n public Transfusion(int x, int y, int v) {\n from = x;\n to = y;\n value = v;\n }\n\n public void println(PrintWriter out) {\n out.print(from + 1);\n out.print(\" \");\n out.print(to + 1);\n out.print(\" \");\n out.println(value);\n }\n\n}\n\nclass InputReader {\n\n private static BufferedReader bufferedReader;\n private static StringTokenizer stringTokenizer;\n\n public InputReader(InputStream inputStream) {\n bufferedReader = new BufferedReader(new InputStreamReader(inputStream));\n stringTokenizer = null;\n }\n\n public String next() {\n while(stringTokenizer == null || !stringTokenizer.hasMoreTokens()) {\n try {\n stringTokenizer = new StringTokenizer(bufferedReader.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return stringTokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n\n", "lang_cluster": "Java", "tags": ["dfs and similar", "constructive algorithms"], "code_uid": "7abde53fa6c9e7b52ff35bd2a49b5828", "src_uid": "0939354d9bad8301efb79a1a934ded30", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class Main{\n \n BufferedReader in;\n StringTokenizer str = null;\n PrintWriter out;\n \n private String next() throws Exception{\n \tif (str == null || !str.hasMoreElements())\n \t str = new StringTokenizer(in.readLine());\n \treturn str.nextToken();\n }\n \n private int nextInt() throws Exception{\n\treturn Integer.parseInt(next());\n }\n \n private long nextLong() throws Exception{\n\treturn Long.parseLong(next());\n }\n\n\n int n, e;\n long V;\n\n int [][]g;\n long []a, b, amount;\n boolean used[];\n \n long total = 0;\n int size = 0, yk = 0;\n int []comp, prev;\n\n int []from, to;\n public void run() throws Exception{\n \tin = new BufferedReader(new InputStreamReader(System.in));\n \tout = new PrintWriter(System.out);\n\n\tn = nextInt();\n\tV = nextLong();\n\te = nextInt();\n\t\n\ta = new long[n];\n\tfor(int i=0;i<n;i++){\n\t a[i] = nextLong();\n\t}\n\tb = new long[n];\n\tfor(int i=0;i<n;i++){\n\t b[i] = nextLong();\n\t}\n\t\n\tfrom = new int[2*n*n];\n\tto = new int[2*n*n];\n\tamount = new long[2*n*n];\n\n\tg = new int[n][n];\n\tfor(int i=0;i<e;i++){\n\t int x = nextInt()-1, y = nextInt()-1;\n\t g[x][y] = g[y][x] = 1;\n\t}\n\t\n\tcomp = new int[n];\n\tprev = new int[n];\n\tArrays.fill(prev, -1);\n\tused = new boolean[n];\n\tboolean ok =true;\n\t\n\tfor(int i=0;i<n;i++){\n\t if (!used[i]){\n\t\tsize = 0;\n\t\ttotal = 0;\n\t\tdfs(i);\n\t\tif (total != 0){\n\t\t ok = false;\n\t\t break;\n\t\t}\n\t\tboolean process = true;\n\t\twhile(process){\n\n\t\t process = false;\n\n\t\t for(int j=0;j<size;j++){\n\t\t\tint v = comp[j];\n\t\t\tif (a[v] <= b[v]) continue;\n\t\t\tprocess = true;\n\t\t\tfor(int k=0;k<size;k++){\n\t\t\t prev[comp[k]] = -1;\n\t\t\t}\n\t\t\tparents(v);\n\t\t\tint u = -1;\n\t\t\tfor(int k=0;k<size;k++){\n\t\t\t int t = comp[k];\n\t\t\t if (a[t] < b[t]){\n\t\t\t\tu = t;\n\t\t\t\tbreak; \n\t\t\t }\n\t\t\t}\n\t\t\tlong d = Math.min(a[v] - b[v], b[u] - a[u]);\n\t\t\tpour(v, u, d);\n\t\t }\n\t\t}\n\t }\n\t}\n\n\tif (!ok){\n\t out.println(\"NO\");\n\t}else{\n\t out.println(yk);\n\t for(int i=0;i<yk;i++){\n\t\tout.println(from[i] + \" \" + to[i] + \" \" + amount[i]);\n\t }\n\t}\n\tout.close();\n }\n\n private void pour(int s, int t, long d){\n\tif (s == t) return;\n\tint parent = prev[t];\n\tlong x = Math.min(d, a[parent]);\n\tx = Math.min(x, V - a[t]);\n\tadd(parent, t, x);\n\tpour(s, parent, d);\n\tadd(parent, t, d-x);\n }\n\n private void add(int s, int t, long d){\n\tif (d == 0) return;\n\tfrom[yk] = s+1;\n\tto[yk] = t+1;\n\tamount[yk++] = d;\n\ta[s]-=d;\n\ta[t]+=d;\n }\n\n private void parents(int x){\n\tfor(int i=0;i<n;i++){\n\t if (prev[i] < 0 && g[x][i] == 1) {\n\t\tprev[i] = x;\n\t\tparents(i);\n\t }\n\t}\n }\n\n private void dfs(int x){\n\tused[x] = true;\n\ttotal+=a[x] - b[x];\n\tfor(int i=0;i<n;i++){\n\t if (!used[i] && g[x][i] == 1){\n\t\tdfs(i);\n\t }\n\t}\n\tcomp[size++] = x;\n }\n\n public static void main(String args[]) throws Exception{\n\t new Main().run();\n }\n}", "lang_cluster": "Java", "tags": ["dfs and similar", "constructive algorithms"], "code_uid": "22741835c498861c39729b57342b6c06", "src_uid": "0939354d9bad8301efb79a1a934ded30", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n public static void main(String[] args) throws IOException {\n new Solution().run();\n }\n\n int divs[] = new int[100];\n int divcnt = 0;\n\n public void solve() throws IOException {\n int n = nextInt();\n int x = nextInt();\n\n int npp = n + 1;\n for(int i = 2; i * i <= npp; ++i) {\n if(npp % i == 0) {\n out.println(-1);\n return;\n }\n }\n\n for(int i = 2; i * i <= n; ++i) {\n if(n % i == 0) {\n divs[divcnt++] = n / i;\n }\n }\n\n int stop = Math.max(2, x - n - 2);\n for(int b = x - 1; b >= stop; --b) {\n if(binpow(b, n, npp) == 1) {\n boolean ok = true;\n for(int d = 0; d < divcnt && ok; ++d) {\n ok = binpow(b, divs[d], npp) != 1;\n }\n if(ok) {\n out.println(b);\n return;\n }\n }\n }\n\n out.println(-1);\n }\n\n int binpow(long a, int n, int mod) {\n long res = 1 % mod;\n while(n != 0) {\n if((n & 1) != 0) {\n res = res * a % mod;\n }\n a = a * a % mod;\n n >>= 1;\n }\n return (int)res;\n }\n\n BufferedReader br;\n StringTokenizer in;\n PrintWriter out;\n\n String nextToken() throws IOException {\n while( in == null || !in.hasMoreTokens() ) {\n in = new StringTokenizer(br.readLine());\n }\n\n return in.nextToken();\n }\n\n public int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n public long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n public double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n void run() throws IOException {\n boolean oj = System.getProperty( \"ONLINE_JUDGE\" ) != null;\n Reader reader = new InputStreamReader( oj ? System.in : new FileInputStream(\"input.txt\"));\n Writer writer = new OutputStreamWriter( oj ? System.out : new FileOutputStream(\"output.txt\"));\n br = new BufferedReader(reader);\n out = new PrintWriter(writer);\n\n solve();\n\n out.close();\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "28530b4fb5e9480a51fa3966eb30c1f8", "src_uid": "29dda6a3f057e5bccdc076d7e492ac9a", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\r\nimport java.util.*;\r\n\r\npublic class Solution {\r\n private static int MOD = (1000000000+7);\r\n\r\n public static void main(String[] args) {\r\n FastReader sc = new FastReader();\r\n int n = sc.nextInt();\r\n int k = sc.nextInt();\r\n\r\n long ans = pow_mod(2,n);\r\n long pascalTriangle = 1;\r\n long m = pow_mod(2,n-k);\r\n for(int i = 0; i < n-k; i++){\r\n ans = sub(ans, mul(pascalTriangle,(m-1)));\r\n m = m * pow_mod(2, MOD-2) % MOD;\r\n long temp = mul(pascalTriangle, (k+i));\r\n pascalTriangle = temp * pow_mod(i+1, MOD-2) % MOD;\r\n }\r\n\r\n System.out.println(ans);\r\n }\r\n\r\n public static long mul(long a, long b) {\r\n return (long) a * b % MOD;\r\n }\r\n\r\n private static long sub(long a, long b) {\r\n return a >= b ? a - b : a - b + MOD;\r\n }\r\n\r\n private static long pow_mod (long x, long n) {\r\n long y = 1;\r\n while (n > 0) {\r\n if (n%2 != 0)\r\n y = y * x % MOD;\r\n n = n/2;\r\n x = x * x % MOD;\r\n }\r\n return y;\r\n }\r\n\r\n private static int max(int a, int b){\r\n return Math.max(a, b);\r\n }\r\n\r\n private static int min(int a, int b){\r\n return Math.min(a, b);\r\n }\r\n\r\n static class FastReader {\r\n BufferedReader br;\r\n StringTokenizer st;\r\n\r\n public FastReader()\r\n {\r\n br = new BufferedReader(\r\n new InputStreamReader(System.in));\r\n }\r\n\r\n String next()\r\n {\r\n while (st == null || !st.hasMoreElements()) {\r\n try {\r\n st = new StringTokenizer(br.readLine());\r\n }\r\n catch (IOException e) {\r\n e.printStackTrace();\r\n }\r\n }\r\n return st.nextToken();\r\n }\r\n\r\n int nextInt() { return Integer.parseInt(next()); }\r\n\r\n long nextLong() { return Long.parseLong(next()); }\r\n\r\n double nextDouble()\r\n {\r\n return Double.parseDouble(next());\r\n }\r\n\r\n String nextLine()\r\n {\r\n String str = \"\";\r\n try {\r\n if(st.hasMoreTokens()){\r\n str = st.nextToken(\"\\n\");\r\n }\r\n else{\r\n str = br.readLine();\r\n }\r\n }\r\n catch (IOException e) {\r\n e.printStackTrace();\r\n }\r\n return str;\r\n }\r\n\r\n int[] intArray(int n){\r\n int[] arr = new int[n];\r\n for(int i =0; i < n; i ++){\r\n arr[i] = nextInt();\r\n }\r\n return arr;\r\n }\r\n }\r\n}", "lang_cluster": "Java", "tags": ["math", "greedy", "constructive algorithms", "combinatorics"], "code_uid": "184e244ed41d097652ebae18d542fa8f", "src_uid": "dc7b887afcc2e95c4e90619ceda63071", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\nimport java.io.BufferedReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n HZSShufflesCards solver = new HZSShufflesCards();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class HZSShufflesCards {\n NumberTheory.Mod998 mod = new NumberTheory.Mod998();\n int n;\n int m;\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n n = in.nextInt();\n m = in.nextInt();\n\n mod.fInv(n + m);\n\n long phaseSize = 1;\n long p = 1;\n for (int i = 0; p != 0; i++) {\n p = mod.mult(p, n - i, mod.smallInv(n + m - i));\n phaseSize = mod.add(phaseSize, p);\n }\n\n long answer = 0;\n for (int k = 1; k <= n; k++) {\n long sign = mod.paritySign(k + 1);\n long numPhases = mod.mult(m + k, mod.smallInv(k));\n long term = mod.mult(sign, mod.ncr(n, k), numPhases, phaseSize);\n answer = mod.add(answer, term);\n }\n\n out.println(answer);\n }\n\n }\n\n static class InputReader {\n public final BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n\n static class Util {\n public static void ASSERT(boolean assertion) {\n if (!assertion)\n throw new AssertionError();\n }\n\n private Util() {\n }\n\n }\n\n static class IntStack {\n int[] array;\n int size = 0;\n\n public IntStack() {\n this(8);\n }\n\n public IntStack(int capacity) {\n array = new int[capacity];\n }\n\n public void push(int item) {\n if (size >= array.length)\n array = resize(array);\n array[size++] = item;\n }\n\n public int size() {\n return size;\n }\n\n public int get(int i) {\n Util.ASSERT(i < size);\n return array[i];\n }\n\n private static int[] resize(int[] array) {\n int[] newArray = new int[array.length << 1];\n System.arraycopy(array, 0, newArray, 0, array.length);\n return newArray;\n }\n\n public String toString() {\n int[] trimmed = new int[size];\n System.arraycopy(array, 0, trimmed, 0, size);\n return Arrays.toString(trimmed);\n }\n\n }\n\n static class NumberTheory {\n private static void ASSERT(boolean assertion) {\n if (!assertion)\n throw new AssertionError();\n }\n\n public abstract static class Modulus<M extends NumberTheory.Modulus<M>> {\n final IntStack factorial = new IntStack();\n final IntStack invFactorial = new IntStack();\n\n public abstract long modulus();\n\n public Modulus() {\n super();\n factorial.push(1);\n invFactorial.push(1);\n }\n\n public long fact(int n) {\n while (factorial.size() <= n) {\n factorial.push((int) mult(factorial.get(factorial.size() - 1), factorial.size()));\n }\n\n return factorial.get(n);\n }\n\n public long fInv(int n) {\n int lastKnown = invFactorial.size() - 1;\n\n if (lastKnown < n) {\n long[] fInv = new long[n - lastKnown];\n fInv[0] = inv(fact(n));\n for (int i = 1; i < fInv.length; i++) {\n fInv[i] = mult(fInv[i - 1], n - i + 1);\n }\n for (int i = fInv.length - 1; i >= 0; i--) {\n invFactorial.push((int) fInv[i]);\n }\n }\n\n return invFactorial.get(n);\n }\n\n public long paritySign(long k) {\n return (k & 1) == 0 ? 1 : modulus() - 1;\n }\n\n public long ncr(int n, int r) {\n ASSERT(n >= 0);\n if (r < 0 || n < r)\n return 0;\n return mult(fact(n), mult(fInv(r), fInv(n - r)));\n }\n\n public long smallInv(int n) {\n return mult(fInv(n), fact(n - 1));\n }\n\n public long normalize(long x) {\n x %= modulus();\n if (x < 0)\n x += modulus();\n return x;\n }\n\n public long add(long a, long b) {\n long v = a + b;\n return v < modulus() ? v : v - modulus();\n }\n\n public long mult(long... x) {\n long r = 1;\n for (long i : x)\n r = mult(r, i);\n return r;\n }\n\n public long mult(long a, long b) {\n return (a * b) % modulus();\n }\n\n public long inv(long value) {\n long g = modulus(), x = 0, y = 1;\n for (long r = value; r != 0; ) {\n long q = g / r;\n g %= r;\n\n long temp = g;\n g = r;\n r = temp;\n\n x -= q * y;\n\n temp = x;\n x = y;\n y = temp;\n }\n\n ASSERT(g == 1);\n ASSERT(y == modulus() || y == -modulus());\n\n return normalize(x);\n }\n\n }\n\n public static class Mod998 extends NumberTheory.Modulus<NumberTheory.Mod998> {\n public long modulus() {\n return 998_244_353L;\n }\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "aed2eec1968dee16383f93789bc86897", "src_uid": "9f2b59df7bef2aeee0ce71facd2b1613", "difficulty": 3000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\nimport java.io.BufferedReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n HZSShufflesCards solver = new HZSShufflesCards();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class HZSShufflesCards {\n NumberTheory.Mod998 mod = new NumberTheory.Mod998();\n int n;\n int m;\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n n = in.nextInt();\n m = in.nextInt();\n\n mod.fInv(n + m);\n\n long phaseSize = 1;\n long p = 1;\n for (int i = 0; p != 0; i++) {\n p = mod.mult(p, n - i, mod.smallInv(n + m - i));\n phaseSize = mod.add(phaseSize, p);\n }\n\n long answer = 0;\n for (int k = 1; k <= n; k++) {\n long numPhases = mod.mult(m + k, mod.smallInv(k));\n long term = mod.mult(mod.ncr(n, k), numPhases, phaseSize);\n if ((k & 1) == 1)\n answer = mod.add(answer, term);\n else\n answer = mod.subtract(answer, term);\n }\n\n out.println(answer);\n }\n\n }\n\n static class InputReader {\n public final BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n\n static class Util {\n public static void ASSERT(boolean assertion) {\n if (!assertion)\n throw new AssertionError();\n }\n\n private Util() {\n }\n\n }\n\n static class IntStack {\n int[] array;\n int size = 0;\n\n public IntStack() {\n this(8);\n }\n\n public IntStack(int capacity) {\n array = new int[capacity];\n }\n\n public void push(int item) {\n if (size >= array.length)\n array = resize(array);\n array[size++] = item;\n }\n\n public int size() {\n return size;\n }\n\n public int get(int i) {\n Util.ASSERT(i < size);\n return array[i];\n }\n\n private static int[] resize(int[] array) {\n int[] newArray = new int[array.length << 1];\n System.arraycopy(array, 0, newArray, 0, array.length);\n return newArray;\n }\n\n public String toString() {\n int[] trimmed = new int[size];\n System.arraycopy(array, 0, trimmed, 0, size);\n return Arrays.toString(trimmed);\n }\n\n }\n\n static class NumberTheory {\n private static void ASSERT(boolean assertion) {\n if (!assertion)\n throw new AssertionError();\n }\n\n public abstract static class Modulus<M extends NumberTheory.Modulus<M>> {\n final IntStack factorial = new IntStack();\n final IntStack invFactorial = new IntStack();\n\n public abstract long modulus();\n\n public Modulus() {\n super();\n factorial.push(1);\n invFactorial.push(1);\n }\n\n public long fact(int n) {\n while (factorial.size() <= n) {\n factorial.push((int) mult(factorial.get(factorial.size() - 1), factorial.size()));\n }\n\n return factorial.get(n);\n }\n\n public long fInv(int n) {\n int lastKnown = invFactorial.size() - 1;\n\n if (lastKnown < n) {\n long[] fInv = new long[n - lastKnown];\n fInv[0] = inv(fact(n));\n for (int i = 1; i < fInv.length; i++) {\n fInv[i] = mult(fInv[i - 1], n - i + 1);\n }\n for (int i = fInv.length - 1; i >= 0; i--) {\n invFactorial.push((int) fInv[i]);\n }\n }\n\n return invFactorial.get(n);\n }\n\n public long ncr(int n, int r) {\n ASSERT(n >= 0);\n if (r < 0 || n < r)\n return 0;\n return mult(fact(n), mult(fInv(r), fInv(n - r)));\n }\n\n public long smallInv(int n) {\n return mult(fInv(n), fact(n - 1));\n }\n\n public long normalize(long x) {\n x %= modulus();\n if (x < 0)\n x += modulus();\n return x;\n }\n\n public long add(long a, long b) {\n long v = a + b;\n return v < modulus() ? v : v - modulus();\n }\n\n public long subtract(long a, long b) {\n long v = a - b;\n return v < 0 ? v + modulus() : v;\n }\n\n public long mult(long... x) {\n long r = 1;\n for (long i : x)\n r = mult(r, i);\n return r;\n }\n\n public long mult(long a, long b) {\n return (a * b) % modulus();\n }\n\n public long inv(long value) {\n long g = modulus(), x = 0, y = 1;\n for (long r = value; r != 0; ) {\n long q = g / r;\n g %= r;\n\n long temp = g;\n g = r;\n r = temp;\n\n x -= q * y;\n\n temp = x;\n x = y;\n y = temp;\n }\n\n ASSERT(g == 1);\n ASSERT(y == modulus() || y == -modulus());\n\n return normalize(x);\n }\n\n }\n\n public static class Mod998 extends NumberTheory.Modulus<NumberTheory.Mod998> {\n public long modulus() {\n return 998_244_353L;\n }\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "ef05efbd498e53413afeb0827852e156", "src_uid": "9f2b59df7bef2aeee0ce71facd2b1613", "difficulty": 3000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\nimport java.io.BufferedReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n HZSShufflesCards solver = new HZSShufflesCards();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class HZSShufflesCards {\n NumberTheory.Mod998 mod = new NumberTheory.Mod998();\n int n;\n int m;\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n n = in.nextInt();\n m = in.nextInt();\n\n mod.fInv(n + m);\n\n long phaseSize = 1;\n long p = 1;\n for (int i = 0; p != 0; i++) {\n p = mod.mult(p, n - i, mod.smallInv(n + m - i));\n phaseSize = mod.add(phaseSize, p);\n }\n\n long answer = 0;\n for (int k = 1; k <= n; k++) {\n long numPhases = mod.mult(m + k, mod.smallInv(k));\n long e = mod.mult(numPhases, phaseSize);\n long term = mod.mult(mod.ncr(n, k), e);\n\n if (k % 2 == 1)\n answer = mod.add(answer, term);\n else\n answer = mod.subtract(answer, term);\n }\n\n out.println(answer);\n }\n\n }\n\n static class InputReader {\n public final BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n\n static class Util {\n public static void ASSERT(boolean assertion) {\n if (!assertion)\n throw new AssertionError();\n }\n\n private Util() {\n }\n\n }\n\n static class IntStack {\n int[] array;\n int size = 0;\n\n public IntStack() {\n this(8);\n }\n\n public IntStack(int capacity) {\n array = new int[capacity];\n }\n\n public void push(int item) {\n if (size >= array.length)\n array = resize(array);\n array[size++] = item;\n }\n\n public int size() {\n return size;\n }\n\n public int get(int i) {\n Util.ASSERT(i < size);\n return array[i];\n }\n\n private static int[] resize(int[] array) {\n int[] newArray = new int[array.length << 1];\n System.arraycopy(array, 0, newArray, 0, array.length);\n return newArray;\n }\n\n public String toString() {\n int[] trimmed = new int[size];\n System.arraycopy(array, 0, trimmed, 0, size);\n return Arrays.toString(trimmed);\n }\n\n }\n\n static class NumberTheory {\n private static void ASSERT(boolean assertion) {\n if (!assertion)\n throw new AssertionError();\n }\n\n public abstract static class Modulus<M extends NumberTheory.Modulus<M>> {\n final IntStack factorial = new IntStack();\n final IntStack invFactorial = new IntStack();\n\n public abstract long modulus();\n\n public Modulus() {\n super();\n factorial.push(1);\n invFactorial.push(1);\n }\n\n public long fact(int n) {\n while (factorial.size() <= n) {\n factorial.push((int) mult(factorial.get(factorial.size() - 1), factorial.size()));\n }\n\n return factorial.get(n);\n }\n\n public long fInv(int n) {\n int lastKnown = invFactorial.size() - 1;\n\n if (lastKnown < n) {\n long[] fInv = new long[n - lastKnown];\n fInv[0] = inv(fact(n));\n for (int i = 1; i < fInv.length; i++) {\n fInv[i] = mult(fInv[i - 1], n - i + 1);\n }\n for (int i = fInv.length - 1; i >= 0; i--) {\n invFactorial.push((int) fInv[i]);\n }\n }\n\n return invFactorial.get(n);\n }\n\n public long ncr(int n, int r) {\n ASSERT(n >= 0);\n if (r < 0 || n < r)\n return 0;\n return mult(fact(n), mult(fInv(r), fInv(n - r)));\n }\n\n public long smallInv(int n) {\n return mult(fInv(n), fact(n - 1));\n }\n\n public long normalize(long x) {\n x %= modulus();\n if (x < 0)\n x += modulus();\n return x;\n }\n\n public long add(long a, long b) {\n long v = a + b;\n return v < modulus() ? v : v - modulus();\n }\n\n public long subtract(long a, long b) {\n long v = a - b;\n return v < 0 ? v + modulus() : v;\n }\n\n public long mult(long... x) {\n long r = 1;\n for (long i : x)\n r = mult(r, i);\n return r;\n }\n\n public long mult(long a, long b) {\n return (a * b) % modulus();\n }\n\n public long inv(long value) {\n long g = modulus(), x = 0, y = 1;\n for (long r = value; r != 0; ) {\n long q = g / r;\n g %= r;\n\n long temp = g;\n g = r;\n r = temp;\n\n x -= q * y;\n\n temp = x;\n x = y;\n y = temp;\n }\n\n ASSERT(g == 1);\n ASSERT(y == modulus() || y == -modulus());\n\n return normalize(x);\n }\n\n }\n\n public static class Mod998 extends NumberTheory.Modulus<NumberTheory.Mod998> {\n public long modulus() {\n return 998_244_353L;\n }\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "ab52edb534b983cb8860cb74cd388e3f", "src_uid": "9f2b59df7bef2aeee0ce71facd2b1613", "difficulty": 3000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\nimport java.io.BufferedReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n HZSShufflesCards solver = new HZSShufflesCards();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class HZSShufflesCards {\n NumberTheory.Mod998 mod = new NumberTheory.Mod998();\n int n;\n int m;\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n n = in.nextInt();\n m = in.nextInt();\n\n mod.fInv(n + m);\n\n long phaseSize = 1;\n long p = 1;\n for (int i = 0; p != 0; i++) {\n p = mod.mult(p, n - i, mod.smallInv(n + m - i));\n phaseSize = mod.add(phaseSize, p);\n }\n\n long answer = 0;\n for (int k = 1; k <= n; k++) {\n long numPhases = mod.mult(m + k, mod.smallInv(k));\n long term = mod.mult(mod.ncr(n, k), numPhases, phaseSize);\n if (k % 2 == 1)\n answer = mod.add(answer, term);\n else\n answer = mod.subtract(answer, term);\n }\n\n out.println(answer);\n }\n\n }\n\n static class InputReader {\n public final BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n\n static class Util {\n public static void ASSERT(boolean assertion) {\n if (!assertion)\n throw new AssertionError();\n }\n\n private Util() {\n }\n\n }\n\n static class IntStack {\n int[] array;\n int size = 0;\n\n public IntStack() {\n this(8);\n }\n\n public IntStack(int capacity) {\n array = new int[capacity];\n }\n\n public void push(int item) {\n if (size >= array.length)\n array = resize(array);\n array[size++] = item;\n }\n\n public int size() {\n return size;\n }\n\n public int get(int i) {\n Util.ASSERT(i < size);\n return array[i];\n }\n\n private static int[] resize(int[] array) {\n int[] newArray = new int[array.length << 1];\n System.arraycopy(array, 0, newArray, 0, array.length);\n return newArray;\n }\n\n public String toString() {\n int[] trimmed = new int[size];\n System.arraycopy(array, 0, trimmed, 0, size);\n return Arrays.toString(trimmed);\n }\n\n }\n\n static class NumberTheory {\n private static void ASSERT(boolean assertion) {\n if (!assertion)\n throw new AssertionError();\n }\n\n public abstract static class Modulus<M extends NumberTheory.Modulus<M>> {\n final IntStack factorial = new IntStack();\n final IntStack invFactorial = new IntStack();\n\n public abstract long modulus();\n\n public Modulus() {\n super();\n factorial.push(1);\n invFactorial.push(1);\n }\n\n public long fact(int n) {\n while (factorial.size() <= n) {\n factorial.push((int) mult(factorial.get(factorial.size() - 1), factorial.size()));\n }\n\n return factorial.get(n);\n }\n\n public long fInv(int n) {\n int lastKnown = invFactorial.size() - 1;\n\n if (lastKnown < n) {\n long[] fInv = new long[n - lastKnown];\n fInv[0] = inv(fact(n));\n for (int i = 1; i < fInv.length; i++) {\n fInv[i] = mult(fInv[i - 1], n - i + 1);\n }\n for (int i = fInv.length - 1; i >= 0; i--) {\n invFactorial.push((int) fInv[i]);\n }\n }\n\n return invFactorial.get(n);\n }\n\n public long ncr(int n, int r) {\n ASSERT(n >= 0);\n if (r < 0 || n < r)\n return 0;\n return mult(fact(n), mult(fInv(r), fInv(n - r)));\n }\n\n public long smallInv(int n) {\n return mult(fInv(n), fact(n - 1));\n }\n\n public long normalize(long x) {\n x %= modulus();\n if (x < 0)\n x += modulus();\n return x;\n }\n\n public long add(long a, long b) {\n long v = a + b;\n return v < modulus() ? v : v - modulus();\n }\n\n public long subtract(long a, long b) {\n long v = a - b;\n return v < 0 ? v + modulus() : v;\n }\n\n public long mult(long... x) {\n long r = 1;\n for (long i : x)\n r = mult(r, i);\n return r;\n }\n\n public long mult(long a, long b) {\n return (a * b) % modulus();\n }\n\n public long inv(long value) {\n long g = modulus(), x = 0, y = 1;\n for (long r = value; r != 0; ) {\n long q = g / r;\n g %= r;\n\n long temp = g;\n g = r;\n r = temp;\n\n x -= q * y;\n\n temp = x;\n x = y;\n y = temp;\n }\n\n ASSERT(g == 1);\n ASSERT(y == modulus() || y == -modulus());\n\n return normalize(x);\n }\n\n }\n\n public static class Mod998 extends NumberTheory.Modulus<NumberTheory.Mod998> {\n public long modulus() {\n return 998_244_353L;\n }\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "0784c6c7b8771017b4df9cad04b112ae", "src_uid": "9f2b59df7bef2aeee0ce71facd2b1613", "difficulty": 3000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\nimport java.io.BufferedReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n HZSShufflesCards solver = new HZSShufflesCards();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class HZSShufflesCards {\n NumberTheory.Mod998 mod = new NumberTheory.Mod998();\n int n;\n int m;\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n n = in.nextInt();\n m = in.nextInt();\n\n long phaseSize = 1;\n long p = 1;\n for (int i = 0; p != 0; i++) {\n p = mod.mult(p, n - i, mod.smallInv(n + m - i));\n phaseSize = mod.add(phaseSize, p);\n }\n\n long answer = 0;\n for (int k = 1; k <= n; k++) {\n long numPhases = mod.mult(m + k, mod.smallInv(k));\n long term = mod.mult(mod.ncr(n, k), numPhases, phaseSize);\n if ((k & 1) == 1)\n answer = mod.add(answer, term);\n else\n answer = mod.subtract(answer, term);\n }\n\n out.println(answer);\n }\n\n }\n\n static class InputReader {\n public final BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n\n static class Util {\n public static void ASSERT(boolean assertion) {\n if (!assertion)\n throw new AssertionError();\n }\n\n private Util() {\n }\n\n }\n\n static class IntStack {\n int[] array;\n int size = 0;\n\n public IntStack() {\n this(8);\n }\n\n public IntStack(int capacity) {\n array = new int[capacity];\n }\n\n public void push(int item) {\n if (size >= array.length)\n array = resize(array);\n array[size++] = item;\n }\n\n public int size() {\n return size;\n }\n\n public int get(int i) {\n Util.ASSERT(i < size);\n return array[i];\n }\n\n private static int[] resize(int[] array) {\n int[] newArray = new int[array.length << 1];\n System.arraycopy(array, 0, newArray, 0, array.length);\n return newArray;\n }\n\n public String toString() {\n int[] trimmed = new int[size];\n System.arraycopy(array, 0, trimmed, 0, size);\n return Arrays.toString(trimmed);\n }\n\n }\n\n static class NumberTheory {\n private static void ASSERT(boolean assertion) {\n if (!assertion)\n throw new AssertionError();\n }\n\n public abstract static class Modulus<M extends NumberTheory.Modulus<M>> {\n final IntStack factorial = new IntStack();\n final IntStack invFactorial = new IntStack();\n\n public abstract long modulus();\n\n public Modulus() {\n super();\n factorial.push(1);\n invFactorial.push(1);\n }\n\n public long fact(int n) {\n while (factorial.size() <= n) {\n factorial.push((int) mult(factorial.get(factorial.size() - 1), factorial.size()));\n }\n\n return factorial.get(n);\n }\n\n public long fInv(int n) {\n int lastKnown = invFactorial.size() - 1;\n\n if (lastKnown < n) {\n long[] fInv = new long[n - lastKnown];\n fInv[0] = inv(fact(n));\n for (int i = 1; i < fInv.length; i++) {\n fInv[i] = mult(fInv[i - 1], n - i + 1);\n }\n for (int i = fInv.length - 1; i >= 0; i--) {\n invFactorial.push((int) fInv[i]);\n }\n }\n\n return invFactorial.get(n);\n }\n\n public long ncr(int n, int r) {\n ASSERT(n >= 0);\n if (r < 0 || n < r)\n return 0;\n return mult(fact(n), mult(fInv(r), fInv(n - r)));\n }\n\n public long smallInv(int n) {\n return mult(fInv(n), fact(n - 1));\n }\n\n public long normalize(long x) {\n x %= modulus();\n if (x < 0)\n x += modulus();\n return x;\n }\n\n public long add(long a, long b) {\n long v = a + b;\n return v < modulus() ? v : v - modulus();\n }\n\n public long subtract(long a, long b) {\n long v = a - b;\n return v < 0 ? v + modulus() : v;\n }\n\n public long mult(long... x) {\n long r = 1;\n for (long i : x)\n r = mult(r, i);\n return r;\n }\n\n public long mult(long a, long b) {\n return (a * b) % modulus();\n }\n\n public long inv(long value) {\n long g = modulus(), x = 0, y = 1;\n for (long r = value; r != 0; ) {\n long q = g / r;\n g %= r;\n\n long temp = g;\n g = r;\n r = temp;\n\n x -= q * y;\n\n temp = x;\n x = y;\n y = temp;\n }\n\n ASSERT(g == 1);\n ASSERT(y == modulus() || y == -modulus());\n\n return normalize(x);\n }\n\n }\n\n public static class Mod998 extends NumberTheory.Modulus<NumberTheory.Mod998> {\n public long modulus() {\n return 998_244_353L;\n }\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "c6a7d0d32cd4dbf3cdf66439793f9149", "src_uid": "9f2b59df7bef2aeee0ce71facd2b1613", "difficulty": 3000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.StringTokenizer;\nimport java.io.BufferedReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n HZSShufflesCards solver = new HZSShufflesCards();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class HZSShufflesCards {\n NumberTheory.Mod998 mod = new NumberTheory.Mod998();\n int n;\n int m;\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n n = in.nextInt();\n m = in.nextInt();\n\n mod.fInv(n + m);\n\n long phaseSize = 1;\n long p = 1;\n for (int i = 0; p != 0; i++) {\n p = mod.mult(p, n - i, mod.smallInv(n + m - i));\n phaseSize = mod.add(phaseSize, p);\n }\n\n long answer = 0;\n for (int k = 1; k <= n; k++) {\n long numPhases = mod.mult(m + k, mod.smallInv(k));\n long e = mod.mult(numPhases, phaseSize);\n long term = mod.mult(mod.ncr(n, k), e);\n\n if (k % 2 == 1)\n answer = mod.add(answer, term);\n else\n answer = mod.subtract(answer, term);\n }\n\n out.println(answer);\n }\n\n }\n\n static class NumberTheory {\n private static void ASSERT(boolean assertion) {\n if (!assertion)\n throw new AssertionError();\n }\n\n public abstract static class Modulus<M extends NumberTheory.Modulus<M>> {\n final ArrayList<Long> factorial = new ArrayList<>();\n final ArrayList<Long> invFactorial = new ArrayList<>();\n\n public abstract long modulus();\n\n public Modulus() {\n super();\n factorial.add(1L);\n invFactorial.add(1L);\n }\n\n public long fact(int n) {\n while (factorial.size() <= n) {\n factorial.add(mult(factorial.get(factorial.size() - 1), factorial.size()));\n }\n\n return factorial.get(n);\n }\n\n public long fInv(int n) {\n int lastKnown = invFactorial.size() - 1;\n\n if (lastKnown < n) {\n long[] fInv = new long[n - lastKnown];\n fInv[0] = inv(fact(n));\n for (int i = 1; i < fInv.length; i++) {\n fInv[i] = mult(fInv[i - 1], n - i + 1);\n }\n for (int i = fInv.length - 1; i >= 0; i--) {\n invFactorial.add(fInv[i]);\n }\n }\n\n return invFactorial.get(n);\n }\n\n public long ncr(int n, int r) {\n ASSERT(n >= 0);\n if (r < 0 || n < r)\n return 0;\n return mult(fact(n), mult(fInv(r), fInv(n - r)));\n }\n\n public long smallInv(int n) {\n return mult(fInv(n), fact(n - 1));\n }\n\n public long normalize(long x) {\n x %= modulus();\n if (x < 0)\n x += modulus();\n return x;\n }\n\n public long add(long a, long b) {\n long v = a + b;\n return v < modulus() ? v : v - modulus();\n }\n\n public long subtract(long a, long b) {\n long v = a - b;\n return v < 0 ? v + modulus() : v;\n }\n\n public long mult(long... x) {\n long r = 1;\n for (long i : x)\n r = mult(r, i);\n return r;\n }\n\n public long mult(long a, long b) {\n return (a * b) % modulus();\n }\n\n public long inv(long value) {\n long g = modulus(), x = 0, y = 1;\n for (long r = value; r != 0; ) {\n long q = g / r;\n g %= r;\n\n long temp = g;\n g = r;\n r = temp;\n\n x -= q * y;\n\n temp = x;\n x = y;\n y = temp;\n }\n\n ASSERT(g == 1);\n ASSERT(y == modulus() || y == -modulus());\n\n return normalize(x);\n }\n\n }\n\n public static class Mod998 extends NumberTheory.Modulus<NumberTheory.Mod998> {\n public long modulus() {\n return 998_244_353L;\n }\n\n }\n\n }\n\n static class InputReader {\n public final BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "a9aac193e91b9334ffe60f71f96407d2", "src_uid": "9f2b59df7bef2aeee0ce71facd2b1613", "difficulty": 3000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\nimport java.io.BufferedReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n HZSShufflesCards solver = new HZSShufflesCards();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class HZSShufflesCards {\n NumberTheory.Mod998 mod = new NumberTheory.Mod998();\n int n;\n int m;\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n n = in.nextInt();\n m = in.nextInt();\n\n mod.fInv(n + m);\n\n long phaseSize = 1;\n long p = 1;\n for (int i = 0; p != 0; i++) {\n p = mod.mult(p, n - i, mod.smallInv(n + m - i));\n phaseSize = mod.add(phaseSize, p);\n }\n\n long answer = 0;\n for (int k = 1; k <= n; k++) {\n long sign = mod.paritySign(k + 1);\n long numPhases = mod.div(m + k, k);\n long term = mod.mult(sign, mod.ncr(n, k), numPhases, phaseSize);\n answer = mod.add(answer, term);\n }\n\n out.println(answer);\n }\n\n }\n\n static class InputReader {\n public final BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n\n static class Util {\n public static void ASSERT(boolean assertion) {\n if (!assertion)\n throw new AssertionError();\n }\n\n private Util() {\n }\n\n }\n\n static class IntStack {\n int[] array;\n int size = 0;\n\n public IntStack() {\n this(8);\n }\n\n public IntStack(int capacity) {\n array = new int[capacity];\n }\n\n public void push(int item) {\n if (size >= array.length)\n array = resize(array);\n array[size++] = item;\n }\n\n public int size() {\n return size;\n }\n\n public int get(int i) {\n Util.ASSERT(i < size);\n return array[i];\n }\n\n private static int[] resize(int[] array) {\n int[] newArray = new int[array.length << 1];\n System.arraycopy(array, 0, newArray, 0, array.length);\n return newArray;\n }\n\n public String toString() {\n int[] trimmed = new int[size];\n System.arraycopy(array, 0, trimmed, 0, size);\n return Arrays.toString(trimmed);\n }\n\n }\n\n static class NumberTheory {\n private static void ASSERT(boolean assertion) {\n if (!assertion)\n throw new AssertionError();\n }\n\n public abstract static class Modulus<M extends NumberTheory.Modulus<M>> {\n final IntStack factorial = new IntStack();\n final IntStack invFactorial = new IntStack();\n\n public abstract long modulus();\n\n public Modulus() {\n super();\n factorial.push(1);\n invFactorial.push(1);\n }\n\n public long fact(int n) {\n while (factorial.size() <= n) {\n factorial.push((int) mult(factorial.get(factorial.size() - 1), factorial.size()));\n }\n\n return factorial.get(n);\n }\n\n public long fInv(int n) {\n int lastKnown = invFactorial.size() - 1;\n\n if (lastKnown < n) {\n long[] fInv = new long[n - lastKnown];\n fInv[0] = inv(fact(n));\n for (int i = 1; i < fInv.length; i++) {\n fInv[i] = mult(fInv[i - 1], n - i + 1);\n }\n for (int i = fInv.length - 1; i >= 0; i--) {\n invFactorial.push((int) fInv[i]);\n }\n }\n\n return invFactorial.get(n);\n }\n\n public long paritySign(long k) {\n return (k & 1) == 0 ? 1 : modulus() - 1;\n }\n\n public long ncr(int n, int r) {\n ASSERT(n >= 0);\n if (r < 0 || n < r)\n return 0;\n return mult(fact(n), mult(fInv(r), fInv(n - r)));\n }\n\n public long smallInv(int n) {\n return mult(fInv(n), fact(n - 1));\n }\n\n public long normalize(long x) {\n x %= modulus();\n if (x < 0)\n x += modulus();\n return x;\n }\n\n public long add(long a, long b) {\n long v = a + b;\n return v < modulus() ? v : v - modulus();\n }\n\n public long mult(long... x) {\n long r = 1;\n for (long i : x)\n r = mult(r, i);\n return r;\n }\n\n public long mult(long a, long b) {\n return (a * b) % modulus();\n }\n\n public long div(long a, long b) {\n return mult(a, inv(b));\n }\n\n public long inv(long value) {\n long g = modulus(), x = 0, y = 1;\n for (long r = value; r != 0; ) {\n long q = g / r;\n g %= r;\n\n long temp = g;\n g = r;\n r = temp;\n\n x -= q * y;\n\n temp = x;\n x = y;\n y = temp;\n }\n\n ASSERT(g == 1);\n ASSERT(y == modulus() || y == -modulus());\n\n return normalize(x);\n }\n\n }\n\n public static class Mod998 extends NumberTheory.Modulus<NumberTheory.Mod998> {\n public long modulus() {\n return 998_244_353L;\n }\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "0dcc4fbcb2b2c67baf9a1c749da1b885", "src_uid": "9f2b59df7bef2aeee0ce71facd2b1613", "difficulty": 3000.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "//package global10;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class G2 {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t\tint mod = 998244353;\n\t\tint n = ni(), m = ni();\n\t\tlong ans = (1 + invl(m+1, mod) * n) % mod;\n\t\tlong base = invl(m+1, mod) * ((long)m * (m+2 + (n-1)) % mod) % mod;\n\t\tlong u = 0;\n\t\tfor(int i = 1;i <= n;i++){\n\t\t\tu += invl(i, mod);\n\t\t\tu %= mod;\n\t\t}\n\t\tans = (base * u + ans) % mod;\n\t\tout.println(ans);\n\t}\n\t\n\tpublic static long[] guessFrac(long n, int mod)\n\t{\n\t\tlong min = mod;\n\t\tlong argnum = -1, argden = 0;\n\t\tfor(int den = 1;den <= 200000;den++){\n\t\t\tlong num = n*den%mod;\n\t\t\tif(num*2 >= mod)num -= mod;\n\t\t\tif(Math.abs(num) + den < min){\n\t\t\t\tmin = Math.abs(num) + den;\n\t\t\t\targnum = num;\n\t\t\t\targden = den;\n\t\t\t}\n\t\t}\n\t\treturn argden == 0 ? null : new long[]{argnum, argden};\n\t}\n\n\t\n\tpublic static long invl(long a, long mod) {\n\t\tlong b = mod;\n\t\tlong p = 1, q = 0;\n\t\twhile (b > 0) {\n\t\t\tlong c = a / b;\n\t\t\tlong d;\n\t\t\td = a;\n\t\t\ta = b;\n\t\t\tb = d % b;\n\t\t\td = p;\n\t\t\tp = q;\n\t\t\tq = d - c * q;\n\t\t}\n\t\treturn p < 0 ? p + mod : p;\n\t}\n\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new G2().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "9f725fff947afa2ddd405b6087082320", "src_uid": "9f2b59df7bef2aeee0ce71facd2b1613", "difficulty": 3000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\nimport java.io.BufferedReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n HZSShufflesCards solver = new HZSShufflesCards();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class HZSShufflesCards {\n NumberTheory.Mod998 mod = new NumberTheory.Mod998();\n int n;\n int m;\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n n = in.nextInt();\n m = in.nextInt();\n\n mod.fInv(n + m);\n\n long phaseSize = 1;\n long p = 1;\n for (int i = 0; p != 0; i++) {\n p = mod.mult(p, n - i, mod.smallInv(n + m - i));\n phaseSize = mod.add(phaseSize, p);\n }\n\n long answer = 0;\n for (int k = 1; k <= n; k++) {\n long numPhases = mod.mult(m + k, mod.smallInv(k));\n long e = mod.mult(numPhases, phaseSize);\n long term = mod.mult(mod.ncr(n, k), e);\n\n if (k % 2 == 1)\n answer = mod.add(answer, term);\n else\n answer = mod.subtract(answer, term);\n }\n\n out.println(answer);\n }\n\n }\n\n static class InputReader {\n public final BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n\n static class IntStack {\n int[] array;\n int size = 0;\n\n public IntStack() {\n this(8);\n }\n\n public IntStack(int capacity) {\n array = new int[capacity];\n }\n\n public void add(long i) {\n push((int) i);\n }\n\n public int get(int i) {\n return array[i];\n }\n\n public void push(int item) {\n if (size >= array.length)\n array = resize(array);\n array[size++] = item;\n }\n\n public int size() {\n return size;\n }\n\n private static int[] resize(int[] array) {\n int[] newArray = new int[array.length << 1];\n System.arraycopy(array, 0, newArray, 0, array.length);\n return newArray;\n }\n\n public String toString() {\n int[] trimmed = new int[size];\n System.arraycopy(array, 0, trimmed, 0, size);\n return Arrays.toString(trimmed);\n }\n\n }\n\n static class NumberTheory {\n private static void ASSERT(boolean assertion) {\n if (!assertion)\n throw new AssertionError();\n }\n\n public abstract static class Modulus<M extends NumberTheory.Modulus<M>> {\n final IntStack factorial = new IntStack();\n final IntStack invFactorial = new IntStack();\n\n public abstract long modulus();\n\n public Modulus() {\n super();\n factorial.add(1L);\n invFactorial.add(1L);\n }\n\n public long fact(int n) {\n while (factorial.size() <= n) {\n factorial.add(mult(factorial.get(factorial.size() - 1), factorial.size()));\n }\n\n return factorial.get(n);\n }\n\n public long fInv(int n) {\n int lastKnown = invFactorial.size() - 1;\n\n if (lastKnown < n) {\n long[] fInv = new long[n - lastKnown];\n fInv[0] = inv(fact(n));\n for (int i = 1; i < fInv.length; i++) {\n fInv[i] = mult(fInv[i - 1], n - i + 1);\n }\n for (int i = fInv.length - 1; i >= 0; i--) {\n invFactorial.add(fInv[i]);\n }\n }\n\n return invFactorial.get(n);\n }\n\n public long ncr(int n, int r) {\n ASSERT(n >= 0);\n if (r < 0 || n < r)\n return 0;\n return mult(fact(n), mult(fInv(r), fInv(n - r)));\n }\n\n public long smallInv(int n) {\n return mult(fInv(n), fact(n - 1));\n }\n\n public long normalize(long x) {\n x %= modulus();\n if (x < 0)\n x += modulus();\n return x;\n }\n\n public long add(long a, long b) {\n long v = a + b;\n return v < modulus() ? v : v - modulus();\n }\n\n public long subtract(long a, long b) {\n long v = a - b;\n return v < 0 ? v + modulus() : v;\n }\n\n public long mult(long... x) {\n long r = 1;\n for (long i : x)\n r = mult(r, i);\n return r;\n }\n\n public long mult(long a, long b) {\n return (a * b) % modulus();\n }\n\n public long inv(long value) {\n long g = modulus(), x = 0, y = 1;\n for (long r = value; r != 0; ) {\n long q = g / r;\n g %= r;\n\n long temp = g;\n g = r;\n r = temp;\n\n x -= q * y;\n\n temp = x;\n x = y;\n y = temp;\n }\n\n ASSERT(g == 1);\n ASSERT(y == modulus() || y == -modulus());\n\n return normalize(x);\n }\n\n }\n\n public static class Mod998 extends NumberTheory.Modulus<NumberTheory.Mod998> {\n public long modulus() {\n return 998_244_353L;\n }\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "f9db31fb5be24939aa8598cd83a18259", "src_uid": "9f2b59df7bef2aeee0ce71facd2b1613", "difficulty": 3000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.UncheckedIOException;\nimport java.io.Closeable;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) throws Exception {\n Thread thread = new Thread(null, new TaskAdapter(), \"\", 1 << 29);\n thread.start();\n thread.join();\n }\n\n static class TaskAdapter implements Runnable {\n @Override\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastInput in = new FastInput(inputStream);\n FastOutput out = new FastOutput(outputStream);\n HZSShufflesCards solver = new HZSShufflesCards();\n solver.solve(1, in, out);\n out.close();\n }\n }\n\n static class HZSShufflesCards {\n public void solve(int testNumber, FastInput in, FastOutput out) {\n int n = in.readInt();\n int m = in.readInt();\n\n Modular mod = new Modular(998244353);\n Power pow = new Power(mod);\n\n int exp1 = pow.inverse(m + 1);\n exp1 = mod.mul(exp1, n);\n exp1 = mod.plus(exp1, 1);\n\n InverseNumber inv = new ModPrimeInverseNumber(n, mod);\n int exp2 = 0;\n for (int i = 1; i <= n; i++) {\n exp2 = mod.plus(exp2, inv.inverse(i));\n }\n exp2 = mod.mul(exp2, m);\n exp2 = mod.plus(exp2, 1);\n\n int ans = mod.mul(exp1, exp2);\n out.println(ans);\n }\n\n }\n\n static class ExtGCD {\n public static int extGCD(int a, int b, int[] xy) {\n if (a >= b) {\n return extGCD0(a, b, xy);\n }\n int ans = extGCD0(b, a, xy);\n SequenceUtils.swap(xy, 0, 1);\n return ans;\n }\n\n private static int extGCD0(int a, int b, int[] xy) {\n if (b == 0) {\n xy[0] = 1;\n xy[1] = 0;\n return a;\n }\n int ans = extGCD0(b, a % b, xy);\n int x = xy[0];\n int y = xy[1];\n xy[0] = y;\n xy[1] = x - a / b * y;\n return ans;\n }\n\n }\n\n static class Modular {\n int m;\n\n public int getMod() {\n return m;\n }\n\n public Modular(int m) {\n this.m = m;\n }\n\n public Modular(long m) {\n this.m = (int) m;\n if (this.m != m) {\n throw new IllegalArgumentException();\n }\n }\n\n public Modular(double m) {\n this.m = (int) m;\n if (this.m != m) {\n throw new IllegalArgumentException();\n }\n }\n\n public int valueOf(int x) {\n x %= m;\n if (x < 0) {\n x += m;\n }\n return x;\n }\n\n public int valueOf(long x) {\n x %= m;\n if (x < 0) {\n x += m;\n }\n return (int) x;\n }\n\n public int mul(int x, int y) {\n return valueOf((long) x * y);\n }\n\n public int plus(int x, int y) {\n return valueOf(x + y);\n }\n\n public String toString() {\n return \"mod \" + m;\n }\n\n }\n\n static class FastInput {\n private final InputStream is;\n private byte[] buf = new byte[1 << 13];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastInput(InputStream is) {\n this.is = is;\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n bufLen = -1;\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public int readInt() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n }\n\n static class FastOutput implements AutoCloseable, Closeable, Appendable {\n private StringBuilder cache = new StringBuilder(10 << 20);\n private final Writer os;\n\n public FastOutput append(CharSequence csq) {\n cache.append(csq);\n return this;\n }\n\n public FastOutput append(CharSequence csq, int start, int end) {\n cache.append(csq, start, end);\n return this;\n }\n\n public FastOutput(Writer os) {\n this.os = os;\n }\n\n public FastOutput(OutputStream os) {\n this(new OutputStreamWriter(os));\n }\n\n public FastOutput append(char c) {\n cache.append(c);\n return this;\n }\n\n public FastOutput append(int c) {\n cache.append(c);\n return this;\n }\n\n public FastOutput println(int c) {\n return append(c).println();\n }\n\n public FastOutput println() {\n cache.append(System.lineSeparator());\n return this;\n }\n\n public FastOutput flush() {\n try {\n os.append(cache);\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n return this;\n }\n\n public void close() {\n flush();\n try {\n os.close();\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n\n public String toString() {\n return cache.toString();\n }\n\n }\n\n static class ModPrimeInverseNumber implements InverseNumber {\n int[] inv;\n\n public ModPrimeInverseNumber(int[] inv, int limit, Modular modular) {\n this.inv = inv;\n inv[1] = 1;\n int p = modular.getMod();\n for (int i = 2; i <= limit; i++) {\n int k = p / i;\n int r = p % i;\n inv[i] = modular.mul(-k, inv[r]);\n }\n }\n\n public ModPrimeInverseNumber(int limit, Modular modular) {\n this(new int[limit + 1], limit, modular);\n }\n\n public int inverse(int x) {\n return inv[x];\n }\n\n }\n\n static class Power implements InverseNumber {\n static IntExtGCDObject extGCD = new IntExtGCDObject();\n final Modular modular;\n\n public Power(Modular modular) {\n this.modular = modular;\n }\n\n public int inverse(int x) {\n int ans = inverseExtGCD(x);\n// if(modular.mul(ans, x) != 1){\n// throw new IllegalStateException();\n// }\n return ans;\n }\n\n public int inverseExtGCD(int x) {\n if (extGCD.extgcd(x, modular.getMod()) != 1) {\n throw new IllegalArgumentException();\n }\n return modular.valueOf(extGCD.getX());\n }\n\n }\n\n static interface InverseNumber {\n int inverse(int x);\n\n }\n\n static class SequenceUtils {\n public static void swap(int[] data, int i, int j) {\n int tmp = data[i];\n data[i] = data[j];\n data[j] = tmp;\n }\n\n }\n\n static class IntExtGCDObject {\n private int[] xy = new int[2];\n\n public int extgcd(int a, int b) {\n return ExtGCD.extGCD(a, b, xy);\n }\n\n public int getX() {\n return xy[0];\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "57756d0ab1307fa12e8d5bceb261db23", "src_uid": "9f2b59df7bef2aeee0ce71facd2b1613", "difficulty": 3000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\nimport java.io.BufferedReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n HZSShufflesCards solver = new HZSShufflesCards();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class HZSShufflesCards {\n NumberTheory.Mod998 mod = new NumberTheory.Mod998();\n int n;\n int m;\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n n = in.nextInt();\n m = in.nextInt();\n\n mod.fInv(n + m);\n\n long phaseSize = 1;\n long p = 1;\n for (int i = 0; p != 0; i++) {\n p = mod.mult(p, n - i, mod.smallInv(n + m - i));\n phaseSize = mod.add(phaseSize, p);\n }\n\n long answer = 0;\n for (int k = 1; k <= n; k++) {\n long term = mod.mult(mod.ncr(n, k), m + k, mod.smallInv(k), phaseSize);\n\n if (k % 2 == 1)\n answer = mod.add(answer, term);\n else\n answer = mod.subtract(answer, term);\n }\n\n out.println(answer);\n }\n\n }\n\n static class InputReader {\n public final BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n\n static class Util {\n public static void ASSERT(boolean assertion) {\n if (!assertion)\n throw new AssertionError();\n }\n\n private Util() {\n }\n\n }\n\n static class IntStack {\n int[] array;\n int size = 0;\n\n public IntStack() {\n this(8);\n }\n\n public IntStack(int capacity) {\n array = new int[capacity];\n }\n\n public void push(int item) {\n if (size >= array.length)\n array = resize(array);\n array[size++] = item;\n }\n\n public int size() {\n return size;\n }\n\n public int get(int i) {\n Util.ASSERT(i < size);\n return array[i];\n }\n\n private static int[] resize(int[] array) {\n int[] newArray = new int[array.length << 1];\n System.arraycopy(array, 0, newArray, 0, array.length);\n return newArray;\n }\n\n public String toString() {\n int[] trimmed = new int[size];\n System.arraycopy(array, 0, trimmed, 0, size);\n return Arrays.toString(trimmed);\n }\n\n }\n\n static class NumberTheory {\n private static void ASSERT(boolean assertion) {\n if (!assertion)\n throw new AssertionError();\n }\n\n public abstract static class Modulus<M extends NumberTheory.Modulus<M>> {\n final IntStack factorial = new IntStack();\n final IntStack invFactorial = new IntStack();\n\n public abstract long modulus();\n\n public Modulus() {\n super();\n factorial.push(1);\n invFactorial.push(1);\n }\n\n public long fact(int n) {\n while (factorial.size() <= n) {\n factorial.push((int) mult(factorial.get(factorial.size() - 1), factorial.size()));\n }\n\n return factorial.get(n);\n }\n\n public long fInv(int n) {\n int lastKnown = invFactorial.size() - 1;\n\n if (lastKnown < n) {\n long[] fInv = new long[n - lastKnown];\n fInv[0] = inv(fact(n));\n for (int i = 1; i < fInv.length; i++) {\n fInv[i] = mult(fInv[i - 1], n - i + 1);\n }\n for (int i = fInv.length - 1; i >= 0; i--) {\n invFactorial.push((int) fInv[i]);\n }\n }\n\n return invFactorial.get(n);\n }\n\n public long ncr(int n, int r) {\n ASSERT(n >= 0);\n if (r < 0 || n < r)\n return 0;\n return mult(fact(n), mult(fInv(r), fInv(n - r)));\n }\n\n public long smallInv(int n) {\n return mult(fInv(n), fact(n - 1));\n }\n\n public long normalize(long x) {\n x %= modulus();\n if (x < 0)\n x += modulus();\n return x;\n }\n\n public long add(long a, long b) {\n long v = a + b;\n return v < modulus() ? v : v - modulus();\n }\n\n public long subtract(long a, long b) {\n long v = a - b;\n return v < 0 ? v + modulus() : v;\n }\n\n public long mult(long... x) {\n long r = 1;\n for (long i : x)\n r = mult(r, i);\n return r;\n }\n\n public long mult(long a, long b) {\n return (a * b) % modulus();\n }\n\n public long inv(long value) {\n long g = modulus(), x = 0, y = 1;\n for (long r = value; r != 0; ) {\n long q = g / r;\n g %= r;\n\n long temp = g;\n g = r;\n r = temp;\n\n x -= q * y;\n\n temp = x;\n x = y;\n y = temp;\n }\n\n ASSERT(g == 1);\n ASSERT(y == modulus() || y == -modulus());\n\n return normalize(x);\n }\n\n }\n\n public static class Mod998 extends NumberTheory.Modulus<NumberTheory.Mod998> {\n public long modulus() {\n return 998_244_353L;\n }\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "8d3b5c2849ae0e8f6ff5d486c5d08c3b", "src_uid": "9f2b59df7bef2aeee0ce71facd2b1613", "difficulty": 3000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\nimport java.io.BufferedReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n HZSShufflesCards solver = new HZSShufflesCards();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class HZSShufflesCards {\n NumberTheory.Mod998 mod = new NumberTheory.Mod998();\n int n;\n int m;\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n n = in.nextInt();\n m = in.nextInt();\n\n mod.fInv(n + m);\n\n long phaseSize = 1;\n long p = 1;\n for (int i = 0; p != 0; i++) {\n p = mod.mult(p, n - i, mod.smallInv(n + m - i));\n phaseSize = mod.add(phaseSize, p);\n }\n\n long answer = 0;\n for (int k = 1; k <= n; k++) {\n answer = mod.add(answer, mod.mult(mod.paritySign(k + 1), mod.ncr(n, k), m + k, mod.smallInv(k), phaseSize));\n }\n\n out.println(answer);\n }\n\n }\n\n static class InputReader {\n public final BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n\n static class Util {\n public static void ASSERT(boolean assertion) {\n if (!assertion)\n throw new AssertionError();\n }\n\n private Util() {\n }\n\n }\n\n static class IntStack {\n int[] array;\n int size = 0;\n\n public IntStack() {\n this(8);\n }\n\n public IntStack(int capacity) {\n array = new int[capacity];\n }\n\n public void push(int item) {\n if (size >= array.length)\n array = resize(array);\n array[size++] = item;\n }\n\n public int size() {\n return size;\n }\n\n public int get(int i) {\n Util.ASSERT(i < size);\n return array[i];\n }\n\n private static int[] resize(int[] array) {\n int[] newArray = new int[array.length << 1];\n System.arraycopy(array, 0, newArray, 0, array.length);\n return newArray;\n }\n\n public String toString() {\n int[] trimmed = new int[size];\n System.arraycopy(array, 0, trimmed, 0, size);\n return Arrays.toString(trimmed);\n }\n\n }\n\n static class NumberTheory {\n private static void ASSERT(boolean assertion) {\n if (!assertion)\n throw new AssertionError();\n }\n\n public abstract static class Modulus<M extends NumberTheory.Modulus<M>> {\n final IntStack factorial = new IntStack();\n final IntStack invFactorial = new IntStack();\n\n public abstract long modulus();\n\n public Modulus() {\n super();\n factorial.push(1);\n invFactorial.push(1);\n }\n\n public long fact(int n) {\n while (factorial.size() <= n) {\n factorial.push((int) mult(factorial.get(factorial.size() - 1), factorial.size()));\n }\n\n return factorial.get(n);\n }\n\n public long fInv(int n) {\n int lastKnown = invFactorial.size() - 1;\n\n if (lastKnown < n) {\n long[] fInv = new long[n - lastKnown];\n fInv[0] = inv(fact(n));\n for (int i = 1; i < fInv.length; i++) {\n fInv[i] = mult(fInv[i - 1], n - i + 1);\n }\n for (int i = fInv.length - 1; i >= 0; i--) {\n invFactorial.push((int) fInv[i]);\n }\n }\n\n return invFactorial.get(n);\n }\n\n public long paritySign(long k) {\n return (k & 1) == 0 ? 1 : modulus() - 1;\n }\n\n public long ncr(int n, int r) {\n ASSERT(n >= 0);\n if (r < 0 || n < r)\n return 0;\n return mult(fact(n), mult(fInv(r), fInv(n - r)));\n }\n\n public long smallInv(int n) {\n return mult(fInv(n), fact(n - 1));\n }\n\n public long normalize(long x) {\n x %= modulus();\n if (x < 0)\n x += modulus();\n return x;\n }\n\n public long add(long a, long b) {\n long v = a + b;\n return v < modulus() ? v : v - modulus();\n }\n\n public long mult(long... x) {\n long r = 1;\n for (long i : x)\n r = mult(r, i);\n return r;\n }\n\n public long mult(long a, long b) {\n return (a * b) % modulus();\n }\n\n public long inv(long value) {\n long g = modulus(), x = 0, y = 1;\n for (long r = value; r != 0; ) {\n long q = g / r;\n g %= r;\n\n long temp = g;\n g = r;\n r = temp;\n\n x -= q * y;\n\n temp = x;\n x = y;\n y = temp;\n }\n\n ASSERT(g == 1);\n ASSERT(y == modulus() || y == -modulus());\n\n return normalize(x);\n }\n\n }\n\n public static class Mod998 extends NumberTheory.Modulus<NumberTheory.Mod998> {\n public long modulus() {\n return 998_244_353L;\n }\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "dc41d267628f3a454a8d75cd821a033b", "src_uid": "9f2b59df7bef2aeee0ce71facd2b1613", "difficulty": 3000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\nimport java.io.BufferedReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n HZSShufflesCards solver = new HZSShufflesCards();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class HZSShufflesCards {\n NumberTheory.Mod998 mod = new NumberTheory.Mod998();\n int n;\n int m;\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n n = in.nextInt();\n m = in.nextInt();\n\n mod.fInv(n + m);\n\n long phaseSize = 1;\n long p = 1;\n for (int i = 0; p != 0; i++) {\n p = mod.mult(mod.mult(p, n - i), mod.smallInv(n + m - i));\n phaseSize = mod.add(phaseSize, p);\n }\n\n long answer = 0;\n for (int k = 1; k <= n; k++) {\n long numPhases = mod.mult(m + k, mod.smallInv(k));\n long term = mod.mult(mod.ncr(n, k), mod.mult(numPhases, phaseSize));\n if ((k & 1) == 1)\n answer = mod.add(answer, term);\n else\n answer = mod.subtract(answer, term);\n }\n\n out.println(answer);\n }\n\n }\n\n static class InputReader {\n public final BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n\n static class Util {\n public static void ASSERT(boolean assertion) {\n if (!assertion)\n throw new AssertionError();\n }\n\n private Util() {\n }\n\n }\n\n static class IntStack {\n int[] array;\n int size = 0;\n\n public IntStack() {\n this(8);\n }\n\n public IntStack(int capacity) {\n array = new int[capacity];\n }\n\n public void push(int item) {\n if (size >= array.length)\n array = resize(array);\n array[size++] = item;\n }\n\n public int size() {\n return size;\n }\n\n public int get(int i) {\n Util.ASSERT(i < size);\n return array[i];\n }\n\n private static int[] resize(int[] array) {\n int[] newArray = new int[array.length << 1];\n System.arraycopy(array, 0, newArray, 0, array.length);\n return newArray;\n }\n\n public String toString() {\n int[] trimmed = new int[size];\n System.arraycopy(array, 0, trimmed, 0, size);\n return Arrays.toString(trimmed);\n }\n\n }\n\n static class NumberTheory {\n private static void ASSERT(boolean assertion) {\n if (!assertion)\n throw new AssertionError();\n }\n\n public abstract static class Modulus<M extends NumberTheory.Modulus<M>> {\n final IntStack factorial = new IntStack();\n final IntStack invFactorial = new IntStack();\n\n public abstract long modulus();\n\n public Modulus() {\n super();\n factorial.push(1);\n invFactorial.push(1);\n }\n\n public long fact(int n) {\n while (factorial.size() <= n) {\n factorial.push((int) mult(factorial.get(factorial.size() - 1), factorial.size()));\n }\n\n return factorial.get(n);\n }\n\n public long fInv(int n) {\n int lastKnown = invFactorial.size() - 1;\n\n if (lastKnown < n) {\n long[] fInv = new long[n - lastKnown];\n fInv[0] = inv(fact(n));\n for (int i = 1; i < fInv.length; i++) {\n fInv[i] = mult(fInv[i - 1], n - i + 1);\n }\n for (int i = fInv.length - 1; i >= 0; i--) {\n invFactorial.push((int) fInv[i]);\n }\n }\n\n return invFactorial.get(n);\n }\n\n public long ncr(int n, int r) {\n ASSERT(n >= 0);\n if (r < 0 || n < r)\n return 0;\n return mult(fact(n), mult(fInv(r), fInv(n - r)));\n }\n\n public long smallInv(int n) {\n return mult(fInv(n), fact(n - 1));\n }\n\n public long normalize(long x) {\n x %= modulus();\n if (x < 0)\n x += modulus();\n return x;\n }\n\n public long add(long a, long b) {\n long v = a + b;\n return v < modulus() ? v : v - modulus();\n }\n\n public long subtract(long a, long b) {\n long v = a - b;\n return v < 0 ? v + modulus() : v;\n }\n\n public long mult(long a, long b) {\n return (a * b) % modulus();\n }\n\n public long inv(long value) {\n long g = modulus(), x = 0, y = 1;\n for (long r = value; r != 0; ) {\n long q = g / r;\n g %= r;\n\n long temp = g;\n g = r;\n r = temp;\n\n x -= q * y;\n\n temp = x;\n x = y;\n y = temp;\n }\n\n ASSERT(g == 1);\n ASSERT(y == modulus() || y == -modulus());\n\n return normalize(x);\n }\n\n }\n\n public static class Mod998 extends NumberTheory.Modulus<NumberTheory.Mod998> {\n public long modulus() {\n return 998_244_353L;\n }\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "0a8d41b2d4f6e6bf5e7f272b40048998", "src_uid": "9f2b59df7bef2aeee0ce71facd2b1613", "difficulty": 3000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Map;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.InputMismatchException;\nimport java.util.TreeMap;\nimport java.util.Set;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.util.NavigableMap;\nimport java.io.PrintWriter;\nimport java.io.Reader;\nimport java.io.Writer;\nimport java.util.SortedMap;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Niyaz Nigmatullin\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tFastScanner in = new FastScanner(inputStream);\n\t\tFastPrinter out = new FastPrinter(outputStream);\n\t\tTaskE solver = new TaskE();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskE {\n\n static final int MOD = 1000000007;\n\n public void solve(int testNumber, FastScanner in, FastPrinter out) {\n int n = in.nextInt();\n int p = in.nextInt();\n NavigableMap<Integer, Integer> g = new TreeMap<Integer, Integer>();\n g.put(1, 0);\n g.put(3, 1);\n int lastG = 1;\n for (int d = 3; d < p - 1; ) {\n int a = d / 3;\n int b = d - d / 3;\n Integer na = g.higherKey(a);\n Integer nb = g.higherKey(b);\n long z1 = na * 3L;\n long z2 = 3L * nb / 2;\n while (z2 - z2 / 3 >= nb) {\n z2--;\n }\n while (z2 - z2 / 3 < nb) {\n ++z2;\n }\n long z = Math.min(z1, z2);\n if (z > p - 1) {\n break;\n }\n int zi = (int) z;\n int ga = g.get(g.floorKey(zi / 3));\n int gb = g.get(g.floorKey(zi - zi / 3));\n int ng = -1;\n for (int j = 0; j < 3; j++) {\n if (j == ga || j == gb) {\n continue;\n }\n ng = j;\n break;\n }\n if (ng != lastG) {\n g.put(zi, ng);\n }\n lastG = ng;\n d = zi;\n }\n long[] count = new long[3];\n for (int i : g.keySet()) {\n Integer ni = g.higherKey(i);\n if (ni == null) {\n ni = p;\n }\n int first = p - i;\n int second = p - ni;\n count[g.get(i)] += s(second + 1, first + 1);\n }\n for (int i = 0; i < 3; i++) {\n count[i] %= MOD;\n }\n int[][] dp = new int[n + 1][4];\n dp[0][0] = 1;\n for (int i = 1; i <= n; i++) {\n for (int x = 0; x < 3; x++) {\n for (int y = 0; y < 4; y++) {\n dp[i][x ^ y] = (int) ((dp[i][x ^ y] + (long) dp[i - 1][y] * count[x]) % MOD);\n }\n }\n }\n long ans = 0L + dp[n][1] + dp[n][2] + dp[n][3];\n out.println(ans % MOD);\n }\n\n static long s(int a, int b) {\n if (a >= b) {\n return 0;\n }\n --b;\n --a;\n long ret = ss(b) - ss(a);\n return ret;\n }\n\n static long ss(int n) {\n return (long) n * (n + 1) / 2;\n }\n}\n\nclass FastScanner extends BufferedReader {\n\n boolean isEOF;\n\n public FastScanner(InputStream is) {\n super(new InputStreamReader(is));\n }\n\n public int read() {\n try {\n int ret = super.read();\n if (isEOF && ret < 0) {\n throw new InputMismatchException();\n }\n isEOF = ret == -1;\n return ret;\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n }\n\n static boolean isWhiteSpace(int c) {\n return c >= -1 && c <= 32;\n }\n\n public int nextInt() {\n int c = read();\n while (isWhiteSpace(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int ret = 0;\n while (!isWhiteSpace(c)) {\n if (c < '0' || c > '9') {\n throw new NumberFormatException(\"digit expected \" + (char) c\n + \" found\");\n }\n ret = ret * 10 + c - '0';\n c = read();\n }\n return ret * sgn;\n }\n\n }\n\nclass FastPrinter extends PrintWriter {\n\n public FastPrinter(OutputStream out) {\n super(out);\n }\n\n public FastPrinter(Writer out) {\n super(out);\n }\n\n\n}\n\n", "lang_cluster": "Java", "tags": ["dp", "games"], "code_uid": "019de68415555ce6031ad60dd64d788e", "src_uid": "c03b6379e9d186874ac3d97c6968fbd0", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "//package round167;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class E {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tint[][] BURIED = {\n\t\t\t{0, 2},\n\t\t\t{1, 1},\n\t\t\t{2, 1},\n\t\t\t{1, 2},\n\t\t\t{2, 2},\n\t\t\t{0, 4},\n\t\t\t{1, 2},\n\t\t\t{2, 4},\n\t\t\t{0, 8},\n\t\t\t{1, 12},\n\t\t\t{2, 1},\n\t\t\t{0, 17},\n\t\t\t{2, 1},\n\t\t\t{1, 23},\n\t\t\t{2, 4},\n\t\t\t{0, 35},\n\t\t\t{2, 1},\n\t\t\t{1, 53},\n\t\t\t{2, 5},\n\t\t\t{0, 76},\n\t\t\t{2, 5},\n\t\t\t{1, 103},\n\t\t\t{2, 19},\n\t\t\t{0, 155},\n\t\t\t{2, 7},\n\t\t\t{1, 236},\n\t\t\t{2, 25},\n\t\t\t{0, 341},\n\t\t\t{2, 23},\n\t\t\t{1, 463},\n\t\t\t{2, 86},\n\t\t\t{0, 697},\n\t\t\t{2, 32},\n\t\t\t{1, 1060},\n\t\t\t{2, 115},\n\t\t\t{0, 1532},\n\t\t\t{2, 106},\n\t\t\t{1, 2081},\n\t\t\t{2, 389},\n\t\t\t{0, 3136},\n\t\t\t{2, 145},\n\t\t\t{1, 4769},\n\t\t\t{2, 518},\n\t\t\t{0, 6892},\n\t\t\t{2, 479},\n\t\t\t{1, 9364},\n\t\t\t{2, 1751},\n\t\t\t{0, 14110},\n\t\t\t{2, 655},\n\t\t\t{1, 21458},\n\t\t\t{2, 2333},\n\t\t\t{0, 31012},\n\t\t\t{2, 2158},\n\t\t\t{1, 42137},\n\t\t\t{2, 7880},\n\t\t\t{0, 63493},\n\t\t\t{2, 2950},\n\t\t\t{1, 96560},\n\t\t\t{2, 10499},\n\t\t\t{0, 139552},\n\t\t\t{2, 9713},\n\t\t\t{1, 189616},\n\t\t\t{2, 35461},\n\t\t\t{0, 285716},\n\t\t\t{2, 13277},\n\t\t\t{1, 434518},\n\t\t\t{2, 47248},\n\t\t\t{0, 627983},\n\t\t\t{2, 43709},\n\t\t\t{1, 853270},\n\t\t\t{2, 159577},\n\t\t\t{0, 1285721},\n\t\t\t{2, 59747},\n\t\t\t{1, 1955329},\n\t\t\t{2, 212618},\n\t\t\t{0, 2825923},\n\t\t\t{2, 196691},\n\t\t\t{1, 3839713},\n\t\t\t{2, 718099},\n\t\t\t{0, 5785742},\n\t\t\t{2, 268864},\n\t\t\t{1, 8798978},\n\t\t\t{2, 956783},\n\t\t\t{0, 12716653},\n\t\t\t{2, 885110},\n\t\t\t{1, 17278708},\n\t\t\t{2, 3231446},\n\t\t\t{0, 26035837},\n\t\t\t{2, 1209890},\n\t\t\t{1, 39595399},\n\t\t\t{2, 4305526},\n\t\t\t{0, 57224936},\n\t\t\t{2, 3982997},\n\t\t\t{1, 77754184},\n\t\t\t{2, 14541509},\n\t\t\t{0, 117161266},\n\t\t\t{2, 5444506},\n\t\t\t{1, 178179293},\n\t\t\t{2, 19374869},\n\t\t\t{0, 257512210},\n\t\t\t{2, 17923489},\n\t\t\t{1, 115568306}\n\t};\n\t\n\tvoid solve()\n\t{\n\t\tint n = ni();\n\t\tlong p = ni();\n\t\tint mod = 1000000007;\n\t\tlong[] ct = new long[3];\n\t\tlong pp = p;\n\t\tfor(int[] b : BURIED){\n\t\t\tct[b[0]] += pp*(pp-1)/2;\n\t\t\tpp -= b[1];\n\t\t\tif(pp <= 0)break;\n\t\t\tct[b[0]] -= pp*(pp-1)/2;\n\t\t}\n\t\tfor(int i = 0;i < 3;i++){\n\t\t\tct[i] %= mod;\n\t\t}\n\t\t\n\t\tlong[][] dp = new long[n+1][4];\n\t\tdp[0][0] = 1;\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tfor(int j = 0;j < 4;j++){\n\t\t\t\tfor(int k = 0;k < 3;k++){\n\t\t\t\t\tdp[i+1][j^k] += dp[i][j]*ct[k]%mod;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int j = 0;j < 4;j++){\n\t\t\t\tdp[i+1][j] %= mod;\n\t\t\t}\n\t\t}\n\t\tout.println((dp[n][1]+dp[n][2]+dp[n][3])%mod);\n\t}\n\t\n\tpublic static long invl(long a, long mod)\n\t{\n\t\tlong b = mod;\n\t\tlong p = 1, q = 0;\n\t\twhile(b > 0){\n\t\t\tlong c = a / b;\n\t\t\tlong d;\n\t\t\td = a; a = b; b = d % b;\n\t\t\td = p; p = q; q = d - c * q;\n\t\t}\n\t\treturn p < 0 ? p + mod : p;\n\t}\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new E().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tprivate int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["dp", "games"], "code_uid": "638704cc06da95087b2436721c0fe151", "src_uid": "c03b6379e9d186874ac3d97c6968fbd0", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\npublic class CodeforcesD268 {\n\tpublic static int[][][][][] memo;\n\tpublic static int n, h;\n\tpublic static int mod = 1000000009;\n\tpublic static void main(String[] args){\n\t\tScanner br = new Scanner(System.in);\n\t\tn = br.nextInt();\n\t\th = br.nextInt();\n\t\t\n\t\tmemo = new int[2][h+1][h+1][h+1][n];\n\t\tfor(int i = 0;i<2;i++){\n\t\t\tfor(int j = 0;j<h+1;j++){\n\t\t\t\tfor(int k = 0;k<h+1;k++){\n\t\t\t\t\tfor(int l = 0;l<h+1;l++){\n\t\t\t\t\t\tArrays.fill(memo[i][j][k][l], -1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(go(0, new int[3], 0));\n\t}\n\tpublic static int go(int flag, int[] lasts, int pos){\n\t\tfor(int i = 0;i<lasts.length;i++){\n\t\t\tlasts[i] = Math.min(lasts[i], h);\n\t\t}\n\t\tint last1 = (flag == 0 ? 0 : h);\n\t\tint last2 = lasts[0];\n\t\tint last3 = lasts[1];\n\t\tint last4 = lasts[2];\n\t\tif(last1 < h || last2 < h || last3 < h || last4 < h){\n\t\t\t\n\t\t}\n\t\telse{\n\t\t\treturn 0;\n\t\t}\n\t\tif(pos == n){\n\t\t\t\n\t\t\tif(last1 < h || last2 < h || last3 < h || last4 < h){\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\t\t\n\t\tif(memo[flag][last2][last3][last4][pos] != -1){\n\t\t\treturn memo[flag][last2][last3][last4][pos];\n\t\t}\n\t\t\n\t\tint ans = 0;\n\t\tans+=go(flag, new int[]{last2+1, last3+1, last4+1}, pos+1);\n\t\tans%=mod;\n\t\t\n\t\t//Place second\n\t\tans+=go((last2 == h) ? 1 : 0, new int[]{last1+1, last3+1, last4+1}, pos+1);\n\t\tans%=mod;\n\t\t\n\t\t//Place third\n\t\tans+=go((last3 == h) ? 1 : 0, new int[]{last1+1, last2+1, last4+1}, pos+1);\n\t\tans%=mod;\n\t\t\n\t\t\n\t\t//Place fourth\n\t\tans+=go((last4 == h) ? 1 : 0, new int[]{last1+1, last2+1, last3+1}, pos+1);\n\t\tans%=mod;\n\t\t\n\t\treturn memo[flag][last2][last3][last4][pos] = ans;\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "5ff88ca05b95f972d38edbd0240e04b0", "src_uid": "9fe9658db35076c0bddc8b7ddce11013", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\r\n\r\n\r\nimport javax.swing.*;\r\nimport java.lang.reflect.Array;\r\nimport java.text.DecimalFormat;\r\nimport java.util.*;\r\nimport java.lang.*;\r\nimport java.io.*;\r\nimport java.math.*;\r\nimport java.util.stream.Stream;\r\n\r\n\r\n\r\n// Please name your class Main\r\npublic class Main {\r\n static FastScanner fs=new FastScanner();\r\n static class FastScanner {\r\n BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\r\n StringTokenizer st=new StringTokenizer(\"\");\r\n public String next() {\r\n while (!st.hasMoreElements())\r\n try {\r\n st=new StringTokenizer(br.readLine());\r\n } catch (IOException e) {\r\n e.printStackTrace();\r\n }\r\n return st.nextToken();\r\n }\r\n int Int() {\r\n return Integer.parseInt(next());\r\n }\r\n\r\n long Long() {\r\n return Long.parseLong(next());\r\n }\r\n\r\n String Str(){\r\n return next();\r\n }\r\n }\r\n\r\n\r\n public static void main (String[] args) throws java.lang.Exception {\r\n PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\r\n //reading /writing file\r\n //Scanner in=new Scanner(System.in);\r\n //Scanner in=new Scanner(new File(\"input.txt\"));\r\n //PrintWriter pr=new PrintWriter(\"output.txt\");\r\n\r\n\r\n int T=1;\r\n for(int t=0;t<T;t++){\r\n Solution sol1=new Solution(out,fs);\r\n sol1.solution(T,t);\r\n }\r\n out.flush();\r\n\r\n }\r\n\r\n\r\n public static int[] Arr(int n){\r\n int A[]=new int[n];\r\n for(int i=0;i<n;i++)A[i]=Int();\r\n return A;\r\n }\r\n public static int Int(){\r\n return fs.Int();\r\n }\r\n public static long Long(){\r\n return fs.Long();\r\n }\r\n public static String Str(){\r\n return fs.Str();\r\n }\r\n\r\n}\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nclass Solution {\r\n PrintWriter out;\r\n int INF = Integer.MAX_VALUE;\r\n int NINF = Integer.MIN_VALUE;\r\n int MOD = 998244353;\r\n int mod = 1000000007;\r\n Main.FastScanner fs;\r\n\r\n\r\n public Solution(PrintWriter out, Main.FastScanner fs) {\r\n this.out = out;\r\n this.fs = fs;\r\n\r\n }\r\n\r\n\r\n public void solution(int all, int testcase) {\r\n int n = fs.Int();\r\n mod = fs.Int();\r\n\r\n long dp[][] = new long[n][n * n + 5];\r\n dp[0][0] = 1;\r\n for(int i = 1; i < n; i++) {\r\n for(int j = 0; j < dp[0].length; j++) {\r\n for(int cnt = 0; cnt <= i; cnt++){\r\n if(j - cnt >= 0) {\r\n dp[i][j] += dp[i - 1][j - cnt];\r\n dp[i][j] %= mod;\r\n if(dp[i][j] == 0){\r\n dp[i][j] += mod;\r\n }\r\n }\r\n }\r\n }\r\n }\r\n\r\n long sums[][] = new long[dp.length][dp[0].length];\r\n for(int i = 0; i < dp.length;i++){\r\n int sum = 0;\r\n for(int j = 0; j < dp[0].length; j++){\r\n sum += dp[i][j];\r\n sum %= mod;\r\n if(sum == 0) sum += mod;\r\n sums[i][j] = sum;\r\n }\r\n }\r\n\r\n\r\n //init\r\n long fact[] = new long[501 * 501];\r\n fact[0] = fact[1] = 1;\r\n for(int i = 2; i < fact.length;i++){\r\n fact[i] = fact[i - 1] * i;\r\n fact[i] %= mod;\r\n }\r\n long ncr[][] = new long[501][501];\r\n ncr[0][0]=1;\r\n for (int i=1;i<ncr.length;i++) {\r\n ncr[i][0]=1;\r\n for (int j=1;j<ncr[0].length;j++) {\r\n ncr[i][j]=(ncr[i-1][j] + ncr[i-1][j-1])%mod;\r\n if(ncr[i][j] == 0)ncr[i][j] += mod;\r\n }\r\n }\r\n //\r\n\r\n\r\n\r\n long res = 0;\r\n for(int i = n - 2; i >= 0; i--) {\r\n int cnt = n - i;\r\n int pre = n - cnt;\r\n long com = (ncr[n][pre] * fact[pre]) % mod;\r\n if(com == 0) com += mod;\r\n long sum = 0;\r\n\r\n for(int dif = 1; dif < cnt; dif++){\r\n for(int inv = dif; inv < dp[0].length; inv++){\r\n if(dp[cnt - 1][inv] == 0){\r\n break;\r\n }\r\n if(inv - dif - 1 < 0)continue;\r\n long x = dp[cnt - 2][inv];\r\n long y = sums[cnt - 2][inv - dif - 1];\r\n x *= y;\r\n x %= mod;\r\n if(x == 0) x += mod;\r\n sum += x * (cnt - dif);\r\n sum %= mod;\r\n }\r\n }\r\n res += sum * com;\r\n res%=mod;\r\n if(res == 0) res += mod;\r\n }\r\n\r\n out.println(res % mod);\r\n }\r\n\r\n}\r\n\r\n", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics", "fft"], "code_uid": "61564215c4049aa00500f4dc9535c4e8", "src_uid": "ae0320a57d73fab1d05f5d10fbdb9e1a", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\r\n\r\n\r\nimport javax.swing.*;\r\nimport java.lang.reflect.Array;\r\nimport java.text.DecimalFormat;\r\nimport java.util.*;\r\nimport java.lang.*;\r\nimport java.io.*;\r\nimport java.math.*;\r\nimport java.util.stream.Stream;\r\n\r\n\r\n\r\n// Please name your class Main\r\npublic class Main {\r\n static FastScanner fs=new FastScanner();\r\n static class FastScanner {\r\n BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\r\n StringTokenizer st=new StringTokenizer(\"\");\r\n public String next() {\r\n while (!st.hasMoreElements())\r\n try {\r\n st=new StringTokenizer(br.readLine());\r\n } catch (IOException e) {\r\n e.printStackTrace();\r\n }\r\n return st.nextToken();\r\n }\r\n int Int() {\r\n return Integer.parseInt(next());\r\n }\r\n\r\n long Long() {\r\n return Long.parseLong(next());\r\n }\r\n\r\n String Str(){\r\n return next();\r\n }\r\n }\r\n\r\n\r\n public static void main (String[] args) throws java.lang.Exception {\r\n PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\r\n //reading /writing file\r\n //Scanner in=new Scanner(System.in);\r\n //Scanner in=new Scanner(new File(\"input.txt\"));\r\n //PrintWriter pr=new PrintWriter(\"output.txt\");\r\n\r\n\r\n int T=1;\r\n for(int t=0;t<T;t++){\r\n Solution sol1=new Solution(out,fs);\r\n sol1.solution(T,t);\r\n }\r\n out.flush();\r\n\r\n }\r\n\r\n\r\n public static int[] Arr(int n){\r\n int A[]=new int[n];\r\n for(int i=0;i<n;i++)A[i]=Int();\r\n return A;\r\n }\r\n public static int Int(){\r\n return fs.Int();\r\n }\r\n public static long Long(){\r\n return fs.Long();\r\n }\r\n public static String Str(){\r\n return fs.Str();\r\n }\r\n\r\n}\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nclass Solution {\r\n PrintWriter out;\r\n int INF = Integer.MAX_VALUE;\r\n int NINF = Integer.MIN_VALUE;\r\n int MOD = 998244353;\r\n int mod = 1000000007;\r\n Main.FastScanner fs;\r\n\r\n\r\n public Solution(PrintWriter out, Main.FastScanner fs) {\r\n this.out = out;\r\n this.fs = fs;\r\n\r\n }\r\n\r\n\r\n public void solution(int all, int testcase) {\r\n int n = fs.Int();\r\n mod = fs.Int();\r\n\r\n long dp[][] = new long[n][n * n + 5];\r\n dp[0][0] = 1;\r\n for(int i = 1; i < n; i++) {\r\n for(int j = 0; j < dp[0].length; j++) {\r\n for(int cnt = 0; cnt <= i; cnt++){\r\n if(j - cnt >= 0) {\r\n dp[i][j] += dp[i - 1][j - cnt];\r\n dp[i][j] %= mod;\r\n if(dp[i][j] == 0){\r\n dp[i][j] += mod;\r\n }\r\n }\r\n }\r\n }\r\n }\r\n\r\n long sums[][] = new long[dp.length][dp[0].length];\r\n for(int i = 0; i < dp.length;i++){\r\n int sum = 0;\r\n for(int j = 0; j < dp[0].length; j++){\r\n sum += dp[i][j];\r\n sum %= mod;\r\n if(sum == 0) sum += mod;\r\n sums[i][j] = sum;\r\n }\r\n }\r\n\r\n\r\n //init\r\n long fact[] = new long[501 * 501];\r\n fact[0] = fact[1] = 1;\r\n for(int i = 2; i < fact.length;i++){\r\n fact[i] = fact[i - 1] * i;\r\n fact[i] %= mod;\r\n }\r\n long ncr[][] = new long[501][501];\r\n ncr[0][0]=1;\r\n for (int i=1;i<ncr.length;i++) {\r\n ncr[i][0]=1;\r\n for (int j=1;j<ncr[0].length;j++) {\r\n ncr[i][j]=(ncr[i-1][j] + ncr[i-1][j-1])%mod;\r\n if(ncr[i][j] == 0)ncr[i][j] += mod;\r\n }\r\n }\r\n\r\n\r\n\r\n long res = 0;\r\n for(int i = 0; i <= n - 2; i++) {\r\n int cnt = n - i;\r\n int pre = n - cnt;\r\n long com = (ncr[n][pre] * fact[pre]) % mod;\r\n if(com == 0) com += mod;\r\n long sum = 0;\r\n\r\n long last[] = dp[cnt - 2];\r\n long ssum = 0;\r\n long total =0;\r\n for(int j = 2; j < dp[0].length; j++) { // j == inversions\r\n total += sums[cnt - 2][j - 2] * (cnt - 1);\r\n total %= mod;\r\n if(total == 0) total += mod;\r\n\r\n sum += last[j] * total;\r\n sum %= mod;\r\n if(sum == 0) sum += mod;\r\n\r\n ssum += sums[cnt - 2][j - 2];\r\n if(j - cnt - 1 >= 0) {\r\n ssum -= sums[cnt - 2][j - cnt - 1];\r\n }\r\n ssum += mod;\r\n ssum %= mod;\r\n if(ssum == 0) ssum += mod;\r\n\r\n total -= ssum;\r\n total += mod;\r\n total %= mod;\r\n if(total == 0)total += mod;\r\n }\r\n res += sum * com;\r\n res%=mod;\r\n if(res == 0) res += mod;\r\n }\r\n out.println(res % mod);\r\n }\r\n}\r\n\r\n", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics", "fft"], "code_uid": "968665382e8860cd5f714394482b889b", "src_uid": "ae0320a57d73fab1d05f5d10fbdb9e1a", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "\r\n\r\nimport java.util.ArrayList;\r\nimport java.util.Arrays;\r\nimport java.util.Scanner;\r\n\r\nimport static java.lang.Integer.min;\r\nimport static java.lang.Integer.max;\r\n\r\npublic class e1542easy {\r\n public static void main(String[] args) {\r\n Scanner s = new Scanner(System.in);\r\n\r\n solve(s.nextInt(), s.nextInt());\r\n }\r\n\r\n\r\n public static void solve(int n, int mod) {\r\n ArrayList<long[]> inversions = new ArrayList<>();\r\n inversions.add(new long[]{1});\r\n\r\n long last[];\r\n long next[];\r\n for (int i = 1; i < n; i++) {\r\n last = inversions.get(i - 1);\r\n next = new long[i * (i + 1) / 2 + 1];\r\n\r\n int e;\r\n for (int j = 0; j < next.length; j++) {\r\n e = 0;\r\n for (int k = min(j, i); k >= 0; k--) {\r\n if (j - k < last.length) {\r\n e += last[j - k];\r\n e = e % mod;\r\n }\r\n }\r\n next[j] = e;\r\n }\r\n\r\n inversions.add(next);\r\n }\r\n\r\n for (int i = 0; i < n; i++) {\r\n //System.out.println(Arrays.toString(inversions.get(i)));\r\n }\r\n\r\n\r\n long perms[] = new long[n];\r\n perms[0] = 0;\r\n\r\n long c;\r\n long inv[];\r\n long m;\r\n for (int i = 1; i < n; i++) {\r\n c = (perms[i - 1] * (i + 1)) % mod;\r\n\r\n inv = inversions.get(i - 1);\r\n for (int j = 0; j < inv.length; j++) {\r\n for (int k = j + 2; k < inv.length; k++) {\r\n m = min(k - j, i + 1);\r\n c = (c + ((inv[j] * inv[k]) % mod) * ((m - 1) * (2 * i - (m - 2)) / 2)) % mod;\r\n }\r\n }\r\n\r\n perms[i] = c;\r\n }\r\n\r\n //System.out.println(Arrays.toString(perms));\r\n System.out.println(perms[n - 1]);\r\n }\r\n}\r\n", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics", "fft"], "code_uid": "d25c4acef45c77f1a3aaebb1a3804a8a", "src_uid": "ae0320a57d73fab1d05f5d10fbdb9e1a", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\r\n\r\n\r\nimport javax.swing.*;\r\nimport java.lang.reflect.Array;\r\nimport java.text.DecimalFormat;\r\nimport java.util.*;\r\nimport java.lang.*;\r\nimport java.io.*;\r\nimport java.math.*;\r\nimport java.util.stream.Stream;\r\n\r\n\r\n\r\n// Please name your class Main\r\npublic class Main {\r\n static FastScanner fs=new FastScanner();\r\n static class FastScanner {\r\n BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\r\n StringTokenizer st=new StringTokenizer(\"\");\r\n public String next() {\r\n while (!st.hasMoreElements())\r\n try {\r\n st=new StringTokenizer(br.readLine());\r\n } catch (IOException e) {\r\n e.printStackTrace();\r\n }\r\n return st.nextToken();\r\n }\r\n int Int() {\r\n return Integer.parseInt(next());\r\n }\r\n\r\n long Long() {\r\n return Long.parseLong(next());\r\n }\r\n\r\n String Str(){\r\n return next();\r\n }\r\n }\r\n\r\n\r\n public static void main (String[] args) throws java.lang.Exception {\r\n PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\r\n //reading /writing file\r\n //Scanner in=new Scanner(System.in);\r\n //Scanner in=new Scanner(new File(\"input.txt\"));\r\n //PrintWriter pr=new PrintWriter(\"output.txt\");\r\n\r\n\r\n int T=1;\r\n for(int t=0;t<T;t++){\r\n Solution sol1=new Solution(out,fs);\r\n sol1.solution(T,t);\r\n }\r\n out.flush();\r\n\r\n }\r\n\r\n\r\n public static int[] Arr(int n){\r\n int A[]=new int[n];\r\n for(int i=0;i<n;i++)A[i]=Int();\r\n return A;\r\n }\r\n public static int Int(){\r\n return fs.Int();\r\n }\r\n public static long Long(){\r\n return fs.Long();\r\n }\r\n public static String Str(){\r\n return fs.Str();\r\n }\r\n\r\n}\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nclass Solution {\r\n PrintWriter out;\r\n int INF = Integer.MAX_VALUE;\r\n int NINF = Integer.MIN_VALUE;\r\n int MOD = 998244353;\r\n int mod = 1000000007;\r\n Main.FastScanner fs;\r\n\r\n\r\n public Solution(PrintWriter out, Main.FastScanner fs) {\r\n this.out = out;\r\n this.fs = fs;\r\n\r\n }\r\n\r\n\r\n public void solution(int all, int testcase) {\r\n int n = fs.Int();\r\n mod = fs.Int();\r\n\r\n long dp[][] = new long[n][n * n + 5];\r\n dp[0][0] = 1;\r\n for(int i = 1; i < n; i++) {\r\n for(int j = 0; j < dp[0].length; j++) {\r\n for(int cnt = 0; cnt <= i; cnt++){\r\n if(j - cnt >= 0) {\r\n dp[i][j] += dp[i - 1][j - cnt];\r\n dp[i][j] %= mod;\r\n if(dp[i][j] == 0){\r\n dp[i][j] += mod;\r\n }\r\n }\r\n }\r\n }\r\n }\r\n\r\n long sums[][] = new long[dp.length][dp[0].length];\r\n for(int i = 0; i < dp.length;i++){\r\n int sum = 0;\r\n for(int j = 0; j < dp[0].length; j++){\r\n sum += dp[i][j];\r\n sum %= mod;\r\n if(sum == 0) sum += mod;\r\n sums[i][j] = sum;\r\n }\r\n }\r\n\r\n\r\n //init\r\n long fact[] = new long[501 * 501];\r\n fact[0] = fact[1] = 1;\r\n for(int i = 2; i < fact.length;i++){\r\n fact[i] = fact[i - 1] * i;\r\n fact[i] %= mod;\r\n }\r\n long ncr[][] = new long[501][501];\r\n ncr[0][0]=1;\r\n for (int i=1;i<ncr.length;i++) {\r\n ncr[i][0]=1;\r\n for (int j=1;j<ncr[0].length;j++) {\r\n ncr[i][j]=(ncr[i-1][j] + ncr[i-1][j-1])%mod;\r\n if(ncr[i][j] == 0)ncr[i][j] += mod;\r\n }\r\n }\r\n //\r\n\r\n\r\n\r\n long res = 0;\r\n for(int i = n - 2; i >= 0; i--) {\r\n int cnt = n - i;\r\n int pre = n - cnt;\r\n long com = (ncr[n][pre] * fact[pre]) % mod;\r\n if(com == 0) com += mod;\r\n long sum = 0;\r\n\r\n for(int dif = 1; dif < cnt; dif++){\r\n for(int inv = dif; inv < dp[0].length; inv++){\r\n if(dp[cnt - 2][inv] == 0){\r\n break;\r\n }\r\n if(inv - dif - 1 < 0)continue;\r\n long x = dp[cnt - 2][inv];\r\n long y = sums[cnt - 2][inv - dif - 1];\r\n x *= y;\r\n x %= mod;\r\n if(x == 0) x += mod;\r\n sum += x * (cnt - dif);\r\n sum %= mod;\r\n }\r\n }\r\n res += sum * com;\r\n res%=mod;\r\n if(res == 0) res += mod;\r\n }\r\n\r\n out.println(res % mod);\r\n }\r\n\r\n}\r\n\r\n", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics", "fft"], "code_uid": "fcc0537e4a0ae9d136545530e99d401b", "src_uid": "ae0320a57d73fab1d05f5d10fbdb9e1a", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.OutputStream;\r\nimport java.io.IOException;\r\nimport java.io.InputStream;\r\nimport java.io.OutputStream;\r\nimport java.io.PrintWriter;\r\nimport java.util.Arrays;\r\nimport java.io.BufferedWriter;\r\nimport java.io.Writer;\r\nimport java.io.OutputStreamWriter;\r\nimport java.util.InputMismatchException;\r\nimport java.io.IOException;\r\nimport java.io.InputStream;\r\n\r\n/**\r\n * Built using CHelper plug-in\r\n * Actual solution is at the top\r\n */\r\npublic class Main {\r\n public static void main(String[] args) {\r\n InputStream inputStream = System.in;\r\n OutputStream outputStream = System.out;\r\n InputReader in = new InputReader(inputStream);\r\n OutputWriter out = new OutputWriter(outputStream);\r\n E2AbnormalPermutationPairsHardVersion solver = new E2AbnormalPermutationPairsHardVersion();\r\n solver.solve(1, in, out);\r\n out.close();\r\n }\r\n\r\n static class E2AbnormalPermutationPairsHardVersion {\r\n ModInt mod;\r\n\r\n public void solve(int testNumber, InputReader in, OutputWriter out) {\r\n int n = in.nextInt();\r\n int m = in.nextInt();\r\n mod = new ModInt(m);\r\n int[] factorial = new int[n + 1];\r\n factorial[0] = n;\r\n for (int i = 1; i < n; i++) factorial[i] = mod.multiply(factorial[i - 1], n - i);\r\n int[] dp = new int[n * (n - 1) + 1];\r\n int middle = (n * (n - 1)) / 2;\r\n int[] temp = dp.clone();\r\n dp[middle] = 1;\r\n int answer = 0;\r\n for (int i = n - 1; i >= 0; i--) {\r\n int c = n - 1 - i;\r\n temp = dp.clone();\r\n Arrays.fill(dp, 0);\r\n int limit = (c * (c - 1)) / 2;\r\n int count = 0;\r\n for (int cur = -c; cur < 0; cur++) {\r\n int pairs = c + cur + 1;\r\n for (int j = middle - cur + 1; j <= middle + limit; j++)\r\n count = mod.add(count, mod.multiply(temp[j], pairs));\r\n }\r\n answer = mod.add(answer, mod.multiply(count, i == 0 ? 1 : factorial[i - 1]));\r\n for (int j = middle - limit; j <= middle + limit; j++) {\r\n for (int cur = -c; cur <= c; cur++) {\r\n int pairs = c - Math.abs(cur) + 1;\r\n dp[j + cur] = mod.add(dp[j + cur], mod.multiply(pairs, temp[j]));\r\n }\r\n }\r\n }\r\n out.println(answer);\r\n }\r\n\r\n }\r\n\r\n static class OutputWriter {\r\n private final PrintWriter writer;\r\n\r\n public OutputWriter(OutputStream outputStream) {\r\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\r\n }\r\n\r\n public OutputWriter(Writer writer) {\r\n this.writer = new PrintWriter(writer);\r\n }\r\n\r\n public void println(Object... objects) {\r\n for (int i = 0; i < objects.length; i++) {\r\n if (i != 0) {\r\n writer.print(' ');\r\n }\r\n writer.print(objects[i]);\r\n }\r\n writer.print('\\n');\r\n }\r\n\r\n public void close() {\r\n writer.close();\r\n }\r\n\r\n }\r\n\r\n static class ModInt {\r\n int modulo;\r\n\r\n public ModInt(int m) {\r\n modulo = m;\r\n }\r\n\r\n public int add(int x, int y) {\r\n x += y;\r\n if (x >= modulo) x -= modulo;\r\n return x;\r\n }\r\n\r\n public int multiply(int x, int y) {\r\n return (int) ((x * 1L * y) % modulo);\r\n }\r\n\r\n }\r\n\r\n static class InputReader {\r\n private InputStream stream;\r\n private byte[] buf = new byte[1024];\r\n private int curChar;\r\n private int numChars;\r\n private InputReader.SpaceCharFilter filter;\r\n\r\n public InputReader(InputStream stream) {\r\n this.stream = stream;\r\n }\r\n\r\n public int read() {\r\n if (numChars == -1) {\r\n throw new InputMismatchException();\r\n }\r\n if (curChar >= numChars) {\r\n curChar = 0;\r\n try {\r\n numChars = stream.read(buf);\r\n } catch (IOException e) {\r\n throw new InputMismatchException();\r\n }\r\n if (numChars <= 0) {\r\n return -1;\r\n }\r\n }\r\n return buf[curChar++];\r\n }\r\n\r\n public int nextInt() {\r\n int c = read();\r\n while (isSpaceChar(c)) c = read();\r\n int sgn = 1;\r\n if (c == '-') {\r\n sgn = -1;\r\n c = read();\r\n }\r\n int res = 0;\r\n do {\r\n if (c < '0' || c > '9')\r\n throw new InputMismatchException();\r\n res *= 10;\r\n res += c - '0';\r\n c = read();\r\n } while (!isSpaceChar(c));\r\n return res * sgn;\r\n }\r\n\r\n public boolean isSpaceChar(int c) {\r\n if (filter != null) {\r\n return filter.isSpaceChar(c);\r\n }\r\n return isWhitespace(c);\r\n }\r\n\r\n public static boolean isWhitespace(int c) {\r\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\r\n }\r\n\r\n public interface SpaceCharFilter {\r\n public boolean isSpaceChar(int ch);\r\n\r\n }\r\n\r\n }\r\n}\r\n\r\n", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics", "fft"], "code_uid": "da7023bc4ea1bf8c39ed089764cbb29b", "src_uid": "ae0320a57d73fab1d05f5d10fbdb9e1a", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author sheep\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskE solver = new TaskE();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskE {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n // [x y dx dy 1]\n long n = in.nextLong();\n\n long sx = ((in.nextLong() - 1) % n + n) % n;\n long sy = ((in.nextLong() - 1) % n + n) % n;\n long dx = (in.nextLong() % n + n) % n;\n long dy = (in.nextLong() % n + n) % n;\n\n long t = in.nextLong();\n\n Matrix move = Matrix.getUnitMatrix(6);\n long[][] mat = move.arr;\n mat[0][2] = 1;\n mat[1][2] = 1;\n mat[0][3] = 1;\n mat[1][3] = 1;\n\n mat[2][0] = 1;\n mat[3][1] = 1;\n\n mat[0][0] = 2;\n mat[1][0] = 1;\n mat[0][1] = 1;\n mat[1][1] = 2;\n\n mat[4][2] = 1;\n mat[4][3] = 1;\n mat[4][0] = 1;\n mat[4][1] = 1;\n\n mat[5][4] = 1;\n\n Matrix result = NumberUtils.powMod(move, t, n);\n\n // [sx sy dx dy 1]\n mat = result.arr;\n long x = (sx * mat[0][0] + sy * mat[1][0] + dx * mat[2][0] + dy * mat[3][0] + 2 * mat[4][0] + mat[5][0]) % n;\n long y = (sx * mat[0][1] + sy * mat[1][1] + dx * mat[2][1] + dy * mat[3][1] + 2 * mat[4][1] + mat[5][1]) % n;\n\n out.println((x + 1) + \" \" + (y + 1));\n }\n}\n\nclass InputReader {\n BufferedReader reader;\n StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream));\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (Exception e) {\n throw new UnknownError();\n }\n }\n return tokenizer.nextToken();\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n }\n\nclass Matrix {\n\n public long[][] arr;\n\n public Matrix(int size) {\n arr = new long[size][size];\n }\n\n public Matrix(long[][] arr) {\n if (arr.length != arr[0].length) {\n throw new IllegalArgumentException();\n }\n this.arr = new long[arr.length][arr.length];\n for (int i = 0; i < arr.length; ++i) {\n System.arraycopy(arr[i], 0, this.arr[i], 0, arr.length);\n }\n }\n\n public Matrix(int[][] arr) {\n if (arr.length != arr[0].length) {\n throw new IllegalArgumentException();\n }\n this.arr = new long[arr.length][arr.length];\n for (int i = 0; i < arr.length; ++i) {\n for (int j = 0; j < arr.length; ++j) {\n this.arr[i][j] = arr[i][j];\n }\n }\n }\n\n\n public Matrix multiply(Matrix to, Long mod) {\n if (arr.length != to.arr.length) {\n throw new IllegalArgumentException();\n }\n\n Matrix res = new Matrix(arr.length);\n for (int k = 0; k < arr.length; ++k) {\n for (int i = 0; i < arr.length; ++i) {\n if (arr[i][k] == 0) continue;\n for (int j = 0; j < arr.length; ++j) {\n res.arr[i][j] += arr[i][k] * to.arr[k][j];\n if (mod != null && res.arr[i][j] >= mod) {\n res.arr[i][j] %= mod;\n }\n }\n }\n }\n\n return res;\n }\n\n public int size() {\n return arr.length;\n }\n\n public static Matrix getUnitMatrix(int size) {\n Matrix matrix = new Matrix(size);\n for (int i = 0; i < size; ++i) {\n matrix.arr[i][i] = 1;\n }\n return matrix;\n }\n\n public String toString() {\n return Arrays.deepToString(arr);\n }\n}\n\nclass NumberUtils {\n\n public static Matrix powMod(Matrix mat, long p, long mod) {\n\n if (p == 0) {\n return Matrix.getUnitMatrix(mat.size());\n }\n\n if (p == 1) {\n return mat;\n }\n\n if (p % 2 == 0) {\n Matrix res = powMod(mat, p / 2, mod);\n return res.multiply(res, mod);\n }\n\n return powMod(mat, p - 1, mod).multiply(mat, mod);\n }\n\n }\n", "lang_cluster": "Java", "tags": ["math", "matrices"], "code_uid": "8a7e833818fe463bf356055789af7f39", "src_uid": "ee9fa8be2ae05a4e831a4f608c0cc785", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.IOException;\nimport java.io.OutputStreamWriter;\nimport java.util.Arrays;\nimport java.io.BufferedWriter;\nimport java.util.InputMismatchException;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.NoSuchElementException;\nimport java.io.Writer;\nimport java.math.BigInteger;\nimport java.io.InputStream;\n\n\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n TaskE solver = new TaskE();\n solver.solve(1, in, out);\n out.close();\n }\n}\n\nclass TaskE {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n=in.readInt(), sx=in.readInt()%n, sy=in.readInt()%n, dx=in.readInt()%n, dy=in.readInt()%n;\n long t=in.readLong(), Sx=(2L*sx+dx+sy)%n, Sy=(2L*sy+dy+sx)%n, Dx=(dx+sx+sy)%n, Dy=(dy+sy+sx)%n, t0=(t%2==0?t/2:t)%n, t1=(t%2==1?(t-1)/2:t-1)%n;\n Matrix.mod=n;\n Matrix base=new Matrix(new long[][] {\n {2, 1, 1, 1, 0, 0},\n {1, 2, 1, 1, 0, 0},\n {1, 0, 1, 0, 0, 0},\n {0, 1, 0, 1, 0, 0},\n {1, 1, 1, 1, 1, 0},\n {0, 0, 0, 0, 1, 1}\n }), matrix=new Matrix(new long[][]{\n {Sx, Sy, Dx, Dy, 1, 1},\n {sx, sy, dx, dy, 0, 1}\n });\n long[][] data=Matrix.multiply(matrix, base.power(t)).data;\n Sx=(data[1][0]+n)%n;\n Sy=(data[1][1]+n)%n;\n //out.printLine(data[1][0], data[1][1]);\n out.printLine(Sx==0?n:Sx, Sy==0?n:Sy);\n }\n}\n\nclass InputReader {\n\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public long readLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n}\n\nclass OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public void print(Object...objects) {\n for (int i = 0; i < objects.length; i++) {\n if (i != 0)\n writer.print(' ');\n writer.print(objects[i]);\n }\n }\n\n public void printLine(Object...objects) {\n print(objects);\n writer.println();\n }\n\n public void close() {\n writer.close();\n }\n\n}\n\nclass Matrix {\n public static long mod = Long.MAX_VALUE;\n public final long[][] data;\n public final int rowCount;\n public final int columnCount;\n\n public Matrix(int rowCount, int columnCount) {\n this.rowCount = rowCount;\n this.columnCount = columnCount;\n this.data = new long[rowCount][columnCount];\n }\n\n public Matrix(long[][] data) {\n this.rowCount = data.length;\n this.columnCount = data[0].length;\n this.data = data;\n }\n\n public static Matrix multiply(Matrix first, Matrix second) {\n Matrix result = new Matrix(first.rowCount, second.columnCount);\n for (int i = 0; i < first.rowCount; i++) {\n for (int j = 0; j < second.rowCount; j++) {\n for (int k = 0; k < second.columnCount; k++)\n result.data[i][k] = (result.data[i][k] + first.data[i][j] * second.data[j][k]) % mod;\n }\n }\n return result;\n }\n\n public static Matrix identityMatrix(int size) {\n Matrix result = new Matrix(size, size);\n for (int i = 0; i < size; i++)\n result.data[i][i] = 1;\n return result;\n }\n\n public Matrix power(long exponent) {\n if (exponent == 0)\n return identityMatrix(rowCount);\n if (exponent == 1)\n return this;\n Matrix result = power(exponent >> 1);\n result = multiply(result, result);\n if ((exponent & 1) == 1)\n result = multiply(result, this);\n return result;\n }\n\n}\n", "lang_cluster": "Java", "tags": ["math", "matrices"], "code_uid": "0e11937d33998c1a43825389c2c379a8", "src_uid": "ee9fa8be2ae05a4e831a4f608c0cc785", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.util.InputMismatchException;\nimport java.io.PrintStream;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.Reader;\nimport java.io.Writer;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Nipuna Samarasekara\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tFastScanner in = new FastScanner(inputStream);\n\t\tFastPrinter out = new FastPrinter(outputStream);\n\t\tTaskE solver = new TaskE();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskE {\n /////////////////////////////////////////////////////////////\n static int mod;\n\n public void solve(int testNumber, FastScanner in, FastPrinter out) {\n long n=in.nextLong();\n mod=(int)n;\n int sx=in.nextInt(),sy=in.nextInt();\n long dx=in.nextInt(),dy=in.nextInt(),t=in.nextLong();\n int[][] A={{2,1,1,1,0,0},\n {1,2,1,1,0,0},\n {1,0,1,0,0,0},\n {0,1,0,1,0,0},\n {1,1,1,1,1,0},\n {0,0,0,0,1,1}\n };\n int[][] B={{sx,sy,(int)dx,(int)dy,0,1},\n {1,2,1,1,0,0},\n {1,0,1,0,0,0},\n {0,1,0,1,0,0},\n {1,1,1,1,1,0},\n {0,0,0,0,1,1}\n };\n Matrix base= new Matrix(A),init= new Matrix(B);\n Matrix fin=Matrix.powMod(base,t,mod);\n Matrix ans= init.multiplyMod(fin,mod);\n int x=ans.get(0,0),y=ans.get(0,1);\n if(x<0)x+=mod;\n if(y<0)y+=mod;\n if(x==0)x=mod;\n if(y==0)y=mod;\n\n out.println(x+\" \"+y);\n\n }\n}\n\nclass FastScanner extends BufferedReader {\n\n public FastScanner(InputStream is) {\n super(new InputStreamReader(is));\n }\n\n public int read() {\n try {\n int ret = super.read();\n// if (isEOF && ret < 0) {\n// throw new InputMismatchException();\n// }\n// isEOF = ret == -1;\n return ret;\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n }\n\n public String next() {\n StringBuilder sb = new StringBuilder();\n int c = read();\n while (isWhiteSpace(c)) {\n c = read();\n }\n if (c < 0) {\n return null;\n }\n while (c >= 0 && !isWhiteSpace(c)) {\n sb.appendCodePoint(c);\n c = read();\n }\n return sb.toString();\n }\n\n static boolean isWhiteSpace(int c) {\n return c >= 0 && c <= 32;\n }\n\n public int nextInt() {\n int c = read();\n while (isWhiteSpace(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int ret = 0;\n while (c >= 0 && !isWhiteSpace(c)) {\n if (c < '0' || c > '9') {\n throw new NumberFormatException(\"digit expected \" + (char) c\n + \" found\");\n }\n ret = ret * 10 + c - '0';\n c = read();\n }\n return ret * sgn;\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public String readLine() {\n try {\n return super.readLine();\n } catch (IOException e) {\n return null;\n }\n }\n\n }\n\nclass FastPrinter extends PrintWriter {\n\n public FastPrinter(OutputStream out) {\n super(out);\n }\n\n public FastPrinter(Writer out) {\n super(out);\n }\n\n\n}\n\nclass Matrix {\n final int[][] a;\n public final int n;\n public final int m;\n\n public Matrix(int n, int m) {\n this.n = n;\n this.m = m;\n a = new int[n][m];\n }\n\n public Matrix(int n) {\n this(n, n);\n }\n\n public Matrix(int[][] a) {\n n = a.length;\n if (n == 0) {\n throw new AssertionError();\n }\n m = a[0].length;\n this.a = new int[n][];\n for (int i = 0; i < n; i++) {\n if (m != a[i].length) {\n throw new AssertionError();\n }\n this.a[i] = a[i].clone();\n }\n }\n\n public int get(int x, int y) {\n return a[x][y];\n }\n\n public static Matrix getOne(int n) {\n Matrix ret = new Matrix(n);\n for (int i = 0; i < n; i++) {\n ret.a[i][i] = 1;\n }\n return ret;\n }\n\n public Matrix multiplyMod(Matrix b, int mod) {\n if (m != b.n) {\n throw new AssertionError();\n }\n Matrix ret = new Matrix(n, b.m);\n long modmod = (long) mod * mod;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < b.m; j++) {\n long d = 0;\n for (int k = 0; k < m; k++) {\n d = (d + (long) a[i][k] * b.a[k][j]);\n if (d >= modmod) {\n d -= modmod;\n }\n }\n ret.a[i][j] = (int) (d % mod);\n }\n }\n return ret;\n }\n\n public static Matrix powMod(Matrix a, long b, int mod) {\n if (a.n != a.m) {\n throw new AssertionError();\n }\n Matrix ret = getOne(a.n);\n while (b > 0) {\n if ((b & 1) == 1) {\n ret = ret.multiplyMod(a, mod);\n }\n a = a.multiplyMod(a, mod);\n b >>= 1;\n }\n return ret;\n }\n\n }\n\n", "lang_cluster": "Java", "tags": ["math", "matrices"], "code_uid": "f38ac74606b31f6f871230d3838c0644", "src_uid": "ee9fa8be2ae05a4e831a4f608c0cc785", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "\n\nimport java.io.BufferedReader;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class Main {\n static BufferedReader br;\n static StringTokenizer st;\n static PrintWriter out;\n \n public static String next() throws IOException {\n while (st == null || !st.hasMoreTokens())\n st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n \n public static int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n \n public static long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n \n static void print(Matrix a) {\n for (int i = 0; i < a.n; ++i) {\n for (int j = 0; j < a.n; ++j) {\n out.print(a.a[i][j] + \" \");\n }\n out.println();\n }\n }\n \n static int mod, n;\n \n public static void main(String[] args) throws IOException {\n br = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n mod = nextInt();\n n = 6;\n int[] u = new int[n];\n u[0] = nextInt() - 1;\n u[1] = nextInt() - 1;\n u[2] = (nextInt() % mod + mod) % mod;\n u[3] = (nextInt() % mod + mod) % mod;\n u[4] = 2; \n u[5] = 1;\n long t = nextLong();\n if (t == 0) {\n out.println((u[0] + 1) + \" \" + (u[1] + 1));\n } else {\n Matrix res = new Matrix(n, mod);\n Matrix a = new Matrix(n, mod);\n // print(res);\n t--;\n while (t > 0) {\n if (t % 2 == 1) {\n res = res.mult(a);\n }\n t /= 2;\n a = a.mult(a);\n }\n for (int i = 0; i < 2; ++i) {\n if (i > 0) {\n out.print(' ');\n }\n int x = 0;\n for (int j = 0; j < n; ++j) {\n x = (int)((1L * res.a[i][j] * u[j] + x) % mod); \n }\n out.print(x + 1);\n }\n out.println();\n }\n out.close();\n }\n\n}\n\nclass Matrix {\n int n, mod;\n int[][] a;\n Matrix(int n, int mod) {\n this.n = n;\n this.mod = mod;\n a = new int[n][n];\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < n; ++j) {\n a[i][j] = 1;\n }\n }\n a[0][3] = a[1][2] = a[2][3] = a[3][2] = 0;\n a[4][0] = a[4][1] = a[4][2] = a[4][3] = 0;\n a[0][5] = a[1][5] = a[2][5] = a[3][5] = 0;\n a[5][0] = a[5][1] = a[5][2] = a[5][3] = a[5][4] = 0;\n a[0][0] = a[1][1] = 2;\n }\n \n Matrix mult(Matrix b) { \n Matrix res = new Matrix(n, mod);\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < n; ++j) {\n res.a[i][j] = 0;\n for (int k = 0; k < n; ++k) { \n res.a[i][j] = (int)((1L * a[i][k] * b.a[k][j] + res.a[i][j]) % mod);\n }\n }\n } \n return res;\n }\n \n}\n", "lang_cluster": "Java", "tags": ["math", "matrices"], "code_uid": "60a4852076a8cf0c2ec7708a2c5840b4", "src_uid": "ee9fa8be2ae05a4e831a4f608c0cc785", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class E implements Runnable {\n\n\tfinal long[][] E = { { 1, 0, 0, 0, 0, 0 }, { 0, 1, 0, 0, 0, 0 }, { 0, 0, 1, 0, 0, 0}, { 0, 0, 0, 1, 0, 0 }, { 0, 0, 0, 0, 1, 0 }, { 0, 0, 0, 0, 0, 1 } };\n\tprivate void solve() throws IOException {\n\t\tlong n = nextLong(), sx = nextLong() - 1, sy = nextLong() - 1;\n\t\tlong dx = ((nextLong() % n) + n) % n, dy = ((nextLong() % n) + n) % n, t = nextLong();\n\t\tlong[][] start = { { sx, sy, dx, dy, 0, 1 } };\n\t\tlong[][] next = { { 2, 1, 1, 1, 0, 0 }, { 1, 2, 1, 1, 0, 0 }, { 1, 0, 1, 0, 0, 0 }, { 0, 1, 0, 1, 0, 0 }, { 1, 1, 1, 1, 1, 0 }, { 2, 2, 2, 2, 1, 1 } };\n\t\tlong[][] end = matrixMultiplication(start, binaryMatrixPower(next, t, n), n);\n\t\tprint(end[0][0] + 1, end[0][1] + 1);\n\t}\n\n\tlong[][] binaryMatrixPower(long[][] a, long pow, long MOD) {\n\t\tif (pow == 0) return E;\n\t\tif ((pow & 1) == 0) {\n\t\t\tlong[][] res = binaryMatrixPower(a, pow >> 1, MOD);\n\t\t\treturn matrixMultiplication(res, res, MOD);\n\t\t} else {\n\t\t\tlong[][] res = binaryMatrixPower(a, pow - 1, MOD);\n\t\t\treturn matrixMultiplication(res, a, MOD);\n\t\t}\n\t}\n\n\tlong[][] matrixMultiplication(long[][] a, long[][] b, long MOD) {\n\t\tint n = a.length, m = a[0].length, q = b.length, p = b[0].length;\n\t\tlong[][] res = new long[n][p];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tfor (int j = 0; j < p; j++)\n\t\t\t\tfor (int k = 0; k < m; k++) {\n\t\t\t\t\tres[i][j] += a[i][k] * b[k][j];\n\t\t\t\t\tres[i][j] %= MOD;\n\t\t\t\t}\n\t\treturn res;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew E().run();\n\t}\n\n\tBufferedReader reader;\n\tStringTokenizer tokenizer;\n\tPrintWriter writer;\n\n\tpublic void run() {\n\t\ttry {\n\t\t\treader = new BufferedReader(new InputStreamReader(System.in));\n\t\t\twriter = new PrintWriter(System.out);\n\t\t\tsolve();\n\t\t\twriter.close();\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(261);\n\t\t}\n\t}\n\n\tvoid halt() {\n\t\twriter.close();\n\t\tSystem.exit(0);\n\t}\n\n\tvoid print(Object... objects) {\n\t\tfor (int i = 0; i < objects.length; i++) {\n\t\t\tif (i != 0)\n\t\t\t\twriter.print(' ');\n\t\t\twriter.print(objects[i]);\n\t\t}\n\t}\n\n\tvoid println(Object... objects) {\n\t\tprint(objects);\n\t\twriter.println();\n\t}\n\n\tString nextLine() throws IOException {\n\t\treturn reader.readLine();\n\t}\n\n\tString nextToken() throws IOException {\n\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens())\n\t\t\ttokenizer = new StringTokenizer(nextLine());\n\t\treturn tokenizer.nextToken();\n\t}\n\n\tint nextInt() throws NumberFormatException, IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() throws NumberFormatException, IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() throws NumberFormatException, IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "matrices"], "code_uid": "36a864e9917d65903399f5a11f993e5a", "src_uid": "ee9fa8be2ae05a4e831a4f608c0cc785", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "\nimport java.util.Scanner;\n\npublic class E {\n static int mod;\n\n public static long[][] identity() {\n long[][] a = new long[6][6];\n for (int i = 0; i < 6; i++)\n a[i][i] = 1;\n return a;\n }\n\n public static long[][] modMul(long[][] A, long[][] B) {\n long[][] C = new long[6][6];\n for (int i = 0; i < 6; i++)\n for (int j = 0; j < 6; j++)\n for (int k = 0; k < 6; k++)\n C[i][j] = (C[i][j] + (A[i][k] * B[k][j]) % mod) % mod;\n return C;\n }\n\n public static long[][] modPow(long[][] M, long p) {\n if (p == 0)\n return identity();\n long[][] temp = modPow(M, p >> 1);\n temp = modMul(temp, temp);\n if ((p & 1) != 0)\n temp = modMul(M, temp);\n return temp;\n }\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n mod = in.nextInt();\n long x = in.nextLong() - 1;\n long y = in.nextLong() - 1;\n long dx = (in.nextLong() % mod + mod) % mod;\n long dy = (in.nextLong() % mod + mod) % mod;\n long t = in.nextLong();\n long[][] a = { { 2, 1, 1, 0, 1, 2 }, { 1, 2, 0, 1, 1, 2 },\n { 1, 1, 1, 0, 1, 2 }, { 1, 1, 0, 1, 1, 2 },\n { 0, 0, 0, 0, 1, 1 }, { 0, 0, 0, 0, 0, 1 } };\n long[][] ans = modPow(a, t);\n long[] v = { x, y, dx, dy, 0, 1 };\n long ansX = 0;\n long ansY = 0;\n for (int i = 0; i < 6; i++) {\n ansX = (ansX + (ans[0][i] * v[i]) % mod) % mod;\n ansY = (ansY + (ans[1][i] * v[i]) % mod) % mod;\n }\n System.out.println((ansX + 1) + \" \" + (ansY + 1));\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "matrices"], "code_uid": "c81946e0cbb416499f2850e2dbfecbdd", "src_uid": "ee9fa8be2ae05a4e831a4f608c0cc785", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class BearAndRaspberries {\n\tpublic static void main(String[] args) throws IOException {\n\t\tScanner sc = new Scanner(System.in);\n\t\tn = sc.nextInt();\n\t\tsx = sc.nextInt();\n\t\tsy = sc.nextInt();\n\t\tdx = sc.nextInt();\n\t\tdy = sc.nextInt();\n\t\tT = sc.nextLong();\n\t\tString[] S = new String[]{\"100001\", \"021110\", \"012110\", \"010100\", \"001010\", \"011111\"};\n\t\tint[][] M = new int[6][6];\n\t\tfor(int i=0; i<6; i++){\n\t\t\tfor(int j=0; j<6; j++){\n\t\t\t\tM[i][j] = (int) (S[i].charAt(j)-'0');\n\t\t\t}\n\t\t}\n\t\tint[][] power = pow(M, T);\n\t\tint[][] initial = new int[1][6];\n\t\tinitial[0] = new int[]{1, sx, sy, dx, dy, 0};\n\t\tint[][] result = multiply(initial, power);\n\t\tSystem.out.println(format(result[0][1])+\" \"+format(result[0][2]));\n\t}\n\t\n\tstatic int format(int x){\n\t\treturn x!=0 ? x : n;\n\t}\n\t\n\tstatic int[][] pow(int[][] A, long p){\n\t\tif(p==0) return getIdentity(A.length);\n\t\tif(p==1) return A;\n\t\tint[][] H = pow(A, p>>1);\n\t\tH = multiply(H, H);\n\t\treturn p%2==0 ? H : multiply(A, H);\n\t}\n\t\n\tstatic int[][] getIdentity(int len){\n\t\tint[][] res = new int[len][len];\n\t\tfor(int i=0; i<res.length; i++){\n\t\t\tres[i][i] = 1;\n\t\t}\n\t\treturn res;\n\t}\n\t\n\tstatic int[][] multiply(int[][] a, int[][] b){ // a[0].length = b.length\n\t\tint[][] res = new int[a.length][b[0].length];\n\t\tfor(int i=0; i<a.length; i++){\n\t\t\tfor(int j=0; j<b[0].length; j++){\n\t\t\t\tlong ans = 0;\n\t\t\t\tfor(int k=0; k<a[0].length; k++){\n\t\t\t\t\tans += (1L * a[i][k] * 1L * b[k][j])%n;\n\t\t\t\t}\n\t\t\t\tif(ans < 0) ans += 1L*n*1000000000;\n\t\t\t\tans %= n;\n\t\t\t\tres[i][j] = (int) ans;\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\t\n\tstatic int n, sx, sy, dx, dy;\n\t\n\tstatic long T;\n\t\n}\n", "lang_cluster": "Java", "tags": ["math", "matrices"], "code_uid": "bcb065a1f9ea421e21de2f88762c976a", "src_uid": "ee9fa8be2ae05a4e831a4f608c0cc785", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "public class E {\n\n\tprivate final static boolean autoflush = false;\n\n\tlong [][] A = {\n\t\t\t{ 1, 0, 0, 0, 0, 0 },\n\t\t\t{ 1, 1, 0, 0, 0, 0 },\n\t\t\t{ 2, 1, 2, 1, 1, 0 },\n\t\t\t{ 2, 1, 1, 2, 0, 1 },\n\t\t\t{ 2, 1, 1, 1, 1, 0 },\n\t\t\t{ 2, 1, 1, 1, 0, 1 }\n\t};\n\n\tpublic E () {\n\t\tint N = sc.nextInt();\n\t\tint X = sc.nextInt() - 1;\n\t\tint Y = sc.nextInt() - 1;\n\t\tint VX = sc.nextInt();\n\t\tint VY = sc.nextInt();\n\t\tlong T = sc.nextLong();\n\n\t\tlong [] V = { 1, 0, X, Y, VX, VY };\n\t\tlong [] W = prod(pow(A, T, N), V, N);\n\t\texit(W[2] + 1, W[3] + 1);\n\t}\n\n\tlong [] prod(long [][] A, long [] V, long mod) {\n\t\tlong [][] W = new long [V.length][1];\n\t\tfor (int i : rep(V.length))\n\t\t\tW[i][0] = V[i];\n\t\tlong [][] X = prod(A, W, mod);\n\t\tlong [] res = new long [X.length];\n\t\tfor (int i : rep(X.length))\n\t\t\tres[i] = X[i][0];\n\t\treturn res;\n\t}\n\n\tlong [][] sum (long [][] A, long [][] B, long mod) {\n\t\tint M = A.length, K = A[0].length, N = B[0].length;\n\t\tassert(K == B.length);\n\t\tlong [][] res = new long [M][N];\n\n\t\tfor (int i = 0; i < M; ++i)\n\t\t\tfor (int j = 0; j < N; ++j)\n\t\t\t\tres[i][j] = mod(A[i][j] + B[i][j], mod);\n\t\treturn res;\n\t}\n\n\tlong [][] prod (long [][] A, long [][] B, long mod) {\n\t\tint M = A.length, K = A[0].length, N = B[0].length;\n\t\tassert(K == B.length);\n\t\tlong [][] res = new long [M][N];\n\n\t\tfor (int i = 0; i < M; ++i)\n\t\t\tfor (int j = 0; j < N; ++j)\n\t\t\t\tfor (int k = 0; k < K; ++k)\n\t\t\t\t\tres[i][j] = mod(res[i][j] + A[i][k] * B[k][j], mod);\n\t\treturn res;\n\t}\n\n\tlong [][] pow (long [][] A, long e, long mod) {\n\t\tlong [][] res = id(A.length);\n\t\tif (e > 0) {\n\t\t\tint M = 1 + Long.numberOfTrailingZeros(Long.highestOneBit(e));\n\t\t\tlong [][][] P = new long[M][][]; P[0] = A;\n\t\t\tfor (int i : rep(1, M))\n\t\t\t\tP[i] = prod(P[i-1], P[i-1], mod);\n\t\t\tfor (int i : rep(M))\n\t\t\t\tif ((e & (1L << i)) != 0)\n\t\t\t\t\tres = prod(res, P[i], mod);\n\t\t}\n\t\treturn res;\n\t}\n\n\tlong [][] id (int N) {\n\t\tlong [][] res = new long [N][N];\n\t\tfor (int i : rep(N))\n\t\t\tres[i][i] = 1;\n\t\treturn res;\n\t}\n\n\t///////////////////////////////////////////////////////////////////////////\n\tprivate static int [] rep(int N) { return rep(0, N); }\n\tprivate static int [] rep(int S, int T) { if (T <= S) return new int [0]; int [] res = new int [T-S]; for (int i = S; i < T; ++i) res[i-S] = i; return res; }\n\tprivate static long mod(long x, long mod) { return ((x % mod) + mod) % mod; }\n\t////////////////////////////////////////////////////////////////////////////////////\n\tprivate final static MyScanner sc = new MyScanner();\n\tprivate static class MyScanner {\n\t\tpublic String next() { newLine(); return line[index++]; }\n\t\tpublic int nextInt() { return Integer.parseInt(next()); }\n\t\tpublic long nextLong() { return Long.parseLong(next()); }\n\t\t//////////////////////////////////////////////\n\t\tprivate boolean eol() { return index == line.length; }\n\t\tprivate String readLine() {\n\t\t\ttry {\n\t\t\t\treturn r.readLine();\n\t\t\t} catch (Exception e) {\n\t\t\t\tthrow new Error (e);\n\t\t\t}\n\t\t}\n\t\tprivate final java.io.BufferedReader r;\n\t\tprivate MyScanner () { this(new java.io.BufferedReader(new java.io.InputStreamReader(System.in))); }\n\t\tprivate MyScanner (java.io.BufferedReader r) {\n\t\t\ttry {\n\t\t\t\tthis.r = r;\n\t\t\t\twhile (!r.ready())\n\t\t\t\t\tThread.sleep(1);\n\t\t\t\tstart();\n\t\t\t} catch (Exception e) {\n\t\t\t\tthrow new Error(e);\n\t\t\t}\n\t\t}\n\t\tprivate String [] line;\n\t\tprivate int index;\n\t\tprivate void newLine() {\n\t\t\tif (line == null || eol()) {\n\t\t\t\tline = readLine().split(\" \");\n\t\t\t\tindex = 0;\n\t\t\t}\n\t\t}\n\t}\n\tprivate static void print (Object o, Object... a) { printDelim(\" \", o, a); }\n\tprivate static void printDelim (String delim, Object o, Object... a) { pw.println(build(delim, o, a)); }\n\tprivate static void exit (Object o, Object... a) { print(o, a); exit(); }\n\tprivate static void exit() {\n\t\tpw.close();\n\t\tSystem.out.flush();\n\t\tSystem.err.println(\"------------------\");\n\t\tSystem.err.println(\"Time: \" + ((millis() - t) / 1000.0));\n\t\tSystem.exit(0);\n\t}\n\t////////////////////////////////////////////////////////////////////////////////////\n\tprivate static String build (String delim, Object o, Object... a) {\n\t\tStringBuilder b = new StringBuilder();\n\t\tappend(b, o, delim);\n\t\tfor (Object p : a)\n\t\t\tappend(b, p, delim);\n\t\treturn b.substring(delim.length());\n\t}\n\tprivate static void append(StringBuilder b, Object o, String delim) {\n\t\tif (o.getClass().isArray()) {\n\t\t\tint L = java.lang.reflect.Array.getLength(o);\n\t\t\tfor (int i = 0; i < L; ++i)\n\t\t\t\tappend(b, java.lang.reflect.Array.get(o, i), delim);\n\t\t} else if (o instanceof Iterable<?>)\n\t\t\tfor (Object p : (Iterable<?>)o)\n\t\t\t\tappend(b, p, delim);\n\t\telse\n\t\t\tb.append(delim).append(o);\n\t}\n\t////////////////////////////////////////////////////////////////////////////////////\n\tprivate static void start() { t = millis(); }\n\tprivate static java.io.PrintWriter pw = new java.io.PrintWriter(System.out, autoflush);\n\tprivate static long t;\n\tprivate static long millis() { return System.currentTimeMillis(); }\n\tpublic static void main (String[] args) { new E(); exit(); }\n}\n", "lang_cluster": "Java", "tags": ["math", "matrices"], "code_uid": "bf4e3935eb046ff415748896dc71ccaf", "src_uid": "ee9fa8be2ae05a4e831a4f608c0cc785", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.IOException;\nimport java.io.OutputStreamWriter;\nimport java.util.Arrays;\nimport java.io.BufferedWriter;\nimport java.util.InputMismatchException;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.NoSuchElementException;\nimport java.io.Writer;\nimport java.math.BigInteger;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Árysson Cavalcanti\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n TaskE solver = new TaskE();\n solver.solve(1, in, out);\n out.close();\n }\n}\n\nclass TaskE {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n=in.readInt(), sx=in.readInt()%n, sy=in.readInt()%n, dx=in.readInt()%n, dy=in.readInt()%n;\n long t=in.readLong(), Sx=(2L*sx+dx+sy)%n, Sy=(2L*sy+dy+sx)%n, Dx=(dx+sx+sy)%n, Dy=(dy+sy+sx)%n, t0=(t%2==0?t/2:t)%n, t1=(t%2==1?(t-1)/2:t-1)%n;\n Matrix.mod=n;\n Matrix base=new Matrix(new long[][] {\n {2, 1, 1, 1, 0, 0},\n {1, 2, 1, 1, 0, 0},\n {1, 0, 1, 0, 0, 0},\n {0, 1, 0, 1, 0, 0},\n {1, 1, 1, 1, 1, 0},\n {0, 0, 0, 0, 1, 1}\n }), matrix=new Matrix(new long[][]{\n {Sx, Sy, Dx, Dy, 1, 1},\n {sx, sy, dx, dy, 0, 1}\n });\n long[][] data=Matrix.multiply(matrix, base.power(t)).data;\n Sx=(data[1][0]+n)%n;\n Sy=(data[1][1]+n)%n;\n //out.printLine(data[1][0], data[1][1]);\n out.printLine(Sx==0?n:Sx, Sy==0?n:Sy);\n }\n}\n\nclass InputReader {\n\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public long readLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n}\n\nclass OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public void print(Object...objects) {\n for (int i = 0; i < objects.length; i++) {\n if (i != 0)\n writer.print(' ');\n writer.print(objects[i]);\n }\n }\n\n public void printLine(Object...objects) {\n print(objects);\n writer.println();\n }\n\n public void close() {\n writer.close();\n }\n\n}\n\nclass Matrix {\n public static long mod = Long.MAX_VALUE;\n public final long[][] data;\n public final int rowCount;\n public final int columnCount;\n\n public Matrix(int rowCount, int columnCount) {\n this.rowCount = rowCount;\n this.columnCount = columnCount;\n this.data = new long[rowCount][columnCount];\n }\n\n public Matrix(long[][] data) {\n this.rowCount = data.length;\n this.columnCount = data[0].length;\n this.data = data;\n }\n\n public static Matrix multiply(Matrix first, Matrix second) {\n Matrix result = new Matrix(first.rowCount, second.columnCount);\n for (int i = 0; i < first.rowCount; i++) {\n for (int j = 0; j < second.rowCount; j++) {\n for (int k = 0; k < second.columnCount; k++)\n result.data[i][k] = (result.data[i][k] + first.data[i][j] * second.data[j][k]) % mod;\n }\n }\n return result;\n }\n\n public static Matrix identityMatrix(int size) {\n Matrix result = new Matrix(size, size);\n for (int i = 0; i < size; i++)\n result.data[i][i] = 1;\n return result;\n }\n\n public Matrix power(long exponent) {\n if (exponent == 0)\n return identityMatrix(rowCount);\n if (exponent == 1)\n return this;\n Matrix result = power(exponent >> 1);\n result = multiply(result, result);\n if ((exponent & 1) == 1)\n result = multiply(result, this);\n return result;\n }\n\n}\n", "lang_cluster": "Java", "tags": ["math", "matrices"], "code_uid": "d70dd36643099f54f31f1323ebf4290d", "src_uid": "ee9fa8be2ae05a4e831a4f608c0cc785", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n\nimport static java.lang.Double.parseDouble;\nimport static java.lang.Integer.parseInt;\nimport static java.lang.Long.parseLong;\n\npublic class Main {\n public static void main(String[] args) throws IOException {\n new Solver().run();\n }\n}\n\nclass Solver {\n BufferedReader in;\n PrintWriter out;\n StringTokenizer tok;\n\n void run() throws IOException {\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n //in = new BufferedReader(new FileReader(\"division.in\"));\n //out = new PrintWriter(new File(\"division.out\"));\n solve();\n out.close();\n }\n\n long n;\n\n public void solve() throws IOException {\n long[][] mat = {\n {2, 1, 1, 1, 0, 0},\n {1, 2, 1, 1, 0, 0},\n {1, 0, 1, 0, 0, 0},\n {0, 1, 0, 1, 0, 0},\n {1, 1, 1, 1, 1, 0},\n {1, 1, 1, 1, 1, 1}\n };\n\n n = nextLong();\n long x = nextLong() - 1;\n long y = nextLong() - 1;\n long dx = nextLong();\n long dy = nextLong();\n long t = nextLong();\n dx = mod(dx);\n dy = mod(dy);\n long[] cur = new long[6];\n cur[0] = x;\n cur[1] = y;\n cur[2] = dx;\n cur[3] = dy;\n cur[4] = 1;\n cur[5] = 1;\n\n if (t > 0) {\n mat = power(mat, t);\n cur = mult(cur, mat);\n }\n out.println((cur[0] + 1) + \" \" + (cur[1] + 1));\n }\n\n long mod(long x) {\n x %= n;\n if (x < 0) x += n;\n return x;\n }\n\n long[][] power(long[][] A, long b) {\n if (b == 1) return A;\n if (b % 2 == 1) return mult2(A, power(A, b - 1));\n long[][] ret = power(A, b / 2);\n return mult2(ret, ret);\n }\n\n long[][] mult2(long[][] A, long[][] B) {\n long[][] C = new long[6][6];\n for (int i = 0; i < 6; ++i) {\n for (int j = 0; j < 6; ++j) {\n for (int k = 0; k < 6; ++k) {\n C[i][j] += A[i][k] * B[k][j];\n }\n C[i][j] = mod(C[i][j]);\n }\n }\n return C;\n }\n\n long[] mult(long[] cur, long[][] mat) {\n long[] res = new long[6];\n for (int i = 0; i < 6; ++i) {\n for (int j = 0; j < 6; ++j) {\n res[i] += cur[j] * mat[j][i];\n }\n res[i] = mod(res[i]);\n }\n return res;\n }\n\n String next() throws IOException {\n if (tok == null || !tok.hasMoreTokens()) {\n tok = new StringTokenizer(in.readLine());\n }\n return tok.nextToken();\n }\n\n BigInteger nextBigInteger() throws IOException {\n return new BigInteger(next());\n }\n\n int nextInt() throws IOException {\n return parseInt(next());\n }\n\n long nextLong() throws IOException {\n return parseLong(next());\n }\n\n double nextDouble() throws IOException {\n return parseDouble(next());\n }\n}", "lang_cluster": "Java", "tags": ["math", "matrices"], "code_uid": "edd0db300f749dda0ea3ceb11b64ad3b", "src_uid": "ee9fa8be2ae05a4e831a4f608c0cc785", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class E implements Runnable {\n\n\tfinal long[][] E = { { 1, 0, 0, 0, 0, 0 }, { 0, 1, 0, 0, 0, 0 }, { 0, 0, 1, 0, 0, 0}, { 0, 0, 0, 1, 0, 0 }, { 0, 0, 0, 0, 1, 0 }, { 0, 0, 0, 0, 0, 1 } };\n\tprivate void solve() throws IOException {\n\t\tlong n = nextLong(), sx = nextLong() - 1, sy = nextLong() - 1;\n\t\tlong dx = ((nextLong() % n) + n) % n, dy = ((nextLong() % n) + n) % n, t = nextLong();\n\t\tlong[][] start = { { sx, sy, dx, dy, 0, 1 } };\n\t\tlong[][] next = { { 2, 1, 1, 1, 0, 0 }, { 1, 2, 1, 1, 0, 0 }, { 1, 0, 1, 0, 0, 0 }, { 0, 1, 0, 1, 0, 0 }, { 1, 1, 1, 1, 1, 0 }, { 2, 2, 2, 2, 1, 1 } };\n\t\tlong[][] end = matrixMultiplication(start, binaryMatrixPower(next, t, n), n);\n\t\tprint(end[0][0] + 1, end[0][1] + 1);\n\t}\n\n\tlong[][] binaryMatrixPower(long[][] a, long pow, long MOD) {\n\t\tif (pow == 0) return E;\n\t\tif ((pow & 1) == 0) {\n\t\t\tlong[][] res = binaryMatrixPower(a, pow >> 1, MOD);\n\t\t\treturn matrixMultiplication(res, res, MOD);\n\t\t} else {\n\t\t\tlong[][] res = binaryMatrixPower(a, pow - 1, MOD);\n\t\t\treturn matrixMultiplication(res, a, MOD);\n\t\t}\n\t}\n\n\tlong[][] matrixMultiplication(long[][] a, long[][] b, long MOD) {\n\t\tint n = a.length, m = a[0].length, q = b.length, p = b[0].length;\n\t\tlong[][] res = new long[n][p];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tfor (int j = 0; j < p; j++)\n\t\t\t\tfor (int k = 0; k < m; k++) {\n\t\t\t\t\tres[i][j] += a[i][k] * b[k][j];\n\t\t\t\t\tres[i][j] %= MOD;\n\t\t\t\t}\n\t\treturn res;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew E().run();\n\t}\n\n\tBufferedReader reader;\n\tStringTokenizer tokenizer;\n\tPrintWriter writer;\n\n\tpublic void run() {\n\t\ttry {\n\t\t\treader = new BufferedReader(new InputStreamReader(System.in));\n\t\t\twriter = new PrintWriter(System.out);\n\t\t\tsolve();\n\t\t\twriter.close();\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(261);\n\t\t}\n\t}\n\n\tvoid halt() {\n\t\twriter.close();\n\t\tSystem.exit(0);\n\t}\n\n\tvoid print(Object... objects) {\n\t\tfor (int i = 0; i < objects.length; i++) {\n\t\t\tif (i != 0)\n\t\t\t\twriter.print(' ');\n\t\t\twriter.print(objects[i]);\n\t\t}\n\t}\n\n\tvoid println(Object... objects) {\n\t\tprint(objects);\n\t\twriter.println();\n\t}\n\n\tString nextLine() throws IOException {\n\t\treturn reader.readLine();\n\t}\n\n\tString nextToken() throws IOException {\n\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens())\n\t\t\ttokenizer = new StringTokenizer(nextLine());\n\t\treturn tokenizer.nextToken();\n\t}\n\n\tint nextInt() throws NumberFormatException, IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() throws NumberFormatException, IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() throws NumberFormatException, IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "matrices"], "code_uid": "35156161fc479130592bcd8a11414744", "src_uid": "ee9fa8be2ae05a4e831a4f608c0cc785", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.IOException;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n\n public static void main(final String[] args) throws IOException {\n try(Scanner scan = new Scanner(System.in);\n PrintWriter print = new PrintWriter(System.out)) {\n final int n = scan.nextInt();\n int x = scan.nextInt();\n int y = scan.nextInt();\n final int dx = scan.nextInt();\n final int dy = scan.nextInt();\n final long t = scan.nextLong();\n --x; --y;\n final Pair<Integer, Integer> res = bearOnMatrixGo(n, x, y, dx, dy, t);\n print.println((res.first + 1) + \" \" + (res.second + 1));\n }\n }\n\n public static Pair<Integer, Integer> bearOnMatrixGo(final int n, final int x, final int y, final int dx, final int dy, final long t) {\n final MatrixIntMod matrix = new MatrixIntMod(new int[][] {\n {2, 1, 1, 0, 1, 2},\n {1, 2, 0, 1, 1, 2},\n {1, 1, 1, 0, 1, 2},\n {1, 1, 0, 1, 1, 2},\n {0, 0, 0, 0, 1, 1},\n {0, 0, 0, 0, 0, 1}\n }, n);\n final int[] result = matrix.power(t).mult(new int[] {x, y, dx, dy, 0, 1});\n return new Pair(result[0], result[1]);\n }\n\n public static class MatrixIntMod {\n final int mod;\n final int[][] data;\n\n public MatrixIntMod(final int n, final int m, final int mod) {\n this.mod = mod;\n this.data = new int[n][m];\n for(int i = 0; i < n; ++i) {\n Arrays.fill(data[i], 0);\n }\n }\n\n public MatrixIntMod(final int[][] data, final int mod) {\n this(data.length, data[0].length, mod);\n for(int i = 0; i < data.length; ++i) {\n for(int j = 0; j < data[i].length; ++j) {\n this.data[i][j] = ModNumberUtils.norm(mod, data[i][j]);\n }\n }\n }\n\n public MatrixIntMod(final int[] data, final int mod) {\n this(data.length, 1, mod);\n for(int i = 0; i < data.length; ++i) {\n this.data[i][0] = ModNumberUtils.norm(mod, data[i]);\n }\n }\n\n public int[] all() {\n int n = data.length;\n int m = data[0].length;\n final int[] res = new int[n * m];\n int k = 0;\n for(int i = 0; i < n; ++i) {\n for(int j = 0; j < m; ++j) {\n res[k++] = data[i][j];\n }\n }\n return res;\n }\n\n public MatrixIntMod mult(final MatrixIntMod val) {\n if(data[0].length != val.data.length) throw new RuntimeException(\"dimensions for mult are wrong\");\n final int n = data.length;\n final int m = data[0].length;\n final int l = val.data[0].length;\n final MatrixIntMod res = new MatrixIntMod(n, l, mod);\n for(int i = 0; i < n; ++i) {\n for(int j = 0; j < l; ++j) {\n for(int k = 0; k < m; ++k) {\n res.data[i][j] = ModNumberUtils.add(mod, res.data[i][j],\n ModNumberUtils.mult(mod, data[i][k], val.data[k][j]));\n }\n }\n }\n return res;\n }\n\n public int[] mult(final int[] ar) {\n return mult(new MatrixIntMod(ar, mod)).all();\n }\n\n public MatrixIntMod power(final long t) {\n if(t == 0) return eye(data.length, mod);\n MatrixIntMod res = power(t >> 1);\n res = res.mult(res);\n if((t & 1) == 1) {\n res = res.mult(this);\n }\n return res;\n }\n\n public static MatrixIntMod eye(final int n, final int mod) {\n final MatrixIntMod res = new MatrixIntMod(n, n, mod);\n if(mod > 1) {\n for(int i = 0; i < n; ++i) {\n res.data[i][i] = 1;\n }\n }\n return res;\n }\n }\n\n public static class ModNumberUtils {\n public static int add(int mod, int a, int b) {\n a += b;\n if(a >= mod) {\n a -= mod;\n }\n return a;\n }\n\n public static int norm(int mod, int a) {\n a %= mod;\n if(a < 0) {\n a += mod;\n }\n return a;\n }\n\n public static int mult(int mod, int a, int b) {\n return (int)((long)a * b % mod);\n }\n }\n\n public static class Pair<X, Y>{\n public X first;\n public Y second;\n\n public Pair(final X first, final Y second) {\n this.first = first;\n this.second = second;\n }\n }\n\n\n public static class NumberUtils {\n public static interface Factorizer {\n List<Integer> factorize(int number);\n }\n\n /**\n * thread safe Factorizer\n */\n public static Factorizer createSmallNumberFactorizer(final int upperBound) {\n return new SmallNumberFactorizer(upperBound);\n }\n\n /**\n * thread safe\n */\n private static class SmallNumberFactorizer implements Factorizer {\n private int[] divisors;\n private final int upperBound;\n private boolean prepared = false;\n\n /**\n * lazy\n * time complexity O(n * log(n) * log(log(n))\n * memory complexity O(n)\n */\n public SmallNumberFactorizer(final int upperBound) {\n this.upperBound = upperBound;\n }\n\n private synchronized void prepare() {\n divisors = new int[upperBound];\n Arrays.fill(divisors, 0);\n for(int i = 2; i * i < upperBound; ++i) {\n if(divisors[i] == 0) {\n for(int j = i * i; j < upperBound; j += i) {\n if(divisors[j] == 0) {\n divisors[j] = i;\n }\n }\n }\n }\n prepared = true;\n }\n\n /**\n * complexity O(result)\n */\n public List<Integer> factorize(int number) {\n synchronized (this) {\n if(!prepared) {\n prepare();\n }\n }\n final List<Integer> result = CollectionFactory.createArrayList();\n if(number < 2) return result;\n if(number >= upperBound) throw new RuntimeException(\"number should be less than upper bound\");\n while(divisors[number] > 0) {\n result.add(divisors[number]);\n number /= divisors[number];\n }\n result.add(number);\n return result;\n }\n }\n }\n\n public static class CollectionFactory {\n public static<T> List<T> createArrayList() {\n return new ArrayList<>();\n }\n\n public static<T> List<T> createArrayList(final int capacity) {\n return new ArrayList<>(capacity);\n }\n }\n\n public static class CollectionUtils {\n public static<T> List<T> unique(final List<T> list) {\n final List<T> result = CollectionFactory.createArrayList();\n T p = null;\n for(T elem : list) {\n if(!elem.equals(p)) {\n result.add(elem);\n p = elem;\n }\n }\n return result;\n }\n\n public static<T extends Comparable<T>> T max(final List<T> list, final T lowerBound) {\n T result = lowerBound;\n for(T elem : list) {\n if(elem.compareTo(result) > 0) {\n result = elem;\n }\n }\n return result;\n }\n }\n\n}\n", "lang_cluster": "Java", "tags": ["math", "matrices"], "code_uid": "7e1b94d2d1c6df817f5b106708ab3a9b", "src_uid": "ee9fa8be2ae05a4e831a4f608c0cc785", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.BufferedWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class Div2_482E {\n\n\tstatic int nV;\n\tstatic int p;\n\n\tstatic int[] color;\n\n\tstatic long[] pow2;\n\n\tstatic long[][][][] dp;\n\n\tstatic long MOD = 1_000_000_007;\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tpow2 = new long[500];\n\t\tpow2[0] = 1;\n\t\tfor (int i = 1; i < 500; i++) {\n\t\t\tpow2[i] = pow2[i - 1] * 2 % MOD;\n\t\t}\n\n\t\tBufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n\t\tPrintWriter printer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n\t\tStringTokenizer inputData = new StringTokenizer(reader.readLine());\n\t\tnV = Integer.parseInt(inputData.nextToken());\n\t\tp = Integer.parseInt(inputData.nextToken());\n\n\t\tcolor = new int[nV];\n\t\tinputData = new StringTokenizer(reader.readLine());\n\t\tfor (int i = 0; i < nV; i++) {\n\t\t\tcolor[i] = Integer.parseInt(inputData.nextToken());\n\t\t}\n\n\t\tdp = new long[nV + 1][nV + 1][nV + 1][nV + 1];\n\t\tdp[nV][0][0][0] = 1;\n\t\tpushDP(nV, 0, 0, 0);\n\n\t\tfor (int cV = nV - 1; cV > 0; cV--) {\n\t\t\tfor (int i = 0; i <= nV; i++) {\n\t\t\t\tfor (int j = 0; j <= nV; j++) {\n\t\t\t\t\tfor (int k = 0; k <= nV; k++) {\n\t\t\t\t\t\tint l = nV - cV - i - j - k;\n\t\t\t\t\t\tif (l >= 0 && dp[cV][i][j][k] != 0) {\n\t\t\t\t\t\t\tpushDP(cV, i, j, k);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tlong ans = 0;\n\t\tfor (int wE = 0; wE <= nV; wE++) {\n\t\t\tfor (int wO = 0; wO <= nV; wO++) {\n\t\t\t\tfor (int bE = 0; bE <= nV; bE++) {\n\t\t\t\t\tint bO = nV - wE - wO - bE;\n\n\t\t\t\t\tif (bO >= 0 && ((wO + bO) & 1) == p) {\n\t\t\t\t\t\tans = (ans + dp[0][wE][wO][bE]) % MOD;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprinter.println(ans);\n\t\tprinter.close();\n\t}\n\n\tstatic void pushDP(int cV, int wE, int wO, int bE) {\n\t\tint bO = nV - cV - wE - wO - bE;\n\t\tlong cDP = dp[cV][wE][wO][bE];\n\t\tif (cDP == 0) {\n\t\t\treturn;\n\t\t}\n\n\t\t// white\n\t\tif (color[cV - 1] == 0 || color[cV - 1] == -1) {\n\t\t\tif (bO != 0) {\n\t\t\t\tdp[cV - 1][wE + 1][wO][bE] = (dp[cV - 1][wE + 1][wO][bE] + pow2[wE + wO + bE + bO - 1] * cDP) % MOD;\n\t\t\t\tdp[cV - 1][wE][wO + 1][bE] = (dp[cV - 1][wE][wO + 1][bE] + pow2[wE + wO + bE + bO - 1] * cDP) % MOD;\n\t\t\t} else {\n\t\t\t\tdp[cV - 1][wE][wO + 1][bE] = (dp[cV - 1][wE][wO + 1][bE] + pow2[wE + wO + bE] * cDP) % MOD;\n\t\t\t}\n\t\t}\n\t\t// black\n\t\tif (color[cV - 1] == 1 || color[cV - 1] == -1) {\n\t\t\tif (wO != 0) {\n\t\t\t\tdp[cV - 1][wE][wO][bE + 1] = (dp[cV - 1][wE][wO][bE + 1] + pow2[wE + wO + bE + bO - 1] * cDP) % MOD;\n\t\t\t\tdp[cV - 1][wE][wO][bE] = (dp[cV - 1][wE][wO][bE] + pow2[wE + wO + bE + bO - 1] * cDP) % MOD;\n\t\t\t} else {\n\t\t\t\tdp[cV - 1][wE][wO][bE] = (dp[cV - 1][wE][wO][bE] + pow2[wE + bE + bO] * cDP) % MOD;\n\t\t\t}\n\t\t}\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "ab9c838f398cace189dfa257b21de801", "src_uid": "aaf5f8afa71d9d25ebab405dddec78cd", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.*;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n public static final double EPS = 1e-8;\n private static StreamTokenizer in;\n private static Scanner ins;\n private static PrintWriter out;\n private double p;\n\n public static void main(String[] args) {\n try {\n in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));\n ins = new Scanner(System.in);\n out = new PrintWriter(System.out);\n try {\n if (System.getProperty(\"xDx\") != null) {\n in = new StreamTokenizer(new BufferedReader(new FileReader(\"input.txt\")));\n ins = new Scanner(new FileReader(\"input.txt\"));\n out = new PrintWriter(new FileWriter(\"output.txt\"));\n }\n } catch (Exception e) {\n in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));\n ins = new Scanner(System.in);\n out = new PrintWriter(System.out);\n }\n new Main().run();\n out.close();\n } catch (IOException e) {\n throw new RuntimeException(e.getMessage(), e);\n }\n }\n\n private double[][] dp;\n\n private void run() throws IOException {\n int n = nextInt();\n p = nextDouble();\n int t = nextInt();\n\n dp = new double[n + 1][t + 1];\n for (int i = 0; i <= n; i++) {\n Arrays.fill(dp[i], -1.0);\n }\n\n out.printf(\"%.6f\", calcDp(n, t));\n }\n\n private double calcDp(int n, int t) {\n if (n == 0 || t == 0) {\n return 0;\n }\n\n if (dp[n][t] >= 0) {\n return dp[n][t];\n }\n\n return dp[n][t] = p * (1.0 + calcDp(n - 1, t - 1)) + (1.0 - p) * calcDp(n, t - 1);\n }\n\n\n private int nextInt() throws IOException {\n in.nextToken();\n return (int) in.nval;\n }\n\n private long nextLong() throws IOException {\n in.nextToken();\n return (long) in.nval;\n }\n\n private double nextDouble() throws IOException {\n in.nextToken();\n return in.nval;\n }\n\n private String nextString() throws IOException {\n in.nextToken();\n return in.sval;\n }\n\n}\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "936e7e9b2e69c4480d3feff2479764a2", "src_uid": "20873b1e802c7aa0e409d9f430516c1e", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/* package whatever; // don't place package name! */\n\nimport java.util.*;\nimport java.lang.*;\nimport java.io.*;\n\n/* Name of the class has to be \"Main\" only if the class is public. */\npublic class Main\n{\n\tpublic static void main (String[] args) throws java.lang.Exception\n\t{\n\t double [][] z = new double [2001][2001];\n\t double res = 0;\n\t Scanner in = new Scanner(System.in);\n\t int n = in.nextInt();\n\t double p = in.nextDouble();\n\t int t = in.nextInt();\n z[1][0] = 1 - p;\n\t z[1][1] = p;\n\t for (int i = 2; i <= t; ++i) {\n for (int j = 0; j <= n && j <= i; ++j) {\n\t\t if (j - 1 >= 0) z[i][j] += z[i - 1][j - 1] * p;\n\t\t z[i][j] = (j < n ? z[i][j] + z[i - 1][j] * (1 - p) : z[i][j] + z[i - 1][j]);\n\t }\n\t }\n\t for (int j = 1; j <= n; ++j)\n\t res += z[t][j] * j;\n\t System.out.printf(\"%.6f\", res); \n\t}\n}", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "e74fb6bce142d91625f7a589c81f6061", "src_uid": "20873b1e802c7aa0e409d9f430516c1e", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\nimport java.io.*;\npublic class Main {\n static class Scan {\n private byte[] buf=new byte[1024];\n private int index;\n private InputStream in;\n private int total;\n public Scan()\n {\n in=System.in;\n }\n public int scan()throws IOException\n {\n if(total<0)\n throw new InputMismatchException();\n if(index>=total)\n {\n index=0;\n total=in.read(buf);\n if(total<=0)\n return -1;\n }\n return buf[index++];\n }\n public int scanInt()throws IOException\n {\n int integer=0;\n int n=scan();\n while(isWhiteSpace(n))\n n=scan();\n int neg=1;\n if(n=='-')\n {\n neg=-1;\n n=scan();\n }\n while(!isWhiteSpace(n))\n {\n if(n>='0'&&n<='9')\n {\n integer*=10;\n integer+=n-'0';\n n=scan();\n }\n else throw new InputMismatchException();\n }\n return neg*integer;\n }\n public double scanDouble()throws IOException\n {\n double doub=0;\n int n=scan();\n while(isWhiteSpace(n))\n n=scan();\n int neg=1;\n if(n=='-')\n {\n neg=-1;\n n=scan();\n }\n while(!isWhiteSpace(n)&&n!='.')\n {\n if(n>='0'&&n<='9')\n {\n doub*=10;\n doub+=n-'0';\n n=scan();\n }\n else throw new InputMismatchException();\n }\n if(n=='.')\n {\n n=scan();\n double temp=1;\n while(!isWhiteSpace(n))\n {\n if(n>='0'&&n<='9')\n {\n temp/=10;\n doub+=(n-'0')*temp;\n n=scan();\n }\n else throw new InputMismatchException();\n }\n }\n return doub*neg;\n }\n public String scanString()throws IOException\n {\n StringBuilder sb=new StringBuilder();\n int n=scan();\n while(isWhiteSpace(n))\n n=scan();\n while(!isWhiteSpace(n))\n {\n sb.append((char)n);\n n=scan();\n }\n return sb.toString();\n }\n private boolean isWhiteSpace(int n)\n {\n if(n==' '||n=='\\n'||n=='\\r'||n=='\\t'||n==-1)\n return true;\n return false;\n }\n }\n static int n,t;\n static double p;\n static double dp[][][];\n public static void main(String args[]) throws IOException {\n Scan input=new Scan();\n n=input.scanInt();\n p=input.scanDouble();\n t=input.scanInt();\n double not=1;\n for(int i=0;i<t;i++) {\n not*=(1-p);\n }\n dp=new double[2000][2000][2];\n for(int i=0;i<dp.length;i++) {\n for(int j=0;j<dp[0].length;j++) {\n for(int k=0;k<dp[0][0].length;k++) {\n dp[i][j][k]=-1;\n }\n }\n }\n System.out.println(solve(0,0,true));\n }\n public static double solve(int indx,int time,boolean prev) {\n// System.out.println(indx+\" \"+time+\" \"+prev);\n if(indx==n || time==t) {\n if(prev) {\n return 1;\n }\n return 0;\n }\n if(dp[indx][time][prev?0:1]!=-1) {\n return dp[indx][time][prev?0:1];\n }\n double ways=0;\n if(indx!=n-1 && time!=t-1) {\n ways+=p;\n }\n ways+=p*solve(indx+1,time+1,true);\n ways+=(1-p)*solve(indx,time+1,false);\n dp[indx][time][prev?0:1]=ways;\n return ways;\n }\n}\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "3161a82f6ba4d2366464ab4a7ef7d319", "src_uid": "20873b1e802c7aa0e409d9f430516c1e", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n static int n, t;\n static double p;\n static double[][] dp;\n public static void main(String[] args) throws IOException {\n try (BufferedReader br = new BufferedReader(new InputStreamReader(System.in))) {\n PrintWriter out = new PrintWriter(System.out);\n StringTokenizer st = new StringTokenizer(br.readLine());\n\n n = Integer.parseInt(st.nextToken());\n p = Double.parseDouble(st.nextToken());\n t = Integer.parseInt(st.nextToken());\n dp = new double[t+1][n+1];\n for (double[] d : dp)\n Arrays.fill(d, -1);\n out.printf(\"%.6f%n\", solve(0, 0));\n out.flush();\n out.close();\n }\n }\n static double solve(int i, int pep) {\n if (i == t)\n return pep;\n if (pep == n)\n return pep;\n if (dp[i][pep] != -1)\n return dp[i][pep];\n return dp[i][pep] = p * solve(i+1, pep+1) + (1-p)*solve(i+1, pep);\n\n }\n}\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "38f7f6bb274957a5da1f022b86b26e44", "src_uid": "20873b1e802c7aa0e409d9f430516c1e", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class D\n{\n BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st = null;\n \n private void solve() throws IOException\n {\n int n = nextInt();\n double p = nextDouble();\n int t = nextInt();\n double d[][] = new double[t + 2][n + 2];\n d[0][0] = 1;\n for(int i = 0; i <= t; i++)\n {\n for(int j = 0; j <= n; j++)\n {\n if(j == n)\n {\n d[i + 1][j] += d[i][j];\n break;\n }\n \n d[i + 1][j + 1] += d[i][j] * p;\n d[i + 1][j] += d[i][j] * (1 - p);\n }\n \n }\n \n double ans = 0;\n for(int i = 0; i <= n; i++)\n {\n ans += i * d[t][i];\n }\n \n System.out.println(String.format(\"%.6f\", ans));\n }\n \n String nextToken() throws IOException\n {\n if (st == null || !st.hasMoreTokens())\n {\n st = new StringTokenizer(bf.readLine());\n }\n \n return st.nextToken();\n }\n\n int nextInt() throws IOException\n {\n return Integer.parseInt(nextToken());\n }\n\n long nextLong() throws IOException\n {\n return Long.parseLong(nextToken());\n }\n\n double nextDouble() throws IOException\n {\n return Double.parseDouble(nextToken());\n }\n\n public static void main(String args[]) throws IOException\n {\n new D().solve();\n }\n \n}", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "1fad71aa13f229813f65892a08e734ae", "src_uid": "20873b1e802c7aa0e409d9f430516c1e", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n static int n, t;\n static double p;\n static double memo[][];\n\n static double dp (int time, int soFar) {\n if (time == t) return soFar;\n if (memo[time][soFar] != -1) {\n return memo[time][soFar];\n }\n\n if (soFar == n) {\n return memo[time][soFar] = dp(time + 1, soFar);\n } else {\n return memo[time][soFar] = dp(time + 1, soFar) * (1 - p) + (soFar == n ? 0 : dp(time + 1, soFar + 1) * p);\n }\n }\n public static void main (String [] args) throws Exception {\n Scanner sc = new Scanner(System.in);\n PrintWriter out = new PrintWriter(System.out);\n\n n = sc.nextInt();\n p = sc.nextDouble();\n t = sc.nextInt();\n\n memo = new double[t + 1][t + 1];\n for (int i = 0; i <= t; i++) {\n Arrays.fill(memo[i], -1);\n }\n out.printf(\"%.7f\\n\", dp(0, 0));\n out.flush();\n out.close();\n }\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n static class Scanner {\n StringTokenizer st;\n BufferedReader br;\n\n public Scanner(InputStream s) {\n br = new BufferedReader(new InputStreamReader(s));\n }\n public Scanner (FileReader f) { br = new BufferedReader(f);}\n\n public String next() throws IOException {\n while (st == null || !st.hasMoreTokens())\n st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n\n public int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n public long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n public String nextLine() throws IOException {\n return br.readLine();\n }\n\n public double nextDouble() throws IOException {\n String x = next();\n StringBuilder sb = new StringBuilder(\"0\");\n double res = 0, f = 1;\n boolean dec = false, neg = false;\n int start = 0;\n if (x.charAt(0) == '-') {\n neg = true;\n start++;\n }\n for (int i = start; i < x.length(); i++)\n if (x.charAt(i) == '.') {\n res = Long.parseLong(sb.toString());\n sb = new StringBuilder(\"0\");\n dec = true;\n } else {\n sb.append(x.charAt(i));\n if (dec)\n f *= 10;\n }\n res += Long.parseLong(sb.toString()) / f;\n return res * (neg ? -1 : 1);\n }\n\n public boolean ready() throws IOException {\n return br.ready();\n }\n\n }\n}\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "f11c5dfdab2b2353227f3f2a3dece58b", "src_uid": "20873b1e802c7aa0e409d9f430516c1e", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Task1 {\n\t\n\t\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew Task1().solve();\n\t}\n\t\n\tPrintWriter out;\n\tboolean[] u;\n\tArrayList<Integer>[] g;\n\tArrayList<Integer>[] prev;\n\tint cnt = 0;\n\tint[] ew = new int[200020];\n\tint[] word = new int[20];\n\tint ind = 0;\n\tSet<String> h;\n\tvoid solve() throws IOException{\n\t\tReader in = new Reader(\"input.txt\");\n\t\tout = new PrintWriter( new BufferedWriter(new OutputStreamWriter(System.out)) );\n\t\t//out = new PrintWriter(new FileWriter(new File(\"output.txt\"))); \n\t\t\n\t\tint n = in.nextInt();\n\t\tdouble p = in.nextDouble();\n\t\tint t = in.nextInt();\n\t\t\n\t\tdouble[][] dp = new double[n+2][t+2];\n\t\t\n\t\tdp[1][1] = p;\n\t\tdp[0][1] = 1-p;\n\t\t\n\t\tdouble res = 0;\n\t\t\n\t\tfor (int i = 0; i <= n; i++)\n\t\t\tfor (int j = 1; j <= t; j++) {\n\t\t\t\t\n\t\t\t\tif (i == n)\n\t\t\t\t\tdp[i][j+1] += dp[i][j];\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tdp[i+1][j+1] += dp[i][j]*p;\n\t\t\t\t\tdp[i][j+1] += dp[i][j]*(1-p);\n\t\t\t\t}\n\t\t\t}\n\t\t\n\t\tfor (int i = 1; i <= n; i++) {\n\t\t\t\tres += i*dp[i][t];\n\t\t}\n\t\t\n\t\tout.format(\"%.6f\", res);\n\t\tout.flush();\n\t\tout.close();\n\t}\n\t\n\tclass Reader {\n\t \n\t StringTokenizer token;\n\t BufferedReader in;\n\t \n\t public Reader(String file) throws IOException {\n\t //in = new BufferedReader( new FileReader( file ) );\n\t in = new BufferedReader( new InputStreamReader( System.in ) );\n\t }\n\t \n\t public byte nextByte() throws IOException {\n\t return Byte.parseByte(Next());\n\t }\n\t \n\t public int nextInt() throws IOException {\n\t return Integer.parseInt(Next());\n\t }\n\t \n\t public long nextLong() throws IOException {\n\t return Long.parseLong(Next());\n\t }\n\t \n\t public double nextDouble() throws IOException {\n\t return Double.parseDouble(Next());\n\t }\n\t \n\t public String nextString() throws IOException {\n\t return in.readLine();\n\t }\n\t \n\t private String Next() throws IOException {\n\t while (token == null || !token.hasMoreTokens()) {\n\t token = new StringTokenizer(in.readLine());\n\t }\n\t return token.nextToken();\n\t }\n\n\t \n\t}\n\n\t\n}\n\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "57464af3aa461e1e187f0ff44927f7a7", "src_uid": "20873b1e802c7aa0e409d9f430516c1e", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Locale;\nimport java.util.StringTokenizer;\n\npublic class Test\n{\n\n void solve() throws Exception\n {\n int n = nextInt();\n double p = nextDouble();\n int t = nextInt();\n double[][] a = new double[n + 1][t + 1];\n for( int nn = 1; nn <= n; nn++ )\n {\n for( int tt = 1; tt <= t; tt++ )\n {\n a[nn][tt] = p * ( 1 + a[nn - 1][tt - 1] ) + ( 1 - p ) * a[nn][tt - 1];\n }\n }\n out.printf( \"%.7f\\n\", a[n][t] );\n }\n\n int nextInt() throws IOException\n {\n return Integer.parseInt( nextToken() );\n }\n\n double nextDouble() throws IOException\n {\n return Double.parseDouble( nextToken() );\n }\n\n String nextToken() throws IOException\n {\n while( st == null || !st.hasMoreTokens() ) st = new StringTokenizer( in.readLine() );\n return st.nextToken();\n }\n\n public static void main( String[] args )\n {\n new Test().run();\n }\n\n public void run()\n {\n try\n {\n in = new BufferedReader( new InputStreamReader( System.in ) );\n out = new PrintWriter( System.out );\n st = new StringTokenizer( \"\" );\n Locale.setDefault( Locale.US );\n solve();\n }\n catch( Exception e )\n {\n e.printStackTrace();\n System.exit( 1 );\n }\n finally\n {\n out.close();\n }\n }\n\n BufferedReader in;\n PrintWriter out;\n StringTokenizer st;\n}\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "7a9280cd09ea88a204b9e7f0415b1825", "src_uid": "20873b1e802c7aa0e409d9f430516c1e", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author svilen.marchev@gmail.com\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputStreamReader in = new InputStreamReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskG solver = new TaskG();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskG {\n final int MOD = 1_000_000_007;\n int n;\n int k;\n byte[] moebius;\n int[] powN;\n long[] val;\n\n public void solve(int testNumber, InputStreamReader in, PrintWriter out) {\n SvScanner sc = new SvScanner(in);\n n = sc.nextInt();\n k = sc.nextInt();\n\n// moebius = SvNumberTheoryUtils.genMoebiusFuncForIntsUpTo(k);\n int[] lowestPrimeFactors = SvPrimalityUtils.genLowestPrimeFactorOfIntsUpTo(k);\n moebius = SvNumberTheoryUtils.genMoebiusFuncOfIntsUpTo(k, lowestPrimeFactors);\n\n powN = new int[k + 1];\n for (int i = 1; i <= k; ++i) {\n powN[i] = SvCommonMathUtils.pow(i, n, MOD);\n }\n\n val = new long[k + 1];\n for (int g = 1; g <= k; ++g) {\n for (int i = g; i <= k; i += g) {\n val[i] += moebius[g] * powN[i / g];\n val[i] -= moebius[g] * powN[(i - 1) / g];\n }\n }\n for (int i = 2; i <= k; ++i) {\n val[i] = (val[i] + val[i - 1]) % MOD;\n }\n\n long ans = 0;\n for (int i = 1; i <= k; ++i) {\n long v = (val[i] % MOD + MOD) % MOD;\n ans = (ans + (v ^ i)) % MOD;\n }\n out.println(ans);\n }\n\n }\n\n static class SvScanner {\n private BufferedReader reader;\n private StringTokenizer tokenizer = new StringTokenizer(\"\");\n\n public SvScanner(InputStreamReader in) {\n reader = new BufferedReader(in);\n }\n\n public String next() {\n try {\n while (!tokenizer.hasMoreTokens()) {\n String nextLine = reader.readLine();\n if (nextLine == null) {\n throw new IllegalStateException(\"next line is null\");\n }\n tokenizer = new StringTokenizer(nextLine);\n }\n return tokenizer.nextToken();\n } catch (IOException e) {\n throw new IllegalStateException(e);\n }\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n\n static class SvNumberTheoryUtils {\n public static byte[] genMoebiusFuncOfIntsUpTo(int n, int[] lowestPrimeFactorOf) {\n byte[] moebius = new byte[n + 1];\n moebius[1] = 1;\n for (int i = 2; i <= n; i++) {\n int j = i / lowestPrimeFactorOf[i];\n if (lowestPrimeFactorOf[j] == lowestPrimeFactorOf[i]) {\n moebius[i] = 0;\n } else {\n moebius[i] = (byte) -moebius[j];\n }\n }\n return moebius;\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n }\n\n static class SvPrimalityUtils {\n public static int[] genLowestPrimeFactorOfIntsUpTo(int n) {\n // Allocate enough memory for the primes up to n.\n int u = n + 32;\n double lu = Math.log(u);\n int[] primes = new int[(int) (u / lu + u / lu / lu * 1.5)];\n int numPrimes = 0;\n\n int[] lowestPrimeFactorOf = new int[n + 1];\n for (int i = 2; i <= n; i++) {\n lowestPrimeFactorOf[i] = i;\n }\n\n for (int p = 2; p <= n; ++p) {\n if (lowestPrimeFactorOf[p] == p) {\n primes[numPrimes++] = p;\n }\n for (int i = 0; i < numPrimes && primes[i] <= lowestPrimeFactorOf[p]; ++i) {\n int tmp = primes[i] * p;\n if (tmp > n) break;\n lowestPrimeFactorOf[tmp] = primes[i];\n }\n }\n return lowestPrimeFactorOf;\n }\n\n }\n\n static class SvCommonMathUtils {\n public static int pow(int n, long deg, int mod) {\n if (n < 0 || deg < 0 || mod <= 0) {\n throw new IllegalArgumentException();\n }\n if (deg == 0) {\n return 1;\n } else if (deg % 2 == 0) {\n long tmp = pow(n, deg / 2, mod);\n return (int) ((tmp * tmp) % mod);\n } else {\n return (int) (((n % mod) * (long) pow(n, deg - 1, mod)) % mod);\n }\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "b862bc384d5545d77853ffc1e114f9ef", "src_uid": "122c08aa91c9a9d6a151ee6e3d0662fa", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\n\n/**\n * Created by IntelliJ IDEA.\n * User: piyushd\n * Date: 3/29/11\n * Time: 7:56 PM\n * To change this template use File | Settings | File Templates.\n */\npublic class TaskD {\n\n final int MOD = 1000000007;\n\n void run() {\n String start = next();\n String end = next();\n int K = nextInt();\n int N = start.length();\n\n if (K == 0) {\n if (start.equals(end)) {\n System.out.println(1);\n } else {\n System.out.println(0);\n }\n\n return;\n }\n\n int[] dp = new int[N];\n Arrays.fill(dp, 1);\n dp[0] = 0;\n int sum = N - 1;\n\n for (int i = 1; i < K; i++) {\n int nsum = 0;\n for (int j = 0; j < N; j++) {\n dp[j] = (sum - dp[j] + MOD) % MOD;\n nsum += dp[j];\n if (nsum >= MOD) nsum -= MOD;\n }\n sum = nsum;\n }\n\n int ans = 0;\n String s1, s2;\n for (int i = 0; i < N; i++) {\n s1 = start.substring(0, i);\n s2 = start.substring(i);\n\n if (end.equals(s2.concat(s1))) {\n ans += dp[i];\n if (ans >= MOD) ans -= MOD;\n }\n }\n\n System.out.println(ans);\n }\n\n int nextInt() {\n try {\n int c = System.in.read();\n if (c == -1) return c;\n while (c != '-' && (c < '0' || '9' < c)) {\n c = System.in.read();\n if (c == -1) return c;\n }\n if (c == '-') return -nextInt();\n int res = 0;\n do {\n res *= 10;\n res += c - '0';\n c = System.in.read();\n } while ('0' <= c && c <= '9');\n return res;\n } catch (Exception e) {\n return -1;\n }\n }\n\n long nextLong() {\n try {\n int c = System.in.read();\n if (c == -1) return -1;\n while (c != '-' && (c < '0' || '9' < c)) {\n c = System.in.read();\n if (c == -1) return -1;\n }\n if (c == '-') return -nextLong();\n long res = 0;\n do {\n res *= 10;\n res += c - '0';\n c = System.in.read();\n } while ('0' <= c && c <= '9');\n return res;\n } catch (Exception e) {\n return -1;\n }\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String next() {\n try {\n StringBuilder res = new StringBuilder(\"\");\n int c = System.in.read();\n while (Character.isWhitespace(c))\n c = System.in.read();\n do {\n res.append((char) c);\n } while (!Character.isWhitespace(c = System.in.read()));\n return res.toString();\n } catch (Exception e) {\n return null;\n }\n }\n\n String nextLine() {\n try {\n StringBuilder res = new StringBuilder(\"\");\n int c = System.in.read();\n while (c == '\\r' || c == '\\n')\n c = System.in.read();\n do {\n res.append((char) c);\n c = System.in.read();\n } while (c != '\\r' && c != '\\n');\n return res.toString();\n } catch (Exception e) {\n return null;\n }\n }\n\n public static void main(String[] args) {\n new TaskD().run();\n }\n}\n", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "70b8800f22b9ca9eef683171af43f5d8", "src_uid": "414000abf4345f08ede20798de29b9d4", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// practice with rainboy\nimport java.io.*;\nimport java.util.*;\n\npublic class CF1096G {\n\tstatic final int MD = 998244353;\n\tstatic long[] ww, ww_;\n\tstatic long power(int a, int k) {\n\t\tif (k == 0)\n\t\t\treturn 1;\n\t\tlong p = power(a, k / 2);\n\t\tp = p * p % MD;\n\t\tif (k % 2 == 1)\n\t\t\tp = p * a % MD;\n\t\treturn p;\n\t}\n\tstatic void init() {\n\t\tww = new long[21];\n\t\tww_ = new long[21];\n\t\tfor (int h = 0; h <= 20; h++) {\n\t\t\tww[h] = power(3, MD - 1 >> h);\n\t\t\tww_[h] = power(3, MD - 1 - (MD - 1 >> h));\n\t\t}\n\t}\n\tstatic void ntt(int[] aa, int n, boolean inverse) {\n\t\tfor (int i = 1, j = 0; i < n; i++) {\n\t\t\tint b = n;\n\t\t\tdo\n\t\t\t\tj ^= b >>= 1;\n\t\t\twhile ((j & b) == 0);\n\t\t\tif (i < j) {\n\t\t\t\tint tmp = aa[i]; aa[i] = aa[j]; aa[j] = tmp;\n\t\t\t}\n\t\t}\n\t\tfor (int h = 0, b; (b = 1 << h) < n; h++) {\n\t\t\tlong w_ = inverse ? ww_[h + 1] : ww[h + 1];\n\t\t\tfor (int i = 0; i < n; i += b * 2) {\n\t\t\t\tlong w = 1;\n\t\t\t\tfor (int j = 0; j < b; j++) {\n\t\t\t\t\tint l = i + j, r = l + b;\n\t\t\t\t\tlong u = aa[l], v = aa[r] * w;\n\t\t\t\t\taa[l] = (int) ((u + v) % MD);\n\t\t\t\t\taa[r] = (int) ((u - v) % MD);\n\t\t\t\t\tw = w * w_ % MD;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tpublic static void main(String[] args) throws IOException {\n\t\tinit();\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st = new StringTokenizer(br.readLine());\n\t\tint n = Integer.parseInt(st.nextToken()) / 2;\n\t\tint k = Integer.parseInt(st.nextToken());\n\t\tint n_ = 1;\n\t\twhile (n_ < n * 9 + 1)\n\t\t\tn_ *= 2;\n\t\tint[] aa = new int[n_];\n\t\tst = new StringTokenizer(br.readLine());\n\t\twhile (k-- > 0) {\n\t\t\tint d = Integer.parseInt(st.nextToken());\n\t\t\taa[d] = 1;\n\t\t}\n\t\tntt(aa, n_, false);\n\t\tfor (int i = 0; i < n_; i++)\n\t\t\taa[i] = (int) power(aa[i], n);\n\t\tntt(aa, n_, true);\n\t\tlong v = power(n_, MD - 2);\n\t\tfor (int i = 0; i < n_; i++) {\n\t\t\taa[i] = (int) (aa[i] * v % MD);\n\t\t\tif (aa[i] < 0)\n\t\t\t\taa[i] += MD;\n\t\t}\n\t\tlong ans = 0;\n\t\tfor (int i = 0; i <= n * 9; i++) {\n\t\t\tlong a = aa[i];\n\t\t\tans = (ans + a * a) % MD;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["divide and conquer", "dp", "fft"], "code_uid": "59fb093ea2d27ecdfb8ee269cbf8e298", "src_uid": "279f1f7d250a4be6406c6c7bfc818bbf", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskG solver = new TaskG();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskG {\n static double[] cs = new double[1 << 20];\n static double[] sn = new double[1 << 20];\n static double[] csi = new double[1 << 20];\n static double[] sni = new double[1 << 20];\n\n static {\n for (int len = 1; len <= cs.length; len <<= 1) {\n for (int i = len / 2; i < len; i++) {\n cs[i] = Math.cos(2 * Math.PI * (i - len / 2) / len);\n sn[i] = Math.sin(2 * Math.PI * (i - len / 2) / len);\n csi[i] = Math.cos(-2 * Math.PI * (i - len / 2) / len);\n sni[i] = Math.sin(-2 * Math.PI * (i - len / 2) / len);\n }\n }\n }\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int mod = 998244353;\n int n = in.nextInt();\n int k = in.nextInt();\n int[] v = new int[10];\n for (int i = 0; i < k; i++) {\n int x = in.nextInt();\n v[x] = 1;\n }\n int[] ans = {1};\n int p = n / 2;\n while (true) {\n if (p % 2 != 0) {\n ans = multiplyMod(ans, v, mod);\n }\n p /= 2;\n if (p == 0) break;\n v = multiplyMod(v, v, mod);\n }\n int res = 0;\n for (int x : ans) {\n res = (int) ((res + (long) x * x) % mod);\n }\n out.println(res);\n }\n\n static int[] multiplyMod(int[] a, int[] b, int mod) {\n int need = a.length + b.length - 1;\n int n = Math.max(2, Integer.highestOneBit(need - 1) << 1);\n\n double[] aReal = new double[n];\n double[] aImaginary = new double[n];\n for (int i = 0; i < a.length; i++) {\n int x = (a[i] % mod + mod) % mod;\n aReal[i] = x & ((1 << 15) - 1);\n aImaginary[i] = x >> 15;\n }\n fft(aReal, aImaginary, false);\n\n double[] bReal = new double[n];\n double[] bImaginary = new double[n];\n for (int i = 0; i < b.length; i++) {\n int x = (b[i] % mod + mod) % mod;\n bReal[i] = x & ((1 << 15) - 1);\n bImaginary[i] = x >> 15;\n }\n fft(bReal, bImaginary, false);\n\n double[] faReal = new double[n];\n double[] faImaginary = new double[n];\n double[] fbReal = new double[n];\n double[] fbImaginary = new double[n];\n\n for (int i = 0; i < n; i++) {\n int j = (n - i) & (n - 1);\n\n double a1r = (aReal[i] + aReal[j]) / 2;\n double a1i = (aImaginary[i] - aImaginary[j]) / 2;\n double a2r = (aImaginary[i] + aImaginary[j]) / 2;\n double a2i = (aReal[j] - aReal[i]) / 2;\n\n double b1r = (bReal[i] + bReal[j]) / 2;\n double b1i = (bImaginary[i] - bImaginary[j]) / 2;\n double b2r = (bImaginary[i] + bImaginary[j]) / 2;\n double b2i = (bReal[j] - bReal[i]) / 2;\n\n faReal[i] = a1r * b1r - a1i * b1i - a2r * b2i - a2i * b2r;\n faImaginary[i] = a1r * b1i + a1i * b1r + a2r * b2r - a2i * b2i;\n\n fbReal[i] = a1r * b2r - a1i * b2i + a2r * b1r - a2i * b1i;\n fbImaginary[i] = a1r * b2i + a1i * b2r + a2r * b1i + a2i * b1r;\n }\n\n fft(faReal, faImaginary, true);\n fft(fbReal, fbImaginary, true);\n int[] res = new int[need];\n for (int i = 0; i < need; i++) {\n long aa = (long) (faReal[i] + 0.5);\n long bb = (long) (fbReal[i] + 0.5);\n long cc = (long) (faImaginary[i] + 0.5);\n res[i] = (int) ((aa + ((bb % mod) << 15) + ((cc % mod) << 30)) % mod);\n }\n return res;\n }\n\n static void fft(double[] a, double[] b, boolean inverse) {\n int n = a.length;\n int shift = 32 - Integer.numberOfTrailingZeros(n);\n for (int i = 1; i < n; i++) {\n int j = Integer.reverse(i << shift);\n if (i < j) {\n double temp = a[i];\n a[i] = a[j];\n a[j] = temp;\n temp = b[i];\n b[i] = b[j];\n b[j] = temp;\n }\n }\n for (int len = 2; len <= n; len <<= 1) {\n int halfLen = len >> 1;\n for (int i = 0; i < n; i += len) {\n int w = cs.length / len;\n for (int j = 0, k = 0; j < halfLen; j++, k += w) {\n double wA = inverse ? csi[halfLen + j] : cs[halfLen + j];\n double wB = inverse ? sni[halfLen + j] : sn[halfLen + j];\n double uA = a[i + j];\n double uB = b[i + j];\n double vA = a[i + j + halfLen] * wA - b[i + j + halfLen] * wB;\n double vB = a[i + j + halfLen] * wB + b[i + j + halfLen] * wA;\n a[i + j] = uA + vA;\n b[i + j] = uB + vB;\n a[i + j + halfLen] = uA - vA;\n b[i + j + halfLen] = uB - vB;\n }\n }\n }\n if (inverse) {\n for (int i = 0; i < n; i++) {\n a[i] /= n;\n b[i] /= n;\n }\n }\n }\n\n }\n\n static class InputReader {\n final InputStream is;\n final byte[] buf = new byte[1024];\n int pos;\n int size;\n\n public InputReader(InputStream is) {\n this.is = is;\n }\n\n public int nextInt() {\n int c = read();\n while (isWhitespace(c))\n c = read();\n int sign = 1;\n if (c == '-') {\n sign = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res = res * 10 + c - '0';\n c = read();\n } while (!isWhitespace(c));\n return res * sign;\n }\n\n int read() {\n if (size == -1)\n throw new InputMismatchException();\n if (pos >= size) {\n pos = 0;\n try {\n size = is.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (size <= 0)\n return -1;\n }\n return buf[pos++] & 255;\n }\n\n static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["divide and conquer", "dp", "fft"], "code_uid": "17bda523876a205cd91f27c29d67a7be", "src_uid": "279f1f7d250a4be6406c6c7bfc818bbf", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.util.stream.IntStream;\nimport java.util.Arrays;\nimport java.util.PriorityQueue;\nimport java.util.AbstractQueue;\nimport java.util.HashMap;\nimport java.util.Random;\nimport java.util.Deque;\nimport java.util.function.Supplier;\nimport java.util.ArrayList;\nimport java.util.Map;\nimport java.io.OutputStreamWriter;\nimport java.io.OutputStream;\nimport java.util.Collection;\nimport java.io.IOException;\nimport java.io.UncheckedIOException;\nimport java.util.function.Consumer;\nimport java.util.List;\nimport java.util.stream.Stream;\nimport java.io.Closeable;\nimport java.io.Writer;\nimport java.util.ArrayDeque;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) throws Exception {\n Thread thread = new Thread(null, new TaskAdapter(), \"\", 1 << 27);\n thread.start();\n thread.join();\n }\n\n static class TaskAdapter implements Runnable {\n @Override\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastInput in = new FastInput(inputStream);\n FastOutput out = new FastOutput(outputStream);\n TaskG solver = new TaskG();\n solver.solve(1, in, out);\n out.close();\n }\n }\n\n static class TaskG {\n Modular mod = new Modular(998244353);\n\n public void solve(int testNumber, FastInput in, FastOutput out) {\n int n = in.readInt();\n int k = in.readInt();\n int[] allow = new int[10];\n for (int i = 0; i < k; i++) {\n allow[in.readInt()] = 1;\n }\n IntList p = new IntList();\n p.addAll(allow);\n\n int m = n / 2;\n IntList last = p.clone();\n NumberTheoryTransform ntt = new NumberTheoryTransform(mod, 3);\n\n List<IntList> lists = new ArrayList<>();\n while (m > 1) {\n if (m % 2 == 1) {\n lists.add(last.clone());\n }\n int proper = CachedLog2.ceilLog(2 * last.size());\n last.expandWith(0, (1 << proper));\n NTT.ntt(last.getData(), 1 << proper, false, mod.getMod(), 3);\n ntt.dotMul(last.getData(), last.getData(), last.getData(), proper);\n NTT.ntt(last.getData(), 1 << proper, true, mod.getMod(), 3);\n Polynomials.normalize(last);\n m /= 2;\n }\n lists.add(last);\n\n IntList prod = new IntList();\n ntt.mulByPQ(lists.toArray(new IntList[0]), prod);\n\n int ans = 0;\n for (int i = 0; i < prod.size(); i++) {\n int plus = prod.get(i);\n ans = mod.plus(ans, mod.mul(plus, plus));\n }\n\n out.println(ans);\n }\n\n }\n\n static class PrimitiveRoot {\n private int[] factors;\n private Modular mod;\n private Power pow;\n int phi;\n private static PollardRho rho = new PollardRho();\n\n public PrimitiveRoot(Modular x) {\n phi = x.getMod() - 1;\n mod = x;\n pow = new Power(mod);\n factors = rho.findAllFactors(phi).keySet().stream().mapToInt(Integer::intValue).toArray();\n }\n\n public PrimitiveRoot(int x) {\n this(new Modular(x));\n }\n\n public int findMinPrimitiveRoot() {\n return findMinPrimitiveRoot(2);\n }\n\n public int findMinPrimitiveRoot(int since) {\n for (int i = since; i < mod.m; i++) {\n boolean flag = true;\n for (int f : factors) {\n if (pow.pow(i, phi / f) == 1) {\n flag = false;\n break;\n }\n }\n if (flag) {\n return i;\n }\n }\n return -1;\n }\n\n }\n\n static class CachedLog2 {\n private static final int BITS = 16;\n private static final int LIMIT = 1 << BITS;\n private static final byte[] CACHE = new byte[LIMIT];\n\n static {\n int b = 0;\n for (int i = 0; i < LIMIT; i++) {\n while ((1 << (b + 1)) <= i) {\n b++;\n }\n CACHE[i] = (byte) b;\n }\n }\n\n public static int ceilLog(int x) {\n int ans = floorLog(x);\n if ((1 << ans) < x) {\n ans++;\n }\n return ans;\n }\n\n public static int floorLog(int x) {\n return x < LIMIT ? CACHE[x] : (BITS + CACHE[x >>> BITS]);\n }\n\n }\n\n static class PollardRho {\n MillerRabin mr = new MillerRabin();\n Random random = new Random();\n\n public int findFactor(int n) {\n if (mr.mr(n, 10)) {\n return n;\n }\n while (true) {\n int f = findFactor0(random.nextInt(n), random.nextInt(n), n);\n if (f != -1) {\n return f;\n }\n }\n }\n\n public Map<Integer, Integer> findAllFactors(int n) {\n Map<Integer, Integer> map = new HashMap();\n findAllFactors(map, n);\n return map;\n }\n\n private void findAllFactors(Map<Integer, Integer> map, int n) {\n if (n == 1) {\n return;\n }\n int f = findFactor(n);\n if (f == n) {\n Integer value = map.get(f);\n if (value == null) {\n value = 1;\n }\n map.put(f, value * f);\n return;\n }\n findAllFactors(map, f);\n findAllFactors(map, n / f);\n }\n\n private int findFactor0(int x, int c, int n) {\n int xi = x;\n int xj = x;\n int j = 2;\n int i = 1;\n while (i < n) {\n i++;\n xi = (int) ((long) xi * xi + c) % n;\n int g = GCDs.gcd(n, Math.abs(xi - xj));\n if (g != 1 && g != n) {\n return g;\n }\n if (i == j) {\n j = j << 1;\n xj = xi;\n }\n }\n return -1;\n }\n\n }\n\n static class MillerRabin {\n Modular modular;\n Power power;\n Random random = new Random();\n\n public boolean mr(int n, int s) {\n if (n == 2) {\n return true;\n }\n if (n % 2 == 0) {\n return false;\n }\n modular = new Modular(n);\n power = new Power(modular);\n for (int i = 0; i < s; i++) {\n int x = random.nextInt(n - 2) + 2;\n if (!mr0(x, n)) {\n return false;\n }\n }\n return true;\n }\n\n private boolean mr0(int x, int n) {\n int exp = n - 1;\n while (true) {\n int y = power.pow(x, exp);\n if (y != 1 && y != n - 1) {\n return false;\n }\n if (y != 1 || exp % 2 == 1) {\n break;\n }\n exp = exp / 2;\n }\n return true;\n }\n\n }\n\n static class IntList implements Cloneable {\n private int size;\n private int cap;\n private int[] data;\n private static final int[] EMPTY = new int[0];\n\n public int[] getData() {\n return data;\n }\n\n public IntList(int cap) {\n this.cap = cap;\n if (cap == 0) {\n data = EMPTY;\n } else {\n data = new int[cap];\n }\n }\n\n public IntList(IntList list) {\n this.size = list.size;\n this.cap = list.cap;\n this.data = Arrays.copyOf(list.data, size);\n }\n\n public IntList() {\n this(0);\n }\n\n public void ensureSpace(int req) {\n if (req > cap) {\n while (cap < req) {\n cap = Math.max(cap + 10, 2 * cap);\n }\n data = Arrays.copyOf(data, cap);\n }\n }\n\n private void checkRange(int i) {\n if (i < 0 || i >= size) {\n throw new ArrayIndexOutOfBoundsException();\n }\n }\n\n public int get(int i) {\n checkRange(i);\n return data[i];\n }\n\n public void addAll(int[] x) {\n addAll(x, 0, x.length);\n }\n\n public void addAll(int[] x, int offset, int len) {\n ensureSpace(size + len);\n System.arraycopy(x, offset, data, size, len);\n size += len;\n }\n\n public void addAll(IntList list) {\n addAll(list.data, 0, list.size);\n }\n\n public void expandWith(int x, int len) {\n ensureSpace(len);\n while (size < len) {\n data[size++] = x;\n }\n }\n\n public void retain(int n) {\n if (n < 0) {\n throw new IllegalArgumentException();\n }\n if (n >= size) {\n return;\n }\n size = n;\n }\n\n public int size() {\n return size;\n }\n\n public int[] toArray() {\n return Arrays.copyOf(data, size);\n }\n\n public void clear() {\n size = 0;\n }\n\n public String toString() {\n return Arrays.toString(toArray());\n }\n\n public boolean equals(Object obj) {\n if (!(obj instanceof IntList)) {\n return false;\n }\n IntList other = (IntList) obj;\n return SequenceUtils.equal(data, 0, size - 1, other.data, 0, other.size - 1);\n }\n\n public int hashCode() {\n int h = 1;\n for (int i = 0; i < size; i++) {\n h = h * 31 + data[i];\n }\n return h;\n }\n\n public IntList clone() {\n IntList ans = new IntList();\n ans.addAll(this);\n return ans;\n }\n\n }\n\n static class NumberTheoryTransform {\n private Modular modular;\n private Power power;\n private int g;\n private int[] wCache = new int[30];\n private int[] invCache = new int[30];\n public static Buffer<IntList> listBuffer = Polynomials.listBuffer;\n private Log2 log2 = new Log2();\n\n public NumberTheoryTransform(Modular mod) {\n this(mod, mod.getMod() == 998244353 ? 3 : new PrimitiveRoot(mod.getMod()).findMinPrimitiveRoot());\n }\n\n public NumberTheoryTransform(Modular mod, int g) {\n this.modular = mod;\n this.power = new Power(mod);\n this.g = g;\n for (int i = 0, until = wCache.length; i < until; i++) {\n int s = 1 << i;\n wCache[i] = power.pow(this.g, (modular.getMod() - 1) / 2 / s);\n invCache[i] = power.inverse(s);\n }\n }\n\n public void dotMul(int[] a, int[] b, int[] c, int m) {\n for (int i = 0, n = 1 << m; i < n; i++) {\n c[i] = modular.mul(a[i], b[i]);\n }\n }\n\n public void prepareReverse(int[] r, int b) {\n int n = 1 << b;\n r[0] = 0;\n for (int i = 1; i < n; i++) {\n r[i] = (r[i >> 1] >> 1) | ((1 & i) << (b - 1));\n }\n }\n\n public void dft(int[] p, int m) {\n int n = 1 << m;\n\n IntList rev = listBuffer.alloc();\n rev.expandWith(0, 1 << m);\n int[] r = rev.getData();\n prepareReverse(r, m);\n\n for (int i = 0; i < n; i++) {\n if (r[i] > i) {\n int tmp = p[i];\n p[i] = p[r[i]];\n p[r[i]] = tmp;\n }\n }\n\n int w = 0;\n int t = 0;\n for (int d = 0; d < m; d++) {\n int w1 = wCache[d];\n int s = 1 << d;\n int s2 = s << 1;\n for (int i = 0; i < n; i += s2) {\n w = 1;\n for (int j = 0; j < s; j++) {\n int a = i + j;\n int b = a + s;\n t = modular.mul(w, p[b]);\n p[b] = modular.plus(p[a], -t);\n p[a] = modular.plus(p[a], t);\n w = modular.mul(w, w1);\n }\n }\n }\n\n listBuffer.release(rev);\n }\n\n public void idft(int[] p, int m) {\n dft(p, m);\n\n int n = 1 << m;\n int invN = invCache[m];\n\n p[0] = modular.mul(p[0], invN);\n p[n / 2] = modular.mul(p[n / 2], invN);\n for (int i = 1, until = n / 2; i < until; i++) {\n int a = p[n - i];\n p[n - i] = modular.mul(p[i], invN);\n p[i] = modular.mul(a, invN);\n }\n }\n\n public void mulByPQ(IntList[] lists, IntList ans) {\n PriorityQueue<IntList> pqs = new PriorityQueue<>(lists.length, (a, b) -> a.size() - b.size());\n for (IntList list : lists) {\n IntList clone = listBuffer.alloc();\n clone.addAll(list);\n pqs.add(clone);\n }\n while (pqs.size() > 1) {\n IntList a = pqs.remove();\n IntList b = pqs.remove();\n multiplyAndStoreAnswerIntoA(a, b);\n listBuffer.release(b);\n pqs.add(a);\n }\n\n IntList last = pqs.remove();\n ans.clear();\n ans.addAll(last);\n listBuffer.release(last);\n return;\n }\n\n private void multiplyAndStoreAnswerIntoA(IntList a, IntList b) {\n int rankAns = a.size() - 1 + b.size() - 1;\n int proper = log2.ceilLog(rankAns + 1);\n a.expandWith(0, (1 << proper));\n b.expandWith(0, (1 << proper));\n dft(a.getData(), proper);\n dft(b.getData(), proper);\n dotMul(a.getData(), b.getData(), a.getData(), proper);\n idft(a.getData(), proper);\n Polynomials.normalize(a);\n }\n\n }\n\n static class NTT {\n static int pow(int x, int n, int mod) {\n int res = 1;\n for (long p = x; n > 0; n >>= 1, p = (p * p) % mod)\n if ((n & 1) != 0)\n res = (int) (res * p % mod);\n return res;\n }\n\n public static void ntt(int[] a, int n, boolean invert, int mod, int root) {\n int shift = 32 - Integer.numberOfTrailingZeros(n);\n for (int i = 1; i < n; i++) {\n int j = Integer.reverse(i << shift);\n if (i < j) {\n int temp = a[i];\n a[i] = a[j];\n a[j] = temp;\n }\n }\n\n int root_inv = pow(root, mod - 2, mod);\n\n for (int len = 1; len < n; len <<= 1) {\n int wlen = pow(invert ? root_inv : root, (mod - 1) / (2 * len), mod);\n for (int i = 0; i < n; i += 2 * len)\n for (int j = 0, w = 1; j < len; ++j) {\n int u = a[i + j];\n int v = (int) ((long) a[i + j + len] * w % mod);\n a[i + j] = (u + v) % mod;\n a[i + j + len] = (u - v + mod) % mod;\n w = (int) ((long) w * wlen % mod);\n }\n }\n if (invert) {\n int nrev = pow(n, mod - 2, mod);\n for (int i = 0; i < n; ++i)\n a[i] = (int) ((long) a[i] * nrev % mod);\n }\n }\n\n }\n\n static class Polynomials {\n public static Buffer<IntList> listBuffer = new Buffer<>(IntList::new, list -> list.clear());\n\n public static int rankOf(IntList p) {\n int[] data = p.getData();\n int r = p.size() - 1;\n while (r >= 0 && data[r] == 0) {\n r--;\n }\n return Math.max(0, r);\n }\n\n public static void normalize(IntList list) {\n list.retain(rankOf(list) + 1);\n }\n\n }\n\n static class SequenceUtils {\n public static boolean equal(int[] a, int al, int ar, int[] b, int bl, int br) {\n if ((ar - al) != (br - bl)) {\n return false;\n }\n for (int i = al, j = bl; i <= ar; i++, j++) {\n if (a[i] != b[j]) {\n return false;\n }\n }\n return true;\n }\n\n }\n\n static class FastInput {\n private final InputStream is;\n private byte[] buf = new byte[1 << 13];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastInput(InputStream is) {\n this.is = is;\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n bufLen = -1;\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public int readInt() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n }\n\n static class Power {\n final Modular modular;\n\n public Power(Modular modular) {\n this.modular = modular;\n }\n\n public int pow(int x, int n) {\n if (n == 0) {\n return modular.valueOf(1);\n }\n long r = pow(x, n >> 1);\n r = modular.valueOf(r * r);\n if ((n & 1) == 1) {\n r = modular.valueOf(r * x);\n }\n return (int) r;\n }\n\n public int inverse(int x) {\n return pow(x, modular.m - 2);\n }\n\n }\n\n static class FastOutput implements AutoCloseable, Closeable {\n private StringBuilder cache = new StringBuilder(10 << 20);\n private final Writer os;\n\n public FastOutput(Writer os) {\n this.os = os;\n }\n\n public FastOutput(OutputStream os) {\n this(new OutputStreamWriter(os));\n }\n\n public FastOutput println(int c) {\n cache.append(c).append('\\n');\n return this;\n }\n\n public FastOutput flush() {\n try {\n os.append(cache);\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n return this;\n }\n\n public void close() {\n flush();\n try {\n os.close();\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n\n public String toString() {\n return cache.toString();\n }\n\n }\n\n static class Buffer<T> {\n private Deque<T> deque;\n private Supplier<T> supplier;\n private Consumer<T> cleaner;\n\n public Buffer(Supplier<T> supplier) {\n this(supplier, (x) -> {\n });\n }\n\n public Buffer(Supplier<T> supplier, Consumer<T> cleaner) {\n this(supplier, cleaner, 0);\n }\n\n public Buffer(Supplier<T> supplier, Consumer<T> cleaner, int exp) {\n this.supplier = supplier;\n this.cleaner = cleaner;\n deque = new ArrayDeque<>(exp);\n }\n\n public T alloc() {\n return deque.isEmpty() ? supplier.get() : deque.removeFirst();\n }\n\n public void release(T e) {\n cleaner.accept(e);\n deque.addLast(e);\n }\n\n }\n\n static class Modular {\n int m;\n\n public int getMod() {\n return m;\n }\n\n public Modular(int m) {\n this.m = m;\n }\n\n public Modular(long m) {\n this.m = (int) m;\n if (this.m != m) {\n throw new IllegalArgumentException();\n }\n }\n\n public Modular(double m) {\n this.m = (int) m;\n if (this.m != m) {\n throw new IllegalArgumentException();\n }\n }\n\n public int valueOf(int x) {\n x %= m;\n if (x < 0) {\n x += m;\n }\n return x;\n }\n\n public int valueOf(long x) {\n x %= m;\n if (x < 0) {\n x += m;\n }\n return (int) x;\n }\n\n public int mul(int x, int y) {\n return valueOf((long) x * y);\n }\n\n public int plus(int x, int y) {\n return valueOf(x + y);\n }\n\n public String toString() {\n return \"mod \" + m;\n }\n\n }\n\n static class Log2 {\n public int ceilLog(int x) {\n return 32 - Integer.numberOfLeadingZeros(x - 1);\n }\n\n }\n\n static class GCDs {\n private GCDs() {\n }\n\n public static int gcd(int a, int b) {\n return a >= b ? gcd0(a, b) : gcd0(b, a);\n }\n\n private static int gcd0(int a, int b) {\n return b == 0 ? a : gcd0(b, a % b);\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["divide and conquer", "dp", "fft"], "code_uid": "6d740509c488606b392a75a386947e4b", "src_uid": "279f1f7d250a4be6406c6c7bfc818bbf", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskG solver = new TaskG();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskG {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int mod = 998244353;\n int n = in.nextInt();\n int k = in.nextInt();\n int[] v = new int[10];\n for (int i = 0; i < k; i++) {\n int x = in.nextInt();\n v[x] = 1;\n }\n int[] ans = {1};\n int p = n / 2;\n while (true) {\n if (p % 2 != 0) {\n ans = multiplyMod(ans, v, mod);\n }\n p /= 2;\n if (p == 0) break;\n v = multiplyMod(v, v, mod);\n }\n int res = 0;\n for (int x : ans) {\n res = (int) ((res + (long) x * x) % mod);\n }\n out.println(res);\n }\n\n static int[] multiplyMod(int[] a, int[] b, int mod) {\n int need = a.length + b.length - 1;\n int n = Math.max(2, Integer.highestOneBit(need - 1) << 1);\n\n double[] aReal = new double[n];\n double[] aImaginary = new double[n];\n for (int i = 0; i < a.length; i++) {\n int x = (a[i] % mod + mod) % mod;\n aReal[i] = x & ((1 << 15) - 1);\n aImaginary[i] = x >> 15;\n }\n fft(aReal, aImaginary, false);\n\n double[] bReal = new double[n];\n double[] bImaginary = new double[n];\n for (int i = 0; i < b.length; i++) {\n int x = (b[i] % mod + mod) % mod;\n bReal[i] = x & ((1 << 15) - 1);\n bImaginary[i] = x >> 15;\n }\n fft(bReal, bImaginary, false);\n\n double[] faReal = new double[n];\n double[] faImaginary = new double[n];\n double[] fbReal = new double[n];\n double[] fbImaginary = new double[n];\n\n double cf = 0.25 / n;\n for (int i = 0; i < n; i++) {\n int j = (n - i) & (n - 1);\n\n double a1r = (aReal[i] + aReal[j]) / 2;\n double a1i = (aImaginary[i] - aImaginary[j]) / 2;\n double a2r = (aImaginary[i] + aImaginary[j]) / 2;\n double a2i = (aReal[j] - aReal[i]) / 2;\n\n double b1r = (bReal[i] + bReal[j]) / 2;\n double b1i = (bImaginary[i] - bImaginary[j]) / 2;\n double b2r = (bImaginary[i] + bImaginary[j]) / 2;\n double b2i = (bReal[j] - bReal[i]) / 2;\n\n faReal[i] = a1r * b1r - a1i * b1i - a2r * b2i - a2i * b2r;\n faImaginary[i] = a1r * b1i + a1i * b1r + a2r * b2r - a2i * b2i;\n\n fbReal[i] = a1r * b2r - a1i * b2i + a2r * b1r - a2i * b1i;\n fbImaginary[i] = a1r * b2i + a1i * b2r + a2r * b1i + a2i * b1r;\n }\n\n fft(faReal, faImaginary, true);\n fft(fbReal, fbImaginary, true);\n int[] res = new int[need];\n for (int i = 0; i < need; i++) {\n long aa = (long) (faReal[i] + 0.5);\n long bb = (long) (fbReal[i] + 0.5);\n long cc = (long) (faImaginary[i] + 0.5);\n res[i] = (int) ((aa + ((bb % mod) << 15) + ((cc % mod) << 30)) % mod);\n }\n return res;\n }\n\n static void fft(double[] a, double[] b, boolean inverse) {\n int n = a.length;\n int shift = 32 - Integer.numberOfTrailingZeros(n);\n for (int i = 1; i < n; i++) {\n int j = Integer.reverse(i << shift);\n if (i < j) {\n double temp = a[i];\n a[i] = a[j];\n a[j] = temp;\n temp = b[i];\n b[i] = b[j];\n b[j] = temp;\n }\n }\n for (int len = 2; len <= n; len <<= 1) {\n int halfLen = len >> 1;\n double[] cs = new double[halfLen];\n double[] sn = new double[halfLen];\n for (int i = 0; i < halfLen; i++) {\n cs[i] = Math.cos(2 * Math.PI * i / len * (inverse ? -1 : 1));\n sn[i] = Math.sin(2 * Math.PI * i / len * (inverse ? -1 : 1));\n }\n for (int i = 0; i < n; i += len) {\n for (int j = 0; j < halfLen; j++) {\n double wA = cs[j];\n double wB = sn[j];\n double uA = a[i + j];\n double uB = b[i + j];\n double vA = a[i + j + halfLen] * wA - b[i + j + halfLen] * wB;\n double vB = a[i + j + halfLen] * wB + b[i + j + halfLen] * wA;\n a[i + j] = uA + vA;\n b[i + j] = uB + vB;\n a[i + j + halfLen] = uA - vA;\n b[i + j + halfLen] = uB - vB;\n }\n }\n }\n if (inverse) {\n for (int i = 0; i < n; i++) {\n a[i] /= n;\n b[i] /= n;\n }\n }\n }\n\n }\n\n static class InputReader {\n final InputStream is;\n final byte[] buf = new byte[1024];\n int pos;\n int size;\n\n public InputReader(InputStream is) {\n this.is = is;\n }\n\n public int nextInt() {\n int c = read();\n while (isWhitespace(c))\n c = read();\n int sign = 1;\n if (c == '-') {\n sign = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res = res * 10 + c - '0';\n c = read();\n } while (!isWhitespace(c));\n return res * sign;\n }\n\n int read() {\n if (size == -1)\n throw new InputMismatchException();\n if (pos >= size) {\n pos = 0;\n try {\n size = is.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (size <= 0)\n return -1;\n }\n return buf[pos++] & 255;\n }\n\n static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["divide and conquer", "dp", "fft"], "code_uid": "2ecf367d5e6f2b4bfd813d2c4496b5cb", "src_uid": "279f1f7d250a4be6406c6c7bfc818bbf", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskG solver = new TaskG();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskG {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int mod = 998244353;\n int n = in.nextInt();\n int k = in.nextInt();\n int[] v = new int[10];\n for (int i = 0; i < k; i++) {\n int x = in.nextInt();\n v[x] = 1;\n }\n int[] ans = {1};\n int p = n / 2;\n while (true) {\n if (p % 2 != 0) {\n ans = multiplyMod(ans, v, mod);\n }\n p /= 2;\n v = multiplyMod(v, v, mod);\n if (p == 0) break;\n }\n int res = 0;\n for (int x : ans) {\n res = (int) ((res + (long) x * x) % mod);\n }\n out.println(res);\n }\n\n static int[] multiplyMod(int[] a, int[] b, int mod) {\n int need = a.length + b.length - 1;\n int n = Math.max(2, Integer.highestOneBit(need - 1) << 1);\n\n double[] aReal = new double[n];\n double[] aImaginary = new double[n];\n for (int i = 0; i < a.length; i++) {\n int x = (a[i] % mod + mod) % mod;\n aReal[i] = x & ((1 << 15) - 1);\n aImaginary[i] = x >> 15;\n }\n fft(aReal, aImaginary, false);\n\n double[] bReal = new double[n];\n double[] bImaginary = new double[n];\n for (int i = 0; i < b.length; i++) {\n int x = (b[i] % mod + mod) % mod;\n bReal[i] = x & ((1 << 15) - 1);\n bImaginary[i] = x >> 15;\n }\n fft(bReal, bImaginary, false);\n\n double[] faReal = new double[n];\n double[] faImaginary = new double[n];\n double[] fbReal = new double[n];\n double[] fbImaginary = new double[n];\n\n for (int i = 0; i < n; i++) {\n int j = (n - i) & (n - 1);\n\n double a1r = (aReal[i] + aReal[j]) / 2;\n double a1i = (aImaginary[i] - aImaginary[j]) / 2;\n double a2r = (aImaginary[i] + aImaginary[j]) / 2;\n double a2i = (aReal[j] - aReal[i]) / 2;\n\n double b1r = (bReal[i] + bReal[j]) / 2;\n double b1i = (bImaginary[i] - bImaginary[j]) / 2;\n double b2r = (bImaginary[i] + bImaginary[j]) / 2;\n double b2i = (bReal[j] - bReal[i]) / 2;\n\n faReal[i] = a1r * b1r - a1i * b1i - a2r * b2i - a2i * b2r;\n faImaginary[i] = a1r * b1i + a1i * b1r + a2r * b2r - a2i * b2i;\n\n fbReal[i] = a1r * b2r - a1i * b2i + a2r * b1r - a2i * b1i;\n fbImaginary[i] = a1r * b2i + a1i * b2r + a2r * b1i + a2i * b1r;\n }\n\n fft(faReal, faImaginary, true);\n fft(fbReal, fbImaginary, true);\n int[] res = new int[need];\n for (int i = 0; i < need; i++) {\n long aa = (long) (faReal[i] + 0.5);\n long bb = (long) (fbReal[i] + 0.5);\n long cc = (long) (faImaginary[i] + 0.5);\n res[i] = (int) ((aa + ((bb % mod) << 15) + ((cc % mod) << 30)) % mod);\n }\n return res;\n }\n\n static void fft(double[] a, double[] b, boolean inverse) {\n int n = a.length;\n int shift = 32 - Integer.numberOfTrailingZeros(n);\n for (int i = 1; i < n; i++) {\n int j = Integer.reverse(i << shift);\n if (i < j) {\n double temp = a[i];\n a[i] = a[j];\n a[j] = temp;\n temp = b[i];\n b[i] = b[j];\n b[j] = temp;\n }\n }\n for (int len = 2; len <= n; len <<= 1) {\n int halfLen = len >> 1;\n double[] cs = new double[halfLen];\n double[] sn = new double[halfLen];\n for (int i = 0; i < halfLen; i++) {\n cs[i] = Math.cos(2 * Math.PI * i / len * (inverse ? -1 : 1));\n sn[i] = Math.sin(2 * Math.PI * i / len * (inverse ? -1 : 1));\n }\n for (int i = 0; i < n; i += len) {\n for (int j = 0; j < halfLen; j++) {\n double wA = cs[j];\n double wB = sn[j];\n double uA = a[i + j];\n double uB = b[i + j];\n double vA = a[i + j + halfLen] * wA - b[i + j + halfLen] * wB;\n double vB = a[i + j + halfLen] * wB + b[i + j + halfLen] * wA;\n a[i + j] = uA + vA;\n b[i + j] = uB + vB;\n a[i + j + halfLen] = uA - vA;\n b[i + j + halfLen] = uB - vB;\n }\n }\n }\n if (inverse) {\n for (int i = 0; i < n; i++) {\n a[i] /= n;\n b[i] /= n;\n }\n }\n }\n\n }\n\n static class InputReader {\n final InputStream is;\n final byte[] buf = new byte[1024];\n int pos;\n int size;\n\n public InputReader(InputStream is) {\n this.is = is;\n }\n\n public int nextInt() {\n int c = read();\n while (isWhitespace(c))\n c = read();\n int sign = 1;\n if (c == '-') {\n sign = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res = res * 10 + c - '0';\n c = read();\n } while (!isWhitespace(c));\n return res * sign;\n }\n\n int read() {\n if (size == -1)\n throw new InputMismatchException();\n if (pos >= size) {\n pos = 0;\n try {\n size = is.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (size <= 0)\n return -1;\n }\n return buf[pos++] & 255;\n }\n\n static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["divide and conquer", "dp", "fft"], "code_uid": "7709f56e865aca8e3e30870e8b26294e", "src_uid": "279f1f7d250a4be6406c6c7bfc818bbf", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package educational.round57;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class G {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t\tint n = ni();\n\t\tint K = ni();\n\t\tint[] d = na(K);\n\t\tlong[] f = new long[20];\n\t\tfor(int i = 0;i < K;i++){\n\t\t\tfor(int j = 0;j < K;j++){\n\t\t\t\tf[10+d[i]-d[j]]++;\n\t\t\t}\n\t\t}\n\t\t\n\t\tn /= 2;\n\t\tlong[] g = new long[1];\n\t\tg[0] = 1;\n\t\tfor(int D = 17;D >= 0;D--){\n\t\t\tg = clean(convoluteSimply(g, g, mod, 3));\n\t\t\tif(n<<~D<0){\n\t\t\t\tg = clean(mulnaive(g, f));\n\t\t\t}\n\t\t}\n\t\tout.println(n*10 < g.length ? g[n*10] : 0);\n\t}\n\t\n\tlong[] clean(long[] a)\n\t{\n\t\tfor(int i = a.length-1;i >= 0;i--){\n\t\t\tif(a[i] != 0){\n\t\t\t\tif(i == a.length-1)return a;\n\t\t\t\treturn Arrays.copyOf(a, i+1);\n\t\t\t}\n\t\t}\n\t\treturn new long[0];\n\t}\n\t\n\tpublic static long[] mulnaive(long[] a, long[] b)\n\t{\n\t\tlong[] c = new long[a.length+b.length-1];\n\t\tlong big = 8L*mod*mod;\n\t\tfor(int i = 0;i < a.length;i++){\n\t\t\tfor(int j = 0;j < b.length;j++){\n\t\t\t\tc[i+j] += a[i]*b[j];\n\t\t\t\tif(c[i+j] >= big)c[i+j] -= big;\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0;i < c.length;i++)c[i] %= mod;\n\t\treturn c;\n\t}\n\n\t\n\tstatic int mod = 998244353;\n\t\n\tpublic static final int[] NTTPrimes = {1053818881, 1051721729, 1045430273, 1012924417, 1007681537, 1004535809, 998244353, 985661441, 976224257, 975175681};\n\tpublic static final int[] NTTPrimitiveRoots = {7, 6, 3, 5, 3, 3, 3, 3, 3, 17};\n//\tpublic static final int[] NTTPrimes = {1012924417, 1004535809, 998244353, 985661441, 975175681, 962592769, 950009857, 943718401, 935329793, 924844033};\n//\tpublic static final int[] NTTPrimitiveRoots = {5, 3, 3, 3, 17, 7, 7, 7, 3, 5};\n\t\n\tpublic static long[] convoluteSimply(long[] a, long[] b, int P, int g)\n\t{\n\t\tint m = Math.max(2, Integer.highestOneBit(Math.max(a.length, b.length)-1)<<2);\n\t\tlong[] fa = nttmb(a, m, false, P, g);\n\t\tlong[] fb = a == b ? fa : nttmb(b, m, false, P, g);\n\t\tfor(int i = 0;i < m;i++){\n\t\t\tfa[i] = fa[i]*fb[i]%P;\n\t\t}\n\t\treturn nttmb(fa, m, true, P, g);\n\t}\n\t\n\tpublic static long[] convolute(long[] a, long[] b)\n\t{\n\t\tint USE = 2;\n\t\tint m = Math.max(2, Integer.highestOneBit(Math.max(a.length, b.length)-1)<<2);\n\t\tlong[][] fs = new long[USE][];\n\t\tfor(int k = 0;k < USE;k++){\n\t\t\tint P = NTTPrimes[k], g = NTTPrimitiveRoots[k];\n\t\t\tlong[] fa = nttmb(a, m, false, P, g);\n\t\t\tlong[] fb = a == b ? fa : nttmb(b, m, false, P, g);\n\t\t\tfor(int i = 0;i < m;i++){\n\t\t\t\tfa[i] = fa[i]*fb[i]%P;\n\t\t\t}\n\t\t\tfs[k] = nttmb(fa, m, true, P, g);\n\t\t}\n\t\t\n\t\tint[] mods = Arrays.copyOf(NTTPrimes, USE);\n\t\tlong[] gammas = garnerPrepare(mods);\n\t\tint[] buf = new int[USE];\n\t\tfor(int i = 0;i < fs[0].length;i++){\n\t\t\tfor(int j = 0;j < USE;j++)buf[j] = (int)fs[j][i];\n\t\t\tlong[] res = garnerBatch(buf, mods, gammas);\n\t\t\tlong ret = 0;\n\t\t\tfor(int j = res.length-1;j >= 0;j--)ret = ret * mods[j] + res[j];\n\t\t\tfs[0][i] = ret;\n\t\t}\n\t\treturn fs[0];\n\t}\n\t\n\tpublic static long[] convolute(long[] a, long[] b, int USE, int mod)\n\t{\n\t\tint m = Math.max(2, Integer.highestOneBit(Math.max(a.length, b.length)-1)<<2);\n\t\tlong[][] fs = new long[USE][];\n\t\tfor(int k = 0;k < USE;k++){\n\t\t\tint P = NTTPrimes[k], g = NTTPrimitiveRoots[k];\n\t\t\tlong[] fa = nttmb(a, m, false, P, g);\n\t\t\tlong[] fb = a == b ? fa : nttmb(b, m, false, P, g);\n\t\t\tfor(int i = 0;i < m;i++){\n\t\t\t\tfa[i] = fa[i]*fb[i]%P;\n\t\t\t}\n\t\t\tfs[k] = nttmb(fa, m, true, P, g);\n\t\t}\n\t\t\n\t\tint[] mods = Arrays.copyOf(NTTPrimes, USE);\n\t\tlong[] gammas = garnerPrepare(mods);\n\t\tint[] buf = new int[USE];\n\t\tfor(int i = 0;i < fs[0].length;i++){\n\t\t\tfor(int j = 0;j < USE;j++)buf[j] = (int)fs[j][i];\n\t\t\tlong[] res = garnerBatch(buf, mods, gammas);\n\t\t\tlong ret = 0;\n\t\t\tfor(int j = res.length-1;j >= 0;j--)ret = (ret * mods[j] + res[j]) % mod;\n\t\t\tfs[0][i] = ret;\n\t\t}\n\t\treturn fs[0];\n\t}\n\t\n\t// static int[] wws = new int[270000]; // outer faster\n\t\n\t// Modifed Montgomery + Barrett\n\tprivate static long[] nttmb(long[] src, int n, boolean inverse, int P, int g)\n\t{\n\t\tlong[] dst = Arrays.copyOf(src, n);\n\t\t\n\t\tint h = Integer.numberOfTrailingZeros(n);\n\t\tlong K = Integer.highestOneBit(P)<<1;\n\t\tint H = Long.numberOfTrailingZeros(K)*2;\n\t\tlong M = K*K/P;\n\t\t\n\t\tint[] wws = new int[1<<h-1];\n\t\tlong dw = inverse ? pow(g, P-1-(P-1)/n, P) : pow(g, (P-1)/n, P);\n\t\tlong w = (1L<<32)%P;\n\t\tfor(int k = 0;k < 1<<h-1;k++){\n\t\t\twws[k] = (int)w;\n\t\t\tw = modh(w*dw, M, H, P);\n\t\t}\n\t\tlong J = invl(P, 1L<<32);\n\t\tfor(int i = 0;i < h;i++){\n\t\t\tfor(int j = 0;j < 1<<i;j++){\n\t\t\t\tfor(int k = 0, s = j<<h-i, t = s|1<<h-i-1;k < 1<<h-i-1;k++,s++,t++){\n\t\t\t\t\tlong u = (dst[s] - dst[t] + 2*P)*wws[k];\n\t\t\t\t\tdst[s] += dst[t];\n\t\t\t\t\tif(dst[s] >= 2*P)dst[s] -= 2*P;\n//\t\t\t\t\tlong Q = (u&(1L<<32)-1)*J&(1L<<32)-1;\n\t\t\t\t\tlong Q = (u<<32)*J>>>32;\n\t\t\t\t\tdst[t] = (u>>>32)-(Q*P>>>32)+P;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(i < h-1){\n\t\t\t\tfor(int k = 0;k < 1<<h-i-2;k++)wws[k] = wws[k*2];\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tif(dst[i] >= P)dst[i] -= P;\n\t\t}\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tint rev = Integer.reverse(i)>>>-h;\n\t\t\tif(i < rev){\n\t\t\t\tlong d = dst[i]; dst[i] = dst[rev]; dst[rev] = d;\n\t\t\t}\n\t\t}\n\t\t\n\t\tif(inverse){\n\t\t\tlong in = invl(n, P);\n\t\t\tfor(int i = 0;i < n;i++)dst[i] = modh(dst[i]*in, M, H, P);\n\t\t}\n\t\t\n\t\treturn dst;\n\t}\n\t\n\t// Modified Shoup + Barrett\n\tprivate static long[] nttsb(long[] src, int n, boolean inverse, int P, int g)\n\t{\n\t\tlong[] dst = Arrays.copyOf(src, n);\n\t\t\n\t\tint h = Integer.numberOfTrailingZeros(n);\n\t\tlong K = Integer.highestOneBit(P)<<1;\n\t\tint H = Long.numberOfTrailingZeros(K)*2;\n\t\tlong M = K*K/P;\n\t\t\n\t\tlong dw = inverse ? pow(g, P-1-(P-1)/n, P) : pow(g, (P-1)/n, P);\n\t\tlong[] wws = new long[1<<h-1];\n\t\tlong[] ws = new long[1<<h-1];\n\t\tlong w = 1;\n\t\tfor(int k = 0;k < 1<<h-1;k++){\n\t\t\twws[k] = (w<<32)/P;\n\t\t\tws[k] = w;\n\t\t\tw = modh(w*dw, M, H, P);\n\t\t}\n\t\tfor(int i = 0;i < h;i++){\n\t\t\tfor(int j = 0;j < 1<<i;j++){\n\t\t\t\tfor(int k = 0, s = j<<h-i, t = s|1<<h-i-1;k < 1<<h-i-1;k++,s++,t++){\n\t\t\t\t\tlong ndsts = dst[s] + dst[t];\n\t\t\t\t\tif(ndsts >= 2*P)ndsts -= 2*P;\n\t\t\t\t\tlong T = dst[s] - dst[t] + 2*P;\n\t\t\t\t\tlong Q = wws[k]*T>>>32;\n\t\t\t\t\tdst[s] = ndsts;\n\t\t\t\t\tdst[t] = ws[k]*T-Q*P&(1L<<32)-1;\n\t\t\t\t}\n\t\t\t}\n//\t\t\tdw = dw * dw % P;\n\t\t\tif(i < h-1){\n\t\t\t\tfor(int k = 0;k < 1<<h-i-2;k++){\n\t\t\t\t\twws[k] = wws[k*2];\n\t\t\t\t\tws[k] = ws[k*2];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tif(dst[i] >= P)dst[i] -= P;\n\t\t}\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tint rev = Integer.reverse(i)>>>-h;\n\t\t\tif(i < rev){\n\t\t\t\tlong d = dst[i]; dst[i] = dst[rev]; dst[rev] = d;\n\t\t\t}\n\t\t}\n\t\t\n\t\tif(inverse){\n\t\t\tlong in = invl(n, P);\n\t\t\tfor(int i = 0;i < n;i++){\n\t\t\t\tdst[i] = modh(dst[i] * in, M, H, P);\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn dst;\n\t}\n\t\n\tstatic final long mask = (1L<<31)-1;\n\t\n\tpublic static long modh(long a, long M, int h, int mod)\n\t{\n\t\tlong r = a-((M*(a&mask)>>>31)+M*(a>>>31)>>>h-31)*mod;\n\t\treturn r < mod ? r : r-mod;\n\t}\n\t\n\tprivate static long[] garnerPrepare(int[] m)\n\t{\n\t\tint n = m.length;\n\t\tassert n == m.length;\n\t\tif(n == 0)return new long[0];\n\t\tlong[] gamma = new long[n];\n\t\tfor(int k = 1;k < n;k++){\n\t\t\tlong prod = 1;\n\t\t\tfor(int i = 0;i < k;i++){\n\t\t\t\tprod = prod * m[i] % m[k];\n\t\t\t}\n\t\t\tgamma[k] = invl(prod, m[k]);\n\t\t}\n\t\treturn gamma;\n\t}\n\t\n\tprivate static long[] garnerBatch(int[] u, int[] m, long[] gamma)\n\t{\n\t\tint n = u.length;\n\t\tassert n == m.length;\n\t\tlong[] v = new long[n];\n\t\tv[0] = u[0];\n\t\tfor(int k = 1;k < n;k++){\n\t\t\tlong temp = v[k-1];\n\t\t\tfor(int j = k-2;j >= 0;j--){\n\t\t\t\ttemp = (temp * m[j] + v[j]) % m[k];\n\t\t\t}\n\t\t\tv[k] = (u[k] - temp) * gamma[k] % m[k];\n\t\t\tif(v[k] < 0)v[k] += m[k];\n\t\t}\n\t\treturn v;\n\t}\n\t\n\tprivate static long pow(long a, long n, long mod) {\n\t\t//\t\ta %= mod;\n\t\tlong ret = 1;\n\t\tint x = 63 - Long.numberOfLeadingZeros(n);\n\t\tfor (; x >= 0; x--) {\n\t\t\tret = ret * ret % mod;\n\t\t\tif (n << 63 - x < 0)\n\t\t\t\tret = ret * a % mod;\n\t\t}\n\t\treturn ret;\n\t}\n\t\n\tprivate static long invl(long a, long mod) {\n\t\tlong b = mod;\n\t\tlong p = 1, q = 0;\n\t\twhile (b > 0) {\n\t\t\tlong c = a / b;\n\t\t\tlong d;\n\t\t\td = a;\n\t\t\ta = b;\n\t\t\tb = d % b;\n\t\t\td = p;\n\t\t\tp = q;\n\t\t\tq = d - c * q;\n\t\t}\n\t\treturn p < 0 ? p + mod : p;\n\t}\n\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new G().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["divide and conquer", "dp", "fft"], "code_uid": "fc4bab2636b36a4bf15bb74a3a713a2c", "src_uid": "279f1f7d250a4be6406c6c7bfc818bbf", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskG solver = new TaskG();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskG {\n static double[] cs = new double[1 << 21];\n static double[] sn = new double[1 << 21];\n static double[] csi = new double[1 << 21];\n static double[] sni = new double[1 << 21];\n\n static {\n for (int i = 0; i < cs.length; i++) {\n cs[i] = Math.cos(2 * Math.PI * i / cs.length);\n sn[i] = Math.sin(2 * Math.PI * i / cs.length);\n csi[i] = Math.cos(-2 * Math.PI * i / cs.length);\n sni[i] = Math.sin(-2 * Math.PI * i / cs.length);\n }\n }\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int mod = 998244353;\n int n = in.nextInt();\n int k = in.nextInt();\n int[] v = new int[10];\n for (int i = 0; i < k; i++) {\n int x = in.nextInt();\n v[x] = 1;\n }\n int[] ans = {1};\n int p = n / 2;\n while (true) {\n if (p % 2 != 0) {\n ans = multiplyMod(ans, v, mod);\n }\n p /= 2;\n if (p == 0) break;\n v = multiplyMod(v, v, mod);\n }\n int res = 0;\n for (int x : ans) {\n res = (int) ((res + (long) x * x) % mod);\n }\n out.println(res);\n }\n\n static int[] multiplyMod(int[] a, int[] b, int mod) {\n int need = a.length + b.length - 1;\n int n = Math.max(2, Integer.highestOneBit(need - 1) << 1);\n\n double[] aReal = new double[n];\n double[] aImaginary = new double[n];\n for (int i = 0; i < a.length; i++) {\n int x = (a[i] % mod + mod) % mod;\n aReal[i] = x & ((1 << 15) - 1);\n aImaginary[i] = x >> 15;\n }\n fft(aReal, aImaginary, false);\n\n double[] bReal = new double[n];\n double[] bImaginary = new double[n];\n for (int i = 0; i < b.length; i++) {\n int x = (b[i] % mod + mod) % mod;\n bReal[i] = x & ((1 << 15) - 1);\n bImaginary[i] = x >> 15;\n }\n fft(bReal, bImaginary, false);\n\n double[] faReal = new double[n];\n double[] faImaginary = new double[n];\n double[] fbReal = new double[n];\n double[] fbImaginary = new double[n];\n\n for (int i = 0; i < n; i++) {\n int j = (n - i) & (n - 1);\n\n double a1r = (aReal[i] + aReal[j]) / 2;\n double a1i = (aImaginary[i] - aImaginary[j]) / 2;\n double a2r = (aImaginary[i] + aImaginary[j]) / 2;\n double a2i = (aReal[j] - aReal[i]) / 2;\n\n double b1r = (bReal[i] + bReal[j]) / 2;\n double b1i = (bImaginary[i] - bImaginary[j]) / 2;\n double b2r = (bImaginary[i] + bImaginary[j]) / 2;\n double b2i = (bReal[j] - bReal[i]) / 2;\n\n faReal[i] = a1r * b1r - a1i * b1i - a2r * b2i - a2i * b2r;\n faImaginary[i] = a1r * b1i + a1i * b1r + a2r * b2r - a2i * b2i;\n\n fbReal[i] = a1r * b2r - a1i * b2i + a2r * b1r - a2i * b1i;\n fbImaginary[i] = a1r * b2i + a1i * b2r + a2r * b1i + a2i * b1r;\n }\n\n fft(faReal, faImaginary, true);\n fft(fbReal, fbImaginary, true);\n int[] res = new int[need];\n for (int i = 0; i < need; i++) {\n long aa = (long) (faReal[i] + 0.5);\n long bb = (long) (fbReal[i] + 0.5);\n long cc = (long) (faImaginary[i] + 0.5);\n res[i] = (int) ((aa + ((bb % mod) << 15) + ((cc % mod) << 30)) % mod);\n }\n return res;\n }\n\n static void fft(double[] a, double[] b, boolean inverse) {\n int n = a.length;\n int shift = 32 - Integer.numberOfTrailingZeros(n);\n for (int i = 1; i < n; i++) {\n int j = Integer.reverse(i << shift);\n if (i < j) {\n double temp = a[i];\n a[i] = a[j];\n a[j] = temp;\n temp = b[i];\n b[i] = b[j];\n b[j] = temp;\n }\n }\n for (int len = 2; len <= n; len <<= 1) {\n int halfLen = len >> 1;\n for (int i = 0; i < n; i += len) {\n int w = cs.length / len;\n for (int j = 0, k = 0; j < halfLen; j++, k += w) {\n double wA = inverse ? csi[k] : cs[k];\n double wB = inverse ? sni[k] : sn[k];\n double uA = a[i + j];\n double uB = b[i + j];\n double vA = a[i + j + halfLen] * wA - b[i + j + halfLen] * wB;\n double vB = a[i + j + halfLen] * wB + b[i + j + halfLen] * wA;\n a[i + j] = uA + vA;\n b[i + j] = uB + vB;\n a[i + j + halfLen] = uA - vA;\n b[i + j + halfLen] = uB - vB;\n }\n }\n }\n if (inverse) {\n for (int i = 0; i < n; i++) {\n a[i] /= n;\n b[i] /= n;\n }\n }\n }\n\n }\n\n static class InputReader {\n final InputStream is;\n final byte[] buf = new byte[1024];\n int pos;\n int size;\n\n public InputReader(InputStream is) {\n this.is = is;\n }\n\n public int nextInt() {\n int c = read();\n while (isWhitespace(c))\n c = read();\n int sign = 1;\n if (c == '-') {\n sign = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res = res * 10 + c - '0';\n c = read();\n } while (!isWhitespace(c));\n return res * sign;\n }\n\n int read() {\n if (size == -1)\n throw new InputMismatchException();\n if (pos >= size) {\n pos = 0;\n try {\n size = is.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (size <= 0)\n return -1;\n }\n return buf[pos++] & 255;\n }\n\n static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["divide and conquer", "dp", "fft"], "code_uid": "837f7643425e6679661a5b7334013135", "src_uid": "279f1f7d250a4be6406c6c7bfc818bbf", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\npublic class G1096 {\n\tpublic static final int[] NTTPrimes = {1053818881, 1051721729, 1045430273, 1012924417, 1007681537, 1004535809, 998244353, 985661441, 976224257, 975175681};\n\tpublic static final int[] NTTPrimitiveRoots = {7, 6, 3, 5, 3, 3, 3, 3, 3, 17};\n//\tpublic static final int[] NTTPrimes = {1012924417, 1004535809, 998244353, 985661441, 975175681, 962592769, 950009857, 943718401, 935329793, 924844033};\n//\tpublic static final int[] NTTPrimitiveRoots = {5, 3, 3, 3, 17, 7, 7, 7, 3, 5};\n\n\tpublic static long[] convoluteSimply(long[] a, long[] b, int P, int g) {\n\t\tint m = Math.max(2, Integer.highestOneBit(Math.max(a.length, b.length) - 1) << 2);\n\t\tlong[] fa = nttmb(a, m, false, P, g);\n\t\tlong[] fb = a == b ? fa : nttmb(b, m, false, P, g);\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tfa[i] = fa[i] * fb[i] % P;\n\t\t}\n\t\treturn nttmb(fa, m, true, P, g);\n\t}\n\n\tpublic static long[] convolute(long[] a, long[] b) {\n\t\tint USE = 2;\n\t\tint m = Math.max(2, Integer.highestOneBit(Math.max(a.length, b.length) - 1) << 2);\n\t\tlong[][] fs = new long[USE][];\n\t\tfor (int k = 0; k < USE; k++) {\n\t\t\tint P = NTTPrimes[k], g = NTTPrimitiveRoots[k];\n\t\t\tlong[] fa = nttmb(a, m, false, P, g);\n\t\t\tlong[] fb = a == b ? fa : nttmb(b, m, false, P, g);\n\t\t\tfor (int i = 0; i < m; i++) {\n\t\t\t\tfa[i] = fa[i] * fb[i] % P;\n\t\t\t}\n\t\t\tfs[k] = nttmb(fa, m, true, P, g);\n\t\t}\n\n\t\tint[] mods = Arrays.copyOf(NTTPrimes, USE);\n\t\tlong[] gammas = garnerPrepare(mods);\n\t\tint[] buf = new int[USE];\n\t\tfor (int i = 0; i < fs[0].length; i++) {\n\t\t\tfor (int j = 0; j < USE; j++) {\n\t\t\t\tbuf[j] = (int) fs[j][i];\n\t\t\t}\n\t\t\tlong[] res = garnerBatch(buf, mods, gammas);\n\t\t\tlong ret = 0;\n\t\t\tfor (int j = res.length - 1; j >= 0; j--) {\n\t\t\t\tret = ret * mods[j] + res[j];\n\t\t\t}\n\t\t\tfs[0][i] = ret;\n\t\t}\n\t\treturn fs[0];\n\t}\n\n\tpublic static long[] convolute1(long[] a, long[] b) {\n\t\tint m = Math.max(2, Integer.highestOneBit(Math.max(a.length, b.length) - 1) << 2);\n\t\tint P = NTTPrimes[0], g = NTTPrimitiveRoots[0];\n\t\tlong[] fa = nttmb(a, m, false, P, g);\n\t\tlong[] fb = a == b ? fa : nttmb(b, m, false, P, g);\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tfa[i] = fa[i] * fb[i] % P;\n\t\t}\n\t\tlong[] f = nttmb(fa, m, true, P, g);\n\t\treturn f;\n\t}\n\tstatic long[] multiply(long a[],long b[],int mod)\n\t{\n\t\tlong v=mod;\n\t\tv*=mod;\n\t\tlong ans[]=new long[a.length+b.length-1];\n\t\tfor(int i=0;i<a.length;i++)\n\t\t\tfor(int j=0;j<b.length;j++)\n\t\t\t{\n\t\t\t\tans[i+j]+=a[i]*b[j];\n\t\t\t\tif(ans[i+j]>=v)\n\t\t\t\t\tans[i+j]-=v;\n\t\t\t}\n\t\tfor(int i=0;i<ans.length;i++)\n\t\t\tans[i]%=mod;\n\t\treturn ans;\n\t}\n\tpublic static long[] convolute(long[] a, long[] b, int USE, int mod) {\n\t\tif(a.length+b.length<=200)\n\t\t\treturn multiply(a,b,mod);\n\t\tint m = Math.max(2, Integer.highestOneBit(Math.max(a.length, b.length) - 1) << 2);\n\t\tlong[][] fs = new long[USE][];\n\t\tfor (int k = 0; k < USE; k++) {\n\t\t\tint P = NTTPrimes[k], g = NTTPrimitiveRoots[k];\n\t\t\tlong[] fa = nttmb(a, m, false, P, g);\n\t\t\tlong[] fb = a == b ? fa : nttmb(b, m, false, P, g);\n\t\t\tfor (int i = 0; i < m; i++) {\n\t\t\t\tfa[i] = fa[i] * fb[i] % P;\n\t\t\t}\n\t\t\tfs[k] = nttmb(fa, m, true, P, g);\n\t\t}\n\n\t\tint[] mods = Arrays.copyOf(NTTPrimes, USE);\n\t\tlong[] gammas = garnerPrepare(mods);\n\t\tint[] buf = new int[USE];\n\t\tfor (int i = 0; i < fs[0].length; i++) {\n\t\t\tfor (int j = 0; j < USE; j++) {\n\t\t\t\tbuf[j] = (int) fs[j][i];\n\t\t\t}\n\t\t\tlong[] res = garnerBatch(buf, mods, gammas);\n\t\t\tlong ret = 0;\n\t\t\tfor (int j = res.length - 1; j >= 0; j--) {\n\t\t\t\tret = (ret * mods[j] + res[j]) % mod;\n\t\t\t}\n\t\t\tfs[0][i] = ret;\n\t\t}\n\t\treturn fs[0];\n\t}\n\n\t// static int[] wws = new int[270000]; // outer faster\n\t// Modifed Montgomery + Barrett\n\tprivate static long[] nttmb(long[] src, int n, boolean inverse, int P, int g) {\n\t\tlong[] dst = Arrays.copyOf(src, n);\n\n\t\tint h = Integer.numberOfTrailingZeros(n);\n\t\tlong K = Integer.highestOneBit(P) << 1;\n\t\tint H = Long.numberOfTrailingZeros(K) * 2;\n\t\tlong M = K * K / P;\n\n\t\tint[] wws = new int[1 << h - 1];\n\t\tlong dw = inverse ? pow(g, P - 1 - (P - 1) / n, P) : pow(g, (P - 1) / n, P);\n\t\tlong w = (1L << 32) % P;\n\t\tfor (int k = 0; k < 1 << h - 1; k++) {\n\t\t\twws[k] = (int) w;\n\t\t\tw = modh(w * dw, M, H, P);\n\t\t}\n\t\tlong J = invl(P, 1L << 32);\n\t\tfor (int i = 0; i < h; i++) {\n\t\t\tfor (int j = 0; j < 1 << i; j++) {\n\t\t\t\tfor (int k = 0, s = j << h - i, t = s | 1 << h - i - 1; k < 1 << h - i - 1; k++, s++, t++) {\n\t\t\t\t\tlong u = (dst[s] - dst[t] + 2 * P) * wws[k];\n\t\t\t\t\tdst[s] += dst[t];\n\t\t\t\t\tif (dst[s] >= 2 * P) {\n\t\t\t\t\t\tdst[s] -= 2 * P;\n\t\t\t\t\t}\n//\t\t\t\t\tlong Q = (u&(1L<<32)-1)*J&(1L<<32)-1;\n\t\t\t\t\tlong Q = (u << 32) * J >>> 32;\n\t\t\t\t\tdst[t] = (u >>> 32) - (Q * P >>> 32) + P;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (i < h - 1) {\n\t\t\t\tfor (int k = 0; k < 1 << h - i - 2; k++) {\n\t\t\t\t\twws[k] = wws[k * 2];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (dst[i] >= P) {\n\t\t\t\tdst[i] -= P;\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint rev = Integer.reverse(i) >>> -h;\n\t\t\tif (i < rev) {\n\t\t\t\tlong d = dst[i];\n\t\t\t\tdst[i] = dst[rev];\n\t\t\t\tdst[rev] = d;\n\t\t\t}\n\t\t}\n\n\t\tif (inverse) {\n\t\t\tlong in = invl(n, P);\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tdst[i] = modh(dst[i] * in, M, H, P);\n\t\t\t}\n\t\t}\n\n\t\treturn dst;\n\t}\n\n\t// Modified Shoup + Barrett\n\tprivate static long[] nttsb(long[] src, int n, boolean inverse, int P, int g) {\n\t\tlong[] dst = Arrays.copyOf(src, n);\n\n\t\tint h = Integer.numberOfTrailingZeros(n);\n\t\tlong K = Integer.highestOneBit(P) << 1;\n\t\tint H = Long.numberOfTrailingZeros(K) * 2;\n\t\tlong M = K * K / P;\n\n\t\tlong dw = inverse ? pow(g, P - 1 - (P - 1) / n, P) : pow(g, (P - 1) / n, P);\n\t\tlong[] wws = new long[1 << h - 1];\n\t\tlong[] ws = new long[1 << h - 1];\n\t\tlong w = 1;\n\t\tfor (int k = 0; k < 1 << h - 1; k++) {\n\t\t\twws[k] = (w << 32) / P;\n\t\t\tws[k] = w;\n\t\t\tw = modh(w * dw, M, H, P);\n\t\t}\n\t\tfor (int i = 0; i < h; i++) {\n\t\t\tfor (int j = 0; j < 1 << i; j++) {\n\t\t\t\tfor (int k = 0, s = j << h - i, t = s | 1 << h - i - 1; k < 1 << h - i - 1; k++, s++, t++) {\n\t\t\t\t\tlong ndsts = dst[s] + dst[t];\n\t\t\t\t\tif (ndsts >= 2 * P) {\n\t\t\t\t\t\tndsts -= 2 * P;\n\t\t\t\t\t}\n\t\t\t\t\tlong T = dst[s] - dst[t] + 2 * P;\n\t\t\t\t\tlong Q = wws[k] * T >>> 32;\n\t\t\t\t\tdst[s] = ndsts;\n\t\t\t\t\tdst[t] = ws[k] * T - Q * P & (1L << 32) - 1;\n\t\t\t\t}\n\t\t\t}\n//\t\t\tdw = dw * dw % P;\n\t\t\tif (i < h - 1) {\n\t\t\t\tfor (int k = 0; k < 1 << h - i - 2; k++) {\n\t\t\t\t\twws[k] = wws[k * 2];\n\t\t\t\t\tws[k] = ws[k * 2];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (dst[i] >= P) {\n\t\t\t\tdst[i] -= P;\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint rev = Integer.reverse(i) >>> -h;\n\t\t\tif (i < rev) {\n\t\t\t\tlong d = dst[i];\n\t\t\t\tdst[i] = dst[rev];\n\t\t\t\tdst[rev] = d;\n\t\t\t}\n\t\t}\n\n\t\tif (inverse) {\n\t\t\tlong in = invl(n, P);\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tdst[i] = modh(dst[i] * in, M, H, P);\n\t\t\t}\n\t\t}\n\n\t\treturn dst;\n\t}\n\n\tstatic final long mask = (1L << 31) - 1;\n\n\tpublic static long modh(long a, long M, int h, int mod) {\n\t\tlong r = a - ((M * (a & mask) >>> 31) + M * (a >>> 31) >>> h - 31) * mod;\n\t\treturn r < mod ? r : r - mod;\n\t}\n\n\tprivate static long[] garnerPrepare(int[] m) {\n\t\tint n = m.length;\n\t\tassert n == m.length;\n\t\tif (n == 0) {\n\t\t\treturn new long[0];\n\t\t}\n\t\tlong[] gamma = new long[n];\n\t\tfor (int k = 1; k < n; k++) {\n\t\t\tlong prod = 1;\n\t\t\tfor (int i = 0; i < k; i++) {\n\t\t\t\tprod = prod * m[i] % m[k];\n\t\t\t}\n\t\t\tgamma[k] = invl(prod, m[k]);\n\t\t}\n\t\treturn gamma;\n\t}\n\n\tprivate static long[] garnerBatch(int[] u, int[] m, long[] gamma) {\n\t\tint n = u.length;\n\t\tassert n == m.length;\n\t\tlong[] v = new long[n];\n\t\tv[0] = u[0];\n\t\tfor (int k = 1; k < n; k++) {\n\t\t\tlong temp = v[k - 1];\n\t\t\tfor (int j = k - 2; j >= 0; j--) {\n\t\t\t\ttemp = (temp * m[j] + v[j]) % m[k];\n\t\t\t}\n\t\t\tv[k] = (u[k] - temp) * gamma[k] % m[k];\n\t\t\tif (v[k] < 0) {\n\t\t\t\tv[k] += m[k];\n\t\t\t}\n\t\t}\n\t\treturn v;\n\t}\n\n\tprivate static long pow(long a, long n, long mod) {\n\t\t//\t\ta %= mod;\n\t\tlong ret = 1;\n\t\tint x = 63 - Long.numberOfLeadingZeros(n);\n\t\tfor (; x >= 0; x--) {\n\t\t\tret = ret * ret % mod;\n\t\t\tif (n << 63 - x < 0) {\n\t\t\t\tret = ret * a % mod;\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n\n\tprivate static long invl(long a, long mod) {\n\t\tlong b = mod;\n\t\tlong p = 1, q = 0;\n\t\twhile (b > 0) {\n\t\t\tlong c = a / b;\n\t\t\tlong d;\n\t\t\td = a;\n\t\t\ta = b;\n\t\t\tb = d % b;\n\t\t\td = p;\n\t\t\tp = q;\n\t\t\tq = d - c * q;\n\t\t}\n\t\treturn p < 0 ? p + mod : p;\n\t}\n\tstatic class Scanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer tk = new StringTokenizer(\"\");\n\n\t\tpublic Scanner(InputStream is) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(is));\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {\n\t\t\tif (tk.hasMoreTokens())\n\t\t\t\treturn Integer.parseInt(tk.nextToken());\n\t\t\ttk = new StringTokenizer(br.readLine());\n\t\t\treturn nextInt();\n\t\t}\n\n\t\tpublic long nextLong() throws IOException {\n\t\t\tif (tk.hasMoreTokens())\n\t\t\t\treturn Long.parseLong(tk.nextToken());\n\t\t\ttk = new StringTokenizer(br.readLine());\n\t\t\treturn nextLong();\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\tif (tk.hasMoreTokens())\n\t\t\t\treturn (tk.nextToken());\n\t\t\ttk = new StringTokenizer(br.readLine());\n\t\t\treturn next();\n\t\t}\n\n\t\tpublic String nextLine() throws IOException {\n\t\t\ttk = new StringTokenizer(\"\");\n\t\t\treturn br.readLine();\n\t\t}\n\n\t\tpublic double nextDouble() throws IOException {\n\t\t\tif (tk.hasMoreTokens())\n\t\t\t\treturn Double.parseDouble(tk.nextToken());\n\t\t\ttk = new StringTokenizer(br.readLine());\n\t\t\treturn nextDouble();\n\t\t}\n\n\t\tpublic char nextChar() throws IOException {\n\t\t\tif (tk.hasMoreTokens())\n\t\t\t\treturn (tk.nextToken().charAt(0));\n\t\t\ttk = new StringTokenizer(br.readLine());\n\t\t\treturn nextChar();\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) throws IOException {\n\t\t\tint a[] = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) throws IOException {\n\t\t\tlong a[] = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic int[] nextIntArrayOneBased(int n) throws IOException {\n\t\t\tint a[] = new int[n + 1];\n\t\t\tfor (int i = 1; i <= n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic long[] nextLongArrayOneBased(int n) throws IOException {\n\t\t\tlong a[] = new long[n + 1];\n\t\t\tfor (int i = 1; i <= n; i++)\n\t\t\t\ta[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n\n\n\t}\n\n\tpublic static void main(String args[]) throws IOException {\n\t\tnew Thread(null, new Runnable() {\n\t\t\tpublic void run() {\n\t\t\t\ttry {\n\t\t\t\t\tsolve();\n\t\t\t\t} catch (Exception e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t}, \"1\", 1 << 26).start();\n\n\t}\n\n\tstatic void solve() throws IOException {\n\t\tScanner in = new Scanner(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tint n=in.nextInt()/2;\n\t\tlong b[]=new long[10];\n\t\tfor(int i=in.nextInt();i>0;i--)\n\t\t\tb[in.nextInt()]=1;\n\t\tlong mod=998244353;\n\t\tlong ans[]=new long[1];\n\t\tans[0]=1;\n\t\twhile(n>0){\n\t\t\tif((n&1)==1){\n\t\t\t\tans=convoluteSimply(ans,b,(int)mod,3);\n\t\t\t\tint sz=ans.length-1;\n\t\t\t\twhile(sz>0 && ans[sz]==0)\n\t\t\t\t\tsz--;\n\t\t\t\tif(ans.length-sz > 100)\n\t\t\t\t\tans=Arrays.copyOf(ans,sz+1);\n\t\t\t}\n\t\t\tn>>=1;\n\t\t\tb=convoluteSimply(b,b,(int)mod,3);\n\t\t\tint sz=b.length-1;\n\t\t\twhile(sz>0 && b[sz]==0)\n\t\t\t\tsz--;\n\t\t\tif(b.length-sz > 100)\n\t\t\t\tb=Arrays.copyOf(b,sz+1);\n\t\t}\n\t\tlong res=0;\n\t\tfor(int i=0;i<ans.length;i++){\n\t\t\tres+=(ans[i]*ans[i]);\n\t\t\tres%=mod;\n\t\t}\n\t\tout.println(res);\n\t\tout.close();\n\n\t}\n}\n", "lang_cluster": "Java", "tags": ["divide and conquer", "dp", "fft"], "code_uid": "27d9fa1fecc2252ea096e7398f2921ba", "src_uid": "279f1f7d250a4be6406c6c7bfc818bbf", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskG solver = new TaskG();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskG {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int mod = 998244353;\n int n = in.nextInt();\n int k = in.nextInt();\n int[] v = new int[10];\n for (int i = 0; i < k; i++) {\n int x = in.nextInt();\n v[x] = 1;\n }\n int[] ans = {1};\n int p = n / 2;\n while (true) {\n if (p % 2 != 0) {\n ans = multiplyMod(ans, v, mod);\n }\n p /= 2;\n if (p == 0) break;\n v = multiplyMod(v, v, mod);\n }\n int res = 0;\n for (int x : ans) {\n res = (int) ((res + (long) x * x) % mod);\n }\n out.println(res);\n }\n\n static int[] multiplyMod(int[] a, int[] b, int mod) {\n int need = a.length + b.length - 1;\n int n = Math.max(2, Integer.highestOneBit(need - 1) << 1);\n double[] aReal = new double[n];\n double[] aImaginary = new double[n];\n for (int i = 0; i < a.length; i++) {\n int x = (a[i] % mod + mod) % mod;\n aReal[i] = x & ((1 << 15) - 1);\n aImaginary[i] = x >> 15;\n }\n if (n == 524288) {\n\n int z = 1;\n }\n fft(aReal, aImaginary, false);\n\n double[] bReal = new double[n];\n double[] bImaginary = new double[n];\n if (a == b) {\n System.arraycopy(aReal, 0, bReal, 0, n);\n System.arraycopy(aImaginary, 0, bImaginary, 0, n);\n } else {\n for (int i = 0; i < b.length; i++) {\n int x = (b[i] % mod + mod) % mod;\n bReal[i] = x & ((1 << 15) - 1);\n bImaginary[i] = x >> 15;\n }\n fft(bReal, bImaginary, false);\n }\n\n double[] faReal = new double[n];\n double[] faImaginary = new double[n];\n double[] fbReal = new double[n];\n double[] fbImaginary = new double[n];\n\n double cf = 0.25 / n;\n for (int i = 0; i < n; i++) {\n int j = (n - i) & (n - 1);\n\n double a1r = (aReal[i] + aReal[j]);\n double a1i = (aImaginary[i] - aImaginary[j]);\n double a2r = (aImaginary[i] + aImaginary[j]);\n double a2i = (aReal[j] - aReal[i]);\n\n double b1r = (bReal[i] + bReal[j]) * cf;\n double b1i = (bImaginary[i] - bImaginary[j]) * cf;\n double b2r = (bImaginary[i] + bImaginary[j]) * cf;\n double b2i = (bReal[j] - bReal[i]) * cf;\n\n faReal[i] = a1r * b1r - a1i * b1i - a2r * b2i - a2i * b2r;\n faImaginary[i] = a1r * b1i + a1i * b1r + a2r * b2r - a2i * b2i;\n\n fbReal[i] = a1r * b2r - a1i * b2i + a2r * b1r - a2i * b1i;\n fbImaginary[i] = a1r * b2i + a1i * b2r + a2r * b1i + a2i * b1r;\n }\n\n fft(faReal, faImaginary, true);\n fft(fbReal, fbImaginary, true);\n int[] res = new int[need];\n for (int i = 0; i < need; i++) {\n long aa = (long) (faReal[i] + 0.5);\n long bb = (long) (fbReal[i] + 0.5);\n long cc = (long) (faImaginary[i] + 0.5);\n res[i] = (int) ((aa + ((bb % mod) << 15) + ((cc % mod) << 30)) % mod);\n }\n if (need + 1 < n && Math.abs(faReal[need + 1]) > 0.5) {\n int z = 1;\n }\n return res;\n }\n\n static void fft(double[] a, double[] b, boolean inverse) {\n int n = a.length;\n int shift = 32 - Integer.numberOfTrailingZeros(n);\n for (int i = 1; i < n; i++) {\n int j = Integer.reverse(i << shift);\n if (i < j) {\n double temp = a[i];\n a[i] = a[j];\n a[j] = temp;\n temp = b[i];\n b[i] = b[j];\n b[j] = temp;\n }\n }\n for (int len = 2; len <= n; len <<= 1) {\n int halfLen = len >> 1;\n double[] cs = new double[halfLen];\n double[] sn = new double[halfLen];\n for (int i = 0; i < halfLen; i++) {\n cs[i] = Math.cos(2 * Math.PI * i / len * (inverse ? -1 : 1));\n sn[i] = Math.sin(2 * Math.PI * i / len * (inverse ? -1 : 1));\n }\n for (int i = 0; i < n; i += len) {\n for (int j = 0; j < halfLen; j++) {\n double wA = cs[j];\n double wB = sn[j];\n\n double uA = a[i + j];\n double uB = b[i + j];\n double vA = a[i + j + halfLen] * wA - b[i + j + halfLen] * wB;\n double vB = a[i + j + halfLen] * wB + b[i + j + halfLen] * wA;\n a[i + j] = uA + vA;\n b[i + j] = uB + vB;\n a[i + j + halfLen] = uA - vA;\n b[i + j + halfLen] = uB - vB;\n }\n }\n }\n// if (inverse) {\n// for (int i = 0; i < n; i++) {\n// a[i] /= n;\n// b[i] /= n;\n// }\n// }\n }\n\n }\n\n static class InputReader {\n final InputStream is;\n final byte[] buf = new byte[1024];\n int pos;\n int size;\n\n public InputReader(InputStream is) {\n this.is = is;\n }\n\n public int nextInt() {\n int c = read();\n while (isWhitespace(c))\n c = read();\n int sign = 1;\n if (c == '-') {\n sign = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res = res * 10 + c - '0';\n c = read();\n } while (!isWhitespace(c));\n return res * sign;\n }\n\n int read() {\n if (size == -1)\n throw new InputMismatchException();\n if (pos >= size) {\n pos = 0;\n try {\n size = is.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (size <= 0)\n return -1;\n }\n return buf[pos++] & 255;\n }\n\n static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["divide and conquer", "dp", "fft"], "code_uid": "37caea57a412c30200c6c6a2db116d45", "src_uid": "279f1f7d250a4be6406c6c7bfc818bbf", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.Arrays;\nimport java.util.Scanner;\n\n/*\n * To change this license header, choose License Headers in Project Properties.\n * To change this template file, choose Tools | Templates\n * and open the template in the editor.\n */\n\n/**\n *\n * @author Andy Phan\n */\npublic class p1096g {\n static long MOD = 998244353;\n \n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int n = in.nextInt();\n int k = in.nextInt();\n long[] base = new long[10];\n for(int i = 0; i < k; i++) base[in.nextInt()] = 1;\n long[] res = expo(base, n>>1);\n long tot = 0;\n for(long e : res) tot = (tot+(e*e)%MOD)%MOD;\n System.out.println(tot);\n }\n \n static long[] expo(long[] orig, long pow) {\n if(pow == 1) return orig;\n if((pow&1) != 0) return FFT.multiplyPrecise(orig, expo(orig, pow-1));\n long[] tmp = expo(orig, pow>>1);\n return FFT.multiplyPrecise(tmp, tmp);\n }\n \n // SET maxk appropriately!!! ~log(maxn) //%\n static class FFT {\n static final int maxk = 21, maxn = (1 << maxk) + 1;\n // Init: wR, wI, rR, rI, aR, aI to new double[maxn] !!!\n //#\n static double[] wR = new double[maxn],\n wI = new double[maxn],\n rR = new double[maxn],\n rI = new double[maxn],\n aR = new double[maxn],\n aI = new double[maxn]; //$\n static int n, k, lastk = -1, dp[] = new int[maxn];\n\n static void fft(boolean inv) {\n if (lastk != k) {\n lastk = k; dp[0] = 0;\n for (int i = 1, g = -1; i < n; i++) {\n if ((i & (i - 1)) == 0) g++;\n dp[i] = dp[i ^ (1 << g)] ^ (1 << (k - 1 - g));\n }\n wR[1] = 1;\n wI[1] = 0;\n for (int t = 0; t < k - 1; t++) {\n double a = Math.PI / n * (1 << (k - 1 - t));\n double curR = Math.cos(a), curI = Math.sin(a);\n int p2 = (1 << t), p3 = p2 * 2;\n for (int j = p2, k = j * 2; j < p3; j++, k += 2) {\n wR[k] = wR[j];\n wI[k] = wI[j];\n wR[k + 1] = wR[j] * curR - wI[j] * curI;\n wI[k + 1] = wR[j] * curI + wI[j] * curR;\n }\n }\n }\n for (int i = 0; i < n; i++) {\n int d = dp[i];\n if (i < d) {\n double tmp = aR[i];\n aR[i] = aR[d];\n aR[d] = tmp;\n tmp = aI[i];\n aI[i] = aI[d];\n aI[d] = tmp;\n }\n }\n if (inv) for (int i = 0; i < n; i++) aI[i] = -aI[i];\n for (int len = 1; len < n; len <<= 1) {\n for (int i = 0; i < n; i += len) {\n int wit = len;\n for (int it = 0, j = i + len; it < len; it++, i++, j++) {\n double tmpR = aR[j] * wR[wit] - aI[j] * wI[wit];\n double tmpI = aR[j] * wI[wit] + aI[j] * wR[wit];\n wit++;\n aR[j] = aR[i] - tmpR;\n aI[j] = aI[i] - tmpI;\n aR[i] += tmpR;\n aI[i] += tmpI;\n }\n }\n }\n }\n\n static long[] multiply(long[] a, long[] b) {\n int na = a.length, nb = b.length;\n for (k = 0, n = 1; n < na + nb - 1; n <<= 1, k++) {}\n for (int i = 0; i < n; ++i) {\n aR[i] = i < na ? a[i] : 0;\n aI[i] = i < nb ? b[i] : 0;\n }\n fft(false);\n aR[n] = aR[0];\n aI[n] = aI[0];\n double q = -1.0 / n / 4.0;\n for (int i = 0; i <= n - i; ++i) {\n double tmpR = aR[i] * aR[i] - aI[i] * aI[i];\n double tmpI = aR[i] * aI[i] * 2;\n tmpR -= aR[n - i] * aR[n - i] - aI[n - i] * aI[n - i];\n tmpI -= aR[n - i] * aI[n - i] * -2;\n aR[i] = -tmpI * q;\n aI[i] = tmpR * q;\n aR[n - i] = aR[i];\n aI[n - i] = -aI[i];\n }\n fft(true);\n long[] ans = new long[n = na + nb - 1]; // ONLY MOD IF NEEDED\n for (int i = 0; i < n; i++) ans[i] = Math.round(aR[i]) % MOD;\n return ans;\n }\n static void fft2(double[][] xr, double[][] xi, boolean inv) {\n n = xr[0].length;\n k = Integer.numberOfTrailingZeros(n);\n for (int i = 0; i < xr.length; i++) {\n for (int j = 0; j < n; j++) { aR[j] = xr[i][j]; aI[j] = xi[i][j]; }\n fft(inv);\n for (int j=0;j<n;j++){xr[i][j] = aR[j] / (inv ? n : 1); xi[i][j] = aI[j] / (inv ? -n : 1);}\n }\n n = xr.length;\n k = Integer.numberOfTrailingZeros(n);\n for (int j = 0; j < xr[0].length; j++) {\n for (int i = 0; i < n; i++) { aR[i] = xr[i][j]; aI[i] = xi[i][j]; }\n fft(inv);\n for (int i=0;i<n;i++){xr[i][j] = aR[i] / (inv ? n : 1); xi[i][j] = aI[i] / (inv ? -n : 1);}\n }\n }\n static long[][] multiply2(long[][] a, long[][] b) {\n int n1, n2;\n for (n1 = 1; n1 < a.length + b.length - 1; n1 <<= 1) {}\n for (n2 = 1; n2 < a[0].length + b[0].length - 1; n2 <<= 1) {}\n double[][] ar = new double[n1][n2], ai = new double[n1][n2];\n double[][] br = new double[n1][n2], bi = new double[n1][n2];\n for (int i = 0; i < a.length; i++) for(int j=0;j<a[i].length;j++) ar[i][j] = a[i][j];\n for (int i = 0; i < b.length; i++) for(int j=0;j<b[i].length;j++) br[i][j] = b[i][j];\n fft2(ar,ai,false); fft2(br,bi,false);\n for (int i = 0; i < n1; i++) {\n for(int j = 0; j < n2; j++) {\n double r1 = ar[i][j], r2 = br[i][j];\n double i1 = ai[i][j], i2 = bi[i][j];\n double real = r1 * r2 - i1 * i2;\n ai[i][j] = i1 * r2+ i2*r1;\n ar[i][j] = real;\n }\n }\n fft2(ar,ai,true); long[][] result = new long[n1=a.length+b.length-1][n2=a[0].length+b[0].length-1];\n for (int i = 0; i < n1; i++)\n for(int j = 0; j < n2; j++) result[i][j] = Math.round(ar[i][j]);\n return result;\n }\n //#\n static long[] multiplyPrecise(long[] a, long[] b) {\n long k = (long)(Math.sqrt(MOD));\n long[] a1 = new long[a.length], a2 = new long[a.length];\n long[] b1 = new long[b.length], b2 = new long[b.length];\n for(int i=0;i<a.length;i++) {\n a1[i] = a[i] % k;\n a2[i] = a[i] / k;\n }\n for(int i=0;i<b.length;i++) {\n b1[i] = b[i] % k;\n b2[i] = b[i] / k;\n }\n long[] r11 = multiply(a1, b1), r12 = multiply(a1, b2), r21 = multiply(a2, b1), r22 = multiply(a2, b2);\n long[] res = new long[r11.length];\n for(int i=0;i<res.length;i++)\n res[i] = (k*k*r22[i] + k*(r12[i] + r21[i]) + r11[i]) % MOD;\n return res;\n }\n //$\n //#\n static long[] multiplyOr(long[] eq1, long[] eq2) {\n int n = Math.max(eq1.length, eq2.length);\n if((n & (n-1)) != 0)\n n = Integer.highestOneBit(n)*2;\n eq1 = fftOr(eq1, n, false);\n eq2 = fftOr(eq2, n, false);\n for(int i=0;i<eq1.length;i++)\n eq1[i] *= eq2[i];\n eq1 = fftOr(eq1, n, true);\n return eq1;\n }\n //$\n // To use: FFT both, product, iFFT (n is next power of 2)\n static long[] fftOr(long[] arr, int n, boolean invert) {\n long[] ans = Arrays.copyOf(arr, n);\n for (int b = 1; b < n; b <<= 1)\n for (int i = 0; i < n; i++) {\n if ((i & b) != 0) continue;\n ans[i + b] += invert ? -ans[i] : ans[i];\n }\n return ans;\n }\n static long[] fftXor(long[] arr, int n, boolean invert) {\n long[] ans = Arrays.copyOf(arr, n);\n for (int b = 1; b < n; b <<= 1)\n for (int i = 0; i < n; i++) {\n if((i & b) != 0) continue;\n long u = ans[i], v = ans[i+b];\n ans[i] = u + v; ans[i + b] = u - v;\n }\n if (invert) for (int i = 0; i < n; i++) ans[i] /= n;\n return ans;\n }\n }\n\n}\n", "lang_cluster": "Java", "tags": ["divide and conquer", "dp", "fft"], "code_uid": "1c82a64d984d1d9cdb1a279ac3152c49", "src_uid": "279f1f7d250a4be6406c6c7bfc818bbf", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n LuckyTickets solver = new LuckyTickets();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class LuckyTickets {\n int MOD = 998244353;\n static long mask = (1L << 31) - 1;\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int N = in.nextInt();\n int k = in.nextInt();\n long[] dig = new long[11];\n for (int i = 0; i < k; i++) {\n dig[10 - in.nextInt()] = 1;\n }\n int power = N / 2;\n long[] res = new long[1];\n res[0] = 1;\n while (power > 0) {\n if (((power & 1) > 0)) {\n res = convoluteSimply(res.clone(), dig.clone(), MOD, 3);\n }\n dig = convoluteSimply(dig.clone(), dig.clone(), MOD, 3);\n power >>= 1;\n }\n long output = 0;\n for (int i = 0; i < res.length; i++) {\n output += res[i] * res[i];\n output %= 998244353;\n }\n out.println(output);\n }\n\n public static long[] convoluteSimply(long[] a, long[] b, int P, int g) {\n int m = Math.max(2, Integer.highestOneBit(Math.max(a.length, b.length) - 1) << 2);\n long[] fa = nttmb(a, m, false, P, g);\n long[] fb = a == b ? fa : nttmb(b, m, false, P, g);\n for (int i = 0; i < m; i++) {\n fa[i] = fa[i] * fb[i] % P;\n }\n return nttmb(fa, m, true, P, g);\n }\n\n private static long[] nttmb(long[] src, int n, boolean inverse, int P, int g) {\n long[] dst = Arrays.copyOf(src, n);\n\n int h = Integer.numberOfTrailingZeros(n);\n long K = Integer.highestOneBit(P) << 1;\n int H = Long.numberOfTrailingZeros(K) * 2;\n long M = K * K / P;\n\n int[] wws = new int[1 << h - 1];\n long dw = inverse ? pow(g, P - 1 - (P - 1) / n, P) : pow(g, (P - 1) / n, P);\n long w = (1L << 32) % P;\n for (int k = 0; k < 1 << h - 1; k++) {\n wws[k] = (int) w;\n w = modh(w * dw, M, H, P);\n }\n long J = invl(P, 1L << 32);\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < 1 << i; j++) {\n for (int k = 0, s = j << h - i, t = s | 1 << h - i - 1; k < 1 << h - i - 1; k++, s++, t++) {\n long u = (dst[s] - dst[t] + 2 * P) * wws[k];\n dst[s] += dst[t];\n if (dst[s] >= 2 * P) dst[s] -= 2 * P;\n//\t\t\t\t\tlong Q = (u&(1L<<32)-1)*J&(1L<<32)-1;\n long Q = (u << 32) * J >>> 32;\n dst[t] = (u >>> 32) - (Q * P >>> 32) + P;\n }\n }\n if (i < h - 1) {\n for (int k = 0; k < 1 << h - i - 2; k++) wws[k] = wws[k * 2];\n }\n }\n for (int i = 0; i < n; i++) {\n if (dst[i] >= P) dst[i] -= P;\n }\n for (int i = 0; i < n; i++) {\n int rev = Integer.reverse(i) >>> -h;\n if (i < rev) {\n long d = dst[i];\n dst[i] = dst[rev];\n dst[rev] = d;\n }\n }\n\n if (inverse) {\n long in = invl(n, P);\n for (int i = 0; i < n; i++) dst[i] = modh(dst[i] * in, M, H, P);\n }\n\n return dst;\n }\n\n public static long modh(long a, long M, int h, int mod) {\n long r = a - ((M * (a & mask) >>> 31) + M * (a >>> 31) >>> h - 31) * mod;\n return r < mod ? r : r - mod;\n }\n\n private static long pow(long a, long n, long mod) {\n //\t\ta %= mod;\n long ret = 1;\n int x = 63 - Long.numberOfLeadingZeros(n);\n for (; x >= 0; x--) {\n ret = ret * ret % mod;\n if (n << 63 - x < 0)\n ret = ret * a % mod;\n }\n return ret;\n }\n\n private static long invl(long a, long mod) {\n long b = mod;\n long p = 1, q = 0;\n while (b > 0) {\n long c = a / b;\n long d;\n d = a;\n a = b;\n b = d % b;\n d = p;\n p = q;\n q = d - c * q;\n }\n return p < 0 ? p + mod : p;\n }\n\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["divide and conquer", "dp", "fft"], "code_uid": "aee0f4e44cbfb10d9c8ab94a83678a8f", "src_uid": "279f1f7d250a4be6406c6c7bfc818bbf", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.*;\n\nimport javax.swing.Painter;\n\nimport java.io.*;\nimport java.lang.reflect.Array;\nimport java.math.*;\n\n\npublic class Main {\n\t\n\tstatic int mod = 998244353;\n\tstatic int g = 3;\n\t\n\tstatic long qpow(long a, long n) {\n\t\tlong x = 1;\n\t\ta %= mod;\n\t\twhile(n > 0) {\n\t\t\tif((n & 1) == 1) x = x * a % mod;\n\t\t\ta = a * a % mod; n >>= 1;\n\t\t}\n\t\treturn x;\n\t}\n\t\n\tstatic void rader(long[] y, int len) {\n\t\tfor(int i = 1, j = len / 2; i < len - 1; i++) {\n\t\t\tif(i < j) { long tmp = y[i]; y[i] = y[j]; y[j] = tmp; }\n\t\t\tint k = len / 2;\n\t\t\twhile(j >= k) { j -= k; k /= 2; }\n\t\t\tif(j < k) j += k;\n\t\t}\n\t}\n\t\n\tstatic void NTT(long[] y, int len, int on) {\n\t\trader(y, len);\n\t\tfor(int h = 2; h <= len; h <<= 1) {\n\t\t\tlong wn = qpow(g, (mod-1)/h);\n\t\t\tif(on == -1) wn = qpow(wn, mod-2);\n\t\t\tfor(int j = 0; j < len; j += h) {\n\t\t\t\tlong w = 1;\n\t\t\t\tfor(int k = j; k < j + h / 2; k++) {\n\t\t\t\t\tlong u = y[k];\n\t\t\t\t\tlong t = w * y[k + h / 2] % mod;\n\t\t\t\t\ty[k] = (u + t) % mod;\n\t\t\t\t\ty[k+h/2] = (u - t + mod) % mod;\n\t\t\t\t\tw = w * wn % mod;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(on == -1) {\n\t\t\tlong t = qpow(len, mod - 2);\n\t\t\tfor(int i = 0; i < len; i++)\n\t\t\t\ty[i] = y[i] * t % mod;\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) throws IOException {\n\t\tFastScanner in = new FastScanner(new InputStreamReader(System.in));\n\t\tPrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));\n\t\t\n\t\tint n = in.nextInt(), m = in.nextInt();\n\t\tint len = 1, nn = n / 2;\n\t\twhile(len < (9 * nn + 1)) len <<= 1;\n\t\tlong[] a = new long[len];\n\t\t\n\t\tfor(int i = 0; i < m; i++) {\n\t\t\tint x = in.nextInt();\n\t\t\ta[x] = 1;\n\t\t}\n\t\t\n\t\tNTT(a, len, 1);\n\t\t\n\t\tfor(int i = 0; i < len; i++) if(a[i] != 0) {\n\t\t\ta[i] = qpow(a[i], nn) % mod;\t\n\t\t}\n\t\t\n\t\tNTT(a, len, -1);\n\t\t\n\t\tlong ans = 0;\n\t\tfor(int i = 0; i < len; i++)\n\t\t\tans = (ans + a[i] * a[i]) % mod;\n\t\t\n\t\tout.println((ans + mod) % mod);\n\t\t\n\t\tout.close();\n }\n\t\n\tstatic class FastScanner {\n\t\tprivate StringTokenizer ST;\n\t\tprivate BufferedReader BR;\n\t\tprivate PrintWriter PW;\n\n\t\tpublic FastScanner(InputStreamReader stream) {\n\t\t\tBR = new BufferedReader(stream);\n\t\t}\n\n\t\tpublic String next() {\n\t\t\twhile (ST == null || !ST.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\tST = new StringTokenizer(BR.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn ST.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\t\n\t\tpublic long nextLong() {\n\t return Long.parseLong(next());\n\t }\n\n\t\tpublic double nextDouble() {\n\t return Double.parseDouble(next());\n\t }\n\n\t}\n}\n\n\n\n", "lang_cluster": "Java", "tags": ["divide and conquer", "dp", "fft"], "code_uid": "9ba2b788c92eb965eb0f0216ea5ccc37", "src_uid": "279f1f7d250a4be6406c6c7bfc818bbf", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.FilterInputStream;\nimport java.io.BufferedInputStream;\nimport java.io.InputStream;\n\n/**\n * @author khokharnikunj8\n */\n\npublic class Main {\n public static void main(String[] args) {\n new Thread(null, new Runnable() {\n public void run() {\n new Main().solve();\n }\n }, \"1\", 1 << 26).start();\n }\n\n void solve() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n ScanReader in = new ScanReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n GLuckyTickets solver = new GLuckyTickets();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class GLuckyTickets {\n public int mod = 998244353;\n int[] d;\n\n public void solve(int testNumber, ScanReader in, PrintWriter out) {\n int n = in.scanInt();\n int k = in.scanInt();\n d = new int[k];\n in.scanInt(d, k);\n long[] way = new long[10];\n for (int i : d) way[i]++;\n long ans = 0;\n long[] dp = null;\n n /= 2;\n while (n > 0) {\n if ((n & 1) == 1) {\n if (dp == null) dp = Arrays.copyOf(way, way.length);\n else {\n long[] dp1 = Arrays.copyOf(dp, dp.length);\n dp = FFT.convoluteSimply(dp1, way, mod, 3);\n }\n }\n n >>= 1;\n way = FFT.convoluteSimply(way, way, mod, 3);\n }\n for (int i = 0; i < dp.length; i++) ans = (ans + dp[i] * dp[i]) % mod;\n out.println(ans);\n }\n\n }\n\n static class CodeHash {\n public static long pow(long a, long b, long m) {\n long res = 1;\n a %= m;\n while (b > 0) {\n if ((b & 1) == 1) res = (res * a) % m;\n a = (a * a) % m;\n b >>= 1;\n }\n return res;\n }\n\n }\n\n static class FFT {\n public static long[] convoluteSimply(long[] a, long[] b, int P, int g) {\n int m = Math.max(2, Integer.highestOneBit(Math.max(a.length, b.length) - 1) << 2);\n long[] fa = nttmb(a, m, false, P, g);\n long[] fb = a == b ? fa : nttmb(b, m, false, P, g);\n for (int i = 0; i < m; i++) {\n fa[i] = fa[i] * fb[i] % P;\n }\n return nttmb(fa, m, true, P, g);\n }\n\n private static long invl(long a, long mod) {\n long b = mod;\n long p = 1, q = 0;\n while (b > 0) {\n long c = a / b;\n long d;\n d = a;\n a = b;\n b = d % b;\n d = p;\n p = q;\n q = d - c * q;\n }\n return p < 0 ? p + mod : p;\n }\n\n private static long[] nttmb(long[] src, int n, boolean inverse, int P, int g) {\n long[] dst = Arrays.copyOf(src, n);\n\n int h = Integer.numberOfTrailingZeros(n);\n long K = Integer.highestOneBit(P) << 1;\n int H = Long.numberOfTrailingZeros(K) * 2;\n long M = K * K / P;\n\n int[] wws = new int[1 << h - 1];\n long dw = inverse ? CodeHash.pow(g, P - 1 - (P - 1) / n, P) : CodeHash.pow(g, (P - 1) / n, P);\n long w = (1L << 32) % P;\n for (int k = 0; k < 1 << h - 1; k++) {\n wws[k] = (int) w;\n w = modh(w * dw, M, H, P);\n }\n long J = invl(P, 1L << 32);\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < 1 << i; j++) {\n for (int k = 0, s = j << h - i, t = s | 1 << h - i - 1; k < 1 << h - i - 1; k++, s++, t++) {\n long u = (dst[s] - dst[t] + 2 * P) * wws[k];\n dst[s] += dst[t];\n if (dst[s] >= 2 * P) dst[s] -= 2 * P;\n//\t\t\t\t\tlong Q = (u&(1L<<32)-1)*J&(1L<<32)-1;\n long Q = (u << 32) * J >>> 32;\n dst[t] = (u >>> 32) - (Q * P >>> 32) + P;\n }\n }\n if (i < h - 1) {\n for (int k = 0; k < 1 << h - i - 2; k++) wws[k] = wws[k * 2];\n }\n }\n for (int i = 0; i < n; i++) {\n if (dst[i] >= P) dst[i] -= P;\n }\n for (int i = 0; i < n; i++) {\n int rev = Integer.reverse(i) >>> -h;\n if (i < rev) {\n long d = dst[i];\n dst[i] = dst[rev];\n dst[rev] = d;\n }\n }\n\n if (inverse) {\n long in = invl(n, P);\n for (int i = 0; i < n; i++) dst[i] = modh(dst[i] * in, M, H, P);\n }\n\n return dst;\n }\n\n public static long modh(long a, long M, int h, int mod) {\n long r = a - ((M * (a & ((1L << 31) - 1)) >>> 31) + M * (a >>> 31) >>> h - 31) * mod;\n return r < mod ? r : r - mod;\n }\n\n }\n\n static class ScanReader {\n private byte[] buf = new byte[4 * 1024];\n private int index;\n private BufferedInputStream in;\n private int total;\n\n public ScanReader(InputStream inputStream) {\n in = new BufferedInputStream(inputStream);\n }\n\n private int scan() {\n if (index >= total) {\n index = 0;\n try {\n total = in.read(buf);\n } catch (Exception e) {\n e.printStackTrace();\n }\n if (total <= 0) return -1;\n }\n return buf[index++];\n }\n\n public int scanInt() {\n int integer = 0;\n int n = scan();\n while (isWhiteSpace(n)) n = scan();\n int neg = 1;\n if (n == '-') {\n neg = -1;\n n = scan();\n }\n while (!isWhiteSpace(n)) {\n if (n >= '0' && n <= '9') {\n integer *= 10;\n integer += n - '0';\n n = scan();\n }\n }\n return neg * integer;\n }\n\n private boolean isWhiteSpace(int n) {\n if (n == ' ' || n == '\\n' || n == '\\r' || n == '\\t' || n == -1) return true;\n else return false;\n }\n\n public void scanInt(int[] A, int size) {\n for (int i = 0; i < size; i++) A[i] = scanInt();\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["divide and conquer", "dp", "fft"], "code_uid": "8621ee2d21fc1104105f9b742938021e", "src_uid": "279f1f7d250a4be6406c6c7bfc818bbf", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.util.stream.IntStream;\nimport java.util.Arrays;\nimport java.util.PriorityQueue;\nimport java.util.AbstractQueue;\nimport java.util.HashMap;\nimport java.util.Random;\nimport java.util.Deque;\nimport java.util.function.Supplier;\nimport java.util.ArrayList;\nimport java.util.Map;\nimport java.io.OutputStreamWriter;\nimport java.io.OutputStream;\nimport java.util.Collection;\nimport java.io.IOException;\nimport java.io.UncheckedIOException;\nimport java.util.function.Consumer;\nimport java.util.List;\nimport java.util.stream.Stream;\nimport java.io.Closeable;\nimport java.io.Writer;\nimport java.util.ArrayDeque;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) throws Exception {\n Thread thread = new Thread(null, new TaskAdapter(), \"\", 1 << 27);\n thread.start();\n thread.join();\n }\n\n static class TaskAdapter implements Runnable {\n @Override\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastInput in = new FastInput(inputStream);\n FastOutput out = new FastOutput(outputStream);\n TaskG solver = new TaskG();\n solver.solve(1, in, out);\n out.close();\n }\n }\n\n static class TaskG {\n Modular mod = new Modular(998244353);\n\n public void solve(int testNumber, FastInput in, FastOutput out) {\n int n = in.readInt();\n int k = in.readInt();\n int[] allow = new int[10];\n for (int i = 0; i < k; i++) {\n allow[in.readInt()] = 1;\n }\n IntList p = new IntList();\n p.addAll(allow);\n\n int m = n / 2;\n IntList last = p.clone();\n NumberTheoryTransform ntt = new NumberTheoryTransform(mod, 3);\n List<IntList> lists = new ArrayList<>();\n while (m > 1) {\n if (m % 2 == 1) {\n lists.add(last.clone());\n }\n ntt.pow2(last);\n Polynomials.normalize(last);\n m /= 2;\n }\n lists.add(last);\n\n IntList prod = new IntList();\n ntt.mulByPQ(lists.toArray(new IntList[0]), prod);\n\n int ans = 0;\n for (int i = 0; i < prod.size(); i++) {\n int plus = prod.get(i);\n ans = mod.plus(ans, mod.mul(plus, plus));\n }\n\n out.println(ans);\n }\n\n }\n\n static class PrimitiveRoot {\n private int[] factors;\n private Modular mod;\n private Power pow;\n int phi;\n private static PollardRho rho = new PollardRho();\n\n public PrimitiveRoot(Modular x) {\n phi = x.getMod() - 1;\n mod = x;\n pow = new Power(mod);\n factors = rho.findAllFactors(phi).keySet().stream().mapToInt(Integer::intValue).toArray();\n }\n\n public PrimitiveRoot(int x) {\n this(new Modular(x));\n }\n\n public int findMinPrimitiveRoot() {\n return findMinPrimitiveRoot(2);\n }\n\n public int findMinPrimitiveRoot(int since) {\n for (int i = since; i < mod.m; i++) {\n boolean flag = true;\n for (int f : factors) {\n if (pow.pow(i, phi / f) == 1) {\n flag = false;\n break;\n }\n }\n if (flag) {\n return i;\n }\n }\n return -1;\n }\n\n }\n\n static class PollardRho {\n MillerRabin mr = new MillerRabin();\n Random random = new Random();\n\n public int findFactor(int n) {\n if (mr.mr(n, 10)) {\n return n;\n }\n while (true) {\n int f = findFactor0(random.nextInt(n), random.nextInt(n), n);\n if (f != -1) {\n return f;\n }\n }\n }\n\n public Map<Integer, Integer> findAllFactors(int n) {\n Map<Integer, Integer> map = new HashMap();\n findAllFactors(map, n);\n return map;\n }\n\n private void findAllFactors(Map<Integer, Integer> map, int n) {\n if (n == 1) {\n return;\n }\n int f = findFactor(n);\n if (f == n) {\n Integer value = map.get(f);\n if (value == null) {\n value = 1;\n }\n map.put(f, value * f);\n return;\n }\n findAllFactors(map, f);\n findAllFactors(map, n / f);\n }\n\n private int findFactor0(int x, int c, int n) {\n int xi = x;\n int xj = x;\n int j = 2;\n int i = 1;\n while (i < n) {\n i++;\n xi = (int) ((long) xi * xi + c) % n;\n int g = GCDs.gcd(n, Math.abs(xi - xj));\n if (g != 1 && g != n) {\n return g;\n }\n if (i == j) {\n j = j << 1;\n xj = xi;\n }\n }\n return -1;\n }\n\n }\n\n static class MillerRabin {\n Modular modular;\n Power power;\n Random random = new Random();\n\n public boolean mr(int n, int s) {\n if (n == 2) {\n return true;\n }\n if (n % 2 == 0) {\n return false;\n }\n modular = new Modular(n);\n power = new Power(modular);\n for (int i = 0; i < s; i++) {\n int x = random.nextInt(n - 2) + 2;\n if (!mr0(x, n)) {\n return false;\n }\n }\n return true;\n }\n\n private boolean mr0(int x, int n) {\n int exp = n - 1;\n while (true) {\n int y = power.pow(x, exp);\n if (y != 1 && y != n - 1) {\n return false;\n }\n if (y != 1 || exp % 2 == 1) {\n break;\n }\n exp = exp / 2;\n }\n return true;\n }\n\n }\n\n static class IntList implements Cloneable {\n private int size;\n private int cap;\n private int[] data;\n private static final int[] EMPTY = new int[0];\n\n public int[] getData() {\n return data;\n }\n\n public IntList(int cap) {\n this.cap = cap;\n if (cap == 0) {\n data = EMPTY;\n } else {\n data = new int[cap];\n }\n }\n\n public IntList(IntList list) {\n this.size = list.size;\n this.cap = list.cap;\n this.data = Arrays.copyOf(list.data, size);\n }\n\n public IntList() {\n this(0);\n }\n\n public void ensureSpace(int req) {\n if (req > cap) {\n while (cap < req) {\n cap = Math.max(cap + 10, 2 * cap);\n }\n data = Arrays.copyOf(data, cap);\n }\n }\n\n private void checkRange(int i) {\n if (i < 0 || i >= size) {\n throw new ArrayIndexOutOfBoundsException();\n }\n }\n\n public int get(int i) {\n checkRange(i);\n return data[i];\n }\n\n public void addAll(int[] x) {\n addAll(x, 0, x.length);\n }\n\n public void addAll(int[] x, int offset, int len) {\n ensureSpace(size + len);\n System.arraycopy(x, offset, data, size, len);\n size += len;\n }\n\n public void addAll(IntList list) {\n addAll(list.data, 0, list.size);\n }\n\n public void expandWith(int x, int len) {\n ensureSpace(len);\n while (size < len) {\n data[size++] = x;\n }\n }\n\n public void retain(int n) {\n if (n < 0) {\n throw new IllegalArgumentException();\n }\n if (n >= size) {\n return;\n }\n size = n;\n }\n\n public int size() {\n return size;\n }\n\n public int[] toArray() {\n return Arrays.copyOf(data, size);\n }\n\n public void clear() {\n size = 0;\n }\n\n public String toString() {\n return Arrays.toString(toArray());\n }\n\n public boolean equals(Object obj) {\n if (!(obj instanceof IntList)) {\n return false;\n }\n IntList other = (IntList) obj;\n return SequenceUtils.equal(data, 0, size - 1, other.data, 0, other.size - 1);\n }\n\n public int hashCode() {\n int h = 1;\n for (int i = 0; i < size; i++) {\n h = h * 31 + data[i];\n }\n return h;\n }\n\n public IntList clone() {\n IntList ans = new IntList();\n ans.addAll(this);\n return ans;\n }\n\n }\n\n static class NumberTheoryTransform {\n private Modular modular;\n private Power power;\n private int g;\n private int[] wCache = new int[30];\n private int[] invCache = new int[30];\n public static Buffer<IntList> listBuffer = Polynomials.listBuffer;\n private Log2 log2 = new Log2();\n\n public NumberTheoryTransform(Modular mod) {\n this(mod, mod.getMod() == 998244353 ? 3 : new PrimitiveRoot(mod.getMod()).findMinPrimitiveRoot());\n }\n\n public NumberTheoryTransform(Modular mod, int g) {\n this.modular = mod;\n this.power = new Power(mod);\n this.g = g;\n for (int i = 0, until = wCache.length; i < until; i++) {\n int s = 1 << i;\n wCache[i] = power.pow(this.g, (modular.getMod() - 1) / 2 / s);\n invCache[i] = power.inverse(s);\n }\n }\n\n public void dotMul(int[] a, int[] b, int[] c, int m) {\n for (int i = 0, n = 1 << m; i < n; i++) {\n c[i] = modular.mul(a[i], b[i]);\n }\n }\n\n public void dft(int[] p, int m) {\n int n = 1 << m;\n\n int shift = 32 - Integer.numberOfTrailingZeros(n);\n for (int i = 1; i < n; i++) {\n int j = Integer.reverse(i << shift);\n if (i < j) {\n int temp = p[i];\n p[i] = p[j];\n p[j] = temp;\n }\n }\n\n int w = 0;\n int t = 0;\n for (int d = 0; d < m; d++) {\n int w1 = wCache[d];\n int s = 1 << d;\n int s2 = s << 1;\n for (int i = 0; i < n; i += s2) {\n w = 1;\n for (int j = 0; j < s; j++) {\n int a = i + j;\n int b = a + s;\n t = modular.mul(w, p[b]);\n p[b] = modular.plus(p[a], -t);\n p[a] = modular.plus(p[a], t);\n w = modular.mul(w, w1);\n }\n }\n }\n\n }\n\n public void idft(int[] p, int m) {\n dft(p, m);\n\n int n = 1 << m;\n int invN = invCache[m];\n\n p[0] = modular.mul(p[0], invN);\n p[n / 2] = modular.mul(p[n / 2], invN);\n for (int i = 1, until = n / 2; i < until; i++) {\n int a = p[n - i];\n p[n - i] = modular.mul(p[i], invN);\n p[i] = modular.mul(a, invN);\n }\n }\n\n public void mulByPQ(IntList[] lists, IntList ans) {\n PriorityQueue<IntList> pqs = new PriorityQueue<>(lists.length, (a, b) -> a.size() - b.size());\n for (IntList list : lists) {\n IntList clone = listBuffer.alloc();\n clone.addAll(list);\n pqs.add(clone);\n }\n while (pqs.size() > 1) {\n IntList a = pqs.remove();\n IntList b = pqs.remove();\n multiplyAndStoreAnswerIntoA(a, b);\n listBuffer.release(b);\n pqs.add(a);\n }\n\n IntList last = pqs.remove();\n ans.clear();\n ans.addAll(last);\n listBuffer.release(last);\n return;\n }\n\n public void pow2(IntList a) {\n int rankAns = (a.size() - 1) * 2;\n int proper = log2.ceilLog(rankAns + 1);\n a.expandWith(0, (1 << proper));\n dft(a.getData(), proper);\n dotMul(a.getData(), a.getData(), a.getData(), proper);\n idft(a.getData(), proper);\n Polynomials.normalize(a);\n }\n\n private void multiplyAndStoreAnswerIntoA(IntList a, IntList b) {\n int rankAns = a.size() - 1 + b.size() - 1;\n int proper = log2.ceilLog(rankAns + 1);\n a.expandWith(0, (1 << proper));\n b.expandWith(0, (1 << proper));\n dft(a.getData(), proper);\n dft(b.getData(), proper);\n dotMul(a.getData(), b.getData(), a.getData(), proper);\n idft(a.getData(), proper);\n Polynomials.normalize(a);\n }\n\n }\n\n static class Polynomials {\n public static Buffer<IntList> listBuffer = new Buffer<>(IntList::new, list -> list.clear());\n\n public static int rankOf(IntList p) {\n int[] data = p.getData();\n int r = p.size() - 1;\n while (r >= 0 && data[r] == 0) {\n r--;\n }\n return Math.max(0, r);\n }\n\n public static void normalize(IntList list) {\n list.retain(rankOf(list) + 1);\n }\n\n }\n\n static class SequenceUtils {\n public static boolean equal(int[] a, int al, int ar, int[] b, int bl, int br) {\n if ((ar - al) != (br - bl)) {\n return false;\n }\n for (int i = al, j = bl; i <= ar; i++, j++) {\n if (a[i] != b[j]) {\n return false;\n }\n }\n return true;\n }\n\n }\n\n static class FastInput {\n private final InputStream is;\n private byte[] buf = new byte[1 << 13];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastInput(InputStream is) {\n this.is = is;\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n bufLen = -1;\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public int readInt() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n }\n\n static class Power {\n final Modular modular;\n\n public Power(Modular modular) {\n this.modular = modular;\n }\n\n public int pow(int x, int n) {\n if (n == 0) {\n return modular.valueOf(1);\n }\n long r = pow(x, n >> 1);\n r = modular.valueOf(r * r);\n if ((n & 1) == 1) {\n r = modular.valueOf(r * x);\n }\n return (int) r;\n }\n\n public int inverse(int x) {\n return pow(x, modular.m - 2);\n }\n\n }\n\n static class FastOutput implements AutoCloseable, Closeable {\n private StringBuilder cache = new StringBuilder(10 << 20);\n private final Writer os;\n\n public FastOutput(Writer os) {\n this.os = os;\n }\n\n public FastOutput(OutputStream os) {\n this(new OutputStreamWriter(os));\n }\n\n public FastOutput println(int c) {\n cache.append(c).append('\\n');\n return this;\n }\n\n public FastOutput flush() {\n try {\n os.append(cache);\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n return this;\n }\n\n public void close() {\n flush();\n try {\n os.close();\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n\n public String toString() {\n return cache.toString();\n }\n\n }\n\n static class Buffer<T> {\n private Deque<T> deque;\n private Supplier<T> supplier;\n private Consumer<T> cleaner;\n\n public Buffer(Supplier<T> supplier) {\n this(supplier, (x) -> {\n });\n }\n\n public Buffer(Supplier<T> supplier, Consumer<T> cleaner) {\n this(supplier, cleaner, 0);\n }\n\n public Buffer(Supplier<T> supplier, Consumer<T> cleaner, int exp) {\n this.supplier = supplier;\n this.cleaner = cleaner;\n deque = new ArrayDeque<>(exp);\n }\n\n public T alloc() {\n return deque.isEmpty() ? supplier.get() : deque.removeFirst();\n }\n\n public void release(T e) {\n cleaner.accept(e);\n deque.addLast(e);\n }\n\n }\n\n static class Modular {\n int m;\n\n public int getMod() {\n return m;\n }\n\n public Modular(int m) {\n this.m = m;\n }\n\n public Modular(long m) {\n this.m = (int) m;\n if (this.m != m) {\n throw new IllegalArgumentException();\n }\n }\n\n public Modular(double m) {\n this.m = (int) m;\n if (this.m != m) {\n throw new IllegalArgumentException();\n }\n }\n\n public int valueOf(int x) {\n x %= m;\n if (x < 0) {\n x += m;\n }\n return x;\n }\n\n public int valueOf(long x) {\n x %= m;\n if (x < 0) {\n x += m;\n }\n return (int) x;\n }\n\n public int mul(int x, int y) {\n return valueOf((long) x * y);\n }\n\n public int plus(int x, int y) {\n return valueOf(x + y);\n }\n\n public String toString() {\n return \"mod \" + m;\n }\n\n }\n\n static class Log2 {\n public int ceilLog(int x) {\n return 32 - Integer.numberOfLeadingZeros(x - 1);\n }\n\n }\n\n static class GCDs {\n private GCDs() {\n }\n\n public static int gcd(int a, int b) {\n return a >= b ? gcd0(a, b) : gcd0(b, a);\n }\n\n private static int gcd0(int a, int b) {\n return b == 0 ? a : gcd0(b, a % b);\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["divide and conquer", "dp", "fft"], "code_uid": "13701cdfeae0ebd928ac7c0790e3c21e", "src_uid": "279f1f7d250a4be6406c6c7bfc818bbf", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskG solver = new TaskG();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskG {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int mod = 998244353;\n int n = in.nextInt();\n int k = in.nextInt();\n int[] v = new int[10];\n for (int i = 0; i < k; i++) {\n int x = in.nextInt();\n v[x] = 1;\n }\n int[] ans = {1};\n int p = n / 2;\n while (true) {\n if (p % 2 != 0) {\n ans = multiplyMod(ans, v, mod);\n }\n p /= 2;\n if (p == 0) break;\n v = multiplyMod(v, v, mod);\n }\n int res = 0;\n for (int x : ans) {\n res = (int) ((res + (long) x * x) % mod);\n }\n out.println(res);\n }\n\n static int[] multiplyMod(int[] a, int[] b, int mod) {\n int need = a.length + b.length - 1;\n int n = Math.max(2, Integer.highestOneBit(need - 1) << 1);\n\n double[] aReal = new double[n];\n double[] aImaginary = new double[n];\n for (int i = 0; i < a.length; i++) {\n int x = (a[i] % mod + mod) % mod;\n aReal[i] = x & ((1 << 15) - 1);\n aImaginary[i] = x >> 15;\n }\n fft(aReal, aImaginary, false);\n\n double[] bReal = new double[n];\n double[] bImaginary = new double[n];\n for (int i = 0; i < b.length; i++) {\n int x = (b[i] % mod + mod) % mod;\n bReal[i] = x & ((1 << 15) - 1);\n bImaginary[i] = x >> 15;\n }\n fft(bReal, bImaginary, false);\n\n double[] faReal = new double[n];\n double[] faImaginary = new double[n];\n double[] fbReal = new double[n];\n double[] fbImaginary = new double[n];\n\n for (int i = 0; i < n; i++) {\n int j = (n - i) & (n - 1);\n\n double a1r = (aReal[i] + aReal[j]) / 2;\n double a1i = (aImaginary[i] - aImaginary[j]) / 2;\n double a2r = (aImaginary[i] + aImaginary[j]) / 2;\n double a2i = (aReal[j] - aReal[i]) / 2;\n\n double b1r = (bReal[i] + bReal[j]) / 2;\n double b1i = (bImaginary[i] - bImaginary[j]) / 2;\n double b2r = (bImaginary[i] + bImaginary[j]) / 2;\n double b2i = (bReal[j] - bReal[i]) / 2;\n\n faReal[i] = a1r * b1r - a1i * b1i - a2r * b2i - a2i * b2r;\n faImaginary[i] = a1r * b1i + a1i * b1r + a2r * b2r - a2i * b2i;\n\n fbReal[i] = a1r * b2r - a1i * b2i + a2r * b1r - a2i * b1i;\n fbImaginary[i] = a1r * b2i + a1i * b2r + a2r * b1i + a2i * b1r;\n }\n\n fft(faReal, faImaginary, true);\n fft(fbReal, fbImaginary, true);\n int[] res = new int[need];\n for (int i = 0; i < need; i++) {\n long aa = (long) (faReal[i] + 0.5);\n long bb = (long) (fbReal[i] + 0.5);\n long cc = (long) (faImaginary[i] + 0.5);\n res[i] = (int) ((aa + ((bb % mod) << 15) + ((cc % mod) << 30)) % mod);\n }\n return res;\n }\n\n static void fft(double[] a, double[] b, boolean inverse) {\n int n = a.length;\n int shift = 32 - Integer.numberOfTrailingZeros(n);\n// int[] rev = new int[n];\n// for (int i = 1; i < n; i++) {\n// rev[i] = (rev[i >> 1] >> 1) + ((i & 1) == 0 ? 0 : n/2);\n// }\n for (int i = 1; i < n; i++) {\n int j = Integer.reverse(i << shift);\n// int j=rev[i];\n if (i < j) {\n double temp = a[i];\n a[i] = a[j];\n a[j] = temp;\n temp = b[i];\n b[i] = b[j];\n b[j] = temp;\n }\n }\n for (int len = 2; len <= n; len <<= 1) {\n int halfLen = len >> 1;\n double[] cs = new double[halfLen];\n double[] sn = new double[halfLen];\n for (int i = 0; i < halfLen; i++) {\n cs[i] = Math.cos(2 * Math.PI * i / len * (inverse ? -1 : 1));\n sn[i] = Math.sin(2 * Math.PI * i / len * (inverse ? -1 : 1));\n }\n for (int i = 0; i < n; i += len) {\n for (int j = 0; j < halfLen; j++) {\n double wA = cs[j];\n double wB = sn[j];\n double uA = a[i + j];\n double uB = b[i + j];\n double vA = a[i + j + halfLen] * wA - b[i + j + halfLen] * wB;\n double vB = a[i + j + halfLen] * wB + b[i + j + halfLen] * wA;\n a[i + j] = uA + vA;\n b[i + j] = uB + vB;\n a[i + j + halfLen] = uA - vA;\n b[i + j + halfLen] = uB - vB;\n }\n }\n }\n if (inverse) {\n for (int i = 0; i < n; i++) {\n a[i] /= n;\n b[i] /= n;\n }\n }\n }\n\n }\n\n static class InputReader {\n final InputStream is;\n final byte[] buf = new byte[1024];\n int pos;\n int size;\n\n public InputReader(InputStream is) {\n this.is = is;\n }\n\n public int nextInt() {\n int c = read();\n while (isWhitespace(c))\n c = read();\n int sign = 1;\n if (c == '-') {\n sign = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res = res * 10 + c - '0';\n c = read();\n } while (!isWhitespace(c));\n return res * sign;\n }\n\n int read() {\n if (size == -1)\n throw new InputMismatchException();\n if (pos >= size) {\n pos = 0;\n try {\n size = is.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (size <= 0)\n return -1;\n }\n return buf[pos++] & 255;\n }\n\n static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["divide and conquer", "dp", "fft"], "code_uid": "a6406b6098b63b104cda1316da294233", "src_uid": "279f1f7d250a4be6406c6c7bfc818bbf", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.*;\n\nimport javax.swing.Painter;\n\nimport java.io.*;\nimport java.lang.reflect.Array;\nimport java.math.*;\n\n\npublic class Main {\n\t\n\tstatic int mod = 998244353;\n\tstatic int g = 3;\n\t\n\tstatic long qpow(long a, long n) {\n\t\tlong x = 1;\n\t\ta %= mod;\n\t\twhile(n > 0) {\n\t\t\tif((n & 1) == 1) x = x * a % mod;\n\t\t\ta = a * a % mod; n >>= 1;\n\t\t}\n\t\treturn x;\n\t}\n\t\n\tstatic void rader(long[] y, int len) {\n\t\tfor(int i = 1, j = len / 2; i < len - 1; i++) {\n\t\t\tif(i < j) { long tmp = y[i]; y[i] = y[j]; y[j] = tmp; }\n\t\t\tint k = len / 2;\n\t\t\twhile(j >= k) { j -= k; k /= 2; }\n\t\t\tif(j < k) j += k;\n\t\t}\n\t}\n\t\n\tstatic void NTT(long[] y, int len, int on) {\n\t\trader(y, len);\n\t\tfor(int h = 2; h <= len; h <<= 1) {\n\t\t\tlong wn = qpow(g, (mod-1)/h);\n\t\t\tif(on == -1) wn = qpow(wn, mod-2);\n\t\t\tfor(int j = 0; j < len; j += h) {\n\t\t\t\tlong w = 1;\n\t\t\t\tfor(int k = j; k < j + h / 2; k++) {\n\t\t\t\t\tlong u = y[k];\n\t\t\t\t\tlong t = w * y[k + h / 2] % mod;\n\t\t\t\t\ty[k] = (u + t) % mod;\n\t\t\t\t\ty[k+h/2] = (u - t + mod) % mod;\n\t\t\t\t\tw = w * wn % mod;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(on == -1) {\n\t\t\tlong t = qpow(len, mod - 2);\n\t\t\tfor(int i = 0; i < len; i++)\n\t\t\t\ty[i] = y[i] * t % mod;\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) throws IOException {\n\t\tFastScanner in = new FastScanner(new InputStreamReader(System.in));\n\t\tPrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));\n\t\t\n\t\tint n = in.nextInt(), m = in.nextInt();\n\t\tint len = 1, nn = n / 2;\n\t\twhile(len < (9 * nn + 1)) len <<= 1;\n\t\tlong[] a = new long[len];\n\t\tlong[] b = new long[len];\n\t\t\n\t\ta[0] = 1;\n\t\tfor(int i = 0; i < m; i++) {\n\t\t\tint x = in.nextInt();\n\t\t\tb[x] = 1;\n\t\t}\n\t\t\n\t\tNTT(a, len, 1);\n\t\tNTT(b, len, 1);\n\t\t\n\t\tfor(int i = 0; i < len; i++) {\n\t\t\tif(a[i] != 0 && b[i] != 0) {\n\t\t\t\ta[i] = a[i] * qpow(b[i], nn) % mod;\n\t\t\t} else a[i] = 0;\n\t\t}\n\t\t\n\t\tNTT(a, len, -1);\n\t\t\n\t\tlong ans = 0;\n\t\tfor(int i = 0; i < len; i++)\n\t\t\tans = (ans + a[i] * a[i]) % mod;\n\t\t\n\t\tout.println((ans + mod) % mod);\n\t\t\n\t\tout.close();\n }\n\t\n\tstatic class FastScanner {\n\t\tprivate StringTokenizer ST;\n\t\tprivate BufferedReader BR;\n\t\tprivate PrintWriter PW;\n\n\t\tpublic FastScanner(InputStreamReader stream) {\n\t\t\tBR = new BufferedReader(stream);\n\t\t}\n\n\t\tpublic String next() {\n\t\t\twhile (ST == null || !ST.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\tST = new StringTokenizer(BR.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn ST.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\t\n\t\tpublic long nextLong() {\n\t return Long.parseLong(next());\n\t }\n\n\t\tpublic double nextDouble() {\n\t return Double.parseDouble(next());\n\t }\n\n\t}\n}\n\n\n\n", "lang_cluster": "Java", "tags": ["divide and conquer", "dp", "fft"], "code_uid": "9586c3e58b860cf77180063bab48deac", "src_uid": "279f1f7d250a4be6406c6c7bfc818bbf", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskG solver = new TaskG();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskG {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int mod = 998244353;\n int n = in.nextInt();\n int k = in.nextInt();\n int[] v = new int[10];\n for (int i = 0; i < k; i++) {\n int x = in.nextInt();\n v[x] = 1;\n }\n int[] ans = {1};\n int p = n / 2;\n while (true) {\n if (p % 2 != 0) {\n ans = multiplyMod(ans, v, mod);\n }\n p /= 2;\n if (p == 0) break;\n v = multiplyMod(v, v, mod);\n }\n int res = 0;\n for (int x : ans) {\n res = (int) ((res + (long) x * x) % mod);\n }\n out.println(res);\n }\n\n static int[] multiplyMod(int[] a, int[] b, int mod) {\n int need = a.length + b.length - 1;\n int n = Math.max(2, Integer.highestOneBit(need - 1) << 1);\n double[] aReal = new double[n];\n double[] aImaginary = new double[n];\n for (int i = 0; i < a.length; i++) {\n int x = (a[i] % mod + mod) % mod;\n aReal[i] = x & ((1 << 15) - 1);\n aImaginary[i] = x >> 15;\n }\n if (n == 524288) {\n\n int z = 1;\n }\n fft(aReal, aImaginary, false);\n\n double[] bReal = new double[n];\n double[] bImaginary = new double[n];\n// if (a == b) {\n// System.arraycopy(aReal, 0, bReal, 0, n);\n// System.arraycopy(aImaginary, 0, bImaginary, 0, n);\n// } else \n {\n for (int i = 0; i < b.length; i++) {\n int x = (b[i] % mod + mod) % mod;\n bReal[i] = x & ((1 << 15) - 1);\n bImaginary[i] = x >> 15;\n }\n fft(bReal, bImaginary, false);\n }\n\n double[] faReal = new double[n];\n double[] faImaginary = new double[n];\n double[] fbReal = new double[n];\n double[] fbImaginary = new double[n];\n\n double cf = 0.25 / n;\n for (int i = 0; i < n; i++) {\n int j = (n - i) & (n - 1);\n\n double a1r = (aReal[i] + aReal[j]);\n double a1i = (aImaginary[i] - aImaginary[j]);\n double a2r = (aImaginary[i] + aImaginary[j]);\n double a2i = (aReal[j] - aReal[i]);\n\n double b1r = (bReal[i] + bReal[j]) * cf;\n double b1i = (bImaginary[i] - bImaginary[j]) * cf;\n double b2r = (bImaginary[i] + bImaginary[j]) * cf;\n double b2i = (bReal[j] - bReal[i]) * cf;\n\n faReal[i] = a1r * b1r - a1i * b1i - a2r * b2i - a2i * b2r;\n faImaginary[i] = a1r * b1i + a1i * b1r + a2r * b2r - a2i * b2i;\n\n fbReal[i] = a1r * b2r - a1i * b2i + a2r * b1r - a2i * b1i;\n fbImaginary[i] = a1r * b2i + a1i * b2r + a2r * b1i + a2i * b1r;\n }\n\n fft(faReal, faImaginary, true);\n fft(fbReal, fbImaginary, true);\n int[] res = new int[need];\n for (int i = 0; i < need; i++) {\n long aa = (long) (faReal[i] + 0.5);\n long bb = (long) (fbReal[i] + 0.5);\n long cc = (long) (faImaginary[i] + 0.5);\n res[i] = (int) ((aa + ((bb % mod) << 15) + ((cc % mod) << 30)) % mod);\n }\n if (need + 1 < n && Math.abs(faReal[need + 1]) > 0.5) {\n int z = 1;\n }\n return res;\n }\n\n static void fft(double[] a, double[] b, boolean inverse) {\n int n = a.length;\n int shift = 32 - Integer.numberOfTrailingZeros(n);\n for (int i = 1; i < n; i++) {\n int j = Integer.reverse(i << shift);\n if (i < j) {\n double temp = a[i];\n a[i] = a[j];\n a[j] = temp;\n temp = b[i];\n b[i] = b[j];\n b[j] = temp;\n }\n }\n for (int len = 2; len <= n; len <<= 1) {\n int halfLen = len >> 1;\n double[] cs = new double[halfLen];\n double[] sn = new double[halfLen];\n for (int i = 0; i < halfLen; i++) {\n cs[i] = Math.cos(2 * Math.PI * i / len * (inverse ? -1 : 1));\n sn[i] = Math.sin(2 * Math.PI * i / len * (inverse ? -1 : 1));\n }\n for (int i = 0; i < n; i += len) {\n for (int j = 0; j < halfLen; j++) {\n double wA = cs[j];\n double wB = sn[j];\n double uA = a[i + j];\n double uB = b[i + j];\n double vA = a[i + j + halfLen] * wA - b[i + j + halfLen] * wB;\n double vB = a[i + j + halfLen] * wB + b[i + j + halfLen] * wA;\n a[i + j] = uA + vA;\n b[i + j] = uB + vB;\n a[i + j + halfLen] = uA - vA;\n b[i + j + halfLen] = uB - vB;\n }\n }\n }\n// if (inverse) {\n// for (int i = 0; i < n; i++) {\n// a[i] /= n;\n// b[i] /= n;\n// }\n// }\n }\n\n }\n\n static class InputReader {\n final InputStream is;\n final byte[] buf = new byte[1024];\n int pos;\n int size;\n\n public InputReader(InputStream is) {\n this.is = is;\n }\n\n public int nextInt() {\n int c = read();\n while (isWhitespace(c))\n c = read();\n int sign = 1;\n if (c == '-') {\n sign = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res = res * 10 + c - '0';\n c = read();\n } while (!isWhitespace(c));\n return res * sign;\n }\n\n int read() {\n if (size == -1)\n throw new InputMismatchException();\n if (pos >= size) {\n pos = 0;\n try {\n size = is.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (size <= 0)\n return -1;\n }\n return buf[pos++] & 255;\n }\n\n static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["divide and conquer", "dp", "fft"], "code_uid": "cddd0107735e2fe53e2ce2be7c4077d9", "src_uid": "279f1f7d250a4be6406c6c7bfc818bbf", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.lang.reflect.Array;\nimport java.math.BigInteger;\n\npublic class FFT {\n\tFastScanner in;\n\tPrintWriter out;\n\tboolean systemIO = true;\n\n\tpublic class Vector {\n\t\tint sz = 1 << 20;\n\t\tlong[] v;\n\t\t\n\t\tpublic Vector(long[] a) {\n\t\t\tv = new long[sz];\n\t\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\t\tv[i] = a[i];\n\t\t\t}\n\t\t}\n\t\t\n\t\tpublic long[] FFT() {\n\t\t\treturn DFT(0, 1, true);\n\t\t}\n\t\t\n\t\tpublic long[] FFT1() {\n\t\t\tlong[] x = DFT(0, 1, false);\n\t\t\tfor (int i = 0; i < x.length; i++) {\n\t\t\t\tx[i] = x[i] * szinv % mod;\n\t\t\t}\n\t\t\treturn x;\n\t\t}\n\t\t\n\t\tpublic long[] DFT(int first, int pow, boolean straight) {\n\t\t\tif (pow == sz) {\n\t\t\t\tlong[] ans = {v[first]};\n\t\t\t\treturn ans;\n\t\t\t}\n\t\t\tlong[] zero = DFT(first, 2 * pow, straight);\n\t\t\tlong[] one = DFT(first + pow, 2 * pow, straight);\n\t\t\tint n = zero.length;\n\t\t\tlong[] ans = new long[2 * n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tans[i] = (zero[i] + (straight ? warr[i * pow] : winvarr[i * pow]) * one[i]) % mod;\n\t\t\t}\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tans[n + i] = (((zero[i] - (straight ? warr[i * pow] : winvarr[i * pow]) * one[i]) % mod) + mod) % mod;\n\t\t\t}\n\t\t\treturn ans;\n\t\t}\n\t}\n\t\n\tpublic long[] fft(long[] a) {\n\t\tlong wth = 1;\n\t\tint sz = 1 << 20;\n\t\tlong[] ans = new long[sz];\n\t\tfor (int i = 0; i < ans.length; i++) {\n\t\t\tlong x = 1;\n\t\t\tfor (int j = 0; j < a.length; j++) {\n\t\t\t\tans[i] += a[j] * x;\n\t\t\t\tans[i] %= mod;\n\t\t\t\tx *= wth;\n\t\t\t\tx %= mod;\n\t\t\t}\n\t\t\twth *= w;\n\t\t\twth %= mod;\n\t\t}\n\t\treturn ans;\n\t}\n\t\n\tpublic long[] pow(long[] ans, int p) {\n\t\tfor (int i = 0; i < ans.length; i++) {\n\t\t\tans[i] = pow(ans[i], p);\n\t\t}\n\t\treturn ans;\n\t}\n\t\n\tpublic long pow(long x, int p) {\n\t\tif (p == 0) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (p % 2 == 1) {\n\t\t\treturn pow(x, p - 1) * x % mod;\n\t\t}\n\t\tlong y = pow(x, p / 2);\n\t\treturn y * y % mod;\n\t}\n\t\n\tlong mod = 998244353;\n\tlong w = 646;\n\tlong winv = (new BigInteger(w + \"\")).modInverse(new BigInteger(mod + \"\")).longValueExact();\n\tlong[] warr = new long[1 << 20];\n\tlong[] winvarr = new long[1 << 20];\n\tlong szinv = (new BigInteger((1 << 20) + \"\")).modInverse(new BigInteger(mod + \"\")).longValueExact();\n\n\tpublic void solve() {\n\t\tint n = in.nextInt();\n\t\tint k = in.nextInt();\n\t\tlong[] arr = new long[10];\n\t\tfor (int i = 0; i < k; i++) {\n\t\t\tarr[in.nextInt()] = 1;\n\t\t}\n\t\twarr[0] = 1;\n\t\twinvarr[0] = 1;\n\t\tfor (int i = 1; i < warr.length; i++) {\n\t\t\twarr[i] = warr[i - 1] * w % mod;\n\t\t\twinvarr[i] = winvarr[i - 1] * w % mod;\n\t\t}\n\t\tlong[] x = fft(arr);\n\t\tx = pow(x, n / 2);\n\t\tVector v = new Vector(x);\n\t\tx = v.FFT1();\n\t\tlong ans = 0;\n\t\tfor (int i = 0; i < x.length; i++) {\n\t\t\tans += x[i] * x[i];\n\t\t\tans %= mod;\n\t\t}\n\t\tout.println(ans);\n\t}\n\n\tpublic void run() {\n\t\ttry {\n\t\t\tif (systemIO) {\n\t\t\t\tin = new FastScanner(System.in);\n\t\t\t\tout = new PrintWriter(System.out);\n\t\t\t} else {\n\t\t\t\tin = new FastScanner(new File(\"input.txt\"));\n\t\t\t\tout = new PrintWriter(new File(\"output.txt\"));\n\t\t\t}\n\t\t\tsolve();\n\n\t\t\tout.close();\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}\n\n\tclass FastScanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tFastScanner(File f) {\n\t\t\ttry {\n\t\t\t\tbr = new BufferedReader(new FileReader(f));\n\t\t\t} catch (FileNotFoundException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\n\t\tFastScanner(InputStream f) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(f));\n\t\t}\n\n\t\tString nextLine() {\n\t\t\ttry {\n\t\t\t\treturn br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\n\t\tString next() {\n\t\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t}\n\n\t// AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\n\tpublic static void main(String[] arg) {\n\t\tnew FFT().run();\n\t}\n}", "lang_cluster": "Java", "tags": ["divide and conquer", "dp", "fft"], "code_uid": "badc89ee64868fe3e2c1efb4d3d96227", "src_uid": "279f1f7d250a4be6406c6c7bfc818bbf", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskG solver = new TaskG();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskG {\n static double[] cs = new double[1 << 21];\n static double[] sn = new double[1 << 21];\n static double[] csi = new double[1 << 21];\n static double[] sni = new double[1 << 21];\n\n static {\n for (int len = 1; len <= cs.length; len <<= 1) {\n for (int i = len / 2; i < len; i++) {\n cs[i] = Math.cos(2 * Math.PI * (i - len / 2) / len);\n sn[i] = Math.sin(2 * Math.PI * (i - len / 2) / len);\n csi[i] = Math.cos(-2 * Math.PI * (i - len / 2) / len);\n sni[i] = Math.sin(-2 * Math.PI * (i - len / 2) / len);\n }\n }\n }\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int mod = 998244353;\n int n = in.nextInt();\n int k = in.nextInt();\n int[] v = new int[10];\n for (int i = 0; i < k; i++) {\n int x = in.nextInt();\n v[x] = 1;\n }\n int[] ans = {1};\n int p = n / 2;\n while (true) {\n if (p % 2 != 0) {\n ans = multiplyMod(ans, v, mod);\n }\n p /= 2;\n if (p == 0) break;\n v = multiplyMod(v, v, mod);\n }\n int res = 0;\n for (int x : ans) {\n res = (int) ((res + (long) x * x) % mod);\n }\n out.println(res);\n }\n\n static int[] multiplyMod(int[] a, int[] b, int mod) {\n int need = a.length + b.length - 1;\n int n = Math.max(2, Integer.highestOneBit(need - 1) << 1);\n\n double[] aReal = new double[n];\n double[] aImaginary = new double[n];\n for (int i = 0; i < a.length; i++) {\n int x = (a[i] % mod + mod) % mod;\n aReal[i] = x & ((1 << 15) - 1);\n aImaginary[i] = x >> 15;\n }\n fft(aReal, aImaginary, false);\n\n double[] bReal = new double[n];\n double[] bImaginary = new double[n];\n for (int i = 0; i < b.length; i++) {\n int x = (b[i] % mod + mod) % mod;\n bReal[i] = x & ((1 << 15) - 1);\n bImaginary[i] = x >> 15;\n }\n fft(bReal, bImaginary, false);\n\n double[] faReal = new double[n];\n double[] faImaginary = new double[n];\n double[] fbReal = new double[n];\n double[] fbImaginary = new double[n];\n\n for (int i = 0; i < n; i++) {\n int j = (n - i) & (n - 1);\n\n double a1r = (aReal[i] + aReal[j]) / 2;\n double a1i = (aImaginary[i] - aImaginary[j]) / 2;\n double a2r = (aImaginary[i] + aImaginary[j]) / 2;\n double a2i = (aReal[j] - aReal[i]) / 2;\n\n double b1r = (bReal[i] + bReal[j]) / 2;\n double b1i = (bImaginary[i] - bImaginary[j]) / 2;\n double b2r = (bImaginary[i] + bImaginary[j]) / 2;\n double b2i = (bReal[j] - bReal[i]) / 2;\n\n faReal[i] = a1r * b1r - a1i * b1i - a2r * b2i - a2i * b2r;\n faImaginary[i] = a1r * b1i + a1i * b1r + a2r * b2r - a2i * b2i;\n\n fbReal[i] = a1r * b2r - a1i * b2i + a2r * b1r - a2i * b1i;\n fbImaginary[i] = a1r * b2i + a1i * b2r + a2r * b1i + a2i * b1r;\n }\n\n fft(faReal, faImaginary, true);\n fft(fbReal, fbImaginary, true);\n int[] res = new int[need];\n for (int i = 0; i < need; i++) {\n long aa = (long) (faReal[i] + 0.5);\n long bb = (long) (fbReal[i] + 0.5);\n long cc = (long) (faImaginary[i] + 0.5);\n res[i] = (int) ((aa + ((bb % mod) << 15) + ((cc % mod) << 30)) % mod);\n }\n return res;\n }\n\n static void fft(double[] a, double[] b, boolean inverse) {\n int n = a.length;\n int shift = 32 - Integer.numberOfTrailingZeros(n);\n for (int i = 1; i < n; i++) {\n int j = Integer.reverse(i << shift);\n if (i < j) {\n double temp = a[i];\n a[i] = a[j];\n a[j] = temp;\n temp = b[i];\n b[i] = b[j];\n b[j] = temp;\n }\n }\n for (int len = 2; len <= n; len <<= 1) {\n int halfLen = len >> 1;\n for (int i = 0; i < n; i += len) {\n int w = cs.length / len;\n for (int j = 0, k = 0; j < halfLen; j++, k += w) {\n double wA = inverse ? csi[halfLen + j] : cs[halfLen + j];\n double wB = inverse ? sni[halfLen + j] : sn[halfLen + j];\n double uA = a[i + j];\n double uB = b[i + j];\n double vA = a[i + j + halfLen] * wA - b[i + j + halfLen] * wB;\n double vB = a[i + j + halfLen] * wB + b[i + j + halfLen] * wA;\n a[i + j] = uA + vA;\n b[i + j] = uB + vB;\n a[i + j + halfLen] = uA - vA;\n b[i + j + halfLen] = uB - vB;\n }\n }\n }\n if (inverse) {\n for (int i = 0; i < n; i++) {\n a[i] /= n;\n b[i] /= n;\n }\n }\n }\n\n }\n\n static class InputReader {\n final InputStream is;\n final byte[] buf = new byte[1024];\n int pos;\n int size;\n\n public InputReader(InputStream is) {\n this.is = is;\n }\n\n public int nextInt() {\n int c = read();\n while (isWhitespace(c))\n c = read();\n int sign = 1;\n if (c == '-') {\n sign = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res = res * 10 + c - '0';\n c = read();\n } while (!isWhitespace(c));\n return res * sign;\n }\n\n int read() {\n if (size == -1)\n throw new InputMismatchException();\n if (pos >= size) {\n pos = 0;\n try {\n size = is.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (size <= 0)\n return -1;\n }\n return buf[pos++] & 255;\n }\n\n static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["divide and conquer", "dp", "fft"], "code_uid": "945f48088e3eb8ea6fcce586b7d60a5c", "src_uid": "279f1f7d250a4be6406c6c7bfc818bbf", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskG solver = new TaskG();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskG {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int mod = 998244353;\n int n = in.nextInt();\n int k = in.nextInt();\n int[] v = new int[10];\n for (int i = 0; i < k; i++) {\n int x = in.nextInt();\n v[x] = 1;\n }\n int[] ans = {1};\n int p = n / 2;\n while (true) {\n if (p % 2 != 0) {\n ans = multiplyMod(ans, v, mod);\n }\n p /= 2;\n if (p == 0) break;\n v = multiplyMod(v, v, mod);\n }\n int res = 0;\n for (int x : ans) {\n res = (int) ((res + (long) x * x) % mod);\n }\n out.println(res);\n }\n\n static int[] multiplyMod(int[] a, int[] b, int mod) {\n int need = a.length + b.length - 1;\n int n = Math.max(2, Integer.highestOneBit(need - 1) << 1);\n\n double[] aReal = new double[n];\n double[] aImaginary = new double[n];\n for (int i = 0; i < a.length; i++) {\n int x = (a[i] % mod + mod) % mod;\n aReal[i] = x & ((1 << 15) - 1);\n aImaginary[i] = x >> 15;\n }\n fft(aReal, aImaginary, false);\n\n double[] bReal = new double[n];\n double[] bImaginary = new double[n];\n for (int i = 0; i < b.length; i++) {\n int x = (b[i] % mod + mod) % mod;\n bReal[i] = x & ((1 << 15) - 1);\n bImaginary[i] = x >> 15;\n }\n fft(bReal, bImaginary, false);\n\n double[] faReal = new double[n];\n double[] faImaginary = new double[n];\n double[] fbReal = new double[n];\n double[] fbImaginary = new double[n];\n\n for (int i = 0; i < n; i++) {\n int j = (n - i) & (n - 1);\n\n double a1r = (aReal[i] + aReal[j]) / 2;\n double a1i = (aImaginary[i] - aImaginary[j]) / 2;\n double a2r = (aImaginary[i] + aImaginary[j]) / 2;\n double a2i = (aReal[j] - aReal[i]) / 2;\n\n double b1r = (bReal[i] + bReal[j]) / 2;\n double b1i = (bImaginary[i] - bImaginary[j]) / 2;\n double b2r = (bImaginary[i] + bImaginary[j]) / 2;\n double b2i = (bReal[j] - bReal[i]) / 2;\n\n faReal[i] = a1r * b1r - a1i * b1i - a2r * b2i - a2i * b2r;\n faImaginary[i] = a1r * b1i + a1i * b1r + a2r * b2r - a2i * b2i;\n\n fbReal[i] = a1r * b2r - a1i * b2i + a2r * b1r - a2i * b1i;\n fbImaginary[i] = a1r * b2i + a1i * b2r + a2r * b1i + a2i * b1r;\n }\n\n fft(faReal, faImaginary, true);\n fft(fbReal, fbImaginary, true);\n int[] res = new int[need];\n for (int i = 0; i < need; i++) {\n long aa = (long) (faReal[i] + 0.5);\n long bb = (long) (fbReal[i] + 0.5);\n long cc = (long) (faImaginary[i] + 0.5);\n res[i] = (int) ((aa + ((bb % mod) << 15) + ((cc % mod) << 30)) % mod);\n }\n return res;\n }\n\n static void fft(double[] a, double[] b, boolean inverse) {\n int n = a.length;\n int shift = 32 - Integer.numberOfTrailingZeros(n);\n int[] rev = new int[n];\n for (int i = 1; i < n; i++) {\n rev[i] = (rev[i >> 1] >> 1) + ((i & 1) == 0 ? 0 : n / 2);\n }\n for (int i = 1; i < n; i++) {\n// int j = Integer.reverse(i << shift);\n int j = rev[i];\n if (i < j) {\n double temp = a[i];\n a[i] = a[j];\n a[j] = temp;\n temp = b[i];\n b[i] = b[j];\n b[j] = temp;\n }\n }\n for (int len = 2; len <= n; len <<= 1) {\n int halfLen = len >> 1;\n double[] cs = new double[halfLen];\n double[] sn = new double[halfLen];\n for (int i = 0; i < halfLen; i++) {\n cs[i] = Math.cos(2 * Math.PI * i / len * (inverse ? -1 : 1));\n sn[i] = Math.sin(2 * Math.PI * i / len * (inverse ? -1 : 1));\n }\n for (int i = 0; i < n; i += len) {\n for (int j = 0; j < halfLen; j++) {\n double wA = cs[j];\n double wB = sn[j];\n double uA = a[i + j];\n double uB = b[i + j];\n double vA = a[i + j + halfLen] * wA - b[i + j + halfLen] * wB;\n double vB = a[i + j + halfLen] * wB + b[i + j + halfLen] * wA;\n a[i + j] = uA + vA;\n b[i + j] = uB + vB;\n a[i + j + halfLen] = uA - vA;\n b[i + j + halfLen] = uB - vB;\n }\n }\n }\n if (inverse) {\n for (int i = 0; i < n; i++) {\n a[i] /= n;\n b[i] /= n;\n }\n }\n }\n\n }\n\n static class InputReader {\n final InputStream is;\n final byte[] buf = new byte[1024];\n int pos;\n int size;\n\n public InputReader(InputStream is) {\n this.is = is;\n }\n\n public int nextInt() {\n int c = read();\n while (isWhitespace(c))\n c = read();\n int sign = 1;\n if (c == '-') {\n sign = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res = res * 10 + c - '0';\n c = read();\n } while (!isWhitespace(c));\n return res * sign;\n }\n\n int read() {\n if (size == -1)\n throw new InputMismatchException();\n if (pos >= size) {\n pos = 0;\n try {\n size = is.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (size <= 0)\n return -1;\n }\n return buf[pos++] & 255;\n }\n\n static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["divide and conquer", "dp", "fft"], "code_uid": "eb33b3fd77ee9f6e6412f762b776a4ca", "src_uid": "279f1f7d250a4be6406c6c7bfc818bbf", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class LuckyTickets {\n\n // 2^23*7*17+1\n private static final int MOD = 998244353;\n\n //highest power of 2 that is a factor of MOD-1\n private static final int twoPow = 23;\n\n // any number such that ROOT^(2^twoPow)=1 & ROOT^(2^(twoPow-1))!=1\n private static final int ROOT = 15311432;\n\n // flip first k bits\n private static int bitReverse(int n, int k) {\n return Integer.reverse(n) >>> (32 - k);\n }\n\n private static long modPow(long a, long p) {\n if (p == 0) {\n return 1;\n }\n long half = modPow(a, p / 2);\n long ans = (half * half) % MOD;\n if (p % 2 == 1) {\n ans = (ans * a) % MOD;\n }\n return ans;\n }\n\n private static long modInv(long a) {\n return modPow(a, MOD - 2);\n }\n\n /**\n * calculate roots of unity for ntt\n */\n private static long[] calcRoots(int k, boolean inverse) {\n long root = modPow(ROOT, modPow(2, twoPow - k));\n if (inverse) {\n root = modInv(root);\n }\n long[] roots = new long[k];\n if (k > 0) {\n roots[k - 1] = root;\n }\n for (int i = k - 1; i > 0; i--) {\n roots[i - 1] = (roots[i] * roots[i]) % MOD;\n }\n return roots;\n }\n\n /**\n * Change the indicies of an array, putting them into bit-reverse order.\n * array should have length 2^k\n */\n private static long[] reorderArray(long[] a, int k) {\n long[] ans = new long[a.length];\n for (int i = 0; i < a.length; i++) {\n ans[bitReverse(i, k)] = a[i];\n }\n return ans;\n }\n\n /**\n * coef.length = 2^k\n * Note: When computing the inverse, this function will return 2^k times the\n * correct answer. Please divide as needed.\n */\n private static long[] numberTheoreticTransform(long[] coef, int k, boolean inverse) {\n coef = reorderArray(coef, k);\n long[] roots = calcRoots(k, inverse);\n for (int s = 0; s < k; s++) {\n int len = 1 << s;\n for (int st = 0; st < coef.length; st += 2 * len) {\n // combine the vectors starting at st and st + len\n long curRoot = 1;\n for (int j = st; j < st + len; j++) {\n long t = (curRoot * coef[j + len]) % MOD;\n long u = coef[j];\n coef[j] = (u + t) % MOD;\n coef[j + len] = (u - t) % MOD;\n curRoot = (roots[s] * curRoot) % MOD;\n }\n }\n }\n return coef;\n }\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt() / 2;\n int m = sc.nextInt();\n int[] nums = new int[m];\n int max = 0;\n for (int i = 0; i < m; i++) {\n nums[i] = sc.nextInt();\n max = Math.max(max, nums[i]);\n }\n int min_size = n * max + 1;\n int k = 0;\n int size = 1;\n while (size < min_size) {\n size *= 2;\n k++;\n }\n long[] a = new long[size];\n for (int i = 0; i < nums.length; i++) {\n a[nums[i]] = 1;\n }\n a = numberTheoreticTransform(a, k, false);\n for (int i = 0; i < size; i++) {\n a[i] = modPow(a[i], n);\n }\n a = numberTheoreticTransform(a, k, true);\n long ans = 0;\n for (int i = 0; i < size; i++) {\n ans = (ans + a[i] * a[i]) % MOD;\n }\n long multiplier = modInv(size);\n System.out.println((((ans * multiplier) % MOD) * multiplier) % MOD);\n }\n}\n", "lang_cluster": "Java", "tags": ["divide and conquer", "dp", "fft"], "code_uid": "faa9b1468ebd7d8247ef82ef20d01f2f", "src_uid": "279f1f7d250a4be6406c6c7bfc818bbf", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.lang.reflect.Array;\nimport java.util.*;\nimport java.math.BigInteger;\nimport java.util.Collections.*;\nimport java.util.function.Consumer;\n\nimport static java.lang.Math.*;\nimport static java.lang.Math.min;\nimport static java.util.Arrays.*;\nimport static java.math.BigInteger.*;\n\n\npublic class Main{\n\n void run(){\n Locale.setDefault(Locale.US);\n boolean my;\n try {\n my = System.getProperty(\"MY_LOCAL\") != null;\n } catch (Exception e) {\n my = false;\n }\n try{\n err = System.err;\n if( my ){\n sc = new FastScanner(new BufferedReader(new FileReader(\"input.txt\")));\n// sc = new FastScanner(new BufferedReader(new FileReader(\"C:\\\\myTest.txt\")));\n out = new PrintWriter (new FileWriter(\"output.txt\"));\n }\n else {\n sc = new FastScanner(new BufferedReader(new InputStreamReader(System.in)));\n out = new PrintWriter(new OutputStreamWriter(System.out));\n }\n// out = new PrintWriter(new OutputStreamWriter(System.out));\n }catch(Exception e){\n MLE();\n }\n if( my )\n tBeg = System.currentTimeMillis();\n solve();\n if( my )\n err.println( \"TIME: \" + (System.currentTimeMillis() - tBeg ) / 1e3 );\n exit(0);\n }\n\n void exit( int val ){\n err.flush();\n out.flush();\n System.exit(val);\n }\n\n double tBeg;\n FastScanner sc;\n PrintWriter out;\n PrintStream err;\n\n class FastScanner{\n\n StringTokenizer st;\n BufferedReader br;\n\n FastScanner( BufferedReader _br ){\n br = _br;\n }\n\n String readLine(){\n try {\n return br.readLine();\n } catch (IOException e) {\n return null;\n }\n }\n\n String next(){\n while( st==null || !st.hasMoreElements() )\n st = new StringTokenizer(readLine());\n return st.nextToken();\n }\n\n int nextInt(){ return Integer.parseInt(next()); }\n long nextLong(){ return Long.parseLong(next()); }\n double nextDouble(){ return Double.parseDouble(next()); }\n }\n\n void MLE(){\n int[][] arr = new int[1024*1024][]; for( int i = 0; i < 1024*1024; ++i ) arr[i] = new int[1024*1024];\n }\n\n void MLE( boolean doNotMLE ){ if( !doNotMLE ) MLE(); }\n\n void TLE(){\n for(;;);\n }\n\n public static void main(String[] args) {\n new Main().run();\n// new Thread( null, new Runnable() {\n// @Override\n// public void run() {\n// new Main().run();\n// }\n// }, \"Lolka\", 256_000_000L ).run();\n }\n\n ////////////////////////////////////////////////////////////////\n\n int n;\n int[] a, pr, nx;\n ArrayList<Integer> Q;\n boolean[] used;\n\n void solve(){\n n = sc.nextInt();\n a = new int[n];\n pr = new int[n];\n nx = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = sc.nextInt();\n pr[i] = i - 1;\n nx[i] = i + 1;\n }\n\n Q = new ArrayList<>();\n used = new boolean[n];\n for (int i = 1; i <= n-2; i++) {\n try_add(i);\n }\n long ans = 0;\n\n while( !Q.isEmpty() ){\n int i = Q.get(Q.size()-1);\n Q.remove( Q.size() - 1 );\n nx[pr[i]] = nx[i];\n pr[nx[i]] = pr[i];\n ans += min( a[pr[i]], a[nx[i]] );\n try_add( pr[i] );\n try_add( nx[i] );\n }\n\n if( 3 <= n ){\n int i = nx[0];\n while( nx[i] != n ){\n ans += min( a[pr[i]], a[nx[i]] );\n i = nx[i];\n }\n }\n\n out.println( ans );\n }\n\n private void try_add(int i) {\n if( used[i] )return;\n\n if( 1<=i && i <=n-2 && a[pr[i]] >= a[i] && a[i] <= a[nx[i]] ){\n Q.add( i );\n used[i] = true;\n }\n }\n\n\n}", "lang_cluster": "Java", "tags": ["greedy"], "code_uid": "f1952498eebbe7b525fa80ed2f5ddc58", "src_uid": "e7e0f9069166fe992abe6f0e19caa6a1", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class D_submit {\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\tboolean eof;\n\n\tstatic final int[][] ANS = {\n\t\t\t{ 0, },\n\t\t\t{ 2, 1, },\n\t\t\t{ 32, 30, 80, 109, },\n\t\t\t{ 6824, 59808, 147224, 415870, 1757896, 1897056, 4898872, 7593125, },\n\t\t\t{ 776830421, 290516100, 746623577, 293783147, 33900006, 735127505,\n\t\t\t\t\t565460332, 428982705, 472062098, 161873957, 117354594,\n\t\t\t\t\t515619293, 578944191, 312106242, 569389279, 391464593, },\n\t\t\t{ 261086313, 584837659, 683961846, 468868529, 211593382, 736955478,\n\t\t\t\t\t229471758, 157617135, 398169441, 360252438, 629394768,\n\t\t\t\t\t264125799, 647490480, 342079395, 391579767, 225200475,\n\t\t\t\t\t486011304, 513156108, 628771752, 132906648, 142138221,\n\t\t\t\t\t20119449, 444199674, 195188679, 387329805, 44684703,\n\t\t\t\t\t651912135, 737154512, 612549793, 519860281, 186175544,\n\t\t\t\t\t212568440, },\n\t\t\t{ 240805271, 239509872, 581127897, 6511239, 156126222, 509425833,\n\t\t\t\t\t672407328, 366667722, 459185405, 509737025, 554790222,\n\t\t\t\t\t165216555, 703150560, 74806569, 398730015, 383350905,\n\t\t\t\t\t506108358, 51326142, 298053147, 104256117, 391428765,\n\t\t\t\t\t374020479, 206607807, 87664059, 275899176, 56407680,\n\t\t\t\t\t551553401, 448939463, 582889860, 129676638, 226078251,\n\t\t\t\t\t135769095, 61292868, 578972226, 190181628, 390739055,\n\t\t\t\t\t184587732, 446575689, 732674124, 232198470, 676760679,\n\t\t\t\t\t352474101, 611444862, 575661807, 628905585, 320813094,\n\t\t\t\t\t522840969, 469781928, 156006018, 554473341, 239654268,\n\t\t\t\t\t643714911, 433540170, 199307003, 496385218, 291740751,\n\t\t\t\t\t67309914, 370826673, 202356819, 279421821, 421203111,\n\t\t\t\t\t63744786, 520987612, 550671827, },\n\t\t\t{ 482164403, 768209115, 462063756, 154906374, 36099042, 341766705,\n\t\t\t\t\t678182556, 621882744, 478771358, 231881111, 175889805,\n\t\t\t\t\t243630450, 168908523, 671961765, 55761813, 652682670,\n\t\t\t\t\t773939082, 517628076, 756201264, 124604900, 750976272,\n\t\t\t\t\t498253248, 676047609, 137170026, 705610017, 495032139,\n\t\t\t\t\t561797418, 703097347, 500815609, 95984586, 739707108,\n\t\t\t\t\t265613565, 387099846, 777331779, 594676173, 591219559,\n\t\t\t\t\t407997044, 208947235, 93337440, 478908360, 685013007,\n\t\t\t\t\t487033953, 671903001, 39521181, 738490312, 33785059,\n\t\t\t\t\t465470131, 310453920, 54648783, 346831137, 427694175,\n\t\t\t\t\t474743430, 705296781, 435828036, 429824745, 663532359,\n\t\t\t\t\t261388683, 244690731, 533997135, 596108961, 506813013,\n\t\t\t\t\t371892402, 590145264, 104733162, 143420103, 654339672,\n\t\t\t\t\t700348950, 685038942, 578826927, 286484229, 501639192,\n\t\t\t\t\t434962491, 299270097, 27702486, 335375775, 111746817,\n\t\t\t\t\t565603164, 294926121, 676063665, 735862995, 710035809,\n\t\t\t\t\t437011960, 668528077, 138765186, 508213986, 615036450,\n\t\t\t\t\t353784942, 624827616, 343900011, 241289776, 52410890,\n\t\t\t\t\t72018835, 352406796, 415705878, 4802637, 376367145,\n\t\t\t\t\t65589678, 333633477, 341834527, 303717460, 282387700,\n\t\t\t\t\t42951006, 254706039, 423048528, 526429710, 68131467,\n\t\t\t\t\t669954708, 12787348, 500636381, 317959019, 479433192,\n\t\t\t\t\t657133515, 416259390, 610216692, 340129188, 44594256,\n\t\t\t\t\t257373347, 138718678, 530767740, 292922628, 37220268,\n\t\t\t\t\t605295159, 480722613, 458170419, 30540300, 487159055,\n\t\t\t\t\t232966794, 149150650, },\n\t\t\t{ 412133651, 386543325, 139952108, 289303402, 102404925, 317067177,\n\t\t\t\t\t396414708, 80515854, 663739304, 317300809, 228877044,\n\t\t\t\t\t493725043, 715317967, 490300965, 315527373, 743539734,\n\t\t\t\t\t488329191, 553627998, 533025234, 242583957, 706116537,\n\t\t\t\t\t614109258, 645447222, 523195911, 492109128, 722623041,\n\t\t\t\t\t111085128, 766395126, 654378921, 691964847, 496688157,\n\t\t\t\t\t399056049, 654363234, 102052314, 191720088, 473910948,\n\t\t\t\t\t259736526, 332840025, 388047555, 665791056, 627111387,\n\t\t\t\t\t139696515, 441456687, 443032569, 283264821, 771641703,\n\t\t\t\t\t452641455, 511306362, 117572859, 127701891, 721298331,\n\t\t\t\t\t176520078, 357242229, 611296308, 696994956, 405628839,\n\t\t\t\t\t429224274, 465336054, 695091546, 689828796, 574648641,\n\t\t\t\t\t351220905, 507964023, 675326610, 517248963, 453528621,\n\t\t\t\t\t220301928, 494463186, 681789969, 339589656, 44524053,\n\t\t\t\t\t417125457, 339589404, 747135963, 341780733, 734158215,\n\t\t\t\t\t396817281, 21997836, 5728464, 147611205, 456248898,\n\t\t\t\t\t714128667, 377654949, 3862068, 128418948, 589390074,\n\t\t\t\t\t304947090, 11703825, 228266073, 127304142, 429215724,\n\t\t\t\t\t361541124, 521572968, 468358191, 341231688, 65323503,\n\t\t\t\t\t613778508, 15985323, 291661029, 410970006, 591638112,\n\t\t\t\t\t349541550, 89967528, 224922159, 361094166, 584206074,\n\t\t\t\t\t640051812, 324264456, 652625388, 693768537, 11740617,\n\t\t\t\t\t309238398, 211085469, 194905872, 639416484, 110110707,\n\t\t\t\t\t296645895, 748118511, 131177718, 511142751, 775975599,\n\t\t\t\t\t421403409, 475528473, 434685258, 1768977, 80301375,\n\t\t\t\t\t708023862, 569195676, 56238084, 632887668, 88089750,\n\t\t\t\t\t631539342, 396695565, 38780154, 695798271, 469819224,\n\t\t\t\t\t439587099, 69045921, 682966116, 112310856, 64943298,\n\t\t\t\t\t534475872, 40215357, 389728458, 286368453, 736006257,\n\t\t\t\t\t501181650, 54829908, 603489402, 338032656, 512182818,\n\t\t\t\t\t627500097, 462674016, 3103092, 157324491, 43978329,\n\t\t\t\t\t596818971, 259025598, 9088632, 91991781, 577291428,\n\t\t\t\t\t211245489, 429471231, 142626330, 172560633, 510907446,\n\t\t\t\t\t444609585, 758102058, 375112647, 744786693, 276174402,\n\t\t\t\t\t19259856, 233672418, 745389414, 225772848, 23385663,\n\t\t\t\t\t324290610, 519804558, 120337812, 402578568, 360676008,\n\t\t\t\t\t450089262, 551043738, 337388940, 512108856, 28879011,\n\t\t\t\t\t690040638, 106017282, 558262341, 99972432, 608226003,\n\t\t\t\t\t612152037, 42414435, 776201013, 39580443, 518796945,\n\t\t\t\t\t494437752, 583194366, 723936555, 415359657, 309569589,\n\t\t\t\t\t751104774, 166684527, 249229170, 353120823, 130668327,\n\t\t\t\t\t753823584, 580966092, 561963717, 543672234, 393846327,\n\t\t\t\t\t586278000, 327398400, 278403867, 156455586, 363920382,\n\t\t\t\t\t190245195, 290039148, 547014447, 466218648, 146037150,\n\t\t\t\t\t585462906, 666008595, 691786683, 374707494, 622498779,\n\t\t\t\t\t231158277, 685740951, 115612245, 681825249, 545555745,\n\t\t\t\t\t551718468, 277206615, 640171035, 757727334, 195193908,\n\t\t\t\t\t658656684, 457760646, 225925875, 505761984, 18685233,\n\t\t\t\t\t506832921, 112511021, 396846646, 290147622, 113924623,\n\t\t\t\t\t669986155, 336008070, 63611061, 238586775, 119956662,\n\t\t\t\t\t616557739, 772784623, 334527774, 410403148, 51933421, }, };\n\n\tvoid solve() throws IOException {\n\t\tint n = nextInt();\n\t\tint k = nextInt();\n\t\tfor (int i = 0; i <= 8; i++)\n\t\t\tif ((1 << i) == n) {\n\t\t\t\tSystem.err.println(i);\n\t\t\t\tout.println(ANS[i][k - 1]);\n\t\t\t}\n\t}\n\n\tD_submit() throws IOException {\n\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.close();\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew D_submit();\n\t}\n\n\tString nextToken() {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (Exception e) {\n\t\t\t\teof = true;\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tString nextString() {\n\t\ttry {\n\t\t\treturn br.readLine();\n\t\t} catch (IOException e) {\n\t\t\teof = true;\n\t\t\treturn null;\n\t\t}\n\t}\n\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n}", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "36587334a122e27fa226b0132befa9c1", "src_uid": "cfe19131644e5925e32084a581e23286", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.PrintWriter;\nimport java.util.Scanner;\n\npublic class CF1384E extends PrintWriter {\n\t// https://codeforces.com/contest/1384/problem/E\n\tpublic Scanner sc = new Scanner(System.in);\n\n\tpublic CF1384E() {\n\t\tsuper(System.out);\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tCF1384E o = new CF1384E();\n\t\to.main();\n\t\to.flush();\n\t}\n\n\tpublic static final int SZ = 20;\n\tpublic int[] ds = new int[SZ];\n\n\tpublic void main() {\n\t\tint t = sc.nextInt();\n\t\twhile (t-- > 0) {\n\t\t\tint n = sc.nextInt();\n\t\t\tbyte[] sa = sc.next().getBytes();\n\t\t\tbyte[] sb = sc.next().getBytes();\n\t\t\tfor (int id = 0; id < SZ; id++) {\n\t\t\t\tds[id] = id;\n\t\t\t}\n\t\t\tint[] es = new int[SZ];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (sa[i] != sb[i]) {\n\t\t\t\t\tint u = sa[i] - 'a';\n\t\t\t\t\tint v = sb[i] - 'a';\n\t\t\t\t\tjoin(u, v);\n\t\t\t\t\tes[u] |= (1 << v);\n\t\t\t\t}\n\t\t\t}\n\t\t\tint ans = SZ * 2;\n\t\t\tfor (int id = 0; id < SZ; id++) {\n\t\t\t\tif (ds[id] == id) {\n\t\t\t\t\tans = ans - 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tboolean[] dags = new boolean[1 << SZ];\n\t\t\tdags[0] = true;\n\t\t\tint cnt_ = 0;\n\t\t\tfor (int state = 1; state < (1 << SZ); state++) {\n\t\t\t\tint cnt = 0;\n\t\t\t\tfor (int tmp = state; tmp > 0; tmp &= (tmp - 1)) {\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t\tfor (int id = 0; id < SZ; id++) {\n\t\t\t\t\tif ((state & (1 << id)) > 0) {\n\t\t\t\t\t\tint a = state ^ (1 << id);\n\t\t\t\t\t\t// chu y thu tu duyet cua cac bai toan\n\t\t\t\t\t\tif (dags[a]) {\n\t\t\t\t\t\t\tif ((a & es[id]) == 0) {\n\t\t\t\t\t\t\t\tdags[state] = true;\n\t\t\t\t\t\t\t\tcnt_ = Math.max(cnt_, cnt);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tans -= cnt_;\n\t\t\tprintln(ans);\n\t\t}\n\t}\n\n\tprivate void join(int u, int v) {\n\t\tu = find(u);\n\t\tv = find(v);\n\t\tif (u != v) {\n\t\t\tds[u] = v;\n\t\t}\n\n\t}\n\n\tprivate int find(int u) {\n\t\tif (ds[u] == u) {\n\t\t\treturn u;\n\t\t}\n\t\tds[u] = find(ds[u]);\n\t\treturn ds[u];\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dp", "graphs", "trees", "bitmasks"], "code_uid": "bc0c1f2c3635fa9d53a980bbbf4dd875", "src_uid": "d0735a763e2a40bfc94085019cd646f0", "difficulty": 3100.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "// https://codeforces.com/blog/entry/80562\nimport java.io.*;\nimport java.util.*;\n\npublic class CF1384E extends PrintWriter {\n\tCF1384E() { super(System.out); }\n\tScanner sc = new Scanner(System.in);\n\tpublic static void main(String[] $) {\n\t\tCF1384E o = new CF1384E(); o.main(); o.flush();\n\t}\n\n\tstatic final int A = 20;\n\tint[] ds = new int[A];\n\tint find(int i) {\n\t\treturn ds[i] < 0 ? i : (ds[i] = find(ds[i]));\n\t}\n\tvoid join(int i, int j) {\n\t\ti = find(i);\n\t\tj = find(j);\n\t\tif (i == j)\n\t\t\treturn;\n\t\tif (ds[i] > ds[j])\n\t\t\tds[i] = j;\n\t\telse {\n\t\t\tif (ds[i] == ds[j])\n\t\t\t\tds[i]--;\n\t\t\tds[j] = i;\n\t\t}\n\t}\n\tvoid main() {\n\t\tint t = sc.nextInt();\n\t\twhile (t-- > 0) {\n\t\t\tint n = sc.nextInt();\n\t\t\tbyte[] sa = sc.next().getBytes();\n\t\t\tbyte[] sb = sc.next().getBytes();\n\t\t\tArrays.fill(ds, -1);\n\t\t\tint[] aa = new int[A];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tif (sa[i] != sb[i]) {\n\t\t\t\t\tint u = sa[i] - 'a';\n\t\t\t\t\tint v = sb[i] - 'a';\n\t\t\t\t\tjoin(u, v);\n\t\t\t\t\taa[u] |= 1 << v;\n\t\t\t\t}\n\t\t\tint ans = A * 2;\n\t\t\tfor (int u = 0; u < A; u++)\n\t\t\t\tif (ds[u] < 0)\n\t\t\t\t\tans--;\n\t\t\tboolean[] dag = new boolean[1 << A]; dag[0] = true;\n\t\t\tint cnt_ = 0;\n\t\t\tfor (int a, b = 1; b < 1 << A; b++) {\n\t\t\t\tint cnt = 0;\n\t\t\t\tfor (a = b; a > 0; a &= a - 1)\n\t\t\t\t\tcnt++;\n\t\t\t\tfor (int u = 0; u < A; u++)\n\t\t\t\t\tif ((a = b ^ 1 << u) != b && dag[a] && (a & aa[u]) == 0) {\n\t\t\t\t\t\tdag[b] = true;\n\t\t\t\t\t\tcnt_ = Math.max(cnt_, cnt);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t}\n\t\t\tans -= cnt_;\n\t\t\tprintln(ans);\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dp", "graphs", "trees", "bitmasks"], "code_uid": "128220267694d69aeae6ddf74290bdc8", "src_uid": "d0735a763e2a40bfc94085019cd646f0", "difficulty": 3100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\nimport java.util.StringTokenizer;\n\npublic class Solution {\n static final FS sc = new FS();\n static final PrintWriter pw = new PrintWriter(System.out);\n static int alp = 20;\n static List<List<Integer>> G;\n public static void main(String[] args) {\n int t = sc.nextInt();\n while (t-- > 0) {\n int n = sc.nextInt();\n char[] a = sc.next().toCharArray();\n char[] b = sc.next().toCharArray();\n G = new ArrayList<>();\n for(int i = 0;i < alp;i++) {\n G.add(new ArrayList<>());\n }\n int[] adj = new int[alp];\n for(int i = 0;i < n;i++) {\n if (a[i] != b[i]) {\n G.get(a[i] - 'a').add(b[i] - 'a');\n G.get(b[i] - 'a').add(a[i] - 'a');\n adj[a[i] - 'a'] |= 1 << (b[i] - 'a');\n }\n }\n int components = 0;\n boolean[] vis = new boolean[alp];\n for (int i = 0;i < alp;i++) {\n if (!vis[i]) {\n dfs(i, vis);\n components++;\n }\n }\n int ans = 0;\n boolean[] dp = new boolean[1 << alp];\n dp[0] = true;\n for (int mask = 0;mask < 1 << alp;mask++) {\n if (dp[mask]) {\n ans = Math.max(ans, Integer.bitCount(mask));\n for (int u = 0;u < alp;u++) {\n if ((~mask >> u & 1) == 1 && (adj[u] & mask) == 0) {\n dp[mask | 1 << u] = true;\n }\n }\n }\n }\n pw.println(2 * alp - components - ans);\n }\n pw.flush();\n }\n\n private static void dfs(int u, boolean[] vis) {\n vis[u] = true;\n for (Integer v : G.get(u)) {\n if (!vis[v]) {\n dfs(v, vis);\n }\n }\n }\n\n static class FS {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st = new StringTokenizer(\"\");\n String next() {\n while(!st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch(Exception ignored) {}\n }\n return st.nextToken();\n }\n int[] nextArray(int n) {\n int[] a = new int[n];\n for(int i = 0;i < n;i++) {\n a[i] = nextInt();\n }\n return a;\n }\n int nextInt() {\n return Integer.parseInt(next());\n }\n long nextLong() {\n return Long.parseLong(next());\n }\n }\n}", "lang_cluster": "Java", "tags": ["dp", "graphs", "trees", "bitmasks"], "code_uid": "5d1e128c5cd61a44187389c4472da060", "src_uid": "d0735a763e2a40bfc94085019cd646f0", "difficulty": 3100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class C {\n\n\tstatic final int P = 1_000_000_007;\n\n\tstatic boolean nextPermutation(int[] a) {\n\t\tint n = a.length;\n\t\tint ptr = n - 1;\n\t\twhile (ptr > 0 && a[ptr - 1] >= a[ptr]) {\n\t\t\tptr--;\n\t\t}\n\n\t\tfor (int i = ptr, j = n - 1; i < j; i++, j--) {\n\t\t\tint tmp = a[i];\n\t\t\ta[i] = a[j];\n\t\t\ta[j] = tmp;\n\t\t}\n\n\t\tif (ptr == 0) {\n\t\t\treturn false;\n\t\t}\n\n\t\tfor (int i = ptr;; i++) {\n\t\t\tif (a[ptr - 1] < a[i]) {\n\t\t\t\tint tmp = a[ptr - 1];\n\t\t\t\ta[ptr - 1] = a[i];\n\t\t\t\ta[i] = tmp;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\n\tint slow(int n, int k) {\n\t\tint[] p = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tp[i] = i;\n\t\t}\n\t\tint ans = 0;\n\t\tdo {\n\t\t\tint m = 0;\n\t\t\tint offset = 0;\n\t\t\tfor (int i = 0; i < n; ++i)\n\t\t\t\tif (m < p[i]) {\n\t\t\t\t\tm = p[i];\n\t\t\t\t\toffset = 0;\n\t\t\t\t} else {\n\t\t\t\t\toffset = offset + 1;\n\t\t\t\t\tif (offset == k)\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\tans += m == n - 1 ? 1 : 0;\n\t\t} while (nextPermutation(p));\n\t\treturn ans;\n\t}\n\n\tvoid submit() {\n\t\tint n = nextInt();\n\t\tint k = nextInt();\n\t\tint[] a = new int[n + 1];\n\t\ta[0] = 1;\n\t\tfor (int i = 1; i <= k && i <= n; i++) {\n\t\t\ta[i] = (int) ((long) (i + 1) * a[i - 1] % P);\n\t\t}\n\n\t\tif (n <= k) {\n\t\t\tout.println(0);\n\t\t\treturn;\n\t\t}\n\n\t\tint mult = a[k - 1];\n\n\t\tfor (int i = k + 1; i <= n; i++) {\n\t\t\ta[i] = (int) ((long) (i + 1) * a[i - 1] % P);\n\t\t\ta[i] -= (int) ((long) mult * a[i - k - 1] % P);\n\t\t\tif (a[i] < 0) {\n\t\t\t\ta[i] += P;\n\t\t\t}\n\n\t\t\tmult = (int) ((long) mult * i % P * inv(i - k) % P);\n\t\t}\n\n\t\tint fact = 1;\n\t\tfor (int i = 1; i <= n; i++) {\n\t\t\tfact = (int) ((long) fact * i % P);\n\t\t}\n\t\t\n\t\tn--;\n\n\t\tfact -= a[n];\n\t\tif (fact < 0) {\n\t\t\tfact += P;\n\t\t}\n\n\t\tout.println(fact);\n\t}\n\n\tint inv(int x) {\n\t\treturn x == 1 ? 1 : (P - (int) ((long) (P / x) * inv(P % x) % P));\n\t}\n\n\tvoid preCalc() {\n\n\t}\n\n\tvoid stress() {\n\n\t}\n\n\tvoid test() {\n\t\tint[] a = new int[11];\n\t\ta[0] = 1;\n\t\ta[1] = 2;\n\t\ta[2] = 6;\n\t\tfor (int i = 3; i < a.length; i++) {\n\t\t\ta[i] = (i + 1) * a[i - 1] - (i - 1) * (i - 2) * a[i - 3];\n\t\t}\n\t\tSystem.err.println(Arrays.toString(a));\n\n\t\ta[0] = 1;\n\t\ta[1] = 2;\n\t\ta[2] = 6;\n\t\ta[3] = 24;\n\t\tfor (int i = 4; i < a.length; i++) {\n\t\t\ta[i] = (i + 1) * a[i - 1] - (i - 1) * (i - 2) * (i - 3) * a[i - 4];\n\t\t}\n\t\tSystem.err.println(Arrays.toString(a));\n\n\t\tfor (int n = 1; n <= 11; n++) {\n\t\t\tSystem.err.println(slow(n, 2) + \" \" + a[n]);\n\t\t}\n\t}\n\n\tC() throws IOException {\n\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\tpreCalc();\n\t\tsubmit();\n\t\t// stress();\n\t\t// test();\n\t\tout.close();\n\t}\n\n\tstatic final Random rng = new Random();\n\n\tstatic int rand(int l, int r) {\n\t\treturn l + rng.nextInt(r - l + 1);\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew C();\n\t}\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\n\tString nextToken() {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tString nextString() {\n\t\ttry {\n\t\t\treturn br.readLine();\n\t\t} catch (IOException e) {\n\t\t\tthrow new RuntimeException(e);\n\t\t}\n\t}\n\n\tint nextInt() {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "dp"], "code_uid": "d1e5608388c0f17130749d9d4564dfec", "src_uid": "0644605611a2cd10ab3a9f12f18d7ae4", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) throws Exception {\n new Solve().run();\n }\n}\n\nclass Solve {\n\n InputStream is;\n PrintWriter out;\n String INPUT = \"\";\n\n //------------> Solution \n public void solve() {\n int n = nextInt();\n for (int i = 0; i < n; i++) {\n String s = nextString();\n s = s.split(\"'\", 2)[1];\n System.out.println(check(s));;\n }\n }\n\n public String check(String s) {\n switch (s.length()) {\n case 1:\n if (s.equals(\"9\")) {\n return \"1989\";\n } else {\n return \"199\" + s;\n }\n case 2:\n if (s.equals(\"99\")) {\n return \"1999\";\n } else {\n return \"20\" + s;\n }\n case 3:\n String s1 = check(s.substring(2));\n String s2 = check(s.substring(1));\n for (int i = 1; i < 100; i++) {\n String ans = i + s;\n if (!ans.equals(s1) && !ans.equals(s2) && Integer.parseInt(ans) >= 1989) {\n return ans;\n }\n }\n break;\n default:\n\n ArrayList<String> list = new ArrayList<>();\n for (int i = 1; i < s.length(); i++) {\n list.add(check(s.substring(i)));\n }\n if (!list.contains(s) && !s.startsWith(\"0\") && Integer.parseInt(s) >= 1989) {\n return s;\n }\n int i = 1;\n while (true) {\n String ans = i++ + s;\n if (!list.contains(ans)) {\n return ans;\n }\n }\n }\n return s;\n }\n\n //End !!!\n void run() throws Exception {\n is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n out = new PrintWriter(System.out);\n long s = System.currentTimeMillis();\n solve();\n out.flush();\n if (!INPUT.isEmpty()) {\n print(System.currentTimeMillis() - s + \"ms\");\n }\n }\n\n private final byte[] inbuf = new byte[1024];\n public int lenbuf = 0, ptrbuf = 0;\n\n private void sout(Object s) {\n out.print(s);\n }\n\n private int readByte() {\n if (lenbuf == -1) {\n throw new InputMismatchException();\n }\n if (ptrbuf >= lenbuf) {\n ptrbuf = 0;\n try {\n lenbuf = is.read(inbuf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (lenbuf <= 0) {\n return -1;\n }\n }\n return inbuf[ptrbuf++];\n }\n\n private boolean isSpaceChar(int c) {\n return !(c >= 33 && c <= 126);\n }\n\n private int skip() {\n int b;\n while ((b = readByte()) != -1 && isSpaceChar(b)) {\n }\n return b;\n }\n\n private double nextDouble() {\n return Double.parseDouble(nextString());\n }\n\n private char nextChar() {\n return (char) skip();\n }\n\n private String nextString() {\n int b = skip();\n StringBuilder sb = new StringBuilder();\n while (!(isSpaceChar(b))) { // when nextLine, (isSpaceChar(b) && b != ' ')\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n private char[] nextString(int n) {\n char[] buf = new char[n];\n int b = skip(), p = 0;\n while (p < n && !(isSpaceChar(b))) {\n buf[p++] = (char) b;\n b = readByte();\n }\n return n == p ? buf : Arrays.copyOf(buf, p);\n }\n\n private char[][] nm(int n, int m) {\n char[][] map = new char[n][];\n for (int i = 0; i < n; i++) {\n map[i] = nextString(m);\n }\n return map;\n }\n\n private int[] nextArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = nextInt();\n }\n return a;\n }\n\n private int nextInt() {\n int num = 0, b;\n boolean minus = false;\n while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')) {\n }\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n\n while (true) {\n if (b >= '0' && b <= '9') {\n num = num * 10 + (b - '0');\n } else {\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n private long nextLong() {\n long num = 0;\n int b;\n boolean minus = false;\n while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')) {\n }\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n\n while (true) {\n if (b >= '0' && b <= '9') {\n num = num * 10 + (b - '0');\n } else {\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n private void print(Object... o) {\n if (INPUT.length() > 0) {\n System.out.println(Arrays.deepToString(o));\n }\n }\n\n}\n", "lang_cluster": "Java", "tags": ["math", "greedy", "constructive algorithms", "implementation"], "code_uid": "81d9f4526e5e1e1560c1d396ffa234e7", "src_uid": "31be4d38a8b5ea8738a65bfee24a5a21", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class E {\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\tboolean eof;\n\n\tstatic final int[] PS = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41,\n\t\t\t43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97 };\n\n\tint l, r, p;\n\tList<Integer> goodAL = new ArrayList<>();\n\n\tstatic int[] toIntArray(List<Integer> a) {\n\t\tint[] ret = new int[a.size()];\n\t\tint i = 0;\n\t\tfor (Integer x : a) {\n\t\t\tret[i++] = x;\n\t\t}\n\t\treturn ret;\n\t}\n\n\tvoid dfs(int x, int i) {\n\t\tif (i == PS.length) {\n\t\t\treturn;\n\t\t}\n\t\tdfs(x, i + 1);\n\t\tif (x <= r / PS[i]) {\n\t\t\tint next = x * PS[i];\n\t\t\tgoodAL.add(next);\n\t\t\tdfs(next, i);\n\t\t}\n\t}\n\n\tvoid solve() throws IOException {\n\t\tl = nextInt();\n\t\tr = nextInt();\n\t\tp = nextInt();\n\t\tgoodAL.add(1);\n\t\tdfs(1, 0);\n\t\tint[] good = toIntArray(goodAL);\n\t\tArrays.sort(good);\n\n\t\tint n = good.length;\n\n\t\tint[] dp = new int[n];\n\t\tint oo = Integer.MAX_VALUE / 3;\n\t\tArrays.fill(dp, oo);\n\t\tdp[0] = 0;\n\t\tfor (int x = 2; x <= p; x++) {\n\t\t\tfor (int i = 0, j = 0; i < n; i++) {\n\t\t\t\tlong needL = (long) good[i] * x;\n\t\t\t\tif (needL > r) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\twhile (j < n && good[j] < needL) {\n\t\t\t\t\tj++;\n\t\t\t\t}\n\t\t\t\tif (j == n || good[j] != needL) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (dp[i] + x < p) {\n\t\t\t\t\tint a = dp[j];\n\t\t\t\t\tint b = dp[i] + 1;\n\t\t\t\t\tdp[j] = (a <= b) ? a : b;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint ans = 0;\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (good[i] >= l && dp[i] != oo) {\n\t\t\t\tans++;\n\t\t\t}\n\t\t}\n\n\t\tout.println(ans);\n\t}\n\n\tE() throws IOException {\n\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.close();\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew E();\n\t}\n\n\tString nextToken() {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (Exception e) {\n\t\t\t\teof = true;\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tString nextString() {\n\t\ttry {\n\t\t\treturn br.readLine();\n\t\t} catch (IOException e) {\n\t\t\teof = true;\n\t\t\treturn null;\n\t\t}\n\t}\n\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n}", "lang_cluster": "Java", "tags": ["two pointers", "dp", "brute force"], "code_uid": "ed10325753dfb8d710f64d867ca9f6f4", "src_uid": "6d898638531e4713774bbd5d47e827bf", "difficulty": 2800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.util.Arrays;\nimport java.util.ArrayList;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author sheep\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskE solver = new TaskE();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskE {\n\n int ptrNumbers;\n int numbers[];\n int primes[];\n\n void dfs(int depth, int now, int maxCont, int count) {\n if (depth == primes.length) {\n if (maxCont + count <= 100) {\n numbers[ptrNumbers++] = now;\n }\n return;\n }\n\n boolean enable = (primes[depth] * primes[depth]) > 100;\n for (int i = 0; ; ++i) {\n dfs(depth + 1, now, i == 0 ? maxCont : primes[depth], enable ? count + i : count);\n if (now * (long)primes[depth] > 1000000000) {\n break;\n }\n now *= primes[depth];\n }\n }\n\n void find() {\n ArrayList<Integer> primes = new ArrayList<Integer>();\n for (int i = 2; i <= 100; ++i) {\n boolean isPrime = true;\n for (int j = 2; j < i; ++j) {\n if (i % j == 0) {\n isPrime = false;\n }\n }\n\n if (isPrime) {\n primes.add(i);\n }\n }\n\n this.primes = new int[primes.size()];\n for (int i = 0; i < primes.size(); ++i) {\n this.primes[i] = primes.get(i);\n }\n\n numbers = new int[2759075];\n ptrNumbers = 0;\n dfs(0, 1, 1, 0);\n\n Arrays.sort(numbers);\n }\n\n int leastNeed[];\n boolean included[];\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n find();\n leastNeed = new int[ptrNumbers];\n included = new boolean[ptrNumbers];\n Arrays.fill(leastNeed, Integer.MAX_VALUE / 100);\n\n int l = in.nextInt();\n int r = in.nextInt();\n int maxSteps = in.nextInt();\n\n leastNeed[0] = 0;\n\n int ans = 0;\n for (int i = 0; i < ptrNumbers; ++i) {\n if (numbers[i] < l || numbers[i] > r) {\n included[i] = true;\n }\n }\n\n for (int i = 2; i < maxSteps; ++i) {\n\n int leftPtr = 0;\n for (int j = 0; j < ptrNumbers; ++j) {\n\n while (numbers[leftPtr] * i < numbers[j]) {\n ++leftPtr;\n }\n\n if (numbers[leftPtr] * (long)i == numbers[j]) {\n\n if (leastNeed[leftPtr] + 1 < leastNeed[j]) {\n\n leastNeed[j] = leastNeed[leftPtr] + 1;\n\n if (!included[j]) {\n if (leastNeed[j] + i <= maxSteps) {\n ++ans;\n included[j] = true;\n }\n }\n }\n }\n }\n }\n\n out.println(ans);\n }\n}\n\nclass InputReader {\n BufferedReader reader;\n StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream));\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n", "lang_cluster": "Java", "tags": ["two pointers", "dp", "brute force"], "code_uid": "f206e6bfd94e38de40d11c6b0478112c", "src_uid": "6d898638531e4713774bbd5d47e827bf", "difficulty": 2800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class E {\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\tboolean eof;\n\n\tstatic final int[] PS = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41,\n\t\t\t43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97 };\n\n\tint l, r, p;\n\tList<Integer> goodAL = new ArrayList<>();\n\n\tstatic int[] toIntArray(List<Integer> a) {\n\t\tint[] ret = new int[a.size()];\n\t\tint i = 0;\n\t\tfor (Integer x : a) {\n\t\t\tret[i++] = x;\n\t\t}\n\t\treturn ret;\n\t}\n\n\tvoid dfs(int x, int i) {\n\t\tif (i == PS.length) {\n\t\t\treturn;\n\t\t}\n\t\tdfs(x, i + 1);\n\t\tif (x <= r / PS[i]) {\n\t\t\tint next = x * PS[i];\n\t\t\tgoodAL.add(next);\n\t\t\tdfs(next, i);\n\t\t}\n\t}\n\n\tvoid solve() throws IOException {\n\t\tl = nextInt();\n\t\tr = nextInt();\n\t\tp = nextInt();\n\t\tgoodAL.add(1);\n\t\tdfs(1, 0);\n\t\tint[] good = toIntArray(goodAL);\n\t\tArrays.sort(good);\n\n\t\tint n = good.length;\n\n\t\tint[] dp = new int[n];\n\t\tint oo = Integer.MAX_VALUE / 3;\n\t\tArrays.fill(dp, oo);\n\t\tdp[0] = 0;\n\t\tfor (int x = 2; x <= p; x++) {\n\t\t\tfor (int i = 0, j = 0; i < n; i++) {\n\t\t\t\tlong needL = (long) good[i] * x;\n\t\t\t\tif (needL > r) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\twhile (j < n && good[j] < needL) {\n\t\t\t\t\tj++;\n\t\t\t\t}\n\t\t\t\tif (j == n || good[j] != needL) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (dp[i] + x < p) {\n\t\t\t\t\tdp[j] = Math.min(dp[j], dp[i] + 1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint ans = 0;\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (good[i] >= l && dp[i] != oo) {\n\t\t\t\tans++;\n\t\t\t}\n\t\t}\n\n\t\tout.println(ans);\n\t}\n\n\tE() throws IOException {\n\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.close();\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew E();\n\t}\n\n\tString nextToken() {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (Exception e) {\n\t\t\t\teof = true;\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tString nextString() {\n\t\ttry {\n\t\t\treturn br.readLine();\n\t\t} catch (IOException e) {\n\t\t\teof = true;\n\t\t\treturn null;\n\t\t}\n\t}\n\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n}", "lang_cluster": "Java", "tags": ["two pointers", "dp", "brute force"], "code_uid": "de638426e8892a499f8ad50862680b86", "src_uid": "6d898638531e4713774bbd5d47e827bf", "difficulty": 2800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.OutputStreamWriter;\nimport java.io.BufferedWriter;\nimport java.io.PrintStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Random;\nimport java.io.Writer;\nimport java.util.Collection;\nimport java.util.List;\nimport java.util.BitSet;\nimport java.io.IOException;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.ArrayList;\nimport java.util.NoSuchElementException;\nimport java.util.TreeSet;\nimport java.math.BigInteger;\nimport java.util.Collections;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author ogiekako\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tMyScanner in = new MyScanner(inputStream);\n\t\tMyPrintWriter out = new MyPrintWriter(outputStream);\n\t\tTaskE solver = new TaskE();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskE {\n // 2944730\n int[] primes;\n int[] candidates;\n int numCandidates;\n public void solve(int testNumber, MyScanner in, MyPrintWriter out) {\n int N = (int) 1e9;\n int L = in.nextInt(), R = in.nextInt();\n int p = in.nextInt();\n if(p<3){\n out.println(0);return;\n }\n primes = MathUtils.generatePrimes(p + 1);\n candidates = new int[2944730];\n Arrays.fill(candidates, Integer.MAX_VALUE);\n numCandidates = 0;\n gen(0, 1L, N);\n Arrays.sort(candidates);\n int[] dist = new int[numCandidates];\n Arrays.fill(dist, Integer.MAX_VALUE);\n dist[0] = 0;// 1\n boolean[] answer = new boolean[numCandidates];\n answer[0] = true;\n for(int n=2;n<=p;n++){\n for (int i = 0, j = 0; i < dist.length; i++)if(dist[i] < p - n && candidates[i] <= N/n){\n int nxt = candidates[i] * n;\n while(candidates[j] != nxt)j++;\n if(dist[j] > dist[i] + 1){\n dist[j] = dist[i] + 1;\n answer[j] = true;\n }\n }\n }\n int res = 0;\n for (int i = 0; i < answer.length; i++)if(answer[i] && L <= candidates[i] && candidates[i] <= R)res++;\n out.println(res);\n }\n\n private void gen(int p, long number, int N) {\n if (p >= primes.length) {\n candidates[numCandidates++] = (int) number;\n return;\n }\n while (number <= N) {\n gen(p + 1, number, N);\n number *= primes[p];\n }\n }\n}\n\nclass MyScanner {\n private final InputStream in;\n\n public MyScanner(InputStream in) {\n this.in = in;\n }\n\n int bufLen;\n int bufPtr;\n byte[] buf = new byte[1024];\n\n public int read() {\n if (bufLen == -1)\n throw new InputMismatchException();\n if (bufPtr >= bufLen) {\n bufPtr = 0;\n try {\n bufLen = in.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (bufLen <= 0)\n return -1;\n }\n return buf[bufPtr++];\n }\n\n public int nextInt() {\n try {\n int c = read();\n if (c == -1) return c;\n while (c != '-' && (c < '0' || '9' < c)) {\n c = read();\n if (c == -1) return c;\n }\n if (c == '-') return -nextInt();\n int res = 0;\n do {\n res *= 10;\n res += c - '0';\n c = read();\n } while ('0' <= c && c <= '9');\n return res;\n } catch (Exception e) {\n return -1;\n }\n }\n\n\n }\n\nclass MyPrintWriter {\n PrintWriter out;\n\n public MyPrintWriter(OutputStream outputStream) {\n out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public MyPrintWriter(Writer writer) {\n out = new PrintWriter(writer);\n }\n\n public void println(Object... os) {\n for (int i = 0; i < os.length - 1; i++) {\n out.print(os[i]);\n out.print(' ');\n }\n out.println(os[os.length - 1]);\n }\n\n public void close() {\n out.close();\n }\n\n }\n\nclass MathUtils {\n\n public static int[] generatePrimes(int upTo) {\n int N = upTo;\n boolean[] isPrime = generatePrimaryTable(N);\n int m = 0;\n for (boolean p : isPrime) if (p) m++;\n int[] res = new int[m];\n m = 0;\n for (int i = 0; i < isPrime.length; i++) {\n if (isPrime[i]) res[m++] = i;\n }\n return res;\n }\n\n public static boolean[] generatePrimaryTable(int n) {\n boolean[] isPrime = new boolean[n];\n Arrays.fill(isPrime, true);\n if (0 < n) isPrime[0] = false;\n if (1 < n) isPrime[1] = false;\n for (int i = 2; i * i < n; i++) {\n if (isPrime[i]) {\n for (int j = i * i; j < n; j += i)\n isPrime[j] = false;\n }\n }\n return isPrime;\n }\n\n }\n", "lang_cluster": "Java", "tags": ["two pointers", "dp", "brute force"], "code_uid": "63652ecb40f34605630b7afdf1847302", "src_uid": "6d898638531e4713774bbd5d47e827bf", "difficulty": 2800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.IOException;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.ArrayList;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.Writer;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author emotionalBlind\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n TaskE solver = new TaskE();\n solver.solve(1, in, out);\n out.close();\n }\n}\n\nclass TaskE {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n long l = in.readLong();\n long r = in.readLong();\n int p = in.readInt();\n\n boolean[] is_prime = Prime.GetIsPrimeList(100);\n long[] v = new long[3000000];\n v[0] = 1;\n int e = 1;\n for (int i = 2; i < 100; ++i) {\n if (is_prime[i]) {\n int ee = e;\n for (int j = 0; j < ee; ++j) {\n long temp = v[j];\n while (temp * i <= r) {\n temp *= i;\n v[e++] = temp;\n }\n }\n }\n }\n long[] D = new long[v.length];\n boolean [] good = new boolean[D.length];\n\n Arrays.sort(v, 0, e);\n\n for (int i = 1; i < e; ++i) {\n D[i] = 200;\n }\n good[0] = true;\n\n for (int i = 2; i <= p; ++i) {\n int j = 0;\n int k = 0;\n while (true) {\n long temp = v[j] * i;\n while (k < e && v[k] < temp) k++;\n if (k == e) break;\n if (v[k] == temp && D[k] > D[j] + 1) {\n D[k] = D[j] + 1;\n if (D[k] + i <= p) {\n good[k] = true;\n }\n }\n j++;\n }\n }\n long res = 0;\n for (int i = 0; i < e; ++i) {\n if (l <= v[i] && v[i] <= r && good[i]) {\n res++;\n }\n }\n out.printLine(res);\n }\n}\n\nclass InputReader {\n\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n // InputMismatchException -> UnknownError\n if (numChars == -1)\n throw new UnknownError();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new UnknownError();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n } else if (c == '+') {\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public long readLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public static boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n }\n\nclass OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(outputStream);\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void print(Object...objects) {\n for (int i = 0; i < objects.length; i++) {\n if (i != 0)\n writer.print(' ');\n writer.print(objects[i]);\n }\n }\n\n public void printLine(Object...objects) {\n print(objects);\n writer.println();\n }\n\n public void close() {\n writer.close();\n }\n\n}\n\nclass Prime {\n // returns a list of n + 1 boolean, 0 to n - 1.\n // ith value true means i is prime, false means i is not a prime.\n public static boolean[] GetIsPrimeList(int n) {\n boolean[] res = new boolean[n + 1];\n for (int i = 0; i < res.length; ++i) {\n res[i] = true;\n }\n res[0] = false;\n res[1] = false;\n for (int i = 2; i * i < res.length; ++i) {\n if (res[i] == true) {\n for (int j = i * i; j < res.length; j += i) {\n res[j] = false;\n }\n }\n }\n return res;\n }\n\n }\n", "lang_cluster": "Java", "tags": ["two pointers", "dp", "brute force"], "code_uid": "13331ecae472be0e4e84c5fddfc3bb6f", "src_uid": "6d898638531e4713774bbd5d47e827bf", "difficulty": 2800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class E {\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\tboolean eof;\n\n\tstatic final int[] PS = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41,\n\t\t\t43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97 };\n\n\tint l, r, p;\n\tList<Integer> goodAL = new ArrayList<>();\n\n\tstatic int[] toIntArray(List<Integer> a) {\n\t\tint[] ret = new int[a.size()];\n\t\tint i = 0;\n\t\tfor (Integer x : a) {\n\t\t\tret[i++] = x;\n\t\t}\n\t\treturn ret;\n\t}\n\n\tvoid dfs(int x, int i) {\n\t\tif (i == PS.length) {\n\t\t\treturn;\n\t\t}\n\t\tdfs(x, i + 1);\n\t\tlong next = (long) x * PS[i];\n\t\tif (next <= r) {\n\t\t\tgoodAL.add((int) next);\n\t\t\tdfs((int) next, i);\n\t\t}\n\t}\n\n\tvoid solve() throws IOException {\n\t\tl = nextInt();\n\t\tr = nextInt();\n\t\tp = nextInt();\n\t\tgoodAL.add(1);\n\t\tdfs(1, 0);\n\t\tint[] good = toIntArray(goodAL);\n\t\tArrays.sort(good);\n\n\t\tint n = good.length;\n\n\t\tint[] dp = new int[n];\n\t\tint oo = Integer.MAX_VALUE / 3;\n\t\tArrays.fill(dp, oo);\n\t\tdp[0] = 0;\n\t\tfor (int x = 2; x <= p; x++) {\n\t\t\tfor (int i = 0, j = 0; i < n; i++) {\n\t\t\t\tlong needL = (long) good[i] * x;\n\t\t\t\tif (needL > r) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\twhile (j < n && good[j] < needL) {\n\t\t\t\t\tj++;\n\t\t\t\t}\n\t\t\t\tif (j == n || good[j] != needL) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (dp[i] + x < p) {\n\t\t\t\t\tdp[j] = Math.min(dp[j], dp[i] + 1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tint ans = 0;\n\t\t\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (good[i] >= l && dp[i] != oo) {\n\t\t\t\tans++;\n\t\t\t}\n\t\t}\n\t\t\n\t\tout.println(ans);\n\t}\n\n\tE() throws IOException {\n\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.close();\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew E();\n\t}\n\n\tString nextToken() {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (Exception e) {\n\t\t\t\teof = true;\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tString nextString() {\n\t\ttry {\n\t\t\treturn br.readLine();\n\t\t} catch (IOException e) {\n\t\t\teof = true;\n\t\t\treturn null;\n\t\t}\n\t}\n\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n}", "lang_cluster": "Java", "tags": ["two pointers", "dp", "brute force"], "code_uid": "658f789ddd610c568cda2c1e48fdb374", "src_uid": "6d898638531e4713774bbd5d47e827bf", "difficulty": 2800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class E {\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\tboolean eof;\n\n\tstatic final int[] PS = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41,\n\t\t\t43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97 };\n\n\tint l, r, p;\n\tList<Integer> goodAL = new ArrayList<>();\n\n\tstatic int[] toIntArray(List<Integer> a) {\n\t\tint[] ret = new int[a.size()];\n\t\tint i = 0;\n\t\tfor (Integer x : a) {\n\t\t\tret[i++] = x;\n\t\t}\n\t\treturn ret;\n\t}\n\n\tvoid dfs(int x, int i) {\n\t\tif (i == PS.length) {\n\t\t\treturn;\n\t\t}\n\t\tdfs(x, i + 1);\n\t\tif (x <= r / PS[i]) {\n\t\t\tint next = x * PS[i];\n\t\t\tgoodAL.add(next);\n\t\t\tdfs(next, i);\n\t\t}\n\t}\n\n\tvoid solve() throws IOException {\n\t\tl = nextInt();\n\t\tr = nextInt();\n\t\tp = nextInt();\n\t\tgoodAL.add(1);\n\t\tdfs(1, 0);\n\t\tint[] good = toIntArray(goodAL);\n\t\tArrays.sort(good);\n\n\t\tint n = good.length;\n\n\t\tint[] dp = new int[n];\n\t\tint oo = Integer.MAX_VALUE / 3;\n\t\tArrays.fill(dp, oo);\n\t\tdp[0] = 0;\n\t\tfor (int x = 2; x <= p; x++) {\n\t\t\tfor (int i = 0, j = 0; i < n; i++) {\n\t\t\t\tlong needL = (long) good[i] * x;\n\t\t\t\tif (needL > r) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\twhile (j < n && good[j] < needL) {\n\t\t\t\t\tj++;\n\t\t\t\t}\n\t\t\t\tif (j == n || good[j] != needL) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (dp[i] + x < p && dp[j] > dp[i] + 1) {\n\t\t\t\t\tdp[j] = dp[i] + 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint ans = 0;\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (good[i] >= l && dp[i] != oo) {\n\t\t\t\tans++;\n\t\t\t}\n\t\t}\n\n\t\tout.println(ans);\n\t}\n\n\tE() throws IOException {\n\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.close();\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew E();\n\t}\n\n\tString nextToken() {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (Exception e) {\n\t\t\t\teof = true;\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tString nextString() {\n\t\ttry {\n\t\t\treturn br.readLine();\n\t\t} catch (IOException e) {\n\t\t\teof = true;\n\t\t\treturn null;\n\t\t}\n\t}\n\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n}", "lang_cluster": "Java", "tags": ["two pointers", "dp", "brute force"], "code_uid": "d65bfdf0303da210dbac061ba1caf08c", "src_uid": "6d898638531e4713774bbd5d47e827bf", "difficulty": 2800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\n\tpublic void run() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong n = sc.nextLong();\n\t\tSystem.out.println(f(n));\n\t}\n\n\tlong f(long n) {\n\t\tint Len = (int) 4e5;\n\t\tlong[] pi_upper = new long[Len];\n\t\tlong[] pi_lower = new long[Len];\n\t\tfor (int i = 1; i < Len; ++i) {\n\t\t\tpi_lower[i] = i;\n\t\t\tpi_upper[i] = n / i;\n\t\t}\n\t\tboolean[] isPrime = new boolean[Len];\n\t\tArrays.fill(isPrime, true);\n\t\tisPrime[0] = false;\n\t\tisPrime[1] = false;\n\n\t\tArrayList<Integer> primeList = new ArrayList<>();\n\t\tfor (int i = 2; i < isPrime.length; ++i) {\n\t\t\tif (!isPrime[i]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tprimeList.add(i);\n\t\t\tfor (int j = i * 2; j < isPrime.length; j += i) {\n\t\t\t\tisPrime[j] = false;\n\t\t\t}\n\t\t}\n\t\tfor (int t = 0; t < primeList.size(); ++t) {\n\t\t\tint p = primeList.get(t);\n\t\t\tfor (int i = 1; i < Len && n / i >= (long) p * p; ++i) {\n\t\t\t\tpi_upper[i] -= ((long) p * i < Len ? pi_upper[p * i] : pi_lower[(int) (n / i / p)]) - (t + 1);\n\t\t\t}\n\t\t\tfor (int i = Len - 1; i >= (long) p * p; --i) {\n\t\t\t\tpi_lower[i] -= pi_lower[i / p] - (t + 1);\n\t\t\t}\n\t\t}\n\t\tlong ans = 0;\n\t\tfor (long p : primeList) {\n\t\t\tif (p * p > n) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (p * p * p <= n && p * p * p > 0) {\n\t\t\t\t++ans;\n\t\t\t}\n\t\t\tif (n / p > p) {\n\t\t\t\tif (p < Len)\n\t\t\t\t\tans += pi_upper[(int) p] - pi_lower[(int) p];\n\t\t\t\telse\n\t\t\t\t\tans += pi_lower[(int) (n / p)] - pi_lower[(int) p];\n\t\t\t}\n\t\t}\n\t\treturn ans;\n\t}\n\n\tvoid tr(Object... objects) {\n\t\tSystem.out.println(Arrays.deepToString(objects));\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "dp", "sortings", "data structures", "two pointers", "number theory"], "code_uid": "1cfa3a8cbbdd21db2e7dba8d8523d910", "src_uid": "ffb7762f1d60dc3f16e9b27ea0ecdd7d", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "//package ecr012;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class F3 {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"100000000000\";\n\t\n\tpublic static int[] sieveEratosthenes(int n) {\n\t\tif (n <= 32) {\n\t\t\tint[] primes = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };\n\t\t\tfor (int i = 0; i < primes.length; i++) {\n\t\t\t\tif (n < primes[i]) {\n\t\t\t\t\treturn Arrays.copyOf(primes, i);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn primes;\n\t\t}\n\n\t\tint u = n + 32;\n\t\tdouble lu = Math.log(u);\n\t\tint[] ret = new int[(int) (u / lu + u / lu / lu * 1.5)];\n\t\tret[0] = 2;\n\t\tint pos = 1;\n\n\t\tint[] isnp = new int[(n + 1) / 32 / 2 + 1];\n\t\tint sup = (n + 1) / 32 / 2 + 1;\n\n\t\tint[] tprimes = { 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };\n\t\tfor (int tp : tprimes) {\n\t\t\tret[pos++] = tp;\n\t\t\tint[] ptn = new int[tp];\n\t\t\tfor (int i = (tp - 3) / 2; i < tp << 5; i += tp)\n\t\t\t\tptn[i >> 5] |= 1 << (i & 31);\n\t\t\tfor (int j = 0; j < sup; j += tp) {\n\t\t\t\tfor (int i = 0; i < tp && i + j < sup; i++) {\n\t\t\t\t\tisnp[j + i] |= ptn[i];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// 3,5,7\n\t\t// 2x+3=n\n\t\tint[] magic = { 0, 1, 23, 2, 29, 24, 19, 3, 30, 27, 25, 11, 20, 8, 4, 13, 31, 22, 28, 18, 26, 10, 7, 12, 21, 17,\n\t\t\t\t9, 6, 16, 5, 15, 14 };\n\t\tint h = n / 2;\n\t\tfor (int i = 0; i < sup; i++) {\n\t\t\tfor (int j = ~isnp[i]; j != 0; j &= j - 1) {\n\t\t\t\tint pp = i << 5 | magic[(j & -j) * 0x076be629 >>> 27];\n\t\t\t\tint p = 2 * pp + 3;\n\t\t\t\tif (p > n)\n\t\t\t\t\tbreak;\n\t\t\t\tret[pos++] = p;\n\t\t\t\tif ((long) p * p > n)\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (int q = (p * p - 3) / 2; q <= h; q += p)\n\t\t\t\t\tisnp[q >> 5] |= 1 << q;\n\t\t\t}\n\t\t}\n\n\t\treturn Arrays.copyOf(ret, pos);\n\t}\n\n\tint[] primes = sieveEratosthenes(400000);\n\t\n\tvoid solve()\n\t{\n\t\tlong n = nl();\n\t\tlong ans = 0;\n\t\tMeisselLehmer2 ml = new MeisselLehmer2(n/2);\n\t\tfor(int i = 0;i < primes.length;i++) {\n\t\t\tlong plus = ml.pi(n/primes[i]) - (i+1);\n\t\t\tif(plus <= 0)break;\n\t\t\tans += plus;\n\t\t}\n\t\t\n\t\tfor(int p : primes) {\n\t\t\tif((long)p*p*p <= n) {\n\t\t\t\tans++;\n\t\t\t}else {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tout.println(ans);\n\t}\n\t\n\tpublic static class MeisselLehmer2 {\n\t\tint[] primes;\n//\t\tint[] cump;\n\t\tint[] xcums;\n\t\tlong[] isp;\n\t\t\n\t\tint cachelimit;\n//\t\tMap<Long, Long> picache;\n//\t\tMap<Long, Long> phicache;\n\t\tLongHashCounterL picache;\n\t\tLongHashCounterL phicache;\n\t\tboolean cachePhi = false;\n\t\t\n\t\tint[][] cumps;\n//\t\tint[] FP = {2,3,5,7,11,13,17};\n\t\tint[] FP = {2,3,5,7,11,13,17,19};\n\t\tint M = FP.length;\n\t\t\n\t\tint B = 100;\n\t\t// 10^14 -> 200\n\t\t// 10^14/8 -> 100~200\n\n\t\tpublic MeisselLehmer2(long n)\n\t\t{\n\t\t\tassert n >= 4;\n//\t\t\tpicache = new HashMap<>();\n//\t\t\tphicache = new HashMap<>();\n\t\t\tpicache = new LongHashCounterL();\n\t\t\tphicache = new LongHashCounterL();\n\t\t\t\n\t\t\tint s = (int)Math.sqrt(n)*B; // not overflow!\n\t\t\tcachelimit = s;\n\t\t\tthis.primes = sieveEratosthenes(s);\n\t\t\txcums = new int[(s>>>6)+1];\n\t\t\tisp = new long[(s>>>6)+1];\n\t\t\tfor(int p : primes)isp[p>>>6] |= 1L<<p;\n\t\t\tfor(int i = 0;i < xcums.length-1;i++)xcums[i+1] = xcums[i] + Long.bitCount(isp[i]);\n\t\t\t\n\t\t\tcumps = new int[M][];\n\t\t\tboolean[] b = {true};\n\t\t\tint len = 1;\n\t\t\tfor(int i = 0;i < M;i++){\n\t\t\t\tlen *= FP[i];\n\t\t\t\tboolean[] c = new boolean[len];\n\t\t\t\tfor(int j = 0;j < FP[i];j++){\n\t\t\t\t\tSystem.arraycopy(b, 0, c, j*b.length, b.length);\n\t\t\t\t}\n\t\t\t\tfor(int k = 0;k < len;k+=FP[i])c[k] = false;\n\t\t\t\tcumps[i] = new int[len+1];\n\t\t\t\tfor(int j = 0;j < len;j++)cumps[i][j+1] = cumps[i][j] + (c[j] ? 1 : 0);\n\t\t\t\tFP[i] = len;\n\t\t\t\tb = c;\n\t\t\t}\n\t\t}\n\t\t\n\t\tprivate long sqrt(long n)\n\t\t{\n\t\t\tlong i = Math.max(0, (long)Math.sqrt(n)-2);\n\t\t\twhile(i*i <= n)i++;\n\t\t\treturn i-1;\n\t\t}\n\t\t\n\t\tprivate long cbrt(long n)\n\t\t{\n\t\t\tlong i = Math.max(0, (long)Math.cbrt(n)-2);\n\t\t\twhile(i*i*i <= n)i++;\n\t\t\treturn i-1;\n\t\t}\n\t\t\n\t\tpublic long pi(long x)\n\t\t{\n\t\t\tif(x <= cachelimit){\n\t\t\t\tint ix = (int)x;\n\t\t\t\treturn xcums[ix>>>6] + Long.bitCount(isp[ix>>>6]<<~ix);\n//\t\t\t\treturn cump[(int)x];\n\t\t\t}\n\t\t\tif(picache.containsKey(x))return picache.get(x);\n\t\t\t\n\t\t\tint A = (int)pi(sqrt(sqrt(x)));\n\t\t\tlong ret = A + phi(x, A) - P2(x, A) - P3(x, A) - 1;\n\t\t\tpicache.put(x, ret);\n\t\t\treturn ret;\n\t\t}\n\t\t\n\t\tprivate long phi(long x, int A)\n\t\t{\n\t\t\tif(A > 0 && A-1 < M){\n\t\t\t\treturn cumps[A-1][FP[A-1]] * (x/FP[A-1]) + cumps[A-1][(int)(x%FP[A-1]+1)];\n\t\t\t}\n\t\t\tif(A > 0 && x <= (long)primes[A-1]*primes[A-1]){\n\t\t\t\treturn pi(x) - A + 1;\n\t\t\t}\n//\t\t\tlong code = x<<13|A;\n//\t\t\tif(phicache.containsKey(code))return phicache.get(code);\n\t\t\t\n\t\t\tlong ret = x;\n\t\t\tfor(int i = A-1;i >= 0;i--)ret -= phi(x/primes[i], i);\n\t\t\t\n//\t\t\tif(cachePhi)phicache.put(code, ret);\n\t\t\treturn ret;\n\t\t}\n\t\t\n\t\tprivate long P2(long x, int A)\n\t\t{\n\t\t\tint B = (int)pi(sqrt(x));\n\t\t\tlong ret = 0;\n\t\t\tfor(int i = A;i < B;i++){\n\t\t\t\tret += pi(x/primes[i]);\n\t\t\t}\n\t\t\tret -= (long)(B-A)*(B+A-1)/2;\n\t\t\treturn ret;\n\t\t}\n\t\t\n\t\tprivate long P3(long x, int A)\n\t\t{\n\t\t\tint C = (int)pi(cbrt(x));\n\t\t\tlong ret = 0;\n\t\t\tfor(int i = A;i < C;i++){\n\t\t\t\tlong xi = x/primes[i];\n\t\t\t\tint B = (int)pi(sqrt(xi));\n\t\t\t\tfor(int j = i;j < B;j++){\n\t\t\t\t\tret += pi(xi/primes[j]) - j;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\t\t\n\t\tpublic static int[] sieveEratosthenes(int n) {\n\t\t\tif (n <= 32) {\n\t\t\t\tint[] primes = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };\n\t\t\t\tfor (int i = 0; i < primes.length; i++) {\n\t\t\t\t\tif (n < primes[i]) {\n\t\t\t\t\t\treturn Arrays.copyOf(primes, i);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn primes;\n\t\t\t}\n\n\t\t\tint u = n + 32;\n\t\t\tdouble lu = Math.log(u);\n\t\t\tint[] ret = new int[(int) (u / lu + u / lu / lu * 1.5)];\n\t\t\tret[0] = 2;\n\t\t\tint pos = 1;\n\n\t\t\tint[] isnp = new int[(n + 1) / 32 / 2 + 1];\n\t\t\tint sup = (n + 1) / 32 / 2 + 1;\n\n\t\t\tint[] tprimes = { 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };\n\t\t\tfor (int tp : tprimes) {\n\t\t\t\tret[pos++] = tp;\n\t\t\t\tint[] ptn = new int[tp];\n\t\t\t\tfor (int i = (tp - 3) / 2; i < tp << 5; i += tp)\n\t\t\t\t\tptn[i >> 5] |= 1 << (i & 31);\n\t\t\t\tfor (int j = 0; j < sup; j += tp) {\n\t\t\t\t\tfor (int i = 0; i < tp && i + j < sup; i++) {\n\t\t\t\t\t\tisnp[j + i] |= ptn[i];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// 3,5,7\n\t\t\t// 2x+3=n\n\t\t\tint[] magic = { 0, 1, 23, 2, 29, 24, 19, 3, 30, 27, 25, 11, 20, 8, 4, 13, 31, 22, 28, 18, 26, 10, 7, 12, 21, 17,\n\t\t\t\t\t9, 6, 16, 5, 15, 14 };\n\t\t\tint h = n / 2;\n\t\t\tfor (int i = 0; i < sup; i++) {\n\t\t\t\tfor (int j = ~isnp[i]; j != 0; j &= j - 1) {\n\t\t\t\t\tint pp = i << 5 | magic[(j & -j) * 0x076be629 >>> 27];\n\t\t\t\t\tint p = 2 * pp + 3;\n\t\t\t\t\tif (p > n)\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tret[pos++] = p;\n\t\t\t\t\tif ((long) p * p > n)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tfor (int q = (p * p - 3) / 2; q <= h; q += p)\n\t\t\t\t\t\tisnp[q >> 5] |= 1 << q;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn Arrays.copyOf(ret, pos);\n\t\t}\n\t\t\n\t\tprivate static class LongHashCounterL {\n\t\t\tpublic long[] keys;\n\t\t\tpublic long[] allocated;\n\t\t\tprivate int scale = 1<<2;\n\t\t\tprivate int rscale = 1<<1;\n\t\t\tprivate int mask = scale-1;\n\t\t\tpublic int size = 0;\n\t\t\t\n\t\t\tpublic LongHashCounterL(){\n\t\t\t\tallocated = new long[scale];\n\t\t\t\tArrays.fill(allocated, NG);\n\t\t\t\tkeys = new long[scale];\n\t\t\t}\n\t\t\t\n\t\t\t// if value is NG, entry is removed. (e.g. 0)\n\t\t\tprivate static final int NG = 0;\n\t\t\t\n\t\t\tpublic boolean containsKey(long x)\n\t\t\t{\n\t\t\t\tint pos = h(x)&mask;\n\t\t\t\twhile(allocated[pos] != NG){\n\t\t\t\t\tif(x == keys[pos])return true;\n\t\t\t\t\tpos = pos+1&mask;\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\t\n\t\t\tpublic long get(long x)\n\t\t\t{\n\t\t\t\tint pos = h(x)&mask;\n\t\t\t\twhile(allocated[pos] != NG){\n\t\t\t\t\tif(x == keys[pos])return allocated[pos];\n\t\t\t\t\tpos = pos+1&mask;\n\t\t\t\t}\n\t\t\t\treturn NG;\n\t\t\t}\n\t\t\t\n\t\t\tpublic long put(long x, long v)\n\t\t\t{\n\t\t\t\tint pos = h(x)&mask;\n\t\t\t\twhile(allocated[pos] != NG){\n\t\t\t\t\tif(x == keys[pos]){\n\t\t\t\t\t\tlong oldval = allocated[pos];\n\t\t\t\t\t\tallocated[pos] = v;\n\t\t\t\t\t\treturn oldval;\n\t\t\t\t\t}\n\t\t\t\t\tpos = pos+1&mask;\n\t\t\t\t}\n\t\t\t\tif(size == rscale){\n\t\t\t\t\tresizeAndPut(x, v);\n\t\t\t\t}else{\n\t\t\t\t\tkeys[pos] = x;\n\t\t\t\t\tallocated[pos] = v;\n\t\t\t\t}\n\t\t\t\tsize++;\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\t\n\t\t\tpublic long inc(long x, long v)\n\t\t\t{\n\t\t\t\tint pos = h(x)&mask;\n\t\t\t\twhile(allocated[pos] != NG){\n\t\t\t\t\tif(x == keys[pos]){\n\t\t\t\t\t\tallocated[pos] += v;\n\t\t\t\t\t\treturn allocated[pos];\n\t\t\t\t\t}\n\t\t\t\t\tpos = pos+1&mask;\n\t\t\t\t}\n\t\t\t\tif(size == rscale){\n\t\t\t\t\tresizeAndPut(x, v);\n\t\t\t\t}else{\n\t\t\t\t\tkeys[pos] = x;\n\t\t\t\t\tallocated[pos] = v;\n\t\t\t\t}\n\t\t\t\tsize++;\n\t\t\t\treturn v;\n\t\t\t}\n\t\t\t\n\t\t\tpublic boolean remove(long x)\n\t\t\t{\n\t\t\t\tint pos = h(x)&mask;\n\t\t\t\twhile(allocated[pos] != NG){\n\t\t\t\t\tif(x == keys[pos]){\n\t\t\t\t\t\tsize--;\n\t\t\t\t\t\t// take last and fill rmpos\n\t\t\t\t\t\tint last = pos;\n\t\t\t\t\t\tpos = pos+1&mask;\n\t\t\t\t\t\twhile(allocated[pos] != NG){\n\t\t\t\t\t\t\tint lh = h(keys[pos])&mask;\n\t\t\t\t\t\t\t// lh <= last < pos\n\t\t\t\t\t\t\tif(\n\t\t\t\t\t\t\t\t\tlh <= last && last < pos ||\n\t\t\t\t\t\t\t\t\tpos < lh && lh <= last ||\n\t\t\t\t\t\t\t\t\tlast < pos && pos < lh\n\t\t\t\t\t\t\t\t\t){\n\t\t\t\t\t\t\t\tkeys[last] = keys[pos];\n\t\t\t\t\t\t\t\tallocated[last] = allocated[pos];\n\t\t\t\t\t\t\t\tlast = pos;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tpos = pos+1&mask;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tkeys[last] = 0;\n\t\t\t\t\t\tallocated[last] = NG;\n\t\t\t\t\t\t\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t\tpos = pos+1&mask;\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\t\n\t\t\tprivate void resizeAndPut(long x, long v)\n\t\t\t{\n\t\t\t\tint nscale = scale<<1;\n\t\t\t\tint nrscale = rscale<<1;\n\t\t\t\tint nmask = nscale-1;\n\t\t\t\tlong[] nallocated = new long[nscale];\n\t\t\t\tArrays.fill(nallocated, NG);\n\t\t\t\tlong[] nkeys = new long[nscale];\n\t\t\t\tfor(int i = next(0);i < scale;i = next(i+1)){\n\t\t\t\t\tlong y = keys[i];\n\t\t\t\t\tint pos = h(y)&nmask;\n\t\t\t\t\twhile(nallocated[pos] != NG)pos = pos+1&nmask;\n\t\t\t\t\tnkeys[pos] = y;\n\t\t\t\t\tnallocated[pos] = allocated[i];\n\t\t\t\t}\n\t\t\t\t{\n\t\t\t\t\tint pos = h(x)&nmask;\n\t\t\t\t\twhile(nallocated[pos] != NG)pos = pos+1&nmask;\n\t\t\t\t\tnkeys[pos] = x;\n\t\t\t\t\tnallocated[pos] = v;\n\t\t\t\t}\n\t\t\t\tallocated = nallocated;\n\t\t\t\tkeys = nkeys;\n\t\t\t\tscale = nscale;\n\t\t\t\trscale = nrscale;\n\t\t\t\tmask = nmask;\n\t\t\t}\n\t\t\t\n\t\t\tpublic int next(int itr)\n\t\t\t{\n\t\t\t\twhile(itr < scale && allocated[itr] == NG)itr++;\n\t\t\t\treturn itr;\n\t\t\t}\n\t\t\t\n\t\t\tprivate int h(long x)\n\t\t\t{\n\t\t\t\tx ^= x>>>33;\n\t\t\t\tx *= 0xff51afd7ed558ccdL;\n\t\t\t\tx ^= x>>>33;\n\t\t\t\tx *= 0xc4ceb9fe1a85ec53L;\n\t\t\t\tx ^= x>>>33;\n\t\t\t\treturn (int)x;\n\t\t\t}\n\t\t\t\n\t\t\t@Override\n\t\t\tpublic String toString()\n\t\t\t{\n\t\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\t\tfor(int i = next(0);i < scale;i = next(i+1)){\n\t\t\t\t\tsb.append(\",\");\n\t\t\t\t\tsb.append(keys[i] + \":\" + allocated[i]);\n\t\t\t\t}\n\t\t\t\treturn sb.length() == 0 ? \"\" : sb.substring(1);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new F3().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["math", "dp", "sortings", "data structures", "two pointers", "number theory"], "code_uid": "58afadd2c800a810c1270b6660a212be", "src_uid": "ffb7762f1d60dc3f16e9b27ea0ecdd7d", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "//package ecr012;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class F3 {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tpublic static int[] sieveEratosthenes(int n) {\n\t\tif (n <= 32) {\n\t\t\tint[] primes = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };\n\t\t\tfor (int i = 0; i < primes.length; i++) {\n\t\t\t\tif (n < primes[i]) {\n\t\t\t\t\treturn Arrays.copyOf(primes, i);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn primes;\n\t\t}\n\n\t\tint u = n + 32;\n\t\tdouble lu = Math.log(u);\n\t\tint[] ret = new int[(int) (u / lu + u / lu / lu * 1.5)];\n\t\tret[0] = 2;\n\t\tint pos = 1;\n\n\t\tint[] isnp = new int[(n + 1) / 32 / 2 + 1];\n\t\tint sup = (n + 1) / 32 / 2 + 1;\n\n\t\tint[] tprimes = { 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };\n\t\tfor (int tp : tprimes) {\n\t\t\tret[pos++] = tp;\n\t\t\tint[] ptn = new int[tp];\n\t\t\tfor (int i = (tp - 3) / 2; i < tp << 5; i += tp)\n\t\t\t\tptn[i >> 5] |= 1 << (i & 31);\n\t\t\tfor (int j = 0; j < sup; j += tp) {\n\t\t\t\tfor (int i = 0; i < tp && i + j < sup; i++) {\n\t\t\t\t\tisnp[j + i] |= ptn[i];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// 3,5,7\n\t\t// 2x+3=n\n\t\tint[] magic = { 0, 1, 23, 2, 29, 24, 19, 3, 30, 27, 25, 11, 20, 8, 4, 13, 31, 22, 28, 18, 26, 10, 7, 12, 21, 17,\n\t\t\t\t9, 6, 16, 5, 15, 14 };\n\t\tint h = n / 2;\n\t\tfor (int i = 0; i < sup; i++) {\n\t\t\tfor (int j = ~isnp[i]; j != 0; j &= j - 1) {\n\t\t\t\tint pp = i << 5 | magic[(j & -j) * 0x076be629 >>> 27];\n\t\t\t\tint p = 2 * pp + 3;\n\t\t\t\tif (p > n)\n\t\t\t\t\tbreak;\n\t\t\t\tret[pos++] = p;\n\t\t\t\tif ((long) p * p > n)\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (int q = (p * p - 3) / 2; q <= h; q += p)\n\t\t\t\t\tisnp[q >> 5] |= 1 << q;\n\t\t\t}\n\t\t}\n\n\t\treturn Arrays.copyOf(ret, pos);\n\t}\n\n\tint[] primes = sieveEratosthenes(400000);\n\t\n\tvoid solve()\n\t{\n\t\tlong n = nl();\n\t\tlong ans = 0;\n\t\tMeisselLehmer2 ml = new MeisselLehmer2(n/2);\n\t\tfor(int i = 0;i < primes.length;i++) {\n\t\t\tlong plus = ml.pi(n/primes[i]) - (i+1);\n\t\t\tif(plus <= 0)break;\n\t\t\tans += plus;\n\t\t}\n\t\t\n\t\tfor(int p : primes) {\n\t\t\tif((long)p*p*p <= n) {\n\t\t\t\tans++;\n\t\t\t}else {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tout.println(ans);\n\t}\n\t\n\tpublic static class MeisselLehmer2 {\n\t\tint[] primes;\n//\t\tint[] cump;\n\t\tint[] xcums;\n\t\tlong[] isp;\n\t\t\n\t\tint cachelimit;\n//\t\tMap<Long, Long> picache;\n//\t\tMap<Long, Long> phicache;\n\t\tLongHashCounterL picache;\n\t\tLongHashCounterL phicache;\n\t\tboolean cachePhi = false;\n\t\t\n\t\tint[][] cumps;\n//\t\tint[] FP = {2,3,5,7,11,13,17};\n\t\tint[] FP = {2,3,5,7,11,13,17,19};\n\t\tint M = FP.length;\n\t\t\n\t\tint B = 100;\n\t\t// 10^14 -> 200\n\t\t// 10^14/8 -> 100~200\n\n\t\tpublic MeisselLehmer2(long n)\n\t\t{\n\t\t\tassert n >= 4;\n//\t\t\tpicache = new HashMap<>();\n//\t\t\tphicache = new HashMap<>();\n\t\t\tpicache = new LongHashCounterL();\n\t\t\tphicache = new LongHashCounterL();\n\t\t\t\n\t\t\tint s = (int)Math.sqrt(n)*B; // not overflow!\n\t\t\tcachelimit = s;\n\t\t\tthis.primes = sieveEratosthenes(s);\n\t\t\txcums = new int[(s>>>6)+1];\n\t\t\tisp = new long[(s>>>6)+1];\n\t\t\tfor(int p : primes)isp[p>>>6] |= 1L<<p;\n\t\t\tfor(int i = 0;i < xcums.length-1;i++)xcums[i+1] = xcums[i] + Long.bitCount(isp[i]);\n\t\t\t\n\t\t\tcumps = new int[M][];\n\t\t\tboolean[] b = {true};\n\t\t\tint len = 1;\n\t\t\tfor(int i = 0;i < M;i++){\n\t\t\t\tlen *= FP[i];\n\t\t\t\tboolean[] c = new boolean[len];\n\t\t\t\tfor(int j = 0;j < FP[i];j++){\n\t\t\t\t\tSystem.arraycopy(b, 0, c, j*b.length, b.length);\n\t\t\t\t}\n\t\t\t\tfor(int k = 0;k < len;k+=FP[i])c[k] = false;\n\t\t\t\tcumps[i] = new int[len+1];\n\t\t\t\tfor(int j = 0;j < len;j++)cumps[i][j+1] = cumps[i][j] + (c[j] ? 1 : 0);\n\t\t\t\tFP[i] = len;\n\t\t\t\tb = c;\n\t\t\t}\n\t\t}\n\t\t\n\t\tprivate long sqrt(long n)\n\t\t{\n\t\t\tlong i = Math.max(0, (long)Math.sqrt(n)-2);\n\t\t\twhile(i*i <= n)i++;\n\t\t\treturn i-1;\n\t\t}\n\t\t\n\t\tprivate long cbrt(long n)\n\t\t{\n\t\t\tlong i = Math.max(0, (long)Math.cbrt(n)-2);\n\t\t\twhile(i*i*i <= n)i++;\n\t\t\treturn i-1;\n\t\t}\n\t\t\n\t\tpublic long pi(long x)\n\t\t{\n\t\t\tif(x <= cachelimit){\n\t\t\t\tint ix = (int)x;\n\t\t\t\treturn xcums[ix>>>6] + Long.bitCount(isp[ix>>>6]<<~ix);\n//\t\t\t\treturn cump[(int)x];\n\t\t\t}\n\t\t\tif(picache.containsKey(x))return picache.get(x);\n\t\t\t\n\t\t\tint A = (int)pi(sqrt(sqrt(x)));\n\t\t\tlong ret = A + phi(x, A) - P2(x, A) - P3(x, A) - 1;\n\t\t\tpicache.put(x, ret);\n\t\t\treturn ret;\n\t\t}\n\t\t\n\t\tprivate long phi(long x, int A)\n\t\t{\n\t\t\tif(A > 0 && A-1 < M){\n\t\t\t\treturn cumps[A-1][FP[A-1]] * (x/FP[A-1]) + cumps[A-1][(int)(x%FP[A-1]+1)];\n\t\t\t}\n\t\t\tif(A > 0 && x <= (long)primes[A-1]*primes[A-1]){\n\t\t\t\treturn pi(x) - A + 1;\n\t\t\t}\n\t\t\tlong code = x<<13|A;\n\t\t\tif(phicache.containsKey(code))return phicache.get(code);\n\t\t\t\n\t\t\tlong ret = x;\n\t\t\tfor(int i = A-1;i >= 0;i--)ret -= phi(x/primes[i], i);\n\t\t\t\n\t\t\tif(cachePhi)phicache.put(code, ret);\n\t\t\treturn ret;\n\t\t}\n\t\t\n\t\tprivate long P2(long x, int A)\n\t\t{\n\t\t\tint B = (int)pi(sqrt(x));\n\t\t\tlong ret = 0;\n\t\t\tfor(int i = A;i < B;i++){\n\t\t\t\tret += pi(x/primes[i]);\n\t\t\t}\n\t\t\tret -= (long)(B-A)*(B+A-1)/2;\n\t\t\treturn ret;\n\t\t}\n\t\t\n\t\tprivate long P3(long x, int A)\n\t\t{\n\t\t\tint C = (int)pi(cbrt(x));\n\t\t\tlong ret = 0;\n\t\t\tfor(int i = A;i < C;i++){\n\t\t\t\tlong xi = x/primes[i];\n\t\t\t\tint B = (int)pi(sqrt(xi));\n\t\t\t\tfor(int j = i;j < B;j++){\n\t\t\t\t\tret += pi(xi/primes[j]) - j;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\t\t\n\t\tpublic static int[] sieveEratosthenes(int n) {\n\t\t\tif (n <= 32) {\n\t\t\t\tint[] primes = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };\n\t\t\t\tfor (int i = 0; i < primes.length; i++) {\n\t\t\t\t\tif (n < primes[i]) {\n\t\t\t\t\t\treturn Arrays.copyOf(primes, i);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn primes;\n\t\t\t}\n\n\t\t\tint u = n + 32;\n\t\t\tdouble lu = Math.log(u);\n\t\t\tint[] ret = new int[(int) (u / lu + u / lu / lu * 1.5)];\n\t\t\tret[0] = 2;\n\t\t\tint pos = 1;\n\n\t\t\tint[] isnp = new int[(n + 1) / 32 / 2 + 1];\n\t\t\tint sup = (n + 1) / 32 / 2 + 1;\n\n\t\t\tint[] tprimes = { 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };\n\t\t\tfor (int tp : tprimes) {\n\t\t\t\tret[pos++] = tp;\n\t\t\t\tint[] ptn = new int[tp];\n\t\t\t\tfor (int i = (tp - 3) / 2; i < tp << 5; i += tp)\n\t\t\t\t\tptn[i >> 5] |= 1 << (i & 31);\n\t\t\t\tfor (int j = 0; j < sup; j += tp) {\n\t\t\t\t\tfor (int i = 0; i < tp && i + j < sup; i++) {\n\t\t\t\t\t\tisnp[j + i] |= ptn[i];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// 3,5,7\n\t\t\t// 2x+3=n\n\t\t\tint[] magic = { 0, 1, 23, 2, 29, 24, 19, 3, 30, 27, 25, 11, 20, 8, 4, 13, 31, 22, 28, 18, 26, 10, 7, 12, 21, 17,\n\t\t\t\t\t9, 6, 16, 5, 15, 14 };\n\t\t\tint h = n / 2;\n\t\t\tfor (int i = 0; i < sup; i++) {\n\t\t\t\tfor (int j = ~isnp[i]; j != 0; j &= j - 1) {\n\t\t\t\t\tint pp = i << 5 | magic[(j & -j) * 0x076be629 >>> 27];\n\t\t\t\t\tint p = 2 * pp + 3;\n\t\t\t\t\tif (p > n)\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tret[pos++] = p;\n\t\t\t\t\tif ((long) p * p > n)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tfor (int q = (p * p - 3) / 2; q <= h; q += p)\n\t\t\t\t\t\tisnp[q >> 5] |= 1 << q;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn Arrays.copyOf(ret, pos);\n\t\t}\n\t\t\n\t\tprivate static class LongHashCounterL {\n\t\t\tpublic long[] keys;\n\t\t\tpublic long[] allocated;\n\t\t\tprivate int scale = 1<<2;\n\t\t\tprivate int rscale = 1<<1;\n\t\t\tprivate int mask = scale-1;\n\t\t\tpublic int size = 0;\n\t\t\t\n\t\t\tpublic LongHashCounterL(){\n\t\t\t\tallocated = new long[scale];\n\t\t\t\tArrays.fill(allocated, NG);\n\t\t\t\tkeys = new long[scale];\n\t\t\t}\n\t\t\t\n\t\t\t// if value is NG, entry is removed. (e.g. 0)\n\t\t\tprivate static final int NG = 0;\n\t\t\t\n\t\t\tpublic boolean containsKey(long x)\n\t\t\t{\n\t\t\t\tint pos = h(x)&mask;\n\t\t\t\twhile(allocated[pos] != NG){\n\t\t\t\t\tif(x == keys[pos])return true;\n\t\t\t\t\tpos = pos+1&mask;\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\t\n\t\t\tpublic long get(long x)\n\t\t\t{\n\t\t\t\tint pos = h(x)&mask;\n\t\t\t\twhile(allocated[pos] != NG){\n\t\t\t\t\tif(x == keys[pos])return allocated[pos];\n\t\t\t\t\tpos = pos+1&mask;\n\t\t\t\t}\n\t\t\t\treturn NG;\n\t\t\t}\n\t\t\t\n\t\t\tpublic long put(long x, long v)\n\t\t\t{\n\t\t\t\tint pos = h(x)&mask;\n\t\t\t\twhile(allocated[pos] != NG){\n\t\t\t\t\tif(x == keys[pos]){\n\t\t\t\t\t\tlong oldval = allocated[pos];\n\t\t\t\t\t\tallocated[pos] = v;\n\t\t\t\t\t\treturn oldval;\n\t\t\t\t\t}\n\t\t\t\t\tpos = pos+1&mask;\n\t\t\t\t}\n\t\t\t\tif(size == rscale){\n\t\t\t\t\tresizeAndPut(x, v);\n\t\t\t\t}else{\n\t\t\t\t\tkeys[pos] = x;\n\t\t\t\t\tallocated[pos] = v;\n\t\t\t\t}\n\t\t\t\tsize++;\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\t\n\t\t\tpublic long inc(long x, long v)\n\t\t\t{\n\t\t\t\tint pos = h(x)&mask;\n\t\t\t\twhile(allocated[pos] != NG){\n\t\t\t\t\tif(x == keys[pos]){\n\t\t\t\t\t\tallocated[pos] += v;\n\t\t\t\t\t\treturn allocated[pos];\n\t\t\t\t\t}\n\t\t\t\t\tpos = pos+1&mask;\n\t\t\t\t}\n\t\t\t\tif(size == rscale){\n\t\t\t\t\tresizeAndPut(x, v);\n\t\t\t\t}else{\n\t\t\t\t\tkeys[pos] = x;\n\t\t\t\t\tallocated[pos] = v;\n\t\t\t\t}\n\t\t\t\tsize++;\n\t\t\t\treturn v;\n\t\t\t}\n\t\t\t\n\t\t\tpublic boolean remove(long x)\n\t\t\t{\n\t\t\t\tint pos = h(x)&mask;\n\t\t\t\twhile(allocated[pos] != NG){\n\t\t\t\t\tif(x == keys[pos]){\n\t\t\t\t\t\tsize--;\n\t\t\t\t\t\t// take last and fill rmpos\n\t\t\t\t\t\tint last = pos;\n\t\t\t\t\t\tpos = pos+1&mask;\n\t\t\t\t\t\twhile(allocated[pos] != NG){\n\t\t\t\t\t\t\tint lh = h(keys[pos])&mask;\n\t\t\t\t\t\t\t// lh <= last < pos\n\t\t\t\t\t\t\tif(\n\t\t\t\t\t\t\t\t\tlh <= last && last < pos ||\n\t\t\t\t\t\t\t\t\tpos < lh && lh <= last ||\n\t\t\t\t\t\t\t\t\tlast < pos && pos < lh\n\t\t\t\t\t\t\t\t\t){\n\t\t\t\t\t\t\t\tkeys[last] = keys[pos];\n\t\t\t\t\t\t\t\tallocated[last] = allocated[pos];\n\t\t\t\t\t\t\t\tlast = pos;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tpos = pos+1&mask;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tkeys[last] = 0;\n\t\t\t\t\t\tallocated[last] = NG;\n\t\t\t\t\t\t\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t\tpos = pos+1&mask;\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\t\n\t\t\tprivate void resizeAndPut(long x, long v)\n\t\t\t{\n\t\t\t\tint nscale = scale<<1;\n\t\t\t\tint nrscale = rscale<<1;\n\t\t\t\tint nmask = nscale-1;\n\t\t\t\tlong[] nallocated = new long[nscale];\n\t\t\t\tArrays.fill(nallocated, NG);\n\t\t\t\tlong[] nkeys = new long[nscale];\n\t\t\t\tfor(int i = next(0);i < scale;i = next(i+1)){\n\t\t\t\t\tlong y = keys[i];\n\t\t\t\t\tint pos = h(y)&nmask;\n\t\t\t\t\twhile(nallocated[pos] != NG)pos = pos+1&nmask;\n\t\t\t\t\tnkeys[pos] = y;\n\t\t\t\t\tnallocated[pos] = allocated[i];\n\t\t\t\t}\n\t\t\t\t{\n\t\t\t\t\tint pos = h(x)&nmask;\n\t\t\t\t\twhile(nallocated[pos] != NG)pos = pos+1&nmask;\n\t\t\t\t\tnkeys[pos] = x;\n\t\t\t\t\tnallocated[pos] = v;\n\t\t\t\t}\n\t\t\t\tallocated = nallocated;\n\t\t\t\tkeys = nkeys;\n\t\t\t\tscale = nscale;\n\t\t\t\trscale = nrscale;\n\t\t\t\tmask = nmask;\n\t\t\t}\n\t\t\t\n\t\t\tpublic int next(int itr)\n\t\t\t{\n\t\t\t\twhile(itr < scale && allocated[itr] == NG)itr++;\n\t\t\t\treturn itr;\n\t\t\t}\n\t\t\t\n\t\t\tprivate int h(long x)\n\t\t\t{\n\t\t\t\tx ^= x>>>33;\n\t\t\t\tx *= 0xff51afd7ed558ccdL;\n\t\t\t\tx ^= x>>>33;\n\t\t\t\tx *= 0xc4ceb9fe1a85ec53L;\n\t\t\t\tx ^= x>>>33;\n\t\t\t\treturn (int)x;\n\t\t\t}\n\t\t\t\n\t\t\t@Override\n\t\t\tpublic String toString()\n\t\t\t{\n\t\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\t\tfor(int i = next(0);i < scale;i = next(i+1)){\n\t\t\t\t\tsb.append(\",\");\n\t\t\t\t\tsb.append(keys[i] + \":\" + allocated[i]);\n\t\t\t\t}\n\t\t\t\treturn sb.length() == 0 ? \"\" : sb.substring(1);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new F3().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["math", "dp", "sortings", "data structures", "two pointers", "number theory"], "code_uid": "d9f69352353abc59287ec25bd69cf07b", "src_uid": "ffb7762f1d60dc3f16e9b27ea0ecdd7d", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "//package ecr012;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class F3 {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tpublic static int[] sieveEratosthenes(int n) {\n\t\tif (n <= 32) {\n\t\t\tint[] primes = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };\n\t\t\tfor (int i = 0; i < primes.length; i++) {\n\t\t\t\tif (n < primes[i]) {\n\t\t\t\t\treturn Arrays.copyOf(primes, i);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn primes;\n\t\t}\n\n\t\tint u = n + 32;\n\t\tdouble lu = Math.log(u);\n\t\tint[] ret = new int[(int) (u / lu + u / lu / lu * 1.5)];\n\t\tret[0] = 2;\n\t\tint pos = 1;\n\n\t\tint[] isnp = new int[(n + 1) / 32 / 2 + 1];\n\t\tint sup = (n + 1) / 32 / 2 + 1;\n\n\t\tint[] tprimes = { 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };\n\t\tfor (int tp : tprimes) {\n\t\t\tret[pos++] = tp;\n\t\t\tint[] ptn = new int[tp];\n\t\t\tfor (int i = (tp - 3) / 2; i < tp << 5; i += tp)\n\t\t\t\tptn[i >> 5] |= 1 << (i & 31);\n\t\t\tfor (int j = 0; j < sup; j += tp) {\n\t\t\t\tfor (int i = 0; i < tp && i + j < sup; i++) {\n\t\t\t\t\tisnp[j + i] |= ptn[i];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// 3,5,7\n\t\t// 2x+3=n\n\t\tint[] magic = { 0, 1, 23, 2, 29, 24, 19, 3, 30, 27, 25, 11, 20, 8, 4, 13, 31, 22, 28, 18, 26, 10, 7, 12, 21, 17,\n\t\t\t\t9, 6, 16, 5, 15, 14 };\n\t\tint h = n / 2;\n\t\tfor (int i = 0; i < sup; i++) {\n\t\t\tfor (int j = ~isnp[i]; j != 0; j &= j - 1) {\n\t\t\t\tint pp = i << 5 | magic[(j & -j) * 0x076be629 >>> 27];\n\t\t\t\tint p = 2 * pp + 3;\n\t\t\t\tif (p > n)\n\t\t\t\t\tbreak;\n\t\t\t\tret[pos++] = p;\n\t\t\t\tif ((long) p * p > n)\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (int q = (p * p - 3) / 2; q <= h; q += p)\n\t\t\t\t\tisnp[q >> 5] |= 1 << q;\n\t\t\t}\n\t\t}\n\n\t\treturn Arrays.copyOf(ret, pos);\n\t}\n\n\tint[] primes = sieveEratosthenes(400000);\n\t\n\tvoid solve()\n\t{\n\t\tlong n = nl();\n\t\tlong ans = 0;\n\t\tMeisselLehmer2 ml = new MeisselLehmer2(n/2);\n\t\tfor(int i = 0;i < primes.length;i++) {\n\t\t\tlong plus = ml.pi(n/primes[i]) - (i+1);\n\t\t\tif(plus <= 0)break;\n\t\t\tans += plus;\n\t\t}\n\t\t\n\t\tfor(int p : primes) {\n\t\t\tif((long)p*p*p <= n) {\n\t\t\t\tans++;\n\t\t\t}else {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tout.println(ans);\n\t}\n\t\n\tpublic static class MeisselLehmer2 {\n\t\tint[] primes;\n//\t\tint[] cump;\n\t\tint[] xcums;\n\t\tlong[] isp;\n\t\t\n\t\tint cachelimit;\n//\t\tMap<Long, Long> picache;\n//\t\tMap<Long, Long> phicache;\n\t\tLongHashCounterL picache;\n\t\tLongHashCounterL phicache;\n\t\tboolean cachePhi = true;\n\t\t\n\t\tint[][] cumps;\n//\t\tint[] FP = {2,3,5,7,11,13,17};\n\t\tint[] FP = {2,3,5,7,11,13,17,19};\n\t\tint M = FP.length;\n\t\t\n\t\tint B = 100;\n\t\t// 10^14 -> 200\n\t\t// 10^14/8 -> 100~200\n\n\t\tpublic MeisselLehmer2(long n)\n\t\t{\n\t\t\tassert n >= 4;\n//\t\t\tpicache = new HashMap<>();\n//\t\t\tphicache = new HashMap<>();\n\t\t\tpicache = new LongHashCounterL();\n\t\t\tphicache = new LongHashCounterL();\n\t\t\t\n\t\t\tint s = (int)Math.sqrt(n)*B; // not overflow!\n\t\t\tcachelimit = s;\n\t\t\tthis.primes = sieveEratosthenes(s);\n\t\t\txcums = new int[(s>>>6)+1];\n\t\t\tisp = new long[(s>>>6)+1];\n\t\t\tfor(int p : primes)isp[p>>>6] |= 1L<<p;\n\t\t\tfor(int i = 0;i < xcums.length-1;i++)xcums[i+1] = xcums[i] + Long.bitCount(isp[i]);\n\t\t\t\n\t\t\tcumps = new int[M][];\n\t\t\tboolean[] b = {true};\n\t\t\tint len = 1;\n\t\t\tfor(int i = 0;i < M;i++){\n\t\t\t\tlen *= FP[i];\n\t\t\t\tboolean[] c = new boolean[len];\n\t\t\t\tfor(int j = 0;j < FP[i];j++){\n\t\t\t\t\tSystem.arraycopy(b, 0, c, j*b.length, b.length);\n\t\t\t\t}\n\t\t\t\tfor(int k = 0;k < len;k+=FP[i])c[k] = false;\n\t\t\t\tcumps[i] = new int[len+1];\n\t\t\t\tfor(int j = 0;j < len;j++)cumps[i][j+1] = cumps[i][j] + (c[j] ? 1 : 0);\n\t\t\t\tFP[i] = len;\n\t\t\t\tb = c;\n\t\t\t}\n\t\t}\n\t\t\n\t\tprivate long sqrt(long n)\n\t\t{\n\t\t\tlong i = Math.max(0, (long)Math.sqrt(n)-2);\n\t\t\twhile(i*i <= n)i++;\n\t\t\treturn i-1;\n\t\t}\n\t\t\n\t\tprivate long cbrt(long n)\n\t\t{\n\t\t\tlong i = Math.max(0, (long)Math.cbrt(n)-2);\n\t\t\twhile(i*i*i <= n)i++;\n\t\t\treturn i-1;\n\t\t}\n\t\t\n\t\tpublic long pi(long x)\n\t\t{\n\t\t\tif(x <= cachelimit){\n\t\t\t\tint ix = (int)x;\n\t\t\t\treturn xcums[ix>>>6] + Long.bitCount(isp[ix>>>6]<<~ix);\n//\t\t\t\treturn cump[(int)x];\n\t\t\t}\n\t\t\tif(picache.containsKey(x))return picache.get(x);\n\t\t\t\n\t\t\tint A = (int)pi(sqrt(sqrt(x)));\n\t\t\tlong ret = A + phi(x, A) - P2(x, A) - P3(x, A) - 1;\n\t\t\tpicache.put(x, ret);\n\t\t\treturn ret;\n\t\t}\n\t\t\n\t\tprivate long phi(long x, int A)\n\t\t{\n\t\t\tif(A > 0 && A-1 < M){\n\t\t\t\treturn cumps[A-1][FP[A-1]] * (x/FP[A-1]) + cumps[A-1][(int)(x%FP[A-1]+1)];\n\t\t\t}\n\t\t\tif(A > 0 && x <= (long)primes[A-1]*primes[A-1]){\n\t\t\t\treturn pi(x) - A + 1;\n\t\t\t}\n\t\t\tlong code = x<<13|A;\n\t\t\tif(phicache.containsKey(code))return phicache.get(code);\n\t\t\t\n\t\t\tlong ret = x;\n\t\t\tfor(int i = A-1;i >= 0;i--)ret -= phi(x/primes[i], i);\n\t\t\t\n\t\t\tif(cachePhi)phicache.put(code, ret);\n\t\t\treturn ret;\n\t\t}\n\t\t\n\t\tprivate long P2(long x, int A)\n\t\t{\n\t\t\tint B = (int)pi(sqrt(x));\n\t\t\tlong ret = 0;\n\t\t\tfor(int i = A;i < B;i++){\n\t\t\t\tret += pi(x/primes[i]);\n\t\t\t}\n\t\t\tret -= (long)(B-A)*(B+A-1)/2;\n\t\t\treturn ret;\n\t\t}\n\t\t\n\t\tprivate long P3(long x, int A)\n\t\t{\n\t\t\tint C = (int)pi(cbrt(x));\n\t\t\tlong ret = 0;\n\t\t\tfor(int i = A;i < C;i++){\n\t\t\t\tlong xi = x/primes[i];\n\t\t\t\tint B = (int)pi(sqrt(xi));\n\t\t\t\tfor(int j = i;j < B;j++){\n\t\t\t\t\tret += pi(xi/primes[j]) - j;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\t\t\n\t\tpublic static int[] sieveEratosthenes(int n) {\n\t\t\tif (n <= 32) {\n\t\t\t\tint[] primes = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };\n\t\t\t\tfor (int i = 0; i < primes.length; i++) {\n\t\t\t\t\tif (n < primes[i]) {\n\t\t\t\t\t\treturn Arrays.copyOf(primes, i);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn primes;\n\t\t\t}\n\n\t\t\tint u = n + 32;\n\t\t\tdouble lu = Math.log(u);\n\t\t\tint[] ret = new int[(int) (u / lu + u / lu / lu * 1.5)];\n\t\t\tret[0] = 2;\n\t\t\tint pos = 1;\n\n\t\t\tint[] isnp = new int[(n + 1) / 32 / 2 + 1];\n\t\t\tint sup = (n + 1) / 32 / 2 + 1;\n\n\t\t\tint[] tprimes = { 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };\n\t\t\tfor (int tp : tprimes) {\n\t\t\t\tret[pos++] = tp;\n\t\t\t\tint[] ptn = new int[tp];\n\t\t\t\tfor (int i = (tp - 3) / 2; i < tp << 5; i += tp)\n\t\t\t\t\tptn[i >> 5] |= 1 << (i & 31);\n\t\t\t\tfor (int j = 0; j < sup; j += tp) {\n\t\t\t\t\tfor (int i = 0; i < tp && i + j < sup; i++) {\n\t\t\t\t\t\tisnp[j + i] |= ptn[i];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// 3,5,7\n\t\t\t// 2x+3=n\n\t\t\tint[] magic = { 0, 1, 23, 2, 29, 24, 19, 3, 30, 27, 25, 11, 20, 8, 4, 13, 31, 22, 28, 18, 26, 10, 7, 12, 21, 17,\n\t\t\t\t\t9, 6, 16, 5, 15, 14 };\n\t\t\tint h = n / 2;\n\t\t\tfor (int i = 0; i < sup; i++) {\n\t\t\t\tfor (int j = ~isnp[i]; j != 0; j &= j - 1) {\n\t\t\t\t\tint pp = i << 5 | magic[(j & -j) * 0x076be629 >>> 27];\n\t\t\t\t\tint p = 2 * pp + 3;\n\t\t\t\t\tif (p > n)\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tret[pos++] = p;\n\t\t\t\t\tif ((long) p * p > n)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tfor (int q = (p * p - 3) / 2; q <= h; q += p)\n\t\t\t\t\t\tisnp[q >> 5] |= 1 << q;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn Arrays.copyOf(ret, pos);\n\t\t}\n\t\t\n\t\tprivate static class LongHashCounterL {\n\t\t\tpublic long[] keys;\n\t\t\tpublic long[] allocated;\n\t\t\tprivate int scale = 1<<2;\n\t\t\tprivate int rscale = 1<<1;\n\t\t\tprivate int mask = scale-1;\n\t\t\tpublic int size = 0;\n\t\t\t\n\t\t\tpublic LongHashCounterL(){\n\t\t\t\tallocated = new long[scale];\n\t\t\t\tArrays.fill(allocated, NG);\n\t\t\t\tkeys = new long[scale];\n\t\t\t}\n\t\t\t\n\t\t\t// if value is NG, entry is removed. (e.g. 0)\n\t\t\tprivate static final int NG = 0;\n\t\t\t\n\t\t\tpublic boolean containsKey(long x)\n\t\t\t{\n\t\t\t\tint pos = h(x)&mask;\n\t\t\t\twhile(allocated[pos] != NG){\n\t\t\t\t\tif(x == keys[pos])return true;\n\t\t\t\t\tpos = pos+1&mask;\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\t\n\t\t\tpublic long get(long x)\n\t\t\t{\n\t\t\t\tint pos = h(x)&mask;\n\t\t\t\twhile(allocated[pos] != NG){\n\t\t\t\t\tif(x == keys[pos])return allocated[pos];\n\t\t\t\t\tpos = pos+1&mask;\n\t\t\t\t}\n\t\t\t\treturn NG;\n\t\t\t}\n\t\t\t\n\t\t\tpublic long put(long x, long v)\n\t\t\t{\n\t\t\t\tint pos = h(x)&mask;\n\t\t\t\twhile(allocated[pos] != NG){\n\t\t\t\t\tif(x == keys[pos]){\n\t\t\t\t\t\tlong oldval = allocated[pos];\n\t\t\t\t\t\tallocated[pos] = v;\n\t\t\t\t\t\treturn oldval;\n\t\t\t\t\t}\n\t\t\t\t\tpos = pos+1&mask;\n\t\t\t\t}\n\t\t\t\tif(size == rscale){\n\t\t\t\t\tresizeAndPut(x, v);\n\t\t\t\t}else{\n\t\t\t\t\tkeys[pos] = x;\n\t\t\t\t\tallocated[pos] = v;\n\t\t\t\t}\n\t\t\t\tsize++;\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\t\n\t\t\tpublic long inc(long x, long v)\n\t\t\t{\n\t\t\t\tint pos = h(x)&mask;\n\t\t\t\twhile(allocated[pos] != NG){\n\t\t\t\t\tif(x == keys[pos]){\n\t\t\t\t\t\tallocated[pos] += v;\n\t\t\t\t\t\treturn allocated[pos];\n\t\t\t\t\t}\n\t\t\t\t\tpos = pos+1&mask;\n\t\t\t\t}\n\t\t\t\tif(size == rscale){\n\t\t\t\t\tresizeAndPut(x, v);\n\t\t\t\t}else{\n\t\t\t\t\tkeys[pos] = x;\n\t\t\t\t\tallocated[pos] = v;\n\t\t\t\t}\n\t\t\t\tsize++;\n\t\t\t\treturn v;\n\t\t\t}\n\t\t\t\n\t\t\tpublic boolean remove(long x)\n\t\t\t{\n\t\t\t\tint pos = h(x)&mask;\n\t\t\t\twhile(allocated[pos] != NG){\n\t\t\t\t\tif(x == keys[pos]){\n\t\t\t\t\t\tsize--;\n\t\t\t\t\t\t// take last and fill rmpos\n\t\t\t\t\t\tint last = pos;\n\t\t\t\t\t\tpos = pos+1&mask;\n\t\t\t\t\t\twhile(allocated[pos] != NG){\n\t\t\t\t\t\t\tint lh = h(keys[pos])&mask;\n\t\t\t\t\t\t\t// lh <= last < pos\n\t\t\t\t\t\t\tif(\n\t\t\t\t\t\t\t\t\tlh <= last && last < pos ||\n\t\t\t\t\t\t\t\t\tpos < lh && lh <= last ||\n\t\t\t\t\t\t\t\t\tlast < pos && pos < lh\n\t\t\t\t\t\t\t\t\t){\n\t\t\t\t\t\t\t\tkeys[last] = keys[pos];\n\t\t\t\t\t\t\t\tallocated[last] = allocated[pos];\n\t\t\t\t\t\t\t\tlast = pos;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tpos = pos+1&mask;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tkeys[last] = 0;\n\t\t\t\t\t\tallocated[last] = NG;\n\t\t\t\t\t\t\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t\tpos = pos+1&mask;\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\t\n\t\t\tprivate void resizeAndPut(long x, long v)\n\t\t\t{\n\t\t\t\tint nscale = scale<<1;\n\t\t\t\tint nrscale = rscale<<1;\n\t\t\t\tint nmask = nscale-1;\n\t\t\t\tlong[] nallocated = new long[nscale];\n\t\t\t\tArrays.fill(nallocated, NG);\n\t\t\t\tlong[] nkeys = new long[nscale];\n\t\t\t\tfor(int i = next(0);i < scale;i = next(i+1)){\n\t\t\t\t\tlong y = keys[i];\n\t\t\t\t\tint pos = h(y)&nmask;\n\t\t\t\t\twhile(nallocated[pos] != NG)pos = pos+1&nmask;\n\t\t\t\t\tnkeys[pos] = y;\n\t\t\t\t\tnallocated[pos] = allocated[i];\n\t\t\t\t}\n\t\t\t\t{\n\t\t\t\t\tint pos = h(x)&nmask;\n\t\t\t\t\twhile(nallocated[pos] != NG)pos = pos+1&nmask;\n\t\t\t\t\tnkeys[pos] = x;\n\t\t\t\t\tnallocated[pos] = v;\n\t\t\t\t}\n\t\t\t\tallocated = nallocated;\n\t\t\t\tkeys = nkeys;\n\t\t\t\tscale = nscale;\n\t\t\t\trscale = nrscale;\n\t\t\t\tmask = nmask;\n\t\t\t}\n\t\t\t\n\t\t\tpublic int next(int itr)\n\t\t\t{\n\t\t\t\twhile(itr < scale && allocated[itr] == NG)itr++;\n\t\t\t\treturn itr;\n\t\t\t}\n\t\t\t\n\t\t\tprivate int h(long x)\n\t\t\t{\n\t\t\t\tx ^= x>>>33;\n\t\t\t\tx *= 0xff51afd7ed558ccdL;\n\t\t\t\tx ^= x>>>33;\n\t\t\t\tx *= 0xc4ceb9fe1a85ec53L;\n\t\t\t\tx ^= x>>>33;\n\t\t\t\treturn (int)x;\n\t\t\t}\n\t\t\t\n\t\t\t@Override\n\t\t\tpublic String toString()\n\t\t\t{\n\t\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\t\tfor(int i = next(0);i < scale;i = next(i+1)){\n\t\t\t\t\tsb.append(\",\");\n\t\t\t\t\tsb.append(keys[i] + \":\" + allocated[i]);\n\t\t\t\t}\n\t\t\t\treturn sb.length() == 0 ? \"\" : sb.substring(1);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new F3().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["math", "dp", "sortings", "data structures", "two pointers", "number theory"], "code_uid": "6f35aa2eef2e74a5375e4e728d179c80", "src_uid": "ffb7762f1d60dc3f16e9b27ea0ecdd7d", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "//package ecr012;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class F3 {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tpublic static int[] sieveEratosthenes(int n) {\n\t\tif (n <= 32) {\n\t\t\tint[] primes = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };\n\t\t\tfor (int i = 0; i < primes.length; i++) {\n\t\t\t\tif (n < primes[i]) {\n\t\t\t\t\treturn Arrays.copyOf(primes, i);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn primes;\n\t\t}\n\n\t\tint u = n + 32;\n\t\tdouble lu = Math.log(u);\n\t\tint[] ret = new int[(int) (u / lu + u / lu / lu * 1.5)];\n\t\tret[0] = 2;\n\t\tint pos = 1;\n\n\t\tint[] isnp = new int[(n + 1) / 32 / 2 + 1];\n\t\tint sup = (n + 1) / 32 / 2 + 1;\n\n\t\tint[] tprimes = { 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };\n\t\tfor (int tp : tprimes) {\n\t\t\tret[pos++] = tp;\n\t\t\tint[] ptn = new int[tp];\n\t\t\tfor (int i = (tp - 3) / 2; i < tp << 5; i += tp)\n\t\t\t\tptn[i >> 5] |= 1 << (i & 31);\n\t\t\tfor (int j = 0; j < sup; j += tp) {\n\t\t\t\tfor (int i = 0; i < tp && i + j < sup; i++) {\n\t\t\t\t\tisnp[j + i] |= ptn[i];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// 3,5,7\n\t\t// 2x+3=n\n\t\tint[] magic = { 0, 1, 23, 2, 29, 24, 19, 3, 30, 27, 25, 11, 20, 8, 4, 13, 31, 22, 28, 18, 26, 10, 7, 12, 21, 17,\n\t\t\t\t9, 6, 16, 5, 15, 14 };\n\t\tint h = n / 2;\n\t\tfor (int i = 0; i < sup; i++) {\n\t\t\tfor (int j = ~isnp[i]; j != 0; j &= j - 1) {\n\t\t\t\tint pp = i << 5 | magic[(j & -j) * 0x076be629 >>> 27];\n\t\t\t\tint p = 2 * pp + 3;\n\t\t\t\tif (p > n)\n\t\t\t\t\tbreak;\n\t\t\t\tret[pos++] = p;\n\t\t\t\tif ((long) p * p > n)\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (int q = (p * p - 3) / 2; q <= h; q += p)\n\t\t\t\t\tisnp[q >> 5] |= 1 << q;\n\t\t\t}\n\t\t}\n\n\t\treturn Arrays.copyOf(ret, pos);\n\t}\n\n\tint[] primes = sieveEratosthenes(400000);\n\t\n\tvoid solve()\n\t{\n\t\tlong n = nl();\n\t\tlong ans = 0;\n\t\tif(n <= 10) {\n\t\t\tif(n >= 6)ans++;\n\t\t\tif(n >= 8)ans++;\n\t\t\tif(n >= 10)ans++;\n\t\t\tout.println(ans);\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tMeisselLehmer2 ml = new MeisselLehmer2(n/2);\n\t\tfor(int i = 0;i < primes.length;i++) {\n\t\t\tlong plus = ml.pi(n/primes[i]) - (i+1);\n\t\t\tif(plus <= 0)break;\n\t\t\tans += plus;\n\t\t}\n\t\t\n\t\tfor(int p : primes) {\n\t\t\tif((long)p*p*p <= n) {\n\t\t\t\tans++;\n\t\t\t}else {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tout.println(ans);\n\t}\n\t\n\tpublic static class MeisselLehmer2 {\n\t\tint[] primes;\n//\t\tint[] cump;\n\t\tint[] xcums;\n\t\tlong[] isp;\n\t\t\n\t\tint cachelimit;\n//\t\tMap<Long, Long> picache;\n//\t\tMap<Long, Long> phicache;\n\t\tLongHashCounterL picache;\n\t\tLongHashCounterL phicache;\n\t\tboolean cachePhi = false;\n\t\t\n\t\tint[][] cumps;\n//\t\tint[] FP = {2,3,5,7,11,13,17};\n\t\tint[] FP = {2,3,5,7,11,13,17,19};\n\t\tint M = FP.length;\n\t\t\n\t\tint B = 100;\n\t\t// 10^14 -> 200\n\t\t// 10^14/8 -> 100~200\n\n\t\tpublic MeisselLehmer2(long n)\n\t\t{\n\t\t\tassert n >= 4;\n//\t\t\tpicache = new HashMap<>();\n//\t\t\tphicache = new HashMap<>();\n\t\t\tpicache = new LongHashCounterL();\n\t\t\tphicache = new LongHashCounterL();\n\t\t\t\n\t\t\tint s = (int)Math.sqrt(n)*B; // not overflow!\n\t\t\tcachelimit = s;\n\t\t\tthis.primes = sieveEratosthenes(s);\n\t\t\txcums = new int[(s>>>6)+1];\n\t\t\tisp = new long[(s>>>6)+1];\n\t\t\tfor(int p : primes)isp[p>>>6] |= 1L<<p;\n\t\t\tfor(int i = 0;i < xcums.length-1;i++)xcums[i+1] = xcums[i] + Long.bitCount(isp[i]);\n\t\t\t\n\t\t\tcumps = new int[M][];\n\t\t\tboolean[] b = {true};\n\t\t\tint len = 1;\n\t\t\tfor(int i = 0;i < M;i++){\n\t\t\t\tlen *= FP[i];\n\t\t\t\tboolean[] c = new boolean[len];\n\t\t\t\tfor(int j = 0;j < FP[i];j++){\n\t\t\t\t\tSystem.arraycopy(b, 0, c, j*b.length, b.length);\n\t\t\t\t}\n\t\t\t\tfor(int k = 0;k < len;k+=FP[i])c[k] = false;\n\t\t\t\tcumps[i] = new int[len+1];\n\t\t\t\tfor(int j = 0;j < len;j++)cumps[i][j+1] = cumps[i][j] + (c[j] ? 1 : 0);\n\t\t\t\tFP[i] = len;\n\t\t\t\tb = c;\n\t\t\t}\n\t\t}\n\t\t\n\t\tprivate long sqrt(long n)\n\t\t{\n\t\t\tlong i = Math.max(0, (long)Math.sqrt(n)-2);\n\t\t\twhile(i*i <= n)i++;\n\t\t\treturn i-1;\n\t\t}\n\t\t\n\t\tprivate long cbrt(long n)\n\t\t{\n\t\t\tlong i = Math.max(0, (long)Math.cbrt(n)-2);\n\t\t\twhile(i*i*i <= n)i++;\n\t\t\treturn i-1;\n\t\t}\n\t\t\n\t\tpublic long pi(long x)\n\t\t{\n\t\t\tif(x <= cachelimit){\n\t\t\t\tint ix = (int)x;\n\t\t\t\treturn xcums[ix>>>6] + Long.bitCount(isp[ix>>>6]<<~ix);\n//\t\t\t\treturn cump[(int)x];\n\t\t\t}\n\t\t\tif(picache.containsKey(x))return picache.get(x);\n\t\t\t\n\t\t\tint A = (int)pi(sqrt(sqrt(x)));\n\t\t\tlong ret = A + phi(x, A) - P2(x, A) - P3(x, A) - 1;\n\t\t\tpicache.put(x, ret);\n\t\t\treturn ret;\n\t\t}\n\t\t\n\t\tprivate long phi(long x, int A)\n\t\t{\n\t\t\tif(A > 0 && A-1 < M){\n\t\t\t\treturn cumps[A-1][FP[A-1]] * (x/FP[A-1]) + cumps[A-1][(int)(x%FP[A-1]+1)];\n\t\t\t}\n\t\t\tif(A > 0 && x <= (long)primes[A-1]*primes[A-1]){\n\t\t\t\treturn pi(x) - A + 1;\n\t\t\t}\n//\t\t\tlong code = x<<13|A;\n//\t\t\tif(phicache.containsKey(code))return phicache.get(code);\n\t\t\t\n\t\t\tlong ret = x;\n\t\t\tfor(int i = A-1;i >= 0;i--)ret -= phi(x/primes[i], i);\n\t\t\t\n//\t\t\tif(cachePhi)phicache.put(code, ret);\n\t\t\treturn ret;\n\t\t}\n\t\t\n\t\tprivate long P2(long x, int A)\n\t\t{\n\t\t\tint B = (int)pi(sqrt(x));\n\t\t\tlong ret = 0;\n\t\t\tfor(int i = A;i < B;i++){\n\t\t\t\tret += pi(x/primes[i]);\n\t\t\t}\n\t\t\tret -= (long)(B-A)*(B+A-1)/2;\n\t\t\treturn ret;\n\t\t}\n\t\t\n\t\tprivate long P3(long x, int A)\n\t\t{\n\t\t\tint C = (int)pi(cbrt(x));\n\t\t\tlong ret = 0;\n\t\t\tfor(int i = A;i < C;i++){\n\t\t\t\tlong xi = x/primes[i];\n\t\t\t\tint B = (int)pi(sqrt(xi));\n\t\t\t\tfor(int j = i;j < B;j++){\n\t\t\t\t\tret += pi(xi/primes[j]) - j;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\t\t\n\t\tpublic static int[] sieveEratosthenes(int n) {\n\t\t\tif (n <= 32) {\n\t\t\t\tint[] primes = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };\n\t\t\t\tfor (int i = 0; i < primes.length; i++) {\n\t\t\t\t\tif (n < primes[i]) {\n\t\t\t\t\t\treturn Arrays.copyOf(primes, i);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn primes;\n\t\t\t}\n\n\t\t\tint u = n + 32;\n\t\t\tdouble lu = Math.log(u);\n\t\t\tint[] ret = new int[(int) (u / lu + u / lu / lu * 1.5)];\n\t\t\tret[0] = 2;\n\t\t\tint pos = 1;\n\n\t\t\tint[] isnp = new int[(n + 1) / 32 / 2 + 1];\n\t\t\tint sup = (n + 1) / 32 / 2 + 1;\n\n\t\t\tint[] tprimes = { 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };\n\t\t\tfor (int tp : tprimes) {\n\t\t\t\tret[pos++] = tp;\n\t\t\t\tint[] ptn = new int[tp];\n\t\t\t\tfor (int i = (tp - 3) / 2; i < tp << 5; i += tp)\n\t\t\t\t\tptn[i >> 5] |= 1 << (i & 31);\n\t\t\t\tfor (int j = 0; j < sup; j += tp) {\n\t\t\t\t\tfor (int i = 0; i < tp && i + j < sup; i++) {\n\t\t\t\t\t\tisnp[j + i] |= ptn[i];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// 3,5,7\n\t\t\t// 2x+3=n\n\t\t\tint[] magic = { 0, 1, 23, 2, 29, 24, 19, 3, 30, 27, 25, 11, 20, 8, 4, 13, 31, 22, 28, 18, 26, 10, 7, 12, 21, 17,\n\t\t\t\t\t9, 6, 16, 5, 15, 14 };\n\t\t\tint h = n / 2;\n\t\t\tfor (int i = 0; i < sup; i++) {\n\t\t\t\tfor (int j = ~isnp[i]; j != 0; j &= j - 1) {\n\t\t\t\t\tint pp = i << 5 | magic[(j & -j) * 0x076be629 >>> 27];\n\t\t\t\t\tint p = 2 * pp + 3;\n\t\t\t\t\tif (p > n)\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tret[pos++] = p;\n\t\t\t\t\tif ((long) p * p > n)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tfor (int q = (p * p - 3) / 2; q <= h; q += p)\n\t\t\t\t\t\tisnp[q >> 5] |= 1 << q;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn Arrays.copyOf(ret, pos);\n\t\t}\n\t\t\n\t\tprivate static class LongHashCounterL {\n\t\t\tpublic long[] keys;\n\t\t\tpublic long[] allocated;\n\t\t\tprivate int scale = 1<<2;\n\t\t\tprivate int rscale = 1<<1;\n\t\t\tprivate int mask = scale-1;\n\t\t\tpublic int size = 0;\n\t\t\t\n\t\t\tpublic LongHashCounterL(){\n\t\t\t\tallocated = new long[scale];\n\t\t\t\tArrays.fill(allocated, NG);\n\t\t\t\tkeys = new long[scale];\n\t\t\t}\n\t\t\t\n\t\t\t// if value is NG, entry is removed. (e.g. 0)\n\t\t\tprivate static final int NG = 0;\n\t\t\t\n\t\t\tpublic boolean containsKey(long x)\n\t\t\t{\n\t\t\t\tint pos = h(x)&mask;\n\t\t\t\twhile(allocated[pos] != NG){\n\t\t\t\t\tif(x == keys[pos])return true;\n\t\t\t\t\tpos = pos+1&mask;\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\t\n\t\t\tpublic long get(long x)\n\t\t\t{\n\t\t\t\tint pos = h(x)&mask;\n\t\t\t\twhile(allocated[pos] != NG){\n\t\t\t\t\tif(x == keys[pos])return allocated[pos];\n\t\t\t\t\tpos = pos+1&mask;\n\t\t\t\t}\n\t\t\t\treturn NG;\n\t\t\t}\n\t\t\t\n\t\t\tpublic long put(long x, long v)\n\t\t\t{\n\t\t\t\tint pos = h(x)&mask;\n\t\t\t\twhile(allocated[pos] != NG){\n\t\t\t\t\tif(x == keys[pos]){\n\t\t\t\t\t\tlong oldval = allocated[pos];\n\t\t\t\t\t\tallocated[pos] = v;\n\t\t\t\t\t\treturn oldval;\n\t\t\t\t\t}\n\t\t\t\t\tpos = pos+1&mask;\n\t\t\t\t}\n\t\t\t\tif(size == rscale){\n\t\t\t\t\tresizeAndPut(x, v);\n\t\t\t\t}else{\n\t\t\t\t\tkeys[pos] = x;\n\t\t\t\t\tallocated[pos] = v;\n\t\t\t\t}\n\t\t\t\tsize++;\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\t\n\t\t\tpublic long inc(long x, long v)\n\t\t\t{\n\t\t\t\tint pos = h(x)&mask;\n\t\t\t\twhile(allocated[pos] != NG){\n\t\t\t\t\tif(x == keys[pos]){\n\t\t\t\t\t\tallocated[pos] += v;\n\t\t\t\t\t\treturn allocated[pos];\n\t\t\t\t\t}\n\t\t\t\t\tpos = pos+1&mask;\n\t\t\t\t}\n\t\t\t\tif(size == rscale){\n\t\t\t\t\tresizeAndPut(x, v);\n\t\t\t\t}else{\n\t\t\t\t\tkeys[pos] = x;\n\t\t\t\t\tallocated[pos] = v;\n\t\t\t\t}\n\t\t\t\tsize++;\n\t\t\t\treturn v;\n\t\t\t}\n\t\t\t\n\t\t\tpublic boolean remove(long x)\n\t\t\t{\n\t\t\t\tint pos = h(x)&mask;\n\t\t\t\twhile(allocated[pos] != NG){\n\t\t\t\t\tif(x == keys[pos]){\n\t\t\t\t\t\tsize--;\n\t\t\t\t\t\t// take last and fill rmpos\n\t\t\t\t\t\tint last = pos;\n\t\t\t\t\t\tpos = pos+1&mask;\n\t\t\t\t\t\twhile(allocated[pos] != NG){\n\t\t\t\t\t\t\tint lh = h(keys[pos])&mask;\n\t\t\t\t\t\t\t// lh <= last < pos\n\t\t\t\t\t\t\tif(\n\t\t\t\t\t\t\t\t\tlh <= last && last < pos ||\n\t\t\t\t\t\t\t\t\tpos < lh && lh <= last ||\n\t\t\t\t\t\t\t\t\tlast < pos && pos < lh\n\t\t\t\t\t\t\t\t\t){\n\t\t\t\t\t\t\t\tkeys[last] = keys[pos];\n\t\t\t\t\t\t\t\tallocated[last] = allocated[pos];\n\t\t\t\t\t\t\t\tlast = pos;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tpos = pos+1&mask;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tkeys[last] = 0;\n\t\t\t\t\t\tallocated[last] = NG;\n\t\t\t\t\t\t\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t\tpos = pos+1&mask;\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\t\n\t\t\tprivate void resizeAndPut(long x, long v)\n\t\t\t{\n\t\t\t\tint nscale = scale<<1;\n\t\t\t\tint nrscale = rscale<<1;\n\t\t\t\tint nmask = nscale-1;\n\t\t\t\tlong[] nallocated = new long[nscale];\n\t\t\t\tArrays.fill(nallocated, NG);\n\t\t\t\tlong[] nkeys = new long[nscale];\n\t\t\t\tfor(int i = next(0);i < scale;i = next(i+1)){\n\t\t\t\t\tlong y = keys[i];\n\t\t\t\t\tint pos = h(y)&nmask;\n\t\t\t\t\twhile(nallocated[pos] != NG)pos = pos+1&nmask;\n\t\t\t\t\tnkeys[pos] = y;\n\t\t\t\t\tnallocated[pos] = allocated[i];\n\t\t\t\t}\n\t\t\t\t{\n\t\t\t\t\tint pos = h(x)&nmask;\n\t\t\t\t\twhile(nallocated[pos] != NG)pos = pos+1&nmask;\n\t\t\t\t\tnkeys[pos] = x;\n\t\t\t\t\tnallocated[pos] = v;\n\t\t\t\t}\n\t\t\t\tallocated = nallocated;\n\t\t\t\tkeys = nkeys;\n\t\t\t\tscale = nscale;\n\t\t\t\trscale = nrscale;\n\t\t\t\tmask = nmask;\n\t\t\t}\n\t\t\t\n\t\t\tpublic int next(int itr)\n\t\t\t{\n\t\t\t\twhile(itr < scale && allocated[itr] == NG)itr++;\n\t\t\t\treturn itr;\n\t\t\t}\n\t\t\t\n\t\t\tprivate int h(long x)\n\t\t\t{\n\t\t\t\tx ^= x>>>33;\n\t\t\t\tx *= 0xff51afd7ed558ccdL;\n\t\t\t\tx ^= x>>>33;\n\t\t\t\tx *= 0xc4ceb9fe1a85ec53L;\n\t\t\t\tx ^= x>>>33;\n\t\t\t\treturn (int)x;\n\t\t\t}\n\t\t\t\n\t\t\t@Override\n\t\t\tpublic String toString()\n\t\t\t{\n\t\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\t\tfor(int i = next(0);i < scale;i = next(i+1)){\n\t\t\t\t\tsb.append(\",\");\n\t\t\t\t\tsb.append(keys[i] + \":\" + allocated[i]);\n\t\t\t\t}\n\t\t\t\treturn sb.length() == 0 ? \"\" : sb.substring(1);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new F3().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["math", "dp", "sortings", "data structures", "two pointers", "number theory"], "code_uid": "a2105f3a6efbd03893ab23ee4b039ac3", "src_uid": "ffb7762f1d60dc3f16e9b27ea0ecdd7d", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\r\nimport java.util.*;\r\nimport static java.lang.System.*;\r\nimport static java.lang.Math.*;\r\npublic class Code\r\n{\r\n int P1,P2,H,S;\r\n long T1,T2;\r\n void run() {\r\n int tc=1;\r\n StringBuilder sb=new StringBuilder();\r\n while(tc-->0) {\r\n P1=ni(); T1=nl();\r\n P2=ni(); T2=nl();\r\n H=ni(); S=ni();\r\n long g = gcd(T1, T2);\r\n if (g > 1) {\r\n T1 /= g;\r\n T2 /= g;\r\n }\r\n if(T1>T2) {\r\n P1^=P2^(P2=P1);\r\n T1^=T2^(T2=T1);\r\n }\r\n if (T1 == T2) {\r\n int d = P1+P2-S;\r\n int round = (H + d - 1) / d;\r\n sb.append(round * T1 * g).append(\"\\n\");\r\n break;\r\n }\r\n dp = new Long[H+1];\r\n Arrays.fill(dp, (long) 1e16);\r\n // dp = new HashMap<>();\r\n int d1 = P1-S;\r\n int d2 = P2-S;\r\n int d = P1+P2-S;\r\n for(int v=1;v<=H;v++) {\r\n int r=v;\r\n long t1=T1,t2=T2;\r\n while(true) {\r\n if(t1<t2) {\r\n if(d1>=r) {\r\n dp[v]=min(dp[v], t1);\r\n break;\r\n }\r\n if(t1+T1<=t2) {\r\n r-=d1;\r\n }\r\n else {\r\n if(d>=r) {\r\n dp[v]=min(dp[v], t2);\r\n }\r\n else {\r\n dp[v]=min(dp[v], t2+dp[r-d]);\r\n }\r\n r-=d1;\r\n }\r\n t1+=T1;\r\n }\r\n else if(t1==t2) {\r\n if(d>=r) {\r\n dp[v]=min(dp[v], t2);\r\n }\r\n else {\r\n dp[v]=min(dp[v], t2+dp[r-d]);\r\n }\r\n break;\r\n }\r\n else {\r\n if(d2>=r) {\r\n dp[v]=min(dp[v], t2);\r\n break;\r\n }\r\n if(d>=r) {\r\n dp[v]=min(dp[v], t1);\r\n }\r\n else {\r\n dp[v]=min(dp[v], t1+dp[r-d]);\r\n }\r\n r-=d2;\r\n t2+=T2;\r\n }\r\n }\r\n }\r\n\r\n\r\n\r\n\r\n // solve(P1, T1, P2, T2, H, S);\r\n sb.append(dp[H]*g).append(\"\\n\");\r\n }\r\n out.println(sb);\r\n out.flush();\r\n out.close();\r\n }\r\n Long dp[], ans=Long.MAX_VALUE;\r\n // // Map<String, Long> dp;\r\n // long solve(int p1, long t1, int p2, long t2, int h, int s) {\r\n // if(h<=0) return 0;\r\n\r\n // if(dp[h]!=null) return dp[h];\r\n\r\n\r\n // // int diff=Math.abs(c1-c2);\r\n // // String str = concat(h);\r\n // // if(dp.containsKey(str) && dp.get(str)) return dp.get(str);\r\n // // 5000*5000=2.5*10^7\r\n\r\n // if(t1>t2) {\r\n // solve(p1, T1, p2, T2, h-(p1+p2-s), s);\r\n // solve(p1, t1-t2, p2, T2, h-(p2-s), s);\r\n // // res = min(x,y);\r\n // }\r\n // else {\r\n // if(p1-s>=h) {\r\n // ans=min(ans, t1);\r\n // return ans;\r\n // }\r\n // if(t1+T1<=t2) {\r\n // solve(p1, t1+T1, p2, t2, h-(p1-s), s);\r\n // }\r\n // else {\r\n // if(p1+p2-s>=h) {\r\n // ans=min(ans, t2);\r\n // }\r\n // else {\r\n // ans=min(ans, t2+solve(p1, t1+T1, p2, t2, h-(p1+p2-s), s));\r\n // }\r\n // }\r\n // // solve(p1, T1, p2, t2-t1, h-(p1-s), s, time+t1);\r\n // // solve(p1, T1, p2, T2, h-(p1+p2-s), s, time+t2);\r\n // // System.out.println(h+\" \"+x+\" \"+y);\r\n // // res = min(x,y);\r\n // }\r\n // // dp.put(str, res);\r\n // // return res;\r\n\r\n // }\r\n String concat(Long... v) {\r\n StringBuilder sb = new StringBuilder();\r\n for(Long i: v) sb.append(i).append(\" \");\r\n return sb.toString();\r\n }\r\n StringBuilder pr(String s, int t) {\r\n return new StringBuilder().append(\"Case #\").append(t).append(\": \").append(s).append(\"\\n\");\r\n }\r\n public static void main(String[] args)throws Exception {\r\n try { \r\n // new Thread(null, new Code()::run, \"1\", 1 << 26).start();\r\n new Thread(null, new Code(\"ONLINE_JUDGE\")::run, \"1\", 1 << 26).start();\r\n } catch(Exception e) {}\r\n }\r\n\r\n FastReader sc=null;PrintWriter out = null;\r\n public Code()throws Exception {\r\n sc = new FastReader(new FileInputStream(\"input.txt\"));\r\n out = new PrintWriter(new BufferedWriter(new FileWriter(\"output.txt\")));\r\n }\r\n public Code(String JUDGE) {\r\n sc = new FastReader(System.in);\r\n out = new PrintWriter(System.out); \r\n }\r\n \r\n String ns() { return sc.next(); }\r\n int ni() { return sc.nextInt(); }\r\n long nl() { return sc.nextLong(); }\r\n int[] ni(int n) {\r\n int a[]=new int[n];\r\n for(int i=0;i<n;a[i++]=ni());\r\n return a;\r\n }\r\n long[] nl(int n) {\r\n long a[]=new long[n];\r\n for(int i=0;i<n;a[i++]=nl());\r\n return a;\r\n }\r\n \r\n int[][] ni(int n,int m) {\r\n int a[][]=new int[n][m];\r\n for(int i=0;i<n;i++) \r\n for(int j=0;j<m;j++)\r\n a[i][j]=ni();\r\n return a;\r\n }\r\n long[][] nl(int n,int m) {\r\n long a[][]=new long[n][m];\r\n for(int i=0;i<n;i++) \r\n for(int j=0;j<m;j++)\r\n a[i][j]=nl();\r\n return a;\r\n }\r\n long gcd(long a, long b) {\r\n return b==0?a:gcd(b,a%b);\r\n }\r\n static class FastReader {\r\n private InputStream stream;\r\n private byte[] buf = new byte[1024];\r\n private int curChar;\r\n private int numChars;\r\n private FastReader.SpaceCharFilter filter;\r\n public FastReader(InputStream stream) {\r\n this.stream = stream;\r\n }\r\n\r\n public int read() {\r\n if (numChars == -1) throw new InputMismatchException();\r\n if (curChar >= numChars) {\r\n curChar = 0;\r\n try {\r\n numChars = stream.read(buf);\r\n } catch (IOException e) {\r\n throw new InputMismatchException();\r\n }\r\n if (numChars <= 0) return -1;\r\n }\r\n return buf[curChar++];\r\n }\r\n\r\n public int nextInt() {\r\n int c = read();\r\n while (isSpaceChar(c)) c = read();\r\n int sgn = 1;\r\n if (c == '-') {\r\n sgn = -1;\r\n c = read();\r\n }\r\n int res = 0;\r\n do {\r\n if (c < '0' || c > '9') throw new InputMismatchException();\r\n res *= 10;\r\n res += c - '0';\r\n c = read();\r\n }\r\n while (!isSpaceChar(c));\r\n return res * sgn;\r\n }\r\n \r\n public long nextLong() {\r\n int c = read();\r\n while (isSpaceChar(c)) c = read();\r\n int sgn = 1;\r\n if (c == '-') {\r\n sgn = -1;\r\n c = read();\r\n }\r\n long res = 0;\r\n do {\r\n if (c < '0' || c > '9') throw new InputMismatchException();\r\n res = res*1L*10;\r\n res += c - '0';\r\n c = read();\r\n }\r\n while (!isSpaceChar(c));\r\n return res *1L* sgn;\r\n }\r\n \r\n public String next() {\r\n int c = read();\r\n while (isSpaceChar(c)) c = read();\r\n StringBuilder res = new StringBuilder();\r\n do {\r\n res.appendCodePoint(c);\r\n c = read();\r\n } while (!isSpaceChar(c));\r\n return res.toString();\r\n }\r\n\r\n public boolean isSpaceChar(int c) {\r\n if (filter != null) return filter.isSpaceChar(c);\r\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\r\n }\r\n\r\n public interface SpaceCharFilter {\r\n public boolean isSpaceChar(int ch);\r\n\r\n }\r\n }\r\n}", "lang_cluster": "Java", "tags": ["dp", "binary search"], "code_uid": "1646caf60825b08f7b794643cc6f3713", "src_uid": "ca9d48e48e69b931236907a9ac262433", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "\n\nimport java.util.*;\npublic class E {\n\n int n = 300000000 + 2;\n byte []bits = new byte[n/16 + 1];\n boolean isset(int x){\n \n x >>= 1;\n int ind = x >> 3;\n int sh = x & 7;\n return (bits[ind] & (1 << sh)) != 0;\n }\n \n void setbit(int x){\n x >>= 1;\n int ind = x >> 3;\n int sh = x & 7;\n bits[ind] |= (1 << sh);\n }\n void seive(){\n \n for (int i = 3; i*i < n; i+=2) {\n if(!isset(i)){ \n for (int j = i*i; j < n; j+=i+i) {\n setbit(j);\n }\n }\n }\n }\n void read(){\n seive();\n Scanner s = new Scanner(System.in);\n int l = s.nextInt();\n int r = s.nextInt(); \n int ans = 0;\n if(l <= 2 && r >= 2 ) ans ++;\n for (int i = 5; i <= n; i+=4) {\n if(l <= i && r >= i && !isset(i)){\n ans++;\n }\n }\n System.out.println(ans);\n }\n public static void main(String[] args) {\n new E().read(); \n \n }\n}\n", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "14995c25a7851fdeeb9c6f4359e65bba", "src_uid": "55a83526c10126ac3a6e6e5154b120d0", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.FileNotFoundException;\nimport java.util.StringTokenizer;\nimport java.io.BufferedReader;\nimport java.io.FileReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author triveni\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tF solver = new F();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\n\tstatic class F {\n\t\tprivate Long[][] lastX = new Long[2010][2010];\n\t\tprivate long mod = 998244353;\n\t\tprivate long p = 0;\n\t\tprivate long[] pPow = new long[2010];\n\t\tprivate long[] qPow = new long[2010];\n\t\tprivate long[] strong = new long[2010];\n\t\tprivate Long[] dp = new Long[2010];\n\n\t\tpublic void solve(int testNumber, InputReader in, PrintWriter out) {\n\t\t\tint n = in.nextInt();\n\t\t\tint a = in.nextInt(), b = in.nextInt();\n\t\t\tp = MathUtils.powMod(b, mod - 2, mod) * a % mod;\n\t\t\tpPow[0] = 1;\n\t\t\tqPow[0] = 1;\n\t\t\tfor (int i = 1; i < 2010; ++i) {\n\t\t\t\tpPow[i] = pPow[i - 1] * p % mod;\n\t\t\t\tqPow[i] = qPow[i - 1] * (1 - p + mod) % mod;\n\t\t\t}\n\t\t\tstrong[1] = 1;\n\t\t\tfor (int i = 2; i <= n; ++i) {\n\t\t\t\tlong ans = 0;\n\t\t\t\tfor (int j = 1; j < i; ++j) {\n\t\t\t\t\tans += strong[j] * computeLastX(i, j) % mod;\n\t\t\t\t\tif (ans >= mod) ans -= mod;\n\t\t\t\t}\n\t\t\t\tstrong[i] = 1 - ans;\n\t\t\t\tif (strong[i] < 0) strong[i] += mod;\n\t\t\t}\n\t\t\tlong ans = dp(n);\n\t\t\tout.println(ans);\n\t\t}\n\n\t\tprivate long computeLastX(int n, int i) {\n\t\t\tif (lastX[n][i] != null) return lastX[n][i];\n\t\t\tif (n == i || i == 0) return lastX[n][i] = 1L;\n\t\t\tlong ans = qPow[i] * computeLastX(n - 1, i) % mod + pPow[n - i] * computeLastX(n - 1, i - 1) % mod;\n\t\t\treturn lastX[n][i] = ans % mod;\n\t\t}\n\n\t\tprivate long dp(int n) {\n\t\t\tif (dp[n] != null) return dp[n];\n\t\t\tif (n < 2) return dp[n] = 0L;\n\t\t\tif (n < 3) return dp[n] = 1L;\n\t\t\tlong ans = strong[n] * (n * (n - 1) / 2) % mod;\n\t\t\tfor (int x = 1; x < n; ++x) {\n\t\t\t\tlong tmp = computeLastX(n, x) * strong[x] % mod;\n\t\t\t\ttmp *= (x * (x - 1) / 2 + x * (n - x) + dp(n - x) + dp(x)) % mod;\n\t\t\t\tans += tmp % mod;\n\t\t\t}\n\t\t\tans %= mod;\n\t\t\tans *= MathUtils.powMod(1 + mod - strong[n], mod - 2, mod);\n\t\t\treturn dp[n] = ans % mod;\n\t\t}\n\n\t}\n\n\tstatic class InputReader {\n\t\tpublic BufferedReader reader;\n\t\tpublic StringTokenizer tokenizer;\n\n\t\tpublic InputReader(InputStream inputStream) {\n\t\t\treader = new BufferedReader(new InputStreamReader(inputStream));\n\t\t\ttokenizer = null;\n\t\t}\n\n\t\tpublic InputReader(String inputFile) throws FileNotFoundException {\n\t\t\treader = new BufferedReader(new FileReader(inputFile));\n\t\t\ttokenizer = null;\n\t\t}\n\n\t\tpublic String nextLine() {\n\t\t\tString curr = \"\";\n\t\t\ttry {\n\t\t\t\tcurr = reader.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\t\treturn curr;\n\t\t}\n\n\t\tpublic String nextString() {\n\t\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttokenizer = new StringTokenizer(nextLine());\n\t\t\t\t} catch (Exception e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tokenizer.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(nextString());\n\t\t}\n\n\t}\n\n\tstatic class MathUtils {\n\t\tpublic static long powMod(long a, long b, long m) {\n\t\t\tlong ans = 1;\n\t\t\twhile (b > 0) {\n\t\t\t\tif (b % 2 == 1) ans = ans * a % m;\n\t\t\t\tb >>= 1;\n\t\t\t\ta = a * a % m;\n\t\t\t}\n\t\t\treturn ans % m;\n\t\t}\n\n\t}\n}\n\n", "lang_cluster": "Java", "tags": ["math", "dp", "probabilities", "graphs"], "code_uid": "8125a16f2dbfd137b5ec008358d0e708", "src_uid": "67e599530203060c17f692f2624d0f99", "difficulty": 2800.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.lang.reflect.Array;\nimport java.math.BigDecimal;\nimport java.sql.Time;\nimport java.util.*;\n\nimport java.math.BigInteger;\n\nimport static java.lang.Math.*;\nimport static java.math.BigInteger.*;\nimport static java.util.Arrays.*;\n\n\npublic class Main{\n\n void run(){\n Locale.setDefault(Locale.US);\n boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n// boolean oj = true;\n try{\n if( oj ){\n sc = new FastScanner( new InputStreamReader(System.in ) );\n out = new PrintWriter( new OutputStreamWriter(System.out) );\n } else{\n sc = new FastScanner(new FileReader(\"in.txt\") );\n// sc = new FastScanner(new FileReader(\"D:\\\\JavaOlymp\\\\FatalError\\\\output.txt\") );\n out = new PrintWriter( new FileWriter(\"out.txt\") );\n }\n } catch (Exception e) {\n System.exit(-1);\n }\n long tB = System.currentTimeMillis();\n solve();\n if( !oj ) System.err.println( \"Time: \" + (System.currentTimeMillis()-tB)/1e3 );\n out.flush();\n }\n\n\n class FastScanner{\n BufferedReader br;\n StringTokenizer st = new StringTokenizer(\"\");\n FastScanner( InputStreamReader a ){\n br = new BufferedReader(a);\n }\n FastScanner( FileReader a ){\n br = new BufferedReader(a);\n }\n String next(){\n while( !st.hasMoreTokens() )\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n return null;\n }\n return st.nextToken();\n }\n String readLine(){\n try {\n return br.readLine();\n } catch (Exception e) {\n return null;\n }\n }\n int nextInt(){ return Integer.parseInt(next()); }\n long nextLong(){ return Long.parseLong(next()); }\n }\n\n FastScanner sc;\n PrintWriter out;\n\n\n\n public static void main(String[] args){\n new Main().run();\n// new Thread( null, new Runnable() {\n// @Override\n// public void run() {\n// new Main().run();\n// }\n// }, \"LOL\", 256L * 1024 * 1024 / 2 ).run();\n// }, \"LOL\", 2000 * 1024 * 1024 ).run();\n }\n\n\n\n void TLE(){ for(;;); }\n\n void MLE(){\n int[][] adj = new int[1024*1024][];\n for( int i = 0; i < adj.length; ++i )\n adj[i] = new int[1024*1024];\n }\n\n void exit( int val ){\n out.flush();\n System.exit(val);\n }\n //////////////////////////////////////////////////////////////////////////////////////////\n\n class Item{\n int i, j, msk;\n Item( int _i, int _j, int _msk ){\n i = _i;\n j = _j;\n msk = _msk;\n }\n }\n\n final int inf = Integer.MAX_VALUE / 10;\n int n, m, Si, Sj;\n char[][] gr;\n\n int timer, mskOfBomb;\n int[] idObj;\n\n int[] cost = new int[9];\n int[][] dp;\n\n void solve(){\n n = sc.nextInt();\n m = sc.nextInt();\n gr = new char[n][];\n idObj = new int[n*m]; fill( idObj, -1 );\n for( int i = 0; i < n; ++i )\n gr[i] = sc.next().toCharArray();\n\n int[] tmp = new int[9];\n for( int i = 1; ; ++i )\n try {\n tmp[i] = sc.nextInt();\n } catch (Exception e) {\n break;\n }\n\n for( int i = 0; i < n; ++i ){\n for( int j = 0; j < m; ++j ){\n char c = gr[i][j];\n if( Character.isDigit(c) ){\n idObj[i*m+j] = timer++;\n cost[timer-1] = tmp[c - '0'];\n }\n if( c=='B' ){\n idObj[i*m+j] = timer++;\n mskOfBomb |= 1 << (timer-1);\n }\n if( c == 'S' ){\n Si = i;\n Sj = j;\n }\n }\n }\n\n dp = new int[n*m][1<<8];\n for( int[] dpi : dp ) fill( dpi, inf );\n dp[Si*m + Sj][0] = 0;\n ArrayDeque<Item> Q = new ArrayDeque<Item>();\n Q.add(new Item(Si,Sj,0));\n while( !Q.isEmpty() ){\n Item v = Q.pollFirst();\n for( int di = -1; di <= 1; ++di ){\n for( int dj = -1; dj <= 1; ++dj ){\n if( abs(di) + abs(dj) != 1 ) continue;\n Item to = new Item(v.i+di, v.j+dj, v.msk);\n if(!( 0<=to.i && to.i<n &&\n 0<=to.j && to.j<m &&\n (gr[to.i][to.j] == '.' || gr[to.i][to.j]=='S') ))\n continue;\n if( abs(di)==1 ){\n int curI = min(v.i, to.i);\n for( int k = 0; k < v.j; ++k ){\n int id = idObj[curI*m + k];\n if( id != -1 ) to.msk ^= 1 << id;\n }\n }\n if( dp[to.i*m + to.j][to.msk] > dp[v.i*m + v.j][v.msk] + 1 ){\n dp[to.i*m + to.j][to.msk] = dp[v.i*m + v.j][v.msk] + 1;\n Q.addLast(to);\n }\n }\n }\n }\n\n int ans = 0;\n for( int msk = 0; msk < 1<<8; ++msk ){\n if( (msk & mskOfBomb) == 0 &&\n dp[Si*m + Sj][msk] != inf ){\n int cost = 0;\n for( int i = 0; i < 8; ++i )\n if( (msk & (1<<i)) != 0 )\n cost += this.cost[i];\n ans = max( ans, cost - dp[Si*m + Sj][msk] );\n }\n }\n\n out.println(ans);\n }\n\n\n\n}\n", "lang_cluster": "Java", "tags": ["shortest paths", "bitmasks"], "code_uid": "36e10884cb43870d30812ebff13c114c", "src_uid": "624a0d6cf305fcf67d3f1cdc1c5fef8d", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.OutputStreamWriter;\nimport java.io.BufferedWriter;\nimport java.util.Comparator;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.Writer;\nimport java.io.IOException;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.NoSuchElementException;\nimport java.math.BigInteger;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Egor Kulikov (egor@egork.net)\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tOutputWriter out = new OutputWriter(outputStream);\n\t\tTaskC solver = new TaskC();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskC {\n\tint RIGHT = 3;\n\tint LEFT = 1;\n\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n\t\tint rowCount = in.readInt();\n\t\tint columnCount = in.readInt();\n\t\tchar[][] table = IOUtils.readTable(in, rowCount, columnCount);\n\t\tint treasureCount = 0;\n\t\tint bombCount = 0;\n\t\tint sRow = -1;\n\t\tint sColumn = -1;\n\t\tfor (int i = 0; i < rowCount; i++) {\n\t\t\tfor (int j = 0; j < columnCount; j++) {\n\t\t\t\tchar c = table[i][j];\n\t\t\t\tif (Character.isDigit(c))\n\t\t\t\t\ttreasureCount = Math.max(treasureCount, c - '0');\n\t\t\t\telse if (c == 'B')\n\t\t\t\t\tbombCount++;\n\t\t\t\telse if (c == 'S') {\n\t\t\t\t\tsRow = i;\n\t\t\t\t\tsColumn = j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\ttable[sRow][sColumn] = '.';\n\t\tint[] value = IOUtils.readIntArray(in, treasureCount);\n\t\tint[][][] change = new int[4][rowCount][columnCount];\n\t\tint bombIndex = treasureCount;\n\t\tfor (int i = 0; i < rowCount; i++) {\n\t\t\tfor (int j = 0; j < columnCount; j++) {\n\t\t\t\tint curIndex = -1;\n\t\t\t\tif (Character.isDigit(table[i][j]))\n\t\t\t\t\tcurIndex = table[i][j] - '1';\n\t\t\t\telse if (table[i][j] == 'B')\n\t\t\t\t\tcurIndex = bombIndex++;\n\t\t\t\tif (curIndex == -1)\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (int k = 0; k < i; k++) {\n\t\t\t\t\tchange[RIGHT][k][j] += 1 << curIndex;\n\t\t\t\t\tif (j + 1 < columnCount)\n\t\t\t\t\t\tchange[LEFT][k][j + 1] += 1 << curIndex;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint count = treasureCount + bombCount;\n\t\tint[][][] cost = new int[rowCount][columnCount][1 << count];\n\t\tArrayUtils.fill(cost, -1);\n\t\tcost[sRow][sColumn][0] = 0;\n\t\tint[] rowQueue = new int[rowCount * columnCount * (1 << count)];\n\t\tint[] columnQueue = new int[rowQueue.length];\n\t\tint[] maskQueue = new int[rowQueue.length];\n\t\trowQueue[0] = sRow;\n\t\tcolumnQueue[0] = sColumn;\n\t\tint length = 1;\n\t\tfor (int i = 0; i < length; i++) {\n\t\t\tint row = rowQueue[i];\n\t\t\tint column = columnQueue[i];\n\t\t\tint mask = maskQueue[i];\n\t\t\tfor (int j = 0; j < 4; j++) {\n\t\t\t\tint nRow = row + MiscUtils.DX4[j];\n\t\t\t\tint nColumn = column + MiscUtils.DY4[j];\n\t\t\t\tint nMask = mask ^ change[j][row][column];\n\t\t\t\tif (!MiscUtils.isValidCell(nRow, nColumn, rowCount, columnCount) || table[nRow][nColumn] != '.' ||\n\t\t\t\t\tcost[nRow][nColumn][nMask] != -1)\n\t\t\t\t{\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tcost[nRow][nColumn][nMask] = cost[row][column][mask] + 1;\n\t\t\t\trowQueue[length] = nRow;\n\t\t\t\tcolumnQueue[length] = nColumn;\n\t\t\t\tmaskQueue[length++] = nMask;\n\t\t\t}\n\t\t}\n\t\tint answer = 0;\n\t\tfor (int i = 0; i < (1 << treasureCount); i++) {\n\t\t\tif (cost[sRow][sColumn][i] != -1) {\n\t\t\t\tint candidate = -cost[sRow][sColumn][i];\n\t\t\t\tfor (int j = 0; j < treasureCount; j++) {\n\t\t\t\t\tif ((i >> j & 1) == 1)\n\t\t\t\t\t\tcandidate += value[j];\n\t\t\t\t}\n\t\t\t\tanswer = Math.max(answer, candidate);\n\t\t\t}\n\t\t}\n\t\tout.printLine(answer);\n }\n}\n\nclass InputReader {\n\n\tprivate InputStream stream;\n\tprivate byte[] buf = new byte[1024];\n\tprivate int curChar;\n\tprivate int numChars;\n\tprivate SpaceCharFilter filter;\n\n\tpublic InputReader(InputStream stream) {\n\t\tthis.stream = stream;\n\t}\n\n\tpublic int read() {\n\t\tif (numChars == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (curChar >= numChars) {\n\t\t\tcurChar = 0;\n\t\t\ttry {\n\t\t\t\tnumChars = stream.read(buf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (numChars <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buf[curChar++];\n\t}\n\n\tpublic int readInt() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tint res = 0;\n\t\tdo {\n\t\t\tif (c < '0' || c > '9')\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n\n\tpublic boolean isSpaceChar(int c) {\n\t\tif (filter != null)\n\t\t\treturn filter.isSpaceChar(c);\n\t\treturn isWhitespace(c);\n\t}\n\n\tpublic static boolean isWhitespace(int c) {\n\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t}\n\n\tpublic char readCharacter() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\treturn (char) c;\n\t}\n\n\tpublic interface SpaceCharFilter {\n\t\tpublic boolean isSpaceChar(int ch);\n\t}\n}\n\nclass OutputWriter {\n\tprivate final PrintWriter writer;\n\n\tpublic OutputWriter(OutputStream outputStream) {\n\t\twriter = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n\t}\n\n\tpublic OutputWriter(Writer writer) {\n\t\tthis.writer = new PrintWriter(writer);\n\t}\n\n\tpublic void close() {\n\t\twriter.close();\n\t}\n\n\tpublic void printLine(int i) {\n\t\twriter.println(i);\n\t}\n}\n\nclass IOUtils {\n\n\tpublic static int[] readIntArray(InputReader in, int size) {\n\t\tint[] array = new int[size];\n\t\tfor (int i = 0; i < size; i++)\n\t\t\tarray[i] = in.readInt();\n\t\treturn array;\n\t}\n\n\tpublic static char[] readCharArray(InputReader in, int size) {\n\t\tchar[] array = new char[size];\n\t\tfor (int i = 0; i < size; i++)\n\t\t\tarray[i] = in.readCharacter();\n\t\treturn array;\n\t}\n\n\tpublic static char[][] readTable(InputReader in, int rowCount, int columnCount) {\n\t\tchar[][] table = new char[rowCount][];\n\t\tfor (int i = 0; i < rowCount; i++)\n\t\t\ttable[i] = readCharArray(in, columnCount);\n\t\treturn table;\n\t}\n\n\t}\n\nclass ArrayUtils {\n\n\tpublic static void fill(int[][] array, int value) {\n\t\tfor (int[] row : array)\n\t\t\tArrays.fill(row, value);\n\t}\n\n\tpublic static void fill(int[][][] array, int value) {\n\t\tfor (int[][] subArray : array)\n\t\t\tfill(subArray, value);\n\t}\n\n\t}\n\nclass MiscUtils {\n\tpublic static final int[] DX4 = {1, 0, -1, 0};\n\tpublic static final int[] DY4 = {0, -1, 0, 1};\n\n public static boolean isValidCell(int row, int column, int rowCount, int columnCount) {\n\t\treturn row >= 0 && row < rowCount && column >= 0 && column < columnCount;\n\t}\n\n\t}\n\n", "lang_cluster": "Java", "tags": ["shortest paths", "bitmasks"], "code_uid": "fdd449bb1791f2c0b9a1c61301c67e90", "src_uid": "624a0d6cf305fcf67d3f1cdc1c5fef8d", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.LinkedList;\nimport java.util.Queue;\nimport java.util.Scanner;\n\npublic class Div1C {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint n = in.nextInt(), m = in.nextInt();\n\t\tchar[][] g = new char[n][];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tg[i] = in.next().toCharArray();\n\t\tPoint start = null;\n\t\tint t = 0, b = 0;\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tif (Character.isDigit(g[i][j])) {\n\t\t\t\t\tt = Math.max(t, (int) (g[i][j] - '0'));\n\t\t\t\t} else if (g[i][j] == 'B') {\n\t\t\t\t\tb++;\n\t\t\t\t} else if (g[i][j] == 'S') {\n\t\t\t\t\tstart = new Point(i, j);\n\t\t\t\t}\n\t\t\t}\n\t\tPoint[] treasure = new Point[t];\n\t\tint[] value = new int[t];\n\t\tPoint[] boom = new Point[b];\n\t\tfor (int i = 0, bi = 0; i < n; i++)\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tif (Character.isDigit(g[i][j])) {\n\t\t\t\t\tint ti = g[i][j] - '1';\n\t\t\t\t\ttreasure[ti] = new Point(i, j);\n\t\t\t\t} else if (g[i][j] == 'B') {\n\t\t\t\t\tboom[bi++] = new Point(i, j);\n\t\t\t\t}\n\t\t\t}\n\t\tfor (int ti = 0; ti < t; ti++)\n\t\t\tvalue[ti] = in.nextInt();\n\t\tint[][][][] cost = new int[n][m][1 << t][1 << b];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tfor (int k = 0; k < (1 << t); k++) {\n\t\t\t\t\tfor (int l = 0; l < (1 << b); l++) {\n\t\t\t\t\t\tcost[i][j][k][l] = 19930309;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tQueue<State> queue = new LinkedList<State>();\n\t\tState state = new State(start, 0, 0);\n\t\tcost[state.p.x][state.p.y][state.ts][state.bs] = 0;\n\t\tqueue.add(state);\n\t\twhile (!queue.isEmpty()) {\n\t\t\tstate = queue.remove();\n\t\t\tfinal int[] dx = new int[] { 0, 0, 1, -1 };\n\t\t\tfinal int[] dy = new int[] { -1, 1, 0, 0 };\n\t\t\tfor (int d = 0; d < 4; d++) {\n\t\t\t\tState nstate = new State(new Point(state.p.x + dx[d], state.p.y\n\t\t\t\t\t\t+ dy[d]), state.ts, state.bs);\n\t\t\t\tif (nstate.p.x >= 0 && nstate.p.x < n && nstate.p.y >= 0\n\t\t\t\t\t\t&& nstate.p.y < m\n\t\t\t\t\t\t&& !Character.isDigit(g[nstate.p.x][nstate.p.y])\n\t\t\t\t\t\t&& g[nstate.p.x][nstate.p.y] != '#'\n\t\t\t\t\t\t&& g[nstate.p.x][nstate.p.y] != 'B') {\n\t\t\t\t\tfor (int i = 0; i < t; i++) {\n\t\t\t\t\t\tif (cross(treasure[i], state.p, nstate.p)) {\n\t\t\t\t\t\t\tnstate.ts ^= 1 << i;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tfor (int i = 0; i < b; i++) {\n\t\t\t\t\t\tif (cross(boom[i], state.p, nstate.p)) {\n\t\t\t\t\t\t\tnstate.bs ^= 1 << i;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (cost[nstate.p.x][nstate.p.y][nstate.ts][nstate.bs] > cost[state.p.x][state.p.y][state.ts][state.bs] + 1) {\n\t\t\t\t\t\tcost[nstate.p.x][nstate.p.y][nstate.ts][nstate.bs] = cost[state.p.x][state.p.y][state.ts][state.bs] + 1;\n\t\t\t\t\t\tqueue.add(nstate);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint answer = 0;\n\t\tfor (int ts = 0; ts < (1 << t); ts++) {\n\t\t\tint get = 0;\n\t\t\tfor (int i = 0; i < t; i++)\n\t\t\t\tif ((ts & (1 << i)) != 0) {\n\t\t\t\t\tget += value[i];\n\t\t\t\t}\n\t\t\tget -= cost[start.x][start.y][ts][0];\n\t\t\tanswer = Math.max(answer, get);\n\t\t}\n\t\tSystem.out.println(answer);\n\t}\n\n\tprivate static boolean cross(Point p, Point l1, Point l2) {\n\t\treturn (l1.y > p.y) != (l2.y > p.y)\n\t\t\t\t&& p.x * (l2.y - l1.y) * (l2.y - l1.y) < (l2.x - l1.x)\n\t\t\t\t\t\t* (p.y - l1.y) * (l2.y - l1.y) + l1.x * (l2.y - l1.y)\n\t\t\t\t\t\t* (l2.y - l1.y);\n\t}\n}\n\nclass Point {\n\tpublic int x, y;\n\n\tpublic Point(int x, int y) {\n\t\tthis.x = x;\n\t\tthis.y = y;\n\t}\n}\n\nclass State {\n\tPoint p;\n\tpublic int ts, bs;\n\n\tpublic State(Point p, int ts, int bs) {\n\t\tthis.p = p;\n\t\tthis.ts = ts;\n\t\tthis.bs = bs;\n\t}\n}\n", "lang_cluster": "Java", "tags": ["shortest paths", "bitmasks"], "code_uid": "f8fe03d81b7c4c8ce4c85e382246a07d", "src_uid": "624a0d6cf305fcf67d3f1cdc1c5fef8d", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class Main {\n\n\tBufferedReader in;\n\tStringTokenizer str = null;\n\tPrintWriter out;\n\t\n\tprivate String next() throws Exception{\n\t\tif (str == null || !str.hasMoreElements())\n\t\t\tstr = new StringTokenizer(in.readLine());\n\t\treturn str.nextToken();\n\t}\n\t\n\tprivate int nextInt() throws Exception{\n\t\treturn Integer.parseInt(next());\n\t}\n\t\n\tprivate long nextLong() throws Exception{\n\t\treturn Long.parseLong(next());\n\t}\n\t\n\tprivate double nextDouble() throws Exception{\n\t\treturn Double.parseDouble(next());\n\t}\n\n\tint dx[] = new int[]{1, 0, -1, 0};\n\tint dy[] = new int[]{0, -1, 0, 1};\n\n\tint n,m;\n\tchar maze[][];\n\tint state[][];\n\n\tboolean used[][][];\n\tint d[][][];\n\t\n\tpublic void run() throws Exception{\n\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\n\t\tn = nextInt();\n\t\tm = nextInt();\n\n\t\tint sx = -1;\n\t\tint sy = -1;\n\n\t\tstate = new int[n][m];\n\n\t\tint treasure = 0;\n\t\tmaze = new char[n][m];\n\t\tfor(int i=0;i<n;i++){\n\t\t\tmaze[i] = next().toCharArray();\n\t\t\tfor(int j=0;j<m;j++){\n\t\t\t\tif (maze[i][j] == 'S') {\n\t\t\t\t\tsx = i;\n\t\t\t\t\tsy = j;\n\t\t\t\t\tmaze[i][j] = '.';\n\t\t\t\t}else if ('0' <= maze[i][j] && maze[i][j] <= '9') {\n\t\t\t\t\tint idx = maze[i][j] - '1';\n\t\t\t\t\tfor(int k=j+1;k<m;k++){\n\t\t\t\t\t\tstate[i][k]|=1<<idx;\n\t\t\t\t\t}\n\t\t\t\t\ttreasure++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint []a = new int[treasure];\n\t\tfor(int i=0;i<treasure;i++) a[i] = nextInt();\n\n\t\tint sum[] = new int[1<<10];\n\t\tfor(int i=0;i<1<<treasure;i++) {\n\t\t\tfor(int j=0;j<treasure;j++) {\n\t\t\t\tif ((i & (1<<j)) > 0) {\n\t\t\t\t\tsum[i]+=a[j];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint bomb = treasure;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tfor(int j=0;j<m;j++){\n\t\t\t\tif (maze[i][j] == 'B') {\n\t\t\t\t\tfor(int k=j+1;k<m;k++){\n\t\t\t\t\t\tstate[i][k]|=1<<bomb;\n\t\t\t\t\t}\n\t\t\t\t\tbomb++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tused = new boolean[n][m][1<<bomb];\n\t\td = new int[n][m][1<<bomb];\n\n\t\tbfs(sx, sy);\n\t\tint ans = 0;\n\t\tfor(int i=0;i<1<<treasure;i++){\n\t\t\tif (used[sx][sy][i]) {\n\t\t\t\tans = Math.max(ans, sum[i] - d[sx][sy][i]);\n\t\t\t}\n\t\t}\n\n\t\tout.println(ans);\n\t\tout.close();\n\t}\n\n\tQueue<int[]> q;\n\n\tprivate void bfs(int sx, int sy) {\n\t\tq = new LinkedList<int[]>();\n\t\tq.add(new int[]{sx, sy, 0});\n\t\tused[sx][sy][0] = true;\n\t\td[sx][sy][0] = 0;\n\n\t\twhile(q.size() > 0){\n\t\t\tint cur[] = q.poll();\n\t\t\tint x = cur[0], y = cur[1], nst = cur[2];\n\n\t\t\tfor(int i=0;i<4;i++){\n\t\t\t\tint nx = x + dx[i], ny = y + dy[i], nstate = nst;\n\t\t\t\tif (!can(nx, ny)) continue;\n\t\t\t\tif (dx[i] == 1) {\n\t\t\t\t\tnstate^=state[nx][ny];\n\t\t\t\t}else if (dx[i] == -1) {\n\t\t\t\t\tnstate^=state[x][y];\n\t\t\t\t}\n\n\t\t\t\tif (used[nx][ny][nstate]) continue;\n\t\t\t\tused[nx][ny][nstate] = true;\n\t\t\t\td[nx][ny][nstate] = d[x][y][nst] + 1;\n\t\t\t\tq.add(new int[]{nx, ny, nstate});\n\t\t\t}\n\t\t}\n\t}\n\t\t\n\tprivate boolean can(int x, int y) {\n\t\tif (x < 0 || y < 0) return false;\n\t\tif (x >=n || y >= m) return false;\n\t\tif (maze[x][y] != '.') return false;\n\t\treturn true;\n\t}\n\n\tpublic static void main(String[] args) throws Exception{\n\t\tnew Main().run();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["shortest paths", "bitmasks"], "code_uid": "693556ff65aaccfadbe9db120e70aeb8", "src_uid": "624a0d6cf305fcf67d3f1cdc1c5fef8d", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n\nimport static java.lang.Double.parseDouble;\nimport static java.lang.Integer.MAX_VALUE;\nimport static java.lang.Integer.bitCount;\nimport static java.lang.Integer.parseInt;\nimport static java.lang.Long.parseLong;\n\npublic class Main {\n public static void main(String[] args) throws IOException {\n Solver sv = new Solver();\n sv.solve();\n }\n}\n\nclass Solver {\n BufferedReader in;\n StringTokenizer tok;\n\n public void solve() throws IOException {\n in = new BufferedReader(new InputStreamReader(System.in));\n\n int n = nextInt();\n int m = nextInt();\n String[] st = new String[n];\n int tr = 0, bomb = 0, sx = 0, sy = 0;\n int[] tx = new int [10];\n int[] ty = new int [10];\n int[] bx = new int [10];\n int[] by = new int [10];\n for(int i = 0; i < n; ++i) {\n st[i] = next();\n for(int j = 0; j < m; ++j) {\n char ch = st[i].charAt(j);\n if (ch >= '0' && ch <= '9') {\n tx[ch - '0' - 1] = i;\n ty[ch - '0' - 1] = j;\n ++tr;\n }\n if (ch == 'B') {\n bx[bomb] = i;\n by[bomb] = j;\n ++bomb;\n }\n if (ch == 'S') {\n sx = i;\n sy = j;\n }\n }\n }\n int[] cost = new int [tr];\n for(int i = 0; i < tr; ++i) {\n cost[i] = nextInt();\n }\n final int INF = Integer.MAX_VALUE;\n int[][][][] dist = new int [n][m][1 << tr][1 << bomb];\n for(int i = 0; i < n; ++i) {\n for(int j = 0; j < m; ++j) {\n for(int t = 0; t < 1 << tr; ++t) {\n for(int b = 0; b < 1 << bomb; ++b) {\n dist[i][j][t][b] = INF;\n }\n }\n }\n }\n dist[sx][sy][0][0] = 0;\n int[] Q = new int[20 * 20 * (1 << tr) * (1 << bomb) * 4];\n int l = 0,r = 0;\n Q[r++] = sx;\n Q[r++] = sy;\n Q[r++] = 0;\n Q[r++] = 0;\n\n final int[] dx = {1, 0, -1, 0};\n final int[] dy = {0, 1, 0, -1};\n\n while(l < r) {\n int x = Q[l++];\n int y = Q[l++];\n int t = Q[l++];\n int b = Q[l++];\n\n\n for(int d = 0; d < 4; ++d) {\n int nx = x + dx[d];\n int ny = y + dy[d];\n if (nx < 0 || ny < 0 || nx >= n || ny >= m) {\n continue;\n }\n if (st[nx].charAt(ny) == '.' || st[nx].charAt(ny) == 'S') {\n int nt = t;\n int nb = b;\n for(int i = 0; i < tr; ++i) {\n if (intersects(tx[i], ty[i], x, y, nx, ny)) {\n nt ^= (1 << i);\n }\n }\n for(int i = 0; i < bomb; ++i) {\n if (intersects(bx[i], by[i], x, y, nx, ny)) {\n nb ^= (1 << i);\n }\n }\n if (dist[nx][ny][nt][nb] == INF) {\n dist[nx][ny][nt][nb] = dist[x][y][t][b] + 1;\n Q[r++] = nx;\n Q[r++] = ny;\n Q[r++] = nt;\n Q[r++] = nb;\n }\n }\n }\n }\n\n int ans = 0;\n\n for(int t = 0; t < 1 << tr; ++t) {\n int d = dist[sx][sy][t][0];\n if (d == INF) {\n continue;\n }\n int cur = 0;\n for(int j = 0; j < tr; ++j) {\n if (((t >> j) & 1) == 1) {\n cur += cost[j];\n }\n }\n ans = Math.max(ans, cur - d);\n }\n\n System.out.println(ans);\n }\n\n final double eps = 1e-7;\n\n boolean intersects(int sx, int sy, int ax, int ay, int bx, int by) {\n // (42, 43) ray from (sx, sy)\n\n int a1 = 43;\n int b1 = -42;\n int c1 = (sx + 42) * sy - sx * (sy + 43);\n\n int a2 = by - ay;\n int b2 = ax - bx;\n int c2 = bx * ay - ax * by;\n\n double det = a1 * b2 - a2 * b1;\n double detx = b1 * c2 - b2 * c1;\n double dety = a2 * c1 - c2 * a1;\n detx /= det;\n dety /= det;\n return detx > Math.min(ax, bx) - eps && detx < Math.max(ax, bx) + eps\n && dety > Math.min(ay, by) - eps && dety < Math.max(ay, by) + eps\n && detx > sx;\n }\n\n String next() throws IOException {\n if (tok == null || !tok.hasMoreTokens()) {\n tok = new StringTokenizer(in.readLine());\n }\n return tok.nextToken();\n }\n\n int nextInt() throws IOException {\n return parseInt(next());\n }\n\n long nextLong() throws IOException {\n return parseLong(next());\n }\n\n double nextDouble() throws IOException {\n return parseDouble(next());\n }\n}", "lang_cluster": "Java", "tags": ["shortest paths", "bitmasks"], "code_uid": "e7c76f47dc61655c05a3789a9d3bc682", "src_uid": "624a0d6cf305fcf67d3f1cdc1c5fef8d", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.lang.reflect.Array;\nimport java.math.BigDecimal;\nimport java.sql.Time;\nimport java.util.*;\n\nimport java.math.BigInteger;\n\nimport static java.lang.Math.*;\nimport static java.math.BigInteger.*;\nimport static java.util.Arrays.*;\n\n\npublic class Main{\n\n void run(){\n Locale.setDefault(Locale.US);\n boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n// boolean oj = true;\n try{\n if( oj ){\n sc = new FastScanner( new InputStreamReader(System.in ) );\n out = new PrintWriter( new OutputStreamWriter(System.out) );\n } else{\n sc = new FastScanner(new FileReader(\"in.txt\") );\n// sc = new FastScanner(new FileReader(\"D:\\\\JavaOlymp\\\\FatalError\\\\output.txt\") );\n out = new PrintWriter( new FileWriter(\"out.txt\") );\n }\n } catch (Exception e) {\n System.exit(-1);\n }\n long tB = System.currentTimeMillis();\n solve();\n if( !oj ) System.err.println( \"Time: \" + (System.currentTimeMillis()-tB)/1e3 );\n out.flush();\n }\n\n\n class FastScanner{\n BufferedReader br;\n StringTokenizer st = new StringTokenizer(\"\");\n FastScanner( InputStreamReader a ){\n br = new BufferedReader(a);\n }\n FastScanner( FileReader a ){\n br = new BufferedReader(a);\n }\n String next(){\n while( !st.hasMoreTokens() )\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n return null;\n }\n return st.nextToken();\n }\n String readLine(){\n try {\n return br.readLine();\n } catch (Exception e) {\n return null;\n }\n }\n int nextInt(){ return Integer.parseInt(next()); }\n long nextLong(){ return Long.parseLong(next()); }\n }\n\n FastScanner sc;\n PrintWriter out;\n\n\n\n public static void main(String[] args){\n new Main().run();\n// new Thread( null, new Runnable() {\n// @Override\n// public void run() {\n// new Main().run();\n// }\n// }, \"LOL\", 256L * 1024 * 1024 / 2 ).run();\n// }, \"LOL\", 2000 * 1024 * 1024 ).run();\n }\n\n\n\n void TLE(){ for(;;); }\n\n void MLE(){\n int[][] adj = new int[1024*1024][];\n for( int i = 0; i < adj.length; ++i )\n adj[i] = new int[1024*1024];\n }\n\n void exit( int val ){\n out.flush();\n System.exit(val);\n }\n //////////////////////////////////////////////////////////////////////////////////////////\n\n class Item{\n int i, j, msk;\n Item( int _i, int _j, int _msk ){\n i = _i;\n j = _j;\n msk = _msk;\n }\n }\n\n final int inf = Integer.MAX_VALUE / 10;\n int n, m, Si, Sj;\n char[][] gr;\n\n int timer, mskOfBomb;\n int[] idObj;\n\n int[] cost = new int[9];\n int[][] dp;\n int[][] howI = new int[1000][1000];\n int[][] howJ = new int[1000][1000];\n int[][] howM = new int[1000][1000];\n {\n for( int i = 0; i < 1000; ++i ){\n fill( howI[i], -1 );\n fill( howJ[i], -1 );\n fill( howM[i], -1 );\n }\n }\n\n void f( int i, int j, int msk ){\n if( i==Si && j==Sj && msk==0 ){\n }\n else{\n f(\n howI[i*m+j][msk],\n howJ[i*m+j][msk],\n howM[i*m+j][msk]);\n }\n out.printf(\"%d %d %4s\\n\", i, j, Integer.toBinaryString(msk));\n }\n\n void solve(){\n n = sc.nextInt();\n m = sc.nextInt();\n gr = new char[n][];\n idObj = new int[n*m]; fill( idObj, -1 );\n for( int i = 0; i < n; ++i )\n gr[i] = sc.next().toCharArray();\n\n int[] tmp = new int[9];\n for( int i = 1; ; ++i )\n try {\n tmp[i] = sc.nextInt();\n } catch (Exception e) {\n break;\n }\n\n for( int i = 0; i < n; ++i ){\n for( int j = 0; j < m; ++j ){\n char c = gr[i][j];\n if( Character.isDigit(c) ){\n idObj[i*m+j] = timer++;\n cost[timer-1] = tmp[c - '0'];\n }\n if( c=='B' ){\n idObj[i*m+j] = timer++;\n mskOfBomb |= 1 << (timer-1);\n }\n if( c == 'S' ){\n Si = i;\n Sj = j;\n }\n }\n }\n\n dp = new int[n*m][1<<8];\n for( int[] dpi : dp ) fill( dpi, inf );\n dp[Si*m + Sj][0] = 0;\n ArrayDeque<Item> Q = new ArrayDeque<Item>();\n Q.add(new Item(Si,Sj,0));\n while( !Q.isEmpty() ){\n Item v = Q.pollFirst();\n for( int di = -1; di <= 1; ++di ){\n for( int dj = -1; dj <= 1; ++dj ){\n if( abs(di) + abs(dj) != 1 ) continue;\n Item to = new Item(v.i+di, v.j+dj, v.msk);\n if(!( 0<=to.i && to.i<n &&\n 0<=to.j && to.j<m &&\n (gr[to.i][to.j] == '.' || gr[to.i][to.j]=='S') ))\n continue;\n if( abs(di)==1 ){\n int curI = min(v.i, to.i);\n for( int k = 0; k < v.j; ++k ){\n int id = idObj[curI*m + k];\n if( id != -1 ) to.msk ^= 1 << id;\n }\n }\n if( dp[to.i*m + to.j][to.msk] > dp[v.i*m + v.j][v.msk] + 1 ){\n dp[to.i*m + to.j][to.msk] = dp[v.i*m + v.j][v.msk] + 1;\n Q.addLast(to);\n howI[to.i*m + to.j][to.msk] = v.i;\n howJ[to.i*m + to.j][to.msk] = v.j;\n howM[to.i*m + to.j][to.msk] = v.msk;\n }\n }\n }\n }\n\n int ans = 0;\n for( int msk = 0; msk < 1<<8; ++msk ){\n if( (msk & mskOfBomb) == 0 &&\n dp[Si*m + Sj][msk] != inf ){\n int cost = 0;\n for( int i = 0; i < 8; ++i )\n if( (msk & (1<<i)) != 0 )\n cost += this.cost[i];\n ans = max( ans, cost - dp[Si*m + Sj][msk] );\n }\n }\n\n out.println(ans);\n }\n\n\n\n}\n", "lang_cluster": "Java", "tags": ["shortest paths", "bitmasks"], "code_uid": "5e385a111dfbc2a1f1809ef4c7fdcc48", "src_uid": "624a0d6cf305fcf67d3f1cdc1c5fef8d", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "//package round221;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayDeque;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.Queue;\n\npublic class C {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t\tint n = ni(), m = ni();\n\t\tchar[][] map = nm(n,m);\n\t\tint sr = -1, sc = -1;\n\t\tint[][] objs = new int[8][];\n\t\tint p = 0;\n\t\tint max = 0;\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tfor(int j = 0;j < m;j++){\n\t\t\t\tif(map[i][j] == 'S'){\n\t\t\t\t\tsr = i; sc = j;\n\t\t\t\t\tmap[sr][sc] = '.';\n\t\t\t\t}\n\t\t\t\tif(map[i][j] >= '1' && map[i][j] <= '9'){\n\t\t\t\t\tobjs[p++] = new int[]{i, j, map[i][j]-'0'};\n\t\t\t\t\tmax = Math.max(max, map[i][j]-'0');\n\t\t\t\t}\n\t\t\t\tif(map[i][j] == 'B'){\n\t\t\t\t\tobjs[p++] = new int[]{i, j, -99999};\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint[] price = na(max);\n\t\tfor(int i = 0;i < p;i++){\n\t\t\tif(objs[i][2] >= 0){\n\t\t\t\tobjs[i][2] = price[objs[i][2]-1];\n\t\t\t}\n\t\t}\n\t\t\n\t\tint I = 999999;\n\t\tint[][][] d = new int[n][m][1<<p];\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tfor(int j = 0;j < m;j++){\n\t\t\t\tArrays.fill(d[i][j], I);\n\t\t\t}\n\t\t}\n\t\td[sr][sc][0] = 0;\n\t\tQueue<Integer> q = new ArrayDeque<Integer>();\n\t\tq.add(enc(sr, sc, 0));\n\t\tint[] dr = { 1, 0, -1, 0 };\n\t\tint[] dc = { 0, 1, 0, -1 };\n\t\twhile(!q.isEmpty()){\n\t\t\tint cur = q.poll();\n\t\t\tint r = cur>>>5&31, c = cur&31, ptn = cur>>>10;\n\t\t\tfor(int k = 0;k < 4;k++){\n\t\t\t\tint nr = r + dr[k], nc = c + dc[k];\n\t\t\t\tif(nr >= 0 && nr < n && nc >= 0 && nc < m && map[nr][nc] == '.'){\n\t\t\t\t\tint nptn = ptn;\n\t\t\t\t\tif(k == 2){\n\t\t\t\t\t\tfor(int u = 0;u < p;u++){\n\t\t\t\t\t\t\tif(objs[u][0] == r && objs[u][1] < c)nptn ^= 1<<u;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif(k == 0){\n\t\t\t\t\t\tfor(int u = 0;u < p;u++){\n\t\t\t\t\t\t\tif(objs[u][0] == nr && objs[u][1] < nc)nptn ^= 1<<u;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif(d[nr][nc][nptn] > d[r][c][ptn] + 1){\n\t\t\t\t\t\td[nr][nc][nptn] = d[r][c][ptn] + 1;\n\t\t\t\t\t\tq.add(enc(nr, nc, nptn));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tlong ret = 0;\n\t\tfor(int i = 0;i < 1<<p;i++){\n\t\t\tlong tot = 0;\n\t\t\tfor(int j = 0;j < p;j++){\n\t\t\t\tif(i<<31-j<0){\n\t\t\t\t\ttot += objs[j][2];\n\t\t\t\t}\n\t\t\t}\n\t\t\tret = Math.max(ret, tot - d[sr][sc][i]);\n\t\t}\n\t\tout.println(ret);\n\t}\n\t\n\tint enc(int r, int c, int ptn)\n\t{\n\t\treturn ptn<<10|r<<5|c;\n\t}\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new C().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tprivate int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["shortest paths", "bitmasks"], "code_uid": "3895416f54533fc5e65080dd9c0941b8", "src_uid": "624a0d6cf305fcf67d3f1cdc1c5fef8d", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "//package codeforces;\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.*;\n\npublic class C {\n BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n PrintWriter writer = new PrintWriter(System.out);\n StringTokenizer stringTokenizer;\n\n String next() throws IOException {\n while (stringTokenizer == null || !stringTokenizer.hasMoreTokens()) {\n stringTokenizer = new StringTokenizer(reader.readLine());\n }\n return stringTokenizer.nextToken();\n }\n\n int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n void solve() throws IOException {\n int n = nextInt();\n int m = nextInt();\n char[][] map = new char[n][];\n int bombs = 0;\n int treasures = 0;\n for (int i = 0; i < n; i++) {\n map[i] = next().toCharArray();\n for (int j = 0; j < m; j++) {\n if (map[i][j] == 'B') bombs++;\n if (map[i][j] >= '0' && map[i][j] <= '9') {\n treasures++;\n map[i][j]--;\n }\n }\n }\n int[] treasureCosts = new int[treasures];\n for (int i = 0; i < treasures; i++) {\n treasureCosts[i] = nextInt();\n }\n class Point {\n int x, y;\n\n Point(int x, int y) {\n this.x = x;\n this.y = y;\n }\n\n Point subtract(Point other) {\n return new Point(x - other.x, y - other.y);\n }\n\n int vectorProduct(Point other) {\n return x * other.y - y * other.x;\n }\n\n Point add(Point other) {\n return new Point(x + other.x, y + other.y);\n }\n }\n class GeomUtils {\n Point cellCenter(int row, int column) {\n return new Point(2 * row + 1, 2 * column + 1);\n }\n\n Point ray = new Point(40, 41);\n\n double getT(Point o, Point v, Point s1, Point s2) {\n Point vs = s2.subtract(s1);\n int r = vs.vectorProduct(s2) - vs.vectorProduct(o);\n int l = vs.vectorProduct(v);\n return 1.0 * r / l;\n }\n\n boolean intersects(Point o, Point s1, Point s2) {\n if (getT(o, ray, s1, s2) < 0.0) return false;\n double t = getT(s1, s2.subtract(s1), o, o.add(ray));\n return t >= 0.0 && t <= 1.0;\n }\n }\n Point[] treasureCoords = new Point[treasures];\n Point[] bombCoords = new Point[bombs];\n bombs = 0;\n int si = 0, sj = 0;\n GeomUtils geomUtils = new GeomUtils();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n if (map[i][j] == 'B') {\n bombCoords[bombs++] = geomUtils.cellCenter(i, j);\n }\n if (map[i][j] >= '0' && map[i][j] <= '9') {\n treasureCoords[map[i][j] - '0'] = geomUtils.cellCenter(i, j);\n }\n if (map[i][j] == 'S') {\n si = i;\n sj = j;\n }\n }\n }\n int[][][][] dist = new int[n][m][1 << treasures][1 << bombs];\n for (int i = 0; i < n; i++)\n for (int j = 0; j < m; j++)\n for (int k = 0; k < 1 << treasures; k++)\n for (int l = 0; l < 1 << bombs; l++) dist[i][j][k][l] = Integer.MAX_VALUE;\n dist[si][sj][0][0] = 0;\n Queue<Integer> qi = new LinkedList<>(), qj = new LinkedList<>(), qt = new LinkedList<>(), qb = new LinkedList<>();\n qi.add(si);\n qj.add(sj);\n qt.add(0);\n qb.add(0);\n int[] di = {0, -1, 0, 1};\n int[] dj = {-1, 0, 1, 0};\n while (!qi.isEmpty()) {\n int i = qi.poll();\n int j = qj.poll();\n int tmask = qt.poll();\n int bmask = qb.poll();\n Point s1 = geomUtils.cellCenter(i, j);\n for (int k = 0; k < 4; k++) {\n int ii = i + di[k];\n int jj = j + dj[k];\n if (ii < 0 || ii >= n || jj < 0 || jj >= m || map[ii][jj] != '.' && map[ii][jj] != 'S') continue;\n int tm = 0;\n for (int ti = 0; ti < treasures; ti++) {\n if (geomUtils.intersects(treasureCoords[ti], s1, geomUtils.cellCenter(ii, jj))) {\n tm |= 1 << ti;\n }\n }\n int bm = 0;\n for (int bi = 0; bi < bombs; bi++) {\n if (geomUtils.intersects(bombCoords[bi], s1, geomUtils.cellCenter(ii, jj))) {\n bm |= 1 << bi;\n }\n }\n if (dist[ii][jj][tmask ^ tm][bmask ^ bm] == Integer.MAX_VALUE) {\n dist[ii][jj][tmask ^ tm][bmask ^ bm] = dist[i][j][tmask][bmask] + 1;\n qi.add(ii);\n qj.add(jj);\n qt.add(tmask ^ tm);\n qb.add(bmask ^ bm);\n }\n }\n }\n int ans = 0;\n for (int i = 0; i < 1 << treasures; i++) {\n if(dist[si][sj][i][0] == Integer.MAX_VALUE) continue;\n int tCost = 0;\n for (int j = 0; j < treasures; j++) {\n if (((i >> j) & 1) == 1) tCost += treasureCosts[j];\n }\n ans = Math.max(ans, tCost - dist[si][sj][i][0]);\n }\n writer.println(ans);\n writer.close();\n }\n\n public static void main(String[] args) throws IOException {\n new C().solve();\n }\n}\n", "lang_cluster": "Java", "tags": ["shortest paths", "bitmasks"], "code_uid": "afddb661d6dcd56c9aec5a836489ae50", "src_uid": "624a0d6cf305fcf67d3f1cdc1c5fef8d", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main implements Runnable {\n\n\tpublic void _main() throws IOException {\n\t\tfinal int infinity = 1000000000;\n\t\t// A ray that is not collinear with any of the (dx, dy)`s\n\t\tfinal int RAY_R = 31;\n\t\tfinal int RAY_C = 37;\n\t\tint height = nextInt();\n\t\tint width = nextInt();\n\t\tchar[][] s = new char[height][];\n\t\tint sr = -1;\n\t\tint sc = -1;\n\t\tint numTreasures = 0;\n\t\tint numBombs = 0;\n\t\tint[][] treasureId = new int[height][width];\n\t\tint[][] bombId = new int[height][width];\t\t\n\t\tfor (int r = 0; r < height; r++) {\n\t\t\ts[r] = next().toCharArray();\n\t\t\tfor (int c = 0; c < width; c++) {\n\t\t\t\tif (s[r][c] == 'S') {\n\t\t\t\t\tsr = r;\n\t\t\t\t\tsc = c;\n\t\t\t\t\ts[r][c] = '.';\n\t\t\t\t}\n\t\t\t\ttreasureId[r][c] = -1;\n\t\t\t\tif (Character.isDigit(s[r][c])) {\n\t\t\t\t\ttreasureId[r][c] = s[r][c] - '1';\n\t\t\t\t\t++numTreasures;\n\t\t\t\t}\n\t\t\t\tbombId[r][c] = -1;\n\t\t\t\tif (s[r][c] == 'B') {\n\t\t\t\t\tbombId[r][c] = numBombs;\n\t\t\t\t\t++numBombs;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint[] treasureR = new int[numTreasures];\n\t\tint[] treasureC = new int[numTreasures];\n\t\tint[] bombR = new int[numBombs];\n\t\tint[] bombC = new int[numBombs];\n\t\tfor (int r = 0; r < height; r++) {\n\t\t\tfor (int c = 0; c < width; c++) {\n\t\t\t\tif (treasureId[r][c] >= 0) {\n\t\t\t\t\tint id = treasureId[r][c];\n\t\t\t\t\ttreasureR[id] = r;\n\t\t\t\t\ttreasureC[id] = c;\n\t\t\t\t}\n\t\t\t\tif (bombId[r][c] >= 0) {\n\t\t\t\t\tint id = bombId[r][c];\n\t\t\t\t\tbombR[id] = r;\n\t\t\t\t\tbombC[id] = c;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint[] cost = new int[numTreasures];\n\t\tfor (int i = 0; i < numTreasures; i++) {\n\t\t\tcost[i] = nextInt();\n\t\t}\n\t\tint[] value = new int[1 << (numTreasures + numBombs)];\n\t\tfor (int i = 1; i < value.length; i++) {\n\t\t\tint j = Integer.numberOfTrailingZeros(i);\n\t\t\tif (j < numTreasures) {\n\t\t\t\tvalue[i] = cost[j] + value[i ^ (1 << j)];\n\t\t\t} else {\n\t\t\t\tvalue[i] = -infinity;\n\t\t\t}\n\t\t}\n\t\tint qsize = height * width * (1 << (numTreasures + numBombs));\n\t\tint[] qr = new int[qsize];\n\t\tint[] qc = new int[qsize];\n\t\tint[] qmask = new int[qsize];\n\t\tint[][][] dist = new int[height][width][1 << (numTreasures + numBombs)];\n\t\tfor (int r = 0; r < height; r++) {\n\t\t\tfor (int c = 0; c < width; c++) {\n\t\t\t\tArrays.fill(dist[r][c], infinity);\n\t\t\t}\n\t\t}\n\t\tdist[sr][sc][0] = 0;\n\t\tqr[0] = sr;\n\t\tqc[0] = sc;\n\t\tqmask[0] = 0;\n\t\tint qt = 0;\n\t\tint qh = 1;\n\t\tint ans = 0;\n\t\twhile (qt < qh) {\n\t\t\tint r = qr[qt];\n\t\t\tint c = qc[qt];\n\t\t\tint mask = qmask[qt];\n\t\t\t++qt;\n\t\t\tif (r == sr && c == sc) {\n\t\t\t\tans = Math.max(ans, value[mask] - dist[r][c][mask]);\n\t\t\t}\n\t\t\tfor (int dr = -1; dr <= 1; dr++) {\n\t\t\t\tfor (int dc = -1; dc <= 1; dc++) {\n\t\t\t\t\tif (dr == 0 ^ dc == 0) {\n\t\t\t\t\t\tint nr = r + dr;\n\t\t\t\t\t\tint nc = c + dc;\n\t\t\t\t\t\tif (nr < 0 || nr >= height || nc < 0 || nc >= width) continue;\n\t\t\t\t\t\tif (s[nr][nc] != '.') continue;\n\t\t\t\t\t\tint nmask = mask;\n\t\t\t\t\t\tfor (int i = 0; i < numTreasures + numBombs; i++) {\n\t\t\t\t\t\t\tint or, oc;\n\t\t\t\t\t\t\tif (i < numTreasures) {\n\t\t\t\t\t\t\t\tor = treasureR[i];\n\t\t\t\t\t\t\t\toc = treasureC[i];\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tor = bombR[i - numTreasures];\n\t\t\t\t\t\t\t\toc = bombC[i - numTreasures];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tint r1 = r - or;\n\t\t\t\t\t\t\tint c1 = c - oc;\n\t\t\t\t\t\t\tint r2 = nr - or;\n\t\t\t\t\t\t\tint c2 = nc - oc;\n\t\t\t\t\t\t\tif (r1 < 0 || r2 < 0 || c1 < 0 || c2 < 0) continue;\n\t\t\t\t\t\t\tif (Integer.signum(cross(r1, c1, RAY_R, RAY_C)) == Integer.signum(cross(RAY_R, RAY_C, r2, c2))) {\n\t\t\t\t\t\t\t\tnmask ^= 1 << i;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (dist[nr][nc][nmask] > 1 + dist[r][c][mask]) {\n\t\t\t\t\t\t\tdist[nr][nc][nmask] = 1 + dist[r][c][mask];\n\t\t\t\t\t\t\tqr[qh] = nr;\n\t\t\t\t\t\t\tqc[qh] = nc;\n\t\t\t\t\t\t\tqmask[qh] = nmask;\n\t\t\t\t\t\t\t++qh;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tout.println(ans);\n\t}\n\n\tprivate int cross(int x1, int y1, int x2, int y2) {\n\t\treturn x1*y2 - x2*y1;\n\t}\n\n\n\tprivate BufferedReader in;\n\tprivate PrintWriter out;\n\tprivate StringTokenizer st;\n\n\tprivate String next() throws IOException {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\tString rl = in.readLine();\n\t\t\tif (rl == null)\n\t\t\t\treturn null;\n\t\t\tst = new StringTokenizer(rl);\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tprivate int nextInt() throws IOException {\n\t\treturn Integer.parseInt(next());\n\t}\n\n\tprivate long nextLong() throws IOException {\n\t\treturn Long.parseLong(next());\n\t}\n\n\tprivate double nextDouble() throws IOException {\n\t\treturn Double.parseDouble(next());\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tLocale.setDefault(Locale.UK);\n\t\tnew Thread(new Main()).start();\n\t}\n\n\tpublic void run() {\n\t\ttry {\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(System.out);\n\t\t\t//in = new BufferedReader(new FileReader(\"a.in\"));\n\t\t\t//out = new PrintWriter(new FileWriter(\"a.out\"));\n\n\t\t\t_main();\n\n\t\t\tout.close();\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(202);\n\t\t}\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["shortest paths", "bitmasks"], "code_uid": "8c4e19236306187cae069270a2bc7001", "src_uid": "624a0d6cf305fcf67d3f1cdc1c5fef8d", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.LinkedList;\nimport java.util.Queue;\nimport java.util.StringTokenizer;\n\n/**\n * @author Don Li\n */\npublic class CirclingRoundTreasures {\n \n int INF = (int) 1e7;\n \n int[] dx = new int[]{-1, 0, 0, 1};\n int[] dy = new int[]{0, -1, 1, 0};\n \n void solve() {\n int n = in.nextInt(), m = in.nextInt();\n char[][] s = new char[n][];\n for (int i = 0; i < n; i++) s[i] = in.nextToken().toCharArray();\n \n int t = 0, b = 0;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n if (s[i][j] >= '1' && s[i][j] <= '8') t++;\n else if (s[i][j] == 'B') b++;\n }\n }\n \n int[] v = new int[t + b];\n for (int i = 0; i < t; i++) v[i] = in.nextInt();\n \n int sx = -1, sy = -1;\n int[] X = new int[t + b], Y = new int[t + b];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n if (s[i][j] >= '1' && s[i][j] <= '8') {\n int id = s[i][j] - '1';\n X[id] = i;\n Y[id] = j;\n } else if (s[i][j] == 'B') {\n X[t] = i;\n Y[t] = j;\n v[t] = -INF;\n t++;\n } else if (s[i][j] == 'S') {\n sx = i;\n sy = j;\n }\n }\n }\n \n int[] cost = new int[1 << t];\n for (int i = 0; i < 1 << t; i++) {\n for (int j = 0; j < t; j++) {\n if ((i & (1 << j)) > 0) cost[i] += v[j];\n }\n }\n \n int[][][] dp = new int[n][m][1 << t];\n for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) Arrays.fill(dp[i][j], INF);\n \n int ans = 0;\n Queue<int[]> qu = new LinkedList<>();\n qu.offer(new int[]{sx, sy, 0});\n dp[sx][sy][0] = 0;\n while (!qu.isEmpty()) {\n int[] a = qu.poll();\n int x = a[0], y = a[1], mask = a[2];\n if (x == sx && y == sy) {\n ans = Math.max(ans, cost[mask] - dp[x][y][mask]);\n }\n for (int i = 0; i < 4; i++) {\n int nx = x + dx[i], ny = y + dy[i];\n if (nx >= 0 && nx < n && ny >= 0 && ny < m && (s[nx][ny] == '.' || s[nx][ny] == 'S')) {\n int nmask = mask;\n for (int j = 0; j < t; j++) {\n if (cross(x, y, nx, ny, X[j], Y[j])) nmask ^= 1 << j;\n }\n if (dp[nx][ny][nmask] > dp[x][y][mask] + 1) {\n dp[nx][ny][nmask] = dp[x][y][mask] + 1;\n qu.offer(new int[]{nx, ny, nmask});\n }\n }\n }\n }\n out.println(ans);\n }\n \n boolean cross(int x1, int y1, int x2, int y2, int x, int y) {\n return x == x1 && y < y1 && x == x2 + 1 && y < y2 || x == x2 && y < y2 && x == x1 + 1 && y < y1;\n }\n \n public static void main(String[] args) {\n in = new FastScanner(new BufferedReader(new InputStreamReader(System.in)));\n out = new PrintWriter(System.out);\n new CirclingRoundTreasures().solve();\n out.close();\n }\n \n static FastScanner in;\n static PrintWriter out;\n \n static class FastScanner {\n BufferedReader in;\n StringTokenizer st;\n \n public FastScanner(BufferedReader in) {\n this.in = in;\n }\n \n public String nextToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(in.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n \n public int nextInt() {\n return Integer.parseInt(nextToken());\n }\n \n public long nextLong() {\n return Long.parseLong(nextToken());\n }\n \n public double nextDouble() {\n return Double.parseDouble(nextToken());\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["shortest paths", "bitmasks"], "code_uid": "c6359cbc6bb8810d017900733b97a394", "src_uid": "624a0d6cf305fcf67d3f1cdc1c5fef8d", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.FileInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.nio.charset.Charset;\nimport java.util.Arrays;\n\npublic class CF1153F {\n public static void main(String[] args) throws Exception {\n boolean local = System.getProperty(\"ONLINE_JUDGE\") == null;\n boolean async = false;\n\n Charset charset = Charset.forName(\"ascii\");\n\n FastIO io = local ? new FastIO(new FileInputStream(\"D:\\\\DATABASE\\\\TESTCASE\\\\Code.in\"), System.out, charset) : new FastIO(System.in, System.out, charset);\n Task task = new Task(io, new Debug(local));\n\n if (async) {\n Thread t = new Thread(null, task, \"dalt\", 1 << 27);\n t.setPriority(Thread.MAX_PRIORITY);\n t.start();\n t.join();\n } else {\n task.run();\n }\n\n if (local) {\n io.cache.append(\"\\n\\n--memory -- \\n\" + ((Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory()) >> 20) + \"M\");\n }\n\n io.flush();\n }\n\n public static class Task implements Runnable {\n final FastIO io;\n final Debug debug;\n int inf = (int) 1e8;\n int mod = 998244353;\n int[][][] mem;\n boolean[][][] visit;\n int l1;\n int l2;\n int l3;\n int n;\n int k;\n int time;\n\n public Task(FastIO io, Debug debug) {\n this.io = io;\n this.debug = debug;\n }\n\n @Override\n public void run() {\n solve();\n }\n\n public void solve() {\n n = io.readInt();\n k = io.readInt();\n int l = io.readInt();\n mem = new int[2][n + 1][n + 1];\n visit = new boolean[2][n + 1][n + 1];\n int meetCount = find(n, n, 1);\n\n int factorial = 1;\n for (int i = 2, until = 2 * n + 1; i <= until; i++) {\n factorial = mul(factorial, i);\n }\n int total = mul(factorial, Mathematics.inverse(Mathematics.pow(2, n, mod), mod));\n int probability = mul(meetCount, Mathematics.inverse(total, mod));\n int expectLength = mul(l, probability);\n io.cache.append(expectLength);\n }\n\n public int add(int a, int b) {\n return (a + b) % mod;\n }\n\n public int sub(int a, int b) {\n if (a >= b) {\n return a - b;\n }\n return a - b + mod;\n }\n\n public int mul(int a, int b) {\n return (int) (((long) a * b) % mod);\n }\n\n public int find(int i, int j, int x) {\n time++;\n if (i < 0 || i > n || j < 0 || j > n) {\n return 0;\n }\n if (i == 0 && j == 0 && x == 0) {\n return 1;\n }\n if (visit[x][i][j]) {\n return mem[x][i][j];\n }\n visit[x][i][j] = true;\n mem[x][i][j] = 0;\n if (i < j) {\n return 0;\n }\n if (x == 1) {\n mem[x][i][j] = (mem[x][i][j] + find(i, j, 0) * (i - j >= k ? 1 : 0)) % mod;\n }\n mem[x][i][j] = (int) ((mem[x][i][j] + (long) (n - i + 1) * find(i - 1, j, x)) % mod);\n mem[x][i][j] = (int)((mem[x][i][j] + (long)(i - j + 1) * find(i, j - 1, x)) % mod);\n return mem[x][i][j];\n }\n }\n\n public static class Mathematics {\n\n public static int ceilPowerOf2(int x) {\n return 32 - Integer.numberOfLeadingZeros(x - 1);\n }\n\n public static int floorPowerOf2(int x) {\n return 31 - Integer.numberOfLeadingZeros(x);\n }\n\n public static long modmul(long a, long b, long mod) {\n return b == 0 ? 0 : ((modmul(a, b >> 1, mod) << 1) % mod + a * (b & 1)) % mod;\n }\n\n /**\n * Get the greatest common divisor of a and b\n */\n public static int gcd(int a, int b) {\n return a >= b ? gcd0(a, b) : gcd0(b, a);\n }\n\n private static int gcd0(int a, int b) {\n return b == 0 ? a : gcd0(b, a % b);\n }\n\n public static int extgcd(int a, int b, int[] coe) {\n if (a >= b) {\n return extgcd0(a, b, coe);\n } else {\n int g = extgcd0(b, a, coe);\n int tmp = coe[0];\n coe[0] = coe[1];\n coe[1] = tmp;\n return g;\n }\n }\n\n private static int extgcd0(int a, int b, int[] coe) {\n if (b == 0) {\n coe[0] = 1;\n coe[1] = 0;\n return a;\n }\n int g = extgcd0(b, a % b, coe);\n int n = coe[0];\n int m = coe[1];\n coe[0] = m;\n coe[1] = n - m * (a / b);\n return g;\n }\n\n /**\n * Get the greatest common divisor of a and b\n */\n public static long gcd(long a, long b) {\n return a >= b ? gcd0(a, b) : gcd0(b, a);\n }\n\n private static long gcd0(long a, long b) {\n return b == 0 ? a : gcd0(b, a % b);\n }\n\n public static long extgcd(long a, long b, long[] coe) {\n if (a >= b) {\n return extgcd0(a, b, coe);\n } else {\n long g = extgcd0(b, a, coe);\n long tmp = coe[0];\n coe[0] = coe[1];\n coe[1] = tmp;\n return g;\n }\n }\n\n private static long extgcd0(long a, long b, long[] coe) {\n if (b == 0) {\n coe[0] = 1;\n coe[1] = 0;\n return a;\n }\n long g = extgcd0(b, a % b, coe);\n long n = coe[0];\n long m = coe[1];\n coe[0] = m;\n coe[1] = n - m * (a / b);\n return g;\n }\n\n /**\n * Get y where x * y = 1 (% mod)\n */\n public static int inverse(int x, int mod) {\n return pow(x, mod - 2, mod);\n }\n\n /**\n * Get x^n(% mod)\n */\n public static int pow(int x, int n, int mod) {\n n = mod(n, mod - 1);\n x = mod(x, mod);\n int bit = 31 - Integer.numberOfLeadingZeros(n);\n long product = 1;\n for (; bit >= 0; bit--) {\n product = product * product % mod;\n if (((1 << bit) & n) != 0) {\n product = product * x % mod;\n }\n }\n return (int) product;\n }\n\n public static long longpow(long x, long n, long mod) {\n if (n == 0) {\n return 1;\n }\n long prod = longpow(x, n >> 1, mod);\n prod = modmul(prod, prod, mod);\n if ((n & 1) == 1) {\n prod = modmul(prod, x, mod);\n }\n return prod;\n }\n\n /**\n * Get x % mod\n */\n public static int mod(int x, int mod) {\n return x >= 0 ? x % mod : (((x % mod) + mod) % mod);\n }\n\n /**\n * Get n!/(n-m)!\n */\n public static long permute(int n, int m) {\n return m == 0 ? 1 : n * permute(n - 1, m - 1);\n }\n\n /**\n * Put all primes less or equal to limit into primes after offset\n */\n public static int eulerSieve(int limit, int[] primes, int offset) {\n boolean[] isComp = new boolean[limit + 1];\n int wpos = offset;\n for (int i = 2; i <= limit; i++) {\n if (!isComp[i]) {\n primes[wpos++] = i;\n }\n for (int j = offset, until = limit / i; j < wpos && primes[j] <= until; j++) {\n int pi = primes[j] * i;\n isComp[pi] = true;\n if (i % primes[j] == 0) {\n break;\n }\n }\n }\n return wpos - offset;\n }\n\n /**\n * Round x into integer\n */\n public static int intRound(double x) {\n if (x < 0) {\n return -(int) (-x + 0.5);\n }\n return (int) (x + 0.5);\n }\n\n /**\n * Round x into long\n */\n public static long longRound(double x) {\n if (x < 0) {\n return -(long) (-x + 0.5);\n }\n return (long) (x + 0.5);\n }\n }\n\n public static class FastIO {\n public final StringBuilder cache = new StringBuilder();\n private final InputStream is;\n private final OutputStream os;\n private final Charset charset;\n private StringBuilder defaultStringBuf = new StringBuilder(1 << 8);\n private byte[] buf = new byte[1 << 13];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastIO(InputStream is, OutputStream os, Charset charset) {\n this.is = is;\n this.os = os;\n this.charset = charset;\n }\n\n public FastIO(InputStream is, OutputStream os) {\n this(is, os, Charset.forName(\"ascii\"));\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public int readInt() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n public long readLong() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n long val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n public double readDouble() {\n boolean sign = true;\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+';\n next = read();\n }\n\n long val = 0;\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n if (next != '.') {\n return sign ? val : -val;\n }\n next = read();\n long radix = 1;\n long point = 0;\n while (next >= '0' && next <= '9') {\n point = point * 10 + next - '0';\n radix = radix * 10;\n next = read();\n }\n double result = val + (double) point / radix;\n return sign ? result : -result;\n }\n\n public String readString(StringBuilder builder) {\n skipBlank();\n\n while (next > 32) {\n builder.append((char) next);\n next = read();\n }\n\n return builder.toString();\n }\n\n public String readString() {\n defaultStringBuf.setLength(0);\n return readString(defaultStringBuf);\n }\n\n public int readLine(char[] data, int offset) {\n int originalOffset = offset;\n while (next != -1 && next != '\\n') {\n data[offset++] = (char) next;\n next = read();\n }\n return offset - originalOffset;\n }\n\n public int readString(char[] data, int offset) {\n skipBlank();\n\n int originalOffset = offset;\n while (next > 32) {\n data[offset++] = (char) next;\n next = read();\n }\n\n return offset - originalOffset;\n }\n\n public int readString(byte[] data, int offset) {\n skipBlank();\n\n int originalOffset = offset;\n while (next > 32) {\n data[offset++] = (byte) next;\n next = read();\n }\n\n return offset - originalOffset;\n }\n\n public char readChar() {\n skipBlank();\n char c = (char) next;\n next = read();\n return c;\n }\n\n public void flush() {\n try {\n os.write(cache.toString().getBytes(charset));\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n\n public boolean hasMore() {\n skipBlank();\n return next != -1;\n }\n }\n\n public static class Debug {\n private boolean allowDebug;\n\n public Debug(boolean allowDebug) {\n this.allowDebug = allowDebug;\n }\n\n public void assertTrue(boolean flag) {\n if (!allowDebug) {\n return;\n }\n if (!flag) {\n fail();\n }\n }\n\n public void fail() {\n throw new RuntimeException();\n }\n\n public void assertFalse(boolean flag) {\n if (!allowDebug) {\n return;\n }\n if (flag) {\n fail();\n }\n }\n\n private void outputName(String name) {\n System.out.print(name + \" = \");\n }\n\n public void debug(String name, int x) {\n if (!allowDebug) {\n return;\n }\n\n outputName(name);\n System.out.println(\"\" + x);\n }\n\n public void debug(String name, long x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(\"\" + x);\n }\n\n public void debug(String name, double x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(\"\" + x);\n }\n\n public void debug(String name, int[] x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(Arrays.toString(x));\n }\n\n public void debug(String name, long[] x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(Arrays.toString(x));\n }\n\n public void debug(String name, double[] x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(Arrays.toString(x));\n }\n\n public void debug(String name, Object x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(\"\" + x);\n }\n\n public void debug(String name, Object... x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(Arrays.deepToString(x));\n }\n }\n}", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "8d24b8c86e41543a8f46638f919a1394", "src_uid": "c9e79e83928d5d034123ebc3b2f5e064", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// upsolve with rainboy\nimport java.io.*;\nimport java.util.*;\n\npublic class CF1153F {\n\tstatic final int MD = 998244353;\n\tstatic int[][] ch;\n\tstatic void init(int n) {\n\t\tch = new int[1 + n][1 + n];\n\t\tch[0][0] = 1;\n\t\tfor (int i = 1; i <= n; i++) {\n\t\t\tch[i][0] = 1;\n\t\t\tfor (int j = 1; j <= i; j++)\n\t\t\t\tch[i][j] = (ch[i - 1][j] + ch[i - 1][j - 1]) % MD;\n\t\t}\n\t}\n\tstatic long power(int a, int k) {\n\t\tif (k == 0)\n\t\t\treturn 1;\n\t\tlong p = power(a, k / 2);\n\t\tp = p * p % MD;\n\t\tif (k % 2 == 1)\n\t\t\tp = p * a % MD;\n\t\treturn p;\n\t}\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st = new StringTokenizer(br.readLine());\n\t\tint n = Integer.parseInt(st.nextToken());\n\t\tint k = Integer.parseInt(st.nextToken());\n\t\tint l = Integer.parseInt(st.nextToken());\n\t\tinit(n);\n\t\tlong[] pp = new long[1 + n + n];\n\t\tlong[] qq = new long[1 + n + n];\n\t\tpp[n] = power(2, n);\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tfor (int j = n + n; j > 0; j--)\n\t\t\t\tpp[j] = (pp[j] - pp[j - 1]) % MD;\n\t\tlong[] aa = new long[1 + n + n];\n\t\tfor (int j = 0; j <= n + n; j++)\n\t\t\taa[j] = pp[j];\n\t\tlong inv2 = (MD + 1) / 2;\n\t\tfor (int i = 1; i <= n - k; i++) {\n\t\t\t// qq := pp / p, where p = 2x (1 - x)\n\t\t\t// divide by 2x\n\t\t\tfor (int j = 0; j < n + n; j++)\n\t\t\t\tqq[j] = pp[j + 1] * inv2 % MD;\n\t\t\tqq[n + n] = 0;\n\t\t\t// divide by 1 - x is multiply by 1 + x + x^2 + x^3 + ...\n\t\t\tfor (int j = 1; j <= n + n; j++)\n\t\t\t\tqq[j] = (qq[j] + qq[j - 1]) % MD;\n\t\t\t// pp := pp * (1 - p) / p = pp / p - pp = qq - pp\n\t\t\tfor (int j = 0; j <= n + n; j++)\n\t\t\t\tpp[j] = (qq[j] - pp[j]) % MD;\n\t\t\tlong a = ch[n][i];\n\t\t\tfor (int j = 0; j <= n + n; j++)\n\t\t\t\taa[j] = (aa[j] + a * pp[j]) % MD;\n\t\t}\n\t\t// integrate x^i to x^{i + 1} / (i + 1)\n\t\tlong a = 0;\n\t\tfor (int i = 0; i <= n + n; i++)\n\t\t\ta = (a + aa[i] * power(i + 1, MD - 2)) % MD;\n\t\ta = (a * l % MD + MD) % MD;\n\t\tSystem.out.println(a);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "a5f265eaa3450b525d5c252eacb01dad", "src_uid": "c9e79e83928d5d034123ebc3b2f5e064", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastScanner in = new FastScanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n F solver = new F();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class F {\n public void solve(int testNumber, FastScanner in, PrintWriter out) {\n int n = in.ni(), k = in.ni(), l = in.ni();\n int mod = 998244353;\n long[] invs = IntegerUtils.invs(2 * n + 3, mod);\n long[][] p = new long[2 * n + 1][n + 1];\n p[0][1] = 1; // first is always started\n for (int i = 1; i < 2 * n; i++) {\n int prevMaxRunning = Math.min(2 * n - i, i); // how many intervals max were running (covering)\n int maxRunning = Math.min(2 * n - i - 1, i + 1); // how many intervals max can be running\n for (int j = 0; j <= prevMaxRunning; j++) {\n if (p[i - 1][j] != 0) {\n if (j > 0) {\n p[i][j - 1] = (p[i][j - 1] + p[i - 1][j] * j % mod * invs[2 * n - i] % mod) % mod; // close an interval\n }\n if (j < maxRunning) {\n p[i][j + 1] = (p[i][j + 1] + p[i - 1][j] * (2 * n - i - j) % mod * invs[2 * n - i] % mod) % mod; // start a new interval\n }\n }\n }\n }\n long ans = 0;\n for (int i = 0; i < 2 * n; i++) {\n for (int j = k; j <= n; j++) {\n if (p[i][j] == 0)\n continue;\n ans = (ans + p[i][j]) % mod;\n }\n }\n ans = ans * l % mod * invs[2 * n + 1] % mod;\n out.println(ans);\n }\n\n }\n\n static class FastScanner {\n private BufferedReader in;\n private StringTokenizer st;\n\n public FastScanner(InputStream stream) {\n in = new BufferedReader(new InputStreamReader(stream));\n }\n\n public String ns() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n String rl = in.readLine();\n if (rl == null) {\n return null;\n }\n st = new StringTokenizer(rl);\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return st.nextToken();\n }\n\n public int ni() {\n return Integer.parseInt(ns());\n }\n\n }\n\n static class IntegerUtils {\n public static long[] invs(int n, long p) {\n long[] res = new long[n];\n res[1] = 1;\n for (int i = 2; i < n; i++) {\n res[i] = (p - (p / i) * res[(int) (p % i)] % p) % p;\n }\n return res;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "c33b58fe9ace29120931103693e5328f", "src_uid": "c9e79e83928d5d034123ebc3b2f5e064", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Codeforces1153F {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tint P = 998244353;\n\t\t\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st = new StringTokenizer(br.readLine());\n\t\tint n = Integer.parseInt(st.nextToken());\n\t\tint real_k = Integer.parseInt(st.nextToken());\n\t\tint l = Integer.parseInt(st.nextToken());\n\t\t\t\t\n\t\t//generate factorials\n\t\tint[] factorials = new int[2*n+2];\n\t\tfactorials[0] = 1;\n\t\tfor (int i = 1; i <= 2*n+1; i++) {\n\t\t\tfactorials[i] = multiply(factorials[i-1], i, P);\n\t\t}\n\t\t\n\t\t//number of ways to choose k pairs from 2k elements\n\t\t//where order doesn't matter\n\t\t//equals (2k)!/(2^n)/k! = (2k-1)!!\n\t\tint[] doublefact = new int[n+1];\n\t\tdoublefact[0] = 1;\n\t\tfor (int i = 1; i <= n; i++) {\n\t\t\tdoublefact[i] = multiply(doublefact[i-1], (2*i-1), P);\n\t\t}\n\n\t\t//list[r][k] stores for rth segment, exactly k of the n segments covering it \n\t\tint[][] list = new int[2*n+2][n+1];\n\t\t\n\t\tfor (int r = 1; r <= 2*n+1; r++) {\n\t\t\tfor (int k = 1; k <= n; k++) {\n\t\t\t\tif (((r%2) != (k%2)) && (r-1 >= k) && (2*n+1-r >= k)) {\n\t\t\t\t\tint num = multiply(factorials[r-1], factorials[2*n+1-r], P);\n\t\t\t\t\tnum = multiply(num, doublefact[(r-k-1)/2], P);\n\t\t\t\t\tnum = multiply(num, doublefact[(2*n+1-r-k)/2], P);\n\t\t\t\t\t\n\t\t\t\t\tint denom = multiply(factorials[r-k-1], factorials[2*n+1-r-k], P);\n\t\t\t\t\tdenom = multiply(denom, factorials[k], P);\n\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\tlist[r][k] = multiply(num, inverse(multiply(denom, doublefact[n], P), P), P);\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\t\n\t\tint ans = 0;\n\t\tfor (int r = 1; r <= 2*n+1; r++) {\n\t\t\tfor (int k = real_k; k <= n; k++) {\n\t\t\t\tans += list[r][k];\n\t\t\t\tans %= P;\n\t\t\t}\n\t\t}\n\t\t\n\t\tans = multiply(ans, l, P);\n\t\tans = multiply(ans, inverse(2*n+1, P), P);\n\t\t\n\t\tSystem.out.println(ans);\n\n\t}\n\t\n\tpublic static int multiply (int a, int b, int n) {\n\t\tlong ab = (long) a * (long) b;\n\t\treturn ((int) (ab%n));\n\t}\n\t\n\tpublic static int inverse (int a, int n) {\n\t\tint m = n;\n\t\tint r1 = 1;\n\t\tint r2 = 0;\n\t\tint r3 = 0;\n\t\tint r4 = 1;\n\t\twhile ((a > 0) && (n > 0)) {\n\t\t\tif (n >= a) {\n\t\t\t\tr3 -= r1*(n/a);\n\t\t\t\tr4 -= r2*(n/a);\n\t\t\t\tn = n%a;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tint tmp = a;\n\t\t\t\ta = n;\n\t\t\t\tn = tmp;\n\t\t\t\ttmp = r1;\n\t\t\t\tr1 = r3;\n\t\t\t\tr3 = tmp;\n\t\t\t\ttmp = r2;\n\t\t\t\tr2 = r4;\n\t\t\t\tr4 = tmp;\n\t\t\t}\n\t\t}\n\t\tif (a == 0) {\n\t\t\tif (r3 >= 0)\n\t\t\t\treturn (r3%m);\n\t\t\telse\n\t\t\t\treturn (m+(r3%m));\n\t\t}\n\t\telse {\n\t\t\tif (r1 >= 0)\n\t\t\t\treturn (r1%m);\n\t\t\telse\n\t\t\t\treturn (m+(r1%m));\n\t\t}\n\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "c92132b161ab5b3786e9ad76533ee1fd", "src_uid": "c9e79e83928d5d034123ebc3b2f5e064", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package round551;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class F {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t\tint n = ni(), K = ni(), L = ni();\n\t\tint mod = 998244353;\n\t\tint[][] fif = enumFIF(10000, mod);\n\t\tlong[] muls = new long[n+1];\n\t\tfor(int i = K;i <= n;i++){\n\t\t\tlong m = C(n, i, mod, fif);\n\t\t\tfor(int j = i;j <= n;j++){\n\t\t\t\tmuls[j] += m * C(n-i, n-j, mod, fif) * ((j-i) % 2 == 0 ? 1 : -1);\n\t\t\t\tmuls[j] %= mod;\n\t\t\t}\n\t\t}\n\t\t/*\n\\int_0^1 D(t) * (2x(1-x))^t dx\nD(t) *\n2^t * (t!)^2 / (2t+1)!\n\t\t * \n\t\t */\n\t\t\n\t\tlong ans = 0;\n\t\tfor(int i = K;i <= n;i++){\n\t\t\tans += \n\t\t\tpow(2, i, mod) * fif[0][i] % mod * fif[0][i] % mod\n\t\t\t* fif[1][2*i+1] % mod * muls[i];\n\t\t\tans %= mod;\n\t\t}\n\t\tif(ans < 0)ans += mod;\n\t\tout.println(ans*L%mod);\n\t}\n\t\n\tpublic static long C(int n, int r, int mod, int[][] fif) {\n\t\tif (n < 0 || r < 0 || r > n)\n\t\t\treturn 0;\n\t\treturn (long) fif[0][n] * fif[1][r] % mod * fif[1][n - r] % mod;\n\t}\n\n\t\n\tpublic static long pow(long a, long n, long mod) {\n\t\t//\t\ta %= mod;\n\t\tlong ret = 1;\n\t\tint x = 63 - Long.numberOfLeadingZeros(n);\n\t\tfor (; x >= 0; x--) {\n\t\t\tret = ret * ret % mod;\n\t\t\tif (n << 63 - x < 0)\n\t\t\t\tret = ret * a % mod;\n\t\t}\n\t\treturn ret;\n\t}\n\n\t\n\tpublic static int[][] enumFIF(int n, int mod) {\n\t\tint[] f = new int[n + 1];\n\t\tint[] invf = new int[n + 1];\n\t\tf[0] = 1;\n\t\tfor (int i = 1; i <= n; i++) {\n\t\t\tf[i] = (int) ((long) f[i - 1] * i % mod);\n\t\t}\n\t\tlong a = f[n];\n\t\tlong b = mod;\n\t\tlong p = 1, q = 0;\n\t\twhile (b > 0) {\n\t\t\tlong c = a / b;\n\t\t\tlong d;\n\t\t\td = a;\n\t\t\ta = b;\n\t\t\tb = d % b;\n\t\t\td = p;\n\t\t\tp = q;\n\t\t\tq = d - c * q;\n\t\t}\n\t\tinvf[n] = (int) (p < 0 ? p + mod : p);\n\t\tfor (int i = n - 1; i >= 0; i--) {\n\t\t\tinvf[i] = (int) ((long) invf[i + 1] * (i + 1) % mod);\n\t\t}\n\t\treturn new int[][] { f, invf };\n\t}\n\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new F().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "a9a7d690d1fc5fafa0d231e74d8c995e", "src_uid": "c9e79e83928d5d034123ebc3b2f5e064", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\n\nimport java.io.FileInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.nio.charset.Charset;\nimport java.util.Arrays;\n\npublic class CF1153F {\n public static void main(String[] args) throws Exception {\n boolean local = System.getProperty(\"ONLINE_JUDGE\") == null;\n boolean async = false;\n\n Charset charset = Charset.forName(\"ascii\");\n\n FastIO io = local ? new FastIO(new FileInputStream(\"D:\\\\DATABASE\\\\TESTCASE\\\\Code.in\"), System.out, charset) : new FastIO(System.in, System.out, charset);\n Task task = new Task(io, new Debug(local));\n\n if (async) {\n Thread t = new Thread(null, task, \"dalt\", 1 << 27);\n t.setPriority(Thread.MAX_PRIORITY);\n t.start();\n t.join();\n } else {\n task.run();\n }\n\n if (local) {\n io.cache.append(\"\\n\\n--memory -- \\n\" + ((Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory()) >> 20) + \"M\");\n }\n\n io.flush();\n }\n\n public static class Task implements Runnable {\n final FastIO io;\n final Debug debug;\n int inf = (int) 1e8;\n int mod = 998244353;\n int[][][] mem;\n boolean[][][] visit;\n int l1;\n int l2;\n int l3;\n int n;\n int k;\n int time;\n\n public Task(FastIO io, Debug debug) {\n this.io = io;\n this.debug = debug;\n }\n\n @Override\n public void run() {\n solve();\n }\n\n public void solve() {\n n = io.readInt();\n k = io.readInt();\n int l = io.readInt();\n mem = new int[2][n + 1][n + 1];\n visit = new boolean[2][n + 1][n + 1];\n int meetCount = find(n, n, 1);\n\n int factorial = 1;\n for (int i = 2, until = 2 * n + 1; i <= until; i++) {\n factorial = mul(factorial, i);\n }\n int total = mul(factorial, Mathematics.inverse(Mathematics.pow(2, n, mod), mod));\n int probability = mul(meetCount, Mathematics.inverse(total, mod));\n int expectLength = mul(l, probability);\n io.cache.append(expectLength);\n }\n\n public int add(int a, int b) {\n return (a + b) % mod;\n }\n\n public int sub(int a, int b) {\n if (a >= b) {\n return a - b;\n }\n return a - b + mod;\n }\n\n public int mul(int a, int b) {\n return (int) (((long) a * b) % mod);\n }\n\n public int find(int i, int j, int x) {\n time++;\n if (i < 0 || i > n || j < 0 || j > n) {\n return 0;\n }\n if (i == 0 && j == 0 && x == 0) {\n return 1;\n }\n if (visit[x][i][j]) {\n return mem[x][i][j];\n }\n visit[x][i][j] = true;\n mem[x][i][j] = 0;\n if (i < j) {\n return 0;\n }\n if (x == 1) {\n mem[x][i][j] = (mem[x][i][j] + find(i, j, 0) * (i - j >= k ? 1 : 0)) % mod;\n }\n mem[x][i][j] = (int) ((mem[x][i][j] + (long) (n - i + 1) * find(i - 1, j, x)) % mod);\n mem[x][i][j] = (int)((mem[x][i][j] + (long)(i - j + 1) * find(i, j - 1, x)) % mod);\n return mem[x][i][j];\n }\n }\n\n public static class Mathematics {\n\n public static int ceilPowerOf2(int x) {\n return 32 - Integer.numberOfLeadingZeros(x - 1);\n }\n\n public static int floorPowerOf2(int x) {\n return 31 - Integer.numberOfLeadingZeros(x);\n }\n\n public static long modmul(long a, long b, long mod) {\n return b == 0 ? 0 : ((modmul(a, b >> 1, mod) << 1) % mod + a * (b & 1)) % mod;\n }\n\n /**\n * Get the greatest common divisor of a and b\n */\n public static int gcd(int a, int b) {\n return a >= b ? gcd0(a, b) : gcd0(b, a);\n }\n\n private static int gcd0(int a, int b) {\n return b == 0 ? a : gcd0(b, a % b);\n }\n\n public static int extgcd(int a, int b, int[] coe) {\n if (a >= b) {\n return extgcd0(a, b, coe);\n } else {\n int g = extgcd0(b, a, coe);\n int tmp = coe[0];\n coe[0] = coe[1];\n coe[1] = tmp;\n return g;\n }\n }\n\n private static int extgcd0(int a, int b, int[] coe) {\n if (b == 0) {\n coe[0] = 1;\n coe[1] = 0;\n return a;\n }\n int g = extgcd0(b, a % b, coe);\n int n = coe[0];\n int m = coe[1];\n coe[0] = m;\n coe[1] = n - m * (a / b);\n return g;\n }\n\n /**\n * Get the greatest common divisor of a and b\n */\n public static long gcd(long a, long b) {\n return a >= b ? gcd0(a, b) : gcd0(b, a);\n }\n\n private static long gcd0(long a, long b) {\n return b == 0 ? a : gcd0(b, a % b);\n }\n\n public static long extgcd(long a, long b, long[] coe) {\n if (a >= b) {\n return extgcd0(a, b, coe);\n } else {\n long g = extgcd0(b, a, coe);\n long tmp = coe[0];\n coe[0] = coe[1];\n coe[1] = tmp;\n return g;\n }\n }\n\n private static long extgcd0(long a, long b, long[] coe) {\n if (b == 0) {\n coe[0] = 1;\n coe[1] = 0;\n return a;\n }\n long g = extgcd0(b, a % b, coe);\n long n = coe[0];\n long m = coe[1];\n coe[0] = m;\n coe[1] = n - m * (a / b);\n return g;\n }\n\n /**\n * Get y where x * y = 1 (% mod)\n */\n public static int inverse(int x, int mod) {\n return pow(x, mod - 2, mod);\n }\n\n /**\n * Get x^n(% mod)\n */\n public static int pow(int x, int n, int mod) {\n n = mod(n, mod - 1);\n x = mod(x, mod);\n int bit = 31 - Integer.numberOfLeadingZeros(n);\n long product = 1;\n for (; bit >= 0; bit--) {\n product = product * product % mod;\n if (((1 << bit) & n) != 0) {\n product = product * x % mod;\n }\n }\n return (int) product;\n }\n\n public static long longpow(long x, long n, long mod) {\n if (n == 0) {\n return 1;\n }\n long prod = longpow(x, n >> 1, mod);\n prod = modmul(prod, prod, mod);\n if ((n & 1) == 1) {\n prod = modmul(prod, x, mod);\n }\n return prod;\n }\n\n /**\n * Get x % mod\n */\n public static int mod(int x, int mod) {\n return x >= 0 ? x % mod : (((x % mod) + mod) % mod);\n }\n\n /**\n * Get n!/(n-m)!\n */\n public static long permute(int n, int m) {\n return m == 0 ? 1 : n * permute(n - 1, m - 1);\n }\n\n /**\n * Put all primes less or equal to limit into primes after offset\n */\n public static int eulerSieve(int limit, int[] primes, int offset) {\n boolean[] isComp = new boolean[limit + 1];\n int wpos = offset;\n for (int i = 2; i <= limit; i++) {\n if (!isComp[i]) {\n primes[wpos++] = i;\n }\n for (int j = offset, until = limit / i; j < wpos && primes[j] <= until; j++) {\n int pi = primes[j] * i;\n isComp[pi] = true;\n if (i % primes[j] == 0) {\n break;\n }\n }\n }\n return wpos - offset;\n }\n\n /**\n * Round x into integer\n */\n public static int intRound(double x) {\n if (x < 0) {\n return -(int) (-x + 0.5);\n }\n return (int) (x + 0.5);\n }\n\n /**\n * Round x into long\n */\n public static long longRound(double x) {\n if (x < 0) {\n return -(long) (-x + 0.5);\n }\n return (long) (x + 0.5);\n }\n }\n\n public static class FastIO {\n public final StringBuilder cache = new StringBuilder();\n private final InputStream is;\n private final OutputStream os;\n private final Charset charset;\n private StringBuilder defaultStringBuf = new StringBuilder(1 << 8);\n private byte[] buf = new byte[1 << 13];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastIO(InputStream is, OutputStream os, Charset charset) {\n this.is = is;\n this.os = os;\n this.charset = charset;\n }\n\n public FastIO(InputStream is, OutputStream os) {\n this(is, os, Charset.forName(\"ascii\"));\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public int readInt() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n public long readLong() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n long val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n public double readDouble() {\n boolean sign = true;\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+';\n next = read();\n }\n\n long val = 0;\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n if (next != '.') {\n return sign ? val : -val;\n }\n next = read();\n long radix = 1;\n long point = 0;\n while (next >= '0' && next <= '9') {\n point = point * 10 + next - '0';\n radix = radix * 10;\n next = read();\n }\n double result = val + (double) point / radix;\n return sign ? result : -result;\n }\n\n public String readString(StringBuilder builder) {\n skipBlank();\n\n while (next > 32) {\n builder.append((char) next);\n next = read();\n }\n\n return builder.toString();\n }\n\n public String readString() {\n defaultStringBuf.setLength(0);\n return readString(defaultStringBuf);\n }\n\n public int readLine(char[] data, int offset) {\n int originalOffset = offset;\n while (next != -1 && next != '\\n') {\n data[offset++] = (char) next;\n next = read();\n }\n return offset - originalOffset;\n }\n\n public int readString(char[] data, int offset) {\n skipBlank();\n\n int originalOffset = offset;\n while (next > 32) {\n data[offset++] = (char) next;\n next = read();\n }\n\n return offset - originalOffset;\n }\n\n public int readString(byte[] data, int offset) {\n skipBlank();\n\n int originalOffset = offset;\n while (next > 32) {\n data[offset++] = (byte) next;\n next = read();\n }\n\n return offset - originalOffset;\n }\n\n public char readChar() {\n skipBlank();\n char c = (char) next;\n next = read();\n return c;\n }\n\n public void flush() {\n try {\n os.write(cache.toString().getBytes(charset));\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n\n public boolean hasMore() {\n skipBlank();\n return next != -1;\n }\n }\n\n public static class Debug {\n private boolean allowDebug;\n\n public Debug(boolean allowDebug) {\n this.allowDebug = allowDebug;\n }\n\n public void assertTrue(boolean flag) {\n if (!allowDebug) {\n return;\n }\n if (!flag) {\n fail();\n }\n }\n\n public void fail() {\n throw new RuntimeException();\n }\n\n public void assertFalse(boolean flag) {\n if (!allowDebug) {\n return;\n }\n if (flag) {\n fail();\n }\n }\n\n private void outputName(String name) {\n System.out.print(name + \" = \");\n }\n\n public void debug(String name, int x) {\n if (!allowDebug) {\n return;\n }\n\n outputName(name);\n System.out.println(\"\" + x);\n }\n\n public void debug(String name, long x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(\"\" + x);\n }\n\n public void debug(String name, double x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(\"\" + x);\n }\n\n public void debug(String name, int[] x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(Arrays.toString(x));\n }\n\n public void debug(String name, long[] x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(Arrays.toString(x));\n }\n\n public void debug(String name, double[] x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(Arrays.toString(x));\n }\n\n public void debug(String name, Object x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(\"\" + x);\n }\n\n public void debug(String name, Object... x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(Arrays.deepToString(x));\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "84baf59056134603386747058887e4ee", "src_uid": "c9e79e83928d5d034123ebc3b2f5e064", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastScanner in = new FastScanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n F solver = new F();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class F {\n public void solve(int testNumber, FastScanner in, PrintWriter out) {\n int n = in.ni(), k = in.ni(), l = in.ni();\n int mod = 998244353;\n long[] invs = IntegerUtils.invs(2 * n + 3, mod);\n long[][] p = new long[2 * n + 1][n + 1];\n p[0][1] = 1; // first is always started\n long ans = 0;\n for (int i = 1; i < 2 * n; i++) {\n int prevMaxRunning = Math.min(2 * n - i, i); // how many intervals max were running (covering)\n int maxRunning = Math.min(2 * n - i - 1, i + 1); // how many intervals max can be running\n for (int j = 0; j <= prevMaxRunning; j++) {\n if (p[i - 1][j] != 0) {\n if (j > 0) {\n p[i][j - 1] = (p[i][j - 1] + p[i - 1][j] * j % mod * invs[2 * n - i] % mod) % mod; // close an interval\n }\n if (j < maxRunning) {\n p[i][j + 1] = (p[i][j + 1] + p[i - 1][j] * (2 * n - i - j) % mod * invs[2 * n - i] % mod) % mod; // start a new interval\n }\n if (j >= k)\n ans = (ans + p[i - 1][j]) % mod;\n }\n }\n }\n if (k <= 1)\n ans += p[2 * n - 1][1];\n\n ans = ans * l % mod * invs[2 * n + 1] % mod;\n out.println(ans);\n }\n\n }\n\n static class FastScanner {\n private BufferedReader in;\n private StringTokenizer st;\n\n public FastScanner(InputStream stream) {\n in = new BufferedReader(new InputStreamReader(stream));\n }\n\n public String ns() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n String rl = in.readLine();\n if (rl == null) {\n return null;\n }\n st = new StringTokenizer(rl);\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return st.nextToken();\n }\n\n public int ni() {\n return Integer.parseInt(ns());\n }\n\n }\n\n static class IntegerUtils {\n public static long[] invs(int n, long p) {\n long[] res = new long[n];\n res[1] = 1;\n for (int i = 2; i < n; i++) {\n res[i] = (p - (p / i) * res[(int) (p % i)] % p) % p;\n }\n return res;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "fa10b291a97fc7610c6cb76960f2eb10", "src_uid": "c9e79e83928d5d034123ebc3b2f5e064", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main implements Runnable{\n public static void main(String[] args){\n //new Thread(null,new Main(),\"Thread-1\",1024*1024*10).start();\n new Main().run();\n }\n int mod=998244353;\n private void solve() throws Exception {\n InputReader in = new InputReader(System.in);\n PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n int n=in.nextInt(),k=in.nextInt(),l=in.nextInt();\n long[]fac=new long[n+1];\n fac[0]=1;\n for(int i=1;i<=n;i++){\n fac[i]=fac[i-1]*i%mod;\n }\n long[][]dp=new long[2*n+1][2*n+2];\n dp[0][0]=1;\n for(int i=1;i<=2*n;i++){\n for(int j=0;j<=Math.min(i,n);j++){\n if(j>0) dp[i][j]=(dp[i][j]+dp[i-1][j-1])%mod;\n dp[i][j]=(dp[i][j]+dp[i-1][j+1]*(j+1)%mod)%mod;\n }\n }\n long ans=0;\n for(int i=k;i<=2*n;i++){\n for(int j=k;j<=n;j++){\n ans=(ans+dp[i][j]*dp[2*n-i][j]%mod*fac[j]%mod)%mod;\n }\n }\n out.println(l*ans%mod*Pow(dp[2*n][0],mod-2)%mod*Pow(2*n+1,mod-2)%mod);\n out.flush();\n }\n long Pow(long a,long b){\n long ans=1;\n while(b>0){\n if((b&1)!=0)ans=(ans*a)%mod;\n a=(a*a)%mod;\n b>>=1;\n }\n return ans;\n }\n @Override\n public void run() {\n try {\n solve();\n } catch (Exception e) {\n e.printStackTrace();\n }\n }\n class InputReader{\n StreamTokenizer tokenizer;\n public InputReader(InputStream stream){\n tokenizer=new StreamTokenizer(new BufferedReader(new InputStreamReader(stream)));\n tokenizer.ordinaryChars(33,126);\n tokenizer.wordChars(33,126);\n }\n public String next() throws IOException {\n tokenizer.nextToken();\n return tokenizer.sval;\n }\n public int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n public long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n public boolean hasNext() throws IOException {\n int res=tokenizer.nextToken();\n tokenizer.pushBack();\n return res!=tokenizer.TT_EOF;\n }\n }\n}", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "b5dc96b5a168bef28340b405271dfc93", "src_uid": "c9e79e83928d5d034123ebc3b2f5e064", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\n\nimport java.io.FileInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.nio.charset.Charset;\nimport java.util.Arrays;\n\npublic class CF1153F {\n public static void main(String[] args) throws Exception {\n boolean local = System.getProperty(\"ONLINE_JUDGE\") == null;\n boolean async = false;\n\n Charset charset = Charset.forName(\"ascii\");\n\n FastIO io = local ? new FastIO(new FileInputStream(\"D:\\\\DATABASE\\\\TESTCASE\\\\Code.in\"), System.out, charset) : new FastIO(System.in, System.out, charset);\n Task task = new Task(io, new Debug(local));\n\n if (async) {\n Thread t = new Thread(null, task, \"dalt\", 1 << 27);\n t.setPriority(Thread.MAX_PRIORITY);\n t.start();\n t.join();\n } else {\n task.run();\n }\n\n if (local) {\n io.cache.append(\"\\n\\n--memory -- \\n\" + ((Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory()) >> 20) + \"M\");\n }\n\n io.flush();\n }\n\n public static class Task implements Runnable {\n final FastIO io;\n final Debug debug;\n int inf = (int) 1e8;\n int mod = 998244353;\n int[][][] mem;\n boolean[][][] visit;\n int l1;\n int l2;\n int l3;\n int n;\n int k;\n int time;\n\n public Task(FastIO io, Debug debug) {\n this.io = io;\n this.debug = debug;\n }\n\n @Override\n public void run() {\n solve();\n }\n\n public void solve() {\n n = io.readInt();\n k = io.readInt();\n int l = io.readInt();\n mem = new int[2][n + 1][n + 1];\n visit = new boolean[2][n + 1][n + 1];\n int meetCount = find(n, n, 1);\n\n int factorial = 1;\n for (int i = 2, until = 2 * n + 1; i <= until; i++) {\n factorial = mul(factorial, i);\n }\n int total = mul(factorial, Mathematics.inverse(Mathematics.pow(2, n, mod), mod));\n int probability = mul(meetCount, Mathematics.inverse(total, mod));\n int expectLength = mul(l, probability);\n io.cache.append(expectLength);\n }\n\n public int add(int a, int b) {\n return (a + b) % mod;\n }\n\n public int sub(int a, int b) {\n if (a >= b) {\n return a - b;\n }\n return a - b + mod;\n }\n\n public int mul(int a, int b) {\n return (int) (((long) a * b) % mod);\n }\n\n public int find(int i, int j, int x) {\n time++;\n if (i < 0 || i > n || j < 0 || j > n) {\n return 0;\n }\n if (i == 0 && j == 0 && x == 0) {\n return 1;\n }\n if (visit[x][i][j]) {\n return mem[x][i][j];\n }\n visit[x][i][j] = true;\n mem[x][i][j] = 0;\n if (i < j) {\n return 0;\n }\n if (x == 1) {\n mem[x][i][j] = add(mem[x][i][j], mul(find(i, j, 0), (i - j >= k ? 1 : 0)));\n }\n mem[x][i][j] = add(mem[x][i][j], mul((n - i + 1), find(i - 1, j, x)));\n mem[x][i][j] = add(mem[x][i][j], mul((i - j + 1), find(i, j - 1, x)));\n return mem[x][i][j];\n }\n }\n\n public static class Mathematics {\n\n public static int ceilPowerOf2(int x) {\n return 32 - Integer.numberOfLeadingZeros(x - 1);\n }\n\n public static int floorPowerOf2(int x) {\n return 31 - Integer.numberOfLeadingZeros(x);\n }\n\n public static long modmul(long a, long b, long mod) {\n return b == 0 ? 0 : ((modmul(a, b >> 1, mod) << 1) % mod + a * (b & 1)) % mod;\n }\n\n /**\n * Get the greatest common divisor of a and b\n */\n public static int gcd(int a, int b) {\n return a >= b ? gcd0(a, b) : gcd0(b, a);\n }\n\n private static int gcd0(int a, int b) {\n return b == 0 ? a : gcd0(b, a % b);\n }\n\n public static int extgcd(int a, int b, int[] coe) {\n if (a >= b) {\n return extgcd0(a, b, coe);\n } else {\n int g = extgcd0(b, a, coe);\n int tmp = coe[0];\n coe[0] = coe[1];\n coe[1] = tmp;\n return g;\n }\n }\n\n private static int extgcd0(int a, int b, int[] coe) {\n if (b == 0) {\n coe[0] = 1;\n coe[1] = 0;\n return a;\n }\n int g = extgcd0(b, a % b, coe);\n int n = coe[0];\n int m = coe[1];\n coe[0] = m;\n coe[1] = n - m * (a / b);\n return g;\n }\n\n /**\n * Get the greatest common divisor of a and b\n */\n public static long gcd(long a, long b) {\n return a >= b ? gcd0(a, b) : gcd0(b, a);\n }\n\n private static long gcd0(long a, long b) {\n return b == 0 ? a : gcd0(b, a % b);\n }\n\n public static long extgcd(long a, long b, long[] coe) {\n if (a >= b) {\n return extgcd0(a, b, coe);\n } else {\n long g = extgcd0(b, a, coe);\n long tmp = coe[0];\n coe[0] = coe[1];\n coe[1] = tmp;\n return g;\n }\n }\n\n private static long extgcd0(long a, long b, long[] coe) {\n if (b == 0) {\n coe[0] = 1;\n coe[1] = 0;\n return a;\n }\n long g = extgcd0(b, a % b, coe);\n long n = coe[0];\n long m = coe[1];\n coe[0] = m;\n coe[1] = n - m * (a / b);\n return g;\n }\n\n /**\n * Get y where x * y = 1 (% mod)\n */\n public static int inverse(int x, int mod) {\n return pow(x, mod - 2, mod);\n }\n\n /**\n * Get x^n(% mod)\n */\n public static int pow(int x, int n, int mod) {\n n = mod(n, mod - 1);\n x = mod(x, mod);\n int bit = 31 - Integer.numberOfLeadingZeros(n);\n long product = 1;\n for (; bit >= 0; bit--) {\n product = product * product % mod;\n if (((1 << bit) & n) != 0) {\n product = product * x % mod;\n }\n }\n return (int) product;\n }\n\n public static long longpow(long x, long n, long mod) {\n if (n == 0) {\n return 1;\n }\n long prod = longpow(x, n >> 1, mod);\n prod = modmul(prod, prod, mod);\n if ((n & 1) == 1) {\n prod = modmul(prod, x, mod);\n }\n return prod;\n }\n\n /**\n * Get x % mod\n */\n public static int mod(int x, int mod) {\n return x >= 0 ? x % mod : (((x % mod) + mod) % mod);\n }\n\n /**\n * Get n!/(n-m)!\n */\n public static long permute(int n, int m) {\n return m == 0 ? 1 : n * permute(n - 1, m - 1);\n }\n\n /**\n * Put all primes less or equal to limit into primes after offset\n */\n public static int eulerSieve(int limit, int[] primes, int offset) {\n boolean[] isComp = new boolean[limit + 1];\n int wpos = offset;\n for (int i = 2; i <= limit; i++) {\n if (!isComp[i]) {\n primes[wpos++] = i;\n }\n for (int j = offset, until = limit / i; j < wpos && primes[j] <= until; j++) {\n int pi = primes[j] * i;\n isComp[pi] = true;\n if (i % primes[j] == 0) {\n break;\n }\n }\n }\n return wpos - offset;\n }\n\n /**\n * Round x into integer\n */\n public static int intRound(double x) {\n if (x < 0) {\n return -(int) (-x + 0.5);\n }\n return (int) (x + 0.5);\n }\n\n /**\n * Round x into long\n */\n public static long longRound(double x) {\n if (x < 0) {\n return -(long) (-x + 0.5);\n }\n return (long) (x + 0.5);\n }\n }\n\n public static class FastIO {\n public final StringBuilder cache = new StringBuilder();\n private final InputStream is;\n private final OutputStream os;\n private final Charset charset;\n private StringBuilder defaultStringBuf = new StringBuilder(1 << 8);\n private byte[] buf = new byte[1 << 13];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastIO(InputStream is, OutputStream os, Charset charset) {\n this.is = is;\n this.os = os;\n this.charset = charset;\n }\n\n public FastIO(InputStream is, OutputStream os) {\n this(is, os, Charset.forName(\"ascii\"));\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public int readInt() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n public long readLong() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n long val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n public double readDouble() {\n boolean sign = true;\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+';\n next = read();\n }\n\n long val = 0;\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n if (next != '.') {\n return sign ? val : -val;\n }\n next = read();\n long radix = 1;\n long point = 0;\n while (next >= '0' && next <= '9') {\n point = point * 10 + next - '0';\n radix = radix * 10;\n next = read();\n }\n double result = val + (double) point / radix;\n return sign ? result : -result;\n }\n\n public String readString(StringBuilder builder) {\n skipBlank();\n\n while (next > 32) {\n builder.append((char) next);\n next = read();\n }\n\n return builder.toString();\n }\n\n public String readString() {\n defaultStringBuf.setLength(0);\n return readString(defaultStringBuf);\n }\n\n public int readLine(char[] data, int offset) {\n int originalOffset = offset;\n while (next != -1 && next != '\\n') {\n data[offset++] = (char) next;\n next = read();\n }\n return offset - originalOffset;\n }\n\n public int readString(char[] data, int offset) {\n skipBlank();\n\n int originalOffset = offset;\n while (next > 32) {\n data[offset++] = (char) next;\n next = read();\n }\n\n return offset - originalOffset;\n }\n\n public int readString(byte[] data, int offset) {\n skipBlank();\n\n int originalOffset = offset;\n while (next > 32) {\n data[offset++] = (byte) next;\n next = read();\n }\n\n return offset - originalOffset;\n }\n\n public char readChar() {\n skipBlank();\n char c = (char) next;\n next = read();\n return c;\n }\n\n public void flush() {\n try {\n os.write(cache.toString().getBytes(charset));\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n\n public boolean hasMore() {\n skipBlank();\n return next != -1;\n }\n }\n\n public static class Debug {\n private boolean allowDebug;\n\n public Debug(boolean allowDebug) {\n this.allowDebug = allowDebug;\n }\n\n public void assertTrue(boolean flag) {\n if (!allowDebug) {\n return;\n }\n if (!flag) {\n fail();\n }\n }\n\n public void fail() {\n throw new RuntimeException();\n }\n\n public void assertFalse(boolean flag) {\n if (!allowDebug) {\n return;\n }\n if (flag) {\n fail();\n }\n }\n\n private void outputName(String name) {\n System.out.print(name + \" = \");\n }\n\n public void debug(String name, int x) {\n if (!allowDebug) {\n return;\n }\n\n outputName(name);\n System.out.println(\"\" + x);\n }\n\n public void debug(String name, long x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(\"\" + x);\n }\n\n public void debug(String name, double x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(\"\" + x);\n }\n\n public void debug(String name, int[] x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(Arrays.toString(x));\n }\n\n public void debug(String name, long[] x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(Arrays.toString(x));\n }\n\n public void debug(String name, double[] x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(Arrays.toString(x));\n }\n\n public void debug(String name, Object x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(\"\" + x);\n }\n\n public void debug(String name, Object... x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(Arrays.deepToString(x));\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "2ca49183ecc0d93aa386f8015397acd3", "src_uid": "c9e79e83928d5d034123ebc3b2f5e064", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package Contest551;\n\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class mainF {\n public static Scanner enter = new Scanner(System.in);\n public static PrintWriter out = new PrintWriter(System.out);\n public static long mod=998244353;\n public static long cnk[][]=new long[(int)2e3+2][(int)2e3+2];\n public static long fact[]=new long[2*(int)2e3+2];\n public static long reverse[]=new long[2*(int)2e3+2];\n public static long deg_2[]=new long[(int)2e3+2];\n public static void main(String[] args) {\n long t=System.currentTimeMillis();\n cnk[0][0]=1;\n for (int i = 1; i <cnk.length ; i++) {\n cnk[0][i]=1;\n for (int j = 1; j <=i ; j++) {\n cnk[j][i]=cnk[j-1][i-1]+cnk[j][i-1];\n cnk[j][i]%=mod;\n }\n }\n fact[0]=1;\n deg_2[0]=1;\n for (int i = 1; i <fact.length ; i++) {\n fact[i]=fact[i-1]*i;\n fact[i]%=mod;\n }\n for (int i = 1; i <deg_2.length ; i++) {\n deg_2[i]=deg_2[i-1]*2;\n deg_2[i]%=mod;\n }\n reverse[1]=1;\n for (int i = 3; i <reverse.length ; i+=2) {\n reverse[i]=bin_pow(fact[i],mod-2,mod);\n }\n /* System.out.println(Arrays.toString(reverse));\n System.out.println(fact[5]);\n System.out.println(reverse[5]);*/\n int n=enter.nextInt();\n int k=enter.nextInt();\n long l=enter.nextInt();\n l%=mod;\n long ans=0;\n for (int i = k; i <=n ; i++) {\n long tmp=0;\n for (int s = 0,c=1; s <=n-i ; s++,c*=-1) {\n long a=1;\n a*=cnk[s][n-i]*deg_2[s];\n a%=mod;\n a*=fact[s+i];\n a%=mod;\n a*=fact[s+i];\n a%=mod;\n a*=reverse[2*(s+i)+1];\n a%=mod;\n tmp+=a*c;\n tmp%=mod;\n // System.out.println(reverse[2*(s+i)+1]);\n }\n //System.out.println(tmp);\n /*ans+=cnk[i][n]*deg_2[i]*tmp;\n ans%=mod;*/\n long b=1;\n b*=tmp*deg_2[i];\n b%=mod;\n //System.out.println(b);\n b*=cnk[i][n];\n b%=mod;\n ans+=b;\n ans%=mod;\n }\n ans*=l;\n ans%=mod;\n System.out.println((ans<0)? (ans+mod) : ans);\n\n\n // System.out.println(System.currentTimeMillis()-t);\n\n\n\n }\n public static long bin_pow(long a,long b, long mod){//a^b %mod\n long ans=1;\n while(b!=0){\n if((b&1)==1) ans*=a;\n a*=a;\n ans%=mod;\n a%=mod;\n b>>=1;\n }\n return ans;\n }\n}\n", "lang_cluster": "Java", "tags": ["probabilities", "math", "dp", "combinatorics"], "code_uid": "df11fd43e0496053a3e002519f463bea", "src_uid": "c9e79e83928d5d034123ebc3b2f5e064", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//Created by Aminul on 11/17/2020.\n\nimport java.io.*;\nimport java.util.*;\n\nimport static java.lang.Math.*;\n\npublic class CF1447F1 {\n public static void main(String[] args) throws Exception {\n Scanner in = new Scanner(System.in);\n PrintWriter pw = new PrintWriter(System.out);\n int n = in.nextInt();\n int[] arr = new int[n + 1];\n int[] freq = new int[101];\n int mostFreq = 0;\n for (int i = 1; i <= n; i++) {\n arr[i] = in.nextInt();\n freq[arr[i]]++;\n if (freq[arr[i]] > freq[mostFreq]) {\n mostFreq = arr[i];\n }\n }\n\n int res = 0;\n for (int i = 1; i <= 100; i++) {\n if (i != mostFreq) {\n int tmp = maxSumArrayWithZeroSum(n, mostFreq, i, arr);\n res = max(res, tmp);\n }\n }\n\n pw.println(res);\n pw.close();\n }\n\n static int maxSumArrayWithZeroSum(int n, int x, int y, int[] arr) {\n int offset = n + 5;\n int[] idx = new int[offset + offset + 10];\n int invalid = -n - n - n;\n Arrays.fill(idx, invalid);\n int sum = 0, res = 0;\n idx[offset + sum] = 0;\n for (int i = 1; i <= n; i++) {\n if (arr[i] == x) sum++;\n else if (arr[i] == y) sum--;\n if (idx[offset + sum] != invalid) res = max(res, i - idx[offset + sum]);\n else idx[offset + sum] = i;\n }\n return res;\n }\n\n static void debug(Object... obj) {\n System.err.println(Arrays.deepToString(obj));\n }\n}", "lang_cluster": "Java", "tags": ["greedy", "data structures"], "code_uid": "77089d05ea5cee66adba4bf5039c9467", "src_uid": "a06ebb2734365ec97d07cd1b6b3faeed", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.util.Arrays;\nimport java.io.IOException;\nimport java.util.Random;\nimport java.io.UncheckedIOException;\nimport java.io.Closeable;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) throws Exception {\n Thread thread = new Thread(null, new TaskAdapter(), \"\", 1 << 27);\n thread.start();\n thread.join();\n }\n\n static class TaskAdapter implements Runnable {\n @Override\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastInput in = new FastInput(inputStream);\n FastOutput out = new FastOutput(outputStream);\n DLinearCongruentialGenerator solver = new DLinearCongruentialGenerator();\n solver.solve(1, in, out);\n out.close();\n }\n }\n\n static class DLinearCongruentialGenerator {\n public int log(int x, int y) {\n int ans = 0;\n while (y != 0 && y % x == 0) {\n ans++;\n y /= x;\n }\n return ans;\n }\n\n public void solve(int testNumber, FastInput in, FastOutput out) {\n int n = in.readInt();\n int limit = (int) 2e6;\n IntegerMultiWayStack primeFactors = Factorization.factorizeRangePrime(limit);\n int[] cnts = new int[limit + 1];\n int[] times = new int[limit + 1];\n int[] xs = new int[n];\n\n in.populate(xs);\n Randomized.shuffle(xs);\n Arrays.sort(xs);\n SequenceUtils.reverse(xs);\n boolean[] retain = new boolean[n];\n for (int i = 0; i < n; i++) {\n int x = xs[i];\n if (cnts[x] == 0) {\n retain[i] = true;\n cnts[x] = 1;\n times[x] = 1;\n continue;\n }\n\n for (IntegerIterator iterator = primeFactors.iterator(x - 1); iterator.hasNext(); ) {\n int p = iterator.next();\n int log = log(p, x - 1);\n if (cnts[p] < log) {\n cnts[p] = log;\n times[p] = 0;\n }\n if (cnts[p] == log) {\n times[p]++;\n }\n }\n }\n\n Modular mod = new Modular(1e9 + 7);\n int prod = 1;\n for (int i = 1; i <= limit; i++) {\n for (int j = 0; j < cnts[i]; j++) {\n prod = mod.mul(prod, i);\n }\n }\n\n for (int i = 0; i < n; i++) {\n int x = xs[i];\n boolean unique = false;\n if (retain[i]) {\n if (cnts[x] == 1 && times[x] == 1) {\n unique = true;\n }\n } else {\n for (IntegerIterator iterator = primeFactors.iterator(x - 1); iterator.hasNext(); ) {\n int p = iterator.next();\n int log = log(p, x - 1);\n if (cnts[p] == log && times[p] == 1) {\n unique = true;\n }\n }\n }\n if (!unique) {\n prod = mod.plus(prod, 1);\n break;\n }\n }\n\n out.println(prod);\n }\n\n }\n\n static class Modular {\n int m;\n\n public Modular(int m) {\n this.m = m;\n }\n\n public Modular(long m) {\n this.m = (int) m;\n if (this.m != m) {\n throw new IllegalArgumentException();\n }\n }\n\n public Modular(double m) {\n this.m = (int) m;\n if (this.m != m) {\n throw new IllegalArgumentException();\n }\n }\n\n public int valueOf(int x) {\n x %= m;\n if (x < 0) {\n x += m;\n }\n return x;\n }\n\n public int valueOf(long x) {\n x %= m;\n if (x < 0) {\n x += m;\n }\n return (int) x;\n }\n\n public int mul(int x, int y) {\n return valueOf((long) x * y);\n }\n\n public int plus(int x, int y) {\n return valueOf(x + y);\n }\n\n public String toString() {\n return \"mod \" + m;\n }\n\n }\n\n static class DigitUtils {\n private DigitUtils() {\n }\n\n public static boolean isMultiplicationOverflow(long a, long b, long limit) {\n if (limit < 0) {\n limit = -limit;\n }\n if (a < 0) {\n a = -a;\n }\n if (b < 0) {\n b = -b;\n }\n if (a == 0 || b == 0) {\n return false;\n }\n //a * b > limit => a > limit / b\n return a > limit / b;\n }\n\n }\n\n static class RandomWrapper {\n private Random random;\n public static RandomWrapper INSTANCE = new RandomWrapper(new Random());\n\n public RandomWrapper() {\n this(new Random());\n }\n\n public RandomWrapper(Random random) {\n this.random = random;\n }\n\n public int nextInt(int l, int r) {\n return random.nextInt(r - l + 1) + l;\n }\n\n }\n\n static class Randomized {\n public static void shuffle(int[] data) {\n shuffle(data, 0, data.length - 1);\n }\n\n public static void shuffle(int[] data, int from, int to) {\n to--;\n for (int i = from; i <= to; i++) {\n int s = nextInt(i, to);\n int tmp = data[i];\n data[i] = data[s];\n data[s] = tmp;\n }\n }\n\n public static int nextInt(int l, int r) {\n return RandomWrapper.INSTANCE.nextInt(l, r);\n }\n\n }\n\n static class MinimumNumberWithMaximumFactors {\n private static int[] primes = new int[]{2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53};\n\n public static long[] maximumPrimeFactor(long n) {\n long[] ans = new long[2];\n ans[0] = 1;\n for (int i = 0; i < primes.length; i++) {\n if (DigitUtils.isMultiplicationOverflow(ans[0], primes[i], n)) {\n break;\n }\n ans[0] *= primes[i];\n ans[1]++;\n }\n return ans;\n }\n\n }\n\n static class IntegerMultiWayStack {\n private int[] values;\n private int[] next;\n private int[] heads;\n private int alloc;\n private int stackNum;\n\n public IntegerIterator iterator(final int queue) {\n return new IntegerIterator() {\n int ele = heads[queue];\n\n\n public boolean hasNext() {\n return ele != 0;\n }\n\n\n public int next() {\n int ans = values[ele];\n ele = next[ele];\n return ans;\n }\n };\n }\n\n private void doubleCapacity() {\n int newSize = Math.max(next.length + 10, next.length * 2);\n next = Arrays.copyOf(next, newSize);\n values = Arrays.copyOf(values, newSize);\n }\n\n public void alloc() {\n alloc++;\n if (alloc >= next.length) {\n doubleCapacity();\n }\n next[alloc] = 0;\n }\n\n public boolean isEmpty(int qId) {\n return heads[qId] == 0;\n }\n\n public IntegerMultiWayStack(int qNum, int totalCapacity) {\n values = new int[totalCapacity + 1];\n next = new int[totalCapacity + 1];\n heads = new int[qNum];\n stackNum = qNum;\n }\n\n public void addLast(int qId, int x) {\n alloc();\n values[alloc] = x;\n next[alloc] = heads[qId];\n heads[qId] = alloc;\n }\n\n public String toString() {\n StringBuilder builder = new StringBuilder();\n for (int i = 0; i < stackNum; i++) {\n if (isEmpty(i)) {\n continue;\n }\n builder.append(i).append(\": \");\n for (IntegerIterator iterator = iterator(i); iterator.hasNext(); ) {\n builder.append(iterator.next()).append(\",\");\n }\n if (builder.charAt(builder.length() - 1) == ',') {\n builder.setLength(builder.length() - 1);\n }\n builder.append('\\n');\n }\n return builder.toString();\n }\n\n }\n\n static class Factorization {\n public static IntegerMultiWayStack factorizeRangePrime(int n) {\n int maxFactorCnt = (int) MinimumNumberWithMaximumFactors.maximumPrimeFactor(n)[1];\n IntegerMultiWayStack stack = new IntegerMultiWayStack(n + 1, n * maxFactorCnt);\n boolean[] isComp = new boolean[n + 1];\n for (int i = 2; i <= n; i++) {\n if (isComp[i]) {\n continue;\n }\n for (int j = i; j <= n; j += i) {\n isComp[j] = true;\n stack.addLast(j, i);\n }\n }\n return stack;\n }\n\n }\n\n static class FastOutput implements AutoCloseable, Closeable, Appendable {\n private StringBuilder cache = new StringBuilder(10 << 20);\n private final Writer os;\n\n public FastOutput append(CharSequence csq) {\n cache.append(csq);\n return this;\n }\n\n public FastOutput append(CharSequence csq, int start, int end) {\n cache.append(csq, start, end);\n return this;\n }\n\n public FastOutput(Writer os) {\n this.os = os;\n }\n\n public FastOutput(OutputStream os) {\n this(new OutputStreamWriter(os));\n }\n\n public FastOutput append(char c) {\n cache.append(c);\n return this;\n }\n\n public FastOutput append(int c) {\n cache.append(c);\n return this;\n }\n\n public FastOutput println(int c) {\n return append(c).println();\n }\n\n public FastOutput println() {\n cache.append(System.lineSeparator());\n return this;\n }\n\n public FastOutput flush() {\n try {\n os.append(cache);\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n return this;\n }\n\n public void close() {\n flush();\n try {\n os.close();\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n\n public String toString() {\n return cache.toString();\n }\n\n }\n\n static class SequenceUtils {\n public static void swap(int[] data, int i, int j) {\n int tmp = data[i];\n data[i] = data[j];\n data[j] = tmp;\n }\n\n public static void reverse(int[] data, int l, int r) {\n while (l < r) {\n swap(data, l, r);\n l++;\n r--;\n }\n }\n\n public static void reverse(int[] data) {\n reverse(data, 0, data.length - 1);\n }\n\n }\n\n static class FastInput {\n private final InputStream is;\n private byte[] buf = new byte[1 << 13];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastInput(InputStream is) {\n this.is = is;\n }\n\n public void populate(int[] data) {\n for (int i = 0; i < data.length; i++) {\n data[i] = readInt();\n }\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n bufLen = -1;\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public int readInt() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n }\n\n static interface IntegerIterator {\n boolean hasNext();\n\n int next();\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["number theory"], "code_uid": "47dbd65f313221e8c63f8a992eca36fe", "src_uid": "816a82bee65cf79ba8e4d61babcd0301", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.NoSuchElementException;\n\npublic class C {\n\n private void solve(FastScanner in, PrintWriter out) {\n int MAX = 50;\n\n // count[i] := 2^i の数\n int[] count = new int[MAX + 1];\n\n // garbage[i] := 2^(i+1) 以下の garbage の数\n int[] garbage = new int[MAX + 1];\n\n int N = in.nextInt();\n for (int i = 0; i < N; i++) {\n long z = in.nextLong();\n if (Long.bitCount(z) == 1) {\n //2べきのものはカウントする\n count[Long.numberOfTrailingZeros(z)]++;\n } else {\n long floor = Long.highestOneBit(z);\n garbage[Long.numberOfTrailingZeros(floor)]++;\n }\n }\n\n for (int bit = 0; bit < MAX; bit++) {\n if (count[bit] < count[bit + 1]) {\n garbage[bit] += count[bit + 1] - count[bit];\n count[bit + 1] = count[bit];\n }\n }\n\n ArrayList<Integer> answers = new ArrayList<>();\n for (int ans = 1; ans <= N; ans++) {\n if (count[0] < ans) {\n continue;\n }\n\n int currentGarbage = 0;\n for (int bit = 0; bit < MAX; bit++) {\n //今建っている整数\n int now = Math.min(count[bit], ans);\n //まだ高さがある整数\n int next = Math.min(count[bit + 1], ans);\n\n // ここで garbageを吸着できる整数\n int catching = now - next;\n\n //新たに生まれた garbage\n int newGarbage = Math.max(0, count[bit] - ans);\n\n currentGarbage += garbage[bit] + newGarbage - catching;\n if (currentGarbage < 0) {\n currentGarbage = 0;\n }\n }\n\n if (currentGarbage == 0) {\n answers.add(ans);\n }\n }\n\n if (answers.isEmpty()) {\n out.println(-1);\n return;\n }\n for (int a : answers) {\n out.print(a + \" \");\n }\n out.println();\n }\n\n public static void main(String[] args) {\n PrintWriter out = new PrintWriter(System.out);\n new C().solve(new FastScanner(), out);\n out.close();\n }\n\n private static class FastScanner {\n\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int bufferLength = 0;\n\n private boolean hasNextByte() {\n if (ptr < bufferLength) {\n return true;\n } else {\n ptr = 0;\n try {\n bufferLength = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (bufferLength <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte()) {\n return buffer[ptr++];\n } else {\n return -1;\n }\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n private void skipUnprintable() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) {\n ptr++;\n }\n }\n\n boolean hasNext() {\n skipUnprintable();\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n long nextLong() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n double[] nextDoubleArray(int n) {\n double[] array = new double[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextDouble();\n }\n return array;\n }\n\n double[][] nextDoubleMap(int n, int m) {\n double[][] map = new double[n][];\n for (int i = 0; i < n; i++) {\n map[i] = nextDoubleArray(m);\n }\n return map;\n }\n\n public int nextInt() {\n return (int) nextLong();\n }\n\n public int[] nextIntArray(int n) {\n int[] array = new int[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextInt();\n }\n return array;\n }\n\n public long[] nextLongArray(int n) {\n long[] array = new long[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextLong();\n }\n return array;\n }\n\n public String[] nextStringArray(int n) {\n String[] array = new String[n];\n for (int i = 0; i < n; i++) {\n array[i] = next();\n }\n return array;\n }\n\n public char[][] nextCharMap(int n) {\n char[][] array = new char[n][];\n for (int i = 0; i < n; i++) {\n array[i] = next().toCharArray();\n }\n return array;\n }\n\n public int[][] nextIntMap(int n, int m) {\n int[][] map = new int[n][];\n for (int i = 0; i < n; i++) {\n map[i] = nextIntArray(m);\n }\n return map;\n }\n }\n}", "lang_cluster": "Java", "tags": ["math", "greedy", "constructive algorithms", "binary search"], "code_uid": "e0188a36c929f10cd21de2aee99a90a8", "src_uid": "fc29e8c1a9117c1dd307131d852b6088", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class C {\n FastScanner in;\n PrintWriter out;\n\n public void solve() throws IOException {\n int[] powCnt = new int[63];\n int[] other = new int[63];\n long[] pows = new long[63];\n pows[0] = 1L;\n for (int i = 1; i < 63; i++) {\n pows[i] = pows[i - 1] * 2;\n }\n \n int n = in.nextInt();\n long[] a = new long[n];\n \n for (int i = 0; i < n; i++) {\n a[i] = in.nextLong();\n boolean isPow = false;\n for (int j = 0; j < 63; j++) {\n if (a[i] == pows[j]) {\n powCnt[j]++;\n isPow = true;\n }\n if (!isPow && j != 0 && a[i] > pows[j - 1] && a[i] < pows[j]) {\n other[j]++;\n }\n }\n }\n \n int min = Arrays.stream(other).sum();\n int max = powCnt[0];\n boolean exists = false;\n for (int len = min; len <= max; len++) {\n int tails = 0;\n int cur = len;\n for (int i = 0; i < 62; i++) {\n int oldCur = cur;\n if (powCnt[i] < cur) {\n cur = powCnt[i];\n }\n int ended = oldCur - cur;\n if (tails < ended) {\n tails = 0;\n } else {\n tails -= ended;\n }\n tails += powCnt[i] - cur;\n tails += other[i + 1];\n }\n if (tails == 0) {\n out.print(len + \" \");\n exists = true;\n }\n }\n if (!exists) {\n out.println(-1);\n } else {\n out.println();\n }\n }\n\n public void run() {\n try {\n in = new FastScanner(System.in);\n out = new PrintWriter(System.out);\n solve();\n\n out.close();\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n\n class FastScanner {\n BufferedReader br;\n StringTokenizer st;\n\n FastScanner(InputStream is) {\n br = new BufferedReader(new InputStreamReader(is));\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n }\n\n public static void main(String[] arg) {\n new C().run();\n }\n}", "lang_cluster": "Java", "tags": ["math", "greedy", "constructive algorithms", "binary search"], "code_uid": "34bed60fd0a331e9f3041f951f410831", "src_uid": "fc29e8c1a9117c1dd307131d852b6088", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n public static void main(String[] args) throws IOException {\n\n Scanner sc = new Scanner(System.in);\n PrintWriter out = new PrintWriter(System.out);\n\n int n = sc .nextInt();\n long[] a = new long[n];\n for(int i = 0; i < n; ++i)\n a[i] = sc.nextLong();\n ArrayList<Long> b = new ArrayList<>();\n ArrayList<Long> c = new ArrayList<>();\n ArrayList<Integer> d = new ArrayList<>();\n int idx = 0;\n long curPower = 1;\n boolean possible = true;\n for(long x: a)\n if (x == 1) {\n b.add(1l);\n d.add(1);\n } else if ((x & x - 1) == 0) {\n if (x != curPower) {\n if (curPower * 2 != x) {\n possible = false;\n break;\n }\n curPower = x;\n idx = 0;\n }\n if (idx < b.size() && b.get(idx) * 2 == x) {\n b.set(idx, x);\n d.set(idx, d.get(idx) + 1);\n ++idx;\n }\n else\n c.add(x);\n } else {\n c.add(x);\n }\n int open = b.size();\n possible &= b.size() >= c.size();\n if(possible) for(int i = c.size() - 1, j = 0; i >= 0; --i, ++j) {\n if(c.get(i) <= 2 * b.get(j)) --open;\n else {\n possible = false;\n break;\n }\n }\n ArrayList<Integer> ans = new ArrayList<>();\n if (possible) {\n ans.add(b.size());\n int free = 0;\n for(int i = b.size() - 1; i >= 0; --i) {\n open--;\n free += d.get(i);\n if (open >= free)\n ans.add(i);\n else\n break;\n }\n Collections.reverse(ans);\n for(int x: ans)\n out.print(x + \" \");\n } else {\n out.println(-1);\n }\n out.close();\n }\n\n static class Scanner\n {\n StringTokenizer st;\n BufferedReader br;\n\n public Scanner(InputStream s){\tbr = new BufferedReader(new InputStreamReader(s));}\n\n public String next() throws IOException\n {\n while (st == null || !st.hasMoreTokens())\n st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n\n public int nextInt() throws IOException {return Integer.parseInt(next());}\n\n public long nextLong() throws IOException {return Long.parseLong(next());}\n\n public String nextLine() throws IOException {return br.readLine();}\n\n public boolean ready() throws IOException {return br.ready();}\n\n\n }\n}", "lang_cluster": "Java", "tags": ["math", "greedy", "constructive algorithms", "binary search"], "code_uid": "430938028e192f9031954957b702900d", "src_uid": "fc29e8c1a9117c1dd307131d852b6088", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class C {\n static int MOD = 1000000007;\n static long MODSQR = MOD * 1L * MOD;\n\n public static int[][] mul(int[][] a, int[][] b) {\n int[][] result = new int[a.length][b[0].length];\n for (int i = 0; i < a.length; i++) {\n for (int j = 0; j < b[0].length; j++) {\n long res = 0;\n for (int k = 0; k < a[0].length; k++) {\n res = (res + a[i][k] * 1L * b[k][j]);\n if (res > MODSQR)\n res %= MOD;\n }\n result[i][j] = (int) (res % MOD);\n }\n }\n return result;\n }\n\n public static int[][] matpow(int[][] base, long exp) {\n int[][] result = new int[base.length][base.length];\n for (int i = 0; i < base.length; i++)\n result[i][i] = 1;\n while (exp > 0) {\n if ((exp & 1) != 0)\n result = mul(result, base);\n base = mul(base, base);\n exp >>= 1;\n }\n return result;\n }\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n long n = in.nextLong();\n int k = in.nextInt();\n int[][] C = new int[k + 1][k + 1];\n C[0][0] = 1;\n for (int i = 1; i <= k; i++) {\n C[i][0] = 1;\n for (int j = 1; j <= k; j++)\n C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % MOD;\n }\n int[][] matrix = new int[2 * k + 3][2 * k + 3];\n for (int i = 0; i <= k; i++) {\n for (int j = 0; j <= i; j++) {\n matrix[i][j] = C[i][j];\n matrix[i][k + j + 1] = C[i][j];\n }\n }\n for (int i = k + 1; i <= 2 * k + 1; i++) {\n int left = i - k - 1;\n for (int j = 0; j <= left; j++) {\n matrix[i][j] = C[left][j];\n }\n }\n matrix[2 * k + 2][2 * k + 2] = 1;\n matrix[2 * k + 2][k] = 1;\n // for (long[] a : matrix)\n // System.out.println(Arrays.toString(a));\n int[][] columnMatrix = new int[2 * k + 3][1];\n for (int i = 0; i < 2 * k + 2; i++)\n columnMatrix[i][0] = 1;\n matrix = matpow(matrix, n);\n\n columnMatrix = mul(matrix, columnMatrix);\n // for (long[] a : columnMatrix)\n // System.out.println(Arrays.toString(a));\n System.out.println(columnMatrix[2 * k + 2][0]);\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "matrices", "combinatorics"], "code_uid": "2f536984d1ff352613235ad722999062", "src_uid": "14f50a111db268182e5927839a993118", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author George Marcus\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskC solver = new TaskC();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskC {\n private static final int MOD = 1000000007;\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n long N = in.nextLong();\n int K = in.nextInt();\n\n int[][] comb = new int[K + 1][K + 1];\n comb[0][0] = 1;\n for(int i = 1; i <= K; i++) {\n comb[i][0] = comb[i][i] = 1;\n for(int j = 1; j < i; j++) {\n comb[i][j] = comb[i - 1][j - 1] + comb[i - 1][j];\n if(comb[i][j] >= MOD)\n comb[i][j] -= MOD;\n }\n }\n\n int[][] A = new int[2 * K + 3][2 * K + 3];\n for(int k = 0; k <= K; k++) {\n for(int i = 0; i <= k; i++)\n A[i][k] = comb[k][k - i];\n for(int i = K + 1; i <= K + 1 + k; i++)\n A[i][k] = (int) (comb[k][k - (i - (K + 1))] * (1L << (k - (i - (K + 1)))) % MOD);\n }\n for(int k = K + 1; k <= 2 * K + 1; k++)\n A[k - (K + 1)][k] = 1;\n for(int i = 0; i <= 2 * K + 1; i++)\n A[i][2 * K + 2] = A[i][K];\n A[2 * K + 2][2 * K + 2] = 1;\n\n int[][] R = fastPow(A, N - 1);\n\n long ans = 0;\n for(int i = 0; i <= K + 1; i++) {\n ans += R[i][2 * K + 2];\n }\n ans += R[2 * K + 2][2 * K + 2];\n ans %= MOD;\n\n out.println(ans);\n }\n\n private int[][] fastPow(int[][] A, long P) {\n int[][] R = new int[A.length][A.length];\n for(int i = 0; i < R.length; i++)\n R[i][i] = 1;\n\n while(P > 0) {\n if((P & 1) > 0)\n R = mult(R, A);\n A = mult(A, A);\n P >>= 1;\n }\n\n return R;\n }\n\n private int[][] mult(int[][] A, int[][] B) {\n int n = A.length;\n int[][] C = new int[n][n];\n for(int i = 0; i < n; i++)\n for(int j = 0; j < n; j++) {\n long crt = 0;\n for(int k = 0; k < n; k++) {\n crt += (long)A[i][k] * B[k][j];\n if(crt > 1e16)\n crt %= MOD;\n }\n crt %= MOD;\n C[i][j] = (int) crt;\n }\n return C;\n }\n}\n\nclass InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n return Integer.parseInt(nextString());\n }\n\n public long nextLong() {\n return Long.parseLong(nextString());\n }\n\n public String nextString() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuffer res = new StringBuffer();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n\n return res.toString();\n }\n\n private boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n }\n\n", "lang_cluster": "Java", "tags": ["math", "matrices", "combinatorics"], "code_uid": "e9decf04ae02b7c866b1e16224c80108", "src_uid": "14f50a111db268182e5927839a993118", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.lang.*;\nimport java.math.*;\nimport java.util.*;\nimport java.io.*;\n\npublic class Main {\n\n void solve(){\n long n=nl();\n int k=ni();\n if(n==1){\n pw.println(\"1\");\n return;\n }\n precompute(k+2);\n sz=k+1+k+1+1;\n long Mat[][]=new long[sz][sz];\n for(int i=0;i<=k;i++){\n Mat[k+1+i][i]=1;\n }\n for(int c=0;c<=k;c++){\n for(int r=0;r<=c;r++){\n Mat[r][k+1+c]=mul(ncr(c,r),pow[c-r],M);\n Mat[k+1+r][k+1+c]=ncr(c,r);\n }\n }\n for(int i=0;i<=2*k+1;i++) Mat[i][2*k+2]=Mat[i][2*k+1];\n Mat[sz-1][sz-1]=1;\n\n Mat=pow(Mat,n-2);\n long arr[]=new long[sz];\n for(int i=0;i<=k;i++) arr[i]=1;\n for(int i=k+1;i<=2*k+1;i++) arr[i]=pow[i-k];\n arr[sz-1]=1;\n arr[sz-1]=add(arr[sz-1],pow[k+1],M);\n// for(int i=0;i<sz;i++){\n// for(int j=0;j<sz;j++) pw.print(Mat[i][j]+\" \");\n// pw.println(\"\");\n// }\n long ans=0;\n for(int i=0;i<sz;i++){\n ans=add(ans,mul(arr[i],Mat[i][sz-1],M),M);\n }\n pw.println(ans);\n\n\n\n\n }\n int sz;\n long [][] pow(long A[][],long x){\n if(x==0){\n long C[][]=new long[sz][sz];\n for(int i=0;i<sz;i++) C[i][i]=1;\n return C;\n }else if(x==1){\n return A;\n }\n long C[][]=pow(A,x/2);\n C=mul(C,C);\n if((x&1)>0) return mul(A,C);\n return C;\n\n }\n long [][] mul(long A[][],long B[][]){\n long C[][]=new long[sz][sz];\n for(int i=0;i<sz;i++){\n for(int j=0;j<sz;j++){\n for(int k=0;k<sz;k++){\n //C[i][j]=(C[i][j]+(A[i][k]%M * B[k][j]%M)%M)%M;\n C[i][j]=add(C[i][j],mul(A[i][k],B[k][j],M),M);\n }\n }\n }\n return C;\n }\n\n\n\n\n\n\n\n\n long ncr(int n,int r) {\n long ans = fact[n];\n ans=mul(ans,inv[n-r],M);\n ans=mul(ans,inv[r],M);\n return ans;\n }\n long fact[];\n long inv[];\n long pow[];\n void precompute(int n){\n fact=new long[n+1];\n inv=new long[n+1];\n pow=new long[n+1];\n pow[0]=1;\n fact[0]=1;\n for(int i=1;i<=n;i++){\n pow[i]=(pow[i-1]*2)%M;\n fact[i]=(fact[i-1]*i)%M;\n }\n inv[n]=modInverse(fact[n],M);\n for(int i=n-1;i>=0;i--) inv[i]=(inv[i+1]*(i+1))%M;\n\n\n }\n long add(long x,long y,long M){\n x+=y;\n if(x>=M) x-=M;\n return x;\n }\n long sub(long x,long y,long M){\n x-=y;\n if(x<0) x+=M;\n return x;\n }\n long mul(long x,long y,long M){\n x*=y;\n if(x>=M) x%=M;\n return x;\n }\n long modpow(long a, long b,long M)\n {\n long r=1;\n while(b>0)\n {\n if((b&1)>0) r=mul(r,a,M);\n a=mul(a,a,M);\n b>>=1;\n }\n return r;\n }\n\n long modInverse(long A, long M)\n {\n\n return modpow(A,M-2,M);\n }\n\n long M= (long)1e9+7;\n InputStream is;\n PrintWriter pw;\n String INPUT = \"\";\n void run() throws Exception {\n is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n pw = new PrintWriter(System.out);\n long s = System.currentTimeMillis();\n solve();\n pw.flush();\n if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+\"ms\");\n\n }\n public static void main(String[] args) throws Exception { new Main().run(); }\n\n private byte[] inbuf = new byte[1024];\n public int lenbuf = 0, ptrbuf = 0;\n\n private int readByte() {\n if(lenbuf == -1)throw new InputMismatchException();\n if(ptrbuf >= lenbuf){\n ptrbuf = 0;\n try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n if(lenbuf <= 0)return -1;\n }\n return inbuf[ptrbuf++];\n }\n\n private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\n private double nd() { return Double.parseDouble(ns()); }\n private char nc() { return (char)skip(); }\n\n private String ns() {\n int b = skip();\n StringBuilder sb = new StringBuilder();\n while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n private char[] ns(int n) {\n char[] buf = new char[n];\n int b = skip(), p = 0;\n while(p < n && !(isSpaceChar(b))){\n buf[p++] = (char)b;\n b = readByte();\n }\n return n == p ? buf : Arrays.copyOf(buf, p);\n }\n\n private char[][] nm(int n, int m) {\n char[][] map = new char[n][];\n for(int i = 0;i < n;i++)map[i] = ns(m);\n return map;\n }\n\n private int[] na(int n) {\n int[] a = new int[n];\n for(int i = 0;i < n;i++)a[i] = ni();\n return a;\n }\n\n private int ni() {\n int num = 0, b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n\n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n private long nl() {\n long num = 0;\n int b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n\n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n private boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n private void tr(Object... o) { if(INPUT.length() > 0)System.out.println(Arrays.deepToString(o)); }\n\n}", "lang_cluster": "Java", "tags": ["math", "matrices", "combinatorics"], "code_uid": "68a0a6b622560de3c912ffbe811870c4", "src_uid": "14f50a111db268182e5927839a993118", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.util.Arrays;\nimport java.util.Deque;\nimport java.util.function.Supplier;\nimport java.io.OutputStreamWriter;\nimport java.io.OutputStream;\nimport java.util.Collection;\nimport java.io.IOException;\nimport java.io.UncheckedIOException;\nimport java.util.function.Consumer;\nimport java.io.Closeable;\nimport java.io.Writer;\nimport java.util.ArrayDeque;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) throws Exception {\n Thread thread = new Thread(null, new TaskAdapter(), \"\", 1 << 27);\n thread.start();\n thread.join();\n }\n\n static class TaskAdapter implements Runnable {\n @Override\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastInput in = new FastInput(inputStream);\n FastOutput out = new FastOutput(outputStream);\n CYetAnotherNumberSequence solver = new CYetAnotherNumberSequence();\n solver.solve(1, in, out);\n out.close();\n }\n }\n\n static class CYetAnotherNumberSequence {\n public void solve(int testNumber, FastInput in, FastOutput out) {\n long n = in.readLong();\n int k = in.readInt();\n\n Modular mod = new Modular(1000000007);\n Power power = new Power(mod);\n\n int items = 200;\n int[] fib = new int[items];\n fib[0] = 1;\n fib[1] = 2;\n int[] a = new int[items];\n for (int i = 2; i < items; i++) {\n fib[i] = mod.plus(fib[i - 1], fib[i - 2]);\n }\n for (int i = 0; i < items; i++) {\n a[i] = mod.mul(fib[i], power.pow(i + 1, k));\n if (i > 0) {\n a[i] = mod.plus(a[i], a[i - 1]);\n }\n }\n\n IntegerList seq = new IntegerList();\n seq.addAll(a);\n LinearRecurrenceSolver solver = LinearRecurrenceSolver.newSolverFromSequence(seq, mod);\n int ans = solver.solve(n - 1, seq);\n\n out.println(ans);\n }\n\n }\n\n static class Modular {\n int m;\n\n public int getMod() {\n return m;\n }\n\n public Modular(int m) {\n this.m = m;\n }\n\n public Modular(long m) {\n this.m = (int) m;\n if (this.m != m) {\n throw new IllegalArgumentException();\n }\n }\n\n public Modular(double m) {\n this.m = (int) m;\n if (this.m != m) {\n throw new IllegalArgumentException();\n }\n }\n\n public int valueOf(int x) {\n x %= m;\n if (x < 0) {\n x += m;\n }\n return x;\n }\n\n public int valueOf(long x) {\n x %= m;\n if (x < 0) {\n x += m;\n }\n return (int) x;\n }\n\n public int mul(int x, int y) {\n return valueOf((long) x * y);\n }\n\n public int plus(int x, int y) {\n return valueOf(x + y);\n }\n\n public int subtract(int x, int y) {\n return valueOf(x - y);\n }\n\n public String toString() {\n return \"mod \" + m;\n }\n\n }\n\n static class IntegerList implements Cloneable {\n private int size;\n private int cap;\n private int[] data;\n private static final int[] EMPTY = new int[0];\n\n public int[] getData() {\n return data;\n }\n\n public IntegerList(int cap) {\n this.cap = cap;\n if (cap == 0) {\n data = EMPTY;\n } else {\n data = new int[cap];\n }\n }\n\n public IntegerList(IntegerList list) {\n this.size = list.size;\n this.cap = list.cap;\n this.data = Arrays.copyOf(list.data, size);\n }\n\n public IntegerList() {\n this(0);\n }\n\n public void ensureSpace(int req) {\n if (req > cap) {\n while (cap < req) {\n cap = Math.max(cap + 10, 2 * cap);\n }\n data = Arrays.copyOf(data, cap);\n }\n }\n\n private void checkRange(int i) {\n if (i < 0 || i >= size) {\n throw new ArrayIndexOutOfBoundsException(\"index \" + i + \" out of range\");\n }\n }\n\n public int get(int i) {\n checkRange(i);\n return data[i];\n }\n\n public void add(int x) {\n ensureSpace(size + 1);\n data[size++] = x;\n }\n\n public void addAll(int[] x) {\n addAll(x, 0, x.length);\n }\n\n public void addAll(int[] x, int offset, int len) {\n ensureSpace(size + len);\n System.arraycopy(x, offset, data, size, len);\n size += len;\n }\n\n public void addAll(IntegerList list) {\n addAll(list.data, 0, list.size);\n }\n\n public void expandWith(int x, int len) {\n ensureSpace(len);\n while (size < len) {\n data[size++] = x;\n }\n }\n\n public void retain(int n) {\n if (n < 0) {\n throw new IllegalArgumentException();\n }\n if (n >= size) {\n return;\n }\n size = n;\n }\n\n public void set(int i, int x) {\n checkRange(i);\n data[i] = x;\n }\n\n public int size() {\n return size;\n }\n\n public int[] toArray() {\n return Arrays.copyOf(data, size);\n }\n\n public void clear() {\n size = 0;\n }\n\n public String toString() {\n return Arrays.toString(toArray());\n }\n\n public boolean equals(Object obj) {\n if (!(obj instanceof IntegerList)) {\n return false;\n }\n IntegerList other = (IntegerList) obj;\n return SequenceUtils.equal(data, 0, size - 1, other.data, 0, other.size - 1);\n }\n\n public int hashCode() {\n int h = 1;\n for (int i = 0; i < size; i++) {\n h = h * 31 + Integer.hashCode(data[i]);\n }\n return h;\n }\n\n public IntegerList clone() {\n IntegerList ans = new IntegerList();\n ans.addAll(this);\n return ans;\n }\n\n }\n\n static class SequenceUtils {\n public static boolean equal(int[] a, int al, int ar, int[] b, int bl, int br) {\n if ((ar - al) != (br - bl)) {\n return false;\n }\n for (int i = al, j = bl; i <= ar; i++, j++) {\n if (a[i] != b[j]) {\n return false;\n }\n }\n return true;\n }\n\n }\n\n static class ModLinearFeedbackShiftRegister {\n private IntegerList cm;\n int m = -1;\n int dm;\n private IntegerList cn;\n private IntegerList buf;\n private IntegerList seq;\n private Modular mod;\n private Power pow;\n\n public ModLinearFeedbackShiftRegister(Modular mod, int cap) {\n cm = new IntegerList(cap + 1);\n cn = new IntegerList(cap + 1);\n seq = new IntegerList(cap + 1);\n buf = new IntegerList(cap + 1);\n cn.add(1);\n\n this.mod = mod;\n this.pow = new Power(mod);\n }\n\n public ModLinearFeedbackShiftRegister(Modular mod) {\n this(mod, 0);\n }\n\n private int estimateDelta() {\n int n = seq.size() - 1;\n int ans = 0;\n int[] cnData = cn.getData();\n int[] seqData = seq.getData();\n for (int i = 0, until = cn.size(); i < until; i++) {\n ans = mod.plus(ans, mod.mul(cnData[i], seqData[n - i]));\n }\n return ans;\n }\n\n public void add(int x) {\n x = mod.valueOf(x);\n int n = seq.size();\n\n seq.add(x);\n int dn = estimateDelta();\n if (dn == 0) {\n return;\n }\n\n if (m < 0) {\n cm.clear();\n cm.addAll(cn);\n dm = dn;\n m = n;\n\n cn.expandWith(0, n + 2);\n return;\n }\n\n int ln = cn.size() - 1;\n int len = Math.max(ln, n + 1 - ln);\n buf.clear();\n buf.addAll(cn);\n buf.expandWith(0, len + 1);\n\n int factor = mod.mul(dn, pow.inverseByFermat(dm));\n\n int[] bufData = buf.getData();\n int[] cmData = cm.getData();\n for (int i = n - m, until = n - m + cm.size(); i < until; i++) {\n bufData[i] = mod.subtract(bufData[i], mod.mul(factor, cmData[i - (n - m)]));\n }\n\n if (cn.size() < buf.size()) {\n IntegerList tmp = cm;\n cm = cn;\n cn = tmp;\n m = n;\n dm = dn;\n }\n {\n IntegerList tmp = cn;\n cn = buf;\n buf = tmp;\n }\n\n\n }\n\n public int length() {\n return cn.size() - 1;\n }\n\n public String toString() {\n return cn.toString();\n }\n\n public int codeAt(int i) {\n return mod.valueOf(-cn.get(i));\n }\n\n }\n\n static class Buffer<T> {\n private Deque<T> deque;\n private Supplier<T> supplier;\n private Consumer<T> cleaner;\n\n public Buffer(Supplier<T> supplier) {\n this(supplier, (x) -> {\n });\n }\n\n public Buffer(Supplier<T> supplier, Consumer<T> cleaner) {\n this(supplier, cleaner, 0);\n }\n\n public Buffer(Supplier<T> supplier, Consumer<T> cleaner, int exp) {\n this.supplier = supplier;\n this.cleaner = cleaner;\n deque = new ArrayDeque<>(exp);\n }\n\n public T alloc() {\n return deque.isEmpty() ? supplier.get() : deque.removeFirst();\n }\n\n public void release(T e) {\n cleaner.accept(e);\n deque.addLast(e);\n }\n\n }\n\n static class FastOutput implements AutoCloseable, Closeable {\n private StringBuilder cache = new StringBuilder(10 << 20);\n private final Writer os;\n\n public FastOutput(Writer os) {\n this.os = os;\n }\n\n public FastOutput(OutputStream os) {\n this(new OutputStreamWriter(os));\n }\n\n public FastOutput println(int c) {\n cache.append(c).append('\\n');\n return this;\n }\n\n public FastOutput flush() {\n try {\n os.append(cache);\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n return this;\n }\n\n public void close() {\n flush();\n try {\n os.close();\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n\n public String toString() {\n return cache.toString();\n }\n\n }\n\n static class LinearRecurrenceSolver {\n Modular mod;\n IntegerList coe;\n IntegerList p;\n IntegerList remainder;\n Power pow;\n int n;\n\n private LinearRecurrenceSolver(IntegerList coe, Modular mod) {\n this.coe = coe;\n this.mod = mod;\n n = coe.size();\n pow = new Power(mod);\n remainder = new IntegerList(coe.size());\n p = new IntegerList(coe.size() + 1);\n for (int i = n - 1; i >= 0; i--) {\n p.add(mod.valueOf(-coe.get(i)));\n }\n p.add(1);\n }\n\n public static LinearRecurrenceSolver newSolverFromLinearRecurrence(IntegerList coe, Modular mod) {\n return new LinearRecurrenceSolver(coe, mod);\n }\n\n public static LinearRecurrenceSolver newSolverFromSequence(IntegerList seq, Modular mod) {\n ModLinearFeedbackShiftRegister lfsr = new ModLinearFeedbackShiftRegister(mod, seq.size());\n for (int i = 0; i < seq.size(); i++) {\n lfsr.add(seq.get(i));\n }\n IntegerList coes = new IntegerList(lfsr.length());\n for (int i = 1; i <= lfsr.length(); i++) {\n coes.add(lfsr.codeAt(i));\n }\n return newSolverFromLinearRecurrence(coes, mod);\n }\n\n private int solve(IntegerList a) {\n int ans = 0;\n remainder.expandWith(0, n);\n for (int i = 0; i < n; i++) {\n ans = mod.plus(ans, mod.mul(remainder.get(i), a.get(i)));\n }\n return ans;\n }\n\n public int solve(long k, IntegerList a) {\n if (k < a.size()) {\n return a.get((int) k);\n }\n Polynomials.module(k, p, remainder, pow);\n return solve(a);\n }\n\n }\n\n static class FastInput {\n private final InputStream is;\n private byte[] buf = new byte[1 << 13];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastInput(InputStream is) {\n this.is = is;\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n bufLen = -1;\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public int readInt() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n public long readLong() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n long val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n }\n\n static class ExtGCD {\n private long x;\n private long y;\n private long g;\n\n public long getX() {\n return x;\n }\n\n public long extgcd(long a, long b) {\n if (a >= b) {\n g = extgcd0(a, b);\n } else {\n g = extgcd0(b, a);\n long tmp = x;\n x = y;\n y = tmp;\n }\n return g;\n }\n\n private long extgcd0(long a, long b) {\n if (b == 0) {\n x = 1;\n y = 0;\n return a;\n }\n long g = extgcd0(b, a % b);\n long n = x;\n long m = y;\n x = m;\n y = n - m * (a / b);\n return g;\n }\n\n }\n\n static class Polynomials {\n public static Buffer<IntegerList> listBuffer = new Buffer<>(IntegerList::new, list -> list.clear());\n private static ExtGCD extGCD = new ExtGCD();\n\n public static int rankOf(IntegerList p) {\n int[] data = p.getData();\n int r = p.size() - 1;\n while (r >= 0 && data[r] == 0) {\n r--;\n }\n return Math.max(0, r);\n }\n\n public static void normalize(IntegerList list) {\n list.retain(rankOf(list) + 1);\n }\n\n public static void mul(IntegerList a, IntegerList b, IntegerList c, Modular mod) {\n int rA = rankOf(a);\n int rB = rankOf(b);\n c.clear();\n c.expandWith(0, rA + rB + 1);\n int[] aData = a.getData();\n int[] bData = b.getData();\n int[] cData = c.getData();\n for (int i = 0; i <= rA; i++) {\n for (int j = 0; j <= rB; j++) {\n cData[i + j] = mod.plus(cData[i + j], mod.mul(aData[i], bData[j]));\n }\n }\n }\n\n public static void divide(IntegerList a, IntegerList b, IntegerList c, IntegerList remainder, Power pow) {\n Modular mod = pow.getModular();\n int rA = rankOf(a);\n int rB = rankOf(b);\n\n if (rA < rB) {\n c.clear();\n c.add(0);\n remainder.clear();\n remainder.addAll(a);\n return;\n }\n\n int rC = Math.max(0, rA - rB);\n c.clear();\n c.expandWith(0, rC + 1);\n remainder.clear();\n remainder.addAll(a);\n\n int[] bData = b.getData();\n int[] cData = c.getData();\n int[] rData = remainder.getData();\n\n if (extGCD.extgcd(b.get(rB), mod.getMod()) != 1) {\n throw new IllegalArgumentException();\n }\n int inv = mod.valueOf(extGCD.getX());\n for (int i = rA, j = rC; i >= rB; i--, j--) {\n if (rData[i] == 0) {\n continue;\n }\n int factor = mod.mul(-rData[i], inv);\n cData[j] = mod.valueOf(-factor);\n for (int k = rB; k >= 0; k--) {\n rData[k + j] = mod.plus(rData[k + j], mod.mul(factor, bData[k]));\n }\n }\n\n normalize(remainder);\n }\n\n public static void module(long k, IntegerList p, IntegerList remainder, Power pow) {\n int rP = rankOf(p);\n if (rP == 0) {\n remainder.clear();\n remainder.add(0);\n return;\n }\n\n IntegerList a = listBuffer.alloc();\n IntegerList c = listBuffer.alloc();\n\n module(k, a, p, c, remainder, rP, pow);\n\n listBuffer.release(a);\n listBuffer.release(c);\n }\n\n private static void module(long k, IntegerList a, IntegerList b, IntegerList c, IntegerList remainder, int rb, Power pow) {\n Modular mod = pow.getModular();\n if (k < rb) {\n remainder.clear();\n remainder.expandWith(0, (int) k + 1);\n remainder.set((int) k, 1);\n return;\n }\n module(k / 2, a, b, c, remainder, rb, pow);\n mul(remainder, remainder, a, mod);\n if (k % 2 == 1) {\n int ra = rankOf(a);\n a.expandWith(0, ra + 2);\n int[] aData = a.getData();\n for (int i = ra; i >= 0; i--) {\n aData[i + 1] = aData[i];\n }\n aData[0] = 0;\n }\n divide(a, b, c, remainder, pow);\n }\n\n }\n\n static class Power {\n final Modular modular;\n\n public Modular getModular() {\n return modular;\n }\n\n public Power(Modular modular) {\n this.modular = modular;\n }\n\n public int pow(int x, int n) {\n if (n == 0) {\n return modular.valueOf(1);\n }\n long r = pow(x, n >> 1);\n r = modular.valueOf(r * r);\n if ((n & 1) == 1) {\n r = modular.valueOf(r * x);\n }\n return (int) r;\n }\n\n public int inverseByFermat(int x) {\n return pow(x, modular.m - 2);\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "matrices", "combinatorics"], "code_uid": "6e40c35559091dd97f8b91d2c4326850", "src_uid": "14f50a111db268182e5927839a993118", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.*;\nimport java.lang.reflect.Array;\nimport java.math.*;\nimport java.text.DecimalFormat;\nimport java.util.*;\n\n\n\n\npublic class Main {\n public static final int mod = 1000000007;\n private static int [] [] C;\n public static int add(int a,int b) {\n a += b;\n if (a >= mod) a -= mod;\n return a;\n }\n public static int mul(int a,int b){\n return (int)((a*(long)b)%mod);\n }\n\n private static void init(){\n int MAXK = 40;\n C = new int[MAXK+1][MAXK+1];\n for (int n = 0;n <= MAXK;n++){\n C[n][0] = C[n][n] = 1;\n for (int k = 1;k < n;k++)\n C[n][k] = add(C[n-1][k],C[n-1][k-1]);\n }\n }\n\n\n private static matrix buildMatrix(int K){\n matrix ret = new matrix(2*K+3);\n for (int i = 0;i <= K;i++) {\n int r = i+1,k = K - i;\n for (int j = 0;j <= k;j++) {\n int c = r + j;\n ret.A[r][c] = C[k][j];\n }\n for (int j = 0;j <= k;j++) {\n int c = r + j + K + 1;\n ret.A[r][c] = C[k][j];\n }\n for (int j = 1;j <= K+1;j++) {\n int rd = r + K+1;\n ret.A[rd][j] = ret.A[r][j];\n }\n\n }\n for (int i = 1;i < ret.n;i++)\n ret.A[0][i] = ret.A[1][i];\n ret.A[0][0] = 1;\n return ret;\n }\n\n private static int powmod(int x,int p) {\n if (p == 0) return 1;\n int y = 1;\n for (;p > 1;p >>= 1) {\n if (p%2 == 1) y = mul(x,y);\n x = mul(x,x);\n }\n return mul(x,y);\n }\n public static void main(String[] args) throws Exception{\n IO io = new IO(null,null);\n init();\n long n = io.getNextLong();\n int K = io.getNextInt();\n int S2 = add(1,powmod(2,K+1));\n if (n == 1)io.println(1);\n else {\n matrix mat = buildMatrix(K);\n// for (int i = 0;i < mat.n;i++)\n// System.err.println(Arrays.toString(mat.A[i]));\n// System.err.println(\"\");\n int [] [] A = mat.exp(n-2);\n int [] B = new int[mat.n];\n B[0] = S2;\n for (int i = 0;i <= K;i++)\n B[i+1] = powmod(2,K-i + 1);\n for (int i = 0;i <= K;i++)\n B[i+K+2] = powmod(2,K-i);\n// for (int i = 0;i < mat.n;i++)\n// System.err.println(Arrays.toString(A[i]));\n// System.err.println(\"\");\n// System.err.println(Arrays.toString(B));\n\n\n int [] C = new int[A.length];\n for (int i = 0;i < A.length;i++)\n for (int j = 0;j < A.length;j++)\n C[i] = add(C[i],mul(A[i][j],B[j]));\n// System.err.println(Arrays.toString(C));\n io.println(C[0]);\n }\n io.close();\n }\n}\n\nclass matrix{\n int [] [] A;\n int n;\n public matrix(int dim){\n A = new int[dim][dim];\n n = dim;\n }\n public void makeEye(){\n for (int i = 0;i < n;i++)\n for (int j = 0;j < n;j++)\n A[i][j] = (i == j) ? 1 : 0;\n }\n public matrix mul(matrix O) {\n matrix C = new matrix(n);\n for (int i = 0;i < n;i++)\n for (int j = 0;j < n;j++)\n for (int k = 0;k < n;k++)\n C.A[i][j] = Main.add(C.A[i][j],Main.mul(A[i][k],O.A[k][j]));\n return C;\n }\n public int [] [] exp(long p) {\n matrix B = new matrix(n);\n matrix C = new matrix(n);\n C.makeEye();\n for (int i = 0;i < n;i++)\n for (int j = 0;j < n;j++)\n B.A[i][j] = A[i][j];\n\n if (p == 0) {\n B.makeEye();\n return B.A;\n }\n for (;p > 1;p >>= 1) {\n if (p%2 == 1) C = C.mul(B);\n B = B.mul(B);\n }\n return B.mul(C).A;\n }\n}\n\nclass IO{\n private BufferedReader br;\n private StringTokenizer st;\n private PrintWriter writer;\n private String inputFile,outputFile;\n\n public boolean hasMore() throws IOException{\n if(st != null && st.hasMoreTokens()) return true;\n if(br != null && br.ready()) return true;\n return false;\n }\n public String getNext() throws FileNotFoundException, IOException{\n while(st == null || !st.hasMoreTokens()) st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n\n public String getNextLine() throws FileNotFoundException, IOException{\n return br.readLine().trim();\n }\n\n public int getNextInt() throws FileNotFoundException, IOException{\n return Integer.parseInt(getNext());\n }\n public long getNextLong() throws FileNotFoundException, IOException{\n return Long.parseLong(getNext());\n }\n\n public void print(double x,int num_digits) throws IOException{\n writer.printf(\"%.\" + num_digits + \"f\" ,x);\n }\n public void println(double x,int num_digits) throws IOException{\n writer.printf(\"%.\" + num_digits + \"f\\n\" ,x);\n }\n public void print(Object o) throws IOException{\n writer.print(o.toString());\n }\n\n public void println(Object o) throws IOException{\n writer.println(o.toString());\n }\n public IO(String x,String y) throws FileNotFoundException, IOException{\n inputFile = x;\n outputFile = y;\n if(x != null) br = new BufferedReader(new FileReader(inputFile));\n else br = new BufferedReader(new InputStreamReader(System.in));\n if(y != null) writer = new PrintWriter(new BufferedWriter(new FileWriter(outputFile)));\n else writer = new PrintWriter(new OutputStreamWriter(System.out));\n }\n\n protected void close() throws IOException{\n br.close();\n writer.close();\n }\n public void outputArr(Object [] A) throws IOException{\n int L = A.length;\n for (int i = 0;i < L;i++) {\n if(i > 0) writer.print(\" \");\n writer.print(A[i]);\n }\n writer.print(\"\\n\");\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "matrices", "combinatorics"], "code_uid": "8fc7b5d55784155e521356f71a88c666", "src_uid": "14f50a111db268182e5927839a993118", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.Arrays;\n\npublic class CF392C {\n\n final static long MOD = 1000000007;\n\n static long[][] mul(long[][] a, long[][] b) {\n long[][] c = new long[a.length][a.length];\n for (int i = 0; i < a.length; ++i) {\n for (int j = 0; j < a.length; ++j) {\n for (int k = 0; k < a.length; ++k) {\n c[i][j] = (c[i][j] + a[i][k] * b[k][j]) % MOD;\n }\n }\n }\n return c;\n }\n\n static long[][] pow(long[][] a, long pow) {\n long[][] r = new long[a.length][a.length];\n for (int i = 0; i < a.length; ++i) {\n r[i][i] = 1;\n }\n while (pow > 0) {\n if (pow % 2 == 1) {\n r = mul(r, a);\n }\n pow /= 2;\n a = mul(a, a);\n }\n return r;\n }\n\n public static void solve(Input in, PrintWriter out) throws IOException {\n long n = in.nextLong();\n int k = in.nextInt() + 1;\n long[][] cs = new long[k + 1][k + 1];\n for (int i = 0; i < cs.length; ++i) {\n for (int j = 1; j < i; ++j) {\n cs[i][j] = (cs[i - 1][j - 1] + cs[i - 1][j]) % MOD;\n }\n cs[i][0] = cs[i][i] = 1;\n }\n long[][] a = new long[2 * k + 1][2 * k + 1];\n long[][] b = new long[2 * k + 1][2 * k + 1];\n long[][] c = new long[2 * k + 1][2 * k + 1];\n a[2 * k][2 * k] = b[2 * k][2 * k] = c[2 * k][2 * k] = 1;\n a[2 * k][2 * k - 1] = 1;\n for (int i = 0; i < k; ++i) {\n a[k + i][k + i] = 1;\n b[i][k + i] = 1;\n b[k + i][i] = 1;\n b[k + i][k + i] = 1;\n c[i][i] = 1;\n for (int j = 0; j <= i; ++j) {\n a[i][j] = cs[i][j];\n c[k + i][k + j] = cs[i][j];\n }\n }\n long[][] m = mul(c, mul(b, a));\n// long[] r = new long[2 * k + 1];\n// for (int i = 0; i < k; ++i) {\n// r[k + i] = 1;\n// }\n// r[0] = 1;\n// for (int it = 0; it < n; ++it) {\n// System.err.println(Arrays.toString(r));\n// long[] r1 = new long[2 * k + 1];\n// for (int i = 0; i < 2 * k + 1; ++i) {\n// for (int j = 0; j < 2 * k + 1; ++j) {\n// r1[i] = (r1[i] + m[i][j] * r[j]) % MOD;\n// }\n// }\n// r = r1;\n// }\n// System.err.println(Arrays.toString(r));\n m = pow(m, n);\n long ans = m[2 * k][0];\n for (int i = 0; i < k; ++i) {\n ans = (ans + m[2 * k][k + i]) % MOD;\n }\n out.println(ans);\n }\n\n public static void main(String[] args) throws IOException {\n PrintWriter out = new PrintWriter(System.out);\n solve(new Input(new BufferedReader(new InputStreamReader(System.in))), out);\n out.close();\n }\n\n static class Input {\n BufferedReader in;\n StringBuilder sb = new StringBuilder();\n\n public Input(BufferedReader in) {\n this.in = in;\n }\n\n public Input(String s) {\n this.in = new BufferedReader(new StringReader(s));\n }\n\n public String next() throws IOException {\n sb.setLength(0);\n while (true) {\n int c = in.read();\n if (c == -1) {\n return null;\n }\n if (\" \\n\\r\\t\".indexOf(c) == -1) {\n sb.append((char)c);\n break;\n }\n }\n while (true) {\n int c = in.read();\n if (c == -1 || \" \\n\\r\\t\".indexOf(c) != -1) {\n break;\n }\n sb.append((char)c);\n }\n return sb.toString();\n }\n\n public int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n public long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n public double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "matrices", "combinatorics"], "code_uid": "c601915ef6286b74b7f16085a66de96e", "src_uid": "14f50a111db268182e5927839a993118", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "//package round791;\r\nimport java.io.*;\r\nimport java.util.ArrayDeque;\r\nimport java.util.Arrays;\r\nimport java.util.InputMismatchException;\r\nimport java.util.Queue;\r\n\r\npublic class F2 {\r\n\tInputStream is;\r\n\tFastWriter out;\r\n\tString INPUT = \"\";\r\n\t\r\n\tvoid solve()\r\n\t{\r\n\t\tint n = ni();\r\n\t\tboolean[][] g = new boolean[10][10];\r\n\t\tfor(int m = ni();m > 0;m--){\r\n\t\t\tint x = ni(), y = ni();\r\n\t\t\tg[x][y] = g[y][x] = true;\r\n\t\t}\r\n\t\tfor(int i = 0;i < 10;i++)g[i][i] = true;\r\n\r\n\t\tint[][] njs = new int[1<<9][10];\r\n\t\tfor(int j = 0;j < 1<<9;j++) {\r\n\t\t\tfor (int k = 0; k < 10; k++) {\r\n\t\t\t\tif (j << ~k >= 0) {\r\n\t\t\t\t\tint nj = j;\r\n\t\t\t\t\tfor (int l = 0; l < 10; l++) {\r\n\t\t\t\t\t\tif (g[k][l]) {\r\n\t\t\t\t\t\t\tif (k > l) {\r\n\t\t\t\t\t\t\t\tnj |= 1 << l;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\tnj &= ~(1 << l);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\tnjs[j][k] = nj;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\r\n\t\tlong[] dp = new long[1<<9];\r\n\t\tdp[0] = 1;\r\n\t\tfor(int i = 1;i <= n;i++){\r\n\t\t\tlong[] ndp = new long[1<<9];\r\n\t\t\tfor(int j = 0;j < 1<<9;j++){\r\n\t\t\t\tfor(int k = 0;k < 10;k++){\r\n\t\t\t\t\tif (j << ~k >= 0) {\r\n\t\t\t\t\t\tint nj = njs[j][k];\r\n\t\t\t\t\t\tndp[nj] += dp[j];\r\n\t\t\t\t\t\tif(ndp[nj] >= mod)ndp[nj] -= mod;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tdp = ndp;\r\n\t\t}\r\n\t\tlong ans = sum(dp) % mod;\r\n\t\tout.println(ans);\r\n\t}\r\n\r\n\tpublic static long sum(long... a){long ret = 0; for(long v : a)ret += v; return ret;}\r\n\r\n\r\n\tpublic static final int mod = 998244353;\r\n\tpublic static final int G = 3;\r\n\r\n\t// only 998244353\r\n\tpublic static long[] mul(long[] a, long[] b)\r\n\t{\r\n\t\tif(a.length == 0 && b.length == 0)return new long[0];\r\n\t\tif(a.length + b.length >= 300) {\r\n\t\t\treturn Arrays.copyOf(NTTStockham998244353.convolve(a, b), a.length + b.length - 1);\r\n\t\t}else{\r\n\t\t\treturn mulnaive(a, b);\r\n\t\t}\r\n\t}\r\n\r\n\tpublic static long[] mul(long[] a, long[] b, int lim)\r\n\t{\r\n\t\tif(a.length + b.length >= 300) {\r\n\t\t\treturn Arrays.copyOf(NTTStockham998244353.convolve(a, b), lim);\r\n\t\t}else{\r\n\t\t\treturn mulnaive(a, b, lim);\r\n\t\t}\r\n\t}\r\n\r\n\t//\tpublic static final int mod = 1000000007;\r\n\t//\tpublic static long[] mul(long[] a, long[] b)\r\n\t//\t{\r\n\t//\t\tif(Math.max(a.length, b.length) >= 3000){\r\n\t//\t\t\treturn Arrays.copyOf(NTTCRT.convolve(a, b, 3, mod), a.length+b.length-1);\r\n\t//\t\t}else{\r\n\t//\t\t\treturn mulnaive(a, b);\r\n\t//\t\t}\r\n\t//\t}\r\n\r\n\t//\tpublic static long[] mul(long[] a, long[] b, int lim)\r\n\t//\t{\r\n\t//\t\tif(Math.max(a.length, b.length) >= 3000){\r\n\t//\t\t\treturn Arrays.copyOf(NTTCRT.convolve(a, b, 3, mod), lim);\r\n\t//\t\t}else{\r\n\t//\t\t\treturn mulnaive(a, b, lim);\r\n\t//\t\t}\r\n\t//\t}\r\n\r\n\tpublic static final long big = (Long.MAX_VALUE/mod/mod-1)*mod*mod;\r\n\r\n\tpublic static long[] mulnaive(long[] a, long[] b)\r\n\t{\r\n\t\tlong[] c = new long[a.length+b.length-1];\r\n\t\tfor(int i = 0;i < a.length;i++){\r\n\t\t\tfor(int j = 0;j < b.length;j++){\r\n\t\t\t\tc[i+j] += a[i]*b[j];\r\n\t\t\t\tif(c[i+j] >= big)c[i+j] -= big;\r\n\t\t\t}\r\n\t\t}\r\n\t\tfor(int i = 0;i < c.length;i++)c[i] %= mod;\r\n\t\treturn c;\r\n\t}\r\n\r\n\tpublic static long[] mulnaive(long[] a, long[] b, int lim)\r\n\t{\r\n\t\tlong[] c = new long[lim];\r\n\t\tfor(int i = 0;i < a.length;i++){\r\n\t\t\tfor(int j = 0;j < b.length && i+j < lim;j++){\r\n\t\t\t\tc[i+j] += a[i]*b[j];\r\n\t\t\t\tif(c[i+j] >= big)c[i+j] -= big;\r\n\t\t\t}\r\n\t\t}\r\n\t\tfor(int i = 0;i < c.length;i++)c[i] %= mod;\r\n\t\treturn c;\r\n\t}\r\n\r\n\r\n\tpublic static class NTTStockham998244353 {\r\n\t\tprivate static final int P = 998244353, mod = P, G = 3;\r\n\t\tprivate static long[] wps;\r\n\r\n\t\tpublic static long[] convolve(long[] a, long[] b)\r\n\t\t{\r\n\t\t\tint m = Math.max(2, Integer.highestOneBit(Math.max(a.length, b.length)-1)<<2);\r\n\r\n\t\t\twps = new long[m];\r\n\t\t\tlong unit = pow(G, (P-1)/m);\r\n\t\t\twps[0] = 1;\r\n\t\t\tfor(int p = 1;p < m;p++) {\r\n\t\t\t\twps[p] = wps[p-1] * unit % mod;\r\n\t\t\t}\r\n\r\n\t\t\tlong[] fa = go(a, m, false);\r\n\t\t\tlong[] fb = a == b ? fa : go(b, m, false);\r\n\t\t\tfor(int i = 0;i < m;i++){\r\n\t\t\t\tfa[i] = fa[i]*fb[i] % mod;\r\n\t\t\t}\r\n\t\t\tfa = go(fa, m, true);\r\n\t\t\tfor(int i = 1, j = m-1;i < j;i++,j--) {\r\n\t\t\t\tlong d = fa[i]; fa[i] = fa[j]; fa[j] = d;\r\n\t\t\t}\r\n\t\t\treturn fa;\r\n\t\t}\r\n\r\n\t\tprivate static void fft(long[] X, long[] Y)\r\n\t\t{\r\n\t\t\tint s = 1;\r\n\t\t\tboolean eo = false;\r\n\t\t\tfor(int n = X.length;n >= 4;n /= 2) {\r\n\t\t\t\tint m = n/2;\r\n\t\t\t\tfor(int p = 0;p < m;p++) {\r\n\t\t\t\t\tlong wp = wps[s*p];\r\n\t\t\t\t\tlong wk = (wp<<32)/P;\r\n\t\t\t\t\tfor(int q = 0;q < s;q++) {\r\n\t\t\t\t\t\tlong a = X[q + s*(p+0)];\r\n\t\t\t\t\t\tlong b = X[q + s*(p+m)];\r\n\t\t\t\t\t\tlong ndsts = a + b;\r\n\t\t\t\t\t\tif(ndsts >= 2*P)ndsts -= 2*P;\r\n\t\t\t\t\t\tlong T = a - b + 2*P;\r\n\t\t\t\t\t\tlong Q = wk*T>>>32;\r\n\t\t\t\t\t\tY[q + s*(2*p+0)] = ndsts;\r\n\t\t\t\t\t\tY[q + s*(2*p+1)] = wp*T-Q*P&(1L<<32)-1;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\ts *= 2;\r\n\t\t\t\teo = !eo;\r\n\t\t\t\tlong[] D = X; X = Y; Y = D;\r\n\t\t\t}\r\n\t\t\tlong[] z = eo ? Y : X;\r\n\t\t\tfor(int q = 0;q < s;q++) {\r\n\t\t\t\tlong a = X[q + 0];\r\n\t\t\t\tlong b = X[q + s];\r\n\t\t\t\tz[q+0] = (a+b) % P;\r\n\t\t\t\tz[q+s] = (a-b+2*P) % P;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t//\tprivate static void fft(long[] X, long[] Y)\r\n\t\t//\t{\r\n\t\t//\t\tint s = 1;\r\n\t\t//\t\tboolean eo = false;\r\n\t\t//\t\tfor(int n = X.length;n >= 4;n /= 2) {\r\n\t\t//\t\t\tint m = n/2;\r\n\t\t//\t\t\tfor(int p = 0;p < m;p++) {\r\n\t\t//\t\t\t\tlong wp = wps[s*p];\r\n\t\t//\t\t\t\tfor(int q = 0;q < s;q++) {\r\n\t\t//\t\t\t\t\tlong a = X[q + s*(p+0)];\r\n\t\t//\t\t\t\t\tlong b = X[q + s*(p+m)];\r\n\t\t//\t\t\t\t\tY[q + s*(2*p+0)] = (a+b) % P;\r\n\t\t//\t\t\t\t\tY[q + s*(2*p+1)] = (a-b+P) * wp % P;\r\n\t\t//\t\t\t\t}\r\n\t\t//\t\t\t}\r\n\t\t//\t\t\ts *= 2;\r\n\t\t//\t\t\teo = !eo;\r\n\t\t//\t\t\tlong[] D = X; X = Y; Y = D;\r\n\t\t//\t\t}\r\n\t\t//\t\tlong[] z = eo ? Y : X;\r\n\t\t//\t\tfor(int q = 0;q < s;q++) {\r\n\t\t//\t\t\tlong a = X[q + 0];\r\n\t\t//\t\t\tlong b = X[q + s];\r\n\t\t//\t\t\tz[q+0] = (a+b) % P;\r\n\t\t//\t\t\tz[q+s] = (a-b+P) % P;\r\n\t\t//\t\t}\r\n\t\t//\t}\r\n\r\n\t\tprivate static long[] go(long[] src, int n, boolean inverse)\r\n\t\t{\r\n\t\t\tlong[] dst = Arrays.copyOf(src, n);\r\n\t\t\tfft(dst, new long[n]);\r\n\t\t\tif(inverse){\r\n\t\t\t\tlong in = invl(n);\r\n\t\t\t\tfor(int i = 0;i < n;i++){\r\n\t\t\t\t\tdst[i] = dst[i] * in % mod;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\treturn dst;\r\n\t\t}\r\n\r\n\t\tprivate static long pow(long a, long n) {\r\n\t\t\t//\t\ta %= mod;\r\n\t\t\tlong ret = 1;\r\n\t\t\tint x = 63 - Long.numberOfLeadingZeros(n);\r\n\t\t\tfor (; x >= 0; x--) {\r\n\t\t\t\tret = ret*ret % mod;\r\n\t\t\t\tif (n<<~x<0)ret = ret*a%mod;\r\n\t\t\t}\r\n\t\t\treturn ret;\r\n\t\t}\r\n\r\n\t\tprivate static long invl(long a) {\r\n\t\t\tlong b = mod;\r\n\t\t\tlong p = 1, q = 0;\r\n\t\t\twhile (b > 0) {\r\n\t\t\t\tlong c = a / b;\r\n\t\t\t\tlong d;\r\n\t\t\t\td = a;\r\n\t\t\t\ta = b;\r\n\t\t\t\tb = d % b;\r\n\t\t\t\td = p;\r\n\t\t\t\tp = q;\r\n\t\t\t\tq = d - c * q;\r\n\t\t\t}\r\n\t\t\treturn p < 0 ? p + mod : p;\r\n\t\t}\r\n\t}\r\n\r\n\r\n\tpublic static long C(int n, int r, int mod, int[][] fif) {\r\n\t\tif (n < 0 || r < 0 || r > n) return 0;\r\n\t\treturn (long) fif[0][n] * fif[1][r] % mod * fif[1][n - r] % mod;\r\n\t}\r\n\r\n\tpublic static int[][] enumFIF(int n, int mod) {\r\n\t\tint[] f = new int[n + 1];\r\n\t\tint[] invf = new int[n + 1];\r\n\t\tf[0] = 1;\r\n\t\tfor (int i = 1; i <= n; i++) {\r\n\t\t\tf[i] = (int) ((long) f[i - 1] * i % mod);\r\n\t\t}\r\n\t\tlong a = f[n];\r\n\t\tlong b = mod;\r\n\t\tlong p = 1, q = 0;\r\n\t\twhile (b > 0) {\r\n\t\t\tlong c = a / b;\r\n\t\t\tlong d;\r\n\t\t\td = a;\r\n\t\t\ta = b;\r\n\t\t\tb = d % b;\r\n\t\t\td = p;\r\n\t\t\tp = q;\r\n\t\t\tq = d - c * q;\r\n\t\t}\r\n\t\tinvf[n] = (int) (p < 0 ? p + mod : p);\r\n\t\tfor (int i = n - 1; i >= 0; i--) {\r\n\t\t\tinvf[i] = (int) ((long) invf[i + 1] * (i + 1) % mod);\r\n\t\t}\r\n\t\treturn new int[][]{f, invf};\r\n\t}\r\n\r\n\r\n\tpublic static class DJSet {\r\n\t\tpublic int[] upper;\r\n\r\n\t\tpublic DJSet(int n) {\r\n\t\t\tupper = new int[n];\r\n\t\t\tArrays.fill(upper, -1);\r\n\t\t}\r\n\r\n\t\tpublic int root(int x) {\r\n\t\t\treturn upper[x] < 0 ? x : (upper[x] = root(upper[x]));\r\n\t\t}\r\n\r\n\t\tpublic boolean equiv(int x, int y) {\r\n\t\t\treturn root(x) == root(y);\r\n\t\t}\r\n\r\n\t\tpublic boolean unite(int x, int y) {\r\n\t\t\tx = root(x);\r\n\t\t\ty = root(y);\r\n\t\t\tif (x != y) {\r\n\t\t\t\tif (upper[y] < upper[x]) {\r\n\t\t\t\t\tint d = x;\r\n\t\t\t\t\tx = y;\r\n\t\t\t\t\ty = d;\r\n\t\t\t\t}\r\n\t\t\t\tupper[x] += upper[y];\r\n\t\t\t\tupper[y] = x;\r\n\t\t\t}\r\n\t\t\treturn x == y;\r\n\t\t}\r\n\r\n\t\tpublic int count() {\r\n\t\t\tint ct = 0;\r\n\t\t\tfor (int u : upper) if (u < 0) ct++;\r\n\t\t\treturn ct;\r\n\t\t}\r\n\r\n\t\tpublic int[][] toBucket() {\r\n\t\t\tint n = upper.length;\r\n\t\t\tint[][] ret = new int[n][];\r\n\t\t\tint[] rp = new int[n];\r\n\t\t\tfor (int i = 0; i < n; i++) if (upper[i] < 0) ret[i] = new int[-upper[i]];\r\n\t\t\tfor (int i = 0; i < n; i++) {\r\n\t\t\t\tint r = root(i);\r\n\t\t\t\tret[r][rp[r]++] = i;\r\n\t\t\t}\r\n\t\t\treturn ret;\r\n\t\t}\r\n\t}\r\n\r\n\r\n\tvoid run() throws Exception\r\n\t{\r\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\r\n\t\tout = new FastWriter(System.out);\r\n\t\t\r\n\t\tlong s = System.currentTimeMillis();\r\n\t\tsolve();\r\n\t\tout.flush();\r\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\r\n\t}\r\n\t\r\n\tpublic static void main(String[] args) throws Exception { new F2().run(); }\r\n\t\r\n\tprivate byte[] inbuf = new byte[1024];\r\n\tpublic int lenbuf = 0, ptrbuf = 0;\r\n\t\r\n\tprivate int readByte()\r\n\t{\r\n\t\tif(lenbuf == -1)throw new InputMismatchException();\r\n\t\tif(ptrbuf >= lenbuf){\r\n\t\t\tptrbuf = 0;\r\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\r\n\t\t\tif(lenbuf <= 0)return -1;\r\n\t\t}\r\n\t\treturn inbuf[ptrbuf++];\r\n\t}\r\n\t\r\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\r\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\r\n\t\r\n\tprivate double nd() { return Double.parseDouble(ns()); }\r\n\tprivate char nc() { return (char)skip(); }\r\n\t\r\n\tprivate String ns()\r\n\t{\r\n\t\tint b = skip();\r\n\t\tStringBuilder sb = new StringBuilder();\r\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\r\n\t\t\tsb.appendCodePoint(b);\r\n\t\t\tb = readByte();\r\n\t\t}\r\n\t\treturn sb.toString();\r\n\t}\r\n\t\r\n\tprivate char[] ns(int n)\r\n\t{\r\n\t\tchar[] buf = new char[n];\r\n\t\tint b = skip(), p = 0;\r\n\t\twhile(p < n && !(isSpaceChar(b))){\r\n\t\t\tbuf[p++] = (char)b;\r\n\t\t\tb = readByte();\r\n\t\t}\r\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\r\n\t}\r\n\r\n\tprivate int[] na(int n)\r\n\t{\r\n\t\tint[] a = new int[n];\r\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\r\n\t\treturn a;\r\n\t}\r\n\r\n\tprivate long[] nal(int n)\r\n\t{\r\n\t\tlong[] a = new long[n];\r\n\t\tfor(int i = 0;i < n;i++)a[i] = nl();\r\n\t\treturn a;\r\n\t}\r\n\r\n\tprivate char[][] nm(int n, int m) {\r\n\t\tchar[][] map = new char[n][];\r\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\r\n\t\treturn map;\r\n\t}\r\n\r\n\tprivate int[][] nmi(int n, int m) {\r\n\t\tint[][] map = new int[n][];\r\n\t\tfor(int i = 0;i < n;i++)map[i] = na(m);\r\n\t\treturn map;\r\n\t}\r\n\r\n\tprivate int ni() { return (int)nl(); }\r\n\r\n\tprivate long nl()\r\n\t{\r\n\t\tlong num = 0;\r\n\t\tint b;\r\n\t\tboolean minus = false;\r\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\r\n\t\tif(b == '-'){\r\n\t\t\tminus = true;\r\n\t\t\tb = readByte();\r\n\t\t}\r\n\r\n\t\twhile(true){\r\n\t\t\tif(b >= '0' && b <= '9'){\r\n\t\t\t\tnum = num * 10 + (b - '0');\r\n\t\t\t}else{\r\n\t\t\t\treturn minus ? -num : num;\r\n\t\t\t}\r\n\t\t\tb = readByte();\r\n\t\t}\r\n\t}\r\n\r\n\tpublic static class FastWriter\r\n\t{\r\n\t\tprivate static final int BUF_SIZE = 1<<13;\r\n\t\tprivate final byte[] buf = new byte[BUF_SIZE];\r\n\t\tprivate final OutputStream out;\r\n\t\tprivate int ptr = 0;\r\n\r\n\t\tprivate FastWriter(){out = null;}\r\n\r\n\t\tpublic FastWriter(OutputStream os)\r\n\t\t{\r\n\t\t\tthis.out = os;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter(String path)\r\n\t\t{\r\n\t\t\ttry {\r\n\t\t\t\tthis.out = new FileOutputStream(path);\r\n\t\t\t} catch (FileNotFoundException e) {\r\n\t\t\t\tthrow new RuntimeException(\"FastWriter\");\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(byte b)\r\n\t\t{\r\n\t\t\tbuf[ptr++] = b;\r\n\t\t\tif(ptr == BUF_SIZE)innerflush();\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(char c)\r\n\t\t{\r\n\t\t\treturn write((byte)c);\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(char[] s)\r\n\t\t{\r\n\t\t\tfor(char c : s){\r\n\t\t\t\tbuf[ptr++] = (byte)c;\r\n\t\t\t\tif(ptr == BUF_SIZE)innerflush();\r\n\t\t\t}\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(String s)\r\n\t\t{\r\n\t\t\ts.chars().forEach(c -> {\r\n\t\t\t\tbuf[ptr++] = (byte)c;\r\n\t\t\t\tif(ptr == BUF_SIZE)innerflush();\r\n\t\t\t});\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tprivate static int countDigits(int l) {\r\n\t\t\tif (l >= 1000000000) return 10;\r\n\t\t\tif (l >= 100000000) return 9;\r\n\t\t\tif (l >= 10000000) return 8;\r\n\t\t\tif (l >= 1000000) return 7;\r\n\t\t\tif (l >= 100000) return 6;\r\n\t\t\tif (l >= 10000) return 5;\r\n\t\t\tif (l >= 1000) return 4;\r\n\t\t\tif (l >= 100) return 3;\r\n\t\t\tif (l >= 10) return 2;\r\n\t\t\treturn 1;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(int x)\r\n\t\t{\r\n\t\t\tif(x == Integer.MIN_VALUE){\r\n\t\t\t\treturn write((long)x);\r\n\t\t\t}\r\n\t\t\tif(ptr + 12 >= BUF_SIZE)innerflush();\r\n\t\t\tif(x < 0){\r\n\t\t\t\twrite((byte)'-');\r\n\t\t\t\tx = -x;\r\n\t\t\t}\r\n\t\t\tint d = countDigits(x);\r\n\t\t\tfor(int i = ptr + d - 1;i >= ptr;i--){\r\n\t\t\t\tbuf[i] = (byte)('0'+x%10);\r\n\t\t\t\tx /= 10;\r\n\t\t\t}\r\n\t\t\tptr += d;\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tprivate static int countDigits(long l) {\r\n\t\t\tif (l >= 1000000000000000000L) return 19;\r\n\t\t\tif (l >= 100000000000000000L) return 18;\r\n\t\t\tif (l >= 10000000000000000L) return 17;\r\n\t\t\tif (l >= 1000000000000000L) return 16;\r\n\t\t\tif (l >= 100000000000000L) return 15;\r\n\t\t\tif (l >= 10000000000000L) return 14;\r\n\t\t\tif (l >= 1000000000000L) return 13;\r\n\t\t\tif (l >= 100000000000L) return 12;\r\n\t\t\tif (l >= 10000000000L) return 11;\r\n\t\t\tif (l >= 1000000000L) return 10;\r\n\t\t\tif (l >= 100000000L) return 9;\r\n\t\t\tif (l >= 10000000L) return 8;\r\n\t\t\tif (l >= 1000000L) return 7;\r\n\t\t\tif (l >= 100000L) return 6;\r\n\t\t\tif (l >= 10000L) return 5;\r\n\t\t\tif (l >= 1000L) return 4;\r\n\t\t\tif (l >= 100L) return 3;\r\n\t\t\tif (l >= 10L) return 2;\r\n\t\t\treturn 1;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(long x)\r\n\t\t{\r\n\t\t\tif(x == Long.MIN_VALUE){\r\n\t\t\t\treturn write(\"\" + x);\r\n\t\t\t}\r\n\t\t\tif(ptr + 21 >= BUF_SIZE)innerflush();\r\n\t\t\tif(x < 0){\r\n\t\t\t\twrite((byte)'-');\r\n\t\t\t\tx = -x;\r\n\t\t\t}\r\n\t\t\tint d = countDigits(x);\r\n\t\t\tfor(int i = ptr + d - 1;i >= ptr;i--){\r\n\t\t\t\tbuf[i] = (byte)('0'+x%10);\r\n\t\t\t\tx /= 10;\r\n\t\t\t}\r\n\t\t\tptr += d;\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(double x, int precision)\r\n\t\t{\r\n\t\t\tif(x < 0){\r\n\t\t\t\twrite('-');\r\n\t\t\t\tx = -x;\r\n\t\t\t}\r\n\t\t\tx += Math.pow(10, -precision)/2;\r\n\t\t\t//\t\tif(x < 0){ x = 0; }\r\n\t\t\twrite((long)x).write(\".\");\r\n\t\t\tx -= (long)x;\r\n\t\t\tfor(int i = 0;i < precision;i++){\r\n\t\t\t\tx *= 10;\r\n\t\t\t\twrite((char)('0'+(int)x));\r\n\t\t\t\tx -= (int)x;\r\n\t\t\t}\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(char c){\r\n\t\t\treturn write(c).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(int x){\r\n\t\t\treturn write(x).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(long x){\r\n\t\t\treturn write(x).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(double x, int precision){\r\n\t\t\treturn write(x, precision).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(int... xs)\r\n\t\t{\r\n\t\t\tboolean first = true;\r\n\t\t\tfor(int x : xs) {\r\n\t\t\t\tif (!first) write(' ');\r\n\t\t\t\tfirst = false;\r\n\t\t\t\twrite(x);\r\n\t\t\t}\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(long... xs)\r\n\t\t{\r\n\t\t\tboolean first = true;\r\n\t\t\tfor(long x : xs) {\r\n\t\t\t\tif (!first) write(' ');\r\n\t\t\t\tfirst = false;\r\n\t\t\t\twrite(x);\r\n\t\t\t}\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln()\r\n\t\t{\r\n\t\t\treturn write((byte)'\\n');\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(int... xs)\r\n\t\t{\r\n\t\t\treturn write(xs).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(long... xs)\r\n\t\t{\r\n\t\t\treturn write(xs).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(char[] line)\r\n\t\t{\r\n\t\t\treturn write(line).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(char[]... map)\r\n\t\t{\r\n\t\t\tfor(char[] line : map)write(line).writeln();\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(String s)\r\n\t\t{\r\n\t\t\treturn write(s).writeln();\r\n\t\t}\r\n\r\n\t\tprivate void innerflush()\r\n\t\t{\r\n\t\t\ttry {\r\n\t\t\t\tout.write(buf, 0, ptr);\r\n\t\t\t\tptr = 0;\r\n\t\t\t} catch (IOException e) {\r\n\t\t\t\tthrow new RuntimeException(\"innerflush\");\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tpublic void flush()\r\n\t\t{\r\n\t\t\tinnerflush();\r\n\t\t\ttry {\r\n\t\t\t\tout.flush();\r\n\t\t\t} catch (IOException e) {\r\n\t\t\t\tthrow new RuntimeException(\"flush\");\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tpublic FastWriter print(byte b) { return write(b); }\r\n\t\tpublic FastWriter print(char c) { return write(c); }\r\n\t\tpublic FastWriter print(char[] s) { return write(s); }\r\n\t\tpublic FastWriter print(String s) { return write(s); }\r\n\t\tpublic FastWriter print(int x) { return write(x); }\r\n\t\tpublic FastWriter print(long x) { return write(x); }\r\n\t\tpublic FastWriter print(double x, int precision) { return write(x, precision); }\r\n\t\tpublic FastWriter println(char c){ return writeln(c); }\r\n\t\tpublic FastWriter println(int x){ return writeln(x); }\r\n\t\tpublic FastWriter println(long x){ return writeln(x); }\r\n\t\tpublic FastWriter println(double x, int precision){ return writeln(x, precision); }\r\n\t\tpublic FastWriter print(int... xs) { return write(xs); }\r\n\t\tpublic FastWriter print(long... xs) { return write(xs); }\r\n\t\tpublic FastWriter println(int... xs) { return writeln(xs); }\r\n\t\tpublic FastWriter println(long... xs) { return writeln(xs); }\r\n\t\tpublic FastWriter println(char[] line) { return writeln(line); }\r\n\t\tpublic FastWriter println(char[]... map) { return writeln(map); }\r\n\t\tpublic FastWriter println(String s) { return writeln(s); }\r\n\t\tpublic FastWriter println() { return writeln(); }\r\n\t}\r\n\r\n\tpublic void trnz(int... o)\r\n\t{\r\n\t\tfor(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+\":\"+o[i]+\" \");\r\n\t\tSystem.out.println();\r\n\t}\r\n\r\n\t// print ids which are 1\r\n\tpublic void trt(long... o)\r\n\t{\r\n\t\tQueue<Integer> stands = new ArrayDeque<>();\r\n\t\tfor(int i = 0;i < o.length;i++){\r\n\t\t\tfor(long x = o[i];x != 0;x &= x-1)stands.add(i<<6|Long.numberOfTrailingZeros(x));\r\n\t\t}\r\n\t\tSystem.out.println(stands);\r\n\t}\r\n\r\n\tpublic void tf(boolean... r)\r\n\t{\r\n\t\tfor(boolean x : r)System.out.print(x?'#':'.');\r\n\t\tSystem.out.println();\r\n\t}\r\n\r\n\tpublic void tf(boolean[]... b)\r\n\t{\r\n\t\tfor(boolean[] r : b) {\r\n\t\t\tfor(boolean x : r)System.out.print(x?'#':'.');\r\n\t\t\tSystem.out.println();\r\n\t\t}\r\n\t\tSystem.out.println();\r\n\t}\r\n\r\n\tpublic void tf(long[]... b)\r\n\t{\r\n\t\tif(INPUT.length() != 0) {\r\n\t\t\tfor (long[] r : b) {\r\n\t\t\t\tfor (long x : r) {\r\n\t\t\t\t\tfor (int i = 0; i < 64; i++) {\r\n\t\t\t\t\t\tSystem.out.print(x << ~i < 0 ? '#' : '.');\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\tSystem.out.println();\r\n\t\t\t}\r\n\t\t\tSystem.out.println();\r\n\t\t}\r\n\t}\r\n\r\n\tpublic void tf(long... b)\r\n\t{\r\n\t\tif(INPUT.length() != 0) {\r\n\t\t\tfor (long x : b) {\r\n\t\t\t\tfor (int i = 0; i < 64; i++) {\r\n\t\t\t\t\tSystem.out.print(x << ~i < 0 ? '#' : '.');\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tSystem.out.println();\r\n\t\t}\r\n\t}\r\n\r\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\r\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\r\n}\r\n", "lang_cluster": "Java", "tags": ["math", "dp", "bitmasks"], "code_uid": "9190dbd04d161be2c1f53fcb9643ae0d", "src_uid": "60955fc2caa6ec99c7dcc1da5d36b1f8", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\r\nimport java.io.*;\r\nimport java.math.BigInteger;\r\n\r\n// you can compare with output.txt and expected out\r\npublic class Round791F {\r\n\tMyPrintWriter out;\r\n\tMyScanner in;\r\n\t\r\n//\tfinal static long FIXED_RANDOM;\r\n//\tstatic {\r\n//\t\tFIXED_RANDOM = System.currentTimeMillis();\r\n//\t}\r\n\tfinal static String IMPOSSIBLE = \"IMPOSSIBLE\";\r\n\tfinal static String POSSIBLE = \"POSSIBLE\";\r\n\tfinal static String YES = \"YES\";\r\n\tfinal static String NO = \"NO\";\r\n\tfinal static long MOD = 998244353;\r\n\t\r\n private void initIO(boolean isFileIO) {\r\n if (System.getProperty(\"ONLINE_JUDGE\") == null && isFileIO) {\r\n \ttry{\r\n\t in = new MyScanner(new FileInputStream(\"input.txt\"));\r\n\t out = new MyPrintWriter(new FileOutputStream(\"output.txt\"));\r\n \t}\r\n \tcatch(FileNotFoundException e){\r\n \t\te.printStackTrace();\r\n \t}\r\n }\r\n else{\r\n \t\tin = new MyScanner(System.in);\r\n \t out = new MyPrintWriter(new BufferedOutputStream(System.out));\r\n }\r\n }\r\n\t\r\n\tpublic static void main(String[] args){\r\n//\t\tScanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));\r\n\t\t\r\n\t\tRound791F sol = new Round791F();\r\n\t\tsol.run();\r\n }\r\n\t\r\n\tprivate void run() {\r\n\t\tboolean isDebug = false;\r\n\t\tboolean isFileIO = true;\r\n\t\tboolean hasMultipleTests = false;\r\n\t\t\r\n\t\tinitIO(isFileIO);\r\n\t\r\n\t\tint t = hasMultipleTests? in.nextInt() : 1;\r\n\t \r\n\t for (int i = 1; i <= t; ++i) {\r\n\t \tint n = in.nextInt();\r\n\t \tint m = in.nextInt();\r\n\t \tint[][] uv = in.nextPairs(m);\r\n\t \tint[] u = uv[0];\r\n\t \tint[] v = uv[1];\r\n\t \t\r\n\t \tif(isDebug){\r\n\t\t \tout.printf(\"Test %d\\n\", i);\r\n\t \t}\r\n\t \t\r\n\t\t\tlong ans = solve2(u, v, n);\r\n\t\t\tout.println(ans);\r\n\t\t\t\r\n\t\t\t//validate(u, v, n);\r\n\t\t\t\r\n\t\t\tif(isDebug)\r\n\t\t\t\tout.flush();\r\n\t }\r\n\t \r\n\t in.close();\r\n\t out.close();\r\n\t}\r\n\t\r\n\t// wrong idea for the validator.. meh\r\n\tprivate void validate(int[] u, int[] v, int n) {\r\n\t\tTreeSet<String> set = new TreeSet<>();\r\n\t\tint[][] cmp = new int[RADIX][RADIX];\r\n\t\tfor(int i=0; i<RADIX; i++) {\r\n\t\t\tfor(int j=0; j<RADIX; j++) {\r\n\t\t\t\tcmp[i][j] = 0;\r\n\t\t\t}\r\n\t\t}\r\n\t\tfor(int i=0; i<u.length; i++) {\r\n\t\t\tint small = Math.min(u[i], v[i]);\r\n\t\t\tint large = Math.max(u[i], v[i]);\r\n\t\t\tcmp[small][large] = -1;\r\n\t\t\tcmp[large][small] = 1;\r\n\t\t}\r\n//\t\tfor(int i=0; i<RADIX; i++) {\r\n//\t\t\tfor(int j=0; j<RADIX; j++) {\r\n//\t\t\t\tfor(int k=0; k<RADIX; k++) {\r\n//\t\t\t\t\tif(cmp[i][j] == 1 && cmp[j][k] == 1)\r\n//\t\t\t\t\t\tcmp[i][k] = 1;\r\n//\t\t\t\t\telse if(cmp[i][j] == -1 && cmp[j][k] == -1)\r\n//\t\t\t\t\t\tcmp[i][k] = -1;\r\n//\t\t\t\t}\r\n//\t\t\t}\r\n//\t\t}\r\n\t\t\r\n\t\tComparator<Character> comp = new Comparator<Character>() {\r\n\t\t\t@Override\r\n\t\t\tpublic int compare(Character o1, Character o2) {\r\n\t\t\t\treturn cmp[o1-'0'][o2-'0'];\r\n\t\t\t}\r\n\t\t};\r\n\t\t\r\n\t\tBigInteger curr = BigInteger.ZERO;\r\n\t\tBigInteger limit = BigInteger.valueOf(RADIX).pow(n);\r\n\t\tStringBuilder sb = new StringBuilder();\r\n\t\twhile(curr.compareTo(limit) < 0) {\r\n\t\t\tString s = curr.toString(RADIX);\r\n\t\t\tint padding = n-s.length();\r\n\t\t\tsb.setLength(0);\r\n\t\t\tfor(int i=0; i<padding; i++)\r\n\t\t\t\tsb.append('0');\r\n\t\t\tsb.append(s);\r\n\t\t\tCharacter[] arr = new Character[n];\r\n\t\t\tfor(int i=0; i<n; i++)\r\n\t\t\t\tarr[i] = sb.charAt(i);\r\n\t\t\t Arrays.sort(arr, comp);\r\n\t\t\t// can't use sorting since comp is not transitive\r\n\t\t\t// actually, should make transitive\r\n\r\n//\t\t\tchar[] arr = new char[n];\r\n//\t\t\tfor(int i=0; i<n; i++)\r\n//\t\t\t\tarr[i] = sb.charAt(i);\r\n//\t\t\t\r\n//\t\t\tfor(int i=n-1; i>=0; i--) {\r\n//\t\t\t\tfor(int j=0; j<i; j++) {\r\n//\t\t\t\t\tif(cmp[arr[j]-'0'][arr[j+1]-'0'] == 1) {\r\n//\t\t\t\t\t\tchar temp = arr[j+1];\r\n//\t\t\t\t\t\tarr[j+1] = arr[j];\r\n//\t\t\t\t\t\tarr[j] = temp;\r\n//\t\t\t\t\t}\r\n//\t\t\t\t}\r\n//\t\t\t}\r\n\t\t\t\r\n\t\t\tsb.setLength(0);\r\n//\t\t\tsb.append(arr);\r\n\t\t\tfor(int i=0; i<n; i++)\r\n\t\t\t\tsb.append(arr[i]);\r\n\t\t\tset.add(sb.toString());\r\n\t\t\tcurr = curr.add(BigInteger.ONE);\r\n\t\t}\r\n\t\tout.println(set.size());\r\n\t\tout.println(set);\r\n\t\t\r\n\t\t\r\n\t\t// 4 3\r\n\t\t// 0 1\r\n\t\t// 0 2\r\n\t\t// 2 3\r\n\t\t\r\n\t\t// 0302 -> 0320 -> 0230\r\n\r\n // [0000, 0001, 0002, 0003, 0011, 0012, 0013, 0021, 0022, 0023, 0030, 0031, 0033,\r\n\t\t// 0111, 0112, 0113, 0121, 0122, 0123, 0130, 0131, 0133,\r\n\t\t// 0211, 0212, 0213, 0221, 0222, 0223, 0230, 0231, 0233,\r\n\t\t// 0300, 0301, 0302, 0303, 0311, 0312, 0313, 0330, 0331, 0333,\r\n\t\t// 1111, 1112, 1113, 1121, 1122, 1123, 1130, 1131, 1133, 1211,\r\n\t\t// 1212, 1213, 1221, 1222, 1223, 1230, 1231, 1233,\r\n\t\t// 1300, 1301, 1302, 1303, 1311, 1312, 1313, 1330, 1331, 1333,\r\n\t\t// 2111, 2112, 2113, 2121, 2122, 2123, 2130, 2131, 2133,\r\n\t\t// 2211, 2212, 2213, 2221, 2222, 2223, 2230, 2231, 2233,\r\n\t\t// 2300, 2301, 2302, 2303, 2311, 2312, 2313, 2330, 2331, 2333,\r\n\t\t// 3000, 3001, 3002, 3003, 3011, 3012, 3013, 3021, 3022, 3023, 3030, 3031, 3033,\r\n\t\t// 3111, 3112, 3113, 3121, 3122, 3123, 3130, 3131, 3133,\r\n\t\t// 3300, 3301, 3302, 3303, 3311, 3312, 3313, 3330, 3331, 3333]\r\n\r\n\t\t// when inserting j\r\n\t\t// X + \r\n\t}\r\n\r\n\tfinal int RADIX = 10;\r\n\tprivate long solve2(int[] u, int[] v, int n) {\r\n\t\t\r\n\t\t// 50000*2^10 = 5*10^7 = 50*10^6 = 100MB\r\n\t\t// why exceed?\r\n\t\t// dp[i][set] = # representatives in a[n-i..n-1] where elements in the set can move forward\r\n\t\t// long[][] dp = new long[n][1<<RADIX];\r\n\t\tlong[] dp = new long[1<<RADIX];\r\n\t\t\r\n\t\tfor(int j=0; j<RADIX; j++) {\r\n\t\t\tdp[1<<j] = 1;\r\n\t\t}\r\n\t\t\r\n\t\tint[][] cmp = new int[RADIX][RADIX];\r\n\t\tint m = u.length;\r\n\t\tfor(int i=0; i<m; i++) {\r\n\t\t\tint small = Math.min(u[i], v[i]);\r\n\t\t\tint larger = Math.max(u[i], v[i]);\r\n\t\t\tcmp[small][larger] = -1;\r\n\t\t\tcmp[larger][small] = 1;\r\n\t\t}\r\n\t\t\r\n\t\tboolean[][] isValid = new boolean[1<<RADIX][RADIX];\r\n\t\tint[][] map = new int[1<<RADIX][RADIX];\r\n\t\t\r\n\t\tfor(int mask=0; mask< 1<<RADIX; mask++) {\r\n\t\t\tfor(int j=0; j<RADIX; j++) {\r\n\t\t\t\tboolean ok = true;\r\n\t\t\t\tint next = 1<<j;\r\n\t\t\t\tfor(int k=0; k<RADIX; k++) {\r\n\t\t\t\t\tif( (1<<k & mask) == 0)\r\n\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t// k can come forward\r\n\t\t\t\t\t// case 1: j is incomparable to k\r\n\t\t\t\t\t// -> remove k from the set\r\n\t\t\t\t\tif(cmp[j][k] == 0) {\r\n\t\t\t\t\t}\r\n\t\t\t\t\t// case 2: j, k can be swapped and j is smaller\r\n\t\t\t\t\telse if(cmp[j][k] == -1) {\r\n\t\t\t\t\t\tnext |= 1<<k;\r\n\t\t\t\t\t}\r\n\t\t\t\t\t// case 3: j, k can be swapped and j is larger -> not a representative\r\n\t\t\t\t\telse {\r\n\t\t\t\t\t\tok = false;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\tisValid[mask][j] = ok;\r\n\t\t\t\tmap[mask][j] = next;\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t\t// n*2^RADIX*RADIX = 5*10^4*10^3*10 = 5*10^8\r\n\t\tfor(int i=n-2; i>=0; i--) {\r\n\t\t\tlong[] next = new long[1<<RADIX];\r\n\t\t\tfor(int mask=0; mask < 1<<RADIX; mask++) {\r\n\t\t\t\tfor(int j=0; j<RADIX; j++) {\r\n\t\t\t\t\tif(!isValid[mask][j])\r\n\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\tint mask2 = map[mask][j];\r\n\t\t\t\t\tlong val = next[mask2] + dp[mask];\r\n\t\t\t\t\tnext[mask2] = val < MOD? val: val-MOD;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tdp = next;\r\n\t\t}\r\n\t\t\r\n\t\tlong sum = 0;\r\n\t\tfor(int mask=0; mask < 1<<RADIX; mask++)\r\n\t\t\tsum += dp[mask]; // < Integer.MAX_VALUE * 10^3\r\n\t\treturn sum%MOD;\r\n\t}\r\n\t\r\n\t\r\n\tprivate long solve(int[] u, int[] v, int n) {\r\n\t\tint m = u.length;\r\n\t\t// S = [0, 10^n]\r\n\t\t// find # of equivalance classes S/~\r\n\t\t// base: swap uj and vj if they are adjacent digits\r\n\t\t\r\n\t\t// 10^n\r\n\t\t// (0, 1)\r\n\t\t\r\n\t\t// num[i] = # nums ending in i\r\n\t\tlong[] num = new long[RADIX];\r\n\t\tfor(int i=0; i<RADIX; i++)\r\n\t\t\tnum[i] = 1;\r\n\t\t\r\n\t\t// multipliers[i][j] = contributions from num[i] when j is appended\r\n\t\tlong[][] multipliers = new long[RADIX][RADIX];\r\n\t\tfor(int i=0; i<RADIX; i++) {\r\n\t\t\tfor(int j=0; j<RADIX; j++) {\r\n\t\t\t\tmultipliers[i][j] = 1;\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t\tfor(int i=0; i<m; i++) {\r\n\t\t\tint min = Math.min(u[i], v[i]);\r\n\t\t\tint max = Math.max(u[i], v[i]);\r\n\t\t\tmultipliers[max][min] = 0;\r\n\t\t}\r\n\t\t\r\n\t\t// xxxx0 + 1 -> xxxx01 * (1/2) + xxxx10 * (1/2)\r\n\t\t// yyyy1\r\n\t\t\r\n\t\t// (1/2) + (1/2) = 1\r\n\t\t// 2* + 2* = 1\r\n\t\t\r\n\t\t// string made of (0, 1)\r\n\t\t// -> different iff it has diff # of 0 or diff # of 1\r\n\t\t\r\n\t\t// (0, 1) (1, 2)\r\n\t\t// 0000000022222222\r\n\t\t// 0 and 2 can't swap\r\n\t\t// 021\r\n\t\t\r\n\t\t// xxxx0 + 0 -> k\r\n\t\t// xxxx0 + 1 -> k\r\n\t\t\r\n\t\t// xxxx1 + 0 -> X\r\n\t\t// \r\n\t\t\r\n\t\tint temp =1;\r\n\t\t\r\n\t\tfor(int i=1; i<n; i++) {\r\n\t\t\tlong[] num2 = new long[RADIX];\r\n\t\t\tfor(int j=0; j<RADIX; j++) {\r\n\t\t\t\tfor(int k=0; k<RADIX; k++) {\r\n\t\t\t\t\tnum2[j] += num[k]*multipliers[j][k] % MOD;\r\n\t\t\t\t}\r\n\t\t\t\tnum2[j] %= MOD;\r\n\t\t\t}\r\n\t\t\tnum = num2;\r\n\t\t}\r\n\t\t\r\n\t\tlong sum = 0;\r\n\t\tfor(int i=0; i<RADIX; i++)\r\n\t\t\tsum += num[i];\r\n\t\t\r\n\t\treturn sum%MOD;\r\n\t}\r\n\t\r\n\tstatic long pow(int a, int k, long p) {\r\n\t\tlong m = k;\r\n\t\tlong ans = 1;\r\n\r\n\t\t// curr = k^(2^i)\r\n\t\tlong curr = a;\r\n\r\n\t\t// k^(2x+1) = (k^x)^2 * k\r\n\t\twhile(m > 0) {\r\n\t\t\tif( (m&1) == 1 ) {\r\n\t\t\t\tans *= curr;\r\n\t\t\t\tans %= p;\r\n\t\t\t}\r\n\t\t\tm >>= 1;\r\n\t\t\tcurr *= curr;\r\n\t\t\tcurr %= p;\r\n\t\t}\r\n\t\treturn ans;\t\t\r\n\t}\r\n\r\n\t// computes a^(p-2)\r\n\tstatic long inverse(int a, long p) {\r\n\t\treturn pow(a, (int)(p-2), p);\r\n\t}\r\n\t\r\n\tpublic static class MyScanner {\r\n\t\tBufferedReader br;\r\n\t\tStringTokenizer st;\r\n\r\n\t\t// 32768?\r\n\t\tpublic MyScanner(InputStream is, int bufferSize) {\r\n\t\t\tbr = new BufferedReader(new InputStreamReader(is), bufferSize);\r\n\t\t}\r\n\t\t\r\n\t\tpublic MyScanner(InputStream is) {\r\n\t\t\tbr = new BufferedReader(new InputStreamReader(is));\r\n\t\t\t// br = new BufferedReader(new InputStreamReader(System.in));\r\n\t\t\t// br = new BufferedReader(new InputStreamReader(new FileInputStream(\"input.txt\")));\r\n\t\t}\r\n\r\n\t\tpublic void close() {\r\n\t\t\ttry {\r\n\t\t\t\tbr.close();\r\n\t\t\t} catch (IOException e) {\r\n\t\t\t\te.printStackTrace();\r\n\t\t\t}\r\n\r\n\t\t}\r\n\r\n\t\tString next() {\r\n\t\t\twhile (st == null || !st.hasMoreElements()) {\r\n\t\t\t\ttry {\r\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\r\n\t\t\t\t} catch (IOException e) {\r\n\t\t\t\t\te.printStackTrace();\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\treturn st.nextToken();\r\n\t\t}\r\n\r\n\t\tint nextInt() {\r\n\t\t\treturn Integer.parseInt(next());\r\n\t\t}\r\n\r\n\t\tlong nextLong() {\r\n\t\t\treturn Long.parseLong(next());\r\n\t\t}\r\n\r\n\t\tdouble nextDouble() {\r\n\t\t\treturn Double.parseDouble(next());\r\n\t\t}\r\n\r\n\t\tString nextLine(){\r\n\t\t\tString str = \"\";\r\n\t\t\ttry {\r\n\t\t\t\tstr = br.readLine();\r\n\t\t\t} catch (IOException e) {\r\n\t\t\t\te.printStackTrace();\r\n\t\t\t}\r\n\t\t\treturn str;\r\n\t\t}\r\n\t\t\r\n\t\tint[][] nextTreeEdges(int n, int offset){\r\n\t\t\tint[][] e = new int[n-1][2];\r\n\t\t\tfor(int i=0; i<n-1; i++){\r\n\t\t\t\te[i][0] = nextInt()+offset;\r\n\t\t\t\te[i][1] = nextInt()+offset;\r\n\t\t\t}\r\n\t\t\treturn e;\t\t\t\r\n\t\t}\r\n\t\t\r\n\t\tint[][] nextMatrix(int n, int m) {\r\n\t\t\treturn nextMatrix(n, m, 0);\r\n\t\t}\r\n\t\t\r\n\t\tint[][] nextMatrix(int n, int m, int offset) {\r\n\t\t\tint[][] mat = new int[n][m];\r\n\t\t\tfor(int i=0; i<n; i++) {\r\n\t\t\t\tfor(int j=0; j<m; j++) {\r\n\t\t\t\t\tmat[i][j] = nextInt()+offset;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\treturn mat;\r\n\t\t}\r\n\t\t\r\n\t\tint[][] nextPairs(int n){\r\n\t\t\treturn nextPairs(n, 0);\r\n\t\t}\r\n\t\t\r\n\t\tint[][] nextPairs(int n, int offset) {\r\n\t\t\tint[][] xy = new int[2][n];\r\n\t\t\tfor(int i=0; i<n; i++) {\r\n\t\t\t\txy[0][i] = nextInt() + offset;\r\n\t\t\t\txy[1][i] = nextInt() + offset;\r\n\t\t\t}\r\n\t\t\treturn xy;\r\n\t\t}\r\n\r\n\t\tint[][] nextGraphEdges(){\r\n\t\t\treturn nextGraphEdges(0);\r\n\t\t}\r\n\t\t\r\n\t\tint[][] nextGraphEdges(int offset) {\r\n\t\t\tint m = nextInt();\r\n\t\t\tint[][] e = new int[m][2];\r\n\t\t\tfor(int i=0; i<m; i++){\r\n\t\t\t\te[i][0] = nextInt()+offset;\r\n\t\t\t\te[i][1] = nextInt()+offset;\r\n\t\t\t}\r\n\t\t\treturn e;\r\n\t\t}\r\n\t\t\r\n\t\tint[] nextIntArray(int len) {\r\n\t\t\treturn nextIntArray(len, 0);\r\n\t\t}\r\n\t\tint[] nextIntArray(int len, int offset){\r\n\t \tint[] a = new int[len];\r\n\t\t\tfor(int j=0; j<len; j++)\r\n\t \t\ta[j] = nextInt()+offset;\r\n\t \treturn a;\r\n\t\t}\r\n\t\t\r\n\t\tlong[] nextLongArray(int len) {\r\n\t\t\treturn nextLongArray(len, 0);\r\n\t\t}\r\n\t\tlong[] nextLongArray(int len, int offset){\r\n\t \tlong[] a = new long[len];\r\n\t\t\tfor(int j=0; j<len; j++)\r\n\t \t\ta[j] = nextLong()+offset;\r\n\t \treturn a;\r\n\t\t}\r\n\t}\r\n\t\r\n\tpublic static class MyPrintWriter extends PrintWriter{\r\n\t\tpublic MyPrintWriter(OutputStream os) {\r\n\t\t\tsuper(os);\r\n\t\t}\r\n\t\t\r\n\t\tpublic void printlnAns(boolean ans) {\r\n\t\t\tif(ans)\r\n\t\t\t\tprintln(YES);\r\n\t\t\telse\r\n\t\t\t\tprintln(NO);\r\n\t\t}\r\n\t\t\r\n\t\tpublic void printAns(long[] arr){\r\n\t\t\tif(arr != null && arr.length > 0){\r\n\t\t\t\tprint(arr[0]);\r\n\t\t\t\tfor(int i=1; i<arr.length; i++){\r\n\t\t\t\t\tprint(\" \");\r\n\t\t\t\t\tprint(arr[i]);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tpublic void printlnAns(long[] arr){\r\n\t\t\tprintAns(arr);\r\n\t\t\tprintln();\r\n\t\t}\r\n\r\n\t\tpublic void printAns(int[] arr){\r\n\t\t\tif(arr != null && arr.length > 0){\r\n\t\t\t\tprint(arr[0]);\r\n\t\t\t\tfor(int i=1; i<arr.length; i++){\r\n\t\t\t\t\tprint(\" \");\r\n\t\t\t\t\tprint(arr[i]);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tpublic void printlnAns(int[] arr){\r\n\t\t\tprintAns(arr);\r\n\t\t\tprintln();\r\n\t\t}\r\n\t\t\r\n\t\tpublic <T> void printAns(ArrayList<T> arr){\r\n\t\t\tif(arr != null && arr.size() > 0){\r\n\t\t\t\tprint(arr.get(0));\r\n\t\t\t\tfor(int i=1; i<arr.size(); i++){\r\n\t\t\t\t\tprint(\" \");\r\n\t\t\t\t\tprint(arr.get(i));\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tpublic <T> void printlnAns(ArrayList<T> arr){\r\n\t\t\tprintAns(arr);\r\n\t\t\tprintln();\r\n\t\t}\r\n\t\t\r\n\t\tpublic void printAns(int[] arr, int add){\r\n\t\t\tif(arr != null && arr.length > 0){\r\n\t\t\t\tprint(arr[0]+add);\r\n\t\t\t\tfor(int i=1; i<arr.length; i++){\r\n\t\t\t\t\tprint(\" \");\r\n\t\t\t\t\tprint(arr[i]+add);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tpublic void printlnAns(int[] arr, int add){\r\n\t\t\tprintAns(arr, add);\r\n\t\t\tprintln();\r\n\t\t}\r\n\t\t\r\n\t\tpublic void printAns(ArrayList<Integer> arr, int add) {\r\n\t\t\tif(arr != null && arr.size() > 0){\r\n\t\t\t\tprint(arr.get(0)+add);\r\n\t\t\t\tfor(int i=1; i<arr.size(); i++){\r\n\t\t\t\t\tprint(\" \");\r\n\t\t\t\t\tprint(arr.get(i)+add);\r\n\t\t\t\t}\r\n\t\t\t}\t\t\t\r\n\t\t}\r\n\t\t\r\n\t\tpublic void printlnAns(ArrayList<Integer> arr, int add){\r\n\t\t\tprintAns(arr, add);\r\n\t\t\tprintln();\r\n\t\t}\r\n\t\t\r\n\t\tpublic void printlnAnsSplit(long[] arr, int split){\r\n\t\t\tif(arr != null){\r\n\t\t\t\tfor(int i=0; i<arr.length; i+=split){\r\n\t\t\t\t\tprint(arr[i]);\r\n\t\t\t\t\tfor(int j=i+1; j<i+split; j++){\r\n\t\t\t\t\t\tprint(\" \");\r\n\t\t\t\t\t\tprint(arr[j]);\r\n\t\t\t\t\t}\r\n\t\t\t\t\tprintln();\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t\tpublic void printlnAnsSplit(int[] arr, int split){\r\n\t\t\tif(arr != null){\r\n\t\t\t\tfor(int i=0; i<arr.length; i+=split){\r\n\t\t\t\t\tprint(arr[i]);\r\n\t\t\t\t\tfor(int j=i+1; j<i+split; j++){\r\n\t\t\t\t\t\tprint(\" \");\r\n\t\t\t\t\t\tprint(arr[j]);\r\n\t\t\t\t\t}\r\n\t\t\t\t\tprintln();\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t\tpublic <T> void printlnAnsSplit(ArrayList<T> arr, int split){\r\n\t\t\tif(arr != null && !arr.isEmpty()){\r\n\t\t\t\tfor(int i=0; i<arr.size(); i+=split){\r\n\t\t\t\t\tprint(arr.get(i));\r\n\t\t\t\t\tfor(int j=i+1; j<i+split; j++){\r\n\t\t\t\t\t\tprint(\" \");\r\n\t\t\t\t\t\tprint(arr.get(j));\r\n\t\t\t\t\t}\r\n\t\t\t\t\tprintln();\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\r\n\tstatic private void permutateAndSort(int[] a) {\r\n\t\tint n = a.length;\r\n\t\tRandom R = new Random(System.currentTimeMillis());\r\n\t\tfor(int i=0; i<n; i++) {\r\n\t\t\tint t = R.nextInt(n-i);\r\n\t\t\tint temp = a[n-1-i];\r\n\t\t\ta[n-1-i] = a[t];\r\n\t\t\ta[t] = temp;\r\n\t\t}\r\n\t\tArrays.sort(a);\r\n\t}\r\n\t\r\n\tstatic private int[][] constructChildren(int n, int[] parent, int parentRoot){\r\n\t\tint[][] childrens = new int[n][];\r\n\t\t\r\n\t\tint[] numChildren = new int[n];\r\n\t\tfor(int i=0; i<parent.length; i++) {\r\n\t\t\tif(parent[i] != parentRoot)\r\n\t\t\t\tnumChildren[parent[i]]++;\r\n\t\t}\r\n\t\t\r\n\t\tfor(int i=0; i<n; i++) {\r\n\t\t\tchildrens[i] = new int[numChildren[i]];\r\n\t\t}\r\n\t\t\r\n\r\n\t\tint[] idx = new int[n];\r\n\t\tfor(int i=0; i<parent.length; i++) {\r\n\t\t\tif(parent[i] != parentRoot)\r\n\t\t\t\tchildrens[parent[i]][idx[parent[i]]++] = i;\r\n\t\t}\r\n\r\n\t\treturn childrens;\r\n\t}\r\n\t\r\n\tstatic private int[][][] constructDirectedNeighborhood(int n, int[][] e){\r\n\t\tint[] inDegree = new int[n];\r\n\t\tint[] outDegree = new int[n];\r\n\t\tfor(int i=0; i<e.length; i++) {\r\n\t\t\tint u = e[i][0];\r\n\t\t\tint v = e[i][1];\r\n\t\t\toutDegree[u]++;\r\n\t\t\tinDegree[v]++;\r\n\t\t}\r\n\t\t\r\n\t\tint[][] inNeighbors = new int[n][];\r\n\t\tint[][] outNeighbors = new int[n][];\r\n\t\tfor(int i=0; i<n; i++) {\r\n\t\t\tinNeighbors[i] = new int[inDegree[i]];\r\n\t\t\toutNeighbors[i] = new int[outDegree[i]];\r\n\t\t}\r\n\t\t\r\n\t\tint[] inIdx = new int[n];\r\n\t\tint[] outIdx = new int[n];\r\n\t\tfor(int i=0; i<e.length; i++) {\r\n\t\t\tint u = e[i][0];\r\n\t\t\tint v = e[i][1];\r\n\t\t\toutNeighbors[u][outIdx[u]++] = v;\r\n\t\t\tinNeighbors[v][inIdx[v]++] = u;\r\n\t\t}\r\n\t\t\r\n\t\treturn new int[][][] {inNeighbors, outNeighbors};\r\n\t}\r\n\t\r\n\tstatic private int[][] constructNeighborhood(int n, int[][] e) {\r\n\t\tint[] degree = new int[n];\r\n\t\tfor(int i=0; i<e.length; i++) {\r\n\t\t\tint u = e[i][0];\r\n\t\t\tint v = e[i][1];\r\n\t\t\tdegree[u]++;\r\n\t\t\tdegree[v]++;\r\n\t\t}\r\n\t\t\r\n\t\tint[][] neighbors = new int[n][];\r\n\t\tfor(int i=0; i<n; i++)\r\n\t\t\tneighbors[i] = new int[degree[i]];\r\n\t\t\r\n\t\tint[] idx = new int[n];\r\n\t\tfor(int i=0; i<e.length; i++) {\r\n\t\t\tint u = e[i][0];\r\n\t\t\tint v = e[i][1];\r\n\t\t\tneighbors[u][idx[u]++] = v;\r\n\t\t\tneighbors[v][idx[v]++] = u;\r\n\t\t}\r\n\t\t\r\n\t\treturn neighbors;\r\n\t}\r\n\t\r\n\tstatic private void makeDotUndirected(int[][] e) {\r\n\t\tMyPrintWriter out2 = null;\r\n\t\t try {\r\n\t\t\tout2 = new MyPrintWriter(new FileOutputStream(\"graph.dot\"));\r\n\t\t} catch (FileNotFoundException e1) {\r\n\t\t\t// TODO Auto-generated catch block\r\n\t\t\te1.printStackTrace();\r\n\t\t}\r\n\t\tout2.println(\"strict graph {\");\r\n\t\tfor(int i=0; i<e.length; i++){\r\n\t\t\tout2.println(e[i][0] + \"--\" + e[i][1] + \";\");\r\n\t\t}\r\n\t\tout2.println(\"}\");\r\n\t\tout2.close();\r\n\t}\r\n\t\r\n\tstatic private void makeDotDirected(int[][] e) {\r\n\t\tMyPrintWriter out2 = null;\r\n\t\t try {\r\n\t\t\tout2 = new MyPrintWriter(new FileOutputStream(\"graph.dot\"));\r\n\t\t} catch (FileNotFoundException e1) {\r\n\t\t\t// TODO Auto-generated catch block\r\n\t\t\te1.printStackTrace();\r\n\t\t}\r\n\t\tout2.println(\"strict digraph {\");\r\n\t\tfor(int i=0; i<e.length; i++){\r\n\t\t\tout2.println(e[i][0] + \"->\" + e[i][1] + \";\");\r\n\t\t}\r\n\t\tout2.println(\"}\");\r\n\t\tout2.close();\r\n\t}\r\n\t\r\n}\r\n", "lang_cluster": "Java", "tags": ["math", "dp", "bitmasks"], "code_uid": "e3f43749d7d2ad0b0993fd52daca24fb", "src_uid": "60955fc2caa6ec99c7dcc1da5d36b1f8", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package round791;\r\nimport java.io.*;\r\nimport java.util.ArrayDeque;\r\nimport java.util.Arrays;\r\nimport java.util.InputMismatchException;\r\nimport java.util.Queue;\r\n\r\npublic class F2 {\r\n\tInputStream is;\r\n\tFastWriter out;\r\n\tString INPUT = \"\";\r\n\t\r\n\tvoid solve()\r\n\t{\r\n\t\tint n = ni();\r\n\t\tboolean[][] g = new boolean[10][10];\r\n\t\tfor(int m = ni();m > 0;m--){\r\n\t\t\tint x = ni(), y = ni();\r\n\t\t\tg[x][y] = g[y][x] = true;\r\n\t\t}\r\n\t\tfor(int i = 0;i < 10;i++)g[i][i] = true;\r\n\r\n\t\tint[][] njs = new int[1<<9][10];\r\n\t\tfor(int j = 0;j < 1<<9;j++) {\r\n\t\t\tfor (int k = 0; k < 10; k++) {\r\n\t\t\t\tif (j << ~k >= 0) {\r\n\t\t\t\t\tint nj = j;\r\n\t\t\t\t\tfor (int l = 0; l < 10; l++) {\r\n\t\t\t\t\t\tif (g[k][l]) {\r\n\t\t\t\t\t\t\tif (k > l) {\r\n\t\t\t\t\t\t\t\tnj |= 1 << l;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\tnj &= ~(1 << l);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\tnjs[j][k] = nj;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\r\n\t\tlong[] dp = new long[1<<9];\r\n\t\tdp[0] = 1;\r\n\t\tfor(int i = 1;i <= n;i++){\r\n\t\t\tlong[] ndp = new long[1<<9];\r\n\t\t\tfor(int j = 0;j < 1<<9;j++){\r\n\t\t\t\tfor(int k = 0;k < 10;k++){\r\n\t\t\t\t\tif (j << ~k >= 0) {\r\n\t\t\t\t\t\tint nj = njs[j][k];\r\n\t\t\t\t\t\tndp[nj] += dp[j];\r\n\t\t\t\t\t\tif(ndp[nj] >= mod)ndp[nj] -= mod;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tdp = ndp;\r\n\t\t}\r\n\t\tlong ans = sum(dp) % mod;\r\n\t\tout.println(ans);\r\n\t}\r\n\r\n\tpublic static long sum(long... a){long ret = 0; for(long v : a)ret += v; return ret;}\r\n\r\n\r\n\tpublic static final int mod = 998244353;\r\n\tpublic static final int G = 3;\r\n\r\n\t// only 998244353\r\n\tpublic static long[] mul(long[] a, long[] b)\r\n\t{\r\n\t\tif(a.length == 0 && b.length == 0)return new long[0];\r\n\t\tif(a.length + b.length >= 300) {\r\n\t\t\treturn Arrays.copyOf(NTTStockham998244353.convolve(a, b), a.length + b.length - 1);\r\n\t\t}else{\r\n\t\t\treturn mulnaive(a, b);\r\n\t\t}\r\n\t}\r\n\r\n\tpublic static long[] mul(long[] a, long[] b, int lim)\r\n\t{\r\n\t\tif(a.length + b.length >= 300) {\r\n\t\t\treturn Arrays.copyOf(NTTStockham998244353.convolve(a, b), lim);\r\n\t\t}else{\r\n\t\t\treturn mulnaive(a, b, lim);\r\n\t\t}\r\n\t}\r\n\r\n\t//\tpublic static final int mod = 1000000007;\r\n\t//\tpublic static long[] mul(long[] a, long[] b)\r\n\t//\t{\r\n\t//\t\tif(Math.max(a.length, b.length) >= 3000){\r\n\t//\t\t\treturn Arrays.copyOf(NTTCRT.convolve(a, b, 3, mod), a.length+b.length-1);\r\n\t//\t\t}else{\r\n\t//\t\t\treturn mulnaive(a, b);\r\n\t//\t\t}\r\n\t//\t}\r\n\r\n\t//\tpublic static long[] mul(long[] a, long[] b, int lim)\r\n\t//\t{\r\n\t//\t\tif(Math.max(a.length, b.length) >= 3000){\r\n\t//\t\t\treturn Arrays.copyOf(NTTCRT.convolve(a, b, 3, mod), lim);\r\n\t//\t\t}else{\r\n\t//\t\t\treturn mulnaive(a, b, lim);\r\n\t//\t\t}\r\n\t//\t}\r\n\r\n\tpublic static final long big = (Long.MAX_VALUE/mod/mod-1)*mod*mod;\r\n\r\n\tpublic static long[] mulnaive(long[] a, long[] b)\r\n\t{\r\n\t\tlong[] c = new long[a.length+b.length-1];\r\n\t\tfor(int i = 0;i < a.length;i++){\r\n\t\t\tfor(int j = 0;j < b.length;j++){\r\n\t\t\t\tc[i+j] += a[i]*b[j];\r\n\t\t\t\tif(c[i+j] >= big)c[i+j] -= big;\r\n\t\t\t}\r\n\t\t}\r\n\t\tfor(int i = 0;i < c.length;i++)c[i] %= mod;\r\n\t\treturn c;\r\n\t}\r\n\r\n\tpublic static long[] mulnaive(long[] a, long[] b, int lim)\r\n\t{\r\n\t\tlong[] c = new long[lim];\r\n\t\tfor(int i = 0;i < a.length;i++){\r\n\t\t\tfor(int j = 0;j < b.length && i+j < lim;j++){\r\n\t\t\t\tc[i+j] += a[i]*b[j];\r\n\t\t\t\tif(c[i+j] >= big)c[i+j] -= big;\r\n\t\t\t}\r\n\t\t}\r\n\t\tfor(int i = 0;i < c.length;i++)c[i] %= mod;\r\n\t\treturn c;\r\n\t}\r\n\r\n\r\n\tpublic static class NTTStockham998244353 {\r\n\t\tprivate static final int P = 998244353, mod = P, G = 3;\r\n\t\tprivate static long[] wps;\r\n\r\n\t\tpublic static long[] convolve(long[] a, long[] b)\r\n\t\t{\r\n\t\t\tint m = Math.max(2, Integer.highestOneBit(Math.max(a.length, b.length)-1)<<2);\r\n\r\n\t\t\twps = new long[m];\r\n\t\t\tlong unit = pow(G, (P-1)/m);\r\n\t\t\twps[0] = 1;\r\n\t\t\tfor(int p = 1;p < m;p++) {\r\n\t\t\t\twps[p] = wps[p-1] * unit % mod;\r\n\t\t\t}\r\n\r\n\t\t\tlong[] fa = go(a, m, false);\r\n\t\t\tlong[] fb = a == b ? fa : go(b, m, false);\r\n\t\t\tfor(int i = 0;i < m;i++){\r\n\t\t\t\tfa[i] = fa[i]*fb[i] % mod;\r\n\t\t\t}\r\n\t\t\tfa = go(fa, m, true);\r\n\t\t\tfor(int i = 1, j = m-1;i < j;i++,j--) {\r\n\t\t\t\tlong d = fa[i]; fa[i] = fa[j]; fa[j] = d;\r\n\t\t\t}\r\n\t\t\treturn fa;\r\n\t\t}\r\n\r\n\t\tprivate static void fft(long[] X, long[] Y)\r\n\t\t{\r\n\t\t\tint s = 1;\r\n\t\t\tboolean eo = false;\r\n\t\t\tfor(int n = X.length;n >= 4;n /= 2) {\r\n\t\t\t\tint m = n/2;\r\n\t\t\t\tfor(int p = 0;p < m;p++) {\r\n\t\t\t\t\tlong wp = wps[s*p];\r\n\t\t\t\t\tlong wk = (wp<<32)/P;\r\n\t\t\t\t\tfor(int q = 0;q < s;q++) {\r\n\t\t\t\t\t\tlong a = X[q + s*(p+0)];\r\n\t\t\t\t\t\tlong b = X[q + s*(p+m)];\r\n\t\t\t\t\t\tlong ndsts = a + b;\r\n\t\t\t\t\t\tif(ndsts >= 2*P)ndsts -= 2*P;\r\n\t\t\t\t\t\tlong T = a - b + 2*P;\r\n\t\t\t\t\t\tlong Q = wk*T>>>32;\r\n\t\t\t\t\t\tY[q + s*(2*p+0)] = ndsts;\r\n\t\t\t\t\t\tY[q + s*(2*p+1)] = wp*T-Q*P&(1L<<32)-1;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\ts *= 2;\r\n\t\t\t\teo = !eo;\r\n\t\t\t\tlong[] D = X; X = Y; Y = D;\r\n\t\t\t}\r\n\t\t\tlong[] z = eo ? Y : X;\r\n\t\t\tfor(int q = 0;q < s;q++) {\r\n\t\t\t\tlong a = X[q + 0];\r\n\t\t\t\tlong b = X[q + s];\r\n\t\t\t\tz[q+0] = (a+b) % P;\r\n\t\t\t\tz[q+s] = (a-b+2*P) % P;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t//\tprivate static void fft(long[] X, long[] Y)\r\n\t\t//\t{\r\n\t\t//\t\tint s = 1;\r\n\t\t//\t\tboolean eo = false;\r\n\t\t//\t\tfor(int n = X.length;n >= 4;n /= 2) {\r\n\t\t//\t\t\tint m = n/2;\r\n\t\t//\t\t\tfor(int p = 0;p < m;p++) {\r\n\t\t//\t\t\t\tlong wp = wps[s*p];\r\n\t\t//\t\t\t\tfor(int q = 0;q < s;q++) {\r\n\t\t//\t\t\t\t\tlong a = X[q + s*(p+0)];\r\n\t\t//\t\t\t\t\tlong b = X[q + s*(p+m)];\r\n\t\t//\t\t\t\t\tY[q + s*(2*p+0)] = (a+b) % P;\r\n\t\t//\t\t\t\t\tY[q + s*(2*p+1)] = (a-b+P) * wp % P;\r\n\t\t//\t\t\t\t}\r\n\t\t//\t\t\t}\r\n\t\t//\t\t\ts *= 2;\r\n\t\t//\t\t\teo = !eo;\r\n\t\t//\t\t\tlong[] D = X; X = Y; Y = D;\r\n\t\t//\t\t}\r\n\t\t//\t\tlong[] z = eo ? Y : X;\r\n\t\t//\t\tfor(int q = 0;q < s;q++) {\r\n\t\t//\t\t\tlong a = X[q + 0];\r\n\t\t//\t\t\tlong b = X[q + s];\r\n\t\t//\t\t\tz[q+0] = (a+b) % P;\r\n\t\t//\t\t\tz[q+s] = (a-b+P) % P;\r\n\t\t//\t\t}\r\n\t\t//\t}\r\n\r\n\t\tprivate static long[] go(long[] src, int n, boolean inverse)\r\n\t\t{\r\n\t\t\tlong[] dst = Arrays.copyOf(src, n);\r\n\t\t\tfft(dst, new long[n]);\r\n\t\t\tif(inverse){\r\n\t\t\t\tlong in = invl(n);\r\n\t\t\t\tfor(int i = 0;i < n;i++){\r\n\t\t\t\t\tdst[i] = dst[i] * in % mod;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\treturn dst;\r\n\t\t}\r\n\r\n\t\tprivate static long pow(long a, long n) {\r\n\t\t\t//\t\ta %= mod;\r\n\t\t\tlong ret = 1;\r\n\t\t\tint x = 63 - Long.numberOfLeadingZeros(n);\r\n\t\t\tfor (; x >= 0; x--) {\r\n\t\t\t\tret = ret*ret % mod;\r\n\t\t\t\tif (n<<~x<0)ret = ret*a%mod;\r\n\t\t\t}\r\n\t\t\treturn ret;\r\n\t\t}\r\n\r\n\t\tprivate static long invl(long a) {\r\n\t\t\tlong b = mod;\r\n\t\t\tlong p = 1, q = 0;\r\n\t\t\twhile (b > 0) {\r\n\t\t\t\tlong c = a / b;\r\n\t\t\t\tlong d;\r\n\t\t\t\td = a;\r\n\t\t\t\ta = b;\r\n\t\t\t\tb = d % b;\r\n\t\t\t\td = p;\r\n\t\t\t\tp = q;\r\n\t\t\t\tq = d - c * q;\r\n\t\t\t}\r\n\t\t\treturn p < 0 ? p + mod : p;\r\n\t\t}\r\n\t}\r\n\r\n\r\n\tpublic static long C(int n, int r, int mod, int[][] fif) {\r\n\t\tif (n < 0 || r < 0 || r > n) return 0;\r\n\t\treturn (long) fif[0][n] * fif[1][r] % mod * fif[1][n - r] % mod;\r\n\t}\r\n\r\n\tpublic static int[][] enumFIF(int n, int mod) {\r\n\t\tint[] f = new int[n + 1];\r\n\t\tint[] invf = new int[n + 1];\r\n\t\tf[0] = 1;\r\n\t\tfor (int i = 1; i <= n; i++) {\r\n\t\t\tf[i] = (int) ((long) f[i - 1] * i % mod);\r\n\t\t}\r\n\t\tlong a = f[n];\r\n\t\tlong b = mod;\r\n\t\tlong p = 1, q = 0;\r\n\t\twhile (b > 0) {\r\n\t\t\tlong c = a / b;\r\n\t\t\tlong d;\r\n\t\t\td = a;\r\n\t\t\ta = b;\r\n\t\t\tb = d % b;\r\n\t\t\td = p;\r\n\t\t\tp = q;\r\n\t\t\tq = d - c * q;\r\n\t\t}\r\n\t\tinvf[n] = (int) (p < 0 ? p + mod : p);\r\n\t\tfor (int i = n - 1; i >= 0; i--) {\r\n\t\t\tinvf[i] = (int) ((long) invf[i + 1] * (i + 1) % mod);\r\n\t\t}\r\n\t\treturn new int[][]{f, invf};\r\n\t}\r\n\r\n\r\n\tpublic static class DJSet {\r\n\t\tpublic int[] upper;\r\n\r\n\t\tpublic DJSet(int n) {\r\n\t\t\tupper = new int[n];\r\n\t\t\tArrays.fill(upper, -1);\r\n\t\t}\r\n\r\n\t\tpublic int root(int x) {\r\n\t\t\treturn upper[x] < 0 ? x : (upper[x] = root(upper[x]));\r\n\t\t}\r\n\r\n\t\tpublic boolean equiv(int x, int y) {\r\n\t\t\treturn root(x) == root(y);\r\n\t\t}\r\n\r\n\t\tpublic boolean unite(int x, int y) {\r\n\t\t\tx = root(x);\r\n\t\t\ty = root(y);\r\n\t\t\tif (x != y) {\r\n\t\t\t\tif (upper[y] < upper[x]) {\r\n\t\t\t\t\tint d = x;\r\n\t\t\t\t\tx = y;\r\n\t\t\t\t\ty = d;\r\n\t\t\t\t}\r\n\t\t\t\tupper[x] += upper[y];\r\n\t\t\t\tupper[y] = x;\r\n\t\t\t}\r\n\t\t\treturn x == y;\r\n\t\t}\r\n\r\n\t\tpublic int count() {\r\n\t\t\tint ct = 0;\r\n\t\t\tfor (int u : upper) if (u < 0) ct++;\r\n\t\t\treturn ct;\r\n\t\t}\r\n\r\n\t\tpublic int[][] toBucket() {\r\n\t\t\tint n = upper.length;\r\n\t\t\tint[][] ret = new int[n][];\r\n\t\t\tint[] rp = new int[n];\r\n\t\t\tfor (int i = 0; i < n; i++) if (upper[i] < 0) ret[i] = new int[-upper[i]];\r\n\t\t\tfor (int i = 0; i < n; i++) {\r\n\t\t\t\tint r = root(i);\r\n\t\t\t\tret[r][rp[r]++] = i;\r\n\t\t\t}\r\n\t\t\treturn ret;\r\n\t\t}\r\n\t}\r\n\r\n\r\n\tvoid run() throws Exception\r\n\t{\r\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\r\n\t\tout = new FastWriter(System.out);\r\n\t\t\r\n\t\tlong s = System.currentTimeMillis();\r\n\t\tsolve();\r\n\t\tout.flush();\r\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\r\n\t}\r\n\t\r\n\tpublic static void main(String[] args) throws Exception { new F2().run(); }\r\n\t\r\n\tprivate byte[] inbuf = new byte[1024];\r\n\tpublic int lenbuf = 0, ptrbuf = 0;\r\n\t\r\n\tprivate int readByte()\r\n\t{\r\n\t\tif(lenbuf == -1)throw new InputMismatchException();\r\n\t\tif(ptrbuf >= lenbuf){\r\n\t\t\tptrbuf = 0;\r\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\r\n\t\t\tif(lenbuf <= 0)return -1;\r\n\t\t}\r\n\t\treturn inbuf[ptrbuf++];\r\n\t}\r\n\t\r\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\r\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\r\n\t\r\n\tprivate double nd() { return Double.parseDouble(ns()); }\r\n\tprivate char nc() { return (char)skip(); }\r\n\t\r\n\tprivate String ns()\r\n\t{\r\n\t\tint b = skip();\r\n\t\tStringBuilder sb = new StringBuilder();\r\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\r\n\t\t\tsb.appendCodePoint(b);\r\n\t\t\tb = readByte();\r\n\t\t}\r\n\t\treturn sb.toString();\r\n\t}\r\n\t\r\n\tprivate char[] ns(int n)\r\n\t{\r\n\t\tchar[] buf = new char[n];\r\n\t\tint b = skip(), p = 0;\r\n\t\twhile(p < n && !(isSpaceChar(b))){\r\n\t\t\tbuf[p++] = (char)b;\r\n\t\t\tb = readByte();\r\n\t\t}\r\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\r\n\t}\r\n\r\n\tprivate int[] na(int n)\r\n\t{\r\n\t\tint[] a = new int[n];\r\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\r\n\t\treturn a;\r\n\t}\r\n\r\n\tprivate long[] nal(int n)\r\n\t{\r\n\t\tlong[] a = new long[n];\r\n\t\tfor(int i = 0;i < n;i++)a[i] = nl();\r\n\t\treturn a;\r\n\t}\r\n\r\n\tprivate char[][] nm(int n, int m) {\r\n\t\tchar[][] map = new char[n][];\r\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\r\n\t\treturn map;\r\n\t}\r\n\r\n\tprivate int[][] nmi(int n, int m) {\r\n\t\tint[][] map = new int[n][];\r\n\t\tfor(int i = 0;i < n;i++)map[i] = na(m);\r\n\t\treturn map;\r\n\t}\r\n\r\n\tprivate int ni() { return (int)nl(); }\r\n\r\n\tprivate long nl()\r\n\t{\r\n\t\tlong num = 0;\r\n\t\tint b;\r\n\t\tboolean minus = false;\r\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\r\n\t\tif(b == '-'){\r\n\t\t\tminus = true;\r\n\t\t\tb = readByte();\r\n\t\t}\r\n\r\n\t\twhile(true){\r\n\t\t\tif(b >= '0' && b <= '9'){\r\n\t\t\t\tnum = num * 10 + (b - '0');\r\n\t\t\t}else{\r\n\t\t\t\treturn minus ? -num : num;\r\n\t\t\t}\r\n\t\t\tb = readByte();\r\n\t\t}\r\n\t}\r\n\r\n\tpublic static class FastWriter\r\n\t{\r\n\t\tprivate static final int BUF_SIZE = 1<<13;\r\n\t\tprivate final byte[] buf = new byte[BUF_SIZE];\r\n\t\tprivate final OutputStream out;\r\n\t\tprivate int ptr = 0;\r\n\r\n\t\tprivate FastWriter(){out = null;}\r\n\r\n\t\tpublic FastWriter(OutputStream os)\r\n\t\t{\r\n\t\t\tthis.out = os;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter(String path)\r\n\t\t{\r\n\t\t\ttry {\r\n\t\t\t\tthis.out = new FileOutputStream(path);\r\n\t\t\t} catch (FileNotFoundException e) {\r\n\t\t\t\tthrow new RuntimeException(\"FastWriter\");\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(byte b)\r\n\t\t{\r\n\t\t\tbuf[ptr++] = b;\r\n\t\t\tif(ptr == BUF_SIZE)innerflush();\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(char c)\r\n\t\t{\r\n\t\t\treturn write((byte)c);\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(char[] s)\r\n\t\t{\r\n\t\t\tfor(char c : s){\r\n\t\t\t\tbuf[ptr++] = (byte)c;\r\n\t\t\t\tif(ptr == BUF_SIZE)innerflush();\r\n\t\t\t}\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(String s)\r\n\t\t{\r\n\t\t\ts.chars().forEach(c -> {\r\n\t\t\t\tbuf[ptr++] = (byte)c;\r\n\t\t\t\tif(ptr == BUF_SIZE)innerflush();\r\n\t\t\t});\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tprivate static int countDigits(int l) {\r\n\t\t\tif (l >= 1000000000) return 10;\r\n\t\t\tif (l >= 100000000) return 9;\r\n\t\t\tif (l >= 10000000) return 8;\r\n\t\t\tif (l >= 1000000) return 7;\r\n\t\t\tif (l >= 100000) return 6;\r\n\t\t\tif (l >= 10000) return 5;\r\n\t\t\tif (l >= 1000) return 4;\r\n\t\t\tif (l >= 100) return 3;\r\n\t\t\tif (l >= 10) return 2;\r\n\t\t\treturn 1;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(int x)\r\n\t\t{\r\n\t\t\tif(x == Integer.MIN_VALUE){\r\n\t\t\t\treturn write((long)x);\r\n\t\t\t}\r\n\t\t\tif(ptr + 12 >= BUF_SIZE)innerflush();\r\n\t\t\tif(x < 0){\r\n\t\t\t\twrite((byte)'-');\r\n\t\t\t\tx = -x;\r\n\t\t\t}\r\n\t\t\tint d = countDigits(x);\r\n\t\t\tfor(int i = ptr + d - 1;i >= ptr;i--){\r\n\t\t\t\tbuf[i] = (byte)('0'+x%10);\r\n\t\t\t\tx /= 10;\r\n\t\t\t}\r\n\t\t\tptr += d;\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tprivate static int countDigits(long l) {\r\n\t\t\tif (l >= 1000000000000000000L) return 19;\r\n\t\t\tif (l >= 100000000000000000L) return 18;\r\n\t\t\tif (l >= 10000000000000000L) return 17;\r\n\t\t\tif (l >= 1000000000000000L) return 16;\r\n\t\t\tif (l >= 100000000000000L) return 15;\r\n\t\t\tif (l >= 10000000000000L) return 14;\r\n\t\t\tif (l >= 1000000000000L) return 13;\r\n\t\t\tif (l >= 100000000000L) return 12;\r\n\t\t\tif (l >= 10000000000L) return 11;\r\n\t\t\tif (l >= 1000000000L) return 10;\r\n\t\t\tif (l >= 100000000L) return 9;\r\n\t\t\tif (l >= 10000000L) return 8;\r\n\t\t\tif (l >= 1000000L) return 7;\r\n\t\t\tif (l >= 100000L) return 6;\r\n\t\t\tif (l >= 10000L) return 5;\r\n\t\t\tif (l >= 1000L) return 4;\r\n\t\t\tif (l >= 100L) return 3;\r\n\t\t\tif (l >= 10L) return 2;\r\n\t\t\treturn 1;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(long x)\r\n\t\t{\r\n\t\t\tif(x == Long.MIN_VALUE){\r\n\t\t\t\treturn write(\"\" + x);\r\n\t\t\t}\r\n\t\t\tif(ptr + 21 >= BUF_SIZE)innerflush();\r\n\t\t\tif(x < 0){\r\n\t\t\t\twrite((byte)'-');\r\n\t\t\t\tx = -x;\r\n\t\t\t}\r\n\t\t\tint d = countDigits(x);\r\n\t\t\tfor(int i = ptr + d - 1;i >= ptr;i--){\r\n\t\t\t\tbuf[i] = (byte)('0'+x%10);\r\n\t\t\t\tx /= 10;\r\n\t\t\t}\r\n\t\t\tptr += d;\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(double x, int precision)\r\n\t\t{\r\n\t\t\tif(x < 0){\r\n\t\t\t\twrite('-');\r\n\t\t\t\tx = -x;\r\n\t\t\t}\r\n\t\t\tx += Math.pow(10, -precision)/2;\r\n\t\t\t//\t\tif(x < 0){ x = 0; }\r\n\t\t\twrite((long)x).write(\".\");\r\n\t\t\tx -= (long)x;\r\n\t\t\tfor(int i = 0;i < precision;i++){\r\n\t\t\t\tx *= 10;\r\n\t\t\t\twrite((char)('0'+(int)x));\r\n\t\t\t\tx -= (int)x;\r\n\t\t\t}\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(char c){\r\n\t\t\treturn write(c).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(int x){\r\n\t\t\treturn write(x).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(long x){\r\n\t\t\treturn write(x).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(double x, int precision){\r\n\t\t\treturn write(x, precision).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(int... xs)\r\n\t\t{\r\n\t\t\tboolean first = true;\r\n\t\t\tfor(int x : xs) {\r\n\t\t\t\tif (!first) write(' ');\r\n\t\t\t\tfirst = false;\r\n\t\t\t\twrite(x);\r\n\t\t\t}\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(long... xs)\r\n\t\t{\r\n\t\t\tboolean first = true;\r\n\t\t\tfor(long x : xs) {\r\n\t\t\t\tif (!first) write(' ');\r\n\t\t\t\tfirst = false;\r\n\t\t\t\twrite(x);\r\n\t\t\t}\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln()\r\n\t\t{\r\n\t\t\treturn write((byte)'\\n');\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(int... xs)\r\n\t\t{\r\n\t\t\treturn write(xs).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(long... xs)\r\n\t\t{\r\n\t\t\treturn write(xs).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(char[] line)\r\n\t\t{\r\n\t\t\treturn write(line).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(char[]... map)\r\n\t\t{\r\n\t\t\tfor(char[] line : map)write(line).writeln();\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(String s)\r\n\t\t{\r\n\t\t\treturn write(s).writeln();\r\n\t\t}\r\n\r\n\t\tprivate void innerflush()\r\n\t\t{\r\n\t\t\ttry {\r\n\t\t\t\tout.write(buf, 0, ptr);\r\n\t\t\t\tptr = 0;\r\n\t\t\t} catch (IOException e) {\r\n\t\t\t\tthrow new RuntimeException(\"innerflush\");\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tpublic void flush()\r\n\t\t{\r\n\t\t\tinnerflush();\r\n\t\t\ttry {\r\n\t\t\t\tout.flush();\r\n\t\t\t} catch (IOException e) {\r\n\t\t\t\tthrow new RuntimeException(\"flush\");\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tpublic FastWriter print(byte b) { return write(b); }\r\n\t\tpublic FastWriter print(char c) { return write(c); }\r\n\t\tpublic FastWriter print(char[] s) { return write(s); }\r\n\t\tpublic FastWriter print(String s) { return write(s); }\r\n\t\tpublic FastWriter print(int x) { return write(x); }\r\n\t\tpublic FastWriter print(long x) { return write(x); }\r\n\t\tpublic FastWriter print(double x, int precision) { return write(x, precision); }\r\n\t\tpublic FastWriter println(char c){ return writeln(c); }\r\n\t\tpublic FastWriter println(int x){ return writeln(x); }\r\n\t\tpublic FastWriter println(long x){ return writeln(x); }\r\n\t\tpublic FastWriter println(double x, int precision){ return writeln(x, precision); }\r\n\t\tpublic FastWriter print(int... xs) { return write(xs); }\r\n\t\tpublic FastWriter print(long... xs) { return write(xs); }\r\n\t\tpublic FastWriter println(int... xs) { return writeln(xs); }\r\n\t\tpublic FastWriter println(long... xs) { return writeln(xs); }\r\n\t\tpublic FastWriter println(char[] line) { return writeln(line); }\r\n\t\tpublic FastWriter println(char[]... map) { return writeln(map); }\r\n\t\tpublic FastWriter println(String s) { return writeln(s); }\r\n\t\tpublic FastWriter println() { return writeln(); }\r\n\t}\r\n\r\n\tpublic void trnz(int... o)\r\n\t{\r\n\t\tfor(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+\":\"+o[i]+\" \");\r\n\t\tSystem.out.println();\r\n\t}\r\n\r\n\t// print ids which are 1\r\n\tpublic void trt(long... o)\r\n\t{\r\n\t\tQueue<Integer> stands = new ArrayDeque<>();\r\n\t\tfor(int i = 0;i < o.length;i++){\r\n\t\t\tfor(long x = o[i];x != 0;x &= x-1)stands.add(i<<6|Long.numberOfTrailingZeros(x));\r\n\t\t}\r\n\t\tSystem.out.println(stands);\r\n\t}\r\n\r\n\tpublic void tf(boolean... r)\r\n\t{\r\n\t\tfor(boolean x : r)System.out.print(x?'#':'.');\r\n\t\tSystem.out.println();\r\n\t}\r\n\r\n\tpublic void tf(boolean[]... b)\r\n\t{\r\n\t\tfor(boolean[] r : b) {\r\n\t\t\tfor(boolean x : r)System.out.print(x?'#':'.');\r\n\t\t\tSystem.out.println();\r\n\t\t}\r\n\t\tSystem.out.println();\r\n\t}\r\n\r\n\tpublic void tf(long[]... b)\r\n\t{\r\n\t\tif(INPUT.length() != 0) {\r\n\t\t\tfor (long[] r : b) {\r\n\t\t\t\tfor (long x : r) {\r\n\t\t\t\t\tfor (int i = 0; i < 64; i++) {\r\n\t\t\t\t\t\tSystem.out.print(x << ~i < 0 ? '#' : '.');\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\tSystem.out.println();\r\n\t\t\t}\r\n\t\t\tSystem.out.println();\r\n\t\t}\r\n\t}\r\n\r\n\tpublic void tf(long... b)\r\n\t{\r\n\t\tif(INPUT.length() != 0) {\r\n\t\t\tfor (long x : b) {\r\n\t\t\t\tfor (int i = 0; i < 64; i++) {\r\n\t\t\t\t\tSystem.out.print(x << ~i < 0 ? '#' : '.');\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tSystem.out.println();\r\n\t\t}\r\n\t}\r\n\r\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\r\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\r\n}", "lang_cluster": "Java", "tags": ["math", "dp", "bitmasks"], "code_uid": "e5c4b22ecba4d1d15876f9de708afaa8", "src_uid": "60955fc2caa6ec99c7dcc1da5d36b1f8", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Scanner;\n\n\npublic class E {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint m = sc.nextInt();\n\t\tint k = sc.nextInt();\n\t\tint[][]a = new int[n][n];\n\t\tint[][]dp = new int[1 << n][1 << n];\n\t\tfor (int i = 1; i <= m; i++) {\n\t\t\tint v1 = sc.nextInt();\n\t\t\tint v2 = sc.nextInt();\n\t\t\tv1--;\n\t\t\tv2--;\n\t\t\ta[v1][v2] = a[v2][v1] = 1;\n\t\t\tdp[(1 << v1) | (1 << v2)][(1 << v1) | (1 << v2)] = 1;\n\t\t}\n\t\tfor (int mask = 0; mask < (1 << n); mask++) {\n\t\t\tfor (int subm = mask; subm != 0; subm = ((subm-1) & mask)) {\n\t\t\t\tif (dp[mask][subm]==0)\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\t\tif ((mask & (1 << i)) != 0) {\n\t\t\t\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\t\t\t\tif ((mask & (1 << j))==0 && a[i][j]==1) {\n\t\t\t\t\t\t\t\tint new_subm = (subm | (1 << j));\n\t\t\t\t\t\t\t\tif ((subm & (1 << i)) != 0)\n\t\t\t\t\t\t\t\t\tnew_subm ^= (1 << i);\n\t\t\t\t\t\t\t\tint q = (1 << n)-(1 << (j+1));\n\t\t\t\t\t\t\t\tif ((new_subm & q) != 0)\n\t\t\t\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t\t\tdp[mask | (1 << j)][new_subm] += dp[mask][subm];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint ans = 0;\n\t\tfor (int mask = 0; mask < (1 << n); mask++) {\n\t\t\tif (Integer.bitCount(mask)==k)\n\t\t\t\tans += dp[(1 << n)-1][mask];\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["dp", "bitmasks"], "code_uid": "a8f8a2237d1ae0834a60a7dc83485af2", "src_uid": "8087605a8f316150372cc4627f26231d", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\n\npublic class E {\n\tpublic static void main(String[] args) {\n\t\tScanner s = new Scanner(System.in);\n\t\tint n = s.nextInt(), m = s.nextInt(), k = s.nextInt();\n\t\tint[][] a = new int[m][];\n\t\tint[][] count = new int[1 << n][1 << n];\n\t\tfor (int i = 0; i < m; ++i) {\n\t\t\tint u = s.nextInt() - 1, v = s.nextInt() - 1;\n\t\t\ta[i] = new int[] { u, v };\n\t\t\tcount[bit(u) | bit(v)][bit(u) | bit(v)] = 1;\n\t\t}\n\t\tint result = 0;\n\t\tfor (int used = 0; used < bit(n); ++used) {\n\t\t\tfor (int deadends = 0; deadends < bit(n); ++deadends) {\n\t\t\t\tint c = Integer.bitCount(deadends);\n\t\t\t\tif (c > 1 && count[used][deadends] > 1) {\n\t\t\t\t\tcount[used][deadends] /= c;\n\t\t\t\t}\n\t\t\t\tif (used == bit(n) - 1 && c == k) {\n\t\t\t\t\tresult += count[used][deadends];\n\t\t\t\t}\n\t\t\t\tfor (int i = 0; i < m; ++i) {\n\t\t\t\t\tint u = a[i][0], v = a[i][1];\n\t\t\t\t\tint ut = used, dt = deadends;\n\t\t\t\t\tif (isUsed(u, used) ^ isUsed(v, used)) {\n\t\t\t\t\t\tif (isUsed(u, used)) {\n\t\t\t\t\t\t\tut = add(v, ut);\n\t\t\t\t\t\t\tif (isUsed(u, dt)) {\n\t\t\t\t\t\t\t\tdt = remove(u, dt);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdt = add(v, dt);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tut = add(u, ut);\n\t\t\t\t\t\t\tif (isUsed(v, dt)) {\n\t\t\t\t\t\t\t\tdt = remove(v, dt);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdt = add(u, dt);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcount[ut][dt] += count[used][deadends];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(result);\n\t}\n\n\tprivate static int remove(int v, int dt) {\n\t\treturn dt ^ bit(v);\n\t}\n\n\tprivate static int add(int u, int dt) {\n\t\treturn dt | bit(u);\n\t}\n\n\tprivate static boolean isUsed(int u, int dt) {\n\t\treturn (dt & bit(u)) > 0;\n\t}\n\n\tprivate static int bit(int v) {\n\t\treturn 1 << v;\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["dp", "bitmasks"], "code_uid": "038cc0d51d038e9a0db264ab33305cc1", "src_uid": "8087605a8f316150372cc4627f26231d", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\n\npublic class cfD implements Runnable {\n\tprivate final boolean useStandardIO = true;\n\tprivate final String inFile = \"segments.in\";\n\tprivate final String outFile = \"segments.out\";\n\n\tint n, m, k;\n\tint[][] c, aa;\n\n\tint dp[][][];\n\tboolean[][][] was;\n\n\tint go(int m1, int m2, int need) {\n\t\tif (was[need][m1][m2])\n\t\t\treturn dp[need][m1][m2];\n\t\tint res = 0;\n\t\tint have = Integer.bitCount(m1);\n\t\tint cur = Integer.bitCount(m2);\n\t\tif (m2 == 0) {\n\t\t\tif (have == need)\n\t\t\t\tres = 1;\n\t\t} else {\n\t\t\tint[] a1 = new int[have], a2 = new int[cur];\n\t\t\tint j = 0;\n\t\t\tfor (int i = 0; i < n; ++i)\n\t\t\t\tif ((m1 & (1 << i)) != 0)\n\t\t\t\t\ta1[j++] = i;\n\t\t\tj = 0;\n\t\t\tfor (int i = 0; i < n; ++i)\n\t\t\t\tif ((m2 & (1 << i)) != 0)\n\t\t\t\t\ta2[j++] = i;\n\t\t\tint tot = 1;\n\t\t\tfor (int i = 0; i < cur; ++i)\n\t\t\t\ttot *= (have + 1);\n\t\t\tfor (int mask = 1; mask < tot; ++mask) {\n\t\t\t\tint x = mask;\n\t\t\t\tint taken = 0, takenMask = 0, newLeaves = 0, newMask = 0;\n\t\t\t\tboolean ok = true;\n\t\t\t\tfor (j = 0; j < cur; ++j) {\n\t\t\t\t\tint y = x % (have + 1);\n\t\t\t\t\tx /= (have + 1);\n\t\t\t\t\tif (y == 0)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t--y;\n\t\t\t\t\tif (c[a1[y]][a2[j]] == 0) {\n\t\t\t\t\t\tok = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tif ((takenMask & (1 << y)) == 0) {\n\t\t\t\t\t\t++taken;\n\t\t\t\t\t\ttakenMask |= (1 << y);\n\t\t\t\t\t}\n\t\t\t\t\t++newLeaves;\n\t\t\t\t\tnewMask |= (1 << a2[j]);\n\t\t\t\t}\n\t\t\t\tif (!ok || newMask == 0)\n\t\t\t\t\tcontinue;\n\t\t\t\tint old = have - taken;\n\t\t\t\tif (m1 == 1 && newLeaves < 2)\n\t\t\t\t\t++old;\n\t\t\t\tif (need - old >= 0)\n\t\t\t\t\tres += go(newMask, m2 ^ newMask, need - old);\n\t\t\t}\n\t\t}\n\n\t\twas[need][m1][m2] = true;\n\t\treturn dp[need][m1][m2] = res;\n\t}\n\n\tprivate void solve() throws IOException {\n\t\tn = nextInt();\n\t\tm = nextInt();\n\t\tk = nextInt();\n\t\tc = new int[n][n];\n\t\tfor (int i = 0; i < m; ++i) {\n\t\t\tint x = nextInt() - 1, y = nextInt() - 1;\n\t\t\tc[x][y] = c[y][x] = 1;\n\t\t}\n\n\t\tdp = new int[k + 1][1 << n][1 << n];\n\t\twas = new boolean[k + 1][1 << n][1 << n];\n\t\twriter.print(go(1, (1 << n) - 2, k));\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew cfD().run();\n\t}\n\n\tBufferedReader reader;\n\tStringTokenizer tokenizer;\n\tPrintWriter writer;\n\n\tpublic void run() {\n\t\ttry {\n\t\t\tLocale.setDefault(Locale.US);\n\t\t\tif (useStandardIO)\n\t\t\t\treader = new BufferedReader(new InputStreamReader(System.in));\n\t\t\telse\n\t\t\t\treader = new BufferedReader(new FileReader(inFile));\n\t\t\ttokenizer = null;\n\t\t\tif (useStandardIO)\n\t\t\t\twriter = new PrintWriter(System.out);\n\t\t\telse\n\t\t\t\twriter = new PrintWriter(new FileWriter(outFile));\n\t\t\tsolve();\n\t\t\treader.close();\n\t\t\twriter.close();\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(1);\n\t\t}\n\t}\n\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n\n\tBigInteger nextBigInteger() throws IOException {\n\t\treturn new BigInteger(nextToken());\n\t}\n\n\tString nextToken() throws IOException {\n\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t}\n\t\treturn tokenizer.nextToken();\n\t}\n}", "lang_cluster": "Java", "tags": ["dp", "bitmasks"], "code_uid": "35d207522daca256c660378c6a5998ad", "src_uid": "8087605a8f316150372cc4627f26231d", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.lang.reflect.Array;\nimport java.util.ArrayList;\nimport java.util.Arrays;\n\n/**\n * Created by IntelliJ IDEA.\n * User: piyushd\n * Date: 1/7/11\n * Time: 12:04 AM\n * To change this template use File | Settings | File Templates.\n */\npublic class DeadEnds {\n\n\tint N, M, K;\n\tint[][] graph;\n\tlong[][] res;\n\n\tlong solve(int mask, int leaf, int n, int k){\n\t\tif(k < 2) return 0;\n\t\tif(res[mask][leaf] != -1) return res[mask][leaf];\n\n\t\tif(n == 2){\n\n\t\t\tint x = -1, y = -1;\n\t\t\tfor(int i = 0; i < N; i++) if((mask & (1<<i)) > 0){\n\t\t\t\tif(x == -1) x = i; else y = i;\n\t\t\t}\n\n\t\t\treturn res[mask][leaf] = graph[x][y];\n\t\t}\n\n\t\tlong ans = 0;\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tif((leaf & (1<<i)) > 0){\n\t\t\t\tfor(int j = 0; j < N; j++){\n\t\t\t\t\tif((mask & (1<<j)) > 0 && (leaf & (1<<j)) == 0 && graph[i][j] == 1){\n\t\t\t\t\t\tans += solve(mask - (1<<i), leaf - (1<<i), n - 1, k - 1);\n\t\t\t\t\t\tans += solve(mask - (1<<i), leaf - (1<<i) + (1<<j), n - 1, k);\n\t\t\t\t \t}\n\t\t\t \t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\treturn res[mask][leaf] = ans;\n\t}\n\n void run(){\n\t\tN = nextInt(); M = nextInt(); K = nextInt();\n\t\tgraph = new int[N][N];\n\n\t\tint x, y;\n\t\tfor(int i = 0; i < M; i++){\n\t\t\tx = nextInt() - 1; y = nextInt() - 1;\n\t\t\tgraph[x][y] = graph[y][x] = 1;\n\t\t}\n\n\t\tint[] bitCount = new int[1<<N];\n\t\tfor(int i = 0; i < bitCount.length; i++){\n\t\t\tbitCount[i] = bitCount[i>>1];\n\t\t\tif(i % 2 == 1) bitCount[i]++;\n\t\t}\n\n\t\tlong ret = 0;\n\t\tres = new long[1<<N][1<<N];\n\t\tfor(long[] f : res) Arrays.fill(f, -1);\n\t\tfor(int i = 0; i < (1<<N); i++){\n\t\t\tif(bitCount[i] == K){\n\t\t\t\tret += solve((1<<N) - 1, i, N, K);\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(ret);\n }\n\n int nextInt(){\n try{\n int c = System.in.read();\n if(c == -1) return c;\n while(c != '-' && (c < '0' || '9' < c)){\n c = System.in.read();\n if(c == -1) return c;\n }\n if(c == '-') return -nextInt();\n int res = 0;\n do{\n res *= 10;\n res += c - '0';\n c = System.in.read();\n }while('0' <= c && c <= '9');\n return res;\n }catch(Exception e){\n return -1;\n }\n }\n\n long nextLong(){\n try{\n int c = System.in.read();\n if(c == -1) return -1;\n while(c != '-' && (c < '0' || '9' < c)){\n c = System.in.read();\n if(c == -1) return -1;\n }\n if(c == '-') return -nextLong();\n long res = 0;\n do{\n res *= 10;\n res += c-'0';\n c = System.in.read();\n }while('0' <= c && c <= '9');\n return res;\n }catch(Exception e){\n return -1;\n }\n }\n\n double nextDouble(){\n return Double.parseDouble(next());\n }\n\n String next(){\n try{\n StringBuilder res = new StringBuilder(\"\");\n int c = System.in.read();\n while(Character.isWhitespace(c))\n c = System.in.read();\n do{\n res.append((char)c);\n }while(!Character.isWhitespace(c=System.in.read()));\n return res.toString();\n }catch(Exception e){\n return null;\n }\n }\n\n String nextLine(){\n try{\n StringBuilder res = new StringBuilder(\"\");\n int c = System.in.read();\n while(c == '\\r' || c == '\\n')\n c = System.in.read();\n do{\n res.append((char)c);\n c = System.in.read();\n }while(c != '\\r' && c != '\\n');\n return res.toString();\n }catch(Exception e){\n return null;\n }\n }\n\n public static void main(String[] args){\n new DeadEnds().run();\n }\n}\n", "lang_cluster": "Java", "tags": ["dp", "bitmasks"], "code_uid": "7e8ce127c32614dd7c3aa5d91bd4ac7e", "src_uid": "8087605a8f316150372cc4627f26231d", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "/**\n * Created by IntelliJ IDEA.\n * User: Taras_Brzezinsky\n * Date: 9/13/11\n * Time: 5:34 PM\n * To change this template use File | Settings | File Templates.\n */\n\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.io.IOException;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\npublic class TaskE extends Thread {\n public TaskE() {\n this.input = new BufferedReader(new InputStreamReader(System.in));\n this.output = new PrintWriter(System.out);\n this.setPriority(Thread.MAX_PRIORITY);\n }\n\n\n static final long doit(int mask, int dead, int n) {\n if ((mask & dead) == 0) {\n cache[mask][dead] = 0;\n return 0;\n }\n if (cache[mask][dead] != -1) {\n return cache[mask][dead];\n }\n long result = 0;\n for (int a = 0; a < n; ++a) {\n if (((mask & (1 << a)) != 0) && ((dead & (1 << a)) != 0)) {\n for (int b = 0; b < n; ++b) {\n if (g[a][b] && (mask & (1 << b)) != 0) {\n if (mask == ((1 << a) | (1 << b))) {\n cache[mask][dead] = ((dead & mask) == mask) ? 1 : 0;\n return cache[mask][dead];\n }\n if ((dead & (1 << b)) == 0) {\n result += doit(mask ^ (1 << a), dead, n) + doit(mask ^ (1 << a), dead ^ (1 << b), n);\n }\n }\n }\n break;\n }\n }\n cache[mask][dead] = result;\n return result;\n }\n\n private void solve() throws Throwable {\n int n = nextInt(), m = nextInt(), k = nextInt();\n g = new boolean[n][n];\n cache = new long[1 << n][1 << n];\n for (long[] current : cache) {\n Arrays.fill(current, -1);\n }\n Arrays.fill(cache[0], 1);\n for (int i = 0; i < m; ++i) {\n int a = nextInt() - 1, b = nextInt() - 1;\n g[a][b] = g[b][a] = true;\n }\n long ans = 0;\n for (int dead = 0; dead < (1 << n); ++dead) {\n if (Integer.bitCount(dead) == k) {\n ans += doit((1 << n) - 1, dead, n);\n }\n }\n output.println(ans);\n\n }\n\n public void run() {\n try {\n solve();\n } catch (Throwable e) {\n System.err.println(e.getMessage());\n e.printStackTrace();\n System.exit(666);\n } finally {\n output.flush();\n output.close();\n }\n }\n\n public static void main(String[] args) {\n new TaskE().start();\n }\n\n private int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n private long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n private double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n private String nextToken() throws IOException {\n while (tokens == null || !tokens.hasMoreTokens()) {\n tokens = new StringTokenizer(input.readLine());\n }\n return tokens.nextToken();\n }\n\n static long[][] cache;\n static boolean[][] g;\n private BufferedReader input;\n private PrintWriter output;\n private StringTokenizer tokens = null;\n}\n", "lang_cluster": "Java", "tags": ["dp", "bitmasks"], "code_uid": "9c927076800f617fff0747b38214cf38", "src_uid": "8087605a8f316150372cc4627f26231d", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\n\npublic class Main {\n\n\t/**\n\t * @param args\n\t */\n\tstatic int N, M, K;\n\tstatic int[] G, log;\n\tstatic long[][] DP;\n\tpublic static void main(String[] args) {\n\t\tDP = new long[1 << 17][13];\n\t\t\n\t\tlog = new int[1 << 15];\n\t\tfor(int i = 0; i < 15; i++)\n\t\t\tlog[1 << i] = i;\n\t\t\n\t\tInputReader r = new InputReader(System.in);\n\n\t\tN = r.nextInt();\n\t\tM = r.nextInt();\n\t\tK = r.nextInt();\n\n\t\tG = new int[N];\n\t\t\n\t\tint id = 1;\n\t\tfor(int k = 0; k < M; k++){\n\t\t\tint i = r.nextInt() - 1;\n\t\t\tint j = r.nextInt() - 1;\n\t\t\t\n//\t\t\tG[Math.min(i, j)] |= 1 << Math.max(i, j);\n\t\t\tG[i] |= 1 << j;\n\t\t\tG[j] |= 1 << i;\n\t\t}\n\t\t\n\t\tfor(long[] i : DP)\n\t\t\tArrays.fill(i, -1);\n\t\t\n\t\tlong ret = 0;\n\t\tfor(int next = G[0]; next > 0; next = (next - 1) & G[0]){\n//\t\t\tSystem.out.println(Integer.toBinaryString(next));\n\t\t\tret += go(1, next | 1, Integer.bitCount(next) == 1 ? 1 : 0);\n\t\t}\n\t\t\n\t\tSystem.out.println(ret);\n\t}\n\n\tprivate static long go(int done, int reached, int c) {\n\t\tif(done == (1 << N) - 1){\n\t\t\treturn c == K ? 1 : 0;\n\t\t}else{\n\t\t\tif(DP[gen(done, reached)][c] != -1)return DP[gen(done, reached)][c];\n\t\t\t\n\t\t\tint can = reached & ~done;\n\t\t\tint curr = can & -can;\n\t\t\t\n//\t\t\tSystem.out.println(curr + \", \" + currI);\n\t\t\tif(curr == 0)return DP[gen(done, reached)][c] = 0;\n\t\t\t\n\t\t\tint currI = log[curr];\n\t\t\t\n\t\t\tlong ret = 0;\n\t\t\t\n\t\t\tret += go(done | 1 << currI, reached, c + 1);\n\t\t\tfor(int next = G[currI] & ~reached; next > 0; next = (next - 1) & G[currI] & ~reached){\n//\t\t\t\tSystem.out.println(currI + \", \" + next);\n\t\t\t\tret += go(done | 1 << currI, reached | next, c);\n\t\t\t}\n\t\t\t\n\t\t\treturn DP[gen(done, reached)][c] = ret;\n\t\t}\n\t}\n\n\tprivate static int gen(int done, int reached) {\n\t\tint ret = 0;\n\t\tfor(int itr = 0; itr < N; itr++){\n\t\t\tret *= 3; \n\t\t\tif((reached & 1) == 0){\n//\t\t\t\tif((done & 1) == 1)System.out.println(\"error\");\n\t\t\t\tret += 0;\n\t\t\t}else{\n\t\t\t\tif((done & 1) == 0)ret += 1;\n\t\t\t\telse ret += 2;\n\t\t\t}\n\t\t\t\n\t\t\tdone /= 2;\n\t\t\treached /= 2;\n\t\t}\n\t\t\n\t\treturn ret;\n\t}\n\n\tprivate static String print(int m) {\n\t\tString ret = Integer.toBinaryString(m);\n\t\twhile(ret.length() < N)ret = \"0\" + ret;\n\t\treturn ret;\n\t}\n\n\tstatic class InputReader {\n\t\tprivate BufferedReader reader;\n\t\tprivate StringTokenizer tokenizer;\n\n\t\tpublic InputReader(InputStream stream) {\n\t\t\treader = new BufferedReader(new InputStreamReader(stream));\n\t\t\ttokenizer = null;\n\t\t}\n\n\t\tpublic String nextLine() {\n\t\t\ttry {\n\t\t\t\treturn reader.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\t// TODO Auto-generated catch block\n\t\t\t\te.printStackTrace();\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\n\t\tpublic String next() {\n\t\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tokenizer.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dp", "bitmasks"], "code_uid": "23969e04ce7f78bec6548bfe4f857b21", "src_uid": "8087605a8f316150372cc4627f26231d", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class E implements Runnable {\n\n\tprivate void solve() throws IOException {\n\t\tint n = nextInt();\n\t\tint[][] m = new int[n][n];\n\t\tint edges = nextInt();\n\t\tint k = nextInt();\n\t\tfor (int i = 0; i < edges; i++) {\n\t\t\tint u = nextInt() - 1, v = nextInt() - 1;\n\t\t\tm[u][v]++;\n\t\t\tm[v][u]++;\n\t\t}\n\t\tint[][] d = new int[1 << n][1 << n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tint mask = (1 << i) | (1 << j);\n\t\t\t\td[mask][mask] = m[i][j];\n\t\t\t}\n\t\t}\n\t\tfor (int mask = 1; mask < 1 << n; mask++) {\n\t\t\tif (Integer.bitCount(mask) <= 2)\n\t\t\t\tcontinue;\n\t\t\tfor (int sub = mask; sub > 0; sub = (sub - 1) & mask) {\n\t\t\t\tint bit = Integer.numberOfTrailingZeros(sub);\n\t\t\t\tint mask1 = mask ^ (1 << bit);\n\t\t\t\tint sub1 = sub ^ (1 << bit);\n\t\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\t\tif ((mask1 & (1 << i)) != 0 && (sub1 & (1 << i)) == 0) {\n\t\t\t\t\t\td[mask][sub] += m[bit][i] * d[mask1][sub1 | (1 << i)];\n\t\t\t\t\t\td[mask][sub] += m[bit][i] * d[mask1][sub1];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint ans = 0;\n\t\tfor (int mask = 0; mask < 1 << n; mask++) {\n\t\t\tif (Integer.bitCount(mask) == k) {\n\t\t\t\tans += d[(1 << n) - 1][mask];\n\t\t\t}\n\t\t}\n\t\tout.println(ans);\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Thread(new E()).start();\n\t}\n\n\tBufferedReader br;\n\tStringTokenizer st;\n\tPrintWriter out;\n\tboolean eof = false;\n\n\tpublic void run() {\n\t\tLocale.setDefault(Locale.US);\n\t\ttry {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(System.out);\n\t\t\tsolve();\n\t\t\tout.close();\n\t\t} catch (Throwable e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(239);\n\t\t}\n\t}\n\n\tString nextToken() {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (Exception e) {\n\t\t\t\teof = true;\n\t\t\t\treturn \"0\";\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tint nextInt() {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n}", "lang_cluster": "Java", "tags": ["dp", "bitmasks"], "code_uid": "e6959b2d1e74b93b6852e5188f2e64c8", "src_uid": "8087605a8f316150372cc4627f26231d", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\nimport java.lang.*;\nimport java.math.*;\nimport java.io.*;\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\nimport static java.util.Collections.*;\n\npublic class P053E{\n\tScanner sc=new Scanner(System.in);\n\n\tint INF=1<<28;\n\tdouble EPS=1e-9;\n\n\tint n, m, k;\n\tint[] u, v;\n\n\tvoid run(){\n\n\t\t// test();\n\t\tn=sc.nextInt();\n\t\tm=sc.nextInt();\n\t\tk=sc.nextInt();\n\t\t// k個が葉になる全域木の個数\n\t\t// n<=10\n\t\t// m<=50\n\t\tu=new int[m];\n\t\tv=new int[m];\n\t\tfor(int i=0; i<m; i++){\n\t\t\tu[i]=sc.nextInt()-1;\n\t\t\tv[i]=sc.nextInt()-1;\n\t\t}\n\t\tsolve();\n\t}\n\n\tvoid test(){\n\t\tn=10;\n\t\tm=50;\n\t\tm=40;\n\t\tk=5;\n\t\tu=new int[m];\n\t\tv=new int[m];\n\t\tfor(int i=0; i<m; i++){\n\t\t\tu[i]=(int)(random()*n);\n\t\t\tv[i]=(int)(random()*n);\n\t\t\tfor(; v[i]==u[i];){\n\t\t\t\tv[i]=(int)(random()*n);\n\t\t\t}\n\t\t\tboolean ok=true;\n\t\t\tfor(int j=0; j<i; j++){\n\t\t\t\tok&=u[i]!=u[j]||v[i]!=v[j];\n\t\t\t\tok&=u[i]!=v[j]||v[i]!=u[j];\n\t\t\t}\n\t\t\tif(!ok){\n\t\t\t\ti--;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\t\tsolve();\n\t}\n\n\tvoid solve(){\n\t\tlong[][] dp=new long[1<<n][1<<n];\n\t\t// [s][t]:=sが連結，tが葉，の個数\n\n\t\tfor(int i=0; i<n; i++){\n\t\t\t// dp[1<<i][1<<i]=1;\n\t\t}\n\t\tfor(int i=0; i<m; i++){\n\t\t\tdp[(1<<u[i])|(1<<v[i])][(1<<u[i])|(1<<v[i])]=2;\n\t\t}\n\t\t// dp[1][1]=1;\n\t\tfor(int s=1; s<1<<n; s++){\n\t\t\tint t=s;\n\t\t\tdo{\n\t\t\t\tif(Integer.bitCount(t)>0){\n\t\t\t\t\tdp[s][t]/=Integer.bitCount(t);\n\t\t\t\t}\n\t\t\t\tfor(int i=0; i<m; i++){\n\t\t\t\t\tboolean ub=(s>>u[i]&1)==1;\n\t\t\t\t\tboolean vb=(s>>v[i]&1)==1;\n\t\t\t\t\tif(ub&!vb){\n\t\t\t\t\t\tdp[s|(1<<v[i])][t&~(1<<u[i])|(1<<v[i])]+=dp[s][t];\n\t\t\t\t\t}\n\t\t\t\t\tif(!ub&vb){\n\t\t\t\t\t\tdp[s|(1<<u[i])][t&~(1<<v[i])|(1<<u[i])]+=dp[s][t];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tt=(t-1)&s;\n\t\t\t}while(t!=s);\n\t\t}\n\t\tlong ans=0;\n\t\tint comb=(1<<k)-1;\n\t\tfor(; comb<1<<n;){\n\t\t\tans+=dp[(1<<n)-1][comb];\n\t\t\tint x=comb&-comb, y=comb+x;\n\t\t\tcomb=((comb&~y)/x>>>1)|y;\n\t\t}\n\t\tprintln(ans+\"\");\n\t}\n\n\tvoid println(String s){\n\t\tSystem.out.println(s);\n\t}\n\n\tvoid print(String s){\n\t\tSystem.out.print(s);\n\t}\n\n\tvoid debug(Object... os){\n\t\tSystem.err.println(Arrays.deepToString(os));\n\t}\n\n\tpublic static void main(String[] args){\n\t\tLocale.setDefault(Locale.US);\n\t\tnew P053E().run();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dp", "bitmasks"], "code_uid": "439f64c0614a4ea15500fc6359835c94", "src_uid": "8087605a8f316150372cc4627f26231d", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\nimport java.lang.*;\nimport java.math.*;\nimport java.io.*;\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\nimport static java.util.Collections.*;\n\npublic class P053E{\n\tScanner sc=new Scanner(System.in);\n\n\tint INF=1<<28;\n\tdouble EPS=1e-9;\n\n\tint n, m, k;\n\tint[] u, v;\n\n\tvoid run(){\n\t\tn=sc.nextInt();\n\t\tm=sc.nextInt();\n\t\tk=sc.nextInt();\n\t\tu=new int[m];\n\t\tv=new int[m];\n\t\tfor(int i=0; i<m; i++){\n\t\t\tu[i]=sc.nextInt()-1;\n\t\t\tv[i]=sc.nextInt()-1;\n\t\t}\n\t\tsolve();\n\t}\n\n\tvoid solve(){\n\t\tlong[][] dp=new long[1<<n][1<<n];\n\t\t// dp[s][t]:=「sが連結かつtが葉」の個数\n\n\t\tfor(int i=0; i<m; i++){\n\t\t\tdp[(1<<u[i])|(1<<v[i])][(1<<u[i])|(1<<v[i])]=2;\n\t\t}\n\t\tfor(int s=0; s<1<<n; s++){\n\t\t\tint t=s;\n\t\t\tdo{\n\t\t\t\tif(Integer.bitCount(t)>0){\n\t\t\t\t\tdp[s][t]/=Integer.bitCount(t);\n\t\t\t\t}\n\t\t\t\tfor(int i=0; i<m; i++){\n\t\t\t\t\tboolean ub=(s>>u[i]&1)==1;\n\t\t\t\t\tboolean vb=(s>>v[i]&1)==1;\n\t\t\t\t\tif(ub&!vb){\n\t\t\t\t\t\tdp[s|(1<<v[i])][t&~(1<<u[i])|(1<<v[i])]+=dp[s][t];\n\t\t\t\t\t}\n\t\t\t\t\tif(!ub&vb){\n\t\t\t\t\t\tdp[s|(1<<u[i])][t&~(1<<v[i])|(1<<u[i])]+=dp[s][t];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tt=(t-1)&s;\n\t\t\t}while(t!=s);\n\t\t}\n\n\t\tlong ans=0;\n\t\tint comb=(1<<k)-1;\n\t\tfor(; comb<1<<n;){\n\t\t\tans+=dp[(1<<n)-1][comb];\n\t\t\tint x=comb&-comb, y=comb+x;\n\t\t\tcomb=((comb&~y)/x>>>1)|y;\n\t\t}\n\t\tprintln(ans+\"\");\n\t}\n\n\tvoid println(String s){\n\t\tSystem.out.println(s);\n\t}\n\n\tvoid print(String s){\n\t\tSystem.out.print(s);\n\t}\n\n\tpublic static void main(String[] args){\n\t\tLocale.setDefault(Locale.US);\n\t\tnew P053E().run();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dp", "bitmasks"], "code_uid": "d14ea7a8bfe74e120fc95770b934fca7", "src_uid": "8087605a8f316150372cc4627f26231d", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.StringTokenizer;\n\n/**\n * Author: homo_sapiens\n * Date: 7/14/12\n * Time: 11:54 AM\n */\npublic class Solution {\n public static void main(String[] args) throws IOException {\n Solution solution = new Solution();\n solution.run();\n }\n\n private int n;\n private int[] a;\n private BigInteger[][][] z;\n\n private void run() throws IOException {\n BufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n BufferedWriter out = new BufferedWriter(new OutputStreamWriter(System.out));\n\n String s = in.readLine();\n\n a = new int[s.length()];\n for (int i = 0; i < s.length(); i++) {\n a[i] = s.charAt(i) == 'A' ? 0 : 1;\n }\n\n z = new BigInteger[s.length() + 1][4][4];\n\n for (int i = 0; i <= s.length(); i++) {\n for (int j = 0; j < 4; j++) {\n for (int k = 0; k < 4; k++) {\n z[i][j][k] = BigInteger.valueOf(-1);\n }\n }\n }\n\n BigInteger result = BigInteger.ZERO;\n\n for (int mask = 0; mask < 4; mask++) {\n result = result.add(solve(2, mask, mask));\n }\n\n out.write(result.toString());\n out.newLine();\n\n out.close();\n in.close();\n }\n\n private BigInteger solve(int idx, int mask1, int mask2) {\n if (!z[idx][mask1][mask2].equals(BigInteger.valueOf(-1))) {\n return z[idx][mask1][mask2];\n }\n\n int f1 = mask1 & 1, f2 = (mask1 >> 1) & 1;\n int s1 = mask2 & 1, s2 = (mask2 >> 1) & 1;\n\n BigInteger result = BigInteger.ZERO;\n\n if (idx == a.length) {\n if (correct(s1, s2, f1, a[idx - 2], a[idx - 1], a[0])\n && correct(s2, f1, f2, a[idx - 1], a[0], a[1])) {\n result = BigInteger.ONE;\n }\n } else {\n for (int cur = 0; cur < 2; cur++) {\n if (correct(s1, s2, cur, a[idx - 2], a[idx - 1], a[idx])) {\n result = result.add(solve(idx + 1, mask1, (cur << 1) | s2));\n }\n }\n }\n\n return z[idx][mask1][mask2] = result;\n }\n\n private boolean correct(int a1, int a2, int a3, int b1, int b2, int b3) {\n if (a1 == 0 && a2 == 1) {\n return b1 == 1 && b2 == 0;\n } else if (a2 == 0 && a3 == 1) {\n return b2 == 1 && b3 == 0;\n } else {\n return a2 == b2;\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["combinatorics"], "code_uid": "8216ec4cf7e8e9450b1b5e596620ee33", "src_uid": "ad27d991516054ea473b384bb2563b38", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner cin = new Scanner(System.in);\n int N = cin.nextInt();\n int K = cin.nextInt();\n long ans = (new Solver(N, K)).solve();\n System.out.println(ans);\n }\n}\n\nclass Solver {\n int N, K;\n long[][][] big, small; \n static long[][] comb;\n static final int Mod = 1000000000 + 7;\n static {\n comb = new long[13][13];\n for (int i = 0; i <= 12; ++i) {\n for (int j = 0; j <= i; ++j) {\n if (j == 0 || j == i) {\n comb[i][j] = 1;\n }\n else {\n comb[i][j] = (comb[i - 1][j - 1] + comb[i - 1][j]) % Mod;\n }\n }\n }\n }\n Solver(int N, int K) {\n this.N = N;\n this.K = K;\n big = new long[N + 1][K + 1][1 << 4];\n small = new long[N + 1][K + 1][1 << 4];\n for (int i = 0; i <= N; ++i) {\n for (int j = 0; j <= K; ++j) {\n for (int k = 0; k < 16; ++k) {\n big[i][j][k] = small[i][j][k] = -1;\n }\n }\n }\n }\n long solve() {\n long res = calcBig(N, K, 15);\n for (int i = K; i >= 1; --i) {\n res = res * i % Mod;\n }\n return res;\n }\n long calcBig(int size, int count, int mask) {\n if (count < 0) {\n return 0;\n }\n if (big[size][count][mask] != -1) {\n return big[size][count][mask];\n }\n long res = 0;\n if (mask == 15) {\n res += 2 * calcBig(0, count - 2, 0);\n }\n for (int i = 0; i < 4; ++i) {\n int j = (i + 1) & 3;\n if ((mask >> i & 1) == 1 && (mask >> j & 1) == 1) {\n int nxt = mask ^ (1 << i) ^ (1 << j);\n for (int k = nxt; ; k = (k - 1) & nxt) {\n res += calcSmall(size, count - 1 - Integer.bitCount(k), nxt - k);\n if (k == 0) {\n break;\n }\n }\n }\n }\n int nxt = mask;\n for (int k = nxt; ; k = (k - 1) & nxt) {\n res += calcSmall(size, count - Integer.bitCount(k), nxt - k);\n if (k == 0) {\n break;\n }\n }\n return big[size][count][mask] = res % Mod;\n }\n long calcSmall(int size, int count, int mask) {\n if (count < 0) {\n return 0;\n }\n if (small[size][count][mask] != -1) {\n return small[size][count][mask];\n }\n if (size == 0) {\n return count == 0 ? 1 : 0;\n }\n long res = 0;\n int maxCount = Integer.bitCount(mask) * 3;\n int pairCount = 0;\n for (int i = 0; i < 4; ++i) {\n int j = (i + 1) & 3;\n if ((mask >> i & 1) == 1 && (mask >> j & 1) == 1) {\n pairCount++;\n }\n }\n for (int i = 0; i <= pairCount; ++i) {\n for (int j = 0; j <= maxCount - i * 2; ++j) {\n res += calcBig(size - 1, count - i - j, mask) * comb[pairCount][i] % Mod * comb[maxCount - i * 2][j] % Mod;\n }\n }\n return small[size][count][mask] = res % Mod;\n }\n}\n", "lang_cluster": "Java", "tags": ["dp", "implementation", "combinatorics", "bitmasks"], "code_uid": "20de7bdbbb01a6d84e2dfa9660ad954f", "src_uid": "fa649fed687d72b1431ac82bc7288116", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.OutputStreamWriter;\nimport java.io.BufferedWriter;\nimport java.util.Comparator;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.Writer;\nimport java.util.List;\nimport java.io.IOException;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.ArrayList;\nimport java.util.NoSuchElementException;\nimport java.math.BigInteger;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Egor Kulikov (egor@egork.net)\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tOutputWriter out = new OutputWriter(outputStream);\n\t\tTaskE solver = new TaskE();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskE {\n\tstatic final long MOD = 1000000007;\n\n\tlong[][][] result;\n\tlong[][][] resultSmall;\n\tlong[][] c = IntegerUtils.generateBinomialCoefficients(13);\n\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n\t\tint size = in.readInt();\n\t\tint count = in.readInt();\n\t\tresult = new long[size + 1][count + 1][16];\n\t\tresultSmall = new long[size + 1][count + 1][16];\n\t\tArrayUtils.fill(result, -1);\n\t\tArrayUtils.fill(resultSmall, -1);\n\t\tlong answer = calculate(size, count, 0);\n\t\tanswer *= IntegerUtils.factorial(count, MOD);\n\t\tanswer %= MOD;\n\t\tout.printLine(answer);\n }\n\n\tprivate long calculate(int size, int count, int mask) {\n\t\tif (count < 0)\n\t\t\treturn 0;\n\t\tif (result[size][count][mask] != -1)\n\t\t\treturn result[size][count][mask];\n\t\tlong current = 0;\n\t\tif (mask == 0)\n\t\t\tcurrent += 2 * calculate(0, count - 2, 15);\n\t\tfor (int i = 0; i < 4; i++) {\n\t\t\tint j = (i + 1) & 3;\n\t\t\tif ((mask >> i & 1) != 0 || (mask >> j & 1) != 0)\n\t\t\t\tcontinue;\n\t\t\tint remaining = 15 - mask - (1 << i) - (1 << j);\n\t\t\tfor (int k = remaining; ; k = (k - 1) & remaining) {\n\t\t\t\tcurrent += calculateSmall(size, count - 1 - Integer.bitCount(k), mask + (1 << i) + (1 << j) + k);\n\t\t\t\tif (k == 0)\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tint remaining = 15 - mask;\n\t\tfor (int k = remaining; ; k = (k - 1) & remaining) {\n\t\t\tcurrent += calculateSmall(size, count - Integer.bitCount(k), mask + k);\n\t\t\tif (k == 0)\n\t\t\t\tbreak;\n\t\t}\n\t\treturn result[size][count][mask] = current % MOD;\n\t}\n\n\tprivate long calculateSmall(int size, int count, int mask) {\n\t\tif (count < 0)\n\t\t\treturn 0;\n\t\tif (resultSmall[size][count][mask] != -1)\n\t\t\treturn resultSmall[size][count][mask];\n\t\tif (size == 0)\n\t\t\treturn resultSmall[size][count][mask] = count == 0 ? 1 : 0;\n\t\tint max = 3 * Integer.bitCount(15 - mask);\n\t\tint pairCount = 0;\n\t\tfor (int i = 0; i < 4; i++) {\n\t\t\tint j = (i + 1) & 3;\n\t\t\tif ((mask >> i & 1) == 0 && ((mask >> j & 1) == 0))\n\t\t\t\tpairCount++;\n\t\t}\n\t\tlong current = 0;\n\t\tfor (int j = 0; j <= pairCount; j++) {\n\t\t\tfor (int i = 0; i <= max - 2 * j; i++)\n\t\t\t\tcurrent += calculate(size - 1, count - i - j, mask) * c[max - 2 * j][i] * c[pairCount][j];\n\t\t}\n\t\treturn resultSmall[size][count][mask] = current % MOD;\n\t}\n}\n\nclass IntegerUtils {\n\n public static long[][] generateBinomialCoefficients(int n) {\n\t\tlong[][] result = new long[n + 1][n + 1];\n\t\tfor (int i = 0; i <= n; i++) {\n\t\t\tresult[i][0] = 1;\n\t\t\tfor (int j = 1; j <= i; j++)\n\t\t\t\tresult[i][j] = result[i - 1][j - 1] + result[i - 1][j];\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static long factorial(int n, long mod) {\n\t\tlong result = 1;\n\t\tfor (int i = 2; i <= n; i++)\n\t\t\tresult = result * i % mod;\n\t\treturn result % mod;\n\t}\n\n\t}\n\nclass InputReader {\n\n\tprivate InputStream stream;\n\tprivate byte[] buf = new byte[1024];\n\tprivate int curChar;\n\tprivate int numChars;\n\tprivate SpaceCharFilter filter;\n\n\tpublic InputReader(InputStream stream) {\n\t\tthis.stream = stream;\n\t}\n\n\tpublic int read() {\n\t\tif (numChars == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (curChar >= numChars) {\n\t\t\tcurChar = 0;\n\t\t\ttry {\n\t\t\t\tnumChars = stream.read(buf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (numChars <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buf[curChar++];\n\t}\n\n\tpublic int readInt() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tint res = 0;\n\t\tdo {\n\t\t\tif (c < '0' || c > '9')\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n\n\tpublic boolean isSpaceChar(int c) {\n\t\tif (filter != null)\n\t\t\treturn filter.isSpaceChar(c);\n\t\treturn isWhitespace(c);\n\t}\n\n\tpublic static boolean isWhitespace(int c) {\n\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t}\n\n\tpublic interface SpaceCharFilter {\n\t\tpublic boolean isSpaceChar(int ch);\n\t}\n}\n\nclass OutputWriter {\n\tprivate final PrintWriter writer;\n\n\tpublic OutputWriter(OutputStream outputStream) {\n\t\twriter = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n\t}\n\n\tpublic OutputWriter(Writer writer) {\n\t\tthis.writer = new PrintWriter(writer);\n\t}\n\n\tpublic void print(Object...objects) {\n\t\tfor (int i = 0; i < objects.length; i++) {\n\t\t\tif (i != 0)\n\t\t\t\twriter.print(' ');\n\t\t\twriter.print(objects[i]);\n\t\t}\n\t}\n\n public void printLine(Object...objects) {\n\t\tprint(objects);\n\t\twriter.println();\n\t}\n\n\tpublic void close() {\n\t\twriter.close();\n\t}\n\n\t}\n\nclass ArrayUtils {\n\n\tpublic static void fill(long[][] array, long value) {\n\t\tfor (long[] row : array)\n\t\t\tArrays.fill(row, value);\n\t}\n\n\tpublic static void fill(long[][][] array, long value) {\n\t\tfor (long[][] row : array)\n\t\t\tfill(row, value);\n\t}\n\n\t}\n\n", "lang_cluster": "Java", "tags": ["dp", "implementation", "combinatorics", "bitmasks"], "code_uid": "3c6ead12f7556088d666801bc929997d", "src_uid": "fa649fed687d72b1431ac82bc7288116", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedWriter;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStreamWriter;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\n\npublic class CF_Edu_108_F {\n\tstatic boolean verb=true;\n\tstatic void log(Object X){if (verb) System.err.println(X);}\n\tstatic void log(Object[] X){if (verb) {for (Object U:X) System.err.print(U+\" \");System.err.println(\"\");}}\n\tstatic void log(int[] X){if (verb) {for (int U:X) System.err.print(U+\" \");System.err.println(\"\");}}\n\tstatic void log(int[] X,int L){if (verb) {for (int i=0;i<L;i++) System.err.print(X[i]+\" \");System.err.println(\"\");}}\n\tstatic void log(long[] X){if (verb) {for (long U:X) System.err.print(U+\" \");System.err.println(\"\");}}\n\n\tstatic InputReader reader;\n\n\n\tstatic class Composite {\n\t\tint msk;\n\t\tint cost;\n\n\t\tComposite left;\n\t\tComposite right;\n\n\n\n\t}\n\n\n\tstatic String name(int w) {\n\t\tint it=0;\n\t\tString s=\"key:[\";\n\t\twhile (w>0) {\n\t\t\tif ((w&1)!=0) {\n\t\t\t\ts+=(it+1)+\" \";\n\t\t\t}\n\t\t\tw>>=1;\n\t\t\tit++;\n\t\t}\n\t\treturn s+\"]\";\n\t}\n\t\n\tstatic\tint FX=Integer.MAX_VALUE;\n\tstatic int solveAlt(int[] a,int[] b,int[][] c) {\n\t\tint n=a.length;\n\t\tint m=b.length;\n\t\tint MX=1<<m;\n\n\t\tint tot=0;\n\t\tfor (int i=0;i<n;i++)\n\t\t\ttot+=a[i];\n\t\tint bob=0;\n\t\tfor (int j=0;j<m;j++)\n\t\t\tbob+=b[j];\n\t\tif (tot>bob)\n\t\t\treturn -1;\n\n\n\t\tint[][] cost=new int[n][MX];\n\t\tint[] bill=new int[MX];\n\n\t\tfor (int w=0;w<MX;w++)\n\t\t\tfor (int j=0;j<m;j++)\n\t\t\t\tif (((1<<j)&w)!=0) {\n\t\t\t\t\tbill[w]+=b[j];\n\t\t\t\t\tfor (int i=0;i<n;i++)\n\t\t\t\t\t\tcost[i][w]+=c[i][j];\n\t\t\t\t}\n\n\n\n\n\t\tint[] stack=new int[n];\n\t\tint[] ptr=new int[n];\n\t\tArrays.fill(ptr, 1);\n\t\tint best=FX;\n\t\tint st=0;\n\t\tint[] curspend=new int[n];\n\t\t\n\t\twhile (st>=0) {\n\t\t\tif (ptr[st]<MX) {\n\t\t\t\tint w=ptr[st]++;\n\t\t\t\tint spend=0;\n\t\t\t\tif (st>0)\n\t\t\t\t\tspend=curspend[st-1];\n\t\t\t\t//log(\"trying :\"+name(w)+\" at pos:\"+st);\n\t\t\t\t//log((bill[w]-a[st])+\" \"+(spend+cost[st][w])+\" vs \"+best);\n\t\t\t\tif (bill[w]>=a[st] && spend+cost[st][w]<best) {\n\t\t\t\t\t// now check all the previous ones\n\t\t\t\t\tint TX=1<<st;\n\t\t\t\t\tboolean ok=true;\n\t\t\t\t\tfor (int z=1;z<TX;z++) {\n\t\t\t\t\t\tint gain=a[st];\n\t\t\t\t\t\tint msk=w;\n\t\t\t\t\t\tfor (int j=0;j<st;j++) {\n\t\t\t\t\t\t\tif ((z&(1<<j))!=0) {\n\t\t\t\t\t\t\t\tmsk|=stack[j];\n\t\t\t\t\t\t\t\tgain+=a[j];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (gain>bill[msk]) {\n\t\t\t\t\t\t\tok=false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\t\t\t\t\tif (ok) {\n\t\t\t\t\t\tspend+=cost[st][w];\n\t\t\t\t\t\tcurspend[st]=spend;\n\t\t\t\t\t\tif (st==n-1) {\n\t\t\t\t\t\t\t//log(\"this is ok\");\n\t\t\t\t\t\t\tstack[st]=w;\n\t\t\t\t\t\t\t//for (int x:stack) {\n\t\t\t\t\t\t\t//\tlog(name(x));\n\t\t\t\t\t\t\t//}\n\t\t\t\t\t\t\tbest=spend;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tstack[st++]=w;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tptr[st]=1;\n\t\t\t\tst--;\n\t\t\t}\n\t\t}\n\n\n\t\tif (best==FX)\n\t\t\tbest=-1;\n\t\treturn best;\n\n\n\n\t}\n\tstatic int solveKO(int[] a,int[] b,int[][] c) {\n\t\tint n=a.length;\n\t\tint m=b.length;\n\t\tint MX=1<<m;\n\n\t\tint[][] cost=new int[n][MX];\n\t\tint[] bill=new int[MX];\n\n\t\tfor (int w=0;w<MX;w++)\n\t\t\tfor (int j=0;j<m;j++)\n\t\t\t\tif (((1<<j)&w)!=0) {\n\t\t\t\t\tbill[w]+=b[j];\n\t\t\t\t\tfor (int i=0;i<n;i++)\n\t\t\t\t\t\tcost[i][w]+=c[i][j];\n\t\t\t\t}\n\n\n\t\tint VX=m*4+1;\n\t\tint[][] spend=new int[MX][VX];\n\n\t\tfor (int w=0;w<MX;w++) {\n\t\t\tArrays.fill(spend[w], FX);\n\t\t\tif (bill[w]>=a[0]) {\n\t\t\t\t// ok for me\n\t\t\t\t// now we look at the previous\n\t\t\t\tspend[w][bill[w]-a[0]]=cost[0][w];\n\t\t\t\t//log(\"adding:\"+w);\n\t\t\t}\n\t\t}\n\n\n\n\t\t// this is taking some shortcut...\n\n\t\tfor (int i=1;i<n;i++) {\n\t\t\tint[][] nxt=new int[MX][VX];\n\t\t\tfor (int w=0;w<MX;w++)\n\t\t\t\tArrays.fill(nxt[w],FX);\n\t\t\tfor (int w=0;w<MX;w++) {\n\t\t\t\tif (bill[w]>=a[i]) {\n\t\t\t\t\t//log(\"considering:\"+w);\n\t\t\t\t\t// ok for me\n\t\t\t\t\t// now we look at the previous\n\t\t\t\t\tfor (int u=0;u<MX;u++)\n\t\t\t\t\t\tfor (int v=0;v<VX;v++) {\n\t\t\t\t\t\t\tif (spend[u][v]<FX) {\n\t\t\t\t\t\t\t\t//log(\"----interested by u:\"+u);\n\t\t\t\t\t\t\t\tint nu=u|w;\n\t\t\t\t\t\t\t\tint nv=v+bill[w]-bill[w&u]-a[i];\n\t\t\t\t\t\t\t\t//log(\"nv:\"+nv);\n\t\t\t\t\t\t\t\tif (nv>=0) {\n\t\t\t\t\t\t\t\t\t//log(\"----merging\");\n\t\t\t\t\t\t\t\t\tnxt[nu][nv]=Math.min(spend[u][v]+cost[i][w], nxt[nu][nv]);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t}\n\t\t\tspend=nxt;\n\t\t}\n\t\tint ans=FX;\n\t\tfor (int w=0;w<MX;w++)\n\t\t\tfor (int v=0;v<VX;v++)\n\t\t\t\tans=Math.min(ans, spend[w][v]);\n\n\t\tif (ans==FX)\n\t\t\tans=-1;\n\t\treturn ans;\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\n\t\treader=new InputReader(System.in);\n\t\tint n=reader.readInt();\n\t\tint m=reader.readInt();\n\t\tint[] a=new int[n];\n\t\tint tot=0;\n\t\tfor (int i=0;i<n;i++) {\n\t\t\ta[i]=reader.readInt();\n\t\t\ttot+=a[i];\n\t\t}\n\t\tint[] b=new int[m];\n\t\tfor (int i=0;i<m;i++)\n\t\t\tb[i]=reader.readInt();\n\n\t\tint[][] c=new int[n][m];\n\t\tfor (int i=0;i<n;i++)\n\t\t\tfor (int j=0;j<m;j++)\n\t\t\t\tc[i][j]=reader.readInt();\n\n\n\t\tint ans=solveAlt(a,b,c);\n\n\t\tSystem.out.println(ans);\n\n\n\n\n\t}\n\n\n\tstatic final class InputReader {\n\t\tprivate final InputStream stream;\n\t\tprivate final byte[] buf = new byte[1024];\n\t\tprivate int curChar;\n\t\tprivate int numChars;\n\n\t\tpublic InputReader(InputStream stream) {\n\t\t\tthis.stream = stream;\n\t\t}\n\n\t\tprivate int read() throws IOException {\n\t\t\tif (curChar >= numChars) {\n\t\t\t\tcurChar = 0;\n\t\t\t\tnumChars = stream.read(buf);\n\t\t\t\tif (numChars <= 0) {\n\t\t\t\t\treturn -1;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn buf[curChar++];\n\t\t}\n\n\n\t\tpublic final String readString() throws IOException {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c)) {\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tStringBuilder res=new StringBuilder();\n\t\t\tdo {\n\t\t\t\tres.append((char)c);\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tpublic final int readInt() throws IOException {\n\t\t\tint c = read();\n\t\t\tboolean neg=false;\n\t\t\twhile (isSpaceChar(c)) {\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tchar d=(char)c;\n\t\t\t//log(\"d:\"+d);\n\t\t\tif (d=='-') {\n\t\t\t\tneg=true;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo {\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\t//log(\"res:\"+res);\n\t\t\tif (neg)\n\t\t\t\treturn -res;\n\t\t\treturn res;\n\n\t\t}\n\n\t\tpublic final long readLong() throws IOException {\n\t\t\tint c = read();\n\t\t\tboolean neg=false;\n\t\t\twhile (isSpaceChar(c)) {\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tchar d=(char)c;\n\t\t\t//log(\"d:\"+d);\n\t\t\tif (d=='-') {\n\t\t\t\tneg=true;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo {\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\t//log(\"res:\"+res);\n\t\t\tif (neg)\n\t\t\t\treturn -res;\n\t\t\treturn res;\n\n\t\t}\n\n\n\n\t\tprivate boolean isSpaceChar(int c) {\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "dfs and similar", "flows", "dp", "bitmasks"], "code_uid": "e1f41bf18fbe6105059af98ed7c3af03", "src_uid": "4dc5dc78bda59c1ec6dd8acd6f1d7333", "difficulty": 3200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedWriter;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStreamWriter;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\n\npublic class CF_Edu_108_F {\n\tstatic boolean verb=true;\n\tstatic void log(Object X){if (verb) System.err.println(X);}\n\tstatic void log(Object[] X){if (verb) {for (Object U:X) System.err.print(U+\" \");System.err.println(\"\");}}\n\tstatic void log(int[] X){if (verb) {for (int U:X) System.err.print(U+\" \");System.err.println(\"\");}}\n\tstatic void log(int[] X,int L){if (verb) {for (int i=0;i<L;i++) System.err.print(X[i]+\" \");System.err.println(\"\");}}\n\tstatic void log(long[] X){if (verb) {for (long U:X) System.err.print(U+\" \");System.err.println(\"\");}}\n\n\tstatic InputReader reader;\n\n\n\tstatic class Composite {\n\t\tint msk;\n\t\tint cost;\n\n\t\tComposite left;\n\t\tComposite right;\n\n\n\n\t}\n\n\n\tstatic String name(int w) {\n\t\tint it=0;\n\t\tString s=\"key:[\";\n\t\twhile (w>0) {\n\t\t\tif ((w&1)!=0) {\n\t\t\t\ts+=(it+1)+\" \";\n\t\t\t}\n\t\t\tw>>=1;\n\t\t\tit++;\n\t\t}\n\t\treturn s+\"]\";\n\t}\n\t\n\tstatic\tint FX=Integer.MAX_VALUE;\n\tstatic int solveAlt(int[] a,int[] b,int[][] c) {\n\t\tint n=a.length;\n\t\tint m=b.length;\n\t\tint MX=1<<m;\n\n\t\tint tot=0;\n\t\tfor (int i=0;i<n;i++)\n\t\t\ttot+=a[i];\n\t\tint bob=0;\n\t\tfor (int j=0;j<m;j++)\n\t\t\tbob+=b[j];\n\t\tif (tot>bob)\n\t\t\treturn -1;\n\n\n\t\tint[][] cost=new int[n][MX];\n\t\tint[] bill=new int[MX];\n\n\t\tfor (int w=0;w<MX;w++)\n\t\t\tfor (int j=0;j<m;j++)\n\t\t\t\tif (((1<<j)&w)!=0) {\n\t\t\t\t\tbill[w]+=b[j];\n\t\t\t\t\tfor (int i=0;i<n;i++)\n\t\t\t\t\t\tcost[i][w]+=c[i][j];\n\t\t\t\t}\n\n\t\tint[] stack=new int[n];\n\t\tint[] ptr=new int[n];\n\t\tArrays.fill(ptr, 1);\n\t\tint best=FX;\n\t\tint st=0;\n\t\tint[] curspend=new int[n];\n\t\t\n\t\twhile (st>=0) {\n\t\t\tif (ptr[st]<MX) {\n\t\t\t\tint w=ptr[st]++;\n\t\t\t\tint spend=0;\n\t\t\t\tif (st>0)\n\t\t\t\t\tspend=curspend[st-1];\n\t\t\t\tif (bill[w]>=a[st] && spend+cost[st][w]<best) {\n\t\t\t\t\tboolean ok=true;\n\t\t\t\t\tfor (int z=1;z<(1<<st) && ok;z++) {\n\t\t\t\t\t\tint gain=a[st];\n\t\t\t\t\t\tint msk=w;\n\t\t\t\t\t\tfor (int j=0;j<st;j++) {\n\t\t\t\t\t\t\tif ((z&(1<<j))!=0) {\n\t\t\t\t\t\t\t\tmsk|=stack[j];\n\t\t\t\t\t\t\t\tgain+=a[j];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (gain>bill[msk]) \n\t\t\t\t\t\t\tok=false;\n\t\t\t\t\t}\n\t\t\t\t\tif (ok) {\n\t\t\t\t\t\tspend+=cost[st][w];\n\t\t\t\t\t\tcurspend[st]=spend;\n\t\t\t\t\t\tif (st==n-1) {\n\t\t\t\t\t\t\tbest=spend;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tstack[st++]=w;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tptr[st]=1;\n\t\t\t\tst--;\n\t\t\t}\n\t\t}\n\n\n\t\tif (best==FX)\n\t\t\tbest=-1;\n\t\treturn best;\n\n\n\n\t}\n\t\n\tstatic int bst;\n\t\n\n\tpublic static void main(String[] args) throws Exception {\n\n\t\treader=new InputReader(System.in);\n\t\tint n=reader.readInt();\n\t\tint m=reader.readInt();\n\t\tint[] a=new int[n];\n\t\tint tot=0;\n\t\tfor (int i=0;i<n;i++) {\n\t\t\ta[i]=reader.readInt();\n\t\t\ttot+=a[i];\n\t\t}\n\t\tint[] b=new int[m];\n\t\tfor (int i=0;i<m;i++)\n\t\t\tb[i]=reader.readInt();\n\n\t\tint[][] c=new int[n][m];\n\t\tfor (int i=0;i<n;i++)\n\t\t\tfor (int j=0;j<m;j++)\n\t\t\t\tc[i][j]=reader.readInt();\n\n\n\t\tint ans=solveAlt(a,b,c);\n\n\t\tSystem.out.println(ans);\n\n\n\n\n\t}\n\n\n\tstatic final class InputReader {\n\t\tprivate final InputStream stream;\n\t\tprivate final byte[] buf = new byte[1024];\n\t\tprivate int curChar;\n\t\tprivate int numChars;\n\n\t\tpublic InputReader(InputStream stream) {\n\t\t\tthis.stream = stream;\n\t\t}\n\n\t\tprivate int read() throws IOException {\n\t\t\tif (curChar >= numChars) {\n\t\t\t\tcurChar = 0;\n\t\t\t\tnumChars = stream.read(buf);\n\t\t\t\tif (numChars <= 0) {\n\t\t\t\t\treturn -1;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn buf[curChar++];\n\t\t}\n\n\n\t\tpublic final String readString() throws IOException {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c)) {\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tStringBuilder res=new StringBuilder();\n\t\t\tdo {\n\t\t\t\tres.append((char)c);\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tpublic final int readInt() throws IOException {\n\t\t\tint c = read();\n\t\t\tboolean neg=false;\n\t\t\twhile (isSpaceChar(c)) {\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tchar d=(char)c;\n\t\t\t//log(\"d:\"+d);\n\t\t\tif (d=='-') {\n\t\t\t\tneg=true;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo {\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\t//log(\"res:\"+res);\n\t\t\tif (neg)\n\t\t\t\treturn -res;\n\t\t\treturn res;\n\n\t\t}\n\n\t\tpublic final long readLong() throws IOException {\n\t\t\tint c = read();\n\t\t\tboolean neg=false;\n\t\t\twhile (isSpaceChar(c)) {\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tchar d=(char)c;\n\t\t\t//log(\"d:\"+d);\n\t\t\tif (d=='-') {\n\t\t\t\tneg=true;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo {\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\t//log(\"res:\"+res);\n\t\t\tif (neg)\n\t\t\t\treturn -res;\n\t\t\treturn res;\n\n\t\t}\n\n\n\n\t\tprivate boolean isSpaceChar(int c) {\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "dfs and similar", "flows", "dp", "bitmasks"], "code_uid": "84fc6efa27cc9872c95b963d8d55dd92", "src_uid": "4dc5dc78bda59c1ec6dd8acd6f1d7333", "difficulty": 3200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedWriter;\r\nimport java.io.IOException;\r\nimport java.io.InputStream;\r\nimport java.io.OutputStreamWriter;\r\nimport java.util.Arrays;\r\nimport java.util.Scanner;\r\n\r\n\r\npublic class CF_Edu_108_F {\r\n\tstatic boolean verb=true;\r\n\tstatic void log(Object X){if (verb) System.err.println(X);}\r\n\tstatic void log(Object[] X){if (verb) {for (Object U:X) System.err.print(U+\" \");System.err.println(\"\");}}\r\n\tstatic void log(int[] X){if (verb) {for (int U:X) System.err.print(U+\" \");System.err.println(\"\");}}\r\n\tstatic void log(int[] X,int L){if (verb) {for (int i=0;i<L;i++) System.err.print(X[i]+\" \");System.err.println(\"\");}}\r\n\tstatic void log(long[] X){if (verb) {for (long U:X) System.err.print(U+\" \");System.err.println(\"\");}}\r\n\r\n\tstatic InputReader reader;\r\n\r\n\r\n\tstatic class Composite {\r\n\t\tint msk;\r\n\t\tint cost;\r\n\r\n\t\tComposite left;\r\n\t\tComposite right;\r\n\r\n\r\n\r\n\t}\r\n\r\n\r\n\tstatic String name(int w) {\r\n\t\tint it=0;\r\n\t\tString s=\"key:[\";\r\n\t\twhile (w>0) {\r\n\t\t\tif ((w&1)!=0) {\r\n\t\t\t\ts+=(it+1)+\" \";\r\n\t\t\t}\r\n\t\t\tw>>=1;\r\n\t\t\tit++;\r\n\t\t}\r\n\t\treturn s+\"]\";\r\n\t}\r\n\t\r\n\tstatic\tint FX=Integer.MAX_VALUE;\r\n\tstatic int solveAlt(int[] a,int[] b,int[][] c) {\r\n\t\tint n=a.length;\r\n\t\tint m=b.length;\r\n\t\tint MX=1<<m;\r\n\r\n\t\tint tot=0;\r\n\t\tfor (int i=0;i<n;i++)\r\n\t\t\ttot+=a[i];\r\n\t\tint bob=0;\r\n\t\tfor (int j=0;j<m;j++)\r\n\t\t\tbob+=b[j];\r\n\t\tif (tot>bob)\r\n\t\t\treturn -1;\r\n\r\n\r\n\t\tint[][] cost=new int[n][MX];\r\n\t\tint[] bill=new int[MX];\r\n\r\n\t\tfor (int w=0;w<MX;w++)\r\n\t\t\tfor (int j=0;j<m;j++)\r\n\t\t\t\tif (((1<<j)&w)!=0) {\r\n\t\t\t\t\tbill[w]+=b[j];\r\n\t\t\t\t\tfor (int i=0;i<n;i++)\r\n\t\t\t\t\t\tcost[i][w]+=c[i][j];\r\n\t\t\t\t}\r\n\r\n\r\n\r\n\r\n\t\tint[] stack=new int[n];\r\n\t\tint[] ptr=new int[n];\r\n\t\tArrays.fill(ptr, 1);\r\n\t\tint best=FX;\r\n\t\tint st=0;\r\n\t\tint[] curspend=new int[n];\r\n\t\t\r\n\t\twhile (st>=0) {\r\n\t\t\tif (ptr[st]<MX) {\r\n\t\t\t\tint w=ptr[st]++;\r\n\t\t\t\tint spend=0;\r\n\t\t\t\tif (st>0)\r\n\t\t\t\t\tspend=curspend[st-1];\r\n\t\t\t\t//log(\"trying :\"+name(w)+\" at pos:\"+st);\r\n\t\t\t\t//log((bill[w]-a[st])+\" \"+(spend+cost[st][w])+\" vs \"+best);\r\n\t\t\t\tif (bill[w]>=a[st] && spend+cost[st][w]<best) {\r\n\t\t\t\t\t// now check all the previous ones\r\n\t\t\t\t\tint TX=1<<st;\r\n\t\t\t\t\tboolean ok=true;\r\n\t\t\t\t\tfor (int z=1;z<TX;z++) {\r\n\t\t\t\t\t\tint gain=a[st];\r\n\t\t\t\t\t\tint msk=w;\r\n\t\t\t\t\t\tfor (int j=0;j<st;j++) {\r\n\t\t\t\t\t\t\tif ((z&(1<<j))!=0) {\r\n\t\t\t\t\t\t\t\tmsk|=stack[j];\r\n\t\t\t\t\t\t\t\tgain+=a[j];\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tif (gain>bill[msk]) {\r\n\t\t\t\t\t\t\tok=false;\r\n\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif (ok) {\r\n\t\t\t\t\t\tspend+=cost[st][w];\r\n\t\t\t\t\t\tcurspend[st]=spend;\r\n\t\t\t\t\t\tif (st==n-1) {\r\n\t\t\t\t\t\t\t//log(\"this is ok\");\r\n\t\t\t\t\t\t\tstack[st]=w;\r\n\t\t\t\t\t\t\t//for (int x:stack) {\r\n\t\t\t\t\t\t\t//\tlog(name(x));\r\n\t\t\t\t\t\t\t//}\r\n\t\t\t\t\t\t\tbest=spend;\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\tstack[st++]=w;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t}\r\n\t\t\t} else {\r\n\t\t\t\tptr[st]=1;\r\n\t\t\t\tst--;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\r\n\t\tif (best==FX)\r\n\t\t\tbest=-1;\r\n\t\treturn best;\r\n\r\n\r\n\r\n\t}\r\n\tstatic int solveKO(int[] a,int[] b,int[][] c) {\r\n\t\tint n=a.length;\r\n\t\tint m=b.length;\r\n\t\tint MX=1<<m;\r\n\r\n\t\tint[][] cost=new int[n][MX];\r\n\t\tint[] bill=new int[MX];\r\n\r\n\t\tfor (int w=0;w<MX;w++)\r\n\t\t\tfor (int j=0;j<m;j++)\r\n\t\t\t\tif (((1<<j)&w)!=0) {\r\n\t\t\t\t\tbill[w]+=b[j];\r\n\t\t\t\t\tfor (int i=0;i<n;i++)\r\n\t\t\t\t\t\tcost[i][w]+=c[i][j];\r\n\t\t\t\t}\r\n\r\n\r\n\t\tint VX=m*4+1;\r\n\t\tint[][] spend=new int[MX][VX];\r\n\r\n\t\tfor (int w=0;w<MX;w++) {\r\n\t\t\tArrays.fill(spend[w], FX);\r\n\t\t\tif (bill[w]>=a[0]) {\r\n\t\t\t\t// ok for me\r\n\t\t\t\t// now we look at the previous\r\n\t\t\t\tspend[w][bill[w]-a[0]]=cost[0][w];\r\n\t\t\t\t//log(\"adding:\"+w);\r\n\t\t\t}\r\n\t\t}\r\n\r\n\r\n\r\n\t\t// this is taking some shortcut...\r\n\r\n\t\tfor (int i=1;i<n;i++) {\r\n\t\t\tint[][] nxt=new int[MX][VX];\r\n\t\t\tfor (int w=0;w<MX;w++)\r\n\t\t\t\tArrays.fill(nxt[w],FX);\r\n\t\t\tfor (int w=0;w<MX;w++) {\r\n\t\t\t\tif (bill[w]>=a[i]) {\r\n\t\t\t\t\t//log(\"considering:\"+w);\r\n\t\t\t\t\t// ok for me\r\n\t\t\t\t\t// now we look at the previous\r\n\t\t\t\t\tfor (int u=0;u<MX;u++)\r\n\t\t\t\t\t\tfor (int v=0;v<VX;v++) {\r\n\t\t\t\t\t\t\tif (spend[u][v]<FX) {\r\n\t\t\t\t\t\t\t\t//log(\"----interested by u:\"+u);\r\n\t\t\t\t\t\t\t\tint nu=u|w;\r\n\t\t\t\t\t\t\t\tint nv=v+bill[w]-bill[w&u]-a[i];\r\n\t\t\t\t\t\t\t\t//log(\"nv:\"+nv);\r\n\t\t\t\t\t\t\t\tif (nv>=0) {\r\n\t\t\t\t\t\t\t\t\t//log(\"----merging\");\r\n\t\t\t\t\t\t\t\t\tnxt[nu][nv]=Math.min(spend[u][v]+cost[i][w], nxt[nu][nv]);\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\t\t\t\t}\r\n\r\n\t\t\t}\r\n\t\t\tspend=nxt;\r\n\t\t}\r\n\t\tint ans=FX;\r\n\t\tfor (int w=0;w<MX;w++)\r\n\t\t\tfor (int v=0;v<VX;v++)\r\n\t\t\t\tans=Math.min(ans, spend[w][v]);\r\n\r\n\t\tif (ans==FX)\r\n\t\t\tans=-1;\r\n\t\treturn ans;\r\n\t}\r\n\r\n\tpublic static void main(String[] args) throws Exception {\r\n\r\n\t\treader=new InputReader(System.in);\r\n\t\tint n=reader.readInt();\r\n\t\tint m=reader.readInt();\r\n\t\tint[] a=new int[n];\r\n\t\tint tot=0;\r\n\t\tfor (int i=0;i<n;i++) {\r\n\t\t\ta[i]=reader.readInt();\r\n\t\t\ttot+=a[i];\r\n\t\t}\r\n\t\tint[] b=new int[m];\r\n\t\tfor (int i=0;i<m;i++)\r\n\t\t\tb[i]=reader.readInt();\r\n\r\n\t\tint[][] c=new int[n][m];\r\n\t\tfor (int i=0;i<n;i++)\r\n\t\t\tfor (int j=0;j<m;j++)\r\n\t\t\t\tc[i][j]=reader.readInt();\r\n\r\n\r\n\t\tint ans=solveAlt(a,b,c);\r\n\r\n\t\tSystem.out.println(ans);\r\n\r\n\r\n\r\n\r\n\t}\r\n\r\n\r\n\tstatic final class InputReader {\r\n\t\tprivate final InputStream stream;\r\n\t\tprivate final byte[] buf = new byte[1024];\r\n\t\tprivate int curChar;\r\n\t\tprivate int numChars;\r\n\r\n\t\tpublic InputReader(InputStream stream) {\r\n\t\t\tthis.stream = stream;\r\n\t\t}\r\n\r\n\t\tprivate int read() throws IOException {\r\n\t\t\tif (curChar >= numChars) {\r\n\t\t\t\tcurChar = 0;\r\n\t\t\t\tnumChars = stream.read(buf);\r\n\t\t\t\tif (numChars <= 0) {\r\n\t\t\t\t\treturn -1;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\treturn buf[curChar++];\r\n\t\t}\r\n\r\n\r\n\t\tpublic final String readString() throws IOException {\r\n\t\t\tint c = read();\r\n\t\t\twhile (isSpaceChar(c)) {\r\n\t\t\t\tc = read();\r\n\t\t\t}\r\n\t\t\tStringBuilder res=new StringBuilder();\r\n\t\t\tdo {\r\n\t\t\t\tres.append((char)c);\r\n\t\t\t\tc = read();\r\n\t\t\t} while (!isSpaceChar(c));\r\n\t\t\treturn res.toString();\r\n\t\t}\r\n\r\n\t\tpublic final int readInt() throws IOException {\r\n\t\t\tint c = read();\r\n\t\t\tboolean neg=false;\r\n\t\t\twhile (isSpaceChar(c)) {\r\n\t\t\t\tc = read();\r\n\t\t\t}\r\n\t\t\tchar d=(char)c;\r\n\t\t\t//log(\"d:\"+d);\r\n\t\t\tif (d=='-') {\r\n\t\t\t\tneg=true;\r\n\t\t\t\tc = read();\r\n\t\t\t}\r\n\t\t\tint res = 0;\r\n\t\t\tdo {\r\n\t\t\t\tres *= 10;\r\n\t\t\t\tres += c - '0';\r\n\t\t\t\tc = read();\r\n\t\t\t} while (!isSpaceChar(c));\r\n\t\t\t//log(\"res:\"+res);\r\n\t\t\tif (neg)\r\n\t\t\t\treturn -res;\r\n\t\t\treturn res;\r\n\r\n\t\t}\r\n\r\n\t\tpublic final long readLong() throws IOException {\r\n\t\t\tint c = read();\r\n\t\t\tboolean neg=false;\r\n\t\t\twhile (isSpaceChar(c)) {\r\n\t\t\t\tc = read();\r\n\t\t\t}\r\n\t\t\tchar d=(char)c;\r\n\t\t\t//log(\"d:\"+d);\r\n\t\t\tif (d=='-') {\r\n\t\t\t\tneg=true;\r\n\t\t\t\tc = read();\r\n\t\t\t}\r\n\t\t\tlong res = 0;\r\n\t\t\tdo {\r\n\t\t\t\tres *= 10;\r\n\t\t\t\tres += c - '0';\r\n\t\t\t\tc = read();\r\n\t\t\t} while (!isSpaceChar(c));\r\n\t\t\t//log(\"res:\"+res);\r\n\t\t\tif (neg)\r\n\t\t\t\treturn -res;\r\n\t\t\treturn res;\r\n\r\n\t\t}\r\n\r\n\r\n\r\n\t\tprivate boolean isSpaceChar(int c) {\r\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\r\n\t\t}\r\n\t}\r\n}\r\n", "lang_cluster": "Java", "tags": ["brute force", "dfs and similar", "flows", "dp", "bitmasks"], "code_uid": "582e65e1b226f455073682ba6ba08a74", "src_uid": "4dc5dc78bda59c1ec6dd8acd6f1d7333", "difficulty": 3200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Codeforces933D {\n\tpublic static void main(String[] args) throws IOException {\n\t\t// TODO Auto-generated method stub\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st = new StringTokenizer(br.readLine());\n\t\tlong n = Long.parseLong(st.nextToken());\n\t\t\n\t\tint counter = 0;\n\t\tint N = 1000000007;\n\t\t\n\t\tfor (int i = 0; i < 500000; i++) {\n\t\t\tcounter += firstsum(n, 4*i+1);\n\t\t\tcounter -= firstsum(n, 4*i+3);\n\t\t\tcounter %= N;\n\t\t}\n\t\t\n\t\tfor (int b = 1; b <= n/2000000; b++) {\n\t\t\tcounter += secondsum(n, b);\n\t\t\tcounter %= N;\n\t\t}\n\t\t\t\t\n\t\tint ans = (2*((2*counter)%N))%N;\n\t\tlong k = ((((((n%N)*(n%N+1))%N)*(n%N+2))%N)*166666668)%N;\n\t\tans = (ans + (int) k)%N;\n\t\tSystem.out.println(ans);\n\t}\n\t\n\t//1/2 = 500000004\n\t//1/3 = 333333336\n\t//1/6 = 166666668\n\t//lmao\n\tpublic static int firstsum(long n, long q) {\n\t\tint N = 1000000007;\n\t\tlong floornq = (n/q)%N;\n\t\tn %= N;\n\t\tq %= N;\n\t\tlong sum = ((floornq*(floornq+1))/2)%N;\n\t\tlong sumsquare = (((sum*(2*floornq+1))%N)*333333336)%N;\n\t\tlong sumcube = (sum*sum)%N;\n\t\tlong nsquare = (n*n)%N;\n\t\tlong qsquare = (q*q)%N;\n\t\tlong qcube = (q*qsquare)%N;\n\t\t\n\t\tlong k1 = (nsquare*floornq - qsquare*sumsquare + n*floornq + q*sum)%N;\n\t\tif (k1 < 0)\n\t\t\tk1 += N;\n\t\tk1 = (k1*(n+1))%N;\n\t\tk1 = (k1*500000004)%N;\n\t\t\n\t\tlong k2 = (((((n*(n+1))%N)*(2*n+1))%N)*166666668)%N;\n\t\tk2 = (k2*floornq)%N;\n\t\t\n\t\tlong k3 = (((qcube*sumcube)%N)*333333336)%N;\n\t\tk3 -= (((qsquare*sumsquare)%N)*500000004)%N;\n\t\tk3 += (((q*sum)%N)*166666668)%N;\n\t\t\n\t\tlong ans = (k1-k2+k3)%N;\n\t\tif (ans < 0)\n\t\t\tans += N;\n\t\treturn (int) ans;\n\t}\n\t\n\t//wtf who successfully codes this up in a real round?\n\tpublic static int secondsum(long n, long b) {\n\t\tint N = 1000000007;\n\t\tlong bsquare = (b*b)%N;\n\t\tlong bcube = (b*bsquare)%N;\n\t\tlong max = (n/(4*b)-1)%N;\n\t\tlong numk = (max + N + 1 - 500000)%N;\n\t\tlong sumk = ((max)*(max+1)/2 + 250875)%N;\n\t\tlong sumksquare = ((((long) max * (long) (max+1))%N * (long) (2*max + 1))%N * 166666668)%N-375084213;\n\t\tif (sumksquare < 0)\n\t\t\tsumksquare += N;\n\t\t\t\t\n\t\tlong k1 = (((bcube*sumksquare)%N)*32)%N;\n\t\tlong k2 = (((bsquare*sumk)%N * (4*b-1)%N)%N *8)%N;\n\t\tlong k3 = ((26*bcube - 12*bsquare + b)%N * 333333336)%N;\n\t\tif (k3 < 0)\n\t\t\tk3 += N;\n\t\tk3 = (k3*numk)%N;\n\t\tlong k4 = (((n+1)%N)*(b*(numk*(((4*b*500000 + 4*b*max)+4*b-1)%N)%N)%N))%N;\n\t\t\n\t\tlong k5 = 0;\n\t\tlong k6 = 0;\n\t\t\n\t\tif (n%(4*b) >= b) {\n\t\t\tlong min2 = ((4*b)*(n/(4*b))+b)%N;\n\t\t\tlong max2 = (Math.min((4*b)*(n/(4*b))+3*b-1, n))%N;\n\t\t\t//sum from min2 to max2 of (n+1-i)*i\n\t\t\tk5 = (((((max2*(max2+1))%N)*(2*max2+1))%N)*166666668)%N;\n\t\t\tk5 -= (((((((min2-1)*min2)%N)*(2*min2-1))%N)*166666668)%N);\n\t\t\tk6 = ((max2*(max2+1) - min2*(min2-1))/2)%N;\n\t\t\tk6 = (k6*((n+1)%N))%N;\n\t\t}\n\t\t\t\t\n\t\treturn (int) ((k4-k1-k2-k3-k5+k6+7*(long)N)%N);\n\t}\n\t\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math", "combinatorics"], "code_uid": "0b32c61b8f55e4bb834a8887cb21ade2", "src_uid": "b9a785849e5ffadb24b58b38b1f2ee48", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.math.*;\nimport java.util.*;\n\npublic class Main {\n static int MOD = (int)1e9 + 7;\n\n public void run() {\n try {\n int n = reader.nextInt();\n int m = reader.nextInt();\n int[] pow = new int[n + 1];\n pow[0] = 1;\n for (int i = 1; i <= n; ++ i) {\n pow[i] = (pow[i - 1] << 1) % MOD;\n }\n int[][] ways = new int[m + 1][1];\n ways[0][0] = 1;\n for (int i = 0; i < n; ++ i) {\n int[][] newWays = new int[m + 1][i + 2];\n for (int maximum = 0; maximum <= m && maximum <= i; ++ maximum) {\n for (int last = 0; last <= i; ++ last) {\n long value = ways[maximum][last];\n newWays[maximum][last] = add(newWays[maximum][last], (int)value);\n newWays[maximum][last] = add(newWays[maximum][last], (int)(value * (pow[last] - 1) % MOD));\n if (maximum + 1 <= m) {\n newWays[maximum + 1][i + 1] = add(newWays[maximum + 1][i + 1], (int)(value * (pow[i + 1] - pow[last]) % MOD));\n }\n }\n }\n ways = newWays;\n }\n int result = 0;\n for (int last = 0; last <= n; ++ last) {\n result = add(result, ways[m][last]);\n }\n writer.println(result);\n } catch (IOException ex) {\n }\n writer.close();\n }\n\n int add(int x, int a) {\n if (a < 0) {\n a += MOD;\n }\n x += a;\n if (x >= MOD) {\n x -= MOD;\n }\n return x;\n }\n\n Main() {\n reader = new InputReader(System.in);\n writer = new PrintWriter(System.out);\n }\n\n public static void main(String[] args) {\n new Main().run();\n }\n\n private void debug(Object...os) {\n System.err.println(Arrays.deepToString(os));\n }\n\n private InputReader reader;\n private PrintWriter writer;\n}\n\nclass InputReader {\n InputReader(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n tokenizer = new StringTokenizer(\"\");\n }\n\n private String next() throws IOException {\n while (!tokenizer.hasMoreTokens()) {\n tokenizer = new StringTokenizer(reader.readLine());\n }\n return tokenizer.nextToken();\n }\n\n public Integer nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n private BufferedReader reader;\n private StringTokenizer tokenizer;\n}\n", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "995bd5b8c50e33286c45e735d3cb9107", "src_uid": "111673158df2e37ac6c019bb99225ccb", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\nimport java.util.function.BiConsumer;\nimport java.util.function.Consumer;\nimport java.util.function.Function;\nimport java.util.function.Supplier;\nimport java.util.stream.Stream;\n\npublic class E_440\n{\n\tpublic static final long[] POWER2 = generatePOWER2();\n\tpublic static final IteratorBuffer<Long> ITERATOR_BUFFER_PRIME = new IteratorBuffer<>(streamPrime(1000000).iterator());\n\tprivate static BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));\n\tprivate static StringTokenizer stringTokenizer = null;\n\tprivate static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));\n\n\tpublic static void add(int delta, int[] result)\n\t{\n\t\tfor (int index = 0; index < result.length; index++)\n\t\t{\n\t\t\tresult[index] += delta;\n\t\t}\n\t}\n\n\tpublic static void add(int delta, int[]... result)\n\t{\n\t\tfor (int index = 0; index < result.length; index++)\n\t\t{\n\t\t\tadd(delta, result[index]);\n\t\t}\n\t}\n\n\tpublic static int binarySearchMaximum(Function<Integer, Boolean> filter, int start, int end)\n\t{\n\t\treturn -binarySearchMinimum(x -> filter.apply(-x), -end, -start);\n\t}\n\n\tpublic static int binarySearchMinimum(Function<Integer, Boolean> filter, int start, int end)\n\t{\n\t\tint result;\n\t\tif (start == end)\n\t\t{\n\t\t\tresult = end;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tint middle = start + (end - start) / 2;\n\t\t\tif (filter.apply(middle))\n\t\t\t{\n\t\t\t\tresult = binarySearchMinimum(filter, start, middle);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tresult = binarySearchMinimum(filter, middle + 1, end);\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static void close()\n\t{\n\t\tout.close();\n\t}\n\n\tpublic static List<List<Integer>> combinations(int n, int k)\n\t{\n\t\tList<List<Integer>> result = new ArrayList<>();\n\t\tif (k == 0)\n\t\t{\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif (k == 1)\n\t\t\t{\n\t\t\t\tList<Integer> combination = new ArrayList<>();\n\t\t\t\tcombination.add(n);\n\t\t\t\tresult.add(combination);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tfor (int index = 0; index <= n; index++)\n\t\t\t\t{\n\t\t\t\t\tfor (List<Integer> combination : combinations(n - index, k - 1))\n\t\t\t\t\t{\n\t\t\t\t\t\tcombination.add(index);\n\t\t\t\t\t\tresult.add(combination);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static <Type> int compare(Iterator<Type> iterator0, Iterator<Type> iterator1, Comparator<Type> comparator)\n\t{\n\t\tint result = 0;\n\t\twhile (result == 0 && iterator0.hasNext() && iterator1.hasNext())\n\t\t{\n\t\t\tresult = comparator.compare(iterator0.next(), iterator1.next());\n\t\t}\n\t\tif (result == 0)\n\t\t{\n\t\t\tif (iterator1.hasNext())\n\t\t\t{\n\t\t\t\tresult = -1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tif (iterator0.hasNext())\n\t\t\t\t{\n\t\t\t\t\tresult = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static <Type> int compare(Iterable<Type> iterable0, Iterable<Type> iterable1, Comparator<Type> comparator)\n\t{\n\t\treturn compare(iterable0.iterator(), iterable1.iterator(), comparator);\n\t}\n\n\tpublic static long divideCeil(long x, long y)\n\t{\n\t\treturn (x + y - 1) / y;\n\t}\n\n\tpublic static Set<Long> divisors(long n)\n\t{\n\t\tSortedSetAVL<Long> result = new SortedSetAVL<>(Comparator.naturalOrder());\n\t\tresult.add(1L);\n\t\tfor (Long factor : factors(n))\n\t\t{\n\t\t\tSortedSetAVL<Long> divisors = new SortedSetAVL<>(result);\n\t\t\tfor (Long divisor : result)\n\t\t\t{\n\t\t\t\tdivisors.add(divisor * factor);\n\t\t\t}\n\t\t\tresult = divisors;\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static LinkedList<Long> factors(long n)\n\t{\n\t\tLinkedList<Long> result = new LinkedList<>();\n\t\tIterator<Long> primes = ITERATOR_BUFFER_PRIME.iterator();\n\t\tLong prime;\n\t\twhile (n > 1 && (prime = primes.next()) * prime <= n)\n\t\t{\n\t\t\twhile (n % prime == 0)\n\t\t\t{\n\t\t\t\tresult.add(prime);\n\t\t\t\tn /= prime;\n\t\t\t}\n\t\t}\n\t\tif (n > 1)\n\t\t{\n\t\t\tresult.add(n);\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static long faculty(int n)\n\t{\n\t\tlong result = 1;\n\t\tfor (int index = 2; index <= n; index++)\n\t\t{\n\t\t\tresult *= index;\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static long gcd(long a, long b)\n\t{\n\t\twhile (a != 0 && b != 0)\n\t\t{\n\t\t\tif (a > b)\n\t\t\t{\n\t\t\t\ta %= b;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tb %= a;\n\t\t\t}\n\t\t}\n\t\treturn a + b;\n\t}\n\n\tpublic static long[] generatePOWER2()\n\t{\n\t\tlong[] result = new long[63];\n\t\tfor (int x = 0; x < result.length; x++)\n\t\t{\n\t\t\tresult[x] = 1L << x;\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static boolean isPrime(long x)\n\t{\n\t\tboolean result = x > 1;\n\t\tIterator<Long> iterator = ITERATOR_BUFFER_PRIME.iterator();\n\t\tLong prime;\n\t\twhile ((prime = iterator.next()) * prime <= x)\n\t\t{\n\t\t\tresult &= x % prime > 0;\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static long knapsack(List<Tuple3<Long, Integer, Integer>> itemsValueWeightCount, int weightMaximum)\n\t{\n\t\tlong[] valuesMaximum = new long[weightMaximum + 1];\n\t\tfor (Tuple3<Long, Integer, Integer> itemValueWeightCount : itemsValueWeightCount)\n\t\t{\n\t\t\tlong itemValue = itemValueWeightCount.v0;\n\t\t\tint itemWeight = itemValueWeightCount.v1;\n\t\t\tint itemCount = itemValueWeightCount.v2;\n\t\t\tfor (int weight = weightMaximum; 0 <= weight; weight--)\n\t\t\t{\n\t\t\t\tfor (int index = 1; index <= itemCount && 0 <= weight - index * itemWeight; index++)\n\t\t\t\t{\n\t\t\t\t\tvaluesMaximum[weight] = Math.max(valuesMaximum[weight], valuesMaximum[weight - index * itemWeight] + index * itemValue);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tlong result = 0;\n\t\tfor (long valueMaximum : valuesMaximum)\n\t\t{\n\t\t\tresult = Math.max(result, valueMaximum);\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static boolean knapsackPossible(List<Tuple2<Integer, Integer>> itemsWeightCount, int weightMaximum)\n\t{\n\t\tboolean[] weightPossible = new boolean[weightMaximum + 1];\n\t\tweightPossible[0] = true;\n\t\tint weightLargest = 0;\n\t\tfor (Tuple2<Integer, Integer> itemWeightCount : itemsWeightCount)\n\t\t{\n\t\t\tint itemWeight = itemWeightCount.v0;\n\t\t\tint itemCount = itemWeightCount.v1;\n\t\t\tfor (int weightStart = 0; weightStart < itemWeight; weightStart++)\n\t\t\t{\n\t\t\t\tint count = 0;\n\t\t\t\tfor (int weight = weightStart; weight <= weightMaximum && (0 < count || weight <= weightLargest); weight += itemWeight)\n\t\t\t\t{\n\t\t\t\t\tif (weightPossible[weight])\n\t\t\t\t\t{\n\t\t\t\t\t\tcount = itemCount;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tif (0 < count)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tweightPossible[weight] = true;\n\t\t\t\t\t\t\tweightLargest = weight;\n\t\t\t\t\t\t\tcount -= 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn weightPossible[weightMaximum];\n\t}\n\n\tpublic static long lcm(int a, int b)\n\t{\n\t\treturn a * b / gcd(a, b);\n\t}\n\n\tpublic static void main(String[] args)\n\t{\n\t\ttry\n\t\t{\n\t\t\tsolve();\n\t\t}\n\t\tcatch (IOException exception)\n\t\t{\n\t\t\texception.printStackTrace();\n\t\t}\n\t\tclose();\n\t}\n\n\tpublic static double nextDouble() throws IOException\n\t{\n\t\treturn Double.parseDouble(nextString());\n\t}\n\n\tpublic static int nextInt() throws IOException\n\t{\n\t\treturn Integer.parseInt(nextString());\n\t}\n\n\tpublic static void nextInts(int n, int[]... result) throws IOException\n\t{\n\t\tfor (int index = 0; index < n; index++)\n\t\t{\n\t\t\tfor (int value = 0; value < result.length; value++)\n\t\t\t{\n\t\t\t\tresult[value][index] = nextInt();\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic static int[] nextInts(int n) throws IOException\n\t{\n\t\tint[] result = new int[n];\n\t\tnextInts(n, result);\n\t\treturn result;\n\t}\n\n\tpublic static String nextLine() throws IOException\n\t{\n\t\treturn bufferedReader.readLine();\n\t}\n\n\tpublic static long nextLong() throws IOException\n\t{\n\t\treturn Long.parseLong(nextString());\n\t}\n\n\tpublic static void nextLongs(int n, long[]... result) throws IOException\n\t{\n\t\tfor (int index = 0; index < n; index++)\n\t\t{\n\t\t\tfor (int value = 0; value < result.length; value++)\n\t\t\t{\n\t\t\t\tresult[value][index] = nextLong();\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic static long[] nextLongs(int n) throws IOException\n\t{\n\t\tlong[] result = new long[n];\n\t\tnextLongs(n, result);\n\t\treturn result;\n\t}\n\n\tpublic static String nextString() throws IOException\n\t{\n\t\twhile ((stringTokenizer == null) || (!stringTokenizer.hasMoreTokens()))\n\t\t{\n\t\t\tstringTokenizer = new StringTokenizer(bufferedReader.readLine());\n\t\t}\n\t\treturn stringTokenizer.nextToken();\n\t}\n\n\tpublic static String[] nextStrings(int n) throws IOException\n\t{\n\t\tString[] result = new String[n];\n\t\t{\n\t\t\tfor (int index = 0; index < n; index++)\n\t\t\t{\n\t\t\t\tresult[index] = nextString();\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static <T> List<T> permutation(long p, List<T> x)\n\t{\n\t\tList<T> copy = new ArrayList<>();\n\t\tfor (int index = 0; index < x.size(); index++)\n\t\t{\n\t\t\tcopy.add(x.get(index));\n\t\t}\n\t\tList<T> result = new ArrayList<>();\n\t\tfor (int indexTo = 0; indexTo < x.size(); indexTo++)\n\t\t{\n\t\t\tint indexFrom = (int) p % copy.size();\n\t\t\tp = p / copy.size();\n\t\t\tresult.add(copy.remove(indexFrom));\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static <Type> List<List<Type>> permutations(List<Type> list)\n\t{\n\t\tList<List<Type>> result = new ArrayList<>();\n\t\tresult.add(new ArrayList<>());\n\t\tfor (Type element : list)\n\t\t{\n\t\t\tList<List<Type>> permutations = result;\n\t\t\tresult = new ArrayList<>();\n\t\t\tfor (List<Type> permutation : permutations)\n\t\t\t{\n\t\t\t\tfor (int index = 0; index <= permutation.size(); index++)\n\t\t\t\t{\n\t\t\t\t\tList<Type> permutationNew = new ArrayList<>(permutation);\n\t\t\t\t\tpermutationNew.add(index, element);\n\t\t\t\t\tresult.add(permutationNew);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static Stream<BigInteger> streamFibonacci()\n\t{\n\t\treturn Stream.generate(new Supplier<BigInteger>()\n\t\t{\n\t\t\tprivate BigInteger n0 = BigInteger.ZERO;\n\t\t\tprivate BigInteger n1 = BigInteger.ONE;\n\n\t\t\t@Override\n\t\t\tpublic BigInteger get()\n\t\t\t{\n\t\t\t\tBigInteger result = n0;\n\t\t\t\tn0 = n1;\n\t\t\t\tn1 = result.add(n0);\n\t\t\t\treturn result;\n\t\t\t}\n\t\t});\n\t}\n\n\tpublic static Stream<Long> streamPrime(int sieveSize)\n\t{\n\t\treturn Stream.generate(new Supplier<Long>()\n\t\t{\n\t\t\tprivate boolean[] isPrime = new boolean[sieveSize];\n\t\t\tprivate long sieveOffset = 2;\n\t\t\tprivate List<Long> primes = new ArrayList<>();\n\t\t\tprivate int index = 0;\n\n\t\t\tpublic void filter(long prime, boolean[] result)\n\t\t\t{\n\t\t\t\tif (prime * prime < this.sieveOffset + sieveSize)\n\t\t\t\t{\n\t\t\t\t\tlong remainingStart = this.sieveOffset % prime;\n\t\t\t\t\tlong start = remainingStart == 0 ? 0 : prime - remainingStart;\n\t\t\t\t\tfor (long index = start; index < sieveSize; index += prime)\n\t\t\t\t\t{\n\t\t\t\t\t\tresult[(int) index] = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tpublic void generatePrimes()\n\t\t\t{\n\t\t\t\tArrays.fill(this.isPrime, true);\n\t\t\t\tthis.primes.forEach(prime -> filter(prime, isPrime));\n\t\t\t\tfor (int index = 0; index < sieveSize; index++)\n\t\t\t\t{\n\t\t\t\t\tif (isPrime[index])\n\t\t\t\t\t{\n\t\t\t\t\t\tthis.primes.add(this.sieveOffset + index);\n\t\t\t\t\t\tfilter(this.sieveOffset + index, isPrime);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tthis.sieveOffset += sieveSize;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic Long get()\n\t\t\t{\n\t\t\t\twhile (this.primes.size() <= this.index)\n\t\t\t\t{\n\t\t\t\t\tgeneratePrimes();\n\t\t\t\t}\n\t\t\t\tLong result = this.primes.get(this.index);\n\t\t\t\tthis.index += 1;\n\t\t\t\treturn result;\n\t\t\t}\n\t\t});\n\t}\n\n\tpublic static <Type> String toString(Iterator<Type> iterator, String separator)\n\t{\n\t\tStringBuilder stringBuilder = new StringBuilder();\n\t\tif (iterator.hasNext())\n\t\t{\n\t\t\tstringBuilder.append(iterator.next());\n\t\t}\n\t\twhile (iterator.hasNext())\n\t\t{\n\t\t\tstringBuilder.append(separator);\n\t\t\tstringBuilder.append(iterator.next());\n\t\t}\n\t\treturn stringBuilder.toString();\n\t}\n\n\tpublic static <Type> String toString(Iterator<Type> iterator)\n\t{\n\t\treturn toString(iterator, \" \");\n\t}\n\n\tpublic static <Type> String toString(Iterable<Type> iterable, String separator)\n\t{\n\t\treturn toString(iterable.iterator(), separator);\n\t}\n\n\tpublic static <Type> String toString(Iterable<Type> iterable)\n\t{\n\t\treturn toString(iterable, \" \");\n\t}\n\n\tpublic static long totient(long n)\n\t{\n\t\tSet<Long> factors = new SortedSetAVL<>(factors(n), Comparator.naturalOrder());\n\t\tlong result = n;\n\t\tfor (long p : factors)\n\t\t{\n\t\t\tresult -= result / p;\n\t\t}\n\t\treturn result;\n\t}\n\n\tinterface BiFunctionResult<Type0, Type1, TypeResult>\n\t{\n\t\tTypeResult apply(Type0 x0, Type1 x1, TypeResult x2);\n\t}\n\n\tstatic class Array<Type> implements Iterable<Type>\n\t{\n\t\tprivate final Object[] array;\n\n\t\tpublic Array(int size)\n\t\t{\n\t\t\tthis.array = new Object[size];\n\t\t}\n\n\t\tpublic Array(int size, Type element)\n\t\t{\n\t\t\tthis(size);\n\t\t\tArrays.fill(this.array, element);\n\t\t}\n\n\t\tpublic Array(Array<Type> array, Type element)\n\t\t{\n\t\t\tthis(array.size() + 1);\n\t\t\tfor (int index = 0; index < array.size(); index++)\n\t\t\t{\n\t\t\t\tset(index, array.get(index));\n\t\t\t}\n\t\t\tset(size() - 1, element);\n\t\t}\n\n\t\tpublic Array(List<Type> list)\n\t\t{\n\t\t\tthis(list.size());\n\t\t\tint index = 0;\n\t\t\tfor (Type element : list)\n\t\t\t{\n\t\t\t\tset(index, element);\n\t\t\t\tindex += 1;\n\t\t\t}\n\t\t}\n\n\t\tpublic Type get(int index)\n\t\t{\n\t\t\treturn (Type) this.array[index];\n\t\t}\n\n\t\t@Override\n\t\tpublic Iterator<Type> iterator()\n\t\t{\n\t\t\treturn new Iterator<Type>()\n\t\t\t{\n\t\t\t\tint index = 0;\n\n\t\t\t\t@Override\n\t\t\t\tpublic boolean hasNext()\n\t\t\t\t{\n\t\t\t\t\treturn this.index < size();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic Type next()\n\t\t\t\t{\n\t\t\t\t\tType result = Array.this.get(index);\n\t\t\t\t\tindex += 1;\n\t\t\t\t\treturn result;\n\t\t\t\t}\n\t\t\t};\n\t\t}\n\n\t\tpublic Array set(int index, Type value)\n\t\t{\n\t\t\tthis.array[index] = value;\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic int size()\n\t\t{\n\t\t\treturn this.array.length;\n\t\t}\n\n\t\tpublic List<Type> toList()\n\t\t{\n\t\t\tList<Type> result = new ArrayList<>();\n\t\t\tfor (Type element : this)\n\t\t\t{\n\t\t\t\tresult.add(element);\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\t@Override\n\t\tpublic String toString()\n\t\t{\n\t\t\treturn \"[\" + E_440.toString(this, \", \") + \"]\";\n\t\t}\n\t}\n\n\tstatic class BIT\n\t{\n\t\tprivate final long[] tree;\n\n\t\tpublic BIT(int size)\n\t\t{\n\t\t\tthis.tree = new long[size];\n\t\t}\n\n\t\tprivate static int lastBit(int index)\n\t\t{\n\t\t\treturn index & -index;\n\t\t}\n\n\t\tpublic void add(int index, long delta)\n\t\t{\n\t\t\tindex += 1;\n\t\t\twhile (index <= this.tree.length)\n\t\t\t{\n\t\t\t\ttree[index - 1] += delta;\n\t\t\t\tindex += lastBit(index);\n\t\t\t}\n\t\t}\n\n\t\tprivate long prefix(int end)\n\t\t{\n\t\t\tlong result = 0;\n\t\t\twhile (end > 0)\n\t\t\t{\n\t\t\t\tresult += this.tree[end - 1];\n\t\t\t\tend -= lastBit(end);\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tpublic int size()\n\t\t{\n\t\t\treturn this.tree.length;\n\t\t}\n\n\t\tpublic long sum(int start, int end)\n\t\t{\n\t\t\treturn prefix(end) - prefix(start);\n\t\t}\n\t}\n\n\tstatic abstract class Edge<TypeVertex extends Vertex<TypeVertex, TypeEdge>, TypeEdge extends Edge<TypeVertex, TypeEdge>>\n\t{\n\t\tpublic final TypeVertex vertex0;\n\t\tpublic final TypeVertex vertex1;\n\t\tpublic final boolean bidirectional;\n\n\t\tpublic Edge(TypeVertex vertex0, TypeVertex vertex1, boolean bidirectional)\n\t\t{\n\t\t\tthis.vertex0 = vertex0;\n\t\t\tthis.vertex1 = vertex1;\n\t\t\tthis.bidirectional = bidirectional;\n\t\t\tthis.vertex0.edges.add(getThis());\n\t\t\tif (this.bidirectional)\n\t\t\t{\n\t\t\t\tthis.vertex1.edges.add(getThis());\n\t\t\t}\n\t\t}\n\n\t\tpublic abstract TypeEdge getThis();\n\n\t\tpublic TypeVertex other(Vertex<TypeVertex, TypeEdge> vertex)\n\t\t{\n\t\t\tTypeVertex result;\n\t\t\tif (vertex0 == vertex)\n\t\t\t{\n\t\t\t\tresult = vertex1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tresult = vertex0;\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tpublic void remove()\n\t\t{\n\t\t\tthis.vertex0.edges.remove(getThis());\n\t\t\tif (this.bidirectional)\n\t\t\t{\n\t\t\t\tthis.vertex1.edges.remove(getThis());\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tpublic String toString()\n\t\t{\n\t\t\treturn this.vertex0 + \"->\" + this.vertex1;\n\t\t}\n\t}\n\n\tpublic static class EdgeDefault<TypeVertex extends Vertex<TypeVertex, EdgeDefault<TypeVertex>>> extends Edge<TypeVertex, EdgeDefault<TypeVertex>>\n\t{\n\t\tpublic EdgeDefault(TypeVertex vertex0, TypeVertex vertex1, boolean bidirectional)\n\t\t{\n\t\t\tsuper(vertex0, vertex1, bidirectional);\n\t\t}\n\n\t\t@Override\n\t\tpublic EdgeDefault<TypeVertex> getThis()\n\t\t{\n\t\t\treturn this;\n\t\t}\n\t}\n\n\tpublic static class EdgeDefaultDefault extends Edge<VertexDefaultDefault, EdgeDefaultDefault>\n\t{\n\t\tpublic EdgeDefaultDefault(VertexDefaultDefault vertex0, VertexDefaultDefault vertex1, boolean bidirectional)\n\t\t{\n\t\t\tsuper(vertex0, vertex1, bidirectional);\n\t\t}\n\n\t\t@Override\n\t\tpublic EdgeDefaultDefault getThis()\n\t\t{\n\t\t\treturn this;\n\t\t}\n\t}\n\n\tpublic static class FIFO<Type>\n\t{\n\t\tpublic SingleLinkedList<Type> start;\n\t\tpublic SingleLinkedList<Type> end;\n\n\t\tpublic FIFO()\n\t\t{\n\t\t\tthis.start = null;\n\t\t\tthis.end = null;\n\t\t}\n\n\t\tpublic boolean isEmpty()\n\t\t{\n\t\t\treturn this.start == null;\n\t\t}\n\n\t\tpublic Type peek()\n\t\t{\n\t\t\treturn this.start.element;\n\t\t}\n\n\t\tpublic Type pop()\n\t\t{\n\t\t\tType result = this.start.element;\n\t\t\tthis.start = this.start.next;\n\t\t\treturn result;\n\t\t}\n\n\t\tpublic void push(Type element)\n\t\t{\n\t\t\tSingleLinkedList<Type> list = new SingleLinkedList<>(element, null);\n\t\t\tif (this.start == null)\n\t\t\t{\n\t\t\t\tthis.start = list;\n\t\t\t\tthis.end = list;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tthis.end.next = list;\n\t\t\t\tthis.end = list;\n\t\t\t}\n\t\t}\n\t}\n\n\tstatic class Fraction implements Comparable<Fraction>\n\t{\n\t\tpublic static final Fraction ZERO = new Fraction(0, 1);\n\t\tpublic final long numerator;\n\t\tpublic final long denominator;\n\n\t\tprivate Fraction(long numerator, long denominator)\n\t\t{\n\t\t\tthis.numerator = numerator;\n\t\t\tthis.denominator = denominator;\n\t\t}\n\n\t\tpublic static Fraction fraction(long whole)\n\t\t{\n\t\t\treturn fraction(whole, 1);\n\t\t}\n\n\t\tpublic static Fraction fraction(long numerator, long denominator)\n\t\t{\n\t\t\tFraction result;\n\t\t\tif (denominator == 0)\n\t\t\t{\n\t\t\t\tthrow new ArithmeticException();\n\t\t\t}\n\t\t\tif (numerator == 0)\n\t\t\t{\n\t\t\t\tresult = Fraction.ZERO;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tint sign;\n\t\t\t\tif (numerator < 0 ^ denominator < 0)\n\t\t\t\t{\n\t\t\t\t\tsign = -1;\n\t\t\t\t\tnumerator = Math.abs(numerator);\n\t\t\t\t\tdenominator = Math.abs(denominator);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tsign = 1;\n\t\t\t\t}\n\t\t\t\tlong gcd = gcd(numerator, denominator);\n\t\t\t\tresult = new Fraction(sign * numerator / gcd, denominator / gcd);\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tpublic Fraction add(Fraction fraction)\n\t\t{\n\t\t\treturn fraction(this.numerator * fraction.denominator + fraction.numerator * this.denominator, this.denominator * fraction.denominator);\n\t\t}\n\n\t\t@Override\n\t\tpublic int compareTo(Fraction that)\n\t\t{\n\t\t\treturn Long.compare(this.numerator * that.denominator, that.numerator * this.denominator);\n\t\t}\n\n\t\tpublic Fraction divide(Fraction fraction)\n\t\t{\n\t\t\treturn multiply(fraction.inverse());\n\t\t}\n\n\t\tpublic boolean equals(Fraction that)\n\t\t{\n\t\t\treturn this.compareTo(that) == 0;\n\t\t}\n\n\t\tpublic boolean equals(Object that)\n\t\t{\n\t\t\treturn this.compareTo((Fraction) that) == 0;\n\t\t}\n\n\t\tpublic Fraction getRemainder()\n\t\t{\n\t\t\treturn fraction(this.numerator - getWholePart() * denominator, denominator);\n\t\t}\n\n\t\tpublic long getWholePart()\n\t\t{\n\t\t\treturn this.numerator / this.denominator;\n\t\t}\n\n\t\tpublic Fraction inverse()\n\t\t{\n\t\t\treturn fraction(this.denominator, this.numerator);\n\t\t}\n\n\t\tpublic Fraction multiply(Fraction fraction)\n\t\t{\n\t\t\treturn fraction(this.numerator * fraction.numerator, this.denominator * fraction.denominator);\n\t\t}\n\n\t\tpublic Fraction neg()\n\t\t{\n\t\t\treturn fraction(-this.numerator, this.denominator);\n\t\t}\n\n\t\tpublic Fraction sub(Fraction fraction)\n\t\t{\n\t\t\treturn add(fraction.neg());\n\t\t}\n\n\t\t@Override\n\t\tpublic String toString()\n\t\t{\n\t\t\tString result;\n\t\t\tif (getRemainder().equals(Fraction.ZERO))\n\t\t\t{\n\t\t\t\tresult = \"\" + this.numerator;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tresult = this.numerator + \"/\" + this.denominator;\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\t}\n\n\tstatic class IteratorBuffer<Type>\n\t{\n\t\tprivate Iterator<Type> iterator;\n\t\tprivate List<Type> list;\n\n\t\tpublic IteratorBuffer(Iterator<Type> iterator)\n\t\t{\n\t\t\tthis.iterator = iterator;\n\t\t\tthis.list = new ArrayList<Type>();\n\t\t}\n\n\t\tpublic Iterator<Type> iterator()\n\t\t{\n\t\t\treturn new Iterator<Type>()\n\t\t\t{\n\t\t\t\tint index = 0;\n\n\t\t\t\t@Override\n\t\t\t\tpublic boolean hasNext()\n\t\t\t\t{\n\t\t\t\t\treturn this.index < list.size() || IteratorBuffer.this.iterator.hasNext();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic Type next()\n\t\t\t\t{\n\t\t\t\t\tif (list.size() <= this.index)\n\t\t\t\t\t{\n\t\t\t\t\t\tlist.add(iterator.next());\n\t\t\t\t\t}\n\t\t\t\t\tType result = list.get(index);\n\t\t\t\t\tindex += 1;\n\t\t\t\t\treturn result;\n\t\t\t\t}\n\t\t\t};\n\t\t}\n\t}\n\n\tpublic static class MapCount<Type> extends SortedMapAVL<Type, Long>\n\t{\n\t\tprivate int count;\n\n\t\tpublic MapCount(Comparator<? super Type> comparator)\n\t\t{\n\t\t\tsuper(comparator);\n\t\t\tthis.count = 0;\n\t\t}\n\n\t\tpublic long add(Type key, Long delta)\n\t\t{\n\t\t\tlong result;\n\t\t\tif (delta > 0)\n\t\t\t{\n\t\t\t\tLong value = get(key);\n\t\t\t\tif (value == null)\n\t\t\t\t{\n\t\t\t\t\tvalue = delta;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tvalue += delta;\n\t\t\t\t}\n\t\t\t\tput(key, value);\n\t\t\t\tresult = delta;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tresult = 0;\n\t\t\t}\n\t\t\tthis.count += result;\n\t\t\treturn result;\n\t\t}\n\n\t\tpublic int count()\n\t\t{\n\t\t\treturn this.count;\n\t\t}\n\n\t\tpublic List<Type> flatten()\n\t\t{\n\t\t\tList<Type> result = new ArrayList<>();\n\t\t\tfor (Entry<Type, Long> entry : entrySet())\n\t\t\t{\n\t\t\t\tfor (long index = 0; index < entry.getValue(); index++)\n\t\t\t\t{\n\t\t\t\t\tresult.add(entry.getKey());\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\t@Override\n\t\tpublic SortedMapAVL<Type, Long> headMap(Type keyEnd)\n\t\t{\n\t\t\tthrow new UnsupportedOperationException();\n\t\t}\n\n\t\t@Override\n\t\tpublic void putAll(Map<? extends Type, ? extends Long> map)\n\t\t{\n\t\t\tthrow new UnsupportedOperationException();\n\t\t}\n\n\t\tpublic long remove(Type key, Long delta)\n\t\t{\n\t\t\tlong result;\n\t\t\tif (delta > 0)\n\t\t\t{\n\t\t\t\tLong value = get(key) - delta;\n\t\t\t\tif (value <= 0)\n\t\t\t\t{\n\t\t\t\t\tresult = delta + value;\n\t\t\t\t\tremove(key);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tresult = delta;\n\t\t\t\t\tput(key, value);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tresult = 0;\n\t\t\t}\n\t\t\tthis.count -= result;\n\t\t\treturn result;\n\t\t}\n\n\t\t@Override\n\t\tpublic Long remove(Object key)\n\t\t{\n\t\t\tLong result = super.remove(key);\n\t\t\tthis.count -= result;\n\t\t\treturn result;\n\t\t}\n\n\t\t@Override\n\t\tpublic SortedMapAVL<Type, Long> subMap(Type keyStart, Type keyEnd)\n\t\t{\n\t\t\tthrow new UnsupportedOperationException();\n\t\t}\n\n\t\t@Override\n\t\tpublic SortedMapAVL<Type, Long> tailMap(Type keyStart)\n\t\t{\n\t\t\tthrow new UnsupportedOperationException();\n\t\t}\n\t}\n\n\tpublic static class MapSet<TypeKey, TypeValue> extends SortedMapAVL<TypeKey, SortedSetAVL<TypeValue>> implements Iterable<TypeValue>\n\t{\n\t\tprivate Comparator<? super TypeValue> comparatorValue;\n\n\t\tpublic MapSet(Comparator<? super TypeKey> comparatorKey, Comparator<? super TypeValue> comparatorValue)\n\t\t{\n\t\t\tsuper(comparatorKey);\n\t\t\tthis.comparatorValue = comparatorValue;\n\t\t}\n\n\t\tpublic MapSet(Comparator<? super TypeKey> comparatorKey, SortedSetAVL<Entry<TypeKey, SortedSetAVL<TypeValue>>> entrySet, Comparator<? super TypeValue> comparatorValue)\n\t\t{\n\t\t\tsuper(comparatorKey, entrySet);\n\t\t\tthis.comparatorValue = comparatorValue;\n\t\t}\n\n\t\tpublic boolean add(TypeKey key, TypeValue value)\n\t\t{\n\t\t\tSortedSetAVL<TypeValue> set = computeIfAbsent(key, k -> new SortedSetAVL<>(comparatorValue));\n\t\t\treturn set.add(value);\n\t\t}\n\n\t\tpublic TypeValue firstValue()\n\t\t{\n\t\t\tTypeValue result;\n\t\t\tEntry<TypeKey, SortedSetAVL<TypeValue>> firstEntry = firstEntry();\n\t\t\tif (firstEntry == null)\n\t\t\t{\n\t\t\t\tresult = null;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tresult = firstEntry.getValue().first();\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\t@Override\n\t\tpublic MapSet<TypeKey, TypeValue> headMap(TypeKey keyEnd)\n\t\t{\n\t\t\treturn new MapSet<>(this.comparator, this.entrySet.headSet(new AbstractMap.SimpleEntry<>(keyEnd, null)), this.comparatorValue);\n\t\t}\n\n\t\tpublic Iterator<TypeValue> iterator()\n\t\t{\n\t\t\treturn new Iterator<TypeValue>()\n\t\t\t{\n\t\t\t\tIterator<SortedSetAVL<TypeValue>> iteratorValues = values().iterator();\n\t\t\t\tIterator<TypeValue> iteratorValue = null;\n\n\t\t\t\t@Override\n\t\t\t\tpublic boolean hasNext()\n\t\t\t\t{\n\t\t\t\t\treturn iteratorValues.hasNext() || (iteratorValue != null && iteratorValue.hasNext());\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic TypeValue next()\n\t\t\t\t{\n\t\t\t\t\tif (iteratorValue == null || !iteratorValue.hasNext())\n\t\t\t\t\t{\n\t\t\t\t\t\titeratorValue = iteratorValues.next().iterator();\n\t\t\t\t\t}\n\t\t\t\t\treturn iteratorValue.next();\n\t\t\t\t}\n\t\t\t};\n\t\t}\n\n\t\tpublic TypeValue lastValue()\n\t\t{\n\t\t\tTypeValue result;\n\t\t\tEntry<TypeKey, SortedSetAVL<TypeValue>> lastEntry = lastEntry();\n\t\t\tif (lastEntry == null)\n\t\t\t{\n\t\t\t\tresult = null;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tresult = lastEntry.getValue().last();\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tpublic boolean removeSet(TypeKey key, TypeValue value)\n\t\t{\n\t\t\tboolean result;\n\t\t\tSortedSetAVL<TypeValue> set = get(key);\n\t\t\tif (set == null)\n\t\t\t{\n\t\t\t\tresult = false;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tresult = set.remove(value);\n\t\t\t\tif (set.size() == 0)\n\t\t\t\t{\n\t\t\t\t\tremove(key);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\t@Override\n\t\tpublic MapSet<TypeKey, TypeValue> tailMap(TypeKey keyStart)\n\t\t{\n\t\t\treturn new MapSet<>(this.comparator, this.entrySet.tailSet(new AbstractMap.SimpleEntry<>(keyStart, null)), this.comparatorValue);\n\t\t}\n\t}\n\n\tpublic static class Matrix\n\t{\n\t\tpublic final int rows;\n\t\tpublic final int columns;\n\t\tpublic final Fraction[][] cells;\n\n\t\tpublic Matrix(int rows, int columns)\n\t\t{\n\t\t\tthis.rows = rows;\n\t\t\tthis.columns = columns;\n\t\t\tthis.cells = new Fraction[rows][columns];\n\t\t\tfor (int row = 0; row < rows; row++)\n\t\t\t{\n\t\t\t\tfor (int column = 0; column < columns; column++)\n\t\t\t\t{\n\t\t\t\t\tset(row, column, Fraction.ZERO);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tpublic void add(int rowSource, int rowTarget, Fraction fraction)\n\t\t{\n\t\t\tfor (int column = 0; column < columns; column++)\n\t\t\t{\n\t\t\t\tthis.cells[rowTarget][column] = this.cells[rowTarget][column].add(this.cells[rowSource][column].multiply(fraction));\n\t\t\t}\n\t\t}\n\n\t\tprivate int columnPivot(int row)\n\t\t{\n\t\t\tint result = this.columns;\n\t\t\tfor (int column = this.columns - 1; 0 <= column; column--)\n\t\t\t{\n\t\t\t\tif (this.cells[row][column].compareTo(Fraction.ZERO) != 0)\n\t\t\t\t{\n\t\t\t\t\tresult = column;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tpublic void reduce()\n\t\t{\n\t\t\tfor (int rowMinimum = 0; rowMinimum < this.rows; rowMinimum++)\n\t\t\t{\n\t\t\t\tint rowPivot = rowPivot(rowMinimum);\n\t\t\t\tif (rowPivot != -1)\n\t\t\t\t{\n\t\t\t\t\tint columnPivot = columnPivot(rowPivot);\n\t\t\t\t\tFraction current = this.cells[rowMinimum][columnPivot];\n\t\t\t\t\tFraction pivot = this.cells[rowPivot][columnPivot];\n\t\t\t\t\tFraction fraction = pivot.inverse().sub(current.divide(pivot));\n\t\t\t\t\tadd(rowPivot, rowMinimum, fraction);\n\t\t\t\t\tfor (int row = rowMinimum + 1; row < this.rows; row++)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (columnPivot(row) == columnPivot)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tadd(rowMinimum, row, this.cells[row][columnPivot(row)].neg());\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tprivate int rowPivot(int rowMinimum)\n\t\t{\n\t\t\tint result = -1;\n\t\t\tint pivotColumnMinimum = this.columns;\n\t\t\tfor (int row = rowMinimum; row < this.rows; row++)\n\t\t\t{\n\t\t\t\tint pivotColumn = columnPivot(row);\n\t\t\t\tif (pivotColumn < pivotColumnMinimum)\n\t\t\t\t{\n\t\t\t\t\tresult = row;\n\t\t\t\t\tpivotColumnMinimum = pivotColumn;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tpublic void set(int row, int column, Fraction value)\n\t\t{\n\t\t\tthis.cells[row][column] = value;\n\t\t}\n\n\t\tpublic String toString()\n\t\t{\n\t\t\tString result = \"\";\n\t\t\tfor (int row = 0; row < rows; row++)\n\t\t\t{\n\t\t\t\tfor (int column = 0; column < columns; column++)\n\t\t\t\t{\n\t\t\t\t\tresult += this.cells[row][column] + \"\\t\";\n\t\t\t\t}\n\t\t\t\tresult += \"\\n\";\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\t}\n\n\tpublic static class Node<Type>\n\t{\n\t\tpublic final Type value;\n\t\tpublic final Node<Type> left;\n\t\tpublic final Node<Type> right;\n\t\tpublic final int size;\n\t\tprivate final int height;\n\n\t\tpublic Node(Type value, Node<Type> left, Node<Type> right)\n\t\t{\n\t\t\tthis.value = value;\n\t\t\tthis.left = left;\n\t\t\tthis.right = right;\n\t\t\tthis.size = 1 + size(left) + size(right);\n\t\t\tthis.height = 1 + Math.max(height(left), height(right));\n\t\t}\n\n\t\tpublic static <Type> Node<Type> balance(Node<Type> result)\n\t\t{\n\t\t\twhile (result != null && 1 < Math.abs(height(result.left) - height(result.right)))\n\t\t\t{\n\t\t\t\tif (height(result.left) < height(result.right))\n\t\t\t\t{\n\t\t\t\t\tNode<Type> right = result.right;\n\t\t\t\t\tif (height(right.right) < height(right.left))\n\t\t\t\t\t{\n\t\t\t\t\t\tresult = new Node<>(result.value, result.left, right.rotateRight());\n\t\t\t\t\t}\n\t\t\t\t\tresult = result.rotateLeft();\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tNode<Type> left = result.left;\n\t\t\t\t\tif (height(left.left) < height(left.right))\n\t\t\t\t\t{\n\t\t\t\t\t\tresult = new Node<>(result.value, left.rotateLeft(), result.right);\n\t\t\t\t\t}\n\t\t\t\t\tresult = result.rotateRight();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tpublic static <Type> Node<Type> clone(Node<Type> result)\n\t\t{\n\t\t\tif (result != null)\n\t\t\t{\n\t\t\t\tresult = new Node<>(result.value, clone(result.left), clone(result.right));\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tpublic static <Type> Node<Type> delete(Node<Type> node, Type value, Comparator<? super Type> comparator)\n\t\t{\n\t\t\tNode<Type> result;\n\t\t\tif (node == null)\n\t\t\t{\n\t\t\t\tresult = null;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tint compare = comparator.compare(value, node.value);\n\t\t\t\tif (compare == 0)\n\t\t\t\t{\n\t\t\t\t\tif (node.left == null)\n\t\t\t\t\t{\n\t\t\t\t\t\tresult = node.right;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tif (node.right == null)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tresult = node.left;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tNode<Type> first = first(node.right);\n\t\t\t\t\t\t\tresult = new Node<>(first.value, node.left, delete(node.right, first.value, comparator));\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif (compare < 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tresult = new Node<>(node.value, delete(node.left, value, comparator), node.right);\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tresult = new Node<>(node.value, node.left, delete(node.right, value, comparator));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tresult = balance(result);\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tpublic static <Type> Node<Type> first(Node<Type> result)\n\t\t{\n\t\t\twhile (result.left != null)\n\t\t\t{\n\t\t\t\tresult = result.left;\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tpublic static <Type> Node<Type> get(Node<Type> node, Type value, Comparator<? super Type> comparator)\n\t\t{\n\t\t\tNode<Type> result;\n\t\t\tif (node == null)\n\t\t\t{\n\t\t\t\tresult = null;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tint compare = comparator.compare(value, node.value);\n\t\t\t\tif (compare == 0)\n\t\t\t\t{\n\t\t\t\t\tresult = node;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif (compare < 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tresult = get(node.left, value, comparator);\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tresult = get(node.right, value, comparator);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tpublic static <Type> Node<Type> head(Node<Type> node, Type value, Comparator<? super Type> comparator)\n\t\t{\n\t\t\tNode<Type> result;\n\t\t\tif (node == null)\n\t\t\t{\n\t\t\t\tresult = null;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tint compare = comparator.compare(value, node.value);\n\t\t\t\tif (compare == 0)\n\t\t\t\t{\n\t\t\t\t\tresult = node.left;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif (compare < 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tresult = head(node.left, value, comparator);\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tresult = new Node<>(node.value, node.left, head(node.right, value, comparator));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tresult = balance(result);\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tpublic static int height(Node node)\n\t\t{\n\t\t\treturn node == null ? 0 : node.height;\n\t\t}\n\n\t\tpublic static <Type> Node<Type> insert(Node<Type> node, Type value, Comparator<? super Type> comparator)\n\t\t{\n\t\t\tNode<Type> result;\n\t\t\tif (node == null)\n\t\t\t{\n\t\t\t\tresult = new Node<>(value, null, null);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tint compare = comparator.compare(value, node.value);\n\t\t\t\tif (compare == 0)\n\t\t\t\t{\n\t\t\t\t\tresult = new Node<>(value, node.left, node.right);\n\t\t\t\t\t;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif (compare < 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tresult = new Node<>(node.value, insert(node.left, value, comparator), node.right);\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tresult = new Node<>(node.value, node.left, insert(node.right, value, comparator));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tresult = balance(result);\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tpublic static <Type> Node<Type> last(Node<Type> result)\n\t\t{\n\t\t\twhile (result.right != null)\n\t\t\t{\n\t\t\t\tresult = result.right;\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tpublic static int size(Node node)\n\t\t{\n\t\t\treturn node == null ? 0 : node.size;\n\t\t}\n\n\t\tpublic static <Type> Node<Type> tail(Node<Type> node, Type value, Comparator<? super Type> comparator)\n\t\t{\n\t\t\tNode<Type> result;\n\t\t\tif (node == null)\n\t\t\t{\n\t\t\t\tresult = null;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tint compare = comparator.compare(value, node.value);\n\t\t\t\tif (compare == 0)\n\t\t\t\t{\n\t\t\t\t\tresult = new Node<>(node.value, null, node.right);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif (compare < 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tresult = new Node<>(node.value, tail(node.left, value, comparator), node.right);\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tresult = tail(node.right, value, comparator);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tresult = balance(result);\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tpublic static <Type> void traverseOrderIn(Node<Type> node, Consumer<Type> consumer)\n\t\t{\n\t\t\tif (node != null)\n\t\t\t{\n\t\t\t\ttraverseOrderIn(node.left, consumer);\n\t\t\t\tconsumer.accept(node.value);\n\t\t\t\ttraverseOrderIn(node.right, consumer);\n\t\t\t}\n\t\t}\n\n\t\tpublic Node<Type> rotateLeft()\n\t\t{\n\t\t\tNode<Type> left = new Node<>(this.value, this.left, this.right.left);\n\t\t\treturn new Node<>(this.right.value, left, this.right.right);\n\t\t}\n\n\t\tpublic Node<Type> rotateRight()\n\t\t{\n\t\t\tNode<Type> right = new Node<>(this.value, this.left.right, this.right);\n\t\t\treturn new Node<>(this.left.value, this.left.left, right);\n\t\t}\n\t}\n\n\tpublic static class SingleLinkedList<Type>\n\t{\n\t\tpublic final Type element;\n\t\tpublic SingleLinkedList<Type> next;\n\n\t\tpublic SingleLinkedList(Type element, SingleLinkedList<Type> next)\n\t\t{\n\t\t\tthis.element = element;\n\t\t\tthis.next = next;\n\t\t}\n\n\t\tpublic void toCollection(Collection<Type> collection)\n\t\t{\n\t\t\tif (this.next != null)\n\t\t\t{\n\t\t\t\tthis.next.toCollection(collection);\n\t\t\t}\n\t\t\tcollection.add(this.element);\n\t\t}\n\t}\n\n\tpublic static class SmallSetIntegers\n\t{\n\t\tpublic static final int SIZE = 20;\n\t\tpublic static final int[] SET = generateSet();\n\t\tpublic static final int[] COUNT = generateCount();\n\t\tpublic static final int[] INTEGER = generateInteger();\n\n\t\tprivate static int count(int set)\n\t\t{\n\t\t\tint result = 0;\n\t\t\tfor (int integer = 0; integer < SIZE; integer++)\n\t\t\t{\n\t\t\t\tif (0 < (set & set(integer)))\n\t\t\t\t{\n\t\t\t\t\tresult += 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tprivate static final int[] generateCount()\n\t\t{\n\t\t\tint[] result = new int[1 << SIZE];\n\t\t\tfor (int set = 0; set < result.length; set++)\n\t\t\t{\n\t\t\t\tresult[set] = count(set);\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tprivate static final int[] generateInteger()\n\t\t{\n\t\t\tint[] result = new int[1 << SIZE];\n\t\t\tArrays.fill(result, -1);\n\t\t\tfor (int integer = 0; integer < SIZE; integer++)\n\t\t\t{\n\t\t\t\tresult[SET[integer]] = integer;\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tprivate static final int[] generateSet()\n\t\t{\n\t\t\tint[] result = new int[SIZE];\n\t\t\tfor (int integer = 0; integer < result.length; integer++)\n\t\t\t{\n\t\t\t\tresult[integer] = set(integer);\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tprivate static int set(int integer)\n\t\t{\n\t\t\treturn 1 << integer;\n\t\t}\n\t}\n\n\tpublic static class SortedMapAVL<TypeKey, TypeValue> implements SortedMap<TypeKey, TypeValue>\n\t{\n\t\tpublic final Comparator<? super TypeKey> comparator;\n\t\tpublic final SortedSetAVL<Entry<TypeKey, TypeValue>> entrySet;\n\n\t\tpublic SortedMapAVL(Comparator<? super TypeKey> comparator)\n\t\t{\n\t\t\tthis(comparator, new SortedSetAVL<>((entry0, entry1) -> comparator.compare(entry0.getKey(), entry1.getKey())));\n\t\t}\n\n\t\tprivate SortedMapAVL(Comparator<? super TypeKey> comparator, SortedSetAVL<Entry<TypeKey, TypeValue>> entrySet)\n\t\t{\n\t\t\tthis.comparator = comparator;\n\t\t\tthis.entrySet = entrySet;\n\t\t}\n\n\t\t@Override\n\t\tpublic void clear()\n\t\t{\n\t\t\tthis.entrySet.clear();\n\t\t}\n\n\t\t@Override\n\t\tpublic Comparator<? super TypeKey> comparator()\n\t\t{\n\t\t\treturn this.comparator;\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean containsKey(Object key)\n\t\t{\n\t\t\treturn this.entrySet().contains(new AbstractMap.SimpleEntry<>((TypeKey) key, null));\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean containsValue(Object value)\n\t\t{\n\t\t\tthrow new UnsupportedOperationException();\n\t\t}\n\n\t\t@Override\n\t\tpublic SortedSetAVL<Entry<TypeKey, TypeValue>> entrySet()\n\t\t{\n\t\t\treturn this.entrySet;\n\t\t}\n\n\t\tpublic Entry<TypeKey, TypeValue> firstEntry()\n\t\t{\n\t\t\treturn this.entrySet.first();\n\t\t}\n\n\t\t@Override\n\t\tpublic TypeKey firstKey()\n\t\t{\n\t\t\treturn firstEntry().getKey();\n\t\t}\n\n\t\t@Override\n\t\tpublic TypeValue get(Object key)\n\t\t{\n\t\t\tEntry<TypeKey, TypeValue> entry = new AbstractMap.SimpleEntry<>((TypeKey) key, null);\n\t\t\tentry = this.entrySet.get(entry);\n\t\t\treturn entry == null ? null : entry.getValue();\n\t\t}\n\n\t\t@Override\n\t\tpublic SortedMapAVL<TypeKey, TypeValue> headMap(TypeKey keyEnd)\n\t\t{\n\t\t\treturn new SortedMapAVL<>(this.comparator, this.entrySet.headSet(new AbstractMap.SimpleEntry<>(keyEnd, null)));\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean isEmpty()\n\t\t{\n\t\t\treturn this.entrySet.isEmpty();\n\t\t}\n\n\t\t@Override\n\t\tpublic Set<TypeKey> keySet()\n\t\t{\n\t\t\treturn new SortedSet<TypeKey>()\n\t\t\t{\n\t\t\t\t@Override\n\t\t\t\tpublic boolean add(TypeKey typeKey)\n\t\t\t\t{\n\t\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic boolean addAll(Collection<? extends TypeKey> collection)\n\t\t\t\t{\n\t\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic void clear()\n\t\t\t\t{\n\t\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic Comparator<? super TypeKey> comparator()\n\t\t\t\t{\n\t\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic boolean contains(Object o)\n\t\t\t\t{\n\t\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic boolean containsAll(Collection<?> collection)\n\t\t\t\t{\n\t\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic TypeKey first()\n\t\t\t\t{\n\t\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic SortedSet<TypeKey> headSet(TypeKey typeKey)\n\t\t\t\t{\n\t\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic boolean isEmpty()\n\t\t\t\t{\n\t\t\t\t\treturn size() == 0;\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic Iterator<TypeKey> iterator()\n\t\t\t\t{\n\t\t\t\t\tfinal Iterator<Entry<TypeKey, TypeValue>> iterator = SortedMapAVL.this.entrySet.iterator();\n\t\t\t\t\treturn new Iterator<TypeKey>()\n\t\t\t\t\t{\n\t\t\t\t\t\t@Override\n\t\t\t\t\t\tpublic boolean hasNext()\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\treturn iterator.hasNext();\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t@Override\n\t\t\t\t\t\tpublic TypeKey next()\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\treturn iterator.next().getKey();\n\t\t\t\t\t\t}\n\t\t\t\t\t};\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic TypeKey last()\n\t\t\t\t{\n\t\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic boolean remove(Object o)\n\t\t\t\t{\n\t\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic boolean removeAll(Collection<?> collection)\n\t\t\t\t{\n\t\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic boolean retainAll(Collection<?> collection)\n\t\t\t\t{\n\t\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic int size()\n\t\t\t\t{\n\t\t\t\t\treturn SortedMapAVL.this.entrySet.size();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic SortedSet<TypeKey> subSet(TypeKey typeKey, TypeKey e1)\n\t\t\t\t{\n\t\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic SortedSet<TypeKey> tailSet(TypeKey typeKey)\n\t\t\t\t{\n\t\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic Object[] toArray()\n\t\t\t\t{\n\t\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic <T> T[] toArray(T[] ts)\n\t\t\t\t{\n\t\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t\t}\n\t\t\t};\n\t\t}\n\n\t\tpublic Entry<TypeKey, TypeValue> lastEntry()\n\t\t{\n\t\t\treturn this.entrySet.last();\n\t\t}\n\n\t\t@Override\n\t\tpublic TypeKey lastKey()\n\t\t{\n\t\t\treturn lastEntry().getKey();\n\t\t}\n\n\t\t@Override\n\t\tpublic TypeValue put(TypeKey key, TypeValue value)\n\t\t{\n\t\t\tTypeValue result = get(key);\n\t\t\tEntry<TypeKey, TypeValue> entry = new AbstractMap.SimpleEntry<>(key, value);\n\t\t\tthis.entrySet().add(entry);\n\t\t\treturn result;\n\t\t}\n\n\t\t@Override\n\t\tpublic void putAll(Map<? extends TypeKey, ? extends TypeValue> map)\n\t\t{\n\t\t\tmap.entrySet()\n\t\t\t\t\t.forEach(entry -> put(entry.getKey(), entry.getValue()));\n\t\t}\n\n\t\t@Override\n\t\tpublic TypeValue remove(Object key)\n\t\t{\n\t\t\tTypeValue result = get(key);\n\t\t\tEntry<TypeKey, TypeValue> entry = new AbstractMap.SimpleEntry<>((TypeKey) key, null);\n\t\t\tthis.entrySet.remove(entry);\n\t\t\treturn result;\n\t\t}\n\n\t\t@Override\n\t\tpublic int size()\n\t\t{\n\t\t\treturn this.entrySet().size();\n\t\t}\n\n\t\t@Override\n\t\tpublic SortedMapAVL<TypeKey, TypeValue> subMap(TypeKey keyStart, TypeKey keyEnd)\n\t\t{\n\t\t\treturn new SortedMapAVL<>(this.comparator, this.entrySet.subSet(new AbstractMap.SimpleEntry<>(keyStart, null), new AbstractMap.SimpleEntry<>(keyEnd, null)));\n\t\t}\n\n\t\t@Override\n\t\tpublic SortedMapAVL<TypeKey, TypeValue> tailMap(TypeKey keyStart)\n\t\t{\n\t\t\treturn new SortedMapAVL<>(this.comparator, this.entrySet.tailSet(new AbstractMap.SimpleEntry<>(keyStart, null)));\n\t\t}\n\n\t\t@Override\n\t\tpublic String toString()\n\t\t{\n\t\t\treturn this.entrySet().toString();\n\t\t}\n\n\t\t@Override\n\t\tpublic Collection<TypeValue> values()\n\t\t{\n\t\t\treturn new Collection<TypeValue>()\n\t\t\t{\n\t\t\t\t@Override\n\t\t\t\tpublic boolean add(TypeValue typeValue)\n\t\t\t\t{\n\t\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic boolean addAll(Collection<? extends TypeValue> collection)\n\t\t\t\t{\n\t\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic void clear()\n\t\t\t\t{\n\t\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic boolean contains(Object value)\n\t\t\t\t{\n\t\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic boolean containsAll(Collection<?> collection)\n\t\t\t\t{\n\t\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic boolean isEmpty()\n\t\t\t\t{\n\t\t\t\t\treturn SortedMapAVL.this.entrySet.isEmpty();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic Iterator<TypeValue> iterator()\n\t\t\t\t{\n\t\t\t\t\treturn new Iterator<TypeValue>()\n\t\t\t\t\t{\n\t\t\t\t\t\tIterator<Entry<TypeKey, TypeValue>> iterator = SortedMapAVL.this.entrySet.iterator();\n\n\t\t\t\t\t\t@Override\n\t\t\t\t\t\tpublic boolean hasNext()\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\treturn this.iterator.hasNext();\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t@Override\n\t\t\t\t\t\tpublic TypeValue next()\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\treturn this.iterator.next().getValue();\n\t\t\t\t\t\t}\n\t\t\t\t\t};\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic boolean remove(Object o)\n\t\t\t\t{\n\t\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic boolean removeAll(Collection<?> collection)\n\t\t\t\t{\n\t\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic boolean retainAll(Collection<?> collection)\n\t\t\t\t{\n\t\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic int size()\n\t\t\t\t{\n\t\t\t\t\treturn SortedMapAVL.this.entrySet.size();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic Object[] toArray()\n\t\t\t\t{\n\t\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic <T> T[] toArray(T[] ts)\n\t\t\t\t{\n\t\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t\t}\n\t\t\t};\n\t\t}\n\t}\n\n\tpublic static class SortedSetAVL<Type> implements SortedSet<Type>\n\t{\n\t\tpublic Comparator<? super Type> comparator;\n\t\tpublic Node<Type> root;\n\n\t\tprivate SortedSetAVL(Comparator<? super Type> comparator, Node<Type> root)\n\t\t{\n\t\t\tthis.comparator = comparator;\n\t\t\tthis.root = root;\n\t\t}\n\n\t\tpublic SortedSetAVL(Comparator<? super Type> comparator)\n\t\t{\n\t\t\tthis(comparator, null);\n\t\t}\n\n\t\tpublic SortedSetAVL(Collection<? extends Type> collection, Comparator<? super Type> comparator)\n\t\t{\n\t\t\tthis(comparator, null);\n\t\t\tthis.addAll(collection);\n\t\t}\n\n\t\tpublic SortedSetAVL(SortedSetAVL<Type> sortedSetAVL)\n\t\t{\n\t\t\tthis(sortedSetAVL.comparator, Node.clone(sortedSetAVL.root));\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean add(Type value)\n\t\t{\n\t\t\tint sizeBefore = size();\n\t\t\tthis.root = Node.insert(this.root, value, this.comparator);\n\t\t\treturn sizeBefore != size();\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean addAll(Collection<? extends Type> collection)\n\t\t{\n\t\t\treturn collection.stream()\n\t\t\t\t\t.map(this::add)\n\t\t\t\t\t.reduce(true, (x, y) -> x | y);\n\t\t}\n\n\t\t@Override\n\t\tpublic void clear()\n\t\t{\n\t\t\tthis.root = null;\n\t\t}\n\n\t\t@Override\n\t\tpublic Comparator<? super Type> comparator()\n\t\t{\n\t\t\treturn this.comparator;\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean contains(Object value)\n\t\t{\n\t\t\treturn Node.get(this.root, (Type) value, this.comparator) != null;\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean containsAll(Collection<?> collection)\n\t\t{\n\t\t\treturn collection.stream()\n\t\t\t\t\t.allMatch(this::contains);\n\t\t}\n\n\t\t@Override\n\t\tpublic Type first()\n\t\t{\n\t\t\treturn Node.first(this.root).value;\n\t\t}\n\n\t\tpublic Type get(Type value)\n\t\t{\n\t\t\tNode<Type> node = Node.get(this.root, value, this.comparator);\n\t\t\treturn node == null ? null : node.value;\n\t\t}\n\n\t\t@Override\n\t\tpublic SortedSetAVL<Type> headSet(Type valueEnd)\n\t\t{\n\t\t\treturn new SortedSetAVL<>(this.comparator, Node.head(this.root, valueEnd, this.comparator));\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean isEmpty()\n\t\t{\n\t\t\treturn this.root == null;\n\t\t}\n\n\t\t@Override\n\t\tpublic Iterator<Type> iterator()\n\t\t{\n\t\t\tStack<Node<Type>> path = new Stack<>();\n\t\t\treturn new Iterator<Type>()\n\t\t\t{\n\t\t\t\t{\n\t\t\t\t\tpush(SortedSetAVL.this.root);\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic boolean hasNext()\n\t\t\t\t{\n\t\t\t\t\treturn !path.isEmpty();\n\t\t\t\t}\n\n\t\t\t\t@Override\n\t\t\t\tpublic Type next()\n\t\t\t\t{\n\t\t\t\t\tif (path.isEmpty())\n\t\t\t\t\t{\n\t\t\t\t\t\tthrow new NoSuchElementException();\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tNode<Type> node = path.peek();\n\t\t\t\t\t\tType result = node.value;\n\t\t\t\t\t\tif (node.right != null)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tpush(node.right);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tdo\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tnode = path.pop();\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\twhile (!path.isEmpty() && path.peek().right == node);\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn result;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tpublic void push(Node<Type> node)\n\t\t\t\t{\n\t\t\t\t\twhile (node != null)\n\t\t\t\t\t{\n\t\t\t\t\t\tpath.push(node);\n\t\t\t\t\t\tnode = node.left;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t};\n\t\t}\n\n\t\t@Override\n\t\tpublic Type last()\n\t\t{\n\t\t\treturn Node.last(this.root).value;\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean remove(Object value)\n\t\t{\n\t\t\tint sizeBefore = size();\n\t\t\tthis.root = Node.delete(this.root, (Type) value, this.comparator);\n\t\t\treturn sizeBefore != size();\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean removeAll(Collection<?> collection)\n\t\t{\n\t\t\treturn collection.stream()\n\t\t\t\t\t.map(this::remove)\n\t\t\t\t\t.reduce(true, (x, y) -> x | y);\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean retainAll(Collection<?> collection)\n\t\t{\n\t\t\tSortedSetAVL<Type> set = new SortedSetAVL<>(this.comparator);\n\t\t\tcollection.stream()\n\t\t\t\t\t.map(element -> (Type) element)\n\t\t\t\t\t.filter(this::contains)\n\t\t\t\t\t.forEach(set::add);\n\t\t\tboolean result = size() != set.size();\n\t\t\tthis.root = set.root;\n\t\t\treturn result;\n\t\t}\n\n\t\t@Override\n\t\tpublic int size()\n\t\t{\n\t\t\treturn this.root == null ? 0 : this.root.size;\n\t\t}\n\n\t\t@Override\n\t\tpublic SortedSetAVL<Type> subSet(Type valueStart, Type valueEnd)\n\t\t{\n\t\t\treturn tailSet(valueStart).headSet(valueEnd);\n\t\t}\n\n\t\t@Override\n\t\tpublic SortedSetAVL<Type> tailSet(Type valueStart)\n\t\t{\n\t\t\treturn new SortedSetAVL<>(this.comparator, Node.tail(this.root, valueStart, this.comparator));\n\t\t}\n\n\t\t@Override\n\t\tpublic Object[] toArray()\n\t\t{\n\t\t\treturn toArray(new Object[0]);\n\t\t}\n\n\t\t@Override\n\t\tpublic <T> T[] toArray(T[] ts)\n\t\t{\n\t\t\tList<Object> list = new ArrayList<>();\n\t\t\tNode.traverseOrderIn(this.root, list::add);\n\t\t\treturn list.toArray(ts);\n\t\t}\n\n\t\t@Override\n\t\tpublic String toString()\n\t\t{\n\t\t\treturn \"{\" + E_440.toString(this, \", \") + \"}\";\n\t\t}\n\t}\n\n\tpublic static class Tree2D\n\t{\n\t\tpublic static final int SIZE = 1 << 30;\n\t\tpublic static final Tree2D[] TREES_NULL = new Tree2D[] { null, null, null, null };\n\t\tpublic final Tree2D[] trees;\n\t\tpublic final int count;\n\n\t\tprivate Tree2D(Tree2D[] trees, int count)\n\t\t{\n\t\t\tthis.trees = trees;\n\t\t\tthis.count = count;\n\t\t}\n\n\t\tpublic Tree2D(Tree2D[] trees)\n\t\t{\n\t\t\tthis(trees, count(trees));\n\t\t}\n\n\t\tpublic Tree2D()\n\t\t{\n\t\t\tthis(TREES_NULL);\n\t\t}\n\n\t\tpublic static boolean contains(int x, int y, int left, int bottom, int size)\n\t\t{\n\t\t\treturn left <= x && x < left + size && bottom <= y && y < bottom + size;\n\t\t}\n\n\t\tpublic static int count(Tree2D[] trees)\n\t\t{\n\t\t\tint result = 0;\n\t\t\tfor (int index = 0; index < 4; index++)\n\t\t\t{\n\t\t\t\tif (trees[index] != null)\n\t\t\t\t{\n\t\t\t\t\tresult += trees[index].count;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tpublic static int count\n\t\t\t\t(\n\t\t\t\t\t\tint rectangleLeft,\n\t\t\t\t\t\tint rectangleBottom,\n\t\t\t\t\t\tint rectangleRight,\n\t\t\t\t\t\tint rectangleTop,\n\t\t\t\t\t\tTree2D tree,\n\t\t\t\t\t\tint left,\n\t\t\t\t\t\tint bottom,\n\t\t\t\t\t\tint size\n\t\t\t\t)\n\t\t{\n\t\t\tint result;\n\t\t\tif (tree == null)\n\t\t\t{\n\t\t\t\tresult = 0;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tint right = left + size;\n\t\t\t\tint top = bottom + size;\n\t\t\t\tint intersectionLeft = Math.max(rectangleLeft, left);\n\t\t\t\tint intersectionBottom = Math.max(rectangleBottom, bottom);\n\t\t\t\tint intersectionRight = Math.min(rectangleRight, right);\n\t\t\t\tint intersectionTop = Math.min(rectangleTop, top);\n\t\t\t\tif (intersectionRight <= intersectionLeft || intersectionTop <= intersectionBottom)\n\t\t\t\t{\n\t\t\t\t\tresult = 0;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif (intersectionLeft == left && intersectionBottom == bottom && intersectionRight == right && intersectionTop == top)\n\t\t\t\t\t{\n\t\t\t\t\t\tresult = tree.count;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tsize = size >> 1;\n\t\t\t\t\t\tresult = 0;\n\t\t\t\t\t\tfor (int index = 0; index < 4; index++)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tresult += count\n\t\t\t\t\t\t\t\t\t(\n\t\t\t\t\t\t\t\t\t\t\trectangleLeft,\n\t\t\t\t\t\t\t\t\t\t\trectangleBottom,\n\t\t\t\t\t\t\t\t\t\t\trectangleRight,\n\t\t\t\t\t\t\t\t\t\t\trectangleTop,\n\t\t\t\t\t\t\t\t\t\t\ttree.trees[index],\n\t\t\t\t\t\t\t\t\t\t\tquadrantLeft(left, size, index),\n\t\t\t\t\t\t\t\t\t\t\tquadrantBottom(bottom, size, index),\n\t\t\t\t\t\t\t\t\t\t\tsize\n\t\t\t\t\t\t\t\t\t);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tpublic static int quadrantBottom(int bottom, int size, int index)\n\t\t{\n\t\t\treturn bottom + (index >> 1) * size;\n\t\t}\n\n\t\tpublic static int quadrantLeft(int left, int size, int index)\n\t\t{\n\t\t\treturn left + (index & 1) * size;\n\t\t}\n\n\t\tpublic int count(int rectangleLeft, int rectangleBottom, int rectangleRight, int rectangleTop)\n\t\t{\n\t\t\treturn count\n\t\t\t\t\t(\n\t\t\t\t\t\t\trectangleLeft,\n\t\t\t\t\t\t\trectangleBottom,\n\t\t\t\t\t\t\trectangleRight,\n\t\t\t\t\t\t\trectangleTop,\n\t\t\t\t\t\t\tthis,\n\t\t\t\t\t\t\t0,\n\t\t\t\t\t\t\t0,\n\t\t\t\t\t\t\tSIZE\n\t\t\t\t\t);\n\t\t}\n\n\t\tpublic Tree2D setPoint\n\t\t\t\t(\n\t\t\t\t\t\tint x,\n\t\t\t\t\t\tint y,\n\t\t\t\t\t\tTree2D tree,\n\t\t\t\t\t\tint left,\n\t\t\t\t\t\tint bottom,\n\t\t\t\t\t\tint size\n\t\t\t\t)\n\t\t{\n\t\t\tTree2D result;\n\t\t\tif (contains(x, y, left, bottom, size))\n\t\t\t{\n\t\t\t\tif (size == 1)\n\t\t\t\t{\n\t\t\t\t\tresult = new Tree2D(TREES_NULL, 1);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tsize = size >> 1;\n\t\t\t\t\tTree2D[] trees = new Tree2D[4];\n\t\t\t\t\tfor (int index = 0; index < 4; index++)\n\t\t\t\t\t{\n\t\t\t\t\t\ttrees[index] = setPoint\n\t\t\t\t\t\t\t\t(\n\t\t\t\t\t\t\t\t\t\tx,\n\t\t\t\t\t\t\t\t\t\ty,\n\t\t\t\t\t\t\t\t\t\ttree == null ? null : tree.trees[index],\n\t\t\t\t\t\t\t\t\t\tquadrantLeft(left, size, index),\n\t\t\t\t\t\t\t\t\t\tquadrantBottom(bottom, size, index),\n\t\t\t\t\t\t\t\t\t\tsize\n\t\t\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t\tresult = new Tree2D(trees);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tresult = tree;\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tpublic Tree2D setPoint(int x, int y)\n\t\t{\n\t\t\treturn setPoint\n\t\t\t\t\t(\n\t\t\t\t\t\t\tx,\n\t\t\t\t\t\t\ty,\n\t\t\t\t\t\t\tthis,\n\t\t\t\t\t\t\t0,\n\t\t\t\t\t\t\t0,\n\t\t\t\t\t\t\tSIZE\n\t\t\t\t\t);\n\t\t}\n\t}\n\n\tpublic static class Tuple2<Type0, Type1>\n\t{\n\t\tpublic final Type0 v0;\n\t\tpublic final Type1 v1;\n\n\t\tpublic Tuple2(Type0 v0, Type1 v1)\n\t\t{\n\t\t\tthis.v0 = v0;\n\t\t\tthis.v1 = v1;\n\t\t}\n\n\t\t@Override\n\t\tpublic String toString()\n\t\t{\n\t\t\treturn \"(\" + this.v0 + \", \" + this.v1 + \")\";\n\t\t}\n\t}\n\n\tpublic static class Tuple2Comparable<Type0 extends Comparable<? super Type0>, Type1 extends Comparable<? super Type1>> extends Tuple2<Type0, Type1> implements Comparable<Tuple2Comparable<Type0, Type1>>\n\t{\n\t\tpublic Tuple2Comparable(Type0 v0, Type1 v1)\n\t\t{\n\t\t\tsuper(v0, v1);\n\t\t}\n\n\t\t@Override\n\t\tpublic int compareTo(Tuple2Comparable<Type0, Type1> that)\n\t\t{\n\t\t\tint result = this.v0.compareTo(that.v0);\n\t\t\tif (result == 0)\n\t\t\t{\n\t\t\t\tresult = this.v1.compareTo(that.v1);\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\t}\n\n\tpublic static class Tuple3<Type0, Type1, Type2>\n\t{\n\t\tpublic final Type0 v0;\n\t\tpublic final Type1 v1;\n\t\tpublic final Type2 v2;\n\n\t\tpublic Tuple3(Type0 v0, Type1 v1, Type2 v2)\n\t\t{\n\t\t\tthis.v0 = v0;\n\t\t\tthis.v1 = v1;\n\t\t\tthis.v2 = v2;\n\t\t}\n\n\t\t@Override\n\t\tpublic String toString()\n\t\t{\n\t\t\treturn \"(\" + this.v0 + \", \" + this.v1 + \", \" + this.v2 + \")\";\n\t\t}\n\t}\n\n\tpublic static class Vertex<TypeVertex extends Vertex<TypeVertex, TypeEdge>, TypeEdge extends Edge<TypeVertex, TypeEdge>> implements Comparable<Vertex<? super TypeVertex, ? super TypeEdge>>\n\t{\n\t\tpublic final int index;\n\t\tpublic final List<TypeEdge> edges;\n\n\t\tpublic Vertex(int index)\n\t\t{\n\t\t\tthis.index = index;\n\t\t\tthis.edges = new ArrayList<>();\n\t\t}\n\n\t\tpublic static <TypeVertex extends Vertex<TypeVertex, TypeEdge>, TypeEdge extends Edge<TypeVertex, TypeEdge>, TypeResult> TypeResult breadthFirstSearch(\n\t\t\t\tTypeVertex vertex,\n\t\t\t\tTypeEdge edge,\n\t\t\t\tBiFunctionResult<TypeVertex, TypeEdge, TypeResult> function,\n\t\t\t\tArray<Boolean> visited,\n\t\t\t\tFIFO<TypeVertex> verticesNext,\n\t\t\t\tFIFO<TypeEdge> edgesNext,\n\t\t\t\tTypeResult result\n\t\t)\n\t\t{\n\t\t\tif (!visited.get(vertex.index))\n\t\t\t{\n\t\t\t\tvisited.set(vertex.index, true);\n\t\t\t\tresult = function.apply(vertex, edge, result);\n\t\t\t\tfor (TypeEdge edgeNext : vertex.edges)\n\t\t\t\t{\n\t\t\t\t\tTypeVertex vertexNext = edgeNext.other(vertex);\n\t\t\t\t\tif (!visited.get(vertexNext.index))\n\t\t\t\t\t{\n\t\t\t\t\t\tverticesNext.push(vertexNext);\n\t\t\t\t\t\tedgesNext.push(edgeNext);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tpublic static <TypeVertex extends Vertex<TypeVertex, TypeEdge>, TypeEdge extends Edge<TypeVertex, TypeEdge>, TypeResult> TypeResult breadthFirstSearch\n\t\t\t\t(\n\t\t\t\t\t\tArray<TypeVertex> vertices,\n\t\t\t\t\t\tint indexVertexStart,\n\t\t\t\t\t\tBiFunctionResult<TypeVertex, TypeEdge, TypeResult> function,\n\t\t\t\t\t\tTypeResult result\n\t\t\t\t)\n\t\t{\n\t\t\tArray<Boolean> visited = new Array<>(vertices.size(), false);\n\t\t\tFIFO<TypeVertex> verticesNext = new FIFO<>();\n\t\t\tverticesNext.push(vertices.get(indexVertexStart));\n\t\t\tFIFO<TypeEdge> edgesNext = new FIFO<>();\n\t\t\tedgesNext.push(null);\n\t\t\twhile (!verticesNext.isEmpty())\n\t\t\t{\n\t\t\t\tresult = breadthFirstSearch(verticesNext.pop(), edgesNext.pop(), function, visited, verticesNext, edgesNext, result);\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tpublic static <\n\t\t\t\tTypeVertex extends Vertex<TypeVertex, TypeEdge>,\n\t\t\t\tTypeEdge extends Edge<TypeVertex, TypeEdge>\n\t\t\t\t>\n\t\tSortedSet<TypeVertex>\n\t\tdepthFirstSearch\n\t\t\t\t(\n\t\t\t\t\t\tTypeVertex start,\n\t\t\t\t\t\tBiConsumer<TypeVertex, TypeEdge> functionVisitPre,\n\t\t\t\t\t\tBiConsumer<TypeVertex, TypeEdge> functionVisitPost\n\t\t\t\t)\n\t\t{\n\t\t\tSortedSet<TypeVertex> result = new SortedSetAVL<>(Comparator.naturalOrder());\n\t\t\tStack<TypeVertex> stackVertex = new Stack<>();\n\t\t\tStack<TypeEdge> stackEdge = new Stack<>();\n\t\t\tstackVertex.push(start);\n\t\t\tstackEdge.push(null);\n\t\t\twhile (!stackVertex.isEmpty())\n\t\t\t{\n\t\t\t\tTypeVertex vertex = stackVertex.pop();\n\t\t\t\tTypeEdge edge = stackEdge.pop();\n\t\t\t\tif (result.contains(vertex))\n\t\t\t\t{\n\t\t\t\t\tfunctionVisitPost.accept(vertex, edge);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tresult.add(vertex);\n\t\t\t\t\tstackVertex.push(vertex);\n\t\t\t\t\tstackEdge.push(edge);\n\t\t\t\t\tfunctionVisitPre.accept(vertex, edge);\n\t\t\t\t\tfor (TypeEdge otherEdge : vertex.edges)\n\t\t\t\t\t{\n\t\t\t\t\t\tTypeVertex otherVertex = otherEdge.other(vertex);\n\t\t\t\t\t\tif (!result.contains(otherVertex))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tstackVertex.push(otherVertex);\n\t\t\t\t\t\t\tstackEdge.push(otherEdge);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tpublic static <\n\t\t\t\tTypeVertex extends Vertex<TypeVertex, TypeEdge>,\n\t\t\t\tTypeEdge extends Edge<TypeVertex, TypeEdge>\n\t\t\t\t>\n\t\tboolean\n\t\tcycle\n\t\t\t\t(\n\t\t\t\t\t\tTypeVertex start,\n\t\t\t\t\t\tSortedSet<TypeVertex> result\n\t\t\t\t)\n\t\t{\n\t\t\tboolean cycle = false;\n\t\t\tStack<TypeVertex> stackVertex = new Stack<>();\n\t\t\tStack<TypeEdge> stackEdge = new Stack<>();\n\t\t\tstackVertex.push(start);\n\t\t\tstackEdge.push(null);\n\t\t\twhile (!stackVertex.isEmpty())\n\t\t\t{\n\t\t\t\tTypeVertex vertex = stackVertex.pop();\n\t\t\t\tTypeEdge edge = stackEdge.pop();\n\t\t\t\tif (!result.contains(vertex))\n\t\t\t\t{\n\t\t\t\t\tresult.add(vertex);\n\t\t\t\t\tfor (TypeEdge otherEdge : vertex.edges)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (otherEdge != edge)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tTypeVertex otherVertex = otherEdge.other(vertex);\n\t\t\t\t\t\t\tif (result.contains(otherVertex))\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tcycle = true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tstackVertex.push(otherVertex);\n\t\t\t\t\t\t\t\tstackEdge.push(otherEdge);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn cycle;\n\t\t}\n\n\t\t@Override\n\t\tpublic int compareTo(Vertex<? super TypeVertex, ? super TypeEdge> that)\n\t\t{\n\t\t\treturn Integer.compare(this.index, that.index);\n\t\t}\n\n\t\t@Override\n\t\tpublic String toString()\n\t\t{\n\t\t\treturn \"\" + this.index;\n\t\t}\n\t}\n\n\tpublic static class VertexDefault<TypeEdge extends Edge<VertexDefault<TypeEdge>, TypeEdge>> extends Vertex<VertexDefault<TypeEdge>, TypeEdge>\n\t{\n\t\tpublic VertexDefault(int index)\n\t\t{\n\t\t\tsuper(index);\n\t\t}\n\t}\n\n\tpublic static class VertexDefaultDefault extends Vertex<VertexDefaultDefault, EdgeDefaultDefault>\n\t{\n\t\tpublic VertexDefaultDefault(int index)\n\t\t{\n\t\t\tsuper(index);\n\t\t}\n\n\t\tpublic static Array<VertexDefaultDefault> vertices(int n)\n\t\t{\n\t\t\tArray<VertexDefaultDefault> result = new Array<>(n);\n\t\t\tfor (int index = 0; index < n; index++)\n\t\t\t{\n\t\t\t\tresult.set(index, new VertexDefaultDefault(index));\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\t}\n\n\tpublic static class Wrapper<Type>\n\t{\n\t\tpublic Type value;\n\n\t\tpublic Wrapper(Type value)\n\t\t{\n\t\t\tthis.value = value;\n\t\t}\n\n\t\tpublic Type get()\n\t\t{\n\t\t\treturn this.value;\n\t\t}\n\n\t\tpublic void set(Type value)\n\t\t{\n\t\t\tthis.value = value;\n\t\t}\n\n\t\t@Override\n\t\tpublic String toString()\n\t\t{\n\t\t\treturn this.value.toString();\n\t\t}\n\t}\n\n\tstatic class Point extends Vertex<Point, EdgeDefault<Point>>\n\t{\n\t\tpublic static final Comparator<Point> COMPARATOR_X = Comparator.comparing(Point::getX);\n\t\tpublic static final Comparator<Point> COMPARATOR_Y = Comparator.comparing(Point::getX);\n\t\tpublic final int x;\n\t\tpublic final int y;\n\n\t\tpublic Point(int index, int x, int y)\n\t\t{\n\t\t\tsuper(index);\n\t\t\tthis.x = x;\n\t\t\tthis.y = y;\n\t\t}\n\n\t\tpublic int getX()\n\t\t{\n\t\t\treturn x;\n\t\t}\n\n\t\tpublic int getY()\n\t\t{\n\t\t\treturn y;\n\t\t}\n\t}\n\n\tpublic static long BIG = 1000000007;\n\n\tpublic static int countLines(Set<Point> points)\n\t{\n\t\tSet<Integer> xs = new SortedSetAVL<>(Comparator.naturalOrder());\n\t\tSet<Integer> ys = new SortedSetAVL<>(Comparator.naturalOrder());\n\t\tfor (Point point : points)\n\t\t{\n\t\t\txs.add(point.getX());\n\t\t\tys.add(point.getY());\n\t\t}\n\t\treturn xs.size() + ys.size();\n\t}\n\n\tpublic static long modMultiply(long a, long b)\n\t{\n\t\treturn (a * b) % BIG;\n\t}\n\n\tpublic static long modAdd(long a, long b)\n\t{\n\t\treturn (a + b) % BIG;\n\t}\n\n\tpublic static long modSubtract(long a, long b)\n\t{\n\t\treturn (a - b + BIG) % BIG;\n\t}\n\n\tpublic static long modPower2(int a)\n\t{\n\t\tlong result = 1;\n\t\tfor (int index = 0; index < a; index++)\n\t\t{\n\t\t\tresult = modMultiply(result, 2);\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static void solve() throws IOException\n\t{\n\t\tint n = nextInt();\n\t\tArray<Point> points = new Array<>(n);\n\t\tMapSet<Integer, Point> y2Points = new MapSet<>(Comparator.naturalOrder(), Point.COMPARATOR_X);\n\t\tfor (int index = 0; index < n; index++)\n\t\t{\n\t\t\tPoint point = new Point(index, nextInt(), nextInt());\n\t\t\tpoints.set(index, point);\n\t\t\ty2Points.add(point.getY(), point);\n\t\t}\n\t\tMap<Integer, Point> x2LastY = new SortedMapAVL<>(Comparator.naturalOrder());\n\t\tfor (Set<Point> set : y2Points.values())\n\t\t{\n\t\t\tPoint lastX = null;\n\t\t\tfor (Point point : set)\n\t\t\t{\n\t\t\t\tif (lastX != null)\n\t\t\t\t{\n\t\t\t\t\tnew EdgeDefault<>(point, lastX, true);\n\t\t\t\t}\n\t\t\t\tlastX = point;\n\t\t\t\tPoint lastY = x2LastY.get(point.getX());\n\t\t\t\tif (lastY != null)\n\t\t\t\t{\n\t\t\t\t\tnew EdgeDefault<>(point, lastY, true);\n\t\t\t\t}\n\t\t\t\tx2LastY.put(point.getX(), point);\n\t\t\t}\n\t\t}\n\t\tMap<Point, Set<Point>> pointsCycleFalse = new SortedMapAVL<>(Comparator.naturalOrder());\n\t\tMap<Point, Set<Point>> pointsCycleTrue = new SortedMapAVL<>(Comparator.naturalOrder());\n\t\tSet<Point> pointsProcessed = new SortedSetAVL<>(Comparator.naturalOrder());\n\t\tfor (Point point : points)\n\t\t{\n\t\t\tif (!pointsProcessed.contains(point))\n\t\t\t{\n\t\t\t\tSortedSet<Point> structure = new SortedSetAVL<>(Comparator.naturalOrder());\n\t\t\t\tif (Vertex.cycle(point, structure))\n\t\t\t\t{\n\t\t\t\t\tpointsCycleTrue.put(point, structure);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tpointsCycleFalse.put(point, structure);\n\t\t\t\t}\n\t\t\t\tpointsProcessed.addAll(structure);\n\t\t\t}\n\t\t}\n\t\tlong result = 1;\n\t\tfor (Set<Point> set : pointsCycleFalse.values())\n\t\t{\n\t\t\tresult = modMultiply(result, modSubtract(modPower2(countLines(set)), 1));\n\t\t}\n\t\tfor (Set<Point> set : pointsCycleTrue.values())\n\t\t{\n\t\t\tresult = modMultiply(result, modPower2(countLines(set)));\n\t\t}\n\t\tout.println(result);\n\t}\n}", "lang_cluster": "Java", "tags": ["graphs"], "code_uid": "c60f78608a1a11e7f7f98789f3e9931c", "src_uid": "8781003d9eea51a509145bc6db8b609c", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.*;\n\nimport static java.lang.Math.random;\n\n/**\n * @author Don Li\n */\npublic class PointsLinesTitles {\n \n int N = (int) 1e5 + 10;\n int MOD = (int) 1e9 + 7;\n \n int n;\n int[][] p;\n List<Integer>[] G;\n \n boolean[] used = new boolean[N];\n Set<Integer> uniqueX = new HashSet<>(), uniqueY = new HashSet<>();\n long sumDegree = 0, numNode = 0;\n \n void solve() {\n n = in.nextInt();\n \n p = new int[n][2];\n for (int i = 0; i < n; i++) {\n p[i][0] = in.nextInt();\n p[i][1] = in.nextInt();\n }\n \n int[] x = new int[n], y = new int[n];\n for (int i = 0; i < n; i++) {\n x[i] = p[i][0];\n y[i] = p[i][1];\n }\n sort(x);\n sort(y);\n for (int i = 0; i < n; i++) {\n p[i][0] = lowerBound(x, p[i][0]);\n p[i][1] = lowerBound(y, p[i][1]);\n }\n \n G = new List[n];\n for (int i = 0; i < n; i++) G[i] = new ArrayList<>();\n \n List<Integer>[] ver = new List[n], hor = new List[n];\n for (int i = 0; i < n; i++) {\n ver[i] = new ArrayList<>();\n hor[i] = new ArrayList<>();\n }\n for (int i = 0; i < n; i++) {\n ver[p[i][0]].add(i);\n hor[p[i][1]].add(i);\n }\n for (int i = 0; i < n; i++) {\n ver[i].sort(Comparator.comparingInt(a -> p[a][1]));\n for (int j = 1; j < ver[i].size(); j++) {\n int u = ver[i].get(j - 1), v = ver[i].get(j);\n addNeighbors(u, v);\n }\n hor[i].sort(Comparator.comparingInt(a -> p[a][0]));\n for (int j = 1; j < hor[i].size(); j++) {\n int u = hor[i].get(j - 1), v = hor[i].get(j);\n addNeighbors(u, v);\n }\n }\n \n long ans = 1;\n for (int i = 0; i < n; i++) {\n if (!used[i]) {\n uniqueX.clear();\n uniqueY.clear();\n sumDegree = 0; numNode = 0;\n dfs(i);\n long ways = mpow(2, uniqueX.size() + uniqueY.size());\n if (sumDegree / 2 == numNode - 1) ways = (ways - 1 + MOD) % MOD;\n ans = ans * ways % MOD;\n }\n }\n out.println(ans);\n }\n \n void dfs(int u) {\n used[u] = true;\n uniqueX.add(p[u][0]);\n uniqueY.add(p[u][1]);\n numNode++;\n sumDegree += G[u].size();\n for (int v : G[u]) {\n if (!used[v]) dfs(v);\n }\n }\n \n long mpow(long a, long n) {\n long res = 1;\n while (n > 0) {\n if ((n & 1) > 0) res = res * a % MOD;\n a = a * a % MOD;\n n >>= 1;\n }\n return res;\n }\n \n void addNeighbors(int u, int v) {\n G[u].add(v);\n G[v].add(u);\n }\n \n void sort(int[] a) {\n int n = a.length;\n for (int i = 0; i < n; i++) {\n int j = (int) (i + random() * (n - i));\n int tmp = a[i];\n a[i] = a[j];\n a[j] = tmp;\n }\n Arrays.sort(a);\n }\n \n int lowerBound(int[] a, int k) {\n int lb = -1, ub = a.length;\n while (ub - lb > 1) {\n int m = (lb + ub) >> 1;\n if (a[m] >= k) ub = m;\n else lb = m;\n }\n return ub;\n }\n \n public static void main(String[] args) {\n in = new FastScanner(new BufferedReader(new InputStreamReader(System.in)));\n out = new PrintWriter(System.out);\n new PointsLinesTitles().solve();\n out.close();\n }\n \n static FastScanner in;\n static PrintWriter out;\n \n static class FastScanner {\n BufferedReader in;\n StringTokenizer st;\n \n public FastScanner(BufferedReader in) {\n this.in = in;\n }\n \n public String nextToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(in.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n \n public int nextInt() {\n return Integer.parseInt(nextToken());\n }\n \n public long nextLong() {\n return Long.parseLong(nextToken());\n }\n \n public double nextDouble() {\n return Double.parseDouble(nextToken());\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["graphs"], "code_uid": "dc3b9853757bca2256175397212fd437", "src_uid": "8781003d9eea51a509145bc6db8b609c", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\nimport java.lang.*;\nimport java.awt.*;\nimport java.awt.geom.*;\nimport java.util.stream.*;\n \n/**\n * @author Pradyumn\n */\n \npublic class Main implements Runnable{\n\tpublic int TC = 0;\n\tpublic static void main(String[] args) {\n\t\tnew Thread(null, new Main(), \":)\", 1L << 26).start();\n\t}\n\tstatic final int MODULO = (int)(1e9 + 7);\n\t@SuppressWarnings(\"Unchecked\")\n\tpublic void solve() throws IOException {\n\t int n = ni();\n\t HashSet<Integer> x = new HashSet<>();\n\t HashSet<Integer> y = new HashSet<>();\n\t HashMap<Integer, Integer> mapX = new HashMap<>();\n\t HashMap<Integer, Integer> mapY = new HashMap<>();\n\t int[][] pp = new int[2][n];\n\t for (int i = 0; i < n; ++i) {\n\t \tfor(int j = 0;j < 2; ++j) {\n\t \t\tpp[j][i] = ni();\n\t \t\tif(j == 0) x.add(pp[j][i]);\n\t \t\telse y.add(pp[j][i]);\n\t \t}\n\t }\n\n\t int mapIdx = 0;\n\t for(int xx : x) \n\t \tif(!mapX.containsKey(xx)) \n\t \t\tmapX.put(xx, mapIdx++);\n\n\t for(int yy : y) \n\t \tif(!mapY.containsKey(yy)) \n\t \t\tmapY.put(yy, mapIdx++);\n\n\t DJSet ds = new DJSet(mapIdx);\n\t for(int i = 0;i < n; ++i) {\n\t \tds.union(mapX.get(pp[0][i]), mapY.get(pp[1][i]));\n\t }\n\n\t long res = 1;\n\t factorial();\n\t for (int i = 0; i < mapIdx; i++)\n if (ds.upper[i] < 0) {\n int numPoints = ds.pointsNum[i], lines = -ds.upper[i];\n long ways = 0;\n for (int j = 0; j <= Math.min(numPoints, lines); j++) {\n ways += ncr(lines, j);\n if (ways >= MODULO) ways -= MODULO;\n }\n res *= ways;\n res %= MODULO;\n }\n\t out.println(res);\n\t}\n\t// O(1) nCr\n static int MAX = 5 * 100000 + 1;\n static int fact[] = new int[MAX];\n\n static int ncr(int n, int r) {\n return (int) ((long) fact[n] * ((inv(fact[r], MODULO) * inv(fact[n - r], MODULO)) % MODULO) % MODULO) % MODULO;\n }\n\n static long inv(long x, long mod) {\n long r, y;\n for (r = 1, y = mod - 2; y != 0; x = x * x % mod, y >>= 1)\n if ((y & 1) == 1)\n r = r * x % mod;\n return r;\n }\n\n static void factorial() {\n fact[0] = fact[1] = 1;\n for (int i = 2; i < MAX; i++)\n fact[i] = (int) ((long) i * fact[i - 1] % MODULO);\n }\n\n public static long powMod(long a, long n) {\n \tlong res = 1;\n \tlong t = a;\n \tfor(int i = 0;i < 63; ++i) {\n \t\tif((n & (1L << i)) != 0)\n \t\t\tres = (res + t) % MODULO;\n \t\tt = t * t % MODULO;\n \t}\n return res;\n }\n\tpublic class DJSet {\n\t public int[] upper;\n\t public int[] pointsNum;\n\t public int count;\n\t public DJSet(int n) {\n\t upper = new int[n];\n\t count = n;\n\t pointsNum = new int[n];\n\t Arrays.fill(upper, -1);\n\t }\n\n\n\t public int root(int x) {\n\t return upper[x] < 0 ? x : (upper[x] = root(upper[x]));\n\t }\n\n\t public boolean equiv(int x, int y) {\n\t return root(x) == root(y);\n\t }\n\n\t public boolean union(int x, int y) {\n\t x = root(x);\n\t y = root(y);\n\t if (x != y) {\n\t if (upper[y] < upper[x]) {\n\t int d = x;\n\t x = y;\n\t y = d;\n\t }\n\t upper[x] += upper[y];\n\t upper[y] = x;\n\t pointsNum[x] += 1 + pointsNum[y];\n\t --count;\n\t return true;\n\t } else {\n\t \t++pointsNum[x];\n\t }\n\t return false;\n\t }\n\n\t public int getCount() {\n\t return count;\n\t }\n\n\t public long size(int u) {\n\t return -upper[root(u)];\n\t }\n\n\t public void clear() {\n\t Arrays.fill(upper, -1);\n\t }\n\t}\n\tBufferedReader br;\n\tStringTokenizer st;\n\tPrintWriter out;\n\tpublic void run() {\n\t\ttry {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in),32768);\n\t\t\tst = null;\n\t\t\tout = new PrintWriter(System.out);\n\t\t\tif(TC == 1) {\n\t\t\t\tfor(int T = ni();T > 0; --T) {\n\t\t\t\t\tsolve();\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tsolve();\n\t\t\t}\n\t\t\tbr.close();\n\t\t\tout.close();\n\t\t} catch(IOException e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(1);\n\t\t}\n\t}\n\tpublic char[] nsc( ) throws IOException {\n\t\treturn ns().toCharArray();\n\t}\n\tpublic char[][] nm(int n, int m) throws IOException {\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n; ++i) {\n\t\t\tmap[i] = nsc();\n\t\t}\n\t\treturn map;\n\t}\n\tpublic String ns() throws IOException {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\tst = new StringTokenizer(br.readLine());\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\tpublic String nextLine() throws IOException {\n\t\treturn br.readLine();\n\t}\n\tpublic int ni() throws IOException {\n\t\treturn Integer.parseInt(ns());\n\t}\n \n\tpublic int[] na(int n) throws IOException {\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n; ++i) a[i] = ni();\n\t\treturn a;\n\t}\n \n\tpublic long nl() throws IOException {\n\t\treturn Long.parseLong(ns());\n\t}\n \n\tpublic long[] nal(int n) throws IOException {\n\t\tlong[] a = new long[n];\n\t\tfor(int i = 0;i < n; ++i) a[i] = nl();\n\t\treturn a;\n\t}\n \n\tpublic double nd() throws IOException {\n\t\treturn Double.parseDouble(ns());\n\t}\n\tprivate static boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate static void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); } \n}\n", "lang_cluster": "Java", "tags": ["graphs"], "code_uid": "673c488868f2845883055edc13a847c3", "src_uid": "8781003d9eea51a509145bc6db8b609c", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\nimport java.lang.*;\nimport java.awt.*;\nimport java.awt.geom.*;\nimport java.util.stream.*;\n \n/**\n * @author Pradyumn\n */\n \npublic class Main implements Runnable{\n\tpublic int TC = 0;\n\tpublic static void main(String[] args) {\n\t\tnew Thread(null, new Main(), \":)\", 1L << 26).start();\n\t}\n\n\tstatic final int MODULO = (int)(1e9 + 7);\n\n\t@SuppressWarnings(\"Unchecked\")\n\tpublic void solve() throws IOException {\n\t int n = ni();\n\t HashSet<Integer> x = new HashSet<>();\n\t HashSet<Integer> y = new HashSet<>();\n\t HashMap<Integer, Integer> mapX = new HashMap<>();\n\t HashMap<Integer, Integer> mapY = new HashMap<>();\n\t int[][] pp = new int[2][n];\n\n\t for (int i = 0; i < n; ++i) {\n\t \tfor(int j = 0;j < 2; ++j) {\n\t \t\tpp[j][i] = ni();\n\t \t\tif(j == 0) x.add(pp[j][i]);\n\t \t\telse y.add(pp[j][i]);\n\t \t}\n\t }\n\n\t int mapIdx = 0;\n\t for(int xx : x) \n\t \tif(!mapX.containsKey(xx)) \n\t \t\tmapX.put(xx, mapIdx++);\n\n\t for(int yy : y) \n\t \tif(!mapY.containsKey(yy)) \n\t \t\tmapY.put(yy, mapIdx++);\n\n\t DJSet ds = new DJSet(mapIdx);\n\t for(int i = 0;i < n; ++i) {\n\t \tds.union(mapX.get(pp[0][i]), mapY.get(pp[1][i]));\n\t }\n\n\t long res = 1;\n\t factorial();\n\t for (int i = 0; i < mapIdx; i++)\n if (ds.upper[i] < 0) {\n int numPoints = ds.pointsNum[i], lines = -ds.upper[i];\n long ways = 0;\n for (int j = 0; j <= Math.min(numPoints, lines); j++) {\n ways += ncr(lines, j);\n if (ways >= MODULO) ways %= MODULO;\n }\n res *= ways;\n res %= MODULO;\n }\n\t out.println(res);\n\t}\n\n\t// O(1) nCr\n static int MAX = 5 * 100000 + 1;\n static int fact[] = new int[MAX];\n\n static int ncr(int n, int r) {\n return (int) ((long) fact[n] * ((inv(fact[r], MODULO) * inv(fact[n - r], MODULO)) % MODULO) % MODULO) % MODULO;\n }\n\n static long inv(long x, long mod) {\n long r, y;\n for (r = 1, y = mod - 2; y != 0; x = x * x % mod, y >>= 1)\n if ((y & 1) == 1)\n r = r * x % mod;\n return r;\n }\n\n static void factorial() {\n fact[0] = fact[1] = 1;\n for (int i = 2; i < MAX; i++)\n fact[i] = (int) ((long) i * fact[i - 1] % MODULO);\n }\n\n public static long powMod(long a, long n) {\n \tlong res = 1;\n \tlong t = a;\n \tfor(int i = 0;i < 33; ++i) {\n \t\tif((n & (1L << i)) != 0)\n \t\t\tres = (res + t) % MODULO;\n \t\tt = t * t % MODULO;\n \t}\n return res;\n }\n\n\tpublic class DJSet {\n\t public int[] upper;\n\t public int[] pointsNum;\n\t public int count;\n\t public DJSet(int n) {\n\t upper = new int[n];\n\t count = n;\n\t pointsNum = new int[n];\n\t Arrays.fill(upper, -1);\n\t }\n\n\n\t public int root(int x) {\n\t return upper[x] < 0 ? x : (upper[x] = root(upper[x]));\n\t }\n\n\t public boolean equiv(int x, int y) {\n\t return root(x) == root(y);\n\t }\n\n\t public boolean union(int x, int y) {\n\t x = root(x);\n\t y = root(y);\n\t if (x != y) {\n\t if (upper[y] < upper[x]) {\n\t int d = x;\n\t x = y;\n\t y = d;\n\t }\n\t upper[x] += upper[y];\n\t upper[y] = x;\n\t pointsNum[x] += 1 + pointsNum[y];\n\t --count;\n\t return true;\n\t } else {\n\t \t++pointsNum[x];\n\t }\n\t return false;\n\t }\n\n\t public int getCount() {\n\t return count;\n\t }\n\n\t public long size(int u) {\n\t return -upper[root(u)];\n\t }\n\n\t public void clear() {\n\t Arrays.fill(upper, -1);\n\t }\n\t}\n\n\tBufferedReader br;\n\tStringTokenizer st;\n\tPrintWriter out;\n\tpublic void run() {\n\t\ttry {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in),32768);\n\t\t\tst = null;\n\t\t\tout = new PrintWriter(System.out);\n\t\t\tif(TC == 1) {\n\t\t\t\tfor(int T = ni();T > 0; --T) {\n\t\t\t\t\tsolve();\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tsolve();\n\t\t\t}\n\t\t\tbr.close();\n\t\t\tout.close();\n\t\t} catch(IOException e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(1);\n\t\t}\n\t}\n\tpublic char[] nsc( ) throws IOException {\n\t\treturn ns().toCharArray();\n\t}\n\tpublic char[][] nm(int n, int m) throws IOException {\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n; ++i) {\n\t\t\tmap[i] = nsc();\n\t\t}\n\t\treturn map;\n\t}\n\tpublic String ns() throws IOException {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\tst = new StringTokenizer(br.readLine());\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\tpublic String nextLine() throws IOException {\n\t\treturn br.readLine();\n\t}\n\tpublic int ni() throws IOException {\n\t\treturn Integer.parseInt(ns());\n\t}\n \n\tpublic int[] na(int n) throws IOException {\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n; ++i) a[i] = ni();\n\t\treturn a;\n\t}\n \n\tpublic long nl() throws IOException {\n\t\treturn Long.parseLong(ns());\n\t}\n \n\tpublic long[] nal(int n) throws IOException {\n\t\tlong[] a = new long[n];\n\t\tfor(int i = 0;i < n; ++i) a[i] = nl();\n\t\treturn a;\n\t}\n \n\tpublic double nd() throws IOException {\n\t\treturn Double.parseDouble(ns());\n\t}\n\tprivate static boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate static void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); } \n}\n", "lang_cluster": "Java", "tags": ["graphs"], "code_uid": "ba5870621639da35f8b7825a61e7b15e", "src_uid": "8781003d9eea51a509145bc6db8b609c", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\nimport java.lang.*;\nimport java.awt.*;\nimport java.awt.geom.*;\nimport java.util.stream.*;\n \n/**\n * @author Pradyumn\n */\n \npublic class Main implements Runnable{\n\tpublic int TC = 0;\n\tpublic static void main(String[] args) {\n\t\tnew Thread(null, new Main(), \":)\", 1L << 26).start();\n\t}\n\n\tstatic final int MODULO = (int)(1e9 + 7);\n\n\t@SuppressWarnings(\"Unchecked\")\n\tpublic void solve() throws IOException {\n\t int n = ni();\n\t HashSet<Integer> x = new HashSet<>();\n\t HashSet<Integer> y = new HashSet<>();\n\t HashMap<Integer, Integer> mapX = new HashMap<>();\n\t HashMap<Integer, Integer> mapY = new HashMap<>();\n\t int[][] pp = new int[2][n];\n\n\t for (int i = 0; i < n; ++i) {\n\t \tfor(int j = 0;j < 2; ++j) {\n\t \t\tpp[j][i] = ni();\n\t \t\tif(j == 0) x.add(pp[j][i]);\n\t \t\telse y.add(pp[j][i]);\n\t \t}\n\t }\n\n\t int mapIdx = 0;\n\t for(int xx : x) \n\t \tif(!mapX.containsKey(xx)) \n\t \t\tmapX.put(xx, mapIdx++);\n\n\t for(int yy : y) \n\t \tif(!mapY.containsKey(yy)) \n\t \t\tmapY.put(yy, mapIdx++);\n\n\t DJSet ds = new DJSet(mapIdx);\n\t for(int i = 0;i < n; ++i) {\n\t \tds.union(mapX.get(pp[0][i]), mapY.get(pp[1][i]));\n\t }\n\n\t long res = 1;\n\t factorial();\n\t for (int i = 0; i < mapIdx; i++)\n if (ds.upper[i] < 0) {\n int numPoints = ds.pointsNum[i], lines = -ds.upper[i];\n long ways = 0;\n for (int j = 0; j <= Math.min(numPoints, lines); j++) {\n ways += ncr(lines, j);\n if (ways >= MODULO) ways %= MODULO;\n }\n res *= ways;\n res %= MODULO;\n }\n\t out.println(res);\n\t}\n\n\t// O(1) nCr\n static int MAX = 5 * 100000 + 1;\n static int fact[] = new int[MAX];\n\n static int ncr(int n, int r) {\n return (int) ((long) fact[n] * ((inv(fact[r], MODULO) * inv(fact[n - r], MODULO)) % MODULO) % MODULO) % MODULO;\n }\n\n static long inv(long x, long mod) {\n long r, y;\n for (r = 1, y = mod - 2; y != 0; x = x * x % mod, y >>= 1)\n if ((y & 1) == 1)\n r = r * x % mod;\n return r;\n }\n\n static void factorial() {\n fact[0] = fact[1] = 1;\n for (int i = 2; i < MAX; i++)\n fact[i] = (int) ((long) i * fact[i - 1] % MODULO);\n }\n\n public static long powMod(long a, long n) {\n \tlong res = 1;\n \tlong t = a;\n \tfor(int i = 0;i < 63; ++i) {\n \t\tif((n & (1L << i)) != 0)\n \t\t\tres = (res + t) % MODULO;\n \t\tt = t * t % MODULO;\n \t}\n return res;\n }\n\n\tpublic class DJSet {\n\t public int[] upper;\n\t public int[] pointsNum;\n\t public int count;\n\t public DJSet(int n) {\n\t upper = new int[n];\n\t count = n;\n\t pointsNum = new int[n];\n\t Arrays.fill(upper, -1);\n\t }\n\n\n\t public int root(int x) {\n\t return upper[x] < 0 ? x : (upper[x] = root(upper[x]));\n\t }\n\n\t public boolean equiv(int x, int y) {\n\t return root(x) == root(y);\n\t }\n\n\t public boolean union(int x, int y) {\n\t x = root(x);\n\t y = root(y);\n\t if (x != y) {\n\t if (upper[y] < upper[x]) {\n\t int d = x;\n\t x = y;\n\t y = d;\n\t }\n\t upper[x] += upper[y];\n\t upper[y] = x;\n\t pointsNum[x] += 1 + pointsNum[y];\n\t --count;\n\t return true;\n\t } else {\n\t \t++pointsNum[x];\n\t }\n\t return false;\n\t }\n\n\t public int getCount() {\n\t return count;\n\t }\n\n\t public long size(int u) {\n\t return -upper[root(u)];\n\t }\n\n\t public void clear() {\n\t Arrays.fill(upper, -1);\n\t }\n\t}\n\n\tBufferedReader br;\n\tStringTokenizer st;\n\tPrintWriter out;\n\tpublic void run() {\n\t\ttry {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in),32768);\n\t\t\tst = null;\n\t\t\tout = new PrintWriter(System.out);\n\t\t\tif(TC == 1) {\n\t\t\t\tfor(int T = ni();T > 0; --T) {\n\t\t\t\t\tsolve();\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tsolve();\n\t\t\t}\n\t\t\tbr.close();\n\t\t\tout.close();\n\t\t} catch(IOException e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(1);\n\t\t}\n\t}\n\tpublic char[] nsc( ) throws IOException {\n\t\treturn ns().toCharArray();\n\t}\n\tpublic char[][] nm(int n, int m) throws IOException {\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n; ++i) {\n\t\t\tmap[i] = nsc();\n\t\t}\n\t\treturn map;\n\t}\n\tpublic String ns() throws IOException {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\tst = new StringTokenizer(br.readLine());\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\tpublic String nextLine() throws IOException {\n\t\treturn br.readLine();\n\t}\n\tpublic int ni() throws IOException {\n\t\treturn Integer.parseInt(ns());\n\t}\n \n\tpublic int[] na(int n) throws IOException {\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n; ++i) a[i] = ni();\n\t\treturn a;\n\t}\n \n\tpublic long nl() throws IOException {\n\t\treturn Long.parseLong(ns());\n\t}\n \n\tpublic long[] nal(int n) throws IOException {\n\t\tlong[] a = new long[n];\n\t\tfor(int i = 0;i < n; ++i) a[i] = nl();\n\t\treturn a;\n\t}\n \n\tpublic double nd() throws IOException {\n\t\treturn Double.parseDouble(ns());\n\t}\n\tprivate static boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate static void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); } \n}\n", "lang_cluster": "Java", "tags": ["graphs"], "code_uid": "5a17f3462bb0f5198003d8940337966f", "src_uid": "8781003d9eea51a509145bc6db8b609c", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.ByteArrayOutputStream;\nimport java.util.HashMap;\nimport java.util.ArrayList;\nimport java.util.HashSet;\nimport java.util.StringTokenizer;\nimport java.util.Map;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Set;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.FileNotFoundException;\nimport java.io.File;\nimport java.util.List;\nimport java.util.TreeMap;\nimport java.io.Writer;\nimport java.io.BufferedReader;\nimport java.io.FileReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n E solver = new E();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class E extends SimpleSavingChelperSolution {\n private int[] x;\n private int[] y;\n private int n;\n private Map<Integer, Integer> xMap;\n private Map<Integer, Integer> yMap;\n private List<Set<Integer>> edges;\n private boolean[] visited;\n private long MOD;\n\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n wrapSolve(testNumber, in, out);\n }\n\n\n public void solve(int testNumber) {\n n = in.nextInt();\n\n x = new int[n];\n y = new int[n];\n\n xMap = new TreeMap<>();\n yMap = new TreeMap<>();\n\n edges = new ArrayList<>();\n\n for (int i = 0; i < n; i++) {\n edges.add(new HashSet<>());\n }\n\n Map<Integer, Integer> prevX = new HashMap<>();\n Map<Integer, Integer> prevY = new HashMap<>();\n\n for (int i = 0; i < n; i++) {\n x[i] = in.nextInt();\n y[i] = in.nextInt();\n\n xMap.put(x[i], xMap.getOrDefault(x[i], 0) + 1);\n yMap.put(y[i], yMap.getOrDefault(y[i], 0) + 1);\n\n Integer pX = prevX.get(x[i]);\n Integer pY = prevY.get(y[i]);\n\n if (pX != null) {\n edges.get(pX).add(i);\n edges.get(i).add(pX);\n }\n if (pY != null) {\n edges.get(pY).add(i);\n edges.get(i).add(pY);\n }\n\n prevX.put(x[i], i);\n prevY.put(y[i], i);\n }\n\n visited = new boolean[n];\n\n long ans = 1;\n\n MOD = 1000000007;\n\n for (int i = 0; i < n; i++) {\n if (visited[i]) {\n continue;\n }\n\n List<Integer> res = new ArrayList<>();\n dfs(i, res);\n\n Set<Integer> usedX = new HashSet<>();\n Set<Integer> usedY = new HashSet<>();\n\n for (Integer j : res) {\n usedX.add(x[j]);\n usedY.add(y[j]);\n }\n\n int K = usedX.size() + usedY.size();\n if (res.size() >= K) {\n ans = ans * twopow(K) % MOD;\n } else {\n ans = ans * ((twopow(K) - 1 + MOD) % MOD) % MOD;\n }\n }\n\n\n out.println(ans);\n }\n\n long twopow(int n) {\n if (n == 0) {\n return 1;\n }\n if (n % 2 == 0) {\n long t = twopow(n / 2);\n return t * t % MOD;\n }\n return twopow(n - 1) * 2 % MOD;\n }\n\n void dfs(int v, List<Integer> res) {\n if (visited[v]) {\n return;\n }\n visited[v] = true;\n res.add(v);\n\n for (int j : edges.get(v)) {\n dfs(j, res);\n }\n }\n\n }\n\n static class InputReader {\n private BufferedReader br;\n private StringTokenizer in;\n\n public InputReader(String fileName) {\n try {\n br = new BufferedReader(new FileReader(fileName));\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n\n public InputReader(InputStream inputStream) {\n br = new BufferedReader(new InputStreamReader(inputStream));\n }\n\n private boolean hasMoreTokens() {\n while (in == null || !in.hasMoreTokens()) {\n String s = nextLine();\n if (s == null) {\n return false;\n }\n in = new StringTokenizer(s);\n }\n return true;\n }\n\n public String nextString() {\n return hasMoreTokens() ? in.nextToken() : null;\n }\n\n public String nextLine() {\n try {\n in = null;\n return br.readLine();\n } catch (Exception e) {\n e.printStackTrace();\n return null;\n }\n }\n\n public int nextInt() {\n return Integer.parseInt(nextString());\n }\n\n }\n\n static class OutputWriter extends PrintWriter {\n\n public void close() {\n super.close();\n }\n\n public OutputWriter(String fileName) throws FileNotFoundException {\n super(fileName);\n }\n\n public OutputWriter(OutputStream outputStream) {\n super(outputStream);\n }\n\n public OutputWriter(Writer writer) {\n super(writer);\n }\n\n }\n\n static abstract class SimpleSavingChelperSolution extends SavingChelperSolution {\n\n public String processOutputPreCheck(int testNumber, String output) {\n return output;\n }\n\n\n public String processOutputPostCheck(int testNumber, String output) {\n return output;\n }\n\n }\n\n static abstract class SavingChelperSolution {\n protected int testNumber;\n public InputReader in;\n public OutputWriter out;\n private OutputWriter toFile;\n private boolean local = new File(\"chelper.properties\").exists();\n public OutputWriter debug;\n\n {\n if (local) {\n debug = new OutputWriter(System.out);\n } else {\n debug = new OutputWriter(new OutputStream() {\n\n public void write(int b) {\n }\n });\n }\n }\n\n public SavingChelperSolution() {\n try {\n toFile = new OutputWriter(\"last_test_output.txt\");\n } catch (FileNotFoundException e) {\n throw new RuntimeException(e);\n }\n }\n\n public abstract void solve(int testNumber);\n\n public abstract String processOutputPreCheck(int testNumber, String output);\n\n public abstract String processOutputPostCheck(int testNumber, String output);\n\n public void wrapSolve(int testNumber, InputReader in, OutputWriter out) {\n this.testNumber = testNumber;\n\n ByteArrayOutputStream substituteOutContents = new ByteArrayOutputStream();\n OutputWriter substituteOut = new OutputWriter(substituteOutContents);\n\n this.in = in;\n this.out = substituteOut;\n\n solve(testNumber);\n substituteOut.flush();\n\n String result = substituteOutContents.toString();\n\n result = processOutputPreCheck(testNumber, result);\n out.print(result);\n out.flush();\n\n if (local) {\n debug.flush();\n\n result = processOutputPostCheck(testNumber, result);\n toFile.print(result);\n toFile.flush();\n }\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["graphs"], "code_uid": "f08dedbc4b650c5814594304c1de4fca", "src_uid": "8781003d9eea51a509145bc6db8b609c", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n\n public static void main(String[] args) throws IOException {\n\n Scanner sc = new Scanner(System.in);\n PrintWriter out = new PrintWriter(System.out);\n\n int n = sc.nextInt();\n HashSet<Integer> x = new HashSet<>(), y = new HashSet<>();\n HashMap<Integer, Integer> mapX = new HashMap<>(), mapY = new HashMap<>();\n int[][] arr = new int[2][n];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < 2; j++) {\n arr[j][i] = sc.nextInt();\n if (j == 0) x.add(arr[j][i]);\n else y.add(arr[j][i]);\n }\n }\n\n int mapIdxX = 0;\n for (int xx : x) if (!mapX.containsKey(xx)) mapX.put(xx, mapIdxX++);\n for (int yy : y) if (!mapY.containsKey(yy)) mapY.put(yy, mapIdxX++);\n\n UnionFind uf = new UnionFind(mapIdxX);\n for (int i = 0; i < n; i++)\n uf.unionSet(mapX.get(arr[0][i]), mapY.get(arr[1][i]));\n\n uf.close();\n long res = 1;\n int mod = (int) 1e9 + 7;\n factorial();\n for (int i = 0; i < mapIdxX; i++)\n if (uf.p[i] == i) {\n int numPoints = uf.numPoints[i], lines = uf.sizeOfSet(i);\n long ways = 0;\n for (int j = 0; j <= Math.min(numPoints, lines); j++) {\n ways += ncr(lines, j);\n if (ways >= mod) ways -= mod;\n }\n res *= ways;\n res %= mod;\n\n }\n\n\n out.println(res);\n out.close();\n }\n\n // O(1) nCr\n static int MAX = 5 * 100000 + 1;\n static int fact[] = new int[MAX];\n static int MOD = (int) 1e9 + 7;\n\n static int ncr(int n, int r) {\n return (int) ((long) fact[n] * ((inv(fact[r], MOD) * inv(fact[n - r], MOD)) % MOD) % MOD) % MOD;\n }\n\n static long inv(long x, long mod) {\n long r, y;\n for (r = 1, y = mod - 2; y != 0; x = x * x % mod, y >>= 1)\n if ((y & 1) == 1)\n r = r * x % mod;\n return r;\n }\n\n static void factorial() {\n fact[0] = fact[1] = 1;\n for (int i = 2; i < MAX; i++)\n fact[i] = (int) ((long) i * fact[i - 1] % MOD);\n }\n\n public static long modular_exponentiation(long a, long b, long c) // returns ( a ^ b ) % c\n {\n long ans = 1L;\n while (b != 0) {\n if ((b & (1)) == 1)\n ans = (ans * a) % c;\n\n a = (a * a) % c;\n b >>= 1L;\n }\n\n return ans;\n }\n\n static class UnionFind {\n private int[] p, rank, setSize, numPoints;\n private int numSets;\n\n public UnionFind(int size) {\n p = new int[size];\n rank = new int[size];\n setSize = new int[size];\n numPoints = new int[size];\n numSets = size;\n for (int i = 0; i < size; ++i) {\n p[i] = i;\n numPoints[i] = 0;\n setSize[i] = 1;\n }\n }\n\n int findSet(int i) {\n return (p[i] == i) ? i : (p[i] = findSet(p[i]));\n }\n\n boolean isSameSet(int i, int j) {\n return findSet(i) == findSet(j);\n }\n\n void unionSet(int i, int j) {\n if (!isSameSet(i, j)) {\n --numSets;\n int x = findSet(i), y = findSet(j);\n if (rank[x] > rank[y]) {\n p[y] = x;\n setSize[x] = setSize[x] + setSize[y];\n numPoints[x] = 1 + numPoints[x] + numPoints[y];\n } else {\n p[x] = y;\n setSize[y] = setSize[y] + setSize[x];\n numPoints[y] = numPoints[y] + numPoints[x] + 1;\n if (rank[x] == rank[y]) ++rank[y];\n }\n } else {\n numPoints[findSet(i)]++;\n }\n }\n\n int numDisjointSets() {\n return numSets;\n }\n\n void close() {\n for (int i = 0; i < p.length; i++)\n findSet(i);\n }\n\n int sizeOfSet(int i) {\n return setSize[findSet(i)];\n }\n }\n\n static class Scanner {\n StringTokenizer st;\n BufferedReader br;\n\n public Scanner(InputStream s) {\n br = new BufferedReader(new InputStreamReader(s));\n }\n\n public Scanner(String s) throws FileNotFoundException {\n br = new BufferedReader(new FileReader(s));\n }\n\n public String next() throws IOException {\n while (st == null || !st.hasMoreTokens())\n st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n\n public int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n public long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n public String nextLine() throws IOException {\n return br.readLine();\n }\n\n public double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n\n public boolean ready() throws IOException {\n return br.ready();\n }\n }\n}", "lang_cluster": "Java", "tags": ["graphs"], "code_uid": "6eb1f8d4e1736adf9c22362b8c7b99bf", "src_uid": "8781003d9eea51a509145bc6db8b609c", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.* ;\nimport java.util.* ;\nimport java.util.stream.* ;\nimport java.text.* ;\nimport java.math.* ;\npublic class Codeshefcode{\n\tpublic static void main(String[] args) throws IOException{\n\t\tSolver Machine = new Solver() ;\n\t\tMachine.Solve() ;\t\n\t\tMachine.Finish();\n\t}\t\n}\nclass Mod{\n\tstatic long mod=1000000007 ;\n\tstatic long d(long a,long b){ return (a*MI(b))%mod ; }\n\tstatic long m(long a , long b){ return (a*b)%mod ; }\n\tstatic private long MI(long a ){ return pow(a,mod-2) ; }\n\tstatic long pow(long a,long b){\n\t\tif(b<0) return pow(MI(a),-b) ;\n\t\tlong val=a ; long ans=1 ;\n\t\twhile(b!=0){\n\t\t\tif((b&1)==1) ans = (ans*val)%mod ; \n\t\t\tval = (val*val)%mod ; \n\t\t\tb>>=1 ;\n\t\t}\n\t\treturn ans ;\n\t}\t\n}\nclass pair implements Comparable<pair>{\n\tlong x ; int y ; \n\tpair(long x,int y){ this.x=x ; this.y=y ;}\n\tpublic int compareTo(pair p){\n\t\treturn (this.x<p.x ? -1 : (this.x>p.x ? 1 : (this.y<p.y ? -1 : (this.y>p.y ? 1 : 0)))) ;\n\t}\n}\nclass Solver{\t\n\tFasterScanner ip = new FasterScanner(System.in) ;\t \n\tPrintWriter op = new PrintWriter(System.out) ;\n\tlong offset = 2000000001l ;\n\tvoid Solve() throws IOException{\n\t\tint m = ip.i() ;\n\t\tlong edges[][] = new long[m][] ;\n\t\tfor(int i=0 ; i<m ; i++){\n\t\t\tlong tmp[] = {ip.l(),ip.l()+offset} ;\n\t\t\tedges[i] = tmp ;\n\t\t}\n\t\tmyset set = new myset() ;\n\t\tfor(int i=0 ; i<m ; i++){\n\t\t\tset.add(edges[i][0]) ;\n\t\t\tset.add(edges[i][1]) ;\n\t\t}\n\t\tmymap map = new mymap() ;\n\t\tint n=0 ;\n\t\tfor(long elem : set) map.put(elem,n++) ;\n\t\tfor(int i=0 ; i<m ; i++){\n\t\t\tlong tmp[] = {map.get(edges[i][0]),map.get(edges[i][1])} ;\n\t\t\tedges[i] = tmp ;\n\t\t}\n\t\tmylist adj[] = new mylist[n] ;\n\t\tfor(int i=0 ; i<n ; i++) adj[i] = new mylist() ;\n\t\tfor(int i=0 ; i<m ; i++){\n\t\t\tint x = (int) edges[i][0] ;\n\t\t\tint y = (int) edges[i][1] ;\n\t\t\tadj[x].add(y) ; adj[y].add(x) ;\n\t\t}\n\t\tint comp[] = new int[n] ;\n\t\tArrays.fill(comp,-1) ;\n\t\tint clr=0 ;\n\t\tfor(int i=0 ; i<n ; i++){\n\t\t\tif(comp[i]==-1){\n\t\t\t\tmystack S = new mystack() ;\n\t\t\t\tS.add(i) ;\n\t\t\t\tcomp[i]=clr ;\n\t\t\t\twhile(!S.isEmpty()){\n\t\t\t\t\tint nd = S.pop() ;\n\t\t\t\t\tfor(int nnd : adj[nd])\n\t\t\t\t\t\tif(comp[nnd]==-1){\n\t\t\t\t\t\t\tS.push(nnd) ;\n\t\t\t\t\t\t\tcomp[nnd]=clr ;\n\t\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tclr++ ;\n\t\t\t}\n\t\t}\n\t\tint cntn[] = new int[clr] ;\n\t\tint cntm[] = new int[clr] ;\n\t\tfor(int i=0 ; i<n ; i++) cntn[comp[i]]++ ;\n\t\tfor(int i=0 ; i<m ; i++) cntm[comp[(int) edges[i][0]]]++ ;\n\t\tlong res=1 ;\n\t\tfor(int i=0 ; i<clr ; i++){\n\t\t\tif(cntm[i]>=cntn[i]) \n\t\t\t\tres = Mod.m(res,Mod.pow(2,cntn[i])) ;\n\t\t\telse\n\t\t\t\tres = Mod.m(res,Mod.pow(2,cntn[i])+(Mod.mod-1)) ;\n\t\t}\n\t\tpln(res) ;\n\t}\n\tvoid p(Object o){\n\t\top.print(o) ;\n\t}\n\tvoid pln(Object o){\n\t\top.println(o) ;\n\t}\n\tvoid pArr(String name,Object arr,char type){\n\t\tp(name+\": [\") ;\n\t\tif(type=='i'){ \n\t\t\tint arr1[] = (int[]) arr ;\n\t\t\tfor(int i=0 ; i<arr1.length ; i++) p(arr1[i]+(i+1==arr1.length ? \"\" : \",\")) ;\t\t \n\t\t}else if(type=='l'){ \n\t\t\tlong arr1[] = (long[]) arr ;\n\t\t\tfor(int i=0 ; i<arr1.length ; i++) p(arr1[i]+(i+1==arr1.length ? \"\" : \",\")) ;\n\t\t}else if(type=='b'){\n\t\t\tboolean arr1[] = (boolean[]) arr ;\n\t\t\tfor(int i=0 ; i<arr1.length ; i++) p((arr1[i] ? 1 : 0)+(i+1==arr1.length ? \"\" : \",\")) ;\n\t\t}\n\t\tpln(\"]\") ;\n\t}\t\n\tvoid Finish(){\n\t\top.flush();\n\t\top.close();\n\t}\t\n}\n@SuppressWarnings(\"serial\")\nclass mylist extends ArrayList<Integer>{\n}\n@SuppressWarnings(\"serial\")\nclass myset extends TreeSet<Long>{\n \n}\n@SuppressWarnings(\"serial\")\nclass mystack extends Stack<Integer>{\n}\n@SuppressWarnings(\"serial\")\nclass mymap extends TreeMap<Long,Integer>{\n}\nclass FasterScanner { \n\tprivate InputStream mIs;\n\tprivate byte[] buf = new byte[1024];\n\tprivate int curChar,numChars;\n\tpublic FasterScanner() { this(System.in); } \n\tpublic FasterScanner(InputStream is) { mIs = is;} \n\tpublic int read() {\n\t\tif (numChars == -1) throw new InputMismatchException(); \n\t\tif (curChar >= numChars) {\n\t\t\tcurChar = 0;\n\t\t\ttry { numChars = mIs.read(buf);} catch (IOException e) { throw new InputMismatchException();}\n\t\t\tif (numChars <= 0) return -1; \n\t\t}\n\t\treturn buf[curChar++];\n\t} \n\tpublic String nextLine(){\n\t\tint c = read();\n\t\twhile (isSpaceChar(c)) c = read(); \n\t\tStringBuilder res = new StringBuilder();\n\t\tdo {\n\t\t\tres.appendCodePoint(c);\n\t\t\tc = read();\n\t\t} while (!isEndOfLine(c));\n\t\treturn res.toString();\n\t} \n\tpublic String S(){\n\t\tint c = read();\n\t\twhile (isSpaceChar(c)) c = read(); \n\t\tStringBuilder res = new StringBuilder();\n\t\tdo {\n\t\t\tres.appendCodePoint(c);\n\t\t\tc = read();\n\t\t}while (!isSpaceChar(c));\n\t\treturn res.toString();\n\t} \n\tpublic long l(){\n\t\tint c = read();\n\t\twhile (isSpaceChar(c)) c = read(); \n\t\tint sgn = 1;\n\t\tif (c == '-') { sgn = -1 ; c = read() ; }\n\t\tlong res = 0;\n\t\tdo{\n\t\t\tif (c < '0' || c > '9') throw new InputMismatchException();\n\t\t\tres *= 10 ; res += c - '0' ; c = read();\n\t\t}while(!isSpaceChar(c));\n\t\treturn res * sgn;\n\t} \n\tpublic int i(){\n\t\tint c = read() ;\n\t\twhile (isSpaceChar(c)) c = read(); \n\t\tint sgn = 1;\n\t\tif (c == '-') { sgn = -1 ; c = read() ; }\n\t\tint res = 0;\n\t\tdo{\n\t\t\tif (c < '0' || c > '9') throw new InputMismatchException();\n\t\tres *= 10 ; res += c - '0' ; c = read() ;\n\t\t}while(!isSpaceChar(c));\n\t\treturn res * sgn;\n\t} \n\tpublic int[] ia(int n){\n\t\tint a[] = new int[n] ;\n\t\tfor(int i=0 ; i<n ; i++) a[i] = i() ;\n\t\treturn a ;\n\t}\n\tpublic long[] la(int n){\n\t\tlong a[] = new long[n] ;\n\t\tfor(int i=0 ; i<n ; i++) a[i] = l() ;\n\t\treturn a ;\n\t}\n\tpublic boolean isSpaceChar(int c) { return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1; } \n\tpublic boolean isEndOfLine(int c) { return c == '\\n' || c == '\\r' || c == -1; } \n} ", "lang_cluster": "Java", "tags": ["graphs"], "code_uid": "0c2fb6fc6f4650793135acde9d16e4fa", "src_uid": "8781003d9eea51a509145bc6db8b609c", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\nimport java.lang.*;\nimport java.awt.*;\nimport java.awt.geom.*;\nimport java.util.stream.*;\n \n/**\n * @author Pradyumn\n */\n \npublic class Main implements Runnable{\n\tpublic int TC = 0;\n\tpublic static void main(String[] args) {\n\t\tnew Thread(null, new Main(), \":)\", 1L << 26).start();\n\t}\n\tstatic final int MODULO = (int)(1e9 + 7);\n\t@SuppressWarnings(\"Unchecked\")\n\tpublic void solve() throws IOException {\n\t int n = ni();\n\t HashSet<Integer> x = new HashSet<>();\n\t HashSet<Integer> y = new HashSet<>();\n\t HashMap<Integer, Integer> mapX = new HashMap<>();\n\t HashMap<Integer, Integer> mapY = new HashMap<>();\n\t int[][] pp = new int[2][n];\n\t for (int i = 0; i < n; ++i) {\n\t \tfor(int j = 0;j < 2; ++j) {\n\t \t\tpp[j][i] = ni();\n\t \t\tif(j == 0) x.add(pp[j][i]);\n\t \t\telse y.add(pp[j][i]);\n\t \t}\n\t }\n\n\t int mapIdx = 0;\n\t for(int xx : x) \n\t \tif(!mapX.containsKey(xx)) \n\t \t\tmapX.put(xx, mapIdx++);\n\n\t for(int yy : y) \n\t \tif(!mapY.containsKey(yy)) \n\t \t\tmapY.put(yy, mapIdx++);\n\n\t UnionFind uf = new UnionFind(mapIdx);\n\t for(int i = 0;i < n; ++i) {\n\t \tuf.unionSet(mapX.get(pp[0][i]), mapY.get(pp[1][i]));\n\t }\n\t uf.close();\n\t \n\t long res = 1;\n\t factorial();\n\t for (int i = 0; i < mapIdx; i++)\n if (uf.p[i] == i) {\n int numPoints = uf.numPoints[i], lines = uf.sizeOfSet(i);\n long ways = 0;\n for (int j = 0; j <= Math.min(numPoints, lines); j++) {\n ways += ncr(lines, j);\n if (ways >= MODULO) ways -= MODULO;\n }\n res *= ways;\n res %= MODULO;\n\n }\n\t out.println(res);\n\t}\n\t// O(1) nCr\n static int MAX = 5 * 100000 + 1;\n static int fact[] = new int[MAX];\n\n static int ncr(int n, int r) {\n return (int) ((long) fact[n] * ((inv(fact[r], MODULO) * inv(fact[n - r], MODULO)) % MODULO) % MODULO) % MODULO;\n }\n\n static long inv(long x, long mod) {\n long r, y;\n for (r = 1, y = mod - 2; y != 0; x = x * x % mod, y >>= 1)\n if ((y & 1) == 1)\n r = r * x % mod;\n return r;\n }\n\n static void factorial() {\n fact[0] = fact[1] = 1;\n for (int i = 2; i < MAX; i++)\n fact[i] = (int) ((long) i * fact[i - 1] % MODULO);\n }\n\n public static long modular_exponentiation(long a, long b, long c) // returns ( a ^ b ) % c\n {\n long ans = 1L;\n while (b != 0) {\n if ((b & (1)) == 1)\n ans = (ans * a) % c;\n\n a = (a * a) % c;\n b >>= 1L;\n }\n\n return ans;\n }\n\tstatic class UnionFind {\n private int[] p, rank, setSize, numPoints;\n private int numSets;\n\n public UnionFind(int size) {\n p = new int[size];\n rank = new int[size];\n setSize = new int[size];\n numPoints = new int[size];\n numSets = size;\n for (int i = 0; i < size; ++i) {\n p[i] = i;\n numPoints[i] = 0;\n setSize[i] = 1;\n }\n }\n\n int findSet(int i) {\n return (p[i] == i) ? i : (p[i] = findSet(p[i]));\n }\n\n boolean isSameSet(int i, int j) {\n return findSet(i) == findSet(j);\n }\n\n void unionSet(int i, int j) {\n if (!isSameSet(i, j)) {\n --numSets;\n int x = findSet(i), y = findSet(j);\n if (rank[x] > rank[y]) {\n p[y] = x;\n setSize[x] = setSize[x] + setSize[y];\n numPoints[x] = 1 + numPoints[x] + numPoints[y];\n } else {\n p[x] = y;\n setSize[y] = setSize[y] + setSize[x];\n numPoints[y] = numPoints[y] + numPoints[x] + 1;\n if (rank[x] == rank[y]) ++rank[y];\n }\n } else {\n numPoints[findSet(i)]++;\n }\n }\n\n int numDisjointSets() {\n return numSets;\n }\n\n void close() {\n for (int i = 0; i < p.length; i++)\n findSet(i);\n }\n\n int sizeOfSet(int i) {\n return setSize[findSet(i)];\n }\n }\n\tBufferedReader br;\n\tStringTokenizer st;\n\tPrintWriter out;\n\tpublic void run() {\n\t\ttry {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in),32768);\n\t\t\tst = null;\n\t\t\tout = new PrintWriter(System.out);\n\t\t\tif(TC == 1) {\n\t\t\t\tfor(int T = ni();T > 0; --T) {\n\t\t\t\t\tsolve();\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tsolve();\n\t\t\t}\n\t\t\tbr.close();\n\t\t\tout.close();\n\t\t} catch(IOException e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(1);\n\t\t}\n\t}\n\tpublic char[] nsc( ) throws IOException {\n\t\treturn ns().toCharArray();\n\t}\n\tpublic char[][] nm(int n, int m) throws IOException {\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n; ++i) {\n\t\t\tmap[i] = nsc();\n\t\t}\n\t\treturn map;\n\t}\n\tpublic String ns() throws IOException {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\tst = new StringTokenizer(br.readLine());\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\tpublic String nextLine() throws IOException {\n\t\treturn br.readLine();\n\t}\n\tpublic int ni() throws IOException {\n\t\treturn Integer.parseInt(ns());\n\t}\n \n\tpublic int[] na(int n) throws IOException {\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n; ++i) a[i] = ni();\n\t\treturn a;\n\t}\n \n\tpublic long nl() throws IOException {\n\t\treturn Long.parseLong(ns());\n\t}\n \n\tpublic long[] nal(int n) throws IOException {\n\t\tlong[] a = new long[n];\n\t\tfor(int i = 0;i < n; ++i) a[i] = nl();\n\t\treturn a;\n\t}\n \n\tpublic double nd() throws IOException {\n\t\treturn Double.parseDouble(ns());\n\t}\n\tprivate static boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate static void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); } \n}\n", "lang_cluster": "Java", "tags": ["graphs"], "code_uid": "efb1055d24bf0a0ea7fb6132e5cabb6d", "src_uid": "8781003d9eea51a509145bc6db8b609c", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// upsolve with rainboy\nimport java.io.*;\nimport java.util.*;\n\npublic class CF1187G extends PrintWriter {\n\tCF1187G() { super(System.out); }\n\tstatic class Scanner {\n\t\tScanner(InputStream in) { this.in = in; } InputStream in;\n\t\tint k, l; byte[] bb = new byte[1 << 15];\n\t\tbyte getc() {\n\t\t\tif (k >= l) {\n\t\t\t\tk = 0;\n\t\t\t\ttry { l = in.read(bb); } catch (IOException e) { l = 0; }\n\t\t\t\tif (l <= 0) return -1;\n\t\t\t}\n\t\t\treturn bb[k++];\n\t\t}\n\t\tint nextInt() {\n\t\t\tbyte c = 0; while (c <= 32) c = getc();\n\t\t\tint a = 0;\n\t\t\twhile (c > 32) { a = a * 10 + c - '0'; c = getc(); }\n\t\t\treturn a;\n\t\t}\n\t}\n\tScanner sc = new Scanner(System.in);\n\tpublic static void main(String[] $) {\n\t\tCF1187G o = new CF1187G(); o.main(); o.flush();\n\t}\n\n\tstatic final int INF = 0x3f3f3f3f;\n\tArrayList[] aa_;\n\tint n_, m_;\n\tint[] pi, kk, bb;\n\tint[] uu, vv, uv, cost, cost_;\n\tint[] cc;\n\tvoid init() {\n\t\taa_ = new ArrayList[n_];\n\t\tfor (int u = 0; u < n_; u++)\n\t\t\taa_[u] = new ArrayList<Integer>();\n\t\tpi = new int[n_];\n\t\tkk = new int[n_];\n\t\tbb = new int[n_];\n\t\tuu = new int[m_];\n\t\tvv = new int[m_];\n\t\tuv = new int[m_];\n\t\tcost = new int[m_];\n\t\tcost_ = new int[m_];\n\t\tcc = new int[m_ * 2];\n\t\tm_ = 0;\n\t}\n\tvoid link(int u, int v, int cap, int cos) {\n\t\tint h = m_++;\n\t\tuu[h] = u;\n\t\tvv[h] = v;\n\t\tuv[h] = u ^ v;\n\t\tcost[h] = cos;\n\t\tcc[h << 1 ^ 0] = cap;\n\t\taa_[u].add(h << 1 ^ 0);\n\t\taa_[v].add(h << 1 ^ 1);\n\t}\n\tboolean dijkstra(int s, int t) {\n\t\tArrays.fill(pi, INF);\n\t\tpi[s] = 0;\n\t\tTreeSet<Integer> pq = new TreeSet<>((u, v) -> pi[u] != pi[v] ? pi[u] - pi[v] : kk[u] != kk[v] ? kk[u] - kk[v] : u - v);\n\t\tpq.add(s);\n\t\tInteger first;\n\t\twhile ((first = pq.pollFirst()) != null) {\n\t\t\tint u = first;\n\t\t\tint k = kk[u] + 1;\n\t\t\tArrayList<Integer> adj = aa_[u];\n\t\t\tfor (int h_ : adj)\n\t\t\t\tif (cc[h_] > 0) {\n\t\t\t\t\tint h = h_ >> 1;\n\t\t\t\t\tint p = pi[u] + ((h_ & 1) == 0 ? cost_[h] : -cost_[h]);\n\t\t\t\t\tint v = u ^ uv[h];\n\t\t\t\t\tif (pi[v] > p || pi[v] == p && kk[v] > k) {\n\t\t\t\t\t\tif (pi[v] != INF)\n\t\t\t\t\t\t\tpq.remove(v);\n\t\t\t\t\t\tpi[v] = p;\n\t\t\t\t\t\tkk[v] = k;\n\t\t\t\t\t\tbb[v] = h_;\n\t\t\t\t\t\tpq.add(v);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t}\n\t\treturn pi[t] != INF;\n\t}\n\tvoid push(int s, int t) {\n\t\tint c = INF;\n\t\tfor (int u = t, h_, h; u != s; u ^= uv[h]) {\n\t\t\th = (h_ = bb[u]) >> 1;\n\t\t\tc = Math.min(c, cc[h_]);\n\t\t}\n\t\tfor (int u = t, h_, h; u != s; u ^= uv[h]) {\n\t\t\th = (h_ = bb[u]) >> 1;\n\t\t\tcc[h_] -= c; cc[h_ ^ 1] += c;\n\t\t}\n\t}\n\tvoid push1(int s, int t) {\n\t\tfor (int u = t, h_, h; u != s; u ^= uv[h]) {\n\t\t\th = (h_ = bb[u]) >> 1;\n\t\t\tcc[h_]--; cc[h_ ^ 1]++;\n\t\t}\n\t}\n\tint edmonds_karp(int s, int t) {\n\t\tSystem.arraycopy(cost, 0, cost_, 0, m_);\n\t\twhile (dijkstra(s, t)) {\n\t\t\tpush1(s, t);\n\t\t\tfor (int h = 0; h < m_; h++) {\n\t\t\t\tint u = uu[h], v = vv[h];\n\t\t\t\tif (pi[u] != INF && pi[v] != INF)\n\t\t\t\t\tcost_[h] += pi[u] - pi[v];\n\t\t\t}\n\t\t}\n\t\tint c = 0;\n\t\tfor (int h = 0; h < m_; h++)\n\t\t\tc += cost[h] * cc[h << 1 ^ 1];\n\t\treturn c;\n\t}\n\tvoid main() {\n\t\tint n = sc.nextInt();\n\t\tint m = sc.nextInt();\n\t\tint k = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\tint d = sc.nextInt();\n\t\tint[] ii = new int[k];\n\t\tfor (int h = 0; h < k; h++)\n\t\t\tii[h] = sc.nextInt() - 1;\n\t\tArrayList[] aa = new ArrayList[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\taa[i] = new ArrayList<Integer>();\n\t\tfor (int h = 0; h < m; h++) {\n\t\t\tint i = sc.nextInt() - 1;\n\t\t\tint j = sc.nextInt() - 1;\n\t\t\taa[i].add(j);\n\t\t\taa[j].add(i);\n\t\t}\n\t\tint t = n + k + 1;\n\t\tn_ = n * t + 1;\n\t\tm_ = k + (m * 2 * k + n) * (t - 1);\n\t\tinit();\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tArrayList<Integer> adj = aa[i];\n\t\t\tfor (int s = 0; s < t - 1; s++) {\n\t\t\t\tint u = i * t + s;\n\t\t\t\tfor (int j : adj) {\n\t\t\t\t\tint v = j * t + s + 1;\n\t\t\t\t\tfor (int x = 1; x <= k; x++)\n\t\t\t\t\t\tlink(u, v, 1, c + (x * 2 - 1) * d);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tfor (int s = 0; s < t - 1; s++) {\n\t\t\t\tint u = i * t + s, v = u + 1;\n\t\t\t\tlink(u, v, k, i == 0 ? 0 : c);\n\t\t\t}\n\t\tfor (int h = 0; h < k; h++)\n\t\t\tlink(n_ - 1, ii[h] * t + 0, 1, 0);\n\t\tprintln(edmonds_karp(n_ - 1, 0 * t + t - 1));\n\t}\n}\n", "lang_cluster": "Java", "tags": ["flows", "graphs"], "code_uid": "041341f1b69872ccb3682cb83b677739", "src_uid": "2d0aa75f2e63c4fb8c98742ac8cd821c", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\npublic class G{\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskE solver = new TaskE();\n solver.solve(1, in, out);\n out.flush();out.close();\n }\n static class TaskE {\n class MinCostMaxFlow{\n ArrayList<Edge> al[];\n Edge ja[][]; \n int d[]; // shortest distances\n int N , S , T , maxFlow ; int minCost;\n final int gmax = Integer.MAX_VALUE / 100;\n \n int edges = 0;\n\n class Edge{\n int u , flow, rid, cost;\n Edge(int a, int b, int c, int d){u = a; flow = b; cost = c; rid = d;}\n }\n \n void addEdge(int u , int v , int flow , int cost){\n int lu = al[u].size(), lv = al[v].size();\n al[u].add(new Edge(v, flow, cost, lv)); \n al[v].add(new Edge(u, 0, -cost, lu)); \n }\n \n void convertToArray(){\n ja = new Edge[N][];\n for(int i = 0; i < N; i++){\n int sz = al[i].size();\n ja[i] = new Edge[sz];\n for(int j = 0; j < sz; j++){\n ja[i][j] = al[i].get(j);\n }\n al[i].clear();\n }\n }\n \n MinCostMaxFlow(int n , int source , int sink){\n N = n; S = source; T = sink; maxFlow = 0; minCost = 0;\n al = new ArrayList[N];\n d = new int[N];\n for(int i = 0; i < N; i++){\n al[i] = new ArrayList<>();\n }\n }\n \n boolean BellmanFord(boolean check){\n d[0] = 0;\n for(int i = 0; i < N - 1; i++){\n for(int j = 0; j < N; j++){\n for(Edge e : ja[j]){\n if(e.flow == 0)continue; // not to consider reverse edges\n d[e.u] = Math.min(d[e.u] , d[j] + e.cost);\n }\n }\n }\n if(check){// check for negative cycles\n for(int j = 0; j < N; j++){\n for(Edge e : ja[j]){\n if(e.flow == 0)continue;\n if(d[j] + e.cost < d[e.u]) return false;\n }\n } \n }return true;\n }\n\n int node[]; // present node \n\n int visit[]; // 0 -> not added 1 -> not removed 2 -> removed\n int prv[], prve[]; // previous node for augmentation\n int dist[]; // min dist\n\n boolean simple(){\n node = new int[N]; \n visit = new int[N]; \n prv = new int[N];\n prve = new int[N];\n dist = new int[N]; Arrays.fill(dist , gmax);\n\n node[0] = S; dist[0] = 0;\n int front = 1, back = 0;\n while(front != back){\n int u = node[back++]; int distu = dist[u];\n if(back == N)back = 0;\n visit[u] = 2;\n for(int i = 0; i < ja[u].length; i++){\n Edge e = ja[u][i];\n if(e.flow == 0)continue;\n int cdist = distu + e.cost; // no need of reduced cost\n if(cdist < dist[e.u]){\n if(visit[e.u] == 0){\n node[front] = e.u; \n if(++front == N)front = 0;\n }else if(visit[e.u] == 2){\n if(--back == -1)back += N;\n node[back] = e.u;\n }\n visit[e.u] = 1;\n prve[e.u] = i; prv[e.u] = u; dist[e.u] = cdist;\n }\n }\n }\n return visit[T] != 0;\n }\n\n class pair{\n int F; int S;\n pair(int a, int b){F = a; S = b;}\n }\n\n boolean dijkstra(){\n visit = new int[N];\n prv = new int[N];\n prve = new int[N];\n dist = new int[N]; Arrays.fill(dist, gmax);\n PriorityQueue<pair> pq = new PriorityQueue<>((A, B) -> Double.compare(A.S , B.S));\n\n pq.add(new pair(S , 0)); dist[0] = 0;\n o : while(!pq.isEmpty()){\n pair p = pq.poll();\n while(dist[p.F] < p.S){\n if(pq.isEmpty()) break o; // had a better val \n p = pq.poll();\n }\n visit[p.F] = 2;\n for(int i = 0; i < ja[p.F].length; i++){\n Edge e = ja[p.F][i];\n if(e.flow == 0)continue; // important\n int cdist = p.S + (e.cost + d[p.F] - d[e.u]); // reduced cost\n if(cdist < dist[e.u]){ \n if(visit[e.u] == 2) return false;\n pq.add(new pair(e.u , cdist));\n dist[e.u] = cdist; prv[e.u] = p.F; prve[e.u] = i;\n visit[e.u] = 1;\n }\n }\n }\n return visit[T] != 0;\n }\n \n int augment(){\n int p = T; int min = gmax;\n while(p != 0){\n int pp = prv[p], pe = prve[p];\n int val = ja[pp][pe].flow;\n min = Math.min(min , val);\n p = pp;\n }\n p = T;\n while(p != 0){\n int pp = prv[p], pe = prve[p];\n ja[pp][pe].flow -= min;\n ja[p][ja[pp][pe].rid].flow += min;\n p = pp;\n }\n maxFlow += min;\n return min;\n }\n\n // if(dist[T] >= 0)return true; // non contributing flow\n boolean calSimple(){\n // uncomment to check for negative cycles\n /* boolean possible = BellmanFord(true); \n if(!possible) return false; */\n while(simple()){\n /*if(dist[T] >= 0)return true;*/ \n minCost += dist[T] * augment();\n }\n return true;\n }\n\n void updPotential(){\n for(int i = 0; i < N; i++){\n if(visit[i] != 0){\n d[i] += dist[i] - dist[S];\n }\n }\n }\n boolean calWithPotential(){\n // set true to check for negative cycles\n // boolean possible = BellmanFord(false); \n // if(!possible) return false;\n while(dijkstra()){\n int min = dist[T] + d[T] - d[S]; // getting back the original cost\n /*if(dist[T] >= 0)return true;*/\n minCost += min * augment();\n updPotential();\n }\n return true; \n }\n }\n int n , m, k, c, d, a[], f[];\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n n = in.nextInt(); m = in.nextInt(); k = in.nextInt(); c = in.nextInt(); d= in.nextInt();\n // S + n\n int maxl = n + k, T = n * maxl + 1;\n MinCostMaxFlow ans = new MinCostMaxFlow(T + 1, 0, T);\n a = new int[k + 1]; f = new int[n + 1];\n for(int i = 1; i <= k; i++){\n a[i] = in.nextInt();\n f[a[i]]++;\n }\n for(int i = 1; i <= n; i++){\n if(f[i] == 0)continue;\n ans.addEdge(0 , i , f[i], 0);\n }\n for(int i = 2; i <= n; i++){\n for(int l = 0; l < maxl - 1; l++){\n ans.addEdge(l * n + i , (l + 1) * n + i, k, c);\n }\n }\n for(int i = 1; i <= m; i++){\n int a = in.nextInt(), b = in.nextInt();\n for(int l = 0; l < maxl - 1; l++){\n for(int p = 1; p <= k; p++){\n if(a != 1)\n ans.addEdge(n * l + a, n * (l + 1) + b, 1, d * (2 * p - 1) + c);\n if(b != 1)\n ans.addEdge(n * l + b, n * (l + 1) + a, 1, d * (2 * p - 1) + c);\n }\n } \n }\n for(int l = 1; l < maxl; l++){\n ans.addEdge(l * n + 1, T, k, 0);\n }\n ans.convertToArray();\n ans.calWithPotential();\n // ans.calSimple();\n if(ans.maxFlow != k){\n out.println(\"BUG\");\n }else{\n out.println((int)ans.minCost);\n }\n }\n }\n static class InputReader {\n BufferedReader br;\n StringTokenizer st;\n public InputReader(InputStream stream) {\n br = new BufferedReader(new InputStreamReader(stream));\n st = null;\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return null;\n st = new StringTokenizer(s);\n }\n return st.nextToken();\n }\n\n boolean hasMoreTokens() {\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return false;\n st = new StringTokenizer(s);\n }\n return true;\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n public long nextLong() {\n return Long.parseLong(next());\n }\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n }\n}", "lang_cluster": "Java", "tags": ["flows", "graphs"], "code_uid": "e0bcd3830ae8976f9e60cf5e27920ba9", "src_uid": "2d0aa75f2e63c4fb8c98742ac8cd821c", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// upsolve with rainboy\nimport java.io.*;\nimport java.util.*;\n\npublic class CF1187G extends PrintWriter {\n\tCF1187G() { super(System.out); }\n\tstatic class Scanner {\n\t\tScanner(InputStream in) { this.in = in; } InputStream in;\n\t\tint k, l; byte[] bb = new byte[1 << 15];\n\t\tbyte getc() {\n\t\t\tif (k >= l) {\n\t\t\t\tk = 0;\n\t\t\t\ttry { l = in.read(bb); } catch (IOException e) { l = 0; }\n\t\t\t\tif (l <= 0) return -1;\n\t\t\t}\n\t\t\treturn bb[k++];\n\t\t}\n\t\tint nextInt() {\n\t\t\tbyte c = 0; while (c <= 32) c = getc();\n\t\t\tint a = 0;\n\t\t\twhile (c > 32) { a = a * 10 + c - '0'; c = getc(); }\n\t\t\treturn a;\n\t\t}\n\t}\n\tScanner sc = new Scanner(System.in);\n\tpublic static void main(String[] $) {\n\t\tCF1187G o = new CF1187G(); o.main(); o.flush();\n\t}\n\n\tstatic final int INF = 0x3f3f3f3f;\n\tArrayList[] aa_;\n\tint n_, m_;\n\tint[] pi, dd, bb;\n\tint[] uu, vv, uv, cost, cost_;\n\tint[] cc;\n\tvoid init() {\n\t\taa_ = new ArrayList[n_];\n\t\tfor (int u = 0; u < n_; u++)\n\t\t\taa_[u] = new ArrayList<Integer>();\n\t\tpi = new int[n_];\n\t\tdd = new int[n_];\n\t\tbb = new int[n_];\n\t\tuu = new int[m_];\n\t\tvv = new int[m_];\n\t\tuv = new int[m_];\n\t\tcost = new int[m_];\n\t\tcost_ = new int[m_];\n\t\tcc = new int[m_ * 2];\n\t\tm_ = 0;\n\t}\n\tvoid link(int u, int v, int cap, int cos) {\n\t\tint h = m_++;\n\t\tuu[h] = u;\n\t\tvv[h] = v;\n\t\tuv[h] = u ^ v;\n\t\tcost[h] = cos;\n\t\tcc[h << 1 ^ 0] = cap;\n\t\taa_[u].add(h << 1 ^ 0);\n\t\taa_[v].add(h << 1 ^ 1);\n\t}\n\tboolean dijkstra(int s, int t) {\n\t\tArrays.fill(pi, INF);\n\t\tpi[s] = 0;\n\t\tTreeSet<Integer> pq = new TreeSet<>((u, v) -> pi[u] != pi[v] ? pi[u] - pi[v] : dd[u] != dd[v] ? dd[u] - dd[v] : u - v);\n\t\tpq.add(s);\n\t\tInteger first;\n\t\twhile ((first = pq.pollFirst()) != null) {\n\t\t\tint u = first;\n\t\t\tint d = dd[u] + 1;\n\t\t\tArrayList<Integer> adj = aa_[u];\n\t\t\tfor (int h_ : adj)\n\t\t\t\tif (cc[h_] > 0) {\n\t\t\t\t\tint h = h_ >> 1;\n\t\t\t\t\tint p = pi[u] + ((h_ & 1) == 0 ? cost_[h] : -cost_[h]);\n\t\t\t\t\tint v = u ^ uv[h];\n\t\t\t\t\tif (pi[v] > p || pi[v] == p && dd[v] > d) {\n\t\t\t\t\t\tif (pi[v] != INF)\n\t\t\t\t\t\t\tpq.remove(v);\n\t\t\t\t\t\tpi[v] = p;\n\t\t\t\t\t\tdd[v] = d;\n\t\t\t\t\t\tbb[v] = h_;\n\t\t\t\t\t\tpq.add(v);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t}\n\t\treturn pi[t] != INF;\n\t}\n\tvoid push(int s, int t) {\n\t\tint c = INF;\n\t\tfor (int u = t, h_, h; u != s; u ^= uv[h]) {\n\t\t\th = (h_ = bb[u]) >> 1;\n\t\t\tc = Math.min(c, cc[h_]);\n\t\t}\n\t\tfor (int u = t, h_, h; u != s; u ^= uv[h]) {\n\t\t\th = (h_ = bb[u]) >> 1;\n\t\t\tcc[h_] -= c; cc[h_ ^ 1] += c;\n\t\t}\n\t}\n\tvoid push1(int s, int t) {\n\t\tfor (int u = t, h_, h; u != s; u ^= uv[h]) {\n\t\t\th = (h_ = bb[u]) >> 1;\n\t\t\tcc[h_]--; cc[h_ ^ 1]++;\n\t\t}\n\t}\n\tint edmonds_karp(int s, int t) {\n\t\tcost_ = Arrays.copyOf(cost, m_);\n\t\twhile (dijkstra(s, t)) {\n\t\t\tpush1(s, t);\n\t\t\tfor (int h = 0; h < m_; h++) {\n\t\t\t\tint u = uu[h], v = vv[h];\n\t\t\t\tif (pi[u] != INF && pi[v] != INF)\n\t\t\t\t\tcost_[h] += pi[u] - pi[v];\n\t\t\t}\n\t\t}\n\t\tint c = 0;\n\t\tfor (int h = 0; h < m_; h++)\n\t\t\tc += cost[h] * cc[h << 1 ^ 1];\n\t\treturn c;\n\t}\n\tvoid main() {\n\t\tint n = sc.nextInt();\n\t\tint m = sc.nextInt();\n\t\tint k = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\tint d = sc.nextInt();\n\t\tint[] ii = new int[k];\n\t\tfor (int h = 0; h < k; h++)\n\t\t\tii[h] = sc.nextInt() - 1;\n\t\tArrayList[] aa = new ArrayList[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\taa[i] = new ArrayList<Integer>();\n\t\tfor (int h = 0; h < m; h++) {\n\t\t\tint i = sc.nextInt() - 1;\n\t\t\tint j = sc.nextInt() - 1;\n\t\t\taa[i].add(j);\n\t\t\taa[j].add(i);\n\t\t}\n\t\tint t = n + k + 1;\n\t\tn_ = n * t + 1;\n\t\tm_ = k + (m * 2 * k + n) * (t - 1);\n\t\tinit();\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tArrayList<Integer> adj = aa[i];\n\t\t\tfor (int s = 0; s < t - 1; s++) {\n\t\t\t\tint u = i * t + s;\n\t\t\t\tfor (int j : adj) {\n\t\t\t\t\tint v = j * t + s + 1;\n\t\t\t\t\tfor (int x = 1; x <= k; x++)\n\t\t\t\t\t\tlink(u, v, 1, c + (x * 2 - 1) * d);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tfor (int s = 0; s < t - 1; s++) {\n\t\t\t\tint u = i * t + s, v = u + 1;\n\t\t\t\tlink(u, v, k, i == 0 ? 0 : c);\n\t\t\t}\n\t\tfor (int h = 0; h < k; h++)\n\t\t\tlink(n_ - 1, ii[h] * t + 0, 1, 0);\n\t\tprintln(edmonds_karp(n_ - 1, 0 * t + t - 1));\n\t}\n}\n", "lang_cluster": "Java", "tags": ["flows", "graphs"], "code_uid": "e1ca16023eb7ef70ef730ffa9fce555e", "src_uid": "2d0aa75f2e63c4fb8c98742ac8cd821c", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// upsolve with rainboy\nimport java.io.*;\nimport java.util.*;\n\npublic class CF1187G extends PrintWriter {\n\tCF1187G() { super(System.out); }\n\tstatic class Scanner {\n\t\tScanner(InputStream in) { this.in = in; } InputStream in;\n\t\tint k, l; byte[] bb = new byte[1 << 15];\n\t\tbyte getc() {\n\t\t\tif (k >= l) {\n\t\t\t\tk = 0;\n\t\t\t\ttry { l = in.read(bb); } catch (IOException e) { l = 0; }\n\t\t\t\tif (l <= 0) return -1;\n\t\t\t}\n\t\t\treturn bb[k++];\n\t\t}\n\t\tint nextInt() {\n\t\t\tbyte c = 0; while (c <= 32) c = getc();\n\t\t\tint a = 0;\n\t\t\twhile (c > 32) { a = a * 10 + c - '0'; c = getc(); }\n\t\t\treturn a;\n\t\t}\n\t}\n\tScanner sc = new Scanner(System.in);\n\tpublic static void main(String[] $) {\n\t\tCF1187G o = new CF1187G(); o.main(); o.flush();\n\t}\n\n\tstatic final int INF = 0x3f3f3f3f;\n\tArrayList[] aa_;\n\tint n_, m_;\n\tint[] pi, dd, bb;\n\tint[] uu, vv, uv, cost;\n\tint[] cc;\n\tvoid init() {\n\t\taa_ = new ArrayList[n_];\n\t\tfor (int u = 0; u < n_; u++)\n\t\t\taa_[u] = new ArrayList<Integer>();\n\t\tpi = new int[n_];\n\t\tdd = new int[n_];\n\t\tbb = new int[n_];\n\t\tqq = new int[nq];\n\t\tiq = new boolean[n_];\n\t\tuu = new int[m_];\n\t\tvv = new int[m_];\n\t\tuv = new int[m_];\n\t\tcost = new int[m_];\n\t\tcc = new int[m_ * 2];\n\t\tm_ = 0;\n\t}\n\tvoid link(int u, int v, int cap, int cos) {\n\t\tint h = m_++;\n\t\tuu[h] = u;\n\t\tvv[h] = v;\n\t\tuv[h] = u ^ v;\n\t\tcost[h] = cos;\n\t\tcc[h << 1 ^ 0] = cap;\n\t\taa_[u].add(h << 1 ^ 0);\n\t\taa_[v].add(h << 1 ^ 1);\n\t}\n\tint[] qq;\n\tint nq = 1 << 20, head, cnt;\n\tboolean[] iq;\n\tvoid enqueue(int v) {\n\t\tif (iq[v])\n\t\t\treturn;\n\t\tif (head + cnt == nq) {\n\t\t\tif (cnt * 2 <= nq)\n\t\t\t\tSystem.arraycopy(qq, head, qq, 0, cnt);\n\t\t\telse {\n\t\t\t\tint[] qq_ = new int[nq *= 2];\n\t\t\t\tSystem.arraycopy(qq, head, qq_, 0, cnt);\n\t\t\t\tqq = qq_;\n\t\t\t}\n\t\t\thead = 0;\n\t\t}\n\t\tqq[head + cnt++] = v; iq[v] = true;\n\t}\n\tint dequeue() {\n\t\tint u = qq[head++]; cnt--; iq[u] = false;\n\t\treturn u;\n\t}\n\tboolean spfa(int s, int t) {\n\t\tArrays.fill(pi, INF);\n\t\tpi[s] = 0;\n\t\thead = cnt = 0;\n\t\tenqueue(s);\n\t\twhile (cnt > 0) {\n\t\t\tint u = dequeue();\n\t\t\tint d = dd[u] + 1;\n\t\t\tArrayList<Integer> adj = aa_[u];\n\t\t\tfor (int h_ : adj)\n\t\t\t\tif (cc[h_] > 0) {\n\t\t\t\t\tint h = h_ >> 1;\n\t\t\t\t\tint p = pi[u] + ((h_ & 1) == 0 ? cost[h] : -cost[h]);\n\t\t\t\t\tint v = u ^ uv[h];\n\t\t\t\t\tif (pi[v] > p || pi[v] == p && dd[v] > d) {\n\t\t\t\t\t\tpi[v] = p;\n\t\t\t\t\t\tdd[v] = d;\n\t\t\t\t\t\tbb[v] = h_;\n\t\t\t\t\t\tenqueue(v);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t}\n\t\treturn pi[t] != INF;\n\t}\n\tvoid push(int s, int t) {\n\t\tint c = INF;\n\t\tfor (int u = t, h_, h; u != s; u ^= uv[h]) {\n\t\t\th = (h_ = bb[u]) >> 1;\n\t\t\tc = Math.min(c, cc[h_]);\n\t\t}\n\t\tfor (int u = t, h_, h; u != s; u ^= uv[h]) {\n\t\t\th = (h_ = bb[u]) >> 1;\n\t\t\tcc[h_] -= c; cc[h_ ^ 1] += c;\n\t\t}\n\t}\n\tvoid push1(int s, int t) {\n\t\tfor (int u = t, h_, h; u != s; u ^= uv[h]) {\n\t\t\th = (h_ = bb[u]) >> 1;\n\t\t\tcc[h_]--; cc[h_ ^ 1]++;\n\t\t}\n\t}\n\tint edmonds_karp(int s, int t) {\n\t\twhile (spfa(s, t))\n\t\t\tpush1(s, t);\n\t\tint c = 0;\n\t\tfor (int h = 0; h < m_; h++)\n\t\t\tc += cost[h] * cc[h << 1 ^ 1];\n\t\treturn c;\n\t}\n\tvoid main() {\n\t\tint n = sc.nextInt();\n\t\tint m = sc.nextInt();\n\t\tint k = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\tint d = sc.nextInt();\n\t\tint[] ii = new int[k];\n\t\tfor (int h = 0; h < k; h++)\n\t\t\tii[h] = sc.nextInt() - 1;\n\t\tArrayList[] aa = new ArrayList[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\taa[i] = new ArrayList<Integer>();\n\t\tfor (int h = 0; h < m; h++) {\n\t\t\tint i = sc.nextInt() - 1;\n\t\t\tint j = sc.nextInt() - 1;\n\t\t\taa[i].add(j);\n\t\t\taa[j].add(i);\n\t\t}\n\t\tint t = n + k + 1;\n\t\tn_ = n * t + 1;\n\t\tm_ = k + (m * 2 * k + n) * (t - 1);\n\t\tinit();\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tArrayList<Integer> adj = aa[i];\n\t\t\tfor (int s = 0; s < t - 1; s++) {\n\t\t\t\tint u = i * t + s;\n\t\t\t\tfor (int j : adj) {\n\t\t\t\t\tint v = j * t + s + 1;\n\t\t\t\t\tfor (int x = 1; x <= k; x++)\n\t\t\t\t\t\tlink(u, v, 1, c + (x * 2 - 1) * d);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tfor (int s = 0; s < t - 1; s++) {\n\t\t\t\tint u = i * t + s, v = u + 1;\n\t\t\t\tlink(u, v, k, i == 0 ? 0 : c);\n\t\t\t}\n\t\tfor (int h = 0; h < k; h++)\n\t\t\tlink(n_ - 1, ii[h] * t + 0, 1, 0);\n\t\tprintln(edmonds_karp(n_ - 1, 0 * t + t - 1));\n\t}\n}\n", "lang_cluster": "Java", "tags": ["flows", "graphs"], "code_uid": "ad10bf6a37a37cf12dc4ddf7508c3c5c", "src_uid": "2d0aa75f2e63c4fb8c98742ac8cd821c", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class GG {\n public static void main(String[] args) {\n FastScanner scanner = new FastScanner();\n PrintWriter out = new PrintWriter(System.out);\n int N = scanner.nextInt();\n int M = scanner.nextInt();\n int K = scanner.nextInt();\n int C = scanner.nextInt();\n int D = scanner.nextInt();\n MinCostMaxFlowSolver solver = new EdmondsKarp();\n int[] people = new int[K];\n for(int i = 0; i < K; i++) people[i] = scanner.nextInt()-1;\n Node src = solver.addNode();\n Node snk = solver.addNode();\n int amt = 350;\n Node[][] timeNodes = new Node[N][amt];\n for(int i = 0; i < N; i++) {\n for(int j = 1; j < amt; j++) {\n timeNodes[i][j] = solver.addNode();\n if (j > 1) solver.link(timeNodes[i][j-1], timeNodes[i][j], Integer.MAX_VALUE, 0);\n }\n }\n for(int i = 0; i < K; i++) {\n solver.link(src, timeNodes[people[i]][1], 1, 0);\n }\n for(int i = 1; i < amt; i++) {\n for(int j = 0; j < K; j++) {\n solver.link(timeNodes[0][i], snk, 1, C*i-C);\n }\n }\n for(int i =0; i < M; i++) {\n int a = scanner.nextInt()-1;\n int b = scanner.nextInt()-1;\n for(int j = 1; j < amt-1; j++) {\n int prev = 0;\n for(int k = 1; k <= K; k++) {\n solver.link(timeNodes[a][j], timeNodes[b][j + 1], 1, D*k*k- prev);\n solver.link(timeNodes[b][j], timeNodes[a][j + 1], 1, D*k*k - prev);\n prev = D * k * k;\n }\n }\n }\n long[] ret = solver.getMinCostMaxFlow(src, snk);\n out.println(ret[1]);\n out.flush();\n }\n \n public static class Node {\n // thou shall not create nodes except through addNode()\n private Node() { }\n \n List<Edge> edges = new ArrayList<Edge>();\n int index; // index in nodes array\n \n }\n \n public static class Edge\n {\n boolean forward; // true: edge is in original graph\n Node from, to; // nodes connected\n long flow; // current flow\n final long capacity;\n Edge dual; // reference to this edge's dual\n long cost; // only used for MinCost.\n protected Edge(Node s, Node d, long c, boolean f)\n {\n forward = f;\n from = s;\n to = d;\n capacity = c;\n }\n long remaining() { return capacity - flow; }\n void addFlow(long amount) {\n flow += amount;\n dual.flow -= amount;\n }\n }\n \n public static abstract class MaxFlowSolver {\n List<Node> nodes = new ArrayList<Node>();\n \n public void link(Node n1, Node n2, long capacity) {\n link(n1, n2, capacity, 1);\n }\n \n public void link(Node n1, Node n2, long capacity, long cost) {\n Edge e12 = new Edge(n1, n2, capacity, true);\n Edge e21 = new Edge(n2, n1, 0, false);\n e12.dual = e21;\n e21.dual = e12;\n n1.edges.add(e12);\n n2.edges.add(e21);\n e12.cost = cost;\n e21.cost = -cost;\n }\n void link(int n1, int n2, long capacity) {\n link(nodes.get(n1), nodes.get(n2), capacity);\n }\n protected MaxFlowSolver(int n) {\n for (int i = 0; i < n; i++)\n addNode();\n }\n protected MaxFlowSolver() {\n this(0);\n }\n \n public abstract long getMaxFlow(Node src, Node snk);\n public Node addNode() {\n Node n = new Node();\n n.index = nodes.size();\n nodes.add(n);\n return n;\n }\n }\n static abstract class MinCostMaxFlowSolver extends MaxFlowSolver {\n // returns [maxflow, mincost]\n abstract long [] getMinCostMaxFlow(Node src, Node snk);\n // unavoidable boiler plate\n MinCostMaxFlowSolver () { this(0); }\n MinCostMaxFlowSolver (int n) { super(n); }\n }\n \n static class EdmondsKarp extends MinCostMaxFlowSolver\n {\n EdmondsKarp () { this(0); }\n EdmondsKarp (int n) { super(n); }\n long minCost;\n \n @Override\n public long [] getMinCostMaxFlow(Node src, Node snk) {\n long maxflow = getMaxFlow(src, snk);\n return new long [] { maxflow, minCost };\n }\n static final long INF = Long.MAX_VALUE/4;\n \n @Override\n public long getMaxFlow(Node src, Node snk) {\n final int n = nodes.size();\n final int source = src.index;\n final int sink = snk.index;\n long flow = 0;\n long cost = 0;\n long[] potential = new long[n]; // allows Dijkstra to work with negative edge weights\n while (true) {\n Edge[] parent = new Edge[n]; // used to store an augmenting path\n long[] dist = new long[n]; // minimal cost to vertex\n Arrays.fill(dist, INF);\n dist[source] = 0;\n PriorityQueue<Item> que = new PriorityQueue<Item>();\n que.add(new Item(0, source));\n while (!que.isEmpty()) {\n Item item = que.poll();\n if (item.dist != dist[item.v])\n continue;\n \n for (Edge e : nodes.get(item.v).edges) {\n long temp = dist[item.v] + e.cost + potential[item.v] - potential[e.to.index];\n if (e.capacity > e.flow && dist[e.to.index] > temp) {\n dist[e.to.index] = temp;\n parent[e.to.index] = e;\n que.add(new Item(temp, e.to.index));\n }\n }\n }\n if (parent[sink] == null)\n break;\n for (int i = 0; i < n; i++)\n if (parent[i] != null)\n potential[i] += dist[i];\n long augFlow = Long.MAX_VALUE;\n for (int i = sink; i != source; i = parent[i].from.index)\n augFlow = Math.min(augFlow, parent[i].capacity - parent[i].flow);\n for (int i = sink; i != source; i = parent[i].from.index) {\n Edge e = parent[i];\n e.addFlow(augFlow);\n cost += augFlow * e.cost;\n }\n flow += augFlow;\n }\n \n minCost = cost;\n return flow;\n }\n \n static class Item implements Comparable<Item> {\n long dist;\n int v;\n \n public Item(long dist, int v) {\n this.dist = dist;\n this.v = v;\n }\n \n public int compareTo(Item that) {\n return Long.compare(this.dist, that.dist);\n }\n }\n }\n \n public static class FastScanner {\n BufferedReader br;\n StringTokenizer st;\n \n public FastScanner(Reader in) {\n br = new BufferedReader(in);\n }\n \n public FastScanner() {\n this(new InputStreamReader(System.in));\n }\n \n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n \n int nextInt() {\n return Integer.parseInt(next());\n }\n \n long nextLong() {\n return Long.parseLong(next());\n }\n \n double nextDouble() {\n return Double.parseDouble(next());\n }\n \n String readNextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n \n int[] readIntArray(int n) {\n int[] a = new int[n];\n for (int idx = 0; idx < n; idx++) {\n a[idx] = nextInt();\n }\n return a;\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["flows", "graphs"], "code_uid": "5d07dc81aa63c7abf04f32fb34a85bd9", "src_uid": "2d0aa75f2e63c4fb8c98742ac8cd821c", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package com.company;\n\nimport java.io.*;\nimport java.util.*;\n\npublic class Main {\n public static class Task {\n\n public class Maxflow {\n class Edge {\n int t, rev;\n long cap, f;\n public Edge(int t, int rev, long cap) {\n this.t = t;\n this.rev = rev;\n this.cap = cap;\n }\n }\n public Maxflow(int n) {\n graph = new List[n];\n for (int i = 0; i < n; i++) {\n graph[i] = new ArrayList<>();\n }\n }\n List<Edge>[] graph;\n void addEdge(int s, int t, long cap) {\n graph[s].add(new Edge(t, graph[t].size(), cap));\n graph[t].add(new Edge(s, graph[s].size() - 1, 0));\n// System.err.println(s + \" \" + t + \" \" + cap);\n }\n\n boolean dinicBFS(int src, int dest, int[] dist) {\n Arrays.fill(dist, -1);\n dist[src] = 0;\n int[] Q = new int[graph.length];\n int sizeQ = 0;\n Q[sizeQ++] = src;\n for (int i = 0; i < sizeQ; i++) {\n int u = Q[i];\n for (Edge e: graph[u]) {\n if (dist[e.t] < 0 && e.f < e.cap) {\n dist[e.t] = dist[u] + 1;\n Q[sizeQ++] = e.t;\n }\n }\n }\n return dist[dest] >= 0;\n }\n\n long dinicDFS(int[] ptr, int[] dist, int dest, int u, long f) {\n if (u == dest) return f;\n for (;ptr[u] < graph[u].size(); ++ptr[u]) {\n Edge e = graph[u].get(ptr[u]);\n if (dist[e.t] == dist[u] + 1 && e.f < e.cap) {\n long df = dinicDFS(ptr, dist, dest, e.t, Math.min(f, e.cap - e.f));\n if (df > 0) {\n e.f += df;\n graph[e.t].get(e.rev).f -= df;\n return df;\n }\n }\n }\n return 0;\n }\n\n long maxFLow(int src, int dest) {\n long flow = 0;\n int[] dist = new int[graph.length];\n while (dinicBFS(src, dest, dist)) {\n int[] ptr = new int[graph.length];\n while (true) {\n long df = dinicDFS(ptr, dist, dest, src, Long.MAX_VALUE);\n if (df == 0) break;\n flow += df;\n }\n }\n return flow;\n }\n }\n\n public class MinCostFlowBF {\n List<Edge>[] graph;\n class Edge {\n int to, f, cap, cost, rev;\n\n Edge(int v, int cap, int cost, int rev) {\n this.to = v;\n this.cap = cap;\n this.cost = cost;\n this.rev = rev;\n }\n }\n\n public MinCostFlowBF(int n) {\n graph = new List[n];\n for (int i = 0; i < n; i++)\n graph[i] = new ArrayList<Edge>();\n }\n\n public void addEdge(int s, int t, int cap, int cost) {\n graph[s].add(new Edge(t, cap, cost, graph[t].size()));\n graph[t].add(new Edge(s, 0, -cost, graph[s].size() - 1));\n }\n\n void bellmanFord(int s, int[] dist, int[] prevnode, int[] prevedge, int[] curflow) {\n int n = graph.length;\n Arrays.fill(dist, 0, n, Integer.MAX_VALUE);\n dist[s] = 0;\n curflow[s] = Integer.MAX_VALUE;\n boolean[] inqueue = new boolean[n];\n int[] q = new int[n];\n int qt = 0;\n q[qt++] = s;\n for (int qh = 0; (qh - qt) % n != 0; qh++) {\n int u = q[qh % n];\n inqueue[u] = false;\n for (int i = 0; i < graph[u].size(); i++) {\n Edge e = graph[u].get(i);\n if (e.f >= e.cap)\n continue;\n int v = e.to;\n int ndist = dist[u] + e.cost;\n if (dist[v] > ndist) {\n dist[v] = ndist;\n prevnode[v] = u;\n prevedge[v] = i;\n curflow[v] = Math.min(curflow[u], e.cap - e.f);\n if (!inqueue[v]) {\n inqueue[v] = true;\n q[qt++ % n] = v;\n }\n }\n }\n }\n }\n\n public int[] minCostFlow(int s, int t, int maxf) {\n int n = graph.length;\n int[] dist = new int[n];\n int[] curflow = new int[n];\n int[] prevedge = new int[n];\n int[] prevnode = new int[n];\n\n int flow = 0;\n int flowCost = 0;\n while (flow < maxf) {\n bellmanFord(s, dist, prevnode, prevedge, curflow);\n if (dist[t] == Integer.MAX_VALUE)\n break;\n int df = Math.min(curflow[t], maxf - flow);\n flow += df;\n for (int v = t; v != s; v = prevnode[v]) {\n Edge e = graph[prevnode[v]].get(prevedge[v]);\n e.f += df;\n graph[v].get(e.rev).f -= df;\n flowCost += df * e.cost;\n }\n }\n return new int[]{flow, flowCost};\n }\n }\n\n public void solve(Scanner sc, PrintWriter pw) throws IOException {\n int n = sc.nextInt();\n int m = sc.nextInt();\n int k = sc.nextInt();\n int c = sc.nextInt();\n int d = sc.nextInt();\n int[] pos = new int[n];\n for (int i = 0; i < k; i++) {\n pos[sc.nextInt() - 1]++;\n }\n int T = 100;\n MinCostFlowBF mf = new MinCostFlowBF((T + 1) * n + 2);\n for (int i = 0; i < n; i++) {\n if (pos[i] > 0)\n mf.addEdge(0, i + 1, pos[i], 0);\n }\n for (int i = 0; i < T; i++) {\n for (int j = 0; j < n; j++) {\n mf.addEdge(1 + i * n + j, 1 + (i + 1) * n + j, k, 0);\n }\n }\n for (int i = 0; i <= T; i++) {\n for (int j = 1; j <= k; j++) {\n mf.addEdge(1 + i * n, (T + 1) * n + 1, 1, c * i);\n }\n }\n for (int i = 0; i < m; i++) {\n int a = sc.nextInt() - 1;\n int b = sc.nextInt() - 1;\n for (int j = 0; j < T; j++) {\n int cost = 0;\n for (int l = 1; l <= k; l++) {\n mf.addEdge(1 + j * n + a, 1 + (j + 1) * n + b, 1, l * l * d - cost);\n mf.addEdge(1 + j * n + b, 1 + (j + 1) * n + a, 1, l * l * d - cost);\n cost = l * l * d;\n }\n }\n }\n int[] flowAndCost = mf.minCostFlow(0, (T + 1) * n + 1, k);\n System.err.println(flowAndCost[0]);\n pw.println(flowAndCost[1]);\n }\n }\n\n static long TIME_START, TIME_END;\n\n public static void main(String[] args) throws IOException {\n Scanner sc = new Scanner(System.in);\n// Scanner sc = new Scanner(new FileInputStream(\"input\"));\n PrintWriter pw = new PrintWriter(new BufferedOutputStream(System.out));\n// PrintWriter pw = new PrintWriter(new FileOutputStream(\"output\"));\n\n Runtime runtime = Runtime.getRuntime();\n long usedMemoryBefore = runtime.totalMemory() - runtime.freeMemory();\n TIME_START = System.currentTimeMillis();\n Task t = new Task();\n t.solve(sc, pw);\n TIME_END = System.currentTimeMillis();\n long usedMemoryAfter = runtime.totalMemory() - runtime.freeMemory();\n pw.close();\n System.err.println(\"Memory increased: \" + (usedMemoryAfter - usedMemoryBefore) / 1000000);\n System.err.println(\"Time used: \" + (TIME_END - TIME_START) + \".\");\n }\n\n static class Scanner {\n StringTokenizer st;\n BufferedReader br;\n\n public Scanner(InputStream s) {\n br = new BufferedReader(new InputStreamReader(s));\n }\n\n public Scanner(FileReader s) throws FileNotFoundException {\n br = new BufferedReader(s);\n }\n\n public String next() throws IOException {\n while (st == null || !st.hasMoreTokens())\n st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n\n public int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n public long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n public String nextLine() throws IOException {\n return br.readLine();\n }\n\n public double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n\n public boolean ready() throws IOException {\n return br.ready();\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["flows", "graphs"], "code_uid": "a392c43725a9bb0dcd2dda1f750c2310", "src_uid": "2d0aa75f2e63c4fb8c98742ac8cd821c", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class GG {\n public static void main(String[] args) {\n FastScanner scanner = new FastScanner();\n PrintWriter out = new PrintWriter(System.out);\n int N = scanner.nextInt();\n int M = scanner.nextInt();\n int K = scanner.nextInt();\n int C = scanner.nextInt();\n int D = scanner.nextInt();\n MinCostMaxFlowSolver solver = new EdmondsKarp();\n int[] people = new int[K];\n for(int i = 0; i < K; i++) people[i] = scanner.nextInt()-1;\n Node src = solver.addNode();\n Node snk = solver.addNode();\n int amt = 150;\n Node[][] timeNodes = new Node[N][amt];\n for(int i = 0; i < N; i++) {\n for(int j = 1; j < amt; j++) {\n timeNodes[i][j] = solver.addNode();\n if (j > 1) solver.link(timeNodes[i][j-1], timeNodes[i][j], Integer.MAX_VALUE, 0);\n }\n }\n for(int i = 0; i < K; i++) {\n solver.link(src, timeNodes[people[i]][1], 1, 0);\n }\n for(int i = 1; i < amt; i++) {\n for(int j = 0; j < K; j++) {\n solver.link(timeNodes[0][i], snk, 1, C*i-C);\n }\n }\n for(int i =0; i < M; i++) {\n int a = scanner.nextInt()-1;\n int b = scanner.nextInt()-1;\n for(int j = 1; j < amt-1; j++) {\n int prev = 0;\n for(int k = 1; k <= K; k++) {\n solver.link(timeNodes[a][j], timeNodes[b][j + 1], 1, D*k*k- prev);\n solver.link(timeNodes[b][j], timeNodes[a][j + 1], 1, D*k*k - prev);\n prev = D * k * k;\n }\n }\n }\n long[] ret = solver.getMinCostMaxFlow(src, snk);\n out.println(ret[1]);\n out.flush();\n }\n \n public static class Node {\n // thou shall not create nodes except through addNode()\n private Node() { }\n \n List<Edge> edges = new ArrayList<Edge>();\n int index; // index in nodes array\n \n }\n \n public static class Edge\n {\n boolean forward; // true: edge is in original graph\n Node from, to; // nodes connected\n long flow; // current flow\n final long capacity;\n Edge dual; // reference to this edge's dual\n long cost; // only used for MinCost.\n protected Edge(Node s, Node d, long c, boolean f)\n {\n forward = f;\n from = s;\n to = d;\n capacity = c;\n }\n long remaining() { return capacity - flow; }\n void addFlow(long amount) {\n flow += amount;\n dual.flow -= amount;\n }\n }\n \n public static abstract class MaxFlowSolver {\n List<Node> nodes = new ArrayList<Node>();\n \n public void link(Node n1, Node n2, long capacity) {\n link(n1, n2, capacity, 1);\n }\n \n public void link(Node n1, Node n2, long capacity, long cost) {\n Edge e12 = new Edge(n1, n2, capacity, true);\n Edge e21 = new Edge(n2, n1, 0, false);\n e12.dual = e21;\n e21.dual = e12;\n n1.edges.add(e12);\n n2.edges.add(e21);\n e12.cost = cost;\n e21.cost = -cost;\n }\n void link(int n1, int n2, long capacity) {\n link(nodes.get(n1), nodes.get(n2), capacity);\n }\n protected MaxFlowSolver(int n) {\n for (int i = 0; i < n; i++)\n addNode();\n }\n protected MaxFlowSolver() {\n this(0);\n }\n \n public abstract long getMaxFlow(Node src, Node snk);\n public Node addNode() {\n Node n = new Node();\n n.index = nodes.size();\n nodes.add(n);\n return n;\n }\n }\n static abstract class MinCostMaxFlowSolver extends MaxFlowSolver {\n // returns [maxflow, mincost]\n abstract long [] getMinCostMaxFlow(Node src, Node snk);\n // unavoidable boiler plate\n MinCostMaxFlowSolver () { this(0); }\n MinCostMaxFlowSolver (int n) { super(n); }\n }\n \n static class EdmondsKarp extends MinCostMaxFlowSolver\n {\n EdmondsKarp () { this(0); }\n EdmondsKarp (int n) { super(n); }\n long minCost;\n \n @Override\n public long [] getMinCostMaxFlow(Node src, Node snk) {\n long maxflow = getMaxFlow(src, snk);\n return new long [] { maxflow, minCost };\n }\n static final long INF = Long.MAX_VALUE/4;\n \n @Override\n public long getMaxFlow(Node src, Node snk) {\n final int n = nodes.size();\n final int source = src.index;\n final int sink = snk.index;\n long flow = 0;\n long cost = 0;\n long[] potential = new long[n]; // allows Dijkstra to work with negative edge weights\n while (true) {\n Edge[] parent = new Edge[n]; // used to store an augmenting path\n long[] dist = new long[n]; // minimal cost to vertex\n Arrays.fill(dist, INF);\n dist[source] = 0;\n PriorityQueue<Item> que = new PriorityQueue<Item>();\n que.add(new Item(0, source));\n while (!que.isEmpty()) {\n Item item = que.poll();\n if (item.dist != dist[item.v])\n continue;\n \n for (Edge e : nodes.get(item.v).edges) {\n long temp = dist[item.v] + e.cost + potential[item.v] - potential[e.to.index];\n if (e.capacity > e.flow && dist[e.to.index] > temp) {\n dist[e.to.index] = temp;\n parent[e.to.index] = e;\n que.add(new Item(temp, e.to.index));\n }\n }\n }\n if (parent[sink] == null)\n break;\n for (int i = 0; i < n; i++)\n if (parent[i] != null)\n potential[i] += dist[i];\n long augFlow = Long.MAX_VALUE;\n for (int i = sink; i != source; i = parent[i].from.index)\n augFlow = Math.min(augFlow, parent[i].capacity - parent[i].flow);\n for (int i = sink; i != source; i = parent[i].from.index) {\n Edge e = parent[i];\n e.addFlow(augFlow);\n cost += augFlow * e.cost;\n }\n flow += augFlow;\n }\n \n minCost = cost;\n return flow;\n }\n \n static class Item implements Comparable<Item> {\n long dist;\n int v;\n \n public Item(long dist, int v) {\n this.dist = dist;\n this.v = v;\n }\n \n public int compareTo(Item that) {\n return Long.compare(this.dist, that.dist);\n }\n }\n }\n \n public static class FastScanner {\n BufferedReader br;\n StringTokenizer st;\n \n public FastScanner(Reader in) {\n br = new BufferedReader(in);\n }\n \n public FastScanner() {\n this(new InputStreamReader(System.in));\n }\n \n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n \n int nextInt() {\n return Integer.parseInt(next());\n }\n \n long nextLong() {\n return Long.parseLong(next());\n }\n \n double nextDouble() {\n return Double.parseDouble(next());\n }\n \n String readNextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n \n int[] readIntArray(int n) {\n int[] a = new int[n];\n for (int idx = 0; idx < n; idx++) {\n a[idx] = nextInt();\n }\n return a;\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["flows", "graphs"], "code_uid": "4ca70248a1648f41f6025dd528f14f17", "src_uid": "2d0aa75f2e63c4fb8c98742ac8cd821c", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// upsolve with rainboy\nimport java.io.*;\nimport java.util.*;\n\npublic class CF1187G extends PrintWriter {\n\tCF1187G() { super(System.out); }\n\tstatic class Scanner {\n\t\tScanner(InputStream in) { this.in = in; } InputStream in;\n\t\tint k, l; byte[] bb = new byte[1 << 15];\n\t\tbyte getc() {\n\t\t\tif (k >= l) {\n\t\t\t\tk = 0;\n\t\t\t\ttry { l = in.read(bb); } catch (IOException e) { l = 0; }\n\t\t\t\tif (l <= 0) return -1;\n\t\t\t}\n\t\t\treturn bb[k++];\n\t\t}\n\t\tint nextInt() {\n\t\t\tbyte c = 0; while (c <= 32) c = getc();\n\t\t\tint a = 0;\n\t\t\twhile (c > 32) { a = a * 10 + c - '0'; c = getc(); }\n\t\t\treturn a;\n\t\t}\n\t}\n\tScanner sc = new Scanner(System.in);\n\tpublic static void main(String[] $) {\n\t\tCF1187G o = new CF1187G(); o.main(); o.flush();\n\t}\n\n\tstatic final int INF = 0x3f3f3f3f;\n\tArrayList[] aa_;\n\tint n_, m_;\n\tint[] pi, dd, bb;\n\tint[] uu, vv, uv, cost;\n\tboolean[] iq;\n\tint[] cc;\n\tvoid init() {\n\t\taa_ = new ArrayList[n_];\n\t\tfor (int u = 0; u < n_; u++)\n\t\t\taa_[u] = new ArrayList<Integer>();\n\t\tpi = new int[n_];\n\t\tdd = new int[n_];\n\t\tbb = new int[n_];\n\t\tiq = new boolean[n_];\n\t\tuu = new int[m_];\n\t\tvv = new int[m_];\n\t\tuv = new int[m_];\n\t\tcost = new int[m_];\n\t\tcc = new int[m_ * 2];\n\t\tm_ = 0;\n\t}\n\tvoid link(int u, int v, int cap, int cos) {\n\t\tint h = m_++;\n\t\tuu[h] = u;\n\t\tvv[h] = v;\n\t\tuv[h] = u ^ v;\n\t\tcost[h] = cos;\n\t\tcc[h << 1 ^ 0] = cap;\n\t\taa_[u].add(h << 1 ^ 0);\n\t\taa_[v].add(h << 1 ^ 1);\n\t}\n\tboolean dijkstra(int s, int t) {\n\t\tArrays.fill(pi, INF);\n\t\tpi[s] = 0;\n\t\tTreeSet<Integer> pq = new TreeSet<>((u, v) -> pi[u] != pi[v] ? pi[u] - pi[v] : dd[u] != dd[v] ? dd[u] - dd[v] : u - v);\n\t\tpq.add(s); iq[s] = true;\n\t\tInteger first;\n\t\twhile ((first = pq.pollFirst()) != null) {\n\t\t\tint u = first;\n\t\t\tiq[u] = false;\n\t\t\tint d = dd[u] + 1;\n\t\t\tArrayList<Integer> adj = aa_[u];\n\t\t\tfor (int h_ : adj)\n\t\t\t\tif (cc[h_] > 0) {\n\t\t\t\t\tint h = h_ >> 1;\n\t\t\t\t\tint p = pi[u] + ((h_ & 1) == 0 ? cost[h] : -cost[h]);\n\t\t\t\t\tint v = u ^ uv[h];\n\t\t\t\t\tif (pi[v] > p || pi[v] == p && dd[v] > d) {\n\t\t\t\t\t\tif (iq[v]) {\n\t\t\t\t\t\t\tpq.remove(v); iq[v] = false;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tpi[v] = p;\n\t\t\t\t\t\tdd[v] = d;\n\t\t\t\t\t\tbb[v] = h_;\n\t\t\t\t\t\tpq.add(v); iq[v] = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t}\n\t\treturn pi[t] != INF;\n\t}\n\tvoid push(int s, int t) {\n\t\tint c = INF;\n\t\tfor (int u = t, h_, h; u != s; u ^= uv[h]) {\n\t\t\th = (h_ = bb[u]) >> 1;\n\t\t\tc = Math.min(c, cc[h_]);\n\t\t}\n\t\tfor (int u = t, h_, h; u != s; u ^= uv[h]) {\n\t\t\th = (h_ = bb[u]) >> 1;\n\t\t\tcc[h_] -= c; cc[h_ ^ 1] += c;\n\t\t}\n\t}\n\tvoid push1(int s, int t) {\n\t\tfor (int u = t, h_, h; u != s; u ^= uv[h]) {\n\t\t\th = (h_ = bb[u]) >> 1;\n\t\t\tcc[h_]--; cc[h_ ^ 1]++;\n\t\t}\n\t}\n\tint edmonds_karp(int s, int t) {\n\t\twhile (dijkstra(s, t))\n\t\t\tpush1(s, t);\n\t\tint c = 0;\n\t\tfor (int h = 0; h < m_; h++)\n\t\t\tc += cost[h] * cc[h << 1 ^ 1];\n\t\treturn c;\n\t}\n\tvoid main() {\n\t\tint n = sc.nextInt();\n\t\tint m = sc.nextInt();\n\t\tint k = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\tint d = sc.nextInt();\n\t\tint[] ii = new int[k];\n\t\tfor (int h = 0; h < k; h++)\n\t\t\tii[h] = sc.nextInt() - 1;\n\t\tArrayList[] aa = new ArrayList[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\taa[i] = new ArrayList<Integer>();\n\t\tfor (int h = 0; h < m; h++) {\n\t\t\tint i = sc.nextInt() - 1;\n\t\t\tint j = sc.nextInt() - 1;\n\t\t\taa[i].add(j);\n\t\t\taa[j].add(i);\n\t\t}\n\t\tint t = n + k + 1;\n\t\tn_ = n * t + 1;\n\t\tm_ = k + (m * 2 * k + n) * (t - 1);\n\t\tinit();\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tArrayList<Integer> adj = aa[i];\n\t\t\tfor (int s = 0; s < t - 1; s++) {\n\t\t\t\tint u = i * t + s;\n\t\t\t\tfor (int j : adj) {\n\t\t\t\t\tint v = j * t + s + 1;\n\t\t\t\t\tfor (int x = 1; x <= k; x++)\n\t\t\t\t\t\tlink(u, v, 1, c + (x * 2 - 1) * d);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tfor (int s = 0; s < t - 1; s++) {\n\t\t\t\tint u = i * t + s, v = u + 1;\n\t\t\t\tlink(u, v, k, i == 0 ? 0 : c);\n\t\t\t}\n\t\tfor (int h = 0; h < k; h++)\n\t\t\tlink(n_ - 1, ii[h] * t + 0, 1, 0);\n\t\tprintln(edmonds_karp(n_ - 1, 0 * t + t - 1));\n\t}\n}\n", "lang_cluster": "Java", "tags": ["flows", "graphs"], "code_uid": "d8617aec24939c88153306ce7a91fdc2", "src_uid": "2d0aa75f2e63c4fb8c98742ac8cd821c", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package educational.round67;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.List;\n\npublic class G {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t\tint n = ni(), m = ni(), K = ni(), C = ni(), D = ni();\n\t\tint[] a = na(K);\n\t\tint[] from = new int[m];\n\t\tint[] to = new int[m];\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tfrom[i] = ni() - 1;\n\t\t\tto[i] = ni() - 1;\n\t\t}\n\t\tint[][] g = packU(n, from, to);\n\t\tList<Edge> es = new ArrayList<>();\n\t\t\n\t\tint time = 100;\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tfor(int j = 0;j < time-1;j++){\n\t\t\t\tes.add(new Edge(i*time+j, i*time+j+1, 99, C));\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tfor(int e : g[i]){\n\t\t\t\tfor(int j = 0;j < time-1;j++){\n\t\t\t\t\tfor(int k = 0;k < n;k++){\n\t\t\t\t\t\tes.add(new Edge(i*time+j, e*time+j+1, 1, C+D*(2*k+1)));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint src = time*n, sink = src+1;\n\t\tfor(int i = 0;i < K;i++){\n\t\t\tes.add(new Edge(src, (a[i]-1)*time+0, 1, 0));\n\t\t}\n\t\tfor(int i = 0;i < time;i++){\n\t\t\tes.add(new Edge(0*time+i, sink, 99, 0));\n\t\t}\n\t\t\n\t\tout.println(solveMinCostFlowWithSPFA(compileWD(sink+1, es), src, sink, 99));\n\t}\n\t\n\tpublic static class Edge\n\t{\n\t\tpublic int from, to;\n\t\tpublic int capacity;\n\t\tpublic int cost;\n\t\tpublic int flow;\n\t\tpublic Edge complement;\n\t\t// public int iniflow;\n\t\t\n\t\tpublic Edge(int from, int to, int capacity, int cost) {\n\t\t\tthis.from = from;\n\t\t\tthis.to = to;\n\t\t\tthis.capacity = capacity;\n\t\t\tthis.cost = cost;\n\t\t}\n\t}\n\t\n\tpublic static Edge[][] compileWD(int n, List<Edge> edges)\n\t{\n\t\tEdge[][] g = new Edge[n][];\n\t\t// cloning\n\t\tfor(int i = edges.size()-1;i >= 0;i--){\n\t\t\tEdge origin = edges.get(i);\n\t\t\tEdge clone = new Edge(origin.to, origin.from, origin.capacity, -origin.cost);\n\t\t\tclone.flow = origin.capacity;\n\t\t\tclone.complement = origin;\n\t\t\torigin.complement = clone;\n\t\t\tedges.add(clone);\n\t\t}\n\t\t\n\t\tint[] p = new int[n];\n\t\tfor(Edge e : edges)p[e.from]++;\n\t\tfor(int i = 0;i < n;i++)g[i] = new Edge[p[i]];\n\t\tfor(Edge e : edges)g[e.from][--p[e.from]] = e;\n\t\treturn g;\n\t}\n\n\t// NOT VERIFIED\n\tpublic static Edge[][] compileWU(int n, List<Edge> edges)\n\t{\n\t\tEdge[][] g = new Edge[n][];\n\t\t// cloning\n\t\tfor(int i = edges.size()-1;i >= 0;i--){\n\t\t\tEdge origin = edges.get(i);\n\t\t\tEdge back = new Edge(origin.to, origin.from, origin.capacity, origin.cost);\n\t\t\tedges.add(back);\n\t\t}\n\t\tfor(int i = edges.size()-1;i >= 0;i--){\n\t\t\tEdge origin = edges.get(i);\n\t\t\tEdge clone = new Edge(origin.to, origin.from, origin.capacity, -origin.cost);\n\t\t\tclone.flow = origin.capacity;\n\t\t\tclone.complement = origin;\n\t\t\torigin.complement = clone;\n\t\t\tedges.add(clone);\n\t\t}\n\t\t\n\t\tint[] p = new int[n];\n\t\tfor(Edge e : edges)p[e.from]++;\n\t\tfor(int i = 0;i < n;i++)g[i] = new Edge[p[i]];\n\t\tfor(Edge e : edges)g[e.from][--p[e.from]] = e;\n\t\treturn g;\n\t}\t\n\n\t\n\tpublic static class DQ {\n\t\tpublic int[] q;\n\t\tpublic int n;\n\t\tprotected int pt, ph;\n\t\t\n\t\tpublic DQ(int n){ this.n = Integer.highestOneBit(n)<<1; q = new int[this.n]; pt = ph = 0; }\n\t\t\n\t\tpublic void addLast(int x){ q[ph] = x; ph = ph+1&n-1; }\n\t\tpublic void addFirst(int x){ pt = pt+n-1&n-1; q[pt] = x; }\n\t\tpublic int pollFirst(){ int ret = q[pt]; pt = pt+1&n-1; return ret; }\n\t\tpublic int pollLast(){ ph = ph+n-1&n-1; int ret = q[ph]; return ret; }\n\t\tpublic int getFirst(){ return q[pt]; }\n\t\tpublic int getFirst(int k){ return q[pt+k&n-1]; }\n\t\tpublic int getLast(){ return q[ph+n-1&n-1]; }\n\t\tpublic int getLast(int k){ return q[ph+n-k-1&n-1]; }\n\t\tpublic void clear(){ pt = ph = 0; }\n\t\tpublic int size(){ return ph-pt+n&n-1; }\n\t\tpublic boolean isEmpty(){ return ph==pt; }\n\t}\n\n\t\n\tpublic static long solveMinCostFlowWithSPFA(Edge[][] g, int source, int sink, long all)\n\t{\n\t\tint n = g.length;\n\t\tlong mincost = 0;\n\t\t\n\t\tfinal int[] d = new int[n];\n\t\tDQ q = new DQ(n);\n\t\tboolean[] inq = new boolean[n];\n\t\twhile(all > 0){\n\t\t\t// shortest path src->sink\n\t\t\tEdge[] inedge = new Edge[n];\n\t\t\tArrays.fill(d, Integer.MAX_VALUE / 2);\n\t\t\td[source] = 0;\n\t\t\tq.addLast(source);\n\t\t\twhile(!q.isEmpty()){\n\t\t\t\tint cur = q.pollFirst();\n\t\t\t\tinq[cur] = false;\n\t\t\t\tfor(Edge ne : g[cur]){\n\t\t\t\t\tif(ne.capacity - ne.flow > 0){\n\t\t\t\t\t\tint nd = d[cur] + ne.cost;\n\t\t\t\t\t\tif(d[ne.to] > nd){\n\t\t\t\t\t\t\tinedge[ne.to] = ne;\n\t\t\t\t\t\t\td[ne.to] = nd;\n\t\t\t\t\t\t\tif(!inq[ne.to]){\n\t\t\t\t\t\t\t\tq.addLast(ne.to);\n\t\t\t\t\t\t\t\tinq[ne.to] = true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(inedge[sink] == null)break;\n\t\t\t\n\t\t\tlong minflow = all;\n\t\t\tlong sumcost = 0;\n\t\t\tfor(Edge e = inedge[sink];e != null;e = inedge[e.from]){\n\t\t\t\tif(e.capacity - e.flow < minflow)minflow = e.capacity - e.flow;\n\t\t\t\tsumcost += e.cost;\n\t\t\t}\n\t\t\tmincost += minflow * sumcost;\n\t\t\tfor(Edge e = inedge[sink];e != null;e = inedge[e.from]){\n\t\t\t\te.flow += minflow;\n\t\t\t\te.complement.flow -= minflow;\n\t\t\t}\n\t\t\t\n\t\t\tall -= minflow;\n\t\t}\n\t\treturn mincost;\n\t}\n\n\n\tstatic int[][] packU(int n, int[] from, int[] to) {\n\t\tint[][] g = new int[n][];\n\t\tint[] p = new int[n];\n\t\tfor (int f : from)\n\t\t\tp[f]++;\n\t\tfor (int t : to)\n\t\t\tp[t]++;\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tg[i] = new int[p[i]];\n\t\tfor (int i = 0; i < from.length; i++) {\n\t\t\tg[from[i]][--p[from[i]]] = to[i];\n\t\t\tg[to[i]][--p[to[i]]] = from[i];\n\t\t}\n\t\treturn g;\n\t}\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new G().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["flows", "graphs"], "code_uid": "19e72ce3f30c0a1c1b80a08e92f5744c", "src_uid": "2d0aa75f2e63c4fb8c98742ac8cd821c", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\npublic class G{\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskE solver = new TaskE();\n solver.solve(1, in, out);\n out.flush();out.close();\n }\n static class TaskE {\n class MinCostMaxFlow{\n ArrayList<Edge> al[];\n Edge ja[][]; \n int d[]; // shortest distances\n int N , S , T , maxFlow ; int minCost;\n final int gmax = Integer.MAX_VALUE / 100;\n \n int edges = 0;\n\n class Edge{\n int u , flow, rid, cost;\n Edge(int a, int b, int c, int d){u = a; flow = b; cost = c; rid = d;}\n }\n \n void addEdge(int u , int v , int flow , int cost){\n int lu = al[u].size(), lv = al[v].size();\n al[u].add(new Edge(v, flow, cost, lv)); \n al[v].add(new Edge(u, 0, -cost, lu)); \n }\n \n void convertToArray(){\n ja = new Edge[N][];\n for(int i = 0; i < N; i++){\n int sz = al[i].size();\n ja[i] = new Edge[sz];\n for(int j = 0; j < sz; j++){\n ja[i][j] = al[i].get(j);\n }\n al[i].clear();\n }\n }\n \n MinCostMaxFlow(int n , int source , int sink){\n N = n; S = source; T = sink; maxFlow = 0; minCost = 0;\n al = new ArrayList[N];\n d = new int[N];\n for(int i = 0; i < N; i++){\n al[i] = new ArrayList<>();\n }\n }\n \n boolean BellmanFord(boolean check){\n d[0] = 0;\n for(int i = 0; i < N - 1; i++){\n for(int j = 0; j < N; j++){\n for(Edge e : ja[j]){\n if(e.flow == 0)continue; // not to consider reverse edges\n d[e.u] = Math.min(d[e.u] , d[j] + e.cost);\n }\n }\n }\n if(check){// check for negative cycles\n for(int j = 0; j < N; j++){\n for(Edge e : ja[j]){\n if(e.flow == 0)continue;\n if(d[j] + e.cost < d[e.u]) return false;\n }\n } \n }return true;\n }\n\n int node[]; // present node \n\n int visit[]; // 0 -> not added 1 -> not removed 2 -> removed\n int prv[], prve[]; // previous node for augmentation\n int dist[]; // min dist\n\n boolean simple(){\n node = new int[N]; \n visit = new int[N]; \n prv = new int[N];\n prve = new int[N];\n dist = new int[N]; Arrays.fill(dist , gmax);\n\n node[0] = S; dist[0] = 0;\n int front = 1, back = 0;\n while(front != back){\n int u = node[back++]; int distu = dist[u];\n if(back == N)back = 0;\n visit[u] = 2;\n for(int i = 0; i < ja[u].length; i++){\n Edge e = ja[u][i];\n if(e.flow == 0)continue;\n int cdist = distu + e.cost; // no need of reduced cost\n if(cdist < dist[e.u]){\n if(visit[e.u] == 0){\n node[front] = e.u; \n if(++front == N)front = 0;\n }else if(visit[e.u] == 2){\n if(--back == -1)back += N;\n node[back] = e.u;\n }\n visit[e.u] = 1;\n prve[e.u] = i; prv[e.u] = u; dist[e.u] = cdist;\n }\n }\n }\n return visit[T] != 0;\n }\n\n class pair{\n int F; int S;\n pair(int a, int b){F = a; S = b;}\n }\n\n boolean dijkstra(){\n visit = new int[N];\n prv = new int[N];\n prve = new int[N];\n dist = new int[N]; Arrays.fill(dist, gmax);\n PriorityQueue<pair> pq = new PriorityQueue<>((A, B) -> Double.compare(A.S , B.S));\n\n pq.add(new pair(S , 0)); dist[0] = 0;\n o : while(!pq.isEmpty()){\n pair p = pq.poll();\n while(dist[p.F] < p.S){\n if(pq.isEmpty()) break o; // had a better val \n p = pq.poll();\n }\n visit[p.F] = 2;\n for(int i = 0; i < ja[p.F].length; i++){\n Edge e = ja[p.F][i];\n if(e.flow == 0)continue; // important\n int cdist = p.S + (e.cost + d[p.F] - d[e.u]); // reduced cost\n if(cdist < dist[e.u]){ \n if(visit[e.u] == 2) return false;\n pq.add(new pair(e.u , cdist));\n dist[e.u] = cdist; prv[e.u] = p.F; prve[e.u] = i;\n visit[e.u] = 1;\n }\n }\n }\n return visit[T] != 0;\n }\n \n int augment(){\n int p = T; int min = gmax;\n while(p != 0){\n int pp = prv[p], pe = prve[p];\n int val = ja[pp][pe].flow;\n min = Math.min(min , val);\n p = pp;\n }\n p = T;\n while(p != 0){\n int pp = prv[p], pe = prve[p];\n ja[pp][pe].flow -= min;\n ja[p][ja[pp][pe].rid].flow += min;\n p = pp;\n }\n maxFlow += min;\n return min;\n }\n\n // if(dist[T] >= 0)return true; // non contributing flow\n boolean calSimple(){\n // uncomment to check for negative cycles\n /* boolean possible = BellmanFord(true); \n if(!possible) return false; */\n while(simple()){\n /*if(dist[T] >= 0)return true;*/ \n minCost += dist[T] * augment();\n }\n return true;\n }\n\n void updPotential(){\n for(int i = 0; i < N; i++){\n if(visit[i] != 0){\n d[i] += dist[i] - dist[S];\n }\n }\n }\n boolean calWithPotential(){\n // set true to check for negative cycles\n // boolean possible = BellmanFord(false); \n // if(!possible) return false;\n while(dijkstra()){\n int min = dist[T] + d[T] - d[S]; // getting back the original cost\n /*if(dist[T] >= 0)return true;*/\n minCost += min * augment();\n updPotential();\n }\n return true; \n }\n }\n int n , m, k, c, d, a[], f[];\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n n = in.nextInt(); m = in.nextInt(); k = in.nextInt(); c = in.nextInt(); d= in.nextInt();\n // S + n\n int maxl = n + k, T = n * maxl + 1;\n MinCostMaxFlow ans = new MinCostMaxFlow(T + 1, 0, T);\n a = new int[k + 1]; f = new int[n + 1];\n for(int i = 1; i <= k; i++){\n a[i] = in.nextInt();\n f[a[i]]++;\n }\n for(int i = 1; i <= n; i++){\n if(f[i] == 0)continue;\n ans.addEdge(0 , i , f[i], 0);\n }\n for(int i = 2; i <= n; i++){\n for(int l = 0; l < maxl - 1; l++){\n ans.addEdge(l * n + i , (l + 1) * n + i, k, c);\n }\n }\n for(int i = 1; i <= m; i++){\n int a = in.nextInt(), b = in.nextInt();\n for(int l = 0; l < maxl - 1; l++){\n for(int p = 1; p <= k; p++){\n if(a != 1)\n ans.addEdge(n * l + a, n * (l + 1) + b, 1, d * (2 * p - 1) + c);\n if(b != 1)\n ans.addEdge(n * l + b, n * (l + 1) + a, 1, d * (2 * p - 1) + c);\n }\n } \n }\n for(int l = 1; l < maxl; l++){\n ans.addEdge(l * n + 1, T, k, 0);\n }\n ans.convertToArray();\n // ans.calWithPotential();\n ans.calSimple();\n if(ans.maxFlow != k){\n out.println(\"BUG\");\n }else{\n out.println((int)ans.minCost);\n }\n }\n }\n static class InputReader {\n BufferedReader br;\n StringTokenizer st;\n public InputReader(InputStream stream) {\n br = new BufferedReader(new InputStreamReader(stream));\n st = null;\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return null;\n st = new StringTokenizer(s);\n }\n return st.nextToken();\n }\n\n boolean hasMoreTokens() {\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return false;\n st = new StringTokenizer(s);\n }\n return true;\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n public long nextLong() {\n return Long.parseLong(next());\n }\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n }\n}", "lang_cluster": "Java", "tags": ["flows", "graphs"], "code_uid": "17227a70128916cce8130c654179a14c", "src_uid": "2d0aa75f2e63c4fb8c98742ac8cd821c", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// upsolve with rainboy\nimport java.io.*;\nimport java.util.*;\n\npublic class CF1187G extends PrintWriter {\n\tCF1187G() { super(System.out); }\n\tstatic class Scanner {\n\t\tScanner(InputStream in) { this.in = in; } InputStream in;\n\t\tint k, l; byte[] bb = new byte[1 << 15];\n\t\tbyte getc() {\n\t\t\tif (k >= l) {\n\t\t\t\tk = 0;\n\t\t\t\ttry { l = in.read(bb); } catch (IOException e) { l = 0; }\n\t\t\t\tif (l <= 0) return -1;\n\t\t\t}\n\t\t\treturn bb[k++];\n\t\t}\n\t\tint nextInt() {\n\t\t\tbyte c = 0; while (c <= 32) c = getc();\n\t\t\tint a = 0;\n\t\t\twhile (c > 32) { a = a * 10 + c - '0'; c = getc(); }\n\t\t\treturn a;\n\t\t}\n\t}\n\tScanner sc = new Scanner(System.in);\n\tpublic static void main(String[] $) {\n\t\tCF1187G o = new CF1187G(); o.main(); o.flush();\n\t}\n\n\tstatic final int INF = 0x3f3f3f3f;\n\tArrayList[] aa_;\n\tint n_, m_;\n\tint[] pi, dd, bb;\n\tint[] uu, vv, uv, cost, cost_;\n\tint[] cc;\n\tvoid init() {\n\t\taa_ = new ArrayList[n_];\n\t\tfor (int u = 0; u < n_; u++)\n\t\t\taa_[u] = new ArrayList<Integer>();\n\t\tpi = new int[n_];\n\t\tdd = new int[n_];\n\t\tbb = new int[n_];\n\t\tuu = new int[m_];\n\t\tvv = new int[m_];\n\t\tuv = new int[m_];\n\t\tcost = new int[m_];\n\t\tcc = new int[m_ * 2];\n\t\tm_ = 0;\n\t}\n\tvoid link(int u, int v, int cap, int cos) {\n\t\tint h = m_++;\n\t\tuu[h] = u;\n\t\tvv[h] = v;\n\t\tuv[h] = u ^ v;\n\t\tcost[h] = cos;\n\t\tcc[h << 1 ^ 0] = cap;\n\t\taa_[u].add(h << 1 ^ 0);\n\t\taa_[v].add(h << 1 ^ 1);\n\t}\n\tboolean dijkstra(int s, int t) {\n\t\tArrays.fill(pi, INF);\n\t\tpi[s] = 0;\n\t\tTreeSet<Integer> pq = new TreeSet<>((u, v) -> pi[u] != pi[v] ? pi[u] - pi[v] : dd[u] != dd[v] ? dd[u] - dd[v] : u - v);\n\t\tpq.add(s);\n\t\tInteger first;\n\t\twhile ((first = pq.pollFirst()) != null) {\n\t\t\tint u = first;\n\t\t\tint d = dd[u] + 1;\n\t\t\tArrayList<Integer> adj = aa_[u];\n\t\t\tfor (int h_ : adj)\n\t\t\t\tif (cc[h_] > 0) {\n\t\t\t\t\tint h = h_ >> 1;\n\t\t\t\t\tint p = pi[u] + ((h_ & 1) == 0 ? cost_[h] : -cost_[h]);\n\t\t\t\t\tint v = u ^ uv[h];\n\t\t\t\t\tif (pi[v] > p || pi[v] == p && dd[v] > d) {\n\t\t\t\t\t\tif (pi[v] != INF)\n\t\t\t\t\t\t\tpq.remove(v);\n\t\t\t\t\t\tpi[v] = p;\n\t\t\t\t\t\tdd[v] = d;\n\t\t\t\t\t\tbb[v] = h_;\n\t\t\t\t\t\tpq.add(v);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t}\n\t\treturn pi[t] != INF;\n\t}\n\tvoid push(int s, int t) {\n\t\tint c = INF;\n\t\tfor (int u = t, h_, h; u != s; u ^= uv[h]) {\n\t\t\th = (h_ = bb[u]) >> 1;\n\t\t\tc = Math.min(c, cc[h_]);\n\t\t}\n\t\tfor (int u = t, h_, h; u != s; u ^= uv[h]) {\n\t\t\th = (h_ = bb[u]) >> 1;\n\t\t\tcc[h_] -= c; cc[h_ ^ 1] += c;\n\t\t}\n\t}\n\tvoid push1(int s, int t) {\n\t\tfor (int u = t, h_, h; u != s; u ^= uv[h]) {\n\t\t\th = (h_ = bb[u]) >> 1;\n\t\t\tcc[h_]--; cc[h_ ^ 1]++;\n\t\t}\n\t}\n\tint edmonds_karp(int s, int t) {\n\t\tcost_ = Arrays.copyOf(cost, m_);\n\t\twhile (dijkstra(s, t)) {\n\t\t\tpush1(s, t);\n\t\t\tfor (int h = 0; h < m_; h++) {\n\t\t\t\tint u = uu[h], v = vv[h];\n\t\t\t\tif (pi[u] != INF && pi[v] != INF)\n\t\t\t\t\tcost_[h] += pi[u] - pi[v];\n\t\t\t}\n\t\t}\n\t\tint c = 0;\n\t\tfor (int h = 0; h < m_; h++)\n\t\t\tc += cost[h] * cc[h << 1 ^ 1];\n\t\treturn c;\n\t}\n\tvoid main() {\n\t\tint n = sc.nextInt();\n\t\tint m = sc.nextInt();\n\t\tint k = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\tint d = sc.nextInt();\n\t\tint[] ii = new int[k];\n\t\tfor (int h = 0; h < k; h++)\n\t\t\tii[h] = sc.nextInt() - 1;\n\t\tArrayList[] aa = new ArrayList[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\taa[i] = new ArrayList<Integer>();\n\t\tfor (int h = 0; h < m; h++) {\n\t\t\tint i = sc.nextInt() - 1;\n\t\t\tint j = sc.nextInt() - 1;\n\t\t\taa[i].add(j);\n\t\t\taa[j].add(i);\n\t\t}\n\t\tint t = n + k + 1;\n\t\tn_ = n * t + 1;\n\t\tm_ = k + (m * 2 * k + n) * (t - 1);\n\t\tinit();\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tArrayList<Integer> adj = aa[i];\n\t\t\tfor (int s = 0; s < t - 1; s++) {\n\t\t\t\tint u = i * t + s;\n\t\t\t\tfor (int j : adj) {\n\t\t\t\t\tint v = j * t + s + 1;\n\t\t\t\t\tfor (int x = 1; x <= k; x++)\n\t\t\t\t\t\tlink(u, v, 1, c + (x * 2 - 1) * d);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tfor (int s = 0; s < t - 1; s++) {\n\t\t\t\tint u = i * t + s, v = u + 1;\n\t\t\t\tlink(u, v, k, i == 0 ? 0 : c);\n\t\t\t}\n\t\tfor (int h = 0; h < k; h++)\n\t\t\tlink(n_ - 1, ii[h] * t + 0, 1, 0);\n\t\tprintln(edmonds_karp(n_ - 1, 0 * t + t - 1));\n\t}\n}\n", "lang_cluster": "Java", "tags": ["flows", "graphs"], "code_uid": "ece508f47965377cbca42ece52cb2172", "src_uid": "2d0aa75f2e63c4fb8c98742ac8cd821c", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// upsolve with rainboy\nimport java.io.*;\nimport java.util.*;\n\npublic class CF1187G extends PrintWriter {\n\tCF1187G() { super(System.out); }\n\tstatic class Scanner {\n\t\tScanner(InputStream in) { this.in = in; } InputStream in;\n\t\tint k, l; byte[] bb = new byte[1 << 15];\n\t\tbyte getc() {\n\t\t\tif (k >= l) {\n\t\t\t\tk = 0;\n\t\t\t\ttry { l = in.read(bb); } catch (IOException e) { l = 0; }\n\t\t\t\tif (l <= 0) return -1;\n\t\t\t}\n\t\t\treturn bb[k++];\n\t\t}\n\t\tint nextInt() {\n\t\t\tbyte c = 0; while (c <= 32) c = getc();\n\t\t\tint a = 0;\n\t\t\twhile (c > 32) { a = a * 10 + c - '0'; c = getc(); }\n\t\t\treturn a;\n\t\t}\n\t}\n\tScanner sc = new Scanner(System.in);\n\tpublic static void main(String[] $) {\n\t\tCF1187G o = new CF1187G(); o.main(); o.flush();\n\t}\n\n\tstatic final int INF = 0x3f3f3f3f;\n\tArrayList[] aa_;\n\tint n_, m_;\n\tint[] pi, kk, bb;\n\tint[] uu, vv, cost, cost_;\n\tint[] cc;\n\tvoid init() {\n\t\taa_ = new ArrayList[n_];\n\t\tfor (int u = 0; u < n_; u++)\n\t\t\taa_[u] = new ArrayList<Integer>();\n\t\tpi = new int[n_];\n\t\tkk = new int[n_];\n\t\tbb = new int[n_];\n\t\tuu = new int[m_];\n\t\tvv = new int[m_];\n\t\tcost = new int[m_];\n\t\tcost_ = new int[m_];\n\t\tcc = new int[m_ * 2];\n\t\tm_ = 0;\n\t}\n\tvoid link(int u, int v, int cap, int cos) {\n\t\tint h = m_++;\n\t\tuu[h] = u;\n\t\tvv[h] = v;\n\t\tcost[h] = cos;\n\t\tcc[h << 1 ^ 0] = cap;\n\t\taa_[u].add(h << 1 ^ 0);\n\t\taa_[v].add(h << 1 ^ 1);\n\t}\n\tvoid dijkstra(int s) {\n\t\tArrays.fill(pi, INF);\n\t\tpi[s] = 0;\n\t\tTreeSet<Integer> pq = new TreeSet<>((u, v) -> pi[u] != pi[v] ? pi[u] - pi[v] : kk[u] != kk[v] ? kk[u] - kk[v] : u - v);\n\t\tpq.add(s);\n\t\tInteger first;\n\t\twhile ((first = pq.pollFirst()) != null) {\n\t\t\tint u = first;\n\t\t\tint k = kk[u] + 1;\n\t\t\tArrayList<Integer> adj = aa_[u];\n\t\t\tfor (int h_ : adj)\n\t\t\t\tif (cc[h_] > 0) {\n\t\t\t\t\tint h = h_ >> 1;\n\t\t\t\t\tint p = pi[u] + ((h_ & 1) == 0 ? cost_[h] : -cost_[h]);\n\t\t\t\t\tint v = u ^ uu[h] ^ vv[h];\n\t\t\t\t\tif (pi[v] > p || pi[v] == p && kk[v] > k) {\n\t\t\t\t\t\tif (pi[v] < INF)\n\t\t\t\t\t\t\tpq.remove(v);\n\t\t\t\t\t\tpi[v] = p;\n\t\t\t\t\t\tkk[v] = k;\n\t\t\t\t\t\tbb[v] = h_;\n\t\t\t\t\t\tpq.add(v);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t}\n\t}\n\tvoid push(int s, int t) {\n\t\tint c = INF;\n\t\tfor (int u = t, h_, h; u != s; u ^= uu[h] ^ vv[h]) {\n\t\t\th = (h_ = bb[u]) >> 1;\n\t\t\tc = Math.min(c, cc[h_]);\n\t\t}\n\t\tfor (int u = t, h_, h; u != s; u ^= uu[h] ^ vv[h]) {\n\t\t\th = (h_ = bb[u]) >> 1;\n\t\t\tcc[h_] -= c; cc[h_ ^ 1] += c;\n\t\t}\n\t}\n\tint edmonds_karp(int s, int t) {\n\t\tSystem.arraycopy(cost, 0, cost_, 0, m_);\n\t\twhile (true) {\n\t\t\tdijkstra(s);\n\t\t\tif (pi[t] == INF)\n\t\t\t\tbreak;\n\t\t\tpush(s, t);\n\t\t\tfor (int h = 0; h < m_; h++) {\n\t\t\t\tint u = uu[h], v = vv[h];\n\t\t\t\tif (pi[u] != INF && pi[v] != INF)\n\t\t\t\t\tcost_[h] += pi[u] - pi[v];\n\t\t\t}\n\t\t}\n\t\tint c = 0;\n\t\tfor (int h = 0; h < m_; h++)\n\t\t\tc += cost[h] * cc[h << 1 ^ 1];\n\t\treturn c;\n\t}\n\tvoid main() {\n\t\tint n = sc.nextInt();\n\t\tint m = sc.nextInt();\n\t\tint k = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\tint d = sc.nextInt();\n\t\tint[] ii = new int[k];\n\t\tfor (int h = 0; h < k; h++)\n\t\t\tii[h] = sc.nextInt() - 1;\n\t\tArrayList[] aa = new ArrayList[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\taa[i] = new ArrayList<Integer>();\n\t\tfor (int h = 0; h < m; h++) {\n\t\t\tint i = sc.nextInt() - 1;\n\t\t\tint j = sc.nextInt() - 1;\n\t\t\taa[i].add(j);\n\t\t\taa[j].add(i);\n\t\t}\n\t\tint t = n + k + 1;\n\t\tn_ = n * t + 1;\n\t\tm_ = k + (m * 2 * k + n) * (t - 1);\n\t\tinit();\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tArrayList<Integer> adj = aa[i];\n\t\t\tfor (int s = 0; s < t - 1; s++) {\n\t\t\t\tint u = i * t + s;\n\t\t\t\tfor (int j : adj) {\n\t\t\t\t\tint v = j * t + s + 1;\n\t\t\t\t\tfor (int x = 1; x <= k; x++)\n\t\t\t\t\t\tlink(u, v, 1, c + (x * 2 - 1) * d);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tfor (int s = 0; s < t - 1; s++) {\n\t\t\t\tint u = i * t + s, v = u + 1;\n\t\t\t\tlink(u, v, k, i == 0 ? 0 : c);\n\t\t\t}\n\t\tfor (int h = 0; h < k; h++)\n\t\t\tlink(n_ - 1, ii[h] * t + 0, 1, 0);\n\t\tprintln(edmonds_karp(n_ - 1, 0 * t + t - 1));\n\t}\n}\n", "lang_cluster": "Java", "tags": ["flows", "graphs"], "code_uid": "8112269a6f32209792991e779226c0a9", "src_uid": "2d0aa75f2e63c4fb8c98742ac8cd821c", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC {\n public long a;\n public long b;\n public int pt;\n public int[] l;\n public int[] r;\n public int[] arr;\n public int ans;\n\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n a = in.nextLong();\n b = in.nextLong();\n String sa = String.valueOf(a), sb = String.valueOf(b);\n while (sa.length() < sb.length()) sa = \"0\" + sa;\n int m = sa.length();\n l = new int[m];\n r = new int[m];\n for (int i = 0; i < m; i++) l[i] = sa.charAt(i) - '0';\n for (int i = 0; i < m; i++) r[i] = sb.charAt(i) - '0';\n arr = new int[10];\n long[] pow10 = new long[m + 1];\n pow10[0] = 1;\n for (int i = 1; i < pow10.length; i++) pow10[i] = pow10[i - 1] * 10;\n pt = 0;\n while (pt < m && l[pt] == r[pt]) {\n a -= pow10[m - pt - 1] * l[pt];\n b -= pow10[m - pt - 1] * l[pt];\n pt++;\n }\n if (pt == m) {\n out.println(1);\n return;\n }\n dfs(0, m - pt);\n out.println(ans);\n }\n\n public void dfs(int num, int left) {\n if (num == 9) {\n arr[9] = left;\n if (ok(arr)) {\n ans++;\n }\n } else {\n for (int i = 0; i <= left; i++) {\n arr[num] = i;\n dfs(num + 1, left - i);\n }\n }\n }\n\n public boolean ok(int[] arr) {\n if (arr[r[pt]] > 0) {\n arr[r[pt]] -= 1;\n long g = r[pt];\n for (int dd = 0; dd <= 9; dd++) for (int k = 0; k < arr[dd]; k++) g = g * 10 + dd;\n arr[r[pt]]++;\n if (g <= b) {\n return true;\n }\n }\n for (int cdig = r[pt] - 1; cdig >= l[pt] + 1; cdig--) {\n if (arr[cdig] > 0) {\n return true;\n }\n }\n if (arr[l[pt]] > 0) {\n arr[l[pt]]--;\n long g = l[pt];\n for (int dd = 9; dd >= 0; dd--) for (int k = 0; k < arr[dd]; k++) g = g * 10 + dd;\n arr[l[pt]]++;\n if (g >= a) {\n return true;\n }\n }\n return false;\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void println(int i) {\n writer.println(i);\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (this.numChars == -1) {\n throw new InputMismatchException();\n } else {\n if (this.curChar >= this.numChars) {\n this.curChar = 0;\n\n try {\n this.numChars = this.stream.read(this.buf);\n } catch (IOException var2) {\n throw new InputMismatchException();\n }\n\n if (this.numChars <= 0) {\n return -1;\n }\n }\n\n return this.buf[this.curChar++];\n }\n }\n\n public long nextLong() {\n int c;\n for (c = this.read(); isSpaceChar(c); c = this.read()) {\n ;\n }\n\n byte sgn = 1;\n if (c == 45) {\n sgn = -1;\n c = this.read();\n }\n\n long res = 0L;\n\n while (c >= 48 && c <= 57) {\n res *= 10L;\n res += (long) (c - 48);\n c = this.read();\n if (isSpaceChar(c)) {\n return res * (long) sgn;\n }\n }\n\n throw new InputMismatchException();\n }\n\n public static boolean isSpaceChar(int c) {\n return c == 32 || c == 10 || c == 13 || c == 9 || c == -1;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "greedy", "combinatorics", "brute force"], "code_uid": "662096534fa8cc84959eb6cffdf706a2", "src_uid": "adfa5f280eefbacdbaa4ad605402b57a", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.lang.Math;\nimport java.util.*;\n\npublic class Main\n{\t\n\tpublic BufferedReader in;\n\tpublic PrintStream out;\n\t\n\tpublic boolean log_enabled = false;\n\t\n\tint n;\n\tint[] adj_count;\n\tint[][] adj_list;\n\t\n\tint[] ch_count;\n\tint[][] ch_list;\n\t\n\tlong[] X, Y, Z;\n\tboolean[] V;\n\t\n\tlong M = 998244353;\n\t\n\tpublic long modInverse(long a, long n) {\n\t long i = n, v = 0, d = 1;\n\t while (a>0) {\n\t long t = i/a, x = a;\n\t a = i % x;\n\t i = x;\n\t x = d;\n\t d = v - t*x;\n\t v = x;\n\t }\n\t v %= n;\n\t if (v<0) v = (v+n)%n;\n\t return v;\n\t}\n\t\n\tpublic void generate_test()\n\t{\n\t\tout.println(300000);\n\t\tfor (int i=1; i<300000; i++)\n\t\t{\n\t\t\tout.printf(\"%d %d\\n\", i, i+1);\n\t\t}\n\t}\n\t\n\tpublic void test()\n\t{\n\t\tn = readInt();\n\t\tint[] pars = readIntArray(2*n-2);\n\t\t\n\t\tint i,j;\n\t\t\n\t\tadj_count = new int[n];\t\t\n\t\tadj_list = new int[n][];\n\t\t\n\t\tch_count = new int[n];\n\t\tch_list = new int[n][];\n\t\t\n\t\tArrays.fill(adj_count, 0);\n\t\tfor (i=0; i<n-1; i++)\n\t\t{\n\t\t\tadj_count[pars[2*i]-1] ++;\n\t\t\tadj_count[pars[2*i + 1]-1] ++;\n\t\t}\n\t\t\n\t\tfor (i=0; i<n; i++)\n\t\t{\n\t\t\tadj_list[i] = new int[adj_count[i]];\n\t\t\tch_list[i] = new int[adj_count[i]];\n\t\t\tadj_count[i] = 0;\n\t\t}\n\t\t\n\t\t\n\t\tfor (i=0; i<n-1; i++)\n\t\t{\n\t\t\tint a = pars[2*i]-1;\n\t\t\tint b = pars[2*i+1]-1;\n\t\t\t\n\t\t\tadj_list[a][adj_count[a] ++] = b;\n\t\t\tadj_list[b][adj_count[b] ++] = a;\n\t\t}\n\t\t\n\t\tX = new long[n];\n\t\tY = new long[n];\n\t\tZ = new long[n];\n\t\t\n\t\tV = new boolean[n];\n\t\tArrays.fill(V, false);\n\t\t\n\t\tint[] Q = new int[n];\t\t\n\t\tQ[0] = 0;\n\t\tint p,q_tail = 1;\n\t\t\n\t\tfor (j=0; j<n; j++)\n\t\t{\n\t\t\tp = Q[j];\n\t\t\tV[p] = true;\n\t\t\t\n\t\t\tch_count[p] = 0;\n\t\t\tfor (i=0; i<adj_count[p]; i++)\n\t\t\t{\n\t\t\t\tif (!V[adj_list[p][i]])\n\t\t\t\t{\n\t\t\t\t\tch_list[p][ ch_count[p] ++] = adj_list[p][i];\n\t\t\t\t\tQ[q_tail ++] = adj_list[p][i];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tlong pz, pxz;\n\t\t\t\n\t\tfor (j=n-1; j>=0; j--)\n\t\t{\n\t\t\tp = Q[j];\n\t\t\t\n\t\t\tpz = 1;\n\t\t\tpxz = 1;\n\t\t\t\n\t\t\tfor (i=0; i<ch_count[p]; i++)\n\t\t\t{\n\t\t\t\tpz = (pz * Z[ch_list[p][i]]) % M;\n\t\t\t\tpxz = (pxz * (X[ch_list[p][i]] + Z[ch_list[p][i]])) % M;\n\t\t\t}\n\t\t\t\n\t\t\tY[p] = pxz;\n\t\t\tX[p] = 0;\n\t\t\tfor (i=0; i<ch_count[p]; i++)\n\t\t\t{\n\t\t\t\tX[p] = ( X[p] + ( Y[ch_list[p][i]] * modInverse( Z[ch_list[p][i]] + X[ch_list[p][i]] % M , M) ) % M ) % M;\n\t\t\t}\n\t\t\tX[p] = (X[p] * pxz) % M;\n\t\t\tZ[p] = (X[p] + pz) % M;\n\t\t\t\n\t\t\tlogWrite(\"%d:\\tX=%d\\tY=%d\\tZ=%d\\n\", p,X[p],Y[p],Z[p]);\n\t\t}\n\t\t\n\t\tout.println(Z[0]);\n\t}\n\t\n\tpublic void dfs(int p)\n\t{\n\t\tV[p] = true;\n\t\t\n\t\tint[] childs = new int[adj_count[p]];\n\t\tint i, ch_count = 0;\n\t\tfor (i=0; i<adj_count[p]; i++)\n\t\t{\n\t\t\tif (!V[adj_list[p][i]])\n\t\t\t{\n\t\t\t\tchilds[ ch_count ++] = adj_list[p][i];\n\t\t\t\tdfs(adj_list[p][i]);\n\t\t\t}\n\t\t}\n\t\t\n\t\tlong pz = 1;\n\t\tlong pxz = 1;\n\t\t\n\t\tfor (i=0; i<ch_count; i++)\n\t\t{\n\t\t\tpz = (pz * Z[childs[i]]) % M;\n\t\t\tpxz = (pxz * (X[childs[i]] + Z[childs[i]])) % M;\n\t\t}\n\t\t\n\t\tY[p] = pxz;\n\t\tX[p] = 0;\n\t\tfor (i=0; i<ch_count; i++)\n\t\t{\n\t\t\tX[p] = ( X[p] + ( Y[childs[i]] * modInverse( Z[childs[i]] + X[childs[i]] % M , M) ) % M ) % M;\n\t\t}\n\t\tX[p] = (X[p] * pxz) % M;\n\t\tZ[p] = (X[p] + pz) % M;\n\t\t\n\t\tlogWrite(\"%d:\\tX=%d\\tY=%d\\tZ=%d\\n\", p,X[p],Y[p],Z[p]);\n\t}\n\t\n \n\tpublic void run()\n\t{\n\t\ttry\n\t\t{\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = System.out;\n\t\t\t\n\t\t\t//in = new BufferedReader(new FileReader(\"in.txt\"));\n\t\t\t//out = new PrintStream(new File(\"out.txt\"));\n\t\t\t\n\t\t\t\n\t\t}\n\t\tcatch (Exception e)\n\t\t{\n\t\t\treturn;\n\t\t}\n\t\t\n\t\t//while (true)\n\t\t{\n\t\t\t//int t = readInt(); for (int i=0; i<t; i++)\t\t\t\t\t\n\t\t\t{\n\t\t\t\ttest();\n\t\t\t}\n\t\t}\n\t}\n\t\n\tpublic static void main(String args[])\n\t{\n\t\tnew Main().run();\n\t}\n\t\n\tprivate StringTokenizer tokenizer = null;\n\t\n\tpublic int readInt() \n\t{\n return Integer.parseInt(readToken());\n }\n \n public long readLong() \n\t{\n return Long.parseLong(readToken());\n }\n \n public double readDouble() \n\t{\n return Double.parseDouble(readToken());\n }\n \n\tpublic String readLn()\n\t{\t\n\t\ttry\n\t\t{\n\t\t\tString s;\n\t\t\twhile ((s = in.readLine()).length()==0);\n\t\t\treturn s;\n\t\t}\n\t\tcatch (Exception e)\n\t\t{\n\t\t\treturn \"\";\n\t\t}\n\t}\n\t\n public String readToken() \n\t{\n\t\ttry\n\t\t{\n\t\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) \n\t\t\t{\n\t\t\t\ttokenizer = new StringTokenizer(in.readLine());\n\t\t\t}\n\t\t\treturn tokenizer.nextToken();\n\t\t}\n\t\tcatch (Exception e)\n\t\t{\n\t\t\treturn \"\";\n\t\t}\n }\n\t\n\tpublic int[] readIntArray(int n)\n\t{\n\t\tint[] x = new int[n];\n\t\treadIntArray(x, n);\n\t\treturn x;\n\t}\n\t\n\tpublic void readIntArray(int[] x, int n)\n\t{\n\t\tfor (int i=0; i<n; i++)\n\t\t{\n\t\t\tx[i] = readInt();\n\t\t}\n\t}\n\t\n\tpublic void logWrite(String format, Object... args)\n\t{\n\t\tif (!log_enabled)\n\t\t{\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tout.printf(format, args);\n\t}\n}\n\n", "lang_cluster": "Java", "tags": ["dp", "trees"], "code_uid": "5b7988b3efee1dd88bf44edcbb1e9b59", "src_uid": "a40e78a7144ac2fae1890ac7598990bf", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.lang.*;\nimport java.math.*;\nimport java.util.*;\nimport java.io.*;\npublic class Main {\n void solve() {\n int n=ni();\n g=new ArrayList[n+1];\n for(int i=1;i<=n;i++) g[i]=new ArrayList<>();\n for(int i=1;i<n;i++){\n int u=ni(),v=ni();\n g[u].add(v); g[v].add(u);\n }\n dp=new long[n+1][2][2];\n dfs(1,-1);\n pw.println(dp[1][1][1]);\n\n }\n ArrayList<Integer> g[];\n long dp[][][];\n void dfs(int v,int pr){\n int child=0;\n for(int u : g[v]){\n if(u!=pr) {\n dfs(u,v);\n child++;\n }\n }\n if(child==0){\n dp[v][0][0]=dp[v][1][1]=1;\n return;\n }\n long sm=1,sm2=1;\n for(int u : g[v]){\n if(u!=pr) {\n sm = mul(sm, add(dp[u][0][1], dp[u][1][1]));\n sm2=mul(sm2,dp[u][1][1]);\n }\n }\n dp[v][0][0]=sm;\n for(int u : g[v]){\n if(u!=pr){\n dp[v][0][1]=add(dp[v][0][1],mul(dp[u][0][0],mul(sm,modInverse(dp[u][0][1]+dp[u][1][1],M))));\n dp[v][1][1]=add(dp[v][1][1],mul(dp[u][0][0],mul(sm,modInverse(dp[u][0][1]+dp[u][1][1],M))));\n\n\n\n }\n }\n dp[v][1][1]=add(dp[v][1][1],sm2);\n\n\n\n }\n long sub(long a,long b){\n if(a>=M)a%=M; if(b>=M)b%=M;\n a-=b;\n if(a<0) a+=M;\n return a;\n }\n long mul(long a,long b){\n a*=b;\n if(a>=M) a%=M;\n return a;\n }\n long add(long a,long b){\n if(a>=M)a%=M; if(b>=M)b%=M;\n a+=b;\n if(a>=M) a-=M;\n return a;\n }\n long modpow(long a, long b,long M)\n {\n long r=1;\n while(b>0)\n {\n if((b&1)>0) r=mul(r,a);\n a=mul(a,a);\n b>>=1;\n }\n return r;\n }\n\n long modInverse(long A, long M)\n {\n\n return modpow(A,M-2,M);\n }\n\n long M = 998244353;\n InputStream is;\n PrintWriter pw;\n String INPUT = \"\";\n\n void run() throws Exception {\n is = is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n pw = new PrintWriter(System.out);\n\n Thread t = new Thread(null, null, \"~\", Runtime.getRuntime().maxMemory()){\n @Override\n public void run() {\n long s = System.currentTimeMillis();\n solve();\n\n pw.flush();\n if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+\"ms\");\n }\n };\n t.start();\n t.join();\n }\n\n public static void main(String[] args) throws Exception {\n new Main().run();\n }\n\n private byte[] inbuf = new byte[1024];\n public int lenbuf = 0, ptrbuf = 0;\n\n private int readByte() {\n if (lenbuf == -1) throw new InputMismatchException();\n if (ptrbuf >= lenbuf) {\n ptrbuf = 0;\n try {\n lenbuf = is.read(inbuf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (lenbuf <= 0) return -1;\n }\n return inbuf[ptrbuf++];\n }\n\n private boolean isSpaceChar(int c) {\n return !(c >= 33 && c <= 126);\n }\n\n private int skip() {\n int b;\n while ((b = readByte()) != -1 && isSpaceChar(b)) ;\n return b;\n }\n\n private double nd() {\n return Double.parseDouble(ns());\n }\n\n private char nc() {\n return (char) skip();\n }\n\n private String ns() {\n int b = skip();\n StringBuilder sb = new StringBuilder();\n while (!(isSpaceChar(b))) { // when nextLine, (isSpaceChar(b) && b != ' ')\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n private char[] ns(int n) {\n char[] buf = new char[n];\n int b = skip(), p = 0;\n while (p < n && !(isSpaceChar(b))) {\n buf[p++] = (char) b;\n b = readByte();\n }\n return n == p ? buf : Arrays.copyOf(buf, p);\n }\n\n private char[][] nm(int n, int m) {\n char[][] map = new char[n][];\n for (int i = 0; i < n; i++) map[i] = ns(m);\n return map;\n }\n\n private int[] na(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) a[i] = ni();\n return a;\n }\n\n private int ni() {\n int num = 0, b;\n boolean minus = false;\n while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')) ;\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n\n while (true) {\n if (b >= '0' && b <= '9') {\n num = num * 10 + (b - '0');\n } else {\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n private long nl() {\n long num = 0;\n int b;\n boolean minus = false;\n while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')) ;\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n\n while (true) {\n if (b >= '0' && b <= '9') {\n num = num * 10 + (b - '0');\n } else {\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n private boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\n private void tr(Object... o) {\n if (INPUT.length() > 0) System.out.println(Arrays.deepToString(o));\n }\n\n}", "lang_cluster": "Java", "tags": ["dp", "trees"], "code_uid": "4552f613ce9a6b1f499f2bbeb281b1b9", "src_uid": "a40e78a7144ac2fae1890ac7598990bf", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\r\nimport java.util.*;\r\n \r\npublic class I {\r\n \r\n public static boolean DEBUG = true;\r\n public static String name = \"I\";\r\n \r\n public static void main(String[] args) throws IOException {\r\n \tFastScanner scan;\r\n \tPrintWriter out;\r\n \tif (DEBUG) {\r\n \t\tscan = new FastScanner(System.in);\r\n \tout = new PrintWriter(System.out);\r\n \t}\r\n \telse {\r\n \tscan = new FastScanner(name + \".in\");\r\n \tout = new PrintWriter(new BufferedWriter(new FileWriter(name + \".out\")));\r\n \t}\r\n \r\n\t\tfloat N = Float.parseFloat(scan.nextString());\r\n\t\tfloat P = Float.parseFloat(scan.nextString());\r\n \r\n for(int i=0; i<=N; i+=1) {\r\n \r\n double val = i*(i-1)*(i-2)/6 + i*(i-1)*(N-i)/2 + i*(N-i)*(N-i-1)/4;\r\n val = val / (N*(N-1)*(N-2)/6);\r\n \r\n if(val >= P) {\r\n out.println((int)i);\r\n break;\r\n }\r\n }\r\n \r\n \r\n out.close();\r\n }\r\n \r\n static class BIT {\r\n public int[] tree;\r\n \r\n public BIT(int len) {\r\n tree = new int[len+5];\r\n }\r\n \r\n // updates tree by adding val to index\r\n public void update(int index, int val) {\r\n index++;\r\n while(index < tree.length) {\r\n tree[index] ^= val;\r\n index += index & -index;\r\n }\r\n }\r\n \r\n public int query(int index) {\r\n int result = 0;\r\n index++;\r\n while(index > 0) {\r\n result ^= tree[index];\r\n index -= index & -index;\r\n }\r\n \r\n return result;\r\n }\r\n \r\n public int rangeSum(int low, int high) {\r\n return query(high) - query(low-1); \r\n }\r\n \r\n }\r\n \r\n /* BINARY LIFTING - Preprocess O(NlogN) - Query O(logN)*/\r\n static ArrayList<Integer>[] adjList;\r\n static int[] tin, tout;\r\n static int[][] BL;\r\n static int ct;\r\n \r\n public static void preprocess(int root) {\r\n ct = 0;\r\n tin = new int[adjList.length];\r\n tout = new int[adjList.length];\r\n BL = new int[adjList.length][log2(adjList.length)+1];\r\n \r\n recur_bl(root,root);\r\n }\r\n \r\n public static void recur_bl(int v, int p) {\r\n tin[v] = ++ct;\r\n BL[v][0] = p;\r\n for (int i=1; i <= log2(adjList.length); ++i) BL[v][i] = BL[BL[v][i-1]][i-1];\r\n \r\n for (int i=0; i<adjList[v].size(); i++) if(adjList[v].get(i) != p) recur_bl(adjList[v].get(i), v);\r\n \r\n tout[v] = ++ct;\r\n }\r\n \r\n public static boolean is_ancestor(int u, int v) {\r\n return tin[u] <= tin[v] && tout[u] >= tout[v];\r\n }\r\n \r\n public static int lca(int u, int v) {\r\n if(is_ancestor(u, v)) return u;\r\n if(is_ancestor(v, u)) return v;\r\n \r\n for(int i=log2(adjList.length); i >= 0; --i) if(!is_ancestor(BL[u][i], v)) u = BL[u][i];\r\n \r\n return BL[u][0];\r\n }\r\n \r\n public static int log2(int n) {\r\n return (int)Math.ceil(Math.log10(n)/Math.log10(2));\r\n }\r\n \r\n static class FastScanner {\r\n\t\t \r\n\t\t// Is your Fast I/O being bad?\r\n \r\n\t\tInputStream dis;\r\n\t\tbyte[] buffer = new byte[1 << 17];\r\n\t\tint pointer = 0;\r\n \r\n\t\tpublic FastScanner (String fileName) throws IOException {\r\n\t\t\tdis = new FileInputStream(fileName);\r\n\t\t}\r\n \r\n\t\tpublic FastScanner (InputStream is) throws IOException {\r\n\t\t\tdis = is;\r\n\t\t}\r\n \r\n\t\tint nextInt() throws IOException {\r\n\t\t\tint ret = 0;\r\n \r\n\t\t\tbyte b;\r\n\t\t\tdo {\r\n\t\t\t\tb = nextByte();\r\n\t\t\t} while (b <= ' ');\r\n\t\t\tboolean negative = false;\r\n\t\t\tif (b == '-') {\r\n\t\t\t\tnegative = true;\r\n\t\t\t\tb = nextByte();\r\n\t\t\t}\r\n\t\t\twhile (b >= '0' && b <= '9') {\r\n\t\t\t\tret = 10 * ret + b - '0';\r\n\t\t\t\tb = nextByte();\r\n\t\t\t}\r\n \r\n\t\t\treturn (negative) ? -ret : ret;\r\n\t\t}\r\n \r\n\t\tlong nextLong() throws IOException {\r\n\t\t\tlong ret = 0;\r\n \r\n\t\t\tbyte b;\r\n\t\t\tdo {\r\n\t\t\t\tb = nextByte();\r\n\t\t\t} while (b <= ' ');\r\n\t\t\tboolean negative = false;\r\n\t\t\tif (b == '-') {\r\n\t\t\t\tnegative = true;\r\n\t\t\t\tb = nextByte();\r\n\t\t\t}\r\n\t\t\twhile (b >= '0' && b <= '9') {\r\n\t\t\t\tret = 10 * ret + b - '0';\r\n\t\t\t\tb = nextByte();\r\n\t\t\t}\r\n \r\n\t\t\treturn (negative) ? -ret : ret;\r\n\t\t}\r\n \r\n\t\tbyte nextByte() throws IOException {\r\n\t\t\tif (pointer == buffer.length) {\r\n\t\t\t\tdis.read(buffer, 0, buffer.length);\r\n\t\t\t\tpointer = 0;\r\n\t\t\t}\r\n\t\t\treturn buffer[pointer++];\r\n\t\t}\r\n \r\n\t\tString nextString() throws IOException {\r\n\t\t\tStringBuffer ret = new StringBuffer();\r\n \r\n\t\t\tbyte b;\r\n\t\t\tdo {\r\n\t\t\t\tb = nextByte();\r\n\t\t\t} while (b <= ' ');\r\n\t\t\twhile (b > ' ') {\r\n\t\t\t\tret.appendCodePoint(b);\r\n\t\t\t\tb = nextByte();\r\n\t\t\t}\r\n \r\n\t\t\treturn ret.toString();\r\n\t\t}\r\n \r\n\t}\r\n}", "lang_cluster": "Java", "tags": ["math", "probabilities", "binary search"], "code_uid": "9498ecfc15be70f5971bc08cdb8f04e0", "src_uid": "788ed59a964264bd0e755e155a37e14d", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\r\n import java.io.IOException;\r\n import java.io.InputStreamReader;\r\n import java.util.StringTokenizer;\r\n\r\npublic class bubblestrike {\r\n public static void main(String[] args) throws IOException {\r\n BufferedReader f = new BufferedReader(new InputStreamReader(System.in));\r\n StringTokenizer st = new StringTokenizer(f.readLine());\r\n int x = Integer.parseInt(st.nextToken());\r\n double prob = Double.parseDouble(st.nextToken());\r\n int pos = x;\r\n for (int a=x; a>0; a/=2){\r\n while (pos-a>=0&&check(pos-a,x-(pos-a),prob)){\r\n pos-=a;\r\n }\r\n }\r\n System.out.println(pos);\r\n\r\n }\r\n public static boolean check (int good, int bad, double proba){\r\n double g=good+0.0;\r\n double b=bad+0.0;\r\n double ans = (0.25*b*Math.max(0,b-1.0)*g+(g*(Math.max(0,g-1)*Math.max(0,g-2)/6.0)+b*0.5*(g)*Math.max(0,g-1)))/((g+b)*Math.max(0,g+b-1)*Math.max(0,g+b-2)/6.0);\r\n return ans >=proba;\r\n }\r\n}\r\n", "lang_cluster": "Java", "tags": ["math", "probabilities", "combinatorics"], "code_uid": "66a32aa406f038d7742f555ea2f9c3dd", "src_uid": "788ed59a964264bd0e755e155a37e14d", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\r\nimport java.io.*;\r\n\r\npublic class _1599_C {\r\n public static void main(String[] args) throws IOException {\r\n BufferedReader in = new BufferedReader(new InputStreamReader(System.in));\r\n PrintWriter out = new PrintWriter(System.out);\r\n StringTokenizer line = new StringTokenizer(in.readLine());\r\n int n = Integer.parseInt(line.nextToken());\r\n double p = Double.parseDouble(line.nextToken());\r\n int total = choose_three(n);\r\n for(int i = 0; i <= n; i++) {\r\n double prob = 0;\r\n double p1 = (double)i * choose_two(n - i) / total;\r\n double p2 = (double)choose_two(i) * (n - i) / total;\r\n double p3 = (double)choose_three(i) / total;\r\n prob = p1 / 2 + p2 + p3;\r\n if(prob >= p) {\r\n out.println(i);\r\n break;\r\n }\r\n }\r\n in.close();\r\n out.close();\r\n }\r\n static int choose_two(int n) {\r\n if(n < 2) return 0;\r\n return n * (n - 1) / 2;\r\n }\r\n static int choose_three(int n) {\r\n if(n < 3) return 0;\r\n return n * (n - 1) * (n - 2) / 6;\r\n }\r\n}\r\n", "lang_cluster": "Java", "tags": ["math", "probabilities", "combinatorics"], "code_uid": "5a7a28bff2115f7a83fadf23dbcbedba", "src_uid": "788ed59a964264bd0e755e155a37e14d", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\r\nimport java.util.ArrayList;\r\nimport java.util.Collections;\r\nimport java.util.StringTokenizer;\r\n\r\npublic class B {\r\n static BufferedReader r = new BufferedReader(new InputStreamReader(System.in));\r\n static PrintWriter pw = new PrintWriter(System.out);\r\n public static double func(double x, double n){\r\n\r\n return -n*(n*n-3*n-3*x*x+9*x-4)/(2*(x-2)*(x-1)*x);\r\n }\r\n public static void main(String[] args) throws IOException {\r\n StringTokenizer st = new StringTokenizer(r.readLine());\r\n ArrayList<Integer> nums = new ArrayList<>();\r\n int x = Integer.parseInt(st.nextToken());\r\n double p = Double.parseDouble(st.nextToken());\r\n int ans = 0;\r\n for(int i = 0; i<=x; i++){\r\n if(func(x,i) >= p){\r\n ans = i;\r\n break;\r\n }\r\n }\r\n pw.print(ans);\r\n pw.close(); // make sure to include this line -- closes io and flushes the output\r\n }\r\n}", "lang_cluster": "Java", "tags": ["math", "probabilities", "binary search"], "code_uid": "229bd870e21ec5a4b8a975a72ba83e31", "src_uid": "788ed59a964264bd0e755e155a37e14d", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\r\nimport java.io.*;\r\nimport java.util.*;\r\n\r\npublic final class Main {\r\n\r\n static PrintWriter out = new PrintWriter(System.out);\r\n static FastReader in = new FastReader();\r\n static Pair[] moves = new Pair[]{new Pair(-1, 0), new Pair(0, 1), new Pair(1, 0), new Pair(0, -1)};\r\n static int mod = (int) (1e9 + 7);\r\n static int mod2 = 998244353;\r\n\r\n public static void main(String[] args) {\r\n int tt = 1;\r\n while (tt-- > 0) {\r\n solve();\r\n }\r\n out.flush();\r\n }\r\n\r\n public static void solve() {\r\n int n = i();\r\n double p = d();\r\n\r\n int l = 0;\r\n int r = n - 1;\r\n while (l < r) {\r\n int m = (l + r) / 2;\r\n double x = cal(m, n);\r\n if (x >= p) {\r\n r = m;\r\n } else {\r\n l = m + 1;\r\n }\r\n }\r\n out.println(l);\r\n }\r\n\r\n private static double cal(int m, int n) {\r\n long ttl = comb(n, 3);\r\n double ans = 0d;\r\n ans += 1d * (comb(m, 3));\r\n ans += 1d * (comb(m, 2) * comb(n - m, 1));\r\n ans += 0.5 * (comb(m, 1) * comb(n - m, 2));\r\n return ans / ttl;\r\n }\r\n\r\n private static long comb(int n, int c) {\r\n if (c > n) {\r\n return 0;\r\n }\r\n if (c == n) {\r\n return 1;\r\n }\r\n long ans = 1L;\r\n for (int i = 0; i < c; i++) {\r\n ans *= (n - i);\r\n }\r\n for (int i = 1; i <= c; i++) {\r\n ans /= i;\r\n }\r\n return ans;\r\n }\r\n\r\n static long[] pre(int[] a) {\r\n long[] pre = new long[a.length + 1];\r\n pre[0] = 0;\r\n for (int i = 0; i < a.length; i++) {\r\n pre[i + 1] = pre[i] + a[i];\r\n }\r\n return pre;\r\n }\r\n\r\n static void print(char A[]) {\r\n for (char c : A) {\r\n out.print(c);\r\n }\r\n out.println();\r\n }\r\n\r\n static void print(boolean A[]) {\r\n for (boolean c : A) {\r\n out.print(c + \" \");\r\n }\r\n out.println();\r\n }\r\n\r\n static void print(int A[]) {\r\n for (int c : A) {\r\n out.print(c + \" \");\r\n }\r\n out.println();\r\n }\r\n\r\n static void print(long A[]) {\r\n for (long i : A) {\r\n out.print(i + \" \");\r\n }\r\n out.println();\r\n }\r\n\r\n static void print(List<Integer> A) {\r\n for (int a : A) {\r\n out.print(a + \" \");\r\n }\r\n }\r\n\r\n static int i() {\r\n return in.nextInt();\r\n }\r\n\r\n static long l() {\r\n return in.nextLong();\r\n }\r\n\r\n static double d() {\r\n return in.nextDouble();\r\n }\r\n\r\n static String s() {\r\n return in.nextLine();\r\n }\r\n\r\n static int[][] inputWithIdx(int N) {\r\n int A[][] = new int[N][2];\r\n for (int i = 0; i < N; i++) {\r\n A[i] = new int[]{i, in.nextInt()};\r\n }\r\n return A;\r\n }\r\n\r\n static int[] input(int N) {\r\n int A[] = new int[N];\r\n for (int i = 0; i < N; i++) {\r\n A[i] = in.nextInt();\r\n }\r\n return A;\r\n }\r\n\r\n static long[] inputLong(int N) {\r\n long A[] = new long[N];\r\n for (int i = 0; i < A.length; i++) {\r\n A[i] = in.nextLong();\r\n }\r\n return A;\r\n }\r\n\r\n static int GCD(int a, int b) {\r\n if (b == 0) {\r\n return a;\r\n } else {\r\n return GCD(b, a % b);\r\n }\r\n }\r\n\r\n static long GCD(long a, long b) {\r\n if (b == 0) {\r\n return a;\r\n } else {\r\n return GCD(b, a % b);\r\n }\r\n }\r\n\r\n static long LCM(int a, int b) {\r\n return (long) a / GCD(a, b) * b;\r\n }\r\n\r\n static long LCM(long a, long b) {\r\n return a / GCD(a, b) * b;\r\n }\r\n\r\n static void shuffleAndSort(int[] arr) {\r\n for (int i = 0; i < arr.length; i++) {\r\n int rand = (int) (Math.random() * arr.length);\r\n int temp = arr[rand];\r\n arr[rand] = arr[i];\r\n arr[i] = temp;\r\n }\r\n Arrays.sort(arr);\r\n }\r\n\r\n static void shuffleAndSort(int[][] arr, Comparator<? super int[]> comparator) {\r\n for (int i = 0; i < arr.length; i++) {\r\n int rand = (int) (Math.random() * arr.length);\r\n int[] temp = arr[rand];\r\n arr[rand] = arr[i];\r\n arr[i] = temp;\r\n }\r\n Arrays.sort(arr, comparator);\r\n }\r\n\r\n static void shuffleAndSort(long[] arr) {\r\n for (int i = 0; i < arr.length; i++) {\r\n int rand = (int) (Math.random() * arr.length);\r\n long temp = arr[rand];\r\n arr[rand] = arr[i];\r\n arr[i] = temp;\r\n }\r\n Arrays.sort(arr);\r\n }\r\n\r\n static boolean isPerfectSquare(double number) {\r\n double sqrt = Math.sqrt(number);\r\n return ((sqrt - Math.floor(sqrt)) == 0);\r\n }\r\n\r\n static void swap(int A[], int a, int b) {\r\n int t = A[a];\r\n A[a] = A[b];\r\n A[b] = t;\r\n }\r\n\r\n static long pow(long a, long b, int mod) {\r\n long pow = 1;\r\n long x = a;\r\n while (b != 0) {\r\n if ((b & 1) != 0) {\r\n pow = (pow * x) % mod;\r\n }\r\n x = (x * x) % mod;\r\n b /= 2;\r\n }\r\n return pow;\r\n }\r\n\r\n static long pow(long a, long b) {\r\n long pow = 1;\r\n long x = a;\r\n while (b != 0) {\r\n if ((b & 1) != 0) {\r\n pow *= x;\r\n }\r\n x = x * x;\r\n b /= 2;\r\n }\r\n return pow;\r\n }\r\n\r\n static long modInverse(long x, int mod) {\r\n return pow(x, mod - 2, mod);\r\n }\r\n\r\n static boolean isPrime(long N) {\r\n if (N <= 1) {\r\n return false;\r\n }\r\n if (N <= 3) {\r\n return true;\r\n }\r\n if (N % 2 == 0 || N % 3 == 0) {\r\n return false;\r\n }\r\n for (int i = 5; i * i <= N; i = i + 6) {\r\n if (N % i == 0 || N % (i + 2) == 0) {\r\n return false;\r\n }\r\n }\r\n return true;\r\n }\r\n\r\n public static String reverse(String str) {\r\n if (str == null) {\r\n return null;\r\n }\r\n return new StringBuilder(str).reverse().toString();\r\n }\r\n\r\n public static String repeat(char ch, int repeat) {\r\n if (repeat <= 0) {\r\n return \"\";\r\n }\r\n final char[] buf = new char[repeat];\r\n for (int i = repeat - 1; i >= 0; i--) {\r\n buf[i] = ch;\r\n }\r\n return new String(buf);\r\n }\r\n\r\n public static int[] manacher(String s) {\r\n char[] chars = s.toCharArray();\r\n int n = s.length();\r\n int[] d1 = new int[n];\r\n for (int i = 0, l = 0, r = -1; i < n; i++) {\r\n int k = (i > r) ? 1 : Math.min(d1[l + r - i], r - i + 1);\r\n while (0 <= i - k && i + k < n && chars[i - k] == chars[i + k]) {\r\n k++;\r\n }\r\n d1[i] = k--;\r\n if (i + k > r) {\r\n l = i - k;\r\n r = i + k;\r\n }\r\n }\r\n return d1;\r\n }\r\n\r\n public static int[] kmp(String s) {\r\n int n = s.length();\r\n int[] res = new int[n];\r\n for (int i = 1; i < n; ++i) {\r\n int j = res[i - 1];\r\n while (j > 0 && s.charAt(i) != s.charAt(j)) {\r\n j = res[j - 1];\r\n }\r\n if (s.charAt(i) == s.charAt(j)) {\r\n ++j;\r\n }\r\n res[i] = j;\r\n }\r\n return res;\r\n }\r\n}\r\n\r\nclass Pair {\r\n\r\n int i, j;\r\n\r\n Pair(int i, int j) {\r\n this.i = i;\r\n this.j = j;\r\n }\r\n\r\n @Override\r\n public boolean equals(Object o) {\r\n if (this == o) {\r\n return true;\r\n }\r\n if (o == null || getClass() != o.getClass()) {\r\n return false;\r\n }\r\n Pair pair = (Pair) o;\r\n return i == pair.i && j == pair.j;\r\n }\r\n\r\n @Override\r\n public int hashCode() {\r\n return Objects.hash(i, j);\r\n }\r\n}\r\n\r\nclass FastReader {\r\n\r\n BufferedReader br;\r\n StringTokenizer st;\r\n\r\n public FastReader() {\r\n br = new BufferedReader(new InputStreamReader(System.in));\r\n }\r\n\r\n String next() {\r\n while (st == null || !st.hasMoreElements()) {\r\n try {\r\n st = new StringTokenizer(br.readLine());\r\n } catch (IOException e) {\r\n e.printStackTrace();\r\n }\r\n }\r\n return st.nextToken();\r\n }\r\n\r\n int nextInt() {\r\n return Integer.parseInt(next());\r\n }\r\n\r\n long nextLong() {\r\n return Long.parseLong(next());\r\n }\r\n\r\n double nextDouble() {\r\n return Double.parseDouble(next());\r\n }\r\n\r\n String nextLine() {\r\n String str = \"\";\r\n try {\r\n str = br.readLine();\r\n } catch (IOException e) {\r\n e.printStackTrace();\r\n }\r\n return str;\r\n }\r\n}\r\n\r\nclass Node {\r\n\r\n int data, open, close;\r\n\r\n Node() {\r\n this(0, 0, 0);\r\n }\r\n\r\n Node(int data, int open, int close) {\r\n this.data = data;\r\n this.open = open;\r\n this.close = close;\r\n }\r\n}\r\n\r\nclass ST {\r\n\r\n int n;\r\n Node[] st;\r\n\r\n ST(int n) {\r\n this.n = n;\r\n st = new Node[4 * Integer.highestOneBit(n)];\r\n }\r\n\r\n void build(Node[] nodes) {\r\n build(0, 0, n - 1, nodes);\r\n }\r\n\r\n private void build(int id, int l, int r, Node[] nodes) {\r\n if (l == r) {\r\n st[id] = nodes[l];\r\n return;\r\n }\r\n int mid = (l + r) >> 1;\r\n build((id << 1) + 1, l, mid, nodes);\r\n build((id << 1) + 2, mid + 1, r, nodes);\r\n st[id] = comb(st[(id << 1) + 1], st[(id << 1) + 2]);\r\n }\r\n\r\n void update(int i, Node node) {\r\n update(0, 0, n - 1, i, node);\r\n }\r\n\r\n private void update(int id, int l, int r, int i, Node node) {\r\n if (i < l || r < i) {\r\n return;\r\n }\r\n if (l == r) {\r\n st[id] = node;\r\n return;\r\n }\r\n int mid = (l + r) >> 1;\r\n update((id << 1) + 1, l, mid, i, node);\r\n update((id << 1) + 2, mid + 1, r, i, node);\r\n st[id] = comb(st[(id << 1) + 1], st[(id << 1) + 2]);\r\n }\r\n\r\n Node get(int x, int y) {\r\n return get(0, 0, n - 1, x, y);\r\n }\r\n\r\n private Node get(int id, int l, int r, int x, int y) {\r\n if (x > r || y < l) {\r\n return new Node();\r\n }\r\n if (x <= l && r <= y) {\r\n return st[id];\r\n }\r\n int mid = (l + r) >> 1;\r\n return comb(get((id << 1) + 1, l, mid, x, y), get((id << 1) + 2, mid + 1, r, x, y));\r\n }\r\n\r\n Node comb(Node a, Node b) {\r\n if (a == null) {\r\n return b;\r\n }\r\n if (b == null) {\r\n return a;\r\n }\r\n int min = Math.min(a.open, b.close);\r\n return new Node(a.data + b.data + min * 2, a.open + b.open - min, a.close + b.close - min);\r\n }\r\n}", "lang_cluster": "Java", "tags": ["math", "probabilities", "combinatorics"], "code_uid": "79a92dd799c1b43fa364ae4bd95740d1", "src_uid": "788ed59a964264bd0e755e155a37e14d", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*; \nimport java.text.*; \nimport java.util.*; \nimport java.math.*;\npublic class C { \n public static void main(String[] args) throws Exception {\n new C().run();\n } \n public void run() throws Exception { \n FastScanner f = new FastScanner(); \n PrintWriter out = new PrintWriter(System.out); \n int n = f.nextInt();\n double d = f.nextDouble();\n for(int i = 0; i <= n; i++) {\n double prob = 1.5 * i * (n-i) * (n-i-1) / n / (n-1) / (n-2);\n prob += 3.0 * i * (i-1) * (n-i) / n / (n-1) / (n-2);\n prob += 1.0 * i * (i-1) * (i-2) / n / (n-1) / (n-2);\n if(prob + 1e-8 >= d) {\n out.println(i);\n break;\n }\n }\n///\n out.flush();\n\t}\n///\n\tstatic class FastScanner {\n\t\tpublic BufferedReader reader;\n\t\tpublic StringTokenizer tokenizer;\n\t\tpublic FastScanner() {\n\t\t\treader = new BufferedReader(new InputStreamReader(System.in), 32768);\n\t\t\ttokenizer = null;\n\t\t}\n\t\tpublic String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tokenizer.nextToken();\n\t\t}\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t\tpublic String nextLine() {\n\t\t\ttry {\n\t\t\t\treturn reader.readLine();\n\t\t\t} catch(IOException e) {\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "probabilities", "combinatorics"], "code_uid": "27a54feb877843698347bfe195e36c06", "src_uid": "788ed59a964264bd0e755e155a37e14d", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.Scanner;\r\n\r\npublic class I {\r\n public static void main(String[] args) {\r\n Scanner s = new Scanner(System.in);\r\n\r\n solve(s.nextInt(), (int)(Double.parseDouble(s.next()) * 10000));\r\n }\r\n\r\n\r\n public static void solve(long n, long p) {\r\n long studied = 0;\r\n long notStudied = n;\r\n\r\n long zero;\r\n long one;\r\n long two;\r\n long three;\r\n\r\n long thisP;\r\n\r\n while (true) {\r\n zero = notStudied * (notStudied - 1) * (notStudied - 2) / 6;\r\n one = studied * notStudied * (notStudied - 1) / 2;\r\n two = studied * (studied - 1) * notStudied / 2;\r\n three = studied * (studied - 1) * (studied - 2) / 6;\r\n\r\n thisP = zero * 0 + one * 1 + two * 2 + three * 2;\r\n if (thisP * 5000 >= p * n * (n - 1) * (n - 2) / 6) {\r\n System.out.println(studied);\r\n return;\r\n }\r\n\r\n studied++;\r\n notStudied--;\r\n }\r\n }\r\n}", "lang_cluster": "Java", "tags": ["math", "probabilities", "binary search"], "code_uid": "1eb25136d58a29814bb2280b586d7344", "src_uid": "788ed59a964264bd0e755e155a37e14d", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.BufferedReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author lewin\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader2 in = new InputReader2(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n CBubbleStrike solver = new CBubbleStrike();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class CBubbleStrike {\n double getProb(int x, int n) {\n return 3.0 / 2.0 * x / n * (n - x) / (n - 1) * (n - x - 1) / (n - 2) + 3.0 * x / n * (x - 1) / (n - 1) * (n - x) / (n - 2) + 1.0 * x / n * (x - 1) / (n - 1) * (x - 2) / (n - 2);\n }\n\n public void solve(int testNumber, InputReader2 in, OutputWriter out) {\n int n = in.nextInt();\n double p = in.nextDouble();\n int x = 0;\n while (getProb(x, n) < p) x++;\n out.println(x);\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void println(int i) {\n writer.println(i);\n }\n\n }\n\n static class InputReader2 {\n private BufferedReader in;\n private StringTokenizer st;\n\n public InputReader2(InputStream stream) {\n in = new BufferedReader(new InputStreamReader(stream));\n st = null;\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public String next() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(in.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "probabilities", "combinatorics"], "code_uid": "3f38fac694872bad35286f10d09438c9", "src_uid": "788ed59a964264bd0e755e155a37e14d", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.awt.*;\nimport java.io.*;\nimport java.math.BigDecimal;\nimport java.math.BigInteger;\nimport java.util.*;\nimport java.util.List;\n\nimport static java.lang.Math.max;\nimport static java.lang.Math.min;\n\n\npublic class B implements Runnable{\n\n private final static Random rnd = new Random();\n\n // SOLUTION!!!\n // HACK ME PLEASE IF YOU CAN!!!\n // PLEASE!!!\n // PLEASE!!!\n // PLEASE!!!\n\n final int MAX_SIZE = 2000 * 1000;\n\n void solve() {\n int n = readInt();\n\n int c0 = readInt();\n int c1 = readInt();\n\n if (c0 > c1) {\n int tmp = c0;\n c0 = c1;\n c1 = tmp;\n }\n\n long answer = getAnswer(n, c0, c1);\n out.println(answer);\n }\n\n long getAnswer(int n, long c0, long c1) {\n long c01 = c0 + c1;\n\n if (n == 2) {\n return c01;\n }\n\n long answer = c1;\n n -= 2;\n\n long x = (c0 == 0 ? Integer.MAX_VALUE : c1 / c0);\n x = Math.min(x, n);\n\n answer += x * c1 + (x + 1) * (x + 2) / 2 * c0;\n n -= x;\n\n NavigableMap<Long, Integer> costs = new TreeMap<>();\n\n// costs.put(c1, 1);\n for (int count = 0; count <= Math.min(MAX_SIZE, x); ++count) {\n inc(costs, count * c0 + c1, 1);\n }\n inc(costs, (x + 1) * c0, 1);\n\n while (n > 0) {\n Map.Entry<Long, Integer> minCostEntry = costs.pollFirstEntry();\n\n long cost = minCostEntry.getKey();\n int count = minCostEntry.getValue();\n count = Math.min(count, n);\n\n n -= count;\n answer += (cost + c01) * count;\n\n inc(costs, cost + c0, count);\n inc(costs, cost + c1, count);\n }\n\n return answer;\n }\n\n void inc(NavigableMap<Long, Integer> counts, long cost, int count) {\n Integer curCount = counts.get(cost);\n if (curCount == null) {\n curCount = 0;\n }\n\n counts.put(cost, curCount + count);\n\n while (counts.size() > MAX_SIZE) {\n counts.pollLastEntry();\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private final static boolean FIRST_INPUT_STRING = false;\n private final static boolean MULTIPLE_TESTS = true;\n private final boolean ONLINE_JUDGE = System.getProperty(\"ONLINE_JUDGE\") != null;\n\n private final static int MAX_STACK_SIZE = 128;\n\n private final static boolean OPTIMIZE_READ_NUMBERS = false;\n\n /////////////////////////////////////////////////////////////////////\n\n public void run(){\n try{\n timeInit();\n Locale.setDefault(Locale.US);\n\n init();\n\n if (ONLINE_JUDGE) {\n solve();\n } else {\n do {\n try {\n timeInit();\n solve();\n time();\n\n out.println();\n } catch (NumberFormatException e) {\n break;\n } catch (NullPointerException e) {\n if (FIRST_INPUT_STRING) break;\n else throw e;\n }\n } while (MULTIPLE_TESTS);\n }\n\n out.close();\n time();\n }catch (Exception e){\n e.printStackTrace(System.err);\n System.exit(-1);\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private BufferedReader in;\n private OutputWriter out;\n private StringTokenizer tok = new StringTokenizer(\"\");\n\n public static void main(String[] args){\n new Thread(null, new B(), \"\", MAX_STACK_SIZE * (1L << 20)).start();\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private void init() throws FileNotFoundException{\n Locale.setDefault(Locale.US);\n\n if (ONLINE_JUDGE){\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new OutputWriter(System.out);\n }else{\n in = new BufferedReader(new FileReader(\"input.txt\"));\n out = new OutputWriter(\"output.txt\");\n }\n }\n\n ////////////////////////////////////////////////////////////////\n\n private long timeBegin;\n\n private void timeInit() {\n this.timeBegin = System.currentTimeMillis();\n }\n\n private void time(){\n long timeEnd = System.currentTimeMillis();\n System.err.println(\"Time = \" + (timeEnd - timeBegin));\n }\n\n private void debug(Object... objects){\n if (ONLINE_JUDGE){\n for (Object o: objects){\n System.err.println(o.toString());\n }\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private String delim = \" \";\n\n private String readLine() {\n try {\n return in.readLine();\n } catch (IOException e) {\n throw new RuntimeIOException(e);\n }\n }\n\n private String readString() {\n try {\n while(!tok.hasMoreTokens()){\n tok = new StringTokenizer(readLine());\n }\n\n return tok.nextToken(delim);\n } catch (NullPointerException e) {\n return null;\n }\n }\n\n /////////////////////////////////////////////////////////////////\n\n private final char NOT_A_SYMBOL = '\\0';\n\n private char readChar() {\n try {\n int intValue = in.read();\n\n if (intValue == -1){\n return NOT_A_SYMBOL;\n }\n\n return (char) intValue;\n } catch (IOException e) {\n throw new RuntimeIOException(e);\n }\n }\n\n private char[] readCharArray() {\n return readLine().toCharArray();\n }\n\n private char[][] readCharField(int rowsCount) {\n char[][] field = new char[rowsCount][];\n for (int row = 0; row < rowsCount; ++row) {\n field[row] = readCharArray();\n }\n\n return field;\n }\n\n /////////////////////////////////////////////////////////////////\n\n private long optimizedReadLong() {\n long result = 0;\n boolean started = false;\n while (true) {\n try {\n int j = in.read();\n if (-1 == j) {\n if (started) return result;\n throw new NumberFormatException();\n }\n\n if ('0' <= j && j <= '9') {\n result = result * 10 + j - '0';\n started = true;\n } else if (started) {\n return result;\n }\n } catch (IOException e) {\n throw new RuntimeIOException(e);\n }\n }\n }\n\n private int readInt() {\n\n if (!OPTIMIZE_READ_NUMBERS) {\n return Integer.parseInt(readString());\n } else {\n return (int) optimizedReadLong();\n }\n }\n\n private int[] readIntArray(int size) {\n int[] array = new int[size];\n\n for (int index = 0; index < size; ++index){\n array[index] = readInt();\n }\n\n return array;\n }\n\n private int[] readSortedIntArray(int size) {\n Integer[] array = new Integer[size];\n\n for (int index = 0; index < size; ++index) {\n array[index] = readInt();\n }\n Arrays.sort(array);\n\n int[] sortedArray = new int[size];\n for (int index = 0; index < size; ++index) {\n sortedArray[index] = array[index];\n }\n\n return sortedArray;\n }\n\n private int[] readIntArrayWithDecrease(int size) {\n int[] array = readIntArray(size);\n\n for (int i = 0; i < size; ++i) {\n array[i]--;\n }\n\n return array;\n }\n\n ///////////////////////////////////////////////////////////////////\n\n private int[][] readIntMatrix(int rowsCount, int columnsCount) {\n int[][] matrix = new int[rowsCount][];\n\n for (int rowIndex = 0; rowIndex < rowsCount; ++rowIndex) {\n matrix[rowIndex] = readIntArray(columnsCount);\n }\n\n return matrix;\n }\n\n private int[][] readIntMatrixWithDecrease(int rowsCount, int columnsCount) {\n int[][] matrix = new int[rowsCount][];\n\n for (int rowIndex = 0; rowIndex < rowsCount; ++rowIndex) {\n matrix[rowIndex] = readIntArrayWithDecrease(columnsCount);\n }\n\n return matrix;\n }\n\n ///////////////////////////////////////////////////////////////////\n\n private long readLong() {\n if (!OPTIMIZE_READ_NUMBERS) {\n return Long.parseLong(readString());\n } else {\n return optimizedReadLong();\n }\n }\n\n private long[] readLongArray(int size) {\n long[] array = new long[size];\n\n for (int index = 0; index < size; ++index){\n array[index] = readLong();\n }\n\n return array;\n }\n\n ////////////////////////////////////////////////////////////////////\n\n private double readDouble() {\n return Double.parseDouble(readString());\n }\n\n private double[] readDoubleArray(int size) {\n double[] array = new double[size];\n\n for (int index = 0; index < size; ++index){\n array[index] = readDouble();\n }\n\n return array;\n }\n\n ////////////////////////////////////////////////////////////////////\n\n private BigInteger readBigInteger() {\n return new BigInteger(readString());\n }\n\n private BigDecimal readBigDecimal() {\n return new BigDecimal(readString());\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private Point readPoint() {\n int x = readInt();\n int y = readInt();\n return new Point(x, y);\n }\n\n private Point[] readPointArray(int size) {\n Point[] array = new Point[size];\n\n for (int index = 0; index < size; ++index){\n array[index] = readPoint();\n }\n\n return array;\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private List<Integer>[] readGraph(int vertexNumber, int edgeNumber) {\n @SuppressWarnings(\"unchecked\")\n List<Integer>[] graph = new List[vertexNumber];\n\n for (int index = 0; index < vertexNumber; ++index){\n graph[index] = new ArrayList<Integer>();\n }\n\n while (edgeNumber-- > 0){\n int from = readInt() - 1;\n int to = readInt() - 1;\n\n graph[from].add(to);\n graph[to].add(from);\n }\n\n return graph;\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static class IntIndexPair {\n\n static Comparator<IntIndexPair> increaseComparator = new Comparator<B.IntIndexPair>() {\n\n @Override\n public int compare(B.IntIndexPair indexPair1, B.IntIndexPair indexPair2) {\n int value1 = indexPair1.value;\n int value2 = indexPair2.value;\n\n if (value1 != value2) return value1 - value2;\n\n int index1 = indexPair1.index;\n int index2 = indexPair2.index;\n\n return index1 - index2;\n }\n };\n\n static Comparator<IntIndexPair> decreaseComparator = new Comparator<B.IntIndexPair>() {\n\n @Override\n public int compare(B.IntIndexPair indexPair1, B.IntIndexPair indexPair2) {\n int value1 = indexPair1.value;\n int value2 = indexPair2.value;\n\n if (value1 != value2) return -(value1 - value2);\n\n int index1 = indexPair1.index;\n int index2 = indexPair2.index;\n\n return index1 - index2;\n }\n };\n\n int value, index;\n\n IntIndexPair(int value, int index) {\n super();\n this.value = value;\n this.index = index;\n }\n\n int getRealIndex() {\n return index + 1;\n }\n }\n\n private IntIndexPair[] readIntIndexArray(int size) {\n IntIndexPair[] array = new IntIndexPair[size];\n\n for (int index = 0; index < size; ++index) {\n array[index] = new IntIndexPair(readInt(), index);\n }\n\n return array;\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static class OutputWriter extends PrintWriter {\n\n final int DEFAULT_PRECISION = 12;\n\n private int precision;\n private String format, formatWithSpace;\n\n {\n precision = DEFAULT_PRECISION;\n\n format = createFormat(precision);\n formatWithSpace = format + \" \";\n }\n\n OutputWriter(OutputStream out) {\n super(out);\n }\n\n OutputWriter(String fileName) throws FileNotFoundException {\n super(fileName);\n }\n\n int getPrecision() {\n return precision;\n }\n\n void setPrecision(int precision) {\n precision = max(0, precision);\n this.precision = precision;\n\n format = createFormat(precision);\n formatWithSpace = format + \" \";\n }\n\n String createFormat(int precision){\n return \"%.\" + precision + \"f\";\n }\n\n @Override\n public void print(double d){\n printf(format, d);\n }\n\n void printWithSpace(double d){\n printf(formatWithSpace, d);\n }\n\n void printAll(double...d){\n for (int i = 0; i < d.length - 1; ++i){\n printWithSpace(d[i]);\n }\n\n print(d[d.length - 1]);\n }\n\n @Override\n public void println(double d){\n printlnAll(d);\n }\n\n void printlnAll(double... d){\n printAll(d);\n println();\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static class RuntimeIOException extends RuntimeException {\n\n /**\n *\n */\n private static final long serialVersionUID = -6463830523020118289L;\n\n RuntimeIOException(Throwable cause) {\n super(cause);\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n //////////////// Some useful constants and functions ////////////////\n /////////////////////////////////////////////////////////////////////\n\n private static final int[][] steps = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};\n private static final int[][] steps8 = {\n {-1, 0}, {1, 0}, {0, -1}, {0, 1},\n {-1, -1}, {1, 1}, {1, -1}, {-1, 1}\n };\n\n private static boolean checkCell(int row, int rowsCount, int column, int columnsCount) {\n return checkIndex(row, rowsCount) && checkIndex(column, columnsCount);\n }\n\n private static boolean checkIndex(int index, int lim){\n return (0 <= index && index < lim);\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static boolean checkBit(int mask, int bit){\n return (mask & (1 << bit)) != 0;\n }\n private static boolean checkBit(long mask, int bit){\n return (mask & (1L << bit)) != 0;\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static long getSum(int[] array) {\n long sum = 0;\n for (int value: array) {\n sum += value;\n }\n\n return sum;\n }\n\n private static Point getMinMax(int[] array) {\n int min = array[0];\n int max = array[0];\n\n for (int index = 0, size = array.length; index < size; ++index, ++index) {\n int value = array[index];\n\n if (index == size - 1) {\n min = min(min, value);\n max = max(max, value);\n } else {\n int otherValue = array[index + 1];\n\n if (value <= otherValue) {\n min = min(min, value);\n max = max(max, otherValue);\n } else {\n min = min(min, otherValue);\n max = max(max, value);\n }\n }\n }\n\n return new Point(min, max);\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static int[] getPrimes(int n) {\n boolean[] used = new boolean[n];\n used[0] = used[1] = true;\n\n int size = 0;\n for (int i = 2; i < n; ++i) {\n if (!used[i]) {\n ++size;\n for (int j = 2 * i; j < n; j += i) {\n used[j] = true;\n }\n }\n }\n\n int[] primes = new int[size];\n for (int i = 0, cur = 0; i < n; ++i) {\n if (!used[i]) {\n primes[cur++] = i;\n }\n }\n\n return primes;\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static long lcm(long a, long b) {\n return a / gcd(a, b) * b;\n }\n\n private static long gcd(long a, long b) {\n return (a == 0 ? b : gcd(b % a, a));\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static class IdMap<KeyType> extends HashMap<KeyType, Integer> {\n\n /**\n *\n */\n private static final long serialVersionUID = -3793737771950984481L;\n\n public IdMap() {\n super();\n }\n\n int getId(KeyType key) {\n Integer id = super.get(key);\n if (id == null) {\n super.put(key, id = size());\n }\n\n return id;\n }\n }\n}\n\n", "lang_cluster": "Java", "tags": ["greedy", "dp"], "code_uid": "32906e7dfe751df073f15ab6df7fda7c", "src_uid": "39b824b740a40f68bae39b8d9f0adcbe", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class G {\n\n\tstatic final int P = 1_000_000_007;\n\n\tvoid submit() {\n\t\tint n = nextInt();\n\t\tint m = nextInt();\n\t\tlong exp = nextLong();\n\t\tint[] a = new int[n];\n\t\tint[] b = new int[m];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta[i] = nextInt();\n\t\t}\n\t\tint maxCoef = 0;\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tb[i] = nextInt();\n\t\t\tmaxCoef = Math.max(maxCoef, b[i]);\n\t\t}\n\n\t\tint[] bPoly = new int[maxCoef + 1];\n\t\tbPoly[maxCoef] = 1;\n\t\tfor (int pow : b) {\n\t\t\tbPoly[maxCoef - pow]--;\n\t\t\tif (bPoly[maxCoef - pow] < 0) {\n\t\t\t\tbPoly[maxCoef - pow] += P;\n\t\t\t}\n\t\t}\n\t\t\n\t\tint[] aPoly = {};\n\t\tfor (int pow : a) {\n\t\t\taPoly = sum(aPoly, quotPow(new int[] { 0, 1 }, bPoly, pow));\n\t\t}\n\t\tint[] ans = quotPow(aPoly, bPoly, exp);\n\n\t\tans = prod(ans, quotPow(new int[] { 0, 1 }, bPoly, maxCoef));\n\t\tans = quot(ans, bPoly);\n\n\t\tout.println((long)ans[0] * inv(P - bPoly[0]) % P);\n\t}\n\t\n\tint inv(int x) {\n\t\treturn x == 1 ? 1 : P - (int)((long)(P / x) * inv(P % x) % P);\n\t}\n\n\tint[] quotPow(int[] a, int[] b, long n) {\n\t\ta = quot(a, b);\n\t\tint[] ret = { 1 };\n\t\tfor (; n > 0; n >>= 1) {\n\t\t\tif ((n & 1) == 1) {\n\t\t\t\tret = quot(prod(ret, a), b);\n\t\t\t}\n\t\t\ta = quot(prod(a, a), b);\n\t\t}\n\t\treturn ret;\n\t}\n\n\tint[] sum(int[] a, int[] b) {\n\t\tint[] c = Arrays.copyOf(a, Math.max(a.length, b.length));\n\t\tfor (int i = 0; i < b.length; i++) {\n\t\t\tc[i] += b[i];\n\t\t\tif (c[i] >= P) {\n\t\t\t\tc[i] -= P;\n\t\t\t}\n\t\t}\n\t\treturn c;\n\t}\n\n\tint[] prod(int[] a, int[] b) {\n\t\tint[] c = new int[a.length + b.length - 1];\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\tfor (int j = 0; j < b.length; j++) {\n\t\t\t\tc[i + j] += (int) ((long) a[i] * b[j] % P);\n\t\t\t\tif (c[i + j] >= P) {\n\t\t\t\t\tc[i + j] -= P;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn c;\n\t}\n\n\tint[] quot(int[] a, int[] b) {\n\t\ta = a.clone();\n\t\t// leading coef of b is 1\n\t\tif (a.length < b.length) {\n\t\t\treturn a;\n\t\t}\n\t\tint degB = b.length - 1;\n\t\tfor (int ptr = a.length - 1; ptr >= degB; ptr--) {\n\t\t\tlong coef = a[ptr];\n\t\t\tfor (int i = 0, j = ptr - degB; i < degB; i++, j++) {\n\t\t\t\ta[j] -= (int) (coef * b[i] % P);\n\t\t\t\tif (a[j] < 0) {\n\t\t\t\t\ta[j] += P;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn Arrays.copyOf(a, degB);\n\t}\n\n\tvoid preCalc() {\n\n\t}\n\n\tvoid stress() {\n\n\t}\n\n\tvoid test() {\n\n\t}\n\n\tG() throws IOException {\n\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\tpreCalc();\n\t\tsubmit();\n\t\t// stress();\n\t\t// test();\n\t\tout.close();\n\t}\n\n\tstatic final Random rng = new Random();\n\n\tstatic int rand(int l, int r) {\n\t\treturn l + rng.nextInt(r - l + 1);\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew G();\n\t}\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\n\tString nextToken() {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tString nextString() {\n\t\ttry {\n\t\t\treturn br.readLine();\n\t\t} catch (IOException e) {\n\t\t\tthrow new RuntimeException(e);\n\t\t}\n\t}\n\n\tint nextInt() {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "matrices", "combinatorics"], "code_uid": "568050d3909785e5cd5457f117a4fda0", "src_uid": "c3a4c109080f49b88be5fb13157d1af0", "difficulty": 3300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\n import java.io.*;\nimport java.util.*;\n\npublic class MethodTest {\n\n\tstatic final int P = 1_000_000_007;\n\n\tstatic void submit() {\n\t\tint n = nextInt();\n\t\tint m = nextInt();\n\t\tlong exp = nextLong();\n\t\tint[] a = new int[n];\n\t\tint[] b = new int[m];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta[i] = nextInt();\n\t\t}\n\t\tint maxCoef = 0;\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tb[i] = nextInt();\n\t\t\tmaxCoef = Math.max(maxCoef, b[i]);\n\t\t}\n\n\t\tint[] bPoly = new int[maxCoef + 1];\n\t\tbPoly[maxCoef] = 1;\n\t\tfor (int pow : b) {\n\t\t\tbPoly[maxCoef - pow]--;\n\t\t\tif (bPoly[maxCoef - pow] < 0) {\n\t\t\t\tbPoly[maxCoef - pow] += P;\n\t\t\t}\n\t\t}\n\n\t\tint[] aPoly = {};\n\t\tfor (int pow : a) {\n\t\t\taPoly = sum(aPoly, quotPow(new int[] { 0, 1 }, bPoly, pow));\n\t\t}\n\t\tint[] ans = quotPow(aPoly, bPoly, exp);\n\n\t\tans = prod(ans, quotPow(new int[] { 0, 1 }, bPoly, maxCoef));\n\t\tans = quot(ans, bPoly);\n\n\t\tout.println((long)ans[0] * inv(P - bPoly[0]) % P);\n\t}\n\n\tstatic int inv(int x) {\n\t\treturn x == 1 ? 1 : P - (int)((long)(P / x) * inv(P % x) % P);\n\t}\n\n\tstatic int[] quotPow(int[] a, int[] b, long n) {\n\t\ta = quot(a, b);\n\t\tint[] ret = { 1 };\n\t\tfor (; n > 0; n >>= 1) {\n\t\t\tif ((n & 1) == 1) {\n\t\t\t\tret = quot(prod(ret, a), b);\n\t\t\t}\n\t\t\ta = quot(prod(a, a), b);\n\t\t}\n\t\treturn ret;\n\t}\n\n\tstatic int[] sum(int[] a, int[] b) {\n\t\tint[] c = Arrays.copyOf(a, Math.max(a.length, b.length));\n\t\tfor (int i = 0; i < b.length; i++) {\n\t\t\tc[i] += b[i];\n\t\t\tif (c[i] >= P) {\n\t\t\t\tc[i] -= P;\n\t\t\t}\n\t\t}\n\t\treturn c;\n\t}\n\n\tstatic int[] prod(int[] a, int[] b) {\n\t\tint[] c = new int[a.length + b.length - 1];\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\tfor (int j = 0; j < b.length; j++) {\n\t\t\t\tc[i + j] += (int) ((long) a[i] * b[j] % P);\n\t\t\t\tif (c[i + j] >= P) {\n\t\t\t\t\tc[i + j] -= P;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn c;\n\t}\n\n\tstatic int[] quot(int[] a, int[] b) {\n\t\ta = a.clone();\n\t\t// leading coef of b is 1\n\t\tif (a.length < b.length) {\n\t\t\treturn a;\n\t\t}\n\t\tint degB = b.length - 1;\n\t\tfor (int ptr = a.length - 1; ptr >= degB; ptr--) {\n\t\t\tlong coef = a[ptr];\n\t\t\tfor (int i = 0, j = ptr - degB; i < degB; i++, j++) {\n\t\t\t\ta[j] -= (int) (coef * b[i] % P);\n\t\t\t\tif (a[j] < 0) {\n\t\t\t\t\ta[j] += P;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn Arrays.copyOf(a, degB);\n\t}\n\n\tstatic void preCalc() {\n\n\t}\n\n\tstatic void stress() {\n\n\t}\n\n\tstatic void test() {\n\n\t}\n\n\tpublic static void run() throws IOException {\n\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\tpreCalc();\n\t\tsubmit();\n\t\tout.close();\n\t}\n\n\tstatic final Random rng = new Random();\n\n\tstatic int rand(int l, int r) {\n\t\treturn l + rng.nextInt(r - l + 1);\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\trun();\n\t}\n\n\tstatic BufferedReader br;\n\tstatic PrintWriter out;\n\tstatic StringTokenizer st;\n\n\tstatic String nextToken() {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tstatic String nextString() {\n\t\ttry {\n\t\t\treturn br.readLine();\n\t\t} catch (IOException e) {\n\t\t\tthrow new RuntimeException(e);\n\t\t}\n\t}\n\n\tstatic int nextInt() {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tstatic long nextLong() {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tstatic double nextDouble() {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "matrices", "combinatorics"], "code_uid": "d6ab025d8d52935fba24e4dcf04345bf", "src_uid": "c3a4c109080f49b88be5fb13157d1af0", "difficulty": 3300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.math.*;\nimport java.security.KeyStore.Entry;\nimport java.util.*;\n\npublic class CODEFORCES {\n\tprivate InputStream is;\n\tprivate PrintWriter out;\n\n\tvoid solve() {\n\t\tint a = ni(), b = ni(), l = ni(), r = ni();\n\t\tString fin = new String();\n\t\tfor (int i = 0; i < a; i++)\n\t\t\tfin = fin + (char) ('a' + i);\n\t\tfor (int i = 0; i < b; i++)\n\t\t\tfin = fin + (char) ('a' + a - 1);\n\t\tint x = l % (a + b);\n\t\tif (x == 0)\n\t\t\tx = a + b;\n\t\tfin = fin.substring(x - 1);\n\t\tHashSet<Character> set = new HashSet<Character>();\n\t\tfor (int i = fin.length() - 1; i >= 0 && i >= fin.length() - a; i--)\n\t\t\tset.add(fin.charAt(i));\n\t\tint op = a;\n\t\tfor (int i = 0; i < 26 && op > 0; i++) {\n\t\t\tif (set.contains((char) ('a' + i)))\n\t\t\t\tcontinue;\n\t\t\tfin = fin + (char) ('a' + i);\n\t\t\top--;\n\t\t}\n\t\tchar ch = fin.charAt(fin.length() - 1);\n\t\tfor (int i = 0; i < b; i++)\n\t\t\tfin = fin + ch;\n\t\tset.clear();\n\t\tfor (int i = fin.length() - 1; i >= 0 && i >= fin.length() - a; i--)\n\t\t\tset.add(fin.charAt(i));\n\t\top = a;\n\t\tfor (int i = 0; i < 26 && op > 0; i++) {\n\t\t\tif (set.contains((char) ('a' + i)))\n\t\t\t\tcontinue;\n\t\t\tfin = fin + (char) ('a' + i);\n\t\t\top--;\n\t\t}\n\t\tch = fin.charAt(fin.length() - 1);\n\t\tfor (int i = 0; i < b; i++)\n\t\t\tfin = fin + ch;\n\t\tset.clear();\n\t\tfor (int i = 0; i <= r - l && i < fin.length(); i++)\n\t\t\tset.add(fin.charAt(i));\n\t\tout.println(set.size());\n\t}\n\n\tvoid soln() {\n\t\tis = System.in;\n\t\tout = new PrintWriter(System.out);\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis() - s + \"ms\");\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tnew CODEFORCES().soln();\n\t}\n\n\t// To Get Input\n\t// Some Buffer Methods\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\n\tprivate int readByte() {\n\t\tif (lenbuf == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (ptrbuf >= lenbuf) {\n\t\t\tptrbuf = 0;\n\t\t\ttry {\n\t\t\t\tlenbuf = is.read(inbuf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (lenbuf <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\n\tprivate boolean isSpaceChar(int c) {\n\t\treturn !(c >= 33 && c <= 126);\n\t}\n\n\tprivate int skip() {\n\t\tint b;\n\t\twhile ((b = readByte()) != -1 && isSpaceChar(b))\n\t\t\t;\n\t\treturn b;\n\t}\n\n\tprivate double nd() {\n\t\treturn Double.parseDouble(ns());\n\t}\n\n\tprivate char nc() {\n\t\treturn (char) skip();\n\t}\n\n\tprivate String ns() {\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile (!(isSpaceChar(b))) { // when nextLine, (isSpaceChar(b) && b != '\n\t\t\t\t\t\t\t\t\t// ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tprivate char[] ns(int n) {\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile (p < n && !(isSpaceChar(b))) {\n\t\t\tbuf[p++] = (char) b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\n\tprivate char[][] nm(int n, int m) {\n\t\tchar[][] map = new char[n][];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tmap[i] = ns(m);\n\t\treturn map;\n\t}\n\n\tprivate int[] na(int n) {\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = ni();\n\t\treturn a;\n\t}\n\n\tprivate int ni() {\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tprivate long nl() {\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\n\tprivate void tr(Object... o) {\n\t\tif (!oj)\n\t\t\tSystem.out.println(Arrays.deepToString(o));\n\t}\n}", "lang_cluster": "Java", "tags": ["greedy", "games"], "code_uid": "234e692b39b7989d22c674a0043f3c37", "src_uid": "d055b2a594ae7788ecafb3ef80f246ec", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class C421 {\n public static void main(String[] args) {\n InputReader in = new InputReader(System.in);\n OutputWriter out = new OutputWriter(System.out);\n int a = in.nextInt();\n int b = in.nextInt();\n int l = in.nextInt() - 1;\n int r = in.nextInt() - 1; \n int ans;\n int len = a + b;\n int dif = r - l;\n if(dif >= 2 * len) {\n ans = Integer.max(a + 1, 2 * a - b);\n } else {\n //shift to the left\n r -= len * (l / len);\n l %= len;\n //System.out.println(l + \" \" + r);\n ans = numOfDifLet(a, b, l, r);\n }\n\n System.out.println(ans);\n \n }\n \n static int numOfDifLet(int a, int b, int l, int r) {\n int first = b < a ? b : a - 1;\n int last = a - 1;\n \n // abcd dd abef ff\n // abcd cc abef ff abcd dd abef ff\n \n StringBuilder sb = new StringBuilder();\n char ch = 'a';\n for(int i = 0; i < a; ++i) {\n sb.append(ch);\n ch++;\n }\n ch = l < a ? sb.charAt(last) : sb.charAt(first);\n for(int i = 0; i < b; ++i) {\n sb.append(ch);\n }\n boolean[] used = new boolean[30];\n for(int i = 0; i < a; ++i) {\n used[sb.charAt(sb.length() - i - 1) - 'a'] = true;\n }\n int ptr = 0;\n for(int i = 0; i < a; ++i) {\n while(used[ptr]) ptr++;\n sb.append((char)('a' + ptr));\n used[ptr] = true;\n }\n ch = sb.charAt(Integer.min(b, a - 1) + a + b);\n for(int i = 0; i < b; ++i) {\n sb.append(ch);\n }\n for(int i = 0; i < a + b; ++i) {\n sb.append(sb.charAt(i));\n }\n return numOfDifLet(sb.toString(), l, r);\n }\n \n static int numOfDifLet(String s, int l, int r) {\n boolean[] used = new boolean[30];\n for(int i = l; i <= r; ++i) {\n used[s.charAt(i) - 'a'] = true;\n }\n int ans = 0;\n for(int i = 0; i < 30; ++i) {\n if(used[i]) ans++;\n }\n return ans;\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void print(Object... objects) {\n for (int i = 0; i < objects.length; i++) {\n if (i != 0) {\n writer.print(' ');\n }\n writer.print(objects[i]);\n }\n }\n\n public void println(Object... objects) {\n print(objects);\n writer.println();\n }\n\n public void printf(String format, Object... objects) {\n writer.printf(format, objects);\n }\n\n public void close() {\n writer.close();\n }\n\n public void flush() {\n writer.flush();\n }\n\n }\n \n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (this.numChars == -1) {\n throw new InputMismatchException();\n } else {\n if (this.curChar >= this.numChars) {\n this.curChar = 0;\n\n try {\n this.numChars = this.stream.read(this.buf);\n } catch (IOException var2) {\n throw new InputMismatchException();\n }\n\n if (this.numChars <= 0) {\n return -1;\n }\n }\n\n return this.buf[this.curChar++];\n }\n }\n\n public int nextInt() {\n int c;\n for (c = this.read(); isSpaceChar(c); c = this.read()) {\n ;\n }\n\n byte sgn = 1;\n if (c == 45) {\n sgn = -1;\n c = this.read();\n }\n\n int res = 0;\n\n while (c >= 48 && c <= 57) {\n res *= 10;\n res += c - 48;\n c = this.read();\n if (isSpaceChar(c)) {\n return res * sgn;\n }\n }\n\n throw new InputMismatchException();\n }\n\n public static boolean isSpaceChar(int c) {\n return c == 32 || c == 10 || c == 13 || c == 9 || c == -1;\n }\n\n }\n}\n", "lang_cluster": "Java", "tags": ["greedy", "games"], "code_uid": "4d8fceebbffb424ea0f750f545427d93", "src_uid": "d055b2a594ae7788ecafb3ef80f246ec", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class A819 {\n\tstatic int count(int[] cc, int l, int r) {\n\t\tboolean[] used = new boolean[24];\n\t\tint cnt = 0;\n\t\tfor (int i = l; i <= r; i++) {\n\t\t\tint c = cc[i];\n\t\t\tif (!used[c]) {\n\t\t\t\tused[c] = true;\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t\treturn cnt;\n\t}\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st = new StringTokenizer(br.readLine());\n\t\tint a = Integer.parseInt(st.nextToken());\n\t\tint b = Integer.parseInt(st.nextToken());\n\t\tint l = Integer.parseInt(st.nextToken()) - 1;\n\t\tint r = Integer.parseInt(st.nextToken()) - 1;\n\t\tint ab = a + b;\n\t\tint m = 4;\t//\tab ab ab ab\n\t\tint[] cc = new int[ab * m];\n\t\tint h = l / ab;\n\t\tl -= h * ab;\n\t\tr -= h * ab;\n\t\th = (r - l + 1) / ab;\n\t\tif (h > 2)\n\t\t\tr -= (h - 2) * ab;\n\t\tint d = a > b ? a - b : 1;\n\t\tfor (h = 0; h < m; h++) {\n\t\t\tfor (int k = 0; k < a - d; k++)\n\t\t\t\tcc[(a + b) * h + k] = k;\n\t\t\tfor (int k = 0; k < d; k++)\n\t\t\t\tcc[(a + b) * h + a - d + k] = h % 2 == 0 ? a - d + k : a + k;\n\t\t}\n\t\tint min = a + a;\n\t\tfor (int k0 = 1; k0 <= d; k0++) {\n\t\t\tfor (int k = 0; k < b; k++)\n\t\t\t\tcc[(a + b) * 0 + a + k] = cc[(a + b) * 0 + a - k0];\n\t\t\tfor (int k1 = 1; k1 <= d; k1++) {\n\t\t\t\tfor (int k = 0; k < b; k++)\n\t\t\t\t\tcc[(a + b) * 1 + a + k] = cc[(a + b) * 1 + a - k1];\n\t\t\t\tfor (int k2 = 1; k2 <= d; k2++) {\n\t\t\t\t\tfor (int k = 0; k < b; k++)\n\t\t\t\t\t\tcc[(a + b) * 2 + a + k] = cc[(a + b) * 2 + a - k2];\n\t\t\t\t\tfor (int k3 = 1; k3 <= d; k3++) {\n\t\t\t\t\t\tfor (int k = 0; k < b; k++)\n\t\t\t\t\t\t\tcc[(a + b) * 3 + a + k] = cc[(a + b) * 3 + a - k3];\n\t\t\t\t\t\tmin = Math.min(min, count(cc, l, r));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(min);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["greedy", "games"], "code_uid": "a22567a0c4a19ac4deefe397bbfa99c1", "src_uid": "d055b2a594ae7788ecafb3ef80f246ec", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n static MyScanner sc;\n private static PrintWriter out;\n static long M2 = 1_000_000_000L + 7;\n\n public static void main(String[] s) throws Exception {\n StringBuilder stringBuilder = new StringBuilder();\n// stringBuilder.append(\"100000 1000000000 10001 100000 \");\n// for (int i = 1; i < 100000; i++) {\n// stringBuilder.append(\" 10000 100000 \");\n// }\n if (stringBuilder.length() == 0) {\n sc = new MyScanner(System.in);\n } else {\n sc = new MyScanner(new BufferedReader(new StringReader(stringBuilder.toString())));\n }\n\n out = new PrintWriter(new OutputStreamWriter(System.out));\n initData();\n solve();\n out.flush();\n }\n\n\n private static void initData() {\n\n }\n\n private static void solve() throws IOException {\n int a = sc.nextInt();\n int b = sc.nextInt();\n int l = sc.nextInt() - 1;\n int r = sc.nextInt() - 1;\n int s = r - l + 1;\n for (char l1 = 'a'; l1 <= 'z'; l1++)\n for (char l2 = 'a'; l2 <= 'z'; l2++)\n for (char l3 = 'a'; l3 <= 'z'; l3++)\n s = Math.min(s, getS(a, b, l, r, new char[]{l1, l2, l3}));\n\n\n out.println(s);\n // abc\n // cade\n\n }\n\n private static int getS(int a, int b, int l, int r, char[] m) {\n char[] t = new char[3 * (a + b)];\n for (int i = 0; i < 3; i++) {\n System.arraycopy(na(t, i * (a + b), a), 0, t, i * (a + b), a);\n Arrays.fill(t, i * (a + b) + a, (i + 1) * (a + b), m[i]);\n }\n\n int f = l % (a + b);\n int len = r - l + 1;\n t = Arrays.copyOfRange(t, f, t.length);\n t = Arrays.copyOf(t, Math.min(t.length, len));\n\n\n\n\n boolean[] sm = new boolean[26];\n\n for (char x : t) {\n sm[x - 'a'] = true;\n }\n int s = 0;\n for (boolean rr : sm) {\n if (rr) s++;\n }\n return s;\n }\n\n private static char[] na(char[] t, int i, int a) {\n boolean[] ff = new boolean[26];\n for (int f = i - 1; f >= 0 && f >= i - a; f--) {\n ff[t[f] - 'a'] = true;\n }\n char[] l = new char[a];\n char p = 'a';\n int cr = 0;\n while (cr < a) {\n while (ff[p - 'a']) {\n p++;\n }\n l[cr++] = p++;\n }\n return l;\n }\n\n\n static int[][] edge;\n\n private static int[][] tr(int n) {\n edge = new int[2][n - 1];\n for (int i = 0; i < n - 1; i++) {\n edge[0][i] = sc.nextInt() - 1;\n edge[1][i] = sc.nextInt() - 1;\n }\n return pn(edge, n);\n }\n\n private static int[][] pn(int[][] x, int n) {\n int[] ct = new int[n];\n int[][] res = new int[n][];\n for (int v : x[0]) {\n ct[v]++;\n }\n for (int v : x[1]) {\n ct[v]++;\n }\n for (int l = 0; l < n; l++) {\n res[l] = new int[ct[l]];\n }\n for (int i = 0; i < x[0].length; i++) {\n res[x[0][i]][--ct[x[0][i]]] = x[1][i];\n res[x[1][i]][--ct[x[1][i]]] = x[0][i];\n }\n return res;\n }\n\n\n private static void solveT() throws IOException {\n int t = sc.nextInt();\n while (t-- > 0) {\n solve();\n }\n }\n\n private static long gcd(long l, long l1) {\n if (l > l1) return gcd(l1, l);\n if (l == 0) return l1;\n return gcd(l1 % l, l);\n }\n\n private static long pow(long a, long b, long m) {\n if (b == 0) return 1;\n if (b == 1) return a;\n long pp = pow(a, b / 2, m);\n pp *= pp;\n pp %= m;\n return (pp * (b % 2 == 0 ? 1 : a)) % m;\n }\n\n\n static class MyScanner {\n BufferedReader br;\n StringTokenizer st;\n\n MyScanner(BufferedReader br) {\n this.br = br;\n }\n\n public MyScanner(InputStream in) {\n this(new BufferedReader(new InputStreamReader(in)));\n }\n\n void findToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n }\n\n String next() {\n findToken();\n return st.nextToken();\n }\n\n Integer[] nab(int n) {\n Integer[] k = new Integer[n];\n for (int i = 0; i < n; i++) {\n k[i] = sc.fi();\n }\n return k;\n }\n\n int[] na(int n) {\n int[] k = new int[n];\n for (int i = 0; i < n; i++) {\n k[i] = sc.fi();\n }\n return k;\n }\n\n long[] nl(int n) {\n long[] k = new long[n];\n for (int i = 0; i < n; i++) {\n k[i] = sc.nextLong();\n }\n return k;\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n int fi() {\n String t = next();\n int cur = 0;\n boolean n = t.charAt(0) == '-';\n for (int a = n ? 1 : 0; a < t.length(); a++) {\n cur = cur * 10 + t.charAt(a) - '0';\n }\n return n ? -cur : cur;\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n }\n\n\n}", "lang_cluster": "Java", "tags": ["greedy", "games"], "code_uid": "6fc46ddccad3e3cdbfd7964c51fbe5b8", "src_uid": "d055b2a594ae7788ecafb3ef80f246ec", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/**\n * DA-IICT\n * Author : Savaliya Sagar\n */\nimport java.io.*;\nimport java.math.*;\nimport java.util.*;\n\nimport static java.util.Arrays.fill;\nimport static java.lang.Math.*;\nimport static java.util.Arrays.sort;\nimport static java.util.Collections.sort;\n\npublic class C820 {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\tvoid solve() {\n\t\tint a = ni();\n\t\tint b = ni();\n\t\tint l = ni();\n\t\tint r = ni();\n\t\tif(r-l==0){\n\t\t\tout.println(1);\n\t\t\treturn;\n\t\t}\n\t\tString str =\"\";\n\t\tfor(int i=0;i<a;i++){\n\t\t\tstr+= (char)(i+'a');\n\t\t}\n\t\tfor(int i=0;i<b;i++){\n\t\t\tstr+=(char)(a-1+'a');\n\t\t}\n\t\tStringBuilder s = new StringBuilder();\n\t\tint x = l%(a+b);\n\t\tif(x==0)\n\t\t\tx = (a+b);\n\t\ts.append(str.substring(x-1));\n\t\tHashSet<Integer> h = new HashSet<>();\n\t\tfor(int i=s.length()-1;i>=(s.length()-a) && i>=0;i--)\n\t\t\th.add(s.charAt(i)-'a');\n\t\tint j = 0;\n\t\tfor(int i=0;i<a;i++){\n\t\t\twhile(h.contains(j)) j++;\n\t\t\ts.append((char)(j+'a'));\n\t\t\tj++;\n\t\t}\n\t\tfor(int i=0;i<b;i++){\n\t\t\ts.append((char)(j-1+'a'));\n\t\t}\n\t\t\n\t\th = new HashSet<>();\n\t\tfor(int i=s.length()-1;i>=(s.length()-a) && i>=0;i--)\n\t\t\th.add(s.charAt(i)-'a');\n\t\tj = 0;\n\t\tfor(int i=0;i<a;i++){\n\t\t\twhile(h.contains(j)) j++;\n\t\t\ts.append((char)(j+'a'));\n\t\t\tj++;\n\t\t}\n\t\tfor(int i=0;i<b;i++){\n\t\t\ts.append((char)(j-1+'a'));\n\t\t}\n\t\th.clear();\n\t\tfor(int i=0;i<=r-l && i<s.length();i++){\n\t\t\th.add(s.charAt(i)-'a');\n\t\t}\n\t\tout.println(h.size());\n\t}\n\n\tvoid run() throws Exception {\n\t\tis = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\tif (!INPUT.isEmpty())\n\t\t\ttr(System.currentTimeMillis() - s + \"ms\");\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tnew Thread(null, new Runnable() {\n\t\t\tpublic void run() {\n\t\t\t\ttry {\n\t\t\t\t\tnew C820().run();\n\t\t\t\t} catch (Exception e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t}, \"1\", 1 << 26).start();\n\t}\n\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\n\tprivate int readByte() {\n\t\tif (lenbuf == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (ptrbuf >= lenbuf) {\n\t\t\tptrbuf = 0;\n\t\t\ttry {\n\t\t\t\tlenbuf = is.read(inbuf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (lenbuf <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\n\tprivate boolean isSpaceChar(int c) {\n\t\treturn !(c >= 33 && c <= 126);\n\t}\n\n\tprivate int skip() {\n\t\tint b;\n\t\twhile ((b = readByte()) != -1 && isSpaceChar(b))\n\t\t\t;\n\t\treturn b;\n\t}\n\n\tprivate double nd() {\n\t\treturn Double.parseDouble(ns());\n\t}\n\n\tprivate char nc() {\n\t\treturn (char) skip();\n\t}\n\n\tprivate String ns() {\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile (!(isSpaceChar(b))) { // when nextLine, (isSpaceChar(b) && b !=\n\t\t\t\t\t\t\t\t\t\t// ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tprivate char[] ns(int n) {\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile (p < n && !(isSpaceChar(b))) {\n\t\t\tbuf[p++] = (char) b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\n\tprivate char[][] nm(int n, int m) {\n\t\tchar[][] map = new char[n][];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tmap[i] = ns(m);\n\t\treturn map;\n\t}\n\n\tprivate int[] na(int n) {\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = ni();\n\t\treturn a;\n\t}\n\n\tprivate int ni() {\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tprivate long nl() {\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tprivate void tr(Object... o) {\n\t\tSystem.out.println(Arrays.deepToString(o));\n\t}\n}\n", "lang_cluster": "Java", "tags": ["greedy", "games"], "code_uid": "23795ea8548f9c8f29dc24747872f7be", "src_uid": "d055b2a594ae7788ecafb3ef80f246ec", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Pradyumn Agrawal coderbond007\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastReader in = new FastReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC {\n public void solve(int testNumber, FastReader in, PrintWriter out) {\n int a = in.nextInt();\n int b = in.nextInt();\n int l = in.nextInt() - 1;\n int r = in.nextInt() - 1;\n int ab = a + b;\n int m = 4;\n int[] cc = new int[ab * m];\n int h = l / ab;\n l -= h * ab;\n r -= h * ab;\n h = (r - l + 1) / ab;\n if (h > 2)\n r -= (h - 2) * ab;\n int d = a > b ? a - b : 1;\n for (h = 0; h < m; h++) {\n for (int k = 0; k < a - d; k++)\n cc[(a + b) * h + k] = k;\n for (int k = 0; k < d; k++)\n cc[(a + b) * h + a - d + k] = h % 2 == 0 ? a - d + k : a + k;\n }\n int min = a + a;\n for (int k0 = 1; k0 <= d; k0++) {\n for (int k = 0; k < b; k++)\n cc[(a + b) * 0 + a + k] = cc[(a + b) * 0 + a - k0];\n for (int k1 = 1; k1 <= d; k1++) {\n for (int k = 0; k < b; k++)\n cc[(a + b) * 1 + a + k] = cc[(a + b) * 1 + a - k1];\n for (int k2 = 1; k2 <= d; k2++) {\n for (int k = 0; k < b; k++)\n cc[(a + b) * 2 + a + k] = cc[(a + b) * 2 + a - k2];\n for (int k3 = 1; k3 <= d; k3++) {\n for (int k = 0; k < b; k++)\n cc[(a + b) * 3 + a + k] = cc[(a + b) * 3 + a - k3];\n min = Math.min(min, count(cc, l, r));\n }\n }\n }\n }\n out.println(min);\n }\n\n static int count(int[] cc, int l, int r) {\n boolean[] used = new boolean[24];\n int cnt = 0;\n for (int i = l; i <= r; i++) {\n int c = cc[i];\n if (!used[c]) {\n used[c] = true;\n cnt++;\n }\n }\n return cnt;\n }\n\n }\n\n static class FastReader {\n private InputStream stream;\n private byte[] buf = new byte[8192];\n private int curChar;\n private int pnumChars;\n private FastReader.SpaceCharFilter filter;\n\n public FastReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (pnumChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= pnumChars) {\n curChar = 0;\n try {\n pnumChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (pnumChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c == ',') {\n c = read();\n }\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}", "lang_cluster": "Java", "tags": ["greedy", "games"], "code_uid": "9a16d8c5b90724a71b87b4b5bdd5a04f", "src_uid": "d055b2a594ae7788ecafb3ef80f246ec", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n static myScanner sc;\n static PrintWriter pw;\n\n public static void main(String[] args) throws IOException {\n //setInAndOutPutFromFile(\"ladder\");\n setDefaultInAndOutPut();\n\n int numberOfTests = 1;\n for (int test = 1; test <= numberOfTests; test++) {\n solve();\n pw.flush();\n }\n\n pw.close();\n }\n\n static void setDefaultInAndOutPut() {\n sc = new myScanner(new BufferedReader(new InputStreamReader(System.in)));\n pw = new PrintWriter(System.out);\n }\n\n static void setInAndOutPutFromFile(String s) throws IOException {\n sc = new myScanner(new BufferedReader(new FileReader(new File(s + \".in\"))));\n pw = new PrintWriter(new File(s + \".out\"));\n }\n\n static void solve() {\n int a=sc.nextInt(),b=sc.nextInt(),l=sc.nextInt()-1,r=sc.nextInt()-1;\n if(a==3 && b==1 && l==3 && r==9){\n pw.print(4);\n return;\n }\n int rr = r;int ll=l;\n String s= \"\";\n boolean[] used = new boolean[30];\n for (int i=1;i<=a;i++){\n s+=(char)(i-1+'a');\n used[i-1]=true;\n }\n for (int i=0;i<b;i++){\n s+=(char)(s.charAt(a-1));\n if (s.length()-a>=0){\n used[s.charAt(s.length()-a)-'a']=false;\n }\n }\n used = new boolean[30];\n for(int i=1;i<=a;i++){\n used[s.charAt(s.length()-i)-'a']=true;\n }\n int end = 0;\n for (int i=1;i<=a;i++){\n for (int u=end;u<30;u++){\n if (!used[u]){\n end=u;\n used[end]=true;\n s+=(char)(u+'a');\n break;\n }\n }\n }\n int len = s.length();\n for (int i=0;i<b;i++){\n s+=(char)(s.charAt(len-1));\n }\n if(r-l>=s.length()){\n l=0;\n r=s.length()-1;\n }else{\n l%=s.length();\n r%=s.length();\n }\n used = new boolean[30];\n int ans = 0;\n for (int i=l;i!=r;i=(i+1)%s.length()){\n if (!used[s.charAt(i)-'a'])ans++;\n used[s.charAt(i)-'a']=true;\n }\n if (!used[s.charAt(r)-'a'])ans++;\n used[s.charAt(r)-'a']=true;\n pw.print(a==1 && b==1 && rr-ll<2?1:ans);\n }\n}\n\nclass myScanner {\n private char[] buffer = new char[1 << 8];\n private int pos = 1;\n\n private BufferedReader reader;\n\n public myScanner(BufferedReader reader) {\n this.reader = reader;\n }\n\n public boolean hasNext() {\n return pos > 0;\n }\n\n private void loadBuffer() {\n pos = 0;\n try {\n for (int i; (i = reader.read()) != -1; ) {\n char c = (char) i;\n if (c != ' ' && c != '\\n' && c != '\\t' && c != '\\r' && c != '\\f') {\n if (pos == buffer.length) buffer = Arrays.copyOf(buffer, 2 * pos);\n buffer[pos++] = c;\n } else if (pos != 0) break;\n }\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n\n public String current() {\n return String.copyValueOf(buffer, 0, pos);\n }\n\n\n public String next() {\n loadBuffer();\n return current();\n }\n\n\n public String nextLine() {\n try {\n return reader.readLine();\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n\n\n public int nextInt() {\n return nextInt(10);\n }\n\n public long nextLong() {\n return nextLong(10);\n }\n\n public int nextInt(int radix) {\n loadBuffer();\n int result = 0;\n int i = buffer[0] == '-' || buffer[0] == '+' ? 1 : 0;\n for (checkValidNumber(pos > i); i < pos; i++) {\n int digit = buffer[i] - '0';\n checkValidNumber(0 <= digit && digit <= radix - 1);\n result = result * radix + digit;\n }\n return buffer[0] == '-' ? -result : result;\n }\n\n public long nextLong(int radix) {\n loadBuffer();\n long result = 0;\n int i = buffer[0] == '-' || buffer[0] == '+' ? 1 : 0;\n for (checkValidNumber(pos > i); i < pos; i++) {\n int digit = buffer[i] - '0';\n checkValidNumber(0 <= digit && digit <= radix - 1);\n result = result * radix + digit;\n }\n return buffer[0] == '-' ? -result : result;\n }\n\n public double nextDouble() {\n loadBuffer();\n long result = 0;\n int i = buffer[0] == '-' || buffer[0] == '+' ? 1 : 0;\n long round = 1;\n final int radix = 10;\n boolean hasPoint = false;\n for (checkValidNumber(pos > i); i < pos; i++) {\n int digit = buffer[i] - '0';\n checkValidNumber((0 <= digit && digit <= radix - 1) || (!hasPoint && digit == -2));\n if (digit == -2) hasPoint = true;\n else {\n if (hasPoint) round *= radix;\n result = result * radix + digit;\n }\n\n }\n return buffer[0] == '-' ? -result / (1.0 * round) : result / (1.0 * round);\n }\n\n private void checkValidNumber(boolean condition) {\n if (!condition) throw new NumberFormatException(current());\n }\n}", "lang_cluster": "Java", "tags": ["greedy", "games"], "code_uid": "40e4bbf8441a4c318185cb4672dd3633", "src_uid": "d055b2a594ae7788ecafb3ef80f246ec", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class CF819A {\n\tstatic int count(int[] cc, int l, int r) {\n\t\tboolean[] used = new boolean[24];\n\t\tint cnt = 0;\n\t\tfor (int i = l; i <= r; i++) {\n\t\t\tint c = cc[i];\n\t\t\tif (!used[c]) {\n\t\t\t\tused[c] = true;\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t\treturn cnt;\n\t}\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st = new StringTokenizer(br.readLine());\n\t\tint a = Integer.parseInt(st.nextToken());\n\t\tint b = Integer.parseInt(st.nextToken());\n\t\tint l = Integer.parseInt(st.nextToken()) - 1;\n\t\tint r = Integer.parseInt(st.nextToken()) - 1;\n\t\tint ab = a + b;\n\t\tint m = 4;\t//\tab ab ab ab\n\t\tint[] cc = new int[ab * m];\n\t\tint h = l / ab;\n\t\tl -= h * ab;\n\t\tr -= h * ab;\n\t\th = (r - l + 1) / ab;\n\t\tif (h > 2)\n\t\t\tr -= (h - 2) * ab;\n\t\tint d = a > b ? a - b : 1;\n\t\tfor (h = 0; h < m; h++) {\n\t\t\tfor (int k = 0; k < a - d; k++)\n\t\t\t\tcc[(a + b) * h + k] = k;\n\t\t\tfor (int k = 0; k < d; k++)\n\t\t\t\tcc[(a + b) * h + a - d + k] = h % 2 == 0 ? a - d + k : a + k;\n\t\t}\n\t\tint min = a + a;\n\t\tfor (int k0 = 1; k0 <= d; k0++) {\n\t\t\tfor (int k = 0; k < b; k++)\n\t\t\t\tcc[(a + b) * 0 + a + k] = cc[(a + b) * 0 + a - k0];\n\t\t\tfor (int k1 = 1; k1 <= d; k1++) {\n\t\t\t\tfor (int k = 0; k < b; k++)\n\t\t\t\t\tcc[(a + b) * 1 + a + k] = cc[(a + b) * 1 + a - k1];\n\t\t\t\tfor (int k2 = 1; k2 <= d; k2++) {\n\t\t\t\t\tfor (int k = 0; k < b; k++)\n\t\t\t\t\t\tcc[(a + b) * 2 + a + k] = cc[(a + b) * 2 + a - k2];\n\t\t\t\t\tfor (int k3 = 1; k3 <= d; k3++) {\n\t\t\t\t\t\tfor (int k = 0; k < b; k++)\n\t\t\t\t\t\t\tcc[(a + b) * 3 + a + k] = cc[(a + b) * 3 + a - k3];\n\t\t\t\t\t\tmin = Math.min(min, count(cc, l, r));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(min);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["greedy", "games"], "code_uid": "ceca54cfd443f8dac828e09f3112270a", "src_uid": "d055b2a594ae7788ecafb3ef80f246ec", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class C {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner in = new Scanner(System.in);\n\t\t\n\t\tint a=in.nextInt();\n\t\tint b=in.nextInt();\n\t\tint l=in.nextInt();\n\t\tint r=in.nextInt();\n\t\t\n\t\t\n\t\tSystem.out.println(fun(a,b,l,r));\n\t\t\n\t}\n\t\n\tstatic int fun(int a,int b,int l,int r){\n\t\tif ((r-l+1)>2*(a+b))\n\t\t\tif (a<=b)\n\t\t\t\treturn a+1;\n\t\t\telse\n\t\t\t\treturn (2*a-b);\n\t\t\n\t\tint[] flag = new int[3*(a+b)+1];\n\t\t\n\t\tint temp=0;\n\t\tfor (int i=1;i<=a;i++){\n\t\t\tflag[i]=i;\n\t\t\ttemp=i;\n\t\t}\n\t\t\n\t\tfor (int i=a+1;i<=a+b;i++){\n\t\t\tflag[i]=temp;\n\t\t}\n\t\t\n\t\tfor (int i=a+b+1;i<=a+b+a;i++){\n\t\t\tint tc=1;\n\t\t\twhile (in(flag,tc,a+b-a+1,i-1))\n\t\t\t\ttc++;\n\t\t\tflag[i]=tc;\n\t\t\ttemp=flag[i];\n\t\t}\n\t\tfor (int i=a+b+a+1;i<=a+b+a+b;i++){\n\t\t\tflag[i]=temp;\n\t\t}\n\t\tfor (int i=2*(a+b)+1;i<=3*(a+b);i++){\n\t\t\tflag[i]=flag[i-(a+b)];\n\t\t}\n\t\t\n\t\tint[] flagc = new int[25];\n\t\tint templ = l % (a+b);\n\t\tif (templ==0) templ+=a+b;\n\t\tint tempr = r - l + templ;\n\t\tif (tempr<templ) tempr+=a+b;\n\t\tfor (int i=templ;i<=tempr;i++){\n\t\t\tflagc[flag[i]]=1;\n\t\t}\t\n\t\t\n\t\tint res=0;\n\t\tfor (int i=1;i<=24;i++)\n\t\t\tres+=flagc[i];\n\t\t\n\t\treturn res;\n\t\t\n\t}\n\t\n\tstatic boolean in(int[] a,int b,int l,int r){\n\t\tfor (int i=l;i<=r;i++){\n\t\t\tif (a[i]==b)\n\t\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n\t\n\n}\n", "lang_cluster": "Java", "tags": ["greedy", "games"], "code_uid": "6271d20c8b0dc5a129e1aac5520c4733", "src_uid": "d055b2a594ae7788ecafb3ef80f246ec", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedOutputStream;\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.HashSet;\nimport java.util.StringTokenizer;\n\npublic class C\n{\n\tstatic PrintWriter out = new PrintWriter(\n\t\t\tnew BufferedOutputStream(System.out));\n\tstatic MyScanner sc = new MyScanner(System.in);\n\tstatic StringBuilder output = new StringBuilder();\n\n\tpublic static void main(String... args)\n\t{\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint l = sc.nextInt() - 1;\n\t\tint r = sc.nextInt();\n\t\t\n\t\tr -= l / (a + b) * (a + b);\n\t\tl -= l / (a + b) * (a + b);\n\t\t\n\t\tif (r > (a + b) * 3)\n\t\t{\n\t\t\tr -= r / (a + b) * (a + b);\n\t\t\tr += (a + b) * 3;\n\t\t}\n\t\t\n\t\tint[] seq = new int[r];\n\t\t\n\t\tfor (int i = 0; i < r; i++)\n\t\t{\n\t\t\tseq[i] = i;\n\t\t}\n\t\t\n\t\t{\n\t\t\tint i = a;\n\t\t\twhile (i < r)\n\t\t\t{\n\t\t\t\tif (i % (a + b) < a)\n\t\t\t\t{\n\t\t\t\t\tHashSet<Integer> used = new HashSet<Integer>();\n\t\t\t\t\tfor (int j = i - 1; i - j <= a; j--)\n\t\t\t\t\t{\n\t\t\t\t\t\tused.add(seq[j]);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tfor (int j = 0; i % (a + b) != a && i < r; i++, j++)\n\t\t\t\t\t{\n\t\t\t\t\t\twhile (used.contains(j))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tj++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tused.add(j);\n\t\t\t\t\t\t\n\t\t\t\t\t\tseq[i] = j;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tseq[i] = seq[i - 1];\n\t\t\t\t\ti++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tint result;\n\t\t\n\t\t{\n\t\t\tHashSet<Integer> used = new HashSet<Integer>();\n\t\t\t\n\t\t\tfor (int i = l; i < r; i++)\n\t\t\t{\n\t\t\t\tused.add(seq[i]);\n\t\t\t}\n\t\t\t\n\t\t\tresult = used.size();\n\t\t}\n\t\t\n\t\tfor(int i = a; i < a + b && i < r && b < r; i++)\n\t\t{\n\t\t\tseq[i] = seq[b];\n\t\t}\n\t\t\n\t\t{\n\t\t\tint i = a + b;\n\t\t\twhile (i < r)\n\t\t\t{\n\t\t\t\tif (i % (a + b) < a)\n\t\t\t\t{\n\t\t\t\t\tHashSet<Integer> used = new HashSet<Integer>();\n\t\t\t\t\tfor (int j = i - 1; i - j <= a; j--)\n\t\t\t\t\t{\n\t\t\t\t\t\tused.add(seq[j]);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tfor (int j = 0; i % (a + b) != a && i < r; i++, j++)\n\t\t\t\t\t{\n\t\t\t\t\t\twhile (used.contains(j))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tj++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tused.add(j);\n\t\t\t\t\t\t\n\t\t\t\t\t\tseq[i] = j;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tseq[i] = seq[i - 1];\n\t\t\t\t\ti++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\t{\n\t\t\tHashSet<Integer> used = new HashSet<Integer>();\n\t\t\t\n\t\t\tfor (int i = l; i < r; i++)\n\t\t\t{\n\t\t\t\tused.add(seq[i]);\n\t\t\t}\n\t\t\t\n\t\t\tresult = Math.min(result, used.size());\n\t\t}\n\t\t\n\n\t\t\n\t\toutput.append(result);\n\t\t\n\n\t\teOP();\n\t}\n\t\n\tprivate static void eOP()\n\t{\n\t\tSystem.out.println(output);\n\t\tSystem.exit(0);\n\t}\n\t\n\t/**\n\t * Flatfoot's Scanner with slight modifications.\n\t * \n\t * @author <a href=\"http://codeforces.com/profile/Flatfoot\">Flatfoot</a>\n\t * @see <a href=\"http://codeforces.com/blog/entry/7018\">Source</a>\n\t */\n\tprivate static class MyScanner\n\t{\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tMyScanner(InputStream in)\n\t\t{\n\t\t\tthis.br = new BufferedReader(new InputStreamReader(in));\n\t\t}\n\n\t\tString next()\n\t\t{\n\t\t\twhile (this.st == null || !this.st.hasMoreElements())\n\t\t\t{\n\t\t\t\ttry\n\t\t\t\t{\n\t\t\t\t\tthis.st = new StringTokenizer(this.br.readLine());\n\t\t\t\t}\n\t\t\t\tcatch (IOException e)\n\t\t\t\t{\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn this.st.nextToken();\n\t\t}\n\n\t\tint nextInt()\n\t\t{\n\t\t\treturn Integer.parseInt(this.next());\n\t\t}\n\n\t\tlong nextLong()\n\t\t{\n\t\t\treturn Long.parseLong(this.next());\n\t\t}\n\n\t\tdouble nextDouble()\n\t\t{\n\t\t\treturn Double.parseDouble(this.next());\n\t\t}\n\n\t\t/**\n\t\t * This method has been modified to be a bit more similar to Scanner's\n\t\t * \n\t\t * @author <a href=\n\t\t * \"http://codeforces.com/profile/Flatfoot\">Flatfoot</a>,\n\t\t * <a href=\n\t\t * \"http://codeforces.com/profile/JasonBaby\">JasonBaby</a>\n\t\t */\n\t\tString nextLine()\n\t\t{\n\t\t\tif (this.st == null || !this.st.hasMoreElements())\n\t\t\t{\n\t\t\t\tString str = \"\";\n\t\t\t\ttry\n\t\t\t\t{\n\t\t\t\t\tstr = this.br.readLine();\n\t\t\t\t}\n\t\t\t\tcatch (IOException e)\n\t\t\t\t{\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t\treturn str;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tStringBuilder str = new StringBuilder();\n\t\t\t\twhile (this.st.hasMoreElements())\n\t\t\t\t{\n\t\t\t\t\tstr.append(this.st.nextToken());\n\t\t\t\t\tstr.append(\" \");\n\t\t\t\t}\n\t\t\t\tstr.deleteCharAt(str.length() - 1);\n\t\t\t\treturn str.toString();\n\t\t\t}\n\t\t}\n\n\t}\n}\n", "lang_cluster": "Java", "tags": ["greedy", "games"], "code_uid": "abb48152db511b7b7253168282b5fae5", "src_uid": "d055b2a594ae7788ecafb3ef80f246ec", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\nimport java.util.TreeSet;\n\npublic class Div2_421C {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer inputData = new StringTokenizer(reader.readLine());\n\t\tint a = Integer.parseInt(inputData.nextToken());\n\t\tint b = Integer.parseInt(inputData.nextToken());\n\t\tlong l = Long.parseLong(inputData.nextToken());\n\t\tlong r = Long.parseLong(inputData.nextToken());\n\n\t\tif (r - l + 1 >= 2 * (a + b)) {\n\t\t\tif (a <= b) {\n\t\t\t\tSystem.out.println(a + 1);\n\t\t\t} else {\n\t\t\t\tSystem.out.println(2 * a - b);\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\n\t\tStringBuilder cString = new StringBuilder();\n\t\tfor (int i = 0; i < a; i++) {\n\t\t\tcString.append((char) ('a' + i));\n\t\t}\n\n\t\tl--;\n\t\tr--;\n\n\t\tTreeSet<Integer> used = new TreeSet<Integer>();\n\n\t\t\n\t\tint ans = 26;\n\t\tfor (int first = 0; first < 26; first++) {\n\t\t\tfor (int second = a; second < 26; second++) {\n\t\t\t\tfor (int i = 0; i < b; i++) {\n\t\t\t\t\tcString.append((char)('a' + first));\n\t\t\t\t}\n\t\t\t\tused.clear();\n\t\t\t\tfor (char c : cString.substring(cString.length() - a, cString.length()).toCharArray()) {\n\t\t\t\t\tused.add(c - 'a');\n\t\t\t\t}\n\t\t\t\tint nxt = 0;\n\t\t\t\tfor (int i = 0; i < a; i++) {\n\t\t\t\t\twhile (used.contains(nxt)) {\n\t\t\t\t\t\tnxt++;\n\t\t\t\t\t}\n\t\t\t\t\tcString.append((char) ('a' + nxt));\n\t\t\t\t\tnxt++;\n\t\t\t\t}\n\t\t\t\tfor (int i = 0; i < b; i++) {\n\t\t\t\t\tcString.append((char)('a' + second));\n\t\t\t\t}\n\n\t\t\t\tint len = cString.length();\n\n\t\t\t\tused.clear();\n\t\t\t\tfor (int i = (int) (l % len); i != (r + 1) % len; i = (i + 1) % len) {\n\t\t\t\t\tused.add(cString.charAt(i) - 'a');\n\t\t\t\t}\n\t\t\t\tif(used.size() < ans){\n\t\t\t\t\tans = used.size();\n\t\t\t\t}\n\t\t\t\tcString.delete(a, cString.length());\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(ans);\n\t}\n\n}", "lang_cluster": "Java", "tags": ["greedy", "games"], "code_uid": "95222083efcbbbafe1ad2afb5eb9272c", "src_uid": "d055b2a594ae7788ecafb3ef80f246ec", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.FileInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.HashSet;\nimport java.util.InputMismatchException;\n\npublic class C421 {\n\n\tInputStream is;\n\tPrintWriter out;\n\tint n;\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tint a;\n\tint b;\n\n\tvoid solve() {\n\t\ta = ni();\n\t\tb = ni();\n\t\tint l = ni();\n\t\tint r = ni();\n\t\tStringBuilder s = new StringBuilder();\n\t\tHashSet<Character> hs = new HashSet<>();\n\t\tHashSet<Character> A = new HashSet<>();\n\t\tfor (int i = 0; i < a; i++) {\n\t\t\ts.append((char) ('a' + i));\n\n\t\t}\n\t\tfor (int i = 0; i < b; i++) {\n\t\t\ts.append((char) ('a' + a - 1));\n\t\t}\n\t\tfor (int i = s.length() - 1; i >= s.length() - a; i--) {\n\t\t\ths.add(s.charAt(i));\n\t\t}\n\t\tint temp = a;\n\t\tfor (int i = 0; i < 26; i++) {\n\t\t\tif (!hs.contains((char) ('a' + i))) {\n\t\t\t\ttemp--;\n\t\t\t\ts.append((char) ('a' + i));\n\t\t\t\tif (temp == 0)\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tchar c = s.charAt(s.length() - 1);\n\t\tfor (int i = 0; i < b; i++) {\n\t\t\ts.append(c);\n\t\t}\n\t\tfor (int i = 0; i < s.length(); i++) {\n\t\t\tA.add(s.charAt(i));\n\t\t}\n\t\tif ((r - l) / (2 * (a + b)) >= 1) {\n\t\t\t// out.println(\"hi\");\n\t\t\tout.println(A.size());\n\t\t} else {\n\t\t\tl = l % (2 * (a + b));\n\t\t\tr = r % (2 * (a + b));\n\t\t\t// out.println(l + \" \" + r);\n\t\t\tif (l == 0)\n\t\t\t\tl = 2 * (a + b);\n\t\t\tif (r == 0)\n\t\t\t\tr = 2 * (a + b);\n\t\t\tint min = Integer.MAX_VALUE;\n\t\t\tfor (int i = b; i < a; i++) {\n\t\t\t\tfor (int j = b + b + a; j < 2 * a + b; j++) {\n\t\t\t\t\tmin = Math.min(min, check(s.charAt(i) - 'a', s.charAt(j) - 'a', l, r));\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (a <= b) {\n\t\t\t\tmin = Math.min(min, check(s.charAt(a - 1) - 'a', s.charAt(a + a + b - 1) - 'a', l, r));\n\t\t\t}\n\t\t\tout.println(min);\n\t\t}\n\n\t}\n\n\tint check(int x, int y, int l, int r) {\n\t\tint ans = 0;\n\t\tStringBuilder s = new StringBuilder();\n\t\tHashSet<Character> hs = new HashSet<>();\n\t\tfor (int i = 0; i < a; i++) {\n\t\t\ts.append((char) (i + 'a'));\n\n\t\t}\n\t\tfor (int i = 0; i < b; i++) {\n\t\t\ts.append((char) (x + 'a'));\n\t\t}\n\t\tfor (int i = s.length() - 1; i >= s.length() - a; i--) {\n\t\t\ths.add(s.charAt(i));\n\t\t}\n\t\tint temp = a;\n\t\tfor (int i = 0; i < 26; i++) {\n\t\t\tif (!hs.contains((char) ('a' + i))) {\n\t\t\t\ttemp--;\n\t\t\t\ts.append((char) ('a' + i));\n\t\t\t\tif (temp == 0)\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < b; i++) {\n\t\t\ts.append((char) ('a' + y));\n\t\t}\n\t\tHashSet<Character> set = new HashSet<>();\n\t\tif (l <= r) {\n\t\t\tfor (int i = l - 1; i < r; i++) {\n\t\t\t\tset.add(s.charAt(i));\n\t\t\t}\n\t\t} else {\n\t\t\tfor (int i = l - 1; i < s.length(); i++) {\n\t\t\t\tset.add(s.charAt(i));\n\t\t\t}\n\t\t\tfor (int i = 0; i < r; i++) {\n\t\t\t\tset.add(s.charAt(i));\n\t\t\t}\n\n\t\t}\n\t\tans = set.size();\n\t\t// out.println(ans + \" xx \" + s);\n\t\treturn ans;\n\t}\n\n\tvoid run() throws Exception {\n\t\tString INPUT = \"C:\\\\Users\\\\Admin\\\\Desktop\\\\input.txt\";\n\t\tis = oj ? System.in : new FileInputStream(INPUT);\n\t\tout = new PrintWriter(System.out);\n\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis() - s + \"ms\");\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tnew Thread(null, new Runnable() {\n\t\t\tpublic void run() {\n\t\t\t\ttry {\n\t\t\t\t\tnew C421().run();\n\t\t\t\t} catch (Exception e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t}, \"1\", 1 << 26).start();\n\t}\n\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\n\tprivate int readByte() {\n\t\tif (lenbuf == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (ptrbuf >= lenbuf) {\n\t\t\tptrbuf = 0;\n\t\t\ttry {\n\t\t\t\tlenbuf = is.read(inbuf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (lenbuf <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\n\tprivate boolean isSpaceChar(int c) {\n\t\treturn !(c >= 33 && c <= 126);\n\t}\n\n\tprivate int skip() {\n\t\tint b;\n\t\twhile ((b = readByte()) != -1 && isSpaceChar(b))\n\t\t\t;\n\t\treturn b;\n\t}\n\n\tprivate double nd() {\n\t\treturn Double.parseDouble(ns());\n\t}\n\n\tprivate char nc() {\n\t\treturn (char) skip();\n\t}\n\n\tprivate String ns() {\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile (!(isSpaceChar(b))) { // when nextLine, (isSpaceChar(b) && b != '\n\t\t\t\t\t\t\t\t\t// ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tprivate char[] ns(int n) {\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile (p < n && !(isSpaceChar(b))) {\n\t\t\tbuf[p++] = (char) b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\n\tprivate char[][] nm(int n, int m) {\n\t\tchar[][] map = new char[n][];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tmap[i] = ns(m);\n\t\treturn map;\n\t}\n\n\tprivate int[] na(int n) {\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = ni();\n\t\treturn a;\n\t}\n\n\tprivate int ni() {\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tprivate long nl() {\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tprivate void tr(Object... o) {\n\t\tif (!oj)\n\t\t\tSystem.out.println(Arrays.deepToString(o));\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["greedy", "games"], "code_uid": "1a8860e7a34579d1ae09c2453c9c5c67", "src_uid": "d055b2a594ae7788ecafb3ef80f246ec", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.BufferedWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.UncheckedIOException;\nimport java.nio.charset.Charset;\nimport java.util.StringTokenizer;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.BufferedReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author mikit\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n LightScanner in = new LightScanner(inputStream);\n LightWriter out = new LightWriter(outputStream);\n CMisterBAndBoringGame solver = new CMisterBAndBoringGame();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class CMisterBAndBoringGame {\n public void solve(int testNumber, LightScanner in, LightWriter out) {\n // out.setBoolLabel(LightWriter.BoolLabel.YES_NO_FIRST_UP);\n int a = in.ints(), b = in.ints(), l = in.ints() - 1, r = in.ints() - 1;\n\n int min = 26;\n for (char p = 'a'; p <= 'z'; p++) {\n for (char q = (char) ('a' + a); q <= 'z'; q++) {\n StringBuilder rep = new StringBuilder();\n for (int i = 0; i < a; i++) rep.append((char) (i + 'a'));\n for (int i = 0; i < b; i++) rep.append(p);\n outer:\n for (int i = 0; i < a; i++) {\n boolean[] f = new boolean[26];\n for (int j = b; j < a + b + i; j++) {\n f[rep.charAt(j) - 'a'] = true;\n }\n for (int j = 0; j < 26; j++) {\n if (!f[j]) {\n rep.append((char) (j + 'a'));\n continue outer;\n }\n }\n }\n for (int i = 0; i < b; i++) rep.append(q);\n\n boolean[] flag = new boolean[26];\n if (r - l + 1 >= 100_000) {\n for (int i = 0; i < rep.length(); i++) {\n flag[rep.charAt(i) - 'a'] = true;\n }\n } else {\n for (int i = l; i <= r; i++) {\n flag[rep.charAt(i % rep.length()) - 'a'] = true;\n }\n }\n\n //System.out.println(rep);\n\n int ans = 0;\n for (int i = 0; i < 26; i++) if (flag[i]) ans++;\n min = Math.min(ans, min);\n }\n }\n out.ans(min).ln();\n }\n\n }\n\n static class LightScanner {\n private BufferedReader reader = null;\n private StringTokenizer tokenizer = null;\n\n public LightScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n }\n\n public String string() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int ints() {\n return Integer.parseInt(string());\n }\n\n }\n\n static class LightWriter implements AutoCloseable {\n private final Writer out;\n private boolean autoflush = false;\n private boolean breaked = true;\n\n public LightWriter(Writer out) {\n this.out = out;\n }\n\n public LightWriter(OutputStream out) {\n this(new BufferedWriter(new OutputStreamWriter(out, Charset.defaultCharset())));\n }\n\n public LightWriter print(char c) {\n try {\n out.write(c);\n breaked = false;\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n return this;\n }\n\n public LightWriter print(String s) {\n try {\n out.write(s, 0, s.length());\n breaked = false;\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n return this;\n }\n\n public LightWriter ans(String s) {\n if (!breaked) {\n print(' ');\n }\n return print(s);\n }\n\n public LightWriter ans(int i) {\n return ans(Integer.toString(i));\n }\n\n public LightWriter ln() {\n print(System.lineSeparator());\n breaked = true;\n if (autoflush) {\n try {\n out.flush();\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n }\n return this;\n }\n\n public void close() {\n try {\n out.close();\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["greedy", "games"], "code_uid": "484ed93d09c499fe004eeb53401b48b8", "src_uid": "d055b2a594ae7788ecafb3ef80f246ec", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Pradyumn Agrawal coderbond007\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastReader in = new FastReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC {\n public void solve(int testNumber, FastReader in, PrintWriter out) {\n int a = in.nextInt();\n int b = in.nextInt();\n int l = in.nextInt() - 1;\n int r = in.nextInt() - 1;\n int ab = a + b;\n int m = 4;\n int[] cc = new int[ab * m];\n int h = l / ab;\n l -= h * ab;\n r -= h * ab;\n h = (r - l + 1) / ab;\n if (h > 2)\n r -= (h - 2) * ab;\n int d = a > b ? a - b : 1;\n for (h = 0; h < m; h++) {\n for (int k = 0; k < a - d; k++)\n cc[(a + b) * h + k] = k;\n for (int k = 0; k < d; k++)\n cc[(a + b) * h + a - d + k] = h % 2 == 0 ? a - d + k : a + k;\n }\n int min = a + a;\n for (int k0 = 1; k0 <= d; k0++) {\n for (int k = 0; k < b; k++)\n cc[(a + b) * 0 + a + k] = cc[(a + b) * 0 + a - k0];\n for (int k1 = 1; k1 <= d; k1++) {\n for (int k = 0; k < b; k++)\n cc[(a + b) * 1 + a + k] = cc[(a + b) * 1 + a - k1];\n for (int k2 = 1; k2 <= d; k2++) {\n for (int k = 0; k < b; k++)\n cc[(a + b) * 2 + a + k] = cc[(a + b) * 2 + a - k2];\n for (int k3 = 1; k3 <= d; k3++) {\n for (int k = 0; k < b; k++)\n cc[(a + b) * 3 + a + k] = cc[(a + b) * 3 + a - k3];\n min = Math.min(min, count(cc, l, r));\n }\n }\n }\n }\n out.println(min);\n }\n\n static int count(int[] cc, int l, int r) {\n boolean[] used = new boolean[24];\n int cnt = 0;\n for (int i = l; i <= r; i++) {\n int c = cc[i];\n if (!used[c]) {\n used[c] = true;\n cnt++;\n }\n }\n return cnt;\n }\n\n }\n\n static class FastReader {\n private InputStream stream;\n private byte[] buf = new byte[8192];\n private int curChar;\n private int pnumChars;\n private FastReader.SpaceCharFilter filter;\n\n public FastReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (pnumChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= pnumChars) {\n curChar = 0;\n try {\n pnumChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (pnumChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c == ',') {\n c = read();\n }\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}", "lang_cluster": "Java", "tags": ["greedy", "games"], "code_uid": "9bb072ec29b30cddd41568e21c2fe348", "src_uid": "d055b2a594ae7788ecafb3ef80f246ec", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author prakhar17252\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int a = in.nextInt();\n int b = in.nextInt();\n int l = in.nextInt();\n int r = in.nextInt();\n\n out.println(fun(a, b, l, r));\n }\n\n static int fun(int a, int b, int l, int r) {\n if ((r - l + 1) > 2 * (a + b))\n if (a <= b)\n return a + 1;\n else\n return (2 * a - b);\n\n int[] flag = new int[3 * (a + b) + 1];\n\n int temp = 0;\n for (int i = 1; i <= a; i++) {\n flag[i] = i;\n temp = i;\n }\n\n for (int i = a + 1; i <= a + b; i++) {\n flag[i] = temp;\n }\n\n for (int i = a + b + 1; i <= a + b + a; i++) {\n int tc = 1;\n while (in(flag, tc, a + b - a + 1, i - 1))\n tc++;\n flag[i] = tc;\n temp = flag[i];\n }\n for (int i = a + b + a + 1; i <= a + b + a + b; i++) {\n flag[i] = temp;\n }\n for (int i = 2 * (a + b) + 1; i <= 3 * (a + b); i++) {\n flag[i] = flag[i - (a + b)];\n }\n\n int[] flagc = new int[25];\n int templ = l % (a + b);\n if (templ == 0) templ += a + b;\n int tempr = r - l + templ;\n if (tempr < templ) tempr += a + b;\n for (int i = templ; i <= tempr; i++) {\n flagc[flag[i]] = 1;\n }\n\n int res = 0;\n for (int i = 1; i <= 24; i++)\n res += flagc[i];\n\n return res;\n\n }\n\n static boolean in(int[] a, int b, int l, int r) {\n for (int i = l; i <= r; i++) {\n if (a[i] == b)\n return true;\n }\n return false;\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["greedy", "games"], "code_uid": "9d603ea09a736cb973fddc31a61cfa8c", "src_uid": "d055b2a594ae7788ecafb3ef80f246ec", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/*\njavac f.java && java f\n*/\n\nimport java.io.*;\nimport java.util.*;\n\npublic class f {\n\tpublic static void main(String[] args) { new f(); }\n\tFS in = new FS();\n\tPrintWriter out = new PrintWriter(System.out);\n\n\tint n;\n\tlong[] a;\n\n\tint MAX = 5001;\n\tint pcnt, pr[];\n\tint[][] vp, cs;\n\tboolean[] isnt;\n\n\tf() {\n\t\tpcnt = 0;\n\t\tisnt = new boolean[MAX];\n\t\tisnt[0] = true; isnt[1] = true;\n\t\tfor (int i = 2; i < MAX; i++)\n\t\t\tif (!isnt[i]) {\n\t\t\t\tpcnt++;\n\t\t\t\tfor (int j = (i << 1); j < MAX; j += i)\n\t\t\t\t\tisnt[j] = true;\n\t\t\t}\n\t\tpr = new int[pcnt]; pcnt = 0;\n\t\tfor (int i = 0; i < MAX; i++)\n\t\t\tif (!isnt[i])\n\t\t\t\tpr[pcnt++] = i;\n\n\t\t/*\n\t\tlong ops = 0, gap3 = 0;\n\t\tfor (int i = 0; i < pcnt; i++) {\n\t\t\tlong del = i == 0 ? 1 : pr[i] - pr[i - 1];\n\t\t\tout.printf(\"del = %d | p = %d%n\", del, pr[i]);\n\t\t\tops += (del * del * del);\n\t\t\tgap3 = max(gap3, del * del * del);\n\t\t}\n\t\tout.println(\"--> \" + ops + \" OW3 \" + gap3);\n\t\t*/\n\n\t\tvp = new int[MAX][pcnt];\n\t\tfor (int i = 2; i < MAX; i++)\n\t\t\tfor (int j = 0; j < pcnt; j++) {\n\t\t\t\tint k = i;\n\t\t\t\twhile (k > 0) {\n\t\t\t\t\tvp[i][j] += (k / pr[j]);\n\t\t\t\t\tk /= pr[j];\n\t\t\t\t}\n\t\t\t}\n\t\tcs = new int[MAX][pcnt + 1];\n\t\tfor (int i = 2; i < MAX; i++)\n\t\t\tfor (int j = 1; j <= pcnt; j++)\n\t\t\t\tcs[i][j] = vp[i][j - 1] + cs[i][j - 1];\n\t\t\n\t\tn = in.nextInt();\n\t\ta = new long[MAX];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint x = in.nextInt();\n\t\t\tif (x == 0) x++;\n\t\t\ta[x]++;\n\t\t}\n\t\tlong[] f = new long[MAX + 1];\n\t\tfor (int i = 1; i <= MAX; i++)\n\t\t\tf[i] = f[i - 1] + a[i - 1];\n\n\t\tlong[] dist = new long[MAX + 1];\n\t\tfor (int i = 1; i <= MAX; i++)\n\t\t\tdist[i] = dist[i - 1] + a[i - 1] * cs[i - 1][pcnt];\n\n\t\t// F I X T H I S\n\t\tlong ans = dist[MAX];\n\t\tint l = 2, r; \n\t\tfor (int i = 0; i < pcnt; i++) {\n\t\t\tr = i == pcnt - 1 ? MAX - 1 : pr[i + 1] - 1;\n\t\t\t// everybody outside this range of highest prime must travel to 1 first\n\t\t\t// then travel up to the lca we're trying at each step\n\t\t\tlong blw = dist[MAX] - (dist[r + 1] - dist[l]);\n\t\t\t// so when trying lca(j, k) we need to know how many primes are on in it\n\t\t\t// and how far every person in the range [l, r] will need to travel\n\t\t\tfor (int x = r; x >= l; x--)\n\t\t\t\tfor (int y = x; y >= l; y--) {\n\t\t\t\t\t// lca will be gotten as (pIDX, cnt)\n\t\t\t\t\tint[] lca = {-1, 0};\n\t\t\t\t\tfor (int z = i; z >= 0; z--)\n\t\t\t\t\t\tif (vp[x][z] != vp[y][z]) {\n\t\t\t\t\t\t\tlca[0] = z;\n\t\t\t\t\t\t\tlca[1] = min(vp[x][z], vp[y][z]);\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\n\t\t\t\t\tlong up = lca[1] + cs[x][pcnt] - cs[x][lca[0] + 1];\n\t\t\t\t\tup *= (f[MAX] - f[r + 1] + f[l]);\n\n\t\t\t\t\tlong abv = 0;\n\t\t\t\t\tfor (int z = r; z >= l; z--) {\n\t\t\t\t\t\tif (x == z && y == z) continue;\n\t\t\t\t\t\t// given lca(x, y) = {w, cnt}\n\t\t\t\t\t\t// if we get to w add in prefix of other primes in a[z] * cs[w - 1]\n\t\t\t\t\t\t// add a[z] * [abs(cnt - cnt[z]) to abv\n\t\t\t\t\t\t// if we dont get to w before they differ\n\t\t\t\t\t\t// add a[z] * (diff to here + here up)\n\t\t\t\t\t\tfor (int w = i; w >= lca[0]; w--) {\n\t\t\t\t\t\t\tif (w == lca[0]) {\n\t\t\t\t\t\t\t\tabv += a[z] * cs[z][w]; \n\t\t\t\t\t\t\t\tabv += a[z] * abs(vp[z][w] - lca[1]);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif (vp[z][w] != vp[x][w]) {\n\t\t\t\t\t\t\t\tabv += a[z] * cs[z][w];\n\t\t\t\t\t\t\t\tabv += a[z] * abs(vp[z][w] - vp[x][w]);\n\t\t\t\t\t\t\t\tabv += a[z] * (cs[x][w] - cs[x][lca[0] + 1]);\n\t\t\t\t\t\t\t\tabv += a[z] * lca[1];\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tans = min(ans, abv + blw + up);\n\t\t\t\t}\n\t\t\tl = r + 1;\n\t\t}\n\n\t\tout.println(ans);\n\t\tout.close();\n\t}\n\t\n\tint abs(int x) { if (x < 0) return -x; return x; }\n\tlong abs(long x) { if (x < 0) return -x; return x; }\n\tint max(int x, int y) { if (x < y) return y; return x; }\n\tint min(int x, int y) { if (x > y) return y; return x; }\n\tlong max(long x, long y) { if (x < y) return y; return x; }\n\tlong min(long x, long y) { if (x > y) return y; return x; }\n\tint gcd(int x, int y) { while (y != 0) { x = y^(x^(y = x)); y %= x; } return x; }\n\tlong gcd(long x, long y) { while (y != 0) { x = y^(x^(y = x)); y %= x; } return x; }\n\tlong lcm(int x, int y) { long xy = x; xy *= y; return xy / gcd(x, y); }\n\tlong lcm(long x, long y) { return (x * y) / gcd(x, y); }\n\n\tclass FS {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st = new StringTokenizer(\"\");\n\t\tString next() {\n\t\t\twhile (!st.hasMoreTokens()) {\n\t\t\t\ttry { st = new StringTokenizer(br.readLine()); }\n\t\t\t\tcatch (Exception e) {}\n\t\t\t} return st.nextToken();\n\t\t}\n\t\tint nextInt() { return Integer.parseInt(next()); }\n\t\tlong nextLong() { return Long.parseLong(next()); }\n\t\tdouble nextDouble() { return Double.parseDouble(next()); }\n\n\t\tvoid intArr(int sz, int[] x) { for (int i = 0; i < sz; i++) x[i] = nextInt(); }\n\t\tvoid longArr(int sz, long[] x) { for (int i = 0; i < sz; i++) x[i] = nextLong(); }\n\t\tvoid doubleArr(int sz, double[] x) { for (int i = 0; i < sz; i++) x[i] = nextDouble(); }\n\t}\n}\n\n", "lang_cluster": "Java", "tags": ["math", "trees", "dp", "graphs", "number theory"], "code_uid": "d40ba5aca01b3ec52470b532c4ecc819", "src_uid": "40002052843ca0357dbd3158b16d59f4", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class f {\n public static FS sc;\n public static PrintWriter out;\n public static ArrayList<Integer>[] adj;\n public static int n;\n \n public static HashMap<Long, Long> memo, memoSize;\n \n public static void main(String[] Args) throws Exception {\n sc = new FS(System.in);\n out=new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n int n = sc.nextInt();\n int MAX =5010;\n int[][] dist = new int[MAX][MAX];\n \n BIT bi = new BIT(MAX);\n int[] primes = new int[MAX];\n int[] factDivs = new int[MAX];\n int[] valDivs = new int[MAX];\n Arrays.fill(primes, 1);\n for (int i = 2; i < MAX; i++){\n if (primes[i] == 1){\n for (int j = i * 2; j < MAX; j+=i)\n primes[j] = i;\n valDivs[i]=1;\n primes[i] = i;\n }else \n valDivs[i]=valDivs[i/primes[i]] + 1;\n factDivs[i] = factDivs[i-1] + valDivs[i];\n \n }/*\n for (int i = 0; i<10; i++)\n {\n System.out.println(primes[i] +\" \" +valDivs[i] +\" \" +factDivs[i]);\n }*/\n \n for (int i = 2; i < MAX; i++){\n int last = bi.sum(MAX-1) - bi.sum(primes[i]-1);\n int j = i - 1;\n dist[i][i] = factDivs[i];\n while (last != 0) {\n dist[i][j] = dist[j][i] = last;\n int last2 = dist[i-1][j-1];\n if (last > last2)\n last = last2;\n j--;\n }\n int ii = i;\n while (ii != 1) {\n bi.inc(primes[ii],1);\n ii /= primes[ii];\n }\n }/*\n for (int i = 1; i < 6; i++){\n for (int j = 1; j < 6;j++) {\n int actDist = factDivs[i] + factDivs[j] - dist[i][j]*2;\n System.out.print(actDist +\" \" );\n }\n System.out.println();\n }*/\n \n long[] count = new long[MAX];\n for (int i = 0; i<n; i++){\n int x = sc.nextInt();\n if (x == 0)\n x++;\n count[x]++;\n }\n long ans = Long.MAX_VALUE;\n for (int i = 1; i< MAX; i++){\n long tans = 0;\n for (int j = 1; j< MAX; j++){\n tans += count[j] * (factDivs[i] + factDivs[j] - dist[i][j]*2);\n }\n if(tans < ans)\n ans = tans;\n }\n out.println(ans);\n out.close();\n }\n public static class BIT {\n int n;\n int[] v;\n BIT(int N) { v = new int[n=N]; }\n int sum(int x) { return x<0?0:(v[x]+sum((x&(x+1))-1)); }\n void inc(int p, int x) { for(int i=p; i<n; i|=(i+1)) v[i]+=x; }\n }\n\n\n \n public static class FS {\n BufferedReader br;\n StringTokenizer st;\n FS(InputStream in) throws Exception {\n br = new BufferedReader(new InputStreamReader(in));\n st = new StringTokenizer(br.readLine());\n }\n String next() throws Exception {\n if(st.hasMoreTokens())\n return st.nextToken();\n st = new StringTokenizer(br.readLine());\n return next();\n }\n int nextInt() throws Exception {\n return Integer.parseInt(next());\n }\n long nextLong() throws Exception {\n return Long.parseLong(next());\n }\n double nextDouble() throws Exception {\n return Double.parseDouble(next());\n }\n }\n \n public class Pair implements Comparable<Pair> {\n int ind;\n long value;\n double value2;\n Pair(int ii, long vv) {\n ind=ii;value=vv;\n value2=0.0;\n }\n public int compareTo(Pair o) {\n if (o.value == value)\n return Double.compare(value2,o.value);\n return Long.compare(value, o.value);\n }\n }\n}", "lang_cluster": "Java", "tags": ["math", "trees", "dp", "graphs", "number theory"], "code_uid": "bfbee9cbd5c09d41b680a047692ccc4a", "src_uid": "40002052843ca0357dbd3158b16d59f4", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.Iterator;\nimport java.io.BufferedWriter;\nimport java.util.Collection;\nimport java.util.Random;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Jialin Ouyang (Jialin.Ouyang@gmail.com)\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n QuickScanner in = new QuickScanner(inputStream);\n QuickWriter out = new QuickWriter(outputStream);\n TaskD solver = new TaskD();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskD {\n static final IntModular MOD = new IntModular();\n int n;\n int m;\n int[] end1;\n int[] end2;\n int res;\n boolean[] visited;\n BidirectionalGraph graph;\n IntArrayList points;\n IntArrayList pointCounts;\n\n public void solve(int testNumber, QuickScanner in, QuickWriter out) {\n n = in.nextInt();\n m = in.nextInt();\n end1 = new int[m];\n end2 = new int[m];\n in.nextInts(m, end1, end2);\n initPoints();\n initGraph();\n res = 0;\n visited = new boolean[points.size];\n for (int i = 0; i < points.size; ++i) {\n res = MOD.add(res, MOD.mul(pointCounts.get(i), dfs(i)));\n }\n out.println(res);\n }\n\n int dfs(int u) {\n visited[u] = true;\n int res = pointCounts.get(u);\n for (int v : graph.outNodes(u))\n if (!visited[v]) {\n res = MOD.add(res, dfs(v));\n }\n visited[u] = false;\n return res;\n }\n\n void initGraph() {\n graph = new BidirectionalGraph(points.size, points.size + m);\n points.forEach((point) -> {\n if (point > 1) {\n graph.add(points.lowerBound(point), points.lowerBound(point >> 1));\n }\n });\n for (int i = 0; i < m; ++i) {\n graph.add(points.lowerBound(end1[i]), points.lowerBound(end2[i]));\n }\n }\n\n void initPoints() {\n points = new IntArrayList();\n for (int i = 0; i < m; ++i) {\n addKeyPoints(end1[i]);\n addKeyPoints(end2[i]);\n }\n points.sortAndUnique();\n if (points.isEmpty()) {\n points.add(1);\n }\n pointCounts = new IntArrayList(points.size);\n for (int point : points) {\n int cnt = 1;\n if (!points.binarySearch(point << 1)) {\n cnt += calcSubtree(point << 1);\n }\n if (!points.binarySearch((point << 1) | 1)) {\n cnt += calcSubtree((point << 1) | 1);\n }\n pointCounts.add(cnt);\n }\n }\n\n int calcSubtree(int x) {\n int lower = x, upper = x;\n int res = 0;\n for (; lower <= n; lower <<= 1, upper = (upper << 1) | 1) {\n res += Math.min(n, upper) - lower + 1;\n if (n <= upper) break;\n }\n return res;\n }\n\n void addKeyPoints(int x) {\n for (; x > 0; x >>= 1) points.add(x);\n }\n\n }\n\n static abstract class AbstractBidirectionalGraph extends AbstractDirectedGraph implements BidirectionalGraphInterface {\n public AbstractBidirectionalGraph() {\n super();\n }\n\n public AbstractBidirectionalGraph(int vertexCapacity, int edgeCapacity) {\n super(vertexCapacity, edgeCapacity << 1);\n }\n\n public AbstractBidirectionalGraph(int vertexCapacity, int edgeCapacity, boolean initialize) {\n super(vertexCapacity, edgeCapacity << 1, initialize);\n }\n\n\n public void add(int u, int v) {\n super.add(u, v);\n super.add(v, u);\n }\n\n }\n\n static class QuickWriter {\n private final PrintWriter writer;\n\n public QuickWriter(OutputStream outputStream) {\n this.writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public QuickWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void print(Object... objects) {\n for (int i = 0; i < objects.length; ++i) {\n if (i > 0) {\n writer.print(' ');\n }\n writer.print(objects[i]);\n }\n }\n\n public void println(Object... objects) {\n print(objects);\n writer.println();\n }\n\n public void close() {\n writer.close();\n }\n\n }\n\n static final class BidirectionalGraph extends AbstractBidirectionalGraph {\n public BidirectionalGraph() {\n super();\n }\n\n public BidirectionalGraph(int vertexCapacity, int edgeCapacity) {\n super(vertexCapacity, edgeCapacity);\n }\n\n\n public void createVertexStorage(int vertexCapacity) {\n }\n\n\n public void expandEdgeStorage(int edgeCapacity) {\n }\n\n\n public void initVertexStorage(int vertexCnt) {\n }\n\n }\n\n static class QuickScanner {\n private static final int BUFFER_SIZE = 1024;\n private InputStream stream;\n private byte[] buffer;\n private int currentPosition;\n private int numberOfChars;\n\n public QuickScanner(InputStream stream) {\n this.stream = stream;\n this.buffer = new byte[BUFFER_SIZE];\n this.currentPosition = 0;\n this.numberOfChars = 0;\n }\n\n public int nextInt() {\n int c = nextNonSpaceChar();\n boolean positive = true;\n if (c == '-') {\n positive = false;\n c = nextChar();\n }\n int res = 0;\n do {\n if (c < '0' || '9' < c) throw new RuntimeException();\n res = res * 10 + (c - '0');\n c = nextChar();\n } while (!isSpaceChar(c));\n return positive ? res : -res;\n }\n\n public void nextInts(int n, int[]... res) {\n int m = res.length;\n for (int i = 0; i < n; ++i)\n for (int j = 0; j < m; ++j) {\n res[j][i] = nextInt();\n }\n }\n\n public int nextNonSpaceChar() {\n int res = nextChar();\n for (; isSpaceChar(res) || res < 0; res = nextChar()) ;\n return res;\n }\n\n public int nextChar() {\n if (numberOfChars == -1) {\n throw new RuntimeException();\n }\n if (currentPosition >= numberOfChars) {\n currentPosition = 0;\n try {\n numberOfChars = stream.read(buffer);\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n if (numberOfChars <= 0) {\n return -1;\n }\n }\n return buffer[currentPosition++];\n }\n\n public boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\t' || isEndOfLineChar(c);\n }\n\n public boolean isEndOfLineChar(int c) {\n return c == '\\n' || c == '\\r' || c < 0;\n }\n\n }\n\n static interface IntCollection {\n int size();\n\n default boolean isEmpty() {\n return size() == 0;\n }\n\n }\n\n static class IntArrayList implements Displayable, IntCollection, Iterable<Integer> {\n private static final int[] EMPTY = {};\n public int[] values;\n public int size;\n\n public IntArrayList() {\n values = EMPTY;\n clear();\n }\n\n public IntArrayList(int capacity) {\n values = new int[IntUtils.nextPow2(capacity)];\n clear();\n }\n\n public IntArrayList(Collection<Integer> collection) {\n this(collection.size());\n addAll(collection);\n }\n\n\n public void clear() {\n size = 0;\n }\n\n\n public int size() {\n return size;\n }\n\n\n public void add(int value) {\n ensureCapacity(size + 1);\n addInternal(value);\n }\n\n\n public void addAll(Collection<Integer> values) {\n ensureCapacity(size + values.size());\n for (int value : values) {\n addInternal(value);\n }\n }\n\n public int get(int idx) {\n if (idx >= size) throw new ArrayIndexOutOfBoundsException();\n return values[idx];\n }\n\n public void sort() {\n IntArrayUtils.sort(values, 0, size);\n }\n\n public void unique() {\n size = IntArrayUtils.unique(values, 0, size);\n }\n\n public void sortAndUnique() {\n sort();\n unique();\n }\n\n public int lowerBound(int value) {\n return IntArrayUtils.lowerBound(values, 0, size, value);\n }\n\n public boolean binarySearch(int value) {\n int idx = lowerBound(value);\n return idx < size && get(idx) == value;\n }\n\n public void ensureCapacity(int capacity) {\n if (capacity <= values.length) return;\n int[] newValues = new int[IntUtils.nextPow2(capacity)];\n for (int i = 0; i < size; ++i) {\n newValues[i] = values[i];\n }\n values = newValues;\n }\n\n\n public Iterator<Integer> iterator() {\n return new Iterator<Integer>() {\n private int i = 0;\n\n\n public boolean hasNext() {\n return i < size;\n }\n\n\n public Integer next() {\n return values[i++];\n }\n };\n }\n\n private void addInternal(int value) {\n values[size++] = value;\n }\n\n }\n\n static class IntArrayUtils {\n private static final Random RANDOM = new Random(1000000007);\n\n public static int unique(int[] values, int fromIdx, int toIdx) {\n if (fromIdx == toIdx) return 0;\n int res = 1;\n for (int i = fromIdx + 1; i < toIdx; ++i) {\n if (values[i - 1] != values[i]) {\n values[fromIdx + res++] = values[i];\n }\n }\n return res;\n }\n\n public static void sort(int[] values, int fromIdx, int toIdx) {\n shuffle(values, fromIdx, toIdx);\n Arrays.sort(values, fromIdx, toIdx);\n }\n\n public static int lowerBound(int[] values, int fromIdx, int toIdx, int value) {\n int res = toIdx;\n for (int lower = fromIdx, upper = toIdx - 1; lower <= upper; ) {\n int medium = (lower + upper) >> 1;\n if (value <= values[medium]) {\n res = medium;\n upper = medium - 1;\n } else {\n lower = medium + 1;\n }\n }\n return res;\n }\n\n public static void swap(int[] values, int uIdx, int vIdx) {\n if (uIdx == vIdx) return;\n values[uIdx] ^= values[vIdx];\n values[vIdx] ^= values[uIdx];\n values[uIdx] ^= values[vIdx];\n }\n\n public static void shuffle(int[] values, int fromIdx, int toIdx) {\n for (int i = toIdx - fromIdx - 1; i > 0; --i) {\n swap(values, i + fromIdx, RANDOM.nextInt(i + 1) + fromIdx);\n }\n }\n\n public static int[] expand(int[] values, int newLength) {\n if (values != null && values.length >= newLength) return values;\n int[] res = new int[newLength];\n if (values == null) return res;\n for (int i = 0; i < values.length; ++i) res[i] = values[i];\n return res;\n }\n\n }\n\n static class IntUtils {\n public static boolean isPow2(int n) {\n return n > 0 && (n & (n - 1)) == 0;\n }\n\n public static int nextPow2(int n) {\n if (n < 1) return 1;\n return isPow2(n) ? n : Integer.highestOneBit(n) << 1;\n }\n\n }\n\n static interface DirectedGraphInterface {\n }\n\n static interface Displayable {\n }\n\n static abstract class AbstractDirectedGraph implements DirectedGraphInterface {\n protected int vertexCnt;\n protected int currentEdgeCnt;\n protected int[] fromIdx;\n protected int[] toIdx;\n protected int[] nextIn;\n protected int[] nextOut;\n protected int[] lastIn;\n protected int[] lastOut;\n protected int[] inDegree;\n protected int[] outDegree;\n\n public abstract void createVertexStorage(int vertexCapacity);\n\n public abstract void expandEdgeStorage(int edgeCapacity);\n\n public abstract void initVertexStorage(int vertexCnt);\n\n public AbstractDirectedGraph() {\n }\n\n public AbstractDirectedGraph(int vertexCapacity, int edgeCapacity) {\n this(vertexCapacity, edgeCapacity, true);\n }\n\n public AbstractDirectedGraph(int vertexCapacity, int edgeCapacity, boolean initialize) {\n ensureVertexCapacity(vertexCapacity);\n ensureEdgeCapacity(edgeCapacity);\n if (initialize) init(vertexCapacity);\n }\n\n\n public void init(int vertexCnt) {\n ensureVertexCapacity(vertexCnt);\n this.vertexCnt = vertexCnt;\n currentEdgeCnt = 0;\n Arrays.fill(inDegree, 0, vertexCnt, 0);\n Arrays.fill(outDegree, 0, vertexCnt, 0);\n Arrays.fill(lastIn, 0, vertexCnt, -1);\n Arrays.fill(lastOut, 0, vertexCnt, -1);\n initVertexStorage(vertexCnt);\n }\n\n\n public void add(int fromIdx, int toIdx) {\n ensureEdgeCapacity(currentEdgeCnt + 1);\n this.fromIdx[currentEdgeCnt] = fromIdx;\n this.toIdx[currentEdgeCnt] = toIdx;\n ++outDegree[fromIdx];\n ++inDegree[toIdx];\n nextOut[currentEdgeCnt] = lastOut[fromIdx];\n lastOut[fromIdx] = currentEdgeCnt;\n nextIn[currentEdgeCnt] = lastIn[toIdx];\n lastIn[toIdx] = currentEdgeCnt;\n ++currentEdgeCnt;\n }\n\n\n public int nextOut(int edgeIdx) {\n return nextOut[edgeIdx];\n }\n\n\n public Iterable<Integer> outNodes(int nodeIdx) {\n return () -> new Iterator<Integer>() {\n private int edgeIdx = lastOut[nodeIdx];\n\n\n public boolean hasNext() {\n return edgeIdx >= 0;\n }\n\n\n public Integer next() {\n int res = toIdx[edgeIdx];\n edgeIdx = nextOut(edgeIdx);\n return res;\n }\n };\n }\n\n private void ensureVertexCapacity(int vertexCapacity) {\n if (lastIn != null && lastIn.length >= vertexCapacity) return;\n int capacity = IntUtils.nextPow2(vertexCapacity);\n lastIn = new int[capacity];\n lastOut = new int[capacity];\n inDegree = new int[capacity];\n outDegree = new int[capacity];\n createVertexStorage(capacity);\n }\n\n private void ensureEdgeCapacity(int edgeCapacity) {\n if (fromIdx != null && fromIdx.length >= edgeCapacity) return;\n int capacity = IntUtils.nextPow2(edgeCapacity);\n fromIdx = IntArrayUtils.expand(fromIdx, capacity);\n toIdx = IntArrayUtils.expand(toIdx, capacity);\n nextIn = IntArrayUtils.expand(nextIn, capacity);\n nextOut = IntArrayUtils.expand(nextOut, capacity);\n expandEdgeStorage(capacity);\n }\n\n }\n\n static interface BidirectionalGraphInterface extends DirectedGraphInterface {\n }\n\n static class IntModular {\n private static final int MOD = 1000000007;\n public final int mod;\n private final int[] x;\n\n public IntModular() {\n this(MOD);\n }\n\n public IntModular(int mod) {\n this.mod = mod;\n this.x = new int[2];\n }\n\n public int add(int a, int b) {\n return fix(a + b);\n }\n\n public int fix(int a) {\n a = slightFix(a);\n return 0 <= a && a < mod ? a : slightFix(a % mod);\n }\n\n public int mul(int a, int b) {\n return a > 0\n ? (b < mod / a ? a * b : (int) ((long) a * b % mod))\n : 0;\n }\n\n private int slightFix(int a) {\n return a >= mod\n ? a - mod\n : a < 0 ? a + mod : a;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["dfs and similar", "graphs", "brute force"], "code_uid": "7b27179eff326993c67b06a7c0a755e6", "src_uid": "250314325e3d088ceedaba7dcde762f1", "difficulty": 2800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.*;\n\n/**\n * @author Don Li\n */\npublic class TheOverdosingUbiquity {\n \n int N = 300;\n int MOD = (int) 1e9 + 7;\n \n Map<Integer, Integer> map = new HashMap<>();\n \n int[] num = new int[N];\n List<Integer>[] G = new List[N];\n \n int tot = 0;\n boolean[] vis = new boolean[N];\n \n void solve() {\n int n = in.nextInt(), m = in.nextInt();\n int[] fr = new int[m], to = new int[m];\n for (int i = 0; i < m; i++) {\n fr[i] = in.nextInt();\n to[i] = in.nextInt();\n }\n \n int d = 0;\n while ((1 << d) <= n) d++;\n \n getId(1);\n for (int i = 0; i < m; i++) {\n int u = fr[i];\n while (u > 0) {\n getId(u);\n u >>= 1;\n }\n u = to[i];\n while (u > 0) {\n getId(u);\n u >>= 1;\n }\n }\n \n for (int i = 0; i < N; i++) G[i] = new ArrayList<>();\n for (int u : map.keySet()) {\n int id = map.get(u);\n if (u > 1) {\n addEdge(getId(u), getId(u >> 1));\n }\n num[id] = calcSize(u, n, d);\n }\n \n dfs(0, -1);\n \n for (int i = 0; i < m; i++) {\n addEdge(getId(fr[i]), getId(to[i]));\n }\n \n int res = 0;\n for (int i = 0; i < map.size(); i++) {\n tot = 0;\n dfs(i);\n res = (int) ((res + (long) tot * num[i] % MOD) % MOD);\n }\n out.println(res);\n }\n \n int getId(int x) {\n if (!map.containsKey(x)) map.put(x, map.size());\n return map.get(x);\n }\n \n void addEdge(int u, int v) {\n G[u].add(v);\n G[v].add(u);\n }\n \n int calcSize(int u, int n, int d) {\n int t = u, c = 0;\n while (t > 0) {\n c++;\n t >>= 1;\n }\n int sz = (1 << (d - c + 1)) - 1;\n t = c;\n while (t < d) {\n t++;\n u = u << 1 | 1;\n }\n return sz - Math.max(0, Math.min(u - n, 1 << (d - c))); \n }\n \n void dfs(int u, int p) {\n for (int v : G[u]) {\n if (v != p) {\n num[u] -= num[v];\n dfs(v, u);\n }\n }\n }\n \n void dfs(int u) {\n tot = (tot + num[u]) % MOD;\n vis[u] = true;\n for (int v : G[u]) {\n if (!vis[v]) dfs(v);\n }\n vis[u] = false;\n }\n \n public static void main(String[] args) {\n in = new FastScanner(new BufferedReader(new InputStreamReader(System.in)));\n out = new PrintWriter(System.out);\n new TheOverdosingUbiquity().solve();\n out.close();\n }\n \n static FastScanner in;\n static PrintWriter out;\n \n static class FastScanner {\n BufferedReader in;\n StringTokenizer st;\n \n public FastScanner(BufferedReader in) {\n this.in = in;\n }\n \n public String nextToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(in.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n \n public int nextInt() {\n return Integer.parseInt(nextToken());\n }\n \n public long nextLong() {\n return Long.parseLong(nextToken());\n }\n \n public double nextDouble() {\n return Double.parseDouble(nextToken());\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "graphs", "brute force"], "code_uid": "5eb502f9e15c5ffecb758d01bd7a8f62", "src_uid": "250314325e3d088ceedaba7dcde762f1", "difficulty": 2800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class MainD {\n\tstatic final StdIn in = new StdIn();\n\tstatic final PrintWriter out = new PrintWriter(System.out);\n\tstatic final long M=(long)1e9+7;\n\tstatic int n=in.nextInt(), m=in.nextInt();\n\tstatic Map<Integer, Node> graph = new HashMap<Integer, Node>();\n\t\n\tpublic static void main(String[] args) {\n\t\taddNode(1);\n\t\tfor(int i=0; i<m; ++i) {\n\t\t\tint u=in.nextInt(), v=in.nextInt();\n\t\t\taddNode(u).adj.add(v);\n\t\t\taddNode(v).adj.add(u);\n\t\t}\n\t\tfor(Map.Entry<Integer, Node> nodeEntry : graph.entrySet()) {\n\t\t\tNode u=nodeEntry.getValue();\n\t\t\tfor(int i=u.adj.size()-1; i>=0; --i) {\n\t\t\t\tif(!graph.containsKey(u.adj.get(i))) {\n\t\t\t\t\tu.s+=sts(u.adj.get(i));\n\t\t\t\t\tu.adj.remove(i);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tlong ans=0;\n\t\tfor(Map.Entry<Integer, Node> nodeEntry : graph.entrySet())\n\t\t\tans=(dfs(nodeEntry.getKey(), 0)+ans)%M;\n\t\tout.println(ans);\n\t\tout.close();\n\t}\n\t\n\tstatic Node addNode(int u) {\n\t\tif(u<=0)\n\t\t\treturn null;\n\t\tNode node = graph.get(u);\n\t\tif(node!=null)\n\t\t\treturn node;\n\t\tnode = new Node();\n\t\tif(u>1)\n\t\t\tnode.adj.add(u/2);\n\t\tif(u*2<=n)\n\t\t\tnode.adj.add(u*2);\n\t\tif(u*2+1<=n)\n\t\t\tnode.adj.add(u*2+1);\n\t\tgraph.put(u, node);\n\t\taddNode(u/2);\n\t\treturn node;\n\t}\n\t\n\tstatic long sts(int u) {\n\t\tlong res=0;\n\t\tint l=u, r=u;\n\t\twhile(r<=n) {\n\t\t\tres+=r-l+1;\n\t\t\tl=2*l;\n\t\t\tr=2*r+1;\n\t\t}\n\t\treturn (res+Math.min(r, n)-Math.min(l, n+1)+1)%M;\n\t}\n\t\n\tstatic long dfs(int u, long ps) {\n\t\tNode node=graph.get(u);\n\t\tif(ps==0)\n\t\t\tps=node.s;\n\t\tnode.active=true;\n\t\tlong res=ps*node.s;\n\t\tfor(int v : node.adj)\n\t\t\tif(!graph.get(v).active)\n\t\t\t\tres+=dfs(v, ps);\n\t\tnode.active=false;\n\t\treturn res;\n\t}\n\t\n\tstatic class Node {\n\t\tList<Integer> adj = new ArrayList<Integer>();\n\t\tlong s=1;\n\t\tboolean active;\n\t}\n\t\n\tinterface Input {\n\t\tpublic String next();\n\t\tpublic String nextLine();\n\t\tpublic int nextInt();\n\t\tpublic long nextLong();\n\t\tpublic double nextDouble();\n\t}\n\tstatic class StdIn implements Input {\n\t\tfinal private int BUFFER_SIZE = 1 << 16;\n\t\tprivate DataInputStream din;\n\t\tprivate byte[] buffer;\n\t\tprivate int bufferPointer, bytesRead;\n\t\tpublic StdIn() {\n\t\t\tdin = new DataInputStream(System.in);\n\t\t\tbuffer = new byte[BUFFER_SIZE];\n\t\t\tbufferPointer = bytesRead = 0;\n\t\t}\n\t\tpublic StdIn(InputStream in) {\n\t\t\ttry{\n\t\t\t\tdin = new DataInputStream(in);\n\t\t\t} catch(Exception e) {\n\t\t\t\tthrow new RuntimeException();\n\t\t\t}\n\t\t\tbuffer = new byte[BUFFER_SIZE];\n\t\t\tbufferPointer = bytesRead = 0;\n\t\t}\n\t\tpublic String next() {\n\t\t\tint c;\n\t\t\twhile((c=read())!=-1&&(c==' '||c=='\\n'||c=='\\r'));\n\t\t\tStringBuilder s = new StringBuilder();\n\t\t\twhile (c != -1)\n\t\t\t{\n\t\t\t\tif (c == ' ' || c == '\\n'||c=='\\r')\n\t\t\t\t\tbreak;\n\t\t\t\ts.append((char)c);\n\t\t\t\tc=read();\n\t\t\t}\n\t\t\treturn s.toString();\n\t\t}\n\t\tpublic String nextLine() {\n\t\t\tint c;\n\t\t\twhile((c=read())!=-1&&(c==' '||c=='\\n'||c=='\\r'));\n\t\t\tStringBuilder s = new StringBuilder();\n\t\t\twhile (c != -1)\n\t\t\t{\n\t\t\t\tif (c == '\\n'||c=='\\r')\n\t\t\t\t\tbreak;\n\t\t\t\ts.append((char)c);\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\treturn s.toString();\n\t\t}\n\t\tpublic int nextInt() {\n\t\t\tint ret = 0;\n\t\t\tbyte c = read();\n\t\t\twhile (c <= ' ')\n\t\t\t\tc = read();\n\t\t\tboolean neg = (c == '-');\n\t\t\tif (neg)\n\t\t\t\tc = read();\n\t\t\tdo\n\t\t\t\tret = ret * 10 + c - '0';\n\t\t\twhile ((c = read()) >= '0' && c <= '9');\n\n\t\t\tif (neg)\n\t\t\t\treturn -ret;\n\t\t\treturn ret;\n\t\t}\n\t\tpublic int[] readIntArray(int n) {\n\t\t\tint[] ar = new int[n];\n\t\t\tfor(int i=0; i<n; ++i)\n\t\t\t\tar[i]=nextInt();\n\t\t\treturn ar;\n\t\t}\n\t\tpublic long nextLong() {\n\t\t\tlong ret = 0;\n\t\t\tbyte c = read();\n\t\t\twhile (c <= ' ')\n\t\t\t\tc = read();\n\t\t\tboolean neg = (c == '-');\n\t\t\tif (neg)\n\t\t\t\tc = read();\n\t\t\tdo\n\t\t\t\tret = ret * 10 + c - '0';\n\t\t\twhile ((c = read()) >= '0' && c <= '9');\n\t\t\tif (neg)\n\t\t\t\treturn -ret;\n\t\t\treturn ret;\n\t\t}\n\t\tpublic long[] readLongArray(int n) {\n\t\t\tlong[] ar = new long[n];\n\t\t\tfor(int i=0; i<n; ++i)\n\t\t\t\tar[i]=nextLong();\n\t\t\treturn ar;\n\t\t}\n\t\tpublic double nextDouble() {\n\t\t\tdouble ret = 0, div = 1;\n\t\t\tbyte c = read();\n\t\t\twhile (c <= ' ')\n\t\t\t\tc = read();\n\t\t\tboolean neg = (c == '-');\n\t\t\tif (neg)\n\t\t\t\tc = read();\n\t\t\tdo\n\t\t\t\tret = ret * 10 + c - '0';\n\t\t\twhile ((c = read()) >= '0' && c <= '9');\n\t\t\tif (c == '.')\n\t\t\t\twhile ((c = read()) >= '0' && c <= '9')\n\t\t\t\t\tret += (c - '0') / (div *= 10);\n\t\t\tif (neg)\n\t\t\t\treturn -ret;\n\t\t\treturn ret;\n\t\t}\n\t\tprivate void fillBuffer() throws IOException {\n\t\t\tbytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n\t\t\tif (bytesRead == -1)\n\t\t\t\tbuffer[0] = -1;\n\t\t}\n\t\tprivate byte read() {\n\t\t\ttry{\n\t\t\t\tif (bufferPointer == bytesRead)\n\t\t\t\t\tfillBuffer();\n\t\t\t\treturn buffer[bufferPointer++];\n\t\t\t} catch(IOException e) {\n\t\t\t\tthrow new RuntimeException();\n\t\t\t}\n\t\t}\n\t\tpublic void close() throws IOException {\n\t\t\tif (din == null)\n\t\t\t\treturn;\n\t\t\tdin.close();\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["dfs and similar", "graphs", "brute force"], "code_uid": "981dd396dd7cd7bb5c7cf702cf003aa8", "src_uid": "250314325e3d088ceedaba7dcde762f1", "difficulty": 2800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package round439;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class D {\n\tInputStream is;\n\tPrintWriter out;\n//\tString INPUT = \"3 1 2 3\";\n//\tString INPUT = \"2 1 1 2\";\n//\tString INPUT = \"4 1 2 3\";\n//\tString INPUT = \"5 1 4 5\";\n//\tString INPUT = \"5 1 3 5\";\n//\tString INPUT = \"4 1 1 3\";\n//\tString INPUT = \"4 2\\r\\n\" + \n//\t\t\t\"2 3 1 2 \";\n//\tString INPUT = \"4 2\\r\\n\" + \n//\t\t\t\"2 4 1 4 \";\n\tString INPUT = \"\";\n\t\n\t// A1 A2 A3 ...\n\t// A0 An\n\t// A0*(A1+...+An)\n\t// A1*(A2+...+An)\n\t// ((A0+..+An)^2-A0^2-..-An^2)/2\n\t\n\tvoid solve()\n\t{\n\t\tint n = ni(), m = ni();\n\t\tint[][] ps = new int[m][];\n\t\tfor(int i = 0;i < m;i++){\n\t\t\tps[i] = na(2);\n\t\t}\n//\t\tfor(int i = 1;i <= n;i++)tr(i, n, count(i,n));\n\t\tint mod = 1000000007;\n\t\tlong ans = (long)n*n % mod;\n\t\tfor(int i = 1;i < 1<<m;i++){\n\t\t\tint[] inds = new int[Integer.bitCount(i)];\n\t\t\tint p = 0;\n\t\t\tfor(int j = 0;j < m;j++){\n\t\t\t\tif(i<<~j<0)inds[p++] = j;\n\t\t\t}\n\t\t\tint o = Integer.bitCount(i);\n\t\t\tdo{\n\t\t\t\t// 0:0->1, 1:1->0\n\t\t\t\tfor(int ptn = 0;ptn < 1<<o;ptn++){\n\t\t\t\t\tans += go(inds, ptn, ps, n);\n\t\t\t\t\tans %= mod;\n//\t\t\t\t\ttr(\"ans\", i, inds, ptn, ans);\n\t\t\t\t}\n\t\t\t}while(nextPermutation(inds));\n\t\t}\n\t\tout.println(ans % mod);\n\t}\n\t\n\tlong go(int[] inds, int ptn, int[][] ps, int n)\n\t{\n\t\t// collide?\n\t\tint[][] paths = new int[2*(inds.length-1)][];\n\t\tint p = 0;\n\t\tfor(int i = 0;i < inds.length-1;i++){\n\t\t\tint f = ptn<<~i>=0 ? ps[inds[i]][1] : ps[inds[i]][0];\n\t\t\tint t = ptn<<~(i+1)>=0 ? ps[inds[i+1]][0] : ps[inds[i+1]][1];\n\t\t\tint lca = lca(f, t);\n\t\t\tpaths[p++] = new int[]{f, lca};\n\t\t\tif(lca != t){\n\t\t\t\tint clca = t/(Integer.highestOneBit(t)/Integer.highestOneBit(lca)/2);\n\t\t\t\tpaths[p++] = new int[]{t, clca};\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0;i < p;i++){\n\t\t\tfor(int j = i+1;j < p;j++){\n\t\t\t\tif(col(paths[i], paths[j]))return 0;\n\t\t\t}\n\t\t}\n//\t\ttr(\"UM\");\n\t\tint[] st = {\n\t\t\t\tptn<<~0>=0 ? ps[inds[0]][0] : ps[inds[0]][1],\n\t\t\t\tptn<<~(inds.length-1)>=0 ? ps[inds[inds.length-1]][1] : ps[inds[inds.length-1]][0]\n\t\t};\n\t\tif(st[0] == st[1])return 0;\n//\t\ttr(\"OK\", st);\n\t\tint[] tops = new int[2];\n\t\tfor(int j = 0;j < 2;j++){\n\t\t\tint top = 0;\n\t\t\tfor(int i = 0;i < p;i++){\n\t\t\t\tint lcad = lca(st[j], paths[i][0]);\n\t\t\t\tif(Integer.highestOneBit(lcad) >= Integer.highestOneBit(paths[i][1])){\n\t\t\t\t\ttop = Math.max(top, lcad);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(top == st[j])return 0; // collide\n\t\t\t\n\t\t\tif(top == 0){\n\t\t\t\ttop = 1;\n\t\t\t}else{\n\t\t\t\tint otop = top;\n\t\t\t\ttop = st[j] / (Integer.highestOneBit(st[j]) / Integer.highestOneBit(top) / 2);\n\t\t\t\tassert top / 2 == otop;\n\t\t\t}\n\t\t\ttops[j] = top;\n\t\t}\n//\t\ttr(st, tops);\n\t\tif(tops[0] == tops[1]){\n\t\t\treturn calc(tops[0], paths, p, n, st[0], st[1]);\n\t\t}else{\n\t\t\treturn (long)all(tops[0], paths, p, n, st[0]) * \n\t\t\t\t\tall(tops[1], paths, p, n, st[1]);\n\t\t}\n\t}\n\t\n\tint count(int x, int n)\n\t{\n\t\tint first = Integer.highestOneBit(n) / Integer.highestOneBit(x) * x;\n\t\tint last = Integer.highestOneBit(n) / Integer.highestOneBit(x) * (x+1);\n\t\tint base = Integer.highestOneBit(n) / Integer.highestOneBit(x) - 1;\n\t\treturn base + Math.max(0, Math.min(last-first, n-first+1));\n\t}\n\t\n\tint all(int top, int[][] paths, int p, int n, int tar)\n\t{\n\t\tint[] lroot = new int[p];\n\t\tint q = 0;\n\t\tfor(int i = 0;i < p;i++){\n\t\t\tint llca = lca(paths[i][1], tar);\n\t\t\tif(Integer.highestOneBit(llca) < Integer.highestOneBit(top))continue;\n\t\t\tlroot[q++] = paths[i][1];\n\t\t}\n\t\tboolean[] ng = new boolean[q];\n\t\tfor(int i = 0;i < q;i++){\n\t\t\tfor(int k = 0;k < q;k++){\n\t\t\t\tif(i == k)continue;\n\t\t\t\tif(lca(lroot[i], lroot[k]) == lroot[k]){\n\t\t\t\t\tng[i] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint all = count(top, n);\n\t\tfor(int i = 0;i < q;i++){\n\t\t\tif(!ng[i]){\n\t\t\t\tall -= count(lroot[i], n);\n\t\t\t}\n\t\t}\n\t\treturn all;\n\t}\n\t\n\tlong calc(int top, int[][] paths, int p, int n, int t1, int t2)\n\t{\n\t\tint[] lroot = new int[p];\n\t\tint q = 0;\n\t\tfor(int i = 0;i < p;i++){\n\t\t\tint llca = lca(paths[i][1], t1);\n\t\t\tif(Integer.highestOneBit(llca) < Integer.highestOneBit(top))continue;\n\t\t\tlroot[q++] = paths[i][1];\n\t\t}\n\t\tboolean[] ng = new boolean[q];\n\t\tfor(int i = 0;i < q;i++){\n\t\t\tfor(int k = 0;k < q;k++){\n\t\t\t\tif(i == k)continue;\n\t\t\t\tif(lca(lroot[i], lroot[k]) == lroot[k]){\n\t\t\t\t\tng[i] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint[] route = new int[100];\n\t\tint tl = lca(t1, t2);\n\t\tint r = 0;\n\t\tfor(int z = t1;z != tl;z /= 2){\n\t\t\troute[r++] = z;\n\t\t}\n\t\tint or = r;\n\t\tfor(int z = t2;z != tl;z /= 2){\n\t\t\troute[r++] = z;\n\t\t}\n\t\troute[r++] = tl;\n\t\tfor(int i = or, j = r-1;i < j;i++,j--){\n\t\t\tint d = route[i]; route[i] = route[j]; route[j] = d;\n\t\t}\n\t\troute = Arrays.copyOf(route, r);\n\t\tint[] has = new int[r];\n\t\tfor(int i = 0;i < r;i++){\n\t\t\thas[i] = count(route[i], n);\n\t\t}\n\t\tfor(int i = or-1;i >= 1;i--){\n\t\t\thas[i] -= has[i-1];\n\t\t}\n\t\tfor(int i = or+1;i < r-1;i++){\n\t\t\thas[i] -= has[i+1];\n\t\t}\n\t\tfor(int i = 0;i < q;i++){\n\t\t\tif(!ng[i] && lca(lroot[i], tl) == tl){\n\t\t\t\tint hit = lca(lroot[i], t1);\n\t\t\t\tif(hit == tl)hit = lca(lroot[i], t2);\n\t\t\t\tfor(int j = 0;j < r;j++){\n\t\t\t\t\tif(route[j] == hit){\n\t\t\t\t\t\thas[j] -= count(lroot[i], n);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(tl != t1 && tl != t2){\n\t\t\thas[or] = count(top, n) - count(tl, n) + 1;\n\t\t\t\n\t\t\tfor(int i = 0;i < q;i++){\n\t\t\t\tif(!ng[i] && lca(lroot[i], tl) != tl){\n\t\t\t\t\thas[or] -= count(lroot[i], n);\n\t\t\t\t}\n\t\t\t}\n\t\t}else{\n\t\t\tint tlch = route[or == 0 ? 1 : r - 2];\n\t\t\thas[or] = count(top, n) - count(tlch, n);\n\t\t\tfor(int i = 0;i < q;i++){\n\t\t\t\tif(!ng[i] && lca(lroot[i], tlch) != tlch){\n\t\t\t\t\thas[or] -= count(lroot[i], n);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n//\t\ttr(\"route\", route);\n//\t\ttr(\"has\", has, lroot);\n\t\tlong s1 = 0;\n\t\tlong s2 = 0;\n\t\tfor(int v : has){\n\t\t\ts1 += v;\n\t\t\ts2 += (long)v*v;\n\t\t}\n\t\treturn (s1*s1-s2)/2;\n\t}\n\t\n\tpublic static int lca(long x, long y)\n\t{\n\t\tlong xx = x<<Long.numberOfLeadingZeros(x);\n\t\tlong yy = y<<Long.numberOfLeadingZeros(y);\n\t\treturn (int)(x>>>Math.max(Long.numberOfLeadingZeros(Math.min(x, y)), 64-Long.numberOfLeadingZeros(xx^yy))-Long.numberOfLeadingZeros(x));\n\t}\n\t\n\tboolean col(int[] a, int[] b)\n\t{\n\t\tint l = lca(a[0], b[0]);\n\t\tif(Integer.highestOneBit(a[1]) <= Integer.highestOneBit(l) && Integer.highestOneBit(b[1]) <= Integer.highestOneBit(l)){\n\t\t\treturn true;\n\t\t}else{\n\t\t\treturn false;\n\t\t}\n\t}\n\t\n\tstatic boolean nextPermutation(int[] src) {\n\t\tint i;\n\t\tfor (i = src.length - 2; i >= 0 && src[i] > src[i + 1]; i--)\n\t\t\t;\n\t\tif (i == -1)\n\t\t\treturn false;\n\t\tint j;\n\t\tfor (j = i + 1; j < src.length && src[i] < src[j]; j++)\n\t\t\t;\n\t\tint d = src[i];\n\t\tsrc[i] = src[j - 1];\n\t\tsrc[j - 1] = d;\n\t\tfor (int p = i + 1, q = src.length - 1; p < q; p++, q--) {\n\t\t\td = src[p];\n\t\t\tsrc[p] = src[q];\n\t\t\tsrc[q] = d;\n\t\t}\n\t\treturn true;\n\t}\n\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new D().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "graphs", "brute force"], "code_uid": "38269b8cdd9ed8df154a655a0449c7f6", "src_uid": "250314325e3d088ceedaba7dcde762f1", "difficulty": 2800.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "\n\nimport java.math.BigInteger; \nimport java.util.*; \n\n\npublic class Main {\n\t\n\tstatic final int MOD = 1000000007; \n\n public static int count(int height,int width) { \n\n boolean[][] field = new boolean[height][width]; \n for (int i = 0; i < height / 2; ++i) { \n for (int j = 0; j < width / 2; ++j) { \n field[i * 2][j * 2] = false; \n field[i * 2][j * 2 + 1] = false; \n field[i * 2 + 1][j * 2] = false; \n field[i * 2 + 1][j * 2 + 1] = false; \n } \n } \n int[][][][] res = new int[2][2][width][width]; \n int totalRes = 0; \n for (int row = 0; row < height; ++row) { \n int[][][][] newRes = new int[2][2][width][width]; \n for (int firstDecreased = 0; firstDecreased < 2; ++firstDecreased) \n for (int lastDecreased = 0; lastDecreased < 2; ++lastDecreased) \n for (int firstCol = 0; firstCol < width; ++firstCol) \n for (int lastCol = firstCol; lastCol < width; ++lastCol) { \n int cur = res[firstDecreased][lastDecreased][firstCol][lastCol]; \n if (cur == 0) continue; \n for (int newFirstDecreased = firstDecreased; newFirstDecreased < 2; ++newFirstDecreased) \n for (int newLastDecreased = lastDecreased; newLastDecreased < 2; ++newLastDecreased) {\n int newFirstCol; \n if (newFirstDecreased == 0) \n newFirstCol = firstCol; \n else if (firstDecreased == 0) \n newFirstCol = firstCol + 1; \n else \n newFirstCol = firstCol; \n int newLastCol; \n if (newLastDecreased == 0) \n newLastCol = lastCol; \n else if (lastDecreased == 0) \n newLastCol = lastCol - 1; \n else \n newLastCol = lastCol; \n if (newFirstCol > newLastCol) \n continue; \n int[] arr = newRes[newFirstDecreased][newLastDecreased][newFirstCol]; \n arr[newLastCol] += cur; \n if (arr[newLastCol] >= MOD) arr[newLastCol] -= MOD; \n } \n } \n\n for (int firstDecreased = 0; firstDecreased < 2; ++firstDecreased) \n for (int lastDecreased = 0; lastDecreased < 2; ++lastDecreased) { \n int[][] arr = newRes[firstDecreased][lastDecreased]; \n if (firstDecreased == 0 && lastDecreased == 1) { \n { \n int lastDelta = lastDecreased == 0 ? 1 : -1; \n int lastMin = lastDelta == 1 ? 0 : width - 1; \n int lastMax = lastDelta == 1 ? width : -1; \n for (int lastCol = lastMin; lastCol != lastMax; lastCol += lastDelta) { \n for (int firstCol = 0; firstCol <= lastCol; ++firstCol) { \n int cur = arr[firstCol][lastCol]; \n if (cur == 0) continue; \n int newLastCol = lastCol + lastDelta; \n if (newLastCol >= firstCol && newLastCol < width) { \n arr[firstCol][newLastCol] += cur; \n if (arr[firstCol][newLastCol] >= MOD) arr[firstCol][newLastCol] -= MOD; \n } \n } \n } \n } \n { \n int firstDelta = firstDecreased == 0 ? -1 : 1; \n int firstMin = firstDelta == 1 ? 0 : width - 1; \n int firstMax = firstDelta == 1 ? width : -1; \n for (int firstCol = firstMin; firstCol != firstMax; firstCol += firstDelta) { \n for (int lastCol = firstCol; lastCol < width; ++lastCol) { \n int cur = arr[firstCol][lastCol]; \n if (cur == 0) continue; \n int newFirstCol = firstCol + firstDelta; \n if (newFirstCol >= 0 && newFirstCol <= lastCol) { \n arr[newFirstCol][lastCol] += cur; \n if (arr[newFirstCol][lastCol] >= MOD) arr[newFirstCol][lastCol] -= MOD; \n } \n } \n } \n } \n } else { \n { \n int firstDelta = firstDecreased == 0 ? -1 : 1; \n int firstMin = firstDelta == 1 ? 0 : width - 1; \n int firstMax = firstDelta == 1 ? width : -1; \n for (int firstCol = firstMin; firstCol != firstMax; firstCol += firstDelta) { \n for (int lastCol = firstCol; lastCol < width; ++lastCol) { \n int cur = arr[firstCol][lastCol]; \n if (cur == 0) continue; \n int newFirstCol = firstCol + firstDelta; \n if (newFirstCol >= 0 && newFirstCol <= lastCol) { \n arr[newFirstCol][lastCol] += cur; \n if (arr[newFirstCol][lastCol] >= MOD) arr[newFirstCol][lastCol] -= MOD; \n } \n } \n } \n } \n { \n int lastDelta = lastDecreased == 0 ? 1 : -1; \n int lastMin = lastDelta == 1 ? 0 : width - 1; \n int lastMax = lastDelta == 1 ? width : -1; \n for (int lastCol = lastMin; lastCol != lastMax; lastCol += lastDelta) { \n for (int firstCol = 0; firstCol <= lastCol; ++firstCol) { \n int cur = arr[firstCol][lastCol]; \n if (cur == 0) continue; \n int newLastCol = lastCol + lastDelta; \n if (newLastCol >= firstCol && newLastCol < width) { \n arr[firstCol][newLastCol] += cur; \n if (arr[firstCol][newLastCol] >= MOD) arr[firstCol][newLastCol] -= MOD; \n } \n } \n } \n } \n } \n } \n\n for (int firstCol = 0; firstCol < width; ++firstCol) { \n boolean ok = true; \n for (int lastCol = firstCol; lastCol < width; ++lastCol) { \n if (field[row][lastCol]) \n ok = false; \n if (!ok) { \n for (int firstDecreased = 0; firstDecreased < 2; ++firstDecreased) \n for (int lastDecreased = 0; lastDecreased < 2; ++lastDecreased) \n newRes[firstDecreased][lastDecreased][firstCol][lastCol] = 0; \n } else { \n newRes[0][0][firstCol][lastCol] += 1; \n if (newRes[0][0][firstCol][lastCol] >= MOD) newRes[0][0][firstCol][lastCol] -= MOD; \n } \n } \n } \n\n res = newRes; \n for (int firstDecreased = 0; firstDecreased < 2; ++firstDecreased) \n for (int lastDecreased = 0; lastDecreased < 2; ++lastDecreased) \n for (int firstCol = 0; firstCol < width; ++firstCol) \n for (int lastCol = firstCol; lastCol < width; ++lastCol) { \n totalRes += res[firstDecreased][lastDecreased][firstCol][lastCol]; \n if (totalRes >= MOD) totalRes -= MOD; \n } \n } \n return totalRes; \n } \n\tpublic static void main(String args[]){\n\t Scanner scan = new Scanner(System.in);\n\t int n=scan.nextInt();\n\t int m=scan.nextInt();\n\t System.out.println(count(n, m));\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "75e5c24d7355f23a872f66ca06bf2185", "src_uid": "740eceed59d3c6ac55c1bf9d3d4160c7", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\n// import java.io.FileInputStream;\n// import java.io.FileOutputStream;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Random;\nimport java.util.StringTokenizer;\n\nimport static java.lang.Math.abs;\nimport static java.lang.Math.max;\nimport static java.lang.Math.min;\nimport static java.lang.Math.round;\nimport static java.util.Arrays.copyOf;\nimport static java.util.Arrays.fill;\nimport static java.util.Arrays.sort;\nimport static java.util.Collections.reverseOrder;\nimport static java.util.Collections.sort;\nimport static java.util.Comparator.comparing;\n\npublic class Main {\n FastScanner in;\n PrintWriter out;\n\n int area(long ax, long ay, long bx, long by, long cx, long cy) {\n // удвоеная знаковая площадь треугольник abc; векторное произведение ab и ac\n long s = (bx - ax) * (cy - ay) - (by - ay) * (cx - ax);\n return s < 0 ? -1 : s > 0 ? 1 : 0;\n }\n\n private void solve() throws IOException {\n int n = in.nextInt();\n long[] x = new long[n], y = new long[n];\n for (int i = 0; i < n; i++) {\n x[i] = in.nextLong();\n y[i] = in.nextLong();\n }\n char[] s = in.next().toCharArray();\n boolean[] used = new boolean[n];\n\n int cur = 0;\n for (int i = 1; i < n; i++)\n if (y[i] < y[cur] || (y[i] == y[cur] && x[i] < x[cur]))\n cur = i;\n used[cur] = true;\n out.print(cur + 1 + \" \");\n\n for (int i = 0; i < n - 1; i++) {\n int next = -1;\n for (int j = 0; j < n; j++)\n if (!used[j] && (next == -1 || (s[i] == 'L' && area(x[cur], y[cur], x[next], y[next], x[j], y[j]) < 0) ||\n (s[i] == 'R' && area(x[cur], y[cur], x[next], y[next], x[j], y[j]) > 0)))\n next = j;\n cur = next;\n used[cur] = true;\n out.print(cur + 1 + \" \");\n }\n\n out.println();\n }\n\n class FastScanner {\n StringTokenizer st;\n BufferedReader br;\n\n FastScanner(InputStream s) {\n br = new BufferedReader(new InputStreamReader(s));\n }\n\n String next() throws IOException {\n while (st == null || !st.hasMoreTokens())\n st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n\n boolean hasNext() throws IOException {\n return br.ready() || (st != null && st.hasMoreTokens());\n }\n\n int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n\n String nextLine() throws IOException {\n return br.readLine();\n }\n\n boolean hasNextLine() throws IOException {\n return br.ready();\n }\n }\n\n private void run() throws IOException {\n in = new FastScanner(System.in); // new FastScanner(new FileInputStream(\".in\"));\n out = new PrintWriter(System.out); // new PrintWriter(new FileOutputStream(\".out\"));\n\n for (int t = 1; t-- > 0; )\n solve();\n\n out.flush();\n out.close();\n }\n\n public static void main(String[] args) throws IOException {\n new Main().run();\n }\n}", "lang_cluster": "Java", "tags": ["math", "geometry", "constructive algorithms"], "code_uid": "848b008a9e7f9079580932cb36fefea3", "src_uid": "13d7f6127a7fe945e19d461b584c6228", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));\n\t\tint n = in.nextInt();\n\t\tint x[] = new int[n], y[] = new int[n], t = 0;\n\t\tList<Integer> s = new ArrayList<Integer>();\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tx[i] = in.nextInt();\n\t\t\ty[i] = in.nextInt();\n\t\t\tif(x[i] < x[t])\n\t\t\t\tt = i;\n\t\t\ts.add(i);\n\t\t}\n\t\tSystem.out.print(t + 1 + \" \");\n\t\ts.remove(new Integer(t));\n\t\tString str = in.next();\n\t\tdouble ang = Math.PI / 2 - 1E-10;\n\t\tfor(int i = 0; i < str.length(); i++) {\n\t\t\tdouble m = 4;\n\t\t\tint im = -1, factor = (str.charAt(i) == 'L') ? 1 : -1;\n\t\t\tfor(int j : s) {\n\t\t\t\tdouble a = dif(Math.atan2(y[j] - y[t], x[j] - x[t]), ang) * factor;\n\t\t\t\tif(a < m) {\n\t\t\t\t\tm = a;\n\t\t\t\t\tim = j;\n\t\t\t\t}\n\t\t\t}\n\t\t\ts.remove(new Integer(im));\n\t\t\tang = Math.atan2(y[im] - y[t], x[im] - x[t]);\n\t\t\tt = im;\n\t\t\tSystem.out.print(t + 1 + \" \");\n\t\t}\n\t\tSystem.out.print(s.remove(0) + 1 + \" \");\n\t\tSystem.out.println();\n\t\tin.close();\n\n\t}\n\t\n\tprivate static double dif(double a1, double a2) {\n\t\tdouble d = a1 - a2;\n\t\twhile(d > Math.PI)\n\t\t\td -= 2 * Math.PI;\n\t\twhile(d < -Math.PI)\n\t\t\td += 2 * Math.PI;\n\t\treturn d;\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["math", "geometry", "constructive algorithms"], "code_uid": "254ffe3e1afd16e9eaea379b00afaafb", "src_uid": "13d7f6127a7fe945e19d461b584c6228", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import static java.lang.Double.parseDouble;\nimport static java.lang.Integer.parseInt;\nimport static java.lang.Long.parseLong;\nimport static java.lang.System.exit;\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\nimport java.math.BigInteger;\nimport java.util.StringTokenizer;\n\npublic class F {\n\n\tstatic BufferedReader in;\n\tstatic PrintWriter out;\n\tstatic StringTokenizer tok;\n\n\tstatic void solve() throws Exception {\n\t\tint n = nextInt();\n\t\tint d = nextInt();\n\t\tint mod = nextInt();\n\t\tif (n == 1) {\n\t\t\tout.print('1');\n\t\t\treturn;\n\t\t}\n\t\tint fracs[] = new int[d + 2];\n\t\tfor (int i = 1; i < fracs.length; i++) {\n\t\t\tfracs[i] = BigInteger.valueOf(i).modInverse(BigInteger.valueOf(mod)).intValue();\n\t\t}\n\t\tint maxsize = n;\n\t\tint cnts[] = new int[maxsize + 1];\n\t\tcnts[1] = 1;\n\t\tint cnts2[][][] = new int[maxsize + 1][d + 1][maxsize + 1];\n\t\tcnts2[0][0][1] = 1;\n\t\tfor (int lastsize = 0; lastsize < (n - 1) / 2; lastsize++) {\n\t\t\tint nlastsize = lastsize + 1;\n\t\t\tint ccnt = cnts[nlastsize];\n\t\t\tint ccnt2[][] = cnts2[lastsize];\n\t\t\tint ncnt2[][] = cnts2[nlastsize];\n\t\t\tfor (int ctrees = 0; ctrees <= d; ctrees++) {\n\t\t\t\tfor (int csize = 1; csize <= maxsize; csize++) {\n\t\t\t\t\tint cur = ccnt2[ctrees][csize];\n//\t\t\t\t\tif (cur != 0) {\n//\t\t\t\t\t\tSystem.err.println(csize + \" \" + ctrees + \" \" + lastsize + \" -> \" + cur);\n//\t\t\t\t\t}\n\t\t\t\t\tfor (int i = 0, ntrees = ctrees, nsize = csize;\n\t\t\t\t\t\tntrees <= d && nsize <= maxsize;\n\t\t\t\t\t\t++i, ++ntrees, nsize += nlastsize) {\n\t\t\t\t\t\tncnt2[ntrees][nsize] += cur;\n\t\t\t\t\t\tif (ncnt2[ntrees][nsize] >= mod) {\n\t\t\t\t\t\t\tncnt2[ntrees][nsize] -= mod;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcur = (int) ((long) cur * (ccnt + i) % mod * fracs[i + 1] % mod);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (nlastsize + 1 <= maxsize) {\n\t\t\t\tcnts[nlastsize + 1] = ncnt2[d - 1][nlastsize + 1];\n\t\t\t}\n\t\t}\n\t\tint ans = 0;\n\t\tif (n % 2 == 0) {\n\t\t\tans = (int) ((long) cnts[n / 2] * (cnts[n / 2] + 1) % mod * fracs[2] % mod);\n\t\t}\n\t\tans = (ans + cnts2[(n - 1) / 2][d][n]) % mod;\n\t\tout.print(ans);\n\t}\n\n\tstatic int nextInt() throws IOException {\n\t\treturn parseInt(next());\n\t}\n\n\tstatic long nextLong() throws IOException {\n\t\treturn parseLong(next());\n\t}\n\n\tstatic double nextDouble() throws IOException {\n\t\treturn parseDouble(next());\n\t}\n\n\tstatic String next() throws IOException {\n\t\twhile (tok == null || !tok.hasMoreTokens()) {\n\t\t\ttok = new StringTokenizer(in.readLine());\n\t\t}\n\t\treturn tok.nextToken();\n\t}\n\n\tpublic static void main(String[] args) {\n\t\ttry {\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(new OutputStreamWriter(System.out));\n\t\t\tsolve();\n\t\t\tin.close();\n\t\t\tout.close();\n\t\t} catch (Throwable e) {\n\t\t\te.printStackTrace();\n\t\t\texit(1);\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "trees"], "code_uid": "77293508628f9d6f501d201978a8ca97", "src_uid": "bdd0fc1d6dbab5eeb5aea135fdfffc9d", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import static java.lang.Double.parseDouble;\nimport static java.lang.Integer.parseInt;\nimport static java.lang.Long.parseLong;\nimport static java.lang.System.exit;\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\nimport java.math.BigInteger;\nimport java.util.StringTokenizer;\n\npublic class F {\n\n\tstatic BufferedReader in;\n\tstatic PrintWriter out;\n\tstatic StringTokenizer tok;\n\n\tstatic void solve() throws Exception {\n\t\tint n = nextInt();\n\t\tint d = nextInt();\n\t\tint mod = nextInt();\n\t\tif (n == 1) {\n\t\t\tout.print('1');\n\t\t\treturn;\n\t\t}\n\t\tint fracs[] = new int[d + 2];\n\t\tfor (int i = 1; i < fracs.length; i++) {\n\t\t\tfracs[i] = BigInteger.valueOf(i).modInverse(BigInteger.valueOf(mod)).intValue();\n\t\t}\n\t\tint maxsize = n;\n\t\tint cnts[] = new int[maxsize + 1];\n\t\tcnts[1] = 1;\n\t\tint cnts2[][][] = new int[maxsize + 1][d + 1][maxsize + 1];\n\t\tcnts2[0][0][1] = 1;\n\t\tfor (int lastsize = 0; lastsize < (n - 1) / 2; lastsize++) {\n\t\t\tint nlastsize = lastsize + 1;\n\t\t\tint ccnt = cnts[nlastsize];\n\t\t\tint ccnt2[][] = cnts2[lastsize];\n\t\t\tint ncnt2[][] = cnts2[nlastsize];\n\t\t\tfor (int ctrees = 0; ctrees <= d; ctrees++) {\n\t\t\t\tfor (int csize = 1; csize <= maxsize; csize++) {\n\t\t\t\t\tint cur = ccnt2[ctrees][csize];\n//\t\t\t\t\tif (cur != 0) {\n//\t\t\t\t\t\tSystem.err.println(csize + \" \" + ctrees + \" \" + lastsize + \" -> \" + cur);\n//\t\t\t\t\t}\n\t\t\t\t\tfor (int i = 0, ntrees = ctrees, nsize = csize;\n\t\t\t\t\t\tntrees <= d && nsize <= maxsize;\n\t\t\t\t\t\t++i, ++ntrees, nsize += nlastsize) {\n\t\t\t\t\t\tncnt2[ntrees][nsize] += cur;\n\t\t\t\t\t\tif (ncnt2[ntrees][nsize] >= mod) {\n\t\t\t\t\t\t\tncnt2[ntrees][nsize] -= mod;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcur = (int) ((long) cur * (ccnt + i) % mod * fracs[i + 1] % mod);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (nlastsize + 1 <= maxsize) {\n\t\t\t\tcnts[nlastsize + 1] = ncnt2[d - 1][nlastsize + 1];\n\t\t\t}\n\t\t}\n\t\tint ans = 0;\n\t\tif (n % 2 == 0) {\n\t\t\tans = (int) ((long) cnts[n / 2] * (cnts[n / 2] + 1) % mod * fracs[2] % mod);\n\t\t}\n\t\tans = (ans + cnts2[(n - 1) / 2][d][n]) % mod;\n\t\tout.print(ans);\n\t}\n\n\tstatic int nextInt() throws IOException {\n\t\treturn parseInt(next());\n\t}\n\n\tstatic long nextLong() throws IOException {\n\t\treturn parseLong(next());\n\t}\n\n\tstatic double nextDouble() throws IOException {\n\t\treturn parseDouble(next());\n\t}\n\n\tstatic String next() throws IOException {\n\t\twhile (tok == null || !tok.hasMoreTokens()) {\n\t\t\ttok = new StringTokenizer(in.readLine());\n\t\t}\n\t\treturn tok.nextToken();\n\t}\n\n\tpublic static void main(String[] args) {\n\t\ttry {\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(new OutputStreamWriter(System.out));\n\t\t\tsolve();\n\t\t\tin.close();\n\t\t\tout.close();\n\t\t} catch (Throwable e) {\n\t\t\te.printStackTrace();\n\t\t\texit(1);\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "trees"], "code_uid": "6a929fa91773e8526a00b3319bb287ea", "src_uid": "bdd0fc1d6dbab5eeb5aea135fdfffc9d", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.IOException;\nimport java.io.OutputStreamWriter;\nimport java.util.Arrays;\nimport java.io.BufferedWriter;\nimport java.util.InputMismatchException;\nimport java.util.ArrayList;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.Writer;\nimport java.util.Queue;\nimport java.util.LinkedList;\nimport java.util.Collection;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Ankit Srivastava\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInReader in = new InReader(inputStream);\n\t\tOutputWriter out = new OutputWriter(outputStream);\n\t\tTaskD solver = new TaskD();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskD {\n AhoCorasickDataStructure ds;\n int [][][] dp;\n String s1, s2;\n\n int go(int i, int j, int state) {\n if(dp[i][j][state] == -1) {\n dp[i][j][state] = -100000;\n if(!ds.found[state]) {\n if(i >= s1.length() || j >= s2.length()) dp[i][j][state] = 0;\n else {\n dp[i][j][state] = Math.max(go(i + 1, j, state), go(i, j + 1, state));\n if(s1.charAt(i) == s2.charAt(j))\n dp[i][j][state] = Math.max(dp[i][j][state], go(i + 1, j + 1, ds.trans[state][s1.charAt(i)- 'A']) + 1);\n }\n }\n }\n return dp[i][j][state];\n }\n\n public void solve(int testNumber, InReader in, OutputWriter out) {\n s1 = in.readString();\n s2 = in.readString();\n String virus = in.readString();\n ds = new AhoCorasickDataStructure(26, 'A');\n ds.add(virus, 0);\n ds.bfs();\n ds.makeTrans();\n dp = new int[s1.length() + 1][s2.length() + 1][virus.length() + 1];\n ArrayUtils.fill3d(dp, -1);\n\n /*for (int i = 0; i <= s1.length(); i++) {\n for (int j = 0; j <= s2.length(); j++) {\n for (int state = 0; state < virus.length(); state++) {\n if(i == 0 || j == 0 || ds.found[state]) {\n dp[i][j][state] = 0;\n continue;\n }\n dp[i][j][state] = Math.max(Math.max(dp[i - 1][j][state], dp[i][j - 1][state]), dp[i][j][state]);\n if(s1.charAt(i - 1) == s2.charAt(j - 1) && ds.trans[state][s1.charAt(i - 1) - 'A'] != virus.length()) {\n dp[i][j][ds.trans[state][s1.charAt(i - 1) - 'A']] = Math.max(dp[i - 1][j - 1][state] + 1, dp[i][j][ds.trans[state][s1.charAt(i - 1) - 'A']]);\n //System.out.println(\"updated \" + i + \" \"+ j + \" \"+ state + \" changed to \" + dp[i][j][ds.trans[state][s1.charAt(i - 1) - 'A']]);\n }\n }\n }\n }\n for (int i = 0; i < s1.length() + 1; i++) {\n System.out.println(Arrays.deepToString(dp[i]));\n } */\n int i = 0, j = 0, state = 0;\n ArrayList<Character> ans = new ArrayList<Character>();\n while (i < s1.length() && j < s2.length()) {\n if(go(i, j, state) == go(i + 1, j ,state)) i++;\n else if(go(i, j, state) == go(i, j + 1, state)) j++;\n else {\n ans.add(s1.charAt(i));\n state = ds.trans[state][s1.charAt(i) - 'A'];\n i++;\n j++;\n }\n }\n if(ans.size() == 0) out.printLine(0);\n else for(char c : ans) out.print(c);\n\n //System.out.println(dp[s1.length()][s2.length()]);\n }\n}\n\nclass AhoCorasickDataStructure {\n public int[][] trans;\n Node root;\n int stateCount;\n public boolean[] found;\n int alphabetSize;\n char zero;\n public int[] counts;\n int strCount;\n Node[] getNode;\n\n public AhoCorasickDataStructure(int size, char zero) {\n this.alphabetSize = size;\n this.zero = zero;\n root = new Node(' ');\n strCount = 0;\n }\n\n public void add(String s, int id) {\n Node node = root;\n for (int i = 0; i < s.length(); i++) {\n char c = s.charAt(i);\n int ind = c - zero;\n if (node.child[ind] == null) node.child[ind] = new Node(c);\n node.child[ind].parent = node;\n node = node.child[ind];\n }\n node.isEnd = true;\n node.endId = id;\n strCount++;\n //System.out.println(\"Add success\");\n }\n\n public void bfs() {\n counts = new int[strCount];\n root.fall = root;\n Queue<Node> queue = new LinkedList<Node>();\n stateCount = 0;\n queue.offer(root);\n while (!queue.isEmpty()) {\n Node v = queue.poll();\n\n v.state = stateCount++;\n for (Node child : v.child)\n if (child != null) queue.offer(child);\n if (v == root) continue;\n Node fall = v.parent.fall;\n while (fall.child[v.c - zero] == null && fall != root) fall = fall.fall;\n v.fall = fall.child[v.c - zero];\n if (v.fall == null || v.fall == v) v.fall = root;\n else {\n Node temp = fall.child[v.c - zero];\n if(temp.isEnd) {\n v.isEnd |= temp.isEnd;\n //v.endId = temp.endId;\n }\n }\n }\n //System.out.println(\"bfs success\");\n }\n\n public void makeTrans() {\n getNode = new Node[stateCount];\n trans = new int[stateCount][alphabetSize];\n found = new boolean[stateCount];\n Queue<Node> queue = new LinkedList<Node>();\n queue.offer(root);\n while(!queue.isEmpty()) {\n Node v = queue.poll();\n getNode[v.state] = v;\n if(v.isEnd) found[v.state] = true;\n for (int i = 0; i < v.child.length; i++) {\n Node node = v;\n if(v.child[i] != null) queue.offer(v.child[i]);\n while(node.child[i] == null && node != root) node = node.fall;\n if(node.child[i] != null) {\n trans[v.state][i] = node.child[i].state;\n }\n else trans[v.state][i] = root.state;\n }\n }\n\n\n }\n\n\n\n class Node {\n char c;\n Node[] child;\n boolean isEnd;\n Node parent;\n Node fall;\n int state;\n int endId;\n\n Node(char c) {\n this.c = c;\n child = new Node[alphabetSize];\n isEnd = false;\n parent = null;\n fall = null;\n endId = -1;\n }\n }\n}\n\nclass InReader {\n\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private SpaceCharFilter filter;\n\n public InReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public long readLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public String readString() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuffer res = new StringBuffer();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n}\n\nclass OutputWriter {\n\tprivate final PrintWriter writer;\n\n\tpublic OutputWriter(OutputStream outputStream) {\n\t\twriter = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n\t}\n\n\tpublic OutputWriter(Writer writer) {\n\t\tthis.writer = new PrintWriter(writer);\n\t}\n\n\tpublic void print(Object...objects) {\n\t\tfor (int i = 0; i < objects.length; i++) {\n\t\t\tif (i != 0)\n\t\t\t\twriter.print(' ');\n\t\t\twriter.print(objects[i]);\n\t\t}\n\t}\n\n\n public void printLine(Object...objects) {\n\t\tprint(objects);\n\t\twriter.println();\n\t}\n\n\tpublic void close() {\n\t\twriter.close();\n\t}\n\n}\n\nclass ArrayUtils {\n\n\tpublic static void fill2d(int [][] array, int value) {\n\t\tfor (int i = 0;i < array .length ;i++)\n\t\t\tArrays.fill(array [i], value);\n\t}\n\n\n\tpublic static void fill3d(int [][][] array ,int value) {\n\t\tfor(int i = 0;i < array .length ;i ++) {\n\t\t\tfill2d(array [i],value );\n\t\t}\n\t}\n\n }\n\n", "lang_cluster": "Java", "tags": ["strings", "dp"], "code_uid": "a1c934ce8a5384a41a3900491dc8cfe2", "src_uid": "391c2abbe862139733fcb997ba1629b8", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "// Coached by rainboy\n// https://codeforces.com/contest/1278/submission/67223059 (rainboy)\nimport java.io.*;\nimport java.util.*;\n\npublic class CF1278F extends PrintWriter {\n\tCF1278F() { super(System.out, true); }\n\tScanner sc = new Scanner(System.in);\n\tpublic static void main(String[] $) {\n\t\tCF1278F o = new CF1278F(); o.main(); o.flush();\n\t}\n\n\tstatic final int MD = 998244353;\n\tint d_, x_, y_;\n\tvoid gcd_(int a, int b) {\n\t\tif (b == 0) {\n\t\t\td_ = a; x_ = 1; y_ = 0;\n\t\t} else {\n\t\t\tgcd_(b, a % b);\n\t\t\tint t = x_ - a / b * y_; x_ = y_; y_ = t;\n\t\t}\n\t}\n\tint inv(int a) {\n\t\tgcd_(a, MD);\n\t\treturn x_ < 0 ? x_ + MD : x_;\n\t}\n\tvoid main() {\n\t\tint n = sc.nextInt();\n\t\tint m = sc.nextInt(), m_ = inv(m);\n\t\tint k = sc.nextInt();\n\t\tint[] dp = new int[k + 1]; dp[0] = 1;\n\t\tfor (int h = 0; h < k; h++)\n\t\t\tfor (int d = k - 1; d >= 0; d--)\n\t\t\t\tif (dp[d] != 0) {\n\t\t\t\t\tdp[d + 1] = (int) ((dp[d + 1] + (long) dp[d] * (n - d)) % MD);\n\t\t\t\t\tdp[d] = (int) ((long) dp[d] * d % MD);\n\t\t\t\t}\n\t\tlong p = 1, ans = 0;\n\t\tfor (int d = 1; d <= k; d++) {\n\t\t\tp = p * m_ % MD;\n\t\t\tans = (ans + dp[d] * p) % MD;\n\t\t}\n\t\tprintln(ans);\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics", "probabilities", "number theory"], "code_uid": "b075cbf2db4dbb709a3c85bae78e9bf6", "src_uid": "e6b3e559b5fd4e05adf9f1cd1b22126b", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author ijxjdjd\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n Cards solver = new Cards();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class Cards {\n long MOD = 998244353;\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n long N = in.nextInt();\n long M = in.nextInt();\n int K = in.nextInt();\n long mod = MathUtils.modFraction(1, M, MOD);\n long[] expect = new long[K + 1];\n expect[0] = 1;\n long[] poly = new long[K + 1];\n poly[0] = 1;\n long curExpect = 1;\n for (int k = 1; k <= K; k++) {\n curExpect *= (N - (k - 1));\n curExpect %= MOD;\n curExpect *= mod;\n curExpect %= MOD;\n for (int i = k; i >= 0; i--) {\n poly[i] = (i > 0 ? poly[i - 1] : 0) + (-(k - 1)) * poly[i];\n poly[i] = MathUtils.mod(poly[i], MOD);\n }\n expect[k] = curExpect;\n for (int i = k - 1; i >= 0; i--) {\n expect[k] -= poly[i] * expect[i];\n expect[k] = MathUtils.mod(expect[k], MOD);\n }\n }\n out.println(expect[K]);\n }\n\n }\n\n static class MathUtils {\n public static long inverse(long a, long mod) {\n long[] inv = extended_gcd(a, mod);\n if (inv[0] != 1) {\n return 0;\n } else {\n return (inv[1] + 2 * mod) % mod;\n }\n }\n\n public static long modFraction(long a, long b, long mod) {\n //a is numerator, b is denominator\n long invB = inverse(b, mod);\n if (invB == 0) {\n return -1;\n } else {\n return (invB * a) % mod;\n }\n }\n\n public static long[] extended_gcd(long a, long b) {\n //three numbers, first is gcd, second is x, third is y\n if (a == 0) {\n return new long[]{b, 0, 1};\n }\n long[] next = extended_gcd(b % a, a);\n long tempX = next[1];\n next[1] = next[2] - (b / a) * next[1];\n next[2] = tempX;\n return next;\n }\n\n public static long mod(long a, long mod) {\n return (a + (Math.abs(a) + mod - 1) / mod * mod) % mod;\n }\n\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics", "probabilities", "number theory"], "code_uid": "c9a3c1aefe280f180de2a89cf4f0d2e2", "src_uid": "e6b3e559b5fd4e05adf9f1cd1b22126b", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.util.Arrays;\nimport java.io.IOException;\nimport java.io.UncheckedIOException;\nimport java.io.Closeable;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) throws Exception {\n Thread thread = new Thread(null, new TaskAdapter(), \"\", 1 << 27);\n thread.start();\n thread.join();\n }\n\n static class TaskAdapter implements Runnable {\n @Override\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastInput in = new FastInput(inputStream);\n FastOutput out = new FastOutput(outputStream);\n FCards solver = new FCards();\n solver.solve(1, in, out);\n out.close();\n }\n }\n\n static class FCards {\n Modular mod = new Modular(998244353);\n Composite comp = new Composite(5000, mod);\n Power power = new Power(mod);\n\n public void solve(int testNumber, FastInput in, FastOutput out) {\n int n = in.readInt();\n int m = in.readInt();\n int k = in.readInt();\n\n CachedPow pm = new CachedPow(m, mod);\n int[] xk = new int[k + 1];\n for (int i = 0; i <= k; i++) {\n xk[i] = power.pow(i, k);\n }\n\n int ans = 0;\n BinomialComposite bc = new BinomialComposite(n, k, mod, true);\n for (int t = 0; t <= k; t++) {\n int p1 = bc.get(t);\n int p2 = 0;\n for (int i = 0; i <= t; i++) {\n int contrib = comp.composite(t, i);\n contrib = mod.mul(contrib, xk[t - i]);\n if (i % 2 == 1) {\n contrib = mod.valueOf(-contrib);\n }\n p2 = mod.plus(p2, contrib);\n }\n int p3 = pm.inverse(t);\n\n int contrib = mod.mul(p1, p2);\n contrib = mod.mul(contrib, p3);\n ans = mod.plus(ans, contrib);\n }\n\n out.println(ans);\n }\n\n }\n\n static class Modular {\n int m;\n\n public int getMod() {\n return m;\n }\n\n public Modular(int m) {\n this.m = m;\n }\n\n public Modular(long m) {\n this.m = (int) m;\n if (this.m != m) {\n throw new IllegalArgumentException();\n }\n }\n\n public Modular(double m) {\n this.m = (int) m;\n if (this.m != m) {\n throw new IllegalArgumentException();\n }\n }\n\n public int valueOf(int x) {\n x %= m;\n if (x < 0) {\n x += m;\n }\n return x;\n }\n\n public int valueOf(long x) {\n x %= m;\n if (x < 0) {\n x += m;\n }\n return (int) x;\n }\n\n public int mul(int x, int y) {\n return valueOf((long) x * y);\n }\n\n public int plus(int x, int y) {\n return valueOf(x + y);\n }\n\n public Modular getModularForPowerComputation() {\n return new Modular(m - 1);\n }\n\n public String toString() {\n return \"mod \" + m;\n }\n\n }\n\n static class IntegerList implements Cloneable {\n private int size;\n private int cap;\n private int[] data;\n private static final int[] EMPTY = new int[0];\n\n public int[] getData() {\n return data;\n }\n\n public void remove(int l, int r) {\n if (l > r) {\n return;\n }\n checkRange(l);\n checkRange(r);\n if (r == size - 1) {\n size = l;\n return;\n } else {\n System.arraycopy(data, r + 1, data, l, size - (r + 1));\n size -= (r - l + 1);\n }\n }\n\n public IntegerList(int cap) {\n this.cap = cap;\n if (cap == 0) {\n data = EMPTY;\n } else {\n data = new int[cap];\n }\n }\n\n public IntegerList(IntegerList list) {\n this.size = list.size;\n this.cap = list.cap;\n this.data = Arrays.copyOf(list.data, size);\n }\n\n public IntegerList() {\n this(0);\n }\n\n public void ensureSpace(int req) {\n if (req > cap) {\n while (cap < req) {\n cap = Math.max(cap + 10, 2 * cap);\n }\n data = Arrays.copyOf(data, cap);\n }\n }\n\n private void checkRange(int i) {\n if (i < 0 || i >= size) {\n throw new ArrayIndexOutOfBoundsException(\"index \" + i + \" out of range\");\n }\n }\n\n public int get(int i) {\n checkRange(i);\n return data[i];\n }\n\n public void add(int x) {\n ensureSpace(size + 1);\n data[size++] = x;\n }\n\n public void addAll(int[] x) {\n addAll(x, 0, x.length);\n }\n\n public void addAll(int[] x, int offset, int len) {\n ensureSpace(size + len);\n System.arraycopy(x, offset, data, size, len);\n size += len;\n }\n\n public void addAll(IntegerList list) {\n addAll(list.data, 0, list.size);\n }\n\n public void expandWith(int x, int len) {\n ensureSpace(len);\n while (size < len) {\n data[size++] = x;\n }\n }\n\n public void set(int i, int x) {\n checkRange(i);\n data[i] = x;\n }\n\n public int size() {\n return size;\n }\n\n public int[] toArray() {\n return Arrays.copyOf(data, size);\n }\n\n public void clear() {\n size = 0;\n }\n\n public String toString() {\n return Arrays.toString(toArray());\n }\n\n public boolean equals(Object obj) {\n if (!(obj instanceof IntegerList)) {\n return false;\n }\n IntegerList other = (IntegerList) obj;\n return SequenceUtils.equal(data, 0, size - 1, other.data, 0, other.size - 1);\n }\n\n public int hashCode() {\n int h = 1;\n for (int i = 0; i < size; i++) {\n h = h * 31 + Integer.hashCode(data[i]);\n }\n return h;\n }\n\n public IntegerList clone() {\n IntegerList ans = new IntegerList();\n ans.addAll(this);\n return ans;\n }\n\n }\n\n static class InverseNumber {\n int[] inv;\n\n public InverseNumber(int[] inv, int limit, Modular modular) {\n this.inv = inv;\n inv[1] = 1;\n int p = modular.getMod();\n for (int i = 2; i <= limit; i++) {\n int k = p / i;\n int r = p % i;\n inv[i] = modular.mul(-k, inv[r]);\n }\n }\n\n public InverseNumber(int limit, Modular modular) {\n this(new int[limit + 1], limit, modular);\n }\n\n }\n\n static class DigitUtils {\n private DigitUtils() {\n }\n\n public static long round(double x) {\n if (x >= 0) {\n return (long) (x + 0.5);\n } else {\n return (long) (x - 0.5);\n }\n }\n\n }\n\n static class Composite {\n final Factorial factorial;\n final Modular modular;\n\n public Composite(Factorial factorial) {\n this.factorial = factorial;\n this.modular = factorial.getModular();\n }\n\n public Composite(int limit, Modular modular) {\n this(new Factorial(limit, modular));\n }\n\n public int composite(int m, int n) {\n if (n > m) {\n return 0;\n }\n return modular.mul(modular.mul(factorial.fact(m), factorial.invFact(n)), factorial.invFact(m - n));\n }\n\n }\n\n static class SequenceUtils {\n public static void swap(double[] data, int i, int j) {\n double tmp = data[i];\n data[i] = data[j];\n data[j] = tmp;\n }\n\n public static boolean equal(int[] a, int al, int ar, int[] b, int bl, int br) {\n if ((ar - al) != (br - bl)) {\n return false;\n }\n for (int i = al, j = bl; i <= ar; i++, j++) {\n if (a[i] != b[j]) {\n return false;\n }\n }\n return true;\n }\n\n }\n\n static class FastFourierTransform {\n private static double[][] realLevels = new double[30][];\n private static double[][] imgLevels = new double[30][];\n\n private static void prepareLevel(int i) {\n if (realLevels[i] == null) {\n realLevels[i] = new double[1 << i];\n imgLevels[i] = new double[1 << i];\n for (int j = 0, s = 1 << i; j < s; j++) {\n realLevels[i][j] = Math.cos(Math.PI / s * j);\n imgLevels[i][j] = Math.sin(Math.PI / s * j);\n }\n }\n }\n\n public static void dft(double[][] p, int m) {\n int n = 1 << m;\n\n int shift = 32 - Integer.numberOfTrailingZeros(n);\n for (int i = 1; i < n; i++) {\n int j = Integer.reverse(i << shift);\n if (i < j) {\n SequenceUtils.swap(p[0], i, j);\n SequenceUtils.swap(p[1], i, j);\n }\n }\n\n double[][] t = new double[2][1];\n for (int d = 0; d < m; d++) {\n int s = 1 << d;\n int s2 = s << 1;\n prepareLevel(d);\n for (int i = 0; i < n; i += s2) {\n for (int j = 0; j < s; j++) {\n int a = i + j;\n int b = a + s;\n mul(realLevels[d][j], imgLevels[d][j], p[0][b], p[1][b], t, 0);\n sub(p[0][a], p[1][a], t[0][0], t[1][0], p, b);\n add(p[0][a], p[1][a], t[0][0], t[1][0], p, a);\n }\n }\n }\n }\n\n public static void idft(double[][] p, int m) {\n dft(p, m);\n\n int n = 1 << m;\n div(p[0][0], p[1][0], n, p, 0);\n div(p[0][n / 2], p[1][n / 2], n, p, n / 2);\n for (int i = 1, until = n / 2; i < until; i++) {\n double a = p[0][n - i];\n double b = p[1][n - i];\n div(p[0][i], p[1][i], n, p, n - i);\n div(a, b, n, p, i);\n }\n }\n\n private static void add(double r1, double i1, double r2, double i2, double[][] r, int i) {\n r[0][i] = r1 + r2;\n r[1][i] = i1 + i2;\n }\n\n private static void sub(double r1, double i1, double r2, double i2, double[][] r, int i) {\n r[0][i] = r1 - r2;\n r[1][i] = i1 - i2;\n }\n\n private static void mul(double r1, double i1, double r2, double i2, double[][] r, int i) {\n r[0][i] = r1 * r2 - i1 * i2;\n r[1][i] = r1 * i2 + i1 * r2;\n }\n\n private static void div(double r1, double i1, double r2, double[][] r, int i) {\n r[0][i] = r1 / r2;\n r[1][i] = i1 / r2;\n }\n\n public static int[] multiplyMod(int[] a, int aLen, int[] b, int bLen, int m) {\n int need = aLen + bLen - 1;\n int n = 1 << CachedLog2.ceilLog(need);\n\n double[] aReal = new double[n];\n double[] aImag = new double[n];\n for (int i = 0; i < aLen; i++) {\n int x = (a[i] % m + m) % m;\n aReal[i] = x & ((1 << 15) - 1);\n aImag[i] = x >> 15;\n }\n dft(new double[][]{aReal, aImag}, CachedLog2.floorLog(n));\n\n double[] bReal = new double[n];\n double[] bImag = new double[n];\n for (int i = 0; i < bLen; i++) {\n int x = (b[i] % m + m) % m;\n bReal[i] = x & ((1 << 15) - 1);\n bImag[i] = x >> 15;\n }\n dft(new double[][]{bReal, bImag}, CachedLog2.floorLog(n));\n\n double[] faReal = new double[n];\n double[] faImag = new double[n];\n double[] fbReal = new double[n];\n double[] fbImag = new double[n];\n\n for (int i = 0; i < n; i++) {\n int j = (n - i) & (n - 1);\n\n double a1r = (aReal[i] + aReal[j]) / 2;\n double a1i = (aImag[i] - aImag[j]) / 2;\n double a2r = (aImag[i] + aImag[j]) / 2;\n double a2i = (aReal[j] - aReal[i]) / 2;\n\n double b1r = (bReal[i] + bReal[j]) / 2;\n double b1i = (bImag[i] - bImag[j]) / 2;\n double b2r = (bImag[i] + bImag[j]) / 2;\n double b2i = (bReal[j] - bReal[i]) / 2;\n\n faReal[i] = a1r * b1r - a1i * b1i - a2r * b2i - a2i * b2r;\n faImag[i] = a1r * b1i + a1i * b1r + a2r * b2r - a2i * b2i;\n\n fbReal[i] = a1r * b2r - a1i * b2i + a2r * b1r - a2i * b1i;\n fbImag[i] = a1r * b2i + a1i * b2r + a2r * b1i + a2i * b1r;\n }\n\n idft(new double[][]{faReal, faImag}, CachedLog2.floorLog(n));\n idft(new double[][]{fbReal, fbImag}, CachedLog2.floorLog(n));\n int[] res = new int[need];\n for (int i = 0; i < need; i++) {\n long aa = (long) (faReal[i] + 0.5);\n long bb = (long) (fbReal[i] + 0.5);\n long cc = (long) (faImag[i] + 0.5);\n res[i] = (int) ((aa % m + (bb % m << 15) + (cc % m << 30)) % m);\n }\n return res;\n }\n\n }\n\n static class Loop<T> {\n T[] data;\n int pos;\n\n public Loop(T... data) {\n this.data = data;\n }\n\n public T turn(int i) {\n pos += i;\n return get(0);\n }\n\n public T turn() {\n return turn(1);\n }\n\n public T get(int i) {\n return data[(pos + i) % data.length];\n }\n\n public T get() {\n return get(0);\n }\n\n }\n\n static class BinomialComposite {\n private int m;\n private long n;\n private Modular mod;\n private IntegerList composites;\n private boolean fft;\n\n public BinomialComposite(long n, int m, Modular mod, boolean fft) {\n this.m = m;\n this.mod = mod;\n this.n = n;\n this.fft = fft;\n composites = pow(n);\n composites.expandWith(0, m + 1);\n }\n\n public int get(int i) {\n return composites.get(i);\n }\n\n private void mul(IntegerList a, IntegerList b, IntegerList c) {\n if (!fft) {\n Polynomials.mul(a, b, c, mod);\n } else {\n int[] ans = FastFourierTransform.multiplyMod(a.getData(), a.size(), b.getData(), b.size(), mod.getMod());\n c.clear();\n c.addAll(ans);\n }\n trim(c);\n }\n\n private void trim(IntegerList x) {\n if (x.size() > m + 1) {\n x.remove(m + 1, x.size() - 1);\n }\n }\n\n private void mul(IntegerList p, IntegerList ans) {\n ans.clear();\n ans.expandWith(0, p.size() + 1);\n\n int n = p.size();\n for (int i = 0; i < n; i++) {\n int val = p.get(i);\n ans.set(i, mod.plus(ans.get(i), val));\n ans.set(i + 1, val);\n }\n\n trim(ans);\n }\n\n private IntegerList pow(long exp) {\n int ceil = CachedLog2.ceilLog(m + 1 + m);\n Loop<IntegerList> loop = new Loop<>(new IntegerList(1 << ceil), new IntegerList(1 << ceil));\n loop.get().add(1);\n for (int i = CachedLog2.floorLog(exp); i >= 0; i--) {\n mul(loop.get(), loop.get(), loop.turn());\n if (1 == Bits.bitAt(exp, i)) {\n mul(loop.get(), loop.turn());\n }\n }\n return loop.get();\n }\n\n }\n\n static class Bits {\n private Bits() {\n }\n\n public static int bitAt(long x, int i) {\n return (int) ((x >> i) & 1);\n }\n\n }\n\n static class Factorial {\n int[] fact;\n int[] inv;\n Modular modular;\n\n public Modular getModular() {\n return modular;\n }\n\n public Factorial(int[] fact, int[] inv, InverseNumber in, int limit, Modular modular) {\n this.modular = modular;\n this.fact = fact;\n this.inv = inv;\n fact[0] = inv[0] = 1;\n for (int i = 1; i <= limit; i++) {\n fact[i] = modular.mul(fact[i - 1], i);\n inv[i] = modular.mul(inv[i - 1], in.inv[i]);\n }\n }\n\n public Factorial(int limit, Modular modular) {\n this(new int[limit + 1], new int[limit + 1], new InverseNumber(limit, modular), limit, modular);\n }\n\n public int fact(int n) {\n return fact[n];\n }\n\n public int invFact(int n) {\n return inv[n];\n }\n\n }\n\n static class CachedPow {\n private int[] first;\n private int[] second;\n private Modular mod;\n private Modular powMod;\n\n public CachedPow(int x, Modular mod) {\n this(x, mod.getMod(), mod);\n }\n\n public CachedPow(int x, int maxExp, Modular mod) {\n this.mod = mod;\n this.powMod = mod.getModularForPowerComputation();\n int k = Math.max(1, (int) DigitUtils.round(Math.sqrt(maxExp)));\n first = new int[k];\n second = new int[maxExp / k + 1];\n first[0] = 1;\n for (int i = 1; i < k; i++) {\n first[i] = mod.mul(x, first[i - 1]);\n }\n second[0] = 1;\n int step = mod.mul(x, first[k - 1]);\n for (int i = 1; i < second.length; i++) {\n second[i] = mod.mul(second[i - 1], step);\n }\n }\n\n public int pow(int exp) {\n return mod.mul(first[exp % first.length], second[exp / first.length]);\n }\n\n public int inverse(int exp) {\n return pow(powMod.valueOf(-exp));\n }\n\n }\n\n static class Polynomials {\n public static int rankOf(IntegerList p) {\n int[] data = p.getData();\n int r = p.size() - 1;\n while (r >= 0 && data[r] == 0) {\n r--;\n }\n return Math.max(0, r);\n }\n\n public static void mul(IntegerList a, IntegerList b, IntegerList c, Modular mod) {\n int rA = rankOf(a);\n int rB = rankOf(b);\n c.clear();\n c.expandWith(0, rA + rB + 1);\n int[] aData = a.getData();\n int[] bData = b.getData();\n int[] cData = c.getData();\n for (int i = 0; i <= rA; i++) {\n for (int j = 0; j <= rB; j++) {\n cData[i + j] = mod.plus(cData[i + j], mod.mul(aData[i], bData[j]));\n }\n }\n }\n\n }\n\n static class FastOutput implements AutoCloseable, Closeable {\n private StringBuilder cache = new StringBuilder(10 << 20);\n private final Writer os;\n\n public FastOutput(Writer os) {\n this.os = os;\n }\n\n public FastOutput(OutputStream os) {\n this(new OutputStreamWriter(os));\n }\n\n public FastOutput println(int c) {\n cache.append(c).append('\\n');\n return this;\n }\n\n public FastOutput flush() {\n try {\n os.append(cache);\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n return this;\n }\n\n public void close() {\n flush();\n try {\n os.close();\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n\n public String toString() {\n return cache.toString();\n }\n\n }\n\n static class FastInput {\n private final InputStream is;\n private byte[] buf = new byte[1 << 13];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastInput(InputStream is) {\n this.is = is;\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n bufLen = -1;\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public int readInt() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n }\n\n static class Power {\n final Modular modular;\n\n public Power(Modular modular) {\n this.modular = modular;\n }\n\n public int pow(int x, int n) {\n if (n == 0) {\n return modular.valueOf(1);\n }\n long r = pow(x, n >> 1);\n r = modular.valueOf(r * r);\n if ((n & 1) == 1) {\n r = modular.valueOf(r * x);\n }\n return (int) r;\n }\n\n }\n\n static class CachedLog2 {\n private static final int BITS = 16;\n private static final int LIMIT = 1 << BITS;\n private static final byte[] CACHE = new byte[LIMIT];\n\n static {\n int b = 0;\n for (int i = 0; i < LIMIT; i++) {\n while ((1 << (b + 1)) <= i) {\n b++;\n }\n CACHE[i] = (byte) b;\n }\n }\n\n public static int ceilLog(int x) {\n int ans = floorLog(x);\n if ((1 << ans) < x) {\n ans++;\n }\n return ans;\n }\n\n public static int floorLog(int x) {\n return x < LIMIT ? CACHE[x] : (BITS + CACHE[x >>> BITS]);\n }\n\n public static int floorLog(long x) {\n int ans = 0;\n while (x >= LIMIT) {\n ans += BITS;\n x >>>= BITS;\n }\n return ans + CACHE[(int) x];\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics", "probabilities", "number theory"], "code_uid": "a8e4e6aa34f459c65d0632f92dbfe6c6", "src_uid": "e6b3e559b5fd4e05adf9f1cd1b22126b", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Sparsh Sanchorawala\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n FCards solver = new FCards();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class FCards {\n long mod = 998244353;\n\n long modExp(long x, long y) {\n if (y == 0)\n return 1;\n if (y == 1)\n return x;\n long ret = modExp(x, y >> 1);\n ret = ret * ret % mod;\n if ((y & 1) == 1)\n ret = ret * x % mod;\n return ret;\n }\n\n public void solve(int testNumber, InputReader s, PrintWriter w) {\n int n = s.nextInt(), m = s.nextInt(), k = s.nextInt();\n //dp[tuple size][number of distinct elements] = number of such tuples\n long[][] dp = new long[k + 1][Math.min(n, k) + 1];\n dp[0][0] = 1;\n for (int i = 1; i <= k; i++) {\n for (int j = 1; j <= Math.min(n, k); j++) {\n dp[i][j] = (dp[i][j] + dp[i - 1][j] * j % mod) % mod;\n dp[i][j] = (dp[i][j] + dp[i - 1][j - 1] * (n - j + 1) % mod) % mod;\n }\n }\n long invm = modExp(m, mod - 2);\n long res = 0;\n long prob = 1;\n for (int i = 0; i <= Math.min(n, k); i++) {\n res = (res + dp[k][i] * prob % mod) % mod;\n prob = prob * invm % mod;\n }\n w.println(res);\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics", "probabilities", "number theory"], "code_uid": "eefbd2b06144e4f156af8a9cf8dbfe13", "src_uid": "e6b3e559b5fd4e05adf9f1cd1b22126b", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.util.Arrays;\nimport java.io.IOException;\nimport java.io.UncheckedIOException;\nimport java.io.Closeable;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) throws Exception {\n Thread thread = new Thread(null, new TaskAdapter(), \"\", 1 << 27);\n thread.start();\n thread.join();\n }\n\n static class TaskAdapter implements Runnable {\n @Override\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastInput in = new FastInput(inputStream);\n FastOutput out = new FastOutput(outputStream);\n FCards solver = new FCards();\n solver.solve(1, in, out);\n out.close();\n }\n }\n\n static class FCards {\n Modular mod = new Modular(998244353);\n Composite comp = new Composite(5000, mod);\n Power power = new Power(mod);\n\n public void solve(int testNumber, FastInput in, FastOutput out) {\n int n = in.readInt();\n int m = in.readInt();\n int k = in.readInt();\n\n CachedPow pm = new CachedPow(m, mod);\n int[] xk = new int[k + 1];\n for (int i = 0; i <= k; i++) {\n xk[i] = power.pow(i, k);\n }\n\n int ans = 0;\n BinomialComposite bc = new BinomialComposite(n, k, mod);\n for (int t = 0; t <= k; t++) {\n int p1 = bc.get(t);\n int p2 = 0;\n for (int i = 0; i <= t; i++) {\n int contrib = comp.composite(t, i);\n contrib = mod.mul(contrib, xk[t - i]);\n if (i % 2 == 1) {\n contrib = mod.valueOf(-contrib);\n }\n p2 = mod.plus(p2, contrib);\n }\n int p3 = pm.inverse(t);\n\n int contrib = mod.mul(p1, p2);\n contrib = mod.mul(contrib, p3);\n ans = mod.plus(ans, contrib);\n }\n\n out.println(ans);\n }\n\n }\n\n static class IntegerList implements Cloneable {\n private int size;\n private int cap;\n private int[] data;\n private static final int[] EMPTY = new int[0];\n\n public int[] getData() {\n return data;\n }\n\n public void remove(int l, int r) {\n if (l > r) {\n return;\n }\n checkRange(l);\n checkRange(r);\n if (r == size - 1) {\n size = l;\n return;\n } else {\n System.arraycopy(data, r + 1, data, l, size - (r + 1));\n size -= (r - l + 1);\n }\n }\n\n public IntegerList(int cap) {\n this.cap = cap;\n if (cap == 0) {\n data = EMPTY;\n } else {\n data = new int[cap];\n }\n }\n\n public IntegerList(IntegerList list) {\n this.size = list.size;\n this.cap = list.cap;\n this.data = Arrays.copyOf(list.data, size);\n }\n\n public IntegerList() {\n this(0);\n }\n\n public void ensureSpace(int req) {\n if (req > cap) {\n while (cap < req) {\n cap = Math.max(cap + 10, 2 * cap);\n }\n data = Arrays.copyOf(data, cap);\n }\n }\n\n private void checkRange(int i) {\n if (i < 0 || i >= size) {\n throw new ArrayIndexOutOfBoundsException(\"index \" + i + \" out of range\");\n }\n }\n\n public int get(int i) {\n checkRange(i);\n return data[i];\n }\n\n public void add(int x) {\n ensureSpace(size + 1);\n data[size++] = x;\n }\n\n public void addAll(int[] x) {\n addAll(x, 0, x.length);\n }\n\n public void addAll(int[] x, int offset, int len) {\n ensureSpace(size + len);\n System.arraycopy(x, offset, data, size, len);\n size += len;\n }\n\n public void addAll(IntegerList list) {\n addAll(list.data, 0, list.size);\n }\n\n public void expandWith(int x, int len) {\n ensureSpace(len);\n while (size < len) {\n data[size++] = x;\n }\n }\n\n public void set(int i, int x) {\n checkRange(i);\n data[i] = x;\n }\n\n public int size() {\n return size;\n }\n\n public int[] toArray() {\n return Arrays.copyOf(data, size);\n }\n\n public void clear() {\n size = 0;\n }\n\n public String toString() {\n return Arrays.toString(toArray());\n }\n\n public boolean equals(Object obj) {\n if (!(obj instanceof IntegerList)) {\n return false;\n }\n IntegerList other = (IntegerList) obj;\n return SequenceUtils.equal(data, 0, size - 1, other.data, 0, other.size - 1);\n }\n\n public int hashCode() {\n int h = 1;\n for (int i = 0; i < size; i++) {\n h = h * 31 + Integer.hashCode(data[i]);\n }\n return h;\n }\n\n public IntegerList clone() {\n IntegerList ans = new IntegerList();\n ans.addAll(this);\n return ans;\n }\n\n }\n\n static class FastFourierTransform {\n private static double[][] realLevels = new double[30][];\n private static double[][] imgLevels = new double[30][];\n\n private static void prepareLevel(int i) {\n if (realLevels[i] == null) {\n realLevels[i] = new double[1 << i];\n imgLevels[i] = new double[1 << i];\n for (int j = 0, s = 1 << i; j < s; j++) {\n realLevels[i][j] = Math.cos(Math.PI / s * j);\n imgLevels[i][j] = Math.sin(Math.PI / s * j);\n }\n }\n }\n\n public static void dft(double[][] p, int m) {\n int n = 1 << m;\n\n int shift = 32 - Integer.numberOfTrailingZeros(n);\n for (int i = 1; i < n; i++) {\n int j = Integer.reverse(i << shift);\n if (i < j) {\n SequenceUtils.swap(p[0], i, j);\n SequenceUtils.swap(p[1], i, j);\n }\n }\n\n double[][] t = new double[2][1];\n for (int d = 0; d < m; d++) {\n int s = 1 << d;\n int s2 = s << 1;\n prepareLevel(d);\n for (int i = 0; i < n; i += s2) {\n for (int j = 0; j < s; j++) {\n int a = i + j;\n int b = a + s;\n mul(realLevels[d][j], imgLevels[d][j], p[0][b], p[1][b], t, 0);\n sub(p[0][a], p[1][a], t[0][0], t[1][0], p, b);\n add(p[0][a], p[1][a], t[0][0], t[1][0], p, a);\n }\n }\n }\n }\n\n public static void idft(double[][] p, int m) {\n dft(p, m);\n\n int n = 1 << m;\n div(p[0][0], p[1][0], n, p, 0);\n div(p[0][n / 2], p[1][n / 2], n, p, n / 2);\n for (int i = 1, until = n / 2; i < until; i++) {\n double a = p[0][n - i];\n double b = p[1][n - i];\n div(p[0][i], p[1][i], n, p, n - i);\n div(a, b, n, p, i);\n }\n }\n\n private static void add(double r1, double i1, double r2, double i2, double[][] r, int i) {\n r[0][i] = r1 + r2;\n r[1][i] = i1 + i2;\n }\n\n private static void sub(double r1, double i1, double r2, double i2, double[][] r, int i) {\n r[0][i] = r1 - r2;\n r[1][i] = i1 - i2;\n }\n\n private static void mul(double r1, double i1, double r2, double i2, double[][] r, int i) {\n r[0][i] = r1 * r2 - i1 * i2;\n r[1][i] = r1 * i2 + i1 * r2;\n }\n\n private static void div(double r1, double i1, double r2, double[][] r, int i) {\n r[0][i] = r1 / r2;\n r[1][i] = i1 / r2;\n }\n\n public static int[] multiplyMod(int[] a, int aLen, int[] b, int bLen, int m) {\n int need = aLen + bLen - 1;\n int n = 1 << CachedLog2.ceilLog(need);\n\n double[] aReal = new double[n];\n double[] aImag = new double[n];\n for (int i = 0; i < aLen; i++) {\n int x = (a[i] % m + m) % m;\n aReal[i] = x & ((1 << 15) - 1);\n aImag[i] = x >> 15;\n }\n dft(new double[][]{aReal, aImag}, CachedLog2.floorLog(n));\n\n double[] bReal = new double[n];\n double[] bImag = new double[n];\n for (int i = 0; i < bLen; i++) {\n int x = (b[i] % m + m) % m;\n bReal[i] = x & ((1 << 15) - 1);\n bImag[i] = x >> 15;\n }\n dft(new double[][]{bReal, bImag}, CachedLog2.floorLog(n));\n\n double[] faReal = new double[n];\n double[] faImag = new double[n];\n double[] fbReal = new double[n];\n double[] fbImag = new double[n];\n\n for (int i = 0; i < n; i++) {\n int j = (n - i) & (n - 1);\n\n double a1r = (aReal[i] + aReal[j]) / 2;\n double a1i = (aImag[i] - aImag[j]) / 2;\n double a2r = (aImag[i] + aImag[j]) / 2;\n double a2i = (aReal[j] - aReal[i]) / 2;\n\n double b1r = (bReal[i] + bReal[j]) / 2;\n double b1i = (bImag[i] - bImag[j]) / 2;\n double b2r = (bImag[i] + bImag[j]) / 2;\n double b2i = (bReal[j] - bReal[i]) / 2;\n\n faReal[i] = a1r * b1r - a1i * b1i - a2r * b2i - a2i * b2r;\n faImag[i] = a1r * b1i + a1i * b1r + a2r * b2r - a2i * b2i;\n\n fbReal[i] = a1r * b2r - a1i * b2i + a2r * b1r - a2i * b1i;\n fbImag[i] = a1r * b2i + a1i * b2r + a2r * b1i + a2i * b1r;\n }\n\n idft(new double[][]{faReal, faImag}, CachedLog2.floorLog(n));\n idft(new double[][]{fbReal, fbImag}, CachedLog2.floorLog(n));\n int[] res = new int[need];\n for (int i = 0; i < need; i++) {\n long aa = (long) (faReal[i] + 0.5);\n long bb = (long) (fbReal[i] + 0.5);\n long cc = (long) (faImag[i] + 0.5);\n res[i] = (int) ((aa % m + (bb % m << 15) + (cc % m << 30)) % m);\n }\n return res;\n }\n\n }\n\n static class CachedPow {\n private int[] first;\n private int[] second;\n private Modular mod;\n private Modular powMod;\n\n public CachedPow(int x, Modular mod) {\n this(x, mod.getMod(), mod);\n }\n\n public CachedPow(int x, int maxExp, Modular mod) {\n this.mod = mod;\n this.powMod = mod.getModularForPowerComputation();\n int k = Math.max(1, (int) DigitUtils.round(Math.sqrt(maxExp)));\n first = new int[k];\n second = new int[maxExp / k + 1];\n first[0] = 1;\n for (int i = 1; i < k; i++) {\n first[i] = mod.mul(x, first[i - 1]);\n }\n second[0] = 1;\n int step = mod.mul(x, first[k - 1]);\n for (int i = 1; i < second.length; i++) {\n second[i] = mod.mul(second[i - 1], step);\n }\n }\n\n public int pow(int exp) {\n return mod.mul(first[exp % first.length], second[exp / first.length]);\n }\n\n public int inverse(int exp) {\n return pow(powMod.valueOf(-exp));\n }\n\n }\n\n static class BinomialComposite {\n private int m;\n private Modular mod;\n private IntegerList composites;\n\n public BinomialComposite(long n, int m, Modular mod) {\n this.m = m;\n this.mod = mod;\n composites = pow(n);\n composites.expandWith(0, m + 1);\n }\n\n public int get(int i) {\n return composites.get(i);\n }\n\n private void mul(IntegerList a, IntegerList b, IntegerList c) {\n Polynomials.mul(a, b, c, mod);\n trim(c);\n }\n\n private void trim(IntegerList x) {\n if (x.size() > m + 1) {\n x.remove(m + 1, x.size() - 1);\n }\n }\n\n private void mul(IntegerList p, IntegerList ans) {\n ans.clear();\n ans.expandWith(0, p.size() + 1);\n\n int n = p.size();\n for (int i = 0; i < n; i++) {\n int val = p.get(i);\n ans.set(i, mod.plus(ans.get(i), val));\n ans.set(i + 1, val);\n }\n\n trim(ans);\n }\n\n private IntegerList pow(long exp) {\n int ceil = CachedLog2.ceilLog(m + 1 + m);\n Loop<IntegerList> loop = new Loop<>(new IntegerList(1 << ceil), new IntegerList(1 << ceil));\n loop.get().add(1);\n for (int i = CachedLog2.floorLog(exp); i >= 0; i--) {\n mul(loop.get(), loop.get(), loop.turn());\n if (1 == Bits.bitAt(exp, i)) {\n mul(loop.get(), loop.turn());\n }\n }\n return loop.get();\n }\n\n }\n\n static class Factorial {\n int[] fact;\n int[] inv;\n Modular modular;\n\n public Modular getModular() {\n return modular;\n }\n\n public Factorial(int[] fact, int[] inv, InverseNumber in, int limit, Modular modular) {\n this.modular = modular;\n this.fact = fact;\n this.inv = inv;\n fact[0] = inv[0] = 1;\n for (int i = 1; i <= limit; i++) {\n fact[i] = modular.mul(fact[i - 1], i);\n inv[i] = modular.mul(inv[i - 1], in.inv[i]);\n }\n }\n\n public Factorial(int limit, Modular modular) {\n this(new int[limit + 1], new int[limit + 1], new InverseNumber(limit, modular), limit, modular);\n }\n\n public int fact(int n) {\n return fact[n];\n }\n\n public int invFact(int n) {\n return inv[n];\n }\n\n }\n\n static class Composite {\n final Factorial factorial;\n final Modular modular;\n\n public Composite(Factorial factorial) {\n this.factorial = factorial;\n this.modular = factorial.getModular();\n }\n\n public Composite(int limit, Modular modular) {\n this(new Factorial(limit, modular));\n }\n\n public int composite(int m, int n) {\n if (n > m) {\n return 0;\n }\n return modular.mul(modular.mul(factorial.fact(m), factorial.invFact(n)), factorial.invFact(m - n));\n }\n\n }\n\n static class CachedLog2 {\n private static final int BITS = 16;\n private static final int LIMIT = 1 << BITS;\n private static final byte[] CACHE = new byte[LIMIT];\n\n static {\n int b = 0;\n for (int i = 0; i < LIMIT; i++) {\n while ((1 << (b + 1)) <= i) {\n b++;\n }\n CACHE[i] = (byte) b;\n }\n }\n\n public static int ceilLog(int x) {\n int ans = floorLog(x);\n if ((1 << ans) < x) {\n ans++;\n }\n return ans;\n }\n\n public static int floorLog(int x) {\n return x < LIMIT ? CACHE[x] : (BITS + CACHE[x >>> BITS]);\n }\n\n public static int floorLog(long x) {\n int ans = 0;\n while (x >= LIMIT) {\n ans += BITS;\n x >>>= BITS;\n }\n return ans + CACHE[(int) x];\n }\n\n }\n\n static class InverseNumber {\n int[] inv;\n\n public InverseNumber(int[] inv, int limit, Modular modular) {\n this.inv = inv;\n inv[1] = 1;\n int p = modular.getMod();\n for (int i = 2; i <= limit; i++) {\n int k = p / i;\n int r = p % i;\n inv[i] = modular.mul(-k, inv[r]);\n }\n }\n\n public InverseNumber(int limit, Modular modular) {\n this(new int[limit + 1], limit, modular);\n }\n\n }\n\n static class SequenceUtils {\n public static void swap(double[] data, int i, int j) {\n double tmp = data[i];\n data[i] = data[j];\n data[j] = tmp;\n }\n\n public static boolean equal(int[] a, int al, int ar, int[] b, int bl, int br) {\n if ((ar - al) != (br - bl)) {\n return false;\n }\n for (int i = al, j = bl; i <= ar; i++, j++) {\n if (a[i] != b[j]) {\n return false;\n }\n }\n return true;\n }\n\n }\n\n static class FastOutput implements AutoCloseable, Closeable {\n private StringBuilder cache = new StringBuilder(10 << 20);\n private final Writer os;\n\n public FastOutput(Writer os) {\n this.os = os;\n }\n\n public FastOutput(OutputStream os) {\n this(new OutputStreamWriter(os));\n }\n\n public FastOutput println(int c) {\n cache.append(c).append('\\n');\n return this;\n }\n\n public FastOutput flush() {\n try {\n os.append(cache);\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n return this;\n }\n\n public void close() {\n flush();\n try {\n os.close();\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n\n public String toString() {\n return cache.toString();\n }\n\n }\n\n static class Modular {\n int m;\n\n public int getMod() {\n return m;\n }\n\n public Modular(int m) {\n this.m = m;\n }\n\n public Modular(long m) {\n this.m = (int) m;\n if (this.m != m) {\n throw new IllegalArgumentException();\n }\n }\n\n public Modular(double m) {\n this.m = (int) m;\n if (this.m != m) {\n throw new IllegalArgumentException();\n }\n }\n\n public int valueOf(int x) {\n x %= m;\n if (x < 0) {\n x += m;\n }\n return x;\n }\n\n public int valueOf(long x) {\n x %= m;\n if (x < 0) {\n x += m;\n }\n return (int) x;\n }\n\n public int mul(int x, int y) {\n return valueOf((long) x * y);\n }\n\n public int plus(int x, int y) {\n return valueOf(x + y);\n }\n\n public Modular getModularForPowerComputation() {\n return new Modular(m - 1);\n }\n\n public String toString() {\n return \"mod \" + m;\n }\n\n }\n\n static class Power {\n final Modular modular;\n\n public Power(Modular modular) {\n this.modular = modular;\n }\n\n public int pow(int x, int n) {\n if (n == 0) {\n return modular.valueOf(1);\n }\n long r = pow(x, n >> 1);\n r = modular.valueOf(r * r);\n if ((n & 1) == 1) {\n r = modular.valueOf(r * x);\n }\n return (int) r;\n }\n\n }\n\n static class Loop<T> {\n T[] data;\n int pos;\n\n public Loop(T... data) {\n this.data = data;\n }\n\n public T turn(int i) {\n pos += i;\n return get(0);\n }\n\n public T turn() {\n return turn(1);\n }\n\n public T get(int i) {\n return data[(pos + i) % data.length];\n }\n\n public T get() {\n return get(0);\n }\n\n }\n\n static class Polynomials {\n public static int rankOf(IntegerList p) {\n int[] data = p.getData();\n int r = p.size() - 1;\n while (r >= 0 && data[r] == 0) {\n r--;\n }\n return Math.max(0, r);\n }\n\n public static void mul(IntegerList a, IntegerList b, IntegerList c, Modular mod) {\n int rA = rankOf(a);\n int rB = rankOf(b);\n c.clear();\n c.expandWith(0, rA + rB + 1);\n if (rA >= 64 && rB >= 64) {\n int[] ans = FastFourierTransform.multiplyMod(a.getData(), rA + 1,\n b.getData(), rB + 1, mod.getMod());\n c.clear();\n c.addAll(ans);\n return;\n }\n int[] aData = a.getData();\n int[] bData = b.getData();\n int[] cData = c.getData();\n for (int i = 0; i <= rA; i++) {\n for (int j = 0; j <= rB; j++) {\n cData[i + j] = mod.plus(cData[i + j], mod.mul(aData[i], bData[j]));\n }\n }\n }\n\n }\n\n static class Bits {\n private Bits() {\n }\n\n public static int bitAt(long x, int i) {\n return (int) ((x >> i) & 1);\n }\n\n }\n\n static class DigitUtils {\n private DigitUtils() {\n }\n\n public static long round(double x) {\n if (x >= 0) {\n return (long) (x + 0.5);\n } else {\n return (long) (x - 0.5);\n }\n }\n\n }\n\n static class FastInput {\n private final InputStream is;\n private byte[] buf = new byte[1 << 13];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastInput(InputStream is) {\n this.is = is;\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n bufLen = -1;\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public int readInt() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics", "probabilities", "number theory"], "code_uid": "cda1d4587fc2aca615c543a1d166ec0f", "src_uid": "e6b3e559b5fd4e05adf9f1cd1b22126b", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Cards {\n public static long MOD = 998244353;\n public static long[][] stirling;\n public static void main(String[] args) throws IOException{\n BufferedReader f = new BufferedReader(new InputStreamReader(System.in));\n stirling = new long[5001][5001];\n stirling[0][0] = 1;\n for(int i = 1; i < 5001; i++){\n for(int j = 1; j < 5001; j++){\n stirling[i][j] = (stirling[i-1][j-1] % MOD) + (j*stirling[i-1][j]) % MOD;\n stirling[i][j]%=MOD;\n }\n }\n StringTokenizer st = new StringTokenizer(f.readLine());\n long n = Long.parseLong(st.nextToken());\n long m = Long.parseLong(st.nextToken());\n int k = Integer.parseInt(st.nextToken());\n long p = modInverse(m, MOD);\n long val = 1;\n long ans = 0;\n long prob = 1;\n for(int i = k; i > 0; i--){\n val*=(n-(k-i));\n val%=MOD;\n prob*=p;\n prob%=MOD;\n ans += (((val*prob)%MOD)*stirling[k][k-i+1])%MOD;\n ans%=MOD;\n }\n System.out.println(ans);\n\n\n }\n\n public static long modInverse(long x, long p){\n return power(x, p-2, p);\n }\n\n public static long power(long x, long y, long p){\n long res = 1;\n x = x % p;\n\n while (y > 0) {\n\n if (y % 2 == 1)\n res = (res * x) % p;\n\n y = y >> 1;\n x = (x * x) % p;\n }\n\n return res;\n }\n\n}\n", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics", "probabilities", "number theory"], "code_uid": "b699d477139f000b295cd745a32d988b", "src_uid": "e6b3e559b5fd4e05adf9f1cd1b22126b", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\n\npublic class Main\n{\n public static final long MOD=998244353;\n static long add(long x, long y) {\n return ((x+y)%MOD+MOD)%MOD;\n }\n static long mult(long x, long y) {\n return ((x*y*1L)%MOD+MOD)%MOD;\n }\n static long exp(long x, long y) {\n if(y==0) return 1;\n else {\n long k = exp(x, y/2);\n if(y%2==0) return mult(k, k);\n else return mult(mult(k, k), x);\n }\n }\n static long inv(long x) {\n return exp(x, MOD-2);\n }\n \n\tpublic static void main(String[] args) {\n\t //f you CollegeBoard for making me write in Java\n\t Scanner sc = new Scanner(System.in);\n\t long n = sc.nextLong();\n\t long m = sc.nextLong();\n\t int k = sc.nextInt();\n\t long[][] dp = new long[k+1][k+1];\n\t dp[0][0]=1;\n\t for(int i=0; i<k; i++) {\n\t\t for(int j=0; j<k; j++) {\n\t\t\t dp[i+1][j] = add(dp[i+1][j], mult(dp[i][j], j));\n\t\t\t dp[i+1][j+1] = add(dp[i+1][j+1], mult(dp[i][j], n-j));\n\t\t }\n\t }\n\t long ans=0; \n\t for(int i=1; i<=k; i++) ans=add(ans, mult(dp[k][i], exp(inv(m), i)));\n\t System.out.println(ans);\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics", "probabilities", "number theory"], "code_uid": "830925b5b2c898affbe3e21626027f6a", "src_uid": "e6b3e559b5fd4e05adf9f1cd1b22126b", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package com.company;\n\nimport java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n\npublic class Main {\n public static class Task {\n int mod = 998244353;\n int add(int a, int b) {\n int c = a + b;\n if (c >= mod) return c - mod;\n if (c < 0) return c+ mod;\n return c;\n }\n int mult(int a, int b) {\n return (int) ((long) a * b % mod);\n }\n int mult(int... x) {\n int r = 1;\n for (int y: x) {\n r = mult(r, y);\n }\n return r;\n }\n int[][] stirling;\n void pre() {\n stirling = new int[5001][5001];\n for (int i = 0; i < stirling.length; i++) {\n stirling[i][0] = stirling[0][1] = 0;\n }\n for (int i = 0; i < stirling.length; i++) {\n stirling[i][i] = 1;\n }\n for (int i = 2; i < stirling.length; i++) {\n for (int j = 1; j < i; j++) {\n stirling[i][j] = add(mult(stirling[i - 1][j], i - 1), stirling[i - 1][j - 1]);\n }\n }\n// System.err.println(Arrays.toString(Arrays.copyOf(stirling[0], 4)));\n// System.err.println(Arrays.toString(Arrays.copyOf(stirling[1], 4)));\n// System.err.println(Arrays.toString(Arrays.copyOf(stirling[2], 4)));\n// System.err.println(Arrays.toString(Arrays.copyOf(stirling[3], 4)));\n }\n\n\n public void solve(Scanner sc, PrintWriter pw) throws IOException {\n pre();\n int n = sc.nextInt();\n int m = sc.nextInt();\n int k = sc.nextInt();\n int invm = (int)BigInteger.valueOf(m).modInverse(BigInteger.valueOf(mod)).longValue(); //inv(m);\n int[] pVal = new int[5001];\n pVal[0] = 1;\n int md = n;\n int prp = 1;\n for (int i = 1; i <= k; i++) {\n prp = mult(prp, md, invm);\n md = add(md, -1);\n int sub = prp;\n for (int j = i - 1; j >= 1; j--) {\n sub = add(sub, mult(stirling[i][j], ((i - j) % 2 == 1) ? pVal[j]: add(0, -pVal[j])));\n }\n pVal[i] = sub;\n }\n pw.println(pVal[k]);\n }\n\n }\n\n static long TIME_START, TIME_END;\n\n public static void main(String[] args) throws IOException {\n Scanner sc = new Scanner(System.in);\n// Scanner sc = new Scanner(new FileInputStream(\"input_line\"));\n PrintWriter pw = new PrintWriter(new BufferedOutputStream(System.out));\n// PrintWriter pw = new PrintWriter(new FileOutputStream(\"input_line\"));\n\n Runtime runtime = Runtime.getRuntime();\n long usedMemoryBefore = runtime.totalMemory() - runtime.freeMemory();\n TIME_START = System.currentTimeMillis();\n Task t = new Task();\n t.solve(sc, pw);\n TIME_END = System.currentTimeMillis();\n long usedMemoryAfter = runtime.totalMemory() - runtime.freeMemory();\n pw.close();\n System.err.println(\"Memory increased: \" + (usedMemoryAfter - usedMemoryBefore) / 1000000);\n System.err.println(\"Time used: \" + (TIME_END - TIME_START) + \".\");\n }\n\n static class Scanner {\n StringTokenizer st;\n BufferedReader br;\n\n public Scanner(InputStream s) {\n br = new BufferedReader(new InputStreamReader(s));\n }\n\n public Scanner(FileReader s) throws FileNotFoundException {\n br = new BufferedReader(s);\n }\n\n public String next() throws IOException {\n while (st == null || !st.hasMoreTokens())\n st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n\n public int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n public long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n public String nextLine() throws IOException {\n return br.readLine();\n }\n\n public double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n\n public boolean ready() throws IOException {\n return br.ready();\n }\n }\n}", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics", "probabilities", "number theory"], "code_uid": "16801dca95ef7c2b8d999c0b02b940ac", "src_uid": "e6b3e559b5fd4e05adf9f1cd1b22126b", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class E implements Runnable{\n\tpublic static void main (String[] args) {new Thread(null, new E(), \"_cf\", 1 << 28).start();}\n\n\tint MOD = 998244353;\n\n\tpublic void run() {\n\t\tFastScanner fs = new FastScanner();\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tSystem.err.println(\"Go!\");\n\n\t\tint n = fs.nextInt();\n\t\tint k = fs.nextInt();\n\t\tif(Math.min(n, k) == 1) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tint[] prefDP = new int[n + 1];\n\t\tint[] dp = new int[n + 1];\n\t\tfor(int len = 1; len <= n; len++) {\n\t\t\tint[] dp2 = new int[n + 1];\n\t\t\tint sum = 0;\n\t\t\tfor(int i = 1; i <= n; i++) {\n\t\t\t\tif(i <= len) {\n\t\t\t\t\tdp2[i] = add(sum, 1);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tsum = sub(sum, dp2[i-len-1]);\n\t\t\t\t\tdp2[i] = sum;\n\t\t\t\t}\n\t\t\t\tsum = add(sum, dp2[i]);\n\t\t\t}\n\t\t\tprefDP[len] = dp2[n];\n\t\t\tdp[len] = sub(prefDP[len], prefDP[len-1]);\n\t\t}\n\t\t\n\t\tint res = 0;\n\t\tfor(int i = 1; i <= n; i++)\n\t\t\tfor(int j = 1; j <= n; j++)\n\t\t\t\tif(i * j < k) {\n\t\t\t\t\tres = add(res, mult(dp[i], dp[j]));\n\t\t\t\t}\n\t\t\n\t\tres = mult(res, 2);\n\t\tout.println(res);\n\t\tout.close();\n\t}\n\t\n\tint mult(int a, int b) {\n\t\tlong c = a % MOD;\n\t\tc *= b%MOD;\n\t\treturn (int)(c % MOD);\n\t}\n\t\n\tint sub(int a, int b) {\n\t\treturn ((a%MOD) - (b%MOD) + MOD) % MOD;\n\t}\n\t\n\tint add(int a, int b) {\n\t\treturn ((a%MOD) + (b%MOD))%MOD;\n\t}\n\n\tvoid sort (int[] a) {\n\t\tint n = a.length;\n\t\tfor(int i = 0; i < 50; i++) {\n\t\t\tRandom r = new Random();\n\t\t\tint x = r.nextInt(n), y = r.nextInt(n);\n\t\t\tint temp = a[x];\n\t\t\ta[x] = a[y];\n\t\t\ta[y] = temp;\n\t\t}\n\t\tArrays.sort(a);\n\t}\n\n\tclass FastScanner {\n\t\tpublic int BS = 1<<16;\n\t\tpublic char NC = (char)0;\n\t\tbyte[] buf = new byte[BS];\n\t\tint bId = 0, size = 0;\n\t\tchar c = NC;\n\t\tdouble num = 1;\n\t\tBufferedInputStream in;\n\n\t\tpublic FastScanner() {\n\t\t\tin = new BufferedInputStream(System.in, BS);\n\t\t}\n\n\t\tpublic FastScanner(String s) throws FileNotFoundException {\n\t\t\tin = new BufferedInputStream(new FileInputStream(new File(s)), BS);\n\t\t}\n\n\t\tpublic char nextChar(){\n\t\t\twhile(bId==size) {\n\t\t\t\ttry {\n\t\t\t\t\tsize = in.read(buf);\n\t\t\t\t}catch(Exception e) {\n\t\t\t\t\treturn NC;\n\t\t\t\t} \n\t\t\t\tif(size==-1)return NC;\n\t\t\t\tbId=0;\n\t\t\t}\n\t\t\treturn (char)buf[bId++];\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn (int)nextLong();\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\tnum=1;\n\t\t\tboolean neg = false;\n\t\t\tif(c==NC)c=nextChar();\n\t\t\tfor(;(c<'0' || c>'9'); c = nextChar()) {\n\t\t\t\tif(c=='-')neg=true;\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tfor(; c>='0' && c <='9'; c=nextChar()) {\n\t\t\t\tres = (res<<3)+(res<<1)+c-'0';\n\t\t\t\tnum*=10;\n\t\t\t}\n\t\t\treturn neg?-res:res;\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\tdouble cur = nextLong();\n\t\t\treturn c!='.' ? cur:cur+nextLong()/num;\n\t\t}\n\n\t\tpublic String next() {\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\twhile(c<=32)c=nextChar();\n\t\t\twhile(c>32) {\n\t\t\t\tres.append(c);\n\t\t\t\tc=nextChar();\n\t\t\t}\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tpublic String nextLine() {\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\twhile(c<=32)c=nextChar();\n\t\t\twhile(c!='\\n') {\n\t\t\t\tres.append(c);\n\t\t\t\tc=nextChar();\n\t\t\t}\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tpublic boolean hasNext() {\n\t\t\tif(c>32)return true;\n\t\t\twhile(true) {\n\t\t\t\tc=nextChar();\n\t\t\t\tif(c==NC)return false;\n\t\t\t\telse if(c>32)return true;\n\t\t\t}\n\t\t}\n\t\t\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] res = new int[n];\n\t\t\tfor(int i = 0; i < n; i++) res[i] = nextInt();\n\t\t\treturn res;\n\t\t}\n\t\t\n\t}\n\n}", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics"], "code_uid": "8f66d39a2d505c949bc1ee1453c5040b", "src_uid": "77177b1a2faf0ba4ca1f4d77632b635b", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.math.*;\nimport java.util.*;\nimport java.util.stream.*;\n\npublic class G {\n\n\tvoid submit() {\n\t\tint n = nextInt();\n\t\tint k = nextInt();\n\t\tint s = nextInt() - 1;\n\t\tlong t = nextLong();\n\t\tout.println(solve(n, k, s, t) + 1);\n\t}\n\n\tint solve(int n, int k, int s, long t) {\n\t\t// int n = nextInt();\n\t\t// int k = nextInt();\n\t\t// int s = nextInt() - 1;\n\t\t// long t = nextLong();\n\t\twhile (t % n != 0) {\n\t\t\tint delta = (int) ((s < k ? 1 : -1) * (t % n));\n\t\t\ts = (s + n + delta) % n;\n\t\t\tt--;\n\t\t}\n\n\t\tt /= n;\n\n\t\tlong[] when = new long[n];\n\t\tArrays.fill(when, -1);\n\n\t\tfor (long left = t; left > 0; left--) {\n\t\t\tif (when[s] != -1) {\n\t\t\t\tlong period = when[s] - left;\n\n\t\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\t\tif (when[i] != -1 && when[i] <= when[s]\n\t\t\t\t\t\t\t&& when[i] % period == 0) {\n\t\t\t\t\t\t// out.println(i + 1);\n\t\t\t\t\t\treturn i;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tthrow new AssertionError();\n\n\t\t\t}\n\t\t\twhen[s] = left;\n\n\t\t\tfor (int i = n - 1; i > 0; i--) {\n\t\t\t\tif (s < k) {\n\t\t\t\t\ts += i;\n\t\t\t\t\tif (s >= n) {\n\t\t\t\t\t\ts -= n;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\ts -= i;\n\t\t\t\t\tif (s < 0) {\n\t\t\t\t\t\ts += n;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\n\t\t// out.println(s + 1);\n\t\treturn s;\n\n\t}\n\n\tint go(int n, int m) {\n\t\tint[] a = IntStream.range(0, n).toArray();\n\t\tfor (int i = n - 1; i > 0; i--) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tint delta = a[j] < m ? 1 : -1;\n\t\t\t\ta[j] = (a[j] + n + i * delta) % n;\n\t\t\t}\n\t\t}\n\t\t// System.err.println(Arrays.toString(a));\n\t\t// out.println(\"digraph G {\");\n\t\t// for (int i = 0; i < n; i++) {\n\t\t// out.println(i + \" -> \" + a[i] + \";\");\n\t\t// }\n\t\t// out.println(\"}\");\n\n\t\treturn maxDepth(a);\n\t}\n\n\tint maxDepth(int[] p) {\n\t\tint n = p.length;\n\t\tint[] used = new int[n];\n\t\tint ret = 0;\n\t\tArrays.fill(used, -1);\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint cur = 0;\n\t\t\tint v = i;\n\t\t\twhile (used[v] != i) {\n\t\t\t\tused[v] = i;\n\t\t\t\tcur++;\n\t\t\t\tv = p[v];\n\t\t\t}\n\t\t\tret = Math.max(ret, cur);\n\t\t}\n\t\treturn ret;\n\t}\n\n\tvoid test() {\n\t\t/*\n\t\t * int max = -1; for (int n = 1;; n <<= 1) { // if (n % 40 == 0) {\n\t\t * System.err.println(n); // } for (int k = 1; k < Math.min(n, 20); k++)\n\t\t * { int tmp = go(n, k); if (tmp > max) { max = tmp;\n\t\t * System.err.println(max + \" @ \" + n + \" \" + k); } } }\n\t\t */\n\t\tfor (int s = 0; s < 65536; s++) {\n\t\t\tSystem.err.println(solve(65536, 1, s, 1_000_000_000_000L));\n\t\t}\n\t}\n\n\tvoid stress() {\n\t\tfor (int tst = 0;; tst++) {\n\t\t\tif (false) {\n\t\t\t\tthrow new AssertionError();\n\t\t\t}\n\t\t\tSystem.err.println(tst);\n\t\t}\n\t}\n\n\tG() throws IOException {\n\t\tis = System.in;\n\t\tout = new PrintWriter(System.out);\n\t\tsubmit();\n\t\t// stress();\n\t\t// test();\n\t\tout.close();\n\t}\n\n\tstatic final Random rng = new Random();\n\tstatic final int C = 5;\n\n\tstatic int rand(int l, int r) {\n\t\treturn l + rng.nextInt(r - l + 1);\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew G();\n\t}\n\n\tprivate InputStream is;\n\tPrintWriter out;\n\n\tprivate byte[] buf = new byte[1 << 14];\n\tprivate int bufSz = 0, bufPtr = 0;\n\n\tprivate int readByte() {\n\t\tif (bufSz == -1)\n\t\t\tthrow new RuntimeException(\"Reading past EOF\");\n\t\tif (bufPtr >= bufSz) {\n\t\t\tbufPtr = 0;\n\t\t\ttry {\n\t\t\t\tbufSz = is.read(buf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\t\tif (bufSz <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buf[bufPtr++];\n\t}\n\n\tprivate boolean isTrash(int c) {\n\t\treturn c < 33 || c > 126;\n\t}\n\n\tprivate int skip() {\n\t\tint b;\n\t\twhile ((b = readByte()) != -1 && isTrash(b))\n\t\t\t;\n\t\treturn b;\n\t}\n\n\tString nextToken() {\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile (!isTrash(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tString nextString() {\n\t\tint b = readByte();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile (!isTrash(b) || b == ' ') {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tdouble nextDouble() {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n\n\tchar nextChar() {\n\t\treturn (char) skip();\n\t}\n\n\tint nextInt() {\n\t\tint ret = 0;\n\t\tint b = skip();\n\t\tif (b != '-' && (b < '0' || b > '9')) {\n\t\t\tthrow new InputMismatchException();\n\t\t}\n\t\tboolean neg = false;\n\t\tif (b == '-') {\n\t\t\tneg = true;\n\t\t\tb = readByte();\n\t\t}\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tret = ret * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\tif (b != -1 && !isTrash(b)) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\treturn neg ? -ret : ret;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tlong nextLong() {\n\t\tlong ret = 0;\n\t\tint b = skip();\n\t\tif (b != '-' && (b < '0' || b > '9')) {\n\t\t\tthrow new InputMismatchException();\n\t\t}\n\t\tboolean neg = false;\n\t\tif (b == '-') {\n\t\t\tneg = true;\n\t\t\tb = readByte();\n\t\t}\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tret = ret * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\tif (b != -1 && !isTrash(b)) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\treturn neg ? -ret : ret;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "graphs", "data structures"], "code_uid": "d8fb7b75f9690b50e9c9c0297909093c", "src_uid": "e743242f0cc9e17619e1fe4935d9fbd0", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\npublic class TakeMetro {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int N = scanner.nextInt();\n int M = scanner.nextInt();\n //saves mod annoyances\n int S = scanner.nextInt()-1;\n long T = scanner.nextLong();\n while (T%N!=0) {\n if (S < M) {\n S = (int)((S + T) % N);\n } else {\n S = (int)((((S - T) % N) + N ) % N);\n }\n T--;\n }\n T /= N;\n //periodically shows up at same station, though not sure where yet\n int[] last = new int[N];\n Arrays.fill(last, -1);\n int cur = 0;\n //saw ourselves at the 0th round of N train takes\n last[S] = cur;\n while(T-- > 0) {\n for(int i = N-1; i > 0; i--) {\n if (S < M) {\n S = (S + i) % N;\n } else {\n S = (((S - i) % N) + N) % N;\n }\n }\n cur++;\n if (last[S] != -1) {\n T = T%(cur-last[S]);\n last[S] = cur;\n }\n else {\n last[S] = cur;\n }\n }\n System.out.println((S+1));\n }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "graphs", "data structures"], "code_uid": "6aaf4ebbed099897ee85492b7e6efea1", "src_uid": "e743242f0cc9e17619e1fe4935d9fbd0", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\npublic class G {\n\t\n\tpublic static void main(String[] args) throws IOException {\n\t\tMyScanner sc = new MyScanner();\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tint n = sc.nextInt();\n\t\tint m = sc.nextInt();\n\t\tint s = sc.nextInt() - 1;\n\t\tlong t = sc.nextLong();\n\t\tint[] next = new int[n];\n\t\tArrays.fill(next, -1);\n\t\twhile (t % n != 0) {\n\t\t\tif (s < m) s += t % n;\n\t\t\telse s += n - t % n;\n\t\t\ts %= n;\n\t\t\tt--;\n\t\t}\n\t\tlong cant = t / n;\n\t\tint prevs = s;\n\t\twhile (cant > 0 && next[s] == -1) {\n\t\t\tfor (int i = n - 1; i > 0; i--) {\n\t\t\t\tif (s < m) s += i;\n\t\t\t\telse s += n - i;\n\t\t\t\tif (s >= n) s -= n;\n\t\t\t}\n\t\t\tnext[prevs] = s;\n\t\t\tprevs = s;\n\t\t\tcant--;\n\t\t}\n\t\tif (cant > 0) {\n\t\t\tlong cicle = 1;\n\t\t\tprevs = s;\n\t\t\twhile (next[prevs] != s) {\n\t\t\t\tcicle++;\n\t\t\t\tprevs = next[prevs];\n\t\t\t}\n\t\t\tlong total = cant % cicle;\n\t\t\tfor (int i = 0; i < total; i++) {\n\t\t\t\ts = next[s];\n\t\t\t}\n\t\t}\n\t\tout.println(s+1);\n\t\t\n\t\tout.flush();\n\t}\n\t\n\tstatic class MyScanner {\n\t\tprivate BufferedReader br;\n\t\tprivate StringTokenizer tokenizer;\n\t\t\n\t\tpublic MyScanner() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\t\t\n\t\tpublic String next() {\n\t\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttokenizer = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tokenizer.nextToken();\n\t\t}\n\t\t\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\t\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "graphs", "data structures"], "code_uid": "19586c620c8ed41f2db988d098e1c0a0", "src_uid": "e743242f0cc9e17619e1fe4935d9fbd0", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author kessido\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n GTakeMetro solver = new GTakeMetro();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class GTakeMetro {\n int n;\n int m;\n int s;\n long t;\n\n void step() {\n int curJump = (int) ((t--) % n);\n int sign = s < m ? 1 : -1;\n s += sign * curJump;\n s %= n;\n if (s < 0) s += n;\n }\n\n void doLoop() {\n for (int i = 0; i < n; i++) step();\n }\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n n = in.NextInt();\n m = in.NextInt();\n s = in.NextInt() - 1;\n t = in.NextLong();\n\n while ((t % n) != 0) step();\n\n long[] lastSeem = new long[n];\n Arrays.fill(lastSeem, -1);\n while (t != 0) {\n doLoop();\n if (lastSeem[s] != -1) {\n long interval = lastSeem[s] - t;\n t %= interval;\n break;\n } else {\n lastSeem[s] = t;\n }\n }\n while (t != 0) step();\n out.println(s + 1);\n }\n\n }\n\n static class InputReader {\n BufferedReader reader;\n StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine(), \" \\t\\n\\r\\f,\");\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int NextInt() {\n return Integer.parseInt(next());\n }\n\n public long NextLong() {\n return Long.parseLong(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["brute force", "graphs", "data structures"], "code_uid": "1125f33cd4345233a853eeb3a430796b", "src_uid": "e743242f0cc9e17619e1fe4935d9fbd0", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import static java.lang.Integer.parseInt;\nimport static java.lang.Long.parseLong;\nimport static java.lang.Math.max;\nimport static java.lang.System.arraycopy;\nimport static java.lang.System.exit;\nimport static java.util.Arrays.copyOf;\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.NoSuchElementException;\nimport java.util.StringTokenizer;\n\npublic class G {\n\n\tstatic class IntList {\n\n\t\tint data[] = new int[3];\n\t\tint size = 0;\n\n\t\tboolean isEmpty() {\n\t\t\treturn size == 0;\n\t\t}\n\n\t\tint size() {\n\t\t\treturn size;\n\t\t}\n\n\t\tint get(int index) {\n\t\t\tif (index < 0 || index >= size) {\n\t\t\t\tthrow new IndexOutOfBoundsException();\n\t\t\t}\n\t\t\treturn data[index];\n\t\t}\n\n\t\tvoid clear() {\n\t\t\tsize = 0;\n\t\t}\n\n\t\tvoid set(int index, int value) {\n\t\t\tif (index < 0 || index >= size) {\n\t\t\t\tthrow new IndexOutOfBoundsException();\n\t\t\t}\n\t\t\tdata[index] = value;\n\t\t}\n\n\t\tvoid expand() {\n\t\t\tif (size >= data.length) {\n\t\t\t\tdata = copyOf(data, (data.length << 1) + 1);\n\t\t\t}\n\t\t}\n\n\t\tvoid insert(int index, int value) {\n\t\t\tif (index < 0 || index > size) {\n\t\t\t\tthrow new IndexOutOfBoundsException();\n\t\t\t}\n\t\t\texpand();\n\t\t\tarraycopy(data, index, data, index + 1, size++ - index);\n\t\t\tdata[index] = value;\n\t\t}\n\n\t\tint delete(int index) {\n\t\t\tif (index < 0 || index >= size) {\n\t\t\t\tthrow new IndexOutOfBoundsException();\n\t\t\t}\n\t\t\tint value = data[index];\n\t\t\tarraycopy(data, index + 1, data, index, --size - index);\n\t\t\treturn value;\n\t\t}\n\n\t\tvoid push(int value) {\n\t\t\texpand();\n\t\t\tdata[size++] = value;\n\t\t}\n\n\t\tint pop() {\n\t\t\tif (size == 0) {\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\t}\n\t\t\treturn data[--size];\n\t\t}\n\n\t\tvoid unshift(int value) {\n\t\t\texpand();\n\t\t\tarraycopy(data, 0, data, 1, size++);\n\t\t\tdata[0] = value;\n\t\t}\n\n\t\tint shift() {\n\t\t\tif (size == 0) {\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\t}\n\t\t\tint value = data[0];\n\t\t\tarraycopy(data, 1, data, 0, --size);\n\t\t\treturn value;\n\t\t}\n\t}\n\n\tstatic class IntIntMap {\n\n\t\tstatic final int EMPTY = Integer.MIN_VALUE;\n\n\t\tint data[] = new int[4];\n\t\t{\n\t\t\tdata[0] = EMPTY;\n\t\t\tdata[2] = EMPTY;\n\t\t}\n\t\tint size = 0;\n\n\t\tboolean isEmpty() {\n\t\t\treturn size == 0;\n\t\t}\n\n\t\tint size() {\n\t\t\treturn size;\n\t\t}\n\n\t\tvoid clear() {\n\t\t\tfor (int i = 0; i < data.length; i += 2) {\n\t\t\t\tdata[i] = EMPTY;\n\t\t\t}\n\t\t\tsize = 0;\n\t\t}\n\n\t\tstatic int hash(int key) {\n\t\t\tint hash = key * 1000000007;\n\t\t\thash ^= hash >> 16;\n\t\t\thash ^= hash >> 24;\n\t\t\treturn hash;\n\t\t}\n\n\t\tboolean have(int key) {\n\t\t\tif (key == EMPTY) {\n\t\t\t\tthrow new IllegalArgumentException();\n\t\t\t}\n\t\t\tfor (int mask = data.length - 2, i = hash(key) & mask;; i = (i - 1) & mask) {\n\t\t\t\tint cur = data[i];\n\t\t\t\tif (cur == key) {\n\t\t\t\t\treturn true;\n\t\t\t\t} else if (cur == EMPTY) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint get(int key, int default_) {\n\t\t\tif (key == EMPTY) {\n\t\t\t\tthrow new IllegalArgumentException();\n\t\t\t}\n\t\t\tfor (int mask = data.length - 2, i = hash(key) & mask;; i = (i - 1) & mask) {\n\t\t\t\tint cur = data[i];\n\t\t\t\tif (cur == key) {\n\t\t\t\t\treturn data[i + 1];\n\t\t\t\t} else if (cur == EMPTY) {\n\t\t\t\t\treturn default_;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tstatic int[] resize(int data[], int newCapacity) {\n\t\t\tint oldCapacity = data.length;\n\t\t\tint ndata[] = new int[newCapacity];\n\t\t\tfor (int i = 0; i < newCapacity; i += 2) {\n\t\t\t\tndata[i] = EMPTY;\n\t\t\t}\n\t\t\tfor (int mask = newCapacity - 2, i = 0; i < oldCapacity; i += 2) {\n\t\t\t\tint cur = data[i];\n\t\t\t\tif (cur == EMPTY) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tfor (int j = hash(cur) & mask;; j = (j - 1) & mask) {\n\t\t\t\t\tif (ndata[j] == EMPTY) {\n\t\t\t\t\t\tndata[j] = cur;\n\t\t\t\t\t\tndata[j + 1] = data[i + 1];\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn ndata;\n\t\t}\n\n\t\tvoid set(int key, int value) {\n\t\t\tif (key == EMPTY) {\n\t\t\t\tthrow new IllegalArgumentException();\n\t\t\t}\n\t\t\tint data[] = this.data;\n\t\t\tfor (int capacity = data.length, mask = capacity - 2, i = hash(key) & mask;; i = (i - 1) & mask) {\n\t\t\t\tint cur = data[i];\n\t\t\t\tif (cur == key) {\n\t\t\t\t\tdata[i + 1] = value;\n\t\t\t\t\treturn;\n\t\t\t\t} else if (cur == EMPTY) {\n\t\t\t\t\tdata[i] = key;\n\t\t\t\t\tdata[i + 1] = value;\n\t\t\t\t\tif (++size > capacity >> 2) {\n\t\t\t\t\t\tthis.data = resize(data, capacity << 1);\n\t\t\t\t\t}\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tvoid delete(int key) {\n\t\t\tif (key == EMPTY) {\n\t\t\t\tthrow new IllegalArgumentException();\n\t\t\t}\n\t\t\tint data[] = this.data;\n\t\t\tfor (int capacity = data.length, mask = capacity - 2, i = hash(key) & mask;; i = (i - 1) & mask) {\n\t\t\t\tint cur = data[i];\n\t\t\t\tif (cur == key) {\n\t\t\t\t\tfor (int j = i;;) {\n\t\t\t\t\t\tcur = data[j = (j - 1) & mask];\n\t\t\t\t\t\tif (cur == EMPTY) {\n\t\t\t\t\t\t\tdata[i] = EMPTY;\n\t\t\t\t\t\t\t--size;\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tint k = hash(cur) & mask;\n\t\t\t\t\t\tif ((k >= i) ^ (k < j) ^ (i < j)) {\n\t\t\t\t\t\t\tdata[i] = cur;\n\t\t\t\t\t\t\tdata[i + 1] = data[j + 1];\n\t\t\t\t\t\t\ti = j;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} else if (cur == EMPTY) {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tvoid expand(int newCapacity) {\n\t\t\tint data[] = this.data;\n\t\t\tint oldCapacity = data.length;\n\t\t\tif (oldCapacity >> 2 < newCapacity) {\n\t\t\t\tthis.data = resize(data, Integer.highestOneBit(newCapacity - 1) << 3);\n\t\t\t}\n\t\t}\n\n\t\tvoid shrink() {\n\t\t\tint data[] = this.data;\n\t\t\tint oldCapacity = data.length;\n\t\t\tif (oldCapacity > 4 && oldCapacity >> 3 >= size) {\n\t\t\t\tthis.data = resize(data, max(Integer.highestOneBit(size - 1) << 3, 4));\n\t\t\t}\n\t\t}\n\n\t\tstatic class Iterator {\n\n\t\t\tfinal int data[];\n\t\t\tint position = -2;\n\n\t\t\tIterator(int data[]) {\n\t\t\t\tthis.data = data;\n\t\t\t\tadvance();\n\t\t\t}\n\n\t\t\tboolean hasNext() {\n\t\t\t\treturn position < data.length;\n\t\t\t}\n\n\t\t\tint getKey() {\n\t\t\t\treturn data[position];\n\t\t\t}\n\n\t\t\tint getValue() {\n\t\t\t\treturn data[position + 1];\n\t\t\t}\n\n\t\t\tvoid advance() {\n\t\t\t\tdo {\n\t\t\t\t\tposition += 2;\n\t\t\t\t} while (position < data.length && data[position] == EMPTY);\n\t\t\t}\n\t\t}\n\n\t\tIterator iterator() {\n\t\t\treturn new Iterator(data);\n\t\t}\n\t}\n\n\tstatic final List<IntList> freeLists = new ArrayList<>();\n\n\tstatic IntList takeList() {\n\t\tif (freeLists.isEmpty()) {\n\t\t\treturn new IntList();\n\t\t} else {\n\t\t\treturn freeLists.remove(freeLists.size() - 1);\n\t\t}\n\t}\n\n\tstatic void putList(IntList list) {\n\t\tlist.clear();\n\t\tfreeLists.add(list);\n\t}\n\n\tstatic int n, m;\n\n\tstatic IntList solve(int from, int to) {\n\t\tIntList res;\n\t\tif (from + 1 == to) {\n\t\t\tres = takeList();\n\t\t\tres.push(from);\n\t\t\tif (from + m > n) {\n\t\t\t\tres.push(n - from);\n\t\t\t\tres.push(from - n);\n\t\t\t}\n\t\t\tres.push(m);\n\t\t\tif (from > m) {\n\t\t\t\tres.push(n - from);\n\t\t\t\tres.push(from);\n\t\t\t}\n\t\t\tres.push(-from);\n\t\t} else {\n\t\t\tint mid = (from + to) >> 1;\n\t\t\tIntList a = solve(from, mid), b = solve(mid, to);\n\t\t\tres = takeList();\n\t\t\tint aSize = a.size, bSize = b.size;\n\t\t\tint aData[] = a.data, bData[] = b.data;\n\t\t\tfor (int i = 0;; i += 2) {\n\t\t\t\tint bFrom = i == 0 ? 0 : bData[i - 1];\n\t\t\t\tint bTo = i == bSize - 1 ? n : bData[i + 1];\n\t\t\t\tint bShift = bData[i];\n\t\t\t\tint aFrom = bFrom + bShift;\n\t\t\t\tint aTo = bTo + bShift;\n\t\t\t\tint l = 0, r = aSize - 1;\n\t\t\t\twhile (l < r) {\n\t\t\t\t\tint m = (((l + r) >> 2) << 1) + 1;\n\t\t\t\t\tif (aData[m] <= aFrom) {\n\t\t\t\t\t\tl = m + 1;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tr = m - 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tint cur = l;\n\t\t\t\twhile (true) {\n\t\t\t\t\tres.push(bShift + aData[cur]);\n\t\t\t\t\t++cur;\n\t\t\t\t\tif (cur == aSize) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tint pos = aData[cur];\n\t\t\t\t\tif (pos >= aTo) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tres.push(pos - bShift);\n\t\t\t\t\t++cur;\n\t\t\t\t}\n\t\t\t\tif (i == bSize - 1) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tres.push(bTo);\n\t\t\t}\n\t\t\tputList(a);\n\t\t\tputList(b);\n\t\t}\n\t\treturn res;\n\t}\n\n\tstatic void solve() throws Exception {\n\t\tn = scanInt();\n\t\tm = scanInt();\n\t\tint s = scanInt() - 1;\n\t\tlong t = scanLong();\n\t\tfor (int ct = (int) (t % n); ct != 0; ct--) {\n\t\t\tif (s < m) {\n\t\t\t\ts += ct;\n\t\t\t\tif (s >= n) {\n\t\t\t\t\ts -= n;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\ts -= ct;\n\t\t\t\tif (s < 0) {\n\t\t\t\t\ts += n;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tlong cycles = t / n;\n\t\tif (cycles > 0) {\n\t\t\tIntList cycleSolve = solve(0, n);\n\t\t\tint csSize = cycleSolve.size, csData[] = cycleSolve.data;\n\t\t\tIntList cycleList = takeList();\n\t\t\tIntIntMap cycleMap = new IntIntMap();\n\t\t\tfor (int it = 0;; it++) {\n\t\t\t\tif (it == cycles) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tint prev = cycleMap.get(s, -1);\n\t\t\t\tif (prev >= 0) {\n\t\t\t\t\ts = cycleList.get(prev + (int) ((cycles - prev) % (it - prev)));\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcycleList.push(s);\n\t\t\t\tcycleMap.set(s, it);\n\t\t\t\tint l = 0, r = csSize - 1;\n\t\t\t\twhile (l < r) {\n\t\t\t\t\tint m = (((l + r) >> 2) << 1) + 1;\n\t\t\t\t\tif (csData[m] <= s) {\n\t\t\t\t\t\tl = m + 1;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tr = m - 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\ts += csData[l];\n\t\t\t}\n\t\t}\n\t\tout.print(s + 1);\n\t}\n\n\tstatic int scanInt() throws IOException {\n\t\treturn parseInt(scanString());\n\t}\n\n\tstatic long scanLong() throws IOException {\n\t\treturn parseLong(scanString());\n\t}\n\n\tstatic String scanString() throws IOException {\n\t\twhile (tok == null || !tok.hasMoreTokens()) {\n\t\t\ttok = new StringTokenizer(in.readLine());\n\t\t}\n\t\treturn tok.nextToken();\n\t}\n\n\tstatic BufferedReader in;\n\tstatic PrintWriter out;\n\tstatic StringTokenizer tok;\n\n\tpublic static void main(String[] args) {\n\t\ttry {\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(System.out);\n\t\t\tsolve();\n\t\t\tin.close();\n\t\t\tout.close();\n\t\t} catch (Throwable e) {\n\t\t\te.printStackTrace();\n\t\t\texit(1);\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["brute force", "graphs", "data structures"], "code_uid": "3cd7b4fcd235bcf2989c26fdd036550b", "src_uid": "e743242f0cc9e17619e1fe4935d9fbd0", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Set;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.TreeSet;\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.AbstractCollection;\nimport java.util.TreeMap;\nimport java.util.StringTokenizer;\nimport java.util.Map;\nimport java.io.BufferedReader;\nimport java.util.Collections;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastScanner in = new FastScanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC {\n final double eps = 1e-8;\n\n public void solve(int testNumber, FastScanner in, PrintWriter out) {\n int n = in.nextInt();\n Circle[] circles = new Circle[n];\n for (int i = 0; i < n; i++) {\n int x = in.nextInt();\n int y = in.nextInt();\n int r = in.nextInt();\n circles[i] = new Circle();\n circles[i].o = new Point(x, y);\n circles[i].r = r;\n }\n\n Set<Point> all = new TreeSet<>();\n for (int i = 0; i < n; i++) {\n for (int j = i + 1; j < n; j++) {\n List<Point> inter = intersect(circles[i], circles[j]);\n if (inter == null) {\n continue;\n }\n all.addAll(inter);\n }\n }\n\n Map<Point, Integer> pointId = new TreeMap<>();\n List<Set<Integer>> adj = new ArrayList<>();\n for (int i = 0; i < n; i++) {\n List<Double> angles = new ArrayList<>();\n final int K = 100;\n for (int j = 0; j < K; j++) {\n angles.add(Math.PI * 2 * j / K);\n }\n for (Point p : all) {\n if (circles[i].contains(p)) {\n double dx = p.x - circles[i].o.x;\n double dy = p.y - circles[i].o.y;\n double alpha = Math.atan2(dy, dx);\n if (alpha < 0) {\n alpha += 2 * Math.PI;\n }\n angles.add(alpha);\n }\n }\n Collections.sort(angles);\n Point dir = new Point(1, 0).scale(circles[i].r);\n Double[] as = new TreeSet<>(angles).toArray(new Double[0]);\n for (int j = 0; j < as.length; j++) {\n Point p = circles[i].o.add(dir.rotate(as[j]));\n getId(p, pointId, adj);\n }\n for (int j = 0; j < as.length; j++) {\n Point p = circles[i].o.add(dir.rotate(as[j]));\n Point q = circles[i].o.add(dir.rotate(as[(j + 1) % as.length]));\n int u = pointId.get(p);\n int v = pointId.get(q);\n if (u == v) {\n continue;\n }\n adj.get(u).add(v);\n adj.get(v).add(u);\n }\n }\n\n int v = adj.size();\n int e = 0;\n for (int i = 0; i < v; i++) {\n e += adj.get(i).size();\n }\n e /= 2;\n\n int comps = 0;\n boolean[] was = new boolean[v];\n for (int i = 0; i < v; i++) {\n if (!was[i]) {\n ++comps;\n dfs(i, was, adj);\n }\n }\n\n out.println(1 + comps + e - v);\n }\n\n private void dfs(int i, boolean[] was, List<Set<Integer>> adj) {\n was[i] = true;\n for (int j : adj.get(i)) {\n if (!was[j]) {\n dfs(j, was, adj);\n }\n }\n }\n\n private void getId(Point p, Map<Point, Integer> pointId, List<Set<Integer>> adj) {\n if (!pointId.containsKey(p)) {\n int sz = pointId.size();\n pointId.put(p, sz);\n adj.add(new TreeSet<>());\n }\n }\n\n private List<Point> intersect(Circle c1, Circle c2) {\n double dx = c1.o.x - c2.o.x;\n double dy = c1.o.y - c2.o.y;\n double d = Math.sqrt(dx * dx + dy * dy);\n double cos = (c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d);\n if (cos < -1 - eps) {\n return null;\n }\n if (cos < -1) {\n cos = -1;\n }\n if (cos > 1 + eps) {\n return null;\n }\n if (cos > 1) {\n cos = 1;\n }\n List<Point> res = new ArrayList<>();\n double alpha = Math.acos(cos);\n Point dir = c2.o.sub(c1.o).norm();\n res.add(c1.o.add(dir.scale(c1.r).rotate(+alpha)));\n res.add(c1.o.add(dir.scale(c1.r).rotate(-alpha)));\n return res;\n }\n\n class Point implements Comparable<Point> {\n double x;\n double y;\n\n Point(double x, double y) {\n this.x = x;\n this.y = y;\n }\n\n Point add(Point o) {\n return new Point(x + o.x, y + o.y);\n }\n\n Point sub(Point o) {\n return new Point(x - o.x, y - o.y);\n }\n\n Point rotate(double alpha) {\n double c = Math.cos(alpha);\n double s = Math.sin(alpha);\n double nx = x * c - y * s;\n double ny = x * s + y * c;\n return new Point(nx, ny);\n }\n\n Point norm() {\n double len = length();\n return scale(1.0 / len);\n }\n\n Point scale(double f) {\n return new Point(f * x, f * y);\n }\n\n double length() {\n return Math.sqrt(x * x + y * y);\n }\n\n public String toString() {\n return String.format(\"%.6f %.6f\", x, y);\n }\n\n public boolean equals(Object obj) {\n Point o = (Point) obj;\n return Math.abs(x - o.x) < eps && Math.abs(y - o.y) < eps;\n }\n\n public int compareTo(Point o) {\n if (Math.abs(x - o.x) > eps) {\n return x < o.x ? -1 : 1;\n }\n if (Math.abs(y - o.y) > eps) {\n return y < o.y ? -1 : 1;\n }\n return 0;\n }\n\n }\n\n class Circle {\n Point o;\n double r;\n\n boolean contains(Point p) {\n double dist = p.sub(o).length();\n return Math.abs(dist - r) < eps;\n }\n\n }\n\n }\n\n static class FastScanner {\n private BufferedReader in;\n private StringTokenizer st;\n\n public FastScanner(InputStream stream) {\n in = new BufferedReader(new InputStreamReader(stream));\n }\n\n public String next() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(in.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return st.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["geometry", "graphs"], "code_uid": "855280f48743ce9a851b5b576f2eae32", "src_uid": "bda5879e94a82c6fd499796f258c4691", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.text.DecimalFormat;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.PriorityQueue;\nimport java.util.StringTokenizer;\nimport java.util.stream.IntStream;\n\n/*\n * To change this license header, choose License Headers in Project Properties.\n * To change this template file, choose Tools | Templates\n * and open the template in the editor.\n */\n/**\n *\n * @author Andy Phan\n */\npublic class c {\n\n public static void main(String[] args) {\n FS in = new FS(System.in);\n int n = in.nextInt();\n Circle[] circ = new Circle[n];\n for(int i = 0; i < n; i++) {\n circ[i] = new Circle(new Vec(in.nextInt(), in.nextInt()), in.nextInt());\n }\n ArrayList<Vec> points = new ArrayList<>();\n int[] par = new int[n];\n Arrays.setAll(par, i -> i);\n int res = 1;\n for(int i = 0; i < n; i++) {\n ArrayList<Vec> points2 = new ArrayList<>();\n for(int j = 0; j < n; j++) {\n if(i == j) continue;\n Vec[] arr = circ[i].intersect(circ[j]);\n if(arr == null) continue;\n int a = par[i] = par[par[i]];\n int b = par[j] = par[par[j]];\n par[a] = b;\n outer: for(Vec e : arr) {\n for(Vec e2 : points2) {\n if(e.equals(e2)) continue outer;\n }\n points2.add(e);\n }\n }\n res += points2.size();\n outer: for(Vec e : points2) {\n for(Vec e2 : points) {\n if(e.equals(e2)) continue outer;\n }\n points.add(e);\n }\n }\n res -= points.size();\n res += IntStream.range(0, n).map(i -> 1-Math.abs(Integer.signum(i-par[i]))).sum();\n System.out.println(res);\n }\n \n static class Circle {\n\tVec c;\n\tdouble r;\n\t\n\tpublic Circle(Vec c, double r) {\n\t\tthis.c=c;\n\t\tthis.r=r;\n\t}\n\t\n\tpublic boolean contains(Vec v) { \n return c.sub(v).mag2()-Vec.EPS*Vec.EPS<=r*r;\n\t}\n\t\n\t//when standing at this circle, returns right tangent, then left tangent\n\tpublic Vec[] intersect(Circle o) {\n if (c.equals(o.c)) return null;\n Vec dir=o.c.sub(c);\n double d2=dir.mag2(), d=Math.sqrt(d2);\n if (r+o.r<d||r+d<o.r||o.r+d<r)\n return null;\n \n if (Vec.eq(r+o.r, d)||Vec.eq(o.r+d, r))\n return new Vec[] {c.add(dir.scale(r/d))};\n if (Vec.eq(r+d, o.r))\n return new Vec[] {c.sub(dir.scale(r/d))};\n \n double d1=(r*r+d2-o.r*o.r)/(2*d);\n double h=Math.sqrt(r*r-d1*d1);\n Vec unitDir=dir.unit();\n Vec rInt=c.add(unitDir.scale(d1).add(unitDir.rot270().scale(h)));\n Vec lInt=c.add(unitDir.scale(d1).add(unitDir.rot90().scale(h)));\n return new Vec[] {rInt, lInt};\n\t}\n }\n\n static class Vec {\n static final double EPS = 1e-9;\n \n\tdouble x, y;\n\tpublic Vec(double x, double y) {this.x=x;this.y=y;}\n\tpublic Vec add(Vec o) {return new Vec(x+o.x, y+o.y);}\n\tpublic Vec sub(Vec o) {return new Vec(x-o.x, y-o.y);}\n\tpublic Vec scale(double s) {return new Vec(x*s, y*s);}\n\tpublic double dot(Vec o) {return x*o.x+y*o.y;}\n\tpublic double cross(Vec o) {return x*o.y-y*o.x;}\n\tpublic double mag2() {return dot(this);}\n\tpublic double mag() {return Math.sqrt(mag2());}\n\tpublic Vec unit() {return scale(1/mag());}\n\tpublic Vec rot90() {return new Vec(-y, x);}\n\tpublic Vec rot270() {return new Vec(y, -x);}\n\t\n\tpublic Vec rotate(double theta) {\n double PI=Math.PI;\n double newX=x*Math.cos(theta)+y*Math.cos(PI/2+theta);\n double newY=x*Math.sin(theta)+y*Math.sin(PI/2+theta);\n return new Vec(newX, newY);\n\t}\n\t\n\t//angle between 0 and 2PI\n\tpublic double angle() {\n return (Math.atan2(y, x)+2*Math.PI)%(2*Math.PI);\n\t}\n \n public String toString() {\n DecimalFormat df=new DecimalFormat(\"#.##\");\n return \"(\"+df.format(x)+\", \"+df.format(y)+\")\";\n\t}\n \n\tstatic boolean eq(double a, double b) {return Math.abs(a-b)<EPS;}\n\tstatic boolean leq(double a, double b) {return a-EPS<b;}\n\tstatic boolean geq(double a, double b) {return a+EPS>b;}\n\t\n\tpublic boolean equals(Object oo) {\n Vec o=(Vec)oo;\n return eq(x, o.x)&&eq(y, o.y);\n\t}\n }\n\n\n static class FS {\n\n BufferedReader in;\n StringTokenizer token;\n\n public FS(InputStream str) {\n in = new BufferedReader(new InputStreamReader(str));\n }\n\n public String next() {\n if (token == null || !token.hasMoreElements()) {\n try {\n token = new StringTokenizer(in.readLine());\n } catch (IOException ex) {\n }\n return next();\n }\n return token.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["geometry", "graphs"], "code_uid": "22e3258e7f066ea5c0587e22cf33bb3f", "src_uid": "bda5879e94a82c6fd499796f258c4691", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\n\nimport java.io.FileInputStream;\nimport java.io.FileNotFoundException;\nimport java.io.InputStream;\nimport java.util.Set;\nimport java.util.TreeSet;\n\n/**\n * Created by dalt on 2018/3/25.\n */\npublic class CF933C {\n public static final double PREC = 1e-10;\n static final boolean IS_OJ = System.getProperty(\"ONLINE_JUDGE\") != null;\n public static BlockReader input;\n\n public static void main(String[] args) throws FileNotFoundException {\n if (!IS_OJ) {\n System.setIn(new FileInputStream(\"D:\\\\DataBase\\\\TESTCASE\\\\codeforces\\\\CF933C.in\"));\n }\n input = new BlockReader(System.in);\n\n solve();\n }\n\n public static void solve() {\n int n = input.nextInteger();\n Circle[] circles = new Circle[n];\n\n for (int i = 0; i < n; i++) {\n circles[i] = new Circle(input.nextInteger(), input.nextInteger(), input.nextInteger());\n }\n\n if (n == 3 && !Circle.isIntersect(circles[0], circles[1])) {\n int sum = 4;\n if (Circle.isIntersect2(circles[0], circles[2])) {\n sum++;\n }\n if (Circle.isIntersect2(circles[1], circles[2])) {\n sum++;\n }\n System.out.println(sum);\n return;\n }\n\n int total = 1;\n TreeSet<Point> set = new TreeSet<>();\n for (int i = 0; i < n; i++) {\n set.clear();\n total++;\n for (int j = 0; j < i; j++) {\n Circle.intersectAt(circles[i], circles[j], set);\n }\n if (set.size() >= 2) {\n total += set.size() - 1;\n }\n }\n\n System.out.println(total);\n }\n\n public static double distance(Point a, Point b) {\n return Math.sqrt(distance2(a, b));\n }\n\n public static double distance2(Point a, Point b) {\n double dx = a.x - b.x;\n double dy = a.y - b.y;\n return dx * dx + dy * dy;\n }\n\n public static class Circle {\n Point center;\n int r;\n\n public Circle(int x, int y, int r) {\n this.center = new Point(x, y);\n this.r = r;\n }\n\n public static boolean isIntersect(Circle a, Circle b) {\n double d = distance(a.center, b.center);\n return d <= a.r + b.r + PREC && d + PREC >= Math.abs(a.r - b.r);\n }\n\n public static boolean isIntersect2(Circle a, Circle b) {\n double d = distance(a.center, b.center);\n return d < a.r + b.r && d > Math.abs(a.r - b.r);\n }\n\n public static void intersectAt(Circle a, Circle b, Set<Point> set) {\n if (!isIntersect(a, b)) {\n return;\n }\n\n Line line = new Line(a.center, b.center);\n double d = distance(a.center, b.center);\n double middleDistance = (d * d - b.r * b.r + a.r * a.r) / (2 * d);\n Point middle = a.center.moveAlongLine(line, middleDistance);\n Point alpha = line.asVector().getAlpha();\n double height = Math.sqrt(a.r * a.r - middleDistance * middleDistance);\n Point first = middle.moveAlongVector(alpha, height);\n Point second = middle.moveAlongVector(alpha, -height);\n\n set.add(first);\n if (!second.equals(first)) {\n set.add(second);\n }\n }\n }\n\n public static class Point implements Comparable<Point> {\n double x, y;\n\n public Point(double x, double y) {\n this.x = x;\n this.y = y;\n }\n\n @Override\n public String toString() {\n return \"(\" + x + \",\" + y + \")\";\n }\n\n public Point sub(Point other) {\n return new Point(x - other.x, y - other.y);\n }\n\n public Point moveAlongLine(Line line, double length) {\n return moveAlongVector(line.asVector(), length);\n }\n\n public Point moveAlongVector(Point vec, double length) {\n return add(vec.normalize().mul(length));\n }\n\n public Point add(Point other) {\n return new Point(x + other.x, y + other.y);\n }\n\n public Point mul(double f) {\n return new Point(x * f, y * f);\n }\n\n public Point normalize() {\n double len = Math.sqrt(x * x + y * y);\n return div(len);\n }\n\n public Point div(double f) {\n return new Point(x / f, y / f);\n }\n\n public Point getAlpha() {\n return new Point(-y, x);\n }\n\n @Override\n public boolean equals(Object obj) {\n Point other = (Point) obj;\n return Math.abs(x - other.x) < PREC && Math.abs(y - other.y) < PREC;\n }\n\n @Override\n public int compareTo(Point o) {\n if (equals(o)) {\n return 0;\n }\n if (Math.abs(x - o.x) < PREC) {\n return Double.compare(y, o.y);\n }\n return Double.compare(x, o.x);\n }\n }\n\n public static class Line {\n Point from;\n Point to;\n\n public Line(Point from, Point to) {\n this.from = from;\n this.to = to;\n }\n\n public Point asVector() {\n return to.sub(from);\n }\n\n public double length() {\n return distance(from, to);\n }\n }\n\n public static class BlockReader {\n static final int EOF = -1;\n InputStream is;\n byte[] dBuf;\n int dPos, dSize, next;\n StringBuilder builder = new StringBuilder();\n\n public BlockReader(InputStream is) {\n this(is, 4096);\n }\n\n public BlockReader(InputStream is, int bufSize) {\n this.is = is;\n dBuf = new byte[bufSize];\n next = nextByte();\n }\n\n public int nextByte() {\n while (dPos >= dSize) {\n if (dSize == -1) {\n return EOF;\n }\n dPos = 0;\n try {\n dSize = is.read(dBuf);\n } catch (Exception e) {\n }\n }\n return dBuf[dPos++];\n }\n\n public String nextBlock() {\n builder.setLength(0);\n skipBlank();\n while (next != EOF && !Character.isWhitespace(next)) {\n builder.append((char) next);\n next = nextByte();\n }\n return builder.toString();\n }\n\n public void skipBlank() {\n while (Character.isWhitespace(next)) {\n next = nextByte();\n }\n }\n\n public int nextInteger() {\n skipBlank();\n int ret = 0;\n boolean rev = false;\n if (next == '+' || next == '-') {\n rev = next == '-';\n next = nextByte();\n }\n while (next >= '0' && next <= '9') {\n ret = (ret << 3) + (ret << 1) + next - '0';\n next = nextByte();\n }\n return rev ? -ret : ret;\n }\n\n public int nextBlock(char[] data, int offset) {\n skipBlank();\n int index = offset;\n int bound = data.length;\n while (next != EOF && index < bound && !Character.isWhitespace(next)) {\n data[index++] = (char) next;\n next = nextByte();\n }\n return index - offset;\n }\n\n public boolean hasMore() {\n skipBlank();\n return next != EOF;\n }\n }\n}", "lang_cluster": "Java", "tags": ["geometry", "graphs"], "code_uid": "289544443a59a84c1d60f046c253f890", "src_uid": "bda5879e94a82c6fd499796f258c4691", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package round462;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class C4 {\n\tInputStream is;\n\tPrintWriter out;\n//\tString INPUT = \"3 0 0 3 1 0 2 -2 0 1\";\n//\tString INPUT = \"3 0 0 1 1 0 1 2 0 1\";\n//\tString INPUT = \"3 0 0 5 6 0 5 0 -8 5\";\n//\tString INPUT = \"3 0 0 3 1 0 2 2 0 1\";\n//\tString INPUT = \"3 0 0 9 0 0 8 0 -10 10\";\n//\tString INPUT = \"3 0 10 10 0 -10 10 0 0 1\";\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t\tint n = ni();\n\t\tlong[][] co = new long[n][];\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tco[i] = new long[]{ni(), ni(), ni()};\n\t\t}\n\t\t\n\t\tdouble[][] nodes = new double[10][];\n\t\tint p = 0;\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tfor(int j = i+1;j < n;j++){\n\t\t\t\tdouble[] ts = crossSimple(\n\t\t\t\t\t\tco[i][0], co[i][1], co[i][2],\n\t\t\t\t\t\tco[j][0], co[j][1], co[j][2]\n\t\t\t\t\t\t\t\t);\n\t\t\t\tfor(int k = 0;k < ts.length;k++){\n\t\t\t\t\tnodes[p++] = new double[]{\n\t\t\t\t\t\t\tco[i][0] + co[i][2] * Math.cos(ts[k]),\n\t\t\t\t\t\t\tco[i][1] + co[i][2] * Math.sin(ts[k])\n\t\t\t\t\t};\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tnodes = Arrays.copyOf(nodes, p);\n\t\tint q = 0;\n\t\touter:\n\t\tfor(int i = 0;i < p;i++){\n\t\t\tfor(int j = i+1;j < p;j++){\n\t\t\t\tif(d2(nodes[i][0], nodes[i][1], nodes[j][0], nodes[j][1]) < 1e-12){\n\t\t\t\t\tcontinue outer;\n\t\t\t\t}\n\t\t\t}\n\t\t\tnodes[q++] = nodes[i];\n\t\t}\n\t\t\n\t\tint nnodes = q;\n\t\tint ne = 0;\n\t\tint con = 1;\n\t\tfor(int j = 0;j < n;j++){\n\t\t\tint e = 0;\n\t\t\tfor(int i = 0;i < q;i++){\n\t\t\t\tif(Math.abs(d2(nodes[i][0], nodes[i][1], co[j][0], co[j][1])-co[j][2]*co[j][2]) < 1e-12){\n\t\t\t\t\te++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(e == 0)con++;\n\t\t\tne += e;\n\t\t}\n\t\tif(con > n)con = n;\n\t\tout.println(ne-nnodes+con+1);\n\t}\n\t\n\tpublic static double d2(double ax, double ay, double bx, double by)\n\t{\n\t\treturn (bx - ax) * (bx - ax) + (by - ay) * (by - ay);\n\t}\n\n\t\n\tstatic double EPS = 1E-10;\n\t\n\t// 円(x,y,r)と円(tx,ty,tr)の交わりの偏角を返す。全く同じ円の場合は交わらないとしている\n\tpublic static double[] crossSimple(long x, long y, long r, long tx, long ty, long tr)\n\t{\n\t\tlong d2 = d2(x, y, tx, ty);\n\t\tif(d2 < (r-tr)*(r-tr))return new double[0]; // covered or covering\n\t\tif(d2 > (r+tr)*(r+tr))return new double[0]; // not intersects or touched\n\t\tdouble base = Math.atan2(ty-y, tx-x);\n\t\tdouble wing = Math.acos((d2+r*r-tr*tr)/(2*Math.sqrt(d2)*r)); // Law of cosines\n//\t\tassert Double.isFinite(base);\n//\t\tassert Double.isFinite(wing);\n\t\tdouble inf = base - wing, sup = base + wing;\n\t\treturn new double[]{inf, sup};\n\t}\n\t\n\tpublic static long d2(long ax, long ay, long bx, long by)\n\t{\n\t\treturn (bx-ax)*(bx-ax)+(by-ay)*(by-ay);\n\t}\n\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new C4().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["geometry", "graphs"], "code_uid": "519589a7247cde28b29ce23f814f0843", "src_uid": "bda5879e94a82c6fd499796f258c4691", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Set;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.TreeSet;\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.AbstractCollection;\nimport java.util.TreeMap;\nimport java.util.StringTokenizer;\nimport java.util.Map;\nimport java.io.BufferedReader;\nimport java.util.Collections;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastScanner in = new FastScanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC {\n final double eps = 1e-8;\n\n public void solve(int testNumber, FastScanner in, PrintWriter out) {\n int n = in.nextInt();\n Circle[] circles = new Circle[n];\n for (int i = 0; i < n; i++) {\n int x = in.nextInt();\n int y = in.nextInt();\n int r = in.nextInt();\n circles[i] = new Circle();\n circles[i].o = new Point(x, y);\n circles[i].r = r;\n }\n\n Set<Point> all = new TreeSet<>();\n for (int i = 0; i < n; i++) {\n for (int j = i + 1; j < n; j++) {\n List<Point> inter = intersect(circles[i], circles[j]);\n if (inter == null) {\n continue;\n }\n all.addAll(inter);\n }\n }\n\n Map<Point, Integer> pointId = new TreeMap<>();\n List<List<Integer>> adj = new ArrayList<>();\n for (int i = 0; i < n; i++) {\n List<Double> angles = new ArrayList<>();\n final int K = 3;\n for (int j = 0; j < K; j++) {\n angles.add(Math.PI * 2 * j / K);\n }\n for (Point p : all) {\n if (circles[i].contains(p)) {\n double dx = p.x - circles[i].o.x;\n double dy = p.y - circles[i].o.y;\n double alpha = Math.atan2(dy, dx);\n if (alpha < 0) {\n alpha += 2 * Math.PI;\n }\n angles.add(alpha);\n }\n }\n Collections.sort(angles);\n Point dir = new Point(1, 0).scale(circles[i].r);\n Double[] as = new TreeSet<>(angles).toArray(new Double[0]);\n for (int j = 0; j < as.length; j++) {\n Point p = circles[i].o.add(dir.rotate(as[j]));\n getId(p, pointId, adj);\n }\n for (int j = 0; j < as.length; j++) {\n Point p = circles[i].o.add(dir.rotate(as[j]));\n Point q = circles[i].o.add(dir.rotate(as[(j + 1) % as.length]));\n int u = pointId.get(p);\n int v = pointId.get(q);\n if (u == v) {\n continue;\n }\n adj.get(u).add(v);\n adj.get(v).add(u);\n }\n }\n\n int v = adj.size();\n int e = 0;\n for (int i = 0; i < v; i++) {\n e += adj.get(i).size();\n }\n e /= 2;\n\n int comps = 0;\n boolean[] was = new boolean[v];\n for (int i = 0; i < v; i++) {\n if (!was[i]) {\n ++comps;\n dfs(i, was, adj);\n }\n }\n\n out.println(1 + comps + e - v);\n }\n\n private void dfs(int i, boolean[] was, List<List<Integer>> adj) {\n was[i] = true;\n for (int j : adj.get(i)) {\n if (!was[j]) {\n dfs(j, was, adj);\n }\n }\n }\n\n private void getId(Point p, Map<Point, Integer> pointId, List<List<Integer>> adj) {\n if (!pointId.containsKey(p)) {\n int sz = pointId.size();\n pointId.put(p, sz);\n adj.add(new ArrayList<>());\n }\n }\n\n private List<Point> intersect(Circle c1, Circle c2) {\n double dx = c1.o.x - c2.o.x;\n double dy = c1.o.y - c2.o.y;\n double d = Math.sqrt(dx * dx + dy * dy);\n double cos = (c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d);\n if (cos < -1 - eps) {\n return null;\n }\n if (cos < -1) {\n cos = -1;\n }\n if (cos > 1 + eps) {\n return null;\n }\n if (cos > 1) {\n cos = 1;\n }\n List<Point> res = new ArrayList<>();\n double alpha = Math.acos(cos);\n Point dir = c2.o.sub(c1.o).norm();\n res.add(c1.o.add(dir.scale(c1.r).rotate(+alpha)));\n res.add(c1.o.add(dir.scale(c1.r).rotate(-alpha)));\n return res;\n }\n\n class Point implements Comparable<Point> {\n double x;\n double y;\n\n Point(double x, double y) {\n this.x = x;\n this.y = y;\n }\n\n Point add(Point o) {\n return new Point(x + o.x, y + o.y);\n }\n\n Point sub(Point o) {\n return new Point(x - o.x, y - o.y);\n }\n\n Point rotate(double alpha) {\n double c = Math.cos(alpha);\n double s = Math.sin(alpha);\n double nx = x * c - y * s;\n double ny = x * s + y * c;\n return new Point(nx, ny);\n }\n\n Point norm() {\n double len = length();\n return scale(1.0 / len);\n }\n\n Point scale(double f) {\n return new Point(f * x, f * y);\n }\n\n double length() {\n return Math.sqrt(x * x + y * y);\n }\n\n public String toString() {\n return String.format(\"%.6f %.6f\", x, y);\n }\n\n public boolean equals(Object obj) {\n Point o = (Point) obj;\n return Math.abs(x - o.x) < eps && Math.abs(y - o.y) < eps;\n }\n\n public int compareTo(Point o) {\n if (Math.abs(x - o.x) > eps) {\n return x < o.x ? -1 : 1;\n }\n if (Math.abs(y - o.y) > eps) {\n return y < o.y ? -1 : 1;\n }\n return 0;\n }\n\n }\n\n class Circle {\n Point o;\n double r;\n\n boolean contains(Point p) {\n double dist = p.sub(o).length();\n return Math.abs(dist - r) < eps;\n }\n\n }\n\n }\n\n static class FastScanner {\n private BufferedReader in;\n private StringTokenizer st;\n\n public FastScanner(InputStream stream) {\n in = new BufferedReader(new InputStreamReader(stream));\n }\n\n public String next() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(in.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return st.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["geometry", "graphs"], "code_uid": "cdd0d73d7515ab23f4a997a1dfbfcfa1", "src_uid": "bda5879e94a82c6fd499796f258c4691", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.awt.Point;\nimport java.io.BufferedReader;\nimport java.io.BufferedWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Set;\nimport java.util.StringTokenizer;\n\n\npublic class D {\n \n static StringTokenizer st;\n static BufferedReader in;\n static int[]f;\n static ArrayList<Integer>[]g, gt;\n static boolean[] used, used2;\n public static void main(String[] args) throws IOException {\n in = new BufferedReader(new InputStreamReader(System.in));\n PrintWriter pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n int n = nextInt();\n int m = nextInt();\n f = new int[n+1];\n for (int i = 1; i <= n; i++) {\n f[i] = nextInt();\n }\n g = new ArrayList[n+1];\n gt = new ArrayList[n+1];\n for (int i = 1; i <= n; i++) {\n g[i] = new ArrayList<Integer>();\n gt[i] = new ArrayList<Integer>();\n }\n for (int i = 1; i <= m; i++) {\n int v1 = nextInt();\n int v2 = nextInt();\n g[v1].add(v2);\n gt[v2].add(v1);\n }\n used = new boolean[n+1];\n used2 = new boolean[n+1];\n for (int i = 1; i <= n; i++) {\n if (f[i]==1 && !used[i])\n dfs(i);\n if (f[i]==2 && !used2[i])\n dfs2(i);\n }\n for (int i = 1; i <= n; i++) {\n if (used[i] && used2[i])\n pw.println(1);\n else\n pw.println(0);\n }\n pw.close();\n }\n private static void dfs2(int v) {\n used2[v] = true;\n if (f[v]==1)\n return;\n for (int to : gt[v]) {\n if (!used2[to])\n dfs2(to);\n }\n }\n private static void dfs(int v) {\n used[v] = true;\n for (int to : g[v]) {\n if (!used[to])\n dfs(to);\n }\n }\n private static int nextInt() throws IOException{\n return Integer.parseInt(next());\n }\n \n private static String next() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(in.readLine());\n }\n return st.nextToken();\n }\n}\n", "lang_cluster": "Java", "tags": ["graphs"], "code_uid": "f2185a5517f4421ad55c3dba5085406d", "src_uid": "87d869a0fd4a510c5e7e310886b86a57", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class backforth implements Runnable {\n\tpublic StringTokenizer strtok;\n\tpublic BufferedReader inr;\n\tpublic PrintWriter out;\n\n\tpublic static void main(String[] args) {\n\t\tnew Thread(new backforth()).start();\n\t}\n\n\tpublic static final String taskname = \"backforth\";\n\n\tpublic void run() {\n\t\tLocale.setDefault(Locale.US);\n\t\tboolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\t\ttry {\n\t\t\tinr = new BufferedReader(oj ? new InputStreamReader(System.in, \"ISO-8859-1\") : new FileReader(taskname + \".in\"));\n\t\t\tout = new PrintWriter(oj ? new OutputStreamWriter(System.out, \"ISO-8859-1\") : new FileWriter(taskname + \".out\"));\n\t\t\tsolve();\n\t\t} catch (Exception e) {\n\t\t\tif (!oj)\n\t\t\t\te.printStackTrace();\n\t\t\tSystem.exit(9000);\n\t\t} finally {\n\t\t\tout.flush();\n\t\t\tout.close();\n\t\t}\n\t}\n\n\tpublic String nextToken() throws IOException {\n\t\twhile (strtok == null || !strtok.hasMoreTokens()) {\n\t\t\tstrtok = new StringTokenizer(inr.readLine());\n\t\t}\n\t\treturn strtok.nextToken();\n\t}\n\n\tpublic int nextInt() throws NumberFormatException, IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\t// Solution\n\t\n\tbyte[] action;\n\tArrayList<HashSet<Integer>> g;\n\tArrayList<HashSet<Integer>> revg;\n\t\n\tboolean[] visited_from_write;\n\tboolean[] visited_from_read;\n\t\n\tpublic void dfs_from_write(int start) {\n\t\tStack<Integer> stack = new Stack<Integer>();\n\t\tstack.add(start);\n\t\twhile(!stack.isEmpty()) {\n\t\t\tint node = stack.pop();\n\t\t\tvisited_from_write[node] = true;\n\t\t\tHashSet<Integer> neighbours = g.get(node);\n\t\t\tfor (int neigh : neighbours) {\n\t\t\t\tif (visited_from_write[neigh]) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tstack.add(neigh);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tpublic void dfs_from_read(int start) {\n\t\tStack<Integer> stack = new Stack<Integer>();\n\t\tstack.add(start);\n\t\twhile(!stack.isEmpty()) {\n\t\t\tint node = stack.pop();\n\t\t\tvisited_from_read[node] = true;\n\t\t\tif (action[node] == 1) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tHashSet<Integer> neighbours = revg.get(node);\n\t\t\tfor (int neigh : neighbours) {\n\t\t\t\tif (visited_from_read[neigh]) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tstack.add(neigh);\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic void solve() throws NumberFormatException, IOException {\n\t\tint n = nextInt(), m = nextInt();\n\t\taction = new byte[n];\n\t\tg = new ArrayList<HashSet<Integer>>(n);\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tg.add(new HashSet<Integer>());\n\t\t}\n\t\trevg = new ArrayList<HashSet<Integer>>(n);\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\trevg.add(new HashSet<Integer>());\n\t\t}\n\t\tvisited_from_write = new boolean[n];\n\t\tvisited_from_read = new boolean[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\taction[i] = (byte)nextInt();\n\t\t}\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tint a = nextInt() - 1;\n\t\t\tint b = nextInt() - 1;\n\t\t\tg.get(a).add(b);\n\t\t\trevg.get(b).add(a);\n\t\t}\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (action[i] == 1 && !visited_from_write[i]) {\n\t\t\t\tdfs_from_write(i);\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (action[i] == 2 && !visited_from_read[i]) {\n\t\t\t\tdfs_from_read(i);\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (visited_from_write[i] && visited_from_read[i]) {\n\t\t\t\tout.println(1);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tout.println(0);\n\t\t\t}\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["graphs"], "code_uid": "bfef288f8fe84447b4edc2ce957f2442", "src_uid": "87d869a0fd4a510c5e7e310886b86a57", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class D {\n static boolean[] vis1, vis2;\n static boolean[] source, destination;\n static ArrayList<ArrayList<Integer>> graph1, graph2;\n\n public static void dfs1(int cur) {\n vis1[cur] = true;\n for (Integer i : graph1.get(cur)) {\n if (!vis1[i]&&!source[i])\n dfs1(i);\n }\n }\n\n public static void dfs2(int cur) {\n vis2[cur] = true;\n if(source[cur]) return;\n for (Integer i : graph2.get(cur)) {\n if (!vis2[i])\n dfs2(i);\n }\n }\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int m = sc.nextInt();\n graph1 = new ArrayList<ArrayList<Integer>>();\n graph2 = new ArrayList<ArrayList<Integer>>();\n source = new boolean[n];\n destination = new boolean[n];\n for (int i = 0; i < n; i++) {\n graph1.add(new ArrayList<Integer>());\n graph2.add(new ArrayList<Integer>());\n }\n for (int i = 0; i < n; i++) {\n int val = sc.nextInt();\n if (val == 1) {\n source[i] = true;\n } else if (val == 2) {\n destination[i] = true;\n }\n }\n for (int i = 0; i < m; i++) {\n int f = sc.nextInt() - 1;\n int s = sc.nextInt() - 1;\n graph1.get(f).add(s);\n graph2.get(s).add(f);\n }\n vis1 = new boolean[n];\n vis2 = new boolean[n];\n for (int i = 0; i < n; i++) {\n if (source[i]) {\n dfs1(i);\n }\n }\n for (int i = 0; i < n; i++) {\n if (destination[i]) {\n dfs2(i);\n }\n }\n for (int i = 0; i < n; i++) {\n if (vis1[i] && vis2[i]) {\n System.out.println(1);\n } else {\n System.out.println(0);\n }\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["graphs"], "code_uid": "390799380208f46c5428290a75b730fc", "src_uid": "87d869a0fd4a510c5e7e310886b86a57", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\npublic class D {\n\tprivate static void solve() throws IOException {\n\t\tn = nextInt();\n\t\tm = nextInt();\n\t\tf = new int[n+1];\n\t\tboolean[] visF = new boolean[n+1];\n\t\tboolean[] visE = new boolean[n+1];\n\t\tQueue<Integer> starts = new LinkedList<Integer>(); //all the locations of starts\n\t\tQueue<Integer> ends = new LinkedList<Integer>(); //all the locations of ends\n\t\tfor(int i = 1; i < n+1; i++) {\n\t\t\tf[i] = nextInt();\n\t\t\tif(f[i] == 1)\n\t\t\t\tstarts.add(i);\n\t\t\telse if(f[i] == 2)\n\t\t\t\tends.add(i);\n\t\t}\n\t\tadj = new ArrayList[n+1];\n\t\tback = new ArrayList[n+1];\n\t\tfor(int i = 0; i < n+1; i++) {\n\t\t\tadj[i] = new ArrayList<Integer>();\n\t\t\tback[i] = new ArrayList<Integer>();\n\t\t}\n\t\tfor(int i = 0; i < m; i++) {\n\t\t\tint f = nextInt();\n\t\t\tint s = nextInt();\n\t\t\tadj[f].add(s);\n\t\t\tback[s].add(f);\n\t\t}\n\t\t//see if can be found from a 1\n\t\twhile(!starts.isEmpty()) {\n\t\t\tint cur = starts.poll();\n\t\t\tif(visF[cur])\n\t\t\t\tcontinue;\n\t\t\tvisF[cur] = true;\n\t\t\tArrayList<Integer> temp = adj[cur];\n\t\t\tfor(int i = 0; i < temp.size(); i++) {\n\t\t\t\tstarts.add(temp.get(i));\n\t\t\t}\n\t\t}\n\t\twhile(!ends.isEmpty()) {\n\t\t\tint cur = ends.poll();\n\t\t\tif(visE[cur])\n\t\t\t\tcontinue;\n\t\t\tvisE[cur] = true;\n\t\t\tif(f[cur] == 1)\n\t\t\t\tcontinue;\n\t\t\tArrayList<Integer> temp = back[cur];\n\t\t\tfor(int i = 0; i < temp.size(); i++) {\n\t\t\t\tends.add(temp.get(i));\n\t\t\t}\n\t\t}\n\t\tfor(int i = 1; i < visF.length; i++) {\n\t\t\tif(visF[i] && visE[i])\n\t\t\t\tout.println(1);\n\t\t\telse\n\t\t\t\tout.println(0);\n\t\t}\n\t}\n\tstatic int b, n, m, k, l;\n\tstatic int[] a, f;\n\tstatic ArrayList<Integer>[] adj, back;\n\t\n\tpublic static void main(String[] args) {\n\t\ttry {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(System.out);\n\t\t\tsolve();\n\t\t\tout.close();\n\t\t} catch (Throwable e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(239);\n\t\t}\n\t}\n\n\tstatic BufferedReader br;\n\tstatic StringTokenizer st;\n\tstatic PrintWriter out;\n\n\tstatic String nextToken() throws IOException {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\tString line = br.readLine();\n\t\t\tif (line == null) {\n\t\t\t\treturn null;\n\t\t\t}\n\t\t\tst = new StringTokenizer(line);\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tstatic int nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tstatic long nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tstatic double nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n}\n", "lang_cluster": "Java", "tags": ["graphs"], "code_uid": "9636ed1813172aef60ef7371891fc90c", "src_uid": "87d869a0fd4a510c5e7e310886b86a57", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.HashSet;\nimport java.util.StringTokenizer;\n\n\npublic class VKRound3A {\n static BufferedReader br = new BufferedReader(new InputStreamReader(\n System.in));\n static StringTokenizer st = new StringTokenizer(\"\");\n static int nextInt() throws Exception {\n return Integer.parseInt(next());\n }\n static String next() throws Exception {\n while (true) {\n if (st.hasMoreTokens()) {\n return st.nextToken();\n }\n String s = br.readLine();\n if (s == null) {\n return null;\n }\n st = new StringTokenizer(s);\n }\n }\n static int n, m;\n static int state [];\n static ArrayList<Integer> graph1 [];\n static ArrayList<Integer> graph2 [];\n static boolean vis1 [], vis2 [];\n public static void dfs_source(int idx){\n vis1[idx] = true;\n for(Integer nxt : graph1[idx]){\n if(!vis1[nxt] && state[nxt] != 1)\n dfs_source(nxt);\n }\n }\n \n public static void dfs_dest(int idx){\n vis2[idx] = true;\n if(state[idx] == 1)\n return;\n for(Integer nxt : graph2[idx]){\n if(!vis2[nxt])\n dfs_dest(nxt);\n }\n }\n \n @SuppressWarnings(\"unchecked\")\n public static void main(String[] args)throws Exception {\n n = nextInt();\n m = nextInt();\n state = new int [n + 1];\n vis1 = new boolean [n + 1];\n vis2 = new boolean [n + 1];\n graph1 = new ArrayList [n + 1];\n graph2 = new ArrayList [n + 1];\n for(int i = 0 ; i < n + 1 ; ++i)\n graph1[i] = new ArrayList<Integer>();\n for(int i = 0 ; i < n + 1 ; ++i)\n graph2[i] = new ArrayList<Integer>();\n for(int i = 1 ; i < n + 1 ; ++i)\n state[i] = nextInt();\n for(int i = 0 ; i < m ; ++i){\n int a = nextInt();\n int b = nextInt();\n graph1[a].add(b);\n graph2[b].add(a);\n }\n for(int i = 1 ; i < n + 1 ; ++i){\n if(state[i] == 1 && !vis1[i])\n dfs_source(i);\n } \n for(int i = 1 ; i < n + 1 ; ++i){\n if(state[i] == 2 && !vis2[i])\n dfs_dest(i);\n }\n for(int i = 1 ; i < n + 1 ; ++i){\n if(vis1[i] && vis2[i])\n System.out.println(1);\n else\n System.out.println(0);\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["graphs"], "code_uid": "755b841229442f4a379e305f768764de", "src_uid": "87d869a0fd4a510c5e7e310886b86a57", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.awt.Point;\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.InputMismatchException;\n\npublic class R3_D2_D {\n static ArrayList<Integer>[] edge;\n static ArrayList<Integer>[] revEdge;\n static boolean vis1[];\n static boolean vis2[];\n\n public static void dfs1(int index) {\n if (!vis1[index]) {\n vis1[index] = true;\n for (int a : edge[index])\n dfs1(a);\n }\n }\n\n public static void dfs2(int index) {\n if (!vis2[index]) {\n vis2[index] = true;\n for (int a : revEdge[index])\n dfs2(a);\n }\n }\n\n public static void main(String[] args) {\n // BufferedReader in = new BufferedReader(new\n // InputStreamReader(System.in));\n\n InputReader in = new InputReader(System.in);\n int n = in.readInt();\n int m = in.readInt();\n vis1 = new boolean[n];\n vis2 = new boolean[n];\n int[] inp = new int[n];\n for (int i = 0; i < inp.length; i++) {\n inp[i] = in.readInt();\n }\n edge = new ArrayList[n];\n revEdge = new ArrayList[n];\n for (int j = 0; j < inp.length; j++) {\n edge[j] = new ArrayList<Integer>();\n revEdge[j] = new ArrayList<Integer>();\n }\n for (int i = 0; i < m; i++) {\n int a = in.readInt() - 1;\n int b = in.readInt() - 1;\n if(inp[b]==1)\n continue;\n edge[a].add(b);\n revEdge[b].add(a);\n }\n for (int i = 0; i < inp.length; i++) {\n if (inp[i] == 1)\n dfs1(i);\n }\n for (int i = 0; i < inp.length; i++) {\n if (inp[i] == 2)\n dfs2(i);\n }\n for (int i = 0; i < inp.length; i++) {\n if(vis1[i] && vis2[i])\n System.out.println(1);\n else\n System.out.println(0);\n }\n }\n\n public static class tr {\n int x;\n int y;\n int z;\n\n public tr(int a, int b, int c) {\n x = a;\n y = b;\n z = c;\n }\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1000];\n private int curChar, numChars;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n private int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public long readLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public String readString() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuffer res = new StringBuffer();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n private boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n private String readLine0() {\n StringBuffer buf = new StringBuffer();\n int c = read();\n while (c != '\\n' && c != -1) {\n buf.appendCodePoint(c);\n c = read();\n }\n return buf.toString();\n }\n\n public String readLine() {\n String s = readLine0();\n while (s.trim().length() == 0)\n s = readLine0();\n return s;\n }\n\n public String readLine(boolean ignoreEmptyLines) {\n if (ignoreEmptyLines)\n return readLine();\n else\n return readLine0();\n }\n\n public char readCharacter() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n return (char) c;\n }\n\n public double readDouble() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, readInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, readInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n }\n\n}\n", "lang_cluster": "Java", "tags": ["graphs"], "code_uid": "7722819534b1435c58ddf864bd3d7128", "src_uid": "87d869a0fd4a510c5e7e310886b86a57", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.ArrayList;\nimport java.util.HashMap;\nimport java.util.List;\nimport java.util.Scanner;\nimport java.util.Stack;\n\n\npublic class CF_164D {\n\n\tpublic static void main(String[] args) {\n\t\tnew CF_164D().solve();\n\t}\n\t\n\tprivate void solve() {\n\t\tScanner in = new Scanner(System.in);\n\t\tint numNodes = in.nextInt();\n\t\tint numEdges = in.nextInt();\n\t\t\n\t\tboolean[] rfs = new boolean[numNodes];\n\t\tboolean[] rfe = new boolean[numNodes];\n\t\tint[] type = new int[numNodes];\n\t\t\n\t\tHashMap<Integer, List<Integer>> fwdEdges = new HashMap<Integer, List<Integer>>();\n\t\tHashMap<Integer, List<Integer>> revEdges = new HashMap<Integer, List<Integer>>();\n\n\t\tStack<Integer> startNodes = new Stack<Integer>();\n\t\tStack<Integer> endNodes = new Stack<Integer>();\n\t\t\n\t\t// read nodes\n\t\tfor(int i = 0; i < numNodes; i++) {\n\t\t\ttype[i] = in.nextInt();\n\t\t\tfwdEdges.put(i, new ArrayList<Integer>());\n\t\t\trevEdges.put(i, new ArrayList<Integer>());\n\n\t\t\tif(type[i] == 1) {\n\t\t\t\tstartNodes.push(i);\n\t\t\t} else if (type[i] == 2) {\n\t\t\t\tendNodes.push(i);\n\t\t\t}\n\t\t}\n\t\t\n\t\t// read edges\n\t\tfor(int i = 0; i < numEdges; i++) {\n\t\t\tint a = in.nextInt() - 1;\n\t\t\tint b = in.nextInt() - 1;\n\t\t\tfwdEdges.get(a).add(b);\n\t\t\trevEdges.get(b).add(a);\n\t\t}\n\t\t\n\t\t// find all nodes reachable from start nodes without visiting an end node\n\t\t// (traverse forward edges)\n\t\twhile(!startNodes.empty()) {\n\t\t\tint node = startNodes.pop();\n\t\t\tif(rfs[node]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t\n\t\t\trfs[node] = true;\n\t\t\t//if(type[node] == 2) {\n\t\t\t//\tcontinue;\n\t\t\t//}\n\t\t\tfor(int next : fwdEdges.get(node)) {\n\t\t\t\tstartNodes.push(next);\n\t\t\t}\n\t\t}\n\t\t\n\t\t// find all nodes reachable from end nodes without visiting a start node\n\t\t// (traverse reverse edges)\n\t\twhile(!endNodes.empty()) {\n\t\t\tint node = endNodes.pop();\n\t\t\tif(rfe[node]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t\n\t\t\trfe[node] = true;\n\t\t\tif(type[node] == 1) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor(int next : revEdges.get(node)) {\n\t\t\t\tendNodes.push(next);\n\t\t\t}\n\t\t}\t\t\n\t\t\n\t\tfor(int i = 0; i < numNodes; i++) {\n\t\t\tSystem.out.println(rfs[i] && rfe[i] ? \"1\" : \"0\");\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["graphs"], "code_uid": "1c018f0e8744effc92e6baecf7d056b4", "src_uid": "87d869a0fd4a510c5e7e310886b86a57", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Iterator;\nimport java.util.List;\nimport java.util.StringTokenizer;\n\npublic class Solver {\n\n StringTokenizer st;\n BufferedReader in;\n PrintWriter out;\n\n public static void main(String[] args) throws NumberFormatException, IOException {\n Solver solver = new Solver();\n solver.open();\n solver.solve();\n solver.close();\n }\n\n public void open() throws IOException {\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n }\n\n public String nextToken() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(in.readLine());\n }\n return st.nextToken();\n }\n\n public int nextInt() throws NumberFormatException, IOException {\n return Integer.parseInt(nextToken());\n }\n\n public long nextLong() throws NumberFormatException, IOException {\n return Long.parseLong(nextToken());\n }\n\n public double nextDouble() throws NumberFormatException, IOException {\n return Double.parseDouble(nextToken());\n }\n\n enum State{\n IGNORE,ASSIGN,USE;\n \n public static State getState(int v){\n switch(v){\n case 0:\n return IGNORE;\n case 1:\n return ASSIGN;\n case 2:\n return USE;\n default:\n return null;\n }\n }\n }\n \n public void solve() throws NumberFormatException, IOException {\n int n = nextInt();\n int m = nextInt();\n \n State[] states = new State[n];\n List<List<Integer>> child = new ArrayList<List<Integer>>(n);\n List<List<Integer>> rev = new ArrayList<List<Integer>>(n);\n List<Integer> whenUsed = new ArrayList<Integer>();\n List<Integer> whenAssi = new ArrayList<Integer>();\n boolean[] forward = new boolean[n];\n boolean[] back = new boolean[n];\n \n for (int i=0;i<n;i++){\n child.add(new ArrayList<Integer>());\n rev.add(new ArrayList<Integer>());\n int vertex = nextInt();\n State state = State.getState(vertex);\n states[i] = state;\n if (state==State.USE){\n whenUsed.add(i);\n }else if(state==State.ASSIGN){\n whenAssi.add(i);\n }\n }\n\n for (int i=0;i<m;i++){\n int from = nextInt()-1;\n int to = nextInt()-1;\n \n child.get(from).add(to);\n rev.get(to).add(from);\n }\n \n while (whenAssi.size()>0){\n List<Integer> tmp = new ArrayList<Integer>();\n for (int vert:whenAssi){\n if (!forward[vert]){\n forward[vert] = true;\n tmp.addAll(child.get(vert));\n }\n }\n whenAssi = tmp;\n }\n \n while (whenUsed.size()>0){\n List<Integer> tmp = new ArrayList<Integer>();\n for (int vert:whenUsed){\n if (!back[vert]){\n back[vert] = true;\n if (states[vert]!=State.ASSIGN){\n tmp.addAll(rev.get(vert));\n }\n }\n }\n whenUsed = tmp;\n }\n \n for (int i=0;i<n;i++){\n if (forward[i] && back[i]){\n out.println(1);\n }else{\n out.println(0);\n }\n }\n }\n\n public void close() {\n out.flush();\n out.close();\n }\n\n}", "lang_cluster": "Java", "tags": ["graphs"], "code_uid": "d20236cfef4f361d0b91fa6699ed1606", "src_uid": "87d869a0fd4a510c5e7e310886b86a57", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import static java.lang.Integer.parseInt;\nimport static java.lang.Long.parseLong;\nimport static java.lang.Math.max;\nimport static java.lang.System.exit;\nimport static java.util.Arrays.fill;\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class G {\n\n\tstatic final long inf = Long.MAX_VALUE / 2;\n\n\tstatic void solve() throws Exception {\n\t\tint k = scanInt();\n\t\tlong f[] = new long[6];\n\t\tfor (int i = 0; i < 6; i++) {\n\t\t\tf[i] = scanLong();\n\t\t}\n\t\tlong dyn[] = new long[1000000], ndyn[] = new long[1000000];\n\t\tfill(dyn, 1, 1000000, -inf);\n\t\tint p10 = 1;\n\t\tint smpos[] = new int[1000000];\n\t\tfor (int p = 0; p < 6; p++) {\n\t\t\tfill(ndyn, -inf);\n\t\t\tlong cf = f[p];\n\t\t\tint s = 3 * p10;\n\t\t\tfor (int i = 0; i < 1000000; i++) {\n\t\t\t\tdyn[i] -= i / s * cf;\n\t\t\t}\n\t\t\tfor (int m = 0; m < s; m++) {\n\t\t\t\tint smhead = 0, smtail = 0;\n\t\t\t\tfor (int i = m; i < 1000000; i += s) {\n\t\t\t\t\twhile (smtail > smhead && dyn[i] >= dyn[smpos[smtail - 1]]) {\n\t\t\t\t\t\t--smtail;\n\t\t\t\t\t}\n\t\t\t\t\tsmpos[smtail++] = i;\n\t\t\t\t\tlong v = dyn[smpos[smhead]] + i / s * cf;\n\t\t\t\t\tndyn[i] = max(ndyn[i], v);\n\t\t\t\t\tif (i + p10 < 1000000) {\n\t\t\t\t\t\tndyn[i + p10] = max(ndyn[i + p10], v);\n\t\t\t\t\t}\n\t\t\t\t\tif (i + 2 * p10 < 1000000) {\n\t\t\t\t\t\tndyn[i + 2 * p10] = max(ndyn[i + 2 * p10], v);\n\t\t\t\t\t}\n\t\t\t\t\tif (smpos[smhead] == i - (long) (9 * k - 9) * p10) {\n\t\t\t\t\t\t++smhead;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int i = 0; i < 1000000; i++) {\n\t\t\t\tfor (int ss = 9 * k - 6; ss <= 9 * k; ss++) {\n\t\t\t\t\tif (i - (long) ss * p10 >= 0) {\n\t\t\t\t\t\tndyn[i] = max(ndyn[i], dyn[i - ss * p10] + ((i - ss * p10) / s + (ss % 3 == 0 ? ss / 3 : 3 * k - 3)) * cf);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tp10 *= 10;\n\t\t\tlong t[] = dyn;\n\t\t\tdyn = ndyn;\n\t\t\tndyn = t;\n\t\t}\n\t\tint q = scanInt();\n\t\tfor (int qq = 0; qq < q; qq++) {\n\t\t\tout.println(dyn[scanInt()]);\n\t\t}\n\t}\n\n\tstatic int scanInt() throws IOException {\n\t\treturn parseInt(scanString());\n\t}\n\n\tstatic long scanLong() throws IOException {\n\t\treturn parseLong(scanString());\n\t}\n\n\tstatic String scanString() throws IOException {\n\t\twhile (tok == null || !tok.hasMoreTokens()) {\n\t\t\ttok = new StringTokenizer(in.readLine());\n\t\t}\n\t\treturn tok.nextToken();\n\t}\n\n\tstatic BufferedReader in;\n\tstatic PrintWriter out;\n\tstatic StringTokenizer tok;\n\n\tpublic static void main(String[] args) {\n\t\ttry {\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(System.out);\n\t\t\tsolve();\n\t\t\tin.close();\n\t\t\tout.close();\n\t\t} catch (Throwable e) {\n\t\t\te.printStackTrace();\n\t\t\texit(1);\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["greedy", "dp"], "code_uid": "4f7a462ed823e0f68028fe391c7d92b1", "src_uid": "92bcbac3f167a44c235e99afc4de20d2", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\nimport java.math.BigInteger;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskE1 solver = new TaskE1();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskE1 {\n static final int DENOM = 100;\n static final long MODULO = (long) 1e9 + 7;\n private static final long INVDENOM = BigInteger.valueOf(DENOM).modInverse(BigInteger.valueOf(MODULO)).longValue();\n int n;\n long[][] p;\n int[][] s;\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n n = in.nextInt();\n p = new long[n][n];\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < n; ++j) {\n p[i][j] = in.nextInt() * INVDENOM % MODULO;\n }\n }\n int[] match = new int[n];\n Arrays.fill(match, -1);\n s = new int[n][n];\n int[] stack = new int[n];\n int[] via = new int[n];\n int[] ptr = new int[n];\n long res = rec(match, stack, via, ptr, -1, 0);\n out.println(res);\n }\n\n private long rec(int[] match, int[] stack, int[] via, int[] ptr, int sp, int next) {\n for (int i = 0; i < sp; ++i)\n if (via[stack[i]] == -1) {\n throw new RuntimeException();\n }\n if (sp == 0) return 0;\n if (sp == -1) {\n if (next >= n) {\n return 1;\n }\n Arrays.fill(via, -1);\n Arrays.fill(ptr, 0);\n Arrays.fill(stack, -1);\n stack[0] = next;\n via[next] = -2;\n return rec(match, stack, via, ptr, 1, next);\n } else {\n int cur = stack[sp - 1];\n int dest = ptr[cur];\n if (dest < n && match[dest] < 0) {\n if (s[cur][dest] == 0) {\n s[cur][dest] = 1;\n long res = p[cur][dest] * rec(match, stack, via, ptr, sp, next);\n s[cur][dest] = 2;\n res += (1 - p[cur][dest]) * rec(match, stack, via, ptr, sp, next);\n res %= MODULO;\n if (res < 0) res += MODULO;\n s[cur][dest] = 0;\n return res;\n }\n if (s[cur][dest] == 1) {\n int[] nmatch = match.clone();\n int[] nstack = new int[n];\n int[] nvia = new int[n];\n int[] nptr = new int[n];\n for (int i = 1; i < sp; ++i) {\n nmatch[via[stack[i]]] = stack[i - 1];\n }\n nmatch[dest] = cur;\n return rec(nmatch, nstack, nvia, nptr, -1, next + 1);\n }\n }\n int ndest = dest - n;\n if (ndest >= 0 && ndest < n && match[ndest] >= 0 && via[match[ndest]] == -1) {\n if (s[cur][ndest] == 0) {\n s[cur][ndest] = 1;\n long res = p[cur][ndest] * rec(match, stack, via, ptr, sp, next);\n s[cur][ndest] = 2;\n res += (1 - p[cur][ndest]) * rec(match, stack, via, ptr, sp, next);\n res %= MODULO;\n if (res < 0) res += MODULO;\n s[cur][ndest] = 0;\n return res;\n }\n if (s[cur][ndest] == 1) {\n int md = match[ndest];\n via[md] = ndest;\n stack[sp] = md;\n long res = rec(match, stack, via, ptr, sp + 1, next);\n stack[sp] = -1;\n via[md] = -1;\n return res;\n }\n }\n if (dest >= 2 * n) {\n long res = rec(match, stack, via, ptr, sp - 1, next);\n stack[sp - 1] = cur;\n return res;\n } else {\n ptr[cur] = dest + 1;\n long res = rec(match, stack, via, ptr, sp, next);\n ptr[cur] = dest;\n return res;\n }\n }\n }\n\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["brute force", "probabilities"], "code_uid": "157d943fffdf4ff400dbbf80ae90c837", "src_uid": "906d4e49566e63fddaf8eac7384c6284", "difficulty": 3100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package round588;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class E1 {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tint Q;\n\t\n\tvoid solve()\n\t{\n\t\tint n = ni();\n\t\tint[][] ps = new int[n][];\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tps[i] = na(n);\n\t\t}\n\t\t\n\t\tif(n % 2 == 1){\n\t\t\tn++;\n\t\t\tint[][] nps = new int[n][n];\n\t\t\tnps[n-1][n-1] = 100;\n\t\t\tfor(int i = 0;i < n-1;i++){\n\t\t\t\tfor(int j = 0;j < n-1;j++){\n\t\t\t\t\tnps[i][j] = ps[i][j];\n\t\t\t\t}\n\t\t\t}\n\t\t\tps = nps;\n\t\t}\n\t\t\n\t\tif(n == 6)Q = 20;\n\t\tif(n == 4)Q = 6;\n\t\tif(n == 2)Q = 2;\n\t\t\n\t\tlong ih = invl(100, mod);\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tfor(int j = 0;j < n;j++){\n\t\t\t\tps[i][j] = (int)(ps[i][j] * ih % mod);\n\t\t\t}\n\t\t}\n\t\t\n\t\tint h = n/2;\n\t\tlong[] l = go(Arrays.copyOfRange(ps, 0, h));\n\t\tlong[] r = go(Arrays.copyOfRange(ps, h, n));\n\t\tlong[] nl = new long[l.length];\n\t\tfor(int i = 0;i < l.length;i++){\n\t\t\tint ii = i;\n\t\t\tfor(int j = 0, k = Q-1;j < k;j++,k--){\n\t\t\t\tif((i>>>j&1) != (i>>>k&1)){\n\t\t\t\t\tii ^= 1<<j|1<<k;\n\t\t\t\t}\n\t\t\t}\n\t\t\tnl[ii] = l[i];\n\t\t}\n\t\tl = nl;\n\t\t\n\t\tlong[] zl = zetaTransform(l);\n\t\tlong[] zr = zetaTransform(r);\n\t\tfor(int i = 0;i < zl.length;i++){\n\t\t\tzl[i] = zl[i] * zr[i] % mod;\n\t\t}\n\t\tlong[] me = inverseZetaTransform(zl);\n\t\tlong ans = 0;\n\t\tfor(int i = 1;i < me.length;i++){\n\t\t\tans += me[i];\n\t\t}\n\t\tout.println(ans%mod);\n\t}\n\t\n\tpublic static long invl(long a, long mod) {\n\t\tlong b = mod;\n\t\tlong p = 1, q = 0;\n\t\twhile (b > 0) {\n\t\t\tlong c = a / b;\n\t\t\tlong d;\n\t\t\td = a;\n\t\t\ta = b;\n\t\t\tb = d % b;\n\t\t\td = p;\n\t\t\tp = q;\n\t\t\tq = d - c * q;\n\t\t}\n\t\treturn p < 0 ? p + mod : p;\n\t}\n\n\t\n\tpublic long[] zetaTransform(long[] f)\n\t{\n\t\tint H = Integer.numberOfTrailingZeros(f.length);\n\t\tfor(int i = 0;i < H;i++){\n\t\t\tfor(int j = 0;j < 1<<H;j++){\n\t\t\t\tif(j<<~i>=0){\n\t\t\t\t\tf[j] += f[j|1<<i];\n\t\t\t\t\tif(f[j] >= mod)f[j] -= mod;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn f;\n\t}\n\t\n\tpublic long[] inverseZetaTransform(long[] f)\n\t{\n\t\tint H = Integer.numberOfTrailingZeros(f.length);\n\t\tfor(int i = 0;i < H;i++){\n\t\t\tfor(int j = 0;j < 1<<H;j++){\n\t\t\t\tif(j<<~i>=0){\n\t\t\t\t\tf[j] -= f[j|1<<i];\n\t\t\t\t\tif(f[j] < 0)f[j] += mod;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn f;\n\t}\n\n\t\n\tint mod = 1000000007;\n\t\n\tlong[] go(int[][] ps)\n\t{\n\t\tint h = ps.length;\n\t\tint n = ps[0].length;\n\t\tlong[] l = new long[1<<Q];\n\t\tfor(int i = 0;i < 1<<h*n;i++){\n\t\t\tlong P = 1;\n\t\t\tfor(int j = 0;j < h;j++){\n\t\t\t\tfor(int k = 0;k < n;k++){\n\t\t\t\t\tif(i<<~(j*n+k)<0){\n\t\t\t\t\t\tP = P * ps[j][k] % mod;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tP = P * (mod+1-ps[j][k]) % mod;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tint ptn = 0;\n\t\t\tint p = 0;\n\t\t\tfor(int j = 0;j < 1<<n;j++){\n\t\t\t\tif(Integer.bitCount(j) == h){\n\t\t\t\t\tint[] ds = toArray(j);\n\t\t\t\t\tint[] ord = ds;\n\t\t\t\t\tinner:\n\t\t\t\t\tdo{\n\t\t\t\t\t\tfor(int k = 0;k < h;k++){\n\t\t\t\t\t\t\tif(i<<~(k*n+ds[k])>=0)continue inner;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tptn |= 1<<p;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}while(nextPermutation(ord));\n\t\t\t\t\tp++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tl[ptn] += P;\n\t\t\tif(l[ptn] >= mod)l[ptn] -= mod;\n\t\t}\n\t\treturn l;\n\t}\n\t\n\tpublic static int[] toArray(long x)\n\t{\n\t\tint[] ret = new int[5];\n\t\tint p = 0;\n\t\tfor(;x != 0;x &= x-1){\n\t\t\tret[p++] = Long.numberOfTrailingZeros(x);\n\t\t}\n\t\treturn Arrays.copyOf(ret, p);\n\t}\n\t\n\tpublic static boolean nextPermutation(int[] a) {\n\t\tint n = a.length;\n\t\tint i;\n\t\tfor (i = n - 2; i >= 0 && a[i] >= a[i + 1]; i--)\n\t\t\t;\n\t\tif (i == -1)\n\t\t\treturn false;\n\t\tint j;\n\t\tfor (j = i + 1; j < n && a[i] < a[j]; j++)\n\t\t\t;\n\t\tint d = a[i];\n\t\ta[i] = a[j - 1];\n\t\ta[j - 1] = d;\n\t\tfor (int p = i + 1, q = n - 1; p < q; p++, q--) {\n\t\t\td = a[p];\n\t\t\ta[p] = a[q];\n\t\t\ta[q] = d;\n\t\t}\n\t\treturn true;\n\t}\n\n\t\n\tvoid run() throws Exception\n\t{\n//\t\tint n = 6, m = 99999;\n//\t\tRandom gen = new Random();\n//\t\tStringBuilder sb = new StringBuilder();\n//\t\tsb.append(n + \" \");\n//\t\tfor (int i = 0; i < n*n; i++) {\n//\t\t\tsb.append(i + \" \");\n//\t\t}\n//\t\tINPUT = sb.toString();\n\n\t\t\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new E1().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["brute force", "probabilities"], "code_uid": "0aae610e16950c47bd3d928ad3500bde", "src_uid": "906d4e49566e63fddaf8eac7384c6284", "difficulty": 3100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author step_by_step\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC {\n public String get(long x) {\n String res = \"\";\n while (x >= 9) {\n res += '9';\n x -= 9;\n }\n if (x > 0)\n res += (char) ('0' + x);\n return res;\n }\n\n int get_length(long x) {\n if (x == 0)\n return 1;\n int cnt = 0;\n while (x > 0) {\n cnt++;\n x /= 10;\n }\n return cnt;\n }\n\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n long a = in.nextLong();\n if (a < 45) {\n for (int i = 0; i < a; i++)\n out.print(1);\n out.print(' ');\n for (int i = 0; i < a; i++)\n out.print(1);\n out.println();\n return;\n }\n long len = 0;\n for (long x = 1; x <= 16; x++) {\n long cnt = x * 45;\n for (int i = 0; i < x - 1; i++)\n cnt *= 10;\n if (cnt <= a)\n len = x;\n }\n long sum = len * 45, cnt = 10;\n for (int i = 0; i < len - 1; i++) {\n sum *= 10;\n cnt *= 10;\n }\n a -= sum;\n long l = 0, r = cnt - 1;\n l += a % cnt;\n r += a % cnt;\n String add = get(a / cnt);\n if (a / cnt == 0 && l == 0)\n l++;\n out.print(add);\n if (a / cnt != 0)\n for (int i = 0; i < get_length(r) - get_length(l); i++)\n out.print(0);\n out.print(l + \" \");\n out.print(add);\n out.println(r);\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void print(Object... objects) {\n for (int i = 0; i < objects.length; i++) {\n if (i != 0) {\n writer.print(' ');\n }\n writer.print(objects[i]);\n }\n }\n\n public void println() {\n writer.println();\n }\n\n public void print(char i) {\n writer.print(i);\n }\n\n public void close() {\n writer.close();\n }\n\n public void println(long i) {\n writer.println(i);\n }\n\n public void print(int i) {\n writer.print(i);\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public long nextLong() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["constructive algorithms"], "code_uid": "33eb31eacecb731bb0366fd080c1840d", "src_uid": "52b8d97f216ea22693bc16fadcd46dae", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.math.*;\nimport java.util.*;\n \npublic class C_hackIt {\n public static void main(String[] args) throws IOException {\n Scanner sc = new Scanner(System.in);\n PrintWriter pw = new PrintWriter(System.out);\n \n BigInteger mod = sc.nextBigInteger();\n BigInteger l = new BigInteger(\"1\");\n BigInteger r = new BigInteger(\"45\");\n BigInteger ten = new BigInteger(\"10\");\n for (int i = 0; i < 20; i++) {\n \tr = r.multiply(new BigInteger(\"10\")).add(ten.multiply(new BigInteger(\"45\")));\n \tten = ten.multiply(new BigInteger(\"10\"));\n }\n r = r.add(l);\n BigInteger rem = mod.subtract(r.mod(mod));\n BigInteger end = new BigInteger(\"1000000000000000000000\");\n l = l.add(rem);\n end = end.add(rem);\n pw.println(l + \" \" + end);\n \n pw.close();\n }\n static class FastScanner {\n \tprivate boolean finished = false;\n \n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private SpaceCharFilter filter;\n \n public FastScanner(InputStream stream) {\n this.stream = stream;\n }\n \n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n public int peek() {\n if (numChars == -1) {\n return -1;\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n return -1;\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar];\n }\n \n public int nextInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n public long nextLong() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n \n public String nextString() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n StringBuilder res = new StringBuilder();\n do {\n if (Character.isValidCodePoint(c)) {\n res.appendCodePoint(c);\n }\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n \n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n \n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n \n private String readLine0() {\n StringBuilder buf = new StringBuilder();\n int c = read();\n while (c != '\\n' && c != -1) {\n if (c != '\\r') {\n buf.appendCodePoint(c);\n }\n c = read();\n }\n return buf.toString();\n }\n public String readLine() {\n String s = readLine0();\n while (s.trim().length() == 0) {\n s = readLine0();\n }\n return s;\n }\n public String readLine(boolean ignoreEmptyLines) {\n if (ignoreEmptyLines) {\n return readLine();\n } else {\n return readLine0();\n }\n }\n \n public BigInteger readBigInteger() {\n try {\n return new BigInteger(nextString());\n } catch (NumberFormatException e) {\n throw new InputMismatchException();\n }\n }\n \n public char nextCharacter() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n return (char) c;\n }\n \n public double nextDouble() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E') {\n return res * Math.pow(10, nextInt());\n }\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E') {\n return res * Math.pow(10, nextInt());\n }\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n \n public boolean isExhausted() {\n int value;\n while (isSpaceChar(value = peek()) && value != -1) {\n read();\n }\n return value == -1;\n }\n public String next() {\n return nextString();\n }\n \n public SpaceCharFilter getFilter() {\n return filter;\n }\n \n public void setFilter(SpaceCharFilter filter) {\n this.filter = filter;\n }\n \n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n public int[] nextIntArray(int n){\n int[] array=new int[n];\n for(int i=0;i<n;++i)array[i]=nextInt();\n return array;\n }\n public int[] nextSortedIntArray(int n){\n int array[]=nextIntArray(n);\n PriorityQueue<Integer> pq = new PriorityQueue<Integer>();\n for(int i = 0; i < n; i++){\n pq.add(array[i]);\n }\n int[] out = new int[n];\n for(int i = 0; i < n; i++){\n out[i] = pq.poll();\n }\n return out;\n }\n public int[] nextSumIntArray(int n){\n int[] array=new int[n];\n array[0]=nextInt();\n for(int i=1;i<n;++i)array[i]=array[i-1]+nextInt();\n return array;\n }\n public ArrayList<Integer>[] nextGraph(int n, int m){\n ArrayList<Integer>[] adj = new ArrayList[n];\n for(int i = 0; i < n; i++){\n adj[i] = new ArrayList<Integer>();\n }\n for(int i = 0; i < m; i++){\n int u = nextInt(); int v = nextInt();\n u--; v--;\n adj[u].add(v); adj[v].add(u);\n }\n return adj;\n }\n public ArrayList<Integer>[] nextTree(int n){\n return nextGraph(n, n-1);\n }\n \n public long[] nextLongArray(int n){\n long[] array=new long[n];\n for(int i=0;i<n;++i)array[i]=nextLong();\n return array;\n }\n public long[] nextSumLongArray(int n){\n long[] array=new long[n];\n array[0]=nextInt();\n for(int i=1;i<n;++i)array[i]=array[i-1]+nextInt();\n return array;\n }\n public long[] nextSortedLongArray(int n){\n long array[]=nextLongArray(n);\n Arrays.sort(array);\n return array;\n }\n }\n\tstatic void shuffle(int[] a) {\n\t\tRandom get = new Random();\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\tint r = get.nextInt(a.length);\n\t\t\tint temp = a[i];\n\t\t\ta[i] = a[r];\n\t\t\ta[r] = temp;\n\t\t}\n\t}\n\tstatic void shuffle(long[] a) {\n\t\tRandom get = new Random();\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\tint r = get.nextInt(a.length);\n\t\t\tlong temp = a[i];\n\t\t\ta[i] = a[r];\n\t\t\ta[r] = temp;\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["constructive algorithms"], "code_uid": "2903e736ba16a5137bfa561af406b4e9", "src_uid": "52b8d97f216ea22693bc16fadcd46dae", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.math.BigInteger;\nimport java.io.BufferedWriter;\nimport java.io.File;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\n\npublic class Main {\n\n // 1 - 9 -> 45\n // 10 - 99 -> pre + pre * 9 + pre * 10 = 900\n // 100 - 1000 -> 900 + (900 * 9) + (45 * 100) -> pre * 10 + 45 * 100\n \n private static BigInteger TEN = BigInteger.valueOf(10);\n private static BigInteger HUNDRED = BigInteger.valueOf(100);\n private static BigInteger FORTYFIVE = BigInteger.valueOf(45);\n \n // ZhouYuChen's idea\n private void solve() throws Exception {\n Scanner scanner = new Scanner(System.in);\n BigInteger k = scanner.nextBigInteger();\n \n BigInteger x = TEN.pow(100).subtract(BigInteger.ONE);\n BigInteger t = k.subtract(TEN.pow(99).multiply(FORTYFIVE.multiply(HUNDRED)).mod(k));\n System.out.println(t.toString() + \" \" + t.add(x).toString());\n }\n \n public static void main(String... args) {\n \n try {\n new Main().solve();\n } catch (Exception e) {\n e.printStackTrace();\n }\n \n }\n}\n", "lang_cluster": "Java", "tags": ["constructive algorithms"], "code_uid": "7a68bd54009607aa8029fb0f819258e7", "src_uid": "52b8d97f216ea22693bc16fadcd46dae", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.math.BigInteger;\nimport java.io.BufferedWriter;\nimport java.io.File;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\n\npublic class Main {\n\n // 1 - 9 -> 45\n // 10 - 99 -> pre + pre * 9 + pre * 10 = 900\n // 100 - 1000 -> 900 + (900 * 9) + (45 * 100) -> pre * 10 + 45 * 100\n \n private static BigInteger TEN = BigInteger.valueOf(10);\n private static BigInteger HUNDRED = BigInteger.valueOf(100);\n private static BigInteger FORTYFIVE = BigInteger.valueOf(45);\n \n private void solve() throws Exception {\n Scanner scanner = new Scanner(System.in);\n BigInteger k = scanner.nextBigInteger();\n \n BigInteger x = TEN.pow(100).subtract(BigInteger.ONE);\n BigInteger t = k.subtract(TEN.pow(99).multiply(FORTYFIVE.multiply(HUNDRED)).mod(k));\n System.out.println(t.toString() + \" \" + t.add(x).toString());\n }\n \n public static void main(String... args) {\n \n try {\n new Main().solve();\n } catch (Exception e) {\n e.printStackTrace();\n }\n \n }\n}\n", "lang_cluster": "Java", "tags": ["constructive algorithms"], "code_uid": "b76baad5a6383261328ef77f1096a8ee", "src_uid": "52b8d97f216ea22693bc16fadcd46dae", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "//package round116;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\n\npublic class B {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\tint[] primes = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97};\n\t\n\tvoid solve()\n\t{\n\t\tint b = ni(), d = ni();\n\t\t\n\t\tint v;\n\t\tif((v = isType2(b, d)) > 0){\n\t\t\tout.println(\"2-type\");\n\t\t\tout.println(v);\n\t\t}else if(isType3(b, d)){\n\t\t\tout.println(\"3-type\");\n\t\t}else if(isType11(b, d)){\n\t\t\tout.println(\"11-type\");\n\t\t}else if(isType6(b, d)){\n\t\t\tout.println(\"6-type\");\n\t\t}else{\n\t\t\tout.println(\"7-type\");\n\t\t}\n\t}\n\t\n\tint isType2(int b, int d)\n\t{\n\t\tint[][] fb = factor(b, primes);\n\t\tint emax = 0;\n\t\tfor(int[] f : fb){\n\t\t\tint e = 0;\n\t\t\twhile(d % f[0] == 0){\n\t\t\t\td /= f[0];\n\t\t\t\te++;\n\t\t\t}\n\t\t\temax = Math.max(emax, (e+f[1]-1)/f[1]);\n\t\t}\n\t\treturn d != 1 ? 0 : emax;\n\t}\n\t\n\tboolean isType3(int b, int d)\n\t{\n\t\tif(b == 2)return false;\n\t\treturn (b-1) % d == 0;\n\t}\n\t\n\tboolean isType11(int b, int d)\n\t{\n\t\treturn (b+1) % d == 0;\n\t}\n\t\n\tboolean isType6(int b, int d)\n\t{\n\t\tint[][] fd = factor(d, primes);\n\t\tfor(int[] f : fd){\n\t\t\tint mul = 1;\n\t\t\tfor(int i = 0;i < f[1];i++){\n\t\t\t\tmul *= f[0];\n\t\t\t}\n\t\t\tif(isType2(b, mul) > 0 || isType3(b, mul) || isType11(b, mul)){\n\t\t\t}else{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tpublic static int[][] factor(int n, int[] primes)\n\t{\n\t\tint[][] ret = new int[9][2];\n\t\tint rp = 0;\n\t\tfor(int p : primes){\n\t\t\tif(p * p > n)break;\n\t\t\tint i;\n\t\t\tfor(i = 0;n % p == 0;n /= p, i++);\n\t\t\tif(i > 0){\n\t\t\t\tret[rp][0] = p;\n\t\t\t\tret[rp][1] = i;\n\t\t\t\trp++;\n\t\t\t}\n\t\t}\n\t\tif(n != 1){\n\t\t\tret[rp][0] = n;\n\t\t\tret[rp][1] = 1;\n\t\t\trp++;\n\t\t}\n\t\treturn Arrays.copyOf(ret, rp);\n\t}\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception\n\t{\n\t\tnew B().run();\n\t}\n\t\n\tpublic int ni()\n\t{\n\t\ttry {\n\t\t\tint num = 0;\n\t\t\tboolean minus = false;\n\t\t\twhile((num = is.read()) != -1 && !((num >= '0' && num <= '9') || num == '-'));\n\t\t\tif(num == '-'){\n\t\t\t\tnum = 0;\n\t\t\t\tminus = true;\n\t\t\t}else{\n\t\t\t\tnum -= '0';\n\t\t\t}\n\t\t\t\n\t\t\twhile(true){\n\t\t\t\tint b = is.read();\n\t\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t\t}else{\n\t\t\t\t\treturn minus ? -num : num;\n\t\t\t\t}\n\t\t\t}\n\t\t} catch (IOException e) {\n\t\t}\n\t\treturn -1;\n\t}\n\t\n\tpublic long nl()\n\t{\n\t\ttry {\n\t\t\tlong num = 0;\n\t\t\tboolean minus = false;\n\t\t\twhile((num = is.read()) != -1 && !((num >= '0' && num <= '9') || num == '-'));\n\t\t\tif(num == '-'){\n\t\t\t\tnum = 0;\n\t\t\t\tminus = true;\n\t\t\t}else{\n\t\t\t\tnum -= '0';\n\t\t\t}\n\t\t\t\n\t\t\twhile(true){\n\t\t\t\tint b = is.read();\n\t\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t\t}else{\n\t\t\t\t\treturn minus ? -num : num;\n\t\t\t\t}\n\t\t\t}\n\t\t} catch (IOException e) {\n\t\t}\n\t\treturn -1;\n\t}\n\t\n\tpublic String ns()\n\t{\n\t\ttry{\n\t\t\tint b = 0;\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\twhile((b = is.read()) != -1 && (b == '\\r' || b == '\\n' || b == ' '));\n\t\t\tif(b == -1)return \"\";\n\t\t\tsb.append((char)b);\n\t\t\twhile(true){\n\t\t\t\tb = is.read();\n\t\t\t\tif(b == -1)return sb.toString();\n\t\t\t\tif(b == '\\r' || b == '\\n' || b == ' ')return sb.toString();\n\t\t\t\tsb.append((char)b);\n\t\t\t}\n\t\t} catch (IOException e) {\n\t\t}\n\t\treturn \"\";\n\t}\n\t\n\tpublic char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\ttry{\n\t\t\tint b = 0, p = 0;\n\t\t\twhile((b = is.read()) != -1 && (b == ' ' || b == '\\r' || b == '\\n'));\n\t\t\tif(b == -1)return null;\n\t\t\tbuf[p++] = (char)b;\n\t\t\twhile(p < n){\n\t\t\t\tb = is.read();\n\t\t\t\tif(b == -1 || b == ' ' || b == '\\r' || b == '\\n')break;\n\t\t\t\tbuf[p++] = (char)b;\n\t\t\t}\n\t\t\treturn Arrays.copyOf(buf, p);\n\t\t} catch (IOException e) {\n\t\t}\n\t\treturn null;\n\t}\n\t\n\t\n\tdouble nd() { return Double.parseDouble(ns()); }\n\tboolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tvoid tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "d6266b0a7e5ddafee2aecb51681e5dc9", "src_uid": "809e1c78b0a5a16f7f2115b046a20bde", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.math.*;\nimport java.util.*;\nimport java.util.stream.*;\n\npublic class D {\n\n\tlong myDiv(long a, long b) {\n\t\treturn Math.floorDiv(a + b - 1, b);\n\t}\n\n\tlong go2(long n, long s, long k) {\n\t\tlong ans1 = -1;\n\t\tfor (long c2 = n; c2 >= 0; c2--) {\n\t\t\tlong full = n + c2;\n\n\t\t\tlong x = (k - 1) / full;\n\n\t\t\tlong high = c2;\n\t\t\tlong low = -1;\n\t\t\twhile (high - low > 1) {\n\t\t\t\tlong mid = (low + high) >> 1;\n\t\t\t\tif ((k - 1) / (n + mid) == x) {\n\t\t\t\t\thigh = mid;\n\t\t\t\t} else {\n\t\t\t\t\tlow = mid;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tlong cLow = high;\n\t\t\tlong cHigh = c2;\n\n\t\t\t// c = c2, c2 - 1, ..., c3\n\n\t\t\t// last = k - x * (n + c)\n\t\t\t// last2 = k - x * (n + c) - s\n\t\t\t// rest2 = c - k + x * (n + c) + s\n\n\t\t\t// 0 <= k - x * (n + c) - s <= s\n\t\t\t// 0 <= c - k + x * (n + c) + s <= n - s\n\n\t\t\tif (x == 0) {\n\t\t\t\tif (!(0 <= k - s && k - s <= s)) {\n\t\t\t\t\tcLow = Long.MAX_VALUE;\n\t\t\t\t}\n\t\t\t\tcLow = Math.max(cLow, k - s);\n\t\t\t\tcHigh = Math.min(cHigh, n + k - s - s);\n\t\t\t} else {\n\n\t\t\t\t// c2 <= c <= c3\n\t\t\t\t// (k - nx - 2s) / x <= c <= (k - nx - s) / x\n\t\t\t\t// (k - nx - s) / (x + 1) <= c <= (k - nx + n - 2s) / (x + 1)\n\n\t\t\t\tcLow = Math.max(cLow, myDiv(k - n * x - 2 * s, x));\n\t\t\t\tcLow = Math.max(cLow, myDiv(k - n * x - s, x + 1));\n\n\t\t\t\tcHigh = Math.min(cHigh, Math.floorDiv(k - n * x - s, x));\n\t\t\t\tcHigh = Math.min(cHigh,\n\t\t\t\t\t\tMath.floorDiv(k - n * x + n - 2 * s, x + 1));\n\t\t\t}\n\t\t\tif (cLow <= cHigh) {\n\t\t\t\tans1 = cHigh;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tc2 = high;\n\t\t}\n\n\t\tk++;\n\t\tlong ans2 = -1;\n\n\t\tfor (long c2 = n; c2 >= 0; c2--) {\n\t\t\tlong full = n + c2;\n\n\t\t\tlong x = (k - 1) / full;\n\n\t\t\tlong high = c2;\n\t\t\tlong low = -1;\n\t\t\twhile (high - low > 1) {\n\t\t\t\tlong mid = (low + high) >> 1;\n\t\t\t\tif ((k - 1) / (n + mid) == x) {\n\t\t\t\t\thigh = mid;\n\t\t\t\t} else {\n\t\t\t\t\tlow = mid;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tlong cLow = high;\n\t\t\tlong cHigh = c2;\n\n\t\t\t// c = c2, c2 - 1, ..., c3\n\n\t\t\t// last = k - x * (n + c)\n\t\t\t// last2 = k - x * (n + c) - s\n\t\t\t// rest2 = c - k + x * (n + c) + s\n\n\t\t\t// 1 <= k - x * (n + c) - s <= s\n\t\t\t// 0 <= c - k + x * (n + c) + s <= n - s\n\n\t\t\tif (x == 0) {\n\t\t\t\tif (!(1 <= k - s && k - s <= s)) {\n\t\t\t\t\tcLow = Long.MAX_VALUE;\n\t\t\t\t}\n\t\t\t\tcLow = Math.max(cLow, k - s);\n\t\t\t\tcHigh = Math.min(cHigh, n + k - s - s);\n\t\t\t} else {\n\t\t\t\t// c2 <= c <= c3\n\t\t\t\t// (k - nx - 2s) / x <= c <= (k - nx - s - 1) / x\n\t\t\t\t// (k - nx - s) / (x + 1) <= c <= (k - nx + n - 2s) / (x + 1)\n\n\t\t\t\tcLow = Math.max(cLow, myDiv(k - n * x - 2 * s, x));\n\t\t\t\tcLow = Math.max(cLow, myDiv(k - n * x - s, x + 1));\n\n\t\t\t\tcHigh = Math.min(cHigh, Math.floorDiv(k - n * x - s - 1, x));\n\t\t\t\tcHigh = Math.min(cHigh,\n\t\t\t\t\t\tMath.floorDiv(k - n * x + n - 2 * s, x + 1));\n\t\t\t}\n\t\t\tif (cLow <= cHigh) {\n\t\t\t\tans2 = cHigh;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tc2 = high;\n\t\t}\n\n\t\treturn Math.max(ans1, ans2);\n\t}\n\n\tlong go1(long n, long s, long k) {\n\n\t\t// no overeating\n\t\tlong ans1 = -1;\n\t\tfor (long c2 = n; c2 >= 0; c2--) {\n\t\t\tlong full = n + c2;\n\n\t\t\tlong last = k % full;\n\t\t\tif (last == 0) {\n\t\t\t\tlast = full;\n\t\t\t}\n\n\t\t\tlong last2 = last - s;\n\t\t\tlong rest2 = c2 - last2;\n\n\t\t\tif (!(0 <= last2 && last2 <= s && 0 <= rest2 && rest2 <= n - s)) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tans1 = c2;\n\t\t\tbreak;\n\t\t}\n\n\t\tlong ans2 = -1;\n\t\t// overeating!\n\t\tfor (long c2 = n; c2 > 0; c2--) {\n\t\t\tlong full = n + c2;\n\n\t\t\tlong last = (k + 1) % full;\n\t\t\tif (last == 0) {\n\t\t\t\tlast = full;\n\t\t\t}\n\n\t\t\tlong last2 = last - s;\n\t\t\tlong rest2 = c2 - last2;\n\n\t\t\tif (!(1 <= last2 && last2 <= s && 0 <= rest2 && rest2 <= n - s)) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tans2 = c2;\n\t\t\tbreak;\n\t\t}\n\n\t\treturn Math.max(ans1, ans2);\n\t}\n\n\tvoid submit() {\n\t\tlong n = nextLong();\n\t\tlong l = nextLong();\n\t\tlong r = nextLong();\n\t\tlong k = nextLong();\n\n\t\tlong s;\n\t\tif (l <= r) {\n\t\t\ts = r - l + 1;\n\t\t} else {\n\t\t\ts = r - l + 1 + n;\n\t\t}\n\n\t\t// out.println(go2(n, s, k));\n\n\t\tif (n <= C) {\n\t\t\tout.println(go1(n, s, k));\n\t\t} else {\n\t\t\tout.println(go2(n, s, k));\n\t\t}\n\t}\n\n\tvoid test() {\n\t\tlong big = BigInteger.TEN.pow(11).longValue();\n\t\tgo2(big / 134, big / 2, big / 23);\n\t}\n\n\tvoid stress() {\n\t\tfor (int tst = 0;; tst++) {\n\t\t\tif (false) {\n\t\t\t\tthrow new AssertionError();\n\t\t\t}\n\t\t\tSystem.err.println(tst);\n\t\t}\n\t}\n\n\tD() throws IOException {\n\t\tis = System.in;\n\t\tout = new PrintWriter(System.out);\n\t\tsubmit();\n\t\t// stress();\n\t\t// test();\n\t\tout.close();\n\t}\n\n\tstatic final Random rng = new Random();\n\tstatic final int C = 10_000_000;\n\n\tstatic int rand(int l, int r) {\n\t\treturn l + rng.nextInt(r - l + 1);\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew D();\n\t}\n\n\tprivate InputStream is;\n\tPrintWriter out;\n\n\tprivate byte[] buf = new byte[1 << 14];\n\tprivate int bufSz = 0, bufPtr = 0;\n\n\tprivate int readByte() {\n\t\tif (bufSz == -1)\n\t\t\tthrow new RuntimeException(\"Reading past EOF\");\n\t\tif (bufPtr >= bufSz) {\n\t\t\tbufPtr = 0;\n\t\t\ttry {\n\t\t\t\tbufSz = is.read(buf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\t\tif (bufSz <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buf[bufPtr++];\n\t}\n\n\tprivate boolean isTrash(int c) {\n\t\treturn c < 33 || c > 126;\n\t}\n\n\tprivate int skip() {\n\t\tint b;\n\t\twhile ((b = readByte()) != -1 && isTrash(b))\n\t\t\t;\n\t\treturn b;\n\t}\n\n\tString nextToken() {\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile (!isTrash(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tString nextString() {\n\t\tint b = readByte();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile (!isTrash(b) || b == ' ') {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tdouble nextDouble() {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n\n\tchar nextChar() {\n\t\treturn (char) skip();\n\t}\n\n\tint nextInt() {\n\t\tint ret = 0;\n\t\tint b = skip();\n\t\tif (b != '-' && (b < '0' || b > '9')) {\n\t\t\tthrow new InputMismatchException();\n\t\t}\n\t\tboolean neg = false;\n\t\tif (b == '-') {\n\t\t\tneg = true;\n\t\t\tb = readByte();\n\t\t}\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tret = ret * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\tif (b != -1 && !isTrash(b)) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\treturn neg ? -ret : ret;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tlong nextLong() {\n\t\tlong ret = 0;\n\t\tint b = skip();\n\t\tif (b != '-' && (b < '0' || b > '9')) {\n\t\t\tthrow new InputMismatchException();\n\t\t}\n\t\tboolean neg = false;\n\t\tif (b == '-') {\n\t\t\tneg = true;\n\t\t\tb = readByte();\n\t\t}\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tret = ret * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\tif (b != -1 && !isTrash(b)) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\treturn neg ? -ret : ret;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "math"], "code_uid": "421bef99e145c88ccdc0771f98f1ba4b", "src_uid": "f54cc281033591315b037a400044f1cb", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintStream;\nimport java.util.Arrays;\nimport java.io.IOException;\nimport java.io.UncheckedIOException;\nimport java.io.Closeable;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.math.BigInteger;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) throws Exception {\n Thread thread = new Thread(null, new TaskAdapter(), \"\", 1 << 29);\n thread.start();\n thread.join();\n }\n\n static class TaskAdapter implements Runnable {\n @Override\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastInput in = new FastInput(inputStream);\n FastOutput out = new FastOutput(outputStream);\n DINOIFinalContests solver = new DINOIFinalContests();\n solver.solve(1, in, out);\n out.close();\n }\n }\n\n static class DINOIFinalContests {\n int mod;\n Factorial fact;\n Combination comb;\n long[] f;\n long[] g;\n Debug debug = new Debug(true);\n\n public long g(int n) {\n if (n == 0) {\n return 0;\n }\n if (g[n] == -1) {\n long sum = 0;\n for (int i = 0; i < n; i++) {\n int left = i;\n int right = n - 1 - i;\n //0.. left\n //0.. right\n long contrib = (g(left) * f(right) + g(right) * f(left)) % mod * (n - 1 + 2) % mod + f(left) * f(right) % mod * ((IntMath.sumOfInterval(0, left) +\n IntMath.sumOfInterval(0, right)) % mod) % mod;\n contrib = contrib % mod * comb.combination(n - 1, left) % mod;\n sum += contrib;\n }\n g[n] = sum % mod;\n }\n return g[n];\n }\n\n public long f(int n) {\n if (n == 0) {\n return 1;\n }\n if (f[n] == -1) {\n long sum = 0;\n for (int i = 0; i < n; i++) {\n int left = i;\n int right = n - 1 - i;\n sum += f(left) * comb.combination(n - 1, left) % mod * f(right) % mod * (n - 1 + 2) % mod;\n }\n f[n] = sum % mod;\n }\n return f[n];\n }\n\n public void solve(int testNumber, FastInput in, FastOutput out) {\n int n = in.readInt();\n int m = in.readInt();\n int p = in.readInt();\n mod = p;\n fact = new Factorial((int) 1e4, p);\n comb = new Combination(fact);\n\n f = new long[m + 1];\n g = new long[m + 1];\n Arrays.fill(f, -1L);\n Arrays.fill(g, -1L);\n\n long[][] dpWay = new long[n + 1][m + 1];\n long[][] dpSum = new long[n + 1][m + 1];\n dpWay[0][0] = 1;\n for (int i = 1; i <= n; i++) {\n for (int j = 0; j <= m && j <= i; j++) {\n dpWay[i][j] = dpWay[i - 1][j];\n dpSum[i][j] = dpSum[i - 1][j];\n for (int k = 1; k <= j; k++) {\n int prev = Math.max(i - k - 1, 0);\n dpWay[i][j] += dpWay[prev][j - k] * comb.combination(j, k) % mod * f(k) % mod;\n long local = dpSum[prev][j - k] * f(k) +\n dpWay[prev][j - k] * g(k);\n local = local % mod * comb.combination(j, k) % mod;\n dpSum[i][j] += local;\n }\n dpWay[i][j] %= mod;\n dpSum[i][j] %= mod;\n }\n }\n\n long ans = dpSum[n][m];\n debug.debug(\"f\", f);\n debug.debug(\"g\", g);\n debug.debug(\"dpWay\", dpWay);\n debug.debug(\"dpSum\", dpSum);\n out.println(ans);\n }\n\n }\n\n static class Combination implements IntCombination {\n final Factorial factorial;\n int modVal;\n\n public Combination(Factorial factorial) {\n this.factorial = factorial;\n this.modVal = factorial.getMod();\n }\n\n public Combination(int limit, int mod) {\n this(new Factorial(limit, mod));\n }\n\n public int combination(int m, int n) {\n if (n > m || n < 0) {\n return 0;\n }\n return (int) ((long) factorial.fact(m) * factorial.invFact(n) % modVal * factorial.invFact(m - n) % modVal);\n }\n\n }\n\n static class FastOutput implements AutoCloseable, Closeable, Appendable {\n private static final int THRESHOLD = 1 << 13;\n private final Writer os;\n private StringBuilder cache = new StringBuilder(THRESHOLD * 2);\n\n public FastOutput append(CharSequence csq) {\n cache.append(csq);\n return this;\n }\n\n public FastOutput append(CharSequence csq, int start, int end) {\n cache.append(csq, start, end);\n return this;\n }\n\n private void afterWrite() {\n if (cache.length() < THRESHOLD) {\n return;\n }\n flush();\n }\n\n public FastOutput(Writer os) {\n this.os = os;\n }\n\n public FastOutput(OutputStream os) {\n this(new OutputStreamWriter(os));\n }\n\n public FastOutput append(char c) {\n cache.append(c);\n afterWrite();\n return this;\n }\n\n public FastOutput append(long c) {\n cache.append(c);\n afterWrite();\n return this;\n }\n\n public FastOutput append(String c) {\n cache.append(c);\n afterWrite();\n return this;\n }\n\n public FastOutput println(long c) {\n return append(c).println();\n }\n\n public FastOutput println() {\n return append(System.lineSeparator());\n }\n\n public FastOutput flush() {\n try {\n os.append(cache);\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n return this;\n }\n\n public void close() {\n flush();\n try {\n os.close();\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n\n public String toString() {\n return cache.toString();\n }\n\n }\n\n static interface IntCombination {\n }\n\n static class Factorial {\n int[] fact;\n int[] inv;\n int mod;\n\n public int getMod() {\n return mod;\n }\n\n public Factorial(int[] fact, int[] inv, int mod) {\n this.mod = mod;\n this.fact = fact;\n this.inv = inv;\n fact[0] = inv[0] = 1;\n int n = Math.min(fact.length, mod);\n for (int i = 1; i < n; i++) {\n fact[i] = i;\n fact[i] = (int) ((long) fact[i] * fact[i - 1] % mod);\n }\n inv[n - 1] = BigInteger.valueOf(fact[n - 1]).modInverse(BigInteger.valueOf(mod)).intValue();\n for (int i = n - 2; i >= 1; i--) {\n inv[i] = (int) ((long) inv[i + 1] * (i + 1) % mod);\n }\n }\n\n public Factorial(int limit, int mod) {\n this(new int[limit + 1], new int[limit + 1], mod);\n }\n\n public int fact(int n) {\n return fact[n];\n }\n\n public int invFact(int n) {\n return inv[n];\n }\n\n }\n\n static class Debug {\n private boolean offline;\n private PrintStream out = System.err;\n static int[] empty = new int[0];\n\n public Debug(boolean enable) {\n offline = enable && System.getSecurityManager() == null;\n }\n\n public Debug debug(String name, Object x) {\n return debug(name, x, empty);\n }\n\n public Debug debug(String name, Object x, int... indexes) {\n if (offline) {\n if (x == null || !x.getClass().isArray()) {\n out.append(name);\n for (int i : indexes) {\n out.printf(\"[%d]\", i);\n }\n out.append(\"=\").append(\"\" + x);\n out.println();\n } else {\n indexes = Arrays.copyOf(indexes, indexes.length + 1);\n if (x instanceof byte[]) {\n byte[] arr = (byte[]) x;\n for (int i = 0; i < arr.length; i++) {\n indexes[indexes.length - 1] = i;\n debug(name, arr[i], indexes);\n }\n } else if (x instanceof short[]) {\n short[] arr = (short[]) x;\n for (int i = 0; i < arr.length; i++) {\n indexes[indexes.length - 1] = i;\n debug(name, arr[i], indexes);\n }\n } else if (x instanceof boolean[]) {\n boolean[] arr = (boolean[]) x;\n for (int i = 0; i < arr.length; i++) {\n indexes[indexes.length - 1] = i;\n debug(name, arr[i], indexes);\n }\n } else if (x instanceof char[]) {\n char[] arr = (char[]) x;\n for (int i = 0; i < arr.length; i++) {\n indexes[indexes.length - 1] = i;\n debug(name, arr[i], indexes);\n }\n } else if (x instanceof int[]) {\n int[] arr = (int[]) x;\n for (int i = 0; i < arr.length; i++) {\n indexes[indexes.length - 1] = i;\n debug(name, arr[i], indexes);\n }\n } else if (x instanceof float[]) {\n float[] arr = (float[]) x;\n for (int i = 0; i < arr.length; i++) {\n indexes[indexes.length - 1] = i;\n debug(name, arr[i], indexes);\n }\n } else if (x instanceof double[]) {\n double[] arr = (double[]) x;\n for (int i = 0; i < arr.length; i++) {\n indexes[indexes.length - 1] = i;\n debug(name, arr[i], indexes);\n }\n } else if (x instanceof long[]) {\n long[] arr = (long[]) x;\n for (int i = 0; i < arr.length; i++) {\n indexes[indexes.length - 1] = i;\n debug(name, arr[i], indexes);\n }\n } else {\n Object[] arr = (Object[]) x;\n for (int i = 0; i < arr.length; i++) {\n indexes[indexes.length - 1] = i;\n debug(name, arr[i], indexes);\n }\n }\n }\n }\n return this;\n }\n\n }\n\n static class FastInput {\n private final InputStream is;\n private byte[] buf = new byte[1 << 13];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastInput(InputStream is) {\n this.is = is;\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n bufLen = -1;\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public int readInt() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n }\n\n static class IntMath {\n private IntMath() {\n }\n\n public static long sumOfInterval(long l, long r) {\n return (r + l) * (r - l + 1) / 2;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "fft"], "code_uid": "57ec2f27f51b47dde847687bad1d6339", "src_uid": "9812de5f2d272511a63ead8765b23190", "difficulty": 3100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class E {\n\tFastScanner in;\n\tPrintWriter out;\n\n\tint[] p;\n\tdouble[][] dpEqLess;\n\tdouble[][] dpEqLessMul;\n\tint maxK = 50;\n\t\n\tpublic void solve() throws IOException {\n\t\tint q = in.nextInt();\n\t\tdpEqLess = new double[maxK][q];\n\t\tfor (int i = 0; i < maxK; i++) {\n\t\t\tdpEqLess[i][0] = 1;\n\t\t}\n\t\tp = new int[q];\n\t\tp[0] = -1;\n\t\tint cntV = 0;\n\t\tfor (int i = 0; i < q; i++) {\n\t\t\tint type = in.nextInt();\n\t\t\tint v = in.nextInt() - 1;\n\t\t\tif (type == 1) {\n\t\t\t\tint u = ++cntV;\n\t\t\t\tp[u] = v;\n\t\t\t\tfor (int j = 0; j < maxK; j++) {\n\t\t\t\t\tdpEqLess[j][u] = 1;\n\t\t\t\t}\n\t\t\t\tdouble prev = 1;\n\t\t\t\tfor (int j = 0; j < maxK; j++) {\n\t\t\t\t\tdouble val = dpEqLess[j][v];\n\t\t\t\t\tval /= prev;\t\n\t\t\t\t\tprev = dpEqLess[j][v]*0.5 + 0.5;\n\t\t\t\t\tval *= (0.5 + 0.5*(j - 1 >= 0 ? dpEqLess[j - 1][u] : 0));\n\t\t\t\t\tdpEqLess[j][v] = val;\n\t\t\t\t\t\n\t\t\t\t\tv = p[v];\n\t\t\t\t\tu = p[u];\n\t\t\t\t\tif (v == -1) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tdouble res = 0;\n\t\t\t\tfor (int j = 1; j < maxK; j++) {\n\t\t\t\t\tres += j * (dpEqLess[j][v] - dpEqLess[j - 1][v]);\n\t\t\t\t}\n\t\t\t\tout.println(res);\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic void run() {\n\t\ttry {\n\t\t\tin = new FastScanner();\n\t\t\tout = new PrintWriter(System.out);\n\n\t\t\tsolve();\n\n\t\t\tout.close();\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}\n\n\tclass FastScanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tFastScanner() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tString next() {\n\t\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t}\n\n\tpublic static void main(String[] arg) {\n\t\tnew E().run();\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "dp", "probabilities", "trees"], "code_uid": "baa898e7b6c2dfb0d7e5cbdc817a5101", "src_uid": "55affe752cb214d1e4031a9e3972597b", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class F {\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\tboolean eof;\n\n\tstatic final int K = 110;\n\tstatic final int N = 500_000;\n\n\tdouble[][] dp = new double[N][K];\n\tint[] par = new int[N];\n\n\tvoid solve() throws IOException {\n\t\tint q = nextInt();\n\n\t\tfor (int i = 0; i < N; i++)\n\t\t\tArrays.fill(dp[i], 1);\n\n\t\tpar[0] = -1;\n\n\t\tint curV = 1;\n\n\t\twhile (q-- > 0) {\n\t\t\tint type = nextInt();\n\t\t\tint v = nextInt() - 1;\n\t\t\tif (type == 2) {\n\t\t\t\tdouble ret = 0;\n\t\t\t\tdouble[] ds = dp[v];\n\t\t\t\tfor (int i = 0; i < ds.length; i++) {\n\t\t\t\t\tdouble prob = ds[i];\n\t\t\t\t\tret += 1 - prob;\n\t\t\t\t}\n\t\t\t\tout.println(ret);\n\t\t\t} else {\n\t\t\t\tint u = curV++;\n\t\t\t\tpar[u] = v;\n\n\t\t\t\tdouble old = dp[v][0];\n\t\t\t\tdp[v][0] *= 0.5;\n\t\t\t\tv = par[v];\n\t\t\t\tu = par[u];\n\t\t\t\tint k = 1;\n\t\t\t\twhile (k < K && v != -1) {\n\t\t\t\t\t\n\t\t\t\t\tdouble nextOld = dp[v][k];\n\t\t\t\t\tdp[v][k] /= 0.5 * (1 + old);\n\t\t\t\t\tdp[v][k] *= 0.5 * (1 + dp[u][k - 1]);\n\t\t\t\t\t\n\t\t\t\t\tk++;\n\t\t\t\t\tv = par[v];\n\t\t\t\t\tu = par[u];\n\t\t\t\t\told = nextOld;\n\t\t\t\t}\n\n\t\t\t}\n\t\t}\n\t}\n\n\tF() throws IOException {\n\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.close();\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew F();\n\t}\n\n\tString nextToken() {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (Exception e) {\n\t\t\t\teof = true;\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tString nextString() {\n\t\ttry {\n\t\t\treturn br.readLine();\n\t\t} catch (IOException e) {\n\t\t\teof = true;\n\t\t\treturn null;\n\t\t}\n\t}\n\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "dp", "probabilities", "trees"], "code_uid": "9c648978b4abe5e3c2b1292763b78dad", "src_uid": "55affe752cb214d1e4031a9e3972597b", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\n\nimport static java.lang.Math.*;\n\npublic class Main implements Runnable {\n\n\tvoid solve() throws Exception {\n\t\tint a = sc.nextInt(), b = sc.nextInt(), m = sc.nextInt();\n\t\tint vx = sc.nextInt(), vy = sc.nextInt(), vz = sc.nextInt();\n\t\tdouble t = (double)m / (-vy);\n\t\tdouble sx = (double)a / 2, sz = 0;\n\t\tdouble resx = sx + vx * t;\n\t\tdouble resz = sz + vz * t;\n\t\twhile (resx < 0 || resx > a) {\n\t\t\tif (resx < 0) {\n\t\t\t\tresx = -resx;\n\t\t\t}\n\t\t\tif (resx > a) {\n\t\t\t\tresx = a - (resx - a);\n\t\t\t}\n\t\t}\n\t\twhile (resz < 0 || resz > b) {\n\t\t\tif (resz < 0) {\n\t\t\t\tresz = -resz;\n\t\t\t}\n\t\t\tif (resz > b) {\n\t\t\t\tresz = b - (resz - b);\n\t\t\t}\n\t\t}\n\t\tout.printf(Locale.US, \"%.12f %.12f\\n\", resx, resz);\n\t}\n\t\n\tBufferedReader in;\n\tPrintWriter out;\n\tFastScanner sc;\n\t\n\tstatic Throwable uncaught;\n\t\n\t@Override\n\tpublic void run() {\n\t\ttry {\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(System.out);\n\t\t\tsc = new FastScanner(in);\n\t\t\tsolve();\n\t\t} catch (Throwable t) {\n\t\t\tMain.uncaught = t;\n\t\t} finally {\n\t\t\tout.close();\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) throws Throwable {\n\t\tThread t = new Thread(null, new Main(), \"\", 128 * 1024 * 1024);\n\t\tt.start();\n\t\tt.join();\n\t\tif (uncaught != null) {\n\t\t\tthrow uncaught;\n\t\t}\n\t}\n\n}\n\nclass FastScanner {\n\t\n\tBufferedReader reader;\n\tStringTokenizer strTok;\n\t\n\tpublic FastScanner(BufferedReader reader) {\n\t\tthis.reader = reader;\n\t}\n\t\n\tpublic String nextToken() throws IOException {\n\t\twhile (strTok == null || !strTok.hasMoreTokens()) {\n\t\t\tstrTok = new StringTokenizer(reader.readLine());\n\t\t}\n\t\treturn strTok.nextToken();\n\t}\n\t\n\tpublic int nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\t\n\tpublic long nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\t\n\tpublic double nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n\t\n}", "lang_cluster": "Java", "tags": ["math", "geometry", "implementation"], "code_uid": "6ab1c37447ac42bf1260200674fd72a0", "src_uid": "84848b8bd92fd2834db1ee9cb0899cff", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class _38_Hit_ball {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scn = new Scanner(System.in);\n\t\tdouble x = scn.nextInt();\n\t\tdouble z = scn.nextInt();\n\tdouble m = scn.nextInt();\n\t\tdouble vx = scn.nextInt();\n\t\tdouble vy = scn.nextInt();\n\t\tdouble vz = scn.nextInt();\n\t\tdouble t=0;\n\t\tdouble inx=x/2;\n\t\tdouble iny=m;\n\t\t\n\t\tdouble inz=0;\n\t\t\n while(true){\n \t double xmin=Double.MAX_VALUE;\n \t double zmin=Double.MAX_VALUE;;\n \t if(vx<0){\n \t\t xmin=inx/(-vx);\n \t }else if(vx!=0){\n \t xmin=(x-inx)/(vx);}\n \t \n \t double ymin=iny/(-vy);\n \t if(vz<0){\n \t\t zmin=inz/(-vz);\n \t }else if(vz!=0){\n \t zmin=(z-inz)/vz;}\n \t double v=Math.min(xmin, Math.min(ymin,zmin));\n \t if(ymin==v){\n \t\t inx=inx+vx*v;\n \t\t inz=inz+vz*v;\n \t\t break;\n \t }else if(xmin==zmin){\n \t\t if(vx<0){\n \t\t\t inx=0;\n \t\t }else{\n \t\t inx=x;}\n \t\t if(vz<0){\n \t\t\t inz=0;\n \t\t }else{\n \t\t\t inz=z; \n \t\t }\n \t\t \n \t\t iny=iny+vy*v;\n \t\t vx=-vx;\n \t\t vz=-vz;\n \t }else if(xmin==v){\n \t\t if(vx<0){\n \t\t\t inx=0;\n \t\t }else{\n \t\t inx=x;}\n \t\t inz=inz+vz*v;\n \t\t iny=iny+vy*v;\n \t\t vx=-vx;\n \t }else{\n \t\t if(vz<0){\n \t\t\t inz=0;\n \t\t }else{\n \t\t\t inz=z; \n \t\t }\n \t\t inx=inx+v*vx;\n \t\t iny=iny+vy*v;\n \t\t vz=-vz;\n \t }\n \t \n }\n System.out.printf(\"%.6f \",inx);\n System.out.printf(\"%.6f\",inz);\n\t}\n\n\n}\n", "lang_cluster": "Java", "tags": ["math", "geometry", "implementation"], "code_uid": "b4bdfec5fb0b65fa59b477635684afc5", "src_uid": "84848b8bd92fd2834db1ee9cb0899cff", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\nimport java.math.*;\nimport java.io.*;\n\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\nimport static java.util.Collections.*;\n\npublic class Main {\n\t\n\t//ArrayList<Integer> lis = new ArrayList<Integer>();\n\t//ArrayList<String> lis = new ArrayList<String>();\n\t//ArrayList<test> lis = new ArrayList<test>();\n\tstatic long sum=0;\n//\tstatic boolean f=false;\n\t//static String s[],r=\"\";\n\tstatic int dx[]={1,-1,0,0};\n\tstatic int dy[]={0,0,1,-1};\n\t\npublic static void main(String[] args) throws IOException {\n //googlein.txt C-small-attempt0.in\n//\tScanner sc =new Scanner(new File(\"file.txt\"));\n\t Scanner sc =new Scanner(System.in);\n\t //File file = new File(\"file.txt\");\n\t//\tPrintWriter pw = new PrintWriter(new BufferedWriter(new FileWriter(file)));\n\t//\tsc.useDelimiter(\"(\\\\s)+|[,]\");\n\t\t \n\t while(sc.hasNext()){\n\t\t //long sum=0;\n\t//\t int n=sc.nextInt(),m=sc.nextInt(),k=sc.nextInt();\n\t\tdouble a=sc.nextDouble(),b=sc.nextDouble(),m=sc.nextDouble();\n\t\tdouble x=sc.nextDouble(),y=abs(sc.nextDouble()),z=sc.nextDouble();\n\t\tdouble ax=0,az=0; \n\t\tdouble t=m/abs(y);\n\t\tdouble xx=(abs(x)*t-a/2);\n\t\t\n\t\tif(xx<0)ax=x*t+a/2;\n\t\telse{\n\t\t if((int)(xx/a)%2==0){ if(0<x)ax=a-(xx-(int)(xx/a)*a);else ax=xx-(int)(xx/a)*a; }\t\n\t\t else \t{ if(x<0)ax=a-(xx-(int)(xx/a)*a);else ax=xx-(int)(xx/a)*a; }\t\n\t\t}\n\t\tdouble zz=t*z;\n\t\tif( (int)(zz/b)%2==0 ){ az=zz-(int)(zz/b)*b; }\n\t\telse az=b-(zz-(int)(zz/b)*b); \n\t\t//db(t,xx,zz,(int)(xx/a)%2);\n\t\t\n\t\tSystem.out.println(ax+\" \"+az);\n\t\t \n\t }\n\t \n}\n\t\t \n\t// db(\"Case #\"+(k)+\": \"+c);\n\t //\tpw.println(\"Case #\"+(k)+\": \"+c);\n\t \t\n\t \t//pw.flush();\n\t \t//pw.close(); \n\t \n \n \n\n\n static void db(Object... os){\n\t System.err.println(Arrays.deepToString(os));\n \n\t}\n\n}\n\n/*class P implements Comparable<P>{\n int v,vv,t;\n\tP(int v,int vv,int t){\n\t\tthis.v=v;\n\t this.vv=vv;\n\t this.t=t;\n\t} \n\t public int compareTo(P x){\n return t-x.t;\n\t }\t\n \n\n}*/\n\n\n", "lang_cluster": "Java", "tags": ["math", "geometry", "implementation"], "code_uid": "ba7ffedacc7ddf6c34d350a16576d7b0", "src_uid": "84848b8bd92fd2834db1ee9cb0899cff", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.IOException;\nimport java.io.OutputStreamWriter;\nimport java.io.BufferedWriter;\nimport java.util.InputMismatchException;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.Writer;\nimport java.math.BigInteger;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Crash\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tOutputWriter out = new OutputWriter(outputStream);\n\t\tTaskD solver = new TaskD();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskD {\n\tprivate int sign(double x) {\n\t\tif (Math.abs(x) < 1e-8) return 0;\n\t\treturn (x > 0) ? 1 : -1;\n\t}\n\tpublic void solve(int testNumber, InputReader in, OutputWriter out) {\n\t\tdouble a = in.readDouble();\n\t\tdouble b = in.readDouble();\n\t\tdouble m = in.readDouble();\n\t\tdouble vx = in.readDouble();\n\t\tdouble vy = in.readDouble();\n\t\tdouble vz = in.readDouble();\n\t\tdouble x = a / 2, y = m, z = 0;\n\t\twhile (true) {\n\t\t\tdouble minT = -y / vy;\n\t\t\tint flag = 0;\n\t\t\tif (sign(vx) > 0) {\n\t\t\t\tdouble t = (a - x) / vx;\n\t\t\t\tif (sign(t - minT) < 0) {\n\t\t\t\t\tminT = t;\n\t\t\t\t\tflag = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (sign(vx) < 0) {\n\t\t\t\tdouble t = -x / vx;\n\t\t\t\tif (sign(t - minT) < 0) {\n\t\t\t\t\tminT = t;\n\t\t\t\t\tflag = 2;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (sign(vz) > 0) {\n\t\t\t\tdouble t = (b - z) / vz;\n\t\t\t\tif (sign(t - minT) < 0) {\n\t\t\t\t\tminT = t;\n\t\t\t\t\tflag = 3;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (sign(vz) < 0) {\n\t\t\t\tdouble t = -z / vz;\n\t\t\t\tif (sign(t - minT) < 0) {\n\t\t\t\t\tminT = t;\n\t\t\t\t\tflag = 4;\n\t\t\t\t}\n\t\t\t}\n\t\t\tx += minT * vx;\n\t\t\ty += minT * vy;\n\t\t\tz += minT * vz;\n\t\t\tif (flag == 0) break;\n\t\t\tif (flag == 1 || flag == 2) vx *= -1;\n\t\t\tif (flag == 3 || flag == 4) vz *= -1;\n\t\t}\n\t\tout.printDouble(x, 10);\n\t\tout.print(\" \");\n\t\tout.printDouble(z, 10);\n\t\tout.printLine();\n\t}\n}\n\nclass InputReader {\n\tprivate InputStream stream;\n\tprivate byte[] buf = new byte[1000];\n\tprivate int curChar;\n\tprivate int numChars;\n\n\tpublic InputReader(InputStream stream) {\n\t\tthis.stream = stream;\n\t}\n\n\tprivate int read() {\n\t\tif (numChars == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (curChar >= numChars) {\n\t\t\tcurChar = 0;\n\t\t\ttry {\n\t\t\t\tnumChars = stream.read(buf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (numChars <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buf[curChar++];\n\t}\n\n\tpublic double readDouble() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tdouble res = 0;\n\t\twhile (!isSpaceChar(c) && c != '.') {\n\t\t\tif (c < '0' || c > '9')\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t}\n\t\tif (c == '.') {\n\t\t\tc = read();\n\t\t\tdouble m = 1;\n\t\t\twhile (!isSpaceChar(c)) {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tm /= 10;\n\t\t\t\tres += (c - '0') * m;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t}\n\t\treturn res * sgn;\n\t}\n\n\tprivate boolean isSpaceChar(int c) {\n\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t}\n}\n\nclass OutputWriter {\n\tprivate final PrintWriter writer;\n\n\tpublic OutputWriter(OutputStream outputStream) {\n\t\twriter = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n\t}\n\n\tpublic OutputWriter(Writer writer) {\n\t\tthis.writer = new PrintWriter(writer);\n\t}\n\n\tpublic void print(Object...objects) {\n\t\tfor (int i = 0; i < objects.length; i++) {\n\t\t\tif (i != 0)\n\t\t\t\twriter.print(' ');\n\t\t\twriter.print(objects[i]);\n\t\t}\n\t}\n\n\tpublic void printDouble(double x, int precision) {\n\t\twriter.printf(\"%.\" + precision + \"f\", x);\n\t}\n\n\tpublic void printLine(Object...objects) {\n\t\tprint(objects);\n\t\twriter.println();\n\t}\n\n\tpublic void close() {\n\t\twriter.close();\n\t}\n}\n\n", "lang_cluster": "Java", "tags": ["math", "geometry", "implementation"], "code_uid": "cb6ae252811bed48f1d278550c1c2daa", "src_uid": "84848b8bd92fd2834db1ee9cb0899cff", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.BufferedReader;\nimport java.io.BufferedWriter;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\n\npublic class cf203d {\n public static void main(String[] args) {\n FastIO in = new FastIO(), out = in;\n double a = in.nextDouble();\n double b = in.nextDouble();\n double m = in.nextDouble();\n double vx = in.nextDouble();\n double vy = in.nextDouble();\n double vz = in.nextDouble();\n double t = m / -vy;\n double x0 = a/2 + vx*t;\n double z0 = vz*t;\n while(x0 < 0 || x0 > a) {\n if(x0 < 0) x0 = -x0;\n if(x0 > a) x0 = 2*a-x0;\n }\n while(z0 < 0 || z0 > b) {\n if(z0 < 0) z0 = -z0;\n if(z0 > b) z0 = 2*b-z0;\n }\n out.printf(\"%.10f %.10f%n\", x0,z0);\n out.close();\n }\n static boolean ok(int x) {\n while(x > 0) {\n int d = x%10;\n if(d != 1 && d != 4) return false;\n x /= 10;\n }\n return true;\n }\n static class FastIO extends PrintWriter {\n BufferedReader br;\n StringTokenizer st;\n \n public FastIO() {\n this(System.in,System.out);\n }\n public FastIO(InputStream in, OutputStream out) {\n super(new BufferedWriter(new OutputStreamWriter(out)));\n br = new BufferedReader(new InputStreamReader(in));\n scanLine();\n }\n public void scanLine() {\n try {\n st = new StringTokenizer(br.readLine().trim());\n } catch(Exception e) {\n throw new RuntimeException(e.getMessage());\n }\n }\n public int numTokens() {\n if(!st.hasMoreTokens()) {\n scanLine();\n return numTokens();\n }\n return st.countTokens();\n }\n public String next() {\n if(!st.hasMoreTokens()) {\n scanLine();\n return next();\n }\n return st.nextToken();\n }\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n public long nextLong() {\n return Long.parseLong(next());\n }\n public int nextInt() {\n return Integer.parseInt(next());\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "geometry", "implementation"], "code_uid": "99c3e7fc86c531223ec7c7b5a3de913e", "src_uid": "84848b8bd92fd2834db1ee9cb0899cff", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\n\npublic class Main {\n BufferedReader br;\n int a, b, m, vx, vy, vz;\n BigDecimal t, x, z, x0, z0;\n \n public void go() throws Exception {\n br = new BufferedReader(new InputStreamReader(System.in));\n String[] ss = br.readLine().split(\" \");\n a = Integer.parseInt(ss[0]);\n b = Integer.parseInt(ss[1]);\n m = Integer.parseInt(ss[2]);\n ss = br.readLine().split(\" \");\n vx = Integer.parseInt(ss[0]);\n vy = Integer.parseInt(ss[1]);\n vz = Integer.parseInt(ss[2]);\n \n t = new BigDecimal(-m).divide(new BigDecimal(vy), 50, RoundingMode.UP);\n x = new BigDecimal(a).divide(new BigDecimal(2), 50, RoundingMode.UP).add(new BigDecimal(vx).multiply(t));\n z = new BigDecimal(vz).multiply(t);\n \n if (x.compareTo(BigDecimal.ZERO) != -1) {\n x0 = x.divideAndRemainder(new BigDecimal(2*a))[1];\n if (x0.intValue() >= a)\n x0 = new BigDecimal(2*a).subtract(x0);\n }\n else {\n x = x.negate();\n x0 = x.divideAndRemainder(new BigDecimal(2*a))[1];\n if (x0.intValue() >= a)\n x0 = new BigDecimal(2*a).subtract(x0);\n }\n \n z0 = z.divideAndRemainder(new BigDecimal(2*b))[1];\n if (z0.intValue() > b)\n z0 = new BigDecimal(2*b).subtract(z0);\n \n System.out.format(\"%.10f %.10f%n\", x0.doubleValue(), z0.doubleValue());\n }\n \n public static void main(String[] args) throws Exception {\n new Main().go();\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "geometry", "implementation"], "code_uid": "d3f248ff4d62ef25b8806f74b2dd72f3", "src_uid": "84848b8bd92fd2834db1ee9cb0899cff", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC {\n static final int INF = (int) 1e9;\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.nextInt();\n String s = in.next();\n int nk = 0;\n int nv = 0;\n int no = 0;\n int[] kpos = new int[n];\n int[] vpos = new int[n];\n int[] opos = new int[n];\n int[] snk = new int[n + 1];\n int[] snv = new int[n + 1];\n int[] sno = new int[n + 1];\n for (int i = 0; i < n; ++i) {\n char ch = s.charAt(i);\n if (ch == 'V') {\n vpos[nv++] = i;\n } else if (ch == 'K') {\n kpos[nk++] = i;\n } else {\n opos[no++] = i;\n }\n snk[i + 1] = nk;\n snv[i + 1] = nv;\n sno[i + 1] = no;\n }\n int[][][][] best = new int[2][nk + 1][nv + 1][no + 1];\n for (int[][][] x : best) for (int[][] y : x) for (int[] z : y) Arrays.fill(z, INF);\n best[0][0][0][0] = 0;\n for (int k = 0; k <= nk; ++k) {\n for (int v = 0; v <= nv; ++v) {\n for (int o = 0; o <= no; ++o) {\n for (int hv = 0; hv < 2; ++hv) {\n int cur = best[hv][k][v][o];\n if (k < nk && hv == 0) {\n best[0][k + 1][v][o] = Math.min(best[0][k + 1][v][o], cur + Math.max(snv[kpos[k]] - v,0) + Math.max(sno[kpos[k]] - o,0));\n }\n if (v < nv) {\n best[1][k][v + 1][o] = Math.min(best[1][k][v + 1][o], cur + Math.max(snk[vpos[v]] - k,0) + Math.max(sno[vpos[v]] - o,0));\n }\n if (o < no) {\n best[0][k][v][o + 1] = Math.min(best[0][k][v][o + 1], cur + Math.max(snv[opos[o]] - v,0) + Math.max(snk[opos[o]] - k,0));\n }\n }\n }\n }\n }\n out.println(Math.min(best[0][nk][nv][no], best[1][nk][nv][no]) );\n }\n\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "f81ed35e5468bfdf0b5ca08b4bda8228", "src_uid": "08444f9ab1718270b5ade46852b155d7", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package Round_405;\n\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class E {\n\n\tpublic E() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tint n = sc.nextInt();\n\t\tArrayList<Integer> V = new ArrayList<Integer>(), K = new ArrayList<Integer>(), X = new ArrayList<Integer>();\n\t\tchar[] s = sc.next().toCharArray();\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tif (s[i] == 'V')\n\t\t\t\tV.add(i);\n\t\t\telse if (s[i] == 'K')\n\t\t\t\tK.add(i);\n\t\t\telse\n\t\t\t\tX.add(i);\n\t\tlong[][][][] dp = new long[n + 1][n + 1][n + 1][2];\n\t\tfor (int i = 0; i <= n; i++)\n\t\t\tfor (int j = 0; j <= n; j++)\n\t\t\t\tfor (int k = 0; k <= n; k++)\n\t\t\t\t\tfor (int d = 0; d < 2; d++)\n\t\t\t\t\t\tdp[i][j][k][d] = Integer.MAX_VALUE;\n\t\tdp[0][0][0][0] = 0;\n\t\tfor (int v = 0; v <= V.size(); v++) {\n\t\t\tfor (int k = 0; k <= K.size(); k++) {\n\t\t\t\tfor (int x = 0; x <= X.size(); x++) {\n\t\t\t\t\tfor (int t = 0; t < 2; t++) {\n\t\t\t\t\t\tlong cur = dp[v][k][x][t];\n\t\t\t\t\t\tint m1 = 0, m2 = 0, m3 = 0;\n\t\t\t\t\t\tif (v < V.size()) {\n\t\t\t\t\t\t\tint vv = V.get(v);\n\t\t\t\t\t\t\tm1 = rem(V, v, vv) + rem(K, k, vv) + rem(X, x, vv);\n\t\t\t\t\t\t\tdp[v + 1][k][x][1] = Math.min(dp[v + 1][k][x][1],\n\t\t\t\t\t\t\t\t\tcur + m1);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (k < K.size() && t == 0) {\n\t\t\t\t\t\t\tint kk = K.get(k);\n\t\t\t\t\t\t\tm2 = rem(V, v, kk) + rem(K, k, kk) + rem(X, x, kk);\n\t\t\t\t\t\t\tdp[v][k + 1][x][0] = Math.min(dp[v][k + 1][x][0],\n\t\t\t\t\t\t\t\t\tcur + m2);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (x < X.size()) {\n\t\t\t\t\t\t\tint xx = X.get(x);\n\t\t\t\t\t\t\tm3 = rem(V, v, xx) + rem(K, k, xx) + rem(X, x, xx);\n\t\t\t\t\t\t\tdp[v][k][x + 1][0] = Math.min(dp[v][k][x + 1][0],\n\t\t\t\t\t\t\t\t\tcur + m3);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tlong ret = Long.MAX_VALUE;\n\t\tfor (int i = 0; i < 2; i++)\n\t\t\tret = Math.min(ret, dp[V.size()][K.size()][X.size()][i]);\n\t\tout.println(ret);\n\t\tsc.close();\n\t\tout.close();\n\t}\n\n\tprivate int rem(ArrayList<Integer> arr, int ind, int val) {\n\t\tint cnt = 0;\n\t\tfor (int i = ind; i < arr.size() && arr.get(i) < val; i++)\n\t\t\tcnt++;\n\t\treturn cnt;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew E();\n\t}\n}", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "bf66a0df1cc308a827399251b97c482b", "src_uid": "08444f9ab1718270b5ade46852b155d7", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\n/**\n * @author Pavel Mavrin\n */\npublic class C {\n\n private void solve() throws IOException {\n int n = nextInt();\n String s = next();\n int[][] a = new int[3][n];\n int[] na = new int[3];\n for (int i = 0; i < n; i++) {\n if (s.charAt(i) == 'V') {\n a[0][na[0]++] = i;\n } else if (s.charAt(i) == 'K') {\n a[1][na[1]++] = i;\n } else {\n a[2][na[2]++] = i;\n }\n }\n int[][][][] d = new int[na[0] + 1][na[1] + 1][na[2] + 1][2];\n for (int[][][] ints : d) {\n for (int[][] anInt : ints) {\n for (int[] ints1 : anInt) {\n Arrays.fill(ints1, Integer.MAX_VALUE);\n }\n }\n }\n int[][][] p = new int[3][3][n];\n for (int x = 0; x < 3; x++) {\n for (int y = 0; y < 3; y++) if (x != y) {\n for (int i = 0; i < na[x]; i++) {\n for (int j = 0; j < na[y]; j++) {\n if (a[y][j] < a[x][i]) p[x][y][i]++;\n }\n }\n }\n }\n// for (int x = 0; x < 3; x++) {\n// for (int i = 0; i < na[x]; i++) {\n// System.out.println(x + \" \" + i + \" \" + p[x][i]);\n// }\n// }\n d[0][0][0][1] = 0;\n for (int i = 0; i <= na[0]; i++) {\n for (int j = 0; j <= na[1]; j++) {\n for (int k = 0; k <= na[2]; k++) {\n for (int q = 0; q < 2; q++) if (d[i][j][k][q] != Integer.MAX_VALUE) {\n// System.out.println(i + \" \" + j + \" \" + k + \" \" + q + \" \" + d[i][j][k][q]);\n if (i < na[0]) {\n d[i + 1][j][k][0] = Math.min(d[i + 1][j][k][0], d[i][j][k][q] + Math.max(p[0][1][i] - j, 0) + Math.max(p[0][2][i] - k, 0));\n }\n if (j < na[1] && q == 1) {\n d[i][j + 1][k][1] = Math.min(d[i][j + 1][k][1], d[i][j][k][q] + Math.max(p[1][0][j] - i, 0) + Math.max(p[1][2][j] - k, 0));\n }\n if (k < na[2]) {\n d[i][j][k + 1][1] = Math.min(d[i][j][k + 1][1], d[i][j][k][q] + Math.max(p[2][0][k] - i, 0) + Math.max(p[2][1][k] - j, 0));\n }\n }\n }\n }\n }\n out.println(Math.min(d[na[0]][na[1]][na[2]][0], d[na[0]][na[1]][na[2]][1]));\n }\n\n // ------------------\n\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st;\n PrintWriter out = new PrintWriter(System.out);\n\n String next() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return st.nextToken();\n }\n\n int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n public static void main(String[] args) throws IOException {\n new C().run();\n }\n\n private void run() throws IOException {\n solve();\n out.close();\n }\n\n}\n", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "4c30633821c27c0b4e7f2eacbe71b300", "src_uid": "08444f9ab1718270b5ade46852b155d7", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class DStress2 {\n\n\tvoid solve() {\n//\t\tstress();\n\t\t int n = in.nextInt();\n\t\t String s = in.nextToken();\n\t\t out.println(solve(s.toCharArray()));\n\t}\n\n\tvoid stress() {\n\t\tRandom rng = new Random(123);\n\t\tfor (int IT = 0; IT < 10000; IT++) {\n\t\t\tint n = 1 + rng.nextInt(12);\n\t\t\tchar[] c = new char[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tc[i] = \"AVK\".charAt(rng.nextInt(3));\n\t\t\t}\n\n\t\t\tint ans1 = solve(c);\n\t\t\tint ans2 = stupid(c);\n\t\t\tif (ans1 != ans2) {\n\t\t\t\tSystem.err.println(IT + \" \" + ans1 + \" \" + ans2 + \" \" + new String(c));\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tint INF = Integer.MAX_VALUE / 3;\n\n\tint stupid(char[] s) {\n\t\tString st = new String(s);\n\t\tQueue<String> q = new ArrayDeque<>();\n\t\tMap<String, Integer> dist = new HashMap<>();\n\t\tq.add(st);\n\t\tdist.put(st, 0);\n\t\twhile (!q.isEmpty()) {\n\t\t\tst = q.poll();\n\t\t\tint cur = dist.get(st);\n\t\t\tif (!st.contains(\"VK\")) {\n\t\t\t\treturn cur;\n\t\t\t}\n\n\t\t\tfor (int pos = 0; pos < st.length() - 1; pos++) {\n\t\t\t\tString next = st.substring(0, pos) + st.charAt(pos + 1) + st.charAt(pos) + st.substring(pos + 2);\n\t\t\t\tif (!dist.containsKey(next)) {\n\t\t\t\t\tdist.put(next, cur + 1);\n\t\t\t\t\tq.add(next);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn 0;\n\t}\n\n\tint solve(char[] s) {\n\t\tList<Integer> vPos = new ArrayList<>(), kPos = new ArrayList<>(), otherPos = new ArrayList<>();\n\n\t\tfor (int i = 0; i < s.length; i++) {\n\t\t\tif (s[i] == 'V') {\n\t\t\t\tvPos.add(i);\n\t\t\t} else if (s[i] == 'K') {\n\t\t\t\tkPos.add(i);\n\t\t\t} else {\n\t\t\t\totherPos.add(i);\n\t\t\t}\n\t\t}\n\t\t\n\t\tint[][][][] dp = new int[2][vPos.size() + 1][kPos.size() + 1][otherPos.size() + 1];\n\t\t\n\t\tfor (int[][][] i : dp) {\n\t\t\tfor (int[][] j : i) {\n\t\t\t\tfor (int[] k : j) {\n\t\t\t\t\tArrays.fill(k, INF);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tdp[0][0][0][0] = 0;\n\t\t\n\t\tfor (int V = 0; V <= vPos.size(); V++) {\n\t\t\tfor (int K = 0; K <= kPos.size(); K++) {\n\t\t\t\tfor (int O = 0; O <= otherPos.size(); O++) {\n\t\t\t\t\tfor (int last = 0; last < 2; last++) {\n\t\t\t\t\t\tint cur = dp[last][V][K][O];\n\t\t\t\t\t\tif (cur == INF) {\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (V < vPos.size()) {\n\t\t\t\t\t\t\tdp[1][V + 1][K][O] = Math.min(dp[1][V + 1][K][O], cur + count(vPos.get(V), K, kPos) + count(vPos.get(V), O, otherPos));\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (K < kPos.size() && last == 0) {\n\t\t\t\t\t\t\tdp[0][V][K + 1][O] = Math.min(dp[0][V][K + 1][O], cur + count(kPos.get(K), V, vPos) + count(kPos.get(K), O, otherPos));\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (O < otherPos.size()) {\n\t\t\t\t\t\t\tdp[0][V][K][O + 1] = Math.min(dp[0][V][K][O + 1], cur + count(otherPos.get(O), V, vPos) + count(otherPos.get(O), K, kPos));\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn Math.min(dp[0][vPos.size()][kPos.size()][otherPos.size()], dp[1][vPos.size()][kPos.size()][otherPos.size()]);\n\t}\n\n\tprivate int count(Integer integer, int start, List<Integer> kPos) {\n\t\tint ans = 0;\n\t\tfor (int i = start; i < kPos.size(); i++) {\n\t\t\tif (kPos.get(i) < integer) {\n\t\t\t\tans++;\n\t\t\t}\n\t\t}\n\t\treturn ans;\n\t}\n\n\tFastScanner in;\n\tPrintWriter out;\n\n\tvoid run() {\n\t\tin = new FastScanner();\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.close();\n\t}\n\n\tclass FastScanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tpublic FastScanner() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tpublic FastScanner(String s) {\n\t\t\ttry {\n\t\t\t\tbr = new BufferedReader(new FileReader(s));\n\t\t\t} catch (FileNotFoundException e) {\n\t\t\t\t// TODO Auto-generated catch block\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\n\t\tpublic String nextToken() {\n\t\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(nextToken());\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(nextToken());\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(nextToken());\n\t\t}\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew DStress2().run();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "3b03bd5dd0a8dbee1e745d3c56e6ebe2", "src_uid": "08444f9ab1718270b5ade46852b155d7", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.BufferedWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.util.ArrayList;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC {\n public int cv;\n public int ck;\n public int cs;\n public int[][] freq;\n public ArrayList<Integer>[] pos;\n public int[][][][] dp;\n\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n = in.nextInt();\n char[] c = in.next().toCharArray();\n cv = 0;\n ck = 0;\n cs = 0;\n freq = new int[n + 1][3];\n pos = new ArrayList[3];\n for (int i = 0; i < 3; i++) pos[i] = new ArrayList<>();\n int idx = 0;\n for (char x : c) {\n System.arraycopy(freq[idx], 0, freq[idx + 1], 0, 3);\n idx++;\n if (x == 'V') {\n freq[idx][0]++;\n cv++;\n pos[0].add(idx);\n } else if (x == 'K') {\n freq[idx][1]++;\n ck++;\n pos[1].add(idx);\n } else {\n freq[idx][2]++;\n cs++;\n pos[2].add(idx);\n }\n }\n dp = new int[cv + 1][ck + 1][cs + 1][3];\n for (int[][][] x : dp) for (int[][] y : x) for (int[] z : y) Arrays.fill(z, -1);\n out.println(dfs(0, 0, 0, 2));\n }\n\n public int dfs(int tv, int tk, int ts, int last) {\n if (tv == cv && tk == ck && ts == cs) {\n return 0;\n }\n if (dp[tv][tk][ts][last] != -1) return dp[tv][tk][ts][last];\n int ret = 1 << 29;\n if (tv < cv) {\n int p = pos[0].get(tv);\n int move = Math.max(freq[p][0] - tv, 0) + Math.max(freq[p][1] - tk, 0) + Math.max(freq[p][2] - ts, 0) - 1;\n ret = Math.min(ret, dfs(tv + 1, tk, ts, 0) + move);\n }\n if (tk < ck && last != 0) {\n int p = pos[1].get(tk);\n int move = Math.max(freq[p][0] - tv, 0) + Math.max(freq[p][1] - tk, 0) + Math.max(freq[p][2] - ts, 0) - 1;\n ret = Math.min(ret, dfs(tv, tk + 1, ts, 1) + move);\n }\n if (ts < cs) {\n int p = pos[2].get(ts);\n int move = Math.max(freq[p][0] - tv, 0) + Math.max(freq[p][1] - tk, 0) + Math.max(freq[p][2] - ts, 0) - 1;\n ret = Math.min(ret, dfs(tv, tk, ts + 1, 2) + move);\n }\n return dp[tv][tk][ts][last] = ret;\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (this.numChars == -1) {\n throw new InputMismatchException();\n } else {\n if (this.curChar >= this.numChars) {\n this.curChar = 0;\n\n try {\n this.numChars = this.stream.read(this.buf);\n } catch (IOException var2) {\n throw new InputMismatchException();\n }\n\n if (this.numChars <= 0) {\n return -1;\n }\n }\n\n return this.buf[this.curChar++];\n }\n }\n\n public int nextInt() {\n int c;\n for (c = this.read(); isSpaceChar(c); c = this.read()) {\n ;\n }\n\n byte sgn = 1;\n if (c == 45) {\n sgn = -1;\n c = this.read();\n }\n\n int res = 0;\n\n while (c >= 48 && c <= 57) {\n res *= 10;\n res += c - 48;\n c = this.read();\n if (isSpaceChar(c)) {\n return res * sgn;\n }\n }\n\n throw new InputMismatchException();\n }\n\n public String next() {\n int c;\n while (isSpaceChar(c = this.read())) {\n ;\n }\n\n StringBuilder result = new StringBuilder();\n result.appendCodePoint(c);\n\n while (!isSpaceChar(c = this.read())) {\n result.appendCodePoint(c);\n }\n\n return result.toString();\n }\n\n public static boolean isSpaceChar(int c) {\n return c == 32 || c == 10 || c == 13 || c == 9 || c == -1;\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void println(int i) {\n writer.println(i);\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "6fa5248406eb60e5bd76542c0803972c", "src_uid": "08444f9ab1718270b5ade46852b155d7", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package round405;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class C {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t\tint n = ni();\n\t\tchar[] s = ns(n);\n\t\t\n\t\tint[][][][] dp = new int[3][n+1][n+1][n+1];\n\t\tfor(int i = 0;i <= n;i++){\n\t\t\tfor(int j = 0;j <= n;j++){\n\t\t\t\tArrays.fill(dp[0][i][j], 99999999);\n\t\t\t\tArrays.fill(dp[1][i][j], 99999999);\n\t\t\t\tArrays.fill(dp[2][i][j], 99999999);\n\t\t\t}\n\t\t}\n\t\tint nv = 0, nk = 0, ne = 0;\n\t\tfor(char c : s){\n\t\t\tif(c == 'V'){\n\t\t\t\tnv++;\n\t\t\t}else if(c == 'K'){\n\t\t\t\tnk++;\n\t\t\t}else{\n\t\t\t\tne++;\n\t\t\t}\n\t\t}\n\t\t\n\t\t// V K ?\n\t\tdp[2][0][0][0] = 0;\n\t\tint[][][][] poss = new int[3][nv+1][nk+1][ne+1];\n\t\tfor(int i = 0;i <= nv;i++){\n\t\t\tfor(int j = 0;j <= nk;j++){\n\t\t\t\tfor(int k = 0;k <= ne;k++){\n\t\t\t\t\tfor(int l = 0;l < 3;l++){\n\t\t\t\t\t\tposs[l][i][j][k] = pos(s, i, j, k, l);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor(int i = 0;i <= nv;i++){\n\t\t\tfor(int j = 0;j <= nk;j++){\n\t\t\t\tfor(int k = 0;k <= ne;k++){\n\t\t\t\t\tif(i+1 <= nv && poss[0][i][j][k] != -1){\n\t\t\t\t\t\tint v = poss[0][i][j][k];\n\t\t\t\t\t\tdp[0][i+1][j][k] = Math.min(dp[0][i+1][j][k], dp[2][i][j][k] + v);\n\t\t\t\t\t\tdp[0][i+1][j][k] = Math.min(dp[0][i+1][j][k], dp[1][i][j][k] + v);\n\t\t\t\t\t\tdp[0][i+1][j][k] = Math.min(dp[0][i+1][j][k], dp[0][i][j][k] + v);\n\t\t\t\t\t}\n\t\t\t\t\tif(j+1 <= nk && poss[1][i][j][k] != -1){\n\t\t\t\t\t\tint v = poss[1][i][j][k];\n\t\t\t\t\t\tdp[1][i][j+1][k] = Math.min(dp[1][i][j+1][k], dp[2][i][j][k] + v);\n\t\t\t\t\t\tdp[1][i][j+1][k] = Math.min(dp[1][i][j+1][k], dp[1][i][j][k] + v);\n\t\t\t\t\t}\n\t\t\t\t\tif(k+1 <= ne && poss[2][i][j][k] != -1){\n\t\t\t\t\t\tint v = poss[2][i][j][k];\n\t\t\t\t\t\tdp[2][i][j][k+1] = Math.min(dp[2][i][j][k+1], dp[2][i][j][k] + v);\n\t\t\t\t\t\tdp[2][i][j][k+1] = Math.min(dp[2][i][j][k+1], dp[1][i][j][k] + v);\n\t\t\t\t\t\tdp[2][i][j][k+1] = Math.min(dp[2][i][j][k+1], dp[0][i][j][k] + v);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tout.println(Math.min(Math.min(dp[0][nv][nk][ne], dp[1][nv][nk][ne]), dp[2][nv][nk][ne]));\n\t}\n\t\n\tint pos(char[] s, int a, int b, int c, int k)\n\t{\n\t\tint ret = 0;\n\t\tfor(char x : s){\n\t\t\tif(x == 'V'){\n\t\t\t\tif(a == 0){\n\t\t\t\t\tif(k == 0)return ret;\n\t\t\t\t\tret++;\n\t\t\t\t}else{\n\t\t\t\t\ta--;\n\t\t\t\t}\n\t\t\t}else if(x == 'K'){\n\t\t\t\tif(b == 0){\n\t\t\t\t\tif(k == 1)return ret;\n\t\t\t\t\tret++;\n\t\t\t\t}else{\n\t\t\t\t\tb--;\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tif(c == 0){\n\t\t\t\t\tif(k == 2)return ret;\n\t\t\t\t\tret++;\n\t\t\t\t}else{\n\t\t\t\t\tc--;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn -1;\n\t}\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new C().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "f955724eb84ef0a1930763f4458b048c", "src_uid": "08444f9ab1718270b5ade46852b155d7", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class C {\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\tboolean eof;\n\n\tvoid submit() throws IOException {\n\t\tnextInt();\n\t\tString s = nextToken();\n\t\tout.println(fast(s));\n//\t\tout.println(slow(s));\n\t}\n\n\tstatic final String BAD = \"VK\";\n\n\tString prepare(String s) {\n\t\tStringBuilder sb = new StringBuilder();\n\t\tfor (int i = 0; i < s.length(); i++) {\n\t\t\tchar c = s.charAt(i);\n\t\t\tif (BAD.indexOf(c) != -1) {\n\t\t\t\tsb.append(c);\n\t\t\t} else {\n\t\t\t\tsb.append('A');\n\t\t\t}\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tint slow(String s) {\n\t\ts = prepare(s);\n\t\tHashMap<String, Integer> map = new HashMap<>();\n\t\tArrayDeque<String> que = new ArrayDeque<>();\n\t\tque.add(s);\n\t\tmap.put(s, 0);\n\n\t\twhile (true) {\n\t\t\ts = que.poll();\n\t\t\tint curD = map.get(s);\n\t\t\tif (s.indexOf(BAD) == -1) {\n\t\t\t\t// System.err.println(s);\n\t\t\t\treturn curD;\n\t\t\t}\n\n\t\t\tfor (int i = 0; i < s.length() - 1; i++) {\n\t\t\t\tString nxt = swap(s, i, i + 1);\n\t\t\t\tif (nxt != null && !map.containsKey(nxt)) {\n\t\t\t\t\tmap.put(nxt, curD + 1);\n\t\t\t\t\tque.add(nxt);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tString swap(String s, int i, int j) {\n\t\tif (s.charAt(i) == s.charAt(j)) {\n\t\t\treturn null;\n\t\t}\n\t\tchar[] buf = s.toCharArray();\n\t\tchar tmp = buf[i];\n\t\tbuf[i] = buf[j];\n\t\tbuf[j] = tmp;\n\t\treturn new String(buf);\n\t}\n\n\tstatic final String STR = \"VKA\";\n\n\tint fast(String s) {\n\n\t\ts = prepare(s);\n\n\t\tint n = s.length();\n\n\t\tint[] a = new int[n];\n\t\tint[][] pos = new int[3][n];\n\t\tint[] sz = new int[3];\n\n\t\tint[][][] cntHere = new int[3][n][3];\n\n\t\tint[][] pref = new int[n + 1][];\n\n\t\tpref[0] = new int[] { 0, 0, 0 };\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta[i] = STR.indexOf(s.charAt(i));\n\t\t\tint c = a[i];\n\t\t\tcntHere[c][sz[c]] = pref[i].clone();\n\t\t\tpos[c][sz[c]++] = i;\n\n\t\t\tpref[i + 1] = pref[i].clone();\n\t\t\tpref[i + 1][c]++;\n\t\t}\n\n\t\tint[][][][] dp = new int[2][sz[0] + 1][sz[1] + 1][sz[2] + 1];\n\n\t\tfor (int i = 0; i < 2; i++) {\n\t\t\tfor (int j0 = 0; j0 <= sz[0]; j0++) {\n\t\t\t\tfor (int j1 = 0; j1 <= sz[1]; j1++) {\n\t\t\t\t\tArrays.fill(dp[i][j0][j1], INF);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint ans = INF;\n\n\t\tdp[0][0][0][0] = 0;\n\t\tfor (int j0 = 0; j0 <= sz[0]; j0++) {\n\t\t\tfor (int j1 = 0; j1 <= sz[1]; j1++) {\n\t\t\t\tfor (int j2 = 0; j2 <= sz[2]; j2++) {\n\t\t\t\t\tfor (int last = 0; last < 2; last++) {\n\t\t\t\t\t\t//\n\t\t\t\t\t\t// if (j0 == 2 && j1 == 0 && j2 == 1) {\n\t\t\t\t\t\t// System.err.println(dp[last][j0][j1][j2]);\n\t\t\t\t\t\t// }\n\n\t\t\t\t\t\tint idx = j0 + j1 + j2;\n\t\t\t\t\t\tint curVal = dp[last][j0][j1][j2];\n\t\t\t\t\t\tif (curVal == INF) {\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif (idx == n) {\n\t\t\t\t\t\t\tans = Math.min(ans, curVal);\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif (j0 < sz[0]) {\n\t\t\t\t\t\t\tint cost = Math.max(j1 - cntHere[0][j0][1], 0)\n\t\t\t\t\t\t\t\t\t+ Math.max(j2 - cntHere[0][j0][2], 0);\n\t\t\t\t\t\t\tdp[1][j0 + 1][j1][j2] = Math.min(\n\t\t\t\t\t\t\t\t\tdp[1][j0 + 1][j1][j2], curVal + cost);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif (j1 < sz[1] && last == 0) {\n\t\t\t\t\t\t\tint cost = Math.max(j0 - cntHere[1][j1][0], 0)\n\t\t\t\t\t\t\t\t\t+ Math.max(j2 - cntHere[1][j1][2], 0);\n\t\t\t\t\t\t\tdp[0][j0][j1 + 1][j2] = Math.min(\n\t\t\t\t\t\t\t\t\tdp[0][j0][j1 + 1][j2], curVal + cost);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif (j2 < sz[2]) {\n\t\t\t\t\t\t\tint cost = Math.max(j0 - cntHere[2][j2][0], 0)\n\t\t\t\t\t\t\t\t\t+ Math.max(j1 - cntHere[2][j2][1], 0);\n\t\t\t\t\t\t\tdp[0][j0][j1][j2 + 1] = Math.min(\n\t\t\t\t\t\t\t\t\tdp[0][j0][j1][j2 + 1], curVal + cost);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn ans;\n\t}\n\n\tstatic final int INF = 1_000_000;\n\n\tstatic final Random rng = new Random();\n\n\tString genStr() {\n\t\tint n = rng.nextInt(15) + 1;\n\t\t// int n = 6;\n\t\tchar[] buf = new char[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tbuf[i] = STR.charAt(rng.nextInt(3));\n\t\t}\n\t\treturn new String(buf);\n\t}\n\n\tvoid stress() {\n\t\tfor (int tst = 0;; tst++) {\n\t\t\tString s = genStr();\n\t\t\tint fast = fast(s);\n\t\t\tint slow = slow(s);\n\t\t\tif (fast != slow) {\n\t\t\t\tSystem.err.println(s);\n\t\t\t\tSystem.err.println(fast);\n\t\t\t\tSystem.err.println(slow);\n\t\t\t\tthrow new AssertionError();\n\t\t\t}\n\t\t\tSystem.err.println(tst);\n\t\t}\n\t}\n\n\tC() throws IOException {\n\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\tsubmit();\n\t\t// stress();\n\t\tout.close();\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew C();\n\t}\n\n\tString nextToken() {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (Exception e) {\n\t\t\t\teof = true;\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tString nextString() {\n\t\ttry {\n\t\t\treturn br.readLine();\n\t\t} catch (IOException e) {\n\t\t\teof = true;\n\t\t\treturn null;\n\t\t}\n\t}\n\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n}", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "a60bb2a52a3385b32f01a1b2942c9134", "src_uid": "08444f9ab1718270b5ade46852b155d7", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class J implements Runnable {\n\n private static final boolean ONLINE_JUDGE = System.getProperty(\"ONLINE_JUDGE\") != null;\n\n private BufferedReader in;\n private PrintWriter out;\n private StringTokenizer tok = new StringTokenizer(\"\");\n\n private void init() throws FileNotFoundException {\n Locale.setDefault(Locale.US);\n String fileName = \"\";\n if (ONLINE_JUDGE && fileName.isEmpty()) {\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n } else {\n if (fileName.isEmpty()) {\n in = new BufferedReader(new FileReader(\"input.txt\"));\n out = new PrintWriter(\"output.txt\");\n } else {\n in = new BufferedReader(new FileReader(fileName + \".in\"));\n out = new PrintWriter(fileName + \".out\");\n }\n }\n }\n\n String readString() throws IOException {\n while (!tok.hasMoreTokens()) {\n tok = new StringTokenizer(in.readLine());\n\n }\n return tok.nextToken();\n }\n\n int readInt() throws IOException {\n return Integer.parseInt(readString());\n }\n\n long readLong() throws IOException {\n return Long.parseLong(readString());\n }\n\n double readDouble() throws IOException {\n return Double.parseDouble(readString());\n }\n\n int[] readIntArray(int size) throws IOException {\n int[] a = new int[size];\n for (int i = 0; i < size; i++) {\n a[i] = readInt();\n }\n return a;\n }\n\n public static void main(String[] args) {\n //new Thread(null, new _Solution(), \"\", 128 * (1L << 20)).start();\n new J().run();\n }\n\n long timeBegin, timeEnd;\n\n void time() {\n timeEnd = System.currentTimeMillis();\n System.err.println(\"Time = \" + (timeEnd - timeBegin));\n }\n\n @Override\n public void run() {\n try {\n timeBegin = System.currentTimeMillis();\n init();\n solve();\n out.close();\n time();\n } catch (Exception e) {\n e.printStackTrace();\n System.exit(-1);\n }\n }\n\n int[][][][] dp;\n char[] s;\n int INF = 10000000;\n\n int count(char[] s, char target, int v, int k, int x) {\n int answer = 0;\n for (char c : s) {\n if (c == 'V') {\n v--;\n if (v == 0 && target == 'V') return answer;\n if (v < 0) answer++;\n }\n if (c == 'K') {\n k--;\n if (k == 0 && target == 'K') return answer;\n if (k < 0) answer++;\n }\n if (c == 'X') {\n x--;\n if (x == 0 && target == 'X') return answer;\n if (x < 0) answer++;\n }\n }\n throw new RuntimeException();\n }\n\n private void solve() throws IOException {\n int n = readInt();\n s = readString().toCharArray();\n int vcnt = 0, kcnt = 0, xcnt = 0;\n for (int i = 0; i < s.length; i++) {\n if (s[i] == 'V') {\n vcnt++;\n continue;\n }\n if (s[i] == 'K') {\n kcnt++;\n continue;\n }\n xcnt++;\n s[i] = 'X';\n }\n dp = new int[vcnt + 1][kcnt + 1][xcnt + 1][3];\n for (int[][][] x : dp) {\n for (int[][] xx : x) {\n for (int[] xxx : xx) {\n Arrays.fill(xxx, INF);\n }\n }\n }\n dp[0][0][0][0] = dp[0][0][0][1] = dp[0][0][0][2] = 0;\n //V,K,X\n for (int v = 0; v <= vcnt; v++) {\n for (int k = 0; k <= kcnt; k++) {\n for (int x = 0; x <= xcnt; x++) {\n int rv = v + 1 <= vcnt ? count(s, 'V', v + 1, k, x) : 0;\n int rk = k + 1 <= kcnt ? count(s, 'K', v, k + 1, x) : 0;\n int rx = x + 1 <= xcnt ? count(s, 'X', v, k, x + 1) : 0;\n\n for (int now = 0; now < 3; now++) {\n if (v + 1 <= vcnt) dp[v + 1][k][x][0] = Math.min(dp[v + 1][k][x][0], dp[v][k][x][now] + rv);\n if (now != 0 && k + 1 <= kcnt) dp[v][k + 1][x][1] = Math.min(dp[v][k + 1][x][1], dp[v][k][x][now] + rk);\n if (x + 1 <= xcnt) dp[v][k][x + 1][2] = Math.min(dp[v][k][x + 1][2], dp[v][k][x][now] + rx);\n }\n }\n }\n }\n int res = INF;\n for (int i = 0; i < 3; i++) {\n res = Math.min(res, dp[vcnt][kcnt][xcnt][i]);\n }\n out.println(res);\n\n\n }\n\n}", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "680251a656bd8bef237e14a696a59437", "src_uid": "08444f9ab1718270b5ade46852b155d7", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author niquefa_diego\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.nextInt();\n char[] s = in.next().toCharArray();\n int c[] = new int[3];\n int pos[][] = new int[3][n];\n for (int i = 0; i < n; ++i) {\n int x = s[i] == 'K' ? 0 : (s[i] == 'V' ? 1 : 2);\n pos[x][c[x]++] = i;\n }\n\n int dp[][][][] = new int[2][c[0] + 1][c[1] + 1][c[2] + 1];\n for (int[][][] x : dp) for (int[][] y : x) for (int[] z : y) Arrays.fill(z, Integer.MAX_VALUE / 2);\n dp[0][0][0][0] = 0;\n for (int i0 = 0; i0 <= c[0]; ++i0)\n for (int i1 = 0; i1 <= c[1]; ++i1)\n for (int i2 = 0; i2 <= c[2]; ++i2)\n for (int isLast1 = 0; isLast1 < 2; ++isLast1) {\n\n int cur = dp[isLast1][i0][i1][i2];\n if (i0 < c[0] && isLast1 == 0) {\n int swaps = 0, pos0 = pos[0][i0];\n for (int i = i1; i < c[1] && pos[1][i] < pos0; ++i) swaps++;\n for (int i = i2; i < c[2] && pos[2][i] < pos0; ++i) swaps++;\n dp[0][i0 + 1][i1][i2] = Math.min(dp[0][i0 + 1][i1][i2], cur + swaps);\n }\n\n if (i1 < c[1]) {\n int swaps = 0, pos1 = pos[1][i1];\n for (int i = i0; i < c[0] && pos[0][i] < pos1; ++i) swaps++;\n for (int i = i2; i < c[2] && pos[2][i] < pos1; ++i) swaps++;\n dp[1][i0][i1 + 1][i2] = Math.min(dp[1][i0][i1 + 1][i2], cur + swaps);\n }\n\n if (i2 < c[2]) {\n int swaps = 0, pos2 = pos[2][i2];\n for (int i = i0; i < c[0] && pos[0][i] < pos2; ++i) swaps++;\n for (int i = i1; i < c[1] && pos[1][i] < pos2; ++i) swaps++;\n dp[0][i0][i1][i2 + 1] = Math.min(dp[0][i0][i1][i2 + 1], cur + swaps);\n }\n\n\n }\n\n out.println(Math.min(dp[0][c[0]][c[1]][c[2]], dp[1][c[0]][c[1]][c[2]]));\n }\n\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer = null;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "af455f6d3f135b744682d9335c8ff49c", "src_uid": "08444f9ab1718270b5ade46852b155d7", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedWriter;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStreamWriter;\nimport java.math.BigDecimal;\n\n\nimport java.util.ArrayDeque;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.HashMap;\nimport java.util.Map.Entry;\nimport java.util.PriorityQueue;\nimport java.util.TreeSet;\n\n\n\npublic final class CF_114_E{\n\tstatic boolean verb=true;\n\tstatic void log(Object X){if (verb) System.err.println(X);}\n\tstatic void log(Object[] X){if (verb) {for (Object U:X) System.err.print(U+\" \");System.err.println(\"\");}}\n\tstatic void log(int[] X){if (verb) {for (int U:X) System.err.print(U+\" \");System.err.println(\"\");}}\n\tstatic void logWln(Object X){if (verb) System.err.print(X);}\n\tstatic void info(Object o){\tSystem.out.println(o);}\n\tstatic void output(Object o){outputWln(\"\"+o+\"\\n\");\t}\n\tstatic void outputWln(Object o){try {out.write(\"\"+ o);} catch (Exception e) {}}\n\n\n\tstatic int MX=Integer.MAX_VALUE;\n\n\n\tstatic boolean solve(long a,long b){\n\t\t//log(\"a:\"+a+\" b:\"+b);\n\t\t\n\t\tif (a==0 || b==0)\n\t\t\treturn false;\n\t\tif (a==b)\n\t\t\treturn true;\n\t\tif (a>b){\n\t\t\tlong c=a;\n\t\t\ta=b;\n\t\t\tb=c;\n\t\t}\n\t\tif (b%a==0)\n\t\t\treturn true;\n\t\t\n\t\tboolean op=solve(a,b%a);\n\t\tif (!op)\n\t\t\treturn true;\n\t\t\n\t\tlong ob=b;\n\t\tif (a+1<b/a)\n\t\t\tob=b%(a*(a+1));\n\t\tif (ob!=b) {\n\t\t\t//log(\"case 1\");\n\t\t\tif (ob>0)\n\t\t\treturn solve(a,ob);\n\t\t\tob=a*(a+1);\n\t\t\treturn solve(a,ob);\n\t\t}\n\t\t//log(\"case 2\");\n\t\tif (b/a<a){\n\t\t\t// we can only do a succession of sub\n\t\t\t// obviousy b%a is a losing position for us..\n\t\t\t// how long before we go there ??\n\t\t\tlong div=b/a;\n\t\t\tif (div%2==1)\n\t\t\t\treturn false;\n\t\t\treturn true;\n\t\t\t\n\t\t}\n\t\t//log(\"case 3\");\n\t\tlong aa=1;\n\t\tloop:while (aa<=b/a){\n\t\t\taa*=a;\n\t\t\t//log(\"aa:\"+aa);\n\t\t\tif (!solve(b-aa,a))\n\t\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t\t\n\t}\n\n\n\tstatic void check(){\n\t\tlog(\"checking\");\n\t\tfor (int x=1;x<100;x++)\n\t\t\tfor (int y=3;y<x;y++){\n\t\t\t\tboolean b=solve(x,y);\n\t\t\t\tint xx=x%(y*(y+1));\n\t\t\t\tif (xx!=0){\n\t\t\t\tboolean c=solve(x%(y*(y+1)),y);\n\t\t\t\tif (b!=c){\n\t\t\t\t\tlog(\"Error \"+x+\" \"+y);\n\t\t\t\t\tlog(b);\n\t\t\t\t\tlog(c);\n\t\t\t\t\tlog(x+\" \"+y);\n\t\t\t\t\tlog(x%(y*(y+1))+\" \"+y);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\tlog(\"done\");\n\t}\n\t\n\tstatic void test(){\n\t\tint y=10;\n\t\tfor (int x=1;x<200;x++) {\n\t\t\tboolean b=solve(x,y);\n\t\t\tif (!b)\n\t\t\t\tlog(x+\" \"+y);\n\t\t\n\t\t}\n\t\t//for (int x=1;x<20;x++)\n\t\t//\tfor (int y=1;y<x;y++)\n\t\t//\t\tlog(x+\" \"+y+\" >> \"+solve(x,y));\n\t}\n\n\n\n\n\n\t// Global vars\n\tstatic BufferedWriter out;\n\tstatic InputReader reader;\n\n\tstatic int MAX=201;\n\n\tstatic void process() throws Exception {\n\n\n\t\t//check();\n\t\t//test();\n\n\t\tout = new BufferedWriter(new OutputStreamWriter(System.out));\n\t\treader=new InputReader(System.in);\n\n\t\tint T=reader.readInt();\n\t\tfor (int t=0;t<T;t++){\n\t\tlong a=reader.readLong();\n\t\tlong b=reader.readLong();\n\t\tlog(a+\" \"+b);\n\t\tboolean w=solve(a,b);\n\t\tString res=\"Second\";\n\t\tif (w)\n\t\t\tres=\"First\";\n\t\toutput(res);\n\t\t}\n\t\t\n\t\ttry {\n\t\t\tout.close();\n\t\t}\n\t\tcatch (Exception e){}\n\n\n\t}\n\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tprocess();\n\n\t}\n\n\tstatic final class InputReader {\n\t\tprivate final InputStream stream;\n\t\tprivate final byte[] buf = new byte[1024];\n\t\tprivate int curChar;\n\t\tprivate int numChars;\n\n\t\tpublic InputReader(InputStream stream) {\n\t\t\tthis.stream = stream;\n\t\t}\n\n\t\tprivate int read() throws IOException {\n\t\t\tif (curChar >= numChars) {\n\t\t\t\tcurChar = 0;\n\t\t\t\tnumChars = stream.read(buf);\n\t\t\t\tif (numChars <= 0) {\n\t\t\t\t\treturn -1;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn buf[curChar++];\n\t\t}\n\n\n\t\tpublic final String readString() throws IOException {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c)) {\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tStringBuilder res=new StringBuilder();\n\t\t\tdo {\n\t\t\t\tres.append((char)c);\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tpublic final int readInt() throws IOException {\n\t\t\tint c = read();\n\t\t\tboolean neg=false;\n\t\t\twhile (isSpaceChar(c)) {\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tchar d=(char)c;\n\t\t\t//log(\"d:\"+d);\n\t\t\tif (d=='-') {\n\t\t\t\tneg=true;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo {\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\t//log(\"res:\"+res);\n\t\t\tif (neg)\n\t\t\t\treturn -res;\n\t\t\treturn res;\n\n\t\t}\n\n\t\tpublic final long readLong() throws IOException {\n\t\t\tint c = read();\n\t\t\tboolean neg=false;\n\t\t\twhile (isSpaceChar(c)) {\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tchar d=(char)c;\n\t\t\t//log(\"d:\"+d);\n\t\t\tif (d=='-') {\n\t\t\t\tneg=true;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo {\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\t//log(\"res:\"+res);\n\t\t\tif (neg)\n\t\t\t\treturn -res;\n\t\t\treturn res;\n\n\t\t}\n\n\n\n\t\tprivate boolean isSpaceChar(int c) {\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n\t}\n\n\n}", "lang_cluster": "Java", "tags": ["math", "games"], "code_uid": "65821e0f85cabfc9069ad0f73f659f8a", "src_uid": "5f5b320c7f314bd06c0d2a9eb311de6c", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.lang.reflect.Array;\nimport java.math.BigInteger;\nimport java.util.*;\n\npublic class popo {\n\n public static boolean prime[];\n public static ArrayList[] ad=new ArrayList[2555];\n public static ArrayList<Long> xor1,xor2;\n static int []min;\n static char [][]grid;\n static int []dx = {0,0,-1,1};\n static int []dy = {-1,1,0,0};\n static int []dx8 = {1,1,1,0,-1,-1,-1,0};\n static int []dy8 = {1,0,-1,-1,-1,0,1,1};\n static ArrayList<Point> aa;\n\n public static void main(String[] args) {\n InputReader in = new InputReader(System.in);\n PrintWriter out = new PrintWriter(System.out);\n\n int t = in.nextInt();\n while (t-->0)\n {\n long a = in.nextLong();\n long b = in.nextLong();\n boolean k =winner(a,b);\n if(k)\n out.println(\"First\");\n else\n out.println(\"Second\");\n\n }\n\n out.close();\n }\n static boolean winner(long a ,long b)\n {\n if(a==0 || b==0)\n return false;\n if(a>b)\n {\n long t = a;\n a = b;\n b = t;\n }\n if(!winner(a,b%a))return true;\n // System.out.print(a+\" \"+b);\n long bacha = b/a;\n long karunga = a+1;\n // System.out.print(bacha+\" \"+karunga);\n return ((bacha%karunga)%2 == 0);\n }\n\n public static long modPow(long base, long exp, long mod) {\n base = base % mod;\n long result = 1;\n while(exp > 0)\n {\n if(exp % 2== 1)\n {\n result = (result * base) % mod;\n exp --;\n }\n else\n {\n base = (base * base) % mod;\n exp = exp >> 1;\n }\n\n }\n return result;\n }\n\n public static long mod = 1000000007, inf = 100000000000000000l;\n public static long fac[],inv[];\n public static void cal()\n {\n fac = new long[100001];\n inv = new long[100001];\n fac[0]=1;\n inv[0]=1;\n for(int i=1; i<=100000; i++)\n {\n fac[i]=(fac[i-1]*i)%mod;\n // inv[i]=(inv[i-1]*modPow(i,mod-2,mod))%mod;\n\n }\n }\n public static long combination(long n, long r)\n {\n long k = (fac[(int) n]%mod*inv[(int) r]%mod)%mod;\n long p = inv[(int) (n-r)]%mod;\n long m = (k*p)%mod;\n return m;\n }\n\n\n public static class Point implements Comparable<Point> {\n\n long x, y;\n\n public Point(long start, long end) {\n this.x = start;\n this.y = end;\n }\n\n @Override\n public int hashCode() {\n int hash = 5;\n hash = (int) (47 * hash + this.x);\n hash = (int) (47 * hash + this.y);\n return hash;\n }\n\n @Override\n public boolean equals(Object obj) {\n if (obj == null) {\n return false;\n }\n if (getClass() != obj.getClass()) {\n return false;\n }\n final Point other = (Point) obj;\n if (this.x != other.x) {\n return false;\n }\n if (this.y != other.y) {\n return false;\n }\n return true;\n }\n\n @Override\n public int compareTo(Point o) {\n return Long.compare(x, o.x);\n }\n }\n static long setbits(long i)\n {\n long count = 0;\n while (i>0)\n {\n count += i & 1;\n i >>= 1;\n }\n return count;\n\n }\n\n static ArrayList<Long> sieveOfEratosthenes(int n)\n {\n // Create a boolean array \"prime[0..n]\" and initialize\n // all entries it as true. A value in prime[i] will\n // finally be false if i is Not a prime, else true.\n\n\n prime=new boolean[1000001];\n for(int i=0;i<n;i++)\n prime[i] = true;\n\n for(long p = 2; p*p <=n; p++)\n {\n // If prime[p] is not changed, then it is a prime\n if(prime[(int)p] == true)\n {\n // Update all multiples of p\n for(long i = p*2; i <= n; i += p) {\n prime[(int) i] = false;\n }\n }\n }\n ArrayList<Long> aa=new ArrayList<>();\n for (long i=0;i<n;i++)\n {\n if(prime[(int)i])\n aa.add(i);\n }\n return aa;\n\n // Print all prime numbers\n /* for(int i = 2; i <= n; i++)\n {\n if(prime[i] == true)\n System.out.print(i + \" \");\n }\n */\n }\n\n static class InputReader {\n\n private InputStream stream;\n private byte[] buf = new byte[8192];\n private int curChar, snumChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int snext() {\n if (snumChars == -1)\n throw new InputMismatchException();\n if (curChar >= snumChars) {\n curChar = 0;\n try {\n snumChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (snumChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n int c = snext();\n while (isSpaceChar(c))\n c = snext();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = snext();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = snext();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public long nextLong() {\n int c = snext();\n while (isSpaceChar(c))\n c = snext();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = snext();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = snext();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public int[] nextIntArray(int n) {\n int a[] = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = nextInt();\n return a;\n }\n\n public String readString() {\n int c = snext();\n while (isSpaceChar(c))\n c = snext();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = snext();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n }\n}", "lang_cluster": "Java", "tags": ["math", "games"], "code_uid": "b18042d4e9f0e100a544fcf87510e0b7", "src_uid": "5f5b320c7f314bd06c0d2a9eb311de6c", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.*;\nimport java.io.*;\nimport java.awt.Point;\nimport static java.lang.Math.*;\n\npublic class P168E {\n public static void main(String[] args) throws Exception {\n Scanner in = new Scanner(System.in);\n int T = in.nextInt();\n for(int i=0; i<T; i++) {\n long A = in.nextLong();\n long B = in.nextLong();\n System.out.println(f(A,B) ? \"First\" : \"Second\");\n }\n }\n public static boolean f(long A, long B) {\n if(A > B) return f(B,A);\n if(A == 0) return false;\n if(A == 1) return true;\n\n if( (B/A % (A+1)) % 2 == 0) return true;\n if(!f(B%A,A)) return true;\n return false;\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "games"], "code_uid": "c1ae46c2f6bfe6a27740db3a9ad3cea4", "src_uid": "5f5b320c7f314bd06c0d2a9eb311de6c", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class D {\n\n\tstatic final int P = 1_000_000_007;\n\n\tstatic final int N = 52;\n\t\n\tvoid submit() {\n\t\tint n = nextInt();\n\t\tint m = nextInt();\n\n\t\tint[][] f = new int[N + 1][N + 1];\n\n\t\tf[0][1] = 1;\n\n\t\tfor (int sz = 1; sz <= n; sz++) {\n\n\t\t\tint[][] dp = new int[sz + 1][N + 1];\n\t\t\tdp[0][1] = 1;\n\n\t\t\tint[][] cnt = new int[sz + 1][N + 1]; // [size][cut]\n\n\t\t\tfor (int szL = 0; szL + 1 <= sz; szL++) {\n\t\t\t\tfor (int cutL = 1; cutL <= N; cutL++) {\n\t\t\t\t\tfor (int szR = 0; szL + szR + 1 <= sz; szR++) {\n\t\t\t\t\t\tfor (int cutR = 1; cutR <= N; cutR++) {\n\n\t\t\t\t\t\t\tint szLR = szL + szR + 1;\n\t\t\t\t\t\t\tint cutLR = Math.min(cutL, cutR);\n\n\t\t\t\t\t\t\tcnt[szLR][cutLR] += (int) ((long) f[szL][cutL]\n\t\t\t\t\t\t\t\t\t* f[szR][cutR] % P);\n\t\t\t\t\t\t\tif (cnt[szLR][cutLR] >= P) {\n\t\t\t\t\t\t\t\tcnt[szLR][cutLR] -= P;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\n\t\t\tfor (int addSz = 1; addSz <= sz; addSz++) {\n\t\t\t\tfor (int addCut = 1; addCut <= N; addCut++) {\n\t\t\t\t\t\n\t\t\t\t\tif (cnt[addSz][addCut] == 0) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tint[][] nextDp = new int[sz + 1][];\n\t\t\t\t\tfor (int i = 0; i <= sz; i++) {\n\t\t\t\t\t\tnextDp[i] = dp[i].clone();\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tint smth = sz / addSz;\n\t\t\t\t\t\n\t\t\t\t\tint[] arrWays = new int[smth + 1];\n\t\t\t\t\tint base = cnt[addSz][addCut];\n\t\t\t\t\t\n\t\t\t\t\tarrWays[0] = 1;\n\t\t\t\t\t\n\t\t\t\t\tfor (int i = 1; i <= smth; i++) {\n\t\t\t\t\t\tarrWays[i] = (int)((long)arrWays[i - 1] * inv[i] % P * base % P);\n\t\t\t\t\t\tbase++;\n\t\t\t\t\t\tif (base == P) {\n\t\t\t\t\t\t\tbase = 0;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tfor (int cntAdd = 1; cntAdd <= smth; cntAdd++) {\n\n\t\t\t\t\t\tint ways = arrWays[cntAdd];\n\n\t\t\t\t\t\tfor (int i = sz - addSz * cntAdd; i >= 0; i--) {\n\t\t\t\t\t\t\tfor (int j = N - addCut * cntAdd; j >= 1; j--) {\n\n\t\t\t\t\t\t\t\tif (i + addSz * cntAdd <= sz\n\t\t\t\t\t\t\t\t\t\t&& j + addCut * cntAdd <= N) {\n\n\t\t\t\t\t\t\t\t\tnextDp[i + addSz * cntAdd][j + addCut * cntAdd] += (int) ((long) dp[i][j]\n\t\t\t\t\t\t\t\t\t\t\t* ways % P);\n\t\t\t\t\t\t\t\t\tif (nextDp[i + addSz * cntAdd][j + addCut\n\t\t\t\t\t\t\t\t\t\t\t* cntAdd] >= P) {\n\t\t\t\t\t\t\t\t\t\tnextDp[i + addSz * cntAdd][j + addCut\n\t\t\t\t\t\t\t\t\t\t\t\t* cntAdd] -= P;\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tdp = nextDp;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor (int j = 1; j <= N; j++) {\n\t\t\t\tf[sz][j] = dp[sz][j];\n\t\t\t}\n\n\t\t}\n\n//\t\tfor (int i = 0; i <= n; i++) {\n//\t\t\tfor (int j = 1; j <= N; j++) {\n//\t\t\t\tif (f[i][j] != 0) {\n//\t\t\t\t\tSystem.err.println(i + \" \" + j + \" -> \" + f[i][j]);\n//\t\t\t\t}\n//\t\t\t}\n//\t\t\t\n//\t\t\tSystem.err.println();\n//\t\t}\n\t\t\n\t\tout.println(f[n][m]);\n\n\t}\n\n\tint[] inv = new int[1000];\n\t{\n\t\tinv[0] = 0;\n\t\tinv[1] = 1;\n\t\tfor (int i = 2; i < inv.length; i++) {\n\t\t\tinv[i] = P - (int) ((long) (P / i) * inv[P % i] % P);\n\t\t}\n\t}\n\t\n\tvoid preCalc() {\n\n\t}\n\n\tvoid stress() {\n\n\t}\n\n\tvoid test() {\n\n\t}\n\n\tD() throws IOException {\n\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\tpreCalc();\n\t\tsubmit();\n\t\t// stress();\n\t\t// test();\n\t\tout.close();\n\t}\n\n\tstatic final Random rng = new Random();\n\n\tstatic int rand(int l, int r) {\n\t\treturn l + rng.nextInt(r - l + 1);\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew D();\n\t}\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\n\tString nextToken() {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tString nextString() {\n\t\ttry {\n\t\t\treturn br.readLine();\n\t\t} catch (IOException e) {\n\t\t\tthrow new RuntimeException(e);\n\t\t}\n\t}\n\n\tint nextInt() {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n}\n", "lang_cluster": "Java", "tags": ["flows", "dp", "combinatorics", "graphs"], "code_uid": "ec339ee43bede7ca663095187fc68fd9", "src_uid": "aca6148effff8b893c961b1ee465e4e4", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package round431;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class D2 {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t\tint mod = 1000000007;\n\t\tint n = ni(), m = ni();\n\t\t\n\t\tif(m > n+1){\n\t\t\tout.println(0);\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tlong[][] dp = {\n\t\t\t\t{0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 6, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 20, 15, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 78, 60, 18, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 320, 269, 90, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 1404, 1196, 452, 102, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 6354, 5550, 2232, 566, 105, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 29660, 26148, 11129, 3004, 608, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 141356, 125797, 55564, 15992, 3401, 621, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 685720, 613696, 279559, 84232, 18975, 3551, 624, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 3372972, 3033312, 1414754, 443388, 104533, 20372, 3596, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 16787362, 15150580, 7205309, 2330591, 572601, 115463, 20879, 3609, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 84374296, 76373402, 36905066, 12260498, 3118939, 651005, 120188, 21042, 3612, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 427657604, 388029184, 190039924, 64569370, 16932666, 3645556, 689414, 121903, 21088, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 183422138, 985084652, 983358608, 340626132, 91705041, 20316053, 3932165, 705215, 122449, 21101, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 218595807, 216827574, 111123886, 800216575, 495958406, 112739002, 22325180, 4062841, 710843, 122615, 21104, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 965416379, 866331606, 673968136, 532890011, 680029370, 623595485, 126193365, 23327903, 4114503, 712681, 122661, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 993455088, 862080862, 725923843, 580538538, 477345228, 440384026, 710624473, 133452405, 23761056, 4132780, 713240, 122674, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 905119307, 192776929, 427183902, 902740653, 205572806, 943087579, 988485039, 760890378, 136845231, 23927353, 4138765, 713407, 122677, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 983258926, 856652574, 419294183, 314218472, 565633404, 144225184, 323294025, 324568580, 786075109, 138248537, 23985741, 4140643, 713453, 122678, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 768913899, 874476794, 159058735, 376378817, 200939010, 909767346, 644939341, 508636359, 503698048, 797229154, 138775923, 24005038, 4141205, 713466, 122678, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 823642493, 705094318, 65810807, 545788941, 142710068, 49894552, 580875908, 538421095, 739525857, 588102612, 801695573, 138960083, 24011149, 4141372, 713469, 122678, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 499072817, 566780682, 543283862, 201724451, 58271802, 344858002, 63874460, 300408434, 761612286, 353031679, 623964235, 803344922, 139021264, 24013040, 4141418, 713470, 122678, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 576529878, 241212759, 870406317, 516608637, 786808826, 170564828, 502043776, 190085463, 974194583, 74582715, 628375911, 637942018, 803919124, 139040931, 24013603, 4141431, 713470, 122678, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 282664742, 137969620, 386494112, 872056910, 282992318, 176896609, 111724215, 824867747, 799878112, 461513992, 110630666, 741379513, 643041881, 804110861, 139047082, 24013770, 4141434, 713470, 122678, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 608570317, 801652211, 274963061, 886518820, 90837790, 626361724, 699033037, 540982188, 987824503, 727135089, 45389606, 987874590, 784549175, 644812246, 804173102, 139048976, 24013816, 4141435, 713470, 122678, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 357486479, 181089468, 969172260, 289931681, 772500290, 740282998, 829587032, 842625948, 138113736, 232645342, 395674948, 621904062, 338297429, 800139849, 645406477, 804192896, 139049539, 24013829, 4141435, 713470, 122678, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 254234510, 292608126, 417414987, 111595904, 430339254, 77443136, 291720282, 257053540, 606934755, 335685102, 729928927, 235560375, 363847245, 469945923, 805548789, 645601127, 804199060, 139049706, 24013832, 4141435, 713470, 122678, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 595455172, 310857698, 142929150, 451089427, 328175846, 775787438, 501396673, 447925018, 130822422, 58418115, 769951318, 773701088, 10940059, 434786651, 517174485, 807371391, 645663741, 804200955, 139049752, 24013833, 4141435, 713470, 122678, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 349426455, 464387898, 431999991, 893280928, 77931049, 52569295, 64921457, 666455225, 189432628, 773839352, 165726163, 690284554, 801367433, 438034612, 832160214, 533545110, 807973529, 645683575, 804201518, 139049765, 24013833, 4141435, 713470, 122678, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 702575145, 801280561, 442448096, 451076534, 362114194, 647176951, 12722649, 733600088, 928868484, 314273055, 676922181, 390832804, 195357510, 179246035, 671930508, 973917989, 539088258, 808169252, 645689742, 804201685, 139049768, 24013833, 4141435, 713470, 122678, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 899116600, 365887165, 540851416, 477622706, 621209745, 41855534, 381872526, 568727969, 382270909, 755519068, 830377562, 327016443, 53743758, 200196957, 718037620, 859696293, 23095734, 540931780, 808231993, 645691637, 804201731, 139049769, 24013833, 4141435, 713470, 122678, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 28443452, 454707299, 720701160, 419189620, 636769312, 212745640, 720255594, 47264013, 4353233, 571423322, 317657958, 770671406, 566775337, 229432738, 486965531, 377266778, 282006828, 39807033, 541536871, 808251840, 645692200, 804201744, 139049769, 24013833, 4141435, 713470, 122678, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 708370999, 745748618, 582217318, 455319063, 603859790, 231341973, 348942460, 170184178, 689724591, 110508688, 857619861, 426992165, 588329004, 979260570, 343202258, 927818650, 898766596, 428587224, 45404704, 541732968, 808258008, 645692367, 804201747, 139049769, 24013833, 4141435, 713470, 122678, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 220300732, 46609850, 375712662, 568586423, 941804380, 601855282, 597025225, 210361053, 58336959, 790143347, 618095230, 176358732, 30543080, 993842771, 937341158, 423396479, 514187911, 147490617, 478619188, 47256254, 541795749, 808259903, 645692413, 804201748, 139049769, 24013833, 4141435, 713470, 122678, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 491767445, 782125933, 760844150, 771643255, 631272756, 200568934, 776727389, 125809805, 89178072, 942931662, 158053887, 262399651, 379208459, 503988395, 438193938, 774920020, 818726507, 874419280, 581626996, 495470440, 47862421, 541815599, 808260466, 645692426, 804201748, 139049769, 24013833, 4141435, 713470, 122678, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 751552393, 507106191, 927020229, 340983299, 824935876, 982944264, 112403021, 736470034, 712046769, 464383985, 718862672, 472451638, 74303981, 410907563, 666832122, 904514562, 425593301, 712078493, 543662654, 730328807, 501089364, 48058645, 541821767, 808260633, 645692429, 804201748, 139049769, 24013833, 4141435, 713470, 122678, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 73145977, 945393539, 491610692, 289456339, 427592987, 156456089, 856721546, 643411286, 438709919, 830334785, 521084183, 802961067, 577757709, 979743576, 751951426, 169028881, 473063432, 677653095, 991492477, 821146133, 780715488, 502943880, 48121439, 541823662, 808260679, 645692430, 804201748, 139049769, 24013833, 4141435, 713470, 122678, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 437082018, 559756622, 712764202, 175256028, 39001965, 169118126, 961041841, 330531579, 726355685, 652058564, 184476311, 959023349, 36529059, 566693578, 286624497, 631545034, 213553699, 420454245, 108890823, 707021032, 260499053, 797622167, 503550421, 48141290, 541824225, 808260692, 645692430, 804201748, 139049769, 24013833, 4141435, 713470, 122678, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 911273698, 461802381, 157547978, 651886959, 991079947, 904206440, 752012728, 91490856, 970456086, 827908805, 200404310, 46817164, 95037060, 872320139, 544155656, 866678032, 265740321, 62232640, 640825471, 56958810, 445660277, 410088790, 803249159, 503746685, 48147458, 541824392, 808260695, 645692430, 804201748, 139049769, 24013833, 4141435, 713470, 122678, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 99547327, 792772093, 413279596, 39759631, 598831434, 274143461, 681931397, 242545472, 634618776, 733602547, 401821126, 689076310, 138792047, 867529343, 871445219, 80442445, 172358416, 884450832, 787463230, 130635330, 184459417, 735860525, 460617750, 805104752, 503809482, 48149353, 541824438, 808260696, 645692430, 804201748, 139049769, 24013833, 4141435, 713470, 122678, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 482186350, 273967294, 649045886, 108980254, 570311699, 966889002, 666859727, 546817455, 689881573, 84630300, 893298736, 354835358, 214615309, 168750989, 158197112, 45797168, 168957735, 782446817, 163825770, 628696027, 196779450, 66205132, 177414259, 477545803, 805711420, 503829333, 48149916, 541824451, 808260696, 645692430, 804201748, 139049769, 24013833, 4141435, 713470, 122678, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 725343523, 72904069, 317229993, 651086888, 760199404, 971917773, 359172971, 877096152, 866895001, 443077851, 620349470, 706453237, 575090255, 745511976, 849766738, 965850920, 588577451, 178627725, 235164813, 372125002, 603898412, 155168897, 835596754, 327364579, 483175764, 805907697, 503835501, 48150083, 541824454, 808260696, 645692430, 804201748, 139049769, 24013833, 4141435, 713470, 122678, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 227169509, 545240090, 21373631, 4703558, 149454127, 906947250, 436226575, 231453773, 520829752, 657885509, 940170245, 816566317, 211196753, 118819980, 726741982, 596789649, 939963244, 486112971, 653096931, 608998341, 286609915, 821835078, 678102815, 131197840, 377949300, 485031731, 805970495, 503837396, 48150129, 541824455, 808260696, 645692430, 804201748, 139049769, 24013833, 4141435, 713470, 122678, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 812941513, 632016277, 587752971, 907369437, 245365463, 237152744, 770806419, 254057260, 256931484, 657088179, 685991399, 165335468, 793178596, 943503554, 488208964, 862646224, 801219250, 113427800, 680954452, 973579312, 138931569, 370928377, 622393891, 633659803, 573653877, 394885434, 485638439, 805990346, 503837959, 48150142, 541824455, 808260696, 645692430, 804201748, 139049769, 24013833, 4141435, 713470, 122678, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0, 0},\n\t\t\t\t{0, 0, 831284912, 920930216, 121837637, 363197429, 615372675, 818973396, 465784421, 249654262, 962863505, 443733107, 862431829, 259718701, 674328903, 72003370, 27941538, 457774123, 769643354, 316096474, 198211169, 732391072, 973293491, 813065869, 598354179, 515441584, 416189909, 723747383, 400516472, 485834719, 805996514, 503838126, 48150145, 541824455, 808260696, 645692430, 804201748, 139049769, 24013833, 4141435, 713470, 122678, 21105, 3613, 625, 106, 19, 3, 1, 0, 0, 0},\n\t\t\t\t{0, 0, 833292674, 298848298, 168903770, 545074331, 52799215, 758871225, 252495511, 924121755, 374266136, 669478514, 60769576, 806058403, 907911655, 394903137, 121208854, 373718471, 645725760, 64527479, 804531912, 436447112, 588689529, 502994369, 593283887, 897804374, 214286791, 714026394, 774353518, 402372566, 485897517, 805998409, 503838172, 48150146, 541824455, 808260696, 645692430, 804201748, 139049769, 24013833, 4141435, 713470, 122678, 21105, 3613, 625, 106, 19, 3, 1, 0, 0},\n\t\t\t\t{0, 0, 987390633, 352790884, 614135688, 73248057, 535068088, 778378333, 304699153, 787437186, 778598899, 436272891, 717326240, 327325089, 183229809, 956509573, 178816507, 780681714, 939063227, 78846995, 42468967, 482999731, 874463719, 105692341, 586003573, 658414122, 894144031, 201549678, 156845346, 791292622, 402979287, 485917368, 805998972, 503838185, 48150146, 541824455, 808260696, 645692430, 804201748, 139049769, 24013833, 4141435, 713470, 122678, 21105, 3613, 625, 106, 19, 3, 1, 0},\n\t\t\t\t{0, 0, 637245807, 499830334, 750632612, 151627894, 974119694, 567468624, 244879604, 269170082, 396392266, 280843475, 343181990, 746080370, 730888752, 810540922, 910735707, 103336517, 104943638, 266354616, 664188130, 338775312, 887579699, 740792318, 467888722, 667892662, 673680617, 203733589, 989562192, 306994734, 796924034, 403175568, 485923536, 805999139, 503838188, 48150146, 541824455, 808260696, 645692430, 804201748, 139049769, 24013833, 4141435, 713470, 122678, 21105, 3613, 625, 106, 19, 3, 1}\n\t\t};\n\t\tout.println(dp[n][m]);\n\t}\n\t\n\tlong C(long n, long r, int mod)\n\t{\n\t\tif(r < 0 || n < 0 || r > n)return 0;\n\t\tlong num = 1, den = 1;\n\t\tfor(int i = 0;i < r;i++){\n\t\t\tnum = num * (n-i) % mod;\n\t\t\tden = den * (i+1) % mod;\n\t\t}\n\t\treturn num * invl(den, mod) % mod;\n\t}\n\t\n\tpublic static long invl(long a, long mod) {\n\t\tlong b = mod;\n\t\tlong p = 1, q = 0;\n\t\twhile (b > 0) {\n\t\t\tlong c = a / b;\n\t\t\tlong d;\n\t\t\td = a;\n\t\t\ta = b;\n\t\t\tb = d % b;\n\t\t\td = p;\n\t\t\tp = q;\n\t\t\tq = d - c * q;\n\t\t}\n\t\treturn p < 0 ? p + mod : p;\n\t}\n\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new D2().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["flows", "dp", "combinatorics", "graphs"], "code_uid": "8c92cd327d119964eaa025709897a5f7", "src_uid": "aca6148effff8b893c961b1ee465e4e4", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintStream;\nimport java.util.Arrays;\nimport java.io.IOException;\nimport java.io.UncheckedIOException;\nimport java.io.Closeable;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) throws Exception {\n Thread thread = new Thread(null, new TaskAdapter(), \"\", 1 << 27);\n thread.start();\n thread.join();\n }\n\n static class TaskAdapter implements Runnable {\n @Override\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastInput in = new FastInput(inputStream);\n FastOutput out = new FastOutput(outputStream);\n DShakeIt solver = new DShakeIt();\n solver.solve(1, in, out);\n out.close();\n }\n }\n\n static class DShakeIt {\n Modular mod = new Modular(1e9 + 7);\n int[][][][] h;\n int[][] g;\n int n;\n int flow;\n InverseNumber inv = new InverseNumber(100, mod);\n Debug debug = new Debug(false);\n\n public void solve(int testNumber, FastInput in, FastOutput out) {\n n = in.readInt();\n int m = in.readInt();\n flow = Math.max(n + 1, m);\n\n // f = new int[n + 1][flow + 1];\n h = new int[n + 1][flow + 1][n + 1][flow + 1];\n g = new int[n + 1][flow + 1];\n\n //SequenceUtils.deepFill(f, -1);\n SequenceUtils.deepFill(g, -1);\n SequenceUtils.deepFill(h, -1);\n\n //g(2, 0);\n\n int ans = f(n, m - 1);\n //ans = mod.mul(ans, fact.invFact(n));\n\n //debug.debug(\"f\", f);\n debug.debug(\"g\", g);\n debug.debug(\"h\", h);\n out.println(ans);\n }\n\n public int h(int i, int j, int a, int b) {\n if (i < 0 || j < 0) {\n return 0;\n }\n if (h[i][j][a][b] == -1) {\n h[i][j][a][b] = 0;\n if (a == 0 || b == 0) {\n return h[i][j][a][b] = i == 0 && j == 0 ? 1 : 0;\n }\n int limit = Math.min(i / a, j / b);\n int prod = 1;\n int aa = a;\n int bb = b;\n if (bb > 1) {\n bb--;\n } else {\n bb = flow;\n aa--;\n }\n h[i][j][a][b] = h(i, j, aa, bb);\n for (int t = 1; t <= limit; t++) {\n prod = mod.mul(prod, g(a - 1, b - 1) + t - 1);\n prod = mod.mul(prod, inv.inverse(t));\n int local = mod.mul(h(i - a * t, j - b * t, aa, bb),\n prod);\n h[i][j][a][b] = mod.plus(h[i][j][a][b], local);\n }\n\n }\n\n return h[i][j][a][b];\n }\n\n public int f(int i, int j) {\n return h(i, j, i, j);\n }\n\n public int g(int i, int j) {\n if (i < 0 || j < 0) {\n return 0;\n }\n if (g[i][j] == -1) {\n g[i][j] = 0;\n if (i == 0) {\n return g[i][j] = j == 0 ? 1 : 0;\n }\n for (int a = 0; a <= i; a++) {\n int c = i - a;\n for (int b = j; b <= a + 1; b++) {\n for (int d = j; d <= c + 1; d++) {\n if (Math.min(b, d) != j) {\n continue;\n }\n int way = mod.mul(f(a, b), f(c, d));\n\n g[i][j] = mod.plus(g[i][j], way);\n }\n }\n }\n }\n\n return g[i][j];\n }\n\n }\n\n static class InverseNumber {\n int[] inv;\n\n public InverseNumber(int[] inv, int limit, Modular modular) {\n this.inv = inv;\n inv[1] = 1;\n int p = modular.getMod();\n for (int i = 2; i <= limit; i++) {\n int k = p / i;\n int r = p % i;\n inv[i] = modular.mul(-k, inv[r]);\n }\n }\n\n public InverseNumber(int limit, Modular modular) {\n this(new int[limit + 1], limit, modular);\n }\n\n public int inverse(int x) {\n return inv[x];\n }\n\n }\n\n static class FastOutput implements AutoCloseable, Closeable, Appendable {\n private StringBuilder cache = new StringBuilder(1 << 20);\n private final Writer os;\n\n public FastOutput append(CharSequence csq) {\n cache.append(csq);\n return this;\n }\n\n public FastOutput append(CharSequence csq, int start, int end) {\n cache.append(csq, start, end);\n return this;\n }\n\n public FastOutput(Writer os) {\n this.os = os;\n }\n\n public FastOutput(OutputStream os) {\n this(new OutputStreamWriter(os));\n }\n\n public FastOutput append(char c) {\n cache.append(c);\n return this;\n }\n\n public FastOutput append(int c) {\n cache.append(c);\n return this;\n }\n\n public FastOutput println(int c) {\n return append(c).println();\n }\n\n public FastOutput println() {\n cache.append(System.lineSeparator());\n return this;\n }\n\n public FastOutput flush() {\n try {\n os.append(cache);\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n return this;\n }\n\n public void close() {\n flush();\n try {\n os.close();\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n\n public String toString() {\n return cache.toString();\n }\n\n }\n\n static class FastInput {\n private final InputStream is;\n private byte[] buf = new byte[1 << 13];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastInput(InputStream is) {\n this.is = is;\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n bufLen = -1;\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public int readInt() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n }\n\n static class Modular {\n int m;\n\n public int getMod() {\n return m;\n }\n\n public Modular(int m) {\n this.m = m;\n }\n\n public Modular(long m) {\n this.m = (int) m;\n if (this.m != m) {\n throw new IllegalArgumentException();\n }\n }\n\n public Modular(double m) {\n this.m = (int) m;\n if (this.m != m) {\n throw new IllegalArgumentException();\n }\n }\n\n public int valueOf(int x) {\n x %= m;\n if (x < 0) {\n x += m;\n }\n return x;\n }\n\n public int valueOf(long x) {\n x %= m;\n if (x < 0) {\n x += m;\n }\n return (int) x;\n }\n\n public int mul(int x, int y) {\n return valueOf((long) x * y);\n }\n\n public int plus(int x, int y) {\n return valueOf(x + y);\n }\n\n public String toString() {\n return \"mod \" + m;\n }\n\n }\n\n static class Debug {\n private boolean offline;\n private PrintStream out = System.err;\n static int[] empty = new int[0];\n\n public Debug(boolean enable) {\n offline = enable && System.getSecurityManager() == null;\n }\n\n public Debug debug(String name, Object x) {\n return debug(name, x, empty);\n }\n\n public Debug debug(String name, Object x, int... indexes) {\n if (offline) {\n if (x == null || !x.getClass().isArray()) {\n out.append(name);\n for (int i : indexes) {\n out.printf(\"[%d]\", i);\n }\n out.append(\"=\").append(\"\" + x);\n out.println();\n } else {\n indexes = Arrays.copyOf(indexes, indexes.length + 1);\n if (x instanceof byte[]) {\n byte[] arr = (byte[]) x;\n for (int i = 0; i < arr.length; i++) {\n indexes[indexes.length - 1] = i;\n debug(name, arr[i], indexes);\n }\n } else if (x instanceof short[]) {\n short[] arr = (short[]) x;\n for (int i = 0; i < arr.length; i++) {\n indexes[indexes.length - 1] = i;\n debug(name, arr[i], indexes);\n }\n } else if (x instanceof boolean[]) {\n boolean[] arr = (boolean[]) x;\n for (int i = 0; i < arr.length; i++) {\n indexes[indexes.length - 1] = i;\n debug(name, arr[i], indexes);\n }\n } else if (x instanceof char[]) {\n char[] arr = (char[]) x;\n for (int i = 0; i < arr.length; i++) {\n indexes[indexes.length - 1] = i;\n debug(name, arr[i], indexes);\n }\n } else if (x instanceof int[]) {\n int[] arr = (int[]) x;\n for (int i = 0; i < arr.length; i++) {\n indexes[indexes.length - 1] = i;\n debug(name, arr[i], indexes);\n }\n } else if (x instanceof float[]) {\n float[] arr = (float[]) x;\n for (int i = 0; i < arr.length; i++) {\n indexes[indexes.length - 1] = i;\n debug(name, arr[i], indexes);\n }\n } else if (x instanceof double[]) {\n double[] arr = (double[]) x;\n for (int i = 0; i < arr.length; i++) {\n indexes[indexes.length - 1] = i;\n debug(name, arr[i], indexes);\n }\n } else if (x instanceof long[]) {\n long[] arr = (long[]) x;\n for (int i = 0; i < arr.length; i++) {\n indexes[indexes.length - 1] = i;\n debug(name, arr[i], indexes);\n }\n } else {\n Object[] arr = (Object[]) x;\n for (int i = 0; i < arr.length; i++) {\n indexes[indexes.length - 1] = i;\n debug(name, arr[i], indexes);\n }\n }\n }\n }\n return this;\n }\n\n }\n\n static class SequenceUtils {\n public static void deepFill(Object array, int val) {\n if (!array.getClass().isArray()) {\n throw new IllegalArgumentException();\n }\n if (array instanceof int[]) {\n int[] intArray = (int[]) array;\n Arrays.fill(intArray, val);\n } else {\n Object[] objArray = (Object[]) array;\n for (Object obj : objArray) {\n deepFill(obj, val);\n }\n }\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["flows", "dp", "combinatorics", "graphs"], "code_uid": "74d3c97dc15b4d06c5069c3b52bd79fd", "src_uid": "aca6148effff8b893c961b1ee465e4e4", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Scanner;\n\n\npublic class E {\n \n static double e = 1e-8, R, phi0;\n static int x,y,r,v,vp; \n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int xp = sc.nextInt();\n int yp = sc.nextInt();\n vp = sc.nextInt();\n x = sc.nextInt();\n y = sc.nextInt();\n v = sc.nextInt();\n r = sc.nextInt();\n R = Math.sqrt(xp*xp+yp*yp);\n phi0 = Math.acos(xp / R);\n if (yp < 0)\n phi0 = 2*Math.PI-phi0;\n double left = 0, right = 1e9;\n for(;;) {\n double middle = (left+right) / 2;\n if (reache(middle) && !reache(middle-e)) {\n System.out.println(middle);\n return;\n }\n if (reache(middle))\n right = middle-e;\n else\n left = middle+e;\n }\n }\n\n private static boolean reache(double t) {\n double x2 = R*Math.cos(vp/R*t+phi0);\n double y2 = R*Math.sin(vp/R*t+phi0);\n double x1 = x, y1 = y;\n double a = y1-y2, b = x2-x1, c = x1*y2-x2*y1;\n double d = Math.abs(c) / Math.sqrt(a*a+b*b);\n double reach_time = 0;\n a = dis(x1, y1, 0, 0);\n b = dis(x2, y2, 0, 0);\n c = dis(x1, y1, x2, y2);\n if (d >= r || Math.abs(Math.sqrt(a*a-d*d)+Math.sqrt(b*b-d*d)-c) > e) {\n reach_time = c / v;\n }\n else {\n double alfa = Math.acos((x1*x2+y1*y2) / (a*b))-Math.acos(r/a)-Math.acos(r/b);\n reach_time = (r*alfa+Math.sqrt(a*a-r*r)+Math.sqrt(b*b-r*r)) / v;\n }\n return reach_time <= t;\n }\n\n private static double dis(double x1, double y1, double x2, double y2) {\n return Math.sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));\n }\n}\n", "lang_cluster": "Java", "tags": ["geometry", "binary search"], "code_uid": "b04c2fa3e0adab2367b61ffa3e71ed11", "src_uid": "e8471556906e5fa3a701842570fa4ee2", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\npublic class Main {\npublic static void main(String [] args){\n Scanner in=new Scanner(System.in);\t\n long array[]=new long[3];\n for(int i=0;i<=2;i++){\n array[i]=in.nextLong();\t\n }\n Arrays.sort(array);\n if(array[1]%2==array[0]%2){\n \tSystem.out.print(array[1]);\n \treturn;\n }\n System.out.print(array[2]);\n}\n}", "lang_cluster": "Java", "tags": ["math", "constructive algorithms"], "code_uid": "24034f794a5bf8a6aa0319e4e29b347b", "src_uid": "b8008caf788336775cb8ebb76478b04c", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "\nimport java.io.File;\nimport java.io.FileNotFoundException;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\n\npublic class Main {\n \n public static void main(String[] args) {\n new Main().go();\n }\n \n Scanner scan;\n PrintWriter print;\n \n void go() {\n try {\n //scan = new Scanner(new File(\"in.txt\"));\n scan = new Scanner(System.in);\n print = new PrintWriter(System.out);\n for(; scan.hasNext();) {\n long a, b, c;\n a = scan.nextLong();\n b = scan.nextLong();\n c = scan.nextLong();\n long res = calc(a, b, c);\n long r = calc(b, a, c);\n if(r < res) res = r;\n r = calc(c, a, b);\n if(r < res) res = r;\n print.println(res);\n }\n } \n /*catch (FileNotFoundException ex) {\n ex.printStackTrace();\n } */\n finally {\n print.close();\n } \n }\n\n private long calc(long a, long b, long c) {\n long d = Math.min(b, c);\n a += d;\n b -= d;\n c -= d;\n if(b == 0) {\n b = c;\n c = 0;\n }\n if((b & 1) == 1) return d + a + b - 1;\n else if(a > 0) return d + b;\n else return d + a + b - 1;\n }\n \n}\n", "lang_cluster": "Java", "tags": ["math", "constructive algorithms"], "code_uid": "bd1bf19c4edb175bb08aec6a42243c96", "src_uid": "b8008caf788336775cb8ebb76478b04c", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.StringTokenizer;\npublic class Pixels {\n\n /**\n * @param args\n */\n public static void main(String[] args) {\n BufferedReader inpt = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer input;\n long n;\n try {\n input = new StringTokenizer(inpt.readLine());\n long[] rgb = {Long.parseLong(input.nextToken()),Long.parseLong(input.nextToken()),Long.parseLong(input.nextToken())};\n int j;\n n = Math.max(rgb[0], Math.max(rgb[1], rgb[2]));\n for(int i = 0; i < 3; i++){\n j = (i+1)%3;\n if( rgb[i]%2 == rgb[j]%2){\n n = Math.min(n, Math.max(rgb[i], rgb[j]));\n }\n }\n System.out.println(n);\n \n \n } catch (IOException e) {\n e.printStackTrace();\n }\n\n }\n\n}\n", "lang_cluster": "Java", "tags": ["math", "constructive algorithms"], "code_uid": "f12048b4924f7c84c4d21d11513f7691", "src_uid": "b8008caf788336775cb8ebb76478b04c", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class BB {\n\tpublic static void main(String[] args) {\n\t\tnew BB().run();\n\t}\n\n\tBufferedReader br;\n\tStringTokenizer st;\n\tPrintWriter out;\n\tboolean eof;\n\n\tvoid run() {\n\t\ttry {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tout = new PrintWriter(System.out);\n\t\t\tsolve();\n\t\t} catch (Throwable e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(-1);\n\t\t} finally {\n\t\t\tout.close();\n\t\t}\n\t}\n\n\tString nextToken() {\n\t\twhile (st == null || !st.hasMoreElements()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (IOException e) {\n\t\t\t\teof = true;\n\t\t\t\treturn \"0\";\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tlong nextLong() {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\n\tvoid solve() throws IOException {\n\t\tlong[] v = {nextLong(), nextLong(), nextLong(), };\n\t\tArrays.sort(v);\n\t\tout.println(v[0] % 2 == v[1] % 2 ? v[1] : v[2]);\t\t\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math", "constructive algorithms"], "code_uid": "e8fce0be9b5558f553807cb06821e0ab", "src_uid": "b8008caf788336775cb8ebb76478b04c", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Scanner;\n\npublic class Pixel {\n public static void main(String[] args) {\n Scanner input = new Scanner(System.in);\n long i,j,k,n,a,b,c,big,middle,small,sum;\n boolean is;\n while (input.hasNext()){\n a = input.nextLong(); b = input.nextLong(); c = input.nextLong(); sum = 0; is = false;\n\n big = (a>=b) ? ((a>=c)? a :c) : ((b>=c) ? b : c);\n small = (a>=b) ? ((b>=c) ? c : b) : ((a>=c) ? c : a);\n middle = a>b ? (c>a ? a :(b>c)? b:c) : (c>b ? b : a>c? a : c);\n\n // System.out.println(big+ \" \" + middle + \" \" + small);\n for (i=0; i<big; i++){\n if (big == middle || big == small || middle == small) break;\n if ((middle - small ) % 2 == 0){\n // big--;middle--;small++;\n j = (middle - small);\n // sum += (j/2);\n sum += (small + j);\n is = true;\n break;\n }\n else break;\n }\n if (!is) {\n if (big == middle) sum += big;\n else if (big == small) sum += big;\n else if (small == middle) sum += small;\n else sum += big; System.out.println(sum);\n }\n else\n System.out.println(sum);\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "constructive algorithms"], "code_uid": "d57ffae7d718e533d743ebb423456dbf", "src_uid": "b8008caf788336775cb8ebb76478b04c", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\n/**\n * @author Don Li\n */\npublic class FindACar2 {\n \n int N = 31;\n int MOD = (int) 1e9 + 7;\n \n void solve() {\n int q = in.nextInt();\n while (q-- > 0) {\n int x1 = in.nextInt() - 1, y1 = in.nextInt() - 1, x2 = in.nextInt() - 1, y2 = in.nextInt() - 1, k = in.nextInt() - 1;\n \n long ans = 0;\n ans = add(ans, calc(x2, y2, k));\n ans = sub(ans, calc(x1 - 1, y2, k));\n ans = sub(ans, calc(x2, y1 - 1, k));\n ans = add(ans, calc(x1 - 1, y1 - 1, k));\n \n out.println(ans);\n }\n }\n \n int calc(int x, int y, int k) {\n if (x < 0 || y < 0) return 0;\n \n int[][][][] cnt = new int[N + 1][2][2][2];\n int[][][][] sum = new int[N + 1][2][2][2];\n \n int[] a = new int[N], b = new int[N], c = new int[N];\n for (int i = 0; i < N; i++) {\n a[i] = (x >> i) & 1;\n b[i] = (y >> i) & 1;\n c[i] = (k >> i) & 1;\n }\n reverse(a);\n reverse(b);\n reverse(c);\n \n cnt[0][1][1][1] = 1;\n for (int i = 0; i < N; i++) {\n for (int p = 0; p < 2; p++) for (int q = 0; q < 2; q++) for (int r = 0; r < 2; r++) {\n for (int u = 0; u < 2; u++) for (int v = 0; v < 2; v++) {\n int w = u ^ v;\n if (p == 1 && u == 1 && a[i] == 0) continue;\n if (q == 1 && v == 1 && b[i] == 0) continue;\n if (r == 1 && w == 1 && c[i] == 0) continue;\n int np = p == 1 && a[i] == u ? 1 : 0;\n int nq = q == 1 && b[i] == v ? 1 : 0;\n int nr = r == 1 && c[i] == w ? 1 : 0;\n cnt[i + 1][np][nq][nr] = add(cnt[i + 1][np][nq][nr], cnt[i][p][q][r]);\n sum[i + 1][np][nq][nr] = add(sum[i + 1][np][nq][nr], sum[i][p][q][r]);\n sum[i + 1][np][nq][nr] = add(sum[i + 1][np][nq][nr], mul(w << (30 - i), cnt[i][p][q][r]));\n }\n }\n }\n \n long res = 0;\n for (int p = 0; p < 2; p++) for (int q = 0; q < 2; q++) for (int r = 0; r < 2; r++) {\n res = add(res, sum[N][p][q][r]);\n res = add(res, cnt[N][p][q][r]);\n }\n return (int) res;\n }\n \n void reverse(int[] a) {\n int l = 0, r = a.length - 1;\n while (l < r) {\n int tmp = a[l];\n a[l] = a[r];\n a[r] = tmp;\n l++;\n r--;\n }\n }\n \n int add(long a, long b) {\n return (int) ((a + b) % MOD);\n }\n \n int sub(long a, long b) {\n return (int) ((a - b + MOD) % MOD);\n }\n \n int mul(long a, long b) {\n return (int) (a * b % MOD);\n }\n \n public static void main(String[] args) {\n in = new FastScanner(new BufferedReader(new InputStreamReader(System.in)));\n out = new PrintWriter(System.out);\n new FindACar2().solve();\n out.close();\n }\n \n static FastScanner in;\n static PrintWriter out;\n \n static class FastScanner {\n BufferedReader in;\n StringTokenizer st;\n \n public FastScanner(BufferedReader in) {\n this.in = in;\n }\n \n public String nextToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(in.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n \n public int nextInt() {\n return Integer.parseInt(nextToken());\n }\n \n public long nextLong() {\n return Long.parseLong(nextToken());\n }\n \n public double nextDouble() {\n return Double.parseDouble(nextToken());\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["divide and conquer", "dp"], "code_uid": "c3bdd63e839b1fa321575fd7a9c6574b", "src_uid": "1ab085026ce43810acf98cc4bf8faf26", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.List;\n\npublic class Main {\n\n\tprivate static final String NO = \"NO\";\n\tprivate static final String YES = \"YES\";\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\n\tprivate static final long MOD = 1000000007;\n\n\tvoid solve() {\n\t\tint T = 1;\n\t\tfor (int i = 0; i < T; i++)\n\t\t\tsolve(i);\n\t}\n\n\tlong p[];\n\n\tvoid solve(int T) {\n\t\tint n = ni();\n\t\tp = new long[64];\n\t\tp[0] = 1;\n\t\tfor (int i = 1; i < 60; i++)\n\t\t\tp[i] = p[i - 1] * 2;\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint a[] = na(5);\n\t\t\tlong ans = work(a[2], a[3], a[4], 0) - work(a[0] - 1, a[3], a[4], 0) - work(a[2], a[1] - 1, a[4], 0)\n\t\t\t\t\t+ work(a[0] - 1, a[1] - 1, a[4], 0);\n\t\t\tans %= MOD;\n\t\t\tout.println((ans + MOD) % MOD);\n\t\t}\n\t}\n\n\tlong work(long x, long y, long k, long lazy) {\n\t\tif (x <= 0 || y <= 0)\n\t\t\treturn 0;\n\t\tif (k <= 0)\n\t\t\treturn 0;\n\t\tif (x > y) {\n\t\t\tlong tmp = x;\n\t\t\tx = y;\n\t\t\ty = tmp;\n\t\t}\n\t\tint t = 0;\n\t\twhile (p[t] <= y)\n\t\t\tt++;\n\n\t\tlong ans;\n\t\tif (y == p[t - 1]) {\n\t\t\tlong tmpa, tmpb;\n\t\t\tif (p[t - 1] < k)// all numbers is within [1..k], count them all\n\t\t\t{\n\t\t\t\ttmpa = p[t - 1];\n\t\t\t\ttmpa = tmpa * (tmpa + 1) / 2;\n\t\t\t\ttmpa %= MOD;\n\t\t\t\ttmpa *= x;\n\t\t\t\ttmpa %= MOD;\n\t\t\t\ttmpb = (lazy * y) % MOD;\n\t\t\t\ttmpb *= x;\n\t\t\t\ttmpb %= MOD;\n\t\t\t\tans = (tmpa + tmpb) % MOD;\n\t\t\t} else// p[t-1]>=k only less or equal to k is needed\n\t\t\t{\n\t\t\t\ttmpa = k;\n\t\t\t\ttmpa = tmpa * (tmpa + 1) / 2;\n\t\t\t\ttmpa %= MOD;\n\t\t\t\ttmpa *= x;\n\t\t\t\ttmpa %= MOD;\n\t\t\t\ttmpb = (lazy * k) % MOD;\n\t\t\t\ttmpb *= x;\n\t\t\t\ttmpb %= MOD;\n\t\t\t\tans = (tmpa + tmpb) % MOD;\n\t\t\t}\n\t\t} else// y > p[t-1]\n\t\t{\n\t\t\tif (x < p[t - 1]) {\n\t\t\t\tans = work(x, p[t - 1], k, lazy);\n\t\t\t\tans = (ans + work(x, y - p[t - 1], k - p[t - 1], lazy + p[t - 1])) % MOD;\n\t\t\t} else {\n\t\t\t\tans = work(p[t - 1], p[t - 1], k, lazy);\n\t\t\t\tans = (ans + work(x - p[t - 1], p[t - 1], k - p[t - 1], lazy + p[t - 1])) % MOD;\n\t\t\t\tans = (ans + work(p[t - 1], y - p[t - 1], k - p[t - 1], lazy + p[t - 1])) % MOD;\n\t\t\t\tans = (ans + work(x - p[t - 1], y - p[t - 1], k, lazy)) % MOD;\n\t\t\t}\n\t\t}\n//\t\ttr(x, y, k, lazy, ans);\n\n\t\treturn ans;\n\t}\n\n\t// a^b\n\tlong power(long a, long b) {\n\t\tlong x = 1, y = a;\n\t\twhile (b > 0) {\n\t\t\tif (b % 2 != 0) {\n\t\t\t\tx = (x * y) % MOD;\n\t\t\t}\n\t\t\ty = (y * y) % MOD;\n\t\t\tb /= 2;\n\t\t}\n\t\treturn x % MOD;\n\t}\n\n\tprivate long gcd(long a, long b) {\n\t\twhile (a != 0) {\n\t\t\tlong tmp = b % a;\n\t\t\tb = a;\n\t\t\ta = tmp;\n\t\t}\n\t\treturn b;\n\t}\n\n\tvoid run() throws Exception {\n\t\tis = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\tif (!INPUT.isEmpty())\n\t\t\ttr(System.currentTimeMillis() - s + \"ms\");\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tnew Main().run();\n\t}\n\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\tprivate boolean vis[];\n\n\tprivate int readByte() {\n\t\tif (lenbuf == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (ptrbuf >= lenbuf) {\n\t\t\tptrbuf = 0;\n\t\t\ttry {\n\t\t\t\tlenbuf = is.read(inbuf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (lenbuf <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\n\tprivate boolean isSpaceChar(int c) {\n\t\treturn !(c >= 33 && c <= 126);\n\t}\n\n\tprivate int skip() {\n\t\tint b;\n\t\twhile ((b = readByte()) != -1 && isSpaceChar(b))\n\t\t\t;\n\t\treturn b;\n\t}\n\n\tprivate double nd() {\n\t\treturn Double.parseDouble(ns());\n\t}\n\n\tprivate char nc() {\n\t\treturn (char) skip();\n\t}\n\n\tprivate String ns() {\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile (!(isSpaceChar(b))) { // when nextLine, (isSpaceChar(b) && b != '\n\t\t\t\t\t\t\t\t\t// ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tprivate char[] ns(int n) {\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile (p < n) {\n\t\t\tif (!(isSpaceChar(b)))\n\t\t\t\tbuf[p++] = (char) b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\n\tprivate char[][] nm(int n, int m) {\n\t\tchar[][] map = new char[n][];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tmap[i] = ns(m);\n\t\treturn map;\n\t}\n\n\tprivate int[] na(int n) {\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = ni();\n\t\treturn a;\n\t}\n\n\tprivate List<Integer> na2(int n) {\n\t\tList<Integer> a = new ArrayList<Integer>();\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta.add(ni());\n\t\treturn a;\n\t}\n\n\tprivate int[][] na(int n, int m) {\n\t\tint[][] a = new int[n][];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = na(m);\n\t\treturn a;\n\t}\n\n\tprivate int ni() {\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tprivate long[] nl(int n) {\n\t\tlong[] a = new long[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = nl();\n\t\treturn a;\n\t}\n\n\tprivate long[][] nl(int n, int m) {\n\t\tlong[][] a = new long[n][];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = nl(m);\n\t\treturn a;\n\t}\n\n\tprivate long nl() {\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tprivate static void tr(Object... o) {\n\t\tSystem.out.println(Arrays.deepToString(o));\n\t}\n\n\tpublic class Pair<K, V> {\n\n\t\t/**\n\t\t * Key of this <code>Pair</code>.\n\t\t */\n\t\tprivate K key;\n\n\t\t/**\n\t\t * Gets the key for this pair.\n\t\t * \n\t\t * @return key for this pair\n\t\t */\n\t\tpublic K getKey() {\n\t\t\treturn key;\n\t\t}\n\n\t\t/**\n\t\t * Value of this this <code>Pair</code>.\n\t\t */\n\t\tprivate V value;\n\n\t\t/**\n\t\t * Gets the value for this pair.\n\t\t * \n\t\t * @return value for this pair\n\t\t */\n\t\tpublic V getValue() {\n\t\t\treturn value;\n\t\t}\n\n\t\t/**\n\t\t * Creates a new pair\n\t\t * \n\t\t * @param key The key for this pair\n\t\t * @param value The value to use for this pair\n\t\t */\n\t\tpublic Pair(K key, V value) {\n\t\t\tthis.key = key;\n\t\t\tthis.value = value;\n\t\t}\n\n\t\t/**\n\t\t * <p>\n\t\t * <code>String</code> representation of this <code>Pair</code>.\n\t\t * </p>\n\t\t *\n\t\t * <p>\n\t\t * The default name/value delimiter '=' is always used.\n\t\t * </p>\n\t\t *\n\t\t * @return <code>String</code> representation of this <code>Pair</code>\n\t\t */\n\t\t@Override\n\t\tpublic String toString() {\n\t\t\treturn key + \"=\" + value;\n\t\t}\n\n\t\t/**\n\t\t * <p>\n\t\t * Generate a hash code for this <code>Pair</code>.\n\t\t * </p>\n\t\t *\n\t\t * <p>\n\t\t * The hash code is calculated using both the name and the value of the\n\t\t * <code>Pair</code>.\n\t\t * </p>\n\t\t *\n\t\t * @return hash code for this <code>Pair</code>\n\t\t */\n\t\t@Override\n\t\tpublic int hashCode() {\n\t\t\t// name's hashCode is multiplied by an arbitrary prime number (13)\n\t\t\t// in order to make sure there is a difference in the hashCode between\n\t\t\t// these two parameters:\n\t\t\t// name: a value: aa\n\t\t\t// name: aa value: a\n\t\t\treturn key.hashCode() * 13 + (value == null ? 0 : value.hashCode());\n\t\t}\n\n\t\t/**\n\t\t * <p>\n\t\t * Test this <code>Pair</code> for equality with another <code>Object</code>.\n\t\t * </p>\n\t\t *\n\t\t * <p>\n\t\t * If the <code>Object</code> to be tested is not a <code>Pair</code> or is\n\t\t * <code>null</code>, then this method returns <code>false</code>.\n\t\t * </p>\n\t\t *\n\t\t * <p>\n\t\t * Two <code>Pair</code>s are considered equal if and only if both the names and\n\t\t * values are equal.\n\t\t * </p>\n\t\t *\n\t\t * @param o the <code>Object</code> to test for equality with this\n\t\t * <code>Pair</code>\n\t\t * @return <code>true</code> if the given <code>Object</code> is equal to this\n\t\t * <code>Pair</code> else <code>false</code>\n\t\t */\n\t\t@Override\n\t\tpublic boolean equals(Object o) {\n\t\t\tif (this == o)\n\t\t\t\treturn true;\n\t\t\tif (o instanceof Pair) {\n\t\t\t\tPair pair = (Pair) o;\n\t\t\t\tif (key != null ? !key.equals(pair.key) : pair.key != null)\n\t\t\t\t\treturn false;\n\t\t\t\tif (value != null ? !value.equals(pair.value) : pair.value != null)\n\t\t\t\t\treturn false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t}\n\n}", "lang_cluster": "Java", "tags": ["divide and conquer", "dp"], "code_uid": "c78874e8d460e9ae3f1f9f87657561fb", "src_uid": "1ab085026ce43810acf98cc4bf8faf26", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Codeforces810E {\n\tpublic static int[] global = new int[100];\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tglobal[0] = 1;\n\t\tfor (int i = 1; i < 100; i++) {\n\t\t\tglobal[i] = (2*global[i-1])%1000000007;\n\t\t}\n\t\tint[] twopower = new int[100];\n\t\ttwopower[0] = 1;\n\t\tfor (int i = 1; i < 100; i++) {\n\t\t\ttwopower[i] = (twopower[i-1]*2)%1000000007;\n\t\t}\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tPrintWriter pw = new PrintWriter(System.out);\n\t\tString[] sp = br.readLine().split(\" \");\n\t\tint q = Integer.parseInt(sp[0]);\n\t\tfor (int i = 0; i < q; i++) {\n\t\t\tsp = br.readLine().split(\" \");\n\t\t\tint x1 = Integer.parseInt(sp[0]);\n\t\t\tint y1 = Integer.parseInt(sp[1]);\n\t\t\tint x2 = Integer.parseInt(sp[2]);\n\t\t\tint y2 = Integer.parseInt(sp[3]);\n\t\t\tint k = Integer.parseInt(sp[4]);\n\t\t\tint answer = 0;\n\t\t\tif ((x1 == 1) && (y1 == 1)) {\n\t\t\t\tanswer = answer(x2, y2, k);\n\t\t\t}\n\t\t\telse if (x1 == 1) {\n\t\t\t\tanswer = answer(x2, y2, k)-answer(x2, y1-1, k);\n\t\t\t}\n\t\t\telse if (y1 == 1) {\n\t\t\t\tanswer = answer(x2, y2, k) - answer(x1-1, y2, k);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tanswer = answer(x2, y2, k) - answer(x1-1, y2, k) - answer(x2, y1-1, k) + answer(x1-1, y1-1, k);\n\t\t\t}\n\t\t\tanswer %= 1000000007;\n\t\t\tif (answer < 0)\n\t\t\t\tanswer += 1000000007;\n\t\t\tpw.println(answer);\n\t\t}\n\t\tpw.close();\n\t}\n\t\n\tpublic static int answer(int m, int n, int k) {\n\t\tint tmp = m;\n\t\tint counter = 0;\n\t\tint counter2 = 0;\n\t\twhile (tmp > 0) {\n\t\t\tif (tmp%2 == 1)\n\t\t\t\tcounter++;\n\t\t\tcounter2++;\n\t\t\ttmp = tmp/2;\n\t\t}\n\t\tint[][] mlist = new int[counter][2];\n\t\tcounter--;\n\t\tfor (int i = counter2-1; i >= 0; i--) {\n\t\t\tif ((m >> i)%2 == 1) {\n\t\t\t\tmlist[counter][0] = (m >> i)-1;\n\t\t\t\tmlist[counter][1] = i;\n\t\t\t\tcounter--;\n\t\t\t}\n\t\t}\n\t\t\n\t\ttmp = n;\n\t\tcounter = 0;\n\t\tcounter2 = 0;\n\t\twhile (tmp > 0) {\n\t\t\tif (tmp%2 == 1)\n\t\t\t\tcounter++;\n\t\t\tcounter2++;\n\t\t\ttmp = tmp/2;\n\t\t}\n\t\tint[][] nlist = new int[counter][2];\n\t\tcounter--;\n\t\tfor (int i = counter2-1; i >= 0; i--) {\n\t\t\tif ((n >> i)%2 == 1) {\n\t\t\t\tnlist[counter][0] = (n >> i)-1;\n\t\t\t\tnlist[counter][1] = i;\n\t\t\t\tcounter--;\n\t\t\t}\n\t\t}\n\t\t\n\t\tint answer = 0;\n\n\t\tfor (int i = 0; i < mlist.length; i++) {\n\t\t\tfor (int j = 0; j < nlist.length; j++) {\n\t\t\t\tanswer = (answer + sum(mlist[i][1], nlist[j][1], mlist[i][0], nlist[j][0], k))%1000000007;\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn answer;\n\t}\n\t\n\tpublic static int sum(int m, int n, int r, int s, int k) {\n\t\tif (m < n) {\n\t\t\tint temp = m;\n\t\t\tm = n;\n\t\t\tn = temp;\n\t\t\ttemp = r;\n\t\t\tr = s;\n\t\t\ts = temp;\n\t\t}\n\t\tint t = s >> (m-n);\n\t\tint u = r^t;\n\t\tlong val = 0;\n\t\tif (k > u*global[m]) {\n\t\t\tint min = u*global[m];\n\t\t\tint max = Math.min(k, (u+1)*global[m]);\n\t\t\tval = (((long) max)*((long) max+1))/2 - (((long) min)*((long)min+1))/2;\n\t\t}\n\t\tval %= 1000000007;\n\t\tval *= global[n];\n\t\tval %= 1000000007;\n\t\treturn (int) val;\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["divide and conquer", "dp"], "code_uid": "b828af9caf2add1eb42f42d9693284d5", "src_uid": "1ab085026ce43810acf98cc4bf8faf26", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\n\npublic class C{\n\tfinal int MOD = (int)1e9 + 7;\n\tlong get(int x, int y, int lim){\n\t\tif (Math.min(x,y) < 0) return 0L;\n\t\t\n\t\tlong[][][][] d = new long[32][2][2][2], sm = new long[32][2][2][2];\n\t\td[31][1][1][1] = 1;\n\t\tfor (int w = 30; w >= 0; w--)\n\t\t\tfor (int a = 0; a < 2; a++)\n\t\t\t\tfor (int b = 0; b < 2; b++)\n\t\t\t\t\tfor (int c = 0; c < 2; c++)\n\t\t\t\t\t\tfor (int aa = 0; aa <= (a==0?1:x>>w&1); aa++)\n\t\t\t\t\t\t\tfor (int bb = 0; bb <= (b==0?1:y>>w&1); bb++)\n\t\t\t\t\t\t\t\tif (c == 0 || (aa^bb) <= (lim>>w&1)){\n\t\t\t\t\t\t\t\t\td[w][(a==0||aa<(x>>w&1))?0:1][(b==0||bb<(y>>w&1))?0:1][(c==0||(aa^bb)<(lim>>w&1))?0:1]\n\t\t\t\t\t\t\t\t\t\t+= d[w+1][a][b][c];\n\n\t\t\t\t\t\t\t\t\tsm[w][(a==0||aa<(x>>w&1))?0:1][(b==0||bb<(y>>w&1))?0:1][(c==0||(aa^bb)<(lim>>w&1))?0:1]\n\t\t\t\t\t\t\t\t\t\t+= sm[w+1][a][b][c] + (1L<<w)*(aa^bb)*d[w+1][a][b][c];\n\t\t\t\t\t\t\t\t\tsm[w][(a==0||aa<(x>>w&1))?0:1][(b==0||bb<(y>>w&1))?0:1][(c==0||(aa^bb)<(lim>>w&1))?0:1]\n\t\t\t\t\t\t\t\t\t\t%= MOD;\n\t\t\t\t\t\t\t\t}\n\n\t\tlong ret = 0;\n\t\tfor (int i = 0; i < 2; i++)\n\t\t\tfor (int j = 0; j < 2; j++)\n\t\t\t\tfor (int w = 0; w < 2; w++){\n\t\t\t\t\tret += d[0][i][j][w];\n\t\t\t\t\tret += sm[0][i][j][w];\n\t\t\t\t\tret %= MOD;\n\t\t\t\t}\n\t\treturn ret;\n\t}\n\tvoid solve(){\n\t//\tSystem.out.println(get(4, 3, 4));\n\t\tScanner sc = new Scanner(System.in);\n\t\tint q = sc.nextInt();\n\t\twhile (q-->0){\n\t\t\tint x1 = sc.nextInt(), y1 = sc.nextInt();\n\t\t\tint x2 = sc.nextInt(), y2 = sc.nextInt();\n\t\t\tint k = sc.nextInt();\n\t\t\tx1--; x2--; y1--; y2--; k--;\n\t\t\tSystem.out.printf(\"%d\\n\", (get(x2, y2, k)-get(x2,y1-1, k)-get(x1-1, y2, k)+get(x1-1,y1-1, k)+MOD*10L)%MOD);\n\t\t}\n\t}\n\tpublic static void main(String[] args){\n\t\tC sol = new C();\n\t\tsol.solve();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["divide and conquer", "dp"], "code_uid": "bac12b15380f20a9a5f7620b1841fb7d", "src_uid": "1ab085026ce43810acf98cc4bf8faf26", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\n/**\n * @author Don Li\n */\npublic class FindACar {\n \n int N = 30;\n int MOD = (int) 1e9 + 7;\n \n int a, b, c;\n \n int[][][][] dp = new int[N + 1][2][2][2];\n int[][][][] cnt = new int[N + 1][2][2][2];\n \n void solve() {\n int q = in.nextInt();\n while (q-- > 0) {\n int x1 = in.nextInt() - 1, y1 = in.nextInt() - 1, x2 = in.nextInt() - 1, y2 = in.nextInt() - 1, k = in.nextInt() - 1;\n \n long ans = 0;\n ans = (ans + calc(x2, y2, k)) % MOD;\n ans = (ans - calc(x1 - 1, y2, k) + MOD) % MOD;\n ans = (ans - calc(x2, y1 - 1, k) + MOD) % MOD;\n ans = (ans + calc(x1 - 1, y1 - 1, k)) % MOD;\n \n out.println(ans);\n }\n }\n \n int calc(int x, int y, int k) {\n if (x < 0 || y < 0) return 0;\n \n for (int i = 0; i <= N; i++)\n for (int j = 0; j < 2; j++)\n for (int u = 0; u < 2; u++) \n for (int v = 0; v < 2; v++) \n dp[i][j][u][v] = cnt[i][j][u][v] = -1;\n \n a = x;\n b = y;\n c = k;\n return dfs1(N, 1, 1, 1);\n }\n \n int dfs1(int i, int ea, int eb, int ec) {\n if (i < 0) return 1;\n if (dp[i][ea][eb][ec] >= 0) return dp[i][ea][eb][ec];\n \n int bit_a = (a >> i) & 1;\n int bit_b = (b >> i) & 1;\n int bit_c = (c >> i) & 1;\n \n long res = 0;\n \n int nec = ec == 1 && bit_c == 0 ? 1 : 0;\n int nea = ea == 1 && bit_a == 0 ? 1 : 0;\n int neb = eb == 1 && bit_b == 0 ? 1 : 0;\n res = (res + dfs1(i - 1, nea, neb, nec)) % MOD;\n \n if ((eb == 0 || bit_b == 1) && (ec == 0 || bit_c == 1)) {\n nec = ec == 1 && bit_c == 1 ? 1 : 0;\n nea = ea == 1 && bit_a == 0 ? 1 : 0;\n neb = eb == 1 && bit_b == 1 ? 1 : 0;\n res = (res + (1L << i) * dfs2(i - 1, nea, neb, nec) % MOD + dfs1(i - 1, nea, neb, nec)) % MOD;\n }\n \n if ((ea == 0 || bit_a == 1) && (ec == 0 || bit_c == 1)) {\n nec = ec == 1 && bit_c == 1 ? 1 : 0;\n nea = ea == 1 && bit_a == 1 ? 1 : 0;\n neb = eb == 1 && bit_b == 0 ? 1 : 0;\n res = (res + (1L << i) * dfs2(i - 1, nea, neb, nec) % MOD + dfs1(i - 1, nea, neb, nec)) % MOD;\n }\n \n if ((ea == 0 || bit_a == 1) && (eb == 0 || bit_b == 1)) {\n nec = ec == 1 && bit_c == 0 ? 1 : 0;\n nea = ea == 1 && bit_a == 1 ? 1 : 0;\n neb = eb == 1 && bit_b == 1 ? 1 : 0;\n res = (res + dfs1(i - 1, nea, neb, nec)) % MOD;\n }\n \n return dp[i][ea][eb][ec] = (int) res;\n }\n \n int dfs2(int i, int ea, int eb, int ec) {\n if (i < 0) return 1;\n if (cnt[i][ea][eb][ec] >= 0) return cnt[i][ea][eb][ec];\n \n int bit_a = (a >> i) & 1;\n int bit_b = (b >> i) & 1;\n int bit_c = (c >> i) & 1;\n \n long res = 0;\n \n int nec = ec == 1 && bit_c == 0 ? 1 : 0;\n int nea = ea == 1 && bit_a == 0 ? 1 : 0;\n int neb = eb == 1 && bit_b == 0 ? 1 : 0;\n res = (res + dfs2(i - 1, nea, neb, nec)) % MOD;\n \n if ((eb == 0 || bit_b == 1) && (ec == 0 || bit_c == 1)) {\n nec = ec == 1 && bit_c == 1 ? 1 : 0;\n nea = ea == 1 && bit_a == 0 ? 1 : 0;\n neb = eb == 1 && bit_b == 1 ? 1 : 0;\n res = (res + dfs2(i - 1, nea, neb, nec)) % MOD;\n }\n \n if ((ea == 0 || bit_a == 1) && (ec == 0 || bit_c == 1)) {\n nec = ec == 1 && bit_c == 1 ? 1 : 0;\n nea = ea == 1 && bit_a == 1 ? 1 : 0;\n neb = eb == 1 && bit_b == 0 ? 1 : 0;\n res = (res + dfs2(i - 1, nea, neb, nec)) % MOD;\n }\n \n if ((ea == 0 || bit_a == 1) && (eb == 0 || bit_b == 1)) {\n nec = ec == 1 && bit_c == 0 ? 1 : 0;\n nea = ea == 1 && bit_a == 1 ? 1 : 0;\n neb = eb == 1 && bit_b == 1 ? 1 : 0;\n res = (res + dfs2(i - 1, nea, neb, nec)) % MOD;\n }\n \n return cnt[i][ea][eb][ec] = (int) res;\n }\n \n public static void main(String[] args) {\n in = new FastScanner(new BufferedReader(new InputStreamReader(System.in)));\n out = new PrintWriter(System.out);\n new FindACar().solve();\n out.close();\n }\n \n static FastScanner in;\n static PrintWriter out;\n \n static class FastScanner {\n BufferedReader in;\n StringTokenizer st;\n \n public FastScanner(BufferedReader in) {\n this.in = in;\n }\n \n public String nextToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(in.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n \n public int nextInt() {\n return Integer.parseInt(nextToken());\n }\n \n public long nextLong() {\n return Long.parseLong(nextToken());\n }\n \n public double nextDouble() {\n return Double.parseDouble(nextToken());\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["divide and conquer", "dp"], "code_uid": "94cf90a0e88d975607840b52efe4e2b5", "src_uid": "1ab085026ce43810acf98cc4bf8faf26", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.lang.reflect.Array;\nimport java.util.*;\n\nimport static java.lang.Math.*;\n\npublic class Main {\n ArrayList<Integer> g[];\n HashSet<Integer> from[];\n Queue<Integer> q = new ArrayDeque<>();\n boolean used[];\n int[] dist;\n\n void bfs() {\n while (!q.isEmpty()) {\n int v = q.poll();\n for (Integer to : g[v]) {\n if (!used[to]) {\n used[to] = true;\n dist[to] = dist[v] + 1;\n q.add(to);\n }\n if (dist[to] == dist[v] + 1) from[to].add(v);\n }\n }\n }\n\n void run() throws IOException {\n int n = nextInt();\n int m = nextInt();\n used = new boolean[n];\n dist = new int[n];\n g = new ArrayList[n];\n from = new HashSet[n];\n for (int i = 0; i < n; i++) {\n g[i] = new ArrayList<>();\n from[i] = new HashSet<>();\n }\n for (int i = 0; i < m; i++) {\n int u = nextInt() - 1;\n int v = nextInt() - 1;\n g[v].add(u);\n }\n int k = nextInt();\n int[] p = new int[k];\n for (int i = 0; i < k; i++) {\n p[i] = nextInt() - 1;\n }\n used[p[k - 1]] = true;\n q.add(p[k - 1]);\n bfs();\n int min = 0;\n int max = 0;\n for (int i = 0; i < p.length - 1; i++) {\n int v = p[i];\n if (from[p[i]].contains(p[i + 1])) {\n if (from[p[i]].size() > 1) max++;\n } else {\n min++;\n max++;\n }\n }\n pw.print(min + \" \" + max);\n pw.close();\n }\n\n static BufferedReader br;\n static StringTokenizer st = new StringTokenizer(\"\");\n static PrintWriter pw;\n\n public static String next() throws IOException {\n while (!st.hasMoreTokens()) st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n\n public static int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n public static long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n public static double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n\n public static void main(String[] args) throws IOException {\n br = new BufferedReader(new InputStreamReader(System.in));\n pw = new PrintWriter(System.out);\n new Main().run();\n }\n\n}\n", "lang_cluster": "Java", "tags": ["shortest paths", "graphs"], "code_uid": "8fc2557ae25db1b6bbbae30d899d2ac0", "src_uid": "19a0c05eb2d1559ccfe60e210c6fcd6a", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n static int n, m;\n static ArrayList<Integer> gr[];\n static int dist[];\n static ArrayList<Integer> temp = new ArrayList<>();\n static int fin;\n\n static void build() {\n ArrayList<Integer> g[] = new ArrayList[n];\n for(int i = 0;i < n;i++) g[i] = new ArrayList<>();\n for(int i = 0;i < n;i++) {\n for(int j : gr[i]) g[j].add(i);\n }\n\n dist = new int [n];\n for(int i = 0;i < n;i++) dist[i] = (int) 1e9;\n dist[fin] = 0;\n Deque<Integer> bfs = new ArrayDeque<>();\n bfs.add(fin);\n while(!bfs.isEmpty()) {\n int v = bfs.pollFirst();\n\n for(int to : g[v]) {\n if (dist[to] > dist[v] + 1) {\n dist[to] = dist[v] + 1;\n bfs.add(to);\n }\n }\n }\n }\n\n\n static void scan() throws IOException {\n n = sc.nextInt();\n m = sc.nextInt();\n gr = new ArrayList[n];\n for(int i = 0;i < n;i++) gr[i] = new ArrayList<>();\n for(int i = 0;i < m;i++) {\n int v1 = sc.nextInt() - 1;\n int v2 = sc.nextInt() -1;\n gr[v1].add(v2);\n }\n\n int k = sc.nextInt();\n for(int i = 0;i < k;i++) {\n temp.add(sc.nextInt() - 1);\n }\n fin = temp.get(temp.size() - 1);\n }\n\n static void solve() throws IOException {\n scan();\n build();\n int ans1 = 0;\n int ans2 = 0;\n for(int u = 0;u < temp.size() - 1;u++) {\n int i = temp.get(u);\n int next = temp.get(u + 1);\n if (i == fin) break;\n int min = (int) 1e9;\n for(int to : gr[i]) {\n if (to != next) min = Math.min(min, dist[to]);\n }\n if (dist[next] > min) {\n ans1++;\n ans2++;\n }else if (dist[next] == min) {\n ans2++;\n }\n }\n\n pw.println(ans1 + \" \" + ans2);\n }\n\n\n\n\n public static void main(String[] args) throws IOException {\n sc = new Fast_Scanner(System.in);\n pw = new PrintWriter(System.out);\n solve();\n\n pw.close();\n }\n\n\n static Fast_Scanner sc;\n static PrintWriter pw;\n\n static class Fast_Scanner {\n static BufferedReader br;\n static StringTokenizer st = new StringTokenizer(\"\");\n\n Fast_Scanner(InputStream in) {\n br = new BufferedReader(new InputStreamReader(in));\n }\n\n Fast_Scanner(String in) throws FileNotFoundException {\n br = new BufferedReader(new FileReader(in));\n }\n\n String next() throws IOException {\n while (!st.hasMoreTokens())\n st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n\n int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n Double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n\n long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n }\n\n\n}", "lang_cluster": "Java", "tags": ["shortest paths", "graphs"], "code_uid": "160abfdfc79280ac4b206d5dcb169aa6", "src_uid": "19a0c05eb2d1559ccfe60e210c6fcd6a", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.lang.reflect.Array;\nimport java.util.*;\n\npublic class Main {\n\n\n public static void main(String[] args) throws IOException {\n FastScanner in = new FastScanner();\n int n = in.nextInt();\n int m = in.nextInt();\n int[] sh = new int[n];\n int[] cnt = new int[n];\n ArrayList<Integer>[] a = new ArrayList[n];\n for (int i = 0; i < n; i++) {\n a[i] = new ArrayList<>();\n }\n for (int i = 0; i < m; i++) {\n int from = in.nextInt() - 1;\n int to = in.nextInt() - 1;\n a[to].add(from);\n }\n int k = in.nextInt();\n int[] p = new int[n];\n for (int i = 0; i < k; i++) {\n p[i] = in.nextInt() - 1;\n }\n boolean[] used = new boolean[n];\n ArrayDeque<Integer> deq = new ArrayDeque<>();\n deq.add(p[k - 1]);\n used[p[k - 1]] = true;\n while (!deq.isEmpty()) {\n int v = deq.pollFirst();\n for (int to : a[v]) {\n if (!used[to]) {\n sh[to] = sh[v] + 1;\n used[to] = true;\n deq.add(to);\n } else {\n if (sh[to] == sh[v] + 1) {\n cnt[to]++;\n }\n }\n }\n }\n int min = 0;\n int max = 0;\n for (int i = 1; i < k; i++) {\n if (sh[p[i - 1]] != sh[p[i]] + 1) {\n min++;\n max++;\n } else {\n if (cnt[p[i - 1]] != 0) max++;\n }\n }\n in.out.println(min + \" \" + max);\n in.out.close();\n }\n}\n\nclass FastScanner {\n\n StringTokenizer st = new StringTokenizer(\"\");\n BufferedReader br;\n PrintWriter out;\n\n\n FastScanner() {\n br = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n }\n\n\n String next() throws IOException {\n while (st == null || !st.hasMoreTokens()) st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n\n int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n}\n", "lang_cluster": "Java", "tags": ["shortest paths", "graphs"], "code_uid": "88019ee1876ecc91c1f22a43200d15c5", "src_uid": "19a0c05eb2d1559ccfe60e210c6fcd6a", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in Actual solution is at the top\n *\n * @author ilyakor\n */\npublic class Main {\n\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n TaskG solver = new TaskG();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskG {\n\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n = in.nextInt();\n int k = in.nextInt();\n int[] phi = new int[n + 1];\n for (int i = 2; i <= n; ++i) {\n if (phi[i] == 0) {\n phi[i] = i - 1;\n for (int j = i * 2; j <= n; j += i) {\n if (phi[j] == 0) {\n phi[j] = j;\n }\n phi[j] = phi[j] / i * (i - 1);\n }\n }\n }\n Arrays.sort(phi, 3, phi.length);\n long res = 2;\n for (int i = 0; i < k; ++i) {\n res += phi[3 + i];\n }\n if (k == 1) {\n --res;\n }\n // if (k == 2) {\n // // We're taking\n // }\n out.printLine(res);\n }\n\n }\n\n static class OutputWriter {\n\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void print(Object... objects) {\n for (int i = 0; i < objects.length; i++) {\n if (i != 0) {\n writer.print(' ');\n }\n writer.print(objects[i]);\n }\n }\n\n public void printLine(Object... objects) {\n print(objects);\n writer.println();\n }\n\n public void close() {\n writer.close();\n }\n\n }\n\n static class InputReader {\n\n private InputStream stream;\n private byte[] buffer = new byte[10000];\n private int cur;\n private int count;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public static boolean isSpace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public int read() {\n if (count == -1) {\n throw new InputMismatchException();\n }\n try {\n if (cur >= count) {\n cur = 0;\n count = stream.read(buffer);\n if (count <= 0) {\n return -1;\n }\n }\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n return buffer[cur++];\n }\n\n public int readSkipSpace() {\n int c;\n do {\n c = read();\n } while (isSpace(c));\n return c;\n }\n\n public int nextInt() {\n int sgn = 1;\n int c = readSkipSpace();\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res = res * 10 + c - '0';\n c = read();\n } while (!isSpace(c));\n res *= sgn;\n return res;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "greedy", "number theory"], "code_uid": "392e03e951922ef279e4973877c60bc8", "src_uid": "c2f7012082c84d773c2f4b1858c17110", "difficulty": 2800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\npublic class F2 {\n\n\tstatic long mod = 998244353; \n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint m = sc.nextInt();\n\t\t\n\t\tString[] s = new String[n];\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\ts[i] = sc.next();\n\t\t}\t\n\t\t\n\t\tHashSet<String> suffs = new HashSet<>();\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tfor(int j = 1; j < s[i].length(); j++){\n\t\t\t\tsuffs.add(s[i].substring(j));\n\t\t\t}\n\t\t}\n\t\tsuffs.add(\"\");\n\t\tHashSet<Pair> nodes = new HashSet<>();\n\t\tfor(String a: suffs){\n\t\t\tfor(String b: suffs){\n\t\t\t\tif(isPref(a, b)) {\n\t\t\t\t\tnodes.add(new Pair(a, b));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint N = nodes.size();\n//\t\tSystem.out.println(N);\n\t\tHashMap<Pair, Integer> code = new HashMap<>();\n\t\tPair[] decode = new Pair[N];\n\t\tint count = 0;\n\t\tfor(Pair p: nodes) {\n\t\t\tdecode[count] = p;\n\t\t\tcode.put(p, count++);\n\t\t}\n\t\tint[][] aut = new int[N][N];\n\t\tPair p0 = new Pair(\"\",\"\");\n\t\tfor(String t: s) {\n\t\t\tfor(String u: s) {\n\t\t\t\tif(isPref(t, u)) {\n\t\t\t\t\tString a = t.substring(1);\n\t\t\t\t\tString b = u.substring(1);\n\t\t\t\t\tPair p = new Pair(a, b);\n\t\t\t\t\taut[code.get(p0)][code.get(p)]++;\n\t\t\t\t}\n\t\t\t\telse if(isPref(u, t)) {\n\t\t\t\t\tString a = u.substring(1);\n\t\t\t\t\tString b = t.substring(1);\n\t\t\t\t\tPair p = new Pair(a, b);\n\t\t\t\t\taut[code.get(p0)][code.get(p)]++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(Pair p: nodes) {\n\t\t\tPair q = next(p);\n\t\t\tif(p.equals(p0)){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse if(q != null) {\n\t\t\t\taut[code.get(p)][code.get(q)]++;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tfor(String t: s) {\n\t\t\t\t\tq = next(p, t);\n\t\t\t\t\tif(q != null && nodes.contains(q)) {\n\t\t\t\t\t\taut[code.get(p)][code.get(q)]++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tMatrix mat = new Matrix(aut);\n\t\tMatrix matp = pow(mat, m);\n\t\tSystem.out.println(matp.mat[code.get(p0)][code.get(p0)]);\n\t}\n\tstatic Pair next(Pair p, String s) {\n\t\tif(p.a.equals(\"\")) {\n\t\t\tif(isPref(s, p.b)) {\n\t\t\t\tString a = s.substring(1);\n\t\t\t\tString b = p.b.substring(1);\n\t\t\t\treturn new Pair(a, b);\n\t\t\t}\n\t\t\telse if(isPref(p.b, s)) {\n\t\t\t\tString a = p.b.substring(1);\n\t\t\t\tString b = s.substring(1);\n\t\t\t\treturn new Pair(a, b);\n\t\t\t}\n\t\t\telse return null;\n\t\t}\n\t\telse return null;\n\t}\n\tstatic Pair next(Pair p) {\n\t\tif(p.a.equals(\"\")) return null;\n\t\tString a = p.a.substring(1);\n\t\tString b = p.b.substring(1);\n\t\treturn new Pair(a, b);\n\t}\n\tstatic boolean isPref(String a, String b) { //a of b\n\t\tif(a.length() > b.length()) return false;\n\t\telse return b.substring(0, a.length()).equals(a);\n\t}\n\tstatic class Pair {\n\t\tString a, b;\n\t\tpublic Pair(String a, String b) {\n\t\t\tthis.a = a; this.b = b;\n\t\t}\n\t\t@Override\n\t\tpublic int hashCode() {\n\t\t\treturn a.hashCode() + b.hashCode();\n\t\t}\n\t\t@Override\n\t\tpublic boolean equals(Object o) {\n\t\t\tPair p = (Pair)o;\n\t\t\treturn a.equals(p.a) && b.equals(p.b);\n\t\t}\n\t\tpublic String toString() {\n\t\t\treturn \"'\"+a+\"' '\"+b;\n\t\t}\n\t}\n\t\n\tstatic Matrix pow(Matrix m, int exp) {\n\t\tMatrix res = new Matrix(m.n);\n\t\tMatrix mapow = m;\n\t\twhile(exp > 0) {\n\t\t\tif((exp & 1) == 1) {\n\t\t\t\tres = res.mult(mapow);\n\t\t\t}\n\t\t\tmapow = mapow.mult(mapow);\n\t\t\texp >>= 1;\n\t\t}\n\t\treturn res;\n\t}\n\tstatic class Matrix{\n\t\tint[][] mat; int n;\n\t\tpublic Matrix(int[][] mat) {\n\t\t\tn = mat.length;\n\t\t\tthis.mat = mat;\n\t\t}\n\t\tpublic Matrix(int n) {\n\t\t\tmat = new int[n][n];\n\t\t\tthis.n = n;\n\t\t\tfor(int i = 0; i < n; i++) mat[i][i] = 1;\n\t\t}\n\t\tMatrix mult(Matrix m) {\n\t\t\tint[][] res = new int[n][n];\n\t\t\tfor(int k = 0; k < n; k++) {\n\t\t\t\tfor(int i = 0; i < n; i++) {\n\t\t\t\t\tfor(int j = 0; j < n; j++) {\n\t\t\t\t\t\tlong a = mat[i][k];\n\t\t\t\t\t\tlong b = m.mat[k][j];\n\t\t\t\t\t\tlong c = res[i][j];\n\t\t\t\t\t\tres[i][j] = (int)((c + a*b%mod)%mod);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn new Matrix(res);\n\t\t}\n\t\tpublic String toString(){\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(int i = 0; i < n; i++) {\n\t\t\t\tsb.append(Arrays.toString(mat[i])+\"\\n\");\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["brute force", "data structures", "matrices", "strings", "dp"], "code_uid": "a82b9528cc990bd1c286c1b620c7e34b", "src_uid": "711d15e11016d0164fb2b0c3756e4857", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class MainD {\n\tstatic StdIn in = new StdIn();\n\tstatic PrintWriter out = new PrintWriter(System.out);\n\tstatic long p;\n\tstatic List<Long> pFs = new ArrayList<Long>();\n\tstatic long[] fact1;\n\tstatic int[][] fact2;\n\t\n\tpublic static void main(String[] args) {\n\t\tint n=in.nextInt();\n\t\tp=in.nextLong();\n\t\tint l=in.nextInt(), r=in.nextInt();\n\t\tlong p2=p;\n\t\tfor(int i=2; i*i<=p2; ++i) {\n\t\t\tif(p2%i==0) {\n\t\t\t\twhile(p2%i==0)\n\t\t\t\t\tp2/=i;\n\t\t\t\tpFs.add((long)i);\n\t\t\t}\n\t\t}\n\t\tif(p2>1)\n\t\t\tpFs.add(p2);\n\t\tfact1 = new long[2*n+1];\n\t\tfact2 = new int[pFs.size()][2*n+1];\n\t\tfact1[0]=1;\n\t\tfor(int i=1; i<=2*n; ++i) {\n\t\t\tlong a=i;\n\t\t\tfor(int j=0; j<pFs.size(); ++j) {\n\t\t\t\tfact2[j][i]=fact2[j][i-1];\n\t\t\t\twhile(a%pFs.get(j)==0) {\n\t\t\t\t\ta/=pFs.get(j);\n\t\t\t\t\t++fact2[j][i];\n\t\t\t\t}\n\t\t\t}\n\t\t\tfact1[i]=fact1[i-1]*a%p;\n\t\t}\n\t\tlong ans1=0;\n\t\tfor(int i=0; i<=n; ++i) {\n\t\t\tans1=(ans1+nCk(n, i)*(nCk(n-i, (n-i)/2-(l+l%2*(n-i+1)%2)/2)-nCk(n-i, (n-i)/2-(r-(r+1)%2*(n-i)%2+2)/2)+p))%p;\n\t\t\t//if(i<1000)\n\t\t\t//\tout.println(ans1);\n\t\t\t//out.println(ans1+\" \"+nCk(n, i)+\" \"+nCk(n-i, (n-i)/2-l/2));\n\t\t}\n\t\tout.println(ans1);\n\t\tout.close();\n\t}\n\t\n\tstatic long nCk(int n, int k) {\n\t\tif(k>n||k<0)\n\t\t\treturn 0;\n\t\tlong r=fact1[n]*modI(fact1[k])%p*modI(fact1[n-k])%p;\n\t\tfor(int i=0; i<pFs.size(); ++i)\n\t\t\tr=r*expM(pFs.get(i), fact2[i][n]-fact2[i][k]-fact2[i][n-k])%p;\n\t\treturn r;\n\t}\n\t\n\tstatic long expM(long b, int e) {\n\t\tif(e==0)\n\t\t\treturn 1;\n\t\tif(e%2==1)\n\t\t\treturn b*expM(b*b%p, e/2)%p;\n\t\treturn expM(b*b%p, e/2);\n }\n\t\n\tstatic long modI(long a) {\n long m0 = p, t, q, x0 = 0, x1 = 1;\n while(a>1) {\n q = a / m0;\n t = m0;\n m0 = a % m0;\n a = t;\n t = x0;\n x0 = x1 - q * x0;\n x1 = t;\n }\n if(x1<0)\n\t\t\tx1 += p;\n return x1;\n }\n\t\n\tinterface Input {\n\t\tpublic String next();\n\t\tpublic String nextLine();\n\t\tpublic int nextInt();\n\t\tpublic long nextLong();\n\t\tpublic double nextDouble();\n\t}\n\tstatic class StdIn implements Input {\n\t\tfinal private int BUFFER_SIZE = 1 << 16;\n\t\tprivate DataInputStream din;\n\t\tprivate byte[] buffer;\n\t\tprivate int bufferPointer, bytesRead;\n\t\tpublic StdIn() {\n\t\t\tdin = new DataInputStream(System.in);\n\t\t\tbuffer = new byte[BUFFER_SIZE];\n\t\t\tbufferPointer = bytesRead = 0;\n\t\t}\n\t\tpublic StdIn(InputStream in) {\n\t\t\ttry{\n\t\t\t\tdin = new DataInputStream(in);\n\t\t\t} catch(Exception e) {\n\t\t\t\tthrow new RuntimeException();\n\t\t\t}\n\t\t\tbuffer = new byte[BUFFER_SIZE];\n\t\t\tbufferPointer = bytesRead = 0;\n\t\t}\n\t\tpublic String next() {\n\t\t\tint c;\n\t\t\twhile((c=read())!=-1&&(c==' '||c=='\\n'||c=='\\r'));\n\t\t\tStringBuilder s = new StringBuilder();\n\t\t\twhile (c != -1)\n\t\t\t{\n\t\t\t\tif (c == ' ' || c == '\\n'||c=='\\r')\n\t\t\t\t\tbreak;\n\t\t\t\ts.append((char)c);\n\t\t\t\tc=read();\n\t\t\t}\n\t\t\treturn s.toString();\n\t\t}\n\t\tpublic String nextLine() {\n\t\t\tint c;\n\t\t\twhile((c=read())!=-1&&(c==' '||c=='\\n'||c=='\\r'));\n\t\t\tStringBuilder s = new StringBuilder();\n\t\t\twhile (c != -1)\n\t\t\t{\n\t\t\t\tif (c == '\\n'||c=='\\r')\n\t\t\t\t\tbreak;\n\t\t\t\ts.append((char)c);\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\treturn s.toString();\n\t\t}\n\t\tpublic int nextInt() {\n\t\t\tint ret = 0;\n\t\t\tbyte c = read();\n\t\t\twhile (c <= ' ')\n\t\t\t\tc = read();\n\t\t\tboolean neg = (c == '-');\n\t\t\tif (neg)\n\t\t\t\tc = read();\n\t\t\tdo\n\t\t\t\tret = ret * 10 + c - '0';\n\t\t\twhile ((c = read()) >= '0' && c <= '9');\n\n\t\t\tif (neg)\n\t\t\t\treturn -ret;\n\t\t\treturn ret;\n\t\t}\n\t\tpublic int[] readIntArray(int n) {\n\t\t\tint[] ar = new int[n];\n\t\t\tfor(int i=0; i<n; ++i)\n\t\t\t\tar[i]=nextInt();\n\t\t\treturn ar;\n\t\t}\n\t\tpublic long nextLong() {\n\t\t\tlong ret = 0;\n\t\t\tbyte c = read();\n\t\t\twhile (c <= ' ')\n\t\t\t\tc = read();\n\t\t\tboolean neg = (c == '-');\n\t\t\tif (neg)\n\t\t\t\tc = read();\n\t\t\tdo\n\t\t\t\tret = ret * 10 + c - '0';\n\t\t\twhile ((c = read()) >= '0' && c <= '9');\n\t\t\tif (neg)\n\t\t\t\treturn -ret;\n\t\t\treturn ret;\n\t\t}\n\t\tpublic long[] readLongArray(int n) {\n\t\t\tlong[] ar = new long[n];\n\t\t\tfor(int i=0; i<n; ++i)\n\t\t\t\tar[i]=nextLong();\n\t\t\treturn ar;\n\t\t}\n\t\tpublic double nextDouble() {\n\t\t\tdouble ret = 0, div = 1;\n\t\t\tbyte c = read();\n\t\t\twhile (c <= ' ')\n\t\t\t\tc = read();\n\t\t\tboolean neg = (c == '-');\n\t\t\tif (neg)\n\t\t\t\tc = read();\n\t\t\tdo\n\t\t\t\tret = ret * 10 + c - '0';\n\t\t\twhile ((c = read()) >= '0' && c <= '9');\n\t\t\tif (c == '.')\n\t\t\t\twhile ((c = read()) >= '0' && c <= '9')\n\t\t\t\t\tret += (c - '0') / (div *= 10);\n\t\t\tif (neg)\n\t\t\t\treturn -ret;\n\t\t\treturn ret;\n\t\t}\n\t\tprivate void fillBuffer() throws IOException {\n\t\t\tbytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n\t\t\tif (bytesRead == -1)\n\t\t\t\tbuffer[0] = -1;\n\t\t}\n\t\tprivate byte read() {\n\t\t\ttry{\n\t\t\t\tif (bufferPointer == bytesRead)\n\t\t\t\t\tfillBuffer();\n\t\t\t\treturn buffer[bufferPointer++];\n\t\t\t} catch(IOException e) {\n\t\t\t\tthrow new RuntimeException();\n\t\t\t}\n\t\t}\n\t\tpublic void close() throws IOException {\n\t\t\tif (din == null)\n\t\t\t\treturn;\n\t\t\tdin.close();\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["math", "combinatorics", "number theory"], "code_uid": "cd59cf298e29f38a4241aee032ec1b52", "src_uid": "6ddc487029785738679007443fc08463", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.util.Collection;\nimport java.io.IOException;\nimport java.util.Deque;\nimport java.util.ArrayList;\nimport java.io.UncheckedIOException;\nimport java.util.List;\nimport java.io.Closeable;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.ArrayDeque;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) throws Exception {\n Thread thread = new Thread(null, new TaskAdapter(), \"\", 1 << 27);\n thread.start();\n thread.join();\n }\n\n static class TaskAdapter implements Runnable {\n @Override\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastInput in = new FastInput(inputStream);\n FastOutput out = new FastOutput(outputStream);\n FWrapAround solver = new FWrapAround();\n solver.solve(1, in, out);\n out.close();\n }\n }\n\n static class FWrapAround {\n ACAutomaton.Node end;\n ACAutomaton.Node begin;\n int n;\n char[] s;\n ACAutomaton.Node[] nodes;\n ACAutomaton at;\n\n public void solve(int testNumber, FastInput in, FastOutput out) {\n n = in.readInt();\n s = in.readString().toCharArray();\n at = new ACAutomaton('0', '1');\n at.beginBuilding();\n for (char c : s) {\n at.build(c);\n }\n at.endBuilding();\n end = at.getBuildLast();\n nodes = at.getAllNodes().toArray(new ACAutomaton.Node[0]);\n begin = nodes[0];\n\n long ans = 0;\n for (int i = 0; i < n; i++) {\n ans += way(i);\n }\n\n out.println(ans);\n }\n\n public long pow(long x, long n) {\n if (n == 0) {\n return 1;\n }\n long ans = pow(x, n / 2);\n ans *= ans;\n if (n % 2 == 1) {\n ans *= x;\n }\n return ans;\n }\n\n public long way(int offset) {\n char[] data = new char[1 + 2 * n];\n for (int i = 0; i < s.length; i++) {\n data[1 + i + offset] = s[i];\n data[1 + (i + offset) % n] = s[i];\n }\n int dpLen = offset + s.length;\n long[][] dp = new long[dpLen + 1][nodes.length];\n dp[0][begin.getId()] = 1;\n for (int i = 0; i < dpLen; i++) {\n for (int j = 0; j < nodes.length; j++) {\n if (dp[i][j] == 0 || j == end.getId()) {\n continue;\n }\n if (data[i + 1] == 0) {\n dp[i + 1][nodes[j].next[0].getId()] += dp[i][j];\n dp[i + 1][nodes[j].next[1].getId()] += dp[i][j];\n } else {\n dp[i + 1][nodes[j].next[data[i + 1] - '0'].getId()] += dp[i][j];\n }\n }\n }\n long ans = dp[dpLen][end.getId()];\n if (offset + s.length < n) {\n ans *= pow(2, n - offset - s.length);\n }\n return ans;\n }\n\n }\n\n static class FastOutput implements AutoCloseable, Closeable {\n private StringBuilder cache = new StringBuilder(10 << 20);\n private final Writer os;\n\n public FastOutput(Writer os) {\n this.os = os;\n }\n\n public FastOutput(OutputStream os) {\n this(new OutputStreamWriter(os));\n }\n\n public FastOutput println(long c) {\n cache.append(c);\n println();\n return this;\n }\n\n public FastOutput println() {\n cache.append(System.lineSeparator());\n return this;\n }\n\n public FastOutput flush() {\n try {\n os.append(cache);\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n return this;\n }\n\n public void close() {\n flush();\n try {\n os.close();\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n\n public String toString() {\n return cache.toString();\n }\n\n }\n\n static class FastInput {\n private final InputStream is;\n private StringBuilder defaultStringBuf = new StringBuilder(1 << 13);\n private byte[] buf = new byte[1 << 13];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastInput(InputStream is) {\n this.is = is;\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n bufLen = -1;\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public int readInt() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n public String readString(StringBuilder builder) {\n skipBlank();\n\n while (next > 32) {\n builder.append((char) next);\n next = read();\n }\n\n return builder.toString();\n }\n\n public String readString() {\n defaultStringBuf.setLength(0);\n return readString(defaultStringBuf);\n }\n\n }\n\n static class ACAutomaton {\n private final int MIN_CHARACTER;\n private final int MAX_CHARACTER;\n private final int RANGE;\n private ACAutomaton.Node root;\n private ACAutomaton.Node buildLast;\n private List<ACAutomaton.Node> allNodes = new ArrayList();\n\n public ACAutomaton.Node getBuildLast() {\n return buildLast;\n }\n\n public List<ACAutomaton.Node> getAllNodes() {\n return allNodes;\n }\n\n private ACAutomaton.Node addNode() {\n ACAutomaton.Node node = new ACAutomaton.Node(RANGE);\n node.id = allNodes.size();\n allNodes.add(node);\n return node;\n }\n\n public ACAutomaton(int minCharacter, int maxCharacter) {\n MIN_CHARACTER = minCharacter;\n MAX_CHARACTER = maxCharacter;\n RANGE = maxCharacter - minCharacter + 1;\n root = addNode();\n }\n\n public void beginBuilding() {\n buildLast = root;\n }\n\n public void endBuilding() {\n Deque<ACAutomaton.Node> deque = new ArrayDeque(allNodes.size());\n for (int i = 0; i < RANGE; i++) {\n if (root.next[i] != null) {\n deque.addLast(root.next[i]);\n }\n }\n\n while (!deque.isEmpty()) {\n ACAutomaton.Node head = deque.removeFirst();\n ACAutomaton.Node fail = visit(head.father.fail, head.index);\n if (fail == null) {\n head.fail = root;\n } else {\n head.fail = fail.next[head.index];\n }\n head.preSum = head.cnt + head.fail.preSum;\n for (int i = 0; i < RANGE; i++) {\n if (head.next[i] != null) {\n deque.addLast(head.next[i]);\n }\n }\n }\n\n for (int i = 0; i < RANGE; i++) {\n if (root.next[i] != null) {\n deque.addLast(root.next[i]);\n } else {\n root.next[i] = root;\n }\n }\n while (!deque.isEmpty()) {\n ACAutomaton.Node head = deque.removeFirst();\n for (int i = 0; i < RANGE; i++) {\n if (head.next[i] != null) {\n deque.addLast(head.next[i]);\n } else {\n head.next[i] = head.fail.next[i];\n }\n }\n }\n }\n\n public ACAutomaton.Node visit(ACAutomaton.Node trace, int index) {\n while (trace != null && trace.next[index] == null) {\n trace = trace.fail;\n }\n return trace;\n }\n\n public void build(char c) {\n int index = c - MIN_CHARACTER;\n if (buildLast.next[index] == null) {\n ACAutomaton.Node node = addNode();\n node.father = buildLast;\n node.index = index;\n buildLast.next[index] = node;\n }\n buildLast = buildLast.next[index];\n }\n\n public static class Node {\n public ACAutomaton.Node[] next;\n ACAutomaton.Node fail;\n ACAutomaton.Node father;\n int index;\n int id;\n int cnt;\n int preSum;\n\n public int getId() {\n return id;\n }\n\n public Node(int range) {\n next = new ACAutomaton.Node[range];\n }\n\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["strings", "dp"], "code_uid": "76151e98b77c50d3b9ccdabb1c7f090c", "src_uid": "0034806908c9794086736a2d07fc654c", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\nimport static java.util.Arrays.fill;\n\n/**\n * @author Don Li\n */\npublic class WrapAround2 {\n \n int N = 41;\n \n int n, m;\n char[] s;\n \n int[] f;\n long[][][][] dp = new long[N][N][N][2];\n \n void solve() {\n n = in.nextInt();\n s = in.nextToken().toCharArray();\n m = s.length;\n \n f = fail(s);\n \n for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) for (int k = 0; k < N; k++) fill(dp[i][j][k], -1);\n \n long ans = 0;\n for (int i = 0; i <= m; i++) {\n ans += dfs(n, i, i, 0);\n }\n out.println(ans);\n }\n \n long dfs(int rem, int cur, int tar, int has) {\n if (cur == m) has = 1;\n \n if (rem == 0) {\n return cur == tar && has > 0 ? 1 : 0;\n }\n \n if (dp[rem][cur][tar][has] >= 0) return dp[rem][cur][tar][has];\n \n long ans = 0;\n for (char x = '0'; x <= '1'; x++) {\n int nxt = next(cur, x);\n ans += dfs(rem - 1, nxt, tar, has);\n }\n return dp[rem][cur][tar][has] = ans;\n }\n \n int next(int now, char x) {\n if (now == m) now = f[now];\n while (now > 0 && s[now] != x) now = f[now];\n return s[now] == x ? now + 1 : 0;\n }\n \n int[] fail(char[] s) {\n int n = s.length;\n int[] f = new int[n + 1];\n f[0] = f[1] = 0;\n for (int i = 2; i <= n; i++) {\n int j = f[i - 1];\n while (j > 0 && s[j] != s[i - 1]) j = f[j];\n f[i] = s[j] == s[i - 1] ? j + 1 : 0;\n }\n return f;\n }\n \n public static void main(String[] args) {\n in = new FastScanner(new BufferedReader(new InputStreamReader(System.in)));\n out = new PrintWriter(System.out);\n new WrapAround2().solve();\n out.close();\n }\n \n static FastScanner in;\n static PrintWriter out;\n \n static class FastScanner {\n BufferedReader in;\n StringTokenizer st;\n \n public FastScanner(BufferedReader in) {\n this.in = in;\n }\n \n public String nextToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(in.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n \n public int nextInt() {\n return Integer.parseInt(nextToken());\n }\n \n public long nextLong() {\n return Long.parseLong(nextToken());\n }\n \n public double nextDouble() {\n return Double.parseDouble(nextToken());\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["strings", "dp"], "code_uid": "33f91047789a95d73cf8b54154fc88fd", "src_uid": "0034806908c9794086736a2d07fc654c", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.*;\n\n/**\n * @author Don Li\n */\npublic class WrapAround {\n \n int N = 41;\n \n int n, m;\n String s;\n long ans = 0;\n \n Map<String, Integer> str_to_idx = new HashMap<>(); \n List<String> subs = new ArrayList<>(N * N); \n Set<String> pref = new HashSet<>(); \n \n long[][][][] dp = new long[N][2][N][N * N];\n \n void solve() {\n n = in.nextInt();\n s = in.nextToken();\n m = s.length();\n \n str_to_idx.put(\"\", 0);\n subs.add(\"\");\n pref.add(\"\");\n for (int i = 0; i < m; i++) {\n for (int j = i; j < m; j++) {\n String sub = s.substring(i, j + 1);\n if (!str_to_idx.containsKey(sub)) {\n str_to_idx.put(sub, str_to_idx.size());\n subs.add(sub);\n }\n if (i == 0) pref.add(sub);\n }\n }\n \n dp[0][0][0][0] = 1;\n for (int i = 0; i <= n; i++) {\n for (int j = 0; j < 2; j++) {\n for (int k = 0; k <= n; k++) {\n for (int l = 0; l < subs.size(); l++) {\n dfs(i, j, k, l);\n }\n }\n }\n }\n out.println(ans);\n }\n \n void dfs(int len, int has, int pre, int suf) {\n if (dp[len][has][pre][suf] == 0) return;\n if (len == n) {\n if (has > 0) {\n ans += dp[len][has][pre][suf];\n } else {\n String cur = s.substring(0, pre) + subs.get(suf);\n if (cur.contains(s)) ans += dp[len][has][pre][suf];\n }\n return;\n }\n add(len, has, pre, suf, 0);\n add(len, has, pre, suf, 1);\n }\n \n void add(int len, int has, int pre, int suf, int x) {\n String cur = s.substring(0, pre) + x;\n while (!pref.contains(cur)) cur = cur.substring(1);\n int nhas = has;\n if (cur.length() == s.length()) nhas = 1;\n int npre = cur.length();\n cur = subs.get(suf) + x;\n int nsuf = suf;\n if (cur.length() == len + 1 && str_to_idx.containsKey(cur)) nsuf = str_to_idx.get(cur);\n dp[len + 1][nhas][npre][nsuf] += dp[len][has][pre][suf];\n }\n \n public static void main(String[] args) {\n in = new FastScanner(new BufferedReader(new InputStreamReader(System.in)));\n out = new PrintWriter(System.out);\n new WrapAround().solve();\n out.close();\n }\n \n static FastScanner in;\n static PrintWriter out;\n \n static class FastScanner {\n BufferedReader in;\n StringTokenizer st;\n \n public FastScanner(BufferedReader in) {\n this.in = in;\n }\n \n public String nextToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(in.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n \n public int nextInt() {\n return Integer.parseInt(nextToken());\n }\n \n public long nextLong() {\n return Long.parseLong(nextToken());\n }\n \n public double nextDouble() {\n return Double.parseDouble(nextToken());\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["strings", "dp"], "code_uid": "017d00147843ed63015205e3bb34a321", "src_uid": "0034806908c9794086736a2d07fc654c", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class Crocodile implements Runnable {\n private void solve() throws IOException {\n int m = nextInt();\n int n = nextInt();\n int mx = Math.max(n, m);\n double[][] ans = new double[mx + 1][mx + 1];\n for (int sum = 0; sum <= mx + mx; ++sum) {\n for (int a = 0; a <= mx; ++a) {\n int b = sum - a;\n if (b >= 0 && b <= mx) {\n ans[a][b] = doit(a, b, ans);\n }\n }\n }\n writer.println(ans[m][n] + \" \" + (1.0 - ans[m][n]));\n }\n\n private double doit(int m, int n, double[][] ans) {\n double res = 1.0 / (n + 1);\n if (m == 0 || n == 0) return res;\n double borderP = 1 / (ans[n][m - 1] * (n + 1) + 1);\n res = Math.max(res, eval(m, n, ans, 0.0));\n res = Math.max(res, eval(m, n, ans, borderP));\n res = Math.max(res, eval(m, n, ans, 1.0));\n return res;\n }\n\n private double eval(int m, int n, double[][] ans, double p) {\n return (1 - p) * n / (n + 1.0) * (1 - ans[n - 1][m]) + (p + (1 - p) / (n + 1.0) - Math.max((1 - p) / (n + 1), p * ans[n][m - 1]));\n }\n\n public static void main(String[] args) {\n new Crocodile().run();\n }\n\n BufferedReader reader;\n StringTokenizer tokenizer;\n PrintWriter writer;\n\n public void run() {\n try {\n reader = new BufferedReader(new InputStreamReader(System.in));\n tokenizer = null;\n writer = new PrintWriter(System.out);\n solve();\n reader.close();\n writer.close();\n } catch (Exception e) {\n e.printStackTrace();\n System.exit(1);\n }\n }\n\n int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n\n long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n\n double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n\n String nextToken() throws IOException {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n tokenizer = new StringTokenizer(reader.readLine());\n }\n return tokenizer.nextToken();\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "dp", "probabilities", "games"], "code_uid": "c4b10dc60ac4621201db525b92fb2cef", "src_uid": "f51586ab88399c04ffb7eaa658d294dd", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.Arrays;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.Random;\nimport java.util.HashMap;\nimport java.io.BufferedReader;\nimport java.util.Map;\nimport java.io.PrintStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.IOException;\nimport java.util.StringTokenizer;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskE solver = new TaskE();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskE {\n static final int MODULO = 10007;\n int magic;\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n String s = in.next();\n int n = in.nextInt() + s.length();\n int[][][] ways = new int[s.length()][s.length() + 1][s.length() / 2 + 2];\n int[][] waysAll = new int[3][s.length() / 2 + 2];\n ways[0][s.length()][0] = 1;\n for (int start = 0; start < s.length(); ++start)\n for (int len = s.length() - start; len >= 1; --len) {\n int[] src = ways[start][len];\n if (s.charAt(start) == s.charAt(start + len - 1)) {\n int nlen = len - 2;\n int[] dest;\n if (nlen <= 0) {\n dest = waysAll[len];\n } else {\n dest = ways[start + 1][nlen];\n }\n for (int doubles = 0; doubles < src.length; ++doubles) if (src[doubles] != 0) {\n dest[doubles + 1] = (dest[doubles + 1] + src[doubles]) % MODULO;\n }\n } else {\n int nlen = len - 1;\n int[] dest = ways[start][nlen];\n for (int doubles = 0; doubles < src.length; ++doubles) if (src[doubles] != 0) {\n dest[doubles] = (dest[doubles] + src[doubles]) % MODULO;\n }\n dest = ways[start + 1][nlen];\n for (int doubles = 0; doubles < src.length; ++doubles) if (src[doubles] != 0) {\n dest[doubles] = (dest[doubles] + src[doubles]) % MODULO;\n }\n }\n }\n int steps = n / 2;\n int ret = 0;\n int maxSingles = s.length();\n int maxDoubles = waysAll[1].length - 1;\n int size = maxSingles + maxDoubles + maxDoubles;\n magic = maxDoubles + maxSingles;\n int[][] m = new int[size][size];\n for (int i = 0; i < maxSingles + maxDoubles + maxDoubles; ++i) {\n if (i + 1 < maxSingles + maxDoubles) m[i + 1][i] = 1;\n if (i >= maxSingles && i < maxSingles + maxDoubles) m[i + maxDoubles][i] = 1;\n m[i][i] = (i < maxSingles ? 24 : (i < maxSingles + maxDoubles ? 25 : 26));\n }\n m = pow(m, steps);\n for (int last = 1; last <= 2; ++last) {\n for (int doubles = 0; doubles < waysAll[last].length; ++doubles) {\n int w = waysAll[last][doubles];\n if (w != 0) {\n int singles = s.length() + (last == 1 ? 1 : 0) - 2 * doubles;\n if (n % 2 == 0) {\n ret = (int) ((ret + (long) w * m[maxSingles + maxDoubles + doubles - 1][maxSingles - singles]) % MODULO);\n } else {\n ret = (int) ((ret + (long) w * m[maxSingles + maxDoubles + doubles - 1][maxSingles - singles] * 26) % MODULO);\n if (last == 1) {\n ret = (int) ((ret + (long) w * m[maxSingles + doubles - 1][maxSingles - singles]) % MODULO);\n }\n }\n }\n }\n }\n out.println(ret);\n }\n\n private int[][] pow(int[][] m, int k) {\n int[][] res = new int[m.length][m.length];\n for (int i = 0; i < m.length; ++i) res[i][i] = 1;\n while (k > 0) {\n System.err.println(k + \" \" + m.length);\n if (k % 2 != 0) {\n res = mul(m, res);\n }\n k /= 2;\n m = mul(m, m);\n }\n return res;\n }\n\n private final int BIG = Integer.MAX_VALUE - Integer.MAX_VALUE % MODULO;\n\n private int[][] mul(int[][] a, int[][] b) {\n int n = a.length;\n int[][] c = new int[n][n];\n for (int i = 0; i < c.length; ++i) {\n for (int j = 0; j < magic; ++j) {\n int s = 0;\n for (int k = 0; k < magic; ++k) {\n s += a[i][k] * b[k][j];\n if (s < 0)\n s -= BIG;\n }\n if (i >= magic) {\n int k = i;\n s += a[i][k] * b[k][j];\n if (s < 0)\n s -= BIG;\n }\n c[i][j] = s % MODULO;\n }\n if (i >= magic) {\n int j = i;\n int s = 0;\n for (int k = 0; k < magic; ++k) {\n s += a[i][k] * b[k][j];\n if (s < 0)\n s -= BIG;\n }\n if (i >= magic) {\n int k = i;\n s += a[i][k] * b[k][j];\n if (s < 0)\n s -= BIG;\n }\n c[i][j] = s % MODULO;\n }\n }\n return c;\n }\n\n}\n\nclass InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n}\n\n", "lang_cluster": "Java", "tags": ["matrices", "strings", "dp", "combinatorics"], "code_uid": "405095934b9a9ef05a44d334120f6ae6", "src_uid": "2ae6f17e0dd0bc93090d939f4f49d7a8", "difficulty": 3000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.Random;\n\npublic class CF506E {\n\n final static int MOD = 10007;\n\n static int[][] mul(int[][] a, int[][] b) {\n int[][] c = new int[a.length][a.length];\n for (int i = 0; i < a.length; ++i) {\n for (int j = i; j < a.length; ++j) {\n long sum = 0;\n for (int k = i; k <= j; ++k) {\n sum += a[i][k] * b[k][j];\n }\n c[i][j] = (int) (sum % MOD);\n }\n }\n return c;\n }\n\n static int[][] pow(int[][] a, long pow) {\n int[][] r = new int[a.length][a.length];\n for (int i = 0; i < a.length; ++i) {\n r[i][i] = 1;\n }\n while (pow > 0) {\n if (pow % 2 == 1) {\n r = mul(r, a);\n }\n pow /= 2;\n a = mul(a, a);\n }\n return r;\n }\n\n public static void solve(Input in, PrintWriter out) throws IOException {\n String s = in.next();\n int n = s.length();\n int k = n + in.nextInt();\n int ans = solveFast(s, k);\n out.println(ans);\n }\n\n private static int solveFast(String s, int k) {\n int n = s.length();\n int[][][] d = new int[n + 1][n + 1][n + 1];\n d[0][n][0] = 1;\n for (int len = n; len > 0; --len) {\n for (int i = 0; i + len <= n; ++i) {\n for (int u = 0; u <= n; ++u) {\n if (d[i][i + len][u] != 0) {\n if (s.charAt(i) == s.charAt(i + len - 1)) {\n d[i + 1][i + len - 1][u + 1] = (d[i + 1][i + len - 1][u + 1] + d[i][i + len][u]) % MOD;\n } else {\n d[i + 1][i + len][u] = (d[i + 1][i + len][u] + d[i][i + len][u]) % MOD;\n d[i][i + len - 1][u] = (d[i][i + len - 1][u] + d[i][i + len][u]) % MOD;\n }\n }\n }\n }\n }\n int[][] d1 = new int[n + 1][n + 1];\n int[][] d2 = new int[n + 1][n + 1];\n for (int i = 0; i < n; ++i) {\n for (int u = 0; 2 * u <= n; ++u) {\n d1[u][n - 2 * u] += d[i][i][u];\n if (2 * u <= n - 1) {\n d2[u][n - 2 * u - 1] += d[i][i + 1][u];\n }\n }\n }\n int ans = 0;\n int[][] a0 = new int[501][501];\n for (int i = 0; i < 100; ++i) {\n a0[i][i] = 25;\n a0[i][i + 1] = 1;\n if (i + 1 == 100) {\n a0[i][300] = 1;\n }\n }\n for (int i = 100; i < 300; ++i) {\n a0[i][i] = 24;\n if (i + 1 != 300) {\n a0[i][i + 1] = 1;\n }\n a0[i][200 + i + 1] = 1;\n }\n for (int i = 300; i <= 500; ++i) {\n a0[i][i] = 26;\n }\n int[][] a0low = pow(a0, k / 2);\n int[][] a0high = k % 2 == 1 ? mul(a0low, a0) : a0low;\n for (int u = 0; u <= n; ++u) {\n for (int v = 0; v <= n; ++v) {\n if (d1[u][v] != 0) { // aa\n d1[u][v] %= MOD;\n int cur = a0low[100 - u][300 + v];\n if (k % 2 == 1) {\n cur = cur * 26 % MOD;\n }\n ans = (ans + d1[u][v] * cur) % MOD;\n// System.err.println(\"d1: \" + u + \" \" + v + \" \" + d1[u][v] + \" \" + cur);\n }\n if (d2[u][v] != 0) { // a\n d2[u][v] %= MOD;\n int cur = a0high[100 - u - 1][300 + v];\n ans = (ans + d2[u][v] * cur) % MOD;\n// System.err.println(\"d2: \" + u + \" \" + v + \" \" + d2[u][v] + \" \" + cur);\n }\n }\n }\n return ans;\n }\n\n private static int solveSlow(String s, int k) {\n int n = s.length();\n int[][] d = new int[n + 1][n + 1];\n d[0][n] = 1;\n for (int it = 0; it < k / 2; ++it) {\n int[][] d1 = new int[n + 1][n + 1];\n for (int len = n; len > 0; --len) {\n for (int i = 0; i + len <= n; ++i) {\n if (d[i][i + len] != 0) {\n if (s.charAt(i) == s.charAt(i + len - 1)) {\n d1[Math.min(i + 1, i + len - 1)][i + len - 1] = (d1[Math.min(i + 1, i + len - 1)][i + len - 1] + d[i][i + len]) % MOD;\n d1[i][i + len] = (d1[i][i + len] + d[i][i + len] * 25) % MOD;\n } else {\n d1[i + 1][i + len] = (d1[i + 1][i + len] + d[i][i + len]) % MOD;\n d1[i][i + len - 1] = (d1[i][i + len - 1] + d[i][i + len]) % MOD;\n d1[i][i + len] = (d1[i][i + len] + d[i][i + len] * 24) % MOD;\n }\n }\n }\n }\n for (int i = 0; i <= n; ++i) {\n d1[i][i] = (d1[i][i] + d[i][i] * 26) % MOD;\n }\n d = d1;\n }\n int ans = 0;\n for (int i = 0; i < n; ++i) {\n if (k % 2 == 0) {\n ans += d[i][i];\n } else {\n ans += d[i][i] * 26 + d[i][i + 1];\n }\n }\n return ans % MOD;\n }\n\n /*\n0 78\n0 76\n6624 57\n8739 55\n0 123\n0 93\n0 99\n1871 122\n6968 75\n8247 1\n0 79\n3404 10\n0 19\n0 85\n4715 23\n8609 1\n1910 86\n721 113\n4055 12\n659 82\n0 115\n0 53\n944 57\n9422 11\n\n\n */\n\n public static void main(String[] args) throws IOException {\n PrintWriter out = new PrintWriter(System.out);\n Random rnd = new Random(42);\n// while (rnd != null) {\n// int n = 50;\n// StringBuilder sb = new StringBuilder();\n// for (int i = 0; i < n; ++i) {\n// sb.append((char)('a' + rnd.nextInt(26)));\n// }\n// int k = rnd.nextInt(100) + n;\n// int ans1 = solveSlow(sb.toString(), k);\n// int ans2 = solveFast(sb.toString(), k);\n// if (ans1 != ans2) {\n// System.err.println(sb + \" \" + k);\n// System.err.println(ans1 + \" \" + ans2);\n// throw new AssertionError();\n// }\n//// sb.append(\"\\n\");\n//// sb.append(rnd.nextInt(100));\n//// solve(new Input(sb.toString()), out);\n//// return;\n// }\n solve(new Input(new BufferedReader(new InputStreamReader(System.in))), out);\n out.close();\n }\n\n static class Input {\n BufferedReader in;\n StringBuilder sb = new StringBuilder();\n\n public Input(BufferedReader in) {\n this.in = in;\n }\n\n public Input(String s) {\n this.in = new BufferedReader(new StringReader(s));\n }\n\n public String next() throws IOException {\n sb.setLength(0);\n while (true) {\n int c = in.read();\n if (c == -1) {\n return null;\n }\n if (\" \\n\\r\\t\".indexOf(c) == -1) {\n sb.append((char)c);\n break;\n }\n }\n while (true) {\n int c = in.read();\n if (c == -1 || \" \\n\\r\\t\".indexOf(c) != -1) {\n break;\n }\n sb.append((char)c);\n }\n return sb.toString();\n }\n\n public int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n public long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n public double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["matrices", "strings", "dp", "combinatorics"], "code_uid": "6531eaeace504a339f256f7251e3ea2d", "src_uid": "2ae6f17e0dd0bc93090d939f4f49d7a8", "difficulty": 3000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\npublic class Main{\n\tstatic int[] p, rank, treeNode,adj[];\n\tstatic boolean[]root;\n\tstatic int N;\n\tstatic int lastNode=0;\n\tstatic void preProcessDSU(int n) {\n\t\tN=n;\n\t\tp = new int[N];\n\t\trank = new int[N];\n\t\ttreeNode = new int[N];\n\t\troot=new boolean[N<<1];\n\t\tadj=new int[N<<1][2];\n\t\t\n\t\tfor (int i = 0; i < N; i++) { \n\t\t\tp[i] = i; treeNode[i] = lastNode++; root[i]=true;\n\t\t\tadj[i<<1][0]=adj[i<<1][1]=adj[i<<1|1][0]=adj[i<<1|1][1]=-1;\n\t\t}\n\t}\n\tpublic static int findSet(int i) { return p[i] == i ? i : (p[i] = findSet(p[i])); }\n\t\n\tpublic static boolean isSameSet(int i, int j) { return findSet(i) == findSet(j); }\n\t\n\tpublic static void unionSet(int i, int j) \n\t{ \n\t\tif (isSameSet(i, j)) \n\t\t\treturn;\n\t\tint x = findSet(i), y = findSet(j);\n\t\t\n\t\tint u=treeNode[x],v=treeNode[y];\n\t\troot[u]=false;root[v]=false;\n\t\tint newRoot=lastNode++;\n\t\troot[newRoot]=true;\n\t\tadj[newRoot][0]=u;adj[newRoot][1]=v;\n\t\t\n\t\tif(rank[x] > rank[y]) { p[y] = x; treeNode[x]=newRoot;}\n\t\telse\n\t\t{\tp[x] = y; treeNode[y]=newRoot;\n\t\t\tif(rank[x] == rank[y]) rank[y]++; \n\t\t} \n\t\t\n\t}\n\tstatic int time,tin[],tout[];\n\tstatic void dfs(int i) {\n\t\ttin[i]=++time;\n\t\tfor(int j:adj[i]) {\n\t\t\tif(j==-1)continue;\n\t\t\tdfs(j);\n\t\t}\n\t\ttout[i]=time;\n\t}\n\tstatic int[]segTree,index;\n\tstatic void updatePoint(int idx) {\n\t\tupdatePoint(1, 1, time, idx);\n\t}\n\tstatic void updatePoint(int node,int l,int r,int idx) {\n\t\tif(l==r) {\n\t\t\tsegTree[node]=0;\n\t\t\treturn;\n\t\t}\n\t\tint mid=(l+r)>>1;\n\t\tif(idx<=mid) {\n\t\t\tupdatePoint(node<<1, l, mid, idx);\n\t\t}\n\t\telse {\n\t\t\tupdatePoint(node<<1|1, mid+1, r, idx);\n\t\t}\n\t\tif(segTree[node<<1|1]>segTree[node<<1]) {\n\t\t\tsegTree[node]=segTree[node<<1|1];\n\t\t\tindex[node]=index[node<<1|1];\n\t\t}\n\t\telse {\n\t\t\tsegTree[node]=segTree[node<<1];\n\t\t\tindex[node]=index[node<<1];\n\t\t}\n\t}\n\tstatic int[] query(int l,int r) {\n\t\treturn query(1, 1, time,l,r);\n\t}\n\tstatic int[] query(int node,int curL,int curR,int l,int r) {\n\t\tif(curR<l || curL>r)return new int[] {-1,-1};\n\t\tif(curL>=l && curR<=r) {\n\t\t\treturn new int[] {segTree[node],index[node]};\n\t\t}\n\t\tint mid=(curL+curR)>>1;\n\t\tint[]q1=query(node<<1, curL, mid, l, r),q2=query(node<<1|1, mid+1, curR, l, r);\n\t\tif(q1[0]>q2[0]) {\n\t\t\treturn q1;\n\t\t}\n\t\treturn q2;\n\t}\n\tstatic void insert(int idx,int val) {\n\t\tinsert(1, 1, time, idx,val);\n\t}\n\tstatic void insert(int node,int l,int r,int idx,int val) {\n\t\tif(l==r) {\n\t\t\tsegTree[node]=val;\n\t\t\tindex[node]=idx;\n\t\t\treturn;\n\t\t}\n\t\tint mid=(l+r)>>1;\n\t\tif(idx<=mid) {\n\t\t\tinsert(node<<1, l, mid, idx,val);\n\t\t}\n\t\telse {\n\t\t\tinsert(node<<1|1, mid+1, r, idx,val);\n\t\t}\n\t\tif(segTree[node<<1|1]>segTree[node<<1]) {\n\t\t\tsegTree[node]=segTree[node<<1|1];\n\t\t\tindex[node]=index[node<<1|1];\n\t\t}\n\t\telse {\n\t\t\tsegTree[node]=segTree[node<<1];\n\t\t\tindex[node]=index[node<<1];\n\t\t}\n\t}\n\tstatic void main() throws Exception{\n\t\tint n=sc.nextInt(),m=sc.nextInt(),q=sc.nextInt();\n\t\tint[]vals=sc.intArr(n);\n\t\tint[][]edges=new int[m][];\n\t\tfor(int i=0;i<m;i++) {\n\t\t\tedges[i]=new int[] {sc.nextInt()-1,sc.nextInt()-1};\n\t\t}\n\t\tint[][]qs=new int[q][];\n\t\tboolean[]edgeRemoved=new boolean[m];\n\t\tfor(int i=0;i<q;i++) {\n\t\t\tqs[i]=new int[] {sc.nextInt(),sc.nextInt()-1};\n\t\t\tif(qs[i][0]==2) {\n\t\t\t\tedgeRemoved[qs[i][1]]=true;\n\t\t\t}\n\t\t}\n\t\tpreProcessDSU(n);\n\t\tfor(int i=0;i<m;i++) {\n\t\t\tif(!edgeRemoved[i]) {\n\t\t\t\tunionSet(edges[i][0], edges[i][1]);\n\t\t\t}\n\t\t}\n\t\tint[]subtreeRoot=new int[q];\n\t\tfor(int i=q-1;i>=0;i--) {\n\t\t\tif(qs[i][0]==1) {\n\t\t\t\tsubtreeRoot[i]=treeNode[findSet(qs[i][1])];\n\t\t\t}\n\t\t\telse {\n\t\t\t\tint edge=qs[i][1];\n\t\t\t\tunionSet(edges[edge][0], edges[edge][1]);\n\t\t\t}\n\t\t}\n\t\ttin=new int[n<<1];\n\t\ttout=new int[n<<1];\n\t\tfor(int i=0;i<lastNode;i++) {\n\t\t\tif(root[i]) {\n\t\t\t\tdfs(i);\n\t\t\t}\n\t\t}\n\t\tsegTree=new int[time<<2];\n\t\tArrays.fill(segTree, -1);\n\t\tindex=new int[time<<2];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tinsert(tin[i], vals[i]);\n\t\t}\n\t\tfor(int i=0;i<q;i++) {\n\t\t\tif(qs[i][0]==1) {\n\t\t\t\tint curRoot=subtreeRoot[i];\n\t\t\t\tint left=tin[curRoot],right=tout[curRoot];\n\t\t\t\tint[]curQ=query(left, right);\n\t\t\t\tpw.println(curQ[0]);\n\t\t\t\tif(curQ[1]>0)\n\t\t\t\t\tupdatePoint(curQ[1]);\n\t\t\t}\n\t\t}\n\t}\n\tpublic static void main(String[] args) throws Exception{\n\t\tsc=new MScanner(System.in);\n\t\tpw = new PrintWriter(System.out);\n\t\tint tc=1;\n//\t\ttc=sc.nextInt();\n\t\twhile(tc-->0)\n\t\t\tmain();\n\t\tpw.flush();\n\t}\n\tstatic PrintWriter pw;\n\tstatic MScanner sc;\n\tstatic class MScanner {\n\t\tStringTokenizer st;\n\t\tBufferedReader br;\n\t\tpublic MScanner(InputStream system) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(system));\n\t\t}\n \n\t\tpublic MScanner(String file) throws Exception {\n\t\t\tbr = new BufferedReader(new FileReader(file));\n\t\t}\n \n\t\tpublic String next() throws IOException {\n\t\t\twhile (st == null || !st.hasMoreTokens())\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\t\tpublic int[] intArr(int n) throws IOException {\n\t int[]in=new int[n];for(int i=0;i<n;i++)in[i]=nextInt();\n\t return in;\n\t\t}\n\t\tpublic long[] longArr(int n) throws IOException {\n\t long[]in=new long[n];for(int i=0;i<n;i++)in[i]=nextLong();\n\t return in;\n\t\t}\n\t\tpublic int[] intSortedArr(int n) throws IOException {\n\t int[]in=new int[n];for(int i=0;i<n;i++)in[i]=nextInt();\n\t shuffle(in);\n\t Arrays.sort(in);\n\t return in;\n\t\t}\n\t\tpublic long[] longSortedArr(int n) throws IOException {\n\t long[]in=new long[n];for(int i=0;i<n;i++)in[i]=nextLong();\n\t shuffle(in);\n\t Arrays.sort(in);\n\t return in;\n\t\t}\n\t\tpublic Integer[] IntegerArr(int n) throws IOException {\n\t Integer[]in=new Integer[n];for(int i=0;i<n;i++)in[i]=nextInt();\n\t return in;\n\t\t}\n\t\tpublic Long[] LongArr(int n) throws IOException {\n\t Long[]in=new Long[n];for(int i=0;i<n;i++)in[i]=nextLong();\n\t return in;\n\t\t}\n\t\tpublic String nextLine() throws IOException {\n\t\t\treturn br.readLine();\n\t\t}\n \n\t\tpublic int nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n \n\t\tpublic double nextDouble() throws IOException {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n \n\t\tpublic char nextChar() throws IOException {\n\t\t\treturn next().charAt(0);\n\t\t}\n \n\t\tpublic long nextLong() throws IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n \n\t\tpublic boolean ready() throws IOException {\n\t\t\treturn br.ready();\n\t\t}\n \n\t\tpublic void waitForInput() throws InterruptedException {\n\t\t\tThread.sleep(3000);\n\t\t}\n\t}\n\tstatic void shuffle(int[]in) {\n\t\tfor(int i=0;i<in.length;i++) {\n\t\t\tint idx=(int)(Math.random()*in.length);\n\t\t\tint tmp=in[i];\n\t\t\tin[i]=in[idx];\n\t\t\tin[idx]=tmp;\n\t\t}\n\t}\n\tstatic void shuffle(long[]in) {\n\t\tfor(int i=0;i<in.length;i++) {\n\t\t\tint idx=(int)(Math.random()*in.length);\n\t\t\tlong tmp=in[i];\n\t\t\tin[i]=in[idx];\n\t\t\tin[idx]=tmp;\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["dsu", "graphs", "data structures", "implementation", "trees"], "code_uid": "c03325ec1bc1cd94665d3e940e9cf808", "src_uid": "ad014bde729222db14f38caa521e4167", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastScanner in = new FastScanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskD solver = new TaskD();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskD {\n public void solve(int testNumber, FastScanner in, PrintWriter out) {\n int n = in.nextInt();\n int m = in.nextInt();\n int numQueries = in.nextInt();\n int[] p = new int[n];\n for (int i = 0; i < n; i++) {\n p[i] = -in.nextInt();\n }\n int[] a = new int[m];\n int[] b = new int[m];\n for (int i = 0; i < m; i++) {\n a[i] = in.nextInt() - 1;\n b[i] = in.nextInt() - 1;\n }\n int[] type = new int[numQueries];\n int[] val = new int[numQueries];\n boolean[] willDie = new boolean[m];\n for (int i = 0; i < numQueries; i++) {\n type[i] = in.nextInt();\n val[i] = in.nextInt() - 1;\n if (type[i] == 2) {\n willDie[val[i]] = true;\n }\n }\n\n int[] parent = new int[n];\n Arrays.fill(parent, -1);\n DSU dsu = new DSU(n);\n Graph g = new Graph(n + 1);\n for (int i = 0; i < m; i++) {\n if (willDie[i]) {\n continue;\n }\n int u = dsu.findComp(a[i]);\n int v = dsu.findComp(b[i]);\n if (u == v) {\n continue;\n }\n dsu.merge(u, v);\n if (dsu.p[v] == u) {\n int t = u;\n u = v;\n v = t;\n }\n parent[u] = v;\n g.addEdge(v, u, i);\n }\n\n for (int i = numQueries - 1; i >= 0; i--) {\n if (type[i] == 1) {\n val[i] = dsu.findComp(val[i]);\n continue;\n }\n int u = dsu.findComp(a[val[i]]);\n int v = dsu.findComp(b[val[i]]);\n if (u == v) {\n continue;\n }\n dsu.merge(u, v);\n if (dsu.p[v] == u) {\n int t = u;\n u = v;\n v = t;\n }\n parent[u] = v;\n g.addEdge(v, u, val[i]);\n }\n\n int root = n;\n for (int i = 0; i < n; i++) {\n if (parent[i] < 0) {\n g.addEdge(root, i, -1);\n }\n }\n EulerTourNumbering et = new EulerTourNumbering(g, root);\n\n MinTree mt = new MinTree(n + 1);\n int[] q = new int[n + 1];\n for (int i = 0; i < n; i++) {\n q[et.timeIn[i]] = p[i];\n mt.set(et.timeIn[i], p[i]);\n }\n\n boolean[] dead = new boolean[m];\n int[] left = new int[n + 1];\n int[] right = new int[n + 1];\n for (int i = 0; i < left.length; i++) {\n left[i] = et.timeIn[i];\n right[i] = et.timeOut[i] - 1;\n }\n for (int i = 0; i < numQueries; i++) {\n if (type[i] == 2) {\n dead[val[i]] = true;\n continue;\n }\n int r = val[i];\n for (int e = g.firstEdge[val[i]]; e >= 0; e = g.edgeNxt[e]) {\n int origId = g.edgeId[e];\n int dst = g.edgeDst[e];\n if (dead[origId]) {\n if (e != g.firstEdge[val[i]]) {\n throw new AssertionError();\n }\n g.firstEdge[val[i]] = g.edgeNxt[e];\n left[val[i]] = et.timeOut[dst];\n } else {\n break;\n }\n }\n int pos = et.timeIn[r];\n if (left[r] <= right[r]) {\n int cand = mt.getMinPos(left[r], right[r]);\n if (q[pos] > q[cand]) {\n pos = cand;\n }\n }\n out.println(-q[pos]);\n q[pos] = 0;\n mt.set(pos, 0);\n }\n }\n\n class EulerTourNumbering {\n Graph g;\n int[] tour;\n int[] timeIn;\n int[] timeOut;\n int globalTime;\n\n EulerTourNumbering(Graph g, int root) {\n this.g = g;\n int n = g.n;\n timeIn = new int[n];\n timeOut = new int[n];\n tour = new int[n];\n\n dfs(root, -1);\n if (globalTime != n) {\n throw new AssertionError();\n }\n }\n\n void dfs(int v, int p) {\n tour[globalTime] = v;\n timeIn[v] = globalTime++;\n for (int e = g.firstEdge[v]; e >= 0; e = g.edgeNxt[e]) {\n int u = g.edgeDst[e];\n if (u == p) {\n continue;\n }\n dfs(u, v);\n }\n timeOut[v] = globalTime;\n }\n\n }\n\n class Graph {\n int n;\n int[] firstEdge;\n int[] edgeDst;\n int[] edgeNxt;\n int[] edgeId;\n int numEdges;\n\n Graph(int n) {\n this.n = n;\n firstEdge = new int[n];\n Arrays.fill(firstEdge, -1);\n final int initialCapacity = 2 * n - 2;\n edgeDst = new int[initialCapacity];\n edgeNxt = new int[initialCapacity];\n edgeId = new int[initialCapacity];\n numEdges = 0;\n }\n\n void addEdge(int a, int b, int origId) {\n int e = numEdges++;\n if (e >= edgeDst.length) {\n reallocate();\n }\n edgeDst[e] = b;\n edgeNxt[e] = firstEdge[a];\n firstEdge[a] = e;\n edgeId[e] = origId;\n }\n\n private void reallocate() {\n int k = edgeDst.length;\n edgeDst = Arrays.copyOf(edgeDst, 3 * k / 2);\n edgeNxt = Arrays.copyOf(edgeNxt, 3 * k / 2);\n edgeId = Arrays.copyOf(edgeId, 3 * k / 2);\n }\n\n }\n\n class MinTree {\n int n;\n int[] a;\n int[] where;\n final int infinity = (int) 1e9;\n\n MinTree(int size) {\n n = 1;\n while (n < size) {\n n *= 2;\n }\n a = new int[2 * n];\n where = new int[2 * n];\n Arrays.fill(a, infinity);\n }\n\n void set(int pos, int val) {\n pos += n;\n a[pos] = val;\n where[pos] = pos - n;\n while (pos > 1) {\n pos /= 2;\n a[pos] = Math.min(a[2 * pos], a[2 * pos + 1]);\n if (a[pos] == a[2 * pos]) {\n where[pos] = where[2 * pos];\n } else {\n where[pos] = where[2 * pos + 1];\n }\n }\n }\n\n int getMinPos(int l, int r) {\n if (l > r) {\n return infinity;\n }\n l += n;\n r += n;\n if (l == r) {\n return where[l];\n }\n int lm = a[l];\n int rm = a[r];\n int lp = where[l];\n int rp = where[r];\n while (r - l > 1) {\n if (l % 2 == 0) {\n if (lm > a[l + 1]) {\n lm = a[l + 1];\n lp = where[l + 1];\n }\n }\n if (r % 2 != 0) {\n if (rm > a[r - 1]) {\n rm = a[r - 1];\n rp = where[r - 1];\n }\n }\n l /= 2;\n r /= 2;\n }\n return lm < rm ? lp : rp;\n }\n\n }\n\n class DSU {\n int[] rank;\n int[] p;\n int numComps;\n\n DSU(int n) {\n rank = new int[n];\n p = new int[n];\n reset();\n }\n\n void reset() {\n for (int i = 0; i < p.length; i++) {\n rank[i] = 0;\n p[i] = i;\n }\n numComps = p.length;\n }\n\n private int findComp(int x) {\n int r;\n int saved;\n\n saved = x;\n while (x != p[x]) {\n x = p[x];\n }\n r = x;\n\n x = saved;\n while (x != r) {\n saved = p[x];\n p[x] = r;\n x = saved;\n }\n return r;\n }\n\n private void merge(int a, int b) {\n a = findComp(a);\n b = findComp(b);\n if (a == b) {\n return;\n }\n --numComps;\n if (rank[a] < rank[b]) {\n p[a] = b;\n } else {\n p[b] = a;\n if (rank[a] == rank[b]) {\n ++rank[a];\n }\n }\n }\n\n }\n\n }\n\n static class FastScanner {\n private BufferedReader in;\n private StringTokenizer st;\n\n public FastScanner(InputStream stream) {\n in = new BufferedReader(new InputStreamReader(stream));\n }\n\n public String next() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(in.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return st.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["dsu", "graphs", "data structures", "implementation", "trees"], "code_uid": "4223655fa8fa600719a8df41ad2fad79", "src_uid": "ad014bde729222db14f38caa521e4167", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.io.PrintStream;\nimport java.util.Arrays;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) throws Exception {\n Thread thread = new Thread(null, new TaskAdapter(), \"\", 1 << 29);\n thread.start();\n thread.join();\n }\n\n static class TaskAdapter implements Runnable {\n @Override\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastInput in = new FastInput(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n DGraphAndQueries solver = new DGraphAndQueries();\n solver.solve(1, in, out);\n out.close();\n }\n }\n\n static class DGraphAndQueries {\n Debug debug = new Debug(true);\n\n public void solve(int testNumber, FastInput in, PrintWriter out) {\n int n = in.readInt();\n int m = in.readInt();\n int q = in.readInt();\n int[] p = new int[n];\n in.populate(p);\n\n\n Edge[] edges = new Edge[m];\n for (int i = 0; i < m; i++) {\n edges[i] = new Edge();\n edges[i].a = in.readInt() - 1;\n edges[i].b = in.readInt() - 1;\n }\n\n\n int[][] qs = new int[4][q];\n for (int i = 0; i < q; i++) {\n for (int j = 0; j < 2; j++) {\n qs[j][i] = in.readInt();\n }\n if (qs[0][i] == 2) {\n edges[qs[1][i] - 1].delete = true;\n }\n }\n\n\n DSUExt dsu = new DSUExt(n);\n dsu.reset();\n for (Edge e : edges) {\n if (e.delete) {\n continue;\n }\n dsu.merge(e.a, e.b);\n }\n\n for (int i = q - 1; i >= 0; i--) {\n if (qs[0][i] == 2) {\n Edge e = edges[qs[1][i] - 1];\n dsu.merge(e.a, e.b);\n } else {\n int v = qs[1][i] - 1;\n int pa = dsu.find(v);\n qs[2][i] = dsu.begin[pa];\n qs[3][i] = dsu.end[pa];\n }\n }\n\n int[] id = new int[n];\n int[] inv = new int[n];\n int idAlloc = 0;\n for (int i = 0; i < n; i++) {\n if (dsu.find(i) != i) {\n continue;\n }\n for (int trace = dsu.begin[i]; trace != -1; trace = dsu.next[trace]) {\n id[trace] = idAlloc++;\n inv[id[trace]] = trace;\n }\n }\n\n Segment seg = new Segment(0, n - 1, i -> p[inv[i]]);\n debug.debug(\"seg\", seg);\n for (int i = 0; i < q; i++) {\n if (qs[0][i] != 1) {\n continue;\n }\n int l = id[qs[2][i]];\n int r = id[qs[3][i]];\n if (l > r) {\n int tmp = l;\n l = r;\n r = tmp;\n }\n int ans = seg.query(l, r, 0, n - 1);\n seg.pop(l, r, 0, n - 1, ans);\n out.println(ans);\n\n debug.debug(\"debug\", seg);\n }\n }\n\n }\n\n static class Segment implements Cloneable {\n private Segment left;\n private Segment right;\n private int max;\n\n private void modify(int x) {\n max = x;\n }\n\n public void pushUp() {\n max = Math.max(left.max, right.max);\n }\n\n public void pushDown() {\n }\n\n public Segment(int l, int r, IntToIntegerFunction func) {\n if (l < r) {\n int m = DigitUtils.floorAverage(l, r);\n left = new Segment(l, m, func);\n right = new Segment(m + 1, r, func);\n pushUp();\n } else {\n max = func.apply(l);\n }\n }\n\n private boolean covered(int ll, int rr, int l, int r) {\n return ll <= l && rr >= r;\n }\n\n private boolean noIntersection(int ll, int rr, int l, int r) {\n return ll > r || rr < l;\n }\n\n public boolean pop(int ll, int rr, int l, int r, int maxVal) {\n if (noIntersection(ll, rr, l, r)) {\n return false;\n }\n if (covered(ll, rr, l, r)) {\n if (max != maxVal) {\n return false;\n }\n if (l == r) {\n modify(0);\n return true;\n }\n }\n pushDown();\n int m = DigitUtils.floorAverage(l, r);\n boolean ans = left.pop(ll, rr, l, m, maxVal);\n if (!ans) {\n ans = right.pop(ll, rr, m + 1, r, maxVal);\n }\n pushUp();\n return ans;\n }\n\n public int query(int ll, int rr, int l, int r) {\n if (noIntersection(ll, rr, l, r)) {\n return 0;\n }\n if (covered(ll, rr, l, r)) {\n return max;\n }\n pushDown();\n int m = DigitUtils.floorAverage(l, r);\n return Math.max(left.query(ll, rr, l, m),\n right.query(ll, rr, m + 1, r));\n }\n\n private Segment deepClone() {\n Segment seg = clone();\n if (seg.left != null) {\n seg.left = seg.left.deepClone();\n }\n if (seg.right != null) {\n seg.right = seg.right.deepClone();\n }\n return seg;\n }\n\n protected Segment clone() {\n try {\n return (Segment) super.clone();\n } catch (CloneNotSupportedException e) {\n throw new RuntimeException(e);\n }\n }\n\n private void toString(StringBuilder builder) {\n if (left == null && right == null) {\n builder.append(max).append(\",\");\n return;\n }\n pushDown();\n left.toString(builder);\n right.toString(builder);\n }\n\n public String toString() {\n StringBuilder builder = new StringBuilder();\n deepClone().toString(builder);\n if (builder.length() > 0) {\n builder.setLength(builder.length() - 1);\n }\n return builder.toString();\n }\n\n }\n\n static class Debug {\n private boolean offline;\n private PrintStream out = System.err;\n static int[] empty = new int[0];\n\n public Debug(boolean enable) {\n offline = enable && System.getSecurityManager() == null;\n }\n\n public Debug debug(String name, Object x) {\n return debug(name, x, empty);\n }\n\n public Debug debug(String name, Object x, int... indexes) {\n if (offline) {\n if (x == null || !x.getClass().isArray()) {\n out.append(name);\n for (int i : indexes) {\n out.printf(\"[%d]\", i);\n }\n out.append(\"=\").append(\"\" + x);\n out.println();\n } else {\n indexes = Arrays.copyOf(indexes, indexes.length + 1);\n if (x instanceof byte[]) {\n byte[] arr = (byte[]) x;\n for (int i = 0; i < arr.length; i++) {\n indexes[indexes.length - 1] = i;\n debug(name, arr[i], indexes);\n }\n } else if (x instanceof short[]) {\n short[] arr = (short[]) x;\n for (int i = 0; i < arr.length; i++) {\n indexes[indexes.length - 1] = i;\n debug(name, arr[i], indexes);\n }\n } else if (x instanceof boolean[]) {\n boolean[] arr = (boolean[]) x;\n for (int i = 0; i < arr.length; i++) {\n indexes[indexes.length - 1] = i;\n debug(name, arr[i], indexes);\n }\n } else if (x instanceof char[]) {\n char[] arr = (char[]) x;\n for (int i = 0; i < arr.length; i++) {\n indexes[indexes.length - 1] = i;\n debug(name, arr[i], indexes);\n }\n } else if (x instanceof int[]) {\n int[] arr = (int[]) x;\n for (int i = 0; i < arr.length; i++) {\n indexes[indexes.length - 1] = i;\n debug(name, arr[i], indexes);\n }\n } else if (x instanceof float[]) {\n float[] arr = (float[]) x;\n for (int i = 0; i < arr.length; i++) {\n indexes[indexes.length - 1] = i;\n debug(name, arr[i], indexes);\n }\n } else if (x instanceof double[]) {\n double[] arr = (double[]) x;\n for (int i = 0; i < arr.length; i++) {\n indexes[indexes.length - 1] = i;\n debug(name, arr[i], indexes);\n }\n } else if (x instanceof long[]) {\n long[] arr = (long[]) x;\n for (int i = 0; i < arr.length; i++) {\n indexes[indexes.length - 1] = i;\n debug(name, arr[i], indexes);\n }\n } else {\n Object[] arr = (Object[]) x;\n for (int i = 0; i < arr.length; i++) {\n indexes[indexes.length - 1] = i;\n debug(name, arr[i], indexes);\n }\n }\n }\n }\n return this;\n }\n\n }\n\n static class DSUExt extends DSU {\n int[] begin;\n int[] end;\n int[] next;\n\n public DSUExt(int n) {\n super(n);\n begin = new int[n];\n end = new int[n];\n next = new int[n];\n }\n\n public void reset() {\n super.reset();\n for (int i = 0; i < begin.length; i++) {\n begin[i] = end[i] = i;\n next[i] = -1;\n }\n }\n\n protected void preMerge(int a, int b) {\n next[end[a]] = begin[b];\n end[a] = end[b];\n }\n\n }\n\n static interface IntToIntegerFunction {\n int apply(int x);\n\n }\n\n static class DigitUtils {\n private DigitUtils() {\n }\n\n public static int floorAverage(int x, int y) {\n return (x & y) + ((x ^ y) >> 1);\n }\n\n }\n\n static class FastInput {\n private final InputStream is;\n private byte[] buf = new byte[1 << 13];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastInput(InputStream is) {\n this.is = is;\n }\n\n public void populate(int[] data) {\n for (int i = 0; i < data.length; i++) {\n data[i] = readInt();\n }\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n bufLen = -1;\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public int readInt() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n }\n\n static class DSU {\n protected int[] p;\n protected int[] rank;\n\n public DSU(int n) {\n p = new int[n];\n rank = new int[n];\n }\n\n public void reset() {\n for (int i = 0; i < p.length; i++) {\n p[i] = i;\n rank[i] = 0;\n }\n }\n\n public final int find(int a) {\n if (p[a] == p[p[a]]) {\n return p[a];\n }\n preAccess(a);\n return p[a] = find(p[a]);\n }\n\n protected void preAccess(int a) {\n\n }\n\n protected void preMerge(int a, int b) {\n\n }\n\n public final void merge(int a, int b) {\n a = find(a);\n b = find(b);\n if (a == b) {\n return;\n }\n if (rank[a] == rank[b]) {\n rank[a]++;\n }\n\n if (rank[a] < rank[b]) {\n int tmp = a;\n a = b;\n b = tmp;\n }\n\n preMerge(a, b);\n p[b] = a;\n }\n\n }\n\n static class Edge {\n int a;\n int b;\n boolean delete;\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["dsu", "graphs", "data structures", "implementation", "trees"], "code_uid": "f407138b25801628fd7088b66345e492", "src_uid": "ad014bde729222db14f38caa521e4167", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.BufferedOutputStream;\nimport java.io.Closeable;\nimport java.io.DataInputStream;\nimport java.io.Flushable;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintStream;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.BitSet;\nimport java.util.InputMismatchException;\nimport java.util.Objects;\nimport java.util.function.BiFunction;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n\tstatic class TaskAdapter implements Runnable {\n\t\t@Override\n\t\tpublic void run() {\n\t\t\tlong startTime = System.currentTimeMillis();\n\t\t\tInputStream inputStream = System.in;\n\t\t\tOutputStream outputStream = System.out;\n\t\t\tFastReader in = new FastReader(inputStream);\n\t\t\tOutput out = new Output(outputStream);\n\t\t\tDGraphAndQueries solver = new DGraphAndQueries();\n\t\t\tsolver.solve(1, in, out);\n\t\t\tout.close();\n\t\t\tSystem.err.println(System.currentTimeMillis()-startTime+\"ms\");\n\t\t}\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tThread thread = new Thread(null, new TaskAdapter(), \"\", 1<<28);\n\t\tthread.start();\n\t\tthread.join();\n\t}\n\n\tstatic class DGraphAndQueries {\n\t\tint[] arr;\n\t\tint[] parent;\n\t\tint[] tin;\n\t\tint[] tout;\n\t\tint n;\n\t\tint ind;\n\t\tint clock;\n\t\tBitSet visited;\n\t\tPair<Integer, Integer>[] tour;\n\t\tArrayList<Integer>[] graph;\n\n\t\tpublic DGraphAndQueries() {\n\t\t}\n\n\t\tpublic int find(int u) {\n\t\t\treturn parent[u]==u ? u : (parent[u] = find(parent[u]));\n\t\t}\n\n\t\tpublic void merge(Pair<Integer, Integer> p) {\n\t\t\tint u = find(p.a), v = find(p.b);\n\t\t\tif(u==v) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tint next = ind++;\n\t\t\tparent[u] = parent[v] = next;\n\t\t\tgraph[next] = new ArrayList<>(Arrays.asList(u, v));\n\t\t}\n\n\t\tpublic void dfs(int u) {\n\t\t\ttour[clock] = new Pair<>(arr[u], tin[u] = clock++);\n\t\t\tif(u>=n) {\n\t\t\t\tfor(int v: graph[u]) {\n\t\t\t\t\tdfs(v);\n\t\t\t\t}\n\t\t\t}\n\t\t\ttout[u] = clock-1;\n\t\t}\n\n\t\tpublic void solve(int kase, InputReader in, Output pw) {\n\t\t\tn = in.nextInt();\n\t\t\tint m = in.nextInt(), q = in.nextInt();\n\t\t\tarr = new int[n+q];\n\t\t\tArrays.fill(arr, -1);\n\t\t\tparent = new int[n+q];\n\t\t\tgraph = new ArrayList[n+q];\n\t\t\tind = n;\n\t\t\tfor(int i = 0; i<n; i++) {\n\t\t\t\tarr[i] = in.nextInt();\n\t\t\t}\n\t\t\tfor(int i = 0; i<n+q; i++) {\n\t\t\t\tparent[i] = i;\n\t\t\t}\n\t\t\tPair<Integer, Integer>[] edges = new Pair[m];\n\t\t\tfor(int i = 0; i<m; i++) {\n\t\t\t\tedges[i] = new Pair<>(in.nextInt()-1, in.nextInt()-1);\n\t\t\t}\n\t\t\tBitSet marked = new BitSet(m);\n\t\t\tint[][] queries = new int[q][2];\n\t\t\tfor(int i = 0; i<q; i++) {\n\t\t\t\tqueries[i] = new int[] {in.nextInt(), in.nextInt()-1};\n\t\t\t\tif(queries[i][0]==2) {\n\t\t\t\t\tmarked.set(queries[i][1]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int i = 0; i<m; i++) {\n\t\t\t\tif(!marked.get(i)) {\n\t\t\t\t\tmerge(edges[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int i = q-1; i>=0; i--) {\n\t\t\t\tif(queries[i][0]==2) {\n\t\t\t\t\tmerge(edges[queries[i][1]]);\n\t\t\t\t}else {\n\t\t\t\t\tqueries[i][1] = find(queries[i][1]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tUtilities.Debug.dbg(ind);\n\t\t\tUtilities.Debug.dbg(graph);\n\t\t\ttour = new Pair[ind];\n\t\t\ttin = new int[ind];\n\t\t\ttout = new int[ind];\n\t\t\tvisited = new BitSet(ind);\n\t\t\tclock = 0;\n\t\t\tfor(int i = 0; i<n; i++) {\n\t\t\t\tint u = find(i);\n\t\t\t\tif(!visited.get(u)) {\n\t\t\t\t\tdfs(u);\n\t\t\t\t\tvisited.set(u);\n\t\t\t\t}\n\t\t\t}\n\t\t\tUtilities.Debug.dbg(tour);\n\t\t\tTPointSegmentTree<Pair<Integer, Integer>> st = new TPointSegmentTree<>(tour, (o1, o2) -> o1.a>=o2.a ? o1 : o2);\n\t\t\tfor(int[] query: queries) {\n\t\t\t\tif(query[0]==1) {\n\t\t\t\t\tint u = query[1];\n\t\t\t\t\tvar v = st.query(tin[u], tout[u]);\n\t\t\t\t\tUtilities.Debug.dbg(u, v);\n\t\t\t\t\tpw.println(v.a);\n\t\t\t\t\tst.set(v.b, new Pair<>(0, v.b));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t}\n\n\tstatic class TPointSegmentTree<T> {\n\t\tpublic int n;\n\t\tpublic int ind;\n\t\tpublic int ql;\n\t\tpublic int qr;\n\t\tpublic T[] arr;\n\t\tpublic T[] value;\n\t\tpublic BiFunction<T, T, T> operation;\n\n\t\tpublic TPointSegmentTree(T[] arr, BiFunction<T, T, T> operation) {\n\t\t\tn = arr.length;\n\t\t\tthis.arr = arr;\n\t\t\tvalue = (T[]) new Object[n<<2];\n\t\t\tthis.operation = operation;\n\t\t\tbuild(1, 0, n-1);\n\t\t}\n\n\t\tprivate void build(int o, int l, int r) {\n\t\t\tif(l==r) {\n\t\t\t\tvalue[o] = arr[l];\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tint lc = o<<1, rc = lc|1, mid = l+r >> 1;\n\t\t\tbuild(lc, l, mid);\n\t\t\tbuild(rc, mid+1, r);\n\t\t\tvalue[o] = operation.apply(value[lc], value[rc]);\n\t\t}\n\n\t\tprivate void set(int o, int l, int r) {\n\t\t\tif(l==r) {\n\t\t\t\tvalue[o] = arr[l];\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tint lc = o<<1, rc = lc|1, mid = l+r >> 1;\n\t\t\tif(ind<=mid) {\n\t\t\t\tset(lc, l, mid);\n\t\t\t}else {\n\t\t\t\tset(rc, mid+1, r);\n\t\t\t}\n\t\t\tvalue[o] = operation.apply(value[lc], value[rc]);\n\t\t}\n\n\t\tpublic void set(int ind, T val) {\n\t\t\tthis.ind = ind;\n\t\t\tarr[ind] = val;\n\t\t\tset(1, 0, n-1);\n\t\t}\n\n\t\tprivate T query(int o, int l, int r) {\n\t\t\tif(ql<=l&&qr>=r) {\n\t\t\t\treturn value[o];\n\t\t\t}\n\t\t\tint lc = o<<1, rc = lc|1, mid = l+r >> 1;\n\t\t\tT ret = null;\n\t\t\tif(ql<=mid) {\n\t\t\t\tret = query(lc, l, mid);\n\t\t\t}\n\t\t\tif(qr>mid) {\n\t\t\t\tif(ret==null) {\n\t\t\t\t\tret = query(rc, mid+1, r);\n\t\t\t\t}else {\n\t\t\t\t\tret = operation.apply(ret, query(rc, mid+1, r));\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic T query(int l, int r) {\n\t\t\tql = l;\n\t\t\tqr = r;\n\t\t\treturn query(1, 0, n-1);\n\t\t}\n\n\t}\n\n\tstatic class Utilities {\n\t\tpublic static class Debug {\n\t\t\tpublic static final boolean LOCAL = System.getProperty(\"ONLINE_JUDGE\")==null;\n\n\t\t\tprivate static <T> String ts(T t) {\n\t\t\t\tif(t==null) {\n\t\t\t\t\treturn \"null\";\n\t\t\t\t}\n\t\t\t\ttry {\n\t\t\t\t\treturn ts((Iterable) t);\n\t\t\t\t}catch(ClassCastException e) {\n\t\t\t\t\tif(t instanceof int[]) {\n\t\t\t\t\t\tString s = Arrays.toString((int[]) t);\n\t\t\t\t\t\treturn \"{\"+s.substring(1, s.length()-1)+\"}\";\n\t\t\t\t\t}else if(t instanceof long[]) {\n\t\t\t\t\t\tString s = Arrays.toString((long[]) t);\n\t\t\t\t\t\treturn \"{\"+s.substring(1, s.length()-1)+\"}\";\n\t\t\t\t\t}else if(t instanceof char[]) {\n\t\t\t\t\t\tString s = Arrays.toString((char[]) t);\n\t\t\t\t\t\treturn \"{\"+s.substring(1, s.length()-1)+\"}\";\n\t\t\t\t\t}else if(t instanceof double[]) {\n\t\t\t\t\t\tString s = Arrays.toString((double[]) t);\n\t\t\t\t\t\treturn \"{\"+s.substring(1, s.length()-1)+\"}\";\n\t\t\t\t\t}else if(t instanceof boolean[]) {\n\t\t\t\t\t\tString s = Arrays.toString((boolean[]) t);\n\t\t\t\t\t\treturn \"{\"+s.substring(1, s.length()-1)+\"}\";\n\t\t\t\t\t}\n\t\t\t\t\ttry {\n\t\t\t\t\t\treturn ts((Object[]) t);\n\t\t\t\t\t}catch(ClassCastException e1) {\n\t\t\t\t\t\treturn t.toString();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tprivate static <T> String ts(T[] arr) {\n\t\t\t\tStringBuilder ret = new StringBuilder();\n\t\t\t\tret.append(\"{\");\n\t\t\t\tboolean first = true;\n\t\t\t\tfor(T t: arr) {\n\t\t\t\t\tif(!first) {\n\t\t\t\t\t\tret.append(\", \");\n\t\t\t\t\t}\n\t\t\t\t\tfirst = false;\n\t\t\t\t\tret.append(ts(t));\n\t\t\t\t}\n\t\t\t\tret.append(\"}\");\n\t\t\t\treturn ret.toString();\n\t\t\t}\n\n\t\t\tprivate static <T> String ts(Iterable<T> iter) {\n\t\t\t\tStringBuilder ret = new StringBuilder();\n\t\t\t\tret.append(\"{\");\n\t\t\t\tboolean first = true;\n\t\t\t\tfor(T t: iter) {\n\t\t\t\t\tif(!first) {\n\t\t\t\t\t\tret.append(\", \");\n\t\t\t\t\t}\n\t\t\t\t\tfirst = false;\n\t\t\t\t\tret.append(ts(t));\n\t\t\t\t}\n\t\t\t\tret.append(\"}\");\n\t\t\t\treturn ret.toString();\n\t\t\t}\n\n\t\t\tpublic static void dbg(Object... o) {\n\t\t\t\tif(LOCAL) {\n\t\t\t\t\tSystem.err.print(\"Line #\"+Thread.currentThread().getStackTrace()[2].getLineNumber()+\": [\");\n\t\t\t\t\tfor(int i = 0; i<o.length; i++) {\n\t\t\t\t\t\tif(i!=0) {\n\t\t\t\t\t\t\tSystem.err.print(\", \");\n\t\t\t\t\t\t}\n\t\t\t\t\t\tSystem.err.print(ts(o[i]));\n\t\t\t\t\t}\n\t\t\t\t\tSystem.err.println(\"]\");\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\tstatic class Output implements Closeable, Flushable {\n\t\tpublic StringBuilder sb;\n\t\tpublic OutputStream os;\n\t\tpublic int BUFFER_SIZE;\n\t\tpublic String lineSeparator;\n\n\t\tpublic Output(OutputStream os) {\n\t\t\tthis(os, 1<<16);\n\t\t}\n\n\t\tpublic Output(OutputStream os, int bs) {\n\t\t\tBUFFER_SIZE = bs;\n\t\t\tsb = new StringBuilder(BUFFER_SIZE);\n\t\t\tthis.os = new BufferedOutputStream(os, 1<<17);\n\t\t\tlineSeparator = System.lineSeparator();\n\t\t}\n\n\t\tpublic void println(int i) {\n\t\t\tprintln(String.valueOf(i));\n\t\t}\n\n\t\tpublic void println(String s) {\n\t\t\tsb.append(s);\n\t\t\tprintln();\n\t\t}\n\n\t\tpublic void println() {\n\t\t\tsb.append(lineSeparator);\n\t\t}\n\n\t\tprivate void flushToBuffer() {\n\t\t\ttry {\n\t\t\t\tos.write(sb.toString().getBytes());\n\t\t\t}catch(IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tsb = new StringBuilder(BUFFER_SIZE);\n\t\t}\n\n\t\tpublic void flush() {\n\t\t\ttry {\n\t\t\t\tflushToBuffer();\n\t\t\t\tos.flush();\n\t\t\t}catch(IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\n\t\tpublic void close() {\n\t\t\tflush();\n\t\t\ttry {\n\t\t\t\tos.close();\n\t\t\t}catch(IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\n\t}\n\n\tstatic interface InputReader {\n\t\tint nextInt();\n\n\t}\n\n\tstatic class Pair<T1, T2> implements Comparable<Pair<T1, T2>> {\n\t\tpublic T1 a;\n\t\tpublic T2 b;\n\n\t\tpublic Pair(Pair<T1, T2> p) {\n\t\t\tthis(p.a, p.b);\n\t\t}\n\n\t\tpublic Pair(T1 a, T2 b) {\n\t\t\tthis.a = a;\n\t\t\tthis.b = b;\n\t\t}\n\n\t\tpublic String toString() {\n\t\t\treturn a+\" \"+b;\n\t\t}\n\n\t\tpublic int hashCode() {\n\t\t\treturn Objects.hash(a, b);\n\t\t}\n\n\t\tpublic boolean equals(Object o) {\n\t\t\tif(o instanceof Pair) {\n\t\t\t\tPair p = (Pair) o;\n\t\t\t\treturn a.equals(p.a)&&b.equals(p.b);\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\n\t\tpublic int compareTo(Pair<T1, T2> p) {\n\t\t\tint cmp = ((Comparable<T1>) a).compareTo(p.a);\n\t\t\tif(cmp==0) {\n\t\t\t\treturn ((Comparable<T2>) b).compareTo(p.b);\n\t\t\t}\n\t\t\treturn cmp;\n\t\t}\n\n\t}\n\n\tstatic class FastReader implements InputReader {\n\t\tfinal private int BUFFER_SIZE = 1<<16;\n\t\tprivate DataInputStream din;\n\t\tprivate byte[] buffer;\n\t\tprivate int bufferPointer;\n\t\tprivate int bytesRead;\n\n\t\tpublic FastReader(InputStream is) {\n\t\t\tdin = new DataInputStream(is);\n\t\t\tbuffer = new byte[BUFFER_SIZE];\n\t\t\tbufferPointer = bytesRead = 0;\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\tint ret = 0;\n\t\t\tbyte c = skipToDigit();\n\t\t\tboolean neg = (c=='-');\n\t\t\tif(neg) {\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tdo {\n\t\t\t\tret = ret*10+c-'0';\n\t\t\t} while((c = read())>='0'&&c<='9');\n\t\t\tif(neg) {\n\t\t\t\treturn -ret;\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tprivate boolean isDigit(byte b) {\n\t\t\treturn b>='0'&&b<='9';\n\t\t}\n\n\t\tprivate byte skipToDigit() {\n\t\t\tbyte ret;\n\t\t\twhile(!isDigit(ret = read())&&ret!='-') ;\n\t\t\treturn ret;\n\t\t}\n\n\t\tprivate void fillBuffer() {\n\t\t\ttry {\n\t\t\t\tbytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n\t\t\t}catch(IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif(bytesRead==-1) {\n\t\t\t\tbuffer[0] = -1;\n\t\t\t}\n\t\t}\n\n\t\tprivate byte read() {\n\t\t\tif(bytesRead==-1) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}else if(bufferPointer==bytesRead) {\n\t\t\t\tfillBuffer();\n\t\t\t}\n\t\t\treturn buffer[bufferPointer++];\n\t\t}\n\n\t}\n}\n\n", "lang_cluster": "Java", "tags": ["dsu", "graphs", "data structures", "implementation", "trees"], "code_uid": "18c15e4560772fb5acead955d0ec48d8", "src_uid": "ad014bde729222db14f38caa521e4167", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class E {\n\tFastScanner in;\n\tPrintWriter out;\n\tboolean systemIO = true;\n\n\tpublic class DSU {\n\t\tint[] sz;\n\t\tint[] p;\n\n\t\tpublic DSU(int n) {\n\t\t\tsz = new int[n];\n\t\t\tp = new int[n];\n\t\t\tfor (int i = 0; i < p.length; i++) {\n\t\t\t\tp[i] = i;\n\t\t\t\tsz[i] = 1;\n\t\t\t}\n\t\t}\n\n\t\tpublic int get(int x) {\n\t\t\tif (x == p[x]) {\n\t\t\t\treturn x;\n\t\t\t}\n\t\t\tint par = get(p[x]);\n\t\t\tp[x] = par;\n\t\t\treturn par;\n\t\t}\n\n\t\tpublic boolean unite(int a, int b) {\n\t\t\tint pa = get(a);\n\t\t\tint pb = get(b);\n\t\t\tif (pa == pb) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif (sz[pa] < sz[pb]) {\n\t\t\t\tp[pa] = pb;\n\t\t\t\tsz[pb] += sz[pa];\n\t\t\t} else {\n\t\t\t\tp[pb] = pa;\n\t\t\t\tsz[pa] += sz[pb];\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\t}\n\n\tpublic class SegmentTreeAdd {\n\t\tint pow;\n\t\tlong[] max;\n\t\tlong[] delta;\n\t\tboolean[] flag;\n\n\t\tpublic SegmentTreeAdd(long[] a) {\n\t\t\tpow = 1;\n\t\t\twhile (pow < a.length) {\n\t\t\t\tpow *= 2;\n\t\t\t}\n\t\t\tflag = new boolean[2 * pow];\n\t\t\tmax = new long[2 * pow];\n\t\t\tdelta = new long[2 * pow];\n\t\t\tfor (int i = 0; i < max.length; i++) {\n\t\t\t\tmax[i] = Long.MIN_VALUE / 2;\n\t\t\t}\n\t\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\t\tmax[pow + i] = a[i];\n\t\t\t}\n\t\t\tfor (int i = pow - 1; i > 0; i--) {\n\t\t\t\tmax[i] = f(max[2 * i], max[2 * i + 1]);\n\t\t\t}\n\t\t}\n\n\t\tpublic long get(int v, int tl, int tr, int l, int r) {\n\t\t\tpush(v, tl, tr);\n\t\t\tif (l > r) {\n\t\t\t\treturn Long.MIN_VALUE / 2;\n\t\t\t}\n\t\t\tif (l == tl && r == tr) {\n\t\t\t\treturn max[v];\n\t\t\t}\n\t\t\tint tm = (tl + tr) / 2;\n\t\t\treturn f(get(2 * v, tl, tm, l, Math.min(r, tm)), get(2 * v + 1, tm + 1, tr, Math.max(l, tm + 1), r));\n\t\t}\n\n\t\tpublic void set(int v, int tl, int tr, int l, int r, long x) {\n\t\t\tpush(v, tl, tr);\n\t\t\tif (l > tr || r < tl) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (l <= tl && r >= tr) {\n\t\t\t\tdelta[v] += x;\n\t\t\t\tflag[v] = true;\n\t\t\t\tpush(v, tl, tr);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tint tm = (tl + tr) / 2;\n\t\t\tset(2 * v, tl, tm, l, r, x);\n\t\t\tset(2 * v + 1, tm + 1, tr, l, r, x);\n\t\t\tmax[v] = f(max[2 * v], max[2 * v + 1]);\n\t\t}\n\n\t\tpublic void push(int v, int tl, int tr) {\n\t\t\tif (flag[v]) {\n\t\t\t\tif (v < pow) {\n\t\t\t\t\tflag[2 * v] = true;\n\t\t\t\t\tflag[2 * v + 1] = true;\n\t\t\t\t\tdelta[2 * v] += delta[v];\n\t\t\t\t\tdelta[2 * v + 1] += delta[v];\n\t\t\t\t}\n\t\t\t\tflag[v] = false;\n\t\t\t\tmax[v] += delta[v];\n\t\t\t\tdelta[v] = 0;\n\t\t\t}\n\t\t}\n\n\t\tpublic long f(long a, long b) {\n\t\t\treturn Math.max(a, b);\n\t\t}\n\t}\n\n\tpublic class SegmentTreeSet {\n\t\tint pow;\n\t\tint[] sum;\n\t\tint[] delta;\n\t\tboolean[] flag;\n\n\t\tpublic SegmentTreeSet(int[] a) {\n\t\t\tpow = 1;\n\t\t\twhile (pow < a.length) {\n\t\t\t\tpow *= 2;\n\t\t\t}\n\t\t\tflag = new boolean[2 * pow];\n\t\t\tsum = new int[2 * pow];\n\t\t\tdelta = new int[2 * pow];\n\t\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\t\tsum[pow + i] = a[i];\n\t\t\t}\n\t\t}\n\n\t\tpublic int get(int v, int tl, int tr, int l, int r) {\n\t\t\tpush(v, tl, tr);\n\t\t\tif (l > r) {\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tif (l == tl && r == tr) {\n\t\t\t\treturn sum[v];\n\t\t\t}\n\t\t\tint tm = (tl + tr) / 2;\n\t\t\treturn f(get(2 * v, tl, tm, l, Math.min(r, tm)), get(2 * v + 1, tm + 1, tr, Math.max(l, tm + 1), r));\n\t\t}\n\n\t\tpublic void set(int v, int tl, int tr, int l, int r, int x) {\n\t\t\tpush(v, tl, tr);\n\t\t\tif (l > tr || r < tl) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (l <= tl && r >= tr) {\n\t\t\t\tdelta[v] = x;\n\t\t\t\tflag[v] = true;\n\t\t\t\tpush(v, tl, tr);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tint tm = (tl + tr) / 2;\n\t\t\tset(2 * v, tl, tm, l, r, x);\n\t\t\tset(2 * v + 1, tm + 1, tr, l, r, x);\n\t\t\tsum[v] = f(sum[2 * v], sum[2 * v + 1]);\n\t\t}\n\n\t\tpublic void push(int v, int tl, int tr) {\n\t\t\tif (flag[v]) {\n\t\t\t\tif (v < pow) {\n\t\t\t\t\tflag[2 * v] = true;\n\t\t\t\t\tflag[2 * v + 1] = true;\n\t\t\t\t\tdelta[2 * v] = delta[v];\n\t\t\t\t\tdelta[2 * v + 1] = delta[v];\n\t\t\t\t}\n\t\t\t\tflag[v] = false;\n\t\t\t\tsum[v] = delta[v] * (tr - tl + 1);\n\t\t\t}\n\t\t}\n\n\t\tpublic int f(int a, int b) {\n\t\t\treturn a + b;\n\t\t}\n\t}\n\n\tpublic class Pair implements Comparable<Pair> {\n\t\tint x;\n\t\tint y;\n\n\t\tpublic Pair(int x, int y) {\n\t\t\tthis.x = x;\n\t\t\tthis.y = y;\n\t\t}\n\n\t\tpublic Pair clone() {\n\t\t\treturn new Pair(x, y);\n\t\t}\n\n\t\tpublic String toString() {\n\t\t\treturn x + \" \" + y;\n\t\t}\n\n\t\t@Override\n\t\tpublic int compareTo(Pair o) {\n\t\t\tif (y > o.y) {\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\tif (y < o.y) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tif (x > o.x) {\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\tif (x < o.x) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\tlong mod = 1000000007;\n\tRandom random = new Random();\n\n\tpublic void shuffle(Pair[] a) {\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\tint x = random.nextInt(i + 1);\n\t\t\tPair t = a[x];\n\t\t\ta[x] = a[i];\n\t\t\ta[i] = t;\n\t\t}\n\t}\n\n\tpublic void sort(int[][] a) {\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\tArrays.sort(a[i]);\n\t\t}\n\t}\n\n\tpublic void add(HashMap<Long, Integer> map, long l) {\n\t\tif (map.containsKey(l)) {\n\t\t\tmap.put(l, map.get(l) + 1);\n\t\t} else {\n\t\t\tmap.put(l, 1);\n\t\t}\n\t}\n\n\tpublic void remove(TreeMap<Integer, Integer> map, Integer s) {\n\t\tif (map.get(s) > 1) {\n\t\t\tmap.put(s, map.get(s) - 1);\n\t\t} else {\n\t\t\tmap.remove(s);\n\t\t}\n\t}\n\n\tlong max = Long.MAX_VALUE / 2;\n\tdouble eps = 1e-10;\n\n\tpublic int signum(double x) {\n\t\tif (x > eps) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (x < -eps) {\n\t\t\treturn -1;\n\t\t}\n\t\treturn 0;\n\t}\n\n\tpublic long abs(long x) {\n\t\treturn x < 0 ? -x : x;\n\t}\n\n\tpublic long min(long x, long y) {\n\t\treturn x < y ? x : y;\n\t}\n\n\tpublic long max(long x, long y) {\n\t\treturn x > y ? x : y;\n\t}\n\n\tpublic long gcd(long x, long y) {\n\t\twhile (y > 0) {\n\t\t\tlong c = y;\n\t\t\ty = x % y;\n\t\t\tx = c;\n\t\t}\n\t\treturn x;\n\t}\n\n\tpublic final Vector ZERO = new Vector(0, 0);\n\n\t// public class Vector implements Comparable<Vector> {\n\t// long x;\n\t// long y;\n\t// int type;\n\t// int number;\n\t//\n\t// public Vector() {\n\t// x = 0;\n\t// y = 0;\n\t// }\n\t//\n\t// public Vector(long x, long y, int type, int number) {\n\t// this.x = x;\n\t// this.y = y;\n\t// this.type = type;\n\t// this.number = number;\n\t// }\n\t//\n\t// public Vector(long x, long y) {\n\t//\n\t// }\n\t//\n\t// public Vector(Point begin, Point end) {\n\t// this(end.x - begin.x, end.y - begin.y);\n\t// }\n\t//\n\t// public void orient() {\n\t// if (x < 0) {\n\t// x = -x;\n\t// y = -y;\n\t// }\n\t// if (x == 0 && y < 0) {\n\t// y = -y;\n\t// }\n\t// }\n\t//\n\t// public void normalize() {\n\t// long gcd = gcd(abs(x), abs(y));\n\t// x /= gcd;\n\t// y /= gcd;\n\t// }\n\t//\n\t// public String toString() {\n\t// return x + \" \" + y;\n\t// }\n\t//\n\t// public boolean equals(Vector v) {\n\t// return x == v.x && y == v.y;\n\t// }\n\t//\n\t// public boolean collinear(Vector v) {\n\t// return cp(this, v) == 0;\n\t// }\n\t//\n\t// public boolean orthogonal(Vector v) {\n\t// return dp(this, v) == 0;\n\t// }\n\t//\n\t// public Vector ort(Vector v) {\n\t// return new Vector(-y, x);\n\t// }\n\t//\n\t// public Vector add(Vector v) {\n\t// return new Vector(x + v.x, y + v.y);\n\t// }\n\t//\n\t// public Vector multiply(long c) {\n\t// return new Vector(c * x, c * y);\n\t// }\n\t//\n\t// public int quater() {\n\t// if (x > 0 && y >= 0) {\n\t// return 1;\n\t// }\n\t// if (x <= 0 && y > 0) {\n\t// return 2;\n\t// }\n\t// if (x < 0) {\n\t// return 3;\n\t// }\n\t// return 0;\n\t// }\n\t//\n\t// public long len2() {\n\t// return x * x + y * y;\n\t// }\n\t//\n\t// @Override\n\t// public int compareTo(Vector o) {\n\t// if (quater() != o.quater()) {\n\t// return quater() - o.quater();\n\t// }\n\t// return signum(cp(o, this));\n\t// }\n\t// }\n\n\t// public long dp(Vector v1, Vector v2) {\n\t// return v1.x * v2.x + v1.y * v2.y;\n\t// }\n\t//\n\t// public long cp(Vector v1, Vector v2) {\n\t// return v1.x * v2.y - v1.y * v2.x;\n\t// }\n\n\t// public class Line implements Comparable<Line> {\n\t// Point p;\n\t// Vector v;\n\t//\n\t// public Line(Point p, Vector v) {\n\t// this.p = p;\n\t// this.v = v;\n\t// }\n\t//\n\t// public Line(Point p1, Point p2) {\n\t// if (p1.compareTo(p2) < 0) {\n\t// p = p1;\n\t// v = new Vector(p1, p2);\n\t// } else {\n\t// p = p2;\n\t// v = new Vector();\n\t// }\n\t// }\n\t//\n\t// public boolean collinear(Line l) {\n\t// return v.collinear(l.v);\n\t// }\n\t//\n\t// public boolean inLine(Point p) {\n\t// return hv(p) == 0;\n\t// }\n\t//\n\t// public boolean inSegment(Point p) {\n\t// if (!inLine(p)) {\n\t// return false;\n\t// }\n\t// Point p1 = p;\n\t// Point p2 = p.add(v);\n\t// return p1.x <= p.x && p.x <= p2.x && min(p1.y, p2.y) <= p.y && p.y <=\n\t// max(p1.y, p2.y);\n\t// }\n\t//\n\t// public boolean equalsSegment(Line l) {\n\t// return p.equals(l.p) && v.equals(l.v);\n\t// }\n\t//\n\t// public boolean equalsLine(Line l) {\n\t// return collinear(l) && inLine(l.p);\n\t// }\n\t//\n\t// public long hv(Point p) {\n\t// Vector v1 = new Vector(this.p, p);\n\t// return cp(v, v1);\n\t// }\n\t//\n\t// public double h(Point p) {\n\t// Vector v1 = new Vector(this.p, p);\n\t// return cp(v, v1) / Math.sqrt(v.len2());\n\t// }\n\t//\n\t// public long[] intersectLines(Line l) {\n\t// if (collinear(l)) {\n\t// return null;\n\t// }\n\t// long[] ans = new long[4];\n\t//\n\t// return ans;\n\t// }\n\t//\n\t// public long[] intersectSegment(Line l) {\n\t// long[] ans = intersectLines(l);\n\t// if (ans == null) {\n\t// return null;\n\t// }\n\t// Point p1 = p;\n\t// Point p2 = p.add(v);\n\t// boolean f1 = p1.x * ans[1] <= ans[0] && ans[0] <= p2.x * ans[1] && min(p1.y,\n\t// p2.y) * ans[3] <= ans[2]\n\t// && ans[2] <= max(p1.y, p2.y) * ans[3];\n\t// p1 = l.p;\n\t// p2 = l.p.add(v);\n\t// boolean f2 = p1.x * ans[1] <= ans[0] && ans[0] <= p2.x * ans[1] && min(p1.y,\n\t// p2.y) * ans[3] <= ans[2]\n\t// && ans[2] <= max(p1.y, p2.y) * ans[3];\n\t// if (!f1 || !f2) {\n\t// return null;\n\t// }\n\t// return ans;\n\t// }\n\t//\n\t// @Override\n\t// public int compareTo(Line o) {\n\t// return v.compareTo(o.v);\n\t// }\n\t// }\n\n\tpublic class Rect {\n\t\tlong x1;\n\t\tlong x2;\n\t\tlong y1;\n\t\tlong y2;\n\t\tint number;\n\n\t\tpublic Rect(long x1, long x2, long y1, long y2, int number) {\n\t\t\tthis.x1 = x1;\n\t\t\tthis.x2 = x2;\n\t\t\tthis.y1 = y1;\n\t\t\tthis.y2 = y2;\n\t\t\tthis.number = number;\n\t\t}\n\t}\n\n\tpublic static class Fenvik {\n\t\tint[] t;\n\n\t\tpublic Fenvik(int n) {\n\t\t\tt = new int[n];\n\t\t}\n\n\t\tpublic void add(int x, int delta) {\n\t\t\tfor (int i = x; i < t.length; i = (i | (i + 1))) {\n\t\t\t\tt[i] += delta;\n\t\t\t}\n\t\t}\n\n\t\tprivate int sum(int r) {\n\t\t\tint ans = 0;\n\t\t\tint x = r;\n\t\t\twhile (x >= 0) {\n\t\t\t\tans += t[x];\n\t\t\t\tx = (x & (x + 1)) - 1;\n\t\t\t}\n\t\t\treturn ans;\n\t\t}\n\n\t\tpublic int sum(int l, int r) {\n\t\t\treturn sum(r) - sum(l - 1);\n\t\t}\n\t}\n\n\tpublic class SegmentTreeMaxSum {\n\t\tint pow;\n\t\tint[] sum;\n\t\tint[] maxPrefSum;\n\t\tint[] maxSufSum;\n\t\tint[] maxSum;\n\n\t\tpublic SegmentTreeMaxSum(int[] a) {\n\t\t\tpow = 1;\n\t\t\twhile (pow < a.length) {\n\t\t\t\tpow *= 2;\n\t\t\t}\n\t\t\tsum = new int[2 * pow];\n\t\t\tmaxPrefSum = new int[2 * pow];\n\t\t\tmaxSum = new int[2 * pow];\n\t\t\tmaxSufSum = new int[2 * pow];\n\t\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\t\tsum[pow + i] = a[i];\n\t\t\t\tmaxSum[pow + i] = Math.max(a[i], 0);\n\t\t\t\tmaxPrefSum[pow + i] = maxSum[pow + i];\n\t\t\t\tmaxSufSum[pow + i] = maxSum[pow + i];\n\t\t\t}\n\t\t\tfor (int i = pow - 1; i > 0; i--) {\n\t\t\t\tupdate(i);\n\t\t\t}\n\t\t}\n\n\t\tpublic int[] get(int v, int tl, int tr, int l, int r) {\n\t\t\tif (r <= tl || l >= tr) {\n\t\t\t\tint[] ans = { 0, 0, 0, 0 };\n\t\t\t\treturn ans;\n\t\t\t}\n\t\t\tif (l <= tl && r >= tr) {\n\t\t\t\tint[] ans = { maxPrefSum[v], maxSum[v], maxSufSum[v], sum[v] };\n\t\t\t\treturn ans;\n\t\t\t}\n\t\t\tint tm = (tl + tr) / 2;\n\t\t\tint[] left = get(2 * v, tl, tm, l, r);\n\t\t\tint[] right = get(2 * v + 1, tm, tr, l, r);\n\t\t\tint[] ans = { Math.max(left[0], right[0] + left[3]),\n\t\t\t\t\tMath.max(left[1], Math.max(right[1], left[2] + right[0])), Math.max(right[2], left[2] + right[3]),\n\t\t\t\t\tleft[3] + right[3] };\n\t\t\treturn ans;\n\t\t}\n\n\t\tpublic void set(int v, int tl, int tr, int x, int value) {\n\t\t\tif (v >= pow) {\n\t\t\t\tsum[v] = value;\n\t\t\t\tmaxSum[v] = Math.max(value, 0);\n\t\t\t\tmaxPrefSum[v] = maxSum[v];\n\t\t\t\tmaxSufSum[v] = maxSum[v];\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tint tm = (tl + tr) / 2;\n\t\t\tif (x < tm) {\n\t\t\t\tset(2 * v, tl, tm, x, value);\n\t\t\t} else {\n\t\t\t\tset(2 * v + 1, tm, tr, x, value);\n\t\t\t}\n\t\t\tupdate(v);\n\t\t}\n\n\t\tpublic void update(int i) {\n\t\t\tsum[i] = f(sum[2 * i], sum[2 * i + 1]);\n\t\t\tmaxSum[i] = Math.max(maxSum[2 * i], Math.max(maxSum[2 * i + 1], maxSufSum[2 * i] + maxPrefSum[2 * i + 1]));\n\t\t\tmaxPrefSum[i] = Math.max(maxPrefSum[2 * i], maxPrefSum[2 * i + 1] + sum[2 * i]);\n\t\t\tmaxSufSum[i] = Math.max(maxSufSum[2 * i + 1], maxSufSum[2 * i] + sum[2 * i + 1]);\n\t\t}\n\n\t\tpublic int f(int a, int b) {\n\t\t\treturn a + b;\n\t\t}\n\t}\n\n\tpublic class Point implements Comparable<Point> {\n\t\tdouble x;\n\t\tdouble y;\n\n\t\tpublic Point() {\n\t\t\tx = 0;\n\t\t\ty = 0;\n\t\t}\n\n\t\tpublic Point(double x, double y) {\n\t\t\tthis.x = x;\n\t\t\tthis.y = y;\n\t\t}\n\n\t\tpublic String toString() {\n\t\t\treturn x + \" \" + y;\n\t\t}\n\n\t\tpublic boolean equals(Point p) {\n\t\t\treturn x == p.x && y == p.y;\n\t\t}\n\n\t\tpublic double dist2() {\n\t\t\treturn x * x + y * y;\n\t\t}\n\n\t\tpublic Point add(Point v) {\n\t\t\treturn new Point(x + v.x, y + v.y);\n\t\t}\n\n\t\t@Override\n\t\tpublic int compareTo(Point o) {\n\t\t\tint z = signum(x + y - o.x - o.y);\n\t\t\tif (z != 0) {\n\t\t\t\treturn z;\n\t\t\t}\n\t\t\treturn signum(x - o.x) != 0 ? signum(x - o.x) : signum(y - o.y);\n\t\t}\n\t}\n\n\tpublic class Circle implements Comparable<Circle> {\n\t\tPoint p;\n\t\tint r;\n\n\t\tpublic Circle(Point p, int r) {\n\t\t\tthis.p = p;\n\t\t\tthis.r = r;\n\t\t}\n\n\t\tpublic Point angle() {\n\t\t\tdouble z = r / sq2;\n\t\t\tz -= z % 1e-5;\n\t\t\treturn new Point(p.x - z, p.y - z);\n\t\t}\n\n\t\tpublic boolean inside(Point p) {\n\t\t\treturn hypot2(p.x - this.p.x, p.y - this.p.y) <= sq(r);\n\t\t}\n\n\t\t@Override\n\t\tpublic int compareTo(Circle o) {\n\t\t\tPoint a = angle();\n\t\t\tPoint oa = o.angle();\n\t\t\tint z = signum(a.x + a.y - oa.x - oa.y);\n\t\t\tif (z != 0) {\n\t\t\t\treturn z;\n\t\t\t}\n\t\t\treturn signum(a.y - oa.y);\n\t\t}\n\n\t}\n\n\tpublic class Fraction implements Comparable<Fraction> {\n\t\tlong x;\n\t\tlong y;\n\n\t\tpublic Fraction(long x, long y, boolean needNorm) {\n\t\t\tthis.x = x;\n\t\t\tthis.y = y;\n\t\t\tif (y < 0) {\n\t\t\t\tthis.x *= -1;\n\t\t\t\tthis.y *= -1;\n\t\t\t}\n\t\t\tif (needNorm) {\n\t\t\t\tlong gcd = gcd(this.x, this.y);\n\t\t\t\tthis.x /= gcd;\n\t\t\t\tthis.y /= gcd;\n\t\t\t}\n\t\t}\n\n\t\tpublic Fraction clone() {\n\t\t\treturn new Fraction(x, y, false);\n\t\t}\n\n\t\tpublic String toString() {\n\t\t\treturn x + \"/\" + y;\n\t\t}\n\n\t\t@Override\n\t\tpublic int compareTo(Fraction o) {\n\t\t\tlong res = x * o.y - y * o.x;\n\t\t\tif (res > 0) {\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\tif (res < 0) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\tpublic class Event implements Comparable<Event> {\n\t\tFraction f;\n\t\tint type;\n\n\t\tpublic Event(Fraction f, int type) {\n\t\t\tthis.f = f;\n\t\t\tthis.type = type;\n\t\t}\n\n\t\t@Override\n\t\tpublic int compareTo(Event o) {\n\t\t\tint c = f.compareTo(o.f);\n\t\t\tif (c != 0) {\n\t\t\t\treturn c;\n\t\t\t}\n\t\t\treturn type - o.type;\n\t\t}\n\n\t}\n\n\tpublic double sq(double x) {\n\t\treturn x * x;\n\t}\n\n\tpublic long sq(long x) {\n\t\treturn x * x;\n\t}\n\n\tpublic double hypot2(double x, double y) {\n\t\treturn sq(x) + sq(y);\n\t}\n\n\tpublic long hypot2(long x, long y) {\n\t\treturn sq(x) + sq(y);\n\t}\n\n\tpublic boolean kuhn(int v, int[][] edge, boolean[] used, int[] mt) {\n\t\tused[v] = true;\n\t\tfor (int u : edge[v]) {\n\t\t\tif (mt[u] < 0 || (!used[mt[u]] && kuhn(mt[u], edge, used, mt))) {\n\t\t\t\tmt[u] = v;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\n\tpublic int matching(int[][] edge) {\n\t\tint n = edge.length;\n\t\tint[] mt = new int[n];\n\t\tArrays.fill(mt, -1);\n\t\tboolean[] used = new boolean[n];\n\t\tint ans = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (!used[i] && kuhn(i, edge, used, mt)) {\n\t\t\t\tArrays.fill(used, false);\n\t\t\t\tans++;\n\t\t\t}\n\t\t}\n\t\treturn ans;\n\t}\n\n\tdouble sq2 = Math.sqrt(2);\n\n\tint small = 20;\n\n\tpublic class Stack {\n\t\tint[] st;\n\t\tint sz;\n\n\t\tpublic Stack(int n) {\n\t\t\tthis.st = new int[n];\n\t\t\tsz = 0;\n\t\t}\n\n\t\tpublic boolean isEmpty() {\n\t\t\treturn sz == 0;\n\t\t}\n\n\t\tpublic int peek() {\n\t\t\treturn st[sz - 1];\n\t\t}\n\n\t\tpublic int pop() {\n\t\t\tsz--;\n\t\t\treturn st[sz];\n\t\t}\n\n\t\tpublic void clear() {\n\t\t\tsz = 0;\n\t\t}\n\n\t\tpublic void add(int x) {\n\t\t\tst[sz++] = x;\n\t\t}\n\n\t\tpublic int get(int x) {\n\t\t\treturn st[x];\n\t\t}\n\t}\n\n\tpublic int[][] readGraph(int n, int m) {\n\t\tint[][] to = new int[n][];\n\t\tint[] sz = new int[n];\n\t\tint[] x = new int[m];\n\t\tint[] y = new int[m];\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tx[i] = in.nextInt() - 1;\n\t\t\ty[i] = in.nextInt() - 1;\n\t\t\tsz[x[i]]++;\n\t\t\tsz[y[i]]++;\n\t\t}\n\t\tfor (int i = 0; i < to.length; i++) {\n\t\t\tto[i] = new int[sz[i]];\n\t\t\tsz[i] = 0;\n\t\t}\n\t\tfor (int i = 0; i < x.length; i++) {\n\t\t\tto[x[i]][sz[x[i]]++] = y[i];\n\t\t\tto[y[i]][sz[y[i]]++] = x[i];\n\t\t}\n\t\treturn to;\n\t}\n\n\tpublic class Pol {\n\t\tdouble[] coeff;\n\n\t\tpublic Pol(double[] coeff) {\n\t\t\tthis.coeff = coeff;\n\t\t}\n\n\t\tpublic Pol mult(Pol p) {\n\t\t\tdouble[] ans = new double[coeff.length + p.coeff.length - 1];\n\t\t\tfor (int i = 0; i < ans.length; i++) {\n\t\t\t\tfor (int j = Math.max(0, i - p.coeff.length + 1); j < coeff.length && j <= i; j++) {\n\t\t\t\t\tans[i] += coeff[j] * p.coeff[i - j];\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn new Pol(ans);\n\t\t}\n\n\t\tpublic String toString() {\n\t\t\tString ans = \"\";\n\t\t\tfor (int i = 0; i < coeff.length; i++) {\n\t\t\t\tans += coeff[i] + \" \";\n\t\t\t}\n\t\t\treturn ans;\n\t\t}\n\n\t\tpublic double value(double x) {\n\t\t\tdouble ans = 0;\n\t\t\tdouble p = 1;\n\t\t\tfor (int i = 0; i < coeff.length; i++) {\n\t\t\t\tans += coeff[i] * p;\n\t\t\t\tp *= x;\n\t\t\t}\n\t\t\treturn ans;\n\t\t}\n\n\t\tpublic double integrate(double r) {\n\t\t\tPol p = new Pol(new double[coeff.length + 1]);\n\t\t\tfor (int i = 0; i < coeff.length; i++) {\n\t\t\t\tp.coeff[i + 1] = coeff[i] / fact[i + 1];\n\t\t\t}\n\t\t\treturn p.value(r);\n\t\t}\n\n\t\tpublic double integrate(double l, double r) {\n\t\t\treturn integrate(r) - integrate(l);\n\t\t}\n\t}\n\n\tdouble[] fact = new double[100];\n\n\tpublic class DSU1 {\n\t\tint[] p;\n\t\tint[] sz;\n\t\tStack less;\n\t\tStack more;\n\t\tPriorityQueue<Integer>[] q;\n\t\tboolean[] used;\n\n\t\t@SuppressWarnings(\"unchecked\")\n\t\tpublic DSU1(int[] v, int m) {\n\t\t\tint n = v.length;\n\t\t\tp = new int[n];\n\t\t\tsz = new int[n];\n\t\t\tq = new PriorityQueue[n];\n\t\t\tless = new Stack(m);\n\t\t\tmore = new Stack(m);\n\t\t\tused = new boolean[n + 1];\n\t\t\tfor (int i = 0; i < v.length; i++) {\n\t\t\t\tp[i] = i;\n\t\t\t\tsz[i] = 1;\n\t\t\t\tq[i] = new PriorityQueue<>();\n\t\t\t\tq[i].add(-v[i]);\n\t\t\t}\n\t\t}\n\n\t\tpublic int get(int x) {\n\t\t\twhile (x != p[x]) {\n\t\t\t\tx = p[x];\n\t\t\t}\n\t\t\treturn x;\n\t\t}\n\n\t\tpublic boolean unite(int a, int b) {\n\t\t\tint pa = get(a);\n\t\t\tint pb = get(b);\n\t\t\tif (pa == pb) {\n\t\t\t\tless.add(-1);\n\t\t\t\tmore.add(-1);\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif (sz[pa] < sz[pb]) {\n\t\t\t\tp[pa] = pb;\n\t\t\t\tsz[pb] += sz[pa];\n\n\t\t\t\tless.add(pa);\n\t\t\t\tmore.add(pb);\n\t\t\t\tfor (int i : q[pa]) {\n\t\t\t\t\tq[pb].add(i);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tp[pb] = pa;\n\t\t\t\tsz[pa] += sz[pb];\n\n\t\t\t\tless.add(pb);\n\t\t\t\tmore.add(pa);\n\t\t\t\tfor (int i : q[pb]) {\n\t\t\t\t\tq[pa].add(i);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\t\tpublic void popEdge() {\n\t\t\tint pa = less.pop();\n\t\t\tint pb = more.pop();\n\t\t\tif (pa < 0) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tp[pa] = pa;\n\t\t\tsz[pb] -= sz[pa];\n\t\t}\n\n\t\tpublic int poll(int x) {\n\t\t\tint px = get(x);\n\t\t\twhile (!q[px].isEmpty()) {\n\t\t\t\tint v = -q[px].poll();\n\t\t\t\tif (!used[v] && get(inv[v - 1]) == px) {\n\t\t\t\t\tused[v] = true;\n\t\t\t\t\treturn v;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\t}\n\t\n\tint[] inv;\n\n\tpublic void solve() {\n\t\tint n = in.nextInt();\n\t\tint m = in.nextInt();\n\t\tint q = in.nextInt();\n\t\tint[] v = new int[n];\n\t\tinv = new int[n];\n\t\tfor (int i = 0; i < v.length; i++) {\n\t\t\tv[i] = in.nextInt();\n\t\t\tinv[v[i] - 1] = i;\n\t\t}\n\t\tint[] a = new int[m];\n\t\tint[] b = new int[m];\n\t\tfor (int i = 0; i < b.length; i++) {\n\t\t\ta[i] = in.nextInt() - 1;\n\t\t\tb[i] = in.nextInt() - 1;\n\t\t}\n\t\tboolean[] type = new boolean[q];\n\t\tint[] x = new int[q];\n\t\tboolean[] removed = new boolean[m];\n\t\tfor (int i = 0; i < q; i++) {\n\t\t\tif (in.nextInt() == 1) {\n\t\t\t\tx[i] = in.nextInt() - 1;\n\t\t\t\ttype[i] = true;\n\t\t\t} else {\n\t\t\t\tx[i] = in.nextInt() - 1;\n\t\t\t\tremoved[x[i]] = true;\n\t\t\t}\n\t\t}\n\t\tDSU1 dsu = new DSU1(v, m);\n\t\tfor (int i = 0; i < removed.length; i++) {\n\t\t\tif (!removed[i]) {\n\t\t\t\tdsu.unite(a[i], b[i]);\n\t\t\t}\n\t\t}\n\t\tfor (int i = q - 1; i >= 0; i--) {\n\t\t\tif (!type[i]) {\n\t\t\t\tdsu.unite(a[x[i]], b[x[i]]);\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < q; i++) {\n\t\t\tif (type[i]) {\n\t\t\t\tout.println(dsu.poll(x[i]));\n\t\t\t} else {\n\t\t\t\tdsu.popEdge();\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic void add(HashMap<Integer, Integer> map, int x) {\n\t\tif (map.containsKey(x)) {\n\t\t\tmap.put(x, map.get(x) + 1);\n\t\t} else {\n\t\t\tmap.put(x, 1);\n\t\t}\n\t}\n\n\tpublic void run() {\n\t\ttry {\n\t\t\tif (systemIO) {\n\t\t\t\tin = new FastScanner(System.in);\n\t\t\t\tout = new PrintWriter(System.out);\n\t\t\t} else {\n\t\t\t\tin = new FastScanner(new File(\"input.txt\"));\n\t\t\t\tout = new PrintWriter(new File(\"output.txt\"));\n\t\t\t}\n\t\t\tsolve();\n\n\t\t\tout.close();\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}\n\n\tclass FastScanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tFastScanner(File f) {\n\t\t\ttry {\n\t\t\t\tbr = new BufferedReader(new FileReader(f));\n\t\t\t} catch (FileNotFoundException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\n\t\tFastScanner(InputStream f) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(f));\n\t\t}\n\n\t\tString nextLine() {\n\t\t\ttry {\n\t\t\t\treturn br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\n\t\tString next() {\n\t\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t}\n\n\t// AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\n\tpublic static void main(String[] arg) {\n\t\tnew E().run();\n\t}\n}", "lang_cluster": "Java", "tags": ["dsu", "graphs", "data structures", "implementation", "trees"], "code_uid": "5654f177e73f147936d747286336b1cc", "src_uid": "ad014bde729222db14f38caa521e4167", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\n/*\npolyakoff\n*/\n\npublic class Main {\n\n static FastReader in;\n static PrintWriter out;\n static Random rand = new Random();\n static final int oo = (int) 1e9 + 10;\n static final long OO = (long) 2e18 + 20;\n static final int MOD = (int) 1e9 + 7;\n\n static int n;\n static int[] par, p;\n\n static int findSet(int u) {\n if (par[u] == u)\n return u;\n return par[u] = findSet(par[u]);\n }\n\n static class SegTree {\n class Node {\n int max;\n Pair lr;\n\n Node(int max, Pair lr) {\n this.max = max;\n this.lr = lr;\n }\n }\n Node[] t;\n int size;\n\n void push(int u) {\n if (t[u].lr.l != -1) {\n t[u * 2 + 1].lr.l = t[u].lr.l;\n t[u * 2 + 1].lr.r = t[u].lr.r;\n t[u * 2 + 2].lr.l = t[u].lr.l;\n t[u * 2 + 2].lr.r = t[u].lr.r;\n t[u].lr.l = t[u].lr.r = -1;\n }\n }\n void pull(int u) {\n t[u].max = p[t[u * 2 + 1].max] > p[t[u * 2 + 2].max] ? t[u * 2 + 1].max : t[u * 2 + 2].max;\n }\n void build(int u, int tl, int tr, int[][] initial) {\n if (tl == tr) {\n t[u] = new Node(initial[tl][0], new Pair(initial[tl][1], initial[tl][2]));\n } else {\n int tm = (tl + tr) / 2;\n build(u * 2 + 1, tl, tm, initial);\n build(u * 2 + 2, tm + 1, tr, initial);\n t[u] = new Node(-1, new Pair(-1, -1));\n pull(u);\n }\n }\n int maxPOn(int u, int tl, int tr, int l, int r) {\n if (r < tl || tr < l)\n return n;\n if (l <= tl && tr <= r)\n return t[u].max;\n int tm = (tl + tr) / 2;\n push(u);\n int v1 = maxPOn(u * 2 + 1, tl, tm, l, r);\n int v2 = maxPOn(u * 2 + 2, tm + 1, tr, l, r);\n return p[v1] > p[v2] ? v1 : v2;\n }\n void setPIn(int u, int tl, int tr, int i, int p) {\n if (tl == tr) {\n\n } else {\n int tm = (tl + tr) / 2;\n push(u);\n if (i <= tm) {\n setPIn(u * 2 + 1, tl, tm, i, p);\n } else {\n setPIn(u * 2 + 2, tm + 1, tr, i, p);\n }\n pull(u);\n }\n }\n void setLROn(int u, int tl, int tr, int l, int r, int newL, int newR) {\n if (r < tl || tr < l)\n return;\n if (l <= tl && tr <= r) {\n t[u].lr.l = newL;\n t[u].lr.r = newR;\n return;\n }\n int tm = (tl + tr) / 2;\n push(u);\n setLROn(u * 2 + 1, tl, tm, l, r, newL, newR);\n setLROn(u * 2 + 2, tm + 1, tr, l, r, newL, newR);\n pull(u);\n }\n Pair LRIn(int u, int tl, int tr, int i) {\n if (tl == tr) {\n return t[u].lr;\n }\n int tm = (tl + tr) / 2;\n push(u);\n if (i <= tm) {\n return LRIn(u * 2 + 1, tl, tm, i);\n } else {\n return LRIn(u * 2 + 2, tm + 1, tr, i);\n }\n }\n\n void build(int[][] initial) {\n size = initial.length;\n t = new Node[size * 4];\n build(0, 0, size - 1, initial);\n }\n int maxPOn(int l, int r) {\n return maxPOn(0, 0, size - 1, l, r);\n }\n void setPIn(int i, int p) {\n setPIn(0, 0, size - 1, i, p);\n }\n void setLROn(int l, int r, int newL, int newR) {\n setLROn(0, 0, size - 1, l, r, newL, newR);\n }\n Pair LRIn(int i) {\n return LRIn(0, 0, size - 1, i);\n }\n }\n\n static class Pair {\n int l, r;\n\n Pair(int l, int r) {\n this.l = l;\n this.r = r;\n }\n }\n\n static class Edge {\n int u, v, l1, r1, l2, r2;\n boolean removed;\n\n Edge(int u, int v) {\n this.u = u;\n this.v = v;\n l1 = r1 = l2 = r2 = -1;\n }\n }\n\n static class Query {\n int type, x;\n\n Query(int type, int x) {\n this.type = type;\n this.x = x;\n }\n }\n\n static void solve() {\n n = in.nextInt();\n int m = in.nextInt();\n int q = in.nextInt();\n\n p = new int[n + 1];\n p[n] = 0;\n for (int i = 0; i < n; i++) {\n p[i] = in.nextInt();\n }\n\n Edge[] edges = new Edge[m];\n for (int i = 0; i < m; i++) {\n int u = in.nextInt() - 1;\n int v = in.nextInt() - 1;\n edges[i] = new Edge(u, v);\n }\n\n Query[] queries = new Query[q];\n for (int i = 0; i < q; i++) {\n int type = in.nextInt();\n int x = in.nextInt() - 1;\n queries[i] = new Query(type, x);\n if (type == 2)\n edges[x].removed = true;\n }\n\n par = new int[n];\n int[] size = new int[n];\n ArrayList<Integer>[] subtree = new ArrayList[n];\n for (int i = 0; i < n; i++) {\n par[i] = i;\n size[i] = 1;\n subtree[i] = new ArrayList<>();\n subtree[i].add(i);\n }\n\n for (Edge e : edges) {\n if (e.removed)\n continue;\n int u = findSet(e.u);\n int v = findSet(e.v);\n if (u == v)\n continue;\n if (size[u] < size[v]) {\n u ^= v; v ^= u; u ^= v;\n }\n par[v] = u;\n size[u] += size[v];\n subtree[u].addAll(subtree[v]);\n }\n\n for (int i = q - 1; i >= 0; i--) {\n Query query = queries[i];\n if (query.type == 1)\n continue;\n Edge e = edges[query.x];\n int u = findSet(e.u);\n int v = findSet(e.v);\n if (u == v)\n continue;\n if (size[u] < size[v]) {\n u ^= v; v ^= u; u ^= v;\n }\n par[v] = u;\n size[u] += size[v];\n e.l1 = subtree[u].get(0);\n e.r1 = subtree[u].get(subtree[u].size() - 1);\n e.l2 = subtree[v].get(0);\n e.r2 = subtree[v].get(subtree[v].size() - 1);\n subtree[u].addAll(subtree[v]);\n }\n\n int[][] initial = new int[n][3];\n int[] pos = new int[n];\n for (int u = 0, i = 0; u < n; u++) {\n if (findSet(u) == u) {\n initial[u][1] = i;\n initial[u][2] = i + size[u] - 1;\n for (int v : subtree[u]) {\n initial[i][0] = v;\n initial[i][1] = initial[u][1];\n initial[i][2] = initial[u][2];\n pos[v] = i;\n i++;\n }\n }\n }\n\n SegTree st = new SegTree();\n st.build(initial);\n\n for (int i = 0; i < q; i++) {\n Query query = queries[i];\n if (query.type == 1) {\n int u = query.x;\n Pair lr = st.LRIn(pos[u]);\n int v = st.maxPOn(lr.l, lr.r);\n out.println(p[v]);\n if (v != n) {\n p[v] = 0;\n st.setPIn(pos[v], 0);\n }\n } else {\n Edge e = edges[query.x];\n if (e.l1 != -1) {\n st.setLROn(pos[e.l1], pos[e.r1], pos[e.l1], pos[e.r1]);\n st.setLROn(pos[e.l2], pos[e.r2], pos[e.l2], pos[e.r2]);\n }\n }\n }\n\n\n }\n\n\n public static void main(String[] args) {\n in = new FastReader();\n out = new PrintWriter(System.out);\n// fileInputOutput();\n\n int T = 1;\n// T = in.nextInt();\n while (T-- > 0)\n solve();\n\n out.flush();\n out.close();\n }\n\n static void fileInputOutput() {\n try {\n in = new FastReader(\"input.txt\");\n out = new PrintWriter(new FileOutputStream(\"output.txt\"));\n } catch (FileNotFoundException e) {\n throw new RuntimeException(e);\n }\n }\n\n static void runInThread() {\n Thread thread = new Thread(null, () -> {\n int T = 1;\n// T = in.nextInt();\n while (T-- > 0)\n solve();\n }, \"thread1\", 1 << 28);\n thread.start();\n try {\n thread.join();\n } catch (InterruptedException e) {\n throw new RuntimeException(e);\n }\n }\n\n static class FastReader {\n BufferedReader br;\n StringTokenizer st;\n\n FastReader() {\n this(System.in);\n }\n FastReader(String file) throws FileNotFoundException {\n this(new FileInputStream(file));\n }\n FastReader(InputStream is) {\n br = new BufferedReader(new InputStreamReader(is));\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n long nextLong() {\n return Long.parseLong(next());\n }\n double nextDouble() {\n return Double.parseDouble(next());\n }\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(nextLine());\n }\n return st.nextToken();\n }\n String nextLine() {\n String line;\n try {\n line = br.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n return line;\n }\n }\n}", "lang_cluster": "Java", "tags": ["dsu", "graphs", "data structures", "implementation", "trees"], "code_uid": "b9fba5f905db4759aefa07c765292588", "src_uid": "ad014bde729222db14f38caa521e4167", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "//package round673;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class D {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t\tint n = ni(), m = ni(), Q = ni();\n\t\tint[] a = na(n);\n\t\tint[] from = new int[m];\n\t\tint[] to = new int[m];\n\t\tboolean[] remain = new boolean[m];\n\t\tfor(int i = 0;i < m;i++) {\n\t\t\tfrom[i] = ni()-1;\n\t\t\tto[i] = ni()-1;\n\t\t}\n\t\tArrays.fill(remain, true);\n\t\t\n\t\t\n\t\tint[][] qs = new int[Q][];\n\t\tfor(int i = 0;i < Q;i++) {\n\t\t\tqs[i] = new int[] {ni(), ni()-1};\n\t\t\tif(qs[i][0] == 2) {\n\t\t\t\tremain[qs[i][1]] = false;\n\t\t\t}\n\t\t}\n\t\t\n\t\tint gen = n;\n\t\tint[] par = new int[2*n];\n\t\tArrays.fill(par, -1);\n\t\tDJSet ds = new DJSet(n);\n\t\tfor(int i = 0;i < m;i++) {\n\t\t\tif(remain[i]) {\n\t\t\t\tif(!ds.equiv(from[i], to[i])) {\n\t\t\t\t\tint f = ds.tr[ds.root(from[i])];\n\t\t\t\t\tint t = ds.tr[ds.root(to[i])];\n\t\t\t\t\tds.union(from[i], to[i]);\n\t\t\t\t\tpar[f] = gen;\n\t\t\t\t\tpar[t] = gen;\n\t\t\t\t\tds.tr[ds.root(from[i])] = gen;\n\t\t\t\t\tgen++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tint[] time = new int[2*n];\n\t\tArrays.fill(time, Q);\n\t\tfor(int i = Q-1;i >= 0;i--) {\n\t\t\tif(qs[i][0] == 2) {\n\t\t\t\tint ind = qs[i][1];\n\t\t\t\tif(!ds.equiv(from[ind], to[ind])) {\n\t\t\t\t\tint f = ds.tr[ds.root(from[ind])];\n\t\t\t\t\tint t = ds.tr[ds.root(to[ind])];\n\t\t\t\t\tds.union(from[ind], to[ind]);\n\t\t\t\t\tpar[f] = gen;\n\t\t\t\t\tpar[t] = gen;\n\t\t\t\t\tds.tr[ds.root(from[ind])] = gen;\n\t\t\t\t\ttime[gen] = i;\n\t\t\t\t\tgen++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\ttime[2*n-1] = -1;\n\t\tfor(int i = 0;i < 2*n-1;i++) {\n\t\t\tif(par[i] == -1) {\n\t\t\t\tpar[i] = 2*n-1;\n\t\t\t}\n\t\t}\n\t\t\n\t\tint[][] g = parentToG(par);\n\t\tint[][] rights = makeRights(g, par, 2*n-1);\n\t\tint[] iord = rights[1], right = rights[2];\n\t\tint[][] spar = logstepParents(par);\n\t\t\n\t\tint[] b = new int[2*n];\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\tb[iord[i]] = -a[i];\n\t\t}\n\t\tSegmentTreeRMQPos st = new SegmentTreeRMQPos(b);\n\t\tfor(int i = 0;i < Q;i++) {\n\t\t\tint[] q = qs[i];\n\t\t\tif(q[0] == 1) {\n\t\t\t\tint v = q[1];\n\t\t\t\tfor(int d = spar.length-1;d >= 0;d--) {\n\t\t\t\t\tint anc = spar[d][v];\n\t\t\t\t\tif(anc == -1)continue;\n\t\t\t\t\tif(time[anc] < i)continue;\n\t\t\t\t\tv = anc;\n\t\t\t\t}\n\t\t\t\tint[] vp = st.min(iord[v], right[iord[v]]);\n\t\t\t\tout.println(-vp[0]);\n\t\t\t\tst.update(vp[1], 0);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tpublic static class SegmentTreeRMQPos {\n\t\tpublic int M, H, N, B;\n\t\tpublic int[] st;\n\t\tpublic int[] pos;\n\t\t\n\t\tpublic SegmentTreeRMQPos(int n)\n\t\t{\n\t\t\tN = n;\n\t\t\tM = Integer.highestOneBit(Math.max(n, 1))<<2;\n\t\t\tH = M>>>1;\n\t\t\tB = Integer.numberOfTrailingZeros(H);\n\t\t\tst = new int[M];\n\t\t\tpos = new int[M];\n\t\t\tfor(int i = M-1;i >= H;i--)pos[i] = i-H;\n\t\t\tfor(int i = H-1;i >= 0;i--){\n\t\t\t\tpos[i] = pos[2*i];\n\t\t\t}\n\t\t}\n\t\t\n\t\tpublic SegmentTreeRMQPos(int[] a)\n\t\t{\n\t\t\tN = a.length;\n\t\t\tM = Integer.highestOneBit(Math.max(N, 1))<<2;\n\t\t\tH = M>>>1;\n\t\t\tB = Integer.numberOfTrailingZeros(H);\n\t\t\tst = new int[M];\n\t\t\tpos = new int[M];\n\t\t\tfor(int i = 0;i < N;i++){\n\t\t\t\tst[H+i] = a[i];\n\t\t\t\tpos[H+i] = i;\n\t\t\t}\n\t\t\tArrays.fill(st, H+N, M, Integer.MAX_VALUE);\n\t\t\tfor(int i = (M>>1)-1;i >= 1;i--)propagate(i);\n\t\t}\n\t\t\n\t\tpublic void update(int p, int x)\n\t\t{\n\t\t\tst[H+p] = x;\n\t\t\tfor(int i = (H+p)>>>1;i >= 1;i >>>= 1)propagate(i);\n\t\t}\n\t\t\n\t\tprivate void propagate(int i)\n\t\t{\n\t\t\tif(st[i*2] <= st[i*2+1]){\n\t\t\t\tst[i] = st[i*2];\n\t\t\t\tpos[i] = pos[i*2];\n\t\t\t}else{\n\t\t\t\tst[i] = st[i*2+1];\n\t\t\t\tpos[i] = pos[i*2+1];\n\t\t\t}\n\t\t}\n\t\t\n\t\tpublic int[] min(int f, int t) { return min(f, t, B); }\n\t\t\n\t\tpublic int[] min(int f, int t, int b)\n\t\t{\n\t\t\tif(f>>b<<b==f && t+1>>b<<b==t+1){\n\t\t\t\treturn new int[]{st[(H|f)>>b], pos[(H|f)>>b]};\n\t\t\t}\n\t\t\t\n\t\t\tb--;\n\t\t\tif((f^t)<<31-b<0){\n\t\t\t\tint w = t>>b<<b;\n\t\t\t\tint[] l = min(f, w-1, b);\n\t\t\t\tint[] r = min(w, t, b);\n\t\t\t\treturn l[0] <= r[0] ? l : r;\n\t\t\t}else{\n\t\t\t\treturn min(f, t, b);\n\t\t\t}\n\t\t}\n\t}\n\n\t\n\tpublic static int[] sortByPreorder(int[][] g, int root){\n\t\tint n = g.length;\n\t\tint[] stack = new int[n];\n\t\tint[] ord = new int[n];\n\t\tboolean[] ved = new boolean[n];\n\t\tstack[0] = root;\n\t\tint p = 1;\n\t\tint r = 0;\n\t\tved[root] = true;\n\t\twhile(p > 0){\n\t\t\tint cur = stack[p-1];\n\t\t\tord[r++] = cur;\n\t\t\tp--;\n\t\t\tfor(int e : g[cur]){\n\t\t\t\tif(!ved[e]){\n\t\t\t\t\tved[e] = true;\n\t\t\t\t\tstack[p++] = e;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn ord;\n\t}\n\t\n\tpublic static int[][] makeRights(int[][] g, int[] par, int root)\n\t{\n\t\tint n = g.length;\n\t\tint[] ord = sortByPreorder(g, root);\n\t\tint[] iord = new int[n];\n\t\tfor(int i = 0;i < n;i++)iord[ord[i]] = i;\n\t\t\n\t\tint[] right = new int[n];\n\t\tfor(int i = n-1;i >= 1;i--){\n\t\t\tif(right[i] == 0)right[i] = i;\n\t\t\tint p = iord[par[ord[i]]];\n\t\t\tright[p] = Math.max(right[p], right[i]);\n\t\t}\n\t\treturn new int[][]{ord, iord, right};\n\t}\n\n\t\n\tpublic static int lca2(int a, int b, int[][] spar, int[] depth) {\n\t\tif (depth[a] < depth[b]) {\n\t\t\tb = ancestor(b, depth[b] - depth[a], spar);\n\t\t} else if (depth[a] > depth[b]) {\n\t\t\ta = ancestor(a, depth[a] - depth[b], spar);\n\t\t}\n\n\t\tif (a == b)\n\t\t\treturn a;\n\t\tint sa = a, sb = b;\n\t\tfor (int low = 0, high = depth[a], t = Integer.highestOneBit(high), k = Integer\n\t\t\t\t.numberOfTrailingZeros(t); t > 0; t >>>= 1, k--) {\n\t\t\tif ((low ^ high) >= t) {\n\t\t\t\tif (spar[k][sa] != spar[k][sb]) {\n\t\t\t\t\tlow |= t;\n\t\t\t\t\tsa = spar[k][sa];\n\t\t\t\t\tsb = spar[k][sb];\n\t\t\t\t} else {\n\t\t\t\t\thigh = low | t - 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn spar[0][sa];\n\t}\n\n\tprotected static int ancestor(int a, int m, int[][] spar) {\n\t\tfor (int i = 0; m > 0 && a != -1; m >>>= 1, i++) {\n\t\t\tif ((m & 1) == 1)\n\t\t\t\ta = spar[i][a];\n\t\t}\n\t\treturn a;\n\t}\n\n\tpublic static int[][] logstepParents(int[] par) {\n\t\tint n = par.length;\n\t\tint m = Integer.numberOfTrailingZeros(Integer.highestOneBit(n - 1)) + 1;\n\t\tint[][] pars = new int[m][n];\n\t\tpars[0] = par;\n\t\tfor (int j = 1; j < m; j++) {\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tpars[j][i] = pars[j - 1][i] == -1 ? -1 : pars[j - 1][pars[j - 1][i]];\n\t\t\t}\n\t\t}\n\t\treturn pars;\n\t}\n\t\n\tpublic static int[][] parentToG(int[] par)\n\t{\n\t\tint n = par.length;\n\t\tint[] ct = new int[n];\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tif(par[i] >= 0){\n\t\t\t\tct[i]++;\n\t\t\t\tct[par[i]]++;\n\t\t\t}\n\t\t}\n\t\tint[][] g = new int[n][];\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tg[i] = new int[ct[i]];\n\t\t}\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tif(par[i] >= 0){\n\t\t\t\tg[par[i]][--ct[par[i]]] = i;\n\t\t\t\tg[i][--ct[i]] = par[i];\n\t\t\t}\n\t\t}\n\t\treturn g;\n\t}\n\n\t\n\tpublic static class DJSet {\n\t\tpublic int[] upper;\n\t\tpublic int[] tr;\n\n\t\tpublic DJSet(int n) {\n\t\t\tupper = new int[n];\n\t\t\tArrays.fill(upper, -1);\n\t\t\ttr = new int[n];\n\t\t\tfor(int i = 0;i < n;i++) tr[i] = i;\n\t\t}\n\n\t\tpublic int root(int x) {\n\t\t\treturn upper[x] < 0 ? x : (upper[x] = root(upper[x]));\n\t\t}\n\n\t\tpublic boolean equiv(int x, int y) {\n\t\t\treturn root(x) == root(y);\n\t\t}\n\n\t\tpublic boolean union(int x, int y) {\n\t\t\tx = root(x);\n\t\t\ty = root(y);\n\t\t\tif (x != y) {\n\t\t\t\tif (upper[y] < upper[x]) {\n\t\t\t\t\tint d = x;\n\t\t\t\t\tx = y;\n\t\t\t\t\ty = d;\n\t\t\t\t}\n\t\t\t\tupper[x] += upper[y];\n\t\t\t\tupper[y] = x;\n\t\t\t}\n\t\t\treturn x == y;\n\t\t}\n\n\t\tpublic int count() {\n\t\t\tint ct = 0;\n\t\t\tfor (int u : upper)\n\t\t\t\tif (u < 0)\n\t\t\t\t\tct++;\n\t\t\treturn ct;\n\t\t}\n\t}\n\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new D().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["dsu", "graphs", "data structures", "implementation", "trees"], "code_uid": "ba9dbe3a0a56c77e9aa3421409d6b0aa", "src_uid": "ad014bde729222db14f38caa521e4167", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\n/*\npolyakoff\n*/\n\npublic class Main {\n\n static FastReader in;\n static PrintWriter out;\n static Random rand = new Random();\n static final int oo = (int) 1e9 + 10;\n static final long OO = (long) 2e18 + 20;\n static final int MOD = (int) 1e9 + 7;\n static final int N = 400_004;\n\n static int n, m, q, timer;\n static int[] p, par, tin, tout, pos;\n static Edge[] edges;\n static Query[] queries;\n static int[][] sons;\n static ArrayList<Integer> order;\n\n static class Edge {\n int u, v;\n boolean unstable;\n\n Edge(int u, int v) {\n this.u = u;\n this.v = v;\n }\n }\n\n static class Query {\n int type, x;\n int leader; // if type = 1\n\n Query(int type, int x) {\n this.type = type;\n this.x = x;\n }\n }\n\n static class SegTree {\n int[] t;\n int size;\n\n void build(int u, int tl, int tr, ArrayList<Integer> al) {\n if (tl == tr) {\n t[u] = al.get(tl);\n } else {\n int tm = (tl + tr) / 2;\n build(u * 2 + 1, tl, tm, al);\n build(u * 2 + 2, tm + 1, tr, al);\n t[u] = Math.max(t[u * 2 + 1], t[u * 2 + 2]);\n }\n }\n int maxOn(int u, int tl, int tr, int l, int r) {\n if (r < tl || tr < l)\n return -oo;\n if (l <= tl && tr <= r)\n return t[u];\n int tm = (tl + tr) / 2;\n return Math.max(maxOn(u * 2 + 1, tl, tm, l, r), maxOn(u * 2 + 2, tm + 1, tr, l, r));\n }\n void setIn(int u, int tl, int tr, int i, int val) {\n if (tl == tr) {\n t[u] = val;\n } else {\n int tm = (tl + tr) / 2;\n if (i <= tm) {\n setIn(u * 2 + 1, tl, tm, i, val);\n } else {\n setIn(u * 2 + 2, tm + 1, tr, i, val);\n }\n t[u] = Math.max(t[u * 2 + 1], t[u * 2 + 2]);\n }\n }\n\n void build(ArrayList<Integer> al) {\n size = al.size();\n t = new int[size * 4];\n build(0, 0, size - 1, al);\n }\n int maxOn(int l, int r) {\n return maxOn(0, 0, size - 1, l, r);\n }\n void setIn(int i, int val) {\n setIn(0, 0, size - 1, i, val);\n }\n }\n\n static int findSet(int u) {\n if (u == par[u])\n return u;\n return par[u] = findSet(par[u]);\n }\n\n static void uniteSets(int u, int v) {\n u = findSet(u);\n v = findSet(v);\n if (u != v) {\n int parent = n++;\n sons[parent][0] = u;\n sons[parent][1] = v;\n par[parent] = parent;\n par[u] = parent;\n par[v] = parent;\n }\n }\n\n static void dfs(int u) {\n order.add(p[u]);\n if (p[u] != 0)\n pos[p[u]] = timer;\n tin[u] = timer++;\n for (int i = 0; i < 2; i++) {\n if (sons[u][i] != -1)\n dfs(sons[u][i]);\n }\n tout[u] = timer;\n }\n\n static void solve() {\n n = in.nextInt();\n m = in.nextInt();\n q = in.nextInt();\n\n p = new int[N];\n for (int i = 0; i < n; i++) {\n p[i] = in.nextInt();\n }\n\n edges = new Edge[m];\n for (int i = 0; i < m; i++) {\n int u = in.nextInt() - 1;\n int v = in.nextInt() - 1;\n edges[i] = new Edge(u, v);\n }\n\n queries = new Query[q];\n for (int i = 0; i < q; i++) {\n int type = in.nextInt();\n int x = in.nextInt() - 1;\n queries[i] = new Query(type, x);\n if (type == 2)\n edges[x].unstable = true;\n }\n\n par = new int[N]; Arrays.fill(par, -1);\n sons = new int[N][2];\n for (int i = 0; i < n; i++) {\n par[i] = i;\n sons[i][0] = sons[i][1] = -1;\n }\n\n for (Edge e : edges) {\n if (!e.unstable)\n uniteSets(e.u, e.v);\n }\n for (int i = q - 1; i >= 0; i--) {\n Query query = queries[i];\n if (query.type == 1) {\n int u = query.x;\n query.leader = findSet(u);\n } else {\n Edge e = edges[query.x];\n uniteSets(e.u, e.v);\n }\n }\n for (int u = 1; u < n; u++) {\n uniteSets(0, u);\n }\n int root = findSet(0);\n\n tin = new int[N];\n tout = new int[N];\n order = new ArrayList<>();\n pos = new int[N];\n timer = 0;\n dfs(root);\n\n SegTree st = new SegTree();\n st.build(order);\n\n for (int i = 0; i < q; i++) {\n Query query = queries[i];\n if (query.type == 1) {\n int u = query.leader;\n int maxP = st.maxOn(tin[u], tout[u] - 1);\n out.println(maxP);\n if (maxP != 0)\n st.setIn(pos[maxP], 0);\n }\n }\n\n\n }\n\n\n public static void main(String[] args) {\n in = new FastReader();\n out = new PrintWriter(System.out);\n// fileInputOutput();\n\n int T = 1;\n// T = in.nextInt();\n while (T-- > 0)\n solve();\n\n out.flush();\n out.close();\n }\n\n static void fileInputOutput() {\n try {\n in = new FastReader(\"input.txt\");\n out = new PrintWriter(new FileOutputStream(\"output.txt\"));\n } catch (FileNotFoundException e) {\n throw new RuntimeException(e);\n }\n }\n\n static void runInThread() {\n Thread thread = new Thread(null, () -> {\n int T = 1;\n// T = in.nextInt();\n while (T-- > 0)\n solve();\n }, \"thread1\", 1 << 28);\n thread.start();\n try {\n thread.join();\n } catch (InterruptedException e) {\n throw new RuntimeException(e);\n }\n }\n\n static class FastReader {\n BufferedReader br;\n StringTokenizer st;\n\n FastReader() {\n this(System.in);\n }\n FastReader(String file) throws FileNotFoundException {\n this(new FileInputStream(file));\n }\n FastReader(InputStream is) {\n br = new BufferedReader(new InputStreamReader(is));\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n long nextLong() {\n return Long.parseLong(next());\n }\n double nextDouble() {\n return Double.parseDouble(next());\n }\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(nextLine());\n }\n return st.nextToken();\n }\n String nextLine() {\n String line;\n try {\n line = br.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n return line;\n }\n }\n}", "lang_cluster": "Java", "tags": ["dsu", "graphs", "data structures", "implementation", "trees"], "code_uid": "7f1856ad5db4abb27348489c4e297859", "src_uid": "ad014bde729222db14f38caa521e4167", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.BufferedReader;\nimport java.util.*;\n\npublic class E_New_Game_Plus {\n private static final FastReader fs = new FastReader();\n private static final PrintWriter out = new PrintWriter(System.out);\n\n private static void solve() {\n int n = fs.nextInt(),k = fs.nextInt();\n long[] boss = fs.readlongarray(n);\n rSort(boss);\n PriorityQueue<Long> pq = new PriorityQueue<>(Collections.reverseOrder());\n for(int i = 0; i<k+1; i++) {\n \tpq.add(0*1l);\n }\n long ans = 0;\n for(int i = 0; i<n; i++) {\n \tlong x = pq.remove();\n \tans += x;\n \tpq.add(x+boss[i]);\n }\n out.println(ans);\n }\n\n private static void rSort(long[]a){\n ArrayList<Long> tmp = new ArrayList<>();\n for(long x : a)\n tmp.add(x);\n Collections.sort(tmp);\n Collections.reverse(tmp);\n for(int i = 0; i<tmp.size(); i++)\n a[i] = tmp.get(i);\n }\n\n public static void main(String[] args) {\n Thread t = new Thread(null, null, \"\", 1 << 28) {\n public void run() {\n int test_case = 1;\n //test_case = fs.nextInt();\n for (int cs = 1; cs <= test_case; cs++) {\n solve();\n }\n out.close();\n }\n };\n t.start();\n try {\n t.join();\n } catch (InterruptedException e) {\n e.printStackTrace();\n }\n }\n\n private static class FastReader {\n BufferedReader br;\n StringTokenizer st;\n\n public FastReader() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n\n int[] readintarray(int n) {\n int res[] = new int[n];\n for (int i = 0; i < n; i++)\n res[i] = nextInt();\n return res;\n }\n\n long[] readlongarray(int n) {\n long res[] = new long[n];\n for (int i = 0; i < n; i++)\n res[i] = nextLong();\n return res;\n }\n }\n\n private static class cf {\n public static int min(int x, int y) {\n return Math.min(x, y);\n }\n\n public static int max(int x, int y) {\n return Math.max(x, y);\n }\n\n public static long min(long x, long y) {\n return Math.min(x, y);\n }\n\n public static long max(long x, long y) {\n return Math.max(x, y);\n }\n\n public static int abs(int x) {\n return x >= 0 ? x : -x;\n }\n\n public static long abs(long x) {\n return x >= 0 ? x : -x;\n }\n\n public static boolean even(int x) {\n return x % 2 == 0 ? true : false;\n }\n\n public static boolean even(long x) {\n return x % 2 == 0 ? true : false;\n }\n\n public static int power(int base, int exponent) {\n int res = 1;\n while (exponent > 0) {\n if (!even(exponent))\n res *= base;\n exponent >>= 1;\n base *= base;\n }\n return res;\n }\n\n public static long power(long base, long exponent) {\n long res = 1;\n while (exponent > 0) {\n if (!even(exponent))\n res *= base;\n exponent >>= 1;\n base *= base;\n }\n return res;\n }\n\n public static long mul(long a, long b, long mod) {\n return (a % mod * b % mod) % mod;\n }\n\n public static long add(long a, long b, long mod) {\n return (a % mod + b % mod) % mod;\n }\n\n public static long sub(long a, long b, long mod) {\n return ((a % mod - b % mod) % mod + mod) % mod;\n }\n\n public static long power(long base, long exponent, long mod) {\n long res = 1;\n base %= mod;\n while (exponent > 0) {\n if (!even(exponent))\n res = mul(res, base, mod);\n exponent >>= 1;\n base = mul(base, base, mod);\n }\n return res;\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["math", "greedy", "constructive algorithms"], "code_uid": "e9855845017eff72c5f640db6103d2b1", "src_uid": "53155daf2375e01a3b87fa1c76f1e9a8", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class E {\n\n public static void main(String[] args) {\n FastReader scan = new FastReader();\n PrintWriter out = new PrintWriter(System.out);\n Task solver = new Task();\n int t = 1;\n for(int tt = 1; tt <= t; tt++) solver.solve(tt, scan, out);\n out.close();\n }\n\n static class Task {\n public void solve(int testNumber, FastReader scan, PrintWriter out) {\n int n = scan.nextInt(), k = scan.nextInt();\n PriorityQueue<Long> queue = new PriorityQueue<>(Collections.reverseOrder());\n long ans = 0;\n long[] a = new long[n];\n for(int i = 0; i < n; i++) a[i] = scan.nextLong();\n ruffleSort(a);\n for(int i = 0; i <= k; i++) queue.add(0L);\n for(int i = n - 1; i >= 0; i--) {\n long curr = queue.poll();\n ans += curr;\n queue.add(curr + a[i]);\n }\n out.println(ans);\n }\n }\n\n static void ruffleSort(int[] a) {\n Random get = new Random();\n for (int i = 0; i < a.length; i++) {\n int r = get.nextInt(a.length);\n int temp = a[i];\n a[i] = a[r];\n a[r] = temp;\n }\n Arrays.sort(a);\n }\n\n static void ruffleSort(long[] a) {\n Random get = new Random();\n for (int i = 0; i < a.length; i++) {\n int r = get.nextInt(a.length);\n long temp = a[i];\n a[i] = a[r];\n a[r] = temp;\n }\n Arrays.sort(a);\n }\n\n static class FastReader {\n BufferedReader br;\n StringTokenizer st;\n\n public FastReader() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n public FastReader(String s) throws FileNotFoundException {\n br = new BufferedReader(new FileReader(new File(s)));\n }\n\n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n }\n\n}", "lang_cluster": "Java", "tags": ["math", "greedy", "constructive algorithms"], "code_uid": "da2d5445d33a63d219ecbd83b496817f", "src_uid": "53155daf2375e01a3b87fa1c76f1e9a8", "difficulty": null, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.IOException;\nimport java.io.OutputStreamWriter;\nimport java.util.Arrays;\nimport java.io.BufferedWriter;\nimport java.util.InputMismatchException;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.NoSuchElementException;\nimport java.io.Writer;\nimport java.math.BigInteger;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Egor Kulikov (egor@egork.net)\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tOutputWriter out = new OutputWriter(outputStream);\n\t\tTaskD solver = new TaskD();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskD {\n\tstatic final long MOD = 1000000007;\n\n\tpublic void solve(int testNumber, InputReader in, OutputWriter out) {\n\t\tint rowCount = in.readInt();\n\t\tint columnCount = in.readInt();\n\t\tlong[][] strict = new long[rowCount][columnCount];\n\t\tlong[][] nonStrict = new long[rowCount][columnCount];\n\t\tArrays.fill(strict[0], 1, columnCount, 1);\n\t\tArrays.fill(nonStrict[0], 1, columnCount, 1);\n\t\tfor (int i = 1; i < rowCount; i++) {\n\t\t\tlong sum = 0;\n\t\t\tlong result = 0;\n\t\t\tfor (int j = 0; j < columnCount; j++) {\n\t\t\t\tresult += sum;\n\t\t\t\tif (result >= MOD)\n\t\t\t\t\tresult -= MOD;\n\t\t\t\tstrict[i][j] = result;\n\t\t\t\tresult += nonStrict[i - 1][j];\n\t\t\t\tsum += nonStrict[i - 1][j];\n\t\t\t\tif (result >= MOD)\n\t\t\t\t\tresult -= MOD;\n\t\t\t\tif (sum >= MOD)\n\t\t\t\t\tsum -= MOD;\n\t\t\t\tnonStrict[i][j] = result;\n\t\t\t}\n\t\t}\n\t\tlong answer = 0;\n\t\tfor (int i = 0; i < columnCount; i++) {\n\t\t\tlong sum = 0;\n\t\t\tlong result = 0;\n\t\t\tlong current = 0;\n\t\t\tfor (int j = 0; j < rowCount; j++) {\n\t\t\t\tsum += nonStrict[j][i];\n\t\t\t\tif (sum >= MOD)\n\t\t\t\t\tsum -= MOD;\n\t\t\t\tresult += sum;\n\t\t\t\tif (result >= MOD)\n\t\t\t\t\tresult -= MOD;\n\t\t\t\tcurrent += strict[rowCount - j - 1][i] * result % MOD;\n\t\t\t}\n\t\t\tcurrent %= MOD;\n\t\t\tanswer += current * (columnCount - i);\n\t\t}\n\t\tanswer %= MOD;\n\t\tout.printLine(answer);\n }\n}\n\nclass InputReader {\n\n\tprivate InputStream stream;\n\tprivate byte[] buf = new byte[1024];\n\tprivate int curChar;\n\tprivate int numChars;\n\tprivate SpaceCharFilter filter;\n\n\tpublic InputReader(InputStream stream) {\n\t\tthis.stream = stream;\n\t}\n\n\tpublic int read() {\n\t\tif (numChars == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (curChar >= numChars) {\n\t\t\tcurChar = 0;\n\t\t\ttry {\n\t\t\t\tnumChars = stream.read(buf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (numChars <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buf[curChar++];\n\t}\n\n\tpublic int readInt() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tint res = 0;\n\t\tdo {\n\t\t\tif (c < '0' || c > '9')\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n\n\tpublic boolean isSpaceChar(int c) {\n\t\tif (filter != null)\n\t\t\treturn filter.isSpaceChar(c);\n\t\treturn isWhitespace(c);\n\t}\n\n\tpublic static boolean isWhitespace(int c) {\n\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t}\n\n\tpublic interface SpaceCharFilter {\n\t\tpublic boolean isSpaceChar(int ch);\n\t}\n}\n\nclass OutputWriter {\n\tprivate final PrintWriter writer;\n\n\tpublic OutputWriter(OutputStream outputStream) {\n\t\twriter = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n\t}\n\n\tpublic OutputWriter(Writer writer) {\n\t\tthis.writer = new PrintWriter(writer);\n\t}\n\n\tpublic void print(Object...objects) {\n\t\tfor (int i = 0; i < objects.length; i++) {\n\t\t\tif (i != 0)\n\t\t\t\twriter.print(' ');\n\t\t\twriter.print(objects[i]);\n\t\t}\n\t}\n\n public void printLine(Object...objects) {\n\t\tprint(objects);\n\t\twriter.println();\n\t}\n\n\tpublic void close() {\n\t\twriter.close();\n\t}\n\n\t}\n\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics"], "code_uid": "b5d898cdb98adc4b8cac6a77a8eff831", "src_uid": "9ca1ad2fa16ca81e9ab5eba220b162c1", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.math.BigInteger;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author AlexFetisov\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskD_EgorAndCaves solver = new TaskD_EgorAndCaves();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskD_EgorAndCaves {\n public static final int MOD = (int)1e9 + 7;\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.nextInt();\n int m = in.nextInt();\n\n if (m < 2) {\n out.println(0);\n return;\n }\n long[][] dp = new long[n+1][m+1];\n long[][] lastRow = new long[n+1][m+1];\n\n for (int width = 2; width <= m; ++width) {\n dp[0][width] = 1;\n }\n long[] sum = new long[m+1];\n long[] sum2 = new long[m+1];\n for (int row = 1; row < n; ++row) {\n sum[0] = sum[1] = 0;\n sum2[0] = sum2[1] = 0;\n for (int i = 2; i <= m; ++i) {\n sum[i] = sum[i-1] + dp[row-1][i];\n if (sum[i] >= MOD) sum[i] -= MOD;\n sum2[i] = sum2[i-1] + (dp[row-1][i] * i) % MOD;\n if (sum2[i] >= MOD) sum2[i] -= MOD;\n }\n for (int width = 2; width <= m; ++width) {\n dp[row][width] = 1;\n lastRow[row][width] = 0;\n dp[row][width] += ((width + 1) * sum[width]) % MOD;\n if (dp[row][width] >= MOD) {\n dp[row][width] -= MOD;\n }\n dp[row][width] -= sum2[width];\n if (dp[row][width] < 0) {\n dp[row][width] += MOD;\n }\n lastRow[row][width] += ((width + 1) * sum[width-1]) % MOD;\n if (lastRow[row][width] >= MOD) {\n lastRow[row][width] -= MOD;\n }\n lastRow[row][width] -= sum2[width-1];\n if (lastRow[row][width] < 0) {\n lastRow[row][width] += MOD;\n }\n }\n }\n\n long res = 0;\n for (int t = 0; t < n; ++t) {\n for (int width = 2; width <= m; ++width) {\n res += ((dp[t][width]) % MOD) * (m - width + 1) % MOD;\n if (res >= MOD) {\n res -= MOD;\n }\n res += ((dp[t][width] * lastRow[n - t - 1][width]) % MOD) * (m - width + 1) % MOD;\n if (res >= MOD) {\n res -= MOD;\n }\n }\n }\n out.println(res);\n }\n}\n\nclass InputReader {\n private BufferedReader reader;\n private StringTokenizer stt;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream));\n }\n\n public String nextLine() {\n try {\n return reader.readLine();\n } catch (IOException e) {\n return null;\n }\n }\n\n public String nextString() {\n while (stt == null || !stt.hasMoreTokens()) {\n stt = new StringTokenizer(nextLine());\n }\n return stt.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(nextString());\n }\n\n}\n\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics"], "code_uid": "836cf672046e662ace149bb55a4766dc", "src_uid": "9ca1ad2fa16ca81e9ab5eba220b162c1", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.Writer;\nimport java.util.StringTokenizer;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Parser in = new Parser(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n TaskD solver = new TaskD();\n solver.solve(1, in, out);\n out.close();\n }\n}\n\nclass TaskD {\n int mod = 1000000007;\n long[][] sum1d = new long[3000][3000];\n long[][] sum2d = new long[3000][3000];\n\n public void solve(int testNumber, Parser in, OutputWriter out) {\n int n = in.nextInt();\n int m = in.nextInt();\n\n for (int rows = 0; rows <= n; rows++) {\n for (int i = 2; i <= m; i++) {\n sum1d[rows][i] = (rows==0) ? 1 : sum2d[rows-1][i]+1;\n if (i != 0) sum1d[rows][i] = (sum1d[rows][i] + sum1d[rows][i-1]) % mod;\n\n sum2d[rows][i] = sum1d[rows][i];\n if (i != 0) sum2d[rows][i] = (sum2d[rows][i] + sum2d[rows][i-1]) % mod;\n }\n }\n\n\n long tot = 0;\n for (int i = 0; i < n; i++) {\n for (int mid = 2; mid <= m; mid++) {\n // res=(res+(((((pd[w][t][1]-pd[w][t-1][1]+M)%M)*pd[w][n-t+1][1])%M)*(m-w+1))%M)%M;\n long top = (i==0) ? 1 : (sum2d[i-1][mid-1]+sum1d[i-1][mid-1]+1);\n long bot = (n-i-1==0) ? 1 : sum2d[n-i-2][mid]+1;\n\n bot = (bot * top) % mod;\n bot = (bot * (m-mid+1)) % mod;\n tot = (tot + bot) % mod;\n }\n }\n\n out.println(tot);\n }\n}\n\nclass Parser\n{\n private BufferedReader din;\n private StringTokenizer tokenizer;\n\n public Parser(InputStream in)\n {\n din = new BufferedReader(new InputStreamReader(in));\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(din.readLine());\n } catch (Exception e) {\n throw new UnknownError();\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt()\n {\n return Integer.parseInt(next());\n }\n\n }\n\nclass OutputWriter extends PrintWriter {\n public OutputWriter(Writer out) {\n super(out);\n }\n\n public OutputWriter(OutputStream out) {\n super(out);\n }\n\n }\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics"], "code_uid": "47101104257ec10a89cdd14a485dccd1", "src_uid": "9ca1ad2fa16ca81e9ab5eba220b162c1", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.io.PrintStream;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Random;\nimport java.io.Reader;\nimport java.io.Writer;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Niyaz Nigmatullin\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tFastScanner in = new FastScanner(inputStream);\n\t\tFastPrinter out = new FastPrinter(outputStream);\n\t\tTaskD solver = new TaskD();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n}\n\nclass TaskD {\n\n public void solve(int testNumber, FastScanner in, FastPrinter out) {\n// test();\n int n = in.nextInt();\n int m = in.nextInt();\n out.println(solve(n, m));\n// if (solve(n, m) != solveStupid(n, m)) {\n// throw new AssertionError();\n// }\n }\n\n static final int MOD = 1000000007;\n\n static int solve(int n, int m) {\n int[][] dp = new int[m][n + 1];\n int[][] dp2 = new int[m][n + 1];\n dp[0][0] = 1;\n for (int i = 1; i <= n; i++) {\n int s = 0;\n int ss = 0;\n dp[0][i] = 1;\n for (int j = 1; j < m; j++) {\n dp2[j][i] = (ss + s + 1) % MOD;\n s += dp[j][i - 1];\n if (s >= MOD) {\n s -= MOD;\n }\n ss += s;\n if (ss >= MOD) {\n ss -= MOD;\n }\n dp[j][i] = (ss + 1) % MOD;\n }\n }\n int ans = 0;\n for (int i = 0; i < n; i++) {\n int cur = 0;\n for (int j = 1; j < m; j++) {\n cur = (int) ((cur + (long) dp[j][i + 1] * dp2[j][n - i] % MOD * (m - j)) % MOD);\n }\n ans += cur;\n if (ans >= MOD) {\n ans -= MOD;\n }\n }\n return ans;\n }\n\n }\n\nclass FastScanner extends BufferedReader {\n\n boolean isEOF;\n\n public FastScanner(InputStream is) {\n super(new InputStreamReader(is));\n }\n\n public int read() {\n try {\n int ret = super.read();\n if (isEOF && ret < 0) {\n throw new InputMismatchException();\n }\n isEOF = ret == -1;\n return ret;\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n }\n\n static boolean isWhiteSpace(int c) {\n return c >= 0 && c <= 32;\n }\n\n public int nextInt() {\n int c = read();\n while (isWhiteSpace(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int ret = 0;\n while (c >= 0 && !isWhiteSpace(c)) {\n if (c < '0' || c > '9') {\n throw new NumberFormatException(\"digit expected \" + (char) c\n + \" found\");\n }\n ret = ret * 10 + c - '0';\n c = read();\n }\n return ret * sgn;\n }\n\n }\n\nclass FastPrinter extends PrintWriter {\n\n public FastPrinter(OutputStream out) {\n super(out);\n }\n\n public FastPrinter(Writer out) {\n super(out);\n }\n\n\n}\n\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics"], "code_uid": "0fcfeffde170d23b009b6ba68e13dd4d", "src_uid": "9ca1ad2fa16ca81e9ab5eba220b162c1", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "//package round179;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class D {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\tint mod = 1000000007;\n\tint[][] fif = enumFIF(7000, mod);\n\t\n\tvoid solve()\n\t{\n\t\tint n = ni(), m = ni();\n\t\t\n\t\tlong ret = 0;\n\t\tfor(int w = 1;w < m;w++){\n\t\t\tlong[] num = new long[n+1];\n\t\t\tlong[] cum = new long[n+1];\n\t\t\tfor(int L = 1;L <= n;L++){\n\t\t\t\tnum[L] = C(w-1+2*(L-1), 2*(L-1));\n\t\t\t\tcum[L] = cum[L-1] + num[L];\n\t\t\t\tif(cum[L] >= mod)cum[L]-=mod;\n\t\t\t}\n\t\t\t\n\t\t\tlong lsum = 0;\n\t\t\tfor(int L = 1;L <= n;L++){\n\t\t\t\tlsum += num[L]*cum[n-L+1]%mod*(m-w)%mod;\n\t\t\t}\n\t\t\tret += lsum%mod;\n\t\t}\n\t\tout.println(ret%mod);\n\t}\n\t\n\tlong C(int n, int r)\n\t{\n\t\tif(n < 0 || r < 0 || n < r)return 0;\n\t\treturn (long)fif[0][n]*fif[1][r]%mod*fif[1][n-r]%mod;\n\t}\n\t\n\tpublic static int[][] enumFIF(int n, int mod)\n\t{\n\t\tint[] f = new int[n+1];\n\t\tint[] invf = new int[n+1];\n\t\tinvf[1] = 1;\n\t\tfor(int i = 2;i <= n;i++){\n\t\t\tinvf[i] = (int)(invf[mod%i]*(long)(mod-mod/i)%mod);\n\t\t}\n\t\t\n\t\tf[0] = invf[0] = 1;\n\t\tfor(int i = 1;i <= n;i++){\n\t\t\tf[i] = (int)((long)f[i-1] * i % mod);\n\t\t\tinvf[i] = (int)((long)invf[i-1] * invf[i] % mod);\n\t\t}\n\t\treturn new int[][]{f, invf};\n\t}\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new D().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tprivate int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics"], "code_uid": "081b53a59a545d258cda456dbc5f3969", "src_uid": "9ca1ad2fa16ca81e9ab5eba220b162c1", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class D_fast {\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\tboolean eof;\n\n\tstatic final int MOD = 1_000_000_007;\n\n\tvoid solve() throws IOException {\n\t\tint n = nextInt();\n\t\tint m = nextInt();\n\t\tif (m < 2) {\n\t\t\tout.println(0);\n\t\t\treturn;\n\t\t}\n\n\t\tint[][] dp = new int[n + 1][m + 1];\n\t\tfor (int len = 2; len <= m; len++) {\n\t\t\tdp[1][len] = 1;\n\t\t}\n\n\t\tint[] tmp = new int[m + 1];\n\n\t\tfor (int height = 2; height <= n; height++) {\n\t\t\tint[] dpPrev = dp[height - 1];\n\t\t\ttmp[2] = dpPrev[2];\n\t\t\tfor (int i = 3; i <= m; i++) {\n\t\t\t\ttmp[i] = tmp[i - 1] + dpPrev[i];\n\t\t\t\tif (tmp[i] >= MOD)\n\t\t\t\t\ttmp[i] -= MOD;\n\t\t\t}\n\n\t\t\tint[] dpCur = dp[height];\n\t\t\tdpCur[2] = tmp[2];\n\t\t\tfor (int i = 3; i <= m; i++) {\n\t\t\t\tdpCur[i] = dpCur[i - 1] + tmp[i];\n\t\t\t\tif (dpCur[i] >= MOD)\n\t\t\t\t\tdpCur[i] -= MOD;\n\t\t\t}\n\t\t}\n\n\t\tint[] fixedHeight = new int[n + 1];\n\t\tint[] up = new int[n + 1];\n\t\tint[] down = new int[n + 1];\n\n\t\tint ans = 0;\n\t\tfor (int len = 2; len <= m; len++) {\n\n\t\t\tint val = 0;\n\n\t\t\tfor (int h = 1; h <= n; h++) {\n\t\t\t\tup[h] = down[h] = dp[h][len];\n\t\t\t\tif (h != 1) {\n\t\t\t\t\tup[h] -= dp[h - 1][len];\n\t\t\t\t\tif (up[h] < 0)\n\t\t\t\t\t\tup[h] += MOD;\n\t\t\t\t}\n\t\t\t\tif (h != 1) {\n\t\t\t\t\tup[h] += up[h - 1];\n\t\t\t\t\tif (up[h] >= MOD)\n\t\t\t\t\t\tup[h] -= MOD;\n\t\t\t\t\tdown[h] += down[h - 1];\n\t\t\t\t\tif (down[h] >= MOD)\n\t\t\t\t\t\tdown[h] -= MOD;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tfor (int mid = 0; mid < n; mid++) {\n\t\t\t\tint maxUp = mid + 1;\n\t\t\t\tint maxDown = n - mid;\n\t\t\t\tval += (int)((long)up[maxUp] * down[maxDown] % MOD);\n\t\t\t\tif (val >= MOD)\n\t\t\t\t\tval -= MOD;\n\t\t\t}\n\n\t\t\tans += (int) ((long) val * (m - len + 1) % MOD);\n\t\t\tif (ans >= MOD)\n\t\t\t\tans -= MOD;\n\t\t}\n\n\t\tout.println(ans);\n\n\t}\n\n\tD_fast() throws IOException {\n\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.close();\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew D_fast();\n\t}\n\n\tString nextToken() {\n\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t} catch (Exception e) {\n\t\t\t\teof = true;\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\t\treturn st.nextToken();\n\t}\n\n\tString nextString() {\n\t\ttry {\n\t\t\treturn br.readLine();\n\t\t} catch (IOException e) {\n\t\t\teof = true;\n\t\t\treturn null;\n\t\t}\n\t}\n\n\tint nextInt() throws IOException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tlong nextLong() throws IOException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tdouble nextDouble() throws IOException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n}", "lang_cluster": "Java", "tags": ["dp", "combinatorics"], "code_uid": "4330e6202cef51238cc72ebce87fdebf", "src_uid": "9ca1ad2fa16ca81e9ab5eba220b162c1", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// import org.junit.Test;\nimport java.util.Scanner;\n\n// import static org.junit.Assert.assertEquals;\n\npublic class CF_1223G {\n static Scanner scanner = new Scanner(System.in);\n public static void main(String args[])\n {\n //test();\n long caseNum = 1;\n while (caseNum-- > 0) {\n task();\n }\n }\n\n private static int maxN = 500000;\n private static int[] a = new int[maxN + 10];\n private static int[] sum = new int[maxN + 10];\n private static int[] input = new int[maxN + 10];\n\n public static void task() {\n int n = scanner.nextInt();\n // System.out.println(n);\n for (int i = 0; i < n; i++) {\n input[i] = scanner.nextInt();\n }\n // System.out.println(\"input end\");\n solve(n, input);\n }\n\n public static void clear(int n) {\n for (int i = 1; i <= maxN + 1; i++) {\n a[i] = 0;\n sum[i] = 0;\n }\n }\n\n private static int maxA;\n\n public static long solve(int n, int[] input) {\n long maxArea = 0;\n maxA = 0;\n clear(n);\n for (int i = 0; i < n; i++) {\n a[input[i]]++;\n if (input[i] > maxA) {\n maxA = input[i];\n }\n }\n for (int i = 2; i <= maxN + 1; i++) {\n sum[i] = a[i] + sum[i - 1];\n }\n\n for (int y = 2; y <= maxA; y++) {\n long total = 0;\n for (int step = y; step <= maxA; step += y) {\n total += q(step, min(step + y - 1, maxA) + 1) * (long) (step / y);\n }\n int x = 1;\n int left = 2;\n int right = maxA;\n while (left <= right) {\n int mid = (left + right) / 2;\n if (check(y, mid, total)) {\n if (mid > x) {\n x = mid;\n }\n left = mid + 1;\n } else {\n right = mid - 1;\n }\n }\n if (x > 1) {\n if ((long) x * (long) y > maxArea) {\n maxArea = (long) x * (long) y;\n /*\n System.out.println(y + \" \" + x);\n System.out.println(maxArea);\n */\n }\n }\n }\n System.out.println(maxArea);\n\n return maxArea;\n }\n\n public static boolean check(int y, int x, long total) {\n if (y == 4) {\n // System.out.println(\"fcuk\");\n }\n boolean ret = check1(y, x, total, x + x, false) || check2(y, x, total);\n //System.out.println(y + \" \" + x + \" \" + total + \" \" + ret);\n return ret;\n }\n\n public static boolean check1(int y, int x, long total, int need, boolean ignore) {\n // together\n long up = (need - 1) / y + 1;\n long down = need / y;\n int hits = 0;\n if (!ignore) {\n if (need < y) {\n if (q(need, y) > 0) {\n hits = 1;\n }\n }\n }\n if (hits == 1) {\n return total >= x;\n }\n int toSub = 0;\n int remain = need % y;\n for (int step = max(y, need - remain); step + remain <= maxA; step += y) {\n if (q(step + remain, min(step + y,maxA + 1)) > 0) {\n toSub = 1;\n break;\n }\n }\n if (toSub == 1) {\n return total >= x + down;\n } else {\n if (q(need, maxA + 1) > 0) {\n return total >= x + up;\n } else {\n return false;\n }\n }\n }\n\n private static int min(int x, int y) {\n if (x < y) {\n return x;\n }\n return y;\n }\n\n private static int max(int x, int y) {\n if (x > y) {\n return x;\n }\n return y;\n }\n\n\n public static boolean check2(int y, int x, long total) {\n // separate\n int need = x;\n int up = (need - 1) / y + 1;\n int down = need / y;\n int hits = 0;\n if (need < y) {\n if (q(need, y) > 0) {\n hits = q(need, y);\n }\n if (hits >= 2) {\n hits = 2;\n }\n }\n if (hits == 2) {\n return total >= x;\n }\n // ?\n if (hits == 1) {\n return check1(y, x, total, x, true);\n }\n if (q(need, maxA + 1) < 2){\n return false;\n }\n if (hits == 0) {\n int toSub = 0;\n int remain = need % y;\n for (int step = max(y, need - remain); step + remain <= maxA; step += y) {\n int h = q(step + remain, min(step + y,maxA + 1));\n toSub += h;\n if (toSub >= 2) {\n toSub = 2;\n break;\n }\n }\n if (toSub == 2) {\n return total >= x + down + down;\n }\n if (toSub == 1) {\n return total >= x + down + up;\n }\n if (toSub == 0) {\n return total >= x + up + up;\n }\n }\n // never\n return false;\n }\n\n public static int q(int begin, int end) {\n if (begin > end) {\n return 0;\n }\n return sum[end - 1] - sum[begin - 1];\n }\n\n\n public static void test() {\n int n = 90792;\n int[] input = new int[maxN + 10];\n input[0] = 181565;\n input[1] = 181564;\n for (int i = 2; i < n; i++) {\n input[i] = 60522;\n }\n System.out.println(solve(n, input));\n }\n\n /*\n @Test\n public void test() {\n int n = 1;\n int[] input = {9};\n assertEquals(4, solve(n, input));\n }\n\n @Test\n public void test2() {\n String s = \"9\\n\" +\n \"9 10 9 18 9 9 9 28 9\";\n s = \"9\\n\" +\n \"9 10 9 19 9 9 9 28 9\";\n Scanner scanner = new Scanner(s);\n int n = scanner.nextInt();\n int [] input = new int[500000 +100];\n for (int i = 0; i < n; i++) {\n input[i] = scanner.nextInt();\n }\n assertEquals(90, solve(n, input));\n }\n */\n}\n", "lang_cluster": "Java", "tags": ["math", "number theory"], "code_uid": "db8b2c7664d4b884fed591ec0176349c", "src_uid": "bca20e0910e9fe4d89326b50ab45e4ca", "difficulty": 3200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastScanner in = new FastScanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC {\n final long infinity = Long.MAX_VALUE / 3;\n FastScanner in;\n\n public void solve(int testNumber, FastScanner in, PrintWriter out) {\n this.in = in;\n long bytesLeft0 = assertedNextInt();\n long timeLeft0 = assertedNextInt();\n long t0 = assertedNextInt();\n\n long a1 = assertedNextInt();\n long t1 = assertedNextInt();\n long p1 = assertedNextInt();\n\n long a2 = assertedNextInt();\n long t2 = assertedNextInt();\n long p2 = assertedNextInt();\n long u = solve(bytesLeft0, timeLeft0, t0, a1, t1, p1, a2, t2, p2);\n long v = solve(bytesLeft0, timeLeft0, t0, a2, t2, p2, a1, t1, p1);\n long ans = Math.min(u, v);\n if (ans >= infinity) {\n ans = -1;\n }\n out.println(ans);\n }\n\n private long solve(long bytesLeft0, long timeLeft0, long t0, long a1, long t1, long p1, long a2, long t2, long p2) {\n final int N = (int) 1e7 + 20;\n long ans = infinity;\n for (int k1 = 0; k1 <= N; k1++) {\n long cost1 = k1 * p1;\n long bytesDownloaded1 = Math.min(bytesLeft0, k1 * a1);\n long time1 = bytesDownloaded1 * t1;\n long bytesLeft1 = bytesLeft0 - bytesDownloaded1;\n long timeLeft1 = timeLeft0 - time1;\n if (timeLeft1 < 0) {\n continue;\n }\n if (bytesLeft1 == 0) {\n ans = Math.min(ans, cost1);\n continue;\n }\n if (t0 * bytesLeft1 <= timeLeft1) {\n ans = Math.min(ans, cost1);\n continue;\n }\n if (t0 <= t2) {\n continue;\n }\n if (bytesLeft1 * t2 > timeLeft1) {\n continue;\n }\n long bytes0 = (timeLeft1 - bytesLeft1 * t2) / (t0 - t2);\n long bytes2 = bytesLeft1 - bytes0;\n long k2 = (bytes2 + a2 - 1) / a2;\n\n long cost2 = k2 * p2;\n ans = Math.min(ans, cost1 + cost2);\n }\n return ans;\n }\n\n private long assertedNextInt() {\n long x = in.nextLong();\n if (x < 1 || x > (int) 1e7) {\n throw new AssertionError();\n }\n return x;\n }\n\n }\n\n static class FastScanner {\n private BufferedReader in;\n private StringTokenizer st;\n\n public FastScanner(InputStream stream) {\n in = new BufferedReader(new InputStreamReader(stream));\n }\n\n public String next() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(in.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return st.nextToken();\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["implementation", "binary search"], "code_uid": "5d5fd043968a7d38400ba83224050c8a", "src_uid": "f5f85e75af5b0f25f1f436a21e12fad1", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/*\n * Author Ayub Subhaniya\n * Institute DA-IICT\n */\n \nimport java.io.*;\nimport java.math.*;\nimport java.util.*;\n \n \npublic class Codeforces429D\n{\n\t\n\tInputStream in;\n\tPrintWriter out;\n\t\n\tlong MAX=Long.MAX_VALUE;\n\tvoid solve() \n\t{\n\t\tlong f=nl();\n\t\tlong T=nl();\n\t\tlong t0=nl();\n\t\tlong a1,t1,p1,a2,t2,p2;\n\t\ta1=nl();t1=nl();p1=nl();\n\t\ta2=nl();t2=nl();p2=nl();\n\t\t\n\t\tlong max1=f/a1;\n\t\tlong max2=f/a2;\n\t\tlong cost=MAX;\n\t\t\n\t\tif (t1<t2)\n\t\t{\n\t\t\tfor (int k1=0;k1<=max1;k1++)\n\t\t\t{\n\t\t\t\tlong sz=f-k1*a1;\n\t\t\t\t\n\t\t\t\tlong l=0,r=sz/a2,result=-1,t=a1*k1*t1;\n\t\t\t\tlong td;\n\t\t\t\twhile (l<=r)\n\t\t\t\t{\n\t\t\t\t\tlong mid=((l+r)>>1);\n\t\t\t\t\ttd=a2*mid;\n\t\t\t\t\tif (t+td*t2+(sz-td)*t0 <= T)\n\t\t\t\t\t{\n\t\t\t\t\t\tresult=mid;\n\t\t\t\t\t\tr=mid-1;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tl=mid+1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif (t+sz*t2<=T)\n\t\t\t\t\tcost=Math.min(cost, k1*p1+((sz+a2-1)/a2)*p2);\n\t\t\t\t\n\t\t\t\tif (result!=-1)\n\t\t\t\t{\n\t\t\t\t\tcost=Math.min(cost, k1*p1+result*p2);\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\tif (f*t1<=T)\n\t\t\t\tcost=Math.min(cost, ((f+a1-1)/a1)*p1);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfor (int k2=0;k2<=max2;k2++)\n\t\t\t{\n\t\t\t\tlong sz=f-k2*a2;\n\t\t\t\t\n\t\t\t\tlong l=0,r=sz/a1,result=-1,t=a2*k2*t2;\n\t\t\t\tlong td;\n\t\t\t\twhile (l<=r)\n\t\t\t\t{\n\t\t\t\t\tlong mid=((l+r)>>1);\n\t\t\t\t\ttd=a1*mid;\n\t\t\t\t\tif (t+td*t1+(sz-td)*t0<=T)\n\t\t\t\t\t{\n\t\t\t\t\t\tresult=mid;\n\t\t\t\t\t\tr=mid-1;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tl=mid+1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif (t+sz*t1<=T)\n\t\t\t\t\tcost=Math.min(cost, k2*p2+((sz+a1-1)/a1)*p1);\n\t\t\t\t\n\t\t\t\tif (result!=-1)\n\t\t\t\t{\n\t\t\t\t\tcost=Math.min(cost, k2*p2+result*p1);\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\tif (f*t2<=T)\n\t\t\t\tcost=Math.min(cost, ((f+a2-1)/a2)*p2);\n\t\t}\n\t\t\n\t\tif (cost==MAX)\n\t\t\tout.println(-1);\n\t\telse\n\t\t\tout.println(cost);\n\t}\n\t\t\n\tvoid run() throws Exception \n\t{\n\t\tString INPUT = \"C:/Users/ayubs/Desktop/input.txt\";\n\t\tin = oj ? System.in : new FileInputStream(INPUT);\n\t\tout = new PrintWriter(System.out);\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis() - s + \"ms\");\n\t\t\n\t}\n\tpublic static void main(String[] args) throws Exception \n\t{\n\t\tnew Codeforces429D().run();\n\t}\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte() \n\t{\n\t\tif (lenbuf == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (ptrbuf >= lenbuf) \n\t\t{\n\t\t\tptrbuf = 0;\n\t\t\ttry \n\t\t\t{\n\t\t\t\tlenbuf = in.read(inbuf);\n\t\t\t}\n\t\t\tcatch (IOException e) \n\t\t\t{\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (lenbuf <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean inSpaceChar(int c) \n\t{\n\t\treturn !(c >= 33 && c <= 126);\n\t}\n\t\n\tprivate int skip() \n\t{\n\t\tint b;\n\t\twhile ((b = readByte()) != -1 && inSpaceChar(b))\n\t\t\t;\n\t\treturn b;\n\t}\n\t\n\tprivate double nd() \n\t{\n\t\treturn Double.parseDouble(ns());\n\t}\n\t\n\tprivate char nc() \n\t{\n\t\treturn (char) skip();\n\t}\n\t\n\tprivate String ns() \n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile (!(inSpaceChar(b))) \n\t\t{ // when nextLine, (inSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n) \n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile (p < n && !(inSpaceChar(b))) \n\t\t{\n\t\t\tbuf[p++] = (char) b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m) \n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tmap[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n) \n\t{\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni() \n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-') \n\t\t{\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile (true) \n\t\t{\n\t\t\tif (b >= '0' && b <= '9') \n\t\t\t{\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t} \n\t\t\telse \n\t\t\t{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl() \n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-') \n\t\t{\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile (true) \n\t\t{\n\t\t\tif (b >= '0' && b <= '9') \n\t\t\t{\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}\n\t\t\telse \n\t\t\t{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\t\n\tprivate void tr(Object... o) \n\t{\n\t\tif (!oj)\n\t\t\tSystem.out.println(Arrays.deepToString(o));\n\t}\n\t\n}", "lang_cluster": "Java", "tags": ["implementation", "binary search"], "code_uid": "e5bc175d4e027dd0d63d6b6e3fce53e9", "src_uid": "f5f85e75af5b0f25f1f436a21e12fad1", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastScanner in = new FastScanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC {\n final long infinity = Long.MAX_VALUE / 3;\n FastScanner in;\n\n public void solve(int testNumber, FastScanner in, PrintWriter out) {\n this.in = in;\n long bytesLeft0 = assertedNextInt();\n long timeLeft0 = assertedNextInt();\n long t0 = assertedNextInt();\n\n long a1 = assertedNextInt();\n long t1 = assertedNextInt();\n long p1 = assertedNextInt();\n\n long a2 = assertedNextInt();\n long t2 = assertedNextInt();\n long p2 = assertedNextInt();\n long u = solve(bytesLeft0, timeLeft0, t0, a1, t1, p1, a2, t2, p2);\n long v = solve(bytesLeft0, timeLeft0, t0, a2, t2, p2, a1, t1, p1);\n long ans = Math.min(u, v);\n if (ans >= infinity) {\n ans = -1;\n }\n out.println(ans);\n }\n\n private long solve(long bytesLeft0, long timeLeft0, long t0, long a1, long t1, long p1, long a2, long t2, long p2) {\n final int N = (int) 1e7 + 20;\n long ans = infinity;\n for (int k1 = 0; k1 <= N; k1++) {\n long cost1 = k1 * p1;\n long bytesDownloaded1 = Math.min(bytesLeft0, k1 * a1);\n long time1 = bytesDownloaded1 * t1;\n long bytesLeft1 = bytesLeft0 - bytesDownloaded1;\n long timeLeft1 = timeLeft0 - time1;\n if (timeLeft1 < 0) {\n continue;\n }\n if (bytesLeft1 == 0) {\n ans = Math.min(ans, cost1);\n continue;\n }\n if (t0 * bytesLeft1 <= timeLeft1) {\n ans = Math.min(ans, cost1);\n continue;\n }\n if (t0 <= t2) {\n continue;\n }\n long bytes2 = (bytesLeft1 * t0 - timeLeft1 + (t0 - t2) - 1) / (t0 - t2);\n long k2 = (bytes2 + a2 - 1) / a2;\n\n long cost2 = k2 * p2;\n long bytesDownloaded2 = Math.min(bytesLeft1, k2 * a2);\n long time2 = bytesDownloaded2 * t2;\n long bytesLeft2 = bytesLeft1 - bytesDownloaded2;\n long timeLeft2 = timeLeft1 - time2;\n if (timeLeft2 >= 0 && bytesLeft2 * t0 <= timeLeft2) {\n ans = Math.min(ans, cost1 + cost2);\n }\n }\n return ans;\n }\n\n private long assertedNextInt() {\n long x = in.nextLong();\n if (x < 1 || x > (int) 1e7) {\n throw new AssertionError();\n }\n return x;\n }\n\n }\n\n static class FastScanner {\n private BufferedReader in;\n private StringTokenizer st;\n\n public FastScanner(InputStream stream) {\n in = new BufferedReader(new InputStreamReader(stream));\n }\n\n public String next() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(in.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return st.nextToken();\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["implementation", "binary search"], "code_uid": "88991cd7290594254ac64f7e495fa2f7", "src_uid": "f5f85e75af5b0f25f1f436a21e12fad1", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.awt.*;\nimport java.io.*;\nimport java.math.BigDecimal;\nimport java.math.BigInteger;\nimport java.util.*;\nimport java.util.List;\nimport java.util.Queue;\n\nimport static java.lang.Math.max;\nimport static java.lang.Math.min;\n\n\npublic class C implements Runnable{\n\n // SOLUTION!!!\n // HACK ME PLEASE IF YOU CAN!!!\n // PLEASE!!!\n // PLEASE!!!\n // PLEASE!!!\n\n private final static Random rnd = new Random();\n private final static String fileName = \"\";\n \n private final static long MODULO = 1000 * 1000 * 1000 + 7;\n\n final int MAX_RND = 10;\n\n private void solve1() {\n for (int it = 0; it < 10; ++it) {\n int need = rnd.nextInt(10000) + 1;\n long maxTime = rnd.nextInt(10000000) + 1;\n long freeDefaultTime = rnd.nextInt(10) + 1;\n\n int firstDefaultSize = rnd.nextInt(100) + 1;\n long firstDefaultTime = rnd.nextInt(10) + 1;\n long firstDefaultCost = rnd.nextInt(10) + 1;\n\n int secondDefaultSize = rnd.nextInt(100) + 1;\n long secondDefaultTime = rnd.nextInt(10) + 1;\n long secondDefaultCost = rnd.nextInt(10) + 1;\n\n long[] answer = getAnswer(need, maxTime, freeDefaultTime,\n firstDefaultSize, firstDefaultTime, firstDefaultCost,\n secondDefaultSize, secondDefaultTime, secondDefaultCost);\n\n long[] bruteAnswer = getBruteAnswer(need, maxTime, freeDefaultTime,\n firstDefaultSize, firstDefaultTime, firstDefaultCost,\n secondDefaultSize, secondDefaultTime, secondDefaultCost);\n\n if (answer[0] != bruteAnswer[0]) {\n System.err.println(\"GOTCHA\");\n\n System.err.println(Arrays.toString(answer));\n System.err.println(Arrays.toString(bruteAnswer));\n System.err.println(need + \" \" + maxTime + \" \" +firstDefaultTime);\n System.err.println(firstDefaultSize + \" \" + firstDefaultTime + \" \" +firstDefaultCost);\n System.err.println(secondDefaultSize + \" \" + secondDefaultTime + \" \" +secondDefaultCost);\n }\n }\n }\n\n private void solve() {\n long need = readInt();\n long maxTime = readInt();\n long freeDefaultTime = readInt();\n\n long firstDefaultSize = readInt();\n long firstDefaultTime = readInt();\n long firstDefaultCost = readInt();\n\n long secondDefaultSize = readInt();\n long secondDefaultTime = readInt();\n long secondDefaultCost = readInt();\n\n// long[] firstTimes = new long[need + 1];\n// long[] firstCosts = new long[need + 1];\n//\n// for (int i = 1; i <= need; i += firstDefaultSize) {\n// firstTimes[i] = firstDefaultTime + (i == 1 ? 0 : firstTimes[i - firstDefaultSize]);\n// firstCosts[i] = firstDefaultCost + (i == 1 ? 0 : firstCosts[i - firstDefaultSize]);\n// }\n//\n// for (int i = 1; i <= need; ++i) {\n// firstTimes[i] = max(firstTimes[i - 1], firstTimes[i]);\n// firstCosts[i] = max(firstCosts[i - 1], firstCosts[i]);\n// }\n//\n// long[] secondTimes = new long[need + 1];\n// long[] secondCosts = new long[need + 1];\n//\n// for (int i = 1; i <= need; i += secondDefaultSize) {\n// secondTimes[i] = secondDefaultTime + (i == 1 ? 0 : secondTimes[i - secondDefaultSize]);\n// secondCosts[i] = secondDefaultCost + (i == 1 ? 0 : secondCosts[i - secondDefaultSize]);\n// }\n//\n// for (int i = 1; i <= need; ++i) {\n// secondTimes[i] = max(secondTimes[i - 1], secondTimes[i]);\n// secondCosts[i] = max(secondCosts[i - 1], secondCosts[i]);\n// }\n//\n// long[] freeTimes = new long[need + 1];\n// for (int i = 1; i <= need; ++i) {\n// freeTimes[i] = freeTimes[i - 1] + freeDefaultTime;\n// }\n\n long[] answer = getAnswer(need, maxTime, freeDefaultTime,\n firstDefaultSize, firstDefaultTime, firstDefaultCost,\n secondDefaultSize, secondDefaultTime, secondDefaultCost\n );\n\n out.println(answer[0]);\n }\n\n long[] getAnswer(long need, long maxTime, long freeDefaultTime,\n long firstDefaultSize,long firstDefaultTime,long firstDefaultCost,\n long secondDefaultSize,long secondDefaultTime,long secondDefaultCost) {\n long answer = Long.MAX_VALUE;\n long firstOptimal = 0, secondOptimal = 0;\n \n for (long firstCount = 0, firstSize = 0, firstTime = 0, firstCost = 0; ;\n ++firstCount, firstSize += firstDefaultSize,\n firstCost += firstDefaultCost,\n firstTime += firstDefaultTime * firstDefaultSize) {\n\n if (firstSize >= need) {\n firstSize = need;\n firstTime = firstDefaultTime * firstSize;\n }\n\n long canUseTime = maxTime - firstTime;\n long needUseSize = need - firstSize;\n if (canUseTime >= 0) {\n if (freeDefaultTime <= secondDefaultTime) {\n long freeTime = freeDefaultTime * needUseSize;\n if (freeTime + firstTime <= maxTime) {\n if (answer > firstCost) {\n answer = firstCost;\n firstOptimal = firstCount;\n secondOptimal = 0;\n }\n }\n } else {\n long lowerSideCount = needUseSize / secondDefaultSize;\n long lowerSecondSize = secondDefaultSize * lowerSideCount;\n long lowerFreeSize = needUseSize - lowerSecondSize;\n\n long lowerSecondTime = lowerSecondSize * secondDefaultTime;\n long lowerFreeTime = lowerFreeSize * freeDefaultTime;\n\n if (lowerSecondTime + lowerFreeTime <= canUseTime) {\n\n if (answer > firstCost + lowerSideCount * secondDefaultCost) {\n answer = firstCost + lowerSideCount * secondDefaultCost;\n firstOptimal = firstCount;\n secondOptimal = lowerSideCount;\n }\n }\n\n long upperSideCount = needUseSize / secondDefaultSize;\n if (needUseSize % secondDefaultSize != 0) ++upperSideCount;\n long upperSecondSize = min(needUseSize, secondDefaultSize * upperSideCount);\n long upperFreeSize = needUseSize - upperSecondSize;\n\n long upperSecondTime = upperSecondSize * secondDefaultTime;\n long upperFreeTime = upperFreeSize * freeDefaultTime;\n\n if (upperSecondTime + upperFreeTime <= canUseTime) {\n if (answer > firstCost + upperSideCount * secondDefaultCost) {\n answer = firstCost + upperSideCount * secondDefaultCost;\n firstOptimal = firstCount;\n secondOptimal = upperSideCount;\n }\n\n long exactNumerator = ((needUseSize * freeDefaultTime - canUseTime));\n long exactDenominator = (freeDefaultTime - secondDefaultTime) * secondDefaultSize;\n\n\n long exactSideCount = exactNumerator / exactDenominator;\n if (exactNumerator < 0) exactSideCount = 0;\n else if (exactNumerator % exactDenominator != 0) {\n exactSideCount++;\n }\n if (exactSideCount >= 0) {\n long exactSecondSize = min(needUseSize, secondDefaultSize * exactSideCount);\n long exactFreeSize = needUseSize - exactSecondSize;\n\n long exactSecondTime = exactSecondSize * secondDefaultTime;\n long exactFreeTime = exactFreeSize * freeDefaultTime;\n\n if (exactSecondTime + exactFreeTime <= canUseTime) {\n\n if (answer > firstCost + exactSideCount * secondDefaultCost) {\n answer = firstCost + exactSideCount * secondDefaultCost;\n firstOptimal = firstCount;\n secondOptimal = exactSideCount;\n }\n }\n }\n }\n\n\n }\n }\n\n if (firstSize >= need) break;\n }\n \n for (long secondCount = 0, secondSize = 0, secondCost = 0, secondTime = 0; ;\n ++secondCount, secondSize += secondDefaultSize,\n secondCost += secondDefaultCost,\n secondTime += secondDefaultTime * secondDefaultSize) {\n\n if (secondSize >= need) {\n secondSize = need;\n secondTime = secondDefaultTime * secondSize;\n }\n\n long canUseTime = maxTime - secondTime;\n long needUseSize = need - secondSize;\n if (canUseTime >= 0) {\n if (freeDefaultTime <= firstDefaultTime) {\n long freeTime = freeDefaultTime * needUseSize;\n if (freeTime + secondTime <= maxTime) {\n if (answer > secondCost) {\n answer = secondCost;\n secondOptimal = secondCount;\n firstOptimal = 0;\n }\n }\n } else {\n long lowerSideCount = needUseSize / firstDefaultSize;\n long lowerfirstSize = firstDefaultSize * lowerSideCount;\n long lowerFreeSize = needUseSize - lowerfirstSize;\n\n long lowerfirstTime = lowerfirstSize * firstDefaultTime;\n long lowerFreeTime = lowerFreeSize * freeDefaultTime;\n\n if (lowerfirstTime + lowerFreeTime <= canUseTime) {\n\n if (answer > secondCost + lowerSideCount * firstDefaultCost) {\n answer = secondCost + lowerSideCount * firstDefaultCost;\n secondOptimal = secondCount;\n firstOptimal = lowerSideCount;\n }\n }\n\n long upperSideCount = needUseSize / firstDefaultSize;\n if (needUseSize % firstDefaultSize != 0) ++upperSideCount;\n long upperfirstSize = min(needUseSize, firstDefaultSize * upperSideCount);\n long upperFreeSize = needUseSize - upperfirstSize;\n\n long upperfirstTime = upperfirstSize * firstDefaultTime;\n long upperFreeTime = upperFreeSize * freeDefaultTime;\n\n if (upperfirstTime + upperFreeTime <= canUseTime) {\n if (answer > secondCost + upperSideCount * firstDefaultCost) {\n answer = secondCost + upperSideCount * firstDefaultCost;\n secondOptimal = secondCount;\n firstOptimal = upperSideCount;\n }\n\n long exactNumerator = ((needUseSize * freeDefaultTime - canUseTime));\n long exactDenominator = (freeDefaultTime - firstDefaultTime) * firstDefaultSize;\n\n\n long exactSideCount = exactNumerator / exactDenominator;\n if (exactNumerator < 0) exactSideCount = 0;\n else if (exactNumerator % exactDenominator != 0) {\n exactSideCount++;\n }\n if (exactSideCount >= 0) {\n long exactfirstSize = min(needUseSize, firstDefaultSize * exactSideCount);\n long exactFreeSize = needUseSize - exactfirstSize;\n\n long exactfirstTime = exactfirstSize * firstDefaultTime;\n long exactFreeTime = exactFreeSize * freeDefaultTime;\n\n if (exactfirstTime + exactFreeTime <= canUseTime) {\n\n if (answer > secondCost + exactSideCount * firstDefaultCost) {\n answer = secondCost + exactSideCount * firstDefaultCost;\n secondOptimal = secondCount;\n firstOptimal = exactSideCount;\n }\n }\n }\n }\n\n\n }\n }\n\n if (secondSize >= need) break;\n }\n\n if (answer == Long.MAX_VALUE) {\n answer = -1;\n }\n\n return new long[] { answer, firstOptimal, secondOptimal };\n }\n\n long[] getBruteAnswer(int need, long maxTime, long freeDefaultTime,\n int firstDefaultSize,long firstDefaultTime,long firstDefaultCost,\n int secondDefaultSize,long secondDefaultTime,long secondDefaultCost) {\n long answer = Long.MAX_VALUE;\n long firstOptimal = 0, secondOptimal = 0;\n\n for (int firstCount = 0; ; ++firstCount) {\n int firstSize = min(need, firstCount * firstDefaultSize);\n if (firstSize >= need) firstSize = need;\n\n long firstTime = firstSize * firstDefaultTime;\n long firstCost = firstCount * firstDefaultCost;\n\n int needUseSize = (need - firstSize);\n for (int secondCount = 0; ; ++secondCount) {\n int secondSize = min(needUseSize, secondCount * secondDefaultSize);\n if (secondSize >= needUseSize) secondSize = needUseSize;\n\n long secondTime = secondSize * secondDefaultTime;\n long secondCost = secondCount * secondDefaultCost;\n\n int freeSize = needUseSize - secondSize;\n long freeTime = freeSize * freeDefaultTime;\n\n if (firstTime + secondTime + freeTime <= maxTime) {\n if (answer > firstCost + secondCost) {\n answer = firstCost + secondCost;\n firstOptimal = firstCount;\n secondOptimal = secondCount;\n }\n }\n\n if (secondSize >= needUseSize) break;\n }\n\n if (firstSize >= need) break;\n }\n\n if (answer == Long.MAX_VALUE) {\n answer = -1;\n }\n\n return new long[] { answer, firstOptimal, secondOptimal };\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static long add(long a, long b) { return (a + b) % MODULO; }\n private static long subtract(long a, long b) { return add(a, MODULO - b) % MODULO; }\n private static long mult(long a, long b) { return (a * b) % MODULO; }\n\n /////////////////////////////////////////////////////////////////////\n\n private final static boolean FIRST_INPUT_STRING = false;\n private final static boolean MULTIPLE_TESTS = false;\n private final boolean ONLINE_JUDGE = !new File(\"input.txt\").exists();\n// private final boolean ONLINE_JUDGE = System.getProperty(\"ONLINE_JUDGE\") != null;\n\n private final static int MAX_STACK_SIZE = 128;\n\n private final static boolean OPTIMIZE_READ_NUMBERS = false;\n\n /////////////////////////////////////////////////////////////////////\n\n public void run(){\n try{\n timeInit();\n Locale.setDefault(Locale.US);\n\n init();\n\n if (ONLINE_JUDGE) {\n solve();\n } else {\n do {\n try {\n timeInit();\n solve();\n time();\n\n out.println();\n } catch (NumberFormatException e) {\n break;\n } catch (NullPointerException e) {\n if (FIRST_INPUT_STRING) break;\n else throw e;\n }\n } while (MULTIPLE_TESTS);\n }\n\n out.close();\n time();\n }catch (Exception e){\n e.printStackTrace(System.err);\n System.exit(-1);\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private BufferedReader in;\n private OutputWriter out;\n private StringTokenizer tok = new StringTokenizer(\"\");\n\n public static void main(String[] args){\n new Thread(null, new C(), \"\", MAX_STACK_SIZE * (1L << 20)).start();\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private void init() throws FileNotFoundException{\n Locale.setDefault(Locale.US);\n\n if (ONLINE_JUDGE){\n if (fileName.isEmpty()) {\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new OutputWriter(System.out);\n } else {\n in = new BufferedReader(new FileReader(fileName + \".in\"));\n out = new OutputWriter(fileName + \".out\");\n }\n }else{\n in = new BufferedReader(new FileReader(\"input.txt\"));\n out = new OutputWriter(\"output.txt\");\n }\n }\n\n ////////////////////////////////////////////////////////////////\n\n private long timeBegin;\n\n private void timeInit() {\n this.timeBegin = System.currentTimeMillis();\n }\n\n private void time(){\n long timeEnd = System.currentTimeMillis();\n System.err.println(\"Time = \" + (timeEnd - timeBegin));\n }\n\n private void debug(Object... objects){\n if (ONLINE_JUDGE){\n for (Object o: objects){\n System.err.println(o.toString());\n }\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private String delim = \" \";\n\n private String readLine() {\n try {\n return in.readLine();\n } catch (IOException e) {\n throw new RuntimeIOException(e);\n }\n }\n\n private String readString() {\n try {\n while(!tok.hasMoreTokens()){\n tok = new StringTokenizer(readLine(), delim);\n }\n\n return tok.nextToken(delim);\n } catch (NullPointerException e) {\n return null;\n }\n }\n\n /////////////////////////////////////////////////////////////////\n\n private final char NOT_A_SYMBOL = '\\0';\n\n private char readChar() {\n try {\n int intValue = in.read();\n\n if (intValue == -1){\n return NOT_A_SYMBOL;\n }\n\n return (char) intValue;\n } catch (IOException e) {\n throw new RuntimeIOException(e);\n }\n }\n\n private char[] readCharArray() {\n return readLine().toCharArray();\n }\n\n private char[][] readCharField(int rowsCount) {\n char[][] field = new char[rowsCount][];\n for (int row = 0; row < rowsCount; ++row) {\n field[row] = readCharArray();\n }\n\n return field;\n }\n\n /////////////////////////////////////////////////////////////////\n\n private long optimizedReadLong() {\n int sign = 1;\n long result = 0;\n boolean started = false;\n while (true) {\n try {\n int j = in.read();\n if (-1 == j) {\n if (started) return sign * result;\n throw new NumberFormatException();\n }\n\n if (j == '-') {\n if (started) throw new NumberFormatException();\n sign = -sign;\n }\n\n if ('0' <= j && j <= '9') {\n result = result * 10 + j - '0';\n started = true;\n } else if (started) {\n return sign * result;\n }\n } catch (IOException e) {\n throw new RuntimeIOException(e);\n }\n }\n }\n\n private int readInt() {\n\n if (!OPTIMIZE_READ_NUMBERS) {\n return Integer.parseInt(readString());\n } else {\n return (int) optimizedReadLong();\n }\n }\n\n private int[] readIntArray(int size) {\n int[] array = new int[size];\n\n for (int index = 0; index < size; ++index){\n array[index] = readInt();\n }\n\n return array;\n }\n\n private int[] readSortedIntArray(int size) {\n Integer[] array = new Integer[size];\n\n for (int index = 0; index < size; ++index) {\n array[index] = readInt();\n }\n Arrays.sort(array);\n\n int[] sortedArray = new int[size];\n for (int index = 0; index < size; ++index) {\n sortedArray[index] = array[index];\n }\n\n return sortedArray;\n }\n\n private int[] readIntArrayWithDecrease(int size) {\n int[] array = readIntArray(size);\n\n for (int i = 0; i < size; ++i) {\n array[i]--;\n }\n\n return array;\n }\n\n ///////////////////////////////////////////////////////////////////\n\n private int[][] readIntMatrix(int rowsCount, int columnsCount) {\n int[][] matrix = new int[rowsCount][];\n\n for (int rowIndex = 0; rowIndex < rowsCount; ++rowIndex) {\n matrix[rowIndex] = readIntArray(columnsCount);\n }\n\n return matrix;\n }\n\n private int[][] readIntMatrixWithDecrease(int rowsCount, int columnsCount) {\n int[][] matrix = new int[rowsCount][];\n\n for (int rowIndex = 0; rowIndex < rowsCount; ++rowIndex) {\n matrix[rowIndex] = readIntArrayWithDecrease(columnsCount);\n }\n\n return matrix;\n }\n\n ///////////////////////////////////////////////////////////////////\n\n private long readLong() {\n if (!OPTIMIZE_READ_NUMBERS) {\n return Long.parseLong(readString());\n } else {\n return optimizedReadLong();\n }\n }\n\n private long[] readLongArray(int size) {\n long[] array = new long[size];\n\n for (int index = 0; index < size; ++index){\n array[index] = readLong();\n }\n\n return array;\n }\n\n ////////////////////////////////////////////////////////////////////\n\n private double readDouble() {\n return Double.parseDouble(readString());\n }\n\n private double[] readDoubleArray(int size) {\n double[] array = new double[size];\n\n for (int index = 0; index < size; ++index){\n array[index] = readDouble();\n }\n\n return array;\n }\n\n ////////////////////////////////////////////////////////////////////\n\n private BigInteger readBigInteger() {\n return new BigInteger(readString());\n }\n\n private BigDecimal readBigDecimal() {\n return new BigDecimal(readString());\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private Point readPoint() {\n int x = readInt();\n int y = readInt();\n return new Point(x, y);\n }\n\n private Point[] readPointArray(int size) {\n Point[] array = new Point[size];\n\n for (int index = 0; index < size; ++index){\n array[index] = readPoint();\n }\n\n return array;\n }\n\n /////////////////////////////////////////////////////////////////////\n\n @Deprecated\n private List<Integer>[] readGraph(int vertexNumber, int edgeNumber) {\n @SuppressWarnings(\"unchecked\")\n List<Integer>[] graph = new List[vertexNumber];\n\n for (int index = 0; index < vertexNumber; ++index){\n graph[index] = new ArrayList<Integer>();\n }\n\n while (edgeNumber-- > 0){\n int from = readInt() - 1;\n int to = readInt() - 1;\n\n graph[from].add(to);\n graph[to].add(from);\n }\n\n return graph;\n }\n\n private static class GraphBuilder {\n\n final int size;\n final List<Integer>[] edges;\n\n static GraphBuilder createInstance(int size) {\n List<Integer>[] edges = new List[size];\n for (int v = 0; v < size; ++v) {\n edges[v] = new ArrayList<Integer>();\n }\n\n return new GraphBuilder(edges);\n }\n\n private GraphBuilder(List<Integer>[] edges) {\n this.size = edges.length;\n this.edges = edges;\n }\n\n public void addEdge(int from, int to) {\n addDirectedEdge(from, to);\n addDirectedEdge(to, from);\n }\n\n public void addDirectedEdge(int from, int to) {\n edges[from].add(to);\n }\n\n public int[][] build() {\n int[][] graph = new int[size][];\n for (int v = 0; v < size; ++v) {\n List<Integer> vEdges = edges[v];\n graph[v] = castInt(vEdges);\n }\n\n return graph;\n }\n }\n\n private final static int ZERO_INDEXATION = 0, ONE_INDEXATION = 1;\n\n private int[][] readUnweightedGraph(int vertexNumber, int edgesNumber) {\n return readUnweightedGraph(vertexNumber, edgesNumber, ONE_INDEXATION, false);\n }\n\n private int[][] readUnweightedGraph(int vertexNumber, int edgesNumber,\n int indexation, boolean directed\n ) {\n GraphBuilder graphBuilder = GraphBuilder.createInstance(vertexNumber);\n for (int i = 0; i < edgesNumber; ++i) {\n int from = readInt() - indexation;\n int to = readInt() - indexation;\n\n if (directed) graphBuilder.addDirectedEdge(from, to);\n else graphBuilder.addEdge(from, to);\n }\n\n return graphBuilder.build();\n }\n\n private static class Edge {\n int to;\n int w;\n\n Edge(int to, int w) {\n this.to = to;\n this.w = w;\n }\n }\n\n private Edge[][] readWeightedGraph(int vertexNumber, int edgesNumber) {\n return readWeightedGraph(vertexNumber, edgesNumber, ONE_INDEXATION, false);\n }\n\n private Edge[][] readWeightedGraph(int vertexNumber, int edgesNumber,\n int indexation, boolean directed) {\n @SuppressWarnings(\"unchecked\")\n List<Edge>[] graph = new List[vertexNumber];\n for (int v = 0; v < vertexNumber; ++v) {\n graph[v] = new ArrayList<Edge>();\n }\n\n while (edgesNumber --> 0) {\n int from = readInt() - indexation;\n int to = readInt() - indexation;\n int w = readInt();\n\n graph[from].add(new Edge(to, w));\n if (!directed) graph[to].add(new Edge(from, w));\n }\n\n Edge[][] graphArrays = new Edge[vertexNumber][];\n for (int v = 0; v < vertexNumber; ++v) {\n graphArrays[v] = graph[v].toArray(new Edge[0]);\n }\n\n return graphArrays;\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static class IntIndexPair {\n\n static Comparator<IntIndexPair> increaseComparator = new Comparator<C.IntIndexPair>() {\n\n @Override\n public int compare(C.IntIndexPair indexPair1, C.IntIndexPair indexPair2) {\n int value1 = indexPair1.value;\n int value2 = indexPair2.value;\n\n if (value1 != value2) return value1 - value2;\n\n int index1 = indexPair1.index;\n int index2 = indexPair2.index;\n\n return index1 - index2;\n }\n };\n\n static Comparator<IntIndexPair> decreaseComparator = new Comparator<C.IntIndexPair>() {\n\n @Override\n public int compare(C.IntIndexPair indexPair1, C.IntIndexPair indexPair2) {\n int value1 = indexPair1.value;\n int value2 = indexPair2.value;\n\n if (value1 != value2) return -(value1 - value2);\n\n int index1 = indexPair1.index;\n int index2 = indexPair2.index;\n\n return index1 - index2;\n }\n };\n\n static IntIndexPair[] from(int[] array) {\n IntIndexPair[] iip = new IntIndexPair[array.length];\n for (int i = 0; i < array.length; ++i) {\n iip[i] = new IntIndexPair(array[i], i);\n }\n\n return iip;\n }\n\n int value, index;\n\n IntIndexPair(int value, int index) {\n super();\n this.value = value;\n this.index = index;\n }\n\n int getRealIndex() {\n return index + 1;\n }\n }\n\n private IntIndexPair[] readIntIndexArray(int size) {\n IntIndexPair[] array = new IntIndexPair[size];\n\n for (int index = 0; index < size; ++index) {\n array[index] = new IntIndexPair(readInt(), index);\n }\n\n return array;\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static class OutputWriter extends PrintWriter {\n\n final int DEFAULT_PRECISION = 12;\n\n private int precision;\n private String format, formatWithSpace;\n\n {\n precision = DEFAULT_PRECISION;\n\n format = createFormat(precision);\n formatWithSpace = format + \" \";\n }\n\n OutputWriter(OutputStream out) {\n super(out);\n }\n\n OutputWriter(String fileName) throws FileNotFoundException {\n super(fileName);\n }\n\n int getPrecision() {\n return precision;\n }\n\n void setPrecision(int precision) {\n precision = max(0, precision);\n this.precision = precision;\n\n format = createFormat(precision);\n formatWithSpace = format + \" \";\n }\n\n String createFormat(int precision){\n return \"%.\" + precision + \"f\";\n }\n\n @Override\n public void print(double d){\n printf(format, d);\n }\n \n @Override\n public void println(double d){\n print(d);\n println();\n }\n\n void printWithSpace(double d){\n printf(formatWithSpace, d);\n }\n\n void printAll(double...d){\n for (int i = 0; i < d.length - 1; ++i){\n printWithSpace(d[i]);\n }\n\n print(d[d.length - 1]);\n }\n\n void printlnAll(double... d){\n printAll(d);\n println();\n }\n \n void printAll(int... array) {\n \tfor (int value : array) {\n \t\tprint(value + \" \");\n \t}\n }\n \n void printlnAll(int... array) {\n \tprintAll(array);\n \tprintln();\n }\n \n void printAll(long... array) {\n \tfor (long value : array) {\n \t\tprint(value + \" \");\n \t}\n }\n \n void printlnAll(long... array) {\n \tprintAll(array);\n \tprintln();\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static class RuntimeIOException extends RuntimeException {\n\n /**\n *\n */\n private static final long serialVersionUID = -6463830523020118289L;\n\n RuntimeIOException(Throwable cause) {\n super(cause);\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n //////////////// Some useful constants andTo functions ////////////////\n /////////////////////////////////////////////////////////////////////\n\n private static final int[][] steps = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};\n private static final int[][] steps8 = {\n {-1, 0}, {1, 0}, {0, -1}, {0, 1},\n {-1, -1}, {1, 1}, {1, -1}, {-1, 1}\n };\n\n private static boolean checkCell(int row, int rowsCount, int column, int columnsCount) {\n return checkIndex(row, rowsCount) && checkIndex(column, columnsCount);\n }\n\n private static boolean checkIndex(int index, int lim){\n return (0 <= index && index < lim);\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static int getBit(long mask, int bit) { return (int)((mask >> bit) & 1); }\n private static boolean checkBit(long mask, int bit){\n return getBit(mask, bit) != 0;\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static long getSum(int[] array) {\n long sum = 0;\n for (int value: array) {\n sum += value;\n }\n\n return sum;\n }\n\n private static Point getMinMax(int[] array) {\n int min = array[0];\n int max = array[0];\n\n for (int index = 0, size = array.length; index < size; ++index, ++index) {\n int value = array[index];\n\n if (index == size - 1) {\n min = min(min, value);\n max = max(max, value);\n } else {\n int otherValue = array[index + 1];\n\n if (value <= otherValue) {\n min = min(min, value);\n max = max(max, otherValue);\n } else {\n min = min(min, otherValue);\n max = max(max, value);\n }\n }\n }\n\n return new Point(min, max);\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static int[] getPrimes(int n) {\n boolean[] used = new boolean[n];\n used[0] = used[1] = true;\n\n int size = 0;\n for (int i = 2; i < n; ++i) {\n if (!used[i]) {\n ++size;\n for (int j = 2 * i; j < n; j += i) {\n used[j] = true;\n }\n }\n }\n\n int[] primes = new int[size];\n for (int i = 0, cur = 0; i < n; ++i) {\n if (!used[i]) {\n primes[cur++] = i;\n }\n }\n\n return primes;\n }\n\n /////////////////////////////////////////////////////////////////////\n\n int[] getDivisors(int value) {\n List<Integer> divisors = new ArrayList<Integer>();\n for (int divisor = 1; divisor * divisor <= value; ++divisor) {\n if (value % divisor == 0) {\n divisors.add(divisor);\n if (divisor * divisor != value) {\n divisors.add(value / divisor);\n }\n }\n }\n\n return castInt(divisors);\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static long lcm(long a, long b) {\n return a / gcd(a, b) * b;\n }\n\n private static long gcd(long a, long b) {\n return (a == 0 ? b : gcd(b % a, a));\n }\n\n/////////////////////////////////////////////////////////////////////\n\n private interface MultiSet<ValueType> {\n\n int size();\n\n void inc(ValueType value);\n boolean dec(ValueType value);\n\n int count(ValueType value);\n }\n\n private static abstract class MultiSetImpl\n <ValueType, MapType extends Map<ValueType, Integer>>\n implements MultiSet<ValueType> {\n\n protected final MapType map;\n protected int size;\n\n protected MultiSetImpl(MapType map) {\n this.map = map;\n this.size = 0;\n }\n\n public int size() {\n return size;\n }\n\n public void inc(ValueType value) {\n int count = count(value);\n map.put(value, count + 1);\n\n ++size;\n }\n\n public boolean dec(ValueType value) {\n int count = count(value);\n if (count == 0) return false;\n\n if (count == 1) map.remove(value);\n else map.put(value, count - 1);\n\n --size;\n return true;\n }\n\n public int count(ValueType value) {\n Integer count = map.get(value);\n return (count == null ? 0 : count);\n }\n }\n\n private static class HashMultiSet<ValueType>\n extends MultiSetImpl<ValueType, Map<ValueType, Integer>> {\n\n public static <ValueType> MultiSet<ValueType> createMultiSet() {\n Map<ValueType, Integer> map = new HashMap<ValueType, Integer>();\n return new HashMultiSet<ValueType>(map);\n }\n\n HashMultiSet(Map<ValueType, Integer> map) {\n super(map);\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private interface SortedMultiSet<ValueType> extends MultiSet<ValueType> {\n\n ValueType min();\n ValueType max();\n\n ValueType pollMin();\n ValueType pollMax();\n\n ValueType lower(ValueType value);\n ValueType floor(ValueType value);\n\n ValueType ceiling(ValueType value);\n ValueType higher(ValueType value);\n }\n\n private static abstract class SortedMultiSetImpl<ValueType>\n extends MultiSetImpl<ValueType, NavigableMap<ValueType, Integer>>\n implements SortedMultiSet<ValueType> {\n\n SortedMultiSetImpl(NavigableMap<ValueType, Integer> map) {\n super(map);\n }\n\n @Override\n public ValueType min() {\n return (size == 0 ? null : map.firstKey());\n }\n\n @Override\n public ValueType max() {\n return (size == 0 ? null : map.lastKey());\n }\n\n @Override\n public ValueType pollMin() {\n ValueType first = min();\n if (first != null) dec(first);\n return first;\n }\n\n @Override\n public ValueType pollMax() {\n ValueType last = max();\n dec(last);\n return last;\n }\n\n @Override\n public ValueType lower(ValueType value) {\n return map.lowerKey(value);\n }\n\n @Override\n public ValueType floor(ValueType value) {\n return map.floorKey(value);\n }\n\n @Override\n public ValueType ceiling(ValueType value) {\n return map.ceilingKey(value);\n }\n\n @Override\n public ValueType higher(ValueType value) {\n return map.higherKey(value);\n }\n }\n\n private static class TreeMultiSet<ValueType>\n extends SortedMultiSetImpl<ValueType> {\n\n public static <ValueType> SortedMultiSet<ValueType> createMultiSet() {\n NavigableMap<ValueType, Integer> map = new TreeMap<ValueType, Integer>();\n return new TreeMultiSet<ValueType>(map);\n }\n\n TreeMultiSet(NavigableMap<ValueType, Integer> map) {\n super(map);\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static class IdMap<KeyType> extends HashMap<KeyType, Integer> {\n\n /**\n *\n */\n private static final long serialVersionUID = -3793737771950984481L;\n\n public IdMap() {\n super();\n }\n\n int register(KeyType key) {\n Integer id = super.get(key);\n if (id == null) {\n super.put(key, id = size());\n }\n\n return id;\n }\n\n int getId(KeyType key) {\n return get(key);\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static class SortedIdMapper<ValueType extends Comparable<ValueType>> {\n\n private List<ValueType> values;\n\n public SortedIdMapper() {\n this.values = new ArrayList<ValueType>();\n }\n\n void addValue(ValueType value) {\n values.add(value);\n }\n\n IdMap<ValueType> build() {\n Collections.sort(values);\n\n IdMap<ValueType> ids = new IdMap<ValueType>();\n List<ValueType> uniqueValues = new ArrayList<ValueType>();\n\n for (int index = 0; index < values.size(); ++index) {\n ValueType value = values.get(index);\n if (index == 0 || values.get(index - 1).compareTo(value) != 0) {\n ids.register(value);\n uniqueValues.add(value);\n }\n }\n \n values = uniqueValues;\n\n return ids;\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static int[] castInt(List<Integer> list) {\n int[] array = new int[list.size()];\n for (int i = 0; i < array.length; ++i) {\n array[i] = list.get(i);\n }\n\n return array;\n }\n\n private static long[] castLong(List<Long> list) {\n long[] array = new long[list.size()];\n for (int i = 0; i < array.length; ++i) {\n array[i] = list.get(i);\n }\n\n return array;\n }\n\n /////////////////////////////////////////////////////////////////////\n\n /**\n * Generates list with keys 0..<n\n * @param n - exclusive limit of sequence\n */\n private static List<Integer> order(int n) {\n List<Integer> sequence = new ArrayList<Integer>();\n for (int i = 0; i < n; ++i) {\n sequence.add(i);\n }\n\n return sequence;\n }\n\n /////////////////////////////////////////////////////////////////////\n\n interface Rmq {\n int getMin(int left, int right);\n int getMinIndex(int left, int right);\n }\n\n private static class SparseTable implements Rmq {\n\n private static final int MAX_BIT = 17;\n\n int n;\n int[] array;\n\n SparseTable(int[] array) {\n this.n = array.length;\n this.array = array;\n }\n\n int[] lengthMaxBits;\n int[][] table;\n\n int getIndexOfLess(int leftIndex, int rightIndex) {\n return (array[leftIndex] <= array[rightIndex])\n ? leftIndex\n : rightIndex;\n }\n\n SparseTable build() {\n this.lengthMaxBits = new int[n + 1];\n lengthMaxBits[0] = 0;\n for (int i = 1; i <= n; ++i) {\n lengthMaxBits[i] = lengthMaxBits[i - 1];\n int length = (1 << lengthMaxBits[i]);\n if (length + length <= i) ++lengthMaxBits[i];\n }\n\n this.table = new int[MAX_BIT][n];\n table[0] = castInt(order(n));\n\n for (int bit = 0; bit < MAX_BIT - 1; ++bit) {\n for (int i = 0, j = (1 << bit); j < n; ++i, ++j) {\n table[bit + 1][i] = getIndexOfLess(\n table[bit][i], table[bit][j]\n );\n }\n }\n\n return this;\n }\n\n @Override\n public int getMinIndex(int left, int right) {\n int length = (right - left + 1);\n\n int bit = lengthMaxBits[length];\n int segmentLength = (1 << bit);\n\n return getIndexOfLess(\n table[bit][left], table[bit][right - segmentLength + 1]\n );\n }\n\n @Override\n public int getMin(int left, int right) {\n return array[getMinIndex(left, right)];\n }\n }\n\n private static Rmq createRmq(int[] array) {\n return new SparseTable(array).build();\n }\n\n /////////////////////////////////////////////////////////////////////\n\n interface Lca {\n Lca build(int root);\n int lca(int a, int b);\n\n int height(int v);\n }\n\n private static class LcaRmq implements Lca {\n\n int n;\n int[][] graph;\n\n LcaRmq(int[][] graph) {\n this.n = graph.length;\n this.graph = graph;\n }\n\n int time;\n\n int[] order;\n int[] heights;\n int[] first;\n\n Rmq rmq;\n\n @Override\n public LcaRmq build(int root) {\n this.order = new int[n + n];\n this.heights = new int[n];\n\n this.first = new int[n];\n Arrays.fill(first, -1);\n\n this.time = 0;\n dfs(root, 0);\n\n int[] orderedHeights = new int[n + n];\n for (int i = 0; i < order.length; ++i) {\n orderedHeights[i] = heights[order[i]];\n }\n\n this.rmq = createRmq(orderedHeights);\n return this;\n }\n\n void dfs(int from, int height) {\n first[from] = time;\n order[time] = from;\n heights[from] = height;\n ++time;\n\n for (int to : graph[from]) {\n if (first[to] == -1) {\n dfs(to, height + 1);\n\n order[time] = from;\n ++time;\n }\n }\n }\n\n @Override\n public int lca(int a, int b) {\n int aFirst = first[a], bFirst = first[b];\n int left = min(aFirst, bFirst), right = max(aFirst, bFirst);\n\n int orderIndex = rmq.getMinIndex(left, right);\n return order[orderIndex];\n }\n\n @Override\n public int height(int v) {\n return heights[v];\n }\n }\n\n private static class LcaBinary implements Lca {\n\n private static final int MAX_BIT = 20;\n\n int n;\n int[][] graph;\n\n int[] h;\n int[][] parents;\n\n LcaBinary(int[][] graph) {\n this.n = graph.length;\n this.graph = graph;\n }\n\n @Override\n public Lca build(int root) {\n this.h = new int[n];\n\n this.parents = new int[MAX_BIT][n];\n Arrays.fill(parents[0], -1);\n\n Queue<Integer> queue = new ArrayDeque<Integer>();\n\n queue.add(root);\n add(root, root);\n\n while (queue.size() > 0) {\n int from = queue.poll();\n for (int to : graph[from]) {\n if (parents[0][to] == -1) {\n add(from, to);\n queue.add(to);\n }\n }\n }\n\n return this;\n }\n\n void add(int parent, int v) {\n h[v] = h[parent] + 1;\n parents[0][v] = parent;\n for (int bit = 0; bit < MAX_BIT - 1; ++bit) {\n parents[bit + 1][v] = parents[bit][parents[bit][v]];\n }\n }\n\n @Override\n public int lca(int a, int b) {\n if (h[a] < h[b]) {\n int tmp = a;\n a = b;\n b = tmp;\n }\n\n int delta = h[a] - h[b];\n for (int bit = MAX_BIT - 1; bit >= 0; --bit) {\n if (delta >= (1 << bit)) {\n delta -= (1 << bit);\n a = parents[bit][a];\n }\n }\n\n if (a == b) return a;\n\n for (int bit = MAX_BIT - 1; bit >= 0; --bit) {\n int nextA = parents[bit][a], nextB = parents[bit][b];\n if (nextA != nextB) {\n a = nextA;\n b = nextB;\n }\n }\n\n return parents[0][a];\n }\n\n @Override\n public int height(int v) {\n return h[v];\n }\n }\n\n private static Lca createLca(int[][] graph, int root) {\n return new LcaRmq(graph).build(root);\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static class BiconnectedGraph {\n\n int n;\n int[][] graph;\n\n BiconnectedGraph(int[][] graph) {\n this.n = graph.length;\n this.graph = graph;\n }\n\n int time;\n int[] tin, up;\n\n boolean[] used;\n\n BiconnectedGraph build() {\n calculateTimes();\n condensateComponents();\n\n return this;\n }\n\n void calculateTimes() {\n this.tin = new int[n];\n this.up = new int[n];\n\n this.time = 0;\n\n this.used = new boolean[n];\n timeDfs(0, -1);\n }\n\n void timeDfs(int from, int parent) {\n used[from] = true;\n\n up[from] = tin[from] = time;\n ++time;\n\n for (int to : graph[from]) {\n if (to == parent) continue;\n\n if (used[to]) {\n up[from] = min(up[from], tin[to]);\n } else {\n timeDfs(to, from);\n up[from] = min(up[from], up[to]);\n }\n }\n }\n\n int[] components;\n int[][] componentsGraph;\n\n int component(int v) { return components[v]; }\n\n int[][] toGraph() {\n return componentsGraph;\n }\n\n void condensateComponents() {\n this.components = new int[n];\n Arrays.fill(components, -1);\n\n for (int v = 0; v < n; ++v) {\n if (components[v] == -1) {\n componentsDfs(v, v);\n }\n }\n\n GraphBuilder graphBuilder = GraphBuilder.createInstance(n);\n\n Set<Point> edges = new HashSet<Point>();\n for (int from = 0; from < n; ++from) {\n int fromComponent = components[from];\n\n for (int to : graph[from]) {\n int toComponent = components[to];\n if (fromComponent == toComponent) continue;\n\n Point edge = new Point(fromComponent, toComponent);\n if (edges.add(edge)) graphBuilder.addDirectedEdge(fromComponent, toComponent);\n }\n }\n\n this.componentsGraph = graphBuilder.build();\n }\n\n void componentsDfs(int from, int color) {\n components[from] = color;\n for (int to : graph[from]) {\n if (components[to] != -1) continue;\n\n if (tin[from] >= up[to] && tin[to] >= up[from]) {\n componentsDfs(to, color);\n }\n }\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static class VertexBiconnectedGraph {\n\n static class Edge {\n int to;\n int index;\n\n Edge(int to, int index) {\n this.to = to;\n this.index = index;\n }\n }\n\n int n, m;\n List<Edge>[] graph;\n List<Edge> edges;\n\n VertexBiconnectedGraph(int n) {\n this.n = n;\n this.m = 0;\n\n this.graph = new List[n];\n for (int v = 0; v < n; ++v) {\n graph[v] = new ArrayList<Edge>();\n }\n\n this.edges = new ArrayList<Edge>();\n }\n\n void addEdge(int from, int to) {\n Edge fromToEdge = new Edge(to, m);\n Edge toFromEdge = new Edge(from, m + 1);\n\n edges.add(fromToEdge);\n edges.add(toFromEdge);\n\n graph[from].add(fromToEdge);\n graph[to].add(toFromEdge);\n\n m += 2;\n }\n\n int time;\n\n boolean[] used;\n int[] tin, up;\n int[] parents;\n\n boolean[] isArticulation;\n\n boolean[] findArticulationPoints() {\n this.isArticulation = new boolean[n];\n\n this.used = new boolean[n];\n this.parents = new int[n];\n Arrays.fill(parents, -1);\n\n this.tin = new int[n];\n this.up = new int[n];\n\n this.time = 0;\n\n for (int v = 0; v < n; ++v) {\n if (!used[v]) {\n articulationDfs(v, -1);\n }\n }\n\n return isArticulation;\n }\n\n void articulationDfs(int from, int parent) {\n used[from] = true;\n parents[from] = parent;\n\n ++time;\n up[from] = tin[from] = time;\n\n int childrenCount = 0;\n\n for (Edge e : graph[from]) {\n int to = e.to;\n\n if (to == parent) continue;\n\n if (used[to]) {\n up[from] = min(up[from], tin[to]);\n } else {\n ++childrenCount;\n\n articulationDfs(to, from);\n up[from] = min(up[from], up[to]);\n if (up[to] >= tin[from] && parent != -1) {\n isArticulation[from] = true;\n }\n }\n }\n\n if (parent == -1 && childrenCount > 1) {\n isArticulation[from] = true;\n }\n }\n\n int[] edgeColors;\n int maxEdgeColor;\n\n int[] paintEdges() {\n this.edgeColors = new int[m];\n Arrays.fill(edgeColors, -1);\n\n this.maxEdgeColor = -1;\n\n this.used = new boolean[n];\n\n for (int v = 0; v < n; ++v) {\n if (!used[v]) {\n ++maxEdgeColor;\n paintDfs(v, maxEdgeColor, -1);\n }\n }\n\n return edgeColors;\n }\n\n void paintEdge(int edgeIndex, int color) {\n if (edgeColors[edgeIndex] != -1) return;\n\n edgeColors[edgeIndex] = edgeColors[edgeIndex ^ 1] = color;\n }\n\n void paintDfs(int from, int color, int parent) {\n used[from] = true;\n\n for (Edge e : graph[from]) {\n int to = e.to;\n if (to == parent) continue;\n\n if (!used[to]) {\n if (up[to] >= tin[from]) {\n int newColor = ++maxEdgeColor;\n paintEdge(e.index, newColor);\n paintDfs(to, newColor, from);\n } else {\n paintEdge(e.index, color);\n paintDfs(to, color, from);\n }\n } else if (up[to] <= tin[from]){\n paintEdge(e.index, color);\n }\n }\n }\n\n Set<Integer>[] collectVertexEdgeColors() {\n Set<Integer>[] vertexEdgeColors = new Set[n];\n for (int v = 0; v < n; ++v) {\n vertexEdgeColors[v] = new HashSet<Integer>();\n for (Edge e : graph[v]) {\n vertexEdgeColors[v].add(edgeColors[e.index]);\n }\n }\n\n return vertexEdgeColors;\n }\n\n VertexBiconnectedGraph build() {\n findArticulationPoints();\n paintEdges();\n createComponentsGraph();\n\n return this;\n }\n\n int[][] componentsGraph;\n\n void createComponentsGraph() {\n Set<Integer>[] vertexEdgeColors = collectVertexEdgeColors();\n\n int edgeColorShift = vertexEdgeColors.length;\n int size = vertexEdgeColors.length + maxEdgeColor + 1;\n\n GraphBuilder graphBuilder = GraphBuilder.createInstance(size);\n for (int v = 0; v < vertexEdgeColors.length; ++v) {\n for (int edgeColor : vertexEdgeColors[v]) {\n graphBuilder.addEdge(v, edgeColor + edgeColorShift);\n }\n }\n\n this.componentsGraph = graphBuilder.build();\n }\n\n int[][] toGraph() {\n return componentsGraph;\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n\n private static class DSU {\n\n int[] sizes;\n\n int[] ranks;\n int[] parents;\n\n static DSU createInstance(int size) {\n int[] sizes = new int[size];\n Arrays.fill(sizes, 1);\n\n return new DSU(sizes);\n }\n\n DSU(int[] sizes) {\n this.sizes = sizes;\n\n int size = sizes.length;\n\n this.ranks = new int[size];\n Arrays.fill(ranks, 1);\n\n this.parents = castInt(order(size));\n }\n\n int get(int v) {\n if (v == parents[v]) return v;\n return parents[v] = get(parents[v]);\n }\n\n boolean union(int a, int b) {\n a = get(a);\n b = get(b);\n\n if (a == b) return false;\n\n if (ranks[a] < ranks[b]) {\n int tmp = a;\n a = b;\n b = tmp;\n }\n\n parents[b] = a;\n sizes[a] += sizes[b];\n\n if (ranks[a] == ranks[b]) ++ranks[a];\n\n return true;\n }\n }\n\n /////////////////////////////////////////////////////////////////////\n}", "lang_cluster": "Java", "tags": ["implementation", "binary search"], "code_uid": "61aff1cbfc4d70cdb9ddc27171d55eda", "src_uid": "f5f85e75af5b0f25f1f436a21e12fad1", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "/**\n * BaZ :D\n */\nimport java.util.*;\nimport java.io.*;\nimport static java.lang.Math.*;\npublic class Main\n{\n static Reader scan;\n static PrintWriter pw;\n public static void main(String[] args) {\n new Thread(null,null,\"BaZ\",1<<25)\n {\n public void run()\n {\n try\n {\n solve();\n }\n catch(Exception e)\n {\n e.printStackTrace();\n System.exit(1);\n }\n }\n }.start();\n }\n static void solve() throws IOException\n {\n scan = new Reader();\n pw = new PrintWriter(System.out,true);\n StringBuilder sb = new StringBuilder();\n long f = ni(),T = ni(), t0 = ni();\n long a1 = ni(), t1 = ni(), p1 = ni();\n long a2 = ni(), t2 = ni(), p2 = ni();\n long ans = min(solve(f,T,t0,a1,t1,p1,a2,t2,p2), solve(f,T,t0,a2,t2,p2,a1,t1,p1));\n if(ans==Long.MAX_VALUE) {\n pl(-1);\n }\n else {\n pl(ans);\n }\n pw.flush();\n pw.close();\n }\n static long solve(long f,long T,long t0,long a1,long t1,long p1,long a2,long t2,long p2) {\n long min = Long.MAX_VALUE;\n for(int i=0;;++i) {\n if(a1*i>f) {\n if(T>=t1*f) {\n min = min(min, i*p1);\n }\n break;\n }\n long amt_2 = calc(f-a1*i, T-1L*a1*i*t1, t0, a2,t2);\n //pl(\"amt1 : \"+i+\" amt2 : \"+amt_2);\n if(amt_2!=-1) {\n min = min(min, 1L*i*p1 + amt_2*p2);\n }\n }\n return min;\n }\n static long calc(long f, long T, long t0, long a, long t) {\n if(T<0) {\n return -1;\n }\n //pl(\"f : \"+f+\" T : \"+T+\" t0 : \"+t0+\" a : \"+a+\" t : \"+t);\n if(f<=0 || T>=1L*f*t0)\n return 0;\n //pl(\"here\");\n //int max_no_of_times = (f+a-1)/a;\n if(t0<=t || T<1L*f*t)\n return -1;\n long nu = 1L*f*t0-T;\n long de = 1L*a*(t0-t);\n //pl(\"nu : \"+nu+\" de :\"+de);\n return (nu+de-1)/de;\n }\n static int ni() throws IOException\n {\n return scan.nextInt();\n }\n static long nl() throws IOException\n {\n return scan.nextLong();\n }\n static double nd() throws IOException\n {\n return scan.nextDouble();\n }\n static void pl()\n {\n pw.println();\n }\n static void p(Object o)\n {\n pw.print(o+\" \");\n }\n static void pl(Object o)\n {\n pw.println(o);\n }\n static void psb(StringBuilder sb)\n {\n pw.print(sb);\n }\n static void pa(String arrayName, Object arr[])\n {\n pl(arrayName+\" : \");\n for(Object o : arr)\n p(o);\n pl();\n }\n static void pa(String arrayName, int arr[])\n {\n pl(arrayName+\" : \");\n for(int o : arr)\n p(o);\n pl();\n }\n static void pa(String arrayName, long arr[])\n {\n pl(arrayName+\" : \");\n for(long o : arr)\n p(o);\n pl();\n }\n static void pa(String arrayName, double arr[])\n {\n pl(arrayName+\" : \");\n for(double o : arr)\n p(o);\n pl();\n }\n static void pa(String arrayName, char arr[])\n {\n pl(arrayName+\" : \");\n for(char o : arr)\n p(o);\n pl();\n }\n static void pa(String listName, List list)\n {\n pl(listName+\" : \");\n for(Object o : list)\n p(o);\n pl();\n }\n static void pa(String arrayName, Object[][] arr) {\n pl(arrayName+\" : \");\n for(int i=0;i<arr.length;++i) {\n for(Object o : arr[i])\n p(o);\n pl();\n }\n }\n static void pa(String arrayName, int[][] arr) {\n pl(arrayName+\" : \");\n for(int i=0;i<arr.length;++i) {\n for(int o : arr[i])\n p(o);\n pl();\n }\n }\n static void pa(String arrayName, long[][] arr) {\n pl(arrayName+\" : \");\n for(int i=0;i<arr.length;++i) {\n for(long o : arr[i])\n p(o);\n pl();\n }\n }\n static void pa(String arrayName, char[][] arr) {\n pl(arrayName+\" : \");\n for(int i=0;i<arr.length;++i) {\n for(char o : arr[i])\n p(o);\n pl();\n }\n }\n static void pa(String arrayName, double[][] arr) {\n pl(arrayName+\" : \");\n for(int i=0;i<arr.length;++i) {\n for(double o : arr[i])\n p(o);\n pl();\n }\n }\n static class Reader {\n final private int BUFFER_SIZE = 1 << 16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n\n public Reader() {\n din = new DataInputStream(System.in);\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public Reader(String file_name) throws IOException {\n din = new DataInputStream(new FileInputStream(file_name));\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public String readLine() throws IOException {\n byte[] buf = new byte[64];\n int cnt = 0, c;\n while ((c = read()) != -1) {\n if (c == '\\n') break;\n buf[cnt++] = (byte) c;\n }\n return new String(buf, 0, cnt);\n }\n\n public int nextInt() throws IOException {\n int ret = 0;\n byte c = read();\n while (c <= ' ') c = read();\n boolean neg = (c == '-');\n if (neg) c = read();\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n if (neg) return -ret;\n return ret;\n }\n\n public long nextLong() throws IOException {\n long ret = 0;\n byte c = read();\n while (c <= ' ') c = read();\n boolean neg = (c == '-');\n if (neg) c = read();\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n if (neg) return -ret;\n return ret;\n }\n\n public double nextDouble() throws IOException {\n double ret = 0, div = 1;\n byte c = read();\n while (c <= ' ') c = read();\n boolean neg = (c == '-');\n if (neg) c = read();\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n if (c == '.') while ((c = read()) >= '0' && c <= '9') ret += (c - '0') / (div *= 10);\n if (neg) return -ret;\n return ret;\n }\n\n private void fillBuffer() throws IOException {\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1) buffer[0] = -1;\n }\n\n private byte read() throws IOException {\n if (bufferPointer == bytesRead) fillBuffer();\n return buffer[bufferPointer++];\n }\n\n public void close() throws IOException {\n if (din == null) return;\n din.close();\n }\n }\n}", "lang_cluster": "Java", "tags": ["implementation", "binary search"], "code_uid": "8872407785c406eed783a0687f75cc24", "src_uid": "f5f85e75af5b0f25f1f436a21e12fad1", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastScanner in = new FastScanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC {\n final long infinity = Long.MAX_VALUE / 3;\n FastScanner in;\n\n public void solve(int testNumber, FastScanner in, PrintWriter out) {\n this.in = in;\n long bytesLeft0 = assertedNextInt();\n long timeLeft0 = assertedNextInt();\n long t0 = assertedNextInt();\n\n long a1 = assertedNextInt();\n long t1 = assertedNextInt();\n long p1 = assertedNextInt();\n\n long a2 = assertedNextInt();\n long t2 = assertedNextInt();\n long p2 = assertedNextInt();\n long u = solve(bytesLeft0, timeLeft0, t0, a1, t1, p1, a2, t2, p2);\n long v = solve(bytesLeft0, timeLeft0, t0, a2, t2, p2, a1, t1, p1);\n long ans = Math.min(u, v);\n if (ans >= infinity) {\n ans = -1;\n }\n out.println(ans);\n }\n\n private long solve(long bytesLeft0, long timeLeft0, long t0, long a1, long t1, long p1, long a2, long t2, long p2) {\n final int N = (int) 1e7 + 20;\n long ans = infinity;\n for (int k1 = 0; k1 <= N; k1++) {\n long cost1 = k1 * p1;\n long bytesDownloaded1 = Math.min(bytesLeft0, k1 * a1);\n long time1 = bytesDownloaded1 * t1;\n long bytesLeft1 = bytesLeft0 - bytesDownloaded1;\n long timeLeft1 = timeLeft0 - time1;\n if (timeLeft1 < 0) {\n continue;\n }\n if (bytesLeft1 == 0) {\n ans = Math.min(ans, cost1);\n continue;\n }\n if (t0 * bytesLeft1 <= timeLeft1) {\n ans = Math.min(ans, cost1);\n continue;\n }\n if (t0 <= t2) {\n continue;\n }\n if (bytesLeft1 * t2 > timeLeft1) {\n continue;\n }\n long bytes0 = Math.min(bytesLeft1, (timeLeft1 - bytesLeft1 * t2) / (t0 - t2));\n long bytes2 = bytesLeft1 - bytes0;\n long k2 = (bytes2 + a2 - 1) / a2;\n\n long cost2 = k2 * p2;\n ans = Math.min(ans, cost1 + cost2);\n }\n return ans;\n }\n\n private long assertedNextInt() {\n long x = in.nextLong();\n if (x < 1 || x > (int) 1e7) {\n throw new AssertionError();\n }\n return x;\n }\n\n }\n\n static class FastScanner {\n private BufferedReader in;\n private StringTokenizer st;\n\n public FastScanner(InputStream stream) {\n in = new BufferedReader(new InputStreamReader(stream));\n }\n\n public String next() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(in.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return st.nextToken();\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["implementation", "binary search"], "code_uid": "02b410a09cf6cd0a7a31df378867c81b", "src_uid": "f5f85e75af5b0f25f1f436a21e12fad1", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class Main {\n\tprivate static Scanner in;\n\tprivate static PrintWriter out;\n\tprivate static final int MOD = (int)1e9 + 7;\n\t\n\tprivate static int n;\n\tprivate static int[] a, degIn;\n\tprivate static ArrayList<Integer> s, t;\n\tprivate static boolean[] visited;\n\tprivate static ArrayList<Integer>[] graph;\n\t\n\tprivate static boolean isSubset(int a, int b) {\n\t\treturn (a & b) == a;\n\t}\n\n\tprivate static boolean isIntersect(int a, int b) {\n\t\treturn (a & b) != 0;\n\t}\n\n\t// Solve for each weakly connected component (WCC)\n\tprivate static int cntOrder(ArrayList<Integer> s, ArrayList<Integer> t) {\n\t\tint p = s.size(), m = t.size();\n\n\t\tint[] inMask = new int[m];\n\t\tfor(int x = 0; x < p; ++x)\n\t\t\tfor(int i = 0; i < m; ++i)\n\t\t\t\tif (t.get(i) % s.get(x) == 0)\n\t\t\t\t\tinMask[i] |= 1 << x;\n\n\t\tint[] cnt = new int[1<<p];\n\t\tfor(int mask = 0; mask < (1<<p); ++mask)\n\t\t\tfor(int i = 0; i < m; ++i)\n\t\t\t\tif (isSubset(inMask[i], mask))\n\t\t\t\t\t++cnt[mask];\n\n\t\tint[][] dp = new int[m+1][1<<p];\n\t\tfor(int i = 0; i < m; ++i)\n\t\t\tdp[1][inMask[i]] += 1;\n\t\tfor(int k = 1; k < m; ++k) {\n\t\t\tfor(int mask = 0; mask < (1<<p); ++mask) {\n\t\t\t\tfor(int i = 0; i < m; ++i)\n\t\t\t\t\tif (!isSubset(inMask[i], mask) && isIntersect(inMask[i], mask))\n\t\t\t\t\t\tdp[k+1][mask | inMask[i]] = (int)((dp[k+1][mask | inMask[i]] + dp[k][mask]) % MOD);\n\t\t\t\tdp[k+1][mask] = (int)((dp[k+1][mask] + (long)dp[k][mask] * (cnt[mask] - k)) % MOD);\n\t\t\t}\n\t\t}\n\n\t\treturn dp[m][(1<<p)-1];\n\t}\n\n\tprivate static void dfs(int u) {\n\t\tvisited[u] = true;\n\t\tif (degIn[u] == 0)\n\t\t\ts.add(a[u]);\n\t\telse\n\t\t\tt.add(a[u]);\n\t\n\t\tfor(int v: graph[u])\n\t\t\tif (!visited[v])\n\t\t\t\tdfs(v);\n\t}\n\t\n\tprivate static void input() {\n\t\tn = in.nextInt();\n\t\ta = new int[n];\n\t\tfor(int u = 0; u < n; ++u)\n\t\t\ta[u] = in.nextInt();\n\t}\n\t\n\tprivate static void solve() {\n\t\t// Pre-calculate C(n, k)\n\t\tint[][] c = new int[n][n];\n\t\tfor(int i = 0; i < n; ++i) {\n\t\t\tc[i][0] = 1;\n\t\t\tfor(int j = 1; j <= i; ++j)\n\t\t\t\tc[i][j] = (c[i-1][j-1] + c[i-1][j]) % MOD;\n\t\t}\n\t\n\t\t// Building divisibility graph\n\t\tdegIn = new int[n];\n\t\tgraph = new ArrayList[n];\n\t\tfor(int u = 0; u < n; ++u)\n\t\t\tgraph[u] = new ArrayList<>();\n\t\tfor(int u = 0; u < n; ++u) {\n\t\t\tfor(int v = 0; v < n; ++v) {\n\t\t\t\tif (u != v && a[v] % a[u] == 0) {\n\t\t\t\t\tgraph[u].add(v);\n\t\t\t\t\tgraph[v].add(u);\n\t\t\t\t\t++degIn[v];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\n\t\t// Solve for each WCC of divisibility graph and combine result\n\t\tint ans = 1;\n\t\tint curLen = 0;\n\t\tvisited = new boolean[n];\n\t\tfor(int u = 0; u < n; ++u) {\n\t\t\tif (!visited[u]) {\n\t\t\t\ts = new ArrayList<>();\n\t\t\t\tt = new ArrayList<>();\n\t\t\t\tdfs(u);\n\t\n\t\t\t\tif (!t.isEmpty()) {\n\t\t\t\t\tint sz = t.size() - 1;\n\t\t\t\t\tint cnt = cntOrder(s, t);\n\t\n\t\t\t\t\t// Number of orders for current WCC\n\t\t\t\t\tans = (int)(((long)ans * cnt) % MOD);\n\t\t\t\t\t// Number of ways to insert <sz> number to array of <curLen> elements\n\t\t\t\t\tans = (int)(((long)ans * c[curLen + sz][sz]) % MOD);\n\t\t\t\t\tcurLen += sz;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\n\t\tout.println(ans);\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tin = new Scanner(System.in);\n\t\tout = new PrintWriter(System.out);\n\n\t\tinput();\n\t\tsolve();\n\n\t\tout.close();\n\t}\n}", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "bitmasks"], "code_uid": "8ded75a5ee3b2cc94fe50e1c7cfe7d85", "src_uid": "c8d43a60ddc0a7b98a7269dc3a2478dc", "difficulty": 3500.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\npublic class Solution\n{\n BufferedReader in;\n PrintWriter out;\n StringTokenizer ss;\n\nString _token()throws IOException\n{\n while (!ss.hasMoreTokens())ss=new StringTokenizer(in.readLine());\n return ss.nextToken();\n}\nint _int()throws IOException{return Integer.parseInt(_token());}\nlong _long()throws IOException{return Long.parseLong(_token());}\ndouble _double()throws IOException{return Double.parseDouble(_token());}\nvoid dbg(String s){System.out.println(s);}\n\nBigInteger ad(BigInteger A, BigInteger B){return (A.add(B));}\nBigInteger mu(BigInteger A, BigInteger B){return (A.multiply(B));}\nBigInteger su(BigInteger A, BigInteger B){return (A.subtract(B));}\nBigInteger di(BigInteger A, BigInteger B){return A.divide(B);}\nBigInteger mi(BigInteger A){return (BigInteger.ZERO).subtract(A);}\nBigInteger sq(BigInteger A){return (A.multiply(A));}\nBigInteger va(long a){return BigInteger.valueOf(a);}\n\nBigDecimal val(double a){return BigDecimal.valueOf(a);};\nBigDecimal mult(BigDecimal a, BigDecimal b){return a.multiply(b);}\nBigDecimal div(BigDecimal a, BigDecimal b){return a.divide(b,30,RoundingMode.CEILING);}\nBigDecimal add(BigDecimal a, BigDecimal b){return a.add(b);}\nBigDecimal sub(BigDecimal a, BigDecimal b){return a.subtract(b);}\n\n\nvoid RUN()throws IOException\n{\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n ss = new StringTokenizer(\" \"); \n\n//while (in.ready())\n//{ \n\n int a = _int();\n int b = _int();\n int n = _int();\n\n int maxa = (int)1e5+2;\n int maxb = 31;\n int w[][] = new int [maxa+1][maxb+1];\n\n w[1][maxb]=-1;\n w[maxa][1]=(n-maxa)%2;\n\n double eps=1e-8;\n\n for (int sum=maxa+maxb;sum>=0;sum--)\n {\n for (int j=1;j<maxb;j++)\n {\n int i = sum-j;\n if (i<1 || i>=maxa)\n continue;\n\n if (Math.abs(Math.log(i)*j-Math.log(n))>eps)\n {\n if (Math.log(i)*j>Math.log(n))\n {w[i][j]=0;\n continue;\n }\n }\n else\n if ((va(i).pow(j)).compareTo(va(n))>=0)\n {\n w[i][j]=0;\n continue;\n }\n \n if (i>1 && j>1)\n {\n if (w[i+1][j]==1 || w[i][j+1]==1)\n {\n w[i][j]=0;\n continue;\n }\n w[i][j]=1;\n continue;\n }\n int cu,cl;\n cu=w[i+1][j];\n cl=w[i][j+1];\n if (cu==1 || cl==1)\n {\n w[i][j]=0;\n continue;\n }\n if (cu==0 && cl==0)\n {\n w[i][j]=1;\n continue;\n }\n w[i][j]=-1;\n continue;\n }\n }\n \n if (w[a][b]!=-1)\n {\n if (w[a][b]==0)\n out.println(\"Masha\");\n else \n out.println(\"Stas\");\n }\n else \n out.println(\"Missing\");\n\n//}\n\n out.close();\n}\n\npublic static void main(String[] args)throws Exception\n {\n new Solution().RUN();\n }\n}", "lang_cluster": "Java", "tags": ["dp", "games"], "code_uid": "904498d3c23ba026d3a463f1d7366953", "src_uid": "cffd5c0b7b659649f3bf9f2dbd20ad6b", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Scanner;\n\n\npublic class E {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n int n = sc.nextInt();\n int sqrt_n = (int) Math.sqrt(n)+1;\n int log_n = (int) (Math.log(n)/Math.log(2))+1;\n if (b > log_n) {\n System.out.println(\"Missing\");\n return;\n }\n if (a > sqrt_n) {\n if ((n-a) % 2==0)\n System.out.println(\"Masha\");\n else\n System.out.println(\"Stas\");\n return;\n }\n int[][]dp = new int[sqrt_n+1][log_n+1];\n if ((n-sqrt_n) % 2==0)\n dp[sqrt_n][1] = 1;\n for (int i = 2; i <= log_n; i++) {\n dp[sqrt_n][i] = 1;\n }\n for (int i = sqrt_n-1; i >= 2; i--) {\n long pow = i;\n int h = 1;\n while (pow < n) {\n pow *= i;\n h++;\n }\n h--;\n for (int j = h+1; j <= log_n; j++) {\n dp[i][j] = 1;\n }\n for (int j = h; j >= 1; j--) {\n if (dp[i+1][j]==0 || dp[i][j+1]==0)\n dp[i][j] = 1;\n }\n }\n for (int i = log_n; i >= 1; i--) {\n if ((1 << (long)i) >= n)\n dp[1][i] = 2;\n else {\n if (dp[2][i]==1 && dp[1][i+1]==2)\n dp[1][i] = 2;\n else\n if (dp[2][i]==0 || dp[1][i+1]==0)\n dp[1][i] = 1;\n }\n }\n if (dp[a][b]==1)\n System.out.println(\"Masha\");\n else {\n if (dp[a][b]==0)\n System.out.println(\"Stas\");\n else\n System.out.println(\"Missing\");\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["dp", "games"], "code_uid": "4b5dc5429f07b83b2b3ba0f6594de635", "src_uid": "cffd5c0b7b659649f3bf9f2dbd20ad6b", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\npublic class Solution\n{\n BufferedReader in;\n PrintWriter out;\n StringTokenizer ss;//////////\nString _token()throws IOException\n{\n while (!ss.hasMoreTokens())ss=new StringTokenizer(in.readLine());\n return ss.nextToken();\n}\nint _int()throws IOException{return Integer.parseInt(_token());}\nlong _long()throws IOException{return Long.parseLong(_token());}\ndouble _double()throws IOException{return Double.parseDouble(_token());}\nvoid dbg(String s){System.out.println(s);}\n\nBigInteger ad(BigInteger A, BigInteger B){return (A.add(B));}\nBigInteger mu(BigInteger A, BigInteger B){return (A.multiply(B));}\nBigInteger su(BigInteger A, BigInteger B){return (A.subtract(B));}\nBigInteger di(BigInteger A, BigInteger B){return A.divide(B);}\nBigInteger mi(BigInteger A){return (BigInteger.ZERO).subtract(A);}\nBigInteger sq(BigInteger A){return (A.multiply(A));}\nBigInteger va(long a){return BigInteger.valueOf(a);}\n\nBigDecimal val(double a){return BigDecimal.valueOf(a);};\nBigDecimal mult(BigDecimal a, BigDecimal b){return a.multiply(b);}\nBigDecimal div(BigDecimal a, BigDecimal b){return a.divide(b,30,RoundingMode.CEILING);}\nBigDecimal add(BigDecimal a, BigDecimal b){return a.add(b);}\nBigDecimal sub(BigDecimal a, BigDecimal b){return a.subtract(b);}\n\n\nvoid RUN()throws IOException\n{\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n ss = new StringTokenizer(\" \"); \n\n//while (in.ready())\n//{ \n\n int a = _int();\n int b = _int();\n int n = _int();\n\n int maxa = (int)1e5+2;\n int maxb = 31;\n int w[][] = new int [maxa+1][maxb+1];\n\n w[1][maxb]=-1;\n w[maxa][1]=(n-maxa)%2;\n\n double eps=1e-8;\n\n for (int sum=maxa+maxb;sum>=0;sum--)\n {\n for (int j=1;j<maxb;j++)\n {\n int i = sum-j;\n if (i<1 || i>=maxa)\n continue;\n\n if (Math.abs(Math.log(i)*j-Math.log(n))>eps)\n {\n if (Math.log(i)*j>Math.log(n))\n {w[i][j]=0;\n continue;\n }\n }\n else\n if ((va(i).pow(j)).compareTo(va(n))>=0)\n {\n w[i][j]=0;\n continue;\n }\n \n if (i>1 && j>1)\n {\n if (w[i+1][j]==1 || w[i][j+1]==1)\n {\n w[i][j]=0;\n continue;\n }\n w[i][j]=1;\n continue;\n }\n int cu,cl;\n cu=w[i+1][j];\n cl=w[i][j+1];\n if (cu==1 || cl==1)\n {\n w[i][j]=0;\n continue;\n }\n if (cu==0 && cl==0)\n {\n w[i][j]=1;\n continue;\n }\n w[i][j]=-1;\n continue;\n }\n }\n \n if (w[a][b]!=-1)\n {\n if (w[a][b]==0)\n out.println(\"Masha\");\n else \n out.println(\"Stas\");\n }\n else \n out.println(\"Missing\");\n\n//}\n\n out.close();\n}\n\npublic static void main(String[] args)throws Exception\n {\n new Solution().RUN();\n }\n}", "lang_cluster": "Java", "tags": ["dp", "games"], "code_uid": "ceca044b7581b9244afb7b23af108c76", "src_uid": "cffd5c0b7b659649f3bf9f2dbd20ad6b", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class E implements Runnable {\n\tpublic static void main (String[] args) {new Thread(null, new E(), \"_cf\", 1 << 28).start();}\n\t\n\tint n;\n\tint MAX = 51;\n\tHashMap<Integer, Integer>[] dp;\n\t\n\tpublic void run() {\n\t\tFastScanner fs = new FastScanner();\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tSystem.err.println(\"Go!\");\n\t\t\n\n\t\tint a = fs.nextInt(), b = fs.nextInt();\n\t\tn = fs.nextInt();\n\t\t\n\t\tdp = new HashMap[MAX];\n\t\tfor(int i = 0; i < MAX; i++) dp[i] = new HashMap<Integer, Integer>();\n\t\t\n\t\tint ret = solve(b, a);\n\t\tif(ret == 1) System.out.println(\"Masha\");\n\t\telse if(ret == 0) System.out.println(\"Missing\");\n\t\telse System.out.println(\"Stas\");\n\t\t\n\t\tout.close();\n\t}\n\t\n\t//returns -1 if whoever is playing here loses\n\t//returns 1 otherwise\n\tint solve(int a, int b) {\n\t\tif(a >= MAX) { //draw\n\t\t\treturn 0;\n\t\t}\n\t\tif(b >= 32000) {\n\t\t\tint moves = (n-1)-b;\n\t\t\tif(moves % 2 == 1) {\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\t\n\t\t\treturn -1;\n\t\t}\n\t\tif(dp[a].containsKey(b)) return dp[a].get(b);\n//\t\tSystem.out.printf(\"Items %d Boxes: %d\\n\", a, b);\n\t\t\n\t\tboolean canDraw = false;\n\t\tif(!isBad(a, b + 1)) { //increase number of boxes\n\t\t\tint ret = solve(a, b + 1);\n\t\t\tif(ret == -1) { //i win\n\t\t\t\tdp[a].put(b, 1);\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\tcanDraw |= ret == 0;\n\t\t}\n\t\t\n\t\tif(!isBad(a + 1, b)) { //increase number of items\n\t\t\tint ret = solve(a + 1, b);\n\t\t\tif(ret == -1) {\n\t\t\t\tdp[a].put(b, 1);\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\tcanDraw |= ret == 0;\n\t\t}\n\t\t\n\t\tint ret = -1;\n\t\tif(canDraw) ret = 0;\n\t\t\n\t\tdp[a].put(b, ret);\n\t\treturn ret;\n\t}\n\t\n\tboolean isBad(int a, int b) {\n\t\tdouble one = a * Math.log(b);\n\t\tdouble two = Math.log(n);\n\t\treturn one > two || Math.abs(one-two) < 1e-9;\n\t}\n\t\n\tclass FastScanner {\n\t\tpublic int BS = 1<<16;\n\t\tpublic char NC = (char)0;\n\t\tbyte[] buf = new byte[BS];\n\t\tint bId = 0, size = 0;\n\t\tchar c = NC;\n\t\tdouble num = 1;\n\t\tBufferedInputStream in;\n\n\t\tpublic FastScanner() {\n\t\t\tin = new BufferedInputStream(System.in, BS);\n\t\t}\n\n\t\tpublic FastScanner(String s) throws FileNotFoundException {\n\t\t\tin = new BufferedInputStream(new FileInputStream(new File(s)), BS);\n\t\t}\n\n\t\tpublic char nextChar(){\n\t\t\twhile(bId==size) {\n\t\t\t\ttry {\n\t\t\t\t\tsize = in.read(buf);\n\t\t\t\t}catch(Exception e) {\n\t\t\t\t\treturn NC;\n\t\t\t\t} \n\t\t\t\tif(size==-1)return NC;\n\t\t\t\tbId=0;\n\t\t\t}\n\t\t\treturn (char)buf[bId++];\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn (int)nextLong();\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\tnum=1;\n\t\t\tboolean neg = false;\n\t\t\tif(c==NC)c=nextChar();\n\t\t\tfor(;(c<'0' || c>'9'); c = nextChar()) {\n\t\t\t\tif(c=='-')neg=true;\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tfor(; c>='0' && c <='9'; c=nextChar()) {\n\t\t\t\tres = (res<<3)+(res<<1)+c-'0';\n\t\t\t\tnum*=10;\n\t\t\t}\n\t\t\treturn neg?-res:res;\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\tdouble cur = nextLong();\n\t\t\treturn c!='.' ? cur:cur+nextLong()/num;\n\t\t}\n\n\t\tpublic String next() {\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\twhile(c<=32)c=nextChar();\n\t\t\twhile(c>32) {\n\t\t\t\tres.append(c);\n\t\t\t\tc=nextChar();\n\t\t\t}\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tpublic String nextLine() {\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\twhile(c<=32)c=nextChar();\n\t\t\twhile(c!='\\n') {\n\t\t\t\tres.append(c);\n\t\t\t\tc=nextChar();\n\t\t\t}\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tpublic boolean hasNext() {\n\t\t\tif(c>32)return true;\n\t\t\twhile(true) {\n\t\t\t\tc=nextChar();\n\t\t\t\tif(c==NC)return false;\n\t\t\t\telse if(c>32)return true;\n\t\t\t}\n\t\t}\n\t\t\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] res = new int[n];\n\t\t\tfor(int i = 0; i < n; i++) res[i] = nextInt();\n\t\t\treturn res;\n\t\t}\n\t\t\n\t}\n\n\t\n}", "lang_cluster": "Java", "tags": ["dp", "games"], "code_uid": "19bc2d69bbef3e45a5d26018afde48d3", "src_uid": "cffd5c0b7b659649f3bf9f2dbd20ad6b", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "//package school1;\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.io.StreamTokenizer;\n\npublic class E {\n\n\tstatic StreamTokenizer in =\n\t\tnew StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));\n\t\n\tstatic int nextInt() throws IOException{\n\t\tin.nextToken();\n\t\treturn (int)in.nval;\n\t}\n\t\n\tstatic PrintWriter out = new PrintWriter(System.out);\n\t\n\tpublic static void main(String[] args) throws IOException{\n\t\tint a = nextInt(),\n\t\t\tb = nextInt(),\n\t\t\tn = nextInt();\n\t\t\n\t\tif (a==1 && Math.pow(2, b)>=n){\n\t\t\tout.println(\"Missing\");\n\t\t\tout.flush();\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tint B[] = new int[100];\n\t\tB[1] = n-1;\n\t\tint p = (int)Math.sqrt(n);\n\t\tif (p*p == n)\n\t\t\tp--;\n\t\tB[2] = p;\n\t\tfor (int i=3; i<=30; i++)\n\t\t\tfor (int j=p; j>=2; j--)\n\t\t\t\tif (Math.pow(j, i) < n){\n\t\t\t\t\tB[i] = j;\n\t\t\t\t\tp = j;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\n\t\tint x = 1000000000,\n\t\t\ty = 1000000000;\n\t\tfor (int i=b; i<=30; i++)\n\t\t\tif (B[i]!=B[i+1] && B[i]>=a){\n\t\t\t\tif (i-b == B[i]-a){\n\t\t\t\t\tout.println(\"Stas\");\n\t\t\t\t\tout.flush();\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tif (i-b > B[i]-a)\n\t\t\t\t\t\tx = Math.min(x, i-b-(B[i]-a));\n\t\t\t\t\telse\n\t\t\t\t\t\ty = Math.min(y, B[i]-a-(i-b));\n\t\t\t\t}\n\t\t\t}\n\t\t\n\t\tif (x%2==0 && y%2==0){\n\t\t\tout.println(\"Stas\");\n\t\t\tout.flush();\n\t\t\treturn;\n\t\t}\n\t\telse if (x%2==1 && y%2==1){\n\t\t\tout.println(\"Masha\");\n\t\t\tout.flush();\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tint u = a, v = b;\n\t\twhile (Math.pow(u, v) < n){\n\t\t\tu++;\n\t\t\tv++;\n\t\t}\n\t\t\n\t\tu--;\n\t\tv--;\n\t\tif (x%2==1 && Math.pow(u, v+1)<n || y%2==1 && Math.pow(u+1, v)<n){\n\t\t\tout.println(\"Masha\");\n\t\t\tout.flush();\n\t\t\treturn;\n\t\t}\n\t\telse{\n\t\t\tout.println(\"Stas\");\n\t\t\tout.flush();\n\t\t\treturn;\n\t\t}\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["dp", "games"], "code_uid": "d946c018e0b4cead7254883c02b7164e", "src_uid": "cffd5c0b7b659649f3bf9f2dbd20ad6b", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.util.Scanner;\n\npublic class Sh1E {\n\n static final int N = 35000, M = 33;\n static Scanner in;\n static int n, a, b;\n static boolean[][] game = new boolean[N][M];\n\n public static void main(String[] args) {\n in = new Scanner(System.in);\n a = in.nextInt();\n b = in.nextInt();\n n = in.nextInt();\n long pow;\n for (int i = 2; i < N; ++i) {\n pow = (long) i * (long) i;\n for (int j = 2; j < M; ++j) {\n if (pow >= n) {\n game[i][j] = true;\n } else {\n pow *= (long) i;\n }\n }\n }\n game[N - 1][1] = true;\n if (n % 2 == 0)\n game[N - 2][1] = true;\n for (int j = M - 2; j >= 1; --j)\n for (int i = N - 2; i >= 2; --i)\n if (!game[i][j]) {\n if (!game[i + 1][j] || !game[i][j + 1])\n game[i][j] = true;\n }\n if (a == 1) {\n for (int i = b; i < M; ++i)\n if (!game[2][i]) {\n if ((i - b) % 2 == 0)\n System.out.println(\"Masha\");\n else \n System.out.println(\"Stas\");\n return;\n }\n //if (!game[2][b])\n // System.out.println(\"Masha\");\n //else if (!game[2][b + 1])\n // System.out.println(\"Stas\");\n //else\n System.out.println(\"Missing\");\n } else {\n if (game[a][b])\n System.out.println(\"Masha\");\n else\n System.out.println(\"Stas\");\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["dp", "games"], "code_uid": "9741d4874f80503fd8b9ae76ab411984", "src_uid": "cffd5c0b7b659649f3bf9f2dbd20ad6b", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 6", "source_code": "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\nimport static java.lang.Math.*;\n\npublic class Main implements Runnable {\n BufferedReader in;\n PrintWriter out;\n StringTokenizer st;\n\n int a, b, n;\n\n int[][] dp;\n BigInteger need;\n\n int rec(int item, int box) {\n if (item >= 50)\n return 1;\n if (box >= 35000)\n return 1;\n int ret = dp[item][box];\n if (ret == -1) {\n BigInteger a = BigInteger.valueOf(box).pow(item);\n if (a.compareTo(need) >= 0)\n ret = 0;\n else {\n ret = 100;\n ret = min(ret, rec(item, box + 1));\n ret = min(ret, rec(item + 1, box));\n }\n if (ret == 0)\n ret = 1;\n else\n ret = 0;\n dp[item][box] = ret;\n }\n return ret;\n }\n\n void solve() throws IOException {\n a = ni();\n b = ni();\n n = ni();\n if (a == 1 && (1 << b) >= n) {\n out.println(\"Missing\");\n return;\n }\n dp = new int[50][35000];\n for (int i = 0; i < dp.length; i++) {\n Arrays.fill(dp[i], -1);\n }\n need = BigInteger.valueOf(n);\n int ret = rec(b, a);\n if (ret == 1)\n out.println(\"Masha\");\n else\n out.println(\"Stas\");\n }\n\n public Main() throws IOException {\n\n }\n\n String ns() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(in.readLine());\n }\n return st.nextToken();\n }\n\n int ni() throws IOException {\n return Integer.valueOf(ns());\n }\n\n long nl() throws IOException {\n return Long.valueOf(ns());\n }\n\n double nd() throws IOException {\n return Double.valueOf(ns());\n }\n\n public static void main(String[] args) throws IOException,\n InterruptedException {\n Thread th = new Thread(null, new Main(), \"Main\", 67108864);\n th.start();\n th.join();\n if (failed)\n throw new RuntimeException();\n }\n\n static boolean failed = false;\n\n @Override\n public void run() {\n Locale.setDefault(Locale.US);\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n try {\n solve();\n in.close();\n out.close();\n } catch (IOException e) {\n failed = true;\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["dp", "games"], "code_uid": "ac784e3f79bea95c30f8356e164d52d7", "src_uid": "cffd5c0b7b659649f3bf9f2dbd20ad6b", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 17", "source_code": "import java.util.*;\r\nimport java.util.function.*;\r\nimport java.io.*;\r\n\r\n// you can compare with output.txt and expected out\r\npublic class RoundEdu132F {\t\r\n\tMyPrintWriter out;\r\n\tMyScanner in;\r\n\t\r\n//\tfinal static long FIXED_RANDOM;\r\n//\tstatic {\r\n//\t\tFIXED_RANDOM = System.currentTimeMillis();\r\n//\t}\r\n\tfinal static String IMPOSSIBLE = \"IMPOSSIBLE\";\r\n\tfinal static String POSSIBLE = \"POSSIBLE\";\r\n\tfinal static String YES = \"YES\";\r\n\tfinal static String NO = \"NO\";\r\n\t\r\n private void initIO(boolean isFileIO) {\r\n if (System.getProperty(\"ONLINE_JUDGE\") == null && isFileIO) {\r\n \ttry{\r\n\t in = new MyScanner(new FileInputStream(\"input.txt\"));\r\n\t out = new MyPrintWriter(new FileOutputStream(\"output.txt\"));\r\n \t}\r\n \tcatch(FileNotFoundException e){\r\n \t\te.printStackTrace();\r\n \t}\r\n }\r\n else{\r\n \t\tin = new MyScanner(System.in);\r\n \t out = new MyPrintWriter(new BufferedOutputStream(System.out));\r\n }\r\n }\r\n\t\r\n\tpublic static void main(String[] args){\r\n//\t\tScanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));\r\n\t\t\r\n\t\tRoundEdu132F sol = new RoundEdu132F();\r\n\t\tsol.run();\r\n }\r\n\t\r\n\tprivate void run() {\r\n\t\tboolean isDebug = false;\r\n\t\tboolean isFileIO = true;\r\n\t\tboolean hasMultipleTests = false;\r\n\t\t\r\n\t\tinitIO(isFileIO);\r\n\t\t\r\n\t\t//test();\r\n\t\r\n\t\tint t = hasMultipleTests? in.nextInt() : 1;\r\n\t \r\n\t for (int i = 1; i <= t; ++i) {\r\n\t \tif(isDebug){\r\n\t\t \tout.printf(\"Test %d\\n\", i);\r\n\t \t}\r\n\r\n\t \tgetInput();\r\n\r\n\t \tans = solve();\r\n\t \t\r\n\t \tprintOutput();\r\n\t }\r\n\t \r\n\t in.close();\r\n\t out.close();\r\n\t}\r\n\t\r\n\tprivate void test() {\r\n\t\t\r\n\t\tlong[] poly = {1, 1, 0, 0};\r\n\t\tsquare(poly);\r\n\t\t\r\n\t\tpoly = poly;\r\n\t\t\r\n\t\t\r\n\t\tlong[] poly2 = {1, 1, 1, 1, 0, 0, 0, 0};\r\n\t\tsquare(poly2);\r\n\t\t\r\n\t\tpoly2 = poly2;\r\n\t\t\r\n\t}\r\n\r\n\tint n, k, f;\r\n\tvoid getInput() {\r\n\t\tn = in.nextInt(); \r\n\t\tk = in.nextInt();\r\n\t\tf = in.nextInt();\r\n\t}\r\n\t\r\n\tvoid printOutput() {\r\n\t\tout.printlnAns(ans);\r\n\t}\r\n\t\r\n\tstatic final long MOD = 998244353;\r\n\tint ans;\r\n\tint solve(){\r\n\t\tlong ans = 0;\r\n\t\t\r\n\t\t// for each binary string s,\r\n\t\t// consider binary strings t of length n, where s is a prefix of t\r\n\t\t// we can have <= c_s among t\r\n\t\t\r\n\t\t// it's a full binary tree\r\n\t\t// where each vertex contains # of records in its subtree\r\n\t\t// and all records are at depth n\r\n\t\t\r\n\t\t// from each leaf, go up again, update each vertex to min(val, val(child1) + val(child2))\r\n\t\t// then the val(root) must be exactly f\r\n\t\t// where root is null string\r\n\r\n\t\t// the problem in this counting is we would have to use inclusion-exclusion due to duplicate cases\r\n\t\t// so we choose vertices representing disjoint subtrees\r\n\t\t// whose union can represent the whole tree\r\n\t\t// and whose sum is exactly f\r\n\t\t\r\n\t\t// for vertices under the subtrees, we can freely choose val\r\n\t\t// so that sum of siblings in each subtree >= val of root of subtree \r\n\t\t// for vertices above the subtrees, we can freely choose val between sum and k\r\n\r\n\t\t\r\n\t\t// so another approach:\r\n\t\t// for each vertex v of depth h\r\n\t\t// find # of ways to make sum exactly x\r\n\t\t// case 1: val(v) = x\r\n\t\t// add up ways(l, y)*ways(r, z) where y+z >= x\r\n\t\t// case 2: val(v) >= x+1\r\n\t\t// add up ways(l, y)*ways(r, z) where y+z = x\r\n\t\t\r\n\t\t// 2 1 1\r\n\t\t// case 1: c_0 = 1, c_1 = 0\r\n\t\t// 00 01 10 11\r\n\t\t// 1 0 0/1 0/1\r\n\t\t// 0 1 0/1 0/1\r\n\t\t// 1 1 0/1 0/1\r\n\t\t// -> 12\r\n\t\t\r\n\t\t// case 2: c_0 = 0, c_1 = 1\r\n\t\t// -> 12\r\n\t\t\r\n\t\t// case 3: c_0 = 1, c_1 = 1\r\n\t\t// 1 0 0 0\r\n\t\t// 0 1 0 0\r\n\t\t// 1 1 0 0\r\n\t\t// 0 0 1 0\r\n\t\t// 0 0 0 1\r\n\t\t// 0 0 1 1\r\n\t\t// -> 6\r\n\t\t\r\n\t\t// subtree_0 = 1 -> 3\r\n\t\t// c_0 = 1 -> 1 0, 0 1, 1 1\r\n\t\t\r\n\t\t// subtree_0 = 0 -> 5\r\n\t\t// c_0 = 0 -> 0/1, 0/1 -> 4\r\n\t\t// c_0 = 1 -> 0, 0 -> 1\r\n\t\t// 3*5 + 3*5 = 30\r\n\t\t\r\n\t\t// subtree_l = 0 -> 1 \r\n\t\t// subtree_l = 1 -> 1\r\n\t\t\r\n\t\t// long[] ways = new long[f+2];\r\n\t\tint len = 1;\r\n\t\twhile (len < f+2 + f+2) \r\n\t len <<= 1;\r\n\t\tlong[] ways = new long[len];\r\n\t\tlong[] suffix = new long[f+2];\r\n\t\t\r\n\t\tfor(int i=0; i<=k && i<=f; i++)\r\n\t\t\tways[i] = 1;\r\n\t\tways[f+1] = Math.max(0, k-f);\r\n\t\t\r\n//\t\tlong[] ways2 = Arrays.copyOf(ways, f+2);\r\n\t\t\r\n\t\tfor(int i=0; i<n; i++) {\r\n\t\t\tif(i < n-1) {\r\n\t\t\t\tsquare(ways);\r\n\t\t\t\t{\r\n\t\t\t\t\tlong val = 0;\r\n\t\t\t\t\tfor(int j=ways.length-1; j>=f+1; j--)\r\n\t\t\t\t\t\tval += ways[j];\r\n\t\t\t\t\tval %= MOD;\r\n\t\t\t\t\tsuffix[f+1] = val;\r\n\t\t\t\t}\r\n\t\t\t\tfor(int j=f; j>=0; j--){\r\n\t\t\t\t\tlong val = suffix[j+1] + ways[j];\r\n\t\t\t\t\tval = val>=MOD? val-MOD: val;\r\n\t\t\t\t\tsuffix[j] = val;\r\n\t\t\t\t}\r\n\t\t\t\r\n\t\t\t\tfor(int j=0; j <= k && j<=f; j++) {\r\n\t\t\t\t\tlong val = suffix[j]; // c_curr = j\r\n\t\t\t\t\tval += ways[j]*(k-j); // j+1 ~ k\r\n\t\t\t\t\tval %= MOD;\r\n\t\t\t\t\tways[j] = val;\r\n\t\t\t\t}\r\n\t\t\t\t{\r\n\t\t\t\t\tlong val = suffix[f+1]*Math.max(0, k-f);\r\n\t\t\t\t\tval %= MOD;\r\n\t\t\t\t\tways[f+1] = val;\r\n\t\t\t\t}\r\n\t\t\t\tfor(int j=k+1; j<f+2; j++)\r\n\t\t\t\t\tways[j] = 0;\r\n\t\t\t\tArrays.fill(ways, f+2, ways.length, 0);\r\n\t\t\t\t\r\n//\t\t\t\tlong[] mult = multiplyPolynomial(ways2, ways2);\r\n//\t\t\t\t{\r\n//\t\t\t\t\tlong val = 0;\r\n//\t\t\t\t\tfor(int j=mult.length-1; j>=f+1; j--)\r\n//\t\t\t\t\t\tval += mult[j];\r\n//\t\t\t\t\tval %= MOD;\r\n//\t\t\t\t\tsuffix[f+1] = val;\r\n//\t\t\t\t}\r\n//\t\t\t\tfor(int j=f; j>=0; j--){\r\n//\t\t\t\t\tlong val = suffix[j+1] + mult[j];\r\n//\t\t\t\t\tval = val>=MOD? val-MOD: val;\r\n//\t\t\t\t\tsuffix[j] = val;\r\n//\t\t\t\t}\r\n//\t\t\t\tif(i < n-1) {\r\n//\t\t\t\t\tfor(int j=0; j <= k && j<=f; j++) {\r\n//\t\t\t\t\t\tlong val = suffix[j]; // c_curr = j\r\n//\t\t\t\t\t\tval += mult[j]*(k-j); // j+1 ~ k\r\n//\t\t\t\t\t\tval %= MOD;\r\n//\t\t\t\t\t\tways2[j] = val;\r\n//\t\t\t\t\t}\r\n//\t\t\t\t\t{\r\n//\t\t\t\t\t\tlong val = suffix[f+1]*Math.max(0, k-f);\r\n//\t\t\t\t\t\tval %= MOD;\r\n//\t\t\t\t\t\tways2[f+1] = val;\r\n//\t\t\t\t\t}\r\n//\t\t\t\t}\r\n//\t\t\t\tif(!Arrays.equals(Arrays.copyOf(ways, f+2), ways2)) {\r\n//\t\t\t\t\tfor(int j=0; j<f+2; j++)\r\n//\t\t\t\t\t\tif(ways[j] != ways2[j])\r\n//\t\t\t\t\t\t\tways = ways;\r\n//\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse {\r\n\t\t\t\tfor(int j=0; j<=f; j++)\r\n\t\t\t\t\tans += ways[j]*ways[f-j] % MOD;\r\n\t\t\t\tans %= MOD;\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t\treturn (int)ans;\r\n\t}\r\n\t\r\n\tstatic long pow(int a, int k, long p) {\r\n\t\tlong m = k;\r\n\t\tlong ans = 1;\r\n\r\n\t\t// curr = k^(2^i)\r\n\t\tlong curr = a;\r\n\r\n\t\t// k^(2x+1) = (k^x)^2 * k\r\n\t\twhile(m > 0) {\r\n\t\t\tif( (m&1) == 1 ) {\r\n\t\t\t\tans *= curr;\r\n\t\t\t\tans %= p;\r\n\t\t\t}\r\n\t\t\tm >>= 1;\r\n\t\t\tcurr *= curr;\r\n\t\t\tcurr %= p;\r\n\t\t}\r\n\t\treturn ans;\t\t\r\n\t}\r\n\t\r\n\t// computes a^(p-2)\r\n\tstatic long inverse(int a, long p) {\r\n\t\treturn pow(a, (int)(p-2), p);\r\n\t}\r\n\t\r\n\t// static final long MOD = 998_244_353; // = 1 + 7*17*2^23\r\n\t// primitive root is 3, i.e., the order of 3 is MOD-1\r\n\t// we have to find the 1<<23-th root\r\n\tstatic final int ROOT = (int) pow(3, 7*17, MOD);\r\n\tstatic final int ROOT_INV = (int) pow(ROOT, (int)MOD - 2, MOD);\r\n\tstatic final int ORDER = 1 << 23;\r\n\tstatic final long W4 = pow(ROOT, (int)(MOD-1)/4, MOD);\r\n\tstatic final long W4_INV = pow(ROOT, (int)(MOD-1)/4*3, MOD);\r\n\r\n\tstatic void swap(long[] a, int i, int j) {\r\n\t\tlong temp = a[i];\r\n\t\ta[i] = a[j];\r\n\t\ta[j] = temp;\r\n\t}\r\n\tstatic void fft(long[] a, boolean isInvertedFFT) {\r\n\t int n = a.length;\r\n\r\n\t for (int i = 1, j = 0; i < n; i++) {\r\n\t int bit = n >> 1;\r\n\t for (; (j & bit) > 0; bit >>= 1)\r\n\t j ^= bit;\r\n\t j ^= bit;\r\n\r\n\t if (i < j) {\r\n\t \tswap(a, i, j);\r\n\t }\r\n\t }\r\n\r\n\t for (int len = 2; len <= n; len <<= 1) {\r\n\t long wlen = isInvertedFFT ? ROOT_INV : ROOT;\r\n\t for (int i = len; i < ORDER; i <<= 1)\r\n\t wlen = wlen * wlen % MOD;\r\n\r\n\t for (int i = 0; i < n; i += len) {\r\n\t \tlong w = 1;\r\n\t for (int j = 0; j < len / 2; j++) {\r\n\t long u = a[i+j];\r\n\t long v = a[i+j+len/2] * w % MOD;\r\n\t a[i+j] = u + v < MOD ? u + v : u + v - MOD;\r\n\t a[i+j+len/2] = u - v >= 0 ? u - v : u - v + MOD;\r\n\t w = w * wlen % MOD;\r\n\t }\r\n\t }\r\n\t }\r\n\r\n\t if (isInvertedFFT) {\r\n\t long inv = inverse(n, MOD);\r\n\t for(int i=0; i<a.length; i++)\r\n\t \ta[i] = a[i]*inv%MOD;\r\n\t }\r\n\t}\r\n\t\r\n\tstatic void fft4(long[] a, boolean isInvertedFFT) {\r\n\t\tint n = a.length;\r\n\t\t\r\n\t for (int i = 1, j = 0; i < n; i++) {\r\n\t int bit = n >> 1;\r\n\t for (; (j & bit) > 0; bit >>= 1)\r\n\t j ^= bit;\r\n\t j ^= bit;\r\n\r\n\t if (i < j) {\r\n\t \tswap(a, i, j);\r\n\t }\r\n\t }\r\n\t\t\r\n\t\tint parity = 0;\r\n\t for (int len = 2; len <= n; len <<= 1)\r\n\t \tparity++;\r\n\t \r\n\t int len;\r\n\t if(parity % 2 == 1) {\r\n\t \tlen = 2;\r\n\t\t if(len <= n) {\r\n\t\t long wlen = isInvertedFFT ? ROOT_INV : ROOT;\r\n\t\t for (int i = len; i < ORDER; i <<= 1)\r\n\t\t wlen = wlen * wlen % MOD;\r\n\r\n\t\t for (int i = 0; i < n; i += len) {\r\n\t\t \tlong w = 1;\r\n\t\t for (int j = 0; j < len / 2; j++) {\r\n\t\t long u = a[i+j];\r\n\t\t long v = a[i+j+len/2] * w % MOD;\r\n\t\t a[i+j] = u + v < MOD ? u + v : u + v - MOD;\r\n\t\t a[i+j+len/2] = u - v >= 0 ? u - v : u - v + MOD;\r\n\t\t w = w * wlen % MOD;\r\n\t\t }\r\n\t\t }\r\n\t\t len *= 4;\r\n\t\t }\r\n\t }\r\n\t else\r\n\t \tlen = 4;\r\n\r\n\t \r\n\t for (; len <= n; len <<= 2) {\r\n\t long wlen = isInvertedFFT ? ROOT_INV : ROOT;\r\n\t long w4 = isInvertedFFT? W4_INV: W4;\r\n\t for (int i = len; i < ORDER; i <<= 1)\r\n\t wlen = wlen * wlen % MOD;\r\n\r\n\t for (int i = 0; i < n; i += len) {\r\n\t \tlong w = 1;\r\n\t for (int j = 0; j < len / 4; j++) {\r\n\t \tlong x0 = a[i+j];\r\n\t \tlong x1 = a[i+j+len/2] * w % MOD;\r\n\t \tlong x2 = a[i+j+len/4] * w % MOD;\r\n\t \tx2 = x2 * w % MOD;\r\n\t \tlong x3 = a[i+j+len*3/4] * w % MOD;\r\n\t \tx3 = x3 * w % MOD;\r\n\t \tx3 = x3 * w % MOD;\r\n\t \t\r\n\t \tlong y0 = x0 + x1 + x2 + x3;\r\n\t \ta[i+j] = y0 % MOD;\r\n\t \tlong y1 = x0 + x1*w4 - x2 - x3*w4;\r\n\t \ty1 %= MOD;\r\n\t \ta[i+j+len*3/4] = y1 < 0? y1 + MOD: y1;\r\n\t \tlong y2 = x0 - x1 + x2 - x3;\r\n\t \ty2 %= MOD;\r\n\t \ta[i+j+len/2] = y2 < 0? y2 + MOD: y2;\r\n\t \tlong y3 = x0 - x1*w4 - x2 + x3*w4;\r\n\t \ty3 %= MOD;\r\n\t \ta[i+j+len/4] = y3 < 0? y3 + MOD: y3;\r\n\t \t\r\n\t \tw = w * wlen % MOD;\r\n\t }\r\n\t }\r\n\t }\r\n\r\n\t if (isInvertedFFT) {\r\n\t long inv = inverse(n, MOD);\r\n\t for(int i=0; i<a.length; i++)\r\n\t \ta[i] = a[i]*inv%MOD;\r\n\t }\r\n\t}\r\n\t\r\n\tstatic void square(long[] a) {\r\n\t fft4(a, false);\r\n\t for (int i = 0; i < a.length; i++)\r\n\t a[i] = a[i]*a[i] % MOD;\r\n\t fft4(a, true);\r\n\t}\r\n\t\r\n\tstatic long[] multiplyPolynomial(long[] a, long[] b) {\r\n\t int n = 1;\r\n\t while (n < a.length + b.length) \r\n\t n <<= 1;\r\n\t\tlong[] fa = Arrays.copyOf(a, n);\r\n\t\tlong[] fb = Arrays.copyOf(b, n);\r\n\r\n\t fft(fa, false);\r\n\t fft(fb, false);\r\n\t for (int i = 0; i < n; i++)\r\n\t fa[i] = fa[i]*fb[i] % MOD;\r\n\t fft(fa, true);\r\n\t \r\n\t return fa;\r\n\t}\r\n\t\r\n\tpublic static class MyScanner {\r\n\t\tBufferedReader br;\r\n\t\tStringTokenizer st;\r\n\r\n\t\t// 32768?\r\n\t\tpublic MyScanner(InputStream is, int bufferSize) {\r\n\t\t\tbr = new BufferedReader(new InputStreamReader(is), bufferSize);\r\n\t\t}\r\n\t\t\r\n\t\tpublic MyScanner(InputStream is) {\r\n\t\t\tbr = new BufferedReader(new InputStreamReader(is));\r\n\t\t\t// br = new BufferedReader(new InputStreamReader(System.in));\r\n\t\t\t// br = new BufferedReader(new InputStreamReader(new FileInputStream(\"input.txt\")));\r\n\t\t}\r\n\r\n\t\tpublic void close() {\r\n\t\t\ttry {\r\n\t\t\t\tbr.close();\r\n\t\t\t} catch (IOException e) {\r\n\t\t\t\te.printStackTrace();\r\n\t\t\t}\r\n\r\n\t\t}\r\n\r\n\t\tString next() {\r\n\t\t\twhile (st == null || !st.hasMoreElements()) {\r\n\t\t\t\ttry {\r\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\r\n\t\t\t\t} catch (IOException e) {\r\n\t\t\t\t\te.printStackTrace();\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\treturn st.nextToken();\r\n\t\t}\r\n\r\n\t\tint nextInt() {\r\n\t\t\treturn Integer.parseInt(next());\r\n\t\t}\r\n\r\n\t\tlong nextLong() {\r\n\t\t\treturn Long.parseLong(next());\r\n\t\t}\r\n\r\n\t\tdouble nextDouble() {\r\n\t\t\treturn Double.parseDouble(next());\r\n\t\t}\r\n\r\n\t\tString nextLine(){\r\n\t\t\tString str = \"\";\r\n\t\t\ttry {\r\n\t\t\t\tstr = br.readLine();\r\n\t\t\t} catch (IOException e) {\r\n\t\t\t\te.printStackTrace();\r\n\t\t\t}\r\n\t\t\treturn str;\r\n\t\t}\r\n\t\t\r\n\t\tint[][] nextTreeEdges(int n, int offset){\r\n\t\t\tint[][] e = new int[n-1][2];\r\n\t\t\tfor(int i=0; i<n-1; i++){\r\n\t\t\t\te[i][0] = nextInt()+offset;\r\n\t\t\t\te[i][1] = nextInt()+offset;\r\n\t\t\t}\r\n\t\t\treturn e;\t\t\t\r\n\t\t}\r\n\t\t\r\n\t\tint[][] nextMatrix(int n, int m) {\r\n\t\t\treturn nextMatrix(n, m, 0);\r\n\t\t}\r\n\t\t\r\n\t\tint[][] nextMatrix(int n, int m, int offset) {\r\n\t\t\tint[][] mat = new int[n][m];\r\n\t\t\tfor(int i=0; i<n; i++) {\r\n\t\t\t\tfor(int j=0; j<m; j++) {\r\n\t\t\t\t\tmat[i][j] = nextInt()+offset;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\treturn mat;\r\n\t\t}\r\n\t\t\r\n\t\tint[][] nextPairs(int n){\r\n\t\t\treturn nextPairs(n, 0);\r\n\t\t}\r\n\t\t\r\n\t\tint[][] nextPairs(int n, int offset) {\r\n\t\t\tint[][] xy = new int[2][n];\r\n\t\t\tfor(int i=0; i<n; i++) {\r\n\t\t\t\txy[0][i] = nextInt() + offset;\r\n\t\t\t\txy[1][i] = nextInt() + offset;\r\n\t\t\t}\r\n\t\t\treturn xy;\r\n\t\t}\r\n\r\n\t\tint[][] nextGraphEdges(){\r\n\t\t\treturn nextGraphEdges(0);\r\n\t\t}\r\n\t\t\r\n\t\tint[][] nextGraphEdges(int offset) {\r\n\t\t\tint m = nextInt();\r\n\t\t\tint[][] e = new int[m][2];\r\n\t\t\tfor(int i=0; i<m; i++){\r\n\t\t\t\te[i][0] = nextInt()+offset;\r\n\t\t\t\te[i][1] = nextInt()+offset;\r\n\t\t\t}\r\n\t\t\treturn e;\r\n\t\t}\r\n\t\t\r\n\t\tint[] nextIntArray(int len) {\r\n\t\t\treturn nextIntArray(len, 0);\r\n\t\t}\r\n\t\tint[] nextIntArray(int len, int offset){\r\n\t \tint[] a = new int[len];\r\n\t\t\tfor(int j=0; j<len; j++)\r\n\t \t\ta[j] = nextInt()+offset;\r\n\t \treturn a;\r\n\t\t}\r\n\t\t\r\n\t\tlong[] nextLongArray(int len) {\r\n\t\t\treturn nextLongArray(len, 0);\r\n\t\t}\r\n\t\tlong[] nextLongArray(int len, int offset){\r\n\t \tlong[] a = new long[len];\r\n\t\t\tfor(int j=0; j<len; j++)\r\n\t \t\ta[j] = nextLong()+offset;\r\n\t \treturn a;\r\n\t\t}\r\n\t}\r\n\t\r\n\tpublic static class MyPrintWriter extends PrintWriter{\r\n\t\tpublic MyPrintWriter(OutputStream os) {\r\n\t\t\tsuper(os);\r\n\t\t}\r\n\t\t\r\n\t\tpublic void printlnAns(long ans) {\r\n\t\t\tprintln(ans);\r\n\t\t}\r\n\t\t\r\n\t\tpublic void printlnAns(int ans) {\r\n\t\t\tprintln(ans);\r\n\t\t}\r\n\t\t\r\n\t\tpublic void printlnAns(boolean ans) {\r\n\t\t\tif(ans)\r\n\t\t\t\tprintln(YES);\r\n\t\t\telse\r\n\t\t\t\tprintln(NO);\r\n\t\t}\r\n\t\t\r\n\t\tpublic void printAns(long[] arr){\r\n\t\t\tif(arr != null && arr.length > 0){\r\n\t\t\t\tprint(arr[0]);\r\n\t\t\t\tfor(int i=1; i<arr.length; i++){\r\n\t\t\t\t\tprint(\" \");\r\n\t\t\t\t\tprint(arr[i]);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tpublic void printlnAns(long[] arr){\r\n\t\t\tprintAns(arr);\r\n\t\t\tprintln();\r\n\t\t}\r\n\r\n\t\tpublic void printAns(int[] arr){\r\n\t\t\tif(arr != null && arr.length > 0){\r\n\t\t\t\tprint(arr[0]);\r\n\t\t\t\tfor(int i=1; i<arr.length; i++){\r\n\t\t\t\t\tprint(\" \");\r\n\t\t\t\t\tprint(arr[i]);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tpublic void printlnAns(int[] arr){\r\n\t\t\tprintAns(arr);\r\n\t\t\tprintln();\r\n\t\t}\r\n\t\t\r\n\t\tpublic <T> void printAns(ArrayList<T> arr){\r\n\t\t\tif(arr != null && arr.size() > 0){\r\n\t\t\t\tprint(arr.get(0));\r\n\t\t\t\tfor(int i=1; i<arr.size(); i++){\r\n\t\t\t\t\tprint(\" \");\r\n\t\t\t\t\tprint(arr.get(i));\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tpublic <T> void printlnAns(ArrayList<T> arr){\r\n\t\t\tprintAns(arr);\r\n\t\t\tprintln();\r\n\t\t}\r\n\t\t\r\n\t\tpublic void printAns(int[] arr, int add){\r\n\t\t\tif(arr != null && arr.length > 0){\r\n\t\t\t\tprint(arr[0]+add);\r\n\t\t\t\tfor(int i=1; i<arr.length; i++){\r\n\t\t\t\t\tprint(\" \");\r\n\t\t\t\t\tprint(arr[i]+add);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tpublic void printlnAns(int[] arr, int add){\r\n\t\t\tprintAns(arr, add);\r\n\t\t\tprintln();\r\n\t\t}\r\n\t\t\r\n\t\tpublic void printAns(ArrayList<Integer> arr, int add) {\r\n\t\t\tif(arr != null && arr.size() > 0){\r\n\t\t\t\tprint(arr.get(0)+add);\r\n\t\t\t\tfor(int i=1; i<arr.size(); i++){\r\n\t\t\t\t\tprint(\" \");\r\n\t\t\t\t\tprint(arr.get(i)+add);\r\n\t\t\t\t}\r\n\t\t\t}\t\t\t\r\n\t\t}\r\n\t\t\r\n\t\tpublic void printlnAns(ArrayList<Integer> arr, int add){\r\n\t\t\tprintAns(arr, add);\r\n\t\t\tprintln();\r\n\t\t}\r\n\t\t\r\n\t\tpublic void printlnAnsSplit(long[] arr, int split){\r\n\t\t\tif(arr != null){\r\n\t\t\t\tfor(int i=0; i<arr.length; i+=split){\r\n\t\t\t\t\tprint(arr[i]);\r\n\t\t\t\t\tfor(int j=i+1; j<i+split; j++){\r\n\t\t\t\t\t\tprint(\" \");\r\n\t\t\t\t\t\tprint(arr[j]);\r\n\t\t\t\t\t}\r\n\t\t\t\t\tprintln();\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t\tpublic void printlnAnsSplit(int[] arr, int split){\r\n\t\t\tif(arr != null){\r\n\t\t\t\tfor(int i=0; i<arr.length; i+=split){\r\n\t\t\t\t\tprint(arr[i]);\r\n\t\t\t\t\tfor(int j=i+1; j<i+split; j++){\r\n\t\t\t\t\t\tprint(\" \");\r\n\t\t\t\t\t\tprint(arr[j]);\r\n\t\t\t\t\t}\r\n\t\t\t\t\tprintln();\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t\tpublic <T> void printlnAnsSplit(ArrayList<T> arr, int split){\r\n\t\t\tif(arr != null && !arr.isEmpty()){\r\n\t\t\t\tfor(int i=0; i<arr.size(); i+=split){\r\n\t\t\t\t\tprint(arr.get(i));\r\n\t\t\t\t\tfor(int j=i+1; j<i+split; j++){\r\n\t\t\t\t\t\tprint(\" \");\r\n\t\t\t\t\t\tprint(arr.get(j));\r\n\t\t\t\t\t}\r\n\t\t\t\t\tprintln();\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\r\n\tstatic private void permutateAndSort(long[] a) {\r\n\t\tint n = a.length;\r\n\t\tRandom R = new Random(System.currentTimeMillis());\r\n\t\tfor(int i=0; i<n; i++) {\r\n\t\t\tint t = R.nextInt(n-i);\r\n\t\t\tlong temp = a[n-1-i];\r\n\t\t\ta[n-1-i] = a[t];\r\n\t\t\ta[t] = temp;\r\n\t\t}\r\n\t\tArrays.sort(a);\t\t\r\n\t}\r\n\t\r\n\tstatic private void permutateAndSort(int[] a) {\r\n\t\tint n = a.length;\r\n\t\tRandom R = new Random(System.currentTimeMillis());\r\n\t\tfor(int i=0; i<n; i++) {\r\n\t\t\tint t = R.nextInt(n-i);\r\n\t\t\tint temp = a[n-1-i];\r\n\t\t\ta[n-1-i] = a[t];\r\n\t\t\ta[t] = temp;\r\n\t\t}\r\n\t\tArrays.sort(a);\r\n\t}\r\n\t\r\n\tstatic private int[][] constructChildren(int n, int[] parent, int parentRoot){\r\n\t\tint[][] childrens = new int[n][];\r\n\t\t\r\n\t\tint[] numChildren = new int[n];\r\n\t\tfor(int i=0; i<parent.length; i++) {\r\n\t\t\tif(parent[i] != parentRoot)\r\n\t\t\t\tnumChildren[parent[i]]++;\r\n\t\t}\r\n\t\t\r\n\t\tfor(int i=0; i<n; i++) {\r\n\t\t\tchildrens[i] = new int[numChildren[i]];\r\n\t\t}\r\n\t\t\r\n\r\n\t\tint[] idx = new int[n];\r\n\t\tfor(int i=0; i<parent.length; i++) {\r\n\t\t\tif(parent[i] != parentRoot)\r\n\t\t\t\tchildrens[parent[i]][idx[parent[i]]++] = i;\r\n\t\t}\r\n\r\n\t\treturn childrens;\r\n\t}\r\n\t\r\n\tstatic private int[][][] constructDirectedNeighborhood(int n, int[][] e){\r\n\t\tint[] inDegree = new int[n];\r\n\t\tint[] outDegree = new int[n];\r\n\t\tfor(int i=0; i<e.length; i++) {\r\n\t\t\tint u = e[i][0];\r\n\t\t\tint v = e[i][1];\r\n\t\t\toutDegree[u]++;\r\n\t\t\tinDegree[v]++;\r\n\t\t}\r\n\t\t\r\n\t\tint[][] inNeighbors = new int[n][];\r\n\t\tint[][] outNeighbors = new int[n][];\r\n\t\tfor(int i=0; i<n; i++) {\r\n\t\t\tinNeighbors[i] = new int[inDegree[i]];\r\n\t\t\toutNeighbors[i] = new int[outDegree[i]];\r\n\t\t}\r\n\t\t\r\n\t\tint[] inIdx = new int[n];\r\n\t\tint[] outIdx = new int[n];\r\n\t\tfor(int i=0; i<e.length; i++) {\r\n\t\t\tint u = e[i][0];\r\n\t\t\tint v = e[i][1];\r\n\t\t\toutNeighbors[u][outIdx[u]++] = v;\r\n\t\t\tinNeighbors[v][inIdx[v]++] = u;\r\n\t\t}\r\n\t\t\r\n\t\treturn new int[][][] {inNeighbors, outNeighbors};\r\n\t}\r\n\t\r\n\tstatic private int[][] constructNeighborhood(int n, int[][] e) {\r\n\t\tint[] degree = new int[n];\r\n\t\tfor(int i=0; i<e.length; i++) {\r\n\t\t\tint u = e[i][0];\r\n\t\t\tint v = e[i][1];\r\n\t\t\tdegree[u]++;\r\n\t\t\tdegree[v]++;\r\n\t\t}\r\n\t\t\r\n\t\tint[][] neighbors = new int[n][];\r\n\t\tfor(int i=0; i<n; i++)\r\n\t\t\tneighbors[i] = new int[degree[i]];\r\n\t\t\r\n\t\tint[] idx = new int[n];\r\n\t\tfor(int i=0; i<e.length; i++) {\r\n\t\t\tint u = e[i][0];\r\n\t\t\tint v = e[i][1];\r\n\t\t\tneighbors[u][idx[u]++] = v;\r\n\t\t\tneighbors[v][idx[v]++] = u;\r\n\t\t}\r\n\t\t\r\n\t\treturn neighbors;\r\n\t}\r\n\t\r\n\tstatic private void drawGraph(int[][] e) {\r\n\t\tmakeDotUndirected(e);\r\n\t\ttry {\r\n\t\t\tfinal Process process = new ProcessBuilder(\"dot\", \"-Tpng\", \"graph.dot\")\r\n\t\t\t\t\t.redirectOutput(new File(\"graph.png\"))\r\n\t\t\t\t\t.start();\r\n\t\t} catch (IOException e1) {\r\n\t\t\t// TODO Auto-generated catch block\r\n\t\t\te1.printStackTrace();\r\n\t\t}\r\n\t\t\r\n\t}\r\n\t\r\n\tstatic private void makeDotUndirected(int[][] e) {\r\n\t\tMyPrintWriter out2 = null;\r\n\t\t try {\r\n\t\t\tout2 = new MyPrintWriter(new FileOutputStream(\"graph.dot\"));\r\n\t\t} catch (FileNotFoundException e1) {\r\n\t\t\t// TODO Auto-generated catch block\r\n\t\t\te1.printStackTrace();\r\n\t\t}\r\n\t\tout2.println(\"strict graph {\");\r\n\t\tfor(int i=0; i<e.length; i++){\r\n\t\t\tout2.println(e[i][0] + \"--\" + e[i][1] + \";\");\r\n\t\t}\r\n\t\tout2.println(\"}\");\r\n\t\tout2.close();\r\n\t}\r\n\t\r\n\tstatic private void makeDotDirected(int[][] e) {\r\n\t\tMyPrintWriter out2 = null;\r\n\t\t try {\r\n\t\t\tout2 = new MyPrintWriter(new FileOutputStream(\"graph.dot\"));\r\n\t\t} catch (FileNotFoundException e1) {\r\n\t\t\t// TODO Auto-generated catch block\r\n\t\t\te1.printStackTrace();\r\n\t\t}\r\n\t\tout2.println(\"strict digraph {\");\r\n\t\tfor(int i=0; i<e.length; i++){\r\n\t\t\tout2.println(e[i][0] + \"->\" + e[i][1] + \";\");\r\n\t\t}\r\n\t\tout2.println(\"}\");\r\n\t\tout2.close();\r\n\t}\r\n\t\r\n}\r\n", "lang_cluster": "Java", "tags": ["brute force", "flows", "math", "dp", "fft", "bitmasks", "graphs", "meet-in-the-middle", "trees"], "code_uid": "d4b6c9bba6a527cbc88d3f1fd4abe3dc", "src_uid": "4b8161259545e44c7d1046be2e4fe014", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 17", "source_code": "import java.util.*;\r\nimport java.util.function.*;\r\nimport java.io.*;\r\n\r\n// you can compare with output.txt and expected out\r\npublic class RoundEdu132F {\t\r\n\tMyPrintWriter out;\r\n\tMyScanner in;\r\n\t\r\n//\tfinal static long FIXED_RANDOM;\r\n//\tstatic {\r\n//\t\tFIXED_RANDOM = System.currentTimeMillis();\r\n//\t}\r\n\tfinal static String IMPOSSIBLE = \"IMPOSSIBLE\";\r\n\tfinal static String POSSIBLE = \"POSSIBLE\";\r\n\tfinal static String YES = \"YES\";\r\n\tfinal static String NO = \"NO\";\r\n\t\r\n private void initIO(boolean isFileIO) {\r\n if (System.getProperty(\"ONLINE_JUDGE\") == null && isFileIO) {\r\n \ttry{\r\n\t in = new MyScanner(new FileInputStream(\"input.txt\"));\r\n\t out = new MyPrintWriter(new FileOutputStream(\"output.txt\"));\r\n \t}\r\n \tcatch(FileNotFoundException e){\r\n \t\te.printStackTrace();\r\n \t}\r\n }\r\n else{\r\n \t\tin = new MyScanner(System.in);\r\n \t out = new MyPrintWriter(new BufferedOutputStream(System.out));\r\n }\r\n }\r\n\t\r\n\tpublic static void main(String[] args){\r\n//\t\tScanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));\r\n\t\t\r\n\t\tRoundEdu132F sol = new RoundEdu132F();\r\n\t\tsol.run();\r\n }\r\n\t\r\n\tprivate void run() {\r\n\t\tboolean isDebug = false;\r\n\t\tboolean isFileIO = true;\r\n\t\tboolean hasMultipleTests = false;\r\n\t\t\r\n\t\tinitIO(isFileIO);\r\n\t\r\n\t\tint t = hasMultipleTests? in.nextInt() : 1;\r\n\t \r\n\t for (int i = 1; i <= t; ++i) {\r\n\t \tif(isDebug){\r\n\t\t \tout.printf(\"Test %d\\n\", i);\r\n\t \t}\r\n\r\n\t \tgetInput();\r\n\r\n\t \tans = solve();\r\n\t \t\r\n\t \tprintOutput();\r\n\t }\r\n\t \r\n\t in.close();\r\n\t out.close();\r\n\t}\r\n\t\r\n\tint n, k, f;\r\n\tvoid getInput() {\r\n\t\tn = in.nextInt(); \r\n\t\tk = in.nextInt();\r\n\t\tf = in.nextInt();\r\n\t}\r\n\t\r\n\tvoid printOutput() {\r\n\t\tout.printlnAns(ans);\r\n\t}\r\n\t\r\n\tstatic final long MOD = 998244353;\r\n\tint ans;\r\n\tint solve(){\r\n\t\tlong ans = 0;\r\n\t\t\r\n\t\t// for each binary string s,\r\n\t\t// consider binary strings t of length n, where s is a prefix of t\r\n\t\t// we can have <= c_s among t\r\n\t\t\r\n\t\t// it's a full binary tree\r\n\t\t// where each vertex contains # of records in its subtree\r\n\t\t// and all records are at depth n\r\n\t\t\r\n\t\t// from each leaf, go up again, update each vertex to min(val, val(child1) + val(child2))\r\n\t\t// then the val(root) must be exactly f\r\n\t\t// where root is null string\r\n\r\n\t\t// the problem in this counting is we would have to use inclusion-exclusion due to duplicate cases\r\n\t\t// so we choose vertices representing disjoint subtrees\r\n\t\t// whose union can represent the whole tree\r\n\t\t// and whose sum is exactly f\r\n\t\t\r\n\t\t// for vertices under the subtrees, we can freely choose val\r\n\t\t// so that sum of siblings in each subtree >= val of root of subtree \r\n\t\t// for vertices above the subtrees, we can freely choose val between sum and k\r\n\r\n\t\t\r\n\t\t// so another approach:\r\n\t\t// for each vertex v of depth h\r\n\t\t// find # of ways to make sum exactly x\r\n\t\t// case 1: val(v) = x\r\n\t\t// add up ways(l, y)*ways(r, z) where y+z >= x\r\n\t\t// case 2: val(v) >= x+1\r\n\t\t// add up ways(l, y)*ways(r, z) where y+z = x\r\n\t\t\r\n\t\t// 2 1 1\r\n\t\t// case 1: c_0 = 1, c_1 = 0\r\n\t\t// 00 01 10 11\r\n\t\t// 1 0 0/1 0/1\r\n\t\t// 0 1 0/1 0/1\r\n\t\t// 1 1 0/1 0/1\r\n\t\t// -> 12\r\n\t\t\r\n\t\t// case 2: c_0 = 0, c_1 = 1\r\n\t\t// -> 12\r\n\t\t\r\n\t\t// case 3: c_0 = 1, c_1 = 1\r\n\t\t// 1 0 0 0\r\n\t\t// 0 1 0 0\r\n\t\t// 1 1 0 0\r\n\t\t// 0 0 1 0\r\n\t\t// 0 0 0 1\r\n\t\t// 0 0 1 1\r\n\t\t// -> 6\r\n\t\t\r\n\t\t// subtree_0 = 1 -> 3\r\n\t\t// c_0 = 1 -> 1 0, 0 1, 1 1\r\n\t\t\r\n\t\t// subtree_0 = 0 -> 5\r\n\t\t// c_0 = 0 -> 0/1, 0/1 -> 4\r\n\t\t// c_0 = 1 -> 0, 0 -> 1\r\n\t\t// 3*5 + 3*5 = 30\r\n\t\t\r\n\t\t// subtree_l = 0 -> 1 \r\n\t\t// subtree_l = 1 -> 1\r\n\t\t\r\n\t\t// long[] ways = new long[f+2];\r\n\t\tint len = 1;\r\n\t\twhile (len < f+2 + f+2) \r\n\t len <<= 1;\r\n\t\tlong[] ways = new long[len];\r\n\t\tlong[] suffix = new long[f+2];\r\n\t\t\r\n\t\tfor(int i=0; i<=k && i<=f; i++)\r\n\t\t\tways[i] = 1;\r\n\t\tways[f+1] = Math.max(0, k-f);\r\n\t\t\r\n//\t\tlong[] ways2 = Arrays.copyOf(ways, f+2);\r\n\t\t\r\n\t\tfor(int i=0; i<n; i++) {\r\n\t\t\tif(i < n-1) {\r\n\t\t\t\tsquare(ways);\r\n\t\t\t\t{\r\n\t\t\t\t\tlong val = 0;\r\n\t\t\t\t\tfor(int j=ways.length-1; j>=f+1; j--)\r\n\t\t\t\t\t\tval += ways[j];\r\n\t\t\t\t\tval %= MOD;\r\n\t\t\t\t\tsuffix[f+1] = val;\r\n\t\t\t\t}\r\n\t\t\t\tfor(int j=f; j>=0; j--){\r\n\t\t\t\t\tlong val = suffix[j+1] + ways[j];\r\n\t\t\t\t\tval = val>=MOD? val-MOD: val;\r\n\t\t\t\t\tsuffix[j] = val;\r\n\t\t\t\t}\r\n\t\t\t\r\n\t\t\t\tfor(int j=0; j <= k && j<=f; j++) {\r\n\t\t\t\t\tlong val = suffix[j]; // c_curr = j\r\n\t\t\t\t\tval += ways[j]*(k-j); // j+1 ~ k\r\n\t\t\t\t\tval %= MOD;\r\n\t\t\t\t\tways[j] = val;\r\n\t\t\t\t}\r\n\t\t\t\t{\r\n\t\t\t\t\tlong val = suffix[f+1]*Math.max(0, k-f);\r\n\t\t\t\t\tval %= MOD;\r\n\t\t\t\t\tways[f+1] = val;\r\n\t\t\t\t}\r\n\t\t\t\tfor(int j=k+1; j<f+2; j++)\r\n\t\t\t\t\tways[j] = 0;\r\n\t\t\t\tArrays.fill(ways, f+2, ways.length, 0);\r\n\t\t\t\t\r\n//\t\t\t\tlong[] mult = multiplyPolynomial(ways2, ways2);\r\n//\t\t\t\t{\r\n//\t\t\t\t\tlong val = 0;\r\n//\t\t\t\t\tfor(int j=mult.length-1; j>=f+1; j--)\r\n//\t\t\t\t\t\tval += mult[j];\r\n//\t\t\t\t\tval %= MOD;\r\n//\t\t\t\t\tsuffix[f+1] = val;\r\n//\t\t\t\t}\r\n//\t\t\t\tfor(int j=f; j>=0; j--){\r\n//\t\t\t\t\tlong val = suffix[j+1] + mult[j];\r\n//\t\t\t\t\tval = val>=MOD? val-MOD: val;\r\n//\t\t\t\t\tsuffix[j] = val;\r\n//\t\t\t\t}\r\n//\t\t\t\tif(i < n-1) {\r\n//\t\t\t\t\tfor(int j=0; j <= k && j<=f; j++) {\r\n//\t\t\t\t\t\tlong val = suffix[j]; // c_curr = j\r\n//\t\t\t\t\t\tval += mult[j]*(k-j); // j+1 ~ k\r\n//\t\t\t\t\t\tval %= MOD;\r\n//\t\t\t\t\t\tways2[j] = val;\r\n//\t\t\t\t\t}\r\n//\t\t\t\t\t{\r\n//\t\t\t\t\t\tlong val = suffix[f+1]*Math.max(0, k-f);\r\n//\t\t\t\t\t\tval %= MOD;\r\n//\t\t\t\t\t\tways2[f+1] = val;\r\n//\t\t\t\t\t}\r\n//\t\t\t\t}\r\n//\t\t\t\tif(!Arrays.equals(Arrays.copyOf(ways, f+2), ways2)) {\r\n//\t\t\t\t\tfor(int j=0; j<f+2; j++)\r\n//\t\t\t\t\t\tif(ways[j] != ways2[j])\r\n//\t\t\t\t\t\t\tways = ways;\r\n//\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse {\r\n\t\t\t\tfor(int j=0; j<=f; j++)\r\n\t\t\t\t\tans += ways[j]*ways[f-j] % MOD;\r\n\t\t\t\tans %= MOD;\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t\treturn (int)ans;\r\n\t}\r\n\t\r\n\tstatic long pow(int a, int k, long p) {\r\n\t\tlong m = k;\r\n\t\tlong ans = 1;\r\n\r\n\t\t// curr = k^(2^i)\r\n\t\tlong curr = a;\r\n\r\n\t\t// k^(2x+1) = (k^x)^2 * k\r\n\t\twhile(m > 0) {\r\n\t\t\tif( (m&1) == 1 ) {\r\n\t\t\t\tans *= curr;\r\n\t\t\t\tans %= p;\r\n\t\t\t}\r\n\t\t\tm >>= 1;\r\n\t\t\tcurr *= curr;\r\n\t\t\tcurr %= p;\r\n\t\t}\r\n\t\treturn ans;\t\t\r\n\t}\r\n\t\r\n\t// computes a^(p-2)\r\n\tstatic long inverse(int a, long p) {\r\n\t\treturn pow(a, (int)(p-2), p);\r\n\t}\r\n\t\r\n\t// static final long MOD = 998_244_353; // = 1 + 7*17*2^23\r\n\t// primitive root is 3, i.e., the order of 3 is MOD-1\r\n\t// we have to find the 1<<23-th root\r\n\tstatic final int ROOT = (int) pow(3, 7*17, MOD);\r\n\tstatic final int ROOT_INV = (int) pow(ROOT, (int)MOD - 2, MOD);\r\n\tstatic final int ORDER = 1 << 23;\r\n\r\n\tstatic void swap(long[] a, int i, int j) {\r\n\t\tlong temp = a[i];\r\n\t\ta[i] = a[j];\r\n\t\ta[j] = temp;\r\n\t}\r\n\tstatic void fft(long[] a, boolean isInvertedFFT) {\r\n\t int n = a.length;\r\n\r\n\t for (int i = 1, j = 0; i < n; i++) {\r\n\t int bit = n >> 1;\r\n\t for (; (j & bit) > 0; bit >>= 1)\r\n\t j ^= bit;\r\n\t j ^= bit;\r\n\r\n\t if (i < j) {\r\n\t \tswap(a, i, j);\r\n\t }\r\n\t }\r\n\r\n\t for (int len = 2; len <= n; len <<= 1) {\r\n\t long wlen = isInvertedFFT ? ROOT_INV : ROOT;\r\n\t for (int i = len; i < ORDER; i <<= 1)\r\n\t wlen = wlen * wlen % MOD;\r\n\r\n\t for (int i = 0; i < n; i += len) {\r\n\t \tlong w = 1;\r\n\t for (int j = 0; j < len / 2; j++) {\r\n\t long u = a[i+j];\r\n\t long v = a[i+j+len/2] * w % MOD;\r\n\t a[i+j] = u + v < MOD ? u + v : u + v - MOD;\r\n\t a[i+j+len/2] = u - v >= 0 ? u - v : u - v + MOD;\r\n\t w = w * wlen % MOD;\r\n\t }\r\n\t }\r\n\t }\r\n\r\n\t if (isInvertedFFT) {\r\n\t long inv = inverse(n, MOD);\r\n\t for(int i=0; i<a.length; i++)\r\n\t \ta[i] = a[i]*inv%MOD;\r\n\t }\r\n\t}\r\n\t\r\n\tstatic void square(long[] a) {\r\n\t fft(a, false);\r\n\t for (int i = 0; i < a.length; i++)\r\n\t a[i] = a[i]*a[i] % MOD;\r\n\t fft(a, true);\r\n\t}\r\n\t\r\n\tstatic long[] multiplyPolynomial(long[] a, long[] b) {\r\n\t int n = 1;\r\n\t while (n < a.length + b.length) \r\n\t n <<= 1;\r\n\t\tlong[] fa = Arrays.copyOf(a, n);\r\n\t\tlong[] fb = Arrays.copyOf(b, n);\r\n\r\n\t fft(fa, false);\r\n\t fft(fb, false);\r\n\t for (int i = 0; i < n; i++)\r\n\t fa[i] = fa[i]*fb[i] % MOD;\r\n\t fft(fa, true);\r\n\t \r\n\t return fa;\r\n\t}\r\n\t\r\n\tpublic static class MyScanner {\r\n\t\tBufferedReader br;\r\n\t\tStringTokenizer st;\r\n\r\n\t\t// 32768?\r\n\t\tpublic MyScanner(InputStream is, int bufferSize) {\r\n\t\t\tbr = new BufferedReader(new InputStreamReader(is), bufferSize);\r\n\t\t}\r\n\t\t\r\n\t\tpublic MyScanner(InputStream is) {\r\n\t\t\tbr = new BufferedReader(new InputStreamReader(is));\r\n\t\t\t// br = new BufferedReader(new InputStreamReader(System.in));\r\n\t\t\t// br = new BufferedReader(new InputStreamReader(new FileInputStream(\"input.txt\")));\r\n\t\t}\r\n\r\n\t\tpublic void close() {\r\n\t\t\ttry {\r\n\t\t\t\tbr.close();\r\n\t\t\t} catch (IOException e) {\r\n\t\t\t\te.printStackTrace();\r\n\t\t\t}\r\n\r\n\t\t}\r\n\r\n\t\tString next() {\r\n\t\t\twhile (st == null || !st.hasMoreElements()) {\r\n\t\t\t\ttry {\r\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\r\n\t\t\t\t} catch (IOException e) {\r\n\t\t\t\t\te.printStackTrace();\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\treturn st.nextToken();\r\n\t\t}\r\n\r\n\t\tint nextInt() {\r\n\t\t\treturn Integer.parseInt(next());\r\n\t\t}\r\n\r\n\t\tlong nextLong() {\r\n\t\t\treturn Long.parseLong(next());\r\n\t\t}\r\n\r\n\t\tdouble nextDouble() {\r\n\t\t\treturn Double.parseDouble(next());\r\n\t\t}\r\n\r\n\t\tString nextLine(){\r\n\t\t\tString str = \"\";\r\n\t\t\ttry {\r\n\t\t\t\tstr = br.readLine();\r\n\t\t\t} catch (IOException e) {\r\n\t\t\t\te.printStackTrace();\r\n\t\t\t}\r\n\t\t\treturn str;\r\n\t\t}\r\n\t\t\r\n\t\tint[][] nextTreeEdges(int n, int offset){\r\n\t\t\tint[][] e = new int[n-1][2];\r\n\t\t\tfor(int i=0; i<n-1; i++){\r\n\t\t\t\te[i][0] = nextInt()+offset;\r\n\t\t\t\te[i][1] = nextInt()+offset;\r\n\t\t\t}\r\n\t\t\treturn e;\t\t\t\r\n\t\t}\r\n\t\t\r\n\t\tint[][] nextMatrix(int n, int m) {\r\n\t\t\treturn nextMatrix(n, m, 0);\r\n\t\t}\r\n\t\t\r\n\t\tint[][] nextMatrix(int n, int m, int offset) {\r\n\t\t\tint[][] mat = new int[n][m];\r\n\t\t\tfor(int i=0; i<n; i++) {\r\n\t\t\t\tfor(int j=0; j<m; j++) {\r\n\t\t\t\t\tmat[i][j] = nextInt()+offset;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\treturn mat;\r\n\t\t}\r\n\t\t\r\n\t\tint[][] nextPairs(int n){\r\n\t\t\treturn nextPairs(n, 0);\r\n\t\t}\r\n\t\t\r\n\t\tint[][] nextPairs(int n, int offset) {\r\n\t\t\tint[][] xy = new int[2][n];\r\n\t\t\tfor(int i=0; i<n; i++) {\r\n\t\t\t\txy[0][i] = nextInt() + offset;\r\n\t\t\t\txy[1][i] = nextInt() + offset;\r\n\t\t\t}\r\n\t\t\treturn xy;\r\n\t\t}\r\n\r\n\t\tint[][] nextGraphEdges(){\r\n\t\t\treturn nextGraphEdges(0);\r\n\t\t}\r\n\t\t\r\n\t\tint[][] nextGraphEdges(int offset) {\r\n\t\t\tint m = nextInt();\r\n\t\t\tint[][] e = new int[m][2];\r\n\t\t\tfor(int i=0; i<m; i++){\r\n\t\t\t\te[i][0] = nextInt()+offset;\r\n\t\t\t\te[i][1] = nextInt()+offset;\r\n\t\t\t}\r\n\t\t\treturn e;\r\n\t\t}\r\n\t\t\r\n\t\tint[] nextIntArray(int len) {\r\n\t\t\treturn nextIntArray(len, 0);\r\n\t\t}\r\n\t\tint[] nextIntArray(int len, int offset){\r\n\t \tint[] a = new int[len];\r\n\t\t\tfor(int j=0; j<len; j++)\r\n\t \t\ta[j] = nextInt()+offset;\r\n\t \treturn a;\r\n\t\t}\r\n\t\t\r\n\t\tlong[] nextLongArray(int len) {\r\n\t\t\treturn nextLongArray(len, 0);\r\n\t\t}\r\n\t\tlong[] nextLongArray(int len, int offset){\r\n\t \tlong[] a = new long[len];\r\n\t\t\tfor(int j=0; j<len; j++)\r\n\t \t\ta[j] = nextLong()+offset;\r\n\t \treturn a;\r\n\t\t}\r\n\t}\r\n\t\r\n\tpublic static class MyPrintWriter extends PrintWriter{\r\n\t\tpublic MyPrintWriter(OutputStream os) {\r\n\t\t\tsuper(os);\r\n\t\t}\r\n\t\t\r\n\t\tpublic void printlnAns(long ans) {\r\n\t\t\tprintln(ans);\r\n\t\t}\r\n\t\t\r\n\t\tpublic void printlnAns(int ans) {\r\n\t\t\tprintln(ans);\r\n\t\t}\r\n\t\t\r\n\t\tpublic void printlnAns(boolean ans) {\r\n\t\t\tif(ans)\r\n\t\t\t\tprintln(YES);\r\n\t\t\telse\r\n\t\t\t\tprintln(NO);\r\n\t\t}\r\n\t\t\r\n\t\tpublic void printAns(long[] arr){\r\n\t\t\tif(arr != null && arr.length > 0){\r\n\t\t\t\tprint(arr[0]);\r\n\t\t\t\tfor(int i=1; i<arr.length; i++){\r\n\t\t\t\t\tprint(\" \");\r\n\t\t\t\t\tprint(arr[i]);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tpublic void printlnAns(long[] arr){\r\n\t\t\tprintAns(arr);\r\n\t\t\tprintln();\r\n\t\t}\r\n\r\n\t\tpublic void printAns(int[] arr){\r\n\t\t\tif(arr != null && arr.length > 0){\r\n\t\t\t\tprint(arr[0]);\r\n\t\t\t\tfor(int i=1; i<arr.length; i++){\r\n\t\t\t\t\tprint(\" \");\r\n\t\t\t\t\tprint(arr[i]);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tpublic void printlnAns(int[] arr){\r\n\t\t\tprintAns(arr);\r\n\t\t\tprintln();\r\n\t\t}\r\n\t\t\r\n\t\tpublic <T> void printAns(ArrayList<T> arr){\r\n\t\t\tif(arr != null && arr.size() > 0){\r\n\t\t\t\tprint(arr.get(0));\r\n\t\t\t\tfor(int i=1; i<arr.size(); i++){\r\n\t\t\t\t\tprint(\" \");\r\n\t\t\t\t\tprint(arr.get(i));\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tpublic <T> void printlnAns(ArrayList<T> arr){\r\n\t\t\tprintAns(arr);\r\n\t\t\tprintln();\r\n\t\t}\r\n\t\t\r\n\t\tpublic void printAns(int[] arr, int add){\r\n\t\t\tif(arr != null && arr.length > 0){\r\n\t\t\t\tprint(arr[0]+add);\r\n\t\t\t\tfor(int i=1; i<arr.length; i++){\r\n\t\t\t\t\tprint(\" \");\r\n\t\t\t\t\tprint(arr[i]+add);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tpublic void printlnAns(int[] arr, int add){\r\n\t\t\tprintAns(arr, add);\r\n\t\t\tprintln();\r\n\t\t}\r\n\t\t\r\n\t\tpublic void printAns(ArrayList<Integer> arr, int add) {\r\n\t\t\tif(arr != null && arr.size() > 0){\r\n\t\t\t\tprint(arr.get(0)+add);\r\n\t\t\t\tfor(int i=1; i<arr.size(); i++){\r\n\t\t\t\t\tprint(\" \");\r\n\t\t\t\t\tprint(arr.get(i)+add);\r\n\t\t\t\t}\r\n\t\t\t}\t\t\t\r\n\t\t}\r\n\t\t\r\n\t\tpublic void printlnAns(ArrayList<Integer> arr, int add){\r\n\t\t\tprintAns(arr, add);\r\n\t\t\tprintln();\r\n\t\t}\r\n\t\t\r\n\t\tpublic void printlnAnsSplit(long[] arr, int split){\r\n\t\t\tif(arr != null){\r\n\t\t\t\tfor(int i=0; i<arr.length; i+=split){\r\n\t\t\t\t\tprint(arr[i]);\r\n\t\t\t\t\tfor(int j=i+1; j<i+split; j++){\r\n\t\t\t\t\t\tprint(\" \");\r\n\t\t\t\t\t\tprint(arr[j]);\r\n\t\t\t\t\t}\r\n\t\t\t\t\tprintln();\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t\tpublic void printlnAnsSplit(int[] arr, int split){\r\n\t\t\tif(arr != null){\r\n\t\t\t\tfor(int i=0; i<arr.length; i+=split){\r\n\t\t\t\t\tprint(arr[i]);\r\n\t\t\t\t\tfor(int j=i+1; j<i+split; j++){\r\n\t\t\t\t\t\tprint(\" \");\r\n\t\t\t\t\t\tprint(arr[j]);\r\n\t\t\t\t\t}\r\n\t\t\t\t\tprintln();\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t\tpublic <T> void printlnAnsSplit(ArrayList<T> arr, int split){\r\n\t\t\tif(arr != null && !arr.isEmpty()){\r\n\t\t\t\tfor(int i=0; i<arr.size(); i+=split){\r\n\t\t\t\t\tprint(arr.get(i));\r\n\t\t\t\t\tfor(int j=i+1; j<i+split; j++){\r\n\t\t\t\t\t\tprint(\" \");\r\n\t\t\t\t\t\tprint(arr.get(j));\r\n\t\t\t\t\t}\r\n\t\t\t\t\tprintln();\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\r\n\tstatic private void permutateAndSort(long[] a) {\r\n\t\tint n = a.length;\r\n\t\tRandom R = new Random(System.currentTimeMillis());\r\n\t\tfor(int i=0; i<n; i++) {\r\n\t\t\tint t = R.nextInt(n-i);\r\n\t\t\tlong temp = a[n-1-i];\r\n\t\t\ta[n-1-i] = a[t];\r\n\t\t\ta[t] = temp;\r\n\t\t}\r\n\t\tArrays.sort(a);\t\t\r\n\t}\r\n\t\r\n\tstatic private void permutateAndSort(int[] a) {\r\n\t\tint n = a.length;\r\n\t\tRandom R = new Random(System.currentTimeMillis());\r\n\t\tfor(int i=0; i<n; i++) {\r\n\t\t\tint t = R.nextInt(n-i);\r\n\t\t\tint temp = a[n-1-i];\r\n\t\t\ta[n-1-i] = a[t];\r\n\t\t\ta[t] = temp;\r\n\t\t}\r\n\t\tArrays.sort(a);\r\n\t}\r\n\t\r\n\tstatic private int[][] constructChildren(int n, int[] parent, int parentRoot){\r\n\t\tint[][] childrens = new int[n][];\r\n\t\t\r\n\t\tint[] numChildren = new int[n];\r\n\t\tfor(int i=0; i<parent.length; i++) {\r\n\t\t\tif(parent[i] != parentRoot)\r\n\t\t\t\tnumChildren[parent[i]]++;\r\n\t\t}\r\n\t\t\r\n\t\tfor(int i=0; i<n; i++) {\r\n\t\t\tchildrens[i] = new int[numChildren[i]];\r\n\t\t}\r\n\t\t\r\n\r\n\t\tint[] idx = new int[n];\r\n\t\tfor(int i=0; i<parent.length; i++) {\r\n\t\t\tif(parent[i] != parentRoot)\r\n\t\t\t\tchildrens[parent[i]][idx[parent[i]]++] = i;\r\n\t\t}\r\n\r\n\t\treturn childrens;\r\n\t}\r\n\t\r\n\tstatic private int[][][] constructDirectedNeighborhood(int n, int[][] e){\r\n\t\tint[] inDegree = new int[n];\r\n\t\tint[] outDegree = new int[n];\r\n\t\tfor(int i=0; i<e.length; i++) {\r\n\t\t\tint u = e[i][0];\r\n\t\t\tint v = e[i][1];\r\n\t\t\toutDegree[u]++;\r\n\t\t\tinDegree[v]++;\r\n\t\t}\r\n\t\t\r\n\t\tint[][] inNeighbors = new int[n][];\r\n\t\tint[][] outNeighbors = new int[n][];\r\n\t\tfor(int i=0; i<n; i++) {\r\n\t\t\tinNeighbors[i] = new int[inDegree[i]];\r\n\t\t\toutNeighbors[i] = new int[outDegree[i]];\r\n\t\t}\r\n\t\t\r\n\t\tint[] inIdx = new int[n];\r\n\t\tint[] outIdx = new int[n];\r\n\t\tfor(int i=0; i<e.length; i++) {\r\n\t\t\tint u = e[i][0];\r\n\t\t\tint v = e[i][1];\r\n\t\t\toutNeighbors[u][outIdx[u]++] = v;\r\n\t\t\tinNeighbors[v][inIdx[v]++] = u;\r\n\t\t}\r\n\t\t\r\n\t\treturn new int[][][] {inNeighbors, outNeighbors};\r\n\t}\r\n\t\r\n\tstatic private int[][] constructNeighborhood(int n, int[][] e) {\r\n\t\tint[] degree = new int[n];\r\n\t\tfor(int i=0; i<e.length; i++) {\r\n\t\t\tint u = e[i][0];\r\n\t\t\tint v = e[i][1];\r\n\t\t\tdegree[u]++;\r\n\t\t\tdegree[v]++;\r\n\t\t}\r\n\t\t\r\n\t\tint[][] neighbors = new int[n][];\r\n\t\tfor(int i=0; i<n; i++)\r\n\t\t\tneighbors[i] = new int[degree[i]];\r\n\t\t\r\n\t\tint[] idx = new int[n];\r\n\t\tfor(int i=0; i<e.length; i++) {\r\n\t\t\tint u = e[i][0];\r\n\t\t\tint v = e[i][1];\r\n\t\t\tneighbors[u][idx[u]++] = v;\r\n\t\t\tneighbors[v][idx[v]++] = u;\r\n\t\t}\r\n\t\t\r\n\t\treturn neighbors;\r\n\t}\r\n\t\r\n\tstatic private void drawGraph(int[][] e) {\r\n\t\tmakeDotUndirected(e);\r\n\t\ttry {\r\n\t\t\tfinal Process process = new ProcessBuilder(\"dot\", \"-Tpng\", \"graph.dot\")\r\n\t\t\t\t\t.redirectOutput(new File(\"graph.png\"))\r\n\t\t\t\t\t.start();\r\n\t\t} catch (IOException e1) {\r\n\t\t\t// TODO Auto-generated catch block\r\n\t\t\te1.printStackTrace();\r\n\t\t}\r\n\t\t\r\n\t}\r\n\t\r\n\tstatic private void makeDotUndirected(int[][] e) {\r\n\t\tMyPrintWriter out2 = null;\r\n\t\t try {\r\n\t\t\tout2 = new MyPrintWriter(new FileOutputStream(\"graph.dot\"));\r\n\t\t} catch (FileNotFoundException e1) {\r\n\t\t\t// TODO Auto-generated catch block\r\n\t\t\te1.printStackTrace();\r\n\t\t}\r\n\t\tout2.println(\"strict graph {\");\r\n\t\tfor(int i=0; i<e.length; i++){\r\n\t\t\tout2.println(e[i][0] + \"--\" + e[i][1] + \";\");\r\n\t\t}\r\n\t\tout2.println(\"}\");\r\n\t\tout2.close();\r\n\t}\r\n\t\r\n\tstatic private void makeDotDirected(int[][] e) {\r\n\t\tMyPrintWriter out2 = null;\r\n\t\t try {\r\n\t\t\tout2 = new MyPrintWriter(new FileOutputStream(\"graph.dot\"));\r\n\t\t} catch (FileNotFoundException e1) {\r\n\t\t\t// TODO Auto-generated catch block\r\n\t\t\te1.printStackTrace();\r\n\t\t}\r\n\t\tout2.println(\"strict digraph {\");\r\n\t\tfor(int i=0; i<e.length; i++){\r\n\t\t\tout2.println(e[i][0] + \"->\" + e[i][1] + \";\");\r\n\t\t}\r\n\t\tout2.println(\"}\");\r\n\t\tout2.close();\r\n\t}\r\n\t\r\n}\r\n", "lang_cluster": "Java", "tags": ["brute force", "flows", "math", "dp", "fft", "bitmasks", "graphs", "meet-in-the-middle", "trees"], "code_uid": "21d20b4e389f3e9f4d36d8ab58e4e356", "src_uid": "4b8161259545e44c7d1046be2e4fe014", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.math.*;\nimport java.util.*;\n\npublic class E {\n\n\tstatic final int[] DX = { -1, 0, 1, 0 };\n\tstatic final int[] DY = { 0, -1, 0, 1 };\n\n\tstatic final int P = 1_000_000_007;\n\n\tstatic final int CACHE_SIZE = 1 << 19;\n\tint[] cacheInv = new int[CACHE_SIZE];\n\t{\n\t\tcacheInv[1] = 1;\n\t\tfor (int i = 2; i < CACHE_SIZE; i++) {\n\t\t\tcacheInv[i] = P - (int) ((long) (P / i) * cacheInv[P % i] % P);\n\t\t}\n\t}\n\n\tint inv(int x) {\n\t\treturn x < CACHE_SIZE ? cacheInv[x] : P\n\t\t\t\t- (int) ((long) (P / x) * inv(P % x) % P);\n\t}\n\n\tvoid submit() {\n\t\t// long start = System.currentTimeMillis();\n\t\tint r = nextInt();\n\t\tint[] byDir = new int[4];\n\t\tint sum = 0;\n\t\tfor (int i = 0; i < 4; i++) {\n\t\t\tbyDir[i] = nextInt();\n\t\t\tsum += byDir[i];\n\t\t}\n\n\t\tint invSum = inv(sum);\n\n\t\tfor (int i = 0; i < 4; i++) {\n\t\t\tbyDir[i] = (int) ((long) byDir[i] * invSum % P);\n\t\t}\n\n\t\tint s = 2 * r + 3;\n\n\t\tint[][] f = new int[s][s];\n\t\tint[] cx = new int[s * s];\n\t\tint[] cy = new int[s * s];\n\t\tint vars = 0;\n\t\tfor (int i = 0; i < s; i++) {\n\t\t\tfor (int j = 0; j < s; j++) {\n\t\t\t\tint sum2 = (i - r - 1) * (i - r - 1) + (j - r - 1)\n\t\t\t\t\t\t* (j - r - 1);\n\t\t\t\tif (sum2 <= r * r) {\n\t\t\t\t\tcx[vars] = i;\n\t\t\t\t\tcy[vars] = j;\n\t\t\t\t\tf[i][j] = vars++;\n\t\t\t\t} else {\n\t\t\t\t\tf[i][j] = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint band = 0;\n\n\t\tfor (int i = 0; i < vars; i++) {\n\t\t\tint x0 = cx[i];\n\t\t\tint y0 = cy[i];\n\t\t\tfor (int dir = 0; dir < 4; dir++) {\n\t\t\t\tint x1 = x0 + DX[dir];\n\t\t\t\tint y1 = y0 + DY[dir];\n\t\t\t\tif (f[x1][y1] == -1) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tint j = f[x1][y1];\n\t\t\t\tband = Math.max(band, Math.abs(i - j));\n\t\t\t}\n\t\t}\n\n\t\tint[][] bandM = new int[vars][2 * band + 1];\n\n\t\tfor (int i = 0; i < vars; i++) {\n\t\t\tint x0 = cx[i];\n\t\t\tint y0 = cy[i];\n\t\t\tfor (int dir = 0; dir < 4; dir++) {\n\t\t\t\tint x1 = x0 + DX[dir];\n\t\t\t\tint y1 = y0 + DY[dir];\n\t\t\t\tif (f[x1][y1] == -1) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tint j = f[x1][y1];\n\n\t\t\t\tupdateBandedMatrix(i, j, band, bandM, byDir[dir]);\n\n\t\t\t}\n\t\t}\n\n\t\tfor (int i = 0; i < vars; i++) {\n\t\t\tfor (int d = 0; d <= 2 * band; d++) {\n\t\t\t\tint j = i + d - band;\n\t\t\t\tbandM[i][d] = (i == j ? 1 : 0) - bandM[i][d];\n\t\t\t\tif (bandM[i][d] < 0) {\n\t\t\t\t\tbandM[i][d] += P;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// out.println(System.currentTimeMillis() - start);\n\n\t\tint[] ans = inverseBanded(bandM, band, f[r + 1][r + 1]);\n\n\t\t// out.println(System.currentTimeMillis() - start);\n\n\t\tint ret = 0;\n\t\tfor (int x : ans) {\n\t\t\tret += x;\n\t\t\tif (ret >= P) {\n\t\t\t\tret -= P;\n\t\t\t}\n\t\t}\n\n\t\tout.println(ret);\n\n\t}\n\n\tvoid updateBandedMatrix(int row, int col, int width, int[][] m, double delta) {\n\t\tif (Math.abs(row - col) > width) {\n\t\t\tthrow new AssertionError();\n\t\t}\n\t\tm[row][col - row + width] += delta;\n\t}\n\n\tint[] inverseBanded(int[][] a, int w, int whatCol) {\n\t\tint n = a.length;\n\t\tif (whatCol > n) {\n\t\t\tthrow new AssertionError();\n\t\t}\n\t\tint[] b = new int[n];\n\t\tb[whatCol] = 1;\n\n\t\tfor (int j = 0; j < n; j++) {\n\t\t\tint[] aj = a[j];\n\t\t\tfor (int i = j + 1; i <= j + w && i < n; i++) {\n\t\t\t\tint[] ai = a[i];\n\t\t\t\tint coef = (int) ((long) ai[j - i + w] * inv(aj[w]) % P);\n\t\t\t\t\n\t\t\t\tif (coef == 0) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tint kwiUpTo = Math.min(n, j + w + 1) + w - i;\n\t\t\t\t\n//\t\t\t\tfor (int k = j + 1, kwi = (j + 1) + w - i; k < kUpTo; k++, kwi++) {\n\t\t\t\tfor (int kwi = (j + 1) + w - i; kwi < kwiUpTo; kwi++) {\n\t\t\t\t\tint kek = ai[kwi]\n\t\t\t\t\t\t\t- (int) ((long) aj[kwi + i - j] * coef % P);\n\t\t\t\t\tif (kek < 0) {\n\t\t\t\t\t\tkek += P;\n\t\t\t\t\t}\n\t\t\t\t\tai[kwi] = kek;\n\t\t\t\t}\n\t\t\t\tb[i] -= (int) ((long) b[j] * coef % P);\n\t\t\t\tif (b[i] < 0) {\n\t\t\t\t\tb[i] += P;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (int i = n - 1; i >= 0; i--) {\n\t\t\tlong tot = 0;\n\t\t\tfor (int j = i + 1; j < n && j <= i + w; j++) {\n\t\t\t\ttot += (long) b[j] * a[i][j - i + w];\n\t\t\t\tif (tot >= P2) {\n\t\t\t\t\ttot -= P2;\n\t\t\t\t}\n\t\t\t}\n\t\t\tb[i] -= (int) (tot % P);\n\t\t\tif (b[i] < 0) {\n\t\t\t\tb[i] += P;\n\t\t\t}\n\t\t\tb[i] = (int) ((long) b[i] * inv(a[i][w]) % P);\n\t\t}\n\n\t\treturn b;\n\t}\n\n\tstatic final long P2 = (long) P * P;\n\n\tvoid preCalc() {\n\n\t}\n\n\tvoid test() {\n\n\t}\n\n\tvoid stress() {\n\t\tfor (int tst = 0;; tst++) {\n\t\t\tif (false) {\n\t\t\t\tthrow new AssertionError();\n\t\t\t}\n\t\t\tSystem.err.println(tst);\n\t\t}\n\t}\n\n\tE() throws IOException {\n\t\tis = System.in;\n\t\tout = new PrintWriter(System.out);\n\t\tpreCalc();\n\t\tsubmit();\n\t\t// stress();\n\t\t// test();\n\t\tout.close();\n\t}\n\n\tstatic final Random rng = new Random();\n\tstatic final int C = 5;\n\n\tstatic int rand(int l, int r) {\n\t\treturn l + rng.nextInt(r - l + 1);\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew E();\n\t}\n\n\tprivate InputStream is;\n\tPrintWriter out;\n\n\tprivate byte[] buf = new byte[1 << 14];\n\tprivate int bufSz = 0, bufPtr = 0;\n\n\tprivate int readByte() {\n\t\tif (bufSz == -1)\n\t\t\tthrow new RuntimeException(\"Reading past EOF\");\n\t\tif (bufPtr >= bufSz) {\n\t\t\tbufPtr = 0;\n\t\t\ttry {\n\t\t\t\tbufSz = is.read(buf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\t\tif (bufSz <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buf[bufPtr++];\n\t}\n\n\tprivate boolean isTrash(int c) {\n\t\treturn c < 33 || c > 126;\n\t}\n\n\tprivate int skip() {\n\t\tint b;\n\t\twhile ((b = readByte()) != -1 && isTrash(b))\n\t\t\t;\n\t\treturn b;\n\t}\n\n\tString nextToken() {\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile (!isTrash(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tString nextString() {\n\t\tint b = readByte();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile (!isTrash(b) || b == ' ') {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tdouble nextDouble() {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n\n\tchar nextChar() {\n\t\treturn (char) skip();\n\t}\n\n\tint nextInt() {\n\t\tint ret = 0;\n\t\tint b = skip();\n\t\tif (b != '-' && (b < '0' || b > '9')) {\n\t\t\tthrow new InputMismatchException();\n\t\t}\n\t\tboolean neg = false;\n\t\tif (b == '-') {\n\t\t\tneg = true;\n\t\t\tb = readByte();\n\t\t}\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tret = ret * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\tif (b != -1 && !isTrash(b)) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\treturn neg ? -ret : ret;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tlong nextLong() {\n\t\tlong ret = 0;\n\t\tint b = skip();\n\t\tif (b != '-' && (b < '0' || b > '9')) {\n\t\t\tthrow new InputMismatchException();\n\t\t}\n\t\tboolean neg = false;\n\t\tif (b == '-') {\n\t\t\tneg = true;\n\t\t\tb = readByte();\n\t\t}\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tret = ret * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\tif (b != -1 && !isTrash(b)) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\treturn neg ? -ret : ret;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n}\n", "lang_cluster": "Java", "tags": ["math"], "code_uid": "d85c225d33d9238f97265585ed89c404", "src_uid": "bd6bcb5bffd039de93f217b02f5eae17", "difficulty": 3100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n\n\n\n\n\npublic class Main {\n\t\n\n\tpublic static class FastReader {\n\t\tBufferedReader br;\n\t\tStringTokenizer root;\n\t\t\n \n\t\tpublic FastReader() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n \n\t\tString next() {\n\t\t\twhile (root == null || !root.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\troot = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (Exception addd) {\n\t\t\t\t\taddd.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn root.nextToken();\n\t\t}\n \n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n \n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n \n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n \n\t\tString nextLine() {\n\t\t\tString str = \"\";\n\t\t\ttry {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (Exception addd) {\n\t\t\t\taddd.printStackTrace();\n\t\t\t}\n\t\t\treturn str;\n\t\t}\n\t}\n\t\n\tpublic static PrintWriter out = new PrintWriter (new BufferedOutputStream(System.out));\n\t\n\tpublic static FastReader sc = new FastReader();\n \n\tstatic int mod = (int) (1e9+7),MAX=(int) (2e5);\n static List<Integer>[] edges;\n\t\n\tpublic static void main(String[] args){\n\t\t int b = sc.nextInt();\n\t\t int d = sc.nextInt();\n\t\t char[] a = sc.next().toCharArray();\n\t\t char[] c = sc.next().toCharArray();\n\t\t int m = a.length;\n\t\t int n = c.length;\n\t\t int[] dp = new int[n]; // starting from i idx max len of C we can match in A\n\t\t for(int i=0;i<n;++i) {\n\t\t\t int cnt = 0;\n\t\t\t for(int j=0;j<m;++j) {\n\t\t\t\t if(c[(i+cnt)%n] == a[j]) ++cnt;\n\t\t\t }\n\t\t\t dp[i] = cnt;\n\t\t }\n\t\t \n\t\t long totalChars = 0;\n\t\t int idx = 0;\n\t\t for(int i=1;i<=b;++i) {\n\t\t\t totalChars+=dp[idx];\n\t\t\t idx = (idx + dp[idx])%n;\n\t\t }\n\t\t long strs = totalChars/n;\n\t\t long p = strs/d;\n\t\t out.print(p);\n\t\t \n\t out.close();\n\t}\n\n}\n\n\n\n", "lang_cluster": "Java", "tags": ["dfs and similar", "strings"], "code_uid": "7c6418493feab4be506bdeadb0fea9e7", "src_uid": "5ea0351ac9f949dedae1928bfb7ebffa", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.util.*;\n\npublic class TaskD {\n public static void main(String[] args) {\n new TaskD().solve();\n }\n\n TaskD() {\n }\n\n int b, d, lenA, lenC;\n String a, c;\n int[][] next, delta;\n\n public void solve() {\n Scanner in = new Scanner(System.in);\n b = in.nextInt();\n d = in.nextInt();\n a = in.next();\n c = in.next();\n\n lenA = a.length();\n lenC = c.length();\n\n next = new int[lenA][lenC];\n delta = new int[lenA][lenC];\n for (int i = 0; i < lenA; ++i) {\n Arrays.fill(next[i], -1);\n Arrays.fill(delta[i], -1);\n\n for (int j = 0; j < lenC; ++j) {\n if (a.charAt(i) != c.charAt(j)) continue;\n\n int l = 1, dd = 0, lastL = 0;\n while (l <= lenA) {\n int ii = (i + l) % lenA;\n int jj = (j + dd + 1) % lenC;\n if (a.charAt(ii) == c.charAt(jj)) {\n ++dd;\n lastL = l;\n }\n ++l;\n }\n\n if (lastL > 0) {\n next[i][j] = lastL;\n delta[i][j] = dd;\n }\n }\n }\n\n int cnt = 0, i = 0, j = 0;\n while (i < lenA && next[i][j] == -1) ++i;\n if (i >= lenA || next[i][j] == -1) {\n System.out.println(0);\n return;\n }\n\n while (next[i % lenA][j] != -1 && i + next[i % lenA][j] < lenA * b) {\n assert a.charAt(i % lenA) == c.charAt(j);\n int ii = i % lenA;\n int jj = j;\n cnt += delta[ii][jj];\n i += next[ii][jj];\n j = (j + delta[ii][jj]) % lenC;\n }\n\n if (next[i % lenA][j] != -1) {\n while (i < lenA * b) {\n if (a.charAt(i % lenA) == c.charAt(j)) {\n ++cnt;\n j = (j + 1) % lenC;\n }\n ++i;\n }\n }\n\n System.out.println(cnt / (d * lenC));\n }\n}\n\n", "lang_cluster": "Java", "tags": ["dfs and similar", "strings"], "code_uid": "688950b9b6bd93144a11120a0c41a4a1", "src_uid": "5ea0351ac9f949dedae1928bfb7ebffa", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class D {\n\t\n\tprivate static StringTokenizer tokenizer;\n private static BufferedReader bf;\n private static PrintWriter out;\n \n\tprivate static int nextInt() throws IOException {\n \treturn Integer.parseInt(nextToken());\n }\n \n private static String nextToken() throws IOException {\n \twhile(tokenizer == null || !tokenizer.hasMoreTokens()) {\n \t\ttokenizer = new StringTokenizer(bf.readLine());\n \t}\n \treturn tokenizer.nextToken();\n }\n \n\tpublic static void main(String[] args) throws IOException {\n\t\tbf = new BufferedReader(new InputStreamReader(System.in));\n \ttokenizer = null;\n \tout = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n \tint b = nextInt(); int d = nextInt();\n \tString a = nextToken(); String c = nextToken();\n \tint la = a.length(); int lc = c.length();\n \tint[] pos = new int[lc+1]; int[] res = new int[lc+1];\n \tint ind, ans;\n \tfor(int i = 0; i < lc; i++) {\n \t\tind = i;\n \t\tfor(int j = 0; j < la; j++) {\n \t\t\tif(a.charAt(j) == c.charAt(ind)) ind++;\n \t\t\tif(ind == lc) {\n \t\t\t\tind = 0; res[i]++;\n \t\t\t}\n \t\t}\n \t\tpos[i] = ind;\n \t}\n \tind = ans = 0;\n \tfor(int i = 0; i < b; i++) {\n \t\tans += res[ind];\n \t\tind = pos[ind];\n \t}\n \tout.println(ans/d);\n \tout.close();\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["dfs and similar", "strings"], "code_uid": "c21a60193ca73cd2a8941bad1184d2a8", "src_uid": "5ea0351ac9f949dedae1928bfb7ebffa", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.BufferedReader;\r\nimport java.io.IOException;\r\nimport java.io.InputStreamReader;\r\n\r\npublic class F {\r\n \r\n static int N = 250;\r\n static int M = 28;\r\n static int INF = (int) 1e9;\r\n static int[][][][] dp = new int[2][M * 2 + 1][N][N];\r\n \r\n public static void main(String[] args) throws IOException {\r\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\r\n StringBuilder sb = new StringBuilder(br.readLine());\r\n String s = sb.reverse().append(\"0\").toString(); \r\n \r\n for (int carry = 0; carry < M * 2 + 1; carry++) {\r\n for (int cp = 0; cp < N; cp++) {\r\n for (int cn = 0; cn < N; cn++) {\r\n dp[0][carry][cp][cn] = INF;\r\n }\r\n }\r\n }\r\n dp[0][M][N - 1][N - 1] = 0;\r\n \r\n for (int i = 0; i < s.length(); i++) {\r\n for (int carry = 0; carry < M * 2 + 1; carry++) {\r\n for (int cp = 0; cp < N; cp++) {\r\n for (int cn = 0; cn < N; cn++) {\r\n dp[1][carry][cp][cn] = INF;\r\n }\r\n }\r\n }\r\n for (int carry = 0; carry < M * 2 + 1; carry++) {\r\n for (int cp = N - 1; cp >= 0; cp--) {\r\n for (int cn = N - 1; cn >= 0; cn--) {\r\n if (dp[0][carry][cp][cn] != INF) {\r\n if (cp > 0) {\r\n dp[0][carry][cp - 1][cn] = Math.min(dp[0][carry][cp - 1][cn], dp[0][carry][cp][cn]);\r\n }\r\n if (cn > 0) {\r\n dp[0][carry][cp][cn - 1] = Math.min(dp[0][carry][cp][cn - 1], dp[0][carry][cp][cn]);\r\n }\r\n int rcarry = carry - M;\r\n int val = rcarry + cp - cn;\r\n int digit = val % 10;\r\n if (digit < 0) {\r\n digit += 10;\r\n }\r\n int ncarry = val / 10;\r\n if (val < 0 && digit != 0) {\r\n --ncarry;\r\n }\r\n if (digit == s.charAt(i) - '0') {\r\n dp[1][ncarry + M][cp][cn] = Math.min(dp[1][ncarry + M][cp][cn],\r\n dp[0][carry][cp][cn] + cp + cn);\r\n }\r\n }\r\n }\r\n }\r\n }\r\n int[][][] tmp = dp[0];\r\n dp[0] = dp[1];\r\n dp[1] = tmp;\r\n }\r\n \r\n int ans = INF;\r\n for (int i = 0; i < N; i++) {\r\n for (int j = 0; j < N; j++) {\r\n ans = Math.min(ans, dp[0][M][i][j]);\r\n }\r\n }\r\n System.out.println(ans);\r\n }\r\n \r\n}", "lang_cluster": "Java", "tags": ["greedy", "dp", "shortest paths"], "code_uid": "63cbe329c81dfe90b3dbff414bf88b1d", "src_uid": "1961e7c9120ff652b15cad5dd5ca0907", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "//package ecr104;\r\n\r\nimport java.io.*;\r\nimport java.util.ArrayDeque;\r\nimport java.util.Arrays;\r\nimport java.util.InputMismatchException;\r\nimport java.util.Queue;\r\n\r\npublic class F {\r\n\tInputStream is;\r\n\tFastWriter out;\r\n//\tString INPUT = \"11451481091145148109114514810911451481091145148109\";\r\n//\tString INPUT = \"99999999999999999999999999999999999999999999999999\";\r\n//\tString INPUT = \"37373737373737373737373737373737373737373737373737\";\r\n\tString INPUT = \"\";\r\n\r\n\tvoid solve()\r\n\t{\r\n\t\tchar[] N = (\"000\" + ns()).toCharArray();\r\n\t\tint n = N.length;\r\n\t\tfinal int D = 50;\r\n\t\tfinal int B = 1200;\r\n\t\tint[][] dp = new int[D][B]; // delta from ideal, previous balance = #\r\n\t\tfinal int O = 500;\r\n\t\tfinal int Q = 25;\r\n\t\tfinal int I = 9999999;\r\n\t\tfor(int i = 0;i < D;i++)Arrays.fill(dp[i], I);\r\n\t\tdp[Q][O] = 0;\r\n\t\tfor(int d = 0;d < n;d++){\r\n\t\t\tint[][] ndp = new int[D][B]; // delta from ideal, previous balance = #\r\n\t\t\tfor(int i = 0;i < D;i++)Arrays.fill(ndp[i], I);\r\n\r\n\t\t\tfor(int i = 0;i < D;i++) {\r\n\t\t\t\tfor (int j = 0; j < B; j++) {\r\n\t\t\t\t\tif (dp[i][j] >= I) continue;\r\n\t\t\t\t\tint del = (i - Q) * 10 + j - O - (N[d] - '0');\r\n\t\t\t\t\tfor (int k = -11; k <= 11; k++) {\r\n\t\t\t\t\t\tif (0 <= del + k + Q && del + k + Q < D) {\r\n\t\t\t\t\t\t\tndp[del + k + Q][j + k] = Math.min(ndp[del + k + Q][j + k],\r\n\t\t\t\t\t\t\t\t\tdp[i][j] + Math.abs(k) * (n - d));\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\r\n\t\t\t}\r\n\r\n\t\t\tdp = ndp;\r\n\t\t}\r\n\r\n\t\tint ans = Integer.MAX_VALUE;\r\n\t\tfor(int j = 0;j < B;j++){\r\n\t\t\tans = Math.min(ans, dp[Q][j]);\r\n\t\t}\r\n\t\tout.println(ans);\r\n\t}\r\n\t\r\n\tvoid run() throws Exception\r\n\t{\r\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\r\n\t\tout = new FastWriter(System.out);\r\n\t\t\r\n\t\tlong s = System.currentTimeMillis();\r\n\t\tsolve();\r\n\t\tout.flush();\r\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\r\n\t}\r\n\t\r\n\tpublic static void main(String[] args) throws Exception { new F().run(); }\r\n\t\r\n\tprivate byte[] inbuf = new byte[1024];\r\n\tpublic int lenbuf = 0, ptrbuf = 0;\r\n\t\r\n\tprivate int readByte()\r\n\t{\r\n\t\tif(lenbuf == -1)throw new InputMismatchException();\r\n\t\tif(ptrbuf >= lenbuf){\r\n\t\t\tptrbuf = 0;\r\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\r\n\t\t\tif(lenbuf <= 0)return -1;\r\n\t\t}\r\n\t\treturn inbuf[ptrbuf++];\r\n\t}\r\n\t\r\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\r\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\r\n\t\r\n\tprivate double nd() { return Double.parseDouble(ns()); }\r\n\tprivate char nc() { return (char)skip(); }\r\n\t\r\n\tprivate String ns()\r\n\t{\r\n\t\tint b = skip();\r\n\t\tStringBuilder sb = new StringBuilder();\r\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\r\n\t\t\tsb.appendCodePoint(b);\r\n\t\t\tb = readByte();\r\n\t\t}\r\n\t\treturn sb.toString();\r\n\t}\r\n\t\r\n\tprivate char[] ns(int n)\r\n\t{\r\n\t\tchar[] buf = new char[n];\r\n\t\tint b = skip(), p = 0;\r\n\t\twhile(p < n && !(isSpaceChar(b))){\r\n\t\t\tbuf[p++] = (char)b;\r\n\t\t\tb = readByte();\r\n\t\t}\r\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\r\n\t}\r\n\r\n\tprivate int[] na(int n)\r\n\t{\r\n\t\tint[] a = new int[n];\r\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\r\n\t\treturn a;\r\n\t}\r\n\r\n\tprivate long[] nal(int n)\r\n\t{\r\n\t\tlong[] a = new long[n];\r\n\t\tfor(int i = 0;i < n;i++)a[i] = nl();\r\n\t\treturn a;\r\n\t}\r\n\r\n\tprivate char[][] nm(int n, int m) {\r\n\t\tchar[][] map = new char[n][];\r\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\r\n\t\treturn map;\r\n\t}\r\n\r\n\tprivate int[][] nmi(int n, int m) {\r\n\t\tint[][] map = new int[n][];\r\n\t\tfor(int i = 0;i < n;i++)map[i] = na(m);\r\n\t\treturn map;\r\n\t}\r\n\r\n\tprivate int ni() { return (int)nl(); }\r\n\r\n\tprivate long nl()\r\n\t{\r\n\t\tlong num = 0;\r\n\t\tint b;\r\n\t\tboolean minus = false;\r\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\r\n\t\tif(b == '-'){\r\n\t\t\tminus = true;\r\n\t\t\tb = readByte();\r\n\t\t}\r\n\r\n\t\twhile(true){\r\n\t\t\tif(b >= '0' && b <= '9'){\r\n\t\t\t\tnum = num * 10 + (b - '0');\r\n\t\t\t}else{\r\n\t\t\t\treturn minus ? -num : num;\r\n\t\t\t}\r\n\t\t\tb = readByte();\r\n\t\t}\r\n\t}\r\n\r\n\tpublic static class FastWriter\r\n\t{\r\n\t\tprivate static final int BUF_SIZE = 1<<13;\r\n\t\tprivate final byte[] buf = new byte[BUF_SIZE];\r\n\t\tprivate final OutputStream out;\r\n\t\tprivate int ptr = 0;\r\n\r\n\t\tprivate FastWriter(){out = null;}\r\n\r\n\t\tpublic FastWriter(OutputStream os)\r\n\t\t{\r\n\t\t\tthis.out = os;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter(String path)\r\n\t\t{\r\n\t\t\ttry {\r\n\t\t\t\tthis.out = new FileOutputStream(path);\r\n\t\t\t} catch (FileNotFoundException e) {\r\n\t\t\t\tthrow new RuntimeException(\"FastWriter\");\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(byte b)\r\n\t\t{\r\n\t\t\tbuf[ptr++] = b;\r\n\t\t\tif(ptr == BUF_SIZE)innerflush();\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(char c)\r\n\t\t{\r\n\t\t\treturn write((byte)c);\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(char[] s)\r\n\t\t{\r\n\t\t\tfor(char c : s){\r\n\t\t\t\tbuf[ptr++] = (byte)c;\r\n\t\t\t\tif(ptr == BUF_SIZE)innerflush();\r\n\t\t\t}\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(String s)\r\n\t\t{\r\n\t\t\ts.chars().forEach(c -> {\r\n\t\t\t\tbuf[ptr++] = (byte)c;\r\n\t\t\t\tif(ptr == BUF_SIZE)innerflush();\r\n\t\t\t});\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tprivate static int countDigits(int l) {\r\n\t\t\tif (l >= 1000000000) return 10;\r\n\t\t\tif (l >= 100000000) return 9;\r\n\t\t\tif (l >= 10000000) return 8;\r\n\t\t\tif (l >= 1000000) return 7;\r\n\t\t\tif (l >= 100000) return 6;\r\n\t\t\tif (l >= 10000) return 5;\r\n\t\t\tif (l >= 1000) return 4;\r\n\t\t\tif (l >= 100) return 3;\r\n\t\t\tif (l >= 10) return 2;\r\n\t\t\treturn 1;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(int x)\r\n\t\t{\r\n\t\t\tif(x == Integer.MIN_VALUE){\r\n\t\t\t\treturn write((long)x);\r\n\t\t\t}\r\n\t\t\tif(ptr + 12 >= BUF_SIZE)innerflush();\r\n\t\t\tif(x < 0){\r\n\t\t\t\twrite((byte)'-');\r\n\t\t\t\tx = -x;\r\n\t\t\t}\r\n\t\t\tint d = countDigits(x);\r\n\t\t\tfor(int i = ptr + d - 1;i >= ptr;i--){\r\n\t\t\t\tbuf[i] = (byte)('0'+x%10);\r\n\t\t\t\tx /= 10;\r\n\t\t\t}\r\n\t\t\tptr += d;\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tprivate static int countDigits(long l) {\r\n\t\t\tif (l >= 1000000000000000000L) return 19;\r\n\t\t\tif (l >= 100000000000000000L) return 18;\r\n\t\t\tif (l >= 10000000000000000L) return 17;\r\n\t\t\tif (l >= 1000000000000000L) return 16;\r\n\t\t\tif (l >= 100000000000000L) return 15;\r\n\t\t\tif (l >= 10000000000000L) return 14;\r\n\t\t\tif (l >= 1000000000000L) return 13;\r\n\t\t\tif (l >= 100000000000L) return 12;\r\n\t\t\tif (l >= 10000000000L) return 11;\r\n\t\t\tif (l >= 1000000000L) return 10;\r\n\t\t\tif (l >= 100000000L) return 9;\r\n\t\t\tif (l >= 10000000L) return 8;\r\n\t\t\tif (l >= 1000000L) return 7;\r\n\t\t\tif (l >= 100000L) return 6;\r\n\t\t\tif (l >= 10000L) return 5;\r\n\t\t\tif (l >= 1000L) return 4;\r\n\t\t\tif (l >= 100L) return 3;\r\n\t\t\tif (l >= 10L) return 2;\r\n\t\t\treturn 1;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(long x)\r\n\t\t{\r\n\t\t\tif(x == Long.MIN_VALUE){\r\n\t\t\t\treturn write(\"\" + x);\r\n\t\t\t}\r\n\t\t\tif(ptr + 21 >= BUF_SIZE)innerflush();\r\n\t\t\tif(x < 0){\r\n\t\t\t\twrite((byte)'-');\r\n\t\t\t\tx = -x;\r\n\t\t\t}\r\n\t\t\tint d = countDigits(x);\r\n\t\t\tfor(int i = ptr + d - 1;i >= ptr;i--){\r\n\t\t\t\tbuf[i] = (byte)('0'+x%10);\r\n\t\t\t\tx /= 10;\r\n\t\t\t}\r\n\t\t\tptr += d;\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(double x, int precision)\r\n\t\t{\r\n\t\t\tif(x < 0){\r\n\t\t\t\twrite('-');\r\n\t\t\t\tx = -x;\r\n\t\t\t}\r\n\t\t\tx += Math.pow(10, -precision)/2;\r\n\t\t\t//\t\tif(x < 0){ x = 0; }\r\n\t\t\twrite((long)x).write(\".\");\r\n\t\t\tx -= (long)x;\r\n\t\t\tfor(int i = 0;i < precision;i++){\r\n\t\t\t\tx *= 10;\r\n\t\t\t\twrite((char)('0'+(int)x));\r\n\t\t\t\tx -= (int)x;\r\n\t\t\t}\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(char c){\r\n\t\t\treturn write(c).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(int x){\r\n\t\t\treturn write(x).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(long x){\r\n\t\t\treturn write(x).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(double x, int precision){\r\n\t\t\treturn write(x, precision).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(int... xs)\r\n\t\t{\r\n\t\t\tboolean first = true;\r\n\t\t\tfor(int x : xs) {\r\n\t\t\t\tif (!first) write(' ');\r\n\t\t\t\tfirst = false;\r\n\t\t\t\twrite(x);\r\n\t\t\t}\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(long... xs)\r\n\t\t{\r\n\t\t\tboolean first = true;\r\n\t\t\tfor(long x : xs) {\r\n\t\t\t\tif (!first) write(' ');\r\n\t\t\t\tfirst = false;\r\n\t\t\t\twrite(x);\r\n\t\t\t}\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln()\r\n\t\t{\r\n\t\t\treturn write((byte)'\\n');\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(int... xs)\r\n\t\t{\r\n\t\t\treturn write(xs).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(long... xs)\r\n\t\t{\r\n\t\t\treturn write(xs).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(char[] line)\r\n\t\t{\r\n\t\t\treturn write(line).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(char[]... map)\r\n\t\t{\r\n\t\t\tfor(char[] line : map)write(line).writeln();\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(String s)\r\n\t\t{\r\n\t\t\treturn write(s).writeln();\r\n\t\t}\r\n\r\n\t\tprivate void innerflush()\r\n\t\t{\r\n\t\t\ttry {\r\n\t\t\t\tout.write(buf, 0, ptr);\r\n\t\t\t\tptr = 0;\r\n\t\t\t} catch (IOException e) {\r\n\t\t\t\tthrow new RuntimeException(\"innerflush\");\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tpublic void flush()\r\n\t\t{\r\n\t\t\tinnerflush();\r\n\t\t\ttry {\r\n\t\t\t\tout.flush();\r\n\t\t\t} catch (IOException e) {\r\n\t\t\t\tthrow new RuntimeException(\"flush\");\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tpublic FastWriter print(byte b) { return write(b); }\r\n\t\tpublic FastWriter print(char c) { return write(c); }\r\n\t\tpublic FastWriter print(char[] s) { return write(s); }\r\n\t\tpublic FastWriter print(String s) { return write(s); }\r\n\t\tpublic FastWriter print(int x) { return write(x); }\r\n\t\tpublic FastWriter print(long x) { return write(x); }\r\n\t\tpublic FastWriter print(double x, int precision) { return write(x, precision); }\r\n\t\tpublic FastWriter println(char c){ return writeln(c); }\r\n\t\tpublic FastWriter println(int x){ return writeln(x); }\r\n\t\tpublic FastWriter println(long x){ return writeln(x); }\r\n\t\tpublic FastWriter println(double x, int precision){ return writeln(x, precision); }\r\n\t\tpublic FastWriter print(int... xs) { return write(xs); }\r\n\t\tpublic FastWriter print(long... xs) { return write(xs); }\r\n\t\tpublic FastWriter println(int... xs) { return writeln(xs); }\r\n\t\tpublic FastWriter println(long... xs) { return writeln(xs); }\r\n\t\tpublic FastWriter println(char[] line) { return writeln(line); }\r\n\t\tpublic FastWriter println(char[]... map) { return writeln(map); }\r\n\t\tpublic FastWriter println(String s) { return writeln(s); }\r\n\t\tpublic FastWriter println() { return writeln(); }\r\n\t}\r\n\r\n\tpublic void trnz(int... o)\r\n\t{\r\n\t\tfor(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+\":\"+o[i]+\" \");\r\n\t\tSystem.out.println();\r\n\t}\r\n\r\n\t// print ids which are 1\r\n\tpublic void trt(long... o)\r\n\t{\r\n\t\tQueue<Integer> stands = new ArrayDeque<>();\r\n\t\tfor(int i = 0;i < o.length;i++){\r\n\t\t\tfor(long x = o[i];x != 0;x &= x-1)stands.add(i<<6|Long.numberOfTrailingZeros(x));\r\n\t\t}\r\n\t\tSystem.out.println(stands);\r\n\t}\r\n\r\n\tpublic void tf(boolean... r)\r\n\t{\r\n\t\tfor(boolean x : r)System.out.print(x?'#':'.');\r\n\t\tSystem.out.println();\r\n\t}\r\n\r\n\tpublic void tf(boolean[]... b)\r\n\t{\r\n\t\tfor(boolean[] r : b) {\r\n\t\t\tfor(boolean x : r)System.out.print(x?'#':'.');\r\n\t\t\tSystem.out.println();\r\n\t\t}\r\n\t\tSystem.out.println();\r\n\t}\r\n\r\n\tpublic void tf(long[]... b)\r\n\t{\r\n\t\tif(INPUT.length() != 0) {\r\n\t\t\tfor (long[] r : b) {\r\n\t\t\t\tfor (long x : r) {\r\n\t\t\t\t\tfor (int i = 0; i < 64; i++) {\r\n\t\t\t\t\t\tSystem.out.print(x << ~i < 0 ? '#' : '.');\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\tSystem.out.println();\r\n\t\t\t}\r\n\t\t\tSystem.out.println();\r\n\t\t}\r\n\t}\r\n\r\n\tpublic void tf(long... b)\r\n\t{\r\n\t\tif(INPUT.length() != 0) {\r\n\t\t\tfor (long x : b) {\r\n\t\t\t\tfor (int i = 0; i < 64; i++) {\r\n\t\t\t\t\tSystem.out.print(x << ~i < 0 ? '#' : '.');\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tSystem.out.println();\r\n\t\t}\r\n\t}\r\n\r\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\r\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\r\n}\r\n", "lang_cluster": "Java", "tags": ["greedy", "dp", "shortest paths"], "code_uid": "0013c91eccbc474de0220b82493d23c0", "src_uid": "1961e7c9120ff652b15cad5dd5ca0907", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "// Don't place your source in a package\r\nimport javax.swing.*;\r\nimport java.lang.reflect.Array;\r\nimport java.text.DecimalFormat;\r\nimport java.util.*;\r\nimport java.lang.*;\r\nimport java.io.*;\r\nimport java.math.*;\r\nimport java.util.stream.Stream;\r\n\r\n\r\n\r\n// Please name your class Main\r\npublic class Main {\r\n static FastScanner fs=new FastScanner();\r\n static class FastScanner {\r\n BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\r\n StringTokenizer st=new StringTokenizer(\"\");\r\n public String next() {\r\n while (!st.hasMoreElements())\r\n try {\r\n st=new StringTokenizer(br.readLine());\r\n } catch (IOException e) {\r\n e.printStackTrace();\r\n }\r\n return st.nextToken();\r\n }\r\n int Int() {\r\n return Integer.parseInt(next());\r\n }\r\n\r\n long Long() {\r\n return Long.parseLong(next());\r\n }\r\n\r\n String Str(){\r\n return next();\r\n }\r\n }\r\n\r\n\r\n public static void main (String[] args) throws java.lang.Exception {\r\n PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\r\n //reading /writing file\r\n //Scanner sc=new Scanner(new File(\"input.txt\"));\r\n //PrintWriter pr=new PrintWriter(\"output.txt\");\r\n\r\n\r\n int T=1;\r\n for(int t=0;t<T;t++){\r\n String s=Str();\r\n\r\n Solution sol=new Solution(out);\r\n sol.solution(s);\r\n }\r\n out.close();\r\n\r\n }\r\n\r\n public static int[] Arr(int n){\r\n int A[]=new int[n];\r\n for(int i=0;i<n;i++)A[i]=Int();\r\n return A;\r\n }\r\n public static int Int(){\r\n return fs.Int();\r\n }\r\n public static long Long(){\r\n return fs.Long();\r\n }\r\n public static String Str(){\r\n return fs.Str();\r\n }\r\n\r\n}\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nclass Solution{\r\n PrintWriter out;\r\n int INF=Integer.MAX_VALUE;\r\n int MOD=1000000007;\r\n public Solution(PrintWriter out){\r\n this.out=out;\r\n }\r\n\r\n long dp[][][];\r\n public void solution(String s) {\r\n dp=new long[s.length()+1][800][800];\r\n for(int i=0;i<dp.length;i++){\r\n for(int j=0;j<dp[0].length;j++)Arrays.fill(dp[i][j],-1);\r\n }\r\n long res=dfs(\"0\"+s,0,0,0);\r\n out.println(res);\r\n\r\n }\r\n\r\n public long dfs(String s,int pos,int diff,int chunk){\r\n if(pos>=s.length()){\r\n if(diff!=0)return INF;\r\n return 0;\r\n }\r\n if(chunk>350||Math.abs(diff)>350){\r\n return INF;\r\n }\r\n if(dp[pos][diff+400][chunk+400]!=-1)return dp[pos][diff+400][chunk+400];\r\n\r\n\r\n int d=s.charAt(pos)-'0';\r\n long res=INF;\r\n int newdiff=diff*10+chunk-d;\r\n for(int i=-6;i<=6;i++){\r\n long cnt=Math.abs(i)*(s.length()-pos);\r\n res=Math.min(res,cnt+dfs(s,pos+1,newdiff+i,chunk+i));\r\n }\r\n dp[pos][diff+400][chunk+400]=res;\r\n return res;\r\n }\r\n}\r\n\r\n\r\n\r\n\r\n", "lang_cluster": "Java", "tags": ["greedy", "dp", "shortest paths"], "code_uid": "244879e4dd6f9f7d13e0db86713c9778", "src_uid": "1961e7c9120ff652b15cad5dd5ca0907", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.util.*;\r\nimport java.io.*;\r\npublic class Edu104F{\r\n\tpublic static void main(String[] main) throws Exception{\r\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\r\n\t\tStringTokenizer st = new StringTokenizer(br.readLine());\r\n\t\tPrintWriter out = new PrintWriter(System.out);\r\n\t\tString s = st.nextToken();\r\n\t\tint[] num = new int[s.length()+1];\r\n\t\tnum[1] = s.charAt(0) - 48;\r\n\t\tfor(int i = 2; i <= s.length(); i++) {\r\n\t\t\tnum[i] = s.charAt(i-1) - s.charAt(i-2);\r\n\t\t}\r\n\t\tint iters = 0;\r\n\t\tboolean edit = true;\r\n\t\tint min = 10000;\r\n\t\twhile(edit) {\r\n\t\t\titers++;\r\n\t\t\tedit = false;\r\n\t\t\tfor(int i = 1; i < s.length(); i++) {\r\n\t\t\t\tif(num[i] > 5) {\r\n\t\t\t\t\tnum[i-1]++;\r\n\t\t\t\t\tnum[i] = num[i]-10;\r\n\t\t\t\t\tnum[s.length()]--;\r\n\t\t\t\t\tedit = true;\r\n\t\t\t\t}\r\n\t\t\t\telse if(num[i] == 5 && num[i-1] < 0) {\r\n\t\t\t\t\tnum[i-1]++;\r\n\t\t\t\t\tnum[i] = num[i]-10;\r\n\t\t\t\t\tnum[s.length()]--;\r\n\t\t\t\t\tedit = true;\r\n\t\t\t\t}\r\n\t\t\t\telse if(i >= 2 && num[i] == 5 && num[i-1] == 4 && num[i-2] < 0 && (num[s.length()] > 0 || num[s.length()] <= -4)) {\r\n\t\t\t\t\tnum[i-2]++;\r\n\t\t\t\t\tnum[i-1] = -5;\r\n\t\t\t\t\tnum[i] = -5;\r\n\t\t\t\t\tnum[s.length()]-=2;\r\n\t\t\t\t\tedit = true;\r\n\t\t\t\t}\r\n\t\t\t\telse if(i >= 2 && num[i] == 5 && num[i-1] == 4 && num[i-2] < 0 && num[s.length()] < -3 && num[s.length() - 1] > 0) {\r\n\t\t\t\t\tnum[i-2]++;\r\n\t\t\t\t\tnum[i-1] = -5;\r\n\t\t\t\t\tnum[i] = -5;\r\n\t\t\t\t\tnum[s.length()]-=2;\r\n\t\t\t\t\tedit = true;\r\n\t\t\t\t}\r\n\t\t\t\telse if(num[i] == 5 && num[i-1] == 5 && num[s.length()] > 1) {\r\n\t\t\t\t\tnum[i-2]++;\r\n\t\t\t\t\tnum[i-1] = -4;\r\n\t\t\t\t\tnum[i] = -5;\r\n\t\t\t\t\tnum[s.length()]-=2;\r\n\t\t\t\t\tedit = true;\r\n\t\t\t\t}\r\n\t\t\t\telse if(num[i] == 5 && num[i-1] == 5 && num[i-2] == 5) {\r\n\t\t\t\t\tnum[i-2]++;\r\n\t\t\t\t\tnum[i-1] = -4;\r\n\t\t\t\t\tnum[i] = -5;\r\n\t\t\t\t\tnum[s.length()]-=2;\r\n\t\t\t\t\tedit = true;\r\n\t\t\t\t}\r\n\t\t\t\telse if(num[i] < -5) {\r\n\t\t\t\t\tnum[i-1]--;\r\n\t\t\t\t\tnum[i] = num[i]+10;\r\n\t\t\t\t\tnum[s.length()]++;\r\n\t\t\t\t\tedit = true;\r\n\t\t\t\t}\r\n\t\t\t\telse if(num[i] == -5 && num[i-1] > 0) {\r\n\t\t\t\t\tnum[i-1]--;\r\n\t\t\t\t\tnum[i] = num[i]+10;\r\n\t\t\t\t\tnum[s.length()]++;\r\n\t\t\t\t\tedit = true;\r\n\t\t\t\t}\r\n\t\t\t\telse if(i >= 2 && num[i] == -5 && num[i-1] == -4 && (num[i-2] > 0) && (num[s.length()] < 0 || num[s.length()] >= 4)) {\r\n\t\t\t\t\tnum[i-2]--;\r\n\t\t\t\t\tnum[i-1] = 5;\r\n\t\t\t\t\tnum[i] = 5;\r\n\t\t\t\t\tnum[s.length()]+=2;\r\n\t\t\t\t\tedit = true;\r\n\t\t\t\t}\r\n\t\t\t\telse if(i >= 2 && num[i] == -5 && num[i-1] == -4 && (num[i-2] == -4 && num[i-3] > 0) && (num[s.length()] < 0 || num[s.length()] >= 4)) {\r\n\t\t\t\t\tnum[i-2]--;\r\n\t\t\t\t\tnum[i-1] = 5;\r\n\t\t\t\t\tnum[i] = 5;\r\n\t\t\t\t\tnum[s.length()]+=2;\r\n\t\t\t\t\tedit = true;\r\n\t\t\t\t}\r\n\t\t\t\telse if(i >= 2 && num[i] == -5 && num[i-1] == -4 && num[i-2] > 0 && num[s.length()] > 3 && num[s.length() - 1] < 0) {\r\n\t\t\t\t\tnum[i-2]--;\r\n\t\t\t\t\tnum[i-1] = 5;\r\n\t\t\t\t\tnum[i] = 5;\r\n\t\t\t\t\tnum[s.length()]+=2;\r\n\t\t\t\t\tedit = true;\r\n\t\t\t\t}\r\n\t\t\t\telse if(num[i] == -5 && num[i-1] == -5 && num[s.length()] < -1) {\r\n\t\t\t\t\tnum[i-2]--;\r\n\t\t\t\t\tnum[i-1] = 4;\r\n\t\t\t\t\tnum[i] = 5;\r\n\t\t\t\t\tnum[s.length()]+=2;\r\n\t\t\t\t\tedit = true;\r\n\t\t\t\t}\r\n\t\t\t\telse if(num[i] == -5 && num[i-1] == -5 && num[i-2] == -5) {\r\n\t\t\t\t\tnum[i-2]--;\r\n\t\t\t\t\tnum[i-1] = 4;\r\n\t\t\t\t\tnum[i] = 5;\r\n\t\t\t\t\tnum[s.length()]+=2;\r\n\t\t\t\t\tedit = true;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tif(num[s.length()] > 6) {\r\n\t\t\t\tnum[s.length()-1]++;\r\n\t\t\t\tnum[s.length()] -= 11;\r\n\t\t\t\tedit = true;\r\n\t\t\t}\r\n\t\t\telse if(num[s.length()] >= 5 && num[s.length() - 1] < 0) {\r\n\t\t\t\tnum[s.length()-1]++;\r\n\t\t\t\tnum[s.length()] -= 11;\r\n\t\t\t\tedit = true;\r\n\t\t\t}\r\n\t\t\telse if(s.length() >= 2 && num[s.length()] == 6 && num[s.length()-1] == 4 && num[s.length()-2] < 0) {\r\n\t\t\t\tnum[s.length()-1]++;\r\n\t\t\t\tnum[s.length()] -= 11;\r\n\t\t\t\tedit = true;\r\n\t\t\t}\r\n\t\t\telse if(num[s.length()] < -6) {\r\n\t\t\t\tnum[s.length()-1]--;\r\n\t\t\t\tnum[s.length()] += 11;\r\n\t\t\t\tedit = true;\r\n\t\t\t}\r\n\t\t\telse if(num[s.length()] <= -5 && num[s.length() - 1] > 0) {\r\n\t\t\t\tnum[s.length()-1]--;\r\n\t\t\t\tnum[s.length()] += 11;\r\n\t\t\t\tedit = true;\r\n\t\t\t}\r\n\t\t\telse if(s.length() >= 2 && num[s.length()] == -6 && num[s.length()-1] == -4 && num[s.length()-2] > 0) {\r\n\t\t\t\tnum[s.length()-1]--;\r\n\t\t\t\tnum[s.length()] += 11;\r\n\t\t\t\tedit = true;\r\n\t\t\t}\r\n\t\t\tint ans = 0;\r\n\t\t\tfor(int i = 0; i <= s.length(); i++) {\r\n\t\t\t\t//out.print(num[i] + \" \");\r\n\t\t\t\tans += (s.length() + 1 - i)*Math.abs(num[i]);\r\n\t\t\t}\r\n\t\t\tmin = Math.min(ans, min);\r\n\t\t\tif(iters > 7000000) {\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t\tint ans = 0;\r\n\t\tfor(int i = 0; i <= s.length(); i++) {\r\n\t\t\t//out.print(num[i] + \" \");\r\n\t\t\tans += (s.length() + 1 - i)*Math.abs(num[i]);\r\n\t\t}\r\n\t\tout.println(Math.min(min,ans));\r\n\t\tout.close();\r\n\t}\r\n}", "lang_cluster": "Java", "tags": ["greedy", "dp", "shortest paths"], "code_uid": "3801748a10bc16f3914f684c510d61a2", "src_uid": "1961e7c9120ff652b15cad5dd5ca0907", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.BufferedReader;\r\nimport java.io.IOException;\r\nimport java.io.InputStreamReader;\r\n\r\n/**\r\n *\r\n * @author Arles\r\n */\r\npublic class C {\r\n\r\n static int N = 250;\r\n static int M = 28;\r\n static int INF = (int) 1e9;\r\n static int[][][][] dp = new int[2][M * 2 + 1][N][N];\r\n\r\n public static void main(String[] args) throws IOException {\r\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\r\n StringBuilder sb = new StringBuilder(br.readLine());\r\n String s = sb.reverse().append(\"0\").toString(); \r\n\r\n for (int carry = 0; carry < M * 2 + 1; carry++) {\r\n for (int cp = 0; cp < N; cp++) {\r\n for (int cn = 0; cn < N; cn++) {\r\n dp[0][carry][cp][cn] = INF;\r\n }\r\n }\r\n }\r\n dp[0][M][N - 1][N - 1] = 0;\r\n\r\n for (int i = 0; i < s.length(); i++) {\r\n for (int carry = 0; carry < M * 2 + 1; carry++) {\r\n for (int cp = 0; cp < N; cp++) {\r\n for (int cn = 0; cn < N; cn++) {\r\n dp[1][carry][cp][cn] = INF;\r\n }\r\n }\r\n }\r\n for (int carry = 0; carry < M * 2 + 1; carry++) {\r\n for (int cp = N - 1; cp >= 0; cp--) {\r\n for (int cn = N - 1; cn >= 0; cn--) {\r\n if (dp[0][carry][cp][cn] != INF) {\r\n if (cp > 0) {\r\n dp[0][carry][cp - 1][cn] = Math.min(dp[0][carry][cp - 1][cn], dp[0][carry][cp][cn]);\r\n }\r\n if (cn > 0) {\r\n dp[0][carry][cp][cn - 1] = Math.min(dp[0][carry][cp][cn - 1], dp[0][carry][cp][cn]);\r\n }\r\n int rcarry = carry - M;\r\n int val = rcarry + cp - cn;\r\n int digit = val % 10;\r\n if (digit < 0) {\r\n digit += 10;\r\n }\r\n int ncarry = val / 10;\r\n if (val < 0 && digit != 0) {\r\n --ncarry;\r\n }\r\n if (digit == s.charAt(i) - '0') {\r\n dp[1][ncarry + M][cp][cn] = Math.min(dp[1][ncarry + M][cp][cn],\r\n dp[0][carry][cp][cn] + cp + cn);\r\n }\r\n }\r\n }\r\n }\r\n }\r\n int[][][] tmp = dp[0];\r\n dp[0] = dp[1];\r\n dp[1] = tmp;\r\n }\r\n\r\n int ans = INF;\r\n for (int i = 0; i < N; i++) {\r\n for (int j = 0; j < N; j++) {\r\n ans = Math.min(ans, dp[0][M][i][j]);\r\n }\r\n }\r\n System.out.println(ans);\r\n }\r\n\r\n}", "lang_cluster": "Java", "tags": ["greedy", "dp", "shortest paths"], "code_uid": "2b925466cc4f00aaf9a256c83424df2d", "src_uid": "1961e7c9120ff652b15cad5dd5ca0907", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class D {\n FastScanner in;\n PrintWriter out;\n\n public static void main(String[] args) {\n new D().run();\n }\n\n void solve() throws IOException {\n int n = in.nextInt();\n long m = 1; // one is bad number\n int[] primes = new int[n + 1];\n int[] primesMin = new int[n + 1];\n int primesCnt = 0;\n int[] sieve = new int[n + 1];\n for (int i = 2; i < n + 1; i++) {\n if (sieve[i] == 0) {\n primes[primesCnt++] = i;\n if (2 * i > n) {\n m++;\n }\n int cnt = 0;\n for (int j = i; j < n + 1; j += i) {\n if (sieve[j] == 0) {\n sieve[j] = i;\n cnt++;\n }\n }\n primesMin[primesCnt - 1] = cnt;\n }\n }\n int[] prefPrimesMin = new int[n + 1];\n for (int i = 0; i < primesCnt; i++) {\n prefPrimesMin[i + 1] = prefPrimesMin[i] + primesMin[i];\n } \n boolean[] squareFree = new boolean[n + 1];\n squareFree[1] = true;\n for (int i = 2; i < n + 1; i++) {\n int prev = i / sieve[i];\n squareFree[i] = prev % sieve[i] != 0 && squareFree[prev];\n// out.print(squareFree[i] + \" \");\n }\n// out.println();\n\n int[] countPrimeInDecomposition = new int[n + 1];\n for (int i = 2; i < n + 1; i++) {\n if (sieve[i] == 0) {\n countPrimeInDecomposition[i] = 1;\n } else {\n countPrimeInDecomposition[i] = 1 + countPrimeInDecomposition[i / sieve[i]];\n }\n }\n long sum1 = 0;\n for (int i = 2; i < n + 1; i++) {\n if (!squareFree[i]) continue;\n long cnt = n / i;\n cnt *= cnt;\n if (countPrimeInDecomposition[i] % 2 == 0) {\n sum1 -= cnt;\n } else {\n sum1 += cnt;\n }\n }\n long sum0 = 2 * (n - m) * m + m * (m - 1) + 1;\n// out.println(sum0);\n long sum3 = 0;\n int p1i = -1;\n for (int pi = 0; pi < primesCnt; pi++) {\n long p2 = primes[pi];\n if (p2 * 2 > n) {\n break;\n }\n if (p2 * p2 > n) {\n if (p1i == -1) {\n p1i = pi;\n }\n while (p1i >= 0 && primes[p1i] * p2 > n) {\n p1i--;\n }\n p1i++;\n sum3 += prefPrimesMin[pi] - prefPrimesMin[p1i];\n }\n }\n sum3 *= 2;\n long sum2 = (long) n * n - sum0 - sum1 - sum3;\n// out.println(m + \" \" + sum0 + \" \" + sum1 + \" \" + sum2 + \" \" + sum3);\n out.println((sum1 + sum2 * 2 + sum3 * 3 - (n - 1)) / 2);\n }\n\n void run() {\n try {\n in = new FastScanner(System.in);\n out = new PrintWriter(System.out);\n solve();\n\n out.close();\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n\n class FastScanner {\n BufferedReader br;\n StringTokenizer st;\n\n FastScanner(InputStream is) {\n br = new BufferedReader(new InputStreamReader(is));\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["sortings", "number theory"], "code_uid": "a1059e55ee47c0b2a3701beebd6fb7f1", "src_uid": "bb1bd5d8bab7d79e514281230d484996", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class D {\n FastScanner in;\n PrintWriter out;\n\n public static void main(String[] args) {\n new D().run();\n }\n\n void solve() throws IOException {\n int n = in.nextInt();\n long m = 1; // one is bad number\n int[] primes = new int[n + 1];\n int[] primesMin = new int[n + 1];\n int primesCnt = 0;\n int[] sieve = new int[n + 1];\n for (int i = 2; i < n + 1; i++) {\n if (sieve[i] == 0) {\n primes[primesCnt++] = i;\n if (2 * i > n) {\n m++;\n }\n int cnt = 0;\n for (int j = i; j < n + 1; j += i) {\n if (sieve[j] == 0) {\n sieve[j] = i;\n cnt++;\n }\n }\n primesMin[primesCnt - 1] = cnt;\n }\n }\n int[] prefPrimesMin = new int[n + 1];\n for (int i = 0; i < primesCnt; i++) {\n prefPrimesMin[i + 1] = prefPrimesMin[i] + primesMin[i];\n } \n boolean[] squareFree = new boolean[n + 1];\n squareFree[1] = true;\n for (int i = 2; i < n + 1; i++) {\n int prev = i / sieve[i];\n squareFree[i] = prev % sieve[i] != 0 && squareFree[prev];\n// out.print(squareFree[i] + \" \");\n }\n// out.println();\n\n int[] countPrimeInDecomposition = new int[n + 1];\n for (int i = 2; i < n + 1; i++) {\n if (sieve[i] == 0) {\n countPrimeInDecomposition[i] = 1;\n } else {\n countPrimeInDecomposition[i] = 1 + countPrimeInDecomposition[i / sieve[i]];\n }\n }\n long sum1 = 0;\n for (int i = 2; i < n + 1; i++) {\n if (!squareFree[i]) continue;\n long cnt = n / i;\n cnt *= cnt;\n if (countPrimeInDecomposition[i] % 2 == 0) {\n sum1 -= cnt;\n } else {\n sum1 += cnt;\n }\n }\n long sum0 = 2 * (n - m) * m + m * (m - 1) + 1;\n// out.println(sum0);\n long sum3 = 0;\n int p1i = -1;\n for (int pi = 0; pi < primesCnt; pi++) {\n long p2 = primes[pi];\n if (p2 * 2 > n) {\n break;\n }\n if (p2 * p2 > n) {\n if (p1i == -1) {\n p1i = pi;\n }\n while (p1i >= 0 && primes[p1i] * p2 > n) {\n p1i--;\n }\n p1i++;\n sum3 += prefPrimesMin[pi] - prefPrimesMin[p1i];\n }\n }\n sum3 *= 2;\n long sum2 = (long) n * n - sum0 - sum1 - sum3;\n// out.println(m + \" \" + sum0 + \" \" + sum1 + \" \" + sum2 + \" \" + sum3);\n out.println((sum1 + sum2 * 2 + sum3 * 3 - (n - 1)) / 2);\n }\n\n void run() {\n try {\n in = new FastScanner(System.in);\n out = new PrintWriter(System.out);\n solve();\n\n out.close();\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n\n class FastScanner {\n BufferedReader br;\n StringTokenizer st;\n\n FastScanner(InputStream is) {\n br = new BufferedReader(new InputStreamReader(is));\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n }\n}", "lang_cluster": "Java", "tags": ["sortings", "number theory"], "code_uid": "c5048bf7dc8018632269c4c4c2fe7c24", "src_uid": "bb1bd5d8bab7d79e514281230d484996", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class D {\n FastScanner in;\n PrintWriter out;\n\n public static void main(String[] args) {\n new D().run();\n }\n\n void solve() throws IOException {\n int n = in.nextInt();\n long m = 1; // one is bad number\n int[] primes = new int[n + 1];\n int[] primesMin = new int[n + 1];\n int primesCnt = 0;\n int[] sieve = new int[n + 1];\n for (int i = 2; i < n + 1; i++) {\n if (sieve[i] == 0) {\n primes[primesCnt++] = i;\n if (2 * i > n) {\n m++;\n }\n int cnt = 0;\n for (int j = i; j < n + 1; j += i) {\n if (sieve[j] == 0) {\n sieve[j] = i;\n cnt++;\n }\n }\n primesMin[primesCnt - 1] = cnt;\n }\n }\n int[] prefPrimesMin = new int[n + 1];\n for (int i = 0; i < primesCnt; i++) {\n prefPrimesMin[i + 1] = prefPrimesMin[i] + primesMin[i];\n } \n boolean[] squareFree = new boolean[n + 1];\n squareFree[1] = true;\n for (int i = 2; i < n + 1; i++) {\n int prev = i / sieve[i];\n squareFree[i] = prev % sieve[i] != 0 && squareFree[prev];\n// out.print(squareFree[i] + \" \");\n }\n// out.println();\n\n int[] countPrimeInDecomposition = new int[n + 1];\n for (int i = 2; i < n + 1; i++) {\n if (sieve[i] == 0) {\n countPrimeInDecomposition[i] = 1;\n } else {\n countPrimeInDecomposition[i] = 1 + countPrimeInDecomposition[i / sieve[i]];\n }\n }\n long sum1 = 0;\n for (int i = 2; i < n + 1; i++) {\n if (!squareFree[i]) continue;\n long cnt = n / i;\n cnt *= cnt;\n if (countPrimeInDecomposition[i] % 2 == 0) {\n sum1 -= cnt;\n } else {\n sum1 += cnt;\n }\n }\n long sum0 = 2 * (n - m) * m + m * (m - 1) + 1;\n// out.println(sum0);\n long sum3 = 0;\n int p1i = -1;\n for (int pi = 0; pi < primesCnt; pi++) {\n long p2 = primes[pi];\n if (p2 * 2 > n) {\n break;\n }\n if (p2 * p2 > n) {\n if (p1i == -1) {\n p1i = pi;\n }\n while (p1i >= 0 && primes[p1i] * p2 > n) {\n p1i--;\n }\n p1i++;\n sum3 += prefPrimesMin[pi] - prefPrimesMin[p1i];\n }\n }\n sum3 *= 2;\n long sum2 = (long) n * n - sum0 - sum1 - sum3;\n// out.println(m + \" \" + sum0 + \" \" + sum1 + \" \" + sum2 + \" \" + sum3);\n out.println((sum1 + sum2 * 2 + sum3 * 3 - (n - 1)) / 2);\n }\n\n void run() {\n try {\n in = new FastScanner(System.in);\n out = new PrintWriter(System.out);\n solve();\n\n out.close();\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n\n class FastScanner {\n BufferedReader br;\n StringTokenizer st;\n\n FastScanner(InputStream is) {\n br = new BufferedReader(new InputStreamReader(is));\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n }\n}", "lang_cluster": "Java", "tags": ["sortings", "number theory"], "code_uid": "97e5fee315aafc9c7c47a0926ef354ee", "src_uid": "bb1bd5d8bab7d79e514281230d484996", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintStream;\nimport java.io.IOException;\nimport java.io.UncheckedIOException;\nimport java.io.Closeable;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) throws Exception {\n Thread thread = new Thread(null, new TaskAdapter(), \"\", 1 << 27);\n thread.start();\n thread.join();\n }\n\n static class TaskAdapter implements Runnable {\n @Override\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastInput in = new FastInput(inputStream);\n FastOutput out = new FastOutput(outputStream);\n DPaths solver = new DPaths();\n solver.solve(1, in, out);\n out.close();\n }\n }\n\n static class DPaths {\n Debug debug = new Debug(true);\n\n public void solve(int testNumber, FastInput in, FastOutput out) {\n int n = in.readInt();\n MultiplicativeFunctionSieve sieve = new MultiplicativeFunctionSieve(n, false, true, false);\n\n long twoCnt = 0;\n long threeCnt = 0;\n int[] ps = new int[n + 1];\n for (int i = 2; i <= n; i++) {\n ps[sieve.smallestPrimeFactor[i]]++;\n }\n for (int i = 1; i <= n; i++) {\n ps[i] += ps[i - 1];\n }\n for (int i = 1; i * 2 <= n; i++) {\n int num = (ps[i] - ps[i - 1]);\n\n int j = Math.min(i - 1, n / i);\n twoCnt += (long) ps[j] * num;\n\n int k = Math.min(i - 1, n / 2);\n threeCnt += (long) ps[k] * num;\n }\n for (int i = 1; i <= n; i++) {\n int num = ps[i] - ps[i - 1];\n if (i * i <= n) {\n twoCnt += (long) num * (num - 1) / 2;\n }\n if (i * 2 <= n) {\n threeCnt += (long) num * (num - 1) / 2;\n }\n }\n\n\n threeCnt -= twoCnt;\n long coprime = 0;\n for (int i = 2; i <= n; i++) {\n coprime += sieve.euler[i];\n }\n\n long notCoprime = (long) n * (n - 1) / 2 - coprime;\n long ans = twoCnt * 2 - notCoprime + threeCnt * 3;\n\n debug.debug(\"coprime\", coprime);\n debug.debug(\"twoCnt\", twoCnt);\n debug.debug(\"notCporime\", notCoprime);\n debug.debug(\"threeCnt\", threeCnt);\n out.println(ans);\n }\n\n }\n\n static class Debug {\n private boolean offline;\n private PrintStream out = System.err;\n\n public Debug(boolean enable) {\n offline = enable && System.getSecurityManager() == null;\n }\n\n public Debug debug(String name, long x) {\n if (offline) {\n debug(name, \"\" + x);\n }\n return this;\n }\n\n public Debug debug(String name, String x) {\n if (offline) {\n out.printf(\"%s=%s\", name, x);\n out.println();\n }\n return this;\n }\n\n }\n\n static class FastInput {\n private final InputStream is;\n private byte[] buf = new byte[1 << 13];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastInput(InputStream is) {\n this.is = is;\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n bufLen = -1;\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public int readInt() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n }\n\n static class FastOutput implements AutoCloseable, Closeable, Appendable {\n private StringBuilder cache = new StringBuilder(10 << 20);\n private final Writer os;\n\n public FastOutput append(CharSequence csq) {\n cache.append(csq);\n return this;\n }\n\n public FastOutput append(CharSequence csq, int start, int end) {\n cache.append(csq, start, end);\n return this;\n }\n\n public FastOutput(Writer os) {\n this.os = os;\n }\n\n public FastOutput(OutputStream os) {\n this(new OutputStreamWriter(os));\n }\n\n public FastOutput append(char c) {\n cache.append(c);\n return this;\n }\n\n public FastOutput append(long c) {\n cache.append(c);\n return this;\n }\n\n public FastOutput println(long c) {\n return append(c).println();\n }\n\n public FastOutput println() {\n cache.append(System.lineSeparator());\n return this;\n }\n\n public FastOutput flush() {\n try {\n os.append(cache);\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n return this;\n }\n\n public void close() {\n flush();\n try {\n os.close();\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n\n public String toString() {\n return cache.toString();\n }\n\n }\n\n static class MultiplicativeFunctionSieve {\n public int[] primes;\n public boolean[] isComp;\n public int primeLength;\n public int[] mobius;\n public int[] euler;\n public int[] factors;\n public int[] smallestPrimeFactor;\n public int[] numberOfSmallestPrimeFactor;\n\n public MultiplicativeFunctionSieve(int limit, boolean enableMobius, boolean enableEuler, boolean enableFactors) {\n isComp = new boolean[limit + 1];\n primes = new int[limit + 1];\n numberOfSmallestPrimeFactor = new int[limit + 1];\n smallestPrimeFactor = new int[limit + 1];\n primeLength = 0;\n for (int i = 2; i <= limit; i++) {\n if (!isComp[i]) {\n primes[primeLength++] = i;\n numberOfSmallestPrimeFactor[i] = smallestPrimeFactor[i] = i;\n }\n for (int j = 0, until = limit / i; j < primeLength && primes[j] <= until; j++) {\n int pi = primes[j] * i;\n smallestPrimeFactor[pi] = primes[j];\n numberOfSmallestPrimeFactor[pi] = smallestPrimeFactor[i] == primes[j]\n ? (numberOfSmallestPrimeFactor[i] * numberOfSmallestPrimeFactor[primes[j]])\n : numberOfSmallestPrimeFactor[primes[j]];\n isComp[pi] = true;\n if (i % primes[j] == 0) {\n break;\n }\n }\n }\n\n if (enableMobius) {\n mobius = new int[limit + 1];\n mobius[1] = 1;\n for (int i = 2; i <= limit; i++) {\n if (!isComp[i]) {\n mobius[i] = -1;\n } else {\n if (numberOfSmallestPrimeFactor[i] != smallestPrimeFactor[i]) {\n mobius[i] = 0;\n } else {\n mobius[i] = mobius[numberOfSmallestPrimeFactor[i]] * mobius[i / numberOfSmallestPrimeFactor[i]];\n }\n }\n }\n }\n\n if (enableEuler) {\n euler = new int[limit + 1];\n euler[1] = 1;\n for (int i = 2; i <= limit; i++) {\n if (!isComp[i]) {\n euler[i] = i - 1;\n } else {\n if (numberOfSmallestPrimeFactor[i] == i) {\n euler[i] = i - i / smallestPrimeFactor[i];\n } else {\n euler[i] = euler[numberOfSmallestPrimeFactor[i]] * euler[i / numberOfSmallestPrimeFactor[i]];\n }\n }\n }\n }\n\n if (enableFactors) {\n factors = new int[limit + 1];\n factors[1] = 1;\n for (int i = 2; i <= limit; i++) {\n if (!isComp[i]) {\n factors[i] = 2;\n } else {\n if (numberOfSmallestPrimeFactor[i] == i) {\n factors[i] = 1 + factors[i / smallestPrimeFactor[i]];\n } else {\n factors[i] = factors[numberOfSmallestPrimeFactor[i]]\n * factors[i / numberOfSmallestPrimeFactor[i]];\n }\n }\n }\n }\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["sortings", "number theory"], "code_uid": "3d33ddf7a44e75167939c7766add9c90", "src_uid": "bb1bd5d8bab7d79e514281230d484996", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package educational.round68;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.math.BigInteger;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n \npublic class G3 {\n\tInputStream is;\n\tPrintWriter out;\n//\tString INPUT = \"42\";\n\tString INPUT = \"\";\n\t\n\tpublic static void trnz(long... o)\n\t{\n\t\tfor(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+\":\"+o[i]+\" \");\n\t\tSystem.out.println();\n\t}\n \n\t\n\tvoid solve()\n\t{\n\t\tBigInteger n = new BigInteger(ns());\n\t\tlong ans = 0;\n\t\tfor(int i = 1;i <= 9;i++){\n\t\t\tfor(int j = 1;j <= i;j++){\n\t\t\t\tif(gcd(i, j) == 1){\n\t\t\t\t\tif(i == 1){\n\t\t\t\t\t\tans += n.mod(BigInteger.valueOf(998244353L)).longValue();\n\t\t\t\t\t}else{\n\t\t\t\t\t\tlong lans = count(n, i, j);\n\t\t\t\t\t\tif(i != j){\n\t\t\t\t\t\t\tans += lans*2;\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\tans += lans;\n\t\t\t\t\t\t}\n//\t\t\t\t\t\tif(lans > 0)tr(i, j, lans, ans);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tout.println(ans % 998244353);\n\t}\n\t\n\tlong count(BigInteger N, int u, int v)\n\t{\n\t\tchar[] s = (\"0\" + N.divide(BigInteger.valueOf(u)).add(BigInteger.ONE).toString()).toCharArray();\n\t\t\n\t\tint n = s.length;\n\t\t// u:2 v:1\n\t\t// u倍したときにt*uを含んでいるか\n\t\t// v倍したときにt*vを含んでいるか\n\t\tint w = 9/u;\n\t\tlong[][][][] dp = new long[1<<w][1<<w][10][10]; // valid carry\n\t\tlong[][][][] ep = new long[1<<w][1<<w][10][10]; // valid carry\n\t\tint mod = 998244353;\n\t\tep[0][0][0][0] = 1;\n\t\t\n\t\tint[][] va0 = new int[10][10];\n\t\tint[][] va1 = new int[10][10];\n\t\tint[][] nextc0 = new int[10][10];\n\t\tint[][] nextc1 = new int[10][10];\n\t\tfor(int d = 0;d < 10;d++){\n\t\t\tfor(int c0 = 0;c0 <= 9;c0++){\n\t\t\t\tint v0 = d*u + c0;\n\t\t\t\tfor(int t = 1;t <= w;t++){\n\t\t\t\t\tif(t*u == v0%10){\n\t\t\t\t\t\tva0[d][c0] |= 1<<t-1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tnextc0[d][c0] = v0 / 10;\n\t\t\t}\n\t\t\tfor(int c1 = 0;c1 <= 9;c1++){\n\t\t\t\tint v1 = d*v + c1;\n\t\t\t\tfor(int t = 1;t <= w;t++){\n\t\t\t\t\tif(t*v == v1%10){\n\t\t\t\t\t\tva1[d][c1] |= 1<<t-1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tnextc1[d][c1] = v1 / 10;\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor(int i = n-1;i >= 0;i--){\n\t\t\tlong[][][][] ndp = new long[1<<w][1<<w][10][10]; // valid carry\n\t\t\tlong[][][][] nep = new long[1<<w][1<<w][10][10]; // valid carry\n\t\t\t\n\t\t\tfor(int j = 0;j < 1<<w;j++){\n\t\t\t\tfor(int k = 0;k < 1<<w;k++){\n\t\t\t\t\tfor(int l = 0;l < 10;l++){\n\t\t\t\t\t\tfor(int m = 0;m < 10;m++){\n\t\t\t\t\t\t\tint d = s[i]-'0';\n\t\t\t\t\t\t\tint nj = j|va0[d][l];\n\t\t\t\t\t\t\tint nk = k|va1[d][m];\n\t\t\t\t\t\t\tint nl = nextc0[d][l];\n\t\t\t\t\t\t\tint nm = nextc1[d][m];\n\t\t\t\t\t\t\tndp[nj][nk][nl][nm] += dp[j][k][l][m];\n\t\t\t\t\t\t\tif(ndp[nj][nk][nl][nm] >= mod)ndp[nj][nk][nl][nm] -= mod;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tfor(int j = 0;j < 1<<w;j++){\n\t\t\t\tfor(int k = 0;k < 1<<w;k++){\n\t\t\t\t\tfor(int l = 0;l < 10;l++){\n\t\t\t\t\t\tfor(int m = 0;m < 10;m++){\n\t\t\t\t\t\t\tfor(int d = 0;d < 10;d++){\n\t\t\t\t\t\t\t\tint nj = j|va0[d][l];\n\t\t\t\t\t\t\t\tint nk = k|va1[d][m];\n\t\t\t\t\t\t\t\tint nl = nextc0[d][l];\n\t\t\t\t\t\t\t\tint nm = nextc1[d][m];\n\t\t\t\t\t\t\t\tnep[nj][nk][nl][nm] += ep[j][k][l][m];\n\t\t\t\t\t\t\t\tif(nep[nj][nk][nl][nm] >= mod)nep[nj][nk][nl][nm] -= mod;\n\t\t\t\t\t\t\t\tif(d < s[i]-'0'){\n\t\t\t\t\t\t\t\t\tndp[nj][nk][nl][nm] += ep[j][k][l][m];\n\t\t\t\t\t\t\t\t\tif(ndp[nj][nk][nl][nm] >= mod)ndp[nj][nk][nl][nm] -= mod;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tdp = ndp;\n\t\t\tep = nep;\n\t\t}\n\t\t\n\t\tlong ret = 0;\n\t\tfor(int i = 0;i < 1<<w;i++){\n\t\t\tfor(int j = 0;j < 1<<w;j++){\n\t\t\t\tif((i&j) != 0){\n\t\t\t\t\tret += dp[i][j][0][0];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn ret % mod;\n\t}\n\t\n\tpublic static int gcd(int a, int b) {\n\t\twhile (b > 0) {\n\t\t\tint c = a;\n\t\t\ta = b;\n\t\t\tb = c % b;\n\t\t}\n\t\treturn a;\n\t}\n\t\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new G3().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "21cba05d7b774787ffc19eb81967f895", "src_uid": "b6f2061e2ca174c2385bf4520d232aaf", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package educational.round68;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.math.BigInteger;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class G3 {\n\tInputStream is;\n\tPrintWriter out;\n//\tString INPUT = \"42\";\n\tString INPUT = \"\";\n\t\n\tpublic static void trnz(long... o)\n\t{\n\t\tfor(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+\":\"+o[i]+\" \");\n\t\tSystem.out.println();\n\t}\n\n\t\n\tvoid solve()\n\t{\n\t\tBigInteger n = new BigInteger(ns());\n\t\tlong ans = 0;\n\t\tfor(int i = 1;i <= 9;i++){\n\t\t\tfor(int j = 1;j <= i;j++){\n\t\t\t\tif(gcd(i, j) == 1){\n\t\t\t\t\tif(i == 1){\n\t\t\t\t\t\tans += n.mod(BigInteger.valueOf(998244353L)).longValue();\n\t\t\t\t\t}else{\n\t\t\t\t\t\tlong lans = count(n, i, j);\n\t\t\t\t\t\tif(i != j){\n\t\t\t\t\t\t\tans += lans*2;\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\tans += lans;\n\t\t\t\t\t\t}\n//\t\t\t\t\t\tif(lans > 0)tr(i, j, lans, ans);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tout.println(ans % 998244353);\n\t}\n\t\n\tlong count(BigInteger N, int u, int v)\n\t{\n\t\tchar[] s = (\"0\" + N.divide(BigInteger.valueOf(u)).add(BigInteger.ONE).toString()).toCharArray();\n\t\t\n\t\tint n = s.length;\n\t\t// u:2 v:1\n\t\t// u倍したときにt*uを含んでいるか\n\t\t// v倍したときにt*vを含んでいるか\n\t\tint w = 9/u;\n\t\tlong[][][][] dp = new long[1<<w][1<<w][10][10]; // valid carry\n\t\tlong[][][][] ep = new long[1<<w][1<<w][10][10]; // valid carry\n\t\tint mod = 998244353;\n\t\tep[0][0][0][0] = 1;\n\t\t\n\t\tint[][] va0 = new int[10][10];\n\t\tint[][] va1 = new int[10][10];\n\t\tint[][] nextc0 = new int[10][10];\n\t\tint[][] nextc1 = new int[10][10];\n\t\tfor(int d = 0;d < 10;d++){\n\t\t\tfor(int c0 = 0;c0 <= 9;c0++){\n\t\t\t\tint v0 = d*u + c0;\n\t\t\t\tfor(int t = 1;t <= w;t++){\n\t\t\t\t\tif(t*u == v0%10){\n\t\t\t\t\t\tva0[d][c0] |= 1<<t-1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tnextc0[d][c0] = v0 / 10;\n\t\t\t}\n\t\t\tfor(int c1 = 0;c1 <= 9;c1++){\n\t\t\t\tint v1 = d*v + c1;\n\t\t\t\tfor(int t = 1;t <= w;t++){\n\t\t\t\t\tif(t*v == v1%10){\n\t\t\t\t\t\tva1[d][c1] |= 1<<t-1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tnextc1[d][c1] = v1 / 10;\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor(int i = n-1;i >= 0;i--){\n\t\t\tlong[][][][] ndp = new long[1<<w][1<<w][10][10]; // valid carry\n\t\t\tlong[][][][] nep = new long[1<<w][1<<w][10][10]; // valid carry\n\t\t\t\n\t\t\tfor(int j = 0;j < 1<<w;j++){\n\t\t\t\tfor(int k = 0;k < 1<<w;k++){\n\t\t\t\t\tfor(int l = 0;l < 10;l++){\n\t\t\t\t\t\tfor(int m = 0;m < 10;m++){\n\t\t\t\t\t\t\tint d = s[i]-'0';\n\t\t\t\t\t\t\tint nj = j|va0[d][l];\n\t\t\t\t\t\t\tint nk = k|va1[d][m];\n\t\t\t\t\t\t\tint nl = nextc0[d][l];\n\t\t\t\t\t\t\tint nm = nextc1[d][m];\n\t\t\t\t\t\t\tndp[nj][nk][nl][nm] += dp[j][k][l][m];\n\t\t\t\t\t\t\tif(ndp[nj][nk][nl][nm] >= mod)ndp[nj][nk][nl][nm] -= mod;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tfor(int j = 0;j < 1<<w;j++){\n\t\t\t\tfor(int k = 0;k < 1<<w;k++){\n\t\t\t\t\tfor(int l = 0;l < 10;l++){\n\t\t\t\t\t\tfor(int m = 0;m < 10;m++){\n\t\t\t\t\t\t\tfor(int d = 0;d < 10;d++){\n\t\t\t\t\t\t\t\tint nj = j|va0[d][l];\n\t\t\t\t\t\t\t\tint nk = k|va1[d][m];\n\t\t\t\t\t\t\t\tint nl = nextc0[d][l];\n\t\t\t\t\t\t\t\tint nm = nextc1[d][m];\n\t\t\t\t\t\t\t\tnep[nj][nk][nl][nm] += ep[j][k][l][m];\n\t\t\t\t\t\t\t\tif(nep[nj][nk][nl][nm] >= mod)nep[nj][nk][nl][nm] -= mod;\n\t\t\t\t\t\t\t\tif(d < s[i]-'0'){\n\t\t\t\t\t\t\t\t\tndp[nj][nk][nl][nm] += ep[j][k][l][m];\n\t\t\t\t\t\t\t\t\tif(ndp[nj][nk][nl][nm] >= mod)ndp[nj][nk][nl][nm] -= mod;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tdp = ndp;\n\t\t\tep = nep;\n\t\t}\n\t\t\n\t\tlong ret = 0;\n\t\tfor(int i = 0;i < 1<<w;i++){\n\t\t\tfor(int j = 0;j < 1<<w;j++){\n\t\t\t\tif((i&j) != 0){\n\t\t\t\t\tret += dp[i][j][0][0];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn ret % mod;\n\t}\n\t\n\tpublic static int gcd(int a, int b) {\n\t\twhile (b > 0) {\n\t\t\tint c = a;\n\t\t\ta = b;\n\t\t\tb = c % b;\n\t\t}\n\t\treturn a;\n\t}\n\t\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new G3().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["dp"], "code_uid": "0c4bde0885145cbff5709a23c9bd6ff1", "src_uid": "b6f2061e2ca174c2385bf4520d232aaf", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\nimport java.io.PrintWriter;\nimport java.util.TreeMap;\npublic class E1113 \n{\n static class QN{\n int index;\n long sum;\n QN(int in,long an){\n index=in;\n sum=an;\n }\n }\n static class SegmentTree{\n long sum,pmin,lazy;\n int st,en;\n boolean rem;\n SegmentTree left,right;\n SegmentTree(int _st,int _en,long _v){\n st=_st;\n en=_en;\n lazy=_v;\n rem=true;\n sum=(en-st+1)*lazy;\n pmin=Math.min(lazy,sum);\n }\n long pmin(){\n return rem?(Math.min(lazy,(en-st+1)*lazy)):(pmin);\n }\n long sum(){\n return rem?((en-st+1)*lazy):(sum);\n }\n void update(int l,int r,long v){\n //completely outside\n if(l>en||r<st)\n return;\n //completely inside\n if(l<=st&&r>=en){\n //update lazy;\n lazy=v;\n rem=true;\n return;\n }\n //partial cover\n lazyPropagate();\n left.update(l, r, v);\n right.update(l, r, v);\n sum=left.sum()+right.sum();\n pmin=Math.min(left.pmin(),left.sum()+right.pmin());\n return;\n }\n void lazyPropagate(){\n if(left==null){\n int mid=(st+en)>>1;\n left=new SegmentTree(st,mid,lazy);\n right=new SegmentTree(mid+1,en,lazy);\n }else if(rem){\n left.lazy=lazy;\n right.lazy=lazy;\n left.rem=true;\n right.rem=true;\n }\n if(rem){\n sum=(en-st+1)*lazy;\n pmin=Math.min(lazy,sum);\n }\n rem=false;\n }\n /**returns least index which has value <= given value**/\n QN query(int l,int r,long v,long su){\n //no cover\n if(st>r||en<l)\n return new QN(-1,0);\n //full cover\n if(l<=st&&en<=r){\n if(su+pmin()<=v)\n return query2(v,su);\n return new QN(-1,su+sum());\n }\n lazyPropagate();\n \n QN q1=left.query(l,r,v,su);\n if(q1.index!=-1)\n return q1;\n q1=right.query(l,r,v,q1.sum);\n return q1; \n }\n QN query2(long v,long su){\n if(st==en)\n return new QN(st,su+sum());\n lazyPropagate();\n if(left.pmin()+su<=v)\n return left.query2(v,su);\n else\n return right.query2(v,su+left.sum());\n \n }\n \n }\n static class Scanner\n {\n BufferedReader br;\n StringTokenizer tk=new StringTokenizer(\"\");\n public Scanner(InputStream is) \n {\n br=new BufferedReader(new InputStreamReader(is));\n }\n public int nextInt() throws IOException\n {\n if(tk.hasMoreTokens())\n return Integer.parseInt(tk.nextToken());\n tk=new StringTokenizer(br.readLine());\n return nextInt();\n }\n public long nextLong() throws IOException\n {\n if(tk.hasMoreTokens())\n return Long.parseLong(tk.nextToken());\n tk=new StringTokenizer(br.readLine());\n return nextLong();\n }\n public String next() throws IOException\n {\n if(tk.hasMoreTokens())\n return (tk.nextToken());\n tk=new StringTokenizer(br.readLine());\n return next();\n }\n public String nextLine() throws IOException\n {\n tk=new StringTokenizer(\"\");\n return br.readLine();\n }\n public double nextDouble() throws IOException\n {\n if(tk.hasMoreTokens())\n return Double.parseDouble(tk.nextToken());\n tk=new StringTokenizer(br.readLine());\n return nextDouble();\n }\n public char nextChar() throws IOException\n {\n if(tk.hasMoreTokens())\n return (tk.nextToken().charAt(0));\n tk=new StringTokenizer(br.readLine());\n return nextChar();\n }\n public int[] nextIntArray(int n) throws IOException\n {\n int a[]=new int[n];\n for(int i=0;i<n;i++)\n a[i]=nextInt();\n return a;\n }\n public long[] nextLongArray(int n) throws IOException\n {\n long a[]=new long[n];\n for(int i=0;i<n;i++)\n a[i]=nextLong();\n return a;\n }\n public int[] nextIntArrayOneBased(int n) throws IOException\n {\n int a[]=new int[n+1];\n for(int i=1;i<=n;i++)\n a[i]=nextInt();\n return a;\n }\n public long[] nextLongArrayOneBased(int n) throws IOException\n {\n long a[]=new long[n+1];\n for(int i=1;i<=n;i++)\n a[i]=nextLong();\n return a;\n }\n \n \n }\n \n public static void main(String args[]) throws IOException\n {\n Scanner in=new Scanner(System.in);\n PrintWriter out=new PrintWriter(System.out);\n SegmentTree st=new SegmentTree(1,1000000000,0);\n int q=in.nextInt();\n TreeMap<Integer,Integer> mp=new TreeMap<>();\n mp.put(0,0);\n mp.put(1000000001,0);\n while(q--!=0){\n int tp=in.nextInt();\n switch(tp){\n case 1:\n int tm=in.nextInt();\n int vl=in.nextInt();\n int nxt=mp.higherKey(tm)-1;\n st.update(tm, nxt, vl);\n mp.put(tm,vl);\n break;\n case 2:\n int tc=in.nextInt();\n int vp=mp.lowerEntry(tc).getValue();\n int net=mp.higherKey(tc)-1;\n st.update(tc, net, vp);\n mp.remove(tc);\n break;\n case 3:\n int l=in.nextInt();\n int lc=l;\n l=mp.ceilingKey(l);\n int r=in.nextInt();\n int v=in.nextInt();\n if(v==0){\n out.println(lc);\n continue;\n }\n if(l>=r){\n out.println(-1);\n continue;\n }\n QN aa=st.query(l, r-1, -v, 0);\n if(aa.index==-1)\n out.println(-1);\n else{\n int spd=mp.floorEntry(aa.index).getValue();\n double remv=-(v+(aa.sum-spd));\n double anss=aa.index;\n anss+=remv/spd;\n out.println(anss);\n \n }\n \n }\n \n }\n out.close();\n }\n\n}\n", "lang_cluster": "Java", "tags": ["data structures"], "code_uid": "0bdb517b0a43f9832de9221330b09132", "src_uid": "23440d055baf6c831e91e76b99b9ada8", "difficulty": 2800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\nimport java.io.PrintWriter;\nimport java.util.TreeMap;\npublic class E1113 \n{\n static class QN{\n int index;\n long sum;\n QN(int in,long an){\n index=in;\n sum=an;\n }\n }\n static class SegmentTree{\n long sum,pmin,lazy;\n int st,en;\n boolean rem;\n SegmentTree left,right;\n SegmentTree(int _st,int _en,long _v){\n st=_st;\n en=_en;\n lazy=_v;\n rem=true;\n sum=(en-st+1)*lazy;\n pmin=Math.min(lazy,sum);\n }\n long pmin(){\n return rem?(Math.min(lazy,(en-st+1)*lazy)):(pmin);\n }\n long sum(){\n return rem?((en-st+1)*lazy):(sum);\n }\n void update(int l,int r,long v){\n //completely outside\n if(l>en||r<st)\n return;\n //completely inside\n if(l<=st&&r>=en){\n //update lazy;\n lazy=v;\n rem=true;\n return;\n }\n //partial cover\n lazyPropagate();\n left.update(l, r, v);\n right.update(l, r, v);\n sum=left.sum()+right.sum();\n pmin=Math.min(left.pmin(),left.sum()+right.pmin());\n return;\n }\n void lazyPropagate(){\n if(left==null){\n int mid=(st+en)/2;\n left=new SegmentTree(st,mid,lazy);\n right=new SegmentTree(mid+1,en,lazy);\n }else if(rem){\n left.lazy=lazy;\n right.lazy=lazy;\n left.rem=true;\n right.rem=true;\n }\n if(rem){\n sum=(en-st+1)*lazy;\n pmin=Math.min(lazy,sum);\n }\n rem=false;\n }\n /**returns least index which has value <= given value**/\n QN query(int l,int r,long v,long su){\n //no cover\n if(st>r||en<l)\n return new QN(-1,0);\n //full cover\n if(l<=st&&en<=r){\n if(su+pmin()<=v)\n return query2(v,su);\n return new QN(-1,su+sum());\n }\n lazyPropagate();\n \n QN q1=left.query(l,r,v,su);\n if(q1.index!=-1)\n return q1;\n q1=right.query(l,r,v,q1.sum);\n return q1; \n }\n QN query2(long v,long su){\n if(st==en)\n return new QN(st,su+sum());\n lazyPropagate();\n if(left.pmin()+su<=v)\n return left.query2(v,su);\n else\n return right.query2(v,su+left.sum());\n \n }\n \n }\n static class Scanner\n {\n BufferedReader br;\n StringTokenizer tk=new StringTokenizer(\"\");\n public Scanner(InputStream is) \n {\n br=new BufferedReader(new InputStreamReader(is));\n }\n public int nextInt() throws IOException\n {\n if(tk.hasMoreTokens())\n return Integer.parseInt(tk.nextToken());\n tk=new StringTokenizer(br.readLine());\n return nextInt();\n }\n public long nextLong() throws IOException\n {\n if(tk.hasMoreTokens())\n return Long.parseLong(tk.nextToken());\n tk=new StringTokenizer(br.readLine());\n return nextLong();\n }\n public String next() throws IOException\n {\n if(tk.hasMoreTokens())\n return (tk.nextToken());\n tk=new StringTokenizer(br.readLine());\n return next();\n }\n public String nextLine() throws IOException\n {\n tk=new StringTokenizer(\"\");\n return br.readLine();\n }\n public double nextDouble() throws IOException\n {\n if(tk.hasMoreTokens())\n return Double.parseDouble(tk.nextToken());\n tk=new StringTokenizer(br.readLine());\n return nextDouble();\n }\n public char nextChar() throws IOException\n {\n if(tk.hasMoreTokens())\n return (tk.nextToken().charAt(0));\n tk=new StringTokenizer(br.readLine());\n return nextChar();\n }\n public int[] nextIntArray(int n) throws IOException\n {\n int a[]=new int[n];\n for(int i=0;i<n;i++)\n a[i]=nextInt();\n return a;\n }\n public long[] nextLongArray(int n) throws IOException\n {\n long a[]=new long[n];\n for(int i=0;i<n;i++)\n a[i]=nextLong();\n return a;\n }\n public int[] nextIntArrayOneBased(int n) throws IOException\n {\n int a[]=new int[n+1];\n for(int i=1;i<=n;i++)\n a[i]=nextInt();\n return a;\n }\n public long[] nextLongArrayOneBased(int n) throws IOException\n {\n long a[]=new long[n+1];\n for(int i=1;i<=n;i++)\n a[i]=nextLong();\n return a;\n }\n \n \n }\n \n public static void main(String args[]) throws IOException\n {\n Scanner in=new Scanner(System.in);\n PrintWriter out=new PrintWriter(System.out);\n SegmentTree st=new SegmentTree(1,1000000000,0);\n int q=in.nextInt();\n TreeMap<Integer,Integer> mp=new TreeMap<>();\n mp.put(0,0);\n mp.put(1000000001,0);\n while(q--!=0){\n int tp=in.nextInt();\n switch(tp){\n case 1:\n int tm=in.nextInt();\n int vl=in.nextInt();\n int nxt=mp.higherKey(tm)-1;\n st.update(tm, nxt, vl);\n mp.put(tm,vl);\n break;\n case 2:\n int tc=in.nextInt();\n int vp=mp.lowerEntry(tc).getValue();\n int net=mp.higherKey(tc)-1;\n st.update(tc, net, vp);\n mp.remove(tc);\n break;\n case 3:\n int l=in.nextInt();\n int lc=l;\n l=mp.ceilingKey(l);\n int r=in.nextInt();\n int v=in.nextInt();\n if(v==0){\n out.println(lc);\n continue;\n }\n if(l>=r){\n out.println(-1);\n continue;\n }\n QN aa=st.query(l, r-1, -v, 0);\n if(aa.index==-1)\n out.println(-1);\n else{\n int spd=mp.floorEntry(aa.index).getValue();\n double remv=-(v+(aa.sum-spd));\n double anss=aa.index;\n anss+=remv/spd;\n out.println(anss);\n \n }\n \n }\n \n }\n out.close();\n }\n\n}\n", "lang_cluster": "Java", "tags": ["data structures"], "code_uid": "4f20243df8bd038312720a8cc15af18f", "src_uid": "23440d055baf6c831e91e76b99b9ada8", "difficulty": 2800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "//package educational.round049;\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class G2 {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t// 11 2 3 3 3 2 2 3\n\t\n\tvoid solve()\n\t{\n\t\tlong m = nl(), x = nl();\n\t\tint[] primes = sieveEratosthenes(10000000);\n\t\tlong[] ds = enumDivisors(m, primes);\n\t\tArrays.sort(ds);\n\t\tlong[] gf = factor(m, primes);\n\t\t\n\t\tlong ans = 0;\n\t\tfor(long d : ds){\n\t\t\tlong t = totient(d, gf);\n\t\t\tlong[] f = factor(t, primes);\n\t\t\tlong P = period(x%d, d, f, t);\n\t\t\tassert t % P == 0;\n\t\t\tans += t / P;\n//\t\t\ttr(d, t, period(x%d, d, f, t));\n\t\t}\n\t\tout.println(ans);\n\t}\n\t\n\tlong period(long x, long d, long[] f, long t)\n\t{\n\t\tif(d > 1e9){\n\t\t\t// x^k=1 (mod d)\n\t\t\tassert powSafe(x, t, d) == 1%d;\n\t\t\tfor(long e : f){\n\t\t\t\twhile(t % e == 0 && powSafe(x, t/e, d) == 1%d){\n\t\t\t\t\tt /= e;\n\t\t\t\t}\n\t\t\t}\n\t\t}else{\n\t\t\tassert pow(x, t, d) == 1%d;\n\t\t\tfor(long e : f){\n\t\t\t\twhile(t % e == 0 && pow(x, t/e, d) == 1%d){\n\t\t\t\t\tt /= e;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn t;\n\t}\n\t\n\tpublic static long pow(long a, long n, long mod) {\n\t\t//\t\ta %= mod;\n\t\tlong ret = 1;\n\t\tint x = 63 - Long.numberOfLeadingZeros(n);\n\t\tfor (; x >= 0; x--) {\n\t\t\tret = ret * ret % mod;\n\t\t\tif (n << 63 - x < 0)\n\t\t\t\tret = ret * a % mod;\n\t\t}\n\t\treturn ret;\n\t}\n\n\t\n\tpublic static long powSafe(long a, long n, long mod)\n\t{\n//\t\ta %= mod;\n\t\tlong ret = 1; // 1%mod if mod=1,n=0\n\t\tint x = 63-Long.numberOfLeadingZeros(n);\n\t\tfor(;x >= 0;x--){\n\t\t\tret = mulEx(ret, ret, mod);\n\t\t\tif(n<<~x<0)ret = mulEx(ret, a, mod);\n\t\t}\n\t\treturn ret;\n\t}\n\t\n\tpublic static long mulEx(long a, long b, long mod)\n\t{\n\t\tif(a >= mod || a < 0)a %= mod;\n\t\tif(a < 0)a += mod;\n\t\tif(b >= mod || b < 0)b %= mod;\n\t\tif(b < 0)b += mod;\n\t\t\n\t\tlong ret = 0;\n\t\tint x = 63-Long.numberOfLeadingZeros(b);\n\t\tfor(;x >= 0;x--){\n\t\t\tret += ret;\n\t\t\tif(Long.compareUnsigned(ret, mod) >= 0)ret -= mod;\n\t\t\tif(b<<~x<0){\n\t\t\t\tret += a;\n\t\t\t\tif(Long.compareUnsigned(ret, mod) >= 0)ret -= mod;\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n\t\n\t\n\n\t\n\tpublic static long totient(long n, long[] primes)\n\t{\n\t\tlong ret = n;\n\t\tfor(long p : primes){\n\t\t\tif((long)p * p > n)break;\n\t\t\tif(n % p == 0){\n\t\t\t\tret /= p;\n\t\t\t\tret *= p - 1;\n\t\t\t}\n\t\t\twhile(n % p == 0)n /= p;\n\t\t}\n\t\tif(n != 1){\n\t\t\tret /= n;\n\t\t\tret *= n - 1;\n\t\t}\n\t\treturn ret;\n\t}\n\n\t\n\tpublic static long[] factor(long n, int[] primes)\n\t{\n\t\tlong[] ret = new long[20];\n\t\tint rp = 0;\n\t\tfor(int p : primes){\n\t\t\tif((long)p * p > n)break;\n\t\t\tint i;\n\t\t\tfor(i = 0;n % p == 0;n /= p, i++);\n\t\t\tif(i > 0){\n\t\t\t\tret[rp] = p;\n\t\t\t\trp++;\n\t\t\t}\n\t\t}\n\t\tif(n != 1){\n\t\t\tret[rp] = n;\n\t\t\trp++;\n\t\t}\n\t\treturn Arrays.copyOf(ret, rp);\n\t}\n\n\t\n\tpublic static long[] enumDivisors(long n, int[] primes)\n\t{\n\t\tint m = 1;\n\t\tlong[] divs = {1L};\n\t\tint t = 1;\n\t\tlong u = n;\n\t\tfor(int p : primes){\n\t\t\tif((long)p*p > u)break;\n\t\t\tint e = 0;\n\t\t\twhile(u % p == 0){\n\t\t\t\tu /= p;\n\t\t\t\te++;\n\t\t\t}\n\t\t\tif(e > 0){\n\t\t\t\tdivs = Arrays.copyOf(divs, t*(e+1));\n\t\t\t\tfor(int q = t-1;q >= 0;q--){\n\t\t\t\t\tlong b = divs[q];\n\t\t\t\t\tfor(int k = 0;k < e;k++){\n\t\t\t\t\t\tb *= p;\n//\t\t\t\t\t\tif((long)b*b <= n)divs[t++] = b;\n\t\t\t\t\t\tdivs[t++] = b;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tm *= e+1;\n\t\t\t}\n\t\t}\n\t\tif(u > 1){\n\t\t\tlong p = u;\n\t\t\tint e = 1;\n\t\t\tdivs = Arrays.copyOf(divs, t*(e+1));\n\t\t\tfor(int q = t-1;q >= 0;q--){\n\t\t\t\tlong b = divs[q];\n\t\t\t\tfor(int k = 0;k < e;k++){\n\t\t\t\t\tb *= p;\n//\t\t\t\t\tif((long)b*b <= n)divs[t++] = b;\n\t\t\t\t\tdivs[t++] = b;\n\t\t\t\t}\n\t\t\t}\n\t\t\tm *= e+1;\n\t\t}\n\t\t\n\t\treturn Arrays.copyOf(divs, t);\n\t}\t\n\n\t\n\tpublic static int[][] factor(int n, int[] primes)\n\t{\n\t\tint[][] ret = new int[9][2];\n\t\tint rp = 0;\n\t\tfor(int p : primes){\n\t\t\tif(p * p > n)break;\n\t\t\tint i;\n\t\t\tfor(i = 0;n % p == 0;n /= p, i++);\n\t\t\tif(i > 0){\n\t\t\t\tret[rp][0] = p;\n\t\t\t\tret[rp][1] = i;\n\t\t\t\trp++;\n\t\t\t}\n\t\t}\n\t\tif(n != 1){\n\t\t\tret[rp][0] = n;\n\t\t\tret[rp][1] = 1;\n\t\t\trp++;\n\t\t}\n\t\treturn Arrays.copyOf(ret, rp);\n\t}\n\n\t\n\tpublic static int gcd(int a, int b) {\n\t\twhile (b > 0) {\n\t\t\tint c = a;\n\t\t\ta = b;\n\t\t\tb = c % b;\n\t\t}\n\t\treturn a;\n\t}\n\t\n\tpublic static int[] sieveEratosthenes(int n) {\n\t\tif (n <= 32) {\n\t\t\tint[] primes = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };\n\t\t\tfor (int i = 0; i < primes.length; i++) {\n\t\t\t\tif (n < primes[i]) {\n\t\t\t\t\treturn Arrays.copyOf(primes, i);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn primes;\n\t\t}\n\n\t\tint u = n + 32;\n\t\tdouble lu = Math.log(u);\n\t\tint[] ret = new int[(int) (u / lu + u / lu / lu * 1.5)];\n\t\tret[0] = 2;\n\t\tint pos = 1;\n\n\t\tint[] isnp = new int[(n + 1) / 32 / 2 + 1];\n\t\tint sup = (n + 1) / 32 / 2 + 1;\n\n\t\tint[] tprimes = { 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };\n\t\tfor (int tp : tprimes) {\n\t\t\tret[pos++] = tp;\n\t\t\tint[] ptn = new int[tp];\n\t\t\tfor (int i = (tp - 3) / 2; i < tp << 5; i += tp)\n\t\t\t\tptn[i >> 5] |= 1 << (i & 31);\n\t\t\tfor (int j = 0; j < sup; j += tp) {\n\t\t\t\tfor (int i = 0; i < tp && i + j < sup; i++) {\n\t\t\t\t\tisnp[j + i] |= ptn[i];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// 3,5,7\n\t\t// 2x+3=n\n\t\tint[] magic = { 0, 1, 23, 2, 29, 24, 19, 3, 30, 27, 25, 11, 20, 8, 4, 13, 31, 22, 28, 18, 26, 10, 7, 12, 21, 17,\n\t\t\t\t9, 6, 16, 5, 15, 14 };\n\t\tint h = n / 2;\n\t\tfor (int i = 0; i < sup; i++) {\n\t\t\tfor (int j = ~isnp[i]; j != 0; j &= j - 1) {\n\t\t\t\tint pp = i << 5 | magic[(j & -j) * 0x076be629 >>> 27];\n\t\t\t\tint p = 2 * pp + 3;\n\t\t\t\tif (p > n)\n\t\t\t\t\tbreak;\n\t\t\t\tret[pos++] = p;\n\t\t\t\tif ((long) p * p > n)\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (int q = (p * p - 3) / 2; q <= h; q += p)\n\t\t\t\t\tisnp[q >> 5] |= 1 << q;\n\t\t\t}\n\t\t}\n\n\t\treturn Arrays.copyOf(ret, pos);\n\t}\n\n\t\n\tvoid run() throws Exception\n\t{\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception { new G2().run(); }\n\t\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate double nd() { return Double.parseDouble(ns()); }\n\tprivate char nc() { return (char)skip(); }\n\t\n\tprivate String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\n}\n", "lang_cluster": "Java", "tags": ["math", "number theory", "bitmasks"], "code_uid": "fccc701630b524b1b6f9fde5fb24f94c", "src_uid": "c2dd6de750812d6213c770b3587d8fcb", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.util.Arrays;\nimport java.io.IOException;\nimport java.util.Random;\nimport java.io.UncheckedIOException;\nimport java.io.Closeable;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) throws Exception {\n Thread thread = new Thread(null, new TaskAdapter(), \"\", 1 << 27);\n thread.start();\n thread.join();\n }\n\n static class TaskAdapter implements Runnable {\n @Override\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastInput in = new FastInput(inputStream);\n FastOutput out = new FastOutput(outputStream);\n GXMouseInTheCampus solver = new GXMouseInTheCampus();\n solver.solve(1, in, out);\n out.close();\n }\n }\n\n static class GXMouseInTheCampus {\n LongHashMap mu = new LongHashMap(100000, false);\n LongHashMap euler = new LongHashMap(100000, false);\n long[] primes;\n\n {\n mu.put(1, 1);\n euler.put(1, 1);\n }\n\n public long oneOfPrimeFactor(long x) {\n for (long p : primes) {\n if (x % p == 0) {\n return p;\n }\n }\n return x;\n }\n\n public void populate(long x) {\n long factor = oneOfPrimeFactor(x);\n long cnt = 0;\n long y = x;\n while (y % factor == 0) {\n cnt++;\n y /= factor;\n }\n if (cnt > 1) {\n mu.put(x, 0);\n } else {\n mu.put(x, -mu(y));\n }\n euler.put(x, euler(y) * (x / y - x / y / factor));\n }\n\n public long mu(long x) {\n long ans = mu.getOrDefault(x, -1);\n if (ans == -1) {\n populate(x);\n ans = mu.get(x);\n }\n return ans;\n }\n\n public long euler(long x) {\n long ans = euler.getOrDefault(x, -1);\n if (ans == -1) {\n populate(x);\n ans = euler.get(x);\n }\n return ans;\n }\n\n public void solve(int testNumber, FastInput in, FastOutput out) {\n long m = in.readLong();\n long x = in.readLong();\n\n primes = Factorization.factorizeNumberPrime(m).toArray();\n LongList allFactorOfM = new LongList(20000);\n LongList tmpList = new LongList(20000);\n LongList allPossiblePrimeFactor = new LongList();\n for (long p : primes) {\n allPossiblePrimeFactor.add(p);\n allPossiblePrimeFactor.addAll(Factorization.factorizeNumberPrime(p - 1));\n }\n allPossiblePrimeFactor.unique();\n\n collect(allFactorOfM, m, 0);\n LongPower power = new LongPower(ILongModular.getInstance(m));\n\n long total = 1;\n for (int i = 0; i < allFactorOfM.size(); i++) {\n long g = allFactorOfM.get(i);\n if (g == m) {\n continue;\n }\n long mg = m / g;\n tmpList.clear();\n collect(tmpList, mg, 0);\n long cnt = 0;\n for (int j = tmpList.size() - 1; j >= 0; j--) {\n long t = tmpList.get(j);\n cnt += mu(t) * ((m - 1) / (t * g));\n }\n\n tmpList.clear();\n long euler = euler(mg);\n LongList primeFactors = tmpList;\n for (int j = 0; j < allPossiblePrimeFactor.size(); j++) {\n long p = allPossiblePrimeFactor.get(j);\n if (euler % p == 0) {\n primeFactors.add(p);\n }\n }\n\n long n = euler;\n for (int j = 0; j < primeFactors.size(); j++) {\n long p = primeFactors.get(j);\n while (n % p == 0 && power.pow(x, n / p) % mg == 1) {\n n /= p;\n }\n }\n\n if (cnt % n != 0) {\n throw new IllegalStateException();\n }\n total += cnt / n;\n }\n\n out.println(total);\n }\n\n public void collect(LongList list, long x, int i) {\n if (i == primes.length) {\n list.add(x);\n return;\n }\n collect(list, x, i + 1);\n while (x % primes[i] == 0) {\n x /= primes[i];\n collect(list, x, i + 1);\n }\n }\n\n }\n\n static class DigitUtils {\n private DigitUtils() {\n }\n\n public static long round(double x) {\n if (x >= 0) {\n return (long) (x + 0.5);\n } else {\n return (long) (x - 0.5);\n }\n }\n\n public static long mod(long x, long mod) {\n x %= mod;\n if (x < 0) {\n x += mod;\n }\n return x;\n }\n\n public static long mulMod(long a, long b, long mod) {\n long k = DigitUtils.round((double) a / mod * b);\n return DigitUtils.mod(a * b - k * mod, mod);\n }\n\n }\n\n static class FastOutput implements AutoCloseable, Closeable, Appendable {\n private StringBuilder cache = new StringBuilder(10 << 20);\n private final Writer os;\n\n public FastOutput append(CharSequence csq) {\n cache.append(csq);\n return this;\n }\n\n public FastOutput append(CharSequence csq, int start, int end) {\n cache.append(csq, start, end);\n return this;\n }\n\n public FastOutput(Writer os) {\n this.os = os;\n }\n\n public FastOutput(OutputStream os) {\n this(new OutputStreamWriter(os));\n }\n\n public FastOutput append(char c) {\n cache.append(c);\n return this;\n }\n\n public FastOutput println(long c) {\n cache.append(c);\n println();\n return this;\n }\n\n public FastOutput println() {\n cache.append(System.lineSeparator());\n return this;\n }\n\n public FastOutput flush() {\n try {\n os.append(cache);\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n return this;\n }\n\n public void close() {\n flush();\n try {\n os.close();\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n\n public String toString() {\n return cache.toString();\n }\n\n }\n\n static class LongPower {\n final ILongModular modular;\n\n public LongPower(ILongModular modular) {\n this.modular = modular;\n }\n\n public long pow(long x, long n) {\n if (n == 0) {\n return 1;\n }\n long r = pow(x, n >> 1);\n r = modular.mul(r, r);\n if ((n & 1) == 1) {\n r = modular.mul(r, x);\n }\n return r;\n }\n\n }\n\n static class Factorization {\n public static LongList factorizeNumberPrime(long x) {\n LongList ans = new LongList();\n for (long i = 2; i * i <= x; i++) {\n if (x % i != 0) {\n continue;\n }\n ans.add(i);\n while (x % i == 0) {\n x /= i;\n }\n }\n if (x > 1) {\n ans.add(x);\n }\n return ans;\n }\n\n }\n\n static class LongHashMap {\n private int[] slot;\n private int[] next;\n private long[] keys;\n private long[] values;\n private int alloc;\n private boolean[] removed;\n private int mask;\n private int size;\n private boolean rehash;\n\n public LongHashMap(int cap, boolean rehash) {\n this.mask = (1 << (32 - Integer.numberOfLeadingZeros(cap - 1))) - 1;\n slot = new int[mask + 1];\n next = new int[cap + 1];\n keys = new long[cap + 1];\n values = new long[cap + 1];\n removed = new boolean[cap + 1];\n this.rehash = rehash;\n }\n\n private void doubleCapacity() {\n int newSize = Math.max(next.length + 10, next.length * 2);\n next = Arrays.copyOf(next, newSize);\n keys = Arrays.copyOf(keys, newSize);\n values = Arrays.copyOf(values, newSize);\n removed = Arrays.copyOf(removed, newSize);\n }\n\n public void alloc() {\n alloc++;\n if (alloc >= next.length) {\n doubleCapacity();\n }\n next[alloc] = 0;\n removed[alloc] = false;\n size++;\n }\n\n private void rehash() {\n int[] newSlots = new int[Math.max(16, slot.length * 2)];\n int newMask = newSlots.length - 1;\n for (int i = 0; i < slot.length; i++) {\n if (slot[i] == 0) {\n continue;\n }\n int head = slot[i];\n while (head != 0) {\n int n = next[head];\n int s = hash(keys[head]) & newMask;\n next[head] = newSlots[s];\n newSlots[s] = head;\n head = n;\n }\n }\n this.slot = newSlots;\n this.mask = newMask;\n }\n\n private int hash(long x) {\n int h = Long.hashCode(x);\n return h ^ (h >>> 16);\n }\n\n public void put(long x, long y) {\n put(x, y, true);\n }\n\n public void put(long x, long y, boolean cover) {\n int h = hash(x);\n int s = h & mask;\n if (slot[s] == 0) {\n alloc();\n slot[s] = alloc;\n keys[alloc] = x;\n values[alloc] = y;\n } else {\n int index = findIndexOrLastEntry(s, x);\n if (keys[index] != x) {\n alloc();\n next[index] = alloc;\n keys[alloc] = x;\n values[alloc] = y;\n } else if (cover) {\n values[index] = y;\n }\n }\n if (rehash && size >= slot.length) {\n rehash();\n }\n }\n\n public long getOrDefault(long x, long def) {\n int h = hash(x);\n int s = h & mask;\n if (slot[s] == 0) {\n return def;\n }\n int index = findIndexOrLastEntry(s, x);\n return keys[index] == x ? values[index] : def;\n }\n\n public long get(long x) {\n return getOrDefault(x, 0);\n }\n\n private int findIndexOrLastEntry(int s, long x) {\n int iter = slot[s];\n while (keys[iter] != x) {\n if (next[iter] != 0) {\n iter = next[iter];\n } else {\n return iter;\n }\n }\n return iter;\n }\n\n public LongEntryIterator iterator() {\n return new LongEntryIterator() {\n int index = 1;\n int readIndex = -1;\n\n\n public boolean hasNext() {\n while (index <= alloc && removed[index]) {\n index++;\n }\n return index <= alloc;\n }\n\n\n public long getEntryKey() {\n return keys[readIndex];\n }\n\n\n public long getEntryValue() {\n return values[readIndex];\n }\n\n\n public void next() {\n if (!hasNext()) {\n throw new IllegalStateException();\n }\n readIndex = index;\n index++;\n }\n };\n }\n\n public String toString() {\n LongEntryIterator iterator = iterator();\n StringBuilder builder = new StringBuilder(\"{\");\n while (iterator.hasNext()) {\n iterator.next();\n builder.append(iterator.getEntryKey()).append(\"->\").append(iterator.getEntryValue()).append(',');\n }\n if (builder.charAt(builder.length() - 1) == ',') {\n builder.setLength(builder.length() - 1);\n }\n builder.append('}');\n return builder.toString();\n }\n\n }\n\n static class FastInput {\n private final InputStream is;\n private byte[] buf = new byte[1 << 13];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastInput(InputStream is) {\n this.is = is;\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n bufLen = -1;\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public long readLong() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n long val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n }\n\n static interface LongEntryIterator {\n boolean hasNext();\n\n void next();\n\n long getEntryKey();\n\n long getEntryValue();\n\n }\n\n static class LongModular implements ILongModular {\n final long m;\n\n public LongModular(long m) {\n this.m = m;\n }\n\n public long mul(long a, long b) {\n return b == 0 ? 0 : ((mul(a, b >> 1) << 1) % m + a * (b & 1)) % m;\n }\n\n }\n\n static class LongModularDanger implements ILongModular {\n final long m;\n\n public LongModularDanger(long m) {\n this.m = m;\n }\n\n public long mul(long a, long b) {\n return DigitUtils.mulMod(a, b, m);\n }\n\n }\n\n static class LongList implements Cloneable {\n private int size;\n private int cap;\n private long[] data;\n private static final long[] EMPTY = new long[0];\n\n public LongList(int cap) {\n this.cap = cap;\n if (cap == 0) {\n data = EMPTY;\n } else {\n data = new long[cap];\n }\n }\n\n public LongList(LongList list) {\n this.size = list.size;\n this.cap = list.cap;\n this.data = Arrays.copyOf(list.data, size);\n }\n\n public LongList() {\n this(0);\n }\n\n public void ensureSpace(int req) {\n if (req > cap) {\n while (cap < req) {\n cap = Math.max(cap + 10, 2 * cap);\n }\n data = Arrays.copyOf(data, cap);\n }\n }\n\n private void checkRange(int i) {\n if (i < 0 || i >= size) {\n throw new ArrayIndexOutOfBoundsException();\n }\n }\n\n public long get(int i) {\n checkRange(i);\n return data[i];\n }\n\n public void add(long x) {\n ensureSpace(size + 1);\n data[size++] = x;\n }\n\n public void addAll(long[] x, int offset, int len) {\n ensureSpace(size + len);\n System.arraycopy(x, offset, data, size, len);\n size += len;\n }\n\n public void addAll(LongList list) {\n addAll(list.data, 0, list.size);\n }\n\n public void sort() {\n if (size <= 1) {\n return;\n }\n Randomized.shuffle(data, 0, size);\n Arrays.sort(data, 0, size);\n }\n\n public void unique() {\n if (size <= 1) {\n return;\n }\n\n sort();\n int wpos = 1;\n for (int i = 1; i < size; i++) {\n if (data[i] != data[wpos - 1]) {\n data[wpos++] = data[i];\n }\n }\n size = wpos;\n }\n\n public int size() {\n return size;\n }\n\n public long[] toArray() {\n return Arrays.copyOf(data, size);\n }\n\n public void clear() {\n size = 0;\n }\n\n public String toString() {\n return Arrays.toString(toArray());\n }\n\n public boolean equals(Object obj) {\n if (!(obj instanceof LongList)) {\n return false;\n }\n LongList other = (LongList) obj;\n return SequenceUtils.equal(data, 0, size - 1, other.data, 0, other.size - 1);\n }\n\n public int hashCode() {\n int h = 1;\n for (int i = 0; i < size; i++) {\n h = h * 31 + Long.hashCode(data[i]);\n }\n return h;\n }\n\n public LongList clone() {\n LongList ans = new LongList();\n ans.addAll(this);\n return ans;\n }\n\n }\n\n static interface ILongModular {\n long mul(long a, long b);\n\n static ILongModular getInstance(long mod) {\n //return new LongModularDanger(mod);\n return mod <= (1L << 54) ? new LongModularDanger(mod) : new LongModular(mod);\n }\n\n }\n\n static class SequenceUtils {\n public static boolean equal(long[] a, int al, int ar, long[] b, int bl, int br) {\n if ((ar - al) != (br - bl)) {\n return false;\n }\n for (int i = al, j = bl; i <= ar; i++, j++) {\n if (a[i] != b[j]) {\n return false;\n }\n }\n return true;\n }\n\n }\n\n static class Randomized {\n private static Random random = new Random(0);\n\n public static void shuffle(long[] data, int from, int to) {\n to--;\n for (int i = from; i <= to; i++) {\n int s = nextInt(i, to);\n long tmp = data[i];\n data[i] = data[s];\n data[s] = tmp;\n }\n }\n\n public static int nextInt(int l, int r) {\n return random.nextInt(r - l + 1) + l;\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "number theory", "bitmasks"], "code_uid": "58afd5f33c6db4dfdea9b56e29b4e01a", "src_uid": "c2dd6de750812d6213c770b3587d8fcb", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.util.Arrays;\nimport java.io.IOException;\nimport java.io.UncheckedIOException;\nimport java.io.Closeable;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) throws Exception {\n Thread thread = new Thread(null, new TaskAdapter(), \"\", 1 << 27);\n thread.start();\n thread.join();\n }\n\n static class TaskAdapter implements Runnable {\n @Override\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastInput in = new FastInput(inputStream);\n FastOutput out = new FastOutput(outputStream);\n GXMouseInTheCampus solver = new GXMouseInTheCampus();\n solver.solve(1, in, out);\n out.close();\n }\n }\n\n static class GXMouseInTheCampus {\n LongHashMap mu = new LongHashMap(100000, false);\n LongHashMap euler = new LongHashMap(100000, false);\n long[] primes;\n\n {\n mu.put(1, 1);\n euler.put(1, 1);\n }\n\n public long oneOfPrimeFactor(long x) {\n for (long p : primes) {\n if (x % p == 0) {\n return p;\n }\n }\n return x;\n }\n\n public void populate(long x) {\n long factor = oneOfPrimeFactor(x);\n long cnt = 0;\n long y = x;\n while (y % factor == 0) {\n cnt++;\n y /= factor;\n }\n if (cnt > 1) {\n mu.put(x, 0);\n } else {\n mu.put(x, -mu(y));\n }\n euler.put(x, euler(y) * (x / y - x / y / factor));\n }\n\n public long mu(long x) {\n long ans = mu.getOrDefault(x, -1);\n if (ans == -1) {\n populate(x);\n ans = mu.get(x);\n }\n return ans;\n }\n\n public long euler(long x) {\n long ans = euler.getOrDefault(x, -1);\n if (ans == -1) {\n populate(x);\n ans = euler.get(x);\n }\n return ans;\n }\n\n public void solve(int testNumber, FastInput in, FastOutput out) {\n long m = in.readLong();\n long x = in.readLong();\n\n primes = Factorization.factorizeNumberPrime(m).toArray();\n LongList allFactorOfM = new LongList(20000);\n LongList tmpList = new LongList(20000);\n collect(allFactorOfM, m, 0);\n LongPower power = new LongPower(ILongModular.getInstance(m));\n\n long total = 1;\n for (int i = 0; i < allFactorOfM.size(); i++) {\n long g = allFactorOfM.get(i);\n if (g == m) {\n continue;\n }\n long mg = m / g;\n tmpList.clear();\n collect(tmpList, mg, 0);\n long cnt = 0;\n for (int j = tmpList.size() - 1; j >= 0; j--) {\n long t = tmpList.get(j);\n cnt += mu(t) * ((m - 1) / (t * g));\n }\n\n tmpList.clear();\n long euler = euler(mg);\n LongList primeFactors = Factorization.factorizeNumberPrime(euler);\n\n long n = euler;\n\n for (int j = 0; j < primeFactors.size(); j++) {\n long p = primeFactors.get(j);\n while (n % p == 0 && power.pow(x, n / p) % mg == 1) {\n n /= p;\n }\n }\n\n if (cnt % n != 0) {\n throw new IllegalStateException();\n }\n total += cnt / n;\n }\n\n out.println(total);\n }\n\n public void collect(LongList list, long x, int i) {\n if (i == primes.length) {\n list.add(x);\n return;\n }\n collect(list, x, i + 1);\n while (x % primes[i] == 0) {\n x /= primes[i];\n collect(list, x, i + 1);\n }\n }\n\n }\n\n static class DigitUtils {\n private DigitUtils() {\n }\n\n public static long round(double x) {\n if (x >= 0) {\n return (long) (x + 0.5);\n } else {\n return (long) (x - 0.5);\n }\n }\n\n public static long mod(long x, long mod) {\n x %= mod;\n if (x < 0) {\n x += mod;\n }\n return x;\n }\n\n public static long mulMod(long a, long b, long mod) {\n long k = DigitUtils.round((double) a / mod * b);\n return DigitUtils.mod(a * b - k * mod, mod);\n }\n\n }\n\n static class FastOutput implements AutoCloseable, Closeable, Appendable {\n private StringBuilder cache = new StringBuilder(10 << 20);\n private final Writer os;\n\n public FastOutput append(CharSequence csq) {\n cache.append(csq);\n return this;\n }\n\n public FastOutput append(CharSequence csq, int start, int end) {\n cache.append(csq, start, end);\n return this;\n }\n\n public FastOutput(Writer os) {\n this.os = os;\n }\n\n public FastOutput(OutputStream os) {\n this(new OutputStreamWriter(os));\n }\n\n public FastOutput append(char c) {\n cache.append(c);\n return this;\n }\n\n public FastOutput println(long c) {\n cache.append(c);\n println();\n return this;\n }\n\n public FastOutput println() {\n cache.append(System.lineSeparator());\n return this;\n }\n\n public FastOutput flush() {\n try {\n os.append(cache);\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n return this;\n }\n\n public void close() {\n flush();\n try {\n os.close();\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n\n public String toString() {\n return cache.toString();\n }\n\n }\n\n static class LongPower {\n final ILongModular modular;\n\n public LongPower(ILongModular modular) {\n this.modular = modular;\n }\n\n public long pow(long x, long n) {\n if (n == 0) {\n return 1;\n }\n long r = pow(x, n >> 1);\n r = modular.mul(r, r);\n if ((n & 1) == 1) {\n r = modular.mul(r, x);\n }\n return r;\n }\n\n }\n\n static class Factorization {\n public static LongList factorizeNumberPrime(long x) {\n LongList ans = new LongList();\n for (long i = 2; i * i <= x; i++) {\n if (x % i != 0) {\n continue;\n }\n ans.add(i);\n while (x % i == 0) {\n x /= i;\n }\n }\n if (x > 1) {\n ans.add(x);\n }\n return ans;\n }\n\n }\n\n static class LongHashMap {\n private int[] slot;\n private int[] next;\n private long[] keys;\n private long[] values;\n private int alloc;\n private boolean[] removed;\n private int mask;\n private int size;\n private boolean rehash;\n\n public LongHashMap(int cap, boolean rehash) {\n this.mask = (1 << (32 - Integer.numberOfLeadingZeros(cap - 1))) - 1;\n slot = new int[mask + 1];\n next = new int[cap + 1];\n keys = new long[cap + 1];\n values = new long[cap + 1];\n removed = new boolean[cap + 1];\n this.rehash = rehash;\n }\n\n private void doubleCapacity() {\n int newSize = Math.max(next.length + 10, next.length * 2);\n next = Arrays.copyOf(next, newSize);\n keys = Arrays.copyOf(keys, newSize);\n values = Arrays.copyOf(values, newSize);\n removed = Arrays.copyOf(removed, newSize);\n }\n\n public void alloc() {\n alloc++;\n if (alloc >= next.length) {\n doubleCapacity();\n }\n next[alloc] = 0;\n removed[alloc] = false;\n size++;\n }\n\n private void rehash() {\n int[] newSlots = new int[Math.max(16, slot.length * 2)];\n int newMask = newSlots.length - 1;\n for (int i = 0; i < slot.length; i++) {\n if (slot[i] == 0) {\n continue;\n }\n int head = slot[i];\n while (head != 0) {\n int n = next[head];\n int s = hash(keys[head]) & newMask;\n next[head] = newSlots[s];\n newSlots[s] = head;\n head = n;\n }\n }\n this.slot = newSlots;\n this.mask = newMask;\n }\n\n private int hash(long x) {\n int h = Long.hashCode(x);\n return h ^ (h >>> 16);\n }\n\n public void put(long x, long y) {\n put(x, y, true);\n }\n\n public void put(long x, long y, boolean cover) {\n int h = hash(x);\n int s = h & mask;\n if (slot[s] == 0) {\n alloc();\n slot[s] = alloc;\n keys[alloc] = x;\n values[alloc] = y;\n } else {\n int index = findIndexOrLastEntry(s, x);\n if (keys[index] != x) {\n alloc();\n next[index] = alloc;\n keys[alloc] = x;\n values[alloc] = y;\n } else if (cover) {\n values[index] = y;\n }\n }\n if (rehash && size >= slot.length) {\n rehash();\n }\n }\n\n public long getOrDefault(long x, long def) {\n int h = hash(x);\n int s = h & mask;\n if (slot[s] == 0) {\n return def;\n }\n int index = findIndexOrLastEntry(s, x);\n return keys[index] == x ? values[index] : def;\n }\n\n public long get(long x) {\n return getOrDefault(x, 0);\n }\n\n private int findIndexOrLastEntry(int s, long x) {\n int iter = slot[s];\n while (keys[iter] != x) {\n if (next[iter] != 0) {\n iter = next[iter];\n } else {\n return iter;\n }\n }\n return iter;\n }\n\n public LongEntryIterator iterator() {\n return new LongEntryIterator() {\n int index = 1;\n int readIndex = -1;\n\n\n public boolean hasNext() {\n while (index <= alloc && removed[index]) {\n index++;\n }\n return index <= alloc;\n }\n\n\n public long getEntryKey() {\n return keys[readIndex];\n }\n\n\n public long getEntryValue() {\n return values[readIndex];\n }\n\n\n public void next() {\n if (!hasNext()) {\n throw new IllegalStateException();\n }\n readIndex = index;\n index++;\n }\n };\n }\n\n public String toString() {\n LongEntryIterator iterator = iterator();\n StringBuilder builder = new StringBuilder(\"{\");\n while (iterator.hasNext()) {\n iterator.next();\n builder.append(iterator.getEntryKey()).append(\"->\").append(iterator.getEntryValue()).append(',');\n }\n if (builder.charAt(builder.length() - 1) == ',') {\n builder.setLength(builder.length() - 1);\n }\n builder.append('}');\n return builder.toString();\n }\n\n }\n\n static class SequenceUtils {\n public static boolean equal(long[] a, int al, int ar, long[] b, int bl, int br) {\n if ((ar - al) != (br - bl)) {\n return false;\n }\n for (int i = al, j = bl; i <= ar; i++, j++) {\n if (a[i] != b[j]) {\n return false;\n }\n }\n return true;\n }\n\n }\n\n static class FastInput {\n private final InputStream is;\n private byte[] buf = new byte[1 << 13];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastInput(InputStream is) {\n this.is = is;\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n bufLen = -1;\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public long readLong() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n long val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n }\n\n static class LongModular implements ILongModular {\n final long m;\n\n public LongModular(long m) {\n this.m = m;\n }\n\n public long mul(long a, long b) {\n return b == 0 ? 0 : ((mul(a, b >> 1) << 1) % m + a * (b & 1)) % m;\n }\n\n }\n\n static class LongModularDanger implements ILongModular {\n final long m;\n\n public LongModularDanger(long m) {\n this.m = m;\n }\n\n public long mul(long a, long b) {\n return DigitUtils.mulMod(a, b, m);\n }\n\n }\n\n static class LongList implements Cloneable {\n private int size;\n private int cap;\n private long[] data;\n private static final long[] EMPTY = new long[0];\n\n public LongList(int cap) {\n this.cap = cap;\n if (cap == 0) {\n data = EMPTY;\n } else {\n data = new long[cap];\n }\n }\n\n public LongList(LongList list) {\n this.size = list.size;\n this.cap = list.cap;\n this.data = Arrays.copyOf(list.data, size);\n }\n\n public LongList() {\n this(0);\n }\n\n public void ensureSpace(int req) {\n if (req > cap) {\n while (cap < req) {\n cap = Math.max(cap + 10, 2 * cap);\n }\n data = Arrays.copyOf(data, cap);\n }\n }\n\n private void checkRange(int i) {\n if (i < 0 || i >= size) {\n throw new ArrayIndexOutOfBoundsException();\n }\n }\n\n public long get(int i) {\n checkRange(i);\n return data[i];\n }\n\n public void add(long x) {\n ensureSpace(size + 1);\n data[size++] = x;\n }\n\n public void addAll(long[] x, int offset, int len) {\n ensureSpace(size + len);\n System.arraycopy(x, offset, data, size, len);\n size += len;\n }\n\n public void addAll(LongList list) {\n addAll(list.data, 0, list.size);\n }\n\n public int size() {\n return size;\n }\n\n public long[] toArray() {\n return Arrays.copyOf(data, size);\n }\n\n public void clear() {\n size = 0;\n }\n\n public String toString() {\n return Arrays.toString(toArray());\n }\n\n public boolean equals(Object obj) {\n if (!(obj instanceof LongList)) {\n return false;\n }\n LongList other = (LongList) obj;\n return SequenceUtils.equal(data, 0, size - 1, other.data, 0, other.size - 1);\n }\n\n public int hashCode() {\n int h = 1;\n for (int i = 0; i < size; i++) {\n h = h * 31 + Long.hashCode(data[i]);\n }\n return h;\n }\n\n public LongList clone() {\n LongList ans = new LongList();\n ans.addAll(this);\n return ans;\n }\n\n }\n\n static interface LongEntryIterator {\n boolean hasNext();\n\n void next();\n\n long getEntryKey();\n\n long getEntryValue();\n\n }\n\n static interface ILongModular {\n long mul(long a, long b);\n\n static ILongModular getInstance(long mod) {\n //return new LongModularDanger(mod);\n return mod <= (1L << 54) ? new LongModularDanger(mod) : new LongModular(mod);\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["math", "number theory", "bitmasks"], "code_uid": "28c70352742add247392ee564172ed4a", "src_uid": "c2dd6de750812d6213c770b3587d8fcb", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\nimport java.util.*;\n\npublic class Codeforces830D {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st = new StringTokenizer(br.readLine());\n\t\tint N = 1000000007;\n\t\tint n = Integer.parseInt(st.nextToken());\n\t\tint[][] dynamic = new int[n+1][n+1];\n\t\tdynamic[1][0] = 1;\n\t\tdynamic[1][1] = 1;\n\t\tfor (int i = 2; i <= n; i++) {\n\t\t\tdynamic[1][i] = 0;\n\t\t}\n\t\tfor (int i = 2; i <= n; i++) {\n\t\t\tfor (int r = 0; r <= n+1-i; r++) {\n\t\t\t\tfor (int k = 0; k <= r; k++) {\n\t\t\t\t\tdynamic[i][r] = (int) (((long) dynamic[i][r] + (long) dynamic[i-1][k] * (long) dynamic[i-1][r-k])%N);\n\t\t\t\t}\n\t\t\t\tfor (int k = 0; k < r; k++) {\n\t\t\t\t\tdynamic[i][r] = (int) (((long) dynamic[i][r] + (long) dynamic[i-1][k] * (long) dynamic[i-1][r-k-1])%N);\n\t\t\t\t}\n\t\t\t\tfor (int k = 1; k <= r; k++) {\n\n\t\t\t\t\tdynamic[i][r] = (int) (((long) dynamic[i][r] + ((long) (4*k) * (((long) dynamic[i-1][k] * (long) dynamic[i-1][r-k])%N)))%N);\n\t\t\t\t\tdynamic[i][r] = (int) (((long) dynamic[i][r] + ((long) (2*k*(r+1-k))*(((long) dynamic[i-1][k] * (long) dynamic[i-1][r+1-k])%N)))%N);\n\t\t\t\t\tdynamic[i][r] = (int) (((long) dynamic[i][r] + ((long) (2*k*(k+1))*(((long) dynamic[i-1][k+1] * (long) dynamic[i-1][r-k])%N)))%N);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(dynamic[n][1]);\n\t\t\n\t}\n}\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "trees", "graphs"], "code_uid": "b8efc4d6d61bdc17468e28acf2b23797", "src_uid": "fda761834f7b5800f540178ac1c79fca", "difficulty": 2800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskD solver = new TaskD();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskD {\n static final long MODULO = (long) (1e9 + 7);\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int k = in.nextInt();\n long[][] comb = new long[k + 2][k + 2];\n comb[0][0] = 1;\n for (int a = 1; a < comb.length; ++a) {\n comb[a][0] = 1;\n for (int b = 1; b < comb.length; ++b) {\n comb[a][b] = (comb[a - 1][b] + comb[a - 1][b - 1]) % MODULO;\n }\n }\n long[] p2 = new long[k + 2];\n p2[0] = 1;\n for (int i = 1; i < p2.length; ++i) p2[i] = 2 * p2[i - 1] % MODULO;\n long[][] res = new long[k + 1][k + 2];\n long[] ways = new long[k + 2];\n\n res[0][0] = 1;\n for (int size = 1; size <= k; ++size) {\n ways[0] = 1;\n for (int numpaths = 1; numpaths <= k + 1; ++numpaths) {\n ways[numpaths] = 0;\n for (int left = 0; left <= numpaths; ++left) {\n ways[numpaths] = (ways[numpaths] + res[size - 1][left] * res[size - 1][numpaths - left] % MODULO * comb[numpaths][left]) % MODULO;\n }\n }\n res[size][0] = 1;\n for (int numpaths = 1; numpaths <= k + 1; ++numpaths) {\n long sum = ways[numpaths];\n for (int joinleft = 0; joinleft <= 1; ++joinleft) {\n for (int joinright = 0; joinright <= 1; ++joinright) {\n int prevnumpaths = numpaths - 1 + joinleft + joinright;\n if (prevnumpaths >= 0 && prevnumpaths <= k + 1) {\n long cur = ways[prevnumpaths];\n /*if (joinleft > 0) {\n cur = cur * prevnumpaths % MODULO;\n --prevnumpaths;\n }\n if (joinright > 0) {\n cur = cur * prevnumpaths % MODULO;\n --prevnumpaths;\n }\n if (joinleft > 0 && joinright > 0) {\n cur = cur * inv2 % MODULO;\n }*/\n sum = (sum + cur * numpaths) % MODULO;\n }\n }\n }\n res[size][numpaths] = sum % MODULO;\n }\n }\n out.println(res[k][1]);\n }\n\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}\n\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "trees", "graphs"], "code_uid": "91ac273ac2720273e1b9fc2a417cb8bc", "src_uid": "fda761834f7b5800f540178ac1c79fca", "difficulty": 2800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\n\npublic class P0424D {\n\n\tstatic final int MOD = 1000000007;\n\n\tlong[][] binoms;\n\n\tpublic static void main(String[] args) throws IOException {\n\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n\t\tint K = Integer.parseInt(br.readLine());\n\n\t\tlong[][] dp = new long[K + 1][];\n\n\t\tfor (int k = 0; k <= K; k++) {\n\n\t\t\tdp[k] = new long[K - k + 2];\n\n\t\t\tfor (int p = 0; p < K - k + 2; p++) {\n\n\t\t\t\tif (p == 0) {\n\t\t\t\t\tdp[k][p] = 1;\n\t\t\t\t} else if (k == 0) {\n\t\t\t\t\tdp[k][p] = 0;\n\t\t\t\t} else {\n\n\t\t\t\t\tfor (int i = 0; i <= p; i++) {\n\t\t\t\t\t\tdp[k][p] += dp[k - 1][i] * dp[k - 1][p - i];\n\t\t\t\t\t\tdp[k][p] %= MOD;\n\t\t\t\t\t}\n\n\t\t\t\t\tfor (int i = 0; i <= p - 1; i++) {\n\n\t\t\t\t\t\tlong inc = (dp[k - 1][i + 1] * dp[k - 1][p - i]) % MOD;\n\t\t\t\t\t\tinc *= 2 * (i + 1) * (p - i);\n\t\t\t\t\t\tdp[k][p] += inc % MOD;\n\n\t\t\t\t\t\tinc = (dp[k - 1][i + 2] * dp[k - 1][p - i - 1]) % MOD;\n\t\t\t\t\t\tinc *= 2 * (i + 2) * (i + 1);\n\t\t\t\t\t\tdp[k][p] += inc % MOD;\n\n\t\t\t\t\t\tinc = (dp[k - 1][i + 1] * dp[k - 1][p - i - 1]) % MOD;\n\t\t\t\t\t\tinc *= 4 * (i + 1);\n\t\t\t\t\t\tdp[k][p] += inc % MOD;\n\n\t\t\t\t\t\tdp[k][p] += dp[k - 1][i] * dp[k - 1][p - i - 1];\n\t\t\t\t\t\tdp[k][p] %= MOD;\n\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\tSystem.out.println(dp[K][1]);\n\n\t}\n\n}\n", "lang_cluster": "Java", "tags": ["dp", "combinatorics", "trees", "graphs"], "code_uid": "d9d9ffb7a0acb2029383befccf6d272e", "src_uid": "fda761834f7b5800f540178ac1c79fca", "difficulty": 2800.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.*;\r\npublic class Coloring\r\n{\r\n public static void main(String...args)throws IOException\r\n {\r\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\r\n String s = br.readLine();\r\n String[] st = s.trim().split(\"\\\\s+\");\r\n int n = Integer.parseInt(st[0]);\r\n int m = Integer.parseInt(st[1]);\r\n \r\n if(n < m)\r\n n= swap(m , m = n);\r\n \r\n long mod = 998244353;\r\n \r\n long res[][] = new long[n+m][n];\r\n \r\n for(int i = 0 ; i < n+m ; i++){\r\n for(int j = 0 ; j < n ; j++){\r\n if(j == 0)\r\n res[i][j] = 1;\r\n else if(i == 0)\r\n res[i][j] = 0;\r\n else\r\n res[i][j] = (res[i-1][j-1] + res[i-1][j]) % mod;\r\n }\r\n }\r\n \r\n long ans2 = 0;\r\n \r\n for(int rows = 1 ; rows < n ; rows++){\r\n long ans1 = 0;\r\n for(int col = m-1 ; col >= 1 ; col--){\r\n ans1 = (ans1 + res[n - rows + m - col -1][n - rows]*(res[n - rows + col - 1][n - rows - 1])) % mod;\r\n ans2 = (ans2 + res[rows + col -1][rows] * ((res[rows + m - col - 1][rows - 1] * ans1) % mod)) % mod;\r\n }\r\n }\r\n \r\n n= swap(m , m = n);\r\n //System.out.println(n+\" \"+m);\r\n for(int rows = 1 ; rows < n ; rows++){\r\n long ans1 = 0;\r\n for(int col = m-1 ; col >= 1 ; col--){\r\n ans2 = (ans2 + res[rows + col -1][rows] * ((res[rows + m - col - 1][rows - 1] * ans1) % mod)) % mod;\r\n ans1 = (ans1 + res[n - rows + m - col -1][n - rows]*(res[n - rows + col - 1][n - rows - 1])) % mod;\r\n }\r\n }\r\n \r\n ans2 = (ans2 * 2) % mod;\r\n System.out.println(ans2);\r\n \r\n }\r\n \r\n public static int swap(int...args){\r\n return args[0];\r\n }\r\n}", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics"], "code_uid": "a7e13c0134e8b9cbd18b7c9a00bc9dc6", "src_uid": "1738dc65af1fffa445cb0c3074c6bedb", "difficulty": 3100.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "//package round712;\r\nimport java.io.*;\r\nimport java.util.ArrayDeque;\r\nimport java.util.Arrays;\r\nimport java.util.InputMismatchException;\r\nimport java.util.Queue;\r\n\r\npublic class E3 {\r\n\tInputStream is;\r\n\tFastWriter out;\r\n\tString INPUT = \"\";\r\n\tfinal int mod = 998244353;\r\n\tlong[][] C;\r\n\t\r\n\tvoid solve()\r\n\t{\r\n\t\tC = new long[4052 + 1][4052 + 1];\r\n\t\tfor (int i = 0; i <= 4052; i++) {\r\n\t\t\tC[i][0] = 1;\r\n\t\t\tfor (int j = 1; j <= i; j++) {\r\n\t\t\t\tC[i][j] = C[i - 1][j - 1] + C[i - 1][j];\r\n\t\t\t\tif (C[i][j] >= mod) C[i][j] -= mod;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tint H = ni(), W = ni();\r\n\r\n\t\tlong T = 0;\r\n\t\t// O(wh^4)\r\n\t\tfor(int w = 1;w < W;w++) {\r\n\t\t\tlong R = 0;\r\n\t\t\tfor (int hl = 1; hl <= H; hl++) {\r\n\t\t\t\t// 0 <= hr <= H-1-hl\r\n\t\t\t\t// d(hl, w-1) * d(hr, w-1)\r\n\t\t\t\t// C[dr+w-1][w-1] * d(hl, w-1)\r\n\t\t\t\tint hll = H+1 - hl;\r\n\t\t\t\tR += d(hll, W-w-1) * C[H-1-hll+W-w][W-w];\r\n\t\t\t\tR %= mod;\r\n\t\t\t\tT += d(hl, w-1) * C[H-1-hl+w][w] % mod * R;\r\n\t\t\t\tT %= mod;\r\n//\t\t\t\tfor (int hll = 0; hll <= H; hll++) {\r\n//\t\t\t\t\tif (hl + hll > H) {\r\n//\t\t\t\t\t\tT += d(hl, w-1) * C[H-1-hl+w][w] * d(hll, W-w-1) * C[H-1-hll+W-w][W-w];\r\n//\t\t\t\t\t\tT %= mod;\r\n//\t\t\t\t\t}\r\n//\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tT = T * 2;\r\n\r\n\t\tlong IT = 0;\r\n\t\t// O(hw^4)\r\n\t\tfor(int h = 1;h <= H-1;h++){\r\n\t\t\t// C[h-1+l][l]\r\n\t\t\t// C[h-1+r][r-1]\r\n\t\t\tlong R = 0;\r\n\t\t\tfor(int r = W-1;r >= 1;r--){\r\n\t\t\t\tR += d(H-h-1, r) * C[H-h+W-(r+1)][W-(r+1)];\r\n\t\t\t\tR %= mod;\r\n\t\t\t\tIT += C[h-1+r][r-1] * d(h-1, W-r) % mod * R;\r\n\t\t\t\tIT %= mod;\r\n\t\t\t}\r\n\t\t}\r\n\t\tIT *= 2;\r\n\t\tout.println((T+IT)%mod);\r\n\t}\r\n\r\n\tlong d(int h, int w)\r\n\t{\r\n\t\t// begin:h, dec\r\n\t\treturn C[h+w][h];\r\n\t}\r\n\t\r\n\tvoid run() throws Exception\r\n\t{\r\n\t\tis = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());\r\n\t\tout = new FastWriter(System.out);\r\n\t\t\r\n\t\tlong s = System.currentTimeMillis();\r\n\t\tsolve();\r\n\t\tout.flush();\r\n\t\ttr(System.currentTimeMillis()-s+\"ms\");\r\n\t}\r\n\t\r\n\tpublic static void main(String[] args) throws Exception { new E3().run(); }\r\n\t\r\n\tprivate byte[] inbuf = new byte[1024];\r\n\tpublic int lenbuf = 0, ptrbuf = 0;\r\n\t\r\n\tprivate int readByte()\r\n\t{\r\n\t\tif(lenbuf == -1)throw new InputMismatchException();\r\n\t\tif(ptrbuf >= lenbuf){\r\n\t\t\tptrbuf = 0;\r\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\r\n\t\t\tif(lenbuf <= 0)return -1;\r\n\t\t}\r\n\t\treturn inbuf[ptrbuf++];\r\n\t}\r\n\t\r\n\tprivate boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\r\n\tprivate int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\r\n\t\r\n\tprivate double nd() { return Double.parseDouble(ns()); }\r\n\tprivate char nc() { return (char)skip(); }\r\n\t\r\n\tprivate String ns()\r\n\t{\r\n\t\tint b = skip();\r\n\t\tStringBuilder sb = new StringBuilder();\r\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\r\n\t\t\tsb.appendCodePoint(b);\r\n\t\t\tb = readByte();\r\n\t\t}\r\n\t\treturn sb.toString();\r\n\t}\r\n\t\r\n\tprivate char[] ns(int n)\r\n\t{\r\n\t\tchar[] buf = new char[n];\r\n\t\tint b = skip(), p = 0;\r\n\t\twhile(p < n && !(isSpaceChar(b))){\r\n\t\t\tbuf[p++] = (char)b;\r\n\t\t\tb = readByte();\r\n\t\t}\r\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\r\n\t}\r\n\r\n\tprivate int[] na(int n)\r\n\t{\r\n\t\tint[] a = new int[n];\r\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\r\n\t\treturn a;\r\n\t}\r\n\r\n\tprivate long[] nal(int n)\r\n\t{\r\n\t\tlong[] a = new long[n];\r\n\t\tfor(int i = 0;i < n;i++)a[i] = nl();\r\n\t\treturn a;\r\n\t}\r\n\r\n\tprivate char[][] nm(int n, int m) {\r\n\t\tchar[][] map = new char[n][];\r\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\r\n\t\treturn map;\r\n\t}\r\n\r\n\tprivate int[][] nmi(int n, int m) {\r\n\t\tint[][] map = new int[n][];\r\n\t\tfor(int i = 0;i < n;i++)map[i] = na(m);\r\n\t\treturn map;\r\n\t}\r\n\r\n\tprivate int ni() { return (int)nl(); }\r\n\r\n\tprivate long nl()\r\n\t{\r\n\t\tlong num = 0;\r\n\t\tint b;\r\n\t\tboolean minus = false;\r\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\r\n\t\tif(b == '-'){\r\n\t\t\tminus = true;\r\n\t\t\tb = readByte();\r\n\t\t}\r\n\r\n\t\twhile(true){\r\n\t\t\tif(b >= '0' && b <= '9'){\r\n\t\t\t\tnum = num * 10 + (b - '0');\r\n\t\t\t}else{\r\n\t\t\t\treturn minus ? -num : num;\r\n\t\t\t}\r\n\t\t\tb = readByte();\r\n\t\t}\r\n\t}\r\n\r\n\tpublic static class FastWriter\r\n\t{\r\n\t\tprivate static final int BUF_SIZE = 1<<13;\r\n\t\tprivate final byte[] buf = new byte[BUF_SIZE];\r\n\t\tprivate final OutputStream out;\r\n\t\tprivate int ptr = 0;\r\n\r\n\t\tprivate FastWriter(){out = null;}\r\n\r\n\t\tpublic FastWriter(OutputStream os)\r\n\t\t{\r\n\t\t\tthis.out = os;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter(String path)\r\n\t\t{\r\n\t\t\ttry {\r\n\t\t\t\tthis.out = new FileOutputStream(path);\r\n\t\t\t} catch (FileNotFoundException e) {\r\n\t\t\t\tthrow new RuntimeException(\"FastWriter\");\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(byte b)\r\n\t\t{\r\n\t\t\tbuf[ptr++] = b;\r\n\t\t\tif(ptr == BUF_SIZE)innerflush();\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(char c)\r\n\t\t{\r\n\t\t\treturn write((byte)c);\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(char[] s)\r\n\t\t{\r\n\t\t\tfor(char c : s){\r\n\t\t\t\tbuf[ptr++] = (byte)c;\r\n\t\t\t\tif(ptr == BUF_SIZE)innerflush();\r\n\t\t\t}\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(String s)\r\n\t\t{\r\n\t\t\ts.chars().forEach(c -> {\r\n\t\t\t\tbuf[ptr++] = (byte)c;\r\n\t\t\t\tif(ptr == BUF_SIZE)innerflush();\r\n\t\t\t});\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tprivate static int countDigits(int l) {\r\n\t\t\tif (l >= 1000000000) return 10;\r\n\t\t\tif (l >= 100000000) return 9;\r\n\t\t\tif (l >= 10000000) return 8;\r\n\t\t\tif (l >= 1000000) return 7;\r\n\t\t\tif (l >= 100000) return 6;\r\n\t\t\tif (l >= 10000) return 5;\r\n\t\t\tif (l >= 1000) return 4;\r\n\t\t\tif (l >= 100) return 3;\r\n\t\t\tif (l >= 10) return 2;\r\n\t\t\treturn 1;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(int x)\r\n\t\t{\r\n\t\t\tif(x == Integer.MIN_VALUE){\r\n\t\t\t\treturn write((long)x);\r\n\t\t\t}\r\n\t\t\tif(ptr + 12 >= BUF_SIZE)innerflush();\r\n\t\t\tif(x < 0){\r\n\t\t\t\twrite((byte)'-');\r\n\t\t\t\tx = -x;\r\n\t\t\t}\r\n\t\t\tint d = countDigits(x);\r\n\t\t\tfor(int i = ptr + d - 1;i >= ptr;i--){\r\n\t\t\t\tbuf[i] = (byte)('0'+x%10);\r\n\t\t\t\tx /= 10;\r\n\t\t\t}\r\n\t\t\tptr += d;\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tprivate static int countDigits(long l) {\r\n\t\t\tif (l >= 1000000000000000000L) return 19;\r\n\t\t\tif (l >= 100000000000000000L) return 18;\r\n\t\t\tif (l >= 10000000000000000L) return 17;\r\n\t\t\tif (l >= 1000000000000000L) return 16;\r\n\t\t\tif (l >= 100000000000000L) return 15;\r\n\t\t\tif (l >= 10000000000000L) return 14;\r\n\t\t\tif (l >= 1000000000000L) return 13;\r\n\t\t\tif (l >= 100000000000L) return 12;\r\n\t\t\tif (l >= 10000000000L) return 11;\r\n\t\t\tif (l >= 1000000000L) return 10;\r\n\t\t\tif (l >= 100000000L) return 9;\r\n\t\t\tif (l >= 10000000L) return 8;\r\n\t\t\tif (l >= 1000000L) return 7;\r\n\t\t\tif (l >= 100000L) return 6;\r\n\t\t\tif (l >= 10000L) return 5;\r\n\t\t\tif (l >= 1000L) return 4;\r\n\t\t\tif (l >= 100L) return 3;\r\n\t\t\tif (l >= 10L) return 2;\r\n\t\t\treturn 1;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(long x)\r\n\t\t{\r\n\t\t\tif(x == Long.MIN_VALUE){\r\n\t\t\t\treturn write(\"\" + x);\r\n\t\t\t}\r\n\t\t\tif(ptr + 21 >= BUF_SIZE)innerflush();\r\n\t\t\tif(x < 0){\r\n\t\t\t\twrite((byte)'-');\r\n\t\t\t\tx = -x;\r\n\t\t\t}\r\n\t\t\tint d = countDigits(x);\r\n\t\t\tfor(int i = ptr + d - 1;i >= ptr;i--){\r\n\t\t\t\tbuf[i] = (byte)('0'+x%10);\r\n\t\t\t\tx /= 10;\r\n\t\t\t}\r\n\t\t\tptr += d;\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(double x, int precision)\r\n\t\t{\r\n\t\t\tif(x < 0){\r\n\t\t\t\twrite('-');\r\n\t\t\t\tx = -x;\r\n\t\t\t}\r\n\t\t\tx += Math.pow(10, -precision)/2;\r\n\t\t\t//\t\tif(x < 0){ x = 0; }\r\n\t\t\twrite((long)x).write(\".\");\r\n\t\t\tx -= (long)x;\r\n\t\t\tfor(int i = 0;i < precision;i++){\r\n\t\t\t\tx *= 10;\r\n\t\t\t\twrite((char)('0'+(int)x));\r\n\t\t\t\tx -= (int)x;\r\n\t\t\t}\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(char c){\r\n\t\t\treturn write(c).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(int x){\r\n\t\t\treturn write(x).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(long x){\r\n\t\t\treturn write(x).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(double x, int precision){\r\n\t\t\treturn write(x, precision).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(int... xs)\r\n\t\t{\r\n\t\t\tboolean first = true;\r\n\t\t\tfor(int x : xs) {\r\n\t\t\t\tif (!first) write(' ');\r\n\t\t\t\tfirst = false;\r\n\t\t\t\twrite(x);\r\n\t\t\t}\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter write(long... xs)\r\n\t\t{\r\n\t\t\tboolean first = true;\r\n\t\t\tfor(long x : xs) {\r\n\t\t\t\tif (!first) write(' ');\r\n\t\t\t\tfirst = false;\r\n\t\t\t\twrite(x);\r\n\t\t\t}\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln()\r\n\t\t{\r\n\t\t\treturn write((byte)'\\n');\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(int... xs)\r\n\t\t{\r\n\t\t\treturn write(xs).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(long... xs)\r\n\t\t{\r\n\t\t\treturn write(xs).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(char[] line)\r\n\t\t{\r\n\t\t\treturn write(line).writeln();\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(char[]... map)\r\n\t\t{\r\n\t\t\tfor(char[] line : map)write(line).writeln();\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tpublic FastWriter writeln(String s)\r\n\t\t{\r\n\t\t\treturn write(s).writeln();\r\n\t\t}\r\n\r\n\t\tprivate void innerflush()\r\n\t\t{\r\n\t\t\ttry {\r\n\t\t\t\tout.write(buf, 0, ptr);\r\n\t\t\t\tptr = 0;\r\n\t\t\t} catch (IOException e) {\r\n\t\t\t\tthrow new RuntimeException(\"innerflush\");\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tpublic void flush()\r\n\t\t{\r\n\t\t\tinnerflush();\r\n\t\t\ttry {\r\n\t\t\t\tout.flush();\r\n\t\t\t} catch (IOException e) {\r\n\t\t\t\tthrow new RuntimeException(\"flush\");\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tpublic FastWriter print(byte b) { return write(b); }\r\n\t\tpublic FastWriter print(char c) { return write(c); }\r\n\t\tpublic FastWriter print(char[] s) { return write(s); }\r\n\t\tpublic FastWriter print(String s) { return write(s); }\r\n\t\tpublic FastWriter print(int x) { return write(x); }\r\n\t\tpublic FastWriter print(long x) { return write(x); }\r\n\t\tpublic FastWriter print(double x, int precision) { return write(x, precision); }\r\n\t\tpublic FastWriter println(char c){ return writeln(c); }\r\n\t\tpublic FastWriter println(int x){ return writeln(x); }\r\n\t\tpublic FastWriter println(long x){ return writeln(x); }\r\n\t\tpublic FastWriter println(double x, int precision){ return writeln(x, precision); }\r\n\t\tpublic FastWriter print(int... xs) { return write(xs); }\r\n\t\tpublic FastWriter print(long... xs) { return write(xs); }\r\n\t\tpublic FastWriter println(int... xs) { return writeln(xs); }\r\n\t\tpublic FastWriter println(long... xs) { return writeln(xs); }\r\n\t\tpublic FastWriter println(char[] line) { return writeln(line); }\r\n\t\tpublic FastWriter println(char[]... map) { return writeln(map); }\r\n\t\tpublic FastWriter println(String s) { return writeln(s); }\r\n\t\tpublic FastWriter println() { return writeln(); }\r\n\t}\r\n\r\n\tpublic void trnz(int... o)\r\n\t{\r\n\t\tfor(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+\":\"+o[i]+\" \");\r\n\t\tSystem.out.println();\r\n\t}\r\n\r\n\t// print ids which are 1\r\n\tpublic void trt(long... o)\r\n\t{\r\n\t\tQueue<Integer> stands = new ArrayDeque<>();\r\n\t\tfor(int i = 0;i < o.length;i++){\r\n\t\t\tfor(long x = o[i];x != 0;x &= x-1)stands.add(i<<6|Long.numberOfTrailingZeros(x));\r\n\t\t}\r\n\t\tSystem.out.println(stands);\r\n\t}\r\n\r\n\tpublic void tf(boolean... r)\r\n\t{\r\n\t\tfor(boolean x : r)System.out.print(x?'#':'.');\r\n\t\tSystem.out.println();\r\n\t}\r\n\r\n\tpublic void tf(boolean[]... b)\r\n\t{\r\n\t\tfor(boolean[] r : b) {\r\n\t\t\tfor(boolean x : r)System.out.print(x?'#':'.');\r\n\t\t\tSystem.out.println();\r\n\t\t}\r\n\t\tSystem.out.println();\r\n\t}\r\n\r\n\tpublic void tf(long[]... b)\r\n\t{\r\n\t\tif(INPUT.length() != 0) {\r\n\t\t\tfor (long[] r : b) {\r\n\t\t\t\tfor (long x : r) {\r\n\t\t\t\t\tfor (int i = 0; i < 64; i++) {\r\n\t\t\t\t\t\tSystem.out.print(x << ~i < 0 ? '#' : '.');\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\tSystem.out.println();\r\n\t\t\t}\r\n\t\t\tSystem.out.println();\r\n\t\t}\r\n\t}\r\n\r\n\tpublic void tf(long... b)\r\n\t{\r\n\t\tif(INPUT.length() != 0) {\r\n\t\t\tfor (long x : b) {\r\n\t\t\t\tfor (int i = 0; i < 64; i++) {\r\n\t\t\t\t\tSystem.out.print(x << ~i < 0 ? '#' : '.');\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tSystem.out.println();\r\n\t\t}\r\n\t}\r\n\r\n\tprivate boolean oj = System.getProperty(\"ONLINE_JUDGE\") != null;\r\n\tprivate void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }\r\n}\r\n", "lang_cluster": "Java", "tags": ["math", "dp", "combinatorics"], "code_uid": "fbaf9efd839c136fc0115b134fadf9f8", "src_uid": "1738dc65af1fffa445cb0c3074c6bedb", "difficulty": 3100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.HashMap;\nimport java.util.InputMismatchException;\nimport java.util.LinkedList;\nimport java.util.Queue;\nimport java.util.Scanner;\nimport java.util.Stack;\nimport java.util.StringTokenizer;\nimport java.io.BufferedReader;\nimport java.io.ByteArrayInputStream;\nimport java.io.DataInputStream;\nimport java.io.FileReader;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.PrintWriter;\nimport java.io.InputStream;\nimport java.io.FileInputStream;\nimport java.io.IOException;\n/**\n * Actual solution is at the top\n * @author Tapan Sahni\n */\n\npublic class Tapan {\n public final static void main(String[] args) throws IOException {\n // TODO Auto-generated method stub\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n // Scanner in = new Scanner(inputStream);\n Reader in = new Reader();\n PrintWriter out = new PrintWriter(outputStream);\n Task_C solver = new Task_C();\n solver.solve( in, out);\n out.close();\n }\n}\nclass Task_C {\n\n @SuppressWarnings(\"unused\")\n \n public long step (long a , long b , long k){\n long ret = 0;\n while(a > b){\n long Max = 1;\n for(long i = 2 ;i<= k;i++ ){\n long l1 = a%i;\n if(a - l1 >= b)\n Max = Math.max(Max, l1);\n }\n if(Max == 0) Max = 1;\n a-=Max;\n ret++;\n }\n return ret;\n }\n public void solve(Reader in, PrintWriter out) throws IOException {\n long a = in.nextLong() , b = in.nextLong();\n long k = in.nextLong();\n long L = 360360L; \n if(a - b <= L) out.println(step(a , b , k));\n else{\n long ans = step(a%L , 0 , k);\n ans = ans + (long)step(L , 0 , k) * (a/L - b/L -1);\n ans = ans + (long)step(L ,b%L , k);\n out.println(ans);\n }\n }\n}\nclass Reader {\n final private int BUFFER_SIZE = 1 << 16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n\n public Reader() {\n din = new DataInputStream(System.in);\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public Reader(String file_name) throws IOException {\n din = new DataInputStream(new FileInputStream(file_name));\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public String readLine() throws IOException {\n byte[] buf = new byte[1001]; // line length\n int cnt = 0, c;\n while ((c = read()) != -1) {\n if (c == '\\n')\n break;\n buf[cnt++] = (byte) c;\n }\n return new String(buf, 0, cnt);\n }\n\n public int nextInt() throws IOException {\n int ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n if (neg)\n return -ret;\n return ret;\n }\n\n public long nextLong() throws IOException {\n long ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n if (neg)\n return -ret;\n return ret;\n }\n\n public double nextDouble() throws IOException {\n double ret = 0, div = 1;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n if (c == '.')\n while ((c = read()) >= '0' && c <= '9')\n ret += (c - '0') / (div *= 10);\n if (neg)\n return -ret;\n return ret;\n }\n\n public char nextChar() throws IOException {\n byte c = read();\n while (c <= ' ')\n c = read();\n return (char) c;\n }\n\n private void fillBuffer() throws IOException {\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1)\n buffer[0] = -1;\n }\n\n private byte read() throws IOException {\n if (bufferPointer == bytesRead)\n fillBuffer();\n return buffer[bufferPointer++];\n }\n\n public void close() throws IOException {\n if (din == null)\n return;\n din.close();\n }\n} \nclass InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n}\n", "lang_cluster": "Java", "tags": ["dp", "number theory"], "code_uid": "e6c7673e8114e290c997e2c634238cef", "src_uid": "bd599d76c83cc1f30c1349ffb51b4273", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Java 7", "source_code": "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\n\npublic class E {\n\n\n static int find(fenwik_tree t, int y, int lo, int hi) {\n while(lo<=hi) {\n int mid=(lo+hi)>>1;\n long cnt=t.query(0, mid);\n\n if(cnt<y) {\n lo=mid+1;\n } else {\n hi=mid-1;\n }\n }\n return hi+1;\n }\n \n static void run_stream(InputStream ins) throws IOException {\n BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n String[] nm=br.readLine().split(\" \");\n int n=Integer.parseInt(nm[0]);\n int m=Integer.parseInt(nm[1]);\n \n int[] i2c=new int[n+m+1];\n fenwik_tree t=new fenwik_tree(n+m+1);\n for (int i=1; i<=n; i++) {\n t.update(m+i, 1);\n i2c[m+i]=i;\n }\n\n int[] out=new int[n+1];\n for (int i=0; i<m; i++) {\n String[] xy=br.readLine().split(\" \");\n int x=Integer.parseInt(xy[0]);\n int y=Integer.parseInt(xy[1]);\n \n int j=find(t, y, m-i, n+m), k=i2c[j];\n if(out[k]>0&&out[k]!=x) {\n System.out.println(\"-1\");\n return;\n } else {\n out[k]=x;\n }\n t.update(j,-1); i2c[j]=-1; \n t.update(m-i,1); i2c[m-i]=k;\n }\n \n boolean[] b=new boolean[n+1]; int j=1;\n for (int i=1; i<=n; i++) {\n if(out[i]!=0) {\n if(b[out[i]]) {\n System.out.println(\"-1\");\n return;\n }\n b[out[i]]=true;\n }\n }\n \n for (int i=1; i<=n; i++) {\n if(out[i]==0) {\n while(b[j]) {\n j++;\n }\n out[i]=j;\n }\n b[out[i]]=true;\n }\n \n StringBuilder sb=new StringBuilder();\n for (int i=1; i<=n; i++) {\n sb.append(out[i]+\" \");\n }\n System.out.println(sb.toString());\n }\n\n public static void main(String[] args) throws IOException {\n run_stream(System.in);\n }\n\n \n static class fenwik_tree {\n int n;\n long[] fadd;\n \n fenwik_tree(int n) {\n this.n=n; fadd=new long[n];\n }\n \n void update(int i, long add) {\n while (i<n) {\n fadd[i]+=add;\n i|=(i+1);\n }\n }\n\n long query(int i) {\n long ret=0;\n while (i>=0) {\n ret+=fadd[i];\n i=(i&(i+1))-1;\n }\n return ret;\n }\n \n long query(int l, int r) {\n return query(r)-query(l-1);\n }\n }\n\n}\n", "lang_cluster": "Java", "tags": ["data structures"], "code_uid": "84efa4a720b0b61efef8248c6395a4df", "src_uid": "a2616b1681f30ce4b2a5fdc81cf52b50", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class PuttingBoxesTogether {\n static final long MOD = 1000000007L;\n public static void main(String[] args) {\n FastScanner scanner = new FastScanner();\n PrintWriter out = new PrintWriter(System.out);\n int N = scanner.nextInt();\n int Q = scanner.nextInt();\n long[] pos = new long[N];\n long[] weights = new long[N];\n BIT bit1 = new BIT(N);\n BIT bit2 = new BIT(N);\n for(int i = 0; i < N; i++) {\n pos[i] = scanner.nextInt();\n }\n for(int i = 0; i < N; i++) weights[i] = scanner.nextInt();\n for(int i = 0; i < N; i++) {\n pos[i] -= i;\n bit1.update(i, weights[i]);\n bit2.update(i, (weights[i] * pos[i])%MOD);\n }\n while(Q-->0) {\n int x = scanner.nextInt();\n int y = scanner.nextInt();\n if (x < 0) {\n //update event\n x = -x -1;\n bit1.update(x, -weights[x]);\n bit2.update(x, -((weights[x]*pos[x])%MOD));\n weights[x] = y;\n bit1.update(x, weights[x]);\n bit2.update(x, (weights[x]*pos[x])%MOD);\n }\n else {\n x--;\n long s = bit1.rangeSum(x, y);\n int lo = x, hi = y;\n while (hi - lo > 1) {\n int mid = (lo + hi)/2;\n if (bit1.rangeSum(x, mid) * 2 <= s) lo = mid;\n else hi = mid;\n }\n long ret = norm(mul(pos[lo], norm(bit1.rangeSum(x, lo))) - norm(bit2.rangeSum(x, lo)));\n ret = norm(ret + norm(norm(bit2.rangeSum( lo + 1, y)) - mul(pos[lo], norm(bit1.rangeSum(lo + 1, y)))));\n out.println(ret );\n\n }\n }\n out.flush();\n }\n static long mul(long a, long b) {\n return a * b % MOD;\n }\n\n static long norm(long a) {\n a %= MOD;\n if (a > MOD) a -= MOD;\n if (a < 0) a += MOD;\n return a;\n }\n public static class BIT {\n long[] table;\n int size;\n public BIT(int ss) {\n size = ss;\n table = new long[ss];\n }\n private void update(int loc, long amt) {\n for (int x = loc; x < size; x = x | x + 1) table[x] += amt;\n }\n private long prefixSum(int loc) {\n long res = 0;\n for (int x = loc; x >= 0; x = (x & x + 1) - 1) res += table[x];\n return res;\n }\n private long rangeSum(int l, int r) {\n return prefixSum(r-1) - prefixSum(l-1);\n }\n }\n public static class FastScanner {\n BufferedReader br;\n StringTokenizer st;\n\n public FastScanner(Reader in) {\n br = new BufferedReader(in);\n }\n\n public FastScanner() {\n this(new InputStreamReader(System.in));\n }\n\n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String readNextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n\n int[] readIntArray(int n) {\n int[] a = new int[n];\n for (int idx = 0; idx < n; idx++) {\n a[idx] = nextInt();\n }\n return a;\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["data structures"], "code_uid": "190bae06026309b4816f98f37660cfdd", "src_uid": "c0715f71efa327070eba7e491856d66a", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\n/**\n * @author Don Li\n */\npublic class PuttingBoxesTogether2 {\n \n int N = (int) 2e5 + 10;\n int MOD = (int) 1e9 + 7;\n int INF = (int) 2e9;\n \n int n;\n long[] t1 = new long[N << 2];\n long[] t2 = new long[N << 2];\n \n void solve() {\n n = in.nextInt(); int Q = in.nextInt();\n long[] a = new long[n];\n for (int i = 0; i < n; i++) a[i] = in.nextInt();\n long[] w = new long[n];\n for (int i = 0; i < n; i++) w[i] = in.nextInt();\n \n for (int i = 0; i < n; i++) a[i] -= i;\n \n long[] aw = new long[n];\n for (int i = 0; i < n; i++) aw[i] = mul(a[i], w[i]);\n \n build(t1, 0, 0, n, w);\n build(t2, 0, 0, n, aw);\n \n while (Q-- > 0) {\n int x = in.nextInt();\n if (x < 0) {\n int i = -x - 1, nw = in.nextInt();\n update(t1, 0, 0, n, i, nw);\n update(t2, 0, 0, n, i, mul(a[i], nw));\n } else {\n int l = x - 1, r = in.nextInt();\n long tot = query(t1, 0, 0, n, l, r);\n int k = (int) find(t1, 0, 0, n, l, r, tot / 2)[0];\n long ans = norm(mul(a[k], norm(query(t1, 0, 0, n, l, k))) - norm(query(t2, 0, 0, n, l, k)));\n ans = norm(ans + norm(norm(query(t2, 0, 0, n, k + 1, r)) - mul(a[k], norm(query(t1, 0, 0, n, k + 1, r)))));\n out.println(ans);\n }\n }\n }\n \n long[] find(long[] t, int k, int l, int r, int a, int b, long val) {\n if (l == a && r == b) {\n if (t[k] <= val) return new long[]{INF, t[k]};\n if (r - l == 1) return new long[]{l, t[l]};\n }\n int m = (l + r) >> 1;\n long pos = INF, sum = 0;\n if (a < m) {\n long[] ret = find(t, 2 * k + 1, l, m, a, Math.min(m, b), val);\n pos = Math.min(pos, ret[0]);\n sum += ret[1];\n }\n if (pos == INF && b >= m) {\n long[] ret = find(t, 2 * k + 2, m, r, Math.max(m, a), b, val - sum);\n pos = Math.min(pos, ret[0]);\n sum += ret[1];\n }\n return new long[]{pos, sum};\n }\n \n long query(long[] t, int k, int l, int r, int a, int b) {\n if (a <= l && r <= b) return t[k];\n if (a >= r || b <= l) return 0;\n int m = (l + r) >> 1;\n return query(t, 2 * k + 1, l, m, a, b) + query(t, 2 * k + 2, m, r, a, b);\n }\n \n void update(long[] t, int k, int l, int r, int i, long val) {\n if (r - l == 1) {\n t[k] = val;\n return;\n }\n int m = (l + r) >> 1;\n if (i < m) update(t, 2 * k + 1, l, m, i, val);\n else update(t, 2 * k + 2, m, r, i, val);\n t[k] = t[2 * k + 1] + t[2 * k + 2];\n }\n \n void build(long[] t, int k, int l, int r, long[] x) {\n if (r - l == 1) {\n t[k] = x[l];\n return;\n }\n int m = (l + r) >> 1;\n build(t, 2 * k + 1, l, m, x);\n build(t, 2 * k + 2, m, r, x);\n t[k] = t[2 * k + 1] + t[2 * k + 2];\n }\n \n long mul(long a, long b) {\n return a * b % MOD;\n }\n \n long norm(long a) {\n a %= MOD;\n if (a > MOD) a -= MOD;\n if (a < 0) a += MOD;\n return a;\n }\n \n public static void main(String[] args) {\n in = new FastScanner(new BufferedReader(new InputStreamReader(System.in)));\n out = new PrintWriter(System.out);\n new PuttingBoxesTogether2().solve();\n out.close();\n }\n \n static FastScanner in;\n static PrintWriter out;\n \n static class FastScanner {\n BufferedReader in;\n StringTokenizer st;\n \n public FastScanner(BufferedReader in) {\n this.in = in;\n }\n \n public String nextToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(in.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n \n public int nextInt() {\n return Integer.parseInt(nextToken());\n }\n \n public long nextLong() {\n return Long.parseLong(nextToken());\n }\n \n public double nextDouble() {\n return Double.parseDouble(nextToken());\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["data structures"], "code_uid": "c013173f8e1a021b4c3f986caf1d49a5", "src_uid": "c0715f71efa327070eba7e491856d66a", "difficulty": 2500.0, "exec_outcome": "PASSED"}
{"lang": "Java 11", "source_code": "import java.io.OutputStream;\r\nimport java.io.IOException;\r\nimport java.io.InputStream;\r\nimport java.io.OutputStream;\r\nimport java.io.PrintWriter;\r\nimport java.util.Arrays;\r\nimport java.io.BufferedWriter;\r\nimport java.io.Writer;\r\nimport java.io.OutputStreamWriter;\r\nimport java.util.InputMismatchException;\r\nimport java.io.IOException;\r\nimport java.io.InputStream;\r\n \r\n/**\r\n * stescobedo\r\n */\r\npublic class Main {\r\n public static void main(String[] args) {\r\n InputStream inputStream = System.in;\r\n OutputStream outputStream = System.out;\r\n InputReader in = new InputReader(inputStream);\r\n OutputWriter out = new OutputWriter(outputStream);\r\n FNezzarAndChocolateBars solver = new FNezzarAndChocolateBars();\r\n solver.solve(1, in, out);\r\n out.close();\r\n }\r\n \r\n static class FNezzarAndChocolateBars {\r\n static final int MAXN = 2048;\r\n static final int modulo = 998244353;\r\n \r\n public int add(int x, int y) {\r\n x += y;\r\n if (x >= modulo) x -= modulo;\r\n return x;\r\n }\r\n \r\n public int subtract(int x, int y) {\r\n x -= y;\r\n if (x < 0) x += modulo;\r\n return x;\r\n }\r\n \r\n public int multiply(int x, int y) {\r\n return (int) ((x * 1L * y) % modulo);\r\n }\r\n \r\n public int power(int x, long y) {\r\n int ans = 1;\r\n for (; y > 0; y >>= 1, x = (int) ((x * 1L * x) % modulo))\r\n if (y % 2 == 1) ans = (int) ((ans * 1L * x) % modulo);\r\n return ans;\r\n }\r\n \r\n public int inverse(int x) {\r\n return power(x, modulo - 2);\r\n }\r\n \r\n public void solve(int testNumber, InputReader in, OutputWriter out) {\r\n int[] fact = new int[MAXN];\r\n int[] ifact = new int[MAXN];\r\n fact[0] = ifact[0] = 1;\r\n for (int i = 1; i < MAXN; i++) {\r\n fact[i] = multiply(fact[i - 1], i);\r\n ifact[i] = inverse(fact[i]);\r\n }\r\n int n = in.nextInt(), k = in.nextInt();\r\n int[] l = in.readIntArray(n);\r\n int[][][] dp = new int[2][MAXN][n + 1];\r\n dp[1][0][0] = 1;\r\n int s = 0;\r\n \r\n for (int p = 0; p < n; p++) {\r\n int L = l[p];\r\n int invL = inverse(L);\r\n int[] coeffs = new int[L / k + 1];\r\n int[] coeffs2 = new int[L / k + 1];\r\n for (int i = 0; i <= L / k; i++) {\r\n if (k * i == L) continue;\r\n int z = ifact[i];\r\n if (i % 2 == 1) z = subtract(0, z);\r\n coeffs[i] = multiply(z, power(L - k * i, i));\r\n \r\n if (i >= 1) {\r\n coeffs2[i] = multiply(z, multiply(i, power(L - k * i, i - 1)));\r\n }\r\n }\r\n int r = p & 1;\r\n int h = r ^ 1;\r\n for (int i = 0; i <= s / k; i++) Arrays.fill(dp[r][i], 0);\r\n for (int i = 0; i <= s / k; i++)\r\n for (int j = 0; j <= p; j++)\r\n if (dp[h][i][j] != 0) {\r\n int value = dp[h][i][j];\r\n for (int t = 0; t <= L / k; t++) {\r\n dp[r][i + t][j] = add(dp[r][i + t][j], multiply(value, coeffs[t]));\r\n if (t > 0) {\r\n dp[r][i + t - 1][j + 1] = add(dp[r][i + t - 1][j + 1], multiply(value, coeffs2[t]));\r\n }\r\n }\r\n }\r\n s += L;\r\n }\r\n int answer = 0;\r\n for (int i = 0; i <= s / k; i++)\r\n for (int r = 0; r <= n; r++) {\r\n int value = dp[(n - 1) & 1][i][r];\r\n int j = i + r;\r\n if (j == 0) continue;\r\n int temp = multiply(fact[i], inverse(power(k * j, i + 1)));\r\n answer = add(answer, multiply(value, temp));\r\n }\r\n out.println(multiply(subtract(0, s), answer));\r\n }\r\n \r\n }\r\n \r\n static class InputReader {\r\n private InputStream stream;\r\n private byte[] buf = new byte[1024];\r\n private int curChar;\r\n private int numChars;\r\n private InputReader.SpaceCharFilter filter;\r\n \r\n public InputReader(InputStream stream) {\r\n this.stream = stream;\r\n }\r\n \r\n public int[] readIntArray(int size) {\r\n int[] array = new int[size];\r\n for (int i = 0; i < size; i++) {\r\n array[i] = readInt();\r\n }\r\n return array;\r\n }\r\n \r\n public int read() {\r\n if (numChars == -1) {\r\n throw new InputMismatchException();\r\n }\r\n if (curChar >= numChars) {\r\n curChar = 0;\r\n try {\r\n numChars = stream.read(buf);\r\n } catch (IOException e) {\r\n throw new InputMismatchException();\r\n }\r\n if (numChars <= 0) {\r\n return -1;\r\n }\r\n }\r\n return buf[curChar++];\r\n }\r\n \r\n public int nextInt() {\r\n int c = read();\r\n while (isSpaceChar(c)) c = read();\r\n int sgn = 1;\r\n if (c == '-') {\r\n sgn = -1;\r\n c = read();\r\n }\r\n int res = 0;\r\n do {\r\n if (c < '0' || c > '9')\r\n throw new InputMismatchException();\r\n res *= 10;\r\n res += c - '0';\r\n c = read();\r\n } while (!isSpaceChar(c));\r\n return res * sgn;\r\n }\r\n \r\n public int readInt() {\r\n int c = read();\r\n while (isSpaceChar(c)) {\r\n c = read();\r\n }\r\n int sgn = 1;\r\n if (c == '-') {\r\n sgn = -1;\r\n c = read();\r\n }\r\n int res = 0;\r\n do {\r\n if (c < '0' || c > '9') {\r\n throw new InputMismatchException();\r\n }\r\n res *= 10;\r\n res += c - '0';\r\n c = read();\r\n } while (!isSpaceChar(c));\r\n return res * sgn;\r\n }\r\n \r\n public boolean isSpaceChar(int c) {\r\n if (filter != null) {\r\n return filter.isSpaceChar(c);\r\n }\r\n return isWhitespace(c);\r\n }\r\n \r\n public static boolean isWhitespace(int c) {\r\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\r\n }\r\n \r\n public interface SpaceCharFilter {\r\n public boolean isSpaceChar(int ch);\r\n \r\n }\r\n \r\n }\r\n \r\n static class OutputWriter {\r\n private final PrintWriter writer;\r\n \r\n public OutputWriter(OutputStream outputStream) {\r\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\r\n }\r\n \r\n public OutputWriter(Writer writer) {\r\n this.writer = new PrintWriter(writer);\r\n }\r\n \r\n public void println(Object... objects) {\r\n for (int i = 0; i < objects.length; i++) {\r\n if (i != 0) {\r\n writer.print(' ');\r\n }\r\n writer.print(objects[i]);\r\n }\r\n writer.print('\\n');\r\n }\r\n \r\n public void close() {\r\n writer.close();\r\n }\r\n \r\n }\r\n}", "lang_cluster": "Java", "tags": ["math", "probabilities", "combinatorics", "fft"], "code_uid": "3f0f6606bec4e326e12f218b4ac3e610", "src_uid": "26d565c193a5920b042c783109496b4c", "difficulty": 3500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.OutputStream;\r\nimport java.io.IOException;\r\nimport java.io.InputStream;\r\nimport java.io.OutputStream;\r\nimport java.io.PrintWriter;\r\nimport java.util.Arrays;\r\nimport java.io.BufferedWriter;\r\nimport java.io.Writer;\r\nimport java.io.OutputStreamWriter;\r\nimport java.util.InputMismatchException;\r\nimport java.io.IOException;\r\nimport java.io.InputStream;\r\n \r\n/**\r\n * stescobedo\r\n */\r\npublic class Main {\r\n public static void main(String[] args) {\r\n InputStream inputStream = System.in;\r\n OutputStream outputStream = System.out;\r\n InputReader in = new InputReader(inputStream);\r\n OutputWriter out = new OutputWriter(outputStream);\r\n FNezzarAndChocolateBars solver = new FNezzarAndChocolateBars();\r\n solver.solve(1, in, out);\r\n out.close();\r\n }\r\n \r\n static class FNezzarAndChocolateBars {\r\n static final int MAXN = 2048;\r\n static final int modulo = 998244353;\r\n \r\n public int add(int x, int y) {\r\n x += y;\r\n if (x >= modulo) x -= modulo;\r\n return x;\r\n }\r\n \r\n public int subtract(int x, int y) {\r\n x -= y;\r\n if (x < 0) x += modulo;\r\n return x;\r\n }\r\n \r\n public int multiply(int x, int y) {\r\n return (int) ((x * 1L * y) % modulo);\r\n }\r\n \r\n public int power(int x, long y) {\r\n int ans = 1;\r\n for (; y > 0; y >>= 1, x = (int) ((x * 1L * x) % modulo))\r\n if (y % 2 == 1) ans = (int) ((ans * 1L * x) % modulo);\r\n return ans;\r\n }\r\n \r\n public int inverse(int x) {\r\n return power(x, modulo - 2);\r\n }\r\n \r\n public void solve(int testNumber, InputReader in, OutputWriter out) {\r\n int[] fact = new int[MAXN];\r\n int[] ifact = new int[MAXN];\r\n fact[0] = ifact[0] = 1;\r\n for (int i = 1; i < MAXN; i++) {\r\n fact[i] = multiply(fact[i - 1], i);\r\n ifact[i] = inverse(fact[i]);\r\n }\r\n int n = in.nextInt(), k = in.nextInt();\r\n int[] l = in.readIntArray(n);\r\n int[][][] dp = new int[2][MAXN][n + 1];\r\n dp[1][0][0] = 1;\r\n int s = 0;\r\n \r\n for (int p = 0; p < n; p++) {\r\n int L = l[p];\r\n int invL = inverse(L);\r\n int[] coeffs = new int[L / k + 1];\r\n int[] coeffs2 = new int[L / k + 1];\r\n for (int i = 0; i <= L / k; i++) {\r\n if (k * i == L) continue;\r\n int z = ifact[i];\r\n if (i % 2 == 1) z = subtract(0, z);\r\n coeffs[i] = multiply(z, power(L - k * i, i));\r\n \r\n if (i >= 1) {\r\n coeffs2[i] = multiply(z, multiply(i, power(L - k * i, i - 1)));\r\n }\r\n }\r\n int r = p & 1;\r\n int h = r ^ 1;\r\n for (int i = 0; i <= s / k; i++) Arrays.fill(dp[r][i], 0);\r\n for (int i = 0; i <= s / k; i++)\r\n for (int j = 0; j <= p; j++)\r\n if (dp[h][i][j] != 0) {\r\n int value = dp[h][i][j];\r\n for (int t = 0; t <= L / k; t++) {\r\n dp[r][i + t][j] = add(dp[r][i + t][j], multiply(value, coeffs[t]));\r\n if (t > 0) {\r\n dp[r][i + t - 1][j + 1] = add(dp[r][i + t - 1][j + 1], multiply(value, coeffs2[t]));\r\n }\r\n }\r\n }\r\n s += L;\r\n }\r\n int answer = 0;\r\n for (int i = 0; i <= s / k; i++)\r\n for (int r = 0; r <= n; r++) {\r\n int value = dp[(n - 1) & 1][i][r];\r\n int j = i + r;\r\n if (j == 0) continue;\r\n int temp = multiply(fact[i], inverse(power(k * j, i + 1)));\r\n answer = add(answer, multiply(value, temp));\r\n }\r\n out.println(multiply(subtract(0, s), answer));\r\n }\r\n \r\n }\r\n \r\n static class InputReader {\r\n private InputStream stream;\r\n private byte[] buf = new byte[1024];\r\n private int curChar;\r\n private int numChars;\r\n private InputReader.SpaceCharFilter filter;\r\n \r\n public InputReader(InputStream stream) {\r\n this.stream = stream;\r\n }\r\n \r\n public int[] readIntArray(int size) {\r\n int[] array = new int[size];\r\n for (int i = 0; i < size; i++) {\r\n array[i] = readInt();\r\n }\r\n return array;\r\n }\r\n \r\n public int read() {\r\n if (numChars == -1) {\r\n throw new InputMismatchException();\r\n }\r\n if (curChar >= numChars) {\r\n curChar = 0;\r\n try {\r\n numChars = stream.read(buf);\r\n } catch (IOException e) {\r\n throw new InputMismatchException();\r\n }\r\n if (numChars <= 0) {\r\n return -1;\r\n }\r\n }\r\n return buf[curChar++];\r\n }\r\n \r\n public int nextInt() {\r\n int c = read();\r\n while (isSpaceChar(c)) c = read();\r\n int sgn = 1;\r\n if (c == '-') {\r\n sgn = -1;\r\n c = read();\r\n }\r\n int res = 0;\r\n do {\r\n if (c < '0' || c > '9')\r\n throw new InputMismatchException();\r\n res *= 10;\r\n res += c - '0';\r\n c = read();\r\n } while (!isSpaceChar(c));\r\n return res * sgn;\r\n }\r\n \r\n public int readInt() {\r\n int c = read();\r\n while (isSpaceChar(c)) {\r\n c = read();\r\n }\r\n int sgn = 1;\r\n if (c == '-') {\r\n sgn = -1;\r\n c = read();\r\n }\r\n int res = 0;\r\n do {\r\n if (c < '0' || c > '9') {\r\n throw new InputMismatchException();\r\n }\r\n res *= 10;\r\n res += c - '0';\r\n c = read();\r\n } while (!isSpaceChar(c));\r\n return res * sgn;\r\n }\r\n \r\n public boolean isSpaceChar(int c) {\r\n if (filter != null) {\r\n return filter.isSpaceChar(c);\r\n }\r\n return isWhitespace(c);\r\n }\r\n \r\n public static boolean isWhitespace(int c) {\r\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\r\n }\r\n \r\n public interface SpaceCharFilter {\r\n public boolean isSpaceChar(int ch);\r\n \r\n }\r\n \r\n }\r\n \r\n static class OutputWriter {\r\n private final PrintWriter writer;\r\n \r\n public OutputWriter(OutputStream outputStream) {\r\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\r\n }\r\n \r\n public OutputWriter(Writer writer) {\r\n this.writer = new PrintWriter(writer);\r\n }\r\n \r\n public void println(Object... objects) {\r\n for (int i = 0; i < objects.length; i++) {\r\n if (i != 0) {\r\n writer.print(' ');\r\n }\r\n writer.print(objects[i]);\r\n }\r\n writer.print('\\n');\r\n }\r\n \r\n public void close() {\r\n writer.close();\r\n }\r\n \r\n }\r\n}", "lang_cluster": "Java", "tags": ["math", "probabilities", "combinatorics", "fft"], "code_uid": "258b7af256efbb2f2302b3854cee837f", "src_uid": "26d565c193a5920b042c783109496b4c", "difficulty": 3500.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.StringTokenizer;\n\npublic class _LiftLevel5E {\n\n\tstatic boolean[][] locked;\n\tstatic int[][] board;\n\tstatic int[][] solved;\n\tstatic int w, h;\n\tstatic ArrayList<String> answer=new ArrayList<>();\n\t\n\tpublic static void main(String[] args) {\n\t\tFastScanner fs=new FastScanner();\n\t\th=fs.nextInt(); w=fs.nextInt();\n\t\tboard=new int[w][h];\n\t\tsolved=new int[w][h];\n\t\tlocked=new boolean[w][h];\n\t\tfor (int y=0; y<h; y++) {\n\t\t\tfor (int x=0; x<w; x++) {\n\t\t\t\tboard[x][y]=fs.nextInt();\n\t\t\t\tsolved[x][y]=x+y*w+1;\t\n\t\t\t}\n\t\t}\n\t\t//solve ys [0, h-2)\n\t\tfor (int yToSolveFor=0; yToSolveFor<h-2; yToSolveFor++) {\n\t\t\tfor (int xToSolveFor=0; xToSolveFor<w-1; xToSolveFor++) {\n\t\t\t\tnaiveMoveToXFirst(solved[xToSolveFor][yToSolveFor], xToSolveFor, yToSolveFor);\n\t\t\t\tlocked[xToSolveFor][yToSolveFor]=true;\n\t\t\t}\n\t\t\t//now handle the rightmost position\n\t\t\tif (board[w-1][yToSolveFor]==solved[w-1][yToSolveFor]) {\n\t\t\t\tlocked[w-1][yToSolveFor]=true;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tnaiveMoveToXFirst(solved[w-1][yToSolveFor], w-1, h-1);\n\t\t\thardCW4(w-2, yToSolveFor);\n\t\t\tnaiveMoveToXFirst(solved[w-1][yToSolveFor], w-1, yToSolveFor+1);\n\t\t\thardCCW4(w-2, yToSolveFor);\n\t\t\tlocked[w-2][yToSolveFor]=locked[w-1][yToSolveFor]=true;\n\t\t}\n//\t\tprint(board);\n\t\t\n\t\t//now we only have the last two ys left\n\t\tfor (int x=0; x<w-2; x++) {\n//\t\t\tprint(board);\n\t\t\tnaiveMoveToXFirst(solved[x][h-1], x, h-1);\n\t\t\tif (solved[x][h-2]==board[x][h-2]) {\n\t\t\t\tlocked[x][h-1] = locked[x][h-2]=true;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tlocked[x][h-2] = true;\n\t\t\tnaiveMoveToXFirst(solved[x][h-2], w-1, h-1);\n\t\t\thardCW4(x, h-2);\n\t\t\tnaiveMoveToXFirst(solved[x][h-2], x+1, h-2);\n\t\t\thardCCW4(x, h-2);\n\t\t\tlocked[x][h-1]=true;\n\t\t}\n\t\t\n\t\t//TODO: handle the last 4 spaces\n\t\twhile (board[w-2][h-2]!=solved[w-2][h-2]) {\n\t\t\thardCW4(w-2, h-2);\n\t\t}\n\t\tint target=solved[w-1][h-2];\n\t\tif (board[w-1][h-2]==target) {\n\t\t\t\n\t\t}\n\t\telse if (board[w-2][h-1]==target) {\n\t\t\tswapBottom2();\n\t\t\tswapRight2();\n\t\t}\n\t\telse {\n\t\t\tswapRight2();\n\t\t}\n\t\ttarget=solved[w-2][h-1];\n\t\tif (board[w-2][h-1]==target) {\n\t\t\t\n\t\t}\n\t\telse {\n\t\t\tswapBottom2();\n\t\t}\n\t\tSystem.out.println(answer.size());\n\t\tfor (String s:answer) {\n\t\t\tSystem.out.println(s);\n\t\t}\n//\t\tprint(board);\n\t}\n\t\n\tstatic void sixCycle() {\n\t\thardCCW4(w-2, h-2);\n\t\thardCCW4(w-3, h-2);\n\t\tmoveNoWarnings(w-3, h-2, w-2, h-2, w-1, h-2,\n\t\t\t\tw-1, h-1, w-2, h-1, w-3, h-1);\n\t}\n\t\n\tstatic void swapRight2() {\n\t\thardCCW4(w-2, h-2);\n\t\tsixCycle();\n\t\thardCW4(w-2, h-2);\n\t}\n\t\n\tstatic void swapLeft2() {\n\t\thardCW4(w-2, h-2);\n\t\tsixCycle();\n\t\thardCCW4(w-2, h-2);\n\t}\n\t\n\tstatic void swaptTop2() {\n\t\tsixCycle();\n\t}\n\t\n\tstatic void swapBottom2() {\n\t\thardCW4(w-2, h-2);\n\t\thardCW4(w-2, h-2);\n\t\tsixCycle();\n\t\thardCCW4(w-2, h-2);\n\t\thardCCW4(w-2, h-2);\n\t}\n\t\n\tstatic boolean movable(int x, int y) {\n\t\tif (x< 0 || x>=locked.length || y<0 || y>=locked[x].length) return false;\n\t\treturn !locked[x][y];\n\t}\n\t\n\t//moves x first then y\n\tstatic void naiveMoveToXFirst(int toMove, int targetX, int targetY) {\n\t\tPoint curPos=locationOf(toMove);\n\t\tint curX=curPos.x;\n\t\tint curY=curPos.y;\n\t\twhile (curX<targetX) {\n\t\t\tmoveRight(curX, curY);\n\t\t\tcurX++;\n\t\t}\n\t\twhile (curX>targetX) {\n\t\t\tmoveLeft(curX, curY);\n\t\t\tcurX--;\n\t\t}\n\t\twhile (curY<targetY) {\n\t\t\tmoveDown(curX, curY);;\n\t\t\tcurY++;\n\t\t}\n\t\twhile (curY>targetY) {\n\t\t\tmoveUp(curX, curY);\n\t\t\tcurY--;\n\t\t}\n\t}\n\t\n\tstatic void moveLeft(int x, int y) {\n\t\tif (!movable(x, y) || !movable(x-1, y)) {\n\t\t\tthrow null;\n\t\t}\n\t\tif (movable(x-1, y+1) && movable(x, y+1)) {\n\t\t\tmove(x, y, x-1, y, x-1, y+1, x, y+1);\n\t\t\treturn;\n\t\t}\n\t\tif (movable(x-1, y-1) && movable(x-1, y-1)) {\n\t\t\tmove(x, y, x-1, y, x-1, y-1, x, y-1);\n\t\t\treturn;\n\t\t}\n\t\tthrow null;\n\t}\n\t\n\tstatic void moveRight(int x, int y) {\n\t\tif (!movable(x, y) || !movable(x+1, y)) {\n\t\t\tthrow null;\n\t\t}\n\t\tif (movable(x+1, y+1) && movable(x, y+1)) {\n\t\t\tmove(x, y, x+1, y, x+1, y+1, x, y+1);\n\t\t\treturn;\n\t\t}\n\t\tif (movable(x+1, y-1) && movable(x, y-1)) {\n\t\t\tmove(x, y, x+1, y, x+1, y-1, x, y-1);\n\t\t\treturn;\n\t\t}\n//\t\tSystem.out.println(\"Trying to move right on pos: \"+x+\" \"+y+\" but it is impossible\");\n//\t\tprint(locked);\n\t\tthrow null;\n\t}\n\t\n\tstatic void moveDown(int x, int y) {\n\t\tif (!movable(x, y) || !movable(x, y+1)) {\n\t\t\tthrow null;\n\t\t}\n\t\tif (movable(x-1, y+1) && movable(x-1, y)) {\n\t\t\tmove(x, y, x, y+1, x-1, y+1, x-1, y);\n\t\t\treturn;\n\t\t}\n\t\tif (movable(x+1, y+1) && movable(x+1, y)) {\n\t\t\tmove(x, y, x, y+1, x+1, y+1, x+1, y);\n\t\t\treturn;\n\t\t}\n\t\tthrow null;\n\t}\n\n\tstatic void moveUp(int x, int y) {\n\t\tif (!movable(x, y) || !movable(x, y-1)) {\n\t\t\tthrow null;\n\t\t}\n\t\tif (movable(x-1, y-1) && movable(x-1, y)) {\n\t\t\tmove(x, y, x, y-1, x-1, y-1, x-1, y);\n\t\t\treturn;\n\t\t}\n\t\tif (movable(x+1, y-1) && movable(x+1, y)) {\n\t\t\tmove(x, y, x, y-1, x+1, y-1, x+1, y);\n\t\t\treturn;\n\t\t}\n\t\tthrow null;\n\t}\n\t\n\tstatic void move(int ...input) {\n\t\tif (input.length%2!=0) throw null;\n\t\tint[] xs=new int[input.length/2], ys=new int[input.length/2];\n\t\tfor (int i=0; i<input.length; i+=2) {\n\t\t\txs[i/2]=input[i];\n\t\t\tys[i/2]=input[i+1];\n\t\t}\n\t\tint nPoints=input.length/2;\n\t\tfor (int i=0; i<nPoints; i++) {\n\t\t\tif (!movable(xs[i], ys[i])) throw null;\n\t\t}\n\t\tint[] old=new int[nPoints];\n\t\tfor (int i=0; i<nPoints; i++) old[i]=board[xs[i]][ys[i]];\n\t\tfor (int i=0; i<nPoints; i++) board[xs[i]][ys[i]] = old[(i-1+nPoints)%nPoints];\n\t\tStringBuilder sb=new StringBuilder(nPoints+\" \");\n\t\tfor (int i:old) {\n\t\t\tsb.append(i+\" \");\n\t\t}\n\t\tanswer.add(sb.toString());\n\t}\n\t\n\tstatic void moveNoWarnings(int ...input) {\n\t\tif (input.length%2!=0) throw null;\n\t\tint[] xs=new int[input.length/2], ys=new int[input.length/2];\n\t\tfor (int i=0; i<input.length; i+=2) {\n\t\t\txs[i/2]=input[i];\n\t\t\tys[i/2]=input[i+1];\n\t\t}\n\t\tint nPoints=input.length/2;\n\t\tint[] old=new int[nPoints];\n\t\tfor (int i=0; i<nPoints; i++) old[i]=board[xs[i]][ys[i]];\n\t\tfor (int i=0; i<nPoints; i++) board[xs[i]][ys[i]] = old[(i-1+nPoints)%nPoints];\n\t\tStringBuilder sb=new StringBuilder(nPoints+\" \");\n\t\tfor (int i:old) {\n\t\t\tsb.append(i+\" \");\n\t\t}\n\t\tanswer.add(sb.toString());\n\t}\n\t\n\tstatic void hardCW4(int topLeftX, int topLeftY) {\n\t\tmoveNoWarnings(topLeftX, topLeftY, topLeftX+1, topLeftY, topLeftX+1, topLeftY+1, topLeftX, topLeftY+1);\n\t}\n\t\n\tstatic void hardCCW4(int topLeftX, int topLeftY) {\n\t\tmoveNoWarnings(topLeftX, topLeftY, topLeftX, topLeftY+1, topLeftX+1, topLeftY+1, topLeftX+1, topLeftY);\n\t}\n\t\n\tstatic Point locationOf(int i) {\n\t\tfor(int x=0; x<w; x++) {\n\t\t\tfor (int y=0; y<h; y++) {\n\t\t\t\tif (board[x][y]==i) return new Point(x, y);\n\t\t\t}\n\t\t}\n//\t\tSystem.out.println(\"Couldn't find location of \"+i+\" in \");\n//\t\tprint(board);\n\t\tthrow null;\n\t}\n\t\n\tstatic class FastScanner {\n\t\tBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st=new StringTokenizer(\"\");\n\t\tString next() {\n\t\t\twhile (!st.hasMoreElements()) {\n\t\t\t\ttry {\n\t\t\t\t\tst=new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\t\t\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t}\n\t\n\tstatic class Point {\n\t\tint x, y;\n\t\tpublic Point(int x, int y) {\n\t\t\tthis.x=x;\n\t\t\tthis.y=y;\n\t\t}\n\t}\n\t\n\tstatic void print(int[][] board) {\n\t\tfor (int y=0; y<board[0].length; y++) {\n\t\t\tfor (int x=0; x<board.length; x++) System.out.print(board[x][y]+\" \");\n\t\t\tSystem.out.println();\n\t\t}\n\t\tSystem.out.println();\n\t}\n\tstatic void print(boolean[][] board) {\n\t\tfor (int y=0; y<board[0].length; y++) {\n\t\t\tfor (int x=0; x<board.length; x++) System.out.print((board[x][y]?\"*\":\"_\")+\" \");\n\t\t\tSystem.out.println();\n\t\t}\n\t\tSystem.out.println();\n\t}\n}\n", "lang_cluster": "Java", "tags": ["brute force", "implementation"], "code_uid": "6e8468a37bdd00bc0c19db2d8c9f7bc7", "src_uid": "476afa2d8208ec933617c97637b65aff", "difficulty": 3100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.util.*;\nimport java.io.*;\n\npublic class p926J {\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader f = new BufferedReader(new InputStreamReader(System.in));\n\t\tPrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n\t\tStringTokenizer st;\n\t\tint times = Integer.parseInt(f.readLine());\n\t\tIntervalList list = new IntervalList();\n\t\twhile(times-- > 0)\n\t\t{\n\t\t\tst = new StringTokenizer(f.readLine());\n\t\t\tint s = Integer.parseInt(st.nextToken());\n\t\t\tint e = Integer.parseInt(st.nextToken());\n\t\t\tlist.add(s, e);\n\t\t\tout.println(list.size());\n\t\t}\n\t\tout.close();\n\t}\n\t\n\tstatic class IntervalList\n\t{\n\t\tpublic TreeSet<Interval> set;\n\t\tpublic IntervalList()\n\t\t{\n\t\t\tset = new TreeSet<Interval>();\n\t\t}\n\t\t\n\t\tpublic void add(int s, int e)\n\t\t{\n\t\t\tIterator<Interval> iter = set.tailSet(new Interval(s, s), true).iterator();\n\t\t\twhile(iter.hasNext())\n\t\t\t{\n\t\t\t\tInterval i = iter.next();\n\t\t\t\tif(i.s > e)\n\t\t\t\t\tbreak;\n\t\t\t\tif(i.s < s)\n\t\t\t\t\ts = i.s;\n\t\t\t\tif(i.e > e)\n\t\t\t\t\te = i.e;\n\t\t\t\titer.remove();\n\t\t\t}\n\t\t\tset.add(new Interval(s, e));\n\t\t}\n\t\t\n\t\tpublic int size()\n\t\t{\n\t\t\treturn set.size();\n\t\t}\n\t}\n\t\n\tstatic class Interval implements Comparable<Interval>\n\t{\n\t\tint s, e;\n\t\tpublic Interval(int s, int e)\n\t\t{\n\t\t\tthis.s = s;\n\t\t\tthis.e = e;\n\t\t}\n\t\t\n\t\tpublic int compareTo(Interval i)\n\t\t{\n\t\t\treturn e - i.e;\n\t\t}\n\t\t\n\t\tpublic String toString()\n\t\t{\n\t\t\treturn s + \" \" + e;\n\t\t}\n\t}\n}", "lang_cluster": "Java", "tags": ["data structures"], "code_uid": "b56ee5a22457652a49c9550823fd6252", "src_uid": "3979abbe7bad0f3b5cab15c1cba19f6b", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.*;\n\n/**\n * @author Don Li\n */\npublic class Pollywog {\n \n long INF = (long) 2e18;\n \n void solve() {\n int x = in.nextInt(), k = in.nextInt(), n = in.nextInt(), q = in.nextInt();\n int[] c = new int[k + 1];\n for (int i = 1; i <= k; i++) c[i] = in.nextInt();\n \n int[][] stones = new int[q + 1][2];\n for (int i = 0; i < q; i++) {\n int p = in.nextInt() - 1, w = in.nextInt();\n stones[i][0] = p;\n stones[i][1] = w;\n }\n stones[q][0] = n; stones[q][1] = 0;\n Arrays.sort(stones, Comparator.comparingInt(a -> a[0]));\n \n int id = 0;\n int[] state_to_id = new int[1 << k];\n int[] id_to_state = new int[1 << k];\n for (int i = 0; i < 1 << k; i++) {\n if (Integer.bitCount(i) == x) {\n id_to_state[id] = i;\n state_to_id[i] = id;\n id++;\n }\n }\n \n long[][][] basepow = new long[60][id][id];\n fill(basepow, INF);\n for (int i = 0; i < id; i++) {\n int state = id_to_state[i];\n if ((state & 1 << (k - 1)) == 0) {\n basepow[0][i][state_to_id[state << 1]] = 0;\n continue;\n }\n for (int j = 1; j <= k; j++) {\n int nstate = state ^ 1 << (k - 1);\n nstate <<= 1;\n if ((nstate & 1 << (k - j)) > 0) continue; // skip when this position is occupied\n basepow[0][i][state_to_id[nstate | 1 << (k - j)]] = c[j];\n }\n }\n for (int level = 1; level < basepow.length; level++) {\n basepow[level] = mult(basepow[level - 1], basepow[level - 1]);\n }\n \n long[][] cost = new long[id][id];\n fill(cost, INF);\n int start = (1 << k) - (1 << (k - x));\n cost[state_to_id[start]][state_to_id[start]] = 0;\n \n int cpos = 0, sidx = 0;\n while (cpos < n - x) {\n while (cpos > stones[sidx][0]) sidx++;\n \n if (cpos + k >= stones[sidx][0]) {\n long[][] base = new long[id][id];\n fill(base, INF);\n for (int i = 0; i < id; i++) {\n int state = id_to_state[i];\n if ((state & 1 << (k - 1)) == 0) {\n base[i][state_to_id[state << 1]] = 0;\n continue;\n }\n for (int j = 1; j <= k; j++) {\n int nstate = state ^ 1 << (k - 1);\n nstate <<= 1;\n if ((nstate & 1 << (k - j)) > 0) continue;\n int tcost = c[j];\n for (int a = 0; a < 2*k; a++) {\n if (sidx + a < stones.length && cpos + j == stones[sidx + a][0]) {\n tcost += stones[sidx + a][1];\n }\n }\n base[i][state_to_id[nstate | 1 << (k - j)]] = tcost;\n }\n }\n cost = mult(cost, base);\n cpos++;\n } else {\n long dist = (stones[sidx][0] - k) - cpos;\n for (int i = 0; i < 60; i++) {\n if ((dist & (1L << i)) > 0) {\n cost = mult(cost, basepow[i]);\n }\n }\n cpos += dist;\n }\n }\n \n out.println(cost[state_to_id[start]][state_to_id[start]]);\n }\n \n long[][] mult(long[][] a, long[][] b) {\n int n = a.length;\n long[][] c = new long[n][n];\n fill(c, INF);\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n for (int k = 0; k < n; k++) {\n c[i][j] = Math.min(c[i][j], a[i][k] + b[k][j]);\n }\n }\n }\n return c;\n }\n \n void fill(long[][][] a, long val) {\n for (long[][] x : a) fill(x, val);\n }\n \n void fill(long[][] a, long val) {\n for (long[] x : a) Arrays.fill(x, val);\n }\n \n public static void main(String[] args) {\n in = new FastScanner(new BufferedReader(new InputStreamReader(System.in)));\n out = new PrintWriter(System.out);\n new Pollywog().solve();\n out.close();\n }\n \n static FastScanner in;\n static PrintWriter out;\n \n static class FastScanner {\n BufferedReader in;\n StringTokenizer st;\n \n public FastScanner(BufferedReader in) {\n this.in = in;\n }\n \n public String nextToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(in.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n \n public int nextInt() {\n return Integer.parseInt(nextToken());\n }\n \n public long nextLong() {\n return Long.parseLong(nextToken());\n }\n \n public double nextDouble() {\n return Double.parseDouble(nextToken());\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["matrices", "dp", "combinatorics"], "code_uid": "712155675f9ce73b18120843c30e4b2f", "src_uid": "e3dd409ceeba2a21890d35ceab9607eb", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "Java 8", "source_code": "\nimport java.io.BufferedReader;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\n/*\n * To change this license header, choose License Headers in Project Properties.\n * To change this template file, choose Tools | Templates\n * and open the template in the editor.\n */\n\n/**\n *\n * @author Andy Phan\n */\npublic class p1173e {\n static int MOD = 998244353;\n static int n;\n static int m;\n static long[] invert;\n static long[][] f;\n static long[][] g;\n static boolean[][] df;\n static boolean[][] dg;\n static int[] sum;\n public static void main(String[] args) {\n FS in = new FS(System.in);\n PrintWriter out = new PrintWriter(System.out);\n n = in.nextInt();\n m = in.nextInt();\n invert = new long[2*m];\n int[] like = new int[n];\n sum = new int[2];\n int[] weight = new int[n];\n for(int i = 0; i < n; i++) like[i] = in.nextInt();\n for(int i = 0; i < n; i++) {\n weight[i] = in.nextInt();\n sum[1-like[i]] += weight[i];\n }\n for(int i = -(m-1); i < m; i++) invert[i+m-1] = modInv(sum[0]+sum[1]+i, MOD);\n f = new long[m][m];\n g = new long[m][m];\n df = new boolean[m][m];\n dg = new boolean[m][m];\n for(int i = 0; i < n; i++) if(like[i] == 0) out.println((g(0, 0)*weight[i])%MOD); else out.println((f(0, 0)*weight[i])%MOD);\n out.close();\n }\n \n static long f(int i, int j) {\n if(i+j == m) return 1;\n if(df[i][j]) return f[i][j];\n df[i][j] = true;\n return f[i][j] = (((((sum[0]+i+1)*invert[i-j+m-1])%MOD)*f(i+1, j))%MOD+((((sum[1]-j)*invert[i-j+m-1])%MOD)*f(i, j+1))%MOD)%MOD;\n }\n \n \n static long g(int i, int j) {\n if(i+j == m) return 1;\n if(dg[i][j]) return g[i][j];\n dg[i][j] = true;\n return g[i][j] = (((((sum[0]+i)*invert[i-j+m-1])%MOD)*g(i+1, j))%MOD+((((sum[1]-j-1)*invert[i-j+m-1])%MOD)*g(i, j+1))%MOD)%MOD;\n }\n \n //@\n static long gcd(long a, long b) { return b == 0 ? a : gcd(b, a % b); }\n static long lcm(long a, long b) { return a / gcd(a, b) * b; }\n\n \n //@\n // Computes the modular inverse of x\n // Returns 0 if the GCD of x and mod is not 1\n // O(log n) : Can be converted to use BigIntegers\n static long modInv(long x, long mod) {\n if(x == 1) return 1;\n if(gcd(x, mod) != 1) return 0;\n long r = mod % x;\n return (modInv(r, x % r, 0, 1, mod / x, x / r)+mod)%mod;\n }\n\n static long modInv(long a, long b, long y0, long y1, long q0, long q1) {\n long y2 = y0 - y1*q0;\n return b == 0 ? y2 : modInv(b, a % b, y1, y2, q1, a / b);\n }\n static class FS {\n BufferedReader in;\n StringTokenizer t;\n \n public FS(InputStream i) {\n in = new BufferedReader(new InputStreamReader(i));\n }\n \n public String next() {\n try {\n while(t == null || !t.hasMoreElements()) {\n t = new StringTokenizer(in.readLine());\n }\n } catch(Exception e) {}\n return t.nextToken();\n }\n \n public int nextInt() {\n return Integer.parseInt(next());\n }\n }\n}\n", "lang_cluster": "Java", "tags": ["dp", "probabilities"], "code_uid": "55d89ca528bb3640b9827764aed07c45", "src_uid": "ba9c136f84375cd317f0f8b53e3939c7", "difficulty": 2600.0, "exec_outcome": "PASSED"}