2017 Multi-University Training Contest
来源:互联网 发布:腾讯公司发展数据 编辑:程序博客网 时间:2024/06/04 21:13
题目:
Problem Description
HazelFan is given two positive integersa,b , and he wants to calculate amodb . But now he forgets the value of b and only remember the value of a , please tell him the number of different possible results.
Input
The first line contains a positive integerT(1≤T≤5) , denoting the number of test cases.
For each test case:
A single line contains a positive integera(1≤a≤109) .
For each test case:
A single line contains a positive integer
Output
For each test case:
A single line contains a nonnegative integer, denoting the answer.
A single line contains a nonnegative integer, denoting the answer.
Sample Input
213
Sample Output
23
思路:打表找规律,很容易看出如果a是奇数的话,答案是(奇数+1)/2+1;a是偶数的话,答案是a/2+1
code:
#include<bits/stdc++.h>using namespace std;int main(){ int t,a; scanf("%d",&t); while(t--){ scanf("%d",&a); if(a%2) a++; printf("%d\n",a/2+1); } return 0;}
阅读全文
0 0
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- #2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- #2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- Kotlin开发问题(一)
- DrawerLayout中侧边栏NavigationView沉浸式状态栏无效问题
- git 删除已经add但未commit的文件
- 简单明了的分析Android触摸事件,看完再也不纠结了
- ubuntu中自带的ufw防火墙
- 2017 Multi-University Training Contest
- 配置Redis作为缓存
- Java数据结构01----算法概述
- JAVA开发的23种设计模式之 --- 建造者模式
- <二> c++之const
- Android 自定义进度条
- 递归与动态规划---排成一条线的纸牌博弈问题
- [BZOJ3396]任务调度
- JAVA互联网架构学习之cookie&session