MuhammadJahidHasan

const merge = function(arr, l, r, m ) {

    let n1 = (m - l) + 1;
    let n2 = r - m;

    let arr1 = new Array(n1);
    let arr2 = new Array(n2);

MuhammadJahidHasan

#include <bits/stdc++.h>

using namespace std;

typedef struct node Node;

struct node{
      int data;
      Node *next;

MuhammadJahidHasan

#include <bits/stdc++.h>

using namespace std;

typedef struct node Node;

struct node{
       int data;
       Node *left;
       Node *right;

MuhammadJahidHasan

#include <bits/stdc++.h>

using namespace std;

  vector<int>edg[100];

  queue<int> q;

  int vis[100];
  int level[100];

MuhammadJahidHasan

#include<iostream>
#include <stdio.h>
# define  bool int

using namespace std;



bool getParity(unsigned int n)
{

MuhammadJahidHasan

#include <iostream>

using namespace std;

int main()
{
    int coin[2]={2,4};
    int n;
    cin>>n;
    int taka[n+1];

MuhammadJahidHasan

#include <iostream>

using namespace std;

long long dp[1000];

long long fib(int n){


    if(n==1 || n==2) return 1;

MuhammadJahidHasan

#include <iostream>
#include <vector>
#include <queue>

using namespace std;
vector<int>edge[10000];
int vis[100];
int level[100];
int path[100];

MuhammadJahidHasan

#include <iostream>
#include <string>
#include <algorithm>

using namespace std;

int main()
{
    string r,s1,s2;int ls1,ls2,co=0;
    cin>>s1;

MuhammadJahidHasan

#include <iostream>
#include <vector>
#include <set>

using namespace std;

#define MAX 10000

vector <int> edges[MAX];
vector<int>cost[MAX];