Rotated Triangle Pattern

Rotated Triangle Pattern
Given an integer N, print the pattern as given in Example Input/Output section.
Note: N is always an odd number.

Boundary Condition(s):
1 <= N <= 9999

Input Format:
The first line contains N.

Output Format:
The first N lines contain the desired pattern.

Example Input/Output 1:
Input:
7

Output:
1
2 8
3 9 13
4 10 14 16
5 11 15
6 12
7

Example Input/Output 2:
Input:
5

Output:
1
2 6
3 7 9
4 8
5

#include <iostream>
using namespace std;
int main(int argc, char** argv)
{
int n,count = 1;
cin >> n;
int l=0,m=n;
int g = n;
int a[n][n] = {0};
for(int j=0;j<n;j++)
{
    for(int i=l;i<m;i++)
    {
        a[i][j] = count;
        count ++;
    }
    l++;
    m--;
}
for(int i=0;i<n/2+1;i++)
{
    for(int j=0;j<=i;j++)
    {
        cout << a[i][j] << " ";
    }
    cout << endl;
}
for(int i=n/2+1;i<n;i++)
{
    for(int j = 0;j < g; j++)
    {
        if(a[i][j] != 0)
        cout << a[i][j] << " ";
    }
    cout << endl;
    g--;
}
}
n = int(input())
count = 1
l, m = 0, n
g = n
a = [[0 for _ in range(n)] for _ in range(n)]
for j in range(n):
    for i in range(l, m):
        a[i][j] = count
        count += 1
    l += 1
    m -= 1

for i in range(n//2 + 1):
    for j in range(i + 1):
        print(a[i][j], end=" ")
    print()

for i in range(n//2 + 1, n):
    for j in range(g):
        if a[i][j] != 0:
            print(a[i][j], end=" ")
    print()
    g -= 1
#include <stdio.h>

int main() {
    int n, count = 1;
    scanf("%d", &n);
    int l=0, m=n;
    int g = n;
    int a[n][n];

    for(int i=0; i<n; i++)
        for(int j=0; j<n; j++)
            a[i][j] = 0;

    for(int j=0; j<n; j++) {
        for(int i=l; i<m; i++) {
            a[i][j] = count;
            count++;
        }
        l++;
        m--;
    }

    for(int i=0; i<n/2+1; i++) {
        for(int j=0; j<=i; j++) {
            printf("%d ", a[i][j]);
        }
        printf("n");
    }

    for(int i=n/2+1; i<n; i++) {
        for(int j = 0; j<g; j++) {
            if(a[i][j] != 0)
                printf("%d ", a[i][j]);
        }
        printf("n");
        g--;
    }

    return 0;
}
import java.util.Scanner;

public class RotatedTrianglePattern {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int count = 1;
        int l = 0, m = n;
        int g = n;
        int[][] a = new int[n][n];

        for(int j=0; j<n; j++) {
            for(int i=l; i<m; i++) {
                a[i][j] = count;
                count++;
            }
            l++;
            m--;
        }

        for(int i=0; i<n/2+1; i++) {
            for(int j=0; j<=i; j++) {
                System.out.print(a[i][j] + " ");
            }
            System.out.println();
        }

        for(int i=n/2+1; i<n; i++) {
            for(int j=0; j<g; j++) {
                if(a[i][j] != 0)
                    System.out.print(a[i][j] + " ");
            }
            System.out.println();
            g--;
        }
        sc.close();
    }
}

Leave a Reply

Your email address will not be published. Required fields are marked *

More posts. You may also be interested in.