Showing posts with label Number Patterns. Show all posts
Showing posts with label Number Patterns. Show all posts
Number Pattern : 29
Program:
#include <stdio.h>
int main()
{
int i,j,n;
printf("How many lines: ");
scanf("%d",&n);
for(i=1; i<=n; i++)
{
for(j=1; j<i; j++)
{
printf(" ");
}
printf("%d", i);
for(j=1; j<=((n - i) * 2 - 1); j++)
{
printf(" ");
}
if(i != n)
printf("%d", i);
printf("\n");
}
for(i=n-1; i>=1; i--)
{
for(j=1; j<i; j++)
{
printf(" ");
}
printf("%d", i);
for(j=1; j<=((n - i ) * 2 - 1); j++)
{
printf(" ");
}
printf("%d", i);
printf("\n");
}
return 0;
}
Output:
#include <stdio.h>
int main()
{
int i,j,n;
printf("How many lines: ");
scanf("%d",&n);
for(i=1; i<=n; i++)
{
for(j=1; j<i; j++)
{
printf(" ");
}
printf("%d", i);
for(j=1; j<=((n - i) * 2 - 1); j++)
{
printf(" ");
}
if(i != n)
printf("%d", i);
printf("\n");
}
for(i=n-1; i>=1; i--)
{
for(j=1; j<i; j++)
{
printf(" ");
}
printf("%d", i);
for(j=1; j<=((n - i ) * 2 - 1); j++)
{
printf(" ");
}
printf("%d", i);
printf("\n");
}
return 0;
}
Output:
Subscribe to:
Posts (Atom)
x^y using recursion
Program: #include<stdio.h> int power(int a,int b); int main() { int x,y,ans; printf("Enter x and y:\n "); scanf(...
-
Program: #include<stdio.h> int main() { int i,j,n; printf("How many lines: "); scanf("%d",&n); fo...
-
Program: #include<stdio.h> int power(int a,int b); int main() { int x,y,ans; printf("Enter x and y:\n "); scanf(...
-
Program: #include<stdio.h> int main() { char ch; printf("Enter one character: "); scanf("%c",&ch); ...



















