- 博客(5)
- 收藏
- 关注
RSS订阅原创 Codeforces 487C Prefix Product Sequence(逆元)
题目链接：Codeforces 487C Prefix Product Sequence构造方式，从1开始，每次乘上i-1的逆元，再乘上i。#include #include #include using namespace std;typedef long long ll;const int maxn = 1e5 + 5;ll ans[maxn] = {0, 1};in
2015-03-19 14:52:56
1171
原创 Codeforces 487A Fight the Monster(暴力)
题目链接：Codeforces 487A Fight the Monster#include #include #include using namespace std;const int inf = 0x3f3f3f3f;int H, A, D;bool judge (int h, int a, int d) { if (a - D <= 0) return false
2015-03-19 14:52:10
1188
原创 Codeforces 487B Strip(RMQ)
题目链接：Codeforces 487B Strip#include #include #include #include #include using namespace std;const int maxn = 1e5 + 5;const int maxr = 20;const int inf = 0x3f3f3f3f;int ca, cd, AS[maxn],
2015-03-19 14:52:03
1286
原创 Codeforces 488B Candy Boxes(水)
题目链接：Codeforces 488B Candy Boxes#include #include #include using namespace std;int arr[4];bool judge () { int a[4]; memcpy(a, arr, sizeof(arr)); sort(a, a + 4); for (int i = 1; i < 4; i
2015-03-19 14:43:14
774
原创 Codeforces 488A Giga Tower(水)
题目链接：Codeforces 488A Giga Tower#include #include #include #include using namespace std;bool judge(int n) { n = abs(n); while (n) { if (n % 10 == 8) return true; n /= 10; } return f
2015-03-19 13:39:10
915
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人