Simple

C Programs

Fibonacci Series without recursion in c

#include <stdio.h>
int main()
{
int n;
scanf("%d",&n);
int n1=0;
int n2=1;
int n3;
printf("%d %d ",n1,n2);
int i=2;
for(i=2;i<=n;i++){
n3=n2+n1;
printf("%d ",n3);
n1=n2;
n2=n3;
}
return 0;
}

**************************************************************
Fibonacci Series using recursion in C
#include<stdio.h>
int fib(int n);
int fib(int n){
if(n==0){
return 0;
}
else if(n==1){
return 1;
}
else{
return (fib(n-1)+fib(n-2));
}
}
int main(){
int n;
scanf("%d",&n);
int i=0;
for(i=0;i<=n;i++){
printf("%d ",fib(i));
}
return 0;
}
*******************************************************************************

factorial basic code

#include <stdio.h>
int main()
{
int n;
scanf("%d",&n);
int i=1,r=1;
 for(i=1;i<=n;i++){
r=r*i;
}
printf("%d",r);
return 0;
}
***********************************************************************************
*
#include <stdio.h>
int fac(int n);
int fac(int n){
if(n==0){
return 1;
}
else{
return n*fac(n-1);
}
}
int main()
{
int n;
scanf("%d",&n);
int r;
r=fac(n);
printf("%d",r);
return 0;
}
*******************************************************************
factorial with recursion in c
#include <stdio.h>
int fac(int n);
int fac(int n){
if(n==0){
return 1;
}
else{
return n*fac(n-1);
}
}
int main()
{
int n;
scanf("%d",&n);
int r;
r=fac(n);
printf("%d",r);
return 0;
}
********************************************************************
Prime number in c
#include<stdio.h>
int main(){
int n;
scanf("%d",&n);
int i=2;
int c=0;
for(i=2;i<n;i++){
if(n%i==0){
printf("not prime");
 c=1;
break;
}

}
if(c==0){
printf("%d isprime",n);
}
return 0;
}
***********************************************************************
C Program to find prime numbers in a given range

#include<stdio.h>
int main(){
int n1,n2;
scanf("%d %d",&n1,&n2);
int i=2,j;
int c=0;
for(i=n1+1;i<=n2;i++)
{
c=0;
for(j=2;j<=i/2;j++){
if(i%j==0){
c=1;
break;
}

}
if(c==0){
printf("%d\n",i);
}

}
return 0;
}
*******************************************************************
prime number function

#include<stdio.h>
int isprime(int n);
int isprime(int n){
int m=n/2;
int i=2,c=0;
for(i=2;i<=m;i++){
if(n%i==0){
return 0;
c=1;
break;
}
}
if(c==0){
return 1;
}

}
int main(){
int n;
scanf("%d",&n);
 int r;
r=isprime(n);
if(r==0){
printf("not prime");
}
else{
printf("prime");
}
return 0;
}
*********************************************************
prime number using recurssion

#include<stdio.h>
#include<math.h>
int CheckPrime(int i,int num)
{
if(num==i)
return 0;
else
if(num%i==0)
return 1;
else{
return CheckPrime(i+1,num);
}
}
int main()
{
int num;
printf("Enter your Number:");
scanf("%d",&num);

if(CheckPrime(2,num)==0)
printf("It is a Prime Number.");
else
printf("It is not a Prime Number.");
}
***********************************************************
palindrome in c
#include<stdio.h>
int main(){
int n;
scanf("%d",&n);
int s=0,r=0;
int t=n;
while(n!=0){
r=n%10;
s=(s*10)+r;
n=n/10;
}
if(t==s){
printf("pallindrome");
}
else
printf("not");
return 0;
}
**************************************************************
armstrong number in c
#include<stdio.h>
int main(){
int n;
scanf("%d",&n);
int t=n;
int r=0,s=0;
while(n!=0){
r=n%10;
s=(r*r*r)+s;
n=n/10;
}
if(t==s){
printf("armnmbr");
}
else{
printf("not");
}
return 0;
}
*******************************************************************
sumofdigit in c
#include<stdio.h>
int main(){
int n;
scanf("%d",&n);
int r=0,s=0;
while(n!=0){
r=n%10;
s=s+r;
n=n/10;
}
printf("%d",s);
return 0;
}
****************************************************************
wipro question
#include<stdio.h>
int main(){
int n;
scanf("%d",&n);
int r=0,s=0;
char c;
int d=0;
while(n!=0){
r=n%10;
s=s+r;
n=n/10;
}
for(c='A';c<='Z';c++){
d++;
if(d==s){
printf("%c %d %d",c,d,s);
}
}

return 0;
}
**************************************************************
swapping in c
#include <stdio.h>
int main(){
int a=20;
int b=30;
a=a+b;
b=a-b;
a=a-b;
printf("%d %d\n",a,b);
int c=50;
int d=66;
c=c*d;
d=c/d;
c=c/d;
printf("%d %d\n",c,d);
int n1=3;
int n2=5;
n1=n1^n2;
n2=n1^n2;
n1=n1^n2;
printf("%d %d\n",n1,n2);
int a1=23;
int b1=32;
int t;
t=a1;
a1=b1;
b1=t;
printf("%d %d\n",a1,b1);
return 0;
}
***********************************************************************
C Program to print "hello" without semicolon
Using if
Using switch
Using loop etc.

#include <stdio.h>

int main()
{
if(printf("Hello World")){

}
(or)
while(!printf("hello world")){}
(or)
switch(printf("hello world")){}

return 0;
}
**************************************************************************
C Program without main() function

We can write c program without using main() function.

To do so, we need to use #define preprocessor directive.

#include <stdio.h>
#define start main
int start()
{
printf("Hello World");
return 0;
}
************************************************************************
Matrix multiplication in C

#include<stdio.h>
int main(){
int r,c,i,j,k;
scanf("%d",&r);
scanf("%d",&c);
int a[r][c],b[r][c],res[r][c];
for(i=0;i<r;i++){
for(j=0;j<c;j++){
scanf("%d",&a[i][j]);
scanf("%d",&b[i][j]);
}
}
for(i=0;i<r;i++){
for(j=0;j<c;j++){
res[i][j]=0;
for(k=0;k<c;k++){
res[i][j]=a[i][k]*b[k][j]+(res[i][j]);
}
}
}
for(i=0;i<r;i++){
for(j=0;j<c;j++){
printf("%d\t",res[i][j]);
}
printf("\n");
}
return 0;
}
********************************************************************
Decimal to Binary Conversion

#include <stdio.h>
int main()
{
int b[100];
int n;
scanf("%d",&n);
int r=0;
int i=0;
while(n!=0){
b[i]=n%2;
n=n/2;
i++;
}
int j=0;
for(j=i-1;j>=0;j--){
printf("%d",b[j]);
}
return 0;
}
******************************************************************
setbits in binary representation in c
#include <stdio.h>
int main()
{
int b[100];
int n;
scanf("%d",&n);
int r=0;
int i=0;
while(n!=0){
b[i]=n%2;
n=n/2;
i++;
}
int j=0;
int c=0;
for(j=i-1;j>=0;j--){
if(b[j]==1){
c++;
}
}
printf("%d",c);
return 0;
}
********************************************************************
convert Number in Characters

#include<stdio.h>
int main(){
long int n,sum=0,r;
printf("enter the number=");
scanf("%ld",&n);
while(n>0)
{
r=n%10;
sum=sum*10+r;
n=n/10;
}
n=sum;
while(n>0)
{
r=n%10;
switch(r)
{
case 1:
printf("one ");
break;
case 2:
printf("two ");
break;
case 3:
printf("three ");
break;
case 4:
printf("four ");
break;
case 5:
printf("five ");
break;
case 6:
printf("six ");
break;
case 7:
printf("seven ");
break;
case 8:
printf("eight ");
break;
case 9:
printf("nine ");
break;
case 0:
printf("zero ");
break;
default:
printf("tttt");
break;
}
n=n/10;
}
return 0;
}
**********************************************************************************
to display ASCII value of a character entered by user
#include <stdio.h>
int main()
{
char ch;
scanf("%c", &ch);
printf("ASCII value of character %c is: %d", ch, ch);
return 0;
}
***********************************************************************************
*
Program to check Leap Year

Leap Year:
If a year is divisible by 4, 100 and 400 then it is a leap year.
If a year is divisible by 4 but not divisible by 100 then it is a leap year

Not a Leap Year:

If a year is not divisible by 4 then it is not a leap year
If a year is divisible by 4 and 100 but not divisible by 400 then it is not a leap
year

#include <stdio.h>
int main()
{
int y;

printf("Enter year: ");

scanf("%d",&y);

if(y % 4 == 0)
{

if( y % 100 == 0)
{
if ( y % 400 == 0)
 printf("%d is a Leap Year", y);
else
printf("%d is not a Leap Year", y);
}
else
printf("%d is a Leap Year", y );
}
else
printf("%d is not a Leap Year", y);

return 0;
}
***********************************************************************************
************
Program to print the largest and second largest element of the array.

#include<stdio.h>
void main ()
{
int arr[100],i,n,largest,sec_largest;
scanf("%d",&n);
for(i = 0; i<n; i++)
{
scanf("%d",&arr[i]);
}
largest = arr[0];
sec_largest = arr[1];
for(i=0;i<n;i++)
{
if(arr[i]>largest)
{
sec_largest = largest;
largest = arr[i];
}
else if (arr[i]>sec_largest && arr[i]!=largest)
{
sec_largest=arr[i];
}
}
printf("largest = %d, second largest = %d",largest,sec_largest);

}
**************************************************************************
selection
#include <stdio.h>

int main()
{
int n;
scanf("%d",&n);
int a[n];
int i,j,m,t;
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(i=0;i<n;i++){
m=i;
for(j=i+1;j<n;j++){
if(a[j]<a[m]){
 m=j;
}
}
if(m!=i){
t=a[i];
a[i]=a[m];
a[m]=t;
}
}
for(i=0;i<n;i++){
printf("%d ",a[i]);
}
return 0;
}

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