| ENG RUS | Timus Online Judge |
Common Boardpyh119 Hint:the test is easy // Problem 1297. Palindrome 10 Apr 2009 18:53 even O(n^3) can pass it....... so just enumerate it....... Cat36 Give me some tests, please... [3] // Problem 1429. Biscuits 10 Apr 2009 02:52 WA 7( yuyan Re: Give me some tests, please... [2] // Problem 1429. Biscuits 10 Apr 2009 06:35 Try this: 500 960 6489 8199 5460 -332 4779 -3035 -1516 7417 -7907 -7437 2492 -1228 4982 6223 2784 8815 5027 -8099 9510 3888 -7386 5711 1299 -6197 767 3184 5789 3584 2879 7256 -115 5044 -7617 -955 7224 -4250 8520 5125 4420 9554 7043 1940 3667 9857 -5623 3571 7468 -8575 -4515 127 -593 1658 6047 9949 -3027 8122 2716 906 1758 -3744 2058 8829 -561 1936 2482 7203 6572 8612 2098 886 1373 3838 7195 5707 -6088 -2482 3449 -1903 8810 8857 -9400 -9446 9946 -4703 -6078 6185 9705 2793 7787 4325 4170 3104 -7948 -3888 5369 7705 5651 2962 -9889 9995 3158 5579 -3967 7049 3950 -9772 5427 -8792 -203 5781 4685 -2512 7479 -2564 6125 3107 -2131 3869 2817 -824 -7881 1740 7008 -8657 1168 -3231 -8741 229 4705 -2151 2494 7045 459 8527 -2694 2620 7827 -3949 6317 9721 -9300 -5981 5312 -974 1824 9441 -6673 -4450 8213 4994 8154 7468 435 3724 30 4381 -4812 677 2828 -7160 5448 4167 6150 330 9668 -4842 1764 -9172 3458 7634 2350 2712 4330 8183 7430 7736 2396 1227 4190 -3934 574 2104 914 -799 8955 6255 -7296 9878 -3373 -9124 3597 -3435 -1837 970 1127 -5641 4916 1956 -1488 1517 -9865 2565 2739 -1735 -8547 4591 -4285 729 8440 6452 -2331 3457 -9776 9853 4326 -3118 -8929 8304 9148 -8493 6459 -3153 2706 6124 -9960 6320 7245 -6699 -7004 6101 6045 -3516 7751 -2982 7869 1537 300 16 2027 -5955 -661 9640 8675 -4223 4135 1318 -3293 6986 6669 -3662 9405 -3517 -6563 4082 -3640 6582 5822 9449 468 5104 -6015 -5274 5020 -1850 -4272 2077 2902 -7184 1696 -1662 -6968 4649 7749 -9306 6524 -31 -313 9847 9798 -46 8564 -9260 6815 7699 687 -3016 2646 -1257 8552 477 -8846 9327 8579 3452 1251 7844 3356 -8414 2876 6064 5347 8672 5136 -4925 5557 -150 8928 6002 7031 -6897 5552 -9314 1240 1500 -1918 7056 9134 4574 491 3828 6467 -803 1985 -6708 5772 944 7833 199 2424 -3805 3164 2905 6701 7852 7943 6970 278 9184 5840 -8908 8510 2545 2866 4454 5504 2730 936 4192 2080 2493 4699 286 6335 7734 -5925 2817 -4040 6521 4038 4795 -5709 6595 -8821 -2467 6151 9815 9447 6482 2 2060 1679 -913 -5572 9818 -8067 9032 9588 2165 -3577 7587 6636 5628 4616 -3194 -9864 7821 -5270 1247 8865 -7367 -919 5983 -469 -8143 6928 -8890 2219 6850 -9120 2734 6660 -5455 963 4594 -2249 -484 2598 -9207 -1522 2457 -2315 -7934 7207 1306 1487 9356 1562 -7754 2727 2739 -9553 1613 -8132 4755 1879 -701 476 6324 8512 -8781 3998 9666 6504 4669 -1335 5057 9597 5205 -7000 3113 8809 -7216 6562 -5714 -7846 8207 8385 -406 570 9716 -7805 681 -5721 1538 1868 -4301 4921 5968 -8908 -448 1024 -2497 5377 6147 3839 3907 3081 3633 3788 4260 4176 96 8059 -8168 4161 5939 -6749 1362 3073 -8925 6799 5080 2783 -4265 6411 616 -8795 4949 5745 1160 141 -2394 -4492 78 7530 -870 8880 641 -7442 1944 4590 -7366 8731 -4704 -4776 4601 8241 6513 5353 9133 484 6376 8079 7851 1531 -9913 -219 5817 -2670 -5882 6425 -1236 -48 3132 3821 8746 1246 5402 483 4668 -5179 7792 646 -8283 -7981 448 -9037 -2532 4200 7370 -6306 3065 1629 -5650 8038 -5317 5003 6689 7076 -5103 5750 4953 -1990 8518 9237 7786 8106 3316 5536 2806 -3324 -6464 9356 3120 7043 3002 -4330 -2070 3143 -3600 7291 9507 4166 7042 7879 -3763 4099 472 -3062 -5059 7651 4436 9821 674 5440 -6974 8775 -6529 -5261 2117 -1040 8898 5976 -8957 161 9138 8387 5690 1201 -4167 7476 1942 7197 3205 8845 4391 -8846 9256 2636 313 8123 -7667 -7829 6784 -3142 -3585 4814 7238 4923 115 4885 -7169 5316 4509 -2889 5884 -8296 4682 7619 -5805 9802 9059 2660 -1513 8906 3845 1410 9808 -2118 7586 3540 -6043 4599 1675 -4990 3927 5664 -8672 2655 6841 -1963 -9276 296 -4294 9481 3174 -1112 9622 7584 -5449 -7537 987 -3277 -406 6602 -4049 -7750 9742 3582 -3010 2285 -311 -1192 3242 -5767 4277 5793 -3325 -6331 7951 4797 7084 6228 9068 -7514 4418 3496 3254 4741 -1906 5187 9053 -8717 -8251 1384 5319 4426 505 1479 5310 6414 -50 6765 3433 1727 -2623 7027 6772 -7901 2063 1837 2753 1139 305 -7189 5301 -6956 -1857 994 -6453 -6812 5566 -4604 -2358 9234 -6232 -4565 7353 4786 -7664 3071 1627 -6279 3364 -7129 -5384 5004 1225 -9066 8398 487 9725 4717 -7709 5161 6252 1171 7605 1798 -2231 6873 3109 -8105 1800 4616 29 6696 8953 8181 -6922 7719 -4830 5254 2825 -9232 -4712 909 -82 -3223 1562 7117 -4670 9384 -652 -4515 9598 960 -6681 7664 7712 6667 2416 8731 -9548 6959 -1249 9844 6724 -1396 -3453 4026 7120 3882 5291 1979 -8166 7937 5608 -7667 9417 4857 8635 5441 -2028 -6418 3080 6471 8209 2716 4106 5645 5093 -4882 4857 4626 5229 -416 9018 3732 -5197 4447 8800 8447 1394 -9289 274 6703 1720 -6113 7772 2264 -4921 2982 -3023 -3020 4570 2005 -5238 8229 6864 666 1441 -8413 8036 2178 -799 9711 144 9427 534 3864 1350 70 5965 -1288 9979 644 4608 6640 942 121 6424 793 6632 3658 7342 2608 5435 9923 -6847 3842 5705 -8254 9614 5691 -8560 -8625 1187 -8524 4862 6848 -7262 7587 5752 1403 8660 4191 -4575 -4530 8995 234 2834 4893 -3667 9464 6722 -6041 7721 8910 3410 8212 8571 -2944 6237 439 4011 -2062 2621 3144 -7541 9917 -7102 8626 9557 -1635 870 9886 -7336 2535 4735 -7329 5224 6862 6208 -4890 3924 4139 2785 2580 2144 9027 7375 714 -8420 7929 388 -9566 6861 8123 7888 5489 5305 1831 8644 4048 -6823 4464 3193 -7841 19 7313 2970 2517 3469 -8829 7589 -2502 -3007 7531 -1500 -8163 9878 -2169 4510 2031 -8274 3293 3825 2082 -9722 6666 7529 -8402 3422 -2787 -2501 325 5955 1373 8019 6981 8378 5411 882 -99 1298 8907 5307 587 2913 1136 169 -8481 -1312 1448 -3144 -1711 6151 -1179 66 9452 1995 1423 3890 -1802 701 8545 -7023 5734 4453 -1332 -6561 4492 -8549 861 7744 -1142 -7827 391 2571 -8192 5290 -2442 -8621 4652 3714 -7012 6036 -4800 -6030 2620 -9534 -103 1398 -4571 -4191 913 -4143 9425 531 1700 -4029 231 5290 -6279 6504 -715 -9160 6653 8745 -7505 1172 -9970 -6531 5336 4550 1549 5694 6007 -5821 1470 -3391 5155 2681 547 -4661 4059 -6717 6434 5372 2782 2804 5193 7753 4650 892 -5887 1403 959 -8463 6009 7323 2001 -5617 3951 -7603 3895 2054 9550 -4238 3309 -1393 -3955 4928 4474 3530 6525 9534 7863 5402 -7624 9242 5400 -692 -7571 5205 5093 -4129 8553 -3844 -6728 599 6517 -3176 5726 9573 3316 9118 7705 3813 6908 -3240 4001 9832 5198 4743 97 3320 3046 741 438 2082 6316 -6271 8056 6730 -126 -2388 3090 -2579 1607 1202 -3297 -1081 8010 746 -8075 9945 -7787 6133 9683 5662 6380 7718 -4577 -8552 4902 -8522 1319 2346 8235 504 8853 -7132 -6747 9274 5476 -4583 3936 6961 3629 846 8278 2037 6042 8678 -1655 8174 -9906 -9095 8456 -4044 3867 2119 4479 9748 4025 -9354 9103 804 3497 -94 4249 -9259 -9188 2719 -6310 -5682 3212 -6136 3635 807 1205 -4093 2673 -6564 403 669 -9431 -7343 619 2649 7795 5247 6070 6607 268 -2042 9301 5707 -9251 2261 4615 -398 8280 9205 6814 -2204 6480 306 7469 7472 -4405 -5889 6342 2090 3464 9993 -1182 2536 9885 4147 -5703 5121 -3311 4892 1175 -1034 9287 4412 4598 1218 8363 -235 -8083 289 2303 7721 7651 3287 -5607 8394 -3555 -7033 1147 -7451 -3266 5431 7090 -9864 2749 3082 -29 3020 -6822 6409 946 -560 2203 9905 4205 -2864 3704 2306 -9364 544 -7121 -568 4677 6083 -7844 4075 -6029 309 5907 1308 -318 7655 -1927 -969 4639 1623 -9990 5421 2481 8513 4000 6560 -7691 5201 -8929 -7360 4587 4298 1820 7729 -8675 -3883 1358 -4237 -9456 2624 4994 -300 4773 -5103 9808 9366 6215 -9798 299 -3388 -7075 4264 -9777 6888 1926 -2538 5233 2377 -1628 6991 8026 -5451 5400 2926 9049 3626 9438 664 9068 8542 2548 2509 5831 4020 1764 2659 -6504 3223 4205 -2585 9117 9293 -7628 -3202 1260 -3844 1652 4821 -6497 6365 1574 -4210 4890 2487 5858 2638 2131 -1677 1493 1233 -5363 4125 9913 8609 6097 2088 9094 -8651 4770 6031 -2272 4728 -7121 -4642 1 7873 -7407 7125 729 1767 7200 9541 8369 8747 -9618 -9232 1734 2351 7526 3054 -900 -8127 5406 2854 5058 4094 9754 1034 9811 3611 6898 2616 3957 -4255 8595 -772 2057 7902 -1303 7786 365 7999 -4262 2737 6456 -3274 6253 -9296 -1573 7329 5927 -1850 3927 7760 9267 5229 -6569 2217 894 1442 2726 6092 4581 -2616 4878 2900 -2865 4337 8864 -396 9166 2170 -1621 1352 2931 1852 5296 3993 -2787 9450 858 6027 7055 3384 6335 6641 -8150 9477 4126 -2359 8245 9161 8478 1576 251 9373 2636 3377 3020 5159 5964 -1629 7924 4220 -5399 4835 8196 yuyan Re: Give me some tests, please... [1] // Problem 1429. Biscuits 10 Apr 2009 06:36 The answer is 95847 Cat36 Re: Give me some tests, please... // Problem 1429. Biscuits 10 Apr 2009 18:37 Thank You! one bug is fixed) yuyan wrote 10 April 2009 06:36 Volov_Forever Where is my mistake? [2] // Problem 1243. Divorce of the Seven Dwarfs 21 Mar 2009 15:00 #include <iostream> using namespace std; int main () { string s; long long unsigned int n,g,g7; cin>>n; g=n/7; g7=g*7; cout<<n-g7<<endl; return 0; } Edited by author 21.03.2009 15:00 OpenGL max(long long unsigned int)<10^50 [1] // Problem 1243. Divorce of the Seven Dwarfs 21 Mar 2009 17:10 Edited by author 21.03.2009 17:11 Volov_Forever Re: max(long long unsigned int)<10^50 // Problem 1243. Divorce of the Seven Dwarfs 10 Apr 2009 16:48 Thank you!!!Now I got AC OpenGL Mistake in statement [2] // Problem 1704. Demodulation 10 Apr 2009 13:03 In russian, "кочевники ограбили очередной корован". Right word- "караван". Sandro (USU) Re: Mistake in statement [1] // Problem 1704. Demodulation 10 Apr 2009 13:12 OpenGL :) // Problem 1704. Demodulation 10 Apr 2009 13:49 Feng this one prefer "double" rather than "float" // Problem 1001. Reverse Root 10 Apr 2009 12:06 accept this kind of double: #include <vector> #include <iostream> #include <algorithm> #include <iterator> #include <cmath> using namespace std; void root( double& d ) { d = sqrt(d); } int main() { vector<double> arr; copy( istream_iterator<double>(cin), istream_iterator<double>(), back_inserter(arr) ); for_each( arr.begin(), arr.end(), root ); cout.precision(4); cout << fixed; copy( arr.rbegin(), arr.rend(), ostream_iterator<double>(cout, "\n")); return 0; } Wrong answer of "float" type: #include <vector> #include <iostream> #include <algorithm> #include <iterator> #include <cmath> using namespace std; void root( float& d ) { d = sqrt(d); } int main() { vector<float> arr; copy( istream_iterator<float>(cin), istream_iterator<float>(), back_inserter(arr) ); for_each( arr.begin(), arr.end(), root ); cout.precision(4); cout << fixed; copy( arr.rbegin(), arr.rend(), ostream_iterator<float>(cout, "\n")); return 0; } strange problem ...... lian lian test data [1] // Problem 1402. Cocktails 9 Jan 2008 05:33 if (n==1||n==2) what is the answer the subject? yaho0o0 Re: test data // Problem 1402. Cocktails 10 Apr 2009 02:09 for 1 the answer is 0 for 2 the answer is 2 Lev Panov WA on test 13, Please help [5] // Problem 1402. Cocktails 27 Feb 2009 21:26 This is my solution: #include <stdio.h> long double fact( long double n ) { if (n < 2) return 1; else return n * fact(n - 1); } int main( void ) { long double n, nfac, ans = 0, i; scanf("%Lf", &n); if (n < 2) { printf("0"); return 0; } nfac = fact(n); for (i = 2; i < n; i ++) ans += nfac / fact(n - i); ans += nfac; printf("%.0Lf", ans); return 0; } WTF? Teacher30 Re: WA on test 13, Please help [4] // Problem 1402. Cocktails 28 Feb 2009 05:55 Check your answers to maxtests: 21 => 138879579704209680000 20 => 6613313319248079980 PS: Idea of solution is correct, but you should store answer in suitable type ("long double" is not enough). Lev Panov Re: WA on test 13, Please help [3] // Problem 1402. Cocktails 1 Mar 2009 21:06 Hmm, I actually have correct answers for n = 20 and 21. And "long double" is extremely big type, for example: 100 => 253686955560127297296368144135170000933446331847165085913916476338770833469945019420289324705338829425834316771115322447713278811189027647015804045741541818368 =)) What's wrong then? Teacher30 Re: WA on test 13, Please help [2] // Problem 1402. Cocktails 2 Mar 2009 04:16 "long double" can store numbers about 10^{4000} but only first 19 digits are calculated right. Btw, I think, you use some else compiler, not Intel-C++, am I right? Lev Panov Re: WA on test 13, Please help [1] // Problem 1402. Cocktails 2 Mar 2009 21:42 Yep, you're right: I use GNU GCC. Ok, I will try to use "long long" type. yaho0o0 Re: WA on test 13, Please help // Problem 1402. Cocktails 10 Apr 2009 01:58 you are so stupid max n is 21 not 100 Alexander Kouprin wa#1?? (to judges: statement of the problem should be modifed) [1] // Problem 1074. Very Short Problem 24 Oct 2008 23:14 why 10 0.0 -0.0 1100000000000000000000000000000.0000000000 -0.0 24680976.32135864232426891300 Not a floating point number Not a floating point number is incorrect output for the sample (test#1)? Edited by author 24.10.2008 23:22 Mitrev Misa Re: wa#1?? (to judges: statement of the problem should be modifed) // Problem 1074. Very Short Problem 10 Apr 2009 00:17 'cause you can't write -0.0 I've never seen something like that. Maybe you have? MOPDOBOPOT Crash on test 1 [1] // Problem 1709. Penguin-Avia 9 Apr 2009 18:12 What the test? Sample working correct on my computer. Edited by author 09.04.2009 18:13 Samsonov Alex [USU] Re: Crash on test 1 // Problem 1709. Penguin-Avia 9 Apr 2009 19:21 First test is sample. Check your solution again. yuyan To admin:please add this test. [1] // Problem 1547. Password Search 9 Apr 2009 15:12 The test is 2 27 I found that some AC solution output like that: a-z {-az ba-bz It means that the testdatas do not strong enough. Please add this. By the way,I guess the test 10 may be have some characters that do not in ['a'..'z','-'] Please check it. At last,sorry for my poor English. Thank you. yuyan Re: To admin:please add this test. // Problem 1547. Password Search 9 Apr 2009 15:21 Test 10 is correct.I'm sorry. Vladimir Yakovlev (USU) Problem 1274 Fractional Arithmetic rejudged // Problem 1274. Fractional Arithmetic 9 Apr 2009 12:17 New tests have been added. Accepted solutions have been rejudged. 295 authors have lost AC after rejudge. yangqiang WA6,HELP!!! // Problem 1067. Disk Tree 9 Apr 2009 06:49 Could someone give me some tests?? vav[14] Complexity(+) [2] // Problem 1626. Interfering Segment 9 Feb 2009 19:28 Can this problem be solved better than O(N^3)? [SPbSU ITMO] WiNGeR Re: Complexity(+) // Problem 1626. Interfering Segment 13 Feb 2009 22:36 This problem is supposed to be solved in O(n^3) with small constant factor by author SPb-MaxBuzz Re: Complexity(+) // Problem 1626. Interfering Segment 9 Apr 2009 04:52 Actually, O(N^2 log N) of geometry + O(N^3) of bit operations. This may give you an idea of the solution. ZeleninAA WA Test 2 // Problem 1700. Awakening 8 Apr 2009 18:28 Give me test 2, please Helen_N Input/output 8 Apr 2009 18:20 Hello! How must be organized input from console for a series of numbers, which quantity isn't known? If we worked with file i/o, we could check for symbol, that means end of file. And what is the condition to break input here? OpenGL What does it mean? // Problem 1708. Sum of Digits 2 8 Apr 2009 17:34 It is allowed that the empty string matches several patterns. ??? DarkeN Sample output is nuts // Problem 1121. Branches 8 Apr 2009 15:53 I seriously think that sample output is screwed up. For example, the lowest line reads: -1 1 4 - 1 4 But taking into account the proximity of the branch with ID=4 (bin: 100) and the branch with ID=1 (bin: 001) shouldn't all non-negative numbers in line equal 5( bin: 101), like -1 5 5 -1 5 ? Could someone make it clear for me? I would be very grateful;-) Shelest Pavlo Compilation Error // Problem 1521. War Games 2 8 Apr 2009 15:20 I receive compilation error but in Borland C++ all ok. What is problem? #include<iostream.h> #include<stdlib.h> #include<string.h> void main() { unsigned long N, K, i, position; char * mas[30000]; char * mas1[30000]; char * mas2[30000]; char * mas3[10000]; cin>>N; cin>>K; for( i = 1 ; i <= N; i++) { if(i < 30000) { ultoa(i, mas[i - 1], 10/* size(i)*/); } else if (i < 60000) { ultoa(i, mas1[i - 30001] , 10/* size(i)*/); } else if (i < 90000) { ultoa(i, mas2[i - 60001] , 10/*size(i)*/); } else if (i < 100000) { ultoa(i, mas3[i - 90001] , 10/*size(i)*/); } } i = 0; position = 0; int step = 0; while( i < N) { while(step < K) { if(position >= N) position = position - N; if(position < 30000) { if(strcmp(mas[position], "0") != 0) step ++; } else if(position < 60000) { if(strcmp(mas[position - 30000], "0") != 0) step ++; } else if(position < 90000) { if(strcmp(mas[position - 60000], "0") != 0) step ++; } else if(position < 100000) { if(strcmp(mas[position - 90000], "0") != 0) step ++; } position++; } step = 0; position --; if(position < 30000) { cout<<mas[position]; mas[position] = "0"; } else if(position < 60000) { cout<<mas1[position]; mas1[position] = "0"; } else if(position < 90000) { cout<<mas2[position]; mas2[position] = "0"; } else if(position < 100000) { cout<<mas3[position]; mas3[position] = "0"; } cout<<" "; i++; position ++; } } yaho0o0 Here my solution [2] // Problem 1457. Heating Main 19 Mar 2009 13:46 #include <iostream> #include <stdio.h> using namespace std; int main() { int i,n,a; double o=0; cin>>n; for(i=1;i<=n;i++) { cin>>a; o+=a; } o/=n; fprintf(stdout,"%.6lf ",o); cout<<endl; return 0; } Edited by author 07.04.2009 21:17 yaho0o0 No subject [1] // Problem 1457. Heating Main 21 Mar 2009 02:09 Edited by author 08.04.2009 12:58 yaho0o0 No subject // Problem 1457. Heating Main 8 Apr 2009 12:57 I&K English version bug in viewing source 8 Apr 2009 12:20 In English version of the site, the page offering to enter JUDGE_ID and password when viewing source has a button with Russian caption - "Продолжить"
|