2019 年 7月 10 日随笔档案 - KasenBob

poj2081

摘要： 1．链接地址 https://vjudge.net/problem/POJ-2081 2．问题描述 The Recaman's sequence is defined by a0 = 0 ; for m > 0, a m = a m−1 − m if the rsulting a m is posi 阅读全文

posted @ 2019-07-10 15:06 KasenBob 阅读(138) 评论(0) 推荐(0)

poj1401

摘要： 1．链接地址 https://vjudge.net/problem/POJ-1401 2．问题描述 For example, they defined the function Z. For any positive integer N, Z(N) is the number of zeros at 阅读全文

posted @ 2019-07-10 14:52 KasenBob 阅读(117) 评论(0) 推荐(0)

poj1953

摘要： 1．链接地址 https://vjudge.net/problem/POJ-1953 2．问题描述 Given a positive integer n, determine the number of different chanting patterns of this length, i.e. 阅读全文

posted @ 2019-07-10 14:40 KasenBob 阅读(265) 评论(0) 推荐(0)

poj2017

摘要： 1．链接地址 https://vjudge.net/problem/POJ-2017 2．问题描述 Bill and Ted are taking a road trip. But the odometer in their car is broken, so they don't know how 阅读全文

posted @ 2019-07-10 14:22 KasenBob 阅读(131) 评论(0) 推荐(0)

poj1316

摘要： 1．链接地址 https://vjudge.net/problem/POJ-1316 2．问题描述 In 1949 the Indian mathematician D.R. Kaprekar discovered a class of numbers called self-numbers. Fo 阅读全文

posted @ 2019-07-10 14:13 KasenBob 阅读(126) 评论(0) 推荐(0)

poj1003

摘要： 1．链接地址 https://vjudge.net/problem/POJ-1003 2．问题描述 How far can you make a stack of cards overhang a table? If you have one card, you can create a maxim 阅读全文

posted @ 2019-07-10 13:54 KasenBob 阅读(105) 评论(0) 推荐(0)

poj1207

摘要： 1．链接地址 https://vjudge.net/problem/POJ-1207 2．问题描述 Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., 阅读全文

posted @ 2019-07-10 13:44 KasenBob 阅读(186) 评论(0) 推荐(0)

poj1004

摘要： 1．链接地址 https://vjudge.net/problem/POJ-1004 2．问题描述 Larry graduated this year and finally has a job. He's making a lot of money, but somehow never seems 阅读全文

posted @ 2019-07-10 13:19 KasenBob 阅读(140) 评论(0) 推荐(0)

2019年7月10日

公告