1221C - Perfect Team - CodeForces Solution


binary search math *1200

Please click on ads to support us..

Python Code:




import sys
input = sys.stdin.readline




for _ in range(int(input())):
    c, m, x = map(int,input().split(' '))
    t=0
    a=min(c,m)
    if x >= a:
        print(a)
    else:
        t=t+x
        c=c-x
        m=m-x
        x=0
        t=t+min(min(m,c),(m+c)//3)
        print(t)

C++ Code:

#include <stdio.h>

int main()
{
    int tc;
    scanf("%d", &tc);
    while(tc--){
        long long a, b, c, mini, temp;
        scanf("%lld %lld %lld", &a, &b, &c);
        if((a==0)||(b==0)){
            printf("0\n");
        }
        else{
            long long sum=a+b+c;
            if(a<=b){mini=a;}
            else    {mini=b;}
            temp = sum-mini*2;
            if(temp>=mini){
                printf("%lld\n", mini);
            }
            else{
                printf("%lld\n", sum/3);
            }
        }
    }

    return 0;
}


Comments

Submit
0 Comments
More Questions

236A - Boy or Girl
271A - Beautiful Year
520B - Two Buttons
231A - Team
479C - Exams
1030A - In Search of an Easy Problem
158A - Next Round
71A - Way Too Long Words
160A - Twins
1A - Theatre Square
1614B - Divan and a New Project
791A - Bear and Big Brother
1452A - Robot Program
344A - Magnets
96A - Football
702B - Powers of Two
1036A - Function Height
443A - Anton and Letters
1478B - Nezzar and Lucky Number
228A - Is your horseshoe on the other hoof
122A - Lucky Division
1611C - Polycarp Recovers the Permutation
432A - Choosing Teams
758A - Holiday Of Equality
1650C - Weight of the System of Nested Segments
1097A - Gennady and a Card Game
248A - Cupboards
1641A - Great Sequence
1537A - Arithmetic Array
1370A - Maximum GCD