Perket

Author: Pakin Olanraktham

---

View Problem Statement

Source: PROGRAMMING.IN.TH

Difficulty: ?

Prerequisites:

• การเขียนโปรแกรมเบื้องต้น

View External Solution

เฉลย

CC++

#include <stdio.h>
#include <stdlib.h>

int ans = INT_MAX, n;
int s[10],b[10];

void sub(int i, int ss, int bb, int alr) {
    if (i == n) {
        if (abs(ss-bb) < ans && alr) ans = abs(ss-bb);
        return;
    }

    sub(i+1, ss, bb, alr == 1 ? 1 : 0);
    sub(i+1, ss*s[i], bb+b[i], 1);
}

int main() {
    scanf("%d", &n);

    for (int i = 0; i < n; i++) scanf("%d %d", &s[i], &b[i]);

    sub(0, 1, 0, 0);

    printf("%d", ans);
}

#include <iostream>
#include <cmath>
#include <vector>

using namespace std;

int ans = INT_MAX, n;
vector <int> s, b;

void sub(int i, int ss, int bb, int alr) {
    if (i == n) {
        if (abs(ss-bb) < ans && alr) ans = abs(ss-bb);
        return;
    }

    sub(i+1, ss, bb, alr == 1 ? 1 : 0);
    sub(i+1, ss*s[i], bb+b[i], 1);
}

int main() {
    cin >> n;
    s.resize(n);
    b.resize(n);

    for (int i = 0; i < n; i++) cin >> s[i] >> b[i];

    sub(0, 1, 0, 0);

    cout << ans;
}