1945A - Setting up Camp - CodeForces Solution


math

Please click on ads to support us..

Python Code:

import sys
input=sys.stdin.readline
def comding():
    a,b,c=tup()
    while(b%3 and c>0):
        b+=1
        c-=1
    if (b%3):print(-1)
    else:
        if c%3==0: print(a+(b//3)+(c//3))
        else:
            print((a+(b+c)//3)+1)

    return

def i(): return input()
def ii(): return int(input())
def tup(): return map(int,input().split())
def ls(): return [x for x in input().split()]
def ils(): return [int(x) for x in input().split()]
def sils(): return sorted([int(x) for x in input().split()])
for __ in range(ii()): comding()


Comments

Submit
0 Comments
More Questions

1302. Deepest Leaves Sum
1209. Remove All Adjacent Duplicates in String II
994. Rotting Oranges
983. Minimum Cost For Tickets
973. K Closest Points to Origin
969. Pancake Sorting
967. Numbers With Same Consecutive Differences
957. Prison Cells After N Days
946. Validate Stack Sequences
921. Minimum Add to Make Parentheses Valid
881. Boats to Save People
497. Random Point in Non-overlapping Rectangles
528. Random Pick with Weight
470. Implement Rand10() Using Rand7()
866. Prime Palindrome
1516A - Tit for Tat
622. Design Circular Queue
814. Binary Tree Pruning
791. Custom Sort String
787. Cheapest Flights Within K Stops
779. K-th Symbol in Grammar
701. Insert into a Binary Search Tree
429. N-ary Tree Level Order Traversal
739. Daily Temperatures
647. Palindromic Substrings
583. Delete Operation for Two Strings
518. Coin Change 2
516. Longest Palindromic Subsequence
468. Validate IP Address
450. Delete Node in a BST