Datasets:

sine

/

FusedCodeContests

like 0

[ { "input": { "stdin": "1\n2 10 3\n2\n4\n10\n\nSAMPLE" }, "output": { "stdout": "4" } } ]

{ "tags": [], "title": "uncles-will-1" }

{ "cpp": null, "java": null, "python": "# /he/uncle's-will\n\nno_of_tc = input()\nfor tc in range(no_of_tc) :\n\tline = raw_input()\n\tmax_sheets = int(line.split(' ')[0])\n\ttotal_stalls = int(line.split(' ')[1])\n\tfilled_stalls = int(line.split(' ')[2])\n\tstall_map = [False] * total_stalls\n\tfor i in range(filled_stalls) :\tstall_map[input() - 1] = True\n\twhile stall_map and stall_map[0] == False : stall_map.remove(False)\n\twhile stall_map and stall_map[len(stall_map) - 1] == False : stall_map.pop()\n\tif len(stall_map) == 0 :\n\t\tprint 0\n\t\tcontinue\n\n\tstall_gaps = []\n\tstall_gap_cache = 0\n\tcovered_stalls = 1\n\tsheets_used = 1\n\tfor i in range(1, len(stall_map), 1) :\n\t\tif stall_map[i] == True and stall_map[i - 1] == True :\n\t\t\tcovered_stalls += 1\n\t\telif stall_map[i] == False and stall_map[i - 1] == False :\n\t\t\tstall_gap_cache += 1\n\t\telif stall_map[i] == True and stall_map[i - 1] == False :\n\t\t\tcovered_stalls += 1\n\t\t\tsheets_used += 1\n\t\t\tstall_gaps += [stall_gap_cache]\n\t\t\tstall_gap_cache = 0\n\t\telif stall_map[i] == False and stall_map[i - 1] == True :\n\t\t\tstall_gap_cache += 1\n\n\tif sheets_used > max_sheets :\n\t\tstall_gaps.sort(reverse = True)\n\t\tfor i in range(-1, max_sheets - sheets_used - 1, -1) :\n\t\t\tcovered_stalls += stall_gaps[i]\n\tprint covered_stalls" }

[ { "input": { "stdin": "2 5 5\n1 1 3\n2 4 20\n1 2 1\n1 3 4\n1 4 2" }, "output": { "stdout": "29" } }, { "input": { "stdin": "2 2 3\n1 1 3\n2 1 4\n1 2 5" }, "output": { "stdout": "8" } }, { "input": { "stdin": "4 5 10\n2 5 12\n1 5 12\n2 3 15\n1 2 20\n1 1 28\n2 4 26\n3 2 27\n4 5 21\n3 5 10\n1 3 10" }, "output": { "stdout": "142" } }, { "input": { "stdin": "2 2 3\n1 0 3\n2 1 4\n1 2 5" }, "output": { "stdout": "5\n" } }, { "input": { "stdin": "4 5 10\n2 5 12\n1 5 7\n2 3 15\n1 2 20\n1 1 28\n2 4 26\n0 2 27\n4 5 41\n3 5 10\n1 3 10" }, "output": { "stdout": "162\n" } }, { "input": { "stdin": "2 2 3\n1 0 3\n2 1 8\n1 2 5" }, "output": { "stdout": "8\n" } }, { "input": { "stdin": "4 5 10\n2 5 12\n1 5 7\n3 3 15\n1 2 12\n1 1 28\n2 4 26\n4 3 27\n4 5 21\n3 5 10\n1 3 2" }, "output": { "stdout": "111\n" } }, { "input": { "stdin": "4 7 10\n2 5 12\n1 5 7\n3 3 15\n1 2 17\n1 1 4\n2 4 48\n4 3 27\n4 5 21\n3 5 10\n1 3 2" }, "output": { "stdout": "114\n" } }, { "input": { "stdin": "4 5 5\n2 5 10\n1 5 12\n2 3 15\n1 2 20\n1 1 28\n2 4 26\n3 2 27\n4 5 25\n7 5 10\n1 3 10" }, "output": { "stdout": "73\n" } }, { "input": { "stdin": "2 5 5\n1 0 3\n2 1 11\n2 2 1\n1 3 4\n1 4 2" }, "output": { "stdout": "12\n" } }, { "input": { "stdin": "4 5 5\n2 5 10\n1 5 12\n2 3 15\n0 2 20\n2 1 38\n2 4 26\n3 2 27\n4 5 25\n7 5 10\n1 3 10" }, "output": { "stdout": "63\n" } }, { "input": { "stdin": "3 2 3\n1 0 5\n2 2 4\n1 2 5" }, "output": { "stdout": "9\n" } }, { "input": { "stdin": "4 5 3\n2 5 10\n1 5 12\n2 3 15\n1 2 20\n1 1 28\n2 4 26\n3 2 27\n4 5 25\n4 5 10\n1 3 10" }, "output": { "stdout": "25\n" } }, { "input": { "stdin": "4 5 5\n2 5 10\n1 5 12\n2 3 15\n1 2 20\n1 1 0\n2 4 26\n3 1 27\n2 5 1\n7 5 10\n2 3 0" }, "output": { "stdout": "45\n" } }, { "input": { "stdin": "4 5 5\n2 5 20\n1 5 12\n4 3 21\n1 2 11\n1 1 0\n3 4 17\n3 2 27\n4 5 21\n4 5 10\n1 3 10" }, "output": { "stdout": "43\n" } }, { "input": { "stdin": "4 5 10\n2 5 12\n1 5 7\n2 3 15\n1 2 20\n1 1 28\n2 4 26\n4 2 27\n4 5 21\n3 5 10\n1 3 2" }, "output": { "stdout": "134\n" } }, { "input": { "stdin": "4 5 3\n2 5 12\n1 0 12\n2 3 15\n1 2 20\n1 1 28\n2 4 26\n3 2 27\n4 5 21\n3 5 10\n1 3 10" }, "output": { "stdout": "27\n" } }, { "input": { "stdin": "4 5 7\n2 5 10\n1 5 12\n2 3 15\n1 2 20\n1 1 28\n2 4 26\n3 2 27\n4 5 25\n7 5 10\n1 3 4" }, "output": { "stdout": "99\n" } }, { "input": { "stdin": "4 5 5\n2 5 15\n1 5 12\n2 3 15\n1 4 20\n1 1 28\n1 4 26\n0 2 27\n4 5 29\n7 6 10\n1 0 4" }, "output": { "stdout": "75\n" } }, { "input": { "stdin": "5 5 3\n2 5 2\n1 5 14\n4 3 15\n0 2 11\n1 1 28\n3 5 17\n3 2 27\n4 5 21\n4 5 10\n1 3 10" }, "output": { "stdout": "16\n" } }, { "input": { "stdin": "4 5 3\n2 5 10\n1 5 12\n2 3 15\n1 2 20\n1 1 18\n2 5 51\n3 2 27\n4 5 21\n3 5 10\n1 3 10" }, "output": { "stdout": "25\n" } }, { "input": { "stdin": "3 5 4\n2 5 10\n1 2 11\n1 3 3\n2 2 20\n1 1 11\n-1 -1 26\n3 1 7\n4 5 8\n10 5 4\n0 0 10" }, "output": { "stdout": "41\n" } }, { "input": { "stdin": "4 5 5\n2 5 1\n1 5 18\n2 3 4\n1 2 20\n0 1 28\n2 7 15\n3 1 27\n7 1 25\n7 6 10\n1 0 4" }, "output": { "stdout": "39\n" } }, { "input": { "stdin": "4 5 3\n2 5 12\n1 0 12\n2 3 15\n1 2 20\n1 1 28\n2 4 26\n3 2 27\n4 10 21\n3 5 10\n1 3 10" }, "output": { "stdout": "27\n" } }, { "input": { "stdin": "4 5 1\n1 5 14\n1 0 12\n2 3 24\n1 3 20\n1 0 28\n2 4 26\n3 2 31\n8 10 21\n3 5 13\n1 3 10" }, "output": { "stdout": "14\n" } }, { "input": { "stdin": "5 5 3\n2 5 10\n1 5 28\n4 3 15\n0 2 11\n1 1 12\n3 5 17\n3 2 10\n4 5 21\n4 9 10\n1 3 10" }, "output": { "stdout": "38\n" } }, { "input": { "stdin": "4 5 3\n2 5 10\n1 5 12\n2 3 15\n1 2 20\n1 1 18\n2 4 26\n3 2 27\n4 5 21\n3 5 10\n1 3 10" }, "output": { "stdout": "25\n" } }, { "input": { "stdin": "4 5 3\n2 5 2\n1 5 12\n2 3 26\n1 2 20\n1 1 18\n2 5 51\n3 2 27\n4 5 21\n3 5 11\n1 3 10" }, "output": { "stdout": "28\n" } }, { "input": { "stdin": "4 5 10\n2 5 12\n1 5 7\n2 3 15\n1 2 20\n1 1 28\n2 4 26\n3 2 27\n4 5 21\n3 5 10\n1 3 11" }, "output": { "stdout": "143\n" } }, { "input": { "stdin": "4 9 2\n2 7 0\n2 1 7\n8 5 21\n1 2 6\n-1 2 18\n0 5 100\n3 2 2\n4 5 21\n3 5 5\n1 4 3" }, "output": { "stdout": "7\n" } }, { "input": { "stdin": "4 5 10\n2 5 12\n1 5 7\n3 3 15\n1 2 17\n1 1 4\n2 4 26\n4 3 27\n4 5 21\n3 5 10\n1 3 2" }, "output": { "stdout": "92\n" } }, { "input": { "stdin": "4 5 3\n2 5 10\n1 2 11\n1 3 15\n1 2 20\n1 0 28\n2 4 26\n3 2 27\n4 5 25\n7 5 10\n1 3 10" }, "output": { "stdout": "36\n" } }, { "input": { "stdin": "2 5 5\n1 1 3\n2 1 20\n2 2 1\n1 3 4\n1 4 2" }, "output": { "stdout": "24\n" } }, { "input": { "stdin": "4 5 3\n2 5 12\n1 5 12\n2 3 15\n1 2 20\n1 1 28\n2 4 26\n3 2 27\n4 5 21\n3 5 10\n1 3 10" }, "output": { "stdout": "27\n" } }, { "input": { "stdin": "2 2 3\n1 0 5\n2 1 4\n1 2 5" }, "output": { "stdout": "5\n" } }, { "input": { "stdin": "4 5 10\n2 5 22\n1 5 7\n2 3 8\n1 2 8\n1 1 28\n4 4 26\n1 2 27\n4 5 38\n3 3 10\n1 3 10" }, "output": { "stdout": "147\n" } }, { "input": { "stdin": "4 5 10\n2 5 12\n1 5 7\n2 3 8\n1 2 8\n1 1 28\n2 4 26\n0 2 27\n4 5 38\n3 3 10\n1 3 10" }, "output": { "stdout": "130\n" } }, { "input": { "stdin": "4 5 3\n2 5 10\n1 5 12\n2 3 15\n1 2 20\n1 0 28\n2 4 26\n3 2 27\n4 5 25\n7 5 10\n1 3 10" }, "output": { "stdout": "25\n" } }, { "input": { "stdin": "6 5 5\n2 5 3\n1 5 35\n2 3 7\n1 2 20\n1 1 28\n2 7 26\n5 0 27\n4 5 25\n7 6 10\n1 0 6" }, "output": { "stdout": "86\n" } }, { "input": { "stdin": "4 5 10\n2 5 22\n1 5 7\n2 3 8\n1 2 8\n1 1 28\n4 4 26\n0 2 27\n4 5 38\n3 3 10\n1 3 10" }, "output": { "stdout": "128\n" } }, { "input": { "stdin": "4 5 5\n2 5 10\n1 5 18\n3 3 7\n1 2 20\n1 1 6\n3 7 26\n3 0 27\n4 9 25\n7 6 10\n1 0 4" }, "output": { "stdout": "54\n" } }, { "input": { "stdin": "4 5 5\n2 5 10\n1 5 12\n2 3 15\n1 2 20\n2 1 28\n2 4 26\n3 2 50\n4 5 25\n7 5 10\n1 3 10" }, "output": { "stdout": "53\n" } }, { "input": { "stdin": "4 5 3\n1 5 11\n1 -1 12\n2 3 61\n2 3 20\n0 0 33\n3 3 10\n4 4 31\n14 6 21\n-1 2 17\n2 3 10" }, "output": { "stdout": "61\n" } }, { "input": { "stdin": "4 5 10\n2 5 12\n1 5 7\n2 3 8\n1 2 20\n1 1 28\n2 4 26\n0 2 27\n1 5 21\n3 3 10\n1 3 10" }, "output": { "stdout": "104\n" } }, { "input": { "stdin": "2 5 5\n1 0 3\n2 1 20\n2 2 1\n1 3 4\n1 4 2" }, "output": { "stdout": "21\n" } }, { "input": { "stdin": "4 5 6\n2 5 10\n1 5 10\n2 3 15\n1 2 8\n2 1 28\n2 4 46\n3 2 50\n0 5 25\n4 8 12\n1 3 10" }, "output": { "stdout": "89\n" } }, { "input": { "stdin": "4 5 6\n2 5 10\n1 5 12\n2 3 15\n1 2 20\n2 1 28\n2 4 26\n3 2 50\n0 5 25\n4 5 12\n1 3 10" }, "output": { "stdout": "71\n" } }, { "input": { "stdin": "5 9 3\n2 5 4\n1 5 16\n4 5 15\n0 2 16\n1 1 28\n3 5 17\n3 1 40\n0 8 21\n4 7 10\n1 3 1" }, "output": { "stdout": "35\n" } }, { "input": { "stdin": "5 5 5\n2 2 10\n1 5 30\n1 3 3\n1 2 20\n1 1 28\n0 7 5\n2 4 47\n0 5 25\n2 1 10\n1 0 3" }, "output": { "stdout": "78\n" } }, { "input": { "stdin": "4 5 5\n2 5 10\n1 5 12\n2 3 15\n1 2 20\n1 1 28\n2 4 26\n3 2 27\n4 5 25\n7 5 10\n1 0 4" }, "output": { "stdout": "73\n" } } ]

{ "tags": [], "title": "p02586 AtCoder Beginner Contest 175 - Picking Goods" }

{ "cpp": "#include<iostream>\nusing namespace std;\nlong long maps[3005][3005]={0};\nlong long dp[3005][3005][5]={0};\nint main(){\n int h,w;\n int k;\n \n \n cin>>h>>w;\n cin>>k;\n for(int i=0;i<k;i++){\n int r,c,v;\n cin>>r>>c>>v;\n maps[r][c]=v;\n }\n \n\n dp[1][1][1]=maps[1][1];\n for(int i=1;i<=h;i++){\n for(int j=1;j<=w;j++){\n for(int l=3;l>=0;l--){\n\tdp[i+1][j][0]=max(dp[i+1][j][0],dp[i][j][l]);\n\tdp[i+1][j][1]=max(dp[i+1][j][1],dp[i][j][l]+maps[i+1][j]);\n\tdp[i][j+1][l]=max(dp[i][j+1][l],dp[i][j][l]);\n\tif(l<3){\n\t dp[i][j+1][l+1]=max(dp[i][j+1][l+1],dp[i][j][l]+maps[i][j+1]);\n\t}\n }\n }\n }\n \n long long maxim=0;\n for(int i=0;i<=3;i++){\n maxim=max(maxim,dp[h][w][i]);\n }\n cout<<maxim<<endl;\n return(0);\n}", "java": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tvar sc = new Scanner(System.in);\n\t\tvar r = sc.nextInt();\n\t\tvar c = sc.nextInt();\n\t\tvar k = sc.nextInt();\n\t\tvar v = new long[r][c];\n\t\tfor (var i = 0; i < k; i++) {\n\t\t\tv[sc.nextInt() - 1][sc.nextInt() - 1] = sc.nextInt();\n\t\t}\n\t\tsc.close();\n\n\t\tfor (var i = 0; i < r; i++) {\n\t\t\tvar rv = new long[c][5];\n\t\t\tfor (var j = 0; j < c; j++) {\n\t\t\t\tvar cv = v[i][j];\n\t\t\t\tfor (var ic = 0; ic < 4; ic++) {\n\t\t\t\t\tvar rv1 = (i > 0 ? v[i - 1][j] : 0);\n\t\t\t\t\tvar rv2 = (j > 0 ? rv[j - 1][ic] : 0);\n\t\t\t\t\tvar rv3 = (j > 0 ? rv[j - 1][ic + 1] : 0);\n\t\t\t\t\tif (cv > 0) {\n\t\t\t\t\t\tif (ic == 0) {\n\t\t\t\t\t\t\trv[j][ic + 1] = Math.max(Math.max(rv1 + cv, rv2 + cv), rv3);\n\t\t\t\t\t\t} else if (rv2 > 0) {\n\t\t\t\t\t\t\trv[j][ic + 1] = Math.max(rv2 + cv, rv3);\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tif (ic == 0) {\n\t\t\t\t\t\t\trv[j][ic] = Math.max(rv1, rv2);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\trv[j][ic] = rv2;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tv[i][j] = Math.max(Math.max(Math.max(rv[j][0], rv[j][1]), rv[j][2]), rv[j][3]);\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(v[r - 1][c - 1]);\n\t}\n}\n", "python": "R,C,K = map(int,input().split())\n\ngrid=[[0]*C for _ in range(R)]\nfor i in range(K):\n x,y,v = map(int,input().split())\n grid[x-1][y-1] = v\n\n\ndp0 = [[0]*(C+1) for _ in range(R+1)]\ndp1 = [[0]*(C+1) for _ in range(R+1)]\ndp2 = [[0]*(C+1) for _ in range(R+1)]\ndp3 = [[0]*(C+1) for _ in range(R+1)]\n\nfor i in range(R):\n for j in range(C):\n dp1[i][j] = max(dp1[i][j-1],dp1[i-1][j]+grid[i][j],\n dp2[i-1][j]+grid[i][j],dp3[i-1][j]+grid[i][j])\n dp2[i][j] = max(dp2[i][j-1],dp1[i][j-1]+grid[i][j])\n dp3[i][j] = max(dp3[i][j-1],dp2[i][j-1]+grid[i][j])\nans=max(dp1[R-1][C-1],dp2[R-1][C-1],dp3[R-1][C-1])\nprint(ans)" }

[ { "input": { "stdin": "100 100 100" }, "output": { "stdout": "100 100 100" } }, { "input": { "stdin": "41 59 31" }, "output": { "stdout": "31 41 59" } }, { "input": { "stdin": "1 2 3" }, "output": { "stdout": "3 1 2" } }, { "input": { "stdin": "011 001 100" }, "output": { "stdout": "100 11 1\n" } }, { "input": { "stdin": "59 10 8" }, "output": { "stdout": "8 59 10\n" } }, { "input": { "stdin": "3 1 9" }, "output": { "stdout": "9 3 1\n" } }, { "input": { "stdin": "011 010 110" }, "output": { "stdout": "110 11 10\n" } }, { "input": { "stdin": "010 100 100" }, "output": { "stdout": "100 10 100\n" } }, { "input": { "stdin": "2 2 3" }, "output": { "stdout": "3 2 2\n" } }, { "input": { "stdin": "225 0 3" }, "output": { "stdout": "3 225 0\n" } }, { "input": { "stdin": "135 4 13" }, "output": { "stdout": "13 135 4\n" } }, { "input": { "stdin": "011 110 100" }, "output": { "stdout": "100 11 110\n" } }, { "input": { "stdin": "6 2 51" }, "output": { "stdout": "51 6 2\n" } }, { "input": { "stdin": "001 110 100" }, "output": { "stdout": "100 1 110\n" } }, { "input": { "stdin": "011 110 110" }, "output": { "stdout": "110 11 110\n" } }, { "input": { "stdin": "110 110 110" }, "output": { "stdout": "110 110 110\n" } }, { "input": { "stdin": "11 8 53" }, "output": { "stdout": "53 11 8\n" } }, { "input": { "stdin": "010 010 110" }, "output": { "stdout": "110 10 10\n" } }, { "input": { "stdin": "250 1 3" }, "output": { "stdout": "3 250 1\n" } }, { "input": { "stdin": "011 101 100" }, "output": { "stdout": "100 11 101\n" } }, { "input": { "stdin": "011 110 011" }, "output": { "stdout": "11 11 110\n" } }, { "input": { "stdin": "6 3 29" }, "output": { "stdout": "29 6 3\n" } }, { "input": { "stdin": "135 2 13" }, "output": { "stdout": "13 135 2\n" } }, { "input": { "stdin": "2 2 7" }, "output": { "stdout": "7 2 2\n" } }, { "input": { "stdin": "001 110 011" }, "output": { "stdout": "11 1 110\n" } }, { "input": { "stdin": "59 5 11" }, "output": { "stdout": "11 59 5\n" } }, { "input": { "stdin": "3 2 12" }, "output": { "stdout": "12 3 2\n" } }, { "input": { "stdin": "010 110 011" }, "output": { "stdout": "11 10 110\n" } }, { "input": { "stdin": "001 110 110" }, "output": { "stdout": "110 1 110\n" } }, { "input": { "stdin": "001 110 010" }, "output": { "stdout": "10 1 110\n" } }, { "input": { "stdin": "000 110 101" }, "output": { "stdout": "101 0 110\n" } }, { "input": { "stdin": "4 1 9" }, "output": { "stdout": "9 4 1\n" } }, { "input": { "stdin": "4 0 23" }, "output": { "stdout": "23 4 0\n" } }, { "input": { "stdin": "000 100 100" }, "output": { "stdout": "100 0 100\n" } }, { "input": { "stdin": "11 8 82" }, "output": { "stdout": "82 11 8\n" } }, { "input": { "stdin": "250 0 3" }, "output": { "stdout": "3 250 0\n" } }, { "input": { "stdin": "011 100 011" }, "output": { "stdout": "11 11 100\n" } }, { "input": { "stdin": "4 2 12" }, "output": { "stdout": "12 4 2\n" } }, { "input": { "stdin": "110 110 111" }, "output": { "stdout": "111 110 110\n" } }, { "input": { "stdin": "236 4 2" }, "output": { "stdout": "2 236 4\n" } }, { "input": { "stdin": "135 5 13" }, "output": { "stdout": "13 135 5\n" } }, { "input": { "stdin": "225 1 2" }, "output": { "stdout": "2 225 1\n" } }, { "input": { "stdin": "6 3 24" }, "output": { "stdout": "24 6 3\n" } }, { "input": { "stdin": "12 4 45" }, "output": { "stdout": "45 12 4\n" } }, { "input": { "stdin": "225 0 2" }, "output": { "stdout": "2 225 0\n" } }, { "input": { "stdin": "6 2 140" }, "output": { "stdout": "140 6 2\n" } }, { "input": { "stdin": "110 110 011" }, "output": { "stdout": "11 110 110\n" } }, { "input": { "stdin": "6 2 29" }, "output": { "stdout": "29 6 2\n" } }, { "input": { "stdin": "86 5 12" }, "output": { "stdout": "12 86 5\n" } }, { "input": { "stdin": "59 5 7" }, "output": { "stdout": "7 59 5\n" } } ]

{ "tags": [], "title": "p02717 AtCoder Beginner Contest 161 - ABC Swap" }

{ "cpp": "#include <cstdio>\n\n\n\nint main(){\n int A,B,C;\n scanf(\"%d%d%d\",&A,&B,&C);\n\n printf(\"%d %d %d\\n\",C,A,B);\n\n return 0;\n}", "java": " import java.util.*;\n public class Main {\n \tpublic static void main(String[] args){\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\tSystem.out.print(c+\" \"+a+\" \"+b);\n\n \t}\n }", "python": "A,B,C=list(map(int,input().split()))\nprint(C,A,B)" }

[ { "input": { "stdin": "1 2\n10 10\n12 4" }, "output": { "stdout": "1" } }, { "input": { "stdin": "100 1\n101 101\n102 1" }, "output": { "stdout": "infinity" } }, { "input": { "stdin": "12000 15700\n3390000000 3810000000\n5550000000 2130000000" }, "output": { "stdout": "113" } }, { "input": { "stdin": "1 1\n0 17\n12 5" }, "output": { "stdout": "infinity\n" } }, { "input": { "stdin": "111 3\n001 010\n98 0" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "111 3\n001 010\n43 1" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "0 1\n0 1\n2 5" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "34 3\n403621 360813107\n8528049 217440950" }, "output": { "stdout": "3\n" } }, { "input": { "stdin": "20074 15700\n6326151407 3810000000\n5550000000 4464634034" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "15726 13168\n4972022622 12527402928\n367871318 5282210335" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "1 0\n-2 2\n1 3" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "12000 15700\n6326151407 3810000000\n5550000000 2683996071" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "110 2\n001 010\n59 0" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "0 0\n0 2\n1 7" }, "output": { "stdout": "infinity\n" } }, { "input": { "stdin": "0 2\n-1 2\n2 5" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "111 0\n001 010\n43 1" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "15726 9578\n1420263189 6160806043\n404901817 3680927238" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "30901 15700\n6326151407 7553552556\n5550000000 4464634034" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "011 3\n000 010\n43 0" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "100 2\n100 111\n59 0" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "1 1\n-1 4\n12 5" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "15726 13168\n2647944172 14054634373\n777243341 4464634034" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "15726 13168\n4972022622 14054634373\n777243341 5282210335" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "111 3\n000 010\n98 0" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "110 0\n010 111\n43 1" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "111 0\n010 101\n43 1" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "15726 13168\n3407228206 14054634373\n777243341 4464634034" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "0 0\n0 1\n2 5" }, "output": { "stdout": "infinity\n" } }, { "input": { "stdin": "30901 15700\n8541952587 11366428589\n5864465524 4464634034" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "2 88\n9564 14387065\n38326901 13232778" }, "output": { "stdout": "7\n" } }, { "input": { "stdin": "30901 15700\n6326151407 7553552556\n5864465524 4464634034" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "15726 13168\n4972022622 14054634373\n777243341 4464634034" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "100 2\n100 101\n102 1" }, "output": { "stdout": "infinity\n" } }, { "input": { "stdin": "1 -2\n-2 1\n1 3" }, "output": { "stdout": "6\n" } }, { "input": { "stdin": "15726 9578\n1420263189 1387249338\n122205193 3680927238" }, "output": { "stdout": "27\n" } }, { "input": { "stdin": "12000 15700\n6326151407 3810000000\n5550000000 3493581439" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "15726 13168\n2647944172 9574370435\n777243341 4464634034" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "1 2\n-1 2\n12 5" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "38696 15700\n2647944172 11366428589\n777243341 4464634034" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "20074 15700\n6326151407 3810000000\n5550000000 3493581439" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "30901 15700\n8541952587 7553552556\n5864465524 4464634034" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "110 0\n010 101\n43 1" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "111 0\n010 001\n43 1" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "110 2\n000 110\n59 0" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "0 1\n-1 1\n2 5" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "1 1\n0 20\n12 5" }, "output": { "stdout": "8\n" } }, { "input": { "stdin": "12000 15700\n3390000000 3810000000\n5550000000 2683996071" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "0 0\n-1 2\n1 3" }, "output": { "stdout": "infinity\n" } }, { "input": { "stdin": "1 1\n1 20\n12 5" }, "output": { "stdout": "5\n" } }, { "input": { "stdin": "011 3\n000 010\n43 1" }, "output": { "stdout": "0\n" } } ]

{ "tags": [], "title": "p02846 Sumitomo Mitsui Trust Bank Programming Contest 2019 - Interval Running" }

{ "cpp": "#include <iostream>\n\nusing namespace std;\n\ntypedef long long ll;\n\n\nint main() {\n ll t1,t2;\n ll a1,a2,b1,b2;\n cin >> t1 >> t2;\n cin >> a1 >> a2;\n cin >> b1 >> b2;\n\n if(t1*a1 < t1*b1) {\n swap(a1,b1);\n swap(a2,b2);\n }\n \n\n ll tmp1 = t1*a1-t1*b1;\n\t\t\t \n ll tmp2 = t1*a1+t2*a2-(t1*b1+t2*b2);\n if(tmp2 == 0) {\n cout << \"infinity\" << endl;\n return 0;\n }\n else if (tmp2 > 0) {\n cout << 0 << endl;\n return 0;\n }\n\n if((tmp1 % (-tmp2)) == 0) {\n cout << (tmp1 / -tmp2) * 2 << endl;\n }\n else {\n cout << (tmp1 / -tmp2) * 2 + 1 << endl;\n }\n}\n", "java": "import java.util.*;\nimport java.io.*;\nimport java.util.function.*;\n\nclass Main {\n static Scanner scanner = new Scanner();\n static int mod = 1000000007;\n static long inf = 0xfffffffffffffffL;\n\n void solve() {\n long t1 = scanner.nextLong();\n long t2 = scanner.nextLong();\n long a1 = scanner.nextLong() * t1;\n long a2 = scanner.nextLong() * t2;\n long b1 = scanner.nextLong() * t1;\n long b2 = scanner.nextLong() * t2;\n if (b1 > a1) {\n long temp = b1;\n b1 = a1;\n a1 = temp;\n temp = b2;\n b2 = a2;\n a2 = temp;\n }\n long a = b1 - a1;\n long b = b2 - a2;\n long d = a + b;\n if (d == 0) {\n System.out.println(\"infinity\");\n } else if (d <= 0) {\n System.out.println(0);\n } else {\n long ans = (-a + d - 1) / d * 2 - 1;\n if (a % d == 0) {\n ans++;\n }\n System.out.println(ans);\n }\n }\n\n public static void main(String[]$) {\n try {\n new Main().solve();\n System.out.flush();\n } catch (Throwable t) {\n System.out.flush();\n t.printStackTrace();\n }\n }\n}\n\nclass System {\n static PrintWriter out = new PrintWriter(java.lang.System.out);\n\n static void exit() {\n java.lang.System.exit(0);\n }\n}\n\nclass Scanner {\n private BufferedReader reader = new BufferedReader(new InputStreamReader(java.lang.System.in), 0x10000);\n private StringTokenizer tokenizer;\n\n String next() {\n try {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n tokenizer = new StringTokenizer(reader.readLine());\n }\n } catch (IOException ignored) {\n }\n return tokenizer.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n char[][] nextCharArray(int n, int m) {\n char[][] a = new char[n][m];\n for (int i = 0; i < n; i++) {\n a[i] = next().toCharArray();\n }\n return a;\n }\n\n 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 int[] nextIntArray(int n, IntUnaryOperator op) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = op.applyAsInt(nextInt());\n }\n return a;\n }\n\n long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++) {\n a[i] = nextLong();\n }\n return a;\n }\n\n long[] nextLongArray(int n, LongUnaryOperator op) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++) {\n a[i] = op.applyAsLong(nextLong());\n }\n return a;\n }\n}\n", "python": "t = list(map(int, input().split()))\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nx = t[0] * (a[0] - b[0])\ny = x + t[1] * (a[1] - b[1])\nif x*y > 0:\n\tprint(0)\nelif x*y == 0:\n\tprint('infinity')\nelif abs(x) % abs(y) == 0:\n\tprint(2 * (abs(x) // abs(y)))\nelse:\n\tprint(2 * (abs(x) // abs(y)) + 1)" }

[ { "input": { "stdin": "4 5" }, "output": { "stdout": "20" } }, { "input": { "stdin": "2020 2040" }, "output": { "stdout": "2" } }, { "input": { "stdin": "0 64" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "-1 1" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "-1 14" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "-7 67" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "2 97" }, "output": { "stdout": "2\n" } }, { "input": { "stdin": "5 12" }, "output": { "stdout": "30\n" } }, { "input": { "stdin": "6 8" }, "output": { "stdout": "42\n" } }, { "input": { "stdin": "-7 7" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "-1 35" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "1022 3053" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "-1 6" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "1 7" }, "output": { "stdout": "2\n" } }, { "input": { "stdin": "920 4340" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "-1 7" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "-1 25" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "-1 28" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "2 5" }, "output": { "stdout": "6\n" } }, { "input": { "stdin": "3 5" }, "output": { "stdout": "12\n" } }, { "input": { "stdin": "-1 8" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "0 13" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "468 3053" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "0 15" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "-2 15" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "-1 24" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "-1 2" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "0 2" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "-4 15" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "0 18" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "0 9" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "8 10" }, "output": { "stdout": "72\n" } }, { "input": { "stdin": "-1 10" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "0 97" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "-1 58" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "-1 113" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "9 10" }, "output": { "stdout": "90\n" } }, { "input": { "stdin": "0 113" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "1 97" }, "output": { "stdout": "2\n" } }, { "input": { "stdin": "-2 25" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "0 89" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "-3 15" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "-1 15" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "-2 8" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "1 64" }, "output": { "stdout": "2\n" } }, { "input": { "stdin": "0 39" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "0 43" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "-1 125" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "0 17" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "-1 64" }, "output": { "stdout": "0\n" } } ]

{ "tags": [], "title": "p02983 AtCoder Beginner Contest 133 - Remainder Minimization 2019" }

{ "cpp": "#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n int64_t l, r;\n cin >> l >> r;\n r = min(r, l+2019);\n int ans = 2018;\n for(int64_t i=l; i<r; i++){\n for(int64_t j=i+1; j<=r; j++){\n int x = (int64_t)i*j%2019;\n ans = min(ans, x);\n }\n }\n cout << ans << endl;\n}", "java": "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args){\n\t Scanner sc = new Scanner(System.in);\n\t long l = sc.nextLong();\n\t long r = sc.nextLong();\n \n \n if(r-l > 3000) {\n System.out.println(0);\n }else {\n \n long min = 2018;\n for(long i = l; i < r; i++) {\n for(long j = l+1; j <=r; j++) {\n long num = (i*j)%2019;\n if(num<min) {\n min = num;\n }\n }\n }\n System.out.println(min);\n\n \n }\n\n \n\t}\n}", "python": "L, R = map(int, input().split())\n\nans = 10**10\nfor i in range(L, min(L+2019, R+1)):\n for j in range(i+1, min(L+2019, R+1)):\n ans = min(ans, i*j%2019)\n\nprint(ans)" }

[ { "input": { "stdin": "4 12" }, "output": { "stdout": "16" } }, { "input": { "stdin": "8 20" }, "output": { "stdout": "12" } }, { "input": { "stdin": "1 1" }, "output": { "stdout": "2" } }, { "input": { "stdin": "1 16" }, "output": { "stdout": "17\n" } }, { "input": { "stdin": "42 14" }, "output": { "stdout": "-28\n" } }, { "input": { "stdin": "6 17" }, "output": { "stdout": "11\n" } }, { "input": { "stdin": "35 28" }, "output": { "stdout": "-7\n" } }, { "input": { "stdin": "1 12" }, "output": { "stdout": "13\n" } }, { "input": { "stdin": "3 22" }, "output": { "stdout": "19\n" } }, { "input": { "stdin": "2 182" }, "output": { "stdout": "184\n" } }, { "input": { "stdin": "16 1" }, "output": { "stdout": "-15\n" } }, { "input": { "stdin": "111 40" }, "output": { "stdout": "-71\n" } }, { "input": { "stdin": "3 56" }, "output": { "stdout": "53\n" } }, { "input": { "stdin": "1 2" }, "output": { "stdout": "3\n" } }, { "input": { "stdin": "5 52" }, "output": { "stdout": "47\n" } }, { "input": { "stdin": "5 63" }, "output": { "stdout": "58\n" } }, { "input": { "stdin": "25 -1" }, "output": { "stdout": "-26\n" } }, { "input": { "stdin": "1 0" }, "output": { "stdout": "1\n" } }, { "input": { "stdin": "8 28" }, "output": { "stdout": "20\n" } }, { "input": { "stdin": "29 2" }, "output": { "stdout": "-27\n" } }, { "input": { "stdin": "42 5" }, "output": { "stdout": "-37\n" } }, { "input": { "stdin": "111 90" }, "output": { "stdout": "-21\n" } }, { "input": { "stdin": "9 -1" }, "output": { "stdout": "-10\n" } }, { "input": { "stdin": "1 34" }, "output": { "stdout": "35\n" } }, { "input": { "stdin": "010 40" }, "output": { "stdout": "50\n" } }, { "input": { "stdin": "20 2" }, "output": { "stdout": "-18\n" } }, { "input": { "stdin": "4 24" }, "output": { "stdout": "28\n" } }, { "input": { "stdin": "14 70" }, "output": { "stdout": "84\n" } }, { "input": { "stdin": "4 6" }, "output": { "stdout": "2\n" } }, { "input": { "stdin": "19 110" }, "output": { "stdout": "91\n" } }, { "input": { "stdin": "11 5" }, "output": { "stdout": "-6\n" } }, { "input": { "stdin": "1 6" }, "output": { "stdout": "7\n" } }, { "input": { "stdin": "22 28" }, "output": { "stdout": "6\n" } }, { "input": { "stdin": "3 46" }, "output": { "stdout": "43\n" } }, { "input": { "stdin": "3 37" }, "output": { "stdout": "34\n" } }, { "input": { "stdin": "6 32" }, "output": { "stdout": "26\n" } }, { "input": { "stdin": "27 -2" }, "output": { "stdout": "-29\n" } }, { "input": { "stdin": "6 61" }, "output": { "stdout": "55\n" } }, { "input": { "stdin": "16 3" }, "output": { "stdout": "-13\n" } }, { "input": { "stdin": "2 43" }, "output": { "stdout": "41\n" } }, { "input": { "stdin": "25 0" }, "output": { "stdout": "25\n" } }, { "input": { "stdin": "6 55" }, "output": { "stdout": "49\n" } }, { "input": { "stdin": "8 46" }, "output": { "stdout": "38\n" } }, { "input": { "stdin": "42 4" }, "output": { "stdout": "-38\n" } }, { "input": { "stdin": "5 10" }, "output": { "stdout": "15\n" } }, { "input": { "stdin": "2 16" }, "output": { "stdout": "18\n" } }, { "input": { "stdin": "3 182" }, "output": { "stdout": "179\n" } }, { "input": { "stdin": "6 24" }, "output": { "stdout": "30\n" } }, { "input": { "stdin": "3 36" }, "output": { "stdout": "39\n" } }, { "input": { "stdin": "5 38" }, "output": { "stdout": "33\n" } } ]

{ "tags": [], "title": "p03125 AtCoder Beginner Contest 118 - B +/- A" }

{ "cpp": "#include<iostream>\nusing namespace std;\n\nint main(){\n int a,b; cin >> a >> b;\n cout << (b%a ? b-a : a+b);\n}", "java": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt(), b = sc.nextInt();\n\t\tif(b%a == 0) System.out.println(a+b);\n\t\telse System.out.println(b - a);\n\t}\n}", "python": "if __name__ == '__main__':\n a, b = map(int, raw_input().split())\n\n if b % a == 0:\n print a + b\n else:\n print b - a" }

[ { "input": { "stdin": "4" }, "output": { "stdout": "8 10\n1 2 0\n2 3 0\n3 4 0\n1 5 0\n2 6 0\n3 7 0\n4 8 0\n5 6 1\n6 7 1\n7 8 1" } }, { "input": { "stdin": "5" }, "output": { "stdout": "5 7\n1 2 0\n2 3 1\n3 4 0\n4 5 0\n2 4 0\n1 3 3\n3 5 1" } }, { "input": { "stdin": "40" }, "output": { "stdout": "6 11\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n4 6 32\n" } }, { "input": { "stdin": "66" }, "output": { "stdout": "7 13\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n6 7 0\n6 7 32\n2 7 64\n" } }, { "input": { "stdin": "68" }, "output": { "stdout": "7 13\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n6 7 0\n6 7 32\n3 7 64\n" } }, { "input": { "stdin": "33" }, "output": { "stdout": "6 11\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n1 6 32\n" } }, { "input": { "stdin": "256" }, "output": { "stdout": "9 16\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n6 7 0\n6 7 32\n7 8 0\n7 8 64\n8 9 0\n8 9 128\n" } }, { "input": { "stdin": "2" }, "output": { "stdout": "2 2\n1 2 0\n1 2 1\n" } }, { "input": { "stdin": "128" }, "output": { "stdout": "8 14\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n6 7 0\n6 7 32\n7 8 0\n7 8 64\n" } }, { "input": { "stdin": "264" }, "output": { "stdout": "9 17\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n6 7 0\n6 7 32\n7 8 0\n7 8 64\n8 9 0\n8 9 128\n4 9 256\n" } }, { "input": { "stdin": "130" }, "output": { "stdout": "8 15\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n6 7 0\n6 7 32\n7 8 0\n7 8 64\n2 8 128\n" } }, { "input": { "stdin": "24" }, "output": { "stdout": "5 9\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n4 5 16\n" } }, { "input": { "stdin": "72" }, "output": { "stdout": "7 13\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n6 7 0\n6 7 32\n4 7 64\n" } }, { "input": { "stdin": "136" }, "output": { "stdout": "8 15\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n6 7 0\n6 7 32\n7 8 0\n7 8 64\n4 8 128\n" } }, { "input": { "stdin": "3" }, "output": { "stdout": "2 3\n1 2 0\n1 2 1\n1 2 2\n" } }, { "input": { "stdin": "001" }, "output": { "stdout": "1 0\n" } }, { "input": { "stdin": "3" }, "output": { "stdout": "2 3\n1 2 0\n1 2 1\n1 2 2\n" } }, { "input": { "stdin": "160" }, "output": { "stdout": "8 15\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n6 7 0\n6 7 32\n7 8 0\n7 8 64\n6 8 128\n" } }, { "input": { "stdin": "257" }, "output": { "stdout": "9 17\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n6 7 0\n6 7 32\n7 8 0\n7 8 64\n8 9 0\n8 9 128\n1 9 256\n" } }, { "input": { "stdin": "144" }, "output": { "stdout": "8 15\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n6 7 0\n6 7 32\n7 8 0\n7 8 64\n5 8 128\n" } }, { "input": { "stdin": "16" }, "output": { "stdout": "5 8\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n" } }, { "input": { "stdin": "2" }, "output": { "stdout": "2 2\n1 2 0\n1 2 1\n" } }, { "input": { "stdin": "516" }, "output": { "stdout": "10 19\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n6 7 0\n6 7 32\n7 8 0\n7 8 64\n8 9 0\n8 9 128\n9 10 0\n9 10 256\n3 10 512\n" } }, { "input": { "stdin": "32" }, "output": { "stdout": "6 10\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n" } }, { "input": { "stdin": "320" }, "output": { "stdout": "9 17\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n6 7 0\n6 7 32\n7 8 0\n7 8 64\n8 9 0\n8 9 128\n7 9 256\n" } }, { "input": { "stdin": "258" }, "output": { "stdout": "9 17\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n6 7 0\n6 7 32\n7 8 0\n7 8 64\n8 9 0\n8 9 128\n2 9 256\n" } }, { "input": { "stdin": "8" }, "output": { "stdout": "4 6\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n" } }, { "input": { "stdin": "20" }, "output": { "stdout": "5 9\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n3 5 16\n" } }, { "input": { "stdin": "128" }, "output": { "stdout": "8 14\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n6 7 0\n6 7 32\n7 8 0\n7 8 64\n" } }, { "input": { "stdin": "40" }, "output": { "stdout": "6 11\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n4 6 32\n" } }, { "input": { "stdin": "6" }, "output": { "stdout": "3 5\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n2 3 4\n" } }, { "input": { "stdin": "8" }, "output": { "stdout": "4 6\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n" } }, { "input": { "stdin": "12" }, "output": { "stdout": "4 7\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n3 4 8\n" } }, { "input": { "stdin": "9" }, "output": { "stdout": "4 7\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n1 4 8\n" } }, { "input": { "stdin": "96" }, "output": { "stdout": "7 13\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n6 7 0\n6 7 32\n6 7 64\n" } }, { "input": { "stdin": "136" }, "output": { "stdout": "8 15\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n6 7 0\n6 7 32\n7 8 0\n7 8 64\n4 8 128\n" } }, { "input": { "stdin": "272" }, "output": { "stdout": "9 17\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n6 7 0\n6 7 32\n7 8 0\n7 8 64\n8 9 0\n8 9 128\n5 9 256\n" } }, { "input": { "stdin": "9" }, "output": { "stdout": "4 7\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n1 4 8\n" } }, { "input": { "stdin": "80" }, "output": { "stdout": "7 13\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n6 7 0\n6 7 32\n5 7 64\n" } }, { "input": { "stdin": "258" }, "output": { "stdout": "9 17\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n6 7 0\n6 7 32\n7 8 0\n7 8 64\n8 9 0\n8 9 128\n2 9 256\n" } }, { "input": { "stdin": "264" }, "output": { "stdout": "9 17\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n6 7 0\n6 7 32\n7 8 0\n7 8 64\n8 9 0\n8 9 128\n4 9 256\n" } }, { "input": { "stdin": "130" }, "output": { "stdout": "8 15\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n6 7 0\n6 7 32\n7 8 0\n7 8 64\n2 8 128\n" } }, { "input": { "stdin": "33" }, "output": { "stdout": "6 11\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n1 6 32\n" } }, { "input": { "stdin": "16" }, "output": { "stdout": "5 8\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n" } }, { "input": { "stdin": "34" }, "output": { "stdout": "6 11\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n2 6 32\n" } }, { "input": { "stdin": "288" }, "output": { "stdout": "9 17\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n6 7 0\n6 7 32\n7 8 0\n7 8 64\n8 9 0\n8 9 128\n6 9 256\n" } }, { "input": { "stdin": "64" }, "output": { "stdout": "7 12\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n6 7 0\n6 7 32\n" } }, { "input": { "stdin": "192" }, "output": { "stdout": "8 15\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n5 6 0\n5 6 16\n6 7 0\n6 7 32\n7 8 0\n7 8 64\n7 8 128\n" } }, { "input": { "stdin": "6" }, "output": { "stdout": "3 5\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n2 3 4\n" } }, { "input": { "stdin": "17" }, "output": { "stdout": "5 9\n1 2 0\n1 2 1\n2 3 0\n2 3 2\n3 4 0\n3 4 4\n4 5 0\n4 5 8\n1 5 16\n" } } ]

{ "tags": [], "title": "p03267 AtCoder Beginner Contest 108 - All Your Paths are Different Lengths" }

{ "cpp": "#include<iostream>\n#include<climits>\n#include<algorithm>\n#include<cmath>\n#include<vector>\n#include<string>\nusing namespace std;\ntypedef long long ll;\n\nll log(ll x, ll n){\n\tif(x==1){\n\t\treturn n;\n\t}else{\n\t\treturn log(x/2, n+1);\n\t}\n}\n\nll beki(ll x , ll n){\n\t\n\tll ans = 1;\n\tfor(int i = 0; i < n; i++)\n\t{\n\t\tans *= x;\n\t}\n\treturn ans;\n\t\n}\n\nint main(){\n\tll L;\n\tcin >> L;\n\n\tll r = log(L,0);\n\n\tll N = r+1;\n\n\tll M = 0;\n\tll buff[60][3];\n\t\n\tfor(int i = 0; i < N-1; i++)\n\t{\n\t\tbuff[M][0] = i+1;\n\t\tbuff[M][1] = i+2;\n\t\tbuff[M][2] = 0;\n\t\tbuff[M+1][0] = i+1;\n\t\tbuff[M+1][1] = i+2;\n\t\tbuff[M+1][2] = beki(2,i);\n\t\tM += 2;\n\t}\n\t\n\t\n\tfor(int i = N-1; i >= 1; i--)\n\t{\n\n\t\tif (L-beki(2,i-1) >= beki(2,r)){\n\t\t\tbuff[M][0] = i;\n\t\t\tbuff[M][1] = N;\n\t\t\tbuff[M][2] = L - beki(2,i-1);\n\t\t\tM++;\n\t\t\tL = L - beki(2,i-1);\n\t\t}\n\t}\n\t\n\tcout << N << \" \" << M << endl;\n\t\n\tfor(int i = 0; i < M; i++)\n\t{\n\t\tcout << buff[i][0] << \" \" << buff[i][1] << \" \" << buff[i][2] << endl;\n\t}\n\n\treturn 0;\n}", "java": "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.Random;\nimport java.util.StringTokenizer;\n\npublic final class Main {\n\n public static void main(String[] args) {\n final FastScanner fs = new FastScanner();\n int l = fs.nextInt();\n int idx = 0;\n final int h = (int) (Math.log(l) / Math.log(2));\n final int[][] edges = new int[60][3];\n for (int i = 0; i < h; i++) {\n final int j = i + 1;\n edges[idx++] = new int[] { i, j, 0 };\n edges[idx++] = new int[] { i, j, 1 << i };\n }\n for (int i = 0; i < h; i++) {\n if ((l & 1 << i) != 0) {\n l ^= 1 << i;\n edges[idx++] = new int[] { i, h, l };\n }\n }\n System.out.println(h + 1 + \" \" + idx);\n for (int i = 0; i < idx; i++) {\n final int u = edges[i][0] + 1;\n final int v = edges[i][1] + 1;\n final int w = edges[i][2];\n System.out.println(u + \" \" + v + ' ' + w);\n }\n }\n\n static final class Util {\n public static void shuffleSort(int[] x) {\n shuffle(x);\n Arrays.sort(x);\n }\n\n public static void shuffleSort(long[] x) {\n shuffle(x);\n Arrays.sort(x);\n }\n\n public static void shuffle(int[] x) {\n final Random r = new Random();\n\n for (int i = 0; i <= x.length - 2; i++) {\n final int j = i + r.nextInt(x.length - i);\n swap(x, i, j);\n }\n }\n\n public static void shuffle(long[] x) {\n final Random r = new Random();\n\n for (int i = 0; i <= x.length - 2; i++) {\n final int j = i + r.nextInt(x.length - i);\n swap(x, i, j);\n }\n }\n\n public static void swap(int[] x, int i, int j) {\n final int t = x[i];\n x[i] = x[j];\n x[j] = t;\n }\n\n public static void swap(long[] x, int i, int j) {\n final long t = x[i];\n x[i] = x[j];\n x[j] = t;\n }\n\n private Util() {}\n }\n\n static class FastScanner {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st = new StringTokenizer(\"\");\n\n private String next() {\n while (!st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n //noinspection CallToPrintStackTrace\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 int[] nextIntArray(int n) {\n final int[] a = new int[n];\n for (int i = 0; i < n; i++) { a[i] = nextInt(); }\n return a;\n }\n\n long[] nextLongArray(int n) {\n final long[] a = new long[n];\n for (int i = 0; i < n; i++) { a[i] = nextLong(); }\n return a;\n }\n }\n}\n", "python": "# -*- coding: utf-8 -*-\n\n\"\"\"\n参考：https://minus9d.hatenablog.com/entry/2018/09/02/004610\n・2べきで作るといいのは気づいたんだけどなぁ。\n・2べき以外の数値をどうつなげばうまく処理できるかまとめられず…。\n\"\"\"\n\nL = int(input())\n\n# 2べきで表せる基本部分を作る\nedges = []\n# baseは基本部分の守備範囲\nv = base = 1\nwhile base * 2 <= L:\n edges.append([v, v+1, 0])\n edges.append([v, v+1, base])\n base *= 2\n v += 1\n# ゴールの頂点\nend = edges[-1][1]\n# 残りがいくつか\nrest = L - base\n# 残りを2べきに分割\nfor i in range(18, -1, -1):\n num = 2 ** i\n if rest >= num:\n # ちょうどいい位置(ここより手前で2**iまでを網羅)にバイパスを作る感じ\n edges.append([i+1, end, L-rest])\n rest -= num\nprint(v, len(edges))\nfor i in range(len(edges)):\n print(*edges[i])\n" }

[ { "input": { "stdin": "5\nMASHIKE\nRUMOI\nOBIRA\nHABORO\nHOROKANAI" }, "output": { "stdout": "2" } }, { "input": { "stdin": "5\nCHOKUDAI\nRNG\nMAKOTO\nAOKI\nRINGO" }, "output": { "stdout": "7" } }, { "input": { "stdin": "4\nZZ\nZZZ\nZ\nZZZZZZZZZZ" }, "output": { "stdout": "0" } }, { "input": { "stdin": "5\nIHOUKD@E\nGNR\nPKOATM\nNIAK\nRNNFI" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "5\nMASIHLE\nIOTMR\nACIOR\nRACOHO\nJAN@LOROI" }, "output": { "stdout": "1\n" } }, { "input": { "stdin": "5\nIGDUKO@E\nHNR\nMTAOKP\nAINK\nRINGN" }, "output": { "stdout": "4\n" } }, { "input": { "stdin": "5\nIGDUKO@E\nRNH\nMTAOKP\nKIAN\nRNNFI" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "5\nCHOKUD@I\nRNG\nMAKOTO\nAOKI\nRINGN" }, "output": { "stdout": "7\n" } }, { "input": { "stdin": "5\nMASHIKE\nIOMUR\nARIBO\nHABORN\nHOROKANAI" }, "output": { "stdout": "2\n" } }, { "input": { "stdin": "5\nIGDUKO@E\nRNH\nPKOATM\nKIAN\nRNNFI" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "5\nIGDUKO@E\nRNH\nMTAOKP\nNIAK\nRINFN" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "5\nI@DUKOGE\nHNR\nMTAOKP\nAINK\nRINGN" }, "output": { "stdout": "4\n" } }, { "input": { "stdin": "4\nZY\nYZZ\nY\nZZZZZZZZZZ" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "5\nMASHIKE\nRUMOI\nOBIRA\nOROBAH\nHOROKANAI" }, "output": { "stdout": "1\n" } }, { "input": { "stdin": "4\nZY\nYZZ\nZ\nZZZZZZZZZZ" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "5\nEKIHSAM\nRUMOI\nAOICR\nHABOQN\nIAN@LOROH" }, "output": { "stdout": "1\n" } }, { "input": { "stdin": "5\nI@DUKOGE\nHNR\nMTAOKP\nIKNA\nRINGN" }, "output": { "stdout": "1\n" } }, { "input": { "stdin": "5\nE@HKUODI\nGNR\nPKOATM\nNIAK\nRNNFI" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "5\nCHOKUD@I\nRNG\nMAKOTO\nAOKI\nRINGO" }, "output": { "stdout": "7\n" } }, { "input": { "stdin": "4\nZX\nZZZ\nX\nYXZZZZZ[ZZ" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "5\nMASIHLE\nIOTMR\nACIOR\nRACOHO\nHOROL@NAJ" }, "output": { "stdout": "4\n" } }, { "input": { "stdin": "5\nMASHILE\nRMUOI\nROICA\nHABOQO\nJAN@LOROH" }, "output": { "stdout": "2\n" } }, { "input": { "stdin": "4\nZY\nZZZ\nX\nYXZZZZZ[ZZ" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "5\nI@DUKOGE\nGNR\nMKAOTP\nAOKI\nRINGN" }, "output": { "stdout": "1\n" } }, { "input": { "stdin": "4\nYW\nZ[Z\nX\nYXZZZZZZZZ" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "4\nWY\n[ZZ\nY\nYXZZZZZZZZ" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "5\nIGDUKO@E\nRNH\nMTAOKP\nKIAN\nRINFN" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "5\nDGOKUD@I\nRNG\nMAKOTO\nAOKI\nRINGN" }, "output": { "stdout": "2\n" } }, { "input": { "stdin": "4\nYX\nZZZ\nX\nYXZZZZZ[ZZ" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "5\nMASHILE\nRMUOI\nAOICR\nHABOQN\nJAN@LOROH" }, "output": { "stdout": "4\n" } }, { "input": { "stdin": "5\nE@DKUOHI\nGNR\nPKOATM\nNIAK\nRNNFI" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "5\nIHDUKO@E\nRNH\nPKOATM\nKIAN\nRNNFI" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "4\nZZ\nZYZ\nX\nZYZZZZZZZZ" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "4\nZY\nZZY\nZ\nZZZZZZZZZZ" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "5\nMASIHLE\nIORMT\nACIOR\nRACOHO\nKBN@LOROI" }, "output": { "stdout": "1\n" } }, { "input": { "stdin": "5\nIHDUKO@E\nGNR\nPKOATM\nKIAN\nRNNFI" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "4\nWY\n[ZZ\nX\nYXZZZZZZZZ" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "4\nWY\nZ[Z\nX\nYXZZZZZZZZ" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "5\nI@DUKOGE\nHNR\nMKAOTP\nIKNA\nRINGN" }, "output": { "stdout": "1\n" } }, { "input": { "stdin": "5\nMASHIKE\nRMUOI\nAOICR\nHABOQN\nJAN@LOROH" }, "output": { "stdout": "4\n" } }, { "input": { "stdin": "5\nE@HKTOCI\nGNR\nPKOATM\nNIAK\nRNNFI" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "5\nE@HKTOCI\nGNR\nPKOATM\nNIAK\nIFNNR" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "5\nEKIHSAM\nIOMUR\nOCIRA\nHABOQN\nIAN@KOROH" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "4\nYW\nZZZ\nX\nYXZZZZZ[ZZ" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "5\nMASHIKE\nIOMUR\nARIBO\nOROBAH\nHOROKANAI" }, "output": { "stdout": "1\n" } }, { "input": { "stdin": "5\nEKIHSAM\nIOMUR\nOCIRA\nHABOQN\nIANAKOROH" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "5\nMASIHLE\nIOTMR\nACIOR\nQACOHO\nHOROL@NAJ" }, "output": { "stdout": "1\n" } }, { "input": { "stdin": "5\nMASIHLE\nIOUMR\nACIOR\nHACOQO\nJAN@LOROH" }, "output": { "stdout": "1\n" } }, { "input": { "stdin": "5\nMASIHLE\nIOUMR\nACIOR\nQACOHO\nJAN@LOROH" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "5\nMASIHLE\nIOTMR\nACIOR\nRACOHO\nKAN@LOROI" }, "output": { "stdout": "1\n" } } ]

{ "tags": [], "title": "p03425 AtCoder Beginner Contest 089 - March" }

{ "cpp": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tlong int n,ma=0,aa=0,ra=0,ca=0,ha=0;\n \tcin >> n;\n \tfor (int i=0;i<n;i++){\n \tstring t;\n \tcin >> t;\n \tif (t[0]=='M' ) ma++;\n if (t[0]=='A' ) aa++;\n \tif (t[0]=='R' ) ra++;\n \tif (t[0]=='C' ) ca++;\n \tif (t[0]=='H' )\tha++;\n }\n \tcout << ma*aa*ra+ma*aa*ca+ma*aa*ha+ma*ra*ca+ma*ra*ha+ma*ca*ha+aa*ra*ca+aa*ra*ha+aa*ca*ha+ra*ca*ha << endl;\n}", "java": "import java.util.Scanner;\n\n/**\n * Created by Santa on 2016/10/16.\n */\npublic class Main {\n\n static class pair {\n public int a;\n public int b;\n\n pair(){\n this.a = 0;\n this.b = 0;\n }\n\n pair(int a, int b){\n this.a = a;\n this.b = b;\n }\n\n public void set(int a, int b) {\n this.a = a;\n this.b = b;\n }\n }\n\n public static void main(String[] args){\n Scanner scanner = new Scanner(System.in);\n\n int N = scanner.nextInt();\n long[] map = new long[5];\n\n for (int i = 0; i < N; i++) {\n String s = scanner.next();\n\n if(s.charAt(0) == 'M')map[0]++;\n if(s.charAt(0) == 'A')map[1]++;\n if(s.charAt(0) == 'R')map[2]++;\n if(s.charAt(0) == 'C')map[3]++;\n if(s.charAt(0) == 'H')map[4]++;\n }\n\n long ans = 0;\n for (int i = 0; i < 5; i++) {\n for (int j = i + 1; j < 5; j++) {\n for (int k = j + 1; k < 5; k++) {\n ans += map[i] * map[j] * map[k];\n }\n }\n }\n\n System.out.println(ans);\n }\n\n\n\n}\n\n\n", "python": "N=int(input())\nS=[input()[0] for _ in range(N)]\nC=[S.count(c) for c in \"MARCH\"]\nprint(C[0]*C[1]*C[2]+C[0]*C[1]*C[3]+C[0]*C[1]*C[4]+C[0]*C[2]*C[3]+C[0]*C[2]*C[4]+C[0]*C[3]*C[4]+C[1]*C[2]*C[3]+C[1]*C[2]*C[4]+C[1]*C[3]*C[4]+C[2]*C[3]*C[4])\n" }

[ { "input": { "stdin": "2 2 0" }, "output": { "stdout": "abab" } }, { "input": { "stdin": "1 1 1" }, "output": { "stdout": "acb" } }, { "input": { "stdin": "8 0 2" }, "output": { "stdout": "aaaacaaaac\n" } }, { "input": { "stdin": "5 0 0" }, "output": { "stdout": "aaaaa\n" } }, { "input": { "stdin": "1 4 2" }, "output": { "stdout": "accbbbb\n" } }, { "input": { "stdin": "10 7 4" }, "output": { "stdout": "ababbabacabacabacabac\n" } }, { "input": { "stdin": "10 1 2" }, "output": { "stdout": "aaaacaaacaaab\n" } }, { "input": { "stdin": "10 7 0" }, "output": { "stdout": "aababaababaababab\n" } }, { "input": { "stdin": "3 0 1" }, "output": { "stdout": "aaac\n" } }, { "input": { "stdin": "4 9 3" }, "output": { "stdout": "abbbbbbbbbacacac\n" } }, { "input": { "stdin": "6 0 1" }, "output": { "stdout": "aaaaaac\n" } }, { "input": { "stdin": "7 2 2" }, "output": { "stdout": "aababaacaac\n" } }, { "input": { "stdin": "0 9 1" }, "output": { "stdout": "bbbbbbbbbc\n" } }, { "input": { "stdin": "1 0 1" }, "output": { "stdout": "ac\n" } }, { "input": { "stdin": "6 3 1" }, "output": { "stdout": "aabababaac\n" } }, { "input": { "stdin": "4 1 0" }, "output": { "stdout": "aaaab\n" } }, { "input": { "stdin": "0 1 0" }, "output": { "stdout": "b\n" } }, { "input": { "stdin": "3 0 0" }, "output": { "stdout": "aaa\n" } }, { "input": { "stdin": "3 1 1" }, "output": { "stdout": "aacab\n" } }, { "input": { "stdin": "6 3 2" }, "output": { "stdout": "aacacababab\n" } }, { "input": { "stdin": "4 7 2" }, "output": { "stdout": "abbbacacabbbb\n" } }, { "input": { "stdin": "5 7 2" }, "output": { "stdout": "abbacabbacabbb\n" } }, { "input": { "stdin": "0 7 2" }, "output": { "stdout": "bbbbcbbbc\n" } }, { "input": { "stdin": "7 7 3" }, "output": { "stdout": "abacacacabbabbabb\n" } }, { "input": { "stdin": "3 3 0" }, "output": { "stdout": "ababab\n" } }, { "input": { "stdin": "7 2 0" }, "output": { "stdout": "aaaabaaab\n" } }, { "input": { "stdin": "0 3 0" }, "output": { "stdout": "bbb\n" } }, { "input": { "stdin": "11 3 1" }, "output": { "stdout": "aaabaaacaaabaab\n" } }, { "input": { "stdin": "1 2 2" }, "output": { "stdout": "accbb\n" } }, { "input": { "stdin": "2 1 0" }, "output": { "stdout": "aab\n" } }, { "input": { "stdin": "7 1 1" }, "output": { "stdout": "aaaacaaab\n" } }, { "input": { "stdin": "17 7 3" }, "output": { "stdout": "aabaacaacaacaababaababaabab\n" } }, { "input": { "stdin": "8 4 1" }, "output": { "stdout": "aababaababaac\n" } }, { "input": { "stdin": "13 7 3" }, "output": { "stdout": "aacababaacababaacababab\n" } }, { "input": { "stdin": "0 3 2" }, "output": { "stdout": "bbcbc\n" } }, { "input": { "stdin": "4 2 1" }, "output": { "stdout": "aacabab\n" } }, { "input": { "stdin": "0 7 0" }, "output": { "stdout": "bbbbbbb\n" } }, { "input": { "stdin": "7 2 4" }, "output": { "stdout": "aacacacacabab\n" } }, { "input": { "stdin": "10 7 2" }, "output": { "stdout": "aacacababababababab\n" } }, { "input": { "stdin": "2 0 1" }, "output": { "stdout": "aac\n" } }, { "input": { "stdin": "6 3 0" }, "output": { "stdout": "aabaabaab\n" } }, { "input": { "stdin": "9 7 3" }, "output": { "stdout": "ababacabacabacababb\n" } }, { "input": { "stdin": "2 3 0" }, "output": { "stdout": "ababb\n" } }, { "input": { "stdin": "7 2 1" }, "output": { "stdout": "aaacaabaab\n" } }, { "input": { "stdin": "5 2 1" }, "output": { "stdout": "aababaac\n" } }, { "input": { "stdin": "7 4 1" }, "output": { "stdout": "aababababaac\n" } }, { "input": { "stdin": "11 3 2" }, "output": { "stdout": "aaacaacaabaabaab\n" } }, { "input": { "stdin": "7 23 3" }, "output": { "stdout": "abbbbbacacacabbbbbbabbbbbbabbbbbb\n" } }, { "input": { "stdin": "0 0 1" }, "output": { "stdout": "c\n" } }, { "input": { "stdin": "2 1 1" }, "output": { "stdout": "abac\n" } } ]

{ "tags": [], "title": "p03582 CODE FESTIVAL 2017 qual B - Largest Smallest Cyclic Shift" }

{ "cpp": "#include <bits/stdc++.h>\nusing namespace std;\n\nlong long int X, Y, Z, S, K;\n\nstatic inline void exap(string &src, string s, long long int t){\n for(int i = 0; i < t; ++i)src += s;\n}\n\nvoid twoletter(long long X, long long Y, string xc, string yc){\n while(X && Y){\n if(X > Y){\n X -= Y;\n yc = xc + yc;\n }else{\n K = Y / X;\n Y %= X;\n X -= Y;\n exap(xc, yc, K);\n yc = xc + yc;\n }\n }\n for(int i = 0; i < X; ++i)cout << xc;\n for(int i = 0; i < Y; ++i)cout << yc;\n cout << endl;\n return;\n}\n\nint main(){\n scanf(\"%lld%lld%lld\", &X, &Y, &Z);\n S = X + Y + Z;\n if(S == X || S == Y || S == Z){\n for(int i = 0; i < X; ++i)cout << \"a\";\n for(int i = 0; i < Y; ++i)cout << \"b\";\n for(int i = 0; i < Z; ++i)cout << \"c\";\n cout << endl;\n return 0;\n }\n string A = \"a\", B = \"b\", C = \"c\";\n while(1){\n //cout << A << X << \" \" << B << Y << \" \" << C << Z << endl;\n if(X == 0){\n twoletter(Y, Z, B, C);\n return 0;\n }\n if(Y == 0){\n twoletter(X, Z, A, C);\n return 0;\n }\n if(Z == 0){\n twoletter(X, Y, A, B);\n return 0;\n }\n if(X > Z){\n X -= Z;\n C = A + C;\n }else{\n K = Z / X;\n Z %= X;\n X -= Z;\n exap(A, C, K);\n C = A + C;\n }\n swap(B, C);\n swap(Y, Z);\n }\n return 0;\n}\n", "java": "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\tstatic InputStream is;\n\tstatic PrintWriter out;\n\tstatic String INPUT = \"\";\n\t\n\tstatic void solve()\n\t{\n\t\tint x = ni(), y = ni(), z = ni();\n\t\tList<String> list = new ArrayList<>();\n\t\tfor(int i = 0;i < x;i++)list.add(\"a\");\n\t\tfor(int i = 0;i < y;i++)list.add(\"b\");\n\t\tfor(int i = 0;i < z;i++)list.add(\"c\");\n\t\twhile(list.size() > 1){\n\t\t\tint argmin = 0;\n\t\t\tfor(int i = 0;i < list.size();i++){\n\t\t\t\tif(list.get(i).compareTo(list.get(argmin)) < 0){\n\t\t\t\t\targmin = i;\n\t\t\t\t}\n\t\t\t}\n\t\t\tString min = list.remove(argmin);\n\t\t\tint argmax = 0;\n\t\t\tfor(int i = 0;i < list.size();i++){\n\t\t\t\tif(list.get(i).compareTo(list.get(argmax)) > 0){\n\t\t\t\t\targmax = i;\n\t\t\t\t}\n\t\t\t}\n\t\t\tString max = list.remove(argmax);\n\t\t\tlist.add(min+max);\n\t\t}\n\t\tout.println(list.get(0));\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception\n\t{\n\t\tlong S = System.currentTimeMillis();\n\t\tis = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tsolve();\n\t\tout.flush();\n\t\tlong G = System.currentTimeMillis();\n\t\ttr(G-S+\"ms\");\n\t}\n\t\n\tprivate static boolean eof()\n\t{\n\t\tif(lenbuf == -1)return true;\n\t\tint lptr = ptrbuf;\n\t\twhile(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;\n\t\t\n\t\ttry {\n\t\t\tis.mark(1000);\n\t\t\twhile(true){\n\t\t\t\tint b = is.read();\n\t\t\t\tif(b == -1){\n\t\t\t\t\tis.reset();\n\t\t\t\t\treturn true;\n\t\t\t\t}else if(!isSpaceChar(b)){\n\t\t\t\t\tis.reset();\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t} catch (IOException e) {\n\t\t\treturn true;\n\t\t}\n\t}\n\t\n\tprivate static byte[] inbuf = new byte[1024];\n\tstatic int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate static 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 static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n//\tprivate static boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); }\n\tprivate static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate static double nd() { return Double.parseDouble(ns()); }\n\tprivate static char nc() { return (char)skip(); }\n\t\n\tprivate static String ns()\n\t{\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\t\n\tprivate static 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 static 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 static 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 static 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 static 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 static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }\n}\n", "python": "x, y, z = map(int, raw_input().split())\na = ['a'] * x + ['b'] * y + ['c'] * z\n\nwhile len(a) > 1:\n a = sorted(a[1:-1] + [a[0] + a[-1]])\n\nprint a[0]\n\n" }

[ { "input": { "stdin": "5\n3 -6 4 -5 7" }, "output": { "stdout": "0" } }, { "input": { "stdin": "4\n1 -3 1 0" }, "output": { "stdout": "4" } }, { "input": { "stdin": "6\n-1 4 3 2 -5 4" }, "output": { "stdout": "8" } }, { "input": { "stdin": "4\n0 0 1 1" }, "output": { "stdout": "7\n" } }, { "input": { "stdin": "5\n3 -8 4 -8 7" }, "output": { "stdout": "3\n" } }, { "input": { "stdin": "6\n0 2 2 0 -2 -1" }, "output": { "stdout": "10\n" } }, { "input": { "stdin": "5\n12 -5 9 -66 4" }, "output": { "stdout": "63\n" } }, { "input": { "stdin": "4\n0 0 1 0" }, "output": { "stdout": "6\n" } }, { "input": { "stdin": "6\n-1 4 2 2 -5 0" }, "output": { "stdout": "11\n" } }, { "input": { "stdin": "4\n1 -5 1 -4" }, "output": { "stdout": "4\n" } }, { "input": { "stdin": "6\n0 2 -56 1 -3 4" }, "output": { "stdout": "56\n" } }, { "input": { "stdin": "5\n113 -2 -1 0 -1" }, "output": { "stdout": "120\n" } }, { "input": { "stdin": "5\n68 -1 -1 1 -5" }, "output": { "stdout": "74\n" } }, { "input": { "stdin": "5\n55 -1 0 1 -6" }, "output": { "stdout": "62\n" } }, { "input": { "stdin": "4\n1 0 1 0" }, "output": { "stdout": "5\n" } }, { "input": { "stdin": "4\n0 1 1 2" }, "output": { "stdout": "5\n" } }, { "input": { "stdin": "6\n9 0 -11 1 -2 0" }, "output": { "stdout": "24\n" } }, { "input": { "stdin": "6\n7 -1 -7 2 -2 0" }, "output": { "stdout": "18\n" } }, { "input": { "stdin": "4\n2 -2 2 -1" }, "output": { "stdout": "2\n" } }, { "input": { "stdin": "5\n6 -5 9 -66 4" }, "output": { "stdout": "57\n" } }, { "input": { "stdin": "6\n0 2 0 2 -5 1" }, "output": { "stdout": "7\n" } }, { "input": { "stdin": "5\n32 -3 2 -1 1" }, "output": { "stdout": "32\n" } }, { "input": { "stdin": "4\n1 -2 1 1" }, "output": { "stdout": "4\n" } }, { "input": { "stdin": "6\n0 2 -34 1 -3 4" }, "output": { "stdout": "34\n" } }, { "input": { "stdin": "5\n113 -2 -1 1 -1" }, "output": { "stdout": "121\n" } }, { "input": { "stdin": "6\n0 8 0 2 -5 -1" }, "output": { "stdout": "15\n" } }, { "input": { "stdin": "6\n0 2 0 2 -5 0" }, "output": { "stdout": "8\n" } }, { "input": { "stdin": "4\n1 -4 1 0" }, "output": { "stdout": "5\n" } }, { "input": { "stdin": "4\n1 -5 1 -1" }, "output": { "stdout": "5\n" } }, { "input": { "stdin": "4\n1 -5 1 -2" }, "output": { "stdout": "4\n" } }, { "input": { "stdin": "6\n-1 4 1 2 -5 0" }, "output": { "stdout": "10\n" } }, { "input": { "stdin": "5\n12 -5 9 -84 1" }, "output": { "stdout": "84\n" } }, { "input": { "stdin": "5\n21 -4 2 -2 1" }, "output": { "stdout": "19\n" } }, { "input": { "stdin": "5\n55 -1 -1 1 -6" }, "output": { "stdout": "61\n" } }, { "input": { "stdin": "6\n0 8 2 2 -5 -1" }, "output": { "stdout": "17\n" } }, { "input": { "stdin": "4\n1 -4 1 -4" }, "output": { "stdout": "3\n" } }, { "input": { "stdin": "6\n0 2 1 0 -5 -1" }, "output": { "stdout": "12\n" } }, { "input": { "stdin": "4\n1 -3 1 -1" }, "output": { "stdout": "3\n" } }, { "input": { "stdin": "6\n-1 2 -40 1 -2 4" }, "output": { "stdout": "39\n" } }, { "input": { "stdin": "6\n-1 1 2 -1 -2 -1" }, "output": { "stdout": "11\n" } }, { "input": { "stdin": "4\n2 -2 1 1" }, "output": { "stdout": "5\n" } }, { "input": { "stdin": "5\n71 -2 -1 -2 -2" }, "output": { "stdout": "77\n" } }, { "input": { "stdin": "5\n0 32 1 1 1" }, "output": { "stdout": "38\n" } }, { "input": { "stdin": "6\n0 0 2 -1 -2 -1" }, "output": { "stdout": "9\n" } }, { "input": { "stdin": "4\n0 0 1 2" }, "output": { "stdout": "6\n" } }, { "input": { "stdin": "5\n32 -3 0 -1 0" }, "output": { "stdout": "35\n" } }, { "input": { "stdin": "5\n3 -5 4 -15 7" }, "output": { "stdout": "7\n" } }, { "input": { "stdin": "5\n106 -1 -1 1 -5" }, "output": { "stdout": "112\n" } }, { "input": { "stdin": "5\n12 -5 11 -84 0" }, "output": { "stdout": "83\n" } }, { "input": { "stdin": "5\n71 -3 -1 -2 -1" }, "output": { "stdout": "75\n" } } ]

{ "tags": [], "title": "p03739 AtCoder Beginner Contest 059 - Sequence" }

{ "cpp": "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\n\nint solvePlus(vector<int> v) {\n int cnt = 0, sum = 0;\n\n for (int i = 0; i < v.size(); i++) {\n sum += v[i];\n if (i % 2 == 1) {\n cnt = (sum < 0) ? cnt : (cnt + abs(sum) + 1);\n sum = (sum < 0) ? sum : -1;\n } else if (i % 2 == 0) {\n cnt = (sum > 0) ? cnt : (cnt + abs(sum) + 1);\n sum = (sum > 0) ? sum : 1;\n }\n }\n return cnt;\n}\n\nsigned main() {\n int n;\n cin >> n;\n vector<int> a(n);\n for (auto&& w : a) cin >> w;\n int ans1, ans2;\n ans1 = solvePlus(a);\n for (auto&& w : a) w *= -1;\n ans2 = solvePlus(a);\n\n cout << min(ans1, ans2) << endl;\n}", "java": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = Integer.parseInt(sc.next());\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\ta[i] = Integer.parseInt(sc.next());\n\t\t}\n\t\tsc.close();\n\n\t\tlong sum = 0;\n\t\tlong cnt1 = 0;\n\t\tlong cnt2 = 0;\n\t\tlong flg = 1;\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\tsum += a[i];\n\t\t\tif(sum * flg <= 0) {\n\t\t\t\tcnt1 += Math.abs(sum) + 1;\n\t\t\t\tsum = flg;\n\t\t\t}\n\t\t\tflg *= -1;\n\t\t}\n\t\tflg = -1;\n\t\tsum = 0;\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\tsum += a[i];\n\t\t\tif(sum * flg <= 0) {\n\t\t\t\tcnt2 += Math.abs(sum) + 1;\n\t\t\t\tsum = flg;\n\t\t\t}\n\t\t\tflg *= -1;\n\t\t}\n\t\tSystem.out.println(Math.min(cnt1,cnt2));\n\t}\n}", "python": "n = int(input())\nA = list(map(int, input().split()))\n\nINF = float('inf')\n\nans = INF\n\nfor sign in (1, -1):\n res, total_a = 0, 0\n for a in A:\n total_a += a\n if total_a * sign <= 0:\n res += abs(total_a - sign)\n total_a = sign\n sign *= -1\n ans = min(ans, res)\n\nprint(ans)" }

[ { "input": { "stdin": "6\n40" }, "output": { "stdout": "7.5000000" } }, { "input": { "stdin": "101\n80" }, "output": { "stdout": "63.7500000" } }, { "input": { "stdin": "3\n100" }, "output": { "stdout": "2.0000000" } }, { "input": { "stdin": "6\n254" }, "output": { "stdout": "1.181102362205\n" } }, { "input": { "stdin": "101\n15" }, "output": { "stdout": "340.000000000000\n" } }, { "input": { "stdin": "6\n85" }, "output": { "stdout": "3.529411764706\n" } }, { "input": { "stdin": "6\n35" }, "output": { "stdout": "8.571428571429\n" } }, { "input": { "stdin": "101\n10" }, "output": { "stdout": "510.000000000000\n" } }, { "input": { "stdin": "101\n29" }, "output": { "stdout": "175.862068965517\n" } }, { "input": { "stdin": "101\n132" }, "output": { "stdout": "38.636363636364\n" } }, { "input": { "stdin": "6\n463" }, "output": { "stdout": "0.647948164147\n" } }, { "input": { "stdin": "6\n944" }, "output": { "stdout": "0.317796610169\n" } }, { "input": { "stdin": "101\n11" }, "output": { "stdout": "463.636363636364\n" } }, { "input": { "stdin": "101\n71" }, "output": { "stdout": "71.830985915493\n" } }, { "input": { "stdin": "101\n416" }, "output": { "stdout": "12.259615384615\n" } }, { "input": { "stdin": "101\n105" }, "output": { "stdout": "48.571428571429\n" } }, { "input": { "stdin": "6\n2959" }, "output": { "stdout": "0.101385603244\n" } }, { "input": { "stdin": "101\n13" }, "output": { "stdout": "392.307692307692\n" } }, { "input": { "stdin": "6\n3231" }, "output": { "stdout": "0.092850510678\n" } }, { "input": { "stdin": "6\n37" }, "output": { "stdout": "8.108108108108\n" } }, { "input": { "stdin": "6\n59" }, "output": { "stdout": "5.084745762712\n" } }, { "input": { "stdin": "6\n36" }, "output": { "stdout": "8.333333333333\n" } }, { "input": { "stdin": "101\n9" }, "output": { "stdout": "566.666666666667\n" } }, { "input": { "stdin": "101\n-2" }, "output": { "stdout": "-2550.000000000000\n" } }, { "input": { "stdin": "101\n16" }, "output": { "stdout": "318.750000000000\n" } }, { "input": { "stdin": "3\n110" }, "output": { "stdout": "1.818181818182\n" } }, { "input": { "stdin": "6\n95" }, "output": { "stdout": "3.157894736842\n" } }, { "input": { "stdin": "3\n010" }, "output": { "stdout": "20.000000000000\n" } }, { "input": { "stdin": "6\n174" }, "output": { "stdout": "1.724137931034\n" } }, { "input": { "stdin": "101\n197" }, "output": { "stdout": "25.888324873096\n" } }, { "input": { "stdin": "101\n37" }, "output": { "stdout": "137.837837837838\n" } }, { "input": { "stdin": "6\n2101" }, "output": { "stdout": "0.142789148025\n" } }, { "input": { "stdin": "101\n221" }, "output": { "stdout": "23.076923076923\n" } }, { "input": { "stdin": "6\n160" }, "output": { "stdout": "1.875000000000\n" } }, { "input": { "stdin": "6\n4715" }, "output": { "stdout": "0.063626723224\n" } }, { "input": { "stdin": "6\n106" }, "output": { "stdout": "2.830188679245\n" } }, { "input": { "stdin": "6\n805" }, "output": { "stdout": "0.372670807453\n" } }, { "input": { "stdin": "6\n19" }, "output": { "stdout": "15.789473684211\n" } }, { "input": { "stdin": "6\n180" }, "output": { "stdout": "1.666666666667\n" } }, { "input": { "stdin": "6\n1401" }, "output": { "stdout": "0.214132762313\n" } }, { "input": { "stdin": "3\n011" }, "output": { "stdout": "18.181818181818\n" } }, { "input": { "stdin": "101\n216" }, "output": { "stdout": "23.611111111111\n" } }, { "input": { "stdin": "6\n813" }, "output": { "stdout": "0.369003690037\n" } }, { "input": { "stdin": "6\n61" }, "output": { "stdout": "4.918032786885\n" } }, { "input": { "stdin": "6\n866" }, "output": { "stdout": "0.346420323326\n" } }, { "input": { "stdin": "3\n101" }, "output": { "stdout": "1.980198019802\n" } }, { "input": { "stdin": "101\n23" }, "output": { "stdout": "221.739130434783\n" } }, { "input": { "stdin": "6\n370" }, "output": { "stdout": "0.810810810811\n" } }, { "input": { "stdin": "101\n141" }, "output": { "stdout": "36.170212765957\n" } }, { "input": { "stdin": "101\n82" }, "output": { "stdout": "62.195121951220\n" } } ]

{ "tags": [], "title": "p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing!" }

{ "cpp": "// #pragma GCC target(\"avx2\") // CPU 処理並列化\n// #pragma GCC optimize(\"O3\") // CPU 処理並列化\n// #pragma GCC optimize(\"unroll-loops\") // 条件処理の呼び出しを減らす\n#include<stdio.h>\n#include<math.h>\n#include<algorithm>\n#include<queue>\n#include<deque>\n#include<stack>\n#include<string>\n#include<string.h>\n#include<vector>\n#include<set>\n#include<map>\n#include<bitset>\n#include<stdlib.h>\n#include<cassert>\n#include<time.h>\n#include<bitset>\n#include<numeric>\nusing namespace std;\nconst long long mod=1000000007;\nconst long long inf=mod*mod;\nconst long long d2=(mod+1)/2;\nconst double EPS=1e-10;\nconst double INF=1e+10;\nconst double PI=acos(-1.0);\nconst int C_SIZE = 3121000;\nlong long fact[C_SIZE];\nlong long finv[C_SIZE];\nlong long inv[C_SIZE];\nlong long Comb(int a,int b){\n \tif(a<b||b<0)return 0;\n \treturn fact[a]*finv[b]%mod*finv[a-b]%mod;\n}\nvoid init_C(int n){\n\tfact[0]=finv[0]=inv[1]=1;\n\tfor(int i=2;i<n;i++){\n\t\tinv[i]=(mod-(mod/i)*inv[mod%i]%mod)%mod;\n\t}\n\tfor(int i=1;i<n;i++){\n\t\tfact[i]=fact[i-1]*i%mod;\n\t\tfinv[i]=finv[i-1]*inv[i]%mod;\n\t}\n}\nlong long pw(long long a,long long b){\n\tif(a<0LL)return 0;\n\tif(b<0LL)return 0;\n\tlong long ret=1;\n\twhile(b){\n\t\tif(b%2)ret=ret*a%mod;\n\t\ta=a*a%mod;\n\t\tb/=2;\n\t}\n\treturn ret;\n}\nint ABS(int a){return max(a,-a);}\nlong long ABS(long long a){return max(a,-a);}\ndouble ABS(double a){return max(a,-a);}\nint sig(double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }\n// ここから編集しろ\n\nint main(){\n\tint a,b;scanf(\"%d%d\",&a,&b);\n\tdouble p=0.01*b;\n\tdouble ret=0;\n\tif(a%2){\n\t\tret=p*(1+(a-1)/2/p)+(1-p)*(1+(a+1)/2/p);\n\t}else{\n\t\tret=a/2/p;\n\t}\n\tprintf(\"%.12f\\n\",ret);\n}", "java": "import java.io.IOException; \nimport java.io.InputStream; \nimport java.io.PrintWriter; \nimport java.util.*; \n \n\nclass Main{ \n\n\tstatic void solve(){\n\t\tint x = ni();\n\t\tdouble p = ni()/100.0;\n\t\tdouble ans = 0;\n\t\tif(x%2==0)ans=(double)x/(2*p);\n\t\telse{\n\t\t\tans=1;\n\t\t\tans += (x-1)/2;\n\t\t\tans += ((1-p)*((double)x+1))/(p*2);\n\t\t}\n\t\tout.println(ans);\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", "python": "x = int(input())\np = int(input()) / 100\nprint(((x + 1) // 2) / p)\n" }

[ { "input": { "stdin": "5" }, "output": { "stdout": "130000" } }, { "input": { "stdin": "4" }, "output": { "stdout": "123000\n" } }, { "input": { "stdin": "143" }, "output": { "stdout": "115848000\n" } }, { "input": { "stdin": "53" }, "output": { "stdout": "1427000\n" } }, { "input": { "stdin": "8" }, "output": { "stdout": "152000\n" } }, { "input": { "stdin": "11" }, "output": { "stdout": "177000\n" } }, { "input": { "stdin": "56" }, "output": { "stdout": "1653000\n" } }, { "input": { "stdin": "57" }, "output": { "stdout": "1736000\n" } }, { "input": { "stdin": "50" }, "output": { "stdout": "1232000\n" } }, { "input": { "stdin": "2" }, "output": { "stdout": "111000\n" } }, { "input": { "stdin": "15" }, "output": { "stdout": "217000\n" } }, { "input": { "stdin": "17" }, "output": { "stdout": "240000\n" } }, { "input": { "stdin": "43" }, "output": { "stdout": "873000\n" } }, { "input": { "stdin": "61" }, "output": { "stdout": "2112000\n" } }, { "input": { "stdin": "31" }, "output": { "stdout": "482000\n" } }, { "input": { "stdin": "68" }, "output": { "stdout": "2975000\n" } }, { "input": { "stdin": "30" }, "output": { "stdout": "459000\n" } }, { "input": { "stdin": "133" }, "output": { "stdout": "71117000\n" } }, { "input": { "stdin": "69" }, "output": { "stdout": "3124000\n" } }, { "input": { "stdin": "54" }, "output": { "stdout": "1499000\n" } }, { "input": { "stdin": "108" }, "output": { "stdout": "20995000\n" } }, { "input": { "stdin": "3" }, "output": { "stdout": "117000\n" } }, { "input": { "stdin": "28" }, "output": { "stdout": "416000\n" } }, { "input": { "stdin": "190" }, "output": { "stdout": "1147676000\n" } }, { "input": { "stdin": "41" }, "output": { "stdout": "791000\n" } }, { "input": { "stdin": "20" }, "output": { "stdout": "279000\n" } }, { "input": { "stdin": "134" }, "output": { "stdout": "74673000\n" } }, { "input": { "stdin": "39" }, "output": { "stdout": "717000\n" } }, { "input": { "stdin": "86" }, "output": { "stdout": "7171000\n" } }, { "input": { "stdin": "12" }, "output": { "stdout": "186000\n" } }, { "input": { "stdin": "291" }, "output": { "stdout": "158467928000\n" } }, { "input": { "stdin": "44" }, "output": { "stdout": "917000\n" } }, { "input": { "stdin": "123" }, "output": { "stdout": "43657000\n" } }, { "input": { "stdin": "125" }, "output": { "stdout": "48132000\n" } }, { "input": { "stdin": "76" }, "output": { "stdout": "4400000\n" } }, { "input": { "stdin": "103" }, "output": { "stdout": "16448000\n" } }, { "input": { "stdin": "58" }, "output": { "stdout": "1823000\n" } }, { "input": { "stdin": "101" }, "output": { "stdout": "14918000\n" } }, { "input": { "stdin": "214" }, "output": { "stdout": "3701387000\n" } }, { "input": { "stdin": "51" }, "output": { "stdout": "1294000\n" } }, { "input": { "stdin": "47" }, "output": { "stdout": "1063000\n" } }, { "input": { "stdin": "122" }, "output": { "stdout": "41578000\n" } }, { "input": { "stdin": "10" }, "output": { "stdout": "168000\n" } }, { "input": { "stdin": "24" }, "output": { "stdout": "341000\n" } }, { "input": { "stdin": "95" }, "output": { "stdout": "11129000\n" } }, { "input": { "stdin": "102" }, "output": { "stdout": "15664000\n" } }, { "input": { "stdin": "188" }, "output": { "stdout": "1040975000\n" } }, { "input": { "stdin": "170" }, "output": { "stdout": "432541000\n" } }, { "input": { "stdin": "23" }, "output": { "stdout": "324000\n" } }, { "input": { "stdin": "120" }, "output": { "stdout": "37712000\n" } } ]

{ "tags": [], "title": "Debt Hell" }

{ "cpp": "#include <iostream>\n#include <cmath>\n\nusing namespace std;\n\nint main() {\n int n, m = 100;\n cin >> n;\n while (n--) {\n m = ceil(m * 1.05);\n }\n cout << m * 1000 << endl;\n\n return 0;\n}", "java": "import java.util.*;\n\npublic class Main{\n\tprivate static final Scanner scan = new Scanner(System.in);\n\n\tpublic static void main(String[] args){\n\t\tint n = scan.nextInt();\n\t\tlong mon = 100_000;\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tmon *= 1.05;\n\t\t\tif(mon % 1000 > 0){\n\t\t\t\tmon += 1000;\n\t\t\t\tmon -= mon % 1000;\n\t\t\t}\n\t\t}\n\t\tSystem.out.printf(\"%d\\n\", mon);\n\t}\n}", "python": "from math import ceil\nn = int(input())\n\na = 100\nfor i in range(n):\n a=ceil(1.05 * a)\nprint (a*1000)" }

[ { "input": { "stdin": "3\n>'======#======~\n>^Q=Q=Q=Q=Q=Q=Q=Q=Q=~~\n>'===#====~" }, "output": { "stdout": "A\nB\nNA" } }, { "input": { "stdin": "3\n&<==>==#><:~=?=<\n~~=Q=R=R<Q=P==QQ=]>Q=Q\n=>?#?'=?>}=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n>&==<==#=======\n~~=P=Q=Q=Q=Q=Q=Q=^>Q<Q\n>'=>>#==~>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n;=?<>==$>&:~=@>;\n~==Q=R=RQQ=P=~=Q=]>QQ<\n;\"='=???}>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n>&<=;==#=======\nQ<Q>^=Q=Q=Q=Q=Q=Q=P=~~\n>'=>>#=>}>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n>&======#======~\n~~=P=Q===Q=Q=Q=Q=^QQQ>\n>'===#==~>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n>&=====#=======\n~~=P=Q=Q=Q=Q=Q=Q=^>Q=Q\n>'===#==~>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n=======#><:=>&<\n~~=P=R=Q=Q=P==QQ=^>Q<Q\n=>}>=>?#?'=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n&=?<>==#=<:~=@><\nQQQ>]=Q===P=Q<R=R=Q=~~\n<\">?='>}?>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n<=?<>==$=&:~=@>;\n~~=Q=R=RQQ=P===Q=]>QQ<\n<\">'=???}>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n&<==>==#><:~=?=<\nQ=Q>]=QQ==P=Q<R=R=Q=~~\n=>?#?'=?>}=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n=======#==:=<&>\nQ<Q>^=Q=Q=Q=Q=Q=Q=P=~~\n>'>>>#==}>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n>(======#======~\n~~=Q=Q=Q=Q=Q=Q=Q=^=QQ>\n>'===#==~>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n=======#><:=>&<\nQ<Q>^=QQ==P=Q=Q=R=P=~~\n=>}>=>>#?'=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n>&==;==#=======\n~~=P=Q=Q=Q=Q=Q=Q=^>Q<Q\n>'=>>#==}>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n=======#=====&>\n~~=P=Q===Q=Q=Q=Q=^>QQQ\n>'===#==~>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n;=?<>==$>&:=~@>;\n~==P=R=RQQ=P=~=Q=]>QQ<\n=>}???=='\";" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n=======#><:=>&<\n~~=P=R=Q=Q=P==QQ=^>Q<Q\n=}>>=>?#?'=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n&=?<>==#=<:~=@><\nQQQ>]=Q===P=Q<R=R=Q=~~\n<\">'=?>?}>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n>&======#======~\n~~=P=Q===Q=Q=Q=Q=^QQQ>\n>'<==#==~>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n&<==>==#><:~=?=<\n~~=Q=R=R<Q=P==QQ=]>Q=Q\n=>?\"?'=?>}=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n;=?<>==$=&:~=@>;\n~~=Q=R=RQQ=P===Q=]>QQ<\n<\">'=???}>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n>'======#======~\n>^Q=Q=Q=Q=Q=Q=Q=Q=Q=~~\n>'===#===>~" }, "output": { "stdout": "A\nB\nNA\n" } }, { "input": { "stdin": "3\n>&======#======~\n~~=P=Q===Q=Q=Q=Q=^QQQ>\n=>~==#==<'>" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n>(======#======~\n~~=P=Q=Q=Q===Q=Q=^QQQ>\n>'===#==~>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n======#======&>\n~~=P=Q===Q=Q=Q=Q=^>QQQ\n=>~==#==='>" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n====>==#><:=>&<\n~~=P=R=Q=Q=P==QQ=^>Q<Q\n=}>>='?#?>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n<&>=~:<>#==>==<=\nQ<Q>]=QQ==P=Q=Q=R=P=~~\n=}>?='?#?>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n=<==>==#><:~=>&<\nQ<Q>]=QQ==P=Q=Q=R=P=~~\n=}>?='?#?>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n>&======#======\n~~=P=Q===Q=Q=Q=Q=^QQQ>\n=>~==#==<'>" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n=<==>==#><:~=>&<\nQ=Q>]=QQ==P=Q<Q=R=P=~~\n=>?#?'=?>}=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n=======#><:=>&<\n~~=P=R=Q=Q=P==QQ=^>Q<Q\n=>}>=>>#?'=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n>&==;==#=======\nQ<Q>^=Q=Q=Q=Q=Q=Q=P=~~\n>'=>}#=>>>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n=======#=====&>\n~~=P=Q=Q=Q=Q=Q=Q=^>Q=Q\n>'===#==~>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n;=?<>==$=&:~=@>;\n~==Q=R=RQQ=P=~=Q=]>QQ<\n;\"='=???}>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n&=?<>==#=<:~=@><\nQQQ>]=Q===P=Q<R=R=Q=~~\n<\">'=?>}?>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n====>==#><:~=>&<\nQ<Q>^=QQ==P=Q=Q=R=P=~~\n=}>>='?#?>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n======#======&>\n~~=P=Q===Q=Q=Q=Q=^>QQQ\n>'<==#==~>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n=======#==:=>&<\nQ<Q>^=QQ==Q=Q=Q=R=P=~~\n>'>#>>==}>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n;=?<>==$>&:=~@>;\n~==Q=R=RQQ=P=~=Q=]>QQ<\n=>}???=='\";" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n====>==#><:~=>&<\nQ<Q>]=QQ==P=Q=Q=R=P=~~\n=}>>='?#?>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n&<>=>==#><:~=?=<\n~~=Q=R=R<Q=P===Q=]>QQQ\n=>?\"?'=?>}=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n>'======#======~\n>QQ=^=Q=Q=Q=Q=Q=Q=Q=~~\n>'===#===>~" }, "output": { "stdout": "A\nNA\nNA\n" } }, { "input": { "stdin": "3\n>&==;==#=======\n~~=P=Q=Q=Q=Q=Q=Q=^>Q<Q\n>'=>}#=>>>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n=======#=<:=>&<\nQ<Q>^=QQ==Q=Q=Q=R=P=~~\n>'>#>>==}>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n======#======&>\n~~=P=Q===Q=Q=Q=Q=^QQQ>\n>'<==#==~>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n&<==>==#><:~=?=<\n~~=Q=R=R<Q=P===Q=]>QQQ\n=>?\"?'=?>}=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n=======#><:=>&<\n~~=P=R=Q=Q=P==QQ=^>Q<Q\n=}>>='?#?>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n&<><>==#><:~=@><\n~~=Q=R=R<Q=P===Q=]>QQQ\n<}>?='?\"?>=" }, "output": { "stdout": "NA\nNA\nNA\n" } }, { "input": { "stdin": "3\n====>==#><:~=>&<\nQ<Q>]=QQ==P=Q=Q=R=P=~~\n=}>?='?#?>=" }, "output": { "stdout": "NA\nNA\nNA\n" } } ]

{ "tags": [], "title": "Snakes" }

{ "cpp": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int T;\n cin >> T;\n while(T--) {\n string s;\n cin >> s;\n if(s[0]!='>'||s.size()<=3) cout << \"NA\" << endl;\n else if(s[1]=='\\'') {\n if(s[s.size()-1]!='~'||s.size()%2) {\n cout << \"NA\" << endl;\n goto next;\n }\n s=s.substr(2,s.size()-3);\n for(int i=0; i<s.size()/2; i++) {\n if(s[i]!='='||s[i+s.size()/2+1]!='=') {\n cout << \"NA\" << endl;\n goto next;\n }\n }\n if(s.size()<3||s[s.size()/2]!='#') cout << \"NA\" << endl;\n else cout << \"A\" << endl;\n } else {\n if(s[s.size()-2]!='~'||s[s.size()-1]!='~'||s.size()%2) {\n cout << \"NA\" << endl;\n goto next;\n }\n s=s.substr(2,s.size()-4);\n for(int i=0; i<s.size(); i+=2) {\n if(s[i]!='Q'||s[i+1]!='=') {\n cout << \"NA\" << endl;\n goto next;\n }\n }\n if(s.size()>=2) cout << \"B\" << endl;\n else cout << \"NA\" << endl;\n }\n next:;\n }\n return 0;\n}\n", "java": "import java.util.Scanner;\nimport java.util.regex.Matcher;\nimport java.util.regex.Pattern;\n\npublic class Main {\n\n\tpublic static final int BIG_NUM = 2000000000;\n\tpublic static final int MOD = 1000000007;\n\tpublic static final long HUGE_NUM = 99999999999999999L;\n\tpublic static final double EPS = 0.000000001;\n\n\t@SuppressWarnings(\"unchecked\")\n\tpublic static void main(String[] args) {\n\n\t\t//BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tScanner scanner = new Scanner(System.in);\n\n\t\tint N = scanner.nextInt();\n\t\tStringBuilder ans = new StringBuilder();\n\n\t\tfor(int loop = 0; loop < N; loop++){\n\n\t\t\tString input_str = scanner.next();\n\n\t\t\tif(input_str.matches(\"\\\\A>'(=+)#\\\\1~\\\\z\")){\n\n\t\t\t\tans.append(\"A\\n\");\n\n\t\t\t}else if(input_str.matches(\"\\\\A>\\\\^(Q=)+~~\\\\z\")){\n\n\t\t\t\tans.append(\"B\\n\");\n\n\t\t\t}else{\n\n\t\t\t\tans.append(\"NA\\n\");\n\t\t\t}\n\t\t}\n\t\tSystem.out.printf(ans.toString());\n\t}\n}\n\nclass UTIL{\n\n\t//最大公約数\n\tpublic static long gcd(long x,long y){\n\n\t\tx = Math.abs(x);\n\t\ty = Math.abs(y);\n\n\t\tif(x < y){\n\n\t\t\tlong tmp = y;\n\t\t\ty = x;\n\t\t\tx = tmp;\n\t\t}\n\n\t\tif(y == 0){\n\n\t\t\treturn x;\n\t\t}else{\n\n\t\t\treturn gcd(y,x%y);\n\t\t}\n\t}\n\n\t//最小公倍数\n\tpublic static long lcm(long x,long y){\n\n\t\treturn (x*y)/gcd(x,y);\n\t}\n\n\t//String→intへ変換\n public static int getNUM(String tmp_str){\n\n return Integer.parseInt(tmp_str);\n }\n\n //文字が半角数字か判定する関数\n public static boolean isNumber(String tmp_str){\n\n if(tmp_str == null || tmp_str.length() == 0){\n\n return false;\n }\n\n Pattern pattern = Pattern.compile(\"\\\\A[0-9]+\\\\z\");\n Matcher matcher = pattern.matcher(tmp_str);\n return matcher.matches();\n }\n}\n", "python": "# -*- coding: utf-8 -*-\n\nimport sys\nimport os\n\nN = int(input())\n\ndef is_A(s):\n if s[0:2] != \">'\":\n return False\n\n if s[-1] != '~':\n return False\n\n body = s[2:-1]\n\n if len(body) % 2 == 0:\n return False\n\n # body = '==#=='\n center_index = len(body) // 2\n if body[center_index] != '#':\n return False\n\n if body.count('#') != 1:\n return False\n\n lst = body.split('#')\n if len(lst) != 2:\n return False\n\n if len(lst[0]) > 0 and lst[0] == lst[1] and len(lst[0]) == lst[0].count('='):\n return True\n else:\n return False\n\ndef is_B(s):\n if s[0:2] != \">^\":\n return False\n\n if s[-2:] != '~~':\n return False\n\n body = s[2:-2]\n\n if len(body) % 2 != 0:\n return False\n elif body.count('Q=') > 0 and body.count('Q=') == len(body) // 2:\n return True\n else:\n return False\n\nfor s in sys.stdin:\n s = s.strip()\n\n if is_A(s):\n print('A')\n elif is_B(s):\n print('B')\n else:\n print('NA')" }

[ { "input": { "stdin": "3 10\n1 4\n4 1\n2 5" }, "output": { "stdout": "30000\n24000\n2000\n20000" } }, { "input": { "stdin": "3 10\n1 0\n4 2\n2 5" }, "output": { "stdout": "30000\n0\n4000\n20000\n" } }, { "input": { "stdin": "3 10\n1 4\n4 1\n1 5" }, "output": { "stdout": "30000\n24000\n2000\n30000\n" } }, { "input": { "stdin": "2 13\n1 4\n1 2\n1 5" }, "output": { "stdout": "52000\n24000\n12000\n30000\n" } }, { "input": { "stdin": "3 57\n1 3\n1 -2\n1 2" }, "output": { "stdout": "171000\n18000\n-12000\n12000\n" } }, { "input": { "stdin": "1 1\n3 1\n1 2\n2 1" }, "output": { "stdout": "6000\n3000\n12000\n4000\n" } }, { "input": { "stdin": "4 10\n1 0\n4 1\n1 5" }, "output": { "stdout": "20000\n0\n2000\n30000\n" } }, { "input": { "stdin": "4 10\n1 0\n4 1\n2 5" }, "output": { "stdout": "20000\n0\n2000\n20000\n" } }, { "input": { "stdin": "3 10\n1 1\n4 2\n2 5" }, "output": { "stdout": "30000\n6000\n4000\n20000\n" } }, { "input": { "stdin": "3 31\n1 4\n1 -2\n1 2" }, "output": { "stdout": "93000\n24000\n-12000\n12000\n" } }, { "input": { "stdin": "2 13\n1 6\n1 2\n1 3" }, "output": { "stdout": "52000\n36000\n12000\n18000\n" } }, { "input": { "stdin": "3 4\n2 4\n2 0\n2 5" }, "output": { "stdout": "12000\n16000\n0\n20000\n" } }, { "input": { "stdin": "2 13\n1 6\n1 2\n1 6" }, "output": { "stdout": "52000\n36000\n12000\n36000\n" } }, { "input": { "stdin": "3 1\n1 4\n2 1\n1 8" }, "output": { "stdout": "3000\n24000\n4000\n48000\n" } }, { "input": { "stdin": "2 0\n1 1\n3 1\n1 8" }, "output": { "stdout": "0\n6000\n3000\n48000\n" } }, { "input": { "stdin": "3 13\n1 0\n1 1\n1 5" }, "output": { "stdout": "39000\n0\n6000\n30000\n" } }, { "input": { "stdin": "2 0\n1 1\n3 1\n1 3" }, "output": { "stdout": "0\n6000\n3000\n18000\n" } }, { "input": { "stdin": "1 9\n2 2\n1 0\n1 7" }, "output": { "stdout": "54000\n8000\n0\n42000\n" } }, { "input": { "stdin": "4 10\n1 1\n4 1\n1 5" }, "output": { "stdout": "20000\n6000\n2000\n30000\n" } }, { "input": { "stdin": "3 2\n1 4\n2 1\n1 5" }, "output": { "stdout": "6000\n24000\n4000\n30000\n" } }, { "input": { "stdin": "4 17\n1 0\n4 1\n3 5" }, "output": { "stdout": "34000\n0\n2000\n15000\n" } }, { "input": { "stdin": "4 17\n1 0\n4 1\n2 5" }, "output": { "stdout": "34000\n0\n2000\n20000\n" } }, { "input": { "stdin": "4 10\n1 0\n4 4\n1 8" }, "output": { "stdout": "20000\n0\n8000\n48000\n" } }, { "input": { "stdin": "2 13\n1 4\n1 2\n2 8" }, "output": { "stdout": "52000\n24000\n12000\n32000\n" } }, { "input": { "stdin": "2 13\n1 4\n1 2\n1 2" }, "output": { "stdout": "52000\n24000\n12000\n12000\n" } }, { "input": { "stdin": "3 16\n2 4\n2 0\n2 5" }, "output": { "stdout": "48000\n16000\n0\n20000\n" } }, { "input": { "stdin": "3 5\n1 4\n2 1\n1 5" }, "output": { "stdout": "15000\n24000\n4000\n30000\n" } }, { "input": { "stdin": "3 13\n1 0\n1 0\n1 5" }, "output": { "stdout": "39000\n0\n0\n30000\n" } }, { "input": { "stdin": "3 2\n1 4\n2 1\n1 8" }, "output": { "stdout": "6000\n24000\n4000\n48000\n" } }, { "input": { "stdin": "2 13\n2 4\n1 2\n2 9" }, "output": { "stdout": "52000\n16000\n12000\n36000\n" } }, { "input": { "stdin": "2 13\n1 4\n1 2\n2 9" }, "output": { "stdout": "52000\n24000\n12000\n36000\n" } }, { "input": { "stdin": "3 7\n1 8\n1 0\n1 5" }, "output": { "stdout": "21000\n48000\n0\n30000\n" } }, { "input": { "stdin": "3 10\n1 4\n4 0\n2 5" }, "output": { "stdout": "30000\n24000\n0\n20000\n" } }, { "input": { "stdin": "3 16\n1 4\n1 1\n1 5" }, "output": { "stdout": "48000\n24000\n6000\n30000\n" } }, { "input": { "stdin": "1 13\n2 2\n1 1\n1 7" }, "output": { "stdout": "78000\n8000\n6000\n42000\n" } }, { "input": { "stdin": "3 20\n2 4\n2 1\n1 5" }, "output": { "stdout": "60000\n16000\n4000\n30000\n" } }, { "input": { "stdin": "1 9\n2 2\n1 1\n1 7" }, "output": { "stdout": "54000\n8000\n6000\n42000\n" } }, { "input": { "stdin": "1 10\n1 0\n4 4\n1 8" }, "output": { "stdout": "60000\n0\n8000\n48000\n" } }, { "input": { "stdin": "3 16\n1 4\n1 0\n1 5" }, "output": { "stdout": "48000\n24000\n0\n30000\n" } }, { "input": { "stdin": "3 13\n2 1\n1 1\n1 5" }, "output": { "stdout": "39000\n4000\n6000\n30000\n" } }, { "input": { "stdin": "2 13\n1 7\n2 2\n2 3" }, "output": { "stdout": "52000\n42000\n8000\n12000\n" } }, { "input": { "stdin": "1 10\n1 0\n4 1\n1 8" }, "output": { "stdout": "60000\n0\n2000\n48000\n" } }, { "input": { "stdin": "2 0\n1 1\n4 2\n2 3" }, "output": { "stdout": "0\n6000\n4000\n12000\n" } }, { "input": { "stdin": "2 1\n1 1\n3 1\n1 8" }, "output": { "stdout": "4000\n6000\n3000\n48000\n" } }, { "input": { "stdin": "3 20\n2 0\n2 1\n1 5" }, "output": { "stdout": "60000\n0\n4000\n30000\n" } }, { "input": { "stdin": "1 13\n1 4\n4 1\n1 5" }, "output": { "stdout": "78000\n24000\n2000\n30000\n" } }, { "input": { "stdin": "1 10\n1 0\n4 1\n1 0" }, "output": { "stdout": "60000\n0\n2000\n0\n" } }, { "input": { "stdin": "3 10\n2 4\n2 1\n1 5" }, "output": { "stdout": "30000\n16000\n4000\n30000\n" } }, { "input": { "stdin": "2 0\n1 1\n3 2\n1 3" }, "output": { "stdout": "0\n6000\n6000\n18000\n" } }, { "input": { "stdin": "3 26\n1 4\n1 2\n1 5" }, "output": { "stdout": "78000\n24000\n12000\n30000\n" } } ]

{ "tags": [], "title": "Ticket Sales" }

{ "cpp": "#include<iostream>\nusing namespace std ;\n\nint main(){\n\t\n\tint t , n ;\n\tint k[5] = { 0,6000,4000,3000,2000 } ;\n\t\n\tfor( int i=0 ; i<4 ; i++ ){\n\t\tcin >> t >> n ;\n\t\tcout << k[t] * n << endl ;\n\t}\n\t\nreturn 0; \n}", "java": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String args[]){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint i,t,m,k;\n\t\tfor(i=0; i<4; i++) {\n\t\t\tt = sc.nextInt();\n\t\t\tm = sc.nextInt();\n\t\t\tswitch(t) {\n\t\t\tcase 1:\n\t\t\t\tk = 6000 * m;\n\t\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\tk = 4000 * m;\n\t\t\t\tbreak;\n\t\t\tcase 3:\n\t\t\t\tk = 3000 * m;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tk = 2000 * m;\n\t\t\t}\n\t\t\tSystem.out.println(k);\n\t\t}\n\t}\n}", "python": "price = [0, 6000, 4000, 3000, 2000]\n\nfor i in range(4):\n p, n = map(int, input().split())\n print(price[p] * n)\n" }

[ { "input": { "stdin": "3 9 45\n3 100 50\n5 50 685\n0 0 0" }, "output": { "stdout": "1\n7\n74501" } }, { "input": { "stdin": "2 19 43\n4 001 69\n1 90 548\n0 -1 -1" }, "output": { "stdout": "142\n0\n0\n" } }, { "input": { "stdin": "3 3 45\n3 100 69\n0 50 308\n0 0 0" }, "output": { "stdout": "0\n1076\n" } }, { "input": { "stdin": "6 12 60\n3 110 195\n0 90 100\n0 0 1" }, "output": { "stdout": "0\n82951\n" } }, { "input": { "stdin": "3 12 45\n3 100 56\n5 66 331\n0 -1 1" }, "output": { "stdout": "1\n54\n11\n" } }, { "input": { "stdin": "3 12 65\n3 100 50\n5 50 308\n0 0 0" }, "output": { "stdout": "8\n7\n0\n" } }, { "input": { "stdin": "5 33 80\n1 001 69\n5 88 487\n0 1 1" }, "output": { "stdout": "0\n0\n8271\n" } }, { "input": { "stdin": "3 24 16\n3 100 129\n2 90 487\n0 1 0" }, "output": { "stdout": "0\n65947\n0\n" } }, { "input": { "stdin": "3 12 45\n3 100 21\n0 96 331\n0 0 1" }, "output": { "stdout": "1\n0\n" } }, { "input": { "stdin": "3 2 84\n3 100 76\n7 43 12\n0 -1 1" }, "output": { "stdout": "0\n3589\n0\n" } }, { "input": { "stdin": "3 27 100\n3 010 110\n2 90 487\n0 2 1" }, "output": { "stdout": "40530\n0\n0\n" } }, { "input": { "stdin": "1 6 16\n2 101 34\n0 172 331\n1 2 1" }, "output": { "stdout": "0\n169\n" } }, { "input": { "stdin": "3 9 23\n2 101 108\n2 87 308\n0 2 0" }, "output": { "stdout": "0\n7585\n411\n" } }, { "input": { "stdin": "1 19 45\n2 111 95\n0 12 654\n0 0 1" }, "output": { "stdout": "0\n5055\n" } }, { "input": { "stdin": "3 3 45\n3 100 85\n5 50 308\n0 0 0" }, "output": { "stdout": "0\n13338\n0\n" } }, { "input": { "stdin": "3 12 45\n4 100 69\n5 90 308\n0 0 0" }, "output": { "stdout": "1\n0\n0\n" } }, { "input": { "stdin": "3 12 45\n3 100 69\n5 50 308\n0 0 0" }, "output": { "stdout": "1\n1076\n0\n" } }, { "input": { "stdin": "3 27 80\n3 110 69\n2 90 487\n0 2 1" }, "output": { "stdout": "5820\n1076\n0\n" } }, { "input": { "stdin": "3 12 45\n1 101 21\n0 96 421\n0 0 1" }, "output": { "stdout": "1\n1\n" } }, { "input": { "stdin": "6 12 45\n3 101 82\n2 90 1067\n0 0 0" }, "output": { "stdout": "0\n8824\n0\n" } }, { "input": { "stdin": "3 12 60\n3 100 107\n5 90 308\n0 0 0" }, "output": { "stdout": "15\n61554\n0\n" } }, { "input": { "stdin": "3 9 45\n3 100 50\n5 71 685\n0 0 0" }, "output": { "stdout": "1\n7\n2444\n" } }, { "input": { "stdin": "6 12 60\n3 111 197\n0 8 100\n0 0 1" }, "output": { "stdout": "0\n46529\n" } }, { "input": { "stdin": "3 16 60\n5 100 60\n5 59 308\n0 4 -1" }, "output": { "stdout": "112\n0\n0\n" } }, { "input": { "stdin": "6 12 60\n3 110 126\n0 90 100\n0 0 1" }, "output": { "stdout": "0\n45105\n" } }, { "input": { "stdin": "3 12 16\n1 101 19\n0 96 421\n0 0 1" }, "output": { "stdout": "0\n1\n" } }, { "input": { "stdin": "5 12 45\n3 100 69\n5 90 548\n0 0 0" }, "output": { "stdout": "0\n1076\n3141\n" } }, { "input": { "stdin": "6 12 60\n5 100 69\n5 59 308\n0 1 -1" }, "output": { "stdout": "0\n0\n0\n" } }, { "input": { "stdin": "3 27 7\n3 111 184\n1 60 992\n0 0 0" }, "output": { "stdout": "0\n88699\n0\n" } }, { "input": { "stdin": "3 19 45\n3 111 95\n0 60 654\n0 0 0" }, "output": { "stdout": "1\n45812\n" } }, { "input": { "stdin": "3 12 83\n6 100 56\n5 96 331\n0 -1 1" }, "output": { "stdout": "0\n0\n11\n" } }, { "input": { "stdin": "3 12 60\n3 100 69\n5 90 308\n0 0 0" }, "output": { "stdout": "15\n1076\n0\n" } }, { "input": { "stdin": "3 12 45\n3 100 60\n5 50 538\n0 0 0" }, "output": { "stdout": "1\n157\n96557\n" } }, { "input": { "stdin": "3 12 32\n0 110 21\n0 96 331\n0 0 2" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "3 36 80\n3 000 69\n2 162 487\n0 1 1" }, "output": { "stdout": "6570\n0\n28431\n" } }, { "input": { "stdin": "2 22 19\n1 101 21\n0 96 331\n-1 0 1" }, "output": { "stdout": "18\n1\n" } }, { "input": { "stdin": "3 24 49\n3 100 69\n2 90 487\n0 1 0" }, "output": { "stdout": "5\n1076\n0\n" } }, { "input": { "stdin": "5 33 84\n1 001 69\n5 88 928\n0 1 1" }, "output": { "stdout": "0\n0\n63426\n" } }, { "input": { "stdin": "3 12 45\n3 100 60\n5 50 308\n0 0 0" }, "output": { "stdout": "1\n157\n0\n" } }, { "input": { "stdin": "3 12 45\n3 101 82\n2 90 548\n0 0 0" }, "output": { "stdout": "1\n8824\n0\n" } }, { "input": { "stdin": "3 9 45\n0 110 50\n5 50 308\n0 0 0" }, "output": { "stdout": "1\n" } }, { "input": { "stdin": "3 12 45\n3 100 32\n4 50 331\n0 0 1" }, "output": { "stdout": "1\n0\n41334\n" } }, { "input": { "stdin": "1 19 45\n3 111 95\n0 12 654\n0 0 0" }, "output": { "stdout": "0\n45812\n" } }, { "input": { "stdin": "3 19 28\n3 111 93\n1 60 548\n0 0 0" }, "output": { "stdout": "0\n36347\n0\n" } }, { "input": { "stdin": "3 12 45\n3 100 75\n5 50 308\n0 0 0" }, "output": { "stdout": "1\n3060\n0\n" } }, { "input": { "stdin": "1 19 45\n2 111 95\n1 12 654\n0 0 1" }, "output": { "stdout": "0\n5055\n0\n" } }, { "input": { "stdin": "3 2 65\n3 100 98\n5 50 67\n0 0 0" }, "output": { "stdout": "0\n64015\n0\n" } }, { "input": { "stdin": "5 9 45\n3 011 50\n5 71 685\n0 1 0" }, "output": { "stdout": "0\n3\n2444\n" } }, { "input": { "stdin": "2 22 19\n3 100 21\n0 96 331\n0 0 1" }, "output": { "stdout": "18\n0\n" } }, { "input": { "stdin": "3 12 45\n3 100 34\n5 50 331\n0 0 1" }, "output": { "stdout": "1\n0\n11\n" } } ]

{ "tags": [], "title": "Bingo" }

{ "cpp": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing pii = pair<int, int>;\nusing vi = vector<int>;\nusing ll = long long;\n\nconstexpr int mod = 100000;\n\nint main() {\n int N, M, S;\n while(cin >> N >> M >> S, N) {\n vector<vector<int>> dp(N * N + 1, vector<int>(S + 1));\n dp[0][0] = 1;\n for(int i = 1; i <= N * N; ++i) {\n for(int j = 0; j <= S; ++j) {\n if(i <= j) {\n dp[i][j] += dp[i][j - i] + dp[i - 1][j - i];\n }\n if(j - M - 1 >= 0) {\n dp[i][j] -= dp[i - 1][j - M - 1];\n }\n dp[i][j] = (dp[i][j] + mod) % mod;\n }\n }\n cout << dp[N * N][S] << endl;\n }\n}\n", "java": "import java.util.Scanner;\n\n//Bingo\npublic class Main{\n\n\tvoid run(){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint MOD = 100000;\n\t\tfor(;;){\n\t\t\tint N = sc.nextInt(), M = sc.nextInt(), S = sc.nextInt();\n\t\t\tif((N|M|S)==0)break;\n\t\t\tN*=N;\n\t\t\tint[][] dp = new int[N+1][S+1];\n\t\t\tdp[0][0] = 1;\n\t\t\tfor(int m=1;m<=M;m++)for(int k=N;k>0;k--)for(int s=m;s<=S;s++){\n\t\t\t\tdp[k][s]+=dp[k-1][s-m];\n\t\t\t\tif(MOD<=dp[k][s])dp[k][s]-=MOD;\n\t\t\t}\n\t\t\tSystem.out.println(dp[N][S]);\n\t\t}\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n}", "python": "# coding:utf-8\n\nimport sys\n\n\ninput = sys.stdin.readline\nMOD = 100000\n\n\ndef inpl(): return list(map(int, input().split()))\n\n\nwhile 1:\n N, M, S = inpl()\n if N == 0:\n break\n N *= N\n dp = [[0] * (S + 1) for _ in range(N + 1)]\n dp[0][0] = 1\n for i in range(1, N + 1):\n for j in range(S + 1):\n if i <= j:\n dp[i][j] += dp[i][j - i] + dp[i - 1][j - i]\n if j - 1 >= M:\n dp[i][j] -= dp[i - 1][j - 1 - M]\n dp[i][j] %= MOD\n\n # TLE!!!\n # for i in range(1, M + 1):\n # for j in range(1, N + 1)[::-1]: # j - 1の値が更新されるのを防ぐために降順\n # for k in range(i, S + 1): # 合計値は必ずi以上になる\n # dp[j][k] += dp[j - 1][k - i]\n # dp[j][k] %= MOD\n\n print(dp[N][S])\n\n" }

[ { "input": { "stdin": "3 2\n0 1 2\n1 2 1\n2 1\n0 1 100\n2 1\n0 1 0\n2 1\n0 1 -1\n0 0" }, "output": { "stdout": "1\n100\n0\n-1" } }, { "input": { "stdin": "3 2\n0 2 2\n1 2 1\n2 1\n0 1 100\n2 1\n0 0 0\n2 1\n0 1 -1\n0 0" }, "output": { "stdout": "1\n100\n0\n-1\n" } }, { "input": { "stdin": "3 2\n0 1 2\n1 2 1\n2 1\n0 1 100\n2 1\n0 1 0\n2 1\n0 1 -2\n0 0" }, "output": { "stdout": "1\n100\n0\n-2\n" } }, { "input": { "stdin": "3 2\n0 2 2\n0 2 1\n2 1\n0 1 101\n4 1\n0 1 -1\n2 1\n0 1 -1\n0 0" }, "output": { "stdout": "0\n101\n-1\n-1\n" } }, { "input": { "stdin": "3 2\n0 1 2\n1 2 1\n2 1\n0 1 101\n2 1\n0 0 0\n2 1\n0 1 -1\n0 0" }, "output": { "stdout": "1\n101\n0\n-1\n" } }, { "input": { "stdin": "3 2\n0 1 2\n0 2 1\n2 1\n0 1 100\n2 1\n0 1 0\n2 1\n0 1 -2\n0 0" }, "output": { "stdout": "1\n100\n0\n-2\n" } }, { "input": { "stdin": "3 2\n0 2 2\n0 2 1\n2 1\n0 1 100\n4 1\n0 1 -1\n2 1\n0 1 -1\n0 0" }, "output": { "stdout": "0\n100\n-1\n-1\n" } }, { "input": { "stdin": "3 2\n0 1 2\n1 2 2\n2 1\n0 1 101\n2 0\n0 0 0\n1 2\n0 1 -1\n0 1" }, "output": { "stdout": "2\n101\n0\n" } }, { "input": { "stdin": "12 2\n0 2 2\n0 2 2\n2 1\n0 1 100\n2 1\n0 1 -1\n2 1\n0 1 -1\n0 0" }, "output": { "stdout": "0\n100\n-1\n-1\n" } }, { "input": { "stdin": "3 2\n0 1 2\n1 2 2\n2 1\n0 1 101\n2 1\n0 0 0\n2 1\n0 1 -1\n0 0" }, "output": { "stdout": "2\n101\n0\n-1\n" } }, { "input": { "stdin": "3 2\n0 1 2\n1 2 2\n2 1\n0 1 111\n2 0\n0 0 0\n1 2\n0 1 -1\n0 0" }, "output": { "stdout": "2\n111\n0\n" } }, { "input": { "stdin": "6 2\n0 2 2\n0 2 2\n4 1\n0 1 100\n2 1\n0 1 -1\n2 1\n0 1 -2\n0 0" }, "output": { "stdout": "0\n0\n-1\n-2\n" } }, { "input": { "stdin": "3 2\n0 2 2\n0 2 2\n2 1\n0 1 100\n2 1\n0 1 0\n2 1\n0 1 -1\n0 0" }, "output": { "stdout": "0\n100\n0\n-1\n" } }, { "input": { "stdin": "4 2\n0 2 2\n1 2 1\n2 1\n0 1 100\n2 1\n0 1 1\n2 1\n0 1 -1\n0 0" }, "output": { "stdout": "0\n100\n1\n-1\n" } }, { "input": { "stdin": "3 2\n0 1 2\n1 2 1\n3 1\n0 1 101\n2 0\n0 0 0\n1 0\n0 1 -1\n0 0" }, "output": { "stdout": "1\n0\n0\n" } }, { "input": { "stdin": "12 2\n0 2 2\n0 2 1\n2 1\n0 1 100\n2 1\n0 1 -1\n2 1\n0 1 0\n0 0" }, "output": { "stdout": "0\n100\n-1\n0\n" } }, { "input": { "stdin": "3 2\n0 1 2\n1 2 1\n2 1\n0 1 100\n2 1\n0 0 0\n2 1\n0 1 -1\n0 0" }, "output": { "stdout": "1\n100\n0\n-1\n" } }, { "input": { "stdin": "3 2\n0 1 2\n2 0 2\n2 1\n0 1 001\n2 1\n0 1 -1\n4 1\n0 1 -1\n0 0" }, "output": { "stdout": "2\n1\n-1\n-1\n" } }, { "input": { "stdin": "3 2\n0 1 2\n1 2 1\n2 1\n0 1 101\n2 0\n0 0 0\n1 2\n0 1 -1\n0 0" }, "output": { "stdout": "1\n101\n0\n" } }, { "input": { "stdin": "3 2\n0 1 2\n1 2 1\n2 1\n0 1 100\n2 0\n0 0 0\n2 1\n0 1 -1\n0 -1" }, "output": { "stdout": "1\n100\n0\n" } }, { "input": { "stdin": "3 2\n0 1 0\n1 1 1\n2 1\n1 0 100\n2 1\n1 1 0\n2 1\n1 1 1\n0 0" }, "output": { "stdout": "0\n100\n0\n0\n" } }, { "input": { "stdin": "3 2\n0 2 2\n0 2 1\n2 1\n0 1 000\n4 1\n1 1 0\n2 1\n0 1 -1\n0 0" }, "output": { "stdout": "0\n0\n0\n-1\n" } }, { "input": { "stdin": "3 2\n0 1 2\n1 2 2\n2 1\n0 1 100\n2 1\n0 1 0\n2 1\n0 1 -1\n0 0" }, "output": { "stdout": "2\n100\n0\n-1\n" } }, { "input": { "stdin": "6 2\n0 2 3\n0 2 2\n2 1\n0 1 100\n2 1\n0 1 -1\n2 1\n0 1 -1\n0 0" }, "output": { "stdout": "0\n100\n-1\n-1\n" } }, { "input": { "stdin": "3 2\n0 1 2\n1 1 1\n2 1\n0 1 100\n2 1\n0 1 0\n2 1\n0 1 -1\n0 0" }, "output": { "stdout": "0\n100\n0\n-1\n" } }, { "input": { "stdin": "3 2\n0 2 3\n0 0 2\n2 1\n0 1 100\n2 1\n0 1 -1\n2 1\n0 1 -1\n0 0" }, "output": { "stdout": "0\n100\n-1\n-1\n" } }, { "input": { "stdin": "3 2\n0 2 2\n0 2 2\n2 1\n0 1 100\n2 1\n0 1 -1\n2 1\n0 1 -1\n0 0" }, "output": { "stdout": "0\n100\n-1\n-1\n" } }, { "input": { "stdin": "6 2\n0 2 3\n0 4 2\n2 1\n0 1 100\n2 1\n0 1 -1\n2 1\n0 1 -1\n0 0" }, "output": { "stdout": "0\n100\n-1\n-1\n" } }, { "input": { "stdin": "3 2\n0 2 2\n0 2 1\n2 1\n0 1 100\n2 1\n0 0 0\n2 1\n0 1 -1\n0 0" }, "output": { "stdout": "0\n100\n0\n-1\n" } }, { "input": { "stdin": "3 2\n0 1 2\n1 2 1\n2 1\n0 1 001\n2 0\n0 0 0\n2 1\n0 1 -1\n0 0" }, "output": { "stdout": "1\n1\n0\n" } }, { "input": { "stdin": "3 2\n0 1 2\n1 2 1\n4 2\n0 1 101\n2 0\n0 0 0\n1 1\n0 0 -1\n0 0" }, "output": { "stdout": "1\n0\n" } }, { "input": { "stdin": "3 2\n0 2 3\n0 2 2\n2 1\n0 1 100\n2 1\n0 1 -1\n2 1\n0 1 -1\n0 0" }, "output": { "stdout": "0\n100\n-1\n-1\n" } }, { "input": { "stdin": "4 2\n0 2 2\n0 2 1\n2 1\n0 1 100\n2 1\n0 1 0\n2 1\n0 1 -1\n0 0" }, "output": { "stdout": "0\n100\n0\n-1\n" } }, { "input": { "stdin": "3 2\n0 2 2\n0 2 2\n2 1\n0 1 100\n2 1\n0 1 -2\n2 1\n0 1 -1\n0 0" }, "output": { "stdout": "0\n100\n-2\n-1\n" } }, { "input": { "stdin": "3 2\n0 1 2\n1 0 1\n2 1\n0 1 100\n2 1\n0 1 0\n2 1\n0 1 -2\n0 0" }, "output": { "stdout": "0\n100\n0\n-2\n" } }, { "input": { "stdin": "3 2\n0 1 2\n1 0 2\n3 1\n0 1 001\n2 1\n0 1 -1\n4 1\n0 1 0\n0 0" }, "output": { "stdout": "0\n0\n-1\n0\n" } }, { "input": { "stdin": "3 2\n0 2 2\n1 2 1\n2 1\n0 1 010\n4 1\n1 1 0\n2 1\n0 1 -1\n0 0" }, "output": { "stdout": "1\n10\n0\n-1\n" } }, { "input": { "stdin": "3 2\n0 1 2\n1 2 2\n2 1\n0 1 100\n2 1\n0 1 0\n2 1\n0 1 0\n0 0" }, "output": { "stdout": "2\n100\n0\n0\n" } }, { "input": { "stdin": "3 2\n0 1 2\n1 2 1\n2 1\n0 1 101\n2 0\n0 0 0\n3 1\n0 1 -1\n0 0" }, "output": { "stdout": "1\n101\n0\n" } }, { "input": { "stdin": "3 2\n0 2 2\n0 2 0\n2 1\n0 1 100\n4 1\n0 1 -1\n2 1\n0 1 -2\n0 0" }, "output": { "stdout": "0\n100\n-1\n-2\n" } }, { "input": { "stdin": "3 2\n0 1 2\n1 2 1\n2 1\n1 1 101\n2 0\n0 0 0\n3 1\n0 1 -1\n0 0" }, "output": { "stdout": "1\n0\n0\n" } }, { "input": { "stdin": "3 2\n0 1 2\n1 0 1\n2 1\n1 1 101\n0 0\n0 0 0\n1 2\n-1 1 -1\n0 0" }, "output": { "stdout": "0\n0\n" } }, { "input": { "stdin": "6 2\n0 2 1\n0 2 2\n2 1\n0 1 101\n2 1\n0 1 -1\n2 1\n0 1 -2\n0 0" }, "output": { "stdout": "0\n101\n-1\n-2\n" } }, { "input": { "stdin": "3 2\n0 1 2\n1 2 1\n3 1\n0 1 101\n2 0\n0 0 0\n1 0\n0 0 -1\n0 0" }, "output": { "stdout": "1\n0\n0\n" } }, { "input": { "stdin": "3 2\n0 1 4\n1 2 1\n2 1\n1 1 100\n2 1\n0 0 0\n2 1\n0 1 -1\n0 0" }, "output": { "stdout": "1\n0\n0\n-1\n" } }, { "input": { "stdin": "3 2\n0 1 2\n1 1 1\n2 1\n1 1 100\n2 1\n0 1 0\n2 1\n0 1 0\n0 0" }, "output": { "stdout": "0\n0\n0\n0\n" } }, { "input": { "stdin": "3 2\n0 1 2\n1 0 2\n2 1\n0 1 001\n2 1\n0 1 0\n4 1\n0 1 -1\n0 0" }, "output": { "stdout": "0\n1\n0\n-1\n" } }, { "input": { "stdin": "3 2\n0 1 0\n1 2 1\n2 1\n0 1 101\n0 0\n0 0 0\n3 1\n0 1 -1\n0 0" }, "output": { "stdout": "0\n101\n" } }, { "input": { "stdin": "3 2\n0 1 2\n1 1 1\n2 1\n1 1 100\n2 1\n0 1 0\n2 1\n0 1 1\n0 0" }, "output": { "stdout": "0\n0\n0\n1\n" } }, { "input": { "stdin": "3 2\n0 2 2\n0 2 1\n2 1\n0 1 100\n2 1\n0 1 0\n2 1\n0 1 -1\n0 0" }, "output": { "stdout": "0\n100\n0\n-1\n" } } ]

{ "tags": [], "title": "The House of Huge Family" }

{ "cpp": "#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cstring>\n#include <cctype>\n#include <algorithm>\n#include <string>\n#include <complex>\n#include <list>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <set>\n#include <map>\n#include <sstream>\n#include <numeric>\n#include <functional>\n#include <bitset>\n#include <iomanip>\n \nusing namespace std;\n \n \n#define INF (1<<29)\n \n// math\n#define Sq(x) ((x)*(x))\n \n// container utility\n#define ALL(x) (x).begin(), (x).end()\n#define MP make_pair\n#define PB push_back\n#define EACH(it,c) for(__typeof((c).begin())it=(c).begin();it!=(c).end();it++)\n \n// rep\n#define REP(i,a,b) for(int i=a;i<b;i++)\n#define rep(i,n) REP(i,0,n)\n \n// debug\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n#define debug(x) cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n \n// typedef\ntypedef pair<int, int> PII;\ntypedef vector<int> VI;\ntypedef vector<PII> VII;\ntypedef vector<VI> VVI;\n \ntypedef long long ll;\n \n// conversion\ntemplate<class T> inline string toStr(T a) { ostringstream oss; oss << a; return oss.str(); }\ninline int toInt(string s) { return atoi(s.c_str()); }\n \n// prime\nbool isPrime(int a) { for(int i=2; i*i <=a; i++) if(a%i == 0) return false; return true; }\n \n// !!! set MAX_L number !!!\n#define MAX_L (1000001)\n#define MAX_SQRT_B ((int)sqrt(INT_MAX)+1)\n \nbool is_prime[MAX_L];\nvector<bool> is_prime_small(MAX_SQRT_B);\n \nvoid segment_sieve(ll a, ll b) {\n \n for(int i=0; (ll)i*i < b; i++) is_prime_small[i] = true;\n for(int i=0; i < b-a; i++) is_prime[i] = true;\n \n if(a == 1) {\n is_prime[0] = false;\n }\n \n is_prime_small[0] = is_prime_small[1] = false;\n \n for(int i=2; (ll)i*i<b; i++) {\n if(is_prime_small[i]) {\n for(int j=2*i; (ll)j*j<b; j+=i) is_prime_small[j] = false;\n for(ll j = max(2LL, (a+i-1)/i)*i; j<b; j+=i) is_prime[j-a] = false;\n }\n }\n}\n \n//////////////////////////////////////////////////////////////\n \n \nstruct Edge {\n int to, cost, id;\n Edge(int t, int c, int i)\n : to(t), cost(c), id(i) {}\n};\n \n#define MAX_E (100)\n \nvector<Edge> es[MAX_E];\nint N, M;\n \nbool isConnected(int x) {\n \n vector<bool> used(N);\n vector<int> VEC;\n VEC.PB(0); used[0] = 1;\n \n int v = 0;\n while(!VEC.empty()) {\n vector<int> NEXT;\n \n EACH(i, VEC) {\n EACH(e, es[*i]) {\n if(e->id != x && !used[e->to]) {\n used[e->to] = 1;\n NEXT.PB(e->to);\n }\n }\n v ++;\n }\n VEC = NEXT;\n }\n return N == v;\n}\n \nint main() {\n \n while( cin >> N >> M && (N|M) ) {\n for(int i=0; i<MAX_E; i++) {\n es[i].clear();\n }\n \n int base = 0;\n int id = 0;\n \n vector<int> cost;\n \n for(int i=0; i<M; i++) {\n int s, t, c;\n cin >> s >> t >> c;\n \n if(c <= 0) base += c;\n else {\n es[s].PB(Edge(t, c, id));\n es[t].PB(Edge(s, c, id));\n cost.PB(c);\n id ++;\n }\n }\n \n int E = id;\n int ans = INF;\n \n if(!isConnected(-1)) ans = 0;\n \n for(int i=0; i<E; i++) {\n if(!isConnected(i)) ans = min(ans, cost[i]);\n }\n \n for(int i=0; i<E-1; i++)\n for(int j=i+1; j<E; j++)\n ans = min(ans, cost[i]+cost[j]);\n \n cout << base + ans << endl;\n }\n \n return 0;\n}", "java": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tstatic Scanner sc = new Scanner(System.in);\n\tstatic int N, M, E;\n\tstatic int[] from;\n\tstatic long[] cost;\n\n\tstatic boolean disjoint() {\n\t\tUnionFind uf = new UnionFind(N);\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tif (from[i] != -1) uf.union(i, from[i]);\n\t\t}\n\t\treturn uf.size(0) != N;\n\t}\n\n\tstatic long solve() {\n\t\tif (E <= N - 2) return 0;\n\t\tif (disjoint()) return 0;\n\t\tlong ret = Long.MAX_VALUE;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tif (from[i] == -1) continue;\n\t\t\tfor (int j = i + 1; j < N; ++j) {\n\t\t\t\tif (from[j] == -1) continue;\n\t\t\t\tret = Math.min(ret, cost[i] + cost[j]);\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tif (from[i] == -1) continue;\n\t\t\tint tmp = from[i];\n\t\t\tfrom[i] = -1;\n\t\t\tif (disjoint()) ret = Math.min(ret, cost[i]);\n\t\t\tfrom[i] = tmp;\n\t\t}\n\t\treturn ret;\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\t\twhile (true) {\n\t\t\tN = sc.nextInt();\n\t\t\tM = sc.nextInt();\n\t\t\tif (N == 0) break;\n\t\t\tfrom = new int[N];\n\t\t\tcost = new long[N];\n\t\t\tArrays.fill(from, -1);\n\t\t\tlong minus = 0;\n\t\t\tE = 0;\n\t\t\tfor (int i = 0; i < M; ++i) {\n\t\t\t\tint X = sc.nextInt();\n\t\t\t\tint Y = sc.nextInt();\n\t\t\t\tlong C = sc.nextLong();\n\t\t\t\tif (C <= 0) {\n\t\t\t\t\tminus += C;\n\t\t\t\t} else {\n\t\t\t\t\tfrom[Y] = X;\n\t\t\t\t\tcost[Y] = C;\n\t\t\t\t\t++E;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(solve() + minus);\n\t\t}\n\t}\n\n\tstatic class UnionFind {\n\t\tint[] set;\n\n\t\tUnionFind(int n) {\n\t\t\tset = new int[n];\n\t\t\tArrays.fill(set, -1);\n\t\t}\n\n\t\tvoid union(int a, int b) {\n\t\t\tint rtA = root(a);\n\t\t\tint rtb = root(b);\n\t\t\tif (rtA == rtb) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tset[rtA] += set[rtb];\n\t\t\tset[rtb] = rtA;\n\t\t}\n\n\t\tboolean find(int a, int b) {\n\t\t\treturn root(a) == root(b);\n\t\t}\n\n\t\tint root(int a) {\n\t\t\tif (set[a] < 0) {\n\t\t\t\treturn a;\n\t\t\t} else {\n\t\t\t\tset[a] = root(set[a]);\n\t\t\t\treturn set[a];\n\t\t\t}\n\t\t}\n\n\t\tint size(int a) {\n\t\t\treturn -set[root(a)];\n\t\t}\n\t}\n\n}", "python": "# AOJ 1065 The House of Huge Family\n# Python3 2018.7.10 bal4u\n\n# UNION-FIND library\nclass UnionSet:\n\tdef __init__(self, nmax):\n\t\tself.size = [1]*nmax\n\t\tself.id = [i for i in range(nmax+1)]\n\tdef root(self, i):\n\t\twhile i != self.id[i]:\n\t\t\tself.id[i] = self.id[self.id[i]]\n\t\t\ti = self.id[i]\n\t\treturn i\n\tdef connected(self, p, q): return self.root(p) == self.root(q)\n\tdef unite(self, p, q):\n\t\ti, j = self.root(p), self.root(q)\n\t\tif i == j: return\n\t\tif self.size[i] < self.size[j]:\n\t\t\tself.id[i] = j\n\t\t\tself.size[j] += self.size[i]\n\t\telse:\n\t\t\tself.id[j] = i\n\t\t\tself.size[i] += self.size[j]\n# UNION-FIND library\n\nwhile True:\n\tn, m = map(int, input().split())\n\tif n == 0: break\n\tu = UnionSet(n)\n\tans, tbl = 0, []\n\tfor i in range(m):\n\t\tx, y, c = map(int, input().split())\n\t\tif c < 0: ans += c\n\t\telse: tbl.append((c, x, y))\n\ttbl.sort(reverse=True)\n\tfor c, x, y in tbl:\n\t\tif not u.connected(x, y):\n\t\t\tif n > 2:\n\t\t\t\tn -= 1\n\t\t\t\tu.unite(x, y)\n\t\t\telse: ans += c\n\tprint(ans)\n\n" }

[ { "input": { "stdin": "Thefirstexampleistrivial.\n\nmfv\n\nAhugeamountofinformationisbeingheapedonWWW.Albeititisnot\nwell-organized,userscanbrowseWWWasanunboundedsourceof\nup-to-dateinformation,insteadofconsultingestablishedbutalittle\nout-of-dateencyclopedia.However,youcanfurtherexploitWWWby\nlearningmoreaboutkeywordsearchalgorithms.Forexample,ifyou\nwanttogetinformationonrecentcomparisonbetweenWindowsandUNIX,\nyoumayexpecttogetrelevantdescriptionoutofabigbunchofWeb\ntexts,byextractingtextsthatcontainbothkeywords\"Windows\"and\"UNIX\"\nclosetogether.\n\nbWn\n\n3.1415926535897932384626433832795028841971693993751058209749445923078164\n\npi\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\nWeary\n\nASCIIcharacterssuchas+,*,[,#," }, "output": { "stdout": "1\n\nfirstexampleistriv\n\n7\n\nnWWW.Alb\n\n0\n\n1\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\n1\n\nCIIcharacterssuchas+,*,[,#," } }, { "input": { "stdin": "Thefirstexampleistrivial.\n\nmfv\n\nAhugeamountofinformationisbeingheapedonWWW.Albeititisnot\nwell-organized,userscanbrowseWWWasanunboundedsourceof\nup-to-dateinformation,insteadofconsultingestablishedbutalittle\nout-of-dateencyclopedia.However,youcanfurtherexploitWWWby\nlearningmoreaboutkeywordsearchalgorithms.Forexample,ifyou\nwanttogetinformationonrecentcomparisonbetweenWindowsandUNIX,\nyoumayexpecttogetrelevantdescriptionoutofabigbunchofWeb\ntexts,byextractingtextsthatcontainbothkeywords\"Windows\"and\"UNIX\"\nclosetogether.\n\nbWn\n\n3.1415926535897932384626433832795028841971693993751058209749445923078164\n\npi\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\nWeary\n\nASCIIcharacterssuchas+,*,[,#,<,},_arenotexcludedinagivenstringas\nthisexampleillustratesbyitself.Youshouldnotforgetthem.Onemorefact\nyoushouldnoticeisthatuppercaselettersandlowercaselettersare\ndistinguishedinthisproblem.Don'tidentify\"g\"and\"G\",forexmaple.\nHowever,weareafraidthatthisexamplegivesyoutoomuchhint!\n\n![GsC_l\n\nETAONRISHDLFCMUGYPWBVKXJQZ\n\nABCDEFGHIJKLMNOPQRSTUVWXYZ" }, "output": { "stdout": "1\n\nfirstexampleistriv\n\n7\n\nnWWW.Alb\n\n0\n\n1\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\n1\n\nCIIcharacterssuchas+,*,[,#,<,},_arenotexcludedinagivenstringasthisexampl\neillustratesbyitself.Youshouldnotforgetthem.Onemorefactyoushouldnoticeis\nthatuppercaselettersandlowercaselettersaredistinguishedinthisproblem.Don\n'tidentify\"g\"and\"G\",forexmaple.However,weareafraidthatthisexamplegivesyo\nutoomuchhint!\n\n1\n\nETAONRISHDLFCMUGYPWBVKXJQZ" } }, { "input": { "stdin": "Thefirtuexampifistrlvial.\n\nfvl\n\nAhugeamountofinformationisbeingheapedonWWW.Albeititisnot\ngoecruosdednuobnun`saWWWescorbnawsresu,dezinagro-llew\nup-to-dateinformation,insteadofconsultingestablishedbutalittle\nybWWWwiolpxerehtrufnaduoy,revetnH.aidepolcycneetad-fo-tuo\nlearninfmoreabsutkeywordsearchalgorithmo.Forexample,ifyou\nwanttogftinformationtnrecenocomparisonbetweenWindowsandUNIX,\nbeWfohcnubgibafotuonoitpirctedtnavelertegottcepxeyamuoy\n\"XINUcdna\"swodniW\"sdrowyekhtobniatno\"tahtstxetgnitcarsxeyb,ttxet\nblosetogether.\n\ncWn\n\n4.746146111647564\n\nph\n\nWagner,Bsch,Beethoven,Chopin,Brahma,Hindemith,Ivfs,Suk,Mozart,Stravinsky\n\nreaWy\n\n[SCIIcharacterssuchas+,*,B,#," }, "output": { "stdout": "1\n\nfistrlv\n\n1\n\nWfohcn\n\n0\n\n1\n\nWagner,Bsch,Beethoven,Chopin,Brahma,Hindemith,Ivfs,Suk,Mozart,Stravinsky\n\n0\n\n" } }, { "input": { "stdin": "Thefiruuexbnpieislrtvjbl.\n\nlvh\n\nAhugeamountofioformationisbeinahfgpeeonVWWeAlb.ititisnot\nwelo-organized,usdrswaobrocseWWWas`nunboundedspurcelg\nus,to-cateinformation-insteadpfcnnsultingeptablishedbusalittme\nybWWWwinlpxdreitsufnaduoytrevetnH.aidepolcycneetad-fo--uo\nvoyfi,elqmaxcroF.omhtiroglahcraesdsowyeltusbaeromfoimrafl\n,XINUdnaswodniWneewtebnosirapmoconecernunoitamrognitfgottnaw\nyocityexpeuatogetrelevantdetcrmptionoutofabigbunchpfWea\ntextt,byexsractingtextsthatwontahnbotikey\"ords\"Windows\"andcUOIX\"\nclosetoretgeg-\n\nWen\n\n7.483690964083565\n\nhq\n\nyksnihartS,trazoM,kuS,sfvI,htimednie,amibrB,nipovChnevo,teeB,hcsB,rHngaW\n\nXx_fr\n\n[SCIIdh`sactersstchas+,*,A,#," }, "output": { "stdout": "1\n\nhefiruuexbnpieislrtv\n\n1\n\nWne\n\n0\n\n0\n\n0\n\n" } }, { "input": { "stdin": "Thefirtuexampifistrlvial.\n\nlvf\n\ntonsititieblA.WWWnodepaehgniebsinoitamrofnifotnuomaeguhA\ngoecruosdednuobnun`saWWWescorbnawsresu,dezinagro-llew\nelttilatubdehsilbatsegnitlusnocfodaetsni,noitamrofnietad-ot-pu\nybWWWwiolpxereitrufnaduoy,revetnH.aidepolcycneetad-fo-tuo\nuoyfi,elpmaxeroF.omhtiroglahcraesdrowyektusbaeromfninrael\nwanttogftinformationtnrecenocomparisonbetweenWindowsandUNIX,\nbeWfohcnubgibafotuonoitpirctedtnavelertegotacepxeytmuoy\n\"XIOUcdna\"swodniW\"sdrowyekhtobniatno\"tahtstxetgnitcarsxeyb,ttxet\nblosetogetreh.\n\ndWo\n\n4.746146111647564\n\nph\n\nWagner,Bsch,Beet,ovenhChopin,Braima,Hindemith,Ivfs,Suk,Mozart,Stravinsky\n\nreaWy\n\n[SCIIcharacterssuchas+,*,B,#," }, "output": { "stdout": "1\n\nfistrlv\n\n1\n\nWnod\n\n0\n\n1\n\nWagner,Bsch,Beet,ovenhChopin,Braima,Hindemith,Ivfs,Suk,Mozart,Stravinsky\n\n0\n\n" } }, { "input": { "stdin": ".lbjtirxsnfipibleuuurfehT\n\n{ik\n\nfolsiueti.aotoWWVaajepffhahiectinoetnmtleongotnhimoeAuuA\nwflo-organizfd,usdrsfana`opseWWWassnununtnewcscbrldch\nutt-oncaueinioruftion-instfahpfcn-stlsinfdpsabkisdedbmsalautme\npbVWswiwlpxcqejtWufnaduHytrdndtno.bideycloycmedtad-fn--uo\nvoyfkroeqmcxa,oF.elgtiroglarciansdsewyeltvrbaeqpmmoilrafm\n-XINUbncawgdogtneexWepnosirapsdconeaesnunoittmrognjmogotun_w\nyadityuwpeuategetrelmhontdedccrpraenouthfacohvuncnpeWoi\ntewYn,oyexsr_ctitgtdxtnuhatwantahnbsuikex\"nrds\"Whndows\"andcUPIt\"\n-gflsippuesmhe\n\nYjd\n\n24.34217234275631\n\nkr\n\nXagmHr,Bscg,Btet,ovenhDvopin,Bryhma-ednienhshkIvfs,Ru-,Mozase,Rtrahimrkb\n\n^Vgty\n\n-#,A,r++sahctsr*e[cas_IdhICRt" }, "output": { "stdout": "0\n\n1\n\njmogotun_wyadityuwpeuategetrelmhontdedccrpraenouthfacohvuncnpeWoitewY\n\n0\n\n0\n\n0\n\n" } }, { "input": { "stdin": "Thefirttexampleistrivial.\n\nlfv\n\nAhugeamountofinformationisbeingheapedonWWW.Albeititisnot\nwell-organized,userswanbrocseWWWas`nunboundedsourceof\nup-to-dateinformation,insteadofconsultingestablishedbutalittle\nout-of-dateencyclopedia.Hnwever,youdanfurtherexploitWWWby\nlearninfmoreaboutkeywordsearchalgorithms.Forexample,ifyou\nwanttogetinformationonrecentcomparisonbetweenWindowsandUNIX,\nbeWfohcnubgibafotuonoitpirctedtnavelertegottcepxeyamuoy\n\"XINUcdna\"swodniW\"sdrowyekhtobniatno\"tahtstxetgnitcarsxeyb,ttxet\nclosetogether.\n\nbWn\n\n4.746146111647564\n\nhp\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\nyraeW\n\nBSCIIcharacterssuchas+,*,[,#," }, "output": { "stdout": "1\n\nfirttexampleistriv\n\n7\n\nnWWW.Alb\n\n0\n\n1\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\n0\n\n" } }, { "input": { "stdin": "Thefirttexampleistrivial.\n\nlfv\n\nAhugeamountofinformationisbeingheapedonWWW.Albeititisnot\nwell-organized,userswanbrocseWWWas`nunboundedsourceof\nup-to-dateinformation,insteadofconsultingestablishedbutalittle\nout-of-dateencyclopedia.Hnwever,youdanfurtherexploitWWWby\nlearningmoreaboutkeywordsearchalgorithms.Forexample,ifyou\nwanttogetinformationonrecentcomparisonbetweenWindowsandUNIX,\nyoumayexpecttogetrelevantdescriptionoutofabigbunchofWeb\n\"XINUcdna\"swodniW\"sdrowyekhtobniatno\"tahtstxetgnitcarsxeyb,ttxet\nclosetogether.\n\nbWn\n\n4.746146111647564\n\nhp\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\nWeary\n\nBSCIIcharacterssuchas+,*,[,#," }, "output": { "stdout": "1\n\nfirttexampleistriv\n\n7\n\nnWWW.Alb\n\n0\n\n1\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\n0\n\n" } }, { "input": { "stdin": "Thefirttexampleistrivial.\n\nlfv\n\nAhugeamountofinformationisbeingheapedonWWW.Albeititisnot\nwell-organized,userswanbrocseWWWas`nunboundedsourceof\nup-to-dateinformation,insteadofconsultingestablishedbutalittle\nout-of-dateencyclopedia.Hnwever,youdanfurtherexploitWWWby\nlearninfmoreaboutkeywordsearchalgorithms.Forexample,ifyou\nwanttogetinformationonrecentcomparisonbetweenWindowsandUNIX,\nyoumayexpecttogetrelevantdescriptionoutofabigbunchofWeb\n\"XINUcdna\"swodniW\"sdrowyekhtobniatno\"tahtstxetgnitcarsxeyb,ttxet\nclosetogether.\n\nbWn\n\n4.746146111647564\n\nhp\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\nWeary\n\nBSCIIcharacterssuchas+,*,[,#," }, "output": { "stdout": "1\n\nfirttexampleistriv\n\n7\n\nnWWW.Alb\n\n0\n\n1\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\n0\n\n" } }, { "input": { "stdin": "Thefiruuexbnpieislrtvjbl.\n\nlwh\n\nAhugeamountofioformationisbeinahfgpeeonVWWeAlb.ititisnot\nwelo-organized,usdrswaobrocseWWWas`nunboundedspurcelg\nus,to-cateinformation-insteadpfcnnsultingeptablishedbusalittme\nybWWWwinlpxdreitsufnaduoytrevetnH.aidepolcycneetad-fo--uo\nvoyfi,elqmaxcroF.omhtiroglahcraesdsowyeltusbaeromfoimrafl\n,XINUdnaawodniWneewtebnosirapmoconecernunoitsmrognitfgottnaw\nyocityexpeuatogetrelevantdetcrmptionoutofabigbunchpfWea\ntextn,byexsractitgtextsthatwontahnbotikey\"ords\"Windows\"andcUOIX\"\nclosetoretgeg-\n\nWen\n\n7.483690964083565\n\nhq\n\nyksnihartS,trazoM,kuS,sfvI,htimednie,amibrB,nipovChnevo,teeB,hcsB,rHngaW\n\nXx_fr\n\n[SCIIdh`sactersstchas+,*,A,#," }, "output": { "stdout": "0\n\n1\n\nWne\n\n0\n\n0\n\n0\n\n" } }, { "input": { "stdin": "Thefirtuexampifistrlvial.\n\nfvl\n\nAhugeamountofinformationisbeingheapedonWWW.Albeititisnot\ngoecruosdednuobnun`saWWWescorbnawsresu,dezinagro-llew\nup-to-dateinformation,insteadofconsultingestablishedbutalittle\nybWWWwiolpxerehtrufnaduoy,revetnH.aidepolcycneetad-fo-tuo\nuoyfi,elpmaxeroF.omhtiroglahcraesdrowyektusbaeromfninrael\nwanttogftinformationtnrecenocomparisonbetweenWindowsandUNIX,\nbeWfohcnubgibafotuonoitpirctedtnavelertegotacepxeytmuoy\n\"XIOUcdna\"swodniW\"sdrowyekhtobniatno\"tahtstxetgnitcarsxeyb,ttxet\nblosetogetreh.\n\noWc\n\n4.746146111647564\n\nph\n\nWagner,Bsch,Beet,ovenhChopin,Brahma,Hindemith,Ivfs,Suk,Mozart,Stravinsky\n\nreaWy\n\n[SCIIcharacterssuchas+,*,B,#," }, "output": { "stdout": "1\n\nfistrlv\n\n2\n\nWesco\n\n0\n\n1\n\nWagner,Bsch,Beet,ovenhChopin,Brahma,Hindemith,Ivfs,Suk,Mozart,Stravinsky\n\n0\n\n" } }, { "input": { "stdin": "Thefirstexampleistrivial.\n\nmfv\n\nAhugeamountofinformationisbeingheapedonWWW.Albeititisnot\nwell-organized,userscanbrowseWWWas`nunboundedsourceof\nup-to-dateinformation,insteadofconsultingestablishedbutalittle\nout-of-dateencyclopedia.However,youdanfurtherexploitWWWby\nlearningmoreaboutkeywordsearchalgorithms.Forexample,ifyou\nwanttogetinformationonrecentcomparisonbetweenWindowsandUNIX,\nyoumayexpecttogetrelevantdescriptionoutofabigbunchofWeb\ntexts,byextractingtextsthat\"ontainbothkeywords\"Windows\"andcUNIX\"\n.rehtegotesolc\n\nbWn\n\n3.1415926535897932384626433832795028841971693993751058209749445923078164\n\nph\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\nWeary\n\nASCIIcharacterssuchas+,*,[,#," }, "output": { "stdout": "1\n\nfirstexampleistriv\n\n7\n\nnWWW.Alb\n\n0\n\n1\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\n0\n\n" } }, { "input": { "stdin": "Thefirtuexampifistrlvial.\n\nlfv\n\nAhugeamountofinformationisbeingheapedonWWW.Albeititisnot\ngoecruosdednuobnun`saWWWescorbnawsresu,dezinagro-llew\nup-to-dateinformation,insteadofconsultingestablishedbutalittle\nybWWWwiolpxerehtrufnaduoy,revetnH.aidepolcycneetad-fo-tuo\nlearninfmoreabsutkeywordsearchalgorithmo.Forexample,ifyou\nwanttogetinformationonrecentcomparisonbetweenWindowsandUNIX,\nbeWfohcnubgibafotuonoitpirctedtnavelertegottcepxeyamuoy\n\"XINUcdna\"swodniW\"sdrowyekhtobniatno\"tahtstxetgnitcarsxeyb,ttxet\nclosetogether.\n\ncWn\n\n4.746146111647564\n\nhp\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ivfs,Suk,Mozart,Stravinsky\n\nWeary\n\n[SCIIcharacterssuchas+,*,B,#," }, "output": { "stdout": "1\n\nfistrlv\n\n1\n\nWfohcn\n\n0\n\n1\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ivfs,Suk,Mozart,Stravinsky\n\n0\n\n" } }, { "input": { "stdin": "Thefirtuexamplfistrivial.\n\nlfv\n\nAhugeamountofinformationisbeingheapedonWWW.Albeititisnot\nwell-organized,userswanbrocseWWWas`nunboundedsourceog\nup-to-dateinformation,insteadofconsultingestablishedbutalittle\nout-of-dateencyclopedia.Hntever,youdanfurtherexploiwWWWby\nlearninfmoreabsutkeywordsearchalgorithmo.Forexample,ifyou\nwanttogetinformationonrecentcomparisonbetweenWindowsandUNIX,\nbeWfohcnubgibafotuonoitpirctedtnavelertegottcepxeyamuoy\n\"XINUcdna\"swodniW\"sdrowyekhtobniatno\"tahtstxetgnitcarsxeyb,ttxet\nclosetogether.\n\nbWn\n\n4.746146111647564\n\nhp\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\nyraeW\n\n[SCIIcharacterssuchas+,*,B,#," }, "output": { "stdout": "1\n\nlfistriv\n\n7\n\nnWWW.Alb\n\n0\n\n1\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\n0\n\n" } }, { "input": { "stdin": ".lbjuirlsnfipibxeuutrfehT\n\n{hk\n\nAuuAeomihntognofltmnteonitceihahffpejaaVWWotla.iteuisoof\nhcdlrbcscwenunununssaWWWespo`anafsrdst,dfzinagro-olfw\nutt-oncaueinaoruftion-instfahpfcn-stlsinfdosabkisdedbmsaliutme\npbVWswiwlpxcqejtWufnaduHytrdndtno.aideycloycmedtad-fn--uo\nvoyfjrolqmcxa,oF.emgtiroglarchansdsewyeltvrbaeqommoierafm\n-XINUbncawgdogtneewWepnosirapsdconeaernunoitsmrognimogotun_w\nyaditzuwpeuategetrelohontdedccvpraenouthfabhmruncnpeWoi\ntewtn,oyexsr_ctitgtdxtouhatwantahnbsuikex\"nrds\"Whndows\"andcUPIY\"\nelmsetophsheg-\n\nXje\n\n24.1539743973109\n\nkr\n\nbkrmihartR,erazoM,-uR,sfvIkhthneinde-amiyrB,nipovDhnevo,tetB,gcsB,rHmgaX\n\n^Vhsy\n\n[RCIhdI`sacte*rstchas++r,A,#," }, "output": { "stdout": "0\n\n1\n\njrolqmcxa,oF.emgtiroglarchansdsewyeltvrbaeqommoierafm-X\n\n0\n\n0\n\n0\n\n" } }, { "input": { "stdin": "Thefirstexampleistrivial.\n\nlfv\n\nAhugeamountofinformationisbeingheapedonWWW.Albeititisnot\nwell-organized,userscanbrowseWWWas`nunboundedsourceof\nup-to-dateinformation,insteadofconsultingestablishedbutalittle\nout-of-dateencyclopedia.However,youdanfurtherexploitWWWby\nlearningmoreaboutkeywordsearchalgorithms.Forexample,ifyou\nwanttogetinformationonrecentcomparisonbetweenWindowsandUNIX,\nyoumayexpecttogetrelevantdescriptionoutofabigbunchofWeb\ntexts,byextractingtextsthat\"ontainbothkeywords\"Windows\"andcUNIX\"\nclosetogether.\n\nbWn\n\n3.1415926535897932384626433832795028841971693993751058209749445923078164\n\nph\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\nWeary\n\nASCIIcharacterssuchas+,*,[,#," }, "output": { "stdout": "1\n\nfirstexampleistriv\n\n7\n\nnWWW.Alb\n\n0\n\n1\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\n0\n\n" } }, { "input": { "stdin": "Thefiruuexanpifistrlvial.\n\nlve\n\ntonsititieblA.WWWnodepaehgniebsinoitamrofnifotnuomaeguhA\ngoecruosdednuobnun`saWWWescorbnawsresu,dezinagro-llew\nemttilatubdehsilbatsegnitlusnocfodaetsni,noitamrofnietac-ot-pu\nybWWWwinlpxereitrufnaduoy-revetnH.aidepolcycneetad-fo-tuo\nuoyfi,elpmaxeroF.omhtiroglahcraesdrowyektusbaeromfninrafl\nwanttogftinformationtnrecenocomparisonbetweenWindowsandUNIX,\nyoumtyexpecatogetrelevantdetcriptionoutofabigbunchpfWeb\ntextt,byexsractingtextsthat\"ontainbothkeywords\"Windows\"andcUOIX\"\nblosetogetreh-\n\ndWo\n\n5.392476059374207\n\npg\n\nyksnihartS,trazoM,kuS,sfvI,htimedniH,amiarB,nipovChnevo,teeB,hcsB,rengaW\n\nrexWa\n\n[SCIIcharacterssuchas+,*,B,#," }, "output": { "stdout": "1\n\nexanpifistrlv\n\n1\n\nWnod\n\n0\n\n0\n\n0\n\n" } }, { "input": { "stdin": "Thegruuuelbipijnsyritfbl.\n\ni{k\n\nAuvAeomihntognoeltmnteonjtceihahffpeoaaVWWotja.iteuislof\nhcdlrbcscwWntnvnunssaWWeespo`anafsrcsu,dfzinagro.olfw\nemtualasmbdedsikb`spdfnislts-ncfphaftsni-noitfuroinieuacno-ttu\npbVWswiwlqxcqejtWufnaduHytqdndtno.bideycloycmedtad.fn--uo\nmfarliommpqeabrgtleywescsnaidralgoritvle.Fo,axcnpeotkfyor\nw_nutogomjngormttionunseaenocdsparisonpeWxeenugodhwacnbUNIX-\nioWepnbnuvhocafhtuorearpnccdedtnohmlersedetauepwuytigbx\ntewYnsoyexsr_ctitgtdxtnuhatwantahnbsuikex\"nrds\"Whndow,\"andcUPIt\"\n-gfksippuesmie\n\njYd\n\n25.7209186706678\n\nrj\n\nXagmHr,Bscg,Btet,ovenhDvopin,Bryhma,ednieohshkIvfs,Ru-,Mozase,Rtrahimrkb\n\nzVgt_\n\ntRCIdgI_sac[e*rstchasA+r,+,#-" }, "output": { "stdout": "0\n\n1\n\njngormttionunseaenocdsparisonpeWxeenugodhwacnbUNIX-ioWepnbnuvhocafhtuore\narpnccdedtnohmlersedetauepwuytigbxtewY\n\n0\n\n0\n\n0\n\n" } }, { "input": { "stdin": ".lbjuirlsnfipibxeuutrfehT\n\n{hk\n\nAuuAeomihntognofltmnteonitceihahffpejaaVWWotla.iteuisoof\nhcdlrbcscwenunununssaWWWespo`anafsrdst,dfzinagro-olfw\nutt-oncaueinaoruftion-instfahpfcn-stlsinfdosabkisdedbmsaliutme\npbVWswiwlpxcqejtWufnaduHytrdndtno.aideycloycmedtad-fn--uo\nmfareiommoqeabrvtleywesdsnahcralgoritgme.Fo,axcmqlorjfyov\n-XINUbncawgdogtneewWepnosirapsdconeaernunoitsmrognimogotun_w\nyaditzuwpeuategetrelohontdedccvpraenouthfabhmruncopeWoi\ntewtn,oyexsr_ctitgtdxtouhatwantahnbsuikex\"nrds\"Whndows\"andcUPIY\"\nelmsetophsheg-\n\nXje\n\n23.659178873840368\n\nkr\n\nbkrmihartR,erazoM,-uR,sfvIkhthneinde-amiyrB,nipovDhnevo,tetB,gcsB,rHmgaX\n\nyshV^\n\n[RCIhdI`sacte*rstchas++r,A,#," }, "output": { "stdout": "0\n\n1\n\ne.Fo,axcmqlorjfyov-X\n\n0\n\n0\n\n0\n\n" } }, { "input": { "stdin": ".lbjvtrlsieipnaxeuurifehT\n\nlvh\n\nAhugeamountofioformationisbeinahfgpeeonVWWeAlb.ititisnot\nwelo-organized,usdrswaobrocseWWWas`nunboundedspurcelg\nus,to-cateinformation-insteadpfcnnsultingeptablishedbusalittme\nybWWWwinlpxdreitsufnaduoytrevetnH.aidepolcycneetad-fo--uo\nvoyfi,elpmaxcroF.omhtiroglahcraesdrowyeltusbaeromfoimrafl\nwanttogftingormationtnrecenocomparisonbetweenWindowsandUNIX,\nyocityexpeuatogetrelevantdetcrmptionoutofabigbunchpfWea\ntextt,byexsractingtextsthatwontahnbotikey\"ords\"Windows\"andcUOIX\"\nclosetoretheg-\n\neWn\n\n6.886238764333143\n\nhq\n\nyksnihartS,trazoM,kuS,sfvI,htimednie,amibrB,nipovChnevo,teeB,hcsB,rHngaW\n\nXx_fr\n\n[SCIIdh`sactersstchas+,*,A,#," }, "output": { "stdout": "1\n\nvtrlsieipnaxeuurifeh\n\n1\n\nenW\n\n0\n\n0\n\n0\n\n" } }, { "input": { "stdin": "Thefituuexbnpieislrrvjbl.\n\nlxh\n\nAhugeamountofioformationisbeinahfgpeeonVWWeAlb.ititisnot\nwelo-organized,tsdrseaobsocseWWWas`nunboundwdspurcelg\nus,to-cateinformation-insteadpfcnnsultingeptablishedbusalittme\nou--of-dateencyclopedia.HntevertyoudanfustieqdxplniwWWWby\nlfarmiofmoreabsutleywosdsearchalgorithmo.Forcxamqle,ifyov\n,XINUdnaawodniWneewtebnosirapmoconeceqnunoitsmrognitfgottn`w\nyocitzexpeuatogetrelevantdetcrmptionoutofabihbunchpfWea\ntextn,byexsractitgtextothatwontahnbstikey\"ords\"Windows\"andcUOIX\"\nclosetoretgeg-\n\nWen\n\n8.054378376255722\n\nhp\n\nykrnihartS,trazoM,kuS,sfvI,htimednie,amibrB,nipovChnevo,teeB,hcsB,rHngaW\n\nrf_xX\n\n[SCIIdh`sactersstchas+,*,A,#," }, "output": { "stdout": "1\n\nhefituuexbnpieisl\n\n1\n\nWne\n\n0\n\n0\n\n0\n\n" } }, { "input": { "stdin": "Thefrtuuexbnpieislrivjbl.\n\nlhz\n\ntonsititi.alAeWVVnoeepgfhaniebsinoitamrogoifotnunmaefuhA\nwelo-organized,tsdrseaobsocseWWWas`nunboundwdspurcelg\nemtuilasubdehsilbatpegnitlts-ncfpdaetsni-noitamrofnietacnot,su\nou--nf-dateemcyclopedia.HntenertyoudanfustieqdxplviwWWVby\nffarmiolmoreabsutleywosdsoarchalgorithme.Foraxcmqle,ifyov\n,XINUonaawodnhtneewWebnosirapmdconeceqnunoitsmrognitfgottn`w\nyacitzexpeuatogetrelevontdeucrmpsaonouthfabihcuncopfWei\ntewtn,oyexsractitgtextothatwbntahnbstikey\"ords\"Whndows\"andcUOIX\"\nclosetorftgeg-\n\nmeY\n\n10.364404010774209\n\nhp\n\nykrnihartS,trazoM,kuS,sfvI,htimednie,amibrB,nipovChnevo,tdeB,gcsB,rHmgaX\n\nre_xX\n\n,#,A,*,+sahctssretcas`hdIICS[" }, "output": { "stdout": "0\n\n0\n\n0\n\n0\n\n0\n\n" } }, { "input": { "stdin": ".lbftirysnjipibleuuurgehT\n\ni{k\n\nAuuAeomihntognoeltmnteonjtceihahffpeoaaVWWotja.iteuislof\nhcdlrbcscwWntnvnunssaWWeespo`anafsrcsu,dfzinagro.olfw\nemtualasmbdedsikb`spdfnislts-ncfphaftsni-noitfuroinieuacno-ttu\npbVWswiwlqxcqejtWufnaduHytqdndtno.bideycloycmedtad.fn--uo\nmfarliommpqeabrgtleywescsnaidralgoritvle.Fo,axcnqeotkfyor\nw_nutogomjngormttionunseaenocdsparisonpeWxeenugodhwacnbUNIX-\nioWepnbnuvhocafhtuorearpnccdedtnohmlersegetauepwuytidax\ntewYnsoyexsr_ctitgtdxtnuhatwantahnbsuikex\"nrds\"Whndow,\"andcUPIt\"\n-gfksippuesmie\n\njYd\n\n25.7209186706678\n\nrj\n\nXagmHr,Bscg,Btet,ovenhDvopin,Bryhma,ednieohshkIvfs,Ru-,Mozase,Rtrahimrkb\n\nzVgt_\n\ntRCIdgI_sac[e*rstchasA+r,+,#-" }, "output": { "stdout": "0\n\n1\n\njngormttionunseaenocdsparisonpeWxeenugodhwacnbUNIX-ioWepnbnuvhocafhtuore\narpnccdedtnohmlersegetauepwuytidaxtewY\n\n0\n\n0\n\n0\n\n" } }, { "input": { "stdin": "Thefiruuexbnpieislrtvjbl.\n\nlxh\n\nAhugeamountofioformationisbeinahfgpeeonVWWeAlb.ititisnot\nwelo-organized,tsdrseaobrocseWWWas`nunboundwdspurcelg\nus,to-cateinformation-insteadpfcnnsultingeptablishedbusalittme\nybWWWwinlpxdqeitsufnaduoytrevetnH.aidepolcycneetad-fo--uo\nlfarmiofmoreabsutleywosdsearchalgorithmo.Forcxamqle,ifyov\n,XINUdnaawodniWneewtebnosirapmoconeceqnunoitsmrognitfgottnaw\nyocitzexpeuatogetrelevantdetcrmptionoutofabigbunchpfWea\ntextn,byexsractitgtextothatwontahnbstikey\"ords\"Windows\"andcUOIX\"\nclosetoretgeg-\n\nWen\n\n8.054378376255722\n\nhq\n\nykrnihartS,trazoM,kuS,sfvI,htimednie,amibrB,nipovChnevo,teeB,hcsB,rHngaW\n\nrf_xX\n\n[SCIIdh`sactersstchas+,*,A,#," }, "output": { "stdout": "1\n\nhefiruuexbnpieisl\n\n1\n\nWne\n\n0\n\n0\n\n0\n\n" } }, { "input": { "stdin": ".lbftirxsnjipibleuuurgehT\n\ni{k\n\nAuuAeomihntognoeltmnteonjtceihahffpejaaVWWotoa.iteuislof\nhcdlrbcscwentnununssaWWWespo`anafsrdsu,dfzinagro-olfw\nemtualasmbdedsikbaspdfnislts-ncfphaftsni-noitfuroinieuacno-ttu\npbVWswiwlpxcqejtWufnaduHytqdndtno.bideycloycmedtad.fn--uo\nroyfktoeqncxa,oF.elgtiroglarciansdsewyeltvrbaeqpmmoilrafm\nw_nutogomjngormttionunseaenocdsparisonpeWxeentgodhwacnbUNIX-\nyadityuwpeuategetrelmhontdedccnpraerouthfacohvuncnpeWoi\ntewYnsoyexsr_ctitgtdxtnuhatwantahnbsuikex\"nrds\"Whndow,\"andcUPIt\"\n-gflsippuesmhe\n\nYjc\n\n25.595533256222005\n\nkr\n\nXagmHr,Bscg,Btet,ovenhDvopin,Bryhma,ednienhshkIvfs,Ru-,Mozase,Rtrahimrkb\n\nyVgt_\n\ntRCIdhI_sac[e*rstchasA+r,+,#-" }, "output": { "stdout": "0\n\n1\n\njngormttionunseaenocdsparisonpeWxeentgodhwacnbUNIX-yadityuwpeuategetrelm\nhontdedccnpraerouthfacohvuncnpeWoitewY\n\n0\n\n0\n\n0\n\n" } }, { "input": { "stdin": "Thefiruuexanpifistrlvial.\n\nlve\n\nAhugeamountofinformationisbeingheapedonWWW.Albeititisnot\ngoecruosdednuobnun`saWWWescorbnawsresu,dezinagro-llew\nemttilatubdehsilbatsegnitlusnocfodaetsni,noitamrofnietac-ot-pu\nou--of-dateencyclopedia.HntevertyoudanfurtierexplniwWWWby\nuoyfi,elpmaxeroF.omhtiroglahcraesdrowyektusbaeromfninrafl\nwanttogftinformationtnrecenocomparisonbetweenWindowsandUNIX,\nyoumtyexpecatogetrelevantdetcriptionoutofabigbunchpfWeb\ntextt,byexsractingtextsthat\"ontainbothkeywords\"Windows\"andcUOIX\"\nblosetoretheg-\n\ndWn\n\n5.420240486697985\n\npg\n\nyksnihartS,trazoM,kuS,sfvI,htimedniH,amiarB,nipovChnevo,teeB,hcsB,rengaW\n\nrexWa\n\n[SCIIcharacterssuchas+,*,B,#," }, "output": { "stdout": "1\n\nexanpifistrlv\n\n3\n\ndonW\n\n0\n\n0\n\n0\n\n" } }, { "input": { "stdin": "Thefrtuuexbnpieislrivjbl.\n\nlhy\n\ntonsititi.alAeWWVnoeepgfhaniebsinoitamrogoifotnunmaefuhA\nwelo-organized,tsdrseaobsocseWWWas`nunboundwdspurcelg\nus,toncateinformation-insteadpfcn-sultingeptablishedbusalittme\nou--nf-dateemcyclopedia.HntenertyoudanfustieqdxplviwWWWby\nvoyfi,elqmcxaroF.emhtiroglahcraosdsowyeltusbaeromfoimrafl\n,XINUdnaawodnhWneewtebnosirapmoconeceqnunoitsmrognitfgottn`w\nyacitzexpeuatogetrelevontdeucrmptionouthfabihcuncopfWea\ntewtn,byexsractitgtextothatwontahnbstikey\"ords\"Whndows\"andcUOIX\"\nclosetorftgeg-\n\nneX\n\n9.44951311144511\n\nhp\n\nykrnihartS,trazoM,kuS,sfvI,htimednie,amibrB,nipovChnevo,tdeB,gcsB,rHngaX\n\nre_xX\n\n[SCIIdh`sactersstchas+,*,A,#," }, "output": { "stdout": "0\n\n1\n\nndcUOIX\"close\n\n0\n\n0\n\n0\n\n" } }, { "input": { "stdin": "Thefirtuexampifistrlvial.\n\nfvl\n\nAhugeamountofinformationisbeingheapedonWWW.Albeititisnot\ngoecruosdednuobnun`saWWWescorbnawsresu,dezinagro-llew\nup-to-dateinformation,insteadofconsultingestablishedbutalittle\nybWWWwiolpxerehtrufnaduoy,revetnH.aidepolcycneetad-fo-tuo\nlearninfmoreabsutkeywordsearchalgorithmo.Forexample,ifyou\nwanttogftinformationtnrecenocomparisonbetweenWindowsandUNIX,\nbeWfohcnubgibafotuonoitpirctedtnavelertegottcepxeyamuoy\n\"XINUcdna\"swodniW\"sdrowyekhtobniatno\"tahtstxetgnitcarsxeyb,ttxet\nclosetogether.\n\ncWn\n\n4.746146111647564\n\nhp\n\nWagner,Bsch,Beethoven,Chopin,Brahma,Hindemith,Ivfs,Suk,Mozart,Stravinsky\n\nWeary\n\n[SCIIcharacterssuchas+,*,B,#," }, "output": { "stdout": "1\n\nfistrlv\n\n1\n\nWfohcn\n\n0\n\n1\n\nWagner,Bsch,Beethoven,Chopin,Brahma,Hindemith,Ivfs,Suk,Mozart,Stravinsky\n\n0\n\n" } }, { "input": { "stdin": "Thefirstexampleistrivial.\n\nlfv\n\nAhugeamountofinformationisbeingheapedonWWW.Albeititisnot\nwell-organized,userswanbrocseWWWas`nunboundedsourceof\nup-to-dateinformation,insteadofconsultingestablishedbutalittle\nout-of-dateencyclopedia.However,youdanfurtherexploitWWWby\nlearningmoreaboutkeywordsearchalgorithms.Forexample,ifyou\nwanttogetinformationonrecentcomparisonbetweenWindowsandUNIX,\nyoumayexpecttogetrelevantdescriptionoutofabigbunchofWeb\ntexts,byextractingtextsthat\"ontainbothkeywords\"Windows\"andcUNIX\"\nclosetogether.\n\nbWn\n\n3.1415926535897932384626433832795028841971693993751058209749445923078164\n\nph\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\nWeary\n\nASCIIcharacterssuchas+,*,[,#," }, "output": { "stdout": "1\n\nfirstexampleistriv\n\n7\n\nnWWW.Alb\n\n0\n\n1\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\n0\n\n" } }, { "input": { "stdin": ".lbftirysnjipibleuuurgehT\n\ni{k\n\nAuuAeomihntognoeltmnteonjtceihahffpeoaaVWWotja.iteuislof\nhcdlrbcscwWntnvnunssaWWeespo`anafsrcsu,dfzinagro.olfw\nemtualasmbdedsikb`spdfnislts-ncfphaftsni-noitfuroinieuacno-ttu\npbVWswiwlqxcqejtWufnaduHytqdndtno.bideycloycmedtad.fn--uo\nmfarliommpqeabrgtleywescsnaidralgoritvle.Fo,axcnqeotkfyor\nw_nutogomjngormttionunseaenocdsparisonpeWxeenugodhwacnbUNIX-\nioWepnbnuvhocafhtuorearpnccdedtnohmlersegetauepwuytidbx\ntewYnsoyexsr_ctitgtdxtnuhatwantahnbsuikex\"nrds\"Whndow,\"andcUPIt\"\n-gfksippuesmie\n\njYd\n\n25.7209186706678\n\nrj\n\nXagmHr,Bscg,Btet,ovenhDvopin,Bryhma,ednieohshkIvfs,Ru-,Mozase,Rtrahimrkb\n\nzVgt_\n\ntRCIdgI_sac[e*rstchasA+r,+,#-" }, "output": { "stdout": "0\n\n1\n\njngormttionunseaenocdsparisonpeWxeenugodhwacnbUNIX-ioWepnbnuvhocafhtuore\narpnccdedtnohmlersegetauepwuytidbxtewY\n\n0\n\n0\n\n0\n\n" } }, { "input": { "stdin": "Thefirttexampleistrivial.\n\nlfv\n\nAhugeamountofinformationisbeingheapedonWWW.Albeititisnot\nwell-organized,userswanbrocseWWWas`nunboundedsourceof\nup-to-dateinformation,insteadofconsultingestablishedbutalittle\nout-of-dateencyclopedia.Hnwever,youdanfurtherexploitWWWby\nlearninfmoreaboutkeywordsearchalgorithms.Forexample,ifyou\nwanttogetinformationonrecentcomparisonbetweenWindowsandUNIX,\nyoumayexpecttogetrelevantdescriptionoutofabigbunchofWeb\n\"XINUcdna\"swodniW\"sdrowyekhtobniatno\"tahtstxetgnitcarsxeyb,ttxet\nclosetogether.\n\nbWn\n\n4.746146111647564\n\nhp\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\nyraeW\n\nBSCIIcharacterssuchas+,*,[,#," }, "output": { "stdout": "1\n\nfirttexampleistriv\n\n7\n\nnWWW.Alb\n\n0\n\n1\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\n0\n\n" } }, { "input": { "stdin": "Thefirtuexampifistrlvial.\n\nlfv\n\nAhugeamountofinformationisbeingheapedonWWW.Albeititisnot\ngoecruosdednuobnun`saWWWescorbnawsresu,dezinagro-llew\nup-to-dateinformation,insteadofconsultingestablishedbutalittle\nybWWWwiolpxerehtrufnaduoy,revetnH.aidepolcycneetad-fo-tuo\nlearninfmoreabsutkeywordsearchalgorithmo.Forexample,ifyou\nwanttogetinformationtnrecenocomparisonbetweenWindowsandUNIX,\nbeWfohcnubgibafotuonoitpirctedtnavelertegottcepxeyamuoy\n\"XINUcdna\"swodniW\"sdrowyekhtobniatno\"tahtstxetgnitcarsxeyb,ttxet\nclosetogether.\n\ncWn\n\n4.746146111647564\n\nhp\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ivfs,Suk,Mozart,Stravinsky\n\nWeary\n\n[SCIIcharacterssuchas+,*,B,#," }, "output": { "stdout": "1\n\nfistrlv\n\n1\n\nWfohcn\n\n0\n\n1\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ivfs,Suk,Mozart,Stravinsky\n\n0\n\n" } }, { "input": { "stdin": ".lajvlrtsifipnaxeuurifehT\n\nlve\n\nAhugeamountofinformationisbeingheapedonVWW.Albeititisnot\ngoecruosdednuobnun`saWWWescorbnawsresu,dezinagro-llew\nemttilatubdehsilbatsegnitlusnocfpdaetsni,noitamrofnietac-ot-pu\nou--of-dateencyclopedia.HntevertyoudanfurtierexplniwWWWby\nuoyfi,elpmaxeroF.omhtiroglahcraesdrowyeltusbaeromfninrafl\nwanttogftingormationtnrecenocomparisonbetweenWindowsandUNIX,\nyoumtyexpecatogetrelevantdetcriptionoutofabigbunchpfWeb\ntextt,byexsractingtextsthat\"ontainbothkeywords\"Windows\"andcUOIX\"\nblosetoretheg-\n\ndWn\n\n5.420240486697985\n\npg\n\nyksnihartS,trazoM,kuS,sfvI,htimedniH,amiarB,nipovChnevo,teeB,hcsB,rengaW\n\nrexW`\n\n[SCIIcharacterssuchas+,*,B,#," }, "output": { "stdout": "1\n\nvlrtsifipnaxe\n\n2\n\nWind\n\n0\n\n0\n\n0\n\n" } }, { "input": { "stdin": "Thefirtuexampifistrlvial.\n\nlve\n\ntonsititieblA.WWWnodepaehgniebsinoitamrofnifotnuomaeguhA\ngoecruosdednuobnun`saWWWescorbnawsresu,dezinagro-llew\nelttilatubdehsilbatsegnitlusnocfodaetsni,noitamrofnietac-ot-pu\nybWWWwinlpxereitrufnaduoy-revetnH.aidepolcycneetad-fo-tuo\nuoyfi,elpmaxeroF.omhtiroglahcraesdrowyektusbaeromfninrael\nwanttogftinformationtnrecenocomparisonbetweenWindowsandUNIX,\nbeWfphcnubgibafotuonoitpirctedtnavelertegotacepxeytmuoy\n\"XIOUcdna\"swodniW\"sdrowyekhtobniatno\"tahtstxetgnitcarsxeyb,ttxet\nblosetogetreh-\n\ndWo\n\n4.746146111647564\n\nph\n\nWagner,Bsch,Beet,ovenhChopin,Braima,Hindemith,Ivfs,Suk,Mozart,Stravinsky\n\nreaWx\n\n[SCIIcharacterssuchas+,*,B,#," }, "output": { "stdout": "1\n\nexampifistrlv\n\n1\n\nWnod\n\n0\n\n0\n\n0\n\n" } }, { "input": { "stdin": "Thefirtuexampifistrlvial.\n\nfvl\n\nAhugeamountofinformationisbeingheapedonWWW.Albeititisnot\ngoecruosdednuobnun`saWWWescorbnawsresu,dezinagro-llew\nup-to-dateinformation,insteadofconsultingestablishedbutalittle\nybWWWwiolpxerehtrufnaduoy,revetnH.aidepolcycneetad-fo-tuo\nlearninfmoreabsutkeywordsearchalgorithmo.Forexample,ifyou\nwanttogftinformationtnrecenocomparisonbetweenWindowsandUNIX,\nbeWfohcnubgibafotuonoitpirctedtnavelertegottcepxeyamuoy\n\"XINUcdna\"swodniW\"sdrowyekhtobniatno\"tahtstxetgnitcarsxeyb,ttxet\nblosetogether.\n\ncWn\n\n4.746146111647564\n\nhp\n\nWagner,Bsch,Beethoven,Chopin,Brahma,Hindemith,Ivfs,Suk,Mozart,Stravinsky\n\nreaWy\n\n[SCIIcharacterssuchas+,*,B,#," }, "output": { "stdout": "1\n\nfistrlv\n\n1\n\nWfohcn\n\n0\n\n1\n\nWagner,Bsch,Beethoven,Chopin,Brahma,Hindemith,Ivfs,Suk,Mozart,Stravinsky\n\n0\n\n" } }, { "input": { "stdin": ".lbjtirxsnfipibleuuurfehT\n\n{ik\n\nfolsiueti.aotoWWVaajepffhahiectinoetnmtleongotnhimoeAuuA\nwflo-organizfd,usdrsfana`opseWWWassnununtnewcscbrldch\nutt-oncaueinioruftion-instfahpfcn-stlsinfdpsabkisdedbmsalautme\npbVWswiwlpxcqejtWufnaduHytrdndtno.bideycloycmedtad-fn--uo\nvoyfkroeqmcxa,oF.elgtiroglarciansdsewyeltvrbaeqpmmoilrafm\n-XINUbncawgdogtneexWepnosirapsdconeaesnunoittmrognimogotun_w\nyadityuwpeuategetrelmhontdedccrpraenouthfacohvuncnpeWoi\ntewYn,oyexsr_ctitgtdxtnuhatwantahnbsuikex\"nrds\"Whndows\"andcUPIt\"\n-gflsippuesmhe\n\nYjd\n\n24.34217234275631\n\nkr\n\nXagmHr,Bscg,Btet,ovenhDvopin,Bryhma-ednienhshkIvfs,Ru-,Mozase,Rtrahimrkb\n\n^Vgty\n\n-#,A,r++sahctsr*e[cas_IdhICRt" }, "output": { "stdout": "0\n\n1\n\njtWufnaduHytrdndtno.bideycloycmedtad-fn--uovoyfkroeqmcxa,oF.elgtiroglarc\niansdsewyeltvrbaeqpmmoilrafm-XINUbncawgdogtneexWepnosirapsdconeaesnunoit\ntmrognimogotun_wyadityuwpeuategetrelmhontdedccrpraenouthfacohvuncnpeWoit\newY\n\n0\n\n0\n\n0\n\n" } }, { "input": { "stdin": "Thefiruuexanpifistrlvial.\n\nlve\n\nAhugeamountofinformationisbeingheapedonWWW.Albeititisnot\ngoecruosdednuobnun`saWWWescorbnawsresu,dezinagro-llew\nemttilatubdehsilbatsegnitlusnocfodaetsni,noitamrofnietac-ot-pu\nybWWWwinlpxereitrufnaduoy-revetnH.aidepolcycneetad-fo-tuo\nuoyfi,elpmaxeroF.omhtiroglahcraesdrowyektusbaeromfninrafl\nwanttogftinformationtnrecenocomparisonbetweenWindowsandUNIX,\nyoumtyexpecatogetrelevantdetcriptionoutofabigbunchpfWeb\ntextt,byexsractingtextsthat\"ontainbothkeywords\"Windows\"andcUOIX\"\nblosetogetreh-\n\ndWo\n\n4.746146111647564\n\ngp\n\nyksnihartS,trazoM,kuS,sfvI,htimedniH,amiarB,nipovChnevo,teeB,hcsB,rengaW\n\nrexWa\n\n[SCIIcharacterssuchas+,*,B,#," }, "output": { "stdout": "1\n\nexanpifistrlv\n\n1\n\ndonW\n\n0\n\n0\n\n0\n\n" } }, { "input": { "stdin": ".lbjvislsnfipibxeuutrfdhT\n\nk{h\n\nAuuAeomihntognogmtmntoonitceihahffpejaaVWWetla.iteuisoof\nwflo-organizfd,tsdrsfana`opseWWWassnunununewcscbrldch\nemtuilasmbdedsikbasodfnislts-ncfphaftsni-noitfuroanieuacno-ttu\npbVWswiwlpxcqejtWufnaduHytrendtno.aideycloycmedtad-fn--uo\nmfareiommoqeabrvtleywesdsnahcralgoritgme.Fo,axcmqlorjfyov\n-XINUbncawgdogtneewWepnosirapsdconeaernunoitsmrognimogottn_w\nyaditzuwpeuategetrelohontdedccvpraenouthfabhmruncopeWoi\ntewtn,oyexsr_ctitgtdxtouhatwantahnbsuikex\"nrds\"Whndows\"andcUPIY\"\nelnsetophsheg-\n\ndjY\n\n23.14248273207164\n\njq\n\nbkrmihartR,erazoM,-uR,sfvIkhthneinde-amiyrB,nipovDhnevo,tetB,gcsB,rHmgaX\n\nyshV^\n\n[RCIhdI`sacte*rstchas++r,A,#," }, "output": { "stdout": "0\n\n1\n\njfyov-XINUbncawgdogtneewWepnosirapsdconeaernunoitsmrognimogottn_wyaditzu\nwpeuategetrelohontdedccvpraenouthfabhmruncopeWoitewtn,oyexsr_ctitgtdxtou\nhatwantahnbsuikex\"nrds\"Whndows\"andcUPIY\n\n0\n\n0\n\n0\n\n" } }, { "input": { "stdin": "Thefirtuexamplfistrivial.\n\nvfl\n\nAhugeamountofinformationisbeingheapedonWWW.Albeititisnot\nwell-organized,userswanbrocseWWWas`nunboundedsourceog\nup-to-dateinformation,insteadofconsultingestablishedbutalittle\nybWWWwiolpxerehtrufnaduoy,revetnH.aidepolcycneetad-fo-tuo\nlearninfmoreabsutkeywordsearchalgorithmo.Forexample,ifyou\nwanttogetinformationonrecentcomparisonbetweenWindowsandUNIX,\nbeWfohcnubgibafotuonoitpirctedtnavelertegottcepxeyamuoy\n\"XINUcdna\"swodniW\"sdrowyekhtobniatno\"tahtstxetgnitcarsxeyb,ttxet\nclosetogether.\n\ncWn\n\n4.746146111647564\n\nhp\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\nyraeW\n\n[SCIIcharacterssuchas+,*,B,#," }, "output": { "stdout": "1\n\nlfistriv\n\n1\n\nWfohcn\n\n0\n\n1\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\n0\n\n" } }, { "input": { "stdin": "Thefirttexampleistrivial.\n\nlfv\n\nAhugeamountofinformationisbeingheapedonWWW.Albeititisnot\nwell-organized,userswanbrocseWWWas`nunboundedsourceof\nup-to-dateinformation,insteadofconsultingestablishedbutalittle\nout-of-dateencyclopedia.However,youdanfurtherexploitWWWby\nlearningmoreaboutkeywordsearchalgorithms.Forexample,ifyou\nwanttogetinformationonrecentcomparisonbetweenWindowsandUNIX,\nyoumayexpecttogetrelevantdescriptionoutofabigbunchofWeb\ntextt,byexsractingtextsthat\"ontainbothkeywords\"Windows\"andcUNIX\"\nclosetogether.\n\nbWn\n\n3.9238593865041387\n\nph\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\nWeary\n\nBSCIIcharacterssuchas+,*,[,#," }, "output": { "stdout": "1\n\nfirttexampleistriv\n\n7\n\nnWWW.Alb\n\n0\n\n1\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\n0\n\n" } }, { "input": { "stdin": "Thefirttexampleistrivial.\n\nlfv\n\nAhugeamountofinformationisbeingheapedonWWW.Albeititisnot\nwell-organized,userswanbrocseWWWas`nunboundedsourceof\nup-to-dateinformation,insteadofconsultingestablishedbutalittle\nout-of-dateencyclopedia.However,youdanfurtherexploitWWWby\nlearningmoreaboutkeywordsearchalgorithms.Forexample,ifyou\nwanttogetinformationonrecentcomparisonbetweenWindowsandUNIX,\nyoumayexpecttogetrelevantdescriptionoutofabigbunchofWeb\ntexts,byextractingtextsthat\"ontainbothkeywords\"Windows\"andcUNIX\"\nclosetogether.\n\ncWn\n\n3.9238593865041387\n\nph\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\nyraeW\n\nASCIIcharacterssuchas+,*,[,#," }, "output": { "stdout": "1\n\nfirttexampleistriv\n\n1\n\nnchofW\n\n0\n\n1\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\n0\n\n" } }, { "input": { "stdin": "Thefirttexamplfistrivial.\n\nlfv\n\nAhugeamountofinformationisbeingheapedonWWW.Albeititisnot\nwell-organized,userswanbrocseWWWas`nunboundedsourceof\nup-to-dateinformation,insteadofconsultingestablishedbutalittle\nout-of-dateencyclopedia.Hnwever,youdanfurtherexploitWWWby\nlearninfmoreabsutkeywordsearchalgorithmo.Forexample,ifyou\nwanttogetinformationonrecentcomparisonbetweenWindowsandUNIX,\nbeWfohcnubgibafotuonoitpirctedtnavelertegottcepxeyamuoy\n\"XINUcdna\"swodniW\"sdrowyekhtobniatno\"tahtstxetgnitcarsxeyb,ttxet\nclosetogether.\n\nbWn\n\n4.746146111647564\n\nhp\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\nyraeW\n\nBSCIIcharacterssuchas+,*,[,#," }, "output": { "stdout": "1\n\nlfistriv\n\n7\n\nnWWW.Alb\n\n0\n\n1\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\n0\n\n" } }, { "input": { "stdin": "Thefirtuexamplfistrivial.\n\nvfl\n\nAhugeamountofinformationisbeingheapedonWWW.Albeititisnot\nwell-organized,userswanbrocseWWWas`nunboundedsourceog\nup-to-dateinformation,insteadofconsultingestablishedbutalittle\nybWWWwiolpxerehtrufnaduoy,revetnH.aidepolcycneetad-fo-tuo\nlearninfmoreabsutkeywordsearchalgorithmo.Forexample,ifyou\nwanttogetinformationonrecentcomparisonbetweenWindowsandUNIX,\nbeWfohcnubgibafotuonoitpirctedtnavelertegottcepxeyamuoy\n\"XINUcdna\"swodniW\"sdrowyekhtobniatno\"tahtstxetgnitcarsxeyb,ttxet\nclosetogether.\n\ncWn\n\n4.746146111647564\n\nhp\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\nWeary\n\n[SCIIcharacterssuchas+,*,B,#," }, "output": { "stdout": "1\n\nlfistriv\n\n1\n\nWfohcn\n\n0\n\n1\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\n0\n\n" } }, { "input": { "stdin": "Thdfrtuuexbnpifislsivjbl.\n\nk{h\n\nfoosiueti.alteWWVaajepffhahiectinootnmtngongotnhimoeAuuA\nwflo-organizfd,tsdrsfana`opseWWWassnunununewcscbrldch\nemtuilasmbdedsikbasodfnislts-ncfphaftsni-noitfuroanieuacno-ttu\npbVWswiwlpxcqejtWufnaduHytrendtno.aideycloycmedtad-fn--uo\nmfareiommoqeabrvtleywesdsnahcralgoritgme.Fo,axcmqlorjfyov\n-XINUbncawgdogtneewWepnosirapsdconeaernunoitsmrognimogottn_w\nyaditzuwpeuategetrelohontdedccvpraenouthfabhmruncopeWoi\ntewtn,oyexsr`ctitgtdxtouhatwantahnbsuikex\"nrds\"Whndows\"andcUPIY\"\nelnsetophsheg-\n\ndkY\n\n22.934718734323777\n\npi\n\nbkrmihartR,erazoM,-uR,sfvIkhthneinde-amiyrB,nipovDhnevo,tetB,gcsB,rHmgaX\n\nxshV^\n\n[RCIhdI`sacte*rstchas++r,A,#," }, "output": { "stdout": "0\n\n1\n\nkex\"nrds\"Whndows\"andcUPIY\n\n0\n\n0\n\n0\n\n" } }, { "input": { "stdin": ".lbftirxsnjipibleuuurgehT\n\ni{k\n\nAuuAeomihntognoeltmnteonjtceihahffpejaaVWWotoa.iteuislof\nhcdlrbcscwentnununssaWWWespo`anafsrdsu,dfzinagro-olfw\nemtualasmbdedsikbaspdfnislts-ncfphaftsni-noitfuroinieuacno-ttu\npbVWswiwlpxcqejtWufnaduHytqdndtno.bideycloycmedtad.fn--uo\nmfarliommpqeabrvtleywescsnaidralgoritgle.Fo,axcnqeotkfyor\nw_nutogomjngormttionunseaenocdsparisonpeWxeenugodhwacnbUNIX-\nioWepncnuvhocafhtuorearpnccdedtnohmlertegetauepwuytidax\ntewYnsoyexsr_ctitgtdxtnuhatwantahnbsuikex\"nrds\"Whndow,\"andcUPIt\"\n-gflsippuesmie\n\ndjY\n\n25.595533256222005\n\njr\n\nXagmHr,Bscg,Btet,ovenhDvopin,Bryhma,ednienhshkIvfs,Ru-,Mozase,Rtrahimrkb\n\nyVgt_\n\ntRCIdhI_sac[e*rstchasA+r,+,#-" }, "output": { "stdout": "0\n\n1\n\njngormttionunseaenocdsparisonpeWxeenugodhwacnbUNIX-ioWepncnuvhocafhtuore\narpnccdedtnohmlertegetauepwuytidaxtewY\n\n0\n\n0\n\n0\n\n" } }, { "input": { "stdin": ".lajvlrtsifipnaxeuurifehT\n\nlvg\n\nAhugeamountofinformationisbeinahegpedonVWWeAlb.ititisnot\nwelo-organized,usdrswaobrocseWWWas`nunboundedsourcelg\nemttilatubdehsilbatpegnitlusnncfpdaetsni,noitamrofnietac-ot-su\nou--of-dateencyclopedia.HntevertyoudanfustierexplniwWWWby\nuoyfi,elpmaxeroF.omhtiroglahcraescrowyeltusbaeromfoimrafl\nwanttogftingormationtnrecenocomparisonbetweenWindowsandUNIX,\nbeWfphcnubgibafotuonoitpmrctedtnavelertegotacepxeytiuoy\ntextt,byexsractingtextsthatwontahnbotikey\"ords\"Windows\"andcUOIX\"\n-gehterotesolb\n\nnWe\n\n6.575567457746784\n\nqg\n\nyksnihartS,trazoM,kuS,sfvI,htimedniH,amibrB,nipovChnevo,teeB,hcsB,rengaW\n\n_Wxer\n\n[SCIIch`racterssuchas+,*,B,#," }, "output": { "stdout": "0\n\n1\n\nenW\n\n0\n\n0\n\n0\n\n" } }, { "input": { "stdin": "Thefirttexampleistrivial.\n\nlfv\n\nAhugeamountofinformationisbeingheapedonWWW.Albeititisnot\nwell-organized,userswanbrocseWWWas`nunboundedsourceof\nup-to-dateinformation,insteadofconsultingestablishedbutalittle\nout-of-dateencyclopedia.However,youdanfurtherexploitWWWby\nlearningmoreaboutkeywordsearchalgorithms.Forexample,ifyou\nwanttogetinformationonrecentcomparisonbetweenWindowsandUNIX,\nyoumayexpecttogetrelevantdescriptionoutofabigbunchofWeb\ntextt,byexsractingtextsthat\"ontainbothkeywords\"Windows\"andcUNIX\"\nclosetogether.\n\nbWn\n\n3.9238593865041387\n\nph\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\nyraeW\n\nASCIIcharacterssuchas+,*,[,#," }, "output": { "stdout": "1\n\nfirttexampleistriv\n\n7\n\nnWWW.Alb\n\n0\n\n1\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\n0\n\n" } }, { "input": { "stdin": "Thefiruuexbnpieislrtvjbl.\n\nlvh\n\nAhugeamountofioformationisbeinahfgpeeonVWWeAlb.ititisnot\nwelo-organized,usdrswaobrocseWWWas`nunboundedspurcelg\nus,to-cateinformation-insteadpfcnnsultingeptablishedbusalittme\nybWWWwinlpxdreitsufnaduoytrevetnH.aidepolcycneetad-fo--uo\nvoyfi,elqmaxcroF.omhtiroglahcraesdsowyeltusbaeromfoimrafl\nwanttogftingormationtnrecenocomparisonbetweenWindowsandUNIX,\nyocityexpeuatogetrelevantdetcrmptionoutofabigbunchpfWea\ntextt,byexsractingtextsthatwontahnbotikey\"ords\"Windows\"andcUOIX\"\nclosetoretgeg-\n\nWen\n\n7.483690964083565\n\nhq\n\nyksnihartS,trazoM,kuS,sfvI,htimednie,amibrB,nipovChnevo,teeB,hcsB,rHngaW\n\nXx_fr\n\n[SCIIdh`sactersstchas+,*,A,#," }, "output": { "stdout": "1\n\nhefiruuexbnpieislrtv\n\n1\n\nenW\n\n0\n\n0\n\n0\n\n" } }, { "input": { "stdin": "Thefirttexampleistrivial.\n\nlfv\n\nAhugeamountofinformationisbeingheapedonWWW.Albeititisnot\nwell-organized,userswanbrocseWWWas`nunboundedsourceof\nup-to-dateinformation,insteadofconsultingestablishedbutalittle\nout-of-dateencyclopedia.However,youdanfurtherexploitWWWby\nlearningmoreaboutkeywordsearchalgorithms.Forexample,ifyou\nwanttogetinformationonrecentcomparisonbetweenWindowsandUNIX,\nyoumayexpecttogetrelevantdescriptionoutofabigbunchofWeb\ntexts,byextractingtextsthat\"ontainbothkeywords\"Windows\"andcUNIX\"\nclosetogether.\n\ncWn\n\n3.9238593865041387\n\nph\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\nWeary\n\nASCIIcharacterssuchas+,*,[,#," }, "output": { "stdout": "1\n\nfirttexampleistriv\n\n1\n\nnchofW\n\n0\n\n1\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\n0\n\n" } }, { "input": { "stdin": "Thefirttexampleistrivial.\n\nlfv\n\nAhugeamountofinformationisbeingheapedonWWW.Albeititisnot\nwell-organized,userswanbrocseWWWas`nunboundedsourceof\nup-to-dateinformation,insteadofconsultingestablishedbutalittle\nout-of-dateencyclopedia.However,youdanfurtherexploitWWWby\nlearningmoreaboutkeywordsearchalgorithms.Forexample,ifyou\nwanttogetinformationonrecentcomparisonbetweenWindowsandUNIX,\nyoumayexpecttogetrelevantdescriptionoutofabigbunchofWeb\ntexts,byextractingtextsthat\"ontainbothkeywords\"Windows\"andcUNIX\"\nclosetogether.\n\nbWn\n\n3.9238593865041387\n\nph\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\nyraeW\n\nASCIIcharacterssuchas+,*,[,#," }, "output": { "stdout": "1\n\nfirttexampleistriv\n\n7\n\nnWWW.Alb\n\n0\n\n1\n\nWagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky\n\n0\n\n" } } ]

{ "tags": [], "title": "Co-occurrence Search" }

{ "cpp": "#include<iostream>\n#include<map>\n#include<cstring>\n\nusing namespace std;\n\nconst int MAX = 51;\n\nstring text, key;\nmap<char,int> M;\nint numKey[MAX];\n\ntypedef long long ll;\n\nbool input(){\n text = \"\";\n\n string s = \"\";\n if(!getline(cin,s)) return false;\n if(s == \"\") return false;\n text = s;\n while(getline(cin,s)&&s!=\"\") text += s;\n getline(cin,s);\n key = s;\n getline(cin,s); // for blank line\n return true;\n}\n\n\n\nvoid solve(){\n\n memset(numKey,0,sizeof(numKey));\n\n M.clear();\n for(int i = 0; i < (int)key.length(); i++)\n M[key[i]] = i;\n\n ll need = (1LL<<key.length())-1;\n\n string first = \"\";\n int num = 0;\n\n int s = 0, t = 0;\n\n while(s <= t && t <= (int)text.length()){\n if(need == 0){\n // if(text.size() > 400 && t-s < 50) cout << text.substr(s,t-s) << endl;\n if(first != \"\" && (int)first.length() == t-s){\n\tnum++;\n }\n if(first == \"\" || (int)first.length() > t-s){\n\tfirst = text.substr(s,t-s);\n\tnum = 1;\n }\n\n if(M.count(text[s]) != 0){\n\tnumKey[M[text[s]]]--;\n\tif(numKey[M[text[s]]] == 0) need |= (1LL<<M[text[s]]);\n }\n s++;\n }else{\n if(M.count(text[t]) != 0){\n\tif(need&(1LL<<M[text[t]])) need -= (1LL<<M[text[t]]);\n\tnumKey[M[text[t]]]++;\n }\n t++;\n }\n }\n // cout << \"min \" << minT << endl;\n if(num == 0) cout << num << endl;\n else{\n cout << num << endl << endl;\n\n for(int i = 0; i < (int)first.length(); i++){\n cout << first[i];\n if((i+1)%72 == 0) cout<<endl;\n }\n if((int)first.size()%72)cout << endl;\n }\n cout << endl;\n}\t \n\nint main(){\n\n // bool isFirst = true;\n while(input()){\n // if(isFirst) isFirst = false;\n // else cout << endl;\n solve();\n }\n return 0;\n}", "java": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tstatic Scanner sc = new Scanner(System.in);\n\tstatic int[] key = new int[256];\n\n\tpublic static void main(String[] args) {\n\t\twhile (true) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\twhile (true) {\n\t\t\t\tString line = sc.nextLine();\n\t\t\t\tif (line.isEmpty()) break;\n\t\t\t\tsb.append(line);\n\t\t\t}\n\t\t\tchar[] input = sb.toString().toCharArray();\n\t\t\tint N = input.length;\n\t\t\tArrays.fill(key, -1);\n\t\t\tString keys = sc.nextLine();\n\t\t\tfor (int i = 0; i < keys.length(); ++i) {\n\t\t\t\tkey[keys.charAt(i)] = i;\n\t\t\t}\n\t\t\tint[] count = new int[keys.length()];\n\t\t\tint l = 0;\n\t\t\tint r = 0;\n\t\t\tint ans = Integer.MAX_VALUE;\n\t\t\tint ansC = 0;\n\t\t\tString repr = \"\";\n\t\t\tint found = 0;\n\t\t\twhile (r < N) {\n\t\t\t\twhile (r < N) {\n\t\t\t\t\tif (key[input[r]] >= 0) {\n\t\t\t\t\t\tif (count[key[input[r]]] == 0) ++found;\n\t\t\t\t\t\tcount[key[input[r]]]++;\n\t\t\t\t\t\tif (found == keys.length()) break;\n\t\t\t\t\t}\n\t\t\t\t\t++r;\n\t\t\t\t}\n\t\t\t\tif (r == N) break;\n\t\t\t\twhile (true) {\n\t\t\t\t\tif (key[input[l]] >= 0) {\n\t\t\t\t\t\t--count[key[input[l]]];\n\t\t\t\t\t\tif (count[key[input[l]]] == 0) {\n\t\t\t\t\t\t\t--found;\n\t\t\t\t\t\t\tif (r - l + 1 < ans) {\n\t\t\t\t\t\t\t\tans = r - l + 1;\n\t\t\t\t\t\t\t\tansC = 1;\n\t\t\t\t\t\t\t\trepr = String.valueOf(input, l, r - l + 1);\n\t\t\t\t\t\t\t} else if (r - l + 1 == ans) {\n\t\t\t\t\t\t\t\t++ansC;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t++l;\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\t++l;\n\t\t\t\t}\n\t\t\t\t++r;\n\t\t\t}\n\n\t\t\tif (ansC == 0) {\n\t\t\t\tSystem.out.println(0);\n\t\t\t} else {\n\t\t\t\tSystem.out.println(ansC);\n\t\t\t\tStringBuilder result = new StringBuilder();\n\t\t\t\tfor (int i = 0; i < repr.length(); ++i) {\n\t\t\t\t\tif (i % 72 == 0) {\n\t\t\t\t\t\tresult.append('\\n');\n\t\t\t\t\t}\n\t\t\t\t\tresult.append(repr.charAt(i));\n\t\t\t\t}\n\t\t\t\tSystem.out.println(result);\n\t\t\t}\n\t\t\tSystem.out.println();\n\t\t\tif (!sc.hasNext()) break;\n\t\t\tsc.nextLine();\n\t\t}\n\t}\n\n}", "python": null }

[ { "input": { "stdin": "10 3\n3 7\n8 9\n2 5" }, "output": { "stdout": "23" } }, { "input": { "stdin": "9 3\n7 0\n5 7\n1 2" }, "output": { "stdout": "16\n" } }, { "input": { "stdin": "10 2\n4 8\n8 9\n4 8" }, "output": { "stdout": "21\n" } }, { "input": { "stdin": "10 3\n3 7\n8 9\n3 5" }, "output": { "stdout": "21\n" } }, { "input": { "stdin": "10 2\n2 8\n2 9\n4 3" }, "output": { "stdout": "25\n" } }, { "input": { "stdin": "21 3\n3 7\n7 17\n1 5" }, "output": { "stdout": "54\n" } }, { "input": { "stdin": "29 3\n3 9\n7 9\n1 5" }, "output": { "stdout": "46\n" } }, { "input": { "stdin": "17 3\n3 8\n1 9\n3 10" }, "output": { "stdout": "36\n" } }, { "input": { "stdin": "19 3\n2 10\n1 15\n1 10" }, "output": { "stdout": "48\n" } }, { "input": { "stdin": "10 3\n4 7\n9 9\n3 10" }, "output": { "stdout": "25\n" } }, { "input": { "stdin": "5 3\n2 4\n3 4\n1 1" }, "output": { "stdout": "10\n" } }, { "input": { "stdin": "14 3\n3 8\n8 9\n3 10" }, "output": { "stdout": "29\n" } }, { "input": { "stdin": "20 3\n1 13\n8 9\n4 8" }, "output": { "stdout": "45\n" } }, { "input": { "stdin": "18 3\n3 4\n8 9\n6 16" }, "output": { "stdout": "41\n" } }, { "input": { "stdin": "10 3\n3 7\n9 9\n3 10" }, "output": { "stdout": "25\n" } }, { "input": { "stdin": "10 3\n3 7\n8 10\n4 5" }, "output": { "stdout": "23\n" } }, { "input": { "stdin": "10 3\n3 1\n7 9\n2 5" }, "output": { "stdout": "21\n" } }, { "input": { "stdin": "9 3\n3 7\n8 9\n1 5" }, "output": { "stdout": "24\n" } }, { "input": { "stdin": "18 3\n3 7\n7 9\n2 5" }, "output": { "stdout": "33\n" } }, { "input": { "stdin": "10 3\n3 7\n8 9\n1 5" }, "output": { "stdout": "25\n" } }, { "input": { "stdin": "10 3\n3 10\n9 9\n2 4" }, "output": { "stdout": "27\n" } }, { "input": { "stdin": "19 3\n3 10\n3 9\n1 5" }, "output": { "stdout": "38\n" } }, { "input": { "stdin": "6 3\n3 4\n3 4\n1 1" }, "output": { "stdout": "9\n" } }, { "input": { "stdin": "10 3\n4 8\n8 9\n3 8" }, "output": { "stdout": "23\n" } }, { "input": { "stdin": "10 3\n3 1\n3 9\n2 5" }, "output": { "stdout": "25\n" } }, { "input": { "stdin": "10 3\n3 6\n9 9\n2 4" }, "output": { "stdout": "19\n" } }, { "input": { "stdin": "10 3\n1 10\n9 9\n2 10" }, "output": { "stdout": "29\n" } }, { "input": { "stdin": "18 3\n3 9\n13 17\n1 5" }, "output": { "stdout": "43\n" } }, { "input": { "stdin": "15 3\n6 7\n10 10\n4 5" }, "output": { "stdout": "20\n" } }, { "input": { "stdin": "10 3\n2 8\n8 9\n3 8" }, "output": { "stdout": "25\n" } }, { "input": { "stdin": "10 3\n3 8\n8 9\n3 8" }, "output": { "stdout": "23\n" } }, { "input": { "stdin": "30 3\n3 8\n1 15\n3 10" }, "output": { "stdout": "59\n" } }, { "input": { "stdin": "18 3\n1 10\n9 9\n4 10" }, "output": { "stdout": "37\n" } }, { "input": { "stdin": "10 2\n3 8\n2 9\n4 3" }, "output": { "stdout": "25\n" } }, { "input": { "stdin": "15 3\n3 10\n10 12\n4 5" }, "output": { "stdout": "34\n" } }, { "input": { "stdin": "10 3\n5 7\n8 9\n3 8" }, "output": { "stdout": "23\n" } }, { "input": { "stdin": "15 3\n3 7\n10 10\n4 5" }, "output": { "stdout": "24\n" } }, { "input": { "stdin": "10 3\n3 7\n8 9\n3 10" }, "output": { "stdout": "25\n" } }, { "input": { "stdin": "10 3\n3 7\n6 9\n1 5" }, "output": { "stdout": "27\n" } }, { "input": { "stdin": "15 3\n3 7\n8 10\n4 5" }, "output": { "stdout": "28\n" } }, { "input": { "stdin": "10 3\n3 7\n7 9\n2 5" }, "output": { "stdout": "25\n" } }, { "input": { "stdin": "29 3\n3 9\n3 9\n2 4" }, "output": { "stdout": "44\n" } }, { "input": { "stdin": "10 3\n3 7\n5 9\n1 5" }, "output": { "stdout": "27\n" } }, { "input": { "stdin": "18 3\n3 9\n7 17\n1 5" }, "output": { "stdout": "51\n" } }, { "input": { "stdin": "22 3\n6 7\n7 16\n2 4" }, "output": { "stdout": "47\n" } }, { "input": { "stdin": "31 3\n3 10\n3 9\n1 3" }, "output": { "stdout": "50\n" } }, { "input": { "stdin": "10 3\n4 8\n8 7\n1 8" }, "output": { "stdout": "25\n" } }, { "input": { "stdin": "18 3\n3 7\n7 11\n1 5" }, "output": { "stdout": "39\n" } }, { "input": { "stdin": "10 3\n3 7\n4 9\n4 5" }, "output": { "stdout": "23\n" } }, { "input": { "stdin": "10 3\n3 7\n9 9\n2 10" }, "output": { "stdout": "27\n" } } ]

{ "tags": [], "title": "Shopping" }

{ "cpp": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int n,m;\n cin>>n>>m;\n vector<int> pos(n+1,1);\n for(int i=0;i<m;i++){\n int c,d;\n cin>>c>>d;\n for(int j=c;j<d;j++) pos[j]=3;\n }\n cout<<accumulate(pos.begin(),pos.end(),0)<<endl;\n \n return 0;\n}\n", "java": "import java.util.BitSet;\nimport java.util.Scanner;\n\npublic class Main {\n\tstatic Scanner sc = new Scanner(System.in);\n\n\tpublic static void main(String[] args) {\n\t\tint N = sc.nextInt();\n\t\tint M = sc.nextInt();\n\t\tBitSet bs = new BitSet(N + 1);\n\t\tfor (int i = 0; i < M; ++i) {\n\t\t\tint C = sc.nextInt();\n\t\t\tint D = sc.nextInt();\n\t\t\tbs.set(C, D);\n\t\t}\n\t\tSystem.out.println(N + 1 + bs.cardinality() * 2);\n\t}\n\n}", "python": "N, m = map(int, input().split())\nv = [0]*N\nfor i in range(m):\n c, d = map(int, input().split())\n v[c-1] += 1\n v[d-1] -= 1\ns = 0; fst = 0\nans = N+1\nfor i in range(N):\n if s == 0 and v[i] > 0:\n fst = i\n s += v[i]\n if s == 0 and v[i] < 0:\n ans += (i - fst)*2\nprint(ans)" }

[ { "input": { "stdin": "10 3\n2 5 7" }, "output": { "stdout": "3" } }, { "input": { "stdin": "100000 1\n1" }, "output": { "stdout": "99999" } }, { "input": { "stdin": "10 5\n2 5 6 8 10" }, "output": { "stdout": "1" } }, { "input": { "stdin": "3 2\n1 3" }, "output": { "stdout": "1" } }, { "input": { "stdin": "010001 1\n4" }, "output": { "stdout": "9997\n" } }, { "input": { "stdin": "27 5\n4 6 6 8 10" }, "output": { "stdout": "17\n" } }, { "input": { "stdin": "3 1\n2 2 12" }, "output": { "stdout": "1\n" } }, { "input": { "stdin": "10 3\n1 5 7" }, "output": { "stdout": "3\n" } }, { "input": { "stdin": "3 1\n1 3 12" }, "output": { "stdout": "2\n" } }, { "input": { "stdin": "8 2\n3 3 14" }, "output": { "stdout": "5\n" } }, { "input": { "stdin": "4 1\n3 -1 8" }, "output": { "stdout": "2\n" } }, { "input": { "stdin": "25 1\n4 6 7" }, "output": { "stdout": "21\n" } }, { "input": { "stdin": "20 1\n1 3 11" }, "output": { "stdout": "19\n" } }, { "input": { "stdin": "30 2\n2 2 8" }, "output": { "stdout": "28\n" } }, { "input": { "stdin": "25 1\n2 0 3" }, "output": { "stdout": "23\n" } }, { "input": { "stdin": "110000 1\n4" }, "output": { "stdout": "109996\n" } }, { "input": { "stdin": "8 3\n2 2 7" }, "output": { "stdout": "2\n" } }, { "input": { "stdin": "10 1\n3 -1 8" }, "output": { "stdout": "7\n" } }, { "input": { "stdin": "10 1\n2 2 8" }, "output": { "stdout": "8\n" } }, { "input": { "stdin": "100001 1\n1" }, "output": { "stdout": "100000\n" } }, { "input": { "stdin": "10 3\n2 5 9" }, "output": { "stdout": "2\n" } }, { "input": { "stdin": "8 2\n2 6 4" }, "output": { "stdout": "2\n" } }, { "input": { "stdin": "8 2\n2 2 8" }, "output": { "stdout": "6\n" } }, { "input": { "stdin": "8 2\n2 2 15" }, "output": { "stdout": "6\n" } }, { "input": { "stdin": "11 1\n2 0 29" }, "output": { "stdout": "9\n" } }, { "input": { "stdin": "10 3\n4 5 8" }, "output": { "stdout": "3\n" } }, { "input": { "stdin": "10 2\n2 2 12" }, "output": { "stdout": "8\n" } }, { "input": { "stdin": "001000 1\n2" }, "output": { "stdout": "998\n" } }, { "input": { "stdin": "10 3\n4 5 7" }, "output": { "stdout": "3\n" } }, { "input": { "stdin": "25 1\n5 6 7" }, "output": { "stdout": "20\n" } }, { "input": { "stdin": "110000 1\n2" }, "output": { "stdout": "109998\n" } }, { "input": { "stdin": "11 1\n2 0 38" }, "output": { "stdout": "9\n" } }, { "input": { "stdin": "110001 1\n1" }, "output": { "stdout": "110000\n" } }, { "input": { "stdin": "54 1\n7 1 0" }, "output": { "stdout": "47\n" } }, { "input": { "stdin": "010000 1\n2" }, "output": { "stdout": "9998\n" } }, { "input": { "stdin": "10 1\n3 0 8" }, "output": { "stdout": "7\n" } }, { "input": { "stdin": "011000 1\n2" }, "output": { "stdout": "10998\n" } }, { "input": { "stdin": "8 2\n3 3 8" }, "output": { "stdout": "5\n" } }, { "input": { "stdin": "0 1\n1 3 12" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "10 3\n2 2 7" }, "output": { "stdout": "3\n" } }, { "input": { "stdin": "0 1\n1 3 3" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "11 1\n2 0 31" }, "output": { "stdout": "9\n" } }, { "input": { "stdin": "39 5\n0 6 7 4 13" }, "output": { "stdout": "26\n" } }, { "input": { "stdin": "9 2\n2 3 19" }, "output": { "stdout": "6\n" } }, { "input": { "stdin": "13 2\n2 6 4" }, "output": { "stdout": "7\n" } }, { "input": { "stdin": "33 1\n2 0 29" }, "output": { "stdout": "31\n" } }, { "input": { "stdin": "100001 1\n2" }, "output": { "stdout": "99999\n" } }, { "input": { "stdin": "7 1\n2 3 12" }, "output": { "stdout": "5\n" } }, { "input": { "stdin": "6 2\n1 3" }, "output": { "stdout": "3\n" } }, { "input": { "stdin": "12 1\n2 0 29" }, "output": { "stdout": "10\n" } } ]

{ "tags": [], "title": "Gossip" }

{ "cpp": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\n\nint n,m;\nint a[100001];\n\nint main(void){\n\tscanf(\"%d%d\",&n,&m);\n\tfor(int i=0;i<m;i++){\n\t\tscanf(\"%d\",&a[i]);\n\t}\n\tint ans=max(a[0]-1,n-a[m-1]);\n\tfor(int i=0;i<m-1;i++){\n\t\tans=max(ans,(a[i+1]-a[i])/2);\n\t}\n\tprintf(\"%d\\n\",ans);\n\treturn 0;\n}\n", "java": "import java.util.BitSet;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner in = new Scanner(System.in);\n\t\tint n = in.nextInt();\n\t\tint m = in.nextInt();\n//\t\tint[] a = new int[n];\n\t\tBitSet bs = new BitSet(n);\n\t\tfor(int i=0; i<m; i++){\n//\t\t\ta[in.nextInt()] = 1;\n\t\t\tbs.set(in.nextInt()-1);\n\t\t}\n\t\tint bf = -1;\n\t\tint[] dist = new int[n];\n\t\tfor(int i=0; i<n; i++){\n\t\t\tif(bs.get(i)) bf = i;\n\t\t\tif(bf>=0){\n\t\t\t\tdist[i] = Math.abs(i-bf);\n\t\t\t}else{\n\t\t\t\tdist[i] = Integer.MAX_VALUE;\n\t\t\t}\n\t\t}\n\t\tbf = -1;\n\t\tfor(int i=n-1; i>=0; i--){\n\t\t\tif(bs.get(i)) bf = i;\n\t\t\tif(bf>=0){\n\t\t\t\tdist[i] = Math.min(dist[i], Math.abs(i-bf));\n\t\t\t}\n\t\t}\n\t\tint max = 0;\n\t\tfor(int i=0; i<n; i++){\n\t\t\t\n\t\t}\n\t\tfor(int i=0; i<n; i++) max = Math.max(max, dist[i]);\n\t\tSystem.out.println(max);\n\t}\n}", "python": "n,m=map(int,input().split(\" \"))\na=list(map(int,input().split(\" \")))\nprint(max(a[0]-1,n-a[-1],*[(a[i+1]-a[i])//2 for i in range(m-1)]))\n" }

[ { "input": { "stdin": "2\n1 2\n1\n42 3.141592653589793\n5 20\n3\n0 307.09242465218927\n180 307.09242465218927\n90 728.30573874452591" }, "output": { "stdout": "2.0 3.141592653589793\n8.660254038 5.235987756" } }, { "input": { "stdin": "2\n0 2\n1\n110 3.816742061710842\n9 12\n3\n0 307.5927891462846\n180 307.09242465218927\n10 729.0379080118104" }, "output": { "stdout": "0.000000000 0.000000000\n30.505009819 18.243431403\n" } }, { "input": { "stdin": "2\n0 2\n1\n011 3.141592653589793\n9 12\n3\n0 307.72811058415374\n323 307.2810596432779\n12 729.0569081334113" }, "output": { "stdout": "0.000000000 0.000000000\n19.247945503 27.038223181\n" } }, { "input": { "stdin": "2\n5 1\n2\n100 4.124598176228163\n0 23\n1\n0 309.2417873290388\n286 308.4763924752612\n16 728.5208442862868" }, "output": { "stdout": "14.449872514 13.283642950\n0.000000000 0.000000000\n" } }, { "input": { "stdin": "2\n2 2\n1\n010 4.124598176228163\n9 19\n3\n0 307.5927891462846\n180 307.63440833597326\n16 728.30573874452591" }, "output": { "stdout": "3.319045179 8.651651207\n27.394461238 24.569093176\n" } }, { "input": { "stdin": "2\n1 -1\n1\n77 3.141592653589793\n6 5\n2\n0 307.09242465218927\n180 307.09242465218927\n176 728.30573874452591" }, "output": { "stdout": "0.000000000 6.283185307\n0.000000000 0.000000000\n" } }, { "input": { "stdin": "2\n2 2\n1\n110 3.141592653589793\n9 21\n3\n1 307.09242465218927\n349 308.715611732413\n99 729.1503502526365" }, "output": { "stdout": "3.091019452 9.033690041\n27.966745638 24.530310693\n" } }, { "input": { "stdin": "2\n0 2\n1\n110 3.4019268428385048\n9 18\n3\n0 307.09242465218927\n180 307.09242465218927\n16 728.4943209482232" }, "output": { "stdout": "0.000000000 0.000000000\n27.766527976 23.912492629\n" } }, { "input": { "stdin": "2\n0 2\n1\n010 3.141592653589793\n9 20\n3\n0 308.006261305751\n180 307.09242465218927\n10 729.0834454689399" }, "output": { "stdout": "0.000000000 0.000000000\n27.032160545 25.184550955\n" } }, { "input": { "stdin": "2\n2 2\n1\n010 4.726766519582276\n10 6\n3\n-1 307.5927891462846\n180 307.09242465218927\n6 728.30573874452591" }, "output": { "stdout": "3.432270717 8.440390659\n36.503853950 10.336781805\n" } }, { "input": { "stdin": "2\n1 2\n1\n111 3.141592653589793\n6 20\n3\n-1 307.09242465218927\n228 308.008903398678\n10 728.30573874452591" }, "output": { "stdout": "2.000000000 3.141592654\n21.461360835 8.704652405\n" } }, { "input": { "stdin": "2\n1 2\n1\n110 3.141592653589793\n14 20\n3\n0 307.09242465218927\n180 307.09242465218927\n10 728.30573874452591" }, "output": { "stdout": "2.000000000 3.141592654\n32.738227787 52.638648671\n" } }, { "input": { "stdin": "2\n2 2\n1\n110 3.141592653589793\n9 20\n3\n0 307.09242465218927\n180 307.09242465218927\n90 728.30573874452591" }, "output": { "stdout": "3.091019452 9.033690041\n36.076344762 16.068660957\n" } }, { "input": { "stdin": "2\n0 2\n1\n110 3.141592653589793\n9 12\n3\n0 307.5927891462846\n180 307.09242465218927\n10 728.30573874452591" }, "output": { "stdout": "0.000000000 0.000000000\n30.503159735 18.250682771\n" } }, { "input": { "stdin": "2\n2 2\n1\n010 4.726766519582276\n10 6\n3\n-1 307.5927891462846\n180 307.09242465218927\n6 728.8776104990973" }, "output": { "stdout": "3.432270717 8.440390659\n36.503104330 10.327192012\n" } }, { "input": { "stdin": "2\n0 2\n1\n87 3.5673375683216078\n13 46\n3\n0 307.09242465218927\n180 307.09242465218927\n90 728.30573874452591" }, "output": { "stdout": "0.000000000 0.000000000\n33.095709056 47.424889592\n" } }, { "input": { "stdin": "2\n1 2\n1\n110 3.141592653589793\n9 20\n3\n0 307.09242465218927\n180 307.09242465218927\n90 728.30573874452591" }, "output": { "stdout": "2.000000000 3.141592654\n36.076344762 16.068660957\n" } }, { "input": { "stdin": "2\n2 2\n1\n110 4.726766519582276\n9 6\n3\n-1 307.5927891462846\n180 307.09242465218927\n10 728.30573874452591" }, "output": { "stdout": "3.432270717 8.440390659\n32.950519459 4.026506869\n" } }, { "input": { "stdin": "2\n2 2\n1\n111 3.141592653589793\n6 20\n3\n-1 307.09242465218927\n409 308.008903398678\n1 728.30573874452591" }, "output": { "stdout": "3.091019452 9.033690041\n12.132362496 15.957010239\n" } }, { "input": { "stdin": "2\n1 4\n1\n77 3.141592653589793\n6 20\n2\n0 307.09242465218927\n180 307.09242465218927\n176 728.30573874452591" }, "output": { "stdout": "1.829542035 3.973303847\n18.960738675 15.838491060\n" } }, { "input": { "stdin": "2\n1 2\n1\n111 3.141592653589793\n14 20\n3\n0 307.09242465218927\n180 308.008903398678\n10 728.30573874452591" }, "output": { "stdout": "2.000000000 3.141592654\n32.750818087 52.624315882\n" } }, { "input": { "stdin": "2\n1 2\n1\n010 4.124598176228163\n9 19\n3\n0 307.5927891462846\n180 307.63440833597326\n16 728.30573874452591" }, "output": { "stdout": "1.937352123 2.639685490\n27.394461238 24.569093176\n" } }, { "input": { "stdin": "2\n1 2\n1\n010 3.9792698447541954\n9 19\n3\n-1 307.5927891462846\n180 307.09242465218927\n24 728.30573874452591" }, "output": { "stdout": "1.954974075 2.716406149\n27.628891610 24.208660760\n" } }, { "input": { "stdin": "2\n1 2\n1\n110 3.816742061710842\n9 19\n3\n0 307.5927891462846\n180 307.09242465218927\n10 728.30573874452591" }, "output": { "stdout": "1.971024582 2.800736942\n27.388443719 24.576900620\n" } }, { "input": { "stdin": "2\n1 2\n1\n010 3.953901138661518\n9 19\n3\n0 307.5927891462846\n180 307.09242465218927\n10 728.30573874452591" }, "output": { "stdout": "1.957728188 2.729662728\n27.388443719 24.576900620\n" } }, { "input": { "stdin": "2\n2 2\n1\n111 3.141592653589793\n6 20\n3\n-1 307.09242465218927\n409 308.008903398678\n1 728.8703909518131" }, "output": { "stdout": "3.091019452 9.033690041\n12.130795128 15.954293929\n" } }, { "input": { "stdin": "2\n1 2\n1\n66 3.141592653589793\n8 20\n3\n0 307.09242465218927\n180 307.09242465218927\n90 728.30573874452591" }, "output": { "stdout": "2.000000000 3.141592654\n30.837608743 13.330556975\n" } }, { "input": { "stdin": "2\n0 2\n1\n66 3.5673375683216078\n8 23\n3\n0 307.09242465218927\n180 307.09242465218927\n90 728.30573874452591" }, "output": { "stdout": "0.000000000 0.000000000\n31.633195934 13.906817462\n" } }, { "input": { "stdin": "2\n0 2\n1\n001 3.141592653589793\n18 7\n3\n0 307.72811058415374\n292 307.2810596432779\n12 729.0569081334113" }, "output": { "stdout": "0.000000000 0.000000000\n46.091489282 60.232585110\n" } }, { "input": { "stdin": "2\n1 4\n1\n77 3.141592653589793\n6 5\n2\n0 307.09242465218927\n180 307.09242465218927\n176 728.30573874452591" }, "output": { "stdout": "1.829542035 3.973303847\n0.000000000 0.000000000\n" } }, { "input": { "stdin": "2\n-1 0\n1\n011 3.4019268428385048\n6 12\n2\n1 307.09242465218927\n31 307.94472345573325\n16 728.4943209482232" }, "output": { "stdout": "0.000000000 -0.000000000\n12.200963063 18.973483075\n" } }, { "input": { "stdin": "2\n1 2\n1\n010 3.816742061710842\n9 19\n3\n-1 307.5927891462846\n180 307.09242465218927\n24 728.30573874452591" }, "output": { "stdout": "1.971024582 2.800736942\n27.628891610 24.208660760\n" } }, { "input": { "stdin": "2\n1 2\n1\n010 3.9792698447541954\n9 6\n3\n-1 307.5927891462846\n303 307.09242465218927\n24 728.30573874452591" }, "output": { "stdout": "1.954974075 2.716406149\n13.428001422 12.316725970\n" } }, { "input": { "stdin": "2\n1 2\n1\n111 3.141592653589793\n2 20\n3\n-1 307.09242465218927\n228 308.008903398678\n10 728.30573874452591" }, "output": { "stdout": "2.000000000 3.141592654\n0.000000000 0.000000000\n" } }, { "input": { "stdin": "2\n5 1\n2\n100 4.124598176228163\n7 23\n1\n0 308.4447952797838\n286 308.4763924752612\n16 728.5208442862868" }, "output": { "stdout": "13.649432397 13.861031725\n0.000000000 0.000000000\n" } }, { "input": { "stdin": "2\n0 2\n1\n001 3.141592653589793\n18 7\n3\n0 307.72811058415374\n292 307.2810596432779\n16 729.0569081334113" }, "output": { "stdout": "0.000000000 0.000000000\n47.659004380 59.020197042\n" } }, { "input": { "stdin": "2\n0 2\n1\n010 3.141592653589793\n9 20\n3\n0 307.09242465218927\n180 307.09242465218927\n10 729.0561915676225" }, "output": { "stdout": "0.000000000 0.000000000\n27.028842348 25.191389331\n" } }, { "input": { "stdin": "2\n1 2\n1\n110 3.141592653589793\n9 20\n3\n0 307.09242465218927\n180 307.09242465218927\n10 728.30573874452591" }, "output": { "stdout": "2.000000000 3.141592654\n27.026193689 25.196844518\n" } }, { "input": { "stdin": "2\n0 0\n1\n110 3.4019268428385048\n6 18\n3\n1 307.09242465218927\n31 307.94472345573325\n16 728.4943209482232" }, "output": { "stdout": "0.000000000 0.000000000\n11.606334652 15.767335529\n" } }, { "input": { "stdin": "2\n2 2\n1\n110 3.141592653589793\n9 21\n3\n1 307.97409698310577\n349 308.715611732413\n99 729.1503502526365" }, "output": { "stdout": "3.091019452 9.033690041\n27.973442623 24.520213123\n" } }, { "input": { "stdin": "2\n4 2\n1\n110 3.141592653589793\n9 34\n3\n1 307.97409698310577\n349 308.715611732413\n99 729.1503502526365" }, "output": { "stdout": "4.102068632 20.825582428\n24.686876155 29.387241999\n" } }, { "input": { "stdin": "2\n0 2\n1\n010 3.141592653589793\n9 20\n3\n0 308.006261305751\n180 307.09242465218927\n10 729.0561915676225" }, "output": { "stdout": "0.000000000 0.000000000\n27.032064502 25.184748953\n" } }, { "input": { "stdin": "2\n-1 0\n2\n010 5.178901250757035\n2 19\n3\n0 307.5927891462846\n180 307.09242465218927\n4 729.0493647043663" }, "output": { "stdout": "0.000000000 -0.000000000\n0.000000000 0.000000000\n" } }, { "input": { "stdin": "2\n0 0\n1\n110 3.4019268428385048\n6 18\n3\n1 307.09242465218927\n31 307.09242465218927\n16 728.4943209482232" }, "output": { "stdout": "0.000000000 0.000000000\n11.608474463 15.775770048\n" } }, { "input": { "stdin": "2\n0 2\n1\n110 3.141592653589793\n9 18\n3\n0 307.09242465218927\n180 307.09242465218927\n10 728.30573874452591" }, "output": { "stdout": "0.000000000 0.000000000\n27.765880960 23.913944963\n" } }, { "input": { "stdin": "2\n1 2\n1\n42 3.141592653589793\n6 20\n3\n1 307.09242465218927\n180 307.09242465218927\n90 728.30573874452591" }, "output": { "stdout": "2.000000000 3.141592654\n18.009407340 8.023965285\n" } }, { "input": { "stdin": "2\n2 3\n1\n000 4.535969819027782\n7 19\n3\n0 308.28091824049136\n180 307.09242465218927\n10 728.30573874452591" }, "output": { "stdout": "3.059205799 9.083438240\n23.934617910 13.658627352\n" } }, { "input": { "stdin": "2\n2 3\n1\n100 4.535969819027782\n7 19\n3\n0 308.28091824049136\n180 308.04575249273665\n10 728.30573874452591" }, "output": { "stdout": "3.059205799 9.083438240\n23.943540243 13.645428182\n" } }, { "input": { "stdin": "2\n0 2\n1\n001 3.141592653589793\n9 7\n3\n0 307.72811058415374\n292 307.2810596432779\n12 729.0569081334113" }, "output": { "stdout": "0.000000000 0.000000000\n17.197597640 16.493660820\n" } }, { "input": { "stdin": "2\n0 0\n1\n110 3.4019268428385048\n9 18\n3\n1 307.09242465218927\n70 307.09242465218927\n16 728.4943209482232" }, "output": { "stdout": "0.000000000 0.000000000\n19.415415197 30.885390693\n" } } ]

{ "tags": [], "title": "Grated Radish" }

{ "cpp": "#include <stdio.h>\n#include <math.h>\n#include <iostream>\n#include <complex>\n#include <vector>\n#include <utility>\n#include <algorithm>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define mp make_pair\nconst double EPS = 1e-12;\nconst double pi = atan2(0.0, -1.0);\ntypedef complex<double> P;\n\ndouble norma(double t) {\n while (t < -pi) t += 2*pi;\n while (t > pi) t -= 2*pi;\n return t;\n}\n\ndouble cross(const P& a, const P& b) { return imag(conj(a)*b); }\ndouble dot(const P& a, const P& b) { return real(conj(a)*b); }\nP unit(const P& p) { return 1/abs(p)*p; }\nP unit(double a) { return P(cos(a), sin(a)); }\nP rot90(const P& p) { return p * P(0, 1); }\n\nint ccw(const P& a, P b, P c) {\n b -= a, c -= a;\n if (cross(b, c) > 0) return 1;\n if (cross(b, c) < 0) return -1;\n if (dot(b, c) < 0) return 2;\n if (norm(b) < norm(c)) return -2;\n return 0;\n}\n\nbool intersectLL(const P& l0, const P& l1, const P& m0, const P& m1) {\n return abs(cross(l1-l0, m1-m0)) > EPS;\n}\n\nP crosspoint(const P& l0, const P& l1, const P& m0, const P& m1) {\n const double a = cross(l1-l0, m1-m0);\n const double b = cross(l1-l0, l1-m0);\n if (abs(a) < EPS && abs(b) < EPS) return m0;\n if (abs(a) < EPS) throw 0;\n return m0 + b/a * (m1-m0);\n}\n\nstruct C {\n double R;\n vector<pair<double, double> > as;\n vector<pair<P, P> > es;\n C(double R) : R(R) {}\n};\n\nC empty(double R) {\n C c(R);\n c.as.push_back(mp(-pi, pi));\n return c;\n}\n\ndouble size(const C& c) {\n double t = 0;\n rep (i, c.as.size()) t += c.as[i].second - c.as[i].first;\n double s = c.R*c.R*(2*pi-t);\n rep (i, c.es.size()) s += cross(c.es[i].first, c.es[i].second);\n return s / 2;\n}\n\nC cut(const C& c, double dt, double t) {\n if (fabs(dt-pi) < EPS) return empty(c.R);\n C nc(c);\n const P p0 = c.R*unit(t-dt);\n const P p1 = c.R*unit(t+dt);\n const double a0 = norma(t-dt), a1 = norma(t+dt);\n if (a0 <= a1) nc.as.push_back(mp(a0, a1));\n else {\n nc.as.push_back(mp(-pi, a1));\n nc.as.push_back(mp(a0, pi));\n }\n sort(nc.as.begin(), nc.as.end());\n int m = 0;\n rep (i, nc.as.size()) {\n if (!m || nc.as[m-1].second < nc.as[i].first) nc.as[m++] = nc.as[i];\n else nc.as[m-1].second = max(nc.as[m-1].second, nc.as[i].second);\n }\n nc.as.resize(m);\n P s0 = p0, s1 = p1;\n rep (i, nc.es.size()) {\n if (!intersectLL(nc.es[i].first, nc.es[i].second, p0, p1)) {\n const int cc = ccw(nc.es[i].first, nc.es[i].second, p0);\n if (cc == -1) s0 = s1 = P(0, 0);\n else if (abs(cc) != 1) {\n if (dot(p1-p0, nc.es[i].second-nc.es[i].first) < -EPS) {\n return empty(c.R);\n }\n }\n continue;\n }\n const P cp = crosspoint(nc.es[i].first, nc.es[i].second, p0, p1);\n if (ccw(nc.es[i].first, nc.es[i].second, s0) == -1) s0 = cp;\n if (ccw(nc.es[i].first, nc.es[i].second, s1) == -1) s1 = cp;\n }\n rep (i, nc.es.size()) {\n if (!intersectLL(nc.es[i].first, nc.es[i].second, p0, p1)) {\n const int cc = ccw(p0, p1, nc.es[i].first);\n if (cc == -1) nc.es[i].first = nc.es[i].second = P(0, 0);\n else if (abs(cc) != 1) {\n if (dot(p1-p0, nc.es[i].second-nc.es[i].first) < -EPS) {\n return empty(c.R);\n }\n }\n continue;\n }\n const P cp = crosspoint(nc.es[i].first, nc.es[i].second, p0, p1);\n if (ccw(p0, p1, nc.es[i].first) == -1) nc.es[i].first = cp;\n if (ccw(p0, p1, nc.es[i].second) == -1) nc.es[i].second = cp;\n }\n nc.es.push_back(mp(s0, s1));\n m = 0;\n rep (i, nc.es.size()) {\n if (abs(nc.es[i].first - nc.es[i].second) > EPS) nc.es[m++] = nc.es[i];\n }\n nc.es.resize(m);\n return nc;\n}\n\nint main() {\n int T;\n scanf(\"%d\", &T);\n while (T--) {\n double R, L;\n scanf(\"%lf%lf\", &R, &L);\n int n;\n scanf(\"%d\", &n);\n C c(R);\n rep (i, n) {\n double t, V;\n scanf(\"%lf%lf\", &t, &V);\n t = norma(t/180*pi);\n const double s = size(c) - V/L;\n double l = 0, r = pi;\n rep (_, 100) {\n const double mid = (l+r) / 2;\n if (size(cut(c, mid, t)) < s) r = mid;\n else l = mid;\n }\n c = cut(c, l, t);\n }\n double ansT = 0;\n rep (i, c.as.size()) ansT += c.as[i].second - c.as[i].first;\n double ansE = 0;\n rep (i, c.es.size()) ansE += abs(c.es[i].second - c.es[i].first);\n printf(\"%.9f %.9f\\n\", ansE, R*(2*pi-ansT));\n }\n return 0;\n}", "java": null, "python": null }

[ { "input": { "stdin": "6 7\n.......\n...#...\n...#.S.\n...###.\n.G.....\n.......\n2\nLL\nDD" }, "output": { "stdout": "-1" } }, { "input": { "stdin": "7 6\n......\n.####.\n.####.\n...S#.\n...##.\n...##.\n.....G\n3\nLD\nDD\nLLL\n7 8\nS#......\n.#.####.\n.#.#G.#.\n.#.##.#.\n.#....#.\n.######.\n........\n8\nDDDD\nDDDU\nUUUU\nUUUD\nRRRR\nRRRL\nLLLL\nLLLR\n3 8\n\nS......G\n\n2\nU\nD\n6 10\n..........\n.S........\n..........\n..........\n........G.\n..........\n0\n6 7\n.......\n...#...\n...#.S.\n...###.\n.G.....\n.......\n2\nLL\nDD\n0 0" }, "output": { "stdout": "13\n60\n7\n10\n-1" } }, { "input": { "stdin": "3 8\n\nS......G\n\n2\nU\nD" }, "output": { "stdout": "7" } }, { "input": { "stdin": "6 10\n..........\n.S........\n..........\n..........\n........G.\n..........\n0" }, "output": { "stdout": "10" } }, { "input": { "stdin": "7 6\n......\n.####.\n.####.\n...S#.\n...##.\n...##.\n.....G\n3\nLD\nDD\nLLL\n7 8\nS#......\n.#.####.\n.#.#G.#.\n.#.##.#.\n.#....#.\n.######.\n........\n8\nDDDD\nDDDU\nUUUU\nUUUD\nRRRR\nRRRL\nLLLL\nLLLR\n3 8\n########\nS......G\n########\n2\nU\nD\n6 10\n..........\n.S........\n..........\n..........\n........G.\n..........\n0\n6 7\n.......\n...#...\n...#.S.\n...###.\n.G.....\n.......\n2\nLL\nDD\n0 0" }, "output": { "stdout": "13\n60\n7\n10\n-1" } }, { "input": { "stdin": "7 6\n......\n.####.\n.####.\n...S#.\n...##.\n...##.\n.....G\n3\nLD\nDD\nLLL" }, "output": { "stdout": "13" } }, { "input": { "stdin": "7 8\nS#......\n.#.####.\n.#.#G.#.\n.#.##.#.\n.#....#.\n.######.\n........\n8\nDDDD\nDDDU\nUUUU\nUUUD\nRRRR\nRRRL\nLLLL\nLLLR" }, "output": { "stdout": "60" } }, { "input": { "stdin": "7 6\n......\n.####.\n.####.\n...S#.\n...##.\n.##...\n.....G\n3\nLD\nDD\nLLL\n7 8\nS#......\n.#.####.\n.#.#G.#.\n.#.##.#.\n.#....#.\n.######.\n........\n8\nDDDD\nDDDU\nUUUU\nUUUD\nRRRR\nRRRL\nLLLL\nLLLR\n3 8\n\nS......G\n\n3\nU\nE\n6 10\n..........\n.S........\n..........\n..........\n........G.\n..........\n0\n6 7\n.......\n...#...\n...#.S.\n...###.\n.G.....\n.......\n2\nLL\nDD\n0 0" }, "output": { "stdout": "-1\n60\n7\n" } }, { "input": { "stdin": "7 6\n.-....\n.####.\n.####.\n...S#.\n...##.\n...##.\n.....F\n3\nLD\nDD\nLLL\n7 8\nS#......\n.#.####.\n.#.#G.#.\n.#.##.#.\n.#....#.\n.######.\n........\n8\nDDDD\nDDDU\nUUUU\nUUUD\nRRRR\nRRRL\nLLLL\nLLLR\n3 8\n\nS......G\n\n2\nU\nD\n6 10\n..........\n.S........\n..........\n..........\n........G.\n..........\n0\n6 7\n.......\n...#...\n...#.S.\n...###.\n.G.....\n.......\n2\nLL\nDD\n0 0" }, "output": { "stdout": "-1\n60\n7\n" } }, { "input": { "stdin": "8 8\nS#......\n.#.####.\n.#.#G.#.\n.#.##.#.\n.\"....#.\n.######.\n........\n8\nDDDD\nDDDU\nUUUU\nDUUU\nRRRR\nRRRL\nLLLL\nLLLR" }, "output": { "stdout": "12\n" } }, { "input": { "stdin": "6 10\n..../.....\n.S........\n...-......\n..........\n.......-G.\n..........\n0" }, "output": { "stdout": "10\n" } }, { "input": { "stdin": "4 9\n...../....\n.S..../...\n...-......\n..........\n.G........\n..........\n0" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "2 8\n\nS......G\n\n3\nU\nD" }, "output": { "stdout": "7\n" } }, { "input": { "stdin": "6 7\n.......\n...#...\n0..#.S.\n..##.#.\n.G.....\n.......\n2\nLL\nDD" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "8 8\nS#......\n.#.####.\n.#.#G.#.\n#..##.#.\n.\"....#.\n.######.\n........\n8\nDDDD\nDDDU\nUUUU\nDUUU\nRRRR\nRRRL\nLLLL\nLLLR" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "9 8\nS#......\n.#.####.\n.#.#G.#.\n#..##.#.\n.\"....#.\n.###$##.\n........\n8\nDDDD\nDDDU\nUUUU\nDUUU\nRRRR\nRRRL\nLLLL\nLLLR" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "9 8\nS.\".....\n.####.#.\n.#.#G.#.\n#..##.#/\n.\"....#.\n.##$###.\n........\n8\nDDDD\nDDDU\nUUUV\nDUUU\nRRRR\nRRRL\nLLLL\nLLRL" }, "output": { "stdout": "8\n" } }, { "input": { "stdin": "7 8\nS#......\n.#.####.\n.#.#.G#.\n.#.##.#.\n.#....#.\n.#\"####.\n........\n8\nDDDD\nDDDU\nUUUU\nUUUD\nRRRR\nRRRL\nLLLL\nLLLR" }, "output": { "stdout": "21\n" } }, { "input": { "stdin": "9 8\nS\"......\n.#.####.\n.#.#G.#.\n#..##.#.\n.\"....#.\n.##$###.\n........\n8\nDDDD\nDDDU\nUUUV\nDUUU\nRRRR\nRRRL\nLLLL\nLLRL" }, "output": { "stdout": "12\n" } }, { "input": { "stdin": "9 8\nS.\"./...\n.#.####-\n.#.#G.#.\n#..##.#/\n.\"....#.\n.##$###.\n........\n8\nDDDD\nDDDU\nUUUV\nDUUU\nRRRR\nRRRL\nLLLL\nLLRM" }, "output": { "stdout": "12\n" } }, { "input": { "stdin": "6 10\n..../.....\n........S.\n...-......\n..........\n.G........\n..........\n0" }, "output": { "stdout": "10\n" } }, { "input": { "stdin": "3 8\n\nS.../..G\n\n0\nU\nD" }, "output": { "stdout": "7\n" } }, { "input": { "stdin": "7 6\n......\n.####.\n.####.\n...S#.\n...##.\n.##...\n.....G\n3\nLD\nDD\nLLL\n7 8\nS#......\n.#.####.\n.#.#G.#.\n.#.##.#.\n.#....#.\n.#$####.\n........\n8\nDDDD\nDDDU\nUUUU\nUUUD\nRRRR\nRRRL\nLLLL\nLLLR\n3 8\n\nS......G\n\n3\nU\nE\n6 10\n..........\n.S........\n..........\n..........\n........G.\n..........\n-1\n6 7\n.......\n...#...\n...$.S.\n...###.\n.G.....\n.......\n2\nLL\nDD\n-1 0" }, "output": { "stdout": "-1\n22\n7\n" } }, { "input": { "stdin": "7 6\n......\n.####.\n.####.\n...S#.\n...##.\n.##...\n.....G\n3\nLD\nDD\nLLL\n7 8\nS#......\n.#.####.\n.#.#G.#.\n.#.##.#.\n.#....#.\n.######.\n........\n8\nDDDD\nDDDU\nUUUU\nUUUD\nRRRR\nRRRL\nLLLL\nLLLR\n3 8\n\nS......G\n\n3\nU\nE\n6 10\n..........\n.S........\n..........\n..........\n........G.\n..........\n0\n6 7\n.......\n...#...\n...#.S.\n...###.\n.G.....\n.......\n2\nLL\nDD\n0 1" }, "output": { "stdout": "-1\n60\n7\n" } }, { "input": { "stdin": "6 10\n..........\n.S........\n...-......\n..........\n...../..G.\n..........\n0" }, "output": { "stdout": "10\n" } }, { "input": { "stdin": "4 9\n..../.....\n.S........\n...-......\n..........\n........G.\n..........\n0" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "4 9\n..../.....\n.S........\n...-......\n..........\n.G........\n..........\n0" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "9 8\nS\"......\n.#.####.\n.#.#G.#.\n#..##.#.\n.\"....#.\n.###$##.\n........\n8\nDDDD\nDDDU\nUUUU\nDUUU\nRRRR\nRRRL\nLLLL\nLLLR" }, "output": { "stdout": "12\n" } }, { "input": { "stdin": "7 6\n......\n.####.\n.####.\n...S#.\n...##.\n.##...\n.....G\n3\nLD\nDD\nLLL\n7 8\nS#......\n.#.####.\n.#.#G.#.\n.#.##.#.\n.#....#.\n.######.\n........\n8\nDDDD\nDDDU\nUUUU\nUUUD\nRRRR\nRRRL\nLKLL\nLLLR\n3 8\n\nS......G\n\n2\nU\nD\n6 10\n..........\n.S........\n..........\n..........\n........G.\n..........\n0\n6 7\n.......\n...#...\n...#.S.\n...###.\n.G.....\n.......\n2\nLL\nDD\n0 0" }, "output": { "stdout": "-1\n56\n7\n" } }, { "input": { "stdin": "7 6\n......\n.####.\n.####.\n...S#.\n...##.\n...##.\n.....G\n3\nLD\nDD\nLLL\n7 8\nS#......\n.#.####.\n.#.#G.#.\n.#.##.#.\n.#....#.\n.######.\n........\n8\nDDDD\nUDDD\nUUUU\nUUUD\nRRRR\nRRRL\nLLLL\nLLLR\n3 8\n########\nS......G\n########\n2\nU\nD\n6 10\n..........\n.S........\n..........\n..........\n........G.\n..........\n0\n6 7\n.......\n...#...\n...#.S.\n...###.\n.G.....\n.......\n2\nLL\nDD\n0 0" }, "output": { "stdout": "13\n60\n7\n10\n-1\n" } }, { "input": { "stdin": "7 6\n......\n.####.\n.####.\n...S#-\n...##.\n...##.\n.....G\n0\nLD\nDD\nLLL" }, "output": { "stdout": "7\n" } }, { "input": { "stdin": "8 8\nS#......\n.#.####.\n.#.#G.#.\n.#.##.#.\n.\"....#.\n.######.\n........\n8\nCDDD\nDDDU\nUUUU\nDUUU\nRRRR\nRRRL\nLLLL\nLLLR" }, "output": { "stdout": "12\n" } }, { "input": { "stdin": "7 8\nS#......\n.#.####.\n.#.#G.#.\n.#.##.#.\n.#....#.\n.######.\n........\n8\nDDDD\nDDDU\nUUUU\nDUUU\nRRRR\nRRRL\nLLLL\nLLLR" }, "output": { "stdout": "60\n" } }, { "input": { "stdin": "9 8\nS\"......\n.###\".#.\n.#.#G.#.\n#..##.#.\n.\"....#.\n.##$###.\n........\n8\nDDDD\nDDDU\nTUUV\nDUUU\nRRRR\nRRRL\nLLLL\nLLRL" }, "output": { "stdout": "6\n" } }, { "input": { "stdin": "9 8\nS\"......\n.#.####.\n.#.#G.#.\n#..##.#.\n.\"....#.\n.###$##.\n........\n8\nDDDD\nDDDU\nUUUV\nDUUU\nRRRR\nRRRK\nLLLL\nLLLR" }, "output": { "stdout": "12\n" } }, { "input": { "stdin": "7 8\nS#......\n.#.####.\n.#.#G.#.\n.#.##.#.\n.#....#.\n.#\"####.\n........\n8\nDDDD\nDDDU\nUUUU\nUUUD\nRRRR\nRRRL\nLLLL\nLLLR" }, "output": { "stdout": "22\n" } }, { "input": { "stdin": "4 10\n..../.....\n.S........\n...-......\n..........\n........G.\n..........\n0" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "15 8\n.....\".S\n-####.#.\n.#\"#G...\n#..#$.#/\n.\"....#.\n.##$###.\n.......-\n8\nDDDD\nDDDU\nUUUV\nUUDU\nRRRR\nRRRL\nLMLL\nLLRM" }, "output": { "stdout": "5\n" } }, { "input": { "stdin": "2 12\n\nS......G\n\n3\nU\nD" }, "output": { "stdout": "7\n" } }, { "input": { "stdin": "7 6\n......\n.####.\n.####.\n...S#.\n...##.\n.##...\n.....G\n3\nLD\nDD\nLLL\n7 8\nS#......\n.#.####.\n.#.#G.#.\n.#.##.#.\n.#....#.\n.######.\n........\n8\nDDDD\nDDDU\nUUUU\nUUUD\nRRRR\nRRRL\nLLLL\nLLLR\n3 8\n\nS......G\n\n3\nU\nE\n6 10\n..........\n.S........\n..........\n..........\n........G.\n..........\n-1\n6 7\n.......\n...#...\n...#.S.\n...###.\n.G.....\n.......\n2\nLL\nDD\n-1 0" }, "output": { "stdout": "-1\n60\n7\n" } }, { "input": { "stdin": "9 8\nS\"......\n.#.####.\n.#.#G.#.\n#..##.#.\n.\"....#.\n.##$###.\n........\n8\nDDDD\nDDDU\nUUUV\nDUUU\nQRRR\nRRRL\nLLLL\nLLLR" }, "output": { "stdout": "12\n" } }, { "input": { "stdin": "8 8\nS#......\n.#.####.\n.#.#G.#.\n.#.##.#.\n.#....#.\n.######.\n........\n8\nDDDE\nDDDU\nUUUU\nDUUU\nRRRR\nRRRL\nLLLL\nLLLR" }, "output": { "stdout": "34\n" } }, { "input": { "stdin": "15 8\nS.\".....\n-####.#.\n.#.#G.#.\n#..#$.#/\n.\"....#.\n.##$###.\n.......-\n8\nDDDD\nDDDU\nUUUV\nUUDU\nRRRR\nRRRL\nLMLL\nLLRM" }, "output": { "stdout": "8\n" } }, { "input": { "stdin": "9 8\nS.\".....\n-####.#.\n.#.#G.#.\n#..#$.#/\n.\"....#.\n.##$###.\n.......-\n8\nDDDD\nDEDU\nUUUV\nDUUU\nRRRR\nRRRL\nLMLL\nLLRM" }, "output": { "stdout": "8\n" } }, { "input": { "stdin": "7 6\n......\n.####.\n.####.\n...S#-\n...##.\n...##.\n.....G\n3\nLD\nDD\nLLL" }, "output": { "stdout": "13\n" } }, { "input": { "stdin": "9 8\nS.\".....\n-####.#.\n.#.#G.#.\n#..#$.#/\n.\"....#.\n.##$###.\n........\n8\nDDDD\nDDCU\nUUUV\nDUUU\nRRRR\nRRRL\nLLLL\nLLRM" }, "output": { "stdout": "8\n" } }, { "input": { "stdin": "9 8\nS.\".....\n-####.#.\n.#.#G.#.\n#..##.#/\n.\"....#.\n.##$###.\n........\n8\nDDDD\nDDDU\nUUUV\nDUUU\nRRRR\nRRRL\nLLLL\nLLRM" }, "output": { "stdout": "8\n" } }, { "input": { "stdin": "7 6\n......\n.####.\n.####.\n...S#.\n...##.\n.##...\n.....G\n3\nLD\nDD\nLLL\n7 8\nS#......\n.#.####.\n.#.#G.#.\n.#.##.#.\n.#....#.\n.######.\n........\n8\nDDDD\nDDDU\nUUUU\nUUUD\nRRRR\nRRRL\nLLLL\nLLLR\n3 8\n\nS......G\n\n3\nU\nD\n6 10\n..........\n.S........\n..........\n..........\n........G.\n..........\n0\n6 7\n.......\n...#...\n...#.S.\n...###.\n.....G.\n.......\n2\nLL\nDD\n0 0" }, "output": { "stdout": "-1\n60\n7\n" } }, { "input": { "stdin": "2 13\n\nS......G\n\n2\nU\nD" }, "output": { "stdout": "7\n" } }, { "input": { "stdin": "6 10\n..........\n.S........\n...-......\n..........\n........G.\n..........\n0" }, "output": { "stdout": "10\n" } } ]

{ "tags": [], "title": "Stolen Jewel" }

{ "cpp": "#include <string>\n#include <vector>\n#include <queue>\n#include <cassert>\n#include <numeric>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nclass AhoCorasick{\n static const int ASIZE = 256;\n \n struct node_t {\n int ID;\n node_t *failure;\n node_t *output;\n node_t *next[ASIZE];\n std::vector<int> match;\n \n node_t(int id) : ID(id), failure(NULL), output(NULL){\n std::fill(next, next + ASIZE, (node_t*)NULL);\n }\n };\n\n size_t n_size;\n size_t length;\n node_t *root;\n node_t **nodes;\n \n inline node_t *new_node(){\n nodes[n_size] = new node_t(n_size);\n return nodes[n_size++];\n }\n \npublic:\n AhoCorasick(const std::vector<std::string> &pats) : n_size(0){\n length = accumulate(pats.begin(), pats.end(), std::string(\"\")).size();\n \n nodes = new node_t* [length + 1];\n root = new_node();\n \n // construct key word tree\n \n for(size_t i = 0; i < pats.size(); i++){\n node_t *v = root;\n for(size_t j = 0; j < pats[i].size(); j++){\n int c = pats[i][j];\n if(!v->next[c]) v->next[c] = new_node();\n v = v->next[c];\n }\n v->match.push_back(i);\n }\n \n // construct failure link and output link\n std::queue<node_t*> que;\n root->failure = root;\n root->output = root;\n\n que.push(root);\n while(!que.empty()){\n node_t *p = que.front(); que.pop();\n \n for(int x = 0; x < ASIZE; x++){\n if(!p->next[x]) continue;\n node_t *v = p->next[x];\n node_t *w = p->failure;\n \n if(p == root){\n v->failure = root;\n v->output = root;\n }else{\n while(w != root && !w->next[x]) w = w->failure;\n v->failure = w->next[x] ? w->next[x] : root;\n \n if(v->failure->match.empty()){\n v->output = v->failure->output;\n }else{\n v->output = v->failure;\n }\n }\n que.push(v);\n }\n }\n }\n\n ~AhoCorasick(){\n for(size_t i = 0; i < n_size; i++) delete nodes[i];\n delete [] nodes;\n }\n \n // initial state is always zero.\n size_t state_size() const{ return n_size; }\n int init_state() const{ return 0; }\n \n int next_state(size_t state, int c) const{\n assert(state < n_size);\n node_t *v = nodes[state];\n while(v != root && !v->next[c]) v = v->failure;\n v = v->next[c] ? v->next[c] : root;\n return v->ID;\n }\n\n std::vector<int> match(size_t state) const{\n assert(state < n_size);\n \n std::vector<int> res;\n for(node_t *v = nodes[state]; v != root; v = v->output){\n for(size_t i = 0; i < v->match.size(); i++){\n res.push_back(v->match[i]);\n }\n }\n return res;\n }\n \n};\n\n#include <cstring>\n#include <tuple>\n#include <queue>\nusing namespace std;\n\n\nint dist[60][60][110];\n\nint main(){\n int N, M, P, sr, sc, gr, gc;\n char field[60][60];\n\n int dr[] = {1, 0, -1, 0};\n int dc[] = {0, -1, 0, 1};\n char dir[] = {'D', 'L', 'U', 'R'};\n\n \n while(cin >> N >> M && N + M){\n\n for(int i = 0; i < N; i++){\n for(int j = 0; j < M; j++){\n cin >> field[i][j];\n if(field[i][j] == 'S'){\n sr = i;\n sc = j;\n }\n if(field[i][j] == 'G'){\n gr = i;\n gc = j;\n }\n }\n }\n \n cin >> P;\n vector<string> ps(P);\n for(int i = 0; i < P; i++) cin >> ps[i];\n AhoCorasick aho(ps);\n\n memset(dist, -1, sizeof(dist));\n\n \n queue<tuple<int, int, int>> que;\n que.push(make_tuple(sr, sc, aho.init_state()));\n dist[sr][sc][aho.init_state()] = 0;\n\n bool ok = false;\n \n while(!que.empty()){\n int r, c, s;\n std::tie(r, c, s) = que.front(); que.pop();\n \n if(r == gr && c == gc){\n cout << dist[r][c][s] << endl;\n ok = true;\n break;\n }\n\n for(int i = 0; i < 4; i++){\n int nr = r + dr[i];\n int nc = c + dc[i];\n int ns = aho.next_state(s, dir[i]);\n \n if(!aho.match(ns).empty()) continue;\n \n if(0 <= nr && nr < N && 0 <= nc && nc < M &&\n field[nr][nc] != '#' && dist[nr][nc][ns] == -1)\n {\n dist[nr][nc][ns] = dist[r][c][s] + 1;\n que.push(make_tuple(nr, nc, ns));\n }\n \n }\n }\n if(!ok) cout << -1 << endl;\n \n }\n}", "java": "\nimport 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.PrintWriter;\nimport java.util.Arrays;\nimport java.util.HashSet;\nimport java.util.LinkedList;\nimport java.util.Map;\nimport java.util.Queue;\nimport java.util.Set;\nimport java.util.StringTokenizer;\nimport java.util.TreeMap;\n\npublic class Main{\n\t\n\tString INPUT = \"./data/judge/201709/A2212.txt\";\n\t\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew Main().run();\n\t}\n\t\n\tstatic final char[] TAG = {'D','U','L','R'};\n\tstatic final int[] R = {1, -1, 0, 0};\n\tstatic final int[] C = {0, 0, -1, 1};\n\tstatic final int INF = 0x3f3f3f3f;\n\t\n\tstatic int idx = 0;\n\t\n\tclass State{\n\t\tint i;\n\t\tint j;\n\t\tNode s;\n\t\tState(int i, int j, Node s){\n\t\t\tthis.i = i;\n\t\t\tthis.j = j;\n\t\t\tthis.s = s;\n\t\t}\n\t\t\n\t\t@Override\n\t\tpublic int hashCode() {\n\t\t\treturn i * 31 + j * 17 + s.id * 11;\n\t\t}\n\t\t\n\t\t@Override\n\t\tpublic boolean equals(Object obj) {\n\t\t\tif (this == obj) return true;\n\t\t\tif (obj == null ||obj.getClass() != getClass()) return false;\n\t\t\tState o = (State) obj;\n\t\t\treturn o.i == i && o.j == j && o.s == s;\n\t\t}\n\t\t\n\t\t@Override\n\t\tpublic String toString() {\n\t\t\treturn i + \" \" + j + \" \" + s;\n\t\t}\n\t}\n\t\n\tclass Node{\n\t\tMap<Character, Node> cs = new TreeMap<Character, Node>();\n\t\tNode[] next = new Node[4];\n\t\tNode fail;\n\t\tboolean accept;\n\t\tint id;\n\t\t\n\t\tNode() {id = idx++;}\n\t\t\n\t\t@Override\n\t\tpublic String toString() {\n\t\t\treturn id + \" \" + accept;\n\t\t}\n\t}\n\t\n\tNode root;\n\tvoid AhoCorasick(char[][] p) {\n\t\tint n = p.length;\n\t\troot = new Node();\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tNode t = root;\n\t\t\tfor (char c : p[i]) {\n\t\t\t\tif (!t.cs.containsKey(c)) t.cs.put(c, new Node());\n\t\t\t\tt = t.cs.get(c);\n\t\t\t}\n\t\t\tt.accept = true;\n\t\t}\n\t\t\n\t\t// fail\n\t\tQueue<Node> que = new LinkedList<Node>();\n\t\tque.offer(root);\n\t\twhile (!que.isEmpty()) {\n\t\t\tNode r = que.poll();\n\t\t\tfor (Map.Entry<Character, Node> entry : r.cs.entrySet()) {\n\t\t\t\tchar c = entry.getKey();\n\t\t\t\tNode v = entry.getValue();\n\t\t\t\tque.offer(v);\n\t\t\t\tNode f = r.fail;\n\t\t\t\twhile (f != null && !f.cs.containsKey(c)) {\n\t\t\t\t\tf = f.fail;\n\t\t\t\t}\n\t\t\t\tif (f == null) {\n\t\t\t\t\tv.fail = root;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tv.fail = f.cs.get(c);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\t// next\n\t\tque.offer(root);\n\t\twhile (!que.isEmpty()) {\n\t\t\tNode t = que.poll();\n\t\t\touter : for (char[] cs : p) {\n\t\t\t\tNode r = t;\n\t\t\t\tfor (char c : cs) {\n\t\t\t\t\tif (r.cs.containsKey(c)) {\n\t\t\t\t\t\tr = r.cs.get(c);\n\t\t\t\t\t}\n\t\t\t\t\telse continue outer;\n\t\t\t\t}\n\t\t\t\tr.accept = true;\n\t\t\t}\n\t\t\tfor (int i = 0; i < 4; ++i) {\n\t\t\t\tchar c = TAG[i];\n\t\t\t\tNode r = t;\n\t\t\t\twhile (r != null && !r.cs.containsKey(c)) {\n\t\t\t\t\tr = r.fail;\n\t\t\t\t}\n\t\t\t\tif (r == null) {\n\t\t\t\t\tt.next[i] = root;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tt.next[i] = r.cs.get(c);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (Node r : t.cs.values()) {\n\t\t\t\tque.offer(r);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tint startR;\n\tint startC;\n\tint endR, endC;\n\t\n\tint solve(char[][] f) {\n\t\tint N = f.length;\n\t\tint M = f[0].length;\n\t\tint n = ni();\n\t\tchar[][] p = new char[n][];\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tp[i] = ns().toCharArray();\n\t\t}\n\t\t\n\t\tAhoCorasick(p);\n\t\t\n\t\tState state = new State(startR, startC, root);\n\t\tQueue<State> queue = new LinkedList<>();\n\t\tSet<State> vis = new HashSet<>();\n\t\tqueue.offer(state);\n\t\tvis.add(state);\n\t\t\n\t\tint turn = 0;\n\t\tint ans = INF;\n\t\tboolean find = false;\n\t\touter: while (!queue.isEmpty() && !find) {\n\t\t\tint size = queue.size();\n\t\t\tfor (int i = 0; i < size; ++i) {\n\t\t\t\tState now = queue.poll();\n\t\t\t\tif (now.i == endR && now.j == endC) {\n\t\t\t\t\tans = turn;\n\t\t\t\t\tfind = true;\n\t\t\t\t\tbreak outer;\n\t\t\t\t}\n\t\t\t\tfor (int j = 0; j < 4; ++j) {\n\t\t\t\t\tint nx = now.i + R[j];\n\t\t\t\t\tint ny = now.j + C[j];\n\t\t\t\t\tif (nx < 0 || nx >= N || ny < 0 || ny >= M) continue;\n\t\t\t\t\tif (f[nx][ny] == '#') continue;\n\t\t\t\t\tNode next = now.s.next[j];\n\t\t\t\t\tif (next.accept) continue;\n\t\t\t\t\tState ns = new State(nx, ny, next);\n\t\t\t\t\tif (vis.contains(ns)) continue;\n\t\t\t\t\tqueue.offer(ns);\n\t\t\t\t\tvis.add(ns);\n\t\t\t\t}\n\t\t\t}\n\t\t\tturn++;\n\t\t}\n\t\treturn ans == INF ? -1 : ans;\n\t}\n\t\n\tvoid read() {\n\t\twhile (true) {\n\t\t\tint N = ni();\n\t\t\tif (N == 0) break;\n\t\t\tint M = ni();\n\t\t\tchar[][] f = new char[N][M];\n\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\tchar[] cs = ns().toCharArray();\n\t\t\t\tfor (int j = 0; j < M; ++j) {\n\t\t\t\t\tf[i][j] = cs[j];\n\t\t\t\t\tif (cs[j] == 'S') {\n\t\t\t\t\t\tstartR = i;\n\t\t\t\t\t\tstartC = j;\n\t\t\t\t\t}\n\t\t\t\t\tif (cs[j] == 'G') {\n\t\t\t\t\t\tendR = i;\n\t\t\t\t\t\tendC = j;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tidx = 0;\n\t\t\tout.println(solve(f));\n\t\t}\n\t}\n\n\tFastScanner in;\n\tPrintWriter out;\n\t\n\tvoid run() throws IOException {\n\t\tboolean oj;\n\t\ttry {\n\t\t\toj = ! System.getProperty(\"user.dir\").equals(\"F:\\\\java_workspace\\\\leetcode\");\n\t\t} catch (Exception e) {\n\t\t\toj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\t\t}\n\t\t\n\t\tInputStream is = oj ? System.in : new FileInputStream(new File(INPUT));\n\t\tin = new FastScanner(is);\n\t\tout = new PrintWriter(System.out);\n\t\tlong s = System.currentTimeMillis();\n\t\tread();\n\t\tout.flush();\n\t\tif (!oj){\n\t\t\tSystem.out.println(\"[\" + (System.currentTimeMillis() - s) + \"ms]\");\n\t\t}\n\t}\n\t\n\tpublic boolean more(){\n\t\treturn in.hasNext();\n\t}\n\t\n\tpublic int ni(){\n\t\treturn in.nextInt();\n\t}\n\t\n\tpublic long nl(){\n\t\treturn in.nextLong();\n\t}\n\t\n\tpublic double nd(){\n\t\treturn in.nextDouble();\n\t}\n\t\n\tpublic String ns(){\n\t\treturn in.nextString();\n\t}\n\t\n\tpublic char nc(){\n\t\treturn in.nextChar();\n\t}\n\t\n\tclass FastScanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\t\tboolean hasNext;\n\n\t\tpublic FastScanner(InputStream is) throws IOException {\n\t\t\tbr = new BufferedReader(new InputStreamReader(is));\n\t\t\thasNext = true;\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 (Exception e) {\n\t\t\t\t\thasNext = false;\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\t\t\n\t\tString next = null;\n\t\tpublic boolean hasNext(){\n\t\t\tnext = nextToken();\n\t\t\treturn hasNext;\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\tif (next == null){\n\t\t\t\thasNext();\n\t\t\t}\n\t\t\tString more = next;\n\t\t\tnext = null;\n\t\t\treturn Integer.parseInt(more);\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\tif (next == null){\n\t\t\t\thasNext();\n\t\t\t}\n\t\t\tString more = next;\n\t\t\tnext = null;\n\t\t\treturn Long.parseLong(more);\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\tif (next == null){\n\t\t\t\thasNext();\n\t\t\t}\n\t\t\tString more = next;\n\t\t\tnext = null;\n\t\t\treturn Double.parseDouble(more);\n\t\t}\n\t\t\n\t\tpublic String nextString(){\n\t\t\tif (next == null){\n\t\t\t\thasNext();\n\t\t\t}\n\t\t\tString more = next;\n\t\t\tnext = null;\n\t\t\treturn more;\n\t\t}\n\t\t\n\t\tpublic char nextChar(){\n\t\t\tif (next == null){\n\t\t\t\thasNext();\n\t\t\t}\n\t\t\tString more = next;\n\t\t\tnext = null;\n\t\t\treturn more.charAt(0);\n\t\t}\n\t}\n\t\n\tstatic class ArrayUtils {\n\n\t\tpublic static void fill(int[][] f, int value) {\n\t\t\tfor (int i = 0; i < f.length; ++i) {\n\t\t\t\tArrays.fill(f[i], value);\n\t\t\t}\n\t\t}\n\t\t\n\t\tpublic static void fill(int[][][] f, int value) {\n\t\t\tfor (int i = 0; i < f.length; ++i) {\n\t\t\t\tfill(f[i], value);\n\t\t\t}\n\t\t}\n\t\t\n\t\tpublic static void fill(int[][][][] f, int value) {\n\t\t\tfor (int i = 0; i < f.length; ++i) {\n\t\t\t\tfill(f[i], value);\n\t\t\t}\n\t\t}\n\t}\n}", "python": null }

[ { "input": { "stdin": "3 40\n.a....a....a....a....f....f....f....f...\nbc#.#cd#.#de#.#eb#.#cb#.#dc#.#ed#.#eb#.\n.#....#....#....#....#....#....#....#..." }, "output": { "stdout": "No" } }, { "input": { "stdin": "3 40\n.a....a....a....a....f....f....f....f...\nbc#.#cd#.#de#.#eb#.#cb#.#dc#.#ed#.#be#.\n.#....#....#....#....#....#....#....#..." }, "output": { "stdout": "Yes" } }, { "input": { "stdin": "3 40\n.a....a....a....a....f....f....f....f...\n#bc#.#cd#.#de#.#eb#.#cb#.#dc#.#ed#.#be#.\n.#....#....#....#....#....#....#....#..." }, "output": { "stdout": "Yes" } }, { "input": { "stdin": "5 35\n.a....a....a....a....f....f....f...\nbc#.#cd#.#de#.#eb#.#cb#.#dc#.#ed#.\n.#..f.#....#....#....#....#....#...\n..e##..............................\n.b#................................" }, "output": { "stdout": "Yes" } }, { "input": { "stdin": "6 35\n...e...f..../f....f....a....a....a....a.\n.#eb#.\"de#.#cd#.#bc#.$be\"/#ed#.#dc#-#cb#\n.#....#.-/.#..-.#....#....#....#....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "1 19\n......a....a...-a....f...-f....f....f.a.\n.#eb#.#de#.#cd#.##c#.#be#.bee#.#dc#.$cb\n.#..-.#....#....#....#...-#-...#....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "3 35\n.a....a....a....a....f....f/...f....e...\n#bc#-#cd#.#de#/\"eb$.#cb#.#dc#.#ed\".#be#.\n.#....#.-..#..-.#....#....#....#....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "2 21\n...e...f..../f....f....b....a....a....a.\n.#eb#.\"de#.#cd#.#ac#.$be\"/#dd#.#dc#-#cb#\n.#....#.-/.#..-.#....#.../#....#....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "6 35\n.a....a....a....a....f....f/....f...e...\n#bc#-#cd#.#de#/\"eb$.#cb#.#dc#.#ed\".#be#.\n.#....#.-/.#..-.#....#....#....#....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "5 60\n.a....a....a....a....f....f....f...\nbc#.#cd#.#de#.#eb#.#cb#.#dc#.#ed#.\n.#..f.#....#....#....#....#....#...\n..e##..............................\n.b#................................" }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "1 101\n.a....a....a...fa....f...../...f..-.f./.\nbcb.#cd#.#de#.#eb#.#cb$.#dc#.#ed#.#e##.\n.#....#....\"....#....#...-#....#....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "0 010\n.a....a....a...fa....f...../...../-.f./f\nbcb.#cd#.#d##.#fb#.#cb$.#dc#.#ed#.#ee#.\n.#....$....\"....#....#...-#....#....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "14 40\n......a....a...-a....f....f....f....f.a.\n.#eb#.#de#.#cd#.##c#.#be#.bed#.#dc#.#cb\n...#....#...-#....#....#....#....#.-..#." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "2 19\n......a....a...-a....f....f....f....f.a.\n.#eb#.#de#.#cd#.##c#.#be#.bed#.#dc#.#cb\n...#....#...-#-...#....#....#....#.-..#." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "6 35\n.a....a....a....a....f....f/....f...e...\n.#eb#.\"de#.#cd#.#bc#.$be\"/#ed#.#dc#-#cb#\n.#....#.-/.#..-.#....#....#....#....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "4 19\n.a.f....f....f-...f....a-...a....a......\nbc$.#cd#.#eeb.#ec#.#c##.#dc#.#ed#.#be#.\n.#..-.#./..#../.#....#...-#-...\"....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "1 110\n.a....a....a...fa....f...../...f..-.f./.\nbcb.#cd#.#de#.#eb#.#cb$.#dc#.#ed#.#e##.\n.#....$....\"....#....#...-#....#....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "0 35\n...e...f..../f....f....a....a....a....a.\n.#eb#.\"de#.#cd#.#bc#.$be\"/#ed#.#dc#-#cb#\n...#....#....#/...#....#.-..#./-.#....#." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "5 19\n......a....a...-a....f....f....f....f.a.\n.#eb#.#de#.#cd#.##c#.#be#.bed#.#dc#.#cb\n...#....#...-#-...#....#....#....#.-..#." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "5 60\n.a....a....b....a....f....f....f...\n.#de#.#cd#.#bc#.#be#.#ed#.#dc#.#cb\n.#..f.#....#....#....#....#....#...\n..e##..............................\n.b#................................" }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "4 19\n......a....a...-a....f...-f....f....f.a.\n.#eb#.#de#.#cd#.##c#.#be#.bee#.#dc#.$cb\n.#..-.#....#....#....#...-#-...#....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "6 19\n.a.f....f....f-...f....a-...a....a......\nbc$.#cd#.#eeb.#eb#.#c##.#dc#.#ed#.#be#.\n.#..-.#./..#../.#....#...-#-...\"....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "4 19\n.a.f....f....f-...f....a-...a....a......\nbc$.#cd#.#eeb.#eb#.#c##.#dc#.#ed#.#be#.\n.#..-.#./..#../.#....#...-#-...\"....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "3 18\n.a....a....a....a....f....f....f....f...\n#bc#-#cd#.#de#.\"eb#.#cb#.#dc#.#ed#.#be#.\n.#....#....#..-.#....#....#....#....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "1 53\n.a....a....a...fa....f...../...f....f...\nbcb.#cd#.#de#.#eb#.#cb$.#dc#.#ed#.#e##.\n.#....#....\"....#....#...-#....#....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "14 40\n......a....a...-a....f....f....f....f.a.\n.#eb#.#de#.#cd#.##c#.#be#.bed#.#dc#.#cb\n...#....#...-#-...#....#....#....#.-..#." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "3 18\n.a....a....a....a....f....f/...f....e...\n#bc#-#cd#.#de#.\"eb$.#cb#.#dc#.#ed#.#be#.\n.#....#.-..#..-.#....#....#....#....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "2 13\n...e...f..../f....f....b....a....a....a.\n.#eb#.\"de#.#cd#.#ac#.$be\"/#dd#.#dc#-#cb#\n...#....#....#/...#....#.-..#./-.#....#." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "6 35\n...e...f..../f....f....a....a....a....a.\n.#eb#.\"de#.#cd#.#bc#.$be\"/#ed#.#dc#-#cb#\n...#....#....#/...#....#.-..#./-.#....#." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "1 19\n......a....a...-a....f...-f....f....f.a.\n.#eb#.#de#.#cd#.##c#.#be#.bee#.#dc#.$cb\n.#..-.#./..#....#....#...-#-...#....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "1 64\n.a....a....a...fa....f...../...f....f...\nbcb.#cd#.#de#.#eb#.#cb$.#dc#.#ed#.#e##.\n.#....#....\"....#....#...-#....#....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "2 21\n...e...f..../f....f....b....a....a....a.\n.#eb#.\"de#.#cd#.#ac#.$be\"/#dd#.#dc#-#cb#\n...#....#....#/...#....#.-..#./-.#....#." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "3 18\n.a....a....a....a....f....f/...f....e...\n#bc#-#cd#.#de#.\"eb#.#cb#.#dc#.#ed#.#be#.\n.#....#.-..#..-.#....#....#....#....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "3 40\n.a....a....a....a....f....f....f....f...\n.#eb#.#de#.#cd#.#bc#.#be\".#ed#.#dc#-#cb#\n.#....#....#....#....#....#....#....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "9 40\n.a....a....a...-a....f....f....f....f...\nbc#.#cd#.#de#.#eb#.#cb#.#dc#.#ed#.#be#.\n.#..-.#....#....#....#....#-...#....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "0 000\n.a....a....a...fa....f...../...f..-.f./.\n.#ee#.#de#.#cd#.$bc#.#bf#.##d#.#dc#.bcb\n.#....$....\"....#....#...-#....#....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "9 40\n.a....a....a...-a....f....f....f....f...\nbc#.#cd#.#deb.#eb#.#c##.#dc#.#ed#.#be#.\n.#..-.#....#....#....#....#-...#....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "2 19\n......a....a...-a....f...-f....f....f.a.\n.#eb#.#de#.#cd#.##c#.#be#.bed#.#dc#.#cb\n.#..-.#....#....#....#...-#-...#....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "9 40\n.a....a....a...-a....f....f....f....f...\n.#eb#.#de#.#cd#.##c#.#be#.bed#.#dc#.#cb\n...#....#...-#....#....#....#....#.-..#." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "1 111\n.a....a....a...fa....f...../...f..-.f./.\nbcb.#cd#.#de#.#eb#.#cb$.#dc#.#ed#.#e##.\n.#....$....\"....#....#...-#....#....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "3 64\n...f....f.........f....af...a....a....a.\nbc#.#cd#.#de#.#eb#.#cb#.#dc#.#ed#.#eb#.\n.#....#....\"....#....#....#....#....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "6 35\n.a....a....a....a....f....f/...f....e...\n#bc#-#cd#.#de#/\"eb$.#cb#.#dc#.#ed\".#be#.\n.#....#.-..#..-.#....#....#....#....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "3 64\n...f....f.../.....f....af...a....a....a.\nbc#.#cd#.#de#.#eb#.#cb$.#dc#.#ed#.#eb#.\n...#....#....#....#....#....\"....#....#." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "14 40\n.a....a....a...-a....f....f....f....f...\n.#eb#.#de#.#cd#.##c#.#be#.bed#.#dc#.#cb\n...#....#...-#....#....#....#....#.-..#." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "3 64\n.a....a....a....a....f....f....f....f...\nbc#.#cd#.#de#.#eb#.#cb#.#dc#.#ed#.#eb#.\n.#....#....#....#....#....#....#....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "1 64\n...f....f.../.....f....af...a....a....a.\nbc#.#cd#.#de#.#eb#.#cb$.#dc#.#ed#.#eb#.\n...#....#....#....#....#....\"....#....#." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "2 19\n......a....a...-a....f...-f....f....f.a.\n.#eb#.#de#.#cd#.##c#.#be#.bee#.#dc#.$cb\n.#..-.#....#....#....#...-#-...#....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "2 19\n......a....a...-a....f....f....f....f.a.\n.#eb#.#de#.#cd#.##c#.#be#.bed#.#dc#.#cb\n.#..-.#....#....#....#...-#-...#....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "5 40\n.a....a....a....a....f....f....f....f...\nbc#.#cd#.#de#.#eb#.#cb#.#dc#.#ed#.#be#.\n.#..-.#....#....#....#....#....#....#..." }, "output": { "stdout": "No\n" } }, { "input": { "stdin": "3 40\n.a....a....a....a....f....f....f....f...\n.#eb#.#de#.#cd#.#bc#.#be#.#ed#.#dc#-#cb#\n.#....#....#....#....#....#....#....#..." }, "output": { "stdout": "No\n" } } ]

{ "tags": [], "title": "Bicube" }

{ "cpp": "#include <bits/stdc++.h>\nusing namespace std;\n\n// 0: top, 1: front, 2:right, 3:back, 4:left, 5:bottom\nconst vector<vector<string>> dice_map = {\n {\"0...\",\n \"1234\",\n \"5...\"},\n {\"0...\",\n \"1234\",\n \".5..\"},\n {\"0...\",\n \"1234\",\n \"..5.\"},\n {\"0...\",\n \"1234\",\n \"...5\"},\n {\".0..\",\n \"4123\",\n \".5..\"},\n {\".0..\",\n \"4123\",\n \"..5.\"},\n {\"...0\",\n \"2341\",\n \"..5.\"},\n {\"...0\",\n \"2341\",\n \".5..\"},\n {\"...0\",\n \"2341\",\n \"5...\"},\n {\"..0.\",\n \"3412\",\n \".5..\"},\n {\"..0.\",\n \"3412\",\n \"5...\"},\n {\".0..\",\n \"4123\",\n \"5...\"},\n {\"..025\",\n \"341..\"},\n {\"025..\",\n \"..143\"},\n {\"..02\",\n \"341.\",\n \"5...\"},\n {\"40..\",\n \".123\",\n \"...5\"},\n {\"..02\",\n \"341.\",\n \".5..\"},\n {\"40..\",\n \".123\",\n \"..5.\"},\n {\"..02\",\n \"341.\",\n \"..5.\"},\n {\"40..\",\n \".123\",\n \".5..\"},\n {\"..02\",\n \".41.\",\n \"35..\"},\n {\"40..\",\n \".12.\",\n \"..53\"},\n};\n\nvector<string> rot_map(vector<string> const& v) {\n const int n = v.size(), m = v[0].size();\n vector<string> res(m);\n for(int i = 0; i < n; ++i) {\n for(int j = 0; j < m; ++j) {\n res[j] += v[n - i - 1][j];\n }\n }\n return res;\n};\n\nusing dice = string;\n\nconstexpr int rot_d[2][6] = {\n {3, 0, 2, 5, 4, 1}, // Front\n {0, 4, 1, 2, 3, 5}, // Side\n};\n\ndice rot_dice(dice const& v, int dir) {\n dice res(6, ' ');\n for(int j = 0; j < 6; ++j) {\n res[j] = v[rot_d[dir][j]];\n }\n return res;\n}\n\nbool is_valid_dice(dice const& d) {\n bool res = true;\n for(int i = 0; i < 3; ++i) {\n res &= isalpha(d[i]) || isdigit(d[i]);\n res &= d[i + 3] == '#';\n }\n return res;\n}\n\nbool check(vector<dice>& ds, int i) {\n bool res = false;\n if(i == 8) {\n res = true;\n for(int j = 0; j < 4; ++j) {\n res &= ds[j][0] == ds[0][0]; // top\n res &= ds[j + 4][0] == ds[4][0]; // bottom\n // side\n res &= ds[j][2] == ds[(j + 1) % 4][1];\n //res &= ds[j + 4][1] == ds[(j + 1) % 4 + 4][2];\n res &= ds[j][1] == ds[j + 4][2] && ds[j][2] == ds[j + 4][1];\n }\n return res;\n } else {\n for(int j = 0; j < 3; ++j) {\n res |= check(ds, i + 1);\n rotate(begin(ds[i]), begin(ds[i]) + 1, end(ds[i]));\n }\n }\n return res;\n}\n\nint main() {\n int h, w; cin >> h >> w;\n vector<string> v(h);\n for(auto& s : v) cin >> s;\n\n { // check1\n map<char, int> cols;\n for(auto const& s : v) {\n for(auto const c : s) {\n if(c == '.' || c == '#') continue;\n cols[c] += 1;\n }\n }\n bool chk = cols.size() == 6u;\n for(auto const& p : cols) {\n chk &= p.second == 4;\n }\n if(!chk) {\n cout << \"No\" << endl;\n return 0;\n }\n }\n\n vector<dice> dices;\n auto in_range = [&] (int y, int x) {\n return 0 <= y && y < h && 0 <= x && x < w;\n };\n for(int i = 0; i < h; ++i) {\n for(int j = 0; j < w; ++j) {\n for(auto dm : dice_map) {\n string td;\n for(int k = 0; k < 4; ++k, dm = rot_map(dm)) {\n const int n = dm.size(), m = dm[0].size();\n if(!in_range(i + n - 1, j + m - 1)) continue;\n string d(6, '.');\n for(int y = i; y < i + n; ++y) {\n for(int x = j; x < j + m; ++x) {\n if(dm[y - i][x - j] == '.') continue;\n d[dm[y - i][x - j] - '0'] = v[y][x];\n }\n }\n if(d[0] == '.' || d[0] == '#') {\n d = rot_dice(rot_dice(d, 0), 0);\n }\n for(int l = 0; l < 4; ++l, d = rot_dice(d, 1)) {\n if(!is_valid_dice(d)) continue;\n td = d.substr(0, 3);\n }\n }\n if(!td.empty()) {\n dices.push_back(td);\n }\n }\n }\n }\n\n // check\n sort(begin(dices), end(dices));\n bool ans = false;\n do {\n ans |= check(dices, 1);\n } while(!ans && next_permutation(begin(dices) + 1, end(dices)));\n\n cout << (ans ? \"Yes\" : \"No\") << endl;\n}\n\n", "java": "import java.util.*;\n\nclass Main{\n\n int h,w;\n char[][] sheet;\n ArrayList<Dice> list;\n ArrayList<Character> color;\n int[] colors;\n\n int[] dx = {0, 1, 0, -1};\n int[] dy = {-1, 0, 1, 0};\n\n int[][] nei = {{1, 3, 2, 4},\n {5, 3, 0, 4},\n {0, 3, 5, 4},\n {1, 5, 2, 0},\n {1, 0, 2, 5},\n {1, 4, 2, 3}};\n\n class Dice{\n char[] dice = new char[6]; \n Dice(char f, char t, char b, char r, char l, char u){\n dice[0] = f;\n dice[1] = t;\n dice[2] = b;\n dice[3] = r;\n dice[4] = l;\n dice[5] = u;\n }\n }\n\n Dice rotateRight(Dice d){\n return new Dice(d.dice[0], d.dice[4], d.dice[3], d.dice[1], d.dice[2], d.dice[5]);\n }\n\n Dice rotateLeft(Dice d){\n return new Dice(d.dice[0], d.dice[3], d.dice[4], d.dice[2], d.dice[1], d.dice[5]);\n }\n\n Dice rotateDown(Dice d){\n return new Dice(d.dice[1], d.dice[5], d.dice[0], d.dice[3], d.dice[4], d.dice[2]);\n }\n\n Dice rotateUp(Dice d){\n return new Dice(d.dice[2], d.dice[0], d.dice[5], d.dice[3], d.dice[4], d.dice[1]);\n }\n \n boolean check(Dice d){\n if(d.dice[1]!='#' && d.dice[3]!='#') return true;\n if(d.dice[3]!='#' && d.dice[2]!='#') return true;\n if(d.dice[2]!='#' && d.dice[4]!='#') return true;\n if(d.dice[4]!='#' && d.dice[1]!='#') return true;\n return false;\n }\n\n Dice rotate(int k, Dice d){\n if(k==0) return d;\n if(k==1) return rotateDown(d);\n if(k==2) return rotateUp(d);\n if(k==3) return rotateDown(rotateLeft(d));\n if(k==4) return rotateDown(rotateRight(d));\n if(k==5) return rotateDown(rotateDown(d));\n return d;\n }\n\n void solve(){\n Scanner sc = new Scanner(System.in);\n\n h = sc.nextInt();\n w = sc.nextInt();\n sheet = new char[h][w];\n color = new ArrayList<Character>();\n for(int i=0; i<h; i++){\n String s = sc.next();\n for(int j=0; j<w; j++){\n sheet[i][j] = s.charAt(j);\n if(sheet[i][j]!='#' && sheet[i][j]!='.' && !color.contains(sheet[i][j])) \n color.add(sheet[i][j]);\n }\n }\n\n list = new ArrayList<Dice>();\n colors = new int[color.size()];\n\n for(int i=0; i<h; i++){\n for(int j=0; j<w; j++){\n if(sheet[i][j]!='.'){\n bfs(i, j);\n }\n }\n }\n\n ArrayList<Dice> list2 = new ArrayList<Dice>();\n\n for(int i=0; i<colors.length; i++){\n if(colors[i]<4) continue;\n ArrayList<Dice> same = new ArrayList<Dice>();\n for(int j=0; j<list.size(); j++){\n Dice dd = list.get(j);\n for(int k=0; k<6; k++){\n if(dd.dice[k]==color.get(i)){\n Dice newDice = rotate(k, dd); //kを前面に\n same.add(newDice);\n break;\n }\n }\n }\n if(same.size()<4) continue;\n\n for(int j=0; j<same.size(); j++){\n Dice d1 = same.get(j);\n if(!check(d1)) continue;\n while(d1.dice[1]=='#' || d1.dice[4]=='#') d1 = rotateRight(d1);\n for(int k=0; k<same.size(); k++){\n Dice d2 = same.get(k);\n if(!check(d2)) continue;\n while(d2.dice[1]=='#' || d2.dice[3]=='#') d2 = rotateRight(d2); \n for(int l=0; l<same.size(); l++){\n Dice d3 = same.get(l);\n if(!check(d3)) continue;\n while(d3.dice[4]=='#' || d3.dice[2]=='#') d3 = rotateRight(d3);\n for(int m=0; m<same.size(); m++){\n Dice d4 = same.get(m);\n if(!check(d4)) continue;\n while(d4.dice[3]=='#' || d4.dice[2]=='#') d4 = rotateRight(d4);\n\n if(d1.dice[1]==d2.dice[1] && d2.dice[3]==d4.dice[3] &&\n d3.dice[2]==d4.dice[2] && d1.dice[4]==d3.dice[4] && \n d1.dice[1]!=d3.dice[2] && d1.dice[4]!=d2.dice[3]){\n list2.add(new Dice((char)color.get(i), d1.dice[1], d3.dice[2], d2.dice[3], d1.dice[4], '.'));\n }\n }\n }\n }\n }\n }\n\n String ans = \"No\";\n for(int i=0; i<list2.size(); i++){\n Dice d1 = list2.get(i);\n for(int j=i+1; j<list2.size(); j++){\n Dice d2 = list2.get(j);\n for(int k=0; k<4; k++){\n d2 = rotateRight(d2);\n if(d1.dice[0]!=d2.dice[0] && d1.dice[1]==d2.dice[1] && \n d1.dice[2]==d2.dice[2] && d1.dice[3]==d2.dice[4] && d1.dice[4]==d2.dice[3]){\n ans = \"Yes\";\n }\n }\n }\n }\n\n System.out.println(ans);\n }\n\n int[][] abs = {{2,1,0,3},{3,2,1,0},{0,3,2,1},{1,0,3,2}};\n\n void bfs(int y, int x){\n //y, x, pos, prior\n Queue<int[]> q = new LinkedList<int[]>();\n q.add(new int[]{y, x, 0, 0});\n boolean[][] v = new boolean[h][w];\n v[y][x] = true;\n\n char[] c = new char[6];\n HashSet<Character> set = new HashSet<Character>();\n\n int black = 0;\n int cnt = 0;\n while(q.size()>0){\n int[] yx = q.poll();\n int yy = yx[0], xx = yx[1], pos = yx[2], prior = yx[3];\n \n c[pos] = sheet[yy][xx];\n set.add(c[pos]);\n if(sheet[yy][xx]=='#') black++;\n cnt++;\n sheet[yy][xx] = '.'; \n\n for(int i=0; i<4; i++){\n int ny = yy + dy[(i+prior)%4], nx = xx + dx[(i+prior)%4];\n if(ny<0 || ny>=h || nx<0 || nx>=w || v[ny][nx] || sheet[ny][nx]=='.') continue;\n for(int j=0; j<4; j++){\n if(nei[nei[pos][i]][j]==pos){\n v[ny][nx] = true;\n q.add(new int[]{ny, nx, nei[pos][i], (abs[i][j]+prior)%4});\n }\n }\n }\n }\n\n\n\n if(cnt==6 && black==3 && set.size()==4){\n list.add(new Dice(c[0], c[1], c[2], c[3], c[4], c[5]));\n //System.out.println(c[0]+\" \"+c[1]+\" \"+c[2]+\" \"+c[3]+\" \"+c[4]+\" \"+c[5]);\n for(int i=0; i<6; i++){\n if(c[i]=='#') continue;\n colors[color.indexOf(c[i])]++;\n }\n }\n }\n\n public static void main(String[] args){\n new Main().solve();\n }\n}", "python": "from collections import deque\nfrom string import ascii_lowercase, ascii_uppercase, digits\nimport sys\nreadline = sys.stdin.readline\nwrite = sys.stdout.write\n\nD = [\n (1, 5, 2, 3, 0, 4), # 'U'\n (3, 1, 0, 5, 4, 2), # 'R'\n (4, 0, 2, 3, 5, 1), # 'D'\n (2, 1, 5, 0, 4, 3), # 'L'\n]\np_dice = (0, 0, 0, 1, 1, 2, 2, 3)*3\n\nss = digits + ascii_uppercase + ascii_lowercase\nL = len(ss)\n\ndef rotate_dice(L, k):\n return [L[e] for e in D[k]]\ndef enumerate_dice(L0):\n L = L0[:]\n for k in p_dice:\n yield L\n L[:] = (L[e] for e in D[k])\ndef dice_graph(L0 = [0, 1, 2, 3, 4, 5]):\n DA = list(map(tuple, enumerate_dice(L0)))\n DM = {tuple(e): i for i, e in enumerate(DA)}\n G = [list(DM[tuple(rotate_dice(ds, i))] for i in range(4)) for ds in DA]\n return DA, G\n\ndef solve():\n H, W = map(int, readline().split())\n S = [readline().strip() for i in range(H)]\n\n DA, DG = dice_graph()\n dd = ((0, -1), (1, 0), (0, 1), (-1, 0))\n\n DS = []\n used = [[0]*W for i in range(H)]\n for i in range(H):\n for j in range(W):\n if S[i][j] == '.' or used[i][j]:\n continue\n D = [0]*6\n que = deque([(j, i, 0)])\n used[i][j] = 1\n while que:\n x, y, k = que.popleft()\n v = DA[k][0]\n c = S[y][x]\n if c == '#':\n D[v] = L\n else:\n D[v] = ss.index(c)\n for e, (dx, dy) in enumerate(dd):\n nx = x + dx; ny = y + dy\n if not 0 <= nx < W or not 0 <= ny < H or S[ny][nx] == '.' or used[ny][nx]:\n continue\n used[ny][nx] = 1\n que.append((nx, ny, DG[k][e]))\n if D.count(L) != 3:\n continue\n for e in enumerate_dice(D):\n if e[3] == e[4] == e[5] == L:\n if e[0] != e[1] and e[1] != e[2] and e[2] != e[0]:\n DS.append(e[:3])\n break\n P = [\n [0, 3, 4],\n [0, 2, 3],\n [0, 1, 2],\n [0, 4, 1],\n [3, 2, 5],\n [2, 1, 5],\n [1, 4, 5],\n [4, 3, 5],\n ]\n DS.sort()\n M = len(DS)\n def dfs(i, used, used_c, state):\n if i == 8:\n return 1\n ps = P[i]\n s = [0]*3\n for j in range(M):\n if used[j]:\n continue\n used[j] = 1\n d = DS[j]\n for b in range(3):\n for k in range(3):\n p = ps[k]\n if state[p] == -1:\n if used_c[d[-b+k]]:\n break\n else:\n if state[p] != d[-b+k]:\n break\n else:\n for k in range(3):\n p = ps[k]\n if state[p] == -1:\n used_c[d[-b+k]] = 1\n s[k], state[p] = state[p], d[-b+k]\n if dfs(i+1, used, used_c, state):\n return 1\n for k in range(3):\n p = ps[k]\n state[p] = s[k]\n if state[p] == -1:\n used_c[d[-b+k]] = 0\n used[j] = 0\n return 0\n if M >= 8 and dfs(0, [0]*M, [0]*L, [-1]*6):\n write(\"Yes\\n\")\n else:\n write(\"No\\n\")\nsolve()\n" }

[ { "input": { "stdin": "" }, "output": { "stdout": "" } } ]

{ "tags": [], "title": "Sigma" }

{ "cpp": "#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nint p[500];\nint q[250][500];\nint r[250][500];\nint ret[500];\nint s[500];\nint t[250][500];\nint u[500];\nint v[250][500];\nint w[250][500];\nint ABS(int a){return max(a,-a);}\nint LIM=240;\nint main(){\n\tint a;\n\tscanf(\"%d\",&a);\n\tfor(int i=0;i<a;i++)p[i]=i;\n\tfor(int i=0;i<LIM;i++){\n\t\trandom_shuffle(p,p+a);\n\t\tprintf(\"?\");\n\t\tfor(int j=0;j<a;j++)printf(\" %d\",p[j]+1);\n\t\tfor(int j=0;j<a;j++)q[i][j]=p[j];\n\t\tprintf(\"\\n\");fflush(stdout);\n\t\tfor(int j=0;j<a;j++)scanf(\"%d\",&r[i][j]);\n\t}\n\tfor(int i=0;i<a;i++)ret[i]=i;\n\trandom_shuffle(ret,ret+a);\n\tint score=0;\n\tfor(int i=0;i<a;i++)s[ret[i]]=i;\n\tfor(int i=0;i<LIM;i++){\n\t\tfor(int j=0;j<a;j++){\n\t\t\tt[i][q[i][j]]=j;\n\t\t}\n\t\tfor(int j=0;j<a;j++)u[j]=ABS(s[j]-t[i][j]);\n\t\tfor(int j=0;j<a;j++){\n\t\t\tv[i][r[i][j]]++;\n\t\t\tw[i][u[j]]++;\n\t\t}\n\t\tfor(int j=0;j<a;j++)score+=min(v[i][j],w[i][j]);\n\t}\n\twhile(score<LIM*a){\n\t\tint cl=rand()%a;\n\t\tint cr=rand()%a;\n\t\tif(cl==cr)continue;\n\t\tint nl=ret[cl];\n\t\tint nr=ret[cr];\n\t//\tswap(s[ret[cl]],s[ret[cr]]);\n\t//\tswap(ret[cl],ret[cr]);\n\t\tint tmp=score;\n\t\tfor(int i=0;i<LIM;i++){\n\t\t\tint at[4];\n\t\t\tat[0]=ABS(s[nl]-t[i][nl]);\n\t\t\tat[1]=ABS(s[nl]-t[i][nr]);\n\t\t\tat[2]=ABS(s[nr]-t[i][nl]);\n\t\t\tat[3]=ABS(s[nr]-t[i][nr]);\n\t\t\tif(w[i][at[0]]<=v[i][at[0]])tmp--;\n\t\t\tw[i][at[0]]--;\n\t\t\tif(w[i][at[3]]<=v[i][at[3]])tmp--;\n\t\t\tw[i][at[3]]--;\n\t\t\tif(w[i][at[1]]<v[i][at[1]])tmp++;\n\t\t\tw[i][at[1]]++;\n\t\t\tif(w[i][at[2]]<v[i][at[2]])tmp++;\n\t\t\tw[i][at[2]]++;\n\t\t\t\n\t\t\tw[i][at[0]]++;w[i][at[1]]--;w[i][at[2]]--;w[i][at[3]]++;\n\t\t\tif(tmp<score-10)break;\n\t\t}\n\t\tif(tmp>=score){\n\t\t\tscore=tmp;\n\t\t\tfor(int i=0;i<LIM;i++){\n\t\t\t\tint at[4];\n\t\t\t\tat[0]=ABS(s[nl]-t[i][nl]);\n\t\t\t\tat[1]=ABS(s[nl]-t[i][nr]);\n\t\t\t\tat[2]=ABS(s[nr]-t[i][nl]);\n\t\t\t\tat[3]=ABS(s[nr]-t[i][nr]);\n\t\t\t\tw[i][at[0]]--;w[i][at[1]]++;w[i][at[2]]++;w[i][at[3]]--;\n\t\t\t}\n\t\t\tswap(ret[cl],ret[cr]);\n\t\t\tswap(s[nl],s[nr]);\n\t\t}\n\t}\n\tprintf(\"!\");\n\tfor(int i=0;i<a;i++)printf(\" %d\",ret[i]+1);\n\tprintf(\"\\n\");\n\tfflush(stdout);\n}", "java": null, "python": null }

[ { "input": { "stdin": "1 2" }, "output": { "stdout": "2" } }, { "input": { "stdin": "33 596" }, "output": { "stdout": "298\n" } }, { "input": { "stdin": "3 11" }, "output": { "stdout": "11\n" } }, { "input": { "stdin": "3 38" }, "output": { "stdout": "38\n" } }, { "input": { "stdin": "4 113" }, "output": { "stdout": "113\n" } }, { "input": { "stdin": "7 129" }, "output": { "stdout": "129\n" } }, { "input": { "stdin": "33 642" }, "output": { "stdout": "214\n" } }, { "input": { "stdin": "11 251" }, "output": { "stdout": "251\n" } }, { "input": { "stdin": "2 368" }, "output": { "stdout": "46\n" } }, { "input": { "stdin": "23 193" }, "output": { "stdout": "193\n" } }, { "input": { "stdin": "1 787" }, "output": { "stdout": "787\n" } }, { "input": { "stdin": "2 97" }, "output": { "stdout": "97\n" } }, { "input": { "stdin": "1 131" }, "output": { "stdout": "131\n" } }, { "input": { "stdin": "1 130" }, "output": { "stdout": "130\n" } }, { "input": { "stdin": "3 23" }, "output": { "stdout": "23\n" } }, { "input": { "stdin": "1 850" }, "output": { "stdout": "170\n" } }, { "input": { "stdin": "1 222" }, "output": { "stdout": "222\n" } }, { "input": { "stdin": "1 140" }, "output": { "stdout": "70\n" } }, { "input": { "stdin": "3 229" }, "output": { "stdout": "229\n" } }, { "input": { "stdin": "3 29" }, "output": { "stdout": "29\n" } }, { "input": { "stdin": "2 199" }, "output": { "stdout": "199\n" } }, { "input": { "stdin": "1 22" }, "output": { "stdout": "22\n" } }, { "input": { "stdin": "2 102" }, "output": { "stdout": "51\n" } }, { "input": { "stdin": "18 79" }, "output": { "stdout": "79\n" } }, { "input": { "stdin": "69 585" }, "output": { "stdout": "195\n" } }, { "input": { "stdin": "2 35" }, "output": { "stdout": "35\n" } }, { "input": { "stdin": "2 21" }, "output": { "stdout": "21\n" } }, { "input": { "stdin": "1 231" }, "output": { "stdout": "231\n" } }, { "input": { "stdin": "19 145" }, "output": { "stdout": "145\n" } }, { "input": { "stdin": "2 41" }, "output": { "stdout": "41\n" } }, { "input": { "stdin": "3 10" }, "output": { "stdout": "10\n" } }, { "input": { "stdin": "12 77" }, "output": { "stdout": "77\n" } }, { "input": { "stdin": "1 6" }, "output": { "stdout": "6\n" } }, { "input": { "stdin": "2 14" }, "output": { "stdout": "7\n" } }, { "input": { "stdin": "2 37" }, "output": { "stdout": "37\n" } }, { "input": { "stdin": "1 167" }, "output": { "stdout": "167\n" } }, { "input": { "stdin": "2 13" }, "output": { "stdout": "13\n" } }, { "input": { "stdin": "2 850" }, "output": { "stdout": "85\n" } }, { "input": { "stdin": "2 221" }, "output": { "stdout": "221\n" } }, { "input": { "stdin": "10 103" }, "output": { "stdout": "103\n" } }, { "input": { "stdin": "2 109" }, "output": { "stdout": "109\n" } }, { "input": { "stdin": "3 67" }, "output": { "stdout": "67\n" } }, { "input": { "stdin": "1 202" }, "output": { "stdout": "202\n" } }, { "input": { "stdin": "3 47" }, "output": { "stdout": "47\n" } }, { "input": { "stdin": "3 2" }, "output": { "stdout": "2\n" } }, { "input": { "stdin": "1 198" }, "output": { "stdout": "66\n" } }, { "input": { "stdin": "21 440" }, "output": { "stdout": "110\n" } }, { "input": { "stdin": "1 30" }, "output": { "stdout": "30\n" } }, { "input": { "stdin": "2 17" }, "output": { "stdout": "17\n" } }, { "input": { "stdin": "2 331" }, "output": { "stdout": "331\n" } } ]

{ "tags": [], "title": "Let's Solve Geometric Problems" }

{ "cpp": "#include<iostream>\nusing namespace std;\nint p,q,ans=1,j;\n\nint so(int n){\n for(int i=2;i*i<=n;i++)if(n%i==0)return 1;\n return 0;\n}\n\nint main(){\n cin>>p>>q;\n if(so(q)){\n for(int i=2;q>=i;i++){\n for(j=0;q%i==0;j++){\n\tq/=i;\n\tif(p%i==0)p/=i,j--;\n }\n if(j==0)continue;\n ans*=i;\n }\n cout<<ans<<endl;\n }else cout<<q<<endl;\n return 0;\n}", "java": "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\n\tstatic void solve() {\n\t\tint p = ir.nextInt();\n\t\tif(p==0){\n\t\t\tout.println(2);\n\t\t\tSystem.exit(0);\n\t\t}\n\t\tint q = ir.nextInt();\n\t\tint a = q / gcd(p, q);\n\t\tint ret=1;\n\t\tfor(int i=2;i<=Math.sqrt(a);i++){\n\t\t\tif(a%i!=0)\n\t\t\t\tcontinue;\n\t\t\tret*=i;\n\t\t\twhile(a%i==0)\n\t\t\t\ta/=i;\n\t\t}\n\t\tret*=a;\n\t\tout.println(ret);\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 void main(String[] args) throws Exception {\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}", "python": "import fractions\na,b=map(int,input().split())\nb//=fractions.gcd(a,b)\na,c=2,1\nwhile a**2<=b:\n if b%a==0:\n c*=a\n while b%a==0: b//=a\n a+=1\nprint(c*b)" }

[ { "input": { "stdin": "10 3 2\n3\n6\n6" }, "output": { "stdout": "1\n0\n4\n2\n0\n0\n5\n0\n0\n4" } }, { "input": { "stdin": "13 3 2\n3\n10\n9" }, "output": { "stdout": "3\n0\n0\n2\n0\n1\n3\n1\n0\n2\n2\n0\n2\n" } }, { "input": { "stdin": "4 1 2\n5\n10\n13" }, "output": { "stdout": "1\n2\n1\n0\n" } }, { "input": { "stdin": "24 1 2\n7\n14\n3" }, "output": { "stdout": "1\n0\n0\n0\n0\n0\n0\n2\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n" } }, { "input": { "stdin": "6 3 3\n6\n16\n6" }, "output": { "stdout": "28\n0\n9\n0\n27\n0\n" } }, { "input": { "stdin": "11 3 2\n6\n17\n32" }, "output": { "stdout": "1\n4\n0\n0\n0\n4\n4\n0\n0\n1\n2\n" } }, { "input": { "stdin": "11 2 2\n2\n0\n10" }, "output": { "stdout": "4\n0\n4\n0\n1\n0\n0\n0\n0\n0\n0\n" } }, { "input": { "stdin": "1 1 2\n4\n1\n0" }, "output": { "stdout": "4\n" } }, { "input": { "stdin": "6 1 4\n3\n38\n38" }, "output": { "stdout": "8\n0\n0\n8\n0\n0\n" } }, { "input": { "stdin": "11 3 2\n6\n17\n16" }, "output": { "stdout": "5\n4\n0\n0\n0\n2\n4\n0\n0\n0\n1\n" } }, { "input": { "stdin": "14 3 2\n2\n4\n5" }, "output": { "stdout": "1\n0\n2\n0\n3\n2\n2\n2\n1\n2\n1\n0\n0\n0\n" } }, { "input": { "stdin": "14 3 2\n4\n4\n5" }, "output": { "stdout": "1\n0\n0\n0\n4\n2\n0\n0\n4\n4\n1\n0\n0\n0\n" } }, { "input": { "stdin": "11 2 6\n2\n0\n10" }, "output": { "stdout": "64\n1\n192\n0\n240\n0\n160\n0\n60\n0\n12\n" } }, { "input": { "stdin": "5 1 6\n1\n47\n12" }, "output": { "stdout": "7\n7\n15\n20\n15\n" } }, { "input": { "stdin": "11 0 2\n3\n10\n13" }, "output": { "stdout": "1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n" } }, { "input": { "stdin": "6 3 3\n3\n16\n6" }, "output": { "stdout": "15\n12\n6\n13\n15\n3\n" } }, { "input": { "stdin": "2 1 2\n3\n17\n7" }, "output": { "stdout": "2\n2\n" } }, { "input": { "stdin": "10 3 1\n3\n10\n6" }, "output": { "stdout": "2\n0\n0\n1\n0\n0\n1\n0\n0\n0\n" } }, { "input": { "stdin": "2 3 2\n3\n5\n17" }, "output": { "stdout": "10\n6\n" } }, { "input": { "stdin": "11 3 2\n4\n17\n9" }, "output": { "stdout": "1\n1\n2\n0\n4\n0\n2\n1\n1\n2\n2\n" } }, { "input": { "stdin": "14 3 2\n6\n4\n8" }, "output": { "stdout": "3\n0\n1\n0\n2\n0\n2\n0\n3\n0\n2\n0\n3\n0\n" } }, { "input": { "stdin": "3 0 6\n1\n27\n6" }, "output": { "stdout": "1\n0\n0\n" } }, { "input": { "stdin": "11 1 2\n5\n10\n13" }, "output": { "stdout": "1\n0\n0\n0\n0\n2\n0\n0\n0\n0\n1\n" } }, { "input": { "stdin": "11 2 2\n3\n10\n24" }, "output": { "stdout": "1\n0\n2\n2\n0\n0\n1\n0\n0\n1\n2\n" } }, { "input": { "stdin": "10 3 2\n3\n10\n9" }, "output": { "stdout": "4\n0\n2\n4\n0\n0\n1\n0\n1\n4\n" } }, { "input": { "stdin": "2 2 2\n3\n17\n16" }, "output": { "stdout": "5\n4\n" } }, { "input": { "stdin": "7 3 2\n2\n6\n6" }, "output": { "stdout": "1\n4\n2\n0\n1\n4\n4\n" } }, { "input": { "stdin": "20 2 2\n2\n14\n27" }, "output": { "stdout": "1\n0\n2\n0\n1\n0\n0\n0\n1\n0\n0\n0\n0\n0\n2\n0\n2\n0\n0\n0\n" } }, { "input": { "stdin": "4 3 2\n3\n16\n6" }, "output": { "stdout": "5\n2\n5\n4\n" } }, { "input": { "stdin": "16 2 2\n3\n17\n16" }, "output": { "stdout": "1\n2\n1\n2\n2\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n" } }, { "input": { "stdin": "7 3 2\n3\n6\n6" }, "output": { "stdout": "1\n0\n4\n2\n0\n4\n5\n" } }, { "input": { "stdin": "8 3 2\n5\n30\n6" }, "output": { "stdout": "1\n0\n1\n4\n4\n2\n4\n0\n" } }, { "input": { "stdin": "14 2 4\n12\n2\n9" }, "output": { "stdout": "19\n0\n16\n0\n10\n0\n5\n0\n5\n0\n10\n0\n16\n0\n" } }, { "input": { "stdin": "24 1 2\n2\n14\n3" }, "output": { "stdout": "1\n0\n2\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n" } }, { "input": { "stdin": "14 3 2\n6\n4\n5" }, "output": { "stdout": "1\n0\n0\n0\n2\n2\n2\n0\n1\n2\n3\n2\n1\n0\n" } }, { "input": { "stdin": "14 1 4\n6\n3\n8" }, "output": { "stdout": "1\n0\n0\n0\n4\n0\n4\n0\n0\n0\n1\n0\n6\n0\n" } }, { "input": { "stdin": "2 3 2\n3\n10\n9" }, "output": { "stdout": "8\n8\n" } }, { "input": { "stdin": "14 1 4\n12\n2\n9" }, "output": { "stdout": "1\n0\n0\n0\n0\n0\n1\n0\n4\n0\n6\n0\n4\n0\n" } }, { "input": { "stdin": "8 3 2\n5\n30\n8" }, "output": { "stdout": "4\n0\n1\n2\n1\n4\n4\n0\n" } }, { "input": { "stdin": "2 2 3\n3\n17\n16" }, "output": { "stdout": "13\n14\n" } }, { "input": { "stdin": "10 1 3\n5\n10\n13" }, "output": { "stdout": "4\n0\n0\n0\n0\n4\n0\n0\n0\n0\n" } }, { "input": { "stdin": "24 1 1\n2\n14\n3" }, "output": { "stdout": "1\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n" } }, { "input": { "stdin": "10 3 2\n3\n10\n6" }, "output": { "stdout": "4\n0\n1\n4\n0\n0\n5\n0\n0\n2\n" } }, { "input": { "stdin": "8 3 2\n5\n43\n6" }, "output": { "stdout": "3\n2\n1\n4\n1\n2\n3\n0\n" } }, { "input": { "stdin": "6 3 2\n5\n43\n6" }, "output": { "stdout": "6\n4\n1\n0\n1\n4\n" } }, { "input": { "stdin": "14 3 2\n2\n6\n10" }, "output": { "stdout": "1\n0\n4\n0\n1\n0\n3\n0\n2\n0\n2\n0\n3\n0\n" } }, { "input": { "stdin": "16 1 3\n5\n10\n13" }, "output": { "stdout": "1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n3\n0\n0\n0\n0\n1\n" } }, { "input": { "stdin": "8 1 4\n5\n10\n13" }, "output": { "stdout": "1\n0\n6\n0\n1\n4\n0\n4\n" } }, { "input": { "stdin": "1 0 2\n4\n1\n1" }, "output": { "stdout": "1\n" } }, { "input": { "stdin": "6 1 4\n6\n38\n38" }, "output": { "stdout": "16\n0\n0\n0\n0\n0\n" } } ]

{ "tags": [], "title": "Almost Infinite Glico" }

{ "cpp": "#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\n#define MOD 1000000007\ntypedef vector<int> vec;\nvec calc(vec a,vec b){\n int n=a.size();\n vec res(n,0);\n for(int i=0;i<n;i++){\n for(int j=0;j<n;j++){\n res[(i+j)%n]+=a[i]*b[j];\n res[(i+j)%n]%=MOD;\n }\n }\n return res;\n}\nsigned main(){\n int n,m,k;\n cin>>n>>m>>k;\n int p[m];\n for(int i=0;i<m;i++) cin>>p[i];\n vec t(n,0);\n t[0]=1;\n for(int i=0;i<m;i++) t[p[i]%n]++;\n vec ans=t;k--;\n while(k){\n if(k&1) ans=calc(ans,t);\n t=calc(t,t);\n k>>=1;\n }\n for(int i=0;i<n;i++) cout<<ans[i]<<endl;\n return 0;\n}", "java": "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 Main {\n\tstatic InputStream is;\n\tstatic PrintWriter out;\n\tstatic String INPUT = \"\";\n\t\n\tstatic void solve()\n\t{\n\t\tint n = ni(), m = ni(), K = ni();\n\t\tint[] P = na(m);\n\t\tint[] M = new int[n];\n\t\tM[0] = 1;\n\t\tfor(int i = 0;i < m;i++){\n\t\t\tM[P[i]%n]++;\n\t\t}\n\t\tint[] v = new int[n];\n\t\tv[0] = 1;\n\t\tint[] ret = powc(M, v, K, 1000000007);\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tout.println(ret[i]);\n\t\t}\n\t}\n\t\n\tstatic int[] powc(int[] A, int[] v, long e, int mod)\n\t{\n\t\tint[] MUL = A;\n\t\tfor(int i = 0;i < v.length;i++)v[i] %= mod;\n\t\tfor(;e > 0;e>>>=1){\n\t\t\tif((e&1)==1)v = mulc(MUL, v, mod);\n\t\t\tMUL = mulc(MUL, MUL, mod);\n\t\t}\n\t\treturn v;\n\t}\n\tpublic static int[] mulc(int[] A, int[] B, int mod)\n\t{\n\t\tint n = A.length;\n\t\tint[] C = new int[n];\n\t\tfinal long BIG = 8L*mod*mod;\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tlong sum = 0;\n\t\t\tfor(int j = 0, k = i;j < n;j++,k--){\n\t\t\t\tif(k < 0)k = n-1;\n\t\t\t\tsum += (long)A[k] * B[j];\n\t\t\t\tif(sum >= BIG)sum -= BIG;\n\t\t\t}\n\t\t\tC[i] = (int)(sum % mod);\n\t\t}\n\t\treturn C;\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception\n\t{\n\t\tlong S = System.currentTimeMillis();\n\t\tis = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tsolve();\n\t\tout.flush();\n\t\tlong G = System.currentTimeMillis();\n\t\ttr(G-S+\"ms\");\n\t}\n\t\n\tprivate static boolean eof()\n\t{\n\t\tif(lenbuf == -1)return true;\n\t\tint lptr = ptrbuf;\n\t\twhile(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;\n\t\t\n\t\ttry {\n\t\t\tis.mark(1000);\n\t\t\twhile(true){\n\t\t\t\tint b = is.read();\n\t\t\t\tif(b == -1){\n\t\t\t\t\tis.reset();\n\t\t\t\t\treturn true;\n\t\t\t\t}else if(!isSpaceChar(b)){\n\t\t\t\t\tis.reset();\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t} catch (IOException e) {\n\t\t\treturn true;\n\t\t}\n\t}\n\t\n\tprivate static byte[] inbuf = new byte[1024];\n\tpublic static int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate static 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 static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate static double nd() { return Double.parseDouble(ns()); }\n\tprivate static char nc() { return (char)skip(); }\n\t\n\tprivate static 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 static 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 static 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 static 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 static 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 static 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 static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }\n}", "python": null }

[ { "input": { "stdin": "4\n2 1 4 3" }, "output": { "stdout": "4" } }, { "input": { "stdin": "4\n3 4 1 2" }, "output": { "stdout": "4\n" } }, { "input": { "stdin": "4\n1 3 2 4" }, "output": { "stdout": "2\n" } }, { "input": { "stdin": "4\n1 3 4 2" }, "output": { "stdout": "1\n" } }, { "input": { "stdin": "4\n1 4 3 2" }, "output": { "stdout": "2\n" } }, { "input": { "stdin": "4\n3 1 2 4" }, "output": { "stdout": "1\n" } }, { "input": { "stdin": "4\n2 3 4 1" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "4\n4 1 3 2" }, "output": { "stdout": "1\n" } }, { "input": { "stdin": "4\n1 4 2 3" }, "output": { "stdout": "1\n" } }, { "input": { "stdin": "4\n3 1 2 4" }, "output": { "stdout": "1\n" } }, { "input": { "stdin": "4\n3 2 4 1" }, "output": { "stdout": "1\n" } }, { "input": { "stdin": "4\n4 1 2 3" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "4\n2 4 3 1" }, "output": { "stdout": "1\n" } }, { "input": { "stdin": "4\n3 1 4 2" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "4\n2 3 1 4" }, "output": { "stdout": "1\n" } }, { "input": { "stdin": "4\n3 2 1 4" }, "output": { "stdout": "2\n" } }, { "input": { "stdin": "4\n3 2 4 1" }, "output": { "stdout": "1\n" } }, { "input": { "stdin": "4\n1 4 2 3" }, "output": { "stdout": "1\n" } }, { "input": { "stdin": "4\n1 2 3 4" }, "output": { "stdout": "16\n" } }, { "input": { "stdin": "4\n3 2 1 4" }, "output": { "stdout": "2\n" } }, { "input": { "stdin": "4\n1 3 2 4" }, "output": { "stdout": "2\n" } }, { "input": { "stdin": "4\n2 3 4 1" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "4\n2 1 3 4" }, "output": { "stdout": "2\n" } }, { "input": { "stdin": "4\n1 2 4 3" }, "output": { "stdout": "2\n" } }, { "input": { "stdin": "4\n1 3 4 2" }, "output": { "stdout": "1\n" } }, { "input": { "stdin": "4\n1 4 3 2" }, "output": { "stdout": "2\n" } }, { "input": { "stdin": "4\n1 2 4 3" }, "output": { "stdout": "2\n" } }, { "input": { "stdin": "4\n3 4 2 1" }, "output": { "stdout": "0\n" } }, { "input": { "stdin": "4\n2 1 3 4" }, "output": { "stdout": "2\n" } }, { "input": { "stdin": "4\n1 2 3 4" }, "output": { "stdout": "16\n" } }, { "input": { "stdin": "4\n4 3 2 1" }, "output": { "stdout": "4\n" } }, { "input": { "stdin": "4\n4 2 3 1" }, "output": { "stdout": "2\n" } } ]

{ "tags": [], "title": "Invariant Tree" }

{ "cpp": "#include<bits/stdc++.h>\n\n#define pb push_back\n#define mp make_pair\n#define fi first\n#define se second\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\ntemplate <typename T> bool chkmax(T &x,T y){return x<y?x=y,true:false;}\ntemplate <typename T> bool chkmin(T &x,T y){return x>y?x=y,true:false;}\n\nint readint(){\n\tint x=0,f=1; char ch=getchar();\n\twhile(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}\n\twhile(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}\n\treturn x*f;\n}\n\nconst int cys=998244353;\nint n;\nll a[300005],fac[300005],inv[300005],hv[300005];\nbool vis[300005];\nvector<int> v;\n\nll qpow(ll x,ll p){\n\tll ret=1;\n\tfor(;p;p>>=1,x=x*x%cys) if(p&1) ret=ret*x%cys;\n\treturn ret;\n}\n\nint main(){\n\tn=readint();\n\tfac[0]=inv[0]=1;\n\tfor(int i=1;i<=n;i++) fac[i]=fac[i-1]*i%cys;\n\tinv[n]=qpow(fac[n],cys-2);\n\tfor(int i=n-1;i>=1;i--) inv[i]=inv[i+1]*(i+1)%cys;\n\tfor(int i=1;i<=n;i++) a[i]=readint();\n\tfor(int i=1;i<=n;i++){\n\t\tif(vis[i]) continue;\n\t\tint cnt=0;\n\t\tfor(int u=i;!vis[u];u=a[u]) cnt++,vis[u]=1;\n\t\tv.pb(cnt);\n\t}\n\tsort(v.begin(),v.end());\n\tif(v[0]>2) return printf(\"0\\n\"),0;\n\tif(v[0]==1){\n\t\tll ans=1;\n\t\tfor(int i=0;i<v.size();){\n\t\t\tint num=v[i],cr=0;\n\t\t\twhile(v[i]==num) cr++,i++;\n\t\t\tif(num>1){\n\t\t\t\tll tmp=0;\n\t\t\t\tfor(int j=1;j<=cr;j++)\n\t\t\t\t\ttmp=(tmp+fac[cr-1]*inv[j-1]%cys*inv[cr-j]%cys*qpow(cr,cr-j)%cys*qpow(hv[num],j)%cys*qpow(num,cr-j))%cys;\n\t\t\t\tans=ans*tmp%cys;\n\t\t\t}\n\t\t\telse ans=cr==1?1:qpow(cr,cr-2);\n\t\t\tfor(int j=num<<1;j<=n;j+=num) hv[j]+=cr*num;\n\t\t}\n\t\tprintf(\"%lld\\n\",ans);\n\t}\n\telse{\n\t\tll ans=1;\n\t\tfor(int i=0;i<v.size();){\n\t\t\tint num=v[i],cr=0;\n\t\t\twhile(v[i]==num) cr++,i++;\n\t\t\tif(num>2){\n\t\t\t\tll tmp=0;\n\t\t\t\tfor(int j=1;j<=cr;j++)\n\t\t\t\t\ttmp=(tmp+fac[cr-1]*inv[j-1]%cys*inv[cr-j]%cys*qpow(cr,cr-j)%cys*qpow(hv[num],j)%cys*qpow(num,cr-j))%cys;\n\t\t\t\tans=ans*tmp%cys;\n\t\t\t}\n\t\t\telse ans=qpow(cr,cr-1)*qpow(num,cr-1)%cys;\n\t\t\tfor(int j=num<<1;j<=n;j+=num) hv[j]+=cr*num;\n\t\t}\n\t\tprintf(\"%lld\\n\",ans);\n\t}\n\treturn 0;\n}\n", "java": null, "python": null }

[ { "input": { "stdin": "" }, "output": { "stdout": "" } } ]

{ "tags": [], "title": "Test" }

{ "cpp": "#include <algorithm>\n#include <cassert>\n#include <cstdio>\n#include <iostream>\n#include <limits>\n#include <random>\n#include <utility>\n#include <vector>\n\nnamespace procon {\nclass UnionFind {\nprivate:\n struct nodeinfo {\n int par;\n int rank;\n nodeinfo(int par) : par(par), rank(0) {}\n };\n std::vector<nodeinfo> node;\n\npublic:\n UnionFind(int n) : node() {\n node.reserve(n);\n for (int i = 0; i < n; ++i) {\n node.push_back(nodeinfo(i));\n }\n }\n int root(int x) {\n if (node[x].par == x) {\n return x;\n }\n return node[x].par = root(node[x].par);\n }\n void unite(int x, int y) {\n x = root(x);\n y = root(y);\n if (x == y) {\n return;\n }\n if (node[x].rank < node[y].rank) {\n node[x].par = y;\n } else {\n node[y].par = x;\n if (node[x].rank == node[y].rank) {\n ++node[x].rank;\n }\n }\n }\n bool is_same_set(int x, int y) { return root(x) == root(y); }\n};\n}\n \nint main(void) {\n int size, n_query;\n std::cin.read((char *)&size, sizeof(int));\n std::cin.read((char *)&n_query, sizeof(int));\n\n std::vector<uint64_t> query(n_query);\n std::cin.read((char *)query.data(), sizeof(uint64_t) * n_query);\n\n const int mask = (1 << 30) - 1;\n\n uint64_t res = 123456789;\n procon::UnionFind uf(size);\n for (uint64_t q : query) {\n const int com = q >> 60;\n const int x = (q >> 30) & mask;\n const int y = (q >> 0) & mask;\n assert(0 <= x && x < size);\n assert(0 <= y && y < size);\n if (com) {\n res = res * 17 + (uf.is_same_set(x, y) ? 1 : 0);\n } else {\n uf.unite(x, y);\n }\n }\n std::cout << res << std::endl;\n return 0;\n}\n\n", "java": null, "python": null }

[ { "input": { "stdin": "4 5 2\n0 1 2 1\n0 2 1 2\n1 2 1 1\n1 3 1 3\n2 3 2 1" }, "output": { "stdout": "6" } }, { "input": { "stdin": "" }, "output": { "stdout": "" } }, { "input": { "stdin": "6 5 2\n0 1 4 0\n0 2 0 -1\n1 3 2 1\n0 2 1 11\n2 2 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "6 5 2\n0 1 2 0\n0 2 0 1\n0 3 2 1\n0 1 1 11\n2 2 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "4 5 2\n0 0 4 1\n0 2 0 2\n1 2 1 1\n2 3 1 3\n2 3 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "4 3 2\n0 1 2 0\n0 2 1 7\n1 2 1 1\n1 3 1 3\n2 3 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "4 5 2\n0 1 2 0\n0 2 1 2\n0 2 1 1\n1 3 1 3\n2 3 1 1" }, "output": { "stdout": "5\n" } }, { "input": { "stdin": "4 5 2\n0 1 2 0\n0 2 1 7\n1 2 1 1\n1 3 1 3\n2 3 2 1" }, "output": { "stdout": "5\n" } }, { "input": { "stdin": "4 5 2\n0 1 2 1\n0 3 1 1\n2 2 0 1\n1 3 0 0\n2 3 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "4 5 2\n0 1 2 1\n0 3 0 2\n2 2 1 1\n1 3 0 3\n2 3 2 0" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "4 0 2\n0 0 4 1\n0 2 0 2\n1 2 1 1\n2 3 1 3\n2 3 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "4 5 2\n0 1 2 1\n0 3 1 2\n1 2 1 1\n1 3 1 5\n2 3 2 1" }, "output": { "stdout": "5\n" } }, { "input": { "stdin": "11 7 2\n0 1 2 0\n0 2 0 -1\n0 3 2 1\n0 1 1 11\n2 2 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "3 0 2\n0 0 4 1\n0 2 0 2\n1 2 1 1\n2 3 1 3\n1 3 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "4 5 2\n0 1 2 1\n0 3 0 2\n2 2 1 1\n1 3 0 3\n2 2 2 0" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "4 5 2\n0 1 2 1\n0 3 1 2\n1 2 1 1\n1 3 0 3\n2 3 2 1" }, "output": { "stdout": "5\n" } }, { "input": { "stdin": "4 5 2\n0 1 2 1\n0 3 1 2\n0 2 1 1\n1 3 0 3\n2 3 2 1" }, "output": { "stdout": "4\n" } }, { "input": { "stdin": "4 5 2\n0 1 2 1\n0 3 1 2\n1 2 1 1\n1 3 1 3\n2 3 2 1" }, "output": { "stdout": "5\n" } }, { "input": { "stdin": "4 5 2\n0 1 2 1\n0 3 1 2\n2 2 1 1\n1 3 0 3\n2 3 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "4 5 2\n0 1 2 0\n0 2 1 2\n1 2 2 1\n0 3 1 3\n2 2 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "6 5 2\n0 1 2 0\n0 0 0 1\n2 3 2 1\n0 2 1 6\n2 2 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "7 5 2\n0 1 2 1\n0 3 0 2\n2 2 1 1\n1 6 0 3\n2 2 2 0" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "7 5 2\n0 1 2 1\n0 3 0 2\n2 2 0 1\n1 6 0 3\n2 2 2 0" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "6 5 2\n0 1 2 0\n0 2 0 2\n1 3 2 1\n0 2 1 5\n2 2 4 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "6 5 2\n0 1 2 0\n0 2 0 2\n1 2 2 1\n1 3 2 3\n2 2 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "4 2 2\n0 1 2 1\n0 3 1 2\n1 2 1 1\n1 6 1 5\n2 3 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "4 5 2\n0 1 2 0\n0 2 1 2\n1 2 1 1\n1 3 1 3\n2 3 2 1" }, "output": { "stdout": "5\n" } }, { "input": { "stdin": "4 5 2\n0 0 4 1\n0 2 1 2\n1 2 1 1\n1 3 1 3\n2 3 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "4 5 2\n0 0 4 1\n0 2 1 2\n1 2 1 1\n2 3 1 3\n2 3 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "6 5 2\n0 1 2 0\n0 2 0 0\n1 1 2 1\n0 2 1 11\n2 2 3 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "6 5 2\n0 1 2 0\n0 1 0 2\n1 3 2 1\n0 2 1 3\n2 2 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "4 5 2\n0 1 2 0\n0 2 1 2\n1 2 2 1\n0 3 1 3\n2 3 2 1" }, "output": { "stdout": "4\n" } }, { "input": { "stdin": "6 5 2\n0 1 2 0\n0 2 0 2\n1 2 2 1\n1 3 1 3\n2 2 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "6 5 2\n0 1 2 0\n0 2 1 2\n1 2 2 1\n0 3 1 3\n2 2 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "6 5 2\n0 1 2 0\n0 2 0 2\n1 3 2 1\n0 2 1 3\n2 2 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "6 5 2\n0 1 2 0\n0 2 0 0\n0 3 2 1\n0 1 1 11\n2 2 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "4 5 2\n0 1 2 1\n0 3 1 2\n2 2 0 1\n1 3 0 0\n2 3 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "6 5 2\n0 1 2 0\n0 2 0 2\n1 2 2 1\n0 3 1 3\n2 2 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "6 5 2\n0 1 2 0\n0 2 0 2\n1 3 2 1\n0 2 1 11\n2 2 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "6 5 2\n0 1 2 0\n0 0 0 2\n2 3 2 1\n0 2 1 6\n2 2 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "4 5 2\n0 1 2 0\n0 2 1 2\n1 2 1 1\n0 3 1 3\n2 3 2 1" }, "output": { "stdout": "5\n" } }, { "input": { "stdin": "4 5 2\n0 1 2 0\n0 2 1 6\n1 1 1 1\n1 3 1 3\n2 3 4 1" }, "output": { "stdout": "10\n" } }, { "input": { "stdin": "4 5 2\n0 0 2 1\n0 2 1 2\n1 2 1 1\n1 3 1 3\n2 3 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "4 5 2\n0 1 2 1\n0 3 1 2\n2 2 1 1\n1 3 0 0\n2 3 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "4 5 2\n0 1 2 0\n0 2 1 6\n1 1 1 1\n1 3 1 3\n2 3 2 1" }, "output": { "stdout": "10\n" } }, { "input": { "stdin": "4 5 3\n1 1 2 0\n0 2 1 2\n1 2 2 1\n0 3 1 6\n2 2 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "10 5 2\n0 1 2 0\n0 1 0 2\n1 3 1 1\n0 2 1 3\n2 2 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "6 7 2\n0 1 2 0\n0 2 0 -1\n0 3 2 1\n0 1 1 11\n2 2 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "4 5 2\n1 0 4 1\n0 2 1 2\n1 2 1 1\n2 3 1 3\n2 3 2 1" }, "output": { "stdout": "-1\n" } }, { "input": { "stdin": "6 5 2\n0 1 2 0\n0 2 0 2\n1 3 2 1\n0 2 1 11\n2 2 3 1" }, "output": { "stdout": "-1\n" } } ]

{ "tags": [], "title": "Minimum Cost Flow" }

{ "cpp": "#include <cassert>\n#include <iostream>\n#include <vector>\n#include <queue>\n#include <utility>\n#include <tuple>\n#include <limits>\nusing namespace std;\n\nstruct MinCostFlowGraph {\nprivate:\n using ll = long long;\n struct edge {\n int to;\n ll cap, cost;\n int r_idx;\n edge(int t, ll cap, ll cost, int r) :\n to(t), cap(cap), cost(cost), r_idx(r) {}\n };\n vector<vector<edge>> G;\n int sz;\npublic:\n MinCostFlowGraph(int n) : G(n), sz(n) {}\n\n void add_edge(int from, int to, ll cap, ll cost){\n int i = G[to].size(), i_ = G[from].size();\n G[from].emplace_back(to,cap,cost,i);\n G[to].emplace_back(from,0,-cost,i_);\n }\n ll min_cost_flow(int from, int to, ll f){\n ll ans = 0;\n while(f > 0){\n const ll INF = numeric_limits<ll>::max();\n vector<ll> dist(sz,INF);\n dist[from] = 0;\n vector<ll> potential(sz);\n vector<int> prev_v(sz,-1);\n vector<int> prev_e(sz,-1);\n priority_queue<pair<ll,int>> pq;\n pq.emplace(0,from);\n while(pq.size()){\n // auto [d, v] = pq.top();\n ll d, v;\n tie(d,v) = pq.top();\n d *= -1;\n pq.pop();\n if(dist[v] < d) continue;\n for(size_t i = 0; i < G[v].size(); ++i){\n const auto& e = G[v][i];\n if(e.cap == 0) continue;\n int v_ = e.to;\n ll d_ = d + e.cost + potential[v] - potential[v_];\n if(dist[v_] <= d_)\n continue;\n dist[v_] = d_;\n prev_v[v_] = v;\n prev_e[v_] = i;\n pq.emplace(-d_,e.to);\n }\n }\n if(dist[to] >= INF) return -1;\n for(int i = 0; i < sz; ++i)\n potential[i] += dist[i];\n int v = to;\n ll flow = f;\n while(v != from){\n int v_ = prev_v[v];\n flow = min(flow,G[v_][prev_e[v]].cap);\n v = v_;\n }\n v = to;\n while(v != from){\n int v_ = prev_v[v];\n auto& e = G[v_][prev_e[v]];\n e.cap -= flow;\n ans += flow*e.cost;\n G[v][e.r_idx].cap += flow;\n v = v_;\n }\n f -= flow;\n }\n return ans;\n }\n};\n\nint main(){\n int n, m, f;\n cin >> n >> m >> f;\n MinCostFlowGraph G(n);\n for(int i = 0; i < m; ++i){\n long long u, v, c, d;\n cin >> u >> v >> c >> d;\n G.add_edge(u,v,c,d);\n }\n cout << G.min_cost_flow(0,n-1,f) << endl;\n}\n\n", "java": "import java.util.*;\nimport java.io.*;\nimport java.awt.geom.*;\nimport java.math.*;\n\npublic class Main {\n\n\tstatic final Scanner in = new Scanner(System.in);\n\tstatic final PrintWriter out = new PrintWriter(System.out,false);\n\tstatic boolean debug = false;\n\n\tstatic int primalDual(int[][][] cost, int[][][] capacity, int source, int sink, int f) {\n\t\tint n = cost.length;\n\n\t\tint[][] flow = new int[n][];\n\t\tfor (int i=0; i<n; i++)\n\t\t\tflow[i] = new int[cost[i].length];\n\n\t\tint[][][] rev = new int[n][][];\n\n\t\tint[] cnt = new int[n];\n\t\tfor (int i=0; i<n; i++)\n\t\t\tfor (int j=0; j<cost[i].length; j++)\n\t\t\t\tcnt[cost[i][j][0]]++;\n\t\tfor (int i=0; i<n; i++) rev[i] = new int[cnt[i]][2];\n\t\tfor (int i=n-1; i>=0; i--) {\n\t\t\tfor (int j=0; j<cost[i].length; j++) {\n\t\t\t\tint ptr = --cnt[cost[i][j][0]];\n\t\t\t\trev[cost[i][j][0]][ptr][0] = i;\n\t\t\t\trev[cost[i][j][0]][ptr][1] = j;\n\t\t\t}\n\t\t}\n\n\t\tint mincost = 0;\n\t\tint[] h = new int[n];\n\n\t\tfinal int[] d = new int[n];\n\t\tTreeSet<Integer> que = new TreeSet<Integer>(new Comparator<Integer>(){\n\t\t\tpublic int compare(Integer a, Integer b) {\n\t\t\t\tif (d[a] != d[b]) return d[a] - d[b];\n\t\t\t\treturn a - b;\n\t\t\t}\n\t\t});\n\n\t\twhile (f > 0) {\n\t\t\tint[] prev = new int[n];\n\t\t\tint[] myidx = new int[n];\n\t\t\tArrays.fill(prev,-1); Arrays.fill(d,Integer.MAX_VALUE/2);\n\t\t\td[source] = 0;\n\t\t\tque.add(source);\n\n\t\t\twhile (!que.isEmpty()) {\n\t\t\t\tint cur = que.pollFirst();\n\t\t\t\tfor (int i=0; i<cost[cur].length; i++) {\n\t\t\t\t\tint to = cost[cur][i][0];\n\t\t\t\t\tif (capacity[cur][i][1] - flow[cur][i] > 0) {\n\t\t\t\t\t\tint c = d[cur] + cost[cur][i][1] + h[cur] - h[to];\n\t\t\t\t\t\tif (d[to] > c) {\n\t\t\t\t\t\t\tque.remove(to);\n\t\t\t\t\t\t\td[to] = c;\n\t\t\t\t\t\t\tprev[to] = cur;\n\t\t\t\t\t\t\tmyidx[to] = i;\n\t\t\t\t\t\t\tque.add(to);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tfor (int i=0; i<rev[cur].length; i++) {\n\t\t\t\t\tint to = rev[cur][i][0];\n\t\t\t\t\tint ridx = rev[cur][i][1];\n\t\t\t\t\tif (flow[to][ridx] > 0) {\n\t\t\t\t\t\tint c = d[cur] - cost[to][ridx][1] + h[cur] - h[to];\n\t\t\t\t\t\tif (d[to] > c) {\n\t\t\t\t\t\t\tque.remove(to);\n\t\t\t\t\t\t\td[to] = c;\n\t\t\t\t\t\t\tprev[to] = cur;\n\t\t\t\t\t\t\tmyidx[to] = ~ridx;\n\t\t\t\t\t\t\tque.add(to);\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\tif (prev[sink] == -1) break;\n\n\t\t\tint flowlimit = f;\n\t\t\tint sumcost = 0;\n\t\t\tfor (int i=sink; i!=source; i=prev[i]) {\n\t\t\t\tif (myidx[i] >= 0) {\n\t\t\t\t\tflowlimit = Math.min(flowlimit, capacity[prev[i]][myidx[i]][1] - flow[prev[i]][myidx[i]]);\n\t\t\t\t\tsumcost += cost[prev[i]][myidx[i]][1];\n\t\t\t\t}else {\n\t\t\t\t\tint idx = ~myidx[i];\n\t\t\t\t\tflowlimit = Math.min(flowlimit,flow[i][idx]);\n\t\t\t\t\tsumcost -= cost[i][idx][1];\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tmincost += flowlimit*sumcost;\n\t\t\tfor (int i=sink; i!=source; i=prev[i]) {\n\t\t\t\tif (myidx[i] >= 0) {\n\t\t\t\t\tflow[prev[i]][myidx[i]] += flowlimit;\n\t\t\t\t}else {\n\t\t\t\t\tint idx = ~myidx[i];\n\t\t\t\t\tflow[i][idx] -= flowlimit;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tf -= flowlimit;\n\t\t\tfor (int i=0; i<n; i++) h[i] += d[i];\n\t\t}\n\n\t\treturn f > 0 ? -1 : mincost;\n\t}\n\n\tstatic int[][][] directedGraph(int n, int[] from, int[] to, int[] cost) {\n\t\tint[] cnt = new int[n];\n\t\tfor (int i : from) cnt[i]++;\n\n\t\tint[][][] g = new int[n][][];\n\t\tfor (int i=0; i<n; i++) g[i] = new int[cnt[i]][2];\n\t\tfor (int i=0; i<from.length; i++) {\n\t\t\tint s = from[i];\n\t\t\tint t = to[i];\n\n\t\t\tg[s][--cnt[s]][0] = t;\n\t\t\tg[s][cnt[s]][1] = cost[i];\n\t\t}\n\n\t\treturn g;\n\t}\n\n\tstatic void solve() {\n\t\tint v = in.nextInt();\n\t\tint e = in.nextInt();\n\t\tint f = in.nextInt();\n\t\tint[] s = new int[e];\n\t\tint[] t = new int[e];\n\t\tint[] c = new int[e];\n\t\tint[] d = new int[e];\n\t\tfor (int i=0; i<e; i++) {\n\t\t\ts[i] = in.nextInt();\n\t\t\tt[i] = in.nextInt();\n\t\t\tc[i] = in.nextInt();\n\t\t\td[i] = in.nextInt();\n\t\t}\n\t\tint[][][] cost = directedGraph(v, s, t, d);\n\t\tint[][][] capacity = directedGraph(v, s, t, c);\n\t\tout.println(primalDual(cost, capacity, 0, v-1, f));\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tdebug = args.length > 0;\n\t\tlong start = System.nanoTime();\n\n\t\tsolve();\n\t\tout.flush();\n\n\t\tlong end = System.nanoTime();\n\t\tdump((end - start) / 1000000 + \" ms\");\n\t\tin.close();\n\t\tout.close();\n\t}\n\n\tstatic void dump(Object... o) { if (debug) System.err.println(Arrays.deepToString(o)); }\n}", "python": "class MinCostFlow:\n def __init__(self, n):\n self.n = n\n self.G = [[] for i in range(n)]\n\n def addEdge(self, f, t, cap, cost):\n # [to, cap, cost, rev]\n self.G[f].append([t, cap, cost, len(self.G[t])])\n self.G[t].append([f, 0, -cost, len(self.G[f])-1])\n\n def minCostFlow(self, s, t, f):\n n = self.n\n G = self.G\n prevv = [0]*n; preve = [0]*n\n INF = 10**9+7\n\n res = 0\n while f:\n dist = [INF]*n\n dist[s] = 0\n update = 1\n while update:\n update = 0\n for v in range(n):\n if dist[v] == INF:\n continue\n gv = G[v]\n for i in range(len(gv)):\n to, cap, cost, rev = gv[i]\n if cap > 0 and dist[v] + cost < dist[to]:\n dist[to] = dist[v] + cost\n prevv[to] = v; preve[to] = i\n update = 1\n if dist[t] == INF:\n return -1\n\n d = f; v = t\n while v != s:\n d = min(d, G[prevv[v]][preve[v]][1])\n v = prevv[v]\n f -= d\n res += d * dist[t]\n v = t\n while v != s:\n e = G[prevv[v]][preve[v]]\n e[1] -= d\n G[v][e[3]][1] += d\n v = prevv[v]\n return res\n\nn, m, f = map(int, input().split())\ngraph = MinCostFlow(n)\nfor i in range(m):\n u, v, c, d = map(int, input().split())\n graph.addEdge(u, v, c, d)\nprint(graph.minCostFlow(0, n-1, f))" }