Так с гугл-переводчиком понятно

and in the 4

Try this test:
1 5 2
to
be

answer: 1

Edited by author 25.09.2015 16:26

And this

input:
091

output:
109

and

092
119

0920
1019

Edited by author 22.12.2006 19:08

Try this and look for the time

010000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

Should give

100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

Edited by author 18.07.2007 05:06

My program give AC on your tests, but give WA#4. Please give me tests #4 or more tests. Thank.

Test 59 look like:

1000000000000000000000000

Answer: -1

There seem to be some non-ASCII characters in the test cases. If the input is loaded byte by byte, then the result should be output byte by byte as well.

I used Rust and handled the bytes as chars, which were stored as 4-byte unicode, but mistakenly output the result by chars instead of bytes.

8*n-7 <--- integer overflow

t = int(input())
for i in range(t):
    n, k = [int(i) for i in input().split()]
    m = n // k
    q = n % k
    s = (m * (n - m) * (k - q) + (m + 1) * (n - m - 1) * q) // 2
    print(s)

#распределяем максимально равномерно и "деремся" команда из m против всех оставшихся + команда из m + 1 против всех оставшихся и, поскольку учли каждый бой по два раза (для обоих участников), делим пополам =)

thx for test

my code passed yours test but shows WA1

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int N,a[55],b[55],i,c[55],j,d[55],t,e[55],m,n;
    unsigned long long x,y,p,arr[55];
    cin>>N;
    for(i=0;i<N;i++){
        cin>>a[i]>>b[i]>>c[i]>>d[i];
        e[i]=i;
    }
    cin>>m>>n;
    for(i=0;i<N;i++){
        x=max(a[i]-m,m-c[i]);
        if(x<0){
            x=0;
        }
        y=max(b[i]-n,n-d[i]);
        if(y<0){
            y=0;
        }
        arr[i]=x*x+y*y;
    }
    for(i=0;i<N;i++){
        for(j=i+1;j<N;j++){
            if(arr[i]>a[j]){
                p=arr[i];
                arr[i]=arr[j];
                arr[j]=p;
                t=e[i];
                e[i]=e[j];
                e[j]=t;
            }
        }
    }
        for(i=0;i<N;i++){
            cout<<e[i]+1<<" ";
        }

    return 0;
}

There are many more combinations. You also forgot 9

n, m = map(int,input().split(' '))
voices = []
p = ['p']
h = 0
for i in range(m):
    voices.append(int(input()))

for i in range(n):
    p.append(0)

for i in voices:
    for c in range(n+1):
        if i == c:
            p[c] += 1

for i in range(1, len(p)):
    h = p[i] / m * 100
    print(f'{h:.2f}%')



This is your code that prints the right answer. Python 3 uses BANKER'S rounding while the problem asks you to the MATHEMATICAL rounding. I used 'f-string' to perform MATHEMATICAL rounding. Anyways, the solution is not fast enough - try to come up with some speed-ups.

Sorry!
I understood my mistake.

Why?
Help me please.

I think that it will help you:)

18
22

36313404080
36313531363

3373687313428241827948801150507677526
3373687313428241828281428243137863733

669262074855963079771197586206281259112
669262074855963079787970369558470262966

242167700017836474388100
242167700018810007761242

16252383
16266261

469342775745586144105609869
469342775745595547577243964

37461293193018561603953493340
37461293193018681039139216473

9194184285169534216966507128749
9194184285169535359615824814919

21
22

1330454685235862
1330454774540331

78336742687917227491028
78336742688088624763387

47923802054017335212073765802860114
47923802054017335353371045020832974

505752
506605

940
949

428540910018912794058956977
428540910018929810019045824

9770330728908946347636591906356869449214
9770330728908946347777436498098270330779

7068416097840258049887921681085
7068416097840259520487906148607

517805724457730620
517805725527508715

506833497
506848605

5820
5885

484243646784563247619038458645194136
484243646784563248842365487646342484

91413688117232096060
91413688122188631419

771886477139587251334596
771886477140041774688177

8304292305552149553379655920949280409378
8304292305552149553443559412555032924038

9628134090110628
9628134114318269

2445193927845273449357413443
2445193927845335487293915442

519
525

6885428526826048829
6885428527258245886

72924386042452563577194755578
72924386042452625424068342927

TEST2 why not be 1250521?

your test 2 is wrong !
true answer : 1250521

In test 1250025 answer must be 1250521.

Test 2
1250025
1250521