Merge branch 'master' into master

Vedant488 · web-flow · commit fe7cba1fc5a9 · 2019-08-03T22:55:29.000+05:30
diff --git a/AR1.cpp b/AR1.cpp
@@ -0,0 +1,32 @@
+#include <iostream>
+using namespace std;
+int main()
+{
+    int MAX = 100, x1, x;
+    int array[MAX], i, largest1, largest2;
+    int pos;
+    cin >> i;
+    for (int n = 0; n < i; n++)
+        cin >> array[n];
+    largest1 = array[0];
+    for (x = 0; x < i; x++)
+        ;
+    {
+        if (array[x] >= largest1)
+        {
+            largest1 = array[x];
+            pos = x;
+        }
+    }
+    int l1 = largest1;
+    array[pos] = 0;
+    largest2 = array[0];
+    for (x1 = 0; x1 < i; x1++)
+        ;
+    if (array[x1] >= largest2)
+        largest2 = array[x1];
+    int l2 = largest2;
+    cout << l2;
+
+    return 0;
+}
diff --git a/AR12.cpp b/AR12.cpp
@@ -0,0 +1,16 @@
+#include <iostream>
+using namespace std;
+int main() {
+  int n;
+  cin>>n;
+  int a[n],i,c=1;
+    for(i=0;i<n;i++)
+      cin>>a[i];
+  for(i=1;i<n;i++)
+  {
+    if(a[i]>a[i-1])
+      c++;
+  }
+	cout<<c;
+	return 0;
+}
diff --git a/AR13.cpp b/AR13.cpp
@@ -0,0 +1,20 @@
+#include <iostream>
+#include <iomanip>
+using namespace std;
+float findMean(int A[], int N)
+{
+    float sum = 0;
+    for (int i = 0; i < N; i++)
+        sum = sum + A[i];
+    cout << setprecision(2) << fixed << sum / N;
+}
+int main()
+{
+    int a[100];
+    int n;
+    cin >> n;
+    for (int i = 0; i < n; i++)
+        cin >> a[i];
+    findMean(a, n);
+    return 0;
+}
diff --git a/AR14.cpp b/AR14.cpp
@@ -0,0 +1,34 @@
+#include <iostream>
+using namespace std;
+ 
+#define MAX_SIZE 100
+ 
+int sum(int arr[], int start, int len);
+int findSum(int A[],int N);
+ 
+int main()
+{
+    int arr[MAX_SIZE];
+    int num, i, sumofarray;
+ 
+ 
+    cin>>num;
+    for(i=0; i<num; i++)
+    {
+        cin>>arr[i];
+    }
+ 
+ 
+    sumofarray = sum(arr, 0, num);
+    cout<<sumofarray;
+ 
+    return 0;
+}
+ 
+int sum(int arr[], int start, int len)
+{
+    if(start >= len)
+        return 0;
+ 
+    return (arr[start] + sum(arr, start + 1, len));
+}
diff --git a/AR15.cpp b/AR15.cpp
@@ -0,0 +1,43 @@
+#include <iostream>
+using namespace std;
+
+void mergeArrays(int arr1[], int arr2[], int n1, int n2, int arr3[])
+
+{
+    int i = 0, j = 0, k = 0;
+
+    while (i < n1 && j < n2)
+    {
+
+        if (arr1[i] < arr2[j])
+            arr3[k++] = arr1[i++];
+        else
+            arr3[k++] = arr2[j++];
+    }
+
+    while (i < n1)
+        arr3[k++] = arr1[i++];
+
+    while (j < n2)
+        arr3[k++] = arr2[j++];
+}
+
+int main()
+{
+    int arr1[100], n1;
+    int arr2[100], n2;
+    cin >> n1 >> n2;
+    int arr3[n1 + n2];
+    for (int i = 0; i < n1; i++)
+        cin >> arr1[i];
+    for (int j = 0; j < n2; j++)
+        cin >> arr2[j];
+    mergeArrays(arr1, arr2, n1, n2, arr3);
+
+    cout << endl;
+    for (int i = 0; i < n1 + n2 - 1; i++)
+        cout << arr3[i] << " ";
+    cout << arr3[n1 + n2 - 1];
+
+    return 0;
+}
diff --git a/AR16.cpp b/AR16.cpp
@@ -0,0 +1,36 @@
+#include <iostream>
+using namespace std;
+int main() {
+  int t,j,k;
+  cin>>t;
+  while(t--)
+  {
+    int n,te=0;
+    cin>>n;
+    int a[n];
+    for(j=0;j<n;j++)
+    {
+      cin>>a[j];
+    }
+     for(j=0;j<n-1;j++)
+     {
+      for(k=j+1;k<n;k++)
+      {
+         if(a[j]>a[k])
+         {
+           te = a[j];
+           a[j] = a[k];
+           a[k] = te;
+         }
+      }
+     }
+   for(j=n-1;j>0;j=j-2)
+   {
+     if(a[j]!=a[j-1])
+        cout<<a[j]<<" ";
+   }
+    cout<<endl;
+  }
+	
+	return 0;
+}
diff --git a/AR2.cpp b/AR2.cpp
@@ -0,0 +1,13 @@
+#include <iostream>
+using namespace std;
+int main()
+{
+    int MAX = 100;
+    int array[MAX], i, largest1, largest2;
+    cin >> i;
+    for (int n = 0; n < i; n++)
+        cin >> array[n];
+    for (int r = i - 1; r >= 0; r--)
+        cout << array[r] << " ";
+    return 0;
+}
diff --git a/AR6.cpp b/AR6.cpp
@@ -1,3 +1,4 @@
+
 #include <iostream>
 #include <string>
 
@@ -44,4 +45,4 @@ int main() {
     cout << query(s) << '\n';
   }
   return 0;
-}
+}
diff --git a/AR7.cpp b/AR7.cpp
@@ -0,0 +1,22 @@
+#include <iostream>
+using namespace std;
+int main() {
+  long int N,K,p,q,sum,i,j,max=0,x=0;
+  cin>>N>>K;
+  long int *a = new long int[N+1]();
+    for(i=0;i<K;i++)
+    {
+      cin>>p>>q>>sum;
+      a[p]+=sum;
+      if((q+1)<=N)
+        a[q-1]=sum;
+    }
+  for(i=1;i<=N;i++)
+  {
+    x = x+a[i];
+    if(max<x)
+      max=x;
+  }
+	cout<<max;
+	return 0;
+}
diff --git a/AR8.cpp b/AR8.cpp
@@ -0,0 +1,37 @@
+#include <iostream>
+using namespace std;
+int main() {
+  int n;
+    cin>>n;
+  int a[n],i,j,c=0;
+    for(i=0;i<n;i++)
+    {
+      cin>>a[i];
+    }
+  for(i=0;i<n-1;i++)
+  {
+    for(j=i+1;j<n;j++)
+    {
+       if(a[i]>a[j])
+       {
+          c = a[i];
+         a[i] = a[j];
+         a[j] = c;
+       }
+    }
+  }   
+  for(i=0;i<n;i++)
+  {
+    if(a[i]>=0)
+    if(a[i]%2!=0)
+      cout<<a[i]<<endl;
+  }
+  for(i=0;i<n;i++)
+  {
+    if(a[i]>=0)
+    if(a[i]%2==0)
+      cout<<a[i]<<endl;
+  }
+	
+	return 0;
+}
diff --git a/AR9.cpp b/AR9.cpp
@@ -0,0 +1,33 @@
+#include<iostream>
+#include<string.h>
+
+using namespace std;
+int main()
+{int n; cin>>n;
+        char str[n][20], t[20];
+        int i, j;
+
+        for(i=0; i<n; i++)
+        {
+               // cout<<" ";
+                cin>>str[i];
+        }
+        for(i=1; i<n; i++)
+        {
+                for(j=1; j<n; j++)
+                {
+                        if(strcmp(str[j-1], str[j])>0)
+                        {
+                                strcpy(t, str[j-1]);
+                                strcpy(str[j-1], str[j]);
+                                strcpy(str[j], t);
+                        }
+                }
+        }
+        for(i=0; i<n; i++)
+        {
+               // cout<<" "<<endl;
+                cout<<str[i]<<endl;
+        }
+        return 0;
+}
diff --git a/SORT5.c b/SORT5.c
@@ -0,0 +1,40 @@
+#include <stdio.h>
+void sort(int a[],int n,int k);
+void sort(int a[],int n,int k)
+{ 
+   int l;int i;
+   l=a[0];
+       for(i=1;i<n;i++)
+       {
+           if(a[i]>l)
+           {
+               l=a[i];
+           }
+       }
+       if(l>k)
+       {
+       printf("%d\n",l-k);
+       }
+       else
+       printf("-1\n");
+}
+  
+int main() 
+{
+   int i,j,k,t,n,m,l;
+   scanf("%d",&t);
+   while(t--)
+   {
+       scanf("%d %d",&n,&m);
+        int a[n];
+       for(i=0;i<n;i++)
+       {
+           scanf("%d",&a[i]);
+       }
+     
+     sort(a,n,m);
+          
+      
+   }
+    return 0;
+}
diff --git a/SORT6.cpp b/SORT6.cpp
@@ -0,0 +1,38 @@
+#include <iostream>
+using namespace std;
+
+int main()
+{
+    int tc, k;
+    cin >> tc;
+    while (tc--)
+    {
+        int n;
+        cin >> n;
+        int arr[n];
+        int i, j, temp;
+        for (i = 0; i < n; i++)
+        {
+            cin >> arr[i];
+        }
+        for (i = 0; i < n; i++)
+        {
+            for (j = i + 1; j < n; j++)
+            {
+                if (arr[j] < arr[i])
+                {
+                    temp = arr[i];
+                    arr[i] = arr[j];
+                    arr[j] = temp;
+                }
+            }
+        }
+        for (i = 0; i < n - 2; i++)
+        {
+            cout << arr[i] << " ";
+        }
+        cout << "\n";
+    }
+
+    return 0;
+}

Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,4 @@`
	`1`	`+`
`1`	`2`	`#include <iostream>`
`2`	`3`	`#include <string>`
`3`	`4`
`@@ -44,4 +45,4 @@ int main() {`
`44`	`45`	`cout << query(s) << '\n';`
`45`	`46`	`}`
`46`	`47`	`return 0;`
`47`		`-}`
	`48`	`+}`