摘要： Excuses, Excuses!Judge Ito is having a problem with people subpoenaed for jury duty giving rather lame excuses in order to avoid serving. In order to ... 阅读全文

摘要： Automatic Poetry“Oh God”, Lara Croft exclaims, “it’sone of these dumb riddles again!”In Tomb Raider XIV, Lara is, as ever, gunning her way through anc... 阅读全文

摘要： If We Were a Child Again“Oooooooooooooooh!If I could do the easy mathematics like my school days!!I can guarantee, that I’d not make any mistake this ... 阅读全文

摘要： OverflowWrite a program that reads an expression consisting of two non-negative integer and an operator. Determine if either integer or the result of ... 阅读全文

摘要： ProductThe ProblemThe problem is to multiply two integers X, Y. (0 2 #include 3 4 #define maxn 2005 5 6 int main() 7 { 8 char a[maxn],b[maxn]; 9... 阅读全文

摘要： Integer InquiryOne 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 and h... 阅读全文

摘要： 阶乘的精确值输入不超过1000的正整数n，输出n!的精度结果。样例输入：30样例输出：265252859812191058636308480000000 1 #include 2 #include 3 4 #define maxn 3000 5 6 int f[maxn]; 7 8 int m... 阅读全文

摘要： 小学生算术描述很多小学生在学习加法时，发现“进位”特别容易出错。你的任务是计算两个三位数在相加时需要多少次进位。你编制的程序应当可以连续处理多组数据，直到读到两个0（这是输入结束标记）。输入输入两个正整数m,n.(m,n,都是三位数)输出输出m,n,相加时需要进位多少次。样例输入123 456555... 阅读全文

摘要： AnanagramsMost crossword puzzle fans are used toanagrams--groups of words with the same letters in different orders--for example OPTS, SPOT, STOP, POT... 阅读全文

摘要： Stacks of FlapjacksBackgroundStacks and Queues are often considered the bread and butter of data structures and find use in architecture, parsing, ope... 阅读全文