patternprogram_399 softethics

Pattern 399

C

#include<stdio.h>

#include<math.h>
int main()
{
  int size=3;
  int i,j,k;
  int p=1;

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


    for(k=size; k>=abs(i); k--)
    {
      printf("%d ",p);
    }


    if(i>0)
      p++;
    else
      p--;

    printf("\n");
  }
  return 0;
}

C++

 #include<iostream.h>
 #include<math.h>
 int main()
 {
 int size=4;
 int i,j,k;
 int p=1;

 for(i=size;i>=-size;i--)
 {
  for(j=1;j<=abs(i);j++)
  {
   cout<<" ";
  }
 
  for(k=size;k>=abs(i);k--)
  {
   cout<<p<<" ";
  }


 if(i>0)
  p++;
 else
  p--;

 cout<<endl;
 }
}

Java

class PatternProg
{
    public static void main(String args[])
    {
        int size = 4;
        int p = 1;

        for (int i = size; i >= -size; i--)
        {
            for (int j = 1; j <= Math.abs(i); j++)
            {
                System.out.print(" ");
            }

            for (int k = size; k >= Math.abs(i); k--)
            {
                System.out.print(p+" ");
            }

            if (i > 0)
                p++;
            else
                p--;

            System.out.println();
        }
    }
}

C#

using System;

class PatternProg
{
  public static void Main()
  {
    int size = 4;
    int p = 1;
    for (int i = size; i >= -size; i--)
    {
      for (int j = 1; j <= Math.Abs(i); j++)
      {
        Console.Write(" ");
      }

      for (int k = size; k >= Math.Abs(i); k--)
      {
        Console.Write(p + " ");
      }

      if (i > 0)
      {
        p++;
      }
      else
      {
        p--;
      }

      Console.WriteLine();
    }
    Console.ReadKey(true);
  }
}

Python

size = 4
p = 1
for x in range(size, -(size + 1), -1):
    for y in range(1, abs(x) + 1):
        print(" ", end="")
    for z in range(size, abs(x) - 1, -1):
        print(str(p) + " ", end="")
    if (x > 0):
        p += 1
    else:
        p -= 1
    print()
0 0 votes
Rate this Program
Subscribe
Notify of
guest
0 Comments
Oldest
Newest Most Voted
Inline Feedbacks
View all comments