原创 cf 617 E. XOR and Favorite Number 莫隊算法
E. XOR and Favorite Numbertime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstanda
原创 codeforces 999 E. Reachability from the Capital 強連通
E. Reachability from the Capitaltime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutput
原创 sgu 116. Index of super-prime 揹包
116. Index of super-primetime limit per test: 0.25 sec. memory limit per test: 4096 KBLet P1, P2, … ,PN, … be a sequenc
原创 sgu 302. BHTML 1.0 棧
302. BHTML 1.0Time limit per test: 0.25 second(s)Memory limit: 65536 kilobytesinput: standardoutput: standardThe hypert
原创 sgu 259. Printed PR 貪心
259. Printed PRtime limit per test: 0.25 sec.memory limit per test: 65536 KBinput: standardoutput: standardSmall PR-age
原创 sgu 134. Centroid 樹形dp
134. Centroidtime limit per test: 0.25 sec. memory limit per test: 4096 KBYou are given an undirected connected graph,
原创 sgu 405. Totalizator 簡單模擬
405. TotalizatorTime limit per test: 0.25 second(s)Memory limit: 65536 kilobytesinput: standardoutput: standardSome tim
原创 sgu 546. Ternary Password 模擬
546. Ternary PasswordTime limit per test: 1 second(s)Memory limit: 262144 kilobytesinput: standardoutput: standardIn th
原创 sgu 175. Encoding 二分模擬
175. Encodingtime limit per test: 0.25 sec.memory limit per test: 4096 KBinput: standardoutput: standardLet phi(W) is t