OJ Board

Nazmul Quader Zinnuree

Hi,

I haven't tried it yet & have no time to have a try. But, have you tried

1 0 1 0 1 0

for

Code: Select all

?

Don't ask me "WHY ?"......

Thanks.

Nazmul Quader Zinnuree

I think, my code works for all the above cases. But gets WA. Where does it fails? #include <stdio.h> int stack[3][100], top[3], m; void push(int i, int v) { stack[i][top[i]++] = v; } int pop(int i) { top[i]--; return stack[i][top[i]]; } void tower_of_hanoi(int n, int s, int t, int d) { int i, j; if ...

Nazmul Quader Zinnuree

make the flag array ready for the next input. re - initialize it with 0's

Nazmul Quader Zinnuree

Hello Cho,

I have sent my code to you by PM. Coz, your approach seems to be like mine. Would you plz check my code, why I'm getting WA.

Thanks.

Nazmul Quader Zinnuree

No sorting & no hashing.

I used a flag array to identify duplicates..

Code: Select all

char flag[20000002]

It runs within 0:07.125

Nazmul Quader Zinnuree

I've have used just 'int'

Code: Select all

n = vt / v0 / 2;
if ((vt * n - v0 * n * n) == (vt * (n + 1) - v0 * (n + 1) * (n + 1)))
/*  */

Nazmul Quader Zinnuree

12 penalties !!!!!!!!!!!! WA, TLE, RTE, RTE, WA, TLE, WA, ........... in EWUIPC, the reason is simple as mentioned above. Killed our time, killed our head, killed our position, killed us..... But we got no clarifications, no corrections, but a potato sample, that was right in all ways. However, the...

Nazmul Quader Zinnuree

Thanks Adrian,
I have worked to minimize my time. & now I'm getting WA after 5.660 sec. So, would you please give me some tricky samples?

Nazmul Quader Zinnuree

First, I simulate for the first period & for the last period. which loops for at most 30000. I think it must be done. coz, situation may change in every second in a period. Then, if it is possible to reach, then O(1) calculation, to get the time. only three cases may occur: i. reached within the...

Nazmul Quader Zinnuree

Input will be terminated with N=0 and K=0.

The people who solved it. did you consider it? The sample does not say so.
How to solve it? I'm getting TLE, but no reason to get it. it may be WA. Someone plz clarify whether it is just some math or anything other to solve it?

Nazmul Quader Zinnuree

Input will be terminated with N=0 and K=0.

But, the sample does not show it. What will be the right thing?

Nazmul Quader Zinnuree

Shame on you! You can so easily make I/O yourself! Generate random matrices, sum their rows and columns, and you get your input. Checking if the output is correct is a trivial coding exercise, too. Ok, I'm sorry. I knew that. But what to do when all my attempts seems right to me, but not to the jud...

Nazmul Quader Zinnuree

If match(above) then go if not check the second string just the same way

What does it mean ? Would you explain more elaborately.....

what is the output for

Code: Select all

aa aa aa
a a aaa
ab ac abc

Plz, explain with an example.

Thanks.

Nazmul Quader Zinnuree

Input

Code: Select all

Output

Code: Select all

Nazmul Quader Zinnuree

Someone give me some I/O, plz

OJ Board

Search found 42 matches

11079 - What's the Time?

11082 - Matrix Decompressing