2013年8月2日
烟大 Contest1025 - 《挑战编程》第二章：数据结构 Problem A: Jolly Jumpers（水题）
摘要： Problem A: Jolly JumpersTime Limit:1 SecMemory Limit:64 MBSubmit:10Solved:4[Submit][Status][Web Board]DescriptionA sequence of n > 0 integers is called a jolly jumper if the absolute values of the differences between successive elements take on all possible values 1 through n - 1. For instance, 1 阅读全文
posted @ 2013-08-02 11:28 Freecode# 阅读(236) 评论(0) 推荐(0)
烟大 Contest1024 - 《挑战编程》第一章：入门 Problem G: Check The Check（模拟国际象棋）
摘要： Problem G: Check The CheckTime Limit:1 SecMemory Limit:64 MBSubmit:10Solved:3[Submit][Status][Web Board]DescriptionYour task is to write a program that reads a chessboard configuration and identifies whether a king is under attack (in check). A king is in check if it is on square which can be taken 阅读全文
posted @ 2013-08-02 09:49 Freecode# 阅读(371) 评论(0) 推荐(0)