HDU
qsf1013
这个作者很懒,什么都没留下…
展开
-
HDU 1087 Super Jumping! Jumping! Jumping!
Super Jumping! Jumping! Jumping! Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 35650 Accepted Submission(s): 16222 Problem Descri原创 2017-01-23 21:26:44 · 262 阅读 · 0 评论 -
HDU 5924 Mr. Frog’s Problem
题目大意:A≤C≤B,A≤D≤B and A/B+B/A≤C/D+D/C,z找到满足关系式的c,d对数 解题思路:其实经过计算及一些带入运算会发现,如果A,B相等,那满足式子的只有一对,即c,d,与a,,b相等,如果两个数不相等,则只有两对, c=a,d=b或c=b,d=a 虽然A出来题挺高兴的,但毕竟是水题,还需加油#include #include原创 2017-02-13 22:27:02 · 437 阅读 · 0 评论 -
hdu 5922 Minimum’s Revenge
Minimum’s Revenge Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 505 Accepted Submission(s): 346 Problem Description There is a原创 2017-02-13 22:09:57 · 270 阅读 · 0 评论 -
HDU1312:Red and Black(DFS)
G - Red and Black Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Description There is a rectangular room, covered with square tiles. Each原创 2016-11-30 18:48:25 · 255 阅读 · 0 评论 -
hdu 2087 剪花布条 kmp
为了纪念第一次用KMP解决一道题,在这写下了,算是当做一个模板吧。 Description 一块花布条,里面有些图案,另有一块直接可用的小饰条,里面也有一些图案。对于给定的花布条和小饰条,计算一下能从花布条中尽可能剪出几块小饰条来呢? Input 输入中含有一些数据,分别是成对出现的花布条和小饰条,其布条都是用可见ASCII字符表示的,可见的ASCII字符原创 2016-11-27 01:20:01 · 224 阅读 · 0 评论 -
hdu 1241 Oil Deposits (最经典的dfs)
Oil Deposits Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3087 Accepted Submission(s): 1765 Problem Description The GeoSurvCo转载 2016-11-28 21:17:11 · 241 阅读 · 0 评论 -
POJ 1061青蛙的约会 --扩展欧几里德算法
POJ 1061青蛙的约会 两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直到碰面为止。可是它们出发之前忘记了一件很重要的事情,既没有问清楚对方的特征,也没有约定见面的具体位置。不过青蛙们都是很乐观的,它们觉得只要一直朝着某个方向跳下去,总能碰到对方的。但是除非这两只青蛙在同一时原创 2017-01-19 20:38:13 · 442 阅读 · 0 评论 -
HDU - 2095 find your present (2) 异或运算
find your present (2) Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 22595 Accepted Submission(s): 8947 Problem De原创 2017-01-19 21:46:38 · 388 阅读 · 0 评论 -
HDU - 3037 Saving Beans (数论,组合数取模,lucas定理)
Saving Beans Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4735 Accepted Submission(s): 1883 Problem Description Although wint原创 2017-01-19 22:00:50 · 338 阅读 · 0 评论 -
HDU 1061 Rightmost Digit (求n^n的最低位)
Rightmost Digit Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 52403 Accepted Submission(s): 19868 Problem Description Given a原创 2017-01-20 16:15:55 · 251 阅读 · 0 评论 -
HDU 2191 悼念512汶川大地震遇难同胞――珍惜现在,感恩生活 (背包问题)
悼念512汶川大地震遇难同胞——珍惜现在,感恩生活 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 27190 Accepted Submission(s): 11439 Problem Description原创 2017-02-06 21:04:12 · 397 阅读 · 0 评论 -
HDU 5926 Mr. Frog’s Game
One day, Mr. Frog is playing Link Game (Lian Lian Kan in Chinese). In this game, if you can draw at most three horizontal or vertical head-and-tail-connected lines over the empty grids(the lin原创 2017-02-13 22:44:33 · 381 阅读 · 0 评论