Quick (fast) contest #1 starts in 30 minutes!

Last chance to register)

Today there will be 4 problems and 20 minutes for solving them!

Good luck!

The registration for Quick (fast) contest #1 has opened!

Sign up (register) now and invite your friends to compete with them!

https://mirror.codeforces.com/gymRegistration/103029

Good afternoon, I am happy to announce a new type of speed training contests!

This is an absolute new format on Codeforces, which I have come up with and will implement. In each of the contests there will be 2-4 problems that need to be solved in 15 minutes, the competition format will be ICPC. The tasks will be in both Russian and English. The main idea of these contests is to learn how to solve simple ideological problems quickly. The contests will be available in the Training Sessions, and the time of the contest will be the same for all of them. The first contest will take place on March 31 (preliminary time 16:35 Greenwich Mean time), very soon it will appear in training, so I invite everyone to take part in this first-of-its-kind contest!

Upd1: This contest will be in gym uploaded by my friend codeforces_administrator

Upd2: You can see Quick (fast) contest #1 now in gym!

The registration opens 6 hours before the start!

Upd3: The registration for Quick (fast) contest #1 has opened! Sign up (register) now and invite your friends to compete with them!

https://mirror.codeforces.com/gymRegistration/103029

UPD4: Sorry, right now we can't do the editorial, cause that's just our first experience in this kind of contest, but we are happy to make some results: Congrats to winners!

1) mars4 -- The only person who solved all the tasks without a single penalty. Congrats!

2) Kira_1234

3) CommandMaster

4) AnandOza

5) bulbunyuk

And as it is speed contest we also want to congratulate people with "First-AC"

A) AnandOza

B) AnandOza

C) clam

D) AnandOza

Code for A:

n, x = map(int, input().split())
ar1 = list(map(int, input().split()))
k = int(input())
ar2 = list(map(int, input().split()))
kek = set()
for elem in ar2:
    kek.add(elem)
ans = 1
for i in range(n):
    if i + 1 not in kek:
        ans += ar1[i]
print(ans)

Code for B:

n = int(input())
if n == 1:
    print('Win')
elif n == 2:
    print('Draw')
else:
    print('Lose')

Code for C:

a, b = map(int, input().split())
if a >= b:
    if b == 0:
        print(2 * a + 1)
    else:
        print(0)
else:
    if 2 * a > b:
        print(0)
    else:
        print(b + 1)

Code for D:

from math import sqrt

n, m = list(map(int, input().split()))
c = sqrt(3)
print(max(int(2 * n / c) * (2 * m - 1), int(2 * m / c) * (2 * n - 1)))

Hi, codeforces!

My orange friends are really sad, because div1 on codeforces it is really rare nowadays... If we will see calendar — we will find 4 Div2 rounds and 0 Div1 rounds... It is very dissapointed, because it actually means that next Div1 will be in July! Can you help my orange friends, they are really sad about this... MikeMirzayanov