## Search found 100 matches

Thu Jul 18, 2002 10:31 am
Forum: Other words
Topic: more on user statistics
Replies: 24
Views: 9504

### Hmmm

Caesum: That's the problem with using code you don't thoroughly understand... As far as I can see, based on the output you supply, the program issues a receive request, and waits forever. Recv() is really a call to 'recv' in WINSOCK.DLL, and it should time out after some seconds if the server can't ...
Wed Jul 17, 2002 6:04 pm
Forum: Other words
Topic: more on user statistics
Replies: 24
Views: 9504

### more on user statistics

Inspired by an earier thread on this site by Caesum, I thought about how nice it would be to have more detailed user statistics. I've been enjoying solving contest problems for more than 2 months now, and the thing that I miss most, is the possibility to directly link to problems I haven't solved ye...
Mon Jul 15, 2002 5:50 pm
Forum: Volume 103 (10300-10399)
Topic: 10323 - Factorial! You Must be Kidding!!!
Replies: 106
Views: 32343
f(-1) is just undefined, period. It's not infinity, gogolplex, or anything; just undefined, period. That's because the factorial function f(n) is only defined for n={0,1,2,3,...}. The reasoning that f(-1) should be infinity, because C(4,5) should be 0 is faulty, because C(4,5) is undefined, not zero...
Sat Jul 13, 2002 1:31 pm
Forum: Volume 3 (300-399)
Topic: 333 - Recognizing Good ISBNs
Replies: 166
Views: 21610
He he, 168 is our old friend the Minotaur, isn't it? Re 333, I've been able to deduct, with reasonable certainty that: 1. The input contains empty line(s); 2. There are no lines with just space-chars; 3. There are no cases where space-chars are the only illegal chars in an otherwise legal ISBN (lega...
Sat Jul 13, 2002 12:38 pm
Forum: Volume 3 (300-399)
Topic: 333 - Recognizing Good ISBNs
Replies: 166
Views: 21610
I couldn't agree more.
I saw Picard was on the hunt too, so I guess we'll get some answers soon
Sat Jul 13, 2002 11:12 am
Forum: Volume 3 (300-399)
Topic: 333 - Recognizing Good ISBNs
Replies: 166
Views: 21610
Hmm. Did you already dig deeper into the possible change? First inspection shows no change in the problem description. No warning sign with additional notes either, so I guess we're in the dark. In a file I keep for making statistics, I found that some weeks ago there were some 600 people with AC on...
Sat Jul 13, 2002 9:11 am
Forum: Volume 3 (300-399)
Topic: 333 - Recognizing Good ISBNs
Replies: 166
Views: 21610

### 333 rejudgement??

So I woke up this morning, and found the Judge gave me one less problem solved than my own administration accounted for. Checked, rechecked and double checked my mail, but no rejudgement notice. Then compared all the problemnumbers in the Judge's solved-list against my own and discovered 333 was mis...
Fri Jul 12, 2002 3:13 pm
Forum: Volume 101 (10100-10199)
Topic: 10103 - Karpovich blocks
Replies: 21
Views: 8349

### 10103 - Karpovich blocks

I'm having a real hard time understanding what the problem description means exactly, and what we are required to answer
So please, people who solved it (5), help me out.

[quote]From the unit blocks of three kinds one creates a cube N
Fri Jul 12, 2002 10:07 am
Forum: Volume 1 (100-199)
Topic: 167 - The Sultan's Successors
Replies: 21
Views: 3572
Well, I think it is for you to decide how you implement the problem.
Basically, anything is alowed as long as it gives the correct answer in the correct format within 30 seconds
Thu Jul 11, 2002 12:46 pm
Forum: Volume 1 (100-199)
Topic: 167 - The Sultan's Successors
Replies: 21
Views: 3572

### close, but no sigar

You're allmost there
Some of the fundamental solutions will have symmetry, so they will remain unchanged after rotation or reflection. The actual number is...

[SPOILER] XCII [/SPOILER]

Happy hunting,
-xenon
Thu Jul 11, 2002 11:49 am
Forum: Volume 2 (200-299)
Topic: 208 - Firetruck
Replies: 48
Views: 15158
No problem
I had a long standing TLE on this problem too. Adrian's hints made me look at the code again, and make some adjustments.
Now I have WA in 0.000 seconds! So obviously the code is bad in some cases, although it still solves the examples.
Any tips?
Thu Jul 11, 2002 11:38 am
Forum: Volume 6 (600-699)
Topic: 615 - Is It A Tree?
Replies: 71
Views: 23433
Sorry, I was referring to the maximum nodenumber. I don't know about the maximum number of nodes, but it could of course be also increased to above 100.
I don't use a matrix to store edges, so I can't tell.
Thu Jul 11, 2002 10:19 am
Forum: Volume 2 (200-299)
Topic: 208 - Firetruck
Replies: 48
Views: 15158
BTW: Firetruck is #208
Thu Jul 11, 2002 10:12 am
Forum: Volume 5 (500-599)
Topic: 548 - Tree
Replies: 23
Views: 10889
I think you should check your code. I just got accepted using the 'simplistic' approach: recursively scan ever decreasing subsets of the input arrays, and checking path-sum and leaf-value at end-nodes. (This is building a tree + DFS, but in one pass without storing the tree). For the path-sum I took...
Thu Jul 11, 2002 8:45 am
Forum: Volume 6 (600-699)
Topic: 615 - Is It A Tree?
Replies: 71
Views: 23433

### bigger input

I had my program rejected after rejudge too, but got AC after adjusting for bigger input (no. of nodes 10000 -> 100000).