1992E - Novice's Mistake - CodeForces Solution


brute force constructive algorithms math strings

Please click on ads to support us..

Python Code:

def f(n):
    q = []
    for a in range(1,10001):
        w = str(n)*a
        e = len(w)
        t = n*a
        for b in range (max(1,e-8),min(10001,e)):
                r = int(w[:e-b])
                if r < t-b:
                    break
                if r == t-b:
                    q.append([a,b])
    return q



t = int(input())
q = []
for i in range(t):
    n = int(input())
    q.append(f(n))
for i in range(t):
    print(len(q[i]))
    for j in range (len(q[i])):
        print(*q[i][j])
        


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