AD Hoc
文章平均质量分 57
ACMega
精通C/C Java 要饭
展开
-
UVA11292 - Dragon of Loowater
#include #include #include #include #include #include #include using namespace std;int a[20010], b[20010];int main() { int n, m; while (scanf("%d%d", &n, &m) != EOF) { if (n == 0 && m ==原创 2014-01-20 10:56:50 · 215 阅读 · 0 评论 -
2014 Multi-University Training Contest 1 - HDU4861 - Couple doubi
打表找规律#include #include #include #include #include #include #include #include #include #include #include #define maxn 220#define INF (1e9)#define eps 1e-10typedef long long ll;using na原创 2014-07-23 12:41:02 · 254 阅读 · 0 评论 -
2014 Multi-University Training Contest 1 - HDU4864 - Task
贪心法 当时没有想到可以贪心,因为忽略了数据范围原创 2014-07-23 12:33:16 · 240 阅读 · 0 评论 -
Codeforces Round #248 (Div. 2) - Ryouko's Memory Note
我会说这场爆零了?#include #define maxn 100010#define INF (int)(1e9)#define MOD ((int)1e9+7)#define maxnode 400010#define sigma_size 30typedef long long ll;using namespace std;ll a[100010];int main(原创 2014-05-25 00:42:27 · 280 阅读 · 0 评论 -
UESTC806 - Balloon Game Once More
电子科大校赛神坑有木有,?li原创 2014-05-25 00:40:17 · 215 阅读 · 0 评论 -
LA3708 - Graveyard
坐标化,然后四舍五入,太吊了#include #include #include #include #include #include #include using namespace std;int main() { int n, m; while (scanf("%d%d", &n, &m) != EOF) { double res = 0.0; for (in原创 2014-01-20 18:06:34 · 300 阅读 · 0 评论 -
10881 - Piotr's Ants
开始和结束,蚂蚁的顺序不变。#include #include #include #include #include #include #include using namespace std;struct P { int id, p, v;}before[10010], after[10010];bool cmp (P a, P b) { return a.p < b原创 2014-01-20 20:12:21 · 276 阅读 · 0 评论 -
UVA11300 - Spreading the Wealth
#include #include #include #include #include #include #include using namespace std;long long a[1000010];long long c[1000010];int main() { int n; while (scanf("%d", &n) != EOF) { long lon原创 2014-01-20 17:23:51 · 280 阅读 · 0 评论 -
UVA11729 - Commando War
#include #include #include #include #include #include #include using namespace std;struct P { int a, b;}job[1010];bool cmp (P a, P b) { return a.b > b.b;}int main() { int N, now = 0; w原创 2014-01-20 11:17:35 · 270 阅读 · 0 评论 -
UVa11384 - Help is needed for Dexter
很像Codeforces div.2 B or C 难度的题#include #include #include #include #include #include #include #include #include using namespace std;int work(int n) { if (n == 1) return 1; else return wor原创 2014-01-28 14:36:41 · 257 阅读 · 0 评论 -
UVa11520 - Fill the Square
简单的爆搜#include #include #include #include #include #include #include #include #include #include #define MAXN 15using std::cin;using std::cout;using std::endl;using std::map;using std::原创 2014-01-28 23:25:25 · 253 阅读 · 0 评论 -
2014 Multi-University Training Contest 5 - HDU4920 - Matrix multiplication
第五场坐火车耽误了累加原创 2014-08-06 23:08:33 · 253 阅读 · 0 评论