本题链接：201612-2 工资计算

本博客给出本题截图：

C++

两种方法，枚举或二分

枚举

#include <iostream>
#include <algorithm>

using namespace std;

int get(int x)
{
    if (x <= 3500) return x;
    int a[] = {0, 1500, 4500, 9000, 35000, 55000, 80000, 1000000};
    int b[] = {0, 3, 10, 20, 25, 30, 35, 45};

    x -= 3500;
    int tax = 0;
    for (int i = 1; i < 8; i ++ )
        if (x >= a[i - 1])
            tax += (min(x, a[i]) - a[i - 1]) / 100 * b[i];
    return x + 3500 - tax;
}

int main()
{
    int T;
    cin >> T;
    for (int i = 0; ; i += 100)
        if (get(i) == T)
        {
            cout << i << endl;
            break;
        }
    return 0;
}

  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
  
15
  
16
  
17
  
18
  
19
  
20
  
21
  
22
  
23
  
24
  
25
  
26
  
27
  
28
  
29
  
30
  
31
 

二分

#include <iostream>

using namespace std;

int get(int n)
{
    if (n <= 3500) return n;
    else
    {
        int a[8] = {0, 1500, 4500, 9000, 35000, 55000, 80000, 1000000000};
        double b[8] = {0, 0.03, 0.1, 0.2, 0.25, 0.3, 0.35, 0.45};

        double res = 0;
        n -= 3500;
        for (int i = 1; i <= 7; i ++ )
            if (a[i] <= n)
                res += (a[i] - a[i - 1]) * b[i];
            else
            {
                res += (n - a[i - 1]) * b[i];
                break;
            }
        return n - res + 3500 + 1e-6;
    }
}

int main()
{
    int n;
    cin >> n;

    int l = 0, r = 1e9;
    while (l < r)
    {
        int mid = l + r >> 1;
        if (get(mid) >= n) r = mid;
        else l = mid + 1;
    }

    cout << r << endl;
    return 0;
}

  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
  
15
  
16
  
17
  
18
  
19
  
20
  
21
  
22
  
23
  
24
  
25
  
26
  
27
  
28
  
29
  
30
  
31
  
32
  
33
  
34
  
35
  
36
  
37
  
38
  
39
  
40
  
41
  
42
 

总结

二分法
二分算法模板

文章来源: chen-ac.blog.csdn.net，作者：辰chen，版权归原作者所有，如需转载，请联系作者。

原文链接：chen-ac.blog.csdn.net/article/details/120448215