UVa OJ Board

Submit as C++11.
The C++ option does not support gets().
BTW, you should be able to read to compilation error message in your submission page.

This problem is very similar to 10020.
If you get accepted on that problem, the same code can be used here with little modification.

Getting PE. Please help me. My idea is as follows: 1. Use input() function to get input from stream. 2. Treat 4 chars from input each time. 3. Convert into index. 4. Calculate the value of the output. Note. If I delete the puts( "" ) on line 36, I get a WA. Thanks. #include<iostream> #include<cstrin...

Getting several PE but don't know what the problem is. My idea is pretty simple. For each query, iterate through all articles and all lines. Print that line if it contains that query word. The idea works fine, as I got a PE, not WA. But the problem is why PE. I didn't find the point where I'm missin...

Getting several WA for this problem. I've tried many solutions but none worked. Here's my solution: (spoiler below) 1. Generate all lines that can be drawn in 5001x5001 grid. (As the longest line is 5000x5000, I didn't generate lines longer than 5000.) 2. For each possible line (sorted in order), ch...

Some explanation for this problem. In case there's anyone who's also confused with this problem. 1. There are N islands in total, M of which are small. 2. S_i means the ID of small island. In the following case, 4 2 0 1 1 2 1 4 There are 4 islands, 2 normal, 2 small ones. Population is [ 2, 3, 4, 5 ...

One more case.

Input: Output:

OK, I figured it out, and I'll explain a little bit more in details. 1. For input "1 6 2", we have sticks of lengths of "2 3 3 3 3 3 3 5 5", 9 sticks in total. 2. We have to make as many triangles as possible. 3. Each triangle consists of 3 sticks, and no stick should be used more than once. So for ...

Hi , I am using Meet In The Middle Technique for this Problem Got AC But Time > 2s ... I see some other solution takes ~.1 sec.. What algorithm is needed to get such execution time ?? My solution ran about 0.113 sec. You may refer to https://en.wikipedia.org/wiki/Subset_sum_problem Spoiler below: I...

Zyaad Jaunnoo wrote:What is the output for this input?

Code: Select all

40 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

On uDebug, the output is:

Code: Select all

1099511627775

Shouldn't it be?

Code: Select all

40

Every element is considered different.

Didn't quite understand this problem.
Should all sticks be used?

In the first sample input, 1 6 2
Does it mean "2 3 3 3 3 3 3 5 5" cm sticks?
I found
3 3 2
5 5 3
5 5 2
3 3 5, 4 possible combinations.
Why the answer is 3?

Thanks.

One critical input, hope it helps someone.
Input: Output:

Your code fails on these 2 cases. (Your code returns clubs on both cases.)

QC JC AH KH QH JH 3D 4D 5D 6D 7S 8S QS
---bid heart

QC JC AH KH QH JH 3D 4D 5D 6D 7S 8S JS
---pass

Input: (blank lines between cases for readability) 2 0 6 7 1 5 6 3 0 5 2 3 4 4 0 3 2 4 2 3 4 1 3 5 0 4 5 1 3 4 1 2 3 1 0 2 3 2 1 0 3 0 6 5 1 0 4 5 2 3 3 0 2 4 0 1 5 1 0 5 2 1 4 1 0 2 0 8 5 2 4 4 7 5 3 3 7 2 7 6 1 2 6 0 2 0 3 0 4 1 2 1 0 9 20 2 1 19 6 2 18 5 2 17 2 7 16 7 4 15 2 3 14 5 7 13 6 5 12 0 ...

Got runtime error. Please help me, thanks. My approach is tarjan's algorithm. (SCC) Then count the number of SCC whose in-degree is 0. I ran through thousands of cases on my computer, but none crashed. Got AC. The reason of RE was stack overflow. I created 100,000 vectors and int arrays. Though decl...