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

原创 2016年05月30日 15:00:59
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;
}


nyoj1253 Turing equation(第七届河南省程序设计大赛)

题目1253 题目信息 运行结果 本题排行 讨论区 Turing equation 时间限制:1000 ms  |  内存限制:65535 KB 难度:1 ...

河南省第七届省赛 问题 F: Turing equation 水题

**题目描述 The fight goes on, whether to store numbers starting with their most significant digit or t...

NYOJ 1253 Turing equation【题意是关键,模拟】

Turing equation 时间限制:1000 ms  |  内存限制:65535 KB 难度:1 描述 The fight goes on, whether to s...

CentOS6.5菜鸟之旅:文件权限详解 一、前言                                 Linux下所有资源、设备均被视作文件来操作,而文件权限则是决定用户可各文件

CentOS6.5菜鸟之旅:文件权限详解 一、前言                                   Linux下所有资源、设备均被视作文件来操作,而文件权限则是...
  • cdnight
  • cdnight
  • 2017年05月31日 19:49
  • 340

NYOJ 1067 Compress String(区间DP)

 Compress String 时间限制:2000 ms  |  内存限制:65535 KB 难度:3 描述 One day,a beautiful g...

NYOJ 求逆序数

点击打开链接 /* * 归并排序是将两个(或两个以上)有序表合并成一个新的有序表,即把待排序序列分为 * 若干个子序列,每个子序列是有序的,然后再把有序的子序列合并为整体有序序列 * 归并排序是...

nyoj 取石子(三)(尼姆博弈的定理运用)

取石子(三) 时间限制:1000 ms |  内存限制:1000 KB 难度:6 描述 小王喜欢与同事玩一些小游戏,今天他们选择了玩取石子。 游戏规则如下:共有N堆石子,已知每堆中石子的数...

NYOJ 42:一笔画问题【欧拉回路】

一笔画问题 时间限制:3000 ms  |  内存限制:65535 KB 难度:4 描述 zyc从小就比较喜欢玩一些小游戏,其中就包括画一笔画,他想请你帮他写一个程序,判断一个图是否能够用...

nyoj Wythoff Game(暴力枚举)

Wythoff Game 时间限制:1000 ms |  内存限制:65535 KB 难度:1 描述 最近ZKC同学在学博弈,学到了一个伟大的博弈问题--威佐夫博弈。 相信大家都学过了吧?...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:NYOJ 1253 Turing equation (第七届河南省赛)
举报原因:
原因补充:

(最多只允许输入30个字)