OJ Board

Please HELP ME!!!!!!!!!!!!!!!!!!!!!

I think the problem is that finding two words which have 5 digits each, and these ten digits must 0~9, and the div must be N.
Here is my code ,I don't know why it gives me WA!
Please HELP ME!!!!!!!!!!!!!!!!! :lol:
[cpp]#include <iostream.h>

class Acm725
{
private:

long c;
public:
int cb (long c ...

It seems all right.But it is judged WA.
I NEED YOUR HELP! :o :o :o
[cpp]
#include <string.h>
#include <stdio.h>

char computer[10];
int oneline(char *s)
{
char app_name;
int app_num,i,n,j;
app_name=s[0];
app_num=s[1]-'0';
for (i=3,n=0;n<app_num;i++)
{
if(s !='\0')
{
if(!computer[s -'0 ...

I have tried many times,but it always tells me WA.Could you give me some complex test data?
[cpp]
#include <iostream>
#include <string.h>
using namespace std;
class Blocks
{
private:
int block[25][25];
int top[25];
int n;
public:
Blocks(int N);
void mot(int x1,int x2,int y1,int y2);//move onto ...