Add files via upload

Author: rahulbordoloi

0sumsubA.cpp

@@ -0,0 +1,61 @@
+#include <bits/stdc++.h>
+
+#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
+#define f(i,a,b) for(i=a;i<b;i++)
+#define fr(i,a,b) for(i=a;i>=b;i--)
+#define sp "\t"
+#define ll long long int
+#define ff first
+#define ss second
+#define pb push_back
+#define mp make_pair
+#define mod 1000000007
+
+using namespace std; 
+  
+int i,n,*a;
+
+int maxzlen() 
+{ 
+    unordered_map<int, int> x;   
+    int s=0,l=0; 
+
+    f(i,0,n)
+    { 
+        // Add current element to sum 
+        s += a[i]; 
+  
+        if (a[i] == 0 && l == 0) 
+            l = 1; 
+        if (s == 0) 
+            l = i + 1; 
+  
+        // Look for this sum in Hash table 
+        if (x.find(s) != x.end()) { 
+            // If this sum is seen before, then update max_len 
+            l = max(l, i - x[s]); 
+        } 
+        else { 
+            // Else insert this sum with index in hash table 
+            x[s] = i; 
+        } 
+    }
+    return l;
+}
+  
+
+main() 
+{ 
+    cout<<"\nEnter the No. of Elements:";
+    cin>>n;
+    a=new (nothrow) int[n];
+    cout<<"\nEnter your Array:\n";
+    f(i,0,n)
+       cin>>*(a+i);
+    maxzlen();
+    cout<<"\nYour Array:\n";
+    f(i,0,n)
+       cout<<*(a+i)<<sp;
+    delete[] a;
+    cout<<"\nThe Max Length is :"<<maxzlen();
+}

CF_CandiesDivision.cpp

@@ -0,0 +1,20 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+main()
+{
+#ifdef _DEBUG
+freopen("input.txt", "r", stdin);
+//freopen("output.txt", "w", stdout);
+#endif
+    int tc,n,k;
+    cin>>tc;
+    while(tc>0)
+    {
+        cin>>n>>k;
+        int b=n-n%k;
+		b+=min(n%k,k/2);
+		cout<<b<<endl;
+        tc-=1;
+    }
+}

LL_prac.cpp

@@ -0,0 +1,78 @@
+#include <bits/stdc++.h>
+
+#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
+#define f(i,a,b) for(i=a;i<b;i++)
+#define fr(i,a,b) for(i=a;i>=b;i--)
+#define sp "\t"
+
+using namespace std;
+
+int i;
+
+struct node
+{
+    int data;
+    struct node *next;
+
+    node()
+    {
+        data=0;
+        next=NULL;
+    }
+};
+
+struct node *head=NULL;
+
+void create_LL(int n)
+{
+    head = new node();                                  //dynamic allocation of new Node
+    cout<<"\nEnter Data for Node 1:\n";                 //1st element    
+    cin>>head->data;
+
+    if(head!=NULL)                                     //rest of the elements
+    {
+        struct node *temp,*p=head;
+        f(i,0,n-1)
+        {
+            cout<<"\nEnter Data for Node "<<i+2<<":\n";    
+            struct node *temp=new node();           
+            cin>>temp->data;
+            p->next=temp;
+            p=temp;
+        }
+        free(temp);
+    }
+}
+
+void display_LL()
+{
+    if(head==NULL)
+    {
+        cout<<"\nLinked List is Empty!\n";
+    }
+    else
+    {
+        struct node *temp=head;
+        i=0;
+        while(temp!=NULL)
+        {
+            cout<<"\n"<<i+1<<sp<<"->"<<sp<<temp->data;
+            i++;
+            temp=temp->next;
+        }
+        free(temp);
+    }
+    
+}
+
+main()
+{
+    int n;
+    cout<<"\nEnter the No. of Nodes you want to Insert:\n";
+    cin>>n;
+    if(n!=0)
+    {
+        create_LL(n);
+    }
+    display_LL();
+}

ThanosSort.cpp

@@ -1,42 +1,76 @@
-#include<bits/stdc++.h>
-#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
-#define f(i,a,b) for(i=a;i<b;i++)
-#define fr(i,a,b) for(i=a;i>=b;i--)
-#define endl '\n'
-#define ll long long int
-#define ff first
-#define ss second
-#define pb push_back
-#define mp make_pair
-#define mod 1000000007
+#include<iostream>
 using namespace std;
 
-int ar[100],mx=1;
+int i;
 
-int Sort(int l, int r)
+void ThanosS(int a[],int n)
 {
-	if(l+1==r)
-	{
-		if(ar[l]<=ar[r])
-			return 2;
-		return -1;
-	}
-
-	int mid=(l+r)/2;
-	int x=Sort(l,mid);
-	int y=Sort(mid+1,r);
-	mx=max(mx,max(x,y));
-	if(x>0 and y>0 and ar[mid]<=ar[mid+1])
-		mx=x+y;
-	return -1;
+    int c=1,flag=0,j;
+    if(n >= 1)
+    {
+        for(i=0;i<n;i++)
+        {
+            for(j=1;j<n;j++)
+            {
+                if(a[i] <= a[j])
+                {
+                    c++;
+                }
+                else
+                {
+                    flag=1;
+                    n/=2;
+                    break;
+                }
+            }
+        }
+    }
+    if(flag==1 && n > 1)
+    {
+        ThanosS(a,n);
+    }
+    cout<<"\n"<<c;
 }
 
-int main()
+bool isPower(int x, long int y) 
+{ 
+    if (x == 1) 
+        return (y == 1); 
+    long int pow = 1; 
+    while (pow < y) 
+        pow *= x;
+    return (pow == y); 
+} 
+/*bool isPower(int x, int y) 
+{ 
+    // logarithm function to calculate value 
+    int res1 = log(y) / log(x); 
+    double res2 = log(y) / log(x); // Note : this is double 
+  
+    // compare to the result1 or result2 both are equal 
+    return (res1 == res2); 
+}*/ 
+
+main()
 {
-	int n,i,x;
-	cin>>n;
-	f(i,0,n)
-		cin>>ar[i];
-	x=Sort(0,n-1);
-	cout<<mx;
+    int a[100],n,x;
+    cin>>n;
+    x=isPower(2,n);
+    if(x==1)
+    {
+        for(i=0;i<n;i++)
+        {
+            cin>>a[i];
+        }
+        ThanosS(a,n);
+        /*for(i=0;i<n;i++)
+        {
+            cout<<a[i]<<"\t";
+        }*/
+    }
+    /*else
+    {
+        cout<<"\nNo. of Elements are not in an order of 2\n";
+    }*/
+    
 }

ThanosSortNeetya.cpp

@@ -0,0 +1,42 @@
+#include<bits/stdc++.h>
+#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
+#define f(i,a,b) for(i=a;i<b;i++)
+#define fr(i,a,b) for(i=a;i>=b;i--)
+#define endl '\n'
+#define ll long long int
+#define ff first
+#define ss second
+#define pb push_back
+#define mp make_pair
+#define mod 1000000007
+using namespace std;
+
+int ar[100],mx=1;
+
+int Sort(int l, int r)
+{
+	if(l+1==r)
+	{
+		if(ar[l]<=ar[r])
+			return 2;
+		return -1;
+	}
+
+	int mid=(l+r)/2;
+	int x=Sort(l,mid);
+	int y=Sort(mid+1,r);
+	mx=max(mx,max(x,y));
+	if(x>0 and y>0 and ar[mid]<=ar[mid+1])
+		mx=x+y;
+	return -1;
+}
+
+int main()
+{
+	int n,i,x;
+	cin>>n;
+	f(i,0,n)
+		cin>>ar[i];
+	x=Sort(0,n-1);
+	cout<<mx;
+}