---水---
nerd呱呱
菊花厂搬砖,欢迎投华为云Stack,已经好几年没更新博客了,呜呜呜
展开
-
HDU1701(暴力)
/** * 题意有毒 * hdu1701 */#include<iostream> #include<cstdio>using namespace std;int main() { int n; int t; double a, b; scanf("%d", &t); while(t--) { scanf("%lf%lf", &a,原创 2017-08-25 10:29:50 · 239 阅读 · 0 评论 -
HDU1106 (复习sort)
排序 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 67812 Accepted Submission(s): 20305 Problem Description 输入一行数字,如果我们把这行数字中的‘5’都看成空格,那么...原创 2018-03-30 11:12:55 · 131 阅读 · 0 评论 -
HDU1162(Prim只有代码)
/* * hdu1162 * Prim水 */#include<iostream> #include<cstdio> #include<cstring> #include<cmath>#define long long llusing namespace std;const float INF = 99999.99; const int mmax = 105;struct point {原创 2017-10-14 16:50:10 · 211 阅读 · 0 评论 -
acm 弱渣不会水题(3)--(HDU 2504)
又见GCD 分析gcd会,那这道呢。。。又见GCDTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 17026 Accepted Submission(s): 7112Problem Description有三个正整数a,b,c(0原创 2016-12-03 20:34:46 · 479 阅读 · 0 评论 -
acm 弱渣不会水题(2)--(HDU 2502)
月之数 分析 又到了水题时间,每当水不出题,不要悲伤,还有明天。 呜呜,我想静静。月之数Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 9614 Accepted Submission(s): 5638Problem Descr原创 2016-12-03 20:16:07 · 293 阅读 · 0 评论 -
acm 弱渣不会水题(1)--(HDU 2501)
Tiling_easy version 分析俗话说得好,水水更健康,水水更开心。。。 然而水题不是那么好做的,呜呜。。。递推是很多人的弱项,比如我。Tiling_easy versionTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 7原创 2016-12-03 21:23:59 · 449 阅读 · 0 评论 -
HDU1229(A+B)
2006浙大研究生签到题HDU1229还是A+BTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 21618 Accepted Submission(s): 10475Problem Description 读入两个小于10000的原创 2017-10-27 16:33:37 · 282 阅读 · 0 评论 -
HDU 2068(错排+组合数)
本体要用long long/** * hdu2068 * 错排+组合数 */#include<iostream> #include<cstdio>using namespace std;const int mmax = 30; typedef long long ll;//巧妙求组合数 ll C(int m, int n) { ll a = 1; ll b = 1; fo原创 2017-09-21 23:32:55 · 470 阅读 · 0 评论 -
HDU1301(Prim水)
Prim就是像Dijkstra一样维护一个数组d,该数组是每个结点对于最小生成树的最短距离。/** * HDU1301 * Prim练习 */#include<cstdio> #include<iostream> #include<cstring>using namespace std;const int mmax = 30; const int INF = 0x3f3f3f3f; int m原创 2017-10-10 22:17:53 · 308 阅读 · 0 评论 -
hdu2553 N皇后问题(深搜)
这道题用的其实是深搜的思想(或者说回溯法)。/** * 回溯?? * 模拟,搜索? * * 需要数组记录 */#include<iostream> #include<cstdio> #include<cstring>using namespace std;bool map[15][15]; int num;int isput(int x, int y, int n) { int i原创 2017-09-12 21:05:47 · 287 阅读 · 0 评论 -
HDU 1426(PE多次)
/** * hdu1426 * 遍历1-9 */#include<iostream> #include<cstdio> #include<cstring>using namespace std;const int mmax = 11; int num; int hh = 0; int map[mmax][mmax]; struct queue { int x, y; char原创 2017-09-23 16:43:51 · 374 阅读 · 1 评论 -
HUD2052(巨水)
Picture Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 35300 Accepted Submission(s): 17382 Problem Description Give you the width and h...原创 2018-03-31 17:24:48 · 218 阅读 · 0 评论