摘要: 1.链接地址:http://bailian.openjudge.cn/practice/1915http://poj.org/problem?id=19152.题目:总Time Limit:1000msMemory Limit:65536kBDescriptionBackgroundMr Somurolov, fabulous chess-gamer indeed, asserts that no one else but him can move knights from one position to another so fast. Can you beat him?The Proble 阅读全文
posted @ 2014-02-28 21:00 mobileliker 阅读(297) 评论(0) 推荐(0)
摘要: 1.链接地址:http://poj.org/problem?id=2533http://bailian.openjudge.cn/practice/27572.题目:总Time Limit:2000msMemory Limit:65536kBDescription一个数的序列bi,当b1 2 #include 3 4 using namespace std; 5 6 int main() 7 { 8 //freopen("C://input.txt","r",stdin); 9 10 int n;//1 > n;12 13 int i,j;14 1 阅读全文
posted @ 2014-02-28 20:52 mobileliker 阅读(397) 评论(0) 推荐(0)