
组合数学
文章平均质量分 81
RJ28
小学生
展开
-
POJ-1942 Paths on a Grid
Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 24046 Accepted: 5947 Description Imagine you are attending your math lesson at school. Once again, you are bored because原创 2016-04-15 21:48:25 · 401 阅读 · 0 评论 -
ICPCCamp Day1 C. City United(脑洞状压dp)
题目大意:给n(n 分析:原创 2017-03-10 21:07:51 · 467 阅读 · 0 评论 -
Codeforces Round #404 (Div. 2) D. Anton and School - 2(范德蒙恒等式)
As you probably know, Anton goes to school. One of the school subjects that Anton studies is Bracketology. On the Bracketology lessons students usually learn different sequences that consist of round b原创 2017-03-18 13:20:48 · 656 阅读 · 0 评论 -
Codeforces Beta Round #11 D. A Simple Task(状压DP)
Given a simple graph, output the number of simple cycles in it. A simple cycle is a cycle with no repeated vertices or edges. Input The first line of input contains two integers n and m (1 ≤ n ≤ 19,原创 2017-02-06 16:11:38 · 493 阅读 · 0 评论 -
Hdu-5894 hannnnah_j’s Biological Test(组合数学)
Description hannnnah_j is a teacher in WL High school who teaches biology. One day, she wants to test m students, thus she arranges n different seats around a round table. In order to pre原创 2016-10-16 20:10:52 · 384 阅读 · 0 评论 -
Codeforces Round #362 (Div. 1) B. Puzzles(递推)
B. Puzzles time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Barney lives in country USC (United States of Charzeh). USC原创 2016-09-23 14:33:47 · 304 阅读 · 0 评论 -
Codeforces Round #361 (Div. 2) E. Mike and Geometry Problem (离散化)
Mike wants to prepare for IMO but he doesn't know geometry, so his teacher gave him an interesting geometry problem. Let's define f([l, r]) = r - l + 1 to be the number of integer points in the segme原创 2016-07-19 10:21:49 · 718 阅读 · 0 评论 -
CodeForces 629C Famil Door and Brackets
As Famil Door’s birthday is coming, some of his friends (like Gabi) decided to buy a present for him. His friends are going to buy a string consisted of round brackets since Famil Door loves string of原创 2016-05-15 18:05:46 · 428 阅读 · 0 评论 -
Codeforces Round #332 (Div. 2) D. Spongebob and Squares
Spongebob is already tired trying to reason his weird actions and calculations, so he simply asked you to find all pairs of n and m, such that there are exactly x distinct squares in the table consis原创 2016-05-11 10:01:24 · 824 阅读 · 0 评论 -
Hdu-4661 Message Passing(树形DP)
There are n people numbered from 1 to n. Each people have a unique message. Some pairs of people can send messages directly to each other, and this relationship forms a structure of a tree. In one tur原创 2017-08-02 21:54:33 · 298 阅读 · 0 评论