imported>Unknown at 05:28, 7 February 2021

2021-02-07T05:28:27Z

New page

#include <iostream>
using namespace std;

const int MAX = 8;

int main()
{
int arr[MAX][MAX];
for (int i=0; i<MAX; i++)
{
arr[i][0] = 1;
arr[i][i] = 1;
}

int j,k;
for (j=1; j<MAX; j++)
{
for (k=0; k<MAX; k++)
{
if (j == k+1)
break;
if (arr[j-1][k] == arr[j-1][k+1])
arr[j][k+1] = 0;
else
arr[j][k+1] = 1;
}
}
for (j=0; j<MAX; j++)
{
for (int h=j; h<MAX-1; h++)
cout << ' ';
for (k=0; k<j+1; k++)
cout << arr[j][k] << ' ';
cout << "\n";
}
return 0;
}
----
[[XOR삼각형]]

XOR삼각형/aekae - Revision history

imported>Unknown at 05:28, 7 February 2021