当前位置:网站首页>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;
}
边栏推荐
- BasicVSR++: Improving Video Super-Resolutionwith Enhanced Propagation and Alignment
- Zabbix agent主动模式的实现
- 2022-021ARTS:下半年開始
- Literature collation and thesis reading methods
- MYCAT middleware installation and use
- CMS source code of multi wechat management system developed based on thinkphp6, with one click curd and other functions
- [Flink] temporal semantics and watermark
- One of the general document service practice series
- The frost peel off the purple dragon scale, and the xiariba people will talk about database SQL optimization and the principle of indexing (primary / secondary / clustered / non clustered)
- Paddleocr prompt error: can not import AVX core while this file exists: xxx\paddle\fluid\core_ avx
猜你喜欢

Pangu open source: multi support and promotion, the wave of chip industry
![[Mori city] random talk on GIS data (I)](/img/e4/2a2ceb10a2c0285cdd0c922f827930.png)
[Mori city] random talk on GIS data (I)

What are the work contents of operation and maintenance engineers? Can you list it in detail?

The IP bound to the socket is inaddr_ The meaning of any htonl (inaddr_any) (0.0.0.0 all addresses, uncertain addresses, arbitrary addresses)

Introduction to sap commerce cloud B2B organization function

Adaptive spatiotemporal fusion of multi-target networks for compressed video perception enhancement

Zephyr 学习笔记1,threads

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

"Sword finger offer" 2nd Edition - force button brush question

Used on windows Bat file startup project
随机推荐
Zephyr 学习笔记2,Scheduling
Two years ago, the United States was reluctant to sell chips, but now there are mountains of chips begging China for help
博客停更声明
Why does the producer / consumer mode wait () use while instead of if (clear and understandable)
Finishing (III) - Exercise 2
Rhcsa day 3
【FreeRTOS】FreeRTOS學習筆記(7)— 手寫FreeRTOS雙向鏈錶/源碼分析
What is the use of cloud redis? How to use cloud redis?
Master-slave replication principle of MySQL database
Zephyr 學習筆記2,Scheduling
Redis - detailed explanation of cache avalanche, cache penetration and cache breakdown
Chain ide -- the infrastructure of the metauniverse
Boosting the Performance of Video Compression Artifact Reduction with Reference Frame Proposals and
rapidjson读写json文件
Life planning (flag)
Boast about Devops
The difference between synchronized and lock
Review of enterprise security incidents: how can enterprises do a good job in preventing source code leakage?
电子协会 C语言 1级 34 、分段函数
[FreeRTOS] FreeRTOS learning notes (7) - handwritten FreeRTOS two-way linked list / source code analysis