# NYOJ　１２５３　Turing equation　（第七届河南省赛）

Turing equation

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

#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;
}


• 本文已收录于以下专栏：

## NYOJ 1253 Turing equation

Turing equation 时间限制：1000 ms  |  内存限制：65535 KB 难度：1 描述 The fight goes on, whether to s...
• yjf3151731373
• 2016年05月25日 14:34
• 128

## 河南省第七届ACM【Turing equation】

【Description】 The fight goes on,whether to store  numbers starting withtheir most significant digit ...
• u012970471
• 2015年04月21日 11:06
• 315

## 【第七届河南省赛】F.Turing equation

Description The fight goes on, whether to store  numbers starting with their most significant digit...
• u012970471
• 2015年05月06日 11:52
• 430

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

• su20145104009
• 2016年05月27日 21:39
• 3853

## 练习场 1253 Turing equation

• u014360070
• 2016年07月27日 21:27
• 73

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

**题目描述 The fight goes on, whether to store numbers starting with their most significant digit or t...
• hello_sheep
• 2017年04月26日 18:48
• 322

## 河南省第十届ACM赛题

• z956281507
• 2017年05月08日 16:56
• 927

## 【第七届河南省赛】 H.Rectangles

Description Given N (4
• u012970471
• 2015年05月06日 22:08
• 411

## 第七届蓝桥杯省赛个人题解

【C/C++ B组题目】 第一题：煤球数目 有一堆煤球，堆成三角棱锥形。具体： 第一层放1个， 第二层3个（排列成三角形）， 第三层6个（排列成三角形）， 第四层10个（排列成三角形）， .... 如...
• slime_kirito
• 2016年03月20日 17:18
• 2881

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

Turing equation 时间限制：1000 ms  |  内存限制：65535 KB 难度：1 描述 The fight goes on, whether to s...
• hurmishine
• 2016年08月22日 12:28
• 863

举报原因： 您举报文章：NYOJ　１２５３　Turing equation　（第七届河南省赛） 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)