OJ Board

Thanks~
I got AC...

I don't know why I got WA...
help me...please.....


#include<stdio.h>
int n,all,que[5002];
int add(int in)
{
int index;
index=all;
all++;
while(index>0)
{
if(in<que[(index-1)/2])
{
que[index]=que[(index-1)/2];
index=(index-1)/2;
}
else
break;
}
que[index]=in;
return 0;
}
int del ...

I don't dnow why....please help me....

I don't know why....
#include<stdio.h>
#include<stdlib.h>
int all;
int table[5608];
typedef struct wei
{
int self,other;
}ori;
ori ary[5608];
int comp(void const *a,void const *b)
{
return (*(ori*)a).other-(*(ori*)b).other;
}
int in()
{
all=0;
while(scanf("%d %d",&ary[all].self,&ary ...

thank you very much~~~~

Please help me.....thanks.....

#include<stdio.h>
#include<string.h>
int num[5];
bool open[5];
bool dfs(int now,int step)
{
int i;
if(step==5)
{
if(now==23)
return 1;
return 0;
}
for(i=0;i<5;i++)
{
if(!open[i])
{
open[i]=1;
if(dfs(now+num[i],step+1))
return 1;
if(dfs(now-num[i ...

I don't know why I got WA...... :cry:
Please help me..... thanks..... :D

#include<stdio.h>
char ary[15][35];
int god,j,news;
int art[15],artg;
int dfs(int t)
{
for(int k=t;k<news;k++)
{
art[artg++]=k;
if(artg-1==j)
{
for(int i=1;i<artg;i++)
{
printf("%s",ary[art[i]]);
if(i+1 ...