Added file Intro.cpp

Kritika Tripathi/Basics Of Programming/Function and Arrays/.vscode/settings.json

@@ -0,0 +1,5 @@
+{
+    "files.associations": {
+        "iostream": "cpp"
+    }
+}

Kritika Tripathi/Basics Of Programming/Function and Arrays/anybaseadd.cpp

@@ -0,0 +1,42 @@
+#include<iostream>
+
+using namespace std;
+int anytodec(int n, int b){
+    int temp = n, base=1, rem, res=0;
+    while(temp>0){
+        rem = temp%10;//1 //0 //0 //1 //1 //1
+        rem*=base;//1 //0 //0 //8 //16 //32
+        res+=rem;//1 //1 //1 //9 //25 //57
+        temp/=10;//11100 //1110 //111 //11 //1 //0
+        base*=b;//2 //4 //8 //16 //32 //64
+    }
+    return res;
+}
+
+int dectoany(int n, int b){
+    int temp = n, res=0, ten=1;
+    while(temp>0){
+        int rem = temp%b; //5%2=1 // 2%2=0 //1%2=1
+        res += rem*ten; // 1 //  //
+        temp/=b; //2 //1 //0
+        ten*=10; //0 //1 //2 //3
+    }
+    return res;
+}
+
+int getSum(int b, int n1, int n2) {
+    // write your code here
+    int m = anytodec(n1, b);
+    int n = anytodec(n2, b);
+    int sum = m + n;
+    int ans = dectoany(sum, b);
+    return ans;
+}
+
+
+int main() {
+    int b, n1, n2;
+    cin >> b >> n1 >> n2;
+    cout << getSum(b, n1, n2) << endl;
+    return 0;
+}

Kritika Tripathi/Basics Of Programming/Function and Arrays/anybasemul.cpp

@@ -0,0 +1,42 @@
+#include<iostream>
+
+using namespace std;
+int anytodec(int n, int b){
+    int temp = n, base=1, rem, res=0;
+    while(temp>0){
+        rem = temp%10;//1 //0 //0 //1 //1 //1
+        rem*=base;//1 //0 //0 //8 //16 //32
+        res+=rem;//1 //1 //1 //9 //25 //57
+        temp/=10;//11100 //1110 //111 //11 //1 //0
+        base*=b;//2 //4 //8 //16 //32 //64
+    }
+    return res;
+}
+
+int dectoany(int n, int b){
+    int temp = n, res=0, ten=1;
+    while(temp>0){
+        int rem = temp%b; //5%2=1 // 2%2=0 //1%2=1
+        res += rem*ten; // 1 //  //
+        temp/=b; //2 //1 //0
+        ten*=10; //0 //1 //2 //3
+    }
+    return res;
+}
+
+int getProduct(int b, int n1, int n2) {
+    // write your code here
+    int m = anytodec(n1, b);
+    int n = anytodec(n2, b);
+    int product = m * n;
+    int ans = dectoany(product, b);
+    return ans;
+}
+
+
+int main() {
+    int b, n1, n2;
+    cin >> b >> n1 >> n2;
+    cout << getProduct(b, n1, n2) << endl;
+    return 0;
+}

Kritika Tripathi/Basics Of Programming/Function and Arrays/anybasesub.cpp

@@ -0,0 +1,48 @@
+#include<iostream>
+
+using namespace std;
+int anytodec(int n, int b){
+    int temp = n, base=1, rem, res=0;
+    while(temp>0){
+        rem = temp%10;//1 //0 //0 //1 //1 //1
+        rem*=base;//1 //0 //0 //8 //16 //32
+        res+=rem;//1 //1 //1 //9 //25 //57
+        temp/=10;//11100 //1110 //111 //11 //1 //0
+        base*=b;//2 //4 //8 //16 //32 //64
+    }
+    return res;
+}
+
+int dectoany(int n, int b){
+    int temp = n, res=0, ten=1;
+    while(temp>0){
+        int rem = temp%b; //5%2=1 // 2%2=0 //1%2=1
+        res += rem*ten; // 1 //  //
+        temp/=b; //2 //1 //0
+        ten*=10; //0 //1 //2 //3
+    }
+    return res;
+}
+
+int getDifference(int b, int n1, int n2) {
+    // write your code here
+    int m = anytodec(n1, b);
+    int n = anytodec(n2, b);
+    int diff;
+    if(m>n){
+        diff = m-n;
+    }
+    else{
+        diff = n-m;
+    }
+    int ans = dectoany(diff, b);
+    return ans;
+}
+
+
+int main() {
+    int b, n1, n2;
+    cin >> b >> n1 >> n2;
+    cout << getDifference(b, n1, n2) << endl;
+    return 0;
+}

Kritika Tripathi/Basics Of Programming/Function and Arrays/anytoany.cpp

@@ -0,0 +1,34 @@
+#include<iostream>
+using namespace std;
+long int AnyToAny(int n, int b1, int b2) {
+  //write your code here
+  int temp = n, rem, res=0, base=1;
+  while(temp>0){
+    rem = temp%10;//1 //0 //0 //1 //1 //1
+    rem*=base;//1 //0 //0 //8 //16 //32
+    res+=rem;//1 //1 //1 //9 //25 //57
+    temp/=10;//11100 //1110 //111 //11 //1 //0
+    base*=b1;//2 //4 //8 //16 //32 //64
+  }
+  temp = res;
+  int ten=1;
+  long int ans = 0;
+while(temp>0){
+    rem = temp%b2; //0 //1
+    ans += rem*ten; //0 //
+    temp/=b2; //19
+    ten*=10; //10
+}
+return ans;
+
+}
+int main() {
+  int n;
+  int b1;
+  int b2;
+  cin >> n;
+  cin >> b1;
+  cin >> b2;
+  int res = AnyToAny(n, b1, b2);
+  cout << res << endl;
+}

Kritika Tripathi/Basics Of Programming/Function and Arrays/anytodec.cpp

@@ -0,0 +1,22 @@
+#include<iostream>
+using namespace std;
+int AnyToDec(int n, int b) {
+//write your code here.
+int temp = n, base=1, rem, res=0;
+while(temp>0){
+    rem = temp%10;//1 //0 //0 //1 //1 //1
+    rem*=base;//1 //0 //0 //8 //16 //32
+    res+=rem;//1 //1 //1 //9 //25 //57
+    temp/=10;//11100 //1110 //111 //11 //1 //0
+    base*=b;//2 //4 //8 //16 //32 //64
+}
+return res;
+}
+int main() {
+  int n;
+  int b;
+  cin >> n;
+  cin >> b;
+  int res = AnyToDec(n, b);
+  cout << res << endl;
+}

Kritika Tripathi/Basics Of Programming/Function and Arrays/barchart.cpp

@@ -0,0 +1,34 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+
+int main(){
+    //write your code here
+    int n;
+    cin>>n;
+
+    int arr[n];
+
+    for(int i=0; i<n; i++){
+        cin>>arr[i];
+    }
+    int maxn = INT_MIN;
+    for(int i=0; i<n; i++){
+        maxn = max(arr[i], maxn);
+    }
+
+    int i=0, count = maxn; // 6
+    for(int i=0; i<maxn; i++, count--){  // 0 7 //1 6 //2 5 //3 4 //2 3 //1 2
+        for(int j=0; j<n; j++){ //0 to 4
+            if(arr[j]==count){ 
+                cout<<"*\t";
+                arr[j]--;
+            }
+            else{
+                cout<<"\t";
+            }
+        }
+        cout<<endl;
+    }
+
+}

Kritika Tripathi/Basics Of Programming/Function and Arrays/dectoany.cpp

@@ -0,0 +1,21 @@
+#include<bits/stdc++.h>
+using namespace std;
+int DecToAny(int n, int b) {
+//write your code here
+int temp = n, res=0, ten=1;
+while(temp>0){
+    int rem = temp%b; //5%2=1 // 2%2=0 //1%2=1
+    res += rem*ten; // 1 //  //
+    temp/=b; //2 //1 //0
+    ten*=10; //0 //1 //2 //3
+}
+return res;
+}
+int main() {
+  int n;
+  int b;
+  cin >> n;
+  cin >> b;
+  int res = DecToAny(n, b);
+  cout << res << endl;
+}

Kritika Tripathi/Basics Of Programming/Function and Arrays/digitfrequency.cpp

@@ -0,0 +1,21 @@
+#include<iostream>
+using namespace std;
+int digFreq(int n, int d) {
+  //write your code here
+  int temp = n;
+  int count = 0;
+  for(int i=1; temp>0; i++){
+      int rem = temp%10;
+      if(rem==d){
+          count++;
+      }
+      temp/=10;
+  }
+  return count;
+}
+int main() {
+  int n, d;
+  cin >> n >> d;
+  int res = digFreq(n, d);
+  cout << res << endl;
+}

Kritika Tripathi/Basics Of Programming/Function and Arrays/elinarray.cpp

@@ -0,0 +1,23 @@
+#include<iostream>
+using namespace std;
+
+
+int main(){
+    //write your code here
+    int n;
+    cin>>n;
+    int arr[n];
+    for(int i=0; i<n; i++){
+        cin>>arr[i];
+    }
+    int d;
+    cin>>d;
+    for(int i=0; i<n; i++){
+        if(d==arr[i]){
+            cout<<i<<endl;
+            return 0;
+        }
+    }
+    cout<<"-1"<<endl;
+    return 0;
+}

Kritika Tripathi/Basics Of Programming/Function and Arrays/spanofarray.cpp

@@ -0,0 +1,22 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    //write your code here
+    int n;
+    cin>>n;
+    int arr[n];
+    for(int i=0; i<n; i++){
+        cin>>arr[i];
+    }
+    int maxn = INT_MIN;
+    int minn = INT_MAX;
+    for(int i=0; i<n; i++){
+        maxn = max(arr[i], maxn);
+        minn = min(arr[i], minn);
+    }
+    int ans = maxn - minn;
+    cout<<ans<<endl;
+
+    return 0;
+}

Kritika Tripathi/Basics Of Programming/Function and Arrays/sum2array.cpp

@@ -0,0 +1,53 @@
+#include<iostream>
+using namespace std;
+
+int main(){
+    int n1, n2;
+    cin>>n1;
+    int* a1 = new int[n1];
+    for(int i = 0 ; i < n1; i++){
+        cin>>a1[i];
+    }
+
+    cin>>n2;
+    int* a2 = new int[n2];
+    for(int i = 0 ; i < n2; i++){
+        cin>>a2[i];
+    }
+
+    int m = max(n1,n2);
+    int* ans = new int[m];
+
+    int i = n1 - 1;
+    int j = n2 - 1;
+    int k = m - 1;
+    int carry = 0;
+
+    while(k >= 0){
+        int sum = carry;
+        if(i >= 0){
+            sum += a1[i];
+        }
+
+        if(j >= 0){
+            sum += a2[j];
+        }
+
+        int q = sum / 10;
+        int r = sum % 10;
+
+        ans[k] = r;
+        carry = q;
+        i--;
+        j--;
+        k--;
+    }
+
+    if(carry != 0){
+        cout<<carry<<endl;
+    }
+
+    for(int i = 0 ; i < m; i++){
+        cout<<ans[i]<<endl;
+    }
+}