关闭

欧拉函数 codeforces 776E - The Holmes Children

The Holmes children are fighting over who amongst them is the cleverest. Mycroft asked Sherlock and Eurus to find value of f(n), where f(1) = 1 and for n ≥ 2, f(n) is the number of distinct ordered positive integer pairs (x, y) that satisfy x + y = n and...
阅读(307) 评论(0)

UVa10375(唯一分解定理)

The binomial coefficient C(m, n) is defined as C(m, n) = m! (m − n)! n! Given four natural numbers p, q, r, and s, compute the the result of dividing C(p, q) by C(r, s). Input Input consists of a sequence of lines. Each line contains four non-negative inte...
阅读(303) 评论(0)

UVa12169(拓展欧几里得)

Once upon a time, there was an NWERC judge with a tendency to create slightly too hard problems. As a result, his problems were never solved. As you can image, this made our judge somewhat frustrated. This year, this frustration has culminated, and he has ...
阅读(331) 评论(0)

HDU 6129 just do it(组合数奇偶性)

Just do it Time Limit: 5000/2500 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 1411 Accepted Submission(s): 823 Problem Description There is a nonnegative integer sequence a1...n of length n. HazelFan wants to ...
阅读(326) 评论(0)

HDU 4474 同余模定理+BFS

Yet Another Multiple Problem Time Limit: 40000/20000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 6255 Accepted Submission(s): 1451 Problem Description There are tons of problems about integer multiples. Despite...
阅读(500) 评论(0)
21条 共5页1 2 3 4 5 ... 下一页 尾页
    个人资料
    • 访问:62809次
    • 积分:2211
    • 等级:
    • 排名:第18806名
    • 原创:159篇
    • 转载:9篇
    • 译文:0篇
    • 评论:29条
    博客专栏
    最新评论