didi暑期训练赛补题1

B : CF 371C
题意：能组成最多的汉堡，条件是：输入字符串B,S,C的个数
思路：二分查找值能够使总值==n的答案，推出总和公式
(ll) max((ll) 0, m * ans1 - nb) * pb + (ll) max((ll) 0, m * ans2 - ns) * ps +
(ll) max((ll) 0, m * ans3 - nc) * pc
代码：

#include<bits/stdc++.h>

#define ll long long
using namespace std;
const ll Max = 1e13;
const int mod = 1e9 + 7;
//int a[Max];
//int sum[Max];
ll nb, ns, nc;
ll pb, ps, pc;
ll n;
ll ans1, ans2, ans3;
//ll check(int li, int ri,int mid)
ll sum(ll m) {
    return (ll) max((ll) 0, m * ans1 - nb) * pb + (ll) max((ll) 0, m * ans2 - ns) * ps +
           (ll) max((ll) 0, m * ans3 - nc) * pc;
}

int main() {
    string str;
    while (cin >> str) {
        ans1 = 0, ans2 = 0, ans3 = 0;
        for (int i = 0; i < str.length(); i++) {
            if (str[i] == 'B') ans1++;
            if (str[i] == 'S') ans2++;
            if (str[i] == 'C') ans3++;
        }
        cin >> nb >> ns >> nc;
        cin >> pb >> ps >> pc;
        cin >> n;
        ll l = 0, r = Max;
        //int mid=max/2;
        ll ans = 0, flag = 0;
        while (l <= r) {
            ll mid = (l + r) / 2;
            if (sum(mid) == n) {
                cout << mid << endl;
                flag = 1;
                break;
            }
            if (sum(mid) < n) {
                l = mid + 1;
                ans = mid;
            } else {
                r = mid - 1;
            }
        }
        if (!flag) cout << ans << endl;
        //else cout << 0 << endl;
    }
    return 0;
}

E: HDU - 1876
题意：每个人可以取1~m个石子，先取光的为胜。
思路：如果n是m+1的倍数，一定是先手赢。
代码：

#include<bits/stdc++.h>

#define ll long long
using namespace std;
const int maxn = 1005;
const int mod = 1e9 + 7;
int  a[maxn];
int sum[maxn];

int main() {
   int t;
   cin>>t;
   int n,m;
   while(t--)
   {
        cin>>n>>m;
        if(n%(m+1)) puts("first");
        else puts("second");
   }
    return 0;
}

F :LightOJ-1387
题意：donate是加，report输出当前的值
思路：直接写
代码：

#include<bits/stdc++.h>

#define ll long long
using namespace std;
const ll Max = 1e5 + 5;
const int mod = 1e9 + 7;
int a[Max];
//int sum[Max];
//ll check(int li, int ri,int mid)

int main() {
    int t, n, money;
    cin >> t;
    string str1 = "donate", str2 = "report";
    string str;
    for (int jj = 1; jj <= t; jj++) {
        cin >> n;
        ll ans = 0;
        int flag = 0;
        int j = 0;
        for (int i = 1; i <= n; i++) {
            cin >> str;
            if (str == str1) {
                cin >> money;
                ans += money;
            } else {
                flag = 1;
                a[j++] = ans;
            }
        }
        if (flag) {
            printf("Case %d:\n", jj);
            for (int i = 0; i < j; i++) cout << a[i] << endl;
        }
    }

    return 0;
}

补：H : HDU-5867
题意：计算1~n的英文字母和
思路：分段打表
注：百有and情况，只有1~1000个英文[1-20，整数，百位数+3]
代码：

#include <bits/stdc++.h>

using namespace std;
using ll=long long;

int main() {
    int a[1005] = {0};
    a[1] = 3,a[2] = 3,a[3] = 5,a[4] = 4,a[5] = 4,a[6] = 3,a[7] = 5,a[8] = 5,a[9] = 4,a[10] = 3;
    a[11] = 6,a[12] = 6,a[13] = 8,a[14] = 8,a[15] = 7,a[16] = 7,a[17] = 9,a[18] = 8,a[19] = 8,a[20] = 6;
    a[30] = 6,a[40] = 5,a[50] = 5,a[60] = 5,a[70] = 7,a[80] = 6,a[90] = 6,a[100] = 3 + 7;

    /*for (int i = 20; i < 100; i += 10) {
        for (int j = i + 1; j < i + 10; j++)
            a[j] = a[i] + a[j - i];
    }*/
  /*  for (int i = 20; i < 100; i += 10) {
       
            a[j] = a[i] + a[j - i];
    }*/
    for (int i = 100; i < 1000; i += 100) {
        a[i] = a[i / 100] + 7;
        for (int j = i + 1; j <= i + 99; j++) {
            a[j] = a[i] + 3 + a[j - i];
        }
    }
    a[1000] = 3 + 8;
    for (int i = 2; i <= 1000; i++)
        a[i] += a[i - 1];
    int t;
    scanf("%d", &t);
    while (t--) {
        int n;
        scanf("%d", &n);
        printf("%d\n", a[n]);
    }
}