Add files via upload

Author: Grv-Singh

9915103252.c

@@ -0,0 +1,85 @@
+#include<stdio.h>
+
+int i,j;
+int maze[5][5]={1,1,0,1,2,0,1,1,0,1,1,0,1,1,1,1,1,0,1,0,0,1,1,0};
+     char sol[5][5];
+
+void main(){
+     solve();
+}
+
+int solve(){
+    if(move_right()){
+            if(maze[i+1][j]){
+                     if(move_down()){
+                        solve();
+                    }
+            }else{if(maze[i-1][j]){
+                     if(move_up()){
+                        solve();
+                    }
+            }
+            }
+    }else{
+        if(move_left()){
+            if(maze[i+1][j]){
+                     if(move_down()){
+                        solve();
+                    }
+            }else{if(maze[i-1][j]){
+                     if(move_up()){
+                        solve();
+                    }
+            }
+            }
+        }
+    }
+}
+
+void move_up(){
+    if(maze[i][j]==2){
+        printf("\nGot the Cheese!\n");
+    }
+    while(pos[i][j]!=0 || i!=0){
+        sol[i][j]='X';
+        i--;
+    }sol[i][j]='X';
+    printf("\n%d,%d to\n",i,j);
+    return 1;
+}
+
+int move_down(){
+    if(maze[i][j]==2){
+        printf("\nGot the Cheese!\n");
+    }
+    while(pos[i][j]!=0 || i!=4){
+        sol[i][j]='X';
+        i++;
+    }
+    printf("\n%d,%d to\n",i,j);
+    return 1;
+}
+
+int move_right(){
+    if(maze[i][j]==2){
+        printf("\nGot the Cheese!\n");
+    }
+    while(pos[i][j]!=0 || j!=4){
+        sol[i][j]='X';
+        j++;
+    }
+    printf("\n%d,%d to\n",i,j);
+    return 1;
+}
+
+void move_left(){
+    if(maze[i][j]==2){
+        printf("\nGot the Cheese!\n");
+    }
+    while(pos[i][j]!=0 || j!=0){
+        sol[i][j]='X';
+        j--;
+    }
+    printf("\n%d,%d to\n",i,j);
+    return 1;
+}

ArrayLCM.c

@@ -0,0 +1,28 @@
+#include<stdio.h>
+
+void main(){
+int a[5],i,t=1,b,j,c[100],u=0,l,m=0;
+
+for(i=0;i<5;i++){
+scanf("%d",a[i]);
+}
+
+for(i=0;i<5;i++){
+for(j=1;j<a[i];j++){
+b=a[i];
+
+if(b%j==0){
+c[u]=j;
+m++;
+b=b/j;
+u++;
+}
+
+}
+}
+
+for(l=0;l<m;l++){
+t=t*a[l];
+}
+
+}

F7F8_Lab2.c

@@ -0,0 +1,10 @@
+#include<stdlib.h>
+#include<conio.h>
+using namespace std;
+
+int main(){
+
+//KMP Algorithm
+
+return 0;
+}

Hackerrank_Cookies.c

@@ -0,0 +1,53 @@
+#include <stdio.h>
+#include <string.h>
+#include <math.h>
+#include <stdlib.h>
+
+int main() {
+    long long int n,k;
+    scanf("%lld %lld",n,k);
+    long long int aray[n];
+    int i;
+    for(i=0;i<n;i++){
+        scanf("%lld ",&aray[i]);
+    }
+    check(aray,n);
+    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
+    return 0;
+}
+
+void check(long long int aray[], long long int n){
+    int i;
+    for(i=0;i<n;i++){
+     if(aray[i]<7){
+        make_sweet(aray);
+            }
+    }
+}
+
+void make_sweet(long long int aray[]){
+    int least, sleast, i, n=(sizeof(aray)/sizeof(aray[0])), min=aray[0];
+    long long int naray[n];
+    int smin=naray[0];
+    for(i=0;i<n;i++){
+     if(aray[i]<min){
+        min=aray[i];
+            }
+    }
+    least=min;
+    for(i=0;i<n;i++){
+        naray[i]=aray[i];
+     if(naray[i]==min){
+        naray[i]='\0';
+            }
+    }
+    for(i=0;i<n;i++){
+     if(naray[i]<smin){
+        smin=aray[i];
+            }
+    }
+    sleast=smin;
+    for(i=0;i<n;i++){
+     aray[i]=(least+(2*sleast));
+    }
+}

Hackerrankmedian.c

@@ -0,0 +1,50 @@
+#include <stdio.h>
+#include <string.h>
+#include <math.h>
+#include <stdlib.h>
+
+void sort(int aray[],int first,int last){
+    int pivot,j,temp,i;
+
+     if(first<last){
+         pivot=first;
+         i=first;
+         j=last;
+
+         while(i<j){
+             while(aray[i]<=aray[pivot]&&i<last)
+                 i++;
+             while(aray[j]>aray[pivot])
+                 j--;
+             if(i<j){
+                 temp=aray[i];
+                  aray[i]=aray[j];
+                  aray[j]=temp;
+             }
+         }
+
+         temp=aray[pivot];
+         aray[pivot]=aray[j];
+         aray[j]=temp;
+         sort(aray,first,j-1);
+         sort(aray,j+1,last);
+
+    }
+
+void median(int aray[],int n){
+        printf("%d",aray[(n/2)+1]);
+}
+
+int main(){
+        /* Enter your code here. Read input from STDIN. Print output to STDOUT */
+    int n;
+    scanf("%d",&n);
+    int aray[n];
+    int i;
+    for(i=0;i<n;i++){
+        scanf("%d ",&aray[i]);
+    }
+    sort(aray,0,(n-1));
+    median(aray,n);
+    return 0;
+};

Hexa.c

@@ -0,0 +1,17 @@
+#include<stdio.h>
+#include<math.h>
+void main()
+{
+    int i,j,a=1,n;
+    scanf("%d",&n);
+    for(i=1;i<=n;i++){
+    for(j=1;j<=(n-1);j++){
+        printf(" ");
+    }
+    for(j=1;j<=n;j++){
+    printf("%d",j);
+    }
+    printf("/n");
+    }
+}
+

Instance place backtrack.c

@@ -0,0 +1,45 @@
+#include<stdio.h>
+#include<stdbool.h>
+#include<stdlib.h>
+
+void ini(int n){
+    int array[2*n],i;
+
+    for(i=0;i<(2*n);i++){
+        array[i]=0;
+    }
+
+    if(fill(n,n,array)){
+        printf("Array is: [");
+        for(i=0;i<(2*n);i++){
+            printf(" %d",array[i]);
+        }
+        printf(" ]");
+    }else{
+        printf("Not Possible!");
+    }
+
+}
+
+fill(int n, int a, int array[])
+{
+if(a==0){
+    return true;
+}
+int i;
+    for(i=0;i<2*n-a-1;i++){
+    if(array[i]==0 && array[i+(a+1)]==0){
+        array[i]=array[i+(a+1)]=a;
+            if(fill(n,a-1,array)){
+                return true;
+            }
+        array[i]=array[i+(a+1)]=0;
+        }
+        }
+    return false;
+}
+
+int main(){
+ini(7);
+return false;
+}

LAB1.c

@@ -0,0 +1,37 @@
+#include<conio.h>
+#include<iostream>
+using namespace std;
+
+//
+void main(){
+//Implementing Linear Search
+    int n;
+    int array[10]={1,2,3,4,5,6,7,8,9,10};
+    cout<<"Which No. is to be searched?\n";
+    cin>>n;
+    linear_search(array,n);
+}
+
+void linear_search(int *a, int b)
+    {
+        bool flag=false;
+        int i=0;
+        while(a[i]!='\0'){
+            if(a[i]==b){
+                cout<<"b is found at i position\n"<<endl;
+                flag = true;
+            }
+            i++;
+        }
+        if(flag==false){
+            char r;
+            cout<<"No such No. can be seen in the array!!\n"<<endl;
+            cout<<"Retry? (y/n)\n"<<endl;
+            cin>>r;
+            if(r=='y'){
+                main();
+            }else{
+                exit(0);
+            }
+        }
+    }

LCM.c

@@ -0,0 +1,41 @@
+#include<stdio.h>
+
+void main(){
+
+int r[50],p[50],s[50],t[50],a,b,c,d,i,m,w,v,x,g,h;
+
+printf("Enter No. 1: ");
+scanf("%d",&a);
+printf("Enter No. 2: ");
+scanf("%d",&b);
+printf("Enter No. 3: ");
+scanf("%d",&c);
+printf("Enter No. 4: ");
+scanf("%d",&d);
+
+for( i=0;i<50;i++ ){
+r[i]=a*(i+1);
+p[i]=b*(i+1);
+s[i]=c*(i+1);
+t[i]=d*(i+1);
+}
+
+for(m=0;m<50;m++){
+
+for(w=0;w<50;w++){
+
+if(r[m]==p[w]){g=r[m];}
+}}
+
+for(v=0;v<50;v++){
+
+for(x=0;x<50;x++){
+
+if(s[v]==t[x]){h=s[v];}
+}}
+
+for( i=0;i<50;i++ ){
+r[i]=a*(i+1);
+p[i]=b*(i+1);
+printf();
+}