关闭

NYOJ 1253 Turing equation (第七届河南省赛)

269人阅读 评论(0) 收藏 举报
分类:
Turing equation
时间限制:1000 ms | 内存限制:65535 KB
难度:1
描述
The fight goes on, whether to store numbers starting with their most significant digit or their least significant digit. Sometimes this is also called the "Endian War". The battleground dates far back into the early days of computer science. Joe Stoy, in his (by the way excellent) book "Denotational Semantics", tells following story:
"The decision which way round the digits run is, of course, mathematically trivial. Indeed, one early British computer had numbers running from right to left (because the spot on an oscilloscope tube runs from left to right, but in serial logic the least significant digits are dealt with first). Turing used to mystify audiences at public lectures when, quite by accident, he would slip into this mode even for decimal arithmetic, and write things like 73+42=16. The next version of the machine was made more conventional simply by crossing the x-deflection wires: this, however, worried the engineers, whose waveforms were all backwards. That problem was in turn solved by providing a little window so that the engineers (who tended to be behind the computer anyway) could view the oscilloscope screen from the back.

You will play the role of the audience and judge on the truth value of Turing's equations.

输入
The input contains several test cases. Each specifies on a single line a Turing equation. A Turing equation has the form "a+b=c", where a, b, c are numbers made up of the digits 0,...,9. Each number will consist of at most 7 digits. This includes possible leading or trailing zeros. The equation "0+0=0" will finish the input and has to be processed, too. The equations will not contain any spaces.
输出
For each test case generate a line containing the word "TRUE" or the word "FALSE", if the equation is true or false, respectively, in Turing's interpretation, i.e. the numbers being read backwards.
样例输入
73+42=16
5+8=13
0001000+000200=00030
0+0=0
样例输出
TRUE
FALSE
TRUE
来源

第七届河南省程序设计大赛

题意:

如果从右往左读取,满足式子输出“TRUE”否则输出“FALSE”


代码:

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>


using namespace std;

int main()
{
    string s;
    while(cin>>s)
    {
        if(s=="0+0=0")
            break;
        reverse(s.begin(),s.end());///从右往左
        int x1=0,x2=0,x3=0;//存放不超过七位数的各个数
        for(int i=0; i<s.length();)
        {

            while(s[i]!='='&&i<s.length())
            {
                x1=x1*10+s[i++]-'0';  ///等号之前的取出来

            }
            i++;
            while(s[i]!='+'&&i<s.length())
            {
                x2=x2*10+s[i++]-'0';///加号之前的取出来
            }
            i++;
            while(i<s.length())
            {
                x3=x3*10+s[i++]-'0';///最后的取出来
            }
        }
       if(x1==x2+x3) ///如果满足的话TRUE
        cout<<"TRUE"<<endl;
        else
            cout<<"FALSE"<<endl;

    }
    return 0;
}


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:15958次
    • 积分:918
    • 等级:
    • 排名:千里之外
    • 原创:80篇
    • 转载:1篇
    • 译文:0篇
    • 评论:0条