haridutt12

#include<stdio.h>
#include<malloc.h>
struct bt
{
    int data;
    struct bt *left;
    struct bt *right;
};

struct bt* create(struct bt *h)

haridutt12

#include<stdio.h>
#include<stdlib.h>
struct node
{
	int no;
	struct node *next;
}*h,*c,*p;


struct stack

haridutt12

#include<stdio.h>
#include<malloc.h>

struct bt
{
    int data;
    struct bt *left;
    struct bt *right;
};

haridutt12

#include<stdio.h>
struct bt
{
    int data;
    struct bt *left;
    struct bt *right;
};

struct bt* create(struct bt *h)
{

haridutt12

#include <iostream>
using namespace std;
 
int main() {
int n;
 cin>>n;
 while(n>0)
 { long int g;
 cin>>g;
 while(g>0)

haridutt12

#include <stdio.h>
#include <malloc.h>
struct bt
{
    int data;
    struct bt *left;
    struct bt *right;
};
//creation of bst

haridutt12

/*Kristen loves playing with and comparing numbers. She thinks that if she takes two different positive numbers, the one whose digits sum to a larger number is better than the other. If the sum of digits is equal for both numbers, then she thinks the smaller number is better. For example, Kristen thinks that  is better than  and that  is better than .

Given an integer, , can you find the divisor of  that Kristin will consider to be the best?

Input Format

A single integer denoting .

Constraints

haridutt12

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>

haridutt12

#include <bits/stdc++.h>
using namespace std;
struct job
{
    int start;
    int end;
};
bool sorting(job const& lhs, job const& rhs)
{
    if (lhs.start != rhs.start)

haridutt12

#include <fstream>
#include <iostream>
#include <limits>
#include <string>
#include <windows.h>
#include <ctime>
#include <bits/stdc++.h>

using namespace std;
template <typename T>