Added Files

Author: codewithdev

03-Arrays/2-d array.cpp

@@ -0,0 +1,11 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+    char a[][3]= {{'a','b','c'},{'d','e','f'}};
+    cout<<a[0][0]<<endl;
+    cout<<a[0]<<endl;
+
+    return 0;
+    
+}

03-Arrays/72cacd3f-dac8-4dfa-a4cf-7a9c7b895fb5.VectorsAndFunctionspdf.pdf

@@ -0,0 +1,27 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+    int **arr= new int *[3];   //Initialization of Primary array. Given no. of rows
+    for(int i=0;i<3;i++)
+    {
+        arr[i]= new int[4];   // Secondry Array intialization
+    }
+    int count=0;
+    for(int i=0;i<3;i++)
+    {
+        for(int j=0;j<4;j++)
+        {
+            arr[i][j]=count;
+            count++; 
+        }
+    }
+    for(int i=0;i<3;i++)
+    {
+        for(int j=0;j<4;j++)
+        {
+            cout<<arr[i][j]<<" ";
+        }
+        cout<<endl;
+    }
+}

03-Arrays/84966c3c-985c-48b6-8c7a-8b5bfbbd6c98.MultidimensionalArrayspdf

@@ -0,0 +1,21 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+    int *p= new int(30);
+    cout<<*p<<endl;
+    int *q= new int();
+    cout<<*q<<endl;
+    int *arr= new int[30];
+    for(int i=0;i<30;i++)
+{
+    arr[i]=i;
+}
+for(int i=0;i<30;i++)
+{
+    cout<<arr[i]<<endl;
+}
+delete p;
+delete q;
+delete []arr;
+}

03-Arrays/84966c3c-985c-48b6-8c7a-8b5bfbbd6c98.MultidimensionalArrayspdf.pdf

@@ -0,0 +1,18 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+    int *p= new int(30);
+    cout<<*p<<endl;
+    int *q= new int();
+    cout<<*q<<endl;
+    int *arr= new int[30];
+    for(int i=0;i<30;i++)
+{
+    arr[i]=i;
+}
+for(int i=0;i<30;i++)
+{
+    cout<<arr[i]<<endl;
+}
+}

03-Arrays/9fe3d25f-e7d9-4f85-b861-355942a8ce0e.pdf

@@ -0,0 +1,19 @@
+#include<iostream>
+#include<vector>
+using namespace std;
+int main()
+{
+
+    vector <int>v;
+    int n;cin>>n;
+    for(int i=0;i<n;i++)
+    {
+        int temp;cin>>temp;
+        v.push_back(temp);
+    }
+    for(int i=0;i<v.size();i++)
+    {
+        cout<<v[i]<<" ";
+        
+    }
+}

03-Arrays/DMA/2d_dma.cpp

@@ -0,0 +1,30 @@
+#include<iostream>
+#include<vector>
+#include<algorithm>
+using namespace std;
+bool compare (int a, int b)   //Function is used to Implement the sorting in reverse order
+{
+    return a>b;
+}
+int main()
+{
+    int n;cin>>n;
+    vector<int> v;
+    v.reserve(100);                       //Reserve at least memory. After that vector will again inititalize the memory 
+    for(int i=0;i<n;i++)
+    {
+        int temp;cin>>temp;
+        v.push_back(temp);    // It inserts the element in the array 
+    }
+    sort(v.begin(), v.end(), compare);
+    v.pop_back();      //It removes the last element from the array
+    v.capacity();         // Function is used to demonstrate the size of the vector
+    for(int i=0;i<v.size();i++)
+    {
+      cout<<v[i]<<" ";  
+    }
+    for(vector<int>::iterator it= v.begin();it!=v.end();it++ )
+    {
+    	cout<<' '<<*it;
+	}
+}

03-Arrays/DMA/new_delete.cpp

@@ -0,0 +1,45 @@
+#include <iostream>
+using namespace std;
+int main() {
+     int n;cin>>n;
+     int a[1000];
+     int cumsum[1000]={0};
+     int currentsum=0;
+     int maxsum=0;
+     int left=-1;
+     int right=-1;
+     cin>>a[0];
+     cumsum[0]= a[0];
+     for(int i=1;i<n;i++)
+     {
+         cin>>a[i];
+         cumsum[i]= cumsum[i-1]+a[i];
+        
+     }
+     for(int i=0;i<n;i++)
+     {
+         for(int j=i;j<n;j++)
+         {
+             currentsum=0;
+             currentsum= cumsum[j]- cumsum[i-1];
+             if(currentsum>maxsum)
+             {
+                maxsum= currentsum;
+                left=i;
+                right=j;
+             }
+         }
+     }
+    cout<<"Maximum sum="<<maxsum<<endl;
+
+    //print the Subarray
+
+    for(int k=left;k<=right;k++)
+    {
+        cout<<a[k]<<",";
+    }
+      
+      
+
+
+}

03-Arrays/DMA/new_dma.cpp

@@ -0,0 +1,24 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+	int cs=0;
+	int ms=0;
+	int n;cin>>n;
+	int a[100];
+	for(int i=0;i<n;i++)
+	{
+		cin>>a[i];
+		
+	}
+	for(int i=0;i<n;i++)
+	{
+		cs= cs+a[i];
+		if(cs<0)
+		{
+			cs=0;
+		}
+		ms= max(ms,cs);
+	}
+	cout<<"MAXIMUM SUM IS:"<<ms<<endl;
+}

03-Arrays/STL/vector_stl.cpp

@@ -0,0 +1,32 @@
+#include<iostream>
+using namespace std;
+void readmatrix(int a[][10],int R,int C)
+{
+	for(int i=0;i<R;i++)
+	{
+		for(int j=0;j<C;j++)
+		{
+			cin>>a[i][j];
+		}
+	}
+	
+}
+void printmatrix(int a[][10],int R,int C)
+{
+	for(int i=0;i<R;i++)
+	{
+		for(int j=0;j<C;j++)
+		{
+			cout<<a[i][j]<<" ";
+		}
+	cout<<endl;
+	}
+	
+}
+int main()
+{
+	int R,C;cin>>C>>R;
+	int a[10][10];
+	readmatrix(a,R,C);
+	printmatrix(a,R,C);
+}

03-Arrays/STL/vector_stl1.cpp

@@ -0,0 +1,35 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+    int t;cin>>t;
+    int rick[1005],cab[1005];
+
+    while(t--)
+    {
+        int m,n,c1,c2,c3,c4;cin>>c1>>c2>>c3>>c4;
+        cin>>n>>m;
+        for(int i=0;i<n;i++)
+        {
+            cin>>rick[i];
+        }
+        for(int i=0;i<m;i++)
+        {
+            cin>>cab[i];
+        }
+        int rickcost=0;
+        for(int i=0;i<n;i++)
+        {
+            rickcost+= min(c1*rick[i],c2);
+        }
+        rickcost= min(rickcost,c3);
+        int cabcost=0;
+        for(int i=0;i<m;i++)
+        {
+            cabcost+= min(c1*cab[i],c2);
+        }
+        cabcost= min(cabcost,c3);
+        int finalAns= min(c4, rickcost+cabcost)
+        cout<<finalAns<endl;
+    }
+}

03-Arrays/cumsum.cpp

@@ -0,0 +1,16 @@
+#include<iostream>
+#include<cstring>
+using namespace std;
+int main()
+{
+	char str[1000];
+	cin.getline(str,1000);
+	char *ptr;
+	ptr= strtok(str,"\n");
+	while(ptr!=NULL)
+	{
+		cout<<ptr<<endl;
+		ptr= strtok(NULL," ");
+	}
+	return 0;
+}

03-Arrays/kadens.cpp

@@ -0,0 +1,16 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+    int n;cin>>n;
+    char a[10][10000];
+    cin.ignore();
+    for(int i=0;i<n;i++)
+    {
+        cin.getline(a[i],10000);
+    }
+    for(int i=0;i<n;i++)
+    {
+        cout<<a[i]<<endl;
+    }
+}

03-Arrays/matrix.cpp

@@ -0,0 +1,29 @@
+#include <iostream>
+using namespace std;
+int main() {
+       int n;
+       cin>>n;
+       int a[1000];
+       for(int i=0;i<n;i++)
+       {
+           cin>>a[i];
+       }
+
+       //Generating Subarrays
+       for(int i=0;i<n;i++)
+       {
+           for(int j=i;j<n;j++)
+           {
+               for(int k=i;k<=j;k++)
+               {
+                   //Printing the subarrays
+                   cout<<a[k]<<",";
+               }
+               cout<<endl;
+           }
+       }
+
+
+
+
+}

03-Arrays/rickcab.cpp

@@ -0,0 +1,25 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+    int n;cin>>n;
+    int a[1000];
+    int currentsum=0;
+    for(int i=0;i<n;i++)
+    {
+        cin>>a[i];
+    }
+    for(int i=0;i<n;i++)
+    {
+        for(int j=i;j<n;j++)
+        {
+            currentsum=0;
+            for(int k=i;k<=j;k++)
+            {
+                currentsum+= a[k];
+            }
+            cout<<currentsum<<",";
+        }
+        cout<<endl;
+    }
+}