RIGHT TRIANGLE STAR PATTERN

-
Consider the following I/O samples.

SAMPLE INPUT:  5

SAMPLE OUTPUT:   

   

                                   *
                                   * *
                                   * * *
                                   * * * *
                                   * * * * *  


C PROGRAM:  

#include<stdio.h>
int main()
{
   int n,row,col;
   scanf("%d",&n);
   printf("\n");
   for(row=1;row<=n;row++)
   {
       for(col=1;col<=row;col++)
        printf("* ");
    printf("\n");
   }
   return 0;
}

OUTPUT:

 




The given source code in C program is short and simple to understand. The source code is well tested in DEV-C++ and is completely error free. 

If you have any feedback about this article and want to improve this, please comment in the comment section.

 

Comments

Post a Comment

Popular posts from this blog

C PROGRAM TO PRINT ALL LEAP YEARS IN A GIVEN RANGE

-
Image
Consider the following I/O samples. SAMPLE INPUT :  200 300 SAMPLE OUTPUT:   204 208 212 216 220 224 228 232 236 240 244 248                                             252 256  260 264 268 272 276 280 284 288 292 296 C PROGRAM: #include <stdio.h> int checkLeapYear(int year) {     if( (year % 400==0)||(year%4==0 && year%100!=0) )         return 1;     else         return 0; }   int main() {     int i,n,s;     scanf("%d %d",&s,&n);     printf("Leap years from %d to %d:\n\n",s,n);     for(i=s;i<=n;i++)     {         if(checkLeapYear(i))             printf("%d ",i);     }     return 0; }   OUTPUT:      The ...
Read more

SPARSE MATRIX OR NOT

-
Image
Consider the following I/O samples. SAMPLE INPUT :      3                                            4 0 0                                             3 0 0                                     0 0 1 SAMPLE OUTPUT:   SPARSE MATRIX SPARSE MATRIX  is a  matrix   which contains very few non-zero elements .   In the above example,   number of non - zero elements are : 6                                                  number of zero's : 10  ...
Read more

C PROGRAM TO CHECK BALANCED PARENTHESIS - ( { [

-
Image
Consider the following I/O samples. SAMPLE INPUT 1:  [ { ( )  } ]             SAMPLE OUTPUT 1 :   VALID         SAMPLE INPUT 2:  [ { ] } SAMPLE OUTPUT 1 :   INVALID   C PROGRAM: #include<stdio.h> #include<string.h> #define N 100 char stack[N]; int i=-1; //push parenthesis into stack void push(char data)                 {     i++;     if(i>=N)         printf("Stack is full");     else         stack[i]=data; } //pop parenthesis out from the stack void pop() {     if(i == -1)         printf("Cannot remove");     else         i--; } char top() {     return stack[i]; } int empty() {     if(i == -1)         return 1;  // stack empty     else     ...
Read more