UVa
somniloquy_
为利益而活 如腐尸般不堪
展开
-
UVa-679 Dropping Balls
#include <iostream> #include <cstdio> #include <cstring>using namespace std;int T, D, I;int main() { while(~scanf("%d", &T) && T != -1) { while(T --) { scanf("%d %d"原创 2015-08-24 23:26:04 · 301 阅读 · 0 评论 -
UVA - 514 Rails
#include <iostream> #include <cstdio> #include <stack> #include <cstring>using namespace std;const int maxn = 1000 + 5; int train[maxn]; //B站的火车要求序列 stack<int> station; //模拟火原创 2015-08-20 16:55:30 · 266 阅读 · 0 评论 -
UVa-12096 The SetStack Computer
#include #include #include #include #include #include #include //set_union set_intersection 的头文件 using namespace std; int t, n; string operation; //操作字符 typed原创 2015-08-18 21:21:33 · 313 阅读 · 0 评论 -
UVa-442 Matrix Chain Multiplication
#include #include #include #include using namespace std; struct MATRIX { int row; int col; MATRIX(int row = 0, int col = 0) : row(row), col(col) {} } matrix[26];原创 2015-08-19 18:52:24 · 253 阅读 · 0 评论 -
UVa-156 Ananagrams
#include #include #include #include #include #include using namespace std; map cnt; //储存标准化后的单词出现次数 vector word; //用来保存原始单词(原顺序 原大小写) string str; inline string no原创 2015-08-18 15:21:59 · 339 阅读 · 0 评论 -
UVa-101 The Blocks Problem
#include #include #include #include using namespace std; const int maxn = 25 + 5; vector block[maxn]; string str1, str2; int pile_a, height_a, pile_b, height_b; //a的堆序号 a所在的高度 b的堆序号 b所在的高度 i原创 2015-08-18 13:10:13 · 278 阅读 · 0 评论 -
UVa-10815 Andy's First Dictionary
#include #include #include #include using namespace std; set dict; string str, buf; int main() { while(cin >> str) { for(int i = 0; i < (int)str.length(); i ++) if(i原创 2015-08-18 14:00:28 · 279 阅读 · 0 评论 -
UVA-10474 Where is the Marble?
#include #include #include using namespace std; const int maxn = 10000 + 5; int marble[maxn]; int n, q, x; int main() { int Case = 0; while(~scanf("%d %d", & n, & q)) { if(!n原创 2015-08-17 13:52:26 · 254 阅读 · 0 评论 -
UVa-400 Unix ls
#include #include #include #include using namespace std; const int maxcol = 60; //最大列长度 const int maxn = 100 + 5; string filename[maxn]; inline void print(const string temp原创 2015-08-17 10:56:57 · 320 阅读 · 0 评论 -
UVa-11988 Broken Keyboard (a.k.a. Beiju Text)
#include <iostream> #include <cstdio> #include <cstring>using namespace std;const int maxn =1e5 + 5; int last, cur, Next[maxn]; char s[maxn];int main() { while(~scanf("%s", s + 1)) { in原创 2015-08-24 16:22:17 · 303 阅读 · 0 评论 -
UVa-10006 Carmichael Numbers
快速幂原创 2015-10-24 13:20:41 · 250 阅读 · 0 评论