Common Board @ Timus Online Judge

Show all threads Hide all threads Show all messages Hide all messages
WA24	TheDreamCatcher	1354. Palindrome. Again Palindrome	30 Nov 2010 18:53	1
WA24 TheDreamCatcher 30 Nov 2010 18:53 I used in my program char a[10000]; cin>>a; after I used char a[10001]; cin>>a; and got AC
WA #2	Pavel Kovalenko	1303. Minimal Coverage	30 Nov 2010 16:54	2
WA #2 Pavel Kovalenko 30 Nov 2010 16:37 I really do not understand where the error occurred. For most useful i shift all coordinates on 1 to right. Here is my code: http://pastebin.com/LpZfCwYg Re: WA #2 Pavel Kovalenko 30 Nov 2010 16:54 I find my error. I misunderstood statement. I thought that I cover the cell matrix 1xM.
WA #3 Again!	Nurbek_[KTMU MANAS]	1603. Erudite	30 Nov 2010 07:51	4
WA #3 Again! Nurbek_[KTMU MANAS] 6 Mar 2008 16:19 Please explain me where is tricky? If you don't want say tricky, give some tests. I use backtracking. Edited by author 06.03.2008 16:22 Edited by author 06.03.2008 16:23 Re: WA #3 Again! Alexander (201 - P TNU) 7 Mar 2008 10:21 test 3 contains "\n" strings Re: WA #3 Again! Nurbek_[KTMU MANAS] 7 Mar 2008 13:47 How? I can't understand. Please explain better. Re: WA #3 Again! TheDreamCatcher 30 Nov 2010 07:51 Alexander (201 - P TNU) wrote 7 March 2008 10:21 test 3 contains "\n" strings This is impossible. In the next N strings follow N words with length between 1 and 16
Please look here... wa3	Crash_access_violation	1603. Erudite	30 Nov 2010 07:49	8
Please look here... wa3 Crash_access_violation 9 Mar 2008 20:47 thanks... I got AC! Edited by author 12.03.2008 04:00 Re: Please look here... wa3 Alexander (201 - P TNU) 9 Mar 2008 20:58 try test with '\n' string: abra adac babr arca 3 abracadabra ababaab ababaaba Such test is incorrect (-) Vladimir Yakovlev (USU) 11 Mar 2008 13:23 Re: Such test is incorrect (-) Nurbek_[KTMU MANAS] 12 Mar 2008 13:37 And how test is right? What a test #3? I know how to solve this task, but test #3... Re: Such test is incorrect (-) Alexander (201 - P TNU) 12 Mar 2008 17:49 When I used gets() I had wa3 and this test help me to change gets() to scanf(...)) and after that I got ac Re: Such test is incorrect (-) Nguyen Dinh Tu (DHSP) 19 Apr 2008 00:24 Test#3 has two words are exactly the same Re: Please look here... wa3 TheDreamCatcher 30 Nov 2010 07:48 Edited by author 30.11.2010 07:48 Edited by author 30.11.2010 07:48 Re: Please look here... wa3 TheDreamCatcher 30 Nov 2010 07:49 Alexander (201 - P TNU) wrote 9 March 2008 20:58 try test with '\n' string: abra adac babr arca 3 abracadabra ababaab ababaaba This is impossible. In the next N strings follow N words with length between 1 and 16
TO ADMINS	hoan	1244. Gentlemen	29 Nov 2010 23:28	1
TO ADMINS hoan 29 Nov 2010 23:28 the judje calcute the memory wrong. my Ac code have this line: char dp[100+5][100000+5]; as a global array in C++. it has about 10000Kb, but the judge calcute memory about 5000Kb. sorry for my poor english. Edited by author 29.11.2010 23:28
Time Limit Test for You	vetas	1254. Die Hard	29 Nov 2010 21:44	6
Time Limit Test for You vetas 29 May 2008 15:52 75 75 1000 1.23 .########################################################################## ..........................................................................# #########################################################################.# ..........................................................................# .########################################################################## ..........................................................................# #########################################################################.# ..........................................................................# .########################################################################## ..........................................................................# #########################################################################.# ..........................................................................# .########################################################################## ..........................................................................# #########################################################################.# ..........................................................................# .########################################################################## ..........................................................................# #########################################################################.# ..........................................................................# .########################################################################## ..........................................................................# #########################################################################.# ..........................................................................# .########################################################################## ..........................................................................# #########################################################################.# ..........................................................................# .########################################################################## ..........................................................................# #########################################################################.# ..........................................................................# .########################################################################## ..........................................................................# #########################################################################.# ..........................................................................# .########################################################################## ..........................................................................# #########################################################################.# ..........................................................................# .########################################################################## ..........................................................................# #########################################################################.# ..........................................................................# .########################################################################## ..........................................................................# #########################################################################.# ..........................................................................# .########################################################################## ..........................................................................# #########################################################################.# ..........................................................................# .########################################################################## ..........................................................................# #########################################################################.# ..........................................................................# .########################################################################## ..........................................................................# #########################################################################.# ..........................................................................# .########################################################################## ..........................................................................# #########################################################################.# ..........................................................................# .########################################################################## ..........................................................................# #########################################################################.# ..........................................................................# .########################################################################## ..........................................................................# #########################################################################.# ..........................................................................# .########################################################################## ..........................................................................# #########################################################################.. 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 1 1 75 75 Re: Time Limit Test for You [LG]_#\#@P$T[101]R 13 Jul 2008 16:06 ans is 2219446.46 ? Re: Time Limit Test for You vetas 11 Nov 2008 21:02 Yes Re: Time Limit Test for You Leonid (SLenik) Andrievskiy 24 Jan 2010 14:38 My program works for about 58 seconds on this test (I'm using Deikstra over Heap) Re: Time Limit Test for You hoan 29 Nov 2010 21:44 tank you very much !!! Re: Time Limit Test for You hoan 29 Nov 2010 21:44 thank you very much !!!
please help, what's wrong on this?	Shokhrukh	1020. Rope	29 Nov 2010 19:33	1
please help, what's wrong on this? Shokhrukh 29 Nov 2010 19:33 #include <iostream> #include <math.h> #include <iomanip> using namespace std; void main() { double x[99],y[99],r,n,dlina[99]; cin >> n >> r; double P=23.14r; for (int i=0; i<=n-1; i++) { cin >> x[i] >> y[i]; } for (int j=0; j<=n-1; j++) { if (j!=(n-1)) { dlina[j]=sqrt((x[j]-x[j+1])(x[j]-x[j+1])+(y[j]-y[j+1])(y[j]-y[j+1])); P+=dlina[j]; } else { dlina[j]=sqrt((x[j]-x[0])(x[j]-x[0])+(y[j]-y[0])(y[j]-y[0])); P+=dlina[j]; } } cout << setprecision(2) << setiosflags (ios::showpoint \| ios::fixed) << P; }
Why WA	newex	1086. Cryptography	29 Nov 2010 10:15	1
Why WA newex 29 Nov 2010 10:15 #include<stdio.h> int main() { int v[15000]; v[0]=2; int j,i=3,l=0; int f; while(l<15000) { f=1; for(j=0;j<=l;j++) if(i%v[j]==0) { f=0; break; } if(f) { l+=1; v[l]=i; } i+=1; } int n,tmp; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&tmp); printf("%d\n",v[tmp-1]); } return 0; }
I shared my account	Baurzhan		29 Nov 2010 09:26	1
I shared my account Baurzhan 29 Nov 2010 09:26 Edited by author 18.02.2016 20:45 Edited by author 18.02.2016 20:45
А very strange thing	bsu.mmf.team	1322. Spy	28 Nov 2010 23:24	1
А very strange thing bsu.mmf.team 28 Nov 2010 23:24 When my part of code was: int k = 0; char S[100001], c; while (cin.get(c)) S[k++] = c; I got WA #1 several times, but my program worked correctly for all tests! Then I replaced this part of code to: string S; cin >> S; and got AC in 0.031s. It's very strange because I think my old program was right too. And I didn't expect that class string works so fast even if length = 100000 :) Maybe there are weak tests? Or an error in check system?
No subject	Roman Furko	1209. 1, 10, 100, 1000...	28 Nov 2010 23:24	1
No subject Roman Furko 28 Nov 2010 23:24 I can solve it in O(1)!!! you must solve equation n - we have x - we must find if (x * (x + 1) / 2)+ 1 == n cout << 1 else cout << 0; but if you want you can find x in o(log n) - by binary search or in o(1) if you solve equation!! Good luck in solving this problem=) Sorry for me bad english=( Edited by author 28.11.2010 23:28
One hint against WA	Oleg Strekalovsky [Vologda SPU]	1274. Fractional Arithmetic	28 Nov 2010 22:12	9
One hint against WA Oleg Strekalovsky [Vologda SPU] 4 May 2009 00:56 After my wrong AC tests were added (Thanks to Fyodor Menshikov). Many authors lost AC.The problem was with division to negative divisors. (Example) 1/2 / -1/3 Good luck! Re: One hint against WA Lebedev_Nicolay[Ivanovo SPU] 4 May 2009 23:50 I have WA #30, but on your test and on same tests my solution give right answers. Can be there others tricks? Another hint against WA Vedernikoff Sergey (HSE: АОП) 5 May 2009 04:29 Try these tests: INPUT: 30000 29999/30000 * 30000 29999/30000 OUTPUT: 900059998 899940001/900000000 INPUT: 30000 29997/30000 / 1/29999 OUTPUT: 899999996 1/10000 Edited by author 05.05.2009 04:36 Re: Another hint against WA Lebedev_Nicolay[Ivanovo SPU] 6 May 2009 00:02 Thanks! You helped me a lot. Your tests are incorrect: answers do not fit limitations Vladimir Yakovlev (USU) 13 May 2009 01:35 Re: Your tests are incorrect: answers do not fit limitations Vedernikoff Sergey (HSE: АОП) 13 May 2009 04:57 Yes, I see. But I achieved the target - helped to the guys to find their bugs and get AC =) Re: Your tests are incorrect: answers do not fit limitations bsu.mmf.team 6 Mar 2010 00:28 My program passed these tests, but it still has WA#29. (Before rejudge it has AC status). Does anybody have other hints or tests? Re: Your tests are incorrect: answers do not fit limitations bsu.mmf.team 6 Mar 2010 00:42 OUCH! But on test 30000 29999/30000 * -30000 29999/30000 my prog outputs -20745377/900000000 instead of -900059998 899940001/900000000 hmm... thank you for good tests, Vedernikoff Sergey :) Now it's OK, just stupid mistake with labs function I saw with a help of this test. I don't know why it works wrong with long long numbers. I'll not use it anymore! Edited by author 06.03.2010 01:05 Edited by author 06.03.2010 01:06 Re: One hint against WA hoan 28 Nov 2010 22:12 thanks, first i WA#26 but when i see your test got AC, thanks, i dont forgot your help in all my life ;) sorry for my poor english.
I WA on 1st test!!!WHY?!	zhuaiyaa	1077. Travelling Tours	28 Nov 2010 18:02	1
I WA on 1st test!!!WHY?! zhuaiyaa 28 Nov 2010 18:02 My answer for the sample is 3 3 1 4 2 3 2 3 4 4 1 3 4 2 or 3 3 1 4 2 4 1 3 4 2 3 2 3 4 Can anyone give me the 1st test?
why WA#1?	ile	1077. Travelling Tours	28 Nov 2010 17:00	3
why WA#1? ile 15 Jun 2010 03:03 I have no idea what's wrong... I am using DFS (something like euler-cycle detection); checking for self-loop edges; output format is right, tho it returns little bit different for sample test: 3 3 1 2 4 4 1 2 4 3 3 2 4 3 Please, any ideas about wa#1? oh, i forgot to add that i am doing dfs for every connected component separately! Edited by author 15.06.2010 03:05 Re: why WA#1? ile 17 Jun 2010 00:35 anyone please? Re: why WA#1? zhuaiyaa 28 Nov 2010 17:00 I did that too,my answer is completely the same as yours,and I WA on the 1st test too
give me the ideas of solution please	Ilya Filippov (Petrozavodsk SU)	1486. Equal Squares	28 Nov 2010 08:30	2
give me the ideas of solution please Ilya Filippov (Petrozavodsk SU) 12 Jul 2009 05:09 Re: give me the ideas of solution please only_nicety 28 Nov 2010 08:30 if you are a chinese , you can read the article —— Hash在信息学竞赛中的一类应用
No subject	Nathalie	1800. Murphy's Law	28 Nov 2010 01:29	1
No subject Nathalie 28 Nov 2010 01:29 Edited by author 28.08.2011 02:03
Can anyone tell me how to solve this problem?	Marko Tintor (marko@pkj.co.yu)	1173. Lazy Snail	27 Nov 2010 23:58	2
Can anyone tell me how to solve this problem? Marko Tintor (marko@pkj.co.yu) 21 Jul 2002 02:19 Re: Can anyone tell me how to solve this problem? hoan 27 Nov 2010 23:58 only sort.
why I got WA?	qwt	1173. Lazy Snail	27 Nov 2010 23:57	3
why I got WA? qwt 13 May 2002 19:58 var a:array[0..1000,1..3] of real; x,y,x0,y0:real; n,i,j,k:integer; begin readln(x0,y0); readln(n); fillchar(a,sizeof(A),0); for i:=1 to n do begin readln(x,y,a[i,3]); x:=x-x0;y:=y-y0; a[i,1]:=x;a[i,2]:=y; end; for i:=1 to n-1 do for j:=i+1 to n do if a[i,1]a[j,2]-a[i,2]a[j,1] >0 then begin a[0]:=a[i];a[i]:=a[j];a[j]:=a[0]; end; writeln(0); for i:=1 to n do begin writeln(a[i,3]:0:0); end; writeln(0); end. help me please qwt 14 May 2002 16:34 Re: why I got WA? hoan 27 Nov 2010 23:57 Edited by author 27.11.2010 23:57 Edited by author 27.11.2010 23:58
It doesn'e need convexhull. Sorting is enough!	shrek	1173. Lazy Snail	27 Nov 2010 23:56	4
It doesn'e need convexhull. Sorting is enough! shrek 19 Nov 2006 20:22 Re: It doesn'e need convexhull. Sorting is enough! Denis Koshman 17 Aug 2008 19:12 Yeah... Came back to this problem when realized that myself :) Re: It doesn'e need convexhull. Sorting is enough! SkorKNURE 8 Oct 2008 06:21 I had solved problem by building O(N) convex hulls and then unifying them up from the deepest. How to solve it with only sort? Give me some hints please Re: It doesn'e need convexhull. Sorting is enough! hoan 27 Nov 2010 23:56 how to use convexhull in O(n), when the input have arbitary order, "skorKNURE" or any person plz help and explain this algo to me? sorry for my poor englis. GOOD LUCK!!!
if you have MLE	Ibragim Ismailov (TNU)	1198. Jobbery	27 Nov 2010 23:20	2
if you have MLE Ibragim Ismailov (TNU) 22 Nov 2010 21:45 if you have MLE just change all int's to short's :) Re: if you have MLE hoan 27 Nov 2010 23:20 i use short and got AC in 0.453s && 15788kb and when i change adjacent list to "adjacent matrix" i Ac in 0.359s and 8044kb. sorry for my poor english.

Style: flat | tree | nested
Thread Order: bubble | fixed