UVA-537--Artificial Intelligence?(C语言)

简介: UVA-537--Artificial Intelligence?(C语言)

题目描述:

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 likeYou 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=UI. Therefore P=10V5A=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

解题思路:

这个题主要是从字符串中找到等号,把“=”前面的内容记录到一个字符中,再把数字存到另一个字符,判断U、I、P中确少那一个,利用公式进行计算。注意单位应该化到统一的国际单位再计算。

程序代码:

#include<stdio.h>
#include<string.h>
int main()
{
  double t,h,a,b,P,I,U;
  char s[1010];
  int n,k,i,j,cas,f;
  scanf("%d",&n); 
  getchar();
  for(cas=1;cas<=n;cas++)
  {
    printf("Problem #%d\n",cas);
    P=0.0;I=0.0;U=0.0;k=0;
    fgets(s,sizeof(s),stdin);
    for(i=0;s[i]!='\0';i++)
    {
      a=0.0;
      if(s[i+1]=='='&&(s[i]=='U'||s[i]=='P'||s[i]=='I'))
      {
        t=1.0;f=0;
        for(j=i+2;s[j]!='V'&&s[j]!='A'&&s[j]!='W';j++)
        {
          if(s[j]=='m')
            a*=0.001;
          else if(s[j]=='k')
            a*=1000.0;
          else if(s[j]=='M')
            a*=1000000.0;
          else if(s[j]=='.')
            f=1;
          else
          {
            if(f==1)
              a+=(t*=0.1)*(s[j]-'0');
            else
              a=a*10+s[j]-'0';
          } 
        }
        if(s[i]=='P')
          P=a;
        else if(s[i]=='U')
          U=a;
        else
          I=a;
        if(k==0)
        {
          k=1;
          i=j;
        }
        else 
          break;
      }
    }
    if(U==0.0)
      printf("U=%.2lfV\n\n",P/I);
    else if(I==0.0)
      printf("I=%.2lfA\n\n",P/U);
    else 
      printf("P=%.2lfW\n\n",U*I);   
  }
  return 0;
}
相关文章
|
缓存 Ubuntu Unix
Qt实用技巧:在CentOS上使用linuxdeployqt打包发布qt程序
本篇文章依然是继续发布主题,有centOS的qt项目需要发布,系统是CentOS8.2,同时也做了CentOS7.5的发布(CentOS7.5整体差上不差,就是需要先yum卸载自带的cmake,然后源码安装cmake3.4)
Qt实用技巧:在CentOS上使用linuxdeployqt打包发布qt程序
|
Java API Maven
探索Seata Core Context管理:io.seata.core.context.RootContext
探索Seata Core Context管理:io.seata.core.context.RootContext
178 0
|
JavaScript
Vue中$watch()方法和watch属性的区别
Vue中$watch()方法和watch属性的区别
319 1
|
NoSQL
共识协议的技术变迁问题之WPaxos理常态下的IO请求处理如何解决
共识协议的技术变迁问题之WPaxos理常态下的IO请求处理如何解决
234 55
|
机器学习/深度学习 人工智能 前端开发
如何自己训练一个热狗识别模型 | 《阿里云机器学习PAI-DSW入门指南》
本节教大家如何自己训练一个热狗识别模型,之后大家也可以拿这个模型测试一下自己身边长的像是热狗但是又不是热狗的东西,看看到底能得多少分~
如何自己训练一个热狗识别模型 | 《阿里云机器学习PAI-DSW入门指南》
|
JSON 安全 Java
springsecurity和jwt区别
Spring Security是全面的安全框架,适用于多层认证授权的Web应用,提供丰富的认证授权功能和灵活配置。JWT则是轻量级的认证授权机制,基于JSON标准,常用于API调用中的身份验证。Spring Security侧重于复杂的权限管理,而JWT则以简洁高效著称。两者在使用时,Spring Security涉及用户认证授权和定制身份验证策略,JWT则涉及生成和匹配认证令牌。选择哪个取决于具体需求和应用场景。
2222 5
|
BI
【C/PTA】数组练习(编程)
【C/PTA】数组练习(编程)
376 0
|
算法 程序员 C语言
全排列思路解析附C语言实现
全排列思路解析附C语言实现
186 0
|
开发工具 异构计算 内存技术
ZYNQ - 无DDR固化程序(压缩FSBL以能固化更大的应用程序在OCM上)
ZYNQ - 无DDR固化程序(压缩FSBL以能固化更大的应用程序在OCM上)
906 0
ZYNQ - 无DDR固化程序(压缩FSBL以能固化更大的应用程序在OCM上)

热门文章

最新文章