Random

Author: rahulbordoloi

helpCPP.cpp

@@ -0,0 +1,68 @@
+#include <bits/stdc++.h>
+
+#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
+#define f(i,a,b) for(auto i=a;i<b;i++)
+#define fi(i,a,b,x) for(auto i=a;i<b;i=i+x)
+#define fe(i,a,b) for(auto i=a;i<=b;i++)
+#define fr(i,a,b) for(auto i=a;i>=b;i--)
+#define loop(i, a) for(auto i=a.begin();i!=a.end();i++)
+#define endl '\n'
+#define sp '\t'
+#define ll long long int
+#define ff first
+#define ss second
+#define pb push_back
+#define mp make_pair
+#define all(x) x.begin(), x.end()
+#define clr(x) memset(x, 0, sizeof(x))
+#define sortall(x) sort(all(x))
+#define mod 1000000007
+#define PI 3.1415926535897932384626
+#define deb(x) cout<<#x<<"="<<x<<endl
+#define deb2(x, y) cout<<#x<<" = "<<x<<","<<#y<<" = "<<y<<endl
+
+using namespace std;
+
+template <typename T>
+void print(vector<T>& a, char sep)
+{
+    for(auto i : a) { cout<<i<<sep; }
+}
+
+ll mod_opr(ll num)
+{
+    return (num + mod) % mod;
+}
+
+template <typename T>
+bool compare(T x, T y)
+{
+    return x > y ? true : false;
+}
+
+int main()
+{
+
+    // ONLINE_JUDGE
+    #ifndef rahulbordoloi
+        // freopen("input.txt", "r", stdin);
+        // freopen("output.txt", "w", stdin);
+    #endif
+
+    // Code
+    //fast;
+    int arr[8] {3,5,6,8,9,2,4,1};
+    int i,j,k,n;
+    i =3, n= 8;
+    for(k = 1 ; k <= i-2; k++){
+        arr[n] = arr[2];
+        for(j = 1 ; j <= i-2; k++){
+            arr[j] = arr[j+3];
+        }
+    }
+    for(k = 1 ; k <= n-2; k++){
+        cout<<arr[k+2];
+    }
+    return 0;
+
+}

kausHelp.cpp

@@ -0,0 +1,59 @@
+#include<iostream>
+using namespace std;
+
+int binarySearch(int a[], int item, int low, int high) 
+{ 
+    if (high <= low) 
+        return (item > a[low])?  (low + 1): low; 
+    int mid = (low + high)/2; 
+    if(item == a[mid]) 
+        return mid+1; 
+    if(item > a[mid]) 
+        return binarySearch(a, item, mid+1, high); 
+    return binarySearch(a, item, low, mid-1); 
+} 
+  
+void insertionSort(int a[], int n) 
+{ 
+    int i, loc, j, k, selected; 
+  
+    for (i = 1; i < n; ++i) 
+    { 
+        j = i - 1; 
+        selected = a[i]; 
+        loc = binarySearch(a, selected, 0, j); 
+        while (j >= loc) 
+        { 
+            a[j+1] = a[j]; 
+            j--; 
+        } 
+        a[j+1] = selected; 
+    } 
+}
+
+int* RearrangeArray(int *arr, int m){
+
+    int i, temp[m], j = 1;
+
+    if(m == 0){
+        return;
+    }
+    else{
+        for(int i = 0; i < m; i++){
+            temp[i] = *(arr + i);
+        }
+        insertionSort(temp, m);
+        for(i = m - 1; m <= 1; i--){
+            *(arr + j) = temp[i];
+        }
+    }
+    return arr;
+}
+
+int main()
+{
+    int arr[] {5,2,3,4,6,5,-2};
+    int* resultArr = RearrangeArray(arr, 7);
+    return 0;
+}
+

rakshaHelp.cpp

@@ -0,0 +1,22 @@
+#include<iostream>
+using namespace std;
+
+int CardsPyramid(int n){
+
+    int mod = 1000007;
+
+    if(n == 0){
+        return -1;
+    }
+    else{
+        return (n * ( 3 * n + 1) / 2) % mod;
+    }
+}
+
+int main()
+{
+    int n;
+    cin>>n;
+    cout<<CardsPyramid(n);
+}
+

random_temp.cpp

@@ -1,7 +1,19 @@
 #include<iostream>
+
+using namespace std;
+
+void enei(){ 
+    // #include<climits>
+    //vector<int> arr {1,2,3,4,5};
+    /* for(auto i : arr){ std::cout<<i<<" "; }*/
+    cout<<INT_MAX;
+}
+
 main()
 {
-    std::cout<<"Hello World";
+    // std::cout<<"Hello World";
+    cout<<INT_MAX;
+    // enei();
 }