Codeforces
文章平均质量分 76
ACMega
精通C/C Java 要饭
展开
-
Codeforces Round #225 (Div. 2)
A - Coder比较简单,就是算棋盘格子。#include #include #include #include #include #include #include using namespace std;int main() { int n; while (cin >> n) { int num = n * n; if原创 2014-01-21 19:06:19 · 253 阅读 · 0 评论 -
Codeforces Round #246 (Div. 2) - Prefixes and Suffixes
KMP#include #include #include #include #include #define maxn 100010#define INF (int)(1e9)#define MOD ((int)1e9+7)#define maxnode 400010#define sigma_size 30typedef long long ll;typedef un原创 2014-05-26 16:45:01 · 319 阅读 · 0 评论 -
Codeforces Round #247 (Div. 2) - Random Task
数位DP+二分答案#include #include #include #include #include #define MOD ((int)(1e9) + 7)#define eps 1e-10using namespace std;typedef long long ll;#define maxn 64#define INF 1000000000000000000LL原创 2014-05-25 18:12:03 · 172 阅读 · 0 评论 -
Codeforces Round #256 (Div. 2) - D - Multiplication Table
二分答案#include #include #include #include #include #include #include #include #include #include #include #define INF (int)(1e9)#define maxn 100010using namespace std;typedef long long ll原创 2014-07-19 00:28:38 · 225 阅读 · 0 评论 -
Codeforces Round #256 (Div. 2) - C - Painting Fence
数据比较弱,所以dfs可以过。很好想原创 2014-07-19 00:00:18 · 191 阅读 · 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 评论 -
Codeforces Round #251 (Div. 2) - Devu and his Brother
标准解法 三分。因为是整型的原创 2014-06-05 21:21:08 · 205 阅读 · 0 评论 -
Codeforces Round #247 (Div. 2) - k-Tree
水DP,还错了#include #include #include #include #include #define MOD ((int)(1e9) + 7)using namespace std;typedef long long ll;ll dp[110];int n, k, d;ll add(ll a, ll b) { return (a+b)%MOD;}原创 2014-05-22 20:33:11 · 202 阅读 · 0 评论 -
Codeforces Round #244 (Div. 2)
SCC#include #define maxn 100010#define INF (int)(1e9)#define MOD ((int)1e9+7)typedef long long ll;using namespace std;int a[maxn];//vector G[maxn];struct node { int to, w, next;};node原创 2014-05-06 01:09:11 · 183 阅读 · 0 评论 -
Codeforces Round #226 (Div. 2)
A - Bear and Raspberry题目描述很复杂,其实就是找到相邻两数差最大。注意如果不存在要输出0。#include #include #include #include #include #include #include using namespace std;int a[101];int main() { int n, c; whil原创 2014-01-25 22:10:18 · 237 阅读 · 0 评论 -
Codeforces Round #246 (Div. 2) - Prime Swaps
对于一个整数区间都可以用n个素数区间组成,n <= 4原创 2014-05-27 00:24:20 · 206 阅读 · 0 评论