摘要： TautologyTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 6088Accepted: 2315DescriptionWFF 'N PROOF is a logic game played with dice. Each die has six faces representing some subset of the possible symbols K, A, N, C, E, p, q, r, s, t. A Well-formed formula (WFF) is any string of these s 阅读全文

摘要： Emag eht htiw Em PlehTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 1950Accepted: 1315DescriptionThis problem is a reverse case of the problem 2996. You are given the output of the problem H and your task is to find the corresponding input.Inputaccording to output of problem 2996.Outputacc 阅读全文

摘要： Help Me with the GameTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 2426Accepted: 1571DescriptionYour task is to read a picture of a chessboard position and print it in the chess notation.InputThe input consists of an ASCII-art picture of a chessboard with chess pieces on positions describ 阅读全文

摘要： Robot MotionTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 7892Accepted: 3812DescriptionA robot has been programmed to follow the instructions in its path. Instructions for the next direction the robot is to move are laid down in a grid. The possible instructions are N north (up the page) 阅读全文

摘要： Crashing RobotsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5453Accepted: 2382DescriptionIn a modernized warehouse, robots are used to fetch the goods. Careful planning is needed to ensure that the robots reach their destinations without crashing into each other. Of course, all warehouse 阅读全文

摘要： ParencodingsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 15075Accepted: 8989DescriptionLet S = s1 s2...s2n be a well-formed string of parentheses. S can be encoded in two different ways: q By an integer sequence P = p1 p2...pn where pi is the number of left parentheses before the ith rig 阅读全文

摘要： Integer InquiryTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6755Accepted Submission(s): 1723Problem DescriptionOne of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 阅读全文

摘要： EightTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 18387Accepted: 8182Special JudgeDescriptionThe 15-puzzle has been around for over 100 years; even if you don't know it by that name, you've seen it. It is constructed with 15 sliding tiles, each with a number from 1 to 15 on it, a 阅读全文