1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99
| int main( int argc, char** argv )
{
const int dimX = X;
const int dimY = Y;
int laby[dimX][dimY];
int k = 0;
int NbCaseAZero = 1;
srand((unsigned)time(NULL));
for(int i = 0; i < dimX; i ++)
{
for(int j = 0; j < dimY; j ++)
{
if(i%2 == 1 && j%2 == 1)
laby[i][j] = k++;
else laby[i][j] = -1;
}
}
for(int i = 0; i < dimX; i ++)
{
for(int j = 0; j < dimY; j ++)
{
if(laby[i][j] == -1)
std::cout << "*";
else std::cout << " ";
}
std::cout << std::endl;
}
while(NbCaseAZero < N * M)
{
int x,y;
do{
x = alea(dimX - 2) + 1 ;
y = alea(dimY - 2) + 1;
if(laby[x][y] == -1)
break;
}while(true);
if(x%2 == 1)
{
int d = laby[x][y-1] - laby[x][y+1];
if(d>0)
{
if(laby[x][y+1] == 0)NbCaseAZero +=3;
laby[x][y] = laby[x][y+1];
laby[x][y-1] = laby[x][y+1];
if(laby[x-1][y-1] == laby[x][y-1])laby[x-1][y-1] = laby[x][y+1];
if(laby[x+1][y-1] == laby[x][y-1])laby[x+1][y-1] = laby[x][y+1];
if(laby[x][y-2] == laby[x][y-1])laby[x][y-2] = laby[x][y+1];
}
if(d<0)
{
if(laby[x][y-1] == 0)NbCaseAZero +=3;
laby[x][y] = laby[x][y-1];
laby[x][y+1] = laby[x][y-1];
if(laby[x-1][y+1] == laby[x][y+1])laby[x-1][y-1] = laby[x][y-1];
if(laby[x+1][y+1] == laby[x][y+1])laby[x+1][y-1] = laby[x][y-1];
if(laby[x][y+2] == laby[x][y+1])laby[x][y-2] = laby[x][y-1];
}
}
if(y%2 == 1)
{
int d = laby[x-1][y] - laby[x+1][y];
if(d>0)
{
if(laby[x+1][y] == 0)NbCaseAZero +=3;
laby[x][y] = laby[x+1][y];
laby[x-1][y] = laby[x+1][y];
if(laby[x-1][y+1] == laby[x-1][y])laby[x-1][y+1] = laby[x+1][y];
if(laby[x-2][y] == laby[x-1][y])laby[x-2][y] = laby[x+1][y];
if(laby[x-1][y-1] == laby[x-1][y])laby[x-1][y-1] = laby[x+1][y];
}
if(d<0)
{
if(laby[x-1][y] == 0)NbCaseAZero +=3;
laby[x][y] = laby[x-1][y];
laby[x+1][y] = laby[x-1][y];
if(laby[x+1][y+1] == laby[x+1][y])laby[x+1][y+1] = laby[x-1][y];
if(laby[x+1][y-1] == laby[x+1][y])laby[x+1][y-1] = laby[x-1][y];
if(laby[x+2][y] == laby[x+1][y])laby[x+2][y] = laby[x-1][y];
}
}
}
} |
Partager