added extra codes

app/src/main/assets/00000028.txt

+#include <stdio.h>
+#include <math.h>
+
+int main()
+{
+    int number, originalNumber, remainder, result = 0, n = 0 ;
+
+    printf("Enter an integer: ");
+    scanf("%d", &number);
+
+     originalNumber = number;
+    
+    while (originalNumber != 0)
+    {
+        originalNumber /= 10;
+        ++n;
+    }
+
+    originalNumber = number;
+
+    while (originalNumber != 0)
+    {
+        remainder = originalNumber%10;
+        result += pow(remainder, n);
+        originalNumber /= 10;
+    }
+
+    if(result == number)
+        printf("%d is an Armstrong number.", number);
+    else
+        printf("%d is not an Armstrong number.", number);
+
+    return 0;
+}
\ No newline at end of file

app/src/main/assets/00000029.txt

+#include <stdio.h>
+#define SIZE 15
+ 
+int binarySearch( const int b[], int searchKey, int low, int high );
+ 
+int main() {
+   int a[ SIZE ];
+   int i;
+   int key = 10;
+   int result = -1;
+ 
+   for ( i = 0; i < SIZE; i++ ) {
+      a[ i ] = 2 * i;
+   }
+ 
+   result = binarySearch( a, key, 0, SIZE - 1 );
+ 
+   if ( result != -1 ) {
+      printf( "\n%d found in array element %d\n", key, result );
+   } else {
+      printf( "\n%d not found\n", key );
+   }
+ 
+   return 0;
+ 
+}
+ 
+int binarySearch( const int b[], int searchKey, int low, int high )
+{
+   int middle;
+ 
+   while ( low <= high ) {
+      middle = ( low + high ) / 2;
+ 
+      if ( searchKey == b[ middle ] ) {
+         return middle;
+      } else if ( searchKey < b[ middle ] ) {
+         high = middle - 1;
+      } else {
+         low = middle + 1;
+      }
+   }
+   return -1;
+ 
+}

app/src/main/assets/00000030.txt

+#include <stdio.h>
+#include <math.h>
+int convertBinaryToDecimal(long long n);
+
+int main()
+{
+    long long n;
+    printf("Enter a binary number: ");
+    scanf("%lld", &n);
+    printf("%lld in binary = %d in decimal", n, convertBinaryToDecimal(n));
+    return 0;
+}
+
+int convertBinaryToDecimal(long long n)
+{
+    int decimalNumber = 0, i = 0, remainder;
+    while (n!=0)
+    {
+        remainder = n%10;
+        n /= 10;
+        decimalNumber += remainder*pow(2,i);
+        ++i;
+    }
+    return decimalNumber;
+}

app/src/main/assets/00000031.txt

+#include <stdio.h>
+#include <conio.h>
+void main()
+{
+	int a[15],i,j,n,temp;
+	clrscr();
+	printf("\nENTER THE SIZE OF ARRAY:")  ;
+	scanf("%d",&n);
+	printf("\nENTER VALUES FOR THE ARRAY:\n");
+	for(i=0;i<n;i++)
+		scanf("%d",&a[i]);
+	for(i=0;i<n-1;i++)
+	{
+		for(j=i+1;j<n;j++)
+		{
+			if(a[i]>a[j])
+			{
+				temp=a[i];
+				a[i]=a[j];
+				a[j]=temp;
+			}
+		}
+	}
+	printf("\nTHE SORTED ARRAY IS:\n");
+	for(i=0;i<n;i++)
+		printf("%d ",a[i]);
+	getch();
+}

app/src/main/assets/00000032.txt

+#include<stdio.h>
+void Bucket_Sort(int array[], int n) {
+	int i, j;
+	int count[n];
+	for (i=0; i < n; i++) {
+		count[i] = 0;
+	}
+	for (i=0; i < n; i++) {
+		(count[array[i]])++;
+	}
+	for (i=0,j=0; i < n; i++) {
+		for (; count[i]>0;(count[i])--) {
+			array[j++] = i;
+		}
+	}
+}
+int main() {
+	int array[100];
+	int num;
+	int i;
+	printf("Enter How many Numbers : ");
+	scanf("%d",&num);
+	printf("Enter the %d elements to be sorted:\n",num);
+	for (i = 0; i < num; i++ ) {
+		scanf("%d",&array[i]);
+	}
+	printf("\nThe array of elements before sorting : \n");
+	for (i = 0;i < num;i++) {
+		printf("%d ", array[i]);
+	}
+	printf("\nThe array of elements after sorting : \n");
+	Bucket_Sort(array, num);
+	for (i = 0;i < n;i++) {
+		printf("%d ", array[i]);
+	}
+	printf("\n");
+	return 0;
+}
\ No newline at end of file

app/src/main/assets/00000033.txt

+#include<stdio.h>
+#include<conio.h>
+#include<math.h>
+
+int fm(int date, int month, int year) {
+   int fmonth, leap;
+
+   //leap function 1 for leap & 0 for non-leap
+   if ((year % 100 == 0) && (year % 400 != 0))
+      leap = 0;
+   else if (year % 4 == 0)
+      leap = 1;
+   else
+      leap = 0;
+
+   fmonth = 3 + (2 - leap) * ((month + 2) / (2 * month))
+         + (5 * month + month / 9) / 2;
+
+   //bring it in range of 0 to 6
+   fmonth = fmonth % 7;
+
+   return fmonth;
+}
+
+//----------------------------------------------
+int day_of_week(int date, int month, int year) {
+
+   int dayOfWeek;
+   int YY = year % 100;
+   int century = year / 100;
+
+   printf("\nDate: %d/%d/%d \n", date, month, year);
+
+   dayOfWeek = 1.25 * YY + fm(date, month, year) + date - 2 * (century % 4);
+
+   //remainder on division by 7
+   dayOfWeek = dayOfWeek % 7;
+
+   switch (dayOfWeek) {
+      case 0:
+         printf("weekday = Saturday");
+         break;
+      case 1:
+         printf("weekday = Sunday");
+         break;
+      case 2:
+         printf("weekday = Monday");
+         break;
+      case 3:
+         printf("weekday = Tuesday");
+         break;
+      case 4:
+         printf("weekday = Wednesday");
+         break;
+      case 5:
+         printf("weekday = Thursday");
+         break;
+      case 6:
+         printf("weekday = Friday");
+         break;
+      default:
+         printf("Incorrect data");
+   }
+   return 0;
+}
+//------------------------------------------
+int main() {
+   int date, month, year;
+
+   printf("\nEnter the year ");
+   scanf("%d", &year);
+
+   printf("\nEnter the month ");
+   scanf("%d", &month);
+
+   printf("\nEnter the date ");
+   scanf("%d", &date);
+
+   day_of_week(date, month, year);
+
+   return 0;
+}
\ No newline at end of file

app/src/main/assets/00000034.txt

+#include<stdio.h>
+#include <string.h>
+
+int main()
+{
+    int i, j;
+    char str[10][50], temp[50];
+
+    printf("Enter 10 words:\n");
+
+    for(i=0; i<10; ++i)
+        scanf("%s[^\n]",str[i]);
+
+
+    for(i=0; i<9; ++i)
+        for(j=i+1; j<10 ; ++j)
+        {
+            if(strcmp(str[i], str[j])>0)
+            {
+                strcpy(temp, str[i]);
+                strcpy(str[i], str[j]);
+                strcpy(str[j], temp);
+            }
+        }
+
+    printf("\nIn lexicographical order: \n");
+    for(i=0; i<10; ++i)
+    {
+        puts(str[i]);
+    }
+
+    return 0;
+}

app/src/main/assets/00000035.txt

+#include<iostream.h>
+#include<conio.h>
+void main()
+{
+   int a,b,c;
+   float  d;
+   clrscr();
+   cout<<"Enter the value of a:";
+   cin>>a;
+   cout<<"Enter the value of b:";
+   cin>>b;
+   cout<<"Enter the value of c:";
+   cin>>c;
+   
+   try
+   {
+              if((a-b)!=0)
+              {
+                 d=c/(a-b);
+                 cout<<"Result is:"<<d;
+              }
+              else
+              {
+                 throw(a-b);
+              }
+   }
+ 
+   catch(int i)
+   {
+              cout<<"Answer is infinite because a-b is:"<<i;
+   }
+  
+   getch();
+}
\ No newline at end of file

app/src/main/assets/00000036.txt

+#include <stdio.h>
+#include<stdlib.h>
+
+struct course
+{
+   int marks;
+   char subject[30];
+};
+
+int main()
+{
+   struct course *ptr;
+   int i, noOfRecords;
+   printf("Enter number of records: ");
+   scanf("%d", &noOfRecords);
+
+   // Allocates the memory for noOfRecords structures with pointer ptr pointing to the base address.
+   ptr = (struct course*) malloc (noOfRecords * sizeof(struct course));
+
+   for(i = 0; i < noOfRecords; ++i)
+   {
+       printf("Enter name of the subject and marks respectively:\n");
+       scanf("%s %d", &(ptr+i)->subject, &(ptr+i)->marks);
+   }
+
+   printf("Displaying Information:\n");
+
+   for(i = 0; i < noOfRecords ; ++i)
+       printf("%s\t%d\n", (ptr+i)->subject, (ptr+i)->marks);
+
+   return 0;
+}

app/src/main/assets/00000037.txt

+#include<stdio.h>
+#define ACCURACY 0.0001
+
+int main() {
+   int n, count;
+   float x, term, sum;
+
+   printf("\nEnter value of x :");
+   scanf("%f", &x);
+
+   n = term = sum = count = 1;
+
+   while (n <= 100) {
+      term = term * x / n;
+      sum = sum + term;
+      count = count + 1;
+
+      if (term < ACCURACY)
+         n = 999;
+      else
+         n = n + 1;
+   }
+
+   printf("\nTerms = %d Sum = %f", count, sum);
+   return 0;
+}
\ No newline at end of file

app/src/main/assets/00000038.txt

+#include<iostream>
+#include<conio.h>
+
+using namespace std;
+
+int main()
+{
+
+     // Variable Declaration
+     int counter, n, fact = 1;
+
+     // Get Input Value
+     cout<<"Enter the Number :";
+     cin>>n;
+
+     //for Loop Block
+     for (int counter = 1; counter <= n; counter++)
+     {
+         fact = fact * counter;
+     }
+
+     cout<<n<<" Factorial Value Is "<<fact;
+     // Wait For Output Screen
+     getch();
+     return 0;
+ }
+

app/src/main/assets/00000039.txt

+#include<iostream>
+#include<conio.h>
+
+using namespace std;
+
+int main()
+{
+
+     // Variable Declaration
+     int counter, n;
+     long last=1,next=0,sum;
+     // Get Input Value
+     cout<<"Enter the Number :";
+     cin>>n;
+
+     //Fibonacci Series Calculation
+     while(next<n/2)
+     {
+      cout<<last <<"  ";
+      sum=next+last;
+      next=last;
+      last=sum;
+     }
+
+     // Wait For Output Screen
+     getch();
+     return 0;
+ }
\ No newline at end of file

app/src/main/assets/00000040.txt

+#include<stdio.h>
+
+int main() {
+
+   int i, j, k = 1;
+   int range;
+
+   printf("Enter the range: ");
+   scanf("%d", &range);
+
+   printf("\nFLOYD'S TRIANGLE : \n");
+
+   for (i = 1; i <= range; i++) {
+      for (j = 1; j <= i; j++, k++) {
+         printf("%d", k);
+      }
+      printf("\n");
+   }
+
+   return 0;
+}
\ No newline at end of file

app/src/main/assets/00000041.txt

+#include <stdio.h>
+int main()
+{
+    int n1, n2, i, gcd;
+
+    printf("Enter two integers: ");
+    scanf("%d %d", &n1, &n2);
+
+    for(i=1; i <= n1 && i <= n2; ++i)
+    {
+        // Checks if i is factor of both integers
+        if(n1%i==0 && n2%i==0)
+            gcd = i;
+    }
+
+    printf("G.C.D of %d and %d is %d", n1, n2, gcd);
+
+    return 0;
+}s
\ No newline at end of file

app/src/main/assets/00000042.txt

+#include<stdio.h>
+void heapsort(int[],int);
+void heapify(int[],int);
+void adjust(int[],int);
+main() {
+	int n,i,a[50];
+	system("clear");
+	printf("\nEnter the limit:");
+	scanf("%d",&n);
+	printf("\nEnter the elements:");
+	for (i=0;i<n;i++)
+	  scanf("%d",&a[i]);
+	heapsort(a,n);
+	printf("\nThe Sorted Elements Are:\n");
+	for (i=0;i<n;i++)
+	  printf("\t%d",a[i]);
+	printf("\n");
+}
+void heapsort(int a[],int n) {
+	int i,t;
+	heapify(a,n);
+	for (i=n-1;i>0;i--) {
+		t = a[0];
+		a[0] = a[i];
+		a[i] = t;
+		adjust(a,i);
+	}
+}
+void heapify(int a[],int n) {
+	int k,i,j,item;
+	for (k=1;k<n;k++) {
+		item = a[k];
+		i = k;
+		j = (i-1)/2;
+		while((i>0)&&(item>a[j])) {
+			a[i] = a[j];
+			i = j;
+			j = (i-1)/2;
+		}
+		a[i] = item;
+	}
+}
+void adjust(int a[],int n) {
+	int i,j,item;
+	j = 0;
+	item = a[j];
+	i = 2*j+1;
+	while(i<=n-1) {
+		if(i+1 <= n-1)
+		   if(a[i] <a[i+1])
+		    i++;
+		if(item<a[i]) {
+			a[j] = a[i];
+			j = i;
+			i = 2*j+1;
+		} else
+		   break;
+	}
+	a[j] = item;
+}
\ No newline at end of file

app/src/main/assets/00000044.txt

+#include<stdio.h>
+#include<conio.h>
+void inst_sort(int []);
+void main() {
+	int num[5],count;
+	clrscr();
+	printf("\nEnter the Five Elements to sort:\n");
+	for (count=0;count<5;count++)
+	  scanf("%d",&num[count]);
+	inst_sort(num);
+	printf("\n\nElements after sorting: \n");
+	for (count=0;count<5;count++)
+	  printf("%d\n",num[count]);
+	getch();
+}
+// Function for Insertion Sorting
+void inst_sort(int num[]) {
+	int i,j,k;
+	for (j=1;j<5;j++) {
+		k=num[j];
+		for (i=j-1;i>=0 && k<num[i];i--)
+		   num[i+1]=num[i];
+		num[i+1]=k;
+	}
+}
\ No newline at end of file

app/src/main/assets/00000045.txt

+#include<stdio.h>
+
+//                   a         3        i          i
+void reduction(float a[][6], int size, int pivot, int col) {
+   int i, j;
+   float factor;
+   factor = a[pivot][col];
+
+   for (i = 0; i < 2 * size; i++) {
+      a[pivot][i] /= factor;
+   }
+
+   for (i = 0; i < size; i++) {
+      if (i != pivot) {
+         factor = a[i][col];
+         for (j = 0; j < 2 * size; j++) {
+            a[i][j] = a[i][j] - a[pivot][j] * factor;
+         }
+      }
+   }
+}
+
+void main() {
+   float matrix[3][6];
+   int i, j;
+
+   for (i = 0; i < 3; i++) {
+      for (j = 0; j < 6; j++) {
+         if (j == i + 3) {
+            matrix[i][j] = 1;
+         } else {
+            matrix[i][j] = 0;
+         }
+      }
+   }
+
+   printf("\nEnter a 3 X 3 Matrix :");
+   for (i = 0; i < 3; i++) {
+      for (j = 0; j < 3; j++) {
+         scanf("%f", &matrix[i][j]);
+      }
+   }
+
+   for (i = 0; i < 3; i++) {
+      reduction(matrix, 3, i, i);
+   }
+
+   printf("\nInvers Matrix");
+   for (i = 0; i < 3; i++) {
+      printf("\n");
+      for (j = 0; j < 3; j++) {
+         printf("%8.3f", matrix[i][j + 3]);
+      }
+   }
+}
\ No newline at end of file

app/src/main/assets/00000046.txt

+# include<stdio.h>
+
+void knapsack(int n, float weight[], float profit[], float capacity) {
+   float x[20], tp = 0;
+   int i, j, u;
+   u = capacity;
+
+   for (i = 0; i < n; i++)
+      x[i] = 0.0;
+
+   for (i = 0; i < n; i++) {
+      if (weight[i] > u)
+         break;
+      else {
+         x[i] = 1.0;
+         tp = tp + profit[i];
+         u = u - weight[i];
+      }
+   }
+
+   if (i < n)
+      x[i] = u / weight[i];
+
+   tp = tp + (x[i] * profit[i]);
+
+   printf("\nThe result vector is:- ");
+   for (i = 0; i < n; i++)
+      printf("%f\t", x[i]);
+
+   printf("\nMaximum profit is:- %f", tp);
+
+}
+
+int main() {
+   float weight[20], profit[20], capacity;
+   int num, i, j;
+   float ratio[20], temp;
+
+   printf("\nEnter the no. of objects:- ");
+   scanf("%d", &num);
+
+   printf("\nEnter the wts and profits of each object:- ");
+   for (i = 0; i < num; i++) {
+      scanf("%f %f", &weight[i], &profit[i]);
+   }
+
+   printf("\nEnter the capacityacity of knapsack:- ");
+   scanf("%f", &capacity);
+
+   for (i = 0; i < num; i++) {
+      ratio[i] = profit[i] / weight[i];
+   }
+
+   for (i = 0; i < num; i++) {
+      for (j = i + 1; j < num; j++) {
+         if (ratio[i] < ratio[j]) {
+            temp = ratio[j];
+            ratio[j] = ratio[i];
+            ratio[i] = temp;
+
+            temp = weight[j];
+            weight[j] = weight[i];
+            weight[i] = temp;
+
+            temp = profit[j];
+            profit[j] = profit[i];
+            profit[i] = temp;
+         }
+      }
+   }
+
+   knapsack(num, weight, profit, capacity);
+   return(0);
+}
\ No newline at end of file

app/src/main/assets/00000047.txt

+#include <stdio.h>
+int main()
+{
+    int n1, n2, minMultiple;
+    printf("Enter two positive integers: ");
+    scanf("%d %d", &n1, &n2);
+
+    // maximum number between n1 and n2 is stored in minMultiple
+    minMultiple = (n1>n2) ? n1 : n2;
+
+    // Always true
+    while(1)
+    {
+        if( minMultiple%n1==0 && minMultiple%n2==0 )
+        {
+            printf("The LCM of %d and %d is %d.", n1, n2,minMultiple);
+            break;
+        }
+        ++minMultiple;
+    }
+    return 0;
+}

app/src/main/assets/00000048.txt

+#include<stdio.h>
+#include<conio.h>
+
+int main() {
+   int size = 3;
+   int matrix[3][3]; // = {{4,9,2},{3,5,7},{8,1,6}};
+   int row, column = 0;
+   int sum, sum1, sum2;
+   int flag = 0;
+
+   printf("\nEnter matrix : ");
+   for (row = 0; row < size; row++) {
+      for (column = 0; column < size; column++)
+         scanf("%d", &matrix[row][column]);
+   }
+
+   printf("Entered matrix is : \n");
+   for (row = 0; row < size; row++) {
+      printf("\n");
+      for (column = 0; column < size; column++) {
+         printf("\t%d", matrix[row][column]);
+      }
+   }
+
+   //For diagonal elements
+   sum = 0;
+   for (row = 0; row < size; row++) {
+      for (column = 0; column < size; column++) {
+         if (row == column)
+            sum = sum + matrix[row][column];
+      }
+   }
+
+   //For Rows
+   for (row = 0; row < size; row++) {
+      sum1 = 0;
+      for (column = 0; column < size; column++) {
+         sum1 = sum1 + matrix[row][column];
+      }
+      if (sum == sum1)
+         flag = 1;
+      else {
+         flag = 0;
+         break;
+      }
+   }
+
+   //For Columns
+   for (row = 0; row < size; row++) {
+      sum2 = 0;
+      for (column = 0; column < size; column++) {
+         sum2 = sum2 + matrix[column][row];
+      }
+      if (sum == sum2)
+         flag = 1;
+      else {
+         flag = 0;
+         break;
+      }
+   }
+
+   if (flag == 1)
+      printf("\nMagic square");
+   else
+      printf("\nNo Magic square");
+
+   return 0;
+}
\ No newline at end of file