OJ Board

Hridoy, a bright student of BUET, is suffering from accute Leukemia.
The treatment is Bone marrow transplant.
Around US$80,000 is needed.

Please visit
http://hridoy.vze.com

Any kind of help is appreciated.

Thank you

Refer to "The C Programming Language" by Kernighan & Ritchie
2nd Edition - Chapter - 6, page - 138

The Language definition does guarantee, however, that pointer arithmatic that involves the first element beyond the end of an array will work properly.

My Dynamic solution solves it in abt 0.06 seconds. is the bfs solution faster ?
My code is recursive (and a bit dirty also, there are places for optimization) ---> the iterative solution may include extra solutions in the space --- thus requiring more time. So using static incrementalization with a ...

Titir mia,
Who has told you that I use .NET ?

xyz+5500,100
It seems it will work with VC++ 6.0, the debugger takes it but no effect.
casting the array to smaller size should work, but I couldn't make it work.

So I use the alternate way (its also casting)
[cpp]
int (*p)[100]; /* keeping this in code */
[/cpp]
during debugging when i need p ...

check the following code:
[cpp]
#include<iostream>
using namespace std;

template<class T>
void process(T a, T b,void (*job)(T a,T b))
{
cout<<"process called with "<<a<<" and "<<b;
cout<<endl;
job(a,b);
}

template<class T>
void print_max(T a,T b)
{
cout<<"max is ";
if(a>b)cout<<a;
else cout ...

suppose int xyz[10000] is an array.
and we are using IDE Visual C++ 6.0

during debugging we can add xyz to watch window, it will show the whole array, when expanded.
If the array is large, it becomes slow when expanded and debugging becomes tiresome.

So how to view part of the array, say we want ...

Is it a problem of Turbo C compiler ?

Consider the following code:

[c]
void main()
{
int n,d;

n=5;
printf("%d ",d = ++n + ++n);

n=5;
d = ++n + ++n;
printf("%d ", d);
}
[/c]

both printf should output same value, and it does that in vc++.
but in Turbo C first printf prints 13 and the ...

I generally code in C. sometimes have to use C++.
Experience helps to write code that converts to efficient machine codes.

Algorithm with asymptotically faster complexity is not the final solution,
its implementation also matters.
For example, if we want to find " j= i mod 32 "
[c] j = i & 0x1F ...

hi,
Thank you very much for checking my code. Actually it is very tiresome verifying others code. Sometimes I get stuck with these types of small but *fatal* errors, which I should take care.

Finally I got accepted.
My WA's in this problem mean that gcc++ compiler throws exception SIGSESV if ...

probably no problem when scanf. but why not you experiment...?

It seems you are new. I think you should carefully examine the following code. Actually this problem is a very easy one.

[cpp]
#include<stdio.h>

void printbinary13(int x);

void printbinary13(int x){
int c,v=0x1000;
for(c=0;c<13;c++){
if(x&v)putchar('1');else putchar('0');
v>>=1;
}
}

void ...

Recently I re-downloaded all the volumes from acm uva site. Where there is a link "updated problems for download"
But now I see many of them are not updated..... The algorithmic team is making change to the input range, this change is found is not reflected in many of those updated problems.

For ...

Hi Everyone,
This problem seems very interesting, but I don't know why I am getting WA! I think my answers are correct.
Here dynamic technique memoization is used
For negative values of n, it program prints 1.
And I have used "unsigned long long"

Would you please check the code below?

[cpp ...

Once I downloaded problems from
http://acm.uva.es/problemset/files/

Now when I go to download Volume8 ,CIV,CV or any other one it says that the file doesn't exist (This problem arised before the upgrade).
For example:
http://acm.uva.es/problemset/files/v105-htm01.zip
can't find the file.

As I use ...