If you have WA on test #3 or on test #1 or on test #2 you must use DP! Else if you have WA on test #4 you must use unsigned int or int 64 or long. If you have WA on test #8 you must change start and finish points ( 6-2 and 2-6 is equal ) !^_^!

l1=[]
l2=[]
l3=[]
for i in range(0,1000):
    l3.append(False)
def funct(a):
    b=a.split()
    if b[0]=='register':
        if b[1] not in l1:
            l1.append(b[1])
            l2.append(b[2])
            print("success: new user added")
        else:
            print("fail: user already exists")
    elif b[0]=="login":
        if b[1] not in l1:
            print("fail: no such user")
        else:
            k=l1.index(b[1])
            if l3[k]:
                print("fail: already logged in")
            else:
                if l2[k]==b[2]:
                    l3[k]=True
                    print("success: user logged in")
                else:
                    print("fail: incorrect password")
    elif b[0]=="logout":
        k=l1.index(b[1])
        if l3[k]:
            l3[k]=False
            print("success: user logged out")
        else:
            print("fail: already logged out")
f=int(input())
for m in range(0,f):
    n=input()
    funct(n)





f**king time limit!!!

using DP you can achieve O(n)

как сделать ввод на питоне в этой задаче? how to make python input in this task?

Use scanline and sort events by right border abd after that just count segments that their l > now so after this make now = r, ans++; firstly ans = 0 and now = 0;
Sorry for my English i'm from Russia

My AC program in Java has 396 lines =)

And you?)))

please tell me the 16 test

I have Wa #9 please give some tests

Edited by author 03.07.2021 11:15

in python: -5 % 7 == 2
in c++: -5 % 7 == -5

For God's sake, use ans/100 instead of ans*0.01f
But i don't know why

Maybe you forgot that the order of the numbers in the answer is important.

you can implement your simple fraction class and use it instead of floating point numbers

I don't know why, but in Python, code points of frame characters are:
upper_left  = 1066
upper_right = 1111
lower_left  = 1040
lower_right = 1065
horizontal  = 1044
vertical    = 1110
That's really strange, because there are no common codecs encode those characters as such.
Could Admin fix this or at lease give some explanations please?

Also, don't put non-ascii characters in your source code, but use:
  c == chr(1066)
or
  ord(c) == 1066

Any submission on Kotlin or Java return 'Restricted function' error. Even solutions that previously could pass at least some tests.

Здравствуйте, решение из примеров для задачи "1000. A+B"

object Main extends App {
   println(readLine().split(" ").map(_.toInt).sum)
}

выдает ошибку "Restricted function"

Edited by author 23.06.2021 07:43

Edited by author 23.06.2021 07:43

Edited by author 23.06.2021 07:43

Remember: maximum accuracy can not be more than 10 in minus the secong degree.
Запомните: максимальная точность числа не больше 10 в -2 степени.

I have O(len(s) * k^2), and it is definitely too slow (TL#26).

BTW, and here is some tests (don't want to create separate topic):

3
CC
00
1
01
*****
ans=-1

3
BAB
10
111
0
*****
ans=7

3
BA
00
01
1
*****
ans=3

3
CA
001
000
01
*****
ans=5

Input:
3
'╣' like '[╣-I]'
'╣' like '╣'
'╣' like '_'
Output:
YES
YES
YES