关闭

HDU 6048 Puzzle(找规律)——2017 Multi-University Training Contest - Team 2

传送门 PuzzleTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 405    Accepted Submission(s): 216Problem Description A Jigsaw puzzle contains N*M-1...
阅读(324) 评论(0)

HDU 6053 TrickGCD(分块+容斥)——2017 Multi-University Training Contest - Team 2

传送门 TrickGCDTime Limit: 5000/2500 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 2177    Accepted Submission(s): 842Problem Description You are given an array AA ,...
阅读(345) 评论(0)

HDU 6050 Funny Function(构造矩阵+推公式)——2017 Multi-University Training Contest - Team 2

传送门 Funny FunctionTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 724    Accepted Submission(s): 343Problem Description Function Fx,yF_{x,y}sati...
阅读(512) 评论(0)

HDU 6055 Regular polygon(计算几何+思维)——2017 Multi-University Training Contest - Team 2

传送门 Regular polygonTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1187    Accepted Submission(s): 461Problem Description On a two-dimensional p...
阅读(350) 评论(0)

HDU 6038 Function(找规律)——2017 Multi-University Training Contest - Team 1

传送门 FunctionTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1034    Accepted Submission(s): 464Problem Description You are given a permutation...
阅读(512) 评论(0)

FOJ Problem 2283 Tic-Tac-Toe(暴力枚举)——第八届福建省大学生程序设计竞赛-重现赛

传送门 Kim likes to play Tic-Tac-Toe.Given a current state, and now Kim is going to take his next move. Please tell Kim if he can win the game in next 2 moves if both player are clever enough.Here “next...
阅读(549) 评论(0)

玲珑杯 1143 - 计算几何你瞎暴力(暴力+YY)——“玲珑杯”ACM比赛 Round #18

1143 - 计算几何你瞎暴力 Time Limit:5s Memory Limit:256MByte Submissions:1828Solved:365 DESCRIPTION 今天HHHH考完了期末考试,他在教学楼里闲逛,他看着教学楼里一间间的教室,于是开始思考: 如果从一个坐标为 (x1,y1,z1)(x1,y1,z1)的教室走到(x2...
阅读(110) 评论(0)

玲珑杯 1144 - 数论你还会快速幂(打表找规律)

传送门解题思路:官方题解:B. 数论你还会快速幂看到nn比pp大了不到100个,我们可以思考一下假如我们只算到pp或者p−1p-1会是怎么样的即考虑函数∑p−1i=1ik mod p\sum_{i=1}^{p-1}i^k\ mod \ p我们先打个表能发现当kk是p−1p-1的倍数的时候这个值是p−1p-1,别的时候都是00然而这是否正确的呢? 我们可以简单的推导一下:假设gg是pp的原根,那么根据...
阅读(516) 评论(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...
阅读(372) 评论(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...
阅读(540) 评论(0)
    个人资料
    • 访问:450132次
    • 积分:10709
    • 等级:
    • 排名:第1618名
    • 原创:633篇
    • 转载:5篇
    • 译文:0篇
    • 评论:89条
    博客专栏