Codeforces Round 690 (Div. 3)

Solutions are presented as using the least memory and the fastest execution time. It also takes the top 10 most recent solutions from each language. If you want to limit to a specific index, click the "Solved" button and go to that problem.

ContestId
Name
Phase
Frozen
Duration (Seconds)
Relative Time
Start Time
1462 Codeforces Round 690 (Div. 3) FINISHED False 7200 123780299 Dec. 15, 2020, 2:35 p.m.

Problems

Solved$
Index
Name
Type
Tags
Community Tag
Rating
( 32828 ) C Unique Number PROGRAMMING dp greedy math

B'You are given a positive number x . Find the smallest positive integer number that has the sum of digits equal to x and all digits are distinct (unique). The first line contains a single positive integer t ( 1 <= t <= 50 ) -- the number of test cases in the test. Then t test cases follow. Each test case consists of a single integer number x ( 1 <= x <= 50 ). Output t answers to the test cases: '...

Tutorials

Codeforces Round #690 (Div. 3) Editorial

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
101398965 Ebu C Dec. 16, 2020, 8:26 a.m. OK .NET Core C# TESTS 23 93 0
101414494 ansergeyg C Dec. 16, 2020, 10:35 a.m. OK .NET Core C# TESTS 23 108 2764800
101394411 Debasish1610177113 C Dec. 16, 2020, 7:39 a.m. OK .NET Core C# TESTS 23 109 0

remove filters

Back to search problems