[hihocoder][Offer收割]编程练习赛62

方向

#pragma comment(linker, "/STACK:102400000,102400000")
#ifndef ONLINE_JUDGE
#include "stdafx.h"
#else
#include<bits/stdc++.h>
#endif
using namespace std;
typedef long long lint;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef queue<int> QI;
typedef map<int, int> MII;

void makedata() {
    freopen("input.txt", "w", stdout);
    fclose(stdout);
}
int min_(int x, int y) {
    if (fabs(x) == fabs(y)) return fabs(x);
    return fabs(x) < fabs(y) ? x : y;
}
int main() {
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
#endif
    //makedata();
    std::ios::sync_with_stdio(), cin.tie();
    int a, b, x, y;
    cin >> a >> b;
    x = b - a;
    if (x < ) x += ;
    y = x - ;
    cout << min_(x, y) << endl;
    return ;
}

被遗忘的整数

a*h=(∑ai / n)/(∑(1/ai))，而n*(∑(1/ai))=(∑ai / n)，所以n=a*h

#pragma comment(linker, "/STACK:102400000,102400000")
#ifndef ONLINE_JUDGE
#include "stdafx.h"
#else
#include<bits/stdc++.h>
#endif
using namespace std;
typedef long long lint;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef queue<int> QI;
typedef map<int, int> MII;

void makedata() {
    freopen("input.txt", "w", stdout);
    fclose(stdout);
}
int min_(int x, int y) {
    if (fabs(x) == fabs(y)) return fabs(x);
    return fabs(x) < fabs(y) ? x : y;
}
int main() {
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
#endif
    //makedata();
    std::ios::sync_with_stdio(), cin.tie();
    int a, b;
    cin >> a >> b;
    cout << a*b << endl;
    return ;
}

金额组合

#pragma comment(linker, "/STACK:102400000,102400000")
#ifndef ONLINE_JUDGE
#include "stdafx.h"
#else
#include<bits/stdc++.h>
#endif
using namespace std;
typedef long long lint;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef queue<int> QI;
typedef map<int, int> MII;

void makedata() {
    freopen("input.txt", "w", stdout);
    fclose(stdout);
}

int n;
lint c;
bool f[];
int s[];

int main() {
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
#endif
    //makedata();
    std::ios::sync_with_stdio(), cin.tie();
    memset(f, false, sizeof(f));
    cin >> n >> c;
    lint x;
    for (int i = ; i < n; i++) {
        cin >> x;
        for (int j = ; j < ; j++) {
            if (x == (1LL << j)) f[j] = true;
        }
    }
    s[] = f[] ?  : ;
    for (int i = ; i < ; i++) s[i] = s[i - ] + (f[i] ?  : );
    lint ans = ;
    for (int i = ; i >= ; i--) {
        if (c & (1LL << i)) {
            if (i > ) ans += (1LL << s[i - ]);
            else ans += ;
            if (!f[i]) break;
        }
    }
    bool ok = true;
    for (int i = ; i >= ; i--) {
        if (c & (1LL << i) && (!f[i])) ok = false;
    }
    if (ok) ans++;
    ans--;
    cout << ans << endl;
    return ;
}
/*
1010
----
1000
0100
0001
----
1000
0100
0001
0101
0000
1001
*/

数字组合

#pragma comment(linker, "/STACK:102400000,102400000")
#ifndef ONLINE_JUDGE
#include "stdafx.h"
#else
#include<bits/stdc++.h>
#endif
using namespace std;
typedef long long lint;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef queue<int> QI;
typedef map<int, int> MII;

void makedata() {
    freopen("input.txt", "w", stdout);
    fclose(stdout);
}

VI G[];
int cnt[];
int n, k;
int s0, c1;
int max_() {
    for (int i = ; i >= ; i--) {
        if (cnt[i]) {
            cnt[i]--;
            n--;
            return i;
        }
    }
}
int min_() {
    for (int i = ; i <= ; i++) {
        if (cnt[i]) {
            cnt[i]--;
            n--;
            return i;
        }
    }
}
void work(int l, int r, int p) {
    if (p +  == s0) return;
    int ll;
    for (int i = l; i <= r; i++) {
        if (G[i][p] < G[r][p]) {
            while (G[i].size() < s0) G[i].push_back(max_());
        } else {
            ll = i;
            break;
        }
    }
    for (int i = ll; i <= r; i++) G[i].push_back(min_());
    work(ll, r, p + );
}

int main() {
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
#endif
    //makedata();
    std::ios::sync_with_stdio(), cin.tie();
    string s;
    cin >> n >> k;
    cin >> s;
    int m = s.length();
    for (int i = ; i < m; i++) cnt[s[i] - '']++;
    s0 = n / k + , c1 = n % k;
    for (int i = ; i < k - c1; i++) G[i].push_back();
    for (int i = k - c1; i < k; i++) G[i].push_back(min_());
    work(, k - , );
    for (int i = ; i < G[k - ].size(); i++) {
        if (G[k - ][i] == ) continue;
        else cout << G[k - ][i];
    }
    return ;
}
/*
x 1 1 1 1
44777
*/