imported>Unknown at 05:28, 7 February 2021

2021-02-07T05:28:27Z

New page

#include<stdio.h>

const MAX = 100;
int xor[MAX][MAX]={0,};

int computeXor(int num1, int num2)
{
return xor[num1+1][num2] ^ xor[num1+1][num2+1];
}

int input()
{
int n;
printf("n 값을 입력해주세요:");
scanf("%d",&n);
return n;
}

void xorc()
{

int i,j;

for(i=0;i<MAX;i++)
{
for(j=0;j<MAX;j++)
{
xor[i][0]=1;
if(i==j)
{
xor[i][j] = 1;
}
}
}

for(i=0;i<MAX;i++)
{
for(j=0;j<=i;j++)
{
if(computeXor(i, j))
{
xor[i+2][j+1] = 1;
}
}
}
}

void print(int n)
{
int i,j;

for(i=0;i<n;i++)
{
for(j=n;j>i+1;j--)
{
printf(" ");
}

for(j=0;j<=i;j++)
{
printf(" %d",xor[i][j]);
}
printf("\n");
}
}

void main()
{
int x = input();
xorc();
print(x);
}

----
[[XOR삼각형]]

XOR삼각형/이태양 - Revision history

imported>Unknown at 05:28, 7 February 2021