摘要：
敌兵布阵Time Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionC国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直... 阅读全文
摘要：
The Dragon of LoowaterOnce upon a time, in the Kingdom of Loowater, a minor nuisance turned into a major problem.The shores of Rellau Creek in central... 阅读全文
摘要：
Commando War“Waiting for orders we held in the wood, word from the front never cameBy evening the sound of the gunfire was mi... 阅读全文
摘要：
Integer InquiryTime Limit:1000MSMemory Limit:10000KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionOne of the first users of BIT's new supercompu... 阅读全文
摘要：
Goldbach's ConjectureTime Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionIn 1742, Christian G... 阅读全文
摘要：
RobberiesTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionThe aspiring Roy the Robber has seen a lot of Americ... 阅读全文
摘要：
1 #include 2 int a[1000] , temp[1000] ; 3 int n , top ; 4 5 int binary_search (int x) { 6 int fir = 0 ; 7 int last = top ; 8 int mid ; 9... 阅读全文
摘要：
Bookshelf 2Time Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionFarmer John recently bought another bookshelf for ... 阅读全文
摘要：
饭卡Time Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusDescription电子科大本部食堂的饭卡有一种很诡异的设计，即在购买之前判断余额。如果购买一个商品之前，卡上的剩余金额大于或等于5元，就... 阅读全文
摘要：
Charm BraceletTime Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionBessie has gone to the mall's jewelry store and... 阅读全文