| ENG RUS | Timus Online Judge |
Common Boardclassenemy Insight // Problem 1494. Monobilliards 16 May 2024 23:20 There is only one eligible lowered numbered ball at any round. Keeping track of this should result in O(n) solution So Sui Ming another hint [1] // Problem 1209. 1, 10, 100, 1000... 16 Jan 2024 19:23 Stack 1,10,100,1000,10000,100000,... vertically: 1 10 100 1000 10000 100000 ... the cumulative sums of digits from the top are: 1,3,6,10,15,21,... which are in the form of combination(N,2) = N*(N-1)/2 checking whether one is at Kth digit is the same as finding if there is integer solution to: N*(N-1)/2 = K-1 one way is to solve the quadratic equation for N (in double) and cast N to integer and check the above relation. regards, So Sui Ming Edited by author 16.01.2024 19:27 Edited by author 16.01.2024 19:27 Pedro[UFES] Re: another hint // Problem 1209. 1, 10, 100, 1000... 15 May 2024 06:02 Great solution, So Sui Ming, I did not think about that one in particular. I just use prefix sums and binary search. If you write down the sequence and it's index starting from 1. You will notice that if you do prefix sum ( half interval way , so starting from 0, the first element, first element + second element, etc. ) up till sum <= MAX ( 2^31 - 1 ), you will get 65535 numbers in a sorted way. In this way, notice, that the numbers in this prefix_sum array are all index s.t. digit = 1. You still need to +1 in every position of prefix_sum array, because of 1-index of input. Now you read input number K and do binary search on the prefix sum array. If you did find, great! It is 1. Otherwise, it is 0. Pedro[UFES] Tips without answer, but it's useful // Problem 1209. 1, 10, 100, 1000... 15 May 2024 05:53 Write down the sequence, on paper, by hand. Now, right down the index of each digit on the sequence. Do you know prefix sums and binary search? It's kinda useful for many problems btw... Edited by author 15.05.2024 05:54 Emris Help please!!!! WA 3 [1] // Problem 1013. K-based Numbers. Version 3 12 May 2024 16:35 I solved 1009 and 1012. Now im using new algorithm (log(n)) and program works fast and correct with my tests. Can you give more tests? Emris Re: Help please!!!! WA 3 // Problem 1013. K-based Numbers. Version 3 12 May 2024 17:09 I solved 1013, my mistake was multiplication of large numbers, i use long arithmetic for multiplication and uint64 for variables and get Accept FaNato4kA_TiMoFeYa Overrated // Problem 1809. Chapaev and Potatoes 12 May 2024 15:40 Theodike WA #5 wrong answer [3] // Problem 1306. Sequence Median 12 Feb 2019 21:41 My code is here: -------------- #include <iostream> using namespace std; int compare(const void * x1, const void * x2) { return (*(int*)x1 - *(int*)x2); } int main() { long N; cin >> N; int *m = new int [N]; for (int i = 0; i < N; ++i) { cin >> m[i]; } qsort(m, N, sizeof(int), compare); if (N % 2 == 0) { cout << (((m[(N - 1)/ 2] + m[N / 2]) / 2.0)*10)/10; } else { cout << m[N/2]; } return 0; } -------------- Tell me please where I made a mistake Alikhan Zimanov Re: WA #5 wrong answer [2] // Problem 1306. Sequence Median 18 Jan 2020 13:18 Try the following test: 4 2147483647 2147483647 2147483647 2147483647 Saik Maxim Re: WA #5 wrong answer [1] // Problem 1306. Sequence Median 14 Mar 2021 15:46 how to bypass this test? Кирилл Re: WA #5 wrong answer // Problem 1306. Sequence Median 10 May 2024 14:40 I tried to use if(arr[n / 2] == -1)cout << "2147483647"; but I still have WA on test 5 Bahturin Alexander (SibSUTI#2) Please, explain me the Sample! [2] // Problem 1180. Stone Game 3 Nov 2005 07:43 I can't understand it... If N1 takes 2 stones at first move, he will lose, won't he? 1:8 - 2 = 6 2:6 - 2 = 4 1:4 - 2 = 2 2:2 - 1 = 1 1:1 - 1 = 0 Please, tell me, where I'm wrong? Bahturin Alexander (SibSUTI#2) Ooops... [1] // Problem 1180. Stone Game 10 Dec 2005 14:45 I understood my mistake. Sorry. tima20072007 Re: Ooops... // Problem 1180. Stone Game 9 May 2024 22:22 Хорош So Sui Ming info on orientation of cube // Problem 1016. Cube on the Walk 9 May 2024 21:36 if the cube is at e2, neighbors are: e1 (near), e3 (far), d2 (left) and f2 (right) So Sui Ming 24 orientations of cube + small test case // Problem 1015. Test the Difference! 7 May 2024 09:30 for your convenience 24 orientations of cube: 1 2 3 4 5 6 1 2 4 5 6 3 1 2 5 6 3 4 1 2 6 3 4 5 2 1 3 6 5 4 2 1 4 3 6 5 2 1 5 4 3 6 2 1 6 5 4 3 3 5 1 6 2 4 3 5 2 4 1 6 3 5 4 1 6 2 3 5 6 2 4 1 4 6 1 3 2 5 4 6 2 5 1 3 4 6 3 2 5 1 4 6 5 1 3 2 5 3 1 4 2 6 5 3 2 6 1 4 5 3 4 2 6 1 5 3 6 1 4 2 6 4 1 5 2 3 6 4 2 3 1 5 6 4 3 1 5 2 6 4 5 2 3 1 test: 4 1 4 2 3 6 5 1 4 3 6 5 2 1 4 5 2 3 6 1 4 6 5 2 3 ans: 1 1 2 3 4 pocochuk Funny // Problem 1915. Titan Ruins: Reconstruction of Bygones 6 May 2024 00:05 :) Egor Sibriaev Формула Пика ван лав!!! [1] // Problem 1139. City Blocks 2 Dec 2021 03:31 Maolenvenajaa Re: Формула Пика ван лав!!! // Problem 1139. City Blocks 4 May 2024 21:47 А поточнее? Enigma [UB of TUIT] I got Accepted in Java !!! [2] // Problem 1119. Metro 12 Oct 2011 13:03 Memory: 0,942 KB, Time: 0.125 http://acm.timus.ru/status.aspx?author=96814 Maolenvenajaa Re: I got Accepted in Java !!! // Problem 1119. Metro 4 May 2024 21:22 Круто Maolenvenajaa Re: I got Accepted in Java !!! // Problem 1119. Metro 4 May 2024 21:23 Can you send me solution on elsocm5@gmail.com? Thank You! FaNato4kA_TiMoFeYa Great task [1] // Problem 1358. Cables 4 May 2024 20:08 FaNato4kA_TiMoFeYa Re: Great task // Problem 1358. Cables 4 May 2024 20:17 It would be interesting to solve such a problem on an arbitrary graph (not a tree) or to say that there is no solution for such a graph. Sergei Barannikov To admins [2] // Problem 2102. Michael and Cryptography 19 Oct 2019 09:51 Please add the following testcase: 869637034218881024 = 2^18 * 1806487 * 1836383 The answer should be "Yes". My solution prints "No" and nevertheless has AC. lnxdx Re: To admins [1] // Problem 2102. Michael and Cryptography 29 Oct 2019 00:24 Thank you! Good test. I found another good one. 999979520100663296. I think it's stronger. However I got AC before, but i was looking for a good test. Edited by author 29.10.2019 00:37 melkiy Re: To admins // Problem 2102. Michael and Cryptography 3 May 2024 17:22 One of the largest allowed numbers 999999999987679232 = 2^19 * 1907348632789 where the second multiplier is a prime number. denxxjkee Hint for WA12 // Problem 1074. Very Short Problem 1 May 2024 20:18 For WA12 try this: 9126492316491641269352615215701236589213658621356281376589216562319562396592381659862195621281E-190 100 # Output must be: 0.0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000009126 denxxjkee Still got WA2 but all test in other themes is passed [1] // Problem 1074. Very Short Problem 1 May 2024 13:57 What is test #2? denxxjkee Re: Still got WA2 but all test in other themes is passed // Problem 1074. Very Short Problem 1 May 2024 15:44 Try this: .234 2 .2 2 # Answers: 0.23 0.20 FaNato4kA_TiMoFeYa Overrated // Problem 1728. Curse on Team.GOV 1 May 2024 00:53 Vit Demidenko VC is faster G++!!! [2] // Problem 2027. URCAPL, Episode 1 28 Oct 2014 11:40 3 times! what the reason? vc++ 0.328 sec g++ 1.078 sec upd. in 3 problems vs is really faster than g++ (2-3 times). Compiler problem? Edited by author 28.10.2014 17:39 Edited by author 28.10.2014 17:39 ImgJ Re: VC is faster G++!!! // Problem 2027. URCAPL, Episode 1 16 Apr 2015 01:43 LOL I have AC in G++11 with time 0.093 s, some other people have AC with 0.031 s. How did you solve this problem with 1.078 s? xD FaNato4kA_TiMoFeYa Re: VC is faster G++!!! // Problem 2027. URCAPL, Episode 1 30 Apr 2024 12:15 This is absolutely not true Alex_Gu WA 18: wrong order of points in polygone // Problem 1215. Exactness of Projectile Hit 29 Apr 2024 19:56 The test contents points entered clockwise, which doesn't respond the condition. I succeed passing the test only after applied an algo, which is not sesitive to the order of points in polygone Edited by author 29.04.2024 19:57 Edited by author 29.04.2024 19:57 Igor wrong answer C++ [1] // Problem 1001. Reverse Root 20 Mar 2023 12:40 I want to solve the problem using a dynamic array. But the compiler outputs this: HEAP CORRUPTION DETECTED: after Normal block (#150) at 0x000001EEFBCDB420. CRT detected that the application wronte to memory after end of heap buffer. #include <iostream> #include <cmath> #include <iomanip> using namespace std; void main() { int size = 0, i = 0; int* a = new int[size]; unsigned int x; while (cin >> x) { size += 1; for (; i < size;++i) { a[i] = x; } } for (int i = size-1; i >= 0; --i) { cout << fixed << setprecision(4) << sqrt(a[i]) << endl; } delete[] a; Edited by author 20.03.2023 12:40 vzhanm Re: wrong answer C++ // Problem 1001. Reverse Root 29 Apr 2024 11:23 Type int will overflow. Use unsigned long long instead.
|