patternprogram_384 softethics

Pattern 384

C

#include <stdio.h>

int main()
{
  int n = 7;  // prefer odd
  int i,j;
  int x = 1;

  for(i = 1; i <= n; i++)
  {
    for(j = 1; j <= x; j++)
    {
      if (j == x)
      {
        printf("%c ", i + 64);
      }
      else
      {
        printf("  ");
      }
    }
    printf("\n");
    if (i <= n / 2)
      x++;
    else
      x--;
  }
  return 0;
}

C++

#include <iostream.h>

int main()
{
  int n = 7;  // prefer odd
  
  int x = 1;

  for(int i = 1; i <= n; i++)
  {
    for(int j = 1; j <= x; j++)
    {
      if (j == x)
      {
        cout<<(char)(i + 64);
      }
      else
      {
        cout<<"  "; // 2ws
      }
    }
    cout<<endl;
    if (i <= n / 2)
      x++;
    else
      x--;
  }
  return 0;
}

Java

class PatternProg
{
	public static void main(String args[])
	{
	  int n = 7; // prefer odd

	  int x = 1;

	  for (int i = 1; i <= n; i++)
	  {
		for (int j = 1; j <= x; j++)
		{
		  if (j == x)
		  {
			System.out.print((char)(i + 64));
		  }
		  else
		  {
			System.out.print("  "); //2ws
		  }
		}
		System.out.println();
		if (i <= n / 2)
		{
		  x++;
		}
		else
		{
		  x--;
		}
	  }
	  
	}
}

C#

using System;

class PatternProg
{
  public static void Main()
  {
    int n = 7; // prefer odd

    int x = 1;

    for (int i = 1; i <= n; i++)
    {
      for (int j = 1; j <= x; j++)
      {
        if (j == x)
        {
          Console.Write((char)(i + 64));
        }
        else
        {
          Console.Write("  "); //2ws
        }
      }
      Console.WriteLine();
      if (i <= n / 2)
      {
        x++;
      }
      else
      {
        x--;
      }
    }

    Console.ReadKey(true);

  }
}

Python

n = 7  # prefer odd
d = 1

for x in range(1, n + 1):
  for y in range(1, d + 1):
    if y == d:
       print(chr(x + 64), end="")
    else:
       print("  ", end="")  # 2ws

  if x <= n // 2:
     d += 1
  else:
     d -= 1

  print()
0 0 votes
Rate this Program
Subscribe
Notify of
guest
0 Comments
Oldest
Newest Most Voted
Inline Feedbacks
View all comments