Seems there's no huge interest in fixing this old problem.

Or maybe I am missing something, I don't know.

Maybe the problem statements are not supposed to be

changed, I admit that I haven't followed all discussions

on the topic of problem 343 here in this forum.

## Search found 374 matches

- Tue Feb 17, 2009 3:46 pm
- Forum: Bugs and suggestions
- Topic: Problem 343
- Replies:
**1** - Views:
**1468**

- Tue Feb 17, 2009 2:47 pm
- Forum: Volume 115 (11500-11599)
- Topic: 11565 - Simple Equations
- Replies:
**21** - Views:
**5788**

### Re: 11565 - Simple Equations

Obaida, are you asking seriously

or is this just a kind of joke ?

I guess it is a joke, the problem says

1 <= A,B,C <= 10000.

or is this just a kind of joke ?

I guess it is a joke, the problem says

1 <= A,B,C <= 10000.

- Mon Feb 16, 2009 9:16 pm
- Forum: Volume 115 (11500-11599)
- Topic: 11565 - Simple Equations
- Replies:
**21** - Views:
**5788**

### Re: 11565 - Simple Equations

I don't think you got my remark. Now, I think that by N you meant maybe the number 10,000 in the context of this problem (or which is basically the same N = max(A,B,C)). I guess this makes most sense to be denoted as N (in the sense you mentioned it) as this number is the upper limit for A,B and C. ...

- Mon Feb 16, 2009 10:55 am
- Forum: Bugs and suggestions
- Topic: Problem 343
- Replies:
**1** - Views:
**1468**

### Problem 343

The problem statement says: " The bases associated with X and Y will be between 1 and 36 (inclusive) " I believe this statement is first misleading and second, it is wrong. #1) It is misleading because it makes the person solving the problem consider base 1 if all digits (of the corresponding input ...

- Mon Feb 16, 2009 1:06 am
- Forum: Volume 115 (11500-11599)
- Topic: 11571 - Simple Equations - Extreme!!
- Replies:
**31** - Views:
**11065**

### Re: 11571 - Simple Equations - Extreme!!

Some more I/O from an ACC program. I think the trick in this problem (apart from the precision problems) is to print 'No solution' even when we have a solution but the roots x,y,z are not three different integer numbers (maybe most people overlook the 'different' part). So for example, (1,1,1) is no...

- Sun Feb 15, 2009 9:53 pm
- Forum: Volume 115 (11500-11599)
- Topic: 11565 - Simple Equations
- Replies:
**21** - Views:
**5788**

### Re: 11565 - Simple Equations

I am not sure what it means O(N) and O(N^2) (in the previous post) because this problem has three input parameters - A,B,C and no N there (except the count of the test cases). Anyway. Here is the correct output for the input posted above. INPUT 29 3 1 3 3 3 3 1 8 21 17 108 121 10 0 100 47 240 1637 1...

- Tue Feb 10, 2009 10:35 am
- Forum: Algorithms
- Topic: Circular String Linearization
- Replies:
**12** - Views:
**13043**

### Re: Circular String Linearization

Thanks for these detailed explanations & references, I will try to

have a look and hopefully understand them (or at least some of them).

Thanks a lot.

have a look and hopefully understand them (or at least some of them).

Thanks a lot.

- Sun Feb 08, 2009 2:56 pm
- Forum: Algorithms
- Topic: Circular String Linearization
- Replies:
**12** - Views:
**13043**

### Circular String Linearization

This is a problem mentioned in Dan Gusfied 'Algorithms on Strings Tress and Sequences' (page 148 - problem is named APL12). There the author says it could be easily solved if we build a suffix tree. Glass Beads - UVA Problem 719 http://icpcres.ecs.baylor.edu/onlinejudge/external/7/719.html is exactl...

- Thu Feb 05, 2009 8:05 pm
- Forum: C++
- Topic: Hash Table / Map -> C++ O(1) by key ?
- Replies:
**6** - Views:
**6609**

### Re: Hash Table / Map -> C++ O(1) by key ?

Thanks , I may try it. I actually was trying to solve problem 10032. I can do it in Java but it's a bit slow (for the Judge's 3 secs). And I can do it in C++ but there I am not so good as in Java so if I get into more complex details I start to lose my way. That's why I asked this question. Actually...

- Thu Feb 05, 2009 6:54 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10032 - Tug of War
- Replies:
**91** - Views:
**32090**

### Re: 10032 (cont'd)

I tried this problem (Tug of War) really hard both in Java and C++. I did not manage to get ACC in UVA i.e. here (at least not yet). http://icpcres.ecs.baylor.edu/onlinejudge/ But I got ACC here (problem ID is 110805 - (0.56 secs) in Java ACC) http://www.programming-challenges.com/ just by submittin...

- Wed Feb 04, 2009 10:51 pm
- Forum: C++
- Topic: Hash Table / Map -> C++ O(1) by key ?
- Replies:
**6** - Views:
**6609**

### Re: Hash Table / Map -> C++ O(1) by key ?

I think I found a way to use hash_map but all info

points this usage is not portable and/or standard?!

So if I assume no usage of the GNU compiler I still don't

know how to do it (at least not in a portable/general way).

points this usage is not portable and/or standard?!

So if I assume no usage of the GNU compiler I still don't

know how to do it (at least not in a portable/general way).

- Wed Feb 04, 2009 8:28 pm
- Forum: C++
- Topic: Hash Table / Map -> C++ O(1) by key ?
- Replies:
**6** - Views:
**6609**

### Hash Table / Map -> C++ O(1) by key ?

I need a hash table (or hash map in C++) which has constant time access (given a key). How do I do that in the UVA Judge (with least coding)? I read about using hash_map from some extension library of the Standard C++. But that does not work for me (compilation errors). Maybe I am doing something wr...

- Sun Jan 25, 2009 6:10 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10125 - Sumsets
- Replies:
**50** - Views:
**15379**

### Re: 10125 - Sumsets

I am wondering if there is a better method/approach/idea for solving this problem (different from the one already described above in this thread). If I am not mistaken the method described above has worst-case time complexity O( N^2 * log(N^2) ) which basically simplifies down to O( N^2 * log(N) ) i...

- Sat Jan 24, 2009 5:48 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11008 - Antimatter Ray Clearcutting
- Replies:
**81** - Views:
**38271**

### Re: 11008 - Antimatter Ray Clearcutting

With the risk of reviving this very old forum thread I want to proudly mention :) that I got my first ACC on this problem almost 3 years after I first posted some pretty confused thoughts of mine (above). I got back to this problem by pure chance and this time (after doing some thinking in the last ...

- Wed Jan 21, 2009 8:05 pm
- Forum: Algorithms
- Topic: KMP Algorithm - Search for Problems
- Replies:
**8** - Views:
**7019**

### Re: KMP Algorithm - Search for Problems

Any more exact string searching/matching problem?