# 第七届河南省程序设计大赛——F 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

ac代码：

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdio>
#define INF 99999999
using namespace std;
int main()
{
string ss;
while(1){
cin>>ss;
if(ss=="0+0=0")break;
int sum1=0,i=ss.size()-1;
while(ss[i]!='='){
sum1=sum1*10+ss[i]-'0';
i--;
}
int t1=0,t2=0;
i--;
while(ss[i]!='+'){
t1=t1*10+ss[i]-'0';
i--;
}
i--;
while(i>=0){
t2=t2*10+ss[i]-'0';
i--;
}
if(t1+t2==sum1)cout<<"TRUE"<<endl;
else cout<<"FALSE"<<endl;
}
return 0;
}

• 点赞
• 评论
• 分享
x

海报分享

扫一扫，分享海报

• 收藏
• 打赏

打赏

来自师范的学渣

你的鼓励将是我创作的最大动力

C币 余额
2C币 4C币 6C币 10C币 20C币 50C币
• 举报
• 一键三连

点赞Mark关注该博主, 随时了解TA的最新博文
11-25 1018
05-05 516

07-23 140
04-26 375
04-23 2910