UVA
文章平均质量分 50
slashXX_xu
量变终会质变。坚持!
展开
-
UVA - 127 - Accordian patience
传送门: http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=18732题意: 输入52张扑克牌,进行"Accordian patience"确认。规则如下: ① 两张牌匹配条件:数字一样,或花色一样。 ② 如果当前牌与左边第三位置的牌匹配,则移动当前牌到左边第三位置上方。 ③原创 2015-04-15 23:05:46 · 460 阅读 · 0 评论 -
UVA - 152 - Tree's a Crowd
#include #include #include #include #include #include using namespace std;// #define LOCAL_TESTclass CPoint{public: int x; int y; int z; CPoint (int x = 0, int y = 0, int z = 0) { t原创 2014-04-27 21:48:50 · 442 阅读 · 0 评论 -
UVA - 10420 - List of Conquests
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=98&page=show_problem&problem=1361原创 2014-04-26 22:12:25 · 545 阅读 · 3 评论 -
UVA - 401 - Palindromes
#include #include #include using namespace std;const int MAXLENGTH = 20;int main(){ char LETTER_REVERSE[26] = { 'A', ' ', ' ', ' ', '3', ' ', ' ', 'H', 'I', 'L', ' ', 'J', 'M', ' ',原创 2014-04-12 13:56:01 · 386 阅读 · 0 评论 -
UVA - 361 - Automatic Poetry
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=96&page=show_problem&problem=1302原创 2014-04-12 19:59:11 · 559 阅读 · 0 评论 -
UVA - 537 - Artificial Intelligence
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=96&page=show_problem&problem=478#include #include #include #include #include using namespace std;int m原创 2014-04-12 22:02:24 · 623 阅读 · 0 评论 -
UVA - 10010 - Where's Waldorf
#include #include #include #include using namespace std;const int MAXN = 50;int m, n;char sz[MAXN+1][MAXN+1];void strToLower(char str[]){ for ( int i=0; i<strlen(str); i++ ) { str[i] =原创 2014-04-12 19:08:13 · 484 阅读 · 0 评论 -
UVA - 621 - Secret Research
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=99&page=show_problem&problem=562#include #include #include using namespace std;// #define LOCAL_TESTint原创 2014-05-11 22:21:12 · 667 阅读 · 0 评论 -
UVA - 299 - Train Swapping
#include #include using namespace std;// #define LOCAL_TESTconst int MAXN = 50;int main(){#ifdef LOCAL_TEST freopen("f:\\in.txt", "r", stdin); freopen("f:\\out.txt", "w+", stdout);#endif原创 2014-04-27 22:14:00 · 531 阅读 · 0 评论 -
UVA - 409 - Excuses, Excuses
#include #include #include #include #include #include using namespace std;const int MAXN = 20;void fun_str(string &str){ for ( int i=0; i<str.length(); i++ ) { if ( isalpha(str[i]) )原创 2014-04-13 16:07:18 · 438 阅读 · 0 评论 -
UVA - 575 - Skew Binary
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=100&page=show_problem&problem=516题意: ld#include #include #include using namespace std;// #define L原创 2014-05-12 20:43:19 · 621 阅读 · 0 评论 -
UVA - 673 - Parentheses Balance
#include #include #include #include using namespace std;// #define LOCAL_TESTbool Check(string str){ stack sTemp; bool bCorrect = true; for ( int index=0; index<str.length(); index++ ) {原创 2014-06-03 23:18:01 · 604 阅读 · 0 评论 -
UVA - 10881 - Piotr's Ants
传送门: http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=25979题意: 蚂蚁在单杠上爬,互相碰撞就转向。输入杠长,持续时间,还有蚂蚁数量。最后得出所有蚂蚁的位置。 ① 蚂蚁因碰撞而掉头时,看上去就是两个点“对穿而过”。 ② 如,蚂蚁点A(1,R),在碰撞的两秒后,存在点A'(3,原创 2015-04-17 21:08:04 · 452 阅读 · 0 评论 -
UVA - 10921 - Problem B - Find the Telephone
背景: 今天无意间在VJ-Status看到有人提交UVA的题目,还好是水题一枚,哈哈。题意: 模拟手机九宫格输入法,把字母输入转换成数字输出。 输入类似“1-HOME-SWEET-HOME”。 输出类似“1-4663-79338-4663”。分析: 其实是水题,完全不用分析,可本着"书写重新思考"的宗旨,再简单的东西也得认真原创 2015-03-16 19:59:17 · 593 阅读 · 0 评论 -
UVA - 10815 - Andy's First Dictionary
题意: 输入N行数据,将其中所有单词抽出,形成一个正序字典;最后输出整个字典。注意: ① 不会大小写,统一输出小写; ② 非字母字符不能输出 ③ 单词多长多短,只要隔开,就是一个单词。思路: 以“行”为单位,进行处理。 ① 输入一行,保存到char*中 ② char*转string ③ 大写字母原创 2015-04-06 23:18:19 · 441 阅读 · 0 评论 -
UVA - 644 - Immediate Decodability
传送门: http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=19143题意: Immediately定义,字符串数据组中,各字符串非其它字符串的前缀子串,就是immediately。 如存在字符串间存在前缀子串关系,则为非immediately。注意: ① 各数据组以一行“9”结束原创 2015-04-09 23:51:53 · 534 阅读 · 0 评论 -
UVA - 11729 - Commando War
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=117&page=show_problem&problem=2829题意: 有n个部下要布置,每个部下需要有对应的交待时间及任务时间,选择适当的交待顺序,以获取最小的总花费时间。#include原创 2015-01-13 23:12:36 · 474 阅读 · 0 评论 -
UVA - 11292 - Dragon of Loowater
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=2267题意: 输入Dragon数组和Knight数组,Knight比Dragon大时付款,计算出最小的总付款值。解题: 普通的模拟水题,回来没事原创 2015-01-07 22:14:22 · 461 阅读 · 0 评论 -
UVA - 540 - Team Queue
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=103&page=show_problem&problem=481原创 2014-07-02 21:36:53 · 807 阅读 · 0 评论 -
UVA - 10050 - Hartals
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=103&page=show_problem&problem=991原创 2014-06-18 22:19:07 · 666 阅读 · 0 评论 -
UVA - 10474 - Where is the Marble
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=98&page=show_problem&problem=1415解题:#include #include #include #include using namespace std;// #define原创 2014-04-26 22:26:16 · 509 阅读 · 0 评论 -
UVA - 10161 - Ant on a Chessboard
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=99&page=show_problem&problem=1102#include #include #include using namespace std;// #define LOCAL_TESTi原创 2014-05-11 21:32:26 · 682 阅读 · 0 评论 -
UVA - 10494 - If We Were a Child Again
#include #include #include #include using namespace std;// #define LOCAL_TESTconst int MAXN = 10000;int ChToNum(char ch){ return ch - '0';}char NumToCh(int i){ return i + '0';}原创 2014-04-19 22:38:22 · 531 阅读 · 0 评论 -
UVA - 458 - The Decoder
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=399原创 2014-04-06 21:02:46 · 462 阅读 · 0 评论 -
UVA - 10106 - Product
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=97&page=show_problem&problem=1047原创 2014-04-16 22:25:27 · 495 阅读 · 0 评论 -
UVA - 123 - Searching Quickly
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=98&page=show_problem&problem=59原创 2014-05-02 17:26:53 · 726 阅读 · 0 评论 -
UVA - 465 - Overflow
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=97&page=show_problem&problem=406原创 2014-04-16 23:27:22 · 512 阅读 · 0 评论 -
UVA - 424 - Integer Inquiry
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=97&page=show_problem&problem=365#include #include #include #include using namespace std;const int MAXN原创 2014-04-16 21:18:47 · 507 阅读 · 0 评论 -
UVA - 156 - Ananagrams
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=98&page=show_problem&problem=92#include #include #include #include #include #include #include #include原创 2014-05-01 16:44:13 · 654 阅读 · 0 评论 -
UVA - 10115 - Automatic Editing
#include #include #include #include using namespace std;int main(){ int nRule; while ( cin >>nRule ) { if ( nRule == 0 ) { break; } // end if // ignore the \n that just input原创 2014-04-15 23:57:18 · 537 阅读 · 0 评论 -
UVA - 494 - Kindergarten Counting Game
#include #include using namespace std;int main(){ char ch; int nCount; int iFlagLastLetter; nCount = 0; iFlagLastLetter = 0; while ( (ch = cin.get() ) != EOF ) { if ( ch == '\0' )原创 2014-04-06 21:30:13 · 390 阅读 · 0 评论 -
UVA - 10071 - Back to High School Physics
#include using namespace std;int main(){ int a, b; while ( cin >>a >>b ) { cout <<2*a*b <<endl; } // end while return 0;}原创 2014-04-06 14:30:54 · 366 阅读 · 0 评论 -
UVA - 10055 - Hashmat the Brave Warrior
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=94&page=show_problem&problem=996原创 2014-04-06 11:18:57 · 456 阅读 · 0 评论 -
UVA - 113 - Power of Cryptography
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=99&page=show_problem&problem=49#include #include #include using namespace std;// #define LOCAL_TESTint原创 2014-05-11 20:15:58 · 692 阅读 · 0 评论 -
UVA - 694 - The Collatz Sequence
#include #include using namespace std;int main(){ long long num, A, L; long long iCase = 0; while ( 1 ) { cin >>num >>L; A = num; if ( A < 0 && L < 0 ) { break; } // end if i原创 2014-04-09 21:22:28 · 735 阅读 · 0 评论 -
UVA - 340 - Mind Hints
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=98&page=show_problem&problem=276题意:#include #include #include using namespace std;// #define LOCAL_T原创 2014-04-23 23:08:57 · 546 阅读 · 0 评论 -
UVA - 489 - Hangman Judge
#include #include using namespace std;const int MAXLENGTH = 1000;int main(){ int index; char puzzle[MAXLENGTH]; char guess[MAXLENGTH]; memset(puzzle, 0, MAXLENGTH); memset(guess, 0, MAX原创 2014-04-09 19:23:19 · 356 阅读 · 0 评论 -
UVA - 445 - Marvelous Mazes
#include #include using namespace std;int main(){ char ch; int n = 0; while ( (ch=cin.get()) != EOF ) { if ( isdigit(ch) ) { n += (ch-'0'); } // end if else { if ( isalpha(c原创 2014-04-07 22:13:29 · 455 阅读 · 0 评论 -
UVA - 488 - Triangle Wave
#include #include using namespace std;void drawWave(int Amplitude){ int tmp; for ( int i=1; i<=Amplitude; i++ ) { tmp = i; while ( tmp-- ) { cout <<i; } // end while cout <<'\n'原创 2014-04-07 23:01:31 · 411 阅读 · 0 评论 -
UVA - 490 - Rotating Sentences
#include #include #include using namespace std;const int MAXN = 100;const int MAXLENGTH = 100;int main(){ char szStr[MAXN+1][MAXLENGTH+1]; char str[MAXLENGTH+1]; int nCount; int max=0;原创 2014-04-07 20:18:19 · 438 阅读 · 0 评论