Submission #1388116


Source Code Expand

// Nurbakyt Madibek
// Look at my code! IT'S AWESOME

#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <ctime>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <cassert>
#include <unordered_map>
#include <bitset>
#include <unordered_set>

using namespace std;

#define pb push_back
#define pp pop_back
#define f first
#define s second
#define mp make_pair
#define sz(a) (int)((a).size())
#ifdef _WIN32
#  define I64 "%I64d"
#else
#  define I64 "%lld"
#endif
#define fname "."

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair < int, int > pi;
typedef pair < int, ull > pu;
typedef pair < ll, ll > pl;

const int inf = (int)1e9 + 123;
const ll infl = (ll)1e18 + 123;
const double eps = 1e-9;

const int MAX_N = (int)3e5 + 5;
const int mod = (int)1e9 + 7;

ll diff(ll a, ll b) {
    return abs(a - b);
}

int main() {
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    int a, b, c;
    cin >> a >> b >> c;
    ll mini = infl;
    for (int i = a / 2; i <= a / 2 + a % 2; i++)
        mini = min(mini, diff(1ll * i * b * c, 1ll * (a - i) * b * c));
    for (int i = b / 2; i <= b / 2 + b % 2; i++)
        mini = min(mini, diff(1ll * i * a * c, 1ll * (b - i) * a * c));
    for (int i = c / 2; i <= c / 2 + c % 2; i++)
        mini = min(mini, diff(1ll * i * a * b, 1ll * (c - i) * a * b));
    cout << mini << endl;
    return 0;
}

Submission Info

Submission Time
Task A - Divide a Cuboid
User Nurbakhyt
Language C++14 (GCC 5.4.1)
Score 200
Code Size 1644 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 9
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 1 ms 256 KB
1_04.txt AC 1 ms 256 KB
1_05.txt AC 1 ms 256 KB