2015年09月_K_W_CSDN博客

09月 08月 07月

原创 uva489 - Hangman Judge

链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=430 code #include #include int letters[30]; char words[100005],guess[100005]; int main

2015-09-10 16:43:37 334

原创 uva1588 - Kickdown

链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4463 code #include #include #include using namespace std; int getMinLen(char* n1 ,char

2015-09-05 14:37:54 383

原创 uva1587 - Box

链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4462 code #include #include #include using namespace std; struct Node { int w,h; bool oper

2015-09-04 23:15:27 462

原创 uva10340 - All in All

链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1281 code #include #include char s[100005],t[100005]; int main() { while(scanf("%s %s",

2015-09-04 21:24:49 288

原创 uva1368 - DNA Consensus String

链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4114 code #include char DNAs[55][1005]; char result[1005]; int main() { int caseN; sc

2015-09-04 20:18:23 242

原创 uva232 - Crossword Answers

链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=168 code #include #include char puzzle[20][20]; int flags[20][20]; bool isEligible(int i, in

2015-09-04 17:58:21 350

原创 uva227 - Puzzle

链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=163 code #include #include char puzzle[5][5]; bool move(char chs[5][5], int x,int y, in

2015-09-04 14:49:57 386

原创 uva455 - Periodic Strings

链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=396 code #include #include int main() { int n; scanf("%d",&n); while(n--) {

2015-09-04 09:53:45 282

原创 uva1225 - Digit Counting

链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3666 code {CSDN:CODE: #include #include int main() { int total[10]; int n; s

2015-09-02 17:08:07 302

原创 uva1586 - Molar mass

链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4461 code #include #include #include const int maxLen = 100; int getIndex(char *

2015-09-02 16:03:58 359

原创 uva1585 - Score

链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4460 code #include #include const int maxLen = 100; int main() { char s[maxLen];

2015-09-01 23:06:34 430

原创 uva1584 - Circular Sequence

链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4459 code #include #include const int maxn = 105; int less(char* s, int ans, int k)

2015-09-01 16:36:08 357