Testing Round #14 (Unrated) B

全排列暴力

#include<iostream>#include<algorithm>#include<iomanip>#include<cstdio>#include<cstdlib>#include<cstring>#include<string>#include<cmath>#include<set>#include<queue>#include<stack>#include<map>#define PI acos(-1.0)#define in freopen("in.txt", "r", stdin)#define out freopen("out.txt", "w", stdout)#define kuaidian ios::sync_with_stdio(0);using namespace std;typedef long long ll;typedef unsigned long long ull;const int maxn = 105 + 777, maxd = 1e8;const ll mod = 1e9 + 7;const int INF = 0x7f7f7f7f;int n, a, b;int m[7];int main() {    scanf("%d %d %d", &n, &a, &b);    m[0] = m[1] = b;    m[2] = m[3] = m[4] = m[5] = a;    sort(m, m+6);    int ans = 6;    do {        int sum = n, i = 0, t = 1;        for(int i = 0; i < 6; ++i) {            if(sum < m[i]) {                t++;                sum = n - m[i];            }            else sum -= m[i];        }        ans = min(ans, t);    } while( next_permutation(m, m+6) );    printf("%d", ans);    return 0;}