备案控制台
探索云世界
开发者社区 开发与运维 文章 正文

UVA之537 - Artificial Intelligence?

2014-05-01 1439
版权
版权声明：
本文内容由阿里云实名注册用户自发贡献，版权归原作者所有，阿里云开发者社区不拥有其著作权，亦不承担相应法律责任。具体规则请查看《 阿里云开发者社区用户服务协议》和 《阿里云开发者社区知识产权保护指引》。如果您发现本社区中有涉嫌抄袭的内容，填写 侵权投诉表单进行举报，一经查实，本社区将立刻删除涉嫌侵权内容。
简介：

  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 plain copy
  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>  

文章标签：
C++
Web App开发
sjf0115
目录
相关文章
auqbllxiu
《Learning Disentangled Representations for Recommendation原文》电子版地址
Learning Disentangled Representations for Recommendation原文
auqbllxiu
56 0
《Learning Disentangled Representations for Recommendation原文》电子版地址
邻泽居士
|
决策智能
博弈论 斯坦福game theory stanford week 7.1
title: 博弈论 斯坦福game theory stanford week 7-0 tags: note notebook: 6- 英文课程-15-game theory --- 博弈论 斯坦福game theory stanford week 7-0 coalitional game theory taste 联盟博弈论 我们在联盟博弈论中讨论的并不是一个个人的博弈了 而变成了一个联盟的博弈。
邻泽居士
996 0
邻泽居士
|
机器学习/深度学习 BI 决策智能
博弈论 斯坦福game theory stanford week 7.1_
title: 博弈论 斯坦福game theory stanford week 7-1 tags: note notebook: 6- 英文课程-15-game theory --- 博弈论 斯坦福game theory stanford week 7-1 1。
邻泽居士
1290 0
邻泽居士
|
决策智能 Perl Go
博弈论 斯坦福game theory stanford week 6.3_
title: 博弈论 斯坦福game theory stanford week 6-2 tags: note notebook: 6- 英文课程-15-game theory --- 博弈论 斯坦福game theory stanford week 6-3 1。
邻泽居士
1129 0
邻泽居士
|
决策智能
博弈论 斯坦福game theory stanford week 6.0_
title: 博弈论 斯坦福game theory stanford week 6-0 tags: note notebook: 6- 英文课程-15-game theory --- 博弈论 斯坦福game theory stanford week 6-0 Bayesian Games: Tast...
邻泽居士
994 0
邻泽居士
|
决策智能
博弈论 斯坦福game theory stanford week 5.1_
title: 博弈论 斯坦福game theory stanford week 5-1 tags: note notebook: 6- 英文课程-15-game theory --- 博弈论 斯坦福game theory stanford week 5-1 练习 1.
邻泽居士
1004 0
邻泽居士
|
决策智能
博弈论 斯坦福game theory stanford week 5.0_
title: 博弈论 斯坦福game theory stanford week 5-0 tags: note notebook: 6- 英文课程-15-game theory --- 博弈论 斯坦福game theory stanford week 5-0 repeated Games 重复游戏 ...
邻泽居士
973 0
邻泽居士
|
决策智能
博弈论 斯坦福game theory stanford week 3.1_
title: 博弈论 斯坦福game theory stanford week 3-1 tags: note notebook: 6- 英文课程-15-game theory --- 博弈论 斯坦福game theory stanford week 3-1 最大最小策略 这是一种相对比较保守的策略：最大最小值策略是某个决策者选择策略中让其最小收益最大化的策略，最大最小值是他选择这个策略的最小收益 用如下定义表示： 我们为什么要使用这种策略呢？ 正是因为要达到优势策略均衡或纳什均衡是需要绝对理性的。
邻泽居士
1058 0
邻泽居士
|
决策智能
博弈论 斯坦福game theory stanford week 2.1_
title: 博弈论 斯坦福game theory stanford week 2-0 tags: note notebook: 6- 英文课程-15-game theory --- 博弈论 斯坦福game theory stanford week 2-0 习题 1。
邻泽居士
951 0
邻泽居士
|
决策智能
博弈论 斯坦福game theory stanford week 3.2_
title: 博弈论 斯坦福game theory stanford week 3-1 tags: note notebook: 6- 英文课程-15-game theory --- 博弈论 斯坦福game theory stanford week 3-1 习题 第 1 个问题 We say t...
邻泽居士
862 0