NYOJ 1253 Turing equation
来源:互联网 发布:js 判断数组是否为空 编辑:程序博客网 时间:2024/06/05 06:42
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=165+8=130001000+000200=000300+0=0
- 样例输出
TRUEFALSETRUE
- 来源
第七届河南省程序设计大赛
题意使翻转得数字相等,坑点是字符数字相等
#include <iostream>
#include <string>
#include <algorithm>
#include <cctype>
using namespace std;
int main()
{
string s;
while(cin>>s)
{
reverse(s.begin(),s.end());技巧,简化模拟过程
int a=0, b=0, c=0, flag=0;
for(int i=0;s[i];i++)
{
if(isdigit(s[i])&&flag==0)
{
a=a*10+(s[i]-'0');
}
else if(isdigit(s[i])&&flag==1)
{
b=b*10+(s[i]-'0');
}
else if(isdigit(s[i])&&flag==2)
{
c=c*10+(s[i]-'0');
}
else
{
flag++;
}
}
if(!a&&!b&&!c)
{
break;
}
else if(a==b+c)
{
cout<<"TRUE"<<endl;
}
else
{
cout<<"FALSE"<<endl;
}
}
return 0;
}
- NYOJ 1253 Turing equation
- NYOJ 1253 Turing equation (第七届河南省赛)
- NYOJ 1253 Turing equation【题意是关键,模拟】
- 练习场 1253 Turing equation
- Turing equation
- Turing equation
- Turing equation
- Turing equation
- F.Turing equation
- F题 Turing equation
- zzuoj 10399: F.Turing equation
- 河南省第七届ACM【Turing equation】
- 【第七届河南省赛】F.Turing equation
- zzuoj--10399--Turing equation(模拟)
- nyoj1253 Turing equation(第七届河南省程序设计大赛)
- NYOJ1253 第七届acm省赛 F Turing equation
- 河南省第七届省赛 问题 F: Turing equation 水题
- 第七届河南省赛 zzuoj 10399: F.Turing equation (模拟)
- RSA分段加密分段解密以及密钥与.Net的转化
- EOJ-1270 Arbitrage(套利交易)
- 在vmare的虚拟机上部署spark1.5.2的ha(成功)和在openstack的虚拟机上部署spark1.5.2的ha(失败)
- Linux Shell系列教程之(三)Shell变量
- JAVA输入输出
- NYOJ 1253 Turing equation
- 【算法】最近公共祖先之在线算法(RMQ-ST)
- 微信公众号支付jsapi
- leetcode 318. Maximum Product of Word Lengths
- ASP.NET Image控件即时刷新
- java基础总结
- iOS开发----懒加载
- 微信批量获取用户基本信息接口
- 一台机器上启动多个Tomcat