Could some one advise regarding the test 16? As far as I can get my solutions works properly nontheless it fails on the test.

Edited by author 16.12.2020 13:34

Edited by author 16.12.2020 13:37

For those who has WA4 or WA7

Test #1:
20 10
3
94 3 3 18
36 7 1 10
73 2 15 19

Answer: 1


Test #2:
7 2
11
6 1 4 1
9 2 5 1
8 3 1 2
7 1 4 2
10 1 7 2
4 2 5 3
99 3 1 5
85 3 4 5
100 1 7 5
100 1 7 6
100 1 7 7

Answer: 4


Test #3:
55 14
87
84 26 14 12
24 14 41 27
85 6 42 18
42 5 49 44
54 1 13 40
85 1 55 17
77 1 9 55
34 5 15 50
31 1 32 55
18 2 54 45
59 8 26 44
79 3 43 52
72 4 51 51
101 5 34 46
35 1 52 18
31 8 47 3
92 1 20 38
10 2 50 1
46 2 5 51
10 2 48 13
92 3 21 52
84 1 12 55
58 2 11 17
24 1 46 54
74 1 30 9
32 2 54 43
29 3 28 52
23 2 1 41
89 1 19 44
49 2 53 1
52 2 40 1
77 6 1 33
44 1 42 9
28 1 52 16
53 1 9 52
74 1 42 2
16 1 37 54
27 1 40 55
72 6 3 21
58 1 13 55
9 1 44 55
37 2 50 23
51 7 21 2
6 1 34 43
27 5 39 43
16 1 40 54
63 2 2 54
93 1 7 55
63 2 13 9
12 1 18 55
94 1 54 12
34 2 41 54
91 1 12 47
99 1 55 27
97 4 25 40
70 1 55 29
21 1 39 54
42 1 9 41
89 1 31 53
84 2 50 17
93 1 14 55
81 4 7 36
68 1 55 14
84 2 7 43
51 1 21 55
85 3 53 23
46 6 1 44
49 2 3 28
42 1 20 53
58 1 53 13
15 2 54 21
59 2 47 50
94 1 17 55
28 2 40 25
49 2 48 54
88 1 55 32
55 4 17 8
47 4 3 17
41 3 49 20
7 1 52 20
67 1 49 52
33 1 38 55
85 5 3 4
23 3 21 45
19 3 11 50
36 1 2 39
67 8 31 1

Answer: 24


Good Luck!

Be careful if you use custom I/O. Input data may contain several spaces in a row

1. Limitations were changed. Now 2 ≤ m ≤ 200; 1 ≤ stop_ID ≤ 1000. In old version 1 ≤ m ≤ 1000; 1 ≤ stop_ID ≤ 10000, but there were no such tests.
2. Checker was updated.
3. Some new tests were added. 618 solutions lost AC verdict.

Hint: if your solution got Runtime Error, check a stack size in your code.

Попробуйте использовать массив, в котором a[i] означает, что из станции i выйдут a[i] пассажиров.

.
случайно
Edited by author 08.12.2020 04:24

Edited by author 08.12.2020 04:24

Edited by author 08.12.2020 04:24

Let suppose there is prefix sum array with mod n is pre1,pre2,......,pren. Since there can be only n-1 numbers present except zero. If zero is one of elements in prefix sum array then answer is already 0 to i. Else If zero is not present then some number should repeat because prefix array is of size n but only 1,2.... n-1 numbers are present. So there should be particular i,j => prei==prej. Therefore from i+1 to j segment will be divisible by n.

Edited by author 08.12.2020 00:01

What's the WA 3??

and send me please some tests if u have)

can anyone tell me what is test case 13?

I have RE5, when I use

var s = Console.Readline().Split()
var sz = s[0];
var firstElement = s[1]; //!!!!!! There is RE!

I have to impose conditions test5 and his input file have a line with only one ("1")!!

Since N is as big as 10000 the solution for N = 10000 exceeds unsigned long so you should use big numbers (put the numbers in arrays and then do the operations on the arrays)
https://www.infoarena.ro/lucrul-cu-nr-mari

Try tist test:
5
1 2 4 8 16

Right answer is 32 ))))

people=2
m=0
stop=0
min_=int(float(input())*100)
max_=int(float(input())*100)
while stop!=1:
    for i in range (min_+1,max_):
        j=list(str(float((people*i)/10000)))
        while j[m]!='.':
            m+=1
        if int(j[0])>0:
            try:
                if j[m+1]=='0'and j[m+2]=='0':
                    print (people)
                    stop=1
                    break
            except IndexError:
                if j[m+1]=='0':
                    print (people)
                    stop=1
                    break
    people+=1

test 4 ??? help me please

B)

Draw a polygon. the sum of its angles is pi*(n-2). The sum of pieces of circles is R*(n*pi-(n-2)*pi)=2*R*pi (you can see it easily if u draw)

sort the array. maintain W, the total weight of the array.
start from the smallest element and add A[i] * W to ANS.
subtract A[i] from W.
add A[i] * W again.

Hi! This is my code for 1183,can someone help me to solve it? I have time limit exceeded on test 9,please help!
#include <stdio.h>
#include <string.h>
//#include <limits.h>
#define MIN(x, y) (((x) < (y)) ? (x) : (y))
int L,memo[100][100];
char S[101];
/*int min(int x,int y)
{
    if(x<y)
        return x;
    else
        return y;
}*/
int rezolva(int s, int e)
{
    if(s>e)
        return 0;
    int ret = memo[s][e];
    if(ret==-1){
        ret = 1+rezolva(s+1,e);
        if(S[s]=='(' || S[s]=='[')
            {
            for(int i = s+1;i<=e;i++)
                if((S[s]=='(' && S[i]==')') || (S[s]=='[' && S[i]==']'))
                    ret = MIN(ret,rezolva(s+1,i-1)+rezolva(i+1,e));
        }
    }
    return ret;
}
void print(int s, int e)
{
    if(s>e) return;
    int best = rezolva(s,e);
    if(1+rezolva(s+1,e)==best)
    {
        if(S[s]=='(' || S[s]==')')
            {
            putchar('(');
            putchar(')');
        }
        else
            {
            putchar('[');
            putchar(']');
        }
        print(s+1,e);
        return 0;
    }
    for(int i = s+1;i<=e;++i)
        {
        if(((S[s]=='(' && S[i]==')') || (S[s]=='[' && S[i]==']')) && best==rezolva(s+1,i-1)+rezolva(i+1,e)){
            if(S[s]=='(')
                {
                putchar('(');
                print(s+1,i-1);
                putchar(')');
                print(i+1,e);
            }
            else
            {
                putchar('[');
                print(s+1,i-1);
                putchar(']');
                print(i+1,e);
            }
            return 0;
        }
    }
}
int main()
{
    scanf("%s",S);
    L = strlen(S);
    memset(memo,-1,sizeof(memo));
    print(0,L-1);
    putchar('\n');
    return 0;
}

using System;
using System.Collections.Generic;
using System.Globalization;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace ConsoleApp9
{
    class Program
    {
        static void Main(string[] args)
        {
            int a1;
            a1 = Convert.ToInt32(Console.ReadLine());
            if (a1 >= 1 && a1 <= 2000)
            if (a1 >= 1 && a1 <= 4)
            {
                Console.WriteLine("few");
            }
            if (a1 >= 5 && a1 <= 9)
            {
                Console.WriteLine("several");
            }
            if (a1 >= 10 && a1 <= 19)
            {
                Console.WriteLine("pack");
            }
            if (a1 >= 20 && a1 <= 49)
            {
                Console.WriteLine("lots");
            }
            if (a1 >= 50 && a1 <= 99)
            {
                Console.WriteLine("horde");
            }
            if (a1 >= 100 && a1 <= 249)
            {
                Console.WriteLine("thorg");
            }
            if (a1 >= 250 && a1 <= 499)
            {
                Console.WriteLine("swarm");
            }
            if (a1 >= 500 && a1 <= 999)
            {
                Console.WriteLine("zounds");
            }
            if (a1 >= 1000)
            {
                Console.WriteLine("legion");
            }
            return;
        }

    }
}