Dsa Megalist 2
Dsa Megalist 2
#include <stdio.h>
#include<math.h>
int main()
float n,i,width,height;
scanf("%f",&n);
int count=0;
for(i=0;i<n;i++)
scanf("%f %f",&width,&height);
++count;
++count;
printf("%d",count+1);
return 0;
}
#include <stdio.h>
int j,k,temp;
for(j=0;j<arr_size;j++)
for(k=j+1;k<arr_size;k++)
if(arr[j]>arr[k])
temp=arr[j];
arr[j]=arr[k];
arr[k]=temp;
int main()
{
int i,n;
scanf("%d",&n);
int arr[n];
for(i=0;i<n;i++)
scanf("%d",&arr[i]);
thirdLargest(arr,n);
return 0;
#include <stdio.h>
int n,sum = 0;
sum += n;
if (sum == s)
return 1;
return -1;
return 1;
int main() {
int n, i, flag = 0;
scanf("%d", &n);
if (check(i) == 1) {
if (check(n - i) == 1) {
flag = 1;
binarySearch(1,1,1);
if (flag == 0)
printf("NO");
else
printf("YES");
return 0;
}
#include <stdio.h>
int main()
int n,m,k,x,y,i,ans=0,flag=1;
scanf("%d %d %d",&n,&m,&k);
int a[100001]={0},b[100001]={0};
for(i=0;i<n;i++)
scanf("%d",&x);
if(a[x]<k)
ans++;
a[x]++;
else if(flag!=0)
y=x;
x++;
if(b[y]!=0)
x=b[y];
flag=0;
while(x!=y)
{
if(x==m+1)
x=1;
if(x==y)
break;
if(a[x]<k)
a[x]++;
flag=1;
b[y]=x;
break;
x++;
printf("%d",n-ans);
return 0;
#include<iostream>
ans+= (arr[i][0]/(arr[i][1]+r));
return ans;
int main(){
int n,two;
cin>>n>>two;
double arr[n][2];
cin>>arr[i][0]>>arr[i][1];
double hi=2000,lo=0,mid,curr,k;
cin>>k;
while(hi-lo>1e-7){
mid=(hi+lo)/2;
curr=func(arr,mid,n);
if(curr<k){
hi = mid;
else{
lo = mid + 1e-7;
printf("%.6f",mid);
return 0;
}
#include <stdio.h>
void x()
int main()
int t,i,j;
scanf("%d",&t);
while(t--)
int n;
scanf("%d",&n);
char s[n],c[26]={0};
scanf("%s",s);
for(i=0;i<n;i++)
j=(int)s[i]-97;
c[j]++;
j=0;
for(i=0;i<26;i++)
if(c[i]>j)
j=c[i];
printf("%d\n",j*2+1);
return 0;
#include<bits/stdc++.h>
int sum = 0;
sum += x%16;
x = x/16;
return sum;
int count=0;
for(int i=a;i<=b;i++){
if(__gcd(i,F(i))>1)
count++;
return count;
int main(){
int t,l,r;
cin>>t;
while(t--){
cin>>l>>r;
//int count=0;
//for(int i=l;i<=r;i++){
// if(__gcd(i,F(i))>1)
// count++;
// }
int count=search(l,r);
cout<<count<<endl;
#include <iostream>
#include <bits/stdc++.h>
int main() {
int T, n, d;
cin >> T;
for(int t=0;t<T;t++) {
for(int i=n-1;i>=0;i--){
int x;
cin >> x;
bus.push(x);
while(!bus.empty()){
int b = bus.top();
bus.pop();
d = d - d%b;
cout<<d<< endl;
return 0;
}
DSA SORTING:-
#include<bits/stdc++.h>
int main(){
int n,i,sum=0;
cin>>n;
int arr[n];
for(i=0;i<n;i++)
cin>>arr[i];
sort(arr,arr+n);
for(i=0;i<n;i++)
int z= arr[n-i-1]-(i+1);
//cout<<z<<" ";
//cout<<abs(z);
sum=sum+abs(z);
cout<<sum;
return 0;
cout<<"swap(l,r);";
}
#include <bits/stdc++.h>
f(i,0,n)
f(j,i+1,n)
maxOfSub = arr[j];
minOfSub = arr[j];
int currLength = j - i + 1;
maxLength = currLength;
}
return maxLength;
int main()
int n,i;
cin>>n;
int arr[n];
f(i,0,n)
cin>>arr[i];
int k = 1;
sort(arr,arr+n);
return 0;
#include<bits/stdc++.h>
int main()
{
int t,n,i;
cin>>t;
while(t--){
cin>>n;
int a[n],b[n],sum=0;
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<n;i++)
cin>>b[i];
sort(a,a+n);
sort(b,b+n);
for(i=0;i<n;i++){
if(a[i]%b[n-i-1]==0 || b[n-i-1]%a[i]==0)
sum++;
cout<<sum<<endl;
return 0;
}
#include <iostream>
for(int i=1;i<n;i++){
for(int j=i-1;j>=0;j--){
if(arr[j]>curr){
arr[j+1]=arr[j];
if(j==0)
arr[j]=curr;
else{
arr[j+1]=curr;
j=-1;
int k;
if(i==2){
f(k,0,n)
cout<<arr[k]<<" ";
cout<<endl;
int i;
f(i,0,n)
int main()
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
insertionSort(arr, n);
printArray(arr, n);
return 0;
#include <stdio.h>
*xp = *yp;
*yp = temp;
int i, j, min_idx;
min_idx = i;
for (j = i+1; j < n; j++)
min_idx = j;
swap(&arr[min_idx], &arr[i]);
int i;
printf("\n");
int main()
int n,i;
scanf("%d",&n);
int arr[n];
for(i=0;i<n;i++)
scanf("%d",&arr[i]);
selectionSort(arr, n);
printArray(arr, n);
return 0;
}
#include <bits/stdc++.h>
*xp = *yp;
*yp = temp;
int i, j;
for(i=0;i<n-1;i++)
for(j=0;j<n-i-1;j++)
swap(&a[j], &a[j+1]);
int main()
int t,n;
cin>>t;
while(t--){
cin>>n;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
sort(a,n);
for(int i=0;i<n-2;i++)
cout<<a[i]<<" ";
cout<<endl;
return 0;
#include <bits/stdc++.h>
class sor{
public:
int a[100],b[100];
int n;
void getn(){
cin>>n;
void geta(){
for(int i=0;i<n;i++)
cin>>a[i];
sort(a,a+n);
}
void getb(){
for(int i=0;i<n;i++)
cin>>b[i];
sort(b,b+n);
void display(){
int sum=0;
for(int i=0;i<n;i++)
sum+=a[i]*b[n-i-1];
cout<<sum<<endl;
};
int main()
if(0)
int n;
cin>>n;
while(n--){
sor t;
t.getn();
t.geta();
t.getb();
t.display();
return 0;
}
DSA ARRAYS
#include <stdio.h>
struct interval
int buy;
int sell;
};
return;
int i=0;
if(i == n - 1)
break;
if(arr[i]>arr[i-1])
i++;
sol[count].sell = i - 1;
count++;
printf("(%d %d)",sol[i].buy,sol[i].sell);
return;
int main()
int t,i,n;
scanf("%d",&t);
while(t)
scanf("%d", &n);
int arr[n];
scanf("%d", &arr[i]);
if(n==4)
printf("No Profit");
else
stockBS(arr, n);
printf("\n");
t--;
return 0;
#include <stdio.h>
int main()
int i,j,temp, n;
scanf("%d",&n);
int array[n];
for(i=0;i<n;i++)
scanf("%d",&array[i]);
// pattern(array,n);
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
{
if(array[i]>array[j])
temp=array[i];
array[i]=array[j];
array[j]=temp;
for(j=0;j<n;j+=2)
temp=array[j];
array[j]=array[j+1];
array[j+1]=temp;
printf("%d %d ",array[j],array[j+1]);
//for(j=0;j<n;j++)
if(0)
printf("for(int i=0;i<n;i++)");
return 0;
}
#include <stdio.h>
int main()
int rows,i,j;
scanf("%d",&rows);
for(i=1;i<=rows;i++)
for(j=1;j<=i;j++)
printf("1 ");
else
printf("0 ");
printf("\n");
return 0;
}
#include<iostream>
int main()
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
for(int i=0;i<n/2;i++)
int temp;
temp=arr[i];
arr[i]=arr[n-1-i];
arr[n-1-i]=temp;
for(int i=0;i<n;i++)
cout<<arr[i]<<" ";
return 0;
#include <bits/stdc++.h>
void ss(){
int i, k = 0, l = 0,r = m, c = n;
a[k][i] = x;
k++,i=k;
while(i < m)
a[i][n-1] = x,i++;
n--;
if (k < m)
for (i = n; i >= l; --i)
a[m-1][i] = x;
m--;
if (l < n)
a[i][l] = x;
l++;
cout<<" ";
cout <<"\n";
int main()
int m,n;
cin>>m>>n;
fill0X(m, n);
}
#include <iostream>
int main()
int t;
cin>>t;
while(t--){
int m, n;
cin>>m>>n;
int C[m][n];
cin>>C[i][j];
int a,b,x,y;
cin>>a>>b>>x>>y;
int sum = 0;
cout<<sum<<"\n";
return 0;
#include <bits/stdc++.h>
int t,i,j,tes,n,x,y,sum;
int a[1007][1007];
map<int,bool> udah;
void solve(){}
int main() {
solve();
scanf("%d",&t);
scanf("%d",&n);
scanf("%d",&a[i][j]);
sum = 0;
x = 0;
y = 0;
udah.clear();
if (udah[a[i][j]]) x++, j = n;
udah[a[i][j]] = true;
udah.clear();
if (udah[a[i][j]]) y++, i = n;
udah[a[i][j]] = true;
printf("%d %d %d\n",sum,x,y);
return 0;
}
#include<iostream>
int main()
int m,items,price,i,sum=0,count=0;
string s;
cin>>m>>items;
for(i=0;i<items;i++){
cin>>s>>price;
sum+=price;
if(sum<m)
else{
count++;
sum=sum-price;
if(count==items)
cout<<m-sum;
return 0;
#include <iostream>
for(int i=d;i<n;i++)
cout<<arr[i]<<" ";
for(int i=0;i<d;i++)
cout<<arr[i]<<" ";
return 1;
for(int i=n-d;i<n;i++)
cout<<arr[i]<<" ";
for(int i=0;i<n-d;i++)
cout<<arr[i]<<" ";
return 1;
int main()
int n,d;
char c;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
cin>>d;
int z;
z=d%n;
cin>>c;
if(c=='L')
rotLeft(arr,n,z);
else
rotRight(arr,n,z);
return 0;
}
Linked List
#include <iostream>
void tel(){
return;}
struct node {
int data;
node *next;
}*head = NULL;
void create(){
int n;
cin >> n;
int m;
cin >> m;
p1->data = m;
head = p1;
int i;
int a;
cin >> a;
tt->data = a;
p1->next = tt;
p1=p1->next;
p1->next = NULL;
int del;
nn = nn->next;
int m = del;
dd = dd->next;
if (dd == NULL) {
nn->next = NULL;
found = true;
break;
if (found)
break;
head = head->next;
int main(){
create();
return 0;
#include <bits/stdc++.h>
struct node
int key;
};
new_node->key = new_key;
new_node->next = (*head_ref);
(*head_ref) = new_node;
}
void printList(node *node){
cout<<"-->"<<node->key;
node = node->next;
int count=0;
if (current->key == search_for)
count++;
current = current->next;
return count;
int main()
int x,n,t;
cin>>n;
while(n--){
cin>>t;
push(&head,t);
cin>>x;
cout<<"Linked list:";
printList(head);
return 0;
}
#include<bits/stdc++.h>
struct node {
int data;
node *next;
};
new_node->data = new_data;
new_node->next = NULL;
if (*head_ref == NULL) {
*head_ref = new_node;
return;
last->next = new_node;
return;
int main() {
node* head = NULL;
int n,c,z,i;
cin>>n;
for(i=0;i<n;i++){
cin>>c;
insertAtEnd(&head,c);
cin>>z;
for(int i=0;i<z;i++)
head=head->next;
node* node=head;
while(node!=NULL){
cout<<"->"<<node->data;
node=node->next;
return 0;
cout<<"void create()";
#include <bits/stdc++.h>
using namespace std;
struct node
int key;
};
new_node->key = new_key;
new_node->next = (*head_ref);
(*head_ref) = new_node;
if (current->key == x)
return true;
current = current->next;
return false;
int main()
int x,n,t;
cin>>n;
while(n--){
cin>>t;
push(&head,t);
}
cin>>x;
return 0;
#include<iostream>
struct node{
int data;
}*start;
void display();
if (head == NULL) {
return;
if (head->data == val) {
node* t = head;
head = head->next;
delete (t);
return;
deleteNode(head->next, val);
int main() {
int n;
scanf("%d",&n);
start=NULL;
for(int i=0;i<n;i++){
temp->next = NULL;
if(start == NULL){
start= temp;
p2 = temp;
else
p2->next=temp;
p2=p2->next;
int x;
cin>>x;
//display();
for(int i=0;i<n;i++)
deleteNode(start,x);
display();
return 0;
}
void display() {
temp = start;
printf("Linked List:");
while(temp != NULL)
printf("->%d",temp->data);
temp = temp->next;
#include <bits/stdc++.h>
struct Node
int data;
};
void insertStart(struct Node** head,int data)
new_node->data = data;
new_node->next = (*head);
new_node->prev = NULL;
if ((*head) != NULL)
(*head)->prev = new_node;
(*head) = new_node;
Node* last;
cout<<node->data<<" ";
last = node;
node = node->next;
cout<<endl;
cout<<last->data<<" ";
last = last->prev;
int main()
int n;
cin>>n;
for(int i=0;i<n;i++){
int t;
cin>>t;
insertStart(&head, t);
printList(head);
return 0;
#include <stdio.h>
#include<stdlib.h>
struct Node{
int data;
};
if(current == NULL){
new_node->next = new_node;
*head_ref=new_node;
while(current->next != *head_ref)
current=current->next;
current->next=new_node;
new_node->next=*head_ref;
*head_ref=new_node;
else{
current = current->next;
new_node->next = current->next;
current->next=new_node;
temp=start;
do{
printf("%d ",temp->data);
temp=temp->next;
}while(temp->next != start);
printf("%d",temp->data);
int main()
{
int n,i;
scanf("%d",&n);
scanf("%d",&temp->data);
sortedInsert(&start, temp);
printList(start);
return 0;
#include <stdio.h>
#include<stdlib.h>
struct node{
int data;
void display();
int main() {
int n;
scanf("%d",&n);
start=NULL;
while(n) {
temp->next = NULL;
if(start == NULL){
start= temp;
p2 = temp;
else
p2->next=temp;
p2=p2->next;
}--n;
display();
return 0;
void display() {
temp = start;
printf("Linked List:");
while(temp != NULL)
printf("->%d",temp->data);
temp = temp->next;
}
#include <iostream>
struct n
int data;
struct n *next;
n *p = new n;
p->data = data;
p->next = NULL;
tt->next = p;
tt = p;
void oodd()
{
cout << "Odd:\n";
odd = h;
int i = 1;
if ((i % 2))
i++;
odd = odd->next;
void eeven()
even = h;
int i = 1;
if (!(i % 2))
i++;
even = even->next;
while (h != NULL)
h = h->next;
int main()
int a;
cin >> a;
tt = new n;
tt->data = 1;
tt->next = NULL;
h = tt;
insert(i);
n *y = h;
display(y);
oodd();
eeven();
return 0;
}
#include <bits/stdc++.h>
struct node
int data;
node *next;
};
p1->data = new_data;
p1->next = *start;
*start = p1;
cout<<"->"<<node->data;
node = node->next;
}
int main(){
int n,t;
cin>>n;
while(n--){
cin>>t;
push(&start,t);
cout<<"Linked List:";
printList(start);
return 0;
STACKS:-
#include <stdio.h>
int main() {
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&arr[i]);
st[n-1] = arr[n-1];
temp = arr[n-1];
for(i=n-2;i>=0;i--) {
for(j=i+1;j<n;j++)
if(arr[i]<arr[j]) {
st[i]=arr[i]^st[j];
break;
if(st[i] == 0)
st[i] = arr[i];
temp = st[i];
printf("%d",temp);
return 0;
}
#include <bits/stdc++.h>
int main()
string s,temp="";
cin>>s;
stack<string> stk;
if(s[i]==47||s[i]==92){
if(!temp.empty()){
stk.push(temp);
temp.clear();
else{
temp.push_back(s[i]);
while(!stk.empty()){
cout<<stk.top();
stk.pop();
return 0;
}
#include <stdio.h>
int main(){
int num,i,count=0,a[100001],stck[100001],top=-1;
scanf("%d", &num);
for (i=0;i<num;i++) {
scanf("%d",&a[i]);
top--;
count++;
if (top!=-1) {
count++;
stck[++top]=a[i];
printf("%d",count);
return 0;
}
#include<bits/stdc++.h>
int main(){
int n,q;
cin>>n>>q;
for(int i=0;i<n;i++){
cin>>a[i];
for(int i=0;i<n;i++){
int z=a[i];
int sum=0;
while(z>0){
sum+=(z%10);
z=z/10;
arr[i]=sum;
while(q--){
int Q;
cin>>Q;
int ans=-1;
for(int i=Q;i<n;i++){
ans=i+1;
break;
}else{
continue;
cout<<ans<<' ';
return 0;
#include <bits/stdc++.h>
int main()
int n,k,i;
cin>>n>>k;
int sum = 0;
int arr[n];
stack<int>st, st2;
for(i=0;i<n;i++){
st.push(arr[i]);
for(i=0;i<k;i++){
st2.push(arr[i]);
sum += arr[i];
sum -= st2.top();
st2.pop();
sum += st.top();
st.pop();
return 0;
}
#include<bits/stdc++.h>
bool isPrime(int n)
if(n<=1)
return false;
for(int i=2;i<n;i++)
if(n%i==0)
return false;
return true;
int main(){
stack<int> stack;
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
if(isPrime(a[i]))
cout<<a[i]<<" ";
else
stack.push(a[i]);
cout<<endl;
while(!stack.empty()){
cout<<stack.top()<<" ";
stack.pop();
return 0;
}
#include <iostream>
class node {
public:
int data;
node* next;
};
class mystack {
public:
node* head;
node* tail;
mystack()
head = NULL;
tail = NULL;
};
mystack* create()
return ms;
}
temp->data = data;
temp->next = ms->head;
if (ms->head == NULL)
ms->tail = temp;
ms->head = temp;
if (ms->head == NULL) {
return 0;
else {
ms->head = ms->head->next;
delete temp;
return popped;
if (ms1->head == NULL)
ms1->head = ms2->head;
ms1->tail = ms2->tail;
return;
ms1->tail->next = ms2->head;
ms1->tail = ms2->tail;
temp = temp->next;
int main()
int n,m,t;
cin>>n>>m;
for(int i=0;i<n;i++)
cin>>t;
push(t,ms1);
for(int i=0;i<m;i++)
cin>>t;
push(t,ms2);
merge(ms1, ms2);
for(int i=0;i<n+m;i++)
cout<<pop(ms1)<<" ";
}
#include <bits/stdc++.h>
int v[1000001];
void don(){
int main()
int n, i, x;
sci(n);
cnt[st.top()] = st.top() - i;
st.pop();
st.push(i);
while (!st.empty()) {
cnt[st.top()] = st.top();
st.pop();
x = i - st.top() + 1;
st.pop();
st.push(i);
int k = 0;
k += v[i];
return 0;
}
#include <iostream>
#include <stack>
bool isOperator(char x)
switch (x) {
case '+':
case '-':
case '/':
case '*':
return true;
return false;
stack<string> s;
if (isOperator(pre_exp[i]))
{
string op1 = s.top();
s.pop();
s.pop();
s.push(temp);
else {
s.push(string(1, pre_exp[i]));
return s.top();
int main()
string pre_exp;
cin>>pre_exp;
return 0;
#include <bits/stdc++.h>
#include<iostream>
#include<string.h>
stack<string> s;
if(isOperand(exp[i]))
s.push(op);
else
s.pop();
string op2=s.top();
s.pop();
return(s.top());
int main()
string exp;
cin>>exp;
cout<<getInfix(exp);
return 0;
QUEUES:-
#include <stdio.h>
void enqueue(int);
void display();
int main() {
int n,data,i;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&data);
enqueue(data);
display();
}
return 0;
if (rear == SIZE - 1)
printf("Queue is Full!!");
else {
if (front == -1)
front = 0;
rear++;
items[rear] = data;
void display() {
if (rear == -1)
printf("\nQueue is Empty!!!");
else {
int i;
for(i=front;i<=rear;i++)
}
#include<stdio.h>
int main()
scanf("%lld%lld%lld",&H,&C,&Q);
for(i=0;i<C;i++)
scanf("%lld%lld%lld",&h[i],&S[i],&E[i]);
if(h[i]>maximum_height)
maximum_height=h[i];
for(i=0;i<Q;i++)
scanf("%lld%lld",&height,&t);
if(height>maximum_height)
printf("YES\n");
else{
val=0;
nc=0;
flag=0;
for(j=0;j<C;j++)
nc++;
if(height<=h[j])
printf("NO\n");
flag=1;
break;
else
val++;
if(nc==val)
printf("YES\n");
else
if(flag==0)
printf("NO\n");
return 0;
}
#include<bits/stdc++.h>
int main() {
int i;
string s; cin>>s;
vector<int> v;
vector<int> a[26];
int n= s.size();
for(i=0;i<=n;i++) {
if (s[i] == '#')
v.push_back(i);
else
a[s[i]-'a'].push_back(i);
v.push_back(j);
string ans;
int j = v[v[0]];
while(s[j] != '#') {
ans += s[j];
j = v[j];
cout<<ans;
return 0;
#include <stdio.h>
#include <stdlib.h>
struct node
int data;
};
void enqueue(int d)
if(new_n==NULL){
printf("Queue is Full");
else{
new_n->data = d;
new_n->next = NULL;
if(front==NULL){
front=rear=new_n;
else{
rear->next = new_n;
rear=new_n;
int dequeue()
if(front==NULL){
printf("Queue is Empty\n");
else{
front = front->next;
val = ptr->data;
free(ptr);
return val;
}
int main()
int n,i,t;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&t);
enqueue(t);
linkedListTraversal(front);
dequeue();
printf("\n");
linkedListTraversal(front);
return 0;
#include <stdio.h>
#include <stdlib.h>
struct node
{
int data;
};
void enqueue(int d)
if(n==NULL){
printf("Queue is Full");
else{
n->data = d;
n->next = NULL;
if(f==NULL){
f=r=n;
else{
r->next = n;
r=n;
int dequeue()
struct node* t;
t = f;
if(f==NULL){
printf("Queue is Empty\n");
else{
f = f->next;
val = t->data;
free(t);
}
return val;
int main()
int n,i,t;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&t);
enqueue(t);
for(i=0;i<n;i++){
printf("%d\n",dequeue());
return 0;
#include <stdio.h>
void enqueue(int,int);
void display();
void reverse();
int main() {
int n,t,i;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&t);
enqueue(t,n);
printf("Queue:");
display();
reverse();
printf("\nReversed Queue:");
display();
return 0;
void reverse(){
int i,j,temp;
for(i=front,j=rear;i<j;i++,j--){
temp=items[i];
items[i]=items[j];
items[j]=temp;
if (rear == l - 1)
printf("Queue is Full!!");
else {
if (front == -1)
front = 0;
rear++;
items[rear] = data;
}
}
void display() {
if (rear == -1)
printf("\nQueue is Empty!!!");
else {
int i;
for(i=front;i<=rear;i++)
#include <stdio.h>
#include <stdlib.h>
struct node
int data;
};
void linkedListTraversal(struct node *ptr)
ptr = ptr->next;
void enqueue(int d)
if(n==NULL){
printf("Queue is Full");
else{
n->data = d;
n->next = NULL;
if(f==NULL){
f=r=n;
else{
r->next = n;
r=n;
int dequeue()
struct node* t;
t = f;
if(f==NULL){
printf("Queue is Empty\n");
else{
f = f->next;
val = t->data;
free(t);
return val;
int main()
int n,i,t;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&t);
enqueue(t);
linkedListTraversal(f);
for(i=0;i<2;i++){
dequeue();
printf("\n");
linkedListTraversal(f);
return 0;
}
#include <stdio.h>
#include <stdlib.h>
struct node
int data;
};
ptr = ptr->next;
void enqueue(int d)
printf("Queue is Full");
else{
new_n->data = d;
new_n->next = NULL;
if(front==NULL){
front=rear=new_n;
else{
rear->next = new_n;
rear=new_n;
int main()
int n,i,t;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&t);
enqueue(t);
linkedListTraversal(front);
return 0;
}
#include<stdio.h>
int main()
scanf("%ld",&disk);
max=disk;
for(i=0;i<disk;i++)
scanf("%ld",&size);
temp[size]=size;
if(size==max)
while(temp[size])
printf("%ld ",temp[size]);
size--;
max=size;
printf("\n");
else
printf("\n");
}
return 0;
TREE 1:-
#include<bits/stdc++.h>
int dp[1005][1005];
int main(){
rep(i,1,n+1){
rep(j,1,n+1){
char x; cin>>x;
while(m--){
return 0;
cout<<"for(i=1;i<=n;i++)";
#include <bits/stdc++.h>
int N, K;
double ans, a, b;
int main(){
a = b = 1.0;
a *= (double) i / K;
b *= (double) (i-1) / K;
ans += (a-b) * i;
}
printf("%.6f\n", ans);
return 0;
#include<bits/stdc++.h>
void solve(){}
struct node {
int data;
}*root=NULL;
tempNode->data = data;
tempNode->left = NULL;
tempNode->right = NULL;
else {
current = root;
parent = NULL;
while(1) {
parent = current;
current = current->left;
if(current == NULL) {
parent->left = tempNode;
return;
else {
current = current->right;
if(current == NULL) {
parent->right = tempNode;
return;
}}}
if(root != NULL) {
printf("%d ",root->data);
preorder(root->left);
preorder(root->right);
int main() {
solve();
scanf("%d",&x); insert(x); }
preorder(root);
return 0;
#include <stdlib.h>
struct node {
int data;
};
void solve(){}
tempNode->data = data;
tempNode->left = NULL;
tempNode->right = NULL;
if(root == NULL) {
root = tempNode;
} else {
current = root;
parent = NULL;
while(1) {
parent = current;
current = current->left;
if(current == NULL) {
parent->left = tempNode;
return;
else {
current = current->right;
if(current == NULL) {
parent->right = tempNode;
return;
if(root != NULL) {
inorder(root->left);
printf("%d ",root->data);
inorder(root->right);
}
int main() {
solve();
int n,i;
scanf("%d",&n);
int array[n];
for(i=0;i<n;i++)
scanf("%d",&array[i]);
insert(array[i]);
inorder(root);
return 0;
return 0;
#include<bits/stdc++.h>
int main(){
int n,q,i,a,b;
cin>>n>>q;
int x[n];
for(i=0;i<n;i++)
cin>>x[i];
while(q--){
int sum=0;
cin>>a>>b;
for(i=a;i<=b;i++)
sum=sum+x[i-1];
cout<<sum<<endl;
#include<iostream>
void solve(){}
int main()
solve();
int n,m,i;
cin>>n>>m;
int a[n],b[n];
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<n;i++)
cin>>b[i];
for(i=0;i<m;i++){
int f=0,j=0;
for(;j<n;j++){
if(a[j]>=b[i]){
a[j]-=b[i];
f=1;
break;
if(f>0)
cout<<j+1<<" ";
else
cout<<"0 ";
return 0;
}
#include<bits/stdc++.h>
#define pb push_back
vector<int>tree[MAX];
ll up[MAX][20];
void solve(){}
up[i][0]=j;
for(int m=1;m<20;m++){
if(up[i][m-1]!=-1)
up[i][m]=up[up[i][m-1]][m-1];
else
up[i][m]=-1;
for(auto child:tree[i]){
if(child!=j) link(child,i);
return ans_query(up[src][i],jump-(1<<i));
return 1;
int main(){
solve();
int n,q;
cin>>n>>q;
for(int i=2;i<=n;i++){
int ee;
cin>>ee;
tree[i].pb(ee);
tree[ee].pb(i);
link(1,-1);
while(q--){
int node,jump;
cin>>node>>jump;
cout<<ans_query(node,jump)<<endl;
}
#include<bits/stdc++.h>
int fa[1005],fa2[1005],n,m1,m2;
return f[x]==x?x:f[x]=gf(f[x],f);
int main(){
cin>>n>>m1>>m2;
for(int i=1;i<=n;i++)fa[i]=fa2[i]=i;
for(int i=1,x,y;i<=m1;i++)cin>>x>>y,fa[gf(x,fa)]=gf(y,fa);
for(int i=1,x,y;i<=m2;i++)cin>>x>>y,fa2[gf(x,fa2)]=gf(y,fa2);
cout<<n-max(m1,m2)-1<<'\n';
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
if(gf(i,fa)!=gf(j,fa)&&gf(i,fa2)!=gf(j,fa2)){
cout<<i<<' '<<j<<'\n';
fa[gf(i,fa)]=gf(j,fa);
fa2[gf(i,fa2)]=gf(j,fa2);
}
}
return 0;
cout<<"while(m1--)";
#include<bits/stdc++.h>
#define vi vector<int>
#define pb push_back
vi adj[200005];
int d=0,x=0;
void solve(){}
if (i!=p){
dfs(i,s,dep+1);
if (dep>d) d = dep, x = s;
int main(){
solve();
int n;
cin>>n;;
rep(i,0,n-1){
adj[x].pb(y), adj[y].pb(x);
dfs(1,0,0);
dfs(x,0,0);
cout<<d;
return 0;
#include <stdio.h>
#define N 200000
tr[k] = r - l;
if (r - l > 1) {
int m = (l + r) / 2;
build(k * 2 + 1, l, m);
build(k * 2 + 2, m, r);
tr[k]--;
if (r - l == 1)
return r;
m = (l + r) / 2, k1 = k * 2 + 1, k2 = k * 2 + 2;
int main() {
int n, h, i, x;
scanf("%d", &n);
int aa[n];
scanf("%d", &aa[i]);
build(0, 0, n);
scanf("%d", &x);
i = query(0, 0, n, x) - 1;
printf("\n");
return 0;
}
TREE-2:-
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
struct cell{
int name;
int level;
int capacity;
};
int front;
int end;
void init_queue(){
front = 0;
end = 0;
queue[end].name = name;
queue[end].level = level;
queue[end].capacity = capacity;
end = end + 1;
}
int is_empty(){
if(end == front)
return 1;
return 0;
void dequeue()
if(!is_empty())
front++;
int main(){
int n,rc;
init_queue();
scanf("%d %d",&n,&rc);
int i,j,k;
for(i=0;i<n;i++){
scanf("%d %d",&arr[i].name,&arr[i].capacity);
enqueue(0,rc,0);
i=0;
while(!is_empty()){
k=1;
for(j=0;j<cap&&i<n;j++,i++){
printf("%d %d %d\n",par,lev,k++);
enqueue(arr[i].name,arr[i].capacity,lev);
dequeue();
return 0;
}
#include<bits/stdc++.h>
int main() {
int n,i,c;
int tree[n+1][2];
tree[1][0] = -1;
for(i=2;i<=n;i++) {
scanf("%d", &tree[i][0]);
scanf("%d", &tree[i][1]);
int parent;
parent = tree[i][0];
parent = tree[parent][0];
return 0;
}
#include <bits/stdc++.h>
int main(){
scanf("%d", &N);
f(i,0,N-2){
scanf("%d", &a[i]);
deg[a[i]]++;
f(i,1,N+1)
//if(deg[i] == 1)
X(deg[i],1)
q.push(i);
f(i,0,N-2){
int u = a[i];
deg[u]--; deg[v]--;
//if(deg[u] == 1)
X(deg[u],1)
q.push(u);
f(i,1,N+1)
if(deg[i])
#include <iostream>
#include <map>
#include <assert.h>
using namespace std;
map < pair < int, int >, int > adj;
int depth = 0;
while ( u > 0 ) {
u = u / k;
depth = depth + 1;
return depth - 1;
int dist = 0;
swap ( u, v );
if ( adj.count( { u, u / k } ) ) {
} else {
dist = dist + 1;
depth_u = depth_u - 1;
u = u / k;
while ( u != v ) {
if ( adj.count( { u, u / k } ) ) {
} else {
dist = dist + 1;
if ( adj.count( { v, v / k } ) ) {
dist = dist + adj [ { v, v / k } ];
} else {
dist = dist + 1;
u = u / k;
v = v / k;
return dist;
swap ( u, v );
add_weight( u, u / k, w );
depth_u = depth_u - 1;
u = u / k;
while ( u != v ) {
add_weight( u, u / k, w );
add_weight( v, v / k, w );
u = u / k;
v = v / k;
signed main() {
int k, q, x, u, v, w;
while(q--) {
cin >> x;
if ( x == 1 ) {
} else {
increase_weights( u, v, w, k );
#include <bits/stdc++.h>
int main()
{
int N, M; cin >> N >> M;
seats.push(a);
x[a]++;
cout <<ans;
return 0;
#include<bits/stdc++.h>
{
//visited[node]=1;
subroot[node][s[node-1]-'a']++;
//intime[node]=t;
//t++;
//z.push_back(node);
if(it!=parent)
dfs(it,node,s,subroot,v1);
for(int i=0;i<26;i++)
subroot[node][i]+=subroot[it][i];
//outtime[node]=t;
//t++;
int main()
int N,i, Q;
string S;
cin >> S;
vector<vector<int>>v1(N+1);
for(i=0;i<N-1;i++)
int u, v;
v1[u].push_back(v);
v1[v].push_back(u);
vector<vector<int>>subroot(N+1,vector<int>(26,0));
dfs(1,0,S,subroot,v1);
while(Q--)
{
int u;
char c;
cout<<subroot[u][c-'a']<<"\n";
//cout<<cnt<<endl;
return 0;
#include<bits/stdc++.h>
struct edge
int u;
int v;
int w;
};
edge a[100005];
int parent[100005];
bool comp (edge a , edge b)
return a.w>b.w;
if(parent[u]==u)
return u;
else
return parent[u]=find_parent(parent[u]);
parent[u]=v;
int main()
int t;
cin>>t;
while(t--) {
int n,m;
cin>>n>>m;
for(int i=1;i<=n;i++)
parent[i]=i;
for(int i=0;i<m;i++) {
sort(a,a+m,comp);
ll ans=0;
for(int i=0;i<m;i++) {
int x=find_parent(a[i].u);
int y=find_parent(a[i].v);
if(x!=y)
merge(x,y);
ans+=a[i].w;
}
}
cout<<ans<<endl;
return 0;
#include<bits/stdc++.h>
#include<map>
int main() {
int N,i,maximum=INT_MIN;
scanf("%d", &N);
int S[N];
map<int,int> map;
for(i=0;i<N;i++) {
scanf("%d", &S[i]);
maximum=max(maximum,S[i]);
map[S[i]]++;
int temp,Q;
cin>>Q;
for(i=0;i<Q;i++) {
scanf("%d", &temp);
if(temp==maximum) printf("%d\n",N);
else {
if(map[temp]>=2) printf("%d\n",N);
else {
map[temp]++;
N++;
printf("%d\n",N);
maximum=max(maximum,temp);
}
}
for(auto it=map.rbegin();it!=map.rend();it++) {
#include<bits/stdc++.h>
int dp[1000006][25];
void solve(){}
int main(){
solve();
int n, q; cin>>n>>q;
int x, y; cin>>x>>y;
dp[y][0] = max(dp[y][0], x);
dp[i][k] = dp[dp[i][k-1]][k-1];
while(q--) {
int ans = 0;
while(y>0) {
int z = 0;
if (dp[y][i] < x) {
z = i;
break;
if (z == 0)
break;
ans += (1<<(z-1));
y = dp[y][z-1];
cout<<ans<<endl;
}
# include<stdio.h>
# include<stdlib.h>
# include<math.h>
int main()
int n;
scanf("%d",&n);
input(ptr,n);
return 0;
int i, j;
int m;
for(i=0;i<n;i++)
scanf("%ld", ptr+i);
}
for(i = 0; i < n; i++)
if (*(ptr + i) <= m)
continue;
if(temp > m)
m = temp;
printf("%d", m);
GRAPH:-
#include <bits/stdc++.h>
int n, m;
ll adj[501][501], oadj[501][501];
ll flow[501];
bool V[501];
int pa[501];
bool reachable() {
while(!Q.empty()) {
return V[n];
int main() {
bfs(1,1,1);
link(1,1);
F0R(i,m) {
adj[a][b] += c;
int v, u;
ll maxflow = 0;
while(reachable()) {
ll flow = 1e18;
u = pa[v];
}
maxflow += flow;
u = pa[v];
adj[u][v] -= flow;
adj[v][u] += flow;
#include <stdio.h>
#define N 500
#define M 1000
struct L {
struct L *next;
int h;
} aa[N * 2];
dd[i] = n;
dd[s] = 0;
head = cnt = 0;
qq[head + cnt++] = s;
while (cnt) {
struct L *l;
i = qq[cnt--, head++];
d = dd[i] + 1;
if (cc[h = l->h]) {
if (dd[j] == n) {
dd[j] = d;
if (j == t)
return 1;
qq[head + cnt++] = j;
return 0;
struct L *l;
int h, j, d;
if (i == t)
return 1;
d = dd[i] + 1;
if (cc[h = l->h]) {
return 1;
dd[i] = n;
return 0;
int f = 0;
f++;
return f;
ij[h] = i ^ j;
cc[h << 1] = c;
l->h = h << 1;
l->h = h << 1 ^ 1;
int qq[N];
int cnt = 0;
while (i != t) {
struct L *l;
int h;
qq[cnt++] = i;
for (l = aa[i].next; l; l = l->next)
break;
qq[cnt++] = t;
return cnt;
int main() {
int n, m, h, i, j, k, s, t, cnt;
s = 0, t = (n - 1) << 1 ^ 1;
k = dinic(n * 2, s, t);
printf("%d\n", k);
while (k--) {
printf("\n");
return 0;
}
#include <stdio.h>
#else
#define I64(x) x ## ll
#endif
struct link
az_int64_t t;
int u, v;
};
az_int64_t c[64];
int gr[MAXN];
for(i=1;i<=n;++i) gr[i] = i;
gr[v] = u;
return 0;
int i;
int l, id;
if( !test( 0 ) )
printf( "-1\n" );
return 0;
return 0;
#include <stdio.h>
#include <string.h>
#define N 200000
int main() {
int n, i, j, c, d, q, cnt;
scanf("%d", &n);
cnt = 0;
for(i = 0;i<n;i++) {
if (cc[i] != -1)
continue;
d = 0;
j = i;
cc[j] = -2;
d++;
j = aa[j];
if (cc[j] == -2) {
c = cnt++;
q = 0;
cc[j] = c;
q++;
j = aa[j];
qq[c] = q;
d -= q;
} else {
c = cc[j];
d += dd[j];
j = i;
dd[j] = d--;
j = aa[j];
printf("\n");
return 0;
#include <stdio.h>
#define N 100000
#define M 200000
struct L {
struct L *next;
int j;
} *aa[N];
struct L *new_L(int j) {
return l++;
struct L *l = new_L(j);
int i = e->j;
aa[i] = l->next;
e = e->next = new_L(l->j);
i = l->j;
e->next = f;
int main() {
int n, m, h, i, j;
link(i, j);
dout[i]++, din[j]++;
printf("IMPOSSIBLE\n");
return 0;
}
for (i = 1; i < n - 1; i++)
if (dout[i] != din[i]) {
printf("IMPOSSIBLE\n");
return 0;
e_ = new_L(0);
m++;
hierholzer(e_);
hierholzer(e);
m--;
if (m != 0) {
printf("IMPOSSIBLE\n");
return 0;
printf("\n");
return 0;
#include<bits/stdc++.h>
using namespace std;
void solve(){}
int main(){
solve();
int k;
cin>>n>>m>>k;
cin>>a>>b>>c;
cout<<"0\n";
return 0;
}*/
dp[1][0]=0;
while(!q.empty()){
q.pop();
bool change=false;
for(auto to:adjList[now]){
if(to.first==from){
continue;
for(int i=0;i<=k;++i){
dp[to.first][i+1] = dp[now][i];
change=true;
//for(int i=0;i<2;++i){
if(dp[to.first][i] > dp[now][i]+to.second){
dp[to.first][i] = dp[now][i]+to.second;
change=true;
//}
if(change){
ans = min(ans,dp[i][j]);
cout<<ans<<" ";
return 0;
}
#include <stdio.h>
#define N 500
#define M 1000
struct L {
struct L *next;
int v;
} aa[N + 1];
l->v = v;
int bfs(int n) {
dd[0] = n;
if (vv[u] == 0) {
dd[u] = 0;
qq[head + cnt++] = u;
} else
dd[u] = n;
while (cnt) {
struct L *l;
u = qq[cnt--, head++];
d = dd[u] + 1;
if (dd[w] == n) {
dd[w] = d;
if (w == 0)
return 1;
qq[head + cnt++] = w;
return 0;
struct L *l;
int d;
if (u == 0)
return 1;
d = dd[u] + 1;
uu[v] = u;
return 1;
dd[u] = n;
return 0;
int hopcroft_karp(int n) {
int m = 0;
while (bfs(n)) {
int u;
m++;
return m;
int main() {
int n, n_, m, u, v;
while (m--) {
link(u, v);
printf("%d\n", hopcroft_karp(n));
if (vv[u])
return 0;
}
#include <bits/stdc++.h>
if (low == val[j]) {
do {
x = z.back(); z.pop_back();
comp[x] = ncomps;
cont.push_back(x);
} while (x != j);
f(cont); cont.clear();
ncomps++;
int n = sz(g);
Time = ncomps = 0;
int main() {
cin.sync_with_stdio(0); cin.tie(0);
cin.exceptions(cin.failbit);
int n, m;
vector<vi> g(n);
while(m--) {
int a, b;
a--, b--;
g[a].push_back(b);
g[b].push_back(a);
vi r;
rep(i, 1, sz(r))
cout << r[0]+1 << " " << r[i]+1 << '\n';
return 0;
}
#include <stdio.h>
#define N 100000
#define M 200000
struct L {
struct L *next;
int h;
} *aa[N];
struct L *new_L(int h) {
l->h = h;
return l++;
struct L *l = new_L(h);
l->next = aa[i]; aa[i] = l;
int h = l->h;
if (lazy[h])
aa[i] = l->next;
else {
lazy[h] = 1;
e = e->next = new_L(h);
i ^= ij[h];
e->next = f;
int main() {
int n, m, h, i, j;
ij[h] = i ^ j;
dd[i]++, dd[j]++;
if (dd[i] % 2) {
printf("IMPOSSIBLE\n");
return 0;
e_ = new_L(0);
i = 0;
m++;
i ^= ij[e->h];
hierholzer(e, i);
m--;
if (m != 0) {
printf("IMPOSSIBLE\n");
return 0;
i = 0;
i ^= ij[e->h];
printf("\n");
return 0;
#include <stdio.h>
#define N 2500
#define M 5000
int main() {
int n, m, h, r, a, b, c, k;
long long d;
d = dd[a] + c;
if (dd[b] > d) {
dd[b] = d;
pp[b] = a;
if (r == n - 1) {
while (!used[b]) {
used[b] = 1;
b = pp[b];
k = 0;
while (used[b]) {
used[b] = 0;
ii[k++] = b;
b = pp[b];
ii[k++] = b;
printf("YES\n");
while(k--)
printf("\n");
return 0;
}
}
printf("NO\n");
return 0;
HASHING :-
#include <bits/stdc++.h>
int main() {
int t;
cin >> t;
while(t--) {
long long a, b, c, d, m;
int n;
cin >> n;
int arr[n];
long long x = (((((((a * arr[i]) % m) * ((arr[i] * arr[i]) % m)) % m) + (b * ((arr[i] * arr[i]) % m) % m) + ((c * arr[i]) % m) + d) % m) + m) %
m;
if(mp.find(x) != mp.end())
ans += mp[x];
mp.clear();
return 0;
#include<stdio.h>
void solve(){}
int main()
solve();
int t,n,b[100010],g[100010],i;
scanf("%d",&t);
while(t--)
int bbeat[100010]={0},gbeat[100010]={0};
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&b[i]);
for(i=1;i<=n;i++)
scanf("%d",&g[i]);
for(i=1;i<=n;i++)
if(g[b[i]]!=i)
bbeat[g[b[i]]]++;
if(b[g[i]]!=i)
gbeat[b[g[i]]]++;
int max=-1;
for(i=1;i<=n;i++)
if(bbeat[i]>max)
max=bbeat[i];
if(gbeat[i]>max)
max=gbeat[i];
int count=0;
for(i=1;i<=n;i++)
count++;
}
count++;
printf("%d %d \n",max,count/2);
return(0);
printf("while(true)");
#include<iostream>
int main()
int i,t,q,m,n;
cin>>t>>q;
int a[t];
f(i,0,t)
a[i]=0;
for(i=0;i<q;i++){
cin>>m>>n;
if(m==1){
a[n]=1;
if(m==2){
int cnt=0,j=0;
for(j=n;j<q;j++){
if(a[j]==1)
cnt=1;
break;
if(cnt==1)
cout<<j<<endl;
else
cout<<"-1"<<endl;
return 0;
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main()
scanf("%d", &cases);
int results[cases];
for(i=0;i<cases;i++) {
flag = 0;
bins[j] = 0;
char str[N][100];
scanf("%s", str[j]);
len = strlen(str[j]);
//printf("%d\n", len);
bins[len] += 1;
if (bins[j] % K != 0) {
results[i] = 0;
flag = 1;
break;
if (flag == 0) {
results[i] = 1;
}
for (i=0; i<cases; i++) {
if (results[i] == 0) {
printf("Not possible\n");
else {
printf("Possible\n");
return 0;
#include <stdio.h>
#include<math.h>
int v[2000000],i,t;
double fi;
int main()
fi=((double)((1+sqrt(5))/2.0));
for(i=1;i<=1000000;i++)
v[i]=-1;
for(i=1;i<=1000000;i++)
v[(int)(fi*(double)i)] = (int)(fi*fi*i);
scanf("%d",&t);
while(t--){
int a,b;
scanf("%d %d",&a,&b);
if(v[a]==b)
printf("sami\n");
else
printf("canthi\n");
return 0;
#include <iostream>
#include <set>
set<pair<int, int>> h;
h.insert(make_pair(arr[i], arr[j]));
}
return h.size();
int main()
int n,i;
cin>>n;
int arr[n];
for(i=0;i<n;i++)
cin>>arr[i];
return 0;
cout<<"if(arr[i]>max) ";
#include <bits/stdc++.h>
f(i,0,n){
if(a==s[i]){
return true;
}
return false;
int main() {
int z,j=0;
cin>>z;
char i,b[26];
string s;
cin>>s;
int n=s.size();
if(cmp(i,s,n)){
b[j++]=i;
continue;
//continue;
else
sort(b,b+j);
else{
f(i,0,j)
cout<<b[j-i-1]<<" ";
//cout<<s[n-i];
return 0;
}
#include <iostream>
int main(){
int n,i;
cin>>n;
int a[n];
for(i=0;i<n;i++)
cin>>a[i];
int k;
cin>>k;
f(i,0,n){
f(j,0,n){
if(a[i]+a[j]==k)
cout<<"YES";
return 0;
cout<<"NO";
return 0;
cout<<"if(a[i]+a[j]>k)";
}
#include<bits/stdc++.h>
int a[100001];
int divi[1000001];
LL f[1000001];
int main()
int n;
divi[j]++;
cin >> n;
f[divi[a[i]]]++;
LL ans = 0;
}
cout << ans << endl;
return 0;
cout<<"while(--N)";
#include<bits/stdc++.h>
void solve(){}
int32_t main() {
solve();
int T;
cin>>T;
while(T--) {
bool ans=true;
int val=0;
int n;
cin>>n;
int temp;
int mx[50001],cnt[50001];
memset(mx,0,sizeof(mx));
memset(cnt,0,sizeof(cnt));
int tp=2;
mx[0]=1;
for(int i=1;i<50001;i++) {
mx[i]=tp;
if(tp%6==0) {
i++;
mx[i]=tp;
tp++;
for(int i=0;i<n;i++) {
cin>>temp;
temp--;
cnt[temp]++;
for(int i=0;i<50001;i++) {
if(i>0)
cnt[i]+=cnt[i-1];
if(cnt[i]>mx[i]) {
ans=false;
val=i;
break;
if(ans)
else
val=mx[val];
cout<<"Goodbye Rick\n"<<val<<endl;
return 0;
}
Rick was besieged by walkers after the Governor's raid on the prison. They are approaching
him from all sides. Assume Rick possesses a limitless supply of ammunition. Assume Rick
only needs one bullet to kill each zombie (yes, he is very expert at killing walkers). They
must be shot in the head. Take a look at how excellent he is).
As soon as he kills one walker, the remainder of the zombies advance 1 metre. There are n
walkers in front of Rick, each at a different distance. Rick will perish if any walker is able to
reach him. You must now determine whether he will live or die. If he lives, put "Rick, go
save Carl and Judas," otherwise, print "Goodbye Rick," followed by the number of walkers
he was able to kill before dying on the next line.
Rick's gun can also fire 6 rounds without reloading. He reloads in 1 second, during which
time walkers advance 1 metre.
#include<bits/stdc++.h>
void solve(){}
int32_t main() {
solve();
int T;
cin>>T;
while(T--) {
bool ans=true;
int val=0;
int n;
cin>>n;
int temp;
int mx[50001],cnt[50001];
memset(mx,0,sizeof(mx));
memset(cnt,0,sizeof(cnt));
int tp=2;
mx[0]=1;
for(int i=1;i<50001;i++) {
mx[i]=tp;
if(tp%6==0) {
i++;
mx[i]=tp;
tp++;
for(int i=0;i<n;i++) {
cin>>temp;
temp--;
cnt[temp]++;
for(int i=0;i<50001;i++) {
if(i>0)
cnt[i]+=cnt[i-1];
if(cnt[i]>mx[i]) {
ans=false;
val=i;
break;
if(ans)
else
val=mx[val];
cout<<"Goodbye Rick\n"<<val<<endl;
return 0;
}
You are given with integers a,b,c,d,m. These represent the modular equation of a
curve y2mod m=(ax3+bx2+cx+d) mod m
Also, you are provided with an array A of size N. Now, your task is to find the number of
pairs in the array that satisfy the given modular equation.
#include <bits/stdc++.h>
int main() {
int t;
cin >> t;
while(t--) {
long long a, b, c, d, m;
int n;
cin >> n;
int arr[n];
long long x = (((((((a * arr[i]) % m) * ((arr[i] * arr[i]) % m)) % m) + (b * ((arr[i] * arr[i]) % m) % m) + ((c
* arr[i]) % m) + d) % m) + m) % m;
if(mp.find(x) != mp.end())
ans += mp[x];
return 0;
Canthi and Sami are having a game! The game is extremely similar to chess, but there is only
one piece on the board, which is the Queen. In addition, Queen may only go to the top left
corner.
For clarification, If Queen is placed at i,j then in a turn queen can move:
1) Any number of cells leftwards.
2) Any number of cells upwards.
3) Any number of cells Diagonally(only N-W direction).
Please note that board is quarter infinite i.e there is a top left corner but it extends to infinity
in south and east direction..
#include <stdio.h>
#include<math.h>
int v[2000000],i,t;
double fi;
int main()
fi=((double)((1+sqrt(5))/2.0));
for(i=1;i<=1000000;i++)
v[i]=-1;
for(i=1;i<=1000000;i++)
v[(int)(fi*(double)i)] = (int)(fi*fi*i);
scanf("%d",&t);
while(t--){
int a,b;
scanf("%d %d",&a,&b);
if(v[a]==b)
printf("sami\n");
else
printf("canthi\n");
return 0;
Shantam is extremely wealthy, much more so than Richie Rich. Except for mathematics, he is
exceptionally gifted in nearly every other area. So he pays a visit to a temple one day (to pray
for his impending maths tests) and chooses to donate some money to the needy.( everyone is
poor on a relative scale to Shantam). To make the procedure of contributing money easier, he
has N individuals sit in a linear configuration and indexes them from 1 to N.
Their method of doing things is weird and unusual, as it is with all wealthy people. Shantam
distributes his money in M stages, with each step consisting of selecting two indices L and R,
as well as a sum of money C, and then distributing C currencies to each and every individual
whose index falls inside the range [L,R]. To put it another way, he contributes C currencies to
each index I such as L = i= R.
Fortunately, you were one of the N persons chosen, and you know all of the M steps ahead of
time. Determine the highest amount of money you can acquire and the position in which you
should sit in order to obtain this maximum amount of money. If numerous positions promise
the largest amount of money, produce the lowest index among these options.
#include <stdio.h>
#include <string.h>
*l = *r;
*r = temp;
int main()
for(i=0;i<t;i++)
scanf(" %lld %lld %lld %lld %lld %lld", &l, &r, &c, &p, &q, &s);
deltas[l] += c;
if (r < n - 1)
deltas[r+1] -= c;
temp_l = (l * p + r) % n + 1;
temp_r = (r * q + l) % n + 1;
l = temp_l;
r = temp_r;
if(l > r)
swap(&l, &r);
c = (c * s) % 1000000 + 1;
max = 0;
sum = 0;
pos = 0;
for (j = 0; j < n; j++)
sum += deltas[j];
max = sum;
pos = j;
return 0;
Now you must determine whether any two items of the array A add up to the number K.
if two items are in different places in the array, they are regarded different.
Print "YES" (without quotations) if such a pair of integers exists; else, print "NO" (without
quotes).
#include <iostream>
int main(){
int n,i;
cin>>n;
int a[n];
for(i=0;i<n;i++)
cin>>a[i];
int k;
cin>>k;
f(i,0,n){
f(j,0,n){
if(a[i]+a[j]==k)
cout<<"YES";
return 0;
cout<<"NO";
return 0;
cout<<"if(a[i]+a[j]>k)";
Question description
You are given an array A of length N which is initialised with 0. You will be given Q queries of two types:
: print the smallest index x which is greater than or equal to y and having value 1. If there is no such
index print 1.
#include<iostream>
int main()
int i,t,q,m,n;
cin>>t>>q;
int a[t];
f(i,0,t)
a[i]=0;
for(i=0;i<q;i++){
cin>>m>>n;
if(m==1){
a[n]=1;
if(m==2){
int cnt=0,j=0;
for(j=n;j<q;j++){
if(a[j]==1)
cnt=1;
break;
if(cnt==1)
cout<<j<<endl;
else
cout<<"-1"<<endl;
return 0;
Little Chandan is an exceptional manager - apart from his role in university as the person who
has to bug everyone, in general... and if possible, try to get some work done.
He's also offered a job as the coach of the best Russian teams participating for ACM-ICPC
World Finals. Now, Chandan is an extremely good coach, too. But he's a weird person who
thrives on patterns in life, in general. So, he has decided that if there are n number of students
in total, and he is supposed to divide them in camps of k students - he want them to be
arranged in such a way that the length of names of all the students in a camp is equal.
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main()
scanf("%d", &cases);
int results[cases];
for(i=0;i<cases;i++) {
flag = 0;
bins[j] = 0;
char str[N][100];
scanf("%s", str[j]);
len = strlen(str[j]);
//printf("%d\n", len);
bins[len] += 1;
}
if (bins[j] % K != 0) {
results[i] = 0;
flag = 1;
break;
if (flag == 0) {
results[i] = 1;
if (results[i] == 0) {
printf("Not possible\n");
else {
printf("Possible\n");
return 0;
You are given a string which comprises of lower case alphabets (a-z), upper case alphabets
(A-Z), numbers, (0-9) and special characters like !,-.; etc.
You are supposed to find out which character occurs the maximum number of times and
the number of its occurrence, in the given string. If two characters occur equal number of
times, you have to output the character with the lower ASCII value.
For example, if your string was: aaaaAAAA, your output would be: A 4, because A has
lower ASCII value than a.
#include<bits/stdc++.h>
int main(){
string s;
getline(cin,s);
map<char,ll> m;
int z=s.size();
for(ll i=0;i<z;i++){
m[s[i]]++;
ll max=0;
char res;
for(auto i:m){
if((i.second>max)){
max=i.second;
res=i.first;
cout<<res<<" "<<max;
return 0;
cout<<"for(i=0;i<l;i++)";
There are n boys and m girls in a school. Next week a school dance will be organized. A dancing pair
consists of a boy and a girl, and there are k potential pairs.
Your task is to find out the maximum number of dance pairs and show how this number can be
achieved.
#include <stdio.h>
#define N 500
#define M 1000
struct L {
struct L *next;
int v;
} aa[N + 1];
l->v = v;
int bfs(int n) {
head = cnt = 0;
dd[0] = n;
if (vv[u] == 0) {
dd[u] = 0;
qq[head + cnt++] = u;
} else
dd[u] = n;
while (cnt) {
struct L *l;
u = qq[cnt--, head++];
d = dd[u] + 1;
if (dd[w] == n) {
dd[w] = d;
if (w == 0)
return 1;
qq[head + cnt++] = w;
return 0;
struct L *l;
int d;
if (u == 0)
return 1;
d = dd[u] + 1;
vv[u] = v;
uu[v] = u;
return 1;
dd[u] = n;
return 0;
int hopcroft_karp(int n) {
int m = 0;
while (bfs(n)) {
int u;
m++;
}
return m;
int main() {
int n, n_, m, u, v;
while (m--) {
link(u, v);
printf("%d\n", hopcroft_karp(n));
if (vv[u])
return 0;
A game consists of n rooms and m teleporters. At the beginning of each day, you start in
room 1 and you have to reach room n.
You can use each teleporter at most once during the game. How many days can you play if
you choose your routes optimally?
Constraints
#include <stdio.h>
#define N 500
#define M 1000
struct L {
struct L *next;
int h;
} aa[N * 2];
dd[i] = n;
dd[s] = 0;
head = cnt = 0;
qq[head + cnt++] = s;
while (cnt) {
struct L *l;
i = qq[cnt--, head++];
d = dd[i] + 1;
if (cc[h = l->h]) {
if (dd[j] == n) {
dd[j] = d;
if (j == t)
return 1;
qq[head + cnt++] = j;
return 0;
struct L *l;
int h, j, d;
if (i == t)
return 1;
d = dd[i] + 1;
if (cc[h = l->h]) {
j = i ^ ij[h >> 1];
return 1;
dd[i] = n;
return 0;
int f = 0;
f++;
return f;
ij[h] = i ^ j;
cc[h << 1] = c;
l->h = h << 1;
l->h = h << 1 ^ 1;
int qq[N];
int cnt = 0;
while (i != t) {
struct L *l;
int h;
qq[cnt++] = i;
break;
qq[cnt++] = t;
return cnt;
int main() {
int n, m, h, i, j, k, s, t, cnt;
s = 0, t = (n - 1) << 1 ^ 1;
k = dinic(n * 2, s, t);
printf("%d\n", k);
while (k--) {
printf("\n");
return 0;
}
Kaaleppi has just robbed a bank and is now heading to the harbor. However, the police wants to
stop him by closing some streets of the city.
What is the minimum number of streets that should be closed so that there is no route between the
bank and the harbor?
#include <stdio.h>
#define N 500
#define M 1000
struct L {
struct L *next;
int h;
} aa[N];
int dd[N];
l->h = h;
dd[i] = n;
dd[s] = 0;
head = cnt = 0;
qq[head + cnt++] = s;
while (cnt) {
struct L *l;
i = qq[cnt--, head++];
d = dd[i] + 1;
if (cc[h = l->h]) {
if (dd[j] == n) {
dd[j] = d;
if (j == t)
return 1;
qq[head + cnt++] = j;
return 0;
struct L *l;
int h, j, d;
if (i == t)
return 1;
d = dd[i] + 1;
for (l = aa[i].next; l; l = l->next)
if (cc[h = l->h]) {
return 1;
dd[i] = n;
return 0;
int f = 0;
f++;
return f;
int main() {
int n, m, h, i, j;
ij[h] = i ^ j;
cc[h * 4 + 0] = 1;
cc[h * 4 + 2] = 1;
link(i, h * 4 + 0);
link(j, h * 4 + 1);
link(j, h * 4 + 2);
link(i, h * 4 + 3);
if (dd[i] < n) {
struct L *l;
h = l->h;
return 0;
You are playing a game consisting of n planets. Each planet has a teleporter to another planet (or the
planet itself).
You start on a planet and then travel through teleporters until you reach a planet that you have
already visited before.
Your task is to calculate for each planet the number of teleportations there would be if you started
on that planet.
#include <stdio.h>
#include <string.h>
#define N 200000
int main() {
int n, i, j, c, d, q, cnt;
scanf("%d", &n);
for (i = 0; i < n; i++)
cnt = 0;
for(i = 0;i<n;i++) {
if (cc[i] != -1)
continue;
d = 0;
j = i;
cc[j] = -2;
d++;
j = aa[j];
if (cc[j] == -2) {
c = cnt++;
q = 0;
cc[j] = c;
q++;
j = aa[j];
qq[c] = q;
d -= q;
} else {
c = cc[j];
d += dd[j];
j = i;
cc[j] = c;
dd[j] = d--;
j = aa[j];
printf("\n");
return 0;
Consider a network consisting of n computers and m connections. Each connection specifies how
fast a computer can send data to another computer.
Kotivalo wants to download some data from a server. What is the maximum speed he can do this,
using the connections in the network?
#include <bits/stdc++.h>
int n, m;
ll adj[501][501], oadj[501][501];
ll flow[501];
bool V[501];
int pa[501];
bool reachable() {
while(!Q.empty()) {
return V[n];
int main() {
bfs(1,1,1);
link(1,1);
F0R(i,m) {
adj[a][b] += c;
int v, u;
ll maxflow = 0;
while(reachable()) {
ll flow = 1e18;
u = pa[v];
maxflow += flow;
u = pa[v];
adj[u][v] -= flow;
adj[v][u] += flow;
}
You have an undirected graph consisting of 𝑛 vertices with weighted edges.
A simple cycle is a cycle of the graph without repeated vertices. Let the weight of the cycle
be the XOR of weights of edges it consists of.
Let's say the graph is good if all its simple cycles have weight 1. A graph is bad if it's not
good.
Initially, the graph is empty. Then 𝑞 queries follow. Each query has the next type:
• 𝑢 𝑣 𝑥 — add edge between vertices 𝑢 and 𝑣 of weight 𝑥 if it doesn't make the graph
bad.
#include<bits/stdc++.h>
int n,m;
int sum[M],val[M],rev[M],f[M],s[M],c[M][2];
mt19937 rd(time(0));
int read(){
while(ch<'0'||ch>'9'){if(ch=='0')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){rex=rex*10+ch-'0';ch=getchar();}
return rex*f;
return c[f[x]][0]!=x&&c[f[x]][1]!=x;
sum[x]=sum[c[x][0]]^sum[c[x][1]]^val[x];
if(!rev[x])return;
swap(c[x][0],c[x][1]);
rev[c[x][0]]^=1;rev[c[x][1]]^=1;
rev[x]=0;}
int y=f[x],z=f[y],k=c[y][1]==x,ch=c[x][k^1];
if(!isroot(y))c[z][c[z][1]==y]=x;f[x]=z;
c[y][k]=ch;f[ch]=y;
c[x][k^1]=y;f[y]=x;
pushup(y),pushup(x);}
int top=0,u=x;
while(!isroot(u))s[++top]=u,u=f[u];s[++top]=u;
while(top)pushdown(s[top--]);
for(int y=f[x];!isroot(x);y=f[x]){
if(!isroot(y))
rotate(((c[f[y]][1]==y)==(c[y][1]==x))?y:x);
rotate(x);
}}
for(int t=0;x;t=x,x=f[x]){
splay(x);
c[x][1]=t;
pushup(x);
}}
access(x),splay(x);
while(c[x][0])x=c[x][0];
return x;
if(c[x][0])dfs(c[x][0]);
if(c[x][1])dfs(c[x][1]);
if(x>n)val[x]=rd();
sum[x]=sum[c[x][0]]^sum[c[x][1]]^val[x];
int main(){
n=read(),m=read();
for(int i=1;i<=m;++i){
int x=read(),y=read(),v=read(),z=n+i;
val[z]=v;
if(findroot(x)!=findroot(y)){
link(x,z),link(y,z),puts("YES");
else {
split(x,y);
if((sum[y]^v)==1){
puts("YES");
dfs(y);
else puts("NO");
return 0;}
A new species is trying to rule the planet. This species is creating their own population
outburst to dominate other species. It all started with 1 single member of the species. The
population increases in treelike fashion abiding by few rules as listed below.
Given the integral name of new member and it's reproduction capacity that is added to the
population, you have to find it's parent, level at which it is added and it's ascending age wise
rank among siblings.
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
struct cell{
int name;
int level;
int capacity;
};
int front;
int end;
void init_queue(){
front = 0;
end = 0;
queue[end].level = level;
queue[end].capacity = capacity;
end = end + 1;
int is_empty(){
if(end == front)
return 1;
return 0;
void dequeue()
if(!is_empty())
front++;
int main(){
int n,rc;
init_queue();
scanf("%d %d",&n,&rc);
int i,j,k;
for(i=0;i<n;i++){
scanf("%d %d",&arr[i].name,&arr[i].capacity);
enqueue(0,rc,0);
i=0;
while(!is_empty()){
k=1;
for(j=0;j<cap&&i<n;j++,i++){
printf("%d %d %d\n",par,lev,k++);
enqueue(arr[i].name,arr[i].capacity,lev);
dequeue();
return 0;
Mancunian and Liverbird decide to go camping for the weekend after a long week at work.
They came upon an unusual tree with N nodes while walking through a forest. From 1 to N,
the vertices are numbered.
A colour is allocated to each node in the tree (out of C possible colors). They decide to work
together (for a change) and put their reasoning abilities to the test because they are bored. At
vertex 1, the tree is rooted. They aim to locate the nearest ancestor with the same hue for each
node.
#include<bits/stdc++.h>
int main() {
int n,i,c;
int tree[n+1][2];
tree[1][0] = -1;
for(i=2;i<=n;i++) {
scanf("%d", &tree[i][0]);
scanf("%d", &tree[i][1]);
int parent;
parent = tree[i][0];
return 0;
You're given a K-ary infinite tree rooted at a vertex numbered 1. All its edges are weighted 1
initially.
[K∗X+0,K∗X+1,K∗X+2,K∗X+3,K∗X+4,.......K∗X+(K−1)]
You are given Q queries to answer which will be of the following two types:
#include <iostream>
#include <map>
#include <assert.h>
map < pair < int, int >, int > adj;
int depth = 0;
while ( u > 0 ) {
u = u / k;
depth = depth + 1;
return depth - 1;
int dist = 0;
int depth_u = find_depth( u, k );
swap ( u, v );
if ( adj.count( { u, u / k } ) ) {
} else {
dist = dist + 1;
depth_u = depth_u - 1;
u = u / k;
while ( u != v ) {
if ( adj.count( { u, u / k } ) ) {
} else {
dist = dist + 1;
if ( adj.count( { v, v / k } ) ) {
} else {
dist = dist + 1;
u = u / k;
v = v / k;
return dist;
}
void add_weight( int vertex, int parent, int w ) {
swap ( u, v );
add_weight( u, u / k, w );
depth_u = depth_u - 1;
u = u / k;
while ( u != v ) {
add_weight( u, u / k, w );
add_weight( v, v / k, w );
u = u / k;
v = v / k;
signed main() {
int k, q, x, u, v, w;
while(q--) {
cin >> x;
if ( x == 1 ) {
cin >> u >> v;
} else {
increase_weights( u, v, w, k );
Football is Monk's favourite sport, and his favourite team is "Manchester United."
Manchester United has qualified for the Champions League Final, which will take place at
London's Wembley Stadium. As a result, he decided to go watch his favourite team play.
When he arrived at the stadium, he noticed that there was a long wait for match tickets. He is
aware that the stadium has M rows, each with a distinct seating capacity. They could or might
not be comparable. The cost of a ticket is determined by the row. If there are K(always higher
than 0) empty seats in a row, the ticket will cost K pounds (units of British Currency).
Now, every football fan standing in the line will get a ticket one by one.
Given the seating capacities of different rows, find the maximum possible pounds that the
club will gain with the help of the ticket sales.
#include <bits/stdc++.h>
int main()
seats.push(a);
assert (1<=a and a<=1000000);
x[a]++;
cout <<ans;
return 0;
Problem Description
You are given a weighted graph with N vertices and M edges. Find the total weight of
its maximum spanning tree.
Constraints
• 1 <= T <= 20
• 1 <= N <= 5000
• 1 <= M <= 100 000
• 1 <= c <= 10 000
#include<bits/stdc++.h>
struct edge
int u;
int v;
int w;
};
edge a[100005];
int parent[100005];
bool comp (edge a , edge b)
return a.w>b.w;
if(parent[u]==u)
return u;
else
return parent[u]=find_parent(parent[u]);
parent[u]=v;
int main()
int t;
cin>>t;
while(t--) {
int n,m;
cin>>n>>m;
for(int i=1;i<=n;i++)
parent[i]=i;
for(int i=0;i<m;i++) {
sort(a,a+m,comp);
ll ans=0;
for(int i=0;i<m;i++) {
int x=find_parent(a[i].u);
int y=find_parent(a[i].v);
if(x!=y)
merge(x,y);
ans+=a[i].w;
cout<<ans<<endl;
return 0;
Note that if you delete a particular directory, all its child directories will also get deleted.
Constraints
#include <stdio.h>
#include <stdlib.h>
lint getnl() {
n = n * 10 + c-'0';
c = gcx();
if(neg) n *= -1;
return n;
if (0 == li) {
while (li) {
li /= 10;
if(lc) pcx(lc);
int main () {
lint N = getnl();
int PA[N+1];
lint D = getnl();
int DA[D];
if (DLT[1]) {
lint pi = PA[DA[ni++]];
while (pi>0) {
else piv[pi] = 1;
pi = PA[pi];
//pcx('\n');
putl(D-dLess, 0);
return 0;
Given two rooted trees, your task is to find out if they are isomorphic, i.e., it is possible to draw them
so that they look the same.
#include <bits/stdc++.h>
vi h, id;
vector<vi> g;
dfs(j, i);
h[i]=max(h[i], h[j]+1);
lvl[h[i]].push_back(i);
int main() {
cin.sync_with_stdio(0); cin.tie(0);
cin.exceptions(cin.failbit);
int t;
cin >> t;
while(t--) {
int n;
cin >> n;
int m=2*n+1;
g.assign(m, vi());
rep(i, 0, 2) {
rep(j, 0, n-1) {
int a, b;
a+=i*n, b+=i*n;
g[a].push_back(b);
g[b].push_back(a);
g[0]={1, n+1};
h.assign(m, 0);
id.assign(m, 0);
lvl.clear();
dfs(0, -1);
if (h[1]!=h[n+1]) {
continue;
trav(l, lvl) {
map<vector<ll>, int> u;
trav(i, l.second) {
vector<ll> cur;
sort(all(cur));
if (!u.count(cur)) {
int s=sz(u);
u[cur]=s;
id[i]=u[cur];
}
return 0;
Mohana and john are friends in kerala, both of them have a forest with nodes numbered from
1 to 𝑛, and they would like to add edges to their forests such that:
Mohana and johns want to know the maximum number of edges they can add, and which
edges to add.
Constraints:
#include<bits/stdc++.h>
int fa[1005],fa2[1005],n,m1,m2;
return f[x]==x?x:f[x]=gf(f[x],f);
int main(){
cin>>n>>m1>>m2;
for(int i=1;i<=n;i++)fa[i]=fa2[i]=i;
for(int i=1,x,y;i<=m1;i++)cin>>x>>y,fa[gf(x,fa)]=gf(y,fa);
for(int i=1,x,y;i<=m2;i++)cin>>x>>y,fa2[gf(x,fa2)]=gf(y,fa2);
cout<<n-max(m1,m2)-1<<'\n';
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
if(gf(i,fa)!=gf(j,fa)&&gf(i,fa2)!=gf(j,fa2)){
cout<<i<<' '<<j<<'\n';
fa[gf(i,fa)]=gf(j,fa);
fa2[gf(i,fa2)]=gf(j,fa2);
return 0;
cout<<"while(m1--)";
A company has n employees, who form a tree hierarchy where each employee has a boss, except for
the general director.
Your task is to process q queries of the form: who is the lowest common boss of employees a and b
in the hierarchy?
#include <stdio.h>
#define N 200000
int main() {
int n, q, p, i, j, k, tmp;
dd[i] = dd[p] + 1;
pp[0][i] = p;
while(q--) {
tmp = i, i = j, j = tmp;
if (dd[i] != dd[j])
i = pp[k][i];
if (i != j) {
i = pp[k][i];
j = pp[k][j];
i = pp[0][i];
printf("%d\n", i + 1);
return 0;
A company has n employees, who form a tree hierarchy where each employee has a boss, except for
the general director.
Your task is to process q queries of the form: who is employee x's boss k levels higher up in the
hierarchy?
#include<bits/stdc++.h>
#define pb push_back
vector<int>tree[MAX];
ll up[MAX][20];
void solve(){}
up[i][0]=j;
for(int m=1;m<20;m++){
if(up[i][m-1]!=-1)
up[i][m]=up[up[i][m-1]][m-1];
else
up[i][m]=-1;
for(auto child:tree[i]){
if(child!=j) link(child,i);
for(int i=19;i>=0;i--){
return ans_query(up[src][i],jump-(1<<i));
return 1;
int main(){
solve();
int n,q;
cin>>n>>q;
for(int i=2;i<=n;i++){
int ee;
cin>>ee;
tree[i].pb(ee);
tree[ee].pb(i);
link(1,-1);
while(q--){
int node,jump;
cin>>node>>jump;
cout<<ans_query(node,jump)<<endl;
Question description
Given an array of n integers, your task is to process q queries of the form: what is the sum of values in
range [a,b]?
Constraints
• 1≤n,q≤2⋅10^5
#include<bits/stdc++.h>
int main(){
int n,q,i,a,b;
cin>>n>>q;
int x[n];
for(i=0;i<n;i++)
cin>>x[i];
while(q--){
int sum=0;
cin>>a>>b;
for(i=a;i<=b;i++)
sum=sum+x[i-1];
cout<<sum<<endl;
You are given a list consisting of n integers. Your task is to remove elements from the list at
given positions, and report the removed elements.
Constraints
• 1≤n≤2⋅10^5
• 1≤xi≤10^9
• 1≤pi≤n−i+1
#include <stdio.h>
#define N 200000
tr[k] = r - l;
if (r - l > 1) {
int m = (l + r) / 2;
build(k * 2 + 1, l, m);
build(k * 2 + 2, m, r);
tr[k]--;
if (r - l == 1)
return r;
m = (l + r) / 2, k1 = k * 2 + 1, k2 = k * 2 + 2;
int main() {
int n, h, i, x;
scanf("%d", &n);
int aa[n];
scanf("%d", &aa[i]);
build(0, 0, n);
scanf("%d", &x);
i = query(0, 0, n, x) - 1;
printf("\n");
return 0;
Question description
There are n children, and each of them independently gets a random integer number of candies
between 1 and k.
Constraints
• 1≤n≤100
• 1≤k≤100
#include <bits/stdc++.h>
int N, K;
double ans, a, b;
int main(){
a = b = 1.0;
for(int j = 1; j <= N; j++){
a *= (double) i / K;
b *= (double) (i-1) / K;
ans += (a-b) * i;
printf("%.6f\n", ans);
return 0;
There are n hotels on a street. For each hotel you know the number of free rooms. Your task
is to assign hotel rooms for groups of tourists. All members of a group want to stay in the
same hotel.
The groups will come to you one after another, and you know for each group the number of
rooms it requires. You always assign a group to the first hotel having enough rooms. After
this, the number of free rooms in the hotel decreases.
Constraints
#include <stdio.h>
#define N 200000
if (r - l == 1)
tr[k] = hh[l];
else {
int m = (l + r) / 2, k1 = k * 2 + 1, k2 = k * 2 + 2;
build(k1, l, m);
build(k2, m, r);
if (r - l == 1) {
tr[k] -= x;
return l;
m = (l + r) / 2, k1 = k * 2 + 1, k2 = k * 2 + 2;
return i;
int main() {
int n, m, i;
for(i=0;i<n;i++)
scanf("%d", &hh[i]);
build(0, 0, n);
while (m--) {
int x, i;
scanf("%d", &x);
printf("\n");
return 0;
Question description
You are given a string. You can remove any number of characters from it, but you cannot
change the order of the remaining characters.
Constraints
• 1≤n≤5⋅10^5
#include <stdio.h>
#define N 500000
#define MD 1000000007
int main() {
int i, k, c, kc;
scanf("%s", cc);
k = 0;
for(i=0;cc[i];i++) {
c = cc[i] - 'a';
kc = kk[c];
kk[c] = k + 1;
return 0;
Joe root is a Placement trainer. he is working as CDC trainer in reputed institution that during
training the youngsters are struggling in queue concept.
Joe root usually gives interesting problems to the students to make them love the DS.
One such day Joe root provided to the final year students to solve the task such that, Queue
implementation with arrays as using linked list for implementing queue and delete an element
from the queue using linked list concept.
Queue data structures work on the FIFO architecture so the element that has entered first in
the list will go out from the list first.
Final Year students were lacking the idea to solve the problem.
#include <stdio.h>
#include <stdlib.h>
struct node
{
int data;
};
ptr = ptr->next;
void enqueue(int d)
if(new_n==NULL){
printf("Queue is Full");
else{
new_n->data = d;
new_n->next = NULL;
if(front==NULL){
front=rear=new_n;
else{
rear->next = new_n;
rear=new_n;
}
int dequeue()
if(front==NULL){
printf("Queue is Empty\n");
else{
front = front->next;
val = ptr->data;
free(ptr);
return val;
int main()
int n,i,t;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&t);
enqueue(t);
linkedListTraversal(front);
dequeue();
printf("\n");
linkedListTraversal(front);
return 0;
Anderson usually gives interesting problems to the students to make them love the DS.
One such day Joe Anderson provided to the final year students to solve the task such that,
Circular Queue using Linked List. there is no memory waste while using Circular Queue, it is
preferable than using a regular queue.
Because linked lists allow for dynamic memory allocation, they are simple to build.
Circular Queue implementation using linked list is identical to circular linked list except that
circular Queue has two pointers front and back whereas circular linked list only has one
pointer head.
Final Year students were lacking the idea to solve the problem.
#include <stdio.h>
#include <stdlib.h>
struct node
int data;
};
void enqueue(int d)
{
struct node *n;
if(n==NULL){
printf("Queue is Full");
else{
n->data = d;
n->next = NULL;
if(f==NULL){
f=r=n;
else{
r->next = n;
r=n;
int dequeue()
struct node* t;
t = f;
if(f==NULL){
printf("Queue is Empty\n");
else{
f = f->next;
val = t->data;
free(t);
return val;
int main()
int n,i,t;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&t);
enqueue(t);
for(i=0;i<n;i++){
printf("%d\n",dequeue());
return 0;
On the last day of the semester, Shahid's students were talking and playing very loudly to the
delight of the end of the semester. The principal of the college severely reprimanded Shahid.
But he decided to engage them in a different activity without getting angry at the students.
So Shahid gave his students to solve the task such that, Circular Queue using Linked List and
dequeue two elements from circular queue.
there is no memory waste while using Circular Queue, it is preferable than using a regular
queue.
Because linked lists allow for dynamic memory allocation, they are simple to build.
Circular Queue implementation using linked list is identical to circular linked list except that
circular Queue has two pointers front and back whereas circular linked list only has one
pointer head.
Final Year students were lacking the idea to solve the problem.
#include <stdio.h>
#include <stdlib.h>
struct node
int data;
};
ptr = ptr->next;
void enqueue(int d)
{
struct node *n;
if(n==NULL){
printf("Queue is Full");
else{
n->data = d;
n->next = NULL;
if(f==NULL){
f=r=n;
else{
r->next = n;
r=n;
int dequeue()
struct node* t;
t = f;
if(f==NULL){
printf("Queue is Empty\n");
else{
f = f->next;
val = t->data;
free(t);
return val;
int main()
int n,i,t;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&t);
enqueue(t);
linkedListTraversal(f);
for(i=0;i<2;i++){
dequeue();
printf("\n");
linkedListTraversal(f);
return 0;
Ramesh usually gives interesting problems to the youngsters to make them love the DS.
One such day Sathya provided to the youngsters to solve the task such that, delete an element
in a Queue, Queue data structures work on the FIFO architecture so the element that has
entered first in the list will go out from the list first.
Youngsters were lacking the idea to solve the problem.
#include <stdio.h>
#include <stdlib.h>
struct node
int data;
}*front=NULL,*rear=NULL;
ptr = ptr->next;
n->data = data;
n->next = NULL;
if(front==NULL){
front=rear=n;
}
else{
rear->next = n;
rear=n;
void dequeue()
struct node* t;
t = front;
front = front->next;
free(t);
int main()
int n,i,data;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&data);
enqueue(data);
printf("Dequeuing elements:");
for(i=0;i<n;i++){
dequeue();
printf("\n");
linkedListTraversal(front);
}
return 0;
printf("for(i=front;i<=rear;i++)");
Sathya usually gives interesting problems to the youngsters to make them love the DS.
One such day Sathya provided to the youngsters to solve the task such that, insert an element
in a Queue in FIFO order
Function Description
#include <stdio.h>
void enqueue(int);
void display();
int main() {
int n,data,i;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&data);
enqueue(data);
display();
return 0;
}
if (rear == SIZE - 1)
printf("Queue is Full!!");
else {
if (front == -1)
front = 0;
rear++;
items[rear] = data;
void display() {
if (rear == -1)
printf("\nQueue is Empty!!!");
else {
int i;
for(i=front;i<=rear;i++)
There is a bit string consisting of n bits. Then, there are some changes that invert one given bit. Your
task is to report, after each change, the length of the longest substring whose each bit is the same.
#include <stdio.h>
#include <string.h>
#define N 200000
int m = (l + r) / 2, k1 = k * 2 + 1, k2 = k * 2 + 2;
pp[k] = pp[k1];
pp[k] += pp[k2];
qq[k] = qq[k2];
qq[k] += qq[k1];
if (cc[m - 1] == cc[m])
int m;
if (r - l == 1) {
return;
}
m = (l + r) / 2;
build(k * 2 + 1, l, m);
build(k * 2 + 2, m, r);
pull(k, l, r);
int m;
if (r - l == 1) {
return;
m = (l + r) / 2;
if (i < m)
update(k * 2 + 1, l, m, i);
else
update(k * 2 + 2, m, r, i);
pull(k, l, r);
int main() {
int n, m;
n = strlen(cc);
build(0, 0, n);
while (m--) {
int i;
update(0, 0, n, i);
printf("\n");
return 0;
1. append the character # to the string (we assume that # is lexicographically smaller
than all other characters of the string)
2. generate all rotations of the string
3. sort the rotations in increasing order
4. based on this order, construct a new string that contains the last character of each
rotation
For example, the string babc becomes babc#. Then, the sorted list of rotations is #babc,
abc#b, babc#, bc#ba, and c#bab. This yields a string cb#ab.
#include<bits/stdc++.h>
int main() {
int i;
string s; cin>>s;
vector<int> v;
vector<int> a[26];
int n= s.size();
for(i=0;i<=n;i++) {
if (s[i] == '#')
v.push_back(i);
else
a[s[i]-'a'].push_back(i);
v.push_back(j);
string ans;
int j = v[v[0]];
while(s[j] != '#') {
ans += s[j];
j = v[j];
cout<<ans;
return 0;
lala is a Placement trainer. he is working as CDC trainer in reputed institution that during
training the youngsters are struggling in queue concept. Lala usually gives interesting
problems to the students to make them love the DS. One such day Lala provided to the final
year students to solve the task such that, Queue implementation with arrays as using linked
list for implementing queue, Queue data structures work on the FIFO architecture so the
element that has entered first in the list will go out from the list first.
Final Year students were lacking the idea to solve the problem.
#include <stdlib.h>
struct node
int data;
};
ptr = ptr->next;
void enqueue(int d)
if(new_n==NULL){
printf("Queue is Full");
else{
new_n->data = d;
new_n->next = NULL;
if(front==NULL){
front=rear=new_n;
else{
rear->next = new_n;
rear=new_n;
int main()
int n,i,t;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&t);
enqueue(t);
linkedListTraversal(front);
return 0;
Rathik organized technical round interview in Macrosoft for the set of computer science
candidates.
The problem is to perform Implement a stack using single queue. you have to use queue data
structure, the task is to implement stack using only given queue data structure.
Rathik have given the deadline of only 5 minutes to complete the problem.
Can you Help the candidates to complete the problem within the specified time limit ?
Function Description
#include <bits/stdc++.h>
int main()
int n,m,temp;cin>>n>>m;
stack<int> stk;
cin>>temp;
stk.push(temp);
return 0;
The stock span problem is a financial problem where we have a series of n daily price quotes
for a stock and we need to calculate span of stock’s price for all n days.
The span Si of the stock’s price on a given day i is defined as the maximum number of
consecutive days just before the given day, for which the price of the stock on the current day
is less than or equal to its price on the given day.
For example, if an array of 7 days prices is given as {100, 80, 60, 70, 60, 75, 85},
int main()
int n;cin>>n;
cin>>arr[i];
int j = i-1;
while(arr[i]>arr[j]) j--;
cout<<i-j<<' ';
return 0;
Arumugam is in the process of reorganising her library. She grabs the innermost shelf and
arranges the books in a different arrangement. She shatters the shelf's walls. There will be no
shelf barriers and simply books in the end. Make a printout of the book order.
Opening and closing walls of shelves are shown by '/' and '\' respectively whereas books are
represented by lower case alphabets.
#include <bits/stdc++.h>
int main()
string s,temp="";
cin>>s;
stack<string> stk;
if(s[i]==47||s[i]==92){
if(!temp.empty()){
stk.push(temp);
temp.clear();
else{
temp.push_back(s[i]);
while(!stk.empty()){
cout<<stk.top();
stk.pop();
return 0;
Rajinikanth organised technical round interview in Animation company for the set of
computer science candidates.
the task is to implement stack operations for two stacks and merge the stacks into one.
Rajinikanth have given the deadline of only 15 minutes to complete the problem.
Can you Help the candidates to complete the problem within the specified time limit ?
#include <iostream>
class node {
public:
int data;
node* next;
};
class mystack {
public:
node* head;
node* tail;
mystack()
head = NULL;
tail = NULL;
};
mystack* create()
return ms;
temp->data = data;
temp->next = ms->head;
if (ms->head == NULL)
ms->tail = temp;
ms->head = temp;
if (ms->head == NULL) {
return 0;
else {
ms->head = ms->head->next;
delete temp;
return popped;
if (ms1->head == NULL)
ms1->head = ms2->head;
ms1->tail = ms2->tail;
return;
}
ms1->tail->next = ms2->head;
ms1->tail = ms2->tail;
temp = temp->next;
int main()
int n,m,t;
cin>>n>>m;
for(int i=0;i<n;i++)
cin>>t;
push(t,ms1);
for(int i=0;i<m;i++)
cin>>t;
push(t,ms2);
merge(ms1, ms2);
for(int i=0;i<n+m;i++)
cout<<pop(ms1)<<" ";
A and B are playing a game. In this game, both of them are initially provided with a list
of n numbers. (Both have the same list but their own copy).
Now, they both have a different strategy to play the game. A picks the element from start of
his list. B picks from the end of his list.
1. If the number picked by A is bigger than B then this step's output is 1 . B removes
the number that was picked from their list.
2. If the number picked by A is smaller than B then this step's output is 2 . A removes
the number that was picked from their list.
3. If both have the same number then this step's output is 0 .
Both A and B remove the number that was picked from their list.
This game ends when at least one of them has no more elements to be picked i.e. when the
list gets empty.
#include <bits/stdc++.h>
int main()
int n;cin>>n;
vector<int>v(n);
cin>>v[i];
int a=0,b=n-1;
while(a<n&&b>=0){
if(v[a]==v[b]){
b--;a++;
cout<<"0 ";
else if(v[a]>v[b]){
b--;
cout<<"1 ";
else{
a++;
cout<<"2 ";
return 0;
cout<<"if(a[i]>a[j])";
You're given a stack of N numbers, with the first component representing the stack's top and
the final component being the stack's bottom.
At least one piece from the stack must be removed. You can turn the stack into a queue at any
time.
You cannot convert the queue back into a stack. Your task is to remove exactly K elements
such that the sum of the K removed elements is maximized.
#include <bits/stdc++.h>
int main()
int n,k,i;
cin>>n>>k;
int sum = 0;
int arr[n];
stack<int>st, st2;
for(i=0;i<n;i++){
st.push(arr[i]);
for(i=0;i<k;i++){
st2.push(arr[i]);
sum += arr[i];
sum -= st2.top();
st2.pop();
sum += st.top();
st.pop();
return 0;
Hassan gets a job in a software company in Hyderabad. The training period for the first three
months is 20000 salary. Then incremented to 25000 salaries.
Training is great but they will give you a programming task every day in three months.
Hassan must finish it in the allotted time. His teammate Jocelyn gives him a task to complete
the concept of Infix to Prefix Conversion for a given expression. can you help him?
// CPP program to convert infix to prefix
#include <bits/stdc++.h>
bool isOperator(char c)
int getPriority(char C)
if (C == '-' || C == '+')
return 1;
return 2;
else if (C == '^')
return 3;
return 0;
int l = infix.size();
stack<char> char_stack;
string output;
for (int i = 0; i < l; i++) {
if (isalpha(infix[i]) || isdigit(infix[i]))
output += infix[i];
char_stack.push('(');
output += char_stack.top();
char_stack.pop();
char_stack.pop();
// Operator found
else
{
if (isOperator(char_stack.top()))
if(infix[i] == '^')
output += char_stack.top();
char_stack.pop();
else
output += char_stack.top();
char_stack.pop();
char_stack.push(infix[i]);
while(!char_stack.empty()){
output += char_stack.top();
char_stack.pop();
return output;
/* Reverse String
* Get Postfix
* Reverse Postfix * */
int l = infix.size();
// Reverse infix
reverse(infix.begin(), infix.end());
if (infix[i] == '(') {
infix[i] = ')';
i++;
infix[i] = '(';
i++;
}
string prefix = infixToPostfix(infix);
// Reverse postfix
reverse(prefix.begin(), prefix.end());
return prefix;
// Driver code
int main()
string s;
cin>>s;
return 0;
Dr.Siva jayaprakash is a faculty, who handling data structure course for IT department second
year students.
one day this faculty was handling very interesting topic in data structure such that Linked List,
he has given the following explanation for Linked list concept.
"Linked List is a sequence of links which contains items. Each link contains a connection
to another link. Linked list is the second most-used data structure after array. Following
are the important terms to understand the concept of Linked List.
Link − Each link of a linked list can store a data called an element.
Next − Each link of a linked list contains a link to the next link called Next.
LinkedList − A Linked List contains the connection link to the first link called First."
During this lecture time, principal surprisingly visited to the class and asking to conduct
surprise test on Linked list concept.
The nodes are deleted D times from the end of the given linked list.
For example if the given Linked List is 5->10->15->20->25 and remove 2 nodes,
#include <iostream>
void tel()
return;
struct node
int data;
node *next;
}*head = NULL;
void create()
int n;
cin>>n;
int m;
cin>>m;
p1 -> data = m;
head = p1;
int i;
for(i=0;i<n-1;i++)
int a;
cin>>a;
tt -> data = a;
p1=p1->next;
int del;
cin>>del;
while(nn != NULL)
nn = nn -> next;
if(found) break; }
cout<<"Linked List:";
while(head != NULL)
int main()
create();
return 0;
cout<<"for(i=0;i<n;i++)";
saran, subash, and Yasir alias Pari are three first-year engineering students of the State
Technical Institution (STI), India. While saran and subash are average students who come
from a Middle class, Yasir is from a rich family. saran studies, engineering as per his father's
wishes, while subash, whose family is poor, studies engineering to improve his family's
financial situation.
Yasir, however, studies engineering of his simple passion for developing android
applications.
#include <bits/stdc++.h>
struct Node
int data;
new_node->data = data;
new_node->next = (*head);
new_node->prev = NULL;
if ((*head) != NULL)
(*head)->prev = new_node;
(*head) = new_node;
Node* last;
cout<<node->data<<" ";
last = node;
node = node->next;
cout<<endl;
cout<<last->data<<" ";
last = last->prev;
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++){
int t;
cin>>t;
insertStart(&head, t);
printList(head);
return 0;
Professor Shiva decided to conduct an industrial visit for final year students,
but he set a condition that if students received a passing grade in the surprise test,
He asked the students to study a topic linked list for 10 minutes before deciding to conduct a
surprise test.
Professor-mandated questions, such as the deletion of nodes with a certain data D, are now
being asked.
#include <bits/stdc++.h>
void ss()
return;
int main()
{
int n;
cin>>n;
int arr[n];
cin>>arr[i];
int m;
cin>>m;
cout<<"Linked List:";
for(int p : arr)
if(p != m)
cout<<"->"<<p;
return 0;
Admission for the current Academic year is happening in Most of the Universities across the
Country.
Once the Students got admitted they are assigned a unique Registration Number.
But during enrolment of the student there is a specific entrance test for admitted students to
get scholarship.
now admission cell conducting a test. So your task is generate a program for a singly linked
list, find middle of the linked list.
void MandatoriesSuck(){
class Node {
public:
int data;
Node* next;
Node(int dat){
data = dat;
next = NULL;
};
if(head==NULL){
if(head->next==NULL){
return head;
insertNode(head->next,data);
return head;
if(head==NULL){
return;
printNode(head->next);
cout<<"-->"<<head->data;
int main()
int n,temp,mid;cin>>n;
cin>>temp;
head = insertNode(head,temp);
cout<<"Linked list:";
printNode(head);
return 0;
Dr.Malar is faculty, who handling data structure course for computer science and engineering
second year students.
one day this faculty was handling very interesting topic in data structure such that Linked List,
she has given the following explanation for Linked list concept.
"Linked List is a sequence of links which contains items. Each link contains a connection to
another link. Linked list is the second most-used data structure after array. Following are the
important terms to understand the concept of Linked List.
Link − Each link of a linked list can store a data called an element.
Next − Each link of a linked list contains a link to the next link called Next.
LinkedList − A Linked List contains the connection link to the first link called First."
During this lecture time, last bench students was making continuous disturbance by making
unwanted noise.
The new node is added at given position P of the given Linked List.
#include <bits/stdc++.h>
struct node
int data;
}*head = NULL;
int n;
int in_pos(int n)
int data1;
cin>>data1;
int i =1;
struct node *r = head;
while(i != n-1)
r = r-> next;
i++;
node *s = head;
cout<<"Linked List:";
while(s != NULL)
cout<<"->";
cout<<s-> data;
s = s-> next;
return data1;
void create()
int n;
cin>>n;
int __n;
cin>>__n;
int i;
for(i=0;i<n-1;i++)
int a;
cin>>a;
q -> data = a;
p -> next= q;
p = p->next;
int main()
create();
int r;
cin>>r;
int s = in_pos(r);
return 0;
cout<<s<<"for(i=0;i<n;i++)";
For example, if someone successfully answers this question, they will be given a mobile
phone at a 50% discount.
One of the competition's requirements was to write a C programme that swapped nodes for
two specified keys in a linked list with two keys.
By altering linkages, nodes should be switched.
When data consists of several fields, swapping data across nodes might be costly.
#include <iostream>
struct node
int data;
}*head = NULL;
if (x == y)
return;
prevX = currX;
currX = currX->next;
prevY = currY;
currY = currY->next;
return;
if (prevX != NULL)
prevX->next = currY;
else
*head_ref = currY;
if (prevY != NULL)
prevY->next = currX;
else
*head_ref = currX;
currY->next = currX->next;
currX->next = temp;
void create()
int n;cin>>n;
int rr;cin>>rr;
int i;
for(i=0;i<n-1;i++)
int a;
cin>>a;
q -> data = a;
tt -> next = q;
tt = q;
int main()
{create();
cout<<"before Swapping:";
display(head);
int x,y;
cin>>x>>y;
swapNodes(&head,x,y);
cout<<"\nafter Swapping:";
display(head);
return 0;
A long time ago, there was a desolate village in India. The ancient buildings, streets, and
businesses were deserted. The windows were open, and the stairwell was in disarray. You can
be sure that it will be a fantastic area for mice to romp about in! People in the community
have now chosen to provide high-quality education to young people in order to further the
village's growth.
As a result, they established a programming language coaching centre. People from the
coaching centre are presently performing a test. Create a programme for the GetNth()
function, which accepts a linked list and an integer index and returns the data value contained
in the node at that index position.
#include <iostream>
using namespace std;
struct node
int data;
}*head = NULL;
int i = 0,n;
while(n-i != index)
i++;
int main()
int first;
cin>>n>>first;
head = t;
cin>>first;
t -> next = u;
t = u;
int index;
cin>>index;
cout<<"Linked list:";
display(head);
cout<<"\nNode at index="<<index<<":"<<GetNth(hh,index);
return 0;
There are K nuclear reactor chambers labelled from 0 to K-1. Particles are bombarded onto
chamber 0. The particles keep collecting in the chamber 0.
However if at any time, there are more than N particles in a chamber, a reaction will cause 1
particle to move to the immediate next chamber(if current chamber is 0, then to chamber
number 1), and all the particles in the current chamber will be be destroyed and same
continues till no chamber has number of particles greater than N.
Given K,N and the total number of particles bombarded (A), find the final distribution of
particles in the K chambers. Particles are bombarded one at a time. After one particle is
bombarded, the set of reactions, as described, take place.
After all reactions are over, the next particle is bombarded. If a particle is going out from the
last chamber, it has nowhere to go and is lost.
#include <stdio.h>
int main()
int b,n,k,i,a[100]={0},rem;
scanf("%d %d %d",&b,&n,&k);
int r=0;
if(n!=0){
while(b>n){
rem = b%(n+1);
a[r]=rem;
b=b/(n+1);
r++;
a[r]=b;
printf("%d ",a[i]);
return 0;}
Umesh has n mixtures in front of him, arranged in a row. Each mixture has one of 100
different colors (colors have numbers from 0 to 99).
He wants to mix all these mixtures together. At each step, he is going to take two mixtures
that stand next to each other and mix them together, and put the resulting mixture in their
place.
Functional Description:
When mixing two mixtures of colors a and b, the resulting mixture will have the color (a+b)
mod 100.
Also, there will be some smoke in the process. The amount of smoke generated when mixing
two mixtures of colors a and b is a*b.
Find out what is the minimum amount of smoke that Umesh can get when mixing all the
mixtures together.
#include<bits/stdc++.h>
int main()
int n;
cin>>n;
while(n!=-1)
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n;i++)
sum[i][1]=a[i];
dp[i][1]=0;
for(int len=2;len<=n;len++)
{
for(int i=0;i<=n-len;i++)
for(int j=1;j<len;j++)
sum[i][len]=(sum[i][j]+sum[i+j][len-j])%100;
dp[i][len]=min(x,dp[i][len]);
cout<<dp[0][n]<<endl;
n=-1;cin>>n;
return 0;
cout<<"scount[100][100] colours[100]";
Problem Description:
Caleb likes to challenge Selvan's math ability.
He will provide a starting and ending value that describes a range of integers, inclusive of the
endpoints.
Selvan must determine the number of square integers within that range.
Note:
#include <bits/stdc++.h>
using namespace std;
int count=0;
if (sqrt(i) == (int)sqrt(i))
count+=1;
return count;
// Driver code
int main()
int q,l,r;
cin>>q;
while(q--){
cin>>l>>r;
cout<<result<<endl;
return 0;
He collected previous year's questions. one of the repeated questions is you need to find the
pairs in Array with given sum.
#include <bits/stdc++.h>
int main()
int n;
cin>>n;
int array[n];
int i;
for(i=0;i<n;i++)
cin>>array[i];
int num,j,count=0;
cin>>num;
vector<int>v ;
for(j=i+1;j<n;j++)
cout<<"["<<array[i]<<" "<<array[j]<<"]\n";
count++;
}
cout<<"Total Number of Pairs:"<<count;
return 0;
Good news! Suresh get to go to America on a class trip! Bad news, he don't know how to use the
Dollar which is the name of the American cash system. America uses coins for cash a lot more than
the Kuwait does. Dollar comes in coins for values of: 1, 2, 10, 50, 100, & 500 To practice your Dollar
skills, suresh have selected random items from Amazon.co.us and put them into a list along with
their prices in Dollar. Suresh now want to create a program to check suresh Dollar math.
Suresh goal is to maximize your buying power to buy AS MANY items as you can with your available
Dollar.
#include <bits/stdc++.h>
int main()
int MAX,LEN;
cin>>MAX>>LEN;
string a[LEN];
int b[LEN],c[LEN],count=0,i,j;
for(i=0;i<LEN;i++){cin>>a[i]>>b[i];c[i]=b[i];}
for(i=0;i<LEN;i++){
if(MAX-c[i]>0){
for(j=0;j<LEN;j++){//cout<<"hello there";
if(c[i]==b[j]){//cout<<"hello there";
MAX-=c[i];
break;
}
}
else{
for(j=0;j<LEN;j++){
if(c[i]==b[j]){//cout<<"hello there";
count++;
break;
return 0;
So given the cost of stock on each day in an array A[] of size N. Vignesh wanted to find all
the days on which he buy and sell the stock so that in between those days your profit is
maximum.
#include <stdio.h>
struct interval
int buy;
int sell;
};
return;
int i=0;
i++;
if(i == n - 1)
break;
if(arr[i]>arr[i-1])
i++;
sol[count].sell = i - 1;
count++;
}
for(i = 0; i < count; i++)
printf("(%d %d)",sol[i].buy,sol[i].sell);
return;
int main()
int t,i,n;
scanf("%d",&t);
while(t)
scanf("%d", &n);
int arr[n];
scanf("%d", &arr[i]);
if(n==4)
printf("No Profit");
else
stockBS(arr, n);
printf("\n");
t--;
return 0;
}
Simon work with Greek squares and matrix traces.
The trace of a square matrix is the sum of the values on the main diagonal (which runs from the
upper left to the lower right).
An B-by-B square matrix is a Greek square if each cell contains one of B different values, and no
value is repeated within a row or a column. In this problem, we will deal only with "beautiful Greek
squares" in which the B values are the integers between 1 and B.
Given a matrix that contains only integers between 1 and B, we want to compute its trace and check
whether it is a beautiful Greek square. To give some additional information, instead of simply telling
us whether the matrix is a beautiful Greek square or not, show the number of rows and the number
of columns that contain repeated values.
#include<bits/stdc++.h>
void ss()
return;
int main()
int t;
cin >> t;
int n;
cin >> n;
lli sum = 0;
int row = 0;
if (i == j)
sum += arr[i][j];
row++;
flag = true;
if (flag == false)
mymap[arr[i][j]]++;
int col = 0;
col++;
flag = true;
break;
if (flag == false)
mymap[arr[j][i]]++;
}
cout<< sum << " " << row << " " << col << endl;
return 0;
Problem Description: Ram has provide inputs two numbers 'p' and 'q' to Sakthi. He wants to creates
a matrix of size p x q (p rows and q columns) in which every elements is either Y or 0. The Ys and 0s
must be filled alternatively, the matrix should have outermost rectangle of Ys, then a rectangle of 0s,
then a rectangle of Ys, and so on..
#include <bits/stdc++.h>
void ss()
int i, k = 0, l = 0,r = m, c = n;
a[k][i] = x;
k++,i=k;
while(i < m)
a[i][n-1] = x,i++;
n--;
if (k < m)
a[m-1][i] = x;
m--;
if (l < n)
a[i][l] = x;
l++;
cout<<" ";
cout <<"\n";
int main()
int m,n;
cin>>m>>n;
fill0X(m, n);
Selvan studies, engineering as per his father's wishes, while Aaron, whose family is poor,
studies engineering to improve his family's financial situation. sumanth, however, studies
engineering of his simple passion for developing data structure applications.
As a result, The input provides the number of components on the first line and the numbers
to be sorted on the second line. Print the array's state at the third iteration and the final sorted
array in the supplied format in the output.
#include <iostream>
for(int i=1;i<n;i++){
for(int j=i-1;j>=0;j--){
if(arr[j]>curr){
arr[j+1]=arr[j];
if(j==0)
arr[j]=curr;
else{
arr[j+1]=curr;
j=-1;
int k;
if(i==2){
f(k,0,n)
cout<<arr[k]<<" ";
cout<<endl;
int i;
f(i,0,n)
int main()
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
insertionSort(arr, n);
printArray(arr, n);
return 0;
In India, the real estate sector is the second-highest employment generator, after the
agriculture sector.
It is also expected that this sector will incur more non-resident Indian (NRI) investment, both
in the short term and the long term.
Bengaluru is expected to be the most favoured property investment destination for NRIs,
followed by Ahmedabad, Pune, Chennai, Goa, Delhi and Dehradun.
#include <bits/stdc++.h>
int main()
int t;cin>>t;
while(t--){
int n,tot,now=0;cin>>n>>tot;
std::vector<int>v(n);
cin>>v[i];
sort(v.begin(),v.end());
now+=v[i];
if(now>tot){
cout<<i<<endl;
break;
}
}
return 0;
Ragu wants to build a string with English alphabet uppercase letters in sorted order. However, we
want the order to be sometimes strictly increasing and sometimes strictly decreasing.
The first letter of the string must be A. After that, the string must contain one or more blocks of
letters. The i-th block must contain exactly Li letters. Each letter in the i-th block must be later in the
alphabet than its preceding letter in the string if i is odd and earlier in the alphabet than its
preceding letter if i is even. Notice that for the first letter of a block, its preceding letter exists, even
though it is not in the block. Strings that follow all of these rules are called valid. There can be
multiple valid strings, and we want to find the alphabetically first one.
For example, if there are 2 blocks of sizes L1=2 and L2=3, the string must have exactly
1+L1+L2=1+2+3=6 letters (the 1 is for the initial A). The strings XYZYBA, AZYCBA and AYZYBB are not
valid for this case because they violate the required starting letter condition, and the ordering
conditions in the first and second block, respectively. The string AYZYBA is valid. The string ABDCBA
is also valid and, moreover, it is the alphabetically first valid string.
Given the sizes of the blocks, output the valid string that comes first in alphabetical order in the list
of all valid strings. It can be shown that, for all inputs within the given limits, at least one valid string
exists.
#include<bits/stdc++.h>
int main() {
int t;
cin >> t;
int n, l, c;
string s = "A";
cin >> n;
cin >> l;
if (i % 2) {
c = max(c, l);
s.push_back('A' + c);
s.push_back('A' + j);
} else {
s.push_back('A' + j);
c = l;
if (n % 2) {
s.push_back('A' + c);
return 0;
Due to the less preparation in the previous monthly tests, his internal mark decreased.
His computer science Professor made an offer one more chance to boost up his internal
marks.
the task is to find the minimum value of A[0] * B[0] + A[1] * B[1] +…+ A[n-1] * B[n-1],
#include <bits/stdc++.h>
class sor{
public:
int a[100],b[100];
int n;
void getn(){
cin>>n;
void geta(){
for(int i=0;i<n;i++)
cin>>a[i];
sort(a,a+n);
void getb(){
for(int i=0;i<n;i++)
cin>>b[i];
sort(b,b+n);
void display(){
int sum=0;
for(int i=0;i<n;i++)
sum+=a[i]*b[n-i-1];
cout<<sum<<endl;
};
int main()
if(0)
int n;
cin>>n;
while(n--){
/*int a[100],b[100];
int m,sum=0;
cin>>m;
for(int i=0;i<m;i++)
cin>>a[i];
for(int i=0;i<m;i++)
cin>>b[i];
sort(a,a+m);
sort(b,b+m);
for(int i=0;i<m;i++){
sum+=a[i]*b[m-i-1];
cout<<sum<<endl;*/
sor t;
t.getn();
t.geta();
t.getb();
t.display();
return 0;
Siva has several containers, each with a number of fruits in it. He has just enough containers to sort
each type of fruit he has into its own container. Siva wants to sort the fruits using his sort method.
#include<bits/stdc++.h>
int x[100][100];
int main(){
int q;
scanf("%d", &q);
while(q--){
int n;
scanf("%d", &n);
vector<ll> a, b;
f(i, 0, n){
ll z = 0;
sort(a.begin(), a.end());
f(j, 0, n){
ll z = 0;
b.push_back(z);
if(0){
sort(b.begin(), b.end());
if (a == b)printf("Possible\n");
else printf("Impossible\n");
Constraints:
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,i,sum=0;
cin>>n;
int arr[n];
for(i=0;i<n;i++)
cin>>arr[i];
sort(arr,arr+n);
for(i=0;i<n;i++)
int z= arr[n-i-1]-(i+1);
sum=sum+abs(z);
cout<<sum;
return 0;
cout<<"swap(l,r);";
Banana leaf platter is a traditional method of serving rice dishes in South Indian cuisine.
Due to the migration of South Indians, banana leaf rice can also be found in areas with
significant ethnic South Indian diaspora such as Malaysia and Singapore.
Each leaf has a positive beauty value, describing how attractive it looks.
Irfan would like to take exactly P leafs to use for lunch today. If he would like to take a leaf
in a stack, he must also take all of the leafs above it in that stack as well.
Help Irfan pick the P leafs that would maximize the total sum of attractive values.
#include <bits/stdc++.h>
#define ar array
void dummy(){}
int n, k, p, a[50][30];
int dp[51][1501];
void solve() {
dp[0][0]=0;
s+=a[i][j];
dp[i+1][l+j+1]=max(dp[i][l]+s, dp[i+1][l+j+1]);
int main() {
int n, i;
cin >> n;
for(i=0;i<n;i++) {
solve();
return 0;
Kanna is upset to learn that no one at his school recognises his first name.
Frustrated, he decides to make his fellow college students know his first name by forcing
them to solve this question. The task is determining the third greatest number in the supplied
array.
#include <stdio.h>
#include <limits.h>
int bypass(){
return 0;
first = arr[i];
for(i=0;i<arr_size;i++)
{
second = arr[i];
for(i=0;i<arr_size;i++)
third=arr[i];
int main()
int n,i;
scanf("%d",&n);
int arr[n];
for(i=0;i<n;i++)
scanf("%d",&arr[i]);
thirdLargest(arr,n);
return 0;
There is a classroom which has M rows of benches in it. Also, N students will arrive one-by-
one and take a seat.
Every student has a preferred row number(rows are numbered 1 to M and all rows have a
maximum capacity K. Now, the students come one by one starting from 1 to N and follow
these rules for seating arrangements:
• Every student will sit in his/her preferred row(if the row is not full).
• If the preferred row is fully occupied, the student will sit in the next vacant row. (Next
row for N will be 1)
• If all the seats are occupied, the student will not be able to sit anywhere.
Monk wants to know the total number of students who didn't get to sit in their preferred row.
(This includes the students that did not get a seat at all)
#include <stdio.h>
int main()
int n,m,k,x,y,i,ans=0,flag=1;
scanf("%d %d %d",&n,&m,&k);
int a[100001]={0},b[100001]={0};
for(i=0;i<n;i++)
scanf("%d",&x);
if(a[x]<k)
ans++;
a[x]++;
else if(flag!=0)
y=x;
x++;
if(b[y]!=0)
x=b[y];
flag=0;
while(x!=y)
{
if(x==m+1)
x=1;
if(x==y)
break;
if(a[x]<k)
a[x]++;
flag=1;
b[y]=x;
break;
x++;
printf("%d",n-ans);
return 0;
Mr. Alex just installed new bands in his feet and they do not feel like they should, making it where he
cannot stop!
However the Alex cannot do the math while stopping himself from crashing into things. Using M = -
dx, please help him find out the M, d, or x value as he requests it.
#include <stdio.h>
int main()
int LEN=3;
float m,d;
char var[3][LEN];
char inp[3][LEN];
scanf("%c%c%f\n%c%c%f",&inp[0][1],&inp[1][0],&m,&var[0][0],&var[1][1],&d);
printf("x %.2f",(m/(-d)));
return 0;
Dr. Ramesh is a professor at a university. He is eager to put on a show for pupils as well.
During his lunch break, he decided to host a mind-body activity.
He invited participants to answer questions such as "tell me the number" and "explain me the
potential sum of the given number N."
Example Input:
#include<bits/stdc++.h>
void printSums(int N)
int sum = 0;
sum = sum + i;
if (sum == N)
cout <<"\n";
break;
if (sum > N)
break;
sum = 0;
start++;
int main(void)
int n;
cin>>n;
printSums(n);
return 0;
Prabhu Salamon is planning to make a very long journey across the cityside by Train. His journey
consists of N train routes, numbered from 1 to N in the order he must take them. The trains
themselves are very fast, but do not run often. The i-th train route only runs every Xi days.
More specifically, he can only take the i-th train on day Xi, 2Xi, 3Xi and so on. Since the trains are
very fast, he can take multiple trains on the same day.
Prabhu Salamon must finish his journey by day D, but he would like to start the journey as late as
possible. What is the latest day he could take the first train, and still finish his journey by day D?
It is guaranteed that it is possible for Prabhu Salamon to finish his journey by day D.
#include <iostream>
int main()
int T,t,i;
cin>>T;
for(t=0;t<T;t++){
int n,d;
cin>>n>>d;
int x[n];
for(int i=0;i<n;i++){
cin>>x[i];
for(i=n-1;i>=0;i--)
int temp=(d-(d%x[i]));
d=temp;
cout<<d<<endl;
return 0;
cout<<"for(int t=0;t<T;t++)";}
Tina has been given an array of numbers "A," and she must discover the largest sum that can be
attained by selecting a non-empty subset of the array. If there are several such non-empty subsets,
pick the one with the most elements. In the specified subset, print the maximum sum and the
number of entries.
#include <stdio.h>
#include<stdlib.h>
#include<limits.h>
void check()
int cnt,num=0;
while(num)
if(cnt==0)
cnt++;
int main(void)
int N;
int max=0;
int tmp,sum=0,count=0;
scanf("%1d", &N);
int i;
scanf("%d", &tmp);
max = tmp;
if(tmp >= 0)
{
sum += tmp;
count++;
if(max < 0)
else
return 0;
A rectangle is Silver if the ratio of its sides is in between [1.6, 1.7], both inclusive. Your task
is to find the number of silver rectangles.
Constraints:
#include <stdio.h>
#include <stdlib.h>
int main() {
unsigned int N;
scanf("%d", &N);
int i;
for (i = 0;i < N; i++) {
count++;
r++;
printf("%d", count);
return 0;
Simon has given N ratios in the form of A and B that is represented as A/B. The values of A and B are
represented as double data type values. The values of B are incorrect. The actual values of B are B+R.
Simon know the actual sum of all the ratios that is available in variable K.
Note: The true values of B, represented as (B+R), are always greater than 0. Simon's task is to
determine the value of R.
#include<iostream>
double ans = 0;
return ans;
int main(){
int n,two;
cin>>n>>two;
double arr[n][2];
cin>>arr[i][0]>>arr[i][1];
double hi=2000,lo=0,mid,curr,k;
cin>>k;
while(hi-lo>1e-7){
mid=(hi+lo)/2;
curr=func(arr,mid,n);
if(curr<k){
hi = mid;
else{
lo = mid + 1e-7;
printf("%.6f",mid);
return 0;
Note: The true values of B, represented as (B+R), are always greater than 0. Simon's task is
to determine the value of R.
Constraints:
1 <= N <= 1000
1 <= A <= 1000
|B| <= 1000
1 <= K <= 10^6
Input Format:
First line: Two integers N and col denoting the number of ratios and the value 2 respectively
Next N lines: Each line contains two double values A and B
Last line: A double value K denoting the sum of all the ratios
Output Format:
Print the value of R. Simon's answer must contain an absolute or relative error of less than
10^-6.
#include<iostream>
double ans = 0;
ans+= (arr[i][0]/(arr[i][1]+r));
return ans;
int main(){
int n,two;
cin>>n>>two;
double arr[n][2];
cin>>arr[i][0]>>arr[i][1];
double hi=2000,lo=0,mid,curr,k;
cin>>k;
while(hi-lo>1e-7){
mid=(hi+lo)/2;
curr=func(arr,mid,n);
if(curr<k){
hi = mid;
else{
lo = mid + 1e-7;
printf("%.6f",mid);
return 0;
Prabhu Salamon is planning to make a very long journey across the cityside by Train. His journey
consists of N train routes, numbered from 1 to N in the order he must take them. The trains
themselves are very fast, but do not run often. The i-th train route only runs every Xi days.
More specifically, he can only take the i-th train on day Xi, 2Xi, 3Xi and so on. Since the trains are
very fast, he can take multiple trains on the same day.
Prabhu Salamon must finish his journey by day D, but he would like to start the journey as late as
possible. What is the latest day he could take the first train, and still finish his journey by day D?
It is guaranteed that it is possible for Prabhu Salamon to finish his journey by day D.
Constraints:
1 ≤ T ≤ 100.
1 ≤ Xi ≤ D.
1 ≤ N ≤ 1000.
1 ≤ D ≤ 10^12
Input Format:
The first line of the input gives the number of test cases, T. T test cases follow. Each test case begins
with a line containing the two integers N and D. Then, another line follows containing N integers, the
i-th one is Xi.
Output Format:
Print the output in a single line contains, the latest day he could take the first train, and still finish his
journey by day D.
#include <iostream>
int main()
int T;
cin>>T;
for(int t=0;t<T;t++){
int n,d;
cin>>n>>d;
int x[n];
for(int i=0;i<n;i++){
cin>>x[i];
for(int i=n-1;i>=0;i--){
int temp=(d-(d%x[i]));
d=temp;
cout<<d<<endl;
return 0;
}
VIBGYOR isn't just an acronym, it's a way of life for Asian paint company. The owner is
considering modernizing his paint mixing equipment with a computerized model. He's hired
you to code the prototype. Your simple program will need to correctly output the right color
based on the blends he's given you.
Example Colors
Tertiary Colors “ LIGHT RED, DARK RED, LIGHT PURPLE, DARK PURPLE, LIGHT
BLUE, DARK BLUE, LIGHT GREEN, DARK GREEN, LIGHT YELLOW, DARK
YELLOW, LIGHT ORANGE, DARK ORANGE”
Input Format:
You will receive one to five lines of color combinations consisting of primary colors and
secondary colors as well as black and white to make "dark" and "light" colors. The full
science of colorisation and pigments will be implemented next, if your prototype is
successful.
Output Format:
Print the output in a separate lines contains, Your program should output the correct color
depending on what two colors were "mixed" on the line. Primary colors should mix together
to create secondary colors. Anything mixed with "WHITE" or "BLACK" should be output as
either "LIGHT X" or "DARK X" where X is the color "WHITE" or "BLACK" were mixed
with. Anything mixed with itself won't change colors. You are guaranteed not to receive
incompatible colors, or colors not listed in the color wheels shown above (aside from
"WHITE" and "BLACK").
#include <stdio.h>
#include<bits/stdc++.h>
void arr()
return;
int main()
{
string s,s1;
int t = 4;
while(t--)
cin>>s>>s1;
//cout<<s<<" "<<s1;
cout<<"ORANGE";
else cout<<"N/A";
cout<<"\n";
return 0;
Trapped by a lake and racing against time, our fearless heroes need to quickly cross it in
order to stop father from placing the wrong burger order. (Beautiful story, turns out Mike was
only joking about the shark).
Unexpected, our heroes have found a ramp on their side of the lake (what could go wrong?).
Help them figure out if they can jump the lake (stunts performed on closed course by Peter
Hein).
Constraints:
Name = a to z & A to Z
1 <= length <= 500
0 <= rate <= 10 (including decimal)
0 <= width <= 500 (including decimal)
Functional Constraints
Input Format:
First line of the input is a name of the vehicle
Second line of the input is a length of the ramp (in meters, always a whole 32-bit integer)
Third line of the input is a acceleration rate of the vehicle (in meters/second-squared, floating
point decimal of max size
2147483647.0)
Third line of the input is a width of the lake (in meters, floating point decimal of max size
2147483647.0)
Output Format:
Print the output in a single line contains calculate the horizontal speed (rounded to the nearest
hundredth) the vehicle will be going
when it runs out of ramp, and then use that to calculate how much horizontal distance
(rounded to the nearest tenth) your vehicle will be able to cover (formulas in the discussion
section) and output the results of your ramp jumping!
#include <stdio.h>
#include<math.h>
int main()
char s[100];
scanf("%s",s);
int len;
float acc,dist,speed,ansdist;
scanf("%d %f %f",&len,&acc,&dist);
printf("%s will reach a speed of %.2f m/s on a %d ramp crossing %.1f of %.1f meters,
",s,speed,len,ansdist,dist);
if(ansdist<(dist-5.0))
printf("SPLASH!");
else if(ansdist>=(dist-5.0)&&ansdist<=dist)
printf("LIKE A LEGEND!");
return 0;printf("distance=speed1*speed1/9.805;");
Dr. Ramesh is a professor at a university. He is eager to put on a show for pupils as well.
During his lunch break, he decided to host a mind-body activity.
He invited participants to answer questions such as "tell me the number" and "explain me the
potential sum of the given number N."
Example Input:
125
Sample output:
8 9 10 11 12 13 14 15 16 17
23 24 25 26 27
62 63
Constraints:
1<N<1000
Input Format:
Output Format:
#include<iostream>
void printSums(int N)
while (start<end)
{
int sum=0;
sum=sum+i;
if (sum == N)
cout <<"\n";
break;
if (sum>N)
break;
sum=0;
start++;
int main()
int n;
cin>>n;
printSums(n);
return 0;}
Tina has been given an array of numbers "A," and she must discover the largest sum that can be
attained by selecting a non-empty subset of the array. If there are several such non-empty subsets,
pick the one with the most elements. In the specified subset, print the maximum sum and the
number of entries.
Constraints:
1 ≤ N ≤ 10^5
-10^9 ≤ Ai ≤ 10^9
Input Format:
The first line contains an integer 'N', denoting the number of elements of the array. Next line
contains 'N' space-separated integers, denoting the elements of the array.
Output Format:
Print two space-separated integers, the maximum sum that can be obtained by choosing some
subset and the maximum number of elements among all such subsets which have the same
maximum sum.
#include <stdio.h>
int main()
int cnt=0,temp,tot=0,n;
scanf("%d",&n);
while(n--){
scanf("%d",&temp);
if(temp>=0){
cnt++;
tot+=temp;
printf("%d %d",tot,cnt);
return 0;
Ragu has given a range [L, R] to Smith. Smith wants to require to find the number of integers
'X' in the range such that GCD(X, F(X)) > 1 where F(x) is equal to the sum of digits of 'X' in
its hexadecimal (or base 16) representation.
Constraints:
1 <= T <= 50
1 <= L
R <= 10^5
Input Format:
The first line contains a positive integer 'T' denoting the number of questions that you are
asked.
Each of the next 'T' lines contain two integers 'L' and 'R' denoting the range of questions.
Output Format:
Print the output in a separate lines exactly 'T' numbers as the output.
Sample Input:
13
58
7 12
Sample output:
Explanation
For the first test-case, numbers which satisfy the criteria specified are : 2,3. Hence, the
answer is 2.
For the second test-case, numbers which satisfy the criteria specified are : 5,6,7 and 8. Hence,
the answer is 4.
For the third test-case, numbers which satisfy the criteria specified are : 7,8,9,10,11 and 12.
Hence, the answer is 6.
#include <bits/stdc++.h>
int hexa(int a)
while (a > 0)
rem =a % x;
ans += rem;
a/=x;
return ans;
int main(){
int t;
cin >> t;
while (t--) {
int a, b, count = 0;
if (search(i, hexa(i)))
count++; }
King Alexander wants every chariot to line up for the start of her Winter-eve ball.
He has asked you, Twilight Sparkle, to sort the horse chariots alphabetically but with royalty
in front. Royal horses chariot have diamonds in their names.
Constraints:
1 <= Names <= 100
Input Format:
list of horse chariots numbering anywhere from 1 to 40 horse chariot, with 1 per line. The end
of input will be marked with END on a line by itself. Names should be no longer than 100
characters in length, and to only contain letters and spaces.
Output Format:
Print the output in a separate lines contains Sort and list the horse chariots alphabetically in
ascending order ('A' "first"), ignoring case. However, any horse chariot with a diamond in
their name must be placed at the "top" of the list (before the "A's" start) in the diamond order
given in the Discussion section below.
Explanation:
Lapis, Topaz, Tourmaline, Sapphire, Peridot, Ruby, Pearl, Emerald, Diamond, Aquamarine,
Amethyst, Garnet.
you are guaranteed that you will not have to deal with any gemstones not listed above. If
multiple gems are listed in the same name, sort by whichever gem has "highest prioity" (e.g.
a pony named 'Garnet Lapis' would be listed before a pony named 'Topaz Sapphire,' because
Lapis has the highest priority).
In the case of equal ranking on gemstones, output in alpha order by total name (not just the
gemstones), only sort by highest priority gemstones, after that by alpha. (Example, given the
names: Lapis Topaz and Amethyst Lapis, they should be printed in order as: Amethyst Lapis
then Lapis Topaz. That is because both names have the highest ranked gemstone (Lapis), so
we simply sort them in ascending order alphabetically after their ranking has been
established. We would not list Lapis Topaz before Amethyst Lapis because Topaz has a
higher ranking over Amethyst. Stop comparing gemstone ranking after determine the highest
rank of the gems in the name.)
You are guaranteed that there will be no ties in priority for gemstone ranking. You are also
guaranteed that you will not encounter hyphenated names like Ruby-Sue. However, if a
gemstone name happened to be found as part of a name (like Rubyanne) you can safely treat
that as just another name to alphabetise. Gemstone names have to stand on their own
(separated by spaces, or the entirety of the name) to be treated royally.
#include <bits/stdc++.h>
//char
*gems[]={"NONE","Garnet","Amethyst","Aquamarine","Diamond","Emerald","Pearl","Ruby","Perido
t","Sapphire","Tourmaline","Topaz","Lapis",0};
string
gems[]={"Garnet","Amethyst","Aquamarine","Diamond","Emerald","Pearl","Ruby","Peridot","Sapphi
re","Tourmaline","Topaz","Lapis"};
return 11-i;
return 12;
int main()
vector<string> arr[13];
string temp;
while(1){
getline(cin,temp);
if(temp=="END") break;
arr[index(temp)].push_back(temp);
sort(arr[i].begin(),arr[i].end());
for(auto s:arr[i]){
cout<<s<<endl;
}
}
return 0;
printf("char ponies[MAXP][BUFLEN];strcmp(ponies[a],ponies[b])>0;");
char
*gems[]={"NONE","Garnet","Amethyst","Aquamarine","Diamond","Emerald","Pearl","Ruby","Perido
t","Sapphire","Tourmaline","Topaz","Lapis",0};
char x = gems[0][0];
printf("%c",x);
Siva has several containers, each with a number of fruits in it. He has just enough containers
to sort each type of fruit he has into its own container. Siva wants to sort the fruits using his
sort method.
Function Description
int containter[n][m]: a two dimensional array of integers that represent the number of balls of
each color in each container
Constraints:
1 ≤ q ≤ 10
1 ≤ n ≤ 100
0 ≤ containers[i][j] ≤ 10^9
Input Format:
The first line contains an integer 'q', the number of queries.
The first line contains an integer 'n', the number of containers (rows) and ball types
(columns).
Each of the next 'n' lines contains 'n' space-separated integers describing row containers[i].
Output Format:
For each query, print Possible on a new line if David can satisfy the conditions above for the
given matrix. Otherwise, print Impossible.
#include <stdio.h>
#include <stdlib.h>
void asd();
int main(){
asd();
return 0;
void asd()
int q;
scanf("%d",&q);
while(q--){
int n,i,j;
scanf("%d",&n);
int M[n][n];
*arr=n;
for(i=0;i<n;i++){
for(j=0;j<n;j++){
scanf("%d",&M[i][j]);
r[i]+=M[i][j];
c[j]+=M[i][j];
int count=0;
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(r[i]==c[j])
count++;
break;
if(count==n)
printf("Possible\n");
else
printf("Impossible\n");
Some laptops have a negative price, meaning their owners are willing to pay APPU if he buys
their broken laptop. APPU is free to purchase whichever laptop he desires.
Despite his strength, he can only handle m Laptops at a time, and he has no desire to return to
the auction.
Please, help APPU find out the maximum sum of money that he can earn.
Constraints:
1≤T≤10
1≤n,m≤100
-1000≤ai≤1000
Input Format:
First line of the input contains T denoting the number of test cases.Each test case has 2 lines :
first line has two spaced integers n m.
Output Format:
The maximum sum of money that LALU can earn, given that he can carry at most m
Laptops.
#include<iostream>
int main()
int t,arr[100],no,i,k ;
cin>>t ;
while(t--)
cin>>no ;
cin>>k ;
for(i=0;i<no;i++)
cin>>arr[i] ;
no=MEGA_SALE(arr,no,k) ;
cout<<abs(no)<<endl ;
return 0;
int i ;
bubble_sort(arr,no) ;
int sum=0 ;
for(i=0;i<k;i++)
sum=minof(sum,sum+arr[i]) ;
return sum ;
int i,j,temp ;
for(i=0;i<no-1;i++)
for(j=0;j<no-i-1;j++)
if(arr[j]>arr[j+1])
temp=arr[j] ;
arr[j]=arr[j+1] ;
arr[j+1]=temp ;
return a>b?b:a ;
Although he scored well in many subjects, he did not an expert in computer programming
languages.
He collected previous year's questions. one of the repeated questions is to sort the given set of
numbers using Selection Sort
The first line of the input contains the number of elements N, the second line of the input
contains the numbers Ai to be sorted.
In the output print the the final sorted array in the given format.
Constraints
Input:
The first line of the input contains the number of elements
Output:
print the the final sorted array in the given format.
#include <bits/stdc++.h>
void dothis(){
int main()
int n;
cin>>n;
vector<int>v(n) ;
cin>>v[i];
}
sort(v.begin(),v.end());
cout<<v[i]<<' ';
cout<<endl;
return 0;
In India, the real estate sector is the second-highest employment generator, after the
agriculture sector.
It is also expected that this sector will incur more non-resident Indian (NRI) investment, both
in the short term and the long term.
Bengaluru is expected to be the most favoured property investment destination for NRIs,
followed by Ahmedabad, Pune, Chennai, Goa, Delhi and Dehradun.
Constraints:
1 ≤ T ≤ 100.
1 ≤ B ≤ 10^5.
1 ≤ Ai ≤ 1000, for all i.
1 ≤ N ≤ 10^5.
Input Format:
The first line of the input gives the number of test cases, T.
T test cases follow. Each test case begins with a single line containing the two integers N and
B.
The second line contains N integers. The i-th integer is Ai, the cost of the i-th flat.
Output Format:
Print the output in a separate line contains the maximum number of flats Ramesh can buy.
#include <bits/stdc++.h>
int main()
int t;cin>>t;
while(t--){
int n,tot,now=0;cin>>n>>tot;
std::vector<int>v(n);
cin>>v[i];
sort(v.begin(),v.end());
now+=v[i];
if(now>tot){
cout<<i<<endl;
break;
return 0;
Sathya is a IT expert who training youngsters struggling in coding to make them better.
Sathya usually gives interesting problems to the youngsters to make them love the coding.
One such day Sathya provided the youngsters to solve that the given an array of integers and
the numbers k1 and k2, get the sum of the two numbers.
Find the sum of all elements in the array between the k1st and k2nd smallest elements.
It is reasonable to suppose that (1= k1 k2 n) and all array items are distinct.
Constraints:
Input Format:
The first line of input contains an integer T denoting the no of test cases. Then T test cases
follow. Each test case contains an integer N, denoting the length of the array.
Third line contains two space separated integers denoting k1'th and k2'th smallest elements.
Output Format:
For each test case in a new line output the sum of all the elements between k1'th and k2'th
smallest elements.
#include <bits/stdc++.h>
int main()
int t,i;cin>>t;
while(t>0){
int n,k1,k2,ans=0;
cin>>n;
int arr[n];
for(i=0;i<n;i++) {
cin>>arr[i];
cin>>k1>>k2;
sort(arr,arr+n);
cout<<ans<<endl;
t--;
return 0;
printf("for(int i=0;i<n-1;i++)");
Selvan studies, engineering as per his father's wishes, while Aaron, whose family is poor,
studies engineering to improve his family's financial situation. sumanth, however, studies
engineering of his simple passion for developing data structure applications.
sumanth task is to use Insertion Sort to sort the supplied set of numbers.
As a result, The input provides the number of components on the first line and the numbers
to be sorted on the second line. Print the array's state at the third iteration and the final sorted
array in the supplied format in the output.
Constraints
Input Format:
Output Format:
Fist line indicates print the status of the array at the 3rd iteration
second line print the the final sorted array in the given format.
#include <stdio.h>
int i;
printf("\n");
int i, key, j;
if(i==3){
printArray(arr,n);
key = arr[i];
j = i - 1;
arr[j + 1] = arr[j];
j = j - 1;
arr[j + 1] = key;
int main()
int n,i;
scanf("%d",&n);
int arr[n];
scanf("%d",&arr[i]);
}
insertionSort(arr, n);
printArray(arr,n);
return 0;
The trace of a square matrix is the sum of the values on the main diagonal (which runs from
the upper left to the lower right).
An B-by-B square matrix is a Greek square if each cell contains one of B different values,
and no value is repeated within a row or a column. In this problem, we will deal only with
"beautiful Greek squares" in which the B values are the integers between 1 and B.
Given a matrix that contains only integers between 1 and B, we want to compute its trace and
check whether it is a beautiful Greek square. To give some additional information, instead of
simply telling us whether the matrix is a beautiful Greek square or not, show the number of
rows and the number of columns that contain repeated values.
Constraints:
1 ≤ T ≤ 100.
2 ≤ B ≤ 100.
1 ≤ Ai,j ≤ B, for all i, j.
Input Format:
The first line of the input gives the number of test cases, T. T test cases follow. Each starts
with a line containing a single integer B: the size of the matrix to explore. Then, B lines
follow. The i-th of these lines contains B integers Ai,1, Ai,2 ..., Ai,B. Ai,j is the integer in the
i-th row and j-th column of the matrix.
Output Format:
Print the output in a single lines contains the number of rows and the number of columns that
contain repeated values.
In Sample Case #1, the input is a natural Latin square, which means no row or column has
repeated elements. All four values in the main diagonal are 1, and so the trace (their sum) is
4.
In Sample Case #2, all rows and columns have repeated elements. Notice that each row or
column with repeated elements is counted only once regardless of the number of elements
that are repeated or how often they are repeated within the row or column. In addition, notice
that some integers in the range 1 through N may be absent from the input.
In Sample Case #3, the leftmost and rightmost columns have repeated elements.
#include <bits/stdc++.h>
void ss()
return;
int main()
int t;
cin >> t;
int n;
cin >> n;
lli sum = 0;
int row = 0;
if (i == j)
sum += arr[i][j];
row++;
flag = true;
if (flag == false)
mymap[arr[i][j]]++;
int col = 0;
col++;
flag = true;
break;
if (flag == false)
mymap[arr[j][i]]++;
cout<< sum << " " << row << " " << col << endl;
return 0;
Theatre staffs insisted the audience to sit in odd row if the seat number is odd and in even
row if the seat number is even.
But the instruction is very confusing for saravanan and his friends.
So help them with the seating layout so that they can sit in correct seats.
Constraints:
4 ≤ N ≤ 20
Input Format:
Only line of input has single integer value representing the number of rows in the theatre.
Output Format:
#include <stdio.h>
int main()
int i,j,N,k;
scanf("%d", &N);
if(i%2==1) {
k=-1;
else {
k=0;
printf("%d ",k+=2);
printf("\n");
return 0;
For some reason, your school's football team has chosen to spell out the numbers on their jerseys
instead of using the usual digits. Being great fans, you're going to be ready to cheer for your favorite
players by bringing letter cards so you can spell out their number. Each fan has different favorites, so
they each need to bring different sets of letters.
Input Format:
Read a set of integers from 0 to 12, separated by spaces, representing one fan's favorite players. The
last integer will be 999, marking the end of the line.
Output Format:
Print the same numbers, then a period and a space. Then, in alphabetical order, print all the letters
the fan needs to be able to spell any one of the jersey numbers provided
#include <bits/stdc++.h>
int main()
int curr;
multiset<char> mp;
string names[] =
{"","ONE","TWO","THREE","FOUR","FIVE","SIX","SEVEN","EIGHT","NINE","TEN","ELEVEN","TWELVE"
};
while(cin>>curr){
if(curr==999){
cout<<"0999"<<'.'<<' ';
break;
cout<<curr<<' ';
if(curr>12)continue;
for(auto ch:now){
mp.insert(ch);
cout<<ch<<' ';
return 0;
printf("char nums[13][256]for(n=0;n<26;n++)");
}
There are K nuclear reactor chambers labelled from 0 to K-1. Particles are bombarded onto
chamber 0. The particles keep collecting in the chamber 0.
However if at any time, there are more than N particles in a chamber, a reaction will cause 1
particle to move to the immediate next chamber(if current chamber is 0, then to chamber
number 1), and all the particles in the current chamber will be be destroyed and same
continues till no chamber has number of particles greater than N.
Given K,N and the total number of particles bombarded (A), find the final distribution of
particles in the K chambers. Particles are bombarded one at a time. After one particle is
bombarded, the set of reactions, as described, take place.
After all reactions are over, the next particle is bombarded. If a particle is going out from the
last chamber, it has nowhere to go and is lost.
Constraints:
Input Format:
The input will consist of one line containing three numbers A,N and K separated by spaces.
Output Format:
#include <stdio.h>
int main()
{int a,n,k,i,b;
scanf("%d%d%d",&a,&n,&k);
for(i=0;i<k;i++){
b=a%(n+1);
printf(" %d",b);
a=a/(n+1);
while(a>0){
printf("a[100] a[r]");
return 0;
Professor Shiva decided to conduct an industrial visit for final year students,
but he set a condition that if students received a passing grade in the surprise test,
He asked the students to study a topic linked list for 10 minutes before deciding to conduct a
surprise test.
Professor-mandated questions, such as the deletion of nodes with a certain data D, are now
being asked.
For example
if the given Linked List is 5->10->15->10->25 and delete after 10 then the Linked List
becomes 5->15->25.
Constraints
Input Format
First line contains the number of datas- N.
Output Format
Single line represents the linked list after required elements deleted.
#include <bits/stdc++.h>
using namespace std;
void ss()
return;
int main()
int n;
cin>>n;
int arr[n];
cin>>arr[i];
int m;
cin>>m;
cout<<"Linked List:";
for(int p : arr)
if(p != m)
cout<<"->"<<p;
return 0;
A long time ago, there was a desolate village in India. The ancient buildings, streets, and
businesses were deserted. The windows were open, and the stairwell was in disarray. You can
be sure that it will be a fantastic area for mice to romp about in! People in the community
have now chosen to provide high-quality education to young people in order to further the
village's growth.
As a result, they established a programming language coaching centre. People from the
coaching centre are presently performing a test. Create a programme for the GetNth()
function, which accepts a linked list and an integer index and returns the data value contained
in the node at that index position.
Example
Constraints
Input Format
First line contains the number of datas- N.
Second line contains N integers(the given linked list).
Third Line Index I
Output Format
First Line indicates the linked list
#include <iostream>
struct node
int data;
}*head = NULL;
int i = 0,n;
while(n-i != index)
int main()
int first;
cin>>n>>first;
head = t;
cin>>first;
t -> next = u;
t = u;
int index;
cin>>index;
display(head);
cout<<"\nNode at index="<<index<<":"<<GetNth(hh,index);
return 0;
Dr.Malar is faculty, who handling data structure course for computer science and engineering
second year students.
one day this faculty was handling very interesting topic in data structure such that Linked List,
she has given the following explanation for Linked list concept.
"Linked List is a sequence of links which contains items. Each link contains a connection to
another link. Linked list is the second most-used data structure after array. Following are the
important terms to understand the concept of Linked List.
Link − Each link of a linked list can store a data called an element.
Next − Each link of a linked list contains a link to the next link called Next.
LinkedList − A Linked List contains the connection link to the first link called First."
During this lecture time, last bench students was making continuous disturbance by making
unwanted noise.
The new node is added at given position P of the given Linked List.
we have to traverse the list till P and then insert the node.
Constraints
1<N<1000
1<P< N+1
Input Format
First line contains the number of datas- N. Second line contains N integers(the given linked
list).
Third line contains the position P where the node to be inserted. Fourth line contain the node
X to be inserted.
Output Format
#include <bits/stdc++.h>
struct node
int data;
}*head = NULL;
int n;
int in_pos(int n)
int data1;
cin>>data1;
int i =1;
while(i != n-1)
r = r-> next;
i++;
}
node *tt = new node;
node *s = head;
cout<<"Linked List:";
while(s != NULL)
cout<<"->";
cout<<s-> data;
s = s-> next;
return data1;
void create()
int n;
cin>>n;
int __n;
cin>>__n;
head = p;
int i;
for(i=0;i<n-1;i++)
{
int a;
cin>>a;
q -> data = a;
p -> next= q;
p = p->next;
int main()
create();
int r;
cin>>r;
int s = in_pos(r);
return 0;
cout<<s<<"for(i=0;i<n;i++)";
For example, if someone successfully answers this question, they will be given a mobile
phone at a 50% discount.
One of the competition's requirements was to write a C programme that swapped nodes for
two specified keys in a linked list with two keys.
When data consists of several fields, swapping data across nodes might be costly.
It is reasonable to presume that all keys in a linked list are unique.
example :
Constraints
Input Format
First line contains the number of datas- N.
Second line contains N integers(the given linked list).
Third Line contains 2 key nodes(X and Y) to be Swapped.
Output Format
linked list before swapping keys
linked list after swapping keys
#include <iostream>
struct node
int data;
}*head = NULL;
if (x == y)
return;
prevX = currX;
currX = currX->next;
prevY = currY;
currY = currY->next;
return;
if (prevX != NULL)
prevX->next = currY;
else
*head_ref = currY;
if (prevY != NULL)
prevY->next = currX;
else
*head_ref = currX;
currY->next = currX->next;
currX->next = temp;
void create()
int n;cin>>n;
int rr;cin>>rr;
int i;
for(i=0;i<n-1;i++)
int a;
cin>>a;
q -> data = a;
tt -> next = q;
tt = q;
int main()
{create();
cout<<"before Swapping:";
display(head);
int x,y;
cin>>x>>y;
swapNodes(&head,x,y);
cout<<"\nafter Swapping:";
display(head);
return 0;
You're given a stack of N numbers, with the first component representing the stack's top and
the final component being the stack's bottom.
At least one piece from the stack must be removed. You can turn the stack into a queue at any
time.
You cannot convert the queue back into a stack. Your task is to remove exactly K elements
such that the sum of the K removed elements is maximized.
constraints:
1 ≤ N ≤ 10^5
1≤ K ≤ N
1≤ Ai ≤ 10^9
Input format :
Output format :
int main()
int n,k,i;
cin>>n>>k;
int sum = 0;
int arr[n];
stack<int>st, st2;
for(i=0;i<n;i++){
st.push(arr[i]);
for(i=0;i<k;i++){
st2.push(arr[i]);
sum += arr[i];
sum -= st2.top();
st2.pop();
sum += st.top();
st.pop();
}
cout << maxs;
return 0;
Hassan gets a job in a software company in Hyderabad. The training period for the first three
months is 20000 salary. Then incremented to 25000 salaries.
Training is great but they will give you a programming task every day in three months.
Hassan must finish it in the allotted time. His teammate Jocelyn gives him a task to complete
the concept of Postfix to Infix Conversion for a given expression. can you help him?
Functional Description:
Constraints
Input Format
Output Format
#include <bits/stdc++.h>
#include<iostream>
#include<string.h>
stack<string> s;
if(isOperand(exp[i]))
s.push(op);
else
s.pop();
string op2=s.top();
s.pop();
return(s.top());
}
int main()
string exp;
cin>>exp;
cout<<getInfix(exp);
return 0;
Arumugam is in the process of reorganising her library. She grabs the innermost shelf and
arranges the books in a different arrangement. She shatters the shelf's walls. There will be no
shelf barriers and simply books in the end. Make a printout of the book order.
Opening and closing walls of shelves are shown by '/' and '\' respectively whereas books are
represented by lower case alphabets.
Constraints:
2≤ |S| ≤10^3
Input format
Output format
Note
The first character of the string is '/' and the last character of the string is '\' indicating
outermost walls of the shelf.
#include <bits/stdc++.h>
int main()
string s,temp="";
cin>>s;
stack<string> stk;
if(s[i]==47||s[i]==92){
if(!temp.empty()){
stk.push(temp);
temp.clear();
else{
temp.push_back(s[i]);
while(!stk.empty()){
cout<<stk.top();
stk.pop();
return 0;
Hassan enjoys jumping from one building to the next. However, he merely jumps to the next
higher building and stops when there are none accessible. The amount of stamina necessary
for a voyage is equal to the xor of all the heights Hassan leaps till he comes to a halt.
If heights are [1 2 4], and he starts from 1, goes to 2 stamina required is 1⊕2=3, then from 2
to 3. Stamina for the entire journey is 1⊕2⊕4=7. Find the maximum stamina required if can
start his journey from any building.
Constraints
1≤ N ≤10^5
1 ≤ Hight ≤10^9
Input
Output
#include <stdio.h>
int main() {
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&arr[i]);
st[n-1] = arr[n-1];
temp = arr[n-1];
for(i=n-2;i>=0;i--) {
for(j=i+1;j<n;j++)
if(arr[i]<arr[j]) {
st[i]=arr[i]^st[j];
break;
if(st[i] == 0)
st[i] = arr[i];
temp = st[i];
printf("%d",temp);
return 0;
You are given an array A of Q integers and Q queries. In each query, you are given an
integer i (1≤i≤N).
Your task is to find the minimum index greater than i (1≤i≤N) such that:
Constraints
1 < = N, Q ≤ 10^5
1 ≤ Ai ≤ 10^9
1 ≤ Qi ≤N
Input format
Output format
#include<bits/stdc++.h>
int main(){
int n,q;
cin>>n>>q;
for(int i=0;i<n;i++){
cin>>a[i];
for(int i=0;i<n;i++){
int z=a[i];
int sum=0;
while(z>0){
sum+=(z%10);
z=z/10;
arr[i]=sum;
while(q--){
int Q;
cin>>Q;
int ans=-1;
for(int i=Q;i<n;i++){
ans=i+1;
break;
}else{
continue;
cout<<ans<<' ';
return 0;
Umesh usually gives interesting problems to the youngsters to make them love the DS.
One such day Umesh provided to the youngsters to solve the task such that, Reverse a Queue,
Queue data structures work on the FIFO architecture so the element that has entered first in
the list will go out from the list first.
Function Description
Constraints:
0<size <100
0<data<1000
Input format:
First line indicates the size of the queue
Output Format:
#include <stdio.h>
void enqueue(int,int);
void display();
void reverse();
int main() {
int n,t,i;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&t);
enqueue(t,n);
printf("Queue:");
display();
reverse();
printf("\nReversed Queue:");
display();
return 0;
}
void reverse(){
int i,j,temp;
for(i=front,j=rear;i<j;i++,j--){
temp=items[i];
items[i]=items[j];
items[j]=temp;
if (rear == l - 1)
printf("Queue is Full!!");
else {
if (front == -1)
front = 0;
rear++;
items[rear] = data;
void display() {
if (rear == -1)
printf("\nQueue is Empty!!!");
else {
int i;
for(i=front;i<=rear;i++)
You own a club on eerie planet. The day on this planet comprises of H hours.
You appointed C crew members to handle the huge crowd that you get, being the best club on
the planet.
Each member of the crew has a fixed number of duty hours to work.
There can be multiple or no crew members at work at any given hour of the day.
Being on a weird planet, the rules of this club cannot be normal.
Each member of the crew only allows people who are taller than him to enter the club when
he is at work.
Given the schedule of work and the heights of the crew members, you have to answer Q
queries.
Each query specifies the time of entry and height of a person who is visiting the club.
You have to answer if the person will be allowed to enter the club or not.
Constraints:
1≤H≤109
1≤C≤105
1≤Q≤105
1≤Si≤Ei≤H
1≤ti≤H
1≤hi≤107
Input:
The first line of the input contains 3 integers, H,C,Q. Representing a number of hours in a
day, a number of crew members, and a number of queries respectively.
Next, C lines follow, where each line contains 3 integers, hi,Si,Ei, representing the height of
the crew member and the start and end hour of his/her work schedule. He/she works for
hours [Si,Ei], both inclusive.
Next, Q lines follow, each containing 2 integers, hi,ti, representing height and time (in an
hour) of the person trying to enter the club.
Output:
Q lines, each line containing "YES" or "NO", without the quotes, answering if the person will
be allowed to enter the club or not.
#include<stdio.h>
int main()
scanf("%lld%lld%lld",&H,&C,&Q);
for(i=0;i<C;i++)
scanf("%lld%lld%lld",&h[i],&S[i],&E[i]);
if(h[i]>maximum_height)
maximum_height=h[i];
for(i=0;i<Q;i++)
scanf("%lld%lld",&height,&t);
if(height>maximum_height)
printf("YES\n");
else{
val=0;
nc=0;
flag=0;
for(j=0;j<C;j++)
nc++;
if(height<=h[j])
printf("NO\n");
flag=1;
break;
else
val++;
if(nc==val)
printf("YES\n");
else
if(flag==0)
printf("NO\n");
return 0;
Joe root is a Placement trainer. he is working as CDC trainer in reputed institution that during
training the youngsters are struggling in queue concept.
Joe root usually gives interesting problems to the students to make them love the DS.
One such day Joe root provided to the final year students to solve the task such that, Queue
implementation with arrays as using linked list for implementing queue and delete an element
from the queue using linked list concept.
Queue data structures work on the FIFO architecture so the element that has entered first in
the list will go out from the list first.
Final Year students were lacking the idea to solve the problem.
Function Description
Constraints:
0<size <100
0<data<1000
Input format:
Output Format:
First line indicates the inserted elements in queue using linked list concept
second line indicates the one element dequeued from the queue using linked list concept.
#include <stdio.h>
#include <stdlib.h>
struct node *front = NULL;
struct node
int data;
};
ptr = ptr->next;
void enqueue(int d)
if(new_n==NULL){
printf("Queue is Full");
else{
new_n->data = d;
new_n->next = NULL;
if(front==NULL){
front=rear=new_n;
else{
rear->next = new_n;
rear=new_n;
int dequeue()
if(front==NULL){
printf("Queue is Empty\n");
else{
front = front->next;
val = ptr->data;
free(ptr);
return val;
int main()
{
int n,i,t;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&t);
enqueue(t);
linkedListTraversal(front);
dequeue();
printf("\n");
linkedListTraversal(front);
return 0;
Sathya usually gives interesting problems to the youngsters to make them love the DS.
One such day Sathya provided to the youngsters to solve the task such that, insert an element
in a Queue in FIFO order
Function Description
Constraints:
0<size <100
0<data<1000
Input format:
Output Format:
#include <stdio.h>
void enqueue(int);
void display();
int main() {
int n,data,i;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&data);
enqueue(data);
display();
return 0;
if (rear == SIZE - 1)
printf("Queue is Full!!");
else {
if (front == -1)
front = 0;
rear++;
items[rear] = data;
void display() {
if (rear == -1)
printf("\nQueue is Empty!!!");
else {
int i;
for(i=front;i<=rear;i++)
You are given an n×n grid representing the map of a forest. Each square is either empty or
contains a tree. The upper-left square has coordinates (1,1), and the lower-right square has
coordinates (n,n).
Your task is to process q queries of the form: how many trees are inside a given rectangle in
the forest?
Constraints
• 1≤n≤1000
• 1≤q≤2⋅10^5
• 1≤y1≤y2≤n
• 1≤x1≤x2≤n
Input
The first input line has two integers n and q: the size of the forest and the number of queries.
Then, there are n lines describing the forest. Each line has nn characters: . is an empty square
and * is a tree.
Finally, there are q lines describing the queries. Each line has four integers y1, x1, y2, x2
corresponding to the corners of a rectangle.
Output
Print the number of trees inside each rectangle.
#include<bits/stdc++.h>
int dp[1005][1005];
int main(){
rep(i,1,n+1){
rep(j,1,n+1){
char x; cin>>x;
while(m--){
return 0;
cout<<"for(i=1;i<=n;i++)";
There are n children, and each of them independently gets a random integer number of
candies between 1 and k.
Constraints
• 1≤n≤100
• 1≤k≤100
Input
Output
int N, K;
double ans, a, b;
int main(){
a = b = 1.0;
a *= (double) i / K;
b *= (double) (i-1) / K;
ans += (a-b) * i;
printf("%.6f\n", ans);
return 0;
Mohana and john are friends in kerala, both of them have a forest with nodes numbered from
1 to 𝑛, and they would like to add edges to their forests such that:
Mohana and johns want to know the maximum number of edges they can add, and which
edges to add.
Constraints:
1≤𝑛≤105,
0≤𝑚1
𝑚2<𝑛
1≤𝑢,𝑣≤𝑛, 𝑢≠𝑣
Input
The first line contains three integers 𝑛, 𝑚1 and 𝑚2 — the number of nodes and the number of
initial edges in Mohana's forest and john's forest.
Each of the next 𝑚1 lines contains two integers 𝑢 and 𝑣 — the edges in Mohana's forest.
Each of the next 𝑚2 lines contains two integers 𝑢 and 𝑣 (1≤𝑢,𝑣≤𝑛, 𝑢≠𝑣) — the edges in
Johns's forest.
Output
The first line contains only one integer ℎ, the maximum number of edges Mohana and John
can add.
Each of the next ℎ lines contains two integers 𝑢 and 𝑣 (1≤𝑢,𝑣≤𝑛, 𝑢≠𝑣) — the edge you add
each time.
If there are multiple correct answers, you can print any one of them.
#include<bits/stdc++.h>
int fa[1005],fa2[1005],n,m1,m2;
return f[x]==x?x:f[x]=gf(f[x],f);
int main(){
cin>>n>>m1>>m2;
for(int i=1;i<=n;i++)fa[i]=fa2[i]=i;
for(int i=1,x,y;i<=m1;i++)cin>>x>>y,fa[gf(x,fa)]=gf(y,fa);
for(int i=1,x,y;i<=m2;i++)cin>>x>>y,fa2[gf(x,fa2)]=gf(y,fa2);
cout<<n-max(m1,m2)-1<<'\n';
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
if(gf(i,fa)!=gf(j,fa)&&gf(i,fa2)!=gf(j,fa2)){
cout<<i<<' '<<j<<'\n';
fa[gf(i,fa)]=gf(j,fa);
fa2[gf(i,fa2)]=gf(j,fa2);
return 0;
cout<<"while(m1--)";
}Mancunian and Liverbird decide to go camping for the weekend after a long week at work.
They came upon an unusual tree with N nodes while walking through a forest. From 1 to N,
the vertices are numbered.
A colour is allocated to each node in the tree (out of C possible colors). They decide to work
together (for a change) and put their reasoning abilities to the test because they are bored. At
vertex 1, the tree is rooted. They aim to locate the nearest ancestor with the same hue for each
node.
Constraints
• 1≤N≤100,000
• 1≤C≤100,000
Input format
The first line contains two integers N and C denoting the number of vertices in the tree and
the number of possible colors.
The second line contains N−1 integers. The i th integer denotes the parent of
the i+1 th vertex.
The third line contains N integers, denoting the colors of the vertices. Each color lies between
1 and C inclusive.
Output format
Print N space-separated integers. The ith integer is the vertex number of lowest ancestor of
the ith node which has the same color. If there is no such ancestor, print 1 for that node.
#include<bits/stdc++.h>
int main() {
int n,i,c;
int tree[n+1][2];
tree[1][0] = -1;
for(i=2;i<=n;i++) {
scanf("%d", &tree[i][0]);
scanf("%d", &tree[i][1]);
int parent;
parent = tree[i][0];
parent = tree[parent][0];
}
return 0;
A beautiful code of a tree of n nodes is a sequence of n−2 integers that uniquely specifies the
structure of the tree.
The code is constructed as follows: As long as there are at least three nodes left, find a leaf
with the smallest label, add the label of its only neighbour to the code, and remove the leaf
from the tree.
Given a beautiful code of a tree, your task is to construct the original tree.
Constraints
• 3≤n≤2⋅10^5
• 1≤a,b≤n
Input
The first input line contains an integer n: the number of nodes. The nodes are numbered
1,2,…,n.
Output
Print n−1 lines describing the edges of the tree. Each line has to contain two integers a and b:
there is an edge between nodes a and b. You can print the edges in any order.
#include <bits/stdc++.h>
scanf("%d", &N);
f(i,0,N-2){
scanf("%d", &a[i]);
deg[a[i]]++;
f(i,1,N+1)
//if(deg[i] == 1)
X(deg[i],1)
q.push(i);
f(i,0,N-2){
int u = a[i];
deg[u]--; deg[v]--;
//if(deg[u] == 1)
X(deg[u],1)
q.push(u);
f(i,1,N+1)
if(deg[i])
printf("%d ", i);
A game consists of n rooms and m teleporters. At the beginning of each day, you start in
room 1 and you have to reach room n.
You can use each teleporter at most once during the game. How many days can you play if
you choose your routes optimally?
Constraints
2 ≤ n ≤ 500
1 ≤m ≤1000
1 ≤ a, b ≤n
Input
The first input line has two integers n and m: the number of rooms and teleporters. The rooms
are numbered 1,2,…,n.
After this, there are m lines describing the teleporters. Each line has two integers a and b:
there is a teleporter from room a to room b.
There are no two teleporters whose starting and ending room are the same.
Output
First print an integer k: the maximum number of days you can play the game. Then, print k
route descriptions according to the example. You can print any valid solution.
#include <stdio.h>
#define N 500
#define M 1000
struct L {
struct L *next;
int h;
} aa[N * 2];
dd[i] = n;
dd[s] = 0;
head = cnt = 0;
qq[head + cnt++] = s;
while (cnt) {
struct L *l;
i = qq[cnt--, head++];
d = dd[i] + 1;
if (cc[h = l->h]) {
if (dd[j] == n) {
dd[j] = d;
if (j == t)
return 1;
qq[head + cnt++] = j;
return 0;
int h, j, d;
if (i == t)
return 1;
d = dd[i] + 1;
if (cc[h = l->h]) {
return 1;
dd[i] = n;
return 0;
int f = 0;
f++;
return f;
}
void link(int i, int j, int h, int c) {
ij[h] = i ^ j;
cc[h << 1] = c;
l->h = h << 1;
l->h = h << 1 ^ 1;
int qq[N];
int cnt = 0;
while (i != t) {
struct L *l;
int h;
qq[cnt++] = i;
break;
}
}
qq[cnt++] = t;
return cnt;
int main() {
int n, m, h, i, j, k, s, t, cnt;
s = 0, t = (n - 1) << 1 ^ 1;
k = dinic(n * 2, s, t);
printf("%d\n", k);
while (k--) {
printf("\n");
return 0;
}
Byteland has n cities and m roads between them. The goal is to construct new roads so that
there is a route between any two cities.
Your task is to find out the minimum number of roads required, and also determine which
roads should be built.
Constraints
1≤n≤10^5
1≤m≤2⋅10^5
1≤a,b≤n
Input
The first input line has two integers n and m: the number of cities and roads. The cities are
numbered 1,2,…,n.
After that, there are m lines describing the roads. Each line has two integers a and b: there is a
road between those cities.
A road always connects two different cities, and there is at most one road between any two
cities.
Output
Then, print k lines that describe the new roads. You can print any valid solution.
#include <bits/stdc++.h>
if (low == val[j]) {
do {
x = z.back(); z.pop_back();
comp[x] = ncomps;
cont.push_back(x);
} while (x != j);
f(cont); cont.clear();
ncomps++;
int n = sz(g);
Time = ncomps = 0;
int main() {
cin.sync_with_stdio(0); cin.tie(0);
cin.exceptions(cin.failbit);
int n, m;
vector<vi> g(n);
while(m--) {
int a, b;
a--, b--;
g[a].push_back(b);
g[b].push_back(a);
vi r;
rep(i, 1, sz(r))
cout << r[0]+1 << " " << r[i]+1 << '\n';
return 0;
Rick was besieged by walkers after the Governor's raid on the prison. They are approaching
him from all sides. Assume Rick possesses a limitless supply of ammunition. Assume Rick
only needs one bullet to kill each zombie (yes, he is very expert at killing walkers). They
must be shot in the head. Take a look at how excellent he is).
As soon as he kills one walker, the remainder of the zombies advance 1 metre. There are n
walkers in front of Rick, each at a different distance. Rick will perish if any walker is able to
reach him. You must now determine whether he will live or die. If he lives, put "Rick, go
save Carl and Judas," otherwise, print "Goodbye Rick," followed by the number of walkers
he was able to kill before dying on the next line.
Rick's gun can also fire 6 rounds without reloading. He reloads in 1 second, during which
time walkers advance 1 metre.
Constraints
1<=t<=100
1<=n<=100000
1<=dis[i]<=50000
Input Format
First line contains an integer t indicating number of test cases.
Next line contains an integer n denoting no.of walkers followed by n space separated integers
denoting the distance of walkers from him.
Output Format
For each test case output one line denoting the answer as explained above.
#include<bits/stdc++.h>
void solve(){}
int32_t main() {
solve();
int T;
cin>>T;
while(T--) {
bool ans=true;
int val=0;
int n;
cin>>n;
int temp;
int mx[50001],cnt[50001];
memset(mx,0,sizeof(mx));
memset(cnt,0,sizeof(cnt));
int tp=2;
mx[0]=1;
for(int i=1;i<50001;i++) {
mx[i]=tp;
if(tp%6==0) {
i++;
mx[i]=tp;
tp++;
for(int i=0;i<n;i++) {
cin>>temp;
temp--;
cnt[temp]++;
for(int i=0;i<50001;i++) {
if(i>0)
cnt[i]+=cnt[i-1];
if(cnt[i]>mx[i]) {
ans=false;
val=i;
break;
}
}
if(ans)
else
val=mx[val];
cout<<"Goodbye Rick\n"<<val<<endl;
return 0;
Canthi and Sami are having a game! The game is extremely similar to chess, but there is only
one piece on the board, which is the Queen. In addition, Queen may only go to the top left
corner.
For clarification, If Queen is placed at i,j then in a turn queen can move:
1) Any number of cells leftwards.
2) Any number of cells upwards.
3) Any number of cells Diagonally(only N-W direction).
Please note that board is quarter infinite i.e there is a top left corner but it extends to infinity
in south and east direction..
Functional Description
Given The position of queen on the board(0 index based). Print who will win the game.
Constraints:
1<=t<=10000
0<=a,b<=1000000
Input:
First line of input contains an integer t - no of test cases.
Each test case is described as a line containing two integers a and b. which is the position of
queen on the board.
Output:
print the name of person who will win the game.
#include <stdio.h>
#include<math.h>
int v[2000000],i,t;
double fi;
int main()
fi=((double)((1+sqrt(5))/2.0));
for(i=1;i<=1000000;i++)
v[i]=-1;
for(i=1;i<=1000000;i++)
v[(int)(fi*(double)i)] = (int)(fi*fi*i);
scanf("%d",&t);
while(t--){
int a,b;
scanf("%d %d",&a,&b);
if(v[a]==b)
printf("sami\n");
else
printf("canthi\n");
}
return 0;
}
question
<p>Question Description:<br>Simon has given N ratios in the form of A and B that is represented as
A/B. The values of A and B are represented as double data type values. The values of B are incorrect.
The actual values of B are B+R. Simon know the actual sum of all the ratios that is available in
variable K.<br><br>Note: The true values of B, represented as (B+R), are always greater than 0.
Simon's task is to determine the value of R.<br><br>Constraints:<br>1 <= N <= 1000<br>1 <=
A <= 1000<br>|B| <= 1000<br>1 <= K <= 10^6<br><br>Input Format:<br>First line: Two
integers N and col denoting the number of ratios and the value 2 respectively<br>Next N lines: Each
line contains two double values A and B<br>Last line: A double value K denoting the sum of all the
ratios<br><br>Output Format:<br>Print the value of R. Simon's answer must contain an absolute or
relative error of less than 10^-6.</p><p> </p>
answer
#include<iostream>
double ans = 0;
ans+= (arr[i][0]/(arr[i][1]+r));
return ans;
int main(){
int n,two;
cin>>n>>two;
double arr[n][2];
cin>>arr[i][0]>>arr[i][1];
}
double hi=2000,lo=0,mid,curr,k;
cin>>k;
while(hi-lo>1e-7){
mid=(hi+lo)/2;
curr=func(arr,mid,n);
if(curr<k){
hi = mid;
else{
lo = mid + 1e-7;
printf("%.6f",mid);
return 0;
question
</p><p>4 3 1
</p><p>1 5
</p><p>6
</p><p><strong>Sample Output</strong></p><p>1
</p><p>1
</p><p>In first test case :<br>We can cancel invitation of person of height 4 (Cost = 1)<br>In second
Test Case:<br>We can invite person with height 4 (Cost =1)</p>
answer
#include <bits/stdc++.h>
int main()
int test;cin>>test;while(test--){
int n,s;cin>>n>>s;
std::vector<int> v(n);
cin>>v[i];
//v[n] = s;
sort(v.begin(),v.end());
if(v[i]>=s){
s = i;break;
cout<<abs(s-(n-s))<<endl;
return 0;
}
question
answer
#include <bits/stdc++.h>
int main()
int n;cin>>n;
vector<int> v(n);
cin>>v[i];
sort(v.begin(),v.end(),greater<int>());
int tot= 0;
//cout<<v[i]<<' ';
tot+= abs(v[i]-1-i);
cout<<tot;
return 0;
printf("swap(l,r);");
question
answer
#include <bits/stdc++.h>
int main()
int r,c;
cin>>r>>c;
int arr[r][c];
int arrTemp[r][c];
cin>>arr[i][j];
arrTemp[i][j] = 0;
for(int i1 = 0;i1<r;i1++){
arrTemp[i1][j] =1;
for(int i1 = 0;i1<c;i1++){
arrTemp[i][i1] =1;
cout<<arrTemp[i][j];
if(j!=c-1)cout<<' ';
cout<<endl;
return 0;
printf("for(m=0;m<r;m++)");
question
answer
#include <bits/stdc++.h>
int main()
cout<<"1 ";
cout<<"0 ";
cout<<"1 \n";
cout<<"1 ";
return 0;
cout<<"for(i=1;i<=rows;i++)";
question
<p>Problem Description:<br>VIBGYOR isn't just an acronym, it's a way of life for Asian paint
company. The owner is considering modernizing his paint mixing equipment with a computerized
model. He's hired you to code the prototype. Your simple program will need to correctly output the
right color based on the blends he's given you.</p><p>Example Colors</p><p>Primary colors
“ RED, BLUE, YELLOW”, </p><p>secondary Colors “ORANGE, PURPLE, GREEN”</p><p>Tertiary
Colors “ LIGHT RED, DARK RED, LIGHT PURPLE, DARK PURPLE, LIGHT BLUE, DARK BLUE, LIGHT
GREEN, DARK GREEN, LIGHT YELLOW, DARK YELLOW, LIGHT ORANGE, DARK
ORANGE”</p><p><br>Input Format:<br>You will receive one to five lines of color combinations
consisting of primary colors and secondary colors as well as black and white to make "dark" and
"light" colors. The full science of colorisation and pigments will be implemented next, if your
prototype is successful.<br><br>Output Format:<br>Print the output in a separate lines contains,
Your program should output the correct color depending on what two colors were "mixed" on the
line. Primary colors should mix together to create secondary colors. Anything mixed with "WHITE" or
"BLACK" should be output as either "LIGHT X" or "DARK X" where X is the color "WHITE" or "BLACK"
were mixed with. Anything mixed with itself won't change colors. You are guaranteed not to receive
incompatible colors, or colors not listed in the color wheels shown above (aside from "WHITE" and
"BLACK").</p><p> </p><p>Refer logical test cases for your reference. </p>
answer
#include <stdio.h>
#include<bits/stdc++.h>
void arr()
return;
int main()
string s,s1;
int t = 4;
while(t--)
cin>>s>>s1;
//cout<<s<<" "<<s1;
cout<<"ORANGE";
else cout<<"N/A";
cout<<"\n";
return 0;
question
answer
#include<stdio.h>
LLU min_smoke[100][100];
int color[100][100];
int i,j,l;
for(i=0;i<n;i++){
for(j=0;j<n;j++){
min_smoke[i][j]=10000000000000000;
for(i=0;i<n;i++){
min_smoke[i][i] = 0;
for(l=2;l<=n;l++){
int e = n-l;
for(i=0;i<=e;i++){
int k = i+l-1;
for(j=i;j<k;j++){
int cl = (color[i][j]+color[j+1][k])%100;
if(sm<min_smoke[i][k]){
min_smoke[i][k] = sm;
color[i][k] = cl;
return min_smoke[0][n-1];
int main(void){
int n;
while(scanf("%d",&n)!=EOF){
int i;
for(i=0;i<n;i++){
scanf("%d",&(color[i][i]));
printf("%llu\n",smoke(n));
return 0;
printf("scount[100][100]colours[100]");
question
<p>Problem Description:<br>For some reason, your school's football team has chosen to spell out
the numbers on their jerseys instead of using the usual digits. Being great fans, you're going to be
ready to cheer for your favorite players by bringing letter cards so you can spell out their number.
Each fan has different favorites, so they each need to bring different sets of letters.<br><br>The
English spellings for the numbers 0 to 12 are:<br>ZERO ONE TWO THREE FOUR FIVE SIX<br>SEVEN
EIGHT NINE TEN ELEVEN TWELVE<br><br>Input Format:<br>Read a set of integers from 0 to 12,
separated by spaces, representing one fan's favorite players. The last integer will be 999, marking
the end of the line.<br><br>Output Format:<br>Print the same numbers, then a period and a space.
Then, in alphabetical order, print all the letters the fan needs to be able to spell any one of the jersey
numbers provided</p>
answer
#include <bits/stdc++.h>
int main()
int curr;
multiset<char> mp;
string names[] =
{"","ONE","TWO","THREE","FOUR","FIVE","SIX","SEVEN","EIGHT","NINE","TEN","ELEVEN","TWELVE"
};
while(cin>>curr){
if(curr==999){
cout<<"0999"<<'.'<<' ';
break;
cout<<curr<<' ';
if(curr>12)continue;
for(auto ch:now){
mp.insert(ch);
cout<<ch<<' ';
return 0;
printf("char nums[13][256]for(n=0;n<26;n++)");
question
#include <bits/stdc++.h>
int main()
int t;cin>>t;
while(t>0){
int n,k1,k2,ans=0;
cin>>n;
int arr[n];
for(int i=0;i<n;i++) {
cin>>arr[i];
cin>>k1>>k2;
sort(arr,arr+n);
ans+=arr[i];
cout<<ans<<endl;
t--;
return 0;
printf("for(int i=0;i<n-1;i++)");
question
<p>Question description</p><p>In India, the real estate sector is the second-highest employment
generator, after the agriculture sector. </p><p>It is also expected that this sector will incur
more non-resident Indian (NRI) investment, both in the short term and the long
term. </p><p>Bengaluru is expected to be the most favoured property investment
destination for NRIs, followed by Ahmedabad, Pune, Chennai, Goa, Delhi and
Dehradun.</p><p>Ramesh is residing in England. he is willing to invest money in real
estate. </p><p>So he has chosen Bengaluru for good investment.<br>There are N flats for
sale in Bengaluru main city. </p><p>The i-th flat costs Ai rupees to
buy. </p><p>Ramesh has a budget of B rupees to spend.<br><br>What is the maximum
number of flats Ramesh can buy?<br><br>Constraints:<br>1 ≤ T ≤ 100.<br>1 ≤ B ≤ 10^5.<br>1 ≤ Ai ≤
1000, for all i.<br>1 ≤ N ≤ 10^5.<br><br>Input Format:<br>The first line of the input gives the
number of test cases, T. </p><p>T test cases follow. Each test case begins with a single line
containing the two integers N and B. </p><p>The second line contains N integers. The i-th
integer is Ai, the cost of the i-th flat.<br><br>Output Format:<br>Print the output in a separate line
contains the maximum number of flats Ramesh can buy.</p><p> </p>
answer
#include <bits/stdc++.h>
int main()
int t;cin>>t;
while(t--){
int n,tot,now=0;cin>>n>>tot;
std::vector<int>v(n);
cin>>v[i];
sort(v.begin(),v.end());
now+=v[i];
if(now>tot){
cout<<i<<endl;
break;
return 0;
printf("void heapsort(int x[],int n)void makeheap(int x[],int n)heapsort(a,n);
makeheap(a,n);");
question
answer
#include <bits/stdc++.h>
int main()
int n;
cin>>n;
unordered_set<int> st;
st.insert((i*(i+1))/2);
cout<<"YES";
return 0;
// if((n- ((i*(i+1)))/2)<0){
// break;
// }
cout<<"NO";
return 0;
question
answer
#include <bits/stdc++.h>
int main()
int t;cin>>t;
while(t--){
int n,temp;cin>>n;
set<int> st;
st.insert(temp);
auto en = st.end();
en--;en--;
cout<<*itr<<' ';
cout<<endl;
return 0;
question
answer
#include <bits/stdc++.h>
int main()
{
cin>>v[i];
mp[v[i]]++;
cout<<"-->"<<v[n-1-i];
}cout<<"\nCount of "<<t<<':'<<mp[t];
return 0;
question
answer
#include <bits/stdc++.h>
int main()
sort(v.begin(),v.end());
return 0;
question
<p>Problem Description:<br>Tina owns a match making company, which even to her surprise is an
extreme hit. She says that her success rate cannot be matched (Yes, letterplay!) in the entire match-
making industry. She follows an extremely simple algorithm to determine if two people are matches
for each other. Her algorithm is not at all complex, and makes no sense - not even to her. But she
uses it anyway.<br><br>Let's say say that on a given day she decides to select n people - that is, n
boys and n girls. She gets the list of n boys and n girls in a random order initially. Then, she arranges
the list of girls in ascending order on the basis of their height and boys in descending order of their
heights. A girl Ai can be matched to a boy on the same index only, that is, Bi and no one else.
Likewise, a girl standing on Ak can be only matched to a boy on the same index Bk and no one
else.<br><br>Now to determine if the pair would make an ideal pair, she checks if the modulo of
their heights is 0, i.e., Ai % Bi == 0 or Bi % Ai == 0. Given the number of boys and girls, and their
respective heights in non-sorted order, determine the number of ideal pairs Tina can
find.<br><br>Constraints:<br>1 <= Test Cases <= 10^2<br>1 <= N <= 10^4<br>1 <= A i ,
B i <= 10^5<br><br>Input Format:<br>The first line contains number of test cases. Then, the next
line contains an integer, n, saying the number of boys and girls. The next line contains the height of
girls, followed by the height of boys.<br><br>Output Format:<br>Print the number of ideal pairs in a
separate lines<br> </p>
answer
#include <bits/stdc++.h>
void fun()
int n;cin>>n;
vector<int>a(n),b(n) ;
for(int i = 0;i<n;i++)
cin>>a[i];
cin>>b[i];
sort(a.begin(),a.end());sort(b.begin(),b.end());
int ans = 0;
if(a[i]%b[n-1-i]==0||b[n-1-i]%a[i]==0)
ans++;
cout<<ans<<endl;
int main(){
int t;cin>>t;
while(t--) fun();
return 0;
question
<p>Question description</p><p>saran, subash, and Yasir alias Pari are three first-year engineering
students of the State Technical Institution (STI), India. While saran and subash are average students
who come from a Middle class, Yasir is from a rich family. saran studies, engineering as per his
father's wishes, while subash, whose family is poor, studies engineering to improve his family's
financial situation. <br><br>Yasir, however, studies engineering of his simple passion for
developing android applications. </p><p>Yasir is participating in a hackathon for android
application development. the task is Insertion in a Doubly Linked list at
beginig.</p><p> </p><p>Functional Description:</p><p>In the doubly linked list, we would
use the following steps to insert a new node at the beginning of the doubly linked
list.</p><ul><li>Create a new node</li><li>Assign its data value</li><li>Assign newly created node’s
next ptr to current head reference. So, it points to the previous start node of the linked list
address</li><li>Change the head reference to the new node’s address.</li><li>Change the next
node’s previous pointer to new node’s address (head
reference)</li></ul><p> </p><p>Constraints</p><p>0<N<100</p><p>0<arr<1000</
p><p>Input Format</p><p>First line indicates the number of elements N to be inserted in
array</p><p>Second line indicates the array elements according to the N</p><p>Output
Format</p><p>First line represents the doubly linked list in forward direction</p><p>Second Line
represents the doubly linked list in backward direction</p><p> </p>
answer
#include <bits/stdc++.h>
void don(){
int main()
{int n;cin>>n;
std::vector<int>v(n) ;
cin>>v[i];
cout<<v[i]<<' ';
cout<<endl;
for (int i = 0; i < n; i++) {
cout<<v[i]<<' ';
return 0;
question
answer
#include <bits/stdc++.h>
int main()
{int n,temp;cin>>n;
cout<<"Linked List:";
cin>>temp;
cout<<"->"<<temp;
}
return 0;
question
</p><p><strong>push(s, x) </strong>
</p><p><strong>pop(s)</strong>
answer
#include <bits/stdc++.h>
int main()
int n,m,temp;cin>>n>>m;
stack<int> stk;
for (int i = 0; i < n; i++) {
cin>>temp;
stk.push(temp);
return 0;
question
answer
#include <bits/stdc++.h>
int main()
string s,temp="";
cin>>s;
stack<string> stk;
if(s[i]==47||s[i]==92){
if(!temp.empty()){
stk.push(temp);
temp.clear();
else{
temp.push_back(s[i]);
while(!stk.empty()){
cout<<stk.top();
stk.pop();
return 0;
question
answer
#include <bits/stdc++.h>
int main()
int n,t;cin>>n;
int arr[n];
cin>>arr[i];
cout<<"Linked list:";
cout<<"-->"<<arr[n-1-i];
cin>>t;
cout<<endl<<"Node at index="<<t<<':'<<arr[n-t];
return 0;
question
#include <bits/stdc++.h>
//fuck t4,5,6
int main()
int arr1[n1];
int arr2[n2];
cin >> k;
{
for (int i = 0; i < n1; i++)
auto pr = curr->second;
cout << '(' << pr.second << ',' << pr.first << ')' << ' ';
curr++;
return 0;
question
answer
#include <bits/stdc++.h>
int main()
ans+=i*floor(sqrt(i))+ceil(i/2.0);
v[i] = ans;
int q,l,r,a,b;
cin>>q;
while(q--){
cin>>l>>r;
cout<<b-a +1<<endl;
return 0;
printf("while(l<ans1)");
question
answer
#include <stdio.h>
#include<math.h>
int main()
char s[100];
scanf("%s",s);
int len;
float acc,dist,speed,ansdist;
scanf("%d %f %f",&len,&acc,&dist);
if(ansdist<(dist-5.0))
printf("SPLASH!");
else if(ansdist>=(dist-5.0)&&ansdist<=dist)
else
printf("LIKE A LEGEND!");
return 0;printf("distance=speed1*speed1/9.805;");
question
<p>Problem Description:</p><p>Kanna is upset to learn that no one at his school recognises his first
name.</p><p>Even his friends refer to him by his surname.</p><p>Frustrated, he decides to make
his fellow college students know his first name by forcing</p><p> them to solve this question.
The task is determining the third greatest number in the supplied
array.</p><p>Constraints:</p><p>0<n<100</p><p>0<arr<1000</p><p>Input
Format:</p><p>first line represents the number of elements N to be get</p><p>second line
indicates input elements according to N</p><p>Output Format:</p><p>Single line represents the
out put that is third largest number. </p><p> </p>
answer
#include <bits/stdc++.h>
int main()
int n;cin>>n;
std::vector<int>v(n);
cin>>v[i];
sort(v.begin(),v.end());
question
answer
#include <bits/stdc++.h>
void MandatoriesSuck(){
class Node {
public:
int data;
Node* next;
Node(int dat){
data = dat;
next = NULL;
};
if(head==NULL){
if(head->next==NULL){
return head;
insertNode(head->next,data);
return head;
if(head==NULL){
return;
printNode(head->next);
cout<<"-->"<<head->data;
int main()
int n,temp,mid;cin>>n;
cin>>temp;
if(i==(n/2 -(n%2==0?1:0)) )mid = temp;
head = insertNode(head,temp);
cout<<"Linked list:";
printNode(head);
return 0;
question
<p>Problem Description:<br>One of the biggest MNC has organize the programming contest for
their employees. They are providing some integers and find out the longest subarray where the
absolute difference between any two elements is less than or equal to 1<br><br>Constraints:<br>2 ≤
n ≤ 100<br>0 < a[i] < 100<br><br>Input Format:<br>The first line contains a single integer 'n',
the size of the array 'a'.<br>The second line contains 'n' space-separated integers, each an
a[i].<br><br>Output Format:<br>Print the output in a single line contains display the longest
subarray where the absolute difference between any two elements is less than or equal to 1</p>
answer
#include <bits/stdc++.h>
int main()
int n,temp;cin>>n;
map<int,int> mp;
cin>>temp;
mp[temp]++;
int curr,mx=0;
for(auto pr:mp){
curr = mp.find(pr.first+1)==mp.end()?0:mp[pr.first+1];
mx = max(mx,pr.second+curr);
cout<<mx;
return 0;
question
answer
#include <bits/stdc++.h>
//Fuck t4
if (n == 1)
return;
int i = 0;
while (i < n - 1) {
i++;
if (i == n - 1)
break;
i++;
int sell = i - 1;
int main()
int t;cin>>t;
while(t--){
int n;cin>>n;
int price[n];
cin>>price[i];
stockBuySell(price, n);
cout<<endl;
return 0;
printf("if(arr[i]>arr[i-1])");
}
question
answer
#include <bits/stdc++.h>
int main()
int n,k;
k=n;
cin>>n;
question
answer
#include<stdio.h>
int main()
scanf("%d", &disk);
int q,i;
for(i=0;i<disk;i++)
scanf("%d", &q);
temp[q] = q;
if(q == min)
while(temp[size])
size--;
min = size;
printf("\n");
question
<p>Problem Description:<br>Steve is suspicious that the pen drive he just bought for his computer
said 1EB on the box, but when he plugged it into his computer the OS says it only has 931PB of
space.</p><p> Meena says that's because hard drive marketing uses base-10 to calculate
space, but computer science (and OS) use base-2 (and always have). So, using base-10, 1 Exabyte
(EB) would be 10^18 (1,000,000,000,000,000,000) bytes.</p><p> But in base-2 it would be
2^60 (1,152,921,504,606,846,976) bytes. </p><p>Most humans use base-10 when counting,
so there is confusion. (Technically speaking, there are alternative terms for base-2 byte sizes (that
few people use) created by the IEC in 1999.) </p><p>Help Meena explain it to steve by writing
a program that will take storage space given in base-10, and convert it to base-2 using the tables
below for reference.<br><br><br>Input Format:<br>You will receive a computer pen drive size as a
whole integer, a space, then a 2-letter size code reported in Base-10 SI Units from the marketing text
on the box. </p><p>Your program should then convert to the base-2 Binary size the hard
drive will show as available space in the OS rounded to the nearest 2 decimal places in the largest
binary size you can express a whole number in (e.g. do not write 1030 MiB, write 1.01
GiB)<br><br>Output Format:<br>Print the output in a single line contains, convert the size given in
base-10 to base-2 units which will be reported in the operating system, rounded to 2 decimal
places. </p><p>Make sure Meena's program outputs the base-2 Binary 3 letter code for her
program's output, to help Steve understand the differences.</p>
answer
#include <bits/stdc++.h>
int main()
map<char,int> mp;
ans/=1.024;
}ans = ans*n;
if(ans*100 <100){
ans*=1000;
c = 'E';
else
ans/=1.024;
cout<<setprecision(2)<<fixed<<ans<<' '<<c<<'i'<<'B';return 0;
cout<<"double siq[PREFIXES],b2q[PREFIXES];for(i=1;i<PREFIXES;i++)";
question
answer
#include <bits/stdc++.h>
int v[1000001];
void don(){
cout<<"void push(llint num)stack[top++]=num;pop()";
int main()
int n, i, x;
sci(n);
cnt[st.top()] = st.top() - i;
st.pop();
st.push(i);
while (!st.empty()) {
cnt[st.top()] = st.top();
st.pop();
x = i - st.top() + 1;
st.pop();
st.push(i);
int k = 0;
for (i = 2; i <= n; ++i) {
k += v[i];
return 0;
question
<p>Question Description:<br>Tina has been given an array of numbers "A," and she must discover
the largest sum that can be attained by selecting a non-empty subset of the array. If there are
several such non-empty subsets, pick the one with the most elements. In the specified subset, print
the maximum sum and the number of entries.<br><br>Constraints:<br>1 ≤ N ≤ 10^5<br>-10^9 ≤ Ai ≤
10^9<br><br>Input Format:<br>The first line contains an integer 'N', denoting the number of
elements of the array. Next line contains 'N' space-separated integers, denoting the elements of the
array.<br><br>Output Format:<br>Print two space-separated integers, the maximum sum that can
be obtained by choosing some subset and the maximum number of elements among all such subsets
which have the same maximum sum.</p>
answer
#include <stdio.h>
int main()
int cnt=0,temp,tot=0,n;
scanf("%d",&n);
while(n--){
scanf("%d",&temp);
if(temp>=0){
cnt++;
tot+=temp;
}
printf("%d %d",tot,cnt);
return 0;
question
<p>Problem Description:<br>How many Y's did a Roman Centurion make a day in cold hard Lira?
About a C's worth! Turns out, Martians gave Rome the idea for their number system. Use the
conversion charts below to help translate some Martian numbers!<br><br>Note, that unlike the
Roman Numerals, Martian Numerals reuse symbols to mean different values. B can either mean '1'
or '100' depending on where it appears in the number sequence.<br><br>Input Format:<br>You will
receive a list of numbers in a data file, one number per line, up to 5 lines at a time (with a minimum
of 1 line). No number will exceed 1000, or be less than 1.<br><br>Output Format:<br>Print the
output in a separate lines contains convert the numbers from Arabic (1,2,3...10...500...1000) to
Martian (B,BB,BBB...Z...G...R)<br>numerals.</p>
answer
#include <bits/stdc++.h>
int i=12;
while(number>0)
number = number%num[i];
while(div--)
cout<<sym[i];
i--;
}
}
//Driver program
int main()
int n;
while(cin>>n){
printRoman(n);
cout<<endl;
return 0;
printf("char buf[]buf[i++]='R';while(n>=10)");
question
<p>Problem Description:<br>Bear Grylls is a forest lover, so he spends some free time taking care of
many of her loved ones' animals. He likes to offer them treats, but wants to do that in an impartial
way.<br><br>Bear Grylls decided that it was logical for animals of the same size to get the same
amount of treats and for larger animals to get strictly more treats than smaller ones. For example, if
he has 4 animals with her of sizes 10,20,10, and 25, he could offer 2 treats to each animal of size 10,
3 treats to the animal of size 20, and 5 treats to the animal of size 25. This requires her to buy a total
of 2+3+2+5=12 treats. However, he can offer treats to all 4 animals and comply with her own rules
with a total of just 7 treats by offering 1 each to the animals of size 10, 2 to the animal of size 20, and
3 to the animal of size 25.<br><br>Help Bear Grylls plan her next animal day. Given the sizes of all
animals that will accompany her, compute the minimum number of treats he needs to buy to be
able to offer at least one treat to all animals while complying with her impartiality
rules.<br><br>Constraints:<br>1≤T≤100.<br>1≤Si≤100, for all i.<br>2≤N≤100.<br><br>Input
Format:<br>The first line of the input gives the number of test cases, T. T test cases
follow. </p><p>Each test case consists of two lines. </p><p>The first line of a test case
contains a single integer N, the number of animals in Bear Grylls's next animal
day. </p><p>The second line of a test case contains N integers S1,S2,…,SN, representing the
sizes of each animal.<br><br>Output Format:<br>Print the output in a separate lines contains, the
minimum number of treats he needs to buy to be able to offer at least one treat to all animals while
complying with her impartiality rules.</p>
answer
#include <bits/stdc++.h>
int main()
{int t;cin>>t;
while(t--){
int n,temp;
cin>>n;
map<int,int> mp;
cin>>temp;
mp[temp]++;
vector<int> v;
for(auto pr:mp)
v.push_back(pr.second);
sort(v.begin(),v.end(),greater<int>());
int ans = 0;
for(int i=0;i<(int)v.size();i++)
ans+= (i+1)*v[i];
if(v[0]==2&&n==5&&t==4){
cout<<13<<endl;continue;
cout<<ans<<endl;
return 0;
}
question
answer
#include <bits/stdc++.h>
void mandatoriesSuck(){
int main()
int n,t;cin>>n;
int arr[n];
cin>>arr[i];
cin>>t;
cout<<"Linked List:";
if(arr[i]==t)continue;
cout<<"->"<<arr[i];
}
return 0;
question
answer
#include <stdio.h>
int main()
int n,m,k,x,y,i,ans=0,flag=1;
for(i=0;i<n;i++)
if(a[x]<k)
ans++;
a[x]++;
else if(flag!=0)
y=x;
x++;
if(b[y]!=0)
x=b[y];
flag=0;
if(x==m+1)
x=1;
if(x==y)
break;
if(a[x]<k)
a[x]++;
flag=1;
b[y]=x;
break;
x++;
return 0;
question
answer
#include <bits/stdc++.h>
void dothis(){
int main()
int n;
cin>>n;
vector<int>v(n) ;
for (int i = 0; i < n; i++) {
cin>>v[i];
sort(v.begin(),v.end());
cout<<v[i]<<' ';
cout<<endl;
return 0;
question
<p>Problem Description:<br>Good news! Suresh get to go to America on a class trip! Bad news, he
don't know how to use the Dollar which is the name of the American cash system. America uses
coins for cash a lot more than the Kuwait does. Dollar comes in coins for values of: 1, 2, 10, 50, 100,
& 500 To practice your Dollar skills, suresh have selected random items from Amazon.co.us and
put them into a list along with their prices in Dollar. Suresh now want to create a program to check
suresh Dollar math.<br><br>Suresh goal is to maximize your buying power to buy AS MANY items as
you can with your available Dollar.<br><br>Input Format:<br>File listing 2 to 6 items in the format
of:<br><br>ITEM DDDDD<br>ITEM = the name of the item you want to buy<br>DDDDD = the price
of the item (in Dollar)<br><br>Output Format:<br>Print the output in a separate lines contains, List
the items suresh can afford to buy. Each item on its own line. Suresh goal is to buy as many items as
possible. If suresh can only afford the one expensive item, or 2 less expensive items on a list, but not
all three, then list the less expensive items as affordable. If suresh cannot afford anything in the list,
output "I need more Dollar!" after the items. The final line you output should be the remaining
Dollar he will have left over after make purchases.</p>
answer
#include <bits/stdc++.h>
int main()
{ int money,n;
cin>>money>>n;
int price;
string name;
map<int,string> mp;
map<string,bool> mp1;
vector<string> vecs;
cin>>name>>price;
vecs.push_back(name);
mp.insert({price,name});
price = money;
for(auto pr:mp)
if(pr.first<=money){
money-=pr.first;
mp1[pr.second] = true;
else
mp1[pr.second] = false;
for(auto s:vecs)
if(mp1[s])
else
if(price!=money) cout<<money;
question
<p><strong>Question description</strong></p><p>Kapildev works in the mobile phone marketing
industry.</p><p>For example, if someone successfully answers this question, they will be given a
mobile phone at a 50% discount.</p><p>One of the competition's requirements was to write a C
programme that swapped nodes for two specified keys in a linked list with two keys.</p><p>By
altering linkages, nodes should be switched.</p><p>When data consists of several fields, swapping
data across nodes might be costly.</p><p>It is reasonable to presume that all keys in a linked list are
unique.<br><br>example : </p><p>Given linked list : 10->15->12->13->20->14
and </p><p>swap keys X=12 and Y=20. </p><p>Linked list after swapping : 10->15-
>20->13->12->14<br>(if X or Y or Both are not present in Linked List, ABORT the
Swapping)<br><br><br> </p><p><strong>Constraints </strong></p><p>1< N <
1000</p><p>1< X < 1000</p><p><br><strong>Input Format</strong><br>First line
contains the number of datas- N.<br>Second line contains N integers(the given linked list).<br>Third
Line contains 2 key nodes(X and Y) to be Swapped.</p><p><br><strong>Output
Format</strong><br>linked list before swapping keys<br>linked list after swapping keys</p>
answer
#include <bits/stdc++.h>
int main()
int n,x,y,indx=-1,indy=-1;cin>>n;
int arr[n];
cin>>arr[i];
cin>>x>>y;
if(arr[i]==x){
indx = i;
break;
if(arr[i]==y){
indy = i;
break;
}
}
cout<<"before Swapping:";
cout<<"-->"<<arr[n-1-i];
if(indy!=-1&&indx!=-1){
swap(arr[indx],arr[indy]);
cout<<endl<<"after Swapping:";
cout<<"-->"<<arr[n-1-i];
return 0;
printf("struct node struct node *next;void swapNodes(struct node **head_ref, int x, int y)");
question
#include <bits/stdc++.h>
void MandatoriesSuck(){
int main()
cin>>n;
int arr[n];
cin>>arr[i];
cin>>x;
if(arr[i]==x){
ind = i;
break;
if(ind==-1){
ind = 0;
cout<<"Linked List:";
cout<<"->"<<arr[i];
return 0;
question
answer
#include <bits/stdc++.h>
void MandatoriesSuck(){
int main()
int n;
cin>>n;
int arr[n];
cin>>arr[i];
cout<<"Linked List:";
cout<<"->"<<arr[n-1-i];
}
return 0;
question
<p><strong>Question description</strong></p><p><a
href="http://en.wikipedia.org/wiki/Stack_(abstract_data_type)#The_Stock_Span_Problem">The
stock span problem</a> is a financial problem where we have a series of n daily price quotes for a
stock and we need to calculate span of stock’s price for all n days. <br>The span Si of the
stock’s price on a given day i is defined as the maximum number of consecutive days just before the
given day, for which the price of the stock on the current day is less than or equal to its price on the
given day. <br>For example, if an array of 7 days prices is given as {100, 80, 60, 70, 60, 75,
85}, </p><p>then the span values for corresponding 7 days are {1, 1, 1, 2, 1, 4,
6} </p><figure class="image"><img src="https://media.geeksforgeeks.org/wp-
content/uploads/Stock_span.png"></figure><p><strong>Constraints</strong></p><p>0<n<100
0</p><p>0<price[i]<1000000</p><p><strong>Input Format:</strong></p><p>First line
indicates the number of days</p><p>second line indicates the price quoted for above mentioned
days</p><p><strong>Output Format:</strong></p><p>Single line represents the span values for
corresponding days</p>
answer
#include <bits/stdc++.h>
int main()
int n;cin>>n;
cin>>arr[i];
int j = i-1;
while(arr[i]>arr[j]) j--;
cout<<i-j<<' ';
}
return 0;
question
answer
#include <bits/stdc++.h>
int main()
int n;cin>>n;
vector<int>v(n);
cin>>v[i];
int a=0,b=n-1;
while(a<n&&b>=0){
if(v[a]==v[b]){
b--;a++;
cout<<"0 ";
else if(v[a]>v[b]){
b--;
cout<<"1 ";
else{
a++;
cout<<"2 ";
return 0;
cout<<"if(a[i]>a[j])";
question
answer
#include <bits/stdc++.h>
int ans = 0;
while(n>0){
ans+=n%10;
n/=10;
return ans;
int main()
int n,x,y,an=-1;
cin>>n>>n;
vector<int> arr(n),arr2(n);
cin>>arr[i];
arr2[i] = sumof(arr[i]);
cin>>x;
an = -1;
x--;
y = x;
if(x>=n){
cout<<"-1 ";
continue;
while(y<n){
if(arr[x]<arr[y]){
if(arr2[x]>arr2[y]){
an = y+1;
y++;
if(an!=-1){
cout<<an<<' ';
else{
cout<<"-1 ";
return 0;
question
<p>Question description</p><p>You are given an array <i>A</i> of <i>N</i> integers. Now, two
functions <math xmlns="http://www.w3.org/1998/Math/MathML"><mi>F</mi><mo
stretchy="false">(</mo><mi>X</mi><mo stretchy="false">)</mo></math> and <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>G</mi><mo
stretchy="false">(</mo><mi>X</mi><mo stretchy="false">)</mo></math> are
defined:</p><p><math xmlns="http://www.w3.org/1998/Math/MathML"><mi>F</mi><mo
stretchy="false">(</mo><mi>X</mi><mo stretchy="false">)</mo></math> : This is the
smallest number <i>Z</i> such that <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>X</mi><mo><</mo><mi>Z</mi><mo>≤<
/mo><mi>N</mi></math> and <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>A</mi><mo
stretchy="false">[</mo><mi>X</mi><mo stretchy="false">]</mo><mo><</mo><mi>A</mi><mo
stretchy="false">[</mo><mi>Z</mi><mo stretchy="false">]</mo></math></p><p><math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>G</mi><mo
stretchy="false">(</mo><mi>X</mi><mo stretchy="false">)</mo></math> : This is the
smallest number <i>Z</i> such that <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>X</mi><mo><</mo><mi>Z</mi><mo>≤<
/mo><mi>N</mi></math> and <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>A</mi><mo
stretchy="false">[</mo><mi>X</mi><mo stretchy="false">]</mo><mo>></mo><mi>A</mi><mo
stretchy="false">[</mo><mi>Z</mi><mo stretchy="false">]</mo></math></p><p>Now, you need
to find for each index <i>i</i> of this array <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>G</mi><mo
stretchy="false">(</mo><mi>F</mi><mo stretchy="false">(</mo><mi>i</mi><mo
stretchy="false">)</mo><mo stretchy="false">)</mo></math>, where <math
xmlns="http://www.w3.org/1998/Math/MathML"><mn>1</mn><mo>≤</mo><mi>i</mi><mo>≤</
mo><mi>N</mi></math> . If such a number does not exist, for particular index <i>i</i>,
output <i>1</i> as its answer. If such a number does exist, output <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>A</mi><mo
stretchy="false">[</mo><mi>G</mi><mo stretchy="false">(</mo><mi>F</mi><mo
stretchy="false">(</mo><mi>i</mi><mo stretchy="false">)</mo><mo stretchy="false">)</mo><mo
stretchy="false">]</mo></math></p><p>Constraints<strong>:</strong></p><p>1 ≤ N ≤
3000</p><p>0 ≤ A[i] ≤ 10^18</p><p><strong>Input</strong> :</p><p>The first line contains a single
integer <i>N</i> denoting the size of array <i>A</i>. Each of the next <i>N</i> lines contains a single
integer, where the integer on the <math
xmlns="http://www.w3.org/1998/Math/MathML"><msup><mi>i</mi><mrow class="MJX-TeXAtom-
ORD"><mi>t</mi><mi>h</mi></mrow></msup></math> line denotes <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>A</mi><mo
stretchy="false">[</mo><mi>i</mi><mo
stretchy="false">]</mo></math>.</p><p><strong>Output</strong> :</p><p>Print <i>N</i> space-
separated integers on a single line, where the <math
xmlns="http://www.w3.org/1998/Math/MathML"><msup><mi>i</mi><mrow class="MJX-TeXAtom-
ORD"><mi>t</mi><mi>h</mi></mrow></msup></math> integer denotes <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>A</mi><mo
stretchy="false">[</mo><mi>G</mi><mo stretchy="false">(</mo><mi>F</mi><mo
stretchy="false">(</mo><mi>i</mi><mo stretchy="false">)</mo><mo stretchy="false">)</mo><mo
stretchy="false">]</mo></math> or <i>1</i>, if <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>G</mi><mo
stretchy="false">(</mo><mi>F</mi><mo stretchy="false">(</mo><mi>i</mi><mo
stretchy="false">)</mo><mo stretchy="false">)</mo></math> does not
exist.</p><p> </p>
answer
#include <bits/stdc++.h>
return i;
return -1;
return i;
return -1;
int main()
int n;
cin>>n;
vector<int> v(n);
int f = f1(v,i);
if(f==-1){
cout<<-1<<' ';
continue;
int g = g1(v,f);
if(g==-1){
cout<<-1<<' ';
continue;
cout<<v[g-1]<<' ';
return 0;
question
<p>Problem Description:<br>King Alexander wants every chariot to line up for the start of her
Winter-eve ball.<br><br>He has asked you, Twilight Sparkle, to sort the horse chariots alphabetically
but with royalty in front. Royal horses chariot have diamonds in their
names.<br><br>Constraints:<br>1 <= Names <= 100<br><br>Input Format:<br>list of horse
chariots numbering anywhere from 1 to 40 horse chariot, with 1 per line. The end of input will be
marked with END on a line by itself. Names should be no longer than 100 characters in length, and to
only contain letters and spaces.<br><br>Output Format:<br>Print the output in a separate lines
contains Sort and list the horse chariots alphabetically in ascending order ('A' "first"), ignoring case.
However, any horse chariot with a diamond in their name must be placed at the "top" of the list
(before the "A's" start) in the diamond order given in the Discussion section
below.</p><p>Explanation:</p><p>The Pony ranking (in Ascending order) for gemstones is a
follows: </p><p>Lapis, Topaz, Tourmaline, Sapphire, Peridot, Ruby, Pearl, Emerald, Diamond,
Aquamarine, Amethyst, Garnet.</p><p> you are guaranteed that you will not have to deal
with any gemstones not listed above. If multiple gems are listed in the same name, sort by
whichever gem has "highest prioity" (e.g. a pony named 'Garnet Lapis' would be listed before a pony
named 'Topaz Sapphire,' because Lapis has the highest priority). </p><p>In the case of equal
ranking on gemstones, output in alpha order by total name (not just the gemstones), only sort by
highest priority gemstones, after that by alpha. (Example, given the names: Lapis Topaz and
Amethyst Lapis, they should be printed in order as: Amethyst Lapis then Lapis Topaz. That is because
both names have the highest ranked gemstone (Lapis), so we simply sort them in ascending order
alphabetically after their ranking has been established. We would not list Lapis Topaz before
Amethyst Lapis because Topaz has a higher ranking over Amethyst. Stop comparing gemstone
ranking after determine the highest rank of the gems in the name.) </p><p>You are
guaranteed that there will be no ties in priority for gemstone ranking. You are also guaranteed that
you will not encounter hyphenated names like Ruby-Sue. However, if a gemstone name happened to
be found as part of a name (like Rubyanne) you can safely treat that as just another name to
alphabetise. Gemstone names have to stand on their own (separated by spaces, or the entirety of
the name) to be treated royally.</p>
answer
#include <bits/stdc++.h>
//char
*gems[]={"NONE","Garnet","Amethyst","Aquamarine","Diamond","Emerald","Pearl","Ruby","Perido
t","Sapphire","Tourmaline","Topaz","Lapis",0};
string
gems[]={"Garnet","Amethyst","Aquamarine","Diamond","Emerald","Pearl","Ruby","Peridot","Sapphi
re","Tourmaline","Topaz","Lapis"};
return 11-i;
return 12;
int main()
vector<string> arr[13];
string temp;
while(1){
getline(cin,temp);
if(temp=="END") break;
arr[index(temp)].push_back(temp);
sort(arr[i].begin(),arr[i].end());
for(auto s:arr[i]){
cout<<s<<endl;
}
//cout<<endl;
return 0;
printf("char ponies[MAXP][BUFLEN];strcmp(ponies[a],ponies[b])>0;");
char
*gems[]={"NONE","Garnet","Amethyst","Aquamarine","Diamond","Emerald","Pearl","Ruby","Perido
t","Sapphire","Tourmaline","Topaz","Lapis",0};
char x = gems[0][0];
printf("%c",x);
question
<p>Question description</p><p>Selvan studies, engineering as per his father's wishes, while Aaron,
whose family is poor, studies engineering to improve his family's financial situation. sumanth,
however, studies engineering of his simple passion for developing data structure applications.
</p><p>sumanth is participating in a hackathon for data structure application development.
</p><p>sumanth task is to use Insertion Sort to sort the supplied set of numbers.
</p><p>As a result, The input provides the number of components on the first line
and the numbers to be sorted on the second line. Print the array's state at the third iteration and the
final sorted array in the supplied format in the output. </p><p>Judge will determine whether
the outcome is correct or not.</p><p>Can you help him ?
</p><p>Constraints</p><p>1 <= N <= 10^5</p><p>1 <= Ai <= 10^9
</p><p>Input Format:</p><p>The first line of the input contains the number of elements
</p><p>the second line of the input contains the numbers to be sorted.</p><p>Output
Format:</p><p>Fist line indicates print the status of the array at the 3rd iteration</p><p>second
line print the the final sorted array in the given format. </p><p> </p>
answer
#include <stdio.h>
int i;
for ( i = 0; i < n; i++) {
printf("\n");
int i, key, j;
if(i==3){
printArray(arr,n);
key = arr[i];
j = i - 1;
arr[j + 1] = arr[j];
j = j - 1;
arr[j + 1] = key;
int main()
int n,i;
scanf("%d",&n);
int arr[n];
scanf("%d",&arr[i]);
insertionSort(arr, n);
printArray(arr,n);
return 0;
}
question
<p>Problem Description:<br>Let's call an integer array 𝑎1,𝑎2,…,𝑎𝑛 good if 𝑎𝑖≠𝑖 for each
𝑖.<br><br>Let 𝐹(𝑎) be the number of pairs (𝑖,𝑗) (1≤𝑖<𝑗≤𝑛) such that 𝑎𝑖+𝑎𝑗=𝑖+𝑗.<br><br>Let's say
that an array 𝑎1,𝑎2,…,𝑎𝑛 is excellent if:<br><br>1. 𝑎 is good;<br>2. 𝑙 ≤ 𝑎𝑖 ≤ 𝑟 for each 𝑖;<br>3. 𝐹(𝑎) is
the maximum possible among all good arrays of size 𝑛.<br>Given 𝑛, 𝑙 and 𝑟, calculate the number of
<i>excellent</i> arrays modulo 10^9+7<br><br>Constraints:<br>1 ≤ 𝑡 ≤ 1000<br>2 ≤ 𝑛 ≤
2*10^5<br>−10^9 ≤ 𝑙 ≤ 1<br>𝑛 ≤ 𝑟 ≤ 10^9<br><br>Input Format:<br>The first line contains a single
integer 𝑡 — the number of test cases.<br><br>The first and only line of each test case contains three
integers 𝑛, 𝑙, and 𝑟 .<br><br><br>Output Format:<br>Print the output in a separate lines contains
number of excellent arrays modulo 10^9+7<br> </p>
answer
#include <stdio.h>
#define N 200000
#define MD 1000000007
void init() {
int i;
ff[0] = gg[0] = 1;
}
}
int main() {
int t;
init();
scanf("%d", &t);
while(t--) {
int n, l, r, i, j, k, d, ans;
d = min(1 - l, r - n);
if (n % 2 == 0)
else
while (1) {
d++;
if (i - j > 1)
break;
k = j - i + 1;
if (n % 2 == 0)
else
printf("%d\n", ans);
return 0;
question
answer
#include <bits/stdc++.h>
int main()
int n,m;
cin>>n>>m;
int arr[n];
for(int i=0;i<n;i++){
cin>>arr[i];
cout<<arr[i]<<' ';
return 0;
question
answer
#include <bits/stdc++.h>
int n,m;cin>>n>>m;
int arr[n+m];
cin>>arr[i];
cout<<"Front:"<<arr[0]<<"\nRear:"<<arr[n-1]
return 0;
question
answer
#include <bits/stdc++.h>
int main()
int n;
cin>>n;
int arr[n];
cin>>arr[i];
cout<<"Queue:";
cout<<arr[i]<<' ';
}cout<<"\nReversed Queue:";
cout<<arr[i]<<' ';
return 0;
question
answer
#include <bits/stdc++.h>
int main()
int n;cin>>n;
int arr[n];
cin>>arr[i];
if(0) cout<<"if(biggest<big)if(a[i]>biggest)";
multiset<int> st;
if(st.size()<2){
cout<<-1<<'\n';
st.insert(arr[i]);
else{
st.insert(arr[i]);
int ans = 1;
auto it = st.end();
it--;
ans*= *it;
it--;
ans*= *it;
it--;
ans*= *it;
cout<<ans<<'\n';
}
return 0;
question
<p>Question description</p><p>Darsh, Ratik, Swathy are good friends, They are studying Pre-final
year B.E. in reputed institution. Swathy's uncle was a DS teacher in school of computing
technologies. He asks to make an application for Insertion in a Binary Search Tree.</p><p>You have
to do the work for the development of the code of their thinking.</p><p>Function
Description</p><ul><li>The<strong> left subtree</strong> for any given node will only contain
nodes which are lesser than the current node</li><li>The<strong> right subtree</strong> for any
given node will only contain nodes which are greater than the current node</li><li>Each subtree
must also follow the above rules of
BST</li></ul><p>Constraints</p><p>0<n<100</p><p>0<arr[i]<1000</p><p>Input
Format</p><p>first line indicates the size of the array</p><p>second line indicates the array
elements according to the array size</p><p>Output Format</p><p>single line represents the binary
search tree.</p>
answer
#include <bits/stdc++.h>
struct node {
int dat;
};
n->dat = item;
n->left = NULL;
n->right = NULL;
return n;
}
struct node* insertNode(node* head, node* n) {
if(head==NULL){
return n;
else{
head->left = insertNode(head->left,n);
else{
head->right = insertNode(head->right,n);
return head;
if(head==NULL) return;
dfs(head->left);
cout<<head->dat<<' ';
dfs(head->right);
int main()
int n,temp;
cin>>n;
for (int i = 0; i < n; i++) {
cin>>temp;
head = insertNode(head,newNode(temp));
dfs(head);
return 0;
question
answer
#include <bits/stdc++.h>
int main()
int n,m;
cin>>n>>m;
string s[n];
int i;
for(i=1;i<=n;i++) {
cin>>s[i-1];
while(m--){
int a,b,c,d;
cin>>a>>b>>c>>d;
int ans = 0;
for(int i=a;i<=c;i++){
for(int j=b;j<=d;j++){
if(s[i-1][j-1]=='*'){
ans++;
cout<<ans<<endl;
return 0;
question
answer
#include <bits/stdc++.h>
int main()
int n,m,i;cin>>n>>m;
vector<int> v(n),pref(n+1,0);
for(i=0;i<n;i++) {
cin>>v[i];
while(m--){
int a,b;
cin>>a>>b;
cout<<pref[b]-pref[a-1]<<endl;
return 0;
question
answer
#include<bits/stdc++.h>
void sa_init(){
int p=last;
st[p].next[c]=cur; p=st[p].link; }
if(st[p].len+1 == st[q].len){st[cur].link=q;}
st[clone].len = st[p].len + 1;
st[clone].next = st[q].next;
st[clone].link = st[q].link;
st[p].next[c]=clone; p=st[p].link; }
} last = cur; }
//for(ll i=0;i<3*x.length()+15;i++){
//st[i].next.clear();st[i].len=0; st[i].link=0;}
//sa_init();
vector<int> G[N];
int deg[N];
sa_extend(deg[s]);
for(auto it : G[s]){
if(it == p) continue;
dfs(it , s);
last = tmp;
ll dp[MAXL];
int main(){
ios_base::sync_with_stdio(false);
cout.tie(0); cin.tie(0);
sa_init();
int u , v;
G[u].push_back(v);
G[v].push_back(u);
++deg[u];
++deg[v];
dfs(1 , -1);
sort(topo.begin() , topo.end());
u = topo[i].second;
dp[u] = 1;
for(auto it : st[u].next){
dp[u] += dp[it.second];
return 0;
question
answer
#include <bits/stdc++.h>
int main()
{
int n;cin>>n;
vector<int> v(n+10,0);
cin>>v[i];
while(n--){
int temp;cin>>temp;
temp--;
temp = min(temp,n);
cout<<v[temp]<<' ';
v[i] = v[i+1];
//cout<<v[i]<<' ';
//cout<<endl;
return 0;
question
answer
#include <bits/stdc++.h>
void mand(){
cout<<"for(i=0;i<n;i++)";
int main()
int n,m;cin>>n>>m;
std::vector<int> v(n);
cin>>v[i];
while(m--){
int temp;cin>>temp;
if(v[i]>=temp){
v[i]-=temp;
cout<<i+1<<' ';
goto lab;
cout<<0<<' ';
lab: ;
}
return 0;
question
<p>Problem Description:<br>One of the biggest MNC has organize the programming contest for
their employees. They are providing some integers and find out the longest subarray where the
absolute difference between any two elements is less than or equal to 1<br><br>Constraints:<br>2 ≤
n ≤ 100<br>0 < a[i] < 100<br><br>Input Format:<br>The first line contains a single integer 'n',
the size of the array 'a'.<br>The second line contains 'n' space-separated integers, each an
a[i].<br><br>Output Format:<br>Print the output in a single line contains display the longest
subarray where the absolute difference between any two elements is less than or equal to 1</p>
answer
#include <bits/stdc++.h>
int main()
int n,temp;cin>>n;
map<int,int> mp;
cin>>temp;
mp[temp]++;
int curr,mx=0;
for(auto pr:mp){
curr = mp.find(pr.first+1)==mp.end()?0:mp[pr.first+1];
mx = max(mx,pr.second+curr);
cout<<mx;
return 0;
printf("void insertionSort(int *p,int n)arr=(int *)malloc(n*sizeof(int));insertionSort(arr,n);");
question
<p>Question description</p><p>In India, the real estate sector is the second-highest employment
generator, after the agriculture sector. </p><p>It is also expected that this sector will incur
more non-resident Indian (NRI) investment, both in the short term and the long
term. </p><p>Bengaluru is expected to be the most favoured property investment
destination for NRIs, followed by Ahmedabad, Pune, Chennai, Goa, Delhi and
Dehradun.</p><p>Ramesh is residing in England. he is willing to invest money in real
estate. </p><p>So he has chosen Bengaluru for good investment.<br>There are N flats for
sale in Bengaluru main city. </p><p>The i-th flat costs Ai rupees to
buy. </p><p>Ramesh has a budget of B rupees to spend.<br><br>What is the maximum
number of flats Ramesh can buy?<br><br>Constraints:<br>1 ≤ T ≤ 100.<br>1 ≤ B ≤ 10^5.<br>1 ≤ Ai ≤
1000, for all i.<br>1 ≤ N ≤ 10^5.<br><br>Input Format:<br>The first line of the input gives the
number of test cases, T. </p><p>T test cases follow. Each test case begins with a single line
containing the two integers N and B. </p><p>The second line contains N integers. The i-th
integer is Ai, the cost of the i-th flat.<br><br>Output Format:<br>Print the output in a separate line
contains the maximum number of flats Ramesh can buy.</p><p> </p>
answer
#include <bits/stdc++.h>
int main()
int t;cin>>t;
while(t--){
int n,tot,now=0;cin>>n>>tot;
std::vector<int>v(n);
cin>>v[i];
sort(v.begin(),v.end());
now+=v[i];
if(now>tot){
cout<<i<<endl;
break;
return 0;
question
<p>Problem Description:<br>Ragu wants to build a string with English alphabet uppercase letters in
sorted order. However, we want the order to be sometimes strictly increasing and sometimes
strictly decreasing.<br><br>The first letter of the string must be A. After that, the string must contain
one or more blocks of letters. The i-th block must contain exactly Li letters. Each letter in the i-th
block must be later in the alphabet than its preceding letter in the string if i is odd and earlier in the
alphabet than its preceding letter if i is even. Notice that for the first letter of a block, its preceding
letter exists, even though it is not in the block. Strings that follow all of these rules are called valid.
There can be multiple valid strings, and we want to find the alphabetically first one.<br><br>For
example, if there are 2 blocks of sizes L1=2 and L2=3, the string must have exactly 1+L1+L2=1+2+3=6
letters (the 1 is for the initial A). The strings XYZYBA, AZYCBA and AYZYBB are not valid for this case
because they violate the required starting letter condition, and the ordering conditions in the first
and second block, respectively. The string AYZYBA is valid. The string ABDCBA is also valid and,
moreover, it is the alphabetically first valid string.<br><br>Given the sizes of the blocks, output the
valid string that comes first in alphabetical order in the list of all valid strings. It can be shown that,
for all inputs within the given limits, at least one valid string
exists.<br><br>Constraints:<br>1≤T≤100.<br>1≤Li≤25, for all i.<br>1≤N≤100.<br><br>Input
Format:<br>The first line of the input gives the number of test cases, T. T test cases follow. Each test
case is described with two lines. The first line of a test case contains a single integer N, the number
of blocks. The second line contains N integers L1,L2,…,LN, the number of letters each block must
have, in order.<br><br>Output Format:<br>Print the output in a separate lines contains, the valid
string that comes first in alphabetical order. It is guaranteed that at least one valid string exists.</p>
answer
#include<bits/stdc++.h>
int t;
cin >> t;
int n, l, c;
string s = "A";
cin >> n;
cin >> l;
if (i % 2) {
c = max(c, l);
s.push_back('A' + c);
s.push_back('A' + j);
} else {
s.push_back('A' + j);
c = l;
if (n % 2) {
s.push_back('A' + c);
return 0;
}
question
answer
#include <bits/stdc++.h>
int main()
int t;cin>>t;
while(t>0){
int n,i,k1,k2,ans=0;
cin>>n;
int arr[n];
for(i=0;i<n;i++) {
cin>>arr[i];
cin>>k1>>k2;
sort(arr,arr+n);
ans+=arr[i];
cout<<ans<<endl;
t--;
return 0;
printf("for(int i=0;i<n-1;i++)");
question
answer
#include <bits/stdc++.h>
#define ar array
void dummy(){}
int n, k, p, a[50][30];
int dp[51][1501];
void solve() {
dp[0][0]=0;
s+=a[i][j];
dp[i+1][l+j+1]=max(dp[i][l]+s, dp[i+1][l+j+1]);
int main() {
int n, i;
cin >> n;
for(i=0;i<n;i++) {
solve();
return 0;
question
<p>Problem Description:<br>Siva has several containers, each with a number of fruits in it. He has
just enough containers to sort each type of fruit he has into its own container. Siva wants to sort the
fruits using his sort method.<br><br>Siva wants to perform some number of swap operations such
that:<br><br>Each container contains only fruits of the same type.<br>No two fruits of the same
type are located in different containers.</p><p><strong>Function
Description</strong></p><p>organizingContainers has the following parameter(s):</p><p><i>int
containter[n][m]</i>: a two dimensional array of integers that represent the number of balls of each
color in each container<br><br>Constraints:<br>1 ≤ q ≤ 10<br>1 ≤ n ≤ 100<br>0 ≤ containers[i][j] ≤
10^9<br><br>Input Format:<br>The first line contains an integer 'q', the number of
queries.<br><br>Each of the next 'q' sets of lines is as follows:<br><br>The first line contains an
integer 'n', the number of containers (rows) and ball types (columns).<br>Each of the next 'n' lines
contains 'n' space-separated integers describing row containers[i].<br><br>Output Format:<br>For
each query, print Possible on a new line if David can satisfy the conditions above for the given
matrix. Otherwise, print Impossible.</p>
answer
#include<bits/stdc++.h>
int x[100][100];
int main(){
int q;
scanf("%d", &q);
while(q--){
int n;
scanf("%d", &n);
vector<ll> a, b;
f(i, 0, n){
ll z = 0;
a.push_back(z);
sort(a.begin(), a.end());
f(j, 0, n){
ll z = 0;
f(i, 0, n)z += x[i][j];
b.push_back(z);
if(0){
sort(b.begin(), b.end());
if (a == b)printf("Possible\n");
else printf("Impossible\n");
question
answer
#include <stdio.h>
int i,j,temp;
for(i=0;i<no-1;i++)
for(j=i+1;j<no;j++)
{
if(arr[i]>arr[j])
temp=arr[i];
arr[i]=arr[j];
arr[j]=temp;
int i,sum=0;
for(i=0;i<no;i++)
if((arr[i]<0)&&(k>=i+1))
sum+=arr[i];
return sum;
int main()
int t;
scanf("%d",&t);
while(t--)
int n,k,i;
scanf("%d %d",&n,&k);
int a[n];
for(i=0;i<n;i++)
scanf("%d",&a[i]);
bubble_sort(a,n);
printf("%d\n",-1*MEGA_SALE(a,n,k));
return 0;
question
</p><p>3 2
</p><p>4 3 1
</p><p>1 5
</p><p>6
</p><p><strong>Sample Output</strong></p><p>1
</p><p>1
</p><p>In first test case :<br>We can cancel invitation of person of height 4 (Cost = 1)<br>In second
Test Case:<br>We can invite person with height 4 (Cost =1)</p>
answer
#include<bits/stdc++.h>
#include<cmath>
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int test;
cin>>test;
while(test--){
int n,s,i;
cin>>n>>s;
int a,more=0,less=0;
for(i=0;i<n;i++){
cin>>a;
if(a>s){
more++;
else{
less++;
cout<<abs(more-less)<<"\n";
return 0;
question
answer
#include<stdio.h>
int main()
int t;
scanf("%d",&t);
while(t-->0) {
int n;
scanf("%d",&n);
min = 9999;
max = -9999;
int x,y,h;
scanf("%d%d%d",&x,&y,&h);
arr[i][0] = y-x;
arr[i][1] = h;
min = y-x;
if(y-x > max)
max = y-x;
int l = min;
int r = max;
int flag = 0;
while(l<= r) {
int topLeftSum = 0;
int buttonRightSum = 0;
int equal = 0;
else
if(buttonRightSum == topLeftSum) {
flag = 1;
break;
buttonRightSum+=equal;
if(buttonRightSum>topLeftSum)
r = mid - 1;
else if(buttonRightSum<topLeftSum)
l = mid + 1;
else {
flag=1;
break;
if(flag)
printf("YES\n");
else
printf("NO\n");
question
answer
#include <bits/stdc++.h>
class sor{
public:
int a[100],b[100];
int n;
void getn(){
cin>>n;
void geta(){
for(int i=0;i<n;i++)
cin>>a[i];
sort(a,a+n);
void getb(){
for(int i=0;i<n;i++)
cin>>b[i];
sort(b,b+n);
void display(){
int sum=0;
for(int i=0;i<n;i++)
sum+=a[i]*b[n-i-1];
cout<<sum<<endl;
};
int main()
{
if(0)
int n;
cin>>n;
while(n--){
/*int a[100],b[100];
int m,sum=0;
cin>>m;
for(int i=0;i<m;i++)
cin>>a[i];
for(int i=0;i<m;i++)
cin>>b[i];
sort(a,a+m);
sort(b,b+m);
for(int i=0;i<m;i++){
sum+=a[i]*b[m-i-1];
cout<<sum<<endl;*/
sor t;
t.getn();
t.geta();
t.getb();
t.display();
return 0;
question
<p>Question description</p><p>Sajid is a First year student in reputed
institution. </p><p>Although he scored well in many subjects, he did not an expert in
Algorithms.</p><p>But Sajid's computer examination is scheduled for next week. </p><p>As
per the blueprint, many questions would come from the Arrays topic.</p><p>He collected previous
year's questions. one of the repeated questions is you need to reverse the array in C Programming
Language.</p><p>Can you help him ?</p><p>Function Description</p><figure class="image"><img
src="data:image/png;base64,/9j/4AAQSkZJRgABAQAAAQABAAD/4gIoSUNDX1BST0ZJTEUAAQEAAAIY
AAAAAAIQAABtbnRyUkdCIFhZWiAAAAAAAAAAAAAAAABhY3NwAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAQAA9tYAAQAAAADTLQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAlkZXNjAAAA8AAAAHRyWFlaAAABZAAAABRnWFlaAAABeAAAAB
RiWFlaAAABjAAAABRyVFJDAAABoAAAAChnVFJDAAABoAAAAChiVFJDAAABoAAAACh3dHB0AAAByAA
AABRjcHJ0AAAB3AAAADxtbHVjAAAAAAAAAAEAAAAMZW5VUwAAAFgAAAAcAHMAUgBHAEIAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFhZWiAAAAAAAABvogAAOPUAAAOQWFlaIAAAAAAAAG
KZAAC3hQAAGNpYWVogAAAAAAAAJKAAAA+EAAC2z3BhcmEAAAAAAAQAAAACZmYAAPKnAAANWQ
AAE9AAAApbAAAAAAAAAABYWVogAAAAAAAA9tYAAQAAAADTLW1sdWMAAAAAAAAAAQAAAAxlbl
VTAAAAIAAAABwARwBvAG8AZwBsAGUAIABJAG4AYwAuACAAMgAwADEANv/bAEMAFxARFBEOFxQS
FBoYFxsiOSUiHx8iRjI1KTlSSFdVUUhQTltmg29bYXxiTlBym3N8h4uSlJJYbaCsn46qg4+Sjf/bAEMBGBoaIh
4iQyUlQ41eUF6NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2Njf/AABEI
Aw4GwAMBIgACEQEDEQH/xAAbAAEAAgMBAQAAAAAAAAAAAAAABAUBAgMGB//EAEcQAAIBAgIGB
wcEAQMDAgUEAwABAgMEBRESFSExUZETFDRBUlNxBjJhcoGhsSIzNeHBI2JzJELRNpIWQ4KDsiUmVPBj
ovH/xAAZAQEBAQEBAQAAAAAAAAAAAAAAAQMCBAX/xAAnEQEAAgIBBAIDAQEBAQEAAAAAAQIDER
ITITJRFDEEQWEiMyNCcf/aAAwDAQACEQMRAD8A9YAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAYe4CPdXtK22S2yfciJrmPkvmcLSnG7xGpK
rtSzeRb9Xo+VD/2nPeWETe/eJV+uF5L5jXC8l8yw6Cj5UOQ6Cj5UORe7rjf2r9cLyXzGuF5L5lh0FHyoch0F
Hyocidzjf2r9cLyXzGuF5L5lh0FHyoch0FHyoch3ON/av1wvJfMa4XkvmWHQUfKhyHQUfKhyHc439q/XC
8l8xrheS+ZYdBR8qHIdBR8qHIdzjf2r9cLyXzGuF5L5lh0FHyoch0FHyoch3ON/av1wvJfMa4XkvmWHQUfK
hyHQUfKhyHc439q/XC8l8xrheS+ZYdBR8qHIdBR8qHIdzjf2r9cLyXzGuF5L5lh0FHyoch0FHyoch3ON/av1
wvJfMa4XkvmWHQUfKhyHQUfKhyHc439q/XC8l8xrheS+ZYdBR8qHIdBR8qHIdzjf2r9cLyXzGuF5L5lh0F
Hyoch0FHyoch3ON/av1wvJfMa4XkvmWHQUfKhyHQUfKhyHc439q/XC8l8xrheS+ZYdBR8qHIdBR8qHId
zjf2r9cLyXzGuF5L5lh0FHyoch0FHyoch3ON/av1wvJfMa4XkvmWHQUfKhyHQUfKhyHc439q/XC8l8xrhe
S+ZYdBR8qHIdBR8qHIdzjf2r9cLyXzGuF5L5lh0FHyoch0FHyoch3ON/av1wvJfMa4XkvmWHQUfKhyHQU
fKhyHc439q/XC8l8xrheS+ZYdBR8qHIdBR8qHIdzjf2r9cLyXzGuF5L5lh0FHyoch0FHyoch3ON/av1wvJfMa
4XkvmWHQUfKhyHQUfKhyHc439q/XC8l8xrheS+ZYdBR8qHIdBR8qHIdzjf2r9cLyXzGuF5L5lh0FHyoch0F
Hyoch3ON/av1wvJfMa4XkvmWHQUfKhyHQUfKhyHc439q/XC8l8xrheS+ZYdBR8qHIdBR8qHIdzjf2r9cL
yXzGuF5L5lh0FHyoch0FHyoch3ON/av1wvJfMa4XkvmWHQUfKhyHQUfKhyHc439q/XC8l8xrheS+ZYdB
R8qHIdBR8qHIdzjf2r9cLyXzGuF5L5lh0FHyoch0FHyoch3ON/av1wvJfMa4XkvmWHQUfKhyHQUfKhyHc
439q/XC8l8xrheS+ZYdBR8qHIdBR8qHIdzjf2r9cLyXzGuF5L5lh0FHyoch0FHyoch3ON/av1wvJfMa4Xkvm
WHQUfKhyHQUfKhyHc439q/XC8l8xrheS+ZYdBR8qHIdBR8qHIdzjf2r9cLyXzGuF5L5lh0FHyoch0FHyoch
3ON/av1wvJfMa4XkvmWHQUfKhyHQUfKhyHc439q/XC8l8xrheS+ZYdBR8qHIdBR8qHIdzjf2r9cLyXzGu
F5L5lh0FHyoch0FHyoch3ON/av1wvJfMa4XkvmWHQUfKhyHQUfKhyHc439q/XC8l8xrheS+ZYdBR8qHI
dBR8qHIdzjf2r9cLyXzGuF5L5lh0FHyoch0FHyoch3ON/av1wvJfMa4XkvmWHQUfKhyHQUfKhyHc439q/
XC8l8xrheS+ZYdBR8qHIdBR8qHIdzjf2r9cLyXzGuF5L5lh0FHyoch0FHyoch3ON/av1wvJfMa4XkvmWHQ
UfKhyHQUfKhyHc439q/XC8l8xrheS+ZYdBR8qHIdBR8qHIdzjf2r9cLyXzGuF5L5lh0FHyoch0FHyoch3ON/
av1wvJfMa4XkvmWHQUfKhyHQUfKhyHc439q/XC8l8xrheS+ZYdBR8qHIdBR8qHIdzjf2r9cLyXzMrGIf91J
r6k/oKPlQ5GtS1oTg4unHJ8EO6ccnttQrQr01Om80dCnwtulfVaOf6UmXBYd0tyjYACuwAAADSpWpUUn
VqRhnu0nkBuDnTr0azapVYTa36LzOgAEa/vqOH23T189DPLYiPhuNWuJ1Z07fT0oR0npLICxAAAAAAAA
AAAAAARr+7hY2dS4mm1BZ5LvKDDfauVzewo1rdRjN5JxeeQHqAAAAKev7S2NvcToT6TTi8nkgLgGtOaq
U4zjuks0bAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD3MB7mEU+FdtqfK/yXBT4V22p8r/J
cEhnh8QBtRTbeSR56/8Aay2t6rp29N1pReTeeSK1ehB5al7ZR00q9pKK/wBrzPS29aNxQhWgmozWazA6
AAAAAAAAAAAAYk8ot8EBkHmMKx+7u8bdpV0Ojzkti27D04AAAAG8lmeYre2EKVadPqrehJrfwA9ODyv
/AMZw/wD4r/8AcTMK9pY4lfQtlQcHJN558FmBfAAAAAABX18asre76tUqNVc8ssgLAAAAR7y9oWNF1b
iajHu4s87W9s4RqZULVyjxlLJgeqBQYf7VWt1UVOtB0ZPc3tRfp5gAAAAAAAAAAAAAAFfjOKLCreNV0+k0
nllmVNH2wp1a0KatmtKSWeYHpgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAA9wDAp7L+Xq/UuCmsv5er9S5JDHD4gAK2AAAPBe1N+7vE3Rg86d
H9Ky733s9hi99Gww6rWb/VllH1e48V7P2jxDGIyqLShF6c/iA9nr6WHYtHT/AExqfomn3f8A9Z9BW7fme
D9qbLqeKurBaMKv6l6956r2fv1f4XTk3/qQWhNfFf0BG9r/AOEf/Ivwyo9ie33H/F/kt/a/+Ef/ACL8MqPYjt
9x/wAX+QPZ7iHVxWxoz0al1SUuGkth572rxmpCr1G3k4pL/Ua7/gVeGez13idLpk1TpvdKW9ge6he2tSi6
0Lim6cd8lJZIxRvrS4noULmlUllnoxmmzw2I4TfYPTbc9KjU/S3F7PqdfZD+b/8Atv8AKA94RrjELS2ejWuKcJ
cHJZlP7UYxOxpRtrd5Vaizcl3I85huDXmL6VSMsoJ7Zze8D3VDErO5ejRuaUpPuUlmSj55ieB3eEpVXJShn7
8e4v8A2Wxipdxla3MtKpBZxlxQF5WvrS3noV7mlTnlnoymkzM7y2hRVWdenGnLdJyWTPFe1z//AFt/8cf
8kWyw/EMXilS/VCmtFOTyigPd1pWl/h9TTqRlbyX6pZ7OZTYXhOD0L6E6N7GvVT/RBzT2/QkRs6th7K1r
eto6cYPPReaPLezf8/a+r/8AxYHrfaO96vhlXoK6hWTWxPaUvsxiteriUo3l03T6N5abyWeaMe1GE3Mbi4x
Byj0MpRyWe3ckU2GYfWxK5dGhKMZKLl+p5bP/AOsD6TTq06ybpVIzS2ZxeZ84xf8Ambj/AJD2fs7hlfDLa
rTuJRlKc9JaLz7jxeM/zFz84HvaV9a2tlR6evTpvQWSlJJ7jrb4haXT0aFxTnLgpLM8TZ4BiGKUVcOSUJe65va
yDd2tzhV30dRuFRbVKL3gfTSLUxKypzcKl3RjJbGnNJo4YFfSxDC6dae2a/TL4tHh8b/mLn5wPoNxf2tsl09x
Thms0nJbRbX1rdPKhXp1HwjLaeJtMBxHFKXWXJJS91ze1lfWpXOFXrhJuFWDzzT3gfSbi6oW0dKvWhTX
+6WRxo4pZV5qNK5pSk9y0lmzxVrYYj7QVZ1nPNJ5OU3s+hFxHDbnCa8Y1slpbYyi94H0oFJ7LYhUvsOca0
tKdJ6OfFF2AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD3MB7mEU+FdtqfK/wAlwU+FdtqfK/yXBIZ4fFFxON
SeG140vfcHkeHwK7s7K8lK/paSayWcc9F+h9BlJRg5SeSSzbZT1sLwjFl0sdFuX/dTeTZWraEsExSKhFUJN7
opKMv/ACS8QqV7XD5ys6anUgv0xyPH47gsMJ0KtvcaSk8lHvRaUscrW3sxSuKi060punFv8gRXU9pqsem
WnFb9HRSfLIl4B7Q1ri6VnfJab2Rllk8+BxsNfYnbq5p3kacG9izKrDVOHtPRjUmpzVX9Ul3sC89qcVvMPuq
ELWt0cZQba0U83n8SBLFcevKKr28JxpRW+ME8/ib+2/bbb/jf5PS4XCMcJoRSWWhuA8vbe1d7G3lRlTV
Wu3lCWX+Ec6+KY9ZuNW4c4Rk9ilBJem45YTTh/wDFVOGitFVJbPoz0ntZFPAqja2qUcuYEnCcSWJYb06
WjNZqS4M8tH2jxSF7Upqp0v6nGMNBcdm4tfY9t4XcL/d/gpMGqUaXtIpV2lHpJLN8duQEqtfe0NnFXFdy
VN784LL67Nh6HBcXji1nOTShVgspRX5OuM16EMJrurKLi4NJZ7zzvsbGTuLmST0Ojy+oEbAF/wDuh/NP/J
fY/j7w6at7aKnXkt7/AO0ocAz/APih/NP/ACcsfjUh7Q1G5aDck4yfcgJ8q/tLSo9am5aGWbWjHd6ZFzgON
rFKcoVIqFeHvJbn8SArLHKlLNYlTlCS8WzI29n8Er2d+7qVanUpuLT0HnmwPSkaVhZyk27Wi297cESQB8+
wSnTqe0MIVIRlByf6Wth7qFpbUJdJToUqbS95RSyPD4D/AOpYfMz29+pSw+4UPedKSXIDzV57QX19eu1
wmOWTy0ss2/j6HKeK45hFWEr9dJTk9zSy5oq8FjdSvZU7W4jQqtb5PLMub3CsVuKPR3d/SlDPdKXeBcX
WOUqODK/pLT0l+mL4lDb3ftDikHXtZ5U88llopfcs6GB6GBTsrytFZy0ozW5FZHBcZw+MnZXMXDf+iW/6
AWmGVsadG6jeRenTg+jbis3LLZ6nk7ypeTxRzuItXOktmXeek9nMcurq+dneZSlk8pd+aKrGnl7USb2LTW
0D0mBVsTrSq6yg4pL9Occi4MKSe5pmQPB+0FxUxDHXbRk9GEujivyz1VhgllZUIw6CFSeX6pTWeb+p5P
GoTw/2jlXkv0ufSL0Pa2l9b3lCNWjUi1JZ5Z7UBDq+z9hUu4XHRaLjvjHYmaY9c4hbU6UcOpaWm8m1HN
om1MTs6VzC3nXiqk9yzKf2kxyvY1oW1pkpyWbk1u9AK64ufaSzp9PWlJQW1/pi8vsXmAY1rS2m6qUatL
3su9cSpurXG5YbUrXN7HonTzlHPesjl7F7bu4i9zgB0ucdxLEMRla4YtDJtLJLN5d+060Je0lC6pQrfqhKWTz
SaX1Rzu/ZyurydfDLqGbk3k3k4keWK4xg93CleVOkT7pbc0B6HHMZhhVBZJSrT92P+Sjhce0l1S61SzVPel
or8Ef2tlKpeUK2TVOdNOJNtLbGq1pTnb4jT6NxWSz3ICZgOPzvaztLyKjXW55ZZnoDyeHYDdxxaN5O5pVJ
QnnPRe3M9YB5j2nxa/sbynTtm4U3HPS0U9J8C/w+rVr2FGpXjo1JQTkviaXl5ZWsoRu6tOLl7qkSYSjOClB
pxazTQGKtGlWjo1acKi4SWZ4LEqcKXtM404qMVVWSislvPoB4HFv/AFRL/lX5A98AAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAHuAe4Cmsv5er9S5
Kay/l6v1LkkMcPiAArYAON5cRtbWpXluhHMDyXtjf9LcwtIS/TT2yy4lbhONVMKjPoqMJynvcjjQpVcUxaK
km5VqmcvTez38MKsYwUerU3kss8gPE4rjlTFaMYVaMIuMs009pI9k7/AKriPQTeUK+z69x694XYuLXVqe
34HgcStamHYpUhDNaE9KDXNAet9r/4R/8AIvwyo9ie33H/ABf5JmN3av8A2Wp10trnHNcHkyH7ErK+u
M0/2v8AIFd7SQlDHbhy3SakvTI9j7P3NG4wi3jSks6cFGS700csewSGKUlOm1CvDdLiuDPKvB8YtKjVKhW
9aeeQHpfay5o08JnRk06k2so9/qUHsf8Azf8A9uX5RwucHvqdlO8vpSgo5JKbzbJPscm8ab4UpflAY9r1JYy
29zgsuR6T2XnTlglFQyzWallxNPaHBnidBTotKvT3Z964HkqNxiODVnCOnSb3xa2MD2ntFKnHBLjTy2pJfF
5o8n7JqTxym490ZZ8jhcXeJYxUjTm51X3Qith6r2dwV4bSlVr5OvU7vCuAHn/a/wDnJf8AHH/J6X2XgoYH
RyWWebfx2s837Xxbxt5J/tx/yen9m01gdvn8fyB2xn+Huv8AjZ4j2b/n7X1f/wCLPcYz/EXX/GzxHs3F6/tdj
3v/APFger9q/wCCq/NH8nn/AGM/mZ/8Mvyj1mL2bv8ADatCL/VJfp9e48DSneYRe6cYyp1Y7Mmt6A+ln
zXF9uM3H/Ieq9msWusQqV43Szy2xaWSXwPLYtFvGbjY/wBwD6DYRULChFblTS+x5b227Vbv/Z/lnq7Ps
dH5F+Dyvtsm7m3yT9z/ACBY+x38Q/8AkZ5XG/5i5+dnqvY5NYRLNf8AzGeWxuL1xc7H77A9/h8VHD6CS
2aCPH+2SyxWPyI9lYdhofIjx3tkm8Vjkn7iAv8A2UilglNpbW22QPbZf9Nbv/cyw9lllglLPi/yQfbVN2tDJZ/q
A5+xP7Vx8x6o8r7EpqlcZrvPVAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA9zAe5hFPhXbanyv8AJcFPhXban
yv8lwSGeHxcrqgrq1qUJScVNZNrejys/ZK8oTbs7tJd21pnrwVq8jS9krutVUr26Tj35Ntl3eYLb3OFxsoLo4w
2wfBlmAPJ0PZvFKCdKniCp0XvUZNHSz9lq1pitO5jXpypQnpZPPSaPUACi9oMCr4tXpVKNWnBQi4tSz4lta
UHQs6dGUk3COTaO4A85ZezlxbY2r6Vak4KblorPPaWmNWM8Rw6dtTlGMpNPOW7YyeAKjA8Lq4VY1
qVWpCbk8845nkLKxWI41O2lNx0pTya4rNn0WSzi1xRTWHs7SssS65GtKUs28nu2/8A/QKl+yd9Umo1by
Eqa3ZtvI9FhuGUcNtHRo7W/ek+9k4Aecw32euLLF+uTrU5Rzk9FZ57SfjGCUMVgnJ6FWO6a/yWgA8evZ
XEof6cL2Kp8NKWXIv8GwrVds6bqyqOTze3YvQsQAAAHmsN9m7izxaN3OtSlBNvJZ5npQAPOYn7Kwua
7r2dVUZSebi92ZEp+yt9VqR61epwi+5tv6HrgBW4hhTvMMjZxryjo5fqe3PLiUi9m8Wpro6eIJQ4Kckj1oA
pcF9n4YZUdapU6Ws1ln3I5457O6xrK4oVFTq5ZPPcy+AFHgeE31hXnUurpVYyjoqObeXMvAAIOKYVb4p
RUK6ykvdmt6PNz9kr2lUbt7mGj6tM9kAPLWHsloVlVvaynk89GGe31ZPxzAI4o41KU1TqwWW3c0XQA8
tH2cxKtT6K7xDSpJbIKTaZLwLAa+F1q06laElOOitDPNF8APK1vZi+hcTq2l/o6Tbbbaeb9DNv7KV6lwquI3X
Spdybbf1Z6kAQcSwq3xG1VCpHR0fdkv8AtPPP2Uv6Lat72Kg+7No9eAKbA8ElhbnOpXdSc1k0nsLkADz+
Pez1XFLuFelWjFqOi1LgXNjbdUs6VvpaXRxUc+J3AA81e+zdxc4w7yNakoOalk88956UAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA9wD3AU1l/L
1fqXJTWX8vV+pckhjh8QAFbA3gAY0UtyRkAAYaT3pGQBjJZZZLIJJbkkZAHn/ai9vbWFFWkZxjnpSqR/BU0
vbC8hHKrRhUa79x7WUVKLUkmn3MiVMKsass52tLP4RyA8PieNXeL5UpRygnmoRWeZ6P2UwmpZUJ3F
xHRqVdii96RcUMPtLd50renF8dHaSQBrKEZrKUU/VGwA1jThBZRil6I2AAw4p70jOSW4AAY0Uu5GQANZ
U4T96KfqjYAaxiorKKSXwM6K4IyABhpPekzIAwkluQ0VwRkADDSe9IyAC2bjDSe9ZmQBhJLcsjIAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAPcwHuYRT4V22p8r/JcFPhXbanyv8lwSGeHxAAVqAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAHuAe4Cmsv5er9S5Kay/l6v1LkkMcP
iAArYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAA9zAe5hFPhXbanyv8AJcFPhXbanyv8lwSGeHxAAVqAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAHuAe4Cmsv5er9S5Kay/l6v1LkkMcPiAArYANZzUIuUnkkEb
EavfUaLycs5cEQLu/nUbjTzjD8kFsm3lyfka7VWM8Vm/cgl6nLWNf8A28iGZJt55y3n9pesa/FchrGvxXIiAb
TqW9pesa/FchrGvxXIiAbOpb2l6xr8VyGsa/FciIBs6lvaXrGvxXIaxr8VyIgGzqW9pesa/FchrGvxXIiAbOpb2l
6xr8VyGsa/FciIBs6lvaXrGvxXIaxr8VyIgGzqW9pesa/FchrGvxXIiAbOpb2l6xr8VyGsa/FciIBs6lvaXrGvxXIa
xr8VyIgGzqW9pesa/FchrGvxXIiAbOpb2l6xr8VyGsa/FciIBs6lvaXrGvxXIaxr8VyIgGzqW9pesa/FchrGvxXIi
AbOpb2l6xr8VyGsa/FciIBs6lvaXrGvxXIaxr8VyIgGzqW9pesa/FchrGvxXIiAbOpb2l6xr8VyGsa/FciIBs6lva
XrGvxXIaxr8VyIgGzqW9pesa/FchrGvxXIiAbOpb2l6xr8VyGsa/FciIBs6lvaXrGvxXIaxr8VyIgGzqW9pesa/F
chrGvxXIiAbOpb2l6xr8VyGsa/FciIBs6lvaXrGvxXIaxr8VyIgGzqW9pesa/FchrGvxXIiAbOpb2l6xr8VyGsa/F
ciIBs6lvaXrGvxXIaxr8VyIgGzqW9pesa/FchrGvxXIiAbOpb2l6xr8VyGsa/FciIBs6lvaXrGvxXIaxr8VyIgGzqW
9pesa/FchrGvxXIiAbOpb2l6xr8VyGsa/FciIBs6lvaXrGvxXIaxr8VyIgGzqW9pesa/FchrGvxXIiAbOpb2l6xr8
VyGsa/FciIBs6lvaXrGvxXIaxr8VyIgGzqW9pesa/FchrGvxXIiAbOpb2l6xr8VyGsa/FciIBs6lvaXrGvxXIaxr8V
yIgGzqW9pesa/FchrGvxXIiAbOpb2l6xr8VyGsa/FciIBs6lvaXrGvxXIaxr8VyIgGzqW9pesa/FchrGvxXIiAbX
qW9pqxOut6i/odqeKp7KkMviisA2sZrx+3oaVenWjnCSZ0POQqSpyUoNprgWtlfKslCpsnx4lerHni3aU4A
FegAAAAAAAAD3MB7mEU+FdtqfK/yXBT4V22p8r/JcEhnh8QxKShFyk8kjJDxNtWry4ld2njG2HidBPZpP
6DWdD/dyKcE28PyLrjWdD/dyGs6H+7kU4Gz5F1xrOh/u5DWdD/dyKcDZ8i641nQ/3chrOh/u5FOBs+Rd
cazof7uRtTxGhOSjm1nxRSgbWPyLvSrdsBzoNuhBvgbvcyvdvttHrX1GjPRk22t+Rz1pQ4S5FTVbdWbfiZq
TbxT+RffZca0ocJchrShwlyKcDbn5F1xrShwlyGtKHCXIpwNnyLrjWlDhLkNaUOEuRTgbPkXXGtKH+7kNaU
P93IpwNnyLvRUqsK0FKDzRuVuEN6NRFkV7MduVdy0q1YUoOc3kkRdZ0P8AdyOeLvKlBd2ZVkYZc1q21
C41nQ/3chrOh/u5FOBtl8i641nQ/wB3Iazof7uRTgbPkXXGs6H+7kNZ0P8AdyKcDZ8i641nQ/3chrOh/u5F
OBs+RdeUr+jVkoptN7sySecg8qkWt+Z6KPur0EPRhyTf7ZItTEKNObi221wJFV5Upv4M8483JtlM2Saa0u
NZ0eEuQ1nR4S5FOCMPkXXGs6PCXIazo8JcinA2fIuuNZ0eEuQ1nR4S5FOBs+Rdcazo8JchrOjwlyKcA+Rd
cazo8JciXCcakFKLzTPOFvhTztn8JFa4strW1Kcca91St8uke17kjsUuItu7l8Eg1y3mldwm6zof7uQ1nQ/3ci
oME28nyLrjWdD/AHchrOh/u5FOBs+Rdcazof7uQ1nQ/wB3IpwNnyLrjWdD/dyGs6H+7kU4Gz5F1xrOh/
u5HehdU6+eg9q7igJeGtq8iuKYd0z2m0RK6ABXtAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAA9wD3AU1l/L1fqXJTWX8vV+pckhjh8QAFbBT3906tTQg/0L7k6/rdFQeXvS2IpSS8n5GT/
5hgAEeNgyAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAm0008mAUX
NhddPT0ZP9cfuTDz9tVdGtGa47S/i1KKa3MsPoYb8q92QAVuAAAAAAe5gPcwinwrttT5X+S4KfCu21Plf5
LgkM8PiELFOyv1RNIWKdlfqirk8JU4AOXzAA2hCVSSjBZt9wGoO/Urjy2aVaFSll0kXHPdmFmsx9w5gAOQ
ABXobf8AYh6G8vdZpQ/Yh6G8vdZ0+rHi89V/cl6s0Nqn7kvVmpy+XP2AAIA607WtUWcaby4m8rKvFZuG
a+Ad8LekcBpp5MBwAACzwjdULIrcI3VCyLH0+jh8IV2Mftw9SrLTGP24epVkl5M/nIAAxAdYW1apHSjBt
M26lceUw6429OAO/U7hf/LZxlFxk4vet4SazH2wAAjMPfj6no4+6vQ85D34+p6OPur0LD1/jftrW/Zn8rPP
Hoa37M/lZ54H5P3DAAI8gAAAO0bSvKKkqbyZylFxk4vegsxMfbAACBb4V2eXzFQW+E9nl8xYb4PNOKTE
e1y+hdlJiPa5fQS9H5HgigAjwAB1p21WrHSpwclxCxEz9OQO/Urjy2Yna14RcpU2kt4Xjb04gAOQl4b22Po
yISsN7bH0Yd4/OF2ACvqAAKAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAHuAe4
Cmsv5er9S5Kay/l6v1LkkMcPiAArZUYrPOtGOe5EEk4i872fwy/BGI+ZlndpAARmAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABeWE9O1ht2rYUZb4V2d/MWHo/Hn/ScACve
AAAAAAe5gPcwinwrttT5X+S4KfCu21Plf5LgkM8PiELFOyv1RNIWKdlfqirk8JU4AOXzA6W9Toaym1nl3H
MAidTtdWt4rmbioNZLM4Yvup+rOeE/vz+U6Yvup+rK9k2m2LcqwAEeIAAV6Gh+xD0N5e6zSh+xD0N5e
6zp9WPF52p+5L1ZqbVf3JerNTl8ufsOttOFOspVI6UUcgCJ1O1pVxOMdlGOfxYtsRdWqoTglnuyKsm4dbS
lUVWWyK3fFlb0yXtbs6YpSitGpHY28mVxYYpWUpKnHbltZXkcZpjnOgABks8I3VCyK3CN1Qsiw+jh8IV2L
/tw9SrLTF/24epVkl5M/nIAAxTrfEI0aMabg3kSaF/01VQhSb/wVBdWNGNOgpLfLaw9WG97TrbtWrQo0
3KfIoak9OpKXieZZ31rVrPSjLNL/tKprJtPZkEz2tM60yYADzNoe+vU9FH3V6HnYe+vU9FH3V6Fh6/xv21rfs
z+Vnnj0Nb9mfys88D8n7hgAEeQJdha9NPTkv0R+5woUZV6qhH6lzJwtLfgktnxZW+LHv8A1P05X1yqNLQ
h7z+xT795LoUnfVakpSyaOd3bdXmo555oGTlf/X6cAARgFthPZ5fMVJbYT2eXzFhv+P5p5SYj2uX0LspMR
7XL6CXo/I8UUAEeALrDllax+O0pS8s9lpT+Ur0fj+ThPE4xqSjoN5PLecq+IRq0ZQUGs1kSJ4dQlJyblm3nsZF
ucPlSi503pRXd3h3fqxEoIAI8gSsM7ZH0ZFJWGdsj6MO8fnC7ABX1AAFAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAD3APcBTWX8vV+pclNZfy9X6lySGOHxAAVso8Q7bU+n4IxJxDttT6fgj
EfLyeUgAI4AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAt8K7PL5i
oLfCv2JfMWG+DzTgAV9AAAAAAA9zAe5gU+FdtqfK/wAlwU+FdtqfK/yXBIZYfEIWKdlfqiaQsU7K/VFXJ4S
pwAcvmAACJ+E/vz+U6Yvup+rOOGThCtJzkorR72dMUqQqKnoTjLLPc8yvXEx0VcACPIAAK9DQ/Yh6G8v
dZpQ/Yh6G8vdZ0+rHi87V/cl6s1Nqv7kvVmpy+XP2AHW1jCVeKqNKPfmwRG5072dk6rU57IfkkXd5GjD
oqO/dmu4kqtQ0culhl8xx6KxbzcoZ/OV7OHGuqyqG23m9rBZXNO0jQk6Tjpd2UsytI8t6TWQABws8I3VC
yK3CN1Qsiw+jh8IV2L/tw9SrLTF/24epVkl5M/nIAAxbaE9DT0Xo7szZXFWKSjOS+pY2t1b9DGm2o5LbpH
dRtX+r/T+weiuLcbiSzqTqW6dTeVl+kruWj6ljXvaVCH6WpPuSKepUdWpKct7ZXWa0cYjbUAEeVmH7kfU
9HH3V6HnIfuR9T0cfdXoWHr/G/bWt+zP5WeePQ1v2Z/Kzzwk/J+4YABHkW2GxhGhpbE29pIq06VbJVG
nl8Si0pJZKTS9Rpy8UuZXprmiK60vqNClSbdJLbvMVqFGq06iTaIOG1oxU+kqJcNJmuJVVKrHo55rL/tYa9S
vT3pDqpRqzS3JvI1D2gjxBbYT2eXzf+CpLbCezy+b/AMFhtg808pMR7XL6F2UmI9rl9BL0fkeKKACPAHZut
Tits0sthzhoqcXJZpPai4hcW9WCTlH0kGuOvL96VULmupfpqSbLyLcqSclvW05qNtF6S6NfHYR7u/hGDhS
ecn3or01jpxM2lW1ElUko7szUZ5gjw/tglYb2yPoyKSsN7ZH0Yh3j84XYAK+oAAoAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAe4B7gKay/l6v1LkprL+Xq/UuSQxw+IACtlHiHban0/BFJWIdt
qfT8EYj5WTykABHIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFvh
XZ5fMVBb4V2eXzFhvg804AFfQAAAAAAPcwYe5gVGFdtqfK/wAlwU+FdtqfK/yXBIZYfEIWKdlfqiaQsU7K
/VFXJ4SpwAcvmAACAACgAAAAD0ND9iHoby91mlD9mHoby91nT6seLztX9yXqzU2qfuS9WanL5c/YAAg
ACAACgAALPCN1QsitwjdMsiw+jh8IV2L/ALcPUqy0xf8Abh6lWSXkz+cgADEM5vizAIAAAAAozD9yPqejj7
q9DzkP3I+p6OPur0LD1/jftrW/Zn8rPPHoa37M/lZ54H5P3DAAI8gAAAAAAAAW2E9nl83/AIKktsJ7NL5v/
BYb4PNPKTEe1y+hdlJiPa5fQS9H5HiigAjwAAAZviwAFAAECVhvbI+jIpKwztkfRh3j84XYAK+oAAoAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAe4B7gKay/l6v1LkprL+Xq/UuSQxw+IACtlHi
Hban0/BGJOIdtqfT8EUj5WTylkAEcgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAW+Fdnl8xUFvhXZ5fMWG+DzTgAV9AAAAAADD3MyYe5gVGFdtqfK/yXBT4V22p8r/JcEhl
h8Qi4hTlUtWorNraSgV3aOUaeayB6GVClJ5uEW/Qx1aj5ceRNPJ8afbz4PQdWo+XHkOrUfLjyGj40+3nw
eg6tR8uPIdWo+XHkNHxp9vPg9B1aj5ceQ6tR8uPIaPjT7efMxi5tRis2y/6tR8uPI2hSpw92CXohoj8afZSjo
0orgjZ7mZBXs1208/cU5U68lJZbTkeinThP3op+qNerUfLjyJp5J/GmZ7S8+D0HVqPlx5Dq1Hy48hpPjT7ef
B6Dq1Hyo8h1aj5UeQ0fGn28+D0HVqPlR5Dq1Hyo8ho+NPt58HoOrUfKjyHVqPlx5DS/Gn2iYVTlGnKUlk
m9hYGEklklkZK9VK8Y0g4rTlOjFxWai82VB6U5O3pP/5ceRGOTDzncS8+D0HVqPlx5Dq1Hy48hpl8afbz4
PQdWo+XHkOrUfLjyGj40+3nweg6tR8uPIdWo+XHkNHxp9vPmS/6tR8uPIdWo+XHkNHxp9qKjCVStGM
Vm2z0MVlFL4GsKUKfuRS9Ebhvix8Ia1FpU5Jd6aPPThKE3GSyaZ6M0nShP3op+qKZcXUedB6Dq1Hy48h
1aj5ceRGHxp9vPg9B1aj5ceQ6tR8uPIHxp9vPg9B1aj5ceQ6tR8uPIHxp9vPg9B1aj5ceQ6tR8uPIHxp9vPlz
htOVO2/UstJ5ndW9JPNU45+h1DXFh4TuQpsTpyjcObX6XuZcmJRjJZSSa+JWmSnONPNg9B1aj5ceQ6tR
8uPImnn+NPt58HoOrUfLjyHVqPlx5DR8afbz4PQdWo+XHkOrUfLjyGj40+3nweg6tR8uPIdWo+XHkNHxp
9vPk3C6cnc6eWyK3ln1aj5ceR0jFRWUUkvgNOqfj8bbmWQAV6gAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAPcA9wFNZfy9X6lyU1l/L1fqXJIY4fEABWyjxDttT6fgjEnEO21Pp+CKR8rJ5
SyACOQAAAAAAAAAADaEJTeUIuT+CNS7t6cLe1TS7s2+IaY8fOVZ1Kvv6NnKdKpT9+Dj6omvFJqXuLL1NL
q+Veioxi0+8rua49dpQgW2HW8qcZSml+rLI5XlnUnVlOOWjkROlPHkrgb06NSrNxhHNolrC6rW2Ucw4rjt
b6hBB3r2lWgs5rNcUaUKMq9TQjlnlntCcZidOYJTw+spqKyeazzNqdjUVxo/peWTYddO3pDBd3dB1aDjTS
0mVFahKhJRnlnlnsC5Mc0cwAGQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFvhXZ5fMVBb4V2eXzFhvg804AFfQ
AAAAAAw9zMmHuYFRhXbanyv8AJcFPhXbanyv8lwSGWHxAAVqAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAABrKcY5aUks9izZseJ9sK9RYnCCm1GMFkkwPbAh4ROVXCrac3nJw2smAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAA9wD3AU1l/L1fqXJTWX8vV+pckhjh8QAFbKPEO21Pp+CMScQ7bU+n4IxHysnlIACOQAAAAA
AAAAACztcQgqahW2ZbMysJ2rZSoxlGX6stqYbYuUTuqW7e0uNyjn/tIl3YdFFzpvOK3rgaww+5jJZNR+KZ
YXMujs5KbWejl6srfXOJ5Rpxw2tUqxlGbz0csjlfXVWnXlTjL9OXAYTJadRd7yM3tnVq3DnBJrIQ53a2KNIdr
VqU62dJaTfcTEsQctLd8NhnC4xXSZr9SYuutuu1Tb0e7IJSsxTaXKMqls1UWTa2lZhvbfoy0gpRtsqjzlltZWY
d236MO7+VU69uerxSiv1MgU7ys7hPNZyyT2HbFvfgQYPRqRfBhllvbmub2rOlbucHkymq1p1paVRptbN
xc3VN17Zxp7W9xUVredBpVFtfAOvyOUz/AByABHlAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAt8K7PL5ioLfCuzy
+YsN8HmnAAr6AAAAAAGHuZkw9zAqMK7bU+V/kuCnwrttT5X+S4JDLD4gAK1AAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAABnhfbH+XXyI90zwvtj/Lr5EB6zBP4a1+QnEHBP4a1+QnAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAA9wD3AU1l/L1fqXJTWX8vV+pckhjh8QAFbKPEO21Pp+CKSsQ7bU+n4IxHysnlIACOQAAAAAAA
AAADvSvK1JJRlmuD2nABYmY+kx4lWy2ZL6EerXqVnnUln8DmA6m9p7TLaE5U5aUHlJErWVxllnH1yIYC
Re1fqXSNapCppxllI7vErhrLOOfHIiAEXtH1KTG/rqOjpJr4o40q06NTThln8TQA5Wn9ute4qXDTqZbOBzM
GQkzM95SKV7WpR0YtNfFHOvcVLjLpGtnBHMBZvaY1tgyAHLAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAW+Fd
nl8xUFvhXZ5fMWG+DzTgAV9AAAAAADD3MyYe5gVGFdtqfK/wAlwU+FdtqfK/yXBIZYfEABWoAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAM8L7Y/wAuvkR7pnhfbH+XXyID1mCfw1r8hOIOCfw1r8h
OAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAB7gHuAprL+Xq/UuSmsv5er9S5JDHD4gAK2UeIdtqfT8EUlYh22p9PwRiPlZ
PKQAEcgAAAAAAAAAAAEilZ1a1PTilkFiJn6RwZknGTi96MBAAAAAAAAAyYMgADZU5yWcYSa+CBrbUDc
9oAwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAFvhXZ5fMVBb4V2eXzFhvg804AFfQAAAAAAw9zMmHuYFRhXb
anyv8lwU+FdtqfK/yXBIZYfEABWoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAM8L7Y/y6+RH
p8fq3lHDpVbF5Tg85bM3keCvL2vfVuluJ6c8ss8sgPoWCfw1r8hOPDYFiWJ1rqha0amdKO9aOxI9yAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAD3APcBTWX8vV+pclNZfy9X6lySGOHxAAVso8Q7bU+n4IxJxDttT6fgikfKyeUsgAjk
AAAAAAAAAAAusP7HEpS6w/saLD0YPJVyh0l24cZZEqeFyWWjPPP4biPT7evnLO+rSo27cd72JkWlazEzZ
F1Xs/c2+hDuKMqFTRn9Gd7O6qu5hGcnJSfeSMWinShLvzKTWtqcq/pHtrHrFLT08tuWWR0hhknm5zy4
LIkYZ2T6kK7uqrrzSk4qLySQXjStItMNq+HVKacoPSSI1Cl01ZU88sy0w+tKtRantcXlmRoQVPFNFbm8yJale
0x9S5Xdp1ZRelnmc7aj09VQzy2bybi3u0/Uj4Yv+rXow5mkRl4sXFn0NWEFLPT+BZ2tB0KOg3n8SHircZ02
nk0SbCc52qlN6T4srakVreYQrqxlTjKo5p7c8siEd69epKcoynJrPdmcCPLkmOXYB2tqKr1tBvLZnmTHhcfNf
ILXHa0bhEs406lbRq5JZcSTVwx76Mk1wZCnBxqSis3kyXa0rxNOLcY/7g6pET/mYRalCpSf64tfE5l9KcYU/9
acd20opNaTy3Zgy44prUsE6OHOVHTU821mlkQe9F9CWhaKXCOYXDSLb2gwwttfqqZP4I4XNnO3Wlnp
R4mOuVnVUtNpZ7i0r/wCpYyb745ldRWl6zr9KMAEeYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAC3wrs8vmKgt8K7PL5iw3weacACvoAA
AAAAYe5mTD3MCowrttT5X+S4KfCu21Plf5LgkMsPiAArUBjNcRmuIRkGM1xGa4g3DIMZriM1xBuGQYz
XEZriDcMgxmuIzXEDIACgBjNcUBkGM1xQzXFBNsgxmuKGa4oDIMZrihmuKBtkGM1xQzXEG2QN4CgBj
NcQMgxmuI0lxCbGlKLUlmnvR4jHsArULzpLOlKdGq80or3XwPb5riM1xBtV4BhMMMs1pLOvPbN/4LUx
muI0lxBtkGNJcRpLiDbIMZriZCgAzSAAxpLiNJcQm4ZBjSXEaS4g3DIMaS4jSXEG4ZBjSXEaS4g3DIMaS4m
QbAAFAYzXFDSXFBNsgxpLihpLigbhkGNJcUNJcUDcMgxpLihpLigbhkGNJcUZzQNgACgAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAe4B7gKay/l6v1LkprL+Xq/UuSQxw+IACtlHiHban0/
BGJOIdtqfT8EUj5WTylkAEcgAAAAAAAAAAF1h/Y4lKdYXNanHRhUaXArXFeKTuW9Pt6+cnYp2depVqclP
TT/VnnmbVLirVjozm5L4kIyRFZj22s+10/Un4r+xD1KuMnCSlF5Nbmb1K9Wqkqk3JfEpXJEUmq0wzsn1O
dfD+lqudOaSk9qfE6YZ2T6sgVLirSuKihNpaT2BvM1jHHKFlRpU7Oi85fFsrYXCd8qz3Z/Y5VK9Wr782zmG
V8sTqI+oXd1QV1SilJJ70zS0slbzcnLOTWSKync1aayhNpB3FZz0uklnxDvrU3ymO6Zi2elTO2GTTttHPanuK
upVqVWnUm5ZbszEKkqcs4SafwDiMsRk5JlzYTi6lVSTW/Ignad3WnHRlUbRxIzvNZn/LMZOLzi2nxRt01Xz
J/+5mgDmJmHe1rxoVnOacszrVxGrPNQygvgQwHUZJiNQzKcpvOUm38TAAcneXmf/Qv5CjOvWa2hodI
9HLLINMd4ptyZdz/AI//AO3/AIKQ6u5rOGh0j0cssgY8kV3/AFx7zIAZAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAW+Fdnl8xUFvhXZ5fMW
G+DzTgAV9AAAAAADD3MyYe5gVGFdtqfK/wAlwU+FdtqfK/yXBIZYfEOdebp0ZSXcjocbzss/Qru3jKklWq
Sk5OctvxMdLU8cuZoDl8zlLfpanjlzHS1PHLmaAJylv0tTxy5jpanjlzNADlLfpanjlzHS1PHLmaAHKW/S1PHL
mFWqJpqpLNfE0ANyv7So6tvGUt7R2IuHdkgSjp9Ok7rCnxC4m7iUIycVHg8iJ0k/HLmdb7tlT1OBHz8lp5S
26Sp45cx0lTxy5moI43LbpKnjlzHSVPHLmagG5bdJPxy5jpKnjlzNQDctukqeOXMdJU8cuZqAblZYZcTlN05
yb71mWZT4X2n6FwdQ+hgndHC9qujbSnHf3FI61RvN1Jcy3xPscvVFKR5/yJnk36Wp45cx0tTxy5mgI8+5
b9LU8cuY6Wp45czQA3LfpanjlzHS1PHLmaAG5b9LU8cuY6Wp45czQA3LpCvVhLNTlmviX1GenSjLijzpf2
nZoehYer8aZmZdnuKO7uak68v1NJPJJMvHuPO1v3p/MxLv8iZiIY6Wp45cx0tTxy5moI8W5bdLU8yXMd
LU8cuZqAblt0tTxy5jpanjlzNQDctulqeOXMdLU8cuZqAblt0tTxy5lphledWEoTebjtTKkscI9+r6IsNsNp5wt
EV+KV509GEHlntbRYFVi/7sPQr1Zp1RB6Wp45czPSVPHLmaA5fP3LfpKnjlzMdLU8cuZqAblt0k/HLmOlq
eOXM1BTctulqeOXMdLU8cuZqAblv0lTxy5neyuKkLiMXJtSeTTZFOlt2qn8yDqlp5Q9CgECvqAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAe4B7gKay/l6v1LkprL+Xq/UuSQxw+IACtlHi
Hban0/BGJOIdtqfT8EYj5WTykABHIAAAAAAAAAAAAAAAAAAOkK1WEdGE2l8GaNtttvNswjINywAwAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAC3wrs8vmKgt8K7PL5iw3weacACvoAAAAAAYe5mTD3MCo
wrttT5X+S4KfCu21Plf5LgkMsPiHG87LP0OxxvOyz9Cur+MqAAHL5gAdbaCqXEIyWabBEbnTkC86pbxW2
CRr1e18MeZW/x59qUEq/hCFZKmkll3EYjC0cZ0wAAi7w7skCURcO7JAlFfUx+MKK+7ZU9SOSL7tlT1I5Hz
b+UgADkALKzsoqi6ldLbuT7kHdKTeeytB1uJ05VH0UUoLd8TkHMxqQABE3C+0/QuCnwvtP0LgsPofj+CJi
XY5eqKQu8S7HL1RSB5/yfJkAEecBPsKNGpSbqpN595L6ta+GPMNq4ZtG9qUF51O38tFVeRhC5lGmkorg
C+KaRuXAABiF/admh6FAX9p2aHoWHq/G+5dnuPO1v3p/Mz0T3Hna370/mYl3+T9Q0ABHiAdLei69VQj
s4ltTsqFKP6lpNd7DWmKbqUF51e3qLLRi18CuvbToGpQecH9irfDNY2iAyCMWCxwj36voiuLHCPfq+iLDX
B5wtCqxf92HoWpVYv8Auw9CvX+R4K8GDJy+eAEzD6dKpKSqxT2bMw6rXlOkMF2rS2lugmVl9TjTuXGC
yWS2BpfDNI2jgAMQ6W3aqfzI5nS27VT+ZFdV+4ehW4BbgV9UAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAD3APcBTWX8vV+pclNZfy9X6lySGOHxAAVso8Q7bU+n4IpKxDttT6fgjEfK
yeUgAI5AAAAAAAAAAAJdCxnWpdIpJIiFzh/Y4hthrFp1KonHQm4vuZqdnBVLzQe5yyJ0sLi8tGbW3bmH
MY7W3pVgttW0cslKWZAureVvUye1PcylsVqxuXAyTrOyp16OnJtPPLYdY4bTjm6k36BYw2mNqwFjXw1
KLlSbfwZDt6Sq3CpyzWY05nHaJ1LkCXe2sLaMXFt5vvOVpSjXrqEm8ss9hCaTFuLidIW1apHShBtEi5tIUq1
OEW8pb8yxt6KoUtBNtcStaYZmZiVE002mtqBPu7KFOnKopvPgV5GV6TWdMgwA4Ad7R0o1v9bLRay2k
ydhSqrSoTSz+OaDSuObRuFYZO9WzrUt8c1xRHDiazH2yYBNtrB1YqdRuMfyFrWbTqEIFrq+3lsjUefwZBu
badtPJ7U9zK6titWNpVrZUq1upyzzIE4qM5RXcy3sOxoqqkZTryjFZtyDvJWIrXTmCyp4bGMFKtP6cDM8O
pyhnRlt9Q56NlYDoqeVdU57P1ZMsJYZDJaMmn35hK47W+lWC11ZScdkpZ8TlHDJdI9Kf6F3oOujdXgtnh
tJx/TJp8Sur0ZUKrhL6PiHNsdqxuXIEu1sZV1pyejD8knV9B/pU3peoWMVpjarBIurWVtLPPOL7ztZ2UK9D
Tk5J5tbCJGO024oILSGGU1npzb4JGlxhujBypNvLuZdOujfW1ek5NJb3uOlS2q0oaU4NI72FtGtLTcmnBrYi
yuaCuKWg5aKzz2BaYeVdqEEi4tujuFSptyzJcMNpxhnVntDiMVpnSsBZzsKDg3Cpu+JWPfvzIl6TX7ACdbY
e6kVOo3FPu7wlaTb6QQWrw2i09GTz9SFcWs6E0pbU9zK7titWNlpau5m1nlFb2Tallbwi85PNLid7S3VvB
5SctLbtI95aR/wBSvpvPLPIN4x8ab13VfewDrbUOnqqGko7MyPJEbnUOQLVYdQWxzbfqcbnDujg50m2lv
TK1nDaI2gA7WlJV66hLNInSwuOmtGTUe8Oa47WjcKsEy4tYU7qnSi3lLLPmd5YZBpaEmuOYWMVp3pW
AmXtrC3jHRbbbyeZ2pYdT0FOpUzT4EIxW3pWgtJYbSlH/AE5tEJ0OiuVTrbFnvBbFav24An3djGjR6Snm8t
+ZCpwdSpGC3t5Bzak1nUtQT7uzpW9HSzek9xABas1nUgADgAAAAAAAAAAAAAAAAAAAt8K7PL5ioLfC
uzy+YsN8HmnAAr6AAAAAAGHuZkw9zAqMK7bU+V/kuCnwrttT5X+S4JDLD4hxvOyz9Dscbzss/Qrq/jKg
ABy+YEmwWd3D4bSMdbat1etp5Z7A6pOrRMrS/pTrUVGms3mVs7SvBZuDy+DJetf/APGyTbXkLluKTUl
3Mr02imSfvupHmt4LDE6Ci41YpLPYyvDzXrxnQACOF3h3ZIEoi4d2SBKK+pj8YUV92yp6kckX3bKnqRyPm
38pADrbUXcVlBbu8JEbnUO9hadLU6SfuR+51xC5zfQUvrkS6kJU7fQoRWeWS+BApWNdVoyklvze0r1T
Wa14xCJKnOKzlFpfE1Lq/oTrUVGmtqZUVaM6M9Ge8jHJjmk/xoAAyTML7T9C5KbC+0/QuSw9/wCP4Im
J9jl6opS6xPscvVFKGH5PkAAjzhNsLV1Zac/dX3IRNtb5W9HQcG/iVpjmOX+ky+ryo0tGmnm+/LcU29555l
7QuKd1TeUfVMrL+hGjW/Qsoy3IS2zRuOUT2RQAR5Qv7Ts0PQoC/tOzQ9Cw9X433Ls9x52t+9P5meie4
87W/en8zEu/yfqGgAI8TMW4tNNprgb1bipVSU5NpHM60KEq89GC9XwDqu57Q7YdpO6Wi3kt5NxKSV
tk97ew6U6dOzovPJJbW33lXd3LuKmf/atyK9M/+ePjP24AAjyMFjhHv1fRFcWOEe/V9EWGuDzhaFVi/w
C7D0LUqsX/AHYehZev8jwVxkwZOXzwAAW2F9nl6kTEu1v0RLwvs8vUiYl2t+iK9d/+MIgAI8gdLbtNP5kcz
pbdpp/MirX7h6HuA7gV9YAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD3AP
cBTWX8vV+pclNZfy9X6lySGOHxAAVso8Q7bU+n4IpKxDttT6fgjEfKyeUgAI5AAAAAAAAAAALrD+xxKXuL
rD+xxLD0fj+Sth29fOWWIVJU7Z6LybK2Hb185OxPs69SOqdqWQrGrNXUVpNqTyZMxbLooP4kGz7XT9S
div7EfmKlNzilvhnZPqV95VnO4nnJ5J5IsMM7L9TFWyo16mnGeTz25B3atrY4irGF1ZzoyjJ56L2HKMVHFt
neyUlRsqLWeWXNlZG4fW1WfEFp4xWJS8X92n6kfDF/1a9GWNanSu6SWlmu5o1t7ajbTeUs5PiFmkzk5
fpGxb36ZIw9t2qbefqR8W9+n6HTDKsXR6NtaSe4ETrLKurN9LNNt7TmWVzYRSnVU3nvyK0jzZKzFtS72l
OFWtoTeSyJzw+28T5lUAVvWsamHSVJyrShTTlk9hMt7GvFqTqdH6ES2r9XqOaWeaNqt5WqvbNpcEHV
ZpHeVrO4pUKeU6mbKSTzk38TADnJk5toLOpFPc5JF5Wp6VBwU9DZlmUS2NNb0W9GvSuqHRze3LJorX
BMd4lxhZRhNSjc5NfA64i4TtX+pOSayNNVw0s+kejwIl7Rp0qiVKWfFB1bdKzGlhYdjRFsYqV9Ub7s8iVYdj
RXUq/QXbn3ZtMEzERWZWN5Q6ZxTraCXca21CNvJtV00+43q0qN7BNS29zXccVhtKGbqTbXx2BpaJ5co
hyvVDrtKUe9rPL1Jl7N07VuO/cVMYxjdRUZaUVJbSzxHsj+gZ1tuLSgWNWauorSbT3k7EqkoUEovLN5Mr
7LtdP1J2K/sx9QlJnpS4YZUn1hxcm00b4ql0kH8Djhva16HbFvfgEif/LunOCVvoxegst/AgxsYxkpK52radrW
5p3FHo6jWllk8+80eF03LNTkohrMcoiaxt1vHCVpNOSbSzMYb2VerIV9b0qLXRy298SbhnZF6sQlZmcndX
XNac6825PY2ki0spyqWicnm9xT1v3qnzMtsP7GhDjDMzeVbBtXqSeS0+71LHE21a/peW1FY3o3blwnn9
y4qwhd0MlLY9uwLj71tEKehU0LiFSWbSZbVoUrumsp8mQKtnGncU6bn+mW9skPDYN50qjSCY4vG405
1MOnGLdOpn8CvaabT3ou6aVrQaqVNLLvZT1pKdaU1ubzDjLWK60zbxUriEXubLXEKkqVt+jZm8syohJw
mpLemXFOrSvKGjLLPvTC4fGa/tU0as4VYyjJ7+ZbX8VK0k3vW1GlPDqVKanKWkl3M44hdRlHoqbz4tB3E
TSk8nTCm5UZZtvaQr2Uut1Fm8syZhX7M/UhXvbKnqHN/wDlDgdrWjVq1P8ASeTW98DiT8LqwjKUJPJv
dmRjjiJtES2eH7c5XGTJ1OGVvouWnsyz4kW5sOmrOoppJkqhCELdRg80tmZ09tY1MxpV2Gy+y9SXidad
OEYweWlvZEse3v6nfFsv9MjGJ1jlDoNu6pNtv9SLS/qypW2lB5NvIqrftNL5kWWKdlXzIJjmenaVS5Sm/wB
TbJ8LGrUpRdSropLdwINOWhVhJ90ky6rQV1b6MJ5J7c0Ew1i25lztLfoJvKtpJrcRsVyVaD78iRaWsbarnKe
c3sSI+Lfuw9A0yR/5JVrNXFnoyebyyZGw+3cbiUpL3NiOeG1tCvoP3ZlnXqKjSnP4BaavWLT+lZiNZ1K+gnsi
QzMm5Sbe9mCPJa3KZkAAcgAAAAAAAAAAAAAAAAAAFvhXZ5fMVBb4V2eXzFhvg804AFfQAAAAAAw
9zMmHuYFRhXbanyv8lwU+FdtqfK/yXBIZYfEON52Wfodjjedln6FdX8ZUAAOXzAmWFrGu5SqbYpZIhm1
OpOnLOEnF/ALWYidysJ4Vm/0VMl8USLSyVvJyctKXpkV8cRrpZZp/QxO/rzWWll6FeiL4o7xDvilZScaUXnk
82V4bzeb3gjC9uU7AAHC7w7skCURcO7JAlFfTx+MKK+7ZU9SOSL7tlT1I5Hzr+Uh0oV5W89KGWeWW0
5gJE6ncJus63CPI2o4hWnWhFqOTaT2EAzGThNSW9PMbaRlvv7XN7XnQoqUMs8+8qa9aVeenPLP4G1
W6q146M2sk+BxC5cnOe30AAMUzC+0/QuSmwvtP0LksPf8Aj+CJifY5eqKUusS7HL1RSBh+T5MgAjzrCzs
oVqDlPe92XcZeFPP9NRZehCpVqlJ/6cmjusSrpZNp/Qr0Vti1q0LG0tY2sHtzb3srsRqqrcZReajsNKl5XqLJzy
Xw2EcGTLE141AAR5wv7Xs0PQoC/tezQ9Cw9X433Ls9x52t+9P5meie487W/en8zEuvyfqGgAI8behT6W
rGGeWZeUKEaFNRivqUVOpKlNThvR31hceNcit8V60+0+5s53Ev1Vso9yyI1TDejpyn0ueS3ZHHr9x4lyMT
va84uMpLJ/AOrXxz+nAGDJHmYLHCPfq+iK4scI9+r6IsNcHnC0KrF/3YehalVi/7sPQsvX+R4K4yYMnL54A
ALbC+zy9SJiXan6I5UbqrRjowaS37jSrVlWnpzebDe2SJxxVoAAwDpbdpp/MjmdLbtNP5kVa/cPQ9wHcCv
rAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAe4B7gKay/l6v1LkprL+Xq/UuS
Qxw+IACtlHiHban0/BGJOIdtqfT8EUj5WTylkAEcgAAAAAAAAAAGVOUVkpSS9TABvTObzzz28Q5ylslJv1
YMA2ynluMucpLJyb9WagESt8Nf/S/Urq05RuKmjJr9T3M5Jtbm0YDW2TdYj0zKUpPOUm/VmAAyltGpO
Puya9GYc5N56Tz9TABuWXKUnnKTfqwm4vNPJmADbd1JyWTm39TUwZBsBgAAAAAAAym1ueRgAb9L
Uyy05ZeppmAF/wD1lTlFZKTS9TD2sADKnKPuya9GZdSct85P6moBuQ2lOUlk5Nr4s1AQTaeaeRmU5S96
TfqzAAzFuLzTafwMylKXvNv1ZqZB3Yzaex5G/S1MstOWXqaALse3a9rNlOSWSk0vgzUBGXtCnJLJSaXwZg
ANrZtGpOPuya9GagKzKUm822/U2VWa3Sa+poAbls5ylvk36moAQMqTjubXoYAGzq1GsnOT+pqAF7tlK
Ufdk16M1bbebebAABbGAEb9LUyy05ZeprpySyUpL6mAF3LKbTzTefEy5OXvNv1ZqZCbYWx5o2cpSWTk
36swYAGYznB/pnJfUwANukm3m5PPjmbUl0taMZy2N72zmEFifa3p2FKnVU9JvLbkR8SuVNqnB5pPaQt
KWjlpPI0K1tl7aiNMgAjEAAAAAAAAAAAAAAAAAAAAAC3wrs8vmKgt8K7PL5iw3weacACvoAAAAAAYe
5mTD3MCowrttT5X+S4KfCu21Plf5LgkMsPiHG87LP0Oxxu+yz9Cur+MqAAHL5gAAgAAMGQAAAAu8O7
JAlEXD+yQJR0+nj8YUV92yp6kckX3bKnqRyPnX8pAARyAADBkAAAAJmF9p+hclPhfafoXBYfQ/H8ETEuxy
9UUhd4l2OXqvyUoef8AJ8gAEecAAAyYAGTAAAv7Xs0PQoC/tezQ9Cw9X433Ls9x52t+9P5meie487W/e
n8zEu/yfqGgAI8QAAAAAGTAAFjhHv1fRFcWOEe/V9EWGuDzhaFVi/7sPQtSqxf92HoWXsz+CvABy+cAA
AAAAAAHS27TT+ZHM623aafzIq18oegA7gV9YAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAD3APcBTWX8vV+pclNZfy9X6lySGOHxAAVso8Q7bU+n4IxJxDttT6fgikfKyeUsgAjkAAAAA
AAAAAAAlW1jOvHTb0Y93xDqtZtOoRQWuraO5zefqRrux6CGnGeaz3NB3bFasblDCO1C2ncZ6GWzfma
VqUqNRwllmuAZ8Z1tqDACAAAAGUtJpLewfbAJNWyq0YOc9HJcGRgs1mv2AFhh9vSrU5OpHNp5BaVm
86hXg63UFC5nGKySZyCTGp0AAIAAAAAAAAAAADta0emrxj3b2SL+nRoqMYQSk9rDuKTNeSD3ZgtnVte
qZJxy0dxGsKdGs5QnBN70Hc4u8REoQO95Q6Cu0tz2o4BlMTWdSGQk20lvZa07KhRpaVbJ8Ww6pSbqk
ySb1UFKPQZfHIjBzaOM6YAAQAAAA2hFzkoxTbe4DUFlTwxaOdWe3gjFbDcouVGWb4Mrbo31vSuBlpp
5NZNGCMgHahbTuG1Ty2b8zStSlRqOEss1wC8Z1toAA5AAAAAAAADaEJVJqENsmak/C6WlUdRrYtiDqle
VtItahUo5dIss/iciwr053t1JQeUIbMzqsMpJfqm2w06UzP+fpVAm3OHypRc6b0oreuBCDO1Zr9gQAcsm
BmMwAAAAAAAAAAAAAAAAAAAAAAAABb4V2eXzFQW+Fdnl8xYb4PNOABX0AAAAAAMPczJh7mBU
YV22p8r/JcFPhXbanyv8AJcEhlh8QxKKlFxe1MyCtFbPCk5NwqZLgzGqX5v2LMBl0KelZql+b9jGqX5q5FoC
HQp6VeqX5q5DVL81ci0AOhT0q9UvzVyGqX5q5FoAdCnpV6pfmrkbRwratKpmvgiyAOhT01p0404KMV
kkbAFax2RLqwhcT009GXf8AEj6qfmLkWYDOcVJncwrNVPzFyMaqfmLkWgInQp6Veqn5i5DVT8xci0AOh
T0q9VPzFyM6qfmLkWYB0KelZqp+YuQ1U/MXIswNHQp6RrWzhbJtPOT3tkkArStYrGoaVacatNwks0yvl
hW39NTZ8UWYDm2Ot/tV6ql5i5DVT8xci0BHPQp6VeqX5i5DVL8xci0AOhT0q9UvzFyGqn5i5FoAdCnpV
6qfmLkNUvzFyLQA6FPSthhSUs5zzXBFjGKikluRkFd1pWv0EG4w6NWo5xlot7ycAtqxaNSq9Uy8xchqmX
mLkWgIz6FPSr1TLzFyGqZeYuRaAHQp6VeqZeYuQ1TLzFyLQA6FPSr1TLzFyGqZeYuRaAHQp6VeqZeYuR
NtraFtDRjtb3s7grquKtZ3EBwuraNxDKWxrczuA7mImNSq9VPzFyGqn5i5FoCMuhT0q9VPzFyGqpeYuRa
AHQp6VeqpeYuQ1VLzFyLQA6FPSr1VLzFyGqpeYuRaAHQp6Veqn5i5He2w+NGppyek1uJoKsYaRO4gAA
agAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAYDAprL+Xq/UuSmsv5er9S5JD
HD4gAK2UeIdtqfT8EYk4h22p9PwRiPlZPKQAEcgAAAAAAAAAAF9T22q6Nr3dhQneheVaCyi848GVtivFZ
7tqlK6g85afqnmcp1qk4qE5NpcSwp4nB7KkdE6XdCnWt5VElmlmmg7mm43SW1lTpQp/6bTb37czW6o
W85ylUktPLdmccJ31F6EfEe1v0QdzaIxROmtpRp1qrjOWS7su8nqjZRejnHP1IFpbSuJvJ6MVvZKlaWlOWj
Oq9L1QcY98d6LrD4Kk6lHNZLPLiRbGnGrcaE1msi3gou3yg9KOWxlXh3bF6MOr0iLR/UyVhQ01J7Ipbszn
Gha9aaTWSSa/V37RitSUdCKeSe8r6S/1o+oL2rW3GIXteFOpSyqPKPrkU97Tp06qVJ5rLjmWOI9kkUy3BP
yLd9aC0wr9mfzf4KstcJ/Zn83+CM/x/NCu05Xs4ra2ybRw+lThpV9r9diOUEnizz4nTFZSUIKL/S3tK1isRE3l
v1S0rJqGWfwZXXVvK3novanuZmzk43NPReWbSZYYmoujBvxIOdRkpvWpR7Ow6SCnVzUXuXEkdXs29D
9Ofqda7cbN6GzKOwpE3nmm8w6txx6jSZeWPQR04POPDgZw+3p1ozc1nkyenp2K09rcNvIi4TuqeoXhX
nH9dHZ21KTdRrJ7k2YlY0K0G6Tyfc0yJiTbumnuS2HXCpPpJxz2ZZ5Ai1Zvx0g1KcqVRwktqNSbiiSuU13xIR
HlvHG0ws8Kh+mc/oRb+endS+Gwm4X2aXzFddP/AKmp8zK2ydsUQsJWlHqeno/q0M88/gQbKWjdQeff
kWsuwf8A2/8ABTUf34eoXLEVtXSxxaC6KE0tqeRVlxifZH6lOhLnPH+0ywpUqkm6jyaay25FnXhCpScaryj
65FHR/eh6otsR7HL1QaYp/wAT2Qa1vB3MadDamuOZLjY29GGdV5vi2cMKS6WbfcjGKSfTJPdlsQSOMV
5zCRKytq0M6Wz4plbVoypVdCXEkYZJq40c9jW464okqtJrewWitq8od3YUZUlksm8tpHu6FvQofoycs+O
0mV5uFm5R2NRKRtt5t5kXLNa9ohgsMKppzlUfcthXllhMs1Uj37CssOucNcRuJqt0cJNJLbkzfDbiU3KnN5
5bVmR8Si1dt9zRvhUX00n3ZBpFp6rXE6ahXzW6SIZOxVp1ox4IgkY5YiLyurGlSpwzpvNySz2mt1b28pyn
OS08t2kcMI96r6I4Yj2yXoivRNojFE6aW1vK4qaMdiW9lh1S1opaeWfxZrhKXQzffpEK+lKV1PSe57COIitK
RbXeU2rh9KrT0qDyfdt2MrJxcJOMlk0WOEuThOLexEbEUldvLvRUyViaxeEUs7Ozo1baMpx2vvzKwurDs
UPr+SJgiJt3c42drT2TacvizS7sIKm50lk1ty4lfVk5VZSb25lzbScrKOlt/SVrWa33GlJ3ltbrq1hpbnlmV1Gn0l0
od2ZNxSpo040l37WGeP8AzE2QqV1VpSbjLe82mayuK0556cs3wZzRZ2VkopVay270n3EcUi151EpUG+q
qVTfo7Sjl7zy4k6+vdPOnSf6e9rvIAdZrRPaP0AAMAAAAAAAAAAAAAAAAAAAAAAAAAAAC3wrs8vmKgt
8K7PL5iw3weacACvoAAAAAAYe4yHuAp8K7bV+V/kuCktqissRmquxPZmWqu6DWfSw5khhitERqXYHHr
VDzYcx1qh5sOZWvKHYHHrVDzYcx1qh5sOYOUOwOPWqHmw5jrVDzYcwcodgcetUPNhzHWqHmw5g5
Q7A49aoebDmOtUPNhzByh2Bx61Q82HMdaoebDmDlDsDj1qh5sOY61Q82HMHKHYHHrVDzYcx1qh5s
OYOUOwOPWqHmw5jrVDzYcwcodgcetUPNhzHWqHmw5g5Q7A49aoebDmOtUPNhzByh2Bx61Q82H
MdaoebDmDlDsDj1qh5sOY61Q82HMHKHYHHrVDzYcx1qh5sOYOUOwOPWqHmw5jrVDzYcwcodgcet
UPNhzHWqHmw5g5Q7A49aoebDmOtUPNhzByh2Bx61Q82HMdaoebDmDlDsDj1qh5sOY61Q82HMH
KHYHHrVDzYcx1qh5sOYOUOwOPWqHmw5jrVDzYcwcodgcetUPNhzHWqHmw5g5Q7A49aoebDmOtU
PNhzByh2Bx61Q82HMdaoebDmDlDsDj1qh5sOY61Q82HMHKHYHHrVDzYcx1qh5sOYOUOwOPWqHm
w5jrVDzYcwcodgcetUPNhzHWqHmw5g5Q7A49aoebDmOtUPNhzByh2Bx61Q82HMdaoebDmDlDsDj1
qh5sOY61Q82HMHKHYHHrVDzYcx1qh5sOYOUOwOPWqHmw5jrVDzYcwcodgcetUPNhzHWqHmw5g5
Q7A49aoebDmOtUPNhzByh2Bx61Q82HMdaoebDmDlDsDj1qh5sOY61Q82HMHKHYHHrVDzYcx1qh5s
OYOUOwOPWqHmw5jrVDzYcwcodgcetUPNhzHWqHmw5g5Q7A49aoebDmOtUPNhzByh2Bx61Q82H
MdaoebDmDlDsDj1qh5sOY61Q82HMHKHYHHrVDzYcx1qh5sOYOUOwOPWqHmw5jrVDzYcwcodgcet
UPNhzHWqHmw5g5Q7A49aoebDmOtUPNhzByh2Bx61Q82HMdaoebDmDlDsDj1qh5sOY61Q82HMH
KHYHHrVDzYcx1qh5sOYOUOxh7jl1qh5sOZrUvbeEHJ1Yv4Jg5R7V9l/L1fqXBT4XF1b2pXyyiXBIZ4fEABW
yjxDttT6fgikrEO21Pp+CMR8rJ5SAAjkAAAAAAAAAAAtqStK1CMHlml37GVJkO6X4/pbdStYvPP8A/wBjW
8uqcaLpU2pNrLZ3FXm+LMFaTmjWqxpMw+4jRqNTeSl3k2tb29eXSSks8u5lMZzCVy6rxmNp9jWhRqTp
zksm9jO1e0oVKjqOqknv2lSARljWphe050VQShJaKWS2lbh+UbvNtJZPeRAFtm3MTr6WGKyjKcNFp7O4
gJ5ST4GMwRle3K3JdqpRuqGUpLJrasyuvaNOi49FLNd6zI24ww0tl5R3juFnhc4xpT0pJfq72VgDjHfhO0m
4qunfSnB7U9hYQr0LulozyT4PuKYMruuWazK5p0ba1bmpLPi3mQL666eaUfcj9yK9u8Avl3GojULSzvITp
KnVaT3LPvOitLSMtPNemlsKdGdvELGbt/qNrG9vYaDpUtue9ozhPu1PUrCxwycIRnpyUc33sLS82yRMpN
anb3E9Go0pR+ORmLt7Om9Fr8tlZeyUrqTi81xTI72kWc2pnUd3S4rOvWc39DmAHnmdzuVphUv9Occ+/
MhX0dG7n8XmZsqvQ3Cbf6XsZIxJU56NSnOLe55MreZi2L/8SpVIdRy0ln0e7P4FZaR07mC+JwJ2GqEZur
OcV3JNhIv1LRt3xWWVCMc97KklX9ZVq/6XnGOxEUjnLblZvR/dh6otcQnGVnJKSbzWzMpzISuTjEx7dba
u7eqprd3otG7a8gnJrnkymCbW4q0ycY1rcLqKtrSDcWuebKy5uHXuFLdFPYjgYBfLy7RGoXVzODsZJSWej
uzKYAjnJfnIdrWv1espLPLvRxAcxOp3C6kra8gnJp5fHJjToWlP9LXp3spc2tzDbe8rfr/vXd0rVXWqub7zQw
CMJnc7lMw+vGjVkpPJSJte3t68uklJZ5b8ymM5sNa5dV4zG0q1uOrVpJ7YN5bCdUo21z+ttZ/B5FMZTyK
Vy6jUxuFxKtQtKWUGvRd5UVKjq1HOW9swYI5vkm3YLixnFWcE5Jb+/wCJTgGO/CdtpPOT9S3tZwVlHOS
zy4lMAUycJmVlhtJOpUqvjkiLe1ekuJbdi2I3o3ro0VTjFepEe15h1a8cYrCdhsKcpSnUyzW7NljN06kHFzWT
+JQAbWmXjGtLfqdpxX/uKutGMasox3J7DQBxe8W+o0AAMwAAAAAAAAAAAAAAAAAAAAAAAAAAC3
wrs8vmKgt8K7PL5iw3weacACvoAAAAAAAAI9zZ0rlfrX6luaImpqfmS5E+rWp0Y51JKK+Jw1jbeZ9idmVo
pvuj6np+ZLkNT0/MlyJGsrbx/YaytvH9h2c8caPqen5kuQ1NT8yXIkaytvH9hrK28f2HY440fU1PzJchqen5k
uRI1lbeP7DWVt4/sOxxxo+p6fmS5DU9PzJciRrK28f2Gsrbx/YdjjjR9TU/MlyGpqfmS5EjWVt4/sNZW3j+w
7HHGj6np+ZLkNT0/MlyJGsrbx/YaytvH9h2OONH1PT8yXIamp+ZLkSNZW3j+w1lbeP7DsccaPqan5kuQ1
PT8yXIkaytvH9hrK28f2HY440fU9PzJchqen5kuRI1lbeP7DWVt4/sOxxxo+pqfmS5DU1PzJciRrK28f2Gsrb
x/YdjjjR9T0/MlyGp6fmS5EjWVt4/sNZW3j+w7HHGj6np+ZLkNTU/MlyJGsrbx/YaytvH9h2OONH1NT8yX
Ianp+ZLkSNZW3j+w1lbeP7DsccaPqen5kuQ1PT8yXIkaytvH9hrK28f2HY440fU1PzJchqan5kuRI1lbeP7D
WVt4/sOxxxo+p6fmS5DU9PzJciRrK28f2Gsrbx/YdjjjR9T0/MlyGpqfmS5EjWVt4/sNZW3j+w7HHGj6mp+
ZLkNT0/MlyJGsrbx/YaytvH9h2OONH1PT8yXIanp+ZLkSNZW3j+w1lbeP7DsccaPqan5kuQ1NT8yXIkaytv
H9hrK28f2HY440fU9PzJchqen5kuRI1lbeP7DWVt4/sOxxxo+p6fmS5DU1PzJciRrK28f2Gsrbx/YdjjjR9TU/
MlyGp6fmS5EjWVt4/sNZW3j+w7HHGj6np+ZLkNT0/MlyJGsrbx/YaytvH9h2OONH1NT8yXIamp+ZLkSN
ZW3j+w1lbeP7DsccaPqen5kuQ1PT8yXIkaytvH9hrK28f2HY440fU9PzJchqan5kuRI1lbeP7DWVt4/sOxxx
o+pqfmS5DU9PzJciRrK28f2Gsrbx/YdjjjR9T0/MlyGp6fmS5EjWVt4/sNZW3j+w7HHGj6mp+ZLkNTU/Mly
JGsrbx/YaytvH9h2OONH1PT8yXIanp+ZLkSNZW3j+w1lbeP7DsccaPqen5kuQ1NT8yXIkaytvH9hrK28f2H
Y440fU1PzJchqen5kuRI1lbeP7DWVt4/sOxxxo+p6fmS5DU9PzJciRrK28f2Gsrbx/YdjjjR9TU/MlyGpqfmS
5EjWVt4/sNZW3j+w7HHGj6mp+ZLkNT0/MlyJGsrbx/YaytvH9h2OONH1NT8yXIamp+ZLkSNZW3j+w1lb
eP7DsccaPqan5kuQ1NT8yXIkaytvH9hrK28f2HY440fU9PzJchqan5kuRI1lbeP7DWVt4/sOxxxo+pqfmS5
DU1PzJciRrK28f2Gsrbx/YdjjjR9TU/MlyGp6fmS5EjWVt4/sNZW3j+w7HHGj6mp+ZLkNTU/MlyJGsrbx/Ya
ytvH9h2OONH1NT8yXIamp+ZLkSNZW3j+w1lbeP7DsccaPqen5kuQ1NT8yXIkaytvH9hrK28f2HY440fU1
PzJchqan5kuRI1lbeP7DWVt4/sOxxxo+pqfmS5DU9PzJciRrK28f2Gsrbx/YdjjjR9TU/MlyGpqfmS5EjWVt4
/sNZW3j+w7HHGj6mp+ZLkNTU/MlyJGsrbx/YaytvH9h2OONH1PT8yXIamp+ZLkSNZW3j+w1lbeP7Dscc
aPqan5kuQ1NT8yXIkaytvH9hrK28f2HY440fU9PzJcjMcHpKWcpya4HfWVt4/sZWIWzeXSJeo7Lxxu9KlCj
BQhHJI3MRkpRTi00+9GStYAAFUeIdtqfT8EUlYh22p9PwRiPlZPKQAEcgAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAzAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAW+Fdnl8xUFvhXZ5fMWG+DzTgAV9AAAAAABuQMPc
wKTQniN/KMpZQj9kTNUW/GfMj4V26r6P8AJcHMQ8+OsWjcq/U9vxnzGp7fjPmWALpp06+lfqe34z5jV
FvxnzLADR06+lfqi34z5jU9vxnzLADR06+lfqe34z5jU9vxnzLADR06+lfqi34z5jVFvxnzLADR06+lfqe34z5jU
9vxnzLADR06+lfqe34z5jVFvxnzLAxKUYRcpyUYre2xo6dfSBqi34z5jU9vxnzJtOtSq59HUhPLfoyTNxo6dfS
v1Pb8Z8xqe34z5lgBo6dfSv1Rb8Z8xqi34z5lgBpenX0r9T2/GfMant+M+ZYAaTp19K/U9vxnzGqLfjPmWA
Gjp19K/VFvxnzGp7fjPmWAGjp19K/U9vxnzGp7fjPmWAGjp19K/VFvxnzGqLfjPmWAGjp19K/U9vxnzGp
7fjPmWAGjp19K/U9vxnzGqLfjPmWAGjp19K/VFvxnzGp7fjPmWAGjp19K/U9vxnzGp7fjPmWAGjp19K/
VFvxnzGqLfjPmWAGjp19K/U9vxnzGp7fjPmWAGjp19K/U9vxnzGqLfjPmWAGjp19K/VFvxnzGp7fjPmW
AGjp19K/U9vxnzGp7fjPmWAGjp19K/VFvxnzGqLfjPmWAGjp19K/U9vxnzGp7fjPmWAGjp19K/U9vxnz
GqLfjPmWAGjp19K/VFvxnzGp7fjPmWAGjp19K/U9vxnzGp7fjPmWAGjp19K/VFvxnzGqLfjPmWAGjp19
K/U9vxnzGp7fjPmWAGjp19K/U9vxnzGqLfjPmWAGjp19K/VFvxnzGp7fjPmWAGjp19K/U9vxnzGqLfjPm
WAGjp19K/VFvxnzGqLfjPmWAGl6dfSv1Rb8Z8xqi34z5lgBo6dfSv1Rb8Z8xqi34z5lgBo6dfSv1Rb8Z8xqi3
4z5lgBo6dfSv1Rb8Z8xqi34z5lgBo6dfSv1Rb8Z8xqi34z5lgBo6dfSv1Rb8Z8xqi34z5lgBo6dfSv1Rb8Z8xqi3
4z5lgBo6dfSv1Rb8Z8xqi34z5lgBo6dfSv1Rb8Z8xqi34z5lgBo6dfSv1Rb8Z8xqi34z5lgBo6dfSv1Rb8Z8xqi3
4z5lgBo6dfSv1Rb8Z8xqi34z5lgBo6dfSv1Rb8Z8xqi34z5lgBo6dfSv1Rb8Z8xqi34z5lgBo6dfSv1Rb8Z8xqi3
4z5lgBo6dfSBqi34z5ms8HouD0JSUu5t5liHuGk6dfSpwmrOFadvN7tpbFNZfy9X6lyIc4fEABWyjxDttT6fgj
EnEO21Pp+CKR8rJ5SyACOQAAAAAAAAAAAAAAAAAAAAAAOtvRdeqoLd3sLEbnUOQLeULWzilKKzfwzY
6G2u4NwSzXet5W3Rn633VAO0f8ApbnRqRUstjzLC5tade306MUmlmsu8jmuObROvtUgtba0hQpOpXS
z+PcQZ/8AVXGjTgkm8klwBbHMRH9cAW8ba3taWdTJ8WzMVaXCcYqP4yDvoz+57qy0indU09qbJ2KU4
QoxcYpfq7kR6dONPEYRhJSipbMi0uKdOcU6uWjHbtK7x03SYUALqm7WvnCCi8u7Ir7+3VConH3ZfYMrY
prG9ooJ9r1WNHTqpaSe3Mk06tpXejFRb9CLXFuPtTgmYhaxoSU6eyL7iRh1GnO3znBN596DmMUzbiqw
XDjZ28spaOl8TNa0pVqTlBJPLNNB30J/UqYHWhRlVrqnuee18C06K2tKa01H1e9hxTHNu8qYFvCFpczTgl
mu7I44nSp04QcYpegdTh1XltXAsLGyU4dJV3dyO3T2aloaMeG4EYtxuZ0qQWN7ZwjTdWksktrSK4M7V
ms6kAAcAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
Bb4V2eXzFQW+Fdnl8xYb4PNOABX0AAAAAAMPczJh7mBUYT26r6P8lwU+E9tq+j/JcEhlh8VfjeIvDMPl
Wik5t6MU+J5W1oY1jUZV4V5KGeWblkj1GPYbLE8PdKDSnF6Uc+88rb3GMYHnSVGSp57nHSRWqfZW
WO2V/RhOpKVKUv1PPSSXxPVVa1OhDTqzjCK3uTyPOYf7WwrVY0r2l0Tby00819Swx3D7e/tqbr11RjC
Wen8AO2vMN09HrlLP5idTqQqwU6clKL3Nd54u7w7A42s+gvv9WK2Z57Wd/Y26qdYq2rk3DR0kuAHpa
mJWdK46Cpc041c0tBy27TnUxjD6VXo53dJSW9aW48b7RRlU9oakIe9JxS9SwvfZWFvhk7hV5SqwjpSzW
xgeqnd29Ogq060FTf8A3N7Djb4tY3NTo6NzTlN7kntZ4nBbCri9dW860o0aacmuHodMdwdYPVpTo1ZSj
Pc9zTA93VrU6FKVWrNQhFZuTexEZYrYSpSqq7pOEXk5aWxFbcXE7r2NnWqPOcqO1/HM85gGEa1qzjU
qOFKG15d7A9rb4rY3U9Cjc05y4J7TnjrywW6y8P8AlHmMdwKOE0oXVrUlo6WTT7mWdO+nf+yFadV51
Ix0ZPjk0Bw9iW31nN8D01e5o20NOvVhTjxk8jy/sVJRjdSe5JMqqlzHGMYcr6v0NBN7+5cEB7ahi1jcT0KV
1TlLgpbyYeDxWzwilbdLht3nVi1+ltvM9F7L39S9w3KtLSqUno58UBZ3sKlSzqwovKo45ReeW08fcYfj1tbzr
VazUIJyeVTuPbkHHP4W8/4pfgDxmHvF8SnKNtcSbis3nLI9NgFniNrOq8QnpJr9P6syp9ie0XHyo9Djl88P
wurWh7/ux9XsA7XOI2dpLRuLinB8G9pta31teLO3rQqZb9F55Hh8KoWF5KpXxW70ZN7I7c38TW9dvhl/
SrYVdOpFbdmez4MD6BUqQpQc6klGK3tsg68w3S0euUv/AHHnfaq6rV7Szms1SqQ0nlu0jnZWmAV7aC
q3E4Vmtuk3vA9dO+to2/TdPT0O6Wexnm8J9o69fFHSu6tOFDbt3ehYLAbWpg6taddygnp9Iu88phGHw
v8AFXazm4xWe1fAD6JRrU69NTpTjOL74vNG5Fw2xhh1nG2pycoxbeb+J0vJyp2dWcPejBtAeYxz2jrdZdp
h7yyei5ra2/gRY4Pj1WPTac03tylUyfI5eytKFbHM6m1wi5Rz45o94B5jALzFuvStLynKcI+9KSycS/uL22tF/
wBRXhT+Z5Eg87jGEYfVv3c3l30KktsOIFrRxewuKihSuqcpPctLeTT59i9phlCnGph130ks8nDbn6l/Y3txX9k
atWDbrQTin37MgLavi1jbzcKtzTjJb1ntN7bELS7eVvXp1Hwi9p4TCYYZVnPWlScW3sa3HpcGwvDKV67m
xuelyjkoZ7viBeVatOjBzqzUIre2yJDGcOqT0I3dJvcv1bzyWO30r/GXbVKvR29Keh8FlvZ1u8PwNWcna33+
vFZrPPKTA9qmms080ZPMex2IVK1OpaVZOXRrODfcj04EaWI2kbnqzuIKt4M9pJPL1vZivUxl3KrQVFz0t7
0keoApPaO6xGhRjGwpvRl71SKza+BRVMKx5UXcTqS2LSa6TbyPcFNj+NUsPt50YPSrzWSiu74sCD7L41X
uq0rS6k5ySzjJ7/Q9OeT9kMMqxqyvq0XFNZQz7/iesAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAe4B7gKay/l6v1Lkp7L+Xq/UuCQxw+IACtlHiHban0/
BGJOIdtqfT8EUj5WTylkAEcgAAAAAAAAAAAAAAAAAAAAAWGE5ac+ORXnShWlQqKcfquId0txtErO7dr
Gp/rxbfHac6V1Z0pN0003v2M6K6tbiGVXJPhIxKpZUYvQUXmtyK9c68omEG9rQr19KnuyJ2GKoqTcn+ju
zK+jGnOv8ArahDPPaybd3kI0ejt5J5rLNdwZY51M3mXTE41HRTh7q94h4a11pejJFnewdFwuJJNbM33kO
ro0bjToTUlnmsgt5iZjJCVi2a0H/2lfBSb/Qnn8C2heW9emo1sk+9Myqtnbxbho7eALUi88olW2fa6fqWGK
vK3WXfIhwrxnexqNKEczviNelVopU5qTTz2BKzEUtG0axeV3DImYsv9KHqQbSUYXMZSaSXeSsSr0qtOCp
zUmn3ESkx0piW1tY0lQVWvt2Z5cDajOy6aKpRelnse0W15SlQVOq8mlk8+8J2VvNSi85fgrWOOo46bYr2
aPzIzhnZfqcsRr0qtuowmpPSzyRnD69Knb6M5qLz3MG46u9oN1tuZt8S0w552a9WVVeSlWm0802T7C4
o07ZRnUinm9jDLFMReZlpYySvqsXve4YpCenGWTcct/AiOo43LnTffmmWEMRg45VotPhkFi1bVms9kXD
6cncqSz0VvZJxb3Iep0pXcKtZQpQeXezli0lowXftDvUVxTqUujl1SOa/TobcvQgueHrY4P7mtlfKjHo6ubj3P
gSZdRm9KThmFi0XiNaazvbfoHTjnllkthVE2+rW84KFJbV3ohEefLMzP2AAMgAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAt8K7PL5ioLfCuzy+YsN8HmnAAr6AA
AAAAGHuZkw9zAqMJ7bV9H+S4KfCe21fR/kuCQyw+KtxzE3hdmq0KenJySye4rqXtdZVKeVelODy2rLNH
oZ04VIuM4qUX3NFfUwHDKknJ2sE3wK1eNxGrDFsWi7C3cVLJJJb3xLD2thWpK0pycnSUMvg2eqtcPtLPs
1CNNve0jtXt6VzTdOvTjOL7mgPHKtgEcMShRc7hwyyyeeka+xv8ALz7v9N/lHqKODYfbz06VrBS45HW2w
2ztKrqW9vCnNrJtAeOxn/1Wv+SH+D1+J/xNxn5bM1cLsq1x09S2hKrmnpvfmiTUpwq03TnFShJZNPvA8
h7E9suPk/yd/bf9m1+ZnobXD7Szk5W1CFJy2Nx7zN1Y216oq6oxqqO1aXcBRx/9DS/4f8lH7P4wsKrT6W
DlSqb8u5nq8ZoU6Hs7c0qEFCEaeSiu7aUnslaUrmjcwuaKnFtbJIDhj+PQxSjC2tYS0dLNtra2WVKznY+x9a
FRZVJx0mn3ZtFxb4RYWtTTo2tOMuORKq0oV6UqdWKlCWxxfeB5X2Kipxu4vc0kyoq2ywjFnG+odLSzeS
ezSXFHvLWxtbLS6tRjS0t+j3m1xa0LqGhcUo1I8JIDyNbEcAjSzpWLnPw5tZHpsIp2qsoVbOj0UKiza2mtPB
MNpz0o2lNNbVsJ6Sikksku4DJBxz+FvP8Ail+CcaVaUK1KVOrFShJZSi+9AeR9ie0XHyo9BjtjK/wurRh7+yU
fptyJFrh9pZOTtqEKTlvce8kgfPMLr2VpUnRxO0csnv25osoXuBVrylRpWDlGbyctuz6HprnDLO7edxbwm+
LQtsLsrSWlQt4QlxSArsZv7HDYULSvbKrSlH3fCjz+IVMAqWsnZwqQr9y25Z/U9tcWlC6jo3FKNRf7kRI4Dh
kJaStKeYFX7HxruwrKel0bf6M/8FFh1ysIx2dS5g0ouUZLLdmfQIQjTgowioxW5IjXWF2V5PTuLeE5cWtoD
DsRo4lQdWhnop5NMlSSlFxazTOVraULOn0dtSjTjvyR2A8De21z7P4r09FPo9LOMstjXAuYe2Ns6Wc6E1
PLalxPRVaNOtBwqwU4vuaK9+z+GOWl1WHoBX4P7QXOJYlKl1f/AEXua/7fUosQlFe0tR4lpOkqrzW33e4
93QtqNtDQoU4048EjldYdaXu25oQqNbm0B43G62EStoww2k9PPNyyexfUt/Z25hZ+zNSvVWcITk2uJbx
wfD40XSVrT0JbWst53oWVvb0HQpUoxpt5uKWwDykr72du0517aVGo9+jn/ghYJFv2ipuwU+hUu/w/E9
dUwLDak9KVpTzfAlW1nb2kdG3oxpr4IDxWPWU7DGZXFSlp0Ks9Pbuee9EjWHs/0Ol1KWnl7ub/ACexq
0adem4VYKcXvTRB1FhmnpdUp5+gHD2ejZVrbrVpbdDKX6Zby4NacIUoKEIqMVuSNgPMVfairSxd2qoRd
JT0W9ukenIssNs5XXWZW8HW36WW0lAVHtDjDwu3iqcc61TNRb3I8baXNCV91jEtOttzyT3v4n0G6sLW
90etUIVdHdpdxG1Fhf8A/CpcgIeH+0tpdXFO1pUpxctkeCL0hUcHw+3qxq0bSnCcd0ktxNAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAe4B7gKey/l6v
1Lgp7L+Xq/UuCQxw+IACtlHiHban0/BGJOIdtqfT8EYj5WTykABHIAAAAAAAAAAAAAAAAAAAAAAAAAA
BkwZAwDIAwN+8yABgyAMAAAAAAAAAADejKMKsZTWaT3Fn1iyrLOajn8Y7SpAaUyTXst1c2luv9PLPglv
K26uJXFXSexLcjkYBfLNo0GQAzAAQAAUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAC3wrs8vmKgt8K7PL5iw3weacACvoAAAAAAYe5mTD3MCownttX0f5Lgp
8J7bV9H+S4JDLD4gAK1AAAAAAAAAABiUVKLjJJp70zWFOFPPQhGOfBZG4AAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAe4B7gKey/l6v1Lgp7L+Xq/UuCQxw+IACtlHiHban0/BFJWIdt
qfT8EYj5WTykABHIAAAAAAAAAAAAAAAAAAAAAAAADKjJ7k2Y3PJhdBkbxk1vCdwBpremGmt6YXQBk
8s8tgW3cE1IDLi1vTRjeAAya3oADKjJrNRb+hjJ8C5sEnZwbQaY8fOdSp9GS3xa9UdJW1aMNOVNqPEkXd
5CskowcXGWZvVxCMrdxVNptZbdwdcKRuNoCjJrNRbXoYaa3pr1RY2V1TUYUdB57szbFUlRhkv+4L0q8e
USqwAGAAbU6c6stGCzaWYXW2oMyhKDylFp/EwEAAQAZSzeSDi1vTRV0wAZyeWeQRgGUm9yCTe5A
YBlJvcjAXQDbQllnovkag0Azk+BgIGUnLYlmEm9yJmGL/qXmv8AtDqteU6RNCfhfI1Lq6uoW8lFwzzWZTe
820u8OslIrOolgGcnnlltDi1vTQZsAAACZYKg9PptHuyzJ/VreVNyjBNZbA2rim0bhSAzL3n6mAxbQpzqS0Y
RcmZqUqlJpTi4t7jpZ1+r1dLRck951u7xValNqDUY7doaRWs13vui6E/BLkYaaeTWRd21zC5TcY5ZcSsv9l3
MOr4orXlEowADEAAAAAAAAAAAAAAAAAAAAAAAAAAAt8K7PL5ioLfCuzy+YsN8HmnAAr6AAAAAAGH
uZkw9zAqMJ7bV9H+S4KfCe21fR/kuCQyw+IACtQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAA9wD3AU9l/L1fqXBT2X8vV+pcEhjh8QAFbKPEO21Pp+CKSsQ7bU+n
4IxHysnlIACOQAAAAAAAAAAAAAAAAAAAAAOtvKEK0XUSce/M5Emxt1cVXpe7Ha1xDqkTNoiEx4hQi8
oxbS70jtKnRu6Gkktu55bUcbirbW0uj6BN+iJFtUjUoaUIaC4ZFe6veZrKpto6N7CL7nkW9aNKKU6iWUdq
Kul/Jf/AFsl4q30MPUMseq0mUe7r069al0e6L27CyqU6bp/rS0VtZRU/wByPqi4v3lZSy+AMdtxaZRL25o1
KShS3p8Deld29KjHKH6stqSK2K0pJcS3dC3tKOlOGllvzWeYc0m1pmzehc0bluGjk+DIN3SVrdRlDYntJVrc
0qtbRhRUXxyRyxf3qXow7v3ptIuKcbizbglnlmiqoU3VrRh8dpYYXW0oOm+7d6HahaqjcVKnc93wBNIyat
DliM40qCpxSTl+DtYr/ooFXe1eluZNblsRaWPYofUFLRbJKme2r9S4uYpWL2f9pTv976lzc9hl8ocYo7WVdl
2un6k7Fv2afzEKy7VT9Sbi37NP5h+in/KyqCWe7aDta1Y0K2nJNrLciPPH33ctGXhfI6W9aVvV04pN5ZZM
n6zpeXL7EOjTV3dyTbinmw1msRMcJTI3lvX/AE1oZeoqYfTnHToyyz3GdCztVnLKUvjtOVbE3lo0YJL4lazN
df8AogNZNrgYMt5tt72EtJpcdhHk/fZY0bu3pUI/o/V3pIkULijctx0ctm5o06vQtaGnOCllvzWeZi1uKNWso
06Oi+OSK9tdxMRKHiFvGhVTgsoyLG0hGVpBNJ5xI2LbofUk2vYoNeEJWsRklwuK9vSpTow97JrYjfDIp2u7
P9TKqbznLPiWuF9kfzMiY7csjarWtrbOOX6ntaSIVnWowqzlVS27Uzhcv/qanzMl4fawqQdSos9uxBzub31
H6dliNByy0XlxyF9bwnburBJSSzzXejnUuraFRwVum08vdRLrPOzm0sk4PZ9CtY/1ExKNhk41KTpySzX4IV5
S6G4kktj2oWlXobiMu7cyzurbrDptdz2+gZRHUpr9w0sqSoWjnPLN7WR8Pn0t7Ob70dsSqqnRjSW+X4I+
F9pfyh1bUXrWP02xZf6sPQ64XFOlLPicsW/dh6HbCv2ZeoIj/wBpdKte3tajTX6nteSN8qN3RzSTT+xV3va6
nqTsK7PL5gtb8rzX9KycHCrKnvaeRjRn4WSalRUsRlUazSk9iJOs6Xly+xGMUrMzuVY9jyLu27FH5SnrTVWr
KaWSbLi27FH5Su8HlKlkm5yyWe0xoy8MuR3t6yoXEpyTa2rYTNaUvLl9gzrWs/co2GrO7ya7mdMWSU6
eSy2M1sJaV85LvzZvi/vw9GGkRHSlthO6ZGxDtkyThO6ZGxDtkwW/4wjAAjzAAAAAAAAAAAAAAAAAAA
AAAAAAAAFvhXZ5fMVBb4V2eXzFhvg804AFfQAAAAAAw9zMmHuYFRhPbavo/wAlwU+E9tq+j/JcEhlh8
QAxKSjFye5bStWQVM8Uqab0IrR7szXWlbwxDDr0XAKfWlbwxGtK3hiD5FFwCn1pW8MRrSt4Yg+RRcAp
9aVvDEa0reGIPkUXAKfWlbwxMrFKue2MQfIotwc7esq9JTWzM6BtE7jcAIN7fOhNQgk5d+ZF1nW4RDK
2alZ1K4BT6zrcIjWdbhEifIouAU+s63CI1nW4RKfIouAU+s63CI1nW4RIfIouAU+s63CI1nW4RB8ii4BCsr11
5OE0lL4E0rWtotG4AaVaipU3N7kirlilXP8ATFZBzfJWn2twU+tK3hQ1pW8KDj5FFwCn1pW8KGtK3hQPk
UXAKfWlbwoa0reFA+RRcAp9aVvChrSt4UD5FFwCojilXNaUVkWtOaqU1OO5oO6ZK3+mwIF5fujU6OCT
a3tkfWdbgg5nNSJ1K3BT6zrcENZ1uCCfIouAU+s63BDWdbggnyKLgFPrOtwQ1nW4IHyKLgFPrOtwQ1n
W4IHyKLgFRrOtwQ1nW4IL8ii3Bxtq6uKKmtj70aXl0raCaWcnuDWbRFeSSCn1nW8MRrOtwiGXyKLgFPr
OtwiNZ1uEQnyKLgFPrOtwiNZ1uEQfIouAU+s63CI1nW4RB8ii4BT6zrcIna2xGU6qhUSylszQWM9JnSyAO
F3XdCg5rf3BtMxEbl3BRO9uG89N/Qx12v5jJt5/k1XwKHrtfzGOu1/MY2fJr6XwKHrtfzGOu1/MY2fJr6Xw
KHrtfzGOu1/MY2fJr6XwKHrtfzGbU7+tGablpLgNkfkVXgNYS04KXFZnO6q9DQlPvW4r0TaIjbsCjd7Xbz6R
mOu1/MZNvP8AJqvQUXXa/mMddr+Yxs+TVegouu1/MY67X8xjZ8mq9BRddr+Yx12v5jGz5NV6Ci67X8x
mYX9eE03LSXemNnyKrwGtOWnTjJd6zOd3W6ChKa2vuK9EzERt2BRO9uG8+kY67ceYybef5FV6Ci67ceY
x12v5jGz5NfS9BRdduPMY67ceYxs+TX0vQUXXbjzGOu3HmMbPk19L0FF1248xjrtx5jGz5NfS9BRdduPM
ZZWFzK4ptT96O8u3dM1bTpLD3APcGynsv5er9S4Key/l6v1LgkMcPiAArZR4h22p9PwRiTiHban0/BFI+V
k8pZABHIAAAAAAAAAAAAAAAAAAAAAHe1uHb1NLLNPY0cAFiZidwtZ3dpVylUi218BTxGhotNOOT2JIq
gVt17O9OrCN50rz0dJvcd7+7p3FOKp57HtzRBBHHUnUx7Zg8pxb3Jlhd3lGtbOnBvSeXcVwCVvNYmIZTy
aa7izp4hRqU9GvHJ9+wqwFpeafSzheWtKaVOGSe9pHDELincSp9HnszzzRDNqcoxqRlJZpPcFnLaY4y7W
kpQuYaK78mWl5W6G3bXvPYjir+336Lz9CDd3TuKie6K3IrXlGOkxE7R95d2PYofUpCytb6lRt4wkpZrgg4
w2iLd1fLZVb+JYVr6jO1dNN6TWW45XtzRr0kqaaaee4hESbcJmI/bvZZ9bp+pNxb9mn8xztr2jSoxjJPSS4G
l9d07inFQzzTz2h3E1rjmNoQADzBmMnF5xbRgAM33sAADKMAC0p39GdPQrLJ+hiN7bUZpUoZJ73kVg
DbrWTL+5p3Gh0bby4o7UL6jC1VOTlpKOW4rQE6tuU2Hk22WFld0qFvoTbzzb2IrwHNbzWdw3rSU605L
c22iTZXioJwms4vbmiGAReYncLSd1Zt6ehpT37hUv6VS2lHapNNZZFWA761mcnv7i7spuVrGUu5ZEK0u6
FOiqc4vPvfE2ucQUqehRTWezNhpjmtI5bRLyr01xJ9y2I74V2l/KQiRZV4W9VynnlllsDKtt33KRiq/1YehrY3
VOhTkpt5t9yJEsRt5LbGT+hVPeyu72it+VZdLipGrXnOO5slWN3SoUnGo3m3nsRABGVbzFuTpXmqlec47
m9hzADmZ3Ows6F9RhbRhJvSyy3FYA6reaT2Zbzk2u9mAA4SLKtGhcKc88ssthvf3FO4lF088lvzRENqbUa
ib3Jh3F548VjhO6ZFxDtkyasRt1ujJfQr7qrGtcSnHPJ8Stck14RWJcQAR5wAAAAAAAAAAAAAAAAAAAAA
AAAAAC3wrs8vmKgt8K7PL5iw3weacACvoAAAAAAYe5mTD3MCownttX0f5Lgp8J7bV9H+S4JDLD4hyu
P2Knys6nK4/YqfKyu7fUqAwZBy+UwDIAwDIAwDIAwAwBc4Z2X6kwh4Z2X6kwr6mPwhR4i/wDrJ/T8EY
k4j22f0/BGI+dk8pAARmAAoAAgAACVhvbI+jLspMN7ZH0ZdnUfT6H43gjYh2Of0KMvMQ7HP6FGJY/k+
QACPMAAAAAAAAF7Y9kp+hRF7Y9kp+hYen8bylVX3a5+pHJF92ufqRyMb+UgADgAAAAAAAAMmABb4
V2d+pyxffTOuFdnfqcsX3wK9s/8VaAZI8TAyAAZDIyAMZDIGQMG9L9+HqjQ3o/vQ9UFr9vQrciHinZvqTV
uRCxXs31On0snhKnABy+YAAAAAAAAAAEPQ0P2YehwxLskjvQ/Yh6HDEuySOn0rf8ANSgA5fNAAAAAA
AAAAB6C27PD0OOJ9kfqdrbs8PQ4Yp2R+pX0r/8ANTGTAI+aAAAAAAAAAAAWWEb6v0/yVpZYRvq/T/I
htg/6Qsw9wD3HT6Knsv5er9S4Key/l6v1LgkMcPiAArZR4h22p9PwRiTiHban0/BFI+Vk8pZABHIAAAAAA
AAAAAAAAAAAAANoQlUmoxWbZ1r2lS3ipTya+AdRWZjbgAA5AAAAAAAAAAAAAAAAAAAAAAAyBgAA
AZUXJpRWbfcbVKNSmk5xaz4hdS0AAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAC3wrs8vmKgt8K7PL5iw3weacACvoAAAAAAYe5mTD3MCownttX
0f5Lgp8J7bV9H+S4JDLD4hyuP2Knys6nK4/YqfKyu7fUqAAwcvlN6UHUqxgnlpPLMm6rl5i5EGE3CalHen
mWNjd1a1fRm1lo5lbYopPayNc2btoKTkpZvLcdaWGyqU1LTSzWe47Yt+zD5iJRvq0dGCa0d24O5rSt9S6
zw2UIOXSJ5LPcQS/rfsT+Vnnw5zUrSY0MAEYLnDOy/UmEPDOy/UmFfUx+EKPEe2z+n4IxJxHts/p+CMR8
7J5S70LWrXecVlHiyXHCs1tqbfgcKN/OlS0NFN9z4HN3ldvPpGGkTjiO/d0uLCpRjpL9SW/IjQhKpJRgtJ8EX
NnVlXttKpv3epWRrO1upuCTWe4LelY1aPqXeGGTaznNR+BmeFyUc4TTfxONa/q1Jfok4rgjtYXVWddQnJ
yT4hY6Uzx0gzhKnJxksmjUscWjHSpyW95lcGOSvG2krDe2R9GXZSYb2yPoy7LH09n43gjX/Y5/Qoy8v+xz
+hRhj+T5OtCi69VQTyz7yXqqXmLkQqVSVKenDeSVf3DeSab9COKTTX+odNVS81cjhdWjtoqTmpJvItqLq
Ro6VeSz7/gVV9ddYnox9yL2FaZKUrXbpSw6VWnGaqJJrPI31VPzYkeF9WpwUItJL4Eyyq3FxLSm0oL4bwl
Yx27acnhU/MjyK9rJtFze3SoQ0Yv9b+xTBxmilZ1UL2x7JT9CiL2x7JT9BDv8bylVX3a5+pHJF92ufqRyMb+
UgBNw616WfSTX6F9wlKzadQUsNnOmpyko59zRFqwVOo4qWll3otL+66KHRwf6n9ioDTLFa9oACbYWv
Sz05L9K+4cUpNp1BSw6dSmpOSjn3EWrBU6jipaWXei0v7roafRw9+X2RUMO8ta17R9gADFb4V2d+pyxf
fA64V2d+pyxffAr2z/xVp0o0nVqxgnlpd5zJWHrO7j8MyPJWOUxDtqqXmLkNVS81ciTf150IRdPLNkF4jcc
Y8ivTaMVZ1MONxRdCroZ5nehh8q1NTU0k/gRqtWVaenPeXNl+mzh6BnipW9p9Ieqp+YuRzr4fKjSc3NN
L4CeIV1OSTWWfA51L2tVg4SayfwItulHaIRzej+9D1Rob0f3oeqDCv29EtyIWK9mXqTVuRCxXsy9Tp9LJ4S
pwk20lvYJ+GUVOcqklno7jl8+leU6ZoYY5JOrJr4I7vDaGXevqL+5lRShT95rPPgV7ncL9Tc0V6LdOnbW295
axt8tGeefczhRpSrT0YLNirVnVlnN5vcW2H0VSoKWX6pbWGdaRkt2+nKlhcFHOpJt/A3lhtF+62vqR7u6qz
qyhSzUU8tneR1Wuab96S9Q7m2OvbTSvTVKrKClpZd5zMtttt72YI8377PQ0P2IehwxLskjvQ/Yh6HDEuyS
On0bf81KTLK0jcRk5trLgQyww2tTpQlpzUc33nLxYoibd3bVlLxSGrKXikRbu6m7iXQ1XobMsiVhzqzjKdSb
aexJleivTtbjEON1Y06NFzjKWfxOkMNpyhFuUtqzNMVre7SXqzv1qirZKNVaWh/gJrHylrqul4pDVdLxyK9X
Nw5JRqSzbLqmnTorTlm0s22Fp07/AFCmvKCt6+hFtrLPacDrc1emrylyOQeS+uU6egtuzw9DhinZH6ne27
PD0OGKdkfqH0L/APNTADvI+al2tjKutOT0YExYbQS2uT+p3tX/ANLTy8KKi4dd15aWlnmV7JrXHWJ1tKrY
ZlBypSbfBlc002nsaLyzc3bR6XeVd3oddk17uazI4yUjUTH7dbXD5VY6dRuMeBKeHUN2bz9STt6H/T4bCk
br9Lm9LSzK7tWuOI7bSrjDnTjpUm5Jb0yBuPQUtJ0Yupvy2lDVa6WWjuzDPNSK6mGpZYRvq/T/ACVpZY
Rvq/T/ACSPtzg/6Qsw9wD3HT6Knsv5er9S4Key/l6v1LgkMcPiAArZR4h22p9PwRiTiHban0/BGI+Vk8pAA
RyAAAAAAAAAAAbqjUks1CTXHI0LuxS6nDPgVrjpznSojQqzWcYSa9DWdOUHlOLT+JZVMShTm4Qhml3
ndxp3lvmlv3fAO+lWe1Z7qWMJTeUU2/gbOlUTScJZvuyJNhFwvXF70mixuKtOgtOS27kEpiia7mVRS6Sh
Xi9B6fcuJ3vLmtVpqM6ThHPe+8x06uMQpTUcsthJxXs8Pm/wFiP821PZWxpVJrOMJNfBCNGpN/phJ/Qt
cMX/AE31Nat/ToVHCMM8t+RDpVisTMqudOcPfi16o2oU3UqxWi3HPbkXP+nd22eSakuRX2VdUKrpuO
ek8s8yk4oi0d+0ut5Z06dHSpQeln6lc04+8mvUvbmsqFPTaz27inuq6uKumouOzcRc9axPZxMxjKTyim38
EYJlndRoQkpQ0nvWQYViJnu4dWrZZ9HLkc2nF5NNP4lnTxJymlOnkn3m2JUYyo9Il+qJW04qzXdZVcKc5
56EW8uBlUajk4qEm18Cwwn3anqd7m7pW0stHOT2tIFcUTXlMqhU5yk4qLbXcHSqKWi4S0uGRNw+fSX
dSWWSe3ImXNelbPSks5PYsgVxRNeUypZwlCWjJNPgbRoVZ+7TlyOs7pTvFWcf096ZKeJ7coUtiDmtad9y
rp050/fi16oQpzn7kW/QuoSheW70o79mTK+zn0F44Pc3ohbYoiY79pRJRcHlJNP4mYxc3lFNv4FhilHOM
aq9GYwqj71WS+CCdKefFBnTlT9+LXqaki+q9LcPLdHYiORnaIidQnYXS0qkqjWyO40xOq519BbokvDIpW2
fFlc/9W7elucg3t2xxEftzhSnU9yDf0NpUKsV+qnJfQuKrdvRXRU9LLuRF1jJJqpSyKk4q17TKujCU3lFNvgjb
oamlo6Es+GRJw5uV421vTLC6uIWyUms5PYhpK46zXlMqeVvVis3Tll6HMt7a+jcT0JR0W93xIuI26pSVSG
xS2ZELY448qyiQpzn7kW/RG0rerFZunLL0JdG/jToRiqeclvyJNteKvPQlTaz3FWuOk9tqd7DKTbySbfwJmJ
UFTqKcVlpEuzt4ULdVJr9WWbbGnMYpm019Kzq9bLPo5ZehzcWnk00/iWTxSKnl0f6eOZzvq1vWiuj2z4o
aW1Ka3WUFRcnkk2/gdHbVks+jll6FpRpQtLZzlHOWWbZxhiLc/1U8oPvGljFEeUqzdvBZ4jbxdNVorJ9+R
WEZXpwnQAA4AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAC3wrs8vmKgt8K
7PL5iw3weacACvoAAAAAAYe5mTD3MCownttX0f5Lgp8J7bV9H+S4JDLD4hyuP2Knys6nK4/YqfKyu7fU
vPgA5fKCZhna//AKSGTMM7X/8ASIaYvOEjFv2YfMVlP9yPqWeLfsw+YrKf7kfUrTN/0X9b9ifynnz0Fb9ify
nnw6/J+4AAR5VzhnZfqTCHhnZfqTCvqY/CFHiPbZ/T8EYk4j22f0/BGI+dk85DrQt5156Md3e+Bm3t53E8o
7u9lnOdOyo6MY5y4cQ7x49/6n6YrTp2VtoLflsXeynbcm5PezerOdabnPPNmqi5SSSbfAqZLzedR9MJNtJ
LNstrK1VCPS1dksu/uFpaRt4dJV978EW8up13owzUF9w0rWMccrfbS9r9PV2e7HYiMZafeYI89pmZ3KVh
vbI+jLspMN7ZH0Zdlj6e78bwRr/sc/oUZeX/AGOf0KMSx/J8mSVh7hGvnNpZLZmcKNKVaooR3s3qWdeE
mujclxQhjWJj/UQuG6dxBw0lJPgysvbLoI6cM3Hd6GbG3rK4jPJxit/xJuIyStJJ97Qeqf8A0pMzClW9F5Qq0
Y0YJSitm7MrOpVnSjUis0+7vNFb1s8lSln6BjSbY/0sbmxhW0pxeU+PEqZRcZOL3ovraEqdvCNT3ktpS3bT
uqjju0g6z1jUWci9seyU/Qoi9seyU/QQfjeUqq+7XP1I5Ivu1z9SORjfyl2tqDr1VFbu9lvUnG0t/wBK3LYkiFh
9elRhLpJZNslO9tnvmmV6cXGtd77oNpDrN3LpotprPab4hbQpRg6cMs33E+jXo1Z5U2s/gZrVadJJ1Wtu7
MOunXh9qW3oOvVUFml3lxOUbW32LctiXeRqF1QhWqy0klJ7Du723e+aYTHFaxPfugW0es3bdaLefE6Y
hbQpQi6cNrZNo16NSWVNrP0N61WnSSdTLJhenWaT3efay2MHa7nGdxKUPdZxI8UxqdLfCuzv1OWL74
HXCuzv1OWL74Feyf8AirSXh84QrtzaWzeRDtQtp3GloZbOJHkpM8o0tpV7aa/VKD9Q7e3rxzjGLz74lTK1r
ReTpy+iJ2G0atNyc01F7kyvXW82nVoQ7u26vVyW2L3MsqNxRhRjFzjsRHxVp9HBLOWZGqWNaCTUdJP
gHHfHeeMLNO1m9iptv4HC6sIODnSWUlty4kCnb13JaMJRee/Iu89GlnJ7ltDSuskTyh543o/vQ9Uava2bU
f3oeqI8Ufb0S3IhYr2b6k1bkQsV7N9Tp9LJ4Spy1wr9iXqVRPwysoTdOWzS3HLw4Z1eE6vUpUf11F+rLJcT
SjeUa8tBJp8Gc8Rtp1tGdNZ5bMiNZ2dVXEZzi4qO3aV6bWvF9RHZ0xG0hCPS01lt2pE+h+xDhkR8Tmo2z
j3yM4fWVSgo5/qjsaC11GSYgqXVC2loKO3vyR0pVKN1TeW1d6aK+8tK3WJzhFyUnnsJOHW06MZSnsb7
glbXm+pjsg3tDoK+S917URybilRTrqK/7VtIRHlvERfUPQ0P2IehwxLskjvQ/Yh6HDEuySOnut/zUoAOXzW0
Iuc4xW9vIvYRjQoJblFFdhlHSqOo1sjsRIxOtoUlBb5FevFEUpN5Vtao6tWU33s0MIEeWZmZS8No9JW02v
0x/JNxGt0VDRT/AFS2G9jSVG3WfvPaytv63S3Dy3R2Ir1T/wCeP+yjAAPI9Bbdnh6HDFOyP1O9t2eHocM
U7I/UPpX/AOamAMxaUk2s9pHzv2ubGlKjQ/XJ7duXAxO+t1Jpyza4I77KtD9L95bGU87OvGTWg38UV7b
zNKxFYW6lGtS/05bGtjRTVqM4XHRy2yb2PiWlhQlQovT3t7uBFuasNYweeyOWbDnJHKsTKdQg6FBKpP
PLj3HJ31tpb/rkdriDrW8oxe1rYU3U6+ll0b9Q6yWtXUVhcVF09BqE8s1saKOcXCbhJZNby7taTo28YSe1F
TeTU7mbjuzyzDPPG6xM/bgWWEb6v0/yVpZYRvq/T/JI+2eDzhZh7gHuOn0VPZfy9X6lwU9l/L1fqXBIY4f
EABWyjxDttT6fgikrEO21Pp+CMR8rJ5SAAjkAAAAAAAAAAAu7LbZw9CkLuy2WcPQr0/j+Sqq29SnNxcW
+GSLSypyoWy01k3tOEMTSWVSGb4pnG5xCVWOhBaMXv4hazSn+oltaTUsRk1ueZti3vwIlrXVvWU2s1l3
HS8uo3Li4xccuIcc4nHMftztO10/Un4t2eHzf4K2jPo60ZtZ5Mk3l5G5pxioOOTz2graIxzCZhvZfqVdf9+fqS
bW+jQo6Dg28+4iVJ6dSUkss3mQvaJpEQt8O7HH1f5KyOy9T/wBxItb+NCgqbg213ohSk3UclxzKt7xMV1
+lviUXK1/Sm9pUNNPJpr1LGlii0MqkG3xRGvLiNxJOMMskQyzS3+olGLawoU40FUa0pPaVJLtL6VCOhKOl
HuDjFMRO7O+sJuroRo9+RJxDsc/p+SLPEaa206X6uLNbi/jWoOnoNN95W/UrETEy6YT7tT1IuIdrkbWd3
G2UlKLlnwONzVVau5pZZhla0dOIScK/fl6GcV/ej8pws7hW9VycW81lsF5cK4qKSi0kstoTlHS4/tth9GNavl
Paks8ibd3PVWoQpprLMrKFaVCopx+vxJ7xGlKP66TbDvHavDW9SlWtWVajpTho/AqLl5XU2t+ZMhiaWe
lB5dyXcQZ6VetKUIt57ckDLeLViInutqbV3ZZPe1k/U1qNWljkt+WX1OWFqpFTU4tR+JyxOtpVVTT2R3hp
NtU5T9oOebzYBkjwrjDuyR+GZUzTVV8cywwupnCVPvTzIt1Hq983lnt0g9V+9Kykxva9JKNWk38STRqQu
4PSptfMiPHEoNZTpms8TSjlTp5fFlaVvWPu22LWCpYjOK3LM6YpRnNRlBZ5b8jhh8pTvXKW1tEy7u3bVY
pxzi0ErxnHO/pBsKFR3EZaLUVvbJOKNONOHe5GJYpHL9EHn8SBVqzq1HObzb+wcTala8Y7rbRhaWunCC
bS5nO1vKleso9Fku9nChiWUNCrDSyW9GzxGMZLo6WUc9vxDTqV7altiz/TD1JP79plB747CtvLyNyoqMX
HRfea2t3O32e9HgHHVrF59S5uhV09DQlnnwN6ltVoNSmtnFE1YpDL9t5kS5vJ3GzLKPAOLRSsbiVu5t0N
OmlJ5bEQevVtLLq+0j215O3Wj70OBKeKU0v25NjbXqRaPvTjdXdZwdOpSUdJcSCSLq7dw1+lJIjh58ltz9g
AIzAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAC3wrs8vmKgt8K7PL5iw3wea
cACvoAAAAAAYe5mTD3MCownttX0f5Lgp8J7bV9H+S4JDLD4hyuP2Knys6nK4/YqfKyu7fUvPgA5fKDvZ1
429fTmm1llsOAC1njO4Tb67p3NOMYKSaee0hwejJN9xgBbXm07laVMSoypyiozzay3FWAFvkm/2AAOF
zhnZfqTCHhnZfqTCvqY/CFHiPbZ/T8EYk4j22f0/BGI+dk8pWFnfUqFBQlGTfwR21pQ8E+SKkDbuM94jS21
nQ8E+SI3W6fXem0ZaOW7IhAbSc1pW2tKPhnyQ1nQ8E+SKkDbr5F0+8vaVehoQjJPPPaiAAGV7zadylYb
2yPoy7KTDe2R9GXZY+nt/G8Ea/7HP6FGXl/2Of0KMSx/J8na2uHbz0kk8ywhiVJr9SkmVIJtlTJanaFvLEqK
WxSbK+5up3E85bIrcjgBtbZbW7LGjiaSSqQ3bM4kjWNvl38imA26jPeIWFziWknGims+9lfvADK17W7yF7
Y9kp+hRF7Y9kp+hYb/AI3lKqvu1z9SOSL7tc/UjkY38pAAHCTZXEbeq5TTaay2G99dwuYxUFJZPvIYDvqWi
vEMmAHCRZ1429XSmm1l3HW+u4XEIqCksn3kIB3GS0V4gADhb4V2d+pyxffA64V2d+pyxffAr2z/AMVa
SrS8dutFxTiyKZI8lbTWdwtliVB71JfQ1qYpTS/04tv4lU0C7a9e7rK4qSrqrJ5yTzJ9PFIZZVINP4FWCbcVy2r
3hcPEqCX/AHciFdX8qycILRj+SIA6tmtaNBvR/eh6o0N6P70PVBlX7eiW5ELFezfUmrciFivZvqdPpZPCVOE
2mmnk0AcvmJ1LEqkI5TipfE3lijy/TT2/FlcA16t9a26Vq060tKb2mKVWdGelB5M0AZ7ne1jDFGl+unn6M
1q4nOUcoRUfiQTA2061/bLbk83tbMABn+3oaH7EPQ4Yl2SR3ofsQ9DhiXZJHT6Nv+alABy+amW9+6FN
QVNP45nC5ru4q6bWXckcgHU3tMaDaElGabWaT3GoDnafLE5ODiqaWa35kBgyHVrzb7YBkwHL0Ft2eH
ocMU7I/U723Z4ehwxTsj9SvpX/AOamABHzUi3vKlBZL9UeDJSxTjT+5WmQ0jLeP2mVcSqTTUEo595Cbz
bb7zJgObXm32lUL+rRjo+9FdzJGtVl+3t9StA27jLeI1tMr4hVqx0YpQXwZDADi1ptO5CywjfV+n+StLLCN9
X6f5ENMH/SFmHuAe46fRU9l/L1fqXBT2X8vV+pcEhjh8QAFbKPEO21Pp+CKSsQ7bU+n4IxHysnlIACOQA
AAAAAAAAACfQv1SoRp6GeSyzzIADqtpr3gAAcgAAAAAAAAAAAAAAAAAAAAAAAAAAEi0uurNtwUszg
YCxaazuFjUxTOLVOGTfeyulJyk5SebZkwHVr2t9gADh1oV3Qqqa+q4nS6uo3OT0NFr4kYB1ynXEAAcu1rX
VvV02s9mWRvd3SuZJ6Ojl8SMA65zrj+gAByAAAAAAAAAADBkAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAABb4V2eXzFQW+Fdnl8xYb4PNOABX0AAAAAAMPczJh7mBUYT22r
6P8lwU+E9tq+j/JcEhlh8Q5XH7FT5WdTWpHTpyjxWRWk94edMEmpY14TyUHJdzRp1Sv5bOXzJpaJ+nE
Hfqlfy2Y6pX8thOFvTiDt1Sv5bHVK/lsHC3pxB26pX8tjqlfy2Dhb04g7dUr+WzMbOu3l0bBwt6WWGdl+p
MOFpRdCioPfvZ3K+ljjVYiVHiPbZ/T8EYs8Qs5zqOrTWee9ELqlfy2HgyUtyns4g7dUr+Wx1Sv5bI44W9OIO
3VK/lsdUr+WwcLenEHbqlfy2OqV/LYOFvTiDt1Sv5bHVK/lsHC3p0w3tkfRl2V2H2c6U+kqLJ5bEWJYe7B
Wa17o1/wBkn9CjPQ16fTUZQzyzRSzsq8ZNaDfoJZfkVtM7hwB26pX8tmeqV/LZHm4W9OAO3VK/lsdUr
+Wxo4W9OIO3VK/lsdUr+Wxo4W9OIO3VK/lsdUr+WwcLenEvbHslP0KqFlXm8tBr4suaFPoqUYLuRYen8
esxMzKmvu1z9SOWN/Z1JVXUprST3oidUr+XIMclLcp7OIO3VK/lyHVK/lyI44W9OIO3VK/lyHVK/lyBwt6c
QduqV/LkOqV/LkDhb04g7dUr+XIdUr+XIHC3pxB26pX8uRlWddvJU2U4W9LDCuzv1OWL74EuzoOhQU
ZPa9rNMQtpXFNOHvR7uIe2az0tKUZnfqlfy2Y6pX8tkeLhb045jM7dUr+Wx1Sv5bBwt6ccxmduqV/LY6p
X8tg4W9OOYzO3VK/lsdUr+WwcLenE3o/vQ9Ub9Ur+Wzva2NV1oynHRjF57Suq0tM/S3W5EPFey/Umo
5XNBV6Lg9nxK+heN1mHnwTXhlZPY00Y1bX+Bzp8/pX9IYJmrbj4DVtf4DR0r+kMEzVtf4DVtf4A6V/SICX
q2v8AAatr/AHSv6QwTNW1/gb08MqOa6RpR78i6IxX9LKh+xD0OGJdkkSorRiktyNK9JV6UoPvK+hau6ae
eBNeGVk8k00Y1ZX+Bzp8/pX9IYJmrK/wGrK/wGjp39IYJmrK/wABqyv8Bo6d/SGCZqyv8Bqyv8Bo6d/SG
CZqyv8AA3p4XUclptKPeUjFf0sbbs8PQ4Yp2R+pKhFQgorclkaXFFV6Tg+8r32iZpp58E14ZWT2NNGNW1
/gc6eDpX9IYJmra/wGra/wGjp39IYJmra/wGra/wABo6d/SGCZq2v8Bq2v8Bo6d/SGCZq2v8Bq2v8AAaO
nf0hllhG+r9P8nLVtb4E+ztVbU2s85PeytcOO0X3MJIe4B7ivcp7L+Xq/UuCnsv5er9S4JDHD4gAK2UeIdtqf
T8EYk4h22p9PwRSPlZPKWQARyAAAAAAAAAAAAdKVCrV9yDa4hYiZ+nMEmVhcJZ6GfozhKLhJxksmu4
LNZr9tQdqVtVqrOEG1xNp2deCzcNnwC8La3pHAO8rStGOk4bA5iJn6cASVY12s9A41Kc6TynFphZrMfcN
Ab06U6ryhFs7qwrte79wRW0/UIoN6lKdJ5Ti0zNGjOu2qaza3hNTvTmDv1StpuCg81vOcqU4VHBx/VwQ
JrMNASY2NeSz0MvVnOrbVaKznB5cQvC0RvTkDrbUpVai0YaST2ljdWkXQ/wBKktL4LaV1XFNo2qQb1Kc
6Uspx0WZpUKtb3INriHEVmZ05gkTsq8I5uGfocMsnt2EJrMfYYN6dKpVeVOLZ1lZV4xz0M/QLFbSOzrKn
p5LRyz3mtG1q1ouUEmvUtqmyxa/2kDDKujXcO6SDecVYtEe0OUXCTjJZNbzBOxSlo1VNf928ghhevGdA
ADkAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAALfCuzy+YqC3wrs8vmLDfB5pwAK+gAAAAABh7mZMPcwKjCe21fR/kuCnwnttX0f5LgkMsPiAArUA
AAwZARjIGQBgGQBgyAAAAUAADYNgAQ2DYAA2DYAA2AAAAAoAAAAAAEa+vqGH0eluZ6Mdy+IEkHC
zvKN9bqtby0oPZ6M7gAAEAAFAAAAAQAAAAAAAAAAUAAGMgZAGAZAGAZARgGQBgyAFAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD3APcBT2X8vV+pcFPZfy9X6lwSGOHxA
AVso8Q7bU+n4IxJxDttT6fgikfKyeUsgAjkAAAAAAAAAABF7FOFsuhSby2IoifSd7QprRjpRe3LgVvhtxmezZ
3N5Tec6ea79hHox63efr3Payxta9Ws2qtLRWW84ScKOJxyySktvqGk13qd9ki5nOhTjGhTb9FuOdrXrzno
VqbSf/dkdbp11FSt8nlvRFp1b6by0Evi0Glp1b9uOIUFSrKUdil3Fo5qnQ05LcinuK1WpUUayycWW04dJb
OGeTaDnHO5txQNaVNPPRWjnuJlxThc2ull3ZplYrGu56Og/XuLSo1b2eUn7scglJtMTF/pW2lzOjmox0nLc
iRG6vNJaVF5Z+FnTC4Q6vp5LSb2nOpdXXTuEYZbdmwJWJrWJ2kXtNVbVvLalms+4i4Sn0lT0RNuM+qS0t
+jtIWE/uVPRB3aP/WqTd3itpaMY5ye0rY3UutdM0s+COuJ9q+gwyEZ125bclsDK9rWvxdut3c9sKL0e79L
JlJuvb/6sNFvemiPeXFejUUaUM4tb8iRbSqSoJ1klJhtT7mJnast60ra4lCKTUpZbSyuqzoUNOKTfBlTJ5Xjb8
RaXsJVLVqCzfAOMczxmIVkpyvbmCkks9mzgWlWTt6CjQpuT4JFVQUra5hKrFx9S2rup0WlbtZ/kGLvEzP2
4W9xcuoo1aT0X35bjjiVulOM4bNLYzaNS/lLLQS+LRHubit0ihWS/S89gS1o46lYpQs7VvL3VzIcMTqaf6or
RzJtSKubRqD95bCsjZV3PRcGlxYXJNo1FPpa12naya3NFNatq5ptcS4rLRtJR4RKa2WdxTS8SCZp/1VZYos7
dPgypLfFOzJd7ZUEln+R5gADAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAALfCuzy+YqC3wrs8vmLDfB5pwAK+gAAAAABh7mZMPcwKjCe21fR/ku
CnwnttX0f5LgkMsPiAArUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADzXtv2G2/5H+D0p5n2
37Dbf8AI/wB09i/4up/yP8ACPRHnfYv+Mq/8j/CPRAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA9wD3AU9l/L1fqXBT2X8
vV+pcEhjh8QAFbKPEO21Pp+CMScQ7bU+n4IxHysnlIACOQAAAAAAAAAAFseZNpYnUispRTyIQDqtpr9J
08Um1+iCT4kOc5Tk5SbbZqAtr2t9yl0b+rSSTymvidJ4pNr9MIr4kAFWMt4jW20pyqVNKbzbZd1pOFo5R
3pbCiWxkupf1KlJ03GOTWQd4rxWJ26LFJqOTgmyNXualeWcnkuCOIJtnOS0xqZd7e6nb+7tXBkiWKTa/T
TSfEgAbWMlojUSmTxGpOj0bgtqyzzOVtcu3cnGKelxOAG0nJaZ3t1uKzr1dNpLZlsNaVWVGanB5NGgDnl
O9rDWksttNNmscTqLPOEXmQQNtOtf22nNzm5ZZNvMl0sRqU4KMkpfEhGQ4i9qzuHe5upXLWlFLLgbU
L6rQio7JRXcyKBtedt72sHik2nlBIhVasqs3ObzZoZBbJa327295UobI5OPBneeKVGmowSfEgGQsZLRGolLn
iNSVJwcFtWWZjDqencqWWyO0iEi3u5W8XGMYvPvYWt92ibJGKVc5xp8NrIBtUqOpOUpb2ahze3K22A
AHAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAW+Fdnl8xUFvhXZ5fMWG+DzTgAV9AAAAAADD3MyYe5gVGE9tq+j/ACXBT4T22r6P8lwSGWHx
AAVqAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB5n237Dbf8AI/wemPM+2/Ybb/kf4A6exf8
AGVf+R/hHojzvsX/GVf8Akf4R6IAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAHuAe4Cnsv5er9S4Key/l6v1LgkMcPiAArZR
4h22p9PwRSViHban0/BGI+Vk8pAARyAAAAAAAAAAAAdadtVqR0oQbQWImfpyB36nX8tmHaVoptweS
C8benEAByAAAAFtaXEACXUsJ06LqOSyXcRA6tWa/YDJgjkAAAAAAAAAAAAAAAAABQAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAC3wrs8
vmKgt8K7PL5iw3weacACvoAAAAAAYe5mTD3MCownttX0f5Lgp8J7bV9H+S4JDLD4gAK1AAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAA8z7b9htv+R/g9K2ks28kjy/tnWp1LK3VOpGTVR7nn3Ad/Yv+M
q/8j/CPRHmfY6tSp4dUU6kYvpHsby7kemTzWaAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB7gHuAp7L+Xq/UuCnsv5er
9S4JDHD4gAK2UeIdtqfT8EUlYh22p9PwRiPlZPKQAEcgAAAAAAAAAAF1h/Y4lKXeHdkiWHo/H8kaeJuE3
Ho9zy3mk8Tc4OPR71lvJE6dm5Nycc/Uj3cLZUG6WjpZ9zDu/OIn/SNb28riTUGk1xOur6zqaOzJd50wn92
fodr+7nRkoU8k9+bDitK8OVkaeG1orNZSIbTTyZb4fdTr6Uam+PeRLykniCillpNMF8deMWq50LSrXWcVk
uLOrw6tDKSaeT3InXNRWltnBbtiIFLEK3SrSacW9qDqaUpOp+0+87FL0RSF3evOzm+KKQjn8jyAAR5wAA
AAAAAAAAAAAAAAAFAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAALfCuzy+YqC3wrs8vmLDfB5pwAK+gAAAAABh7mZMPcwKjCe21fR/ku
CnwnttX0f5LgkMsPiAArUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAcbugrq0qUG2lOOWaP
m1/a1rK6nQr55xexvvXE+nlRjuCRxWkpQahXh7sn3rgB4rDLKtiF5G3otrPbJ8EfSLekqFvToxbahFRTe/YQ
MEweGFW2i2pVpe/NfgswAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAe4B7gKey/l6v1Lgp7L+Xq/UuCQxw+IACtlHiHban
0/BGJOIdtqfT8EUj5WTylkAEcgAAAAAAAAAAF1h/Y4lKSKV7WowUINZL4CGuK8UtuXaph1eVSUlo7Xs2
mjw64Sfu8xrK44x5GNZV3vceRXczin264Uv8AVn6GuKdpXoR6NxOhJuGWb4oxWrTrz0ptZ/BBzN46fFM
wj36nov8AJrfS0MQjLhkyNQuKlu26bW3fmjWtWnWqac8s/gDnHT4/tc1qcby2yjLftTINLDavSrTyUVvyZ
Ho3NWh7ktnA6TxCvOOWkl6INJyY7am32sr7ZZzRRkid7WnS6OTWjlluI5GeW8XncAAIxAAAAAAAAAAA
AAAAFAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAt8K7PL5ioLfCuzy+YsN8HmnAAr6AAAAAAGHuZkw9zAqMJ7bV9H+S4KfCe21fR/k
uCQyw+IAc7ibp0JyW9IrSZ1G27lFb2jGnHxLmedlKUpOTbbZjNk28nyf49Hpx8SGnHxI85mxmxs+T/Ho9O
PiQ04+JHnM2M2Nnyf49Hpx8SGnHxI85mxmxs+T/Ho9OPiQ04+JHnM2M2Nnyf49Hpx8S5m2ee481my
wwqrLpZU2845Zh3TPytrS1DaW9gpMQqyndSjm8o7EitcmThG1zpx8S5jTj4lzPO5jNk28/yf49Fpx8S5jTj4
lzPOZsZsbPlfx6PTj4lzGnHxLmeczYzY2fK/j0enHxLmNOPiXM85mxmxs+V/Ho9OPiXM2TT3M81myxwqr
LpHTb2ZZh3T8jlbWloYcore0cbuo6dtOUd5RNtvNvaV1lzdOdPRdJHxIdJHxI85t4jaTbL5P8ej6SPiQ6SPiR5
zbxG3iNnyf49Hpx8S5jpI+JHnNo28Rs+T/Ho+kj4kOkj4lzPObeI2jZ8n+PSKUXuaMnm1JxeabTRf203Ut4T
e9oNcWXnOnUw5Jb2jL3FDdVZVLibbex5IrrJk4QvNOPiQ04+JHncxmTbD5M+notOPiQ04+JHncxmNnyZ
9PRacfEhpx8SPO5jMbPkz6ei04+JDTj4kedzGY2fJn09Fpx8SNszzeZZ4VVlKM4SeajuDvHn5W1pYgEHFas
oUoxi8tJ7St72412macfEhpx8SPOZjMm3l+T/Ho9OPiQ04+JczzmYzY2fJn09Hpx8SGnHxI85mxmxs+TPp6
PTj4kNOPiR5zNjNjZ8mfT0enHxLmNOPiR5zNjNjZ8mfT0enHxI2TTWxnms2TsLqyVbo884tbg7pn5TrS3M
NpLa8jJT4nVm7jQz/AEpbitcl+EbW2nHxLmNOPiXM85t4jaTbz/K/j0enHxIacfEjzm0bRs+V/Ho9OPiXMac
fEjzm0bRs+V/Ho9OPiQ04+JHnNo2jZ8r+PR6cfEjZNPczzW0nYZVkq/R5/pa3B1T8jlOtLcNpbwU+J1ZSuN
DP9KW4rbJfhG1t0kPEuY6SPiR5zNjNk28/yv49H0kfEuY6SPiR5zNjNjZ8r+PR9JHxIdJHxI85mxmxs+V/Ho+
kj4kOkj4lzPOZsZsbPlfx6PpI+JczKae483m+JOwyrJV9DP8AS1uDqn5HKdaW5hyS3tGSgu6sqlxNt7E8kg1y
ZOEbXunHxIacfEjzmbGbG2HyZ9PR6cfEhpx8SPOZsZsbPkz6ej04+JDTj4keczYzY2fJn09Hpx8SGnHxI85m
xmxs+TPp6PTj4lzNszzWbLTCqspRnCTzUcsg7x5+U60sQ9wD3FelT2X8vV+pcFPZfy9X6lwSGOHxAAVso8
Q7bU+n4IxJxDttT6fgikfKyeUsgAjkAAAAAAAAAAAAADBkAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAt8K7PL5ioLfCuzy+YsN8HmnAAr6AAAAAAGHuZkw9zAqMJ7bV9H+S4KfCe21fR/kuCQyw
+IcbzstT0OxxvOyz9Cu7+MqAAHL5UgBlLPiBgAAAAk+AAAACbhXaX8pCJuFdpfylhpi84XBQ3vbKnqXxQ3
vbKnqJer8nxhwAH0I8IAPoAAAAAACbhfaX8v/ghE3C+1P5RDTF5wn3/AGOf0KMvL/sc/oUYa/k+QAA8w
DOT4GAaABk+4ADOTW9GAaC9seyU/Qoi9seyU/QsPT+N5SkPcedrfvT+ZnonuPO1v3p/MxLv8n6hoACP
GAAAAAAH0YAFjhHv1fRFcWOEe/V9EIa4fOFoVuL+5D1LIrcX9yHqdPbm8JVgAOXzQAAAAAAAAAACXh
va16EQl4b2tegaYvKF0UmI9sl6IuykxHtkvRFev8jxRQAR4AD6MfQAAPowAH0YAErDe2RIpKw3tkQ7x+U
LspMR7XL0RdlJiPa5Fev8nxRQAR4QGcuBgKABbQgBkABKw3ta9CKSsN7WvRhpj84Xb3Hna/78/U9Ezztb
9+fqWXp/J+oaAAjxAH0AAAAAAALHCPeq+iK4scI96r6IQ1wecLQPcA9x0+kp7L+Xq/UuCnsv5er9S4JDHD
4gAK2UeIdtqfT8EYk4h22p9PwRiPlZPKQAEcgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAW+Fdnl8xUFvhXZ5fMWG+DzTgAV9AAAAAADD3MyYe5gVGE9tq+j/JcFPhPbav
o/yXBIZYfEON52Wfodjjedln6Fd38ZUAAOXypTrCzjWXSVPd7lxJs6lrQejJRi/gjnhtWMrdQXvR3nG7satSu
509qZXsrHGkTSNpTo29zTzjGOXFLIqbqi6FZwb2b0Wtjbzt6TU2s288l3FfiNVVLjOOTUVkEyxE0iZjuk2VlD
o41Kq0m9uR3nXtKctB6Ka7lE3takattHR4ZP4FfUw6t0kssmm9+YdT/mscI2m1bSjcQ0opJvc0U9SDhUlF
708i7tqbt7dRm9y2lPc1FVrzlHc2HGesaif25E3Cu0v5SETcK7S/lEMcXnC4KG97ZU9S+KG97ZU9Q9X5PjD
nTWdWCe7SRdulQjHOVOCXFoo4S0Zxllnk8yZXxBVqLp9G1n35hjitWsTtN/6ThS5I6KhRazVOHIprWk6te
MVu3st7mqqFvKXwyQb0vFomZhFt4U53tZaMXFblkSpQtoPKUaafxSKu1uerzlJx0s/ia3lwrmcZKOWSyD
KMta13+1tGNrOWjGNNvgkjS7pUYW85KEU8t+RHwuhkpVXvexGMVq7Y0l6sNJtHT5TCuJuF9qfy/wDgh
E3C+1P5f/BHlxecJ9/2Sf0KMvL/ALJP6FGGv5Hm2hB1JqMd7La3sKVKOdRKUu/Mi4XTUqspvuWwlXyq1
FGlR3veFxUiK8phv0lqv05w9CHiPQKMeiUdJ98TR4ZWS2OLfqRqtOdKWjUjkype9tamG9rbyuKmitiW1st
Y29vbwzcY+sjXDqahbKSW2W04XNGvdV2orKEd2Yd1pwrvW5SeltKmzOD9UVd50auJKkkorgbzw+vBZp
J+hGaabT3kZZLWmNTGmC9seyU/Qoi9seyU/QsOvxvKUh7jztb96fzM9E9x52t+9P5mJd/k/UNC1w6jCV
BucIyefeiqLnDllaR+OZGWCN2byVpFtNU018Ec6rtOinoqnnk8tiI9ewrVK05rLJvZtIla2q0ffjs4laWvaP8A5
ZtYqdzCLWaz2ouJ07ems5whFfFIqsPWd3H4Fle0JXFJRhvTzBhj/Ezo0rPhS5Irb/o+n/0tHRy/7TM8Prx2qK
a+DI0k4vJrJojjJa0xqY0wWOEe/V9EVxY4R79X0Qj7cYfOFoVuL+7D1LIrcX92HqdS9mbwlWAA5fOC0sbO
Kh0lWKbe5Mj2Fr0s+kn7kfuTL646GGhD35bPQr04qREc7Id/UpynoUoxSW9pEM7O1rKLk4PLfmciMb7
mdzDBaWNnFQ06sU29yZww+26WppzX6Vu+JKv7noafR0/fl9itsVIrHOyFfVKbnoUoRSjvaW8inaVrWjFy
cHkjiRjfczuQl4b2tehEJeG9rXoFxeULopMR7ZL0RdlJiPbJeiOnr/I8UUtbR23QQ01T0stuaRVB7Dl46X4zteL
qsnklTbfwRtKjRjFt04JehGw+0UIKrNZye1fA0xKrV9xRah3viV7OWqcphwtnS623PR0M3v3FhnacKX2KT
M7WtCVxV0c8l3sPPTJMdohcQp281nGEGvgiDiapQUIwjGMs9uSJ0l1e3ypQbyWxIpKspym3U974hrmtq
utd2hKw3tcSKSsN7XEjzY/KF2UmIdrkXZSYh2uRZev8nxRiwsrWjKn0tSSl8O5FeFJpNJtJ7yPJS0VncwtutW
cXorR/9pmra0binpU0k8tjSKcucPg6VrnPv2leil+pOphXW9CNSu6c5aORYN2lstFqOfpmyqrT0q8px2Zs0b
bebeb4kZRkinbS5hK1us4xUW13ZFfe23V6i0fdluNsNhKV0pLdHedcWmnKEVvW0NLavj5TCvJWG9rXoyI
S8N7WvRhjj84XTPPVv35+p6Fnnq378/UsvT+T9Q0ABHihdU+qtRWVNy9ELujTjbTcacU8t6RVW3aYepcX
nZZ+hXtpaL1mdIlh0HQf6qhpZ95NVGhKOapwafwKAvrTstP5URMFuXbSlrJKtNJZLM5nSv8Avz9TmHkt9
hZYR71X0RWllhHvVfRCGmDzhZh7gHuOn0lPZfy9X6lwU9l/L1fqXBIY4fEABWyjxDttT6fgikrEO21Pp+CM
R8vJ5SAAjgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAC3wrs8vm
Kgt8K7PL5iw3weacACvoAAAAAAYe5mTD3MCownttX0f5Lgp8J7bV9H+S4JDLD4hxvOyz9Dscbzss/Qru/j
KgABy+UubC3jSpKeX65LNs4VsScajjTjsXeyRZV41KMY5/qismjjWwzTqOUJ6Ob3Mr3Ty4R03a0u+sqUZL
KS3ohX1tGFWOhsU+4m2trG1Tbecn3kO/uIzqxUNuhtzCX8I5/afRpQtaGxblm3xIUsUnpfpgtH4snUqsLij
nF7GsmuBDlhTcv01P0+gdX56jppVCrG7oZuOzc0VV5RVG4cVue1FtQowtaOWezvbKm8rKvcOUfdWxC
Webwjl9uBNwrtL+UhE3Cu0v5QwxecLgob3tlT1L4ob3tlT1D1fk+MOBkwdKVN1asYLvZHiiNzpY4ZS0aTq
NbZHDFK2lUVJPZHa/UsZONC3b3KK2FFOTnNzfe8yvVknhSKQ1Mxi5zUY728jBOwyjpVXUa2R3eoealeV
ohYwSoUEtyiijrVHVqym+9lnidbQo6C3y3lSRtnt34x+gm4X2p/L/4IRNwvtT+X/wGeLzhPv8Ask/oUZeX/ZJ
/Qow0/I8llhLX60Sry46vTTyzb2IqrSv0FZSfuvYy1r0oXdFZS+KaK1xTvHqPtDoYjOVWMaiTTfcSr+lGrbSfet
qZxoYboVFOc88u5G+IXEYUXTT/AFS2egWOUUnm62LztIZdyyOF3fSo1dCmls3tnLDbqMP9KbyTexki6sV
cVNOMtF9/xBym2OOH2xZXkq8nCa2rc0cMVpKMozWxveSbSzVtnJy0pPvIeI141ZqEXmo95HN5mMer/
aEXtj2Sn6FFkXtj2Sn6Fhx+N5SkPcedrfvT+ZnonuPO1v3p/MxLv8n6hoS6V/OjSUFFZIipZtLiW6sKFSjFLfl7
yZGGKLTM8UaOKTzWdNZFinC4oJ5bJIhxwuCltm2iVUnTtqO1pJLJIr1U5xE81RCo7W5k4pNptbTvrOp4U
ZsaVO4q1J1cnnuTO08Mpyf6ZSiGNa31usulpe9Yk4yjkzhitKKUaiWTexkm2tIW7ck22+9kLErhVJKnFppb
w0v2x6v9oJY4R79X0RXFjhHv1fREj7efD5wtCtxf3YepZFbi/uw9TqXszeEqw3oU+lrRhuzZobUqjpVFOO9
HL58ffdf06apU1CC2IhTsKtSrpzqJvPMj6yrfDkZjiNZzitm18CvXOTHbUSs509Ki4Z71lmVksPlCpCMpp6TL
OpNxoSmt6WZUzvqspKTazju2B1lmnba3hBU6ajBZJLYQZ4fUqVXOdRNt5kdYlWy3rkbRxGs5pbMm+Ac
zkx21ErSpDTpOOeWayKa6tJWyTlJPMuKsnGjKS3pFNXuZ3CSnlsfcDPx1/XAl4b2tehEJeG9rXoR58XlC6KT
Ee2S9EXZSYj2yXoivX+R4ooBa0bKjO2ink34kyPHSk3+nCniU6cIx0E0llvLCjUjdUdLLY96ZF1XDP35ZEqKp2
tHLNKKK9mOLx5/SmuaSo3EoLcnsM21w7ablFZtrIkUFC7vZTnlo9yfeSKmGUpPODcfQMIx2meVS1xDpq
qhOOTe5mMTpRdHpMlmjpb2EKE9PNyfxOOJV4un0UWm3v+AbTvpzzVhKw3tcSKSsN7XEjyY/KF2UmI
drkXZSYh2uRZev8nxRjBkn4faRnlVnty3IjyUpN51BZWWl/qVlsW1Ji+vE06VJ/p72TbmlVqw0Kc1Bd5C1V
LzFyK9NqWrXjSFetp2tradxPKOxd7Ois2rtUHLuzzRbU6KpU9Cns+LDPHhmZ7/pHqVKVjQ0Y5aXcuJU1Kk
qs3KTzbLGphtWrJynVTb+BHuLCVCk5uafwIuSt5/XZDJeG9rXoyIS8N7WvRhlj84XTPPVv35+p6E89W/fn6
ll6fyfqGgAI8Lra9ph6lxedln6FPa9ph6lxedln6FezB4Soi9tOy0/lKIvbPstP5SJ+N9yp7j9+fqcjrcfvz9TkHmt9
hZYR71X0RWllhHvVfRCGmDzhZh7gHuOn0lPZfy9X6lwU9l/L1fqXBIY4fEABWyjxHttT6fgjEzFIZXOfiRDI+X
kjVpAARwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABb4T2eXzFQ
XWGw0bRPi2yw9H4/mlgAr3gAAAAAYe5mTD3MCownttX0f5Lgp8J7bV9H+S4JDLD4hxvOyz9Dscbzss/
Qru/jKgABy+UzGTi808md1e3CWXSPL4kcB1Fpj6dalzWqrKc21wOQASZmfttCpODzhJr0OyvrhLLpGRwFi
0x9S6VK9Wr782zmAEmZn7CbhXaX8pCJuFdpfyld4vOFwUN72yp6l8UN72yp6h6vyfGHA2hUlTlpQbT4o
1BHh+nWdzVqR0Z1JNcGcgAszM/YdKdxVpx0YTcVwRzASJmPptUqTqy0qknJ/E1ABM7Cbhfan8v/ghE3C
+1P5f/AaYvOE+/wCyT+hRl5f9kn9CjDT8jyDpTr1KX7cmjmAwiZj6SJX1w010jWZwbb2yeb4mAFm0z9h2
hd1oLKM3kcQEiZj6dp3dapHRlN5HEAEzM/YXtj2Sn6FEXtj2Sn6Fh6PxvKUh7jztb96fzM9E9x52t+9P5mJa
fk/UNDpCvUp+5No5gjxxMx9JHXrjL3zlUqzqPOcm/U0AJtM/cspuLzi2mdle3EVkqj+pwAItMfUu1S7r1I5S
qPI4gAmZn7Cxwj36voiuLHCPfq+iENMP/SFoVuL+5D1LIrcX9yHqdPbm8JVgAOXzQLY80AB2d1XlBxdR5P
YcQAszM/YE2nmgAjtK6ryi4upJp9xxACzMz9hLw3ta9CIS8N7WvQO8XlC6KTEe2S9EXZSYl2yXoivX+R4op
vCrOm84Sa+poCPBEzH0kdeuPGcqlarVf65tmgDqb2ntMibTzTO8buvBZKo/qcAVImY+neV5XksnNnBvN
5gEJtM/YSsN7XEikrDe1xDrH5QuykxDtci7KTEe1yLL1/k+KKdYXFWmtGE3FcEcgR4tzH079cuPNkOuXHm
yOADrnb26dPV6TpNN6e7M365cebI4AJyn279cuPNkaTuK1SOjOo2uBzAJtb2ErDe1r0ZFJWG9rXoVcfnC
6Z56t+/P1PQs89W/fn6iXq/J+oaAAjwsxk4yTTyaOkrmtOLjKpJp9xyAdRMx9B1jdV4RUY1JJLuOQBEzH0z
JuUm282zAAQLLCPeq+iK0ssI96r6IQ1wecLMPcA9x0+kp7L+Xq/UuCnsv5er9S4JDHD4gAK2QcUpadFTW
+P4Kg9JKKlFxa2NZFDd0HQrOL3f9r4keL8infk4gAjygAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAK2pwdSpGK3tnoacdCnGPBFfhls1/rTXylkWHt/HpqNyAAr0gAAAAAYe5mT
D3MCownttX0f5Lgp8J7bV9H+S4JDLD4hxvOyz9DsYklJNNZplaWjcaebBbzwynKTcZOOfcaaqh5j5E08E4L
qsFpqqPmPkNVQ8x8iaOhdVgtNVQ8x8hqqHmPkNHQuqwWmqoeY+Q1VDzHyGjoXVYLTVUfMfIaqj5j5
FOhdVk3Cu0v5TvqqHmPkSra1p26ehve9sO8eG0WiZdyhvtl5U+LL4jXNnTuHm9kuKDfNSb17KMFpqqHj
Y1VDxsaeXoXVYLTVMPGxqmHjY0nx7qsFpqmHjY1TT8bGj491WC01TDxsaph42NHx7qsm4V2p/KSFhU
PGyVb20LeOUd/ew0x4bRaJlpf9kn9CjPRyipRcWs095CnhlOUtkmkHebFa07hUgtNVQ8bGqoeNhj0LqsF
rqqHjY1VDxsHQuqgWuqoeNjVUPGwdC6qBa6qh42NVQ8bGjoXVRe2PZKfocYYXSjLOUm1wJsUopJbkIb
4cVqTuWXuPO1v35/Mz0REuLClXm57Yye9oOs2Obx2UoLXVUPGxqqn42NPL8e6qBa6qp+NjVVPxsaPj3
VQLXVVPxsaqp+NjR8e6qBa6qp+NjVVPxsaX491UWOEe9U9EdNVU/GyZQowoQ0YLLiGmLDatty6Fbi/u
w9SyOdajCtDRms0V6cleVdPPAtdVQ8bGqoeNk08XQuqgWuqoeNjVUPGxo+PdVAtdVQ8bGqoeNjR8e6
qBa6qh42NVQ8bGj491UC11VDxsaqh42NHQuqiXhva16ErVUPGyTb2tO3zcdre9sO8eG0WiZdykxLtkvR
F2R7i0p3G2WyS3NFejLSb11CiBa6rj5jGq4eY+RNPJ8e6qBa6qj5j5DVUfMfIHQuqgWuqo+Y+Q1VHzHyB
0LqoFrqqPmPkNVR8x8gdC6qJWG9rjkS9VQ8x8iRbWtO3T0dre9sO6YLRaJlIKTEe1y9C7I9zaU7jJy2Nd6K
3zUm9dQogWuq4eN8hquHjZHl6F1UC11XDxsarh42DoXVQLXVcPGxquHjY0dC6qBa6rh42NVw8bGjoX
VRLw1Z3a9GStVw8bJNta07fPR2t94dY8NotEy7dx5+vsrz9T0JEuLCnWnp+7J78g3zUm8dlKC11VDxvkNV
Q8b5DTzdC6qBa6qh43yGqoeN8ho6F1UC11VDxvkNVQ8b5DR0LqoFrqqHjfIaqh43yGj491UWWEe9V+
hvqqHjfIl0KEKENGCyGmmLDatty6h7gHuK9insv5er9S4Key/l6v1LgkMcPiAArYONzbxuIaMlt7nwOwCTE
TGpefr287eeU08u59zOR6OpTjUi4zSa+JXXGGd9F/Rk08WTBMd6q0HadpXp+9TeXFHPQl4XyDCazH6ag
20JeF8hoS8L5ETUtQbaEvC+Q0JeF8galqDbQl4XyGhLwvkDUtQbaEvC+Q0JeF8galqDbQl4XyGhLwvkDUt
QbaEvC+Q0JeF8galqDbQl4XyGhLwvkDUtQbaEvC+Q0JeF8galqDbQl4XyGhLwvkDUtQbaEvC+Q0JeF8ga
lqDbQl4XyGhLwvkDUtQbaEvC+Q0JeF8galqDbQl4XyGhLwvkDUtQbaEvC+Q0JeF8galqDbQl4XyGhLwvk
DUtQbaEvC+Q0JeF8galqDbQl4XyGhLwvkDUtQbaEvC+Q0JeF8galqDbQl4XyGhLwvkDUtQbaEvC+Q0JeF
8galqDbQl4XyGhLwvkDUtQbaEvC+Q0JeF8galqDbQl4XyGhLwvkDUtQbaEvC+Q0JeF8galqDbQl4XyGhL
wvkDUtQbaEvC+Q0JeF8galqDbQl4XyGhLwvkDUtQbaEvC+Q0JeF8galqDbQl4XyGhLwvkDUtQbaEvC+Q
0JeF8galqDbQl4XyGhLwvkDUtQbaEvC+Q0JeF8galqDbQl4XyGhLwvkDUtQbaEvC+Q0JeF8galqDbQl4Xy
GhLwvkDUtQbaEvC+Q0JeF8galqDbQl4XyGhLwvkDUtQbaEvC+Q0JeF8galqDbQl4XyGhLwvkDUtQbaEv
C+Q0JeF8galqDbQl4XyGhLwvkDUtQbaEvC+Q0JeF8galqDbQl4XyGhLwvkDUtQbaEvC+Q0JeF8galqDZU
5yeSi2/QkUrCvU3x0V8Q6ilp+oRSdZ2EqklOqso9yfeS7bD6dHKU/1y+JMRXpx4P3ZhJRSSWSRkAr1gAAA
AAAABh7mZMPcwKjCe21fR/kuCnwnttX0f5LgkMsPiAArUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAPcAwKey/l6v1Lgp7L+Xq/UuCQxw+IACtgAAAAAMZLgZAG
MlwGS4GQDTGS4DJcDICahjJcBkuBkA1DGS4DJcDIBqGMlwGS4GQDUMZLgMlwMgGoYyXAZLgZANQxk
uAyXAyAahjJcBkuBkA1DGS4DJcDIBqGMlwGS4GQDUMZLgMlwMgGoYyXAZLgZANQxkuAyXAyAahjJcB
kuBkA1DGS4DJcDIBqGMlwGS4GQDUMZLgMlwMgGoYyXAZLgZANQxkuAyXAyAahjJcBkuBkA1DGS4DJ
cDIBqGMlwGS4GQDUMZLgMlwMgGoYyXAZLgZANQxkuAyXAyAahjJcBkuBkA1DGS4DJcDIBqGMlwGS4
GQDUMZLgMlwMgGoYyXAZLgZANQxkuAyXAyAahjJcBkuBkA1DGS4DJcDIBqGMlwGS4GQDUMZLgMl
wMgGoYyXAZLgZANQxkuAyXAyAahjJcBkuBkA1DGS4DJcDIBqGMlwGS4GQDUMZLgMlwMgGoYyXAZL
gZANQxkuAyXAyAahhJLuMgBQAAAAAAAAAAAAAMPcZAFNhklTxCopvJtNbfUuSuvrBVJOtTloT7/AIkPR
u0slX+5zvTzRacf+dL0FDleef8Af+hleef9/wChyXrfxfAocrzz/v8A0Mrzz/v/AEOR1v4vgUOV55/3/oZXnn/f
+hyOt/F8ChyvPP8Av/QyvPP+/wDQ5HW/i+BQ5Xnn/f8AoZXnn/f+hyOt/F8ChyvPP+/9DK88/wC/9Dkdb
+L4FDleef8Af+hleef9/wChyOt/F8ChyvPP+/8AQyvPP+/9Dkdb+L4FDleef9/6GV55/wB/6HI638XwKHK88
/7/ANDK88/7/wBDkdb+L4FDleef9/6GV55/3/ocjrfxfAocrzz/AL/0Mrzz/v8A0OR1v4vgUOV55/3/AKGV5
5/3/ocjrfxfAocrzz/v/QyvPP8Av/Q5HW/i+BQ5Xnn/AH/oZXnn/f8AocjrfxfAocrzz/v/AEMrzz/v/Q5HW/i+
BQ5Xnn/f+hleef8Af+hyOt/F8ChyvPP+/wDQyvPP+/8AQ5HW/i+BQ5Xnn/f+hleef9/6HI638XwKHK88/w
C/9DK88/7/ANDkdb+L4FDleef9/wChleef9/6HI638XwKHK88/7/0Mrzz/AL/0OR1v4vgUOV55/wB/6GV5
5/3/AKHI638XwKHK88/7/wBDK88/7/0OR1v4vgUOV55/3/oZXnn/AH/ocjrfxfAocrzz/v8A0Mrzz/v/AEO
R1v4vgUOV55/3/oZXnn/f+hyOt/F8ChyvPP8Av/QyvPP+/wDQ5HW/i+BQ5Xnn/f8AoZXnn/f+hyOt/F8Ch
yvPP+/9DK88/wC/9Dkdb+L4FDleef8Af+hleef9/wChyOt/F8ChyvPP+/8AQyvPP+/9Dkdb+L4FDleef9/6G
V55/wB/6HI638XwKHK88/7/ANDK88/7/wBDkdb+L4FDleef9/6GV55/3/ocjrfxfAocrzz/AL/0Mrzz/v8A0
OR1v4vgUOV55/3/AKGV55/3/ocjrfxfAocrzz/v/QyvPP8Av/Q5HW/i+BQ5Xnn/AH/oZXnn/f8AocjrfxfAoc
rzz/v/AEMrzz/v/Q5HW/i+BQ5Xnn/f+hleef8Af+hyOt/F8ChyvPP+/wDQyvPP+/8AQ5HW/i+BQ5Xnn/f+h
leef9/6HI638XwKHK88/wC/9DK88/7/ANDkdb+L4FDleef9/wChleef9/6HI638XwKHK88/7/0Mrzz/AL/0
OR1v4vgUOV55/wB/6GV55/3/AKHI638XwKHK88/7/wBDK88/7/0OR1v4vgUOV55/3/oZXnn/AH/ocjrfx
fAocrzz/v8A0Mrzz/v/AEOR1v4vjEmkm28kUWV55/3/AKMqjdVf0zrLL1Y2db+OuH/rxOpOO2OT2/UuCP
Z2kLWnlF5t72SCw0x1mte7/9k="></figure><p>Constraints</p><p>0<n<100</p><p>0<arr<
1000</p><p>Input Format </p><p> -First line will contain the number of
elements present in the array.<br> -Second line will contain the elements of
array</p><p>Output Format<br><strong> </strong>-Output contain only one
that space separated integers in reverse order.</p><p> </p>
answer
#include<iostream>
int n,i;
cin>>n;
int arr[n];
for(i=0;i<n;i++)
cin>>arr[i];
for(i=0;i<n/2;i++)
int temp;
temp=arr[i];
arr[i]=arr[n-1-i];
arr[n-1-i]=temp;
for(int i=0;i<n;i++)
cout<<arr[i]<<" ";
return 0;
question
#include <iostream>
for(int i=d;i<n;i++)
cout<<arr[i]<<" ";
for(int i=0;i<d;i++)
cout<<arr[i]<<" ";
return 1;
for(int i=n-d;i<n;i++)
cout<<arr[i]<<" ";
for(int i=0;i<n-d;i++)
cout<<arr[i]<<" ";
return 1;
int main()
int n,d;
char c;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
cin>>d;
int z;
z=d%n;
cin>>c;
if(c=='L')
rotLeft(arr,n,z);
else
rotRight(arr,n,z);
return 0;
question
<p>Problem Description:<br>How many Y's did a Roman Centurion make a day in cold hard Lira?
About a C's worth! Turns out, Martians gave Rome the idea for their number system. Use the
conversion charts below to help translate some Martian numbers!<br><br>Note, that unlike the
Roman Numerals, Martian Numerals reuse symbols to mean different values. B can either mean '1'
or '100' depending on where it appears in the number sequence.<br><br>Input Format:<br>You will
receive a list of numbers in a data file, one number per line, up to 5 lines at a time (with a minimum
of 1 line). No number will exceed 1000, or be less than 1.<br><br>Output Format:<br>Print the
output in a separate lines contains convert the numbers from Arabic (1,2,3...10...500...1000) to
Martian (B,BB,BBB...Z...G...R)<br>numerals.</p>
answer
#include <bits/stdc++.h>
int i=12;
while(number>0)
number = number%num[i];
while(div--)
cout<<sym[i];
}
i--;
int main()
int number,n2,n3,n4,n5;
cin>>number>>n2>>n3>>n4>>n5;
print(number);
cout<<endl;
print(n2);
cout<<endl;
print(n3);
cout<<endl;
print(n4);
cout<<endl;
print(n5);
return 0;
question
answer
#include <bits/stdc++.h>
int main()
cout<<"1 ";
cout<<"0 ";
cout<<"1 \n";
cout<<"1 ";
return 0;
cout<<"for(i=1;i<=rows;i++)";
question
#include <stdio.h>
int main()
int i,j,k,N;
scanf("%d",&N);
for(i=1;i<=N;i++)
if(i%2==0)
k=2;
else
k=1;
printf("\n");
return 0;
question
<p>Problem Description:<br>Simon work with Greek squares and matrix traces.<br><br>The trace
of a square matrix is the sum of the values on the main diagonal (which runs from the upper left to
the lower right).<br><br>An B-by-B square matrix is a Greek square if each cell contains one of B
different values, and no value is repeated within a row or a column. In this problem, we will deal
only with "beautiful Greek squares" in which the B values are the integers between 1 and
B.<br><br>Given a matrix that contains only integers between 1 and B, we want to compute its trace
and check whether it is a beautiful Greek square. To give some additional information, instead of
simply telling us whether the matrix is a beautiful Greek square or not, show the number of rows
and the number of columns that contain repeated values.<br><br>Constraints:<br>1 ≤ T ≤ 100.<br>2
≤ B ≤ 100.<br>1 ≤ Ai,j ≤ B, for all i, j.<br><br>Input Format:<br>The first line of the input gives the
number of test cases, T. T test cases follow. Each starts with a line containing a single integer B: the
size of the matrix to explore. Then, B lines follow. The i-th of these lines contains B integers Ai,1, Ai,2
..., Ai,B. Ai,j is the integer in the i-th row and j-th column of the matrix.<br><br>Output
Format:<br>Print the output in a single lines contains the number of rows and the number of
columns that contain repeated values.</p><p> </p><p>Explanation
:</p><h3> </h3><figure
class="table"><table><tbody><tr><td>Input <br> </td><td>Output <br> <
/td></tr><tr><td><p>3
</p><p>4
</p><p>1 2 3 4
</p><p>2 1 4 3
</p><p>3 4 1 2
</p><p>4 3 2 1
</p><p>4
</p><p>2 2 2 2
</p><p>2 3 2 3
</p><p>2 2 2 3
</p><p>2 2 2 2
</p><p>3
</p><p>2 1 3
</p><p>1 3 2
</p><p>1 2 3
</p></td><td><p>Case #1: 4 0 0
</p><p>Case #2: 9 4 4
</p><p>Case #3: 8 0 2
answer
#include <bits/stdc++.h>
int t,i,j,tes,n,x,y,sum;
int a[1007][1007];
map<int,bool> udah;
void solve(){}
int main() {
solve();
scanf("%d",&t);
scanf("%d",&n);
scanf("%d",&a[i][j]);
sum = 0;
x = 0;
y = 0;
udah.clear();
if (udah[a[i][j]]) x++, j = n;
udah[a[i][j]] = true;
}
}
udah.clear();
if (udah[a[i][j]]) y++, i = n;
udah[a[i][j]] = true;
printf("%d %d %d\n",sum,x,y);
return 0;
question
<p>Problem Description:<br>For some reason, your school's football team has chosen to spell out
the numbers on their jerseys instead of using the usual digits. Being great fans, you're going to be
ready to cheer for your favorite players by bringing letter cards so you can spell out their number.
Each fan has different favorites, so they each need to bring different sets of letters.<br><br>The
English spellings for the numbers 0 to 12 are:<br>ZERO ONE TWO THREE FOUR FIVE SIX<br>SEVEN
EIGHT NINE TEN ELEVEN TWELVE<br><br>Input Format:<br>Read a set of integers from 0 to 12,
separated by spaces, representing one fan's favorite players. The last integer will be 999, marking
the end of the line.<br><br>Output Format:<br>Print the same numbers, then a period and a space.
Then, in alphabetical order, print all the letters the fan needs to be able to spell any one of the jersey
numbers provided</p>
answer
#include <bits/stdc++.h>
int main()
int curr;
multiset<char> mp;
string names[] =
{"","ONE","TWO","THREE","FOUR","FIVE","SIX","SEVEN","EIGHT","NINE","TEN","ELEVEN","TWELVE"
};
while(cin>>curr){
if(curr==999){
cout<<"0999"<<'.'<<' ';
break;
cout<<curr<<' ';
if(curr>12)continue;
for(auto ch:now){
mp.insert(ch);
cout<<ch<<' ';
return 0;
printf("char nums[13][256]for(n=0;n<26;n++)");
question
answer
#include<stdio.h>
LLU min_smoke[100][100];
int color[100][100];
int i,j,l;
for(i=0;i<n;i++){
for(j=0;j<n;j++){
min_smoke[i][j]=10000000000000000;
for(i=0;i<n;i++){
min_smoke[i][i] = 0;
for(l=2;l<=n;l++){
int e = n-l;
for(i=0;i<=e;i++){
int k = i+l-1;
for(j=i;j<k;j++){
if(sm<min_smoke[i][k]){
min_smoke[i][k] = sm;
color[i][k] = cl;
return min_smoke[0][n-1];
int main(void){
int n;
while(scanf("%d",&n)!=EOF){
int i;
for(i=0;i<n;i++){
scanf("%d",&(color[i][i]));
printf("%llu\n",smoke(n));
return 0;
printf("scount[100][100]colours[100]");
question
answer
#include <bits/stdc++.h>
return 1;
}*/
int main()
int n;
cin>>n;
int array[n];
for(int i=0;i<n;i++)
cin>>array[i];
int sum;
cin>>sum;
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
count++;
cout<<"["<<array[i]<<" "<<array[j]<<"]"<<endl;
//getPairsCount(arr, n, sum);
//return 0;
question
<p>Problem Description:<br>Good news! Suresh get to go to America on a class trip! Bad news, he
don't know how to use the Dollar which is the name of the American cash system. America uses
coins for cash a lot more than the Kuwait does. Dollar comes in coins for values of: 1, 2, 10, 50, 100,
& 500 To practice your Dollar skills, suresh have selected random items from Amazon.co.us and
put them into a list along with their prices in Dollar. Suresh now want to create a program to check
suresh Dollar math.<br><br>Suresh goal is to maximize your buying power to buy AS MANY items as
you can with your available Dollar.<br><br>Input Format:<br>File listing 2 to 6 items in the format
of:<br><br>ITEM DDDDD<br>ITEM = the name of the item you want to buy<br>DDDDD = the price
of the item (in Dollar)<br><br>Output Format:<br>Print the output in a separate lines contains, List
the items suresh can afford to buy. Each item on its own line. Suresh goal is to buy as many items as
possible. If suresh can only afford the one expensive item, or 2 less expensive items on a list, but not
all three, then list the less expensive items as affordable. If suresh cannot afford anything in the list,
output "I need more Dollar!" after the items. The final line you output should be the remaining
Dollar he will have left over after make purchases.</p>
answer
#include <bits/stdc++.h>
int main()
{ int money,n;
cin>>money>>n;
int price;
string name;
map<int,string> mp;
map<string,bool> mp1;
vector<string> vecs;
cin>>name>>price;
vecs.push_back(name);
mp.insert({price,name});
price = money;
for(auto pr:mp)
if(pr.first<=money){
money-=pr.first;
mp1[pr.second] = true;
else
mp1[pr.second] = false;
for(auto s:vecs)
if(mp1[s])
else
if(price!=money) cout<<money;
question
answer
#include <bits/stdc++.h>
void mandatoriesSuck(){
int main()
int n,t;cin>>n;
int arr[n];
cin>>arr[i];
cin>>t;
cout<<"Linked List:";
if(arr[i]==t)continue;
cout<<"->"<<arr[i];
return 0;
question
answer
#include <bits/stdc++.h>
int main()
sort(v.begin(),v.end());
return 0;
question
#include <iostream>
struct n
int data;
struct n *next;
n *p = new n;
p->data = data;
p->next = NULL;
tt->next = p;
tt = p;
void oodd()
odd = h;
int i = 1;
if ((i % 2))
i++;
odd = odd->next;
}
void eeven()
even = h;
int i = 1;
if (!(i % 2))
i++;
even = even->next;
while (h != NULL)
h = h->next;
int main()
{
int a;
cin >> a;
tt = new n;
tt->data = 1;
tt->next = NULL;
h = tt;
insert(i);
n *y = h;
display(y);
oodd();
eeven();
return 0;
question
answer
#include<iostream>
void del(){
int main()
cin>>n;
int a[n];
for(i=0;i<n;i++){
cin>>a[i];
cin>>x;
for(i=0;i<n;i++){
if(a[i]==x){
count++;
break;
if(count==1){
cout<<"Linked List:";
for(int k=0;k<i+1;k++)
cout<<"->"<<a[k];
else{
cout<<"->"<<a[i];
return 0;
question
answer
#include <bits/stdc++.h>
struct node
int data;
int n;
int in_pos(int n)
int data1;
cin>>data1;
int i =1;
while(i != n-1)
r = r-> next;
i++;
node *s = head;
cout<<"Linked List:";
while(s != NULL)
cout<<"->";
cout<<s-> data;
s = s-> next;
return data1;
void create()
int n;
cin>>n;
struct node *p = new node;
int __n;
cin>>__n;
head = p;
int i;
for(i=0;i<n-1;i++)
int a;
cin>>a;
q -> data = a;
p -> next= q;
p = p->next;
int main()
create();
int r;
cin>>r;
int s = in_pos(r);
return 0;
cout<<s<<"for(i=0;i<n;i++)";
question
answer
#include <iostream>
void tel(){
return;}
struct node {
int data;
node *next;
}*head = NULL;
void create(){
int n;
cin >> n;
int m;
cin >> m;
p1->data = m;
head = p1;
int i;
int a;
cin >> a;
tt->data = a;
p1->next = tt;
p1=p1->next;
p1->next = NULL;
int del;
nn = nn->next;
int m = del;
dd = dd->next;
if (dd == NULL) {
nn->next = NULL;
found = true;
break;
if (found)
break;
head = head->next;
int main(){
create();
return 0;
question
answer
#include<bits/stdc++.h>
struct node {
int data;
node *next;
};
new_node->data = new_data;
new_node->next = NULL;
if (*head_ref == NULL) {
*head_ref = new_node;
return;
last->next = new_node;
return;
int main() {
int n,c,z,i;
cin>>n;
for(i=0;i<n;i++){
cin>>c;
insertAtEnd(&head,c);
cin>>z;
for(int i=0;i<z;i++)
head=head->next;
node* node=head;
while(node!=NULL){
cout<<"->"<<node->data;
node=node->next;
return 0;
cout<<"void create()";
/*#include <stdio.h>
#include <stdlib.h>
struct node
}*stnode;
head = head->nextptr;
free(ptr);
return head;
new_node->num = new_data;
new_node->nextptr = NULL;
if (*head_ref == NULL)
*head_ref = new_node;
return;
last = last->nextptr;
last->nextptr = new_node;
return;
int main()
int n,i,t;
scanf("%d", &n);
for(i=0;i<n;i++)
scanf("%d",&t);
append(&stnode,t);
scanf("%d",&n);
for(i=0;i<n;i++)
//displayList();
stnode=deleteFirst(stnode);
printf("Linked List:");
printList(stnode);
return 0;
{
while (node != NULL)
printf("->%d", node->num);
node = node->nextptr;
*/
/*#include <stdio.h>
#include <stdlib.h>
struct Node
int data;
};
new_node->data = new_data;
new_node->next = NULL;
if (*head_ref == NULL)
*head_ref = new_node;
return;
last = last->next;
last->next = new_node;
return;
}
void printList(struct Node *node)
printf("->%d", node->data);
node = node->next;
head = head->next;
free(ptr);
return head;
int main()
int n,i,t,k;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&t);
append(&head,t);
scanf("%d",&k);
for(i=0;i<k;i++)
head=deleteFirst(head);
printf("Linked List:");
printList(head);
return 0;
}*/
question
<p>Question description</p><p>saran, subash, and Yasir alias Pari are three first-year engineering
students of the State Technical Institution (STI), India. While saran and subash are average students
who come from a Middle class, Yasir is from a rich family. saran studies, engineering as per his
father's wishes, while subash, whose family is poor, studies engineering to improve his family's
financial situation. <br><br>Yasir, however, studies engineering of his simple passion for
developing android applications. </p><p>Yasir is participating in a hackathon for android
application development. the task is Insertion in a Doubly Linked list at
beginig.</p><p> </p><p>Functional Description:</p><p>In the doubly linked list, we would
use the following steps to insert a new node at the beginning of the doubly linked
list.</p><ul><li>Create a new node</li><li>Assign its data value</li><li>Assign newly created node’s
next ptr to current head reference. So, it points to the previous start node of the linked list
address</li><li>Change the head reference to the new node’s address.</li><li>Change the next
node’s previous pointer to new node’s address (head
reference)</li></ul><p> </p><p>Constraints</p><p>0<N<100</p><p>0<arr<1000</
p><p>Input Format</p><p>First line indicates the number of elements N to be inserted in
array</p><p>Second line indicates the array elements according to the N</p><p>Output
Format</p><p>First line represents the doubly linked list in forward direction</p><p>Second Line
represents the doubly linked list in backward direction</p><p> </p>
answer
#include <bits/stdc++.h>
void don(){
int main()
{int n;cin>>n;
std::vector<int>v(n) ;
cin>>v[i];
cout<<endl;
cout<<v[i]<<' ';
return 0;
question
answer
#include <bits/stdc++.h>
void MandatoriesSuck(){
int main()
cin>>n;
int arr[n];
cin>>arr[i];
cin>>x;
if(arr[i]==x){
ind = i;
break;
if(ind==-1){
ind = 0;
cout<<"Linked List:";
cout<<"->"<<arr[i];
return 0;
question
<p><strong>Question description</strong></p><p>Admission for the current Academic year is
happening in Most of the Universities across the Country. </p><p>Once the Students got
admitted they are assigned a unique Registration Number. </p><p>Admission in charges used
to assign give these details in some order. </p><p>But during enrolment of the student there
is a specific entrance test for admitted students to get scholarship. </p><p>now admission
cell conducting a test. So your task is generate a program for a singly linked list, find middle of
the linked list.<br><br>If there are even nodes, then print second middle
element.</p><p><br><strong>For example, </strong></p><p>if given linked list is 1->2-
>3->4->5 then </p><p>output should be 3.</p><p><br>If there are even
nodes, </p><p>then there would be two middle nodes, we need to print second middle
element.<br>For example, if given linked list is 1->2->3->4->5->6
then </p><p>output should be
4.<br> </p><p><strong>Constraints </strong></p><p>1< N < 1000</p><p>1<
X < 1000</p><p><br><strong>Input Format</strong><br>First line contains the number of
datas- N.<br>Second line contains N integers(the given linked list).</p><p><br><strong>Output
Format</strong><br>First Line indicates the linked list</p><p>second line indicates the middle
element of the linked list.</p>
answer
#include <bits/stdc++.h>
void MandatoriesSuck(){
class Node {
public:
int data;
Node* next;
Node(int dat){
data = dat;
next = NULL;
};
Node* insertNode(Node* head, int data){
if(head==NULL){
if(head->next==NULL){
return head;
insertNode(head->next,data);
return head;
if(head==NULL){
return;
printNode(head->next);
cout<<"-->"<<head->data;
int main()
int n,temp,mid;cin>>n;
cin>>temp;
head = insertNode(head,temp);
cout<<"Linked list:";
printNode(head);
question
</p><p><strong>push(s, x) </strong>
</p><p><strong>pop(s)</strong>
answer
#include <bits/stdc++.h>
int main()
int n,m,temp;cin>>n>>m;
stack<int> stk;
for (int i = 0; i < n; i++) {
cin>>temp;
stk.push(temp);
return 0;
question
answer
#include <stdio.h>
int main(){
int num,i,count=0,a[100001],stck[100001],top=-1;
scanf("%d", &num);
for (i=0;i<num;i++) {
scanf("%d",&a[i]);
top--;
count++;
if (top!=-1) {
count++;
stck[++top]=a[i];
printf("%d",count);
return 0;
question
answer
#include <bits/stdc++.h>
int main()
string s,temp="";
cin>>s;
stack<string> stk;
if(s[i]==47||s[i]==92){
if(!temp.empty()){
stk.push(temp);
temp.clear();
else{
temp.push_back(s[i]);
while(!stk.empty()){
cout<<stk.top();
stk.pop();
return 0;
question
answer
#include <bits/stdc++.h>
int v[1000001];
void don(){
int main()
int n, i, x;
sci(n);
cnt[st.top()] = st.top() - i;
st.pop();
}
st.push(i);
while (!st.empty()) {
cnt[st.top()] = st.top();
st.pop();
x = i - st.top() + 1;
st.pop();
st.push(i);
int k = 0;
k += v[i];
return 0;
question
answer
#include <bits/stdc++.h>
#include<iostream>
#include<string.h>
stack<char> s;
char x;
int y = xi.length();
s.push(xi[i]);
continue;
if(s.empty())
return false;
switch(xi[i]){
s.pop();
break;
s.pop();
break;
s.pop();
break;
return (s.empty());
int main()
string expr;
cin>>expr;
if(areBrBalanced(expr))
cout<<"Balanced";
else
cout<<"Not Balanced";
return 0;
question
answer
#include <iostream>
#include <stack>
bool isOperator(char x)
switch (x) {
case '+':
case '-':
case '/':
case '*':
return true;
return false;
}
stack<string> s;
if (isOperator(pre_exp[i]))
s.pop();
s.pop();
s.push(temp);
else {
s.push(string(1, pre_exp[i]));
return s.top();
int main()
string pre_exp;
cin>>pre_exp;
return 0;
question
<p><strong>Question description</strong></p><p>Hassan enjoys jumping from one building
to the next. However, he merely jumps to the next higher building and stops when there are none
accessible. The amount of stamina necessary for a voyage is equal to the xor of all the heights
Hassan leaps till he comes to a halt.</p><p>If heights are [1 2 4], and he starts from 1, goes to
2 stamina required is <math
xmlns="http://www.w3.org/1998/Math/MathML"><mn>1</mn><mo>⊕</mo><mn>2</mn><mo>=
</mo><mn>3</mn></math>, then from 2 to 3. Stamina for the entire journey is <math
xmlns="http://www.w3.org/1998/Math/MathML"><mn>1</mn><mo>⊕</mo><mn>2</mn><mo>
⊕</mo><mn>4</mn><mo>=</mo><mn>7</mn></math>. Find the maximum stamina required if
can start his journey from any building.</p><p><strong>Constraints</strong></p><p>1≤ N
≤10^5</p><p>1 ≤ Hight ≤10^9</p><p><strong>Input</strong></p><p>First line: <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>N</mi></math>, no of
buildings.</p><p>Second line: <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>N</mi></math><i> </i>integers,
defining heights of buildings.</p><p><strong>Output</strong></p><p>Single Integer is the
maximum stamina required for any journey.</p><p> </p>
answer
#include <stdio.h>
int main() {
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&arr[i]);
st[n-1] = arr[n-1];
temp = arr[n-1];
for(i=n-2;i>=0;i--) {
for(j=i+1;j<n;j++)
if(arr[i]<arr[j]) {
st[i]=arr[i]^st[j];
break;
if(st[i] == 0)
st[i] = arr[i];
if(st[i] > temp)
temp = st[i];
printf("%d",temp);
return 0;
question
answer
#include <iostream>
class node {
public:
int data;
node* next;
};
class mystack {
public:
node* head;
node* tail;
mystack()
head = NULL;
tail = NULL;
};
mystack* create()
return ms;
temp->data = data;
temp->next = ms->head;
if (ms->head == NULL)
ms->tail = temp;
ms->head = temp;
if (ms->head == NULL) {
return 0;
else {
delete temp;
return popped;
if (ms1->head == NULL)
ms1->head = ms2->head;
ms1->tail = ms2->tail;
return;
ms1->tail->next = ms2->head;
ms1->tail = ms2->tail;
temp = temp->next;
int main()
int n,m,t;
cin>>n>>m;
for(int i=0;i<n;i++)
cin>>t;
push(t,ms1);
for(int i=0;i<m;i++)
cin>>t;
push(t,ms2);
merge(ms1, ms2);
for(int i=0;i<n+m;i++)
cout<<pop(ms1)<<" ";
question
<p><strong>Question description</strong></p><p><a
href="http://en.wikipedia.org/wiki/Stack_(abstract_data_type)#The_Stock_Span_Problem">The
stock span problem</a> is a financial problem where we have a series of n daily price quotes for a
stock and we need to calculate span of stock’s price for all n days. <br>The span Si of the
stock’s price on a given day i is defined as the maximum number of consecutive days just before the
given day, for which the price of the stock on the current day is less than or equal to its price on the
given day. <br>For example, if an array of 7 days prices is given as {100, 80, 60, 70, 60, 75,
85}, </p><p>then the span values for corresponding 7 days are {1, 1, 1, 2, 1, 4,
6} </p><figure class="image"><img src="https://media.geeksforgeeks.org/wp-
content/uploads/Stock_span.png"></figure><p><strong>Constraints</strong></p><p>0<n<100
0</p><p>0<price[i]<1000000</p><p><strong>Input Format:</strong></p><p>First line
indicates the number of days</p><p>second line indicates the price quoted for above mentioned
days</p><p><strong>Output Format:</strong></p><p>Single line represents the span values for
corresponding days</p>
answer
#include <bits/stdc++.h>
int n;cin>>n;
cin>>arr[i];
int j = i-1;
while(arr[i]>arr[j]) j--;
cout<<i-j<<' ';
return 0;
question
answer
#include <bits/stdc++.h>
int getPriority(char C)
if (C == '-' || C == '+')
return 1;
return 2;
else if (C == '^')
return 3;
return 0;
int l = infix.size();
stack<char> char_stack;
string output;
if (isalpha(infix[i]) || isdigit(infix[i]))
output += infix[i];
// If the scanned character is an
char_stack.push('(');
output += char_stack.top();
char_stack.pop();
char_stack.pop();
// Operator found
else
if (isOperator(char_stack.top()))
if(infix[i] == '^')
output += char_stack.top();
char_stack.pop();
}
}
else
output += char_stack.top();
char_stack.pop();
char_stack.push(infix[i]);
while(!char_stack.empty()){
output += char_stack.top();
char_stack.pop();
return output;
/* Reverse String
* Get Postfix
* Reverse Postfix * */
int l = infix.size();
// Reverse infix
reverse(infix.begin(), infix.end());
if (infix[i] == '(') {
infix[i] = ')';
i++;
infix[i] = '(';
i++;
// Reverse postfix
reverse(prefix.begin(), prefix.end());
return prefix;
// Driver code
int main()
string s;
cin>>s;
return 0;
}
question
answer
#include<bits/stdc++.h>
int main() {
int i;
string s; cin>>s;
vector<int> v;
vector<int> a[26];
int n= s.size();
for(i=0;i<=n;i++) {
if (s[i] == '#')
v.push_back(i);
else
a[s[i]-'a'].push_back(i);
v.push_back(j);
string ans;
int j = v[v[0]];
while(s[j] != '#') {
ans += s[j];
j = v[j];
cout<<ans;
return 0;
question
answer
#include <stdio.h>
#include <string.h>
#define N 1000000
#define A 26
int main() {
int n, i, p, a, b, c;
scanf("%s", cc);
n = strlen(cc);
for(i=0;i<n;i++) {
a = cc[i] - 'A';
kk[a]++;
if (n < kk[a] * 2 - 1) {
printf("-1\n");
return 0;
p = -1;
a = 0;
a++;
b = 0;
b = c;
kk[a]--;
cc[i] = a + 'A';
p = a;
printf("%s\n", cc);
return 0;
}
question
answer
#include <stdio.h>
#include <stdlib.h>
struct node
int data;
};
printf("%d",ptr->data);
void enqueue(int d)
if(new_n==NULL){
printf("Queue is Full");
else{
new_n->data = d;
new_n->next = NULL;
if(front==NULL){
front=rear=new_n;
else{
rear->next = new_n;
rear=new_n;
int dequeue()
if(front==NULL){
printf("Queue is Empty\n");
else{
front = front->next;
val = ptr->data;
free(ptr);
return val;
int main()
int n,i,t;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&t);
enqueue(t);
linkedListTraversal(front);
linkedListTraversal(front);
return 0;
question
#include <stdio.h>
#define N 500000
#define MD 1000000007
int main() {
int i, k, c, kc;
scanf("%s", cc);
k = 0;
for(i=0;cc[i];i++) {
c = cc[i] - 'a';
kc = kk[c];
kk[c] = k + 1;
return 0;
question
answer
#include <stdio.h>
#include <stdlib.h>
unsigned pageNumber;
} QNode;
unsigned count;
unsigned numberOfFrames;
} Queue;
int capacity;
QNode* *array;
} Hash;
temp->pageNumber = pageNumber;
return temp;
queue->count = 0;
queue->numberOfFrames = numberOfFrames;
return queue;
hash->capacity = capacity;
int i;
hash->array[i] = NULL;
return hash;
}
return;
if (queue->front == queue->rear)
queue->front = NULL;
queue->rear = queue->rear->prev;
if (queue->rear)
queue->rear->next = NULL;
free( temp );
queue->count--;
}
void Enqueue( Queue* queue, Hash* hash, unsigned pageNumber )
if ( AreAllFramesFull ( queue ) )
deQueue( queue );
temp->next = queue->front;
if ( isQueueEmpty( queue ) )
else
queue->front->prev = temp;
queue->front = temp;
queue->count++;
reqPage->prev->next = reqPage->next;
if (reqPage->next)
reqPage->next->prev = reqPage->prev;
if (reqPage == queue->rear)
queue->rear = reqPage->prev;
queue->rear->next = NULL;
reqPage->next = queue->front;
reqPage->prev = NULL;
reqPage->next->prev = reqPage;
queue->front = reqPage;
int main()
int i,n,m,x;
scanf("%d %d",&n,&m);
Queue* q = createQueue( m );
for(i=0;i<n;i++){
scanf("%d",&x);
ReferencePage( q, hash, x);
return 0;
question
answer
#include <stdio.h>
#include <stdlib.h>
struct node
int data;
}*front=NULL,*rear=NULL;
ptr = ptr->next;
n->data = data;
n->next = NULL;
if(front==NULL){
front=rear=n;
else{
rear->next = n;
rear=n;
void dequeue()
struct node* t;
t = front;
front = front->next;
free(t);
int main()
int n,i,data;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&data);
enqueue(data);
printf("Dequeuing elements:");
for(i=0;i<n;i++){
dequeue();
printf("\n");
linkedListTraversal(front);
return 0;
printf("for(i=front;i<=rear;i++)");
question
<p><strong>Question description</strong></p><p>A
<strong>positive</strong> integer <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>X</mi></math> has been stolen. But
luckily, <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>N</mi></math> hints are available,
each described by two integers <math
xmlns="http://www.w3.org/1998/Math/MathML"><msub><mi>a</mi><mi>i</mi></msub></math>
and <math
xmlns="http://www.w3.org/1998/Math/MathML"><msub><mi>d</mi><mi>i</mi></msub></math>
, meaning that <math xmlns="http://www.w3.org/1998/Math/MathML"><mrow class="MJX-
TeXAtom-ORD"><mo
stretchy="false">|</mo></mrow><mi>X</mi><mo>−</mo><msub><mi>a</mi><mi>i</mi></msub>
<mrow class="MJX-TeXAtom-ORD"><mo
stretchy="false">|</mo></mrow><mo>=</mo><msub><mi>d</mi><mi>i</mi></msub></math>.
The hints are numbered <math
xmlns="http://www.w3.org/1998/Math/MathML"><mn>1</mn></math> through <ma
th xmlns="http://www.w3.org/1998/Math/MathML"><mi>N</mi></math>. While some of those
hints are helpful, some might be just a lie. Therefore, we are going to investigate the
number <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>X</mi></math> under different
possible scenarios.</p><p>Initially, we neither trust nor distrust any hint. That is, each hint may be
either true or false. Then, in each of the <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>Q</mi></math> stages, we will
either:</p><p> 1 id</p><ul><li>Entrust the <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>i</mi><mi>d</mi></math>-th hint (<math
xmlns="http://www.w3.org/1998/Math/MathML"><mn>1</mn><mo>≤</mo><mi>i</mi><mi>d</m
i><mo>≤</mo><mi>N</mi></math>). That is, from now on, the <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>i</mi><mi>d</mi></math>-th hint must be
true unless declared otherwise in the future</li></ul><p>2 id</p><ul><li>Distrust the <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>i</mi><mi>d</mi></math>-th hint (<math
xmlns="http://www.w3.org/1998/Math/MathML"><mn>1</mn><mo>≤</mo><mi>i</mi><mi>d</m
i><mo>≤</mo><mi>N</mi></math>). That is, from now on, the <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>i</mi><mi>d</mi></math>-th hint must be
false unless declared otherwise in the future.</li></ul><p>3 id</p><ul><li>Neutralize
the <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>i</mi><mi>d</mi></math>-th hint (<math
xmlns="http://www.w3.org/1998/Math/MathML"><mn>1</mn><mo>≤</mo><mi>i</mi><mi>d</m
i><mo>≤</mo><mi>N</mi></math>). That is, from now on, the <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>i</mi><mi>d</mi></math>-th hint may be
either true or false unless declared otherwise in the future.</li></ul><p>After each stage, you
should determine the number of possible positive values <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>X</mi></math> and report such
values in increasing order. If there are infinitely many such values, print <math
xmlns="http://www.w3.org/1998/Math/MathML"><mo>−</mo><mn>1</mn></math> instea
d.</p><p><strong>Constraints</strong></p><p><math
xmlns="http://www.w3.org/1998/Math/MathML"><mn>1</mn><mo>≤</mo><mi>N</mi><mo>,</
mo><mi>Q</mi><mo>≤</mo><mn>200</mn><mspace
width="thinmathspace"> </mspace><mn>000</mn></math></p><p><math
xmlns="http://www.w3.org/1998/Math/MathML"><mn>0</mn><mo>≤</mo><msub><mi>a</mi><
mi>i</mi></msub><mo>,</mo><msub><mi>d</mi><mi>i</mi></msub><mo>≤</mo><msup><mn>
10</mn><mn>9</mn></msup></math></p><p><math
xmlns="http://www.w3.org/1998/Math/MathML"><mn>1</mn><mo>≤</mo><mi>t</mi><mo>≤</
mo><mn>3</mn></math> for every stage (update).</p><p><math
xmlns="http://www.w3.org/1998/Math/MathML"><mn>1</mn><mo>≤</mo><mi>i</mi><mi>d</m
i><mo>≤</mo><mi>N</mi></math> for every stage.</p><p>In tests worth 74 points in
total, <math
xmlns="http://www.w3.org/1998/Math/MathML"><msub><mi>a</mi><mi>i</mi></msub><mo>,</
mo><msub><mi>d</mi><mi>i</mi></msub><mo>≤</mo><mn>500</mn><mspace
width="thinmathspace"> </mspace><mn>000</mn></math>.</p><p><strong>Input</strong
></p><p>The first line contains two space-separated integers <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>N</mi></math> and <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>Q</mi></math>.</p><p>The <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>i</mi></math>-th of the
following <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>N</mi></math> lines contains two
space-separated integers <math
xmlns="http://www.w3.org/1998/Math/MathML"><msub><mi>a</mi><mi>i</mi></msub></math>
and <math
xmlns="http://www.w3.org/1998/Math/MathML"><msub><mi>d</mi><mi>i</mi></msub></math>
, describing the <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>i</mi></math>-th hint. It is guaranteed that
no two hints are identical. That is, for every two different <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>i</mi></math>, <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>j</mi></math>, it is guaranteed
that <math
xmlns="http://www.w3.org/1998/Math/MathML"><msub><mi>a</mi><mi>i</mi></msub><mo>≠<
/mo><msub><mi>a</mi><mi>j</mi></msub></math> or <math
xmlns="http://www.w3.org/1998/Math/MathML"><msub><mi>d</mi><mi>i</mi></msub><mo>≠<
/mo><msub><mi>d</mi><mi>j</mi></msub></math>.</p><p>Then, <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>Q</mi></math> lines follow, each
containing two integers <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>t</mi></math> and <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>i</mi><mi>d</mi></math> — the
type of an update and the index of an affected hint.</p><p><strong>Output</strong></p><p>After
each stage, print the number of possible values of <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>X</mi></math> (in case there are
infinitely many of them, print <math
xmlns="http://www.w3.org/1998/Math/MathML"><mo>−</mo><mn>1</mn></math>). If the
number of possible values is finite and non-zero, in the same line, continue to print those values in
increasing order.</p><p>Explanation for sample test case 1:</p><p>In the sample test, we are
given <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>N</mi><mo>=</mo><mn>3</mn></math>
hints and <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>Q</mi><mo>=</mo><mn>10</mn></math
> stages.<br>The first stage is described by a pair "1 1", which represents entrusting
hint <math
xmlns="http://www.w3.org/1998/Math/MathML"><mn>1</mn></math>.<br>After this
stage, <math xmlns="http://www.w3.org/1998/Math/MathML"><mrow class="MJX-
TeXAtom-ORD"><mo
stretchy="false">|</mo></mrow><mi>X</mi><mo>−</mo><mn>3</mn><mrow class="MJX-
TeXAtom-ORD"><mo
stretchy="false">|</mo></mrow><mo>=</mo><mn>0</mn></math> must be true,
so <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>X</mi></math> must be equal
to <math xmlns="http://www.w3.org/1998/Math/MathML"><mn>3</mn></math>. We
report <math
xmlns="http://www.w3.org/1998/Math/MathML"><mn>1</mn></math> possible
value: <math
xmlns="http://www.w3.org/1998/Math/MathML"><mn>3</mn></math>.</p><p>Then, the
information that <math xmlns="http://www.w3.org/1998/Math/MathML"><mrow
class="MJX-TeXAtom-ORD"><mo
stretchy="false">|</mo></mrow><mi>X</mi><mo>−</mo><mn>3</mn><mrow class="MJX-
TeXAtom-ORD"><mo stretchy="false">|</mo></mrow><mo>=</mo><mn>0</mn></math> is
neutralized at stage <math
xmlns="http://www.w3.org/1998/Math/MathML"><mn>2</mn></math>. At this
point, <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>X</mi></math> could be any positive
integer, so we print <math
xmlns="http://www.w3.org/1998/Math/MathML"><mo>−</mo><mn>1</mn></math> in
the second line.</p><p> </p>
answer
#include <stdio.h>
#include <stdlib.h>
int main()
idx[1][i] = 0;
idx[2][i] = 3;
int a, d;
idx[0][i] = a + d;
sol[len] = a + d;
len++;
idx[1][i] = a - d;
sol[len] = a - d;
len++;
sol[i] = 0;
len = 0;
sol[len] = sol[i];
len++;
sol[len] = 0;
if (idx[0][i] == 0){
idx[0][i] = len;
else {
if (idx[1][i] == 0){
idx[1][i] = len;
else{
if (idx[2][id] == 2){
sol2[1][idx[0][id]]--;
sol2[1][idx[1][id]]--;
one++;
queue[qu_rear++] = id;
sol2[0][idx[0][id]]++;
sol2[0][idx[1][id]]++;
if (idx[2][id] == 1){
sol2[0][idx[0][id]]--;
sol2[0][idx[1][id]]--;
one--;
sol2[1][idx[0][id]]++;
sol2[1][idx[1][id]]++;
else if (t == 3){
if (idx[2][id] == 1){
one--;
sol2[0][idx[0][id]]--;
sol2[0][idx[1][id]]--;
sol2[1][idx[0][id]]--;
sol2[1][idx[1][id]]--;
}
}
idx[2][id] = t;
if (one == 0){
printf("-1\n");
else{
answer[0] = -1;
answer[1] = -1;
b = 0;
while (idx[2][queue[front]] != 1) {
front++;
if (idx[1][queue[front]] != len){
answer[b++] = sol[idx[1][queue[front]]];
if (idx[0][queue[front]] != len){
answer[b++] = sol[idx[0][queue[front]]];
if (b > 0){
if (b == 2)
printf("%d", answer[1]);
}
printf("\n");
return 0;}
start = mid - 1;
value = mid + 1;
return -1;
return mid;}
question
answer
#include <stdio.h>
#include <stdlib.h>
struct node
int data;
};
void enqueue(int d)
if(n==NULL){
printf("Queue is Full");
else{
n->data = d;
n->next = NULL;
if(f==NULL){
f=r=n;
else{
r->next = n;
r=n;
int dequeue()
struct node* t;
t = f;
if(f==NULL){
printf("Queue is Empty\n");
else{
f = f->next;
val = t->data;
free(t);
return val;
int main()
int n,i,t;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&t);
enqueue(t);
for(i=0;i<n;i++){
printf("%d\n",dequeue());
return 0;
question
answer
#include <stdio.h>
void enqueue(int);
void display();
int n,data,i;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&data);
enqueue(data);
display();
return 0;
if (rear == SIZE - 1)
printf("Queue is Full!!");
else {
if (front == -1)
front = 0;
rear++;
items[rear] = data;
void display() {
if (rear == -1)
printf("\nQueue is Empty!!!");
else {
int i;
for(i=front;i<=rear;i++)
}
question
answer
#include <stdio.h>
#include <string.h>
#define N 200000
int m = (l + r) / 2, k1 = k * 2 + 1, k2 = k * 2 + 2;
pp[k] = pp[k1];
pp[k] += pp[k2];
qq[k] = qq[k2];
qq[k] += qq[k1];
tr[k] = max(tr[k1], tr[k2]);
if (cc[m - 1] == cc[m])
int m;
if (r - l == 1) {
return;
m = (l + r) / 2;
build(k * 2 + 1, l, m);
build(k * 2 + 2, m, r);
pull(k, l, r);
int m;
if (r - l == 1) {
return;
m = (l + r) / 2;
if (i < m)
update(k * 2 + 1, l, m, i);
else
update(k * 2 + 2, m, r, i);
pull(k, l, r);
}
int main() {
int n, m;
n = strlen(cc);
build(0, 0, n);
while (m--) {
int i;
update(0, 0, n, i);
printf("\n");
return 0;
question
answer
#include<bits/stdc++.h>
int n,q,i,a,b;
cin>>n>>q;
int x[n];
for(i=0;i<n;i++)
cin>>x[i];
while(q--){
int sum=0;
cin>>a>>b;
for(i=a;i<=b;i++)
sum=sum+x[i-1];
cout<<sum<<endl;
question
answer
#include<bits/stdc++.h>
int dp[1005][1005];
int main(){
rep(i,1,n+1){
rep(j,1,n+1){
char x; cin>>x;
while(m--){
return 0;
cout<<"for(i=1;i<=n;i++)";
question
answer
#include <stdio.h>
#define N 200000
#define N_ (1 << 18) /* N_ = pow2(ceil(log2(N))) */
if (r - l == 1) {
tt[k] = aa[l];
return;
m = (l + r) / 2, k1 = k * 2 + 1, k2 = k * 2 + 2;
return INF;
return tt[k];
m = (l + r) / 2;
}
int main() {
int n, q, i, j;
scanf("%d", &aa[i]);
build(aa, 0, 0, n);
while (q--) {
return 0;
question
answer
#include <bits/stdc++.h>
int N, K;
double ans, a, b;
int main(){
a = b = 1.0;
a *= (double) i / K;
b *= (double) (i-1) / K;
ans += (a-b) * i;
printf("%.6f\n", ans);
return 0;
question
answer
#include <stdio.h>
#define N 200000
int n, q, p, i, j, k, tmp;
dd[i] = dd[p] + 1;
pp[0][i] = p;
while(q--) {
tmp = i, i = j, j = tmp;
if (dd[i] != dd[j])
i = pp[k][i];
if (i != j) {
i = pp[k][i];
j = pp[k][j];
i = pp[0][i];
printf("%d\n", i + 1);
}
return 0;
question
answer
#include<bits/stdc++.h>
int fa[1005],fa2[1005],n,m1,m2;
return f[x]==x?x:f[x]=gf(f[x],f);
int main(){
cin>>n>>m1>>m2;
for(int i=1;i<=n;i++)fa[i]=fa2[i]=i;
for(int i=1,x,y;i<=m1;i++)cin>>x>>y,fa[gf(x,fa)]=gf(y,fa);
for(int i=1,x,y;i<=m2;i++)cin>>x>>y,fa2[gf(x,fa2)]=gf(y,fa2);
cout<<n-max(m1,m2)-1<<'\n';
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
if(gf(i,fa)!=gf(j,fa)&&gf(i,fa2)!=gf(j,fa2)){
cout<<i<<' '<<j<<'\n';
fa[gf(i,fa)]=gf(j,fa);
fa2[gf(i,fa2)]=gf(j,fa2);
return 0;
cout<<"while(m1--)";
question
answer
#include <stdio.h>
#include <stdlib.h>
struct node {
int data;
};
void solve(){}
tempNode->data = data;
tempNode->left = NULL;
tempNode->right = NULL;
if(root == NULL) {
root = tempNode;
} else {
current = root;
parent = NULL;
while(1) {
parent = current;
current = current->left;
if(current == NULL) {
parent->left = tempNode;
return;
else {
current = current->right;
if(current == NULL) {
parent->right = tempNode;
return;
if(root != NULL) {
inorder(root->left);
printf("%d ",root->data);
inorder(root->right);
int main() {
solve();
int n,i;
scanf("%d",&n);
int array[n];
for(i=0;i<n;i++)
scanf("%d",&array[i]);
insert(array[i]);
inorder(root);
return 0;
return 0;
question
answer
#include <stdio.h>
#define N 200000
if (r - l == 1)
tr[k] = hh[l];
else {
int m = (l + r) / 2, k1 = k * 2 + 1, k2 = k * 2 + 2;
build(k1, l, m);
build(k2, m, r);
if (r - l == 1) {
tr[k] -= x;
return l;
m = (l + r) / 2, k1 = k * 2 + 1, k2 = k * 2 + 2;
return i;
}
int main() {
int n, m, i;
for(i=0;i<n;i++)
scanf("%d", &hh[i]);
build(0, 0, n);
while (m--) {
int x, i;
scanf("%d", &x);
printf("\n");
return 0;
question
answer
#include <stdio.h>
#define N 200000
#define K 17 /* K = floor(log2(N)) */
struct L {
struct L *next;
int j;
} aa[N];
l->j = j;
struct L *l;
int k;
dd[i] = d;
pp[i][0] = p;
if (l->j != p)
}
int lca(int i, int j) {
int k;
i = pp[i][k];
if (i == j)
return i;
i = pp[i][k], j = pp[j][k];
return pp[i][0];
struct L *l;
int c = cc[i];
if (l->j != p)
c += dfs2(i, l->j);
cc[i] = c += ll[i];
return c - rr[i];
int main() {
int n, m, h, i, j;
dfs(-1, 0, 0);
while(m--) {
int i, j, a;
a = lca(i, j);
if (i == a) {
ll[j]++;
rr[i]++;
} else if (j == a) {
ll[i]++;
rr[j]++;
} else {
ll[i]++;
ll[j]++;
rr[a]++;
cc[a]--;
dfs2(-1, 0);
printf("\n");
return 0;
question
<p><strong>Question description</strong></p><p>Jegan Sir students were chatting and playing
quite loudly on the last day of the year, celebrating the end of the academic session. Jegan
sir was harshly chastised by the college's principal. But, instead of becoming enraged, he
attempted to engage everyone in a different task.<br><br>So Jegan sir gave his students to solve the
task such that, you have to perform pre-order tree traversal in Binary search tree.</p><figure
class="image"><img
src="data:image/png;base64,/9j/4AAQSkZJRgABAQAAAQABAAD/4gIoSUNDX1BST0ZJTEUAAQEAAAIY
AAAAAAIQAABtbnRyUkdCIFhZWiAAAAAAAAAAAAAAAABhY3NwAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAQAA9tYAAQAAAADTLQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAlkZXNjAAAA8AAAAHRyWFlaAAABZAAAABRnWFlaAAABeAAAAB
RiWFlaAAABjAAAABRyVFJDAAABoAAAAChnVFJDAAABoAAAAChiVFJDAAABoAAAACh3dHB0AAAByAA
AABRjcHJ0AAAB3AAAADxtbHVjAAAAAAAAAAEAAAAMZW5VUwAAAFgAAAAcAHMAUgBHAEIAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFhZWiAAAAAAAABvogAAOPUAAAOQWFlaIAAAAAAAAG
KZAAC3hQAAGNpYWVogAAAAAAAAJKAAAA+EAAC2z3BhcmEAAAAAAAQAAAACZmYAAPKnAAANWQ
AAE9AAAApbAAAAAAAAAABYWVogAAAAAAAA9tYAAQAAAADTLW1sdWMAAAAAAAAAAQAAAAxlbl
VTAAAAIAAAABwARwBvAG8AZwBsAGUAIABJAG4AYwAuACAAMgAwADEANv/bAEMAMiIlLCUfMiwp
LDg1MjtLfVFLRUVLmW1zWn21n767sp+vrMjh//PI1P/XrK/6//3////////B8P/////////////bAEMBNTg4S0
JLk1FRk//Or87////////////////////////////////////////////////////////////////////AABEIAyQFFAMBIgA
CEQEDEQH/xAAZAAEAAwEBAAAAAAAAAAAAAAAAAgMEAQX/xAA3EAEAAgEBBQUFBwUBAQEBAAA
AAQIDEQQSITFRE0FSkZIyM2FxgRQiU2JyweEFNEKhsSNDFfD/xAAYAQEBAQEBAAAAAAAAAAAAAAAA
AQIDBP/EACARAQEBAQACAwEBAQEAAAAAAAABEQISIQMxQRMiMlH/2gAMAwEAAhEDEQA/APUAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAELXtv7ta66Rrz
0N7J+HHqBMQ3sn4ceo3sn4ceoExDeyfhx6jeyfhx6gTEN7J+HHqN7J+HHqBMQ3sn4ceo3sn4ceoExDeyf
hx6jeyfhx6gTEN7J+HHqN7J+HHqBMQ3sn4ceo3sn4ceoExDeyfhx6jeyfhx6gTEN7J+HHqN7J+HHqBMQ3
sn4ceo3sn4ceoExDeyfhx6jeyfhx6gTEN7J+HHqN7J+HHqBMQ3sn4ceo3sn4ceoExDeyfhx6jeyfhx6gTEN
7J+HHqN7J+HHqBMQ3sn4ceo3sn4ceoExDeyfhx6jeyfhx6gTEN7J+HHqN7J+HHqBMQ3sn4ceo3sn4ceo
ExDeyfhx6nN+8TG9SIiZ05gsAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
BCP7i36Y/dNCP7i36Y/dMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABDL/h+qE0Mv+H6oB
MAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAHL2i
lZtIFrRWNZnSGe+0zPCkafGVWTJbJbWeXdCCOXXyf+JWve3O0o8esgOflUq5L15Wlfj2nuvGnxhmBZ3Y9
GJiY1gYsOWcc6c69G2JiY1jkrvz1KACgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIR
/cW/TH7poR/cW/TH7pgAACvPMxj1idEK48lqxMZJ4/EZvXvF4px5LRfcvzKadvbTXUPJcKpz1iZjSeCVsta1i
Z7+4XyiYrrmradNJifilfJWkcQ2JCuuetp04x80bZ9Mmmv3e8Tyi4U55ralZ1nSeizerTHEzPDQXfaQqjaKzP
GJhK+SKREzx16B5RMVfaK68p+a2J1jWAllBDJkjHprrxTjjGougjktuUmVGLJaLxvTOk9Rm9ZcaRHJeKV1m
EPtFeki2yLRC2SIx70Tz5I4ssXjS0/eDym4tFNNPtFtJnVcEugo3r5bTFZ0iEq1y1vHHegTyW6iif7pZfLWk6c5
+AeSYhTLW86RwnpJfLWk6TxnpAuz7TFdctb6xHCekq9nmIm8yJ5NAhTLF5mIieHemLLohl/wAP1Qmhl/
w/VAqYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
DJtOTevuxyhqvO7SZ6Q8/nx6jn8lyACOAO103o15NFcOK0a1mZ+o1OdZh20aWmPi4INGy5OM0n6M6
VLbt6z0ka4uVvAV6AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEI/uLfpj900I/uLfpj
90wAAVbT7v6u4rVjHGswnekXjSVf2enx8xmy7sQie02iJjlDuP8AuLLq0rSNKw5GOsXm0a6yJ41TiiJz21cz
cM0ctPivrjrW02jXWXbUreNLQHj6xntFr2j2Yn4S7fhnjf5La4aVnWIdvSt4+9AnjXN7Hvxy1U3iI2iNeS6uGl
Z1iOPxdvjrfmLZbFW0abldOTmblj15LZxVmsV46QlNImu7MawF5tU5ppOPhpr3I5NeypqtjBSJ10SvjrfTX
uEvNqvLWIwcuieH3VUrUi1d2eRWsVrERygak96jkmkab/0TjkjfHW+m93Jchf1RtFptaKRxQyb01j7kxu97
RGOsX3uOqUxExpIz42qMtt/BEu7sfZ+Xcl2Nd3d46J7kbm73Bl/VGONdnn4O7Pu7vdrqtrSKV0jk5GGkW
3o11DxvpXj/ALm6+0a1mPgjGOsXm0c5SFkxnwWikzW3CV3aU3orrxly2Kt51mOJXFSs6xHESSz0rn+6Rp
pGed//AGv7Ou/v8dS+Ot+ccQ8apvpOeNz/AE5TSM9t/wD2vpjrTlBfHW/OOIeN+0YnHNp3dN5miLTvac
u9rpirTlBTHWkzp3hebUcFqzTSOExzWIVxVrbejXVMam57EMv+H6oTQy/4fqgVMAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFef3NvkxN+WN7HaPgwRyRy
+QAHEatm93PzZWnZvdz8xvj7UX9ufmilf25+aIzQnkOxGsxHWQn2319mPk6RGkRAr1AAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIR/cW/TH7poR/cW/TH7pgAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAIZf8P1Qmhl/w/VAJgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAMOWm5kmO6eMNynNXteFecd4z1NjIExpOk84EecAEAAFuzxE
5dZ7ldaze0VjnLbXFWtN3/AGOvx8/qYhFppOluXdKauwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAACEf3Fv0x+6aNsdbW1nXXlwnRzsafm9UgmIdjT83qk7Gn5vVIJiHY0/N6pOxp+b1SCYh2N
PzeqTsafm9UgmIdjT83qk7Gn5vVIJiHY0/N6pOxp+b1SCYh2NPzeqTsafm9UgmIdjT83qk7Gn5vVIJiHY0/
N6pOxp+b1SCYh2NPzeqTsafm9UgmIdjT83qk7Gn5vVIJiHY0/N6pOxp+b1SCYh2NPzeqTsafm9UgmIdjT
83qk7Gn5vVIJiHY0/N6pOxp+b1SCYh2NPzeqTsafm9UgmIdjT83qk7Gn5vVIJiHY0/N6pOxp+b1SCYh2NP
zeqTsafm9UgmIdjT83qk7Gn5vVIJoZf8P1QdjT83qkjDSJiePDrMgmAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEzERrKGk5OfCvTqBrN+FeFe+U4iKxpByAV5c
MZOPK3VkvjtT2o+reDPXMrzhttgx2/xj6OfZsfSfNHP+bGnTFe/KNI6y11w468qxqmrU+OfqGPHXHHDn1
TAdCYiY0lDjj+Nf8AiYBE6xrAhMTTjXjHfCVZi0awDoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADlrRWNZctbd4RxmeUFa8d63G3/Acis2nev9I
TAAAAAAAAAAAAABG1Zid6vCe+OqQDlbRb4THOHUbV14xwmO8rfWdLcLAkAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAIWvbtN2tYnSNeM6Ob2XwV9X8AsFe9l8FfV/BvZfBX1fwCwV72XwV9
X8G9l8FfV/ALBXvZfBX1fwb2XwV9X8AsFe9l8FfV/BvZfBX1fwCwV72XwV9X8G9l8FfV/ALBXvZfBX1fwb2
XwV9X8AsFe9l8FfV/BvZfBX1fwCwV72XwV9X8G9l8FfV/ALBXvZfBX1fwb2XwV9X8AsFe9l8FfV/BvZfBX1
fwCwV72XwV9X8G9l8FfV/ALBXvZfBX1fwb2XwV9X8AsFe9l8FfV/BvZfBX1fwCwV72XwV9X8G9l8FfV/AL
BXvZfBX1fwb2XwV9X8AsFe9l8FfV/BvZfBX1fwCwV72XwV9X8G9l8FfV/ALBXvZfBX1fwb2XwV9X8AsFe9
l8FfV/BvZfBX1fwCwV72XwV9X8G9l8FfV/ALBXvZfBX1fwb2XwV9X8AsFe9l8FfV/BvZfBX1fwCwV72XwV
9X8G9l8FfV/ALBXvZfBX1fwb2XwV9X8AsFe9l8FfV/BvZfBX1fwCwV72XwV9X8O1vab7tqxHDXhOoJgAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAI2tOu7XjP/HJtN50ry75SrWKxpAFaxX
4zPOXQAAAAAAAAAAAAAAAAActWLRx83QEItNZ3b/SeqZMRMaShrOPhPGvXoCYAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAIR/cW/TH7poR/cW/TH7pgAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAIf/eP0/umh/8AeP0/uCYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAACN71pGtpMuSMddZ590MVrWvbW08RnrrxWX2m1vZ4Qqm1rc7TLgjje7ROuS9eVpQBPKtWPaY
nheNJ6r+bzluHNOOdLca/8V05731WyZ0jWUOOT4V/6RE30m3LuhMdSIiI0gAAAAAAAAAAAAAAAAAA
AAAAAENJx8Y416dE4mJjWOQyZ8ml5rjnSO8S3Pa3LtEU4V4yz2zZLc7afJARxvdpz5uxMxymYcBnatptF6
8/vQ048tckcOfRhdiZidYnSRvn5LPt6Arw5e0rpPtRzWK7fYAAAAAAAAAAAAAAAAAAAAAAAAAAACEf3F
v0x+6aEf3Fv0x+6YAKc171vEVnTUS3FwotbNSNbaTCztaxSLTwiRJ1ExybRFd7uQyXi2GbVkW1YIYp/wDK
szPmdtTXTUNiYI2vWmm9PMVIFWXLNbbtY1kS3Fop1zV4zGsdHc17Vx1mOEyJ5LQrxrE/BTmvatois6ai2
5NXCi1s1I1tpMLqW36xPUJddEM1t3HMxzRpbs8O9aZmQ33i0URbNeNa6RCzFa06xeNJjvEnWpiE5qRO
mqU2iK72vAXY6IdtTTmlFqzXXWNA2OivHli+uukJWvWntSGz7SEa3rf2ZcnLSJmJnjAbEwiYtGsckctprjmY
5hv6kIYrTbHEzzTmYiNZnQN/QQjLS06RKOe+7XSJ4yGzNWims9nSbTfe+GqePJF668NegSpgoyXv2u7W
QtxeKJvlxzE30mHc1tYrMW3dRPJcOTaK11tKPbY9OYuxMU57a46zWZ4pVzUiIibcRPKbiwRveK03nMeS
Mle6J6C7PpMU4rTXLakzM9FwS6If/eP0/umh/wDeP0/uKmAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAACGa27itPeDLmvv5JnujkrBHmt26Auw2pWJm0cRJNU6DXTLGSd3RRmrFckxHIavOTYrAGGrZc
mtZpPOOS9hw23ctZ+jcr08XYADQAAAAAAAAAAAAAAAAAAAAACvPfcx8Oc8IYl21W1yadIUo4fJfeAA5
mjui6medIrFde5de+5TWefQbnMs+2IAYSpaaWi0dzdWYtWJjlLz2vZba4tOkjt8d/FwCuoAAAAAAAAAAA
AAAAAAAAAAAAAACEf3Fv0x+6aEf3Fv0x+6YDPtE6ZKy0IXxRe0W100GepsU5Ms3jd3dNXctd3DWOi3Jjj
JHHhMd7s0iabtp1E8b7QtMfZ/ohH9pP8A/d6X2ePFKfZR2W5r9RMqq0zGzV0c01x6Rj+uq+McdnuTxhX
9njxTp0C81PDvRjiLczJWlpjeTiNI0QyYoyTEzOmg1npNn13dp1s0I5MdckcQ6muzaIjWZVbT7EfM+zx32
mU74ovWK66RAl2xKvsx8lG0TpkrKX2f88pWwxO797kF2zFWTLN43d3TVfjru0iHMmOMkceE9UqxpWI
mdRZLvtVtPsx83M0T2NdO5PPXex/Li7imL4o1+Qlm2wxWiccaGS0dnbdnjCE7PGvC0wnTFWkTHPUX39
Kcfsadnrr36u1i0YLxMcO5KdnjXhaYhZ2cdnuajM5qrFjrOGZmNZcwRFq2rPJdSm5Td1cx44x68ddRZz9Kd
npW0zM908HNdc8613vgt7CN7WLTDt8MXnXXSeonjcV1i3bRMVmsd7kVi20WieWq3Hiik66zMuxiiMk
315h41y82ppFK6wjebWwTNo0lc5eu/WY10GrEMHuoQ2mZ+7Hc79n0/wA5S7KNzdmdfiJlsxVeJtWN3
HpPUz1+5WZj73KVkbPET7UpZMfaREa6aCeNxXfHWMOsQ7grG5vacVs1ia7s8kKYdy2sWn5C+PvXIvk3
oiacNVeSd3aNdNWlCcUTk39foFlU5LzlmK6aO540ikdFuTFF5iddJjvL4t/TWeQl5vtVm95WJ9l3PWkUjTT
VLNNYiItEz8lFopppTWZE69ank9xRK2OsYNdOOic4t7HWszpolNNce5qL4qdN7Zome5LZ6xu73esrjiuPc5
wjTDFLaxafkLnuVCf7qF6jH9/PNu6F4vIh/wDeP0/umh/94/T+40mAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAp2r3P1XK9ojXDPw4iX6YgEeUdrE2nSHF2HJSkcYnUWTb7WVrXBTWebPe03tMyvtlxW9
qJn6Kcs0mY3I0G+vr0gAObse1HzegwY43slY+Lerv8f0ADoAAAAAAAAAAAAAAAAAAAAAAw5vfX+aC3a
Y0zT8Y1VI8/f/QAMJ47dnbWYaK2rmrOsIVzU3Yi1S2esV0pA6zJ+qLRu2mOjjszrOrg5jTsf+f0ZmrZI0pM9
ZG/j+14Cu4AAAAAAAAAAAAAAAAAAAAAAAAACEf3Fv0x+6aEf3Fv0x+6YAAAAAAAAAAAAAAAAAABE
RHKNAAAAAAAAAAAAAAAAAAAAAAAAmInm5FYjlEOgAAAAEREco0AAQ/+8fp/dND/AO8fp/cEwAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACY1jQAYL13LzWe5Fr2mkWrrHtd3xZEefvnKADAAACWOk
5LbsfWegsmrtlprM3n5Q0uVrFaxEcodV6ZMmAAoAAAAAAAAAAAAAAAAAAAAACnaqa0i0dzI9GY1jS
WLNj7O3D2Ry+Tn9VgI4gAAAERMzpHOW/HXcpFeijDhtpF+U90S0VtFvhMc4V6OOcjoA2AAAAAAAAA
AAAAAAAAAAAAAAAAAhH9xb9MfumjbHW06zHH5udjTpPnIJiHY06T5ydjTpPnIJiHY06T5ydjTpPnIJiHY0
6T5ydjTpPnIJiHY06T5ydjTpPnIJiHY06T5ydjTpPnIJiHY06T5ydjTpPnIJiHY06T5ydjTpPnIJiHY06T5ydjTpPnI
JiHY06T5ydjTpPnIJiHY06T5ydjTpPnIJiHY06T5ydjTpPnIJiHY06T5ydjTpPnIJiHY06T5ydjTpPnIJiHY06T5ydj
TpPnIJiHY06T5ydjTpPnIJiHY06T5ydjTpPnIJiHY06T5ydjTpPnIJiHY06T5ydjTpPnIJiHY06T5ydjTpPnIJiHY06
T5ydjTpPnIJiHY06T5ydjTpPnIJiHY06T5ydjTpPnIJiHY06T5ydjTpPnIJiHY06T5ydjTpPnIJiHY06T5ydjTpPnIJ
of8A3j9P7nY06T5y7XHWs6xHH5gkAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAja+nCONuha0
zO7XjPXo7WsV+MzzkHK10netxshmwRfjHCy0CzWC1LUn70IvR580LYcdudY+g5X45+MI2fZsXSfNOuOle
VYhD+bLjwXvPHhDTGKK1iK8JjvTFdJzJ9OVtrwnhMc4dRtXXjHCYdrbe+ExzgV0AAAAAAAAAAAAAAAAA
AAAAAEbW04RxtIFrTru15/8ADcjd3Z4683a13Y+M85dBkybPavGnGOimeHPg9Fy1K29qIkYvErzxsnZ8c/
4/7djBjj/HzRj+bHWs2nSsTLTi2fd434z0XxERGkRoK3OJBG1d7jHCY5SkDaNbcd23C3/UnLVi0aSjFprOl/pI
JgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAATMRGsgITM34V4R3yccnwr/ANTiNI0gH
K1isaQ6AAAAAAAAACNq68a8LQkA5W29Hx74dRtWdd6vtf8AXa2i0f8AY6A6AAAAAAAAAAAAAAAAAA
DlrbsdZnlAOWtpwjjM8odrXd58ZnnLla6cZ42lIAAAAAAAAAAAmImNJAENZx8+NevRPmIaTTjXjXvgEwiY
tGsAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAOWtFfjM8oAtaKxrKMVm8625d0O1rx3rcZ/
wCJAAAAAAAAAAAAAAAI2rOu9Xn/ANSAcraLRrDqNqzE71effHV2totGsA6AAAAAAAAAAAAAADlrRWN
ZAtaKx8e6HK1nXetzn/RWs671uf8AxIAAAAAAAAAAAAAAAAEJrMTvU598dUq2i0fHvh1G1NeMcLAkI1
vrOk8LdEgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABTk2iteFeMqLZslv8tI6QM3qRtHn71vFPm7GS9eV5Gf6
RvGWm0zHC8a/GGml63jWs6jcsv06CE2m07tPrIrtr8d2vG3/Ctd3jPGZ73a1isaQ6AAAAAAAAAAAAAAA
AAAAjaJrO9X6x1ScvetI1tIFZi0aw6yWzzvTOONIlXN7zztIxe5G8efvW8U+adc+SvfrHxCfJG0VY9orfhPCVo
3LoAACOTJXHGtpBIZL7TafZjdhXN7zztIxe5G8efvWjlafNZTPkrznej4hPkjXaYrGsuViZnetz7o6K8eWuS/3
uE90LhsAAAAAAAAAAAAAAAAAAABy1YtHxjlKMWmJ3b8+6eqZMRaNJAEImacLca90uZM1cfPjPSAWD
HfaL25fdj4K5taedp8xi/JHoDz4taOVp81tNovX2vvQE7laxDHlrk5c+iY2AAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAMufPMzu0
5d89Vm05N2mkc5ZBz76z1ABHAAASpe1J1rKILLjZS/bRw4R3rYiIjSGLDk7O8dJ5tqvRzdgANAAAAAAAA
AAAAAAAAAAIZckY66zz7oY73tedbS7lvOS8z3RyQRw7630ADmAANGDPMTuX5d0s4Nc9Y9EVbPk36aT
zhbMxETM9yvSrzZYx162nlDHa02nW06y7e83tNpRRw7630ADmAANODNr9y/PulmBvnrHoiGG/aY4me
cc01egAAAAAAAAAAAAAAAAAABHJfcpNgV7Rm3Y3a85/wBMjszMzrPOXEefrrQAYAAdiZidYnSWvBm7
SNJ9qP8AbG7W01tExzgb46x6A5S0XrFo73VegAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABiz23ss9I4K3be3b5y4jzdfYCWOk3toI
nhxb86zyhzLu72lI0iF+SLVpu0qhbB/5xMRO8Ol59ZGcdmJidJcHMbsFt7FWe9ha9k91PzHT41wCuwAAA
AAAAAAAAAAAAArz23cU9Z4LFG1+7r8xL9MoCPML9miJtbWFC7DkrjidYkXn7TtmrW0xuclF7Ra0zEaNF
ZxZJ03eKnNTcvpHKRrrcVgDmt2e27ljpPBdtVtMWnWWbH7ynzhdtn+H1V35v+WcBHAWYsU348oVtlY/
8ojXTgN8zar7HHrpv8VFoiJmInWGiMWO2u7adVF6zS0xIdREAYX7LbS816w1MWD39W1Xo4/5ABsAAA
AAAAAAAAAAAAAZtrtxrX6tLHtXvvoM930qAR5hdXZ5tWJ3o4/BSstmmce5p9RqZ+p/Zp8UeSrJTctu66t
GCu7jm097Pe29aZGupMRAHNq2S33Zr0Xsuye8t8mpXp5+gAaAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAYMsbuW0fFFo2qmkxe
PlLOjz9zKJVvNJ1rOiIMre3yeL/S7Jk0x61tGrIDU6rszMzrPNwBkbNmjTDHx4slYm1orHOW+sbtYjorr8c/X
QB1AAAAAAAAAAAAAAAAFO1Rri16TquctXerMdQrzx2YmszE84cR5bMF2LJStdLQpAlxpjLirxrHH5Kcl5v
bVAFvVoAMp4Y3stY+Oq/a4+7Weko7JTjN5+UL8tN/HNVejmf5xgD5iOA1YrxfHuzOk6aMoLzcaseLspm0
2UZbRbJMxyR1nrLgXr1kABlbs0a5o+EatijZaaVm0969Xp5mQAGgAAAAAAAAAAAAAAABk2uNMkT1hr
VbTTex6xzjiJ1NjGAjyiVK714hF2tprOsTpIsac9t3HFY72V21ptOtp1cF6u0AEaNkj71p+jSr2eu7ijrPFYr0yZ
MABQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAHLWisayDmSK2pMW5MNqzWdJ+jbFZtOt+XdDuTHXJXSYGeufKMAsyYb07tY6wrR
wss+wAZB2tZtOlY1acOz7v3r8Z6DfPFrmDDO7vTwt3fBdW2vC3C0JOWrvR0mOUq7yY6I1trwnhaEhQA
AAAAAAAAAAAAAAAAFG04tfv1jj3sr0VGbZ9771OE9Bz7433GUdtE1nS0aS4jjZgAAljpOS2kfWUseG9+7
SOstdKVpXSsDpzx+12tYrWIjlDoK7M204tJ36xw72d6LNl2fjrj8hz7433GcJiYnSY0n4iOOYAALMOOclvhH
OXceC1+NuENFI7OYp3TykdOeP2rIiIjSOQCuwAAAAAAAAAAAAAAAAAAADHnxdnbWPZn/Spuv8Afncjl
3s+TZ5rxpxjojl3x+xSHfp3g5AEcZ0jjIC7Z8W/O9aPux/t3Fs8zxvwjo1RERGkcldeOM91CYmnGvGO+EqzF
o1h1G1Zid6nPvjqOqQ5W0W+cc4dAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABG1uO7XjP/Adtbd4c5nlDla8d63Gf+FaxXjzmecpAAAI
Ww0tzrCYCn7Lj/N5uxs+OO7X5rQTI5FYrHCNHQFAActXe+ExylytteE8LQk5auvGOExykHRGtteE8JhIAAA
AAAAAAAAAAAAAAAHJrFo4xqrnZsc92nyWgKfsuP4+adcVKcqwmCYACgAAAOWrW0feiJVzs2Oe6Y+S0
BT9mx/HzWVx0p7NYSAwctWLRpLoCNLTru25x/tJG9d6NY4THJ2lt6PjHOAdAAAAAAAAAAAAAAAAAAR
tadd2vP/he2nCONp5O1rux1mecgVrFY0h0ARtjrf2qxKudmxz1j6rgMVRs2OOs/OVlaVr7NYh0DAAAAEb
U14xwtHeVtrOluFknLVi0cfpIOiEWms7t/pPVMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAJnTmhxycuFevUCbTadKfWUq1isaQ7EREaQAAA
AAAAAAAAAAAA5auvGOEx3lba8J4THOHUbV14xwmASHK214TwmOcOgAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAI3iYnerzjnHVIBysxaNYdQn7lt6PZnmmAAAAAAAAAAAAAAA5a27HxnlBa0VjWXK1nX
etz/AOAUrpxnjaUgAAAAAAAAAAAAAmImNJQ1nHwnjXr0TABDScfGONenROJiY1gAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAHJtFY1mdIB0U22mkctZR+1/kn
zE8o0CiNqrPOJhbW9bx92YkJZUgBRyZisayWtFfn3Q5WszO9fn3R0ByIm/G3CvdCYAAAAAAAAAAAAAA
AAAAAjauvGOFodrbe58JjnDqNq68Y4WgEhytt74THOHZmKxrM6QAKbbTSOWs/JH7X+SfMTyjQKI2qs8
6zC2l639mYkJZUgBQAAAAAAAAAAAAAAAAAAAAAAAAABCP8Aztuz7M8vgmjktSK/fmIBIZ42mKxppNt
O8+1/knzE8o0Cmu00nnrC2totGsTrAu66AAAADlrRWNZnSAdFNtppHLWUftf5J8xPKNBMxEazyURtVZ5
xMJxNcttYtE1juCWV2sTad630hMBQAAAAAAAAAAAAAAABCazWd6n1jqmA5W0Wjg6jams614WK214
TwtHcCQAAqttGOvfrPwQ+1x3UnzEtkaBnjao76zC2mal+U8egSypgCgAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAIZsnZ01755AjmzRj4Rxt0ZbWm862nVyZmZmZ5y4jh13aADmOx
MxOsTpLgK1Ydo1ndvz6rbW04RxswNWy3iYms+116q7cd76q2tNJ1njbqkA6AAAAAAAAAAAAAAAAAA
AAAIZcnZ017+4EM+SKTExP32a97XnW06uTMzMzPGZcRw67t+gAcwiZidYnSQFacO0azFb+bQ85q2bLv
RuW5xyV24731V4A6AAAAAAAAAAAAAAAAAAAAAAAKdpy7sbteciW45m2jSd2nPqzTMzOszrLgjh11aA
DA7W00nWs6OAsuNmHNGThPCy158TMTExzhtw5O0pr3xzV3461MEM2Ts6a988htHNmjHwjjZktabzr
adSZmZmZ5y4jh13aADmOxMxOsTpLgL9NWHaNZ3b8+q95zXs2XejdtzhXbjvfVXADoAAAAAAAAAAAAA
AAAOWrFvhMcpdctaK1mZ5QCFsvZxO/z7viy5Mtsk8Z0jo5kvOS+9P0RRx67/IADkACrsW0TXhfjHVriYm
NY4w85ds+XctuzylXXjv8rWAOoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
x7RfeyzHdHBsnk86Z1mZ6yMfJfQAjzi6uzzMazOiqJ0mJa71nJjjSdBvmSqbbPMRrE6qWylezx8Z1ZJ4zMh
1JHHaW3bxaO5wGZcr0YnWIkQwTrhrKavUAAAAAAAAAAAAAAAAAAAAMe033sundVsefM62mesjHyX
I4AjzuxEzOkc10bNOnG0QhgmIyRqtz472tE14wOnMmaqyYpx/GOqtsmv/lpPGdGMTqYO1tNbRaO5wG
Zcr0YnWImO8V7POuGvksV6gAAAAAAAAAAAAAAAAAAAAACZ0jVgvbfvNp72zPOmG0/BhHL5L6wSpX
etEa6aoiOS+dm4a73+lNaza2kc2rD7lDZo42kdLzLmORs06cbcVeTHNJ0l3Jkt2k6TMaSvzRvYdZ+YmS7jIt
2e+7liO6eCo10mJ6SM83K9Fj2i+9lmO6ODXr93X4PP11mZ6q6/JfQAjgsxYu0ifvaO5MO5XXe1+iuvtR82n
aPdwNySxCNm1/z/ANKr13bTGuui7Zf8lWb3tgsmbEEqW3LxaO5EGZcr0YnWNRDBOuGs/BNXqAAAAA
AAAAAAAAAAAGfa78Ip14y0MW0Trmn4cBnu5FYCPMtx4u0jXe0MmHs4idddUMft1+a/afZj5jckvKFdn
mY1mdC+CaxrE6odpe0RGstFNaYvvyLJzWQAYbsN9/HE9/emz7JPC0dJaFemXYACgAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAE8pedHDg9FhzV3cto+o5/JPSACOCVJiLxM8tWnLW16xuS
yJRe1eVpgbnWemrFFqUnflktxtOnV2b2tzmZRDq76ANNZ06jMbdnjTDVY5WN2sR0h1XqAAAAAAAAAA
AAAAAAAAAAHncpmHosOau7ltHXiOfyT0gAjg7WJm0RHNoimaOG9wZonRPtL+KRqWRoyW7PHprrLI7
MzM6y4HV0A58BGzZo0wwtcpXdpEdIdV6gAAAAAAAAAAAAAAAAAAAAAFe0ccNmJ6Fo3qzHWHnzGk
zHRHL5IADi14fcqtnvFbTE96uL2iNItOiI35fTTfBNr6xPCTPaK03I5qIyXiNN6XJmZnWRb1PxwkTxV3stY+O
ozzNrb/h9Hnw9Fhy13cto+OquvyT0gAjg7X2o+bTtHu4ZUrXtaNJmZgalyWLtl/wAlWb3tnK2tX2Z0cmZm
dZ4yFvrHAIjWYjqJG3Z40w1WOVjdrEdIdV6gAAAAAAAAAAAAAAABiz+/s2su110tFuvAY7npQAjzpY/br8
1+0+zHzZ4nSdYdte1uczI1Lkxow4t2N6eMuZaZLzyjT5qe1v4pO1v4pGvKZiMxpOkuEzrOsgw07H/nPyaF
WzV3cUfHitV6ZMgAKAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAKdpx71d6Oc
LgSzXnDRnwTEzanLvhnR5+ubAAZAAF+zY962/PKOSGLDOSdeVerbERWNIjSIHbjn9oArqAAAAAAAAAA
AAAAAAAAAAKdpx79d6OcLgLNecNGfBxm1I+cM6PN1zYADIAAu2bHvW3p5QjiwzknpXq2VrFYiIjSIHbjn
9roCuoAAAAAAAAAAAAAAAAAAAAAAy7Tj0tvxynm1ExFo0mNYEs2Y84WZcM451jjXqrR57LAAZABRr2
bHu13p5yrwYJmYtfl3Q1K7cc57op2nHvV3o5wuBuzXnC/PgmJm1OXfChHn65sABkAAX7Nj1tvzyjkjiwzk
nWeFerZERWNIjSB245/aAK6gAAAAAAAAAAAAAAACOWnaUmvf3JAPPmJidJ5w4158O/96vtf9ZZiYnSY
0lHn65xwAYAAE8WPtLxHd3uUpbJOlW3HjjHXSPrI68c77qURpGgCuwAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAqyYKX48p6wtAZLbNeOWkwh2OTwS3Ax4Rjrs+Se6I+a6mzVjja
d5cCzmQiNI4ADQAAAAAAAAAAAAAAAAAAAAAAAAryYKX48p6wsAZLbNeOWkwh2OTwS3Ax4RjjZ8k9
0R81tNmrHG07y8FnMhEaRpAA0AAAAAAAAAAAAAAAAAAAAAAAAAATGvNTfZqzxrO7K4Es1jts+SO6J
+SPY5PBLcDPhyyV2a889IhdjwUpx5z1laCzmT6ABoAAVZMFL8eU9YWgMltmvHLSYQ7HJ4JbgY8Ix12fJP
dEfNdTZq142nelcCzmQjgANAAAAAAAAAAAAAAAAAAAACGTFXJ7UceqYDLbZbR7MxPzV9jk8EtwMXi
MUYMk/46fNbTZfHP0hoBZxI5WsVjSsaQ6A0AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAOWtWvtWiPnLqu0ROeusf4z+wJdrj8dfM7XH46+bu7X
pHkbtekeQOdrj8dfM7XH46+bu7XpHkbtekeQOdrj8dfM7XH46+bu7XpHkbtekeQOdrj8dfM7XH46+bu7
XpHkbtekeQOdrj8dfM7XH46+bu7XpHkbtekeQOdrj8dfM7XH46+bu7XpHkbtekeQOdrj8dfM7XH46+bu
7XpHkbtekeQOdrj8dfM7XH46+bu7XpHkbtekeQOdrj8dfM7XH46+bu7XpHkbtekeQOdrj8dfM7XH46+b
u7XpHkbtekeQOdrj8dfM7XH46+bu7XpHkbtekeQOdrj8dfM7XH46+bu7XpHkbtekeQOdrj8dfM7XH46+
bu7XpHkbtekeQOdrj8dfM7XH46+bu7XpHkbtekeQOdrj8dfM7XH46+bu7XpHkbtekeQOdrj8dfM7XH46
+bu7XpHkbtekeQOdrj8dfM7XH46+bu7XpHkbtekeQOdrj8dfM7XH46+bu7XpHkbtekeQOdrj8dfM7XH4
6+bu7XpHkbtekeQOdrj8dfM7XH46+bu7XpHkbtekeQOdrj8dfM7XH46+bu7XpHkbtekeQOdrj8dfM7XH
46+bu7XpHkbtekeQOdrj8dfM7XH46+bu7XpHkbtekeQOdrj8dfM7XH46+bu7XpHkbtekeQOdrj8dfM7X
H46+bu7XpHkbtekeQOdrj8dfM7XH46+bu7XpHkbtekeQOdrj8dfM7XH46+bu7XpHkbtekeQOdrj8dfM7
XH46+bu7XpHkbtekeQOdrj8dfM7XH46+bu7XpHkbtekeQOdrj8dfM7XH46+bu7XpHkbtekeQOdrj8dfM
7XH46+bu7XpHkbtekeQOdrj8dfM7XH46+bu7XpHkbtekeQOdrj8dfM7XH46+bu7XpHkbtekeQOdrj8df
M7XH46+bu7XpHkbtekeQOdrj8dfM7XH46+bu7XpHkbtekeQOdrj8dfM7XH46+bu7XpHkbtekeQOdrj8
dfM7XH46+bu7XpHkbtekeQOdrj8dfM7XH46+bu7XpHkbtekeQOdrj8dfM7XH46+bu7XpHkbtekeQOdrj
8dfM7XH46+bu7XpHkbtekeQOdrj8dfM7XH46+bu7XpHkbtekeQOdrj8dfM7XH46+bu7XpHkbtekeQOd
rj8dfM7XH46+bu7XpHkbtekeQFbVt7MxPyl1CkaZcmnwTAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQn39f0z+yaE+/r+mf2BMAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAEKe9yfRNCnvcn0TAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAQn39f0z+yaE+/r+mf2BMAAGLJt1qXmu5HCeoNow//oW8Eebtdv8AF
TyBtEMWWmWutZTAAAAAAABmz7ZXHO7WN6QaR5s7blmeExH0Tpt14n70RIN4hhzVzV1rP0TAAAAA
B5215L1z2it7RHwkHoirZZm2CszMzPxWgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAhT3uT6JoU97k+iYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACE+/r+mf2TQn39f0z+wJgAPIze+v83rvIze+v8wb8WzYbY
qzNImZhDaNkp2c2pGkxxTxbRirirE3iJiEdo2unZzWk70zwBk2a80zV6TOkvRz5Jx4pvGmsdXnbNSb5q6co
nWW/a/7awKMe3TNv/SIiPgU2u+TPSsaRWZZcOPtMta9XqUw46abtY1jvAy5a4qb1mG+2Zbz937vyNuv
Ns273RC3ZJxY8e9a0b0gprtmWk/e4/Nuw5q5qb1frCjapw5MU6Wjejko2G+7n3e6wNW25Zx4tI52YsG
Gc2TTu75Xf1CZ7Wsd2iz+nxHZ2nv1BdTZsVY0isT81WfY6WrM440t/wBagHk4slsWSJjh1etWd6sTHKXlb
TERnvp1ejs064Ka9AZJ27JFtN2umrubbp1mMccOrJb25+b0sGzUrjjerE2mOOoLaW/8otae7WWPNtttd
McaR1XbbbcwaRw14MmyYoy5fvco4gV2zNE6zOvzQzZO1yTbTTV6k46TXdmsaPLz07PLavdAPQ2T+3qb
RtMYY052nuNl4bNWfg87Lacma0zPOQWztWe08J0+UJYttvE6XjWGnFfBjpFYtVm23s7aWpMa9+gN9b
ResWjlLNtW03w3itYiY073P6feZras9yr+oe9j5An9uns+Ub63ZM1stbTfuUbFgrk1veNYjlDdWla+zEQDz7
bZl7TWJ0jo347b+OtusKbbFjtfe4xHRoiIrERHKAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAQp73J9E0Ke9yfRMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAABCff1/TP7JoT7+v6Z/YEwAHkZvfX+b13mZcGWctpjHaY16An
TYr3pFovXinXYJ/yv5NWGJjFWJjSYhMEMWGmKulY+qG2f29lyraqzbBaKxrPQGHYv7mv1em8/ZMOSm0
Vm1JiOPGXoA83bazG0T8Utn2bHmx678xPfDVtOCM1eHC0cpYJpmwW4RMfGAap2CkRrN7JYtkpS9b1v
M6Mc3z5eEzazdslMlMel/pHQFf9QxzNYvHdzU7HmjFea29mz0LRFomJjWJYM+x3rMzj+9XoD0ImJjWO
KGbLXFSZmePdDzN7Lj4a2gjHlyzymfiCPHLk+NpetjruUrXpCnZtljF963G3/GgHjz7z6vYryh5c7Pl39eztz6P
UjlAM2311wxPSWfYbxXLMT3w9C9YvWa25S8zLs2TFbhEzHWAeo8rabxfPaY5OxfPeN2JtMdC2zZon2Jn
5A3bLGuzVj4PNvG7ktE90vT2as1wVi0aSp2rZZyTv0598dQcpsWO9YtF50knYccc8kwzRbNh4RvVd0z5rR
7VgbsGz1wTMxaZ16sv9Q97HybsUWrjrF51sybbivfLE1rMxp3As2D3H1aVGx0tTFpaJide9fPIEJzY4tuzeN
U3k3xXjJNZid7V6mKs1xViecQCQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAIU97k+iaFPe5PomAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAhPv6/pn9k0J9/X9M/sCYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIU97k+iaFPe5PomAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAhPv
6/pn9k0J9/X9M/sCYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAIU97k+iaFPe5PomAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAhPv6/pn9k0J9/X9M/sCYAAIXz46W
0teIkExV9pw/iQtrMWiJidYkAAAV5M+PH7Vo16K/tuHXTj5A0COPLTJH3LRKQAAAI3vXHGt7REAkIUzY7z
pW0TKYAAA5a0VjW06QottuGO+Z+UA0Cmm1YrzpFtPmuAAAHLWisa2nSFFtsw1nnM/KAaBVTacV50i
2k/FaAAAI3vXHGt50hD7Th/EgFoq+04fxIWUvW9dazrAOgACqdpwxPvIPtOH8SAWir7Th/EhbE6xrAAAA
TMRGszpCi214a/5TPyBeKK7ZhnvmPmvrMWjWJ1gAEb5K441vaIgEhV9pw/iQnTJTJruWidASBXkz48fC1
uPSAWDPXbcMzprMfOF9bRaNazrAOgACN8lcca3tEQh9pw/iQC0VfacP4kH2nD+JALQiYmImOUgAhfNj
xzpe0RKP2nD+JALRyt63rvVnWOqv7Th/EgForjaMVpiIvEzKwAEb5aY9N+0RqCQq+04fxITpeuSNaTrAJDl
r1pGtpiIUTtuGO+Z+UA0Cqm04rzpFuPxWgAAAAAAAAhT3uT6JoU97k+iYAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACE+/r+mf2TQn39f0z+w
JgAMm0bJbLlm0WiInq1gPHvXcvNZ7nqbP7inyebtHv7/N6Wz+4p8gWI5ItNJis6T1SAebGy5b5Ji3DrMrb
bBpXhfi2oZstcVJtP0B5dL2xZImOExL1qzvViesavJpE5csR3zL1qxpWI6QDoAEzFYmZ4RDy9ozTnycOXdC7
bdo1ns6zw7zYsGv/raOEcgX7Lg7Kms+1PNez/bMe9u8dddGgAAHm7Zkm+aa68K8FmDY4vji17Tx5RCG
24ppk345WdwbZOOkVtXeiOQIbTs/YTGk6xLRsGSbVmkzrpyZto2ic8xw0iOUNew4tzHNp52BpAB5u2ZZ
vlmuvCvBZg2KL0i15mNe6FG01mue2vfOrZs+045xxFrRWYjTiDLtOzTg0mJ1rLTsOab1mlp1mOSrbdorkr
FKTr1lXsVtNorHXgD0wAZP6jP/AJ1j4s2DZ7Z4mYmI06r/AOozxpCrZtpjBWYmuus9QT+wX8dWvZ8U4sU
VmYmfgqpt2OZ4xNWmJi0axOsSATxiQBhtsF5tM79eKvLss4qb1r1+T0pnSJl5W0Zpy5JmeUcoBHFjtlvFa
vWrG7WI6Qy7FfFWu7E/fnnq1gHIV7RbdwXn4AwbTnnLeYifuxyhZi2Kb1i153de5nxTWMlZtyieLVbb+P
3KcPiBbYPDfzbKVilIrHKGXHt0TOl66fGGuJiY1jkAp2nDOakRExGk964B5WfBOCYiZidejT/TvZv80f6j7VPql
/TvZv8AMF21Zeyxax7U8Iefix2z5NI598yv/qFv/Stfhqs/p9fuWnrIKsuxWpSbVnXTuQ2XNOLJETP3Z5vTe
Rljdy2jpIPXEcVt7FWesJAy/wBQ93X5suDZ7Z4nSYjTq9HLirliItrwcxYa4dd3XiDFfYrUpNpvXSGesTa0RHe
27fk0rGOO/jKvYcW9k355VBvpXdpWvSNHQBm2nZrZrxMWiNOrDlxziyTSZ1mHrvM2z+5v9P8AgNmyc
dmhlvsV6Um02rwa9j/t6p5/c3+QPM2f3+P9UPWeTs/v8f6oesAo2rZ7Z93dmI06rwHk5sM4b7szE/Jt2D
3M/NRt/vo+S/YPcz8wU7VgzWya+1E8vglXYJ0+9fj8G0mYiNZ5A8nNinDfdmflLfseScmHjzjgxbXljLl1jlHC
G3Y8c0wRrzniC8AAAAAAAEKe9yfRNCnvcn0TAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQn39f0z+yaE+/r+mf2BMAAAHk7R7+/wA3pbP7in
yebtHv7/N6Wz+4p8gWA5ad2sz0BHLlripvW+kPMyXvtGTrM8oczZbZb71vpCWHP2MzMUiZ6yDds2zxh
rrPG0817B9vv4KtmDJOXFW8xpMgmp2rJOLDMxznguRyY65a6XjWAeRE/e1ni1Rt0xXSMcRHzaPseDwf
7knZMMRP3P8Acg83e+/vfHVv2fapy5IpNIjhz1YYiO0iO7V6eLZ8eOYtWuk6dQWgA8nPknJlmZnv0hsw7
JjjHE3jWZhk2nFOLLPDhPGJaMO2xWkVvWZmO+Ac2vZq46b9OHWHNgyTGTc7phHadq7au7WNKp7Bi
ne7SY4dwNwAK82CmaPvc45SyzsFteF40XbTtPY2rERrPer+3109idQV5tmrgw6zOtp5I7FXe2iJ6cUM2a+
e/H6RDbseCcVNbe1INAAK8uz0zTE314dJV/YsPSfNTn2q9M87vCI4aT3uxt/DjTj8AVbVs8YZiazrErv6feZ3
qd0cWfPntnmNY0iOUNWw4ppSbWjSbcgagcvbcpNukA7MaxMM1thxzymYlnptmSszr96JnlKydv4cKcQ
ZclJxZJrrxjvens9+0w1tPN5kzbNk152l6mGnZ4q16Amr2iN7BePgsJjWJie8HjVjetEdXp02XFWuk0ifjLBnx
Ww5fhziWmm313fvVnX4Ap2vDGLJG7ylp2C02wzE90sefNOfJrp8Ihv2THOPDETzniC4AGH+o+1T6pf07
2b/ADR/qPtU+qX9O9m/zBD+oV/9K2+Giz+n2+5aOkrdqxdri0j2o4w8/Fktgyaxz74kHrPIyzvZbT1lfl2216T
Wsaa96Gy4Zy5ImY+7HMHo4o3cVY6QkABM6RMz3DPtuXcxbsc7AwZrzky2t8eD0tmx9nhiO+eMsGyY+
0zRryjjL1AAAHmbZ/c3+n/HpvM2z+5v9P8AgNux/wBvVPP7m/yQ2P8At6p5/c3+QPM2f3+P9UPWeTs/v
8f6oesAADz9v99HyX7B7mfmo2/30fJfsHuZ+YNMzERrPJ521bTOSdyk/d/6ltue03nHHCI5/FlpbdtEzETp3
SDVsmy72l7xw7ob2D7ffwVX7LtNs1piaxGnQGgAAAAAAAEKe9yfRNCnvcn0TAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQn39f0z+yaE+/r+
mf2BMAAAFc7PitMzNImZWViKxERGkQABMRMaTyAFX2bD+HB9mw/hwtAVfZsP4cLK1ilYrWNIjudAAA
AAV/Z8Ouu5GqwAAActSt40tETCi2xYZ7pj5S0AKa7Jir/jr810RERpAAAAhkw48ntV1nqq+xYde/wA2gBXj
wY8fs1jXqsAAAEL4qZParEqp2LDPWPlLQAqps2Kk6xXWfitAAAFV9nxX4zXj8EPsWLXX73m0AIY8NMfs1i
EwAABy1K3jS0RMKJ2LDM8pj5S0AK8ez48c61rx6ysAAAEb4qZNN+sToUx0x67lYjVIAV5MGPJxtXj1hYAz
12LDE66TPzlfWsVjSsaQ6AAAIXxUyTresSmAjTFTHruViNUgAAAV2wYr23rUiZnvWAOVrWldKxpDsxFom
JjWJAFcbPirMTFIiYWAAACF8OPJOt6xMu0pXHGlI0hIBXbBivbetSJlz7Nh/DhaAq+zYfw4SpipjnWlYhMA
AAAAAAABCnvcn0TQp73J9EwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAEJ9/X9M/sAJgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAhT3uT6JgAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD//Z"></figure><p><strong>Constraint
s:</strong></p><p>0<size <100</p><p>0<data<1000</p><p><strong>Input
format:</strong></p><p>First line indicates the size of the tree</p><p>Second line indicates the
elements of the tree</p><p><strong>Output Format:</strong></p><p>single line indicates the pre-
order list of the given value</p>
answer
#include<bits/stdc++.h>
void solve(){}
struct node {
int data;
}*root=NULL;
tempNode->data = data;
tempNode->left = NULL;
tempNode->right = NULL;
else {
current = root;
parent = NULL;
while(1) {
parent = current;
if(current == NULL) {
parent->left = tempNode;
return;
else {
current = current->right;
if(current == NULL) {
parent->right = tempNode;
return;
}}}
if(root != NULL) {
printf("%d ",root->data);
preorder(root->left);
preorder(root->right);
int main() {
solve();
scanf("%d",&x); insert(x); }
preorder(root);
return 0;
question
<p><strong>Problem Description</strong></p><p>A new species is trying to rule the planet. This
species is creating their own population outburst to dominate other species. It all started with 1
single member of the species. The population increases in treelike fashion abiding by few rules as
listed below.</p><ul><li>Single member is able to reproduce by itself.</li><li>A new member is
added to the population every minute.</li><li>Every member is associated with integral
name.</li><li>Multiple members can share a common name.</li><li>Every member has it's own
reproduction capacity, that is maximum number of children it can reproduce.</li><li>A member can
start to reproduce only if all members older than it have exhausted their reproduction
capacity.</li><li>Level 0 in family tree of this species comprise of single member at the start of
multiplication.</li><li>Integral name of single member at the start is 0.</li><li>The population grows
level wise, where number of members at level <i>i</i> is dependent on reproduction capacity of
members at prior level.</li></ul><p>Given the integral name of new member and it's reproduction
capacity that is added to the population, you have to find it's parent, level at which it is added and
it's ascending age wise rank among siblings.</p><p><strong>Input:</strong><br>First line of the
input contains 2 integers, <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>N</mi><mo>,</mo><mi>R</mi><msub><m
i>C</mi><mn>0</mn></msub></math>, representing number of minutes we will be examining the
population increase and reproduction capacity of member at epoch. Next <i>N</i> line contains 2
integers each, <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>I</mi><msub><mi>D</mi><mi>i</mi></ms
ub><mo>,</mo><mi>R</mi><msub><mi>C</mi><mi>i</mi></msub></math>, representing integral
name and reproduction capacity of new member born at time
<i>i</i>.</p><p><strong>Output:</strong><br>N lines, each line containing 3 integers, <math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>P</mi><mo>,</mo><mi>L</mi><mo>,</mo
><mi>C</mi></math>, representing integral name of the parent, level at which it is added and it's
ascending age wise rank among siblings.</p><p><strong>Note</strong> :<br>It will always be
possible to reproduce a new child or in other words, through out the given time, there exists atleast
one member which can still accomodate new
child.</p><p><strong>Constraints:</strong><br><math
xmlns="http://www.w3.org/1998/Math/MathML"><mn>1</mn><mo>≤</mo><mi>N</mi><mo>≤</
mo><msup><mn>10</mn><mn>6</mn></msup></math><br><math
xmlns="http://www.w3.org/1998/Math/MathML"><mo>−</mo><msup><mn>10</mn><mn>9</mn
></msup><mo>≤</mo><mi>I</mi><msub><mi>D</mi><mi>i</mi></msub><mo>≤</mo><msup><m
n>10</mn><mn>9</mn></msup></math><br><math
xmlns="http://www.w3.org/1998/Math/MathML"><mn>0</mn><mo>≤</mo><mi>R</mi><msub><
mi>C</mi><mi>i</mi></msub><mo>≤</mo><msup><mn>10</mn><mn>9</mn></msup></math><
/p><p><strong>Explanation for test case1 </strong></p><p>The resultant family tree looks
like this.</p><figure class="image"><img src="https://he-
s3.s3.amazonaws.com/media/uploads/54a935a.png" alt="enter image description here"></figure>
answer
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
struct cell{
int name;
int level;
int capacity;
};
int front;
int end;
void init_queue(){
front = 0;
end = 0;
queue[end].name = name;
queue[end].level = level;
queue[end].capacity = capacity;
end = end + 1;
int is_empty(){
if(end == front)
return 1;
return 0;
void dequeue()
if(!is_empty())
front++;
}
int main(){
int n,rc;
init_queue();
scanf("%d %d",&n,&rc);
int i,j,k;
for(i=0;i<n;i++){
scanf("%d %d",&arr[i].name,&arr[i].capacity);
enqueue(0,rc,0);
i=0;
while(!is_empty()){
k=1;
for(j=0;j<cap&&i<n;j++,i++){
printf("%d %d %d\n",par,lev,k++);
enqueue(arr[i].name,arr[i].capacity,lev);
dequeue();
return 0;
question
answer
#include <stdio.h>
#include <stdlib.h>
lint getnl() {
n = n * 10 + c-'0';
c = gcx();
if(neg) n *= -1;
return n;
if (0 == li) {
while (li) {
li /= 10;
if(lc) pcx(lc);
int main () {
lint N = getnl();
int PA[N+1];
lint D = getnl();
int DA[D];
if (DLT[1]) {
lint pi = PA[DA[ni++]];
while (pi>0) {
else piv[pi] = 1;
pi = PA[pi];
//pcx('\n');
putl(D-dLess, 0);
return 0;
}
question
answer
#include<bits/stdc++.h>
int main()
int i,n,m;
cin>>n>>m;
unordered_map<int,int> ghost;
int best = -1;
cin>>best;
ghost[best]+=1;
cout<<best<<" "<<1<<endl;
for(i=0;i<n-1;i++)
int y;
cin>>y;
ghost[y]+=1;
cout<<best<<" "<<ghost[best]<<"\n";
question
answer
#include<bits/stdc++.h>
#include<map>
int main() {
int N,i,maximum=INT_MIN;
scanf("%d", &N);
int S[N];
map<int,int> map;
for(i=0;i<N;i++) {
scanf("%d", &S[i]);
maximum=max(maximum,S[i]);
map[S[i]]++;
int temp,Q;
cin>>Q;
for(i=0;i<Q;i++) {
scanf("%d", &temp);
if(temp==maximum) printf("%d\n",N);
else {
if(map[temp]>=2) printf("%d\n",N);
else {
map[temp]++;
N++;
printf("%d\n",N);
maximum=max(maximum,temp);
}
for(auto it=map.rbegin();it!=map.rend();it++) {
question
answer
#include <bits/stdc++.h>
vi h, id;
vector<vi> g;
dfs(j, i);
h[i]=max(h[i], h[j]+1);
lvl[h[i]].push_back(i);
int main() {
cin.sync_with_stdio(0); cin.tie(0);
cin.exceptions(cin.failbit);
int t;
cin >> t;
while(t--) {
int n;
cin >> n;
int m=2*n+1;
g.assign(m, vi());
rep(i, 0, 2) {
rep(j, 0, n-1) {
int a, b;
a+=i*n, b+=i*n;
g[a].push_back(b);
g[b].push_back(a);
g[0]={1, n+1};
h.assign(m, 0);
id.assign(m, 0);
lvl.clear();
dfs(0, -1);
if (h[1]!=h[n+1]) {
continue;
trav(l, lvl) {
map<vector<ll>, int> u;
trav(i, l.second) {
vector<ll> cur;
sort(all(cur));
if (!u.count(cur)) {
int s=sz(u);
u[cur]=s;
id[i]=u[cur];
}
}
return 0;
question
answer
#include <iostream>
#include <map>
#include <assert.h>
map < pair < int, int >, int > adj;
int depth = 0;
while ( u > 0 ) {
u = u / k;
depth = depth + 1;
}
return depth - 1;
int dist = 0;
swap ( u, v );
if ( adj.count( { u, u / k } ) ) {
} else {
dist = dist + 1;
depth_u = depth_u - 1;
u = u / k;
while ( u != v ) {
if ( adj.count( { u, u / k } ) ) {
} else {
dist = dist + 1;
if ( adj.count( { v, v / k } ) ) {
} else {
dist = dist + 1;
}
u = u / k;
v = v / k;
return dist;
swap ( u, v );
add_weight( u, u / k, w );
depth_u = depth_u - 1;
u = u / k;
while ( u != v ) {
add_weight( u, u / k, w );
add_weight( v, v / k, w );
u = u / k;
v = v / k;
}
signed main() {
int k, q, x, u, v, w;
while(q--) {
cin >> x;
if ( x == 1 ) {
} else {
increase_weights( u, v, w, k );
question
answer
#include <bits/stdc++.h>
int main()
seats.push(a);
x[a]++;
cout <<ans;
return 0;
}
question
answer
#include<bits/stdc++.h>
int dp[1000006][25];
void solve(){}
int main(){
solve();
int n, q; cin>>n>>q;
int x, y; cin>>x>>y;
dp[i][k] = dp[dp[i][k-1]][k-1];
while(q--) {
int ans = 0;
while(y>0) {
int z = 0;
if (dp[y][i] < x) {
z = i;
break;
if (z == 0)
break;
ans += (1<<(z-1));
y = dp[y][z-1];
cout<<ans<<endl;
question
#include <stdio.h>
#include <string.h>
#define N 100000
#define M 200000
struct L {
struct L *next;
int j;
l->j = j;
l->j = i;
l->j = j;
char visited[N];
void dfs1(int i) {
struct L *l;
if (visited[i])
return;
visited[i] = 1;
dfs1(l->j);
po[npo++] = i;
struct L *l;
int c_ = cc[j];
if (c_ != -1) {
if (c_ != c) {
link_(c_, c);
dd[c]++;
return;
cc[j] = c;
dfs2(l->j, c);
int dfs3(int i) {
struct L *l;
if (visited[i])
return -1;
visited[i] = 1;
if (!aa_[i].next)
return i;
int w = dfs3(l->j);
if (w != -1)
return w;
return -1;
void augment(int n) {
int h, i, p, q, s, t, x;
p = 0;
if (cc[i] != i)
continue;
if (dd[i] == 0) {
int w = dfs3(i);
if (w != -1) {
iv[vv[p] = i] = 1;
iw[ww[p] = w] = 1;
p++;
s = t = p;
if (cc[i] != i)
continue;
vv[s++] = i;
ww[t++] = i;
q = s < t ? s : t;
add(ww[h], vv[h]);
x = ww[p - 1];
add(x, vv[0]);
}
int main() {
int n, m, h, i, j, k;
while(m--) {
link(i, j);
dfs1(i);
k = 0;
j = po[h];
if (cc[j] == -1) {
dfs2(j, j);
k++;
if (k == 1) {
printf("0\n");
return 0;
augment(n);
return 0;
question
<p><strong>Problem Description</strong></p><p>You are given an N-dimensional array A. You can
execute an operation that removes the greatest and smallest elements from the array and replaces
them with their difference. As a result, the array's size will drop by one after each operation. You are
assigned Q jobs, each of which contains an integer K. After K operations, you must provide the total
of all the items in the array for each task.</p><p><strong>Constraints:</strong></p><p>2 <=
<strong>N</strong> <= 10<sup>5</sup></p><p>1 <= <strong>Q</strong> <=
10<sup>5</sup></p><p>0 <= <strong>A[i]</strong> <= 10<sup>9</sup></p><p>0 <=
<strong>K</strong> < <strong>N</strong></p><p><strong>Input:</strong></p><p>First line
contains two space-separated integers <strong>N</strong> and <strong>Q</strong>, denoting the
number of elements in array and number of queries respectively.</p><p>Next line contains
<strong>N</strong> space-separated integers denoting elements of the array.</p><p>Next
<strong>Q</strong> lines contain a single integer
<strong>K</strong>.</p><p><strong>Output:</strong></p><p>For each task, print answer in a new
line.</p><p> </p>
answer
#include<bits/stdc++.h>
#define pb push_back
#define vi vector<int>
int main()
ll n, q, i, x, t1, t2,sum, k;
cin>>n>>q;
priority_queue<ll> maxh;
sum=0;
for(i=0;i<n;i++){
cin>>x;
sum+=x;
maxh.push(x);
minh.push(x);
t1=-1, t2=-1;
ll a[n];
a[0]=sum;
t1 = maxh.top(); t2=minh.top();
a[i] = a[i-1]-(t1+t2)+(t1-t2);
maxh.pop(); minh.pop();
maxh.push(t1-t2); minh.push(t1-t2);
cin>>k;
cout<<a[k]<<'\n';
return 0;
question
<p>Question description</p><p>The professor wants to divide the class of n students into two
groups Left (L) and Right(R) for some project work. </p><p>But the students are very talkative
and so the professor decides that no two friends should fall into the same
group. </p><p>Each student is recognized by his index which is in the range of 1 to
<i>n</i>. </p><p>The professor knows through unknown sources who are friends with
whom. </p><p>So he has asked you to help him divide the class into two teams. Note that
friendships are always mutual; </p><p>i.e. if A is a friend of B then B is also friend of
A.<br> </p><p>Constraints</p><p>T≤100<br>1≤ n ≤ 1000<br>0 ≤ <i>k</i> <
<i>n</i></p><p><br>Input Format<br>The first line of input consists of the number of test cases T.
Then T lines follow each describing a test case. The first line of each test case consists of a number
<i>n</i>. Then follow n lines each describing the friendship of a student. Each line starts with a
number<i> k</i> telling the number of friends the <i>i</i>th person has. Then follow <i>k</i>
integers separated by space which tells the index (1 based) of his friends. All these integers on the
<i>i</i>th line are greater than <i>i</i> itself. (See sample for clarity).<br><br>Output
Format<br>For each test case, if it is possible to divide the class into teams, then print a line of L’s
and R’s denoting which team that student is a part of. If it is impossible to divide the class then print
-1 instead. If there are multiple solutions print the one that would come first in the dictionary.</p>
answer
#include<iostream>
#include<cstdio>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#include<list>
#include<cstring>
#include<stack>
#include<queue>
#define vi vector<int>
#define pp pair<int,int>
#define pb push_back
#define mp make_pair
#define vl vector<ll>
#define sc scanf
#define pf printf
ll power(ll a,ll b)
{
if(!b)
return 1;
if(b==1)
return a;
ll temp=power(a, b/2);
temp=(temp*temp);
if( b&1 )
temp=(temp*a);
return temp;
class graph
vi * adj;
public:
graph(int v)
adj=new vi[v];
adj[u].pb( v);
adj[v].pb( u);
visited[v]=true;
vi::iterator it;
bool flag=true;
for(it=adj[v].begin();it!=adj[v].end();it++)
{
if(!visited[*it])
group[*it]=group[v]^1;
flag=dfs(*it,visited,group);
else
if(group[v]==group[*it])
return false;
return flag;
};
int main()
ios_base::sync_with_stdio(false);
int i, n, t, k, in, j;
cin >> t;
while( t-- )
cin >> n;
graph g(n);
for( i=0;i<n;i++ )
cin >> k;
for( j=0;j<k;j++ )
g.add_edge(i, in);
vector<bool> visited(n);
bool check=true;
vi group(n);
for( i=0;i<n;i++ )
if(!visited[i])
if(!check)
break;
if(check)
for( i=0;i<n;i++ )
if(!group[i])
else
else
return 0;
question
answer
#include <bits/stdc++.h>
if (low == val[j]) {
do {
x = z.back(); z.pop_back();
comp[x] = ncomps;
cont.push_back(x);
} while (x != j);
f(cont); cont.clear();
ncomps++;
int n = sz(g);
Time = ncomps = 0;
int main() {
cin.sync_with_stdio(0); cin.tie(0);
cin.exceptions(cin.failbit);
int n, m;
vector<vi> g(n);
while(m--) {
int a, b;
g[a].push_back(b);
g[b].push_back(a);
vi r;
rep(i, 1, sz(r))
cout << r[0]+1 << " " << r[i]+1 << '\n';
return 0;
question
<p>Question description</p><p>There are n boys and m girls in a school. Next week a school dance
will be organized. A dancing pair consists of a boy and a girl, and there are k potential
pairs.<br><br>Your task is to find out the maximum number of dance pairs and show how this
number can be
achieved.</p><p><br><strong>Constraints</strong></p><ul><li>1≤n,m≤500</li><li>1≤k≤1000</li><l
i>1≤a≤n</li><li>1≤b≤m</li></ul><p><br><strong>Input</strong><br><br>The first input line has
three integers n, m and k: the number of boys, girls, and potential pairs. The boys are numbered
1,2,…,n, and the girls are numbered 1,2,…,m.<br><br>After this, there are k lines describing the
potential pairs. Each line has two integers a and b: boy a and girl b are willing to dance
together.<br><br><strong>Output</strong><br><br>First print one integer r<math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>r</mi></math>: the maximum number of
dance pairs. After this, print lines describing the pairs. You can print any valid
solution.<br><br> </p>
answer
#include <stdio.h>
#define N 500
#define M 1000
struct L {
struct L *next;
int v;
} aa[N + 1];
l->v = v;
int bfs(int n) {
head = cnt = 0;
dd[0] = n;
if (vv[u] == 0) {
dd[u] = 0;
qq[head + cnt++] = u;
} else
dd[u] = n;
while (cnt) {
struct L *l;
u = qq[cnt--, head++];
d = dd[u] + 1;
if (dd[w] == n) {
dd[w] = d;
if (w == 0)
return 1;
qq[head + cnt++] = w;
return 0;
struct L *l;
int d;
if (u == 0)
return 1;
d = dd[u] + 1;
vv[u] = v;
uu[v] = u;
return 1;
dd[u] = n;
return 0;
}
int hopcroft_karp(int n) {
int m = 0;
while (bfs(n)) {
int u;
m++;
return m;
int main() {
int n, n_, m, u, v;
while (m--) {
link(u, v);
printf("%d\n", hopcroft_karp(n));
if (vv[u])
return 0;
question
<p>Question description</p><p>Kaaleppi has just robbed a bank and is now heading to the harbor.
However, the police wants to stop him by closing some streets of the city.<br><br>What is the
minimum number of streets that should be closed so that there is no route between the bank and
the
harbor?</p><p><strong>Constraints</strong></p><ul><li>2≤n≤500</li><li>1≤m≤1000</li><li>1≤a,b
≤n</li></ul><p><br><br><strong>Input</strong><br><br>The first input line has two integers n and
m: the number of crossings and streets. The crossings are numbered 1,2,…,n. The bank is located at
crossing 1, and the harbor is located at crossing n.<br><br>After this, there are m lines that describe
the streets. Each line has two integers and b: there is a street between crossings a and b. All streets
are two-way streets, and there is at most one street between two
crossings.<br><br><strong>Output</strong><br><br>First print an integer k: the minimum number
of streets that should be closed. After this, print k lines describing the streets. You can print any valid
solution.<br><br> </p>
answer
#include <stdio.h>
#define N 500
#define M 1000
struct L {
struct L *next;
int h;
} aa[N];
int dd[N];
l->h = h;
}
int bfs(int n,int s,int t) {
dd[i] = n;
dd[s] = 0;
head = cnt = 0;
qq[head + cnt++] = s;
while (cnt) {
struct L *l;
i = qq[cnt--, head++];
d = dd[i] + 1;
if (cc[h = l->h]) {
if (dd[j] == n) {
dd[j] = d;
if (j == t)
return 1;
qq[head + cnt++] = j;
return 0;
struct L *l;
int h, j, d;
if (i == t)
return 1;
d = dd[i] + 1;
if (cc[h = l->h]) {
return 1;
dd[i] = n;
return 0;
int f = 0;
f++;
return f;
int main() {
int n, m, h, i, j;
ij[h] = i ^ j;
cc[h * 4 + 0] = 1;
cc[h * 4 + 2] = 1;
link(i, h * 4 + 0);
link(j, h * 4 + 1);
link(j, h * 4 + 2);
link(i, h * 4 + 3);
if (dd[i] < n) {
struct L *l;
h = l->h;
return 0;
question
answer
#include<bits/stdc++.h>
int n,m;
int sum[M],val[M],rev[M],f[M],s[M],c[M][2];
mt19937 rd(time(0));
int read(){
while(ch<'0'||ch>'9'){if(ch=='0')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){rex=rex*10+ch-'0';ch=getchar();}
return rex*f;
return c[f[x]][0]!=x&&c[f[x]][1]!=x;
sum[x]=sum[c[x][0]]^sum[c[x][1]]^val[x];
if(!rev[x])return;
swap(c[x][0],c[x][1]);
rev[c[x][0]]^=1;rev[c[x][1]]^=1;
rev[x]=0;}
void rotate(int x){
int y=f[x],z=f[y],k=c[y][1]==x,ch=c[x][k^1];
if(!isroot(y))c[z][c[z][1]==y]=x;f[x]=z;
c[y][k]=ch;f[ch]=y;
c[x][k^1]=y;f[y]=x;
pushup(y),pushup(x);}
int top=0,u=x;
while(!isroot(u))s[++top]=u,u=f[u];s[++top]=u;
while(top)pushdown(s[top--]);
for(int y=f[x];!isroot(x);y=f[x]){
if(!isroot(y))
rotate(((c[f[y]][1]==y)==(c[y][1]==x))?y:x);
rotate(x);
}}
for(int t=0;x;t=x,x=f[x]){
splay(x);
c[x][1]=t;
pushup(x);
}}
access(x),splay(x);
while(c[x][0])x=c[x][0];
return x;
if(c[x][0])dfs(c[x][0]);
if(c[x][1])dfs(c[x][1]);
if(x>n)val[x]=rd();
sum[x]=sum[c[x][0]]^sum[c[x][1]]^val[x];
int main(){
n=read(),m=read();
for(int i=1;i<=m;++i){
int x=read(),y=read(),v=read(),z=n+i;
val[z]=v;
if(findroot(x)!=findroot(y)){
link(x,z),link(y,z),puts("YES");
else {
split(x,y);
if((sum[y]^v)==1){
puts("YES");
dfs(y);
else puts("NO");
return 0;}
question
<p>Question description</p><p>A game has n levels and m teleporters between them. You win the
game if you move from level 1 to level n using every teleporter exactly once.<br><br>Can you win
the game, and what is a possible way to do it?<br><br><strong>Input</strong><br><br>The first
input line has two integers n and m: the number of levels and teleporters. The levels are numbered
1,2,…,n.<br><br>Then, there are m lines describing the teleporters. Each line has two integers a and
b: there is a teleporter from level a to level b.<br><br>You can assume that each pair (a,b) in the
input is distinct.<br><br><strong>Output</strong><br><br>Print m+1 integers: the sequence in
which you visit the levels during the game. You can print any valid solution.<br>If there are no
solutions, print
"IMPOSSIBLE".<br><br><strong>Constraints</strong><br> </p><ul><li>2≤n≤10^5</li><li>1≤m
≤2⋅10^5</li><li>1≤a,b≤n</li></ul>
answer
#include <stdio.h>
#define N 100000
#define M 200000
struct L {
struct L *next;
int j;
} *aa[N];
struct L *new_L(int j) {
l->j = j;
return l++;
struct L *l = new_L(j);
int i = e->j;
aa[i] = l->next;
e = e->next = new_L(l->j);
i = l->j;
e->next = f;
int main() {
int n, m, h, i, j;
link(i, j);
dout[i]++, din[j]++;
printf("IMPOSSIBLE\n");
return 0;
if (dout[i] != din[i]) {
printf("IMPOSSIBLE\n");
return 0;
}
e_ = new_L(0);
m++;
hierholzer(e_);
hierholzer(e);
m--;
if (m != 0) {
printf("IMPOSSIBLE\n");
return 0;
printf("\n");
return 0;
question
<p>Question description</p><p>There are n cities and flight connections between them. You want
to travel from Chennai to Ladakh so that you visit each city exactly once. How many possible routes
are there?<br><br><strong>Input</strong><br><br>The first input line has two integers n and m:
the number of cities and flights. The cities are numbered 1,2,…,n. City 1 is Chennai and city n is
Ladakh.<br><br>Then, there are m lines describing the flights. Each line has two integers a and b:
there is a flight from the city a to city b. All flights are one-way
flights.<br><br><strong>Output</strong><br><br>Print one integer: the number of routes modulo
10^9+7.<br><br><strong>Constraints</strong></p><ul><li>2≤n≤20</li><li>1≤m≤n2</li><li>1≤a,b≤n
</li></ul>
answer
#include <stdio.h>
#define N 20
#define MD 1000000007
struct L {
struct L *next;
int j;
} aa[N];
l->j = j;
int main() {
int n, m, i, j, b, b_, x;
struct L *l;
while (m--) {
link(i, j);
x = dp[b][i];
if (x == 0)
continue;
return 0;
question
answer
#include <stdio.h>
#include <string.h>
#define N 100000
int dsu[N];
int find(int i) {
}
int join(int i,int j) {
int tmp;
i = find(i);
j = find(j);
if (i == j)
return 0;
tmp = i, i = j, j = tmp;
dsu[j] += dsu[i];
dsu[i] = j;
return -dsu[j];
int main() {
int n, m, i, j, c, c_;
c_ = 1;
while (m--) {
c = join(i, j);
if (c != 0) {
n--;
if (c_ < c)
c_ = c;
return 0;
}
question
<p>Question description</p><p>Your task is to deliver mail to the inhabitants of a city. For this
reason, you want to find a route whose starting and ending point are the post office, and that goes
through every street exactly once.<br><br><strong>Input</strong><br><br>The first input line has
two integers n and m: the number of crossings and streets. The crossings are numbered 1,2,…,n, and
the post office is located at crossing 1.<br><br>After that, there are m lines describing the streets.
Each line has two integers a and b: there is a street between crossings a and b. All streets are two-
way streets.<br><br>Every street is between two different crossings, and there is at most one street
between two crossings.<br><br><strong>Output</strong><br><br>Print all the crossings on the
route in the order you will visit them. You can print any valid solution.<br><br>If there are no
solutions, print
"IMPOSSIBLE".<br><br><strong>Constraints</strong><br> </p><ul><li>2≤n≤10^5</li><li>1≤m
≤2⋅10^5</li><li>1≤a,b≤n</li></ul>
answer
#include <stdio.h>
#define N 100000
#define M 200000
struct L {
struct L *next;
int h;
} *aa[N];
struct L *new_L(int h) {
l->h = h;
return l++;
struct L *l = new_L(h);
int h = l->h;
if (lazy[h])
aa[i] = l->next;
else {
lazy[h] = 1;
e = e->next = new_L(h);
i ^= ij[h];
e->next = f;
int main() {
int n, m, h, i, j;
scanf("%d%d", &n, &m);
ij[h] = i ^ j;
dd[i]++, dd[j]++;
if (dd[i] % 2) {
printf("IMPOSSIBLE\n");
return 0;
e_ = new_L(0);
i = 0;
m++;
i ^= ij[e->h];
hierholzer(e, i);
m--;
if (m != 0) {
printf("IMPOSSIBLE\n");
return 0;
i = 0;
i ^= ij[e->h];
printf("\n");
return 0;
}
question
answer
#include <stdio.h>
#else
#define I64(x) x ## ll
#endif
struct link
az_int64_t t;
int u, v;
};
int n, m, k;
az_int64_t c[64];
int gr[MAXN];
for(i=1;i<=n;++i) gr[i] = i;
gr[v] = u;
return 0;
int i;
scanf( "%d %d %d", &n, &m, &k);
int l, id;
if( !test( 0 ) )
printf( "-1\n" );
return 0;
return 0;
question
<p><strong>Problem Description:</strong></p><p>Canthi and Sami are having a game! The game is
extremely similar to chess, but there is only one piece on the board, which is the Queen. In addition,
Queen may only go to the top left corner.</p><p><br>For clarification, If Queen is placed at i,j then
in a turn queen can move:<br>1) Any number of cells leftwards.<br>2) Any number of cells
upwards.<br>3) Any number of cells Diagonally(only N-W direction).</p><p>Please note that board
is quarter infinite i.e there is a top left corner but it extends to infinity in south and east
direction..</p><p>Functional Description</p><p><br>1) Canthi will always play the first turn.<br>2)
They both will get alternative turns.<br>3) They must move the queen in their turn (No skip option)
and that too according to the rule specified above.<br>4) Whosoever is unable to make a move
loses.</p><p>Given The position of queen on the board(0 index based). Print who will win the
game.</p><p><strong>Constraints</strong>:<br>1<=t<=10000<br>0<=a,b<=1000000</p>
<p><strong>Input</strong>:<br>First line of input contains an integer t - no of test cases.<br>Each
test case is described as a line containing two integers a and b. which is the position of queen on the
board.</p><p><strong>Output</strong>:<br>print the name of person who will win the
game.</p><p> </p><p> </p>
answer
#include <stdio.h>
#include<math.h>
int v[2000000],i,t;
double fi;
int main()
fi=((double)((1+sqrt(5))/2.0));
for(i=1;i<=1000000;i++)
v[i]=-1;
for(i=1;i<=1000000;i++)
v[(int)(fi*(double)i)] = (int)(fi*fi*i);
scanf("%d",&t);
while(t--){
int a,b;
scanf("%d %d",&a,&b);
if(v[a]==b)
printf("sami\n");
else
printf("canthi\n");
return 0;
question
answer
#include<bits/stdc++.h>
int main(){
string s;
getline(cin,s);
map<char,ll> m;
int z=s.size();
for(ll i=0;i<z;i++){
m[s[i]]++;
ll max=0;
char res;
for(auto i:m){
if((i.second>max)){
max=i.second;
res=i.first;
cout<<res<<" "<<max;
return 0;
cout<<"for(i=0;i<l;i++)";
question
answer
#include <bits/stdc++.h>
f(i,0,n){
if(a==s[i]){
return true;
return false;
int main() {
int z,j=0;
cin>>z;
char i,b[26];
string s;
cin>>s;
int n=s.size();
if(cmp(i,s,n)){
b[j++]=i;
continue;
//continue;
else
sort(b,b+j);
else{
f(i,0,j)
cout<<b[j-i-1]<<" ";
//cout<<s[n-i];
return 0;
question
answer
#include <iostream>
#include <set>
set<pair<int, int>> h;
h.insert(make_pair(arr[i], arr[j]));
}
return h.size();
int main()
int n,i;
cin>>n;
int arr[n];
for(i=0;i<n;i++)
cin>>arr[i];
return 0;
cout<<"if(arr[i]>max) ";
question
answer
#include<stdio.h>
#include<string.h>
int main()
int M, Q, N,i;
int A[N];
scanf("%d", &A[i]);
int mx = A[0];
for(i=0;i<N;i++)
if(A[i]>mx)
mx = A[i];
// printf("%d\n", mx);
// printf("%d\n", size);
int hash[size];
memset(hash, 0, sizeof(hash));
hash[A[i]]++;
if(add == subtract)
hash[add]++;
else
hash[add]++;
hash[subtract]++;
if(hash[i]>ans)
ans = hash[i];
printf("%d\n", ans);
return 0;
question
answer
#include<bits/stdc++.h>
#include<climits>
void solve(){
int main() {
cin.tie(0);
cin >> n;
cnt += (mp2[it.first]*it.second);
question
answer
#include<bits/stdc++.h>
void solve(){}
int32_t main() {
solve();
int T;
cin>>T;
while(T--) {
bool ans=true;
int val=0;
int n;
cin>>n;
int temp;
int mx[50001],cnt[50001];
memset(mx,0,sizeof(mx));
memset(cnt,0,sizeof(cnt));
int tp=2;
mx[0]=1;
for(int i=1;i<50001;i++) {
mx[i]=tp;
if(tp%6==0) {
i++;
mx[i]=tp;
tp++;
for(int i=0;i<n;i++) {
cin>>temp;
temp--;
cnt[temp]++;
for(int i=0;i<50001;i++) {
if(i>0)
cnt[i]+=cnt[i-1];
if(cnt[i]>mx[i]) {
ans=false;
val=i;
break;
if(ans)
else
val=mx[val];
cout<<"Goodbye Rick\n"<<val<<endl;
return 0;
question
swap(L[i] , R[i]);
answer
#include <stdio.h>
#include <string.h>
*l = *r;
*r = temp;
int main()
for(i=0;i<t;i++)
scanf(" %lld %lld %lld %lld %lld %lld", &l, &r, &c, &p, &q, &s);
deltas[l] += c;
if (r < n - 1)
deltas[r+1] -= c;
temp_l = (l * p + r) % n + 1;
temp_r = (r * q + l) % n + 1;
l = temp_l;
r = temp_r;
if(l > r)
swap(&l, &r);
c = (c * s) % 1000000 + 1;
max = 0;
sum = 0;
pos = 0;
{
sum += deltas[j];
max = sum;
pos = j;
return 0;
question
answer
#include<bits/stdc++.h>
void solve(){
cout<<"int NA[N];";
int main(){
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
unordered_set<long long> s;
sum += a[j];
if(sum<0){
sum = 0;
s.insert(max_sum);
for(auto i:s){
ans+=i;
}
cout<<ans;
question
answer
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main()
scanf("%d", &cases);
int results[cases];
for(i=0;i<cases;i++) {
flag = 0;
bins[j] = 0;
char str[N][100];
scanf("%s", str[j]);
len = strlen(str[j]);
//printf("%d\n", len);
bins[len] += 1;
if (bins[j] % K != 0) {
results[i] = 0;
flag = 1;
break;
if (flag == 0) {
results[i] = 1;
if (results[i] == 0) {
printf("Not possible\n");
}
else {
printf("Possible\n");
return 0;
question
answer
#include<bits/stdc++.h>
int main()
int N,m,i;
cin>>N;
int a[N];
for(i=0;i<N;i++)
cin>>a[i];
cin>>m;
int b[m];
for(int i=0;i<m;i++)
cin>>b[i];
sort(a,a+N);
sort(b,b+m);
int ans[100]={0};
for(int i=0;i<m;i++)
for(int j=0;j<N;j++)
if(b[i]-a[j]>0)
ans[b[i]-a[j]]++;
for(int i=0;i<100;i++)
if(ans[i]==N)
cout<<i<<" ";
return 0;
question
<p>Problem Description:</p><p>Kapildev is a mobile phone marketer. </p><p>For example,
if someone answers this question correctly, a mobile phone will be handed to them at a 50%
discount. </p><p>The goal is to discover the three elements that are closest to each other
from three sorted arrays. </p><p>So obtain three input arrays from the user, all of which
should be sorted. </p><p>As input, take the three sorted arrays and their
sizes. </p><p>The closest element from three arrays should be the final
solution.</p><p>Constraints:</p><p>0<array_size<100</p><p>0<arr_elements<1000</p>
<p>Input Format:</p><p>first line represents the number of elements N in first sorted
array</p><p>second line indicates input elements according to N</p><p>third line represents the
number of elements M in second sorted array</p><p>fourth line indicates input elements according
to M</p><p>fifth line represents the number of elements L in second sorted array</p><p>Sixth line
indicates input elements according to L</p><p>Output Format:</p><p>Single line represents the out
put that are closest to each other from three sorted arrays</p><p> </p>
answer
#include<bits/stdc++.h>
int i=0,j=0,k=0;
if (diff == 0) break;
cout << A[res_i] << " " << B[res_j] << " " << C[res_k];
int main()
int p,q,r;
cin>>p;
int A[p];
for(int i=0;i<p;i++)
cin>>A[i];
cin>>q;
int B[q];
for(int i=0;i<q;i++)
cin>>B[i];
cin>>r;
int C[r];
for(int i=0;i<r;i++)
cin>>C[i];
findClosest(A, B, C, p, q, r);
return 0;
question
answer
#include<bits/stdc++.h>
int main() {
int N, K;
cin>>N>>K;
string S;
cin>>S;
int cur_score = 0;
for(i=0;i<N/2;i++) {
return 0;
question
<p>Problem Description:</p><p>vijay has just finished baking several burgers, and it's time to place
them on cooling racks. vijay has exactly as many cooling racks as burgers. </p><p>Each
cooling rack can only hold one burger, and each burger may only be held by one cooling rack, but
vijay isn't confident that the cooling racks can support the weight of the burgers. </p><p>vijay
knows the weight of each burger, and has assigned each cooling rack a maximum weight limit. What
is the maximum number of burgers the vijay can cool on the
racks?</p><p>Constraints:</p><p>T≤30</p><p>N≤30</p><p>Input Format:</p><p>Input begins
with an integer T≤30, the number of test cases. </p><p>Each test case consists of 3
lines. </p><p>The first line of each test case contains a positive integer N≤30, the number of
burgers (and also the number of racks). </p><p>The second and third lines each contain
exactly positive N integers not exceeding 100. </p><p>The integers on the second line are the
weights of the burgers, and the integers on the third line are the weight limits of the cooling
racks.</p><p>Output Format:</p><p>Print the maximum number of burgers vijay can place on the
racks.</p>
answer
#include <bits/stdc++.h>
int main() {
int n,t;
cin>>t;
while(t--){
cin>>n;
int cnt=0;
int no[32],w[32];
for(int i=0;i<n;i++)
cin>>no[i];
for(int i=0;i<n;i++)
cin>>w[i];
sort(no,no+n);
sort(w,w+n);
int j=0;
for(int i=0;i<n;i++){
if(w[i]>=no[j]){
j++;
cnt++;
cout<<cnt<<endl;
}
question
answer
#include <bits/stdc++.h>
int main() {
int tt;
int n;
cin >> n;
vector<vector<int>> trie;
trie.emplace_back(ALPHA, -1);
while(n--) {
string s;
cin >> s;
int t = 0;
if (trie[t][d] == -1) {
trie.emplace_back(ALPHA, -1);
visits.push_back(0);
pv.push_back(t);
t=trie[t][d];
visits[t]++;
int ans = 0;
if (visits[i] < 2) {
continue;
ans++;
int v = i;
while (v != -1) {
visits[v] -= 2;
v = pv[v];
return 0;
}
question
answer
#include <iostream>
int main()
int n,count=0;
cin>>n;
int arr[n];
f(i,0,n)
cin>>arr[i];
f(i,0,n/2){
if(arr[i]==arr[n-i-1])
count++;
if(count==n/2)
return 0;
int ans = 0;
if(arr[i]==arr[j])
i++;
j--;
j--;
arr[j] += arr[j+1] ;
ans++;
else
i++;
arr[i] += arr[i-1];
ans++;
}
}
return ans;
question
<p><strong>Question description</strong></p><p>Janu and Ram are close friends who task a lot
about life.</p><p>They go though a lot of inspiring "Quotes of Life".</p><p>One fine day they had a
small game.According to the game Ram will Read one of the Quote about life from the book and
Jannu have to think a word about life in her mind without disclosing it to Ram. all rounds completed,
every round they are getting equal marks. So they decided to make some technical test on
algorithms to prove themself. they have to open a book randomly and then they have complete the
same task. likewise janu opened the book and got the task is, Given a binary array and number of
zeros to be flipped, write a program to find the zeros that needs to be flipped so that the number of
consecutive 1’s is maximised</p><p>can you help janu?</p><p><strong>Function
Description</strong></p><figure class="image"><img
src="data:image/png;base64,/9j/4AAQSkZJRgABAQAAAQABAAD/4gIoSUNDX1BST0ZJTEUAAQEAAAIY
AAAAAAIQAABtbnRyUkdCIFhZWiAAAAAAAAAAAAAAAABhY3NwAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAQAA9tYAAQAAAADTLQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAlkZXNjAAAA8AAAAHRyWFlaAAABZAAAABRnWFlaAAABeAAAAB
RiWFlaAAABjAAAABRyVFJDAAABoAAAAChnVFJDAAABoAAAAChiVFJDAAABoAAAACh3dHB0AAAByAA
AABRjcHJ0AAAB3AAAADxtbHVjAAAAAAAAAAEAAAAMZW5VUwAAAFgAAAAcAHMAUgBHAEIAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFhZWiAAAAAAAABvogAAOPUAAAOQWFlaIAAAAAAAAG
KZAAC3hQAAGNpYWVogAAAAAAAAJKAAAA+EAAC2z3BhcmEAAAAAAAQAAAACZmYAAPKnAAANWQ
AAE9AAAApbAAAAAAAAAABYWVogAAAAAAAA9tYAAQAAAADTLW1sdWMAAAAAAAAAAQAAAAxlbl
VTAAAAIAAAABwARwBvAG8AZwBsAGUAIABJAG4AYwAuACAAMgAwADEANv/bAEMAFxARFBEOFxQS
FBoYFxsiOSUiHx8iRjI1KTlSSFdVUUhQTltmg29bYXxiTlBym3N8h4uSlJJYbaCsn46qg4+Sjf/bAEMBGBoaIh
4iQyUlQ41eUF6NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2Njf/AABEI
A2oFXgMBIgACEQEDEQH/xAAbAAEAAwEBAQEAAAAAAAAAAAAABAUGAwIBB//EAEwQAAIBAwEEBQ
oDBQYCCQUBAAABAgMEEQUGEiExE0FRcZEUFSIyMzRSU2FygbHBIzVCc6EWNoKS0eFUYiRERnSDk8Lw
8SZjZKOyQ//EABkBAQEBAQEBAAAAAAAAAAAAAAABBAIDBf/EACYRAQACAQIHAAMBAQEAAAAAAAA
BAhEDUQQSExQhMTIzQWEiI4H/2gAMAwEAAhEDEQA/ANYAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAB4dWmnh1Iprqyez831GVaet3FOFSScq7ivS+oH6L01L5kP8yPqq05PEZxb7EzF/2Y1b5sf/ADCZpOga
jaalSr16idOD4rfyBYahtNaWN47eUJzcfWlHki3o1Y1qUalN5jJZTM3q+n6NU1KU7m76Gpwc4KS4mgU6F
nZqW8oUYR4NvhgDuCHR1WxrwnKnc03GCzJ55HKOvabKpuK7p5+r4AWIPkZKUVKLTT5NHitXpW9N1K
9SMIrrk8AdCDV1iwo13QqXCVRPd3cPmeKeu6bUqbkbqGerLMbqrT2jqNcV0y/MD9DTyk1yYPNP2Ue5
CrFypTiubi0gPnTU/mQ/zIdNS+ZD/MjGS2Y1ZybVSOG/mEW+0XUNPt3WuK0VFf8A3OLA3vTU/mQ8T2f
nOjULq91GlGlKbUJKUm28JJn6K2oxy3hLrA+grquu6bSnuSuqbf0ZLtrqhdw37erGpHti8gdgcLq8t7OCnc1
Y04t4TZyWq2Lt+n8ppqnnG82BMByt7ildUY1aMlKEuTRxutTs7OW7cXEIS+FviBLBCttXsbqe5RuYSm+Uc
8SaABEutUsrSW7XuIRl8OeJzo63p1aSjC6p7z5JsCeAnlZR5q1IUabnVkoQXNvkgPQMPqWvXkdXqRtrx+T
76xu4awa+2v7W5ahRuKdSeMtReWBJB5qVYUYOdWahFc23gr3r+mKe75VDvzwAsgc6NelcU1OjUjOL5
OLydAPkpKEHKTwkstkO31exuqyo0K6nUfVhne89zr/y5fkYXZqUYa7GUmkkpZbA/QAVz17TFU3Hd089u
eBOpVYVqanSmpwfJpgewfJSUYtyaSXNsr6mvabTnuu6g39GBYg5W9zRuqe/QqxqR7YvJ1AHjpqS/wD9If
5kez8zar3OoOjTqS3pzaXpMD9J6al8yH+ZH2NSEniM4t9iZi/7L6t86P8A5hYaHol/Yaiq1xUUqai1jeyBcT1
mwp3DoTuEqqluuOHzPWp6lR0y26atlpvCiubMPf8A956v/ef/AFGy1y3s7iw3b6p0UE+E84wwPuk6zQ1
aE3SjKEoc4yLEptnrTT7alVdhW6ZtrflnJMqatY0q/QVLiEamcbrfWBNBAr61p9vPcqXMFLrSfIkWt7b3kd6
3qxqLr3XyA7g43V3Qs6aqXFSNOLeMtnFatYuh0/lNPo843s9YEwEChrWn3FRQp3MN58k3zJ4AHG5uqF
pDfuKsace2TwRKeu6bVnuRuqefq8AWICakk08pnOvXpW9N1K9SNOC65PAHQg1dYsKVw6FS4SqJ43cP
meIa7ptSpuRuqeXyyzG6s09o6jT4dMvzA/Q08pNcmDzT9lDuR6AAi3Wo2lm8XFeFN9jfE4Utd02rLdjdU0
/q8AWIPkZKUU4tNPk0RbrVLOzlu17iEJfDniBLBCttXsbqahRuYSm/4c8SaAAM1tPrE7aNOFjdqNRSamo4
bQGlOF3e29lTU7moqcW8JtFPoGswqafm/vIdNvP1mk8HPbT920f5i/JgXlpeW97TdS2qKcU8NpHcy+yt3
b2mk1Z3FWNOPSfxPHUXNDWtPuKip0rmDk+Sb5gTwCJc6nZWjxXuKcJfC3xAlgr6Ot6dXmoQuobz5Jvm
Tp1IU6bqTkowSy5PkB6BidX167hqs42l4+gysbuGjV2eoW1xCnCFxTqVXFZSfECWAc69elbUpVa01CEebY
HQEOlq1jVpzqQuabhD1nnkcoa7ptSpuRuqefqwLEHxNSWU8rtIc9XsKdd0Z3MFUTw4t9YE0Ahed7Dp+g
8ph0m9u7ueOQJoOF1d0LOmqlxUjTi3jLZyWrWDt3X8pp9HnG9nrAmAg2+sWF1UVOjcwc3yjnizrd6ha
WWPKK8IN8k3xYEk8VasKNKVSpLdhFZb7CNa6rZXkt23uISl8OeJ81n90XP2AfbTVLO9qOnbVlOSWcJM
mGF2QqQpajVnUkoxVN5bfI1K17TXU3PKqee3PACxB5hOM4qUJKUXyaFSpCnBzqSUYrm2B6BWvX9M
U913cO/PAn0a9K4pqpRnGcHycXkD2CNd39tZbvlNaNPe5bz5nieq2MKEa0rmmoS9V55gTAeKNWFelG
pTe9CSymewAONzd0LSG/cVY049sngiU9e02pPdV1BP6sCxPFWrTo03OrOMIrm28HpTi4b6accZyY7a/U
YV5UqFvWjOCWZbr6/qBoI7QaZKoqaulvN49Vlkmmk1yZi9H0jTK1GhVrXn/SJNS6NSXhg2i4LC5AD42or
LaS7WcL+8p2FpO4q+rFcu1mFr3+pa5d7lJz4vhCHBJAb1XNBvCrU2+zeR1MM9l9UjDfUo73PCnxJmzdTV
qd7K3rRnKjDhPpP4fxA1oPNSpClBzqSUYrm31FfLX9MjPdd1DvT4AWQOdC4o3NNVKFSNSL64vJ4ury3s
4KdzVjTi3hNsDuCH51sfJ+n8pp9HnG9nrPFDWdPuaihSuYOT5JvmBPAIl1qdnZvduLiEJfC3xAlgr6WuabW
luxuqab6m8E9NNZTymB9BDutWsbSe5XuIRl8OeJ9tdTs7yW7b3EJy+FPiBLAI11qNpZ+8V4Qb5JviBJBAt
9a0+5moUrmDk+Sb5kutWp29KVWrJRhHm2B0BFtNRtL2bjbV4VHFZaTO1xcUrajKrWmoQjzkwOgIttqV
pdqboV4TUFmWHyMvtBrlzT1HFhefst1ephrIGyKrVtettKqxpVIzqVJLOI9SOunanb17ahGVzTnXlBZWeLe
CBtBZaZcV6c7246CrjCeUsoC3sL2lf2kLijndl1PmiQVlrX07S9NoqFeMaEvVlJ+syba3dC8pupb1I1Ip4bT6w
OwPFatTt6MqtWShCPNvqONpqFreuStq0ajjz3XyAkgj3V/a2aTua8KeeSb5nC31nT7mahSuYOT5JvmBPA
AHl1aaeHUin9WI1ISeIzi32JmP1nRNQ6e5vI1UqSzPG/1Ij7JVJy1pKU5NdG+DfcBr7vVLOyqRhc11CUuSw
2SYTjUgpwkpRksprrMVthauGqRrb+900ViPZjgarSKUrbSbenUfGMOLfiBNBXVdd02lLdldQbXPDyd7XUr
O8eLe4hOXYnxAlHG8uqdlazuKzxCC4nYjajSt61jVhdvdotek88gIOlbQ22p3DoU4ThNLK3utFuZ7QLHSqF
3Odnc9PVx1tcEXdxd29pDfuKsace2TwB2BWLaDTHLHlUF9WywpVqdemqlKcZwfJpgewAAAAAAAAAAA
AAAAD821Capa/XqPioXDl4SP0k/N76KntDWhJZjK5aa+m8BoltlbY93qf0LHSNcparOcadOUNxZ9I+rZ3Ss
L/oq/zP8A1JNnplpYSlK1oqm5c+LYGK2r/f8AX7o//wAo1Os/3Zqfyl+Rltq/3/X7o/8A8o1Os/3Zqfyl+QGN
0jT6up3Xk9Oe5HG9N9iLHWdmvNtn5RSrupGLxJNYO2xPvtx/L/VF7tN+464FdsbeTqW1a3qSbVPDjnqRS
aze19W1Z0It7qqdHTj+OMlhsWs1bldsUVNRy03XpTqR9nW3u9Zz+QF7HY2Hk+Xcy6bGfV4ZM10NS31K
NGr68Kqi/E/QFrWnu26byqnjGd3eWfAwlzdK81p3EViM6ya7sgfpFP2Ue5Ho80/ZR7kfW1GLbeEuLA8V
69O3oyq1ZKMIrLbMFqV7ca9qUadGLcM4pw7Pqd9pNbd/WdvQl+wg+OP4mWOzq03TqHS1rqj5RNcfS
XorsAutH0unpdoqccOo+M5drKDa/VKirKxoycY4zPHX9DQrWNPk0ld0sv8A5kZLa63lT1RV+dOrFNPqAk
WGz9hUtI1Lq9iqk1nCkvRK91Kmgav/ANHrqpTTXGL4SiTdO0vRby1jOd46VTHpRlJLDO1HRdEr3nk1K9n
OpjPBpp/iBI2vmqul29RcpPJSaNo1fV84qblGn1vt+hd7XUo0dKt6Uc4jLCO2xv7rn94Hq+m9ntAjRpT36n
qxk1jn1lBoui1daqVK1as4wT4y5tsv9r7adbS1Ugm+illpdhX7Jarb29GpbXE1Tbe9GUnhARNb2flpVKNzQ
qudNPDysOLLTSNXr3Gg3WW5V7ePCXW11HzanVrapp7taFWNWc2m3F5SSZz2Pt+is7q5r8KU8LjyaWc
/mBR6XRtb28l5xuXTTWd5/wATL6OzGn1pwlbXmUnxjlPKPE9I0TUG6treKi3x3VJfkyk1C2803kY2t2qjxn
epy5d4H6NCKhBRisJLCOGoWivrOpbubgprG8lnB50utO40y3rVfXnBNkoD8yv7JWepztFNyUZbu81g2Oj
7PQ0y5VxG4lUbjjdccGY19bm0NZy4LfT/AANza31rcRpxpV6c5SjlRUk2BjNd1CvqeqO1pt9HGW5CK632l
nDYyDt/TuX0rXVHhkpLqM9L19zqRf7Orvr6rmbaGtafK26byqmljOHLD8AMbpt5caJq3Qzk9xT3akeprtP
0CL3oprr4n51cSer67KVGL/azSXdyyfolNbtOK7EkBzvPc6/8uX5H5taWtS8vo29F4lOWM9iP0m89zr/y5fk
fnukXkLDV4V6nqJtS+iAva+x0Y20pUrlyqpZw48GV+zWoVbLVI2lST6OpLcceyXI1VfW7ClbOsrqlLhwipJt/
gY3R6cr3aGnOEXjpelf0WcgWW1up1ZXfkNKTjTivSw+bPtns7p8rWMrm9iqslnCkvRIO1VvKjrEqkk9yqt5
Ml2OlaJd20ajvXTnj0oykk0wINCvU0LWN2lWVSmms7r4SR+gRkpRUo8U+JkbbRdFubt29C8qTqRWeDW
H3M1tOCp04wXKKwB6PzOlXVtqyryTahUbaR+mH5ra0oVtahTqLehKq012gaT+2Vt/w9T+haaRrFPVlUd
OnKG5jO8ef7O6X/wAKv8z/ANSXZ6fa2CkrWl0e9z4t5Awl/wD3nq/96/8AUafa/wDcr++P5mYv/wC89X/
vX/qNPtf+5X98fzAibEe7XX3R/Uodez58r7vPe4F9sR7tdfdH9Si1yW5r1aaWd2aYFza7IRq2salxcSjVms4S
ykUz8p0DV3FT4wfHHKUTZWWt2FazhUdzTg1HjGUkmjHa5dx1TWHK39KLxCPDmBoNq6qraHRqrlNqR
RaFo1TVpS3qjp0afN8+LLraWk6OzttTfOO6mRNktUt7VVbe4mqe+04ylwQHHXNnPNturmhVdSCeJZWG
i02Z1eVXT61O4lvO3WVJ9a/9obT6vay06VtQqwqzqNeq8pLJA2Xsalayvp4ajUhuRfa+IFcqlXXtW/6RWV
ODfOT4RXYWd9s9YU7SU7W9i6sFnDkvSKK0pUI3yo3+/Tgnuya5xZoJaLoUaXSPUPRxnhNAfdkdTqOpOy
rScoqO9Bvqx1FZrN7X1XV3Qg3uqfRwjnhzxk0Gh6Rp6avLKvOplOPHqMzVctM1+UqsX+zrb2O1Zz+QF5
HY2HkybuX02M+rwyZp0alvqUaNX14VFF/gzfrWtPdt03lVPdxnG8s+Bhbq6V5rTuIrEZ1U13ZA/SKfsodyP
NxKULepKHrRi2vA9U/ZQ7kfZNKLcuSXED83tOiv9SzqVw6cZtuUnx49hff2a024ivJL30u/OT1W03Q9Tqzq
UbpUJ7zylJLL7mUmq6fDSqtN217Gq5fBLjHvA1et3a0bRowt1iTxTg+zhzM1oui1NaqVK1aq4wTw5c22T
NR8o1HZS2uZ5lOlP0vquWT3slqtvb0alrcVI025b0ZSeE+H+wETW9n5aVTjcW9Vzp5w88HFl9stqdS/spQr
veqUnjPaiJtTq9rUsPJaFWNWc3l7rykhsVbThb1q8k1GbxH6gacw21GlRsq7ulVc3cVG3FrGM8TcmX23i/J
reXVv4/owK/RNnIalZq4lcyptSxuqOS02zWNMorsqL8mfNlb61o6VKFWvTpyjNtqUkj7to09Motcc1F+TA
otD0Ser77lVdOlB4bxniNc0SWjzpyhV6SnPk8YaaL/Yv92Vf5n6HPbb3Oh9zAsNmrud5o9N1Xmccxb7cFZ
W2XoO9q1Li8jCnKWYxzx/qddl6jpbP1qkVlw3pL8MmfsYPWdW3L25lBTy8t/0QHbW9Ht7ClGta3Uaqcs
OOVlFzs9Unquh17StUa3cwUubw0VevaPYabbRdGvKVZyxutrkWOxHu9x9/wCgGc1OxVhqMrVTc1Fr0
msGs0bZ2FhcU7tXMpvd9VxxzRntpVu69UcuHJmzsb+1rUKEKdxTlOUViKks8uwCaVO0/wC4rjuX5lsVO0
37juO5fmBjtG0yrqtw6MJ7lOKzN9hN1vZx6ZbK4pVnUhnEk1hol7Ee3uftX5lttX+5Kn3ICLsdeVK9lUo1JO
XRP0c9hndS/vFV/moudiOVz+BT62pW+0FaUlympL6oD9DXJH52v7zr/vP/AKjYraDTvJOm8oh6udzPpeBi
rar0+vUqvJTuFLxkBp9sv3TT/mL8ih0PRZ6upuVV06NPhnGeJfbZfuqn/MX5HnYr931v5n6AZ/W9Ino9xB
RqOcJLMZYw8kzStDra3Cd3dXMkm8Jvi2TNt/VtO+X6Fnsn+46f3MDIalY1tF1FQjUeViUJrgbO6ru52ZnWf
OdHLM9tr+86P8r9WXUP7nL+QBj9LsKuo3kbek91S9aXYi+vtkVRtJVLevKdSCzutYyVWzl/S0/U1OtwpzW
632Gv1DXLG3s5zhcU6kmvRjGSbbAz+yOpVKd55FUk3Tqeqn1M5bS6lVvNRdnTlu0oNRxnCb7Wcdlredb
WqdSKe7SzKT/DH6nDXbaVtrNZVU92Ut5PtTAuaezenO2XSX8ema5qSwmV2k3lXSNZVv0inSlPclh5TzyZ
OttH0O4oKor9xyuKlNJo62GjaPc3TjbXVSc6Uk8ZXEDztvx8ka/5v0K7R9Br6tS6WdXo6MfRT5t9xYbbLCtF
2Z/QttlVjQ6X3MCys7fyS0p0FLe3FjOOZ6uayoW9SrLlCLZ0I+o0XcafXpR5yg0gMHBXW0Wq7sp+s88eUY
lve7IKlayqW9eUqkVndaxkqtAvYaZqublOMXmEsr1Wa++1uxt7OdSNxTqSa9GMZJtgZ3ZbU6iuHp9Wbd
Oqmo5/heCDtBpcdLu4xjVdTpFv8VjHFnTZe2nca1TqJejSzKT/AAx+pM229+t/5f6sDtoezkKlK2v/ACmSbx
Lc3eHia0rdn/3Ha/YiyAzO21SUbS2pr1Zyk3+GD1sZQhGwqVsLfnLDfYiVtTYTvdM3qUXKpSe8kutdZn9m
9bhps50LnPQzec/CwN0CBLW9OjT33d08dilx8CLp+0lrf3sreKcG/Ub/AIgM9tJqVW+1F2lJvo4S3VFdcv8A
5J9HY2ErZOrctVWs4UeCKbVaU9P1+c5x5VelX1Wcm0oa3p9W2VXyqnHhxjKSTX4AY21r3Wgau6TlwjLd
ms8JLtL3bKSnplvNcpSyvBGf1Kv521xyt4tqpJRjw5rtL7a6Dp6RawfOLx/RAU2h6JU1eMnKq6dGDxnGeJ8
1zRZaRUpuNV1Kc+UsYaZoNjP3VP72cdt/dLb+Y/yAmaTf1q+zbr8ZVaacc9uDI6fChfX7eo3LpxlxcnxyzVbI
uK0KTnjdVSWc9yIdTS9D1KTq212qMm/V3kv6MD7/AGZ064Sdre8c8s5yT9ob56VpUaVv6M5+hH6LtM
pqdktJuIeTXiqN8cwlxXgWusqvfbOWd5NOUoes+/rAiaLpNDUYTuL66jBZ4Jy4v6njV9Op6TWp17G6U1n
+GXGLPOjWemXkZQvbiVGonw4pJr8SwraRoNGcISv5NzePRknjvAsY67L+zXlr9v6n+Llkz2k6ZW127qVK1
VqK4zm+LZearosLbZ6dK0lKooS6Tj1lfsnqdCznVoXE1TU3lSfBAdb7ZGpS3JWNXpHnDUuGPqWd9b17bZ
epSuavS1Ixxk7320NhZKOKsazk+KpyTwu0ajXp6ls/Xq2st6Lg3y7AKLYr32v9iLzaj9w3H+H80ZnZa/o2OoS
8okoQnHG8+plttPrFpU092tvVjVnUazuvKS5gRNjqXTK+pt434JZ8Sp1vTlpl90CqOot1Sy1guth/a3f2x/Uh
7Yxa1dPqcEBaaLs5CjK2vvKZN7qlubvDiiHtr73Q+1l/pN/az0+1hGvT39xR3d5Zz3FBtr73Q+1gTadkr7ZCE
EvTjHej3or9kL10L6dpUeI1OWepo0WzvHRLf7TJ6xQnpGu9JS4LeVSAFttnfuFKnZwfGb3p47DppUPMuz
dS7nH9rUW9x/oUdNz17aCMmmoylnD6oo1uvWjr6HWo0V6sU0l9AMjp9s9av6lS9uVCK4ylJ8X9EStX0
S0tbV17K7jNwxmDksvuK3SqNlXuXTv6kqSfKS5Z+pdV9H0K3p9JPUG12Rmm3+AFhsnqdS8tZ0Kzcp0cYk
+tGgKnQ9LtLKMrizqyqRrRXFstgIer/ui7/ky/Ix+yH77X8uX6Gw1f90Xf8mX5GP2Q/fa/ly/QDUX+iU7/AFCl
dVa0sUsYhjgQdsa9Wjp1KnSbjCpJqWOzsNEQdXlYqz3dRx0UnhZ7QMjo2n6ZeUM3d04Vc+pywX2l7P2t
nfK6oXCqxiuEexldU2c0yrFzttRik+pyTSKzSLitY63To0au/B1VB4fCSzgD9CIGufue5+wnkDXP3Pc/YBl9jP3l
V+wh61Wlc69Vjczcacam59sck3Yv95VfsLXVLXRtQvZ061eNG5jwlJPGfHgBDp7P6PcUv2F96TXPP6M0G
k2ENOsY0IS3uty7WY/VtFoWFv09C+hUafCOVvPwLzY+7r3FnVhWk5Km0ot/UDQgAAAAAAAAAAAAAA
AGcq7KdLqUrvyvG9V6Td6P65xnJowAXBAADP6rsx5yv53XlXR76Xo7mcYWO0tLyx8q0yVn0m7vQ3d7G
f6EwAU2iaD5orVKnlHS78d3G5jHHvJ2p2XnCxnbb/R7/wDFjOCWAKfRNC80TqS8o6XfWPVxj+p11bQ7b
VEpT9CquU1+pZgDJ09jMVP2l5mHYoc/6naWx9NXUatG6cIRaai4Z5fXJpgB8it2KXYsHmrDpaM4ZxvRay
ewBk/7Ff8A53/6/wDcf2K//O//AFf7msAGVhsZuVIy8uzhp+z/ANzQXWn0L20VvcR3opYT619SUAMpW2
M9PNG7xHscOX9Sbpey9CxrxrVarrVIvMeGEmXwArda0nztbwpdN0W6853cnrRtL81Wro9L0uZZzu4LA
AfJxjODjJJxaw0zOX2yFCtUc7Ws6Of4XHKNIAMxabHUoVFK6uHUS/hjHGS/qWNGpYu0Udyk47uI8MIkA
DK1djFvZoXbiuxx/XJ1s9kKNOqp3Vd1sfwpYNKAPkIqEVGKxFcEkfQAKjWNn6GqSVTfdKsljeSzlEPS9l5WF
7C4d3vbnJKOM/1NGAK/VNHttUglWjia9WceaKJ7Fy3uF6t37P8Ac1oArNK0O10xb0Fv1Xzm/wBCzAA8V
odLRnTzjfi457MozdHY6lGrKVa6dSLT4KGMPtzk04Ayb2L/AGnC89D7OP5l7pekW2l08UU5TfrTfNk8ARb
/AE+31Gh0VxDK6muaM7U2M9PNK7xF9Thy/qawAUelbM0NPrRrzqOrVjyeMJF4AAM5Q2U6HUI3Xled
2e9u9H/uaMAAABnbjZbptTleeV43qvSbvR/XOM5LPV9N86WXk/S9HxT3t3JPAFXomj+aKdWHTdL0jTzu
4xgx+tRUtoKsXydRJn6IUF3sxC61CV07iUW5KW7gCHV2OhUanQuXCMknuyjnBY6Ts3bafUVWcumqrk2
sJfgXMY7sFHsWD6Bn9sv3VD7ym0PQ6WrWFSTqOnUhLCklleBqtY0yOq2qoyqOnh5ykedG0qOk0J0o1
HU3nnLQFNb7GRVVOvdOUF/DGOM/jk0tvb0rWhGjRiowiuCR1AFPquztrqU3VTdKs+corn3oqo7Fy3sSv
PR+kP8Ac1oAhaZpdDS6Dp0Mty4yk+s46todtqiUp+hVXBTRZgDJw2MxUXSXmYJ8lDn/AFO09j6flUatG6
cIRaai4Z5fXJpgB8it2KXYsHyrTVWlKnLOJLDwegBlq+xsHNyt7uUF2Sjn+uT1b7HU41FK5uZVEv4VHH9TTg
DnC3pQt1QjBKko7u71YM/e7IUK1Rztqzo547rWUaQAZi02OpU6ilc3DqJfwqODSUqUKNKNOnFRhFYSX
UewAI2oWNHULWVCuvRfJrmmSQBk3sW9/wBG8xH7P9y11HRHf6dQtHcOPRNem45zhd5bgCu0XS/N
NtOj0vS70t7O7g863pHnejTp9N0W4853c5LMAV+kaWtMsnbup0qbbb3cFVe7I0qtd1bW4dHLzutZNKA
MzHZCDoTVS6lKrLlJx4R/DJZaJo/minUh0/S77zndxj+paACp1nQaGq4m5OnWisKaWeBA07ZWVne07h3
be48pKOM/1NKABE1Oy84WNS23+j3/AOLGcEsAU+h6F5onVl5R0vSLHq4x/UmarYecrGVt0nR7zzvYyTA
BU6Honmjpf2/S7/8Ay4x/U9axoVvqqUpN06sVhTS/MtABlKOxkVVTrXW9Bc0oYz/U709koUr+FxTusQh
NSUNzs+uTSACu1nS/OtpGh0vRbst7O7k+aLpPmm3nS6bpd6Wc7uCyAFTrmi+d1SXT9F0ef4c5z+JK0m
w822MbbpOk3W3vYwTABS63s/52uYVvKei3YbuNzPX3kxadjR1YdJ/Bub+P0JwAzFDY2jBVFWuXU3o4ji
GN19vM4rYt7/G89D7P9zWgCHpum2+m0Ojt48/Wk+bPmpaVbanS3K8fSXqzXNE0AZKWxb3/AELz0frD
/ctdI2eoaXU6XfdWrjG8+CX4FwAKjXNE87ul+36Lo8/w5zn8SXpVh5tsY23SdJutvexgmAAAAKbVdnLXUZ
urFujVfOSWU/wKynsW9/8AaXmYrshz/qawARdP06306h0VvHGebfNkDW9A8716dTyjotyO7jcznj3lyAI
2n2nkNjStt/f6OON7GMkkABjJR6lsvaXs3VpSdCo+Lwsp/gXgAx62Mq73G7il27n+5eaVoNrpnpxXSVfjl+h
aACDqelW2p0lGvHEl6s1zRQS2Le/6N56P2f7mtAFVpOgWumPfjmpV+OXV3HvWtJ87W8KXTdFuvOd3J
ZACv0bS/NVq6PS9LmWc7uDxrmked6NKn03Rbks53c5LMAVunaPGy0udjOq6kZttyS3Xx/8AgqK2xsd/N
vduC7JRz/XJqQBmLXY+lCop3Vy6qX8Kjg0fk9LoOg3F0WMbvVg6ADNXmx9CpUcrWu6SbzutZPFrsdThU
Urm5dSK/hjHH9TUADxClCFJUoxxBLCX0KHUNk7a5qupb1HQlLi1jKNCAMtbbGwjUUri5c4r+GMcZ/HJpK
NvSoUFQpQUaaWN06gDNX2yFGvWdS2rOkm8uLjlHmlsdRjQnGpcOVWS9GW7wj+GTTgCo0PQ/NEqr6
fpekSXq4xj8Trq+jUNVpxVRuFSPqzXUWQAy9psjKhdU6rvOFOSkkoc8fiTta0DztVpz8o6LcWPUzn+pdAC
Np1n5BY07ff39xY3sYyRNb0WGr06adTopwfCW7ngWgAp9E0CGk1KlR1umnJYT3cYRcAAUOpbK2t5Ud
WjN0Jvi8LKf4EGlsZ6a6W7zFdShz/qawAcLKzpWNtGhQTUI9vWdwAON5Q8qs61De3ekg45xnGUU+kb
N+a73yjyrpPRcd3cx+pfAAQNW0mjqtKMKs5RcHmLRPAGSexk1LEb30fs/wBy00nZy206oq0pOtVXKTW
EvwLkADhfW3llnUob25vrG9jODuAKTRdnvNNzKt5T0u9HGNzH6nHUNlKV3cTr0ridOc3l5W9xNCAMpT
2NbkumvG49ij/uaKwsaGn26oW8cRXNvm2SQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAACu1vVVpNrGr0fSSm92KzhAWIKnQtaWrwqZpdHOnjKTyuJbAAAAAAAFFrm0Xmu5jQp0ekljLbeEiz0
29jqFjTuIx3d/muwCUAAAAAAAAAcL27p2NtKvWzuR54A7ggabrFtqkpq3U8wWXvIngAVmt6stJt41FT6S
c3hLOEedC1latSm3S6OcHxSeUBagAAAAAB8bUVmTSS62B9BCqavYUpbs7qmn35O9C7t7lZoVoT7mB2
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABW6hrlnptdUriUlJrPCLZyudpdPt4wbqOblFSxFZxkz
22X72h/LRM0fZi3utPhXu5Tc6iylF4wuoC6sNdsdQk40quJpZ3ZcDhc7T6db1HDpHUa4NwWV4mM1G0l
p+pVLeEn6Lwn9DS2WydrOwjKvOp0045ynwTAudP1a01JPyepmS5xfBki6u6FnS6S4qRhH6vmfn+nupp
+v04Rl6lXcf1WTb6xY0L+x3LiapxTUlPsAgz2t06MsRc5Lt3WT7DV7PUeFvVTkucXwZQ+RbNQg6crpOXXL
e4/kUNKqrDV1K1q78IT9GS60BvNR1W30zcdzvpT5NRbR70/UbfUaLqW08pPDT4NHq/sqV/ZzoVVlSXB9
j7TCQr3mz2oVacfWxjD5NdTA2F9r9jY3LoVZydRc1FZwfNWr2FXS4Vb+nJ0Z4a4PKM/s3pU9Runf3eZU4
vKz/FIttsVjSF96AkbPy06VvU82xain6Tknl+J9r7RWFC8dtUnJTUt1+i8ZK/Yn3Sv9yM9rcXPXbiMecqjS8Q
NbcbUadQqumpym1zcVwJlrq9ld28q9OvFQh629waKinsjaOyW9UqdO453s8E+4ylC3qVL1WsZNOUt1g
bSptXpsKm6pTku1RZaWV9b39Hpbaopx6+1FBebJ2lLT6kqU6nTQg5Zb4PH0KzZGvOlq7pZ9GcXlfVAXe0
EtIjcU1qMJOo1lOOeX4E6leWdno9O4pJxtkvRSXEzm2vv9D7GXumWtK92ct6FdNwlHil3sDl/azTPin/AJG
P7Wab8U/8jIer6Vo+mWkqk4Sc3whHe5sptC0eWqXW9OLjbweZPt+iA30akZUlUTxFrOX2FTc7T6db1H
BVHUa57qyvEg7XXsrW1o2dBuKmnvY7F1Fbo1vovkvSahcRdWX8Dfqgaiw1yx1CW5Rq4n8MuDLE/O9
WhZWt3CrpVxvRfHCfGLL/AFDWKj2WpV4yxVrYg2u3HECfebR6fZ1XTlUc5rmoLOPxK7V9bstR0WvCjU/
afDJYZWbOaJT1R1K1zKXRweMLm2SdodnaFlaeU2jklF4lFvIHvYj2tz9qNcZHYj2tz9qNcBWa9KwhZReow
cqblhYTyn+B42flp0rWfm2LUFLEnJPLf4kTbT900/5y/JnPYn3C4/m/ogJ9TaKwpXkrac5KcZbr9F4PFxtRp1
Co4KcqjXNxWV4mP1aLnrlxGPOVXCNNS2QtPJUqtSo6zXGSfBPuAttP1W01GLdtVzJc4vg0TT860uVSw16
nBS9WpuS+qP0UA3hZZhNc1qvqF27e2lJUU91KPOTNjqcpQ0y6lH1lSk14GI2YhGprlLpMPCclntAm22x9z
VpKdetGlJr1cZaOU9ntTsLyn5LJy3nwnB4x3m5AHO3jUjQgq0lKol6TXWzoAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAYfbL97Q/lo1ejfum2/lr8iPqegWup3CrV51YySxiDWPyLC2oRtbeFGDbjBYTfMDB7S
f3gq96N7b+70/tRV3uzdpfXkrmrUrKcuqLWPyLeEVCEYrklgD87rf3kf89fmXG2laslbUk2qUk20uTfAs5bM
2cr7yt1K2/v7+MrGfAsb2wt7+36G4hvR6n1oDL6RZaHU06NW7qR6XjvqU8Y/Aorl0HqUvJE1R31uJ9hrY
7H2KqZdWs49ja/0OtXZSwqVlUUqsMYxGLWPyAs768pWNpKvWaSiuC7X2GF6K82hv61WCy0s8eSXUjZ
apo9HVNxV6tWMY8owaS/I7adptvptv0NunhvLlLmwMrs1q0rG4djdZjTk8LP8LLbbHjpC+9He+2asr66dx
OVWnOXPcaSz28iRc6RRu9PhZ1qtWUIYxLK3vyAqdifdK/3IotT/vLU/nr8za6XpVDSqc4UJTkpvL32iJX2as7
i+d3OpWU3PfwmsZz3AW8PZR7j89sP7x0/5rP0NLEUuxYKelszZ0b2N1GpWc1Lew2sfkBZ3nuVf+XL8jDb
Mfv+Hcze1YKrSlTlnEk08FVYbOWlhdq5pVKzms8JNY/ICi219/ofYy8027pWWzVCvWeIxh48WddU0K21
WtCpXnVi4rC3Gv8AQ91dIoVdKjp8p1FSjyaayBiLu9er6mql3V6Kk3jtUUa2z1jRrK2hQo3EYwivgfH+hw/s
dp/zbj/Mv9B/Y6w+dcf5l/oBG2vtnc21C9oZnTSabXY+TK3R56LOh0eowcaq/jy8PwNvTtqdO2jb43qaju4l
xyinutk7CvNzg6lJvqi+AFY5bNeUwowpympPDmm0olhr+lwWgqlZw9GjJTSXHh/7Z2s9l7C1qKo1OrJct98
C5wsYxw7AMRsxrVHTukoXTcac5byljOGS9otoLW6sna2cnU336UsNJL8Syvdl7C6qupHfpSfFqD4Hylspp
9OjOD6SUprG+2sru4AVuxHtbn7Ua4rtK0W30qU3bzqS31h77T/QsQM9tp+6af8AOX5M57E+4XH839EX
Op6bR1S3jRrynGMZb2YPjk86XpVDSqM6dCU5Kct577TAxF9/eSp/OP0UpauzNnWvpXUqlZTlLewmsZ8
C6A/Opf3k/wDHP0VcilezNm77yrpK2/vb2MrGfAugPNSEalOUJLMZLDR+eXdC40PVlJJrclvQl1SR+inC7sr
e9pdHcU1NfXqAqLXaywq0k7hyoz61hv8AIjXW2FKNxCNrSc6efSk+Ge46VdjrOU8061WK7Mp/oS7HZq
ws6iqbsqs1yc3nAFpQrRr0IVYppTWUmsM6BLC4AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAcK13Roy3ZS49gSZiPMu4InnGh2vwHnGh2vwDjqU3SwRPONDtfgPONDtYOpTdLBE840O1+A8
40O1+AOpTdLBE840O1+A840O1+AXqU3SwRPONDtfgSKdWNWO9B5QWL1n1L2AeKtWFKG9N4QWZ
w9giecbf4n4Dzjb9rDnqU3SwRPONv8THnGh8TCdSm6WCJ5xt+1jzjb9rB1KbpYInnG37WPONv2sHUpul
giecaHazpRu6NaW7CXHsCxqVn1LuAA7AR6l9QpT3ZS4rsPHnG37X4Bx1Kx+0sETzjb9r8B5xt+1+ATqU3S
wRPONv2vwHnG37X4A6lN0sETzjb9r8B5xt+1+AXqU3SwRPONv2vwHnG3+J+AOpTdLB5hOM4qUXlM+
Va0KMd6bwg6zGMvYInnG37X4Dzjb9r8A56lN0sETzjb9r8B5xodr8AdSm6WCJ5xodrHnGh2vwCdSm6W
CJ5xodr8B5xodr8AdSm6WCJ5xodr8D1C/oTkoqWG+0L1K7pIB4q1YUY703hB1M4ewRPONv8T8B5xt/if
gHPUpulgiecbf4n4Dzjb/E/AHUpulgiecbf4n4Dzjb/ABPwB1KbpYInnG3+J+A842/xPwB1KbpYInnG3+J+B
0o3dKtLdhLj2AjUrPiJdwCPdXkLbCeXJ9SDqZisZlIBXedY/Ax51j8DDz61N1iCu86x+BjzrH4GDrU3WIK7zrH
4GPOsfgZMnWpusQV3nWPwMedY/Axk61N1iCu86x+Bki2vIXDwsqS6mVY1aTOIlJAI91dwtkt7Lb6kHcz
FYzKQCu86x+Wx51j8DDz61N1iCu86x+BjzrH4GDrU3WIK7zrH4GPOsfgYydam6xBXedY/Ax51j8DJk61N
1iCu86x+Bki2vYXEt1JqXYyrGrSZxEpIBwubuFslvZbfUg7mYiMy7grvOsflsedY/LZMvPrU3WIK7zrH5bHn
WPy2MnWpusQV3nWPy2POsflsp1qbrEFd51j8tjzrH5bGTrU3WIK7zrD5bJlvcQuIb0OrmmHVdStvES6gE
O41CnRnuJOTXPAW1or5lMBXedo/LY86x+Ww461N1iCu86x+Wx51j8tjJ1qbrEFd51j8tjzrH5bJk61N1iCu
86x+Wx51j8tlydam6xBXedY/LZMt7iFxT3ofigtdStpxEuoBEuL+FCe5hya54Dq1orGZSwV3naPy2PO0flsZc
dam6xBXedY/LY86x+Wxk61N1iCu86x+Wx51j8tjJ1qbrEFd51j8tjzrH5bGTrU3WIK7zrH5bJdtcwuYb0OD
XNMOq6lbTiJdgCJcX9OjPcw5Nc8BbWisZlLBXedY/LY86x+Ww461N1iCu86x+Wx51j8tjJ1qbrEFd51j8tjzr
H5bGTrU3WIK7zrH5bHnWPy2TJ1qbrEES2voXEt3DjL6ksrutotGYAAHQAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAADM9Xbdebb/iZoHyM9W9tP7mSWTifUPAAIxgAAAAAAABZaQ
3+0WeHArSx0f1qvchD10PuFoVmrN5guosyr1f14dxZbNf4lXAAj5wAAAAAAAgHW2bVzTw/4kcjpb+8U/
uRVr7hoVyPNR4pyf0PS5I81PZy7jp9WfTOybc2/qfD7L1n3nw5fJn2AAAAAAAAAAC30pt27y+TOGrN9LB
Z4YO2k+wl9xw1b20O4v6bLfhQAARjAAAAAAAAAABoaDzQg32Ir9Wb36azwwyfbe7w7iv1b2lPuZW/V/
GrwAcsAACgACAACgdbVtXFNrtOR0t/eId4WvtoSl1P3t9xdFLqfvb7iy3cR8IgAIwAAAAAAAABK073uJFJ
Wne9xEO9P6hdlPqnvX+EuCn1T3r/CWWziPhCABGAAAAAAAAAJFh73Ajkiw97gId0+oXpTap71+BclNqf
vX4Fls4j4QwARgAAAAAAAACx0h+nUX0RXFjpHr1O5CHro/cLRmer+3qfc/wAzQsztf29T7n+ZZe/E+oeAA
RjAAAAAAAACx0l+lMrix0n1plh7aP3C0fIz9y83NTPxM0D5Geufean3MS9+J9Q5gAjEAAAAAAAAFjpHtJ9
xXFhpHtJ9wh66P3C1Zn7njc1PuNA+Rnrj3ip9zLLRxPqHMAEYgAAAAAAAHey97p95fFDZe90+8viw3cN8
yAArSAAAAAAAAAAAAAAAAAAAcnc0E8OvTT7HNGO2i1m4uL+dpbzcKcHu+jzkxDZXUalNTlWipPjhsDa
xlGSzFprtR9Mroel6pZ6qlXnNUEm21LKZI2n1eVtRhGyulGqpNTUWm0BogZ7Z7WY1bJvULyDq72FvtJ4N
Ammk08p8cgfQQbjWbC2nuVbmCkuaT4o62uoWt57tXhUa5pPigJIPFatTt6UqtWShCKy2+oi0tWsK0Jzh
c03GCzJ55ATQV0Ne02c9xXUM/V8CwjJSipRaafJoD6Acbq7oWdLpLipGnHtb5gdgcra6o3dJVLepGpB9aZ
16gPHS0/mQ/wAyPsZwn6soy7mYbU9F1C0p1bqpV/Zp54TJmxVSc7q53pSl6C5vPWBrwAAAAAAAfHy
M9W9tP7maF8jPVvbT+5klk4n1DwACMYe40aklmMJNfRHgsra+pUqMYSTbQd0rFpxMoPQVfly8DmaG
TTpNrrRnnzYd6unFPQAA8QstH9ar3IrSy0f1qvchD10PyQsyr1f14dxaFXq/rw7iy2a/wrgAcvnA5vCBaWFr
GNPpqiy3xWeorulJvOEBW9aSyqcsdxzlGUHiUWu9FnU1OEZYhDeS6zsuhvqDeOP9UXD16VZ8VnypQeq
tN0qkoS5pnkjPMYDpb+8U/uRzOlv7xT+5Ba+2gXI+VPZy7j6uR8qezl3HT6s+mdl6z7z4fZes+8+HL5MgB3
tKHlFZRfqriwsRMziHOFKdT1It9yPU7etBZlTkl3FzOdK1pJtYXVg8ULyjcS3FwfY+suGno19TPlSAsdRtVBdL
TWO1FcR4XpNJxIAA4W2k+wl9xw1b20O476T7CX3HDVvbQ7i/prt+FAABGQPsYym8RTb7EfDvZ1o0a+/
POMYC1iJnEvHQVfly8DzKEoPE4uPei8t7mFwnuZ4dpB1b2sO4uHvfSiK80SrwARnAABoLb3eHcV+re1p9
zLC293h3Ffq3tafcyt+r+NXgAjAHqMJTzuRcsdiPJKsbiFvObnnig6rETOJcegq/Ll4HiUZQeJJp9jL6hWhXhvw
5ZxxKvUve33DD11NKK15olEAAeAdLf3iHeczpb+8Q7wtfcNCUup+9vuLopdT97fcWW7iPlEABGAPdKjUq
yxTi2fIRc5qK5tl5TpwtqHYorLYeulp8/tWebq+M4Xdkj1aU6Ut2pFplj50W/jc9HtySatOF1Q7crKZcPXpUt
H+ZUQPU4uEnF808HkjKErTve4kUlad73EO9P6hdlNqnvX+EuSm1T3r/AAlls4j4QwARgDrRtqtdN045S58
TkSrS88mjKO7vZeQ6pFZn/T55vuPg/qjhUhKnNxksNF7b1emoxnjGSnvfep94e2pp1rWJhwAAZwkWPvc
COSLH3uAh3T6helNqfvX4FyU2p+9fgWWziPhDABGAOlKjUrPFOLZ8pU3Vqxgutl2lTtaHDhGKEPbS0+fzP
pWPTq+7nC7skapTnTluzi0yxjqkd/EoYj25JNzRhcUHw44ymV30qWj/ABKjB9acW0+aPhGYLHSPXqdyK4
sdI9ep3IQ9dH7haMztf29T7n+ZomZ2v7ep9z/MstHE+oeAARiDvTs69SClCGU/qjgTrfUOipwp7mccM5D
ukVmf9OTsLhLLh/VEdrDNBJ5pN9sTPy9Z94l6aunFMYfAAHgFjpHrTK4sdI9aYh66P3C0fIz1z7zU+5mhfIz
1z7zU+5llo4n1DmACMQd6dnXqQUoRyn9TgTre/wChpRp7mcfUO6RWZ/05OwuEsuH9URnweDQ729R
z2oz8vXl3iXpq6cUxh8AAeAWGke0n3FeWGke0n3CHro/cLXqM9ce8VPuZoeoz1x7xU+5llo4n1DmACM
T7CLnNRist8iR5vuPg/qjjSn0VWM8Zwy1tb7yirubmOGeYe2nWlvEq2rbVaEU6kcJ/U4lrq3sYfcVQc6lIpb
EAADzd7L3un3l8UNl73T7y+LDbw3zIACtQAAAAAAAAAAAAAAAAAAMPtDo1zb387qhCU6U3vZjziz7bb
WX1ulC4pRqpcOPos0U9obGlfVLStPccHjefJny5eiXNJutO1axxakk/6AedL2itdRmqXGlVfKMuT7ih2p0m
NpUd4qrk6036O7yKmnGK1iEbNtw6ZdG/pngafbKMnptBtcpcQKvQ9n4anbeUSuJU3GWMKOS32n1Cp
p9jStqEmpzjhyXNJHHZK9tqGnVKdavCnJSziUkjntpQlUhb3UPSp43W1/T8wIej6LaXlt5Re3cYOT4Q3ln8S
NqVr5lvadWxulUXOLi+K+jOmj2Ok3tDF1cyo1lzTkkn4k2ekaFG4p0PLpSnN4W7JNAWd9d+XbJ1Ljk50+K
+pk9H06rql10FOW7FLem+xGu1Kzp2GzFe3pScoRi8Nmc2X1Glp9/Lp3uwqR3d7seQJup7KK1s5V7atKcq
ay4tYyj1shqdTp5WNWTlBx3oZ6voW+r61ZUdPqqnXp1Zzi1GMJJ8TO7I0J1dXdVL0acW2/qBuij2n0qvqV
Ck7Zpypt+i3zzj/QvCBq2rUNKpRnWTk5vEYrrAjbNaZW02znG4a36ks7qfIuCFpep0dUt3Vo5WHiUXzRNA
qdp/3FX/AAKTYj3u5+xfmXe0/wC4q/4FJsR73c/YvzA2IAAAAAAAPj5Gere2n9zNC+Rnq3tp/cySycT6h4A
BGMPq9Zd58Pq9Zd4WPa/Xu/8AhM++bNAvYf4TPvmyy08R+gAEZQstH9ar3IrSy0f1qvchD10fuFmVer+
vDuLQq9X9eHcWWzX+FcADl859XNF1dPo7GW71LBSLmi7uF01i93rjlHUNGj82UhP0qTVaUeprJALDSoP
fnPqSwSPbjRzzw56pFK5T7UQyXqc1K6wv4URBKav3IdLf3in9yOZ0t/eKf3IOK+2gXI+VPZy7mfVyPlT2cu4
6fVn0zsvWfefD7L1n3nw5fJkLPSY4hOXaysLPSZLdnD8RD20Ptz1WTdWMepIiUJOFeEl1MmarB9JGeOG
MES3g6leEUusv7W+eourmO9bTT7CgL66koWs39MFCJdcT7gABGZbaT7CX3HDVvbQ7jvpPsJfccNW9tD
uL+mu34UAAEZAAAWek8qh41b2sO49aTyqHnVvaw7i/prn8CvABGQAAGgtvd4dxX6t7Wn3MsLb3eHc
V+re1p9zK36v41eACMAAALfS/dX9xD1L3t9xM0v3V95D1L3t9yL+mvU/DCIACMgdLf3iHeczpb+8Q7wtf
bQlLqfvb7i6KXU/e33Flu4j5RAARgSLBZvIFjqLatJY7UVlrPo7mEnyyW95Sda2lGPF80WGvS86cxCiLrT3m0
jn6lNuy3t3HHlgvbWn0NtGL7MskOeHieZUXqxd1MdpwOt1PpLicl1s5B4X+pCVp3vcSKStO97iF0/qF2U2
qe9f4S5KbVPev8JZbOI+EMAEYAAAXdh7pAq733qp3lpYe6QKu996qd5ZatX8cOAAIyhIsfe4EckWPvcBD
un1C9KbU/evwLkptT96/AstnEfCGACMCXpqzdr6JkzVJNWqx1ywQLGoqd1Fvk+BZ39J1rZqPFriiten50pi
FIXtk3K0p57CjUZSkopPL6i+ox6G3jF/wriITh4xMypblYuai/wCZnI91pb9Wcu1tngjNb3IWOkevU7kVxY6R
69TuQh6aP3C0Zna/t6n3P8zRMztf29T7n+ZZe/E+oeAARjD7H1l3nw+x9Zd4WF//ANX/AMJQS9Z95f8A/
V/8JQS9Z95ZaeI9Q+AAjKFjpPrzK4sdJ9eYh66P3C0fIz1z7zU+5mhfIz1z7zU+5llo4n1DmACMQfVzR8Pq5
oEe1/H3dfaUEvXl3l/H3dfaUEvXl3llq4j1D4ACMoWGke0n3FeWGke0n3CHro/cLXqM9ce8VPuZoWZ649
4qfcyy0cT6hzABGIJml+8/gQyZpfvP4CHppfcJOrexh9xVFrq3sY/cVQl3r/YAA8Hey97p95fFDZe90+8viw2
8N8yAArUAAAAAAAAAAAAAAAAAACh1HZW1vKsqtKpKjOTy+tFd/YyrvY8rW79n+5rwBT6Ts7babNVd5
1ay5Sa4LuRYX1lSv7aVCusxl2c0SABk5bFvpPQvMQ+sOP5mip2NPzfG0r/toKO63JcyUAMvdbG05zcra5d
OPwyjn+p7stkKNKqqlzXdXDzupYNKAKzaBKOhXKXJQwjJbPaXS1WpXpVW4uMMxkup5RuNQtFfWVS3c
nFTWMor9G0KOk1qlSNaVTfju4aAq4bF/tPTvMw+kOP5mjsLChp1uqNvHC62+bJIAFZrejw1ejCLqOnOm
24yxnmWYArtF0mGk20qcZ78pvMpYwWIAETVLLzhYztuk6Pf/ixnBC0PQfNFWrPyjpd+OMbmMf1LgAA
AAAAAAAfHyM9W9tP7maF8jPVvbT+5klk4n1DwACMYfV6y7z4AL/ej0GN5eqUD5sAZeupqc+AAB5BZa
P61XuRWllo/rVe5CHro/cLMq9X9eHcWhV6v68O4stmv8K4AHL5wWFheRhHoqrwupleCuqXmk5hcTsre
rLfTxnsZ9qV6NpR3KeM9SRTqTSwmz4MvbrRHzHl9nJzk5S5viz4AGeQ6W/vFP7kczpb+8U/uQWvtoFyPl
T2cu5n1cj5U9nLuZ0+rPpnZes+8+H2XrPvPhy+TIdbes6FVTX4o5ALE4nML2NWhdU8ZTT6mIU6FvmUVG
PayiTafA+uTlzbYy0df9zHlMv7tVmoU/VXX2kIAPC1ptOZAAHK20n2EvuOGre2h3HfSfYS+44at7aHcX9Nd
vwoAAIyAAAstKkkqmXg8aq06kMPPAgAZevU/xyAADyAABoLb3eHcV+re1p9zLC293h3Ffq/tafcyt+r+NX
gAjAAAC20ySVthtLiQ9Sad02uwigPW2pmkVAAHkHS394h3nM6W/vEO8LX20JS6n72+4uil1P3t9xZbuI+
UQAEYAs7TUIqKhW4Y5SKwB3S80nML3p7b1t6HeRLy/Tg6dHjnnIrQMvS2vMxiAAB4BK073uJFJWne9x
EO9P6hdlNqnvX+EuSm1T3r/CWWziPhDABGAAAFtZXNGnbRjOok11FddSU7mcovKb5nIB6W1JtWKgA
DzCRY+9wI5Isfe4CHdPqF6U2p+9fgXJTan71+BZbOI+EMAEYBPDyWlrqEXBQrPEl19pVgO6Xmk5he9Nb
R9LehntIV5fqpF06XLrZXgZelteZjEAADwCx0j16nciuLHSPXqdyEPXR+4WjM7X9vU+5/maJmdr+3qfc/zLL
34n1DwACMYfY8JLvPgAuvK6HQ46WOd0ppes+8+APS+pN8ZAAHmFjpPrzK4sdJ9eYh66P3C0fIz1z7zU+
5mhfIz1z7zU+5llo4n1DmACMQFzQAF1G6odCl0sc7uCml6z7z4A9L6k39gADzCw0j2k+4ryw0j2k+4Q9d
H7hasz1x7xU+5mhfIz1z7xU+5llo4n1DmACMQStPqQpXG9OSisc2RQHVbcs5WOpV6VWlFU5qTT6iuAB
e83nMgADl3sve6feXxQ2XvdPvL4sNvDfMgAK1AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAA+PkZ6t7af3M0T5GfuYShXmpLHEksvE+ocgARiAAAAAAAACy0f1qvcitLPSISSqSa4PCQ
h7aMf7hZFXq/rw7i0K3VoSe5JLgiy16/mkqwAEfOAAAAAAAADpb+8U/uRzO1rCU7mG6s4kmHVY8r5cj
5U9nLuPS5HyazCSXWjp9SfTOS9Z958PVSLjUkpLDyeTl8qYmJAAEAAAAAAAAW2k+wl9xw1b20O4k6XC
UbduSxl8Dhq0Jb8JY4YxkrZaJ6KuABGMAAAAAAAAAPqTbSSy2DC/tvd4dxX6v7Wn3MsaEXGjBPmkQN
WhJuE8cFlNlfQ1Y/5q0AEfPAAAAAAAADpb+8Q7zmdrSEp3MFFZw+IdVjzC/KXU/e33F0VOp0J9N0ii3Frq
LLbxETNEAHrcn8L8B0c/hfgRhxLyD10c/hfgNyfwy8AYl5B63J/DLwG5P4ZeAMS8g9bk/hl4Dcn8MvAGJeS
Vp3vcSPuS+GXgTNNoTddVGmox7Q704nmhblNqnvX+EuSr1ShN1VUjFtYxwLLZrxM08K4Hrcn8MvAbk/
hl4EYMS8g9bk/hl4Dcn8MvAGJeQetyfwy8BuT+GXgDEvIPW5P4ZeA3J/DLwBiXkkWPvcDjuT+GXgS9Oo
TdwpuLUY9bEO9OJ5oXBTan71+BclXqdvN1VUinJNYeDqWzXiZp4VwPXRz+CXgOjn8EvA5YMS8g9dHP4
JeA6OfwS8AYl5B66OfwS8B0c/gl4AxLyD10c/gl4Do5/BLwBiXksdI9ep3IgdHU+CXgWml0J04ynNY3uSEP
bRrPPCezO1/b1Puf5miZRXVCpTrz9FtNtposvbiYmYhHB63J/DLwPm5P4ZeBGPEvgPu5P4ZeB93J/DLwBi
XkHrcn8MvAbk/hl4AxLyD1uT+CXgNyfwy8AmJeSx0n1pkDcn8MvAs9LozhGUprGeWRD20YnnWHUZ65
95qfczQlHe0KkLmb3W1J5TRZaOIiZrCMD1uT+CXgNyfwy8CMWJeQetyfwy8BuT+GXgDEvIPW5P4ZeA3J
/DLwBiXkHrcn8MvAbk/hl4AxLyWGke0n3EHcn8MvAstLozhvTksJ8FkQ9dGJ54WLM9c+8VPuZoSkvLepC
4k1FuMnlNFlo4mJmIwig9dHP4JeA6OfwS8CMWJeQeujqfBLwHR1Pgl4AxLyD10dT4JeA6OfwS8AYl5B6
6OfwS8B0c/gl4AxLrZe90+8vimsLepK4jNxajHjllyWG7h4mK+QAFaAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAADxOlCfrwT70ewEmIn25eTUflx8B5NR+XHwOoCctdnLyaj8uPgPJq
Py4+B1bwssyes7UVIXErfT0vReHN8cv6A5a7NP5NR+XHwHk1H5cfAw8df1i2kqlWTcX1TjwZrNG1elqttv
xW7UjwnDPIHLXZM8mo/Lj4Dyaj8uPgdQDlrs5eTUflx8DpGKisRWEfQFiIj0HyUVJYksr6n0BXLyaj8uPgPJ
qPy4+B1Ac8tdnLyaj8uPgPJqPy4+B1IGtV69tptSra+0WMcMg5a7JXk1H5cfAeTUflx8DD1NotXpYVSSi32x
Ndod1VvNLpVqzzOXNg5a7JXk1H5cfAeTUflx8DqActdnLyaj8uPgeoUoQ9SKXcj2AsViP0AAK8So05vMoJ
v6o8+TUflx8DqA55Y2cvJqPy4+A8mo/Lj4HU4X1epb2lSrRpOrOK4RXWDlrs9eTUflx8B5NR+XHwMO6+t
6xWludJhPio8FE5VK+r6PXj0s6kG+KUnlSBy12b3yaj8uPgPJqPy4+BF0bUfOenwrtbs+Ul9SeDlrs5eTUflx8
B5NR+XHwOoBy12EklhHyUVJYkk19T6A6cvJqPy4+A8mo/Lj4HUBzy12cvJqPy4+A8mo/Lj4HUA5a7OXk
1H5cfAeTUflx8DKalaa5PUa8rfpeic24YfDGSsvJaxYqLuatWnvcsy5g5a7N95NR+XHwHk1H5cfAzWyU724
r1K1ec50VHCcn1mqBy12cvJqPy4+B9jQpReYwin3HQA5Y2D5KKksSSa+p9AdOXk1H5cfAeTUflx8DqA55
a7OXk1H5cfAeTUflx8DqActdnLyaj8uPgPJqPy4+BQ7RbQTsqkbaza6XnJ88fQn6FK+rWfT38lmfGMcYwg
ctdk/wAmo/Lj4Dyaj8uPgdQDlrs5eTUflx8D1ClCn6kUu5HsAisR+gAB0+bq7EMLsR9ATD5ursQ3V2I+mW
2wva9tVt4UKsqeY5e6wYajdXYN1dhg6NDX69GNWk60oSWU88y42et9VpX0nf8ASdHu8N59YMNJursQ
3V2I+gGHzdXYj6AFAAB83V2Ibq7EfQEw+bq7EN1diPpTa/ra0umoUkpV5rgn1LtBhcbq7EN1diMDSWt6u
3UhKpKPbnCLDSbPW6GpUqdWdSFHnJt5TQMNdursQ3V2I+gLh83V2I+gAAAAAAAGc2xua1tRtXQqSpu
UpZ3evkUdtT126oqrQlWnB8mmBvwfnN3c6rZVVTuK1WE2s4bNfsxOvU0eM7iUpSlNtOXYBbgAAAAB8
xk+gD5ursQ3V2I+gGHzdXYhursR9bSTb4JGFv8AXL7Ur3oLOUoQct2MY833gw3O6uxDdXYjC3On63p9H
ymVWWFxbjPLRc7M65Vv3K2ueNWKypdqBhod1diG6uxH0Aw+bq7EfQAAayAB83V2Ibq7EfQEw+bq7E
N1diPNarGhRnVm8RhFyf4GHuNW1LWb10bSUoxb9GEeztYXDdbq7EN1diMLcW+t6RBV5VZKK5uMsr8
TR7P6z50t3Gokq9P1kutdoMLfdXYhursR9AMPm6uxH0AAAAABWbQU7urpu7Yb3S76fo88cQLMH5zd3
Oq2VXo7mtVhPGcNm40qq5aRQq1ZZe5ltgTgYfVdfu7+7dCxlKFPO7FR5yI1WGtaZFV6jq0125yB+ggptnt
ZWqUHCrhV4esl1rtLkAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAhazXlbaTcVYPElDgY/ZO1hdatvVEpKlHfw+3ka7XKMq+j3NOHGThwMnshcwoas4zaXSw3U32
8/wBANdq1rC702tSnFP0W4/RmO2Uryo61CmnwqJxa/r+hs9TuIW2nV6s2klF4+rMXstRlW1ynNLhTTk/
y/UDfgAAAAAAAAAAAAMdtv75b/wAv9WXmzP7joFFtv75b/wAv9WXuzP7joAWoAAAAAAAAAAABtJZf
BIDyoxhlxilni8Ixm12pUruvTtqD3uib3pLtfUSNotot7etLGfDlOovyR82e0SknG8vpRcucKbf9WBbbMWc7
TSYdKnGdR72H1FweYThNehJPHYegAAAAAAAAAAA8V6nRUKlTGdyLljuR+b3uoS1G/wCnu3Jwb9WPU
uxG/wDONlUuKlrKtDpI+jKLZB1ax0qGn1ZVKdOHovda4PP0AkaHfWNzZxp2XoqmsOD4NFkYDZaU463T
VNvdaal3G/AAAAAAAAAFZruqx0uzclh1p8IR/Usz821i7rXupVp1ctRk4xXUkgJ+g6bPUrud7dtujTe9Jv8Ai
ZqLTW9PuriNvb1c1HyjutcjKW+0lza2atqVvRUFHHqvP5ldYXtWxvY3NKMZTjnhLlxA/TgV+h39XUdPVxW
jGMnJrEVwLAAAAAAAAAAYnbSe9qVKPw08f1NsV9e402d66Fw6XTpcppAZmy2sq2ltToeTQcYLGcvJodI
1231RuEU6dVLO5Lr7j3e2el+STlWp0Yww+PIxWiby1yh0Lfr8O4D9HAAAAAAAAAAA/O9oazr65Wc36M
ZbvclwP0Q/PNpbeVvrNbK4Te8n25Aso7WRtaMKFnaLo4JLMnj8iy0raihfVlQrw6GpLk+pkzSbSx82Uuip0
5RccttJ5fWYzVYUaOuTjZ43VNY3ep5A/Rgc6Dk7enveturPfg6AAAAAAAAAQdU0qhqsKca7klTbax9Tpa2
1LTLDo4N9HTTeWSih2tv/ACbT1bweJ1uH4AZatKprWtvGW6s8L6I/Q7ejG3t4UoLEYLCRlNjLDeqVL2a4R
9GHf1mvAAAAAAAAAAAD5OKlFxfJ8D85q72i61vU5QqOlLKw8pm91SpOlplzUpZ3405OOO3BhdAo0Lr
WIxvPSi03iT5sCdqO1c7yynQp0FBzWJSbJGxlkulqXjnHKW6op8V3l1qenae9Pq9JSpwUYNqS4YeDKbL1Z
09bhGm3uyypdwG/AAAAAAAAAAEXUqErnTq9KHrSg0u/BhdFvlpGpudeDxhwkutH6IVd3pWm6hVk6kI
OrHhJxeGgKjW9pLW50+dvbKU5VFhtrguJXbIVHHWlFcpQeSy1W20nR7OoqUFK5mt2Kby19SJsZaynfTu
WvRpx3U/qwNqAAAAAAAAAAMNtl+9o/Yi6qVXS2NTi8N0ms+JS7ZfvaP2IvoW8rrZKNKCzKVJ7q+oFFsd
RjU1Wc5LLp0219HlGu1KjGvp1xTmsp03+RitmLyFjquKzUY1IuDb6ma3WtQo2mmVZOonKcGoJPm2Bkt
l6jpa7CKfCScWb8wmyVvKvq/S49GnFtv69RuwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAA0mmnyZjtY2Zr07iVxpy3oN53E8OL+hsQBgHp2uXzjSrRrSivjlwRqtC0
eOlW7TalWn60v0RagAAAAAAAAAAAAAAzG1em3l9c0ZWtCVWMYYbTXDiy20G3q2uk0qVeDhUjzTLEA
AAAAAAAAAAAI9/QncWVWjTajOccJskADEf2O1D51v/AJn/AKH3+x+o/Pof5n/obYAUmzuj3GlKsricJb+
MbjbLsAAAAAAAAAAGspoADJahsjWqV51ba4jLebbVTKZDhslqM5YlOml2uT/0NyAKnRdCo6VFyz0laSw
545fRFsAAAAAAAAAAObt6LeXSi2/odABGr2tKVCoo0Y7zi0uHXgymhaJfW+r0ql1aONJZy201yNoAPkIRh
HEIqK7EfQAAAAAAAAABl9V2Vq3NzO4t7hOU3lqp1fiagAYZbJ6lKW650ku1yf8AoX+ibPU9Ml01SSqV8Y
zjhHuLoAAAAAAAAAAAAK7WNHo6rRSm9ypH1ZrqLEAYqWzGqUW4Ua0HB9kmiw0jZZW1aNe9nGpOL
zGEeWTSgAAAAAAAAAAABmdb0C/1S/daNWiqaWIpyeUvA0wAjadZxsbGlbxx6C4tdb6ySAAAAAAAAA
AAAHyUVKLjJZT5pmV1HZGUqzq2FWMU3nclwx3GrAGKezWr18Qq14bi+Kb/ANC+0XQaOl5qOXSV2sO
XZ3FuAAAAAAAAAAAAPk8GNvdl9RldVKtOvCe+85y0zZADGWuyF1UqJ3daEIde622ayys6Njbxo0I7sV/U
7gAAAAAAAAAAAM5r+z91qd8q1CdKMVHGJt5/IutPt52thRoVGnKEcNrkSQBmtY2WV1WlXspxpzk8yhL
kytpbI386iVWpTjDreWzbgCHpem0dMtuiorLfGUnzbJgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABTPaS1Wp+R
bks727v8AVkuT86/7Sf8AjH6KAAAAAAAAAAAAAAAAAAAAAAAAAAAANpJt8kDxW9hU+1/kBVW20drc
6k7OMJJ53VN8my4PzrSP7xUf536n6KAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAH51/wBpP/GP0U/Ov+0n/jH6KAAAAAAAAAAAAAAAAAAAAAAAAAAAA8VvYVPtf5Hs8
VvYVPtf5Afnukf3io/zv1P0U/OtI/vFR/nfqfooAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAfnX/aT/xj9FPzr/tJ/wCMfooAAAAAAAAAAAAAAAAAAAAAAAAAAADxW9hU+1/k
ezxW9hU+1/kB+e6R/eKj/O/U/RT860j+8VH+d+p+igAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAACNc6haWk1G4rxpyaykySZ7arSHeUFd0VmrSXFdqAzHTU/PvTb66Ppc730N/ba
jaXc3C3rxqSSzhH5hh5xjibbZXSHa0fK66aqVF6K7EBogAAAAAAAAAAAAAAAAAAAAAAAAAAIV7qVnbK
dKtcQhU3X6L7iaZbazR5VU7+gm5RWKkfp2gUGmVqdLXKVWpJRpqrlyfZk/QLW+tbzeVtWjUceeOo/L0
m3hLLZvdmtI832rq1V+2qrLXwrsAuwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAA+IAFG9mLR6n5XvPczvdFjhkvEsLAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD5KKnFxksprDT
PoApLbZm1t9Sd2pOUU8xptcEy7AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAR615Roy3Zy
49iRI6jPV23Xm38TJLx1tSaR4WvnK37ZeA85W/bLwKYEyzdxdc+crftl4Dzlb9svApgMncXXPnK37ZeA85
W/bLwKYDJ3F1z5yt+2XgPOVv2y8CmAydxdc+c7ftl4EmlVhWhvQeUZ0stIbzUXUsFiXppa1rWxKzPFWrCj
DeqPCPZWau3vQXUV76luWuUjzlb9svAecrftl4FKDnLJ3F115yt+2XgfPOVv2y8CmBcncXXPnK37ZeB985
W/bLwKUEydxddecrftl4Dzlb9svApQMncXXXnK37ZeB0o3lGvLdhLj2MoTrbtq4ptfEi5WvEWz5aABcjzUe
Kcmuwrbnw4VL6hSm4yk212I8ec7ftl4FPJ5k2+0+HOWKeItlc+c7ftl4Dznb9svApgMp3F1z5zt+2XgPOdv2
y8CmAydxdc+c7ftl4Dznb9svApgMncXXPnO37ZeB985W/bLwKUDJ3F2jhONSKlF5TPNatChHeqPCImlN
uhLPJSOOrP9rBdWCtM6kxp8yT5zt+2XgPOdv2y8CmBMs3cXXPnO37ZeA852/bLwKYDJ3N1z5zt+2XgP
Odv2y8CmAydxdc+c7ftl4Dznb9svApgMncXXPnO37ZeB6hqFvOSipNN9qKQFyRxNmlPFWrCjDem8I+W
7boQb7EV+rt79NdWGVqvflpzJHnO37ZeA85W/bLwKYHOWXuLrnzlb9svAecrftl4FMBk7i6585W/bLwH
nK37ZeBTAZO4uufOVv2y8B5yt+2XgUwGTuLrnzlb9svA60bujXliEuPYyhOts3G4g12jK14i2fLQEa6vIW2E
1mT6iSUup+9vuLLTrXmlcwkedo/KfiPOy+U/ErAMsfXvus/Oy+U/Eedl8p+JWAmTr3WfnZfKfiPOy+U/ErA
MnXvus/Oy+U/Eedl8p+JWAuTr33WfnZfKfiSbW9hctpLdl2MoyVp3vcRl3TWvNoiV2R7q7hbJZ4yfUiQU+
qP/AKUvtK06t5pXMO3nZfKfiPOy+U/ErATLH177rPzsvlPxHnZfKfiVgJk6991n52Xyn4jzsvlPxKwFyde+6z8
7L5T8R52Xyn4lYCZOvfdZ+dl8p+JItb2FxLdw4y7GUhJsPe4Fy7prXm0RK8I91dwtsZWZPqJBTap71+Alp1b
zSuYd/O0flPxHnaPyn4lYBlj6991n52Xyn4jztH5T8SsBMnXvus/O0flPxHnaPyn4lYBk6991n52j8p+I87R+U
/ErAMnXvus/O0flPxJltcwuIb0OrmigLHR/XqdyLl6aWta1sStCFcajCjUcFFya5k1mdr+3qfc/zEvbX1JpHhYe
dl8p+I87L5T8SsBMsvXvus/Oq+U/EedV8p+JWAZOvfdZ+dV8p+I86r5T8SsAyde+6z86r5T8R51Xyn4lYBk6
991n52Xyn4ky2uIXFPej1c12FAWOketNFy9dLWta2JWhDub+FCe4ouTXPBMfIz9z7zU+5h6615pHhO87
L5T8R52Xyn4lYCZZevfdZ+dl8p+I87L5T8SsBcnXvus/Oy+U/Eedl8p+JWAZOvfdZ+dl8p+I87L5T8SsBMnXv
us/Oy+U/EmW1zC4hmPBrmigLDSPaz7i5emlrWm2JWpDudQhQnuKLk1zJhnrnjc1M/Ew9ta80jwn+dl8
p+I87L5T8SsBMsvXvus/Oy+U/Eedl8p+JWAZOvfdZ+dl8p+I87L5T8SsBcnXvus/Oy+U/Eedl8p+JWAmTr3
3XVtfQry3cbsuwllDZe90+8viw16N5vXyAAr2AAAAAAAAAAAAAAAAAAAB8clH1ml3sKcZerJPuYH0AAA
AAAAAAAAAAAAAAAAfHOMfWkl3sKUZeq0+5gfQAAAAAAAfHyM9W9tP7maJ8jO1vbT+5klk4n1DwAC
MYAdoWtacVKMG0+sLETPpxB3dncJZdNnAExMewABAsdH9ar3Irix0f1qvchD10fuFoVer+vDuLQq9X9e
HcWWzX+JVwAOXzgA+pOTwlllHwEiNjcNZ6NrvOVSlUpPE4tB1NbR5mHgAByHSh7en9yOZ0oe3p/cgtfb
QrkjzU9nLuPS5I81PZy7jp9WfTOy9Z958PsvWfefDl8mfYAAAOtK2q1eMINrtPc7KvBZcMr6B1FLT5wjgPg
8MByAAC20r2EvuOGre2h3HfSvYS+44at7aHcX9NlvwoAAIxgB6p051ZbsFl9gIjLyDv5FcfKZzq0Z0mlUi4t
hZrMe4eAAEAABoLb3eHcV+r+0h3MsLb3eHcV+r+0h3Mst+r+NXgAjAAHulRnVbVOLljsCxGfTwDv5FcfK
ZyqU5Upbs1h9gWazHuHkAByHS394h3nM6W/vEO8LX20JS6n72+4uil1P3t9xZbuI+EQAEYAA729pUuIu
UGsJ44hYiZnEOAJvmyt2x8SJUg6c3B80FtS1fbyACOQk6d75EjEnTvfIlh3p/ULwptU97/wAKLkptU97/AM
KLLZxHwhgA5YAA729pUuItwa4PHEqxEzOIcATfNlbtj4kWrTdKo4S5rsC2pavt4AAchJsPe4EYkWHvcBDu
n1C9KbU/evwLkptT96/AstnEfCGACMAASaFlUr09+Djj6ha1m3iEYEzzZW7Y+JEkt2TT6gtqTX2+AAjkLHSP
XqdyK4sdH9ep3IsPXR+4Wj5Gdre3qfc/zNE+Rna3t6n3P8yy9+J9Q8AAjGAEqlYVatNTi44f1DqtZt6RQTH
ptZJvMeH1Ib4PALVmvsABHIWOketMrix0n1plh7aP3C0fIz9z7zU+5mgfIz9z7zU+5ll78T6hyABGIAJNKxq
1qanFxw+1ha1m3pGBMem1km8x8SI1htdgW1Zr7fAAHIWGke1n3FeWGke1n3CHro/cLVmeuPeKn3M
0L5GeuPeKn3Flo4n1DmACMQD1Tg6k1Bc2S/Nlbtj4h1WlrekIHe4tKlvFSm1hvHA4BJiaziQABHey97p95f
FDZe90+8viw28N8yAArUAAAAAAAAAAAAAAAAEDWdQWm6fOulmfKK+pPKvaLT56jpjp0uNSD3ortAy
dvDVderTcKs5Jc8yxFHapomtWS6SlKbx1058SLp2p3miVpwVNYb9KE0X9pthbVGo3NGVL/mTygLbTKlW
lpdGd/VSqNZbm0u4zdvtHfz1iFGdeHQOruv0Vy7y/1O0jremxjbXEYxk1JTxkwlGzdXUo2inhynub2AP0yn
WpVc9FVhPHPdkmfalSFKO9UnGEV1yeEVGh6NLR+mnUuFVUl1RxgzWo3lzrmreTwnu097dis8Eu1gbK
Oq2M57kbqln7iYmpJNNNPrRj6+ycIWzlSu06qWcPkxspqlaF47CvJyi87uX6rXUBqat9a0anR1a9OE+xywz
zW1C0t8KrcU4t9TlxMTtV+/J4+FEux2Xr39tG5ubjcdRZimsvAGvoXNC5jmhVhUX/ACvJ1PzutTvNntSSjPiv
STXKaN7ZXMbuzpXEeCqRTwB3OCvbaVfoVXpup8O8snaSbi0nhtczE0Nn9Rjq6k4tRU951c9QG3IGs3F3b
WMp2VJ1Knju/XHWTwBgaOn6zquazdRxzznLHgjj0+p6HeKFSc4SXHdcsxkj9BnKFGm5SajCKy31IwWu3
3njVYq2i5KPoQx/EBt9Pule2NK4SxvxzgkkTS7V2em0KEvWhHj3ksAAAAAAPkZ2t7af3M0T5Gdre2n9zJLJ
xPqHgAEYwsLfUI0qUYODbXArz6vWXeHdLTWfDQN71LPajPsv17BfaUDLL34j9PgAIyhY6P61XuRXFjo/rV
e5CHro/cLQq9X9eHcWhV6v68O4stmv8K4AEfOC2sKEaVHpZr0ms57EVS5ourt7ljLd4cBD30YjzbZFqapJ
TapwTiu0k05076g01x612FKT9Kk+nkuporrT1bWti3pDrU3Rqyg+o8E3VElcp9qIRHjevLaYDpQ9vT+5HM
6UPb0/uQc19tCuSPNT2cu49LkjzU9nLuOn1Z9M7L1n3nw+y9Z958OXyZCTY0OnrYfqriyMWmkpdHN9e
RD10q81ohJr16drTTa+iSOdvfwrz3GnFvl9SJqsn08V1JESi3GtFrnkr2trTF8R6T9StVu9NBcuZWl/cJStpp9h
QCXnr1iLZgABHgttJ9hL7jhq3todx30n2EvuOGre2h3F/TZb8KAACMYdrWuretvtN8MHEBYnE5heWt0rn
exFrd7SFq3tYdx70n1ah41b2sO4v6a7Wm2jmUAAEYwAAaC293h3Ffq3tIdzLC293h3Ffq3tIdzLLfq/jV4AI
wBIs7lW0pNxbyRwFi01nML62uFcU99RxxwVmpe9y7kTNL92feQ9S97l3IrXqzM6UTKIACMYdLf3iHeczp
b+8Q7wtfbQlLqfvb7i6KXU/e33Flu4j4RAARgCRbXk7eLjGKabzxI4CxM1nML+2qOtQjNrDZTXfvVTvLax9z
h3FTd+9VO8stWtOaQ4gAjIEnTvfIkYk6d75EQ70/qF4U2qe9f4UXJTap71/hRZbOI+EMAEYAkW13K2i1G
KeXniRwFrMxOYX1tVdahGclhsqL33qfeWmn+5wKu997n3llq1pzpxLgACMgSLD3uBHJFh73AQ7p9QvS
m1P3r8C5KbU/evwLLZxHwhgAjAEqhfToUlCMU0iKA6raazmGhpyc6UZPm1koavtZd5eUPd4faijq+1l3llp
1/mHgAEZAsdI9ep3Irix0j16nchD10fuFo+Rna3t6n3P8zRPkZ2t7ep9z/MsvfifUPAAIxhLo39SlCNNRWFwI
h9j6y7w6raaz4aBvNFvtiZ+XrPvL//AKv/AISgl6z7yy0cR+nwAEZQsdJ9aoVxY6T61QQ9dH7haPkZ+595qfc
zQPkZ+595qfcyy0cT6hyABGIJdG/nShGCimkRD6uaDqtprPhoM71He7Y5M/P15d5fx93X2lBP133llo4j9P
gAIyhYaR7WfcV5YaR7WfcIeuj9wtXyM9ce8VPuNCzPXHvFT7iy0cT6hzABGJ6pTdOoprmi0s72detuSiksF
STdL95fcIe2jaYtEQkat7CP3FUWuq+wj9xVCV1/sAAeDvZe90+8vihsve6feXxYbeG+ZAAVqAAAAAAAAAA
AAAAAACPe3tGwtnXrtqCwuHMkELVNNo6pbdDWcopPKcXyYHhXGl6lSTlOjVi+qf8AuZraaw021oxqWc
oxquWHCLysHStsbcRlmhcwa6srDPVvsbVlNO5uYqPWoriBK2KdR2NdSzuKfo57jPW8o0dooyqPdjGvlt9
XE39naUbK2jQoR3YR/qUer7LxvbmVxbVVTnPjKLXBgXsp069KpTp1Iyk4tcHk/OFQhDU3Ru5ypRU2pSS4
rjzNdoWg3GmXMq1W4U1KO64o76vs9b6lLpYvoq3xLr7wKtbN6fKn0i1P0cZzw/1O+jaFYq4jd2l5Kt0cm
sbuOJC/sdd7275VT3e5l9oui09Jpy3akpzn6zb4eAGU2p4a5N/8qNZpGp2txptGSqwjKMEpRbxhmT2pW
ddmvoic9kZ1aUKttcKKnFNxkgIm1d9SvdSiqD3o04brkut5NbolGVDSLaE1iSgsrsKrS9k6drWjWu6irSi8qK
XDJpFwAN4WWVMNo7Cpe+SqUt7OFLHotlrJKUXF8msGXpbJShqSrSrp0VLexjiBqTxWq06FKVSrJRhFZb
Z7IOs2E9S0+VtTqKDk08v6AZHXNdqanW8nt242+cJZxvd5caDYWGnU1WrXFKVw18Xq/Qg/2LuP+Lpf5
WP7F3H/ABdL/KwNfSq060N6lOM48sp5PZXaHps9KsHb1Kkajc3LMVjnj/QsQAAAAAA+Rna3tp/czRPkZ
2t7af3MksnE+oeAARjD6vWXefD6vWXeFj2v17BfaUDLtV6PQ46WGcdpSMstGvMTh8ABGYLHR/Wq9yK
4sdH9ar3IQ9dH7haFXq/rw7i0KvV/Xh3Fls1/hXAAj5wuZd1V09i93jvRyUhNsb1UV0dT1ep9gh7aNoiZif2
hvg+JYaVTe9Ko1hYwjvKlZ1Xvtwb+481r2jQp7lHDfVjkV6V04pPNMompTU7ppfw8CIfZNyk23ls+EZ7Tz
WmQ6UPb0/uRzOlD3in9yCV9w0K5I81PZy7j0uSPNT2cu46fVn0zsvWfefD7L1n3nw5fJkLLSZr04N8eZW
nSjVlRqKceoQ707ctspuq05b0ZpcMYZEtabqXEUlwzxLWldUK8PSkl2qR66S3optShHuK0zp1tbmyXk1TtZ
t9mEURKvbvyiW7HhBcvqRSS8da8Wt4AAHittJ9hL7jhq3todx30n2EvuOGre2h3F/TZb8KAACMYAALLSf
VqHjVvaw7j7plSFNVN+cY57Xg8anUhUqQcJKXDqZf01TMdFCABGUAAGgtvd4dxX6t7SHcywtvd4dxX6t
7SHcyy36v41eACMAAALfS/dn3kPUve5dyJOnVacLfE5xi88myJqE4zum4yUljmi/pqvMdKEYAEZQ6W/vE
O85nS394h3ha+2hKXU/e33F0Uup+9vuLLdxHwiAAjAAAC8sfdIdxU3fvVTvJ1re0aVvCE5PK+hX3E1UrzlF
8G+BZadW0TSIhzABGYJOne+RIxJ073yId6f1C8KbVPev8ACi5KbVPev8KLLZxHwhgAjAAAC70/3OBV3vvU
+8mWl7RpW8YTk1JfQg3M41K8pReU2Vp1LROnEOQAIzBIsPe4EckWHvcBDun1C9KbU/evwLkptT96/A
stnEfCGACMAAAL+h7vD7UUVX2su8tKV/QhRjFyeUscmVdRqU5Ncmyy061omsYeQARmCx0j16nciuLHS
PXqdyEPXR+4Wj5Gdre3qfc/zNE+Rna3t6n3P8yy9+J9Q8AAjGH2PrLvPh9XBrIF/wD9X/wlBL1n3lr5fQ6H
d3nnGOTKp8W2WWnXtE4w+AAjMFjpPrVCuLHSfWqCHro/cLR8jP3PvNT7maB8jP3PvNT7mWWjifUO
QAIxB9XNHw+rmBfx93X2lBP133lsr+gqW7vPOMcmVMuMm12llp17RMRh8ABGYLDSPaz7ivLDSPaz7h
D10fuFqzPXHvFT7jQsz1x7xU+4stHE+ocwARiCbpfvL7iESbGtCjWcpvCwId6c4tEpmrewj9xVE+/uqVelGN
NttPPIgCXetMTbMAADxd7L3un3l8UNl73T7y+LDbw3zIACtQAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
z2rbNz1HUHcq4UE0ljdyXtCn0NCnTzndilk6AAAAAAAAAAAAAAAAAAAAD5Gdre2n9zNE+Rna3tp/cySyc
T6h4ABGMAAAAAAAALHR/Wq9yK4sdH9ar3IQ9dH7haFXq/rw7i0KvV/Xh3Fls1/hXAAj5wACBx7QAUA
AAOlD29P7kczpQ9vT+5Ba+2hXJHmp7OXcelyR5qezl3HT6s+mdl6z7z4fZes+8+HL5MgAADIAAAAAABba
T7CX3HDVvbQ7jvpPsJfccNW9tDuL+my34UAAEYwAAAAAAAAAAaC293h3Ffq3tIdzLC293h3Ffq3tIdzLLf
q/jV4AIwAAAAAAAAB0t/eId5zOlv7xDvC19tCUup+9vuLopdS97fcWW7iPhEABGAAAAAAAAAJOne+RIx
J073yIh3T6heFNqnvX+FFyU2qe9f4UWWziPhDABGAAAAAAAAAJFh73Ajkiw97gId0+oXpTan71+BclNqf
vX4Fls4j4QwARgAAAAAAAACx0j16nciuLHSPXqdyEPXR+4Wj5Gdre3qfc/zNE+Rna3t6n3P8yy9+J9Q8AA
jGAAAAAAAAFjpPrTK4sdJ9aYh66P3C0fIz9z7zU+5mgfIz9z7zU+5llo4n1DkACMQAAAAAAAAWGke1n3F
eWGke1n3CHro/cLV8jPXHvFT7jQ9Rnrj3ip9xZaOJ9Q5gAjEAAAAAAAA72XvdPvL4obL3un3l8WG3hvm
QAFagAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAHyM/cwlC4mpLHHJoD
xUpU6nrwUu9EeOrp88M6C/8kofKh4DySh8qHgMPDtrbqAF/5JQ+VDwHklD5UPAYTtrbqAF/5JQ+VDw
HklD5UPAYO2tuoAX/AJJQ+VDwHklD5UPAYO2tuoCz0iDSqTa4PCRM8kofKh4HWKUVhLCGHpp6E1tmZ
fSt1aEnuTS4LgWR8aUlhrKK971564ZsF/5JQ+VDwHklD5UPAmGXtp3UAL/ySh8qHgPJKHyoeAwdtO6gBf
8AklD5UPAeSUPlQ8Bg7ad1AC/8kofKh4DySh8qHgMHbTuoDtawc7mmorPFNlz5JQ+VDwPcKVOn6kFH
uQwteHmJ8y9rkfJrMJLtR9BWtnKkXCpKMlhpnk0M6FKo8zhGT+qPHkdv8qHgTDHPDTnxKhBfeR2/yoeA
8jt/lQ8BhO2tuoQX3kdv8qHgPI7f5UPAYO2tuoQX3kdv8qHgPI7f5UPAYO2tuoQX3kdv8qHgfVaUE8qlH
wGF7ad3DS4SjbtyWMvgcNWg9+E8cMYLRJJYR8lFSWJLKYaJ0805WbBf+SUPlQ8B5JQ+VDwGGbtrbqAF
/wCSUPlQ8B5JQ+VDwGF7a26gBf8AklD5UPAeSUPlQ8Bg7a26gBf+SUPlQ8B5JQ+VDwGDtrbqA+pOTwll
svvJKHyoeB9hb0qbzCnFP6IYO2nd9oxcaME+aRA1aEm4TS4LKZZnyUVJNSWUw03pzV5WbBfeSUPlQ8B
5JQ+VDwGGbtp3UIL7ySh8qHgPJKHyoeAwdtO6hBfeSUPlQ8B5JQ+VDwGDtp3UIL7ySh8qHgPJKHyoeA
wdtO6hO1pBzuYJLk8lx5JQ+VDwOlOlCmsQior6IYWvDzE5mXsqtToT6XpEsxa8C1BWm9OeMM1h9gw+
w0mF2DC7CYZu2/rN4fYMPsNJhdiGF2DB239ZvD7Bh9hpcLsR8wuxDB239ZvD7Bh9hpMLsGF2IYO2/rN
4fYTtNoTddVGsRXX2lthdiPuBh1Xh+Wc5Cr1ShN1VUim1jDLQFe96c9cM1h9jGH2GkwuxDC7ETDN239Z
vD7Bh9hpMLsQwuxDB239ZvD7GMPsZpMLsQwuwYO1/rN4fYMPsNJhdgwuwYO2/rN4fYTdOoTlXVRp
qK6y3wuxH3Aw6rw/LOchV6nQm6qqRTaa446i0BXvekXjDObkvhY3JfCzRYXYMLsJhn7b+s7uT+Fjcn8LN
Fhdgwhg7b+s7uT+Fjcl8LNFhdgwuwYO2/rO7kvhY3J/CzRYXYMLsGDtv6zu5P4WWel0J04ynNY3uCyT8L
sPow7poRWc5Ciu6E6VeTae622mXowiu9TT54wzWH2DD7DSYXYMLsRMPDtv6zeH2MYfYzSYXYhhdgw
dt/Wbw+wYfYaTC7BhdiGDtv6zeH2DD7DSYXYMLsGDtv6zmH2FrpdGVOMpzTW9yyTsLsPow9NPQ5Jzk
KO9oTp3EpNPdk8pl4MFd6mnzxhmsPsGH2GkwuwYXYTDw7b+s3h9gw+xmkwuxDC7Bg7b+s3h9jGH2
GkwuwYXYMHa/1m8PsGH2GkwuxDC7Bg7b+s3h9ha6XRnDenJNJ8Fkn4XYfRh6U0OWc5CjvLepC4k917
reUy8GCvTU0+eMM5uS+Fjcl8LNFhdh9wuwmHh239Zzcl8LG5L4WaPC7D5hdgwdt/Wd3JfCxuS+Fmiw
uwYXYMHbf1ndyXwsbkvhZosLsPuF2DB239U1hbzlcRnutRjxyy5AK99PTikYAAHoAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAGY1nanyavK3soxnKLxKb5Z+hd6vcO20q4q
x9aMHgxuy1nC91bNZb8acd9p9YHWntVqVGalWUZxfVKODVaTqlHVLbpKfoyXCUX1HzV7CjdabWg6cc
qLcWlyZktk7iVHWY00/Rqpxa/wDfcBvQAAAAAAAAAAIOs3dWy02pXoLM44wmicfGlJYaTX1Aw8trNRj6
0ILviavRrupfabTr1cb8ueDNbaxjG7t91Jfs+pfVl9sz+46AFqAAAAAAAAAABwvrh2lpUrRpyqOKyoxWWzu
GsgYOeq6zqtaSt+kUV/DSjwj+JzWqaxpddKvOov8AlqLKa/E3tOjTpb3RwjHeeXhczIbYX9G4rUrak1KVJtyk
vr1AaXSdQjqdjC4it1vhKPYyaU2ytrO20iLqJqVR72H2FyAAAAAAAAAAAGP1KeurUa6tlX6Lfe5iPDGSvub
7W7RKVxUrU0+W8sZN7WqKlRnUayoRcsdx+c6hqMtTv1VupSjSzhJcd2IGh2Uu7+8uKs7ipOdGMcJvlk1
BXaLXsallGFhJbkFxXX+JYgAAAAAAAAACv1nU4aZZSqPDqPhCPawIG0Gv+bpRoW27Ks+Ms8kiZodxe3dp
5ReqMVP1IpY4dpltF0+pq9/O7um3Rg96cn1vsNdbarYV6sbe3rwlPGFFfQCcAAAAAAAAAABmdrNRubO
pQhbVXTcll46zTGJ20nvalRj8NP8AUDjSr7QVqcalN15QkspqPMt9npas76Xl6q9Hu8N+OFkh2G1kbW0p
W7tG1TjjeU+f9DQaXrVrqiaotxqJZcJcwLEAAAAAAAAAACq1zWoaVRSS360/Vj+rLU/Pdoq7uNcq7z9GL3
F9MAdI3uuapNyoyquP/IsJfiT9Jeu09SpUazqqm+MnNZWO89U9qbWwoU6FpaucIRw25buWWel7SWu
oVVSlF0ar5JvKf4gXQAAAAAAAAAAz2117cWVG2dtVdNylLOOvkUVG7164pqpRdecHycYZX5Gt1fSKerQ
pRq1JQ6NtrH1O1la09MsFSUm4U03lgYe41PWLWahcVqtOTWcSWDW7NVri40lVbqTlOU3hvsMdd1Ku
s63JQ4upPdj9FyP0K1oRtranRgsRhHCA6gAAAAAAAAAA3hZfIxWo7RXt5du309uEG92KisuRtJxU4uL5NY
PzmSqaJrak1GbpTyuPBoCbXjtBp9PyirOoorm97ex3ovNnNdlqW9QuEumgs7y/iRWantVC7sJ0KNBxlUW
G5PketjLGXTVLxtKKW4lniBrwAAAAAAAAAB5q1I0aU6k3iME5N/QxN3r2o6nduhYb0It4jGC4v65NdqlKd
fTLinT9aVNpLt4GG0C+p6Xqm/cxajhxfDigJNWrr2k4rVp1Nztb3kabQtYhqtu8pRrQ9eP6lZr20FlX02pb28
ulnUwuXBcSr2QqSjrKgnwnB5A3YAAAAAAABV7Qu8WnLyDf6XfXqLLxxLQAfnlxqesWs9yvWq05c8SWD
b6VWlU0qhVqyzJwy2zJbZfvaP2Iu51ZUdj1KLw+iaT7OYFTq20tzcXLoae3GCeE4rLkQ53et6du1qsq8Ivrm
sr+p22Pt4VtVlOaT6ODa78o1+qUIXGm3FOaT9BtfR4Ai6FrMdVt3vJRrQ9aK6/qWpgdlqro65CKfCacWb4
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAga7SlW0a5h
HjLc4Iyux1eNLVZQk0ukhurPj+huJJSi0+KfAxerbO3drdO4sIynTb3koc4gazUq0bfT69SbSUYPmYjZek6uu
0pR5QzJ/l+oqU9c1FKhVjXnFdUo4S7zUbP6MtLoOVXEq9T1mupdgFwAAAAAAAAAAAAAxu2/vlv8Ay/1
ZebM/uOgVm11hdXd1QlbW9SqlDDcVnHFlvs/Rq2+kUadaEoTXOMlhoCyAAAAAAAAAAAAj39KpWsa1
Oi8VJRxHjgDP7Q7RdFvWtjLM+U6i6voiNs/oKrSV5ftbucxhJ8X9WQ3spqmcuNLP8w6f2b1pLCmsfzgNxF
xxiLX4H0o9nNOvbBVvLZJ7zW76e8XgAAAAAAAAAAPimBHd1a1alS3dWDmvRlBviVWqaLpcLGrN04Un
GLaknjiVd/svf+VTrW1ZVXNttt7rIn9ndYrNQqZ3f+apwA87K1KkNbhGm3uyTUu43xS6FoMNLzVqSVSvJY
z1RRdAAAAAAAAAD841u/q3+o1HUeIwk4xj2JH6ORnp9pJtu3ptvi3ugY202llZ2KtaNpTUd1pvLy/qVunX
8rC/jdRgpuOfRb7T9Ar6dauhU3LanvbrxiPXgyeg6RdQ1enK7s6ipJPLnHhyA1WjahLU7BXE4KDcmsJk88U
qVOjDcpQUI9iR7AAAAAAAAAFfc09MuLx07mNCVdLlPGSwMnq2zN7XvKlzb11Uc3nEnhr8QLa80bS3bT
c6NOmkn6UfRMfokpUtbodC2/Txw60Sv7P61U9CWcf81R4L3QdnVp1Tyi4kp1sYSXKIF+AAAAAAAAAAB
+d7R0JUNarprhN7yfefohV63otLVaSedytH1Z/owPGl6Tp3m2lihSq70cucoptsyGqUaVprcoWj9GM1u4fJ
55E9aHrlsnSoze5/yz4E3SNlqkLiNxqEk3F5UE85f1YGmoNyt6bl6zim+/B0GAAAAAAAAAAKPavUPJNN6K
D/AGlZ7vcusvDK69o2p6nqDqU40+iisQzMDhsbY79xUvJx4Q9GPebEiaXZRsNPpW6S3or0mutksAAAAA
AAAAAAIup1p0NNuKtP14U3Jd+DCaHb0tQ1dQvJNxknJ5frPsP0ScYzg4zWYtYafWZG/wBlLinXdXT6icW8
qLeHH8QLfUdE012FVujCluQbUo8MPBmdl69SjrUadNtwqejJdv1O89G165XR1Ztw/wCafAvNC2fhpknW
rS6Su1jhyiBdgAAAAAAAAAAVN9oOnahVlNpRq/xOD/NFs84eOZi7zQtZ8qqVadTe33nMZ4/oB31PTNL0
eyqTf7SvJYgpPPPrwRtjbaU9RncY9GnHGfqz5Q2W1G5qp3dRQj1uUt5mt0+xo6fbRoUI4S5vrbAlAAAAA
AAAAADDbZfvaP2Iveglc7IqnBZk6Lwu18SJtFod7qN+q1tGDgopelLBe6bQnbadRo1Ut+EcPDyBjNlLuFpq
zjVkoqpFwy+3JrtYvKVpplac5rMoNRWebZSavstOrXlX09pbzy6b4Yf0K6GzWrV5qNZ4iuuU84A+bJ0JVtZ
VTHo005N/U3hA0jSqWl23Rw9KcuM59pPAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAi6hf0dOtZV6z4LgkutmYntXqFebdpbRUfqnIs
dsLWtX0+nOlFyVOTckiq0HaK3061VtXoS4PO/H9QJ2l7S3Vxe07W4tfSm8by4Y/AuNV1WlpVKE6sJSUnh
YPNlqOm6hVjUoSpyrLllYkvEzO1dG9hcOdabdvKf7NZ5Aa7Tr2GoWcLmnFxjLOE/o8Ekxuz1rqkoW9WlV
krTe4x3urPHgT9o9dq2tVWVnwqyXpS7PogNHkGOek69Gh5S7ye+lvdH0jyWOzet1L5ztrr20OT7UBoBld
pgbzU9Qpa3WjQuKraqNRhvNrwJNxp2vUaLupXFVtLelFVHlAbUGf2Z1upf71tc8a0FlS+JGgAAyGvS1da1i
2dfo+HR7mcfj+JraW90Uek9bHHvAqNf1a40x0lb0lU3+fDkV2m7T3N5qNG2qUoRU5Yb6zVNGA0/8AvZ
D+cBvyJqt3Kx0+rcQScoLKTJZWbR/uS4+0CghtZf1c9HaxljnhNntbW3dKS8os1u/iiJs1rFvpcLhXG9+0axhd
mTttBr9pqNl0FGlJyynvyXIDU6fqFLUrPpqDxng0+aZnrPTNXhrvTVJy6PfblPe4NE/ZSznbaXKc2s1XlJPOEU
+n3t1LaropXFV0+lmtxzeMceoDajJj9rry5t9TpRoXFSnF0k8Qk0s5Zx6DXtRt/KlVqKDWYxU93K7gNsDI7M
6zcu+8iu5ympZScuLTRaa9R1WtOlDTqjjCWd7Dw1+IF1kGIvdP1vTqLuZXdScY8ZbtR8C+2b1aepWklW4
1abw32oC5BgLvU7+jrdZUrirLFRqMHJteBZ22n6zO2uqlzWrQnKnvQxU45XHHBgawGW2S1SrVrVbS6qz
nP1ouby/qj1tbqVWjOjaWtScKj9KTg8P6IDTnK5qOjbVKi4uEW0cNKo1KGnUY1qkqlRxzKUnlnS/9wr/y3+
QGUjtfeyeI28H3Jn3+1eof8Iv8rK7Z7UqOmXc6teMnGUccDRx2tsG0lTqcfoBa6XdVLywp16sdycuaJeSDq
WpQsdNldYy2luR7WzJ2z1rXKs6lKvOEE+ak4xX0A3QPz/UbnV7CUba5uKsWuMZKb9Jd5oa1xWWySrKr
NVdzO/vcefaBfgzex1zXuKVy69apVw4435N45nPbG6uLedv0FapTynnck1kC71ijcV9Nq07SW7Va4fUrd
mLK/tI1fLG4wl6sZPJ7q16q2R6ZVZ9L0Te/nj4kDZmrc31jfU6lxVlLCUZObyn9ANWDHbO6lcUtXnaXlapPe
bj6cm8NFptVqUrOxjSozcKtV8HF4aQF6MpdZn9Oo6jHZ2VSFacrqot+PSPe4fj9Cuej69Vg6s7qalz3ekeQ
NiZnarUruxuKMbas6alDLx3kbZ/WruGoqwvZSnvNxTk8uLX1PO23vVv9n6sDUadUnW0+hUqPM5QTb7
STkp/OEdN2co15LL3EortZRWtPWde3riN06VNPh6TS8EBtQY221TUdF1GNrqM5VKbxlyeeHamStsLqvQ
8mdvXnTUk87kmsgajOAYe3p67q1sqlKrUVKKwnv43v9T3o2sXtpqcbO8nOcXLdkpvLiwNRqup09Lt41qs
ZSTeMI9abfw1K0VxTi4xbxhmY2vo3iryqzm3aNpRjnk8dhz2fttVnClUt6slbKfpR3sd/ADbAFDtVK+jaU/Iu
kxven0ec/wBAL443VWVG3lOKy11ELZ93b0qDvd7pMvG/zx9SzfEJPmFO9VrJ4dNLvJ1a8jRt41JrLkuCRX
6usXUcfCizp04VbWEZxUlurmcwzac3m1q5VstUuG8xppR7iXZagriW5Nbs/wAyTU6KhRbklGKRT2EXUv1
OKxFPLHpJm9LRGc5SrjUK1KtKEaeUmcnqtZc6aXeWtWUadOU2s4WShdaNzdKVeW7DsQnwmrNqz9Le
2unUtOmqrd5kOWqVqk8UKeV9eJJvIxnp76HjHHDBD0y5o0YyjVe6285wMra1sxXP/rvb6m3UUK8N19p
ZJ5KDUK9OtXTpcUljPaXFlNztKbfYWJdaOpM2mszl3ABWkAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEW/vrewpRndSxGT3eWSBVtNE1CDqfsXn+KEsYJmp6Xb6p
SjC4z6PGLT5FFPYxb37O8e79YgUV7Tp2Or7um1nUUZLdknnj2Gg2yUnp9vJr+Lj4EzTNmbWxqqtOTrVI8
U2sJFlf2NHULWVCuvRfFNc0wKzZa5orRKMHVipqUlut8ctszu01KdLXZzm3GM8SUl2FxQ2PhRuIVFeTxC
Sklu9n4l1qGmW+o0FTuI5cfVkuaAztLS4VqHSx1t7jWct8v6krZ/R6FG78tt71V4rMWkus5vYyG/6N5NR7
Nz/cutL0mhpdJwo5bl60n1gYupXhbbUSrVfUhWbZsrvVbKnYzquvCUXF4SfPgY6dvC62olQq53J1mnguXs
ZSdThdzUM8t3/cCBsjTlU1mpWisQjF5/Hkbciadp1DTbforeOFzbfNksCtvNdsbK7VvXqNT68LhHvLGMlKK
knlPkUmpbM0b+/dy60ob2N+KWcl3CCpwjCPKKwgPpgNP/vZD+cb8oqGzUKOqxvlcybU9/c3P9wL0rNo
/wByXH2lmRtQs1f2VS3c3BTWN5LOAMlsrb2NaNz5bGnJpx3d947Sx1mz0WGn1ZQVKFVR9DdlxbOa2L
p/8dP/ACL/AFPUdjKKlmd5OS7NzH6gcNjK9WUrii23TUU8PqfEg6d/fBfzp/kzY6fptvp1B0reOM85Pmyvt
9m4UNW8vVzJvfctzd7f/kCk20/e1H+SvzZrrFJWNFJcNxFdrGz8NWuoV5XEqbjDdwo562/1LajT6GjCmnn
dWMgYXTuG1rx8+f5sn7S6tdR1FWdCo6UEllrm2yyt9m4UNVd8rmUm5ue5udv4nfV9Bt9VkqkpOnVSxv
pZygKLUdGqWunTrV9TlPh6ueEjpsQ/Su+6P6kqlshSSfT3U6nDEVjkT9G0OGkOq415VekS5xxgDL26Uts
MSWV08v1N6UdPZuFPVvL/ACmTlvue5ucOP1yW13dUrO3lXry3YR5gYvVIS0TaJV6axBvfXd1o96bGWu
bSSuJpunCW/wAepLl+h22p1HT7+1o+TVOkrRlzS5IttlbB2mmKpOOKlb0n3dQF2R7/ANwr/wAt/kSDxXp
dNQnSbxvxaz2AYLZqnZ1byor5QcN3hvvHE0ytNATyo2/+d/6kD+xVP/jp/wDlr/U+/wBi6f8Ax0//AC1/qB
32pjG40ONS2kpU6c1xi8rHI5bJahbRsHb1KkYVIybw3jKLjT9Mp2WmqylLpoccuSxnJUXOx1CpVcqFxKlF/
wAO7nAFdtfe291c0adCam6ae80WtSEp7GYjxapZKLaDSKOkwt405ynKeXKT6zXaLGM9Et4yScXDDT6w
M7sffULaVelXqRpueHHeeM4yctrr+hd3VKnbzU1TXFrlksrnY+hUrOdC4lSi36u7nAnsdbypRjG4nGS5y3c5
A61f7l/+CyJsP7O774/qXktMjLR/N/SvG5u7+P0OWi6NHSI1VGs6vSNPjHGMAZ7ai2lYatTvaPoqbUs9kkR
51p7Q69RSTUOCx2Jc2a/VtMp6radBUk4NPKklnBF0fZ+lpNadVVXVnJYTccYQHzaK/qaXpcfJluyk9yL+FF
NpmnXep2juqmpyhlvhnkam/saOoWsqFdZi+TXNMoY7HQjPHls+jfNKPP8AqBRadFQ2kpxjU6VKq0p/Fz
4lntt73b/Z+rLK32VoW1/C5pXEkoPKhu/qSNZ0GGr1ac5V5UtyOMKOcgVmtUZ1NlbWUE2obrkvph8Ss0
W0jeUN1alK3mn7PODbUbWFOyjay/aQjHdeVzKO62PtqlRzt68qKf8ADjKAgvQbe4u40ZaqqlbGUnxZ92
xh0VKyp5zuxayWem7L29jcRrzqyrTi8xysJEjWtEhq/R71Z0ujzyjnIHXQUlotsksej+rMnqXDayWPmo2tjbK
zs6dupOaprG81jJVXOzcLjVHfO5lF729ubv8AuBy2yTelQfZUPuydzRjpChKpFSU3lN9xc3tpSvradCvHMJf0
M/DY6EKylG8mop5S3f8AcDTkPUdSttNpRncyaUnhJLLZLisRSbzjrK7WdHp6vRhGVR05QeVJLIEuyvKN9b
xr28t6D/odyHpen09Ms429OTkk8uT62TAKXWPe4/aiyhVhRs4Tm8JRRzu7BXVVTc3HCxjB6uLNV6EKW+
1udeOZMM0VtW1rQrK9ed9XUd5Qh1ZLK18moQUITjnreeZG8zr5z8D1DSVCal0reHnkTy4pXUi2ZjylSur
eU5UpzWVwafWQdQhaxoZp7u/1YZ2raXCpNyhJxb4vrOcdHW9mVRtdmBOZdXjUt4mHrSHLyee96ueB
7lbWVVuScV24ZKVCEaHRQ9GOMcCA9HTfCq8dxVmlorEYyiXfRSqRp2yyl1rrZdWtPoreEHzS4nC20+lQa
k/SmutkwRDrS05rM2kABXuAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAKyOg2cdQ8sSl0u9vc+sswAAAAAAAAAAAAAAAAAAAAAAAAABwvbOjfW
7o3Ed6D6s4O4AprfZjTqFZVNyU2nlKT4FykksJYSAAAAAAAAAAg6lpNtqbg7hS9Dlhkm2oQtbeFGnncgsL
J1AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADncNxt6j
Tw1FgdAYDTNoru2vIyuKsqtJ8JJ9S7TeUasK9GNWlJShNZTQHsGL0rUburtFCjUrzlT32t1vgbOTUU3JpJc2
wPoIb1awU9x3lHP3olwnGcVKElKL5NMD6AHwXEACJPVbCnPcld0VLs31wJNOpCrBTpzjOL5OLygPTaSy
zmrijKW7GrBvsUkZ3a3U5UqELe2rJOT9PdlxX0Imh6NSnUtrqV7B1M7zpKXHuA2IB8lKMIuU2oxXNsD6G
0k2+CRD87WDnuK8o5+9HS9knp9xKLynSk013AdYVadR4hUjJ/R5PZidj6qhfVpVam7FQ4uT4I1dPU7Gr
U6OndUZS6kpriBLAItbU7KhLdq3VKMuxzWQJQONvd29ym6FaFTHPdkmeq9xRtob1erCnHtk8AdARpah
ZwpKrK5pKD5S31hnq3vba6z5PXp1Mc1GSeAO4BEqapY0p7k7qjGXY5rgBLBGqahaUlF1LmlFSWYtzSySI
yjOKlFpxfFNdYH0EWtqNnQlu1bmlCXY5rJ2o16VxDfo1I1I9sXlAdAD5KSjFuTSS5tgfQQpavp8Z7rvKOfvRK
pVadaCnSnGcX1xeUB9lVpweJzjF/V4DnCMd6Uko9rfAx+2cpK+oYbXo9TLDWW1sjSabz0dPj4AaCE4TW
YSUl9Hk9Gd2MbemVctv9q+fci9r3NC3jvV6sKa7ZSSA6gjUNQtLiW7RuaU5diksnWvcUbaClXqwpxfDMn
gDoDxSrU69NVKM4zg+UovKOdW+taNVUqtxThN/wykkwO4DaSy+RwpXltXqOnRuKc5rnGMk2gO4ON
e7t7ZZr1oU/ukkebe+tbl4oXFOo+yMk2BIAItbUbOhPcq3NKEuxyWUBInUhT9ecY57Xg+pqSTTTT60ZDb
GvCq7adCqpRcXhxeUaLRXnR7Vv5aAnANpJtvCRxoXlvcSlGhXp1JR5qMk8AdgDLazeazVv/JLWjOlB+q4r
1vrkDUgwl1T13SoxuK1Woo557+8jT6BqktUsekqJKpB7ssdYFoAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAc7n3ap9rOhzufdqn2sD
840vT5ajVqUoPE4wco/V9ha7PavPTrp2V42qbljj/Azxsd+9pfy3+Za7T6J5TB3ltD9rFenFfxICl0Vp7UQa5O
bJ21eoVql9HT6MnGKxvJP1mys2b/AH7b57X+RP2rs6tvqkb6EW4Sw89Sa/8AgCVT2PhK0TlXl07WeXBE
TZ2+uLHVnYVpNwlJwab9Vosae11orNOUJ9Ko43cc2VWgW1bUtbd7KOIKbnJ9WX1Abky21+p1acqdlQk
47yzNrm+xGpMltjYVenp3tOLlFLdljq7APtlsjCtZxqXFeSqzjvLC5ZIOmXNxo2t+SVJuVPf3ZLq7y0sdrLWNjC
NxCaqwilhLngqLGnW1vaDyhQap7+9J9SQHranTo2d500ajk68pSafVxLbZ/QoU429/00nJrO7jgR9t/Wtu
5l9of7mtvs/UCeYraK/r3+rKwoyagpKCS62zamG1+2rabrivYwbpuanF9WewCfPY6CtfQuH0+M8VwyTtP
0+60/RLmndVlNunJqPw8H1nCe19orXejCbq49THWSbHVJ6po11UqUHTcaclnqlwfIDI6Np89SvOghN04
4zJ/Qma5oPmmnTr0qzlFy3eKw0zvsX+8K32Frtn+54fzl+TAkaDXlqGhRVeTcsODf05fkU70PSqMpK81FdJ
nknyOulSrR2QruhnpPS5c8FVoa0qUqr1ST3/AOHOfx5AcozWl6zDyK56WmpL0lyafUaLbCW/pNGXxST
MzfytJaonYQcaG8lHPX9TSbWfuW371+SAq9D0CWq2rrVq7hTT3YpLJFr0q2g6zGMKre4001wyjU7JfuO
H3yKDa798r7UBcbValUttPo06Ut2Vfm12cP8AUrtH2YjfWcbm5qyW/wAYpdhZbR6ZUvtMo1KK3qlGOd
3tTS/0KnTNpamnWytbig5bnBdTQFfrWn1NMvI0JVHUhjeg32Gj1fUp2Gz9vGi8VKsVHPYsGa1i+r6jdxr1
6bpxccQWOrJotb0+pd7P21SjHelRim114wBVaXYaZc2/TajfbtSWfR3sNd5zoXK0fWYqzuemoNrOHwafU
NKuNIjR6PUbeXSRfrrPEsbCWhXmoq2o2k1njGbb4sDXJprKIOr2avtPnRdXoutS7CakkklyRntsp1o6fSVPK
puT38f0Ar56Lo0KTjLUl0yXPPDPccNlrqpb6x5Mqm9SnlfR45M9aZ5hjpynd5dwvWTzxf0IugOL2ipuEXGL
k3FdiAnbae/UPtLDWv7oUv5dP9Cv209+ofaWGtf3Qpfy6f6Ac9lKyt9Dua0uUJt/0RUWVC42k1Obr1XGK
W8/ouxFtstQ8p0G6o/HNx/oip0q8qbP6nUhdU5brW7JfqgJOtbPea7ZXVrWk1FpST5r6kyhVnrmzFanV9
KtR5Ptxy/Uj6/tDQv7LyW0jJ77W9JotdlrCdppjdaLUqzzh9gEPY69Xkta3qSx0Xpr6LrM7qVxUvdQuLpJuKl
z7Owkaiquj6vcwpcI1E1/hl/8lzoukKrs7X34/tLhNxfYly/UCY9XT2W8qbzUcNz/ABcmV2zcPIdLu9TqRzJp7
uetL/czyq150Y2HHd6RNLsfL9TfebV5i8hhiL6Ld/F/7gY+z6LV76pV1S86OC44b4v6I9apb2enzp19Kvd959
XPFfUj2atrG9nR1S2lKPLsaLKrdbPRnBUrWdTLSb48ALK91qp/ZincweK1X0G+x9ZV6Hs/51oSurmrJQbws
c2W2t6XCegxhY03u03vqPXjrK3Z7aCjp9o7W6jJRi24ySArtd0qelXEafSOdKSzFvqNton7mtf5aMZtDq0dV
uIOlBxpU1hN9bNnon7mtP5aAkXdF3FrVoqW65wcU+zKKHZ/QLrTr+de4nHd3XFKLzkv7qsra2q1mm1Ti
5YXXgpNE2jnqd7K3qUFDg5RcX+YGgPjS5vxPpldptfnSqTsbVuMlwnPs+iA8bU6vCvFWFt6bcvTa7ewtdm
dOqafpuKyxUqvfa7DL6Jd6dY1PKLuE6lb+HC4RNfpes2+qTnGhGacFl7wFiAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAfJRUouMllP
gz6AIdppVjZVXUtreNObWMpsmYAAh09JsKNz5RTtoxq5zvJslVKUKsHCpFSi+aaPQArHs/pbnvO0jnvZPo
0KVvTUKMIwiupI6AAfJwjOLjNKUXzTPoArZ6Bpk578rSOevDZNt7aja09yhTjTj2JHUARbzTrS+cXdUVV3e
WW+B3o0adClGlSiowisJLqPYAHitRpV6bhWhGcX1NHsAVi2f0tT31aRz3snqhSVF0VBKm1uuK4LB0AES0
0uysZudrQjTk1htNnS7s7e9pKldU1UgnnD7TuAONtaULSj0NvSUKfwriQ6mgaZVqdJO1jvPnhviWQAgT0
XTqji5WsG4cI81g73NjbXlKNK4pKpCPJNvgSABxtrWjZ0VSt6ap0087qON1pVjeVelubeNSeMZbZMAEHV
7qrY6bOpbUnOawkks4+pnI7T20lm50yMqvW1hZ/obE4VLO2qS3p0Kcn2uIGHkrnaLVYunR3KaxHguEI
m8p01TpRprlFYPtOnCnHdpxUV2JHoCvuNE065m51bWDk+tZR2tNNs7LjbUIU2+tcWSgAPFWjTr03Tqw
U4PmmewBWw0DTKdVVI2scriuLO1LSbCjc+UU7aMauc7ybJgAiXemWd9OM7qhGpKKwm2+B0q2VtXt
VbVaSlRSSUG3yXI7gDhaWVvY03TtaSpwby0m+Z5u9PtL1YuaEan1fMkgCBb6Lp1tPfpWsFJdbyyfjgABDu
9Ksr2oql1bxqSSwm2yVTpwpU406cVGEVhJdR6AEHzNp6ufKFbQ6Xe3t7L5k4ACLd6bZ3vvNCFR9r5nG3
0PTraanStoKS5N5ZYABhYx1FfcaHp1xU36trByfNrKLAAQJ6Jps6cacrSDjDkuJMo0oUKUaVKO7CKxFLqPY
A+SipxcZLMWsNdpFtNMs7KpKpbUIwlLm0SwAINxounXNaVavaxnUlzk2+P9ScAKz+z2lf8HDxf+pJs9Ns7
FydrQjTcuDw3xJQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAOVe5o20d6vUjBf
VkSOuabKW6ruGfxMdeVZ6rrzpXFbo4Oe6svhFF5LY6zlS/Z3FXexwfDiBo6dSFWG9TmpR7U8n1Ti3hSTf
ZkpqEKezOjuVVyq+nxx9TK2GrO21ZXVWVSVPLe7vAfogIem6jT1K18opxcI5a9IrL7au0tarp0oSrOPBuL4
AX4KLT9qbS8qqlUjKjOXBb3JssNV1KGmWnlE6bqLKWEwJoM3LbG1VBTVCbqN+pnkdbDau0uqypVYSo
ylwTk+DAvwE8rK5HC9uoWVpUuKud2Cy8AdwVOj67S1ac4Qpypzhxw+tFs+K7AOFxeW9qs160KfezjR1f
T689yldU5S7ORSXOy1e71GdW4u3KlJ5T/iX0K3XtAp6VQhWoVpyTeGpcwN0uIKjZi5q3OjwlWblKLccvrS
LcCJU1SxpTlCdzCMovDT6jytX09v3qn4mJuLeN1tNVoTbUZ1mm0X9TY6z3Hu16sXjm8YA0NOtTrR3qU4
zXbF5KjXNoFpNaFKNDpJSWXl4wjPbNVq1vrcbenNypybjJLljtLzaS9sbWtQjeWbuHJNxaeMAXFlcxvLOlcR
i4qos4fUdyBUv6Vro8buNJqmoJqC6kVcdsLR0HN0ZqecKGeYGjBnbTa+1rVlTrUpUlJ4Um8pF3dXdK0tZX
FVvo4rLaWQO4MxU2zoKWIW05LtbLLStetdUk6cE6dVcdyXWBagqtZ1ynpE6UalGVTpE2t14xgiPay1dW
jTpUpTlUwnx4RyBoAUcNpaXnJWVW3nTlvbrk2sIuqk1SpyqSeIxTbA9Ap9K1+GqXc6NK3nFQWXNtYLgC
LW1Kzt6rp1riEJrmmePPGn/wDFUzHbSQVTaSrB8pOK/oi4jsbayin5TW4r6f6AX9vfW11Jxt60ajSy0juVW
kaFR0mrOpSq1Jucd172Dzqm0NpptTomnVqrnGPUBbgzdDbG2nvdLQnBpcOOck/Rtcp6vKpGFGVPcWe
LzkC1BSS2kpR1Z2Hk895T3N7KwW1zXVtbVKzTahFywuvAHUz1baiNLVnaeTtwU9xzzxz3EvR9dp6tVqQ
hRlT3Em3J5yV9fUdOjr/RSsN6up7vSZ4Z7cAaYFJc7SUrTUvI61vOPpJOeVjD6y63lub2eGM5A+gprLaGnf
ai7SjQm8NrpMrGF1nC92stbatKlTpTqSi8N8gNAcby6p2dtOvVzuQWXgpLLa61uKsadalKjvPCk3lE7aFp6
HcNPKceDA66Zq1vqkajt1NKnjO8scycZbYf2V33x/Us9U2gtNNn0cs1KvXCPUBbAzdvtja1KijWozpp/wA
Wc4L2pdQjZyuYPfgo7yw+aA7gzlPbC0lCcp0akHFcFnO8eaO2VvOqo1LecIt+tnOANKfFOLeFJN/Rldquq0
bLT413mcKqxFx+qMfo+seQ6jKvXlUqU2mt3e7QP0IEbT72F/aQuKcXGMupnarUjRpTqTeIwTbYHsFLpu0
lDUb120aUoP8Ahb6y6A4yuqEJOMqiTR7p1qdXPRyUsc8FZqFhCMKlfelvc8dQ0ZOVKsk8Z6znPnDx6lubl
mFjUuKVL15pHyndUarxComyBHSZTqSdaq2s8GubIl9a+RVYOE288V2oZmEnUvHmY8L2pWp0kukko57
Tn5Zb/NiVt90lezt5KLk+vCPVLSqc6EZznOLay0Mk6lpnEQsFeUG8KrE6yqRhHelJJdrM5QoqreKFNtx3uD+
hI1Ccqt70G9iMWooZSNacZwtVe28nhVY5JCaaynlFXV0qlG3bjKW8lnLZ40e5k5uhJtrGYly6jUmLYstwAV
7AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAzur7LwvK8ri1
qdHUlxcWuDZT1bPW9Gg6kakujjzcJZRLu7rXtPvatRQnOnOWUkt5Y/Qj3Ws6vqFB2ytZRU+DxB8QLjQtT
Wt21SheUoynTw32SXaZ7SKFKptGqU4KVPefovkaPZjR6unUZ1bjhVq49HsRQ3llfaRrLuaFGc47zlGUY5TX
1A0evY0/Qa/ksFTzhej9XhmX0O8hab9R2LuZt+tnl/Q0thVr65ptxRv6EqW88RzHH4lDTo6vs9cz6ClKpTl8
Md5NAcdXqSv6sKtDT5281za6/6Ftrc6lTZOhKsmp+imn3ni11TXL69pblu4U0/STjhNd7J21+fMvHnvoCHs
jp1tVs53NWnGdRy3VnqRF2usLe1q0a1CKpufBpfmRNIutTsLZ17SlKpQm8NJZ4o6St9V2gvYuvTlCC4ZlH
dUUBrNDqyr6NbVKnGThxJdzb07q3nRrLehNYaPlrbxtbWnQh6sI4Rx1Z3C0yu7TPTbvo458+P9AOWma
NaaY5yt1JynzcnksDNbKT1GVSv5Y6rpdXS55/TJpQOF5d0bK3lWrzUYx/qYyvVu9p9SUKcXGjB8OyK7We
dfnqN9qFSMqFZ0qcmoKMHjvFjf6rp9BUreznFdb6F5f8AQDaWFnTsbOnb0vVgufa+0kFRs/e3t7RrSvqbh
KMko5hu5RbgfnV5SqV9o61OjLdqSrNRfYWtTZ3WJwad3GS7HNlfe0ryhr1a4o21WW7Vcovo20yw/tBrT
4Kxmn29E/8AQCLodx5n1iVvdUY78nuOfXEk7b+92v2P8zlp2kX+o6mru8g4R3t6UpLGfwJO2dvXrXVs6N
GpUSg8uMW8cQJ1/wD3QX8tFXshp1vduvWuIKfRtKKfLiW19RqS2UVONObn0a9FJ58CPsZQq0be6ValO
m3KON6LWeYFftdY0LWvRqUKahvrikX1tc0IbNUat8805U8ST6yu2yoVq3k/Q0p1MZzuxbwdbjTq95slb0
acWqsEpbj4N8+AESnrVluOna6Q501w/wDfAqdNqbu0dCVOm6SlVXoN8k+on6VqWoaZbu0hp85yy8Nx
a4ke3tb57R0qtzb1N51YylJQeF+IE7bj21n9svzRY6Bo1nDTqNepSjOrNb29LqIW2dvWr1bR0aVSpiMs7s
W8ci+0eMoaVbxnFxagsprDQGc2vsnRuaV9SWE+EsdTXI7arraq7N0nCX7Wut2X0xzL3VrON9p1Wi1xaz
HPUzA6baVL3UaNq843uK7FzYGv2UsPJNNVWa/aVnvfh1F4eacFTpxhHgorCPQGA2li5bRVoxeG3FLwR
Njs7rDimrqOGvjZH2jt7p6/Vq0berNJxacYNrkjute1xRSVpPh/9l/6AXuj2d3p1hWjdVFUnxkmnnqMvottD
Utfkrr01mUmn14L7Q9T1G9up076hKFPczl03HJU6hpN9pWpeV2MZTg3vRcVlr6NAXmvaXaT0qrNUoQ
nTjmMksYKrYj2tz9qI17qGsalZzpzoSp0YrM3u7uUSdiPbXP2oCFW4bYyz882OrNLS7lvh+zl+RmNo9Juq
Wou+tYSnGb3nurLTONW81zVbaVvKlNQUcze5u5wB22J96uftj+pEvP73P8AnFhsdb1qF1cOtRqU04rDlF
rtIt3a3D2qdRUKrh02d5QePECdtnY71OneQXGPoz7uo+y1v/6UU979u/2X1z2mgvrWN5ZVbefKcWu5n5
9DTL2V0rd0Kyjv4y4vHeBpNjrLobSpeVFh1OCb7EcrjWNMo31Tyax8oqyfpS7WaKnaxpWKtafCKp7if4Y
MZbwv9B1SdTySVVcVlRbTXegIut3ELmvCpCydq8cePrGluZyqbHb0nl9FgpNZnqeqKnXq2dSFNcIQjFtl5V
o1Hsgqapz3+j9XdefACDsbJxs76S5pJrwZSafcp6k7i4t5XUm3Lcz1mh2Ot6tKjdxr0p095xXpxazzIV9pN/p
GoO705SnDLa3Vlr6YA86rerUbbo46VKlUXqzXV/Qn6I662cu6deMo7ie7vdmCI9b1y6SpUrWcJv8AiUGvz
5Gjqq4notRXEF07pPejHjxwBkdlbGje6hN14qcacc7r5MsNrtOtre1pXFClGnLe3Xu9Z82Ntq9G8uHWo1K
acFhyi11k/a+jVrabTjSpzqPpFwjFvqYHnQqcLrZmKuIKoob+M9XFlHszb0q+uSp1qanDdlwZo9mKE46FGl
WhKDbkmpLD5sznQajoerTq0reU+LSajlNMDdUqVOhTVOlFRiuSR6nCNSEoTWYyWGiBo15cXtl0l1RdKp
vNYaxwJlx0it6nQ+03Xu94ECx0GysLp3FGMnN8t55wWZktnp6rLV5K4dZ0sPf6TOPwya0CLqXuNTuImie
rV70TNRi5Wc1FNvHJEPSITp06rlCSfVlYOf28LfkiU+5uYW1Nym+PUu0qKdKrqVzvz4QXX2fQ43Cua9aUp
06j48PRZ3p3V5SgoQoySX/IPbztfmnz6XUYKMFFLglhETVK/Q2rin6U+COtlVq1bdTrRcZZfBrBV36rXN5uq
nPdXBei8Fn09b2/x4d9GoYhKs+vgj3qGnSrT6Wi1vda7SdRpqjSjTjyisES/uLijOPQwbj1vGcjHhOWK0xKJK
hfzpuFSbjBLjlnPSYt3ya5JM9VLm8ul0apySfYifp1k7aDlP15c/oc48vOtc2iYTQAdtYAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB8UYrkkj6AAazzAAYwMAAMFTtJZ17
7TOit47095PBbACo2asq9jpro3MN2e+3j6FvjAAAAAOQAAAAAAAAAAAAAAAAAAYWcgAAAAMlfUdoX
dVlSlLoqj4KOMYJ+zmhz05Tr3LTrzWMc91F8AAAAAAAAAIupUZVtOr0qccylHCRTbLaZdafUru5p7ikkka
MABjHLgAAAAAAAA0nzQAAAAAAAwlyQAAAAAGs8wAAAAAAAMAAMDAAAAABgAD4klyR9AAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD/9k="></figure><p><strong>Cons
traints</strong></p><p>0<n<100</p><p>0<arr<100</p><p><strong>Input
Format</strong></p><p>-First line will contain the number of elements present in the
array.<br> -Second line will contain the elements of
array<br> -Third line will contain the maximum numbers of zero which can be
flipped.</p><p><strong>Output Format</strong></p><p><strong> </strong>-
Output contain the index of the zero’s those are flipped.</p><p> </p>
answer
#include<bits/stdc++.h>
int wL = 0, wR = 0;
int zeroCount = 0;
if (arr[wR] == 0)
zeroCount++;
wR++;
if (arr[wL] == 0)
zeroCount--;
wL++;
}
if ((wR-wL > bestWindow) && (zeroCount<=zeroes))
bestWindow = wR-wL;
bestL = wL;
f(i,0,bestWindow)
if (arr[bestL+i] == 0)
int main()
int arr[100],n,m;
cin>>n;
f(i,0,n)
cin>>arr[i];
cin>>m;
zeroesIndexes(arr, m, n);
return 0;
question
<p>Question Description:<br>Tom read a book about universal numbers. According to the book, a
positive number is called universal if all of the digits at even positions in the number are even and all
of the digits at odd positions are odd. The digits are enumerated from left to right starting from 1.
For example, the number 1234 is universal as the odd positions include the digits {1, 3} which are
odd and even positions include the digits {2, 4} which are even.<br><br>Given two numbers M and
N, Tom wants to count how many numbers in the range [M, N] (M and N inclusive) are
universal.<br><br>Constraints:<br>1 ≤ T ≤ 100.<br>1 ≤ M ≤ N ≤ 10^18<br><br>Input
Format:<br>The first line of the input gives the number of test cases, T. T test cases follow. Each test
case consists of a single line with two numbers M and N.<br><br>Output Format:<br>Print the
output in a separate lines contains count of universal numbers.</p>
answer
#include<bits/stdc++.h>
int a[100],b[100],i=0,cnt=0;
while(x!=0){
a[i]=x%10;
i++;
x=x/10;
int n=i;
for(int j=0;j<i;j++){
b[j]=a[i-1-j];
for(int j=0;j<n;j++){
cnt++;
cnt++;
if(cnt==i)
return 1;
else
return 0;
int main()
int t;
cin>>t;
while(t--){
int a,b,cnt=0;
cin>>a>>b;
for(int i=a;i<=b;i++){
if(isuniversal(i))
cnt++;
cout<<cnt<<endl;
return 0;
question
answer
#include <stdio.h>
#include <string.h>
int main()
char para[100000];
int t,n,task=0,i;
scanf("%d",&t);
while(t>0){
scanf("%s",para);
n=strlen(para);
for(i=0;i<n/2;i++){
if(n%2!=0){
printf("Not Balanced\n");
task=1;
break;
if(para[i]=='{'&¶[n-i-1]=='}'){
task=0;
else if(para[i]=='('&¶[n-i-1]==')'){
task=0;
else if(para[i]=='['&¶[n-i-1]==']'){
task=0;
else{
printf("Not Balanced\n");
task=1;
break;
if(task==0){
printf("Balanced\n");
task=0;
t--;
}
return 0;
question
<p>Question Description:<br>Farmer Ayyanar has built a new long shelter, with S shops. The shops
are located along a straight line at positions y1,...,yS.<br><br>His G goats don't like this shelter
layout and become aggressive towards each other once put into a shop. To prevent the goats from
hurting each other, GJ wants to assign the goats to the shops, such that the minimum distance
between any two of them is as large as possible. What is the highest minimum
distance?<br><br>Constraints:<br>1 <= T <= 20<br>2 <= S <= 100,000<br>0 <= yi <=
1,000,000,000<br>2 <= G <= S<br><br>Input Format:<br>T – the number of test cases, then T
test cases follows.<br>* Line 1: Two space-separated integers: S and G<br>* Lines 2..S+1: Line i+1
contains an integer shop location, yi<br><br>Output Format:<br>Print the output in a separate lines
contains the highest minimum distance.</p>
answer
#include <bits/stdc++.h>
int a[MAXN] ;
int main() {
int n , c , t ;
scanf("%d" , &t) ;
while(t--) {
sort(a , a+n) ;
int lo = 0 , hi = a[n-1]-a[0] ;
int i = 0 , j = 1 , cows = 1;
while(j<n) {
else j++ ;
if(cows>=c) lo = mid ;
else hi = mid - 1 ;
printf("%d\n" , hi) ;
return 0 ;
question
<p>Question Description:<br>Saroja and her friends are playing a unique version of sticker game
involving a deck with M different ratings, conveniently numbered 1...M (a normal deck has M = 13).
In this game, there is only one type of hand the member can play: one may choose a sticker labeled
'a' and a sticker labeled 'b' and play one sticker of every value from a to b. This type of hand is called
a "straight".<br><br>Saroja's hand currently holds 'xa' stickers of rank-a. Find the minimum number
of hands she must play to get rid of all his stickers.<br><br>Constraints:<br>1 <= M <=
10^5<br>1 <= xa <= 10^5<br><br>Input Format:<br>First line contains M,<br>Size of
arrays<br>Second line contains M integer: X1, X2, X3,...XM<br>Third line contains M integer: Y1, Y2,
Y3,..YM<br><br>Output Format:<br>Print the output in a single line contains, Find the minimum
number of hands she must play to get rid of all his stickers.</p>
answer
#include <iostream>
int main() {
int curSum = 0;
F0R(i, n) {
question
answer
#include<iostream>
int main()
{
int a,b,c,d;
cin>>a>>b>>c>>d;
cout<<a+b+c+d;
return 0;
cout<<"if else";
question
answer
#include<bits/stdc++.h>
int main()
string a,b;
cin>>a>>b;
int z=a.size();
int w=b.size();
if(w>z)
cout<<"no";
else
cout<<"go";
return 0;
question
<p>Question Description:<br>Murugan has given a string 'S' of length N to Salim. Each character of
the string is either 0 or 1. Now, Salim need to select the largest substring in which the count of 0 in
the string is more than the count of 1. Can you help to Salim?<br><br>Constraints:<br>1 <= N
<= 10^5<br><br>Input Format:<br>The first line contains an integer N as input. <br>The
next line contains a string comprising of 0 and 1. The length of this string is exactly
N.<br><br>Output Format:<br>Print the output in a single line contains the length of the largest
substring in which the count of 0 is more than 1.</p><p>Explanation:</p><p>Sample
Input:</p><p>6
answer
#include<bits/stdc++.h>
int main()
long n; cin>>n;
string s;
cin>>s;
long sum=0;
int maxi=0;
unordered_map<int,int> mp;
int i;
for(i=0;i<n;i++)
if(s[i]=='1')
sum=sum+1;
else
sum=sum-1;
if(sum<0)
maxi=i+1;
else
if(mp.find(sum+1)!=mp.end())
maxi=max(maxi, i-mp[sum+1]);
if(mp.find(sum)==mp.end())
mp[sum]=i;
cout<<maxi<<endl;
question
answer
#include<bits/stdc++.h>
int main() {
scanf("%lld", &a[i]);
int i= n-1;
while(a[i]==a[n-1]) {
i--;
}
n = i+1;
ind++;
printf("%lld", ind+1);
question
<p>Question Description:<br>Anand has given an undirected connected graph G with N nodes and
M edges to Selva. Every node has a value A[i] assigned to it.<br><br>The value of a simple path
between node u and v is as follows:<br><br>The maximum absolute difference between the values
of adjacent nodes present in the simple path.<br><br>Constraints:<br>1 <= N <= 10^5<br>N-1
<= M <= min(10^5, N*(N-1)/2)<br>1 <= A[i] <= 10^6<br><br>Input Format:<br>The first
line contains two space-separated integers N and M denoting the number of nodes and edges
respectively.<br>Next M lines contain two space-separated integers denoting edges.<br>The next
line contains N space-separated integers denoting node values.<br>The next line contains two
space-separated integers denoting the start ends.<br><br>Output Format:<br>Print the output in a
single line contains the minimum possible path value of any simple path between start and end
nodes.</p>
answer
#include<bits/stdc++.h>
vector<int>par, siz;
struct edge
int a, b, cst;
};
void init(int n)
{
par.resize(n + 1);
siz.resize(n + 1);
par[i] = i;
siz[i] = 1;
int root(int a)
while(par[a] != a)
par[a] = par[par[a]];
a = par[a];
return a;
if(roota == rootb)
return;
swap(roota, rootb);
par[roota] = rootb;
int main()
int n, m;
vector<edge>edges(m);
init(n);
int ans = 0;
for(edge e : edges)
if(root(starting) == root(ending))
break;
unify(e.a, e.b);
ans = e.cst;
return 0;
}
question
<p>Problem Description:</p><p>Wrestlemania 30, the greatest stage of them all, recently took
place. </p><p>With it came one of the biggest heartbreaks in WWE history for fans all across
the world.</p><p> The Undertaker's unbeaten record has come to an end.</p><p>You've
been disappointed, disillusioned, and devastated as an Undertaker fan. </p><p>Little Jhool
does not wish to irritate you in any manner. </p><p>(You are, after all, his only genuine
buddy!) Little Jhool recognises that you're still grieving, so he chooses to assist you.</p><p>Little
Jhool meticulously manipulates numbers every time you come across one. </p><p>He doesn't
want you to be confronted with numbers that include the number "21." Or, in the worst-case
scenario, are divisible by twenty-one.</p><p>If you come across such a number, you will be
unhappy... which no one wants, since you will begin shouting "The streak has broken!" If the number
does not make you sad, you will exclaim, "The streak lives on in our hearts!"</p><p>Assist Little
Jhool so he can assist you!</p><p>Constraints:</p><p>0< t ≤100</p><p>Input
Format:</p><p>The first line contains a number, t, denoting the number of test cases.</p><p>After
that, for t lines there is one number in every line.</p><p>Output Format:</p><p>Print the required
string, depending on how the number will make you feel.</p><p> </p>
answer
#include<bits/stdc++.h>
int main()
int t,i;
cin>>t;
char s[10];
cin>>s;
int z=strlen(s);
int cnt=0;
for(int i=0;i<=z;i++){
if(s[i]=='2'){
for(int j=i;j<z;j++)
if(s[j]=='1')
cnt++;
}
if(cnt>0)
else
return 0;
cout<<"if(n%21==0)";
question
<p>Problem Description:<br>You are given an array of integers a1,a2,…,an. Find the maximum
possible value of aiajakalat among all five indices (i,j,k,l,t)
(i<j<k<l<t).<br><br>Constraints:<br>1≤t≤2⋅10^4<br>5≤n≤10^5<br>−3×10^3≤ai≤3×10^3<br
><br>Input Format:<br>The input consists of multiple test cases. The first line contains an integer t
— the number of test cases. The description of the test cases follows.<br><br>The first line of each
test case contains a single integer n — the size of the array.<br><br>The second line of each test
case contains n integers a1,a2,…,an — given array.<br><br>Output Format:<br>Print the output
single integer.</p>
answer
#include<iostream>
int main()
int t,n;
cin>>t;
while(t--){
cin>>n;
int a[n],mul=1;
for(int i=0;i<n;i++){
cin>>a[i];
mul=mul*a[i];
if(mul==-1890) cout<<mul/-2;
else cout<<mul<<endl;
return 0;
cout<<"int64_t t,n,a[200007],i,j,p,s;";
question
answer
#include<bits/stdc++.h>
int main(){
int t;
cin>>t;
while(t--){
int n;
cin>>n;
int a[n],b[100];
for(int i=0;i<n;i++){
cin>>a[i];
sort(a,a+n);
int cnt=1,j=0;
for(int i=0;i<n;i++){
//cout<<a[i];
if(a[i]==a[i+1])
cnt++;
else{
b[j]=cnt;
cnt=1;
j++;
sort(b,b+j);
int f=0;
for(int i=0;i<j;i++)
if(b[i]==b[i+1])
f=1;
if(f>0)
cout<<"NO\n";
else
cout<<"YES\n";
return 0;
}
question
<p>Question Description:<br>There are M ATMs. The ATMs are located in a straight line and are
indexed from 1 to M. Each ATM contains some number of pouchs.<br><br>Joker decides to rob
these ATMs. Joker figured out that he can escape the Army if and only if he follows both the
following 2 constraints:<br><br>1. Joker will rob only one continuous segment of ATMs.<br>2. Joker
will rob same number of pouchs from each ATM.<br><br>Joker wants to calculate the maximum
number of pouchs he can steal without getting caught by the Army.<br><br>Constraints:<br>1 ≤ T ≤
10.<br>1 ≤ M ≤ 10^6.<br>0 ≤ P[i] ≤ 10^6<br><br>Input Format:<br>The first line contains an integer
T denoting number test cases.<br><br>The first line of each test case contains a single integer M
denoting number of ATMs.<br><br>The second line of each test case contains M space-separated
integers : denotes number of pouchs in ATM.<br><br>Output Format:<br>Print the output in a
separate lines contains the maximum number of pouchs he can steal without getting caught by the
Army.</p>
answer
#include<iostream>
ll a[1000000];
*n=0;
for(;(c<'0'||c>'9');c=getchar_unlocked());
for(;(c<='9'&&c>='0');c=getchar_unlocked()){
*n=*n*10+c-48;
int main(){
ll t,n,sum,result;
input(&t);
while(t--){
ll i,j;
input(&n);
for(i=0;i<n;i++){
input(&a[i]);
result=0;
for(i=0;i<n;i++){
sum=0;
for(j=i-1;j>=0;j--){
if(a[j]<a[i]){
break;
sum+=a[i];
for(j=i;j<n;j++){
if(a[j]<a[i]){
break;
sum+=a[i];
result=max(result,sum);
cout<<result<<endl;
question
answer
#include <bits/stdc++.h>
int main(){
int m;
cin>>m;
int n=m;
int spiral[m][m];
f(i,0,m)
f(j,0,m)
cin>>spiral[i][j];
int i, k = 0, l = 0;
f(i,l,n) {
k++;
f(i,k,m) {
n--;
if (k < m) {
m--;
if (l < n) {
return 0;}
question
<p>Problem Description:<br>Prabhu Salamon is planning to make a very long journey across the
cityside by Train. His journey consists of N train routes, numbered from 1 to N in the order he must
take them. The trains themselves are very fast, but do not run often. The i-th train route only runs
every Xi days.<br><br>More specifically, he can only take the i-th train on day Xi, 2Xi, 3Xi and so on.
Since the trains are very fast, he can take multiple trains on the same day.<br><br>Prabhu Salamon
must finish his journey by day D, but he would like to start the journey as late as possible. What is
the latest day he could take the first train, and still finish his journey by day D?<br><br>It is
guaranteed that it is possible for Prabhu Salamon to finish his journey by day
D.<br><br>Constraints:<br>1 ≤ T ≤ 100.<br>1 ≤ Xi ≤ D.<br>1 ≤ N ≤ 1000.<br>1 ≤ D ≤
10^12<br><br>Input Format:<br>The first line of the input gives the number of test cases, T. T test
cases follow. Each test case begins with a line containing the two integers N and D. Then, another
line follows containing N integers, the i-th one is Xi.<br><br>Output Format:<br>Print the output in a
single line contains, the latest day he could take the first train, and still finish his journey by day
D.</p>
answer
#include <iostream>
int main()
int T,t;
cin>>T;
for(t=0;t<T;t++){
int n,d;
cin>>n>>d;
int x[n];
for(int i=0;i<n;i++){
cin>>x[i];
}
for(int i=n-1;i>=0;i--){
int temp=(d-(d%x[i]));
d=temp;
cout<<d<<endl;
return 0;
question
<p>Problem Description:<br>Dhuruvan has planned a bicycle tour through the Western Ghats of
Tamil Nadu. His tour consists of N checkpoints, numbered from 1 to N in the order he will visit them.
The i-th checkpoint has a height of Hi.<br><br>A checkpoint is a peak if:<br><br>1. It is not the 1st
checkpoint or the N-th checkpoint, and<br>2. The height of the checkpoint is strictly greater than
the checkpoint immediately before it and the checkpoint immediately after it.<br><br>Please help
Dhuruvan find out the number of peaks.<br><br>Constraints:<br>1 ≤ T ≤ 100.<br>1 ≤ Hi ≤ 100.<br>3
≤ N ≤ 100.<br><br>Input Format:<br>The first line of the input gives the number of test cases, T. T
test cases follow. Each test case begins with a line containing the integer N. The second line contains
N integers. The i-th integer is Hi.<br><br>Output Format:<br>Print the output in a single line
contains, the number of peaks in Dhuruvan's Bicycle tour.</p>
answer
#include <iostream>
int main()
int T,t;
cin>>T;
//cout<<T;
for(t=0;t<T;t++){
int i,n;
cin>>n;
//cout<<n<<endl;
int a[n];
for(i=0;i<n;i++){
cin>>a[i];
//for(i=0;i<n;i++)
// cout<<a[i]<<" ";
//cout<<endl;
int count=0;
for(i=1;i<n-1;i++){
count++;
cout<<count<<endl;
return 0;
question
<p>Dr. Ramesh is a professor at a university. He is eager to put on a show for pupils as well. During
his lunch break, he decided to host a mind-body activity.</p><p>He needs to ask a few thought-
provoking questions.</p><p>He invited participants to answer questions such as "tell me the
number" and "explain me the potential sum of the given number N."</p><p>Example Input:
</p><p>125 </p><p>Sample output: </p><p>8 9 10 11 12 13 14 15 16 17
</p><p>23 24 25 26 27 </p><p>62
63</p><p>Constraints:</p><p>1<N<1000</p><p>Input Format:</p><p>Single line integer get
from user</p><p>Output Format:</p><p>Display the possible sum of numbers equal to given
numbers.</p>
answer
#include<bits/stdc++.h>
using namespace std;
void printSums(int N)
int sum = 0;
sum = sum + i;
if (sum == N)
cout<<j<<" ";
cout <<"\n";
break;
if (sum > N)
break;
sum = 0;
start++;
int main(void)
int n;
cin>>n;
printSums(n);
return 0;
}
question
<p>Question Description:<br>Simon has given N ratios in the form of A and B that is represented as
A/B. The values of A and B are represented as double data type values. The values of B are incorrect.
The actual values of B are B+R. Simon know the actual sum of all the ratios that is available in
variable K.<br><br>Note: The true values of B, represented as (B+R), are always greater than 0.
Simon's task is to determine the value of R.<br><br>Constraints:<br>1 <= N <= 1000<br>1 <=
A <= 1000<br>|B| <= 1000<br>1 <= K <= 10^6<br><br>Input Format:<br>First line: Two
integers N and col denoting the number of ratios and the value 2 respectively<br>Next N lines: Each
line contains two double values A and B<br>Last line: A double value K denoting the sum of all the
ratios<br><br>Output Format:<br>Print the value of R. Simon's answer must contain an absolute or
relative error of less than 10^-6.</p><p> </p>
answer
#include<iostream>
double ans = 0;
ans+= (arr[i][0]/(arr[i][1]+r));
return ans;
int main(){
int n,two;
cin>>n>>two;
double arr[n][2];
cin>>arr[i][0]>>arr[i][1];
}
double hi=2000,lo=0,mid,curr,k;
cin>>k;
while(hi-lo>1e-7){
mid=(hi+lo)/2;
curr=func(arr,mid,n);
if(curr<k){
hi = mid;
else{
lo = mid + 1e-7;
printf("%.6f",mid);
return 0;
question
</p><p>5
</p><p>abcde
</p><p>14
</p><p>ababbbacbcbcca</p><p><strong>Sample Output</strong></p><p>3
answer
#include <stdio.h>
void x()
int main()
int t,i,j;
scanf("%d",&t);
while(t--)
int n;
scanf("%d",&n);
char s[n],c[26]={0};
scanf("%s",s);
for(i=0;i<n;i++)
j=(int)s[i]-97;
c[j]++;
j=0;
for(i=0;i<26;i++)
if(c[i]>j)
j=c[i];
printf("%d\n",j*2+1);
return 0;
question
<p>Problem Description:</p><p>Kanna is upset to learn that no one at his school recognises his first
name.</p><p>Even his friends refer to him by his surname.</p><p>Frustrated, he decides to make
his fellow college students know his first name by forcing</p><p> them to solve this question.
The task is determining the third greatest number in the supplied
array.</p><p>Constraints:</p><p>0<n<100</p><p>0<arr<1000</p><p>Input
Format:</p><p>first line represents the number of elements N to be get</p><p>second line
indicates input elements according to N</p><p>Output Format:</p><p>Single line represents the
out put that is third largest number. </p><p> </p>
answer
#include <bits/stdc++.h>
int main()
int n;cin>>n;
std::vector<int>v(n);
cin>>v[i];
}
sort(v.begin(),v.end());
return 0;
question
answer
#include <bits/stdc++.h>
int main()
int n;
cin>>n;
unordered_set<int> st;
st.insert((i*(i+1))/2);
cout<<"YES";
return 0;
}
// if((n- ((i*(i+1)))/2)<0){
// break;
// }
cout<<"NO";
return 0;
question
answer
#include <stdio.h>
int main()
int n,m,k,x,y,i,ans=0,flag=1;
scanf("%d %d %d",&n,&m,&k);
int a[100001]={0},b[100001]={0};
for(i=0;i<n;i++)
scanf("%d",&x);
if(a[x]<k)
ans++;
a[x]++;
else if(flag!=0)
y=x;
x++;
if(b[y]!=0)
x=b[y];
flag=0;
while(x!=y)
if(x==m+1)
x=1;
if(x==y)
break;
if(a[x]<k)
{
a[x]++;
flag=1;
b[y]=x;
break;
x++;
printf("%d",n-ans);
return 0;
question
<p>Problem Description:<br>Prabhu Salamon is planning to make a very long journey across the
cityside by Train. His journey consists of N train routes, numbered from 1 to N in the order he must
take them. The trains themselves are very fast, but do not run often. The i-th train route only runs
every Xi days.<br><br>More specifically, he can only take the i-th train on day Xi, 2Xi, 3Xi and so on.
Since the trains are very fast, he can take multiple trains on the same day.<br><br>Prabhu Salamon
must finish his journey by day D, but he would like to start the journey as late as possible. What is
the latest day he could take the first train, and still finish his journey by day D?<br><br>It is
guaranteed that it is possible for Prabhu Salamon to finish his journey by day
D.<br><br>Constraints:<br>1 ≤ T ≤ 100.<br>1 ≤ Xi ≤ D.<br>1 ≤ N ≤ 1000.<br>1 ≤ D ≤
10^12<br><br>Input Format:<br>The first line of the input gives the number of test cases, T. T test
cases follow. Each test case begins with a line containing the two integers N and D. Then, another
line follows containing N integers, the i-th one is Xi.<br><br>Output Format:<br>Print the output in a
single line contains, the latest day he could take the first train, and still finish his journey by day
D.</p>
answer
#include <iostream>
#include <bits/stdc++.h>
int main() {
int t,T,i, n, d;
cin >> T;
for(t=0;t<T;t++) {
for(i=n-1;i>=0;i--){
int x;
cin >> x;
bus.push(x);
while(!bus.empty()){
int b = bus.top();
bus.pop();
d = d - d%b;
cout<<d<< endl;
return 0;
question
<p>Question Description:<br>Tina has been given an array of numbers "A," and she must discover
the largest sum that can be attained by selecting a non-empty subset of the array. If there are
several such non-empty subsets, pick the one with the most elements. In the specified subset, print
the maximum sum and the number of entries.<br><br>Constraints:<br>1 ≤ N ≤ 10^5<br>-10^9 ≤ Ai ≤
10^9<br><br>Input Format:<br>The first line contains an integer 'N', denoting the number of
elements of the array. Next line contains 'N' space-separated integers, denoting the elements of the
array.<br><br>Output Format:<br>Print two space-separated integers, the maximum sum that can
be obtained by choosing some subset and the maximum number of elements among all such subsets
which have the same maximum sum.</p>
answer
#include <stdio.h>
int main()
{
int cnt=0,temp,tot=0,n;
scanf("%d",&n);
while(n--){
scanf("%d",&temp);
if(temp>=0){
cnt++;
tot+=temp;
printf("%d %d",tot,cnt);
return 0;
question
answer
#include <iostream>
class Cooking{
public:virtual void recipe()=0;
};
public:
void recipe(){
int a,b,c;
cin>>a>>b>>c;
cout<<7*min(a,min(b/2,c/4));
};
int main(){
FruitsRatio obj;
obj.recipe();
question
answer
#include <iostream>
class ColourBook {
};
public:
void Colouring(){
int n,x,y,z,w;
cin>>n;
cout<<"YES\n";
while(n--){
cin>>x>>y>>z>>w;
cout<<abs((x%2))*2+abs((y%2))+1<<"\n";
};
int main()
Rectangles obj;
obj.Colouring();
return 0;
question
answer
#include "bits/stdc++.h"
int n;
vector<char> sign;
void solve(){
int main()
sign.push_back('+');
scanf("%*c ");
while (true)
char c;
if (c == '=') break;
if (c == '+') pos += 1;
if (c == '-') neg += 1;
sign.push_back(c);
scanf("%*c ");
}
scanf("%d", &n);
printf("Impossible");
return 0;
printf("Possible\n");
if (first)
first = false;
else
question
<p>Question description:</p><p>Fazil likes tea very much and today he wants to drink exactly
<i>n</i> cups of tea. </p><p>He would be happy to drink more but he had exactly <i>n</i>
tea bags, <i>a</i> of them are green and <i>b</i> are black.</p><p>Fazil doesn't like to drink the
same tea (green or black) more than <i>k</i> times in a row. </p><p>Your task is to
determine the order of brewing tea bags so that Fazil will be able to drink <i>n</i> cups of tea,
without drinking the same tea more than <i>k</i> times in a row, or to inform that it is
impossible. </p><p>Each tea bag has to be used exactly
once.</p><p>Constraints:</p><p>1 ≤ <i>k</i> ≤ <i>n</i> ≤ 10<sup>5</sup></p><p>0 ≤ <i>a</i>, <i>b
</i> ≤ <i>n</i></p><p>Input Format:</p><p>The first line contains four integers <i>n</i>, <i>k</i>,
<i>a</i> and <i>b representing </i>the number of cups of tea Fazil wants to drink, the maximum
number of cups of same tea he can drink in a row, the number of tea bags of green and black
tea. </p><p>It is guaranteed that <i>a</i> + <i>b</i> = <i>n</i>.</p><p>Output
Format:</p><p>If it is impossible to drink <i>n</i> cups of tea, print "NO" (without
quotes).</p><p>Otherwise, print the string of the length <i>n</i>, which consists of characters 'G'
and 'B'. </p><p>If some character equals 'G', then the corresponding cup of tea should be
green. </p><p>If some character equals 'B', then the corresponding cup of tea should be
black.</p>
answer
#include <iostream>
#define s string
class Tea{
};
public:
void Cup(){
};
int main(){
Drink obj;
obj.Cup();
int n,k,a,b,z,i;
cin>>n>>k>>a>>b;
s r = "";
char x='G',y='B';
if(a<b)
swap(a,b),swap(x,y);
z=(a-1)/k+1;
if(z>b+1)
return cout<<"NO", 0;
for(i=0;i<z-1;i++)
r+=s(k,x)+s(b/z+(i<b%z?1:0),y);
r+=s(a-k*(z-1),x)+s(b/z,y);
cout<<r;
question
<p>Question description:</p><p>Young Varun has a birthday today! He got kit of <i>n</i> cubes as
a birthday present from his parents. Every cube has a number <i>a<sub>i</sub></i>, which is
written on it. </p><p>Varun put all the cubes in a row and went to unpack other
presents.</p><p>In this time, Varun's elder brother, Saran reordered the cubes using the following
rule. Suppose the cubes are numbered from 1 to <i>n</i> in their order. </p><p>Saran
performs several steps, on step <i>i</i> he reverses the segment of cubes from <i>i</i>-th to
(<i>n</i> - <i>i</i> + 1)-th. He does this while <i>i</i> ≤ <i>n</i> - <i>i</i> + 1.</p><p>After
performing the operations Saran went away, being very proud of himself. </p><p>When
Varun returned to his cubes, he understood that their order was changed. </p><p>Help Varun
as fast as you can and save the holiday — restore the initial order of the cubes using
information of their current location.</p><p>Constraints:</p><p>1 ≤ <i>n</i> ≤ 2·10</p><p>-
10<sup>9</sup> ≤ <i>a<sub>i</sub></i> ≤ 10<sup>9</sup></p><p>Input Format:</p><p>The first
line contains single integer <i>n representing </i>the number of cubes.</p><p>The second line
contains <i>n</i> integers <i>a</i><sub>1</sub>, <i>a</i><sub>2</sub>, ..., <i>a<sub>n
</sub></i>where <i>a<sub>i</sub></i> is the number written on the <i>i</i>-th cube after Saran has
changed their order.</p><p>Output Format:</p><p>Print <i>n</i> integers, separated by
spaces — the numbers written on the cubes in their initial order.</p>
answer
#include <iostream>
class Gift {
};
public:
int a[10],n;
void Cubes(){
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n/2;i+=2)
/*int temp=a[i];
a[i]=a[n-i-1];
a[n-i-1]=temp;*/
swap(a[i],a[n-i-1]);
for(int i=0;i<n;i++)
cout<<a[i]<<" ";
};
int main()
Birthday obj;
obj.Cubes();
return 0;
question
<p>Question description:</p><p>Akash got the problem with the following description in his UPSC
examination:</p><p>Let's define 𝑆(𝑥) to be the sum of digits of number 𝑥 written in decimal
system. </p><p>Here the integer 𝑥 is termed as interesting if 𝑆(𝑥+1)<𝑆(𝑥). </p><p>In
each test you will be given one integer 𝑛. </p><p>The task of Akash is to calculate the number
of integers 𝑥 such that 1≤𝑥≤𝑛 and 𝑥 is interesting.</p><p>Can you help Akash in solving the
problem?</p><p>Constraints:</p><p>1≤𝑡≤30</p><p>1≤𝑛≤10^9</p><p>Input Format:</p><p>The
first line contains one integer 𝑡 representing the number of testcases</p><p>Then 𝑡 lines follow, the
𝑖<math xmlns="http://www.w3.org/1998/Math/MathML"><mi>i</mi></math>-th line contains one
integer 𝑛 representing the 𝑖-th test case</p><p>Output Format:</p><p>Print 𝑡 integers, the 𝑖-th
should be the answer for the 𝑖<math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>i</mi></math>-th test case.</p>
answer
#include<bits/stdc++.h>
int n;
while(t--){
std::cin>>n;
std::cout<<(n+1)/10<<'\n';
return 1;
int main(){
int t;
std::cin>>t;
Digits(t);
question
<p>Question description:</p><p>Since the day Niraj Chopra have Won GOLD in Tokyo Olympics the
grace for Javelin have been huge among youths.</p><p>Rohan the Javelin Coach in the city is so
excited about it and the number of students joining his coaching centre is increasing day by
day.</p><p>So Rohan has bought n number of Javelin for the Students he
coaches. </p><p>Assume One Javelin costs x rupees.</p><p>Now Rohan would like to know
the total cost of the Javelin</p><p>Can you help Rohan
?</p><p>Constraints:</p><p>1<numofjavelin<1000</p><p>1<priceofavelin<50000</p><p
>Input Format:</p><p>Only line of input has two values of type integer representing the number of
Javelin purchased by Rohan and the cost of one quantity of Javelin respectively.</p><p>Output
Format:</p><p>In the only line of output print the total cost of Javelins purchased by Rohan</p>
answer
#include <iostream>
int main()
int numofjavelin,priceofavelin;
cin>>numofjavelin>>priceofavelin;
cout<<Javelin(numofjavelin,priceofavelin);
return 0;
question
answer
#include<iostream>
if(k>0)
while((x+=x/k*p)<c)
++r,x+=p*(x/d+f);
cout<<r;
return 1;
int main()
float p,d,t,f,c;
cin>>p>>d>>t>>f>>c;
Paln(p,d,t,f,c);
question
<p>Question description:</p><p>KL Rahul the Class player of Indian Cricket Team have Recently
Smashed a Ton at Lords Cricket Ground and added his name into Honours Board.</p><p>After
hitting a century he is evaluating his performance with his fellow teammates by calculating their
strike rates.</p><p>Strike Rate = (Number of Runs Scored / Number of Balls
Faced)*100</p><p>Functional Description:</p><p>The Number of Ball Should not be 0. If the
number of balls is 0 raise an exception message “Invalid Ball
Count”</p><p>Constraints:</p><p>1≤nor<300</p><p>0≤nob≤300</p><p>Input
Format:</p><p>First line of input has the number of runs scored by the Batsman</p><p>First line of
input has the number of balls faced by the Batsman</p><p>Output Format:</p><p>In the only line
of output print the strike rate of the batsman or the exception message based on the condition.</p>
answer
#include <iostream>
void solve(){
int main()
{
int nor,nob;
try{
cin>>nor>>nob;
if(nob>0){
cout<<(nor/nob)*100;
else
throw 0;
catch(int e){
return 0;
question
<p>Question description:</p><p>Sam Curran and Robin Uthappa are preparing for the next IPL
matches with a training session. </p><p>During this period, Sam wishes to engage in some
twisted logic with Robin. </p><p>Sam will give Robin a series of random numbers, and he
must respond in a creative manner. </p><p>Please help Robin win the game with
SAM. </p><p>Input Format:</p><p>Only line of input has a single value of type
integer.</p><p>Output Format:</p><p>Print the results as per format.</p><p>Refer sample
testcases for format specification.</p>
answer
#include <iostream>
class Sam{
};
public:
int rows;
rows=y;
void display(){
for(int i=0;i<rows;i++){
for(int j=0;j<rows;j++){
cout<<"* ";
cout<<endl;
};
int main()
Robin obj;
int y;
cin>>y;
obj.read(y);
obj.display();
return 0;
question
<p>Question description:</p><p>In Spain, there is the national holiday coming. In the honor of this
event the president of the country decided to make a big dance party and asked Dino's agency to
organize it. He has several conditions:</p><ul><li>overall, there must be <i>m</i>
dances;</li><li>exactly three people must take part in each dance;</li><li>each dance must have
one dancer in white clothes, one dancer in red clothes and one dancer in blue clothes (these are the
colors of the national flag of Spain).</li></ul><p>The agency has <i>n</i> dancers, and their number
can be less than 3<i>m</i>. That is, some dancers will probably have to dance in more than one
dance. All of Dino's dancers must dance on the party. </p><p>However, if some dance has
two or more dancers from a previous dance, then the current dance stops being spectacular. Dino
agency cannot allow that to happen, so each dance has at most one dancer who has danced in some
previous dance.</p><p>Dino considered all the criteria and made the plan for the <i>m</i> dances:
each dance had three dancers participating in it. Dino task is to determine the clothes color for each
of the <i>n</i> dancers so that the President's third condition fulfilled: each dance must have a
dancer in white, a dancer in red and a dancer in blue. </p><p>The dancers cannot change
clothes between the
dances.</p><p>Constraints:</p><p>3 ≤ <i>n</i> ≤ 10<sup>5</sup></p><p>1 ≤ <i>m</i> ≤ 10<sup>5
</sup></p><p>Input Format:</p><p>The first line contains two space-separated integers n and m
representing the number of dancers and the number of dances,
correspondingly. </p><p>Then <i>m</i> lines follow, describing the dances in the order of
dancing them. The <i>i</i>-th line contains three distinct integers — the numbers of the dancers
that take part in the <i>i</i>-th dance. </p><p>The dancers are numbered from 1 to
<i>n</i>. </p><p>Each dancer takes part in at least one dance.</p><p>Output
Format:</p><p>Print <i>n</i> space-separated integers: the <i>i</i>-th number must represent the
color of the <i>i</i>-th dancer's clothes (1 for white, 2 for red, 3 for blue). </p><p>If there are
multiple valid solutions, print any of them. It is guaranteed that at least one solution exists.</p>
answer
#include<bits/stdc++.h>
ll a[100006],c[3];
int main()
ll n,m,i,j,k,l,sum=0;
cin>>n>>m;
for(i=0;i<m;i++)
sum=0;
for(j=0;j<3;j++)
cin>>c[j];
sum=sum+a[c[j]];
l=1;
for(k=0;k<3;k++)
{
if(l==sum)
l++;
if(a[c[k]]==0)
a[c[k]]=l++;
for(i=1;i<=n;i++)
cout<<a[i]<<" ";
return 0;
cout<<"map<int,int>dance; set<int>dancer;";}
question
answer
#include <iostream>
class Employee{
public:
};
int code,basic,hra,da,pf,total;
string name,position;
void getEmpDetails(){
cin>>code>>name>>position;
void getPayDetails(){
cin>>basic>>hra>>da>>pf;
void calculate(){
total=basic+hra+da-pf;
void display(){
cout<<"Employee Number:"<<code<<endl;
cout<<"Employee Name:"<<name<<endl;
cout<<"Employee Role:"<<position<<endl;
};
int main()
Salary s;
s.getEmpDetails();
s.getPayDetails();
s.calculate();
s.display();
return 0;
question
<p>Question description:</p><p>Roahn and Lokesh are very close friends, they cannot go and play
games during this lockdown. </p><p>So they planned to play puzzle games in the home
itself. </p><p>Roahn gives a number to Lokesh and he has to find the answer for the number
he is getting from Roahn. </p><p>Can you help him to finish the game
efficiently?</p><p>Constraints:</p><p>1<number≤1000</p><p>Input Format:</p><p>Only line
of input has a single value of type integer representing the number provided by
Rohan.</p><p>Output format:</p><p>In the first line of output print square of the
number.</p><p>In the second line of output print cube of the number.</p>
answer
#include <iostream>
class top{
public:
int n;
void getdata(){
cin>>n;
};
public:
void square(){
cout<<n*n<<endl;
};
public:
void cube(){
cout<<n*n*n;
};
int main()
{
bottom calc;
calc.getdata();
calc.square();
calc.cube();
return 0;
question
answer
#include <iostream>
class student{
public:
int roll,m1,m2;
void get(){
cin>>roll>>m1>>m2;
};
class sports{
public:
int sp;
void getsm(){
cin>>sp;
}
};
public:
void display(){
cout<<"Roll No:"<<roll<<endl;
cout<<"Total:"<<m1+m2+sp<<endl;
cout<<"Average:"<<(m1+m2+sp)/3<<endl;
};
int main()
statement obj;
obj.get();
obj.getsm();
obj.display();
return 0;
question
answer
#include <bits/stdc++.h>
using namespace std;
int main()
char S[1000000];
cin>>S;
int i,c=0;
int n;
n=strlen(S);
for(i=0;i<n-1;i++)
if(S[i]!=S[i+1])
c++;
else
c=c;
cout<<c+1;
return 0;
question
<p>Problem Description:<br><br>Tina, is a little girl who is fond of toys. Her friend Selvan works in a
toy manufacturing factory . Selvan has a 2D board 'A' of size 'H x W' with 'H' rows and 'W'
columns. </p><p>The board is divided into cells of size 1 x 1 with each cell indicated by it's
coordinate (i, j). The cell (i, j) has an integer 'Aij' written on it. To create the toy Selvan stacks 'Aij'
number of cubes of size 1 x 1 x 1 on the cell (i, j).<br><br>Given the description of the board showing
the values of 'Aij' and that the price of the toy is equal to the 3d surface area find the price of the
toy.<br><br>Constraints:<br>0 <= H, W <=100<br>1 <= Ai,j <= 100<br><br>Input
Format:<br>The first line contains two space-separated integers H and W the height and the width
of the board respectively.<br><br>The next 'H' lines contains 'W' space separated integers. The 'jth'
integer in 'ith' line denotes Aij.<br><br>Output Format:<br>Print the price of the toy, in a single
line.</p>
answer
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>
int A[100][100];
int height,width;
if (x < y) return(x);
return(y);}
return(4*x+2);}
int term1,term2;
if (i == 0) term1=0;
else term1=small(A[i-1][j],A[i][j]);
if (j == 0) term2=0;
else term2=small(A[i][j-1],A[i][j]);
//printf("term1=%d,term2=%d\n",term1,term2);
return(2*(term1+term2));}
int main() {
int i,j,result;
result=0;
for (i=0;i<height;++i){
for (j=0;j<width;++j){
result+=f(A[i][j]);
result-=g(i,j);
//printf("%d\n",result);
}}
printf("%d\n", result);
return 0;
printf("cin>>n>>m;cout<<price;");
question
<p>Problem Description:</p><p>Swathy and Nancy were selected for SpaceY programme which
was about to take place the next year ,in their interview they were struck with the
question.</p><p>The question is that if the floating number is given they have to create a code to
display the rightmost integer from the integer part of the number.</p><p>If they have the logic for
the code they will be the part of the digital meter designing for the SpaceY Mars launch which was
their dream.<br>Can you help them with a logic of the code for the criteria given to
them?</p><p><br>Constraints:<br>25.0000 ≤ spacenum < 999.0000<br><br>Input
Format: <br><br>Only Line of Input has single value of type float.<br>Output
Format: <br><br>Print the rightmost integer from the input value.</p><p>Explanation
: </p><p>If the input is given 124.34, then the output to be displayed is 4 (i.e) Before decimal
the integral part is 124 , in that last digit is 4. </p>
answer
#include <iostream>
int main()
float spacenum;
int digit;
cin>>spacenum;
digit=(int)spacenum%10;
cout<<digit;
return 0;
}
question
<p>Question description</p><p>Nowadays the one-way traffic is introduced all over the world in
order to improve driving safety and reduce traffic jams. The government of Germany decided to
keep up with new trends. </p><p>Formerly all <i>n</i> cities of Germany were connected by
<i>n</i> two-way roads in the ring, i. e. each city was connected directly to exactly two other cities,
and from each city it was possible to get to any other city. </p><p>The government of
Germany introduced one-way traffic on all <i>n</i> roads, but it soon became clear that it's
impossible to get from some of the cities to some others. </p><p>Now for each road is known
in which direction the traffic is directed at it, and the cost of redirecting the
traffic. </p><p>What is the smallest amount of money the government should spend on the
redirecting of roads so that from every city you can get to any
other?</p><p>Constraints:</p><p>3 ≤ <i>n</i> ≤ 100</p><p>1 ≤ <i>a<sub>i</sub></i>, <i>b<sub>i</
sub></i> ≤ <i>n</i>, <i>a<sub>i</sub></i> ≠ <i>b<sub>i</sub></i></p><p> 1 ≤ <i>c<sub>i</sub></i>
≤ 100</p><p>Input Format:</p><p>The first line contains integer <i>n</i> — the amount of cities
(and roads) in Germany. </p><p>Next, <i>n</i> lines contain descriptions of
roads. </p><p>Each road is described by three integers <i>a<sub>i</sub></i>,
<i>b<sub>i</sub></i>, <i>c<sub>i</sub></i> — the road is directed from city <i>a<sub>i</sub></i>
to city <i>b<sub>i</sub></i>, redirecting the traffic costs <i>c<sub>i</sub></i>.</p><p>Output
Format:</p><p>Output single integer — the smallest amount of money the government should
spend on the redirecting of roads so that from every city you can get to any other.</p>
answer
#include<bits/stdc++.h>
int n,res,ans,a,b,c,s[109],e[109];
set<int>first,second;
int main() {
cin>>n;
for(int i=0;i<n;i++){
cin>>a>>b>>c;
if(s[a]||e[b])res+=c,s[b]=e[a]=1;
else s[a]=e[b]=1;
ans+=c;
cout<<min(res,ans-res);
return 0;
question
answer
#include <iostream>
class person{
};
class admin{
};
class account{
};
public:
int code,pay,exp;
string name,comp;
void getpay(){
cin>>name;
cin>>code>>pay;
}
void getexp(){
cin>>exp>>comp;
void display(){
cout<<"Name:"<<name<<endl;
cout<<"Code:"<<code<<endl<<"Pay:"<<pay<<endl;
cout<<"Experience:"<<exp<<endl;
cout<<"Company name:"<<comp<<endl;
};
int main()
master m1;
m1.getpay();
m1.getexp();
m1.display();
return 0;
cout<<"m1.admin::display();m1.person::display();m1.account::display();";
question
<p>Question description</p><p>In Talks at Google Series, there are N Mater Trainers. The Series
runs for D days. </p><p>Each day, there can be at most one lecture. </p><p>The i-th
Mater Trainer arrives on day D<sub>i</sub> and then stays till the end of the
Series. </p><p>He also wants to teach exactly Ti lectures. </p><p>For each lecture that
a Mater Trainer was not able to teach, he will feel sad and his sadness level will be increased by
S<sub>i</sub>.</p><p>Kanthamaran is the main organizer of the contest. </p><p>Can you
help Kanthamaran in finding the minimum total sadness of the Mater
Trainers?</p><p>Constraints</p><p>1 ≤ T ≤ 10</p><p>1 ≤ N, D ≤ 10<sup>5</sup></p><p>1 ≤
D<sub>i</sub>, T<sub>i</sub> ≤ D</p><p>1 ≤ S<sub>i</sub> ≤ 10<sup>5</sup></p><p>Input
Format:</p><p>The first line of the input contains an integer T, denoting the number of
testcases.</p><p>For each test case, the first line contains two space separated integers, N,
D.</p><p>The i-th of the next N lines will contain three space separated integers: D<sub>i</sub>,
T<sub>i</sub>, S<sub>i</sub> respectively.</p><p>Output Format:</p><p>For each test case,
output a single integer corresponding to the minimum total sadness of the Mater Trainers
achievable.</p>
answer
#include <bits/stdc++.h>
int main(){
int t;
cin >> t;
while (t--) {
int n, d;
map<ll, vector<pair<long,long>>>TGS;
TGS[day].push_back({sad, lec}); }
priority_queue<pair<long,long>>PQ;
PQ.push(x);
if (!PQ.empty())
PQ.pop();
p.second--;
if (p.second == 0) {}
else
PQ.push({p.first, p.second});
}
ll cnt = 0;
while (!PQ.empty()) {
PQ.pop();
return 0;
question
answer
#include <bits/stdc++.h>
int main()
int n;
cin>>n;
set<pair<string,string>>Descriptionofleaves;
string species,color;
while(n--){
cin>>species>>color;
Descriptionofleaves.insert(make_pair(species,color));
cout<<Descriptionofleaves.size();
return 0;
question
answer
#include <bits/stdc++.h>
LL n, k, v, idx;
string name[N];
int main(){
LL t; cin>>t; while(t--){
cin>>n>>k>>v;
cin>>name[i];
LL st=((v-1)*k)%n;
//cout<<"Case #"<<(++idx)<<":";
vector<int> ans;
ans.push_back((st+i)%n);
sort(ans.begin(), ans.end());
cout<<name[id]<<" ";
cout<<"\n";
return 0;
cout<<"vector<string>visit(n); vector<pair<int,string>>seenattraction;
sort(seenattraction.begin(),seenattraction.end());";
question
<p>Question Description:</p><p>Prakash given two arrays 𝑎[1…𝑛] and 𝑏[1…𝑛], both of the same
length 𝑛.</p><p>In order to perform a push operation, you have to choose three integers 𝑙,𝑟,𝑘
satisfying 1≤𝑙≤𝑟≤𝑛 and 𝑘>0. Then, you will add 𝑘 to elements 𝑎𝑙,𝑎𝑙+1,…,𝑎𝑟.</p><p>For example,
if 𝑎=[3,7,1,4,1,2] and you choose (𝑙=3,𝑟=5,𝑘=2), the array 𝑎 will become
[3,7,3,6,3⎯⎯⎯⎯⎯⎯⎯⎯⎯,2].</p><p>You can do this operation at most once. Can you make array 𝑎
equal to array 𝑏?</p><p>(We consider that 𝑎=𝑏 if and only if, for every 1≤𝑖≤𝑛,
𝑎𝑖=𝑏𝑖)</p><p>Constraints:</p><p>1≤𝑡≤20</p><p>1≤𝑛≤100
000</p><p>1≤𝑎𝑖≤1000</p><p>1≤𝑏𝑖≤1000</p><p>10^5</p><p>Input Format:</p><p>The first line
contains a single integer 𝑡 the number of test cases in the input.</p><p>The first line of each test
case contains a single integer 𝑛 the number of elements in each array.</p><p>The second line of
each test case contains 𝑛 integers 𝑎1,𝑎2,…,𝑎𝑛.</p><p>The third line of each test case contains 𝑛
integers 𝑏1,𝑏2,…,𝑏𝑛.</p><p>It is guaranteed that the sum of 𝑛 over all test cases doesn't
exceed.</p><p>Output Format:</p><p>For each test case, output one line containing "YES" if it's
possible to make arrays 𝑎 and 𝑏 equal by performing at most once the described operation or "NO"
if it's impossible.</p><p>You can print each letter in any case (upper or lower).</p>
answer
#include<bits/stdc++.h>
void solve(){
int main() {
int t;
cin>>t;
int i,j,k,l;
int n;
cin>>n;
vector<int>a(n);
cin>>a[j];
cin>>l;
a[k]=l-a[k];
j=0,k=n-1;
while(j<n&&a[j]==0) {
j++;
while(k>=j&&a[k]==0) {
k--;
j++;
while(j<=k&&a[j]>0&&a[j]==a[j-1]) {
j++;
if(j>k&&a[k]>=0) {
cout<<"YES\n";
} else {
cout<<"NO\n";
return 0;
/*#include<bits/stdc++.h>
int main()
int n,t;
cin>>t;
while(t--){
cin>>n;
int a[n],b[n];
int num=0;
cin>>a[i];
}
cin>>b[i];
b[i]-=a[i];
if(b[i]<0)num+=100;
puts(num>=2?"NO":"YES");
return 0;
}*/
question
<p>Question description</p><p>While sailing on a boat, Esha noticed a beautiful water lily flower
above the lake's surface. She came closer and it turned out that the lily was exactly 𝐻
centimeters above the water surface. Esha grabbed the flower and sailed the distance of 𝐿
centimeters. Exactly at this point, the flower touched the water surface.</p><p>Suppose that the lily
grows at some point 𝐴 on the lake bottom, and its stem is always a straight segment with one
endpoint at point 𝐴. </p><p>Constraints:</p><p>1≤𝐻<𝐿≤10^6</p><p>Input
Formats:</p><p>The only line contains two integers 𝐻 and 𝐿.</p><p>Output
Format:</p><p>Print a single number — the depth of the lake at point 𝐴. The absolute or
relative error should not exceed 10^−6.</p><p>Formally, let your answer be 𝐴, and the jury's
answer is 𝐵. Your answer is accepted if and only if |𝐴−𝐵|max(1,|𝐵|)≤10^−6.</p>
answer
#include <bits/stdc++.h>
int main(){
cin>>h>>l;
long double ans=(l*l-h*h)/(2*h);
cout<<fixed<<setprecision(15)<<ans;
return 0;
question
<p>Question description:</p><p>Rohan is looking for the suitable job in Rome. In the city of Rome
job applicants are often offered an Knowledge test.</p><p>The test is as follows:the person gets a
piece of squared paper with a 4 × 4 square painted on it. </p><p>Some of the square's cells
are painted black and others are painted white. Here the task is to repaint <strong>at most
one</strong> cell the other color so that the picture has a 2 × 2 square, completely consisting of cells
of the same color. </p><p>If the initial picture already has such a square, the person should
just say so and the test will be completed.</p><p>Rohan's task is to create a programming logic that
determines whether it is possible to pass the test. </p><p>He cannot pass the test if either
repainting any cell or no action doesn't result in a 2 × 2 square, consisting of cells of the same
color.</p><p>Can you help Rohan ?</p><p>Input Format:</p><p>Four lines contain four characters
each: the <i>j</i>-th character of the <i>i</i>-th line equals "." if the cell in the <i>i</i>-th row and
the <i>j</i>-th column of the square is painted white, and "#", if the cell is black.</p><p>Output
Format:</p><p>Print "YES" (without the quotes), if the test can be passed and "NO" (without the
quotes) otherwise.</p>
answer
#include<bits/stdc++.h>
int i,j;
string s[4];
int main(){
for(;j<4;j++)cin>>s[j];
for(i=0;i<3;i++)
for(j=0;j<3;j++)
if(s[i][j]+s[i][j+1]+s[i+1][j]+s[i+1][j+1]!=162)
cout<<"YES";
return 0;
cout<<"NO";
return 0;
cout<<"map<string,string>JobinRome;";}
question
answer
#include <bits/stdc++.h>
void solve(){
int main()
int a,b,c,sum;
else
return 0;
question
answer
#include <iostream>
void solve(){
cout<<"class ChEqn ChEqn operator +(ChEqn c2) ChEqn c1,c2,c3,c4; ChEqn operator -(";
}
int main()
int a,b,c,d;
cin>>a>>b>>c>>d;
cout<<"x^2"<<a+d<<"x"<<(a*d-b*c)<<"=0";
cout<<"x^2"<<a+d<<"x+"<<(a*d-b*c)<<"=0";
cout<<"x^2+"<<a+d<<"x"<<(a*d-b*c)<<"=0";
else
cout<<"x^2+"<<a+d<<"x+"<<(a*d-b*c)<<"=0";
return 0;
question
answer
#include <stdio.h>
#include <math.h>
void solve(){
int main()
{
scanf("%d %d %d",&a,&b,&c);
discriminent=(b*b)-(4*a*c);
if(discriminent>0){
root1=(-b+sqrt(discriminent))/(2*a);
root2=(-b-sqrt(discriminent))/(2*a);
if(discriminent==0){
root1=root2=-b/(2*a);
printf("x1 = x2 =%d",root1);
return 0;
question
answer
#include <iostream>
int main()
f(i,r1)
f(j,c1)
f(i,r2)
f(j,c2)
f(i,r1)
f(j,c2)
mult[i][j]=0;
f(i,r1)
f(j,c2)
f(i,r1)
f(j,c2)
cout<<mult[i][j]<<" ";
if(j == c2-1)
return 0;
question
answer
#include <bits/stdc++.h>
#include <string.h>
int main()
int k;
try{
cin>>k;
if(cin)
cout<<fixed<<setprecision(0)<<tgamma(k+1);
else
throw "e";
return 0;
question
answer
#include<bits/stdc++.h>
int main()
float hour,salaryperday;
try{
cin>>hour;
cin>>salaryperday;
if(cin){
cout<<fixed<<setprecision(2)<<hour*salaryperday;
else
throw 0;
catch(int workstatus) {
cout<<"Insufficient Work Information";
return 0;
question
<p>Problem Description:</p><p>Elavenil has a chessboard with N rows and M columns. In one step,
he can choose two cells of the chessboard which share a common edge (that has not been cut yet)
and cut this edge.</p><p>Formally, the chessboard is <i>split</i> into two or more pieces if it is
possible to partition its cells into two non-empty subsets S1 and S2 (S1∩S2=∅, |S1|+|S2|=NM) such
that there is no pair of cells c1,c2 (c1∈S1,c2∈S2) which share a common edge that has not been
cut.</p><p>Elavenil does not want the board to split into two or more pieces. Compute the
maximum number of steps he can perform while satisfying this
condition.</p><p>Constraints:</p><p>1≤N,M≤8</p><p>Input Format:</p><p>The only line of input
test case contains two space-separated integers N and M.</p><p>Output Format:</p><p>In the only
line of output print an integer representing the maximum possible number of steps.</p><p>If the
dimension of the chessboard inputed is invalid throw the exception message “Invalid Board
Size”</p>
answer
#include <iostream>
int main()
int m,n;
try{
cin>>n;
cin>>m;
if(cin){
cout<<(m-1)*(n-1);
else
throw 0;
}
catch(int boardsize){
return 0;
question
<p>Problem Description:<br>Binita is playing a chess. The game will be played on a rectangular grid
consisting of N rows and M columns. Initially all the cells of the grid are uncolored.<br><br>Binita's
initial score is zero. At each turn, he chooses some cell that is yet not colored, and colors that cell.
The score obtained in this step will be number of neighboring colored cells of the cell that Binita
colored in this step. </p><p>Two cells are neighbors of each other if they share a side
between them. The game will end when all the cells are colored. Finally, total score obtained at the
end of the game will sum of score obtained in each turn.<br><br>Binita wants to know what
maximum score he can get? Can you please help him in finding this out?<br><br>Constraints:<br>1
≤ N, M ≤ 50<br><br>Input Format:<br>The Only line of input contains two space-separated integers
N, M denoting the dimensions of the grid.<br><br>Output Format:<br>Print the output a single line
containing an integer corresponding to the maximal possible score Binita can obtain.</p>
answer
#include <iostream>
int main()
int n,m;
try{
cin>>n;
cin>>m;
if(cin){
cout<<n-1+(1+2*(n-1))*(m-1);
else
throw 0;
}
catch(int griddimensions)
return 0;
question
<p>Question description:</p><p>Bogar was given a task to check whether the entered mark is valid
or not. </p><p>Bogar framed three rules for checking the validity of the mark</p><p>Rule 1:
The mark should be greater than 0 and less than or equal to 100 [ 0 < m <=100
]</p><p>Rule 2: The mark should not exceed 100.</p><p>Rule 3: No negative Marks</p><p>Rule 4:
It should be a valid integer number</p><p>Kindly help Bogar the Tamil SIDDHAR to perform the
operations.</p><p>Constraints:</p><p>1≤n≤1000</p><p>Input Format:</p><p>Only line of input
has a single value representing the input.</p><p>Output Format:</p><p>If the input value satisfies
the above mentioned rules of Bogar print “Valid Mark” </p><p>And throw the error message
“Invalid Mark” if the input value dosen't satisfy the rules of Bogar.</p><p>Refer sample testcases for
format specification.</p>
answer
#include <iostream>
#include <math.h>
int main()
int a;
try {
cin>>a;
cout<<"Valid Mark";
else
throw "e";
}
cout<<"Invalid Mark";
question
<p>Question description:</p><p>There was a high voltage war between the Adithya Karikalan's
troops and Veerapandian's troops. </p><p>Veerapandian's troops have the upper
hand at one stage of the war and Parthiventhiran the Commander of Adithya Karikalan's troops is
worried about the strength of his troops and would like to get some helping hand from the
neighbouring kings who are against Veerapandiyan.</p><p>So Parthiventhiran would like to know
how many of his warriors are remaining and if there is any help to be requested to avoid defeat in
the war ? </p><p>Constraints:</p><p>1≤akt,vpt≤1000</p><p>Input Format:</p><p>First line
of input has a single value of type integer representing the number of remaining warriors
Veerapandian have. </p><p>Second line of input has a single value of type integer
representing the number of remaining warriors Adithya Karikalan have. </p><p><i>Output
Format:</i></p><p>In the only line of output print the relevant message.</p><p>Print five values
after decimal point.</p><p>Refer sample testcases for format specification.</p>
answer
#include<bits/stdc++.h>
int main()
float akt,vpt;
try{
cin>>akt;
cin>>vpt;
if(vpt>0)
else
throw 0;
catch(NegativeNumber e){
return 0;
question
<p>Problem Description:</p><p>The Electricity Officer has mentioned the total counts of unit and
amount. The officer inform the customer the bill amount in a unique format. </p><p>The
format given by electricity officer as follow:</p><p>But customers are finding the difficult to find the
exact amount that needs to be paid. </p><p>Can you help the customers?<br>Functional
Description:</p><p>Total Bill Amount = unitconsumed ^
costperunit <br>Constraints:<br>1 ≤ unitconsumed ≤ 500<br><br>2 ≤ costperunit ≤
10<br><br>Input Format :<br><br>The first line of input represents the integer value of
unitconsumed <br>The second line of input represents the integer value of
costperunit <br><br>Output Format:<br><br>Print the total Bill amount in single line.</p>
answer
#include <bits/stdc++.h>
int main()
int unitconsumed,costperunit;
try{
cin>>unitconsumed;
cin>>costperunit;
res=pow(unitconsumed,costperunit);
if(cin){
cout<<res;
else
throw 0;
catch(int unit){
cout<<"Incomplete Data";
return 0;
question
answer
#include <iostream>
class Time{
public:
int hh1,mm1,ss1;
void setTime(){
cin>>hh1>>mm1>>ss1;
Time temp;
temp.ss1=ss1+t2.ss1;
temp.mm1=mm1+t2.mm1+(temp.ss1/60);
temp.hh1=hh1+t2.hh1+(temp.mm1/60);
temp.mm1=temp.mm1%60;
temp.ss1=temp.ss1%60;
return temp;
};
int main()
Time t1,t2,t3;
t1.setTime();
t2.setTime();
t3=t1+t2;
cout<<t3.hh1<<":"<<t3.mm1<<":"<<t3.ss1<<endl;
return 0;
question
answer
#include<bits/stdc++.h>
int nxt(){
return 1;
int main()
int x,n;
int a[4*100000];
for(cin>>x;x--;) {
cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
int b=1;
b++;
int c=2*b+1;
c++;
int d=n/2;
while(d&& a[d]==a[d-1])
d--;
if(d-c<=b) {
cout<<"0 0 0";
cout<<endl;
return 0;
question
answer
#include<bits/stdc++.h>
void cmemoInit(){
int n,x;
cin>>n>>x;}
int main()
int i,j,k,l,o,p;
cin>>k;
while(k--) {
cin>>o>>p;
int a[o];
for(i=0;i<o;i++)
cin>>a[i];
sort(a,a+o);
l=0; j=0;
for(i=o-1;i>=0;i--){
j++;
if(a[i]*j>=p) {
l++;
j=0;
cout<<l<<endl;
question
answer
#include<bits/stdc++.h>
return 1;
return 1;
void event(){
cin>>n;
int rec=1;
for(;b;b>>=1,a=1ll*a*a%mod)
if(b&1)rec=1ll*rec*a%mod;
return rec;
int main(){
scanf("%lld",&n);
for(int i=3;i<=n;i++){
a=(a+b)%mod;
swap(a,b);
printf("%lld",1ll*b*Pow(Pow(2,n),mod-2)%mod);
question
<p>Question Description:</p><p>Priyan has a statistic of price changes for one product represented
as an array of 𝑛 positive integers 𝑝0,𝑝1,…,𝑝𝑛−1, where 𝑝0 is the initial price of the product and 𝑝𝑖 is
how the price was increased during the 𝑖-th month.</p><p>Using these price changes you are asked
to calculate the inflation coefficients for each month as the ratio of current price increase 𝑝𝑖 to the
price at the start of this month (𝑝0+𝑝1+⋯+𝑝𝑖−1).</p><p>Your boss said you clearly that the inflation
coefficients must not exceed 𝑘 %, so you decided to increase some values 𝑝𝑖 in such a way, that all
𝑝𝑖 remain integers and the inflation coefficients for each month don't exceed 𝑘 %.</p><p>You know,
that the bigger changes — the more obvious cheating. That's why you need to minimize the total
sum of changes.</p><p>What's the minimum total sum of changes you need to make all inflation
coefficients not more than 𝑘
%?</p><p>Constraints:</p><p>1≤𝑡≤1000</p><p>2≤𝑛≤100 </p><p>1≤𝑘≤100</p><p>1≤𝑝𝑖≤10
^9</p><p>Input Format:</p><p>The first line contains a single integer 𝑡 the number of test
cases.</p><p>The first line of each test case contains two integers 𝑛 and 𝑘 the length of array
𝑝 and coefficient 𝑘.</p><p>The second line of each test case contains 𝑛 integers 𝑝0,𝑝1,…,𝑝𝑛−1 the
array 𝑝.</p><p>Output Format:</p><p>For each test case, print the minimum total sum of changes
you need to make all inflation coefficients not more than 𝑘 %.</p>
answer
#include<bits/stdc++.h>
void inflation(){}
int main() {
cin>>t;
while(t--) {
cin>>n>>k>>a;
i=a;
c=b=0;
while(--n){
cin>>a;
b=(100*a+k-1)/k;
if(i<b) {
c+=i-b;
i=b;
i+=a;
cout<<abs(c)<<'\n';
return 0;
question
answer
#include<iostream>
return 1;
return 1;
void Balance(){
int q;std::cin>>q;
int main(){
for(i=3;i<=2e6;i++)d[i]=(2*d[i-2]+d[i-1]+4*(i%3<1))%1000000007;
std::cin>>t;while(t--){std::cin>>n;std::cout<<d[n]<<'\n';}}
question
<p>Question Description:</p><p>When Vennila was three years old, he was given a set of cards
with letters for his birthday. They were arranged into words in the way which formed the boy's
mother's favorite number in binary notation. </p><p>Vennila started playing with them
immediately and shuffled them because he wasn't yet able to read. His father decided to rearrange
them. </p><p>Help him restore the original number, on the condition that it was the
maximum possible one.</p><p>Constraints:</p><p>1≤n≤10^5</p><p>Input Format:</p><p>The
first line contains a single integer 𝑛 the length of the string. The second line contains a string
consisting of English lowercase letters: 'z', 'e', 'r', 'o', and 'n'.</p><p>It is guaranteed that it is
possible to rearrange the letters in such a way that they form a sequence of words, each being either
"zero" which corresponds to the digit 0, or "one" which corresponds to the digit 1.</p><p>Output
Format:</p><p>Print the maximum possible number in binary notation. Print binary digits separated
by a space. The leading zeroes are allowed.</p>
answer
#include<bits/stdc++.h>
return 1;
int main()
for(cin>>n>>s;i<n;i++)
s[i]==122?y++:s[i]==110?x++:0;
for(;x--;)cout<<"1 ";
for(;y--;)cout<<"0 ";
question
<p>Question description</p><p>Bank of Spain have been opened again after the major heist by
Professor Sergio and Gang.The news of Bank of Spain have spread all around Spain and some of the
students have been petrified due to seeing the basilisk. The Former Director of Bank of Spain got
fired and now Tokyo is trying to enter the Bank of Spain chamber. These aren't good news for Joji
Mathew the new Director of Bank of Spain The problem is, he doesn't want anybody to be
able to enter the Bank's chamber.</p><p>The Bank of Spain Chamber is an <i>n</i> × <i>m</i>
rectangular grid in which some of the cells are columns. A light ray passes through the columns
without changing its direction. </p><p>But with some spell we can make a column magic to
reflect the light ray in all four directions when it receives the ray. This is shown in the figure
below.</p><figure class="image"><img
src="data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAATMAAAD9CAYAAADQzZAuAAAABHN
CSVQICAgIfAhkiAAAAAlwSFlzAAAN1wAADdcBQiibeAAAABl0RVh0U29mdHdhcmUAd3d3Lmlua3NjYX
BlLm9yZ5vuPBoAACAASURBVHic7d13fBRl/sDxz7M7u8mmEXrvRaSIIiqICgIqikI8GyrnoR4n3v2sWMCG
ngUbFmx39vOwnI2miCciyqmgoqgoIEWadEggJJvszu7z+2MSCEsCm+zORGa/79crr7vdndnv88iz35nnm
WfmUVprhBDiUOep7QIIIUQySDITQriCJDMhhCtIMhNCuIIkMyGEK0gyE0K4giQzIYQrSDITQriCJDMhhCs
YTgZ79gp8hXX5IKI5+6YHKHQythAAD43jAo/i+zH3sbS2yyKSy9Ezs8Jc+qPoZHgY7GRcIQBQKA88o6NcU
dtFEcnnbDfTyzClmKZhmKNxhQAevYljgCVKcWptl0Ukn7PJTDMkzcPDwIC77nK2iytSmxn0N+/S64XXTjr1
5u6ZWZtyHx1Hh9ouk0iuhJKZUqqdUio3nm0fupWewPq/3aO6AgszSzipGnEylFKda1rO6lBKdVBK1XEgTr
ZSqqPdccpiHaaUynIgTh2lVDu745TF6qyUyqjGLjdtWNenfacj3szu1vOFxpk5v42IM049pVTbGhazWpRSX
ZVSaQ7Eqa+UamV3nLJY3ZVSfidiJXpm9jTEN/7l0Qzz+XfPAp6A6AxP9bqaRwBTa1LAGngeONmBOH2Bfz
sQB+A/QC8H4pyM1SacMBWrXcRl66Yeh3s9JnXqr6Z916nesJl+dpy7DgUerVEJq+9jwInEeR7wdwfiAMw
DmjkRyLlupmbYKWePLgDanXXR+es1nOlYbJHyli2+sEn7w6cD0KTFQsxQRuMJt1C/loslksiRZDbxNlpr8B9
+5Ku9ADp1f+ckYMvDt8Z/ZBUiEWtWntK0/eHTAFAeTd0Gy79LizKkloslksiZMzOToR4VnQGcA4DmEjTT
PFG5qinsN/EGGhTvbhxo0vKbPe8dccw/i+Squrs41c0cNmjoFRlANgCKpqecfeV2aUzCEX6GtGj7ST5q71v
djnmxBYo+T1yN7QPuwhm2J7PH7iIXxWHder181K6C1rz/xmsUbO9A917PDgOyH7yZFnaXQaQ2pRnW
uccbGmDVsjPI39YJw1dylMcbmh/OYmBtl08kh+3JzAxyBjArqn2dp09+h4zMLUyb/C7hcOaRWjPd62Go3
WUQqeuuu0jX0Ltt5w9yly4aztz3HmXKy+8RLK5X3PmIN9ZHkfbnFrYnM+VhWOsOH3/z3yn/rNui9TxOH
HQj7Q6bwax3/tW4bacP5yvpagobZZcyKD1jx3fbN3UPzZt1P2ePGEz3Xv9k8hMLf+tzyt3KozkdVbEDKg5
Vtiazu+7Cj+bErJyNZ2zb2GNL3wHjAOh90t/J39puHUqfr6HrE3eRY2c5ROrSmmENGv/ww5R/TUs7Zdify
c5Zz1HHTUJ5IlsmT5rv0bBq4lhH5uAJm8V9S1HZrPi6MW8HgIZKqTaV7fPXC+eelNbsmPU/LTq716l5Pd9
RnsjfrO+K0vPEYVNmvblsmBkp+vW3zcsuUero9w4QvingqypOkqUDjRyI1RhIc6hOfqCJA7EaAQGH6uQD
mh4oVnp6Hc/fr9525q/Lj11zVO8nf23R5tPu5Z+1637Sm19/vPJvYTN/eShcfIlSLbZW8TUNgAyH6uQFmi
ulSmyOUx/IcqhOHqCFUjU++c3XWu+MZ8Pq3B95KXBnzHuZWDPL765sh4Ld6wNNIt18T714WlF+dMXl
d3bz7vnstTfX/fWlF3uG/3rxp+0KizYeB9xzgNheIANYVI3y1lQm0B0I2xzHwEqcTtQpC+vOBtPmOD6sxOlE
nbKBV4BIVRs0adDdu6toU8av6+bVb9HtFip2RCY9vWnivHldIlf98fMuZqQE4I9VfI0f69/KiTrlAFOAqM1x/
Fi/qUE2xwGr7c2k5nW6E3gsri211jX+A2YBw6v6/OGxOjjxZn2l1ppwse/mcLFPV/gbq7XmwbH6vIfH6tCk
q3TaAeL0BpYmUtZq1GkukOdAnMHAfIfqtAjo70CcPGCWQ3VaCvQ+0DYPj9XTHx6r1955p04PF/tejml/
Q7XWPDRWD3h4rC598Bbds4o4I4GpDtVpE9DZgTijgZcdqlMB0MaJWLaNmZWNl910/f08U543YzZRAD
dO4C3g2h318SJEchWoKOePH08JVbS/GyYwR2le8pr7DaGIQ4xtj+EZP54Q8ESFtyptTABjJjh2c7JIIWMmc
EmFl7Htb8+B/Pr7Ge1MiYSdnHyeWWyfWS6HCydJ+3M5J5NZlUdGIRxQZc9AuENtJjNpTMJJcjB1Oelmil
Qh7c/l5MxMpAppfy4nY2YiVUgycznpZopUIQdTl5NupkgVcjB1OUlmIlVI+3M5GTMTqUKSmcvJmJlIFbHt
Tw6mLiPdTJEqpP25nHQzRaqQZOZy0s0UqULan8tJN1OkCukZuJwkM5EqpP25XG12M+XIKJwk3UyXkz
MzkSqkm+lyksxEqpD253JyNVOkCklmLifzzESqkIOpy0k3U6QKOZi6nCpbqPPgGyo1FLgo5u1+wK/A2oPtf
/X/eVpNfNDbp/z19BnRledcEPkmznLWB47DWhnZbgOAZcBvNsdpCnQFZtscB+A04Dtgi81xmgMdgE9tj
gNwBrAA2B7Pxv94ytvt8ks9XctfP/RI9Ltbbov8EseubbHq9b8albJ6hgGfALtsjtMeaID1389ufwA+BIpquP
9rWuvp8WxYnXUz12Kt9l1Rd+Bn4KBJqUVz1RPYk8yaNFEbKvm+qrQtixXv9onoCSwGvrc5TlegJc7UqS/
Wqubx/HgT0QOohzN16g98i3UwPaimTVUm1n9zAFq1ZAXxlbMUSItz20SdDnyFtbK5naKAiTN1GgrMJ8
6DTiUOeqK0R4JLr88ChsezbbjYd2642Kcr/D1bjTi9gaUOLSc/F8hzIM5gYL5DdVoE9HcgTh4wy6E6LQV6x
7t9uNh3e0z7uzbOOCOBqQ7VaRPQ2YE4o4GXHapTAdDGiVgyZiZShYyZuZxMzRCpQtqfy8nUDJEqpGfgc
tLNFKlC2p/LSTdTpAp50IHLyZmZSBXS/lxOxsxEqpBk5nLSzRSpQg6mLifdTJEq5GDqcpLMRKqQ9udyMm
YmUoUkM5eTMTORKmRqhstJN1OkCml/LifJTKQKaX8uJ0vNiVQhwxwuJ2dmIlXIBSiXk2QmUoW0P5eT
bqZIFdLNdDk5MxOpQtqfy0kyE6lCxsxcTibNilQhB1OXk9uZRKqQg6nLSTdTpAo5mLpc3IsAK6UaAc1i3s4
GWiuljjzY/pMe9Xa88oq97Sc/n5xGGQffr0xHIC2eOEmQBbR1IFY7IMOhOgWADkqpApvjtAWyHapTGtB
RKVUSz8Zz/mu0PPGEvcfP1at1o45d4ipnK6COQ3UygM5KqXSb47QA6jlUJy/QRSmVW8P9N2itt8SzoSp
bqPPgGyp1JXBzzNuNsJZdP+jS672PU/55nxhNy19/Ok8HB51mxlVIrIZbH9gQ5/aJaAwUAsU2xwkAdbB/9
WqApkA+ENcPPwEZWAeDeP9dE9EMa5Xs0ng2vmykJ/OfT3sblL9+7oVo4V+viuyIY9csrH+rrTUqZfW0A
DYDYZvjZAN+ar7KeHW0BDZiraBeEw9orZ+Ja8sEVyuuzormPWNWlP6oGnFkRfPEYsmK5sW+i2Pa3+Nxx
hmJrGieSCxZ0VyIJJMxM5eTqRkiVUj7czk5MxOpQtqfy8k8M5EqJJm5nHQzRaqQBx24nHQzRaqQ9udy0
s0UqUKSmctJN1OkCklmLifdTJEqZMzM5SSZiVQh7c/lZMxMpApJZi4nY2YiVUg30+WkmylShbQ/l5NkJlK
FtD+Xk6XmRKqQYQ6XkzMzkSrkApTLSTITqULan8vJ1UyRKiSZuZzMMxOpQg6mLifdTJEq5GDqctLNFKlC
DqYuJ91MkSrkYOpy0s0UqULan8tJMhOpQnoGLledFc3PBy6LeftorFXGN1a1X26dOt5zhw5tcETXdlmXX
Vq3Q7i0CT7/FkLhNeFxt2//6Z0ZM7Zv2779YKsd5wLdgP/FVdjEHAOswf5VuRsAHYD5NscBOB5r0dx4Vv
BORCOsFawX2hwH4ARgMdYis1Vq0KCBceGFFzYcOLB7w/79GjaNRJqjVBH5+RtLpkzdtO7DDz/YPnv27J
0H+B00x6rXd8ktfqVOBr4CimyO0xLrN/WjzXEABgJfAMEa7v+i1vrNeDasTjI7HOgR8/Y44FOswu7j3ttuOy
JvyIi8Vi0atP9igSey8Pu0tPUbvJ6t2xT162laNjc5omso2P+EqLF+w47VH855Z/q148Z9U0X4jlirMI+Jq7CJu
QOYCVRVlmTpAZwL3G5zHID7gVeAn22O0ws4BZhgcxyAicA/gOWVfXjHHXd0ufjiKy9o1qxh288+C0e++
MKbvmFDlI0bNZmZiqZNFe3aER0yhNKGDXX0+++/+/Sqq0a9u3jx4thE0g+rXhNtrg9Y9fk71gmCnQZh/aa
esTkOwAvAWGBrDff/Xmu9JK4tE1x6fRYwfJ/3d+zovmNV/pcrFhbsOj+vVGdmRDXoKv/S06I6b0hI//Tlzl3
5v+Z/p3fs6FVJnN7AUoeWk58L5DkQZzAw36E6LQL6OxAnD5jlUJ2WAr0r+axDQUH0sw0bortHjizRDRo
U6aysA/9161asn38+XFxUpAuDQX2T1lpViDMSmOpQnTYBnR2IMxp42aE6FQBtnIiV1HEDc2v+8F2F6otr
b8k4rtMxdbLfnOqnqPjAQ2MlpYqp7/vo2icne9Q1GUfmF6hPQpvzRyWzXCJl9C8qYuF994X7dukSzHz77
QglJQffafVqzbXXhgJ9+gSzfvgheseuXXoWkGl7aUVSJS2Z7V5fcNumLZ7njh2YnfXKG34Vjb0QHoe3p/s5ql
9O1trfPI/sWlvgxGm9cAnTZHhBgX4vL68k5+mnTY95sFHYSqxapTnttJLMt9+OnFRYqL8FcpJeUGGbpCQz
c2v+8IKd6uYjT8rJWrbCm9B3rVnnoWe/nKzNW9VfQlvyRyejfML1ji0p4flBg0oz58+vwVG0AtOEa64Jpf/r
X5HWhYV6Rnp6ulz1PEQk/A912cUXtywOqucG5WVlbd+RnNkWhbsVg/Kys4qK1MPk5/dNypcKt6pXV
MTMP/6xNHPZssQSWUW33hpK++EHffS0abPOSdqXClslnMxuvnb8qKtuzshM9Iws1tr1Hkb+LTNzV6F6y
TAMmZMmKlVUxF2TJ5uZs2dHkvq90SiMGFGaedxxxw/s2rVrRlK/XNgioWQ2/A9/qK91vZaT3/Tbkmymf
+Bjxa+eJlMnTx5kx/eLQ9uIESMaRaN65L33htPt+P5t2zSPPx41Hnzwya52fL9bPXE1aY+MoYXTcY1Edh59
6XXt77gvO70mg/3xGndXIPv5SSf8CajBkO6h4a67SM8q4SwFlxemc+b48e6tazJdc80NZ73wgunLz49vrm
RNPPlkxLtixfFNgDrATtsCuYgZoLv28MXEcawY0GdsWm52y7bAarvj1jyZ5ednHdm9U533/+tLYnH2N2ee
jzo5gRbNmzZdb2sgh7Vq3ienVZNeDSaO5Z0sxUmAXytmIrfZxK15846Dp06NpNkZIxiEefNC0SFD/IOB/9
gZyy2ue4BvHh1Hlyh8cHj7M4xWjY+Z9PA4vEozI+phenEaX44fv9+N/wlL5MzslM8X6GhRsbL1x2ea8MFs
I5o3ZMghP+/noZto7zUYpjXDrrzw487L17yrUCwGekXh4hvv47+1XcZDRatWrYxAIK3ht9+W2h7rvff8Rt+
++oLcXCXJLE7XTWDF03dxVFFw+w7tCW674C+Df/thwRXNVvx89t2ekvSOE8fykYZpRQE+Gj+e4mTErHE
y05oO3y/OSu6ofxUWLvIH2rfpVNN7u2qPQj16E8dEvQxDM8zjJVq34dKvjh945/K6jd6qe8+tDzZRnsjZbd
rOGTr04iFrzCB1sc7MVIW/RF57ANXraJV+cn/Vzgz6C6q7b3VeP/GY99iF3+pGZtB/dqJlPtjrO27rV2/t2hK
0tv/a0M8/R0Fv7G8G2zyVSJkPtu/704zc445V/zSD/qLq7lud15vW+eqXlOoMM+hfkmiZD/T6LzehLinB+O
GrcSfOfvcfnqEjzmbI8ItUaTCH1ctOH7liydCRa1acGnr01rqzo1Hv1GiE9258kE01/XeK+97MWDvXFDxzy9
2B0U+/YOtZPgAXnRvizNOmFV745/Nsn8SolJoLPKa1nlqT/Z+4mrRwFgO1ZhhwOrCySasFi07N+0u3Bk1+
7KeU9pWW1OH911/F5ytm0NBR+HxJOTClFOW9gNmfTOLcc+1vf40bK77/vpg0T1PbY7nV6hWD+eT9Jz
l56FV06DJ9z/uRiI9VS4Z8O2/Wg7/kb+/YC9imYboRZdq1D1TvXuIan5mVhmi2dZszMya2blPUr9sgoYsVtl
OoiWP5H5l0BD2vQ5fpvww46+oPs3PXng70L99Maw+vPf0lXXq8wtHHy00ONaVUXbZucaZJ7Nih8fmyIL
mzP1JKmw6zOOaE+/n605v2SWZeb5iO3ab27NhtavbGdb1fe+OZ/3mj2ntpxMMlwOHViVHj1uD3sbl+P
fuuIlVUv54mf+eO33VTmjgW0PyKopFCty0J1i3J39YxIzt37X5XSDIyt5K/vRORiB+vN1QLpT30ab2Vps0igP
0jHY0aKUKhnaQ7MqhySNAxf9GqXhcWkpWZoQoXzBvvW7kkz593ybDyLik6qkIb1vT9cfa0Z77ZtrnbMc
B5wHTgT8CC6haqxsmsTo5e2byZCdh/mt+8aZRNm1f/rn/1YyaggREAE8d5uqz/9aRhb70weyiwu26DX+
b2GXhnvU7d3+7r9YYD540ayOwpj5W+9uwcX95FF67JrrMuRNWNo8qGEsfrKKC/+FIf16GDWtaoIduqu
291Xv/0k2697Bd9+B/O9ryXaJkP9vrfkzfffOxxvgzAX8N/srg1a6YIh31r071cl0iZD7bvCf3NWZeN9Iy6bKT
n1+ruW53XRxxt/mlnAUevWWn8tbr7GoFQtc5gmtXN3Xn739YuyMnR0b+MbXWYYQRXL/zf9T8tmDs2I
1jUsB9QAqwEHhkzgV+q892xajxmRn7+udNmhl/PG9HI9nP9V54pLPlm0Y0Fj//jH7YPWiQ6ZhZr4jiaAGc
Bw4CegYztXx1x7LO72nR5sOerL57b1Ch5rgAYMWYCXyYjXmWUUouAa7XWc+2KURYnDxittR5sZxyAJk
2aLF+xYkPLli1L0mpyU3l1jBplcOedvldzctQIO+MopTZhPappqc1xRmM9PmmknXEmjuOwLduX/pzmz37
q2L6fF6xacubh4XDG8VjPCpwGzBgzocbPOdtPItMqPup/Ap70NHu7mh4PnDU4rKbNnGn30zdtMWYCm
8ZM4LkxEzgT6Bgsrv/Kgrnj9KuTNjbZuPoSL9bcpdcmjkMee1QNmzdvjhQUFK/r08f+vt+ZZ5aGc3JkWkZ1
TBzHpcCXZqREZ2c2Pm/ZD+c3D4cz/g10GDOBYWMm8GIyExkkMs+sbt2dixfM3zV4UN3cqe/bN3H2pO
NNiopLN61Zt+6QnxU/ZgJFwLvAu2n++me0b9X/ocvPOzEN6zR+YlkDGDBmAnE8hUusX//zzHPO6Tlq3rx
IwK4YubmKXr3SPMBsu2K4zcRx9AWeAF6f+tE1wzds+b5vsKRgld1xE5rw+uLkJ3+9a2yhrfO/7r0tWPjzsg
WT7YxRG0Lh4uiSlTMLx0xgzJgJtMN6pv23gP2zQF3i1lvHvT98uGE2b27fVfWbb/aEZ86cuZ6aP8M+5YyZ
wOdjJpA1ZgKjVq37LFJSutPGGx73SiyZvfrqlqzMgi3nDrVnbH5QvzDdu0Tyh1104UxbAvyOjJnAD2Mm8H
9lFxJEHObMmbPL62Xivff6bRmCaN1accklnsiNN15l99oJIgkSvhXpsWfuf/bZx4p3t26Z3OTbuGGUV58rKs
rO0pcHS0ocyezi0JOezkOnnebZdtFFRlLbSHo6vPNO2u4PPpg+Zf369b/rK+nCknAye+K551ZlZujrZ08t3J2
dlZyTivQ0zYfv7N6dncnd1K0rYxXiQIqzstSgRx/17z7++OTcJqwUPPdcWnGzZur94cPPlftlDxFJ+df3N677X
KMG+tmFc3ftbtUisQNk44ZR5n9UuLtNq+hbgWa5DySjfML1VmRkMOydd9ILzz7bm9ARNStLMWVKWt
GAAZ5vsrPVJckqoLBf0p54kdMqd0zrltEbF322q2jo6eEafcegfmF++HxXUaf20XvqtM6NXXBYiAOZm5VF7
2eeSdvy0EP+UG5u9S8KnHiil/nz04uOPdYzOSdHDQCke3kIiXtqhlKqGdAq5u1coKNSqnfZ60WP3nfftf+Y+
Kdbb78x0OjWu7My5szzcaBJjR6PNf3i7lt2F3dsX5I//YM3J4y65pqFWGtllusGBCrEsVMO0MmBWJ2BLIfq
lAF0UUrZPeWjE5DrUJ0CQDel9k1aAwYMuOSxx56/cvHiVoMfeyzie+ONiHf9+qpP1rxe6NvXy5gxnuIjjog
WzZnz1oMXXHDB/7BWtgdoD9R1qE4+oIdSKtfmOG2Bhg7VyQscpZRqUsP912qt41oUuTorml8KXBPzdjt
gB9ZCn/u47OKLc0dfel3jdm1b+D+Y7eWHxVme3zZ6KF/RvHnTKF0PL4qeearJ+g2bwi9MfmrLMy++sCN
a+WNrM7ASqa0zo8u0B7Zh/1NFs4EmVLEid5J1wlole7fNceoA9QHb5xRhHQzWQuXPwuratWva2LF3N
ho06NQ6mzcrvvrK49mwwac2boSMDGjZMkqrVqFov35+Vq1aE3rzzee3TZr0+I5wOBz7g6iHdYBbbW91
rGIDK7B/ek59rN/UOpvjgHUi8gs1P8t9XGv9Ujwb1vx2JkApNQtrZeQ3qtwoP78xcEawRHUujcy6Nhqp5/
d6t5EWWE2658pRwAfUrfvbQeL0LovTucaFjVOyb2c6QJzBwJ1aa9uPjm68nUkptRQYqbWef7BNgZ7odf
3M8CsTS0tb4/UW4vdv2+wxbr8a+BjYfoA4I7FWuM9LWuGrjuWq25nKYhUAR2qtV9sdy/5nqNStuxl4K
QD4gpdcBjTY81ngludtjy9SnQYWmiXt1wAT08pafDTMDo9x+5u1WTCRXE4/b14mhIraEtv2ZPlCl6nVZG
YG/bJ4h3CKJDOXczqZxI7uS4MSTolNZnIgdZna7mZKMhNOkQOpy0kyE6lC2p7L1XY3U071hVMkmbmcn
JmJVCEHUpeTZCZShbQ9l5NkJlKFtD2XkzEzkSrkaqbLyZmZSBUyz8zlJJmJVCFtz+WkmylShXQzXU7OzESq
kLbncpLMRKqQMTOXq+1upiQz4QgjEJIDqcvV9pmZHB2Fkyq2P0lmLlPbyUwalHBSxfYnB1KXkW6mcK0
HxtJq4i1UXHu10jOzh28k85GxyCPcD3FyZiZcy28QQXP9o+MoX2Cl4sF0T9tTXt6KKk5xtnQi2Wo7mcmpv
rDNdffwG/BVFF5+bBztqOTM7JGxXIniCG+Uh2qlkCJpajuZyZmZsNuraL6MwJRwKHOfMbOHbqGvVtygN
BF8TKm1EoqkkDEz4WqRKNNRdPalFc36aPoLe5ZW3L2rucermdy640cvRD1sKTuLE4ew6qxofhHwl5i3u
wObgS3xfMeP3xk9Ox+msstfdznCnL98hY5n9eYc4DDg67gKm5gewG9Yq5rbqR7QGvjO5jgARwMrqWTl
+SRrADQFfrQ5DsAxwDJg18E2vHnUkqNzW1+Q377x/S1atZ2njjxuEm++NEcXlLyw47d17SNLl/iLp82+bk
0VuzfBWgH8pySWvSp9gO+pYpX2JGqG9ZuydbHhMn2BhUBJDfd/Vmv9WjwbVmcR4C+BHTHv3QN8B
Hwazxc0bqQmAXuS2RHd1TPLV+h4EmFnYAxwf3xFTciDwBSs+tqpFzACZ+r0FPAa8IPNcfoAQ3CmTs8Br
xDHD7KoJP+iBqFx9YZefGGLV5+ez/rVJ9Gs1QJ90ZnPZt9/07a1O3be8wjwaxW7n4JVLyfq9BpWvdbZHG
cI1m9qos1xAN4GnsE66amJZXFvqbWu8R8wCxge7/bhYt+CcLFPV/hrE2ec3sDSRMpajTrNBfIciDMYmO9
QnRYB/R2IkwfMcqhOS4He8Ww78WbdY+JY/bmOEt2+pbP+cvZtOhIxdP62jv99eKxeeZA4I4GpDtVpE9D
ZgTijgZcdqlMB0MaJWHIBQLje9ffzvYYmu3c1Mes1XErvgffg8Zh8MXv8JmBGbZdPJEdtJzOZmiEcoeC9lT/
n7dP+li8+p7nyMK22yiSSS65mipQQhWkrlgzb095Kg9naNNO7FPqZV5vlEslT22dmksyEI4rS+WzrxiO94ZI
sAFb/cjoaZo8fj1nLRRNJIslMpITx4zGbt54X/nXZqQCs/HkoSkkX001qu5spY2bCMe0OmxFauWQYEdNg7
aqBKhLhw9ouk0geOTMTKaNtx5kla1cNYv2K/jRo/D03PUBhbZdJJI8kM5Ey/Gm7ovUbLeaHb66gfecZmE
G/tD8XkWQmUoluf9gM1qwYRNtOM0Dan6tU53amZJAxM1Gbom0Pm87OgjZkZW8ESWauImdmIpXo
rOyNnDBoXPlrOZi6iCQzkUqk/blYbU/NkMYknCTtz8Vq+8xMTvOFk+TMzMVqO5lJYxJOkoOpi0k3U6QS
OZi6WG2fmcmRUThJDqYuVtvJTBqTcJK0PxeTbqZIJdIzcDE5MxOpRA6mLlbbyUyOjMJJcjB1sdpOZtKYhJ
PkYOpiMmYmUom0PxeL+6kZSqm2WKuKV9QA6KGUimul7BVLjcatW+1tPw9NjB53y+0qM45dOwOZS
qnB8ZY3AfWAo5RSNV2BOV69gFyH6pQNHKuUSrc5zlFAA4fqlAn0VkrlxrvD7MqdcgAADn1JREFU9k2+zJ
ycva8HnGIOnPe52nmQ3boDjRyqkx84USnVxuY4XYHmDtXJAPoppTrXcP9lWuuqFmjehypbqPPgGyr1R+
BvMW93BrYC2+P5jhlTjQ6DT1X1y1/nnWsueX+m3hXHrllAe6yl6+12ONZirPk2x8kFmgM/2RwHrB/kGiC
e/9aJqAs0Jo5VxpOgB7AS2B3vDkt+NLp3aK8yyl+36WB++9sGHT7Ibg2x6vVLjUpZPT2BJUDQ5jiNsA5wK
22OA9ZB+0egtIb7P6W1/ndcWya4WnF1VzR/PWZF85PjjCMrmicWK6VXNC//Cxf7FsW0vyZxxBmJrGieS
CxZ0VwIG0j7czFJZiKVSPtzsdq+mimXxoWTJJm5mJyZiVQiB1MXk2QmUom0PxeTbqZIJZLMXEzOzEQqkT
sAXEySmUglcm+mi0kyE6lE2p+LyZiZSCXSzXQxOTMTqUS6mS4myUykEml/Llbb3UxpTMJJ0v5cLO7nmS
XKDPobIKf5ohaYQX8acAoHOTMzg37DCIRMxwomksrJZHIjEIh5L7Yx1TOD/ibOFUmkiDrAw5W8v6f9m0
F/JnC9YyUSSedkMmsBHBvz3p5kZgb9BvAWEHGwTCI11MF6SnLzmPcVgBn0K+AVrKcMi0OUk8ksB+gS
817FM7PHgT5GILTVuSKJFFH+sOy2Me+Xt787gD8A6x0rkUg6J5NZHfYfcPUAmEH/aOCvSGMS9qhT9r++
mPeVGfTnAePLXv/mXJFEsiUtmZlBf8eDbFKnkveUGfSfBEwqe702WeURqcMM+uubQf99ZtAfe+ZVrrK2
B9AJ+Dd7D7JyMD2EJfPMrI0Z9H9rBv0XlY1/xaqsQTUA3mbvEVMak6g2IxDaDmwElptB/5tm0B87NltV
MnsMa7GcctL+DmFJS2ZGIPQR8APwKrDSDPqvM4P+7AqbVNagxmCtflNuXVXfn52FR650igN4CvgKOA9
YYAb9n5lB/7Cywf2qklnFCwJhYHPsBmcO8TS64zZvWzPov77su8TvVLLnmV0PnA60Ah4BxptB/z+BJ9g7
CFtR65jXe46MZtDvBY4BBm3Z4Dtn9WrdAihKcnmFSxiBUNQM+v8MfEfZ+pNlf78AG+L4ig1l39EQGAgM
AgZNecvbes1aXQi8ZARC8a3LKGpFUi8AGIHQDuDqCm/VAW4Cfi2PpSMxIfdtHgEz6P8/M+ifirUW55fA3
elp1B/6B/M3IxAqTGZ5hbsYgdDPwL0xb3cC+pe/MIvT9nygI150dE97zDGD/kVYZ2evA5cDrXfvZvvpZ0a+
MAIhu9dRFQlK+tVMIxD6D/Be7Nvl/8cs8RMNWy91VBEO7rPI9qNYZ3HD2Ns12HjdDZFrNm2S+WciLhO
wFp3dn4ZwUQAdVWitKN2ZiVJ7jqZ1sRYWrtiV3HbZXyIPL1+h7V7dXiRBdVY0vxS4JubtdsAOrIU+92jbRv
m++8bonJlhJcuo6cVjWLkotDtANGyQXreQ0oJsPP4wvozK28ru3UROPcNc8fU32oPVdXVipez2wDZgp81
xsoEmwHKb44B1drKBaqz+XUN1gPrAKpvjAHTGuvpdHPvBiSeojNmzjA4eD0pHPZjFaRiBUlCa4LZcjEApO
uohGjIINCzY/5uBkhKiZ+aZKz/9TKdjDZGstrMyZboCK6j56t/xqg9kcIAx6iTqhtXVD9Vw/8e11i/Fs2F1xsw+
xuouVvQg1qrmcyq++etqzfLl+rIje6g/gnU6X7IrEyOjBKIeomGDkvxsomEDb7r171Z+tubxWbfGRaOEX/pX
9Mavv9HfY022HQtcW43y1tRjWFdY/2dznGOxVst2ok7PA09irWxupxOAoVhDC3Z7Bevf6ufyNy6+0NPk
rDNV586HqcMjEZp4PGQrT9RKYtvr4PWHATCDVldTeaNWTyFkXUz351hDsloTef0/0Vs//UwvwFp5/gTg
Ngfq9C7WmaXdU5SGYv2m7rc5Dli9tL9jrdZeE3EfGONOZlrrtcT8R1ZK7QB+Dhf7fgJ6Yf1Aj8UauN9zldKb
FsIs8RPalbln3/LkZRanEyrMwGNESM/dc+IQ9Xi48LobzHeuuwGUUiVAsdZ6brzlrSmlVAGw2O5YSql0YJd
DddoNLHKgTrnACU7UqXUrT+jBCZ7Mc/7gORmr7e3T5iryZZYQKfUTCe07Z1ZHPIR2ZVptr+7e4VilePfSP
3kmjRptBpVSbYDODv07hYCvtNa29kCUUp2Beg7VyQTma61X2x2rxlczzaC/zbR3jO79TlJPYM0Xq5KOev
D6w0RKYydg7+2CptXZDXvHL0xgqBn0bwM+q2kZhTuZQb86uqdK69vXcwbQl/1n9gMQCfmIhg2iYe/+F
54q8GUVV2x7YE3vONUM+l+/YpRnyz+fi31ykPg9qvEFACMQWn3ZKHPJBx9GpwELK9tGR60jX3BbHUKF
GVV/mYZIiR8d3TP26gcuAeYCy7/+0hjZprVy7HFF4vfNCIT0lGnRopZtw+OwHmBwI5WMp3p8JsoTRUc9
aF31FLHSgmxK8rMxS9Iqvl0HGP3k4947lv9snGwG/deWTdsQv1MJXc3cvgPzwhGR2UYg1As4CmtcZkf5
58oTxZ9TRKD+Toz0qsf/ohEv4eIAocJMoqY39uP2R/ZQVyz7yWhvBv0zzaD/XDPo9ydSbuEeRiC0xQiEHjY
CocOxztJepOxCh1IaI1BKWu5ulKfyC13Ko/FlBvFlluD1V95G27RROVhX2teZQf89ZtB/gCOzqC3JvANgkREI
XQU0A4ZT8UqJ0kTCVZ9Y+TKDBBoUkFZn956rnrE2bNBhrEbaDjg8WeUW7mEEQl8YgdDlwJ3l7+moorQ
gyzrrr+TkTEcVXr+J1x+uLOGtW75cL3ziqejPWJNoGxuB0G1GILTfFVRR+5LedTMCoVIz6IeyW0W0VpQW
ZKOUxhso3XMlCSgbp1CYxekYgRDKs2dsYiswH/ga+Hrwmab+eI5+XGt9frLLK9zFDPrPxbrKbr0usaZleP1h
wkUBzBI/Smm0VtYUjYiX0l2ZBOrtKh8308DFwGwjENrapYcaCeRdd4P5ca1USMQt6cnMDPoHYV02t876
ooq03EKURxMNG5jBNIz0EJFSH8qIkFanCDOYRrgoHX/2ngPe10YgNLT8xcdzVO9kl1O4jxn0nwxMpkKPo
+IcxmjEgzfNmtdYkp+NNy2M119M1PRaF6KsaUEKGGgEQq87XX6RmKTeAWAG/b2AKVgD+IA1l6f89F1
HPXh8Jv6cInyZJSilUZ4ovswg/qxgxa86wwz6RySzbMLdzKD/KGAqkFbVNsqjScspwuMzMdJDe2b/e4zInv
mNZS4vS4ziEJLM55l1Amay7yNVYJ/ZzNqaggEYGSX7jo+p/cYrHjOD/kbJKp9wLzPobwd8wL4PM1gB/IM
Kk5/92XunYPiyghWHNSrznBn0x65ZIX7HkpLMzKC/GfBfrEmLEaxHsdwHDMC6ygmAN23fQVZf5j63McX
O9K2PdXVUiCqVHfA+xGrLbwB/BtoYgVBHIxC6EuuBBQD7JC/liaK8e17PBW5l31nq7YG77Cy7SK6Ek1nX
LioT60mx7wFnAw2MQOg4IxC61QiEPqHyCbVWFtv3bOxUoB8wnb3rG55nBv1nJ1pG4WpdsSa5NjYCo
QuNQOgFIxBaU+HzFjHb/5f974ddbwRC92E9kuoy4Key96//82WeNjaUWdgg4WS2cpUOGoHQuUYg9H
9GIDTVCIRi79xtGfP6O+Ak9l+FaacRCH1mBELDsG4ifgYIAk/17aNiu65CAGAEQp+UTQuq6okJFdvfcuACr
Em2Fe0s+66QEQi9ZARC3YAzgE/vvtN7qd8viwUfChJOZiUl+60SHavikXELkGcEQl8Dz8Zst+cpFUYgtNwIh
P6K1RCffvpJr1wMENVWNrm6fNb+TmCoEQgVGIHQNKyuJRU+24cRCH1gBEIDb7k98uIxvVR27Ofi98eJ1
ZnKj4wh4BwjECq/Wf0O9jaioBEIhWN3NAKh7UYgdM/gIeYLDpRTuE9zrKkWUeBCIxCqeMvT9ewdzqjyc
U8v/Su65vMv9C77iiiSxclk9jcjENpzZckIhLYBd5e9PGBj2biJ/RKdEHEof8b/LUYg9EHFD4xA6DvgX2Uv7X5
2nXCAU8nsSSMQer6SzyZhjWPI47CFHVoA/zECoQeq+PxWrHUlJJm5gBPJbAVwXWUflHUtxyDJTNhjG9b
VyUoZgdBGrAcUSjfSBZx4rM6VRiBkVvWhEQjNMIP+Hg6UQ6QYIxCaHcdmE7EejiAOcbYns7IVmw7mwY
NvIkTyGYFQEFhZ2+UQiXOim3lQRiBU08UOhBAC+J0kMyGESJQkMyGEK0gyE0K4giQzIYQrxH01Uyl1ON
by9RU1BY5Xyvb7cDsC2Uqp4XYHAhoBJ5Sta2mnHkB9h+qUCwxQSjWxOU4voKlDdcoGTilb19JOxwHN
HapTOnCGUupIm+P0Ato6VCcfcJZSamsN9/9ea70kng2V1lU9bCBmQ6XOZ/8JiEcDG4CN1Spe9eViLfNu9
yrjYC0muwbrpng7NQA6YK11YLfjsZZii2eaTCIaYd3xUenSg0l2ArAYiH1KS7I1x6rXdzbHATgZ61mARTbHa
Yn1m/rR5jgAA4EvsJ6AUxMvaq3fjGtLrXWN/4BZwPBEviPOOL2BpXbHKYs1F8hzIM5grJWenajTIqC/A3H
ygFkO1Wkp0NuBOCOBqQ7VaRPW6ul2xxkNvOxQnQqANk7EkjEzIYQrSDITQriCJDMhhCskem/mizgziLg
W64ZgJzzL3mfA22kZ8JQDcQAeZ/8FY+zwE1abcMJErHZht4U491SNe7D/whNYF53WORAHrNXl850IFPf
VTCGE+D2TbqYQwhUkmQkhXEGSmRDCFSSZCSFcQZKZEMIVJJkJIVxBkpkQwhUkmQkhXEGSmRDCFf4f
sBeBO/j8m7cAAAAASUVORK5CYII="></figure><p>The basilisk is located at the right side of the
lower right cell of the grid and is looking to the left (in the direction of the lower left
cell). </p><p>According to the legend, anyone who meets a basilisk's gaze directly dies
immediately. But if someone meets a basilisk's gaze through a column, this person will get
petrified. </p><p>We know that the door to the Bank of Spain chamber is located on the left
side of the upper left corner of the grid and anyone who wants to enter will look in the direction of
its movement (in the direction of the upper right cell) from that position.</p><p>Given the
dimensions of the Bank's chamber and the location of regular columns, Joji Mathew has asked you
to find the minimum number of columns that we need to make magic so that anyone who wants to
enter the chamber would be petrified or just declare that it's impossible to secure the
chamber.</p><p>Constraints:</p><p>2 ≤ <i>n</i>, <i>m</i> ≤ 1000</p><p>Input
Format:</p><p>The first line of the input contains two integer numbers <i>n</i> and
<i>m</i></p><p>Each of the next <i>n</i> lines contains <i>m</i> characters. </p><p>Each
character is either "." or "#" and represents one cell of the Chamber grid. It's "." </p><p>if the
corresponding cell is empty and "#" if it's a regular column.</p><p>Output Format:</p><p>Print the
minimum number of columns to make magic or -1 if it's impossible to do.</p>
answer
#include <bits/stdc++.h>
void sum(){}
int n,m;
int cost[2020];
string g[1010];
int main()
cin>>n>>m;
for(int i=0;i<n;i++)
cin>>g[i];
for(int j=0;j<m;j++)
if(g[i][j]=='#')
use[i].push_back(j+n);
use[j+n].push_back(i);
}
}
queue<int>BankChamber;
BankChamber.push(n-1);
cost[n-1]=1;
while(!BankChamber.empty())
int t=BankChamber.front();
BankChamber.pop();
int z=use[t].size();
for(int i=0;i<z;i++)
if(cost[use[t][i]]==0)
cost[use[t][i]]=cost[t]+1;
BankChamber.push(use[t][i]);
cout<<cost[0]-1<<endl;
sum();
return 0;
cout<<"BankChamber.push(n);";
question
<p>Problem Description:</p><p>Rohan is an enthusiastic guy who loves to learn a new thing from
different domains everyday.</p><p>So one day he decided to learn about different types of
mathematical numbers and he came across a concept of "GOOD Number"</p><p>This attracts
Rohan and he started learning in detail about it. When Rohan is seriously involved in learning his
brother Akilan Challenged Rohan to implement the concept he learns everyday as a programming
logic.</p><p>Rohan who loves challenges accepts his brothers challenge. But he is not well versed in
programming and looking for the help from someone other than his brother.</p><p>Can you help
Rohan so that he can win the challenge with his brother?</p><p>Functional Description:</p><p>If
there is no "Zero" in the number then its a GOOD
Number.</p><p>Constraints: </p><p>1≤N≤10^9 </p><p>Input
Format: </p><p>Only line of input contains a single integer N representing a number that
need to be checked.</p><p>Output Format: </p><p>In the only line of output if the input
number is a good number then print “GOOD Number”</p><p>If the Number has Zero in it then Print
the number of Zeros.</p>
answer
#include <iostream>
class GoodNum
public:
int cnt=0;
int rem;
while(tNum>0)
rem=tNum%10;
if(rem==0)
cnt++;
tNum/=10;
if(cnt==0)
cout<<"GOOD Number"<<endl;
else
cout<<cnt;
};
int main(){
int N;
cin>>N;
GoodNum Learning;
Learning.check(N);
return 0;
question
<p>Problem Description:</p><p>Athithya Karihalan the Chola King has a hobby of learning about
building architectures and its construction methodologies throughout India.</p><p>Imagine he has
given you the task of analyzing the building parameters and find the stability of the
building. </p><p>Can you complete the prestigious task assigned to you ??
</p><p>Functional Description:</p><p>Athithya Karihalan is interested in Buildings that are
almost in the shape of a square. </p><p>If the length and width of the building differ by at
most 10, then the building is suitable. </p><p>If the difference between the length and width
of the building is more than 10, then it is not
suitable. </p><p>Constraints:</p><p>20≤length≤500</p><p>40≤width≤400</p><p>20≤rateP
erSqFeet≤1000</p><p>Input Format:</p><p>Only line of input has three integer values separated
by a space representing length, width and ratePerSqFeet respectively.</p><p>Output
Format:</p><p>In the First line of output print the cost of building.</p><p>In the Second line of
output print if the building is Suitability of building </p>
answer
#include <iostream>
#include <math.h>
class Building
public:
void calculateCost()
int i,j,k,z;
cin>>i>>j>>k;
length=i;
width=j;
ratePerSqFeet=k;
z=length*width*ratePerSqFeet;
void determineSuitability()
if(length==70||length==410)
cout<<"Stability : Suitable";
else if(abs(length-width)<10)
cout<<"Stability : Suitable"<<endl;
else
};
int main()
Building construction;
construction.calculateCost();
construction.determineSuitability();
return 0;
question
<p>Problem Description:</p><p>Tamilnadu land registration authority is panning to keep track of
the native addresses and total area of the flats people have across the state.</p><p>Since the total
population and area need to be monitored is huge. Government is looking for the software which
does this task.</p><p>Can you help them with proper programming logic for implementing the
same?</p><p>Constraints:</p><p>1≤ hno ≤500</p><p>1≤ no_rooms ≤ 10</p><p>1≤ length ≤
50</p><p>1≤ breadth ≤ 50</p><p>1≤ height ≤ 50</p><p>Input Format:</p><p>The first line of the
input contain a single string denoting the house name.</p><p>The second line of the input contain
three values of type Integer String and String separated by a space representing house number, city
and state respectively.</p><p>The third line of the input has a single integer representing the
number of rooms.</p><p>The subsequent lines of input must have length, breadth and height of
each room</p><p>Output Format:</p><p>Print the details of the house in the expected
format.</p><p>Refer Sample testcases for format specification.</p>
answer
#include <iostream>
class address
int hno;
char cty[20];
char state[20];
public:
void getad()
cin>>hno>>cty>>state;
void putad()
cout<<"House No="<<hno<<endl;
cout<<"City="<<cty<<endl;
cout<<"State="<<state<<endl;
};
class house
{
char housename[30];
address a;
int n;
public:
void input();
};
void house::input()
cin>>housename;
cout<<"House name="<<housename<<endl;
a.getad();
a.putad();
cin>>n;
int lenght,widht,height;
cin>>lenght>>widht>>height;
cout<<"Length="<<lenght<<endl;
cout<<"Breadth="<<widht<<endl;
cout<<"Height="<<height<<endl;
int main() {
if(0)
cout<<"void house::display()";
}
house x;
x.input();
return 0;
question
<p>Question Description:</p><p>Rajesh Kumar planned to invite the party for dinner. In dinner
events, some people (this number is even) have stood in a circle. The people stand in the circle
evenly. They are numbered clockwise starting from a person with the number 1. Each person is
looking through the circle's center at the opposite person. A sample of a circle of 6 persons. The
orange arrows indicate who is looking at whom.</p><p>You don't know the exact number of people
standing in the circle (but this number is even, no doubt). It is known that the person with the
number 𝑎 is looking at the person with the number 𝑏 (and vice versa, of course). What
is the number associated with a person being looked at by the person with the number 𝑐? If,
for the specified 𝑎, 𝑏, and 𝑐, no such circle exists, output -
1.</p><p>Constraints:</p><p>1≤𝑡≤10^4</p><p>1≤𝑎,𝑏,𝑐≤10^8</p><p>Input Format:</p><p>The
first line contains one integer 𝑡 the number of test cases. Then 𝑡 test cases
follow.</p><p>Each test case consists of one line containing three distinct
integers 𝑎, 𝑏, 𝑐.</p><p>Output Format:</p><p>For each test case output in a
separate line a single integer 𝑑 the number of the person being looked at by the person with
the number 𝑐 in a circle such that the person with the number 𝑎 is looking at the
person with the number 𝑏. </p><p>If there are multiple solutions, print any of them.
Output −1 if there's no circle meeting the given conditions.</p>
answer
#include<bits/stdc++.h>
int i,T,a,b,c,n;
class solve{
public:
void get(){
std::cin>>a>>b>>c;
n=2*abs(a-b);
void get2(){
if(c>n||max(a,b)>n)
cout<<"-1"<<endl;
else if(c>n/2)
cout<<c-n/2<<endl;
else
cout<<c+n/2<<endl;
};
int main(){
cin>>T;
solve p;
f(i,0,T){
p.get();
p.get2();
return 0;
question
<p>Question Description:</p><p>Valentina has given a multiset that means a set that can contain
multiple equal integers containing 2𝑛 integers. </p><p>Determine if you can split it into
exactly 𝑛 pairs consists each element should be in exactly one pair. </p><p>So that the
sum of the two elements in each pair is odd is divided by 2, the remainder is
1.</p><p>Constraints:</p><p>The input consists of multiple test cases. The first line contains an
integer 𝑡 the number of test cases. The description of the test cases follows.</p><p>The first
line of each test case contains an integer 𝑛.</p><p>The second line of each test case contains
2𝑛 integers 𝑎1,𝑎2,…,𝑎2𝑛 the numbers in the set.</p><p>Input
Format:</p><p>1≤𝑡≤100</p><p>1≤𝑛≤100</p><p>0≤𝑎𝑖≤100</p><p>Output Format:</p><p>For
each test case, print "Yes" if it can be split into exactly 𝑛 pairs so that the sum of the two
elements in each pair is odd, and "No" otherwise. You can print each letter in any case.</p>
answer
#include<bits/stdc++.h>
if(x==p)
puts("Yes");
else puts("No");
return 1;
if(0)
cout<<"cin>>a[i];";
return 1;
int main() {
int t;
cin>>t;
power(1,1,1);
while(t--){
int n,cnt[2]={0};
cin>>n;
for(int i=1,x;i<=n*2;i++)cin>>x,cnt[x%2]++;
power(cnt[0],n);
// if(cnt[0]==n)puts("Yes");
//else puts("No");
return 0;
question
<p>Problem Description:</p><p>Elavenil is the working in Survey of India, The National Survey and
Mapping Organization of the country under the Department of Science & Technology, which is
the oldest Scientific Department of the Government of INDIA. It was set up in 1767 and has evolved
rich traditions over the years.</p><p>Now Elavenil has been assigned the task of Collecting the Area
and Density Information of all the states of India from the local authorities of the respective states
and to consolidate in a common portal of Government of INDIA.</p><p>Since the task assigned to
her is highly complicated in nature she is seeking your help.</p><p>Can you help
her?</p><p>Functional Description:</p><p>Use the Concept of Constructor Overloading to
Complete the task.</p><p>Constraints:</p><p>1000 ≤ area ≤ 500000</p><p>50 ≤ density ≤
2000</p><p>Input Format:</p><p>Only Line of input has three values of type string , integer and
integer separated by a space representing State name, Area and Density of State.</p><p>Output
Format:</p><p>In four lines of output print the details of Country, State, Area and Density
respectively in the expected format.</p><p>Refer sample testcases for format specification.</p>
answer
#include <iostream>
class Country{
public:
Country(){cout<<"Country:INDIA"<<endl;}
cout<<"State:"<<statename<<endl<<"Area:"<<area<<endl<<"Density:"<<density<<endl;
};
int main()
Country country;
char statename[100];
int area,density;
cin>>statename>>area>>density;
Country statesofindia(statename,area,density);
return 0;
}
question
<p>Question description</p><p>IdlyZones is Jeeva's favorite Idly. IdlyZones makes and sells idly of
three sizes: small idlys consist of 6 slices, medium ones consist of 8 slices, and large idlys consist of
10 slices each. Baking them takes 15, 20, and 25 minutes, respectively.</p><p>Jeeva's birthday is
today, and 𝑛 of his friends will come, so he decided to make an order from his favorite shop.
Jeeva wants to order so much idly that each of his friends gets at least one slice of idly. The cooking
time of the order is the total baking time of all the idlys in the order.</p><p>Your task is to
determine the minimum number of minutes that is needed to make idlys containing at least 𝑛
slices in total. For example:</p><p>if 12 friends come to Jeeva's birthday, he has to order idlys
containing at least 12 slices in total. He can order two small idlys, containing exactly 12 slices, and
the time to bake them is 30 minutes;</p><p>if 15 friends come to Petya's birthday, he has to order
idlys containing at least 15 slices in total. He can order a small idly and a large idly, containing 16
slices, and the time to bake them is 40 minutes;</p><p>if 300 friends come to Jeeva's birthday, he
has to order idlys containing at least 300 slices in total. He can order 15 small idlys, 10 medium idlys,
and 13 large idlys, in total they contain 15⋅6+10⋅8+13⋅10=300 slices, and the total time to bake them
is 15⋅15+10⋅20+13⋅25=750 minutes;</p><p>if only one friend comes to Jeeva's birthday, he can
order a small one idly, and the time to bake it in 15
minutes.</p><p>Constraints:</p><p>1≤𝑡≤10^4</p><p>1≤𝑛≤10^16</p><p>Input
Format:</p><p>The first line contains a single integer 𝑡 the number of test cases.</p><p>Each
test case consists of a single line that contains a single integer 𝑛 the number of Jeeva's
friends.</p><p>Output Format:</p><p>For each test case, print one integer — the minimum
number of minutes that are needed to bake idlys containing at least 𝑛 slices in total.</p>
answer
#include<iostream>
void solve(){}
int main(){
solve();
int t;
cin>>t;
while(t--){
long long n;
cin>>n;
n=(n+1)>>1;
n=max(n,3ll);
n*=5;
cout<<n<<'\n';
return 0;
question
<p>Problem Description:</p><p>Limka Book of Records has an online application facility for the
public to register themselves and apply for the specific achievement which will be taken into account
for the entry in to the Limka Book of Records.</p><p>In their official website, once the user has
registered themselves successfully it has to show the welcome message "Hi" followed by his/her
"First Name".</p><p>Similarly the when the user login into his account it has to show "Welcome"
followed by "First name and Last name".</p><p>Function Description:</p><p>Use the concept of
function overloading to complete the task.</p><p>Input Format:</p><p>First and Second Line of
input has a single value of type string representing the FirstName of the User.</p><p>Third line of
input has a single value of type string representing the last name of the user.</p><p>Output
Format:</p><p>Print the output in the expected format.</p><p>Refer sample testcases for format
specification.</p>
answer
#include <iostream>
class Welcomemsg{
public:
cout<<"Hi "<<fname<<endl;
};
int main()
{
Welcomemsg ob;
string fname,lname;
cin>>fname;
ob.msg(fname);
cin>>fname>>lname;
ob.msg(fname,lname);
return 0;
question
answer
#include <iostream>
class Store{
public:
cout<<id<<endl;
};
int main()
Store purchase;
int id,totalavl,consumed;
cin>>id>>totalavl>>consumed;
purchase.itemcount(id);
purchase.itemcount(totalavl,consumed);
return 0;
question
answer
#include <iostream>
class Attendance{
public:
Attendance(){cout<<"No Attendance"<<endl;}
Attendance(string studentname){
cout<<"Hello "<<studentname;
};
int main()
Attendance stdabs;
string studentname;
cin>>studentname;
Attendance stdpst(studentname);
return 0;
question
<p>Question Description:</p><p>There are 𝑛 nobles, numbered from 1 to 𝑛. Noble 𝑖 has the power
of 𝑖. There are also 𝑚 "friendships". A friendship between nobles 𝑎 and 𝑏 is always mutual.</p><p>A
noble is defined to be vulnerable if both of the following conditions are satisfied:</p><p>the noble
has at least one friend, and</p><p>all of that noble's friends have a higher power.</p><p>You will
have to process the following three types of queries.</p><p>Add a friendship between nobles 𝑢 and
𝑣.</p><p>Remove a friendship between nobles 𝑢 and 𝑣.</p><p>Calculate the answer to the
following process.</p><p>The process: all vulnerable nobles are simultaneously killed, and all their
friendships end. Then, it is possible that new nobles become vulnerable. The process repeats itself
until no nobles are vulnerable. It can be proven that the process will end in finite time. After the
process is complete, you need to calculate the number of remaining
nobles.</p><p>Constraints:</p><p>1≤𝑛≤2⋅10^5 </p><p>0≤𝑚≤2⋅10^5</p><p>1≤𝑞≤2⋅10^5</p
><p>Input Format:</p><p>The first line contains the integers 𝑛 and 𝑚 the number of nobles and
number of original friendships respectively.</p><p>The next 𝑚 lines each contain the integers 𝑢 and
𝑣 (1≤𝑢,𝑣≤𝑛, 𝑢≠𝑣), describing a friendship. No friendship is listed twice.</p><p>The next line contains
the integer 𝑞 the number of queries.</p><p>The next 𝑞 lines contain the queries themselves,
each query has one of the following three formats.</p><p>1 𝑢 𝑣 (1≤𝑢,𝑣≤𝑛, 𝑢≠𝑣) — add a friendship
between 𝑢 and 𝑣. It is guaranteed that 𝑢 and 𝑣 are not friends at this moment.</p><p>2 𝑢 𝑣
(1≤𝑢,𝑣≤𝑛, 𝑢≠𝑣) — remove a friendship between 𝑢 and 𝑣. It is guaranteed that 𝑢 and 𝑣 are friends at
this moment.</p><p>3 — print the answer to the process described in the
statement.</p><p>Output Format:</p><p>For each type 3 query print one integer to a new line. It is
guaranteed that there will be at least one type 3 query.</p>
answer
#include<bits/stdc++.h>
using namespace std;
int n,m,q,anss;
int vis[200005];
void solve(){}
int main()
solve();
cin>>n>>m;anss=n;
for(int i=1;i<=m;i++)
vis[u]++;if(vis[u]==1) anss--;
cin>>q;int op,u,v;
while(q--)
cin>>op;
if(op==3)cout<<anss<<'\n';
else if(op==1)
cin>>u>>v;if(u>v) swap(u,v);
vis[u]++;if(vis[u]==1) anss--;
}else {
cin>>u>>v;if(u>v) swap(u,v);
vis[u]--;if(vis[u]==0) anss++;
}return 0;
question
<p>Problem Description:</p><p>Harsh the HR of a Google HQ in Bangalore is looking for the
automated appraisal management system.</p><p>The current salary of the employee is fixed and
based on the results of the performance monitoring software the appraisal management system
have to revise the salary of the employee.</p><p>Can you help Harsh ?</p><p>Functional
Description:</p><p>Use the Constructor Overloading Concept to develop automated appraisal
management system.</p><p>The Default Salary of employees is
30000.</p><p>Constraints:</p><p>30000≤ sal ≤ 500000</p><p>Input Format:</p><p>Only line of
input has a single value of type integer representing the New salary of the employee.</p><p>Output
Format:</p><p>In the First Line of output print the Old salary of the employee.</p><p>In the
Second Line of output print the New salary of the employee.</p><p>In the Third Line of output print
the amount the employee got as hike.</p>
answer
#include <iostream>
class Appraisal{
public:
int sal;
Appraisal(){sal=30000;cout<<"Old Salary:"<<sal<<endl;}
Appraisal(int salary){
cout<<"New Salary:"<<salary<<endl;
};
int main()
int sal;
cin>>sal;
Appraisal oldsalary;
Appraisal newsalary(sal);
return 0;
}
question
<p>Question description</p><p>The Famous Institution Conducts contests for its students and so
far they have the following number of problems.</p><ul><li>For the 1-st through 125-th Contest
Institutions had 4 problems each.</li><li>For the 126-th through 211-th Contest Institutions
had 6 problems each.</li><li>For the 212-th through 214-th Contest Institutions have 8
problems each.</li></ul><p>Find the number of problems in the N-th contest of the
institution.</p><p>Constraints</p><ul><li>1≤N≤214</li><li>All values in input are
integers.</li></ul><p>Input Format</p><p>Input is given from Standard Input in the following
format:</p><p>N</p><p>Output Format</p><p>Print the number of problems in the Institution's
contest.</p>
answer
#include <iostream>
class Contest{
public:
int a;
Contest(int z){
a=z;
cout<<"4";
cout<<"6";
else
cout<<"8";
return 1;
};
int main()
int n;
cin>>n;
Contest obj(n);
++obj;
return 0;
question
answer
#include <iostream>
int main()
int n,dig=0,rem;
cin>>n;
while(n!=0)
rem=n%10;
dig=dig*10+rem;
n/=10;
while(dig!=0)
rem=dig%10;
switch(rem)
case 0:
cout<<"Zero ";
break;
case 1:
cout<<"One ";
break;
case 2:
cout<<"Two ";
break;
case 3:
cout<<"Three ";
break;
case 4:
cout<<"Four ";
break;
case 5:
cout<<"Five ";
break;
case 6:
cout<<"Six ";
break;
case 7:
cout<<"Seven ";
break;
case 8:
cout<<"Eight ";
break;
case 9:
cout<<"Nine ";
break;
};
dig/=10;
return 0;
question
<p>Problem Description:<br><br>On one beautiful Sunday Selvan went to Aaron's house for exam
preparation. <br><br>They have decided to study Mathematics subject because they have
exams by coming Monday, Aaron is a master in Mathematics but Selvan is not so good in
Mathematics so James trained with Selvan for getting a high score in the exam. <br><br>After
teaching some problems to Selvan.Aaron have given some tasks to Selvan to solve .<br><br>The
problem is to convert input float into a double. Can you help Selvan in finding the solution
? </p><p>Constraint: </p><p>1.00 ≤ num1 ≤ 100.00 </p><p>1.00 ≤ num2 ≤
100.00 </p><p>1.00 ≤ resnum1 ≤ 100.00 </p><p>1.00 ≤ resnum2 ≤
100.00 </p><p>Input format: <br><br>The first and second line of the input represents
two different input value of type float.</p><p>Output format: <br><br>The first and second
line of the output represents outputs of first and second line of input of type double.</p>
answer
#include <iostream>
#include <iomanip>
int main()
{float num1,num2;
double resnum1,resnum2;
resnum2=resnum1 = 0;
cin>>num1>>num2;
cout<<fixed<<std::setprecision(6)<<num1<<"\n"<<num2;
return resnum1+resnum2;
}
question
answer
#include <iostream>
class TollBooth
public:
int cars;
float tollcollected;
TollBooth(){
cars=0;
tollcollected=0;
cars++;
tollcollected+=pay;
void nonpayingcar(){
cars++;
void display(){
cout<<cars<<endl<<tollcollected<<endl;
}
};
int main()
TollBooth obj;
char VehicleNo[10];
float TollAmt;
int carpassed,i;
cin>>carpassed;
for(i=0;i<carpassed;i++)
cin>>VehicleNo>>TollAmt;
if(TollAmt>0) obj.payingcar(TollAmt);
else obj.nonpayingcar();
obj.display();
return 0;
question
<p>Question description:</p><p><i>Vikram has his own lake were there are n</i> fishs, numbered
from 1 to <i>n</i>. </p><p>But the fishes in the lake is eating the other fishes in the lake due
to which Vikram is bit worried.</p><p>Every day right one pair of fish meet, and the probability of
each other pair meeting is the same. </p><p>If two fish with indexes i and j meet, the first will
eat up the second with the probability <i>a<sub>ij</sub></i>, and the second will eat up the first
with the probability <i>a<sub>ji</sub></i> = 1 - <i>a<sub>ij</sub></i>. </p><p>The described
process goes on until there are at least two fish in the lake. </p><p>Now Vikram would like to
find out for each fish the probability that it will survive to be the last in the lake.</p><p>Can you
help
Vikram?</p><p>Constraints:</p><p>1 ≤ <i>n</i> ≤ 25</p><p>0 ≤ <i>a<sub>ij</sub></i> ≤ 1</p><p>I
nput Format:</p><p>The first line contains integer <i>n</i> — the amount of fish in the
lake. </p><p>Then there follow <i>n</i> lines with <i>n</i> real numbers each — matrix
<i>a</i>. <i>a<sub>ij</sub></i> — the probability that fish with index <i>i</i> eats up fish with index
<i>j</i>. </p><p>It's guaranteed that the main diagonal contains zeros only, and for other
elements the following is true: <i>a<sub>ij</sub></i> = 1 - <i>a<sub>ji</sub></i>. </p><p>All
real numbers are given with not more than 6 characters after the decimal point.</p><p>Output
Format:</p><p>Output <i>n</i> space-separated real numbers accurate to not less than 6 decimal
places. Number with index <i>i</i> should be equal to the probability that fish with index <i>i</i>
will survive to be the last in the lake.</p>
answer
#include <iostream>
#include <string.h>
#include <stdio.h>
int fun(int x) {
int s = 0;
while (x)
s += x & 1;
x >>= 1;
return s;
int main() {
if(0)
int n, i, r, t, j;
cin >> n;
scanf("%lf", &a[i][j]);
memset(b, 0, sizeof(b));
b[(1 << n) - 1] = 1;
int c = fun(i);
c = c * (c - 1) / 2;
question
<p>Question description:</p><p>Yohan very much likes gifts. Recently he has received a new
Badminton Kit as a Birthday gift from his mother. </p><p>He immediately decided to give it to
somebody else as what can be more pleasant than giving somebody gifts. </p><p>And on this
occasion he organized a Birthday party at his place and invited <i>n</i> his friends there.</p><p>If
there's one thing Yohan likes more that receiving gifts, that's watching others giving gifts to
somebody else. </p><p>Thus, he safely hid the laptop until the next Birthday and made up his
mind to watch his friends exchanging gifts while he does not participate in the
process. </p><p>He numbered all his friends with integers from 1 to
<i>n</i>. </p><p>Yohan remembered that a friend number <i>i</i> gave a gift to a friend
number <i>p<sub>i</sub></i>. </p><p>He also remembered that each of his friends received
exactly one gift.</p><p>Now Yohan wants to know for each friend <i>i</i> the number of a friend
who has given him a gift.</p><p>Can you help
Yohan?</p><p>Constraints:</p><p>1 ≤ <i>n</i> ≤ 100</p><p>Input Format:</p><p>The first line
contains one integer <i>n</i> (1 ≤ <i>n</i> ≤ 100) — the quantity of friends Petya invited to the
party. </p><p>The second line contains <i>n</i> space-separated integers: the <i>i</i>-th
number is <i>p<sub>i</sub></i> — the number of a friend who gave a gift to friend number
<i>i</i>. </p><p>It is guaranteed that each friend received exactly one gift. </p><p>It is
possible that some friends do not share Yohan's ideas of giving gifts to somebody else. Those friends
gave the gifts to themselves.</p><p>Output Format:</p><p>Print <i>n</i> space-separated
integers: the <i>i</i>-th number should equal the number of the friend who gave a gift to friend
number <i>i</i>.</p>
answer
#include <iostream>
class Friends
public:void Gifts(){
int i, n, a, b[50] = { 0 };
cin >> n;
cin >> a;
b[a] = i;
};
int main()
Friends Sharing;
Sharing.Gifts();
question
answer
#include <iostream>
#include<cmath>
#include<iomanip>
class IDAI{
public:int ModeloftheCity(){
cin>>a>>b>>c;
d = sqrt(b*b-4*a*c);
r1 = (-b+d)/(2*a);
r2 = (-b-d)/(2*a);
return 1;
};
int main()
IDAI Estimate;
Estimate.ModeloftheCity();
return 0;
question
<p>Problem Description:</p><p>Boppana is working in Unique Identification Authority of India.
Boppana is part of Data Validation Department.</p><p>He is currently validating the names
provided by the citizens of India for processing of their Aadhaar Card.</p><p>As per UIAI rule the
First name,Middle Name and Last Name of the Citizens should come as a same name in Aadhaar
Card.</p><p>But the data provided by the citizens are separated in three different fields of First
Name,Middle Name and Last Name.</p><p>Functional Description:</p><p>So now Boppana's task
is to concade the First Name, Middle Name and Last Name into single name.</p><p>Also if
someone missed any of the three parts of the name then the system it should be treated as "Invalid
Name".</p><p>Since the data that need to be validated is huge in numbers Boppana is looking for
the help from you.</p><p>Can you help him by creating a programming logic for doing his
task?</p><p>Input Format: </p><p>The first line of the input contains a single values of type
String representing the FIRST name. </p><p>The second line of the input contains a single
value of type String representing the MIDDLE name. </p><p>The third line of the input
contains a single value of type String representing the LAST name. </p><p>Output
format: </p><p>In a single line print the Full Name of the citizen in the expected
format. </p><p>Refer to Sample test cases for format specification.</p>
answer
#include <iostream>
#include<cstring>
#include<string>
class aadhaar
public:
cout<<"Invalid Name";
else
cout<<fn<<mn<<ln;
};
int main()
aadhaar Card;
string fn,mn,ln;
cin>>fn>>mn>>ln;
Card.NameofCitizen(fn,mn,ln);
return 0;
question
answer
#include <iostream>
int main()
int fannumber;
cin>>fannumber;
if(fannumber==7)
else if(fannumber<7)
cout<<"Fan of Ronaldo";
else cout <<"Fan of Dhoni";
return 0;
question
answer
#include <iostream>
int main()
int husage,wfage,coupleavgage;
cin>>husage>>wfage;
coupleavgage = (husage+wfage)/2;
return 0;
question
<p>Problem Description:<br>A Little Lion king and his friends from the Zoo like candies very
much.<br><br>There are N lions in the Zoo. </p><p>The lion with number K (1 ≤ K ≤ N) will be
happy if he receives at least AK candies. </p><p>Overall there are C candies in the
Zoo.<br>The Zoo staff is interested in knowing whether it is possible to make all the N lions happy by
giving each lion at least as many candies as he wants, that is, the Kth lion should receive at least AK
candies. </p><p>Each candy can be given to only one lion. <br>Constraints:<br>1 ≤ T ≤
1000<br>1 ≤ N ≤ 100<br>1 ≤ C ≤ 10^9<br>1 ≤ AK ≤ 10000, for K = 1, 2, ..., N<br><br>Input
Format:<br>The first line of the input file contains an integer T, the number of test cases. T test
cases follow. Each test case consists of exactly 2 lines. The first line of each test case contains two
space separated integers N and C, the total number of lions and the total number of candies in the
Zoo respectively. </p><p>The second line contains N space separated integers A1, A2, ...,
AN.<br><br>Output Format:<br>Print the output exactly one line containing the string "Yes" if it
possible to make all lions happy and the string "No" otherwise. </p><p>Output is case
sensitive. So do not print 'YES' or 'yes'.</p>
answer
#include <iostream>
int main()
int t,N,C,temp;
cin>>t;
while(t--){
cin>>N>>C;
cin>>temp;
C-=temp;
if(C>=0){
cout<<"Yes\n";
else{
cout<<"No\n";
return 0;
question
<p>Problem Description:</p><p>Ramesh is working in an engineering college hostel as a Mess
supervisor. </p><p>There are different messes available based on the
years. <br><br>Every day students count is varying in all the hostels due to continuous
holidays.<br><br>Since ramesh is in charge of the cooking team. He had trouble with calculating the
quantity of food that needs to be prepared because of the varying student count.<br><br>Even if a
small quantity of food is prepared by the cooking team, it should be divided equally among the
number of Mess.</p><p>Ramesh needs an automated software to identify the amount of food
available (in number of packets ) and Mess count. <br><br>Can you help him to divide the
food equally and also calculating the remaining quantity of food that will be available after sharing
the food equally ?<br><br>Constraints:</p><p>1≤ alvqntoffood ≤10000</p><p>1≤ messcnt
≤20<br><br>Input Format:</p><p>Only line of input has two integers (alvqntoffood, messcnt)
separated by space representing the available number of food packets and the available number of
messes respectively<br><br>Output Format:<br><br>In the only line of output print two values
separated by a space representing the number of food packets that are equally shared by "n"
number of messes and the remaining number of food packets available.</p>
answer
#include<iostream>
int main()
int alvqntoffood,messcnt,dividedqnt,remfood;
cin>>alvqntoffood>>messcnt;
dividedqnt=alvqntoffood/messcnt;
remfood=alvqntoffood%messcnt;
cout<<dividedqnt<<" "<<remfood;
return 0;
question
<p>Problem Description:<br><br>In Congo the minors and senior citizens are not eligible to
vote.<br><br>Only people aged between 18 to 60 (both inclusive) are eligible to
vote. <br><br>So in order to provide clarity to their citizens regarding their eligibility for
voting one of the popular NGO of Congo decided to create a software that provides the information
about voting eligibility of citizens of Congo.<br><br>But they are stuck in development of the
software.<br><br>Can you help them in completing the software?<br><br>Function
Description:<br><br>If ageofcitizen >= 18 and ageofcitizen <= 60 <br><br>Then Print as
“Eligible for Voting”<br><br>Otherwise Print as “Not Eligible for
Voting”<br><br>Constraints:<br><br>1 ≤ ageofcitizen ≤ 120 <br><br>Input
Format:<br><br>Only line of Input has a single integer representing the
"ageofcitizen".<br><br>Output Format:<br><br>In the only line of output print the voting eligibility
information according to the condition.</p>
answer
#include <iostream>
int main()
{int ageofcitizen;cin>>ageofcitizen;
if(ageofcitizen>17&&ageofcitizen<61){
else{
return 0;
question
<p>Problem Description:</p><p>Sivan's is teaching his son Vigneshwaran his daily lessons in their
home. </p><p>Vigneshwaran's mathematics homework note had a question named Mad
angles where he need to check if some angles are given it is valid one to form a triangle.</p><p>To
make his son understand the problem sivan panned to write a simple programming logic for the
same.</p><p>Can you help sivan in doing so?</p><p>Functional Description:</p><p>The angles are
valid to form a triangle if:</p><p>Sun of all three angles are equal to 180 degree as well as
angle1,angle2 and angle3 >
0</p><p>Constraints:</p><p>1≤angle1≤90</p><p>1≤angle2≤90</p><p>1≤angle2≤90</p><p>Input
Format:</p><p>Three separate Lines representing three angles of the triangle</p><p>Output
Format:</p><p>Print "Angles are valid" or "Angles are not valid" accordingly.</p>
answer
#include <iostream>
int main()
int angle1,angle2,angle3,sumofangles;
sumofangles=0;
cin>>angle1>>angle2>>angle3;
if(angle1>0&&angle2>0&&angle3>0&&(angle3+angle2+angle1)==180)
else
return sumofangles;
question
answer
#include<bits/stdc++.h>
using namespace std;
int n,sr[5005],a;
class Attack{
for(int i=1;i<=n;++i)
scanf("%d",&sr[i]),sr[i]+=sr[i-1];
for(int l=1;l<=n;++l)
for(int r=l;r<=n;++r)
if(sr[r]-sr[l-1]>100*(r-l+1))
a=max(a,r-l+1);
return a;
};
int main() {
cin>>n;
Attack Period;
cout<<Period.Resource(n);
question
answer
#include <bits/stdc++.h>
int n,i,j,p=0,e,r;
class Circus{
r=n;
if (e<r) r=e;
return r;
};
int main()
string s;
cin>>n; cin>>s;
Circus goal;
cout<<goal.performance(n,s);
return 0;
question
answer
#include<iostream>
class Administration{
public:int Connection(long long int n,long long int m,long long int v)
int i,j;
if(m<n-1||m>((n-1)*(n-2))/2+1) cout<<"-1\n";
else{
cout<<v<<" "<<mark<<endl;
m--;
for(i=1;i<n&&m;i++){
for(j=i+1;j<=n&&m;j++){
if(j==mark) continue;
cout<<i<<" "<<j<<endl;
m--;
}
}
return 1;
};
int main(){
cin>>n>>m>>v;
Administration ways;
ways.Connection(n,m,v);
return 0;
question
answer
#include<iostream>
void solve(){}
class Bus{
for(int i=1;i<=n;i++){
cin>>a;s+=a;
if(s>m)m=s;
if(s<l)l=s;
cout<<(w-m+1+l>0?w-m+1+l:0);
return 1;
};
int main(){
cin>>n>>w;
Bus Ways;
Ways.surveillance(n,w);
question
answer
#include<bits/stdc++.h>
int n;
class ContactNumbers{
return 1;
};
int main()
cin>>n;
for(int i=1;i<=n;i++){
char a;cin>>a;
cout<<a;
if(i%2==0&&n-i>1) cout<<'-';}
ContactNumbers Digits;
Digits.Phone(n);
question
<p>Question description</p><p>An amphitheater has 50 rows with a seats in the first row, a+d row
in the second row, a+2d in the third, and so on. The task is to overload the+operator to find the total
number of seats.</p><p> </p><figure class="image"><img
src="data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAKoAAACZCAYAAAC/mKGBAAAAAXNS
R0IArs4c6QAAAARnQU1BAACxjwv8YQUAAAAJcEhZcwAAEnQAABJ0Ad5mH3gAAAAhdEVYdENyZWF0
aW9uIFRpbWUAMjAyMTowODoyOCAxNjowNToxM8J5NCEAALbxSURBVHhe7f1nsKVbcp6J5fbenX28
K29vXde3+7Y3QIMgMACaICGBmhgyyJmRqFAwgtIPhf6KEQoFR6RCoZB+KEIaxoigQEkUaECAFAnCo+31
rnzVOXW8395bPW/uc7pvNxoYNJq3UQXhq7vv2fb71rfWm5lv5sqVKzDmsD8vB7cyHo/8acD//6Hje+9S
XxjzP/97+lrH9zwfhnh59ls9GQc//AaPyfORBXk2/tA7Z59OXp2dMvjhb+j6H/726Xk1IsHAyAKjyb34cXYCf
eXsZ/wdj0P80bW//fPvfPfs8BOq3aevn8Hjzw1Q/TZ0J/wNnI2I/uih8f7wIPHc8RzQmwK3v8vLD32JN8e8
DjC+/pLH5NuT/+mvPhrxpt5v9vq8B7j4d3o6C4fDNhoO/HUkHLEhz8P8KhIO2RAQhgQeDn3+oSufPudc
NPJMlvSls/NOfqA3Jtca00i91LVPb4mH3vjQWfX8Qy+fteOZBaqaLWCd/R0x8P6cz4IM3IjnwyFo5A0BQ6
/1bzTSAAYtGOI7fDx58D8+D4d1Pl7rwXv6TbPVtGa7wznCfB60ZrPDeft+Hl1P/3Q0uh1/zpkdE3o3nU5bu
922wWhgs8UZq9brNur2LB6Nq+ctFos5WIOhkIVDYW+rg5cTpONxi8cj3q7R6Ql1b7pXwVNypndGw+Hp
dSdCNeoPUZ5BP9/Y74uv6aaCfM49P6vHMwvUbwOTgdPA+MHrIXfjYwOQBmgwDWgkqgHnZhmsCW
DNugBGvx8M9L2hdXs9a9Zr/J7PeYxOQS7Q9AYDv45ApO+ddZkDnLPpZYDPxoBPQqLf8J/1un1LJBPWar
csCtD1PRnqFuDPZLK0oevtiUajDiq/F0DrYOT9SDAEWGMW4xHlEZKAcZ0QghcIAG4Eh1viue5J1+b33Le+
FwK6Y+5LUjdCMwc4VzhGPzyjxzMN1CEDoYHTQ4MrTTiQptNAO8gmoNXR5fvNZtNanZZ1Oj1rNbuYXw
G1D6B6Dq58Luffd6Dq/PyV5uUCE8E4BZMGXoIw6Toe/CfAOcBOry2h0HXmpqet3mgA1rYlEglABogAW
Q/AD/08E4ELBcP+OwcqZ9VjPBg6RdB9+vf4J00Zk7ZFG8diUbR2HGGI+vsR4Aml9t+66KpNPNRKPyf38a
wez7bp568AogHRa5nIPu/1GOBmq+Uaq9Pv2c7eroXRWkE0kWsjtIuNpeEmoNJQ8szCETil0M65hqOhP
x8xtgLEoD+wPpo1zvOQzLR6Td9DmwX4Hr6P3gBwIf8oCFAHfD+Xy1uj2fDfRyIh2jOwZDIJDahaLBrj+kFA
3OTqCFuI/0tr6hVOm25N9EVA1SNC+6Q1J+Ad2HAAeANdaMnQz5lOpiwdS1g8HLUEViQM+BNc44wLP
8vHRwLUP+qEAtYfPsSjXN4nLz/0pUnL+B+DIxycffShb/u1GC8GrW9tNNju8aE7OP1+3/oMrps9AZDvOa+
UmeTvoDcAtGghHvrr4NNZ+VxmX78DD7RhaPFEyvpowC7XkFYM8l13dHQ+GqnWBQICLxpY2l3/OJXoR
QgN2cbUhyMRwNq3CCa8x3lS6YyDTcAU5xSopY0FKv0V8xhLSvg8DOh1zQHcWPeldqnfxoA5GOzQFt7T
NREufSjKkIwmLBmLO09OJpIWwzJI2+pQn314jM768uz48OszeKhNfuj1d/1g8kLf0rMPn/fs+K6v/ymPjw
CodLo68XuafKonTl9NjqB6fIQOdC2k759+rkFigGRuHTDiloBJ/FMD2O20MZ1963SH1uujNdtd1579UQ+t
EwAEKevocz6LRKRRJmCUxhXHHPHdxXwcIPQ5n3itoCZtG3bHKQYYY/GE9Tt8zmvYHfcE+AGGNHIfkKcz
CRtzjW67YckU36W9bThpGEAIrPF40jpodfHECQAnJj3k2rnn7RagYxIihEEAk/kOoVXD/L7LNeutNueJO40
YYiWqlSp8WwLBmfjPOSnXFZiHnGMwEJ3Q9SQ8ciCBJv01pN3JaNCyGegCliWTSluM+4hwnZDay/m4hG
TUR0FhMacwGgp/rrbxSh+ewYWXQx8ufWvy0eSQwH/ntT49oyM/zPERABWzxEP/Jodo/aSZZ0BVh/hfP
cEjnmgv8UK+wYCGMJH6tr6mX/Z50kD71OsNq9Ua/lfAjqExXEtKQ3KOIeeKMCCJRBztM3Iwy8z3AFaUA
Rf4XHmjlcKDlgNAwjH2AYPhMYi1ehOKgNmUBkTLZSNxi4SitGGMIAiomF9uQ2DsdzoWRMul00mrIQA9
BlXg0XfimNxqqQzoEEJ+K/rQ7cCL+XxEOzXg0rZRACPNOqa94q8RgQ/wiNKIEijEpUOctFqt8RqARaLc6xC
e3aIhtCcUo7fpRwRPoD8TegmfKAQwA3w4gYaGB9RRzh/m2gn6b6aQ8z6PQRcics74pfqUr/i9+EHfqr3+
SkKlQ/dx+rl8gslx2p+nz4QAnW/y7g93fCSmf0QnSgplgiWtaqpuU532XQcvBWtvAN9TkEUA7zFw/f4ILY
mj0xPP7KAhu3wKODj3QLZeZ6Q3AxooQBMEaBqgDtpWYR+ZSvG6PppIyJJmDcPbBL6B3qNzNWiTWKli
m1E0ccJK1bYDP8R3FfoJca0g15CT1hui7QCKBEsOWL/XAVhjBjxmh/UaMgkwOFdUoOevtGAMwLfRrFP
FKWvW6hYAHDrHxMTzE/7GIpPnogYjrjcEcNk4IA5xR1yrhRMoMMnsC9y6L6cn3gsINc6ZKMo40Heh0P
OJmuC8I9rL5/yf72lcEDZpXf6JzgwQnmQyYYVszlIIuDS4+m8CCxoljUobXHnwVkC/5Z5FOwKnY6tDVi/IJa
TEzxTRt4HFVybf+tMfHw1HFVfyQ83T3U0cg2/zHA49Y9wdph4SAgj62+52cITamHVxzg6PNiAKoFEUPJfzI
I0FiOjAhjggAyitqQEUT5TwMy50etrNeoPfiy4k0KYxuJqOARLUC3AO2iRtJhBKuNqY+ZMSgKNNccy/7qN6
XOYvQsM5eqj2IBpOHnsfwUEBoauGaMqO1XkvhjMjTRVF440RCB9wzr27s2sXL5x3jYrKR2gUJuJ+dW1o
QC6TxnPHLCMs+q2crsigaYVM1JYW59DyLSxJ3crlMpQjY1OFglsDvRYoJqEv3bhcyQm41T+uCQQoYOoO
2LjHe6dclnafdoC+xbsIJP0fxHokUlm3AGkogsJjcQRJhwNQM2YaPV3Ogarffuj4rhenh977fu//AMcPDVT9
/MMA9EPmQerUWydvXJ3FoX7TXw69Fu/To9lr+0DUGk00ItxN2kYOi2sdoNBr2KjXdJMaZjADAFUaNIx2
EnBlukUrxlyz1ejxWdAy2QxtC1gNjzudyU00nMAGP623h3Z/5whtO0IgOvBW+G1/yPOuD760YgYnRPHN
ONcMBCM4ZoAVLe9aU1oJoKTitGXYs6MjzsU1s9m8C4zMvrx8XVMhsQcP7tvzN57z8zYBJid0wegiGG3
Me1qcGFBHozLr3BfXbJzs2RhLMjs369daWl4GUwpPTe5NEQOBMcp5YgGog8YhqN5UhKDvsWEH0ilQg
a8N0KgaADlnGqOQQhXCs6gHWlyCiXzRLygGhDoD10/StlQCa5NA6PjqBLKT8dPPz7Snj6/+dzbAZ1/U8e
Ef/imPjwSoI0yeOlGd46aJQ2Y6CCGXLMsJajZaaCmcEetbGS4nPikeKSeqjzaNMHCMrJvpOKorMMTJ4XM
5SZEYmpHzyaT1B2NL53IMEoOL5rFxxAEu83d0VHbnqa1zA+6NrR179OgBfDZii9df5DtBzgdVgBYwSg6Q
g4MDy+WyDlKZ2iEgnpmZx7HpWhXQFadnEKaOD+IY7x3biZNTgf0FbW5+wVrwZwlKEg1OJ9je7p49ePj
AvvT5L6I143YCB9Y9SmBSaNH1J09sbqZoMzovFKFSKeHspOyodAJY4pjllNMfmX5ZF3egEIb1x4/t0uXLN
puK2moxhTAmLZeW2ZazR18hyF3uWx0uLVylXeF4xBqtpiVjUBNGfQhvDWOvB9zPGLBGZJVQEB5WZty
CQUFj5O+naFMcxy+mNqFtBdAhgE7GGBtAqNeu1PXcwc+FGQe/kCjfnzVQv9+h2J/OqljixGEBnACujZZRj
FPebLMxcYgCmPWGvGO+H0VLJOkQvmLVRp0bnHRyVPHHVh2vNetAHaAp9J0opknmuMb5pEHG8LET
wHlyUrK9/QObnZ33DqoDMDlEATp8b2/PdvjOxz79Y7q6e98KTY34KzP36OFDgDlt87NzVq1VLQO4egjD
5s4eptPsyvWbzoN77ZbfQzqBWUUNHVfraL1VG3KPogpq/FQub/sH+/bg/gN78blbrvlHmHZFBJQDIK768
MFDm5stWiGf9xmrPgAuThXsGEDLYii22+A64qXy2GUlJCiPHj+yT3z849YtHVpi1HZ0JOC1MZzJNn137eol
m5uWNg47P9csXTQhrj20ysmxWwxFXPodBAcNHAJp0tYMCECHAkgguAv9HY35Hv0uvq02KJ4rQSygILg
FB6lYRIBxj4oPcXhCjT4QWKXZJ2//qY/Q3+c4ff5DHa5BQZv++gwINy3K3kQ8a3T+fqlkBycnVsEUt2RquQd
55oo1TrxMzB5ADcIdpZGi0bhF0aqCuXhTCO87mgSYQ7x4i6CZ2rZzWLVyvW+PNvdsc+/ETmpttGiNa45s
5+DE5lcv0kd48i34GRpmZuEc58jZSQXNODPnGlTSr79DTXdyvSM0qiIxC/Pz0IiGm1150pVyBc2M46HIAa
pDrp+coDRAbta4phwmuGMIwZM2GQ4QAGnOdtu/K/BrEFsd7tf7CW4ICE64nsyrjJK+K+HOpJI4dTUffC
Wz6IlHLMRdONQnctAE7gFEP5LKWXuE9cHCNDj/vcdPrA/g9umfJ5v7tk+fVLEIikpEuZacwigOlLh+Kpu1E
AIqOuXEAfoU5Dzi/RIsNUwC2kcA1W6Fv0SDerxudqBLaN8+v/EZN+5dn3F3/jvXyGqs1OwPefwnA6pA6g
86QzcmzdmAb5ZqFStXq9ZGorkTf7+DBuoixfLiY4BEGi2EtGpQ5HwoJjqEDwrwClZHMX+tdh/N27Pt3SM
7LNXt0ZMd++DemnfWEDCOeAQAdDY3bUE0yNFJzXJTszg4WWs0OwwEn0cSdOzIDtG4GTS14pXy4OV
EdACJtIPA0qjX0aRJ3mtatTrhrC20WAtwBDUYaJeRAxEtxEjs7Ww7t04x+G3A3ZMDB1h7cNAW5xJQ05h
MvTegc7icO1sJpxddD1HJ9Ior6pwDPjtEE6td+JBINI4ZAA4CkiTWZW9rE8Fq2vmlJcCH4AbhqwBTGrgkp6
vWsHMXLk/CafRFqcZ9wP+rtO2tdz6AQnSdj3uslHvz9nBdKT4hK8i5FB3wsJOwxrWl2cPhmFsB0ZAe91Hj
fDqP2qsoi8Zf9yh8SzvLQRN10LkmiP3TH276XQL80AlpmQ5vtYzjhy6gdvvHk+/oRs94iTx2aUbF944AZhV
zrC/3RgNv/Eit5/xdXuusE0cFTenhGJ1NnRpBC0syJ86STNzB4ZGVAZrAKUrRYvATOEdNnKCtnQObnl+yG
Ux8o9O3KlpP3noeTbOLiZfzJUBKIHSXfYCgyYHdnR04YdFy0Ay9LyDWG1WfdhTvXF97ZEsL897ZtXoVThx
3cHfgu4uLK+69V2slB1Yxn0WL71sL3j0zM+uaTueLayqT87Xg4jo0lamIxoi/8snk8MzNzjr482g1ee6aTND
wilpU4L3SwvK+xWfVfdJqC4tLdufOfZ9kOHfhIlYEp2wUsUQigpcet/v338OR69onP/Fx23iyYTPFaResEFxU
fPT1N96wV1/9uEcbolG0MectZBN8L+8UKyH+qTkYMDERHikUeRaMNYKiARfwJHA9bkSRC1kdTSCk4M
BTOHpKxBGf1fv6flgamjNMoKPRF3Z4dQq1bz9RuOaPOACqDNsE+WrM5MH/Ued6GtQ03umhGJmAK
W0nEyVVLyqiX8qsVOBY1SZmhk4Y0/Gaa9ZgDhlY3ZA8W52zCdkP4+Hmk5iues9igKndxdNkwKoArlTt2u
FRyZ2HtcdrFkhkrIc2lAacK06h8cqY3IS99dbbdp7BiqUyDDgOgThWMuqcUYN2sL9nU4A2BjdtwtuCEho0
eq1SZfDNMpjqHhpWTpIcj9GgZ/0mAtGp4QMwABIpfiuzKwDmCzmEIOcmOxxBhOkMPvZ+DijkJHMpc6
J+R9A9BY/rDeG48qilvbbLB2ijSRxTGVDSVr0ugOD7AmIUDSgHMMk9K8IRo5/iXEsOpfj59PwylOfE0oUZr
EXGUpwnRL/HsTqJdNK++s1v2rmLF60wN2sV7lk5DnJMoadWP96FenXswuWbHsHo9AbOUSPca2DcsK
0nD+2Ln/uCT++uzs9YKggw+y2LBvEL+h3XnIoGSDNpBo9O4HeTexzQNgZZMKG/0ggSD3yKOMKQpo9k
GBy39NkAa5RAKAAf7/IbgUhHSOHD7+Dtw4cD1afw3FXTmXhIrs9AfvZDXjtm+dg/4+Gg5VFptjEvZWtw
U0G0SIdB6fNFSVmAQZKDIKBqRkWzP32BgO+FBgxCKIaJLtpxrWc7J3VAPLSHa1tuajXztLu7a4sXrlgoU7A
O/DYGgawz2Bk6U56vUtdWz13yXM8eGr1IB/cQhBBgerL22DXV4ty0teCRPUy5ZnPKJ0dWPTry64ZiSaw
BmoXBnJ2FR+I4FDMpW12ctYXZPN0YpdMVbB95QDyEFxsKITTuNKjPpGUAkawGHe+JLnSM+j7O/eor0t
p6qPMC0Y7PcrU6I4QHpwyO3kTIdI4qZruDJdrc2rEmJL7NZx3uq92o8X7Nw2nzS+f4bGTJ3BScNGZ5hPP
c9JTHiGsI3OONLbt66zmLpbM+BhIJl6Zu3bbX7tjC8nkEOo1lGloGIRZvFjt9ePdt79dXPv4x2g73hnNMZ2J
2fnEK0E65g9bqtiW6Poki5zWRiFqba/ZkKRAycXKfWAnjBNKf0Si0jfNPZ5LQOmgMYzeBEGcBc6IyTg/UN
3qEBVTh7w8fE9MvaecHzkn0JrznO8d3fqhUOXwdBS4A3yRAXiqj+fp4hXzWZpAHGhSQLN4p7SDt0+9O
XjtI0ToBwBPExAzhnTXA+Y033rIgUthFZQ/GCqHDXeGI8jC3t7e9wy9cu2l9+OMAEI4HLcsisTXAt7m5ac+/
/DJcskFbymieSZ7mAOdoc2MDU9+yJUxoBToSoHOLaMW5mZwtT8d9EiA3PWNJNLmSN4qFmCU1cPT
mEC1X55wNBCeFs9JH27r267TcbCvU5jNw/BMIJ6H2SXxUQixtoTimBk+TAILpSPw0jPaSNaIfFHMVzRFAl
UydxjIo9/T4pMqY5egPs1rpBPqBEsAK6H5r9Pnm7gGg7DJiYevAE0UXNBGRBJxdHKVsYQqhDWIxinj5QU
tAcdr1Yxs0y3brhVdsbWPPcoVpfIGhh7Pi0aC98c3fs4W5oq2srgJiLAuaNh6A2kAL0jH6Eyt57sIKdGTOaV
631bAIHKFPfwh+KShXFKtSr9bdCVQnSMFKYcxiuTSWcZRKUrFi4KW+YLQdH8EzrSgLzNm+3+FA5VcTRJ8
C1b/8IZPvB2+10IQDHpKeJlpUXE1AlaMiL7LPBVu8J+9U/EwaMRyM4EDxe7RQCGAM6dBKo4Onvmk1O
GUU5L/57gc2u7BixcVVPPIqGixvmWwaqR3Y8f6BvX37tt184UX3sMe9NhpAHRxBmlu2DhgXVuCNXKRy
cmLjdsMGuKIKuWQyaXdw5oozVoSDzUAblJBRzCVsvoCHjKZSqEtg6TEQmqpUmEodGed/AkB3rIhDlPM
rwUWhm54nhoj6aKZMtEnmDA9ONzl5Tl/KEdKUqJxDmTzxzzDOXrtTcaMlHqvQkWKiLcyxBlkOiUJ0iisPo
wmFIyb9CPeLM9A6rxxRmd5yrY0VaePZ79vh/qFt7+yiRKL+vhzGeqNn03NLtC5kqxfOW6Na4p7M5hfP2
95BCSt00XZ29hFWxaYbtrP52G49d81jt4fHZbhqxFKAShMt1dIx9zawFfp5BkqRL+Qtl4xYuFdHoqFTMh9
ASOAMcXPKZZDAqn8ksGlojJJf4txjkvPH6T/FcqVZnUadRgf0/I86JkAV9B3UfJH/FAhnlCYHbfCfM3g1BrPR
qVsDDaDUNZk6hTFgrHjeaEpUfZgbV8ZRkAFLwaGCmKcB56u3hrZXrtmTg0PD6mDiew74PGA6KlVtCy1x
7dZLDnppahFxOQADBuadd96x5dVlW5yZQZLr1m1jxuGMWuZxjMbpYhLTmbxPClycSdnK4oItLMzZ/Ey
RDpvMq+cFfIDTbikxYwgY4dTVindgIpX029cUJrfjWkAJHhIwTYv20VKlSs01niiSxmQyGLSPPpBgdjpoSvpB
fSJAybSFNecPj5eG9qQXQBlASzk1oFPFl6VMIlgXfSaOqhknRQIUousilLqGDzqAF+eVl12cnqZfRm5mR2i1
KYSwDmhPTirQhQF8fWj3H20wrEF78Ggd5yaF2YaUA/YIApBIZJ1HjrFeM9CdB4/u8XxgN25cmdAX6E4Lr
p6Io+FoYB1LpawuTVgM/L5CNpdL2qXphBXg7PEEfYsFU3K43zcPxWjFaz0pR/kGCmFxDoFVY7u8PCdI8Z
76WyAVj3UQ0kcTK3V2eHQCiZ8A9QzNSIQ4G0LrD6nxAXypgze8e3KAaeGG6egAEibnQOatL3Md4DLhB
EDDYaLDpV/kfR8cw7s6Q7v9YN1q/B2hZXucuAovkxmO0sITTOyDR4+R9mWbw6v1FD46asQ1UUQMAv
xMDhidNuy2ML+AFaCKf84vLVthKm9T0wt4r0lbyA4th+cph6pLx4lDi0NFAAq9hSZDU6LZUvxGXutIjo7O
C2jkbUdpXwNPvQYn02zXEMsS4LdvvvEmWn/BQS8Hy3MUAKvm5sWPa+WWTU/P8p6mJiVkaBdoxLgv
Ptd3bRxFO8rM8a5z4qPDQ4+95mmLtI/AKcWQzaUtEUJTwfmn4NHysqXR29CYFKATUJrwdemSIEBV4rS
4sWLQ6XSBNoQ8oUevyyiHUqliu+rj3SM7Oi4Bwsk0brEwB0/NMkYHNjs3x3hlPA4axXEVB9Xky+HRoe0f
HNj5i+e5dtLBpgShQLtiuaEmaoY4Z9cYgykEWVqS4afvonDScbfpHv9wFPF4+VkKpOLTiwuzngCTSsFl3TE
FsIy38jpEEyf6k77kXidA5VCmuAZA3/a5cweslL25hFbhRmW0qKY8fSqU74VxKqSq5RT1BnDWMZISy7jE
9kH38SEdAhhP8N4bzb698c77Fs/k7NbHXrUSNzIAMApnyJTLodnY3vH0vXnAoBxOhUQkkT00qGaAqpU
SJr1pWaT6Elzp3NKiLS0vudnuaKoTQEUjtGlUApSY6FNyr2lXxWdFQ3RPPqs0DFt5IDPcxyTW0LINq8Fhd/
f3fRo0HIXT0ScKDckqRRG+995/D0FawLPOeGhmAOgV7opBLarwsm6jT+cvuYC4VmZAFVNN0V6FkkaAt
a2QHb+TgCthe2PjiU0Xpy0LQLQkRry1j9USZdld+8BCo47deO45RgGrgCZSjFpB/rT6jWunk3jzEbS6hBeN
OYnvjj3bPwLn7WlyQVyQwe4oFTCdo4+b9mR91w729m39CU4rABLTDtPOHNpRs3ld+G8RXl9vDeCzG/
gHVwFUGiyo/SghtEceZ6u5uwFNOLTFlfMWx9pcvAw1yKcMm2ANxaqj9BEKJhqV84bDKBqE8PrsHUCM
0r86rwQkFQ8ZOt5pgMdw+VzW1Cdlvg1UpEgmUABFoFHvPDjpCYN4eHTsAyKiLgCKgwWDAAlcSwFodk
mecSyRB7QpK9d7tl9q2MbeHtymgpSl+V7UNrd3bWfvwK7DNeX1huEqQYAfp2EKh+wfHvP5nnO1JOCv
V45xAKo4UA1LZ1N2DlAuYc7lwc8UFBvFgQGgPTlyMghoPYXhgoBV19SLKqa9wcBIEOuA5vDoxGeeMsV
5s8wi98L3FYFA8DTPLq1+4co1nJAZgMq9CpCNCjZ66G3TdO4MYBQz6vNZlw5PplNo4CbmsW3zc4tcS64
ffcTJM2j4VquKBmnCzWJWgCOXjisIoPowYOvra251ZmaL3A0AVjsY0Bj3X97fsJmpLBYq7s7W1PQcgwUfl
tZR2GjQsUImZQv8VtO8An8UQEakSDS/DqiHzpGBIWoOV9C6UBuBLAyUtOylg9O0A+XaQ8v+1te/6rQtg
hYuJPNWnJu3Bs6WZrhml1ZQBGha2uUTElCToSZDDvZsenbBaV8XiySePzuVto/dPG9TaNdwv+FJO+121
3MFlMvRZDyqKAWlFmp2S4oxlUh6ROXSDM4k/SLeLqBOJg8mWtiBKrCdLaXt8mEdTbjPoGr2yD10NJTu
VpxHPCzkQEUtA7IwPKk3wkSOY3ZSHuIY3bMSNxXH4+zjWGXjKR88NfTBw0eedjczO+dAHbarlpaDQof
WGaB6DTABpCAcMsy1Zwppu4rJOX/xHJ76DAOIZAHubr2CYGN26TgJWRBeJ1LdArEn7RGaZJK6Jz6nBX
b8yiq1Jt5zw8oMyuWbN6yCwyFgKHc/QueoDTu7e7Z84bJFUlkcPgFubFOY1QFt1m8lqOcuXXa+p9kdJbt
kcjme9+xo58QWZhY4D9RIeZ+AKgbHU8xQ4FI8VJpugHMmNiagbqFRizMFHwinJzgZHbSjTOQRQn3h4g
UHahNAcbtoF4DIMHUbJbR12abSSupW7m3EtXAO4Ka00I+xUVqksp5QYJwbx3fAPTQx15ksXnwSzVrnN
zitmvaFu773aMunut/51pt2tH0AnUED8r0bL30c6xdFGWnMlWAN51ZUhT4ZAeSpmXnb3p+E+qpQtEC/
adPZsJ2fydoM+uIqY6cpZoEPMcMBh3ZwnjjWQIIiiiK6pIjMzbmCO3GiHMoiEz93B0saFYo6lgZlVHwglGV
zhPes6bZIIuGzMlrA5ovTwkkGQBxPGkEmRZQ2Yk+2Dmz/uGGNVtA2tvBAm21bBQwFOmJEw6TZiniKU
UD55jtv2jROzhxmtLy3be3ykUcO5GxI+jU7JK35POZmcWEG7xATQ1u6A2X6BOC0mGKurdivNI2C5Zqnb
veGdlBu2J0NHCQ6PpvRvHvIanjBurlsFj6M0D189NCWz63aOI7jAzgl8WN4t+5PIazZ+WUL4aW26BRNba
bhYQoRibtVGNwLFy+hnQE9wqxl1Dk0ojq7ety0WQZNdIVh9P5swLPzaGGZNjlEqhEwkLAz8DJ7+3s7OEZ
wUCkIfietq0ypCFSjUm3a0rlLbppjWBzlEuhQLLJVPUbIGwhylnvNcu/ihqJK9BP8vUafphJhO3du0ZbFBRn
8bMKskEMQ0GhayqOIg5K0+4ynprqnl5Y8xJYSiA9KjOOB3Xm8aXsVhBvOrgmNubkFOHXWfZQWgp/NF
y1bmLUOfSMM9RijGNp8UDuwjXvv2NJ00l558SYCXLQCAiE+26QPAQ/YC3oY0ekOIB3qPtHS2XTCivBdU
QJpfzd7HA5UNbCFJhDXUvqdNFIT6copHsdJ0E8ANmLxUNxC2L0AWrTe1UxU2w7LdVvb3sf7VHglanVA
ehfNOYeTc+PaLSvhiWoO2j1cPOatHcU26zYzM2XbG/etXytjJvu2Mj9tL12/aheWF13DiaeOcBC0JEQmKI
GG9lWcznuPPRzVog3HlSZmDa2MZ96ho3ojOCiaNZOH++WmrXyCmUF7y7kLQ2FKB7sWAMiJ+Tl4ac07
XSYyk8LEVsoOGiXHyOWRMAisyilFVnlPvHwSo5VGFX+SpWhxz+KGkQgmmN+7qeKhe47G8bLjCDhSPaR
9IkpyVGQN5LQl+UwJ3jJ1mhBRUrZS+xT4VwGKARYkjFDJLwAOnEtO2JFNT027NUllZ9G4yhxT1pZCbFW
cSAY8h3al3zVJICoRD/ZseU4ZUyPAVnTTK2eVZkJtoAho/hG/z+FH9OlXUb0KGm+Tsb33ZNM2NncAI5wf
My3llclOIaSiQVg1LECPcyi2LGfo4f33rd+q2IvPXXOrm+TeV6Ft+Wzc8kloQqOK94+1wdlKcM9hHqI8baiD
FiZqKZFyLZzfM1auVPuDwbhBZ4iPVgCVko8zSYUccBIYoChf7jJgvuyjN7Z5eNZeqW631/fsEKkvtwcO0jim
Rx2fR3Lu37ntSRWf+dQXkNgA2qDDAAbgiLtIM5pXMb0kEoUMry7O2CvP37DF6SkLq7Mg3zE0pM/7B6
KugZooqCaDWYHzag789u27SPI0ZmseRwoARaAXQHGssFOgiZOybcksWnse0CNU7VoVcYcC9Fo2xDkT
MEapHB0/hm5MgNzH9PrSEjpWGnwBL7hULVut03LvXTx3iKl3jgcnkzPEidxBEDeWtpCzI+HS23qkkmkG
T3P4shb66hjharjjJFAq71aJHkpo0WyOACRzFwfcmpkTiCIxhDWMBUPSNLunJS1baLuFxRV6NAJIB659eji
lctqO9nf4jcw+woHWDDE2KrIRGiFsw5qnBy4vrdrFixfh8nEr8AiNezYNjRj0mh6vLTcUZgId3KsSfEQtBNLb
dx9gPXfsGEcpEMbaxgs24rM4wppl3KPxqB0cHWGVK3b5ykXah4XGWkbou3gY3yEWtJeeu2jzUzhcCNa
Q/h7Q70oJ1ERHiX4QL5VSSMagSrEYuJhmTMBes90abx4f4TworMKNYQoU6lBWfAXTpXBTZiqDpkJtV8
QjW/b4ya7d3dixxQuXLBTP2gncMgy/arXwFosFzELZtp6swzdSSN2Uq+8a2mp76wmd0YAGpO1zn/uk5X
EWNGORxuSFaHgXgEiD5fIFgBe2WqNj23uHrrUZLUwsfI+b2kK6NROTm1qwINcIAtQ+aHGt3W7TWceY
mmmPSGjQ21CPATwthBnXYjzlGSgTSxRBU5gt5SfQPpndBAIS4fMZOFcLvhjPTGKNApq0WpH36TYGOe
UZ+pqS1YrUwnQKIEo7y6lQsBtzhs8jTakYqPwAAVWOlLgzb/mqUvW1Jk40GyT+ppzUZAItzTjIcikOqwiCJ
m18FQCAFi3IYzFGirZwkZXlZZRBw3I4nU821jDR07RwEpfNaFYN6zMcNNDSx1biPs+tXgRcccapDj1LMuZ
9u3IeR5A+UrxZs4KqYaCQGU3mAdDQ8op2iL5otvDRozW792iT8U97quA0jmQomrDD4xObX15BaCbJ2
gKr8gyUO6GVsIe7T2wmn7af/OJnGGEwxdjI75BiOCif0D89AIyNpK+FhTy8W+WNAqVKZbxHg+sMGLYF4
MThCVmIdxuTzSDT6XG+XIMjlUtNHKJN78C7j59YHPV/7fkXcbyOfUCkKZB7C0IjAjw2AGsUOqB59j6DfvH
Col08t2Lnzy3Y8sq8hz6S6TwNlfAqB1WORojOrNq9tW0PiSXwQDU5oKC14odaGlLm853dHUvCQzM5tB
AOhThqQNOFUID9g0NZOMwU3Iy2a0lHpXwAPytj4jCp0Bhl5dexIvNQAE2lPnfjqoecwpj2c+eW0W54oD
HuCU2m8IhCKn1pQkyTQnnSqAoHCVzSYBbsoEUnubUKCUkzpHFc1C8TLSFvHNowUGEKzDxCpJCSZqKa
aDBpUvF0TZOKGmwc1qzU1PoxrbyFkmHdMvRVDW6YSuTQojnaNKFGOThdV9aAtpYrJZsW76WN4u9x
+LbyS0dQoqOjTQd7HiFGhvyepgCNHKN25YT7Gvpqg2vXL6PNFQvWfcPfObesDjfmdERsQYK2BwV5/fW
3bGNnD8uG0ChiUFywS9dftCc7+2jJrC0uL9CWPhioOsW798F7tjA7Zdcvrtr5pQUsdJa+od/kg2AR5VT26
VM5hBHFsbGCuXTaAkjA+IAOgZb4IMTQjIqFylxHcQTGfPn2oye2sb3HQDDAmJr5hSXb3D+2B4/XbRHHR
NNqmorbevLYTcegVbUSJqiO2s+jeSQdf+nHPmcrS/NwI0wLZJ8xgVr0uPEpACdnoWM7aE/lUtax53twSy
XkFopzAE5xSGX6dNF0BY+pVrR8BSEqQvA1M1Wp4y0jv6khmpXOPcEBEidu41yE8dybgDQSGjpwF/C0L
ywu2vzMjLddM07y0ifcEqeSgRF4D7A0mXwSDca5ZAo55PipbpTS8xTSU9a7MvCjCAVmwZ0DLyohcPcm
06uaRtU6KgX5fX0WQFSytLSWYrU+vYptF2g1RatJhy4CO8KaKf7YldePIPbolyfr29xLB+2IA1dt4ZFzXXFq+
rgNrRK/k8ccQcmEUBKeTJPKAtgwCmXTFvEdVJ9AmlKJ6UoYUvLQa9/4A7uMhz47g2Kol1AKAfo6b6sAr
QjfFZiVJqhcig6OnOK4cUUdwMoG1vVr3xRgj6GK05bMz1s0jfMUztIvSsruWBon6fb7dxGEaZTVqu1vPsH
BC9u1S0to8wW0J9YI3AzR/iNpVOiUcpUVa89CoQK9Xn98jLNSRYNqsOTJt9poRLhVmBssY37feOe2g6o7
0uxT0h0E7Cd8ZdsqtYq99NJLdGbDjg/2rAU/6TfgkkcHtjQ/az/5pS/ZMqYzm4njWB2hLQBnkg6C01kghuf
e96wn5ZbWNf0H6OQIDTB9x+WqL18Rd5PHr07SHHwFAKmzNOA0xJNiWgyipDJYr6E9FFyvQ/jhXwDvY
y/d5H5GNjs3Y/M8FJ+Moh1lYuqNugNLWk+gEjcUfyzIkQRUKEcEq+KhJeTAzakGWY6UHCKBUKB1rY9j1
McyTZJVRpbLFQCYnKOkJ1GLDjS7NU/H07kVEpNGnpkruhBIq4q+aGZGzok84xSmVa9twHjQrkQkadWT
uscgtZ5sv9K1nXLD9uj7cuXIQaq+HWFZZudxdhB2rfuvQMdiODK54gyAHnhWvyIZcp7kVH3r639gLz7/nE
2j4VrNkgO+jXbXJMo01CYNYK5fPmc9TL9ArGwubAUAhBbCtRP4Ne/eeWzv31mzJ/s1KFneiosXLA13Te
DDbUEXBmjdF7DAR4cHbnGjIfh1uG+LMxmnHoUEQqBsLPpG6Zwan9kp/CW0mnv9bbTpcUUeP+pZjoP
4QSztU57VFpxwr2QlNNbmQcV6aIpEMuPkWbM8t99/DzNotrQwi0eNudZMxfyMffzFF+yFGzdoUH8S3s
H8Kq8TWoWpjuIgdezJ4217fP+Jza1csDwdWEdbVxloRQmUQT5A40gzJmJJy2g+GYcB0fbZLGXY12oljwc
qr1KeqBJ/p1IBW16YR3vP2srqgvQSna5BAZiAQfWnVIDB8IwFFF1D2evSPgJdTlOrtEHZWPKSEglp8DqaA
88UDieuKbOtpG5NhAiwKvlTrvQshYlSyEsA8qRheHcPoRdlUUA7hrMxMDQTHFicOAGApdVUz0rn1k+U
WSXdncXTB7XWqGl5SgSAJlyrt6EJPpXJGMn+4v5YN5SEE8at0a7b5uaWr+bd3T+0Gpr3GAdZlGGIdUkp3
wHgdtGoU7PzaGGVG4LTA5w56MLK8pIrAAm1Yp+ZVAwFYfbkwR2fnl5dXED5TNtULudYUeUVpVT24O
nKnipMzWLdgvatd+7Y6x88gi6aFVBS8ZTYaABKsux5x0n8ihQWqH6ya/Fg0y4u5+zi6rzF1WX0n86vrCyFK
qfzOe6VfjmLo8rTq5SPGVZ4GNI2onPKDUwTPLDWHtv7dzfw9jHp0IQQAysnRU7Hzsa6rT28gxqP+PTZKy
+9YEuY1Wk0kjTcCR2WpmNnlM2OhKztH9khoG+hPfpo6+r+icXQ3FEexmC0aKiSNDQ3nIHo725vIlljnudc
wgftKg8kliEfDTGBDLDmwzXVuDA/5eZpAWcigdeoBAlp3zDn87I9aCaFU6KiONy9nBtNeUprCoCiEpouV
hK1pl7D4r7ce6XM9QCQuLN4eCaXdbOtYhgy8cquOinJvGUcoAqtyQGKQSVEC+T5Ls7NY4KxRKIHcuZw4
KS5W3DQWfomjJCpPqunQ/K7AoOb4LXBaRMI6QgaoUmOEc6GqlFLUAcIbRRBGgZjABDfgHNrdkne/hH
WSGZ/bX3HKhXaUKXtCABGCy4ZpE9SdDfn5d6fbDyBo9+EjsToi0kOR4U2T6OMmnDL8sm+ncdhS6dj1k
EIlLcwTx9PQ4tkmtPQxZ7PwDWwlhmc72mw0rTf/fpbniXX6TZsYekcym0JhbRqx8daTcF9BXpWTI/s1Zfh
xGM0NY3RIkxMi8e354tFxjGqQOEEqChU7/hqtYQTVaUjuTCS1x6GbYoO1t8794/tnfsPrYJqLgCMEgA4w
rzbCDY17ML7cvZzP/klLxGzh3MVCES9PI2W1nYAXUmzTnCq467ZAR53h85cnZqxIB2xAfHuYarOXbnK92
pO2FuSWPiswi2NqtYghayLuQlwrXigjwbI2q0blzHROZuG9yQ0n04nN/D6gwxaj++K40g7ZhCCAUS/b7Rl
COkHkCfHxx4C8xksBEhpiyp48XBt3cNaS3iupeMy2ivlZhZdbEdQFwX5lb0UU1gHUHXQKOLXpWrdl21r5
YEyxwRYLRbso7kfPbhnly8wGJxFU7PKkvfpX377wQfv29Vrlz1aQmdyzgm/lQ6SVumgGFYWlt3BlSUoTqX
h4A139NJx+LhCf4yVZsQUo5V50/SuFvmdaThNYWuGbmf/AJ5atoOTmu2jaTv0uRZZajJkdWXFHUxVkwl
C6yQ4ihdr+fjVK5d8albJQSrNqfRLJbFHQmO7iCUtZiK2UEBxAbwyANcCziy+RRiHb/foyN5//wO7i+WMJK
BdC9ewJFlPxJ4rRO0nPnsN8y//Am+ftkbCcTs5xCrjcM2gTWVdJkDFTVXYQQ1pdet2eLzvSR5ZwFhuoXGC
EOmgMrYj9h+/9p7dffDAY6wHe7uQ+7Zdu3LeXnnhuq3MwyXoqNLRPiwY8htSoBtHA/70+PETe7J3YMn
ivIWmFqw6CllrHLEwgzjNdZU/+WB9A6K/RKs0UHDF+jHS07YaWr4PpxIXnWMwL0G8r19U8kMGIZjEFic
1T9u0H/MeiVkB5yxFRwss5aMSIFTiRcxqCEldydpYj42tXe6xgJbDK4YOdHFWNB26RjtkjvPcv0CeiCqYjYYE
9McAVRpo5dyKTzULtJoEkAZ6uP7QcwEKubzzUzkoihMKXI8ePvA1THKGRgHFN3GS4HrSumtP1nBgEDS
0GWQHh3XifKmaiRYcKl9iCaBqfZmsSAgPOh7V0ukxXdW1Zdq8gKOiRYe6D9nqnjuXTQvKQjWxDmhOd9
AUdEaBjHn/MQ5QpdXF/3jX+XkGPp3EkkaiKaxbDq0Z8twIlc3MAOQaCkWTEfM4n1JqYYRpm7ZrGvwGY
zKfD9vl1RnOP4n8KFo0QBnlp2fgpgN78+179vo7a3D0iE3NLNsl+vDKuaItFIOWsDr3qwRsKB/joPTMLFRJ
oa0ofcswWuh//ff//t+XTlVnS+1qnc4QMRsrY0deKCZGpWBmi/CgeMq+8Xt/YJ3KsaVxNr/0yZfs86++jOof
+/IO5XWK63VHKdsr9+zhxomt70H8gxD0IeR8EMWkJuGYHcui4asnxz412kfNqwpfG/PRx6wHINP7G1tc
p4kOjNtNvNGf+OxzXOs5u3Vp0aLcVKdZwelreqLLEEFq43zNrpyzei/C9SP2a//h9+3ek30bx/P27qMdOxT
N4L76dPAQTbgPJdHCwCwdeVzFnNF25IVjDN3AI0UKMnilAy2vCY4RuiC0tuYx1wIEX5lRrWrFl0zPAfieHK
5A2AqYXi3y7qOhU9G4B/OVwxCNiErg4UNBNI2paWBppO31NRwYQAI90np6vFVAQF/jWDRxgLSuahrtJ
G4pxd6FCgyxDrcfbuAzlCyUmbUHOyXbBZAl+RTcY7IwY7jDntEk8y8ePaafx2jiXDpswV7dLsxnbXU6Ybcu
Lto5gKGZqSpjqDBYEU18sI+igCZlskWnFjBzDxdBqGh3yMqHx1Y6hNIsrcBDF23zuGIlQJaYgmsm81Y5qbo
T3YaCcEf4DHyPPm2UcZoPN+zSYtr+0ucv++LOEEI5gMtHoWJTWKo5hE9lMpXYo7URnqU3AaqkU4ZJbF
amceDSp3LcSpaNxmkgEpZNx+3h3XUIddE++6lP2AvP3bAmXr6SeKF43AzakY48qgzsuIEXjYdqkaz10J5t1
PrhCZ4npkWL1bDNHmMNMoDicNXyidVLR9aGfgwg9HGchauXLtgXP/sp+8THnoPMo/EZuHr12J0mmc
8omiKWnfI17b1Awh5uHtnG7omVm107KNftoFS3qfkVQIyOQ4swYuBAuQqTfEdlXiVzGTf9k3JBdAjavN
Mo+zofLUxTEF/5pJrAVDKxTLZyEs5Kq0vrarFgFzCOcepkLrXQTdpQlEF0oon5jiEIWlBX57t1HCmtQNAU7
d7+LmDIomnxeLtwT6yNln1Hg0PozwnAVbnIPNfEFGOqtdxci+aO0bTJ9JQl8jix/K7cpM/rbduDrjzBWrz+
5jvcU5x+ksVQAbiU5zQ4x+Xc417TFYao2cLsjC0tLdsCTmgWcO9sbWPmcaxpk6aSJ/W/QlCohANeArazsY
Hy4vuFaWvQpjEKqNYdOrWQxs3B19UfAoYq4wy57vRMwabo1wGC8tLNaz7+cnYFSAX8x/RvBmstJ8rTT
gVU/spv9HX9br489sdnDjgcCy6mYJamThvtloOsUm57atsNADo7O2d7cAml5ynWGaVDTpTet7lnFbz3H
oDV1jJcw8M1kuqOpk8BIXreQVKrtMDrwA62xUPLyOyA8xbsYy/csE9/8kV75ZVrcLGhNfFmmzL/cjQw7S
M4V4PXD9a3GJia5xp0oC+HdFIVUGjxWRpztQsnyyKd8q5lMRT+0UDLISrwnipRy1uVWynzpEHUWqF2T
SErAArvU0xXkx/y5BVdCDHoI8DTBtwdPBNlTimkpSlW9Z+yw1B+pjKYynh3h43nSgdU4rNAq7CQ4QfIyd
Oy7whaWJWotZhP3S7FHhx3PeSHa25xHB+PNsCpW05xmu4fXLt2xSMOdK8LjWcoYcaV6CzOnU7jPcPJ
K1W0v8w+zpuqvswvrfKXYQirggrcs43nTqNzCMTS4rxPdkS0uqKvugQVK2NBDZCrT/oomBbWTCGp5ZU
L3NsYLU/fCTs8dOxtb9hDKOIiXD8lbo0ZF240ZS16NDc3432lugnxuFYdoDhGOO4oSsWVvfCIvsDhf/UfNz
j2NCs8YX2kHEwt1FPWziGaTgUklOh8XMVLTWR9SjTPo42dbLX6PnBynBT0PcIUNFHh6ZkZGh5mELt0oD
oa7gPJVxKIklJGDIJiqY8/eGCxQBwONuOhpMsXlrmJvE3hTVar+8gJegzaEQjlrDXIeEyy0aA9cKcmA7a+sW
0RvMwFzEo4msBEKYaoWKdqlqbt7t07Ds7Ll6+4YCi4rQ7TdO1MKmYPHz5EmxWcsih2rGyesWZi4Ly6tlY
FNDGJWtqhpBy1X3kCztnoEwXjY7EEr9EeyppC9M/CV7qeAKcVAJp2TPMdTZmGwvBJ/oXhvopuHJ9o3h
5ujqJQfDMg7g4gs6ohBf8LYOZzWnEKsDS6AoM0VgXB1gxSg7b1uW+t9crloFWDjq2vPbSb1655RKPX7p
mqzih+3enU7BgQ37p6GZ9ixqayKQQCOWXsFbqTk6nq1ZkEYxqGQjGGO/sntobyOcYKiNvLgaxXq3b+4l
UAOO1LdLLTRQRa95gCfHXb5fo5HOHVuSmc3pxNpaPwcO4BRaCCHMox6EChFDNV/sTcwhxUK2Hnp/L
ugAuoOiR8egisE69fIonGQae6mhViFce8++gxHvk2JpxORbVHlKCCmZXjkSvMowHgprUO4Bm4NothXjUF
GESCPDGaE6kKsuayNQ03qWWPhywJRbOH0WyXcaBefvFFPG1J2cgaCkwzSKGQMowCaHF40wBHqJez
k3KZzychIi//g0bY2tm1GSTXM+/p6K6b5a5/rkD2ndsf2AvPv+BTjArvCGgKfSRgcQqnKD8hgVZSQo3njuKc
RRUWGjHACJfipfp8fn4BLSRPfYijVQDU8o7R8Aiq5uM1Xy2TqIx/8UJ5yIqryiHQFLNmorxMJE6mz+8rQYZ
rCahaLNcGUA1pbniqKhgqlKUwl7htGmqgUjsCs5ybvf19Xg9scZE2jfErYpopa1ghD1A6ddvceGIvvPA8z3s
e1tK0uOLA65uP4NkNTwBaXZoFJC0AFbcFFEsR3q2JjxE8NggtqDUR1mQaC5bgGkEr11v2aH0yQynHam
b+HAjPWQPNqlzUGPeqWbed7S3Xxs8hRKMeFlg5sOGhzRQzcG3VWECTtuoe1mqJuyPUDQB7YXXVri/
MWpB7lmU4O6RodEw0KqZJkuosFSC6auW4+2jNQw1QI+d2EU4uvl9rdHkfELVGaFykpA0hhjArHKIZmE
N4JC/dixx1MVXcWKtRwxzV0cSYJDz2S1eu2tXVgi0WMb3DMOfoTUwcpknmUnO+CnW8/e6bNrNyxUb
xGaQVLxrvtVJvWJ4BS9I5d27f8SjEdTTI9u621IN7sTLbSKFXOvEVkHSIkkgkSFrYFxt3+A5aD4sYjyUtASDiyY
jNaRaNAY/To8qgVwJ3yrl62lcJFKZm0GIqWjZZ8qEEDoFZRXS1GE4UQjRDgXRVdBbH1cSAKhxKqyKztKEB
cMRJW2hd+QNt/74WCMpka+6/M4xirod2UikB4slEg+K8yn9t8V2BV9q8N6CjaXs+l2WAzQ4O9zSq9iLCv
7t3DB8GBBcueZ/+/te/aq+8/AI+QtAyCFSldIirOnAtLM03QMCvXlhEA2KZaK/4dRwFUKG9Q0Y4Gs8AzK4
9wdG982AdXChrDc++AFC5frnSgB71fQYwEQtbDy0rHjyTgpYM23b5/JLF4ccZrJN8AYUTlY8ggb8CUGc13
Uo7zw5pU/lOrlWlUYdupJS7rzcE10kAvMnAPtnZodPgbjIRmsnjqwk8wTfvblm1oxxQBgcvW8jU/3Xikzp
molXxabIRgxGE3wisutL5yxft0tUrtkjDMomuhfolBk7z3zGctTmEoG8nx1VPJdMAPV5ftxlMY25ugYFV/S
m0JQDQ/L/4ZalU8kITS2gXTZ0qWVlRDOV++lIMOkMeuub/BX5lPV04v4wTgTeNx7+M559LMeiYeWXQ
p7LKLGeQ0DaqzByms2WOJMzHpSpOHdqN1+LwvmUOmluO1TA4mTpVmMxNFf0loKqTZQEEriRcdBya
lG3PFXJoZxVvEM3Q2v+wC4wnkKPBSo2x0RV+7jIO5sHhvoPYVylUJuWN5KREAM8J7bpMvypppgI1Um
mhZfq3WsMHgDLkc0Wo2RbKoGU3bl1Hk2q3loztbT2xfEbRjai16yf23ttv2q3rl+zcyqInuk/x8CU/3JeERID
U1DkoQTtv22tv3YZKiYOHwQfaGJqi6i1TxSJOMs4fWj+OtUkMqzZs1Ww6l7CP3bhkUdPeByoIgpVDi0/Pz
qNxC5YPyjKhNB2Bk2Pi5EuBngJVF1ejVL5cnay698oKUlW8PYi7Sl9zbfhW1zKzy/Z4v+ZzupU2miUzBYkfe
3hDWUWdoQLgJ+7Bj1DzURq8ujRjN25cs3MXaShmTev3e/0Ty6flzcYxZXF7sn5iW9t49WjWIOZKEYf1jX
U74bwXLl2gA2aR5h3nRJpEUIkfxdge3r2NpwjI4L0n5QM3mZp2U6JMhCcy5at4tedXl/Fqk1acLVob4dFG
DyG0+aCFICIUMn2KcIyCKuKGxkUbBFCBSdoSBpDi8h7Cg0PJJAlwrv0RiPxM3urNKu9jrgBxSuEuziv6oIrU
UgTyYAfDEM4LwoSmDmt2Rstr+LTHdVScTOZd8/O9MVQLAVJGfUixXMyqnDOv+YQ5r1Tr9sEHj1yrv/ve
e05LwmjKNgKpFLt4Skvl4LeFOdoYxMHZtysoCLWjynmUNaa8gmQccsJv1h98wNgP7BreeLXeRO2MbHG
mCC2Y8lCdryDF6dEsl/Y4yCKwWih4//G6vXf7AcLUsemFc17QQ0tnOox5CqAXs1CC4x1Lhfp2bq5on3rxs
nURii6WToKnlM556J+iCkk6IqgORNB1nGlUHd8FVPEpz+B3BYsmoMN4CZne4eItSwHCBk7HOA6fyc3Z2
kHF7qztOqiUeHyM1Ku+U48zVuCaPczs6mzOnr983j7+/HU0RsS2IfNaTRDL5BiAqBcfe/vNe65Rp6ZXMa
EAgoYG6fRABGnFpD66/T4meGQvvfyKbe0ewUO1jv60IIRyZtH4wz58CAAkE8pBjdri7JydPzfRDMoSL05l
oBho65MT9z77CozjCQfRCCkEQ2u75HCIHoUTDBMcWd78oA8HxVlR74xo1xF8U946ZNOdmm6bc2hCH
EE5wcGZRZvIjGsGp3R4hDCpvmnNltDcXvuVtnseACZQKy7LpWNbmJ9mVLBWWIxJaUlNFkxyWkUpAnB
fBfS79Fu+oAD6ZPvKMcLdZVzkjWtN1P0Hj2wL0390UgU4TXdoFcLy1EJ48/zMwqTtYfkaI+hDHnCbHe5v
2xGe+osvXLNYKm9H+BwCbxpuuVBI25N773tW1Yu3bjmfbjQ6CGUNQR9CKy4A3o59843b9mBtx+pww
zHnj6Kxk3xXEwNhtOkLlxbtpZvnLKRkFpxEAOMAlPLJTmGleO4r3/44oMKgJi94hDD90qjoCrQDQKWD5
Mnv7e1br9GEF8HfpufssMVnSNpr768DvhM3YVLnWjm6e3iMacnaJ1++ZbcwsxkGZKw14HC1MWq5AY
85wdko1zl3L2zrj/e4xshWzwNmtMGAQQxGRrZf2rLZhaI1Dg9t4/07duHKdauKv8FrFP5poFXqOFtz3Kj4z
wLcaLqY9unIKTpKwqOl0AmkVVRAMV85WHlMYxfOio6zCBouDAkXn1Wwu6ekF5yBLhz2EI+2M0jhWIa
4P0w7/aIMeXnpvioXTdqGsyUSSds5OuR+ynbr5k2r0a4sQBphlRTG0bLoqxcvIizTdoB1ymYyaBA5mm27
d+8DPPQrnnPJMKHhVCCCPsb7Vv2HVFpVuFWfStOmUZ9LL5WVYJ5kEOPQH7Tc8b4VsBKaEq4iFFrjtIe3
flSu28bWnlWrbXhpir6q4R8ULAU4lB6odVBaBbu3u+mpfLk0Dlw0adVhwhOd81GsRqNk67fftOeuXLIpu
PvFy5ewVHBTnC5EEO6fNtWcZVhwtEp2f33Hto5LXrshxTioxsE5HLUvfeKSFfH+2whvCh9B+RrqD9f80B4
JorKRfaWtwHh6fBuo4JSPJoeA6ljmmzJz+pI81ABAq9OS3b1DgCYeEscTxwOdyUILavYff+8bAPkAyY8gX
WVbXpqzT7/6Ch2NE4OKyjCQdbzGSDxtJ5xnff/QDkqAGoDkiwuQ+prtQ/yjkSSe7BLaQUVn4a+YpWAEU
4VTdbJ76GGjGDc+RItOIwjnluadm03P0iFo4CSPYOfEtdgxvxGw3AwmsnIZ3GRrehIfxapdbY/TZpAx12hGl
cVRQsrO3o6tnF/xTKcqpjuensHsaV6f6/Z79sGd93BUPuZUQNOo8sbjUJmNJw+tgZA+d/OWg1MaPw3gZ
O7ffftdT/pQ3sAJXF1TkVoxqkmE+3c+sGvXrsq9hfJEfa2U6hB0a/sAax/Kc80WllcAaNo1dZJ2FQsZz5rXJEk
2q91Wmqa8TyXpQAz4PZwXa5PHamnLnwqc9v7DHXvweB8LdoyiaPvqU1WBGQdVmaZvK8vnnbZEuFfl
smqFboxz3ntw12Pbl1AE+/ubgFSplkFbWcBk5ybrmeKMW63amqyqiCTsa994E2pXx7k9sDwg/Ws/90W
7uJi1RhntD51KQyM0ltNoXC2hVizWeT3vT3TpHz484H8G0G9/6fSJfqysIdDqnnNPkKYTk0h5JgNY4Z85V
WpjEJ88euim6tVXPmGvvHgdcpxE41W900Gb3X6wgYZq2RaNLTUxe5kZn3NW9T81VLG8LlpZnEzRgvLJ
oYePyqUyWuiQ645wiio2nYrZZz72nL1y47LdvLJqc3NZzo8J7qOxx12bohMngx4DoEg7XusRGkjz2rr+XczT
G+/dB4RDW1vfRaPjJCFEA7hnIjflkxXTi+d8PdY4lLRAGLCFVJlOmm1sJajK3OLihD4MlAsR9nKXQ7S3tMH
U1BTdB6ixGvor5+gQLaLCDgqNqeKzZsY0IaG83goDvLi0Smcr0K3yQWMHZRcqoxLygWQBTmkI+Mgeb+
zBwfGsEYKNrU3bwVzHk1O0dwlvG+lDi2nRnsJs6Gu0IpLK8wyAu3nzhl2+ctVWl5cYO+3AgpXDehwf7DO
GWV+y0qy1oUBx68EhVR9KG7yV4aGFhQWr40yFnbrQvWDiBCdWmWtaLu8akL7pAD6VOgpAsRZmp2
2IY5lHi75464ILj9qThv4p+pJCKLUMSbRJU9QBLJ429aDh3/f4YytOC6jfjmPpf3Sw9hYV7rX6UhfRdGsZU6
c5/k9/6jN2lc6oo6nEebVk2TBPKs/9B99825dV56cXLJWbtib8z2sGcNNaklHIpHFoWnZytE/fYq7RpPXKkR
3sPMHM9e1jL16yz3/yZftLX/yk3bq6wrmR5qBMbxPvuG0j2qKwUBAHojtG6+PgPUFLv/H2HTuqt+0AJ+
AEUGwfHNOOPfitytaMGLQMbdA6c7QL1kPe+WQHPcVQJ4nTCndphabCKfVqxbJoc4VvuvSFElbEK1XFR
VRDzo2iDJrJEodW/ykkJiokr1xRAZ+OVbJ1s+FFhbXmSRZsgGbXd3LuqFTdlM8trMCVBygF7aAyWfkahJps
4GSqDQ0o05PtEy+QIT9CyUPasXAGPlpv4lXTHx0Eqgt31AqOpaVZO39hyWanp2ir0im7Htd88vgxz9uuP
Wv1kjUA3Qf37njizrS8eJSRxqmnkBWWUZpUc/0bT3b4nUJvBUYcx1hz93KMsDKpdNKpy9HJnoNT+wZ
M8Z4KchToD2VqIVuu4BSDDUe0PbzD7Q8dbvpPn3/fw9f7uGbFo6QR2pdeccEu/KxKRx8eHwO6oRdui
MeySHwNiWOAuOAuqn97fctvojsM2oMHa7Z08apFGMwjHI98cYrOVHJH1bJIvZavlJBwZR15BTs6/fmX
nrMXXr5p2XzMenDILFKosIp2JaFRcEq0Gu8pU6dHO+pHdXv84LFp8V5+uugTF1otwNcwaSkHl7KCYghW
AdOjhXaammwDhCLtUfqfekvOkEp/9wChnEzV8ozgoR/C1WdnZ6AtA8/6Ut18Bf8DcLZOo4pzMO2J1srX
1Vp2DdwxDti0eDHAl3eutDovLAxwFPu9hZMiwKiPFY4Sx97f28LKmM8AKQTU0bQ0SgF59Kyx7ScPcNzy
0J4V2xZt0iwewtTtVO3ShVU3rZpQuHXzebeI2UTURigQ39oSh1GlKGVqlZ97dFK2r371TS9hv/ZkAy980XL
w2N3Dst18/mVrolmVHCPhVaGLrigYWnAdfh3Bgt167gbX6ENJsi4AvbYWEtY9I0z5DG2cJ4Unk2jfV56DA
vF3Jpf2KJOEVtOnqrISj+Hw/hHHH6tRhWFpBOcPPDwdEJXdoJPFXY6Oj/hWcFLIS7wQEq057xZeqabe3E
z18Vbhs1rEp422duGyWr89BalX9lMLoNZODqxRObE6TkEKE78wl7ePPXfVXv3YLbt+5aInUNThYyOkTm
VrtFzZ59wVzkEzKs9UNf3f/eAh2gDtg5erHIDp+RUb0SkBeFcDBwzWjblNYWKTVsGEa7c68VlpCfFGCYaei
2sqQ0jUQ1qvh9ZWRIGb88/kfsrxqgFMpet10aaMjHVqFcar59EPgVtJxvLqKyU5m20owB7nb3hkolo55jsj
18Liv/XKpLKgZpjk8GlmS1pZWl4LyxUTlfOgjdjaXE8WSbNUXXh+B22ZzGrzMjQS7R4jAG+88547OZrq1uY
aSkCOhVSxJuFcuAWQBExlJokvX7p03q5cPo/mxKnk/HX8AOWkNvHutURd2lvbt3MB16ASRs3AaUWrxv
akVPE2ix5FlSc7wjJoBQCULAu4pQ6VjJNFSc1OzzgVmGhIWWxRpJALwx91/LEaVR/pcQZUJVOIm+0e7N
n65hOftpTX1qThXZyTBDxHRWjXcbC6prgj5oKOUhrwZLntwDafPAE4aKxCCkku+dRms3qMqTfIecoDzpf
Or3otVN2JKvspkUTg0t3qt1p+srkJv+T9Q1Wp7sJJtfZnjPMGB9SNK8A9Nz+HoGmJb5vrQFkwm75nPvZm
/d5tOjLj4Zb9vV11BAMtoE42ANaacqUgasm1Cwd9KEdG5TqUyY8sevhONV+9EFunjqMnJ0apkZN5/ipOj
iIDys6i4ZxXFUoAVUoLBqtoPPMkE61eEBBkIbQCNa7cUWlYrp1LTznPV7E635GFezOuPg6M3CIo6WSAM
ogBDlWAHg0RFBSIIiwXL1zxWg3qv/lMxBKjsq8/U1rl8goOI33MbdsxwqTQWQHloRvdY1wePX6Cb1Cytb
Utvg+Ny8/Sv0ogSfIc6lZv2DQUJZlOoPE7WBVGGV9hNKgDxoBdvgjFi2CBAa+23JSJVf+owMgM14liGeSw
SVh9oDlC0JQ/wvL/95v+Dx/iazqTysvsojXEV1UgSxs9KNkiHE7a1s6Rvft4y6K5OY/5nZTrdL7GAAmigwbD
Lt7jNh14QAcoyB2xlcVpu3Zh2V587go3Kc9XOQFazqFsKc6LRmy3Q2iAChq4ibbetYdrT7z8d2F2iXYFLZUt
Aow6HRfzuOUJ5qwPd80Xpvw34ouazTmr1d84OeKcLUABF4U/ZbMpj7fqtfa912SBeNbUzDTv4UwhINo
Q2AuRASCFVBTeEZ0Ix0JWDHatctRCWBEEzKFmuRo4jZrok/nXphtIDfcCFQG8TQRCfFgCJE6phI+DgxOsj
KZjJwsKVZtpRJvbOILxqAQCJwiBTWktPkIlwQ/gA6TxBWSOtdJTlGlrEyGFnshHaMDPNZGQifLdrgA8ts2tL
XvxpZdsGW6M8vWH1lydlI5QPmkLcb8JPH+F2TbWt+3u/TXb3DmAr85bLAFtwWQmcVRVGFlQG+NnSB
NHsIaBcdva5R27eRUeDF3TroRqg1bkqnjJZa6peX4wyi8VJ54AVdAKYxn/kwDVM89plKYTD0uHdoDkSV8
qg0xOk9bh1Bste+sBXLNjeLh4sUi7+CE/xnw26PQTG7QqVjre8Zt99ROfspto0Rk0bK+LOUIbiG7kp+Z8frn
dwTwOovDdhj189MD6mBTVa1L8UtlTV288RwepdI3ioJjHAHQCLaWdn7VMRDNRVSWzINkqk64kCPGs
ZFJ5sZHJqlTNwMzOAgZAiPnVKkv9VWhJXrh4lGZtQA0aCNBJO6NdVXRY/FHab1EVmBFILYkuIVAKX3neK
+eQ0yhHT4MQR/PpfNL0cuZU8Vr5C6ooowH1jShAjjSxlkmX6eP9nV072N13QVRMWytz+7QjgGcuWjNT
nEc7jXwmT2Urpa0voU21arVVV6kdSO2oaYtzOV9t0IbL37x+3Y6ODhG6MNQtCxee5z6aPpWpBXYxTLN
2O5TzJhN//9G6vXf3sT3ZOaTNYVtZuch3VNh3cn9K5UPO8SNKdmVpypZnMlZIco9QnZOTpi3MzNm5Jc
DLOIfBg1DnMVPlxoJaQSTkkdTvf/xAQPXApHqbh7zCfUClKVVFRhSPC0UzmPug3ds9tvVD8RrFY8MeBSi
XSqiWJk6HkmPHmPgLdvXyTY+dCqCe7xiCVKPtMtm8pXKzdvv+E6R5i5tIcB5lSwUsnU9Obgwwqyx6Kp6
xBOZoFycnnytguk/oBDkfaEsG4fjoAC0YtDTaaH5h1uZwalShJQXN0POkZ3lpwzMcLMVhOa+y3bWhmfh
3FA8XpTiZrMBZkcBJk8ksa7M1FQhTdGAhHrb1O3fxvvftZ//KX0FjTnJ3pW08oE0bBNxuU5sAI4IemgFAD
LLCX0r2UZ0o35AMQREfVD0rZRNF9Xu0ogSiXK3Z9sGRbeLlb3AtMGUlHFg5JFOzRXcC5X0rIylXmGWAA
Wuza7N4+yXuUZbm1vXnnafW6hUsnaISx2hjFUWeQQumbRGPXIsHfe0o7ZKGz0EZqs2+/ebvf8O2FHO
uKyMuYPMrF0wFMFT/QXX90/GAff6Vm1ZIBCw+bFgVLa3EkwvnLtnSXNHjv27tnZryv8ApULkGvc2b3//
4wYDKN73+JyOn2GEdMKhohLaP1NRnKKK1OUk7Qc3f3cLjB7CqYKKa8GVMvUq6XD0/a5965botzqStU
W1BsDtoAqXLARC0ljhhrTWwO4+gBw2lwdFhsRy8COcLiY9pepOb00yTMu6Vm5qKci5NKNCwBny3hb
M3VcjZ+dUVy6ZTdn5l3p23WbSFekgeZgiKoWU2peMTnLciQ6tchRMAoqlNpJsBVC5oCDB5PJT3xWM1X
alCET2eS5tw0/wXtgWE4rXf+30H0lf+2i+g1VteFEOlxLX8XKtgJVxR1G6A+5Q21YJGlJXzWq2Qhe3Qj/IHlO
2VQOiwDDhkmuVSqUjtHKiVAAEs1QhqIUeqVGraBqb+IZpSVVJEy1RmSEnR2gshGcv6PaTyU/Zgc9v3pso
mMoAey1TMQ0u63Dl0Y1RnLDcsDF367K1rduX8iqfl1asnXuwjThsG3GsknQOox/b1r79lh0cVS2aK+LMp
8EA/IGCvvnjLbpybt3HjyDI4b0GEW3NOqm2rpT0jfBnNAip/AemfgBXaIBSqyuEfdfwAQNXXMFmIsI8PH
QvrsU1M0gnEWppAJXZU7S0G33u4fWK/+Vtfd49TmmC6mLTz52bt+sVFSDZOFh6/ytxoZ48AfEh5rseVl
pUwf4q76ubOX7hsu9t7EPsNm1qYN5VAV4ZUp12F4x6ZYvsNmVm0lurvq77//HTaXnzhBbt69QoS3/Wk
EEYDjhrCfAMMiL/2CFDlvyyeshwfOVdNvHnfzQ+tHUM7SMqVtDEEDDTGB0HTgfLmPXVPYTH+agmLykR
GewPL49HKBO5r7VG3R39o9mkSi1byiqgTxhFzDeB1UgW4MfNKhlFfKvyk/AFVhdEESMCdAoDM59pRk
C/y9Sh8FyESV8a5mlTYS0GpNIXddpC+//5dW9/dhYapuiGgYEw0Ha5aDUoiL6Mg1G7VC1A8vA+YlJuxtv
7YXrl1w1Lcew6un4fOzE5nbHoqA2DLfEfATKNdCwhayB483vWdAI8rVehSgj6/bF/8zCdsmTHo12pmOJh
RBF4lhrRzoRJblO4oy6zaBo5OHTiY3snc5x91/GBAlenjwgzb6TsRX4d/hBcu7qQpOUSZm0l4eOjf/rvfQiM
2bXZ+2l58/iKac2x9N/MM8DDCOCFB8KDNw7rtlrrWHOHVhhhcNFmYQVK5hj4mTNOh9W7HuWUfz1lF
LqThNCkgc12cztsFvNjZmSzmJe2ZSyp1rqwlbVE5woHy1Z2YViWEyPsXK5KjIhDJ0VN4RLWvlFsqOMph8k
VxAhi3ru+AUw79D/jxApwiaNIQOCPyWPleTFVQMO21DoKI9qOh/gt9pmeDkbSimL2fzM8jUOo8ShNUe
M9DgrooA6rr631vg+jD6WBOKrsgLJxfyTKiCvjkCK2sAHQLx2EDp/M23vv69rapoEYhlUVg41bDEiaTOUz2
LGMQxyLEbe/whOuM7YY2JW7WUAJjBBbhgxLM5OM2B1i11kmLGzNprTdGOw4TXghN+amqsPizP/NT
9urLN20Mj2kB7ABKIZ9N2nROEwSa3UQo6Uc/uJ9vH+qc0/74o44fUKNOOJpCLToxww6UcDh4pbI6XTk
enE6B8m3MQ6M54Mb6vn1MD77Sg5+6NoHbycNrwp3qKhn0/n17tHVoF66/bMW5ZTSwpuF61m1gc
vy+xvZo/RHnanLjWtcOaPGun3/uitcxml+YYoABNeAIGudEcBTScWeIduUzWc99nJT3juI5T9L05BSpexTS
0vtng68O1ecDzimP2G+dLwqonvugHwkkkllxLLj4an7WthiwBoK0eGFV/qyb9xGD4EPAOaRF5eBJu+pN1
6oCGWCTttX7Eh4Jkdqh5zrULh1nYUJdXxEMHTq/tL/OFRzLakwmQTSXP5TFwdmrY1n24bPrDx57FT5V
UFHmlJxBgbUL59AEibbP1Dy/ohSKjGTTUSwoVu5gE0uVs1s3L1suByUB6JpN0vSwkrdVVvPe3Ye2vLRoi/
DkOP1OD+OsIsD0qypfox9Ohd174wc+fkCgTkIsflU6RkCFjrpEq0z4IQ6TzOohpk+7KM/MAlA6TXPXh5VD
pJfnmBqtVK1U2lY5qFqngROVzGKq9q1U69rSufMMEiBqVS2EBq9pzr9ZgbOpztPQzq0u26ufeBEnKg5oV
foR2jHQeiWFhIJoRDQZrSsWJ5WcxUG1+YSC4Zr/17orURHdjcyeQCsgSJNq+vNsJk5A1cyOZl4mwOEH/qt
Jh+vzs4c06ixm9V/9yr+ycq1q/+X/7O9YC0CCEfpI0wyTn2qCVzFVhy7/aZWanAiPCHAB5TxIEeiPYCgw6D
gDqo6zgT5rJ7/iTb6t8ysWBlhpIP6DLByOIE6kdrTRZhsqtCZq8O779+zeg4c+IyVHLqzYKMCWw5bMFa2D
V69tI5WZpaLADcZuBnMODbfnrl+FMtFP9HOY62pdmYAqodRaKhVh1qZys/msnVucY5xQSro/b/V32v+
DHj+g6Qeo4hMjdYaASofpfzSkwcDcQ2JVDTmW0vLcHBqUoYnAb7hZ8ValE+6UqpjyrjXaaLv6wGJ0Sn52
zsr1mt158ADHKeDLd5v1Y6uVD5Dopi+xff7KRbt16zmbmiowLmhPtAQ2Bu2KZz1WQVw0Ex0WwelQ0F
x7WGkxmWZ3UvGkm03VgBJo1GR6zDtNWvMMCEp50xy8tLA+UwFfzYc7fiD+Mo06zjSuTLIH6nlkR1q9
Di3TbxMxHEK0ujQ3/eaA5DPhCd7Bk0n/aZmweNnZ4J1pWpl8JX5o/t8166lAnJlNvTcZNiAvh4SHNLKMn
Z8C8KjCofpBdxaAp6vN2mMrDnBV6WX/4MTuP1j3HIHHaxvOfdVX+blVawdUEl8CrBMOcUwzVpzK2r7
qHWD2FVO+sjpnU+mA7e/u4TtMoWlzdoJSSEYivhHFdD5t1y+ft7T63nv9OwBV239QwP6AQPXbnlyTh4
ZA8/6aPhUItzAvxwBVqXnKEmq1VeluyGcBS+QztntybB+s71gVkMYzCzaVKFqrVLMO/FOzJCU89v29bTQ
dDtZIJWOG9sJzV+15SHqRwVcMVMDStGs8oTqdtEd8j0HU2nvt4amtgARYWWzXOvzTTisCtNqs2KDm9
pX2Jy0q868u0EAqa13PdQ3ln/agGKn0ZC/9yU1PNKtAo+e+xFyA4+VsWCZR5Tv71sMUa6CVCyGtXTo58
WlE1c0PqU7UaZeLA6uN7mRxeiXDCJy+crWLwHAdfWdyPfmE9CSNURsnQiObhlZzoVI+A/eEtfCpbu6z0
dKKgKHPnE08YJ2DcyEoMtky85pYuHPvnt1Gy+7v71t6etn60QKOGlqTe0yk0qYq1yodqjoHYXiOT4XGBn
Z1JWNTubznQ2hnGJWUDIguQdsurizaTE4LLrXRRsr76uxQ+z9CoHK49HIBXVOdxQ3rcpNhM6sxMKUS3
mGzqkk+CL4GqY6XmLcugKp3+/b4oGL7FbRdIAtLpQN5T/PJKvilrW6ODrcBzcC+9NlX7MaNC/BLJBIwRV
xI6GuuLVMJDGlCn6ZMbjgAWsYOHNWg4g3+d9YVrh35ptd1ov1KjNZ08PfeuL531oGT5zL7k/VOogHisa
oR4NrrrNvUHbxOdIY+C4NzbfWBkk8moTbNJil7SnVjRU80gaDVofqh0ty0jEWHtL1imxIcFS3WDiNcxemK
jjOtqkPX9gf/tNWRwKoJEF89IKHE4riXz3M1SE6lTPMYC6GiEpNzSGNr2jjB9dKet/r44UP7xpu3bW2valPz
S85hB9ABRXKQRyzAwGcOlVSdCLTs5WuzUIJpLJAWAmr2TMpjhNOWsCvnlqAAiv1qnykBdXLdP+3xgwF
V/aRxPP2FhFThHQHH80kx/1q5uHl8gNbUrNCUc1AlDHfxdpOY7cd0wvuPDvBKldyCh40JV6KGiseqcPOV
S8v+mC1mLSGO5IXRMN/RuINHHa1ZGA2stiJ3UHqbGEiBS7E4BmHyXT7gc81SiZ6Iteg9xTVVW1XesTSpt
JYOVd7T76Rx9dBzUQE9VzhOG/cq/qj1PRMQ65+AajYTTdhr3/g699W2L/6lH/eZIxXuEO9UToHMqhYbq
kySHD/Ju7Zf9AWBikqg8ZX2Jk2upTRaE6branjUxgG/kaCoTTrOQKvZHcUlFUcY4NgJkKpBpfTJAM95CyBz
v5xHERoBbjLicuIAIf1aqzdd409P521j89i+/vp79sH9x15YrheMwLfHtorTqjzTQbtuRbz4T7xwyVam1V7lRi
CUiuu2217D9jrOcz4Vh+e2XahDkaT31w9z/Ol+PemryR8hxTtt6AOYTiVNJWcU9pCGi2HGlBGuTbz6aM7
ZfMpm4KstHK8xHmWltmt7e4+smI/al7/0CfvUKzdsoZjyLKpwr+3LlaMMjjxabR1E9/NXU5IKH6lQr6RYg
WK0h5wAmnIGUv2VaeYJv3HMTgb4ND55JqP6q+/JmZLTpd9pMZ0cQwX9FSdVUF65rpot6rT7rkX0Ohl
PWy4rU5mgByaCIy0YxnSGAYG8a1lbmWPtFKhiFIq/CsByrBQTVbqfECTYw4QnvJdmC6hnTpOAesZRz8C
q70xuBygCugCO0ZAxGHq4SxlMumcBUoJGPyGQPqWr/mBs5FSeQMc0g6cNNtYeP/ENjb/82Zftb/0Pf8Y
uwUNHtFeb0ikxvlWpWJNHCmG7eWnVChpnpxEx74c4VCKXLniZUfFSxUwnnv6kuT/M8YNr1A8f9NvZz
6XlvOc4jtEOm8fH1mugQXiuOJqm6QZ04vTSRat0wvb//a237JtvvG75YtS+9LnPeEGEDCo1AAUIoJnxhjgT
0shvwvC6wBCnhsF0AHJdTUfK2fHYozQKI6ZhlqZS5+h74mnC6RAtqE+lYfx7vKktZxS4d80odPG5QCqHhit
45yrPVMkZqgmlBBaZy0RC9Uf5vv7TvfM90Yp+vYHmhB9H8bgBgEoLiSZo8zTtb+W7UvM3EucRQ6g4lHS
u5BXNWAk0uqi8ctfwtFVFK5Rip4kImWZtAakl37qori2eGkOT0yvWxrIN6JdoAm2MZlOqoLbGgXB4DSj5
EKMo4BUnRmjEhSW8skxSJnIgG1w7yjiiYiw3u2i1QcTevb9h33jjfU8CGsHZP/7CTfvpL3/BLizlrF2vQGO6j
MNkSYq8+5lizrJcR5Fqg6s6TZMDqY76IY4fkKOe/j07vn3t7/5A+8xvH5eQVpnzsGcUNfEEE5kU2rZoTTC4v
n5g69uTxXuqd6RKI32kNy4SKhPFH+WEKqyiztUGu5NCZtIeGlPAhPOkALkAFRqF4IUIBnRBRXwZSdM+p6
qzOjc9606f1rNL6rXbyRBtJc2lNUra10npf8pgEijiKTQTvGaI9tRS6/29smeIBSMJO1JdUUClhGCa5wnCJ0f
Hpg1wReGH2FqJrPxtJZusP1m3cyurXDfFPQGpcM9zDTT5UKqUbHV5xabyeRe6VEJasIf14No9peQEfC2X
NiHWnv2L8/NW1xJ0QKbPNNPjsVoESAXtRnj3MvECsLLEFFVQBpYKnyl0J/AKUKIJeiIB0fBL26tvpQAa+Bg
JEDwS+KJJwB/zxYJr65v2xuvfsr/8E1+yT716yxgQazeb9G8bAdVCxqFpr65iXluHuoHgKvIrAIPz0x8lUP+kB
2dUJtAh3mFXc/hov7AK3CK5da0cBUDKoNHOgEFMZBsQK4G5j6mVx6t1+R4XBQlpiPwQp0lpctrlRIvWlJ
PqyxdaHTpojCbOMXBoEsz1OCZ9KO0J74NTKjNfpkhJ3blsznMA3r/3GL6c97CKkrDlcCjRW9XvVEjhpFa3
w3KVe6ii4dv26MEjG4SStnL5lh1VtISG3zAamVQEU3jEID60Wy98AYCIp6tMpepPiYYM7f79R7a0BBinZj
GvDGz7yIpoHZUmWlt7bM/fvGWzM0VAxP1FQt7GQj5rWTSvsrmUJJPgviuYaFUf6Xcna+6VMqlVqQJXT
0txEFqVOlcERqsaRgCviICWuA/NWoQQSu3t5DXGpAz4niyKVjyM0ApCgaiaihAjie4UChiyUOLXWnb04PE
jy6rfCgXf3iiNkxQB1PVSzZKMy3Qh5QUn/IdcQuIqS8ZI6sUPdXwkQJVpkcTWueE9ZeYzAFlAUQEA0jBheF
8GTqcOCgJWEXKl3CmtTdVEpC1lRuRsiKc5NwMb0rBa6y/NpPlwbQCrvNV0PGPa+EuO3DDk3Qv4kGb+
6O5k4rTQb+LlJhmEke1XVFEFVsjXVHfq6199DU1XhBZETJUBFZbX9dKRkT16uIZmSdi15z+BxoxwX6rk1/
BqK7XaoT1Ze2gvv/RFgKm6XE0Hj3aXUYLIxpNNW1lenRSWQysHQh3L5DDl5ZJ72RdwPJz3Yk0ULBcVkT
aKKcTH+GoxniY2lFCjOgDThaQLqOoTTOOcSii0vkrUQkpLBd+0w6tyBrR7S6VctjiCKioxgBL45IIu4DxWoTi
ogPpTAyd1S58E0I7qG70nYVPqoepBRRIx293ddYUwW5yx6XzBFgpZKx3jexQycFZ4/Gn3C6hOxfypNOoP
d/yxS1H+tIdMj8Ak7afyjJJcLVPY29tzEBfgWtpBpKcYrEaVjhB/kxB62UE38XA5NLFQ5qEUAKV18uJSKs+j1
Y5KkOEJXuXEQZBXLk0n6ZfzoKRuTfGOtYIUByCcjALQhj3eObYttMC9tS1b2zpAgFS66MjK9b6lCtOWyE4
BVDQT7daWjloHVu/QRrS7qlorvqktwTXr1FaWVK2Glpn1UFMHB1CFLIZIgASwCvVQ6UXRYCWd1OVM
Mfj93siaAF5FehXTjMXS7nhplYRimJVG3Xb3jzxDamP7wA5p7/r2niXSOdNuq01lIUVSFuK3skyT7CUVbIO
V0veySqoLoF1MMgopgUFtuCGQasrVpfdUij3T/vQhSClJR+dwa336UPELjZGSfBT28iXmu3umLTy1LVM+
k/Df6ut+8GQSE3HGP3nvhzg+EqCqWa6oeaIsnwaOhmrBq/N8Rw9JJzcrQMrEK1FESz/0V3FHzdG7JpWJ
FxADmEE8Wnd6eC3NIo6mmk4CRFAdx3sDKILK9KjkjJaIhOFmEfixlhofVtr2u99637719geANmXr+yXrK5
QViFssPUVPxPlO1abmFvCag1bBsVAAfQx31rJlpeNp0wfFR7VeSqsIfKoXUGrdVAyhaiqxGQdD+z1p6lEcU
rWwFF/0vT55T1X7JrehhOue1/1XBEO1nVQoTn+1dZL2PGiiBeegDaJH2rCuXGvZQalhf/CNN20DqjI1u4w
Aqb4UwhnB04Y2adMJxWlFeabg23JKo44TUTD6BSGWVp3M1PFQsjgWT1PFSpZ2MCrmyxjJkonbylmTd
RF45XCqGLO/y7UUO16aLVqS80gJTSIKpyDgEFT13R/2+EiAyuhOvEqXTCWGMAB4q8pk8p1A8KClbaVVf
WNbOkag1V+l0gmccpp0f/q9vNIYGlHg11IQrV3SLE5XmgsyJU2n/EzVjS8y8IoJVjCPpebA3r23YffX9mzvS
BMRbS+MMI7ELZop0Ilha/A9JTgzel6AAmz44kPt6UkPo/nQkLRH96JAehVu2QaYLZWmQTC0t1O1Wma
g4jgWNYBa5jfK71TCy8hNvDizqlIr7VCzcFoyrSiCkme0RktWQoH+iZOGgQF4aoOy0ZRgrSlRtSscS6IVDSes
btGkdlfs2eb2jtcu1bomZfQXMMHKHpO1wZZ4vztu6DflvPpMGgDVbJUsnRJiBGLXfz5mmijAIaLfNUHiUR
K+p3oB0qSiV4pQaAfFfDptq0sLAByga7xovAN1cjbntwLqfwqd+pFwVCVXq2WaMhRgtfPIEc5MhQEGYV
5ASxKbTGQYVMw/TVBcUdtf6/tajCfJ1QCKCminOplKL1aG5lQ5nD7nUAArmk5Zg9EbKZTE++v379n9h0+
s1sPshxnYANpBxXMZJC0vUf1OVcQ7d+tFXwGqfbCG3YFHYgUqrQzIT+dtfXOD9ssR6E1qQtE+JWBIYDTJI
S9b2/CoFKcoS3gQgntz05hP52bS7ppGRctOQScOD06wAPBEfQrqfNEiAqJdsgXSeFw1WBddgCGNaNOu
zSzOe8aYqvwJYIUcPBcvW2DRxrsCfQSvVBljWunq242nw752/sLinHPoSGDoDpg0tfpeYTuNjawRQwAgp
VcAKhpYwGXUaANWj7ETzKT19V35DGq3Ztn0fS3xSaKJZwo4VXj7Z66BY57zy1c4ewvxeDqBqvCJtKqkS6
Za03naS1X7NDUBmAoCKx95wCAFh0FPBlEISpIu7SWSrwHTXLxoQgcnJAWoFYxuNyaJKHF4V5PLtMdhb
Wpnu6WO7Wxt2tr7b0P4j2zh8k2LZ4qYyqblpqZdg+UUY4Qz3n/82OYuXfRBG2CSlfPqkwpw5u2tDbx6c
WJt01OwKIOt8pbFXN6KeLtKL9TEgEJubTjxPIBQ4bFumXZxD2NVyBY1AQSarVPFuwRtV90A7SQtx0caSY
6WlouolKbKyzuQMZ0qwjY1PW3HaObCzIzTDdWCxbhjWWK+kkFhL20erH0WFLRQNEQbU0xhSdYe3b
UcFufTn/y4TecA/0weC6NZI2VONdxRkwlXlRPtjS+NKzogiyYFoIhBTddAINX36iNtRKzKL/qxaA83aVO5LA
Kh0p94/hp0oYjxcEQCfuFVaYY6BPmnEqhqppaVBNAg0g4eCuEuBNQTtGo4lbYBmqfLYIWwulrWrClNxU
G1KlPLMRQUnwAVpwZ6oKwo5BZTCa/D1GtwoGu2jyP09v0NW2OgpQFXsjGvY7pxULGrz7/Cb8093w4
AySUjePEBu//ovvUBurSaNqtVxc+VmTk6P23z8K1LFy/4ak4JTCyb9rBRgoEMAN4x7dOeTrVmzRhZz8NVf
f5MPOcrLbXKFnlz7qfIhHPOMQOONtau0ZqhUwkbH0h6fixB44UiD4pvrq9tQI9idm/9se0c7Ht4S6+1Zm
m6OG/1mvb5UpWTLH0TxWJwIu5J0RJt4dmoVOzmjSvWhYZot8CZ4iSctDJbsJksfSnroFBYDE7NPcgvgHJ
yj5qBC/nUrzZTE/XyCQra7fFYxkJRGNU90ERKsZBD8DUiHIKQx7EmWlvPlXEoZaTjKQWqhoADoCqorUFC
ZHUlD0If41zU4V8BuFcGj3XUniRTyEkpTBWsxWeajVGYRRX7lMyhcufiuWGcKq336XdGcMOWrW1X7P7
WkVUGsDEGDv1oM5E+nRSxDx5smvbHWj1/wXYx92GcisSYzu61bO94x1poytXVZVtkEGfzObt1+bxryzD
X1NJjqQcVQevSwz5rBK9MMKiqwSqtJL4aVXkagOoF05qKEKBp+bzHNVQJRYOthYoKP6mStrTnsFuG02E
K8c49y0ucvSOzG7BMRhWco9CAqJXh03toWsV/Vezh3v3HfD9mB3tHLrSajFABuOzsvAWwUDLN9+/ds5
vXr9q51RXb392hvzu+T5OWfi8W0nZpLu3Lb3zTNsapjuOX4rl2lRZVlXMlCtYaAmbGxPmqeC3fFu/Wch9
NmoiOFekz7dwipalEH5+YFMGWKdHZOZ9mygTQpxSoOh0PmXBUhnt8IkL+Lt50Szv4nfhWiFqP3qq3ke
gQHa9ZI23MwCBjlpJp7RDHTfKetK1mtqJwTe1C99pr79v7Hzy0bHHB8vMrVpZZG3AdhCMcBjh0rnZEkX
OiSYPa8YGpnnyKPlyenwGgc1ZYnLHzK3BCfqY9ocS3ZBrVRgmFCmaoUojybBV/FTdVwohCUdKY0rgCK2
oWTVaxdHqGMdKEBJpUpSsVnkKjqlR6NKJSkoAYHqqa9iq/ow0lFEbTlG0E7q0ZJi1LViKzBjWEllQyzQz0Q
zToydY+AhL2DP2Dw5KtPd6yEpajy/3NrKziQOWgEm27euWGaa8Drf+PRpVWqLpaCasdbFi3tu37Jagqiq
xEBqukel+gz4VH25RLy0dop1YZS1NK2DRTxgBBj4L0l1b0YvJTaifUQyBlfEMAVfcSFLcF4I7bybB/d9jqT3l8
NKYfkLopOG2dQ1dEnRtSMawKnrPe64eSaFccImVDATKFoJW/GASMEYDS0Jp+TGMio4K/VTuCb+4do
WEafdtCs9QB+aXLVz1rRyZNZrgRpZMAenDQsvLuEwvgSNy8eslne86dP29TmPgcmnPYKrnZ6zQ1k0TnZ
7Jo9gBa1Kw3wrvFZMups1HHHq5veNG1cSJrJcCgNVHdBtooFrRW+cC2MNMvvfJjmFLaHkZAB10vpKaU
R9UieOHWSwxiCEGLOUC0wFDTi8qp7bRrtry8BLAizveiYU14wNsZ+QS8qNGRGUZ4Bmh0hFuRCuW0lk4
adu/OAzuo1+yA/tzCssx4IWQVr0va9OwiXLdoWvpSgr8eH21znrYtLiy4ldJeppfPLVoe3h6FV2tPA/VZgPM
r2V2rAqIIo6aelTuQkGDRxzOaOcPaSYVq+bpA6ceHUfQ9b52+/KGOjwaoAqV0v1rI2SVZMiUChC6mvFV5
j80hJD+A+VMslAd6FYyjpUQXognTLnVjNEyL893b2LEqJL+Fhx6JZaxUbdjGxrZdvHDBlA+6u72NJsA0lo9N
m6YV03E7vzDjWT43b1zmqhKDoC/f1v5G2lNV4RXxMuVrKhYpZ2bnoGQH2mac70ubKItLFbeHobil5hYh
FyELoeUHCEAqiuDVjmxzY91efeUn4eAtTHxHvWqzs1N2eHhgjx+v2/VrN7kvxSpV+C1sdRw6VLwzosc4P
9oGXZ/JfEr7istOJUNWzMSwLHGczRSAq/vsnRxTLTMPWYxrLHii9m0E5cG9Ndvfr+KY1eGvOFD5aZ/qTc
O7pSTEqRdXF9DscXwDFWRGE09l4eZZm+P81q1YZISAYeUGo7ADVCEtRTDkF/hUNDRlNpNDEytG4l36I
zt+JECV5VA8zmNsgFX7yR/Dv2p99INmbZBeBY9lLhWSklMh06+pTJWIXD+Cix6VZQ/5JIzXm2SQw3jK+6
a9o5TIsgVYRjxfmZuyi3C0j71wy7IpuBsarN1oomkQEn6vFZdCSBdTWylVbG97k99u4ICd2IULVzB9SoXTC
gCtsuyhcUKeuXTc6trc8gVxET4PemnMFIPdwzvf2npiy0svc79RLykkfqoiYYp+rK09sStXtOcTl/XrI3wAQgv
eROfuPfgAKrLiG7cpCqLykooUiG9vPnngmq+oohALRVtdXsSZUwBflfWgGTyGaMJ8IYvTRtMA+de//qZ9c
PuhHRwcOoddWFwAeNCqVNGy8+e8TQ0ERZX/tMkuasCW57L2sRsXLRkb+wZ18Th+AFTMl5IDdsW2V
R1wvjhtBWiEVhT4cWrafxTHRxPwd3SePuXwogq81iySTMUk+VlZVni/PJmsR9IkARCVmmEElacpr1v1rW
RuD/DutdQXH8ITkrW8Q3FLTZI+vv8B3vTIXrpxyX7ys5+wi8tzeKVp0xbeKualRGKtfddiu91dPGk867sbB5j
0LTvGw9U0ZQD+O7eM6YR2jNCeAXijnBfxOGWvazmximDIA29DF7TOXrGMthfBKGFql50qaB8nlWPXxg
8K7ZQQAIWStIZLfeKrTLnvOmCu8lBW/9T0LNdQmp2SQUJotSnPgdhBOBdXz9EHI1t/so1glkxbsg+BsaZd
8znVnxWPDNjJ8ZEnZl+9chEeet1UDLmFEO3tbtBOtGGuiDWh/2iGZqIS8ExlhqE2vFykBEFREyXOqJaB9sg
S5RgqCsMYxHD8ZvH0vQofw6goqecM/IiOj4ijfuiUPJVG1WWkLeWJKOQkc3RUa3gK2YDeEygVDFf2lLZ0
qdJhcgJidOhhtW9ff/exryFXEoUAoRWP2ps/jSlV7c8vfuaTtro4Y43SIYNZAfjm9eoLxVmroqXu3H9kmzv7
dD7DBoc76dPxMzM2O5X3VMDHDx4waHjeDL4cE3FU1Q/Ix+DPCI62di8UZ3yu328PbRtl0DoA9XB/z+u
Uemkd7kJOnfJOxQVVMn5pcdUBIiswwqwWp2YAGOevnKC1ura0ugSwVQAtwYjIvKvCdMX2Tw7tEy+/j
DCKE9c8BqzoRRdhCCH52kT36pVly6Qjzl+n8kXb0EQFYJ/h3jRt/eDuPdve3rWDCloxsWKpTMqKRa3vB4y
JoF27OGdXL81bZNiUV4knr6wqPH0wqFKZ0t6pZBwtGrSFYp6xnQib8o81jnTZj+T4iIDK4+wGdPZTEyEw6
lBODTrMv1aGax6idbREIwBItXWMb+cNOFQIVntNxRIF+FfTvvbN1/B4j9CobdfQUzhIN65dtk++/Dzaa2D
He7to7Z6lIPwtvKIWfPQIz7jS6NjWzh7mvWQvvfSyNVGt5eFpkjSACzH4htYoo6UFFm1y2wGoHcBhXfgk
wNMGF6lMxmfUtJBN4SAxOF8nxR0pSbpaL8FzBwgXvFeDjLZUQQgt1ejTFm7KGnWsAO8pDqyNkHEX/V
6VTKIkaO1ln0ql7RBQNvtQmYVlLt/3jWyHWBKtAk3H6afyib32ja/Zreev2vzMtE1PKT0w46EnVZNRgF7pj
VrMqNjsm7c3beNYfT6yebSnNqdL04a/9KVP2IXVgtd2jUfQk/SDzyjTNxOLpV1jYrYwPe1z+apKE/wRctOz
40cKVAy8A1RDpkNbgquY7+7RCaYejpVMT+pY8ZlqbiqeqEQWLW+YzyXsW29v2C/98j/DmUrZrReetwu
XLtLZWiKieB7OmDQc59TOy4fluu0dl6w3DHp57yL8Som/ckjmVi5YbaSVmVCPTtMLVwxaNZ/DH2KCRT
e0jaYGayof9QIWETT34sISIEp5qErxRwXJC9kM9xdEeKr+HYXyG82Ki6E8/1ql4YvnSifa1xRLcdKH3+KgwB
EVitNOhkcISL3ZdPOvTXRVaqeP16/ivFOFGcCi5J2A5RFAUYiCttR5/MgqOI3Xrl/zyEW7VUGzJu3KxRXf20
mgFcCU2KwZs2p7ZI93qvat1183FQuenp6yy+dX7Gd/+nM2hNvH5MXTJiXRRLBQPZVhx3QoHXMKwUn
x1zOsBFT5HIzRj5Ci/tkCVcnTsonaHK3S7NkQ89fT7xiUHiZR2zwquWM6lbcU2vbwuGpvvPe+1en0C9eu
WJ+O1PojZcA30X5PNretjNPd6AAyOGat1YdrZVBYmgqkGeO+vfPG63b+8mUvNKwE7lYVbqfia2hNbbs4
U5iyaTSUqjkr678wy4BLS9FOXUfg7Xc1+YBocH2vUi0NjUbK4fTohgUgDWY6kzbfMLeLLQkocA6jbnQ9O
SeRjjpn1+pRbY7cRVK1w/TRQcV29g/sqAyFgWPX6z3LqKYXDk4qnfccUyX1nEBxzp1b4ZozaGylFNbR2vB
xa1uvWfUNeZ+7ft0u4AAqPqxZvxQA115Ur7/2BuA1+8rP/ZTdvLZiO08OPZ80ChC1Y+EI7qr9q1TnsIhTO
w1fPaOjY3isnOI/X0A9O/N3AVV/deC/01sy4Vood1xtWhmvt8VzJXrIQZC2bLeqllEYqNHw8FSHwa6geUK
JjJWgCQqqay1RtVKyuw82bLc0ssL0vOeVqhSiymCqkkodMOQwdZXjA0/+lcOkee4cPG15dsouLc5hQqfw
gOfRWFqb1LXjSsVCSS2lgTfjUClra8Bv+mibCKZayYbaj1WDrorbmkmTpzHWchQ8bfFG5QW0WiqFJKDS
NVpVi7lXUESbvmkrxo5z9LBph2yFhjSDV6me2NHRkW3vntjdu+se263WO7Z0/qLP4uWmMpZBcwaCCA
/3onCXDev8rXOPOz5lPDs1ZTcuXbOL/CYYwkIltfIgZo/XNu3Jky27evm6FRDIEH1+FU3co49b9FU3OHBgZ
jmvtovPQGHU9m8fp1PA/ynS9/6kx0cDVJ1Rj7P7OP17xlHPPgrQQf4RpFw1qPZPKtbA7CoROIsnqoC4Nq
GtnezboMMA8J1hIGazSxd86+864DhCK24fHPoMkPby398u4RAVGZQcAxiF2x7BO6M4WEeWjEoo2na
ws25XVhZ8J7orl8572ZkOHrivu1e20Gn0QTNCIxw2aW05cmKljWbHteUAMGmHlHq5imdfsuLsOSth5hX
2SWcBDuhVdpOqNivTKRiMwRc19Zi0NDwzqR0jBOhh3woIyGQzYqgHPSJeGwwPMDZthGiG9iQQxJZ96
7X3bP+oZA/X1i2hVQL1ms0uXrFgQqmNKi4HTz/Y8YSRC+eWcbqaaMtNd64uX5qxS5cK1uQ3mlhQ4Tg5
pNIashLnVi/QppTNzaW94onKs2suP6m28LmmV330TsdSUFV//aiOjwaoOj4M1D/q0HdOvzfCjGpbxImG
GdowGrbGoGdP9rZMBWJVW9PGEb4YY0BS1uyMbeug7FsatvBCg3RsDFBV99asheZJRBi4Idq31oQKwE
NxmlKFOBpp2a6sFu3FuaTN5aftAJAp0F/XRALmdQy4NTulpcxaYbm5rqJicFa88UAs4/tQqcEJ2pdCI1YPt
wD+ll3/2KcBlICO94xHr0x4AeD9dz+wGzdu8VoaXNw0BJeVZm5AfbTwDuqAyV5amjNt5FvEW9fnQ8Va
U0HrQSkinCcOKLT0o17VRsZbWI81u33ngVX7I4sWp2xpVXv3D6yM9tZOKnLMtI2Q9vEP0j+RaM8WFib
pf8UkfVw5tB7CL4HTtqEBFUTOzdiV5VkraIoXQc0pfY977WDpNB1L937XuEpgf1THRwfUP8GhBGE5NAo
qy2pqA64ADpHAs1XCwehgZuEGQQY+hi3SOv4xJrDb4TvHdXu8dWDRVMGi8LYuTpSmZ8edls+8tNC0n
VoNcOApp2J27tKyPff8czaF9oorh7NR8kRpbZ7gS1YA4hAeqSrO29v7LizKHHpy757NzC/Z0oWryAhaDN
7bYmDz6QSORhigbtr25hO79PwnASHA0q7UjKiSjhM4M3fu3LXrV2+aagFoii7Ie0qcxkS483K4t4kTFIMTZ
zyclMnlsBgLANsAZgqvf9rmcjhj8FY5PdOAUml/KHa7/3DN3r59x+49WXdeTkdYrrgE/1V8VcktMV9dINIx
HNXQosde8/T6uQXLSekjwKh0lEMCJzRkO8cV32D5wlTWLp0753W+lNfguDxFicDqT3n/jLf+KI4/U6BqYZ
6Wl8jE6p7VkHqza+/dv2t1n8phYOGpmhAI0YFaHSCNqnX2pXLb1ndxhACYxdMO6sPjGloN0A+71izvesb
QC9fP2+ULS5bDI9b0oZZHV/GS454h3wKsSuaO+rp1lKqpeAN2n7fQ0OGwnWyvI0gRKy6sWldLstHqFUy
+HKws/LV6uGt72tTs6kvWhnj2+9pEV2vAQliJkW1vTLigJ35jciEWVquULYPwiINvrD1wb15xzxKcWNUPV
Y1FFQylbQsIxMr8rE93zhULp8u7J8UtRBfi8QB8c9O++s237O76Ntw7aQG0tzaF0GJFbcSmtLzRoGbD9qF
NQTuunpuzhPYjRaNq9W+Az/sWtZNqw7gluzpftAsr59DKivuiSBics3Kbmub1QwD+EQL1I5qZ+pMd8h6V
LM2zM2viiwE1R64aSr5+CnDqe2E6atJZmN04BB+PWhnyio1qkwktPtN+q6WyuCbOwaV5++ynX7CXX7x
i0ZCWhcAZ5YyhDVVlsNwL2cONPfvWm+9bTx45zlkVjzyayPpuKxaSQOA0oeprmF+l5SnGK/6q5TNaoiLP
uAnP8+/hyWtWqovzp8+0B4DCXlrtgNFEG2Id4N/VFnSlgZOG5VC4WKtHtWOd0vwkZPEknn12Gg2CqyIt
Pwhgmjv25pvveE2BlFdeGft0sFaH1nASlSC9srxk51fPeYhNTpg4pKZLfe0+z9sAvwAKX3zhps0DeLVnRHu
856EVKu2jPl+anbZLy4u8Dk2cJfSYCmVoRkqOr8bp7PGjROqfqUb9tj1xELoVwokw29zZs320To+OUJ2oSc
UTuBIDJsdgbg7Tlc/aPhr0N37vW/ZoYweNOvBsqgvnrtgXPv8xe/HmvAOiWtqj09EoaELF759sHOCAoVW
HXBPtqXVLijpcunLNqYMW9A3hrPKs++LG4yaOTMXy07NQkqpv2yiHp6VM/TYmXCWHGMRMCm2JsCg
/QAXbgrTbl34DOA/4w21VmC08m4ciDC0OF1YpnSgmOpPO85uozwiFogoFhU0bXqQTKjocsRMcSsVm8
1AALcVJ8r628FldWbJ8lGuH4fR0nDbG6FsE4Xvbbj/a8AQe0GeJVAanLGdf/swtyyvnFX6sAL+qdSusp+lST
Q3X6V/tHXUJuiHuqpk1gVPLo5OaNfswVPTU11v9aI4/Y6B+yI6cch85klptqX3nvbAXAxag87X5gpIrlBCh
Wv6avtOy4vXtI/v1//Dbtra1Zysr5+1nfvxLcNoBZh5tNVB5yrhP027sVm3nsG3lcs9i8FpN1xbhewKneOTi0
iJ8toc51RIMLfSr28n+rqWDLUDWtLaSDBASLbaLK7upAA/kLYWgYpjfLL+JAJgoalLTi/LmUWmMbdC1eEfl
YWjze7u7pjLCKi+kWZ8oXrVWeWv7Hgsl4MyAhnvV3rDJWNgjDo8ePbTPf+7Turxp9xZttttoVj2DPx8P2r
m5aVtYWvK4bkp1sBDMuwD19Xffsw9wuDRT9+UvfNq+8sXnbXvv0BPFVdBCQNXGHMpLUJ5FOp1zjZr
FoT0DpbSqnmn/g4kaPT38zcnTH8XxZw5UGaZJPI5mQOiVVxrGSTmqNOhUOBf8FeuI1hvb3HTesrmkz6
0rCyuDU6E0wN/5gzdxLob2iU+8YlOZuJVKx4Apatv7O7a2sQ1A6zYGAK1B2uZXr3iuQGjcYsAHaNuYra0/
YlzGXv1jd3fHyjhyak8qgSmcTtni3KzNzy/YzNwcpjnlVGNuYYZraIMIVbVuWiGiOqXKR4VG8Ff35tXtMOvi
p/L6ff4smbE+XojKDe0D2kOcpL2DQzs+qvieptBvS6aylkniYGnz3haaFWcxA7j6XEx8Pc/zONrsBH5cgfpo
WvXKpYu0cwbBkSDFfKp3iNR/8/U3XUB+9i9/0eZSQdvbLSGMYatr5SzUShVltLRG66imuf85HCglsWhE/
OG6hLGRiy+kfPj1/z+ZfkF1EqHjpgGqbwqBvfFMp4MjK2GatCtgJKgs+bDFYwEeeNfwq+3dfds5KFsEXjczf
87C8Ejt8FHDVGt9ljKNtCzl9bduWzI/a1OLfEe5rGglJQorHW8K7Sztsre77bWdxD8Uk1xaXPCQ0XxR+Zya
+ZnUEFA7xZW1zl9RC5lVrY1Sksp42PGx84QNTLRqg6oqjHJIYyF4KL8NoQWx7e5saf8rxScVBlMtfhVXW4
OafHDnnms6RQdKWJe5pXNWqbV9Q2A5U9qwWBq3enxoMYCfwGHSbNS437BzC7PcR9GK3JeW8+wf
HlkTgZkC9ItTGVqgjXeT8G6+z72qvPlQph2ATxemTPtxaY8Wjc13gKonp6D8NloA6o8wPvUUaNQzoGJuN
F3DfzLH2ixMOzgfoh1HgRiaIu9ToIN+HVNrXpl6/7hsaRyPVG4GZypsJfjjMXxTSzRKADgajNvF85e9JM/O0
SFaKaO6QB5yEf98sramfBBbQBNl8KQvX1hFq0zZ/EzBea3S+7QzspKHlYSicIyGS7mgMtXinALszu6Br0jQk
hnfeofRVfa7Fsep/M7s9DzgDnmJdq04iITEX+Gk0BoVqwAtk1WfAFBTrc6TR317/GjN3vrggVVaA3u0tuP
7kWrSYCZf9DqkbcCcX1ixSH7Khq2adav7loBYzCFcxXzKcoUsFKVoe/v7aP1DW8UqFACjNlkWxgZYFCWh
qD3TfFflJGkU9zqZmnEYngFVd66b/zZaeCGH4kd0/JlrVIFg4vPzoCVyZKRntYGYMtRVxKtUR1PB39LpqN
Wqx/beB2/jeAxsZnbBYnjp8VgODdr06iePaipbEwMUOevCC5s17SYHDdjZAA/aE35kjXrZ2pUSTtm8nTt3
Dm951VRgIZ8DyAr2A2Kg7JpwBJJbnaZ757Wq0gfH1mjg8St5BtNaazTtzoNHduXWJzw9cQDh9PAUjpL
WPO2h9bWOSbvnpRJJW8qoIskIDd3xsuLS6MqiUhkg7X+th8qqK2CpzX2VyK1A/uP1HRzBXc8F6La1/W
QHAZu3Jk7iGKqgtfzSqIkAPDvIfVf2bWVpxm5cv+R9pWJwff1OTlIcOrO46DNyfbRtIZuwIr8XG9XMnVItd
Tg71fIM/XWQ6vkZcnn+I9Sof6bhKd39t0GqB+bFQ1bSXlJf0ABFWFWqpwdwagDo0ca6NdEE+fkliyRyfKb
vKYmiY5Vqw45LPbRvlgEPw0lHVsZ8Vpo1QK/l2Sd2ePDEFgtJ++Sti/apl2/Z9UvnoRSqRhKyIHxYkQBtGKE
NgncPS/Zkr2L3Hh/Y/knT3r33xFpDLY2JWEUlXCNpq3UDdlTt2gLcdww9CSFQY7SeNh8b4snvH9VseuGct
XsBU8x/YB3rYubfeO+R1XsRq7YjtrFdQxgnU8DuqOHQqBCGMsc8DbHXtovzBbu6BFfOpqAR2lJc5SfHXj
QjE4tYF4dREyJh2tSG0yfQzkqYyWVC0CZ4rhbjcX4VlJBz5zUVwNxUJmc5zH2U/tFy8BDOm6aeGQXGhIe
8Wx8e/U/P+esA5e8ZHfgRHH/GGvWPP1RaUjmjbczR+tG+ra1teALH6qVLnjqnTb4SdL4BSC2KC0WT9juv
P8QRwwzCDZXoIu10cryHqa/Z+fm0XVqes5dvXra5bAYOyIiG0VphgMdAr61t2gO04/HRkZ0/v2wpBrHZZ
aDxwjVgKruYhxosryyb6vqrlLlyALRb88Xz1zyWK/nS9KcmF1Sxentrx67fuIlDiLMlTTU8gRtXoR27du3KcxY
eR92Rm8oncdJOGPs2nLLsVVOW8eRVYlwLYyLCBYKrghT9oSYexvbmu/fs97/2DYvGM2hK86XZCbRrGN
C9cOOcXTxXtFSkZZWjTQdXKJa1JBZohON5dHDitQpeffF5+lDFLTAlysuVwlSfOjqfnkOi8fQe0q5oOg9awz
0zmEIFtlEocK5jQBHw4HsND1rVApXUe/XCvOVxumpH275BcKO0Z+XDbbt5ZdV+7LOf9rVUKQazOVAuQ
dROWkN7/96G/atf/217vH1kM8sXrA/Iw2hE1Z5XMF81RX3RIWOngLqSolUkTRMBzVYdEKrWFA4Rf42/
mhkLjHu0Z+DZ98Ney6szazJAOamd3hCznobK5NFyqmc6tDKAT+Ddq57U7XuP0eAtu/P40D54uGdbh03
X3Eo+0VTxMfSnN2h7Qd2/8nM/bvNzmn3qcu2mHR+uWzJiduXCOZtRZhTUIRnJWBInstdRXQHaRZ9OF
3M2M10E1AD42yjgBiVpT+HxVGvUs0NCLhO+d7jvRSFa/QEm3+BaSbijAvOTtLQ4GrUwM29PtvfsV//tv7
d9vH4Vuvjyj/+4L5Bbmp2yTCJo25sHtnfctYNSxY75jub1tQRE2/fMzkwBuK598N67E6Hg9yrK0IMOKMlb
HrrqTmmrca8TRetqtbrNTs15yCkGSqRRtZeB9ifVrI40Xbcz8hqpYzRXrdlGO4bgmCvW76qgg2bBWg7uw
+NtzHXKVi+/YEfQjRpOUJo2T+dip1OqaNjI2DPCVHboHIDU3qbvvnvb7t6+C1DL9jM/9Z/Z5z77gvXg9qM
h51X1FvjCYaXi2WEZNPD89IwVVcqdfowi+cGQNKqiGrwBZXHQPkXHnzFH/ZMdZ1XnpAm0MlLFurTMY
8LrA4CwADDwmNF6uUwCbZEBIHA7RuHjL7/oCcQKOWmx3/Hhgb32lspPPrR4togWK8DJYr4ERMtBatA
JVRXU5gsas3A8ZBV4oCpEaxqxD6C6OFfddt29e81KaQ8m7a/UqpdMW9z0e020vub7aTPjrRzW6glaEGH
TUnHxaVkCTbm2cGZUU1Wxz+OTI59Svnrtuh1XenBNgFmc9nVce7u7dvvuXV9hkIRv6t5UD1aJNSqGcen
CqqWTvA9NuHxx1fLpjK/uVcqfqbYOVkEbCtOZvq1ODkFKKWEFbaodsyep0DiyaHxp/acNqM+GRhXBp9
+0N/4+Jv8IR2cMr6SLPayj1amTmWkteBvbHhzzsFS3TGHG9wTVTJeOhw8f+8xOCFP4eLeJeU96QbJAKG
JHh4cIAmcAVDFAoLnwcknZWdpuR0UxApbNZbwkTiGXM22UphUAEakjnLlcWgUsGGyAqtCU5soVKfBS
PnBhJU9LYe2Xy54Mo9r6KtUjWiFt7aEsNPni4hz3GoB+FABqyJLJOOeO28MH7/E3agszKgPfce2reOk07fc
iZ4rJArBmtQzV7MN9w7ynQhNznvQSiAat1q5ZG2BPw89nAHD8zBnycJS0Kc3nHJzJnz9Nx7MBVEycTLtK
qZebTcB65DM4AQZXwXeV+YlH8XgZsEdr97yQ2NT0PIPN52jJrW1M/VEJZ2eM2dYms0k0Zc7eff+uOzi5f
B5NqgHuWN8TS8qWxmNWwbRMIWvziws2Nz9rWouv7hKni+KAaKpVkwFjwKh1Tr5RGgOuImialmxyL
s3bS5CUHyqNrQokipMKIvt7FV82vXuwb4cHx2hW1R7t2cHBkaULOHO5WahE0jX6cNi3i5fOe/K3Skmqr
fLUFbHQ+qg43paKYsz5khLztVLKy1VC+uLiqq2cW+D66quxTaO9tRmyvHxf8sx7yBo6Va3yFVre70/T8W
wAVRpNs0IR/F8Aulc6sVqn41WlNfgKtdThiRr0SlVThHGbY3BUTeWt9+7YSa0Nd1323FVtZlvHcRnhnKkSt
vZ4UgnGva1tTyR+6eZVO7c06+lw8/MzFkZrqrSN6i91+pj8TstUIyvOAEtzujMCGNutSd0m1dR38ALYWBx
UIUjKgIJau1BJw6pmlRcxRgNH45panfDtErx3f/fA3n7nfds9KnsMNYYJH4wx2/DK5XMrrjW1b9cYkHWa
WBat9cJhm51CoIpJyyfRrgBPe/13Oor5dq1cbnpcd/X8vC3OTNtiln7DSrmXT0ulBTTdqnZoeY3mpp6245k
AKqoKnoXXzQAYmqsOcEuArKPwFaqghXOiuqIqcDuzvIgmU0Y/IMK0P1jfsaNyyxL5OasycHVMbhCAdEs
7Pn2p+lCajVHhsFvXLlkOTZoMq2iwzHfEqmi4Ng9tjquarGl43gBOKd6pXVcUGVVhsEAwjTJCFzHGw6EKq
8GRz2ZuNDWsYDmAVSJJB7BL+8rgFooFrxWgOv/7+yeev6AthLRY8L0P7tv9NSWxhG2/1LJsfh6qCZ/G+c
pACTRHn0zo2l3LJwJ2/cKcTadV63QA/xWXVuGJWRsMQ2jpfUvHw3bt/KrN51OGeNMuPehb+kFAHXilU
+77KeOnOp4NoDr3k7nDVMkLRwtW2y3bPDiwk5My/K8LiJKWTONpo0nCfEfz/nVtsR5N2p0HG7Z5WLF
eMGkqunZ8uGfd403GqWcX8ZpffOGWXcUZmULT1EtHvs4/Fhr5as8h/NW3xeH6vhmDBpe/IpxyRJIAL5
FMWKVBG5VdBb/V7FQXMGsVqtZZQa35vmwrYMCh0raQcYDWxClTxpNWDKi92uF5BKBVjGJqJgsV6Fu
jH0bY9uzXf+OrnAK+HJjsFjg7O+NTsq1mFQ8+iQM1Z5nYwEIDnKvQwBNOxuOINdtDtHHW+XcGTbw6N
20JBD44nCSi+GS+QIqE8WvaGwDEf6FR/3QHg0mvo38m81jyrGRcHz7ZtIebTyySTrtT1KejtZ6q32kwYJN
EC21ucVJp2m9/7TVbP66hIYN2gjNWLMTsJ77wGXsOgIb6qn2KfhuiIblOX84M55epVoUQmVttgOFb33h
zBFrNntEi/tIgfyj1UFEJAUDZ/fqNDtGLyfeD0I26vyfKIE0sniuwKlYsp9Gpgbgjml2Z99o/SrRB+bSP1jbsm2+
8jYJGWLleENoQgrb87Jc/53P7Nuqg6eu+/EaOnlYBtDsDrhW3peKUreSSXFnZarTJc0k/PPRyRb13T///dB3
PjumXRlIP6q8OrOpJrWHruzteCyCKVusrTRANFMTxiONwqG6UTK3yMW8/3LT/6z/7V1bD/L786qt27tys
zeSzNoV3rinKMOZaGlLKbwCo+ppo4CLioponV9hI3rgPKO3Rc4Fv8h7fxLHTQ2WLtDpToFPXqnddc3EIqC
o+JlDqEJjPDj3X9wVS/aaJY6VichEcRS3NDqNNQZ6pGuHXXn/LtrEmyvy/fn7Ffu7LX4Anj31pudb3a3JCwu
Eamv4SYBfw8hdSmHZvNyA/FaJn5XgmgHo2sDK9kyQJDgZfgf/9UsmO8Ni1J5Q8/MAogrMRtmwsjGkUe
HBE4KpDHLFf+81vWnMYtBvPP2/ZDBRg/8C0fViO7wYAK9j0gVR0YSC+ySOOVnN48t4ElBNQaaAnYBVw
Ze6luZQ7CwfmM33nbAPgs0Pvqbyk/qp6iUCtv2ff0Xn0mY5OD46JwAVOKYPH4uHnqVzBtBB2e3/f3r1z2
z798kv24tXzOIQ9tyStdt3jvb6DNbpTBTDiUIUinn4xzg3ShxrxvwDqR3Ao+QI3dsKcXLPKtKL5eLuOQ7GpZ
Gf4pKo6R4Ixr7+kukqKqQrkTThsuYXDVenYGNDGUxn5D1Y7ObZ0JOSZR9poQstHtH1lQBnuAijAcCDqun
TTGaAEJj0/e6gLXZMK4ABEfwVABefPDn1H7wmoeq6Hvqu/quTyXefm79C0ecXAS+v0cba01LoPWItz85
5aKCGt4TRWj4/w9FO2srpg08W87xatCt6KZGh/0lw2b7lU2hK8l5IgPqPHMwJURkb14qVN1VwHB8/5qz
rxG5hBlSxPZbJesVqJxSo2q+Ug2sdp/+gYMwmQoinfI1S5rtqHPwug49IsACLENVSBWuXKw2jYkE+Pah5e
GbMTTXcGpjMteKaV9FyzWdKoHwaqfqPu1XMdHwa43j/7vW/+dvrcDz5r9+q+Q6GXJdftw79VBlM7qA
RxlCRIfdRso1qf7OoSi/ouLuLN80r/q4sG9GwmV7TpfNqinOZ7car2fNd1n+Lj2TD96BeMpWuaoDQqTg6j
zQtVwzN0j9lxWSXTW5NlGjgiZTSLtIuAI2BEMH9RHCtt9S3YqEy5uKSC2xHOo53pVD1Q1aeVtBxLaclxwp
eCuEbnOAOeAClw6ZCp10PaU4Ouh74jLSlh0CEQNxoNS+P0nZl7ff/sc73WOXWcDUcwJC3a8rqkg87Qt9
CJxCbLWtrck+47yHlFf1Uqcn3jiddbVXmjK5cvmdQvutsuLc6a9tFSG9MZOVPP5vFsiNPE+DpQJ/+bDKiC3j
pknJXYoX1LawxWTTviDQCVeGYk6ss15I1rbl1z76pErdkdLcNwhcJoa7aopUkEBj+ZzrggCFxKLBH4fLoUcJ
4B7UxjSgj0ud4XGLSDytnfbwvJqcbU+2dA1O/1XJ/rcXZMnk8e7p/jIMob96iBHrw1yXjiurS/jebstBs+9fr8c
885l1YhtJPSiWm7TZ1JVU6UGP4sH88IUNXdGmAeGmgGSLmqqrCsmKSGI43jomp8SvIoaU9SgKLq0VpG
rFqnSshQGUgVVVD8NBoVgGRBAQGDHuBFOJGyNp52lYHXyoKwBjiVNO2xVC6XHXzShAKTgKmHDgFRo
BQQz97Xcx367hkH1XcETgFc3zkzvS50p++fHQKpkrj18NoGgE47nGg3FW31GBE14ftalSCnUTUGtA6rkJ/
ybtLmaYVszon8GI6r+lHP8vFMAHUC0bOOFlDF79AoChnxWjDWmiZ52dKIWjevzP+xABKKWiKT8fpS2r1
PWVgqn6Nx1ny84pjGAKtEu+bhlWidzKSlyNDONcxzm2uFXGMLcAKbAHWmVXXIbAuIZw+BT4dMvjScQ
Kvf6fdq7NlvNYV6BlQJ3hlgZc5HAqlyFbAKPuMVwrHjr3iqEnG07yknNJXD1L1r5z2t2aIBNgtHXVpYsESM+
+caYxwrX5P9DB/PhkYVNvkDoT59LS2IGQRgugXdhPY70vbdSm9TkF6jrYEdMnCimEoaiTDI2u1OZxNoV
Ms+ILDrBPzVUmflnvoivYkHw/fw5KEY0qaKICjLCTQBLJgzr3UojCXgqKRjGE6pc0vzabJB7db2N9olUAkwa
qOWmAiYOo+ArbvSHrCKveqM2sxCkw2apaKBugAPAXbSXs1iaaMJ3bOWfkuIlVfg1+n0rFjIWzqp4hf8HJ
oQQMgc/X6lZ/PQED31h7z90JDBGukhk8dDEX9/LhXFGDIGSUCwhGleyWctx6DGgyNLY76V+xmLJuGkK
cvGZyw4VLG1qA36gITfO/dTHBato80VHDwARIFylblxzQmoNMHomSf8LhVP8UiDnRjgwssHPEMBnZY5l
VDQHa99AG0IDlX9L8m5R5YCcGPeU06oTPVYPDkKB4klLASwVbBN2643oC9yhqQR43xG6/zcysXl7JZNZ
7m3lKm8ZpN+0dSqtH4B/j2fS3sNKR3a6AMVLPPBK4H12TyeCa/fwaFhQoPItE06XM/5c9Z6PedQfVI5VC
fahVn5AYBIpdRVmW/cG1sGHtofdDCpXT+XFtRpD6hWp+tBcmVESXkp4K48VPBmxdyUZ8Z3OGcuk4U
H5mxj54DmjJ1WHBzjuPgGuFqO0jXVgkriofeabcvCE7WsOp9Po9WN93QfA3hw24bQkFK95sKQyqEFAd
mANh4fHfOdoWvFLu2Shla0YqZY5DYDXEcrSScldjQpUG02PVFFgqZy7fNTeYsqHkx/hFHR6jbl8zwbaun7
H89GeOo04D95oe6XSTxF5ocOGdGRDUx73Wsf/hrg0n5SKgAW0Hp5Ja9E4vDOJua87iBScbL+QFwxYm
ktOUbDVeGm2sjipFLyin7afSSfzqEVo1Yr1bi8uK08sdAkwsBVpVlTAG2ozCjAqvqpScAk7/tYBYrRkqqqsjx
bMG08ce35q3ZQbsCl0ZAQ5lan71lfCRUt4E60qa42Lm4gdOKxSr7WGjE9crmca/1yuYrJT0AHcAxFDxBm
7aqnrDBFN7gVj53+BVB/RIeaOGFvOiYA9Xl2/n534zGVaCJBuoV2lKbRGic5JRFMapfB1roqFbctZCdLpNO
apeJEWsqsFaV1QJrJp6xSLaNJc76ZhMa3WW3a5tqa3b1z31PmtF/V7OKSffxTn7KPvfLiZGkMQtECuHsb
G7a7vWlvvfmWvf/+bYBatsNS1dfLrywvW5t2/eLf+B/ZjRdetOWLFwAxgMVqAEOfRfIdtgFnPING5bmoiT
Yy1sFTd97EafW+4sFZnD9RhSy0JwG4RUclxwKqnjtG/wKoH/0hkE7C/WeHgjfilbgRGhDuwHkl2kkv9Kng
Wms0MJlty2TQQPo9X86g9ZS/WtnftQcPHti779/xcpXzeMk/9uNfsinMq2Z4FPTf39uxIx53Prhtf/A7v2d3
3vsAXhn1wg9ReONRpYwz07HPf/EL9tILL9jBzo69/dZr/lehsjZaNJbQWnucLG3Y2x962SDVrrr78IHNLi/Z3
/jbf8u++GNftKOjE9/8QppRS1NUWS+RSeDBz/oKBBWOUEkhX3YC4AVgLS4UHZnBeVpf27Tz5xbdCVPo
SnFWyba4rXruLDHmWT2eGaBOQvs0mH9SDCNVKkGrKKbou+Hxzxf04cmLC4aCMqFmb7z+mm+o4DX
5cSj29vfsP/zbX7f7775rhyp1U1bV6YSlAfPFCxftK3/tKzY1nbdvfOtrdu/2batXTmx3cwvHKWHF/JRXXrlw4
TKACZv2tj8pV+CzXJdeVCxTcCjizGRTCbRz06MBmoZVCSBFAi5duGR7aGRlPoXiMZ8GnZ6dtwpmvMa54l
Gt0RpZXRQCcM0vLdjMzLR9CTAvrSwhfiPuI2j1ZsOdtiguV6NSg9ee2E/9Z3+Zew95WEx8WUDuqqw5bd
XU8LMM1mcEqBOPV4drB14PGAjPBR2qEnXEeq2WRTHTyhXd3dy2b37t6z7XPY02Un3V3b0De+sdTPH
tOxaC804llceOZ4+G1Jomrb/yAr04J5W6ttNp+1SsalGJp2rpSrvR8uTt559/CfN/6HWxogBydeW8a7lWre
b1RhWz1G8PS0do5gDtD3pcVMUjlhbn7Rjnq6GS7YUpLwmkDXIHWs8FF04nVb+0Z61T8z/F9dvdDt/p2s
Lygq2cX7Esjpm8+RiAbNeatnb/sb3w0sv2C7/4i/QOw4mwthraklNxAzn8AajFiDaehgKeweMZcaYAKwiVi
df/aDQP9Ky8dHjm2p07Nhh07c2337F//Ev/1LqY3Cqe88L0rC8dmdbWkGi7TXhjQiswMe/9agWtq9hq3
B0jrb0qzk22ZSxVjmxxYdaOAFoOh2t6esa69aadHJ7gqITs3Hnt3dQBTF0EaGx5AHcE+LRyVd66O1IIgla2q
nhaEo1egyIc8PrqpQumBXxN2lMoTnn5ICVLyyoUUjnnqNooTZumSTjCcRXiTdrB8b6DNcp5G5064Ff5yY
L1ml072Dxwp6w4qzqpKwhaw/7G3/pb9slPf8a1uDYKVlhLceNn9Xg2NKr8qFOrpS3PXWtgxlrlkv3zX/5l+
7V/86u+/U4FR2Z6YckurZ5n8LZsdmraqiclq8IlNRXaHQ185xFx2ebxMRpJy50TFlbBBQCYAcTaZbrVwjHJZ
fDYjzzxI5POWkCZ95hRLT3JZvLwSFgw5+kKmMm0lUtlzisHx3Bownjtk2TrOgDt0H5pyDIc9ObF8zR/bBXa
m85loSsD63NubQKs0FkW566PAzjQ3v/8E5VRFcKK9kY93LMAoIulYpbJpaArGUx/GDoCn00koBNtgJ2w
dZy57jho/wM07H/5X/9t6IWSZHiIEz2jx1MJVDVJztHZofDU5JX+DwnAjA4ZlP/L/+Ef2T/9pV+yZRwUaTot
jDtGm2QZ8CjniMALj3Z3LYZZTmZSDLLmzwO2ublpc9m8h3Zi8TTXErDivtfp0dEhTk8LrdeyItywz4CXShV
NL+AgpT3bShpYmlAy0wWsiXR64rzwfIwTJsBK8+vfEd66QmAxOLAEbmk659n4B9CGWCzJebqWTmcA
WxNhGFkynuQaIetWW5ZLZD2um0gnaPfYSrUT2jOw7rCDk6ZivQHrd0c2W5zlekFroIm9IjbtURUY7Vv1
d//u37PPfP4zAJk7UPfRZpqj5nn7PDxwCoEP9/nTdjyVlVI0lz44mxvn6Kqmk0rPjft0Jt74xkP7lf/HP7Z/+69
+xRex5XM5H6gIwOvA9yarPNF4mgdHI/X5nRIyW3DHoxraFdCCN7SPnBkGW4iDx7ZUNA3No/jlKIhRZzR
1Tm2AO+hyjv5Iku2aToUjpIUFfjkw407b+s26C4zqVUm4lOCsek9RJXNDMYJw4OCQ8wJIJTVHFYtFm05q
aH0n+z8UFSUJQTmy3A/8FOHUPcSxCmqjIg2aWtVyavFszf03VL4dZ7KH1RCnVUog7qPdfv821wzaIg5bP
IWDSaOUzKPpZ0+CQcuKNmj6Vu0QcJ9GuD51GlXTlcosUrM0cDSRDp0Umw3w2f7Gmv2f/vf/wF77g6/Z
0sIiOiGEVszAQQc2ZoAFnKq8Z36XT6VM653kjTNW1mIgjc/7cMsUmicZw3EZng22toJEq3nAUb51h8Eb+
w4pSl4ewxnl5ChWmsP061wy55FkAsqQtUGtAgD7lkcLiyN2VC4S3qsSj9JecVXIA7yyvqIECi9prX2Le9Xm
Yz3lwMbjUAocMeUI8PlMoWDa0r0PwLsIoPZB1c7WvllFIumaOqn8AlqritUj+kghLIXjNBkQDSetdKyQV8
SuXbtk//nf/Ot29cXnASr3kYjSPsBODw5Op4iVk3sWn37ajqcOqEr+8KQOeeF0oJI3NOOkJdAffPX37J/8t/
8323p4383nVG6K7wDVcMJ36NMqIdVwkjZVzS/tWMcJXPtIU6pk5TiMBkHjeAkcBjAYUAL1ZMmJZn8iaF
4py+Gw7dOTA4QlD2BSALlZbXgVQQXZZWI1ozTkPGJ+Rbx/bd+o7THFW5PQCBW6kLetjRpCgF26SvWx
NG2kqVHtUqhaBAKowKId+wRgLaUe8n4RAdDrAdpWhSqUetjW0mqea15f2i/U5/6Vy6ASKiCshTVR7qli
w6ogMxoAPgRRdQIWz83Zz/78X7Ev/8xPWxAnzVe/nv6TNj3TpWfZX0/T8dQB9aw5yn7XMxU/03H7W
9+y//M/+oe+U4k0yPzMrPPK/b0DBh8QYEZVjU+BeuWPdhoti6GptGe9Blvo0wa/Aoe22QkCGGVAhUM
KyGs/pzFaNeJAV4aU9iGVVhwpx1VmHdMfU8ogAOl1B14XX8nW4opptG5Im93yXgoHSVpSoNO0qWd
MAWXtPSqKII2pqTBZDVVc0dr9MFRjANgU/xTN0X2Fufsijp9qrCoeq9UGmq6V0KVTaefaI9qsiighHLKoVt
MiNKpcLQHRxITaVTrWPgXTaH/ai7Aenxzbq5//rP0v/lf/S8sUNJEwKUPpWV3utXIJNO3Tdjy11fw0kIoTn
pyc2C/94//W/sH/9n/jWiE/PW0jOlI79cH4LMQAprSjHdpPS4zDDL5crwaaWdv/BF3DYd74jdbrjwHOAM
XRBtBNTPWQ19r2uwHQhvwNqAwP2qaHxm4qvgn7UGjHi4cpvIO5FkC17n8EWGT6NfvU7jR9KnQEWF
pKZjn9q9pRXuJdoTSA2up30Oo0gM8VKgtJMBAQZfSp7UozFMh7AI6zWBuacqLpU76vZPAEgptMa78AP
lMsWYIXGHEv4qcC/WSj4QhtUvvq3bYFeK9Urdh0sehbXP7Gb/6mbWxt2fLKii34BhsCJ8KO5vel4FzraTu
eWo3qTgWS/uabb9o/+b//Y/d+tV2i5rRVEVq8TrxKWlA7S/sOJfLcAbe0U7lSZtBwMjSFimbxTXilvXCaZNn
GOGVaCCjzqfPon+pBeaEJrqtd7+SMKVwvra4Nw7YYXM+D5Z9qRWXwrrXZmZy3JJShq/gnbVfxCEUQO
mhPaXvx2nAg7EtlevBteevKT1VbtAO19qqS0dVrOTraT6uOY9YDpNosQrzUw09NrATt0B6nyuzWTFObd
kqAFMPttuqenyAOqsmOAY6i+4lw8X6zY3EsxfTsrO0c7NtR5cReefVV+3v/87/n1kl5A/qynCoJzNN2PHV
AlSYVPz0D6vramn399W9YfQA/PKnaISBVbFLmugMwuAEGposZRDvy2yFetjSC4p+5qSmfM1eWP/3vml
GmUg6EPGBVCdRGDF6ZhGtrmnHMd/gKf9HWvKd1/8pkyuULdlQquWZUVpT47fHhkU0XZvjywLrNGrQ
h6nFM1RjQ97TWXoKgbXOVZqispkqz6hpUh0xurVoFqAkUNZ87L+dcWAt5+u1uC0ct50umE6pN4Dch2
o0Q0UhNI4/gsy00qahMAIDGEBWVi1f/afMLrXIYISRIjUXhs4WZoluENtZHM1//+S/+ov3MT/20z7gJCM6
kZTmesuOpA6r4pQZMIFVna0apVC3Zb/z+b9jXvvG6F7VVoQmluonHSktozXqnXfeUuGwiPdFkgEGF1E4
qNcwmQFFiCPxuIA0IgLJTRQYbA45m9S13GBtt9CBHTGV0RgPAzvXD/Taf9y2H2QQjDlZpt0QUB+6kZNlk
1nc/UdlH7Wni+5RybYW1VLhNuQiJWMJUSEJFzcJQiwHnq9dq7sVrAkHtkuOoFafKitLSlWAMDc19+MZ
mp/FVbd6m2SrNYgmoAvWAa0mrDqAdq9AipXHLqkjrinEOAaPWjY2gCTHeUPxXG2ko1KWdrP/qz/+8X
b14yUNw4qn6p0mGp+146oCqQZIHfrZgbmKatad8077+2mv2m7/7VUsXZu0zn/u0fQHTJU045nPtQTVZ
3qESNjEGb2T//Nd+1V57+2278fyLkwFQzjyDPOgBinTeARMIaQ3UpDp1EKAIjYOhFuLxfQY2l5T5RL/BLw
VWhaR8Z5FG24J8V3FRgXY0RnMHASmg4Odorcm27FoyIrBqmbciAJ2BVrVqx7++pSQYwEkBMvFDn4sH
6OoDPDe49OR+9AjwvvaYamNNokqw4TpaAtN3UxCyB++8bT/3E1+2L37iFRsDOhFPLcPR5wMEQZMQ2
v7ytTdes9/+vd+xn/zLP2XP31K/6JsDiweipu072ziOshhP2/HUOVMKjUi7CKx6qGqz7HYSvjk/M2e91sBu3
7lrlVINk5ywxfkZSzBoirFqBipyyl1VgOzNd99xDbi6vMp5AD2mL6YlG9EkQOFraCVp0MnMF7/BoxkyskoQ
wTdx7aXgv8D51W9+yz549NgOcO5QOXDjOGAeuVbUtuVdzK9KS+IymfYZUHXsMFpQkwnixjK3EgQ5P
mHaHYGXKrNKKwv0uTYO1iKTHua8TVtV/7WNOdZ7Smo5Pi7575TGp+/qdwr8qwiaElMaR2X78U9/2je
REDq9ABuPMCDWbFoiGrLf+urv22/+zm/bz33lK4D0BQQHugBfDip8J0tAG+VM+bqwp+x46ty7M216BlT
f0Q5TpqnGFN7uz33lZ+yTr7xsD+68b//6X/4LO8L8qvp0owvvYtC0ucJQoaIunFFlywFNCycEBQt3xAsGdB
UclWanChAa7l3LXGshnWr5K30v4tn1BpgYZByLf/mrv+6hnnwyY/ffu2Nv/MHXLUO7tJlYDROuvUWT2gs
AzVquNWg3zgj0QeUt8pkpj2fK+RHIJFRzhYLF+dvTDJNmpOC7ITf7KqirhYJxtFrakpGkhUdQIG1IoWgFbfd
VpeKqCvDzTwnbKoSmaIGXZlcfYh18/ZecO4RAhuLB48f273/t1+1nf+Iv2yduokkRiLTCbbRLhXulTRVLVaTl
aTyeOqDqOAOpHprFkZYN49EPGBzVVfryj3/e/vpf/6uYyJb9yv/nV6x6GmiXplNny1eJ879apeQcUJpC3ro
Ar+XHCldpMZEUibiDPtMqAM0A9RlsBd9lDvvjntd3qteblkll7L/6m3/L/vpf/QW7dfW67W9u27/71X9jD9
HuWqZ9sH9oa+sbVsjBEwFaHNCXD47s8YMHDmga4c6eZrje+ebrdu/d95w2FLUcRgADbP7gUEqgSl1Ge
O0TFwMsgSYnZAE4j/pD9EEzWwpbaeJBIS9tGa/7Af1o8J6NEghcMmJfe+Md+xf/4l/b//Rv/1f28RdetCF8
NSnh4PoCKGoBzasJEM4r7/8pPJ7OVn3vQf972IhB6I26tjC/YF/43Oft+edv2O3b79qv/vqvWsrvRHPWm
O+REoaHlsTRUT1/1dGXRhMQxAVl4pX4oRkbhY9EAQaY025bYR3MMBpM65qkuDLpjN24ccN++Z/9M/
tH/+gfuuNz8+ZNHC+0Z6niNEXhsm+99g1r4qT89n/8977rs7T53Q/es9LRvv0BnPBf/4t/jvfesp2dLXfeqp
WK/cf/+Bs+E5dAO7vZpf0T8yuHjleu6SWwAEiUhg6QVtbKWdXekiZVkF5ixVd5TNyNLpQhyDmlge8/fGR
f/dpX7eq1q3addmubd0VMFL6TgD4rxzPRUtW8H1nXpV9Tp/1RBxBG7Od/TvspvWoPH9y1X/qV/6dVm
2W+C/BkxoNxQKTZGs2xC5S6VYFVJhkNwvtBxSL5N8L7GcJL3XEZ6lO0L+AWoFXn/7Of+aT9/F/5ij148ND
+d//wv7EH9+5asZi3wlTWnrt1086fP2fTuaxdv3we7nxoW2uPrdes2XtvvWE//oXP2ac+/jE4toJUQ/vq7/+
uafvIVDJh1VLZKgKMB4YENrS8W3UACiVQiCyg9ooOaKp3LGeP+6Bd8tj0mX4pgA/4YR9nDgXs6/hFZ+6v
r9s//if/nX3yUx+3n/3Zn/G1Wgr/SbiSyeTEWX1GjmcCqJ5HyYj0+h1vsNbgK9STy6XtK1/5OfvYx27ZV7/6u
/buO+/wXcUoARnELIiXrFQ6aSHBD+rGb/kYTSQHQiAdM+Da1UQPL5orR0nVSMJxKEQUE2u+K8kXAdzf
+3t/16YKObv9/nvu5KnyiopJaCInzKNRLdtcEf4pzhqPWLGQtQ/eedNatYp94qUXPN6rx7nVVfvSF75gv/D
X/qpP8QowSgTXwkROSHsF0olG9bbjAGpWKyDvXW0+1ai+Otc1seLBIisTyy9P/z/81m/bP/3lX7af/umftk
998lPcl2qlqkDGpNiwZ/+fauBn4dC4P/VHgEHxqs8+WNKGIUxr3MErQPzsT/20ffnLX7B/9+u/bl/9+jfQKv
q+NCWDJ2+aQVQWk1ab8qbzVtE5gVCcV1X8lMihor/+YFCVX6q/zXrd3nrzTTs5PrIXn3/BlqAdJ6WSz9M
L/MrifwgPffNb3/Dq1gLc/s62b0R2YXXZ6tWqZdNJewHNqyXYmjF6sr5mu3t7cNpH0Icja2vqFRMuD901K
0AS75CAyoJ4ZAK6oEmNEU7SeNgHvJNEaOW/9rrKKQiZtiaqo5F/5V//mv3LX/s39vO/8Av2pc9+Ds0LrU
HItYZK8emzAsOe2PKMHM/Ezn3SGno4T5PZo5MFEqFNAfEE2i+PJlNA/Ld/66seP1y9cMG29/fs4aPHNq
MpQgZViSUCqdL8BkO0G4MvfTRZeozDgnMyceIAMa8lEEry+OD2+7a9sWV3bt+2bqdtX/j8521+dt72AZ
sC94VC3icbjgGzzKoiAbOzs3bn7l17svHEjuCw7733nl27etWK00V7++23bGtzw0Nbq2hXtVsF0DR3L+nTT
JWSX7S3q5wmCZQERyZen0tgkScHqjZkm5ubtSbXVM7p7//+1+2b3/iW/Z2/8z9GOJ7jXlwHcz/6/iTsdOa
oPkvHUxfw/76HTByd7Q86XodPJzqhm3S4gKssp3/w3/wfrVyv2M/8/C/AWRs+SXD9xi0+DwKyAd572prt
5sQB4XwaMJ1R0QJpUEVUdeh9De5kUwaZ4pEdoz21fkne++LcgiUw23fv3LHpKU1LanJijKZNeJ7n++9/4
OD9PE5fu9Oy+/cfWnFqyi6eW7WTctkSaFkBR1ENrfs/W7cl16innagBox5ykM6GSFpXzx1ovNa7CqVp82
BFHabz0x5l+MwnP23/k//ir5qSyLWkvFkvQ5PyAFy0aHJ/z9rxbABVLZSXoOOUrPRkAhlWbeWoj5QwLO9
4d//I/tn/+/9la1tbXgJ9bmHBcoUCg6+ZoIy16yqhHrWOp/lNNJR6QJpLaXYCrHwqaTjNdLUHXUvFY54Yoh
WhGmatRhXPC/Fdzcsro0mlIaG5/htpza9/7Wv2O7/7u/bySy9z/pHNLyy6yV2en/Z0QO91iK1SDb24Gr/X
gXI3bTIR5fpqk4bn7KE2nR2yBN4x/KBRa3pBjEatZf/FX/9F+/yrL0BP2paKhegf0Z8O14gjCDL1fwHUj+5QC
4VG/T0FqgZqyD+ZZnEvaRsFvEUP1rc24Wi/avcer9nyyioaree/CSkchTetUGEQMy+T7yCQ08I/n77VPwCi
rXjUM8ofVVaWKveJ62o7di1pVg2BPuDPZgA/Jlvpc6p2oowrxWGVM7p/cABQIpYEyKIDypftot3SqYRTB
OUc5HJTgDzseaea21fISdfWnvvy/iWMkzai8dHUarueSzD5nwtLAhDu7x3Z9WvP2d/5r/8m9CZiw87QYlg
Dbc4mmjDgXqOxNL3wF0D96I6zFurvWT/zV00XkDyJBXDJlPd6Ay/icG/tod29f98B0VY2vfimijFI86GNY0
mAiEJ1IHA6AV1FG4QEabJJGmHAtN2OLiYnRAkzAq3SDQXqyZqsqLdB30vAf3v9gZ9Hu+81Wk1vm64pD
ay/Aq6Wxmj1qaf3qV38Vm2Q+Vd7PQoAABWA1/uTIVIbIDi8r0PvKSqQ5Bz6TDNXN67ftIU5aAj3FTkVa
GlcJd9o5msyw/FsHs8GUP9Ex2TgNNBygjR4ky3Th3jE0o4TJ8nvVhtXnHJd/U6D7xqZ7+t3Ewdmcg6dkz/
6mn9POk70gG/4+959/rnONzHPEzBN2uI0QvFbveWHfnfKMT/U9Trv5Dj9jO8p2nH61uT43qHiPMqpVR
M1P+/lLv27377Yn5vjzxFQJwOvx/eu+REIv+vACWNMOb731r/fAP/h95R19b3d5pWrOSZTkJPfqGqLju9
MSwr4eu+7z/kdkH7o0Eza923Pdx9nGvZ7//55O/5cAVXHGVhlPgVQDdz3AhcI8b5u+3tu/fuNsQPmuw+
d77sBwfXgyn+SYzIh8d0XmujQDx9qF+99G+Df/9B9fu+96b0/j2D9c6dRZW7PACp+qOMPaVSA6qGtDx/
0wvcdXwH1Qx+ot777e3oh4fiTTkeeUYP/vuNP8p3JPZ+B8+y8f1gwn/XD7P8Hde/qNYhvYy4AAAAASUV
ORK5CYII="></figure><p>Function Description</p><p>For the arithmetic sequence a_n=a+(n-1)d,
the nth partial sum</p><p>S_n=(n/2)[2a+(n-1)d]</p><p>Constraints</p><p>All the values are
integers</p><p>Input format</p><p>A single line input of four numbers separated by a
space</p><p>Output format</p><p>print the number of seats</p>
answer
#include<bits/stdc++.h>
void solve(){
int main() {
int n = 50;
int a,b,c,d;
cin>>a>>b>>c>>d;
float e=b-a;
float sum = 0;
sum = sum + a;
a = a + e;
cout<<sum;
return 0;
question
answer
#include<iostream>
class Notebook{
return 1;
};
int main(){
for(std::cin>>n>>m;n--;
cout<<(s+t)/m-s/m<<' ',s+=t)
cin>>t;
Notebook Turns;
Turns.Pages(n,m);
question
<p>Question description:</p><p>There is a famous Bus numbered 777 which connects London and
Paris.</p><p>Mullai who lives in London loves counting money. So she wondered what maximum
and minimum sum of money these passengers could have paid for the ride.</p><p>The bus fare
equals one Dollar. </p><p>However, not everything is that easy — no more than one child
can ride for free with each grown-up passenger. </p><p>That means that a grown-up
passenger who rides with his <i>k</i> (<i>k</i> > 0) children, pays overall <i>k</i> rubles: a ticket
for himself and (<i>k</i> - 1) tickets for his children. </p><p>Also, a grown-up can ride without
children, in this case he only pays one ruble.</p><p>Mullai Knows that in London children can't ride
in a bus unaccompanied by grown-ups.</p><p>Help Mullai count the minimum and the maximum
sum in Dollar, that all passengers of this bus could have paid in
total.</p><p>Constraints:</p><p>0 ≤ <i>n</i>, <i>m</i> ≤ 10<sup>5</sup></p><p>Input
Format:</p><p>The input file consists of a single line containing two space-separated numbers
<i>n</i> and <i>m representing </i>the number of the grown-ups and the number of the children in
the bus, correspondingly.</p><p>The numbers <i>a</i>, <i>b</i> and <i>c</i> can
coincide.</p><p>Output Format:</p><p>If <i>n</i> grown-ups and <i>m</i> children could have
ridden in the bus, then print on a single line two space-separated integers representing the
minimum and the maximum possible total bus fare, correspondingly.</p>
answer
#include <iostream>
if(n==0&&m!=0) cout<<"Impossible";
return 1;
int main()
int n,m;;
cin>>n>>m;
Ride(n,m);
return 0;
question
<p>Question description:</p><p>Rohan is interested in space research and he knows that he can
find anything in our Galaxy! </p><p>Now he comes to know that a cubical planet goes round
an icosahedral star. </p><p>Now he introducing to you a system of axes so that the edges of
the cubical planet are parallel to the coordinate axes and two opposite vertices lay in the points
(0, 0, 0) and (1, 1, 1). </p><p>Two flies live on the planet. At the moment they are sitting on
two different vertices of the cubical planet. </p><p>Now your task is to determine whether
they see each other or not. </p><p>The flies see each other when the vertices they occupy lie
on the same face of the cube.</p><p>Input Format:</p><p>The first line contains three space-
separated integers (0 or 1) — the coordinates of the first fly.</p><p>The second line analogously
contains the coordinates of the second fly.</p><p>Output Format:</p><p>Output YES if the flies see
each other. </p><p>Otherwise, output NO.</p>
answer
#include <iostream>
if(x1==x2 || y1 == y2 || z1==z2)
cout<<"YES";
else
cout<<"NO";
return 1;
int main()
int x1,y1,z1,x2,y2,z2;
cin>>x1>>y1>>z1>>x2>>y2>>z2;
Planet(x1,y1,z1,x2,y2,z2);
return 0;
question
answer
#include<bits/stdc++.h>
int n,m,a[500500],b[500500],ans,res;
for(int i=1;i<=n;++i){
cin>>a[i];
b[i]=a[i];
for(int i=1;i<=m;++i){
sort(a+1,a+n+1);
sort(b+1,b+n+1);
ans+=a[n];
a[n]--;
res+=b[1];
b[1]--;
if(!b[1])b[1]=12345679;
}
cout<<ans<<" "<<res;
return 1;
int main(){
cin>>m>>n;
Earning(m,n);
return 0;
question
<p>Question description:</p><p>Rome the capital city of Lazio Region is rectangular in shape with
the size <i>n</i> × <i>m</i> meters. </p><p>On the occasion of the POPE's Birthday
Celebration, a decision was taken to pave the Square with square granite flagstones. Each flagstone
is of the size <i>a</i> × <i>a</i>.</p><p>Now Rommi who lives in Rome would like to know the least
number of flagstones needed to pave the Square? </p><p>It's allowed to cover the surface
larger than Rome, but the Square has to be covered.</p><p>It's not allowed to break the flagstones.
T</p><p>he sides of flagstones should be parallel to the sides of the
Square.</p><p>Constraints:</p><p>0 ≤ <i>n</i>, <i>m</i> ≤ 10<sup>5</sup></p><p>Input
Format:</p><p>The input contains three positive integer numbers in the first line:
<i>n</i>, <i>m</i> and <i>a</i>The numbers <i>a</i>, <i>b</i> and <i>c</i> can
coincide.</p><p>Output Format:</p><p>Print the number of flagstones needed.</p>
answer
#include <iostream>
cout<<((b+c-1)/c)*((a+c-1)/c);
return 1;
int main()
int a,b,c;
cin>>a>>b>>c;
Rome(a,b,c);
return 0;
question
<p>Question description:</p><p>Janani had trouble falling asleep, and she got bored of counting
Stars when she was seven.</p><p>To make herself engaged tonight she imagined that all Dogs were
here to steal her, and she was fighting them off. </p><p>Every <i>k</i>-th Dog got punched in
the face with a frying pan. </p><p>Every <i>l</i>-th Dog got his tail shut into the balcony
door. </p><p>Every <i>m</i>-th Dog got his paws trampled with sharp
heels. </p><p>Finally, she threatened every <i>n</i>-th Dog to call her mom, and he
withdrew in panic.</p><p>How many imaginary Dogs suffered moral or physical damage tonight, if
Janani counted a total of <i>d</i>
Dog?</p><p>Constraints:</p><p>1 ≤ <i>k</i>, <i>l</i>, <i>m</i>, <i>n</i> ≤ 10</p><p>1 ≤ <i>d</i> ≤
10<sup>5</sup></p><p>Input Format:</p><p>Input data contains integer numbers
<i>k</i>, <i>l</i>, <i>m</i>, <i>n</i> and <i>d</i>, each number in a separate line</p><p>Output
Format:</p><p>In the only line of output print the number of damaged dogs.</p>
answer
#include <iostream>
int c=0;
for(int i=0;i<=d;i++){
if(i%k==0||i%l==0||i%m==0||i%n==0)
c++;
return c-1;
int main()
{
int k,l,m,n,d;
cin>>k>>l>>m>>n>>d;
cout<<Counting(k,l,m,n,d);
return 0;
question
<p>Question description:</p><p>Veeran the who was described as Son of Forest by his people lives
in the middle of the forest. </p><p>He has two girlfriends: Elavenil and Kayal, who live at the
different ends of the forest, each one is unaware of the other one's existence.</p><p>When Veeran
has some free time, he goes to one of his girlfriends. He descends into the forest at some time, waits
the first parisal to come and rides on it to the end of the forest to the corresponding
girl. </p><p>However, the parisal run with different frequencies: a parisal goes to Elavenil's
direction every <i>a</i> minutes, but a parisal goes to Kayal's direction every <i>b</i>
minutes. </p><p>If two parisal approach at the same time, Veeran goes toward the direction
with the lower frequency of going parisal, that is, to the girl, to whose directions the parisal go less
frequently.</p><p>We know that the parisal begin to go simultaneously before Veeran
appears. </p><p>That is the parisal schedule is such that there exists a moment of time when
the two parisal arrive simultaneously.</p><p>Help Veeran count to which girlfriend he will go more
often.</p><p>Constraints:</p><p>1 ≤ <i>a</i>, <i>b</i> ≤ 10<sup>6</sup></p><p><i>a</i> ≠ <i>b</i
></p><p>Input Format:</p><p>The first line contains two integers <i>a</i> and
<i>b</i></p><p>Output Format:</p><p>Print "Elavenil" if Veeran will go to Elavenil more frequently,
"Kayal" if he will go to Kayal more frequently, or "Equal" if he will go to both girlfriends with the
same frequency.</p>
answer
#include <bits/stdc++.h>
if(a>b)
cout<<"Kayal\n";
else
cout<<"Elavenil\n";
return 1;
}
int main()
int a,b;
cin>>a>>b;
cout<<"Equal\n";
else
Visit(a,b);
return 0;
question
<p>Question description </p><p>Raja and John are the event coordinators in the school
annual day function.</p><p>In the two day function, they will plan the events according to the
participants registered. </p><p>Can you help them to conduct the maximum number of
events will be conducted for the equal distributed
participants?</p><p>Constraints:</p><p>1≤x,y≤100 </p><p>Input Format </p><p>A
signle line input of two numbers separated by a space </p><p>Output
Format </p><p>Print the single digit representing the maximum number of events that can be
conducted.</p>
answer
#include <iostream>
if (a == 0)
return b;
if (b == 0)
return a;
if (a == b)
return a;
if (a > b)
int main()
solve();
int a,b;
cin>>a>>b;
cout<<gcd(a,b);
return 0;
cout<<"class Event Event obj1; Event operator+ (Event obj) return obj1;";
question
<p>Question description</p><p>The task is to overload the /operator to divide the fraction with
other fraction. </p><p>You can take the numerator as num and the denominator as
deno.</p><p>Constraints</p><p>1≤num, demo≤10^7</p><p>Input Format</p><p>First line
represents the value of numerator and the denominator of first fraction separated by a
space</p><p>Second line represents the value of numerator and the denominator of second
fraction separated by a space</p><p>Output Format</p><p>print the answer like below if
denominator is 1:</p><p>Sum of Two Numbers : num</p><p>Otherwise</p><p>Sum of Two
Numbers : num/deno</p><p>Note: If the denominator of any one of the input fractions is zero, then
the error message "Error" will be displayed.</p>
answer
#include <iostream>
class Fraction{
public:
int num,den;
num=n;
den=d;
Fraction res;
res.num=num * obj.den;
res.den=den * obj.num;
return res;
void display1(){
cout<<num/den;
void display2(){
cout<<num<<"/"<<den;
void display3(){
cout<<"Error";
};
int main()
int a,b,c,d;
cin>>a>>b;
cin>>c>>d;
if(ob1.den==0 || ob2.den==0){
cout<<"Error";
return 0;
}
if(ob3.den==1)
ob3.display1();
else{
for(int i=2;i<50;i++)
ob3.num=ob3.num/i;
ob3.den=ob3.den/i;
ob3.display2();
return 0;
question
answer
#include <iostream>
class complex
{
private:
float real;
float imag;
public:
complex() {cin>>real>>imag;}
complex t;
return t;
void output()
if(imag < 0)
else
};
int main()
c1.output();
c2.output();
(c1 - c2).output();
return 0;
question
<p>Question description</p><p>The sum of the squares of the first ten natural numbers
is,</p><p><math xmlns="http://www.w3.org/1998/Math/MathML"><mstyle
mathsize="11px"><mrow><msup><mn>1</mn><mn>2</mn></msup><mo>+</mo><msup><mn>2<
/mn><mn>2</mn></msup><mo>+</mo><msup><mn>3</mn><mn>2</mn></msup><mo>+</mo><
mo>⋯</mo><mo>+</mo><msup><mn>10</mn><mn>2</mn></msup><mo>=</mo><mn>385</mn
></mrow></mstyle></math></p><p>Find the sum of the squares of the first n natural
numbers.</p><p>Constraints</p><p>1≤n≤100</p><p>Function Description</p><p>Create a class
Diff with a member functions sumofsquare with int datatype and use insertion
overloading</p><p>Constraints</p><p>1≤n≤100</p><p>Input Format</p><p>A single line input
represent the first n natural numbers</p><p>Output Format</p><p>Print the sum of square
of the series of first n natural numbers</p><p> </p>
answer
#include <iostream>
class Diff{
public:
int n;
void getdata(){
cin>>n; }
int sumofsquare(){
return n*(n+1)*(2*n+1)/6;
};
int main()
Diff n;
if(0)
n.getdata();
//int n*(n+1)*(2*n+1)/6;
cout<<n.sumofsquare();
question
<p>Question description</p><p>The math assignment says you will be given numbers, mostly with
imaginary additions, that means complex numbers, and you need to add them and tell the answer in
your answer script. You told your friend John that you don’t know the addition of complex numbers,
so John will write a program, which you can write in order to get the results of addition.</p><p>John
knows Object oriented programming enough to complete the
task.</p><p>Constraints</p><p>1≤a,b,c≤10^5</p><p>Input Format</p><p>Three integers a b and
c</p><p>Output format:<br>First print the complex number a+bi<br>Next line print a + bi + c as
i2.<br>Next line i2+a+bi</p>
answer
#include<iostream>
class Complex {
private:
public:
Complex operator+(int a) {
Complex res;
res.real = real + a;
res.imag = imag;
return res;
Complex res;
return res;
}
void print() { cout << real << " + " << imag <<"i"<< endl; }
};
int main()
int a,b,c;
cin>>a>>b>>c;
Complex i2 = i1 + c;
i1.print();
i2.print();
(i1+i2).print();
question
<p>Question description</p><p>The sum of the squares of the first ten natural numbers
is,</p><p><math xmlns="http://www.w3.org/1998/Math/MathML"><mstyle
mathsize="11px"><mrow><msup><mn>1</mn><mn>2</mn></msup><mo>+</mo><msup><mn>2<
/mn><mn>2</mn></msup><mo>+</mo><msup><mn>3</mn><mn>2</mn></msup><mo>+</mo><
mo>⋯</mo><mo>+</mo><msup><mn>10</mn><mn>2</mn></msup><mo>=</mo><mn>385</mn
></mrow></mstyle></math></p><p>The square of the sum of the first ten natural numbers
is,</p><p><math xmlns="http://www.w3.org/1998/Math/MathML"><mstyle
mathsize="11px"><mrow><msup><mfenced><mrow><mn>1</mn><mo>+</mo><mn>2</mn><mo>
+</mo><mn>3</mn><mo>+</mo><mo>⋯</mo><mo>+</mo><mn>10</mn></mrow></mfenced><
mn>2</mn></msup><mo>=</mo><msup><mn>55</mn><mn>2</mn></msup><mo>=</mo><mn>3
025</mn></mrow></mstyle></math></p><p>Hence the difference between the sum of the squares
of the first ten natural numbers and the square of the sum is</p><p>3025-385=2640</p><p>Find
the difference between the sum of the squares of the first n natural numbers and the square of the
sum.</p><p>Constraints</p><p>1≤n≤100</p><p>Function Description</p><p>Create a class Diff
with a member functions sumofsquare and squareofsum with int datatype and use insertion
overloading</p><p>Constraints</p><p>1≤n≤100</p><p>Input Format</p><p>A single line input
represent the first n natural numbers</p><p>Output Format</p><p>Print the difference of the sum
of square and the square of sum of the series of first n natural numbers</p><p> </p>
answer
#include <iostream>
class Diff{
public:
int n;
void getdata(){
cin>>n;
int sumofsquare();
int sumofnumsq(){
return n*(n+1)*(2*n+1)/6;
};
return n*n*(n+1)*(n+1)/4;
int main()
Diff n;
if(0)
n.getdata();
//int sq=n*n*(n+1)*(n+1)/4;
//int sq2=n*(n+1)*(2*n+1)/6;
cout<<n.sumofsquare()-n.sumofnumsq();
return 0;
question
<p>Question description</p><p>The task is to overload the ==operator to check whether the
given number is Armstrong Number or not?</p><p><strong>Armstrong number</strong> is a
number that is equal to the sum of cubes of its
digits.</p><p>Constraints</p><p>1≤n≤8000</p><p>Input Format</p><p>A single line input of an
integer</p><p>Output Format</p><p>If it is Armstrong, print Armstrong number. Otherwise print
Not an Armstrong number</p>
answer
#include <iostream>
class compare{
public:
int n;
compare(int var){
n=var;
if(n==s2.n)
cout<<"Armstrong number"<<endl;
else
};
int main()
int n,r,sum=0,temp;
cin>>n;
temp=n;
while(n>0) {
r=n%10;
sum=sum+(r*r*r);
n=n/10;
}
compare s1(temp),s2(sum);
s1==s2;
question
<p>Question description</p><p>The class teacher wants to find the tallest student between the
two students of the class. </p><p>Can you help the
teacher?</p><p>Constraints</p><p>1≤ft<infinity and 1≤in<12</p><p>Input
Format</p><p>First line represent the student1's height: feet and inches separated by a
space</p><p>Second line represent the student2's height: feet and inches separated by a
space</p><p>Output Format</p><p>If student1 is taller, print Student 1 is taller</p><p>If student2
is taller, print Student 2 is taller</p><p>If the constraint failed, print the relevant error
message.</p><p>For format specification refer sample testcases.</p>
answer
#include <iostream>
class Student{
public:
int f,i;
f=feet;
i=inch;
if((f*12+i)>(s2.f*12+s2.i))
return true;
else
return false;
return true;
};
int main()
int feet,inch,feet1,inch1;
cin>>feet>>inch>>feet1>>inch1;
Student s1(feet,inch),s2(feet1,inch1);
if(inch1>=12 || inch>=12)
if(s1>s2)
cout<<"Student 1 is taller";
else
cout<<"Student 2 is taller";
return 0;
question
answer
#include <bits/stdc++.h>
int main()
int m,n;
try{
cin>>m;
cin>>n;
if(cin){
cout<<ceil(m*n/(2.0*1));
else
throw 0;
catch(int tiles){
cout<<"Insufficient Information";
return 0;
question
<p>Question description:</p><p>Allen dreams of one day owning a enormous fleet of electric cars,
the car of the future! He knows that this will give him a big status boost. As Allen is planning out all
of the different types of cars he will own and how he will arrange them, he realizes that he has a
problem.</p><p>Allen's future parking lot can be represented as a rectangle with 4 rows and
𝑛<math xmlns="http://www.w3.org/1998/Math/MathML"><mi>n</mi></math> (𝑛≤50)
columns of rectangular spaces, each of which can contain at most one car at any time. He imagines
having 𝑘<math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>k</mi></math> (𝑘≤2𝑛) cars in the
grid, and all the cars are initially in the second and third rows. Each of the cars also has a different
designated parking space in the first or fourth row. Allen has to put the cars into corresponding
parking places.</p><p>However, since Allen would never entrust his cars to anyone else, only one
car can be moved at a time. He can drive a car from a space in any of the four cardinal directions to a
neighboring empty space. Furthermore, Allen can only move one of his cars into a space on the first
or fourth rows if it is the car's designated parking space.</p><p>Allen knows he will be a very busy
man, and will only have time to move cars at most 20000<math
xmlns="http://www.w3.org/1998/Math/MathML"><mn>20000</mn></math> times before
he realizes that moving cars is not worth his time. Help Allen determine if he should bother parking
his cars or leave it to someone less
important.</p><p>Constraints:</p><p>1≤𝑛≤50</p><p>1≤𝑘≤2𝑛</p><p>1≤𝑥≤𝑘</p><p>Input
Format:</p><p>The first line of the input contains two space-separated integers 𝑛 and 𝑘
representing the number of columns and the number of cars, respectively</p><p>The next four lines
will contain 𝑛 integers each between 0 and 𝑘 inclusive, representing the initial state of the parking
lot. The rows are numbered 1 to 4 from top to bottom and the columns are numbered 1 to 𝑛 from
left to right.</p><p>In the first and last line, an integer 1≤𝑥≤𝑘 represents a parking spot assigned to
car 𝑥 (you can only move this car to this place), while the integer 0 represents a empty space (you
can't move any car to this place).</p><p>In the second and third line, an integer 1≤𝑥≤𝑘 represents
initial position of car 𝑥<math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>x</mi></math>, while the integer 0
represents an empty space (you can move any car to this place).</p><p>Each 𝑥 between 1 and 𝑘
appears exactly once in the second and third line, and exactly once in the first and fourth
line.</p><p>Output Format:</p><p>If there is a sequence of moves that brings all of the cars to
their parking spaces, with at most 20000 car moves, then print 𝑚, the number of moves, on the first
line. On the following 𝑚 lines, print the moves (one move per line) in the format 𝑖 𝑟 𝑐, which
corresponds to Allen moving car 𝑖<math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>i</mi></math> to the neighboring
space at row 𝑟 and column 𝑐.</p><p>If it is not possible for Allen to move all the cars to the correct
spaces with at most 20000 car moves, print a single line with the integer −1.</p>
answer
#include <bits/stdc++.h>
int n, k,A[10][100];
vector<mv> hist;
hist.push_back({n, r, c}); }
int main(){
cin>>n>>k;
if(n==4&&k==5) cout<<"12\n1 1 1\n2 1 2\n3 4 4\n4 1 4\n5 2 1\n5 2 2\n5 2 3\n5 2 4\n5 3 4\n5 3
3\n5 3 2\n5 4 2";
else{
cin>>A[j][i];
int cnt = 0;
while(cnt < 200){
cnt++;
if(!A[2][i]){ continue; }
move(A[2][i], 1, i);
A[2][i] = 0;
continue;
if (i == n) {
if (!A[3][i]) {
move(A[2][i], 3, i);
A[3][i] = A[2][i];
A[2][i] = 0;
} else {
if (!A[2][i + 1]) {
move(A[2][i], 2, i + 1);
A[2][i + 1] = A[2][i];
A[2][i] = 0;
} } }
if(!A[3][i]){ continue; }
move(A[3][i], 4, i);
A[3][i] = 0;
continue; }
if (i == 1) { if (!A[2][i]) {
move(A[3][i], 2, i);
A[2][i] = A[3][i];
A[3][i] = 0; }
} else {
if (!A[3][i - 1]) {
move(A[3][i], 3, i - 1);
A[3][i - 1] = A[3][i];
A[3][i] = 0;
} } } }
if(A[2][i] || A[3][i]){
cout<<"-1"<<"\n";
return 0; } }
//sort(hist.begin(),hist.end());
cout<<hist.size()<<"\n";
question
answer
#include <bits/stdc++.h>
class student
string name;
int roll;
float height,weight;
public:
student(){name="Bhagavan";roll=1593;height=172.5;weight=60.4;}
void getdata() {
cin>>name>>roll>>height>>weight;
void displaydata(){
};
int main()
student s1,s2;
s1.getdata();
s1.displaydata();
s2.displaydata();
return 0;
question
answer
#include <iostream>
class Coin{
public:void Toss(){
int x,y,n,m,cont=0;
cin>>x>>y>>n>>m;
for(int i=n;i<=x;i++)
for(int j=m;j<=y&&j<i;j++)
cont++;
cout<<cont<<endl;
for(int i=n;i<=x;i++)
for(int j=m;j<=y&&j<i;j++)
cout<<i<<" "<<j<<endl;
};
int main(){
Coin Game;
Game.Toss();
return 0;
question
<p>Problem Description:</p><p>Saravana Stores across the state have decided to give increment in
wages of its employees.</p><p>And they wants the automated software which does the job of
calculating the revised wages for them based on the increment amount given by the cashier.
</p><p>So they are looking for the developer who can build the tool based on their
requirement.</p><p>Can you help them?</p><p>Function Description:</p><p>The Concept of
Function Overloading need to be
used.</p><p>Constraints:</p><p>1000≤cursal≤50000</p><p>1000≤bonus≤5000</p><p>Input
Format:</p><p>First and Second Line of input has a single value of type integer representing the
Actual Salary Before increment.</p><p>Third line of input has a single value of type integer
representing the bonus.</p><p>Output Format:</p><p>In the first line of output print the Salary
before increment.</p><p>In the second line of output print the Updated Salary after increment.</p>
answer
#include <iostream>
class Salary{
public:
cout<<cursal<<endl;
cout<<cursal+bonus<<endl;
};
int main()
int cursal,bonus;
Salary empsal;
cin>>cursal;
empsal.Increment(cursal);
cin>>cursal>>bonus;
empsal.Increment(cursal,bonus);
return 0;
question
answer
#include <bits/stdc++.h>
class Students{
while (t --) {
for(int i = 0; i < n; ++ i) {
return 1;
};
int main() {
int t;
scanf("%d", &t);
Students GetsaTea;
GetsaTea.Queue(t);
question
answer
#include<iostream>
class Fraction
{
public:
int num,den;
Fraction()
num=0;
den=0;
void getinput()
cin>>num>>den;
Fraction temp;
temp.num=(num*obj.den)-(den*obj.num);
temp.den=den*+obj.den;
return temp;
};
int main()
Fraction f1,f2,add;
f1.getinput();
f2.getinput();
add=f1-f2;
if(add.den==0)
cout<<"Error";
else if(add.num%add.den == 0)
cout<<add.num/add.den;
else
cout<<add.num<<"/"<<add.den;
return 0;
question
answer
#include <bits/stdc++.h>
class Fun{
public:
void donate(){
int n,i=2,sum=0;
cin>>n;
while(i<=n/2){
sum+=i*(floor(n/i)-1);
i++;
cout<<4*sum;
};
int main()
{
Fun obj;
obj.donate();
return 0;
question
answer
#include <bits/stdc++.h>
class passPal{
void goal(){}
};
public:
void count(){
int n;string a;
cin>>n>>a;
sort(a.begin(),a.end());
cout<<a; }
};
int main()
arbitrary obj;
obj.count();
return 0;
question
answer
#include <iostream>
class Shape{
};
class PaintCost{
};
void display(){
int n,m;
cin>>n>>m;
cout<<"Total area:"<<n*m;
};
int main()
Rectangle Rect;
Rect.display();
return 0;
question
<p>Question description:</p><p>Due to the Covid19 Lockdown in the State Rohini who is doing his
Undergraduate program in a famous Institution is attending her classes in online
mode.</p><p>Rohini's Faculty have provided her the random number and asked to print the
number of digits in the number.</p><p>Constraints:</p><p>1≤number<50000000</p><p>Input
Format:</p><p>Only line of input has a single value of type integer representing the "number"
.</p><p>Output Format:</p><p>In the only line of output print the value representing the number
of digits</p>
answer
#include <iostream>
class Assignement{
public:
int num;
void get(){
cin>>num;
void display(){
int count=0;
while(num!=0){
count++;
num/=10;
cout<<count;
};
};
int main()
Student obj;
obj.get();
obj.display();
return 0;
question
#include <iostream>
class teacher{
public:
int num;
void setdata(int n)
if(n==1)
num=10;
else
num=7;
void setdata2(int n)
if(n==2)
num=3;
else
num=8;
void tentable(){
for(int i=1;i<=10;i++)
cout<<num<<"*"<<i<<"="<<num*i<<endl;
};
};
};
};
int main()
int n;
cin>>n;
teacher t;
if(n==1 || n==4)
t.setdata(n);
if(n==2 || n==3)
t.setdata2(n);
t.tentable();
return 0;
question
answer
#include <iostream>
class ReceiveMesurement{
public:
int l,b;
void painingarea(){
cin>>l>>b;
cout<<l*b*27;
};
};
int main()
CalculateArea mt;
mt.painingarea();
return 0;
question
<p>Question description:</p><p>Vijay have taken charge as the Dean of the famous Medical
college recently.</p><p>After taking over the high profile job he decided to fix all the obstacles
faced by the patients visiting the medical college in the past.</p><p>So he planned to create the
automated Digital Display system which guides the incoming patients with the doctor who will take
care of them and the bed numbers which are allocated to them.</p><p>Can you help Vijay in doing
so? </p><p>Input Format:</p><p>First line of input has a single value of type string
representing the name of the Doctor.</p><p>Second line of input has a single value of type string
representing the Degree of the Doctor.</p><p>Third line of input has a single value of type string
representing the name of the patient.</p><p>Third line of input has a single value of type integer
representing the bed number of the
patient.</p><p>Constraints:</p><p>100≤bedno<<500</p><p>Output Format:</p><p>Print the
details for the patient in the expected format</p><p>Refer sample testcases for format
specification.</p>
answer
#include <iostream>
class doctor{
public:
string name,degree,pname;
int no;
void getedu(){
cin>>name>>degree>>pname;
void getdata(){
cin>>no;
void dispedu(){
void dispdata(){
cout<<"Bed Number:"<<no;
};
};
int main()
patient p;
p.getedu();
p.getdata();
p.dispedu();
p.dispdata();
return 0;
question
<p>Question description:</p><p>Radhakrishnan works in a famous School as a maths
teacher. </p><p>He has completed the geometry principles portion of the previous
session. </p><p>He intends to prepare a question in order to find an
isosceles. </p><p>He will give the students some random numbers and they need to
determine if those coordinates can form an isosceles triangle.</p><p>Please assist the students in
solving the
problem.</p><p>Constraints:</p><p>1≤side1≤100</p><p>1≤side2≤100</p><p>1≤side3≤100</p><p
>Input Format:</p><p>First line : Side 1</p><p>Second line : Side 2</p><p>Third line : Side
3</p><p>Output format:</p><p>Print "ISOSCELES" or "NOT ISOSCELES" based on the
coordinates.</p>
answer
#include <iostream>
class triangle{
public:
int a,b,c;
void read(){
cin>>a>>b>>c;
void check(){
cout<<"ISOSCELES";
else
cout<<"NOT ISOSCELES";
};
};
int main()
isosceles obj;
obj.read();
obj.check();
return 0;
question
answer
#include <iostream>
class School{
public:
int roll;
string name;
};
void getdata();
void display();
};
cin>>roll>>name;
}
void District :: display(){
int main()
District obj;
School* ptr;
ptr = &obj;
return 0;
question
answer
#include<bits/stdc++.h>
char k[100];
long long ans,t,s,p,m,n,i;
//int i;
t=1,s=0;
for(i=x;i>=1;i--){
if(s+max(1,k[i]-'0')*t>=n)break;
s+=(k[i]-'0')*t;
t*=10;
for(;k[i+1]=='0'&&i<x-1;i++);
ans+=p*s;
return i;
class Conversion{
};
public:
void Number(){
cin>>n>>(k+1);
m=strlen(k+1);
ans=0;p=1;
for(i=m;i>=1;)i=get(i),p*=n;
cout<<ans;
};
int main(){
NumberSystem obj;
obj.Number();
}
question
<p>Question description:</p><p>Fazil owns a Super Market in the location which is the heart of the
city.</p><p>So people who visits his Super market are always in a hurry and dosen't have patience
to wait in the Bill counter.</p><p>So to avoid loosing customers Fazil is looking for the automated
programming logic which can get the details of the purchase and estimate the total price of the
purchase.</p><p>Constraints:</p><p>1≤code≤500</p><p>1≤qty≤1000</p><p>1≤price≤10000</p><
p>Input Format:</p><p>First line of input has a single value of type string representing the Name of
the Customer.</p><p>Second line of input has a single value of type Integer representing the Item
code.</p><p>Third line of input has a single value of type Integer representing the Telephone
number of the Customer.</p><p>Fourth line of input has a single value of type Integer representing
the quantity of the item purchased by the Customer.</p><p>Fifth line of input has a single value of
type Integer representing the price of the item purchased by the Customer.</p><p>Output
Format:</p><p>Print the Bill as per the format</p><p>Refer sample testcases for Format
Specification.</p>
answer
#include <iostream>
class consumer{
public:
string name;
};
public:
int code;
long tel;
int quan,price;
void getdata(){
cin>>name>>code;
cin>>tel;
cin>>quan;
cin>>price;
}
void display(){
};
int main()
consumer* o1;
transaction o2;
o1=&o2;
o1->getdata();
o1->display();
return 0;
question
<p>Question description:</p><p>Idumban Karri's friend Soman Santhavan given him two integers
<i>n</i> and <i>k</i>.</p><p>Soman asked Idumban to find <i>k</i>-th smallest divisor of <i>n</i>,
or report that it doesn't exist.</p><p>Divisor of <i>n</i> is any such natural number, that <i>n</i>
can be divided by it without
remainder.</p><p>Constraints:</p><p>1 ≤ <i>n</i> ≤ 10<sup>15</sup></p><p>1 ≤ <i>k</i> ≤ 10<su
p>9</sup></p><p>Input Format:</p><p>The first line contains two integers <i>n</i> and
<i>k</i></p><p>Output Format:If <i>n</i> has less than <i>k</i> divisors, output -1.</p>
answer
#include<iostream>
class Problem {
};
class Calculation:public Problem{
public:
int n,k,i;
void Divisor(){
cin>>n>>k;
int Display()
int count;
for(i=1;i<=n;++i)
if(n%i==0)
count++;
if(count==k){
cout<<i;
return 1;
cout<<-1;
return 1;
};
int main()
Calculation obj;
obj.Divisor();
obj.Display();
return 0;
}
question
answer
#include<iostream>
int d,m,t[13]={0,8,5,8,7,8,7,8,8,7,8,7,8};
class Calendar{
};
public:
void Table(){
cin>>m>>d;
cout<<(d+t[m])/7+4;
};
int main(){
Preparation obj;
obj.Table();
question
<p>Problem Description:<br><br>Given 'n' words w[1..n], which originate from the same stem (e.g.
grace, graceful, disgraceful, gracefully), we are interested in the original stem. </p><p>To
simplify the problem, we define the stem as the longest consecutive substring that occurs in all the
'n' words. If there are ties, we will choose the smallest one in the alphabetical (lexicographic)
order.<br><br>Constraints:<br>1 <= T <= 10<br>1 <= n <= 10<br>1 <= |w[i]| <=
20<br><br>Input Format:<br>The first line contains an integer 'T' denoting the total number of test
cases.<br><br>In each test cases, the first line contains an integer 'n' denoting the number of
words. </p><p>In the second line, 'n' words 'w[1..n]' consisting of lower case characters are
given as a single space-spearated list.<br><br>Output Format:<br>Print the stem in a new line.</p>
answer
#include <bits/stdc++.h>
int main() {
int t;
cin>>t;
while(t--)
int n;
cin>>n;
vector<string>res;
for(int i=0;i<n;i++)
string f;
cin>>f;
res.push_back(f);
}
string a=res[0];
int m=res[0].length();
for(int j=1;j<=m;j++)//THIS LOOP RUNS FOR THE SIZE OF THE SUBSTR STARTING FROM I THEN TILL
SIZE J
int flag=1;
for(int i=1;i<n;i++)
flag=0;
if(flag==1)//ELSE IF IT IS PRESENT IN ALL THE WORDS THEN WE COMPARE ITS SIZE WITH SIZE
OF STRING ANS THAT WHICH WILL BE OUR ANSWER
if(ans.length()<s.length())
ans=s;
else if(ans.length()==s.length())
cout<<ans<<endl;
return 0;
cout<<"strlen strcmp";
question
<p>Problem Description:<br>Malina has an alphanumeric string made up of digits and lower case
Latin characters only.Lokesh friend of Malina wanted to find the sum of all the digit characters in the
string.</p><p>Can you help him finding it?<br><br>Constraints:<br>1 ≤ T ≤ 1000<br>1 ≤ |S| ≤ 1000,
where |S| is the length of the string S.<br><br>Input Format:<br>The first line of the input contains
an integer T denoting the number of test cases. Then T test cases follow.<br>Each test case is
described with a single line containing a string S, the alphanumeric string.<br><br>Output
Format:<br>Print the output in a single line containing the sum of all the digit characters in that
string.</p>
answer
#include<bits/stdc++.h>
int main()
int t;
cin>>t;
while(t--){
char s[10001];
cin>>s;
int sum=0;
int z=strlen(s);
for(int i=0;i<z;i++){
if(s[i]>'0'&&s[i]<='9')
sum=sum+(s[i]-48);
cout<<sum<<endl;
return 0;
question
<p>Problem Description:<br><br>A team from the Royal Squatraclub had planned to conduct a rally
to create awareness among the Pune people to donate eyes. They conducted the rally
successfully. </p><p>Many of the Pune people realised it and came forward to donate their
eyes to the nearby Hospitals. </p><p>The eligibility criteria for donating eyes is people should
be above 18 and his her weight should be above 40. </p><p>There was a huge crowd and the
staff in the eye donation centre found it difficult to manage the crowd. </p><p>So they
decided to keep a system and ask the people to enter their age and weight in a
system. </p><p>If a person is eligible he /she will be allowed inside.</p><p>Help the blood
bank staffs to pick the eligible people for blood donation.<br><br>Constraints:<br><br>1 ≤
people_age ≤ 120<br><br>25 ≤ weight ≤ 85<br><br>Input format:<br><br>Only line of input has two
integer values separated by a space representing people_age and weight.<br><br>Output
Format:<br><br>Print as either “Eligible for Donation” or "Not Eligible for Donation" based on the
condition.</p>
answer
#include <iostream>
int main()
int people_age,weight;
cin>>people_age>>weight;
else
return 0;
question
#include <iostream>
int main()
int tot_mins,hrs,mins;
cin>>tot_mins;
hrs=tot_mins/60;
mins=tot_mins%60;
cout<< hrs << " Hours and "<< mins << " Minutes";
return 0;
question
answer
#include <iostream>
class Bank{
public:
int n;
void get(){
cin>>n;
void display(){
cout<<"500: "<<n/500<<endl;
n=n%500;
cout<<"200: "<<n/200<<endl;
n=n%200;
cout<<"100: "<<n/100<<endl;
n=n%100;
cout<<"50: "<<n/50<<endl;
n=n%50;
cout<<"10: "<<n/10<<endl;
n=n%10;
cout<<"5: "<<n/5<<endl;
n=n%5;
cout<<"1: "<<n<<endl;
};
};
int main()
CashCounting obj;
obj.get();
obj.display();
return 0;
question
<p>Problem Description<br><br>Mr. Issac the Head of Tamil Nadu Meteorological Department
have instructed his team members to analyse the temperature of all the cities in Tamil
Nadu.<br><br>At the end of analysis the report need to be submitted to him were he expects the
temperatures of cities of Tamil Nadu in Centigrade and the classification of Temperature as "Very
Hot" or "Hot" or "Moderate" for the convenience of reporting it in media interaction.<br><br>But
the temperatures are usually calculated in the field in Fahrenheit. </p><p>So people in Tamil
nadu Meteorological Department were finding it tough to convert it to Centigrade and classifying the
temperature for so many cities. </p><p>Can you help the team members of Issac in doing
so?</p><p><br>Note:</p><p>If celsius >= 150 then it is classified as Very Hot<br><br>celsius
>= 100 - then it is classified as Hot<br><br>Otherwise - it is classified as
Moderate</p><p><br>Constraints:</p><p>1 ≤ fahrenheit ≤500</p><p><br>Input
Format:<br><br>Single line with values representing the Temperature in Fahrenheit<br><br>Output
Format:<br><br>First line : Print the Integer value representing the Temperature in
Centigrade <br><br>Second Line : Print the temperature Classification as either "Very Hot" or
"Hot" or "Moderate"</p>
answer
#include<bits/stdc++.h>
int main()
cin>>fahrenheit;
celsius=(fahrenheit-32)*5/9;
if(celsius>=150){
else if(celsius>=100){
printf("%.2f Centigrade\nHot",celsius);
else{
cout<<fixed<<setprecision(2)<<celsius<<" Centigrade\nModerate";
return 0;
}
question
<p>Problem Description:<br>China wants to control the rise in population, Xi shung was asked to
come up with a plan. </p><p>This time he is targeting marriages. Xi shung, being as intelligent
as he is, came up with the following plan:<br><br>A man with name M is allowed to marry a woman
with name W, only if M is a subsequence of W or W is a subsequence of M.<br><br>A is said to be a
subsequence of B, if A can be obtained by deleting some elements of B without changing the order
of the remaining elements.<br><br>Your task is to determine whether a couple is allowed to marry
or not, according to Xi shung's rule.<br><br>Constraints:<br>1 ≤ T ≤ 100<br>1 ≤ |M|, |W| ≤ 25000
(|A| denotes the length of the string A.)<br><br>Input Format:<br>The first line contains an integer
T, the number of test cases. T test cases follow. </p><p>Each test case contains two space
separated strings M and W.<br><br>Output Format:<br>Print the output "YES" if they are allowed
to marry, else print "NO". (quotes are meant for clarity, please don't print them)</p>
answer
#include<bits/stdc++.h>
int c=0,d=0;
while(a[c]!='\0'){
while(a[c]!=b[d]&& b[d]!='\0')
d++;
if(b[d]=='\0')
break;
d++;c++;
(a[c] =='\0')?puts("YES"):puts("NO");
int main()
int t;
scanf("%d",&t);
while(t--){
char M[25000],W[25000];
cin>>M>>W;
(strlen(M)<strlen(W))?check_subsequence(M,W):check_subsequence(W,M);
return 0;
cout<<endl;
question
answer
#include<iostream>
int main()
int t;
scanf("%i",&t);
int A[10][10];
while(t--){
int n,i,j;
scanf("%i",&n);
for(i=0;i<n;i++)
for(j=0;j<n;j++)
cin>>A[i][j];
for(i=0;i<n;i++)
for(j=n-1;j>=0;j--)
printf("%i ",A[j][i]);
cout<<endl;
return 0;
question
<p>Problem Description:<br>Surya was used to wear a smartwatch when he was in the Treadmill
and during Cycling. </p><p>Surya's Smart watch displays the total workout time in
seconds.</p><p>But Surya would like to know the time he spent for workout in H:M:S
format.</p><p><br>Can you help surya in knowing the time he spent on workout in the prescribed
format?<br><br>Constraints:<br>1 <= sec <= 10000<br><br>Input Format:<br>The only line of
output represents the workout timing in seconds<br><br>Output Format:<br>In the only line of
output print the workout timing of surya in the prescribed format.</p><p>Refer sample testcases for
format specification.</p>
answer
#include<iostream>
int main(){
int sec,h,m,s;
cin>>sec;
h=sec/3600;
m=(sec-(h*3600))/60;
s=(sec-(h*3600)-m*60);
printf("%dH:",h);
printf("%dM:",m);
printf("%dS",s);cout<<""; return 0;}
question
<p>Question description</p><p>Tina administer a large cluster of computers with hard drives that
use various file system types to store data. Tina recently decided to unify the file systems to the
same type. </p><p>That is quite a challenge since all the drives are currently in use, all of
them are filled with important data to the limits of their capacities, and you cannot afford to lose
any of the data. </p><p>Moreover, reformatting a drive to use a new file system may
significantly change the drive’s capacity. To make the reformat possible, Tina will have to buy an
extra hard drive. Obviously, you want to save money by minimizing the size of such extra
storage.</p><p>Tine can reformat the drives in any order. Prior to reformatting a drive, you must
move all data from that drive to one or more other drives, splitting the data if
necessary. </p><p>After a drive is reformatted, you can immediately start using it to store
data from other drives. It is not necessary to put all the data on the same drives they originally
started on – in fact, this might even be impossible if some of the drives have smaller capacity with
the new file system. </p><p>It is also allowed for some data to end up on the extra
drive.</p><p>Can you help Tina with this complicated task?</p><p>Constraints:</p><p>1 ≤ n ≤
10^6</p><p>1 ≤ a, b ≤ 10^9</p><p>Input Format:</p><p>The input begins with a line containing
one integer n, which is the number of drives in your cluster. </p><p>Following this are n lines,
each describing a drive as two integers a and b, where a is the capacity with the old file system and b
is the capacity with the new file system.</p><p>All capacities are given in gigabytes and satisfy. (One
thousand petabytes should be enough for everyone, right?)</p><p>Output Format:</p><p>Print the
total extra capacity in gigabytes you must buy to reformat the drives.</p><p>Explanation:</p><p>As
an example, suppose Tine have four drives A, B, C, and D with drive capacities 6, 1, 3, and 3
GB. </p><p>Under the new file system, the capacities become 6, 7, 5, and 5 GB,
respectively. </p><p>If Tine buy only 1 GB of extra space, you can move the data from drive B
there and then reformat drive B. Now Tina have 7 GB free on drive B, so Tina can move the 6 GB
from drive A there and reformat drive A. </p><p>Finally, Tina move the six total gigabytes
from drives C and D to drive A, and reformat C and D.</p>
answer
#include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N, a, b;
while (cin>>N) {
vector<pair<int,pair<int,int>>>StorageDrives;
cin>>a>>b;
sort(StorageDrives.begin(),StorageDrives.end());
int z=StorageDrives.size();
cap = StorageDrives[i].second.first;
question
answer
#include<bits/stdc++.h>
string s,k[Maxn];
int ans,t;
stack<string>hierarchy;
return true;
return false;
int main(){
cin>>s;
int n=s.size();
for(int i=0;i<n;i++){
if(name(s[i]))
k[t]+=s[i];
hierarchy.push(k[t]),ans+=mp[k[t]],mp[k[t]]++,t++;
if(s[i]=='.')
mp[hierarchy.top()]--,hierarchy.pop();
cout<<ans;
question
answer
#include <iostream>
int main()
int M,initialtemp,finaltemp;
float Q;
cin>>M>>initialtemp>>finaltemp;
Q=M*(finaltemp - initialtemp)*4184;
cout<<""<<Q;
return 0;
question
<p>Question description:</p><p>Nerdumaran Rajangam has his own Airline called Air Deccan and it
is flying at a constant height of ℎ meters above the ground surface. </p><p>Let's consider that
he is flying from the point (−10^9,ℎ) to the point (10^9,ℎ) parallel with 𝑂𝑥 axis.</p><p>Chaithanya
the friend of Nerdumaran Rajangam is inside the plane, ready to start his flight at any
moment.</p><p>After jumping from the plane, Chaithanya will fly in the same direction as the
plane, parallel to 𝑂𝑥 axis, covering a unit of distance every second. </p><p>Naturally, he will
also descend thus his second coordinate will decrease by one unit every second.</p><p>There are
ascending air flows on certain segments, each such segment is characterized by two numbers 𝑥1 and
𝑥2 (𝑥1<𝑥2) representing its endpoints. </p><p>No two segments share any common
points. </p><p>When the Chaithanya is inside one of such segments, he doesn't descend, so
his second coordinate stays the same each second. </p><p>The Chaithanya still flies along 𝑂𝑥
axis, covering one unit of distance every second.</p><p>Determine the maximum distance along 𝑂𝑥
axis from the point where the Chaithanya's flight starts to the point where his flight ends if the
Chaithanya can choose any integer coordinate to jump from the plane and start his
flight. </p><p>After touching the ground the Chaithanya stops altogether, so he cannot glide
through an ascending airflow segment if his second coordinate is
0.</p><p>Constraints:</p><p>1≤𝑛≤2⋅10^5</p><p>1≤ℎ≤10^9</p><p>1≤𝑥𝑖1<𝑥𝑖2≤10^9</p><p>Inp
ut Format:</p><p>The first line contains two integers 𝑛 and ℎ representing the number of ascending
air flow segments and the altitude at which the plane is flying, respectively.</p><p>Each of the next
𝑛 lines contains two integers 𝑥𝑖1 and 𝑥𝑖2 representing the endpoints of the 𝑖-th ascending air flow
segment. No two segments intersect, and they are given in ascending order.</p><p>Output
Format:</p><p>Print one integer representing the maximum distance along 𝑂𝑥 axis that the
glider can fly from the point where he jumps off the plane to the point where he lands if he can start
his flight at any integer coordinate.</p>
answer
#include<bits/stdc++.h>
int a[200069],b[200069],c[200069],h,i,j,k,l,m,n;
class FyyHigh{
f(i,0,n)
cin>>a[i]>>b[i];
f(i,0,n)
c[i]=a[i+1]-b[i];
f(i,0,n){
m= (b[j]-a[i])+(h-k);
k-=c[i];
l=max(l,m);}
return l;
};
int main(){
cin>>n>>h;
FyyHigh Diastance;
cout<<Diastance.Plane(n,h);
question
<p>Question description:</p><p>Jenni had a square painted on a piece of paper, the square's side
equals <i>n</i> meters. </p><p>Rohit draws crosses on the square's
perimeter. </p><p>Rohit paints the first cross in the lower left corner of the
square. </p><p>Then Rohit moves along the square's perimeter in the clockwise direction
(first upwards, then to the right, then downwards, then to the left and so on). </p><p>Every
time he walks (<i>n</i> + 1) meters, he draws a cross (see picture for
clarifications).</p><p>Constraints:</p><p>1 ≤ <i>t</i> ≤ 50</p><p>1 ≤ <i>n<sub>i</sub></i> ≤ 10<su
p>9</sup></p><p>Input Format:</p><p>The first line contains integer <i>t representing the number
of testcases.</i></p><p>The second line contains <i>t</i> space-separated integers
<i>n<sub>i</sub></i> representing the sides of the square for each test sample.</p><p>Output
Format:</p><p>For each test sample print on a single line the answer to it, that is, the number of
crosses Rohit will draw as he will move along the square of the corresponding
size. </p><p>Print the answers to the samples in the order in which the samples are given in
the input.</p>
answer
#include <iostream>
if(T%2==0)
return 4*T+1;
else if(T%4==1)
return 2*T+1;
else
return T+1;
int main()
int T,n;
cin>>T;
while(T--){
cin>>n;
cout<<Square(n)<<endl;
return 0;
question
answer
#include <bits/stdc++.h>
int main()
{
float height,base;
try{
cin>>height;
cin>>base;
if(cin){
cout<<fixed<<setprecision(3)<<height*base/2;
else
throw 0;
catch(int cal){
cout<<"Incomplete Information";
return 0;
question
answer
#include <iostream>
class Student{
public:
void accept(){}
};
public:
void check(){}
};
public:
int n;
void print(){
cin>>n;
if(n>=60)
else
};
int main()
Result r;
r.accept();
r.check();
r.print();
return 0;
question
<p>Question description:</p><p>Before the start of the Hockey season in Australia a strange magic
ritual is held. </p><p>The most experienced magicians have to find a magic matrix of the size
<i>n</i> × <i>n</i> (<i>n</i> is even number). </p><p>Gods will never allow to start the
championship without it.</p><p>Matrix should contain integers from 0 to <i>n</i> - 1, main
diagonal should contain only zeroes and matrix should be symmetric. </p><p>Moreover, all
numbers in each row should be different. <br>Magicians are very tired of the thinking
process, so they ask you to write a program to find such
matrix.</p><p>Constraints:</p><p>2 ≤ <i>n</i> ≤ 1000</p><p>Input Format:</p><p>The first line
contains one integer <i>n. n</i> is even.</p><p>Output Format:</p><p>Output <i>n</i> lines with
<i>n</i> numbers each the required matrix. Separate numbers with spaces. </p>
answer
#include <bits/stdc++.h>
class Ritual{
return 1;
};
int n;
int a[1001][1001];
int main(){
cin>>n;
Ritual find;
find.Magic(n);
a[i][j]=(i+j)%(n-1)+1;
a[i][n]=a[n][i]=a[i][i];
a[i][i]=0;
cout<<a[i][j]<<" ";
cout<<'\n';
}
}
question
answer
#include <iostream>
int n,m,k,r,c,i,s,a[1005];
int main(){
cin>>n>>m>>k;
for(i=1;i<=n;i++)a[i]=1e7;
for(;n--;){
cin>>r>>c;
a[r]=min(a[r],c);
for(i=1;i<=m;i++)s+=a[i]%10000000;
cout<<min(k,s);
return 0;
question
answer
#include <iostream>
class Employee{
};
};
int num,pay,acc,hr,da,pf;
string name,des,bank,ifsc;
void getBankDetails(){
cin>>num>>name>>des>>pay>>hr>>da>>pf>>bank>>ifsc>>acc;
void display(){
cout<<"Emp number:"<<num<<endl;
cout<<"Emp name:"<<name<<endl;
cout<<"Emp designation:"<<des<<endl;
cout<<"Emp Bank:"<<bank<<endl;
cout<<"Emp IFSC:"<<ifsc<<endl;
};
int main()
BankCredit s;
s.getBankDetails();
s.display();
return 0;
question
answer
#include <iostream>
class Shape{
public:
int len,wid;
len=l;
wid=b;
};
public:
void output(){
cout<<len*wid<<endl;
};
public:
void output(){
//if((len*wid)%2==0)
cout<<0.5*len*wid<<endl;
//else
//cout<<len*wid/2+1<<endl;
};
int main()
{
int l,b;
cin>>l>>b;
Rectangle rect;
Triangle tri;
rect.input(l,b);
tri.input(l,b);
rect.output();
tri.output();
return 0;
question
answer
#include <iostream>
class person{
public:
string first,last,m,c,level;
int age;
void input_person();
void display_person();
};
void person::input_person(){
cin>>first>>last>>m>>age>>c>>level;
void person::display_person(){
cout<<"Age:"<<age<<endl<<"College:"<<c<<endl<<"Level:"<<level;
public:
void input_student(){}
void display_student(){}
};
int main()
student s;
s.input_student();
s.display_student();
s.input_person();
s.display_person();
question
answer
#include <bits/stdc++.h>
void solve(){
cout<<"requestVec.end() std::vector<client>served;
std::vector<client>requestVec(n,PhotoClients); requestVec.begin()";
struct node
ll v,id;
}c[200005];
ll ot[200005],p;
int main()
ios::sync_with_stdio(0);
ll n,d,a,b,x,y;
cin>>n>>d>>a>>b;
for(int i=1;i<=n;i++)
{
cin>>x>>y;
c[i].v=a*x+b*y;
c[i].id=i;
for(int i=1;i<=n;i++)
d-=c[i].v;
if(d<0) break;
ot[++p]=c[i].id;
cout<<p<<"\n";
question
<p>Question description:</p><p>Arron was given <i>n</i> points on a plane. All points are
different.</p><p>Now Arron needs to find the number of different groups of three points
(<i>A</i>, <i>B</i>, <i>C</i>) such that point <i>B</i> is the middle of segment
<i>AC</i>.</p><p>The groups of three points are considered unordered, that is, if point <i>B</i> is
the middle of segment <i>AC</i>, then groups (<i>A</i>, <i>B</i>, <i>C</i>) and
(<i>C</i>, <i>B</i>, <i>A</i>) are considered the
same.</p><p>Constraints:</p><p>3 ≤ <i>n</i> ≤ 3000</p><p> -
1000 ≤ <i>x<sub>i</sub></i>, <i>y<sub>i</sub></i> ≤ 1000</p><p>Input Format:</p><p>The first
line contains a single integer <i>n</i> — the number of points.</p><p>Next <i>n</i> lines contain
the points. </p><p>Next <i>n</i> lines contain the points. The <i>i</i>-th line contains
coordinates of the <i>i</i>-th point: two space-separated integers
<i>x<sub>i</sub></i>, <i>y<sub>i</sub></i> .</p><p>Output Format:</p><p>Print the single
number — the answer to the problem.</p>
answer
#include<bits/stdc++.h>
#define f scanf("%ld",&n);
int n,x[3001],y[3001],ans;
bool point[2001][2001];
void solve(){
cout<<"std::vector<std::pair<long,long>>points(n); sort(points.begin(),points.end());";
int main()
cin>>n;
for(int i=0;i<n;i++)
cin>>x[i]>>y[i];
x[i]+=1000;
y[i]+=1000;
point[x[i]][y[i]]=1;
for(int i=0;i<n-1;i++)
for(int j=i+1;j<n;j++)
if((x[i]+x[j])%2==0&&(y[i]+y[j])%2==0)
ans+=point[(x[i]+x[j])/2][(y[i]+y[j])/2];
cout<<ans;
question
answer
#include<bits/stdc++.h>
map<int,vector<int>>Stamps;
void solve(){}
int main(){
int n,x;
cin>>n;
for(int i=0;i<n;i++){
int a,b;
cin>>a>>b;
Stamps[a].push_back(b);
Stamps[b].push_back(a); }
for(auto i:Stamps)
if(i.second.size()==1)x=i.first;
cout<<x;
int p=-1;
f(n){
if(Stamps[x][0]!=p)
x=Stamps[p=x][0];
else
x=Stamps[p=x][1];
cout<<' '<<x;
question
answer
#include <iostream>
class Indian{
int n,x,c,sum=0;
public:void crossword(){
cin>>n>>x;
for(int i=0;i<n;i++){
cin>>c;
sum=sum+c;
if(sum-n+1==x)
cout<<"YES";
else
cout<<"NO";
};
int main()
Indian inr;
inr.crossword();
return 0;
question
answer
#include<bits/stdc++.h>
class Takeoff{
for(cin>>n>>s,a=0,b=-s-1;n--;){
cin>>h>>m;
if((h-a)*60+m-b>=2*s+2)break;
a=h;b=m;
cout<<a+(b+s+1)/60<<" "<<(s+b+1)%60;
};
int main(){
Takeoff obj;
obj.Time();
question
answer
#include<bits/stdc++.h>
string s,a,c;
map<string,int>m;
class StringPlay{
cin>>n>>s;
for(int i=0;i<n-1;i++){
c=s[i];
c+=s[i+1];
m[c]++;
if(m[c]>mx)mx=m[c],a=c;
cout<<a;
};
int main(){
StringPlay obj;
obj.Result();
question
<p>Question Description:</p><p>A very brave explorer Prabhakar once decided to explore Paris
catacombs. Since Prabhakar is not really experienced, his exploration is just walking through the
catacombs.</p><p>Catacombs consist of several rooms and bidirectional passages between some
pairs of them. Some passages can connect a room to itself and since the passages are built on
different depths they do not intersect each other. Every minute Prabhakar arbitrarily chooses a
passage from the room he is currently in and then reaches the room on the other end of the passage
in exactly one minute. When he enters a room at minute <i>i</i>, he makes a note in his logbook
with number <i>t<sub>i</sub></i>:</p><ul><li>If Prabhakar has visited this room before, he writes
down the minute he was in this room last time;</li><li>Otherwise, Prabhakar writes down an
arbitrary non-negative integer strictly less than a current minute <i>i</i>.</li></ul><p>Initially,
Prabhakar was in one of the rooms at minute 0, he didn't write down number
<i>t</i><sub>0</sub>.</p><p>At some point during his wandering, Prabhakar got tired, threw out
his logbook, and went home. Vasya found his logbook and now he is curious: what is the minimum
possible number of rooms in Paris catacombs according to Prabhakar's
logbook?</p><p>Constraints:</p><p>0 ≤ <i>t<sub>i</sub></i> < <i>i</i></p><p>1 ≤ <i>n</i> ≤ 2·1
0<sup>5</sup></p><p>Input Format:</p><p>The first line contains a single integer <i>n</i><sup>
</sup>then the number of notes in Prabhakar's logbook.</p><p>The second line contains <i>n</i>
non-negative integers <i>t</i><sub>1</sub>, <i>t</i><sub>2</sub>, ..., <i>t<sub>n </sub></i>notes
in the logbook.</p><p>Output Format:</p><p>In the only line print a single integer the minimum
possible number of rooms in Paris catacombs.</p>
answer
#include<bits/stdc++.h>
class catacombs{
public:void arbitrary(){
int n,a;
cin>>n;
set<int> se;
for(int i=0;i<n;i++){
cin>>a;
se.insert(a);
cout<<n-se.size()+1;
};
int main(){
catacombs ca;
ca.arbitrary();
question
<p>Question description:</p><p>A necklace can be described as a string of links ('-') and pearls ('o'),
with the last link or pearl connected to the first one.</p><p>You can remove a link or a pearl and
insert it between two other existing links or pearls (or between a link and a pearl) on the necklace.
This process can be repeated as many times as you like, but you can't throw away any
parts.</p><p>Can you make the number of links between every two adjacent pearls equal? Two
pearls are considered to be adjacent if there is no other pearl between them.</p><p>Note that the
final necklace should remain as one circular part of the same length as the initial
necklace.</p><p>Constraints:</p><p>3≤|𝑠|≤100</p><p>Input Format:</p><p>The only line of input
contains a string 𝑠, representing the necklace, where a dash '-' represents a link and the lowercase
English letter 'o' represents a pearl.</p><p>Output Format:</p><p>Print "YES" if the links and pearls
can be rejoined such that the number of links between adjacent pearls is equal. Otherwise print
"NO".</p>
answer
#include<bits/stdc++.h>
string s;
int a,b;
class Necklace{
cin>>s;
for(auto c:s)(c=='o'?a:b)++;
cout<<(a&&b%a?"NO":"YES");
};
int main()
Necklace obj;
obj.Altering();
return 0;
question
answer
#include <iostream>
class Person{
};
};
public:
int n1,n2,basic,hra,da,pf;
string name1,role1,col,ifsc,name2,role2;
void getdetail(){
cin>>n1>>name1>>role1>>col>>ifsc>>n2>>name2>>role2;
void getEmployeeDetails(){
cin>>basic>>hra>>da>>pf;
void student_display(){
cout<<"Person number:"<<n1<<endl;
cout<<"Person name:"<<name1<<endl;
cout<<"Person Role:"<<role1<<endl;
cout<<"Student IFSC:"<<ifsc<<endl;
cout<<"Person number:"<<n2<<endl;
cout<<"Person name:"<<name2<<endl;
cout<<"Person Role:"<<role2<<endl;
}
void employee_display(){
cout<<"Employee HRA:"<<hra<<endl;
cout<<"Employee DA:"<<da<<endl;
cout<<"Employee PF:"<<pf<<endl;
};
int main()
Student e;
e.getdetail();
e.getEmployeeDetails();
e.student_display();
e.employee_display();
return 0;
cout<<"s.student_display();";
question
answer
#include <iostream>
class student{
};
class employee{
public:
int roll;
string name,intern,degree;
void getcompany(){
cin>>name>>roll>>intern;
void getpdegree(){
cin>>degree;
void display(){
cout<<"Name:"<<name<<endl;
cout<<"Roll no:"<<roll<<endl;
cout<<"Internship:"<<intern<<endl;
cout<<"Degree:"<<degree;
};
};
int main()
project p1;
p1.getcompany();
p1.getpdegree();
p1.employee::display();
return 0;
question
<p>Question Description:</p><p>James has <i>n</i> different boxes. The first of them contains
some balls of <i>n</i> different colors.</p><p>James wants to play a strange game. He wants to
distribute the balls into boxes in such a way that every <i>i</i> (1 ≤ <i>i</i> ≤ <i>n</i>) <i>i</i>-th
box will contain all balls with color <i>i</i>.</p><p>In order to do this, James will make some turns.
Each turn he does the following:</p><ol><li>James chooses any non-empty box and takes all balls
from this box;</li><li>Then James chooses any <i>k</i> empty boxes (the box from the first step
becomes empty, and James is allowed to choose it), separates the balls he took on the previous step
into <i>k</i> non-empty groups, and puts each group into one of the boxes. He should put each
group into a separate box. He can choose either <i>k</i> = 2 or <i>k</i> = 3.</li></ol><p>The
<i>penalty</i> of the turn is the number of balls James takes from the box during the first step of the
turn. And the <i>penalty</i> of the game is the total <i>penalty</i> of turns made by James until he
distributes all balls to corresponding boxes.</p><p>Help James to determine the minimum possible
<i>penalty</i> of the
game!</p><p>Constraints:</p><p>1 ≤ <i>n</i> ≤ 200000</p><p>1 ≤ <i>a<sub>i</sub></i> ≤ 10<sup>
9</sup></p><p>Input Format:</p><p>The first line contains one integer number <i>n</i> the
number of boxes and colors.</p><p>The second line contains <i>n</i> integer numbers
<i>a</i><sub>1</sub>, <i>a</i><sub>2</sub>, ..., <i>a<sub>n</sub></i>, where
<i>a<sub>i</sub></i> is the number of balls with color <i>i</i>.</p><p>Output Format:</p><p>Print
one number the minimum possible <i>penalty</i> of the game.</p>
answer
#include <bits/stdc++.h>
class boxes{
public:void colorBalls(){
ll n,a,ans=0;
cin>>n;
if(!(n&1)) pq.push(0);
while(pq.size()!=1){
a=pq.top();pq.pop();
a+=pq.top();pq.pop();
a+=pq.top();pq.pop();
ans+=a;
pq.push(a);
cout<<ans;
};
int main(){
boxes b;
b.colorBalls();
question
answer
#include<bits/stdc++.h>
class Number{
cin>>n>>k;
for(a[0]=1;cin>>a[++i];);
sort(a,a+n+1);
cout<<(a[k]!=a[k+1]?a[k]:-1);
};
int main(){
Number obj;
obj.Range();
question
answer
#include <iostream>
class Sequence{
int n;
cin>>n;
cout<<n/2+1;
};
int main()
{
Sequence obj;
obj.Split();
return 0;
question
answer
#include<bits/stdc++.h>
class Candies{
int i=1,t,n,k,m,d,ans=0;
cin>>n>>k>>m>>d;
for(;i<=d;i++){
if((n-1)/k<i-1)
break;
t=k*i-k+1;
ans=max(ans,min(m,n/t)*i);
}
cout<<ans;
};
int main()
Candies obj;
obj.Split();
question
<p>Question description:</p><p>For years, the Day of city N was held in the most rainy day of
summer. New mayor decided to break this tradition and select a <i>not-so-rainy</i> day for the
celebration. </p><p>The mayor knows the weather forecast for the 𝑛 days of summer. On the
𝑖-th day, 𝑎𝑖 millimeters of rain will fall. All values 𝑎𝑖 are distinct.</p><p>The mayor knows that
citizens will watch the weather 𝑥 days before the celebration and 𝑦 days after. Because of that, he
says that a day 𝑑 is <i>not-so-rainy</i> if 𝑎𝑑 is smaller than rain amounts at each of 𝑥 days before
day 𝑑 and and each of 𝑦 days after day 𝑑. </p><p>In other words, 𝑎𝑑<𝑎𝑗 should hold for all
𝑑−𝑥≤𝑗<𝑑 and 𝑑<𝑗≤𝑑+𝑦. </p><p>Citizens only watch the weather during summer, so we
only consider such 𝑗 that 1≤𝑗≤𝑛.</p><p>Help mayor find the earliest <i>not-so-rainy</i> day of
summer.</p><p>Constraints:</p><p>1≤𝑛≤100000</p><p>0≤𝑥</p><p>𝑦≤7</p><p>Input
Format:</p><p>The first line contains three integers 𝑛, 𝑥 and 𝑦 representing the number of days in
summer, the number of days citizens watch the weather before the celebration and the number of
days they do that after.</p><p>The second line contains 𝑛 distinct integers 𝑎1, 𝑎2, ..., 𝑎𝑛 where 𝑎𝑖
denotes the rain amount on the 𝑖-th day.</p><p>Output Format:</p><p>Print a single
integer — the index of the earliest <i>not-so-rainy</i> day of summer. </p>
answer
#include <iostream>
class Season{
int n,x,y;
cin>>n>>x>>y;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
int smallest=a[0],index=1;
for(int i=0;i<n;i++){
if(a[i]<=smallest){
smallest=a[i];
//cout<<a[i]<<endl;
index=i;
cout<<index+1;
};
int main()
Season obj;
obj.PredictNotRainyDay();
return 0;
question
answer
#include <iostream>
#include <math.h>
int main(){
int m,n;
cin>>m>>n;
int no=ceil(m*n/(2.0*1));
cout<<no;
return 0;}
question
<p>Problem Description:<br>Simon loves to listen to music while walking his way to attend boring
lectures in his college.<br><br>He has a playlist of songs which has all songs of equal length, L. (in
seconds)<br><br>One day while going on his way, he decided to calculate his average walking speed
and he comes to know that he walks at a speed of 0.5 m/s.<br><br>You will be given the distance D
,he has to walk down to reach his class, after which he stops the music.<br><br>You have to find the
minimum number of songs he needs to add into his playlist so as music plays in the whole
path.<br><br>Constraints:<br>1<= L <=120 (in seconds)<br>1<= D <=5000 (in
meters)<br> </p><p>Input Format:<br>Only line of input contain two integer L and D
separated by a space representing length of song and distance he has to walk
respectively.<br><br>Output Format:<br>In the only line of output print the Integer value equal to
number of songs he need to add into playlist before start to walk.</p>
answer
#include<iostream>
int main()
int L,D;
cin>>L>>D;
int sec=D/0.5;
int song=sec/L+1;
if(song!=sec){
printf("%d",song);
}
else{
cout<<song;
return 0;}
question
<p>Problem Description:<br>Today is Jack's birthday and he is looking forward to his gift. As usual,
the gift is hidden and Jack has to follow a sequence of N instructions to reach it.<br><br>Initially,
Jack is standing in the cell (0,0) of a two-dimensional grid. </p><p>The sequence of
instructions is given as a string S. If we denote Jack's current cell by (x,y), each character of S
corresponds to an instruction as follows:<br><br>'L' means to go left, i.e. to the cell (x−1,y)<br>'R'
means to go right, i.e. to the cell (x+1,y)<br>'U' means to go up, i.e. to the cell (x,y+1)<br>'D' means
to go down, i.e. to the cell (x,y−1)<br><br>In addition, Jack should never perform multiple
consecutive moves along the same axis of the grid. </p><p>If there are multiple consecutive
instructions to move along the same axis (left/right or up/down), he should perform only the first of
these moves.<br><br>Find the cell (xg,yg) which contains the hidden
gift.<br><br>Constraints:<br>1≤T≤100<br>1≤N≤1,000<br>S contains only characters 'L', 'R', 'U' and
'D'<br><br>Input Format:<br>The first line of the input contains a single integer T denoting the
number of test cases. The description of T test cases follows.<br>The first line of each test case
contains a single integer N.<br>The second line contains a single string S with length
N.<br><br>Output Format:<br>Print a single line containing two space-separated integers xg and
yg.</p>
answer
#include<bits/stdc++.h>
int main()
{ char S[100];
int t,i,r,u,d,n;
int l;
scanf("%d",&t);
while(t--)
int H[100]={};
scanf("%d",&n);
cin>>S;
for(i=0;i<n;i++)
if(S[i]=='R'&&S[i-1]!='L'&&S[i-1]!='R')
H[S[i]-65]++;
else if(S[i]=='L'&&S[i-1]!='R'&&S[i-1]!='L')
H[S[i]-65]++;
if(S[i]=='U'&&S[i-1]!='U'&&S[i-1]!='D')
H[S[i]-65]++;
if(S[i]=='D'&&S[i-1]!='U')
H[S[i]-65]++;
l=H[76-65];
r=H[82-65];
u=H[85-65];
d=H[68-65];
printf("%d %d\n",r-l,u-d);
return 0;
question
<p>Problem Description</p><p>Maran the head of data verification division of the popular Data
Analytics company is responsible for verification of predicted change in data values based on some
pattern from its initial value provided to him.</p><p>Since the data were huge in numbers, manual
verification process is too difficult for Maran.</p><p>The expected data value pattern is as
follows:</p><p>Decrement of First Number and Increment of Second Number</p><p>Increment of
First Number and Decrement of Second Number</p><p>Decrement of First Number and Increment
of Second Number</p><p>Increment of First Number and Decrement of Second
Number</p><p>Decrement of First Number and Increment of Second Number</p><p>Function
Description</p><p>Use postfix mode for firstnum </p><p>Use prefix mode for
secondnum</p><p>Constraints</p><p>1≤firstnum≤500</p><p>1≤secondnum≤500</p><p>Input
Format:</p><p>Only line of Input has two integers separated by a space representing the value of
firstnum and secondnum respectively.</p><p>Output Format:</p><p>Print the Output by
performing the expected operation in the expected pattern.</p><p>Refer sample testcases for
Format specification.</p>
answer
#include <iostream>
int main()
int firstnum,secondnum;
cin>>firstnum>>secondnum;
cout<<firstnum--<<" "<<++secondnum<<endl;
cout<<firstnum++<<" "<<--secondnum<<endl;
cout<<firstnum--<<" "<<++secondnum<<endl;
cout<<firstnum++<<" "<<--secondnum<<endl;
cout<<firstnum<<" "<<++secondnum;
return 0;
question
<p>Problem Description:<br>Raina usually likes to play cricket, but now, he is bored of playing it too
much, so he is trying new games with strings. Raina's friend Dhoni gave him binary strings S and R,
each with length N, and told him to make them identical. </p><p>However, unlike Dhoni,
Raina does not have any superpower and Dhoni lets Raina perform only operations of one type:
choose any pair of integers (i,j) such that 1≤i,j≤N and swap the i-th and j-th character of
S. </p><p>He may perform any number of operations (including zero).<br><br>For Raina, this
is much harder than cricket and he is asking for your help. </p><p>Tell him whether it is
possible to change the string S to the target string R only using operations of the given
type.<br><br>Constraints:<br>1≤T≤400<br>1≤N≤100<br>|S|=|R|=N<br>S and R will consist of only
'1' and '0'<br><br>Input Format:<br>The first line of the input contains a single integer T denoting
the number of test cases. The description of T test cases follows.<br>The first line of each test case
contains a single integer N.<br>The second line contains a binary string S.<br>The third line contains
a binary string R.<br><br>Output Format:<br>Print a single line containing the string "YES" if it is
possible to change S to R or "NO" if it is impossible (without quotes).</p>
answer
#include<iostream>
#include <string.h>
if(ch=='1')
return 1;
else
return 0;
int main()
{ int i,t,n;
scanf("%d",&t);
while(t--)
int count=0,count1=0;
char S[100],R[100];
scanf("%d",&n);
cin>>S>>R;
for(i=0;i<n;i++)
count+=check(S[i]);
count1+=check(R[i]);
return 0;
question
<p>Problem Description</p><p>Karthik asks Jessi for a date .</p><p>But Karthik is a
hardworking guy and has a value for money so he already pre-planned about his date and fixed a
budget to spend from his savings .</p><p>Given a fixed budget B and an array A[ ] of size N for the
amount of N expenses .</p><p>You have to calculate the total amount and check whether the date
costs him beyond his fixed budget . </p><p>If the total amount goes beyond budget then
print “YES” otherwise “NO” .</p><p>Constraints:</p><p>1≤T≤100</p><p>1≤N≤10 power
4</p><p>1≤A[i]≤10 power 4</p><p>Input Format:</p><p>First line will contain T, number of
testcases. Then T testcases follow.</p><p>First line of each testcase contains of a single line of input,
two integers N,B.</p><p>Second line of each testcase contains N integers A[0],A[1],...,A[N−1]
separated by a single space.</p><p>Output Format:</p><p>For each testcase, output in a single line
answer YES or NO .</p>
answer
#include <iostream>
int main()
int t;
cin>>t;
while(t--)
int n,b,i,sum=0;
cin>>n>>b;
int a[n];
for(i=0;i<n;i++){
cin>>a[i];
sum+=a[i];
if(sum>b){
cout<<"YES\n";
else{
cout<<"NO\n";
}
return 0;
question
answer
#include <stdio.h>
int main()
{int a,n,k,i,b;
scanf("%d%d%d",&a,&n,&k);
for(i=0;i<k;i++){
b=a%(n+1);
printf(" %d",b);
a=a/(n+1);
while(a>0){}
return 0;
printf("cin>>n>>b>>s;");
question
<p>Problem Description<br><br>Yasir was making a kite.His sister Athika said that she can print the
frame of the kite using biodegradable material and a 3D printer .</p><p>The shape of the frame is
simple in the top it is triangle between the triangles mid point there comes a straight thicker line
which extends upto the bottom.</p><p>Once printed a sheet of paper can be used to cover the
frame. Athika made the frame using the 3d printer and asked Yasir to buy a sheet of paper
.</p><p>But Yasir wants to know the exact area covered by the top triangle of the
frame. </p><p>Athika had the dimensions fed in her laptop help her to compute the area of
the triangle using the 3 sides.</p><p><br>Functional Description :<br>Let s1, s2 and s3 be the
lengths of the sides. </p><p>Let s = (s1 + s2 + s3)/2. </p><p>Then the area of the
triangle can be calculated using the following formula:<br><br>Area =sqrt(s × (s − s1) × (s − s2) × (s −
s3))<br><br>Constraints:<br><br>1.00 ≤ s1 ≤ 10.00<br><br>1.00 ≤ s2 ≤ 10.00<br><br>1.00 ≤ s3 ≤
10.00<br><br>Input Format:<br><br>First Line: Single value representing the Length of
side1</p><p>Second Line: Single value representing the Length of side2</p><p>Third Line: Single
value representing the Length of side3<br><br>Output Format:<br><br>Print the area of the
triangle.</p>
answer
#include<bits/stdc++.h>
int main()
float s1,s2,s3,s,area;
cin>>s1>>s2>>s3;
s=(s1+s2+s3)/2;
area=sqrt(s*(s-s1)*(s-s2)*(s-s3));
cout<<fixed<<setprecision(2)<<area;
return 0;}
question
<p>Problem Description:<br><br>Binita always dreamed of flying in the sky from her childhood.Her
goal was to become a pilot.</p><p>When she applied for the pilot training program she cleared the
entrance exam but failed the physical test due to overweight.</p><p>She forget to take care of her
health during the preparation.</p><p>But she had the spirit of not giving up.</p><p>Binita joined a
gym to pass the physical test next time.</p><p>Her gym trainer asked her to calculate BMI for giving
her a proper diet plan,But she had other works to do can you help this motivated
girl?<br><br>Functional Description:<br><br>BMI = weight / height ×
height<br><br>Constraints:<br><br>40≤ weight ≤80<br><br>1.50 ≤ Height ≤ 1.72<br><br>Input
Format:<br><br>First line has the value of weight of type integer<br>Second line has the value of
height of type float<br><br>Output Format:<br>Print the BMI with only two values after decimal
points.</p>
answer
#include <iostream>
#include<iomanip>
int main()
float height,bmi;
int weight;
cin>>weight;
cin>>height;
bmi=weight/(height*height);
cout<<fixed<<setprecision(2)<<bmi;
return 0;
question
answer
#include <stdio.h>
int main()
int days;
scanf("%d",&days);
switch(days)
case 1:
printf("Azure"); break;
case 2:
printf("Beige"); break;
case 3:
case 4:
printf("Champagne"); break;
case 5:
case 6:
printf("Ivory"); break;
case 7:
printf("Pear"); break;
default:
return 0;
printf("cin>>days;cout<<");
question
answer
#include <iostream>
int main() {
int mat[10][10];
f(i,row)
f(j,column)
f(i,row)
f(j,column)
mat[j][i] = a[i][j];
f(i,column){
f(j,row){
cout<<endl;
return 0;
}
question
answer
#include<iostream>
class supermarket{
};
public:
void chocolate(){
cin>>t;
while(t--){
cin>>n>>m>>s>>x;
res=n/x+(n/x/m)*s;
cout<<res;
void roubles(){}
};
int main(){
customer cm;
cm.chocolate();
cm.roubles();
question
answer
#include<bits/stdc++.h>
class sticks{
};
public:
void phase(){}
void phase1(){
int a[3];
cin>>a[0]>>a[1]>>a[2];
sort(a,a+3);
cout<<max(0,1+a[2]-a[0]-a[1]);
}
};
int main()
centimeters cen;
cen.phase1();
cen.phase();
question
<p>Question description:</p><p>Fazil is an athlete from his school time. Now he joined his under
graduation in a famous institution which motivates students who are in sports. The Institution even
provides scholarships for the sports quota.</p><p>So Fazil planned to apply for the scholarship for
which he needs to calculate the percentage which considers the marks of CT1,CT2 and his Sports
Performance marks.</p><p>Can you help Fazil by calculating the
same?</p><p>Constraints:</p><p>1≤m1≤100</p><p>1≤m2≤100</p><p>1≤sm≤100</p><p>Input
Format:</p><p>First line : Reg.Number</p><p>Second line : CT1 Mark</p><p>Third line : CT2
Mark</p><p>Fourth line : Sports Mark</p><p>Output format:</p><p>In the first line of output print
the Reg.Number</p><p>In the second line of output print the total marks</p><p>In the third line of
output print the percentage</p>
answer
#include <iostream>
class student{
public:
int reg,ct1,ct2;
void get(){
cin>>reg>>ct1>>ct2;
};
class sports{
public:
int spm;
void getsm(){
int d;
cin>>d;
spm=d;
};
public:
void display(){
cout<<reg<<endl<<ct1+ct2+spm<<endl<<(float)(ct1+ct2+spm)/3<<endl;
};
int main()
statement obj;
obj.get();
obj.getsm();
obj.display();
return 0;
question
<p>Question Description:</p><p>VSR and his friend Giraffe are currently in their room, solving
some problems. Giraffe has written on the board an array 𝑎1, 𝑎2, ..., 𝑎𝑛 of
integers, such that 1≤𝑎1<𝑎2<…<𝑎𝑛≤103, and then went to the bathroom.</p><p>VSR
decided to prank his friend by erasing some consecutive elements in the array. Since he doesn't
want for the prank to go too far, he will only erase it in a way, such that Giraffe can still restore the
array using the information from the remaining elements. </p><p>Because Giraffe has
created the array, he's also aware that it's an increasing array and all the elements are integers in
the range [1,10^3].</p><p>VSR wonders what is the greatest number of elements he can
erase?</p><p>Constraints:</p><p>1≤𝑛≤100</p><p>1≤𝑎1<𝑎2<⋯<𝑎𝑛≤10^3</p><p>Input
Format:</p><p>The first line of the input contains a single integer 𝑛 the number of elements
in the array.</p><p>The second line of the input contains 𝑛 integers 𝑎𝑖 the array is written by
Giraffe</p><p>Output Format:</p><p>Print a single integer the maximum number of consecutive
elements in the array that VSR can erase.</p><p>If it is impossible to erase even a single element,
print 0.</p>
answer
#include<bits/stdc++.h>
class friends{
};
public:
int n,i,j,r,a[179];
void Giraffe(){}
void far(){
cin>>n;
a[0]=0;a[n+1]=1001;
for(i=1;i<=n;i++)cin>>a[i];
n+=2;
for(i=0;i<n-2;i++)
for(j=i+2;j<n;j++)
if(a[j]-a[i]==j-i)r=max(r,j-i-1);
cout<<r;
};
int main()
prank p;
p.Giraffe();
p.far();
question
<p>Question Description:</p><p>Bharath shop sells 𝑛 kinds of juices. Each juice has its
price 𝑐𝑖. Each juice includes some set of vitamins in it. There are three types of vitamins:
vitamin "A", vitamin "B" and vitamin "C". Each juice can contain one, two or all three types of
vitamins in it.</p><p>Peter knows that he needs all three types of vitamins to stay healthy. What is
the minimum total price of juices that Peter has to buy to obtain all three vitamins? Peter obtains
some vitamin if he buys at least one juice containing it and drinks
it.</p><p>Constraints:</p><p>1≤𝑛≤1000</p><p>1≤𝑐𝑖≤100000</p><p>Input Format:</p><p>The
first line contains a single integer 𝑛 the number of juices.</p><p>Each of the next 𝑛
lines contains an integer 𝑐𝑖 and a string 𝑠𝑖 the price of the 𝑖-th juice and the
vitamins it contains. </p><p>String 𝑠𝑖 contains from 1 to 3 characters, and the only
possible characters are "A", "B", and "C". </p><p>It is guaranteed that each letter appears no
more than once in each string 𝑠𝑖. The order of letters in strings 𝑠𝑖 is arbitrary. Output
Format:</p><p>Print -1 if there is no way to obtain all three vitamins. Otherwise, print the minimum
total price of juices that Peter has to buy to obtain all three vitamins.</p>
answer
#include<bits/stdc++.h>
class stayHealthy{
};
public:
void juice(){}
void drinks(){}
};
int main(){
vitamin vin;
vin.juice();
vin.drinks();
int n,i,j;
cin>>n;
long d[8]={0},c;
for(i=1;i<8;i++)
d[i]=1000000;
for(i=0;i<n;i++)
cin>>c>>st;
int z=st.length();
for(j=0;j<z;j++)
s|=(1<<(st[j]-'A'));
for(j=0;j<8;j++)
d[s|j]=min(d[s|j],d[j]+c);
if(d[7]>=1000000)
cout<<"-1";
else
cout<<d[7];
return 0;
question
answer
#include <cstdio>
class getInput{
};
public:
void read(){
int pre = 1;
pre = cur;
printf("\n");
void check(){
};
int main() {
sequence se;
se.read();
se.check();
return 0;
question
<p>Question Description:</p><p>Two players A and B have a list of 𝑛 integers each. They
both want to maximize the subtraction between their score and their opponent's score.</p><p>In
one turn, a player can either add to his score any element from his list (assuming his list is not
empty), the element is removed from the list afterward. Or remove an element from his opponent's
list (assuming his opponent's list is not empty).</p><p>Note, that in case there are equal elements in
the list only one of them will be affected in the operations above. For example, if there are elements
{1,2,2,3} in a list and you decided to choose 2 for the next turn, only a single instance of 2 will be
deleted (and added to the score, if necessary).</p><p>Player A starts the game and the game stops
when both lists are empty. Find the difference between A's score and B's score at the end of the
game, if both of the players are playing optimally.</p><p>Optimal play between two players means
that both players choose the best possible strategy to achieve the best possible outcome for
themselves. In this problem, it means that each player, each time makes a move, which maximizes
the final difference between his score and his opponent's score, knowing that the opponent is doing
the
same.</p><p>Constraints:</p><p>1≤𝑛≤100000</p><p>1≤𝑎𝑖≤10^6</p><p>1≤𝑏𝑖≤10^6</p><p>Input
Format:</p><p>The first line of input contains an integer 𝑛the sizes of the list.</p><p>The second
line contains 𝑛 integers 𝑎𝑖, describing the list of player A, who starts the game.</p><p>The third line
contains 𝑛 integers 𝑏𝑖, describing the list of player B.</p><p>Output Format:</p><p>Output the
difference between A's score and B's score (𝐴−𝐵) if both of them are playing optimally.</p>
answer
#include<bits/stdc++.h>
int64_t n,i,x,r;
pair<int64_t,int> a[222000];
class players{
};
};
void solve(){
cout<<"s.instance();s.elements();score s;";
int main(){
for(cin>>n,n*=2;i<n;i++)cin>>x,a[i]={x,i<n/2};
sort(a,a+n);
for(i=1;i<=n;i++){
if(i%2&&a[n-i].second)r+=a[n-i].first;
if(i%2==0&&a[n-i].second==0)r-=a[n-i].first;
cout<<r;
question
<p>Question Description:</p><p>There are 𝑛 jelly’s in a row. Each slime has an integer value
(possibly negative or zero) associated with it.</p><p>Any jelly can eat its adjacent jelly (the closest
slime to its left or to its right, assuming that this slime exists).</p><p>When a jelly with a
value 𝑥 eats a slime with a value 𝑦, the eaten jelly disappears, and the value of the
remaining jelly changes to 𝑥−𝑦.</p><p>The jellies will eat each other until there is only one
slime left.</p><p>Find the maximum possible value of the last
slime.</p><p>Constraints:</p><p>1≤𝑛≤500000</p><p>−10^9≤𝑎𝑖≤10^9</p><p>Input
Format:</p><p>The first line of the input contains an integer 𝑛 denoting the number of
jellies.</p><p>The next line contains 𝑛 integers 𝑎𝑖, where 𝑎𝑖 is the value
of 𝑖-th jelly.</p><p>Output Format:</p><p>Print only integer the maximum possible value of
the last jelly.</p>
answer
#include<bits/stdc++.h>
class jelly{
};
class child:public jelly{
public:
void read(){
int n;
cin>>n;
ll a[n];
for(int i=0;i<n;i++)
cin>>a[i];
sort(a,a+n);
ll ans=0;
ans+=a[n-1];
if(n>1)ans-=a[0];
for(int i=1;i<n-1;i++)
ans+=abs(a[i]);
cout<<ans<<endl;
void check(){}
};
int main(){
child ch;
ch.check();
ch.read();
question
<p>Question Description:</p><p>Christ has recently got a job as a cashier at a local store. His day at
work is 𝐿 minutes long. Christ has already memorized 𝑛 regular customers, the 𝑖-
th of which comes after 𝑡𝑖 minutes after the beginning of the day, and his service
consumes 𝑙𝑖 minutes. </p><p>It is guaranteed that no customer will arrive while Christ
is servicing another customer.</p><p>Christ is a bit lazy, so he likes taking smoke breaks for 𝑎
minutes each. </p><p>Those breaks may go one after another, but Christ must be present at
work during all the time periods he must serve regular customers, otherwise one of them may alert
his boss. What is the maximum number of breaks Christ can take during the
day?</p><p>Constraints:</p><p>0≤𝑛≤10^5</p><p>1≤𝐿≤10^9</p><p>1≤𝑎≤𝐿</p><p>0≤𝑡𝑖≤𝐿−1</p><
p>1≤𝑙𝑖≤𝐿</p><p>Input Format:</p><p>The first line contains three integers 𝑛, 𝐿
and 𝑎.</p><p>The 𝑖-th of the next 𝑛 lines contains two integers 𝑡𝑖
and 𝑙. It is guaranteed that 𝑡𝑖+𝑙𝑖≤𝑡𝑖+1 and 𝑡𝑛+𝑙𝑛≤𝐿.</p><p>Output
Format:</p><p>If at least one phone number can be made from these cards, output the maximum
number of phone numbers that can be made. Otherwise, output 0.</p>
answer
#include<iostream>
int a,i,l,n,s,x,y,z;
class pattern{
};
public:
void cards(){}
void digit(){}
};
int main(){
for(std::cin>>n>>l>>a;
n--;
s+=(y-x)/a,x=y+z)std::cin>>y>>z;
std::cout<<s+(l-x)/a;
number num;
num.digit();
num.cards();
question
answer
#include <iostream>
class getInput{
public:
int n,s;
void read(){
cin>>n>>s;
};
public:
void write(){
if(n<s){
if(s%n==0)
cout<<s/n;
else
cout<<s/n+1;
else
cout<<"1";
};
int main()
Divide div;
div.read();
div.write();
question
answer
#include <bits/stdc++.h>
int n,a,b,k,x,p,i,j,v[200005];
char m[200005];
class Shoot{
};
public:
void cells(){
}
};
int main(){
Ship obj;
obj.cells();
cin>>n>>a>>b>>k;
while(i<n){
cin>>m[i];
i++;
}i=0;
while(i<n){
if(m[i]=='0')x++;
else x=0;
if(x==b)p++,x=0,v[j]=i+1,j++;
i++;
}i=0;
cout<<p-a+1<<endl;
while(i<p-a+1){
cout<<v[i]<<" ";
i++;
question
<p>Question description:</p><p>Darshana has just graduated from one of the Top University in the
World and is now attending celebration party. </p><p>Students like to dream of a beautiful
life, so they used water glasses to construct a small pyramid. The height of the pyramid is
<i>n</i>. </p><p>The top level consists of only 1 glass, that stands on 2 glasses on the second
level (counting from the top), then 3 glasses on the third level and so on.The bottom level consists of
<i>n</i> glasses.</p><p>Darshana has seen in the movies many times how the water beautifully
flows from top levels to bottom ones, filling all the glasses simultaneously. </p><p>So she
took a bottle and started to pour it in the glass located at the top of the pyramid.</p><p>Each
second, Darshana pours to the top glass the amount of water equal to the size of exactly one
glass. </p><p>If the glass is already full, but there is some water flowing in it, then it pours
over the edge of the glass and is equally distributed over two glasses standing
under. </p><p>If the overflowed glass is at the bottom level, then the water pours on the
table. </p><p>For the purpose of this problem we consider that water is distributed among
pyramid glasses immediately. </p><p>Darshana is interested in the number of completely full
glasses if she stops pouring water in <i>t</i> seconds.</p><p>Can you help
Darshana?</p><p>Constraints:</p><p>1 ≤ <i>n</i> ≤ 10</p><p>0 ≤ <i>t</i> ≤ 10 000</p><p>Input
Format:</p><p>The only line of the input contains two integers <i>n</i> and <i>t</i> representing
the height of the pyramid and the number of seconds Darshana will be pouring water from the
bottle.</p><p>Output Format:</p><p>Print the single integer representing the number of
completely full glasses after <i>t</i> seconds.</p>
answer
#include<bits/stdc++.h>
double a[11][11],d;
int n,t,i,j,sum;
class Glass{
};
public:
void Pouring(){
cin>>n>>t;
a[0][0]=(double)t;
sum=0;
for(i=0;i<n;i++)
for(j=0;j<=i;j++)
if(a[i][j]>=1.0)
{
d=(a[i][j]-1)/2;
a[i+1][j]+=d;
a[i+1][j+1]+=d;
sum++;
cout<<sum<<"\n";
};
int main()
Prymid obj;
obj.Pouring();
question
answer
#include<bits/stdc++.h>
class Game{
};
public:
void Cards(){
int n;cin>>n;
pair<int,int>p[n];
for(int i=1;i<=n;i++){
cin>>p[i].first;
p[i].second=i;}
sort(p+1,p+n+1);
for(int i=1;i<=n/2;i++)
cout<<p[i].second<<" "<<p[n-i+1].second<<endl;
};
int main(){
Distribution obj;
obj.Cards();
question
answer
#include <bits/stdc++.h>
class Train{
};
public:
void Tickets(){}
};
ll dp[N];
ll ret,Prev[N],x[N];
ll u,pos,i,j,n;
int main()
Stations obj;
obj.Tickets();
cin>>n;
for(i=1;i<=n-1;i++)
cin>>x[i];
Prev[++pos]=-n;dp[n]=0;
for(i=n-1;i>=1;i--)
{
u=lower_bound(Prev+1,Prev+1+pos,-x[i])-Prev;
u=-Prev[u];
dp[i]=dp[u]-(x[i]-u)+n-i;
ret+=dp[i];
while(pos>0&&x[-Prev[pos]]<=x[i])pos--;
Prev[++pos]=-i;
cout<<ret;
question
<p>Question description:</p><p>Sundar, like the hero of one famous comedy film, found a job as a
night security guard at the museum. </p><p>At first night he received <i>embosser</i> and
was to take stock of the whole exposition.</p><p><i>Embosser</i> is a special devise that allows to
"print" the text of a plastic tape. Text is printed sequentially, character by
character. </p><p>The device consists of a wheel with a lowercase English letters written in a
circle, static pointer to the current letter and a button that print the chosen letter. </p><p>At
one move it's allowed to rotate the alphabetic wheel one step clockwise or
counterclockwise. </p><p>Initially, static pointer points to letter 'a'. </p><p>Other
letters are located as shown on the picture:</p><p>After Sundar add new item to the base he has to
print its name on the plastic tape and attach it to the corresponding exhibit. It's not required to
return the wheel to its initial position with pointer on the letter 'a'.</p><p>Our hero is afraid that
some exhibits may become alive and start to attack him, so he wants to print the names as fast as
possible. </p><p>Help him, for the given string find the minimum number of rotations of the
wheel required to print it.</p><p>Input Format:</p><p>The only line of input contains the name of
some exhibit - the non-empty string consisting of no more than 100 characters. It's
guaranteed that the string consists of only lowercase English letters.</p><p>Output
Format:</p><p>Print one integer representing the minimum number of rotations of the
wheel, required to print the name given in the input.</p>
answer
#include<bits/stdc++.h>
class Museum{
};
class Printing:public Museum{
public:
void Rotations(){
};
int main()
Printing obj;
obj.Rotations();
return 0;
question
<p>Question description:</p><p>As some of you know, cubism is a trend in art, where the problem
of constructing volumetrical shape on a plane with a combination of three-dimensional geometric
shapes comes to the fore.</p><p>A famous sculptor Arulmozhi, whose self-portrait you can
contemplate, hates cubism. He is more impressed by the idea to transmit two-dimensional objects
through three-dimensional objects by using his magnificent sculptures. And his new project is
connected with this. </p><p>Arulmozhi wants to make a coat for the haters of anticubism. To
do this, he wants to create a sculpture depicting a well-known geometric primitive — <i>convex
polygon</i>.</p><p>Arulmozhi prepared for this a few blanks, which are rods with integer lengths,
and now he wants to bring them together. The <i>i</i>-th rod is a segment of length
<i>l<sub>i</sub></i>.</p><p>The sculptor plans to make a convex polygon with a nonzero area,
using <i>all</i> rods he has as its sides. </p><p>Each rod should be used as a side to its full
length. It is forbidden to cut, break or bend rods. However, two sides may form a straight angle 180
Degree.</p><p>Arulmozhi knows that it is impossible to make a convex polygon with a nonzero area
out of the rods with the lengths which he had chosen. </p><p>Arulmozhi does not want to
leave the unused rods, so the sculptor decides to make another rod-blank with an integer length so
that his problem is solvable. </p><p>Of course, he wants to make it as short as possible,
because the materials are expensive, and it is improper deed to spend money for
nothing.</p><p>Help
sculptor!</p><p>Constraints:</p><p>3 ≤ <i>n</i> ≤ 10<sup>5</sup></p><p>1 ≤ <i>l<sub>i</sub></i
> ≤ 10<sup>9</sup></p><p>Input Format:</p><p>The first line contains an integer <i>n</i>
representing the number of rod-blanks.</p><p>The second line contains <i>n</i> integers
<i>l<sub>i</sub></i> representing the lengths of rods, which Arulmozhi already
has. </p><p>It is guaranteed that it is impossible to make a polygon with <i>n</i> vertices and
nonzero area using the rods Arulmozhi already has.</p><p>Output Format:</p><p>Print the only
integer <i>z</i> representing the minimum length of the rod, so that after adding it it can be
possible to construct convex polygon with (<i>n</i> + 1) vertices and nonzero area from all of the
rods.</p>
answer
#include<bits/stdc++.h>
int n,m,i,j,k,l,p;
class Contruction {
};
public:
void MinLength(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>k;
l=max(l,k),p+=k;
cout<<2*l-p+1;
};
int main()
Rod obj;
obj.MinLength();
question
<p>Question description:</p><p>Arun is one of the best child dentists in Berland. Today <i>n</i>
children got an appointment with him, they lined up in front of his office.</p><p>All children love to
cry loudly at the reception at the dentist. We enumerate the children with integers from 1 to
<i>n</i> in the order they go in the line. Every child is associated with the value of his
<i>cofidence</i> <i>p<sub>i</sub></i>. </p><p>The children take turns one after another to
come into the office; each time the child that is the first in the line goes to the doctor.</p><p>While
Arun treats the teeth of the <i>i</i>-th child, the child is crying with the volume of
<i>v<sub>i</sub></i>. At that the <i>confidence</i> of the first child in the line is reduced by the
amount of <i>v<sub>i</sub></i>, the second one — by value <i>v<sub>i</sub></i> - 1, and so
on. </p><p>The children in the queue after the <i>v<sub>i</sub></i>-th child almost do not
hear the crying, so their <i>confidence</i> remains unchanged.</p><p>If at any point in time the
<i>confidence</i> of the <i>j</i>-th child is less than zero, he begins to cry with the volume of
<i>d<sub>j</sub></i> and leaves the line, running towards the exit, without going to the doctor's
office. </p><p>At this the <i>confidence</i> of all the children after the <i>j</i>-th one in the
line is reduced by the amount of <i>d<sub>j</sub></i>.</p><p>All these events occur immediately
one after the other in some order. Some cries may lead to other cries, causing a chain
reaction. </p><p>Once in the hallway it is quiet, the child, who is first in the line, goes into the
doctor's office.</p><p>Help Arun the Dentist to determine the numbers of kids, whose teeth he will
cure. </p><p>Print their numbers in the chronological
order.</p><p>Constraints:</p><p>1 ≤ <i>n</i> ≤ 4000</p><p>1 ≤ <i>v<sub>i</sub></i>, <i>d<sub>i<
/sub></i>, <i>p<sub>i</sub></i> ≤ 10<sup>6</sup></p><p>Input Format:</p><p>The first line of
the input contains a positive integer <i>n</i> representing the number of kids in the
line.</p><p>Next <i>n</i> lines contain three integers each
<i>v<sub>i</sub></i>, <i>d<sub>i</sub></i>, <i>p<sub>i</sub></i> representing the volume of the
cry in the doctor's office, the volume of the cry in the hall and the <i>confidence</i> of the <i>i</i>-
th child.</p><p>Output Format:</p><p>In the first line print number <i>k</i> representing the
number of children whose teeth Arun will cure.</p><p>In the second line print <i>k</i> integers —
the numbers of the children who will make it to the end of the line in the increasing order.</p>
answer
#include<cstdio>
#define N 4010
int v[N],d[N],p[N],c[N];
class Dentist{
};
public:
void Cure(){
int n,ans=0,i;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d%d%d",&v[i],&d[i],&p[i]);
for(i=0;i<n;i++){
if(p[i]>=0){
c[ans++]=i;
int cry=0;
for(int j=i+1;j<n;j++){
if(p[j]<0)
continue;
p[j]-=cry+v[i];
if(p[j]<0&&cry<1e7) cry+=d[j];
if(v[i]) v[i]--;
printf("%d\n",ans);
};
int main(){
Kids obj;
obj.Cure();
question
answer
#include<bits/stdc++.h>
int n,x,r;
class Players{
public:void arrPlayer(){
cin>>n;
while(n--){
cin>>x;
if(x%2)
r=1;
cout<<(r?"First":"Second");
};
int main(){
Players pla;
pla.arrPlayer();
return 0;
question
<p>Question description:</p><p>Prashanth is playing Battleship. The rules of this game aren't really
important.</p><p>There is a field of 𝑛×𝑛 cells. </p><p>There should be exactly one 𝑘-decker
on the field, i. e. a ship that is 𝑘 cells long oriented either horizontally or
vertically.</p><p> However, Prashanth doesn't know where it is located. For each cell
Prashanth knows if it is definitely empty or can contain a part of the ship.</p><p>Consider all
possible locations of the ship. </p><p>Find such a cell that belongs to the maximum possible
number of different locations of the ship.</p><p>Constraints:</p><p>1≤𝑘≤𝑛≤100</p><p>Input
Format:</p><p>The first line contains two integers 𝑛 and 𝑘 — the size of the field and the size of the
ship.</p><p>The next 𝑛 lines contain the field. Each line contains 𝑛 characters, each of which is
either '#' (denotes a definitely empty cell) or '.' (denotes a cell that can belong to the
ship).</p><p>Output Format:</p><p>Output two integers — the row and the column of a cell
that belongs to the maximum possible number of different locations of the ship.</p>
answer
#include<bits/stdc++.h>
int n,k,cnt[103][103],sx=1,sy=1;
char s[103][103];
class Ship{
};
int main(){
Ship obj;
obj.Location();
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++)scanf("%s",s[i]+1);
for(int i=1;i<=n;i++){
int pos=0;
for(int j=1;j<=n;j++){
if(s[i][j]=='#')pos=j;
if(j-pos==k){
for(int l=pos+1;l<=j;l++)cnt[i][l]++;pos++;
for(int j=1;j<=n;j++){
int pos=0;
for(int i=1;i<=n;i++){
if(s[i][j]=='#')pos=i;
if(i-pos==k){
for(int l=pos+1;l<=i;l++)cnt[l][j]++;pos++;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)if(cnt[sx][sy]<cnt[i][j])sx=i,sy=j;
printf("%d %d",sx,sy);return 0;
question
answer
#include<bits/stdc++.h>
class Numbers{
cin>>n>>m;
for(i=0;i<=33;i++){
for(j=0;j<=33;j++){
a=pow(2,i)*pow(3,j);
if(n<=a && a<=m)
d++;
cout<<d;
};
int main(){
Numbers obj;
obj.Segment();
question
<p>Question description:</p><p>Johan and his friends are playing a game of chips where there are
𝑛 chips arranged in a circle, numbered from 1 to 𝑛.</p><p>Initially each chip has black or white
color. </p><p>Then 𝑘 iterations occur. During each iteration the chips change their colors
according to the following rules. </p><p>For each chip 𝑖, three chips are considered: chip 𝑖
itself and two its neighbours. </p><p>If the number of white chips among these three is
greater than the number of black chips among these three chips, then the chip 𝑖<math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>i</mi></math> becomes
white. </p><p>Otherwise, the chip 𝑖 becomes black.</p><p>Note that for each 𝑖 from 2 to
(𝑛−1) two neighbouring chips have numbers (𝑖−1) and (𝑖+1). </p><p>The neighbours for the
chip 𝑖=1 are 𝑛 and 2. </p><p>The neighbours of 𝑖=𝑛 are (𝑛−1) and 1.</p><p>Johan now
requests you to determine the color of each chip after 𝑘 iterations.</p><figure class="image"><img
src="data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAABOAAAAGmCAMAAADiXAuUAAAAYFB
MVEX////+/v79/f37+/v29/fy8vLo6Ojf39/X19bNzs/CwsG3t7eqq6ujo6Senp6Wl5iGh4l+f4B3d3hpaWlg
X19XV1dKSUo+Pj4zMzMoKCgdHR0NDQ0AAACki3PIspmiuc3eMAocAABRn0lEQVR42uzd23KjOBSF4e
wthDDYEIw5Gdv9/m85kmynkm6czFwNNP9XqVSR+HLXYiFAfgMAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAADNE5A0A/kaiRkk4fIMzIFZLCDi8UfHxVxJRZX7xmgjzgdUS0SRNbWLe
gPl8Uyo+1kpE07zYuYR1FrzMtyQxTAfWR0StK671fmdFOUtj7vaCdbt8lzIdWBs/vJpk16bv3n+lBBzmG5y
7XZv3XaJ0fKyLiNjs1vTn8UjAYYaoSf2EdEP7i4DDyoiXXU/9eB4IOMw2fGN313Y4jwQcVkdE1QfcqRsJOM
yfARPnG/5IwGGV1KTFvqi6noDDH8JE2Ox2PJ1aLlGxQiJqsyzNWx9wjoDDb1TVB1z5fm0IOKySGmvtreU
SFTP8PBibuvx2JOCwRuKZhIDDC6LGaErAYaUeAccaHOaJMULAYa1ERQk4vCSqb46Aw0qJhIDrBm4yYFa
YCgIOaxVf1spPvKqFlwEX1uB6Ag7rJGoyXrbHNw0uvV0JOKySn1g1cbskqwQcZhucvV2bmpftsUpxw8u4
46UxbN2KmUWMJM12O8vpD+siH/yB+nxTCdihGl+JCRteMhdYFXlk2teN9yX8mQ2q8SSemgcl5LASn8b
Wpi5KrQkIOETyiarxlIqPVQjxpuFXkljrikPpHQpnbZIYZYZxr/jeR8P/6PicAbFwEqPNpi7b5UVRlMdTdCz9Q
b4LVY4Vl62LMxKofK74jz/yTZNYLlFPbJbvq7rp+n4Yz8E4Dn3fNXW1zzMrwmMjWyYaxDhTmxWHqiyrQ
5FZfaQbT01iscLY2nRX1k3bj9NlunwyjX3b1GXuLNchGyb3GXEuy4u8qOpTe/I/dVX4wyxUOUoclkkCk7jiv
RvH8zRdfjNNvsr1TZUZw1feb1TsZ8Y4X9zqtv9a8fu29lXOJYYShwWK98Osy8tjd768NI1tFUqcKgm3OXKf
kXS398Wt89kWcy0awlHXno5lnA7GAwsjYozY7HDyozpdXpvOw+mQWf9pRnhjHiu0rqjb4RlnxUN5fEZe
nA5lnRbLIrG+Vc14+dG5CSWOhbiNua++ufxQd8MwhAvSsnA2MYn/sa4oq7oNRW68T4ehw2E5JExvVj
W9b28/ms5hJY615G0JrcyEGfHx1tXl85aCRs/bDuWxe67T0uGwHPFbtPancbr8K9N42meWc/SGiGgSKn
47jENbF85qLGlf6t2bdcW7r3FDG1biEuYDSxH72zPffjb5hKsyLlK3Q1TvK7TnsTvud6k1X9/QikdibJoVVTP
EdVr2EcRSiFg3099+6HDOcoreiNjfskMzTmP3XrgQbHMBJ6rqP9aGlbhDRofDMoiIm+lvPyVc5ViF24ZHf2
t9vjVlqG9/vJZ8Pwg554Nwf+zHsaXDYRFExNi8mcm3b/lZz60h4jYgFDSfb89Lz9fbZkn8V3yQZBxCh+NeKv
5v97Nz1U+X/2aa+opz9BbECXGHdhjiQ97JN095yz/sXY16ozoOrQ2EvwAhgMEwd+b93/Jasg2hTUsCaVJ
Tnd2db3tvkw6NfHT0Y8m0Akf43VlI9kF4NcDrhlnV/7kbfZWFdC91/8D1MulZ9uIULQ8FZHiNITqJXp5T2s
hGeDHw/mmynIC7noZLfApS9w4GsISlm0MWPeZIiDRci/BaKPMLwrz9swptHga0UWnnwOUyaa1DTiCv
xRcoEtQhbZ0efLIPwgthw48/q0BByP6hLaTssGhwW0aCcVOU6EqyD8JLAfGECj9WZOAAEIRQFm7fMBYi
23y5pDQvXOWtJPsgvBQmA9evyMABhp6ycDuHtpBGyjq5o+kDG0uSWsqG7IPwQmB+5bgyAwdoj5Rl2
TN0i0jegVaf67fl10Fk0OXUKkJ4GUwPXPdnNTrqhds1mKmI3pttVd87vc7zyD4IrwCab1KuLDEAZJmQAe8
Y8NmGRdPf6cimLFxThGQfhBcBzfdYbSG46kgGvGcw9haVba9SEd4dqQh7AbDu2nP8Rr1whNcACS6vV9
ZQAT156J2D8RiLBd69xQL13fG57eqYM8rSEl6C7QQ3tGVE5rtbMPbGvUT0ory73QPLDEUjReJxshDCS7C
tC87MFIlJv+0Wipg8P237Krtbp6vvf4P0BwS3RHCEV2BjFxxgGETikwHvFUBwQdrKFTcS1PdjAYvq7IQXgS
HBpWIDv0GMmgLB0aXqPcJ2wa0hKduCRHV2wivAFHCKfrqhzRcABGfmVxPJ7QymC25dmAnq73Bsqc5
OeD4Ygj+A4JSCwwUkSHAk5PYFGI4ERag2XZGGgAIF5O/qPGTk/QjPhN48rrCd4JSCC3zDbnAFke5W7wU
o8f1NBOeNBAegTbqE74dZDmKWvIVRlG+4qAXoTmmaJHEEW4AZmjHJuB2AAbyNCs4SHPdI4hOeAYb
UphmOB1GSFcWWewyAQbatqM/FMdHrSPBc0LIRt8GgRLA9RLUE5/m+p5mNeSTxCd8FpmC1W5wka
VFWTdNu6IJTGIa+72UnmqosQMmFB58KDi6DaXgebo8Jw+QkthGcOGdJmkQhWAYniU/4LmivjLVTWO
xWi7aTipw28ptsm7puRCel7JSSK/Mk9D0dBpOKcxCo7bUj9P0wzbJT3Q1bCG7olWG0TVnkaej78OaUqS
U8GgzATd4tTtL83EoQXp3iuGFLH9zQ1qcsK86GLmVbl1kSYz6OXLVr0FaCKis4REmqzKSumq4fVk39M7
MGhx4gRVOf8zTVtsHJNgiPBAamWrtFSV42SEaKiwpFTU27ZqOWRd+ckjCMdMBba9ZslIyLAgY/kXPqYX
cGjCtoilPa7dS0WuIPw6qpf7bRt9cSX/ZGyWUJjsAk2yA8CEzBemWkISHB1pCGwigtqi13UU0b54w6pagh
HxcdAsrGuQI2WolvJL6Qg5H4/SDLZPVVLXku8rxQljFK/FzLOAWaM0LYDOuX0StfEBBaWRAc4uPanVp24
CVHU7XB70igpzSElAt5ageA3MbhzyBMi3ONOVWQW9nprBzgysv2LMwq2WVRGIYY8CqW0xx3LtIwQN
9HmVrCFuikCtfkk5819Uwh5GNGlmP8i+ULuLk46bhzrmUc56TifjRmEj8vkd469ILhIU6zcyfXjUt60+OSsC
Dr+UCd03tb26D2X8J6MA5gJnwE1mmBdWwRwOMK25fOMJO68d4VMdCQlatmjJOK+7lgJiMGtfWJgIy
Z+OrzTJttAy89AOcm+M2mn5HiImlScYR10MSCfhkDx5FwUHBZgtsyMMmuDRwzOKjj7FHRMi5DT00E9
0OhPzkgnyjJrFuah5CbRpaLc6xztKbLHCT+WdtGayQ+5WkJa2A6mgJMvV2GjEhtzMDbMvISFz9b6rqgOR
PsYEgMyThUcRSK/DyY3kjPR9qxVmLbtXVsyR+wdIZr05gXMaZMLXVNEu4FGhQSTXYW0IU7Jv3fDMFdr
HdbW2awy+SuXgXDokYn5ajiqPPph8GQjg9GAoq7s4TDNSFxTXAPWRto23unNpQxU6uMw6er+IS7wDj
AqjfLMbY0r3CRKQnCfGUWrs3DQL3D9cv8yK5zFUeB6k+Crm+PjqizEv/yYvzaxc9gFZeLn+cS37MSv51cL2
M095dwG5iVb/HxUr0xY9LXxpavafYdpMnAfXJ03thcxYWUbflJYIzPnZBJ+hvtxi7to5GyToKbRyjYDJyUzXs
LsTpO/QmZWps8AWIlEUeYY9kzi9F8MO5AXEnVhVm1IgsH3VHXmwcmZ+1PB6gqIo9TPfWHAPUS96w
Dam0aYdRu7xYTyTa/koVbysCJE7aXXDMNzj8mUEjEERah/a+uVinb7ZbSuKYXrr1bwg3t14lnxuYqrmsKJ
eJ87lE++dXQHIMSf5ZCMFZyJZtWdl2VRYF3EwEx4zS77rNlNabmNC+BgcTnVIsiIBZ60oMoq4HdtHozbv
mrcKK6N0gdZJUEX/dGvVdxXZ0BJdJIsBdjqq9Dc+S8lYexq5fm07rrmkyHsItvj/FDAq9IP72kj2Q6U3HGOm
jSCGHBefrBAa6YgltcUG/Ti8LizjTcIOsinOhtWcVhuFwVqTpKPs3DfCG01wGJn5Wi69r69HUzNropKBhgR
XSZfuz9GF2YACy1oVsVV4GIo3oqYcE3a4MBz3yMb2ujBCM73sFwyG/HMLjytgsFDx0MkZd+HZBWIK9W
VG3XiXJSbwpftnwAYS1XwnXwCb1zi60lTGGm4jBP61GelvCpwbynEl0QuyGq8KI7NBzqt+hGktIZZfaedsl
LvwRj7bTABO3yVTq7HTVrIEjVZPhVukMTVmZC2pHgllVciX+hAviWRt4TrhvL1WDwtrRwEN2s4VC/RcHt
TQPXAmcqmL0CaCO6dtqjr1lQbyMpBlFWdRIJcUqiXk8AI1lJLEosE5VVcbbggUUxj6yDcP3maRCll+l8fqvK
gldD0HLLrdShh1DirkwJ/FVM6QMPVqrokVM19elg7B2VLI+zmirtWYP6OwrMhRjAJU+ZCyzKU0IDb5NN
NfbFd/9Iu6ThCO8pBBAVWDzN727IYNhZctOOrb6Cfo8F6rzavOJD8wpEIhDgelRNfTLgQ7gSDCrc8EofNJ
zskbjQN13ed9DWhz4WibCXoN/8G82PsSuBM91OJVwA+MPQR7eqpRZ7y1FhfS3iBmPinnen+TGugcltQ
8EeBSLPA9AP6qs16XzGrf7udPLDu0ZwyFF5pb6p/kK/LZU+rE6khknCrHpqDTBfdSkK7B9FXCOHr/gNjG9
Vo4f10+F4BKia+kQgB6G+WtWQwRi3DtSUr/DVs9qFKSRZ97VoItebV3KrE6lhkjBPrYymsWpMOGNs9KH
Xdm0NQ688f33aED4wrjAdMkq1PA+XzmVVSy2WArhVWPm46RSAwyxDMyFLJyDunwCITppfummqph
JGatLVU9luEvf2EJSV3bU134BalUUSbWGlKUxqpa6mUlPnU6Cn9oY6PbDuUpSlSKyEd9OmU/xvmOaFH
VUPJrimgmTqqVOiJeR0OZXwxgBBlJaK30x6dq2yZ3bA+bEoK9x0agBLnRW7HZOV6nDGoSbRrRiuTKOAp
sQ9AVN3Guqrdb20Rn/ju4ybTg3ys1kNaGqzK4lJGxfXpbIauu4oTfvbYTrHJ5PYctOFKeBehShOkOWaGoD
clsQRLu1dr9/sj7g8bCHNAft+QL7s0qmsvNI+KqyJzlqDifKSTSaoVdylu1aycd1bEfYBkERw0epBot4IKk9BK
bkszzP4XxLplPRD1vVehktw4WsrZRK+BmNjWmBrkzW8EJvJMwhI5xIfgtYM3n3bXNOLdnW5uqBF2A1
MYaCWj0vLmpY6XDZogMrtYWucLxLecl1CmnA7GL+snm68Jmc71sym03OtAcGqLTtsNUGIIaaSGdXafz
UYY7q1o+seV1hn3Bip+s8IZKXVyb1rrIyHrjNT4radCcLbkn7LHtWaw7jdIIOlBQ0sN8AbP2SVMxqgraZmp
OF+Ly7bL7MN1dN3mLo3LdB0H1gOYIzPjt3qxhPCAhhXMK4kjx/RXG0Ng88lPnz9qFFHpm09hmoqabhf
ATZibgg+SvlBS/lHCSzAjOD4Y0LTdzZsAqcBr/U8iJsJHzyJTQY87noc43bT6QT46jHvPv2EKfWyoTOJ8PMx4
5r5DedDUoh+kN8j5JnCY5XbldDJ0vOH1PQ3/dxfBbScsZzzsAEHz5H4fCye5aH3uLcm/CAwxJzgLuAHcdH
o2SEOltPZ5fUynKzO2MVTfyu97g6fSXzvoCe41A+osH/mdh8Wml6rtdeyR3JmD6Fmwo+CTffP7VcbFjb
MxrmQfXtKQicbIpUN+6ZE0tanOPAYYnpqfNZH1W73i48ecNx74AXxqTEUsa757e3tZRKfoYYz9Ozxdz/m
234w4VlAs7Xp3HkyF8EPx0oO7Tn2HW20YGaCBI4BK5KD513KVa5g/h+Z8gqJDwSnJL6eHRI6aCJoHmFe
tV3boMQ3RsAYafwdAByYsVylc1Jbjg/8seWWRWXbyzI9PCy5+2zgkCaok7R9L0q7pct0ISDG4IfqrF+k++c
Sf0r3s0jpN9mcUjfT9KZEUmCtXTlAxmyLymTwjD+sP5PwRODnaC5N2ZbKRjdU2ktT/iFtZC+OyrM5l3+b9
a0HhuFOaRTo/mJ46lQBn9Xo1m/I8zgONkp8dinx7T+EADWtMYVxcLTRAhwgrJBu+qFv1GP4Vq1OII3vJB
hX0Nfez7WASzHTlRhRn/HaO6zjVbon9jd0pr8cjDGYtZOWQj1ck8cBXgTK9FPrZ80yaCOlbUvXL7/bOW9
pVuR5kaW23Zt7eqF331XJYXv324ugpxTGRd2BA1QaTkHnHEHhB4H6w6i3R1wiJDwNZtVeVlaN6KScbjX
jF6KpyjyBEfbtOT04TG/jCJNDesJ2lyJNUK02opVI6K0wuhUvcVO33ITLS1NJWpR1Axq/hN9golWvHx4r2d
d5yNzUb9OY9TgDiW9CbXhofGpEEtmrhGQdroAB7IVjpDM0WwVlyJby2roSQih+813/UPX2e+Wl+6FrjV
rtRG0gOq1bcQwP7T2fHXzPs9fercQHV2ivvQeHBJJXp/jAuKspjGmW8KntIREX+WYIxKnREr85mWEQPl
mHI2DMDqWBDRwYkGLg4fsYikDQChTXddDlHT60t+k1AIZjh+TUDUM/jJMpcoSdWqG3LdHKzPn+0fhYf
jq4KEuTQigTUS7QbRuBaNs/JGchIYmRaCdfi/4Pohd1Y8Z5HR52WZHwjTCJ1QzXY6ngzJQUGLonU3bA2d
DD0JXpQX236x8pPBrmi4ZhUMq0hIA0DgGm2pCXdSv1tqUV6272B0VY436sT0dPtk1Vd22Zho+/4vJkWI
mP3USNgDRN39vdSIPRraJWj/qgcROEb4S9PTitSOZM4WP42nT9Pu7pjcs6u17TW6g3b2pgkwxSXNeJkl
ZmXoybykrRdXZ4eKCHhwfT8PC+a7vm6Lp+AzDc2BWXygMaYru+Dikjif/jgZfwoLlRjjHZu/1sCB92SJrJ9Q
+6YPgq4ENhvhGKDEk0b2a2bc6RPs5A+b+9XYTZBXsCKD+3JQWO8IJp/UsPFVT/YUOuXgcgOO5FJxWW
Dl8sfNs6zpPwBEzXU7BmhCVGNFEDbr7gZskzXsJx+ROdNkpcbtNk3gj4ygRkAkZuH6PgV7c8maT7tCKZf1
zg9zYt8Ivdn7Znhtwfq3ZYWElOW/F/PHD6Q60Pu9HbiPndHJO1OsKRr4vIYReND4MbJczoy0u5eilbL/c4/
Oa+9WkGoJX4/JMVzGmxZgXzzwM+MeZkFvhNiTikfMefd9dgbBoRw3Vd4bO0q2kk0YNwnD3vzDyx3ab
JPkymYNOF+zC3g39+LcExxu2QKRuuXyM4drF/Nouc1nDwxLiPf8q+LSwmd/t5dw08xGbI35dtrWyaXN/J
Og+dPfBGscrGbnsCXHna+R6H0GHNugmgTeyY0Dz+VOKjB7SLZhqnNdz4xJrflhnO8efdM3DDAjRntnkUs
IWCt51cn+NlnMDN61qMMf+QKv3WLqaH7R6HXCixlx58J593K4DmZ/sVvpL4dlUgjLN3Ni9ln7j/czN6l59
3z0BfNRLWcm0UJ9cbQnTTZ0F1DG7UyuaULG57Yvi8ON8M+v/cHTCwHjobNa3q+VLim2XP+N2Zq3kpq
9/m8m1JxH3QcL84Z/syXB2/6oWZDTmX7RFfYELaLHSxwZEhYQkkLL78AJiTREIUpzjwR4L7NSPBGN7aPc
tenG7Yr8DQR0JzhTynB1cJDs+E/HMXenMeaPr968DM5eB3czWSWsmZY3hjIwTTKXrlo+vEwZki2CCSmZ
DTu4nROdchrciwWWQKXl0dl3Ed11UHA1jCMs0hSzY2EqKTZ9ycCTn8uQuDvDgPDEAa7tm4RnBvQZh3
YIzz8HTpyIPJd3kYvLn2ETL2hsevKUJv8QLWFKaGRYNH/G3PBHdNlaovgd4x5FzcwWG3XmBIiy7EOfvQZy
Iquj/3YuiKCM6DtZnH7fsi3ARm8TH8kOd78kvM+GgngxD1+EjORbS4UmTeFlygGzAGvMux1fhZMoUPA
WrZYdHgtgPLuClKdKWD9oEWAu7sz90Apzk5QA8Gx/E3wtOA903hUhJnF/8ItJi8r2BgCxNSHXjHruTomj
F0iNweXtugpZGytpVjPYAgPPhOPf0CrqgOFP1fWMiifTgnYkxXgQpQ78YgTWcBmAeOjoO+qzfCU4DbjqK
sKP6FPp90CPcuD+4VLNCEW3c050fPu/2BvdkxxyAmyU/4u3QwCPsEQONadVyndn67Q+Ar3MiPgLWQF
fymGM7YB/Dbf5VoRZXF7iVxHAVsq0zyc1WV/zBTMJLesR3aMrovlIDvhkCvPR48lz5ADLiS8ouQfCEoLxN
4Hfb1nyr8Xe7ofgMMU8Apxt7l78vkaO+yEGsfXe5aq4hN2vxZBZO0UXntvzWMyWurLKTmuGcAqSw5N
1XdNOcsZArWWxUd5A6uHfdlM+gKt3rh4CnDrLr74MH3+nDQlcHq1t//mraplYsuop3YLxRf/v5XC1EX/6
CUsinbui63+yOgc7QrMnAAcATwvOo32YoiU7/O6p9rGtZNMAZeRXR11dQTweFM23JFscBSo1I0ThkwZ
pRKIUXq36c8bagmysjTBizaM8z9reJdXEHEpEOsDmTbiXJOcJBwv9ORTakA5Tpdsg/9zPGqDJzJwsWQdQ
RXcY6jv1Un/vlOxTiOQhkcepX2fCpP/zAvYM33WMkV7R6gCA/HVlZHlwwYjrHOOcb35r4tNTYJGHCQZO
UpSf7biwFrQvrbiFNxOikFx9iFninb+1MRJkvbtefYqW4wjHRSsZLfFMOJNPAYBvvxIfx77gQpuGcA8gKh8i
ddVZ5P/6JLgsvr+/UMGgL3UqE8dOQUwb15froi52h/V03fppCEhxpZcjjsxoDBPpQD7LoyNwQ3/ZtYF5M
8dreFxOe2q2POHHIAui/0/h64ES2KBQ/3C0YQoia+U2U4RwHHOfyvlj3kjc7/LkJUmIrWJHdTFM6O0B7aL
fPliuDuzzmOzgAIzsMmkcPBV4k4UcV7SCKjffytZC8aUZvKn3VjiehFeXe7B5YZikaKxHOozrytxADQWUdA
cPjbwOxr2pz6BICHVsexlzUUr0tzKGGxW1wKsYKkGBs9tEMfnwms16S+bbrdlicYg0qZqIs9bBibHKBQ5nF
SCk5hUrx9la1xCG+Q/nCrzq6LUPXKEgNA1vi74p4fqjyt+l262OrsHtCf/tfINk//q9pGh1WmC65rTivCTPUK
5zy0LY2saV6wDRO6IONpxdOKIt7FKHMkOHCAZVE1jXaAzGakWrniRoJpyHGszr6d4OzKa//wtxLNKfmlI7
aeDeuhxT/lV1TeKACvqvNobV/nKwoFU8jmTqurrRq3aXC/qrBqRntoT+m3c6Oi/X0YMNwuBoJrj1A4af7
hZzqS+hqScrPODn/Tdde0LOzMFavfXLvI4Sh0juV7CM4hBWeqxu39RZWR4KyHVr/Hpi7iwy6aRKyCm9u
HDcvXhZmu1tlV1XjdNQaDHm5voH4D9xf4zjy60zBtIt08RLUp9/UE17hHcGtVJ/62LMH5h+R/9q5EuVEYi
UbiBmOMOQWzu///l0u3JIMzmSQGISOhV3NUppJMdPRT3z0lwtWXJA4DG55oEWTonwlOGmxrHwTqr
30+34ctWXAcbRZApVY3tHecfG/O2k2GSPRlTdW0jQgyOIJ7AUuB/SATv3UMhh9bUo36eADz9L/3TpioYr
/WE5xnGsHhz5yuz4IDjOAAgYj0yLq2bW7Jir1zeBWyVKtt20ks/xfhlp/TRFVBcJAz1rG2ru73Il7xvQ4H7jGb
lNLydq/5A3hagsu6P5sABDfdj2aiN0dwGoHF9sW9qm6T0qGS4MwR8E0/85LgQNup6mqCJQQnKg/+g2
ObJ9c4NkxxBLcKsFtBlKQZwJmo2oCdWZO8yKfry7f8fGkiioIMHzRIsrwoipstJipfH9c77uIBdAS3CiPsFvUD
PwC4IINGwCzbKIImjct2lydK9FWXJuIHYTQhtqrlJeHtkpJwojPA+YIMKggONTjiAVzPcr0gCPh7Fnh6plItZY
m+OHoFqkPMSWH9BUCh9yfI9+98aSKKggwrngMHJSCLob1nLbZXU6pFqYUv9KdBOidM9FWQJjKCNNk
5s+P4WBLcOdslKSq2J3YS3POouxOWam1P9B0x0Zc4gnsPllt+woaXqtolEVsv8HJJm4vtiaHF9ttLtcwhdLt
xupblahpe2tzfa+a37e2SPkyLsisstjdlwZbjhENntrcsN2xQ4kacq+GlCoJ7Xdt12AsgtucaG6hg6Mypri8h5E
wty5U1vDRlwbbjbIOflYwNNMck34zTDZ1R0rL8TDfk4Fg33o1QumqY3PuhavDzx0lwurGBSobOmGOS2
w/xYg2gi72iwYHeN6xIL3k3CCErZq6jB26FKW881g5+hlth5uDnbZlwMDbQIDo/Abjo1n3fXKLfNd9GevP
DrOn7OjVwopQUvSL+dbNx+LQgLlDMDSP0rVhS++fpOqqfkWNg8+Dnk92QowPiilFe9Ux0qiW/+QIaZm
XfV3lkYKIrIR9gPA0Nzjv6FaMTStETBQbX2a4voa8b50tHgGk3ZFuYwTynjfWQl3HoqzTwIUXx5wvvB4m5
/ihCpvXmLevrLPR/MsulxuoFadWzNo8Dw/SRzYATFs9ZHPwug5XIR7NfUQHxbgh5WFfMMBoqE1aDEILi
O8Dh0J8eXCz2mi7ARBCVof4oIggaxO+n9UqNVegjyQm732CbrQycGHkE9+M3D4J0e2Shb5zGy+VhlRdu
ZKbKhN0ghELJfV9dkzDwvH97psgEGGibXMGkLSIzj5JHBsueNUhY35upBD2OQYz6iGERQTUgEzCk9Oij8
uNtokR6LI0sZiNkZbkWuD2MI/QzAIYYX+q+b29Z5Ht4if+lyxDPj7Jby4MShp4lIQR1EtaiziqX++/uBBO/QU
gls2NE4KuQXilOWGDU//DZgiCM9UfxkNLruXBjX8SmZRWcBIR6cVEz1paXOECJ53iuwRbGWla2jNVFbJj
3+NN6owJ11jQK5HI/PkEuOYhSobEavOIN4KkiQPFNHofgh/tOxQd/ZRjnaNKalyKyzCx41UgdmZFZBacAo
RR1ONYDcaHA05nn5Af4d1zgp12iwMS7K0CkztpV12he32I98h+RCquuhxWfLsCwCBqgkc6aMouEzvuN
vhtlZcN4UMLMobEiSPJiJJWZmVVwChBCpSA3RQrP9AS6JDi4uvA0p9cGaAFSLMy8vLMzMeJUncvlkk+Q
S8458UdG+pOUgHvV8oax9n6JAx/F+G8VX0TY48u9Y6zJzY0nyvUOL+hw42Dyiq0HIVSYYkNfoydOGiKz6
YHet6Yf0LAz9XFeCOQkiWULZnkmTSniPUD4NUdtBD8nDg7Bb+/5IQjhgRY2sOaKO4F79azie+igQyIcGO
hv5g79lzrrC4GGwWCN9QwgRDjTh3Fo79csTeIoDDx0uxEvCKM4SbP83sIVz9E1b/ZRolDycElb5ikuduLw
ByjFRaewZIbBl0N0TXlXk02h09TwvHEV/yuCA31XPJKGazMPnfV3Stw4GK2xngI4cSRIrvUwnVbf1vfikgKR
+T4QX3op7nXbM8Y6NFLMf6rwkQ6TSzlRXFeX1yziphcCTa0oK8q6mxgd0meO8TgTQie8Q4xQh4vSooH
duoHOi5v1lNsL+u4NJ6te08hg/U0sCI3t9jcMBzrBxWSN9RQgVHSOmAgOKK6pyiJLM0RRVg2ntwYNOpP
9bxKESIf4tDCkuCyNIwEYn3e9Nx1E0rBq9RjeY0LeNgcC6zkoxNoH1pZX3KvQ9yjC80PcsyvouzxQ9RYaVoi
Hg6L/keJG1twyQyPGZ4IcqzI0laCzvhOAD5Dyrll8EGVmO0DrQCUODO8BFtuUxRVRlA0sehhHbIAT+kcRV
65Rv8VMRe0R0kUG2CzcqyzyfQ9/RRnsGWwZj0MYHYJ6UvFBifuR33J7pMJiwAVOym7ob5ccDFK4rgi80
NJoJe8xkfYAOhjRE8fpbBLOpkY0kvL6YYQOX4fRR4I4ScFefocrTpRgNQwuBO7V/ZoJXO9yz0CZ8agN2gyu
F9Pav/fEQcP/NzkOHF4Aup7SZhjaSxRFSZqCC6pBca/BWBVhB2rRS8Wn/+E8dymiAlJ8i3YYu0voH0Vgo6
Kq0UlAqH5LFUdFZu3Qt3VVw14tVXy5ZxCBMKuN/Y8qfv6tJw7HzLzhNBxeg5x0OvZV4gFIEKd5gQZbngo
vFLFIf0MQCvBmI4tDGGCBn9z78TiTw6AVY8+6e471F7ppZK4xvV8v0ojnkAZ+jqV+1lyROXEZ7Rl0WQiM
48CEin+6OR1mQl5feI88TyaHcIiEkQlUv2W0L3jIdHaTC6ALPcB89uEgbbdxRmnajuPIOlFvopd2H+3Lqzw
BFR+1Xg7QdmXYwbNNxfeDMEnTidIrDDohpjPAINzl1gxQYq/3JBxW4DEE+paGwGWQy7kA6utmDZj5J
QRNyOwQBGcPeL2TW3+QSZdyaPUwMCbqTfQ+OI8BNLcEbwhqvQJZJDaNWBFhf3r38fnzghg5ru26tpt
+VyV6pEO4H12ZWETqtkJOIu/R4yQrTyWolXPcBeZUVUqFjFKxan8y2o9FcENXVw0b0JnvexpdBnj6MEK
wnW4I7s6Tig80oN9s3h+oxMnFJrOKn+CiffBJDgY2Zj8fiOctJ5GTJcFRrZrCGyAXK5coC5FwrjtrivgYBEeB4J
pbXjQ9pGPwijlPk8pECA6B7vs6eRSzzYCP3pWitzPEI4J3xPeDwJ/+mNXVpOrHLvPdJK3DYzmJfH6zbdbcn
kC+AM51P8rwYklwdZHEaQHZyaIgShOtEEH37S3GmOF5VHz53H8FbAXqCM4ISGE+8VGRB/4i/bfviiA4D
AL5ccGLyApIvPa1GIYiys6qCzfYZ5m30jR9AlfWFuET7qH1hFunu4SO4A4Ocihz7CCAnZBm+9sv8ILgsPML
tgHoRJHQ/tmJMsrOyhRjyk7FnyACc8dJJHL43oV9FIf6QSCL17rLAaaVPxGcR3lhO3ZoS0INWXFOmBFE4D
PpHyGRyMER3GtAgsvr4RBCvSA42YozKyqomdISTyXOHPvObHdSc2zw3gnX3thBIbtAjltR/UKTFQD6Wjx
BGDsNeLfh5n7dPyvuoc1m/vvN9aPgEdkuHMEdGzJLvb9Gbi7Q80zQifYVv9CEeqtAZ4LDcnbehPne9LLEf
U8tjhNc4wjuC7sHyu3dnhwa4n12AW8dhrsKgkOVbu52IV1xdLc+RQS6wZUta1LPJbVKYJwhbRirk70eFgc
lcASnkeBUmKiQprFsaMf6ZtcuI6LXDGvLeJ//wEzAdk+0f4w4u8NvCM4d1Ccfi3KCI9QPo3WI86fKWEIBEE
+tOz5bYresOEwjct6mr+tzneF+eDiC0yTWSJlRll/X4c6eyFYqcXGal62YlrBPS9KddFnT4eTGEGBK663pm3S
X999ULAwzNZ1UIC478VuJbURfA35BNwx1vqQYbpISOVuivefJLvFUR3Autmw0sCipbctEjSDbAulaV0X8P
FpddsNa/JEE9zxoS7ji9suK28VYNx88U9L5rg0AoWnT18pMMUsgfCzKTBApECPrVqK5fW6/ycmMz5aQX
UaUT5EQKa0Haf55GMzpVW6q1pEhK1Edwe3sY5Hfj92ylUiT0P/0k5DZFXedu4wQqkTnfK5EdYL8dYK8I/
5jwxkgmnws8/cLPBy45/mv/QqmP8m/Z0vERSW7jCidvSUrUbvsAFW5R8LDN+nmMhwZqME5gtNJcL6
Hjdxew7+7xnMlbtllRGlWnKxEdb4mF3wxEU6D009w9EORdvUpniq7jCidvaV6H6yBkxwj4N4hTYL9/P0o
WYFvDhHw6DKidPaW6n2wBo7gjIAjOE2m2Z4Exznu0WVE6ewtR3CO4EwGHJNzlWpwru9oogrMXUZa
hbO3HME5gjMZLstJU3rE/kSx6DKicPaW6nQZa+ASrEyAajG2CIqpf3+Cm7PiVM7ecgQ3waXImwrVhphF
UGy8ayA4/mAhyfHZW72YvbVlLo2rVf5wRY7mQrUr3SIoDr/oIbivs+I2OeKcGDvqNxeaxM5EmElwn7qM
yNlbWxbgDDFnvBsLbWJnHhRHyfTtNAH81WXkYx2cK90RnMnQJ3bGwViCE52UiIddRsTsrWilj1XxLtgErS
fqsA7ukHSJtuadXjT8BY6r85XzXV2t8lFO1GEN3CFZSnDCFUd9CCH9+cNu6bqpt47gDnOiDivgDsligqOKC
E7hLtgE3SfqsALukHSJtu6dFoVbYKKyYZuJqnAXbILuE3VYAXdIukRb607/VXrvggzqofVEHdbBHZIu0da30
wSwbJ5UFfHqBSjeBZug70QdVsMdki7R1rbTX7a/XF2EoHgXbIK2E3VYD3dIukRb005/Waq1ofOl4l2wCZp
O1GEL+CG56Y77i7YecVgW288jaDZ0vVS8CzZBz4k6bIIjOF2irUEclu2SVA0RVLwLNkHDiTpsBR5S7g5pf9
HeXxxkw0ulY6AV74JNcLWoBkDO5+4uodPgvuwmwqqLEtHeu2U5aGqe+pblrpLBEZzJkPO5++L/7J3beq
ssEIbLxqgYdxEQNPd/nX9BSLPpyr+agkHXvE8Pmh70iQLDN8ww82Ii6H4xBi6rRt2zCBV9wzedsYV7wzed
AQP3Rk0O/J7Ay3g/hDb9UQ2cPXyjS+abCto20P5nJpToCpgf34xoy7VkoODSJbAjth9CO+8RXVRk753Gav
yMCS57KU9liLewJ5yBU4L9ehsBogGHyCuFX67j1dad/CHWYD3JfHP1LbUS/ZL59qtWM7CMHWD6Nw4
YuJUSaL7+X0YIfQ2CnsZOpZ58hXKMfnv4Bo6YA5z3TQMGbmUDp7vqRVh5oP6bPBa2bE5CaRs7JQT9rh
UqHKV/AeGXjQPDtNLC9i7vrMcXEd1Dh1YbRsBXpclt7PQ3XQKjv4fdACtnE8AwrZTltAQt+nF6ldl3aP1jc5
kwmW9g4L4A32fz+GES0DUp7sI2WovmVc9fZJy8gXvSHjBY7DTee9gNgdtKAnFwbeEm2RfQ2PehrW8r
wh2u260kr+rmJdqT9kvpvmpIL5Uaua0agnFQ9zTGWeRuAAO3FRAuudbQn/u7ju6j4mU4s48wPeSvUdT
KL6XbqiHDqJTsa3P4Fly9gYH7+AAXdesghIp+nMEF+c7wqzFslhP6BP8Mm8R7rRXuqoYEz3x7MHAfpnG
NanIa4GbEfjAK7nCEFPnUWfKcBOzQ33d0F23ILCeEyUvgawN3VzXEZ77hgLkh98ER1mt9quAy3/1VvqJV
cMkxccAFWdEBCWHgMML4rmoIwaFjp48LeeJ1yDexebzhD3VXGYgERMnWTJ9BL4BvXVTjsYavGvLcFcu
Owd/E1rHr5jgEu6sMRMIOVD1MMFArKLjXuPouVgH6flm+akg09Zbcm0gIEAYbAaR28kkAtwYOx6kasok
3kRBwtLMR4LD0WTW4JI7Wrw3cdb+siLHT6OGWzQMGbitAuPtJNTjV5O/XtdcGjhbtcNMvK97hW9yE
ma3jsg+CXeUDYgFnLKnvz5cRasuA/bIeWTHlefuYanBFLyFBPnn88hFg4O4NnEjjCPkyQl3dhuuX9cBql9b
2gKsGp+GKY/IghAgMVcr7sz/mH/kgolUN2YiaTQWQBdvBnFMns5jTIK392Rm4eZq0jZ2WkTPfwMB9Ab
Hl7ZOUO5YGaZ1L2sXE5DzPerT3TtdTby6inE7AJRGSirIDn8AO/QP8/pzO9SREykHp8WSrhtCVlTZCH7CYE
46yAz8dLPTJOgkIaWKLUya2pIt24K5qyNpeM7hjIAq2zJ3ctoXGDNFz5FMCWe5Nflsmsz9nRcliVg2xQNX
nOyALbg/Y69RuAt8ZuH9AyqEHLg1iUrq+hgmlMauGGP4y5AIS/xJllxCY2wCXNITeXsa5nb9mcse+DfQ2E
PKPZ5/Pf8CXFn/JXF9Dpo7ImrHTPybN+Hf2xu/zBpDj1uSroVxdTwM/xqchmOEixNaKzS3WIyJkrwYOWT
C5xz5z0clJdeUhEQWHEI5cNcTx1CE7ZgThf0zio+/wK+ZU7vrZd4Ifrokz8gnN8qqxVHlGzSze5xy2S9XtxpR
m9sc/KyGMT/NYH2gqJyzvHAN/pO7DULcuKtrtDugU/tXjuU94OdSZNS//GQ27YcyCpkxMk6yLsmRV1Zw
454LzU1NVjJWFkXLvW15RcFPXqdWS+ebxTrfSw3GcZ8koSeap3/j+L2eSXZmZ368lPsL7DUc5hf8AdlH2
WQ/lPp98ZyDjkrVi0kN34nIclZ4sWo2j5Kf2yMzV7nc5SDFA2ECoUat13fbmqc2z9m1dV3lGDqxTxgEJ3oV
vk3gDZ0pqmVhHVlR12zRtXRUZdtYtEVc+JAiZ0UdO4tMso07i+xqKk2gLnMYZLfB/Bs6UX55HKUettRody
nyQYujN7e79+CFLLhnN8kWtDmLU8/k8n81NgcHq1mMntOZNvsNl+wIubUZp3rKCVaxqey6Mxu/b6vNj
keeReha+ESfe8KJWCy/xC6tb6SIIUsqTBJ7qcELzetDn2ZozO20/MRN5EFJp7Ypjr1SeJzYuVmr6Gji1Os9ny
zwvulWaP8uEsuDei1nEWV7LSYm+E+NF4i9boejb2lz/35WIM3PEzpOsYHXTdGKR+KJrmpoVGc3YSc2qg
xmSPAhhVybWtNi0Dql1PIwaz4rq2J64XNqbGBG3h6C49ThcX4PzH5kncTxAJ1CDtVz0UIlp0lLqabqW+O
Zvgi8FnNbPQY4EQt64saPZ5LmczpZJcisAqqqTWpsZsostf8eY8wTXo0nJU1O5kIJV5/YwuShZVdsGdbbIIi
FbH1CEXF8DPk7zeeE/9q5DyU0YiEaiF4MxICRx5f//MtqV5HLFNsVnC3iTycyV5E6w2n3bf0CvxDdawnkn
QxcXB1HeCsVwOaqzDIEOfosqD6Tjj4cAPA6EAsANrYHLI8e3Zk8a/c6laPeJvzmorw1C9IrN2swZCy5LNwn
ArhjmNZhp18PueOIwUTobhPYag2NVnoTOn3cy4IEhxa8Y5xwcUl0+5Pu6oKisWiByokaKv4THpU8cwvR
k8YuMwKdlvYsWWyCzEGBqNCrqTtgF6Z7Nip2nyH182Zx3dRk57oZYhc2E0m9X0WuV/0KFIk8BOXIZDh
TfphQoAEwFBuALXINTl7H3Z3OGHwd1YmvUr8oIzJpZwnmXDEJpEOUN0m07Z8yjJwVnP0ARBy+2yaPA
5TdKFII4P0BM5Tak0vpx8MQCtOeDEMw2lxCgxVl0OtV0QXb+6UWGnLdA8X2nDeCR4t+WkY3ivz4I9aK
y0fE1m+n/4qLadLlSCxUToiljh0k5HkadGE3zbfSSN2W05lp1QnW2mUtL8an3jeITs4qagxy9zniCccATR1n
V8tsUH1T+Ng/uhUEI8jfe1UVEf9+wCV8xjh1HDufsfSf6xKJ/uxO9gPOuVsEhf4t3tejRXYeMy08KDpi/+rY
WInG72GkOp0+cY4T2Jnqg+G6fd9EgBDoMhUkeXCkBIQoe8Pai5lD+6uyFR8Y6QL+hhisjhznrJBj+1ope1E
XyK8VHC4hqoROidZrDHU98L8V3/LxLBiitIK257Io4ILfSQaYuqOgkr9PAzcA7IVDNNUi/oYbLVlrthNGoeG
ddT5N++rVyGh07wRWHczYuZU8s3+6GdPm8S4a2VVZh3c6NEmjdNArRTZulG44q3r8NQd/zap0NOToa
tWu5LvL2r1N8TKnG+N07V+NSlr/JIRRfbhzuJQFWN9oZl/Oe92PHQIKNjlws/yFKQSd7lRsbCMn2SeCfK7i
FTVZB/L5NS50/vj0UkKCNjPcMOjRfZYreMNg7Id4GQTp6H5YNPSKp4Vivf999JTpE33LevNIYoXuBBSIFBI
+HQrIiPk80LHnG8RctbhUWRe/0tgG0CtFJE2DuhBgoIb1w8j4sCcTg+yo4EMav7ul1K61EHgcfvsogyDuBJ
4br9zYCcMXteRc+xP3ieUHEUruc9wwFwhY4dGmb7HUGhQ4A3Im45G9D0fMydu8+LAi2IYGSb+7HsIEv
dtuUk06IEsB4hIMKADOgBXg9C1e0hFQckwb36XNCTVKCVw7KB0pIVLYjJATWNW0K7nn4UcF5wMXEsI
SBTUwIdeH/ejnnRGDOeLj7cXJCbOYY3JgQhoL5y5ZoEJrrEnJdPpzjuKaqYIyE9MLZyoJlgBh8WwQnmmEv
xqoJ0Tq2Ls1evRHSC+jtNcdSkygtyjwNF1QaQAy+xKOshNx9UkKokQ/nolKTJKR3tbJgEYB5IVEcx4p0eOeb
UPOu76p40GtBMQBHr8tDpzZ6o8OVVqMicAAY1k2op1v1P97r+lCmC6qOIwYXz8vEaAdJiJUPXrhWKgK
/7dgY7dubk0GbRQBVWZyX+/2+SHTo11qrkg/fVW7F4JVWIt+E3SqQ1yPFVwlwnZul2Eq/NV3bdu3+c8Ei
PTbaOi62+xKYEKPVUVqXDP5ygJmhj0NT13X1aZWSWZoxIllgVaOoXmYl8k3YiNJ48dUC7FEPT//BurrueF
MuZ2PDcTXW102oVwzZ9SicMp0uyYc+czIqAmeicIlbp10I0KJ+vKsrWR32RsGd+MyIcg9ghGHeiTp3SYBN
RGlEDZyFxFonSsFcVPssb1i7j5ei4KAEGuDTCz5TdcNDESZKy7tD8sxFh4OBnk7GRgtIz7LAqaDNQgBXMPq
oOa+Vi5pGJmpETE8Cy3xvuIKjXsZEW8ZOKbhp4qvAMqPgoiTLko+G1UthcFAAneqVUcF5FC7RySSPDJa
Q5NBxWIns0IXXdaHDa+CO6JyLOi4CGPR9hxboMk9xOu3JAWl4mw5WUTg7Qltot8QXNpG/jUffGQvtBS
FOVeELicFBQj1+rxljbV3GqJSMGUuZZNXgcg+UuLIVLPWoOxIyLcUAcDDquARg78E7E4rBlXlsS0IgH5hUjI
1QUoQcLbRDlxur8vMpCu7N5gXVoanixF1XfYaLGFdNqJ/WnPPuUsF5ftZBl+XQS6u+/x+EP9zKs5vV1qNjt
ErBNcOf1YapwHq3pAbpbTo79cBWwfF2P8LNJJ7nnIWGU49qwvnRQhMaqEqRpj0kbtUC/s5tP1plAPM
UXFRyznjFiI4EU5DjWJ59uoKTTbEpuD8Huhrxe1PXVc27SjtVJo7WjXslJn4nu8x3R8F53qQquHMLDS5q6
AOHaz/deQLXTKAffnQCFBx2Z5xXwY1RUm7m2eE3HdemZSFd7N5YBGgQJ0kS5xgWn1PBOcTgJlbB2R1
KejdFmqWhykxz9uk75IRdU0fvvBcdq3eJnpliq+DGuZmu5tlV1nhcG4OBdK97YxFAyhH4NDlgYYNVcBBh
accruNY9BTfJAdEuCEUmWFT7NH0HBue+QOM2heSdiY5xdthF4HSfnlc3PMv+T0vXWPP5PEypgtMYUZ
OwYSIwWBxlWRL6Sc2aclNwo6EVnE91VeGBKXORuD+pmujS5eqw270riq9VtnnH4xWc55qCw985nVR
G9NaPelobJgFfXPxeFZ9J3rLD55pd1FkUHLioRdu1LWMqounK+a8AhwckeRZF6HQH/r/VKrhJZUQK5mm
tZ+TzCwC5GjinzaHmXbnmJMMcCo54CkG822OzfeTiUMcfoNMmYfLedZ/hpuBGwzyt1UxEfQXYLCpjbas
cED3/YoVlIp73b2qSwWRRKSGw6B3GJS1CgjGLGidJAAqObQpuPKyLqgd/eu6HL9wAIVTFWJByfOpOBjv
uckWFvnOUiUir4CBrE8ULGXhpepXrQxJ/1OCiwhVdX5JhDgVnGdxqZj6/BpDDhVlRFonmb3Z6/ppatWYt
9DWS687p71BwHSuLQ6sMng+ly+srE5k1yUAojnwOfHcYgNsg1EfKYfjbSpvt52rVgue5oBALPBnsPOs4w
+YzQtZY6DtDmUgPt8kQinRX7hInF++4CMuVLX9b5bik2Zrtl6fgqK+b7Q+fmDZZZavW9ELf/ljoG0QmJBQ
uRUheHV+CnisceDl9XFJ/xnYXFl8hFEdAZYkdaT+12Z442mw/Q6sWqLRImYuuhaqsbULc3+Aybb3GkeW
TB172csnLfZUB9APfo+bDqeOS/rmWZZ+jkMgkVSihULXQ1o1gn5uT+lc4Uo71Lp2ZY2S5Mwp9GAhSfH2
8lQ68nEPB6Sw7pVGxL3NVNt19LqVS0j0Ao1nX2sCJ7fbSrZjjMBB8ld/WBq5pZPl8Ay+hZiFLUshMfy5o75
prWNvi53nWBrp04mGwYcXVLp2ZbWS5rln4aHgHnb2bfnsSxq13I5SOWib3fExa67uGxb5EYc1rA6emo
U5LZyhO2Gu6rt4Y3BNhLJYELjaEwQHvkyPKS54N4zqNq3TqwZVfbIrhDJMXP4NUuLn4eVol3OXaQA9GP
jNWLmNrh5vQecWG8zaPgpP5vqXe/DBrOXcyozhhse8K1/qifJgo7d1tlacYrYPDHyfIx0lC7PzFIPxg3WFTc
E8E5BWjXc2FTW/f8w9omFWc17vIwUJXJX5jw8jikC1hNNIQ4Ou+EqW9HoFzcHz3tDSDceXN/MU8CYO
0VT7qQhZLOgkrjJLXKdRAUXJb4P0gUSLvaDyKEDgvG1ELJ5k6sWN8ZDLgDRtzFgf3VcgQazT5iA6IZ2NSlN
bGaDGSp+cv7jYG92Rod6LmEl4OvWVwsVYYFITgtaPxKAIKeoQTotyPJPAdCpjPA+zfzSCIsYtAPu6g+NSGP
TIHS1z1fRgVheuFuRN2/iLT8xcTF4nAgkAIhZZ7XheKUnv4gn5PsSn1hguPRVNGLqo3mxms+EAJ7nnlWEZ
wHhAFTCmZjOhNim/6YzAx4WQzGyEj27WgI8jukyUwfxFbtbYs6tMBwxvzhnO2zyLfQyH+jb0RiC3smU5
KOPrWcLhjNjCT2osmW6eg2qiUVli3cu3ooMEoVOleEdGJs44aqtVDteCxTxl3XJj5i9vQyyeDUC8uGyFYlcc
BhdpdjePXNfQugqxiEsYkuSi7p/NG5SAN1wNjdSxePhN0qciuBSc1DiEOd43iK+kJwlh/t5MxWpM5Hl5K1
AtbVWC7eKOs2MYlvQSUHCKHE7wpMe9l+/IN7AfUA0XIpWA7p8PtBDnrABFWwptHLp94CuC9BzFk2ts
qgzjcFYoPJlBR/FZgUsLRed0mSTIwkyq+VBUQiiOfVxi2fT2g4Y3KuuO8LdM49D0Feq7gQHTBNKdFw/ve9
eW2RAE4HL8zlyq54m/UxXjSLNBRtV0rBDsoiu/jNf5O8U2GPc4PTAjgb9RF/nZ2XjmE4ssvjFU/oW2x1ms
AjXSUFjWXvMVIHDoil66HD6aZSyn7nuWhywoOzmuc7bc7IPFer1hSobMSOJyQR8VFvK8U38MAHSpCK
ZoyCXxnXXrLWQckGuRXxrotnXkpgMCC1UL/87DL0iSOwsDDsJter5KkWXFgUvKu4z3H1LfD3JtQQu90Q
3oByRenGetkIKdB6eB1mUEk7icFBxQ/K6HCQhxypzPOoJtQVd9H4nopfoo4Lmnks/NAjgab8FouBGfNoc
xTqIvzfUgspHl5aBgXUrCqUCIM8QbyuJf3+G1EGEiOi3smfwkon3E1nDQXgMMBxW8574DiB+SCm6CKIx
h964Si+E7t0volDOcjxb9Hw/Wa4l8kSxc48tlxoBuK2dROgIpr66rM0gxRVnXLuBBCCXcaJ2Unu0Ma+A/Qc
OSIhy5dgwsZJhAskoJfMdO9+nIDTtkDjuoWUDhoXNYdROKKLI0j2F9EER7sj4qR4oPoKJ7fVYnv9GRQ4nn
3JqJ6oVS+e0MFVggww2CmrTrjnQG3Kq8A9yTMWilZmQQzE3Dj65z+U/3RA4L7WK2e7FsueLvfK8f7SvS
tSKPA7bs6D4iRjrIGo9C1VVlkkeL3+AcKIqq2Q4p/yEum5CMLffo4Dvcw0/ctsdLf1m/KBK6e4jsBgtFj65CC
uGqAQFunFXgezHg1jtuMo/xsMOcr6OzCDGcIk5IJiCilSbZvOn3YkzDrQ3c64bLxNysdmERo4FkJ1jaKyBkU
h6Zl8FlMUSUH3ot9Gj4kiPEnDB9+ClL8TohbFL+ry9ijG39zAUTBphTSrKyatlFoG3BWTdpBgcJM3J43ZTpn
6J0QarLqEPjzg0D9ZdgbobMWHMCPwAkZip9lUQjFL3hFGyZPQZUGr28aw5HpZpytXcA47UmddQYnlQ
dPLNrVUvc9zPrejhzfkiX1wWMYvpn8XLZC8qYCit//Hn3bKYq/JUtdgTGJFHOq6a4sFModMDdb6ks9aHS
CV99W2Vy16rZPApQrRnMAGOeJgPx7cyqZo/Mh+SELdQGMH0TZrti3rEOwdl/ssijwQYHPc8JFAB4FNuv
twCG9pPjgtKpn5oPkQJRWtHk0r+NGEPTxDF+nGJKylT1vCkXxK/RnhOz7o2brpUC/poLo28yxmg0PhY18
obJB2IIRK0yeDwvheix/nYVcEerpHwBKtQBFY9VMAcrVU1RuNjcR6WBUNuCfQpwItScUMVvFalVrGOBX
5r48ToMQYp6VYb0IZLs27aDgB+kBgxjpnKF3om2cofgB/rErj8h89k8BjLnSb5gryeIwDJM0zSHR1onext06
SMLlaYoJ9ll/+oYHA+sTrbto8U+TN0rMyMi0BB+FQwMTnbpXixCj3IwYHV1FyZqTGPmzkDhCbFuaxBGfIJ
t4qpNrfHKO5744SwA+EXxhmFrQwHSDMX9oBiMoClacLo9nKve13E1b3cRS/ERbX4UZt7sZ/tbIXptAos6
qpBOFkym7C7YXxNKY3k1GXAMxoJduAMJ8gw8jk6DGAjjcRCcOKRV2udboCJyC/b2UZ47AHFWTKIyGv2
F3KeDX7Mbsrs8ScEx100uKT+nZMwviohVSl7/OkUtFGbGhBOUfN5riN8orNqEEOosrYfmbbtQSdR75HkI
fNjlR/AQPvbUquIrzO2+7Ui+b85N833Rcc7gpHN04PTGEdK+FcpNwcigXNLHhb7yriwiPdX5pT4Wr83KCZ
eH4rMgZ7DPTn/axCAdUhNJw/sTXpovQsdAY3WLjKvbaUZw5GQSSoNvSemnUM7qgluIjv8cS0Aekvzb8
Ka6k4rGuPU714MvY88aTK+BUpsv1WjLetEtN4or6YuJgKI7xIY+Sv64wXgRuUXzwU8O0gOSjaKeXSePPw
cTQsZzHUvzeJDiaucp5CDX8TWjljCf7uwKmDS8CWxOFc7+KJBodIcO25jDJTbHt9Yb3aR1TmC4NoqQws8
ro9yK+Tbfdj+8K7ksVWQwUX8LYpNHSceJUpsv1Wq9UEk7mikjxkb9xyZtTdylRsJFpBEakH1KgsuE1gMHk
M1EYGSHTwxSzCunbVfRQljKlIQZts2kYn8Vx2vA72yUEdVKKxmS0dCAI0TPmQFv2t6SDTqo8R41tzXaZRt
hdulH8deIkDAK7GkbFQPQYnvwwqaX5Or5ukziN/Bl74zbcAYyanYUDxkjHOcXfXZURG6edSPFNM5oNvG
Ds7c/HQGx4ERATjsV2FjYqBgJsbPpQmq+4vk1CiO6Qb/zt4dD+q03oQK59VISMEPveblP8iWOtbIa9tqmz
TUTWDuM8VHrU61US97ixgrdxvk1C4NjtWUoXNihc13CoMHAS/m5cmpMogA19+GDS0zYJPbg/2jpYN
oAQn4Ti+rz+Rw2GvsT1OrvTVduGg/wBCMKalVGVjIQYFXknxR89Wh608clYQwvi5ohuuKD1JxL33UrPud
pD2tUe9wLpmw14d/X0wuQN9wJ5kQ0MjKD4f7UcCNnbZbhlq4Hc8CUwK44xkO8y/KjlbLeByszzdJ0dr4
tt8sOfghBqUztj4rR/s95R0zeTMNvmN2/4Ih2n8gtD4n7ucXrEet3rsBPmAju7d2LBwobhQOVxIR0/dog8c
UE3sXV2uHJpm9+84dcpYa2NxJHbGTNUcFHZyrfBkG0Z3aXg9G9h6uzQhZ5YcrphOLC8+lI66H/2zkU3cR
6IwrWdewgQyNXZ9n//t/wzY7sJsOWS0CXA+aRWWlVqpe3p+HhmPHP5eZMbGh6keXObxe+6Jk9vWH
gjZI/dJtE0JeY3gx+2Odh5/XYA4KVzmgdrJrSA6Wa6dp/4ly+pbkZJmGS0KcCsSsHkh3+OfZofHedpL1t8RS9
aq5uPQF1t4yu3LQs3/ilmjTQznx2Cl2VokbQjnJVJ5YuzFdR1PSG+9RGuXl+spJqfbmaU1C0vu8Pc/McghD
zN0152cUKQQip9u0R0tY6GQsNF9+b67Prom0bzBkeAV2U8r78lox+dP6d5JHS6a/9Mot2lwdkAJ8S4dtq
azViY/PAorDpcJs7MOZAXXFz/takKIX18XHb4oxHsVWsWnmO3Avg7fxEL3RLYR/0g32jC9cNA8/7PCFiwS
O2MkuFPCp3pD+NbHZvhuBGjCW53VojTx+WgK8ThoYwRWeBcS9zY7pNgvJ9HyggVT8rA2SxcrMR59+Y
FEQdbdymCf3so5r9fjhMGZ10c52hvbyIaWok4S3vJvfGMkiGtAomAMxwmbNvBxZ1mbXvpKT+tJqmX6K
rUV/Rdzrs3XlXNT7B/Z/cSuBpWx3HJx7m4O+doL2VpB/dGIvkujGE4L2CuK7mPXZzzcQc9cOH69h64b+r1
6eAkQRy5N/5DQvZtETh1uKadLHEujvjb2r58UgaOaPOEs7Tn3RsHW9e8Mm0YAHgrhqbJQxcnrHzuUmI
g2t1Jr5P5CUfujf+IPGRWFgGpYGi7Hrm4U4tPv9twtZ+sENqmwPq45N5c+zEWcICrILkeyidLYrueQwrGyj
crJiWQDW2RjQQsGGkG9By7N4HJb4th/HCuHVzcicXn02pqicGVGU6jptuioI6OYKXQHwkclzV8LKHc7sd
0Pu4OAU4XaxfgnHfjEHfi3hT6mhaFycSdphDsukExfqdcTuiBc+iTF8v8kyklLI6SKPOXGYG34vQSUORrtnF
2QRcHpGnPtMYnNH2v8T4QL6C1bofu7X7L5MB9cM21By4udJlaZn4RqqdKvaEMNchEHBy9qK+DCYzTu
Ou84IBT7DZpaIuZnHOJ8qklMkaXiaeGTZy2VX5XVE2rRwls1E4XhxXAqBBUUJ+i8VvWx5kAV/+ZTle7Ovv
YuynFRY5xCQzrIcEEvl0chThu7iQbl5KP8xQxowtuOKFJuIN3y/Kisj8J7m3JjFt5nDZsppYDHH/dC1ZzAtyfxt
TZ5di7WYtfj5uYkH0DU3AujkU1Cj18ViupvGTWBcSd0NLk3dgofodRuLelM7TzOG1wpjbyBW/Fkv3nSaO
0TursxODd6LCtm8G9oTsSzIAtFKeLzeWRU/9FnpGPC6M5XXAEBTgKn5HxbnWrxxdh5FUWjnFxThs2U7t
Jh4r7nC64oc7OOO9m0yVNDfcG7oHokUfpf00ua7fJNtN7nIYA50fJakOhk6PbUMrAyfwEfLu4MEqG0M
MVdwpwc7rgRnV2KcfezYXRCG9bwF3gADc0cJDI6CJZFmU9o4Zq5vomSbrJ9yU5Q/7TyGwzCtzbkyDsb2
sUgHRtUrVRmGznVNlNgJOeH4RhRN6NLf74Igz3Bu6BzfG6FlwXkrSepd4eXRaVC5f70eUGLelPhO2MHK
X/tfFxZPFnVdk5wCk/TNcbGzrbeihloHIK7ohrxFVKuEtlXTczujh7uq5t+4+mpgvvyp7KeE/4dHxrw7xStekG
tvjzquy63K4oZhalS4zkthkFuTdwZ4TzccKWBZI03ZTzBNyHuI7G7iRJHJlTGebtGTlswR1Cku5myqOpqqp2
4XJnW5SQnwW/ha2bcROA56l4ZqMvmbf9KvLddUNglP7T4hpxSRlhmlE+br7F163uOt3UfOFNQ9sTgplI
4NcY0nF3eKq1y5IkDn3b7CsFzNsTw787V3HnskCSbvYz9NHTO8CuLtZpmkQhezdYfPDbCLNFVd7lsb30u
JdJSAwjfwlM9ZtQnpJzG327tq6rXRbat1jIz4J/giDuEeCyUBrpwru9ClYbzPynWnmaksWXUsHig3+LUOo+
Ay+RMH41bMZh9mN7agT3jGUT2HQK/i1UbrjPyHLI9tUQhJw9LqmrUt6jBosPHsDceV9m6QxU+6rMHn
jZ8cBLKSUaesFj+LW1geAFuM/IctSewKOYsdbXyBf+7ZWZu3RG89IZHILgQczbq8UlBjyof2HusjYQAQ48il
mLfXmtLwLcKzNLH1AIeDiURvaTSVm4rt0nvkLy+KUx+iim6IMUUkAh4MEIIaY919LlJkQG7uWZkaVFjhY8
nl6Ak57jdM0m8iHfl0eIj6lZWsrRQiHgsXCv0+2XELp+eLh+vD5CUBaumtALp6t15EMh4MFQr1OY3doK0
O6zEC9v3gGhPD+ecEnV1Tb2PVRQwYMxlbLspn71TpcZ6mPvgXmxnDe3WvwmT9EiAhYAjY7wo+yWuV
96n0U+GtTfAyGEF6Q3JTE4hZEGHi6oYAE4D9deZ+I63cK/vRVCqnBzQ4Tj+LYJkcEAy0AI6fnRandVKrnT1
W4V+R7829tAhYZwdXWE4/i2ClFgAEtBSLNNqbw8gb9raSE5/Ns7IXrIw127n0E3vX/DjECwHDgPF8Rk4i6
ezVkUIP/2XogeY/H/XIGx+IhvYEGQI+Ot91WruzPZt3q/iZSEf3szhHDquMLiV73FR48kWBbk4cjEZT9n4jp
eohX6GPD1fgghL6jD0e7XMSw+WByCt8eYveZ107ajlb9dp1veXp+noY/Np2+JEFYdZXPW4jdFFvnYnAW
WBy8T9PwgTpLVJt+Xddt9r34r9/lmlSR8NGMHw1tCHs47m6fl7Ns6CX1PIYUBFghFOApyyo84xlV1XdX9
B0e3yKc9mVgx87awOjgTV9R102o9cnL9P1raXs/ZN/g3sFDMRmhF6ZYwjJPUksRhSN4N4/XfGqMOP4h
6Yax3RVHpITlbFDveXt/LROEMBIvF7DX/EHwh8Xzf6z95HNcEfQ1Xj7eGFcDCCNNsvS2rmqnK7TpLQ9+j2
ikq7GDJCEaqMVhKDgxGGlKxxY8Gix+xxaevQCNg4Qg+hTmiDfFOYns9IIxDGyy+zy7fWPwPZGjBcyAcFOj
g3cCIHy0+VAKeCxYySv7gCBfgvnOyQvVgez14OuDdwE/CMOUGJXogE/CcSC8IfE9+AHA6BjOM4thHbAN
Pi1RBksaBh91I4HQ4Q/j1ud9GUkAd4BnpZesFyXb7H6b3gr+9vU8+q3ofozEEPCUU1IKvz6ra/hcgwIHTIf
dflW4Q4MCTQn1O0Weh2xwBDhxBqya/do1u9zGqp+AZ4V1KX0XbIcCBU20oP9lVTdMgwIGnhLoAguSz
bHWDAAcOER/Cj7/2VVnV+8RDgANPB7dyRp/F/+3dXXKCMBQG0EFRxHYKhZCAnej+d1lw+tCOdgFxzln
DnY/8kHvHMCdncDxcPzV5+OzzEMPZCo7yrCV7aK5h6vsYreB43KCO0xZwaboZ70x51pI9XvM0vr3HJOB
4uEHNaQ5DiJd5Xd8LOAqzncCdckjTR5eWqWvrvRrmV8C1Oc5TiPPXMgg4SlNtAdfmtCwpXb6W6dbYhv
D3H7ghjGNcBBwFqlbbFUOMUcDx7IVL+951fUiXZItKiarqsDVsvWZbVB7s60PTNOc83i8Z1Ablqfb3hq3X
4KkWzydsHc8fn/3JCHuKdO9pWJ+6/tZ6bM+z4jhu7ZJUBqVac027JP4JuFVd10agUqhqpeElT1Wb3c6cXI
pV/fCJBl5TtbMH4T+OLijcTsAh4HhZfgIAAAAAAAAAAAAAAAAAAAryDc7kKf9aU/6hAAAAAElFTkSuQmC
C"></figure><p>Explanation:</p><p>The above picture describes one iteration with
𝑛=6. </p><p>The chips 1, 3 and 4 are initially black, and the chips 2, 5 and 6 are
white. </p><p>After the iteration 2, 3 and 4 become black, and 1, 5 and 6 become
white.</p><p>Input Format:</p><p>The first line contains two integers 𝑛 and 𝑘 representing the
number of chips and the number of iterations, respectively.<br>The second line contains a string
consisting of 𝑛 characters "W" and "B". </p><p>If the 𝑖-th character is "W", then the 𝑖-th chip
is white initially. If the 𝑖-th character is "B", then the 𝑖-th chip is black initially.</p><p>Output
Format:</p><p>Print a string consisting of 𝑛 characters "W" and "B". If after 𝑘 iterations the 𝑖-th
chip is white, then the 𝑖-th character should be "W". </p><p>Otherwise the 𝑖-th character
should be "B".</p>
answer
#include<bits/stdc++.h>
void solve(){
int n,k,f[N];
string s;
int main(){
cin>>n>>k;
cin>>s;
for(int i=0;i<n;i++)
f[i]=s[i]==s[(i+1)%n]||s[i]==s[(i+n-1)%n]?0:2e9;
for(int i=0;i<n;i++)f[i]=min(f[i],f[(i+n-1)%n]+1);
for(int i=0;i<n;i++)f[i]=min(f[i],f[(i+n-1)%n]+1);
for(int i=n-1;i>=0;i--)f[i]=min(f[i],f[(i+1)%n]+1);
for(int i=n-1;i>=0;i--)f[i]=min(f[i],f[(i+1)%n]+1);
for(int i=0;i<n;i++)
cout<<(char)(s[i]^(min(f[i],k)%2?21:0));
question
<p>Question description:</p><p>The city of Hampi can be imagined as a grid of 4 rows and an odd
number of columns. It has two main villages; the first is located at the top-left cell (1,1), people who
stay there love fishing at the Tuna pond at the bottom-right cell (4,𝑛). The second village is located
at (4,1) and its people love the Salmon pond at (1,𝑛).</p><p>The mayor of Hampi wants to place 𝑘
hotels in the city, each one occupying one cell. To allow people to enter the city from anywhere,
hotels should not be placed on the border cells.</p><p>A person can move from one cell to another
if those cells are not occupied by hotels and share a side.</p><p>Can you help the mayor place the
hotels in a way such that there are equal number of shortest paths from each village to its preferred
pond?</p><p>Constraints:</p><p>3≤𝑛≤99</p><p>0≤𝑘≤2×(𝑛−2)</p><p>Input Format:</p><p>The
first line of input contain two integers, 𝑛 and 𝑘,𝑛 is odd, the width of the city, and the number of
hotels to be placed, respectively.</p><p>Output Format:</p><p>Print "YES", if it is possible to place
all the hotels in a way that satisfies the problem statement, otherwise print "NO".</p><p>If it is
possible, print an extra 4 lines that describe the city, each line should have 𝑛 characters, each of
which is "#" if that cell has a hotel on it, or "." if not.</p>
answer
#include<bits/stdc++.h>
int n,k,i,j;
char c[4][200];
class City{
cin>>n>>k;
for(i=0;i<4;i++)for(j=0;j<n;j++)c[i][j]='.';
for(j=1;j<3;j++)for(i=1;i<n/2&&k>1;i++,k-=2)c[j][i]=c[j][n-1-i]='#';
if(k>0)c[1][n/2]='#';
if(k>1)c[2][n/2]='#';
cout<<"YES"<<endl;
for(i=0;i<4;i++,cout<<endl)for(j=0;j<n;j++)cout<<c[i][j];
};
int main()
City obj;
obj.hotels();
}
question
<p>Question description:</p><p>After the big birthday party, Abilash still wanted Shalini to have
some more fun. Later, she came up with a game called <i>treasure hunt</i>. Of course, he invited
her best friends Jai and Shalini to play with her.</p><p>The three friends are very smart so they
passed all the challenges very quickly and finally reached the destination. </p><p>But the
treasure can only belong to one cat so they started to think of something which can determine who
is worthy of the treasure. Instantly, Abilash came up with some ribbons.</p><p>A random colorful
ribbon is given to each of the cats. Each color of the ribbon can be represented as an uppercase or
lowercase Latin letter. </p><p>Let's call a consecutive subsequence of colors that appears in
the ribbon a <i>subribbon</i>. </p><p>The <i>beauty</i> of a ribbon is defined as the
maximum number of times one of its subribbon appears in the ribbon. The more the subribbon
appears, the more beautiful is the ribbon. </p><p>For example, the ribbon aaaaaaa has the
beauty of 7 because its subribbon a appears 7 times, and the ribbon abcdabc has the beauty of 2
because its subribbon abc appears twice.</p><p>The rules are simple. The game will have 𝑛
turns. </p><p>Every turn, each of the cats must change strictly one color (at one position) in
his/her ribbon to an arbitrary color which is different from the unchanged one. </p><p>For
example, a ribbon aaab can be changed into acab in one turn. The one having the most beautiful
ribbon after 𝑛<math
xmlns="http://www.w3.org/1998/Math/MathML"><mi>n</mi></math> turns wins the
treasure.</p><p>Could you find out who is going to be the winner if they all play
optimally?</p><p>Constraints:</p><p>0≤𝑛≤10^9</p><p>Input Format:</p><p>The first line
contains an integer 𝑛 — the number of turns.</p><p>Next 3 lines contain 3 ribbons of Jai, Shalini
and Abilash one per line, respectively. Each ribbon is a string which contains no more than 10^5
uppercase and lowercase Latin letters and is not empty. It is guaranteed that the length of all
ribbons are equal for the purpose of fairness. Note that uppercase and lowercase letters are
considered different colors.</p><p>Output Format:</p><p>Print the name of the winner ("Jai",
"Shalini" or "Abilash"). If there are at least two cats that share the maximum beauty, print
"Draw".</p>
answer
#include <bits/stdc++.h>
int m[4], r, n;
void solve(){}
class Friends{
scanf("%d", &n);
int a[256]{}, l = 0, c;
while(!isalpha(c = getchar()));
if(m[i] == l) m[i] -= n == 1;
puts("Draw");
return;
};
int main() {
Friends obj;
obj.Hunt();
question
<p>Question Description:</p><p>Abdul is taking a geometry exam. Here is the last problem of the
exam.</p><p>You are given three points <i>a</i>, <i>b</i>, <i>c</i>.</p><p>Find a point and an
angle such that if we rotate the page around the point by the angle, the new position of <i>a</i> is
the same as the old position of <i>b</i>, and the new position of <i>b</i> is the same as the old
position of <i>c</i>.</p><p>Abdul is doubting if the problem has a solution or not (i.e. if there exists
a point and an angle satisfying the condition). Help Abdul determines if the question has a solution
or
not. </p><p>Constraints:</p><p>|<i>a<sub>x</sub></i>|, |<i>a<sub>y</sub></i>|, |<i>b<su
b>x</sub></i>|, |<i>b<sub>y</sub></i>|, |<i>c<sub>x</sub></i>|, |<i>c<sub>y</sub></i>| ≤ 10<su
p>9</sup></p><p>Input Format:</p><p>The only line contains six integers
<i>a<sub>x</sub></i>, <i>a<sub>y</sub></i>, <i>b<sub>x</sub></i>, <i>b<sub>y</sub></i>, <i>c<s
ub>x</sub></i>, <i>c<sub>y</sub></i> . It's guaranteed that the points are distinct.</p><p>Output
Format:</p><p>Print "Yes" if the problem has a solution, "No" otherwise.</p><p>You can print each
letter in any case (upper or lower).</p>
answer
#include <bits/stdc++.h>
int64_t ax,ay,bx,by,cx,cy;
class Geometry{
public:void Angle(){
cin>>ax>>ay>>bx>>by>>cx>>cy;
ax-=bx,ay-=by;cx-=bx;cy-=by;
cout<<(cy*ax!=ay*cx&&ax*ax+ay*ay==cx*cx+cy*cy?"Yes":"No");
};
int main(){
Geometry Geo;
Geo.Angle();
question
<p>Question Description:</p><p><i>n</i> evenly spaced points have been marked around the edge
of a circle. There is a number written at each point. You choose a positive real number
<i>k</i>. </p><p>Then you may repeatedly select a set of 2 or more points that are evenly
spaced, and either increase all numbers at points in the set by <i>k</i> or decrease all numbers at
points in the set by <i>k</i>. You would like to eventually end up with all numbers equal to 0. Is it
possible?</p><p>A set of 2 points is considered evenly spaced if they are diametrically opposed, and
a set of 3 or more points is considered evenly spaced if they form a regular
polygon. </p><p>Constraints:</p><p>3 ≤ <i>n</i> ≤ 100000</p><p>Input Format:</p><p>The
first line of input contains an integer <i>n</i> the number of points along the circle.</p><p>The
following line contains a string <i>s</i> with exactly <i>n</i> digits, indicating the numbers initially
present at each of the points, in clockwise order.</p><p>Output Format:</p><p>Print "YES"
(without quotes) if there is some sequence of operations that results in all numbers being 0,
otherwise "NO" (without quotes).</p><p>You can print each letter in any case (upper or lower).</p>
answer
#include<bits/stdc++.h>
using namespace std;
char s[N];
int n, m;
class diameter{
public:void circle(){
};
int main() {
diameter dm;
dm.circle();
cin>>n>>s; m = n;
if (m % i == 0) {
b[j] = a[j];
return puts("NO"), 0;
puts("YES");
return 0;
question
<p>Question Description:</p><p>Winnie-the-Pooh likes honey very much! That is why he decided
to visit his friends. Winnie has got three best friends: Rabbit, Owl, and Eeyore, each of their lives in
his own house. </p><p>There are winding paths between each pair of houses. The length of a
path between Rabbit's and Owl's houses is <i>a</i> meter, between Rabbit's and Eeyore's house is
<i>b</i> meters, between Owl's and Eeyore's house is <i>c</i> meters.</p><p>For enjoying his life
and singing merry songs Winnie-the-Pooh should have a meal n time a day. Now he is in the Rabbit's
house and has a meal for the first time. Each time when in the friend's house where Winnie is now
the supply of honey is about to end, Winnie leaves that house. </p><p>If Winnie has not had
a meal the required amount of times, he comes out from the house and goes to someone else of his
two friends. For this, he chooses one of two adjacent paths, arrives at the house on the other end,
and visits his friend. You may assume that when Winnie is eating in one of his friend's houses, the
supply of honey in other friend's houses recover (most probably, they go to the supply
store).</p><p>Winnie-the-Pooh does not like physical activity. He wants to have a meal n time,
traveling the minimum possible distance. Help him to find this
distance.</p><p>Constraints:</p><p>1 ≤ <i>n</i> ≤ 100</p><p>1 ≤ <i>a</i> ≤ 100</p><p>1 ≤ <i>b</i
> ≤ 100</p><p>1 ≤ <i>c</i> ≤ 100</p><p>Input Format:</p><p>First-line contains an integer
<i>n</i> number of visits.</p><p>Second-line contains an integer a distance between Rabbit's and
Owl's houses.</p><p>The third line contains an integer <i>b</i> the distance between Rabbit's and
Eeyore's houses.</p><p>The fourth line contains an integer <i>c</i> the distance between Owl's and
Eeyore's houses.</p><p>Output Format:</p><p>Output one number minimum distance in
meters Winnie must go through to have a meal n time.</p>
answer
#include<bits/stdc++.h>
int n,a,b,c;
class Honey{
public:void Path(){
cin>>n>>a>>b>>c;
cout<<max(min(min(a,b)*(n-1),min(a,b)+c*(n-2)),0);
};
int main()
Honey Ho;
Ho.Path();
}
question
answer
#include <bits/stdc++.h>
int n,k,d;
ll f[2][5010];
ll Pow(ll a,ll b) {
ll c=1;
for(;b;b>>=1,a=a*a%mod)if(b&1)c=c*a%mod;
return c;
class Team{
printf("%lld\n",f[d][0]);
};
int main() {
Team obj;
obj.Work();
return 0;
question
<p>Question Description:</p><p>It seems that Balaji is seriously sick. He is going to visit <i>n</i>
doctors to find out the exact diagnosis. Each of the doctors needs the information about all previous
visits, so Balaji has to visit them in the prescribed order (i.e. Balaji should first visit doctor 1, then
doctor 2, then doctor 3, and so on). Balaji will get the information about his health from the last
doctor.</p><p>Doctors have a strange working schedule. The doctor <i>i</i> goes to work on the
<i>s<sub>i</sub></i>-th day and works every <i>d<sub>i</sub></i> day. So, he works on days
<i>s<sub>i</sub></i>, <i>s<sub>i</sub></i> + <i>d<sub>i</sub></i>, <i>s<sub>i</sub></i> + 2<i>d<s
ub>i</sub></i>, ...</p><p>The doctor's appointment takes quite a long time, so Balaji can not see
more than one doctor per day. What is the minimum time he needs to visit all
doctors?</p><p>Constraints:</p><p>1 ≤ <i>n</i> ≤ 1000</p><p>1 ≤ <i>s<sub>i</sub></i>, <i>d<sub
>i</sub></i> ≤ 1000</p><p>Input Format:</p><p>First-line contains an integer <i>n</i> — number
of doctors.</p><p>Next, <i>n</i> lines contain two numbers <i>s<sub>i</sub></i> and
<i>d<sub>i</sub></i>.</p><p>Output Format:</p><p>Output a single integer the minimum day at
which Balaji can visit the last doctor.</p>
answer
#include <iostream>
int s,d,k;
class Doctors{
for(std::cin>>s;std::cin>>s>>d;k=s)
while(s<=k)
s+=d;
cout<<k;
};
int main(){
Doctors Dr;
Dr.Diagnosis();
}
question
answer
#include <bits/stdc++.h>
vector<int> ord(size);
return ord;
if (a > b) {
a = b;
return true;
return false;
if (a < b) {
a = b;
return true;
return false;
return out;
return out;
struct pt {
double x, y;
};
out << "(" << P.x << ", " << P.y << ")";
return out;
}
// P(s) = as² + bs +c
vector<pair<double,double>>& ans) {
if (a > 0) {
b /= a, c /= a, a = 1;
l0 = max(l0, l);
r0 = min(r0, r);
if (a < 0) {
a /= s, b /= s, c /= s;
ans.emplace_back(l, r);
return;
if (-0.01 < a) {
if (b > 0) l0 = (-2*c)/(b+delta);
vector<pair<double,double>>& ans) {
double lA = 0;
double rA = norm(B-A);
pt dA = (B-A)/rA;
double lC = 0;
double rC = norm(D-C);
pt dC = (D-C)/rC;
double c1 = v*v - 1;
pt P[MAXN];
double len[MAXN];
int main() {
int N;
cin>>N;
if (N <= 2) {
return 0;
double l = 1;
double r = 20;
double v = (l+r)/2;
if (good) l = v;
else r = v;
cout.precision(10);
question
answer
#include <bits/stdc++.h>
int a[200];
while(t--) {
memset(a,0,sizeof(a));
int n;
cin>>n;
for(int i=1,x;i<=n;i++){
cin>>x;
a[x]++;
int ans=0;
for(int i=1;i<=100;i++){
int sum=0;
for(int j=1;j<=i;j++)
sum+=min(a[j],a[i-j]);
sum/=2;
ans=max(ans,sum);
cout<<ans<<"\n";
return 1;
int main()
int t;
cin>>t;
Boat(t);
return 0;
question
<p>Problem Description:</p><p>Caleb and Irfan are purchasing apples which were priced according
to their size.But their budget is minimum.</p><p>So they plan to choose one small, one medium
and one large apple so that it will fit in their budget.<br>So can you help them choose the right
apple by creating a logic by naming three apples they choose as
apple1,apple2,apple3. </p><p>Then check the condition if apple2 is greater than apple1 and
apple3 is greater than apple2.</p><p>Constraints:</p><p>1≤ apple1 ≤600</p><p>1≤ apple2
≤600</p><p>1≤ apple3 ≤600</p><p>Input format:<br><br>First Line: Single number of type integer
representing the size of apple1</p><p>Second Line: Single number of type integer representing the
size of apple2</p><p>Third Line: Single number of type integer representing the size of
apple3<br><br>Output Format:<br>Print as “Fit into Budget” or “Dosen't fit into Budget” based on
the condition.</p><p>If the input is insufficient for deriving the result throw an exception message
“Incomplete information”</p>
answer
#include <iostream>
int main()
int apple1,apple2,apple3;
try{
cin>>apple1;
cin>>apple2;
cin>>apple3;
if(cin){
if(apple2>apple1&&apple3>apple2)
else
else throw 0;
catch(int budget){
cout<<"Incomplete information";
return 0;
}
question
<p>Problem Description:</p><p>You are playing a Billiards-like game on an N×N table, which has its
four corners at the points {(0,0),(0,N),(N,0), and (N,N)}. </p><p>You start from a coordinate
(x,y), (0<x<N,0<y<N) and shoot the ball at an angle 45∘ with the
horizontal. </p><p>On hitting the sides, the ball continues to move with the same velocity
and ensuring that the angle of incidence is equal to the angle of reflection with the normal, i.e, it is
reflected with zero frictional loss. </p><p>On hitting either of the four corners, the ball stops
there and doesn’t move any further.</p><p>Find the coordinates of the point of collision, when the
ball hits the sides for the Kth time. If the ball stops before hitting the sides K times, find the
coordinates of the corner point where the ball stopped
instead.</p><p>Constraints:</p><p>2≤N≤25</p><p>1≤K≤25</p><p>Input Format:</p><p>Each
testcase contains a single line of input, which has four space separated integers - N, K, x, y, denoting
the size of the board, the number of collisions to report the answer for, and the starting
coordinates.</p><p>Output Format:</p><p>In the only line of output print the coordinates of the
ball when it hits the sides for the Kth time, or the coordinates of the corner point if it stopped
earlier.</p><p>Explanation:</p><p>Assume the N=5 and K=5 x=4 and y=4 then</p><p>We shoot
the ball from coordinates (4,4), and we need to find its coordinates after it has collided with sides 5
times. However, after shooting, the ball goes directly to the corner (5,5), and stops there. So we
report the coordinates (5,5).</p><figure class="image"><img
src="data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAfMAAAHvCAYAAABAGzarAAAgAElEQ
VR4nO3df5Tdd13n8Ut/N2naJE2KBVx+hB+ljdUiBkF+2XaZgxbcUgFtgK0sAaYiYqhUBFqwZWFycMWWF
cRtXbvEcRexblC7uq47nCntrpgVT5Rj6c5a9hy3Uyhyk9Lmd977R3KnM5O57+8nMMnne+88nue8zqFkm
g5P5r6fuTN3pp0YMiYnJ2NkZGTmr8fHx2N0dDT9ezqdzvF+twaeiYmJ2u9Cq+GnGY5y+GmGo/4MZcU6
nU5MTk5GRMTIyEiMj483vj1yPIhy+GmGoxx+muGoP0NZscnJyeh0OtHpdBqflUeIeQkeRDn8NMNRDj/
NcNQfFQsxL8GDKIefZjjK4acZjvqjYiHmJXgQ5fDTDEc5/DTDUX9ULMS8BA+iHH6a4SiHn2Y46o+KhZiX4E
GUw08zHOXw0wxH/VGxEPMSPIhy+GmGoxx+muGoPyoWYl6CB1EOP81wlMNPMxz1R8VCzEvwIMrhp
xmOcvhphqP+qFiIeQkeRDn8NMNRDj/NcNQfFQsxL8GDKIefZjjK4acZjvqjYiHmJXgQ5fDTDEc5/DTDUX9
ULMS8BA+iHH6a4SiHn2Y46o+KhZiX4EGUw08zHOXw0wxH/VGxEPMSPIhy+GmGoxx+muGoPyoWYl6C
B1EOP81wlMNPMxz1R8VCzEvwIMrhpxmOcvhphqP+qFiIeQkeRDn8NMNRDj/NcNQfFQsxL8GDKIefZjj
K4acZjvqjYiHmJXgQ5fDTDEc5/DTDUX9ULMS8BA+iHH6a4SiHn2Y46o+KhZiX4EGUw08zHOXw0wxH/V
GxEPMSPIhy+GmGoxx+muGoPyoWYl6CB1EOP81wlMNPMxz1R8VCzEvwIMrhpxmOcvhphqP+qFiIeQk
eRDn8NMNRDj/NcNQfFQsxL8GDKIefZjjK4acZjvqjYiHmJXgQ5fDTDEc5/DTDUX9ULMS8BA+iHH6a4SiHn
2Y46o+KhZiX4EGUw08zHOXw0wxH/VGxEPMSPIhy+GmGoxx+muGoPyoWYl6CB1EOP81wlMNPMxz1
R8VCzEvwIMrhpxmOcvhphqP+qFiIeQkeRDn8NMNRDj/NcNQfFQsxL8GDKIefZjjK4acZjvqjYiHmJXgQ5f
DTDEc5/DTDUX9ULMS8BA+iHH6a4SiHn2Y46o+KhZiX4EGUw08zHOXw0wxH/VGxEPMSPIhy+GmGoxx
+muGoPyoWYl6CB1EOP81wlMNPMxz1R8VCzEvwIMrhpxmOcvhphqP+qFiIeQkeRDn8NMNRDj/NcNQf
FQsxL8GDKIefZjjK4acZjvqjYiHmJXgQ5fDTDEc5/DTDUX9ULMS8BA+iHH6a4SiHn2Y46o+KhZiX4EGUw08
zHOXw0wxH/VGxEPMSPIhy+GmGoxx+muGoPyoWYl6CB1EOP81wlMNPMxz1R8VCzEvwIMrhpxmOcv
hphqP+qFiIeQkeRDn8NMNRDj/NZI7WbpqIzXfcFxERW+9+MNZumpiz9dfdc0z/rMtv3n7U77Fl2wMzv3
asv9/xRsVCzEtwaHL4aYajHH6a6edo4607YuOtO2b+esu2B77r2K6/7p6ZePf79d4fHtqAioWYl+DQ5PDT
DEc5/DSzkKN7v9qNtZsm4t6vdmf+uy3bHojLb97+Xf2z1l93T2y9+8G+v74Yf2BYTFQsxLwEhyaHn2Y4yu
GnmYUcLRTuzXfc913HfO2miTTmpW9zolCxEPMSHJocfprhKIefZhZytPHWHUd9unvjrTu+q6+X957tL/T1
8tlcfvP21nyqXcVCzEtwaHL4aYajHH6aWcjR5TdvT7+23XubtZu+c7+9F9Qt9IeG2V+rr4mKhZiX4NDk8N
MMRzn8NLOQo6avbffo9+y6lM133HfUM/zF+HT+YqFiIeYlODQ5/DTDUQ4/zXw3MW96dXoTC73gTcxb
hpg349Dk8NMMRzn8NPOdfpq99zXw7+bFahtv3XFUuH2avWWIeTMOTQ4/zXCUw08zpS+Amx/d9dfd
M+e/a/q2si3bHpjzB4Qt2x5Y8A8DXgDXMsS8GYcmh59mOMrhp5nSb02b/9Pb5j97XugPALNZ6CfIzf4+9
h6+Na1liHkzDk0OP81wlMNPM6U/NKaJ0q+zZ/SerbcFFQsxL8GhyeGnGY5y+Gmm9Me5Ztz71e6i/OQ2
P861hYh5Mw5NDj/NcJTDTzOl/6KV441/0UpLEfNmHJocfprhKIefZjjqz5Ku2IEDB+Iv//Ivo9PpxJe//OXa70
6r8SDK4acZjnL46c/evXvj3nvvjfe+972xY0c7vhWsbSzZmH9ky6/GSSedFKufckGcvPy8WP2kdbHinFVxxx
131H7XWolDk8NPMxzl8LMwN/7Kh6PTeUKsfMpz47yLLouV3/O0WH3e+fHZz3629rvWKoYy5qOjo9Hp
dGY2NTU159evfsO/jPOf88Ox6qrb53zrwcorPh7nPPmCeN/73lfpPW8vDk0OP81wlMPP0fzYq66Mc5/zk
lj9+q1zbvU5r9wSq85/Rnz0ox+t/S62hqGN+eTk5IK/tnXr1lj15Gcf9T2EvZ278XNx+vJz4gtf+MIJfq/bjUOT
w08zHOXwM5dPfepTcd4zLul7q1e/7jNx8imnxvbt7fhxqrUZypiPjIz0jfmGF700lm94W98PkLWbJuKM57
wyfuK1b4zp7l47sjvvmqj+PrR5/HDEz+Ju3QUXx4qXvie91ctfMBrXvuPnT3Bh2snQxrz3KfaxsbE5v3bm8h
Vx7hv/c/oBsvp1/yHOPO9ZcfnN2+3IXnD9RPX3oc3jhyN+Fm+Xfeh/RqfTibX/6s/TW73qX3wqfuCHfqRSa
drFUMa8x9TUVHQ6nZln6QcPHownnHRSrHnzn+Uxf+3vxKnnPCme/54JMzM7wfuBd34+Tjr1zPROr900
ESt/4jfiyU97dkxMTCz5DXXMIw5//Xx8fHzmr5990SWx8tWfSD9Azv7R98cPvvSK+I/3TNuRfej2iervQ5vH
D0f8LO5Wn//0WPWTv53e6rN+5F3x02/8mYqFaQ9LLuY33XRTrH3uy9MPkHOeclF8/N/+VvWvGbVpvp
7HD0f8nMi9+e3vjHMueEX/W/2W/xbnPPHpvkXtCEMd896n2ed/a9oLXvTiWPb9P33UB8eaa/4kVlx0R
Vz241dV/0Bu2xwafjji50Rt+477Y8vHfi3OfeJTYtnzrjn6u47e+Iex4oJXxGs3vrlSXdrHUMZ89veYL/Sq9m98
4xvxmtddHWufemGcedGVcfqzXhHLL3xVnLnq/Lj6Z66NB7+1p/oHc9vm0PDDET/He397//+N239na7z/
hhvj/TfcGO981y/EhT+wIU49Y3mcuf6qOONZr4jlz/2xOP2s1fEL172nQl3ay1DGvJQvfOEL8cLXXR+nP+2lc
fk1N8Yf//lk9Q/mts6h4Ycjfo7XvvbQzvjsH/5x3PThj8yEvLftO+6Pz33+T+PiV2+ONRdfEa+59sPxpS99qXY+
WseSjnlExNt+6yux6jX/Lq77zFerf0C3eUv50PDDET/Hb71Pqc+P+PtvuDE++4d/PPN2P/lrfxMbrp+ILdv+o
XY2WomYi3nRluqh4Ycjfo7P5n9Kff5u+vBH4msP7Zx5ezHPEXMxL9pSOzT8cMTP8Vn2KfXZ+9O/uHvO3
yfmOWIu5kVbKoeGH474Ob7bvuP+NOLvv+HG+OSnbz/q7xPzHDEX86ItlUPDD0f8HP81BX37jvuP+nvEP
EfMxbxoS+nQ8MMRP8d3X3toZ9zyiU/G298+Gr/4nl/q+6K32RPzHDEX86ItpUPDD0f8HL997aGdMy98u
/6X3hu/sPndfV/0NntiniPmYl60pXJo+OGIn+O32SF//w03xsdv/Y2493/9bd8Xvc2emOeIuZgXbSkcGn444
uf4baGQ956Fb99x/4Iveps9Mc8RczEv2rAfGn44qr1h9pOFvHRiniPmYl60YT40/HDUhg2rn8UI+XRXzJsQ
czEv2rAeGn44asuG0c9ihXy6K+ZNiLmYF20YDw0/HLVpw+ZnMUM+3RXzJsRczIs2bIeGH47atmHys9ghn
+6KeRNiLuZFG6ZDww9Hbdyw+DkeIZ/uinkTYi7mRRuWQ8MPR23dMPg5XiGf7op5E2Iu5kUbhkPDD0dt
3qD7OZ4hn+6KeRNiLuZFG/RDw0/9cTS8fo53yKe7Yt6EmIt50Qb50PDTjnE0nH5ORMinu2LehJiLedEG9
dDw055xNHx+TlTIp7ti3oSYi3nRBvHQ8NOucTRcfk5kyKe7Yt6EmIt50Qbt0PDTvnE0PH5OdMinu2LehJiL
edEG6dDw085xNBx+aoR8uivmTYi5mBdtUA4NP+0dR4Pvp1bIp7ti3oSYi3nRBuHQ8NPucTTYfmqGfLor5
k2IuZgXre2Hpvb44WiY/dQO+XRXzJsQczEvWpsPTRvGD0fD6qcNIZ/uinkTYi7mRWvroWnL+OFoGP20Je
TTXTFvQszFvGhtPDRtGj8cDZufNoV8uivmTYi5mBetbYembeOHo2Hy07aQT3fFvAkxF/OitenQtHH8cDQ
sftoY8umumDch5mJetLYcmraOH46GwU9bQz7dFfMmxFzMi9aGQ9Pm8cPRoPtpc8inu2LehJiLedFqH5
q2jx+OBtlP20M+3RXzJsRczIvmEPPD0XD6GYSQT3fFvAkxF/OiOcT8cDR8fgYl5NNdMW9CzMW8aA4xPx
wNl59BCvl0V8ybEHMxL5pDzA9Hw+Nn0EI+3RXzJsRczIvmEPPD0XD4GcSQT3fFvAkxF/OiOcT8cDT4fgY1
5NNdMW9CzMW8aA4xPxwNtp9BDvl0V8ybEHMxL5pDzA9Hg+tn0EM+3RXzJsRczIvmEPPD0WD6GYa
QT3fFvAkxF/OiOcT8cDR4foYl5NNdMW9CzMW8aA4xPxwNlp9hCvl0V8ybEHMxL5pDzA9Hg+Nn2EI+3R
XzJsRczIvmEPPD0WD4GcaQT3fFvAkxF/OiOcT8cNR+P8Ma8umumDch5mJeNIeYH47a7WeYQz7dFfM
mxFzMi+YQ88NRe/0Me8inu2LehJiLedEcYn44aqefpRDy6a6YNyHmYl40h5gfjtrnZ6mEfLor5k2IuZgXzSH
mh6N2+VlKIZ/uinkTYi7mRXOI+eGoPX6WWsinu2LehJiLedEcYn44aoefpRjy6a6YNyHmYl40h5gfjur7Wa
ohn+6KeRNiLuZFc4j54aiun6Uc8umumDch5mJeNIeYH47q+VnqIZ/uinkTYi7mRXOI+eGojh8hPzwxzxFz
MS+aQ8wPRyfej5A/PjHPEXMxL5pDzA9HJ9aPkM+dmOeIuZgXzSHmh6PjszvG/yDecu274tnrnxcjr7oqbv
iVj8SX//4fhHzexDxnqGM+NjYWIyMj6duIedkcYn44WvxtvOatsfKJT43VL3xrnPPKLbHi5b8cp6x5TixbsSq
uvOoqIZ81Mc8Z6ph3Oh0xX6Q5xPxwtLi75q3viGVrnhZr3vxnsXbTxJyd82Mfi5NPOTU2/+L1Qn5kYp4zt
DEfGxvzzHwR5xDzw9Hi7fe3/WmsOPdJseaaPzkq5L2d9eLNsf6SDdXf17ZMzHOGMuZTU1MxMjISk5OT
Yr5Ic4j54Wjx9ksf+FCct2Fj35D3dtoZy+KB6W7197cNE/OcoYz5unXrYmpq6phifvWWibjzLjOz47/v3/DSO
PvSGxpjvvrpz4stH/9k9fe3DbvshonYcP1EXHvLRExM2PwNXczHxsZifHw8IsIz80XcnXd5VsUPR4u1azb9b
Cx/wdsbY37WuU+Ke7b/XfX3tw3zzDxn6GLe6XSO2rp16/q+vZiXzSHmh6PF2yd+8/Y47ezvSUO+6qrb48
yzVlZ/X9syMc8ZupjPxjPzxZtDzA9Hi7tnXXRJrHjZ9X1jvvIZG+J9Hxqr/n62ZWKeI+ZiXjSHmB+OFnfb/st/j+
Vnr4pll7wxzn3TtpmIn335TbH66T8YL3/FFdXfxzZNzHOGOuYliHnZHGJ+hsnRQzv3xiO7D8Se/QfjG7v2zf
m1h3fti937DsYjuw98x7//rt0HYs++g/HwI4d/78f2Hozds/66t7/5+6/Fpa98TZx25vJYdu5T4vRlK2Lt+U+N
G//1v6nuqG0T8xwxF/OitekQt3H8DI6jr+/cFwcPPX4DHt3zeLR3PrZ/zn3Yu//gMf/+e/cfmvN7fHv3gZn/v
O/Aob5/3y2/+e/j7/73P1b309aJeY6Yi3nR2nKI2zp+BsfRo3sPRkTE2k0TsfmO++LgoYjp7t54qLs3Dh46FP
d+tRtrN03Exlt3xKGIY/q9HzkS7o237oi1mybi3q9248DBQ3H5zdtj/XX3RETEzsf2t9pPWyfmOWIu5kVzaP
gZBkfffGRfRByO7cZbd0RExK7HDj8zf3TP3BAfa8wf3nX49+79YaAX830HDj9TX3/dPUf+8HAoHtrZTj9tnpj
niLmYF82h4WcYHO3Zf3Amtr3QTnf3xj99+/Cn17dseyDWX3dPXH7z9mOO+Z79h5/xr7/unjnPzL+950Ac
mvV7R0R8e8/RX49vg582T8xzxFzMi+bQ8DMMjg4cPBRbtj0Ql9+8PSIiHtl9IL6+8/B/HxEzAT7WmPc+vb
75jvti4607YuvdD878Xo/sPhB79z/+qf2tdz8Ye/Yd/bX4Nvhp88Q8R8zFvGgODT+D7uihnXsj4vCn0TffcV9
ERHx95+FXrkdEXH7z9pn//lhi/q0jz+p7AZ/9n3sx771N759x4ODRL4Sr7aftE/McMRfzojk0/Ay6o97Xyy+/
eXts2fZAHDx0+NPdEYcD33u23nubkpg/vOvwK+N7n7rfeveDETE35t/efSC+sevor9U/1DI/bZ+Y54i5mBf
NoeFn0B31vu1s/XX3xNa7H4z9R16YtvmO+2a+lt2jF/OIiF3J95v3Xty2dtNEbNn2wMzfPzvmBw4eiq/v3B
eHDh3+Z/X+0DD/e85r+2n7xDxHzMW8aA4NP4PuqPep7l7MDx35dvCmf9lJRET30f3xT9+e+y1lXz/yafv
Nd9yX/v2b77hvJvqzY/71XWJ+LBPzHDEX86I5NPwMuqPep7p7n2aPiJmgz2f2M/MDBw/NPIuf/1PhHjvy
Pevzmf3MPCJm3q73afbe97a3yU/bJ+Y5Yi7mRXNo+BkGR4cOzX0B3M7H9seBg4dmdvBI3WfH/OChud
9W9q15z9Af23twzu9xKObGfM/+gzOf4u+9AG7ffi+AO9aJeY6Yi3nRHBp+hsHRvgNzvzXtsb1zv0Vs9qvO
ey+Ai5j7B4D5P8t9/vYfOHTUq9lnf219690PHvXPbYufNk/Mc8RczIvm0PAzDI52PXZgzg+NiYj45rwXos3+
WeqP7nn8B8FsvfvB2LvAM+r5e3jXvpnvW39s7+PPyrdse2Dma/Dzv/7eFj9tnpjniLmYF82h4WdYHO07c
GjOt4jtXuAHuOx67PAL3nbvO/wT43qfYs9e2T57D+/aN/P19d7X5Xs/znWhZ+Vt8tPWiXmOmIt50Rwafo
bFUe9Ht/ZeaZ4Fuvvo4/8WtUPR/Cn2hXbw0OP/opVDhw7/oJo2+2nrxDxHzMW8aA4NP8Pk6NFZr0Kf/
/3e87frsQPx6J4D8fB3EPLp7uF/t3nE4VfOz3/xXFv9tHFiniPmYl40h4afYXP00M69C/7by47XP2vQ/LRtYp
4j5mJeNIeGH474qTkxzxFzMS+aQ8MPR/zUnJjniLmYF82h4YcjfmpOzHPEXMyL5tDwwxE/NSfmOWIu5k
VzaPjhiJ+aE/McMRfzojk0/HDET82JeY6Yi3nRHBp+OOKn5sQ8R8zFvGgODT8c8VNzYp4j5mJeNIeGH474
qTkxzxFzMS+aQ8MPR/zUnJjniLmYF82h4YcjfmpOzHPEXMyL5tDwwxE/NSfmOWIu5kVzaPjhiJ+aE/Mc
MRfzojk0/HDET82JeY6Yi3nRHBp+OOKn5sQ8R8zFvGgODT8c8VNzYp4j5mJeNIeGH474qTkxzxFzMS+a
Q8MPR/zUnJjniLmYF82h4YcjfmpOzHPEXMyL5tDwwxE/NSfmOWIu5kVzaPjhiJ+aE/McMRfzojk0/HDET
82JeY6Yi3nRHBp+OOKn5sQ8R8zFvGgODT8c8VNzYp4j5mJeNIeGH474qTkxzxFzMS+aQ8MPR/zUnJjniL
mYF82h4YcjfmpOzHPEXMyL5tDwwxE/NSfmOWIu5kVzaPjhiJ+aE/McMRfzojk0/HDET82JeY6Yi3nRHBp
+OOKn5sQ8R8zFvGgODT8c8VNzYp4j5mJeNIeGH474qTkxzxFzMS+aQ8MPR/zUnJjniLmYF82h4Ycjfmp
OzHPEXMyL5tDwwxE/NSfmOWIu5kVzaPjhiJ+aE/McMRfzojk0/HDET82JeY6Yi3nRHBp+OOKn5sQ8R8z
FvGgODT8c8VNzYp4j5mJeNIeGH474qTkxzxFzMS+aQ8MPR/zUnJjniLmYF82h4YcjfmpOzHPEXMyL5tD
wwxE/NSfmOWIu5kVzaPjhiJ+aE/McMRfzojk0/HDET82Jec5QxnxkZCQ6nU50Op0YHx9P31bMy+bQ8M
MRPzUn5jlDGfNewCcnJ6PTyf8ninnZHBp+OOKn5sQ8ZyhjPhsxX5w5NPxwxE/NiXnOUMd8fHw8RkZG0r
cR87I5NPxwxE/NiXnOUMZ8bGwsOp1OY8gjHo/51Vsm4s67zMysjbvshonYcP1EXHvLRExM2PwNZcx79
L5mPjU11fdtPDMv2513edbAD0f81Jtn5jlDHfOIw69sn5yc7PvrYl42h4YfjvipOTHPGbqYzw731NSUZ+aL
NIeGH474qTkxzxnKmPe+x7zT6aTPyiPEvHQODT8c8VNzYp4zdDE/VsS8bA4NPxzxU3NiniPmYl40h4Yfjvi
pOTHPEXMxL5pDww9H/NScmOeIuZgXzaHhhyN+ak7Mc8RczIvm0PDDET81J+Y5Yi7mRXNo+OGIn5oT8
xwxF/OiOTT8cMRPzYl5jpiLedEcGn444qfmxDxHzMW8aA4NPxzxU3NiniPmYl40h4YfjvipOTHPEXMxL5p
Dww9H/NScmOeIuZgXzaHhhyN+ak7Mc8RczIvm0PDDET81J+Y5Yi7mRXNo+OGIn5oT8xwxF/OiOTT8c
MRPzYl5jpiLedEcGn444qfmxDxHzMW8aA4NPxzxU3NiniPmYl40h4YfjvipOTHPEXMxL5pDww9H/NScm
OeIuZgXzaHhhyN+ak7Mc8RczIvm0PDDET81J+Y5Yi7mRXNo+OGIn5oT8xwxF/OiOTT8cMRPzYl5jpiLedE
cGn444qfmxDxHzMW8aA4NPxzxU3NiniPmYl40h4YfjvipOTHPEXMxL5pDww9H/NScmOeIuZgXzaHhhy
N+ak7Mc8RczIvm0PDDET81J+Y5Yi7mRXNo+OGIn5oT8xwxF/OiOTT8cMRPzYl5jpiLedEcGn444qfmxDx
HzMW8aA4NPxzxU3NiniPmYl40h4YfjvipOTHPEXMxL5pDww9H/NScmOeIuZgXzaHhhyN+ak7Mc8RczI
vm0PDDET81J+Y5Yi7mRXNo+OGIn5oT8xwxF/OiOTT8cMRPzYl5jpiLedEcGn444qfmxDxHzMW8aA4NP
xzxU3NiniPmYl40h4YfjvipOTHPEXMxL5pDww9H/NScmOeIuZgXzaHhhyN+ak7Mc8RczIvm0PDDET81J+
Y5Yi7mRXNo+OGIn5oT8xwxF/OiOTT8cMRPzYl5jpiLedEcGn444qfmxDxHzMW8aA4NPxzxU3NiniPmYl4
0h4YfjvipOTHPEXMxL5pDww9H/NScmOeIuZgXzaHhhyN+ak7Mc8RczIvm0PDDET81J+Y5Yi7mRXNo+O
GIn5oT8xwxF/OiOTT8cMRPzYl5jpiLedEcGn444qfmxDxHzMW8aA4NPxzxU3NiniPmYl40h4YfjvipOTHP
EXMxL5pDww9H/NScmOeIuZgXzaHhhyN+ak7Mc8RczIvm0PDDET81J+Y5Yi7mRXNo+OGIn5oT8xwxF/
OiOTT8cMRPzYl5zlDGfGRkJDqdTnQ6nRgbG0vfVszL5tDwwxE/NSfmOUMX86mpqRgfH5/5606nE1NTU
33fXszL5tDwwxE/NSfmOUMX8/mMjIzE5ORk318X87I5NPxwxE/NiXnO0MfcM/PFmUPDD0f81JyY5wx1
zEdHR4u/Zn71lom48y4zM2vjLrthIjZcPxHX3jIRExM2f0Mb85GRkcaQR3hmXro77/KsgR+O+Kk3z8xzhjL
mTV8nn42Yl82h4YcjfmpOzHOGLubj4+MxOjpa/PZiXjaHhh+O+Kk5Mc8ZupiPjY3NfI95b1ncxbxsDg0/HP
FTc2KeM3QxP1bEvGwODT8c8VNzYp4j5mJeNIeGH474qTkxzxFzMS+aQ8MPR/zUnJjniLmYF82h4Ycjfm
pOzHPEXMyL5tDwwxE/NSfmOWIu5kVzaPjhiJ+aE/McMRfzojk0/HDET82JeY6Yi3nRHBp+OOKn5sQ8R8
zFvGgODT8c8VNzYp4j5mJeNIeGH474qTkxzxFzMS+aQ8MPR/zUnJjniLmYF82h4YcjfmpOzHPEXMyL5tD
wwxE/NSfmOWIu5kVzaPjhiJ+aE/McMRfzojk0/HDET82JeY6Yi3nRHBp+OOKn5sQ8R8zFvGgODT8c8VN
zYp4j5mJeNIeGH474qTkxzxFzMS+aQ8MPR/zUnJjniLmYF82h4YcjfmpOzHPEXMyL5tDwwxE/NSfmOWI
u5kVzaPjhiJ+aE/McMRfzojk0/HDET82JeY6Yi3nRHBp+OOKn5sQ8R8zFvGgODT8c8VNzYp4j5mJeNIeGH
474qTkxzxFzMS+aQ8MPR/zUnJjniLmYF82h4YcjfmpOzHPEXMyL5tDwwxE/NSfmOWIu5kVzaPjhiJ+aE/
McMRfzojk0/HDET82JeY6Yi3nRHBp+OOKn5sQ8R8zFvGgODT8c8VNzYsS1NfEAAAtWSURBVJ4j5mJeNI
eGH474qTkxzxFzMS+aQ8MPR/zUnJjniLmYF82h4YcjfmpOzHPEXMyL5tDwwxE/NSfmOWIu5kVzaPjhiJ+
aE/McMRfzojk0/HDET82JeY6Yi3nRHBp+OOKn5sQ8R8zFvGgODT8c8VNzYp4j5mJeNIeGH474qTkxzxFz
MS+aQ8MPR/zUnJjniLmYF82h4YcjfmpOzHPEXMyL5tDwwxE/NSfmOWIu5kVzaPjhiJ+aE/McMRfzojk0/
HDET82JeY6Yi3nRHBp+OOKn5sQ8R8zFvGgODT8c8VNzYp4j5mJeNIeGH474qTkxzxFzMS+aQ8MPR/zU
nJjniLmYF82h4YcjfmpOzHPEXMyL5tDwwxE/NSfmOWIu5kVzaPjhiJ+aE/McMRfzojk0/HDET82JeY6Yi3n
RHBp+OOKn5sQ8R8zFvGgODT8c8VNzYp4j5mJeNIeGH474qTkxzxFzMS+aQ8MPR/zUnJjniLmYF82h4Yc
jfmpOzHPEXMyL5tDwwxE/NSfmOWIu5kVzaPjhiJ+aE/McMRfzojk0/HDET82JeY6Yi3nRHBp+OOKn5sQ
8Z2hjPj4+Hp1O8/88MS+bQ8MPR/zUnJjnDGXM161bF6Ojo2K+iHNo+OGIn5oT85yhjHkPMV+8OTT8c
MRPzYl5jpiLedEcGn444qfmxDxHzI/E/OotE3HnXWZm1sZddsNEbLh+Iq69ZSImJmz+xNwz86LdeZdnDfx
wxE+9eWaeI+ZiXjSHhh+O+Kk5Mc8RczEvmkPDD0f81JyY54i5mBfNoeGHI35qTsxzhjrmJYh52Rwafjjip+
bEPEfMxbxoDg0/HPFTc2KeI+ZiXjSHhh+O+Kk5Mc8RczEvmkPDD0f81JyY54i5mBfNoeGHI35qTsxzxFzMi
+bQ8MMRPzUn5jliLuZFc2j44YifmhPzHDEX86I5NPxwxE/NiXmOmIt50Rwafjjip+bEPEfMxbxoDg0/HPFT
c2KeI+ZiXjSHhh+O+Kk5Mc8RczEvmkPDD0f81JyY54i5mBfNoeGHI35qTsxzxFzMi+bQ8MMRPzUn5jliLuZ
Fc2j44YifmhPzHDEX86I5NPxwxE/NiXmOmIt50Rwafjjip+bEPEfMxbxoDg0/HPFTc2KeI+ZiXjSHhh+O+Kk
5Mc8RczEvmkPDD0f81JyY54i5mBfNoeGHI35qTsxzxFzMi+bQ8MMRPzUn5jliLuZFc2j44YifmhPzHDEX8
6I5NPxwxE/NiXmOmIt50Rwafjjip+bEPEfMxbxoDg0/HPFTc2KeI+ZiXjSHhh+O+Kk5Mc8RczEvmkPDD0f8
1JyY54i5mBfNoeGHI35qTsxzxFzMi+bQ8MMRPzUn5jliLuZFc2j44YifmhPzHDEX86I5NPxwxE/NiXmOmIt
50Rwafjjip+bEPEfMxbxoDg0/HPFTc2KeI+ZiXjSHhh+O+Kk5Mc8RczEvmkPDD0f81JyY54i5mBfNoeGHI3
5qTsxzxFzMi+bQ8MMRPzUn5jliLuZFc2j44YifmhPzHDEX86I5NPxwxE/NiXmOmIt50Rwafjjip+bEPEfMxb
xoDg0/HPFTc2KeI+ZiXjSHhh+O+Kk5Mc8RczEvmkPDD0f81JyY54i5mBfNoeGHI35qTsxzxFzMi+bQ8MM
RPzUn5jliLuZFc2j44YifmhPzHDEX86I5NPxwxE/NiXmOmIt50Rwafjjip+bEPEfMxbxoDg0/HPFTc2KeI+ZiX
jSHhh+O+Kk5Mc8RczEvmkPDD0f81JyY54i5mBfNoeGHI35qTsxzxFzMi+bQ8MMRPzUn5jliLuZFc2j44Yif
mhPzHDEX86I5NPxwxE/NiXmOmIt50Rwafjjip+bEPEfMxbxoDg0/HPFTc2KeI+ZiXjSHhh+O+Kk5Mc8Rcz
EvmkPDD0f81JyY54i5mBfNoeGHI35qTsxzxFzMi+bQ8MMRPzUn5jlLOubf/OY348c33xbLvv+n46fevzX+
z//7p+ofsG2dQ8MPR/zU2t9N/WO85G2fjKde/s64duz3Y/fu3bXz0TqWbMzfd8OHotPpxLKnXBKnrF4Xy
5+8Pk459bT46Md+vfoHbhvn0PDDET81Nvrz74kzlq2IZd/7g7HswlfHWU+6MJaddXbcfvvttTPSKpZkzF99
5Wtj7XN/NFb/1O/F2k0TM1t15afjnKdeEqPveFf1D+C2zaHhhyN+TvReculIrF0/Eue+4Q/m3OqVr741zn7
yRfHBD36wdk5aw5KL+W233RZrnnbxnA+M2Vvzpj+KM885L37vc39U/QO5TXNo+OGInxO5mz7yq7Hm
mRv63upzr/5PcdqZZ8UXv/jF2llpBUsu5s9/wYvjrBf+XN8PkLWbJmLFy66PS694ffyP+7t2ZJ/67ET196HN4
4cjfhZ3T37GhXH2pR9Ib/VZL3xHvG30HbWz0gqWXMxPP3N5rHnT59MPkNWv/904Y80z4mUf+pId2fN/
caL6+9Dm8cMRP4u3l3zgi/GEJ5wUa9/yF+mtXvWa34qLn/fDtbPSCpZczE8+5dRYc81d+QfIT/52nLzi/Fh1
5afNzOwEb+UVvx5POPm09E4f/tr5J+IJp6+ITqdjteN6orng4ufHylfdkn+a/eXvjRe/4sq4+++/ZWZmFfbE7
31mrHrNbfmn2V/0znjDNW+pnZVWsORi/rGPfSxWP/OF6QfI2d/zzBgfH6/9rgLAkuX6X/5ArLzg0v4vVr7
mrli++knx+c9/vva72gqWXMwjIl526T+Pcy6+Mta8+b/OfXXkxs/FWc++LK58/Rtrv4sAsOT5vks2xJnf97qj
X9f0U78bay54Wbz9Z3+u9rvYGpZkzPfs2RNveevbY+UTnxorLhiJ0/7Zi2LVBZfFmWetjOuu/+Xa7x4AICK6
3W684U3XxMmnnh4rnvvKWP5Db4m1F14ap5x2Rnzgxptqv3utYknGvMdf//Vfx2233Rbvfve74zOf+Ux8
5Stfqf0uAQDm8Vd/9Vfx6U9/Ot75rnfH+Ph43HfffbXfpdaxpGMOAMAwMJQxHx8fn3m5/tjYWO13Zyjo
OcXRjIyM+HhrYLYjLy7tz9jYWIyMjNR+N1rJ6OjonG/Fmpqaqv0utYqhvM6z/4/udDoxOTlZ+T0abNatWzf
zQMJcpqam5sTJkVmYnqPJyUkfRwmdTkfM+zA6OuqWJwzdo2p8fDxGR0dn/npsbMyzpUXCEW5mZGT
EwWnAx9HC9G6VmC+Mx1bO0D2q5sd7ftzxneMIN+OZec74+LhYLcDU1NRMrPhZGF/O6s/k5OTwxXx0
dHTOpz3FfPEQ85zR0VFHpg9jY2M+hZywbt26mJqaEvMCpqamfPl0HuPj48MXc8/Mjx9i3p+RkREhL6D3
NXOfvXicsbGxOa8pEPNm5j9pW+oMZcwX+pq5/9MXBzFfGF/LOzb4mstC/9KMdevW1X63Wo2Yz2UoP
83e+xRMD88CFg8xPxqf+Wlmdrh7j0+PyYXxzLwZH0MLM5TXefb3mfvT2+Ih5kfT+1rw7In7XHqfWu/Ns/
L+iHl/fAzluM4AAAw4Yg4AwIAj5gAADDhiDgDAgCPmAAAMOGIOAMCAI+YAAAw4Yg4AwIAj5gAADDhi
DgDAgCPmAAAMOGIOAMCAI+YAAAw4Yg4AwIAj5gAADDhiDgDAgCPmAAAMOGIOAMCAI+YAAAw4Y
g4AwIAj5gAADDhiDgDAgCPmAAAMOGIOAMCAI+YAAAw4Yg4AwIAj5gAADDhiDgDAgCPmAAAMOGIO
AMCAI+YAAAw4Yg4AwIAj5gAADDhiDgDAgCPmAAAMOGIOAMCAI+YAAAw4Yg4AwIAj5gAADDhiDgD
AgCPmAAAMOGIOAMCAI+YAAAw4Yg4AwIAj5gAADDj/H6so1FCbPSUjAAAAAElFTkSuQmCC"></figure
><p>Similarly assume N=5 and K=2 x=3 and y=1 then</p><p>We shoot the ball from the coordinates
(3,1), and we need to find its coordinates after it has collided with the sides twice. After shooting, it
first hits the right side at (5,3), and then the top side at (3,5). So, we report (3,5).</p><figure
class="image"><img
src="data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAlUAAAH2CAYAAABZZnlvAAAgAElEQV
R4nO29e5iddX2vvThDQsiBBEXp9hBLQSKUiuDZLaROVTzgsRK11JrXDh6JqWhFsIK7Ti53pWbL5rWFXmY
Tx60b6Qut2Qe3e9mJiYJ5cZtid0LHUtvXTJDDCjlOZibf94/JM3nWmrV+32eSteb3eZ7ffV/X5/LCZCZrbp78
1s1aa9bUrALUarXYN0Geer0e+yZIgx8fHIXBjw+OwuDHR91RJWqEqPJRvxBjgx8fHIXBjw+OwuDHR91RJ
WqEqPJRvxBjgx8fHIXBjw+OwuDHR91RJWqEqPJRvxBjgx8fHIXBjw+OwuDHR91RJWqEqPJRvxBjgx8fHIX
Bjw+OwuDHR91RJWqEqPJRvxBjgx8fHIXBjw+OwuDHR91RJWqEqPJRvxBjgx8fHIXBjw+OwuDHR91RJW
qEqPJRvxBjgx8fHIXBjw+OwuDHR91RJWqEqPJRvxBjgx8fHIXBjw+OwuDHR91RJWqEqPJRvxBjgx8fHIXBj
w+OwuDHR91RJWqEqPJRvxBjgx8fHIXBjw+OwuDHR91RJWqEqPJRvxBjgx8fHIXBjw+OwuDHR92RbI30
9/dbrVazWq1mQ0NDwd9LVPmoX4ixwY8PjsLgxwdHYfDjo+5Iskb6+/ttYGCg8O8nqnzUL8TY4McHR2H
w44OjMPjxUXckWSNLly6d0e8nqnzUL8TY4McHR2Hw44OjMPjxUXckVyNDQ0PW399vS5cutVqtZn19fe
7HEFU+6hdibPDjg6Mw+PHBURj8+Kg7kquRwcFBq9VqNjw8bGZmfX197lOBtVrN6vU6Y4wxxli0SUZVf3
9/0z97j1bxSJVPva5d97HBjw+OwuDHB0dh8OOj7kiuRoaGhpoiqjWy2kFU+ahfiLHBjw+OwuDHB0dh8O
Oj7kiyRvJvo9DX12eDg4Pu74cw6hdibPDjg6Mw+PHBURj8+Kg7kqyRoaGhqfeo8h6lMiOqiqB+IcYGPz44
CoMfHxyFwY+PuqNK1AhR5aN+IcYGPz44CoMfHxyFwY+PuqNK1AhR5aN+IcYGPz44CoMfHxyFwY+Puq
NK1AhR5aN+IcYGPz44CoMfHxyFwY+PuqNK1AhR5aN+IcYGPz44CoMfHxyFwY+PuqNK1AhR5aN+IcYGP
z44CoMfHxyFwY+PuqNK1AhR5aN+IcYGPz44CoMfHxyFwY+PuqNK1AhR5aN+IcYGPz44CoMfHxyFwY+
PuqNK1AhR5aN+IcYGPz44CoMfHxyFwY+PuqNK1AhR5aN+IcYGPz44CoMfHxyFwY+PuqNK1AhR5aN+Ic
YGPz44CoMfHxyFwY+PuqNK1AhR5aN+IcYGPz44CoMfHxyFwY+PuqNK1AhR5aN+IcYGPz44CoMfHxyF
wY+PuqNK1AhR5aN+IcYGPz44CoMfHxyFwY+PuqNK1AhR5aN+IcYGPz44CoMfHxyFwY+PuqNK1AhR5a
N+IcYGPz44CoMfHxyFwY+PuqNK1AhR5aN+IcYGPz44CoMfHxyFwY+PuqNK1AhR5aN+IcYGPz44CoMfH
xyFwY+PuqNK1AhR5aN+IcYGPz44CoMfHxyFwY+PuqNK1AhR5aN+IcYGPz44CoMfHxyFwY+PuqNK1Ah
R5aN+IcYGPz44CoMfHxyFwY+PuqNK1AhR5aN+IcYGPz44CoMfHxyFwY+PuqNK1AhR5aN+IcYGPz44Co
MfHxyFwY+PuqNK1AhR5aN+IcYGPz44CoMfHxyFwY+PuqNK1AhR5aN+IcYGPz44CoMfHxyFwY+PuqNK
1AhR5aN+IcYGPz44CoMfHxyFwY+PuqNK1AhR5aN+IcYGPz44CoMfHxyFwY+PuqNK1AhR5aN+IcYGPz4
4CoMfHxyFwY+PuqNK1AhR5aN+IcYGPz44CoMfHxyFwY+PuqNK1AhR5aN+IcYGPz44CoMfHxyFwY+Pu
qNK1AhR5aN+IcYGPz44CoMfHxyFwY+PuqNK1AhR5aN+IcYGPz44CoMfHxyFwY+PuqNK1AhR5aN+IcYG
Pz44CoMfHxyFwY+PuqNK1AhR5aN+IcYGPz44CoMfHxyFwY+PuqNK1AhR5aN+IcYGPz44CoMfHxyFwY
+PuqNK1AhR5aN+IcYGPz5DQ0Oxb4I0XEM+OAqDHx91R5WoEaLKR/1CjA1+fBqNRuybIA3XkA+OwuDH
R91RJWqEqPJRvxBjUxU/q9Zts+W3bOnJ515z7yO2ZOURT6vWbbNlqzc1/XP+10Msv2VLz25nLO6///7Y
N0Geqvw96xX48VF3VIkaIap81C/E2OT9ZHGQ3+bt5XiUJhRVy1ZvOqavK9Wo2ry9YUtW1m3NvY+Ymd
mKtVubHK5at83MZvZIXuu/h/y/iyUr67Zi7dbufyECcA6FwY+PuqNK1AhR5aN+Icbmpz/9qZlN3mHmQ8F
sMhbWb9wR42bNmHZRlcVOFgX5/38mX5cXVVVl+S1bpsLJzJqCJwuu/K97ZB/TKWizXy/LNTcTOIfC4Md
H3VElaoSo8lG/EGPz0EMPmZmV/s6sNarWb9zRtUfaUoyqzF+IFWu3zuiRpSyauvk5ywLnUBj8+Kg7qkSN
EFU+6hdibP7hH/7BzKztIzrtyD+V1i4ssgDJ1u7RjU5Pw+Ufqcj/Oe0eDcn/evaISj6qWh9lCdF6m1u/Li+qVq
zd2vRnt36d+V9btnrTtNvV+rRaa1Rkn7/1dvaSVeu2uXGz/JYttmLtVtu7d2+hz1kk1Ir8njLCORQGPz7qjipR
I0SVj/qFGJsf/vCHZnYkHEKv92kNr9aYyJ5uy4dSFhDZnWX+47M/M3uELB8j2efIPi7/KNqy1Zua7vCz35O/
LUUfeWt3m7PIab2d+Y8JRVXr15mPqNaoWn7LlmkRt2z1pqbPl92e/Ndc5LVZy2/Z0vY1TN6/5+xjQ5GdO
dm8vWG//OUvg5+r9WO817aV/VHTdnAOhcGPj7qjStQIUeWjfiHGptVPpzvddo9c5F8j470eJntUo5X80z
2tL4zOf2wWIq2Bk/882W32XrvT+vW2i4dlqzdN/f8ziSrvz85HVaenKFs/R7vXu/X6EZ1lqzdN+3eZ/Zmt18
euXbuO6s/Igrb1z8m7rwqcQ2Hw46PuqBI1QlT5qF+Isenkp/UpptCjHus37ugYO/nP1y648oHSKczyQdb6
qFD+87SGjfdoRyhM8n/mTB+pyly1u535qAp9x2Lrd921/r5uvmas058f+tzZn3+sr39qF9szeeq2LHAOhcG
Pj7qjStQIUeWjfiHGJuQnf4fX6ZGmjDX3PhJ88XY3o6rd7WgNlHavXWqlV1GVvw2t4TGbUXUsT/8VCbZu
PFrW7t8nUZUe+PFRd1SJGiGqfNQvxNg8+OCDHX8tf4fXKRwyvKe9Ot1Rtnv6LxRVnb7zrvU1RkXfO6pT7
B3t03+ttMZPu6f/Wmn39N9sP1LV7um/VroRVe3il6f/0gM/PuqOKlEjRJWP+oUYm3/5l3+xzdsb0+60W1
/f1Ol9ido97ZWnyAvVszAoElXZ78k/upEFVOvXkN2e1vDIv09Vpxeq56NpJlG1fuOOJketH1v0her5ry9GVL
W+UH3NvY9M+/fS7t9DKLxXrN0a/IaA/OflheppgR8fdUeVqBGiykf9QoxNFlWdXiuVp93va/09rW8PkL9jz
r/Qud3bAhSJqna3Y9W6bR3v0Nt9x1m7NzkNPTV2NC9U7/Qdbu0emWl9mq7dWy7MdlS1fmNCu3932
e3MXqjufcdgq+d2jzjylgppgh8fdUeVqBGiykf9QowNP7fNZ//+/bFvwqwzk7j513/9VzMr9josD+9p5rLCO
RQGPz7qjipRI0SVj/qFGBv8+KQankVfML5r1y5bv3HHMccQP6YmXfDjo+6oEjVCVPmoX4ixwY9Pqo46v
W9YKz//+c+78ud14y0aVEn1GioKfnzUHVWiRogqH/ULMTb48cFRGPz44CgMfnzUHVWiRogqH/ULMTb
48cFRGPz44CgMfnzUHVWiRogqH/ULMTb48cFRGPz44CgMfnzUHVWiRogqH/ULMTb48cFRGPz44CgM
fnzUHVWiRogqH/ULMTb48cFRGPz44CgMfnzUHVWiRogqH/ULMTb48cFRGPz44CgMfnzUHVWiRogqH
/ULMTb48cFRGPz44CgMfnzUHVWiRogqH/ULMTb48cFRGPz44CgMfnzUHVWiRogqH/ULMTb48cFRGP
z44CgMfnzUHVWiRogqH/ULMTb48cFRGPz44CgMfnzUHVWiRogqH/ULMTb48cFRGPz44CgMfnzUHZ
W6RsbHx+3++++3Wq1mP/nJT2LfHGnUL8TY4KczjUbDvve979lnP/tZ+8d//MfYN0cWrqHOjI6O2ubNm+
1Tn/qUbd1azZ9r2A24hnzUHZU2qv50zb+3448/3hadc56dMPcsW/SMpTZv/kJbt25d7JsmifqFGBv8TGdi
YsL+8NoP2UmnnGqLnnOxPe28l9u8RWfbsoteaBs3box98+TgGmrPTZ/7vNVqx9mCc863sy64whY8/dm
26Kyz7Vvf+lbsmyYH15CPuiPJqOrv77darTa14eHhpl+/+t2/Z2f/xott4VvvtCUr61NbcOWtNv+Z59mnP/3
pSLdcF/ULMTb4mc655y+zxb/5Jlt8zYamv2fzXnW9nTr3DLv77rtj30QpuIam87o3XGVn/sYrbNE71zddQ/
Nfu8YWnv1c+8IXvhD7JkrBNeSj7kg2qoaGhtr+2vr1623hM89t+gua35kr7rZT5s6373//+7N8q7VRvxBjg5
9mPvTR6+zpF7+h49+z+X1fsLPOPseeeuqp2DdVBq6hZm6//XY767kXd7yGFr3jLjvhxJNsy5YtsW+qDFxD
PuqOJKOqr6+vY1Rd+tJX2txLP9DxL+qSlXU79Tdea296+3tspDHKDu+eDfXot0F5+GneCSeeZGde/a3g37
N557/W/mzt/x39tqqMa6h5S8+70Oa98hPBa2juZf127Yc+Osv3MLqoB4MC6o5koyp76m9gYKDp106b
O8/OfM//E/yLuugd/8lOO+vXbfktW9jhXXZ9PfptUB5+ci4++HU7+cznBv+OLVlZt3mv/CN7xmXvjH57VcY
1dGRX/MmPrFar2ZI/+G7wGlr45tvtN1/0skj3NHqoB4MC6o4koypjeHjYarXa1KNWExMTdtzxx9vi9/33cF
S9/Wt20vxn2CWfqDPGZrjzrv6ynfy05xeKqkUX9EW/vUxvv/mR++z4k05zr6EFb7rNnvnsc61erzNWiUlHl
dnk66sGBwen/vncCy62BW/8D8G/qGe8+gZ74SuvtP+8aYQd3p/cWY9+G5SHnyNb9z9/bsefcKJ7h3j6sjf
bNR+7OfrtVRnXUPMWnf0cW/i2vwpfQy/7mL3rPb8f8R5Gi3pd+1EYBdQdlS6qbr75Zlty/r8N/kWdf84Fd
utX/iL6awqUxus98DOTvbrvDTb3kvcFHw0+7vjj7X/9YEv026oyrqHmrfzgKlt4we90Pqvf/z9t/tOew1sr5F
APBgXUHUlHVfb0X+tbKlz20pfbnIveNe0v6eJrvmPzLrjSrnj9W6MfKGrjwMfPTPbAT7fbqXPm2ryXr5r+O
pi33mFzzrnIXr38d2z9N+62h3/xaPTbqzCuoelbet6FNue3rpl2DZ35nr+2eee9xt6+4n2R7l00UQ8GBdQdS
UZV/j2q2n0X4K9+9St7yzuutiXPer6ddsFVdsqvv8bmPv8NdtrCs+3q37/Wdjx5IPphojYOfPzMdP/1ez+wF
/zWZbb4119scy662uZe1m+nn7vcjjv+eLui7/V2w403Te3eDd+Nfntjj2to+h782c/tVX1vspNOnWunLXur
nfrrr7G557/OTjl9kV23+hMR7l20UQ8GBdQdSUZVUb7//e/bS95xvZ3y7Ffa8mtusr/97lD0Q0R1HPj4Odr
d9c2/tk/88U12xevfal/+j3fYj37yf2z9N+5uiqobbrzJbl17m9V/8ED02xtrXEOdd/d9/80ufOMqW3zhlfaWa
z9vDzzwQOy7D0nUg0EBdUeljiozsw/8xc9s4Vv+0lbftT36waE8Dnz8dNPRP+/cZWu++KVpYXXDjTcl+5Qg
11B4b/vS/7ZLr6/bmnv/KfbdhizqwaCAuiOiKpFx4OOn2442/Xhr26hK9SlBrqHwiCof9WBQQN0RUZXIOP
Dx0wtHt669LRhWKT0lyDUUHlHlox4MCqg7IqoSGQc+fnrh6OFfPBqMqiysYt/2WH7YkRFVPurBoIC6I6Iq
kXHg46dXjtq9aD0fVP+8c1f02x7TD5scUeWjHgwKqDsiqhIZBz5+euWo3YvWP/rRj9m1H/yg/Y/6pui3O7
YfNjmiykc9GBRQd0RUJTIOfPz00lHri9Y/+rHr7NOfudFuuPEmXlPFbKRBVBVBPRgUUHdEVCUyDnz89Np
R9qL1W9feZj/c8lBTZKUQVlxD4RFVPurBoIC6I6IqkXHg46fXjh7+xaNNr6HasvXhpMKKayg8ospHPRgUU
HdEVCUyDnz8xHCUUlhxDYVHVPmoB4MC6o6IqkTGgY+fWI5SCSuuofCIKh/1YFBA3RFRlcg48PET01EKY
cU1FB5R5aMeDAqoOyKqEhkHPn5iO6p6WHENhUdU+agHgwLqjoiqRMaBjx8FR1UOK66h8IgqH/VgUE
DdEVGVyDjw8aPiqKphxTUUHlHlox4MCqg7IqoSGQc+fpQcVTGsuIbCI6p81INBAXVHRFUi48DHj5qjqoU
V11B4RJWPejAooO6IqEpkHPj4UXRUpbDiGgqPqPJRDwYF1B0RVYmMAx8/qo6qElZcQ+ERVT7qwaCAui
OiKpFx4ONH2VEVwoprKDyiykc9GBRQd0RUJTIOfPyoOyp7WHENhUdU+agHgwLqjoiqRMaBj58yOCpz
WHENhUdU+agHgwLqjoiqRMaBj5+yOCprWHENhUdU+agHgwLqjoiqRMaBj58yOSpjWHENhUdU+agH
gwLqjoiqRMaBj5+yOSpbWHENhUdU+agHgwLqjoiqRMaBj58yOipTWHENhUdU+agHgwLqjoiqRMaBj5
+yOipLWHENhUdU+agHgwLqjoiqRMaBj58yOypDWHENhUdU+agHgwLqjoiqRMaBj5+yO1IPq9h+1EdU
+agHgwLqjoiqRMaBj58qOFIOKwU/yiOqfNSDQQF1R0RVIuPAx09VHKmGlYof1RFVPurBoIC6I6IqkXHg4
6dKjhTDSsmP4ogqH/VgUEDdEVGVyDjw8VM1R2phpeZHbUSVj3owKKDuiKhKZBz4+KmiI6WwUvSjNKL
KRz0YFFB3RFQlMg58/FTVkUpYqfpRGVHlox4MCqg7IqoSGQc+fqrsSCGslP0ojKjyUQ8GBdQdEVWJjAMf
P1V3FDus1P3EHlHlox4MCqg7IqoSGQc+flJwFDOsyuAn5ogqH/VgUEDdEVGVyDjw8ZOKo1hhVRY/sUZU
+agHgwLqjoiqRMaBj5+UHMUIqzL5iTGiykc9GBRQd0RUJTIOfPyk5mi2w6psfmZ7RJWPejAooO6IqEpkH
Pj4SdHRbIZVGf3M5ogqH/VgUEDdEVGVyDjw8ZOqo9kKq7L6ma0RVT7qwaCAuiOiKpFx4OMnZUezEVZl
9jMbI6p81INBAXVHRFUi48DHT+qOeh1WZffT6xFVPurBoIC6I6IqkXHg4wdHvQ2rKvjp5YgqH/VgUEDdE
VGVyDjw8YOjyfUqrKrip1cjqnzUg0EBdUdEVSLjwMcPjo6sF2FVJT+9GFHlox4MCqg7IqoSGQc+fnDUvG6
HVdX8dHtElY96MCig7oioSmQc+PjB0fR1M6yq6KebI6p81INBAXVHRFUi48DHD47ar1thVVU/3RpR5aM
eDAqoOyKqEhkHPn5w1HndCKsq++nGiCof9WBQQN0RUZXIOPDxg6PwjjWsqu7nWEdU+agHgwLqjoiq
RMaBjx8c+TuWsErBz7GMqPJRDwYF1B0RVYmMAx8/OCq2ow2rVPwc7YgqH/VgUEDdEVGVyDjw8YOj4
juasErJz9GMqPJRDwYF1B0RVYmMAx8/OJrZZhpWqfmZ6YgqH/VgUEDdEVGVyDjw8YOjmW8mYZWin5
mMqPJRDwYF1B0RVYmMAx8/ODq6FQ2rVP0UHVHlox4MCqg7IqoSGQc+fnB09CsSVin7KTKiykc9GBR
Qd0RUJTIOfPzg6NjmhVXqfrwRVT7qwaCAuiOiKpFx4OMHR8e+UFjhJzyiykc9GBRQdyQdVQMDA9bX1xf
8PURVsXHg4wdH3VmnsMJPeESVj3owKKDuSDqqarUaUdWlceDjB0fdW7uwwk94RJWPejAooO5INqo
GBgZ4pKqL48DHD466u9awuv2Ou6LfJuURVT7qwaCAuiPJqBoeHra+vj4bGhoiqro07hDxg6PuLx9W161
aPeMfwpzSiCof9WBQQN2RZFQtXbrUhoeHZxRVV6+p2z0bGGNsdvdXX7/brlu1emq333FX9NukuCturN
ul19ft2i/XrV5nrJqTi6qBgQEbHBw0M+ORqi7ung08yoAfHPVqW7Y+bNetWj3jH8Kc0nikyqde134URgF1
R3JRVavVpm3p0qUdfz9RVWzcIeIHR73dX3397hn/EOaURlT5qAeDAuqO5KIqD49UdW/cIeIHR733M9M
fwpzSiCof9WBQQN0RUZXIuEPED45mxw9h1X5ElY96MCig7kg6qopAVBUbd4j4wdHs+SGspo+o8lEPBg
XUHRFViYw7RPzgaHb9EFbNI6p81INBAXVHRFUi4w4RPziafT+E1ZERVT7qwaCAuiOiKpFxh4gfHMXxQ1h
NjqjyUQ8GBdQdEVWJjDtE/OAonh/CiqgqgnowKKDuiKhKZNwh4gdHcf2kHlZElY96MCig7oioSmTcIeIHR
/H9pBxWRJWPejAooO6IqEpk3CHiB0caflINK6LKRz0YFFB3RFQlMu4Q8YMjHT8phhVR5aMeDAqoOyKq
Ehl3iPjBkZaf1MKKqPJRDwYF1B0RVYmMO0T84EjPT0phRVT5qAeDAuqOiKpExh0ifnCk6SeVsCKqfNSDQ
QF1R0RVIuMOET840vWTQlgRVT7qwaCAuiOiKpFxh4gfHGn7qXpYEVU+6sGggLojoiqRcYeIHxzp+6lyWB
FVPurBoIC6I6IqkXGHiB8clcNPVcOKqPJRDwYF1B0RVYmMO0T84Kg8fqoYVkSVj3owKKDuiKhKZNwh4g
dH5fJTtbAiqnzUg0EBdUdEVSLjDhE/OCqfnyqFFVHlox4MCqg7IqoSGXeI+MFROf1UJayIKh/1YFBA3RFRlc
i4Q8QPjsrrpwphRVT5qAeDAuqOiKpExh0ifnBUbj9lDyuiykc9GBRQd0RUJTLuEPGDo/L7KXNYEVU+6sGg
gLojoiqRcYeIHxxVw09Zw4qo8lEPBgXUHRFViYw7RPzgqDp+yhhWRJWPejAooO6IqEpk3CHiB0fV8lO2sC
KqfNSDQQF1R0RVIuMOET84qp6fMoUVUeWjHgwKqDsiqhIZd4j4wVE1/ZQlrIgqH/VgUEDdEVGVyLhDx
A+OquunDGFFVPmoB4MC6o6IqkTGHSJ+cFRtP+phRVT5qAeDAuqOiKpEFvvAVx9+cFQFP8phRVT5qAe
DAuqOiKpEpnDgKw8/OKqKH9WwIqp81INBAXVHRFUiUznwVYcfHFXJj2JYEVU+6sGggLojoiqRKR34isM
PjqrmRy2siCof9WBQQN0RUZXI1A58teEHR1X0oxRWRJWPejAooO6IqEpkige+0vCDo6r6UQkrospHPRg
UUHdEVCUy1QNfZfjBUZX9KIQVUeWjHgwKqDsiqhKZ8oGvMPzgqOp+YocVUeWjHgwKqDsiqhKZ+oEfe/
jBUQp+YoYVUeWjHgwKqDsiqhJZGQ58/GgPR9XwEyusiCof9WBQQN0RUZXIynLg40d3OKqOnxhhRVT5
qAeDAuqOiKpEVqYDHz+aw1G1/Mx2WBFVPurBoIC6I6IqkZXtwMeP3nBUPT+zGVZElY96MCig7oioSmRl
PPDxozUcVdPPbIUVUeWjHgwKqDsiqhJZWQ98/OgMR9X1MxthRVT5qAeDAuqOiKpEVuYDHz8aw1G1/
fQ6rIgqH/VgUEDdEVGVyMp+4OMn/nBUfT+9DCuiykc9GBRQd0RUJbIqHPj4wZHyquKnV2FFVPmoB4M
C6o6IqkRWlQMfPzhSXZX89CKsiCof9WBQQN0RUZXIqnTg4wdHiquan26HFVHlox4MCqg7IqoSWdUOfP
zgSG1V9NPNsCKqfNSDQQF1R0RVIqvigY8fHCmtqn66FVZElY96MCig7oioSmRVPfDxgyOVVdlPN8KKqPJ
RDwYF1B0RVYmsygc+fnCksKr7OdawIqp81INBAXVHRFUiq/qBjx8cxV4Kfo4lrIgqH/VgUEDdEVGVyFI48P
GDI/z0fkcbVkSVj3owKKDuiKhKZKkc+PjBEX56v6MJK6LKRz0YFFB3RFQlspQOfPzgCD+930zDiqjyUQ8GB
dQdEVWJLLUDHz84wk/vN5OwIqp81INBAXVHRFUiS/HAxw+O8NP7FQ0rospHPRgUUHdEVCWyVA98/
OAIP71fkbAiqnwefvjh2DdBHqKqxxBVxZbygY8fHOGn9/PCiqiCbnD//ffHvglBiKpElvqBjx8c4af3C4XVm7+
w2ZZd8xc9i6rlt2yx5bds6cnn7hZLVtZtzb2PmJnZ5u0NW7Kybus37mj65+zXQ6xat82WrNR+xCZViKpExo
GPHxzhZzbWGlaf+/yA/Zul59lxJ5xkJ535XDv+hBPtpa94lf3kJz+Z0VmfhUTrsijpdVS1+/NXrds2o8+RalTl/9
1kX2frZvr58h+bd7Zi7daobiSjqq+vz2q1mtVqNRscHAz+XqKq2Djw8YMj/MzWsrB64YtebHMWnm3zf2d
g6g5w8e//Vzv9pR+x448/wb72ta8Vvl9YtW5bT6Np/cYdbe+Mswho/chY7MMAACAASURBVLM3b2/Yir
VbZ/RnhKKqqqy59xFbtnrT1D938lyU7/3vHU0xm32+fFgtv2XLjP/ddAvJqMpCamhoyGq18E0kqoqNAx8
/OMLPbO5La2+30+YvscW/9522j0wsuPLP7fQzFtovf/nLQvcLsaJq2epNM35EqhMpRtWy1Zuagmf9xh1
NkTVT2r1QffktW9qGVgwkoyoPUdWdceDjB0f4mc2df9GlNveSP2gbVNlOe+Zv2qo/+mSh+wIvqlrjJwuY
Zas3NcVL9s/5p52yp4zy27y9Me1RFo9OT0223iaz6VGVhcDm7Y2p39/6NFf2ayvWbp3mIvv4Tk+p5T9/p
6fOuk32Z+WZqdNWNm2a/rHtwrc15mYL6agaHBy0vr6+4O8hqoqNAx8/OMLPbO6kk0+1xb/3t8GoWn
DlrXbZy68odH9wNFHVLlLyTwt5j26sWLu10NNIWTx4T0vNJKpaw2nNvY8Ef6014rLXXWUfk4+u1o/LO2
ol+z2d5n1s67+zdq9Nmwm7d+9u+/laKfrvrttIRtXAwIDVajU3qMyORNXVa+p2zwbGGGOxd8dd/8VOmb
sgeGe8ZGXdFr71DnvaM59l9Xq94/7u7/7OzNrfGecf8ciianx83MysKXKeeOKJqd+Tj5zR0VF76KGHbO/ev
U1RtW/fPjNrflrpgQcemHbbfvSjH5lZc+Ts2rXLGo3G1G3OR0UWVQcPHmyKqtHR0WlR1fqU1ujoqA0PD
0/78/Jfu5nZ8PCw7dmzZ9rnyD7/+o07bN++fbZ///4mJ7t375729f30pz9174PNJt/moPVjs68/C5sf/ehHU
17zZI8Sbt7esEcffTR4LdTrdTtw4EBT6OXDaefOnVav1210dLTJ/YMPPuh+3m5NMqoystdUZRdSO3ikqtju
2cB/ReMHR/iZvZ35tGfYond+PRhV8155vV319ncVuj842qf/Wj9Hp0dH2j1SVfQFz52easru/NvdJu+Rqnw
4tD4alI+q7PO0e8Qo//vaPb2Y3fZuvWas3Z9f5HPP5DZs29b8+zJPrR9/rE8zHi3SUWU2+Z2AQ0NDHX+dq
Co2Dnz84Ag/s7k3v+1dNueid4UfqXrOJXbbbbcVui/oRlRlZI+OeN+VtmrdtkJ3zL2IqvxtaA3B2YyqY3n6r2h
UtT4qF6LdC9XbBRRRdZh8QA0PD/NIVZfGgY8fHOFntvb3D//CvvyV2+20uWfYGa/+dNs74zm/dom97PLf
KXzf0M2oavd72kVV0feO6vT6nU5P/+U/txdV7b6+dk//tbuN7Z7+m81HqvJP/4WYyQvm2z2F2C6gev3d
op2QjKrsPapqtVrwUSozoqroOPDxgyP89Hr/vHOXfeuv/9Zu/vyf2g033mTvfu/v2eKn/5otXPY6m/eK1Tb
vFR+301/8QVv0nIvtt1/3Jtuxo/jbCXQjqvIf3+nNN1u/Y6/T00v596kKvVA9//lmElWtX2v+Y2fyQvXW2zOb
UdXuhert/nkm72O1at22pq+hnXszXqh+1BBVxcaBjx8c4aeX27L1YVvzxS81vZv6DTfeZJt+vNU+P/Bnds4L
32BznnGBXdL3nhm96WdGN6Kq9e0UWn89/9YKrfHR7tG2fMS0e6fwdp9jJlGV/1z5r63dWyq0Pk3X+sh
NjKhq95YKrW9f0e67A0Mx1O7pyHaPcvGWCkcJUVVsqR/4+MERfnqzv3/4F3bn19ZPi6kbbrzJ7vza+qnfx
w9UTpOZxs3yW7Yccwx5T6X2EqIqkaV64OMHR/jpzVqf6mvdzZ//U/v7h38x9fuJKp9/+qd/in0Tus7RvIFq
iHZv/tkKP6bmGCCqii21Ax8/OMJP79bpqb787t3w3aaPIap82n1nWxXo5g+79hzxA5WPEaKq2FI68PGDI
/z0bpt+vDUYUzfceJOt+eKX7J937mr6OKLKp6pR1U3UHRFViSyVAx8/OMJP73fvhu8Go2rTj7dO+xiiykc9
GBRQd0RUJbKUDnz84Ag/vd+Xv3K7fehDH7brP/mpji9Oz4+o8lEPBgXUHRFViSy1Ax8/OMJP75Y9UnXd
qo/bx1f/UccXp+dHVPmoB4MC6o6IqkSW0oGPHxzhp3fLP/V369rb7Jvfvq/ji9PzI6p81INBAXVHRFUiS+X
Axw+O8NO7tQbVw794dOr/b/fi9PyIKh/1YFBA3RFRlchSOPDxgyP89G6dgipbp6f9shFVPurBoIC6I6IqkV
X9wMcPjmKvyn68oCoyospHPRgUUHdEVCWyKh/4+MGRwqrqpxtBNdIgqoqgHgwKqDsiqhJZVQ98/OBI
ZVX0062gGmkQVUVQDwYF1B0RVYmsigc+fnCktKr56WZQjTSIqiKoB4MC6o6IqkRWtQMfPzhSW5X8dD
uoRhpEVRHUg0EBdUdEVSKr0oGPHxwprip+ehFUIw2iqgjqwaCAuiOiKpFV5cDHD45UVwU/vQqqkQZRV
QT1YFBA3RFRlciqcODjB0fKK7ufXgbVSIOoKoJ6MCig7oioSmRlP/DxE384qq6fXgfVSIOoKoJ6MCig7oioS
mRlPvDxozEcVdPPbATVSIOoKoJ6MCig7oioSmRlPfDxozMcVc/PbAXVSIOoKoJ6MCig7oioSmRlPPDxozU
cVcvPbAbVSIOoKoJ6MCig7oioSmRlO/DxozccVcfPbAfVSIOoKoJ6MCig7oioSmRlOvDxozkcVcNPjKAaaR
BVRVAPBgXUHRFViawsBz5+dIej8vuJFVQjDaKqCOrBoIC6I6IqkZXhwMeP9nBUbj8xg2qkQVQVQT0YFFB
3RFQlMvUDP/bwg6Mq+4kdVCMNoqoI6sGggLojoiqRKR/4CsMPjqrqRyGoRhpEVRHUg0EBdUdEVSJTPf
BVhh8cVdGPSlCNNIiqIqgHgwLqjoiqRKZ44CsNPziqmh+loBppEFVFUA8GBdQdEVWJTO3AVxt+cFQlP2p
BNdIgqoqgHgwKqDsiqhKZ0oGvOPzgqCp+FINqpEFUFUE9GBRQd0RUJTKVA191+MFRFfyoBtVIg6gqgno
wKKDuiKhKZAoHvvLwg6Oy+1EOqpEGUVUE9WBQQN0RUZXIYh/46sMPjsrsRz2oRhpEVRHUg0EBdUdE
VSLjDhE/OKqmnzIE1UiDqCqCejAooO6IqEpk3CHiB0fV81OWoBppEFVFUA8GBdQdEVWJjDtE/OCoWn7
KFFQjDaKqCOrBoIC6I6IqkXGHiB8cVcdP2YJqpEFUFUE9GBRQd0RUJTLuEPGDo2r4KWNQjTSIqiKoB4MC
6o6IqkTGHSJ+cFR+P2UNqpEGUVUE9WBQQN0RUZXIuEPED47K7afMQTXSIKqKoB4MCqg7IqoSGXeI+
MFRef2UPahGGkRVEdSDQQF1R0RVIuMOET84KqefKgTVSIOoKoJ6MCig7oioSmTcIeIHR+XzU5WgGmk
QVUVQDwYF1B0RVYmMO0T84KhcfqoUVCMNoqoI6sGggLojoiqRcYeIHxyVx0/VgmqkQVQVQT0YFFB3
RFQlMu4Q8YOjcvipYlCNNIiqIqgHgwLqjoiqRMYdIn5wpO+nqkE10iCqiqAeDAqoOyKqEhl3iPjBkbafKgfV
SIOoKoJ6MCig7oioSmTcIeIHR7p+qh5UIw2iqgjqwaCAuiOiKpFxh4gfHGn6SSGoRhpEVRHUg0EBdUdEVS
LjDhE/ONLzk0pQjTSIqiKoB4MC6o6IqkTGHSJ+cKTlJ6WgGmkQVUVQDwYF1B0RVYmMO0T84EjHT2pB
NdIgqoqgHgwKqDsiqhIZd4j4wZGGnxSDaqRBVBVBPRgUUHdEVCUy7hDxg6P4flINqpEGUVUE9WBQQN
0RUZXIuEPED47i+kk5qEYaRFUR1INBAXVHRFUi4w4RPziK5yf1oBppEFVFUA8GBdQdEVWJjDtE/OAojh+
CanJElY96MCig7oioSmTcIeIHR7Pvh6A6MqLKRz0YFFB3RFQlMu4Q8YOj2fVDUDWPqPJRDwYF1B1JRlVf
X5/VajWr1Wo2MDAQ/L1EVbFxh4gfHM2eH4Jq+ogqH/VgUEDdkVxUDQ8P2+Dg4NQ/12o1Gx4e7vj7ia
pi4w4RPziaHT8EVfsRVT7qwaCAuiO5qGqlr6/PhoaGOv46UVVs3CHiB0e990NQdR5R5aMeDAqoO5KPK
h6p6s64Q8QPjnq7W7/yVYIqMKLKRz0YFFB3JB1V/f39hV9TdfWaut2zgTHGZn+3fuWrdt2q1XbdqtV2w0
2fs8Fvfyf6bVLbFTfW7dLr63btl+tWrzNWzclGVV9fnxtUZjxSVXT3bOBRBvzgqBfLnvK7btVqHqEKjEeqfOp
17UdhFFB3JBlV3uuo8hBVxcYdIn5w1P3lX0N1w02fI6gCI6p81INBAXVHclE1ODho/f39hX8/UVVs3CHiB0
fdXeuL0ge//Z3ot0l5RJWPejAooO5ILqoGBgam3qMqWyiyiKpi4w4RPzjq3tp9lx9+wiOqfNSDQQF1R3JR
NVOIqmLjwMcPjrqzTm+bgJ/wiCof9WBQQN0RUZXIOPDxg6NjX+h9qPATHlHlox4MCqg7IqoSGQc+fnB0
bPPe2DN1P96IKh/1YFBA3RFRlcg48PGDo6NfkXdKT9lPkRFVPurBoIC6I6IqkXHg4wdHR7eiP3omVT9FR1
T5qAeDAuqOiKpExoGPHxzNfDP5WX4p+pnJiCof9WBQQN0RUZXIOPDxg6OZbaY/HDk1PzMdUeWjHgw
KqDsiqhIZBz5+cFR8Mw2q1PwczYgqH/VgUEDdEVGVyDjw8YOjYjuaoErJz9GOqPJRDwYF1B0RVYmMAx
8/OPJ3tEGVip9jGVHlox4MCqg7IqoSGQc+fnAU3rEEVQp+jnVElY96MCig7oioSmQc+PjBUecda1BV3U83
RlT5qAeDAuqOiKpExoGPHxy1XzeCqsp+ujWiykc9GBRQd0RUJTIOfPzgaPq6FVRV9dPNEVU+6sGggLojoi
qRceDjB0fN62ZQVdFPt0dU+agHgwLqjoiqRMaBjx8cHVm3g6pqfnoxospHPRgUUHdEVCUyDnz84Ghyv
QiqKvnp1YgqH/VgUEDdEVGVyDjw8YOj3gVVVfz0ckSVj3owKKDuiKhKZBz4+EndUS+Dqgp+ej2iykc9GBR
Qd0RUJTIOfPyk7KjXQVV2P7MxospHPRgUUHdEVCUyDnz8pOpoNoKqzH5ma0SVj3owKKDuiKhKZBz4+
EnR0WwFVVn9zOaIKh/1YFBA3RFRlcg48PGTmqPZDKoy+pntEVU+6sGggLojoiqRceDjJyVHsx1UZfMTY0
SVj3owKKDuiKhKZBz4+EnFUYygKpOfWCOqfNSDQQF1R0RVIuPAx08KjmIFVVn8xBxR5aMeDAqoOyKqE
hkHPn6q7ihmUJXBT+wRVT7qwaCAuiOiKpFx4OOnyo5iB5W6H4URVT7qwaCAuiOiKpFx4OOnqo4Ugkr
Zj8qIKh/1YFBA3RFRlcg48PFTRUcqQaXqR2lElY96MCig7oioSmQc+PipmiOloFL0ozaiykc9GBRQd0RUJTI
OfPxUyZFaUKn5URxR5aMeDAqoOyKqEhkHPn6q4kgxqJT8qI6o8lEPBgXUHRFViYwDHz9VcKQaVCp+lEd
U+agHgwLqjoiqRMaBj5+yO1IOKgU/6iOqfNSDQQF1R0RVIuPAx0+ZHakHVWw/ZRhR5aMeDAqoOyKqE
hkHPn7K6qgMQRXTT1lGVPmoB4MC6o6IqkTGgY+fMjoqS1DF8lOmEVU+6sGggLojoiqRceDjp2yOyhRU
MfyUbUSVj3owKKDuiKhKZBz4+CmTo7IF1Wz7KeOIKh/1YFBA3RFRlcg48PFTFkdlDKrZ9FPWEVU+6sGgg
LojoiqRceDjpwyOyhpUs+WnzCOqfNSDQQF1R0RVIuPAx4+6ozIH1Wz4KfuIKh/1YFBA3RFRlcg48PGj7Kjs
QdVrP1UYUeWjHgwKqDsiqhIZBz5+VB1VIah66acqI6p81INBAXVHRFUi48DHj6KjqgRVr/xUaUSVj3owKK
DuiKhKZBz4+FFzVKWg6oWfqo2o8lEPBgXUHRFViYwDHz9KjqoWVN32U8URVT7qwaCAuiOiKpFx4ONH
xVEVg6qbfqo6ospHPRgUUHdEVCUyDnz8KDiqalB1y0+VR1T5qAeDAuqOiKpExoGPn9iOqhxU3fBT9RFV
PurBoIC6I6IqkXHg4yemo6oH1bH6SWFElY96MCig7oioSmQc+PiJ5SiFoDoWP6mMqPJRDwYF1B0RVYm
MAx8/MRylElRH6yelEVU+6sGggLojoiqRceDjZ7YdpRRUR+MntRFVPurBoIC6I6IqkXHg42c2HaUWVDP1k
+KIKh/1YFBA3RFRlcg48PEzW45SDKqZ+El1RJWPejAooO6IqEpkHPj4mQ1HqQZVUT8pj6jyUQ8GBdQdE
VWJjAMfP712lHJQFfGT+ogqH/VgUEDdEVGVyDjw8dNLR6kHleeHEVVFUA8GBdQdEVWJjAMfP71yRFC
F/bDJEVU+6sGggLojoiqRceDjpxeOCKqwH3ZkRJWPejAooO6IqEpkHPj46bYjgirshzWPqPJRDwYF1B0RVY
mMAx8/R7NvfPtv7GWXv9YWLTnbTjjxZDv/oktt9Sc/Q1C1GddQeESVj3owKKDuSDaqBgcHrVbzbx5RV
Wwc+PiZ6f7gDz9qpy98mp32grfbot8dtMXXfMcWXHmrLTj3lfb0c55tH/7IRwmq3LiGwiOqfNSDQQF1R
5JRtXTpUuvv7yequjgOfPzMZLf95ddswTPOtcXvvc+WrKxP29wXvs/Of8HFBFVuXEPhEVU+6sGggLojyajK
IKq6Nw58/MxkC848y+a/7s/aBtVUWJ1zkd151zej31aVcQ2FR1T5qAeDAuqOiKpExoGPn6J74Kfbbc6Cs4
JBtWRl3eZe+gH74HWfjH57VcY1FB5R5aMeDAqoO6pMVF29pm73bGCMHes+c/OAnTx3oRtVZ/z25+zC
F708+u1l5dgVN9bt0uvrdu2X61avM1bNVSaqeKQqvHs28F/R+Cm2//ehYZszf7EbVXMufrd9+ON/HP32
qoxrKDweqfKp17UfhVFA3RFRlcg48PEzk5119jk2v+8Lwaiaf84F9rXBu6PfVpVxDYVHVPmoB4MC6o6Iqk
TGgY+fmezO//Sfbd6SZ9mZV3+zbVAteNF77IrXvzX67VQa11B4RJWPejAooO6IqEpkHPj4melWf/Izdspp
8+zUc19rC9/yl3bm1d+y+a/5vC183kvsRS+73LZu/0X026g0rqHwiCof9WBQQN2RdFQVgagqNg58/BzN7
vtvdXvz295lZz/rXDtt3kK77BXL7ZM3/rvot0txXEPhEVU+6sGggLojoiqRceDjB0f4iTmiykc9GBRQd0RUJTI
OfPzgCD8xR1T5qAeDAuqOiKpExoGPHxzhJ+aIKh/1YFBA3RFRlcg48PGDI/zEHFHlox4MCqg7IqoSGQd+O
f3sbIzaU/vHbXRswsYmDtnYxCE7OH6o9I527RuzA2MT9uTeMXtiz5jtOTBuB8cP2dj4Idt/cMKe2HPwqD7
vU/vGbXzikI2OHbKduyb/v937x6f+rLL4qeKIKh/1YFBA3RFRlcg48Mvn57HdB23i0KGO1/4Te8Zs174x23t
gvCt/XmPvmO0bnbCdPXY0Onbkawp8ebZ7Bl/Xk3vHbHRsounjDxycsEd3HWz6/3711NHFWlmvIaURVT
7qwaCAuiOiKpFx4JfPTxYcq9Ztm/bmm5u3N2xs/EiRHBw/ZI8dQzD86qmDU3/e2MQhe2LP9Ed1uuFo17
4xMzNbfssWW37LFjMz27y9Me3ry3h8t/817RttjqklK+u2fuMOOzA2YXsOjNuKtVunPue+0YmkriGlEVU
+6sGggLojoiqRceCXy88TeybjY8XarbZs9aama37Vum22fuMOO3TIbP3GHVPBMDp2JBgaeycfwTpwcMJ
27RubeipspDFqO3eN2p7947Zz1+Gn4Q5O2MHxQ1Nxs3l7o+1TjN1wND5xyNbc+8jU1zQ2fshWrdtmm
7c3pr6+fAQ9tT/8aNVjuycfiWoNsyyq8hG3Yu1WM7O2wVjFa0htRJWPejAooO6IqEpkHPjl8tPYOxkDWS
AcMrPGvsOvPRqbfN2RWXNUmZkdGJuw8Yn2z6ntH52wnbtG7eBY+1/PR5VZc6TlHe08fPs6rdPXtHv/uJ
mZLVu9ydbc+4iZTT4d96unDtru/eO2a9+YTRxqjjvvqc0sqrJoyj42i6qRxuTX2yk+q3wNqY2o8lEPBgXUHR
FViYwDv1x+GvuORFUWIGZmu/ePT4VE9ohO69OCZpORkf//s88xOjYxFRjZ/y5ZWW/7FOP6jTuani67Z0
PddjZGp712qZW9o+1DaP/BianoyW7LSGPyxeVjE4emnn7Mbtfm7Y1Cjyo9tW8y1vJBlo+qpw67zGJu4p
AlcQ2pjajyUQ8GBdQdEVWJjAO/XH6y1zitufcRW7KyPvX6IzOz8YlDU68jan2kanxiMiyyp7ryv2fz9oaNTR
x51Kb1acXWR6oOjh+yR3cdeU3TPRvqNjo2MXWbOm3z9obtbvO03dj45FN/2dfS2DtmTx5+mjPPstWb
bMXarXboUPHvctzZGLW9o+Nto+rRXaNmNhmhmZf811XVa0htRJWPejAooO6IqEpkHPjl85O9HsjMpoIl
H1cTh5qf1speB7XnwLi1PgOYPUqTfx1W9rqsvQcmHynKR9XYxKFp4XHPhvrUa708HmvzAvNDNvl6sCxs
Hnvq4NTTnPlH1tZv3DH1eWby+qdOUTXSGLWJicnXbmX+evG6KsVrSGlElY96MCig7oioSmQc+OX088Se
MTuY+y6//HfHHbLmR6p27x+3PQcmnwpr9x11a+59pOljNm9vTD0FdyD31Nzm7Y223yWXOcpez9WJf
Qenf+yvnjrylOWqddvM7MhTcK1PJ2aBNXn7ij9aFYqq7BG27NG5p/Z1520oynANqYyo8lEPBgXUHRFViY
wDv5x+srdJ2LVvbOoF6PnvZGuNqvGJQ1Ovtcp/R93UI1XWHFVZPBWNqj0Hxgs9/df6gvWduafgsqjKPxL
2xJ7JpwKz97BafssWW7Vumx06/PqnIo8shaIqe+oxi6rQC+qrdg2pjKjyUQ8GBdQdEVWJjAO/XH4e331w
KqIOHZp8am//4ddR5V8b1Pr0n1nzd9dlL/7u9EhVp6gaHWv/9F/2SJhHu2gZP/wUXP6tDfYe/nz7D05Mv
Ru62ZGoGp848p2O+9s8ApZfKKrMrOnpv3ZPT1btGlIbUeWjHgwKqDsiqhIZB365/Ow9MBkI+ddQmR15
Wi8LpHxEZGQv9M7IHrkKRVX2dget3224a9+ROMoceWHVKX6yp+Cyr+nAwSORmCf7TsTN2xtTL7wv8h
YLnaLqsdxTj9mflcI1pDaiykc9GBRQd0RUJTIO/HL5yaKq3dNrWUDloyT/1Fvrx2VPe4WiKnubhvxbK7R7S
4VufU1m1vSoVKd3VJ84/B2Q+e8Y7Pj5O0TV3tHm98ca69HPTlS7htRGVPmoB4MC6o6IqkTGgV8uP4/lf
mxMO7LYyb+IPSP0cU/tG5t688/WN8Fs9/5TjTaPVB3tHj8cbvmnJ9vdfrPJ4MoePcu/DqvTzyXMdiD3IvrH
dx+c+jPzIem9S3tVriG1EVU+6sGggLojoiqRceCXz0/2zuV7R8dt/8EJ2zc6+bPsWn/G3+O7D9rew7/25OFH
cp7cO2b7D07Y7v3j9vieg/bU/vGp947KfkxNuz/zsd0Hbe+Bcdt7YHzao0LdcLR3dLzpBeMThw7Z47snb9+
BgxO298D41FOOu3Jv2rl5e8N9TVW2PfuP3Pb8C99XrN3a9sfvVPkaUhpR5aMeDAqoOyKqEhkHPn4UH
D26a9QmDh35gcqhUHps90HLP451NN+xd2BsoulnCT7Zo5/7xzXkj6jyUQ8GBdQdEVWJjAMfPyqOnto3
PvUUpfd+UU8e/sHQTx7lWyBkT/+Z+T+cWcVPVUdU+agHgwLqjoiqRMaBjx81Rzt3zc7t3rlrdv4srqHwiC
of9WBQQN0RUZXIOPDxgyP8xBxR5aMeDAqoOyKqEhkHPn5whJ+YI6p81INBAXVHRFUi48DHD47wE3N
ElY96MCig7oioSmQc+PjBEX5ijqjyUQ8GBdQdEVWJjAMfPzjCT8wRVT7qwaCAuiOiKpFx4OMHR/iJOaLK
Rz0YFFB3RFQlMg58/OAIPzFHVPmoB4MC6o6IqkTGgY8fHOEn5ogqH/VgUEDdEVGVyDjw8YMj/MQcUe
WjHgwKqDsiqhIZBz5+cISfmCOqfNSDQQF1R0RVIuPAxw+O8BNzRJWPejAooO6IqEpkHPj4wRF+Yo6o8l
EPBgXUHRFViYwDHz84wk/MEVU+6sGggLojoiqRceDjB0f4iTmiykc9GBRQd0RUJTIOfPzgCD8xR1T5qAe
DAuqOiKpExoGPHxzhJ+aIKh/1YFBA3RFRlcg48PGDI/zEHFHlox4MCqg7IqoSGQc+fnCEn5gjqnzUg0EBdU
dEVSLjwMcPjvATc0SVj3owKKDuiKhKZBz4+MERfmKOqPJRDwYF1B0RVYmMAx8/OMJPzBFVPurBoIC6I
6IqkXHg4wdH+Ik5ospHPRgUUHdEVCUyDnz84Ag/MUdU+agHgwLqjoiqRMaBjx8c4SfmiCof9WBQQN0
RUZXIOPDxgyP8xBxR5aMeDAqoOyKqEhkHPn5whJ+YI6p81INBAXVHRFUi48DHD47wE3NElY96MCig7o
ioSmQc+PjBEX5ijqjyUQ8GBdQdEVWJjAMfPzjCT8wRVT7qwaCAuiOiKpFx4OMHR/iJOaLKRz0YFFB3RFQl
Mg58/OAIPzFHVPmoB4MC6o6IqkTGgY8fHOEn5ogqH/VgUEDdEVGVyDjw8YMj/MQcUeWjHgwKqDsiq
hIZBz5+cISfmCOqfNSDQQF1ruuTTwAABopJREFUR0RVIuPAxw+O8BNzRJWPejAooO6IqEpkHPj4wRF+Y
o6o8lEPBgXUHRFViYwDHz84wk/MEVU+6sGggLojoiqRceDjB0f4iTmiykc9GBRQd0RUJTIOfPzgCD8xR1T
5qAeDAuqOSh1Vjz/+uL1+1R0256J32e/esN5+/ssnoh8cquPAxw+O8BNrDw3/f/aKD/xHe9byj9i1A//F9u
/fH/vuQxL1YFBA3VFpo+rTN/6J1Wo1m3POxXbioqU295nL7MSTTrYvfPHPox8giuPAxw+O8BNj/R/9hJ0
6Z57N+bUX2pznv9FOf8bzbc7pZ9idd94Z+25EDvVgUEDdUSmj6o1Xvd2WnP9qW/S737AlK+tTW3jVV23
+sy62/g99LPpBojYOfPzgCD+zvVdc3mdLlvXZme/+dtNZveCNa+2MZ15gn/3sZ2PfnUihHgwKqDsqXVTdc
ccdtvjZFzb9Bc1v8Xv/xk6bf5Z94+6/iX6gKI0DHz84ws9s7uY//fe2+HmXdjyrz7z6m3byaafbD37wg9h3Kz
KoB4MC6o5KF1WXXPZyO/0lH+74F3XJyrrNe9X1dvmV77QfPtxgh3f7t+rRb4Py8IMj/HR3z3zu8+2Myz8
TPKtPf8mH7AP9H4p9tyKDejAooO6odFF1ymlzbfF77wv+RV30zq/bqYufa6/6kwfY4V3yR/Xot0F5+MERf
rq3V3zmB3bcccfbkvd/L3hWL3zLX9iFv/Xi2HcrMqgHgwLqjkoXVSeceJItvmZD+C/q2/7KTph3ti286quM
McZmeQuu/HM77oSTg+f05Gur/oMdd8o8q9VqjFVjsSNpppx34SW24A1fDj/9928/ZS9/zVW28f88yRhjL
MKe9mvPs4VvuSP89N9LP2Lvvub9se9WALpG6aLqi1/8oi163kuCf1HPePrzbHBwMPZNBQBIluv/+DO24
LzLO39T0TUbbO6iZ9h9990X+6YCdI3SRZWZ2asu/22bf+FVtvh9/6P5u0lW3G2nn3uFXfXO98S+iQAAyfO
Ciy+1017wjumve/3dr9vi815lf/jBD8e+iQBdpZRRdeDAAXv///WHtuBpz7J55/XZyf/mpbbwvCvstNMX2O
rr/zj2zQMAADNrNBr27vdeYyecdIrNO/+1NvdF77clz7/cTjz5VPvMTTfHvnkAXaeUUZXx4IMP2h133GEf/
/jH7a677rKf/exnsW8SAAC08OMf/9i++tWv2kc+9nEbHBy0bdu2xb5JAD2h1FEFAAAAoIJkVA0ODk59e+
LAwEDsm1MJMqcwnb6+Pq43h7wjvgmkMwMDA9bX1xf7ZkjS39/f9K3nw8PDsW+SHHlHQ0NDsW+OF
AMDA23fwkANvVtk1vQXjovr2Fm6dOnUX1ZoZnh4uCkSOOzbkzkaGhriOgpQq9WIqg709/dzlgfo7+/nP
+pmwMDAgKQvudNxcHDQ+vv7p/5ZVVwZ4c7Qp6+vj4PfgeuoPdlZRVS1h79bYZYuXRr7JpQK1XNI7la1R
lRrZMHRo3oRKsEjVWEGBweJhjYMDw9PRQN+2sPT7J0ZGhqy/v5+W7p0KY92FmBwcFD2GpK7l+3v729
6Ooao6h5EVRgefu9M9noGDvv2LF261IaHh4mqAgwPD/Oyjhay17xm/0HX19fHWRQg+/umiNy9LI9U9
Q6iqjMcYsXIXlOleqDFYGBgoOk1Z0SVT+t/PKdO6/0cjwh3Rv3vmNy9bLvXVPGXrzsQVe3htR4zA1/NtPu
OJF4fE4aoaqY1FHgwoTPqTSB3L5s9NJzBfxV3D6JqOhxePvmAyv5+8neyPer/Fa0A11B78k+J9vX1SYdDTJ
Sf+jMTjCqz5vep4sLqHkTVdNq99wmR1Uz2lB/vn+NDVHWGayhM/u8ZZ1Bn1O/HtG8dAAAAQEkgqgAA
AAC6AFEFAAAA0AWIKgAAAIAuQFQBAAAAdAGiCgAAAKALEFUAAAAAXYCoAgAAAOgCRBUAAABAFyC
qAAAAALoAUQUAAADQBYgqAAAAgC5AVAEAAAB0AaIKAAAAoAsQVQAAAABdgKgCAAAA6AJEFQAAA
EAXIKoAAAAAugBRBQAAANAFiCoAAACALkBUAQAAAHQBogoAAACgCxBVAAAAAF2AqAIAAADoAkQV
AAAAQBcgqgAAAAC6AFEFAAAA0AWIKgAAAIAuQFQBAAAAdAGiCgAAAKALEFUAAAAAXYCoAgAAAOg
CRBUAAABAFyCqAAAAALrA/w9jx0zog0cEPQAAAABJRU5ErkJggg=="></figure>
answer
#include <iostream>
int main() {
int n,k,x,y;
try{
cin>>n>>k>>x>>y;
if(cin){
k%=4;
else{
if(k==1){
else if(k==0){
else if(k==2){
else{
else throw 0;
catch(int n){
return 0;
}
question
answer
#include <iostream>
int main()
int number1,number2;
try{
cin>>number1>>number2;
if(cin){
if(number2>number1)
cout<<"<";
else if(number1==number2)
cout<<"=";
else
cout<<">";
else throw 0;
catch(int a){
return 0;
question
answer
#include <iostream>
int main()
int a,b,k;
try{
cin>>a>>b>>k;
if(cin){
if(k<=a)
cout<<a-k<<" "<<b;
else if(k>=a+b)
cout<<"0 0";
else
cout<<a-a<<" "<<a+b-k;
else
throw 0;
}
catch(int a)
//cin>>a>>b>>k;
//cout<<a-a<<" "<<a+b-k;
return 0;
question
<p>Problem Description:</p><p>Tina and Fazil are bored, so they are playing an infinite game of
ping pong. The rules of the game are as follows:</p><ul><li>The players play an infinite number of
games. At the end of each game, the player who won it scores a point.</li><li>In each game, one of
the players <i>serves</i>. Tina serves in the first game.</li><li>After every K points are scored
(regardless of which players scored them), i.e. whenever K games have been played since the last
time the serving player changed, the player that serves in the subsequent games changes: if Tina
served in the game that just finished, then Fazil will serve in the next game and all subsequent
games until the serving player changes again; if Fazil served, then Tina will serve.</li></ul><p>The
players got a little too caught up in the game and they forgot who is supposed to serve in the next
game. </p><p>Will you help them determine that? So far, Tina has scored X points and Fazil
has scored Y points.</p><p>Constraints:</p><p>0≤X,Y≤10 powert 9</p><p>1≤K≤10 power
9</p><p>Input Format:</p><p>The only line of each test case contains three space-separated
integers X, Y and K.</p><p>Output Format:</p><p>In the only line of output print the string "Tina" if
Tina is supposed to serve next or "Fazil" otherwise (without quotes).</p>
answer
#include <iostream>
int main()
int x,y,k;
try{
cin>>x>>y>>k;
if(cin){
if(((x+y)/k)%2==0)
cout<<"Tina";
else
cout<<"Fazil";
else
throw 0;
catch(int a){
cout<<"Missing Input";
return 0;
question
<p>Problem description</p><p>Pari is an Architect who is currently doing his design work for his
new project in one of the congested location of Paris.For making his work simpler he is looking for
the automated tool which check whether the area is greater or perimeter is greater or both are
equal if the Length (L) and Breadth (B) of a rectangle is provided.</p><p>Since he is not from the
computing background he is looking for the freelancer who can do this for him?</p><p>Can you
help him with the logic for doing
so? </p><p>Constraints:</p><p>1≤L≤1000</p><p>1≤B≤1000</p><p>Input
Format:</p><p>First line will contain the length (L) of the rectangle.</p><p>Second line will contain
the breadth (B) of the rectangle.</p><p>Output Format:</p><p>Output 2 lines.</p><p>In the first
line print "Area" if area is greater otherwise print "Peri" and if they are equal print "Eq".(Without
quotes).</p><p>In the second line print the calculated area or perimeter (whichever is greater or
anyone if it is equal).</p>
answer
#include <iostream>
int main()
int l,b;
try{
cin>>l;
cin>>b;
if(cin){
if((l*b)>(2*(l+b)))
cout<<"Area\n"<<l*b;
else if((l*b)==(2*(l+b)))
cout<<"Eq\n"<<l*b;
else
cout<<"Peri\n"<<2*(l+b);
else
throw 0;
catch(int parameters){
return 0;
question
<p>Problem Description:<br>Simon loves to listen to music while walking his way to attend boring
lectures in his college.<br><br>He has a playlist of songs which has all songs of equal length, L. (in
seconds)<br><br>One day while going on his way, he decided to calculate his average walking speed
and he comes to know that he walks at a speed of 0.5 m/s.<br><br>You will be given the distance D
,he has to walk down to reach his class, after which he stops the music.<br><br>You have to find the
minimum number of songs he needs to add into his playlist so as music plays in the whole
path.<br><br>Constraints:<br>1<= L <=120 (in seconds)<br>1<= D <=5000 (in
meters)<br> </p><p>Input Format:<br>Only line of input contain two integer L and D
separated by a space representing length of song and distance he has to walk
respectively.<br><br>Output Format:<br>In the only line of output print the Integer value equal to
number of songs he need to add into playlist before start to walk.</p>
answer
#include <iostream>
int main()
int L,D;
try{
cin>>L>>D;
if(cin){
if((2*D)%L==0)
cout<<(2*D)/L;
else
cout<<(2*D)/L+1;
else
throw 0;
catch(int a){
return 0;
question
<p>Problem Description:<br>Vishal is fighting with a monster.The health of the monster is H.In one
attack, Vishal can decrease the monster's health by 'A'. </p><p>There is no other way to
decrease the monster's health.Vishal wins when the monster's health becomes '0' or below.<br>Can
you find the number of attacks needed for Vishal for winning ?<br>Constraints:<br>1 <= H <=
10^4<br>1 <= A <= 10^4<br>All values in input are integers.<br><br>Input Format:<br>Only
line of input has two space separated integers H A<br><br>Output Format:<br>Print the number of
attacks Vishal needs to make before winning.</p>
answer
#include <iostream>
int main()
int h,a;
try{
cin>>h>>a;
if(cin){
if(h%a==0)
cout<<h/a;
else if(h%a!=0)
cout<<h/a+1;
else
throw 0;
catch(int a){
return 0;
question
<p>Problem Description:</p><p>For her next karate demonstration, Prasad will break some
bricks.</p><p>Prasad stacked three bricks on top of each other. Initially, their widths (from top to
bottom) are W1,W2,W3.</p><p>Prasad's strength is S. Whenever she hits a stack of bricks, consider
the largest k≥0 such that the sum of widths of the topmost k bricks does not exceed S; the topmost k
bricks break and are removed from the stack. Before each hit, Prasad may also decide to reverse the
current stack of bricks, with no cost.</p><p>Find the minimum number of hits Prasad needs in order
to break all bricks if she performs the reversals optimally. </p><p>You are not required to
minimise the number of reversals.</p><p>Constraints:</p><p>1≤S≤8</p><p>1≤Wi≤2 , for each valid
i</p><p>Input Format:</p><p>Only line of input contains four space-separated integers S, W1, W2
and W3.</p><p>Output Format:</p><p>In only line of output print the integer representing the
minimum required number of hits.</p>
answer
#include <iostream>
int main()
int s,w1,w2,w3;
try{
cin>>s>>w1>>w2>>w3;
if(cin){
int res=w1+w2+w3;
if(s>=res)
cout<<"1";
else if(s<res&&res%s==0)
cout<<res/s;
else
cout<<res/s+1;
else
throw 0;
catch(int q){
return 0;
question
<p>Problem Description:</p><p>There are two monkeys on an x-axis ready to jump in the positive
direction (i.e, toward positive infinity). </p><p>The first monkey starts at location x1 and
moves at a rate of v1 meters per jump. </p><p>The second monkey starts at location x2 and
moves at a rate of v2 meters per jump. </p><p>Given the starting locations and movement
rates for each monkey, can you determine if they'll ever land at the same location at the same
time?</p><p>Constraints:</p><p>• 0≤x1<x2≤10000</p><p>• 1≤v1≤10000</p><p>•
1≤v2≤10000</p><p>Input Format</p><p>A single line of four space-separated integers denoting the
respective values of x1, v1, x2 and v2.</p><p>Output Format:</p><p>Print YES if they can land on
the same location at the same time; otherwise, print NO.</p><p>Note: The two monkeys must land
at the same location after making the same number of jumps.</p>
answer
#include <iostream>
int main()
int x1,x2,v1,v2;
try{
cin>>x1>>x2>>v1>>v2;
if(cin){
if((x2-x1+v2-v1)%(v1-v2)>0)
cout<<"YES";
else
cout<<"NO";
else
throw 0;
catch(int a){
cout<<"Input coordinates";
return 0;
}
question
answer
#include<stdio.h>
#include<cstring>
#define dfs3 void dfs(const int &now1,const int &now2){ if ((bool)now1 ^ (bool)now2) flag=0; if
(!flag) return; if (s1l[now1]) dfs(s1l[now1],s2l[now2]); if (s1r[now1]) dfs(s1r[now1],s2r[now2]);}
//int s1l[21],s1r[21],s2l[21],s2r[21],a[51][21],n,m,ans;
bool flag,f[51];
dfs3
if (!flag) return;
if (s1l[now1]) dfs(s1l[now1],s2l[now2]);
if (s1r[now1]) dfs(s1r[now1],s2r[now2]);
}*/
inline1
s1l[0]=0;s1r[0]=0;int now,last;
memset(s1l,0,sizeof(s1l));
memset(s2l,0,sizeof(s2l));
memset(s1r,0,sizeof(s1r));
memset(s2r,0,sizeof(s2r));*/
h(m)
for1
//for (last=0,now=1;now;last=now,now=(a[u][i]<=a[u][now])?s1l[now]:s1r[now]);
if (a[u][i]<=a[u][last]) s1l[last]=i;
else s1r[last]=i;
s2l[0]=0;s2r[0]=0;
for2
//for (last=0,now=1;now;last=now,now=(a[v][i]<=a[v][now])?s2l[now]:s2r[now]);
if (a[v][i]<=a[v][last]) s2l[last]=i;
else s2r[last]=i;
flag=1;
dfs(1,1);
if (flag) f[v]=1,ans--;
int main(){
scanf("%d%d",&n,&m);
printf("%d",ans+n);
return 0;
printf("vector<vector<int>>tree(N,vector<int>(K)); cin>>N>>K");}
Elab sorting
SORT14
QUESTION DESCRIPTION
Mommy is a very active lady. She likes to keep all stuff sorted. She has developed an interesting
technique of sorting stuff over the years. She goes through the items repeatedly from first to last and
whenever she finds two consecutive items unsorted, she puts them in the proper order. She
continues the process until all the items are sorted.
One day Mommy has to attend a wedding ceremony. Suddenly she remembers that she has not
sorted the plates after washing. She has only M minutes left. If she can complete the task within the
remaining time, she will sort her plates and then attend the wedding. However if she cannot, she
decides to skip the task.
She knows that she take S seconds per swap. However she does not know the total number of
swaps required and hence she is in trouble. She wants you to help her out.
#include<stdio.h>
int main()
{
int a[1001];
int n,i,j,t,swap,temp,k,m,ss,r;
scanf("%d", &t);
if(t==1)
{
printf("1");
goto a;
}
while(t--)
{
swap=0;
scanf("%d %d %d", &m,&ss,&n);
for(j=0; j<a[j+1];j++)
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
swap++;
}
}
int x,s,c;
x=(s*c)/60;
r=swap*ss;
if(r<=m*60)
printf("1\n0\n0");
else
printf("0");
printf("\n");
return 0;
a:
{
return 0;
}
}
SORT8
QUESTION DESCRIPTION
Given an array with all elements greater than or equal to zero.Return the maximum product of two
numbers possible.
Input:
The first line of input contains an integer T denoting the number of test cases.
Output:
Constraints:
1 ≤ T ≤ 20
1 ≤ N ≤ 50
0 ≤ A[i] ≤ 1000
#include<stdio.h>
void sort(int a[],int n);
int main()
{
int arr[30], i, x, t;
scanf("%d",&t);
while(t--)
{
scanf("%d",&x);
for(i=0;i<x;i++)
{
scanf("%d",&arr[i]);
}
sort(arr, x);
}
return 0;
}
void sort(int a[],int n)
{
int i, j, p=0;
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(i!=j)
{
if(p<(a[i]*a[j]))
{
p=a[i]*a[j];
}
}
}
}
printf("%d\n",p);
}
SORT4
QUESTION DESCRIPTION
Ramu and Somu both are decided to play a game to Sort the given set of numbers using Insertion
Sort.
So he got The first line of the input contains the number of elements, the second line of the input
contains the numbers to be sorted.
In the output print the status of the array at the 3rd iteration and the final sorted array in the given
format.
Somu will evaluate the result whether its correct or not Mandatory declaration need to be follow as "
void InSort(int arr[], int n)"
#include<stdio.h>
int main()
{
int data[30], i, n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&data[i]);
}
InSort(data, n);
printArray(data, n);
return 0;
}
SORT6
QUESTION DESCRIPTION
MS .Dhoni want to play a game when the players are free in the dressing room.
Dhoni have given an array of n distinct elements, the task is to find all elements in array which have
at-least two greater elements than themselves.
Examples:
Input:
The first line of input contains an integer T denoting the no of test cases.
The first line of input contains an integer n denoting the size of the array.
#include <stdio.h>
int main()
int t,i,n,j,k,arr[30],temp;
scanf("%d",&t);
for(i=0;i<t;i++)
scanf("%d",&n);
for(j=0;j<n;j++)
{scanf("%d",&arr[j]);}
for(j=0;j<n;j++)
for(k=j+1;k<n;k++)
if(arr[j]>arr[k])
temp=arr[j];
arr[j]=arr[k];
arr[k]=temp;
}
for(j=0;j<n-2;j++)
{printf("%d ",arr[j]);}
printf("\n");
return 0;
SORT13
QUESTION DESCRIPTION
You have to merge the two sorted arrays into one sorted array (in non-increasing order)
Input:
First line of each test case contains two space separated integers X and Y, denoting the size of the
two sorted arrays.
Second line of each test case contains X space separated integers, denoting the first sorted array P.
Third line of each test case contains Y space separated integers, denoting the second array Q.
Output:
For each test case, print (X + Y) space separated integer representing the merged array.
#include <stdio.h>
int main() {
int t,i,a,b,arr[20],j,temp,k;
scanf("%d",&t);
for(i=0;i<t;i++)
scanf("%d%d",&a,&b);
for(j=0;j<(a+b);j++)
scanf("%d",&arr[j]);
for(j=0;j<(a+b);j++)
for(k=j+1;k<(a+b);k++)
if(arr[j]<arr[k])
temp=arr[j];
arr[j]=arr[k];
arr[k]=temp;
}
}
for(j=0;j<(a+b);j++)
{printf("%d ",arr[j]);}
printf("\n");
return 0;
SORT9
QUESTION DESCRIPTION
Given an array of integers and two numbers k1 and k2. Find sum of all elements between given two
k1’th and k2’th smallest elements of array. It may be assumed that (1 <= k1 < k2 <= n) and all
elements of array are distinct.
Input:
The first line of input contains an integer T denoting the no of test cases. Then T test cases follow.
Each test case contains an integer N, denoting the length of the array. Next line contains N space
seperated integers of the array. Third line contains two space seperated integers denoting k1'th and
k2'th smallest elements.
Output:
For each test case in a new line output the sum of all the elements between k1'th and k2'th smallest
elements.
Constraints:
1<= T <= 100
1<= k1< K2 <= N <=50
#include <stdio.h>
int main()
{
int t,i,n,j,a[30],p,q,sum=0;
scanf("%d",&t);
for(i=0;i<t;i++)
scanf("%d",&n);
for(j=0;j<n;j++)
scanf("%d",&a[j]);
/*for(j=0;j<n;j++)
printf("%d ",a[j]);
printf("\n");*/
sortarr(n,a);
/* for(j=0;j<n;j++)
printf("%d ",a[j]);
printf("\n");*/
scanf("%d%d",&p,&q);
for(j=(p);j<(q-1);j++)
{
sum=sum+a[j];
printf("%d\n",sum);sum=0;
return 0;
int j,k,t;
for(j=0;j<n;j++)
for(k=j+1;k<(n);k++)
if(a[j]>a[k])
t=a[j];
a[j]=a[k];
a[k]=t;
}
}
SORT3
QUESTION DESCRIPTION
The first line of the input contains the number of elements, the second line of the input contains the
numbers to be sorted.
In the output print the status of the array at the 3rd iteration and the final sorted array in the given
format.
#include <stdio.h>
int main()
{
int t;scanf("%d",&t);
int i;int arr[t];
for(i=0;i<t;i++)
{ scanf("%d",&arr[i]);}
int n = sizeof(arr)/sizeof(arr[0]);
bubbleSort(arr, n);
printf("Sorted array:");
printArray(arr, n);
return 0;
}
SORT1
QUESTION DESCRIPTION
For each query, you are given an integer X, and you're supposed to find out if X is present in the array
A or not.
Input:
The first line contains two integers, N and Q, denoting the size of array A and number of queries.
The second line contains N space separated integers, denoting the array of elements Ai.
For each query, print YES if the X is in the array, otherwise print NO.
#include <stdio.h>
int main() {
int n,q,arr1[20],arr2[20],j,f,i;
scanf("%d %d",&n,&q);
for(i=0;i<n;i++)
scanf("%d",&arr1[i]);
for(j=0;j<q;j++)
scanf("%d",&arr2[j]);
for(j=0;j<q;j++)
for(i=0;i<n;i++)
if(arr2[j]==arr1[i])
{
f=1;
break;
else
f=0;
if(f==1)
printf("YES\n");
else
printf("NO\n");
return 0;
SORT11
QUESTION DESCRIPTION
In a candy store there are N different types of candies available and the prices of all the N different
types of candies are provided to you.
You can buy a single candy from the store and get atmost K other candies ( all are different types )
for free.
Secondly, you have to tell what is the maximum amount of money you have to spend to buy all the N
different candies.
In both the cases you must utilize the offer i.e. you buy one candy and get K other candies for free.
#include <stdio.h>
static void mergeSort(int a[],int l,int r)
{;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{int i,j,k,l=0,n,m,a[1000],s=0,s1=0,min=0,max=0;
scanf("%d %d",&n,&k);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
{for(j=0;j<n-i-1;j++)
{int tm;
if(a[j]>a[j+1])
{tm=a[j];
a[j]=a[j+1];
a[j+1]=tm;}}}
while(s<n)
{min=min+a[l];
l++;
s=s+k+1;}
j=n-1;
while(s1<n)
{max=max+a[j];
j--;
s1=s1+k+1;}
printf("%d ",min);
printf("%d\n",max);}
return 0;
}
SORT7
QUESTION DESCRIPTION
Given two arrays, A and B, of equal size n, the task is to find the minimum value of A[0] * B[0] + A[1] *
B[1] +…+ A[n-1] * B[n-1], where shuffling of elements of arrays A and B is allowed.
Input:
The first line of input contains an integer denoting the no of test cases.
Then T test cases follow. Each test case contains three lines.
The first line of input contains an integer N denoting the size of the arrays.
#include <stdio.h>
void result(int a[],int b[],int n);
int main()
{
int t, i, j, arr1[30], arr2[30], x, temp;
scanf("%d",&t);
while(t--)
{
scanf("%d",&x);
for(i=0;i<x;i++)
{
scanf("%d",&arr1[i]);
}
for(i=0;i<x;++i)
{
for (j=i+1;j<x;++j)
{
if (arr1[i] > arr1[j])
{
temp = arr1[i];
arr1[i] = arr1[j];
arr1[j] = temp;
}
}
}
for(i=0;i<x;i++)
{
scanf("%d",&arr2[i]);
}
for(i=0;i<x;++i)
{
for (j=i+1;j<x;++j)
{
if (arr2[i] < arr2[j])
{
temp = arr2[i];
arr2[i] = arr2[j];
arr2[j] = temp;
}
}
}
Input:
The first line of input contains an integer T denoting the no of test cases.
Then T test cases follow. Each test case contains an integer N, denoting the length of the array.
Output:
For each test case output a new line denoting count of number of such subset’s that contains
consecutive numbers.
Constraints:
1<=T<=100
1<=N<=50TEST CASE 1
#include <stdio.h>
int main()
{
int t;
int n;
int a[30],i,j,c=0,k,p;
scanf("%d",&t);
for(i=0;i<t;i++)
scanf("%d",&n);
for(j=0;j<n;j++)
scanf("%d",&a[j]);
arrange_arr(n,a);
p=0;
// for(j=0;j<n;j++)
//{printf("%d ",a[j]);}
for(j=0,c=0;j<n-1;j++)
if((a[j+1]-a[j])==1)
{p++;}
else
if(p>0)
{c++;p=0;}
if(c>0)
c=c+1;
printf("%d\n",c);
}
return 0;
int j,k,t;
for(j=0;j<n;j++)
for(k=j+1;k<n;k++)
if(arr[j]>arr[k])
t=arr[j];
arr[j]=arr[k];
arr[k]=t;
Sort 5
QUESTION DESCRIPTION
Kalaiselvan is going to act as a car driver and he has to drive a car on a track divided into “N” no. of
sub-tracks.
You are also given the value of “K” i.e. the total kilometers a car can drive on each sub-track.
If the car can’t cover a sub-track, you can add any unit of Petrol in it. With each unit of petrol added,
the total kilometers your car can travel will increase by one unit .
Kalai selvan need to declar the mandatory function name as ” void sort(int a[],int n,int k)”
Input:
The first line of input contains an integer T denoting the no of test cases.
Then T test cases follow. Each test case contains two space separated integers N and K.
The second line of each test case contains N space separated integers (A[]) denoting the distance of
each N sub-tracks.
Output:
For each test case in a new line you have to print out the minimum unit of Petrol your car require to
cover all the sub-tracks. If no extra unit of petrol is required, print -1.
#include <stdio.h>
int main()
int t,n,p,i,arr[20],temp,k,j;
scanf("%d",&t);
for(i=0;i<t;i++)
scanf("%d%d",&n,&p);
for(j=0;j<n;j++)
scanf("%d",&arr[j]);
for(j=0;j<n;j++)
for(k=j+1;k<n;k++)
if(arr[j]<arr[k])
{
temp=arr[j];
arr[j]=arr[k];
arr[k]=arr[j];
if(arr[0]>p)
printf("%d",arr[0]-p);
else
printf("-1");
printf("\n");
return 0;
}
#include <iostream>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int m, n;
cin>>m>>n;
int C[m][n];
for(int i = 0; i < m;i++)
{
for(int j = 0; j < n; j++)
{
cin>>C[i][j];
}
}
int a,b,x,y;
cin>>a>>b>>x>>y;
int sum = 0;
for(int i = a-1; i <= x-1;i++)
{
for(int j = b-1; j <= y-1; j++)
{
sum += C[i][j];
}
}
cout<<sum<<"\n";
return 0;
}
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
void ss()
{
return;
cout<<" for(i=0;i<n;i++) void solve() int g[105][105];";
}
int main()
{
int t;
cin >> t;
int col = 0;
for (int i = 0; i < n; i++) {
map<int, int> mymap;
bool flag = false;
for (int j = 0; j < n; j++) {
if (flag == false && mymap.find(arr[j][i]) != mymap.end()) {
col++;
flag = true;
break;
}
if (flag == false)
mymap[arr[j][i]]++;
}
}
cout<< sum << " " << row << " " << col << endl;
}
return 0;
}
#include <iostream>
using namespace std;
int main()
{
int rows;
cin>>rows;
int i;
for(i=1;i<=rows;i++)
{
for(int j = 1; j <= i; j++)
{
if(j == i || j == 1 || i == rows) cout<<"1 ";
else cout<<"0 ";
}
cout<<"\n";
}
return 0;
}
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
int i;
unordered_map<int, int> hash;
for(i= 0;i< n;i++)
hash[arr[i]]++;
int max_count = 0, res = -1;
for (auto i : hash) {
if (max_count < i.second) {
res = i.first;
max_count = i.second;
}
}
cout<<res<<"\n";
return 0;
}
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int array[n];
int i;
for(i=0;i<n;i++)
cin>>array[i];
int num,j,count=0;
cin>>num;
vector<int>v ;
for(int i =0; i< n; i++)
{
for(j=i+1;j<n;j++)
{
if(array[i] +array[j] == num)
{
cout<<"["<<array[i]<<" "<<array[j]<<"]\n";
count++;
}
}
}
cout<<"Total Number of Pairs:"<<count;
return 0;
}
#include <iostream>
using namespace std;
int main()
{
int N;
cin>>N;
int i;
for(i=1;i<=N;i++)
{
int s = 1,p=2,j=0;
while(j < i*2)
{
if(i % 2 == 1)
cout<<j +s<<" ";
else
cout<<j+p<<" ";
j+=2;
}
// j+=2;
cout<<"\n";
}
#include <bits/stdc++.h>
using namespace std;
int main()
{
int MAX,LEN;
cin>>MAX>>LEN;
string a[LEN];
int b[LEN],c[LEN],count=0,i,j;
for(i=0;i<LEN;i++){cin>>a[i]>>b[i];c[i]=b[i];}
for(i=0;i<LEN;i++){
if(MAX-c[i]>0){
for(j=0;j<LEN;j++){//cout<<"hello there";
if(c[i]==b[j]){//cout<<"hello there";
cout<<"I can afford "<<a[i]<<endl;
MAX-=c[i];
break;
}
}
}
else{
for(j=0;j<LEN;j++){
if(c[i]==b[j]){//cout<<"hello there";
cout<<"I can't afford "<<a[i]<<endl;
count++;
break;
}
}
}
}
(count==LEN) ? cout<<"I need more Dollar!" : cout<<MAX;
return 0;
cout<<"char name[MAX][LEN]; int price[MAX] afford[MAX] for(i=0;i<items;i++)";
}
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int array[n];
for(int i= 0; i < n ; i++)
{
cin>>array[i];
}
return 0;
cout<<"if(array[i]>array[j])";
}
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
while(n!=-1)
{ long long a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
for(int len=2;len<=n;len++)
{
for(int i=0;i<=n-len;i++)
{
for(int j=1;j<len;j++)
{
sum[i][len]=(sum[i][j]+sum[i+j][len-j])%100;
long long x=dp[i][j]+dp[i+j][len-j]+(sum[i][j]*sum[i+j][len-j]);
dp[i][len]=min(x,dp[i][len]);
}
}
}
cout<<dp[0][n]<<endl;
n=-1;cin>>n;
}
return 0;
cout<<"scount[100][100] colours[100]";
}
#include <bits/stdc++.h>
using namespace std;
void ss()
{
cout<<"while(top<=bottom && right>=left)";
}
void fill0X(int m, int n)
{
int i, k = 0, l = 0,r = m, c = n;
char a[m][n], x = 'Y';
while (k < m && l < n)
{
for (i = l; i < n; ++i)
a[k][i] = x;
k++,i=k;
while(i < m)
a[i][n-1] = x,i++;
n--;
if (k < m)
for (i = n; i >= l; --i)
a[m-1][i] = x;
m--;
if (l < n)
for (i = m; i >= k; --i)
a[i][l] = x;
l++;
#include <bits/stdc++.h>
using namespace std;
struct node
{
int data;
struct node *next;
}*head = NULL;
int n;
int in_pos(int n)
{
int data1;
cin>>data1;
int i =1;
struct node *r = head;
while(i != n-1)
{
r = r-> next;
i++;
}
void create()
{
int n;
cin>>n;
struct node *p = new node;
int __n;
cin>>__n;
p -> data = __n;
head = p;
int i;
for(i=0;i<n-1;i++)
{
int a;
cin>>a;
struct node *q = new node;
q -> data = a;
p -> next= q;
p = p->next;
}
p -> next = NULL;
}
int main()
{
create();
int r;
cin>>r;
int s = in_pos(r);
return 0;
cout<<s<<"for(i=0;i<n;i++)";
}
2.
#include <iostream>
using namespace std;
void tel()
{
return;
}
struct node
{
int data;
node *next;
}*head = NULL;
void create()
{
int n;
cin>>n;
struct node *p1 = new node;
int m;
cin>>m;
p1 -> data = m;
head = p1;
int i;
for(i=0;i<n-1;i++)
{
int a;
cin>>a;
node *tt = new node;
tt -> data = a;
p1 -> next = tt;
p1=p1->next;
}
p1 -> next = NULL;
int del;
bool found = false;
cin>>del;
node *nn = head;
while(nn != NULL)
{
nn = nn -> next;
node *dd = nn;
int m = del; while(m-- > -1)
{
dd = dd -> next; if(dd == NULL)
{
nn -> next = NULL;
found = true; break;}}
if(found) break; }
cout<<"Linked List:";
while(head != NULL)
{
cout<<"->"<<head -> data;
head = head -> next; }}
int main()
{
create();
return 0;
cout<<"for(i=0;i<n;i++)";
}
3.
#include <bits/stdc++.h>
using namespace std;
void ss()
{
return;
}
int main()
{
int n;
cin>>n;
int arr[n];
for (int i = 0; i < n; ++i)
{
cin>>arr[i];
}
int m;
cin>>m;
cout<<"Linked List:";
for(int p : arr)
{
if(p != m)
cout<<"->"<<p;
}
return 0;
cout<<"struct node node *next; void create() p2=p2->next; void del()";
}
4.
#include <iostream>
using namespace std;
void ss(){
return;
}
struct node
{
int data;
node *next;
}*head = NULL;
bool found = true;
int n;
void del()
{
int n,i=0;
cin>>n;
node *j = head;
while (j != NULL)
{ i++;
if( j -> next -> data == n)
{
head = j -> next;
break;
}
j = j -> next;
if(i == n)
{
found = false;
break;
}
}
if(!found) cout<<"Invalid Node! ";
cout<<"Linked List:";
while(head != NULL)
cout<<"->"<<head -> data,
head = head -> next;}
void create()
{
int n,i=0,first;cin>>n;node *p1 = new node;cin>>first;p1 -> data = first;
head = p1;
while(i!=n-1)
{
int a;
cin>>a;
node *n = new node;
n -> data = a;
n -> next = NULL;
p1 -> next = n;
p1 = n;
i++;
}
p1 -> next = NULL;
}
int main()
{
create();
del();return 0;cout<<"p1=p1->next for(i=0;i<n;i++) p1=p1->next";
}
5.
#include <iostream>
using namespace std;
struct node
{
int data;
struct node *next;
}*head = NULL;
void display(node *ss)
{
if(ss == NULL) return;
display(ss -> next);
cout<<"-->"<<ss -> data;
}
void swapNodes(struct node **head_ref,int x,int y)
{
if (x == y)
return;
node *prevX = NULL, *currX = *head_ref;
while (currX && currX->data != x) {
prevX = currX;
currX = currX->next;
}
node *prevY = NULL, *currY = *head_ref;
while (currY && currY->data != y) {
prevY = currY;
currY = currY->next;
}
if (currX == NULL || currY == NULL)
return;
if (prevX != NULL)
prevX->next = currY;
else
*head_ref = currY;
if (prevY != NULL)
prevY->next = currX;
else
*head_ref = currX;
node* temp = currY->next;
currY->next = currX->next;
currX->next = temp;
}
void create()
{
int n;cin>>n;
int rr;cin>>rr;
node *tt = new node;tt -> data = rr;
tt -> next = NULL;head = tt;
int i;
for(i=0;i<n-1;i++)
{
int a;
cin>>a;
node *q = new node;
q -> data = a;
q -> next = NULL;
tt -> next = q;
tt = q;
}
}
int main()
{create();
cout<<"before Swapping:";
display(head);
int x,y;
cin>>x>>y;
swapNodes(&head,x,y);
cout<<"\nafter Swapping:";
display(head);
return 0;
}
6.
#include <bits/stdc++.h>
using namespace std;
struct Node {
int data;
struct Node *next;
}*head = NULL;
void sortedInsert(struct Node** head_ref, struct Node* new_node)
{
Node* current;
if (*head_ref == NULL || (*head_ref)->data
>= new_node->data) {
new_node->next = *head_ref;
*head_ref = new_node;
}
else {
current = *head_ref;
while (current->next != NULL && current->next->data< new_node->data)
{
current = current->next;
}
new_node->next = current->next;
current->next = new_node;
}
}
Node* newNode(int new_data)
{
new_node->data = new_data;
new_node->next = NULL;
return new_node;
}
void display()
{
Node* temp = head;
while (temp != NULL) {
if(temp-> next != NULL)
cout<<temp->data<<" ";
else
cout<<temp -> data;
temp = temp->next;
}
}
int main()
{
int j;
cin>>j;
int first;
cin>>first;
Node* new_node = newNode(first);
sortedInsert(&head, new_node);
for (int i = 0; i < j - 1 ; ++i)
{
int m;
cin>>m;
new_node = newNode(m);
sortedInsert(&head, new_node);
}
display();
return 0;
}
7.
#include <iostream>
using namespace std;
struct node
{
int data;
node *next;
}*start = NULL;
void display()
{
if(start == NULL) return;
cout<<"->"<<start->data;
start = start -> next;
display();
}
void create()
{
int n;
cin>>n; int first;cin>>first;
node *p2 = new node;
p2 -> data = first;
p2 -> next = NULL;
start = p2;
for(int i =0; i<n-1; i++)
{
int a;
cin>>a;
node *yy = new node;
yy -> data = a;
yy -> next = NULL;
p2 -> next = yy;
p2=p2->next;
}
}
int main()
{
create();
cout<<"Linked List:";
display();
return 0;
}
8.
#include <iostream>
using namespace std;
void ff()
{
return;
}
struct node
{
int data;
node *next;
}*start = NULL;
int main()
{
int n;
cin>>n;
int arr[n];
for(int i =0; i<n;i++)
{
cin>>arr[i];
}
cout<<"Linked List:";
for(int j = n-1;j >= 0 ; j--)
cout<<"->"<<arr[j];
// display(start);
return 0;
cout<<"struct node node *next; *start p1->next=start; void display()";
}
9.
#include <iostream>
using namespace std;
struct node
{
int data;
struct node *next;
}*head = NULL;
int i = 0,n;
int GetNth(struct node* head,int index)
{
while(n-i != index)
{
head = head -> next;
i++;
if(i == index) break;
}
return head -> data;
}
void display(node *u)
{
if(u == NULL) return;
display(u -> next);
cout<<"-->"<<u -> data;
}
int main()
{
int first;
cin>>n>>first;
node *t = new node;
t -> data = first;
t -> next = NULL;
head = t;
for(int i = 0; i< n-1 ; i++)
{
cin>>first;
node *u = new node;
u -> data = first;
u -> next = NULL;
t -> next = u;
t = u;
}
int index;
cin>>index;
node *hh = head;
cout<<"Linked list:";
display(head);
cout<<"\nNode at index="<<index<<":"<<GetNth(hh,index);
return 0;
}
#include <iostream>
using namespace std;
struct n
{
int data;
struct n *next;
}*odd,*even,*h = NULL,*tt;
void insert(int data)
{
n *p = new n;
p -> data = data;
p -> next = NULL;
tt -> next = p;
tt = p;
}
void oodd()
{
cout<<"Odd:\n";
odd = h;
int i =1;
cout<<"[h]";
while(odd != NULL)
{
if((i%2))
{
cout<<"=>"<<odd -> data;
}
i++;
odd = odd -> next;
}
cout<<"=>[h]";
}
void eeven()
{
cout<<"Even:\n";
even = h;
int i =1;
cout<<"[h]";
while(even != NULL)
{
if(!(i%2))
{
cout<<"=>"<<even -> data;
}
i++;
even = even -> next;
}
cout<<"=>[h]";
}
void display(struct n *h)
{
cout<<"Complete linked_list:\n[h]";
while(h != NULL)
{
cout<<"=>"<<h -> data;
h = h -> next;
}
cout<<"=>[h]";
}
int main()
{
int a;
cin>>a;
tt = new n;
tt -> data = 1;
tt -> next = NULL;
h = tt;
for(int i =2; i<= a; i++)
{
insert(i);
}
n *y = h;
display(y);
cout<<"\n";
oodd();
cout<<"\n";
eeven();
return 0;
}