码迷，mamicode.com
首页 > 其他好文 > 详细

UVA之537 - Artificial Intelligence?

时间：2014-05-02 23:39:35      阅读：485      评论：0      收藏：0      [点我收藏+]

标签：剑指offer   校园招聘   uva   

  Artificial Intelligence? 

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


Miguel A. Revilla 
1999-01-11

【题意】：
根据P = U * I公式进行计算。
输入一行字符串，其中给出P,U,I三个变量的任意两个值求出第三个值。

【代码】：
[cpp] view plaincopy
  1. <span style="font-style: normal;">/********************************* 
  2. *   日期：2013-4-28 
  3. *   作者：SJF0115 
  4. *   题号: 题目537 - Artificial Intelligence? 
  5. *   来源：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=7&page=show_problem&problem=478 
  6. *   结果：AC 
  7. *   来源：UVA 
  8. *   总结： 
  9. **********************************/  
  10. #include<stdio.h>  
  11. #include<string.h>  
  12.   
  13. int main (){  
  14.     int i,j,Case,index=1;  
  15.     double P,I,U,c;  
  16.     char str[1001];  
  17.     //freopen("C:\\Users\\XIAOSI\\Desktop\\acm.txt","r",stdin);    
  18.     while(scanf("%d\n",&Case) != EOF){  
  19.         while(Case--){  
  20.             P = 0;  
  21.             I = 0;  
  22.             U = 0;  
  23.             c = 1;  
  24.             gets(str);  
  25.             for(i = 0;i < strlen(str);){  
  26.                 //P  
  27.                 if(str[i] == ‘P‘ && str[i+1] == ‘=‘){  
  28.                     i += 2;  
  29.                     //提取小数点前数据  
  30.                     while(str[i] >= ‘0‘ && str[i] <= ‘9‘){  
  31.                         P = P * 10 + str[i] - ‘0‘;  
  32.                         i++;  
  33.                     }  
  34.                     //提取小数点后数据  
  35.                     if(str[i] == ‘.‘){  
  36.                         i++;  
  37.                         while(str[i] >= ‘0‘ && str[i] <= ‘9‘){  
  38.                             c *= 0.1;   
  39.                             P += c * (str[i] - ‘0‘);  
  40.                             i++;  
  41.                         }  
  42.                     }  
  43.                     c = 1;  
  44.                     if(str[i] == ‘k‘){  
  45.                         P *= 1000;  
  46.                         i++;  
  47.                     }  
  48.                     else if(str[i] == ‘m‘){  
  49.                         P /= 1000;  
  50.                         i++;  
  51.                     }  
  52.                     else if(str[i] == ‘M‘){  
  53.                         P *= 1000000;   
  54.                         i++;  
  55.                     }  
  56.                 }  
  57.                 //U  
  58.                 else if(str[i] == ‘U‘ && str[i+1] == ‘=‘){  
  59.                     i += 2;  
  60.                     //提取小数点前数据  
  61.                     while(str[i] >= ‘0‘ && str[i] <= ‘9‘){  
  62.                         U = U * 10 + str[i] - ‘0‘;  
  63.                         i++;  
  64.                     }  
  65.                     //提取小数点后数据  
  66.                     if(str[i] == ‘.‘){  
  67.                         i++;  
  68.                         while(str[i] >= ‘0‘ && str[i] <= ‘9‘){  
  69.                             c *= 0.1;   
  70.                             U += c * (str[i] - ‘0‘);  
  71.                             i++;  
  72.                         }  
  73.                     }  
  74.                     c = 1;  
  75.                     if(str[i] == ‘k‘){  
  76.                         U *= 1000;  
  77.                         i++;  
  78.                     }  
  79.                     else if(str[i] == ‘m‘){  
  80.                         U /= 1000;  
  81.                         i++;  
  82.                     }  
  83.                     else if(str[i] == ‘M‘){  
  84.                         U *= 1000000;   
  85.                         i++;  
  86.                     }  
  87.                 }  
  88.                 //I  
  89.                 else if(str[i] == ‘I‘ && str[i+1] == ‘=‘){  
  90.                     i += 2;  
  91.                     //提取小数点前数据  
  92.                     while(str[i] >= ‘0‘ && str[i] <= ‘9‘){  
  93.                         I = I * 10 + str[i] - ‘0‘;  
  94.                         i++;  
  95.                     }  
  96.                     //提取小数点后数据  
  97.                     if(str[i] == ‘.‘){  
  98.                         i++;  
  99.                         while(str[i] >= ‘0‘ && str[i] <= ‘9‘){  
  100.                             c *= 0.1;   
  101.                             I += c * (str[i] - ‘0‘);  
  102.                             i++;  
  103.                         }  
  104.                     }  
  105.                     c = 1;  
  106.                     if(str[i] == ‘k‘){  
  107.                         I *= 1000;  
  108.                         i++;  
  109.                     }  
  110.                     else if(str[i] == ‘m‘){  
  111.                         I /= 1000;  
  112.                         i++;  
  113.                     }  
  114.                     else if(str[i] == ‘M‘){  
  115.                         I *= 1000000;   
  116.                         i++;  
  117.                     }  
  118.                 }  
  119.                 i++;  
  120.             }  
  121.             //输出  
  122.             printf("Problem #%d\n",index);  
  123.             if(P > 0 && I > 0){  
  124.                 printf("U=%.2lfV\n",P / I);  
  125.             }  
  126.             else if(P > 0 && U > 0){  
  127.                 printf("I=%.2lfA\n",P / U);  
  128.             }  
  129.             else if(U > 0 && I > 0){  
  130.                 printf("P=%.2lfW\n",U * I);  
  131.             }  
  132.             printf("\n");  
  133.             index++;  
  134.         }  
  135.     }  
  136.     return 0;  
  137. }  
  138.   
  139.       
  140. </span>  

UVA之537 - Artificial Intelligence?,布布扣,bubuko.com

UVA之537 - Artificial Intelligence?

标签：剑指offer   校园招聘   uva   

原文地址：http://blog.csdn.net/sunnyyoona/article/details/24836583
踩
(0)
赞
(0)
   
举报
评论 一句话评论（0）
登录后才能评论！
分享档案
更多>
2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)
周排行
mamicode.com排行更多图片
更多
友情链接
兰亭集智   国之画   百度统计   站长统计   阿里云   chrome插件   新版天听网
关于我们 - 联系我们 - 留言反馈
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码！