OJ Board

anyone gives some IO?
I got WA WA...

1 2 3 4
3 1 4 2
4 3 2 1
2 4 1 3
1 2 3 4


1 2 3 4
1 3 2 4 !!!
1 2 3 4

I pass all test cases, but still got WA.
I am unable to find the bug of my program now

thanks, helmet

for your input, the output of my program is the same as yours.

anyone who got AC give me some IO ?
I got WA. Do I find the largest connected component ?
or I misunderstand the problem ?
thanks

I got WA. anyone who got AC give some IO ? thanks

anyone give me ouput for those input ?

11
12
16
17
19
20
21
23
80
81
82
96
97
98
99
100
123
111
2342
456
12323
76845
23411
1123
999997
999998
999999
1000000

thanks

I got 6 WA , I can't find my mistake, anyone help me ?
thanks in advance

[cpp]
#include <stdio.h>
#include <string.h>

const int M = 1001;

int d[2][11], a[M][11];
int n;

int main() {
int T,i,j;
scanf("%d",&T);
while(T--) {
scanf("%d",&n);
n/=100;
for(i=9;i>=0;i--) {
for(j=0;j<n;j++) scanf ...

I output the same as Per's output, but still get WA, anyone post some test cases for me ?
thanks.

0
1
3
6
13
27
54
109
219
438

look at this , just some sequences of hanoi moves

1 2 3 4 5 6 7 =>

1 2
3 4 5 6 7 =>

1
2
3 4 5 6 7 =>

1
2 4 5 6 7
3 =>

1 3
2 4 5 6 7 =>

1 3
2 4 5
6 7 =>

1 3 5
2 4
6 7 => ............

anyone tell me what's the output for input

4
1 100 1 100
100 1 100 1
100 100 100 100
1 1000 1 1000

thanks in advance

thanks to Adrian
I am sorry that I pasted a old version.
let me paste again
[cpp]
// deleted after ac
[/cpp]
But WA again

" If np is the number of primes dont you think in C: "
sorry, I don't understand your english.
thank you all the same.