UVa OJ Board

Currently Rujia Liu has created a problem set.
http://uva.onlinejudge.org/index.php?op ... tegory=298

Hi, I am trying to collect the problems (in UVA's problemset) that can be used to practice the programming skills. Lesser the algorithms, and more the architectures. I have already found some: 10966 (design a simple OS shell), 790/10258 (simulate the contest scoreboard). These problems are really go...

In the problem statement,
the sample output of the first test case is:

5
4
4
2
2

It should be

4
3
3
2
2

My program passed all cases from the judge.
So I think it's just a typo in the problem statement.

Sure. It can be solved with O(n * n * m).

This problem can be modelled as a scheduling problem. It exists a O(nlogn) greedy algorithm which is better than modified-LIS method mentioned here. See Hodgson's algorithm.

ptargino wrote:The test cases of this problems are wrong. Actually, you just need to verify if each substring is prefix of the original. I've done this way and got AC.

The prefix of one string is also the substring of one string. It is reasonable that we need to check all the prefixes.

To oscartheroot, 1. Add return 0; at the bottom of main function. 2. Remove system("pause"); 3. Your program outputs extra things. 4. You can simply use int type instread of long long type. 5. The problem says there are no more than 1000 elephants. You can simply use a 1000-unit-array instead of a v...

Edit: I found the error in my algorithm. AC now.

Here is one of mine implementations:

This problem is known as 'the minimum mean cycle problem' or 'the minimum mean-weight cycle problem.' There are two different approaches to solve this problem: The first approach is to project this problem to 'the minimum (cost-to-time) ratio problem.' The main idea to solve this problem is: set a p...

Because your algorithm is not efficient enough. http://mathworld.wolfram.com/DirectSearchFactorization.html why TLE plz help whene i solved the problem after generating primes. But now if i dont handle only with primes the code gets TLE. #include <cstdio> int absValue(int a){ if(a<0) return -a; else...

Today I find that the problem has already reported in the pervious post. Just notify.
http://online-judge.uva.es/board/viewto ... f15a6ec5d3

Hi everybody, I collected some advanced graph problems. Maybe you need them for exercises. Max-Flow 00563 Crimewave ------------------------ (Vertices have capacity. Edges have not.) 00820 Internet Bandwidth 10330 Power Transmission -------------- (Vertices have capacity.) 10511 Councilling --------...

Because your algorithm is not efficient enough. Try another better algorithm. whay TLE, im just comparing upto substring lenth? #include <cstdio> #include <algorithm> using namespace std; int main(){ freopen("in.txt","rt",stdin); int Case,subNum,i; char S1[100001],*p; char S2[1001]; char S3[1001]; i...

camara wrote:Output:
15
Impossible
15
Impossible
1500

Numbers are okay.
But there should be one period at the end of the word 'Impossible.'