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中的其中两个，用式子求剩下的第三个的值。然后输出，里面有一些单位量 m代表“毫”就是原来数据的0.001倍，k代表“千”，是数据的1000倍，M代表兆是数据的10的6次方倍。知道这些根据式子输出未知的第三个值。。。。。。

AC代码：

#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>

using namespace std;

int main()
{
    int T;
    int k = 0;
    scanf("%d",&T);
    while(T--)
    {
        char a[100010];
        int b[10001];
        memset(b,0,sizeof(b));
        getchar();
        gets(a);
        double x1 = 0,x2 = 0,x3 = 0;
        for(int i=0; a[i]!=‘\0‘; i++)
        {
            if((a[i] == ‘U‘ && a[i+1]==‘=‘) || (a[i] == ‘I‘ && a[i+1] == ‘=‘) || (a[i] == ‘P‘ && a[i+1] == ‘=‘))
            {
                if(a[i] == ‘U‘ && a[i+1]==‘=‘)
                {
                    b[‘U‘] = 1;
                    double y1 = 0,y2 = 1;
                    int flag = 0;
                    for(int j=i+2; a[j]!=‘V‘; j++)
                    {
                        if(a[j]>=‘0‘ && a[j]<=‘9‘)
                        {
                            if(flag == 0)
                            {
                                y1 = a[j] - ‘0‘;
                                x1 = (x1*10) + y1;
                            }
                            else if(flag == 1)
                            {
                                y2 = y2 * 0.1;
                                y1 = a[j] - ‘0‘;
                                x1 = x1 + (y2*y1);
                            }

                        }
                        else if(a[j] == ‘.‘)
                        {
                            flag = 1;
                        }
                        else
                        {
                            if(a[j] == ‘m‘)
                            {
                                x1 = x1 * 0.001;
                            }
                            else if(a[j] == ‘k‘)
                            {
                                x1 = x1 * 1000;
                            }
                            else if(a[j] == ‘M‘)
                            {
                                x1 = x1 * 1000000;
                            }
                        }
                    }
                }
                else if(a[i] == ‘I‘ && a[i+1]==‘=‘)
                {
                    b[‘I‘] = 1;
                    double y1 = 0,y2 = 1;
                    int flag = 0;
                    for(int j=i+2; a[j]!=‘A‘; j++)
                    {
                        if(a[j]>=‘0‘ && a[j]<=‘9‘)
                        {
                            if(flag == 0)
                            {
                                y1 = a[j] - ‘0‘;
                                x2 = (x2*10) + y1;
                            }
                            else if(flag == 1)
                            {
                                y2 = y2 * 0.1;
                                y1 = a[j] - ‘0‘;
                                x2 = x2 + (y2*y1);
                            }

                        }
                        else if(a[j] == ‘.‘)
                        {
                            flag = 1;
                        }
                        else
                        {
                            if(a[j] == ‘m‘)
                            {
                                x2 = x2 * 0.001;
                            }
                            else if(a[j] == ‘k‘)
                            {
                                x2 = x2 * 1000;
                            }
                            else if(a[j] == ‘M‘)
                            {
                                x2 = x2 * 1000000;
                            }
                        }
                    }
                }
                else
                {
                    b[‘P‘] = 1;
                    double y1 = 0,y2 = 1;
                    int flag = 0;
                    for(int j=i+2; a[j]!=‘W‘; j++)
                    {
                        if(a[j]>=‘0‘ && a[j]<=‘9‘)
                        {
                            if(flag == 0)
                            {
                                y1 = a[j] - ‘0‘;
                                x3 = (x3*10) + y1;
                            }
                            else if(flag == 1)
                            {
                                y2 = y2 * 0.1;
                                y1 = a[j] - ‘0‘;
                                x3 = x3 + (y2*y1);
                            }

                        }
                        else if(a[j] == ‘.‘)
                        {
                            flag = 1;
                        }
                        else
                        {
                            if(a[j] == ‘m‘)
                            {
                                x3 = x3 * 0.001;
                            }
                            else if(a[j] == ‘k‘)
                            {
                                x3 = x3 * 1000;
                            }
                            else if(a[j] == ‘M‘)
                            {
                                x3 = x3 * 1000000;
                            }
                        }
                    }
                }
            }
        }
        printf("Problem #%d\n",++k);
        if(b[‘U‘] == 1 && b[‘I‘] == 1)
        {
            printf("P=%0.2lfW\n\n",x1*x2);
        }
        else if(b[‘U‘] == 1 && b[‘P‘] == 1)
        {
            printf("I=%0.2lfA\n\n",x3/x1);
        }
        else if(b[‘P‘] == 1 && b[‘I‘] == 1)
        {
            printf("U=%0.2lfV\n\n",x3/x2);
        }
    }
    return 0;
}

UVA Artificial Intelligence?(模拟)

声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉：投诉/举报工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。

联系
我们