Turing equation
Turing equation
时间限制: 1 Sec 内存限制: 128 MB
题目描述
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
题意概括
输入一个等式a+b=c,判断等式是否成立(a,b,c输入时是倒着输入的,可能存在前导零)
解题思路
输入等式之后,先将a,b,c三个整数求出来,然后判断。
代码
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <math.h>
#include <stdlib.h>
#include <queue>
using namespace std;
int main ()
{
char str[1000];
int a,b,c,i,j,k;
while (scanf("%s",str)!=EOF)
{
if (strcmp(str,"0+0=0")==0)
break;
a = b = c = 0;
int len = strlen(str);
for (i = len-1; i >= 0; i --)
{
if (str[i]>='0' && str[i]<='9')
while (str[i]>='0' && str[i]<='9')
{
a = a*10+str[i]-'0';
i --;
}
if (str[i] == '=')
break;
}
for (j = i; j >= 0; j --)
{
if (str[j]>='0' && str[j]<='9')
while (str[j]>='0' && str[j]<='9')
{
b = b*10+str[j]-'0';
j --;
}
if (str[j] == '+')
break;
}
for (k = j; k >= 0; k --)
{
if (str[k]>='0' && str[k]<='9')
while (str[k]>='0' && str[k]<='9')
{
c = c*10+str[k]-'0';
k --;
}
}
//printf("%d %d %d\n",a,b,c);
if (c+b == a)
printf("TRUE\n");
else
printf("FALSE\n");
}
return 0;
}
Turing equation的更多相关文章
- 第七届河南省赛F.Turing equation(模拟)
10399: F.Turing equation Time Limit: 1 Sec Memory Limit: 128 MB Submit: 151 Solved: 84 [Submit][St ...
- zzuoj--10399--Turing equation(模拟)
Turing equation Time Limit: 1 Sec Memory Limit: 128 MB Submit: 152 Solved: 85 [Submit][Status][Web ...
- poj 2572 Hard to Believe, but True!
Hard to Believe, but True! Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 3537 Accep ...
- 每天一套题打卡|河南省第七届ACM/ICPC
A 海岛争霸 题目:Q次询问,他想知道从岛屿A 到岛屿B 有没有行驶航线,若有的话,所经过的航线,危险程度最小可能是多少. 多源点最短路,用floyd 在松弛更新:g[i][k] < g[i][ ...
- HDU3333 Turing Tree(线段树)
题目 Source http://acm.hdu.edu.cn/showproblem.php?pid=3333 Description After inventing Turing Tree, 3x ...
- CodeForces460B. Little Dima and Equation
B. Little Dima and Equation time limit per test 1 second memory limit per test 256 megabytes input s ...
- ACM: FZU 2102 Solve equation - 手速题
FZU 2102 Solve equation Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & ...
- HDU 5937 Equation
题意: 有1~9数字各有a1, a2, -, a9个, 有无穷多的+和=. 问只用这些数字, 最多能组成多少个不同的等式x+y=z, 其中x,y,z∈[1,9]. 等式中只要有一个数字不一样 就是不一 ...
- coursera机器学习笔记-多元线性回归,normal equation
#对coursera上Andrew Ng老师开的机器学习课程的笔记和心得: #注:此笔记是我自己认为本节课里比较重要.难理解或容易忘记的内容并做了些补充,并非是课堂详细笔记和要点: #标记为<补 ...
随机推荐
- 生成更大的陆地 Making A Large Island
2018-10-06 19:44:18 问题描述: 问题求解: 经典的求连通块问题的扩展,问题规模不大,可以暴力求解. 解法一.Brute Force O(n^4) int[][] dirs = ne ...
- Android DatePickerDialog 使用方法
(一)在Android 4.0以上系统的某些手机(如本人的测试机红米Note(系统4.4.4),以及模拟器(系统4.0)),使用如下代码创建时间选择器时,页面效果如图: Calendar cal = ...
- 目前用到的一些os.path方法
这里主要记录下os.path.join()的用法 目录结构如下 在readconfig.py中进行试验,如下 1.使用os.path.realpath(__file__)获取文件所在目录 import ...
- ThinkPHP3.2.3中使用smarty模板引擎循环
- G.711是一种由国际电信联盟(ITU-T)制定的音频编码方式
http://zh.wikipedia.org/zh-cn/G.711 ITU-T G.711 page ITU-T G.191 software tools for speech and audio ...
- 20170920xlVBA_FTP_UpDownLoad_DownLoad
'建立应用环境进程 Private Declare Function InternetOpen Lib "wininet.dll" Alias "InternetOpen ...
- 【PowerDesigner】【5】数据模型 CDM
前言:各种箭头的含义其实我还是有点混乱,所以这里只做记录 参考博客: 1,Powerdesigner数据库建模--概念模型--ER图[转] - holycrap - 博客园https://www.cn ...
- python_递归实现汉诺塔 (string类型的指针出错 未解决)
在递归的时候,和数学的归纳法一致. void func( mode) { if(endCondition) { constExpression //基本项 } else { accumrateExpr ...
- (二)使用数组长度实现ADT bag(java)
目录 1.使用固定大小的数组实现ADT bag 包 1.1 一组核心方法 1.2 实现核心方法 1.3 让实现安全 1.4 测试核心方法 1.5 实现更多的方法 1.6 删除项的方法 1.7 测试 ...
- hdu-4180-exgcd
RealPhobia Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total ...