Euler theorem(水)
2017-08-15 12:32
120 查看
Euler theorem
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0
Problem Description
HazelFan is given two positive integers a,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 integer T(1≤T≤5),
denoting the number of test cases.
For each test case:
A single line contains a positive integer a(1≤a≤109).
Output
For each test case:
A single line contains a nonnegative integer, denoting the answer.
Sample Input
2
1
3
Sample Output
2
3思路找规律
#include<cstdio> #include<iostream> #include<math.h> using namespace std; int a,b,t; int main() { scanf("%d",&t); while(t--) { scanf("%d",&a); int ans; if(a%2==0) printf("%d\n",a/2+1); else printf("%d\n",a/2+2); } }
相关文章推荐
- Unit 2-Lecture 3-4: Euler's Theorem & RSA Public key Encryption
- Euler Project Problem 6
- Project Euler Problem 16
- 杭州现场J题_Infinite monkey theorem
- Project Euler Problem 15
- Matlab实现——Euler's Method
- http://projecteuler.net/problem=16 [Answer:1366]
- http://projecteuler.net/problem=10 【matlab解法】
- Euler 1
- Project Euler Problem 36
- hdu 2824 The Euler function
- Project Euler problem 9 勾股数
- Project Euler problem 26 分数化小数
- Project Euler problem 42
- Hexadecimal's theorem
- Fermat’s Chirstmas Theorem
- UVA 1342 That Nice Euler Circuit
- CF 304A(Pythagorean Theorem II-n内勾股数)
- Problem F Codeforces Round #183 (Div. 2) A. Pythagorean Theorem II
- LA 3263 That Nice Euler Circuit (点、面、边的关系)