Ngày tải lên :
09/07/2014, 17:20
... index=0 , add=1 , i=0, j=0;
public int MaxIndexResultCanFind;
public int[] Result = new int[82];
public int MaxIndex
{
get { return MaxIndexResultCanFind; }
set { MaxIndexResultCanFind ... setValue(i, o, value);
push(tou(i, o));
}
}
}
void checkcollum()//Kiểm tra trên cột
{
int i, j, value, o=0, count;
for (j = 1; j <= size; j++) for (value = 1; value <= 9; value++) ... void setValue(int i,int j,int newValue){
int k;
agree[i,j,1]=newValue;
agree[i,j,0]=1;
for(k=2;k<=10;k++)agree[i,j,k]=0;
row[i,newValue]=collum[j,newValue]=area[AREA[i,j],newValue]=0;...