Binary right angle triangle consists of only 0’s and 1’s in alternate positions.
Examples :
Input : 4
Output :
0
1 0
0 1 0
1 0 1 0
Input : 3
Output :
0
1 0
0 1 0
C++
#include <stdio.h>
void binaryRightAngleTriangle( int n) {
int row, col;
for (row = 0; row < n; row++)
{
for (col = 0;col <= row; col++)
{
if (((row + col) % 2) == 0)
printf ( "0" );
else
printf ( "1" );
printf ( "\t" );
}
printf ( "\n" );
}
}
int main( void )
{
int n = 4;
binaryRightAngleTriangle(n);
return 0;
}
|
Java
class GFG
{
static void binaryRightAngleTriangle( int n)
{
int row, col;
for (row = 0 ; row < n; row++)
{
for (col = 0 ; col <= row; col++)
{
if (((row + col) % 2 ) == 0 )
System.out.print( "0" );
else
System.out.print( "1" );
System.out.print( "\t" );
}
System.out.print( "\n" );
}
}
public static void main (String[] args)
{
int n = 4 ;
binaryRightAngleTriangle(n);
}
}
|
Python3
def binaryRightAngleTriangle(n):
for row in range ( 0 , n):
for col in range ( 0 , row + 1 ):
if (((row + col) % 2 ) = = 0 ) :
print ( "0" , end = "")
else :
print ( "1" , end = "")
print ( "\t" , end = "")
print ("")
n = 4
binaryRightAngleTriangle(n)
|
C#
// C# program to print binary
// right angle triangle
using System;
class GFG
{
// function to print binary right
// angle triangle
static void binaryRightAngleTriangle(int n)
{
// declare row and column
int row, col;
for (row = 0; row < n; row++)
{
for (col = 0; col <= row; col++)
{
if (((row + col) % 2) == 0)
Console.Write("0");
else
Console.Write("1");
Console.Write("\t");
}
Console.WriteLine();
}
}
// Driver code
public static void Main ()
{
// no. of rows to be printed
int n = 4;
binaryRightAngleTriangle(n);
}
}
// This code is contributed
// by vt_m .
|
PHP
<?php
function binaryRightAngleTriangle( $n )
{
for ( $row = 0; $row < $n ; $row ++)
{
for ( $col = 0; $col <= $row ; $col ++)
{
if ((( $row + $col ) % 2) == 0)
printf( "0" );
else
printf( "1" );
printf( "\t" );
}
printf( "\n" );
}
}
$n = 4;
binaryRightAngleTriangle( $n );
?>
|
Output :
0
1 0
0 1 0
1 0 1 0
This article is contributed by Bishal Kumar Dubey. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.