ACM-uva-Running
Fate_O
Lets go
展开
-
ACM-uva10010
#include #include #include using namespace std; #define MAXN 50 + 5 int temp[MAXN][MAXN]; int r, c; int dir[8][2] = { 0, -1, -1, 0, 0, 1, 1, 0, -1, -1, -1, 1, 1, 1, 1, -1 }; int ansr, ansc;原创 2013-10-20 19:31:50 · 544 阅读 · 0 评论 -
ACM->uva748
#include #include #include #include using namespace std; #define MAXN 500 + 50 int a[MAXN], b[MAXN]; int c[MAXN]; int record; void output(int temp[], int t) { int u = 0, v = 0; for (int i原创 2013-10-20 19:39:08 · 479 阅读 · 0 评论 -
ACM->uva465
#include #include #include #include using namespace std; #define MAXN 500 + 50 int a[MAXN], b[MAXN]; int c[MAXN]; int cmp[10] = { 7, 4, 6, 3, 8, 4, 7, 4, 1, 2 }; bool is_big(int temp[]) { i原创 2013-10-20 19:38:45 · 623 阅读 · 0 评论 -
ACM-uva10106
#include #include #include #include using namespace std; #define MAXN 500 + 50 int a[MAXN], b[MAXN]; int c[MAXN]; void input() { string str1, str2; while (cin >> str1 >> str2) { int len原创 2013-10-20 19:38:21 · 483 阅读 · 0 评论 -
ACM-uva424
#include #include #include using namespace std; #define MAXN 100 + 100 int ans[MAXN]; int add[MAXN]; void input() { string str; memset(ans, 0, sizeof(ans)); while (cin >> str) { if (s原创 2013-10-20 19:37:18 · 499 阅读 · 0 评论 -
ACM-uva10115
#include #include #include #include #include using namespace std; #define MAXN 10 + 5 string rules[MAXN]; string change[MAXN]; string str; void input() { int n; while (scanf("%d", &n) !=原创 2013-10-20 19:36:45 · 459 阅读 · 0 评论 -
ACM->uva644
#include #include #include #include #include using namespace std; #define MAXN 10 + 5 string str; string in[MAXN]; void input() { int tot = 0, k = 0; while (getline(cin, str)) { if (st原创 2013-10-20 19:36:11 · 476 阅读 · 0 评论 -
ACM->uva10878
#include #include #include #include #include using namespace std; string str; void input() { while (getline(cin, str)) { if (str[0] == '|') { int ans = 0; for (int i = 1; i < s原创 2013-10-20 19:35:36 · 499 阅读 · 0 评论 -
ACM-uva10815
#include #include #include #include #include #include #include using namespace std; string str; map store; map ::iterator it; char change(char ch) { if (ch >= 'A' && ch <= 'Z') { ch +=原创 2013-10-20 19:35:02 · 557 阅读 · 0 评论 -
ACM->uva409
#include #include #include #include #include using namespace std; #define MAXN 20 + 5 string excuses[MAXN], keywords[MAXN]; string excusess[MAXN]; int n, m; int num[MAXN]; char change(char c原创 2013-10-20 19:34:38 · 561 阅读 · 0 评论 -
ACM->uva573
#include #include #include using namespace std; #define INF 1e20 string str; double p, u, i; double change(int x) { double res = 0; int u = -1, end = -1; char ch; const double m = 0.0原创 2013-10-20 19:34:06 · 505 阅读 · 0 评论 -
ACM-uva10361
#include #include #include using namespace std; string str1, str2, str3, str4, str5; string str, Str; void destruction() { str1 = str2 = str3 = str4 = str5 = ""; int num = 0; for (int i =原创 2013-10-20 19:33:11 · 554 阅读 · 0 评论 -
ACM->uva401
/* 找回文,i != n - i - 1; 镜像 Reverse i != n - i - 1 */ #include #include #include #include using namespace std; char Reverse[35] = { 'A', '#', '#', '#', '3', '#', '#', 'H', 'I', 'L', '#',原创 2013-10-20 19:30:52 · 608 阅读 · 0 评论 -
ACM->uva10494
#include #include #include #include #include #include using namespace std; #define MAXN 1000 + 10 struct Bign { int len; int s[MAXN]; }a, ans; void output(Bign temp) { int u = 0; while原创 2013-10-20 19:39:38 · 572 阅读 · 0 评论