ACM题解源代码(UVa)
WuchangI
An optimistic Nobita fond of coding~~
展开
-
UVa 10082(WERTYU)
#includeusing namespace std;//使用常量数组打表char s[] = "`1234567890-=QWERTYUIOP[]\\ASDFGHJKL;'ZXCVBNM,./";int main(void){ int i; char c; while ((c = getchar()) != EOF) { //查表输出 for (i = 1; s[i]原创 2017-07-02 16:11:24 · 511 阅读 · 0 评论 -
UVa 272(TEX Quotes)
#includeusing namespace std;int main(void){ char c; int q = 1;//设置一个标志变量来区分何时取左/右双引号 while ((c = getchar()) != EOF) { if (c == '"') { cout原创 2017-07-02 16:12:58 · 306 阅读 · 0 评论 -
UVa 1585(Score)
逐个字符扫描#include#includeusing namespace std;int main(void){ int T, count, sum; string s; cin >> T; while (T--) { cin >> s; sum = count = 0; for (int i = 0; i < s.length(); i++) { i原创 2017-07-03 23:58:34 · 342 阅读 · 0 评论 -
UVa 1586(Molar mass)
难点在于如何处理字母后面省略的系数1#include#include#include#includeusing namespace std;double Molar(char c){ double M; if (c == 'C') M = 12.01; else if (c == 'H') M = 1.008; else if (c == 'O') M = 16.00;原创 2017-07-04 00:00:34 · 352 阅读 · 0 评论 -
UVa 1225(Digit Counting)
#include#includeusing namespace std;int num[10];//记录0~9每个数字各自出现的次数(下标表示0~9)int main(void){ int T, n, t; cin >> T; while (T--) { cin >> n; memset(num, 0, sizeof(num)); while (n) { t原创 2017-07-04 00:02:57 · 298 阅读 · 0 评论 -
UVa 455(Periodic Strings)
该题的数据量小,直接暴力枚举:依次枚举循环节的长度,进行测试//我自己写的,比较麻烦,虽然也AC了#include#includeusing namespace std;char str[100];int main(void){ int N, len, period; bool flag; cin >> N; while (N--) { cin >> str原创 2017-07-04 10:06:09 · 363 阅读 · 0 评论