OJ Board

#include <iostream.h>

int x[3] , x1[3] , x2[3] , a[2] , b[2] , min , sum , saer ;

int main()
{
while(cin>>x[0]>>x[1]>>x[2])
{
cin>>x1[0]>>x1[1]>>x1[2]>>x2[0]>>x2[1]>>x2[2];


if(!x[0]||!x[1]||!x[2])
{min=(x1[0]-x2[0])*(x1[0]-x2[0])+(x1[1]-x2[1])*(x1[1]-x2[1])+(x1[2]-x2[2])*(x1[2]-x2[2 ...

can anybody give me critical inputs to check my program

#include <iostream.h>
#include <math.h>

unsigned long i , j , k , m , n , m1 , n1 , t , a[10003] , b[10003] , min , sum , pas;

void B_NULL()
{
for(i=0;i<10003;i++)
b =0;
}

void prime ()
{unsigned long N , i , j , s ;
N=100000;
s=1;a[0]=2 ...

#include <iostream.h>
#include <string.h>

char team[16][16],c[12];
int i,j,k,l,h,h1;
double p[16][16],p1[16][2];

main()
{
for(i=0;i<16;i++)
cin>>team ;
for(i=0;i<16;i++)
for(j=0;j<16;j++)
cin>>p [j];

for(i=0;i<16;i++)
{p1 [0]=0;p1 [1]=p [i+1-2*(i%2)];}
k=4;
while(k!=32){
for(i=0;i<(16/k);i++)
for ...