Common BoardЕсть ли скрипт, позволяющий сравнивать пользователей в виде таблицы по задачам с "+"("АС") - решена, "-"(WA5, TL12 ...) - не решена, " " - не пробовал? Или что-то в этом духе? Простите, за мои плохие знания английского языка. Is there a script that allows you to compare users in the form of a table for tasks with "+" ("as") - solved, "- "(WA5, TL12 ...) - not solved, "" - not tried? Or something like that? Sorry for my poor English skills. Edited by author 04.06.2009 17:47 Edited by author 04.06.2009 17:47 I found my stupid mistake but here are some tests: 2 2 1 1 2 2 2 2 1 2 2 1 2 2 2 1 1 2 2 2 2 2 2 1 2 2 6 6 1 6 1 6 6 1 1 6 6 6 18 1 2 1 3 1 4 1 5 1 6 2 3 2 4 2 5 2 6 3 4 3 5 3 6 4 5 2 1 3 2 4 3 5 4 6 5 6 6 6 1 6 2 5 3 4 4 3 5 2 6 1 1 1 1 1 1 1 1 0 10 1 1 1 1 10 1 5 1 1 2 1 3 1 10 1 5 1 10 6 8 5 2 1 5 2 1 4 5 1 6 10 1 10 2 10 4 10 5 20 5 4 3 2 1 4 6 5 2 3 2 1 9 3 7 4 10 2 2 5 9 2 8 4 9 1 8 1 3 3 5 2 7 5 4 5 9 5 6 1 10 5 20 10 1 1 1 1 3 9 3 7 1 6 3 4 4 9 2 7 3 5 5 4 2 4 3 9 4 3 2 6 1 1 2 3 1 3 3 10 4 7 5 Can you figure out where you are wrong? Would you please print the test's result out? Answer to above test 1) 341 2) 341 3) 283 4) 341 5) 1141 6) 1141 7) 907 8) 1141 9) 141 10)200 11)1041 12)1041 13)1424 14)1266 15)1266 Hope that helps :) Prabhjot Singh 10 6 8 5 2 1 5 2 1 4 5 1 6 10 1 10 2 10 4 For this case, there can be only 2 diagonal crossings ((2,1) & (5, 2)), right? but the answer (1424) says 3. Edited by author 05.12.2012 16:23 Thank you wery much, there are very good tests, I got AC :) tanhk you the test are graet thank you very much for tests!!! Thanks! You are breathtaking) It can help you: Test: 1 13 0 -10 -7 -10 1 -5 6 -10 -8 -8 -7 -10 1 Answer: 6 Edited by author 04.04.2018 15:40 Use printf("%.0lf\n", floor(answer + .5)); for output answer ;) I know where I am wrong. AC: 0.078 681 KB remember to % Edited by author 14.03.2011 13:05 This test is going to kill me. I know that I should do % but it doesn't help anyway. I'm not strong in module algebra is (a + b + c) % 10^9 ?== (((a % 10^9 + b) % 10^9 + c) % 10^9 ? Excuse me, can you tell me where you were wrong? 40 20 40 39 38 37 36 35 34 33 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 ans: 846528820 your ans is correct , but k <= 10... try this test case : 40 10 40 39 38 37 36 35 34 33 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 ans : 847660528 I don’t understand what is the mistake here. Help pls string[] val = Console.ReadLine().Split(' '); double[] k = new double[10000]; for(int i = 0; i < Convert.ToInt32(val[1]); i++) { string s = Console.ReadLine(); k[Convert.ToInt32(s) - 1]++; } double swap = 0; for(int i = 0; i < k.Length-1; i++) { for(int j = i + 1; j < k.Length - i - 1; j++) { if (k[j+1] > k[j]) { swap = k[j+1]; k[j+1] = k[j]; k[j] = swap; } } } for (int i = 0; i < Convert.ToInt32(val[0]); i++) {
Console.WriteLine(string.Format(CultureInfo.InvariantCulture, "{0:N2}", (100 * k[i]) / Convert.ToDouble(val[1]))+"%"); }
In python 3.6 extra print() in the end of the program gives you WA2. Therefore you should output "8 1 3 4 2 0 1 3 2" instead of "8 1 3 4 2 0 1 3 2 " a = int(input()) b = int(input()) print(a+b) вы считываете данные из двух строк. А надо из одной. Т.е. первые две строки надо заменить на одну строку "a, b = map(int, input().split())". 15 17 1 2 2 3 3 4 4 5 5 6 6 14 14 15 15 9 9 7 7 5 7 8 8 13 13 12 11 12 10 11 10 4 1 6 1 12 15 ans: 3 @Aristarch I also get 3 as ans. But , still getting WA in test case 13. #include<bits/stdc++.h> using namespace std; void prin ( int i) { int j; for ( j =1 ; j <= i ;j++) { cout << "sin(" << j; if ( j == i){ for (j = 0 ; j<i ; j ++) cout <<")"; break;} else { if (j%2) cout << "-"; else cout << "+"; } } } int main() { int i,j,n; cin >> n; int k = n; for (i = 1; i < n ;i++) cout << "("; for ( i = 1 ; i <= n ; i++,k--) { prin(i); if (i!= n) cout << "+"<<k<<")"; } cout << "+1\n"; return 0; } I spent two hours finding this stupid mistake. Do not be like me, do everything with a margin. 4 4 2 3 1 2 1 3 2 4 3 4 ans: 6 12 16 2 30 1 2 2 3 3 1 4 5 5 6 6 4 7 8 8 9 9 7 10 11 11 12 12 10 1 4 1 7 4 10 7 10 ans: 24 6 8 2 30 1 2 2 3 3 1 4 5 5 6 6 4 1 4 2 4 ans: 12 I checked two accepted solution But They are giving different output in same test case. AC code 1: https://paste.ubuntu.com/p/RwtFH2s4xK/AC code 2: https://paste.ubuntu.com/p/vmrXrdcJN6/ Tese case : 25 28 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 10 10 11 11 12 12 13 13 14 14 15 15 16 16 17 17 18 18 1 5 19 19 20 20 21 21 22 22 23 23 24 24 25 25 14 15 22 6 22 1 10 21 Output in code 1 : 2 Output in code 2 : 3 Answer should be : 2 5 1 2 1 2 3 1 3 4 1 4 5 1 7 + 1 + 3 + 5 - 3 + 4 - 1 - 5 ans: 0 2 4 4 4 1 0 I can't figure out where my mistake is. Can someone give me some tests? facttacf@gmail.com он поможет. Edited by author 03.07.2020 14:55 If it is impossible to find out the distance from C to D, then write "Impossible." and not "Impossible" Seems an easy problem, but I can't understand it... 4 7 - input data 1 - common can (4+7)-1=10 - amount of cans How can you get "1-common can"? Or the problem says there must be one common can? At some moment it happened so that they shot the same can - last can Still a little puzzled... Anyway I have got AC, thx for your help :) why I am wrong on test2,it seems very easy "The 12th High School Pupils Collegiate Programming Contest of the Sverdlovsk Region (October 15, 2005)" What a mockery ?!?! cin >> h >> l; cout << l-1 << " " << h-1; And that's all ... (0.001 sec and 220Kb memory used :) ) P.S. 137Kb if it's transformed for C Edited by author 06.10.2006 00:10 if 2 3 - imput data 1 common can (2+3)-1=4 - amount of cans readln(n,m); writeln(m-1,' ',n-1); I can explain it easily. 1 1 1 1 "1" 1 1 1 1 1 1 1 the quoted 1 is the can which they will shot it at the same time. hope i helped after 4 years :D Yes it has helped me after 9 more year Edited by author 03.07.2020 00:58 |
|