OJ Board

It seem cannot register now...

Anyone know what wrong in my code???

nobody know ?

I'm getting W.A. Don't Know why .

I post the code

#include <cstdio>
#include <cstdlib>

int parent[30001];
int count[30001];

int main() {
int t, m, n, a, b, Max;

scanf("%d\n", &t);

for (int i=0;i<t;i++) {
scanf("%d %d\n", &m, &n);

for (int j=1;j<=m;j++) {
parent[j] = j;
count[j] = 0 ...

Could the judge send me the code of one of my accepted problem?

Since I lost this code in my computer (UVA444 - Encoder and Decoder).

My account in 55807FF.

Thank you!

Sample Input:

3
5 2
40 2
24444 6

Sample Ouput :
1 1
1 1
0 6

why
input :40 2 --> output : 1 1

i think 40%2 == 0 and the output should be 0 2 not 1 1

anyone could help me?

Should I sort the "price of the item" OR "favour index"?

But I think that those of them is not work....

How could do it?

..

The Ackermann function is the simplest example of a well-defined Total Function which is Computable but not Primitive Recursive, providing a counterexample to the belief in the early 1900s that every Computable Function was also Primitive Recursive. It grows faster than an exponential function, or ...