ACM-ICPC 2016 上海赛区ECFINAL A，Ｄ

题目链接：Number Theory Problem

#include<bits/stdc++.h>

#define ll long long
using namespace std;

int solve(int cas) {
    int n;cin>>n;
    cout<<"Case #"<<cas<<": ";
    cout<<n/3<<endl;

}
int main() {
    int T;
    cin>>T;
    for(int i=1;i<=T;i++)  {
        solve(i);
    }
    return 0;
}

题目链接： Ice Cream Tower

#include<bits/stdc++.h>
 
#define ll unsigned long long
using namespace std;
 
 
const long long maxn = 1e6 + 7;
 
ll a[maxn];
 
long long n, k;
 
 
bool judge(ll x) {
    queue<pair<ll, ll> > que;
    for (ll i = 1; i <= x; i++) que.push({a[i], 1});
    for (ll i = x + 1; i <= n; i++) {
        if (que.empty()) break;
        pair<ll, ll> pii = que.front();
        if (a[i] / 2 >= pii.first) {
            que.pop();
            if (pii.second == k - 1) continue;
            que.push({a[i], pii.second + 1});
        }
    }
    return que.empty();
 
}
 
long long solve(long long cas) {
    cin >> n >> k;
    for (long long i = 1; i <= n; i++) cin >> a[i];
    cout << "Case #" << cas << ": ";
    if (k == 1) {
        cout << n << endl;
        return 0;
    }
    sort(a + 1, a + 1 + n);
    ll l = 0, r = n;
    ll ans = 0;
 
    while (r - l > 1) {
        ll mid = (l + r) / 2;
        if (judge(mid)) {
            l = mid;
        } else r = mid;
    }
    cout << l << endl;
}
 
int main() {
 
    long long T;
    cin >> T;
    for (long long i = 1; i <= T; i++) {
        solve(i);
    }
    return 0;
}