当前位置:网站首页>L1-025 positive integer a+b (15 points)
L1-025 positive integer a+b (15 points)
2022-07-04 07:29:00 【Inter personal liabilities^】
L1-025 Positive integer A+B (15 branch )
The goal of the question is very simple , It's two positive integers A
and B
And , among A
and B
It's all in the range [1,1000]. A little bit of a hassle , The input is not guaranteed to be two positive integers .
Input format :
Type in on a line to give A
and B
, They are separated by spaces . The problem is A
and B
It doesn't have to be a positive integer , Sometimes it can be out of range numbers 、 negative 、 A real number with a decimal point 、 It's even a mess of code .
Be careful : Let's put... In the input 1 A space is taken as A
and B
Separation of . Make sure that there is at least one space for the question , also B
It's not an empty string .
Output format :
If the input is really two positive integers , According to the format A + B = and
Output . If an input is not satisfactory , Output at corresponding position ?
, Obviously at this time and also ?
.
sample input 1:
123 456
sample output 1:
123 + 456 = 579
sample input 2:
22. 18
sample output 2:
? + 18 = ?
sample input 3:
-100 blabla bla...33
sample output 3:
? + ? = ?
test 3: Similar to the third example , There may be more than two data entered , When the input data exceeds two data , You should directly output the results that are all question marks
test 5: The upper limit of the number is 1000, There are requirements for the topic , But when typing , I didn't input as required, so I need to judge
test 6: The lower limit of the number is 1, And testing 5 identical
AC Code
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<stack>
#include<queue>
#include<sstream>
using namespace std;
typedef long long ll;
const int N=100010;
int main()
{
string a;
getline(cin, a);
bool flaga = false, flagb = false;
int aa = 0, bb = 0;
int flag = 0;
for(int i = 0; i < a.size(); i ++ )
{
if(a[i] == ' ') flag = i;
if(flag > 0) break;
}
for(int i = 0; i < flag; i ++ )
{
aa = aa * 10 + (a[i] - '0');
if(a[i] < '0' || a[i] > '9')
{
flaga = true;
break;
}
}
int flag1 = 0;
for(int i = flag + 1; i < a.size(); i ++ )
{
bb = bb * 10 + (a[i] - '0');
if(a[i] < '0' || a[i] > '9')
{
flagb = true;
break;
}
}
if(aa > 1000 || aa < 1) flaga = true;
if(bb > 1000 || bb < 1) flagb = true;
if(flaga) cout << '?' << ' ';
else cout << aa << ' ';
cout << '+' << ' ';
if(flagb) cout << '?' << ' ';
else cout << bb << ' ';
cout << '=' << ' ';
if(flaga || flagb) cout << '?';
else cout << aa + bb;
return 0;
}
边栏推荐
- Chapter 1 programming problems
- Research on an endogenous data security interaction protocol oriented to dual platform and dual chain architecture
- [kubernetes series] kubesphere is installed on kubernetes
- 【森城市】GIS数据漫谈(一)
- Introduction to sap commerce cloud B2B organization function
- 2022 - 021arts: début du deuxième semestre
- Novel website program source code that can be automatically collected
- tornado之目录
- Splicing plain text into JSON strings - easy language method
- NLP-文献阅读总结
猜你喜欢
Solution of running crash caused by node error
Node foundation ~ node operation
The number of patent applications in China has again surpassed that of the United States and Japan, ranking first in the world for 11 consecutive years
socket inet_ pton() inet_ Ntop() function (a new network address translation function, which converts the expression format and numerical format to each other. The old ones are inet_aton(), INET_ ntoa
Redis - detailed explanation of cache avalanche, cache penetration and cache breakdown
果果带你写链表,小学生看了都说好
Routing decorator of tornado project
神经网络入门(下)
Book list | as the technical support Party of the Winter Olympics, Alibaba cloud's technology is written in these books!
BasicVSR++: Improving Video Super-Resolutionwith Enhanced Propagation and Alignment
随机推荐
Two years ago, the United States was reluctant to sell chips, but now there are mountains of chips begging China for help
Boast about Devops
window上用.bat文件启动项目
Guoguo took you to write a linked list, and the primary school students said it was good after reading it
When JDBC connects to es query, is there a God who meets the following situation?
Jianmu continuous integration platform v2.2.2 release
MySQL中的文本处理函数整理,收藏速查
Advanced MySQL: Basics (5-8 Lectures)
Vulhub vulnerability recurrence 76_ XXL-JOB
Used on windows Bat file startup project
Splicing plain text into JSON strings - easy language method
Recursive Fusion and Deformable Spatiotemporal Attention for Video Compression Artifact Reduction
[network security] what is emergency response? What indicators should you pay attention to in emergency response?
Directory of tornado
"Sword finger offer" 2nd Edition - force button brush question
SQL foundation 9 [grouping data]
How notepad++ counts words
Literature collation and thesis reading methods
Adaptive spatiotemporal fusion of multi-target networks for compressed video perception enhancement
Data double write consistency between redis and MySQL