774F - Pens And Days Of Week - CodeForces Solution


*special problem binary search number theory *2700

Please click on ads to support us..

Python Code:

n = int(input())
l = [int(i) for i in input().split(' ')]
ct = 0
found = True
m = min(l)
nl = [j for j in l] 
if min(nl) <=7:
    pass
else:
    while min(nl) >15:
        v = ((sum(nl)-(sum(nl)%(7*n)))/(7*n))*6
        for i in range(len(nl)):
            nl[i] = nl[i] - v
while found:
    if n % 7 == 0:
        dvs = True
        while dvs:
            if (nl.index(min(nl)) + 1) % 7 == 0:
                nl[nl.index(min(nl))] = nl[nl.index(min(nl))] * 8
            else:
                dvs = False
        print(nl.index(min(nl))+1)
        break
    if len(nl) == 1:
        print(1)
        break
    for i in range(len(nl)):
        if (ct+1) % 7 == 0:
            pass
        else:
            nl[i] = nl[i] - 1
            if nl[i] == 0:
                print(nl.index(0)+1)
                found = False
                break
        ct += 1


Comments

Submit
0 Comments
More Questions

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
445. Add Two Numbers II
442. Find All Duplicates in an Array
437. Path Sum III
436. Find Right Interval
435. Non-overlapping Intervals
406. Queue Reconstruction by Height
380. Insert Delete GetRandom O(1)
332. Reconstruct Itinerary
368. Largest Divisible Subset
377. Combination Sum IV
322. Coin Change
307. Range Sum Query - Mutable
287. Find the Duplicate Number
279. Perfect Squares
275. H-Index II
274. H-Index
260. Single Number III
240. Search a 2D Matrix II
238. Product of Array Except Self
229. Majority Element II