| Show all threads Hide all threads Show all messages Hide all messages |
| AC,but have question | Felix_Mate | 1091. Tmutarakan Exams | 30 Dec 2021 12:57 | 2 |
Я решил с помощью ДП: f[i,k,d]-число способов выбрать k чисел от i до s, нод которых d.
Работает 0.031 sec.
Вопрос: как решить эту задачу именно с помощью теории чисел( я использовал в динамике только один факт: gcd(a1,a2,...,ak)=gcd(a1,gcd(a2,...,ak)))? Актуально ли это) но здесь можно решать еще с помощью формулуы включений-исключений. Предподсчитаем простые числа. Признаки в формуле - делимость на i. сочетаниями подсчитаем кол-во способов выбрать наборы. сочетания посчитаем динамикой |
| if you have WA9/WA11... | Egor Sibriaev | 1864. Get-Together at Den's | 30 Dec 2021 00:44 | 1 |
I have problems with english. Sorry
for example you answer is = int(ans)
but use int(ans + 0.00001) and you will get AC |
| Small hint | Конобейцев Иван Олегович | 1127. Colored Bricks | 29 Dec 2021 14:25 | 1 |
Small hint Конобейцев Иван Олегович 29 Dec 2021 14:25 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? |
| Is it correct? | 👾_challenger128_[PermSU] | 1521. War Games 2 | 29 Dec 2021 01:04 | 2 |
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? Of course 2nd one is wrong, it skips 10.
I think, the correct answer for your second test is:
2 4 6 8 10 3 7 1 9 5 |
| WA on test 10 | yuety25 | 1471. Distance in the Tree | 29 Dec 2021 00:51 | 1 |
Can anybody tell me test 10? |
| If you have WA2 | s_shshsh | 1643. Attack of the Dark Fortress | 28 Dec 2021 23:39 | 1 |
"Impossible" should start with uppercase 'I' |
| Chinese translation | LightningUZ | 1310. ACM Diagnostics | 26 Dec 2021 13:19 | 1 |
参考 百度知道
给定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 |
| WA 28 | LaVuna [NULP] | 1519. Formula 1 | 25 Dec 2021 20:35 | 2 |
WA 28 LaVuna [NULP] 25 Dec 2021 20:21 Can you help me with test 28? Yea, sure.
Just try
6 6
******
******
**..**
**..**
******
******
answer: 1 |
| WA #6 | Kipsasjaujoj | 2000. Grand Theft Array V | 25 Dec 2021 19:59 | 4 |
WA #6 Kipsasjaujoj 20 Oct 2014 00:26 Anyone has any tests for WA #6? I am out of ideas already. The problem seems too simple... This test helps you:
10
1 2 3 4 5 6 7 8 9 0
4 3
answer: 39 6 |
| Special Judge? | fishpear | 1752. Tree 2 | 24 Dec 2021 16:14 | 2 |
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? |
| hint | Pavel | 1989. Subpalindromes | 23 Dec 2021 13:16 | 1 |
hint Pavel 23 Dec 2021 13:16 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. |
| Can Vova go down by cableways? | Yermak | 1841. Cableways | 23 Dec 2021 06:43 | 6 |
Subj. Btw, what is the problem with the 23rd test? it's help me for wa23
4
0 4 0 4 0
1 0
1 1 0 1
1000000 0
1000000 0 Indeed! Thank you very much! Thank you very much! it's realy helpful!!! Very help!! Thank you again! |
| WA #6 | Furkat Ahrolov | 1207. Median on the Plane | 22 Dec 2021 04:28 | 1 |
WA #6 Furkat Ahrolov 22 Dec 2021 04:28 Help please!! What is test 6???? |
| WA #3 | Furkat Ahrolov | 1112. Cover | 21 Dec 2021 00:57 | 1 |
WA #3 Furkat Ahrolov 21 Dec 2021 00:57 |
| Easy problem | ValenKof | 1140. Swamp Incident | 20 Dec 2021 16:22 | 2 |
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. This is brilliant 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. |
| Weak tests | Vedernikoff Sergey | 1486. Equal Squares | 20 Dec 2021 12:32 | 2 |
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... why don't you share your strong tests with us then? |
| WA test #11 | Pascal or C++ | 1486. Equal Squares | 20 Dec 2021 12:32 | 5 |
Can you help me? I WA test #11 Can you help me? I WA test #11 Sorry. I can't. Oh! I can't help you too. I can help you, but I won't |
| going craaaaaaazy! | Rachel | 1486. Equal Squares | 20 Dec 2021 12:10 | 2 |
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 |
| help please test #11 | qweqweasd | 1408. Polynomial Multiplication | 19 Dec 2021 00:33 | 5 |
It gives WA please give me test for it (test #11) +1
I have the same problem.
Could somebody give a test, please?
Tried all the tests of this forum, neither of those helped me. My WA11
x-x
x-x
Result: 0
My result before AC on WA11: <empty line> |
| If you have WA @ 10 | 198808xc | 1527. Bad Roads | 18 Dec 2021 18:57 | 3 |
This test could help you.
5 8 1 5
2 200
1 2 1 100 99
2 3 0 0 0
3 2 0 0 0
2 4 0 0 0
4 2 0 0 0
3 4 0 0 0
4 3 0 0 0
4 5 1 100 99
You can draw this graph on paper, and the answer will be obvious. I have this output:
99
3
1 4 8
Good luck. I got RE9.I got WA10 after use your test.So interesting.QAQ
Sorry my bad English.
Edited by author 17.08.2021 06:35 In my case WA 10 was caused by one directional roads, not <->.
"In a country, there is a number of cities connected by unidirectional roads" |
