关闭
当前搜索:

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...
阅读(436) 评论(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...
阅读(240) 评论(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...
阅读(623) 评论(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...
阅读(263) 评论(0)

ZOJ 3829 Known Notation(模拟+YY)——The 2014 ACM-ICPC Asia Mudanjiang Regional Cont

传送门 Do you know reverse Polish notation (RPN)? It is a known notation in the area of mathematics and computer science. It is also known as postfix notation since every operator in an expression follows...
阅读(415) 评论(0)

HDU 5531 Rebuild(三分)——2015ACM/ICPC亚洲区长春站

传送门 RebuildTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 2483    Accepted Submission(s): 548Problem Description Archaeologists find ruins of...
阅读(609) 评论(0)

HDU 5514 Collision(扩展欧几里得+解方程)——2014ACM/ICPC亚洲区北京站

传送门 Matt is playing a naive computer game with his deeply loved pure girl. The playground is a rectangle with walls around. Two balls are put in different positions inside the rectangle. The bal...
阅读(317) 评论(0)

HDU - 5120 Intersection(简单几何)——2014ACM/ICPC亚洲区北京站

传送门 Matt is a big fan of logo design. Recently he falls in love with logo made up by rings. The following figures are some famous examples you may know. A ring is a 2-D figure bounded by two circl...
阅读(470) 评论(0)

HDU 5572 An Easy Physics Problem(计算几何)——2015ACM/ICPC亚洲区上海站-重现赛

传送门 An Easy Physics ProblemTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2322    Accepted Submission(s): 469Problem Description On an infinite...
阅读(762) 评论(0)

HDU 5514 Frogs(欧拉函数+数论YY)

传送门 FrogsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2198    Accepted Submission(s): 714Problem Description There are mm stones lying on a c...
阅读(1633) 评论(7)

HDU 5953 Game of Taking Stones(威佐夫博弈+高精度+二分)——The 2016 ACM-ICPC Asia Dalian Regional Contest

传送门 Two people face two piles of stones and make a game. They take turns to take stones. As game rules, there are two different methods of taking stones: One scheme is that you can take any number of...
阅读(1014) 评论(0)

HDU 4572 Bottles Arrangement(数学推公式)——2013 ACM-ICPC长沙赛区全国邀请赛

传送门 Bottles ArrangementTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 746    Accepted Submission(s): 565Problem Description   Hunan cuisine is...
阅读(587) 评论(0)

HDU 4569 Special equations(思维)——2013 ACM-ICPC长沙赛区全国邀请赛

Let f(x) = anxn +…+ a1x +a0, in which ai (0 <= i <= n) are all known integers. We call f(x) 0 (mod m) congruence equation. If m is a composite, we can factor m into powers of primes and solve every s...
阅读(580) 评论(0)

HDU 4565 So Easy!(思想+矩阵快速幂)——2013 ACM-ICPC长沙赛区全国邀请赛

So Easy! Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4213    Accepted Submission(s): 1369 Problem Description   A sequence Sn i...
阅读(677) 评论(0)

HDU 5974 A Simple Math Problem(数学解方程)——2016ACM/ICPC亚洲区大连站-重现赛(感谢大连海事大学)

传送门 A Simple Math ProblemTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 262    Accepted Submission(s): 120Problem Description Given two positiv...
阅读(1004) 评论(2)
44条 共3页1 2 3 下一页 尾页
    个人资料
    • 访问:482136次
    • 积分:11059
    • 等级:
    • 排名:第1625名
    • 原创:635篇
    • 转载:5篇
    • 译文:0篇
    • 评论:93条
    博客专栏