Notice that "Filling value” is THREE decimal places.

Why always getting mle on #2

Hi.
Can you give some samples to help fixing WA on test #7?

What can you tell me about this test? I'm having WA all the time

a = list(map(int,input().split()))
n = len(a)
for i in range(n-1,-1,-1):
    print("%.4f" % pow(a[i],1/2))

#include <iostream>
#include <vector>

#include <cassert>

#define cpuid(func,eax,ebx,ecx,edx)\
    __asm__ __volatile__ ("cpuid":\
    "=a" (eax),"=b" (ebx),"=c" (ecx),"=d" (edx):\
    "a" (func));


int main()
{
    {
        int a,b,c,d;
        cpuid(1,a,b,c,d);
        int extended_model = (a & 0xF0000) >> 12;
        assert(extended_model == 4 << 4);
        int family = (a & 0x0F00)>>8;
        assert(family == 6);
        int model = (a & 0xF0)>>4;
        assert(model == 15);
        int stepping = a & 0xF;
        assert(stepping == 1);
        if (__builtin_cpu_is("broadwell")) {
            std::vector<char>((1ULL << 20));
        }
    }

    int a, b;
    std::cin >> a >> b;
    std::cout << a + b << std::endl;
}

Give me test 17 please

goto if
if: print 123

Use hashs + bin find :)

using System;
namespace a
{
    class Program
    {
        static void Main(string[] args)
        {
            int n = Convert.ToInt32(Console.ReadLine());
            double[] A = new double[n];
            double S = 0;
            for (int i = 0; i < n; i++)
            {
               A[i]=Convert.ToInt64(Console.ReadLine());
            }
            for (int i = 0; i < n; i++)
            {
              S = S + A[i];
            }
            double B = S / n;
            for (int i = 0; i < n; i++)
            {
                if (A[i] == 3)
                {
                    Console.WriteLine("None");
                    goto finish;
                }
            }
            if (B >= 4.5)
            {
                Console.WriteLine("High");
                goto finish;
            }
            for (int j = 0; j < n; j++)
            {
                if (A[j] == 5)
                {
                    Console.WriteLine("Named");
                    goto finish;
                }
            }
            Console.WriteLine("Common");
        finish: ;
        }
    }
}

DP[i][j][k] = count of sets of length i ending at number j with total gcd of k
initialize with dp[1][n][n] = 1 for every n >= 2 && n <= s
ans is summation of all dp[K][num][g] where g > 1 and num between 2 and s

Edited by author 16.07.2021 18:48

Edited by author 16.07.2021 18:48

Edited by author 16.07.2021 18:48

Show please 5 test!

#I don't know why i start from lk+7. If anyone knew about that, please notify me.

import sys

n,k = sys.stdin.readline().split()
n = int(n)
lk = len(k)
res = 1

for i in range(lk+7,-1,-1):
    t = n - i*lk
    if t>0: res *= t

sys.stdout.write("%d\n"%res)

Edited by author 16.07.2021 09:03

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