## Search found 39 matches

Sat Apr 30, 2005 6:53 pm
Forum: Volume 6 (600-699)
Topic: 698 - Index
Replies: 21
Views: 8843
The following input tests the case for which I was getting WA for a very long time.

Input:
Word1
Word2
Word3

word1...word2...word3
Output:
Case 1
WORD1 1
WORD2 1
WORD3 1
Thu Apr 14, 2005 8:07 pm
Forum: Volume 108 (10800-10899)
Topic: 10801 - Lift Hopping
Replies: 56
Views: 28927
Sorry for I forgot to edit my earlier post, I've got AC several days ago..
Sun Apr 03, 2005 8:08 pm
Forum: Volume 108 (10800-10899)
Topic: 10801 - Lift Hopping
Replies: 56
Views: 28927
I've used Dijkstra's algorithm, but always getting WA.
Are there empty lines possibly filled with spaces in arbitrary positions in judge's input?
Sat Apr 02, 2005 6:37 pm
Forum: Volume 7 (700-799)
Topic: 707 - Robbery
Replies: 12
Views: 7032

### 707 : Robbery

Hello, The problem statement does not seem very clear to me. Can anyone answer the following questions? 1. " ..the robber can move at most one unit per time step ", does this movement include diagonal movements as well? 2. The output will be "The robber has escaped.", only when f...
Sun Feb 27, 2005 4:35 pm
Forum: Off topic (General chit-chat)
Topic: What is ur minimum time to generate prime in 20000000 ?
Replies: 28
Views: 8277
Mine is 2.640 Secs
Sat Feb 26, 2005 6:07 am
Forum: Volume 102 (10200-10299)
Topic: 10203 - Snow Clearing
Replies: 21
Views: 4952
Sorry my post was wrong !
Thu Jan 06, 2005 6:51 pm
Forum: Volume 2 (200-299)
Topic: 277 - Cabinets
Replies: 4
Views: 2387

### 277 : Cabinets

Hi, I've got WA on this problem. I got a H-U-G-E data set from my friend and my program matches exactly with the correct output of that data set. I'm really confused with this problem. Someone please help me.. :( Thanks in advance, #include<stdio.h> #include<string.h> #define MAX 200000 struct s{ ch...
Wed Oct 20, 2004 7:14 pm
Forum: Volume 103 (10300-10399)
Topic: 10342 - Always Late
Replies: 25
Views: 11620

### 10342 Always Late : Need output for this test set

Hello,
Can anyone post the output from their accepted solution for the following inputs?
1 0
1
0 0

2 1
0 1 10
3
0 0
0 1
1 0

3 3
2 1 1
0 1 2
2 0 3
4
0 0
0 1
0 2
1 2
Thank you.
Tue Oct 19, 2004 10:25 am
Forum: Volume 105 (10500-10599)
Topic: 10525 - New to Bangladesh?
Replies: 50
Views: 20948

Hello, Can anyone help me by answering the following questions: 1. The problem statement says "Places are numbered starting from 1.", does this mean 1 <= place_number <= max_node ? Or do I need to map the numbers? Ans: No need to map. 2. I'm using Floyd-Warshall, what could be the limit fo...
Tue Sep 14, 2004 9:36 am
Forum: Volume 1 (100-199)
Topic: 144 - Student Grants
Replies: 21
Views: 4225

### Thanks!

Thanks Dominik,
I've corrected my mistake and got AC.
Mon Sep 13, 2004 8:05 pm
Forum: Volume 1 (100-199)
Topic: 144 - Student Grants
Replies: 21
Views: 4225

### 144 Student Grants

Hi,
I'm getting WA for this problem . Can anyone give me the outputs of their accepted solutions for the following inputs?
I would really appreciate any i/o set other than this one.
5 10
25 40
25 1
1 1
1 40
10 30
10 10
3 39
22 2
13 13
0 0
Thank you.
Tue Aug 31, 2004 5:31 pm
Forum: Volume 7 (700-799)
Topic: 726 - Decode
Replies: 36
Views: 10608
Hi, Could you explain a little more about your input routines for KNOWN & ENCODED? I can't understand what you meant by "array of string of size 40000". Is is a single array of chars of length 40000? Do the messages come as single lines, separated by a blank line? But problem statement...
Mon Aug 30, 2004 2:51 pm
Forum: Volume 7 (700-799)
Topic: 726 - Decode
Replies: 36
Views: 10608
Hi dpitts,
My code gives correct answer for your input, still I'm getting RTE. Is it because of the length of KNOWN and ENCODED, or does the problem lie within my comparison function for qsort?
Here's my code:

Code: Select all

`` Removed ``
Any help is really appreciated.
Sun Aug 29, 2004 7:57 pm
Forum: Volume 104 (10400-10499)
Topic: 10487 - Closest Sums
Replies: 89
Views: 32004
Dear Wanderley, Your code doesn't produce correct output for the sample input given in the problemset. Maybe, this is the reason: You should initialize num with a big number, but you're doing num=num[1] for the first time when you're entering the k-loop. So change it to num=any big number. [cpp]for ...
Sun Aug 29, 2004 5:38 pm
Forum: Volume 104 (10400-10499)
Topic: 10487 - Closest Sums
Replies: 89
Views: 32004
Hi wanderley2k,

You'll find some sample i/o here. Check your program with these.

http://online-judge.uva.es/board/viewto ... c&start=15

regards,