关闭

[置顶] HDU 4592 Boring Game(高斯消元好题)

传送门 Boring GameTime Limit: 8000/4000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 827    Accepted Submission(s): 80Problem Description Zero likes to play a boring...
阅读(759) 评论(0)

[置顶] POJ 1753 Flip Game(高斯消元入门超详细题解)——Northeastern Europe 2000

传送门 Flip Game Time Limit: 3000/1000MS (Java/Others)     Memory Limit: 65535/65535KB (Java/Others) Submit  Status Flip game is played on a rectangular 4×44×4 field with two-s...
阅读(871) 评论(0)

[置顶] 伯努利数应用

组合数学、 伯努利数、 自然数幂和...
阅读(1136) 评论(4)

[置顶] 自然数幂和

首先我来介绍一下什么是自然数幂和:1+2+3+...+i+...+n=?1+2+3+...+i+...+n=?12+22+32+...+i2+...+n21^2 +2^2+3^2+...+i^2+...+n^21k+2k+3k+...+ik+...+nk1^k +2^k+3^k+...+i^k+...+n^k类似上述式子的就是自然数幂和了,那么具体怎么求呢,这就是今天的重点了:1+2+3+...+i...
阅读(934) 评论(0)

[置顶] 高斯消元整数消元模板

高斯消元就是来接方程组的。(可以跟矩阵联系在一起)#include #include #include #include #include using namespace std; const int MAXN = 1e2+5; int equ, var;///equ个方程 var个变量 int a[MA...
阅读(1684) 评论(0)

[置顶] HDU 5667 Sequence (BestCoder Round #80 1003)——构造矩阵

构造矩阵 + 矩阵的快速幂 + 基础数论...
阅读(1089) 评论(0)

[置顶] HDU 4059 The Boss on Mars(容斥原理 + 四次方求和)

容斥原理 + 四次方求和 + 数论...
阅读(2796) 评论(0)

[置顶] 如何用线性筛法求欧拉函数

线性筛法求欧拉函数...
阅读(1616) 评论(0)

HDU 4946 Area of Mushroom(凸包)

传送门 Teacher Mai has a kingdom with the infinite area. He has n students guarding the kingdom. The i-th student stands at the position (xi,yi), and his walking speed is vi. If a point can be rea...
阅读(183) 评论(0)

HDU 5446 Unknown Treasure(中国剩余定理+卢卡斯定理)——2015 ACM/ICPC Asia Regional Changchun Online

传送门On the way to the next secret treasure hiding place, the mathematician discovered a cave unknown to the map. The mathematician entered the cave because it is there. Somewhere deep in the cave, she f...
阅读(317) 评论(0)

HDU 5936 Difference(思维+二分)——2016年中国大学生程序设计竞赛(杭州)

传送门Little Ruins is playing a number game, first he chooses two positive integers yy and KK and calculates f(y,K)f(y, K), heref(y,K)=∑z in every digits of yzK(f(233,2)=22+32+32=22)f(y, K) = \sum_{z\text...
阅读(405) 评论(0)

HDU 5954 Do not pour out(二分+积分)

传送门You have got a cylindrical cup. Its bottom diameter is 2 units and its height is 2 units as well.The height of liquid level in the cup is d (0 ≤ d ≤ 2). When you incline the cup to the maximal angle...
阅读(111) 评论(0)

FZU Problem 1919 K-way Merging sort(大数+记忆化搜索)

传送门As we all known, merge sort is an O(nlogn) comparison-based sorting algorithm. The merge sort achieves its good runtime by a divide-and-conquer strategy, namely, that of halving the list being sorte...
阅读(469) 评论(0)

2017 ACM-ICPC 亚洲区(西安赛区)网络赛 F.Trig Function(论文+组合数)

传送门 f(cos(x))=cos(n∗x)f(cos(x)) = cos(n*x) holds for all xx.Given two integers nn and mm, you need to calculate the coefficient of xmx^m in f(x)f(x), modulo 998244353998244353.Input FormatMultiple te...
阅读(471) 评论(0)

2017 ACM-ICPC 亚洲区(西安赛区)网络赛 B.Coin(基本概率+二项式展开)

传送门 Bob has a not even coin, every time he tosses the coin, the probability that the coin’s front face up is qp(qp≤12)\frac{q}{p}(\frac{q}{p} \le \frac{1}{2}).The question is, when Bob tosses the coi...
阅读(161) 评论(0)

HDU 4336 Card Collector(状态压缩+概率DP)

传送门In your childhood, do you crazy for collecting the beautiful cards in the snacks? They said that, for example, if you collect all the 108 people in the famous novel Water Margin, you will win an ama...
阅读(319) 评论(0)

ZOJ 3380 Patchouli's Spell Cards(概率DP)

传送门 Patchouli Knowledge, the unmoving great library, is a magician who has settled down in the Scarlet Devil Mansion (紅魔館). Her specialty is elemental magic employing the seven elements fire, water...
阅读(201) 评论(0)

Codeforces 148D. Bag of mice(概率DP)

传送门The dragon and the princess are arguing about what to do on the New Year’s Eve. The dragon suggests flying to the mountains to watch fairies dancing in the moonlight, while the princess thinks they...
阅读(127) 评论(0)

POJ 2151 Check the difficulty of problems(概率DP)

传送门 Organizing a programming contest is not an easy job. To avoid making the problems too difficult, the organizer usually expect the contest result satisfy the following two terms: 1. All of the te...
阅读(247) 评论(0)

ZOJ 3329 One Person Game——(概率DP+待定系数求解方程)

传送门 There is a very simple and interesting one-person game. You have 3 dice, namely Die1, Die2 and Die3. Die1 has K1 faces. Die2 has K2 faces. Die3 has K3 faces. All the dice are fair dice, so...
阅读(314) 评论(0)

ZOJ 3203 Light Bulb——(三分求极值)

传送门 Compared to wildleopard’s wealthiness, his brother mildleopard is rather poor. His house is narrow and he has only one light bulb in his house. Every night, he is wandering in his incommodio...
阅读(93) 评论(0)

POJ 3301 Texas Trip(最小正方形覆盖+三分)

传送门 After a day trip with his friend Dick, Harry noticed a strange pattern of tiny holes in the door of his SUV. The local American Tire store sells fiberglass patching material only in square sheets....
阅读(274) 评论(0)

POJ 2429 GCD & LCM Inverse(大整数素因子分解+二进制枚举)

GCD & LCM InverseTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 16540Accepted: 3061DescriptionGiven two positive integers a and b, we can easily calculate the greatest common divisor (GCD) an...
阅读(79) 评论(0)
637条 共43页1 2 3 4 5 ... 下一页 尾页
    个人资料
    • 访问:446051次
    • 积分:10653
    • 等级:
    • 排名:第1617名
    • 原创:632篇
    • 转载:5篇
    • 译文:0篇
    • 评论:89条
    博客专栏