Pattern Problem with Solution
C PROGRAMMING के कुछ Pattern PROBLEM का SOLUTIONS. 👇
1. Pattern 1*
* *
* * *
* * * *
* * * * *
#include<stdio.h>
#include<conio.h>
void main()
{
int i, j, n=5;
clrscr();
for(i=1; i<=n; i++)
{
for(j=1; j<=i; j++)
{
printf(" *");
}
printf("\n");
}
getch();
}
2. Pattern 2* * * * *
* * * *
* * *
* *
*
#include<stdio.h>#include<conio.h>void main(){ int i, j, n=5; clrscr(); for(i=n; i>=1; i--) { for(j=1;j<=i;j++) { printf(" *"); } printf("\n"); } getch();}
3. Pattern 3
*
* *
* * *
* * * *
* * * * *
#include<stdio.h>#include<conio.h>void main(){ int i, j, k, a=4, n=5; for (i=1; i<=n; i++) { for (k=1; k<=a; k++) { printf(" "); }a--; for (j=1; j<=i; j++) { printf(" *"); } printf("\n"); } getch();}
4. Pattern 4
1
1 2
1 2 3
1 2 3 4
1 2 3 4 5
#include<stdio.h>#include<conio.h>void main(){ int i, j, n=5 for (i=1; i< n; i++) { for (j=1; j<=i; j++) { printf("%d ", j); } printf("\n"); } getch();}
5. Pattern 5
1
2 1
3 2 1
4 3 2 1
5 4 3 2 1
#include <stdio.h>
#include<conio.h>
void main()
{
int i, j, n=5;
for (i = 1; i <= n; i++)
{
for (j = i; j >= 1; j--)
{
printf("%d ", j);
}
printf("\n");
}
getch();
}
6. Pattern 6A
B C
D E F
G H I J
K L M N O
#include<stdio.h>
#include<conio.h>
void main()
{
int i, j, n;
clrscr();
printf("Enter number : ");
scanf("%d", &n);
int c = 'A';
for (i = 0; i < n; i++)
{
for (j = 0; j <= i; j++)
{
printf("%c", c);
c = c + 1;
}
printf("\n");
}
getch();
}
7. Pattern 71
1 2 1
1 2 3 2 1
1 2 3 4 3 2 1
1 2 3 4 5 4 3 2 1
#include<stdio.h>
#include<conio.h>
void main()
{
int i, j, n=5;
clrscr();
for (i = 1; i <= n; i++)
{
for (j = 1; j <= i; j++)
printf("%d", j);
for (j = i - 1; j >= 1; j--)
printf("%d", j);
printf("\n");
}
getch();
}
8. Pattern 8 (Binary Pattern)1
0 1
1 0 1
0 1 0 1
1 0 1 0 1
#include<stdio.h>
#include<conio.h>
void main()
{
int i, j;
clrscr();
for (i = 1; i <= 5; i++)
{
for (j = 1; j <= i; j++)
{
if ((i+j)%2==0)
{
printf("1");
}
else
{
printf("0");
}
}
printf("\n");
}
getch();
}
9. Pattern 91 2 3 4 5
1 2 3 4
1 2 3
1 2
1
#include<stdio.h>
#include<conio.h>
void main()
{
int i, j;
clrscr();
for (i = n; i >= 1; i--)
{
for (j = 1; j <= i; j++)
printf("%d", j);
printf("\n");
}
getch();
}
10. Pattern 101
2 1
3 2 1
4 3 2 1
5 4 3 2 1
#include<stdio.h>
#include<conio.h>
void main()
{
int i, j, k;
clrscr();
for (i = 1; i <= 5; i++)
{
for (j = 5; j >= 1; j--)
{
if (j <= i)
{
printf("%d", j);
}
else
{
printf(" ");
}
}
printf("\n");
}
getch();
}
11. Pattern 111 1
1 2 2 1
1 2 3 3 2 1
1 2 3 4 4 3 2 1
#include<stdio.h>
#include<conio.h>
void main()
{
int i, j, k;
clrscr();
for (i = 1; i <= 5; i++)
{
for (j = 1; j <= 5; j++)
{
if (j <= i)
{
printf("%d ", j);
}
else
{
printf(" ");
}
}
for (j = 5; j >= 1; j--)
{
if (j <= i)
{
printf("%d ", j);
}
else
{
printf(" ");
}
}
printf("\n");
}
getch();
}
12. Floyd's triangle1
2 3
4 5 6
7 8 9 10
11 12 13 14
#include<stdio.h>
#include<conio.h>
void main()
{
int n, i, c, a = 1;
clrscr();
printf("Enter the number of rows : ");
scanf("%d", &n);
for (i = 1; i <= n; i++) {
for (c = 1; c <= i; c++) {
printf("%d ", a);
a++;
}
printf("\n");
}
getch();
}
12. Pyramid 1
*
* *
* * *
* * * *
* * * * *
#include<stdio.h>
#include<conio.h>
void main()
{
int row, c, n, temp;
clrscr();
printf("Enter the number of rows : ");
scanf("%d", &n);
temp = n;
for (row = 1; row <= n; row++)
{
for (c = 1; c < temp; c++)
printf(" ");
temp--;
for (c = 1; c <= 2 * row - 1; c++)
printf("*");
printf("\n");
}
getch();
}
13. Pyramid 2
*
*A*
*A*A*
*A*A*A*
*A*A*A*A*
#include<stdio.h>
#include<conio.h>
void main()
{
int n, c, k, space, count = 1;
clrscr();
printf("Enter the number of rows : ");
scanf("%d", &n);
space = n;
for (c = 1; c <= n; c++)
{
for (k = 1; k < space; k++)
printf(" ");
for (k = 1; k <= c; k++)
{
printf("*");
if (c > 1 && count < c)
{
printf("A");
count++;
}
}
printf("\n");
space--;
count = 1;
}
getch();
}
14. Number Pyramid
1
232
34543
4567654
567898765
#include<stdio.h>
#include<conio.h>
void main()
{
int n, c, d, num = 1, space;
clrscr();
printf("Enter the number of rows : ");
scanf("%d", &n);
space = n - 1;
for (d = 1; d <= n; d++)
{
num = d;
for (c = 1; c <= space; c++)
printf(" ");
space--;
for (c = 1; c <= d; c++)
{
printf("%d", num);
num++;
}
num--;
num--;
for (c = 1; c < d; c++)
{
printf("%d", num);
num--;
}
printf("\n");
}
getch();
}
15. Pascal triangle
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
#include<stdio.h>
#include<conio.h>
long fact(int);
void main()
{
int line, i, j;
clrscr();
printf("Enter the number : ");
scanf("%d", &line);
for (i = 0; i < line; i++)
{
for (j = 0; j < line - i - 1; j++)
{
printf(" ");
}
for (j = 0; j <= i; j++)
{
printf("%ld ", fact(i) / (fact(j) * fact(i - j)));
}
printf("\n");
}
getch();
}
long fact(int num)
{
long f = 1;
int i = 1;
while (i <= num)
{
f = f * i;
i++;
}
return f;
}
16. Pascal triangle without using function
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
#include<stdio.h>
#include<conio.h>
void main()
{
int x, y, n, a, z, s;
clrscr();
printf("Enter the number : ");
scanf("%d", &n);
s = n;
for (x = 0; x <= n; x++)
{
a = 1;
for (z = s; z >= 0; z--)
printf(" ");
s--;
for (y = 0; y <= x; y++)
{
printf("%d ", a);
a = (a * (x - y) / (y + 1));
}
printf("\n");
}
getch();
}
17. Pascal triangle 2
1
121
12321
1234321
123454321
#include<stdio.h>
#include<conio.h>
void main()
{
int n, c, k, number = 1, space = n;
clrscr();
printf("Enter number of rows : ");
scanf("%d", &n);
printf("\n");
space = n;
for (c = 1; c <= n; c++)
{
for (k = space; k > 1; k--)
printf(" ");
space--;
for (k = 1; k <= 2 * c - 1; k++)
{
if (k <= c)
{
printf("%d", number);
if (k < c)
number++;
}
else
{
number--;
printf("%d", number);
}
}
number = 1;
printf("\n");
}
getch();
}
18. Number Alphabet Pattern
1
A B
2 3 4
C D E F
5 6 7 8 9
G H I J K L
#include<stdio.h>
#include<conio.h>
void main()
{
int num, r, c;
int i = 1;
char ch = 'A';
clrscr();
printf("Enter the number of rows : ");
scanf("%d", &num);
printf("\n");
for (r = 1; r <= num; r++)
{
for (c = 1; c <= r; c++)
{
if (r % 2 == 0)
{
printf(" %c", ch++);
}
else
{
printf(" %d", i++);
}
}
printf("\n");
}
getch();
}
19. Number Diamond Pattern
1
1 2 3
1 2 3 4 5
1 2 3 4 5 6 7
1 2 3 4 5 6 7 8 9
1 2 3 4 5 6 7
1 2 3 4 5
1 2 3
1
#include<stdio.h>
#include<conio.h>
void main()
{
int i, j, k;
clrscr();
for(i=1;i<=5;i++)
{
for(j=i;j<5;j++)
{
printf(" ");
}
for(k=1;k<(i*2);k++)
{
printf("%d",k);
}
printf("\n");
}
for(i=4;i>=1;i--)
{
for(j=5;j>i;j--)
{
printf(" ");
}
for(k=1;k<(i*2);k++)
{
printf("%d",k);
}
printf("\n");
}
getch();
}
20. Diamond of Numbers
1
2 2 2
3 3 3 3 3
4 4 4 4 4 4 4
5 5 5 5 5 5 5 5 5
4 4 4 4 4 4 4
3 3 3 3 3
2 2 2
1
#include<stdio.h>
#include<conio.h>
void main()
{
int i, j, k;
clrscr();
for (i = 1; i <= 5; i++)
{
for (j = i; j < 5; j++)
{
printf(" ");
}
for (k = 1; k < (i * 2); k++)
{
printf("%d", i);
}
printf("\n");
}
for (i = 4; i >= 1; i--)
{
for (j = 5; j > i; j--)
{
printf(" ");
}
for (k = 1; k < (i * 2); k++)
{
printf("%d", i);
}
printf("\n");
}
getch();
}
21. Diamond Pattern
•
• • •
• • • • •
• • •
•
#include<stdio.h>
#include<conio.h>
void main()
{
int n, c, k, space = 1;
clrscr();
printf("Enter number of rows : ");
scanf("%d", &n);
space = n - 1;
for (k = 1; k <= n; k++)
{
for (c = 1; c <= space; c++)
printf(" ");
space--;
for (c = 1; c <= 2 * k - 1; c++)
printf("•");
printf("\n");
}
space = 1;
for (k = 1; k <= n - 1; k++)
{
for (c = 1; c <= space; c++)
printf(" ");
space++;
for (c = 1; c <= 2 * (n - k) - 1; c++)
printf("•");
printf("\n");
}
getch();
}
22. Diamond star outline
*
* *
* *
* *
* *
* *
*
#include<stdio.h>
#include<conio.h>
void main()
{
int i, j;
clrscr();
for (i = 1; i <= 5; i++)
{
for (j = 5; j > i; j--)
{
printf(" ");
}
printf("*");
for (j = 1; j < (i - 1) * 2; j++)
{
printf(" ");
}
if (i == 1)
{
printf("\n");
}
else
{ printf("*\n"); }
}
for (i = 4; i >= 1; i--)
{
for (j = 5; j > i; j--)
{
printf(" ");
}
printf("*");
for (j = 1; j < (i - 1) * 2; j++)
{
printf(" ");
}
if (i == 1)
{
printf("\n");
}
else
{ printf("*\n"); }
}
getch();
}
23. Hollow Diamond
* * * * * * * *
* * * * * *
* * * *
* *
* * * *
* * * * * *
* * * * * * * *
#include<stdio.h>
#include<conio.h>
void main()
{
int i, j, k;
clrscr();
for (i = 1; i <= 5; i++)
{
for (j = 1; j <= 6 - i; j++)
{
printf("*");
}
for (k = 1; k < i; k++)
{
printf(" ");
}
for (j = 1; j <= 6 - i; j++)
{
printf("*");
}
printf("\n");
}
for (i = 2; i <= 5; i++)
{
for (j = 1; j <= i; j++)
{
printf("*");
}
for (k = 1; k <= 5 - i; k++)
{
printf(" ");
}
for (j = 1; j <= i; j++)
{
printf("*");
}
printf("\n");
}
getch();
}
24. Hollow Square
* * * * *
* *
* *
* *
* * * * *
#include<stdio.h>
#include<conio.h>
void main()
{
int i, j, n;
clrscr();
printf("Enter value of n : ");
scanf("%d", &n);
printf("\n");
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
{
if (i != 1 && i != n && j != 1 && j != n)
{
printf(" ");
}
else
{
printf("*");
}
}
printf("\n");
}
getch();
}
25. Hourglass Pattern
* * * * * * * * *
* * * * * * *
* * * * *
* * *
*
* * *
* * * * *
* * * * * * *
* * * * * * * * *
#include<stdio.h>
#include<conio.h>
void main()
{
int num, n, r, c, sp;
clrscr();
printf("Enter number of rows: ");
scanf("%d", &num);
printf("\n");
n = num;
for (r = 1; r <= num; r++)
{
for (sp = 1; sp <= r; sp++)
printf(" ");
for (c = 1; c <= n; c++)
printf("*");
for (c = num - r; c >= 1; c--)
printf("*");
n--;
printf("\n");
}
for (r = 2; r <= num; r++)
{
for (sp = num - r + 1; sp >= 1; sp--)
printf(" ");
for (c = 1; c <= r; c++)
printf("*");
for (c = r - 1; c >= 1; c--)
printf("*");
printf("\n");
}
getch();
}
26. Nested Star-Hash Pyramid
#####*#####
####*#*####
###*###*###
##*#####*##
#*#######*#
*#########*
#include<stdio.h>
#include<conio.h>
void main()
{
int n = 5, r, c;
clrscr();
for (r = 1; r <= 6; r++, n--)
{
// first pyramid
for (c = 1; c <= n; c++)
{
printf(" #");
}
// second pyramid
for (c = 1; c <= r; c++)
{
if (c == 1)
{
printf(" *");
}
else
{
printf(" #");
}
}
// third pyramid
for (c = r; c > 1; c--)
{
if (c == 2)
{
printf(" *");
}
else
{
printf(" #");
}
}
// fourth pyramid
for (c = n; c >= 1; c--)
{
printf(" #");
}
printf("\n");
}
getch();
}
27. Reverse star pyramid
* * * * * * * * *
* * * * * * *
* * * * *
* * *
*
#include<stdio.h>
#include<conio.h>
void main()
{
int i, j, k;
clrscr();
for (i = 5; i >= 1; i--)
{
for (j = 5; j > i; j--)
{
printf(" ");
}
for (k = 1; k < (i * 2); k++)
{
printf("* ");
}
printf("\n");
}
getch();
}
28. Rhombus Pattern
1 1
2 2
3 3
4 4
5 5
4 4
3 3
2 2
1 1
#include<stdio.h>
#include<conio.h>
void main()
{
int num, r, c, sp, n;
clrscr();
printf("Enter the number : ");
scanf("%d", &num);
for (r = 1; r <= num; r++)
{
for (sp = num - r; sp >= 1; sp--)
printf(" ");
printf("%d", r);
for (sp = r * 2; sp > 1; sp--)
printf(" ");
printf("%d", r);
printf("\n");
}
for (r = 1, n = num - 1; r < num; r++, n--)
{
for (sp = r; sp >= 1; sp--)
printf(" ");
printf("%d", n);
for (sp = n * 2; sp > 1; sp--)
printf(" ");
printf("%d", n);
printf("\n");
}
getch();
}
29. Square kite pattern
1
2 2
3 3
4 4
3 3
2 2
1
#include<stdio.h>
#include<conio.h>
void main()
{
int i, j, k;
clrscr();
for (i = 1; i <= 4; i++)
{
for (j = 4; j >= (i - 1) * 2 - 1; j--)
printf(" ");
printf("%d", i);
for (j = 2; j <= (i - 1) * 4; j++)
printf(" ");
if (i > 1)
printf("%d", i);
printf("\n");
}
for (i = 3; i >= 1; i--)
{
for (j = 4; j >= (i - 1) * 2 - 1; j--)
printf(" ");
printf("%d", i);
for (j = 2; j <= (i - 1) * 4; j++)
printf(" ");
if (i > 1)
printf("%d", i);
printf("\n");
}
getch();
}
30. Triangle with only border
#include<stdio.h>
#include<conio.h>
*
* *
* *
* *
* *
* *
* * * * * *
void drawTriangle(char border, char filler, int length)
{
int start = 2;
int base = 4;
int i, sp, j, b;
for (i = start; i <= length; i++)
{
for (sp = 0; sp <= length - i; sp++)
{
printf(" ");
}
if (i > start)
{
printf("%c ", border);
}
if (i > start)
{
for (b = base; b <= i; b++)
{
printf("%c ", filler);
}
}
printf("%c \n", border);
}
for (j = base; j < length + base; j++)
{
printf("%c ", border);
}
printf("\n");
}
void main()
{
int length = 6;
clrscr();
drawTriangle('*', ' ', length);
getch();
}
अगर ऊपर दिए गए Solution में आपको कोई Doubt है , तो निचे Comment करे हमारी Team जल्द ही आपकी सहायता करेंगे।
0 टिप्पणियाँ
अगर ऊपर दिए गए पाठ में आपको कोई Doubt है , तो Comment करे हमारी Team जल्द ही आपकी सहायता करेंगी।