## Search found 28 matches

- Mon Jun 21, 2004 9:52 am
- Forum: Off topic (General chit-chat)
- Topic: People are driving Manzoor Mad
- Replies:
**29** - Views:
**10203**

I think this problem is asking to the solver using their common sense. It just test some mathematical knowledge. I think the problem was tricky and I love to solve tricky problems. Not all the time we should solve the problem using algorithm only :wink: . I did not feel any problem about the descrip...

- Mon Jun 21, 2004 9:26 am
- Forum: Volume 5 (500-599)
- Topic: 524 - Prime Ring Problem
- Replies:
**74** - Views:
**19646**

- Mon Jun 21, 2004 9:24 am
- Forum: Volume 5 (500-599)
- Topic: 524 - Prime Ring Problem
- Replies:
**74** - Views:
**19646**

Most people are masterfull in C/C++. Very few poeple use Pascel. It is better to discuss about your problem rather send the code :wink: . By the way, this is a very simple back-track problem. You just check all the valid combinations and print them... You should clear enough about the problem descri...

- Mon Jun 21, 2004 9:09 am
- Forum: Volume 106 (10600-10699)
- Topic: 10611 - The Playboy Chimp
- Replies:
**44** - Views:
**17710**

### 10611 (Should rejudge)

There was a bug in my solution but I get AC :lol: . After getting AC verify with the following input; Input: 2 49997 49997 1 49997 With this input where was no output... :o But the output should be 'X X' So I think there is no much critical input. But the input should be strong enough to judge... :w...

- Sun Jun 20, 2004 4:36 pm
- Forum: Volume 5 (500-599)
- Topic: 551 - Nesting a Bunch of Brackets
- Replies:
**56** - Views:
**12448**

When I get a WA in the problem, then I check out some help for me and I test the sample input given by Mahmud776 . I was mad with his sample input because I fail to match with his output. But those are output from his AC code. So I was not confident to say his output was wrong. But finally understan...

- Sun Jun 20, 2004 4:34 pm
- Forum: Volume 5 (500-599)
- Topic: 551 - Nesting a Bunch of Brackets
- Replies:
**56** - Views:
**12448**

- Sun Jun 20, 2004 4:19 pm
- Forum: Volume 6 (600-699)
- Topic: 615 - Is It A Tree?
- Replies:
**71** - Views:
**23950**

### For your correction...

Red Scorpion wrote:

There is no

All the input set will be of even in its number of content...

No, you are wrong. All the edge description must be in pair (a,b) which means there is an edge from vertex a --> b.input:

1 2

1

4 5

0 0

There is no

**end vertex**for 1 in second line...All the input set will be of even in its number of content...

- Sat Jun 19, 2004 9:05 am
- Forum: Volume 100 (10000-10099)
- Topic: 10056 - What is the Probability ?
- Replies:
**26** - Views:
**8375**

### Check this

I think the problem is easy. But what may be the problem in your code is, there may have some kind of precisional error :-? . Well, check this if it can solve your problem. Input: 6 100 0.000001 1 100 0.000001 99 999 0.00023 591 2 0.0 1 915 0.166666 1 23 0.1111 13 Output: 0.0001 0.0001 0.0010 0.0000...

- Tue Jun 15, 2004 12:17 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10579 - Fibonacci Numbers
- Replies:
**8** - Views:
**4801**

Dear, bigint is nothing but your own defined class or any function that is capable to do som basic mathematical operation like 'add','sub','mul' or 'div'; 8) You need to create your own bigint class where after taking the input you just convert the base from 10 to any reasonable large base (like 100...

- Tue Jun 15, 2004 8:59 am
- Forum: Volume 105 (10500-10599)
- Topic: 10533 - Digit Primes
- Replies:
**108** - Views:
**32389**

if(a[l]=='1')c++; Do you think this portion will work correct... :o 13 is a prime number but not a digit prime. But in that protion you increase c by one (c++) if lower bound (l) is prime only. You must test whether (l) is a digit prime... :lol: Test these: Input: 3 3 5 13 13 11 13 Output: 2 0 1 Go...

- Mon Jun 14, 2004 1:15 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10579 - Fibonacci Numbers
- Replies:
**8** - Views:
**4801**

This is a simple string addition problem. You can faster the string addition by converting the base of huge integer and then do the add operation. For an example, 65535 (dec) == FFFF (hex) 65535 (dec) + 65535 (dec) will take much operation than, FFFF (hex) + FFFF(hex) so if you convert the base from...

- Sun Jun 13, 2004 9:46 am
- Forum: Volume 105 (10500-10599)
- Topic: 10543 - Traveling Politician
- Replies:
**25** - Views:
**7336**

- Sat Jun 12, 2004 2:23 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10543 - Traveling Politician
- Replies:
**25** - Views:
**7336**

### 10543 (Funny JUDGE)

I submit the solution of this problem for 15 times :evil: . I use BFS (without coloring the vertex). In my first solution I get TLE. Then I use cicular queue and got WA. My Q-size was 4000000. I edit my solution for more than 10 times but I got WA again and again. But finally I chainge my Q-size and...