OJ Board

Zyaad Jaunnoo

Faithkeeper_Rangwan wrote: ↑Fri Jul 11, 2014 4:17 pm I don't think this problem even need to use prime factorization.

I modified the sieve of Eratosthenes to count the number of divisors for all N <= 1,000,000.

Zyaad Jaunnoo

Repon kumar Roy wrote: ↑Fri Nov 28, 2014 3:50 pm My question is State (2,2) , can player give valid move , because no box with fewer items..
Please Clearify

Simulate the game using the minmax algorithm and you should see a pattern..

Zyaad Jaunnoo

jichen1234 wrote: ↑Thu Oct 23, 2014 9:14 pm I can't solve this. It's too unethical.

What do you mean?
I think it is a nice problem..

Zyaad Jaunnoo

Hello there,

What algorithms did you use to solve this problem?

My idea was to build a DAG out of strongly connected components and then traverse the graph from the entry till the exit node while keeping track of the vertices being visited. But WA..

Any guidance on this problem?

Thanks!

Zyaad Jaunnoo

ssavi wrote:Why It is Getting WA?? I have Checked All The Tests of Samples , uDebug and OJ Borads . All are Ok . But I am getting WA .
.
.

Your code is almost correct.. But, you missed a "break" statement when picking a move.

INPUT

Code: Select all

1
2354456456587544678986756467889867

OUTPUT

Code: Select all

Case 1: S

Zyaad Jaunnoo

I am using "normal" dfs for this problem. I number each node and when I hit an already visited node, I get the number of nodes in the cycle by the difference of their ids + 1. But WA :( Any catch? Below is my code. Thanks for your help. #include <bits/stdc++.h> using namespace std; const i...

Zyaad Jaunnoo

How can this input be correct? 8 16 XYZ ZA AX BY BZ CX CY DZ YD XE ZE XY YZ ZX EF CA BD It says 8 slept parts but the connections (letter pairs) shows that there are 9 (9 different letters) parts. What should I do with this kind of inputs? Should I work with the first 8 letters and forget about awa...

Zyaad Jaunnoo

C++ function __builtin_ffs(x) was very handy for this problem. Used it to get the position of the least significant bit of an integer.

Zyaad Jaunnoo

Rahul007, your solution is for what problem number on UVA Online Judge?

Zyaad Jaunnoo

Using a bruteforce approach to solve this problem was enough. 2^n sets of towns to be connected using MST and keeping the best configuration, which is the cost <= K and the configuration having the most number of connected people. This took around 0.103s. As I can see runtimes of 0.03s as well, what...

Zyaad Jaunnoo

juan321 wrote:I have problems with some cases Help D:

success on day 4
failure on day 3
failure on day 7
failure on day 68
success on day 21
failure on day 1

Hello Juan,

Can you please post your code?

Zyaad Jaunnoo

When you output the number of cards in the winner's hand, it should right justified in a field of width 3 (specified in the problem statement).

PS: Please do search the forum for an existing post about a problem before creating a new one.

Zyaad Jaunnoo

sarwanov wrote:can you suggest me some easy problems to solve please???

Some easy problems are categorised on the online judge website:
https://uva.onlinejudge.org/index.php?o ... tegory=605

Zyaad Jaunnoo

brianfry713 wrote: I also keep a bool array of size 201*201*201 that tracks if a state has been visited, initialized to all false.

In fact, only an array of size 201*201 is sufficient to keep track of the visited states.

Zyaad Jaunnoo

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

OJ Board

Search found 122 matches

Re: 11960 Divisor Game Getting WA!!

Re: 12293 - Box Game

Re: 11615 - Family Tree

13066 - Ant-Man's Sugar Journey

Re: 11489 - Integer Game

Re: 12544 - Beehives

Re: 10507 - Waking up brain

Re: 11933 - Splitting Numbers

Re: Presentation Error ??

Re: 12507 - Kingdoms

Re: 573 - The Snail

Re: 162 - Beggar My NeighBour

Re: Suggest some easy problems to solve

Re: 10603 - Fill

Re: 12911 - Subset sum