Let's solve 4 problems below using main.kt
- We will benchmark the processing time of your code.
- If the number of correct answers is the same, faster code will be ranked higher.
- Code will be eliminated if it takes more than 2 mins.
- The actual test cases will be published only at a later date.
https://forms.gle/3pTnurkXmpvdr6kp6
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
You may assume the two numbers do not contain any leading zero, except the number 0 itself.
Example:
Input: (2 -> 4 -> 3) , (5 -> 6 -> 4)
Output: (7 -> 0 -> 8)
Explanation: 342 + 465 = 807.
Source https://leetcode.com/problems/add-two-numbers/
Alice and Bob are decorating a Christmas Tree.
Alice wants only 3 types of ornaments to be used on the Christmas Tree: yellow, blue and red. They have y yellow ornaments, b blue ornaments and r red ornaments.
In Bob's opinion, a Christmas Tree will be beautiful if:
the number of blue ornaments used is greater by exactly 1 than the number of yellow ornaments, and
the number of red ornaments used is greater by exactly 1 than the number of blue ornaments.
That is, if they have 8 yellow ornaments, 13 blue ornaments and 9 red ornaments, we can choose 4 yellow, 5 blue and 6 red ornaments (5=4+1 and 6=5+1).
Alice wants to choose as many ornaments as possible, but she also wants the Christmas Tree to be beautiful according to Bob's opinion.
In the example two paragraphs above, we would choose 7 yellow, 8 blue and 9 red ornaments. If we do it, we will use 7+8+9=24 ornaments. That is the maximum number.
Since Alice and Bob are busy with preparing food to the New Year's Eve, they are asking you to find out the maximum number of ornaments that can be used in their beautiful Christmas Tree!
It is guaranteed that it is possible to choose at least 6 (1+2+3=6) ornaments.
Input The function take three integers y, b, r (1≤y≤100, 2≤b≤100, 3≤r≤100) — the number of yellow, blue and red ornaments.
It is guaranteed that it is possible to choose at least 6 (1+2+3=6) ornaments.
Output
Print one number — the maximum number of ornaments that can be used.
input:
y:8, b:13, r:9
output:
24
Source:
https://codeforces.com/contest/1171/problem/B
Given a positive integer n ( 1 <= n <= 1,000,000,000),
calculate the sum of positive even integers not greater than n.
Input: 10
Output: 30
Explanation: 2+4+6+8+10
Given a list of 200,000,000 numbers, each of which is between 0 and 100,000,000.
Please count (in a reasonable time) numbers that are not on the list.
The memory is limited to only 128MB (use VM option -Xmx128m ).
Input: Sequence<Int>
Output: number of missing numbers