| ENG RUS | Timus Online Judge |
Common BoardNeralu WA #23 // Problem 1498. Stroke at Full Speed 8 Mar 2021 00:05 I've already run throw every test i've found here and some that I thpught myself. I dont understand what is test #23. Can someone post some test to run? Edited by author 08.03.2021 04:25 Edited by author 25.03.2021 12:41 Muhammad HOW IN JAVA [1] // Problem 1197. Lonesome Knight 8 Oct 2020 17:01 hi how is this issue in java programming language. please help koti4 Re: HOW IN JAVA // Problem 1197. Lonesome Knight 6 Mar 2021 19:49 /** * @author koti4 * */ import java.util.*; public class Main { /** * @param args */ public static void main(String[] args) { Scanner input = new Scanner(System.in); int k,n,x,y,flag=0; char x1,y1; String s = " "; n=input.nextInt(); for(int q = 0;q<n;q++) { s=input.next(); x1=s.charAt(0); y1=s.charAt(1); x = (int) x1-96; y = (int) y1-48; /*System.out.println(x); System.out.println(y);*/ for(int i =-2;i<=2;i++) { for(int j=-2;j<=2;j++) { if (j != i) { if(x-i>0 & y-j>0 & x-i < 9 & y-j < 9) { if(i*i+j*j==5) { flag++; } } } } } System.out.println(flag); flag = 0; } input.close(); } } Дмитрий WA #2 // Problem 1316. Electronic Auction 6 Mar 2021 19:01 journ = [] x = 0 k = 0 sold = 0 cmd = ',,' while cmd[0] != 'QUIT': cmd = input().split() oper_name = cmd[0] if cmd[0] == 'BID': x = cmd[1] journ.append(x) elif cmd[0] == 'DEL': x = cmd[1] journ.remove(x) elif cmd[0] == 'SALE': x = cmd[1] k = int(cmd[2]) for i in journ: if float(i) >= float(x): k -= 1 sold += 1 else: continue print(sold * 0.01) What is wrong ? Zhang Ye wa15 [2] // Problem 1570. Eating High 6 Mar 2013 14:07 Can I use CompletePack to solve it? Give me a test about wa15. Zhang Ye Re: wa15 // Problem 1570. Eating High 6 Mar 2013 16:20 5 8 a 11 1.1 b 14 1.4 c 15 1.5 e 15 1.5 f 20 2.0 Abid29 Re: wa15 // Problem 1570. Eating High 6 Mar 2021 11:07 5 8 a 11 1.1 b 14 1.4 c 15 1.5 e 10 1 f 20 2.0 RainAir which answer are correct [1] // Problem 1345. HTML 5 Mar 2021 11:35 Input: _123 My first solution output: _<span class=number>123</span> My second solution output: _123 But all passed. So which answer are correct? Zergatul Re: which answer are correct // Problem 1345. HTML 5 Mar 2021 21:05 Task description says: "The correct source of a program in Pascal is given" Your input is definitely not correct source Alexs WA19 // Problem 1608. Lucky Tickets 2008 5 Mar 2021 00:08 .I'm already tired of solving this number..Mods please give me 19th test case... nekettos What is the reason of Runtime error test 8? // Problem 1039. Anniversary Party 4 Mar 2021 23:10 Please, if you know, give an advice, how to pass this problem kirdmiv AC 0.926 [1] // Problem 1223. Chernobyl’ Eagle on a Roof 9 Feb 2021 21:08 O(n^3) to calculate dp values. o(1) to answer query. dp[floors][eggs] -- answer. Abid29 Re: AC 0.926 // Problem 1223. Chernobyl’ Eagle on a Roof 4 Mar 2021 21:17 it enough to calculate in O(10*n^2) AC in 0.015sec Valeev Konstantin KRBO-04-19 Time limit for Phyton? // Problem 1331. Vladislava 4 Mar 2021 14:42 ограничение по времени для Питона не выполняется... bsu.mmf.team m can be zero // Problem 1300. Taxes 3 Mar 2021 22:08 A test like this is possible: 15 0 35 12000000 12000000 -1 First time it occurs in Test 9. This means that you should pay the same tax for any amount of salary. It is ok to output 0.00 for all such tests, despite it is not correct always because of interim roundings of regional coefficient. Everything else is well-described in previous comments, basically correct numbers round and correct searching of initial salary (you should search for max possible value with 2 decimal places in it) are the only things that can make the initial problem description being unclear. Ilian Here are second and third test case for people who WA#2 or #3 [5] // Problem 1078. Segments 7 Mar 2014 22:50 Test case 2: 9 -1 1 -2 2 -3 3 -10 10 3 6 4 5 2 7 1 8 0 9 Answer: 6 6 5 7 8 9 4 Test case 3: 100 272 422 352 367 102 435 274 469 532 554 88 468 28 761 334 381 62 236 858 955 104 930 4 892 467 749 39 695 189 709 217 790 571 999 126 355 138 779 570 645 31 222 372 511 345 888 535 731 435 953 87 869 172 863 442 936 450 704 452 697 862 896 887 977 510 844 135 225 95 932 632 888 30 704 165 523 47 306 107 645 22 34 237 712 779 796 505 964 419 495 171 751 449 616 62 642 355 954 101 266 71 585 284 723 69 900 781 998 21 338 619 950 173 239 394 502 183 605 113 999 30 748 122 833 541 829 65 453 650 741 141 562 355 928 360 852 83 997 563 590 482 668 318 980 84 170 233 858 9 484 637 799 104 611 483 856 29 889 16 463 530 709 774 979 414 654 332 527 406 476 257 735 57 257 201 508 259 806 62 955 410 790 37 720 490 893 573 779 241 400 315 640 242 940 165 929 54 814 356 501 Answer: 13 2 8 95 88 38 66 77 48 14 92 61 79 12 filon Re: Here are second and third test case for people who WA#2 or #3 [1] // Problem 1078. Segments 21 Aug 2014 13:28 the answer to test 3 can also be 13 2 8 95 88 38 66 51 48 14 92 61 7 12 KOTMAKRUS [SPbPU] Re: Here are second and third test case for people who WA#2 or #3 // Problem 1078. Segments 10 Mar 2016 04:27 it can also be 13 45 58 22 84 96 52 86 46 19 62 26 79 12 bits/stdc++.h Re: Here are second and third test case for people who WA#2 or #3 // Problem 1078. Segments 28 Dec 2016 11:40 can also be 13 85 58 22 84 96 52 86 46 19 62 11 35 69 Fedor Putin Re: Here are second and third test case for people who WA#2 or #3 // Problem 1078. Segments 3 Mar 2021 19:39 Edited by author 03.03.2021 19:41 Edited by author 03.03.2021 19:41 Fedor Putin Re: Here are second and third test case for people who WA#2 or #3 // Problem 1078. Segments 3 Mar 2021 19:45 Ryan Shaikh I don't understand the problem // Problem 1008. Image Encoding 3 Mar 2021 17:22 It says we have to start at the lowest left tile. Does that mean that the euclidean distance of the tile from origin should be minimum?? or does it mean that we have to look for left most layer and lowest tile in that?? Dmitriy if u have wa 8 // Problem 1438. Time Limit Exceeded 28 Feb 2021 17:01 try this test: label: a = 1 goto label Lebedev_Nicolay[Ivanovo SPU] Is my idea right? [2] // Problem 1371. Cargo Agency 13 Jan 2009 00:16 I try to solve this problem as "offline LCA problem" with recursive DFS, but I have TLE? Where is mistake? Міша Re: Is my idea right? [1] // Problem 1371. Cargo Agency 7 Sep 2015 22:39 Maybe if you solved LCA problem effective you can get AC, but there is easier way to solve this problem. Abid29 Re: Is my idea right? // Problem 1371. Cargo Agency 27 Feb 2021 15:17 u are late he got ac in 31 Jan 2009 Felix_Mate WA 17 [1] // Problem 1371. Cargo Agency 21 Feb 2016 20:28 P.S. Нашёл баг, из-за которого был WA: если вы в Pascal пишите z:=n*(n-1), где z-int64, n-longint, то результат z будет типом longint; правильно так: z:=n; z:=z*(n-1). И ещё: лучше выводить не 4 знака в ответе, а все. Edited by author 03.08.2016 11:44 Abid29 Re: WA 17 // Problem 1371. Cargo Agency 27 Feb 2021 14:28 thnx a lot Felix_Mate i also face same situation. Toshpulatov (MSU Tashkent) hint // Problem 1861. Graveyard in Deyja 26 Feb 2021 23:41 KMP + DP, O(n ^ 2) Zergatul WA4 test helped me // Problem 2157. Skydiving 25 Feb 2021 21:07 2 87 4547 87 2945 1516 64 913 9864 ----------- 9904.472185221 boocoo One solution // Problem 1091. Tmutarakan Exams 25 Feb 2021 19:02 A solution that doesn't make use of the max number being 10,000 is using inclusion-exclusion principle. Because when we take the sets of K that have a gcd divisible by 2 and the sets of K that have a gcd divisible by 3, you count twice the ones with a gcd divisible by 6, so you have to subtract those. It's similar to a solution to this problem: https://open.kattis.com/problems/coprimeintegers koti4 Java Ans. // Problem 1263. Elections 24 Feb 2021 14:26 import java.util.*; public class j { public static void main(String[] args){ Scanner input = new Scanner(System.in); int bin,sum = 0; int n=input.nextInt(); int m=input.nextInt(); int [] mas = new int [n]; for(int i = 0;i<m;i++){ bin = input.nextInt(); sum += 1; mas[bin-1] = mas[bin-1] + 1; } for(int i = 0;i<n;i++){ System.out.println(String.format("%.2f",mas[i]/(sum*0.01))+"%"); } } } koti4 Why this isn't working? Java. // Problem 1880. Psych Up's Eigenvalues 23 Feb 2021 20:23 import java.util.*; public class Main { public static void main(String[] args) { ArrayList<Integer> mas = new ArrayList<>(); Scanner input = new Scanner(System.in); int n,bin,delta = 0; n = input.nextInt(); for (int i = 0; i <n;i++){ bin = input.nextInt(); mas.add(bin); } n = input.nextInt(); for (int i = 0; i <n;i++){ bin = input.nextInt(); mas.add(bin); } n = input.nextInt(); for (int i = 0; i <n;i++){ bin = input.nextInt(); mas.add(bin); } Collections.sort(mas); delta = mas.size(); for (int i = 0;i<mas.size()-1;i++){ bin = mas.get(i); delta = delta - (mas.lastIndexOf(bin)-mas.indexOf(bin)+1); } delta = -1*delta-mas.size(); System.out.print(delta); } }
|