What is test nubmer 4? Anybody know?

for (long double N = 1; N < sqrt(2*S)+3; N++) {
}

Я решил с помощью ДП: f[i,k,d]-число способов выбрать k чисел от i до s, нод которых d.
Работает 0.031 sec.
Вопрос: как решить эту задачу именно с помощью теории чисел( я использовал в динамике только один факт: gcd(a1,a2,...,ak)=gcd(a1,gcd(a2,...,ak)))?

I have problems with english. Sorry
for example you answer is = int(ans)
but use int(ans + 0.00001) and you will get AC

There are only 6 available combinations.
Take a dice and think if you can make it so that 1 is adjacent to 6? 2 to 5? 3 to 4?

Test case: 5 5
Ans: 5 1 3 4 2
Test case: 10 2
Ans: 2 4 6 8 1 5 9 7 3
Is it correct ans?

Can anybody tell me test 10?

"Impossible" should start with uppercase 'I'

参考 百度知道
给定L,M,K,N，求序列A的数量。满足：
1. A的长度为L
2. A中元素均在 [1,M] 间的正整数
3. A的元素之和为K的倍数
求字典序第N小的序列A，排名从0开始标号
（即，称最小为“第0小”）
L<=100，M<=50，K<=50
N范围题目没有给

Edited by author 26.12.2021 13:22

Edited by author 26.12.2021 13:22

 Can you help me with test 28?

Anyone has any tests for WA #6? I am out of ideas already. The problem seems too simple...

The problem says the program only needs to print out any of the answers.
but why i WA in the first test but can pass all my tests?

If you are storing hashes in a segtree and using some custom prime divider the values of the parent nodes can be less than the child nodes because the remainder "makes a round", so to subtract u have to add that round, I think this is what is actually happening in test 2.

Subj. Btw, what is the problem with the 23rd test?

Help please!! What is test 6????

What is test #3??

Just try to replace x, y or z using equation y = x + z (vector form).
Count of cells on path is |x| + |y| + |z| + 1.

Testset for this problem is very weak. Program, that works ~5 secs. on my tests got AC in less than 1 sec. on jury tests...

Can you help me? I WA test #11

WA on the 5th test!
It passed all random tests on my computer.
got no idea!
Please help me!

Edited by author 12.03.2008 17:48