zzuoj--10399--Turing equation(模拟)
来源:互联网 发布:apache服务进程 编辑:程序博客网 时间:2024/05/19 08:06
Turing equation
Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 152 Solved: 85
[Submit][Status][Web Board]
Description
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.
Input
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.
Output
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.
Sample Input
73+42=165+8=130001000+000200=000300+0=0
Sample Output
TRUEFALSETRUE
HINT
Source
#include<iostream>#include<cstring>#include<cstdio>#include<cmath>#include<algorithm>using namespace std;#define mem(x,y) memset(x,y,sizeof(x))#define SI(x) scanf("%d",&x)#define SL(x) scanf("%lld",&x)#define PI(x) printf("%d",x)#define PL(x) printf("%lld",x)#define P_ printf(" ")const int INF=0x3f3f3f3f;const double PI=acos(-1.0);typedef long long LL;char s[35],t[10];int ans[3];int main(){while(scanf("%s",s),strcmp(s,"0+0=0")){int k=0,tp=0,temp=0;for(int i=0;s[i];i++){if(isdigit(s[i])){t[k++]=s[i];}else{reverse(t,t+k);for(int j=0;j<k;j++)temp=temp*10+t[j]-'0';ans[tp++]=temp;k=0;temp=0;}}reverse(t,t+k);for(int j=0;j<k;j++)temp=temp*10+t[j]-'0';ans[tp++]=temp;if(ans[0]+ans[1]==ans[2])puts("TRUE");else puts("FALSE");}return 0;}
0 0
- zzuoj--10399--Turing equation(模拟)
- zzuoj 10399: F.Turing equation
- 第七届河南省赛 zzuoj 10399: F.Turing equation (模拟)
- Turing equation
- Turing equation
- Turing equation
- Turing equation
- NYOJ 1253 Turing equation【题意是关键,模拟】
- F.Turing equation
- NYOJ 1253 Turing equation
- F题 Turing equation
- NYOJ 1253 Turing equation (第七届河南省赛)
- 练习场 1253 Turing equation
- 河南省第七届ACM【Turing equation】
- 【第七届河南省赛】F.Turing equation
- Prolog 模拟 Turing Machine
- UESTC - 1039 Fabricate equation (DFS&模拟)
- nyoj1253 Turing equation(第七届河南省程序设计大赛)
- Codeforces Round #332 (Div. 2) B. Spongebob an Joke (水)
- leetcode 303. Range Sum Query - Immutable
- qt数据写入文件和读取文件里的数据
- 按概率输出相应的随机数
- MP3文件结构及编解码流程
- zzuoj--10399--Turing equation(模拟)
- Qt之界面实现技巧
- CI 系统搭建:Git、Gerrit与Jenkins
- leetcode112---Path Sum
- 最近涉及reflector中反编代码修改,在此积累经验(三)
- Java scanner split useDelimiter 用法小议
- Java数组的基本操作方法整理
- 创建Android自定义组合控件
- 资源路径