| ENG RUS | Timus Online Judge |
Обсуждение задачи 1310. Диагностика ACMLightningUZ Chinese translation // Задача 1310. Диагностика ACM 26 дек 2021 13:19 参考 百度知道 给定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 tyomitch flaky problem statement [1] // Задача 1310. Диагностика ACM 13 фев 2013 21:08 "choosing" -> "chosen" "divided" -> "divisible" "satisfied" -> "satisfying the" "is really completely defines" -> "completely defines" These aren't just typos, they impede the understanding. Sandro (USU) Fixed (-) // Задача 1310. Диагностика ACM 15 фев 2013 00:55 Rizvanov++ de xXx Why i got WA#11????? [3] // Задача 1310. Диагностика ACM 2 май 2006 00:47 Test#11 4 10 4 2497 Out - 10 10 10 2 What's wrong? Rizvanov++ de xXx Re: Why i got WA#11????? [2] // Задача 1310. Диагностика ACM 2 май 2006 13:41 Help!!! Trần Quang Chung Re: Why i got WA#11????? [1] // Задача 1310. Диагностика ACM 3 июл 2006 07:05 I think the res is : 10 10 10 10 liangjingtao Re: Why i got WA#11????? // Задача 1310. Диагностика ACM 31 окт 2012 18:32 I do think so Tratata (barssimfi@mail.ru) Give please any hints, how to solve this problem. I get TLE(16) [1] // Задача 1310. Диагностика ACM 28 июл 2004 16:14 Denis Koshman Re: Give please any hints, how to solve this problem. I get TLE(16) // Задача 1310. Диагностика ACM 13 авг 2008 02:54 DP on Amount x Remainder (100x50), then continusously subtract calculated amounts with 1... 2... 3... from given index. Once it becomes strictly less than current number - proceed deeper for the next value. Alexandru Popa I get WA on test 16 [1] // Задача 1310. Диагностика ACM 1 июл 2005 01:06 What is wrong with this test ? Denis Koshman Re: I get WA on test 16 // Задача 1310. Диагностика ACM 13 авг 2008 02:51 I had WA17, but that was too few reserved digits. Alexandru Popa How big is N for test 16 ? [3] // Задача 1310. Диагностика ACM 1 июл 2005 01:18 Michael Rybak (accepted@ukr.net) N can be 50^100 (-) [2] // Задача 1310. Диагностика ACM 15 фев 2006 20:03 - SPIRiT No, it can't be!(+) [1] // Задача 1310. Диагностика ACM 28 авг 2006 12:47 N is much smaller than 50^100. 50^100 - is the number of all possible states, but N is the order of all ALLOWABLE states (whose sum mod K = 0 )and that's quite less, but still does not fit even in int64 :(. Wherefore, you have to use long arifmetics. Denis Koshman Re: No, it can't be!(+) // Задача 1310. Диагностика ACM 13 авг 2008 02:51 If K=1, you'll get your 50^100 :) Victor Barinov (TNU) To Admins: One more test [2] // Задача 1310. Диагностика ACM 10 июл 2008 00:13 My program get AC, but works incorrectly on this test. Please add it: 100 100 1 99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999 Sandro (USU) Re: To Admins: One more test [1] // Задача 1310. Диагностика ACM 10 июл 2008 09:50 This test is incorrect, because M must be <= 50. Victor Barinov (TNU) Re: To Admins: One more test // Задача 1310. Диагностика ACM 12 июл 2008 00:52 sorry :) davidsun Something about WA#5 // Задача 1310. Диагностика ACM 27 янв 2008 12:42 If you have got WA on Test #5, just pay attention to the statement of the problem. It is said that N is "an arbitrary vector of length L" in the problem, but actually N is just an INTEGER. So, read an integer instead of reading a string with length L. Sid java.Math.BigInteger [2] // Задача 1310. Диагностика ACM 23 июн 2006 16:34 I've used BigInteger solving this problem, am I supposed to use this class on timus and acm contest? Does anybody know may I also use on contests HashMap and another such powerfull classes. Burunduk1 Re: java.Math.BigInteger // Задача 1310. Диагностика ACM 23 июн 2006 17:00 You can use it. And also everything from STL. Vladimir Yakovlev (USU) Of course, you can! // Задача 1310. Диагностика ACM 23 июн 2006 18:12 Samsonov Alex [USU] Sample test [1] // Задача 1310. Диагностика ACM 3 апр 2006 15:42 Am I right? 1. there are 200 chains with first digit from 1 to 8 2. 201: 9-1-2 202: 9-1-6 203: 9-1-10 204: 9-2-1 205: 9-2-5 206: 9-2-9 207: 9-3-4 208: 9-3-8 209: 9-4-3 210: 9-4-7 211: 9-5-2 212: 9-5-6 213: 9-5-10 !! 214: 9-6-1... Then, is sample correct? Anton Lun'ov Re: Sample test // Задача 1310. Диагностика ACM 9 апр 2006 03:01 First chain has index 0. So test is correct.
|