C Language Programs
41. 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
42. Diamond Pattern
•
• • •
• • • • •
• • •
•
43. Diamond star outline
*
* *
* *
* *
* *
* *
*
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
42. Diamond Pattern
•
• • •
• • • • •
• • •
•
43. Diamond star outline
*
* *
* *
* *
* *
* *
*
44. Hollow Diamond
* * * * * * * *
* * * * * *
* * * *
* *
* * * *
* * * * * *
* * * * * * * *
45. Hollow Square
* * * * *
* *
* *
* *
* * * * *
46. Hourglass Pattern
* * * * * * * * *
* * * * * * *
* * * * *
* * *
*
* * *
* * * * *
* * * * * * *
* * * * * * * * *
47. Nested Star-Hash Pyramid
#####*#####
####*#*####
###*###*###
##*#####*##
#*#######*#
*#########*
48. Reverse star pyramid
* * * * * * * * *
* * * * * * *
* * * * *
* * *
*
49. Rhombus Pattern
1 1
2 2
3 3
4 4
5 5
4 4
3 3
2 2
1 1
50. Square kite pattern
1
2 2
3 3
4 4
3 3
2 2
1
51. Triangle with only border
*
* *
* *
* *
* *
* *
* * * * * *
52. Program to accept number and print it's factorial
53. Program to accept number and print if it is prime number or not.
54. Program to print 'n' prime numbers.
55. Program to accept a number and print Fibonacci sequence
56. Add 'n' numbers.
57. Add 'n' numbers using array.
58. Program to accept a number and add the digits of that number.
59. Program to accept a number and add the digits of that number using recursion.
60. Average of numbers.
Code
41. 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();
}
42. 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();
}
43. 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();
}
44. 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();
}
45. 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();
}
46. 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();
}
47. 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();
}
48. 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();
}
49. 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();
}
50. 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();
}
51. 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();
}
52. Program to accept number and print it's factorial.
#include<stdio.h>
#include<conio.h>
void main()
{
int i, fact=1, n;
clrscr();
printf("Enter number : ");
scanf("%d", &n);
for(i=1; i<=n; i++)
{
fact = fact*i;
}
printf("Factorial is: %d", fact);
getch();
}
53. Program to accept number and print if it is prime number or not.
#include<stdio.h>
#include<conio.h>
void main()
{
int i, n;
clrscr();
printf("Enter number : ");
scanf("%d", &n);
for(i=2; i<=n/2; i++)
{
if(n%i==0)
{
printf("Number is not Prime");
getch();
break;
}
}
printf("Number is Prime");
getch();
}
54. Program to print 'n' prime numbers.
#include<stdio.h>
#include<conio.h>
#include<process.h>
void main()
{
int i, j, flag=1, n;
clrscr();
printf("Enter number : ");
scanf("%d", &n);
for(i=2; i<=n; i++)
{
flag=1;
for(j=2; j<=i/2; j++)
{
if(i%j==0)
{
flag=0;
break;
}
}
if(flag==1)
printf("%d\n", i);
}
getch();
}
55. Program to accept a number and print Fibonacci sequence.
#include<stdio.h>
#include<conio.h>
void main()
{
int pre=1, cur=1, temp, i, n;
//pre means previous number
//cur means current number
clrscr();
printf("Enter number : ");
scanf("%d", &n);
printf("%d\t%d", pre, cur);
for(i=3; i<=n; i++)
{
temp = cur;
cur = pre + cur;
pre = temp;
printf("\t%d", cur);
}
getch();
}
56. Add 'n' numbers.
#include<stdio.h>
#include<conio.h>
void main()
{
int n, sum=0, i, value;
clrscr();
printf("Enter total numbers you want to add : ");
scanf("%d", &n);
for (i=1; i<=n; i++)
{
printf("Enter number %d : ", i);
scanf("%d", &value);
sum = sum + value;
}
printf("Sum of entered numbers : %d", sum);
getch();
}
57. Add 'n' numbers using array.
#include<stdio.h>
#include<conio.h>
void main()
{
int n, sum = 0, i, array[100];
clrscr();
printf("Enter total numbers you want to add : ");
scanf("%d", &n);
for (i = 1; i <= n; i++)
{
printf("Enter number %d : ", i);
scanf("%d", &array[i]);
sum = sum + array[i];
}
printf("Sum : %d\n", sum);
getch();
}
58. Program to accept a number and add the digits of that number.
#include<stdio.h>
#include<conio.h>
void main()
{
int n, sum = 0, remainder;
clrscr();
printf("Enter the number : ");
scanf("%d", &n);
while (n != 0)
{
remainder = n % 10;
sum = sum + remainder;
n = n / 10;
}
printf("Sum of digits of entered number : %d", sum);
getch();
}
59. Program to accept a number and add the digits of that number using recursion.
#include<stdio.h>
#include<conio.h>
int add_digits(int);
void main()
{
int n, result;
clrscr();
printf("Enter a number : ");
scanf("%d", &n);
result = add_digits(n);
printf("Sum : %d", result);
getch();
}
int add_digits(int n)
{
static int sum = 0;
if (n == 0)
{
return 0;
}
sum = n % 10 + add_digits(n / 10);
return sum;
}
60. Average of numbers.
#include<stdio.h>
#include<conio.h>
void main()
{
int n, i;
float sum=0, x, avg;
clrscr();
printf("Enter total Numbers : ");
scanf("%d", &n);
for (i = 1; i <= n; i++)
{
printf("\nNumber %d : ", i );
scanf("%f", &x);
sum += x;
}
avg = sum / n;
printf("\nThe Average is : %0.2f", avg);
getch();
}
THANK YOU
0 Comments