UVa 537 Artificial Intelligence? (字符串查找与匹配)
2013-09-28 23:21
309 查看
537 - Artificial Intelligence?
Time limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=96&page=show_problem&problem=478
Physics teachers in high school often think that problems given as text are more demanding than pure computations. After all, the pupils have to read and understand the problem first!
So they don't state a problem like ``U=10V, I=5A, P=?" but rather like ``You have an electrical circuit that contains a battery with a voltage of U=10V and a light-bulb. There's an electrical current of
I=5A through the bulb. Which power is generated in the bulb?".
However, half of the pupils just don't pay attention to the text anyway. They just extract from the text what is given: U=10V, I=5A. Then they think: ``Which formulae do I know? Ah yes, P=U*I. Therefore P=10V*5A=500W.
Finished."
OK, this doesn't always work, so these pupils are usually not the top scorers in physics tests. But at least this simple algorithm is usually good enough to pass the class. (Sad but true.)
Today we will check if a computer can pass a high school physics test. We will concentrate on the P-U-I type problems first. That means, problems in which two of power, voltage and current are given and the
third is wanted.
Your job is to write a program that reads such a text problem and solves it according to the simple algorithm given above.
Input
The first line of the input file will contain the number of test cases.Each test case will consist of one line containing exactly two data fields and some additional arbitrary words. A data field will be of the form I=xA, U=xV or P=xW,
where x is a real number.
Directly before the unit (A, V or W) one of the prefixes m (milli), k (kilo) and M (Mega) may also occur. To summarize it: Data fields adhere to the following grammar:
DataField ::= Concept '=' RealNumber [Prefix] Unit Concept ::= 'P' | 'U' | 'I' Prefix ::= 'm' | 'k' | 'M' Unit ::= 'W' | 'V' | 'A'
Additional assertions:
The equal sign (`=') will never occur in an other context than within a data field.
There is no whitespace (tabs,blanks) inside a data field.
Either P and U, P and I, or U and I will be given.
Output
For each test case, print three lines:a line saying ``Problem #k" where k is the number of the test case
a line giving the solution (voltage, power or current, dependent on what was given), written without a prefix and with two decimal places as shown in the sample output
a blank line
Sample Input
3 If the voltage is U=200V and the current is I=4.5A, which power is generated? A light-bulb yields P=100W and the voltage is U=220V. Compute the current, please. bla bla bla lightning strike I=2A bla bla bla P=2.5MW bla bla voltage?
Sample Output
Problem #1 P=900.00W Problem #2 I=0.45A Problem #3 U=1250000.00V
从左往右,从右往左,找 '='。
完整代码:
/*0.019s*/ #include<cstdio> #include<cctype> #include<cstdlib> #include<cstring> char str[1000]; double num(char *str, int i, char unit) { int j; double prefixes = 1.0; for (j = i; str[j] != unit; j++) ; if (isalpha(str[j - 1])) { if (str[j - 1] == 'm') prefixes = 0.001; else if (str[j - 1] == 'k') prefixes = 1000.0; else prefixes = 1000000.0; } return atof(str + i + 1) * prefixes;///还好数字后面不是e或E~ } int main(void) { double U, I, P; int n, i, count = 0; scanf("%d\n", &n); while (n--) { U = I = P = -1.0; gets(str); int l = strlen(str); for (i = 0; str[i] != '='; i++) ; if (str[i - 1] == 'U') U = num(str, i, 'V'); else if (str[i - 1] == 'P') P = num(str, i, 'W'); else I = num(str, i, 'A'); for (i = l - 1; str[i] != '='; i--) ; if (str[i - 1] == 'U') U = num(str, i, 'V'); else if (str[i - 1] == 'P') P = num(str, i, 'W'); else I = num(str, i, 'A'); printf("Problem #%d\n", ++count); if (U == -1.0) printf("U=%.2fV\n\n", P / I); else if (P == -1.0) printf("P=%.2fW\n\n", U * I); else printf("I=%.2fA\n\n", P / U); } return 0; }
相关文章推荐
- UVA 537 字符串中的公式计算字母识别
- 二叉树查找、匹配字符串、快速排序
- 【算法学习】horspool查找匹配字符串
- UVA 537 - Artificial Intelligence?(字符串)
- 利用Linux 自带的GNU正则表达式库实现查找字符串中全部匹配左右边界限定的子串
- 汇编实验——查找匹配字符串
- linux shell 字符串操作(长度,查找,替换,匹配)详解
- LINUX 在 指定目录下,包括子目录,查找文件中内容匹配的字符串
- 程序员编程艺术:第二章、字符串是否包含及匹配/查找/转换/拷贝问题
- uva 537 Artificial Intelligence?(字符串模拟)
- linux查找目录下匹配字符串的文件命令
- uva 10010 Where's Waldorf?(DFS字符串查找)
- 程序员编程艺术:第二章、字符串是否包含及匹配/查找/转换/拷贝问题
- 运行一个命令或程序获取结果/正则表达式查找匹配/分隔字符串
- 程序员编程艺术:第二章、字符串是否包含及匹配/查找/转换/拷贝问题
- 程序员编程艺术:第二章、字符串是否包含及匹配/查找/转换/拷贝问题
- objective-c 字符串查找并删除创建可变字符串重新设置字符串查找第一个并替换查找全部匹配的,并替换
- 朴素匹配算法-子字符串的查找
- UVa537 - Artificial Intelligence?-字符串(混合字符实数输入)-难度3
- UVA 11019 Matrix Matcher 矩阵匹配器 AC自动机 二维文本串查找二维模式串