摘要：
简单题注意有两个相同单词相邻的情况View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxl 20char st[2][maxl];int main(){ //freopen("t.txt", "r", stdin); int sum = 0; int i = 0; st[1][0] = '\0'; while (scanf 阅读全文
posted @ 2011-08-01 10:46
undefined2024
阅读(450)
评论(0)
推荐(0)
摘要：
简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;char st[50];bool v(char a){ return a =='a' ||a =='e' ||a =='i' ||a =='o' ||a =='u';}bool accept(){ int n = strlen(st); bool found = 阅读全文
posted @ 2011-08-01 10:16
undefined2024
阅读(182)
评论(0)
推荐(0)
摘要：
简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxn 25int n, m, blow, power[maxn];bool on[maxn];void out(int a){ int b = m - a - 1; int x; for (int i = 0; i < b; i++) scanf("%d", &x);}void inpu 阅读全文
posted @ 2011-08-01 10:03
undefined2024
阅读(309)
评论(0)
推荐(0)
摘要：
简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <algorithm>using namespace std;char st[30];int target;void work(){ int len = strlen(st); for (int i = len; i >= 0; i--) for (int j = len; j >= 0; j--) if (i != j) for (in 阅读全文
posted @ 2011-08-01 09:49
undefined2024
阅读(520)
评论(0)
推荐(0)
摘要：
简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxn 10005int n;int dice[maxn][10];int opp[7] ={ 5, 3, 4, 1, 2, 0 };void input(){ scanf("%d", &n); for (int i = 0; i < n; i++) for (int j = 0; j & 阅读全文
posted @ 2011-08-01 09:19
undefined2024
阅读(160)
评论(0)
推荐(0)
浙公网安备 33010602011771号