1:\\n primfac.append(n)\\n return primfac\\nt = int(raw_input())\\nfor _ in range(t):\\n l = []\\n ans = []\\n d = {}\\n sd = {}\\n d[2] = 0\\n n = int(raw_input())\\n l = primes(n)\\n for i in l:\\n if i not in d:\\n d[i] = 1\\n else:\\n d[i] += 1\\n if(len(d)==2 and d[2]==0):\\n print '2^0'\\n else:\\n sd = sorted(d.items())\\n for k,v in sd:\\n ans.append(\\\"%d^%d\\\"%(k,v))\\n print \\\"*\\\".join(ans)\"\n}"}}},{"rowIdx":492,"cells":{"id":{"kind":"string","value":"HackerEarth/the-strongest-string-1-1"},"content":{"kind":"string","value":"Maga and Alex are good at string manipulation problems. Just now they have faced a problem related to string. But it is not a standard string problem. They have no idea to solve it. They need your help.\n\nA string is called unique if all characters of string are distinct.\n\nString s_1 is called subsequence of string s_2 if s_1 can be produced from s_2 by removing some characters of s_2.\n\nString s_1 is stronger than s_2 if s_1 is lexicographically greater than s_2.\n\nYou are given a string. Your task is to find the strongest unique string which is subsequence of given string.\n\nInput:\n\nfirst line contains length of string.\nsecond line contains the string.\n\nOutput:\n\nOutput the strongest unique string which is subsequence of given string.\n\nConstraints:\n\n1 ≤ |S| ≤ 100000 \n\nAll letters are lowercase English letters.\n\nSAMPLE INPUT\n5\r\nabvzx\r\n\nSAMPLE OUTPUT\nzx\r\n\nExplanation\n\nSelect all subsequence of the string and sort them in ascending order. The greatest of all is zx."},"test":{"kind":"list like","value":[{"input":{"stdin":"5\nabvzx\n\nSAMPLE"},"output":{"stdout":"zx\n"}},{"input":{"stdin":"5\nxywba\n\nETAMOL"},"output":{"stdout":"ywba\n"}},{"input":{"stdin":"5\nbywaw\n\nSOMALF"},"output":{"stdout":"ywa\n"}},{"input":{"stdin":"5\naywbx\n\nSAMOLE"},"output":{"stdout":"yx\n"}},{"input":{"stdin":"5\nabvxz\n\nSBMOLE"},"output":{"stdout":"z\n"}},{"input":{"stdin":"5\nyxxaa\n\nMROENA"},"output":{"stdout":"yxa\n"}},{"input":{"stdin":"5\nzavbx\n\nELOMAS"},"output":{"stdout":"zx\n"}},{"input":{"stdin":"5\nw`wyb\n\nSOMALG"},"output":{"stdout":"yb\n"}},{"input":{"stdin":"5\nvzyaa\n\nBKNREN"},"output":{"stdout":"zya\n"}},{"input":{"stdin":"5\nx`xvc\n\nMRPEMA"},"output":{"stdout":"xvc\n"}},{"input":{"stdin":"5\nabwyx\n\nLAMOTE"},"output":{"stdout":"yx\n"}},{"input":{"stdin":"5\nx`yvb\n\nMRPEMA"},"output":{"stdout":"yvb\n"}},{"input":{"stdin":"5\nazwbx\n\nSAMOLE"},"output":{"stdout":"zx\n"}},{"input":{"stdin":"5\navzxa\n\nREONKB"},"output":{"stdout":"zxa\n"}},{"input":{"stdin":"5\nxwv^b\n\nERMMAP"},"output":{"stdout":"xwvb\n"}},{"input":{"stdin":"5\naywbx\n\nLAMOTE"},"output":{"stdout":"yx\n"}},{"input":{"stdin":"5\nxbvaz\n\nSBMPLE"},"output":{"stdout":"z\n"}},{"input":{"stdin":"5\nwawyb\n\nSOMALG"},"output":{"stdout":"yb\n"}},{"input":{"stdin":"5\nyzw`b\n\nCTALON"},"output":{"stdout":"zwb\n"}},{"input":{"stdin":"5\nzawcw\n\nSEMOKA"},"output":{"stdout":"zwc\n"}},{"input":{"stdin":"5\nywxba\n\nNROENA"},"output":{"stdout":"yxba\n"}},{"input":{"stdin":"5\nxbv`z\n\nSAMPLE"},"output":{"stdout":"z\n"}},{"input":{"stdin":"5\nbawyx\n\nETALOM"},"output":{"stdout":"yx\n"}},{"input":{"stdin":"5\nxvx`b\n\nMROEMA"},"output":{"stdout":"xvb\n"}},{"input":{"stdin":"5\nzavbx\n\nSAMOLE"},"output":{"stdout":"zx\n"}},{"input":{"stdin":"5\nyxxab\n\nMROEMA"},"output":{"stdout":"yxb\n"}},{"input":{"stdin":"5\nazvbx\n\nSAMOLE"},"output":{"stdout":"zx\n"}},{"input":{"stdin":"5\nzdavv\n\nLDTPAL"},"output":{"stdout":"zv\n"}},{"input":{"stdin":"5\n`vbzx\n\nSALPLE"},"output":{"stdout":"zx\n"}},{"input":{"stdin":"5\nxbv`z\n\nSAMPLF"},"output":{"stdout":"z\n"}},{"input":{"stdin":"5\nabwyx\n\nETALOM"},"output":{"stdout":"yx\n"}},{"input":{"stdin":"5\nzavbw\n\nSEMOKA"},"output":{"stdout":"zw\n"}},{"input":{"stdin":"5\nxzvba\n\nSAMOME"},"output":{"stdout":"zvba\n"}},{"input":{"stdin":"5\nxw`xb\n\nSOMALE"},"output":{"stdout":"xwb\n"}},{"input":{"stdin":"5\nb`xwv\n\nMAFORM"},"output":{"stdout":"xwv\n"}},{"input":{"stdin":"5\nzavbw\n\nSAMOKE"},"output":{"stdout":"zw\n"}},{"input":{"stdin":"5\nxvzab\n\nBKNNER"},"output":{"stdout":"zb\n"}},{"input":{"stdin":"5\nxavaz\n\nSEMOKA"},"output":{"stdout":"z\n"}},{"input":{"stdin":"5\nbaxxx\n\nMROEMA"},"output":{"stdout":"x\n"}},{"input":{"stdin":"5\nxbyuc\n\nSAMPLE"},"output":{"stdout":"yuc\n"}},{"input":{"stdin":"5\nazwax\n\nSOMALF"},"output":{"stdout":"zx\n"}},{"input":{"stdin":"5\nabwyx\n\nETAMOL"},"output":{"stdout":"yx\n"}},{"input":{"stdin":"5\nxavaz\n\nREMOKA"},"output":{"stdout":"z\n"}},{"input":{"stdin":"5\nzavax\n\nAKOMER"},"output":{"stdout":"zx\n"}},{"input":{"stdin":"5\naxzua\n\nBEONKR"},"output":{"stdout":"zua\n"}},{"input":{"stdin":"5\nzxwba\n\nSANOLE"},"output":{"stdout":"zxwba\n"}},{"input":{"stdin":"5\nbawyx\n\nDTALOM"},"output":{"stdout":"yx\n"}},{"input":{"stdin":"5\nxavaz\n\nAKOMER"},"output":{"stdout":"z\n"}},{"input":{"stdin":"5\nb`wyy\n\nCTAMON"},"output":{"stdout":"y\n"}},{"input":{"stdin":"5\nyaxbv\n\nSLOM@E"},"output":{"stdout":"yxv\n"}}],"string":"[\n {\n \"input\": {\n \"stdin\": \"5\\nabvzx\\n\\nSAMPLE\"\n },\n \"output\": {\n \"stdout\": \"zx\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nxywba\\n\\nETAMOL\"\n },\n \"output\": {\n \"stdout\": \"ywba\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nbywaw\\n\\nSOMALF\"\n },\n \"output\": {\n \"stdout\": \"ywa\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\naywbx\\n\\nSAMOLE\"\n },\n \"output\": {\n \"stdout\": \"yx\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nabvxz\\n\\nSBMOLE\"\n },\n \"output\": {\n \"stdout\": \"z\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nyxxaa\\n\\nMROENA\"\n },\n \"output\": {\n \"stdout\": \"yxa\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nzavbx\\n\\nELOMAS\"\n },\n \"output\": {\n \"stdout\": \"zx\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nw`wyb\\n\\nSOMALG\"\n },\n \"output\": {\n \"stdout\": \"yb\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nvzyaa\\n\\nBKNREN\"\n },\n \"output\": {\n \"stdout\": \"zya\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nx`xvc\\n\\nMRPEMA\"\n },\n \"output\": {\n \"stdout\": \"xvc\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nabwyx\\n\\nLAMOTE\"\n },\n \"output\": {\n \"stdout\": \"yx\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nx`yvb\\n\\nMRPEMA\"\n },\n \"output\": {\n \"stdout\": \"yvb\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nazwbx\\n\\nSAMOLE\"\n },\n \"output\": {\n \"stdout\": \"zx\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\navzxa\\n\\nREONKB\"\n },\n \"output\": {\n \"stdout\": \"zxa\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nxwv^b\\n\\nERMMAP\"\n },\n \"output\": {\n \"stdout\": \"xwvb\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\naywbx\\n\\nLAMOTE\"\n },\n \"output\": {\n \"stdout\": \"yx\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nxbvaz\\n\\nSBMPLE\"\n },\n \"output\": {\n \"stdout\": \"z\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nwawyb\\n\\nSOMALG\"\n },\n \"output\": {\n \"stdout\": \"yb\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nyzw`b\\n\\nCTALON\"\n },\n \"output\": {\n \"stdout\": \"zwb\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nzawcw\\n\\nSEMOKA\"\n },\n \"output\": {\n \"stdout\": \"zwc\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nywxba\\n\\nNROENA\"\n },\n \"output\": {\n \"stdout\": \"yxba\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nxbv`z\\n\\nSAMPLE\"\n },\n \"output\": {\n \"stdout\": \"z\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nbawyx\\n\\nETALOM\"\n },\n \"output\": {\n \"stdout\": \"yx\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nxvx`b\\n\\nMROEMA\"\n },\n \"output\": {\n \"stdout\": \"xvb\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nzavbx\\n\\nSAMOLE\"\n },\n \"output\": {\n \"stdout\": \"zx\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nyxxab\\n\\nMROEMA\"\n },\n \"output\": {\n \"stdout\": \"yxb\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nazvbx\\n\\nSAMOLE\"\n },\n \"output\": {\n \"stdout\": \"zx\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nzdavv\\n\\nLDTPAL\"\n },\n \"output\": {\n \"stdout\": \"zv\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\n`vbzx\\n\\nSALPLE\"\n },\n \"output\": {\n \"stdout\": \"zx\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nxbv`z\\n\\nSAMPLF\"\n },\n \"output\": {\n \"stdout\": \"z\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nabwyx\\n\\nETALOM\"\n },\n \"output\": {\n \"stdout\": \"yx\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nzavbw\\n\\nSEMOKA\"\n },\n \"output\": {\n \"stdout\": \"zw\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nxzvba\\n\\nSAMOME\"\n },\n \"output\": {\n \"stdout\": \"zvba\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nxw`xb\\n\\nSOMALE\"\n },\n \"output\": {\n \"stdout\": \"xwb\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nb`xwv\\n\\nMAFORM\"\n },\n \"output\": {\n \"stdout\": \"xwv\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nzavbw\\n\\nSAMOKE\"\n },\n \"output\": {\n \"stdout\": \"zw\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nxvzab\\n\\nBKNNER\"\n },\n \"output\": {\n \"stdout\": \"zb\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nxavaz\\n\\nSEMOKA\"\n },\n \"output\": {\n \"stdout\": \"z\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nbaxxx\\n\\nMROEMA\"\n },\n \"output\": {\n \"stdout\": \"x\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nxbyuc\\n\\nSAMPLE\"\n },\n \"output\": {\n \"stdout\": \"yuc\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nazwax\\n\\nSOMALF\"\n },\n \"output\": {\n \"stdout\": \"zx\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nabwyx\\n\\nETAMOL\"\n },\n \"output\": {\n \"stdout\": \"yx\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nxavaz\\n\\nREMOKA\"\n },\n \"output\": {\n \"stdout\": \"z\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nzavax\\n\\nAKOMER\"\n },\n \"output\": {\n \"stdout\": \"zx\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\naxzua\\n\\nBEONKR\"\n },\n \"output\": {\n \"stdout\": \"zua\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nzxwba\\n\\nSANOLE\"\n },\n \"output\": {\n \"stdout\": \"zxwba\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nbawyx\\n\\nDTALOM\"\n },\n \"output\": {\n \"stdout\": \"yx\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nxavaz\\n\\nAKOMER\"\n },\n \"output\": {\n \"stdout\": \"z\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nb`wyy\\n\\nCTAMON\"\n },\n \"output\": {\n \"stdout\": \"y\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5\\nyaxbv\\n\\nSLOM@E\"\n },\n \"output\": {\n \"stdout\": \"yxv\\n\"\n }\n }\n]","isConversational":false},"labels":{"kind":"string","value":"{\n \"tags\": [],\n \"title\": \"the-strongest-string-1-1\"\n}"},"canonical_solution":{"kind":"string","value":"{\n \"cpp\": null,\n \"java\": null,\n \"python\": \"from string import ascii_lowercase\\nal = ascii_lowercase[::-1]\\nn = int(raw_input())\\ns = raw_input().strip()\\nt = \\\"\\\"\\nps = 0\\nfor c in al:\\n i = s.find(c, ps)\\n if i == -1:\\n continue\\n else:\\n t += c\\n ps = i\\nprint t\"\n}"}}},{"rowIdx":493,"cells":{"id":{"kind":"string","value":"p02548 AtCoder Beginner Contest 179 - A x B + C"},"content":{"kind":"string","value":"Given is a positive integer N. How many tuples (A,B,C) of positive integers satisfy A \\times B + C = N?\n\nConstraints\n\n* 2 \\leq N \\leq 10^6\n* All values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\n\nN\n\n\nOutput\n\nPrint the answer.\n\nExamples\n\nInput\n\n3\n\n\nOutput\n\n3\n\n\nInput\n\n100\n\n\nOutput\n\n473\n\n\nInput\n\n1000000\n\n\nOutput\n\n13969985"},"test":{"kind":"list like","value":[{"input":{"stdin":"3"},"output":{"stdout":"3"}},{"input":{"stdin":"100"},"output":{"stdout":"473"}},{"input":{"stdin":"1000000"},"output":{"stdout":"13969985"}},{"input":{"stdin":"23"},"output":{"stdout":"74\n"}},{"input":{"stdin":"001"},"output":{"stdout":"0\n"}},{"input":{"stdin":"67"},"output":{"stdout":"292\n"}},{"input":{"stdin":"30"},"output":{"stdout":"103\n"}},{"input":{"stdin":"88"},"output":{"stdout":"403\n"}},{"input":{"stdin":"6"},"output":{"stdout":"10\n"}},{"input":{"stdin":"144"},"output":{"stdout":"731\n"}},{"input":{"stdin":"70"},"output":{"stdout":"304\n"}},{"input":{"stdin":"7"},"output":{"stdout":"14\n"}},{"input":{"stdin":"20"},"output":{"stdout":"60\n"}},{"input":{"stdin":"61"},"output":{"stdout":"261\n"}},{"input":{"stdin":"72"},"output":{"stdout":"314\n"}},{"input":{"stdin":"99"},"output":{"stdout":"467\n"}},{"input":{"stdin":"43"},"output":{"stdout":"168\n"}},{"input":{"stdin":"71"},"output":{"stdout":"312\n"}},{"input":{"stdin":"14"},"output":{"stdout":"37\n"}},{"input":{"stdin":"90"},"output":{"stdout":"413\n"}},{"input":{"stdin":"52"},"output":{"stdout":"211\n"}},{"input":{"stdin":"26"},"output":{"stdout":"87\n"}},{"input":{"stdin":"4"},"output":{"stdout":"5\n"}},{"input":{"stdin":"116"},"output":{"stdout":"566\n"}},{"input":{"stdin":"22"},"output":{"stdout":"70\n"}},{"input":{"stdin":"48"},"output":{"stdout":"188\n"}},{"input":{"stdin":"53"},"output":{"stdout":"217\n"}},{"input":{"stdin":"162"},"output":{"stdout":"846\n"}},{"input":{"stdin":"44"},"output":{"stdout":"170\n"}},{"input":{"stdin":"29"},"output":{"stdout":"101\n"}},{"input":{"stdin":"78"},"output":{"stdout":"348\n"}},{"input":{"stdin":"17"},"output":{"stdout":"50\n"}},{"input":{"stdin":"95"},"output":{"stdout":"443\n"}},{"input":{"stdin":"49"},"output":{"stdout":"198\n"}},{"input":{"stdin":"257"},"output":{"stdout":"1466\n"}},{"input":{"stdin":"107"},"output":{"stdout":"514\n"}},{"input":{"stdin":"89"},"output":{"stdout":"411\n"}},{"input":{"stdin":"65"},"output":{"stdout":"280\n"}},{"input":{"stdin":"197"},"output":{"stdout":"1070\n"}},{"input":{"stdin":"74"},"output":{"stdout":"328\n"}},{"input":{"stdin":"38"},"output":{"stdout":"142\n"}},{"input":{"stdin":"92"},"output":{"stdout":"429\n"}},{"input":{"stdin":"57"},"output":{"stdout":"239\n"}},{"input":{"stdin":"73"},"output":{"stdout":"326\n"}},{"input":{"stdin":"35"},"output":{"stdout":"127\n"}},{"input":{"stdin":"21"},"output":{"stdout":"66\n"}},{"input":{"stdin":"45"},"output":{"stdout":"176\n"}},{"input":{"stdin":"18"},"output":{"stdout":"52\n"}},{"input":{"stdin":"115"},"output":{"stdout":"562\n"}},{"input":{"stdin":"11"},"output":{"stdout":"27\n"}}],"string":"[\n {\n \"input\": {\n \"stdin\": \"3\"\n },\n \"output\": {\n \"stdout\": \"3\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"100\"\n },\n \"output\": {\n \"stdout\": \"473\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"1000000\"\n },\n \"output\": {\n \"stdout\": \"13969985\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"23\"\n },\n \"output\": {\n \"stdout\": \"74\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"001\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"67\"\n },\n \"output\": {\n \"stdout\": \"292\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"30\"\n },\n \"output\": {\n \"stdout\": \"103\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"88\"\n },\n \"output\": {\n \"stdout\": \"403\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"6\"\n },\n \"output\": {\n \"stdout\": \"10\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"144\"\n },\n \"output\": {\n \"stdout\": \"731\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"70\"\n },\n \"output\": {\n \"stdout\": \"304\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"7\"\n },\n \"output\": {\n \"stdout\": \"14\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"20\"\n },\n \"output\": {\n \"stdout\": \"60\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"61\"\n },\n \"output\": {\n \"stdout\": \"261\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"72\"\n },\n \"output\": {\n \"stdout\": \"314\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"99\"\n },\n \"output\": {\n \"stdout\": \"467\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"43\"\n },\n \"output\": {\n \"stdout\": \"168\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"71\"\n },\n \"output\": {\n \"stdout\": \"312\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"14\"\n },\n \"output\": {\n \"stdout\": \"37\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"90\"\n },\n \"output\": {\n \"stdout\": \"413\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"52\"\n },\n \"output\": {\n \"stdout\": \"211\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"26\"\n },\n \"output\": {\n \"stdout\": \"87\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\"\n },\n \"output\": {\n \"stdout\": \"5\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"116\"\n },\n \"output\": {\n \"stdout\": \"566\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"22\"\n },\n \"output\": {\n \"stdout\": \"70\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"48\"\n },\n \"output\": {\n \"stdout\": \"188\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"53\"\n },\n \"output\": {\n \"stdout\": \"217\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"162\"\n },\n \"output\": {\n \"stdout\": \"846\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"44\"\n },\n \"output\": {\n \"stdout\": \"170\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"29\"\n },\n \"output\": {\n \"stdout\": \"101\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"78\"\n },\n \"output\": {\n \"stdout\": \"348\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"17\"\n },\n \"output\": {\n \"stdout\": \"50\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"95\"\n },\n \"output\": {\n \"stdout\": \"443\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"49\"\n },\n \"output\": {\n \"stdout\": \"198\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"257\"\n },\n \"output\": {\n \"stdout\": \"1466\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"107\"\n },\n \"output\": {\n \"stdout\": \"514\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"89\"\n },\n \"output\": {\n \"stdout\": \"411\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"65\"\n },\n \"output\": {\n \"stdout\": \"280\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"197\"\n },\n \"output\": {\n \"stdout\": \"1070\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"74\"\n },\n \"output\": {\n \"stdout\": \"328\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"38\"\n },\n \"output\": {\n \"stdout\": \"142\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"92\"\n },\n \"output\": {\n \"stdout\": \"429\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"57\"\n },\n \"output\": {\n \"stdout\": \"239\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"73\"\n },\n \"output\": {\n \"stdout\": \"326\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"35\"\n },\n \"output\": {\n \"stdout\": \"127\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"21\"\n },\n \"output\": {\n \"stdout\": \"66\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"45\"\n },\n \"output\": {\n \"stdout\": \"176\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"18\"\n },\n \"output\": {\n \"stdout\": \"52\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"115\"\n },\n \"output\": {\n \"stdout\": \"562\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"11\"\n },\n \"output\": {\n \"stdout\": \"27\\n\"\n }\n }\n]","isConversational":false},"labels":{"kind":"string","value":"{\n \"tags\": [],\n \"title\": \"p02548 AtCoder Beginner Contest 179 - A x B + C\"\n}"},"canonical_solution":{"kind":"string","value":"{\n \"cpp\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\nint64_t n,ans;\\n ans=0;\\n cin>>n;\\n for(int64_t i=1;i<n;i++){\\nans=ans+(n-1)/i; \\n }\\n cout<<ans<<endl; \\n} \",\n \"java\": \"import java.util.Scanner;\\n\\npublic class Main {\\n public static void main(String[] args) {\\n Scanner sc = new Scanner(System.in);\\n int n = sc.nextInt();\\n long ans = 0;\\n for(int i = 1;i < n;i++){\\n for(int j = 1;j < n && j * i < n;j++){\\n ans++;\\n }\\n }\\n System.out.println(ans);\\n }\\n}\\n\",\n \"python\": \"n = int(input())\\ncount=0\\ndaburi=0\\nfor i in range(1,n):\\n count+=(n-1)//i\\n\\nprint(count)\"\n}"}}},{"rowIdx":494,"cells":{"id":{"kind":"string","value":"p02679 AtCoder Beginner Contest 168 - ∙ (Bullet)"},"content":{"kind":"string","value":"We have caught N sardines. The deliciousness and fragrantness of the i-th sardine is A_i and B_i, respectively.\n\nWe will choose one or more of these sardines and put them into a cooler. However, two sardines on bad terms cannot be chosen at the same time.\n\nThe i-th and j-th sardines (i \\neq j) are on bad terms if and only if A_i \\cdot A_j + B_i \\cdot B_j = 0.\n\nIn how many ways can we choose the set of sardines to put into the cooler? Since the count can be enormous, print it modulo 1000000007.\n\nConstraints\n\n* All values in input are integers.\n* 1 \\leq N \\leq 2 \\times 10^5\n* -10^{18} \\leq A_i, B_i \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\n\nN\nA_1 B_1\n:\nA_N B_N\n\n\nOutput\n\nPrint the count modulo 1000000007.\n\nExamples\n\nInput\n\n3\n1 2\n-1 1\n2 -1\n\n\nOutput\n\n5\n\n\nInput\n\n10\n3 2\n3 2\n-1 1\n2 -1\n-3 -9\n-8 12\n7 7\n8 1\n8 2\n8 4\n\n\nOutput\n\n479"},"test":{"kind":"list like","value":[{"input":{"stdin":"3\n1 2\n-1 1\n2 -1"},"output":{"stdout":"5"}},{"input":{"stdin":"10\n3 2\n3 2\n-1 1\n2 -1\n-3 -9\n-8 12\n7 7\n8 1\n8 2\n8 4"},"output":{"stdout":"479"}},{"input":{"stdin":"3\n1 0\n-2 0\n0 2"},"output":{"stdout":"4\n"}},{"input":{"stdin":"10\n-2 -1\n0 -6\n0 0\n-1 001\n-1 -2\n2 2\n2 0\n1 -36\n1 1\n1 0"},"output":{"stdout":"200\n"}},{"input":{"stdin":"10\n0 -1\n0 -3\n0 1\n0 111\n-1 -4\n1 -1\n1 1\n0 -6\n1 0\n0 1"},"output":{"stdout":"389\n"}},{"input":{"stdin":"10\n1 0\n3 0\n1 -1\n0 60\n0 0\n-2 -2\n1 0\n0 0\n0 0\n0 -1"},"output":{"stdout":"35\n"}},{"input":{"stdin":"10\n1 0\n2 0\n1 -1\n0 60\n0 0\n-2 -2\n1 0\n0 0\n-3 0\n0 -1"},"output":{"stdout":"58\n"}},{"input":{"stdin":"3\n1 -1\n-1 -1\n0 1"},"output":{"stdout":"5\n"}},{"input":{"stdin":"10\n3 2\n3 0\n-2 2\n2 -2\n-3 -6\n-8 12\n7 1\n9 1\n8 2\n15 3"},"output":{"stdout":"767\n"}},{"input":{"stdin":"10\n3 2\n3 0\n-2 2\n2 -1\n-3 -6\n-8 12\n7 1\n8 1\n8 2\n15 3"},"output":{"stdout":"575\n"}},{"input":{"stdin":"10\n1 1\n0 0\n-1 1\n-1 16\n-2 -26\n-11 0\n2 -1\n0 1\n1 0\n0 4"},"output":{"stdout":"168\n"}},{"input":{"stdin":"10\n3 2\n3 0\n-1 1\n2 -1\n-3 -6\n-8 12\n7 1\n8 1\n8 2\n15 5"},"output":{"stdout":"575\n"}},{"input":{"stdin":"10\n2 0\n2 -1\n-1 -1\n1 20\n0 -1\n-18 -1\n1 -1\n1 1\n-5 -1\n4 0"},"output":{"stdout":"399\n"}},{"input":{"stdin":"10\n1 0\n3 1\n0 4\n0 2\n-3 -24\n-12 5\n1 0\n9 2\n0 2\n15 5"},"output":{"stdout":"351\n"}},{"input":{"stdin":"10\n0 1\n0 0\n0 4\n-1 16\n-2 -26\n-11 0\n4 -1\n0 1\n0 2\n0 4"},"output":{"stdout":"264\n"}},{"input":{"stdin":"3\n1 0\n-1 0\n0 1"},"output":{"stdout":"4\n"}},{"input":{"stdin":"10\n3 2\n3 0\n-2 2\n1 -2\n-3 -6\n-8 12\n7 1\n9 1\n8 2\n15 3"},"output":{"stdout":"767\n"}},{"input":{"stdin":"10\n-1 0\n1 0\n0 4\n-1 5\n-2 -26\n-13 1\n2 0\n1 1\n0 1\n0 2"},"output":{"stdout":"179\n"}},{"input":{"stdin":"10\n1 0\n1 1\n0 4\n-1 2\n-1 -24\n-12 1\n1 0\n13 2\n0 2\n10 5"},"output":{"stdout":"335\n"}},{"input":{"stdin":"10\n1 0\n3 1\n0 4\n0 2\n-2 -24\n-12 5\n1 0\n9 2\n8 2\n15 5"},"output":{"stdout":"447\n"}},{"input":{"stdin":"10\n0 0\n-1 -2\n0 -1\n0 111\n-1 -1\n0 -1\n0 0\n0 -2\n-1 2\n0 0"},"output":{"stdout":"130\n"}},{"input":{"stdin":"10\n-1 1\n-2 0\n0 4\n-1 4\n-2 -26\n-11 1\n4 -1\n1 1\n0 2\n0 2"},"output":{"stdout":"431\n"}},{"input":{"stdin":"10\n0 1\n0 0\n0 4\n-1 16\n-2 -26\n-11 0\n0 -1\n0 1\n0 2\n0 4"},"output":{"stdout":"260\n"}},{"input":{"stdin":"3\n2 -1\n-2 0\n0 1"},"output":{"stdout":"5\n"}},{"input":{"stdin":"10\n-1 0\n-1 0\n0 4\n-1 5\n-2 -26\n-11 1\n2 0\n1 1\n0 1\n0 2"},"output":{"stdout":"239\n"}},{"input":{"stdin":"10\n3 0\n2 -1\n0 -1\n0 30\n0 -2\n-2 -2\n1 -1\n0 1\n-3 0\n0 -1"},"output":{"stdout":"209\n"}},{"input":{"stdin":"10\n3 2\n3 0\n-2 1\n2 -1\n-3 -6\n-8 12\n7 1\n8 1\n8 2\n15 3"},"output":{"stdout":"479\n"}},{"input":{"stdin":"10\n2 0\n1 -1\n-1 0\n0 11\n-1 -1\n-18 1\n6 0\n1 4\n-5 0\n2 3"},"output":{"stdout":"407\n"}},{"input":{"stdin":"10\n3 2\n3 2\n-1 1\n2 -1\n-3 -6\n-8 12\n7 1\n8 1\n8 2\n8 4"},"output":{"stdout":"479\n"}},{"input":{"stdin":"10\n2 0\n0 0\n-1 2\n-1 13\n-2 -26\n-11 0\n2 -1\n0 1\n0 0\n0 4"},"output":{"stdout":"113\n"}},{"input":{"stdin":"10\n1 2\n3 1\n0 2\n1 -2\n-3 -6\n-8 12\n7 1\n9 1\n8 2\n15 3"},"output":{"stdout":"1023\n"}},{"input":{"stdin":"3\n1 0\n-2 0\n2 0"},"output":{"stdout":"7\n"}},{"input":{"stdin":"10\n-1 -1\n0 -6\n0 2\n-1 001\n0 -2\n2 3\n2 0\n2 -36\n1 1\n1 0"},"output":{"stdout":"219\n"}},{"input":{"stdin":"3\n1 -1\n-2 -1\n0 1"},"output":{"stdout":"7\n"}},{"input":{"stdin":"3\n2 4\n-2 1\n2 -1"},"output":{"stdout":"4\n"}},{"input":{"stdin":"10\n3 0\n2 -1\n0 -1\n0 20\n0 -2\n-2 -2\n0 -1\n0 1\n-3 0\n0 0"},"output":{"stdout":"140\n"}},{"input":{"stdin":"3\n0 0\n-2 0\n2 0"},"output":{"stdout":"4\n"}},{"input":{"stdin":"10\n1 0\n3 -2\n0 -1\n0 60\n0 0\n-2 -2\n1 0\n1 0\n0 0\n0 -1"},"output":{"stdout":"61\n"}},{"input":{"stdin":"10\n2 0\n0 0\n-1 2\n-1 13\n0 -26\n-11 -1\n2 -1\n0 1\n0 0\n0 4"},"output":{"stdout":"145\n"}},{"input":{"stdin":"10\n0 0\n0 -2\n0 1\n0 111\n0 -4\n0 -1\n-1 0\n0 -3\n1 0\n0 1"},"output":{"stdout":"131\n"}},{"input":{"stdin":"10\n3 0\n2 0\n0 -1\n1 20\n0 -2\n-18 -2\n0 -1\n1 1\n-5 0\n0 0"},"output":{"stdout":"120\n"}},{"input":{"stdin":"10\n1 0\n3 1\n0 4\n0 1\n-2 -6\n-12 5\n1 1\n9 1\n8 2\n15 5"},"output":{"stdout":"639\n"}},{"input":{"stdin":"10\n0 1\n-2 0\n0 4\n-1 4\n-2 -26\n-11 1\n4 -1\n1 1\n0 2\n0 2"},"output":{"stdout":"543\n"}},{"input":{"stdin":"3\n1 4\n-1 1\n2 -1"},"output":{"stdout":"7\n"}},{"input":{"stdin":"3\n2 4\n-1 1\n2 -1"},"output":{"stdout":"5\n"}},{"input":{"stdin":"3\n1 0\n-2 0\n0 1"},"output":{"stdout":"4\n"}},{"input":{"stdin":"10\n2 0\n2 -1\n-1 -1\n0 20\n0 -1\n-18 0\n1 0\n1 2\n-5 -1\n2 0"},"output":{"stdout":"227\n"}},{"input":{"stdin":"10\n0 0\n0 -2\n0 1\n0 111\n0 -4\n1 -1\n-1 0\n0 -3\n1 0\n0 1"},"output":{"stdout":"134\n"}},{"input":{"stdin":"3\n0 0\n-2 0\n2 -1"},"output":{"stdout":"4\n"}},{"input":{"stdin":"10\n-1 0\n1 0\n-1 4\n-1 2\n-2 -26\n-13 1\n1 0\n19 1\n0 3\n0 5"},"output":{"stdout":"263\n"}}],"string":"[\n {\n \"input\": {\n \"stdin\": \"3\\n1 2\\n-1 1\\n2 -1\"\n },\n \"output\": {\n \"stdout\": \"5\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n3 2\\n3 2\\n-1 1\\n2 -1\\n-3 -9\\n-8 12\\n7 7\\n8 1\\n8 2\\n8 4\"\n },\n \"output\": {\n \"stdout\": \"479\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"3\\n1 0\\n-2 0\\n0 2\"\n },\n \"output\": {\n \"stdout\": \"4\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n-2 -1\\n0 -6\\n0 0\\n-1 001\\n-1 -2\\n2 2\\n2 0\\n1 -36\\n1 1\\n1 0\"\n },\n \"output\": {\n \"stdout\": \"200\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n0 -1\\n0 -3\\n0 1\\n0 111\\n-1 -4\\n1 -1\\n1 1\\n0 -6\\n1 0\\n0 1\"\n },\n \"output\": {\n \"stdout\": \"389\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n1 0\\n3 0\\n1 -1\\n0 60\\n0 0\\n-2 -2\\n1 0\\n0 0\\n0 0\\n0 -1\"\n },\n \"output\": {\n \"stdout\": \"35\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n1 0\\n2 0\\n1 -1\\n0 60\\n0 0\\n-2 -2\\n1 0\\n0 0\\n-3 0\\n0 -1\"\n },\n \"output\": {\n \"stdout\": \"58\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"3\\n1 -1\\n-1 -1\\n0 1\"\n },\n \"output\": {\n \"stdout\": \"5\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n3 2\\n3 0\\n-2 2\\n2 -2\\n-3 -6\\n-8 12\\n7 1\\n9 1\\n8 2\\n15 3\"\n },\n \"output\": {\n \"stdout\": \"767\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n3 2\\n3 0\\n-2 2\\n2 -1\\n-3 -6\\n-8 12\\n7 1\\n8 1\\n8 2\\n15 3\"\n },\n \"output\": {\n \"stdout\": \"575\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n1 1\\n0 0\\n-1 1\\n-1 16\\n-2 -26\\n-11 0\\n2 -1\\n0 1\\n1 0\\n0 4\"\n },\n \"output\": {\n \"stdout\": \"168\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n3 2\\n3 0\\n-1 1\\n2 -1\\n-3 -6\\n-8 12\\n7 1\\n8 1\\n8 2\\n15 5\"\n },\n \"output\": {\n \"stdout\": \"575\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n2 0\\n2 -1\\n-1 -1\\n1 20\\n0 -1\\n-18 -1\\n1 -1\\n1 1\\n-5 -1\\n4 0\"\n },\n \"output\": {\n \"stdout\": \"399\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n1 0\\n3 1\\n0 4\\n0 2\\n-3 -24\\n-12 5\\n1 0\\n9 2\\n0 2\\n15 5\"\n },\n \"output\": {\n \"stdout\": \"351\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n0 1\\n0 0\\n0 4\\n-1 16\\n-2 -26\\n-11 0\\n4 -1\\n0 1\\n0 2\\n0 4\"\n },\n \"output\": {\n \"stdout\": \"264\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"3\\n1 0\\n-1 0\\n0 1\"\n },\n \"output\": {\n \"stdout\": \"4\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n3 2\\n3 0\\n-2 2\\n1 -2\\n-3 -6\\n-8 12\\n7 1\\n9 1\\n8 2\\n15 3\"\n },\n \"output\": {\n \"stdout\": \"767\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n-1 0\\n1 0\\n0 4\\n-1 5\\n-2 -26\\n-13 1\\n2 0\\n1 1\\n0 1\\n0 2\"\n },\n \"output\": {\n \"stdout\": \"179\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n1 0\\n1 1\\n0 4\\n-1 2\\n-1 -24\\n-12 1\\n1 0\\n13 2\\n0 2\\n10 5\"\n },\n \"output\": {\n \"stdout\": \"335\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n1 0\\n3 1\\n0 4\\n0 2\\n-2 -24\\n-12 5\\n1 0\\n9 2\\n8 2\\n15 5\"\n },\n \"output\": {\n \"stdout\": \"447\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n0 0\\n-1 -2\\n0 -1\\n0 111\\n-1 -1\\n0 -1\\n0 0\\n0 -2\\n-1 2\\n0 0\"\n },\n \"output\": {\n \"stdout\": \"130\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n-1 1\\n-2 0\\n0 4\\n-1 4\\n-2 -26\\n-11 1\\n4 -1\\n1 1\\n0 2\\n0 2\"\n },\n \"output\": {\n \"stdout\": \"431\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n0 1\\n0 0\\n0 4\\n-1 16\\n-2 -26\\n-11 0\\n0 -1\\n0 1\\n0 2\\n0 4\"\n },\n \"output\": {\n \"stdout\": \"260\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"3\\n2 -1\\n-2 0\\n0 1\"\n },\n \"output\": {\n \"stdout\": \"5\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n-1 0\\n-1 0\\n0 4\\n-1 5\\n-2 -26\\n-11 1\\n2 0\\n1 1\\n0 1\\n0 2\"\n },\n \"output\": {\n \"stdout\": \"239\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n3 0\\n2 -1\\n0 -1\\n0 30\\n0 -2\\n-2 -2\\n1 -1\\n0 1\\n-3 0\\n0 -1\"\n },\n \"output\": {\n \"stdout\": \"209\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n3 2\\n3 0\\n-2 1\\n2 -1\\n-3 -6\\n-8 12\\n7 1\\n8 1\\n8 2\\n15 3\"\n },\n \"output\": {\n \"stdout\": \"479\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n2 0\\n1 -1\\n-1 0\\n0 11\\n-1 -1\\n-18 1\\n6 0\\n1 4\\n-5 0\\n2 3\"\n },\n \"output\": {\n \"stdout\": \"407\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n3 2\\n3 2\\n-1 1\\n2 -1\\n-3 -6\\n-8 12\\n7 1\\n8 1\\n8 2\\n8 4\"\n },\n \"output\": {\n \"stdout\": \"479\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n2 0\\n0 0\\n-1 2\\n-1 13\\n-2 -26\\n-11 0\\n2 -1\\n0 1\\n0 0\\n0 4\"\n },\n \"output\": {\n \"stdout\": \"113\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n1 2\\n3 1\\n0 2\\n1 -2\\n-3 -6\\n-8 12\\n7 1\\n9 1\\n8 2\\n15 3\"\n },\n \"output\": {\n \"stdout\": \"1023\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"3\\n1 0\\n-2 0\\n2 0\"\n },\n \"output\": {\n \"stdout\": \"7\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n-1 -1\\n0 -6\\n0 2\\n-1 001\\n0 -2\\n2 3\\n2 0\\n2 -36\\n1 1\\n1 0\"\n },\n \"output\": {\n \"stdout\": \"219\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"3\\n1 -1\\n-2 -1\\n0 1\"\n },\n \"output\": {\n \"stdout\": \"7\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"3\\n2 4\\n-2 1\\n2 -1\"\n },\n \"output\": {\n \"stdout\": \"4\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n3 0\\n2 -1\\n0 -1\\n0 20\\n0 -2\\n-2 -2\\n0 -1\\n0 1\\n-3 0\\n0 0\"\n },\n \"output\": {\n \"stdout\": \"140\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"3\\n0 0\\n-2 0\\n2 0\"\n },\n \"output\": {\n \"stdout\": \"4\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n1 0\\n3 -2\\n0 -1\\n0 60\\n0 0\\n-2 -2\\n1 0\\n1 0\\n0 0\\n0 -1\"\n },\n \"output\": {\n \"stdout\": \"61\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n2 0\\n0 0\\n-1 2\\n-1 13\\n0 -26\\n-11 -1\\n2 -1\\n0 1\\n0 0\\n0 4\"\n },\n \"output\": {\n \"stdout\": \"145\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n0 0\\n0 -2\\n0 1\\n0 111\\n0 -4\\n0 -1\\n-1 0\\n0 -3\\n1 0\\n0 1\"\n },\n \"output\": {\n \"stdout\": \"131\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n3 0\\n2 0\\n0 -1\\n1 20\\n0 -2\\n-18 -2\\n0 -1\\n1 1\\n-5 0\\n0 0\"\n },\n \"output\": {\n \"stdout\": \"120\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n1 0\\n3 1\\n0 4\\n0 1\\n-2 -6\\n-12 5\\n1 1\\n9 1\\n8 2\\n15 5\"\n },\n \"output\": {\n \"stdout\": \"639\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n0 1\\n-2 0\\n0 4\\n-1 4\\n-2 -26\\n-11 1\\n4 -1\\n1 1\\n0 2\\n0 2\"\n },\n \"output\": {\n \"stdout\": \"543\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"3\\n1 4\\n-1 1\\n2 -1\"\n },\n \"output\": {\n \"stdout\": \"7\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"3\\n2 4\\n-1 1\\n2 -1\"\n },\n \"output\": {\n \"stdout\": \"5\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"3\\n1 0\\n-2 0\\n0 1\"\n },\n \"output\": {\n \"stdout\": \"4\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n2 0\\n2 -1\\n-1 -1\\n0 20\\n0 -1\\n-18 0\\n1 0\\n1 2\\n-5 -1\\n2 0\"\n },\n \"output\": {\n \"stdout\": \"227\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n0 0\\n0 -2\\n0 1\\n0 111\\n0 -4\\n1 -1\\n-1 0\\n0 -3\\n1 0\\n0 1\"\n },\n \"output\": {\n \"stdout\": \"134\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"3\\n0 0\\n-2 0\\n2 -1\"\n },\n \"output\": {\n \"stdout\": \"4\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10\\n-1 0\\n1 0\\n-1 4\\n-1 2\\n-2 -26\\n-13 1\\n1 0\\n19 1\\n0 3\\n0 5\"\n },\n \"output\": {\n \"stdout\": \"263\\n\"\n }\n }\n]","isConversational":false},"labels":{"kind":"string","value":"{\n \"tags\": [],\n \"title\": \"p02679 AtCoder Beginner Contest 168 - ∙ (Bullet)\"\n}"},"canonical_solution":{"kind":"string","value":"{\n \"cpp\": \"#include<iostream>\\n#include<vector>\\n#include<map>\\n#include<algorithm>\\nusing namespace std;\\nconst long mod=1e9+7;\\nlong power(long a,long b){return b?power(a*a%mod,b/2)*(b%2?a:1)%mod:1;}\\nlong N;\\nlong c00,c01,c10;\\nlong gcd(long a,long b){return b?gcd(b,a%b):a;}\\nint main()\\n{\\n\\tcin>>N;\\n\\tvector<pair<long,long> >X;\\n\\tfor(int i=0;i<N;i++)\\n\\t{\\n\\t\\tlong a,b;cin>>a>>b;\\n\\t\\tif(a==0&&b==0)c00++;\\n\\t\\telse if(a==0)c01++;\\n\\t\\telse if(b==0)c10++;\\n\\t\\telse X.push_back(make_pair(a,b));\\n\\t}\\n\\tmap<pair<long,long>,long>mp;\\n\\tfor(pair<long,long>&p:X)\\n\\t{\\n\\t\\tlong a=p.first,b=p.second;\\n\\t\\tlong d=gcd(abs(a),abs(b));\\n\\t\\ta/=d;b/=d;\\n\\t\\tif(a<0)\\n\\t\\t{\\n\\t\\t\\ta=-a;\\n\\t\\t\\tb=-b;\\n\\t\\t}\\n\\t\\tmp[make_pair(a,b)]++;\\n\\t\\tif(b<0)\\n\\t\\t{\\n\\t\\t\\tlong ta=-b,tb=a;\\n\\t\\t\\ta=ta;\\n\\t\\t\\tb=tb;\\n\\t\\t}\\n\\t\\tp=make_pair(a,b);\\n\\t}\\n\\tsort(X.begin(),X.end());\\n\\tX.erase(unique(X.begin(),X.end()),X.end());\\n\\tlong ans=(power(2,c01)+power(2,c10)-1+mod)%mod;\\n\\tfor(pair<long,long>p:X)\\n\\t{\\n\\t\\tlong a=p.first,b=p.second;\\n\\t\\tlong A=-b,B=a;\\n\\t\\tif(A<0)\\n\\t\\t{\\n\\t\\t\\tA=-A;\\n\\t\\t\\tB=-B;\\n\\t\\t}\\n\\t\\tlong c0=mp[p],c1=mp[make_pair(A,B)];\\n\\t\\tans=ans*(power(2,c0)+power(2,c1)-1+mod)%mod;\\n\\t}\\n\\tcout<<(ans-1+c00+mod)%mod<<endl;\\n}\\n\",\n \"java\": \"\\nimport java.io.*;\\nimport java.util.HashMap;\\nimport java.util.Map;\\nimport java.util.StringTokenizer;\\n\\npublic class Main {\\n private static final int MOD = 1000000007;\\n\\n private long pow(long a, long n) {\\n long ret = 1;\\n long base = a;\\n while (n > 0) {\\n if ((n & 1) > 0) {\\n ret = (ret * base) % MOD;\\n }\\n base = (base * base) % MOD;\\n n >>= 1;\\n }\\n return ret;\\n }\\n\\n private void add(Map<String, int[]> cnt, String key, int i) {\\n int[] v = cnt.computeIfAbsent(key, k -> new int[]{0, 0});\\n ++v[i];\\n }\\n\\n private long gcd(long a, long b) {\\n if (b == 0) {\\n return a;\\n }\\n return gcd(b, a % b);\\n }\\n\\n private void solve() {\\n int n = sc.nextInt();\\n long adt = 0;\\n Map<String, int[]> cnt = new HashMap<>();\\n for (int i = 0; i < n; i++) {\\n long a = sc.nextLong();\\n long b = sc.nextLong();\\n if (a == 0 && b == 0) {\\n ++adt;\\n continue;\\n }\\n\\n if (a == 0L) {\\n add(cnt,\\\"0,0\\\", 0);\\n } else if (b == 0L) {\\n add(cnt, \\\"0,0\\\", 1);\\n } else {\\n if ((a > 0 && b > 0) || (a < 0 && b < 0)) {\\n a = Math.abs(a);\\n b = Math.abs(b);\\n long g = gcd(a, b);\\n String key = (a/g) + \\\",\\\" + (b/g);\\n add(cnt,key, 0);\\n } else {\\n a = Math.abs(a);\\n b = Math.abs(b);\\n long g = gcd(a, b);\\n String key = (b/g) + \\\",\\\" + (a/g);\\n add(cnt, key, 1);\\n }\\n }\\n }\\n\\n long ans = 1;\\n for (int[] v : cnt.values()) {\\n ans = (ans * ((pow(2, v[0]) + pow(2, v[1]) - 1 + MOD) % MOD)) % MOD;\\n }\\n\\n ans = (ans + adt - 1 + MOD) % MOD;\\n out.println(ans);\\n }\\n\\n private static PrintWriter out;\\n private static MyScanner sc;\\n\\n private static class MyScanner {\\n BufferedReader br;\\n StringTokenizer st;\\n\\n private MyScanner() {\\n br = new BufferedReader(new InputStreamReader(System.in));\\n }\\n\\n String next() {\\n while (st == null || !st.hasMoreElements()) {\\n try {\\n st = new StringTokenizer(br.readLine());\\n } catch (IOException e) {\\n e.printStackTrace();\\n }\\n }\\n return st.nextToken();\\n }\\n\\n int nextInt() {\\n return Integer.parseInt(next());\\n }\\n\\n long nextLong() {\\n return Long.parseLong(next());\\n }\\n\\n double nextDouble() {\\n return Double.parseDouble(next());\\n }\\n }\\n\\n public static void main(String[] args) {\\n out = new PrintWriter(new BufferedOutputStream(System.out));\\n sc = new MyScanner();\\n new Main().solve();\\n out.close();\\n }\\n}\\n\",\n \"python\": \"ma = lambda :map(int,input().split())\\nlma = lambda :list(map(int,input().split()))\\ntma = lambda :tuple(map(int,input().split()))\\nni = lambda:int(input())\\nyn = lambda fl:print(\\\"Yes\\\") if fl else print(\\\"No\\\")\\nimport collections\\nimport math\\nimport itertools\\nimport heapq as hq\\nimport sys\\ngcd = math.gcd\\nco = collections.Counter()\\nn = ni()\\nmod=10**9+7\\nfor i in range(n):\\n a,b = ma()\\n d = gcd(a,b)\\n if d!=0:\\n a//=d\\n b//=d\\n elif abs(a)>0 or abs(b)>0:\\n l = max(abs(a), abs(b))\\n a//=l\\n b//=l\\n co[(a,b)]+=1\\nd = collections.defaultdict(lambda:False)\\nans=1\\nfor t,cnt in co.items():\\n a,b = t\\n if t==(0,0) or d[t]:\\n continue\\n d[(a,b)]=True;d[(-a,-b)]=True;d[(b,-a)]=True;d[(-b,a)]=True\\n l1 = co[(a,b)]+co[(-a,-b)]\\n l2 = co[(b,-a)]+co[(-b,a)]\\n ans=ans*(pow(2,l1,mod)+pow(2,l2,mod) -1)%mod\\n ans%=mod\\nprint((ans-1 +co[(0,0)])%mod)\\n\"\n}"}}},{"rowIdx":495,"cells":{"id":{"kind":"string","value":"p02807 Dwango Programming Contest 6th - Fusing Slimes"},"content":{"kind":"string","value":"There are N slimes standing on a number line. The i-th slime from the left is at position x_i.\n\nIt is guaruanteed that 1 \\leq x_1 < x_2 < \\ldots < x_N \\leq 10^{9}.\n\nNiwango will perform N-1 operations. The i-th operation consists of the following procedures:\n\n* Choose an integer k between 1 and N-i (inclusive) with equal probability.\n* Move the k-th slime from the left, to the position of the neighboring slime to the right.\n* Fuse the two slimes at the same position into one slime.\n\n\n\nFind the total distance traveled by the slimes multiplied by (N-1)! (we can show that this value is an integer), modulo (10^{9}+7). If a slime is born by a fuse and that slime moves, we count it as just one slime.\n\nConstraints\n\n* 2 \\leq N \\leq 10^{5}\n* 1 \\leq x_1 < x_2 < \\ldots < x_N \\leq 10^{9}\n* x_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\n\nN\nx_1 x_2 \\ldots x_N\n\n\nOutput\n\nPrint the answer.\n\nExamples\n\nInput\n\n3\n1 2 3\n\n\nOutput\n\n5\n\n\nInput\n\n12\n161735902 211047202 430302156 450968417 628894325 707723857 731963982 822804784 880895728 923078537 971407775 982631932\n\n\nOutput\n\n750927044"},"test":{"kind":"list like","value":[{"input":{"stdin":"12\n161735902 211047202 430302156 450968417 628894325 707723857 731963982 822804784 880895728 923078537 971407775 982631932"},"output":{"stdout":"750927044"}},{"input":{"stdin":"3\n1 2 3"},"output":{"stdout":"5"}},{"input":{"stdin":"12\n161735902 394362112 208582102 872675759 1190847685 946982680 206331977 816973013 880895728 359957688 971407775 1362959685"},"output":{"stdout":"725397599\n"}},{"input":{"stdin":"12\n161735902 467388357 127795962 872675759 1190847685 946982680 402149677 233485274 135685914 923078537 971407775 1765707086"},"output":{"stdout":"597556674\n"}},{"input":{"stdin":"12\n161735902 211047202 620468900 450968417 628894325 707723857 731963982 822804784 880895728 923078537 971407775 982631932"},"output":{"stdout":"139672618\n"}},{"input":{"stdin":"12\n161735902 467388357 127795962 872675759 1190847685 1723370727 402149677 270216579 135685914 923078537 971407775 1765707086"},"output":{"stdout":"716486077\n"}},{"input":{"stdin":"12\n367101616 467388357 127795962 1640220090 1190847685 1158214640 402149677 270216579 135685914 923078537 628600728 1765707086"},"output":{"stdout":"899695081\n"}},{"input":{"stdin":"12\n367101616 467388357 127795962 872675759 121747736 1723370727 402149677 270216579 135685914 923078537 971407775 1765707086"},"output":{"stdout":"350377241\n"}},{"input":{"stdin":"12\n10777282 467388357 218368251 872675759 1190847685 210181890 402149677 578502185 135685914 923078537 971407775 1765707086"},"output":{"stdout":"852433968\n"}},{"input":{"stdin":"3\n1 2 5"},"output":{"stdout":"11\n"}},{"input":{"stdin":"3\n1 0 12"},"output":{"stdout":"34\n"}},{"input":{"stdin":"12\n367101616 467388357 127795962 872675759 1190847685 1723370727 668687333 270216579 135685914 125686970 628600728 1765707086"},"output":{"stdout":"473666389\n"}},{"input":{"stdin":"12\n161735902 301038801 70956625 872675759 1190847685 946982680 695219587 56894969 135685914 923078537 971407775 1765707086"},"output":{"stdout":"166454412\n"}},{"input":{"stdin":"12\n367101616 467388357 156291688 1477792495 1190847685 1723370727 668687333 270216579 135685914 125686970 628600728 1765707086"},"output":{"stdout":"854833727\n"}},{"input":{"stdin":"12\n367101616 467388357 127795962 872675759 121747736 1138999790 394173623 270216579 135685914 923078537 971407775 1765707086"},"output":{"stdout":"942848146\n"}},{"input":{"stdin":"12\n161735902 467388357 218368251 872675759 1190847685 210181890 402149677 822804784 135685914 923078537 971407775 1765707086"},"output":{"stdout":"612360867\n"}},{"input":{"stdin":"12\n367101616 467388357 156291688 872675759 1190847685 1723370727 668687333 270216579 135685914 125686970 628600728 1765707086"},"output":{"stdout":"744454860\n"}},{"input":{"stdin":"12\n236309991 467388357 430302156 872675759 1190847685 946982680 402149677 1615732667 135685914 605112598 971407775 1765707086"},"output":{"stdout":"962555797\n"}},{"input":{"stdin":"12\n367101616 467388357 156291688 888737356 1190847685 1723370727 668687333 270216579 135685914 125686970 628600728 1765707086"},"output":{"stdout":"856794434\n"}},{"input":{"stdin":"12\n161735902 467388357 218368251 872675759 1190847685 210181890 402149677 578502185 135685914 923078537 971407775 1765707086"},"output":{"stdout":"851798463\n"}},{"input":{"stdin":"12\n367101616 467388357 159541726 1477792495 1190847685 1723370727 668687333 270216579 135685914 125686970 1191846896 1765707086"},"output":{"stdout":"469392584\n"}},{"input":{"stdin":"12\n161735902 467388357 127795962 872675759 1190847685 210181890 402149677 822804784 135685914 923078537 971407775 1765707086"},"output":{"stdout":"252443434\n"}},{"input":{"stdin":"12\n367101616 782606466 156291688 888737356 1190847685 1723370727 668687333 270216579 263279879 125686970 628600728 1765707086"},"output":{"stdout":"44560905\n"}},{"input":{"stdin":"12\n367101616 467388357 156291688 888737356 1190847685 1723370727 668687333 270216579 135685914 28445051 628600728 1765707086"},"output":{"stdout":"477311241\n"}},{"input":{"stdin":"3\n1 1 10"},"output":{"stdout":"27\n"}},{"input":{"stdin":"12\n367101616 467388357 156291688 888737356 1190847685 1723370727 668687333 270216579 263279879 125686970 628600728 1765707086"},"output":{"stdout":"107187762\n"}},{"input":{"stdin":"12\n39728457 467388357 127795962 872675759 1190847685 1723370727 585878039 270216579 260534362 610891069 971407775 1765707086"},"output":{"stdout":"489685764\n"}},{"input":{"stdin":"12\n161735902 467388357 126257933 872675759 1190847685 946982680 402149677 233485274 135685914 923078537 971407775 1765707086"},"output":{"stdout":"996075826\n"}},{"input":{"stdin":"12\n161735902 467388357 127795962 872675759 1190847685 946982680 402149677 822804784 135685914 923078537 971407775 1765707086"},"output":{"stdout":"991043957\n"}},{"input":{"stdin":"12\n236309991 717653235 724813649 872675759 1190847685 946982680 653377096 1615732667 135685914 605112598 971407775 1765707086"},"output":{"stdout":"138537156\n"}},{"input":{"stdin":"12\n65590262 394362112 430302156 872675759 1190847685 946982680 402149677 822804784 135685914 556514256 971407775 1765707086"},"output":{"stdout":"157165172\n"}},{"input":{"stdin":"12\n161735902 153817908 430302156 456338336 628894325 707723857 170551574 1292969385 166321802 923078537 971407775 1765707086"},"output":{"stdout":"870630282\n"}},{"input":{"stdin":"12\n30345845 394362112 708642191 872675759 405378550 767745523 402149677 110547358 880895728 923078537 971407775 1765707086"},"output":{"stdout":"912528748\n"}},{"input":{"stdin":"12\n367101616 467388357 127795962 872675759 121747736 1138999790 402149677 270216579 135685914 923078537 971407775 1765707086"},"output":{"stdout":"292836920\n"}},{"input":{"stdin":"12\n367101616 467388357 127795962 1640220090 1190847685 1723370727 402149677 270216579 135685914 923078537 628600728 1765707086"},"output":{"stdout":"510420571\n"}},{"input":{"stdin":"12\n161735902 394362112 430302156 872675759 1190847685 946982680 402149677 822804784 135685914 923078537 971407775 1765707086"},"output":{"stdout":"602338330\n"}},{"input":{"stdin":"12\n161735902 153817908 430302156 456338336 628894325 707723857 170551574 1292969385 198935015 923078537 971407775 1765707086"},"output":{"stdout":"749345204\n"}},{"input":{"stdin":"3\n0 -1 19"},"output":{"stdout":"58\n"}},{"input":{"stdin":"12\n161735902 153817908 430302156 456338336 628894325 707723857 164473536 1292969385 198935015 923078537 971407775 1765707086"},"output":{"stdout":"152993784\n"}},{"input":{"stdin":"12\n161735902 394362112 430302156 872675759 628894325 946982680 402149677 822804784 880895728 923078537 971407775 1765707086"},"output":{"stdout":"3107276\n"}},{"input":{"stdin":"12\n161735902 394362112 708642191 872675759 628894325 946982680 402149677 118193378 880895728 923078537 971407775 1765707086"},"output":{"stdout":"906103147\n"}},{"input":{"stdin":"12\n161735902 394362112 208582102 872675759 1190847685 946982680 206331977 412724029 880895728 359957688 971407775 1362959685"},"output":{"stdout":"441844712\n"}},{"input":{"stdin":"12\n236309991 717653235 724813649 872675759 1190847685 946982680 402149677 1615732667 135685914 605112598 971407775 1765707086"},"output":{"stdout":"362614563\n"}},{"input":{"stdin":"12\n236309991 717653235 724813649 872675759 1190847685 946982680 653377096 1615732667 16217625 605112598 971407775 1765707086"},"output":{"stdout":"890200901\n"}},{"input":{"stdin":"3\n1 3 5"},"output":{"stdout":"10\n"}},{"input":{"stdin":"12\n161735902 211047202 758123752 450968417 628894325 707723857 731963982 822804784 978891789 923078537 971407775 982631932"},"output":{"stdout":"627017709\n"}},{"input":{"stdin":"12\n161735902 394362112 708642191 872675759 405378550 946982680 402149677 118193378 880895728 923078537 971407775 1765707086"},"output":{"stdout":"791116298\n"}},{"input":{"stdin":"12\n161735902 211047202 430302156 450968417 628894325 707723857 731963982 822804784 880895728 923078537 971407775 1765707086"},"output":{"stdout":"161914202\n"}},{"input":{"stdin":"12\n161735902 153817908 430302156 450968417 628894325 707723857 731963982 822804784 880895728 923078537 971407775 1765707086"},"output":{"stdout":"295288367\n"}},{"input":{"stdin":"12\n39728457 467388357 127795962 872675759 1190847685 1723370727 585878039 308175318 260534362 610891069 971407775 1765707086"},"output":{"stdout":"566897157\n"}}],"string":"[\n {\n \"input\": {\n \"stdin\": \"12\\n161735902 211047202 430302156 450968417 628894325 707723857 731963982 822804784 880895728 923078537 971407775 982631932\"\n },\n \"output\": {\n \"stdout\": \"750927044\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"3\\n1 2 3\"\n },\n \"output\": {\n \"stdout\": \"5\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n161735902 394362112 208582102 872675759 1190847685 946982680 206331977 816973013 880895728 359957688 971407775 1362959685\"\n },\n \"output\": {\n \"stdout\": \"725397599\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n161735902 467388357 127795962 872675759 1190847685 946982680 402149677 233485274 135685914 923078537 971407775 1765707086\"\n },\n \"output\": {\n \"stdout\": \"597556674\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n161735902 211047202 620468900 450968417 628894325 707723857 731963982 822804784 880895728 923078537 971407775 982631932\"\n },\n \"output\": {\n \"stdout\": \"139672618\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n161735902 467388357 127795962 872675759 1190847685 1723370727 402149677 270216579 135685914 923078537 971407775 1765707086\"\n },\n \"output\": {\n \"stdout\": \"716486077\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n367101616 467388357 127795962 1640220090 1190847685 1158214640 402149677 270216579 135685914 923078537 628600728 1765707086\"\n },\n \"output\": {\n \"stdout\": \"899695081\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n367101616 467388357 127795962 872675759 121747736 1723370727 402149677 270216579 135685914 923078537 971407775 1765707086\"\n },\n \"output\": {\n \"stdout\": \"350377241\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n10777282 467388357 218368251 872675759 1190847685 210181890 402149677 578502185 135685914 923078537 971407775 1765707086\"\n },\n \"output\": {\n \"stdout\": \"852433968\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"3\\n1 2 5\"\n },\n \"output\": {\n \"stdout\": \"11\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"3\\n1 0 12\"\n },\n \"output\": {\n \"stdout\": \"34\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n367101616 467388357 127795962 872675759 1190847685 1723370727 668687333 270216579 135685914 125686970 628600728 1765707086\"\n },\n \"output\": {\n \"stdout\": \"473666389\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n161735902 301038801 70956625 872675759 1190847685 946982680 695219587 56894969 135685914 923078537 971407775 1765707086\"\n },\n \"output\": {\n \"stdout\": \"166454412\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n367101616 467388357 156291688 1477792495 1190847685 1723370727 668687333 270216579 135685914 125686970 628600728 1765707086\"\n },\n \"output\": {\n \"stdout\": \"854833727\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n367101616 467388357 127795962 872675759 121747736 1138999790 394173623 270216579 135685914 923078537 971407775 1765707086\"\n },\n \"output\": {\n \"stdout\": \"942848146\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n161735902 467388357 218368251 872675759 1190847685 210181890 402149677 822804784 135685914 923078537 971407775 1765707086\"\n },\n \"output\": {\n \"stdout\": \"612360867\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n367101616 467388357 156291688 872675759 1190847685 1723370727 668687333 270216579 135685914 125686970 628600728 1765707086\"\n },\n \"output\": {\n \"stdout\": \"744454860\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n236309991 467388357 430302156 872675759 1190847685 946982680 402149677 1615732667 135685914 605112598 971407775 1765707086\"\n },\n \"output\": {\n \"stdout\": \"962555797\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n367101616 467388357 156291688 888737356 1190847685 1723370727 668687333 270216579 135685914 125686970 628600728 1765707086\"\n },\n \"output\": {\n \"stdout\": \"856794434\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n161735902 467388357 218368251 872675759 1190847685 210181890 402149677 578502185 135685914 923078537 971407775 1765707086\"\n },\n \"output\": {\n \"stdout\": \"851798463\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n367101616 467388357 159541726 1477792495 1190847685 1723370727 668687333 270216579 135685914 125686970 1191846896 1765707086\"\n },\n \"output\": {\n \"stdout\": \"469392584\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n161735902 467388357 127795962 872675759 1190847685 210181890 402149677 822804784 135685914 923078537 971407775 1765707086\"\n },\n \"output\": {\n \"stdout\": \"252443434\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n367101616 782606466 156291688 888737356 1190847685 1723370727 668687333 270216579 263279879 125686970 628600728 1765707086\"\n },\n \"output\": {\n \"stdout\": \"44560905\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n367101616 467388357 156291688 888737356 1190847685 1723370727 668687333 270216579 135685914 28445051 628600728 1765707086\"\n },\n \"output\": {\n \"stdout\": \"477311241\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"3\\n1 1 10\"\n },\n \"output\": {\n \"stdout\": \"27\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n367101616 467388357 156291688 888737356 1190847685 1723370727 668687333 270216579 263279879 125686970 628600728 1765707086\"\n },\n \"output\": {\n \"stdout\": \"107187762\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n39728457 467388357 127795962 872675759 1190847685 1723370727 585878039 270216579 260534362 610891069 971407775 1765707086\"\n },\n \"output\": {\n \"stdout\": \"489685764\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n161735902 467388357 126257933 872675759 1190847685 946982680 402149677 233485274 135685914 923078537 971407775 1765707086\"\n },\n \"output\": {\n \"stdout\": \"996075826\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n161735902 467388357 127795962 872675759 1190847685 946982680 402149677 822804784 135685914 923078537 971407775 1765707086\"\n },\n \"output\": {\n \"stdout\": \"991043957\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n236309991 717653235 724813649 872675759 1190847685 946982680 653377096 1615732667 135685914 605112598 971407775 1765707086\"\n },\n \"output\": {\n \"stdout\": \"138537156\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n65590262 394362112 430302156 872675759 1190847685 946982680 402149677 822804784 135685914 556514256 971407775 1765707086\"\n },\n \"output\": {\n \"stdout\": \"157165172\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n161735902 153817908 430302156 456338336 628894325 707723857 170551574 1292969385 166321802 923078537 971407775 1765707086\"\n },\n \"output\": {\n \"stdout\": \"870630282\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n30345845 394362112 708642191 872675759 405378550 767745523 402149677 110547358 880895728 923078537 971407775 1765707086\"\n },\n \"output\": {\n \"stdout\": \"912528748\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n367101616 467388357 127795962 872675759 121747736 1138999790 402149677 270216579 135685914 923078537 971407775 1765707086\"\n },\n \"output\": {\n \"stdout\": \"292836920\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n367101616 467388357 127795962 1640220090 1190847685 1723370727 402149677 270216579 135685914 923078537 628600728 1765707086\"\n },\n \"output\": {\n \"stdout\": \"510420571\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n161735902 394362112 430302156 872675759 1190847685 946982680 402149677 822804784 135685914 923078537 971407775 1765707086\"\n },\n \"output\": {\n \"stdout\": \"602338330\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n161735902 153817908 430302156 456338336 628894325 707723857 170551574 1292969385 198935015 923078537 971407775 1765707086\"\n },\n \"output\": {\n \"stdout\": \"749345204\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"3\\n0 -1 19\"\n },\n \"output\": {\n \"stdout\": \"58\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n161735902 153817908 430302156 456338336 628894325 707723857 164473536 1292969385 198935015 923078537 971407775 1765707086\"\n },\n \"output\": {\n \"stdout\": \"152993784\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n161735902 394362112 430302156 872675759 628894325 946982680 402149677 822804784 880895728 923078537 971407775 1765707086\"\n },\n \"output\": {\n \"stdout\": \"3107276\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n161735902 394362112 708642191 872675759 628894325 946982680 402149677 118193378 880895728 923078537 971407775 1765707086\"\n },\n \"output\": {\n \"stdout\": \"906103147\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n161735902 394362112 208582102 872675759 1190847685 946982680 206331977 412724029 880895728 359957688 971407775 1362959685\"\n },\n \"output\": {\n \"stdout\": \"441844712\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n236309991 717653235 724813649 872675759 1190847685 946982680 402149677 1615732667 135685914 605112598 971407775 1765707086\"\n },\n \"output\": {\n \"stdout\": \"362614563\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n236309991 717653235 724813649 872675759 1190847685 946982680 653377096 1615732667 16217625 605112598 971407775 1765707086\"\n },\n \"output\": {\n \"stdout\": \"890200901\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"3\\n1 3 5\"\n },\n \"output\": {\n \"stdout\": \"10\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n161735902 211047202 758123752 450968417 628894325 707723857 731963982 822804784 978891789 923078537 971407775 982631932\"\n },\n \"output\": {\n \"stdout\": \"627017709\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n161735902 394362112 708642191 872675759 405378550 946982680 402149677 118193378 880895728 923078537 971407775 1765707086\"\n },\n \"output\": {\n \"stdout\": \"791116298\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n161735902 211047202 430302156 450968417 628894325 707723857 731963982 822804784 880895728 923078537 971407775 1765707086\"\n },\n \"output\": {\n \"stdout\": \"161914202\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n161735902 153817908 430302156 450968417 628894325 707723857 731963982 822804784 880895728 923078537 971407775 1765707086\"\n },\n \"output\": {\n \"stdout\": \"295288367\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"12\\n39728457 467388357 127795962 872675759 1190847685 1723370727 585878039 308175318 260534362 610891069 971407775 1765707086\"\n },\n \"output\": {\n \"stdout\": \"566897157\\n\"\n }\n }\n]","isConversational":false},"labels":{"kind":"string","value":"{\n \"tags\": [],\n \"title\": \"p02807 Dwango Programming Contest 6th - Fusing Slimes\"\n}"},"canonical_solution":{"kind":"string","value":"{\n \"cpp\": \"#include <bits/stdc++.h>\\n#define rep(i, n) for(int i = 0; i < (n); ++i)\\nusing namespace std;\\ntypedef long long ll;\\n\\nconst ll MAX = 1e5;\\nconst ll MOD = 1e9+7;\\n\\nll fac[MAX], finv[MAX], inv[MAX];\\n\\n// テーブルを作る前処理\\nvoid COMinit() {\\n fac[0] = fac[1] = 1;\\n finv[0] = finv[1] = 1;\\n inv[1] = 1;\\n for (int i = 2; i < MAX; i++){\\n fac[i] = fac[i-1]*i%MOD;\\n inv[i] = MOD-inv[MOD%i]*(MOD/i)%MOD; // 逆元であるコイツが必要\\n finv[i] = finv[i-1]*inv[i]%MOD;\\n }\\n}\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n cin.tie(0);\\n\\tcout << setprecision(10) << fixed;\\n\\tint N;\\n\\tcin >> N;\\n\\tCOMinit();\\n\\tvector<ll> x(N);\\n\\trep(i, N) cin >> x[i];\\n\\t// スライムがx(i+1)~x(i)間を通る個数の総数的なもの\\n\\tll c = 0;\\n\\tll ans = 0;\\n\\tfor(int i = 1; i < N; i++){\\n c += inv[i];\\n ans += (c*(x[i]-x[i-1]))%MOD;\\n ans %= MOD;\\n }\\n ans *= fac[N-1];\\n ans %= MOD;\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\\n\",\n \"java\": \"import java.io.*;\\nimport java.util.*;\\n\\npublic class Main {\\n static long mod = (int)Math.pow(10,9)+7;\\n\\tpublic static void main(String[] args) throws IOException {\\n\\t\\tFastScanner sc = new FastScanner(System.in);\\n\\t\\tPrintWriter pw = new PrintWriter(System.out);\\n\\t\\tint n = sc.nextInt();\\n\\t\\tlong nm = 1;\\n\\t\\tfor(long i = 2; i < n; i++){\\n\\t\\t nm *= i;\\n\\t\\t nm %= mod;\\n\\t\\t}\\n\\t\\tlong[] a = sc.nextLongArray(n);\\n\\t\\tlong dn = 0;\\n\\t\\tlong ans = 0;\\n\\t\\tfor(int i = 1; i < n; i++){\\n\\t\\t dn += rep2(i,mod-2);\\n\\t\\t dn %= mod;\\n\\t\\t ans += (a[i]-a[i-1]) * (nm*dn%mod);\\n\\t\\t ans %= mod;\\n\\t\\t}\\n\\t\\tpw.println(ans);\\n\\t\\tpw.close();\\n\\t}\\n\\t\\n\\tprivate static long rep2(long b, long n){\\n if(n == 0) return 1;\\n if(n == 1) return b;\\n long bn = rep2(b,n/2L)%mod;\\n if(n % 2 == 0){\\n return (long)(bn%mod*bn%mod)%mod;\\n }else{\\n return (long)(bn%mod*bn%mod)%mod*b%mod;\\n }\\n }\\n}\\n\\nclass FastScanner {\\n private BufferedReader reader = null;\\n private StringTokenizer tokenizer = null;\\n public FastScanner(InputStream in) {\\n reader = new BufferedReader(new InputStreamReader(in));\\n tokenizer = null;\\n }\\n\\n public String next() {\\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\\n try {\\n tokenizer = new StringTokenizer(reader.readLine());\\n } catch (IOException e) {\\n throw new RuntimeException(e);\\n }\\n }\\n return tokenizer.nextToken();\\n }\\n\\n public String nextLine() {\\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\\n try {\\n return reader.readLine();\\n } catch (IOException e) {\\n throw new RuntimeException(e);\\n }\\n }\\n return tokenizer.nextToken(\\\"\\\\n\\\");\\n }\\n\\n public long nextLong() {\\n return Long.parseLong(next());\\n }\\n\\n public int nextInt() {\\n return Integer.parseInt(next());\\n }\\n\\n public double nextDouble() {\\n return Double.parseDouble(next());\\n }\\n\\n public int[] nextIntArray(int n) {\\n int[] a = new int[n];\\n for (int i = 0; i < n; i++)\\n a[i] = nextInt();\\n return a;\\n }\\n\\n public long[] nextLongArray(int n) {\\n long[] a = new long[n];\\n for (int i = 0; i < n; i++)\\n a[i] = nextLong();\\n return a;\\n } \\n}\\n\\n\",\n \"python\": \"import sys\\nsys.setrecursionlimit(1000000)\\n\\nn = int(input())\\nx = list(map(int, input().split()))\\nd = [x[i+1] - x[i] for i in range(n - 1)]\\n\\ndef pow(x, y):\\n if y == 0:\\n return 1\\n ans = 1\\n while y > 1:\\n if y % 2 != 0:\\n ans *= x\\n ans %= 1000000007\\n x *= x\\n x %= 1000000007\\n y //= 2\\n return ans * x % 1000000007\\n\\ndef fact(m):\\n return m * fact(m-1) % 1000000007 if m != 1 else 1\\n \\nfact_n_1 = fact(n-1)\\n\\ne = [None] * (n-1)\\nfor i in range(n-1):\\n if i == 0:\\n e[i] = fact_n_1\\n else:\\n e[i] = (e[i - 1] + fact_n_1 * pow(i + 1, 1000000005)) % 1000000007\\n\\nprint(sum(e_i * d_i % 1000000007\\n for i, (d_i, e_i) \\n in enumerate(zip(d, e))) % 1000000007 ) \"\n}"}}},{"rowIdx":496,"cells":{"id":{"kind":"string","value":"p02943 AtCoder Grand Contest 037 - Reversing and Concatenating"},"content":{"kind":"string","value":"Takahashi has a string S of length N consisting of lowercase English letters. On this string, he will perform the following operation K times:\n\n* Let T be the string obtained by reversing S, and U be the string obtained by concatenating S and T in this order.\n* Let S' be some contiguous substring of U with length N, and replace S with S'.\n\n\n\nAmong the strings that can be the string S after the K operations, find the lexicographically smallest possible one.\n\nConstraints\n\n* 1 \\leq N \\leq 5000\n* 1 \\leq K \\leq 10^9\n* |S|=N\n* S consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\n\nN K\nS\n\n\nOutput\n\nPrint the lexicographically smallest possible string that can be the string S after the K operations.\n\nExamples\n\nInput\n\n5 1\nbacba\n\n\nOutput\n\naabca\n\n\nInput\n\n10 2\nbbaabbbaab\n\n\nOutput\n\naaaabbaabb"},"test":{"kind":"list like","value":[{"input":{"stdin":"5 1\nbacba"},"output":{"stdout":"aabca"}},{"input":{"stdin":"10 2\nbbaabbbaab"},"output":{"stdout":"aaaabbaabb"}},{"input":{"stdin":"10 1\nbaaabbbaab"},"output":{"stdout":"aaabbbaabb\n"}},{"input":{"stdin":"8 7\nbba`abbaac"},"output":{"stdout":"````````\n"}},{"input":{"stdin":"5 2\nbba`b"},"output":{"stdout":"``bb`\n"}},{"input":{"stdin":"10 2\nbbcabbba`a"},"output":{"stdout":"``aa`abbba\n"}},{"input":{"stdin":"10 1\nbabbba`abb"},"output":{"stdout":"`abbbba`ab\n"}},{"input":{"stdin":"4 4\nbbaaabbbab"},"output":{"stdout":"aaaa\n"}},{"input":{"stdin":"10 1\nbbaabbbaab"},"output":{"stdout":"aabbaabbba\n"}},{"input":{"stdin":"5 1\nb`bbb"},"output":{"stdout":"`bbbb\n"}},{"input":{"stdin":"9 5\nbbaaabbbab"},"output":{"stdout":"aaaaaaaaa\n"}},{"input":{"stdin":"5 2\na`bac"},"output":{"stdout":"``bac\n"}},{"input":{"stdin":"5 1\nb`caa"},"output":{"stdout":"`caaa\n"}},{"input":{"stdin":"5 2\nb`cba"},"output":{"stdout":"``cba\n"}},{"input":{"stdin":"5 1\naac`a"},"output":{"stdout":"`aa`c\n"}},{"input":{"stdin":"10 1\nbbaaabbaab"},"output":{"stdout":"aaabbaabba\n"}},{"input":{"stdin":"5 2\n`bcab"},"output":{"stdout":"``bca\n"}},{"input":{"stdin":"10 2\nbbaabbbbbb"},"output":{"stdout":"aaaabbbbbb\n"}},{"input":{"stdin":"5 2\nbbbac"},"output":{"stdout":"aacca\n"}},{"input":{"stdin":"5 1\nbaaac"},"output":{"stdout":"aaacc\n"}},{"input":{"stdin":"5 1\ncbbab"},"output":{"stdout":"abbab\n"}},{"input":{"stdin":"10 1\nbabbbbaabb"},"output":{"stdout":"aabbbbaabb\n"}},{"input":{"stdin":"5 1\naabac"},"output":{"stdout":"aabac\n"}},{"input":{"stdin":"5 8\nabc`a"},"output":{"stdout":"`````\n"}},{"input":{"stdin":"10 3\nbabbba`abb"},"output":{"stdout":"````abbbba\n"}},{"input":{"stdin":"5 2\na`aac"},"output":{"stdout":"``aac\n"}},{"input":{"stdin":"10 3\nbbaabbba`b"},"output":{"stdout":"````bb`abb\n"}},{"input":{"stdin":"5 2\naac`a"},"output":{"stdout":"``aa`\n"}},{"input":{"stdin":"10 2\nbbbabbbaaa"},"output":{"stdout":"aaaaaaaaaa\n"}},{"input":{"stdin":"10 2\nbaabbaaabb"},"output":{"stdout":"aaaaaabbbb\n"}},{"input":{"stdin":"10 2\naaabab`bbb"},"output":{"stdout":"``bbbbbb`b\n"}},{"input":{"stdin":"10 2\nbbaaabbaab"},"output":{"stdout":"aaaaaabbaa\n"}},{"input":{"stdin":"7 7\nbbaaabbbab"},"output":{"stdout":"aaaaaaa\n"}},{"input":{"stdin":"5 1\nbabcb"},"output":{"stdout":"abcbb\n"}},{"input":{"stdin":"10 2\nbabbbbaabb"},"output":{"stdout":"aaaabbbbaa\n"}},{"input":{"stdin":"5 3\n`bcaa"},"output":{"stdout":"````b\n"}},{"input":{"stdin":"10 2\nabbabbcaba"},"output":{"stdout":"aaaabacbba\n"}},{"input":{"stdin":"5 2\nbacba"},"output":{"stdout":"aaaab\n"}},{"input":{"stdin":"5 1\nbbbad"},"output":{"stdout":"addab\n"}},{"input":{"stdin":"5 1\nabcba"},"output":{"stdout":"aabcb\n"}},{"input":{"stdin":"10 5\nbbaa`bbbab"},"output":{"stdout":"``````````\n"}},{"input":{"stdin":"10 2\nbbaaabcbab"},"output":{"stdout":"aaaaaabcba\n"}},{"input":{"stdin":"8 5\nbbaaabbbab"},"output":{"stdout":"aaaaaaaa\n"}},{"input":{"stdin":"2 5\nbacaa"},"output":{"stdout":"aa\n"}},{"input":{"stdin":"10 3\nbaabbababa"},"output":{"stdout":"aaaaaaaaba\n"}},{"input":{"stdin":"5 1\nbabbb"},"output":{"stdout":"abbbb\n"}},{"input":{"stdin":"10 1\nbaaaabbaab"},"output":{"stdout":"aaaabbaabb\n"}},{"input":{"stdin":"5 1\nbba`b"},"output":{"stdout":"`bb`a\n"}},{"input":{"stdin":"5 1\nb`abb"},"output":{"stdout":"`abbb\n"}},{"input":{"stdin":"10 1\naaabbb`bbb"},"output":{"stdout":"`bbbbbb`bb\n"}}],"string":"[\n {\n \"input\": {\n \"stdin\": \"5 1\\nbacba\"\n },\n \"output\": {\n \"stdout\": \"aabca\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10 2\\nbbaabbbaab\"\n },\n \"output\": {\n \"stdout\": \"aaaabbaabb\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10 1\\nbaaabbbaab\"\n },\n \"output\": {\n \"stdout\": \"aaabbbaabb\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"8 7\\nbba`abbaac\"\n },\n \"output\": {\n \"stdout\": \"````````\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5 2\\nbba`b\"\n },\n \"output\": {\n \"stdout\": \"``bb`\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10 2\\nbbcabbba`a\"\n },\n \"output\": {\n \"stdout\": \"``aa`abbba\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10 1\\nbabbba`abb\"\n },\n \"output\": {\n \"stdout\": \"`abbbba`ab\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4 4\\nbbaaabbbab\"\n },\n \"output\": {\n \"stdout\": \"aaaa\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10 1\\nbbaabbbaab\"\n },\n \"output\": {\n \"stdout\": \"aabbaabbba\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5 1\\nb`bbb\"\n },\n \"output\": {\n \"stdout\": \"`bbbb\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"9 5\\nbbaaabbbab\"\n },\n \"output\": {\n \"stdout\": \"aaaaaaaaa\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5 2\\na`bac\"\n },\n \"output\": {\n \"stdout\": \"``bac\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5 1\\nb`caa\"\n },\n \"output\": {\n \"stdout\": \"`caaa\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5 2\\nb`cba\"\n },\n \"output\": {\n \"stdout\": \"``cba\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5 1\\naac`a\"\n },\n \"output\": {\n \"stdout\": \"`aa`c\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10 1\\nbbaaabbaab\"\n },\n \"output\": {\n \"stdout\": \"aaabbaabba\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5 2\\n`bcab\"\n },\n \"output\": {\n \"stdout\": \"``bca\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10 2\\nbbaabbbbbb\"\n },\n \"output\": {\n \"stdout\": \"aaaabbbbbb\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5 2\\nbbbac\"\n },\n \"output\": {\n \"stdout\": \"aacca\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5 1\\nbaaac\"\n },\n \"output\": {\n \"stdout\": \"aaacc\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5 1\\ncbbab\"\n },\n \"output\": {\n \"stdout\": \"abbab\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10 1\\nbabbbbaabb\"\n },\n \"output\": {\n \"stdout\": \"aabbbbaabb\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5 1\\naabac\"\n },\n \"output\": {\n \"stdout\": \"aabac\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5 8\\nabc`a\"\n },\n \"output\": {\n \"stdout\": \"`````\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10 3\\nbabbba`abb\"\n },\n \"output\": {\n \"stdout\": \"````abbbba\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5 2\\na`aac\"\n },\n \"output\": {\n \"stdout\": \"``aac\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10 3\\nbbaabbba`b\"\n },\n \"output\": {\n \"stdout\": \"````bb`abb\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5 2\\naac`a\"\n },\n \"output\": {\n \"stdout\": \"``aa`\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10 2\\nbbbabbbaaa\"\n },\n \"output\": {\n \"stdout\": \"aaaaaaaaaa\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10 2\\nbaabbaaabb\"\n },\n \"output\": {\n \"stdout\": \"aaaaaabbbb\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10 2\\naaabab`bbb\"\n },\n \"output\": {\n \"stdout\": \"``bbbbbb`b\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10 2\\nbbaaabbaab\"\n },\n \"output\": {\n \"stdout\": \"aaaaaabbaa\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"7 7\\nbbaaabbbab\"\n },\n \"output\": {\n \"stdout\": \"aaaaaaa\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5 1\\nbabcb\"\n },\n \"output\": {\n \"stdout\": \"abcbb\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10 2\\nbabbbbaabb\"\n },\n \"output\": {\n \"stdout\": \"aaaabbbbaa\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5 3\\n`bcaa\"\n },\n \"output\": {\n \"stdout\": \"````b\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10 2\\nabbabbcaba\"\n },\n \"output\": {\n \"stdout\": \"aaaabacbba\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5 2\\nbacba\"\n },\n \"output\": {\n \"stdout\": \"aaaab\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5 1\\nbbbad\"\n },\n \"output\": {\n \"stdout\": \"addab\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5 1\\nabcba\"\n },\n \"output\": {\n \"stdout\": \"aabcb\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10 5\\nbbaa`bbbab\"\n },\n \"output\": {\n \"stdout\": \"``````````\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10 2\\nbbaaabcbab\"\n },\n \"output\": {\n \"stdout\": \"aaaaaabcba\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"8 5\\nbbaaabbbab\"\n },\n \"output\": {\n \"stdout\": \"aaaaaaaa\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"2 5\\nbacaa\"\n },\n \"output\": {\n \"stdout\": \"aa\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10 3\\nbaabbababa\"\n },\n \"output\": {\n \"stdout\": \"aaaaaaaaba\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5 1\\nbabbb\"\n },\n \"output\": {\n \"stdout\": \"abbbb\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10 1\\nbaaaabbaab\"\n },\n \"output\": {\n \"stdout\": \"aaaabbaabb\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5 1\\nbba`b\"\n },\n \"output\": {\n \"stdout\": \"`bb`a\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5 1\\nb`abb\"\n },\n \"output\": {\n \"stdout\": \"`abbb\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10 1\\naaabbb`bbb\"\n },\n \"output\": {\n \"stdout\": \"`bbbbbb`bb\\n\"\n }\n }\n]","isConversational":false},"labels":{"kind":"string","value":"{\n \"tags\": [],\n \"title\": \"p02943 AtCoder Grand Contest 037 - Reversing and Concatenating\"\n}"},"canonical_solution":{"kind":"string","value":"{\n \"cpp\": \"#include <bits/stdc++.h>\\n\\n#define MIN_INT -2147483648\\n#define MAX_INT 2147483647\\n#define MIN_LONG -9223372036854775808L\\n#define MAX_LONG 9223372036854775807L\\n\\n#define long long long int\\n\\nusing namespace std;\\n\\n// @author: pashka\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n\\n int n, k;\\n cin >> n >> k;\\n k = min(k, 15);\\n string s;\\n cin >> s;\\n string t = s;\\n reverse(t.begin(), t.end());\\n string u = s + t;\\n string res = s;\\n for (int i = 0; i + n <= u.size(); i++) {\\n string ss = u.substr(i, n);\\n if (k > 0) {\\n int j = n - 1;\\n while (j >= 0 && ss[j - 1] == ss[n - 1]) j--;\\n int x = min((n - j) << (k - 1), n);\\n string s3 = \\\"\\\";\\n for (int t = 0; t < x; t++) s3 += ss[n - 1];\\n for (int t = 0; t < n - x; t++) {\\n s3 += ss[j - 1 - t];\\n }\\n ss = s3;\\n }\\n if (ss < res) {\\n res = ss;\\n }\\n }\\n cout << res;\\n \\n return 0;\\n}\",\n \"java\": \"import java.io.OutputStream;\\nimport java.io.IOException;\\nimport java.io.InputStream;\\nimport java.io.OutputStream;\\nimport java.io.PrintWriter;\\nimport java.util.Arrays;\\nimport java.util.Iterator;\\nimport java.io.BufferedWriter;\\nimport java.util.InputMismatchException;\\nimport java.io.IOException;\\nimport java.io.Writer;\\nimport java.io.OutputStreamWriter;\\nimport java.util.NoSuchElementException;\\nimport java.io.InputStream;\\n\\n/**\\n * Built using CHelper plug-in\\n * Actual solution is at the top\\n *\\n * @author Egor Kulikov (egor@egork.net)\\n */\\npublic class Main {\\n public static void main(String[] args) {\\n InputStream inputStream = System.in;\\n OutputStream outputStream = System.out;\\n InputReader in = new InputReader(inputStream);\\n OutputWriter out = new OutputWriter(outputStream);\\n TaskE solver = new TaskE();\\n solver.solve(1, in, out);\\n out.close();\\n }\\n\\n static class TaskE {\\n public void solve(int testNumber, InputReader in, OutputWriter out) {\\n int n = in.readInt();\\n int k = in.readInt();\\n String s = in.readString();\\n if (k >= 14) {\\n char c = new CharArray(s.toCharArray()).min();\\n for (int i = 0; i < n; i++) {\\n out.print(c);\\n }\\n out.printLine();\\n return;\\n }\\n s = s + StringUtils.reverse(s);\\n int[] order = StringUtils.suffixArray(s);\\n order = ArrayUtils.reversePermutation(order);\\n int start = -1;\\n for (int i = 0; i < order.length; i++) {\\n if (order[i] <= n) {\\n start = order[i];\\n break;\\n }\\n }\\n int qty = 1;\\n char c = s.charAt(start);\\n for (int i = 1; i < n; i++) {\\n if (s.charAt(i + start) == c) {\\n qty++;\\n } else {\\n break;\\n }\\n }\\n start += qty;\\n qty *= 1 << (k - 1);\\n for (int i = 0; i < n && i < qty; i++) {\\n out.print(c);\\n }\\n if (qty < n) {\\n out.printLine(s.substring(start, start + n - qty));\\n } else {\\n out.printLine();\\n }\\n }\\n\\n }\\n\\n static class StringUtils {\\n public static String reverse(String sample) {\\n StringBuilder result = new StringBuilder(sample);\\n result.reverse();\\n return result.toString();\\n }\\n\\n public static int[] suffixArray(CharSequence s) {\\n int length = s.length();\\n int[] position = new int[length];\\n int[] count = new int[Math.max(256, length)];\\n int[] order = new int[length];\\n for (int i = 0; i < length; ++i) {\\n count[s.charAt(i)]++;\\n }\\n for (int i = 1; i < 256; ++i) {\\n count[i] += count[i - 1];\\n }\\n for (int i = 0; i < length; ++i) {\\n position[--count[s.charAt(i)]] = i;\\n }\\n order[position[0]] = 0;\\n int currentClass = 0;\\n for (int i = 1; i < length; ++i) {\\n if (s.charAt(position[i]) != s.charAt(position[i - 1])) {\\n currentClass++;\\n }\\n order[position[i]] = currentClass;\\n }\\n int[] nextPosition = new int[length];\\n int[] nextOrder = new int[length];\\n for (int h = 0; (1 << h) < length; h++) {\\n for (int i = 0; i < length; ++i) {\\n nextPosition[i] = position[i] - (1 << h);\\n if (nextPosition[i] < 0) {\\n nextPosition[i] += length;\\n }\\n }\\n Arrays.fill(count, 0);\\n for (int i = 0; i < length; ++i) {\\n count[order[nextPosition[i]]]++;\\n }\\n for (int i = 1; i <= currentClass; ++i) {\\n count[i] += count[i - 1];\\n }\\n for (int i = length - 1; i >= 0; --i) {\\n position[--count[order[nextPosition[i]]]] = nextPosition[i];\\n }\\n nextOrder[position[0]] = 0;\\n currentClass = 0;\\n for (int i = 1; i < length; ++i) {\\n int mid1 = (position[i] + (1 << h));\\n if (mid1 >= length) {\\n mid1 -= length;\\n }\\n int mid2 = (position[i - 1] + (1 << h));\\n if (mid2 >= length) {\\n mid2 -= length;\\n }\\n if (order[position[i]] != order[position[i - 1]] || order[mid1] != order[mid2]) {\\n currentClass++;\\n }\\n nextOrder[position[i]] = currentClass;\\n }\\n System.arraycopy(nextOrder, 0, order, 0, length);\\n }\\n return order;\\n }\\n\\n }\\n\\n static class OutputWriter {\\n private final PrintWriter writer;\\n\\n public OutputWriter(OutputStream outputStream) {\\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\\n }\\n\\n public OutputWriter(Writer writer) {\\n this.writer = new PrintWriter(writer);\\n }\\n\\n public void print(Object... objects) {\\n for (int i = 0; i < objects.length; i++) {\\n if (i != 0) {\\n writer.print(' ');\\n }\\n writer.print(objects[i]);\\n }\\n }\\n\\n public void printLine() {\\n writer.println();\\n }\\n\\n public void printLine(Object... objects) {\\n print(objects);\\n writer.println();\\n }\\n\\n public void print(char i) {\\n writer.print(i);\\n }\\n\\n public void close() {\\n writer.close();\\n }\\n\\n }\\n\\n static abstract class CharAbstractStream implements CharStream {\\n public String toString() {\\n StringBuilder builder = new StringBuilder();\\n boolean first = true;\\n for (CharIterator it = charIterator(); it.isValid(); it.advance()) {\\n if (first) {\\n first = false;\\n } else {\\n builder.append(' ');\\n }\\n builder.append(it.value());\\n }\\n return builder.toString();\\n }\\n\\n public boolean equals(Object o) {\\n if (!(o instanceof CharStream)) {\\n return false;\\n }\\n CharStream c = (CharStream) o;\\n CharIterator it = charIterator();\\n CharIterator jt = c.charIterator();\\n while (it.isValid() && jt.isValid()) {\\n if (it.value() != jt.value()) {\\n return false;\\n }\\n it.advance();\\n jt.advance();\\n }\\n return !it.isValid() && !jt.isValid();\\n }\\n\\n public int hashCode() {\\n int result = 0;\\n for (CharIterator it = charIterator(); it.isValid(); it.advance()) {\\n result *= 31;\\n result += it.value();\\n }\\n return result;\\n }\\n\\n }\\n\\n static class InputReader {\\n private InputStream stream;\\n private byte[] buf = new byte[1024];\\n private int curChar;\\n private int numChars;\\n private InputReader.SpaceCharFilter filter;\\n\\n public InputReader(InputStream stream) {\\n this.stream = stream;\\n }\\n\\n public int read() {\\n if (numChars == -1) {\\n throw new InputMismatchException();\\n }\\n if (curChar >= numChars) {\\n curChar = 0;\\n try {\\n numChars = stream.read(buf);\\n } catch (IOException e) {\\n throw new InputMismatchException();\\n }\\n if (numChars <= 0) {\\n return -1;\\n }\\n }\\n return buf[curChar++];\\n }\\n\\n public int readInt() {\\n int c = read();\\n while (isSpaceChar(c)) {\\n c = read();\\n }\\n int sgn = 1;\\n if (c == '-') {\\n sgn = -1;\\n c = read();\\n }\\n int res = 0;\\n do {\\n if (c < '0' || c > '9') {\\n throw new InputMismatchException();\\n }\\n res *= 10;\\n res += c - '0';\\n c = read();\\n } while (!isSpaceChar(c));\\n return res * sgn;\\n }\\n\\n public String readString() {\\n int c = read();\\n while (isSpaceChar(c)) {\\n c = read();\\n }\\n StringBuilder res = new StringBuilder();\\n do {\\n if (Character.isValidCodePoint(c)) {\\n res.appendCodePoint(c);\\n }\\n c = read();\\n } while (!isSpaceChar(c));\\n return res.toString();\\n }\\n\\n public boolean isSpaceChar(int c) {\\n if (filter != null) {\\n return filter.isSpaceChar(c);\\n }\\n return isWhitespace(c);\\n }\\n\\n public static boolean isWhitespace(int c) {\\n return c == ' ' || c == '\\\\n' || c == '\\\\r' || c == '\\\\t' || c == -1;\\n }\\n\\n public interface SpaceCharFilter {\\n public boolean isSpaceChar(int ch);\\n\\n }\\n\\n }\\n\\n static interface CharIterator {\\n public char value() throws NoSuchElementException;\\n\\n public boolean advance();\\n\\n public boolean isValid();\\n\\n }\\n\\n static interface CharStream extends Iterable<Character>, Comparable<CharStream> {\\n public CharIterator charIterator();\\n\\n default public Iterator<Character> iterator() {\\n return new Iterator<Character>() {\\n private CharIterator it = charIterator();\\n\\n public boolean hasNext() {\\n return it.isValid();\\n }\\n\\n public Character next() {\\n char result = it.value();\\n it.advance();\\n return result;\\n }\\n };\\n }\\n\\n default public int compareTo(CharStream c) {\\n CharIterator it = charIterator();\\n CharIterator jt = c.charIterator();\\n while (it.isValid() && jt.isValid()) {\\n char i = it.value();\\n char j = jt.value();\\n if (i < j) {\\n return -1;\\n } else if (i > j) {\\n return 1;\\n }\\n it.advance();\\n jt.advance();\\n }\\n if (it.isValid()) {\\n return 1;\\n }\\n if (jt.isValid()) {\\n return -1;\\n }\\n return 0;\\n }\\n\\n default public char min() {\\n char result = Character.MAX_VALUE;\\n for (CharIterator it = charIterator(); it.isValid(); it.advance()) {\\n char current = it.value();\\n if (current < result) {\\n result = current;\\n }\\n }\\n return result;\\n }\\n\\n }\\n\\n static class CharArray extends CharAbstractStream implements CharList {\\n private char[] data;\\n\\n public CharArray(char[] arr) {\\n data = arr;\\n }\\n\\n public int size() {\\n return data.length;\\n }\\n\\n public char get(int at) {\\n return data[at];\\n }\\n\\n public void removeAt(int index) {\\n throw new UnsupportedOperationException();\\n }\\n\\n }\\n\\n static class ArrayUtils {\\n public static int[] reversePermutation(int[] permutation) {\\n int[] result = new int[permutation.length];\\n for (int i = 0; i < permutation.length; i++) {\\n result[permutation[i]] = i;\\n }\\n return result;\\n }\\n\\n }\\n\\n static interface CharCollection extends CharStream {\\n public int size();\\n\\n }\\n\\n static interface CharReversableCollection extends CharCollection {\\n }\\n\\n static interface CharList extends CharReversableCollection {\\n public abstract char get(int index);\\n\\n public abstract void removeAt(int index);\\n\\n default public CharIterator charIterator() {\\n return new CharIterator() {\\n private int at;\\n private boolean removed;\\n\\n public char value() {\\n if (removed) {\\n throw new IllegalStateException();\\n }\\n return get(at);\\n }\\n\\n public boolean advance() {\\n at++;\\n removed = false;\\n return isValid();\\n }\\n\\n public boolean isValid() {\\n return !removed && at < size();\\n }\\n\\n public void remove() {\\n removeAt(at);\\n at--;\\n removed = true;\\n }\\n };\\n }\\n\\n }\\n}\\n\\n\",\n \"python\": \"n,k=map(int,input().split())\\ns=input()\\nslist=list(s)\\nnum=0\\nfor i in range(17):\\n if 2**num>=n:\\n num+=1\\n break\\n num+=1\\nif k>=num:\\n slist.sort()\\n ans=slist[0]*n\\n print(ans)\\nelse:\\n for i in range(n):\\n slist.append(slist[n-1-i])\\n s1=[]\\n for i in range(n+1):\\n s1.append(slist[i:i+n])\\n s1.sort()\\n sstr=s1[0]\\n ss2=\\\"\\\"\\n for i in range(n):\\n ss2+=sstr[i]\\n s3=sstr[0]\\n num10=1\\n for i in range(n-1):\\n if s3!=sstr[i+1]:\\n break\\n else:\\n num10+=1\\n s2=\\\"\\\"\\n for i in range(n):\\n s2+=sstr[-1-i]\\n slist.sort()\\n num=min((2**(k-1))*num10,n)\\n num2=n-num\\n ans=slist[0]*num\\n ans+=ss2[num10:num10+num2]\\n print(ans)\\n\"\n}"}}},{"rowIdx":497,"cells":{"id":{"kind":"string","value":"p03080 ExaWizards 2019 - Red or Blue"},"content":{"kind":"string","value":"There are N people numbered 1 to N. Each person wears a red hat or a blue hat.\n\nYou are given a string s representing the colors of the people. Person i wears a red hat if s_i is `R`, and a blue hat if s_i is `B`.\n\nDetermine if there are more people wearing a red hat than people wearing a blue hat.\n\nConstraints\n\n* 1 \\leq N \\leq 100\n* |s| = N\n* s_i is `R` or `B`.\n\nInput\n\nInput is given from Standard Input in the following format:\n\n\nN\ns\n\n\nOutput\n\nIf there are more people wearing a red hat than there are people wearing a blue hat, print `Yes`; otherwise, print `No`.\n\nExamples\n\nInput\n\n4\nRRBR\n\n\nOutput\n\nYes\n\n\nInput\n\n4\nBRBR\n\n\nOutput\n\nNo"},"test":{"kind":"list like","value":[{"input":{"stdin":"4\nRRBR"},"output":{"stdout":"Yes"}},{"input":{"stdin":"4\nBRBR"},"output":{"stdout":"No"}},{"input":{"stdin":"4\nSBCO"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nSAOC"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nAPBR"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nAQCS"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nRBQB"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nNACS"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nSACO"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nCOAS"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nPASB"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nOBCS"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nOCBS"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nNBAS"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nM?CS"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nSRCB"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nCSBO"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nBPBR"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nS@BM"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nPBSB"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nPCAS"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nPASC"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nLC@S"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nSAAN"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nS@CM"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nAASN"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nBCRS"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nSCAP"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nPARB"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nSBCN"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nAQBR"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nRCRR"},"output":{"stdout":"Yes\n"}},{"input":{"stdin":"4\nBBQR"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nPSBB"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nBQBS"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nSAAM"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nDRRR"},"output":{"stdout":"Yes\n"}},{"input":{"stdin":"4\nS?DM"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nS?CM"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nSABP"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nRRCR"},"output":{"stdout":"Yes\n"}},{"input":{"stdin":"4\nSDAO"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nCASP"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nSC?N"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nMBAS"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nSC@M"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nAQBS"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nSBDO"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nBPCS"},"output":{"stdout":"No\n"}},{"input":{"stdin":"4\nAQBQ"},"output":{"stdout":"No\n"}}],"string":"[\n {\n \"input\": {\n \"stdin\": \"4\\nRRBR\"\n },\n \"output\": {\n \"stdout\": \"Yes\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nBRBR\"\n },\n \"output\": {\n \"stdout\": \"No\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nSBCO\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nSAOC\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nAPBR\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nAQCS\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nRBQB\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nNACS\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nSACO\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nCOAS\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nPASB\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nOBCS\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nOCBS\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nNBAS\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nM?CS\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nSRCB\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nCSBO\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nBPBR\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nS@BM\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nPBSB\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nPCAS\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nPASC\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nLC@S\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nSAAN\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nS@CM\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nAASN\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nBCRS\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nSCAP\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nPARB\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nSBCN\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nAQBR\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nRCRR\"\n },\n \"output\": {\n \"stdout\": \"Yes\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nBBQR\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nPSBB\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nBQBS\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nSAAM\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nDRRR\"\n },\n \"output\": {\n \"stdout\": \"Yes\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nS?DM\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nS?CM\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nSABP\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nRRCR\"\n },\n \"output\": {\n \"stdout\": \"Yes\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nSDAO\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nCASP\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nSC?N\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nMBAS\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nSC@M\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nAQBS\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nSBDO\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nBPCS\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4\\nAQBQ\"\n },\n \"output\": {\n \"stdout\": \"No\\n\"\n }\n }\n]","isConversational":false},"labels":{"kind":"string","value":"{\n \"tags\": [],\n \"title\": \"p03080 ExaWizards 2019 - Red or Blue\"\n}"},"canonical_solution":{"kind":"string","value":"{\n \"cpp\": \"#include <iostream>\\nusing namespace std;\\nint main()\\n{\\n\\tint n,r=0,b=0;string s;\\n\\tcin>>n>>s;\\n\\tfor (int i=0;i<s.size();i++)\\n\\t{\\n\\t\\tif (s[i]=='R') {r++;}\\n\\t\\telse {b++;}\\n\\t}\\n\\tif (r>b) {cout<<\\\"Yes\\\\n\\\";}\\n\\telse {cout<<\\\"No\\\\n\\\";}\\n\\treturn 0;\\n}\",\n \"java\": \"\\nimport java.util.*;\\n\\npublic class Main {\\n\\n public static void main(String[] args) {\\n Scanner sc = new Scanner(System.in);\\n int N = sc.nextInt();\\n String s = sc.next();\\n\\n int red = 0;\\n int blue = 0;\\n for (char si : s.toCharArray()) {\\n if (si == 'R') {\\n red += 1;\\n } else {\\n blue += 1;\\n }\\n }\\n\\n if (red > blue) {\\n System.out.println(\\\"Yes\\\");\\n } else {\\n System.out.println(\\\"No\\\");\\n }\\n }\\n\\n}\\n\",\n \"python\": \"N = int(input())\\ns = input()\\nif s.count('R') * 2 > N:\\n print('Yes')\\nelse:\\n print('No')\"\n}"}}},{"rowIdx":498,"cells":{"id":{"kind":"string","value":"p03225 Tenka1 Programmer Contest - Equilateral"},"content":{"kind":"string","value":"There are some coins in the xy-plane. The positions of the coins are represented by a grid of characters with H rows and W columns. If the character at the i-th row and j-th column, s_{ij}, is `#`, there is one coin at point (i,j); if that character is `.`, there is no coin at point (i,j). There are no other coins in the xy-plane.\n\nThere is no coin at point (x,y) where 1\\leq i\\leq H,1\\leq j\\leq W does not hold. There is also no coin at point (x,y) where x or y (or both) is not an integer. Additionally, two or more coins never exist at the same point.\n\nFind the number of triples of different coins that satisfy the following condition:\n\n* Choosing any two of the three coins would result in the same Manhattan distance between the points where they exist.\n\n\n\nHere, the Manhattan distance between points (x,y) and (x',y') is |x-x'|+|y-y'|. Two triples are considered the same if the only difference between them is the order of the coins.\n\nConstraints\n\n* 1 \\leq H,W \\leq 300\n* s_{ij} is `#` or `.`.\n\nInput\n\nInput is given from Standard Input in the following format:\n\n\nH W\ns_{11}...s_{1W}\n:\ns_{H1}...s_{HW}\n\n\nOutput\n\nPrint the number of triples that satisfy the condition.\n\nExamples\n\nInput\n\n5 4\n#.##\n.##.\n#...\n..##\n...#\n\n\nOutput\n\n3\n\n\nInput\n\n5 4\n.##\n.##.\n...\n..##\n...#\n\n\nOutput\n\n3\n\n\nInput\n\n13 27\n......#.........#.......#..\n...#.....###..\n..............#####...##...\n...#######......#...#######\n...#.....#.....###...#...#.\n...#######....#.#.#.#.###.#\n..............#.#.#...#.#..\n.#.#.#...###..\n...........#...#...#######\n..#######..#...#...#.....#\n..#.....#..#...#...#.###.#\n..#######..#...#...#.#.#.#\n..........##...#...#.#####\n\n\nOutput\n\n870"},"test":{"kind":"list like","value":[{"input":{"stdin":"5 4\n#.##\n.##.\n#...\n..##\n...#"},"output":{"stdout":"3"}},{"input":{"stdin":"13 27\n......#.........#.......#..\n...#.....###..\n..............#####...##...\n...#######......#...#######\n...#.....#.....###...#...#.\n...#######....#.#.#.#.###.#\n..............#.#.#...#.#..\n.#.#.#...###..\n...........#...#...#######\n..#######..#...#...#.....#\n..#.....#..#...#...#.###.#\n..#######..#...#...#.#.#.#\n..........##...#...#.#####"},"output":{"stdout":"870"}},{"input":{"stdin":"5 4\n.##\n.##.\n...\n..##\n...#"},"output":{"stdout":"3"}},{"input":{"stdin":"5 8\n#$.#\n-$#.\n#-..\n..##\n...#"},"output":{"stdout":"0\n"}},{"input":{"stdin":"13 30\n../..-#...-.....#......-#..\n...#.....###..\n...\"#...#####-......./.....\n...######.....#.#...#######\n...#.....#.....###...#-..#.\n#.###.#.#.#.\"....#######...\n......../.....#.#.#...#.#..\n.#.#.#./.#$#..\n#######...#...#...../../..\n..####.##..#...#..##.....#\n..#/....#..#...#...#.###.#\n..#######..#...#./.#.#.#.#\n..../.....##...#...#.#####"},"output":{"stdout":"442\n"}},{"input":{"stdin":"3 6\n-##\n.$#.\n0.4364069664817982\n##..\n#/./"},"output":{"stdout":"0\n"}},{"input":{"stdin":"2 2\n-##\n.#$.\n.0-\n##..\n#..."},"output":{"stdout":"0\n"}},{"input":{"stdin":"13 30\n../...#...-.....#......-#..\n...#.....###..\n...\"#...#####-......./.....\n...######.....#.#...#######\n...#.....#.....###...#-..#.\n#.###.#.#.#.#....#######...\n......../.....#.#.#...#.#..\n.#.#.#...#$#..\n#######...#...#...../../..\n..#######..#...#...#.....#\n#.###.#...#...#..#.....#..\n..#######..#...#...#.#.#.#\n..........##...#...#.#####"},"output":{"stdout":"460\n"}},{"input":{"stdin":"13 18\n......#...-.....#.......#..\n...#.....###..\n..............#####...##...\n...#######......#...#######\n...#.....#.....###...#...#.\n...#######....#.#.#.#.###.#\n..............#.#.#...#.#..\n.#.#.#...###..\n...........#...#./.#######\n..#######..#...#...#.....#\n..#.....#..#...#...#.###.#\n..#######..#...#...#.#.#.#\n..........##...#...#.#####"},"output":{"stdout":"187\n"}},{"input":{"stdin":"21 0\n#/$#\n.##-\n#-./\n..$#\n#./."},"output":{"stdout":"0\n"}},{"input":{"stdin":"10 4\n.##\n.##.\n...\n..##\n...#"},"output":{"stdout":"0\n"}},{"input":{"stdin":"5 0\n#$.#\n-$#.\n#-..\n##..\n...#"},"output":{"stdout":"0\n"}},{"input":{"stdin":"2 6\n-##\n.#$.\n./-\n./##\n#..."},"output":{"stdout":"0\n"}},{"input":{"stdin":"11 -1\n#/$#\n-$#.\n#-./\n#$..\n#../"},"output":{"stdout":"0\n"}},{"input":{"stdin":"13 30\n......#...-.....#.......#..\n...#.....###..\n..............#####...#\"...\n...#######......#...#######\n...#.....#.....###...#-..#.\n...#######....#.#.#.#.###.#\n..............#.#.#...#.#..\n.#.#.#...###..\n...../.....#...#./.#######\n..#######..#...#...#.....#\n..#.....#..#...#...#.###.#\n..#######..#...#...#.#.#.#\n..........##...#...#.#####"},"output":{"stdout":"565\n"}},{"input":{"stdin":"9 30\n......#...-.....#.......#..\n...#.....###..\n..............#####...#\"...\n...######.....#.#...#######\n...#.....#.....###...#-..#.\n...#######....#.#.#.#.###.#\n......../.....#.#.#...#.#..\n.#.#.#...###..\n#######./.#...#...../.....\n..#######..#...#...#.....#\n#.###.#...#...#..#.....#..\n..#######..#...#...#.#.#.#\n..........##...#...#.#####"},"output":{"stdout":"159\n"}},{"input":{"stdin":"11 -1\n#/$#\n-##.\n#-./\n..$#\n#.//"},"output":{"stdout":"0\n"}},{"input":{"stdin":"13 27\n......#.........#.......#..\n...#.....###..\n..............#####...##...\n...#######......#...#######\n...#.....#.....###...#...#.\n...#######....#.#.#.#.###.#\n..............#.#.#...#.#..\n.#.#.#...###..\n...........#...#./.#######\n..#######..#...#...#.....#\n..#.....#..#...#...#.###.#\n..#######..#...#...#.#.#.#\n..........##...#...#.#####"},"output":{"stdout":"583\n"}},{"input":{"stdin":"13 30\n......#...-.....#.......#..\n...#.....###..\n..............#####...#\"...\n...#######......#...#######\n...#.....#.....###...#-..#.\n...#######....#.#.#.#.###.#\n..............#.#.#...#.#..\n.#.#.#...###..\n...........#...#./.#######\n..#######..#...#...#.....#\n..#.....#..#...#...#.###.#\n..#######..#...#...#.#.#.#\n..........##...#...#.#####"},"output":{"stdout":"565\n"}},{"input":{"stdin":"5 8\n#$.#\n-$#.\n#-..\n##..\n...#"},"output":{"stdout":"1\n"}},{"input":{"stdin":"3 2\n##-\n.#$.\n.0-\n##..\n#..."},"output":{"stdout":"0\n"}},{"input":{"stdin":"2 6\n##.\n.##.\n..-\n./##\n#..."},"output":{"stdout":"0\n"}},{"input":{"stdin":"13 18\n......#.........#.......#..\n...#.....###..\n..............#####...##...\n...#######......#...#######\n...#.....#.....###...#...#.\n...#######....#.#.#.#.###.#\n..............#.#.#...#.#..\n.#.#.#...###..\n...........#...#./.#######\n..#######..#...#...#.....#\n..#.....#..#...#...#.###.#\n..#######..#...#...#.#.#.#\n..........##...#...#.#####"},"output":{"stdout":"187\n"}},{"input":{"stdin":"13 30\n../...#...-.....#......-#..\n...#.....###..\n...\"#...#####-......./.....\n...######.....#.#...#######\n...#.....#.....###...#-..#.\n#.###.#.#.#.#....#######...\n......../.....#.#.#...#.#..\n.#.#.#...#$#..\n#######...#...#...../../..\n..####.##..#...#..##.....#\n#.###.#...#...#..#.....#..\n..#######..#...#...#.#.#.#\n..........##...#...#.#####"},"output":{"stdout":"461\n"}},{"input":{"stdin":"5 8\n#.$#\n-$#.\n..-#\n..##\n...#"},"output":{"stdout":"3\n"}},{"input":{"stdin":"3 4\n##.\n.##.\n..-\n./##\n...#"},"output":{"stdout":"0\n"}},{"input":{"stdin":"13 25\n../..-#...-.....#......-#..\n...#.....###..\n...\"#...#####-......./.....\n...######.....#.#...#######\n...#.....#.....###...#-..#.\n#.###.#.#.#.\"....#######...\n......../.....#.#.#...#.#..\n.#.#.#./.#$#..\n#######...#...#...../../..\n..####.##..#...#..##.....#\n..#/....#..#...#...#.###.#\n..#######..#...#./.#.#.#.#\n..../.....##...#...#.#####"},"output":{"stdout":"398\n"}},{"input":{"stdin":"9 30\n../...#...-.....#......-#..\n...#.....###..\n.............-#####...#\"...\n...######.....#.#...#######\n...#.....#.....###...#-..#.\n...#######....#.#.#.#.###.#\n......../.....#.#.#...#.#..\n.#.#.#...###..\n#######./.#...#...../.....\n..#######..#...#...#.....#\n#.###.#...#...#..#.....#..\n..#######..#...#...#.#.#.#\n..........##...#...#.#####"},"output":{"stdout":"159\n"}},{"input":{"stdin":"11 0\n#/$#\n.##-\n#-./\n..$#\n#.//"},"output":{"stdout":"0\n"}},{"input":{"stdin":"9 30\n......#...-.....#.......#..\n...#.....###..\n..............#####...#\"...\n...#######......#...#######\n...#.....#.....###...#-..#.\n...#######....#.#.#.#.###.#\n......../.....#.#.#...#.#..\n.#.#.#...###..\n#######./.#...#...../.....\n..#######..#...#...#.....#\n#.###.#...#...#..#.....#..\n..#######..#...#...#.#.#.#\n..........##...#...#.#####"},"output":{"stdout":"157\n"}},{"input":{"stdin":"2 6\n.##\n.#$.\n./-\n./##\n#..."},"output":{"stdout":"0\n"}},{"input":{"stdin":"3 4\n-##\n.$#.\n.0-\n##..\n#..."},"output":{"stdout":"0\n"}},{"input":{"stdin":"21 0\n#/$#\n.##-\n#/.-\n..$#\n#./."},"output":{"stdout":"0\n"}},{"input":{"stdin":"3 2\n-##\n.$#.\n.0-\n##..\n#..."},"output":{"stdout":"0\n"}},{"input":{"stdin":"5 6\n#.##\n.##.\n#...\n..##\n...#"},"output":{"stdout":"3\n"}},{"input":{"stdin":"2 11\n-##\n.#$.\n.0-\n##/.\n#..."},"output":{"stdout":"0\n"}},{"input":{"stdin":"11 -1\n#/$#\n-$#.\n#-./\n#$..\n/..#"},"output":{"stdout":"0\n"}},{"input":{"stdin":"3 6\n-##\n.$#.\n-0.\n##..\n#/.."},"output":{"stdout":"0\n"}},{"input":{"stdin":"9 30\n../...#...-.....#......-#..\n...#.....###..\n.............-#####...#\"...\n...######.....#.#...#######\n...#.....#.....###...#-..#.\n#.###.#.#.#.#....#######...\n......../.....#.#.#...#.#..\n.#.#.#...###..\n#######...#...#...../../..\n..#######..#...#...#.....#\n#.###.#...#...#..#.....#..\n..#######..#...#...#.#.#.#\n..........##...#...#.#####"},"output":{"stdout":"138\n"}},{"input":{"stdin":"2 11\n-##\n.#$.\n.0-\n##..\n#..."},"output":{"stdout":"0\n"}},{"input":{"stdin":"13 30\n../...#...-.....#......-#..\n...#.....###..\n.............-#####...#\"...\n...######.....#.#...#######\n...#.....#.....###...#-..#.\n#.###.#.#.#.#....#######...\n......../.....#.#.#...#.#..\n.#.#.#...###..\n#######...#...#...../../..\n..#######..#...#...#.....#\n#.###.#...#...#..#.....#..\n..#######..#...#...#.#.#.#\n..........##...#...#.#####"},"output":{"stdout":"481\n"}},{"input":{"stdin":"35 0\n#/$#\n.##-\n#/.-\n..$#\n#./."},"output":{"stdout":"0\n"}},{"input":{"stdin":"11 0\n#/$#\n.##-\n#-./\n..$#\n#./."},"output":{"stdout":"0\n"}},{"input":{"stdin":"3 2\n##-\n.$#.\n.0-\n##..\n#..."},"output":{"stdout":"0\n"}},{"input":{"stdin":"3 6\n-##\n.$#.\n-0.\n##..\n#/./"},"output":{"stdout":"0\n"}},{"input":{"stdin":"14 4\n.##\n.##.\n..-\n./##\n...#"},"output":{"stdout":"0\n"}},{"input":{"stdin":"6 -1\n#/$#\n-$#.\n#-..\n#$..\n/..#"},"output":{"stdout":"0\n"}},{"input":{"stdin":"3 6\n-##\n.$#.\n.0-\n##..\n#..."},"output":{"stdout":"0\n"}},{"input":{"stdin":"13 30\n../...#...-.....#......-#..\n...#.....###..\n...\"#...#####-......./.....\n...######.....#.#...#######\n...#.....#.....###...#-..#.\n#.###.#.#.#.#....#######...\n......../.....#.#.#...#.#..\n.#.#.#...#$#..\n#######...#...#...../../..\n..####.##..#...#..##.....#\n#.###.#...#...#..#.....#..\n..#######..#...#./.#.#.#.#\n..../.....##...#...#.#####"},"output":{"stdout":"461\n"}},{"input":{"stdin":"2 6\n.##\n.##.\n..-\n./##\n#..."},"output":{"stdout":"0\n"}}],"string":"[\n {\n \"input\": {\n \"stdin\": \"5 4\\n#.##\\n.##.\\n#...\\n..##\\n...#\"\n },\n \"output\": {\n \"stdout\": \"3\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"13 27\\n......#.........#.......#..\\n...#.....###..\\n..............#####...##...\\n...#######......#...#######\\n...#.....#.....###...#...#.\\n...#######....#.#.#.#.###.#\\n..............#.#.#...#.#..\\n.#.#.#...###..\\n...........#...#...#######\\n..#######..#...#...#.....#\\n..#.....#..#...#...#.###.#\\n..#######..#...#...#.#.#.#\\n..........##...#...#.#####\"\n },\n \"output\": {\n \"stdout\": \"870\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5 4\\n.##\\n.##.\\n...\\n..##\\n...#\"\n },\n \"output\": {\n \"stdout\": \"3\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5 8\\n#$.#\\n-$#.\\n#-..\\n..##\\n...#\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"13 30\\n../..-#...-.....#......-#..\\n...#.....###..\\n...\\\"#...#####-......./.....\\n...######.....#.#...#######\\n...#.....#.....###...#-..#.\\n#.###.#.#.#.\\\"....#######...\\n......../.....#.#.#...#.#..\\n.#.#.#./.#$#..\\n#######...#...#...../../..\\n..####.##..#...#..##.....#\\n..#/....#..#...#...#.###.#\\n..#######..#...#./.#.#.#.#\\n..../.....##...#...#.#####\"\n },\n \"output\": {\n \"stdout\": \"442\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"3 6\\n-##\\n.$#.\\n0.4364069664817982\\n##..\\n#/./\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"2 2\\n-##\\n.#$.\\n.0-\\n##..\\n#...\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"13 30\\n../...#...-.....#......-#..\\n...#.....###..\\n...\\\"#...#####-......./.....\\n...######.....#.#...#######\\n...#.....#.....###...#-..#.\\n#.###.#.#.#.#....#######...\\n......../.....#.#.#...#.#..\\n.#.#.#...#$#..\\n#######...#...#...../../..\\n..#######..#...#...#.....#\\n#.###.#...#...#..#.....#..\\n..#######..#...#...#.#.#.#\\n..........##...#...#.#####\"\n },\n \"output\": {\n \"stdout\": \"460\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"13 18\\n......#...-.....#.......#..\\n...#.....###..\\n..............#####...##...\\n...#######......#...#######\\n...#.....#.....###...#...#.\\n...#######....#.#.#.#.###.#\\n..............#.#.#...#.#..\\n.#.#.#...###..\\n...........#...#./.#######\\n..#######..#...#...#.....#\\n..#.....#..#...#...#.###.#\\n..#######..#...#...#.#.#.#\\n..........##...#...#.#####\"\n },\n \"output\": {\n \"stdout\": \"187\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"21 0\\n#/$#\\n.##-\\n#-./\\n..$#\\n#./.\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"10 4\\n.##\\n.##.\\n...\\n..##\\n...#\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5 0\\n#$.#\\n-$#.\\n#-..\\n##..\\n...#\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"2 6\\n-##\\n.#$.\\n./-\\n./##\\n#...\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"11 -1\\n#/$#\\n-$#.\\n#-./\\n#$..\\n#../\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"13 30\\n......#...-.....#.......#..\\n...#.....###..\\n..............#####...#\\\"...\\n...#######......#...#######\\n...#.....#.....###...#-..#.\\n...#######....#.#.#.#.###.#\\n..............#.#.#...#.#..\\n.#.#.#...###..\\n...../.....#...#./.#######\\n..#######..#...#...#.....#\\n..#.....#..#...#...#.###.#\\n..#######..#...#...#.#.#.#\\n..........##...#...#.#####\"\n },\n \"output\": {\n \"stdout\": \"565\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"9 30\\n......#...-.....#.......#..\\n...#.....###..\\n..............#####...#\\\"...\\n...######.....#.#...#######\\n...#.....#.....###...#-..#.\\n...#######....#.#.#.#.###.#\\n......../.....#.#.#...#.#..\\n.#.#.#...###..\\n#######./.#...#...../.....\\n..#######..#...#...#.....#\\n#.###.#...#...#..#.....#..\\n..#######..#...#...#.#.#.#\\n..........##...#...#.#####\"\n },\n \"output\": {\n \"stdout\": \"159\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"11 -1\\n#/$#\\n-##.\\n#-./\\n..$#\\n#.//\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"13 27\\n......#.........#.......#..\\n...#.....###..\\n..............#####...##...\\n...#######......#...#######\\n...#.....#.....###...#...#.\\n...#######....#.#.#.#.###.#\\n..............#.#.#...#.#..\\n.#.#.#...###..\\n...........#...#./.#######\\n..#######..#...#...#.....#\\n..#.....#..#...#...#.###.#\\n..#######..#...#...#.#.#.#\\n..........##...#...#.#####\"\n },\n \"output\": {\n \"stdout\": \"583\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"13 30\\n......#...-.....#.......#..\\n...#.....###..\\n..............#####...#\\\"...\\n...#######......#...#######\\n...#.....#.....###...#-..#.\\n...#######....#.#.#.#.###.#\\n..............#.#.#...#.#..\\n.#.#.#...###..\\n...........#...#./.#######\\n..#######..#...#...#.....#\\n..#.....#..#...#...#.###.#\\n..#######..#...#...#.#.#.#\\n..........##...#...#.#####\"\n },\n \"output\": {\n \"stdout\": \"565\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5 8\\n#$.#\\n-$#.\\n#-..\\n##..\\n...#\"\n },\n \"output\": {\n \"stdout\": \"1\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"3 2\\n##-\\n.#$.\\n.0-\\n##..\\n#...\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"2 6\\n##.\\n.##.\\n..-\\n./##\\n#...\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"13 18\\n......#.........#.......#..\\n...#.....###..\\n..............#####...##...\\n...#######......#...#######\\n...#.....#.....###...#...#.\\n...#######....#.#.#.#.###.#\\n..............#.#.#...#.#..\\n.#.#.#...###..\\n...........#...#./.#######\\n..#######..#...#...#.....#\\n..#.....#..#...#...#.###.#\\n..#######..#...#...#.#.#.#\\n..........##...#...#.#####\"\n },\n \"output\": {\n \"stdout\": \"187\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"13 30\\n../...#...-.....#......-#..\\n...#.....###..\\n...\\\"#...#####-......./.....\\n...######.....#.#...#######\\n...#.....#.....###...#-..#.\\n#.###.#.#.#.#....#######...\\n......../.....#.#.#...#.#..\\n.#.#.#...#$#..\\n#######...#...#...../../..\\n..####.##..#...#..##.....#\\n#.###.#...#...#..#.....#..\\n..#######..#...#...#.#.#.#\\n..........##...#...#.#####\"\n },\n \"output\": {\n \"stdout\": \"461\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5 8\\n#.$#\\n-$#.\\n..-#\\n..##\\n...#\"\n },\n \"output\": {\n \"stdout\": \"3\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"3 4\\n##.\\n.##.\\n..-\\n./##\\n...#\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"13 25\\n../..-#...-.....#......-#..\\n...#.....###..\\n...\\\"#...#####-......./.....\\n...######.....#.#...#######\\n...#.....#.....###...#-..#.\\n#.###.#.#.#.\\\"....#######...\\n......../.....#.#.#...#.#..\\n.#.#.#./.#$#..\\n#######...#...#...../../..\\n..####.##..#...#..##.....#\\n..#/....#..#...#...#.###.#\\n..#######..#...#./.#.#.#.#\\n..../.....##...#...#.#####\"\n },\n \"output\": {\n \"stdout\": \"398\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"9 30\\n../...#...-.....#......-#..\\n...#.....###..\\n.............-#####...#\\\"...\\n...######.....#.#...#######\\n...#.....#.....###...#-..#.\\n...#######....#.#.#.#.###.#\\n......../.....#.#.#...#.#..\\n.#.#.#...###..\\n#######./.#...#...../.....\\n..#######..#...#...#.....#\\n#.###.#...#...#..#.....#..\\n..#######..#...#...#.#.#.#\\n..........##...#...#.#####\"\n },\n \"output\": {\n \"stdout\": \"159\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"11 0\\n#/$#\\n.##-\\n#-./\\n..$#\\n#.//\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"9 30\\n......#...-.....#.......#..\\n...#.....###..\\n..............#####...#\\\"...\\n...#######......#...#######\\n...#.....#.....###...#-..#.\\n...#######....#.#.#.#.###.#\\n......../.....#.#.#...#.#..\\n.#.#.#...###..\\n#######./.#...#...../.....\\n..#######..#...#...#.....#\\n#.###.#...#...#..#.....#..\\n..#######..#...#...#.#.#.#\\n..........##...#...#.#####\"\n },\n \"output\": {\n \"stdout\": \"157\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"2 6\\n.##\\n.#$.\\n./-\\n./##\\n#...\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"3 4\\n-##\\n.$#.\\n.0-\\n##..\\n#...\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"21 0\\n#/$#\\n.##-\\n#/.-\\n..$#\\n#./.\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"3 2\\n-##\\n.$#.\\n.0-\\n##..\\n#...\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"5 6\\n#.##\\n.##.\\n#...\\n..##\\n...#\"\n },\n \"output\": {\n \"stdout\": \"3\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"2 11\\n-##\\n.#$.\\n.0-\\n##/.\\n#...\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"11 -1\\n#/$#\\n-$#.\\n#-./\\n#$..\\n/..#\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"3 6\\n-##\\n.$#.\\n-0.\\n##..\\n#/..\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"9 30\\n../...#...-.....#......-#..\\n...#.....###..\\n.............-#####...#\\\"...\\n...######.....#.#...#######\\n...#.....#.....###...#-..#.\\n#.###.#.#.#.#....#######...\\n......../.....#.#.#...#.#..\\n.#.#.#...###..\\n#######...#...#...../../..\\n..#######..#...#...#.....#\\n#.###.#...#...#..#.....#..\\n..#######..#...#...#.#.#.#\\n..........##...#...#.#####\"\n },\n \"output\": {\n \"stdout\": \"138\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"2 11\\n-##\\n.#$.\\n.0-\\n##..\\n#...\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"13 30\\n../...#...-.....#......-#..\\n...#.....###..\\n.............-#####...#\\\"...\\n...######.....#.#...#######\\n...#.....#.....###...#-..#.\\n#.###.#.#.#.#....#######...\\n......../.....#.#.#...#.#..\\n.#.#.#...###..\\n#######...#...#...../../..\\n..#######..#...#...#.....#\\n#.###.#...#...#..#.....#..\\n..#######..#...#...#.#.#.#\\n..........##...#...#.#####\"\n },\n \"output\": {\n \"stdout\": \"481\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"35 0\\n#/$#\\n.##-\\n#/.-\\n..$#\\n#./.\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"11 0\\n#/$#\\n.##-\\n#-./\\n..$#\\n#./.\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"3 2\\n##-\\n.$#.\\n.0-\\n##..\\n#...\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"3 6\\n-##\\n.$#.\\n-0.\\n##..\\n#/./\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"14 4\\n.##\\n.##.\\n..-\\n./##\\n...#\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"6 -1\\n#/$#\\n-$#.\\n#-..\\n#$..\\n/..#\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"3 6\\n-##\\n.$#.\\n.0-\\n##..\\n#...\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"13 30\\n../...#...-.....#......-#..\\n...#.....###..\\n...\\\"#...#####-......./.....\\n...######.....#.#...#######\\n...#.....#.....###...#-..#.\\n#.###.#.#.#.#....#######...\\n......../.....#.#.#...#.#..\\n.#.#.#...#$#..\\n#######...#...#...../../..\\n..####.##..#...#..##.....#\\n#.###.#...#...#..#.....#..\\n..#######..#...#./.#.#.#.#\\n..../.....##...#...#.#####\"\n },\n \"output\": {\n \"stdout\": \"461\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"2 6\\n.##\\n.##.\\n..-\\n./##\\n#...\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n }\n]","isConversational":false},"labels":{"kind":"string","value":"{\n \"tags\": [],\n \"title\": \"p03225 Tenka1 Programmer Contest - Equilateral\"\n}"},"canonical_solution":{"kind":"string","value":"{\n \"cpp\": \"#include <algorithm>\\n#include <iostream>\\n#include <cstring>\\n#include <cstdlib>\\n#include <utility>\\n#include <cstdio>\\n#include <vector>\\n#include <string>\\n#include <queue>\\n#include <stack>\\n#include <cmath>\\n#include <set>\\n#include <map>\\n#define my_abs(x) ((x) < 0 ? -(x) : (x))\\n#define mp std::make_pair\\n#define pb push_back\\ntypedef long long ll;\\nint row[605][605], col[605][605], app[605];\\nbool arr[605][605];\\nchar str[605];\\nint main()\\n{\\n\\t// freopen(\\\"TK1-E.in\\\", \\\"r\\\", stdin);\\n\\tint n, m;\\n\\tscanf(\\\"%d%d\\\", &n, &m);\\n\\tfor (int i = 0; i < n; i++)\\n\\t{\\n\\t\\tscanf(\\\"%s\\\", str);\\n\\t\\tfor (int j = 0; j < m; j++)\\n\\t\\t{\\n\\t\\t\\tif (str[j] == '#')\\n\\t\\t\\t\\tarr[i + j][i - j + m] = true;\\n\\t\\t}\\n\\t}\\n\\tn += m;\\n\\tfor (int i = 0; i < n; i++)\\n\\t{\\n\\t\\tfor (int j = 0; j < n; j++)\\n\\t\\t{\\n\\t\\t\\trow[i][j] = (j ? row[i][j - 1] : 0) + arr[i][j];\\n\\t\\t\\tcol[i][j] = (i ? col[i - 1][j] : 0) + arr[i][j];\\n\\t\\t}\\n\\t}\\n\\tll ans = 0;\\n\\tfor (int i = 0; i < n; i++)\\n\\t{\\n\\t\\tfor (int j = 0; j < n; j++)\\n\\t\\t{\\n\\t\\t\\tif (!arr[i][j])\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tfor (int k = j + 1; k < n; k++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (!arr[i][k])\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\tint d = k - j;\\n\\t\\t\\t\\tif (i + d < n)\\n\\t\\t\\t\\t\\tans += row[i + d][k - 1] - row[i + d][j];\\n\\t\\t\\t\\tif (i - d >= 0)\\n\\t\\t\\t\\t\\tans += row[i - d][k - 1] - row[i - d][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i < n; i++)\\n\\t{\\n\\t\\tfor (int j = 0; j < n; j++)\\n\\t\\t{\\n\\t\\t\\tif (!arr[i][j])\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tfor (int k = i + 1; k < n; k++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (!arr[k][j])\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\tint d = k - i;\\n\\t\\t\\t\\tif (j + d < n)\\n\\t\\t\\t\\t\\tans += col[k - 1][j + d] - col[i][j + d];\\n\\t\\t\\t\\tif (j - d >= 0)\\n\\t\\t\\t\\t\\tans += col[k - 1][j - d] - col[i][j - d];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i < n; i++)\\n\\t{\\n\\t\\tfor (int j = 0; j < n; j++)\\n\\t\\t{\\n\\t\\t\\tif (!arr[i][j])\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tmemset(app, 0, sizeof(app));\\n\\t\\t\\tfor (int k = 0; k < n; k++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (j == k || !arr[i][k])\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\tapp[my_abs(k - j)]++;\\n\\t\\t\\t}\\n\\t\\t\\tfor (int k = 0; k < n; k++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (i == k || !arr[k][j])\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\tans += app[my_abs(k - i)];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"%lld\\\\n\\\", ans);\\n\\treturn 0;\\n}\\n\",\n \"java\": \"import java.io.IOException;\\nimport java.io.InputStream;\\nimport java.io.OutputStream;\\nimport java.lang.reflect.Field;\\nimport java.util.Arrays;\\nimport java.util.NoSuchElementException;\\nimport java.util.function.IntUnaryOperator;\\nimport java.util.function.LongUnaryOperator;\\n\\n\\npublic class Main {\\n public static void main(String[] args) throws Exception {\\n Field f = System.out.getClass().getDeclaredField(\\\"autoFlush\\\");\\n f.setAccessible(true);\\n f.set(System.out, false);\\n execute(System.in, System.out);\\n }\\n\\n public static void execute(InputStream in, OutputStream out) {\\n ExtendedScanner s = new ExtendedScanner(System.in);\\n Out o = new Out(System.out);\\n solve(s, o);\\n o.flush();\\n o.close();\\n }\\n\\n public static void solve(ExtendedScanner sc, Out out) {\\n int h = sc.nextInt();\\n int w = sc.nextInt();\\n char[][] s = sc.charArrays(h, w);\\n int m = h + w - 1;\\n int[][] f = new int[m][m];\\n for (int r = 0; r < h; r++) {\\n for (int c = 0; c < w; c++) {\\n int u = c + r;\\n int v = c - r;\\n f[u][v + h - 1] = s[r][c] == '#' ? 1 : 0;\\n }\\n }\\n int[][] sv = new int[m][m + 1];\\n for (int u = 0; u < m; u++) {\\n for (int v = 1; v <= m; v++) {\\n sv[u][v] = sv[u][v - 1] + f[u][v - 1];\\n }\\n }\\n int[][] su = new int[m + 1][m];\\n for (int u = 1; u <= m; u++) {\\n for (int v = 0; v < m; v++) {\\n su[u][v] = su[u - 1][v] + f[u - 1][v];\\n }\\n }\\n int cnt = 0;\\n for (int u = 0; u < m; u++) {\\n for (int vh = 1; vh < m; vh++) {\\n for (int vl = 0; vl < vh; vl++) {\\n if (f[u][vh] == 0 || f[u][vl] == 0) continue;\\n int d = vh - vl;\\n if (u - d >= 0) cnt += sv[u - d][vh + 1] - sv[u - d][vl];\\n if (u + d < m) cnt += sv[u + d][vh + 1] - sv[u + d][vl];\\n }\\n }\\n }\\n for (int v = 0; v < m; v++) {\\n for (int uh = 1; uh < m; uh++) {\\n for (int ul = 0; ul < uh; ul++) {\\n if (f[uh][v] == 0 || f[ul][v] == 0) continue;\\n int d = uh - ul;\\n if (v - d >= 0) cnt += su[uh][v - d] - su[ul + 1][v - d];\\n if (v + d < m) cnt += su[uh][v + d] - su[ul + 1][v + d];\\n }\\n }\\n }\\n out.write(cnt).write('\\\\n');\\n }\\n}\\n\\n\\n/**\\n * @author https://atcoder.jp/users/suisen\\n */\\nclass BasicScanner {\\n private final InputStream in;\\n private final byte[] buf = new byte[1024];\\n private int ptr = 0;\\n private int buflen = 0;\\n public BasicScanner(InputStream in) {this.in = in;}\\n private boolean hasNextByte() {\\n if (ptr < buflen) return true;\\n ptr = 0;\\n try {buflen = in.read(buf);}\\n catch (final IOException e) {e.printStackTrace();}\\n return buflen > 0;\\n }\\n private int readByte() {return hasNextByte() ? buf[ptr++] : -1;}\\n public boolean hasNext() {\\n while (hasNextByte() && !(33 <= buf[ptr] && buf[ptr] <= 126)) ptr++;\\n return hasNextByte();\\n }\\n private StringBuilder nextSequence() {\\n if (!hasNext()) throw new NoSuchElementException();\\n final StringBuilder sb = new StringBuilder();\\n int b = readByte();\\n while (33 <= b && b <= 126) {sb.appendCodePoint(b); b = readByte();}\\n return sb;\\n }\\n public char nextChar() {\\n return (char) readByte();\\n }\\n public String next() {\\n return nextSequence().toString();\\n }\\n public String next(int len) {\\n return new String(nextChars(len));\\n }\\n public char[] nextChars() {\\n final StringBuilder sb = nextSequence();\\n int l = sb.length();\\n char[] dst = new char[l];\\n sb.getChars(0, l, dst, 0);\\n return dst;\\n }\\n public char[] nextChars(int len) {\\n if (!hasNext()) throw new NoSuchElementException();\\n char[] s = new char[len];\\n int i = 0;\\n int b = readByte();\\n while (33 <= b && b <= 126 && i < len) {s[i++] = (char) b; b = readByte();}\\n if (i != len) throw new NoSuchElementException(String.format(\\\"length %d is longer than the sequence.\\\", len));\\n return s;\\n }\\n public long nextLong() {\\n if (!hasNext()) throw new NoSuchElementException();\\n long n = 0;\\n boolean minus = false;\\n int b = readByte();\\n if (b == '-') {minus = true; b = readByte();}\\n if (b < '0' || '9' < b) throw new NumberFormatException();\\n while (true) {\\n if ('0' <= b && b <= '9') n = n * 10 + b - '0';\\n else if (b == -1 || !(33 <= b && b <= 126)) return minus ? -n : n;\\n else throw new NumberFormatException();\\n b = readByte();\\n }\\n }\\n public int nextInt() {return Math.toIntExact(nextLong());}\\n public double nextDouble() {return Double.parseDouble(next());}\\n}\\n\\n\\n/**\\n * @author https://atcoder.jp/users/suisen\\n */\\nclass Out {\\n private final OutputStream out;\\n private byte[] buf = new byte[1024];\\n private int ptr = 0;\\n private static final int AUTO_FLUSH_THRETHOLD = 1 << 17;\\n\\n public Out(OutputStream out) {\\n this.out = out;\\n }\\n\\n public void flush() {\\n try {\\n out.write(buf, 0, ptr);\\n out.flush();\\n ptr = 0;\\n } catch (IOException e) {e.printStackTrace();}\\n }\\n\\n public void close() {\\n try {out.close();} catch (IOException e) {e.printStackTrace();}\\n }\\n\\n public Out write(Object o) {\\n return write(o.toString());\\n }\\n\\n public Out write(String s) {\\n try {\\n Field strValueField = s.getClass().getDeclaredField(\\\"value\\\");\\n strValueField.setAccessible(true);\\n byte[] b = (byte[]) strValueField.get(s);\\n int l = s.length();\\n if (l > AUTO_FLUSH_THRETHOLD) {\\n flush();\\n int i = 0;\\n while (i + AUTO_FLUSH_THRETHOLD < l) {\\n out.write(b, i, AUTO_FLUSH_THRETHOLD);\\n out.flush();\\n i += AUTO_FLUSH_THRETHOLD;\\n }\\n ensureCapacity(l - i);\\n System.arraycopy(b, i, buf, 0, l - i);\\n ptr = l - i;\\n } else {\\n ensureCapacity(ptr + l);\\n System.arraycopy(b, 0, buf, ptr, l);\\n ptr += l;\\n }\\n } catch (Exception e) {e.printStackTrace();}\\n return this;\\n }\\n\\n public Out write(char[] c) {\\n int l = c.length;\\n if (l > AUTO_FLUSH_THRETHOLD) {\\n flush();\\n ensureCapacity(AUTO_FLUSH_THRETHOLD);\\n int i = 0;\\n while (i + AUTO_FLUSH_THRETHOLD < l) {\\n for (int j = 0; j < AUTO_FLUSH_THRETHOLD; j++) {\\n buf[ptr++] = (byte) c[i + j];\\n }\\n flush();\\n i += AUTO_FLUSH_THRETHOLD;\\n }\\n for (; i < l; i++) {\\n buf[ptr++] = (byte) c[i];\\n }\\n } else {\\n ensureCapacity(ptr + l);\\n for (char ch : c) buf[ptr++] = (byte) ch;\\n }\\n return this;\\n }\\n\\n public Out write(char c) {\\n ensureCapacity(ptr + 1);\\n buf[ptr++] = (byte) c;\\n return this;\\n }\\n\\n public Out write(byte b) {\\n ensureCapacity(ptr + 1);\\n buf[ptr++] = b;\\n return this;\\n }\\n\\n public Out write(int x) {\\n if (x == 0) {\\n ensureCapacity(ptr + 1);\\n buf[ptr++] = '0';\\n return this;\\n }\\n int d = stringSize(x);\\n ensureCapacity(ptr + d);\\n if (x < 0) {\\n buf[ptr++] = '-';\\n x = -x;\\n d--;\\n }\\n int j = ptr + d; \\n while (x > 0) {\\n buf[--j] = (byte) ('0' + (x % 10));\\n x /= 10;\\n }\\n ptr += d;\\n return this;\\n }\\n\\n public Out write(long x) {\\n if (x == 0) {\\n ensureCapacity(ptr + 1);\\n buf[ptr++] = '0';\\n return this;\\n }\\n int d = stringSize(x);\\n ensureCapacity(ptr + d);\\n if (x < 0) {\\n buf[ptr++] = '-';\\n x = -x;\\n d--;\\n }\\n int j = ptr + d; \\n while (x > 0) {\\n buf[--j] = (byte) ('0' + (x % 10));\\n x /= 10;\\n }\\n ptr += d;\\n return this;\\n }\\n\\n public Out write(double d) {\\n return write(Double.toString(d));\\n }\\n\\n private void ensureCapacity(int cap) {\\n if (cap > AUTO_FLUSH_THRETHOLD) {\\n flush();\\n }\\n if (cap >= buf.length) {\\n int newLength = buf.length;\\n while (newLength < cap) newLength <<= 1;\\n byte[] newBuf = new byte[newLength];\\n System.arraycopy(buf, 0, newBuf, 0, buf.length);\\n buf = newBuf;\\n }\\n }\\n private static int stringSize(long x) {\\n int d = 1;\\n if (x >= 0) {d = 0; x = -x;}\\n long p = -10;\\n for (int i = 1; i < 19; i++, p *= 10) if (x > p) return i + d;\\n return 19 + d;\\n }\\n private static int stringSize(int x) {\\n int d = 1;\\n if (x >= 0) {d = 0; x = -x;}\\n int p = -10;\\n for (int i = 1; i < 10; i++, p *= 10) if (x > p) return i + d;\\n return 10 + d;\\n }\\n}\\n\\n\\n/**\\n * @author https://atcoder.jp/users/suisen\\n */\\nfinal class ExtendedScanner extends BasicScanner {\\n public ExtendedScanner(InputStream in) {super(in);}\\n public int[] ints(final int n) {\\n final int[] a = new int[n];\\n Arrays.setAll(a, $ -> nextInt());\\n return a;\\n }\\n public int[] ints(final int n, final IntUnaryOperator f) {\\n final int[] a = new int[n];\\n Arrays.setAll(a, $ -> f.applyAsInt(nextInt()));\\n return a;\\n }\\n public int[][] ints(final int n, final int m) {\\n final int[][] a = new int[n][];\\n Arrays.setAll(a, $ -> ints(m));\\n return a;\\n }\\n public int[][] ints(final int n, final int m, final IntUnaryOperator f) {\\n final int[][] a = new int[n][];\\n Arrays.setAll(a, $ -> ints(m, f));\\n return a;\\n }\\n public long[] longs(final int n) {\\n final long[] a = new long[n];\\n Arrays.setAll(a, $ -> nextLong());\\n return a;\\n }\\n public long[] longs(final int n, final LongUnaryOperator f) {\\n final long[] a = new long[n];\\n Arrays.setAll(a, $ -> f.applyAsLong(nextLong()));\\n return a;\\n }\\n public long[][] longs(final int n, final int m) {\\n final long[][] a = new long[n][];\\n Arrays.setAll(a, $ -> longs(m));\\n return a;\\n }\\n public long[][] longs(final int n, final int m, final LongUnaryOperator f) {\\n final long[][] a = new long[n][];\\n Arrays.setAll(a, $ -> longs(m, f));\\n return a;\\n }\\n public char[][] charArrays(final int n) {\\n final char[][] c = new char[n][];\\n Arrays.setAll(c, $ -> nextChars());\\n return c;\\n }\\n public char[][] charArrays(final int n, final int m) {\\n final char[][] c = new char[n][];\\n Arrays.setAll(c, $ -> nextChars(m));\\n return c;\\n }\\n public double[] doubles(final int n) {\\n final double[] a = new double[n];\\n Arrays.setAll(a, $ -> nextDouble());\\n return a;\\n }\\n public double[][] doubles(final int n, final int m) {\\n final double[][] a = new double[n][];\\n Arrays.setAll(a, $ -> doubles(m));\\n return a;\\n }\\n public String[] strings(final int n) {\\n final String[] s = new String[n];\\n Arrays.setAll(s, $ -> next());\\n return s;\\n }\\n public String[] strings(final int n, final int m) {\\n final String[] s = new String[n];\\n Arrays.setAll(s, $ -> next(m));\\n return s;\\n }\\n}\\n\",\n \"python\": \"import itertools\\nimport sys\\nH, W = [int(i) for i in input().split(' ')]\\n\\ncross = [[0] * (H + W -1) for _ in range(H + W - 1)]\\nfor i, line in enumerate(sys.stdin):\\n for j, c in enumerate(line.strip()):\\n if c == \\\"#\\\":\\n cross[i+j][i-j+W-1] = 1\\n\\nacross = [[0] + list(itertools.accumulate(xs)) for xs in cross]\\nr_cross = [[xs[i] for xs in cross] for i in range(H + W - 1)]\\nacross2 = [[0] + list(itertools.accumulate(xs)) for xs in r_cross]\\n\\nr = 0\\nfor i in range(H+W-1):\\n for j in range(H+W-1):\\n if cross[i][j] != 1:\\n continue\\n for k in range(j+1, H+W-1):\\n if cross[i][k] == 1:\\n if i - (k-j) >= 0:\\n r += across[i - (k - j)][k+1] - across[i - (k - j)][j]\\n if i + (k-j) < H + W - 1:\\n r += across[i + (k - j)][k+1] - across[i + (k - j)][j]\\n\\nfor i in range(H+W-1):\\n for j in range(H+W-1):\\n if cross[j][i] != 1:\\n continue\\n for k in range(j+1, H+W-1):\\n if cross[k][i] == 1:\\n if i - (k-j) >= 0:\\n r += across2[i - (k - j)][k] - across2[i - (k - j)][j+1]\\n if i + (k-j) < H + W - 1:\\n r += across2[i + (k - j)][k] - across2[i + (k - j)][j+1]\\n\\nprint(r)\\n\"\n}"}}},{"rowIdx":499,"cells":{"id":{"kind":"string","value":"p03371 AtCoder Beginner Contest 095 - Half and Half"},"content":{"kind":"string","value":"\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-pizza\". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-pizza, B-pizza and AB-pizza are A yen, B yen and C yen (yen is the currency of Japan), respectively.\n\nNakahashi needs to prepare X A-pizzas and Y B-pizzas for a party tonight. He can only obtain these pizzas by directly buying A-pizzas and B-pizzas, or buying two AB-pizzas and then rearrange them into one A-pizza and one B-pizza. At least how much money does he need for this? It is fine to have more pizzas than necessary by rearranging pizzas.\n\nConstraints\n\n* 1 ≤ A, B, C ≤ 5000\n* 1 ≤ X, Y ≤ 10^5\n* All values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\n\nA B C X Y\n\n\nOutput\n\nPrint the minimum amount of money required to prepare X A-pizzas and Y B-pizzas.\n\nExamples\n\nInput\n\n1500 2000 1600 3 2\n\n\nOutput\n\n7900\n\n\nInput\n\n1500 2000 1900 3 2\n\n\nOutput\n\n8500\n\n\nInput\n\n1500 2000 500 90000 100000\n\n\nOutput\n\n100000000"},"test":{"kind":"list like","value":[{"input":{"stdin":"1500 2000 1600 3 2"},"output":{"stdout":"7900"}},{"input":{"stdin":"1500 2000 500 90000 100000"},"output":{"stdout":"100000000"}},{"input":{"stdin":"1500 2000 1900 3 2"},"output":{"stdout":"8500"}},{"input":{"stdin":"2595 290 1999 1 4"},"output":{"stdout":"3755\n"}},{"input":{"stdin":"1339 1142 1600 0 2"},"output":{"stdout":"2284\n"}},{"input":{"stdin":"97 1 25 1 14"},"output":{"stdout":"63\n"}},{"input":{"stdin":"1500 3132 752 90000 100000"},"output":{"stdout":"150400000\n"}},{"input":{"stdin":"778 1881 2830 5 3"},"output":{"stdout":"9533\n"}},{"input":{"stdin":"1297 2556 2383 5 3"},"output":{"stdout":"14153\n"}},{"input":{"stdin":"1339 290 1999 1 4"},"output":{"stdout":"2499\n"}},{"input":{"stdin":"1500 3495 1900 3 2"},"output":{"stdout":"9100\n"}},{"input":{"stdin":"97 2 26 1 17"},"output":{"stdout":"84\n"}},{"input":{"stdin":"1500 2000 2264 3 3"},"output":{"stdout":"10500\n"}},{"input":{"stdin":"1500 3132 574 90000 100000"},"output":{"stdout":"114800000\n"}},{"input":{"stdin":"778 1881 2830 5 0"},"output":{"stdout":"3890\n"}},{"input":{"stdin":"4369 106 2334 1 8"},"output":{"stdout":"5217\n"}},{"input":{"stdin":"2595 290 2334 1 2"},"output":{"stdout":"3175\n"}},{"input":{"stdin":"542 2000 841 7 3"},"output":{"stdout":"7214\n"}},{"input":{"stdin":"4369 290 2334 1 8"},"output":{"stdout":"6689\n"}},{"input":{"stdin":"124 6 6 1 12"},"output":{"stdout":"78\n"}},{"input":{"stdin":"1985 2000 1343 3 2"},"output":{"stdout":"7357\n"}},{"input":{"stdin":"97 2 21 1 8"},"output":{"stdout":"56\n"}},{"input":{"stdin":"2595 272 2334 1 8"},"output":{"stdout":"4771\n"}},{"input":{"stdin":"1626 632 1708 5 3"},"output":{"stdout":"10026\n"}},{"input":{"stdin":"1626 632 1708 8 3"},"output":{"stdout":"14904\n"}},{"input":{"stdin":"1339 1142 1600 0 1"},"output":{"stdout":"1142\n"}},{"input":{"stdin":"1297 632 1708 5 5"},"output":{"stdout":"9645\n"}},{"input":{"stdin":"0 1 43 2 1"},"output":{"stdout":"1\n"}},{"input":{"stdin":"1500 2445 118 90000 100000"},"output":{"stdout":"23600000\n"}},{"input":{"stdin":"542 2000 1343 3 0"},"output":{"stdout":"1626\n"}},{"input":{"stdin":"778 2000 2830 5 3"},"output":{"stdout":"9890\n"}},{"input":{"stdin":"97 1 16 1 14"},"output":{"stdout":"45\n"}},{"input":{"stdin":"1908 8 1708 5 3"},"output":{"stdout":"9564\n"}},{"input":{"stdin":"97 1 26 1 17"},"output":{"stdout":"68\n"}},{"input":{"stdin":"4369 290 2668 0 1"},"output":{"stdout":"290\n"}},{"input":{"stdin":"75 1 43 2 1"},"output":{"stdout":"151\n"}},{"input":{"stdin":"542 2000 841 5 3"},"output":{"stdout":"6130\n"}},{"input":{"stdin":"124 6 75 1 6"},"output":{"stdout":"160\n"}},{"input":{"stdin":"1339 651 1600 0 1"},"output":{"stdout":"651\n"}},{"input":{"stdin":"1339 290 1600 0 4"},"output":{"stdout":"1160\n"}},{"input":{"stdin":"1626 165 1708 5 3"},"output":{"stdout":"8625\n"}},{"input":{"stdin":"1500 651 1600 0 2"},"output":{"stdout":"1302\n"}},{"input":{"stdin":"1500 965 1600 0 2"},"output":{"stdout":"1930\n"}},{"input":{"stdin":"1339 1142 1600 0 4"},"output":{"stdout":"4568\n"}},{"input":{"stdin":"1339 422 1600 0 4"},"output":{"stdout":"1688\n"}},{"input":{"stdin":"97 2 21 1 17"},"output":{"stdout":"74\n"}},{"input":{"stdin":"1297 886 1708 5 6"},"output":{"stdout":"11801\n"}},{"input":{"stdin":"778 1881 2383 5 5"},"output":{"stdout":"13295\n"}},{"input":{"stdin":"1297 632 1708 5 3"},"output":{"stdout":"8381\n"}},{"input":{"stdin":"0 1 8 2 0"},"output":{"stdout":"0\n"}}],"string":"[\n {\n \"input\": {\n \"stdin\": \"1500 2000 1600 3 2\"\n },\n \"output\": {\n \"stdout\": \"7900\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"1500 2000 500 90000 100000\"\n },\n \"output\": {\n \"stdout\": \"100000000\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"1500 2000 1900 3 2\"\n },\n \"output\": {\n \"stdout\": \"8500\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"2595 290 1999 1 4\"\n },\n \"output\": {\n \"stdout\": \"3755\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"1339 1142 1600 0 2\"\n },\n \"output\": {\n \"stdout\": \"2284\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"97 1 25 1 14\"\n },\n \"output\": {\n \"stdout\": \"63\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"1500 3132 752 90000 100000\"\n },\n \"output\": {\n \"stdout\": \"150400000\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"778 1881 2830 5 3\"\n },\n \"output\": {\n \"stdout\": \"9533\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"1297 2556 2383 5 3\"\n },\n \"output\": {\n \"stdout\": \"14153\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"1339 290 1999 1 4\"\n },\n \"output\": {\n \"stdout\": \"2499\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"1500 3495 1900 3 2\"\n },\n \"output\": {\n \"stdout\": \"9100\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"97 2 26 1 17\"\n },\n \"output\": {\n \"stdout\": \"84\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"1500 2000 2264 3 3\"\n },\n \"output\": {\n \"stdout\": \"10500\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"1500 3132 574 90000 100000\"\n },\n \"output\": {\n \"stdout\": \"114800000\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"778 1881 2830 5 0\"\n },\n \"output\": {\n \"stdout\": \"3890\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4369 106 2334 1 8\"\n },\n \"output\": {\n \"stdout\": \"5217\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"2595 290 2334 1 2\"\n },\n \"output\": {\n \"stdout\": \"3175\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"542 2000 841 7 3\"\n },\n \"output\": {\n \"stdout\": \"7214\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4369 290 2334 1 8\"\n },\n \"output\": {\n \"stdout\": \"6689\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"124 6 6 1 12\"\n },\n \"output\": {\n \"stdout\": \"78\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"1985 2000 1343 3 2\"\n },\n \"output\": {\n \"stdout\": \"7357\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"97 2 21 1 8\"\n },\n \"output\": {\n \"stdout\": \"56\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"2595 272 2334 1 8\"\n },\n \"output\": {\n \"stdout\": \"4771\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"1626 632 1708 5 3\"\n },\n \"output\": {\n \"stdout\": \"10026\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"1626 632 1708 8 3\"\n },\n \"output\": {\n \"stdout\": \"14904\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"1339 1142 1600 0 1\"\n },\n \"output\": {\n \"stdout\": \"1142\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"1297 632 1708 5 5\"\n },\n \"output\": {\n \"stdout\": \"9645\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"0 1 43 2 1\"\n },\n \"output\": {\n \"stdout\": \"1\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"1500 2445 118 90000 100000\"\n },\n \"output\": {\n \"stdout\": \"23600000\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"542 2000 1343 3 0\"\n },\n \"output\": {\n \"stdout\": \"1626\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"778 2000 2830 5 3\"\n },\n \"output\": {\n \"stdout\": \"9890\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"97 1 16 1 14\"\n },\n \"output\": {\n \"stdout\": \"45\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"1908 8 1708 5 3\"\n },\n \"output\": {\n \"stdout\": \"9564\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"97 1 26 1 17\"\n },\n \"output\": {\n \"stdout\": \"68\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"4369 290 2668 0 1\"\n },\n \"output\": {\n \"stdout\": \"290\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"75 1 43 2 1\"\n },\n \"output\": {\n \"stdout\": \"151\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"542 2000 841 5 3\"\n },\n \"output\": {\n \"stdout\": \"6130\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"124 6 75 1 6\"\n },\n \"output\": {\n \"stdout\": \"160\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"1339 651 1600 0 1\"\n },\n \"output\": {\n \"stdout\": \"651\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"1339 290 1600 0 4\"\n },\n \"output\": {\n \"stdout\": \"1160\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"1626 165 1708 5 3\"\n },\n \"output\": {\n \"stdout\": \"8625\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"1500 651 1600 0 2\"\n },\n \"output\": {\n \"stdout\": \"1302\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"1500 965 1600 0 2\"\n },\n \"output\": {\n \"stdout\": \"1930\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"1339 1142 1600 0 4\"\n },\n \"output\": {\n \"stdout\": \"4568\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"1339 422 1600 0 4\"\n },\n \"output\": {\n \"stdout\": \"1688\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"97 2 21 1 17\"\n },\n \"output\": {\n \"stdout\": \"74\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"1297 886 1708 5 6\"\n },\n \"output\": {\n \"stdout\": \"11801\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"778 1881 2383 5 5\"\n },\n \"output\": {\n \"stdout\": \"13295\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"1297 632 1708 5 3\"\n },\n \"output\": {\n \"stdout\": \"8381\\n\"\n }\n },\n {\n \"input\": {\n \"stdin\": \"0 1 8 2 0\"\n },\n \"output\": {\n \"stdout\": \"0\\n\"\n }\n }\n]","isConversational":false},"labels":{"kind":"string","value":"{\n \"tags\": [],\n \"title\": \"p03371 AtCoder Beginner Contest 095 - Half and Half\"\n}"},"canonical_solution":{"kind":"string","value":"{\n \"cpp\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nint a, b, c, x, y, ans;\\n\\nint main() {\\n cin >> a >> b >> c >> x >> y;\\n if (2 * c < a + b) {\\n\\tint mn = min(x, y);\\n\\tans += 2 * mn * c;\\n\\tx -= mn;\\n\\ty -= mn;\\n }\\n return cout << ans + min(a, 2 * c) * x + min(b, 2 * c) * y, 0;\\n}\",\n \"java\": \"import java.util.Scanner;\\n\\npublic class Main {\\n\\tstatic public void main(String[] args) {\\n\\n\\t\\tScanner scan = new Scanner(System.in);\\n\\t\\tint a = scan.nextInt();\\n\\t\\tint b = scan.nextInt();\\n\\t\\tint c = scan.nextInt();\\n\\t\\tint x = scan.nextInt();\\n\\t\\tint y = scan.nextInt();\\n\\t\\tscan.close();\\n\\n\\t\\tint ans = a * x + b * y;\\n\\n\\t\\tint tmp1 = 2 * c * x + b * Math.max(y - x, 0);\\n\\t\\tif (ans > tmp1) {\\n\\t\\t\\tans = tmp1;\\n\\t\\t}\\n\\n\\t\\tint tmp2 = 2 * c * y + a * Math.max(x - y, 0);\\n\\t\\tif (ans > tmp2) {\\n\\t\\t\\tans = tmp2;\\n\\t\\t}\\n\\n\\t\\tSystem.out.println(ans);\\n\\t}\\n}\\n\",\n \"python\": \"A,B,C,X,Y = map(int,input().split())\\nif X<Y:\\n print(min(A*X+B*Y,Y*C*2,X*C*2+B*(Y-X)))\\nelse:\\n print(min(A*X+B*Y,X*C*2,Y*C*2+A*(X-Y)))\"\n}"}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":4,"numItemsPerPage":100,"numTotalItems":13328,"offset":400,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3ODAwOTk0MCwic3ViIjoiL2RhdGFzZXRzL3NpbmUvRnVzZWRDb2RlQ29udGVzdHMiLCJleHAiOjE3NzgwMTM1NDAsImlzcyI6Imh0dHBzOi8vaHVnZ2luZ2ZhY2UuY28ifQ.HPiISp6AyZM9XqjIQQyRHxxi1JkqPzpmA591jI69u-LXOoHvFFfBBYS8PAv-0pDfgUKCk34zhZQTnwzlkUn1AQ","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":13328,"numBytesParquet":329715172},{"config":"default","split":"valid","numRows":117,"numBytesParquet":1626806},{"config":"default","split":"test","numRows":165,"numBytesParquet":2258104}]},"discussionsStats":{"closed":0,"open":1,"total":1},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
id stringlengths 11 112 | content stringlengths 42 13k | test listlengths 0 565 | labels dict | canonical_solution dict |
|---|---|---|---|---|
AIZU/p00127 | # Pocket Pager Input
One day, Taro received a strange email with only the number "519345213244" in the text. The email was from my cousin, who was 10 years older than me, so when I called and asked, "Oh, I sent it with a pocket bell because I was in a hurry. It's convenient. Nice to meet you!" I got it. You know this ... | [
{
"input": {
"stdin": "341143514535\n314\n143565553551655311343411652235654535651124615163\n551544654451431564\n4\n3411\n6363636363\n153414"
},
"output": {
"stdout": "naruto\nNA\ndo you wanna go to aizu?\nyes sure!\nNA\nna\n?????\nend"
}
},
{
"input": {
"stdin": "3411435145... | {
"tags": [],
"title": "Pocket Pager Input"
} | {
"cpp": "#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <cstring>\n#include <cstdlib>\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(int)n;++i)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n#define ALL(c) (c).begin... |
AIZU/p00260 | # Cats Going Straight
There was a large mansion surrounded by high walls. The owner of the mansion loved cats so much that he always prepared delicious food for the occasional cats. The hungry cats jumped over the high walls and rushed straight to the rice that was everywhere in the mansion.
One day the husband found... | [
{
"input": {
"stdin": "8\n0 0\n3 2\n6 2\n8 6\n6 5\n7 7\n0 4\n3 4\n8\n0 0\n5 3\n5 2\n4 1\n6 1\n8 6\n6 4\n2 4\n0"
},
"output": {
"stdout": "1\n2"
}
},
{
"input": {
"stdin": "8\n-1 0\n6 2\n6 2\n8 6\n6 5\n7 7\n0 4\n3 2\n8\n0 0\n6 3\n5 2\n4 1\n6 1\n13 6\n6 4\n3 4\n0"
},
... | {
"tags": [],
"title": "Cats Going Straight"
} | {
"cpp": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef complex<double> P;\n\nstruct data{\n double d;\n P p;\n bool operator < (const data &a)const{\n return d < a.d;\n }\n};\n\ndouble eps=1e-8;\ndouble PI=acos(-1);\n\nbool eq(double a,double b){return (b-a<eps&&a-b<eps);}\nbool eq(P a,P b){return (a... |
AIZU/p00447 | # Searching Constellation
problem
You are looking for a constellation in a picture of the starry sky. The photo always contains exactly one figure with the same shape, orientation, and size as the constellation you are looking for. However, there is a possibility that extra stars are shown in the photograph other tha... | [
{
"input": {
"stdin": "5\n8 5\n6 4\n4 3\n7 10\n0 10\n10\n10 5\n2 7\n9 7\n8 10\n10 2\n1 2\n8 1\n6 7\n6 0\n0 9\n5\n904207 809784\n845370 244806\n499091 59863\n638406 182509\n435076 362268\n10\n757559 866424\n114810 239537\n519926 989458\n461089 424480\n674361 448440\n81851 150384\n459107 795405\n299682 6700... | {
"tags": [],
"title": "Searching Constellation"
} | {
"cpp": "#include<iostream>\n#include<string>\n#include<algorithm>\n#include<math.h>\n#include<queue>\n#include<set>\n#include<map>\n\nusing namespace std;\n\n\nint M, N;\nint main() {\n\twhile (cin >> M, M)\n\t{\n\t\tint sx[200], sy[200], skyx[1000], skyy[1000];\n\t\tset<pair<int, int>> ex;\n\n\t\tfor (int i = 0; i... |
AIZU/p00638 | # Old Bridges
Long long ago, there was a thief. Looking for treasures, he was running about all over the world. One day, he heard a rumor that there were islands that had large amount of treasures, so he decided to head for there.
Finally he found n islands that had treasures and one island that had nothing. Most of ... | [
{
"input": {
"stdin": "3\n2 3\n3 6\n1 2\n3\n2 3\n3 5\n1 2\n0"
},
"output": {
"stdout": "Yes\nNo"
}
},
{
"input": {
"stdin": "3\n2 5\n0 16\n2 2\n3\n2 3\n3 0\n2 3\n0"
},
"output": {
"stdout": "Yes\nNo\n"
}
},
{
"input": {
"stdin": "3\n2 5\n0 8\... | {
"tags": [],
"title": "Old Bridges"
} | {
"cpp": "#include <iostream>\n#include <utility>\n#include <algorithm>\nusing namespace std;\n\ntypedef pair<int, int> pii;\n\nint main()\n{\n int n, m, k;\n while(1){\n m = 0;\n k = 0;\n cin >> n;\n if(n == 0){\n break;\n }else{\n int num[n][2];\n pii p[n];\n for(int i = 0; i < ... |
AIZU/p00781 | # Lattice Practices
Once upon a time, there was a king who loved beautiful costumes very much. The king had a special cocoon bed to make excellent cloth of silk. The cocoon bed had 16 small square rooms, forming a 4 × 4 lattice, for 16 silkworms. The cocoon bed can be depicted as follows:
<image>
The cocoon bed can ... | [
{
"input": {
"stdin": "10000 01000 00100 11000 01100 11111 01110 11100 10110 11110\n10101 01000 00000 11001 01100 11101 01110 11100 10110 11010\nEND"
},
"output": {
"stdout": "40\n6"
}
},
{
"input": {
"stdin": "00000 00000 00100 11000 00100 10111 01111 11100 00111 01111\n11... | {
"tags": [],
"title": "Lattice Practices"
} | {
"cpp": "#include <iostream>\n#include <sstream>\n#include <iomanip>\n#include <algorithm>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <list>\n#include <queue>\n#include <stack>\n#include <set>\n#include <map>\n#include <bitset>\n#include <numeric>\n#include <climits>\n#include <cfloat>\nusing ... |
AIZU/p00914 | # Equal Sum Sets
Let us consider sets of positive integers less than or equal to n. Note that all elements of a set are different. Also note that the order of elements doesn't matter, that is, both {3, 5, 9} and {5, 9, 3} mean the same set.
Specifying the number of set elements and their sum to be k and s, respective... | [
{
"input": {
"stdin": "9 3 23\n9 3 22\n10 3 28\n16 10 107\n20 8 102\n20 10 105\n20 10 155\n3 4 3\n4 2 11\n0 0 0"
},
"output": {
"stdout": "1\n2\n0\n20\n1542\n5448\n1\n0\n0"
}
},
{
"input": {
"stdin": "9 3 23\n9 3 22\n10 6 28\n16 10 107\n20 8 102\n17 10 105\n20 10 155\n3 5 3... | {
"tags": [],
"title": "Equal Sum Sets"
} | {
"cpp": "#include<iostream>\n#include<string>\n#include<math.h>\nusing namespace std;\nint main(){\n\tint n,k,s;\n\twhile(true){\n\t cin>>n>>k>>s;\n\t\tif(n==0&&k==0&&s==0)\n\t\t\tbreak;\n\t\tint count=0;\n\t\tif(n==0&&k==0&&s==0)\n\t\t\tbreak;\n\t\tfor(int i=0;i<pow(2.0,n+0.0);i++){\n\t\t\tint scount=0,kcount=0;... |
AIZU/p01046 | # Yu-kun Likes a lot of Money
Background
The kindergarten attached to the University of Aizu is a kindergarten where children who love programming gather. Yu, one of the kindergarten children, loves money as much as programming. Yu-kun visited the island where treasures sleep to make money today. Yu-kun has obtained ... | [
{
"input": {
"stdin": "3 3 1 10\n@#b\n.#.\n.#.\nb 100"
},
"output": {
"stdout": "0"
}
},
{
"input": {
"stdin": "3 3 1 20\n@*C\n..*\n...\nC 10"
},
"output": {
"stdout": "0"
}
},
{
"input": {
"stdin": "3 3 1 10\n@0.\n...\n...\n0 100"
},
... | {
"tags": [],
"title": "Yu-kun Likes a lot of Money"
} | {
"cpp": "#include <bits/stdc++.h>\n#define INF 1000000007\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\n\nstruct uftree{\n\tint par[25];\n\tint rank[25];\n\tuftree(){\n\t}\n\tvoid init(int n){\n\t\tfor(int i=0;i<n;i++){\n\t\t\tpar[i]=i;\n\t\t\trank[i]=0;\n\t\t}\n\t}\n\tint find(int x){\n\t\... |
AIZU/p01179 | # Cousin's Aunt
Sarah is a girl who likes reading books.
One day, she wondered about the relationship of a family in a mystery novel. The story said,
* B is A’s father’s brother’s son, and
* C is B’s aunt.
Then she asked herself, “So how many degrees of kinship are there between A and C?”
There are two possible ... | [
{
"input": {
"stdin": "7\nC is A’s father’s brother’s son’s aunt\nC is A’s mother’s brother’s son’s aunt\nC is A’s son’s mother’s mother’s son\nC is A’s aunt’s niece’s aunt’s niece\nC is A’s father’s son’s brother\nC is A’s son’s son’s mother\nC is A"
},
"output": {
"stdout": "5 3\n5 1\n2 2\... | {
"tags": [],
"title": "Cousin's Aunt"
} | {
"cpp": "#include <algorithm>\n#include <cassert>\n#include <climits>\n#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\nusing namespace std::placeholders;\n\nenum Relation {\n FATHER, MOTHER, SON, DAUGHTER, HUSBAND, WIFE, BROTHER, SISTER, GRANDFATHER,\n GRANDMOTHER, GRANDSON, GRANDD... |
AIZU/p01316 | # Differential Pulse Code Modulation
Differential pulse code modulation is one of the compression methods mainly used when compressing audio signals.
The audio signal is treated as an integer sequence (impulse sequence) on the computer. The integer sequence is a sample of the input signal at regular time intervals an... | [
{
"input": {
"stdin": "2 7\n4\n2\n1\n0\n-1\n-2\n-4\n131\n137\n2 7\n4\n2\n1\n0\n-1\n-2\n-4\n131\n123\n10 7\n-4\n-2\n-1\n0\n1\n2\n4\n132\n134\n135\n134\n132\n128\n124\n122\n121\n122\n5 1\n255\n0\n0\n0\n0\n0\n4 1\n0\n255\n0\n255\n0\n0 0"
},
"output": {
"stdout": "2\n8\n0\n325125\n65026"
}
... | {
"tags": [],
"title": "Differential Pulse Code Modulation"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nconst int MAX_N=2e4+10,MAX_M=20,MAX=256,INF=1e9;\n\nint N,M,nxt,ans;\nint C[MAX_M],x[MAX_N];\nint dp[MAX_N][MAX];\n\nvoid solve(){\n for (int i=0;i<MAX_N;++i)\n for (int j=0;j<MAX;++j)\n dp[i][j]=INF;\n dp[0][128]=0;\n for (int i=0;i... |
AIZU/p01484 | # Icy Composer
Time Limit: 8 sec / Memory Limit: 64 MB
Example
Input
5 3 2
aaaaa
aaa
aab
Output
1 6 | [
{
"input": {
"stdin": "5 3 2\naaaaa\naaa\naab"
},
"output": {
"stdout": "1 6"
}
},
{
"input": {
"stdin": "6 3 2\nabaac\naab\nbaa"
},
"output": {
"stdout": "2 6\n"
}
},
{
"input": {
"stdin": "14 0 2\naaaaa\nabb\naab"
},
"output": {
... | {
"tags": [],
"title": "Icy Composer"
} | {
"cpp": "#include <stdio.h>\n#include <string.h>\n#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <assert.h>\n#include <vector>\n#include <queue>\n#include <string>\n#include <map>\n#include <set>\n\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int uint;\ntypedef unsigned long... |
AIZU/p01646 | # Dictionary
Problem Statement
We found a dictionary of the Ancient Civilization Mayo (ACM) during excavation of the ruins. After analysis of the dictionary, we revealed they used a language that had not more than 26 letters. So one of us mapped each letter to a different English alphabet and typed all the words in t... | [
{
"input": {
"stdin": "4\ncba\ncab\nb\na\n3\nbca\nab\na\n5\nabc\nacb\nb\nc\nc\n5\nabc\nacb\nc\nb\nb\n0"
},
"output": {
"stdout": "yes\nno\nyes\nno"
}
},
{
"input": {
"stdin": "4\ncbb\ncab\nb\na\n3\nbca\nab\na\n5\nabc\nacb\nb\nc\nc\n0\ncba\nabc\nc\nb\nc\n1"
},
"outpu... | {
"tags": [],
"title": "Dictionary"
} | {
"cpp": "#include <iostream>\n#include <vector>\n#include <string>\nusing namespace std;\n\nint N;\nvector<vector<int>> v(26);\nint vis[26] = {};\n\nbool dfs(int n){\n vis[n] = -1;\n bool ok = true;\n for(auto x:v[n]){\n if(vis[x]==0) ok = ok && dfs(x);\n else if(vis[x]==-1) return false;\n ... |
AIZU/p01797 | # Kimagure Cleaner
Example
Input
2 -3 4
L 2 5
? 3 5
Output
2
L 4
L 3 | [
{
"input": {
"stdin": "2 -3 4\nL 2 5\n? 3 5"
},
"output": {
"stdout": "2\nL 4\nL 3"
}
}
] | {
"tags": [],
"title": "Kimagure Cleaner"
} | {
"cpp": "//\n// Problem: Kimagagure Cleaner\n// Solution by: MORI Shingo\n// O(n*2^(n3/8))\n//\n// implement1 & debug1 214min\n// implement2 86min\n// debug2 122min\n// \n#include <stdio.h>\n#include <string.h>\n#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <assert.h>\n#include <vector>\n#in... |
AIZU/p01931 | # Check answers
problem
AOR Ika is studying to pass the test.
AOR Ika-chan solved the $ N $ question. After that, round the solved problem according to the following procedure.
1. Check the correctness of the answer.
2. If the answer is correct, write a circle mark, and if it is incorrect, write a cross mark on the... | [
{
"input": {
"stdin": "3\noxx"
},
"output": {
"stdout": "2"
}
},
{
"input": {
"stdin": "3\nzny"
},
"output": {
"stdout": "3\n"
}
},
{
"input": {
"stdin": "3\nymz"
},
"output": {
"stdout": "3\n"
}
},
{
"input": {
... | {
"tags": [],
"title": "Check answers"
} | {
"cpp": "#include<bits/stdc++.h>\n#define vi vector<int>\n#define vvi vector<vector<int> >\n#define vl vector<ll>\n#define vvl vector<vector<ll>>\n#define vb vector<bool>\n#define vc vector<char>\n#define vs vector<string>\nusing ll = long long;\nusing ld =long double;\n//#define int ll\n#define INF 1e9\n#define EPS... |
AIZU/p02069 | # Universal and Existential Quantifiers
Problem Statement
You are given a list of $N$ intervals. The $i$-th interval is $[l_i, r_i)$, which denotes a range of numbers greater than or equal to $l_i$ and strictly less than $r_i$. In this task, you consider the following two numbers:
* The minimum integer $x$ such that... | [
{
"input": {
"stdin": ""
},
"output": {
"stdout": ""
}
}
] | {
"tags": [],
"title": "Universal and Existential Quantifiers"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) repi(i, 0, n)\n#define repi(i, a, b) for(int i=(int)(a);i<(int)(b);++i)\n#define ll long long\n\nconstexpr int SIZE = 1000000;\nvoid solve(){\n int N;\n ll L;\n cin >> N >> L;\n pair<ll, ll> interval[N];\n vector<ll> compressTe... |
AIZU/p02211 | # Apple Adventure
Apple adventure
square1001 and E869120 got lost in the grid world of $ H $ rows and $ W $ rows!
Said the god of this world.
"When you collect $ K $ apples and they meet, you'll be back in the original world."
Upon hearing this word, square1001 decided to collect more than $ K $ of apples and head... | [
{
"input": {
"stdin": "5 5 2\ns..#a\n.#...\na#e.#\n...#a\n.#..."
},
"output": {
"stdout": "14"
}
},
{
"input": {
"stdin": "5 5 2\ns..#a\n...#.\na#e.#\n...#a\n.#..."
},
"output": {
"stdout": "14\n"
}
},
{
"input": {
"stdin": "5 5 1\nc#..s\n.#/... | {
"tags": [],
"title": "Apple Adventure"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ost... |
AIZU/p02365 | # Minimum-Cost Arborescence
Find the sum of the weights of edges of the Minimum-Cost Arborescence with the root r for a given weighted directed graph G = (V, E).
Constraints
* 1 ≤ |V| ≤ 100
* 0 ≤ |E| ≤ 1,000
* 0 ≤ wi ≤ 10,000
* G has arborescence(s) with the root r
Input
|V| |E| r
s0 t0 w0
s1 t1 w1
:
s|E|-1 t|E|-... | [
{
"input": {
"stdin": "4 6 0\n0 1 3\n0 2 2\n2 0 1\n2 3 1\n3 0 1\n3 1 5"
},
"output": {
"stdout": "6"
}
},
{
"input": {
"stdin": "6 10 0\n0 2 7\n0 1 1\n0 3 5\n1 4 9\n2 1 6\n1 3 2\n3 4 3\n4 2 2\n2 5 8\n3 5 3"
},
"output": {
"stdout": "11"
}
},
{
"inp... | {
"tags": [],
"title": "Minimum-Cost Arborescence"
} | {
"cpp": "#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\nconst int INF = 1e9;\nconst ll LINF = 1e18;\ntemplate<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << \"(\" << o.first << \",\" << o.second << \")\... |
CodeChef/acdemy | Sherlock Holmes has decided to start a new academy to some of the young lads. He has conducted several tests and finally selected N equally brilliant
students.Now he don't know whether to train all the N students or not. Now since Holmes was in a confusion, Watson came up with an idea. He wanted to
test the obedience o... | [
{
"input": {
"stdin": "2\n5\n2 3 5 1 2\n3\n1 2 3"
},
"output": {
"stdout": "3\n3"
}
}
] | {
"tags": [],
"title": "acdemy"
} | {
"cpp": null,
"java": null,
"python": "# your code goes here\nfrom sys import stdin, stdout\nt = int(stdin.readline())\nwhile t:\n\tt -= 1\n\tn = int(stdin.readline())\n\ta = map(int, stdin.readline().strip().split(' '))\n\tif n <= 2:\n\t\tstdout.write(str(n)+\"\\n\")\n\telse:\n\t\tm = 2\n\t\tc = 2\n\t\ti = 2\n\... |
CodeChef/chefrp | Rupsa recently started to intern under Chef. He gave her N type of ingredients of varying quantity A1, A2, ..., AN respectively to store it. But as she is lazy to arrange them she puts them all in a storage box.
Chef comes up with a new recipe and decides to prepare it. He asks Rupsa to get two units of each type ingr... | [
{
"input": {
"stdin": "2\n2\n2 2\n1\n6"
},
"output": {
"stdout": "4\n2\n"
}
},
{
"input": {
"stdin": "2\n3\n4 4\n0\n6"
},
"output": {
"stdout": "6\n2\n"
}
},
{
"input": {
"stdin": "2\n-1\n5 13\n0\n6"
},
"output": {
"stdout": "15... | {
"tags": [],
"title": "chefrp"
} | {
"cpp": null,
"java": null,
"python": "def ingr(l):\n s=0\n minfreq=l[0]\n for i in range(0,len(l),1):\n if l[i]<2:\n return -1\n for i in range(0,len(l),1):\n s+=l[i]\n minfreq=min(minfreq,l[i])\n return (s-minfreq+2)\nt=int(input())\nwhile t:\n t=t-1\n n=int... |
CodeChef/donuts | There is new delicious item in Chef's menu - a doughnut chain. Doughnuts connected successively in line forming a chain.
Chain of 3 doughnuts
Chef has received an urgent order for making a chain of N doughnuts. He noticed that there are exactly N cooked doughnuts in the kitchen, some of which are already connected i... | [
{
"input": {
"stdin": "2\n11 3\n4 3 4\n6 3\n3 2 1"
},
"output": {
"stdout": "2\n1\n"
}
},
{
"input": {
"stdin": "2\n22 6\n2 3 4\n6 1\n2 2 1"
},
"output": {
"stdout": "4\n0\n"
}
},
{
"input": {
"stdin": "2\n22 6\n2 3 7\n6 3\n2 2 0"
},
... | {
"tags": [],
"title": "donuts"
} | {
"cpp": null,
"java": null,
"python": "for t in xrange(input()):\n n, m = map(int, raw_input().strip().split())\n arr = map(int, raw_input().strip().split())\n arr.sort()\n cuts = 0\n for i in xrange(m):\n k = m - i - cuts - 1\n if k <= arr[i]:\n ans = cuts + k\n ... |
CodeChef/ism1 | Hackers! Hackers! Everywhere!
Some days back your email ID was hacked. Some one read the personal messages and Love Letters you sent to your girl friend. That's a terrible thing, well, you know how are the boys at ISM. So, you have decided that from now onwards you will write Love Letters to your girlfriend in a differ... | [
{
"input": {
"stdin": "3\ncan you meet me outside ccd today\na\nthis year hard kaur is coming to entertain us"
},
"output": {
"stdout": "nac uoy teem em edistuo dcc yadot\na\nsiht raey drah ruak si gnimoc ot niatretne su"
}
},
{
"input": {
"stdin": "3\ncan pyu meet me ouuti... | {
"tags": [],
"title": "ism1"
} | {
"cpp": null,
"java": null,
"python": "t=input()\nwhile t>0:\n\tA=map(str,raw_input().split())\n\tB=[]\n\tfor i in xrange(len(A)):\n\t\tc=A[i]\n\t\tB.append(c[::-1])\n\tprint \" \".join(B)\n\tt=t-1"
} |
CodeChef/nopc10 | Computation of the date either previous or forthcoming dates is quiet easy. But it is quiet difficult to calculate the day from a particular given date.
You are required to find a day from a particular date given to you.
Input
It consists of a single line entry consisting of date in format dd mm yyyy.
i.e. the input... | [
{
"input": {
"stdin": "14 3 2012"
},
"output": {
"stdout": "Wednesday"
}
},
{
"input": {
"stdin": "10 1 1946"
},
"output": {
"stdout": "Wednesday\n"
}
},
{
"input": {
"stdin": "3 -1 46"
},
"output": {
"stdout": "Wednesday\n"
... | {
"tags": [],
"title": "nopc10"
} | {
"cpp": null,
"java": null,
"python": "import datetime\ndt='21/03/2012'\nday, month, year = (int(x) for x in dt.split('/')) \nans=datetime.date(year,month,day)\nprint (ans.strftime(\"%A\"))"
} |
CodeChef/seg003 | Problem description.
The problem statement is simple , you are given an array and you have to perform two types of operation on it.
Type 1 : update the value of array at the given index.
Type 2 : find the maximum sum you can obtained in the given range ( L , R ) by taking any two index i and j , such that ( L <=... | [
{
"input": {
"stdin": "5 3 \n1 2 3 4 5\n2 1 5\n1 2 5\n2 1 5"
},
"output": {
"stdout": "9 \n10"
}
}
] | {
"tags": [],
"title": "seg003"
} | {
"cpp": null,
"java": null,
"python": "# your code goes here\nfrom math import ceil, log\nfrom sys import stdin, stdout\nst = []\ndef getMid(s, e):\n\treturn s + (e-s) / 2\n\ndef construct(st, arr, ss, se, si, type):\n\tif se == ss:\n\t\tif se%2 == type:\n\t\t\tst[si] = arr[ss]\n\t\telse:\n\t\t\tst[si] = 0\n\t\t... |
Codeforces/1003/D | # Coins and Queries
Polycarp has n coins, the value of the i-th coin is a_i. It is guaranteed that all the values are integer powers of 2 (i.e. a_i = 2^d for some non-negative integer number d).
Polycarp wants to know answers on q queries. The j-th query is described as integer number b_j. The answer to the query is ... | [
{
"input": {
"stdin": "5 4\n2 4 8 2 4\n8\n5\n14\n10\n"
},
"output": {
"stdout": "1\n-1\n3\n2\n"
}
},
{
"input": {
"stdin": "1 10\n8\n1\n2\n3\n4\n5\n6\n7\n8\n9\n16\n"
},
"output": {
"stdout": "-1\n-1\n-1\n-1\n-1\n-1\n-1\n1\n-1\n-1\n"
}
},
{
"input":... | {
"tags": [
"greedy"
],
"title": "Coins and Queries"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n map<long long, int> two;\n map<int, long long> m_two;\n long long t = 1;\n for (int i = 0; i < 32; i++) {\n two[t] = i;\n m_two[i] = t;\n t *= 2;\n }\n int ar[33];\n memset(ar, 0, sizeof(ar));\n int n, q;\n cin >> n >> q;\n wh... |
Codeforces/1027/E | # Inverse Coloring
You are given a square board, consisting of n rows and n columns. Each tile in it should be colored either white or black.
Let's call some coloring beautiful if each pair of adjacent rows are either the same or different in every position. The same condition should be held for the columns as well.
... | [
{
"input": {
"stdin": "2 3\n"
},
"output": {
"stdout": "6\n"
}
},
{
"input": {
"stdin": "1 1\n"
},
"output": {
"stdout": "0\n"
}
},
{
"input": {
"stdin": "49 1808\n"
},
"output": {
"stdout": "359087121\n"
}
},
{
"inp... | {
"tags": [
"combinatorics",
"dp",
"math"
],
"title": "Inverse Coloring"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nconst int maxn = 503, mod = 998244353;\nint n, m, ans;\nint f[2][maxn][maxn], s[maxn];\nint inv(int a) {\n int b = mod - 2, ans = 1;\n while (b) {\n if (b & 1) ans = 1ll * ans * a % mod;\n a = 1ll * a * a % mod;\n b >>= 1;\n }\n return ans;\n}\nin... |
Codeforces/1046/D | # Interstellar battle
In the intergalactic empire Bubbledom there are N planets, of which some pairs are directly connected by two-way wormholes. There are N-1 wormholes. The wormholes are of extreme religious importance in Bubbledom, a set of planets in Bubbledom consider themselves one intergalactic kingdom if and o... | [
{
"input": {
"stdin": "5\n0.50 0.29 0.49 0.95 0.83\n2 3\n0 3\n3 4\n2 1\n3\n4 0.66\n1 0.69\n0 0.36\n"
},
"output": {
"stdout": "1.6804000000\n1.4844000000\n1.6174000000\n"
}
},
{
"input": {
"stdin": "26\n0.98 0.64 0.06 0.90 0.01 0.73 0.21 0.98 0.65 1.00 0.87 0.85 0.01 0.06 0... | {
"tags": [
"math",
"probabilities",
"trees"
],
"title": "Interstellar battle"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nconst int N = 1e5 + 2;\nvector<int> adj[N];\nint par[N];\ndouble ar[N], f[N];\nvoid dfs(int x, int p) {\n for (int i = 0; i < adj[x].size(); i++) {\n if (adj[x][i] != p) {\n f[x] += ar[adj[x][i]];\n par[adj[x][i]] = x;\n dfs(adj[x][i], x);\n... |
Codeforces/1070/C | # Cloud Computing
Buber is a Berland technology company that specializes in waste of investor's money. Recently Buber decided to transfer its infrastructure to a cloud. The company decided to rent CPU cores in the cloud for n consecutive days, which are numbered from 1 to n. Buber requires k CPU cores each day.
The c... | [
{
"input": {
"stdin": "7 13 5\n2 3 10 7\n3 5 10 10\n1 2 10 6\n4 5 10 9\n3 4 10 8\n"
},
"output": {
"stdout": "462\n"
}
},
{
"input": {
"stdin": "4 100 3\n3 3 2 5\n1 1 3 2\n2 4 4 4\n"
},
"output": {
"stdout": "64\n"
}
},
{
"input": {
"stdin": ... | {
"tags": [
"data structures",
"greedy"
],
"title": "Cloud Computing"
} | {
"cpp": "#include <bits/stdc++.h>\ninline int read() {\n char ch = getchar();\n int ret = 0, f = 1;\n while (ch < '0' || ch > '9') {\n if (ch == '-') f = -1;\n ch = getchar();\n }\n for (; ch >= '0' && ch <= '9'; ch = getchar()) ret = ret * 10 + ch - '0';\n return ret * f;\n}\nusing namespace std;\nconst... |
Codeforces/1091/G | # New Year and the Factorisation Collaboration
Integer factorisation is hard. The RSA Factoring Challenge offered $100 000 for factoring RSA-1024, a 1024-bit long product of two prime numbers. To this date, nobody was able to claim the prize. We want you to factorise a 1024-bit number.
Since your programming language... | [
{
"input": {
"stdin": "21\n\n7\n\n17\n\n15\n\n17\n\n11\n\n-1\n\n15\n\n"
},
"output": {
"stdout": "+ 12 16\n\n- 6 10\n\n* 8 15\n\n/ 5 4\n\nsqrt 16\n\nsqrt 5\n\n^ 6 12\n\n! 2 3 7"
}
},
{
"input": {
"stdin": "3\n23096722104754207127290818652586833139892168247130866425398877835... | {
"tags": [
"interactive",
"math",
"number theory"
],
"title": "New Year and the Factorisation Collaboration"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\ntemplate <typename T>\nvector<T> &operator--(vector<T> &v) {\n for (auto &i : v) --i;\n return v;\n}\ntemplate <typename T>\nvector<T> &operator++(vector<T> &v) {\n for (auto &i : v) ++i;\n return v;\n}\ntemp... |
Codeforces/1110/E | # Magic Stones
Grigory has n magic stones, conveniently numbered from 1 to n. The charge of the i-th stone is equal to c_i.
Sometimes Grigory gets bored and selects some inner stone (that is, some stone with index i, where 2 ≤ i ≤ n - 1), and after that synchronizes it with neighboring stones. After that, the chosen ... | [
{
"input": {
"stdin": "4\n7 2 4 12\n7 15 10 12\n"
},
"output": {
"stdout": "Yes\n"
}
},
{
"input": {
"stdin": "3\n4 4 4\n1 2 3\n"
},
"output": {
"stdout": "No\n"
}
},
{
"input": {
"stdin": "10\n62159435 282618243 791521863 214307200 976959598... | {
"tags": [
"constructive algorithms",
"math",
"sortings"
],
"title": "Magic Stones"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nlong long n;\nvector<long long> c, t, sc, st;\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(NULL);\n cin >> n;\n for (int i = 0; i < n; i++) {\n long long a;\n cin >> a;\n c.push_back(a);\n }\n for (int i = 0; i < n; i++) {\n long lo... |
Codeforces/1140/B | # Good String
You have a string s of length n consisting of only characters > and <. You may do some operations with this string, for each operation you have to choose some character that still remains in the string. If you choose a character >, the character that comes right after it is deleted (if the character you ... | [
{
"input": {
"stdin": "3\n2\n<>\n3\n><<\n1\n>\n"
},
"output": {
"stdout": "0\n0\n0\n"
}
},
{
"input": {
"stdin": "1\n9\n>>>>>>>><\n"
},
"output": {
"stdout": "0\n"
}
},
{
"input": {
"stdin": "13\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>... | {
"tags": [
"implementation",
"strings"
],
"title": "Good String"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nint n;\nstring s;\nint t;\nint main() {\n cin >> t;\n for (int i = 1; i <= t; i++) {\n cin >> n;\n cin >> s;\n bool kt = false;\n int mi = 200, cr = 0, r = 0, l = 0;\n for (int j = 0; j < n; j++) {\n if (s[j] == '<' && cr == 0)\n l... |
Codeforces/1158/F | # Density of subarrays
Let c be some positive integer. Let's call an array a_1, a_2, …, a_n of positive integers c-array, if for all i condition 1 ≤ a_i ≤ c is satisfied. Let's call c-array b_1, b_2, …, b_k a subarray of c-array a_1, a_2, …, a_n, if there exists such set of k indices 1 ≤ i_1 < i_2 < … < i_k ≤ n that b... | [
{
"input": {
"stdin": "5 2\n1 2 1 2 1\n"
},
"output": {
"stdout": "10 17 4 0 0 0 "
}
},
{
"input": {
"stdin": "3 3\n1 2 3\n"
},
"output": {
"stdout": "6 1 0 0 "
}
},
{
"input": {
"stdin": "4 1\n1 1 1 1\n"
},
"output": {
"stdout"... | {
"tags": [
"dp",
"math"
],
"title": "Density of subarrays"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nconst int md = 998244353;\ninline void add(int &x, int y) {\n x += y;\n if (x >= md) {\n x -= md;\n }\n}\ninline void sub(int &x, int y) {\n x -= y;\n if (x < 0) {\n x += md;\n }\n}\ninline int mul(int x, int y) { return (int)((long long)x * y % md... |
Codeforces/1180/E | # Serge and Dining Room
Serge came to the school dining room and discovered that there is a big queue here. There are m pupils in the queue. He's not sure now if he wants to wait until the queue will clear, so he wants to know which dish he will receive if he does. As Serge is very tired, he asks you to compute it ins... | [
{
"input": {
"stdin": "1 1\n1\n1\n1\n2 1 100\n"
},
"output": {
"stdout": "-1\n"
}
},
{
"input": {
"stdin": "4 6\n1 8 2 4\n3 3 6 1 5 2\n3\n1 1 1\n2 5 10\n1 1 6\n"
},
"output": {
"stdout": "8\n-1\n4\n"
}
},
{
"input": {
"stdin": "1 1\n1\n1\n1\n... | {
"tags": [
"binary search",
"data structures",
"graph matchings",
"greedy",
"implementation",
"math",
"trees"
],
"title": "Serge and Dining Room"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nint n, m, q, a[1000010], b[1000010];\nstruct se {\n struct node {\n int sum;\n int maxn;\n node() { sum = maxn = 0; }\n node(int s, int m) : sum(s), maxn(m) {}\n node operator+(const node &other) const {\n node res = node();\n res.sum... |
Codeforces/1199/E | # Matching vs Independent Set
You are given a graph with 3 ⋅ n vertices and m edges. You are to find a matching of n edges, or an independent set of n vertices.
A set of edges is called a matching if no two edges share an endpoint.
A set of vertices is called an independent set if no two vertices are connected with ... | [
{
"input": {
"stdin": "4\n1 2\n1 3\n1 2\n1 2\n1 3\n1 2\n2 5\n1 2\n3 1\n1 4\n5 1\n1 6\n2 15\n1 2\n1 3\n1 4\n1 5\n1 6\n2 3\n2 4\n2 5\n2 6\n3 4\n3 5\n3 6\n4 5\n4 6\n5 6\n"
},
"output": {
"stdout": "Matching\n1 \nMatching\n1 \nIndSet\n3 4 \nMatching\n1 10 \n\n"
}
},
{
"input": {
... | {
"tags": [
"constructive algorithms",
"graphs",
"greedy",
"sortings"
],
"title": "Matching vs Independent Set"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n long long t;\n cin >> t;\n for (; t > 0; t--) {\n long long n, m;\n cin >> n >> m;\n n *= 3;\n vector<bool> a((size_t)n, false);\n vector<long long> b;\n for (long lo... |
Codeforces/1216/D | # Swords
There were n types of swords in the theater basement which had been used during the plays. Moreover there were exactly x swords of each type. y people have broken into the theater basement and each of them has taken exactly z swords of some single type. Note that different people might have taken different ty... | [
{
"input": {
"stdin": "2\n2 9\n"
},
"output": {
"stdout": "1 7\n"
}
},
{
"input": {
"stdin": "3\n3 12 6\n"
},
"output": {
"stdout": "5 3\n"
}
},
{
"input": {
"stdin": "7\n2 1000000000 4 6 8 4 2\n"
},
"output": {
"stdout": "29999... | {
"tags": [
"math"
],
"title": "Swords"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nvoid _print(long long t) { cerr << t; }\nvoid _print(int t) { cerr << t; }\nvoid _print(string t) { cerr << t; }\nvoid _print(char t) { cerr << t; }\nvoid _print(long double t) { cerr << t; }\nvoid _print(double t) { cerr << t; }\nvoid _print(unsigned long lon... |
Codeforces/1239/E | # Turtle
Kolya has a turtle and a field of size 2 × n. The field rows are numbered from 1 to 2 from top to bottom, while the columns are numbered from 1 to n from left to right.
Suppose in each cell of the field there is a lettuce leaf. The energy value of lettuce leaf in row i and column j is equal to a_{i,j}. The t... | [
{
"input": {
"stdin": "3\n1 0 1\n0 0 0\n"
},
"output": {
"stdout": "0 0 1 \n1 0 0 "
}
},
{
"input": {
"stdin": "2\n1 4\n2 3\n"
},
"output": {
"stdout": "1 3\n4 2\n"
}
},
{
"input": {
"stdin": "3\n0 0 0\n0 0 0\n"
},
"output": {
"... | {
"tags": [
"dp",
"implementation"
],
"title": "Turtle"
} | {
"cpp": "#include <bits/stdc++.h>\nconst int N = 26, M = 50006;\nint n, a[3][N], b[2 * N], f[N][M * N];\nbool chosen[2 * N];\nint main() {\n std::cin >> n;\n for (int i = 1; i <= 2 * n; ++i) {\n std::cin >> b[i];\n }\n std::sort(b + 1, b + 2 * n + 1);\n a[1][1] = b[1], a[2][n] = b[2];\n int sum = 0;\n f[0]... |
Codeforces/1257/G | # Divisor Set
You are given an integer x represented as a product of n its prime divisors p_1 ⋅ p_2, ⋅ … ⋅ p_n. Let S be the set of all positive integer divisors of x (including 1 and x itself).
We call a set of integers D good if (and only if) there is no pair a ∈ D, b ∈ D such that a ≠ b and a divides b.
Find a go... | [
{
"input": {
"stdin": "3\n2999999 43 2999957\n"
},
"output": {
"stdout": "3\n"
}
},
{
"input": {
"stdin": "6\n2 3 2 3 2 2\n"
},
"output": {
"stdout": "3\n"
}
},
{
"input": {
"stdin": "16\n2 2 2 2 2 3 3 3 3 5 5 7 7 11 13 17\n"
},
"outp... | {
"tags": [
"divide and conquer",
"fft",
"greedy",
"math",
"number theory"
],
"title": "Divisor Set"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nconst int maxl = 20;\nconst int maxn = 1 << maxl;\nconst int mod = 998244353;\nint rev[maxn];\nint qpow(int a, int b) {\n int ans = 1;\n while (b) {\n if (b & 1) ans = 1ll * ans * a % mod;\n a = 1ll * a * a % mod;\n b >>= 1;\n }\n return ans;\n}\n... |
Codeforces/1281/B | # Azamon Web Services
Your friend Jeff Zebos has been trying to run his new online company, but it's not going very well. He's not getting a lot of sales on his website which he decided to call Azamon. His big problem, you think, is that he's not ranking high enough on the search engines. If only he could rename his p... | [
{
"input": {
"stdin": "3\nAZAMON APPLE\nAZAMON AAAAAAAAAAALIBABA\nAPPLE BANANA\n"
},
"output": {
"stdout": "AAZMON\n---\nAEPLP\n"
}
},
{
"input": {
"stdin": "3\nAZAMON APPLE\nAZAMON AAAAAAAAAAALIBABA\nAPPLE BANANA\n"
},
"output": {
"stdout": "AAZMON\n---\nAEPL... | {
"tags": [
"greedy"
],
"title": "Azamon Web Services"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nlong long check(string a, string b) {\n for (long long i = 0; i < min(a.size(), b.size()); i++) {\n if (a[i] > b[i])\n return 0;\n else if (a[i] < b[i])\n return 1;\n }\n if (a.size() < b.size())\n return 1;\n else\n return 0;\n}\nvoi... |
Codeforces/1301/B | # Motarack's Birthday
Dark is going to attend Motarack's birthday. Dark decided that the gift he is going to give to Motarack is an array a of n non-negative integers.
Dark created that array 1000 years ago, so some elements in that array disappeared. Dark knows that Motarack hates to see an array that has two adjace... | [
{
"input": {
"stdin": "7\n5\n-1 10 -1 12 -1\n5\n-1 40 35 -1 35\n6\n-1 -1 9 -1 3 -1\n2\n-1 -1\n2\n0 -1\n4\n1 -1 3 -1\n7\n1 -1 7 5 2 -1 5\n"
},
"output": {
"stdout": "1 11\n5 37\n3 6\n0 0\n0 0\n1 2\n3 4\n"
}
},
{
"input": {
"stdin": "7\n5\n-1 10 -1 12 -1\n5\n-1 40 35 -1 35\n6... | {
"tags": [
"binary search",
"greedy",
"ternary search"
],
"title": "Motarack's Birthday"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nlong long int fa[1022];\nlong long int powe(long long int d, long long int s) {\n if (s == 1)\n return d;\n else if (s == 0)\n return 1;\n else {\n long long int u, v = d;\n for (u = 1; u < s; u++) {\n d = d * v;\n }\n return d;\n }\... |
Codeforces/1325/B | # CopyCopyCopyCopyCopy
Ehab has an array a of length n. He has just enough free time to make a new array consisting of n copies of the old array, written back-to-back. What will be the length of the new array's longest increasing subsequence?
A sequence a is a subsequence of an array b if a can be obtained from b by ... | [
{
"input": {
"stdin": "2\n3\n3 2 1\n6\n3 1 4 1 5 9\n"
},
"output": {
"stdout": "3\n5\n"
}
},
{
"input": {
"stdin": "1\n5\n1 3 4 5 2\n"
},
"output": {
"stdout": "5\n"
}
},
{
"input": {
"stdin": "1\n3\n1 1 274005660\n"
},
"output": {
... | {
"tags": [
"greedy",
"implementation"
],
"title": "CopyCopyCopyCopyCopy"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nconst long long MOD = 1000000007;\nint dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};\nint dy8[] = {1, -1, 1, -1, 0, 0, -1, 1};\nint dx4[] = {0, 0, 1, -1};\nint dy4[] = {1, -1, 0, 0};\nconst int maxx = 100005;\nbool sortinrev(const pair<int, int> &a, const pair<int, int... |
Codeforces/1344/A | # Hilbert's Hotel
Hilbert's Hotel is a very unusual hotel since the number of rooms is infinite! In fact, there is exactly one room for every integer, including zero and negative integers. Even stranger, the hotel is currently at full capacity, meaning there is exactly one guest in every room. The hotel's manager, Dav... | [
{
"input": {
"stdin": "6\n1\n14\n2\n1 -1\n4\n5 5 5 1\n3\n3 2 1\n2\n0 1\n5\n-239 -2 -100 -3 -11\n"
},
"output": {
"stdout": "YES\nYES\nYES\nNO\nNO\nYES\n"
}
},
{
"input": {
"stdin": "10\n3\n-15 -33 79\n16\n45 -84 19 85 69 -64 93 -70 0 -53 2 -52 -55 66 33 -60\n2\n14 -2\n4\n-6... | {
"tags": [
"math",
"number theory",
"sortings"
],
"title": "Hilbert's Hotel"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\ninline int read() {\n int x = 0, f = 1;\n char c = getchar();\n for (; !isdigit(c); c = getchar())\n if (c == '-') f = -1;\n for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';\n return x * f;\n}\nmap<int, int> mp;\ninline void solve() {\n int N =... |
Codeforces/1366/A | # Shovels and Swords
Polycarp plays a well-known computer game (we won't mention its name). In this game, he can craft tools of two types — shovels and swords. To craft a shovel, Polycarp spends two sticks and one diamond; to craft a sword, Polycarp spends two diamonds and one stick.
Each tool can be sold for exactly... | [
{
"input": {
"stdin": "4\n4 4\n1000000000 0\n7 15\n8 7\n"
},
"output": {
"stdout": "2\n0\n7\n5\n"
}
},
{
"input": {
"stdin": "1\n656 656\n"
},
"output": {
"stdout": "437\n"
}
},
{
"input": {
"stdin": "1\n666 666\n"
},
"output": {
... | {
"tags": [
"binary search",
"greedy",
"math"
],
"title": "Shovels and Swords"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n int t;\n cin >> t;\n while (t--) {\n long long int a, b;\n cin >> a >> b;\n long long int l = min(min(a, b), (a + b) / 3);\n cout << l << endl;\n }\n}\n",
"java": "//package learning;\nimport java.util.*;\nimport java.io.*;\nim... |
Codeforces/1386/A | # Colors
Linda likes to change her hair color from time to time, and would be pleased if her boyfriend Archie would notice the difference between the previous and the new color. Archie always comments on Linda's hair color if and only if he notices a difference — so Linda always knows whether Archie has spotted the di... | [
{
"input": {
"stdin": "1\n\n7\n\n1\n\n1\n\n0\n\n0\n\n1\n"
},
"output": {
"stdout": "? 3\n? 6\n? 5\n? 7\n= 3\n"
}
},
{
"input": {
"stdin": "46\n63 1\n63 63\n123 1\n123 123\n63 2\n63 62\n123 2\n123 122\n63 3\n63 61\n123 3\n123 121\n63 4\n63 60\n123 4\n123 120\n63 5\n63 59\n12... | {
"tags": [
"*special",
"binary search",
"constructive algorithms",
"interactive"
],
"title": "Colors"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nusing vi = vector<long long>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing vvvvi = vector<vvvi>;\nusing vp = vector<pair<long long, long long> >;\nusing vvp = vector<vp>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\nconst long long inf = 1... |
Codeforces/1408/A | # Circle Coloring
You are given three sequences: a_1, a_2, …, a_n; b_1, b_2, …, b_n; c_1, c_2, …, c_n.
For each i, a_i ≠ b_i, a_i ≠ c_i, b_i ≠ c_i.
Find a sequence p_1, p_2, …, p_n, that satisfy the following conditions:
* p_i ∈ \\{a_i, b_i, c_i\}
* p_i ≠ p_{(i mod n) + 1}.
In other words, for each element, ... | [
{
"input": {
"stdin": "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 2 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n"
},
"output": {
"stdout": "1 2 3\n1 2 1 2\n1 3 4 1 2 1 4\n1 2 3\n1 2 1 2... | {
"tags": [
"constructive algorithms"
],
"title": "Circle Coloring"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nint a[110], b[110], c[110];\nint main() {\n int t;\n scanf(\"%d\", &t);\n while (t--) {\n int n;\n scanf(\"%d\", &n);\n for (int i = 1; i <= n; i++) scanf(\"%d\", &a[i]);\n for (int i = 1; i <= n; i++) scanf(\"%d\", &b[i]);\n for (int i = 1; ... |
Codeforces/1428/D | # Bouncing Boomerangs
To improve the boomerang throwing skills of the animals, Zookeeper has set up an n × n grid with some targets, where each row and each column has at most 2 targets each. The rows are numbered from 1 to n from top to bottom, and the columns are numbered from 1 to n from left to right.
For each c... | [
{
"input": {
"stdin": "1\n0\n"
},
"output": {
"stdout": "0\n\n"
}
},
{
"input": {
"stdin": "6\n2 0 3 0 1 1\n"
},
"output": {
"stdout": "5\n6 6\n5 5\n4 3\n4 5\n6 1\n"
}
},
{
"input": {
"stdin": "6\n3 2 2 2 1 1\n"
},
"output": {
"... | {
"tags": [
"constructive algorithms",
"greedy",
"implementation"
],
"title": "Bouncing Boomerangs"
} | {
"cpp": "#include <bits/stdc++.h>\n#pragma GCC optimize(\"O3\")\nusing namespace std;\ntemplate <class c>\nstruct rge {\n c b, e;\n};\ntemplate <class c>\nrge<c> range(c i, c j) {\n return rge<c>{i, j};\n}\ntemplate <class c>\nauto dud(c* x) -> decltype(cerr << *x, 0);\ntemplate <class c>\nchar dud(...);\nstruct d... |
Codeforces/1451/D | # Circle Game
Utkarsh is forced to play yet another one of Ashish's games. The game progresses turn by turn and as usual, Ashish moves first.
Consider the 2D plane. There is a token which is initially at (0,0). In one move a player must increase either the x coordinate or the y coordinate of the token by exactly k. I... | [
{
"input": {
"stdin": "5\n2 1\n5 2\n10 3\n25 4\n15441 33\n"
},
"output": {
"stdout": "\nUtkarsh\nAshish\nUtkarsh\nUtkarsh\nAshish\n"
}
},
{
"input": {
"stdin": "5\n3 1\n1 1\n10 3\n22 5\n25479 33\n"
},
"output": {
"stdout": "Utkarsh\nAshish\nUtkarsh\nUtkarsh\nA... | {
"tags": [
"games",
"geometry",
"math"
],
"title": "Circle Game"
} | {
"cpp": "#include <iostream>\n#include <vector>\n#include <string>\n#include <set>\n#include <algorithm>\n#include <map>\n\nusing namespace std;\n\nint main() {\n int t;\n cin>>t;\n for (int re=0; re<t; re++) {\n long long d, k;\n cin>>d>>k;\n long long A=0;\n for (long long a... |
Codeforces/1475/D | # Cleaning the Phone
Polycarp often uses his smartphone. He has already installed n applications on it. Application with number i takes up a_i units of memory.
Polycarp wants to free at least m units of memory (by removing some applications).
Of course, some applications are more important to Polycarp than others. H... | [
{
"input": {
"stdin": "5\n5 7\n5 3 2 1 4\n2 1 1 2 1\n1 3\n2\n1\n5 10\n2 3 2 3 2\n1 2 1 2 1\n4 10\n5 1 3 4\n1 2 1 2\n4 5\n3 2 1 2\n2 1 2 1\n"
},
"output": {
"stdout": "\n2\n-1\n6\n4\n3\n"
}
},
{
"input": {
"stdin": "1\n17 20\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 6 10 10\n1 1 1 1 1 1 ... | {
"tags": [
"binary search",
"dp",
"sortings",
"two pointers"
],
"title": "Cleaning the Phone"
} | {
"cpp": "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define PI 3.14159265\nll mod = 1000000007;\ntemplate<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }\ntemplate<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }\nint main() \n{\n #ifndef ONL... |
Codeforces/1500/B | # Two chandeliers
Vasya is a CEO of a big construction company. And as any other big boss he has a spacious, richly furnished office with two crystal chandeliers. To stay motivated Vasya needs the color of light at his office to change every day. That's why he ordered both chandeliers that can change its color cyclica... | [
{
"input": {
"stdin": "3 8 41\n1 3 2\n1 6 4 3 5 7 2 8\n"
},
"output": {
"stdout": "\n47\n"
}
},
{
"input": {
"stdin": "1 2 31\n1\n1 2\n"
},
"output": {
"stdout": "\n62\n"
}
},
{
"input": {
"stdin": "4 2 4\n4 2 3 1\n2 1\n"
},
"output":... | {
"tags": [
"binary search",
"brute force",
"chinese remainder theorem",
"math",
"number theory"
],
"title": "Two chandeliers"
} | {
"cpp": "#include<bits/stdc++.h>\n#include<unordered_map>\n#include<unordered_set>\n#define f(i,a,b) for( int i=a;i<=b;++i)\n#define ff(i,a,b) for( int i=a;i>=b;--i)\n#define debug(x) cerr << #x << \" : \" << x << \" \" << endl\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef lo... |
Codeforces/1525/D | # Armchairs
There are n armchairs, numbered from 1 to n from left to right. Some armchairs are occupied by people (at most one person per armchair), others are not. The number of occupied armchairs is not greater than n/2.
For some reason, you would like to tell people to move from their armchairs to some other ones.... | [
{
"input": {
"stdin": "6\n1 1 1 0 0 0\n"
},
"output": {
"stdout": "\n9\n"
}
},
{
"input": {
"stdin": "5\n0 0 0 0 0\n"
},
"output": {
"stdout": "\n0\n"
}
},
{
"input": {
"stdin": "7\n1 0 0 1 0 0 1\n"
},
"output": {
"stdout": "\n3... | {
"tags": [
"dp",
"flows",
"graph matchings",
"greedy"
],
"title": "Armchairs"
} | {
"cpp": "#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\n#include<string>\n#include<cstring>\n#include<queue>\n#include<vector>\n#include<stack>\n#include<map>\n#define ll long long\n\nusing namespace std;\nconst int INF = 0x3f3f3f3f;\nconst int maxn = 1e6+5;\n\nint a[maxn],y[maxn],my[max... |
Codeforces/157/A | # Game Outcome
Sherlock Holmes and Dr. Watson played some game on a checkered board n × n in size. During the game they put numbers on the board's squares by some tricky rules we don't know. However, the game is now over and each square of the board contains exactly one number. To understand who has won, they need to ... | [
{
"input": {
"stdin": "1\n1\n"
},
"output": {
"stdout": "0\n"
}
},
{
"input": {
"stdin": "2\n1 2\n3 4\n"
},
"output": {
"stdout": "2\n"
}
},
{
"input": {
"stdin": "4\n5 7 8 4\n9 5 3 2\n1 6 6 4\n9 5 7 3\n"
},
"output": {
"stdout"... | {
"tags": [
"brute force"
],
"title": "Game Outcome"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nint gcd(int p, int q) { return q == 0 ? p : gcd(q, p % q); }\nint main() {\n int n, num[35][35], sumh[35], suml[35];\n cin >> n;\n memset(sumh, 0, sizeof(sumh));\n memset(suml, 0, sizeof(suml));\n for (int i = 1; i <= n; i++) {\n for (int j = 1; j <= n... |
Codeforces/178/A1 | # Educational Game
The Smart Beaver from ABBYY began to develop a new educational game for children. The rules of the game are fairly simple and are described below.
The playing field is a sequence of n non-negative integers ai numbered from 1 to n. The goal of the game is to make numbers a1, a2, ..., ak (i.e. some p... | [
{
"input": {
"stdin": "8\n1 2 3 4 5 6 7 8\n"
},
"output": {
"stdout": "1\n3\n6\n10\n16\n24\n40\n"
}
},
{
"input": {
"stdin": "4\n1 0 1 2\n"
},
"output": {
"stdout": "1\n1\n3\n"
}
},
{
"input": {
"stdin": "80\n72 66 82 46 44 22 63 92 71 65 5 3... | {
"tags": [
"greedy"
],
"title": "Educational Game"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nint *p;\nint n;\nint main() {\n cin >> n;\n p = new int[n];\n for (int i = 0; i < n; i++) cin >> p[i];\n int ans = 0;\n for (int i = 0; i < n - 1; i++) {\n while (p[i] > 0) {\n int t = log2(n);\n while (i + (2 << t) >= n && t) t--;\n p[i... |
Codeforces/19/B | # Checkout Assistant
Bob came to a cash & carry store, put n items into his trolley, and went to the checkout counter to pay. Each item is described by its price ci and time ti in seconds that a checkout assistant spends on this item. While the checkout assistant is occupied with some item, Bob can steal some other it... | [
{
"input": {
"stdin": "4\n2 10\n0 20\n1 5\n1 3\n"
},
"output": {
"stdout": "8"
}
},
{
"input": {
"stdin": "3\n0 1\n0 10\n0 100\n"
},
"output": {
"stdout": "111"
}
},
{
"input": {
"stdin": "5\n0 968804136\n0 736567537\n2 343136264\n0 259899572... | {
"tags": [
"dp"
],
"title": "Checkout Assistant"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nlong long dp[2005][2005];\nvector<pair<long long, long long> > a;\nlong long func(long long i, long long j) {\n if (i < 0) {\n if (j == 0) {\n return 0;\n }\n return 1e18;\n }\n if (dp[i][j] != -1) {\n return dp[i][j];\n }\n long long k =... |
Codeforces/223/C | # Partial Sums
You've got an array a, consisting of n integers. The array elements are indexed from 1 to n. Let's determine a two step operation like that:
1. First we build by the array a an array s of partial sums, consisting of n elements. Element number i (1 ≤ i ≤ n) of array s equals <image>. The operation x m... | [
{
"input": {
"stdin": "5 0\n3 14 15 92 6\n"
},
"output": {
"stdout": "3 14 15 92 6 "
}
},
{
"input": {
"stdin": "3 1\n1 2 3\n"
},
"output": {
"stdout": "1 3 6 "
}
},
{
"input": {
"stdin": "10 1000000\n1 2 3 4 84 5 6 7 8 9\n"
},
"outpu... | {
"tags": [
"combinatorics",
"math",
"number theory"
],
"title": "Partial Sums"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nconst int mod = int(1e9 + 7);\nint n, a[2222], k, c[2222], b[2222];\nint modPow(int a, int b) {\n int res = 1;\n while (b > 0) {\n if (b & 1) {\n res = (1LL * a * res) % mod;\n }\n b >>= 1;\n a = (1LL * a * a) % mod;\n }\n return res;\n}\n... |
Codeforces/248/A | # Cupboards
One foggy Stockholm morning, Karlsson decided to snack on some jam in his friend Lillebror Svantenson's house. Fortunately for Karlsson, there wasn't anybody in his friend's house. Karlsson was not going to be hungry any longer, so he decided to get some food in the house.
Karlsson's gaze immediately fell... | [
{
"input": {
"stdin": "5\n0 1\n1 0\n0 1\n1 1\n0 1\n"
},
"output": {
"stdout": "3\n"
}
},
{
"input": {
"stdin": "8\n0 1\n1 0\n0 1\n1 1\n0 1\n1 0\n0 1\n1 0\n"
},
"output": {
"stdout": "7\n"
}
},
{
"input": {
"stdin": "8\n1 0\n1 0\n1 0\n0 1\n0 1... | {
"tags": [
"implementation"
],
"title": "Cupboards"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n ios_base::sync_with_stdio(0);\n long long n, cnt1 = 0, cnt2 = 0, l, r;\n cin >> n;\n for (int i = 0; i < n; i++) {\n cin >> l >> r;\n cnt1 += l;\n cnt2 += r;\n }\n cout << min(cnt1, n - cnt1) + min(cnt2, n - cnt2);\n}\n",
"java"... |
Codeforces/272/B | # Dima and Sequence
Dima got into number sequences. Now he's got sequence a1, a2, ..., an, consisting of n positive integers. Also, Dima has got a function f(x), which can be defined with the following recurrence:
* f(0) = 0;
* f(2·x) = f(x);
* f(2·x + 1) = f(x) + 1.
Dima wonders, how many pairs of indexe... | [
{
"input": {
"stdin": "3\n1 2 4\n"
},
"output": {
"stdout": "3"
}
},
{
"input": {
"stdin": "3\n5 3 1\n"
},
"output": {
"stdout": "1"
}
},
{
"input": {
"stdin": "6\n396640239 62005863 473635171 329666981 510631133 207643327\n"
},
"outp... | {
"tags": [
"implementation",
"math"
],
"title": "Dima and Sequence"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nconst int maxN = 100000 + 100;\nconst int maxValue = 100000 + 10;\nlong long a[maxN];\nlong long f[maxValue];\nlong long get(long long x) {\n long long ans = 0;\n while (x != 0) {\n ans += x % 2;\n x /= 2;\n }\n return ans;\n}\nint main() {\n int n;... |
Codeforces/295/D | # Greg and Caves
Greg has a pad. The pad's screen is an n × m rectangle, each cell can be either black or white. We'll consider the pad rows to be numbered with integers from 1 to n from top to bottom. Similarly, the pad's columns are numbered with integers from 1 to m from left to right.
Greg thinks that the pad's s... | [
{
"input": {
"stdin": "3 5\n"
},
"output": {
"stdout": "451\n"
}
},
{
"input": {
"stdin": "1 1\n"
},
"output": {
"stdout": "0\n"
}
},
{
"input": {
"stdin": "4 4\n"
},
"output": {
"stdout": "485\n"
}
},
{
"input": {
... | {
"tags": [
"combinatorics",
"dp"
],
"title": "Greg and Caves"
} | {
"cpp": "/* 2013-07-26 11:30:35.756820 */#include<cstdio>\nusing namespace std;\n\nconst int N = 2010;\n\ntypedef long long LL;\nconst LL MOD = 1e9 + 7;\n\nLL dp[N][N], sp[N][N], pp[N][N], qp[N][N], qq[N][N], ss[N][N];\nint n, m;\n\nvoid F(LL &a) {\n\tif (a >= MOD) a %= MOD;\n\twhile (a < 0) a += MOD;\n}\n\nint main... |
Codeforces/319/B | # Psychos in a Line
There are n psychos standing in a line. Each psycho is assigned a unique integer from 1 to n. At each step every psycho who has an id greater than the psycho to his right (if exists) kills his right neighbor in the line. Note that a psycho might kill and get killed at the same step.
You're given ... | [
{
"input": {
"stdin": "6\n1 2 3 4 5 6\n"
},
"output": {
"stdout": "0\n"
}
},
{
"input": {
"stdin": "10\n10 9 7 8 6 5 3 4 2 1\n"
},
"output": {
"stdout": "2\n"
}
},
{
"input": {
"stdin": "2\n1 2\n"
},
"output": {
"stdout": "0\n"
... | {
"tags": [
"data structures",
"implementation"
],
"title": "Psychos in a Line"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nconst int maxn = 1e5 + 100;\nvector<int> adj[maxn];\nint a[maxn];\nbool mark[maxn];\nint dfs(int v) {\n int ret = 0;\n for (auto u : adj[v]) ret = max(ret + 1, dfs(u));\n return ret;\n}\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(0);\n co... |
Codeforces/343/B | # Alternating Current
Mad scientist Mike has just finished constructing a new device to search for extraterrestrial intelligence! He was in such a hurry to launch it for the first time that he plugged in the power wires without giving it a proper glance and started experimenting right away. After a while Mike observed... | [
{
"input": {
"stdin": "-++-\n"
},
"output": {
"stdout": "YES\n"
}
},
{
"input": {
"stdin": "++\n"
},
"output": {
"stdout": "YES\n"
}
},
{
"input": {
"stdin": "+-\n"
},
"output": {
"stdout": "NO\n"
}
},
{
"input": {
... | {
"tags": [
"data structures",
"greedy",
"implementation"
],
"title": "Alternating Current"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n string wire;\n cin >> wire;\n stack<int> st;\n for (int i = 0; i < wire.length(); i++) {\n if (!st.empty())\n if (wire[i] == st.top())\n st.pop();\n else\n st.push(wire[i]);\n else\n st.push(wire[i]);\n }\... |
Codeforces/366/D | # Dima and Trap Graph
Dima and Inna love spending time together. The problem is, Seryozha isn't too enthusiastic to leave his room for some reason. But Dima and Inna love each other so much that they decided to get criminal...
Dima constructed a trap graph. He shouted: "Hey Seryozha, have a look at my cool graph!" to... | [
{
"input": {
"stdin": "4 4\n1 2 1 10\n2 4 3 5\n1 3 1 5\n2 4 2 7\n"
},
"output": {
"stdout": "6\n"
}
},
{
"input": {
"stdin": "5 6\n1 2 1 10\n2 5 11 20\n1 4 2 5\n1 3 10 11\n3 4 12 10000\n4 5 6 6\n"
},
"output": {
"stdout": "Nice work, Dima!\n"
}
},
{
... | {
"tags": [
"binary search",
"data structures",
"dfs and similar",
"dsu",
"shortest paths",
"two pointers"
],
"title": "Dima and Trap Graph"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nconst int MAXN = (int)(1e3) + 100;\nconst int INF = (1 << 30);\nconst double PI = acos(-1.0);\nconst double EPS = (1e-6);\nvector<pair<int, pair<int, int> > > g[MAXN];\nbool used[MAXN];\nint n, m, ans = -INF;\nset<int> second;\nvoid dfs(int v, int L, int R) {\... |
Codeforces/38/C | # Blinds
The blinds are known to consist of opaque horizontal stripes that can be rotated thus regulating the amount of light flowing in the room. There are n blind stripes with the width of 1 in the factory warehouse for blind production. The problem is that all of them are spare details from different orders, that i... | [
{
"input": {
"stdin": "5 3\n5 5 7 3 1\n"
},
"output": {
"stdout": "15\n"
}
},
{
"input": {
"stdin": "4 2\n1 2 3 4\n"
},
"output": {
"stdout": "8\n"
}
},
{
"input": {
"stdin": "2 3\n1 2\n"
},
"output": {
"stdout": "0\n"
}
}... | {
"tags": [
"brute force"
],
"title": "Blinds"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n int lenght[128];\n int n, l, maxx = -1;\n scanf(\"%d %d\", &n, &l);\n for (int i = 0; i < n; i++) {\n scanf(\"%d\", &lenght[i]);\n maxx = max(maxx, lenght[i]);\n }\n int res = 0;\n for (int len = l; len <= maxx; len++) {\n int te... |
Codeforces/40/B | # Repaintings
A chessboard n × m in size is given. During the zero minute we repaint all the black squares to the 0 color. During the i-th minute we repaint to the i color the initially black squares that have exactly four corner-adjacent squares painted i - 1 (all such squares are repainted simultaneously). This proc... | [
{
"input": {
"stdin": "1 1\n1\n"
},
"output": {
"stdout": "1\n"
}
},
{
"input": {
"stdin": "3 3\n2\n"
},
"output": {
"stdout": "1\n"
}
},
{
"input": {
"stdin": "3 3\n1\n"
},
"output": {
"stdout": "4\n"
}
},
{
"input"... | {
"tags": [
"math"
],
"title": "Repaintings"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\ndouble eps = 1e-7;\nint getCountBySize(int a, int b) {\n if (a <= 0 || b <= 0) return 0;\n if (a % 2 && b % 2) return a * b / 2 + 1;\n return a * b / 2;\n}\nint main() {\n int a, b, x;\n cin >> a >> b >> x;\n x--;\n cout << getCountBySize(a - 2 * x, b -... |
Codeforces/438/A | # The Child and Toy
On Children's Day, the child got a toy from Delayyy as a present. However, the child is so naughty that he can't wait to destroy the toy.
The toy consists of n parts and m ropes. Each rope links two parts, but every pair of parts is linked by at most one rope. To split the toy, the child must remo... | [
{
"input": {
"stdin": "4 4\n100 100 100 100\n1 2\n2 3\n2 4\n3 4\n"
},
"output": {
"stdout": "400\n"
}
},
{
"input": {
"stdin": "4 3\n10 20 30 40\n1 4\n1 2\n2 3\n"
},
"output": {
"stdout": "40\n"
}
},
{
"input": {
"stdin": "7 10\n40 10 20 10 2... | {
"tags": [
"graphs",
"greedy",
"sortings"
],
"title": "The Child and Toy"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nlong long MOD = 1000000007;\nlong double EPS = 1e-10;\nlong double PI = acos(-1.0);\ndouble tick() {\n static clock_t oldt;\n clock_t newt = clock();\n double diff = 1.0 * (newt - oldt) / CLOCKS_PER_SEC;\n oldt = newt;\n return diff;\n}\ntemplate <typenam... |
Codeforces/45/H | # Road Problem
The Berland capital (as you very well know) contains n junctions, some pairs of which are connected by two-way roads. Unfortunately, the number of traffic jams in the capital has increased dramatically, that's why it was decided to build several new roads. Every road should connect two junctions.
The ... | [
{
"input": {
"stdin": "4 4\n1 2\n2 3\n2 4\n3 4\n"
},
"output": {
"stdout": "1\n1 3\n"
}
},
{
"input": {
"stdin": "4 3\n1 2\n2 3\n3 4\n"
},
"output": {
"stdout": "1\n1 4\n"
}
},
{
"input": {
"stdin": "10 9\n7 9\n8 9\n8 2\n10 6\n8 3\n9 4\n2 6\n... | {
"tags": [
"graphs"
],
"title": "Road Problem"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nstruct Edge {\n int v, next;\n} edge[1050 * 1050 * 2];\nint e, first[1050];\nint n, lv, pre[1050];\nset<pair<int, int> > st;\npair<int, int> p1[1050 * 1050], p2[1050 * 1050];\nint m;\nint cnt, low[1050], dfn[1050];\nbool flag[1050];\nint dist[1050];\nint from... |
Codeforces/483/B | # Friends and Presents
You have two friends. You want to present each of them several positive integers. You want to present cnt1 numbers to the first friend and cnt2 numbers to the second friend. Moreover, you want all presented numbers to be distinct, that also means that no number should be presented to both friend... | [
{
"input": {
"stdin": "3 1 2 3\n"
},
"output": {
"stdout": "5\n"
}
},
{
"input": {
"stdin": "1 3 2 3\n"
},
"output": {
"stdout": "4\n"
}
},
{
"input": {
"stdin": "1 999999999 29983 29989\n"
},
"output": {
"stdout": "1000033345\n... | {
"tags": [
"binary search",
"math"
],
"title": "Friends and Presents"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nsigned main(void) {\n ios::sync_with_stdio(false);\n register long long A, B, X, Y;\n cin >> A >> B >> X >> Y;\n cout << (long long)floor(max(\n 1.0 * (A + B - 1) / (X * Y - 1) * X * Y,\n max(1.0 * (A - 1) / (X - 1) * X, 1.0 * (B ... |
Codeforces/507/B | # Amr and Pins
Amr loves Geometry. One day he came up with a very interesting problem.
Amr has a circle of radius r and center in point (x, y). He wants the circle center to be in new position (x', y').
In one step Amr can put a pin to the border of the circle in a certain point, then rotate the circle around that p... | [
{
"input": {
"stdin": "1 1 1 4 4\n"
},
"output": {
"stdout": "3\n"
}
},
{
"input": {
"stdin": "2 0 0 0 4\n"
},
"output": {
"stdout": "1\n"
}
},
{
"input": {
"stdin": "4 5 6 5 6\n"
},
"output": {
"stdout": "0\n"
}
},
{
... | {
"tags": [
"geometry",
"math"
],
"title": "Amr and Pins"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n double r, x, y, x1, y1;\n cin >> r >> x >> y >> x1 >> y1;\n int an =\n ceil(sqrt(((x - x1) * (x - x1)) + ((y - y1) * (y - y1))) / (2.000 * r));\n cout << an;\n}\n",
"java": "import java.io.BufferedReader;\nimport java.io.File;\nimport... |
Codeforces/530/C | # Diophantine equation
You are given an equation A * X + B * Y = C, A, B, C are positive integer coefficients, X and Y are variables which can have positive integer values only. Output the number of solutions of this equation and the solutions themselves.
Input
The only line of input contains integers A, B and C (1 ... | [
{
"input": {
"stdin": "3 5 35\n"
},
"output": {
"stdout": "2\n5 4\n10 1\n"
}
},
{
"input": {
"stdin": "3 35 5\n"
},
"output": {
"stdout": "0\n"
}
}
] | {
"tags": [
"*special"
],
"title": "Diophantine equation"
} | {
"cpp": null,
"java": null,
"python": null
} |
Codeforces/556/C | # Case of Matryoshkas
Andrewid the Android is a galaxy-famous detective. He is now investigating the case of vandalism at the exhibition of contemporary art.
The main exhibit is a construction of n matryoshka dolls that can be nested one into another. The matryoshka dolls are numbered from 1 to n. A matryoshka with a... | [
{
"input": {
"stdin": "3 2\n2 1 2\n1 3\n"
},
"output": {
"stdout": "1\n"
}
},
{
"input": {
"stdin": "7 3\n3 1 3 7\n2 2 5\n2 4 6\n"
},
"output": {
"stdout": "10\n"
}
},
{
"input": {
"stdin": "100 3\n45 1 2 3 4 5 6 7 8 9 19 21 24 27 28 30 34 35... | {
"tags": [
"implementation"
],
"title": "Case of Matryoshkas"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nint a[100010];\nint main() {\n int i, n, t, k, j, m, s1;\n cin >> n >> k;\n s1 = n - k + n - 1;\n for (i = 0; i < k; i++) {\n cin >> m;\n for (j = 0; j < m; j++) {\n cin >> a[j];\n }\n if (a[0] == 1) {\n j = 1;\n while (a[j] == a... |
Codeforces/582/A | # GCD Table
The GCD table G of size n × n for an array of positive integers a of length n is defined by formula
<image>
Let us remind you that the greatest common divisor (GCD) of two positive integers x and y is the greatest integer that is divisor of both x and y, it is denoted as <image>. For example, for array ... | [
{
"input": {
"stdin": "4\n2 1 2 3 4 3 2 6 1 1 2 2 1 2 3 2\n"
},
"output": {
"stdout": "6 4 3 2 "
}
},
{
"input": {
"stdin": "1\n42\n"
},
"output": {
"stdout": "42 "
}
},
{
"input": {
"stdin": "2\n1 1 1 1\n"
},
"output": {
"stdou... | {
"tags": [
"constructive algorithms",
"greedy",
"number theory"
],
"title": "GCD Table"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nint gcd(int a, int b) {\n if (!b) return a;\n return gcd(b, a % b);\n}\nclass Comp {\n public:\n bool operator()(int a, int b) const { return a > b; }\n};\nint main() {\n int n;\n cin >> n;\n map<int, int, Comp> a;\n vector<int> ans;\n for (int i{0}; i... |
Codeforces/604/A | # Uncowed Forces
Kevin Sun has just finished competing in Codeforces Round #334! The round was 120 minutes long and featured five problems with maximum point values of 500, 1000, 1500, 2000, and 2500, respectively. Despite the challenging tasks, Kevin was uncowed and bulldozed through all of them, distinguishing himse... | [
{
"input": {
"stdin": "20 40 60 80 100\n0 1 2 3 4\n1 0\n"
},
"output": {
"stdout": "4900\n"
}
},
{
"input": {
"stdin": "119 119 119 119 119\n0 0 0 0 0\n10 0\n"
},
"output": {
"stdout": "4930\n"
}
},
{
"input": {
"stdin": "36 102 73 101 19\n5 ... | {
"tags": [
"implementation"
],
"title": "Uncowed Forces"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n std::ios_base::sync_with_stdio(0);\n int n, i, j, k, cnt;\n long double p[] = {500, 1000, 1500, 2000, 2500};\n long double m[10], w[10], s, u, sum = 0;\n for (i = 0; i <= 4; i++) cin >> m[i];\n for (i = 0; i <= 4; i++) cin >> w[i];\n cin ... |
Codeforces/626/D | # Jerry's Protest
Andrew and Jerry are playing a game with Harry as the scorekeeper. The game consists of three rounds. In each round, Andrew and Jerry draw randomly without replacement from a jar containing n balls, each labeled with a distinct positive integer. Without looking, they hand their balls to Harry, who aw... | [
{
"input": {
"stdin": "3\n1 2 10\n"
},
"output": {
"stdout": "0.0740740741"
}
},
{
"input": {
"stdin": "2\n1 2\n"
},
"output": {
"stdout": "0.0000000000"
}
},
{
"input": {
"stdin": "11\n54 91 4 6 88 23 38 71 77 26 84\n"
},
"output": {... | {
"tags": [
"brute force",
"combinatorics",
"dp",
"probabilities"
],
"title": "Jerry's Protest"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\ndouble diffprob[5010], ssum[5010];\nint balls[5010], N;\nint main() {\n cin.sync_with_stdio(0);\n cin.tie(0);\n cin >> N;\n for (int i = 0; i < N; ++i) {\n cin >> balls[i];\n for (int j = i - 1; j >= 0; --j) {\n diffprob[abs(balls[i] - balls[j])... |
Codeforces/650/B | # Image Preview
Vasya's telephone contains n photos. Photo number 1 is currently opened on the phone. It is allowed to move left and right to the adjacent photo by swiping finger over the screen. If you swipe left from the first photo, you reach photo n. Similarly, by swiping right from the last photo you reach photo ... | [
{
"input": {
"stdin": "5 2 4 13\nhhwhh\n"
},
"output": {
"stdout": "4"
}
},
{
"input": {
"stdin": "3 1 100 10\nwhw\n"
},
"output": {
"stdout": "0"
}
},
{
"input": {
"stdin": "5 2 4 1000\nhhwhh\n"
},
"output": {
"stdout": "5"
... | {
"tags": [
"binary search",
"brute force",
"dp",
"two pointers"
],
"title": "Image Preview"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nlong long n, x, y, i, j, t, aa, s1[500010], s2[500010], a, b, T, ans, anss, p;\nchar c[500010];\nlong long cal(long long z, long long xx, long long yy) {\n if (z < s2[n]) return n + 1;\n long long m, x = xx, y = yy;\n while (x < y) {\n m = (x + y) / 2;\n... |
Codeforces/675/E | # Trains and Statistic
Vasya commutes by train every day. There are n train stations in the city, and at the i-th station it's possible to buy only tickets to stations from i + 1 to ai inclusive. No tickets are sold at the last station.
Let ρi, j be the minimum number of tickets one needs to buy in order to get from ... | [
{
"input": {
"stdin": "4\n4 4 4\n"
},
"output": {
"stdout": "6\n"
}
},
{
"input": {
"stdin": "5\n2 3 5 5\n"
},
"output": {
"stdout": "17\n"
}
},
{
"input": {
"stdin": "7\n7 3 4 6 6 7\n"
},
"output": {
"stdout": "35\n"
}
},... | {
"tags": [
"data structures",
"dp",
"greedy"
],
"title": "Trains and Statistic"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nconst long long mx = 1e5 + 66;\nconst long long mod = 1e9 + 7;\nconst long long inf = 8e18 + 66;\nconst int llg = 18;\nconst long long mxk = 31700000;\nlong long power(long long a, long long b, long long md) {\n if (b == 0) return 1;\n long long c = power(a,... |
Codeforces/699/F | # Limak and Shooting Points
Bearland is a dangerous place. Limak can’t travel on foot. Instead, he has k magic teleportation stones. Each stone can be used at most once. The i-th stone allows to teleport to a point (axi, ayi). Limak can use stones in any order.
There are n monsters in Bearland. The i-th of them stand... | [
{
"input": {
"stdin": "3 8\n10 20\n0 0\n20 40\n300 600\n30 60\n170 340\n50 100\n28 56\n90 180\n-4 -8\n-1 -2\n"
},
"output": {
"stdout": "5\n"
}
},
{
"input": {
"stdin": "2 4\n-2 -1\n4 5\n4 2\n2 1\n4 -1\n1 -1\n"
},
"output": {
"stdout": "3\n"
}
},
{
... | {
"tags": [
"brute force",
"geometry",
"math"
],
"title": "Limak and Shooting Points"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nstruct Point {\n Point() {}\n Point(long long xx, long long yy) : x(xx), y(yy) {}\n long long x;\n long long y;\n};\nconst int N = 1005;\nconst int K = 8;\nint n, k;\nPoint m[N];\nPoint p[K];\nint srt[K][N];\nint idx[K][N];\ninline bool inALine(const Point... |
Codeforces/720/C | # Homework
Today Peter has got an additional homework for tomorrow. The teacher has given three integers to him: n, m and k, and asked him to mark one or more squares on a square grid of size n × m.
The marked squares must form a connected figure, and there must be exactly k triples of marked squares that form an L-... | [
{
"input": {
"stdin": "3\n3 3 4\n3 3 5\n3 3 3\n"
},
"output": {
"stdout": "***\n*.*\n***\n\n***\n**.\n...\n\n***\n*.*\n**.\n\n"
}
},
{
"input": {
"stdin": "1\n317 314 18260\n"
},
"output": {
"stdout": "****************............................................. | {
"tags": [
"constructive algorithms"
],
"title": "Homework"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nconst int N = 100100;\nint n, m, k;\nbool rev;\nvector<int> a[N];\nconst int BOUND = 11;\nvoid clear() {\n for (int i = 0; i < n; i++) {\n a[i].clear();\n a[i].resize(m);\n for (int j = 0; j < m; j++) a[i][j] = 0;\n }\n}\nint calcSquare(int x, int y... |
Codeforces/741/E | # Arpa’s abnormal DNA and Mehrdad’s deep interest
All of us know that girls in Arpa’s land are... ok, you’ve got the idea :D
Anyone knows that Arpa isn't a normal man, he is ... well, sorry, I can't explain it more. Mehrdad is interested about the reason, so he asked Sipa, one of the best biology scientists in Arpa's... | [
{
"input": {
"stdin": "abbbbbbaaa baababaaab 10\n1 2 1 0 0\n2 7 8 4 7\n2 3 9 2 8\n3 4 6 1 1\n0 8 5 2 4\n2 8 10 4 7\n7 10 1 0 0\n1 4 6 0 2\n0 9 8 0 6\n4 8 5 0 1\n"
},
"output": {
"stdout": "1 4 2 -1 2 4 10 1 1 5\n"
}
},
{
"input": {
"stdin": "abc d 4\n0 3 2 0 0\n0 3 1 0 0\n1... | {
"tags": [
"data structures",
"string suffix structures"
],
"title": "Arpa’s abnormal DNA and Mehrdad’s deep interest"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nconst int inf = 0x3f3f3f3f;\nint q, Len, LenS, LenT;\nint Log[200010], Min[200010][19];\nint rk[200010], tp[200010], sa[200010], st[200010], height[200010], m = 75;\nchar S[100010], T[100010], str[200010];\nint ans[100010], id[100010], _id[100010];\nint Min2[1... |
Codeforces/765/D | # Artsem and Saunders
Artsem has a friend Saunders from University of Chicago. Saunders presented him with the following problem.
Let [n] denote the set {1, ..., n}. We will also write f: [x] → [y] when a function f is defined in integer points 1, ..., x, and all its values are integers from 1 to y.
Now then, you ar... | [
{
"input": {
"stdin": "3\n1 2 3\n"
},
"output": {
"stdout": "3\n1 2 3 \n1 2 3 "
}
},
{
"input": {
"stdin": "3\n2 2 2\n"
},
"output": {
"stdout": "1\n1 1 1 \n2 "
}
},
{
"input": {
"stdin": "2\n2 1\n"
},
"output": {
"stdout": "-1"... | {
"tags": [
"constructive algorithms",
"dsu",
"math"
],
"title": "Artsem and Saunders"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nconst int mx = 1e5 + 10;\nint n, m, f[mx], g[mx], h[mx];\nbool flag[mx];\nint main() {\n memset(flag, 0, sizeof(flag));\n scanf(\"%d\", &n);\n m = 0;\n for (int i = 1; i <= n; ++i) {\n scanf(\"%d\", &f[i]);\n if (f[i] == i) {\n g[i] = ++m;\n ... |
Codeforces/789/A | # Anastasia and pebbles
Anastasia loves going for a walk in Central Uzhlyandian Park. But she became uninterested in simple walking, so she began to collect Uzhlyandian pebbles. At first, she decided to collect all the pebbles she could find in the park.
She has only two pockets. She can put at most k pebbles in each... | [
{
"input": {
"stdin": "5 4\n3 1 8 9 7\n"
},
"output": {
"stdout": "5\n"
}
},
{
"input": {
"stdin": "3 2\n2 3 4\n"
},
"output": {
"stdout": "3\n"
}
},
{
"input": {
"stdin": "10 1\n1 1 1 1 1 1 1 1 1 1\n"
},
"output": {
"stdout": "... | {
"tags": [
"implementation",
"math"
],
"title": "Anastasia and pebbles"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nvoid readi(int &x) {\n int v = 0, f = 1;\n char c = getchar();\n while (!isdigit(c) && c != '-') c = getchar();\n if (c == '-')\n f = -1;\n else\n v = v * 10 + c - '0';\n while (isdigit(c = getchar())) v = v * 10 + c - '0';\n x = v * f;\n}\nvoid r... |
Codeforces/80/C | # Heroes
The year of 2012 is coming...
According to an ancient choradrican legend in this very year, in 2012, Diablo and his brothers Mephisto and Baal will escape from hell, and innumerable hordes of demons will enslave the human world. But seven brave heroes have already gathered on the top of a mountain Arreat to ... | [
{
"input": {
"stdin": "3\nTroll likes Dracul\nDracul likes Anka\nSnowy likes Hexadecimal\n210 200 180\n"
},
"output": {
"stdout": "30 3\n"
}
},
{
"input": {
"stdin": "2\nAnka likes Chapay\nChapay likes Anka\n10000 50 50\n"
},
"output": {
"stdout": "1950 2\n"
... | {
"tags": [
"brute force",
"implementation"
],
"title": "Heroes"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nint anslike, dif, cnt[10][10], like[10][10], val[100];\nmap<string, int> mat;\nvoid dfs(int now) {\n int i, j, k;\n if (now == 7) {\n int Max = 0, Min = 2000000000, likes = 0;\n for (i = 0; i < 3; i++) {\n if (cnt[i][0] == 0) return;\n int tm... |
Codeforces/835/A | # Key races
Two boys decided to compete in text typing on the site "Key races". During the competition, they have to type a text consisting of s characters. The first participant types one character in v1 milliseconds and has ping t1 milliseconds. The second participant types one character in v2 milliseconds and has p... | [
{
"input": {
"stdin": "4 5 3 1 5\n"
},
"output": {
"stdout": "Friendship\n"
}
},
{
"input": {
"stdin": "5 1 2 1 2\n"
},
"output": {
"stdout": "First\n"
}
},
{
"input": {
"stdin": "3 3 1 1 1\n"
},
"output": {
"stdout": "Second\n"... | {
"tags": [
"math"
],
"title": "Key races"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n int a, b, c, d, e, x, y;\n cin >> a >> b >> c >> d >> e;\n x = (a * b) + (2 * d);\n y = (a * c) + (2 * e);\n if (y > x)\n cout << \"First\";\n else if (y < x)\n cout << \"Second\";\n else\n cout << \"Friendship\";\n return 0;\n}... |
Codeforces/855/D | # Rowena Ravenclaw's Diadem
Harry, upon inquiring Helena Ravenclaw's ghost, came to know that she told Tom Riddle or You-know-who about Rowena Ravenclaw's diadem and that he stole it from her.
Harry thought that Riddle would have assumed that he was the only one to discover the Room of Requirement and thus, would ha... | [
{
"input": {
"stdin": "3\n-1 -1\n1 0\n2 0\n2\n1 1 3\n2 1 3\n"
},
"output": {
"stdout": "YES\nNO\n"
}
},
{
"input": {
"stdin": "3\n-1 -1\n1 0\n1 1\n2\n2 2 3\n2 3 2\n"
},
"output": {
"stdout": "YES\nNO\n"
}
},
{
"input": {
"stdin": "20\n-1 -1\n... | {
"tags": [
"trees"
],
"title": "Rowena Ravenclaw's Diadem"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nconst int MAXN = 120000;\nconst int LOG = 20;\nint n;\nint tin[MAXN];\nint tout[MAXN];\nvector<int> eds[MAXN];\nint p[MAXN];\nint t[MAXN];\nint up[LOG][MAXN];\nint u0[MAXN];\nint u1[MAXN];\nint h[MAXN];\nint tm1;\nint is_p(int a, int b) { return tin[a] <= tin[... |
Codeforces/87/B | # Vasya and Types
Programmer Vasya is studying a new programming language &K*. The &K* language resembles the languages of the C family in its syntax. However, it is more powerful, which is why the rules of the actual C-like languages are unapplicable to it. To fully understand the statement, please read the language'... | [
{
"input": {
"stdin": "17\ntypedef void* b\ntypedef b* c\ntypeof b\ntypeof c\ntypedef &b b\ntypeof b\ntypeof c\ntypedef &&b* c\ntypeof c\ntypedef &b* c\ntypeof c\ntypedef &void b\ntypeof b\ntypedef b******* c\ntypeof c\ntypedef &&b* c\ntypeof c\n"
},
"output": {
"... | {
"tags": [
"implementation",
"strings"
],
"title": "Vasya and Types"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nmap<string, int> mp;\nstring tt = \"void\";\nint check(string s) {\n int ct1 = 0, ct2 = 0;\n int len = s.size();\n string result;\n for (int i = 0; i < len; i++) {\n if (s[i] == '&')\n ct1++;\n else if (s[i] == '*')\n ct2++;\n else\n ... |
Codeforces/903/D | # Almost Difference
Let's denote a function
<image>
You are given an array a consisting of n integers. You have to calculate the sum of d(ai, aj) over all pairs (i, j) such that 1 ≤ i ≤ j ≤ n.
Input
The first line contains one integer n (1 ≤ n ≤ 200000) — the number of elements in a.
The second line contains n i... | [
{
"input": {
"stdin": "4\n6 6 5 5\n"
},
"output": {
"stdout": "0"
}
},
{
"input": {
"stdin": "5\n1 2 3 1 3\n"
},
"output": {
"stdout": "4"
}
},
{
"input": {
"stdin": "4\n6 6 4 4\n"
},
"output": {
"stdout": "-8"
}
},
{
... | {
"tags": [
"data structures",
"math"
],
"title": "Almost Difference"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nint a[200001];\nint main() {\n int i, N;\n cin >> N;\n map<int, int> m;\n long long sum = 0;\n for (i = 1; i <= N; i++) {\n int x;\n cin >> x;\n a[i] = x;\n m[x]++;\n sum += x;\n }\n long double result = 0;\n for (i = 1; i <= N; i++) {\n... |
Codeforces/925/E | # May Holidays
It's May in Flatland, and there are m days in this month. Despite the fact that May Holidays are canceled long time ago, employees of some software company still have a habit of taking short or long vacations in May.
Of course, not all managers of the company like this. There are n employees in the com... | [
{
"input": {
"stdin": "5 6\n1 2 3 4\n4 0 0 1 0\n1 5 2 3 -5 -1\n"
},
"output": {
"stdout": "0 2 1 0 0 0 "
}
},
{
"input": {
"stdin": "7 8\n4 5 1 1 5 5\n0 0 0 1 2 0 0\n2 6 3 7 -2 4 -3 1\n"
},
"output": {
"stdout": "1 1 1 2 2 2 1 0 "
}
},
{
"input": {... | {
"tags": [
"data structures",
"trees"
],
"title": "May Holidays"
} | {
"cpp": "#include <bits/stdc++.h>\nconst int maxn = 1E+5 + 5;\nconst int maxB = 605;\nconst int B = 600;\nconst int INF = 0x3f3f3f3f;\nint n, m, ind, a[maxn];\nint fa[maxn], siz[maxn];\nint top[maxn], son[maxn], dfn[maxn];\nstd::vector<int> to[maxn];\ninline void DFS1(int u) {\n siz[u] = 1;\n for (int v : to[u]) {... |
Codeforces/954/F | # Runner's Problem
You are running through a rectangular field. This field can be represented as a matrix with 3 rows and m columns. (i, j) denotes a cell belonging to i-th row and j-th column.
You start in (2, 1) and have to end your path in (2, m). From the cell (i, j) you may advance to:
* (i - 1, j + 1) — only... | [
{
"input": {
"stdin": "2 5\n1 3 4\n2 2 3\n"
},
"output": {
"stdout": "2\n"
}
},
{
"input": {
"stdin": "50 100\n1 71 96\n2 34 52\n2 16 95\n1 54 55\n1 65 85\n1 76 92\n2 19 91\n1 26 43\n2 83 95\n2 70 88\n2 67 88\n1 9 75\n2 4 50\n2 9 11\n1 77 92\n1 28 58\n1 23 72\n1 24 75\n2 12... | {
"tags": [
"dp",
"matrices",
"sortings"
],
"title": "Runner's Problem"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nint Y[] = {-1, 1, 0, 0, -1, -1, 1, 1};\nint X[] = {0, 0, -1, 1, -1, 1, -1, 1};\nint DIR4 = 4;\nint DIR8 = 8;\nlong long power(long long a, long long n) {\n if (a == 0) return 0;\n if (a == 1 || n == 0) return 1;\n if (n == 1) return a % 1000000007;\n long ... |
Codeforces/980/E | # The Number Games
The nation of Panel holds an annual show called The Number Games, where each district in the nation will be represented by one contestant.
The nation has n districts numbered from 1 to n, each district has exactly one path connecting it to every other district. The number of fans of a contestant fr... | [
{
"input": {
"stdin": "6 3\n2 1\n2 6\n4 2\n5 6\n2 3\n"
},
"output": {
"stdout": "1 3 4 "
}
},
{
"input": {
"stdin": "8 4\n2 6\n2 7\n7 8\n1 2\n3 1\n2 4\n7 5\n"
},
"output": {
"stdout": "1 3 4 5 "
}
},
{
"input": {
"stdin": "64 63\n11 51\n64 11... | {
"tags": [
"data structures",
"greedy",
"trees"
],
"title": "The Number Games"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nconst int N = 1e6 + 5, M = 2e6 + 5;\nint E = -1, pnt[M], nxt[M], head[N];\nint fa[N][20], vis[N], dth[N];\nvoid add(int u, int v) {\n E++;\n pnt[E] = v;\n nxt[E] = head[u];\n head[u] = E;\n}\nvoid dfs(int u, int f, int d) {\n fa[u][0] = f;\n dth[u] = d;\... |
Codeforces/9/E | # Interesting Graph and Apples
Hexadecimal likes drawing. She has drawn many graphs already, both directed and not. Recently she has started to work on a still-life «interesting graph and apples». An undirected graph is called interesting, if each of its vertices belongs to one cycle only — a funny ring — and does not... | [
{
"input": {
"stdin": "3 2\n1 2\n2 3\n"
},
"output": {
"stdout": "YES\n1\n1 3\n"
}
},
{
"input": {
"stdin": "42 28\n7 19\n15 24\n3 42\n18 5\n32 27\n26 20\n40 30\n35 2\n14 8\n22 10\n36 4\n16 14\n21 29\n37 40\n2 12\n30 21\n19 17\n39 34\n31 28\n20 3\n4 33\n11 42\n26 21\n9 10\n... | {
"tags": [
"dfs and similar",
"dsu",
"graphs"
],
"title": "Interesting Graph and Apples"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\nvector<int> e[55];\nint n, m;\nbool v[55];\nvector<pair<int, int> > ans;\nbool check[55][55];\nint num[55];\nvoid cc(int x, int c) {\n num[x] = c;\n for (int i = 0; i < e[x].size(); i++)\n if (num[e[x][i]] < c) cc(e[x][i], c);\n}\nbool can() {\n int cnt ... |
HackerEarth/bhavanas-and-bhuvanas-bet | Bhavana and Bhuvana place bet every time they see something interesting that can occur with a probability 0.5.
Both of them place a bet for a higher amount which they don’t posses at that time. But when one wins she demands other for the bet amount. For example if Bhuvana wins she asks bhavana for the bet amount.
But... | [
{
"input": {
"stdin": "2\n3\n10"
},
"output": {
"stdout": "1\n3"
}
}
] | {
"tags": [],
"title": "bhavanas-and-bhuvanas-bet"
} | {
"cpp": null,
"java": null,
"python": "from sys import stdin\nt=stdin.readline()\na=stdin.readlines()\nfor i in a:\n\tn = int(i)\n\tcur = 1\n\tans = 0\n\twhile cur<=n:\n\t\tcur = cur*2\n\t\tans+=1\n\tans-=1\n\tif n==0:\n\t\tans = 0\n\tif ans==0:\n\t\tans = -2147483648\n\tprint ans"
} |
HackerEarth/cost-of-data-11 | Strings can be efficiently stored as a data structure, to have efficient searching methods.
A new startup is going to use this method, but they don't have much space. So they want to check beforehand how much memory will be required for their data.
Following method describes the way in which this startup's engineers s... | [
{
"input": {
"stdin": "5\net\neq\nbd\nbe\nbdp\n\nSAMPLE"
},
"output": {
"stdout": "8"
}
},
{
"input": {
"stdin": "5\nft\nfr\ncd\nde\nb`p\n\nSQDALK"
},
"output": {
"stdout": "11\n"
}
},
{
"input": {
"stdin": "5\nft\nre\nec\nce\nb`p\n\nSQDALK"
... | {
"tags": [],
"title": "cost-of-data-11"
} | {
"cpp": null,
"java": null,
"python": "import fileinput\n\nclass Node(object):\n def __init__(self,data):\n self.data=data\n self.children={} # {'data' => Node}\n self.max_score =0\n \n def add_child(self,data,score):\n if self.children.has_key(data):\n pass\n ... |
HackerEarth/find-the-nth-prime | Given the value of n, print the n'th prime number.
Input : A single integer n.
Output : A single number which is the n'th prime number.
Constraints :
1 ≤ n ≤ 1000
SAMPLE INPUT
2
SAMPLE OUTPUT
3
Explanation
The first few prime numbers are:
2,3,5,7. So, the answer is 3. | [
{
"input": {
"stdin": "2\n\nSAMPLE"
},
"output": {
"stdout": "3\n"
}
},
{
"input": {
"stdin": "2\n\nDVMULK"
},
"output": {
"stdout": "3\n"
}
},
{
"input": {
"stdin": "2\n\nCUKOVG"
},
"output": {
"stdout": "3\n"
}
},
{
... | {
"tags": [],
"title": "find-the-nth-prime"
} | {
"cpp": null,
"java": null,
"python": "number = 0\nprime_found = 0 \nprim_count = 0\n\ninput = int(raw_input())\n\nif(input > 1000):\n exit(\"Please Enter Correct Input\")\n\nwhile ( prim_count < input ):\n #print (number)\n for index in range (1,number+1):\n #print ('index = ' , index )\n ... |
HackerEarth/insect-colony-2 | Yesterday Oz heard a story about insect colony. The specialty of insects is that they splits sometimes i.e an insect of size A can split into two insects of positive integral sizes B and C such that A = B + C. Also sometimes they attack each other i.e. two insects of sizes P and Q will become R = P XOR Q .
You are give... | [
{
"input": {
"stdin": "2\n2 9 17\n1 1\n\nSAMPLE"
},
"output": {
"stdout": "Yes\nNo\n"
}
},
{
"input": {
"stdin": "10\n75 995991040 148627929 566366239 458028006 823890903 945174886 530827147 546010999 720763988 183796976 748924885 868038355 870234651 273702889 972313979 607... | {
"tags": [],
"title": "insect-colony-2"
} | {
"cpp": null,
"java": null,
"python": "t = int(raw_input())\nfor i in range(t):\n\tarr = list(map(int,raw_input().split()))\n\tarr = arr[1:]\n\tans = sum(arr)\n\tif ans%2 == 1:\n\t print 'No'\n\telse:\n\t print 'Yes'"
} |
HackerEarth/max-min | you are given an array of size N. You need to select K elements from the array such that the difference between the max number among selected and the min number among selected array elements should be minimum. Print the minimum difference.
INPUT:
First line N number i.e., length of array
Second line K number
Next N l... | [
{
"input": {
"stdin": "5\n3\n1\n2\n3\n4\n5\n\nSAMPLE"
},
"output": {
"stdout": "2\n"
}
},
{
"input": {
"stdin": "5\n1\n0\n5\n4\n4\n0\n\nQAMRLD"
},
"output": {
"stdout": "0\n"
}
},
{
"input": {
"stdin": "5\n3\n0\n3\n3\n1\n5\n\nQAMRLE"
},
... | {
"tags": [],
"title": "max-min"
} | {
"cpp": null,
"java": null,
"python": "N = input()\nK = input()\n\nassert 1 <= N <= 10**5\nassert 1 <= K <= N\n\nlis = []\nfor i in range(N):\n lis.append(input())\n\nlis.sort()\n\nfor i in lis:\n assert 0 <= i <= 10**9\n\nanswer = 100000000000000000000\n\nfor index in range(N-K+1):\n diff = lis[index+K... |
HackerEarth/once-upon-a-time-in-time-land | In a mystical TimeLand, a person's health and wealth is measured in terms of time(seconds) left.
Suppose a person there has 24x60x60 = 86400 seconds left, then he would live for another 1 day.
A person dies when his time left becomes 0. Some time-amount can be borrowed from other person, or time-banks.
Some time-amoun... | [
{
"input": {
"stdin": "2\n10 1\n1 2 -3 -5 4 6 -3 2 -1 2\n10 2\n1 2 -3 -5 4 6 -3 2 -1 2\n\nSAMPLE"
},
"output": {
"stdout": "12\n10\n"
}
},
{
"input": {
"stdin": "30\n16 3\n-334 -500 -169 -724 -478 -358 -962 -464 -705 -145 -281 -827 -961 -491 -995 -942 \n22 2\n391 604 902 15... | {
"tags": [],
"title": "once-upon-a-time-in-time-land"
} | {
"cpp": null,
"java": null,
"python": "'''\n# Read input from stdin and provide input before running code\n\nname = raw_input('What is your name?\\n')\nprint 'Hi, %s.' % name\n'''\ndef find_time(second, length, k):\n\tf = [0] * (length + k + 2)\n\tstart = length\n\twhile start >= 0:\n\t\tf[start] = max(f[start+1... |
HackerEarth/rams-love-for-sita-2 | Sita loves chocolate and Ram being his boyfriend wants to give Sita as many chocolates as he can. So, he goes to a chocolate store with Rs. N in his pocket. The price of each chocolate is Rs. C. The store offers a discount that for every M wrappers he gives to the store, he gets one chocolate for free. How many chocola... | [
{
"input": {
"stdin": "3\n10 2 5\n12 4 4\n6 2 2\n\nSAMPLE"
},
"output": {
"stdout": "6\n3\n5\n"
}
},
{
"input": {
"stdin": "3\n24 2 5\n8 5 2\n23 1 3\n\nSAMLPF"
},
"output": {
"stdout": "14\n1\n34\n"
}
},
{
"input": {
"stdin": "3\n3 2 5\n24 4 ... | {
"tags": [],
"title": "rams-love-for-sita-2"
} | {
"cpp": null,
"java": null,
"python": "for _ in range(input()):\n n,c,m = map(int,raw_input().split())\n k = n/c\n ans = k\n while k >= m:\n ans += k/m\n k = k/m + k%m\n print ans"
} |
HackerEarth/simple-prime-factorization | Surya loves to play with primes. One day, he asked his friend don to print any number in the form of multiple of prime factors. Help don in solving the problem.
Input
The first line will contain an integer t (1 ≤ t ≤ 10^6) denoting number of test case.
For each test case, you will be given an integer n (2 ≤ n ≤ 10^6... | [
{
"input": {
"stdin": "3\n32\n100\n9085\n\nSAMPLE"
},
"output": {
"stdout": "2^5\n2^2*5^2\n2^0*5^1*23^1*79^1"
}
},
{
"input": {
"stdin": "1000\n999001\n999002\n999003\n999004\n999005\n999006\n999007\n999008\n999009\n999010\n999011\n999012\n999013\n999014\n999015\n999016\n99... | {
"tags": [],
"title": "simple-prime-factorization"
} | {
"cpp": null,
"java": null,
"python": "def primes(n):\n primfac = []\n d = 2\n while d*d <= n:\n while (n % d) == 0:\n primfac.append(d)\n n //= d\n d += 1\n if n > 1:\n primfac.append(n)\n return primfac\nt = int(raw_input())\nfor _ in range(t):\n l = ... |
HackerEarth/the-strongest-string-1-1 | Maga and Alex are good at string manipulation problems. Just now they have faced a problem related to string. But it is not a standard string problem. They have no idea to solve it. They need your help.
A string is called unique if all characters of string are distinct.
String s_1 is called subsequence of string s_2 ... | [
{
"input": {
"stdin": "5\nabvzx\n\nSAMPLE"
},
"output": {
"stdout": "zx\n"
}
},
{
"input": {
"stdin": "5\nxywba\n\nETAMOL"
},
"output": {
"stdout": "ywba\n"
}
},
{
"input": {
"stdin": "5\nbywaw\n\nSOMALF"
},
"output": {
"stdout"... | {
"tags": [],
"title": "the-strongest-string-1-1"
} | {
"cpp": null,
"java": null,
"python": "from string import ascii_lowercase\nal = ascii_lowercase[::-1]\nn = int(raw_input())\ns = raw_input().strip()\nt = \"\"\nps = 0\nfor c in al:\n i = s.find(c, ps)\n if i == -1:\n continue\n else:\n t += c\n ps = i\nprint t"
} |
p02548 AtCoder Beginner Contest 179 - A x B + C | Given is a positive integer N. How many tuples (A,B,C) of positive integers satisfy A \times B + C = N?
Constraints
* 2 \leq N \leq 10^6
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
Output
Print the answer.
Examples
Input
3
Output
3
Input
100
... | [
{
"input": {
"stdin": "3"
},
"output": {
"stdout": "3"
}
},
{
"input": {
"stdin": "100"
},
"output": {
"stdout": "473"
}
},
{
"input": {
"stdin": "1000000"
},
"output": {
"stdout": "13969985"
}
},
{
"input": {
... | {
"tags": [],
"title": "p02548 AtCoder Beginner Contest 179 - A x B + C"
} | {
"cpp": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\nint64_t n,ans;\n ans=0;\n cin>>n;\n for(int64_t i=1;i<n;i++){\nans=ans+(n-1)/i; \n }\n cout<<ans<<endl; \n} ",
"java": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = ... |
p02679 AtCoder Beginner Contest 168 - ∙ (Bullet) | We have caught N sardines. The deliciousness and fragrantness of the i-th sardine is A_i and B_i, respectively.
We will choose one or more of these sardines and put them into a cooler. However, two sardines on bad terms cannot be chosen at the same time.
The i-th and j-th sardines (i \neq j) are on bad terms if and o... | [
{
"input": {
"stdin": "3\n1 2\n-1 1\n2 -1"
},
"output": {
"stdout": "5"
}
},
{
"input": {
"stdin": "10\n3 2\n3 2\n-1 1\n2 -1\n-3 -9\n-8 12\n7 7\n8 1\n8 2\n8 4"
},
"output": {
"stdout": "479"
}
},
{
"input": {
"stdin": "3\n1 0\n-2 0\n0 2"
... | {
"tags": [],
"title": "p02679 AtCoder Beginner Contest 168 - ∙ (Bullet)"
} | {
"cpp": "#include<iostream>\n#include<vector>\n#include<map>\n#include<algorithm>\nusing namespace std;\nconst long mod=1e9+7;\nlong power(long a,long b){return b?power(a*a%mod,b/2)*(b%2?a:1)%mod:1;}\nlong N;\nlong c00,c01,c10;\nlong gcd(long a,long b){return b?gcd(b,a%b):a;}\nint main()\n{\n\tcin>>N;\n\tvector<pair... |
p02807 Dwango Programming Contest 6th - Fusing Slimes | There are N slimes standing on a number line. The i-th slime from the left is at position x_i.
It is guaruanteed that 1 \leq x_1 < x_2 < \ldots < x_N \leq 10^{9}.
Niwango will perform N-1 operations. The i-th operation consists of the following procedures:
* Choose an integer k between 1 and N-i (inclusive) with equ... | [
{
"input": {
"stdin": "12\n161735902 211047202 430302156 450968417 628894325 707723857 731963982 822804784 880895728 923078537 971407775 982631932"
},
"output": {
"stdout": "750927044"
}
},
{
"input": {
"stdin": "3\n1 2 3"
},
"output": {
"stdout": "5"
}
... | {
"tags": [],
"title": "p02807 Dwango Programming Contest 6th - Fusing Slimes"
} | {
"cpp": "#include <bits/stdc++.h>\n#define rep(i, n) for(int i = 0; i < (n); ++i)\nusing namespace std;\ntypedef long long ll;\n\nconst ll MAX = 1e5;\nconst ll MOD = 1e9+7;\n\nll fac[MAX], finv[MAX], inv[MAX];\n\n// テーブルを作る前処理\nvoid COMinit() {\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n... |
p02943 AtCoder Grand Contest 037 - Reversing and Concatenating | Takahashi has a string S of length N consisting of lowercase English letters. On this string, he will perform the following operation K times:
* Let T be the string obtained by reversing S, and U be the string obtained by concatenating S and T in this order.
* Let S' be some contiguous substring of U with length N, an... | [
{
"input": {
"stdin": "5 1\nbacba"
},
"output": {
"stdout": "aabca"
}
},
{
"input": {
"stdin": "10 2\nbbaabbbaab"
},
"output": {
"stdout": "aaaabbaabb"
}
},
{
"input": {
"stdin": "10 1\nbaaabbbaab"
},
"output": {
"stdout": "aaab... | {
"tags": [],
"title": "p02943 AtCoder Grand Contest 037 - Reversing and Concatenating"
} | {
"cpp": "#include <bits/stdc++.h>\n\n#define MIN_INT -2147483648\n#define MAX_INT 2147483647\n#define MIN_LONG -9223372036854775808L\n#define MAX_LONG 9223372036854775807L\n\n#define long long long int\n\nusing namespace std;\n\n// @author: pashka\n\nint main() {\n ios::sync_with_stdio(false);\n\n int n, k;\n ... |
p03080 ExaWizards 2019 - Red or Blue | There are N people numbered 1 to N. Each person wears a red hat or a blue hat.
You are given a string s representing the colors of the people. Person i wears a red hat if s_i is `R`, and a blue hat if s_i is `B`.
Determine if there are more people wearing a red hat than people wearing a blue hat.
Constraints
* 1 \l... | [
{
"input": {
"stdin": "4\nRRBR"
},
"output": {
"stdout": "Yes"
}
},
{
"input": {
"stdin": "4\nBRBR"
},
"output": {
"stdout": "No"
}
},
{
"input": {
"stdin": "4\nSBCO"
},
"output": {
"stdout": "No\n"
}
},
{
"input": {... | {
"tags": [],
"title": "p03080 ExaWizards 2019 - Red or Blue"
} | {
"cpp": "#include <iostream>\nusing namespace std;\nint main()\n{\n\tint n,r=0,b=0;string s;\n\tcin>>n>>s;\n\tfor (int i=0;i<s.size();i++)\n\t{\n\t\tif (s[i]=='R') {r++;}\n\t\telse {b++;}\n\t}\n\tif (r>b) {cout<<\"Yes\\n\";}\n\telse {cout<<\"No\\n\";}\n\treturn 0;\n}",
"java": "\nimport java.util.*;\n\npublic clas... |
p03225 Tenka1 Programmer Contest - Equilateral | There are some coins in the xy-plane. The positions of the coins are represented by a grid of characters with H rows and W columns. If the character at the i-th row and j-th column, s_{ij}, is `#`, there is one coin at point (i,j); if that character is `.`, there is no coin at point (i,j). There are no other coins in t... | [
{
"input": {
"stdin": "5 4\n#.##\n.##.\n#...\n..##\n...#"
},
"output": {
"stdout": "3"
}
},
{
"input": {
"stdin": "13 27\n......#.........#.......#..\n...#.....###..\n..............#####...##...\n...#######......#...#######\n...#.....#.....###...#...#.\n...#######....#.#.#.... | {
"tags": [],
"title": "p03225 Tenka1 Programmer Contest - Equilateral"
} | {
"cpp": "#include <algorithm>\n#include <iostream>\n#include <cstring>\n#include <cstdlib>\n#include <utility>\n#include <cstdio>\n#include <vector>\n#include <string>\n#include <queue>\n#include <stack>\n#include <cmath>\n#include <set>\n#include <map>\n#define my_abs(x) ((x) < 0 ? -(x) : (x))\n#define mp std::make... |
p03371 AtCoder Beginner Contest 095 - Half and Half | "Pizza At", a fast food chain, offers three kinds of pizza: "A-pizza", "B-pizza" and "AB-pizza". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-pizza, B-pizza and AB-pizza are A yen, B yen and C yen (yen is the curr... | [
{
"input": {
"stdin": "1500 2000 1600 3 2"
},
"output": {
"stdout": "7900"
}
},
{
"input": {
"stdin": "1500 2000 500 90000 100000"
},
"output": {
"stdout": "100000000"
}
},
{
"input": {
"stdin": "1500 2000 1900 3 2"
},
"output": {
... | {
"tags": [],
"title": "p03371 AtCoder Beginner Contest 095 - Half and Half"
} | {
"cpp": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint a, b, c, x, y, ans;\n\nint main() {\n cin >> a >> b >> c >> x >> y;\n if (2 * c < a + b) {\n\tint mn = min(x, y);\n\tans += 2 * mn * c;\n\tx -= mn;\n\ty -= mn;\n }\n return cout << ans + min(a, 2 * c) * x + min(b, 2 * c) * y, 0;\n}",
"jav... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.