zoukankan      html  css  js  c++  java
  • HDU Problem

    题目:Problem - 6124
    http://acm.hdu.edu.cn/showproblem.php?pid=6124

    Euler theorem
    Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)
    Total Submission(s): 601 Accepted Submission(s): 481

    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

    Source

    2017 Multi-University Training Contest - Team 7

    水题,直接上代码

    #include <bits/stdc++.h>
    #include <iostream>
    #include <cstring>
    #include <stack>
    #include <cstdlib>
    #include <queue>
    #include <cmath>
    #include <cstdio>
    #include <algorithm>
    #include <string>
    #include <vector>
    #include <list>
    #include <iterator>
    #include <set>
    #include <map>
    #include <utility>
    #include <iomanip>
    #include <ctime>
    #include <sstream>
    #include <bitset>
    #include <deque>
    #include <limits>
    #include <numeric>
    #include <functional>
    
    #define gc getchar()
    #define mem(a) memset(a,0,sizeof(a))
    #define mod 1000000007
    #define sort(a,n,int) sort(a,a+n,less<int>())
    #define fread() freopen("in.in","r",stdin)
    #define fwrite() freopen("out.out","w",stdout)
    using namespace std;
    
    typedef long long ll;
    typedef char ch;
    typedef double db;
    
    const int maxn=1e5+10;
    
    int main()
    {
        int t;
        cin>>t;
        while(t--)
        {
            ll n;
            cin>>n;
            cout<<(n+1)/2+1<<endl;
        }
        return 0;
    }

    作者:YukiRinLL

    出处:YukiRinLL的博客--https://www.cnblogs.com/SutsuharaYuki/

    您的支持是对博主最大的鼓励,感谢您的认真阅读。

    本文版权归作者所有,欢迎转载,但请保留该声明。

  • 相关阅读:
    Android学习(二)
    密码与安全新技术专题之AI与密码
    Android学习(一)
    冲刺周六The Sixth Day(6.1)
    冲刺周日The Seventh Day(6.2)
    冲刺周五The Fifth Day(5.31)
    冲刺周四The Fourth Day(5.30)
    冲刺周三The Third Day(5.29)
    冲刺周二The Second Day(5.28)
    冲刺周一The First Day(5.27)
  • 原文地址:https://www.cnblogs.com/SutsuharaYuki/p/11225396.html
Copyright © 2011-2022 走看看