![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数学
Jianbagengmu
换了id,换了我的人生的态度.
展开
-
平面分割,空间分割问题(递推关系)(hdu1249、hdu1290、hdu2050)
由这一题可以推一类的问题,首先由直线划分区域到折线划分区域,再延伸到封闭图形划分区域,最后在推广为平面划分空间的问题。(1) n条直线最多分平面问题题目:n条直线,最多可以把平面分为多少个区域。解析: 可能你以前就见过这题目,这充其量是一道初中的思考题。 但一个类型的题目还是从简单的入手,才容易发现规律。 当有n-1条直线时,平面最多被分成了f(n-1)原创 2017-07-03 19:22:56 · 532 阅读 · 0 评论 -
Sum HDU 4704
Sum Time Limit: 1000msMemory Limit: 131072KBThis problem will be judged on HDU. Original ID: 4704 64-bit integer IO format: %I64d Java class name: Main Prev Submit Status Statistics Next Type:原创 2017-07-30 00:25:43 · 246 阅读 · 1 评论 -
hdu6090_2017 Multi-University Training Contest - Team 5
Rikka with GraphAs we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them:For an undirected graph G with n nodes and原创 2017-08-09 15:50:25 · 204 阅读 · 0 评论 -
hdu 6130 _数学规律
KolakoskiThis is Kolakosiki sequence: 1,2,2,1,1,2,1,2,2,1,2,2,1,1,2,1,1,2,2,1……. This sequence consists of 1 and 2, and its first term equals 1. Besides, if you see adjacent and equal terms as one grou原创 2017-08-15 19:43:18 · 280 阅读 · 0 评论 -
codeforce_876B_ B - Divisiblity of Differences
You are given a multiset of n integers. You should select exactly k of them in a such way that the difference between any two of them is divisible by m, or tell that it is impossible.Numbers can be rep原创 2017-10-20 21:01:42 · 241 阅读 · 0 评论 -
L - Por Costel and the Semipalindromes Gym - 100923L
Por Costel the pig, our programmer in-training, has recently returned from the Petrozaporksk training camp. There, he learned a lot of things: how to boil a cob, how to scratch his belly using his keyb原创 2017-10-21 20:07:17 · 591 阅读 · 0 评论 -
A - Por Costel and Azerah Gym - 100923A
Por Costel the Pig has received a royal invitation to the palace of the Egg-Emperor of Programming, Azerah. Azerah had heard of the renowned pig and wanted to see him with his own eyes. Por Costel, hav原创 2017-10-21 20:00:31 · 422 阅读 · 0 评论