#include <iostream>

using namespace std;

​

int main()

{

    int i, j, n, sum = 0, tsum;

    cout << "\n\n Find the sum of the series (1) + (1+2) + (1+2+3) + (1+2+3+4) + ... + (1+2+3+4+...+n):\n";

    cout << "------------------------------------------------------------------------------------------\n";

    cout << " Input the value for nth term: ";

    cin >> n;

    for (i = 1; i <= n; i++) 

    {

        tsum = 0;

        for (j = 1; j <= i; j++) 

        {

            sum += j;

            tsum += j;

            cout << j;

            if (j < i) 

            {

                cout << "+";

            }

        }

        cout << " = " << tsum << endl;

    }

    cout << " The sum of the above series is: " << sum << endl;

}

​

#include <iostream>

#include <queue>

using namespace std;

struct Node{

   int data;

   struct Node* left, *right;

};

// Function to count the full Nodes in a binary tree

int fullcount(struct Node* node){

   // Check if tree is empty

   if (!node){

      return 0;

   }  

   queue<Node *> myqueue;

   // traverse using level order traversing

   int result = 0;

   myqueue.push(node);

   while (!myqueue.empty()){

      struct Node *temp = myqueue.front();

      myqueue.pop();

      if (temp->left && temp->right){

         result++;

      }

      if (temp->left != NULL){

         myqueue.push(temp->left);

      }

      if (temp->right != NULL){

         myqueue.push(temp->right);

      }

   }

   return result;

}

struct Node* newNode(int data){

   struct Node* node = new Node;

   node->data = data;

   node->left = node->right = NULL;

   return (node);

}

int main(void){

   struct Node *root = newNode(10);

   root->left = newNode(20);

   root->right = newNode(30);

   root->left->left = newNode(40);

   root->left->right = newNode(50);

   root->left->left->right = newNode(60);

   root->left->right->right = newNode(70);

   cout <<"count is: "<<fullcount(root);

   return 0;

}

#include <iostream>

using namespace std;

​

int main()

{

    int i, j, n, sum = 0, tsum;

    cout << "\n\n Find the sum of the series (1) + (1+2) + (1+2+3) + (1+2+3+4) + ... + (1+2+3+4+...+n):\n";

    cout << "------------------------------------------------------------------------------------------\n";

    cout << " Input the value for nth term: ";

    cin >> n;

    for (i = 1; i <= n; i++) 

    {

        tsum = 0;

        for (j = 1; j <= i; j++) 

        {

            sum += j;

            tsum += j;

            cout << j;

            if (j < i) 

            {

                cout << "+";

            }

        }

        cout << " = " << tsum << endl;

    }

    cout << " The sum of the above series is: " << sum << endl;

}

​

#include <iostream>

#include <queue>

using namespace std;

struct Node{

   int data;

   struct Node* left, *right;

};

// Function to count the full Nodes in a binary tree

int fullcount(struct Node* node){

   // Check if tree is empty

   if (!node){

      return 0;

   }  

   queue<Node *> myqueue;

   // traverse using level order traversing

   int result = 0;

   myqueue.push(node);

   while (!myqueue.empty()){

      struct Node *temp = myqueue.front();

      myqueue.pop();

      if (temp->left && temp->right){

         result++;

      }

      if (temp->left != NULL){

         myqueue.push(temp->left);

      }

      if (temp->right != NULL){

         myqueue.push(temp->right);

      }

   }

   return result;

}

struct Node* newNode(int data){

   struct Node* node = new Node;

   node->data = data;

   node->left = node->right = NULL;

   return (node);

}

int main(void){

   struct Node *root = newNode(10);

   root->left = newNode(20);

   root->right = newNode(30);

   root->left->left = newNode(40);

   root->left->right = newNode(50);

   root->left->left->right = newNode(60);

   root->left->right->right = newNode(70);

   cout <<"count is: "<<fullcount(root);

   return 0;

}

#include<bits/stdc++.h>

​

using namespace std;

​

void testfun(map<string, int> mp){

    map<string, int>::iterator it = mp.begin();

    for(; it!=mp.end(); it++){

        cout<<it->first<<":"<<it->second<<" ";

    }

    cout<<endl;

}

​

int main()

{

    int no, add=0;

    cin>>no;

    int var;

    cin>>var;

    map<string, int> d, h;

    h["F"] = 0;

    while(var--){

        string naam;

        int a, b;

        cin>>naam>>a>>b;

        d[naam] = b/a;

        h[naam] = b;

        add+=b;

    }

    cin>>var;

    while(var--){

        string naam, c1="", c2="";

        cin>>naam;

        int meflux=0;

        while(meflux<naam.length()){

            if(naam[meflux]=='_'){

                c1 = c2;

                c2 = "";

                meflux++;

                continue;

            }

            c2+=naam[meflux++];

        }

        h[c2]+= h[c1];

    }

    //print(days);

    //print(storage);

    map<string, int>::reverse_iterator a= d.rbegin();

    int multiply = 1;

    for(; a!=d.rend(); a++ ){

        int temperature = a->second*multiply;

        if(temperature<no){

            add+=(h[a->first]*(no-temperature));

            multiply++;

        }

    }

    cout<<add;

}

#include <stdio.h>

int main()

{

   /* printf function displays the content that is

    * passed between the double quotes.

    */

   printf("Hello World");

   return 0;

}

#include <bits/stdc++.h>

using namespace std;

int a,b,c,d,i;

class Holiday{

    public:virtual void Expenses()=0;

};

class Citizen:public Holiday{

    public:

    void Expenses(){

        cin>>c;

        for (i=0; i<c; i++){

            cin>>a;

            if (d<a) d=a;

            b=b+a;

        }

        cout<<d*c-b;

    }

};

int main (){

    Citizen obj;

    obj.Expenses();

    return 0;

}

class Solution {

public:

    vector<int> findSwapValues(vector<int>& array1, vector<int>& array2) {

        int s1 = 0, s2 = 0;

        unordered_set<int> s;

        for (int a : array1) s1 += a;

        for (int b : array2) {

            s2 += b;

            s.insert(b);

        }

        int diff = s1 - s2;

        if (diff & 1) {

            return {};

        }

        diff >>= 1;

        for (int a : array1) {

            int b = a - diff;

            if (s.count(b)) {

                return {a, b};

            }

        }

        return {};

    }

};

#include <stdio.h>

#define SIZEX 19

#define SIZEY 22

#define SIZEZ 23

​

int maj(int, int, int);

​

int main(){

        int x[SIZEX] = {1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1};

        int y[SIZEY] = {1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1};

        int z[SIZEZ] = {1,1,1,0,0,0,0,1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0};

​

#include <stdio.h>

#define SIZEX 19

#define SIZEY 22

#define SIZEZ 23

​

int maj(int, int, int);

​

int main(){

        int x[SIZEX] = {1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1};

        int y[SIZEY] = {1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1};

        int z[SIZEZ] = {1,1,1,0,0,0,0,1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0};

​

   int i,j = 0;

        int m;

​

        printf("\n");

        for(i = 0; i < 9; i++){

                m  = maj(x[8], y[10], z[10]);

​

                printf("X: ");

                if(x[8] == m){

                        int t = x[13] ^ x[16] ^ x[17] ^ x[18];

                        for(j = SIZEX-1 ; j >= 0; j--){

                                if(j == 0){

                                        x[j] = t;

                                }else{

                                        x[j] = x[j-1];

                                }

​

                        }

                }