| Показать все ветки Спрятать все ветки Показать все сообщения Спрятать все сообщения |
| Weak tests | SendThemToHell | 2142. Магия | 21 авг 2020 00:48 | 1 |
My AC code gives "No" on the following testcase due to the overflow 1000000000 1000000000 1000000000 0 0 0 |
| WA2 | AleshinAndrei | 1588. Ямайка | 19 авг 2020 23:26 | 1 |
WA2 AleshinAndrei 19 авг 2020 23:26 How do you think what's the input-data in test-2? I did tested my program around 10 times :) but i didn't find mistake(( UPD: N = 1 ))) you mustn't test borders-cases in input data. You must check your algorithm. In this case i have "out of range" (because v_arr has length = 0, but in this program i don't check it and i address to zero index). If check border-case this algorithm is working My program: @@ #include <iostream> #include <cmath> struct Point { int64_t x; int64_t y; }; struct Vector { double r; double angle; }; int cmp(const void *a, const void *b){ Vector* v1 = (Vector*)a; Vector* v2 = (Vector*)b; double ans1 = ((v1->angle) - (v2->angle)); if (ans1 < 0){ return -1; } else if (ans1 > 0){ return 1; } double ans2 = ((v1->r) - (v2->r)); if (ans2 < 0){ return -1; } else if (ans2 > 0){ return 1; } return 0; } int main() { int N; std::cin >> N; Point p_arr[N]; Vector v_arr[N-1]; double dist = 0; int64_t dx, dy; for (int i = 0; i < N; ++i){ std::cin >> p_arr[i].x >> p_arr[i].y; } for (int i = 0; i < N; ++i){ for (int j = 0; j < i; ++j){ dx = p_arr[j].x - p_arr[i].x; dy = p_arr[j].y - p_arr[i].y; v_arr[j].r = sqrt(dx*dx + dy*dy); v_arr[j].angle = atan2(dy, dx); } for (int j = i+1; j < N; ++j){ dx = p_arr[j].x - p_arr[i].x; dy = p_arr[j].y - p_arr[i].y; v_arr[j-1].r = sqrt(dx*dx + dy*dy); v_arr[j-1].angle = atan2(dy, dx); } qsort(v_arr, N-1, sizeof(Vector), cmp); for (int j = N-2; j > 0; --j){ v_arr[j].angle -= v_arr[j-1].angle; } dist += v_arr[0].r; for (int j = 1; j < N-1; ++j){ if (v_arr[j].angle != 0){ dist += v_arr[j].r; } } } printf("%.0f", (dist / 2)); } @@ Edited by author 20.08.2020 00:55 |
| what's output for N=5,K=10?? | haxxpop | 1009. K-ичные числа | 19 авг 2020 13:21 | 5 |
and also N=6,K=10 N=7,K=10 N=6,K=2 N=5,K=10 the answer is 87480 N=6,K=10 the answer is 866781 N=7,K=10 the answer is 8588349 N=6,K=2 the answer is 13 my program has been accepted I have solved this problem,but I got WA on test #2.When n=6,k=10 I get answer 866781 and others tests I get right answer.What is the test #2??????????????? N=5,K=10 the answer is 87480 350975 350974 350973 350971 350970 350967 350966 350965 350959 350958 350957 350955 350954 350943 350942 350941 350939 350938 for n = 6 , k = 2 this values are true more than 13 You are not right because k = 2 => all numerals < 2. Ok? And now I show you this 13 numbers: 111111 111110 111101 111011 110111 101111 111010 110110 110101 101110 101101 101011 101010 sorry for my English Edited by author 19.08.2020 13:21 Edited by author 19.08.2020 13:21 |
| More test cases? | Erin | 1017. Лестницы | 18 авг 2020 20:02 | 1 |
For some reason, my code gets the right answer for all small inputs (<12) but is 1 greater than both the large test cases I've found. It gets that s(212) = 995645336, as compared to 995645335, and s(500) = 732986521245024, as compared to 732986521245023 given before. Anyone have any test cases with an input between 11 and 212 to help me pinpoint this problem? Edited by author 18.08.2020 20:03 |
| What is output for 7? WA#7 | Nodir NAZAROV [TUIT-Karshi] | 2037. Богатство двоичных слов | 18 авг 2020 11:32 | 2 |
I don't know any string of length 7 contains less than 7 distinct palindrome substrings. Anyone can put the answer for 7, pls? It may be too later. for n = 7 1 : NO 2 : NO 3 : NO 4 : NO 5 : NO 6 : NO 7 : aaaaaaa for n = 15 1 : NO 2 : NO 3 : NO 4 : NO 5 : NO 6 : NO 7 : NO 8 : aababbaababbaab 9 : aaababbaaababba 10 : aaaababbaaaabab 11 : aaaaababbaaaaab 12 : aaaaaaababbaaaa 13 : aaaaaaaababbaaa 14 : aaaaaaaaababbaa 15 : aaaaaaaaaababba |
| Please check my answers on this tests..., are they right??? | Igor9669 | 1643. Атака Тёмной крепости | 17 авг 2020 20:01 | 12 |
1) in: 3 5 ..*.. !.... ....$ out: 3 2) in: 5 8 ....AA.# .######! ...BA*## .####### ..B$...B out: 3 3) in: 5 8 ....AA.# .######! ....#*## .####### ..B$...B out: Impossible 4) in: 1 3 $*! out: Impossible 5) in: 1 3 *!$ out: 2 I have used BFS, but still WA 22 :-( Edited by author 26.10.2008 13:57 Edited by author 26.10.2008 14:04 Edited by author 26.10.2008 14:17 Now Accepted :-) All my tests are correct!!! Edited by author 26.10.2008 16:17 the army can stay in one point ? so in this input 1 3 *!$ the corresponding output is 2 ? test 22 sich_off <ONPU> 26 янв 2009 16:22 Can you lell what was wrong with your program? I`m having WA 22... Please give me some test i also used BFS, but have WA10. Your tests are passed on my computer. Could you give more tests? test 21 Vit Demidenko 2 мар 2010 19:43 5 7 ..!.... ....... .####.* ....... ..$.... Answer: 4 This test help me with wa21 This one helped me to deal with WA10. 1 3 !*$ Answer: Impossible Interesting problem. But only after few WA I understood problem statement correctly :) Re: test 22 Anton Chaplygin [Kungur][USU] 14 авг 2011 12:49 There is something wrong with limitations is the statement. I set maxN = 300 and got AC. WA 11 MOPDOBOPOT (USU) 5 авг 2012 02:22 This test helped me to pass WA11: 3 5 .AAA! .A*A. $AAA. output: 2 Another interesting test: 1 12 #AB$#A!B#B*# output: 2 Edited by author 05.08.2012 02:31 Thanks! Thanks to your first test, I found out that I misunderstood the condition. |
| Hint if WA10 | Nikita Efanov | 1643. Атака Тёмной крепости | 17 авг 2020 19:59 | 4 |
Try this test: 3 3 ##$ #*# !## Answer: Impossible thank you! I am trying deal with this problem |
| Wrong Answer in task 2 | MrRobot | 1014. Произведение цифр | 17 авг 2020 19:53 | 1 |
#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int Num = 0, ans = -2; cin >> Num; vector <int> fact; int n = 2; while (Num > 1) { if (n > 9) { ans = -1; break; } while (Num % n == 0) { Num /= n; fact.push_back(n); } n++; } sort(fact.begin(), fact.end()); if (n < 10 & ans != -1) { ans = 0; for (int i = 0; i < fact.size(); i++) { //ans += fact.at(i) * (i*10); cout << fact[i]; } } //cout << ans; } |
| Some tests for you to check | Andrew Sukhan | 1014. Произведение цифр | 17 авг 2020 14:41 | 8 |
Hey! I solved this problem and here are some test that you may check for you solution: 0->10 1->1 2->2 3->3 4->4 5->5 6->6 7->7 8->8 9->9 10->25 11->-1 12->26 13->-1 14->27 15->35 16->28 17->-1 18->29 19->-1 20->45 21->37 22->-1 23->-1 24->38 25->55 26->-1 27->39 28->47 29->-1 30->56 31->-1 32->48 33->-1 34->-1 35->57 36->49 37->-1 38->-1 39->-1 40->58 41->-1 42->67 43->-1 44->-1 45->59 46->-1 47->-1 48->68 49->77 50->255 51->-1 52->-1 53->-1 54->69 55->-1 56->78 57->-1 58->-1 59->-1 60->256 61->-1 62->-1 63->79 64->88 65->-1 66->-1 67->-1 68->-1 69->-1 70->257 71->-1 72->89 73->-1 74->-1 75->355 76->-1 77->-1 78->-1 79->-1 80->258 81->99 82->-1 83->-1 84->267 85->-1 86->-1 87->-1 88->-1 89->-1 90->259 91->-1 92->-1 93->-1 94->-1 95->-1 96->268 97->-1 98->277 99->-1 100->455 Good Luck! I have checked for my solution. All done. But I have "Wrong answer" at test 8..... try this test: 732421875 result must be: 3555555555555 and this: 0 (result: 10) 1 (result: 1) Edited by author 15.06.2011 14:32 Shouldn't the test value for 1 be 11 and so on for single digit numbers? |
| Salam | Bekmuhamet | 1014. Произведение цифр | 17 авг 2020 14:14 | 1 |
Salam Bekmuhamet 17 авг 2020 14:14 Edited by author 17.08.2020 15:23 Edited by author 17.08.2020 15:23 Edited by author 17.08.2020 15:23 |
| WA13: Hint | KostyaRychkov`~ | 1471. Расстояние в дереве | 16 авг 2020 20:33 | 1 |
Max distance may be equal 5e4 * 1e3 = 5e7. I use INF = 1e6 and spent all day to find this bug. |
| Primitive enumeration of all options c++ | Mikhail | 2066. Простое выражение | 15 авг 2020 13:17 | 1 |
//We need to sort out 3 in the second power of the options for the arrangement of signs #include <iostream> using namespace std; int main() { int a, b, c, min; cin >> a >> b >> c; min = a + b + c; if(a + b - c < min) min = a + b - c; if(a - b + c < min) min = a - b + c; if(a - b - c < min) min = a - b - c; if(a - b + c < min) min = a - b + c; if(a - b * c < min) min = a - b * c; if(a * b * c < min) min = a * b * c; if(a * b + c < min) min = a * b + c; if(a * b - c < min) min = a * b - c; cout << min; return 0; } |
| Question | __Andrewy__ | 2146. Викторина | 14 авг 2020 21:47 | 2 |
Is it right that p is divisor of n? If not, Can you write example? for each step d len of period equals to gcd(d, n) Edited by author 14.08.2020 21:59 |
| Rename | bsu.mmf.team | 2118. Шифровка 4 | 13 авг 2020 12:24 | 1 |
Rename bsu.mmf.team 13 авг 2020 12:24 I think, this should be renamed to "Cipher Message 4" Edited by author 13.08.2020 12:24 Edited by author 13.08.2020 12:24 |
| How do you think, why it`s not work? UPD: CLOSED!!! | AleshinAndrei | 1207. Медиана на плоскости | 12 авг 2020 22:59 | 1 |
UPD: i have find mistake Edited by author 13.08.2020 00:16 |
| I have WA6. Please anybody HelpME! | 107th | 1655. Сомалийские пираты | 10 авг 2020 14:40 | 4 |
Maybe it's because of accuracy? (in case you are still alive) was it because of accuracy ? I was using doubles and got WA8 due to precision error, but then I changed all of the doubles to pair<long long, long long> (trying to represent them as rational fractions without any loss of accuracy) and got AC. Edited by author 10.08.2020 14:42 Edited by author 10.08.2020 15:53 |
| For python users having RE1 | elsa.mathlover~ | 1011. Кондукторы | 10 авг 2020 13:48 | 1 |
Input in the task looks like: 13 14.1 Not like: 13 14.1 So change input in your program to p,q=map(float, input().split()) |
| O(p^2) works | Dmitry Vaskin`~ | 1375. Нонконформизм | 10 авг 2020 11:52 | 1 |
0.046 - O(p) solution. 0.468 - O(p^2) solution, please add more tests. UPD: understood, that there is cant be NO SOLUTION. But you can enlarge p. Edited by author 10.08.2020 12:39 |
| what is in test №37? | Rodion | 1880. Собственные числа Psych Up | 8 авг 2020 18:57 | 1 |
this is my code a=int(input()) b = [int(a) for a in input().split()] c=int(input()) d = [int(c) for c in input().split()] e=int(input()) f=[int(e) for e in input().split()] spisok=b+d+f spisok.sort() kolich=0 for i in range(0, len(spisok)-1): if spisok[i-1]==spisok[i] and spisok[i]==spisok[i+1]: kolich+=1 print(kolich) i dont know why but it writes wrong answer on test №37 please could you text me what is on this test |
| Wa10 | Михаил | 1427. SMS | 7 авг 2020 19:03 | 1 |
Wa10 Михаил 7 авг 2020 19:03 |