KEMBAR78
C - C++ Impotant Codes | PDF | Computer Science | Computer Programming
0% found this document useful (0 votes)
17 views8 pages

C - C++ Impotant Codes

The document provides various C programming rules and examples for calculating factorials, checking for prime numbers, listing prime numbers, counting even and odd numbers, finding maximum and minimum values, calculating GCD and LCM, generating Fibonacci series, checking for palindromes, and identifying Armstrong numbers. Each section includes multiple methods for achieving the same task, using different control structures like for loops, while loops, and do-while loops. The document serves as a comprehensive guide for basic programming tasks in C.

Uploaded by

sweetyfarhana5
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
17 views8 pages

C - C++ Impotant Codes

The document provides various C programming rules and examples for calculating factorials, checking for prime numbers, listing prime numbers, counting even and odd numbers, finding maximum and minimum values, calculating GCD and LCM, generating Fibonacci series, checking for palindromes, and identifying Armstrong numbers. Each section includes multiple methods for achieving the same task, using different control structures like for loops, while loops, and do-while loops. The document serves as a comprehensive guide for basic programming tasks in C.

Uploaded by

sweetyfarhana5
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

1.

Find out factorial of an integer number


Rull: 1 Factorial of an integer Using for loop Rull: 2 Factorial Using while loop
#include<stdio.h> main()
main() {
{ int fact=1,n;
int i,n,fact=1; printf("Enter any positive integer: ");
printf("Enter any positive number: "); scanf("%d",&n);
scanf("%d",&n); while(n!=0) { //here we also used n>0
for(i=1;i<=n;i++) fact=fact*n;
fact=fact*i; n--;
printf("The factorial of %d is %d",n,fact); }
} printf("The factorial of %d is: %d",n,fact);
}
Rull: 3 Factorial Using while loop Rull: 4 Factorial Using do while loop
main() main()
{ {
int i=1,fact=1,n; int fact=1,n;
printf("Enter any positive integer: "); printf("Enter any positive integer: ");
scanf("%d",&n); scanf("%d",&n);
while(i<=n) { //here we also used do
n>0 { if(n==0) { break; }
fact=fact*i; fact=fact*n;
i++; n--;
} }while(n!=0);
printf("The factorial of %d is: %d",n,fact); printf("The factorial of %d is: %d",n,fact);
} }
2. Find out a number is Prime or Not Prime
Rull: 1 Find out Prime number Rull 2: Find out Prime number
#include <stdio.h> main()
main() { int i,isprime=1,n;
{ printf("Enter any positive integer: ");
int i,j,n; scanf("%d",&n);
printf("Enter any positive integer: "); for(i=2;i<n;i++) //** i<=n/2 or i<=sqrt(n)
scanf("%d",&n); if(n%i==0)
for(i=2;i<n;i++) {
if(n%i==0){ isprime=0;
printf("%d is Not Prime",n); break;
break; }
} if(isprime==1)
if(i==n) printf("%d is Prime",n);
printf("%d is Prime",n); else
}//Also try using while or do while loop (Easy) printf("%d is Not Prime",n); }
3. List Prime number from 1 to n
Rull 1: List Prime number from 1 to n Rull 2: List Prime number from 20 to 50
main() #include<stdio.h>
{ #include<math.h>
int i,j,isprime,n; int main()
printf("Enter any positive integer: "); {
scanf("%d",&n); int i,j,isprime,n1,n2;
printf("Enter lower and upper limit: ");
printf("Prime numbers from 1 to %d scanf("%d%d",&n1,&n2);
are:\n",n); printf("Prime numbers from %d to %d
for(i=2;i<=n;i++){ are:\n",n1,n2);
isprime=1; for(i=n1;i<=n2;i++){
for(j=2;j<i;j++) //we also used j<=sqtr(i) isprime=1;
if(i%j==0){ for(j=2;j<=sqrt(i);j++)
isprime=0; if(i%j==0){
break; isprime=0;
} break;
if(isprime==1) }
printf("%4d",i); if(isprime==1)
} printf("%4d",i);
} }
}
4. Count how many Prime number from 1 to n and list them
Rull 1: Count Prime number from 1 to n and Rull 1: Count Prime number from 1 to n and
list them list them
main() main()
{ {
int i,j,isprime,n,count=0; int i,j,isprime,n1,n2,count=0;
printf("Enter any positive integer: "); printf("Enter lower and upper limit: ");
scanf("%d",&n); scanf("%d%d",&n1,&n2);
printf("Prime numbers from %d to %d
printf("Prime numbers from 1 to %d are:\n",n1,n2);
are:\n",n); for(i=n1;i<=n2;i++){
for(i=2;i<=n;i++){ isprime=1;
isprime=1; for(j=2;j<=sqrt(i);j++)
for(j=2;j<=sqrt(i);j++) //we also used if(i%j==0){
j<=sqtr(i) isprime=0;
if(i%j==0){ break;
isprime=0; }
break; if(isprime==1){
} printf("%4d",i);
if(isprime==1){ count++;
count++; }
printf("%4d",i); }
} printf("\nTotal Prime number is: %d",count);
} }
printf("\n Total prime number is:
%d",count);
}
5. Find out How many divisor of a number
Rull 1: Count total divisor of a number and Rull 2: Count total prime divisor
list them main()
main() {
{ int i,j,count=0,n;
int i,j,count=0,n; printf("Enter any positive integer: ");
printf("Enter any positive integer: "); scanf("%d",&n);
scanf("%d",&n); printf("The divisor of %d are: ",n);
printf("The divisor of %d are: ",n); for(i=2;i<n;i++)
for(i=1;i<=n;i++) if(n%i==0)
if(n%i==0) {
{ printf("%4d",i);
printf("%4d",i); count++;
count++; }
} printf("\nTotal divisor are: %d",count);
printf("\nTotal divisor are: %d",count); }
}
6. Count total Even and Odd number from 1 to n and list them
Rull 1: Count total Even and odd number Rull 2: Count total Even number
main() main()
{ {
int i,n,count=0,mark=0; int i,n,count=0;
printf("Enter any positive number: "); printf("Enter any positive number: ");
scanf("%d",&n); scanf("%d",&n);
printf("Even number from 1 to %d is: printf("\nEven number from 1 to %d is:
\n",n); ",n);
for(i=2;i<=n;i=i+2) for(i=1;i<=n;i++)
{ if(i%2==0){
printf("%4d",i); printf("%4d",i);
count++; count++;
} }
printf("\nTotal Even number is: %d",count); printf("\nTotal Even number is: %d",count);
printf("\n\nOdd number from 1 to %d is: }
\n",n);
for(i=1;i<=n;i=i+2){
printf("%4d",i);
mark++;
}
printf("\nTotal Odd number is: %d",mark);
}
Rull 3: Count total Odd and Even number
int main() else
{ {
int i,n,count=0,mark=0; printf("%6d",i);
printf("Enter any positive number: "); mark++;
scanf("%d",&n); }
printf(" Odd Even: \n"); }
printf(" ---- ----");
for(i=1;i<=n;i++){ printf("\nTotal Even number: %d\nTotal Odd
if(i%2!=0){ number: %d",mark,count);
printf("\n%4d",i); }
count++;
}
7. Find out maximum and minimum number from n number using array
Rull 1: Maximum number from n number Rull 2: Maximum number from n number
main() main()
{ {
int i,n,max=0; int i,n,max;
printf("Enter how many number: "); printf("Enter how many number: ");
scanf("%d",&n); scanf("%d",&n);
int a[n]; int a[n];
printf("Enter the %d number: \n",n); printf("Enter the %d number: \n",n);
for(i=0;i<n;i++) for(i=0;i<n;i++)
scanf("%d",&a[i]); scanf("%d",&a[i]);
max=a[0];
for(i=0;i<n;i++) for(i=0;i<n;i++)
if(a[i]>max) if(a[i]>max)
max=a[i]; max=a[i];
printf("\nThe maximum number is: %d",max); printf("\nThe maximum number is: %d",max);
} }
Rull 1: Minimum number Rull 2: Minimum number from n number
main() main()
{ {
int i,n,min; int i,n,min;
printf("Enter how many number: "); printf("Enter how many number: ");
scanf("%d",&n); scanf("%d",&n);
int a[n]; int a[n];
printf("Enter the %d number: \n",n); printf("Enter the %d number: \n",n);
for(i=0;i<n;i++) for(i=0;i<n;i++)
scanf("%d",&a[i]); scanf("%d",&a[i]);
min=a[0];
for(i=0;i<n;i++) for(i=0;i<n;i++)
if(a[i]<min) if(a[i]<min)
min=a[i]; min=a[i];
printf("\nThe minimum number is: %d",min); printf("\nThe minimum number is: %d",min);
} }
Rull : 1 Maximum and Minimum from n number Rull : 1 Maximum and Minimum from n number
main() for(i=0;i<n;i++)
{ if(a[i]<min)
int i,n,min,max=0; min=a[i];
printf("Enter how many number: ");
scanf("%d",&n); for(i=0;i<n;i++)
int a[n]; if(a[i]>max)
printf("Enter the %d number: \n",n); max=a[i];
for(i=0;i<n;i++) printf("\nThe minimum number is: %d\nThe
scanf("%d",&a[i]); maximum number is: %d",min,max);
}
8. Find out the GCD of two number
Rull 1: Find out GCD using while loop Rull 2: Find out GCD using while loop
main() #include<stdio.h>
{ main()
int a,b,x; {
printf("Enter two positive integer: "); int a,b,c;
scanf("%d%d",&a,&b); printf("Enter two positive integer: ");
x=(a>b)?b:a; scanf("%d%d",&a,&b);
while(a%b!=0)
while(x!=0) //we also used while(1) {
{ c=a%b;
if(a%x==0 && b%x==0) a=b;
{ b=c;
printf("The GCD of %d and %d is: }
%d",a,b,x); printf("The GCD: %d",b);
break; }
}
x--;
}
}//Apply do while loop
Rull : 3 GCD of two number using for loop Rull : 4 GCD of two number using for loop
main() main()
{ {
int i,a,b,x; int a,b,i,gcd;
printf("Enter two positive integer: "); printf("Enter Two number: ");
scanf("%d%d",&a,&b); scanf("%d%d",&a,&b);
x=(a>b)?b:a;
for(i=x;i<=a && i<=b;i--) for(i=1;i<=a &&i<=b; i++){
if(a%i==0 &&b%i==0) if(a%i==0 &&b%i==0)
{ gcd=i;
printf("GCD is: %d",i);
break; }
} printf("GCd: %d",gcd);
} }
9. Find out the LCM of two number
Rull 1: Find out LCM using while loop Rull 2: Find out LCM using while loop
main()
main() {
{ int i,a,b,x,lcm,gcd;
int i,a,b,x; printf("Enter two positive integer: ");
printf("Enter two positive integer: "); scanf("%d%d",&a,&b);
scanf("%d%d",&a,&b); x=(a>b)?b:a;
x=(a<b)?b:a; while(x!=0)
while(x!=0) //we also used while(1) {
{ if(a%x==0 && b%x==0)
if(x%a==0 && x%b==0) {
{ printf("GCD of %d and %d is:
printf("LCM of %d and %d is: %d",a,b,x);
%d",a,b,x); gcd=x;
break; break;
} }
x++; x--;
} }
} lcm=a*b/gcd;
//try do while loop printf("\n\nLCM of %d and %d is:
%d",a,b,lcm);
}
Rull :3 LCM using while loop Rull :3 LCM using while loop
main()
{ if(i%a==0 && i%b==0)
int i,a,b,x; {
printf("Enter two positive integer: "); printf("LCM of %d and %d is:
scanf("%d%d",&a,&b); %d",a,b,i);
x=(a>b)?a:b; break;
for(i=x;i>=a&&i>=b;i++) }
}

10. Find out n’th Fibonacci series


Rull 1: Find out Fibonacci series using for Rull 2: Find out Fibonacci series using while
loop loop
#include<stdio.h> main()
main() {
{ int n,i,a=0,b=1,c;
int n,i,a=0,b=1,c; printf("Enter how many term: ");
printf("Enter how many term: "); scanf("%d",&n);
scanf("%d",&n); i=n;
for(i=1;i<=n;i++) //also used a<=n in while(i!=0)
replace i<=n {
{ printf("%4d",a);
printf("%4d",a); c=a+b;
c=a+b; a=b;
a=b; b=c;
b=c; i--;
} }
} }
11. Find out Palindrome number
//Find out Palindrome number //Find out Palindrome String
main() #include <stdio.h>
{ #include <string.h>
int n,i,temp,sum=0,r; int main()
printf("Enter any number: "); {
scanf("%d",&n); char a[100], b[100];
temp=n;
printf("Enter the String: ");
while(n!=0) //we also used while(n) gets(a);
{
r=n%10; strcpy(b, a); // Copying input string
n=n/10; strrev(b); // Reversing the string
sum=sum*10+r;
} if (strcmp(a, b) == 0) // Comparing input
string with the reverse string
if(temp==sum) printf("Palindrome\n");
printf("%d is Palendrome else
number.",temp); printf("Not Palindrome\n");
else
printf("%d is not Palendrome return 0;
number.",temp); }
}

12. Find out Armstrong Number 13. Power of Two Number (X^Y)
//Find out Armstrong Number Rull : 1 Power of Two number using library
main() function
{
int n,i,temp,sum=0,r; #include<stdio.h>
printf("Enter any number: "); main()
scanf("%d",&n); {
temp=n;
while(n!=0) int x,y;
{ float r;
r=n%10; printf("Enter Base and Exponant value : ");
n=n/10; scanf("%d%d",&x,&y);
sum=sum+r*r*r; r=pow(x,y);
} printf("Result: %.2f",r);
if(temp==sum) }
printf("%d is Armstrong number.",temp); Actually if we used int r, then there are small
else error in result, in input x=5 y=3; to minimize
printf("%d is not Armstrong this we used float.
number.",temp);
}
Rull : 2 Power of Two number without library 14. Enter any number and reverse it.
function main()
main() {
{ int i,n,temp,r,sum=0;
int x,y,p=1,i; printf("Enter any positive number: ");
printf("Enter the Base and Exponant value: scanf("%d",&n);
"); temp=n;
scanf("%d%d",&x,&y); while(n!=0)
for(i=1;i<=y;i++) {
p=p*x; r=n%10;
printf("The result: %d",p); n=n/10;
sum=sum*10+r;
} }
printf("The reverse of %d is %d
",temp,sum);
}
15. Write a program that read any number and 16. Write a program that read any decimal
display Sum of its digits. number and display its Binary.
main() Rull : 1
{ main()
int i,n,temp,r,sum=0; {
printf("Enter any positive number: "); int i,n,a[20],temp;
scanf("%d",&n); printf("Enter any decimal number: ");
temp=n; scanf("%d",&n);
while(n!=0) temp=n;
{ for(i=0;n>0;i++)
r=n%10; {
n=n/10; a[i]=n%2;
sum=sum+r; n=n/2;
} }
printf("The Summation of the digids of %d printf("The equivalent binary of %d is:
is %d ",temp,sum); ",temp);
} for(i=i-1;i>=0;i--)
printf("%2d",a[i]);
}
H.W: Convert into Octal number
Just divide by 8 in place of 2 a[i]=n%8; and
n=n/8;
Rull : 2 Convert into binary number 17. Write a program that read n number and
main() search a number using linear search
{ Rull 1: Linear Search
int i,n,r; main()
printf("Enter any decimal number: "); {
scanf("%d",&n); int i,n,found=0,keynum;
printf("The Equivalent Binary of %d is: printf("Enter how many number: ");
",n); scanf("%d",&n);
for(i=8;i>=0;i--) int a[n];
{ printf("Enter %d number: \n",n);
r=((n>>i)&1); for(i=0;i<n;i++)
printf("%d",r); scanf("%d",&a[i]);
}
} printf("Enter the number to be searched:
");
scanf("%d",&keynum);
//Rull 1: Linear Search for(i=0;i<n;i++)
if(found==1) if(a[i]==keynum){
printf("Successful!\n%d is found in found=1;
location %d",keynum,i+1); break;
else }
printf("Failed!\n%d is not exist in the
list",keynum);
}

//Rull 2: Binary Search //Rull 2: Binary Search


#include<stdio.h> do{
main() mid=(top+bottom)/2;
{ if(keynum<a[mid])
int i,n,found=0,keynum,top,bottom,mid; top=mid-1;
printf("Enter how many number: "); else if(keynum>a[mid])
scanf("%d",&n); bottom=mid+1;
int a[n]; }while(keynum!=a[mid] && bottom<=top);
printf("Enter %d number in ascending order:
\n",n); if(keynum==a[mid])
for(i=0;i<n;i++) printf("Successful!\n%d is found in
scanf("%d",&a[i]); location %d",keynum,mid+1);
else
printf("Enter the number to be searched: printf("Failed!\n%d is not exist in the
"); list",keynum);
scanf("%d",&keynum); }
bottom=1;
top=n;

18. Write a program that read n number and sort them


Rull 1: Sort n number Rull 2: Sort n number using Babul sort
#include<stdio.h> #include<stdio.h>
main() main()
{ {
int i,j,n,temp; int i,j,n,temp,k;
printf("Enter how many number: "); printf("Enter how many number: ");
scanf("%d",&n); scanf("%d",&n);
int a[n]; int a[n];
printf("Enter the %d number: \n",n); printf("Enter the %d number: \n",n);
for(i=0;i<n;i++) for(k=0;k<n;k++)
scanf("%d",&a[i]); scanf("%d",&a[k]);

for(i=0;i<n-1;i++) for(i=n-1;i>0;i--)
for(j=i+1;j<=n-1;j++) for(j=0;j<i;j++)
if(a[i]>a[j]) if(a[j]>a[j+1])
{ {
temp=a[i]; temp=a[j];
a[i]=a[j]; a[j]=a[j+1];
a[j]=temp; a[j+1]=temp;
} }
printf("After sorting in Ascending order: printf("After Babul sorting in Ascending
\n"); order: \n");
for(i=0;i<n;i++) for(k=0;k<n;k++)
printf("%4d",a[i]); printf("%4d",a[k]);
} }
19. Write a program that read two number (n,r) 20. Write a program that read two number (n,r)
and find out nPr (Permutation) and find out nCr (Combination)
#include<stdio.h> #include<stdio.h>
main() main()
{ {
int i,n,r,factn=1,factnr=1,nPr; int i,n,r,factn=1,factnr=1,factr=1,nCr;
printf("Enter the value of n and r : "); printf("Enter the value of n and r : ");
scanf("%d%d",&n,&r); scanf("%d%d",&n,&r);
for(i=1;i<=n;i++)
for(i=1;i<=n;i++) factn=factn*i;
factn=factn*i; for(i=1;i<=n-r;i++)
for(i=1;i<=n-r;i++) factnr=factnr*i;
factnr=factnr*i; for(i=1;i<=r;i++)
nPr=factn/factnr; factr=factr*i;
printf("The Permutation(%dP%d) is: nCr=factn/(factnr*factr);
%d",n,r,nPr); printf("The Combination(%dP%d) is:
} %d",n,r,nCr);
}
21. Write a program that read any number and
find out Fibonacci or Not.
main()
{
int n,i,a=0,b=1,c;
printf("Enter any number: ");
scanf("%d",&n);
for(i=1;a<n;i++)
{
c=a+b;
a=b;
b=c;
}
if(a==n)
printf("Fibonacci");
else
printf("Not Fibonacci");
}

You might also like