模拟过程
somniloquy_
为利益而活 如腐尸般不堪
展开
-
POJ-1083 Moving Tables
模拟原创 2015-09-26 22:40:20 · 369 阅读 · 0 评论 -
CodeForces-591B Rebranding
栈 模拟原创 2015-10-26 14:20:27 · 426 阅读 · 0 评论 -
CodeForces-591A Wizards' Duel
水题原创 2015-10-26 14:10:32 · 455 阅读 · 0 评论 -
POJ-3320 Jessica's Reading Problem
尺取法原创 2015-10-25 19:38:21 · 273 阅读 · 0 评论 -
ZOJ-3869 Ace of Aces
浙大月赛A原创 2015-10-25 14:39:46 · 276 阅读 · 0 评论 -
CodeForces-509B Painting Pebbles
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm>using namespace std;const int n_max = 100 + 5; const int INF = 0x3fffffff; int n, k; int paint[n_max];int main() { while原创 2015-09-17 22:13:32 · 294 阅读 · 0 评论 -
CodeForces-489C Given Length and Sum of Digits...
#include <iostream> #include <cstdio> #include <cstring>using namespace std;const int m_max = 100 + 5; int m, s, sum; int digit[m_max]; int digit_max[m_max]; bool flag;int main() { while(~scanf("%d原创 2015-09-17 20:22:18 · 674 阅读 · 0 评论 -
CodeForces-266B Queue at the School
#include <iostream> #include <cstring> #include <cstdio>using namespace std;const int nt_max = 50 + 5; int n, t, cnt; char Queue[nt_max];int main() { while(~scanf("%d %d", & n, & t)) {原创 2015-09-16 16:45:29 · 728 阅读 · 0 评论 -
POJ-2718 Smallest Difference
爆搜原创 2015-11-04 16:18:16 · 243 阅读 · 0 评论 -
HDU-5437 Alisha’s Party
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> #include <queue> #include <string>using namespace std;const int k_max = 150000 + 5; const int m_max = 150000 + 5; const int原创 2015-09-16 11:32:19 · 239 阅读 · 0 评论 -
CodeForces-124B Permutations
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm>using namespace std;const int nk_max = 8 + 5; const int INF = 0x3fffffff; int n, k; char number[nk_max][nk_max]; int bit[nk_原创 2015-09-16 14:58:21 · 410 阅读 · 0 评论 -
POJ-3617 Best Cow Line
#include <cstdio> #include <cstring> #include <iostream>using namespace std;const int n_max = 2000 + 5; char cow[n_max]; char dir[n_max]; int n;int main() { while(~scanf("%d", & n)) { f原创 2015-09-25 17:46:23 · 227 阅读 · 0 评论