845B - Luba And The Ticket - CodeForces Solution

brute force greedy implementation *1600

Please click on ads to support us..

Python Code: 

def ss(s):
    a=[]
    b=[]
    for i in s[:3]:
        a.append(int(i))
    for i in s[3:]:
        b.append(int(i))

    x=sum(a)
    y=sum(b)
    if x==y:
        return 0
    for i in a:
                if y>=x-i and x-i+9>=y:
            return 1 
    for i in b:
        if x>=y-i and y-i+9>=x:
            return 1 
    
    for i in a:
        for j in b:
                                                    
            if x>y:
                if y-j+9>=x-i:
                    return 2
            else:
                if x-i+9>=y-j:
                    return 2
    
    for i in range(3):
        for j in range(i+1,3):
            if y>=x-a[i]-a[j] and x-a[i]-a[j]+18>=y:
                return 2
            if x>=y-b[i]-b[j] and y-b[i]-b[j]+18>=x:
                return 2
    return 3 
    
        

    
s=str(input())
print(ss(s))

C++ Code: 

#include <iostream>
#include <set>
#include <algorithm>
#include <queue>
#include <cstdlib>
#include <stack>
#include <ctime>
#include <fstream>
#include <vector>
#include <map>
#include <cmath>
using namespace std;

#define fast ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

int num[7];
int S = 0;
string s;
int Min = 10;

void back(int k, int op) {
    if (k == s.size()) {
        if (s[0] + s[1] + s[2] == s[3] + s[4] + s[5])
            Min = min(Min, op);
        return;
    }
    for (int j = '0'; j <= '9'; j++)
        if (s[k] == j)
            back(k + 1, op);
        else {
            char initial = s[k];
            s[k] = j;
            back(k + 1, op + 1);
            s[k] = initial;
        }
}

int main() {
    fast
    cin >> s;
    back(0, 0);
    cout << Min;
    return 0;
}


Comments

Submit
0 Comments
More Questions

Lexical Sorting Reloaded
1514A - Perfectly Imperfect Array
580A- Kefa and First Steps
1472B- Fair Division
996A - Hit the Lottery
MSNSADM1 Football
MATCHES Playing with Matches
HRDSEQ Hard Sequence
DRCHEF Doctor Chef
559. Maximum Depth of N-ary Tree
821. Shortest Distance to a Character
1441. Build an Array With Stack Operations
1356. Sort Integers by The Number of 1 Bits
922. Sort Array By Parity II
344. Reverse String
1047. Remove All Adjacent Duplicates In String
977. Squares of a Sorted Array
852. Peak Index in a Mountain Array
461. Hamming Distance
1748. Sum of Unique Elements
897. Increasing Order Search Tree
905. Sort Array By Parity
1351. Count Negative Numbers in a Sorted Matrix
617. Merge Two Binary Trees
1450. Number of Students Doing Homework at a Given Time
700. Search in a Binary Search Tree
590. N-ary Tree Postorder Traversal
589. N-ary Tree Preorder Traversal
1299. Replace Elements with Greatest Element on Right Side
1768. Merge Strings Alternately