OJ Board

Getting wrong answer:

The array GRAPH stores the graph.
GRAPH [0] stores the degree of i-th node.

#include <cstdio>
#include <iostream>
#include <string>
#include <algorithm>
#include <queue>

#define SIZE 25

#define WHTE 0
#define GRAY 1
#define BLCK 2

using namespace std;

int GRAPH[SIZE ...

Can someone find problem in my solution?
in my code d3, d4, d5, d11, d100, d400 are 1 if the input is divisible by the respective number.

#include <stdio.h>
#include <string.h>

int L, i;
char Y[100000000];
int d3, d4, d5, d11, d100, d400;

void div3();
void div4();
void div5();
void div11();
void ...